1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2010, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree
; use Atree
;
27 with Casing
; use Casing
;
28 with Checks
; use Checks
;
29 with Debug
; use Debug
;
30 with Errout
; use Errout
;
31 with Elists
; use Elists
;
32 with Exp_Ch11
; use Exp_Ch11
;
33 with Exp_Disp
; use Exp_Disp
;
34 with Exp_Tss
; use Exp_Tss
;
35 with Exp_Util
; use Exp_Util
;
36 with Fname
; use Fname
;
37 with Freeze
; use Freeze
;
39 with Lib
.Xref
; use Lib
.Xref
;
40 with Nlists
; use Nlists
;
41 with Output
; use Output
;
43 with Rtsfind
; use Rtsfind
;
44 with Scans
; use Scans
;
47 with Sem_Aux
; use Sem_Aux
;
48 with Sem_Attr
; use Sem_Attr
;
49 with Sem_Ch8
; use Sem_Ch8
;
50 with Sem_Disp
; use Sem_Disp
;
51 with Sem_Eval
; use Sem_Eval
;
52 with Sem_Res
; use Sem_Res
;
53 with Sem_Type
; use Sem_Type
;
54 with Sinfo
; use Sinfo
;
55 with Sinput
; use Sinput
;
56 with Stand
; use Stand
;
58 with Stringt
; use Stringt
;
60 with Targparm
; use Targparm
;
61 with Tbuild
; use Tbuild
;
62 with Ttypes
; use Ttypes
;
63 with Uname
; use Uname
;
65 with GNAT
.HTable
; use GNAT
.HTable
;
67 package body Sem_Util
is
69 ----------------------------------------
70 -- Global_Variables for New_Copy_Tree --
71 ----------------------------------------
73 -- These global variables are used by New_Copy_Tree. See description
74 -- of the body of this subprogram for details. Global variables can be
75 -- safely used by New_Copy_Tree, since there is no case of a recursive
76 -- call from the processing inside New_Copy_Tree.
78 NCT_Hash_Threshhold
: constant := 20;
79 -- If there are more than this number of pairs of entries in the
80 -- map, then Hash_Tables_Used will be set, and the hash tables will
81 -- be initialized and used for the searches.
83 NCT_Hash_Tables_Used
: Boolean := False;
84 -- Set to True if hash tables are in use
86 NCT_Table_Entries
: Nat
;
87 -- Count entries in table to see if threshhold is reached
89 NCT_Hash_Table_Setup
: Boolean := False;
90 -- Set to True if hash table contains data. We set this True if we
91 -- setup the hash table with data, and leave it set permanently
92 -- from then on, this is a signal that second and subsequent users
93 -- of the hash table must clear the old entries before reuse.
95 subtype NCT_Header_Num
is Int
range 0 .. 511;
96 -- Defines range of headers in hash tables (512 headers)
98 ----------------------------------
99 -- Order Dependence (AI05-0144) --
100 ----------------------------------
102 -- Each actual in a call is entered into the table below. A flag indicates
103 -- whether the corresponding formal is OUT or IN OUT. Each top-level call
104 -- (procedure call, condition, assignment) examines all the actuals for a
105 -- possible order dependence. The table is reset after each such check.
107 type Actual_Name
is record
109 Is_Writable
: Boolean;
110 -- Comments needed???
114 package Actuals_In_Call
is new Table
.Table
(
115 Table_Component_Type
=> Actual_Name
,
116 Table_Index_Type
=> Int
,
117 Table_Low_Bound
=> 0,
119 Table_Increment
=> 100,
120 Table_Name
=> "Actuals");
122 -----------------------
123 -- Local Subprograms --
124 -----------------------
126 function Build_Component_Subtype
129 T
: Entity_Id
) return Node_Id
;
130 -- This function builds the subtype for Build_Actual_Subtype_Of_Component
131 -- and Build_Discriminal_Subtype_Of_Component. C is a list of constraints,
132 -- Loc is the source location, T is the original subtype.
134 function Is_Fully_Initialized_Variant
(Typ
: Entity_Id
) return Boolean;
135 -- Subsidiary to Is_Fully_Initialized_Type. For an unconstrained type
136 -- with discriminants whose default values are static, examine only the
137 -- components in the selected variant to determine whether all of them
140 function Has_Null_Extension
(T
: Entity_Id
) return Boolean;
141 -- T is a derived tagged type. Check whether the type extension is null.
142 -- If the parent type is fully initialized, T can be treated as such.
144 ------------------------------
145 -- Abstract_Interface_List --
146 ------------------------------
148 function Abstract_Interface_List
(Typ
: Entity_Id
) return List_Id
is
152 if Is_Concurrent_Type
(Typ
) then
154 -- If we are dealing with a synchronized subtype, go to the base
155 -- type, whose declaration has the interface list.
157 -- Shouldn't this be Declaration_Node???
159 Nod
:= Parent
(Base_Type
(Typ
));
161 if Nkind
(Nod
) = N_Full_Type_Declaration
then
165 elsif Ekind
(Typ
) = E_Record_Type_With_Private
then
166 if Nkind
(Parent
(Typ
)) = N_Full_Type_Declaration
then
167 Nod
:= Type_Definition
(Parent
(Typ
));
169 elsif Nkind
(Parent
(Typ
)) = N_Private_Type_Declaration
then
170 if Present
(Full_View
(Typ
)) then
171 Nod
:= Type_Definition
(Parent
(Full_View
(Typ
)));
173 -- If the full-view is not available we cannot do anything else
174 -- here (the source has errors).
180 -- Support for generic formals with interfaces is still missing ???
182 elsif Nkind
(Parent
(Typ
)) = N_Formal_Type_Declaration
then
187 (Nkind
(Parent
(Typ
)) = N_Private_Extension_Declaration
);
191 elsif Ekind
(Typ
) = E_Record_Subtype
then
192 Nod
:= Type_Definition
(Parent
(Etype
(Typ
)));
194 elsif Ekind
(Typ
) = E_Record_Subtype_With_Private
then
196 -- Recurse, because parent may still be a private extension. Also
197 -- note that the full view of the subtype or the full view of its
198 -- base type may (both) be unavailable.
200 return Abstract_Interface_List
(Etype
(Typ
));
202 else pragma Assert
((Ekind
(Typ
)) = E_Record_Type
);
203 if Nkind
(Parent
(Typ
)) = N_Formal_Type_Declaration
then
204 Nod
:= Formal_Type_Definition
(Parent
(Typ
));
206 Nod
:= Type_Definition
(Parent
(Typ
));
210 return Interface_List
(Nod
);
211 end Abstract_Interface_List
;
213 --------------------------------
214 -- Add_Access_Type_To_Process --
215 --------------------------------
217 procedure Add_Access_Type_To_Process
(E
: Entity_Id
; A
: Entity_Id
) is
221 Ensure_Freeze_Node
(E
);
222 L
:= Access_Types_To_Process
(Freeze_Node
(E
));
226 Set_Access_Types_To_Process
(Freeze_Node
(E
), L
);
230 end Add_Access_Type_To_Process
;
232 ----------------------------
233 -- Add_Global_Declaration --
234 ----------------------------
236 procedure Add_Global_Declaration
(N
: Node_Id
) is
237 Aux_Node
: constant Node_Id
:= Aux_Decls_Node
(Cunit
(Current_Sem_Unit
));
240 if No
(Declarations
(Aux_Node
)) then
241 Set_Declarations
(Aux_Node
, New_List
);
244 Append_To
(Declarations
(Aux_Node
), N
);
246 end Add_Global_Declaration
;
252 -- For now, just 8/16/32/64. but analyze later if AAMP is special???
254 function Addressable
(V
: Uint
) return Boolean is
256 return V
= Uint_8
or else
262 function Addressable
(V
: Int
) return Boolean is
270 -----------------------
271 -- Alignment_In_Bits --
272 -----------------------
274 function Alignment_In_Bits
(E
: Entity_Id
) return Uint
is
276 return Alignment
(E
) * System_Storage_Unit
;
277 end Alignment_In_Bits
;
279 -----------------------------------------
280 -- Apply_Compile_Time_Constraint_Error --
281 -----------------------------------------
283 procedure Apply_Compile_Time_Constraint_Error
286 Reason
: RT_Exception_Code
;
287 Ent
: Entity_Id
:= Empty
;
288 Typ
: Entity_Id
:= Empty
;
289 Loc
: Source_Ptr
:= No_Location
;
290 Rep
: Boolean := True;
291 Warn
: Boolean := False)
293 Stat
: constant Boolean := Is_Static_Expression
(N
);
294 R_Stat
: constant Node_Id
:=
295 Make_Raise_Constraint_Error
(Sloc
(N
), Reason
=> Reason
);
306 (Compile_Time_Constraint_Error
(N
, Msg
, Ent
, Loc
, Warn
=> Warn
));
312 -- Now we replace the node by an N_Raise_Constraint_Error node
313 -- This does not need reanalyzing, so set it as analyzed now.
316 Set_Analyzed
(N
, True);
319 Set_Raises_Constraint_Error
(N
);
321 -- Now deal with possible local raise handling
323 Possible_Local_Raise
(N
, Standard_Constraint_Error
);
325 -- If the original expression was marked as static, the result is
326 -- still marked as static, but the Raises_Constraint_Error flag is
327 -- always set so that further static evaluation is not attempted.
330 Set_Is_Static_Expression
(N
);
332 end Apply_Compile_Time_Constraint_Error
;
334 --------------------------
335 -- Build_Actual_Subtype --
336 --------------------------
338 function Build_Actual_Subtype
340 N
: Node_Or_Entity_Id
) return Node_Id
343 -- Normally Sloc (N), but may point to corresponding body in some cases
345 Constraints
: List_Id
;
351 Disc_Type
: Entity_Id
;
357 if Nkind
(N
) = N_Defining_Identifier
then
358 Obj
:= New_Reference_To
(N
, Loc
);
360 -- If this is a formal parameter of a subprogram declaration, and
361 -- we are compiling the body, we want the declaration for the
362 -- actual subtype to carry the source position of the body, to
363 -- prevent anomalies in gdb when stepping through the code.
365 if Is_Formal
(N
) then
367 Decl
: constant Node_Id
:= Unit_Declaration_Node
(Scope
(N
));
369 if Nkind
(Decl
) = N_Subprogram_Declaration
370 and then Present
(Corresponding_Body
(Decl
))
372 Loc
:= Sloc
(Corresponding_Body
(Decl
));
381 if Is_Array_Type
(T
) then
382 Constraints
:= New_List
;
383 for J
in 1 .. Number_Dimensions
(T
) loop
385 -- Build an array subtype declaration with the nominal subtype and
386 -- the bounds of the actual. Add the declaration in front of the
387 -- local declarations for the subprogram, for analysis before any
388 -- reference to the formal in the body.
391 Make_Attribute_Reference
(Loc
,
393 Duplicate_Subexpr_No_Checks
(Obj
, Name_Req
=> True),
394 Attribute_Name
=> Name_First
,
395 Expressions
=> New_List
(
396 Make_Integer_Literal
(Loc
, J
)));
399 Make_Attribute_Reference
(Loc
,
401 Duplicate_Subexpr_No_Checks
(Obj
, Name_Req
=> True),
402 Attribute_Name
=> Name_Last
,
403 Expressions
=> New_List
(
404 Make_Integer_Literal
(Loc
, J
)));
406 Append
(Make_Range
(Loc
, Lo
, Hi
), Constraints
);
409 -- If the type has unknown discriminants there is no constrained
410 -- subtype to build. This is never called for a formal or for a
411 -- lhs, so returning the type is ok ???
413 elsif Has_Unknown_Discriminants
(T
) then
417 Constraints
:= New_List
;
419 -- Type T is a generic derived type, inherit the discriminants from
422 if Is_Private_Type
(T
)
423 and then No
(Full_View
(T
))
425 -- T was flagged as an error if it was declared as a formal
426 -- derived type with known discriminants. In this case there
427 -- is no need to look at the parent type since T already carries
428 -- its own discriminants.
430 and then not Error_Posted
(T
)
432 Disc_Type
:= Etype
(Base_Type
(T
));
437 Discr
:= First_Discriminant
(Disc_Type
);
438 while Present
(Discr
) loop
439 Append_To
(Constraints
,
440 Make_Selected_Component
(Loc
,
442 Duplicate_Subexpr_No_Checks
(Obj
),
443 Selector_Name
=> New_Occurrence_Of
(Discr
, Loc
)));
444 Next_Discriminant
(Discr
);
448 Subt
:= Make_Temporary
(Loc
, 'S', Related_Node
=> N
);
449 Set_Is_Internal
(Subt
);
452 Make_Subtype_Declaration
(Loc
,
453 Defining_Identifier
=> Subt
,
454 Subtype_Indication
=>
455 Make_Subtype_Indication
(Loc
,
456 Subtype_Mark
=> New_Reference_To
(T
, Loc
),
458 Make_Index_Or_Discriminant_Constraint
(Loc
,
459 Constraints
=> Constraints
)));
461 Mark_Rewrite_Insertion
(Decl
);
463 end Build_Actual_Subtype
;
465 ---------------------------------------
466 -- Build_Actual_Subtype_Of_Component --
467 ---------------------------------------
469 function Build_Actual_Subtype_Of_Component
471 N
: Node_Id
) return Node_Id
473 Loc
: constant Source_Ptr
:= Sloc
(N
);
474 P
: constant Node_Id
:= Prefix
(N
);
477 Indx_Type
: Entity_Id
;
479 Deaccessed_T
: Entity_Id
;
480 -- This is either a copy of T, or if T is an access type, then it is
481 -- the directly designated type of this access type.
483 function Build_Actual_Array_Constraint
return List_Id
;
484 -- If one or more of the bounds of the component depends on
485 -- discriminants, build actual constraint using the discriminants
488 function Build_Actual_Record_Constraint
return List_Id
;
489 -- Similar to previous one, for discriminated components constrained
490 -- by the discriminant of the enclosing object.
492 -----------------------------------
493 -- Build_Actual_Array_Constraint --
494 -----------------------------------
496 function Build_Actual_Array_Constraint
return List_Id
is
497 Constraints
: constant List_Id
:= New_List
;
505 Indx
:= First_Index
(Deaccessed_T
);
506 while Present
(Indx
) loop
507 Old_Lo
:= Type_Low_Bound
(Etype
(Indx
));
508 Old_Hi
:= Type_High_Bound
(Etype
(Indx
));
510 if Denotes_Discriminant
(Old_Lo
) then
512 Make_Selected_Component
(Loc
,
513 Prefix
=> New_Copy_Tree
(P
),
514 Selector_Name
=> New_Occurrence_Of
(Entity
(Old_Lo
), Loc
));
517 Lo
:= New_Copy_Tree
(Old_Lo
);
519 -- The new bound will be reanalyzed in the enclosing
520 -- declaration. For literal bounds that come from a type
521 -- declaration, the type of the context must be imposed, so
522 -- insure that analysis will take place. For non-universal
523 -- types this is not strictly necessary.
525 Set_Analyzed
(Lo
, False);
528 if Denotes_Discriminant
(Old_Hi
) then
530 Make_Selected_Component
(Loc
,
531 Prefix
=> New_Copy_Tree
(P
),
532 Selector_Name
=> New_Occurrence_Of
(Entity
(Old_Hi
), Loc
));
535 Hi
:= New_Copy_Tree
(Old_Hi
);
536 Set_Analyzed
(Hi
, False);
539 Append
(Make_Range
(Loc
, Lo
, Hi
), Constraints
);
544 end Build_Actual_Array_Constraint
;
546 ------------------------------------
547 -- Build_Actual_Record_Constraint --
548 ------------------------------------
550 function Build_Actual_Record_Constraint
return List_Id
is
551 Constraints
: constant List_Id
:= New_List
;
556 D
:= First_Elmt
(Discriminant_Constraint
(Deaccessed_T
));
557 while Present
(D
) loop
558 if Denotes_Discriminant
(Node
(D
)) then
559 D_Val
:= Make_Selected_Component
(Loc
,
560 Prefix
=> New_Copy_Tree
(P
),
561 Selector_Name
=> New_Occurrence_Of
(Entity
(Node
(D
)), Loc
));
564 D_Val
:= New_Copy_Tree
(Node
(D
));
567 Append
(D_Val
, Constraints
);
572 end Build_Actual_Record_Constraint
;
574 -- Start of processing for Build_Actual_Subtype_Of_Component
577 -- Why the test for Spec_Expression mode here???
579 if In_Spec_Expression
then
582 -- More comments for the rest of this body would be good ???
584 elsif Nkind
(N
) = N_Explicit_Dereference
then
585 if Is_Composite_Type
(T
)
586 and then not Is_Constrained
(T
)
587 and then not (Is_Class_Wide_Type
(T
)
588 and then Is_Constrained
(Root_Type
(T
)))
589 and then not Has_Unknown_Discriminants
(T
)
591 -- If the type of the dereference is already constrained, it is an
594 if Is_Array_Type
(Etype
(N
))
595 and then Is_Constrained
(Etype
(N
))
599 Remove_Side_Effects
(P
);
600 return Build_Actual_Subtype
(T
, N
);
607 if Ekind
(T
) = E_Access_Subtype
then
608 Deaccessed_T
:= Designated_Type
(T
);
613 if Ekind
(Deaccessed_T
) = E_Array_Subtype
then
614 Id
:= First_Index
(Deaccessed_T
);
615 while Present
(Id
) loop
616 Indx_Type
:= Underlying_Type
(Etype
(Id
));
618 if Denotes_Discriminant
(Type_Low_Bound
(Indx_Type
))
620 Denotes_Discriminant
(Type_High_Bound
(Indx_Type
))
622 Remove_Side_Effects
(P
);
624 Build_Component_Subtype
625 (Build_Actual_Array_Constraint
, Loc
, Base_Type
(T
));
631 elsif Is_Composite_Type
(Deaccessed_T
)
632 and then Has_Discriminants
(Deaccessed_T
)
633 and then not Has_Unknown_Discriminants
(Deaccessed_T
)
635 D
:= First_Elmt
(Discriminant_Constraint
(Deaccessed_T
));
636 while Present
(D
) loop
637 if Denotes_Discriminant
(Node
(D
)) then
638 Remove_Side_Effects
(P
);
640 Build_Component_Subtype
(
641 Build_Actual_Record_Constraint
, Loc
, Base_Type
(T
));
648 -- If none of the above, the actual and nominal subtypes are the same
651 end Build_Actual_Subtype_Of_Component
;
653 -----------------------------
654 -- Build_Component_Subtype --
655 -----------------------------
657 function Build_Component_Subtype
660 T
: Entity_Id
) return Node_Id
666 -- Unchecked_Union components do not require component subtypes
668 if Is_Unchecked_Union
(T
) then
672 Subt
:= Make_Temporary
(Loc
, 'S');
673 Set_Is_Internal
(Subt
);
676 Make_Subtype_Declaration
(Loc
,
677 Defining_Identifier
=> Subt
,
678 Subtype_Indication
=>
679 Make_Subtype_Indication
(Loc
,
680 Subtype_Mark
=> New_Reference_To
(Base_Type
(T
), Loc
),
682 Make_Index_Or_Discriminant_Constraint
(Loc
,
685 Mark_Rewrite_Insertion
(Decl
);
687 end Build_Component_Subtype
;
689 ---------------------------
690 -- Build_Default_Subtype --
691 ---------------------------
693 function Build_Default_Subtype
695 N
: Node_Id
) return Entity_Id
697 Loc
: constant Source_Ptr
:= Sloc
(N
);
701 if not Has_Discriminants
(T
) or else Is_Constrained
(T
) then
705 Disc
:= First_Discriminant
(T
);
707 if No
(Discriminant_Default_Value
(Disc
)) then
712 Act
: constant Entity_Id
:= Make_Temporary
(Loc
, 'S');
713 Constraints
: constant List_Id
:= New_List
;
717 while Present
(Disc
) loop
718 Append_To
(Constraints
,
719 New_Copy_Tree
(Discriminant_Default_Value
(Disc
)));
720 Next_Discriminant
(Disc
);
724 Make_Subtype_Declaration
(Loc
,
725 Defining_Identifier
=> Act
,
726 Subtype_Indication
=>
727 Make_Subtype_Indication
(Loc
,
728 Subtype_Mark
=> New_Occurrence_Of
(T
, Loc
),
730 Make_Index_Or_Discriminant_Constraint
(Loc
,
731 Constraints
=> Constraints
)));
733 Insert_Action
(N
, Decl
);
737 end Build_Default_Subtype
;
739 --------------------------------------------
740 -- Build_Discriminal_Subtype_Of_Component --
741 --------------------------------------------
743 function Build_Discriminal_Subtype_Of_Component
744 (T
: Entity_Id
) return Node_Id
746 Loc
: constant Source_Ptr
:= Sloc
(T
);
750 function Build_Discriminal_Array_Constraint
return List_Id
;
751 -- If one or more of the bounds of the component depends on
752 -- discriminants, build actual constraint using the discriminants
755 function Build_Discriminal_Record_Constraint
return List_Id
;
756 -- Similar to previous one, for discriminated components constrained
757 -- by the discriminant of the enclosing object.
759 ----------------------------------------
760 -- Build_Discriminal_Array_Constraint --
761 ----------------------------------------
763 function Build_Discriminal_Array_Constraint
return List_Id
is
764 Constraints
: constant List_Id
:= New_List
;
772 Indx
:= First_Index
(T
);
773 while Present
(Indx
) loop
774 Old_Lo
:= Type_Low_Bound
(Etype
(Indx
));
775 Old_Hi
:= Type_High_Bound
(Etype
(Indx
));
777 if Denotes_Discriminant
(Old_Lo
) then
778 Lo
:= New_Occurrence_Of
(Discriminal
(Entity
(Old_Lo
)), Loc
);
781 Lo
:= New_Copy_Tree
(Old_Lo
);
784 if Denotes_Discriminant
(Old_Hi
) then
785 Hi
:= New_Occurrence_Of
(Discriminal
(Entity
(Old_Hi
)), Loc
);
788 Hi
:= New_Copy_Tree
(Old_Hi
);
791 Append
(Make_Range
(Loc
, Lo
, Hi
), Constraints
);
796 end Build_Discriminal_Array_Constraint
;
798 -----------------------------------------
799 -- Build_Discriminal_Record_Constraint --
800 -----------------------------------------
802 function Build_Discriminal_Record_Constraint
return List_Id
is
803 Constraints
: constant List_Id
:= New_List
;
808 D
:= First_Elmt
(Discriminant_Constraint
(T
));
809 while Present
(D
) loop
810 if Denotes_Discriminant
(Node
(D
)) then
812 New_Occurrence_Of
(Discriminal
(Entity
(Node
(D
))), Loc
);
815 D_Val
:= New_Copy_Tree
(Node
(D
));
818 Append
(D_Val
, Constraints
);
823 end Build_Discriminal_Record_Constraint
;
825 -- Start of processing for Build_Discriminal_Subtype_Of_Component
828 if Ekind
(T
) = E_Array_Subtype
then
829 Id
:= First_Index
(T
);
830 while Present
(Id
) loop
831 if Denotes_Discriminant
(Type_Low_Bound
(Etype
(Id
))) or else
832 Denotes_Discriminant
(Type_High_Bound
(Etype
(Id
)))
834 return Build_Component_Subtype
835 (Build_Discriminal_Array_Constraint
, Loc
, T
);
841 elsif Ekind
(T
) = E_Record_Subtype
842 and then Has_Discriminants
(T
)
843 and then not Has_Unknown_Discriminants
(T
)
845 D
:= First_Elmt
(Discriminant_Constraint
(T
));
846 while Present
(D
) loop
847 if Denotes_Discriminant
(Node
(D
)) then
848 return Build_Component_Subtype
849 (Build_Discriminal_Record_Constraint
, Loc
, T
);
856 -- If none of the above, the actual and nominal subtypes are the same
859 end Build_Discriminal_Subtype_Of_Component
;
861 ------------------------------
862 -- Build_Elaboration_Entity --
863 ------------------------------
865 procedure Build_Elaboration_Entity
(N
: Node_Id
; Spec_Id
: Entity_Id
) is
866 Loc
: constant Source_Ptr
:= Sloc
(N
);
868 Elab_Ent
: Entity_Id
;
870 procedure Set_Package_Name
(Ent
: Entity_Id
);
871 -- Given an entity, sets the fully qualified name of the entity in
872 -- Name_Buffer, with components separated by double underscores. This
873 -- is a recursive routine that climbs the scope chain to Standard.
875 ----------------------
876 -- Set_Package_Name --
877 ----------------------
879 procedure Set_Package_Name
(Ent
: Entity_Id
) is
881 if Scope
(Ent
) /= Standard_Standard
then
882 Set_Package_Name
(Scope
(Ent
));
885 Nam
: constant String := Get_Name_String
(Chars
(Ent
));
887 Name_Buffer
(Name_Len
+ 1) := '_';
888 Name_Buffer
(Name_Len
+ 2) := '_';
889 Name_Buffer
(Name_Len
+ 3 .. Name_Len
+ Nam
'Length + 2) := Nam
;
890 Name_Len
:= Name_Len
+ Nam
'Length + 2;
894 Get_Name_String
(Chars
(Ent
));
896 end Set_Package_Name
;
898 -- Start of processing for Build_Elaboration_Entity
901 -- Ignore if already constructed
903 if Present
(Elaboration_Entity
(Spec_Id
)) then
907 -- Construct name of elaboration entity as xxx_E, where xxx is the unit
908 -- name with dots replaced by double underscore. We have to manually
909 -- construct this name, since it will be elaborated in the outer scope,
910 -- and thus will not have the unit name automatically prepended.
912 Set_Package_Name
(Spec_Id
);
916 Name_Buffer
(Name_Len
+ 1) := '_';
917 Name_Buffer
(Name_Len
+ 2) := 'E';
918 Name_Len
:= Name_Len
+ 2;
920 -- Create elaboration flag
923 Make_Defining_Identifier
(Loc
, Chars
=> Name_Find
);
924 Set_Elaboration_Entity
(Spec_Id
, Elab_Ent
);
927 Make_Object_Declaration
(Loc
,
928 Defining_Identifier
=> Elab_Ent
,
930 New_Occurrence_Of
(Standard_Boolean
, Loc
),
932 New_Occurrence_Of
(Standard_False
, Loc
));
934 Push_Scope
(Standard_Standard
);
935 Add_Global_Declaration
(Decl
);
938 -- Reset True_Constant indication, since we will indeed assign a value
939 -- to the variable in the binder main. We also kill the Current_Value
940 -- and Last_Assignment fields for the same reason.
942 Set_Is_True_Constant
(Elab_Ent
, False);
943 Set_Current_Value
(Elab_Ent
, Empty
);
944 Set_Last_Assignment
(Elab_Ent
, Empty
);
946 -- We do not want any further qualification of the name (if we did
947 -- not do this, we would pick up the name of the generic package
948 -- in the case of a library level generic instantiation).
950 Set_Has_Qualified_Name
(Elab_Ent
);
951 Set_Has_Fully_Qualified_Name
(Elab_Ent
);
952 end Build_Elaboration_Entity
;
954 -----------------------------------
955 -- Cannot_Raise_Constraint_Error --
956 -----------------------------------
958 function Cannot_Raise_Constraint_Error
(Expr
: Node_Id
) return Boolean is
960 if Compile_Time_Known_Value
(Expr
) then
963 elsif Do_Range_Check
(Expr
) then
966 elsif Raises_Constraint_Error
(Expr
) then
974 when N_Expanded_Name
=>
977 when N_Selected_Component
=>
978 return not Do_Discriminant_Check
(Expr
);
980 when N_Attribute_Reference
=>
981 if Do_Overflow_Check
(Expr
) then
984 elsif No
(Expressions
(Expr
)) then
992 N
:= First
(Expressions
(Expr
));
993 while Present
(N
) loop
994 if Cannot_Raise_Constraint_Error
(N
) then
1005 when N_Type_Conversion
=>
1006 if Do_Overflow_Check
(Expr
)
1007 or else Do_Length_Check
(Expr
)
1008 or else Do_Tag_Check
(Expr
)
1013 Cannot_Raise_Constraint_Error
(Expression
(Expr
));
1016 when N_Unchecked_Type_Conversion
=>
1017 return Cannot_Raise_Constraint_Error
(Expression
(Expr
));
1020 if Do_Overflow_Check
(Expr
) then
1024 Cannot_Raise_Constraint_Error
(Right_Opnd
(Expr
));
1031 if Do_Division_Check
(Expr
)
1032 or else Do_Overflow_Check
(Expr
)
1037 Cannot_Raise_Constraint_Error
(Left_Opnd
(Expr
))
1039 Cannot_Raise_Constraint_Error
(Right_Opnd
(Expr
));
1058 N_Op_Shift_Right_Arithmetic |
1062 if Do_Overflow_Check
(Expr
) then
1066 Cannot_Raise_Constraint_Error
(Left_Opnd
(Expr
))
1068 Cannot_Raise_Constraint_Error
(Right_Opnd
(Expr
));
1075 end Cannot_Raise_Constraint_Error
;
1077 -----------------------------------------
1078 -- Check_Dynamically_Tagged_Expression --
1079 -----------------------------------------
1081 procedure Check_Dynamically_Tagged_Expression
1084 Related_Nod
: Node_Id
)
1087 pragma Assert
(Is_Tagged_Type
(Typ
));
1089 -- In order to avoid spurious errors when analyzing the expanded code,
1090 -- this check is done only for nodes that come from source and for
1091 -- actuals of generic instantiations.
1093 if (Comes_From_Source
(Related_Nod
)
1094 or else In_Generic_Actual
(Expr
))
1095 and then (Is_Class_Wide_Type
(Etype
(Expr
))
1096 or else Is_Dynamically_Tagged
(Expr
))
1097 and then Is_Tagged_Type
(Typ
)
1098 and then not Is_Class_Wide_Type
(Typ
)
1100 Error_Msg_N
("dynamically tagged expression not allowed!", Expr
);
1102 end Check_Dynamically_Tagged_Expression
;
1104 --------------------------
1105 -- Check_Fully_Declared --
1106 --------------------------
1108 procedure Check_Fully_Declared
(T
: Entity_Id
; N
: Node_Id
) is
1110 if Ekind
(T
) = E_Incomplete_Type
then
1112 -- Ada 2005 (AI-50217): If the type is available through a limited
1113 -- with_clause, verify that its full view has been analyzed.
1115 if From_With_Type
(T
)
1116 and then Present
(Non_Limited_View
(T
))
1117 and then Ekind
(Non_Limited_View
(T
)) /= E_Incomplete_Type
1119 -- The non-limited view is fully declared
1124 ("premature usage of incomplete}", N
, First_Subtype
(T
));
1127 -- Need comments for these tests ???
1129 elsif Has_Private_Component
(T
)
1130 and then not Is_Generic_Type
(Root_Type
(T
))
1131 and then not In_Spec_Expression
1133 -- Special case: if T is the anonymous type created for a single
1134 -- task or protected object, use the name of the source object.
1136 if Is_Concurrent_Type
(T
)
1137 and then not Comes_From_Source
(T
)
1138 and then Nkind
(N
) = N_Object_Declaration
1140 Error_Msg_NE
("type of& has incomplete component", N
,
1141 Defining_Identifier
(N
));
1145 ("premature usage of incomplete}", N
, First_Subtype
(T
));
1148 end Check_Fully_Declared
;
1150 -------------------------
1151 -- Check_Nested_Access --
1152 -------------------------
1154 procedure Check_Nested_Access
(Ent
: Entity_Id
) is
1155 Scop
: constant Entity_Id
:= Current_Scope
;
1156 Current_Subp
: Entity_Id
;
1157 Enclosing
: Entity_Id
;
1160 -- Currently only enabled for VM back-ends for efficiency, should we
1161 -- enable it more systematically ???
1163 -- Check for Is_Imported needs commenting below ???
1165 if VM_Target
/= No_VM
1166 and then (Ekind
(Ent
) = E_Variable
1168 Ekind
(Ent
) = E_Constant
1170 Ekind
(Ent
) = E_Loop_Parameter
)
1171 and then Scope
(Ent
) /= Empty
1172 and then not Is_Library_Level_Entity
(Ent
)
1173 and then not Is_Imported
(Ent
)
1175 if Is_Subprogram
(Scop
)
1176 or else Is_Generic_Subprogram
(Scop
)
1177 or else Is_Entry
(Scop
)
1179 Current_Subp
:= Scop
;
1181 Current_Subp
:= Current_Subprogram
;
1184 Enclosing
:= Enclosing_Subprogram
(Ent
);
1186 if Enclosing
/= Empty
1187 and then Enclosing
/= Current_Subp
1189 Set_Has_Up_Level_Access
(Ent
, True);
1192 end Check_Nested_Access
;
1194 ----------------------------
1195 -- Check_Order_Dependence --
1196 ----------------------------
1198 procedure Check_Order_Dependence
is
1203 -- This could use comments ???
1205 for J
in 0 .. Actuals_In_Call
.Last
loop
1206 if Actuals_In_Call
.Table
(J
).Is_Writable
then
1207 Act1
:= Actuals_In_Call
.Table
(J
).Act
;
1209 if Nkind
(Act1
) = N_Attribute_Reference
then
1210 Act1
:= Prefix
(Act1
);
1213 for K
in 0 .. Actuals_In_Call
.Last
loop
1215 Act2
:= Actuals_In_Call
.Table
(K
).Act
;
1217 if Nkind
(Act2
) = N_Attribute_Reference
then
1218 Act2
:= Prefix
(Act2
);
1221 if Actuals_In_Call
.Table
(K
).Is_Writable
1228 elsif Denotes_Same_Object
(Act1
, Act2
)
1231 Error_Msg_N
("?,mighty suspicious!!!", Act1
);
1238 Actuals_In_Call
.Set_Last
(0);
1239 end Check_Order_Dependence
;
1241 ------------------------------------------
1242 -- Check_Potentially_Blocking_Operation --
1243 ------------------------------------------
1245 procedure Check_Potentially_Blocking_Operation
(N
: Node_Id
) is
1248 -- N is one of the potentially blocking operations listed in 9.5.1(8).
1249 -- When pragma Detect_Blocking is active, the run time will raise
1250 -- Program_Error. Here we only issue a warning, since we generally
1251 -- support the use of potentially blocking operations in the absence
1254 -- Indirect blocking through a subprogram call cannot be diagnosed
1255 -- statically without interprocedural analysis, so we do not attempt
1258 S
:= Scope
(Current_Scope
);
1259 while Present
(S
) and then S
/= Standard_Standard
loop
1260 if Is_Protected_Type
(S
) then
1262 ("potentially blocking operation in protected operation?", N
);
1269 end Check_Potentially_Blocking_Operation
;
1271 ------------------------------
1272 -- Check_Unprotected_Access --
1273 ------------------------------
1275 procedure Check_Unprotected_Access
1279 Cont_Encl_Typ
: Entity_Id
;
1280 Pref_Encl_Typ
: Entity_Id
;
1282 function Enclosing_Protected_Type
(Obj
: Node_Id
) return Entity_Id
;
1283 -- Check whether Obj is a private component of a protected object.
1284 -- Return the protected type where the component resides, Empty
1287 function Is_Public_Operation
return Boolean;
1288 -- Verify that the enclosing operation is callable from outside the
1289 -- protected object, to minimize false positives.
1291 ------------------------------
1292 -- Enclosing_Protected_Type --
1293 ------------------------------
1295 function Enclosing_Protected_Type
(Obj
: Node_Id
) return Entity_Id
is
1297 if Is_Entity_Name
(Obj
) then
1299 Ent
: Entity_Id
:= Entity
(Obj
);
1302 -- The object can be a renaming of a private component, use
1303 -- the original record component.
1305 if Is_Prival
(Ent
) then
1306 Ent
:= Prival_Link
(Ent
);
1309 if Is_Protected_Type
(Scope
(Ent
)) then
1315 -- For indexed and selected components, recursively check the prefix
1317 if Nkind_In
(Obj
, N_Indexed_Component
, N_Selected_Component
) then
1318 return Enclosing_Protected_Type
(Prefix
(Obj
));
1320 -- The object does not denote a protected component
1325 end Enclosing_Protected_Type
;
1327 -------------------------
1328 -- Is_Public_Operation --
1329 -------------------------
1331 function Is_Public_Operation
return Boolean is
1338 and then S
/= Pref_Encl_Typ
1340 if Scope
(S
) = Pref_Encl_Typ
then
1341 E
:= First_Entity
(Pref_Encl_Typ
);
1343 and then E
/= First_Private_Entity
(Pref_Encl_Typ
)
1356 end Is_Public_Operation
;
1358 -- Start of processing for Check_Unprotected_Access
1361 if Nkind
(Expr
) = N_Attribute_Reference
1362 and then Attribute_Name
(Expr
) = Name_Unchecked_Access
1364 Cont_Encl_Typ
:= Enclosing_Protected_Type
(Context
);
1365 Pref_Encl_Typ
:= Enclosing_Protected_Type
(Prefix
(Expr
));
1367 -- Check whether we are trying to export a protected component to a
1368 -- context with an equal or lower access level.
1370 if Present
(Pref_Encl_Typ
)
1371 and then No
(Cont_Encl_Typ
)
1372 and then Is_Public_Operation
1373 and then Scope_Depth
(Pref_Encl_Typ
) >=
1374 Object_Access_Level
(Context
)
1377 ("?possible unprotected access to protected data", Expr
);
1380 end Check_Unprotected_Access
;
1386 procedure Check_VMS
(Construct
: Node_Id
) is
1388 if not OpenVMS_On_Target
then
1390 ("this construct is allowed only in Open'V'M'S", Construct
);
1394 ------------------------
1395 -- Collect_Interfaces --
1396 ------------------------
1398 procedure Collect_Interfaces
1400 Ifaces_List
: out Elist_Id
;
1401 Exclude_Parents
: Boolean := False;
1402 Use_Full_View
: Boolean := True)
1404 procedure Collect
(Typ
: Entity_Id
);
1405 -- Subsidiary subprogram used to traverse the whole list
1406 -- of directly and indirectly implemented interfaces
1412 procedure Collect
(Typ
: Entity_Id
) is
1413 Ancestor
: Entity_Id
;
1421 -- Handle private types
1424 and then Is_Private_Type
(Typ
)
1425 and then Present
(Full_View
(Typ
))
1427 Full_T
:= Full_View
(Typ
);
1430 -- Include the ancestor if we are generating the whole list of
1431 -- abstract interfaces.
1433 if Etype
(Full_T
) /= Typ
1435 -- Protect the frontend against wrong sources. For example:
1438 -- type A is tagged null record;
1439 -- type B is new A with private;
1440 -- type C is new A with private;
1442 -- type B is new C with null record;
1443 -- type C is new B with null record;
1446 and then Etype
(Full_T
) /= T
1448 Ancestor
:= Etype
(Full_T
);
1451 if Is_Interface
(Ancestor
)
1452 and then not Exclude_Parents
1454 Append_Unique_Elmt
(Ancestor
, Ifaces_List
);
1458 -- Traverse the graph of ancestor interfaces
1460 if Is_Non_Empty_List
(Abstract_Interface_List
(Full_T
)) then
1461 Id
:= First
(Abstract_Interface_List
(Full_T
));
1462 while Present
(Id
) loop
1463 Iface
:= Etype
(Id
);
1465 -- Protect against wrong uses. For example:
1466 -- type I is interface;
1467 -- type O is tagged null record;
1468 -- type Wrong is new I and O with null record; -- ERROR
1470 if Is_Interface
(Iface
) then
1472 and then Etype
(T
) /= T
1473 and then Interface_Present_In_Ancestor
(Etype
(T
), Iface
)
1478 Append_Unique_Elmt
(Iface
, Ifaces_List
);
1487 -- Start of processing for Collect_Interfaces
1490 pragma Assert
(Is_Tagged_Type
(T
) or else Is_Concurrent_Type
(T
));
1491 Ifaces_List
:= New_Elmt_List
;
1493 end Collect_Interfaces
;
1495 ----------------------------------
1496 -- Collect_Interface_Components --
1497 ----------------------------------
1499 procedure Collect_Interface_Components
1500 (Tagged_Type
: Entity_Id
;
1501 Components_List
: out Elist_Id
)
1503 procedure Collect
(Typ
: Entity_Id
);
1504 -- Subsidiary subprogram used to climb to the parents
1510 procedure Collect
(Typ
: Entity_Id
) is
1511 Tag_Comp
: Entity_Id
;
1512 Parent_Typ
: Entity_Id
;
1515 -- Handle private types
1517 if Present
(Full_View
(Etype
(Typ
))) then
1518 Parent_Typ
:= Full_View
(Etype
(Typ
));
1520 Parent_Typ
:= Etype
(Typ
);
1523 if Parent_Typ
/= Typ
1525 -- Protect the frontend against wrong sources. For example:
1528 -- type A is tagged null record;
1529 -- type B is new A with private;
1530 -- type C is new A with private;
1532 -- type B is new C with null record;
1533 -- type C is new B with null record;
1536 and then Parent_Typ
/= Tagged_Type
1538 Collect
(Parent_Typ
);
1541 -- Collect the components containing tags of secondary dispatch
1544 Tag_Comp
:= Next_Tag_Component
(First_Tag_Component
(Typ
));
1545 while Present
(Tag_Comp
) loop
1546 pragma Assert
(Present
(Related_Type
(Tag_Comp
)));
1547 Append_Elmt
(Tag_Comp
, Components_List
);
1549 Tag_Comp
:= Next_Tag_Component
(Tag_Comp
);
1553 -- Start of processing for Collect_Interface_Components
1556 pragma Assert
(Ekind
(Tagged_Type
) = E_Record_Type
1557 and then Is_Tagged_Type
(Tagged_Type
));
1559 Components_List
:= New_Elmt_List
;
1560 Collect
(Tagged_Type
);
1561 end Collect_Interface_Components
;
1563 -----------------------------
1564 -- Collect_Interfaces_Info --
1565 -----------------------------
1567 procedure Collect_Interfaces_Info
1569 Ifaces_List
: out Elist_Id
;
1570 Components_List
: out Elist_Id
;
1571 Tags_List
: out Elist_Id
)
1573 Comps_List
: Elist_Id
;
1574 Comp_Elmt
: Elmt_Id
;
1575 Comp_Iface
: Entity_Id
;
1576 Iface_Elmt
: Elmt_Id
;
1579 function Search_Tag
(Iface
: Entity_Id
) return Entity_Id
;
1580 -- Search for the secondary tag associated with the interface type
1581 -- Iface that is implemented by T.
1587 function Search_Tag
(Iface
: Entity_Id
) return Entity_Id
is
1590 if not Is_CPP_Class
(T
) then
1591 ADT
:= Next_Elmt
(Next_Elmt
(First_Elmt
(Access_Disp_Table
(T
))));
1593 ADT
:= Next_Elmt
(First_Elmt
(Access_Disp_Table
(T
)));
1597 and then Is_Tag
(Node
(ADT
))
1598 and then Related_Type
(Node
(ADT
)) /= Iface
1600 -- Skip secondary dispatch table referencing thunks to user
1601 -- defined primitives covered by this interface.
1603 pragma Assert
(Has_Suffix
(Node
(ADT
), 'P'));
1606 -- Skip secondary dispatch tables of Ada types
1608 if not Is_CPP_Class
(T
) then
1610 -- Skip secondary dispatch table referencing thunks to
1611 -- predefined primitives.
1613 pragma Assert
(Has_Suffix
(Node
(ADT
), 'Y'));
1616 -- Skip secondary dispatch table referencing user-defined
1617 -- primitives covered by this interface.
1619 pragma Assert
(Has_Suffix
(Node
(ADT
), 'D'));
1622 -- Skip secondary dispatch table referencing predefined
1625 pragma Assert
(Has_Suffix
(Node
(ADT
), 'Z'));
1630 pragma Assert
(Is_Tag
(Node
(ADT
)));
1634 -- Start of processing for Collect_Interfaces_Info
1637 Collect_Interfaces
(T
, Ifaces_List
);
1638 Collect_Interface_Components
(T
, Comps_List
);
1640 -- Search for the record component and tag associated with each
1641 -- interface type of T.
1643 Components_List
:= New_Elmt_List
;
1644 Tags_List
:= New_Elmt_List
;
1646 Iface_Elmt
:= First_Elmt
(Ifaces_List
);
1647 while Present
(Iface_Elmt
) loop
1648 Iface
:= Node
(Iface_Elmt
);
1650 -- Associate the primary tag component and the primary dispatch table
1651 -- with all the interfaces that are parents of T
1653 if Is_Ancestor
(Iface
, T
) then
1654 Append_Elmt
(First_Tag_Component
(T
), Components_List
);
1655 Append_Elmt
(Node
(First_Elmt
(Access_Disp_Table
(T
))), Tags_List
);
1657 -- Otherwise search for the tag component and secondary dispatch
1661 Comp_Elmt
:= First_Elmt
(Comps_List
);
1662 while Present
(Comp_Elmt
) loop
1663 Comp_Iface
:= Related_Type
(Node
(Comp_Elmt
));
1665 if Comp_Iface
= Iface
1666 or else Is_Ancestor
(Iface
, Comp_Iface
)
1668 Append_Elmt
(Node
(Comp_Elmt
), Components_List
);
1669 Append_Elmt
(Search_Tag
(Comp_Iface
), Tags_List
);
1673 Next_Elmt
(Comp_Elmt
);
1675 pragma Assert
(Present
(Comp_Elmt
));
1678 Next_Elmt
(Iface_Elmt
);
1680 end Collect_Interfaces_Info
;
1682 ----------------------------------
1683 -- Collect_Primitive_Operations --
1684 ----------------------------------
1686 function Collect_Primitive_Operations
(T
: Entity_Id
) return Elist_Id
is
1687 B_Type
: constant Entity_Id
:= Base_Type
(T
);
1688 B_Decl
: constant Node_Id
:= Original_Node
(Parent
(B_Type
));
1689 B_Scope
: Entity_Id
:= Scope
(B_Type
);
1693 Formal_Derived
: Boolean := False;
1696 function Match
(E
: Entity_Id
) return Boolean;
1697 -- True if E's base type is B_Type, or E is of an anonymous access type
1698 -- and the base type of its designated type is B_Type.
1704 function Match
(E
: Entity_Id
) return Boolean is
1705 Etyp
: Entity_Id
:= Etype
(E
);
1708 if Ekind
(Etyp
) = E_Anonymous_Access_Type
then
1709 Etyp
:= Designated_Type
(Etyp
);
1712 return Base_Type
(Etyp
) = B_Type
;
1715 -- Start of processing for Collect_Primitive_Operations
1718 -- For tagged types, the primitive operations are collected as they
1719 -- are declared, and held in an explicit list which is simply returned.
1721 if Is_Tagged_Type
(B_Type
) then
1722 return Primitive_Operations
(B_Type
);
1724 -- An untagged generic type that is a derived type inherits the
1725 -- primitive operations of its parent type. Other formal types only
1726 -- have predefined operators, which are not explicitly represented.
1728 elsif Is_Generic_Type
(B_Type
) then
1729 if Nkind
(B_Decl
) = N_Formal_Type_Declaration
1730 and then Nkind
(Formal_Type_Definition
(B_Decl
))
1731 = N_Formal_Derived_Type_Definition
1733 Formal_Derived
:= True;
1735 return New_Elmt_List
;
1739 Op_List
:= New_Elmt_List
;
1741 if B_Scope
= Standard_Standard
then
1742 if B_Type
= Standard_String
then
1743 Append_Elmt
(Standard_Op_Concat
, Op_List
);
1745 elsif B_Type
= Standard_Wide_String
then
1746 Append_Elmt
(Standard_Op_Concatw
, Op_List
);
1752 elsif (Is_Package_Or_Generic_Package
(B_Scope
)
1754 Nkind
(Parent
(Declaration_Node
(First_Subtype
(T
)))) /=
1756 or else Is_Derived_Type
(B_Type
)
1758 -- The primitive operations appear after the base type, except
1759 -- if the derivation happens within the private part of B_Scope
1760 -- and the type is a private type, in which case both the type
1761 -- and some primitive operations may appear before the base
1762 -- type, and the list of candidates starts after the type.
1764 if In_Open_Scopes
(B_Scope
)
1765 and then Scope
(T
) = B_Scope
1766 and then In_Private_Part
(B_Scope
)
1768 Id
:= Next_Entity
(T
);
1770 Id
:= Next_Entity
(B_Type
);
1773 while Present
(Id
) loop
1775 -- Note that generic formal subprograms are not
1776 -- considered to be primitive operations and thus
1777 -- are never inherited.
1779 if Is_Overloadable
(Id
)
1780 and then Nkind
(Parent
(Parent
(Id
)))
1781 not in N_Formal_Subprogram_Declaration
1789 Formal
:= First_Formal
(Id
);
1790 while Present
(Formal
) loop
1791 if Match
(Formal
) then
1796 Next_Formal
(Formal
);
1800 -- For a formal derived type, the only primitives are the
1801 -- ones inherited from the parent type. Operations appearing
1802 -- in the package declaration are not primitive for it.
1805 and then (not Formal_Derived
1806 or else Present
(Alias
(Id
)))
1808 -- In the special case of an equality operator aliased to
1809 -- an overriding dispatching equality belonging to the same
1810 -- type, we don't include it in the list of primitives.
1811 -- This avoids inheriting multiple equality operators when
1812 -- deriving from untagged private types whose full type is
1813 -- tagged, which can otherwise cause ambiguities. Note that
1814 -- this should only happen for this kind of untagged parent
1815 -- type, since normally dispatching operations are inherited
1816 -- using the type's Primitive_Operations list.
1818 if Chars
(Id
) = Name_Op_Eq
1819 and then Is_Dispatching_Operation
(Id
)
1820 and then Present
(Alias
(Id
))
1821 and then Is_Overriding_Operation
(Alias
(Id
))
1822 and then Base_Type
(Etype
(First_Entity
(Id
))) =
1823 Base_Type
(Etype
(First_Entity
(Alias
(Id
))))
1827 -- Include the subprogram in the list of primitives
1830 Append_Elmt
(Id
, Op_List
);
1837 -- For a type declared in System, some of its operations may
1838 -- appear in the target-specific extension to System.
1841 and then B_Scope
= RTU_Entity
(System
)
1842 and then Present_System_Aux
1844 B_Scope
:= System_Aux_Id
;
1845 Id
:= First_Entity
(System_Aux_Id
);
1851 end Collect_Primitive_Operations
;
1853 -----------------------------------
1854 -- Compile_Time_Constraint_Error --
1855 -----------------------------------
1857 function Compile_Time_Constraint_Error
1860 Ent
: Entity_Id
:= Empty
;
1861 Loc
: Source_Ptr
:= No_Location
;
1862 Warn
: Boolean := False) return Node_Id
1864 Msgc
: String (1 .. Msg
'Length + 2);
1865 -- Copy of message, with room for possible ? and ! at end
1875 -- A static constraint error in an instance body is not a fatal error.
1876 -- we choose to inhibit the message altogether, because there is no
1877 -- obvious node (for now) on which to post it. On the other hand the
1878 -- offending node must be replaced with a constraint_error in any case.
1880 -- No messages are generated if we already posted an error on this node
1882 if not Error_Posted
(N
) then
1883 if Loc
/= No_Location
then
1889 Msgc
(1 .. Msg
'Length) := Msg
;
1892 -- Message is a warning, even in Ada 95 case
1894 if Msg
(Msg
'Last) = '?' then
1897 -- In Ada 83, all messages are warnings. In the private part and
1898 -- the body of an instance, constraint_checks are only warnings.
1899 -- We also make this a warning if the Warn parameter is set.
1902 or else (Ada_Version
= Ada_83
and then Comes_From_Source
(N
))
1908 elsif In_Instance_Not_Visible
then
1913 -- Otherwise we have a real error message (Ada 95 static case)
1914 -- and we make this an unconditional message. Note that in the
1915 -- warning case we do not make the message unconditional, it seems
1916 -- quite reasonable to delete messages like this (about exceptions
1917 -- that will be raised) in dead code.
1925 -- Should we generate a warning? The answer is not quite yes. The
1926 -- very annoying exception occurs in the case of a short circuit
1927 -- operator where the left operand is static and decisive. Climb
1928 -- parents to see if that is the case we have here. Conditional
1929 -- expressions with decisive conditions are a similar situation.
1937 -- And then with False as left operand
1939 if Nkind
(P
) = N_And_Then
1940 and then Compile_Time_Known_Value
(Left_Opnd
(P
))
1941 and then Is_False
(Expr_Value
(Left_Opnd
(P
)))
1946 -- OR ELSE with True as left operand
1948 elsif Nkind
(P
) = N_Or_Else
1949 and then Compile_Time_Known_Value
(Left_Opnd
(P
))
1950 and then Is_True
(Expr_Value
(Left_Opnd
(P
)))
1955 -- Conditional expression
1957 elsif Nkind
(P
) = N_Conditional_Expression
then
1959 Cond
: constant Node_Id
:= First
(Expressions
(P
));
1960 Texp
: constant Node_Id
:= Next
(Cond
);
1961 Fexp
: constant Node_Id
:= Next
(Texp
);
1964 if Compile_Time_Known_Value
(Cond
) then
1966 -- Condition is True and we are in the right operand
1968 if Is_True
(Expr_Value
(Cond
))
1969 and then OldP
= Fexp
1974 -- Condition is False and we are in the left operand
1976 elsif Is_False
(Expr_Value
(Cond
))
1977 and then OldP
= Texp
1985 -- Special case for component association in aggregates, where
1986 -- we want to keep climbing up to the parent aggregate.
1988 elsif Nkind
(P
) = N_Component_Association
1989 and then Nkind
(Parent
(P
)) = N_Aggregate
1993 -- Keep going if within subexpression
1996 exit when Nkind
(P
) not in N_Subexpr
;
2001 if Present
(Ent
) then
2002 Error_Msg_NEL
(Msgc
(1 .. Msgl
), N
, Ent
, Eloc
);
2004 Error_Msg_NEL
(Msgc
(1 .. Msgl
), N
, Etype
(N
), Eloc
);
2008 if Inside_Init_Proc
then
2010 ("\?& will be raised for objects of this type",
2011 N
, Standard_Constraint_Error
, Eloc
);
2014 ("\?& will be raised at run time",
2015 N
, Standard_Constraint_Error
, Eloc
);
2020 ("\static expression fails Constraint_Check", Eloc
);
2021 Set_Error_Posted
(N
);
2027 end Compile_Time_Constraint_Error
;
2029 -----------------------
2030 -- Conditional_Delay --
2031 -----------------------
2033 procedure Conditional_Delay
(New_Ent
, Old_Ent
: Entity_Id
) is
2035 if Has_Delayed_Freeze
(Old_Ent
) and then not Is_Frozen
(Old_Ent
) then
2036 Set_Has_Delayed_Freeze
(New_Ent
);
2038 end Conditional_Delay
;
2040 -------------------------
2041 -- Copy_Parameter_List --
2042 -------------------------
2044 function Copy_Parameter_List
(Subp_Id
: Entity_Id
) return List_Id
is
2045 Loc
: constant Source_Ptr
:= Sloc
(Subp_Id
);
2050 if No
(First_Formal
(Subp_Id
)) then
2054 Formal
:= First_Formal
(Subp_Id
);
2055 while Present
(Formal
) loop
2057 (Make_Parameter_Specification
(Loc
,
2058 Defining_Identifier
=>
2059 Make_Defining_Identifier
(Sloc
(Formal
),
2060 Chars
=> Chars
(Formal
)),
2061 In_Present
=> In_Present
(Parent
(Formal
)),
2062 Out_Present
=> Out_Present
(Parent
(Formal
)),
2064 New_Reference_To
(Etype
(Formal
), Loc
),
2066 New_Copy_Tree
(Expression
(Parent
(Formal
)))),
2069 Next_Formal
(Formal
);
2074 end Copy_Parameter_List
;
2076 --------------------
2077 -- Current_Entity --
2078 --------------------
2080 -- The currently visible definition for a given identifier is the
2081 -- one most chained at the start of the visibility chain, i.e. the
2082 -- one that is referenced by the Node_Id value of the name of the
2083 -- given identifier.
2085 function Current_Entity
(N
: Node_Id
) return Entity_Id
is
2087 return Get_Name_Entity_Id
(Chars
(N
));
2090 -----------------------------
2091 -- Current_Entity_In_Scope --
2092 -----------------------------
2094 function Current_Entity_In_Scope
(N
: Node_Id
) return Entity_Id
is
2096 CS
: constant Entity_Id
:= Current_Scope
;
2098 Transient_Case
: constant Boolean := Scope_Is_Transient
;
2101 E
:= Get_Name_Entity_Id
(Chars
(N
));
2103 and then Scope
(E
) /= CS
2104 and then (not Transient_Case
or else Scope
(E
) /= Scope
(CS
))
2110 end Current_Entity_In_Scope
;
2116 function Current_Scope
return Entity_Id
is
2118 if Scope_Stack
.Last
= -1 then
2119 return Standard_Standard
;
2122 C
: constant Entity_Id
:=
2123 Scope_Stack
.Table
(Scope_Stack
.Last
).Entity
;
2128 return Standard_Standard
;
2134 ------------------------
2135 -- Current_Subprogram --
2136 ------------------------
2138 function Current_Subprogram
return Entity_Id
is
2139 Scop
: constant Entity_Id
:= Current_Scope
;
2141 if Is_Subprogram
(Scop
) or else Is_Generic_Subprogram
(Scop
) then
2144 return Enclosing_Subprogram
(Scop
);
2146 end Current_Subprogram
;
2148 ---------------------
2149 -- Defining_Entity --
2150 ---------------------
2152 function Defining_Entity
(N
: Node_Id
) return Entity_Id
is
2153 K
: constant Node_Kind
:= Nkind
(N
);
2154 Err
: Entity_Id
:= Empty
;
2159 N_Subprogram_Declaration |
2160 N_Abstract_Subprogram_Declaration |
2162 N_Package_Declaration |
2163 N_Subprogram_Renaming_Declaration |
2164 N_Subprogram_Body_Stub |
2165 N_Generic_Subprogram_Declaration |
2166 N_Generic_Package_Declaration |
2167 N_Formal_Subprogram_Declaration
2169 return Defining_Entity
(Specification
(N
));
2172 N_Component_Declaration |
2173 N_Defining_Program_Unit_Name |
2174 N_Discriminant_Specification |
2176 N_Entry_Declaration |
2177 N_Entry_Index_Specification |
2178 N_Exception_Declaration |
2179 N_Exception_Renaming_Declaration |
2180 N_Formal_Object_Declaration |
2181 N_Formal_Package_Declaration |
2182 N_Formal_Type_Declaration |
2183 N_Full_Type_Declaration |
2184 N_Implicit_Label_Declaration |
2185 N_Incomplete_Type_Declaration |
2186 N_Loop_Parameter_Specification |
2187 N_Number_Declaration |
2188 N_Object_Declaration |
2189 N_Object_Renaming_Declaration |
2190 N_Package_Body_Stub |
2191 N_Parameter_Specification |
2192 N_Private_Extension_Declaration |
2193 N_Private_Type_Declaration |
2195 N_Protected_Body_Stub |
2196 N_Protected_Type_Declaration |
2197 N_Single_Protected_Declaration |
2198 N_Single_Task_Declaration |
2199 N_Subtype_Declaration |
2202 N_Task_Type_Declaration
2204 return Defining_Identifier
(N
);
2207 return Defining_Entity
(Proper_Body
(N
));
2210 N_Function_Instantiation |
2211 N_Function_Specification |
2212 N_Generic_Function_Renaming_Declaration |
2213 N_Generic_Package_Renaming_Declaration |
2214 N_Generic_Procedure_Renaming_Declaration |
2216 N_Package_Instantiation |
2217 N_Package_Renaming_Declaration |
2218 N_Package_Specification |
2219 N_Procedure_Instantiation |
2220 N_Procedure_Specification
2223 Nam
: constant Node_Id
:= Defining_Unit_Name
(N
);
2226 if Nkind
(Nam
) in N_Entity
then
2229 -- For Error, make up a name and attach to declaration
2230 -- so we can continue semantic analysis
2232 elsif Nam
= Error
then
2233 Err
:= Make_Temporary
(Sloc
(N
), 'T');
2234 Set_Defining_Unit_Name
(N
, Err
);
2237 -- If not an entity, get defining identifier
2240 return Defining_Identifier
(Nam
);
2244 when N_Block_Statement
=>
2245 return Entity
(Identifier
(N
));
2248 raise Program_Error
;
2251 end Defining_Entity
;
2253 --------------------------
2254 -- Denotes_Discriminant --
2255 --------------------------
2257 function Denotes_Discriminant
2259 Check_Concurrent
: Boolean := False) return Boolean
2263 if not Is_Entity_Name
(N
)
2264 or else No
(Entity
(N
))
2271 -- If we are checking for a protected type, the discriminant may have
2272 -- been rewritten as the corresponding discriminal of the original type
2273 -- or of the corresponding concurrent record, depending on whether we
2274 -- are in the spec or body of the protected type.
2276 return Ekind
(E
) = E_Discriminant
2279 and then Ekind
(E
) = E_In_Parameter
2280 and then Present
(Discriminal_Link
(E
))
2282 (Is_Concurrent_Type
(Scope
(Discriminal_Link
(E
)))
2284 Is_Concurrent_Record_Type
(Scope
(Discriminal_Link
(E
)))));
2286 end Denotes_Discriminant
;
2288 -------------------------
2289 -- Denotes_Same_Object --
2290 -------------------------
2292 function Denotes_Same_Object
(A1
, A2
: Node_Id
) return Boolean is
2294 -- If we have entity names, then must be same entity
2296 if Is_Entity_Name
(A1
) then
2297 if Is_Entity_Name
(A2
) then
2298 return Entity
(A1
) = Entity
(A2
);
2303 -- No match if not same node kind
2305 elsif Nkind
(A1
) /= Nkind
(A2
) then
2308 -- For selected components, must have same prefix and selector
2310 elsif Nkind
(A1
) = N_Selected_Component
then
2311 return Denotes_Same_Object
(Prefix
(A1
), Prefix
(A2
))
2313 Entity
(Selector_Name
(A1
)) = Entity
(Selector_Name
(A2
));
2315 -- For explicit dereferences, prefixes must be same
2317 elsif Nkind
(A1
) = N_Explicit_Dereference
then
2318 return Denotes_Same_Object
(Prefix
(A1
), Prefix
(A2
));
2320 -- For indexed components, prefixes and all subscripts must be the same
2322 elsif Nkind
(A1
) = N_Indexed_Component
then
2323 if Denotes_Same_Object
(Prefix
(A1
), Prefix
(A2
)) then
2329 Indx1
:= First
(Expressions
(A1
));
2330 Indx2
:= First
(Expressions
(A2
));
2331 while Present
(Indx1
) loop
2333 -- Shouldn't we be checking that values are the same???
2335 if not Denotes_Same_Object
(Indx1
, Indx2
) then
2349 -- For slices, prefixes must match and bounds must match
2351 elsif Nkind
(A1
) = N_Slice
2352 and then Denotes_Same_Object
(Prefix
(A1
), Prefix
(A2
))
2355 Lo1
, Lo2
, Hi1
, Hi2
: Node_Id
;
2358 Get_Index_Bounds
(Etype
(A1
), Lo1
, Hi1
);
2359 Get_Index_Bounds
(Etype
(A2
), Lo2
, Hi2
);
2361 -- Check whether bounds are statically identical. There is no
2362 -- attempt to detect partial overlap of slices.
2364 -- What about an array and a slice of an array???
2366 return Denotes_Same_Object
(Lo1
, Lo2
)
2367 and then Denotes_Same_Object
(Hi1
, Hi2
);
2370 -- Literals will appear as indices. Isn't this where we should check
2371 -- Known_At_Compile_Time at least if we are generating warnings ???
2373 elsif Nkind
(A1
) = N_Integer_Literal
then
2374 return Intval
(A1
) = Intval
(A2
);
2379 end Denotes_Same_Object
;
2381 -------------------------
2382 -- Denotes_Same_Prefix --
2383 -------------------------
2385 function Denotes_Same_Prefix
(A1
, A2
: Node_Id
) return Boolean is
2388 if Is_Entity_Name
(A1
) then
2389 if Nkind_In
(A2
, N_Selected_Component
, N_Indexed_Component
)
2390 and then not Is_Access_Type
(Etype
(A1
))
2392 return Denotes_Same_Object
(A1
, Prefix
(A2
))
2393 or else Denotes_Same_Prefix
(A1
, Prefix
(A2
));
2398 elsif Is_Entity_Name
(A2
) then
2399 return Denotes_Same_Prefix
(A2
, A1
);
2401 elsif Nkind_In
(A1
, N_Selected_Component
, N_Indexed_Component
, N_Slice
)
2403 Nkind_In
(A2
, N_Selected_Component
, N_Indexed_Component
, N_Slice
)
2406 Root1
, Root2
: Node_Id
;
2407 Depth1
, Depth2
: Int
:= 0;
2410 Root1
:= Prefix
(A1
);
2411 while not Is_Entity_Name
(Root1
) loop
2413 (Root1
, N_Selected_Component
, N_Indexed_Component
)
2417 Root1
:= Prefix
(Root1
);
2420 Depth1
:= Depth1
+ 1;
2423 Root2
:= Prefix
(A2
);
2424 while not Is_Entity_Name
(Root2
) loop
2426 (Root2
, N_Selected_Component
, N_Indexed_Component
)
2430 Root2
:= Prefix
(Root2
);
2433 Depth2
:= Depth2
+ 1;
2436 -- If both have the same depth and they do not denote the same
2437 -- object, they are disjoint and not warning is needed.
2439 if Depth1
= Depth2
then
2442 elsif Depth1
> Depth2
then
2443 Root1
:= Prefix
(A1
);
2444 for I
in 1 .. Depth1
- Depth2
- 1 loop
2445 Root1
:= Prefix
(Root1
);
2448 return Denotes_Same_Object
(Root1
, A2
);
2451 Root2
:= Prefix
(A2
);
2452 for I
in 1 .. Depth2
- Depth1
- 1 loop
2453 Root2
:= Prefix
(Root2
);
2456 return Denotes_Same_Object
(A1
, Root2
);
2463 end Denotes_Same_Prefix
;
2465 ----------------------
2466 -- Denotes_Variable --
2467 ----------------------
2469 function Denotes_Variable
(N
: Node_Id
) return Boolean is
2471 return Is_Variable
(N
) and then Paren_Count
(N
) = 0;
2472 end Denotes_Variable
;
2474 -----------------------------
2475 -- Depends_On_Discriminant --
2476 -----------------------------
2478 function Depends_On_Discriminant
(N
: Node_Id
) return Boolean is
2483 Get_Index_Bounds
(N
, L
, H
);
2484 return Denotes_Discriminant
(L
) or else Denotes_Discriminant
(H
);
2485 end Depends_On_Discriminant
;
2487 -------------------------
2488 -- Designate_Same_Unit --
2489 -------------------------
2491 function Designate_Same_Unit
2493 Name2
: Node_Id
) return Boolean
2495 K1
: constant Node_Kind
:= Nkind
(Name1
);
2496 K2
: constant Node_Kind
:= Nkind
(Name2
);
2498 function Prefix_Node
(N
: Node_Id
) return Node_Id
;
2499 -- Returns the parent unit name node of a defining program unit name
2500 -- or the prefix if N is a selected component or an expanded name.
2502 function Select_Node
(N
: Node_Id
) return Node_Id
;
2503 -- Returns the defining identifier node of a defining program unit
2504 -- name or the selector node if N is a selected component or an
2511 function Prefix_Node
(N
: Node_Id
) return Node_Id
is
2513 if Nkind
(N
) = N_Defining_Program_Unit_Name
then
2525 function Select_Node
(N
: Node_Id
) return Node_Id
is
2527 if Nkind
(N
) = N_Defining_Program_Unit_Name
then
2528 return Defining_Identifier
(N
);
2531 return Selector_Name
(N
);
2535 -- Start of processing for Designate_Next_Unit
2538 if (K1
= N_Identifier
or else
2539 K1
= N_Defining_Identifier
)
2541 (K2
= N_Identifier
or else
2542 K2
= N_Defining_Identifier
)
2544 return Chars
(Name1
) = Chars
(Name2
);
2547 (K1
= N_Expanded_Name
or else
2548 K1
= N_Selected_Component
or else
2549 K1
= N_Defining_Program_Unit_Name
)
2551 (K2
= N_Expanded_Name
or else
2552 K2
= N_Selected_Component
or else
2553 K2
= N_Defining_Program_Unit_Name
)
2556 (Chars
(Select_Node
(Name1
)) = Chars
(Select_Node
(Name2
)))
2558 Designate_Same_Unit
(Prefix_Node
(Name1
), Prefix_Node
(Name2
));
2563 end Designate_Same_Unit
;
2565 --------------------------
2566 -- Enclosing_CPP_Parent --
2567 --------------------------
2569 function Enclosing_CPP_Parent
(Typ
: Entity_Id
) return Entity_Id
is
2570 Parent_Typ
: Entity_Id
:= Typ
;
2573 while not Is_CPP_Class
(Parent_Typ
)
2574 and then Etype
(Parent_Typ
) /= Parent_Typ
2576 Parent_Typ
:= Etype
(Parent_Typ
);
2578 if Is_Private_Type
(Parent_Typ
) then
2579 Parent_Typ
:= Full_View
(Base_Type
(Parent_Typ
));
2583 pragma Assert
(Is_CPP_Class
(Parent_Typ
));
2585 end Enclosing_CPP_Parent
;
2587 ----------------------------
2588 -- Enclosing_Generic_Body --
2589 ----------------------------
2591 function Enclosing_Generic_Body
2592 (N
: Node_Id
) return Node_Id
2600 while Present
(P
) loop
2601 if Nkind
(P
) = N_Package_Body
2602 or else Nkind
(P
) = N_Subprogram_Body
2604 Spec
:= Corresponding_Spec
(P
);
2606 if Present
(Spec
) then
2607 Decl
:= Unit_Declaration_Node
(Spec
);
2609 if Nkind
(Decl
) = N_Generic_Package_Declaration
2610 or else Nkind
(Decl
) = N_Generic_Subprogram_Declaration
2621 end Enclosing_Generic_Body
;
2623 ----------------------------
2624 -- Enclosing_Generic_Unit --
2625 ----------------------------
2627 function Enclosing_Generic_Unit
2628 (N
: Node_Id
) return Node_Id
2636 while Present
(P
) loop
2637 if Nkind
(P
) = N_Generic_Package_Declaration
2638 or else Nkind
(P
) = N_Generic_Subprogram_Declaration
2642 elsif Nkind
(P
) = N_Package_Body
2643 or else Nkind
(P
) = N_Subprogram_Body
2645 Spec
:= Corresponding_Spec
(P
);
2647 if Present
(Spec
) then
2648 Decl
:= Unit_Declaration_Node
(Spec
);
2650 if Nkind
(Decl
) = N_Generic_Package_Declaration
2651 or else Nkind
(Decl
) = N_Generic_Subprogram_Declaration
2662 end Enclosing_Generic_Unit
;
2664 -------------------------------
2665 -- Enclosing_Lib_Unit_Entity --
2666 -------------------------------
2668 function Enclosing_Lib_Unit_Entity
return Entity_Id
is
2669 Unit_Entity
: Entity_Id
;
2672 -- Look for enclosing library unit entity by following scope links.
2673 -- Equivalent to, but faster than indexing through the scope stack.
2675 Unit_Entity
:= Current_Scope
;
2676 while (Present
(Scope
(Unit_Entity
))
2677 and then Scope
(Unit_Entity
) /= Standard_Standard
)
2678 and not Is_Child_Unit
(Unit_Entity
)
2680 Unit_Entity
:= Scope
(Unit_Entity
);
2684 end Enclosing_Lib_Unit_Entity
;
2686 -----------------------------
2687 -- Enclosing_Lib_Unit_Node --
2688 -----------------------------
2690 function Enclosing_Lib_Unit_Node
(N
: Node_Id
) return Node_Id
is
2691 Current_Node
: Node_Id
;
2695 while Present
(Current_Node
)
2696 and then Nkind
(Current_Node
) /= N_Compilation_Unit
2698 Current_Node
:= Parent
(Current_Node
);
2701 if Nkind
(Current_Node
) /= N_Compilation_Unit
then
2705 return Current_Node
;
2706 end Enclosing_Lib_Unit_Node
;
2708 --------------------------
2709 -- Enclosing_Subprogram --
2710 --------------------------
2712 function Enclosing_Subprogram
(E
: Entity_Id
) return Entity_Id
is
2713 Dynamic_Scope
: constant Entity_Id
:= Enclosing_Dynamic_Scope
(E
);
2716 if Dynamic_Scope
= Standard_Standard
then
2719 elsif Dynamic_Scope
= Empty
then
2722 elsif Ekind
(Dynamic_Scope
) = E_Subprogram_Body
then
2723 return Corresponding_Spec
(Parent
(Parent
(Dynamic_Scope
)));
2725 elsif Ekind
(Dynamic_Scope
) = E_Block
2726 or else Ekind
(Dynamic_Scope
) = E_Return_Statement
2728 return Enclosing_Subprogram
(Dynamic_Scope
);
2730 elsif Ekind
(Dynamic_Scope
) = E_Task_Type
then
2731 return Get_Task_Body_Procedure
(Dynamic_Scope
);
2733 elsif Ekind
(Dynamic_Scope
) = E_Limited_Private_Type
2734 and then Present
(Full_View
(Dynamic_Scope
))
2735 and then Ekind
(Full_View
(Dynamic_Scope
)) = E_Task_Type
2737 return Get_Task_Body_Procedure
(Full_View
(Dynamic_Scope
));
2739 -- No body is generated if the protected operation is eliminated
2741 elsif Convention
(Dynamic_Scope
) = Convention_Protected
2742 and then not Is_Eliminated
(Dynamic_Scope
)
2743 and then Present
(Protected_Body_Subprogram
(Dynamic_Scope
))
2745 return Protected_Body_Subprogram
(Dynamic_Scope
);
2748 return Dynamic_Scope
;
2750 end Enclosing_Subprogram
;
2752 ------------------------
2753 -- Ensure_Freeze_Node --
2754 ------------------------
2756 procedure Ensure_Freeze_Node
(E
: Entity_Id
) is
2760 if No
(Freeze_Node
(E
)) then
2761 FN
:= Make_Freeze_Entity
(Sloc
(E
));
2762 Set_Has_Delayed_Freeze
(E
);
2763 Set_Freeze_Node
(E
, FN
);
2764 Set_Access_Types_To_Process
(FN
, No_Elist
);
2765 Set_TSS_Elist
(FN
, No_Elist
);
2768 end Ensure_Freeze_Node
;
2774 procedure Enter_Name
(Def_Id
: Entity_Id
) is
2775 C
: constant Entity_Id
:= Current_Entity
(Def_Id
);
2776 E
: constant Entity_Id
:= Current_Entity_In_Scope
(Def_Id
);
2777 S
: constant Entity_Id
:= Current_Scope
;
2780 Generate_Definition
(Def_Id
);
2782 -- Add new name to current scope declarations. Check for duplicate
2783 -- declaration, which may or may not be a genuine error.
2787 -- Case of previous entity entered because of a missing declaration
2788 -- or else a bad subtype indication. Best is to use the new entity,
2789 -- and make the previous one invisible.
2791 if Etype
(E
) = Any_Type
then
2792 Set_Is_Immediately_Visible
(E
, False);
2794 -- Case of renaming declaration constructed for package instances.
2795 -- if there is an explicit declaration with the same identifier,
2796 -- the renaming is not immediately visible any longer, but remains
2797 -- visible through selected component notation.
2799 elsif Nkind
(Parent
(E
)) = N_Package_Renaming_Declaration
2800 and then not Comes_From_Source
(E
)
2802 Set_Is_Immediately_Visible
(E
, False);
2804 -- The new entity may be the package renaming, which has the same
2805 -- same name as a generic formal which has been seen already.
2807 elsif Nkind
(Parent
(Def_Id
)) = N_Package_Renaming_Declaration
2808 and then not Comes_From_Source
(Def_Id
)
2810 Set_Is_Immediately_Visible
(E
, False);
2812 -- For a fat pointer corresponding to a remote access to subprogram,
2813 -- we use the same identifier as the RAS type, so that the proper
2814 -- name appears in the stub. This type is only retrieved through
2815 -- the RAS type and never by visibility, and is not added to the
2816 -- visibility list (see below).
2818 elsif Nkind
(Parent
(Def_Id
)) = N_Full_Type_Declaration
2819 and then Present
(Corresponding_Remote_Type
(Def_Id
))
2823 -- A controller component for a type extension overrides the
2824 -- inherited component.
2826 elsif Chars
(E
) = Name_uController
then
2829 -- Case of an implicit operation or derived literal. The new entity
2830 -- hides the implicit one, which is removed from all visibility,
2831 -- i.e. the entity list of its scope, and homonym chain of its name.
2833 elsif (Is_Overloadable
(E
) and then Is_Inherited_Operation
(E
))
2834 or else Is_Internal
(E
)
2838 Prev_Vis
: Entity_Id
;
2839 Decl
: constant Node_Id
:= Parent
(E
);
2842 -- If E is an implicit declaration, it cannot be the first
2843 -- entity in the scope.
2845 Prev
:= First_Entity
(Current_Scope
);
2846 while Present
(Prev
)
2847 and then Next_Entity
(Prev
) /= E
2854 -- If E is not on the entity chain of the current scope,
2855 -- it is an implicit declaration in the generic formal
2856 -- part of a generic subprogram. When analyzing the body,
2857 -- the generic formals are visible but not on the entity
2858 -- chain of the subprogram. The new entity will become
2859 -- the visible one in the body.
2862 (Nkind
(Parent
(Decl
)) = N_Generic_Subprogram_Declaration
);
2866 Set_Next_Entity
(Prev
, Next_Entity
(E
));
2868 if No
(Next_Entity
(Prev
)) then
2869 Set_Last_Entity
(Current_Scope
, Prev
);
2872 if E
= Current_Entity
(E
) then
2876 Prev_Vis
:= Current_Entity
(E
);
2877 while Homonym
(Prev_Vis
) /= E
loop
2878 Prev_Vis
:= Homonym
(Prev_Vis
);
2882 if Present
(Prev_Vis
) then
2884 -- Skip E in the visibility chain
2886 Set_Homonym
(Prev_Vis
, Homonym
(E
));
2889 Set_Name_Entity_Id
(Chars
(E
), Homonym
(E
));
2894 -- This section of code could use a comment ???
2896 elsif Present
(Etype
(E
))
2897 and then Is_Concurrent_Type
(Etype
(E
))
2902 -- If the homograph is a protected component renaming, it should not
2903 -- be hiding the current entity. Such renamings are treated as weak
2906 elsif Is_Prival
(E
) then
2907 Set_Is_Immediately_Visible
(E
, False);
2909 -- In this case the current entity is a protected component renaming.
2910 -- Perform minimal decoration by setting the scope and return since
2911 -- the prival should not be hiding other visible entities.
2913 elsif Is_Prival
(Def_Id
) then
2914 Set_Scope
(Def_Id
, Current_Scope
);
2917 -- Analogous to privals, the discriminal generated for an entry
2918 -- index parameter acts as a weak declaration. Perform minimal
2919 -- decoration to avoid bogus errors.
2921 elsif Is_Discriminal
(Def_Id
)
2922 and then Ekind
(Discriminal_Link
(Def_Id
)) = E_Entry_Index_Parameter
2924 Set_Scope
(Def_Id
, Current_Scope
);
2927 -- In the body or private part of an instance, a type extension
2928 -- may introduce a component with the same name as that of an
2929 -- actual. The legality rule is not enforced, but the semantics
2930 -- of the full type with two components of the same name are not
2931 -- clear at this point ???
2933 elsif In_Instance_Not_Visible
then
2936 -- When compiling a package body, some child units may have become
2937 -- visible. They cannot conflict with local entities that hide them.
2939 elsif Is_Child_Unit
(E
)
2940 and then In_Open_Scopes
(Scope
(E
))
2941 and then not Is_Immediately_Visible
(E
)
2945 -- Conversely, with front-end inlining we may compile the parent
2946 -- body first, and a child unit subsequently. The context is now
2947 -- the parent spec, and body entities are not visible.
2949 elsif Is_Child_Unit
(Def_Id
)
2950 and then Is_Package_Body_Entity
(E
)
2951 and then not In_Package_Body
(Current_Scope
)
2955 -- Case of genuine duplicate declaration
2958 Error_Msg_Sloc
:= Sloc
(E
);
2960 -- If the previous declaration is an incomplete type declaration
2961 -- this may be an attempt to complete it with a private type.
2962 -- The following avoids confusing cascaded errors.
2964 if Nkind
(Parent
(E
)) = N_Incomplete_Type_Declaration
2965 and then Nkind
(Parent
(Def_Id
)) = N_Private_Type_Declaration
2968 ("incomplete type cannot be completed with a private " &
2969 "declaration", Parent
(Def_Id
));
2970 Set_Is_Immediately_Visible
(E
, False);
2971 Set_Full_View
(E
, Def_Id
);
2973 -- An inherited component of a record conflicts with a new
2974 -- discriminant. The discriminant is inserted first in the scope,
2975 -- but the error should be posted on it, not on the component.
2977 elsif Ekind
(E
) = E_Discriminant
2978 and then Present
(Scope
(Def_Id
))
2979 and then Scope
(Def_Id
) /= Current_Scope
2981 Error_Msg_Sloc
:= Sloc
(Def_Id
);
2982 Error_Msg_N
("& conflicts with declaration#", E
);
2985 -- If the name of the unit appears in its own context clause,
2986 -- a dummy package with the name has already been created, and
2987 -- the error emitted. Try to continue quietly.
2989 elsif Error_Posted
(E
)
2990 and then Sloc
(E
) = No_Location
2991 and then Nkind
(Parent
(E
)) = N_Package_Specification
2992 and then Current_Scope
= Standard_Standard
2994 Set_Scope
(Def_Id
, Current_Scope
);
2998 Error_Msg_N
("& conflicts with declaration#", Def_Id
);
3000 -- Avoid cascaded messages with duplicate components in
3003 if Ekind_In
(E
, E_Component
, E_Discriminant
) then
3008 if Nkind
(Parent
(Parent
(Def_Id
))) =
3009 N_Generic_Subprogram_Declaration
3011 Defining_Entity
(Specification
(Parent
(Parent
(Def_Id
))))
3013 Error_Msg_N
("\generic units cannot be overloaded", Def_Id
);
3016 -- If entity is in standard, then we are in trouble, because
3017 -- it means that we have a library package with a duplicated
3018 -- name. That's hard to recover from, so abort!
3020 if S
= Standard_Standard
then
3021 raise Unrecoverable_Error
;
3023 -- Otherwise we continue with the declaration. Having two
3024 -- identical declarations should not cause us too much trouble!
3032 -- If we fall through, declaration is OK , or OK enough to continue
3034 -- If Def_Id is a discriminant or a record component we are in the
3035 -- midst of inheriting components in a derived record definition.
3036 -- Preserve their Ekind and Etype.
3038 if Ekind_In
(Def_Id
, E_Discriminant
, E_Component
) then
3041 -- If a type is already set, leave it alone (happens whey a type
3042 -- declaration is reanalyzed following a call to the optimizer)
3044 elsif Present
(Etype
(Def_Id
)) then
3047 -- Otherwise, the kind E_Void insures that premature uses of the entity
3048 -- will be detected. Any_Type insures that no cascaded errors will occur
3051 Set_Ekind
(Def_Id
, E_Void
);
3052 Set_Etype
(Def_Id
, Any_Type
);
3055 -- Inherited discriminants and components in derived record types are
3056 -- immediately visible. Itypes are not.
3058 if Ekind_In
(Def_Id
, E_Discriminant
, E_Component
)
3059 or else (No
(Corresponding_Remote_Type
(Def_Id
))
3060 and then not Is_Itype
(Def_Id
))
3062 Set_Is_Immediately_Visible
(Def_Id
);
3063 Set_Current_Entity
(Def_Id
);
3066 Set_Homonym
(Def_Id
, C
);
3067 Append_Entity
(Def_Id
, S
);
3068 Set_Public_Status
(Def_Id
);
3070 -- Warn if new entity hides an old one
3072 if Warn_On_Hiding
and then Present
(C
)
3074 -- Don't warn for record components since they always have a well
3075 -- defined scope which does not confuse other uses. Note that in
3076 -- some cases, Ekind has not been set yet.
3078 and then Ekind
(C
) /= E_Component
3079 and then Ekind
(C
) /= E_Discriminant
3080 and then Nkind
(Parent
(C
)) /= N_Component_Declaration
3081 and then Ekind
(Def_Id
) /= E_Component
3082 and then Ekind
(Def_Id
) /= E_Discriminant
3083 and then Nkind
(Parent
(Def_Id
)) /= N_Component_Declaration
3085 -- Don't warn for one character variables. It is too common to use
3086 -- such variables as locals and will just cause too many false hits.
3088 and then Length_Of_Name
(Chars
(C
)) /= 1
3090 -- Don't warn for non-source entities
3092 and then Comes_From_Source
(C
)
3093 and then Comes_From_Source
(Def_Id
)
3095 -- Don't warn unless entity in question is in extended main source
3097 and then In_Extended_Main_Source_Unit
(Def_Id
)
3099 -- Finally, the hidden entity must be either immediately visible
3100 -- or use visible (from a used package)
3103 (Is_Immediately_Visible
(C
)
3105 Is_Potentially_Use_Visible
(C
))
3107 Error_Msg_Sloc
:= Sloc
(C
);
3108 Error_Msg_N
("declaration hides &#?", Def_Id
);
3112 --------------------------
3113 -- Explain_Limited_Type --
3114 --------------------------
3116 procedure Explain_Limited_Type
(T
: Entity_Id
; N
: Node_Id
) is
3120 -- For array, component type must be limited
3122 if Is_Array_Type
(T
) then
3123 Error_Msg_Node_2
:= T
;
3125 ("\component type& of type& is limited", N
, Component_Type
(T
));
3126 Explain_Limited_Type
(Component_Type
(T
), N
);
3128 elsif Is_Record_Type
(T
) then
3130 -- No need for extra messages if explicit limited record
3132 if Is_Limited_Record
(Base_Type
(T
)) then
3136 -- Otherwise find a limited component. Check only components that
3137 -- come from source, or inherited components that appear in the
3138 -- source of the ancestor.
3140 C
:= First_Component
(T
);
3141 while Present
(C
) loop
3142 if Is_Limited_Type
(Etype
(C
))
3144 (Comes_From_Source
(C
)
3146 (Present
(Original_Record_Component
(C
))
3148 Comes_From_Source
(Original_Record_Component
(C
))))
3150 Error_Msg_Node_2
:= T
;
3151 Error_Msg_NE
("\component& of type& has limited type", N
, C
);
3152 Explain_Limited_Type
(Etype
(C
), N
);
3159 -- The type may be declared explicitly limited, even if no component
3160 -- of it is limited, in which case we fall out of the loop.
3163 end Explain_Limited_Type
;
3169 procedure Find_Actual
3171 Formal
: out Entity_Id
;
3174 Parnt
: constant Node_Id
:= Parent
(N
);
3178 if (Nkind
(Parnt
) = N_Indexed_Component
3180 Nkind
(Parnt
) = N_Selected_Component
)
3181 and then N
= Prefix
(Parnt
)
3183 Find_Actual
(Parnt
, Formal
, Call
);
3186 elsif Nkind
(Parnt
) = N_Parameter_Association
3187 and then N
= Explicit_Actual_Parameter
(Parnt
)
3189 Call
:= Parent
(Parnt
);
3191 elsif Nkind
(Parnt
) = N_Procedure_Call_Statement
then
3200 -- If we have a call to a subprogram look for the parameter. Note that
3201 -- we exclude overloaded calls, since we don't know enough to be sure
3202 -- of giving the right answer in this case.
3204 if Is_Entity_Name
(Name
(Call
))
3205 and then Present
(Entity
(Name
(Call
)))
3206 and then Is_Overloadable
(Entity
(Name
(Call
)))
3207 and then not Is_Overloaded
(Name
(Call
))
3209 -- Fall here if we are definitely a parameter
3211 Actual
:= First_Actual
(Call
);
3212 Formal
:= First_Formal
(Entity
(Name
(Call
)));
3213 while Present
(Formal
) and then Present
(Actual
) loop
3217 Actual
:= Next_Actual
(Actual
);
3218 Formal
:= Next_Formal
(Formal
);
3223 -- Fall through here if we did not find matching actual
3229 ---------------------------
3230 -- Find_Body_Discriminal --
3231 ---------------------------
3233 function Find_Body_Discriminal
3234 (Spec_Discriminant
: Entity_Id
) return Entity_Id
3236 pragma Assert
(Is_Concurrent_Record_Type
(Scope
(Spec_Discriminant
)));
3238 Tsk
: constant Entity_Id
:=
3239 Corresponding_Concurrent_Type
(Scope
(Spec_Discriminant
));
3243 -- Find discriminant of original concurrent type, and use its current
3244 -- discriminal, which is the renaming within the task/protected body.
3246 Disc
:= First_Discriminant
(Tsk
);
3247 while Present
(Disc
) loop
3248 if Chars
(Disc
) = Chars
(Spec_Discriminant
) then
3249 return Discriminal
(Disc
);
3252 Next_Discriminant
(Disc
);
3255 -- That loop should always succeed in finding a matching entry and
3256 -- returning. Fatal error if not.
3258 raise Program_Error
;
3259 end Find_Body_Discriminal
;
3261 -------------------------------------
3262 -- Find_Corresponding_Discriminant --
3263 -------------------------------------
3265 function Find_Corresponding_Discriminant
3267 Typ
: Entity_Id
) return Entity_Id
3269 Par_Disc
: Entity_Id
;
3270 Old_Disc
: Entity_Id
;
3271 New_Disc
: Entity_Id
;
3274 Par_Disc
:= Original_Record_Component
(Original_Discriminant
(Id
));
3276 -- The original type may currently be private, and the discriminant
3277 -- only appear on its full view.
3279 if Is_Private_Type
(Scope
(Par_Disc
))
3280 and then not Has_Discriminants
(Scope
(Par_Disc
))
3281 and then Present
(Full_View
(Scope
(Par_Disc
)))
3283 Old_Disc
:= First_Discriminant
(Full_View
(Scope
(Par_Disc
)));
3285 Old_Disc
:= First_Discriminant
(Scope
(Par_Disc
));
3288 if Is_Class_Wide_Type
(Typ
) then
3289 New_Disc
:= First_Discriminant
(Root_Type
(Typ
));
3291 New_Disc
:= First_Discriminant
(Typ
);
3294 while Present
(Old_Disc
) and then Present
(New_Disc
) loop
3295 if Old_Disc
= Par_Disc
then
3298 Next_Discriminant
(Old_Disc
);
3299 Next_Discriminant
(New_Disc
);
3303 -- Should always find it
3305 raise Program_Error
;
3306 end Find_Corresponding_Discriminant
;
3308 --------------------------
3309 -- Find_Overlaid_Entity --
3310 --------------------------
3312 procedure Find_Overlaid_Entity
3314 Ent
: out Entity_Id
;
3320 -- We are looking for one of the two following forms:
3322 -- for X'Address use Y'Address
3326 -- Const : constant Address := expr;
3328 -- for X'Address use Const;
3330 -- In the second case, the expr is either Y'Address, or recursively a
3331 -- constant that eventually references Y'Address.
3336 if Nkind
(N
) = N_Attribute_Definition_Clause
3337 and then Chars
(N
) = Name_Address
3339 Expr
:= Expression
(N
);
3341 -- This loop checks the form of the expression for Y'Address,
3342 -- using recursion to deal with intermediate constants.
3345 -- Check for Y'Address
3347 if Nkind
(Expr
) = N_Attribute_Reference
3348 and then Attribute_Name
(Expr
) = Name_Address
3350 Expr
:= Prefix
(Expr
);
3353 -- Check for Const where Const is a constant entity
3355 elsif Is_Entity_Name
(Expr
)
3356 and then Ekind
(Entity
(Expr
)) = E_Constant
3358 Expr
:= Constant_Value
(Entity
(Expr
));
3360 -- Anything else does not need checking
3367 -- This loop checks the form of the prefix for an entity,
3368 -- using recursion to deal with intermediate components.
3371 -- Check for Y where Y is an entity
3373 if Is_Entity_Name
(Expr
) then
3374 Ent
:= Entity
(Expr
);
3377 -- Check for components
3380 Nkind_In
(Expr
, N_Selected_Component
, N_Indexed_Component
) then
3382 Expr
:= Prefix
(Expr
);
3385 -- Anything else does not need checking
3392 end Find_Overlaid_Entity
;
3394 -------------------------
3395 -- Find_Parameter_Type --
3396 -------------------------
3398 function Find_Parameter_Type
(Param
: Node_Id
) return Entity_Id
is
3400 if Nkind
(Param
) /= N_Parameter_Specification
then
3403 -- For an access parameter, obtain the type from the formal entity
3404 -- itself, because access to subprogram nodes do not carry a type.
3405 -- Shouldn't we always use the formal entity ???
3407 elsif Nkind
(Parameter_Type
(Param
)) = N_Access_Definition
then
3408 return Etype
(Defining_Identifier
(Param
));
3411 return Etype
(Parameter_Type
(Param
));
3413 end Find_Parameter_Type
;
3415 -----------------------------
3416 -- Find_Static_Alternative --
3417 -----------------------------
3419 function Find_Static_Alternative
(N
: Node_Id
) return Node_Id
is
3420 Expr
: constant Node_Id
:= Expression
(N
);
3421 Val
: constant Uint
:= Expr_Value
(Expr
);
3426 Alt
:= First
(Alternatives
(N
));
3429 if Nkind
(Alt
) /= N_Pragma
then
3430 Choice
:= First
(Discrete_Choices
(Alt
));
3431 while Present
(Choice
) loop
3433 -- Others choice, always matches
3435 if Nkind
(Choice
) = N_Others_Choice
then
3438 -- Range, check if value is in the range
3440 elsif Nkind
(Choice
) = N_Range
then
3442 Val
>= Expr_Value
(Low_Bound
(Choice
))
3444 Val
<= Expr_Value
(High_Bound
(Choice
));
3446 -- Choice is a subtype name. Note that we know it must
3447 -- be a static subtype, since otherwise it would have
3448 -- been diagnosed as illegal.
3450 elsif Is_Entity_Name
(Choice
)
3451 and then Is_Type
(Entity
(Choice
))
3453 exit Search
when Is_In_Range
(Expr
, Etype
(Choice
),
3454 Assume_Valid
=> False);
3456 -- Choice is a subtype indication
3458 elsif Nkind
(Choice
) = N_Subtype_Indication
then
3460 C
: constant Node_Id
:= Constraint
(Choice
);
3461 R
: constant Node_Id
:= Range_Expression
(C
);
3465 Val
>= Expr_Value
(Low_Bound
(R
))
3467 Val
<= Expr_Value
(High_Bound
(R
));
3470 -- Choice is a simple expression
3473 exit Search
when Val
= Expr_Value
(Choice
);
3481 pragma Assert
(Present
(Alt
));
3484 -- The above loop *must* terminate by finding a match, since
3485 -- we know the case statement is valid, and the value of the
3486 -- expression is known at compile time. When we fall out of
3487 -- the loop, Alt points to the alternative that we know will
3488 -- be selected at run time.
3491 end Find_Static_Alternative
;
3497 function First_Actual
(Node
: Node_Id
) return Node_Id
is
3501 if No
(Parameter_Associations
(Node
)) then
3505 N
:= First
(Parameter_Associations
(Node
));
3507 if Nkind
(N
) = N_Parameter_Association
then
3508 return First_Named_Actual
(Node
);
3514 -----------------------
3515 -- Gather_Components --
3516 -----------------------
3518 procedure Gather_Components
3520 Comp_List
: Node_Id
;
3521 Governed_By
: List_Id
;
3523 Report_Errors
: out Boolean)
3527 Discrete_Choice
: Node_Id
;
3528 Comp_Item
: Node_Id
;
3530 Discrim
: Entity_Id
;
3531 Discrim_Name
: Node_Id
;
3532 Discrim_Value
: Node_Id
;
3535 Report_Errors
:= False;
3537 if No
(Comp_List
) or else Null_Present
(Comp_List
) then
3540 elsif Present
(Component_Items
(Comp_List
)) then
3541 Comp_Item
:= First
(Component_Items
(Comp_List
));
3547 while Present
(Comp_Item
) loop
3549 -- Skip the tag of a tagged record, the interface tags, as well
3550 -- as all items that are not user components (anonymous types,
3551 -- rep clauses, Parent field, controller field).
3553 if Nkind
(Comp_Item
) = N_Component_Declaration
then
3555 Comp
: constant Entity_Id
:= Defining_Identifier
(Comp_Item
);
3557 if not Is_Tag
(Comp
)
3558 and then Chars
(Comp
) /= Name_uParent
3559 and then Chars
(Comp
) /= Name_uController
3561 Append_Elmt
(Comp
, Into
);
3569 if No
(Variant_Part
(Comp_List
)) then
3572 Discrim_Name
:= Name
(Variant_Part
(Comp_List
));
3573 Variant
:= First_Non_Pragma
(Variants
(Variant_Part
(Comp_List
)));
3576 -- Look for the discriminant that governs this variant part.
3577 -- The discriminant *must* be in the Governed_By List
3579 Assoc
:= First
(Governed_By
);
3580 Find_Constraint
: loop
3581 Discrim
:= First
(Choices
(Assoc
));
3582 exit Find_Constraint
when Chars
(Discrim_Name
) = Chars
(Discrim
)
3583 or else (Present
(Corresponding_Discriminant
(Entity
(Discrim
)))
3585 Chars
(Corresponding_Discriminant
(Entity
(Discrim
)))
3586 = Chars
(Discrim_Name
))
3587 or else Chars
(Original_Record_Component
(Entity
(Discrim
)))
3588 = Chars
(Discrim_Name
);
3590 if No
(Next
(Assoc
)) then
3591 if not Is_Constrained
(Typ
)
3592 and then Is_Derived_Type
(Typ
)
3593 and then Present
(Stored_Constraint
(Typ
))
3595 -- If the type is a tagged type with inherited discriminants,
3596 -- use the stored constraint on the parent in order to find
3597 -- the values of discriminants that are otherwise hidden by an
3598 -- explicit constraint. Renamed discriminants are handled in
3601 -- If several parent discriminants are renamed by a single
3602 -- discriminant of the derived type, the call to obtain the
3603 -- Corresponding_Discriminant field only retrieves the last
3604 -- of them. We recover the constraint on the others from the
3605 -- Stored_Constraint as well.
3612 D
:= First_Discriminant
(Etype
(Typ
));
3613 C
:= First_Elmt
(Stored_Constraint
(Typ
));
3614 while Present
(D
) and then Present
(C
) loop
3615 if Chars
(Discrim_Name
) = Chars
(D
) then
3616 if Is_Entity_Name
(Node
(C
))
3617 and then Entity
(Node
(C
)) = Entity
(Discrim
)
3619 -- D is renamed by Discrim, whose value is given in
3626 Make_Component_Association
(Sloc
(Typ
),
3628 (New_Occurrence_Of
(D
, Sloc
(Typ
))),
3629 Duplicate_Subexpr_No_Checks
(Node
(C
)));
3631 exit Find_Constraint
;
3634 Next_Discriminant
(D
);
3641 if No
(Next
(Assoc
)) then
3642 Error_Msg_NE
(" missing value for discriminant&",
3643 First
(Governed_By
), Discrim_Name
);
3644 Report_Errors
:= True;
3649 end loop Find_Constraint
;
3651 Discrim_Value
:= Expression
(Assoc
);
3653 if not Is_OK_Static_Expression
(Discrim_Value
) then
3655 ("value for discriminant & must be static!",
3656 Discrim_Value
, Discrim
);
3657 Why_Not_Static
(Discrim_Value
);
3658 Report_Errors
:= True;
3662 Search_For_Discriminant_Value
: declare
3668 UI_Discrim_Value
: constant Uint
:= Expr_Value
(Discrim_Value
);
3671 Find_Discrete_Value
: while Present
(Variant
) loop
3672 Discrete_Choice
:= First
(Discrete_Choices
(Variant
));
3673 while Present
(Discrete_Choice
) loop
3675 exit Find_Discrete_Value
when
3676 Nkind
(Discrete_Choice
) = N_Others_Choice
;
3678 Get_Index_Bounds
(Discrete_Choice
, Low
, High
);
3680 UI_Low
:= Expr_Value
(Low
);
3681 UI_High
:= Expr_Value
(High
);
3683 exit Find_Discrete_Value
when
3684 UI_Low
<= UI_Discrim_Value
3686 UI_High
>= UI_Discrim_Value
;
3688 Next
(Discrete_Choice
);
3691 Next_Non_Pragma
(Variant
);
3692 end loop Find_Discrete_Value
;
3693 end Search_For_Discriminant_Value
;
3695 if No
(Variant
) then
3697 ("value of discriminant & is out of range", Discrim_Value
, Discrim
);
3698 Report_Errors
:= True;
3702 -- If we have found the corresponding choice, recursively add its
3703 -- components to the Into list.
3705 Gather_Components
(Empty
,
3706 Component_List
(Variant
), Governed_By
, Into
, Report_Errors
);
3707 end Gather_Components
;
3709 ------------------------
3710 -- Get_Actual_Subtype --
3711 ------------------------
3713 function Get_Actual_Subtype
(N
: Node_Id
) return Entity_Id
is
3714 Typ
: constant Entity_Id
:= Etype
(N
);
3715 Utyp
: Entity_Id
:= Underlying_Type
(Typ
);
3724 -- If what we have is an identifier that references a subprogram
3725 -- formal, or a variable or constant object, then we get the actual
3726 -- subtype from the referenced entity if one has been built.
3728 if Nkind
(N
) = N_Identifier
3730 (Is_Formal
(Entity
(N
))
3731 or else Ekind
(Entity
(N
)) = E_Constant
3732 or else Ekind
(Entity
(N
)) = E_Variable
)
3733 and then Present
(Actual_Subtype
(Entity
(N
)))
3735 return Actual_Subtype
(Entity
(N
));
3737 -- Actual subtype of unchecked union is always itself. We never need
3738 -- the "real" actual subtype. If we did, we couldn't get it anyway
3739 -- because the discriminant is not available. The restrictions on
3740 -- Unchecked_Union are designed to make sure that this is OK.
3742 elsif Is_Unchecked_Union
(Base_Type
(Utyp
)) then
3745 -- Here for the unconstrained case, we must find actual subtype
3746 -- No actual subtype is available, so we must build it on the fly.
3748 -- Checking the type, not the underlying type, for constrainedness
3749 -- seems to be necessary. Maybe all the tests should be on the type???
3751 elsif (not Is_Constrained
(Typ
))
3752 and then (Is_Array_Type
(Utyp
)
3753 or else (Is_Record_Type
(Utyp
)
3754 and then Has_Discriminants
(Utyp
)))
3755 and then not Has_Unknown_Discriminants
(Utyp
)
3756 and then not (Ekind
(Utyp
) = E_String_Literal_Subtype
)
3758 -- Nothing to do if in spec expression (why not???)
3760 if In_Spec_Expression
then
3763 elsif Is_Private_Type
(Typ
)
3764 and then not Has_Discriminants
(Typ
)
3766 -- If the type has no discriminants, there is no subtype to
3767 -- build, even if the underlying type is discriminated.
3771 -- Else build the actual subtype
3774 Decl
:= Build_Actual_Subtype
(Typ
, N
);
3775 Atyp
:= Defining_Identifier
(Decl
);
3777 -- If Build_Actual_Subtype generated a new declaration then use it
3781 -- The actual subtype is an Itype, so analyze the declaration,
3782 -- but do not attach it to the tree, to get the type defined.
3784 Set_Parent
(Decl
, N
);
3785 Set_Is_Itype
(Atyp
);
3786 Analyze
(Decl
, Suppress
=> All_Checks
);
3787 Set_Associated_Node_For_Itype
(Atyp
, N
);
3788 Set_Has_Delayed_Freeze
(Atyp
, False);
3790 -- We need to freeze the actual subtype immediately. This is
3791 -- needed, because otherwise this Itype will not get frozen
3792 -- at all, and it is always safe to freeze on creation because
3793 -- any associated types must be frozen at this point.
3795 Freeze_Itype
(Atyp
, N
);
3798 -- Otherwise we did not build a declaration, so return original
3805 -- For all remaining cases, the actual subtype is the same as
3806 -- the nominal type.
3811 end Get_Actual_Subtype
;
3813 -------------------------------------
3814 -- Get_Actual_Subtype_If_Available --
3815 -------------------------------------
3817 function Get_Actual_Subtype_If_Available
(N
: Node_Id
) return Entity_Id
is
3818 Typ
: constant Entity_Id
:= Etype
(N
);
3821 -- If what we have is an identifier that references a subprogram
3822 -- formal, or a variable or constant object, then we get the actual
3823 -- subtype from the referenced entity if one has been built.
3825 if Nkind
(N
) = N_Identifier
3827 (Is_Formal
(Entity
(N
))
3828 or else Ekind
(Entity
(N
)) = E_Constant
3829 or else Ekind
(Entity
(N
)) = E_Variable
)
3830 and then Present
(Actual_Subtype
(Entity
(N
)))
3832 return Actual_Subtype
(Entity
(N
));
3834 -- Otherwise the Etype of N is returned unchanged
3839 end Get_Actual_Subtype_If_Available
;
3841 -------------------------------
3842 -- Get_Default_External_Name --
3843 -------------------------------
3845 function Get_Default_External_Name
(E
: Node_Or_Entity_Id
) return Node_Id
is
3847 Get_Decoded_Name_String
(Chars
(E
));
3849 if Opt
.External_Name_Imp_Casing
= Uppercase
then
3850 Set_Casing
(All_Upper_Case
);
3852 Set_Casing
(All_Lower_Case
);
3856 Make_String_Literal
(Sloc
(E
),
3857 Strval
=> String_From_Name_Buffer
);
3858 end Get_Default_External_Name
;
3860 ---------------------------
3861 -- Get_Enum_Lit_From_Pos --
3862 ---------------------------
3864 function Get_Enum_Lit_From_Pos
3867 Loc
: Source_Ptr
) return Node_Id
3872 -- In the case where the literal is of type Character, Wide_Character
3873 -- or Wide_Wide_Character or of a type derived from them, there needs
3874 -- to be some special handling since there is no explicit chain of
3875 -- literals to search. Instead, an N_Character_Literal node is created
3876 -- with the appropriate Char_Code and Chars fields.
3878 if Is_Standard_Character_Type
(T
) then
3879 Set_Character_Literal_Name
(UI_To_CC
(Pos
));
3881 Make_Character_Literal
(Loc
,
3883 Char_Literal_Value
=> Pos
);
3885 -- For all other cases, we have a complete table of literals, and
3886 -- we simply iterate through the chain of literal until the one
3887 -- with the desired position value is found.
3891 Lit
:= First_Literal
(Base_Type
(T
));
3892 for J
in 1 .. UI_To_Int
(Pos
) loop
3896 return New_Occurrence_Of
(Lit
, Loc
);
3898 end Get_Enum_Lit_From_Pos
;
3900 ------------------------
3901 -- Get_Generic_Entity --
3902 ------------------------
3904 function Get_Generic_Entity
(N
: Node_Id
) return Entity_Id
is
3905 Ent
: constant Entity_Id
:= Entity
(Name
(N
));
3907 if Present
(Renamed_Object
(Ent
)) then
3908 return Renamed_Object
(Ent
);
3912 end Get_Generic_Entity
;
3914 ----------------------
3915 -- Get_Index_Bounds --
3916 ----------------------
3918 procedure Get_Index_Bounds
(N
: Node_Id
; L
, H
: out Node_Id
) is
3919 Kind
: constant Node_Kind
:= Nkind
(N
);
3923 if Kind
= N_Range
then
3925 H
:= High_Bound
(N
);
3927 elsif Kind
= N_Subtype_Indication
then
3928 R
:= Range_Expression
(Constraint
(N
));
3936 L
:= Low_Bound
(Range_Expression
(Constraint
(N
)));
3937 H
:= High_Bound
(Range_Expression
(Constraint
(N
)));
3940 elsif Is_Entity_Name
(N
) and then Is_Type
(Entity
(N
)) then
3941 if Error_Posted
(Scalar_Range
(Entity
(N
))) then
3945 elsif Nkind
(Scalar_Range
(Entity
(N
))) = N_Subtype_Indication
then
3946 Get_Index_Bounds
(Scalar_Range
(Entity
(N
)), L
, H
);
3949 L
:= Low_Bound
(Scalar_Range
(Entity
(N
)));
3950 H
:= High_Bound
(Scalar_Range
(Entity
(N
)));
3954 -- N is an expression, indicating a range with one value
3959 end Get_Index_Bounds
;
3961 ----------------------------------
3962 -- Get_Library_Unit_Name_string --
3963 ----------------------------------
3965 procedure Get_Library_Unit_Name_String
(Decl_Node
: Node_Id
) is
3966 Unit_Name_Id
: constant Unit_Name_Type
:= Get_Unit_Name
(Decl_Node
);
3969 Get_Unit_Name_String
(Unit_Name_Id
);
3971 -- Remove seven last character (" (spec)" or " (body)")
3973 Name_Len
:= Name_Len
- 7;
3974 pragma Assert
(Name_Buffer
(Name_Len
+ 1) = ' ');
3975 end Get_Library_Unit_Name_String
;
3977 ------------------------
3978 -- Get_Name_Entity_Id --
3979 ------------------------
3981 function Get_Name_Entity_Id
(Id
: Name_Id
) return Entity_Id
is
3983 return Entity_Id
(Get_Name_Table_Info
(Id
));
3984 end Get_Name_Entity_Id
;
3990 function Get_Pragma_Id
(N
: Node_Id
) return Pragma_Id
is
3992 return Get_Pragma_Id
(Pragma_Name
(N
));
3995 ---------------------------
3996 -- Get_Referenced_Object --
3997 ---------------------------
3999 function Get_Referenced_Object
(N
: Node_Id
) return Node_Id
is
4004 while Is_Entity_Name
(R
)
4005 and then Present
(Renamed_Object
(Entity
(R
)))
4007 R
:= Renamed_Object
(Entity
(R
));
4011 end Get_Referenced_Object
;
4013 ------------------------
4014 -- Get_Renamed_Entity --
4015 ------------------------
4017 function Get_Renamed_Entity
(E
: Entity_Id
) return Entity_Id
is
4022 while Present
(Renamed_Entity
(R
)) loop
4023 R
:= Renamed_Entity
(R
);
4027 end Get_Renamed_Entity
;
4029 -------------------------
4030 -- Get_Subprogram_Body --
4031 -------------------------
4033 function Get_Subprogram_Body
(E
: Entity_Id
) return Node_Id
is
4037 Decl
:= Unit_Declaration_Node
(E
);
4039 if Nkind
(Decl
) = N_Subprogram_Body
then
4042 -- The below comment is bad, because it is possible for
4043 -- Nkind (Decl) to be an N_Subprogram_Body_Stub ???
4045 else -- Nkind (Decl) = N_Subprogram_Declaration
4047 if Present
(Corresponding_Body
(Decl
)) then
4048 return Unit_Declaration_Node
(Corresponding_Body
(Decl
));
4050 -- Imported subprogram case
4056 end Get_Subprogram_Body
;
4058 ---------------------------
4059 -- Get_Subprogram_Entity --
4060 ---------------------------
4062 function Get_Subprogram_Entity
(Nod
: Node_Id
) return Entity_Id
is
4067 if Nkind
(Nod
) = N_Accept_Statement
then
4068 Nam
:= Entry_Direct_Name
(Nod
);
4070 -- For an entry call, the prefix of the call is a selected component.
4071 -- Need additional code for internal calls ???
4073 elsif Nkind
(Nod
) = N_Entry_Call_Statement
then
4074 if Nkind
(Name
(Nod
)) = N_Selected_Component
then
4075 Nam
:= Entity
(Selector_Name
(Name
(Nod
)));
4084 if Nkind
(Nam
) = N_Explicit_Dereference
then
4085 Proc
:= Etype
(Prefix
(Nam
));
4086 elsif Is_Entity_Name
(Nam
) then
4087 Proc
:= Entity
(Nam
);
4092 if Is_Object
(Proc
) then
4093 Proc
:= Etype
(Proc
);
4096 if Ekind
(Proc
) = E_Access_Subprogram_Type
then
4097 Proc
:= Directly_Designated_Type
(Proc
);
4100 if not Is_Subprogram
(Proc
)
4101 and then Ekind
(Proc
) /= E_Subprogram_Type
4107 end Get_Subprogram_Entity
;
4109 -----------------------------
4110 -- Get_Task_Body_Procedure --
4111 -----------------------------
4113 function Get_Task_Body_Procedure
(E
: Entity_Id
) return Node_Id
is
4115 -- Note: A task type may be the completion of a private type with
4116 -- discriminants. When performing elaboration checks on a task
4117 -- declaration, the current view of the type may be the private one,
4118 -- and the procedure that holds the body of the task is held in its
4121 -- This is an odd function, why not have Task_Body_Procedure do
4122 -- the following digging???
4124 return Task_Body_Procedure
(Underlying_Type
(Root_Type
(E
)));
4125 end Get_Task_Body_Procedure
;
4127 -----------------------
4128 -- Has_Access_Values --
4129 -----------------------
4131 function Has_Access_Values
(T
: Entity_Id
) return Boolean is
4132 Typ
: constant Entity_Id
:= Underlying_Type
(T
);
4135 -- Case of a private type which is not completed yet. This can only
4136 -- happen in the case of a generic format type appearing directly, or
4137 -- as a component of the type to which this function is being applied
4138 -- at the top level. Return False in this case, since we certainly do
4139 -- not know that the type contains access types.
4144 elsif Is_Access_Type
(Typ
) then
4147 elsif Is_Array_Type
(Typ
) then
4148 return Has_Access_Values
(Component_Type
(Typ
));
4150 elsif Is_Record_Type
(Typ
) then
4155 -- Loop to Check components
4157 Comp
:= First_Component_Or_Discriminant
(Typ
);
4158 while Present
(Comp
) loop
4160 -- Check for access component, tag field does not count, even
4161 -- though it is implemented internally using an access type.
4163 if Has_Access_Values
(Etype
(Comp
))
4164 and then Chars
(Comp
) /= Name_uTag
4169 Next_Component_Or_Discriminant
(Comp
);
4178 end Has_Access_Values
;
4180 ------------------------------
4181 -- Has_Compatible_Alignment --
4182 ------------------------------
4184 function Has_Compatible_Alignment
4186 Expr
: Node_Id
) return Alignment_Result
4188 function Has_Compatible_Alignment_Internal
4191 Default
: Alignment_Result
) return Alignment_Result
;
4192 -- This is the internal recursive function that actually does the work.
4193 -- There is one additional parameter, which says what the result should
4194 -- be if no alignment information is found, and there is no definite
4195 -- indication of compatible alignments. At the outer level, this is set
4196 -- to Unknown, but for internal recursive calls in the case where types
4197 -- are known to be correct, it is set to Known_Compatible.
4199 ---------------------------------------
4200 -- Has_Compatible_Alignment_Internal --
4201 ---------------------------------------
4203 function Has_Compatible_Alignment_Internal
4206 Default
: Alignment_Result
) return Alignment_Result
4208 Result
: Alignment_Result
:= Known_Compatible
;
4209 -- Holds the current status of the result. Note that once a value of
4210 -- Known_Incompatible is set, it is sticky and does not get changed
4211 -- to Unknown (the value in Result only gets worse as we go along,
4214 Offs
: Uint
:= No_Uint
;
4215 -- Set to a factor of the offset from the base object when Expr is a
4216 -- selected or indexed component, based on Component_Bit_Offset and
4217 -- Component_Size respectively. A negative value is used to represent
4218 -- a value which is not known at compile time.
4220 procedure Check_Prefix
;
4221 -- Checks the prefix recursively in the case where the expression
4222 -- is an indexed or selected component.
4224 procedure Set_Result
(R
: Alignment_Result
);
4225 -- If R represents a worse outcome (unknown instead of known
4226 -- compatible, or known incompatible), then set Result to R.
4232 procedure Check_Prefix
is
4234 -- The subtlety here is that in doing a recursive call to check
4235 -- the prefix, we have to decide what to do in the case where we
4236 -- don't find any specific indication of an alignment problem.
4238 -- At the outer level, we normally set Unknown as the result in
4239 -- this case, since we can only set Known_Compatible if we really
4240 -- know that the alignment value is OK, but for the recursive
4241 -- call, in the case where the types match, and we have not
4242 -- specified a peculiar alignment for the object, we are only
4243 -- concerned about suspicious rep clauses, the default case does
4244 -- not affect us, since the compiler will, in the absence of such
4245 -- rep clauses, ensure that the alignment is correct.
4247 if Default
= Known_Compatible
4249 (Etype
(Obj
) = Etype
(Expr
)
4250 and then (Unknown_Alignment
(Obj
)
4252 Alignment
(Obj
) = Alignment
(Etype
(Obj
))))
4255 (Has_Compatible_Alignment_Internal
4256 (Obj
, Prefix
(Expr
), Known_Compatible
));
4258 -- In all other cases, we need a full check on the prefix
4262 (Has_Compatible_Alignment_Internal
4263 (Obj
, Prefix
(Expr
), Unknown
));
4271 procedure Set_Result
(R
: Alignment_Result
) is
4278 -- Start of processing for Has_Compatible_Alignment_Internal
4281 -- If Expr is a selected component, we must make sure there is no
4282 -- potentially troublesome component clause, and that the record is
4285 if Nkind
(Expr
) = N_Selected_Component
then
4287 -- Packed record always generate unknown alignment
4289 if Is_Packed
(Etype
(Prefix
(Expr
))) then
4290 Set_Result
(Unknown
);
4293 -- Check prefix and component offset
4296 Offs
:= Component_Bit_Offset
(Entity
(Selector_Name
(Expr
)));
4298 -- If Expr is an indexed component, we must make sure there is no
4299 -- potentially troublesome Component_Size clause and that the array
4300 -- is not bit-packed.
4302 elsif Nkind
(Expr
) = N_Indexed_Component
then
4304 Typ
: constant Entity_Id
:= Etype
(Prefix
(Expr
));
4305 Ind
: constant Node_Id
:= First_Index
(Typ
);
4308 -- Bit packed array always generates unknown alignment
4310 if Is_Bit_Packed_Array
(Typ
) then
4311 Set_Result
(Unknown
);
4314 -- Check prefix and component offset
4317 Offs
:= Component_Size
(Typ
);
4319 -- Small optimization: compute the full offset when possible
4322 and then Offs
> Uint_0
4323 and then Present
(Ind
)
4324 and then Nkind
(Ind
) = N_Range
4325 and then Compile_Time_Known_Value
(Low_Bound
(Ind
))
4326 and then Compile_Time_Known_Value
(First
(Expressions
(Expr
)))
4328 Offs
:= Offs
* (Expr_Value
(First
(Expressions
(Expr
)))
4329 - Expr_Value
(Low_Bound
((Ind
))));
4334 -- If we have a null offset, the result is entirely determined by
4335 -- the base object and has already been computed recursively.
4337 if Offs
= Uint_0
then
4340 -- Case where we know the alignment of the object
4342 elsif Known_Alignment
(Obj
) then
4344 ObjA
: constant Uint
:= Alignment
(Obj
);
4345 ExpA
: Uint
:= No_Uint
;
4346 SizA
: Uint
:= No_Uint
;
4349 -- If alignment of Obj is 1, then we are always OK
4352 Set_Result
(Known_Compatible
);
4354 -- Alignment of Obj is greater than 1, so we need to check
4357 -- If we have an offset, see if it is compatible
4359 if Offs
/= No_Uint
and Offs
> Uint_0
then
4360 if Offs
mod (System_Storage_Unit
* ObjA
) /= 0 then
4361 Set_Result
(Known_Incompatible
);
4364 -- See if Expr is an object with known alignment
4366 elsif Is_Entity_Name
(Expr
)
4367 and then Known_Alignment
(Entity
(Expr
))
4369 ExpA
:= Alignment
(Entity
(Expr
));
4371 -- Otherwise, we can use the alignment of the type of
4372 -- Expr given that we already checked for
4373 -- discombobulating rep clauses for the cases of indexed
4374 -- and selected components above.
4376 elsif Known_Alignment
(Etype
(Expr
)) then
4377 ExpA
:= Alignment
(Etype
(Expr
));
4379 -- Otherwise the alignment is unknown
4382 Set_Result
(Default
);
4385 -- If we got an alignment, see if it is acceptable
4387 if ExpA
/= No_Uint
and then ExpA
< ObjA
then
4388 Set_Result
(Known_Incompatible
);
4391 -- If Expr is not a piece of a larger object, see if size
4392 -- is given. If so, check that it is not too small for the
4393 -- required alignment.
4395 if Offs
/= No_Uint
then
4398 -- See if Expr is an object with known size
4400 elsif Is_Entity_Name
(Expr
)
4401 and then Known_Static_Esize
(Entity
(Expr
))
4403 SizA
:= Esize
(Entity
(Expr
));
4405 -- Otherwise, we check the object size of the Expr type
4407 elsif Known_Static_Esize
(Etype
(Expr
)) then
4408 SizA
:= Esize
(Etype
(Expr
));
4411 -- If we got a size, see if it is a multiple of the Obj
4412 -- alignment, if not, then the alignment cannot be
4413 -- acceptable, since the size is always a multiple of the
4416 if SizA
/= No_Uint
then
4417 if SizA
mod (ObjA
* Ttypes
.System_Storage_Unit
) /= 0 then
4418 Set_Result
(Known_Incompatible
);
4424 -- If we do not know required alignment, any non-zero offset is a
4425 -- potential problem (but certainly may be OK, so result is unknown).
4427 elsif Offs
/= No_Uint
then
4428 Set_Result
(Unknown
);
4430 -- If we can't find the result by direct comparison of alignment
4431 -- values, then there is still one case that we can determine known
4432 -- result, and that is when we can determine that the types are the
4433 -- same, and no alignments are specified. Then we known that the
4434 -- alignments are compatible, even if we don't know the alignment
4435 -- value in the front end.
4437 elsif Etype
(Obj
) = Etype
(Expr
) then
4439 -- Types are the same, but we have to check for possible size
4440 -- and alignments on the Expr object that may make the alignment
4441 -- different, even though the types are the same.
4443 if Is_Entity_Name
(Expr
) then
4445 -- First check alignment of the Expr object. Any alignment less
4446 -- than Maximum_Alignment is worrisome since this is the case
4447 -- where we do not know the alignment of Obj.
4449 if Known_Alignment
(Entity
(Expr
))
4451 UI_To_Int
(Alignment
(Entity
(Expr
))) <
4452 Ttypes
.Maximum_Alignment
4454 Set_Result
(Unknown
);
4456 -- Now check size of Expr object. Any size that is not an
4457 -- even multiple of Maximum_Alignment is also worrisome
4458 -- since it may cause the alignment of the object to be less
4459 -- than the alignment of the type.
4461 elsif Known_Static_Esize
(Entity
(Expr
))
4463 (UI_To_Int
(Esize
(Entity
(Expr
))) mod
4464 (Ttypes
.Maximum_Alignment
* Ttypes
.System_Storage_Unit
))
4467 Set_Result
(Unknown
);
4469 -- Otherwise same type is decisive
4472 Set_Result
(Known_Compatible
);
4476 -- Another case to deal with is when there is an explicit size or
4477 -- alignment clause when the types are not the same. If so, then the
4478 -- result is Unknown. We don't need to do this test if the Default is
4479 -- Unknown, since that result will be set in any case.
4481 elsif Default
/= Unknown
4482 and then (Has_Size_Clause
(Etype
(Expr
))
4484 Has_Alignment_Clause
(Etype
(Expr
)))
4486 Set_Result
(Unknown
);
4488 -- If no indication found, set default
4491 Set_Result
(Default
);
4494 -- Return worst result found
4497 end Has_Compatible_Alignment_Internal
;
4499 -- Start of processing for Has_Compatible_Alignment
4502 -- If Obj has no specified alignment, then set alignment from the type
4503 -- alignment. Perhaps we should always do this, but for sure we should
4504 -- do it when there is an address clause since we can do more if the
4505 -- alignment is known.
4507 if Unknown_Alignment
(Obj
) then
4508 Set_Alignment
(Obj
, Alignment
(Etype
(Obj
)));
4511 -- Now do the internal call that does all the work
4513 return Has_Compatible_Alignment_Internal
(Obj
, Expr
, Unknown
);
4514 end Has_Compatible_Alignment
;
4516 ----------------------
4517 -- Has_Declarations --
4518 ----------------------
4520 function Has_Declarations
(N
: Node_Id
) return Boolean is
4522 return Nkind_In
(Nkind
(N
), N_Accept_Statement
,
4524 N_Compilation_Unit_Aux
,
4530 N_Package_Specification
);
4531 end Has_Declarations
;
4533 -------------------------------------------
4534 -- Has_Discriminant_Dependent_Constraint --
4535 -------------------------------------------
4537 function Has_Discriminant_Dependent_Constraint
4538 (Comp
: Entity_Id
) return Boolean
4540 Comp_Decl
: constant Node_Id
:= Parent
(Comp
);
4541 Subt_Indic
: constant Node_Id
:=
4542 Subtype_Indication
(Component_Definition
(Comp_Decl
));
4547 if Nkind
(Subt_Indic
) = N_Subtype_Indication
then
4548 Constr
:= Constraint
(Subt_Indic
);
4550 if Nkind
(Constr
) = N_Index_Or_Discriminant_Constraint
then
4551 Assn
:= First
(Constraints
(Constr
));
4552 while Present
(Assn
) loop
4553 case Nkind
(Assn
) is
4554 when N_Subtype_Indication |
4558 if Depends_On_Discriminant
(Assn
) then
4562 when N_Discriminant_Association
=>
4563 if Depends_On_Discriminant
(Expression
(Assn
)) then
4578 end Has_Discriminant_Dependent_Constraint
;
4580 --------------------
4581 -- Has_Infinities --
4582 --------------------
4584 function Has_Infinities
(E
: Entity_Id
) return Boolean is
4587 Is_Floating_Point_Type
(E
)
4588 and then Nkind
(Scalar_Range
(E
)) = N_Range
4589 and then Includes_Infinities
(Scalar_Range
(E
));
4592 --------------------
4593 -- Has_Interfaces --
4594 --------------------
4596 function Has_Interfaces
4598 Use_Full_View
: Boolean := True) return Boolean
4600 Typ
: Entity_Id
:= Base_Type
(T
);
4603 -- Handle concurrent types
4605 if Is_Concurrent_Type
(Typ
) then
4606 Typ
:= Corresponding_Record_Type
(Typ
);
4609 if not Present
(Typ
)
4610 or else not Is_Record_Type
(Typ
)
4611 or else not Is_Tagged_Type
(Typ
)
4616 -- Handle private types
4619 and then Present
(Full_View
(Typ
))
4621 Typ
:= Full_View
(Typ
);
4624 -- Handle concurrent record types
4626 if Is_Concurrent_Record_Type
(Typ
)
4627 and then Is_Non_Empty_List
(Abstract_Interface_List
(Typ
))
4633 if Is_Interface
(Typ
)
4635 (Is_Record_Type
(Typ
)
4636 and then Present
(Interfaces
(Typ
))
4637 and then not Is_Empty_Elmt_List
(Interfaces
(Typ
)))
4642 exit when Etype
(Typ
) = Typ
4644 -- Handle private types
4646 or else (Present
(Full_View
(Etype
(Typ
)))
4647 and then Full_View
(Etype
(Typ
)) = Typ
)
4649 -- Protect the frontend against wrong source with cyclic
4652 or else Etype
(Typ
) = T
;
4654 -- Climb to the ancestor type handling private types
4656 if Present
(Full_View
(Etype
(Typ
))) then
4657 Typ
:= Full_View
(Etype
(Typ
));
4666 ------------------------
4667 -- Has_Null_Exclusion --
4668 ------------------------
4670 function Has_Null_Exclusion
(N
: Node_Id
) return Boolean is
4673 when N_Access_Definition |
4674 N_Access_Function_Definition |
4675 N_Access_Procedure_Definition |
4676 N_Access_To_Object_Definition |
4678 N_Derived_Type_Definition |
4679 N_Function_Specification |
4680 N_Subtype_Declaration
=>
4681 return Null_Exclusion_Present
(N
);
4683 when N_Component_Definition |
4684 N_Formal_Object_Declaration |
4685 N_Object_Renaming_Declaration
=>
4686 if Present
(Subtype_Mark
(N
)) then
4687 return Null_Exclusion_Present
(N
);
4688 else pragma Assert
(Present
(Access_Definition
(N
)));
4689 return Null_Exclusion_Present
(Access_Definition
(N
));
4692 when N_Discriminant_Specification
=>
4693 if Nkind
(Discriminant_Type
(N
)) = N_Access_Definition
then
4694 return Null_Exclusion_Present
(Discriminant_Type
(N
));
4696 return Null_Exclusion_Present
(N
);
4699 when N_Object_Declaration
=>
4700 if Nkind
(Object_Definition
(N
)) = N_Access_Definition
then
4701 return Null_Exclusion_Present
(Object_Definition
(N
));
4703 return Null_Exclusion_Present
(N
);
4706 when N_Parameter_Specification
=>
4707 if Nkind
(Parameter_Type
(N
)) = N_Access_Definition
then
4708 return Null_Exclusion_Present
(Parameter_Type
(N
));
4710 return Null_Exclusion_Present
(N
);
4717 end Has_Null_Exclusion
;
4719 ------------------------
4720 -- Has_Null_Extension --
4721 ------------------------
4723 function Has_Null_Extension
(T
: Entity_Id
) return Boolean is
4724 B
: constant Entity_Id
:= Base_Type
(T
);
4729 if Nkind
(Parent
(B
)) = N_Full_Type_Declaration
4730 and then Present
(Record_Extension_Part
(Type_Definition
(Parent
(B
))))
4732 Ext
:= Record_Extension_Part
(Type_Definition
(Parent
(B
)));
4734 if Present
(Ext
) then
4735 if Null_Present
(Ext
) then
4738 Comps
:= Component_List
(Ext
);
4740 -- The null component list is rewritten during analysis to
4741 -- include the parent component. Any other component indicates
4742 -- that the extension was not originally null.
4744 return Null_Present
(Comps
)
4745 or else No
(Next
(First
(Component_Items
(Comps
))));
4754 end Has_Null_Extension
;
4756 -------------------------------
4757 -- Has_Overriding_Initialize --
4758 -------------------------------
4760 function Has_Overriding_Initialize
(T
: Entity_Id
) return Boolean is
4761 BT
: constant Entity_Id
:= Base_Type
(T
);
4766 if Is_Controlled
(BT
) then
4768 -- For derived types, check immediate ancestor, excluding
4769 -- Controlled itself.
4771 if Is_Derived_Type
(BT
)
4772 and then not In_Predefined_Unit
(Etype
(BT
))
4773 and then Has_Overriding_Initialize
(Etype
(BT
))
4777 elsif Present
(Primitive_Operations
(BT
)) then
4778 P
:= First_Elmt
(Primitive_Operations
(BT
));
4779 while Present
(P
) loop
4780 if Chars
(Node
(P
)) = Name_Initialize
4781 and then Comes_From_Source
(Node
(P
))
4792 elsif Has_Controlled_Component
(BT
) then
4793 Comp
:= First_Component
(BT
);
4794 while Present
(Comp
) loop
4795 if Has_Overriding_Initialize
(Etype
(Comp
)) then
4799 Next_Component
(Comp
);
4807 end Has_Overriding_Initialize
;
4809 --------------------------------------
4810 -- Has_Preelaborable_Initialization --
4811 --------------------------------------
4813 function Has_Preelaborable_Initialization
(E
: Entity_Id
) return Boolean is
4816 procedure Check_Components
(E
: Entity_Id
);
4817 -- Check component/discriminant chain, sets Has_PE False if a component
4818 -- or discriminant does not meet the preelaborable initialization rules.
4820 ----------------------
4821 -- Check_Components --
4822 ----------------------
4824 procedure Check_Components
(E
: Entity_Id
) is
4828 function Is_Preelaborable_Expression
(N
: Node_Id
) return Boolean;
4829 -- Returns True if and only if the expression denoted by N does not
4830 -- violate restrictions on preelaborable constructs (RM-10.2.1(5-9)).
4832 ---------------------------------
4833 -- Is_Preelaborable_Expression --
4834 ---------------------------------
4836 function Is_Preelaborable_Expression
(N
: Node_Id
) return Boolean is
4840 Comp_Type
: Entity_Id
;
4841 Is_Array_Aggr
: Boolean;
4844 if Is_Static_Expression
(N
) then
4847 elsif Nkind
(N
) = N_Null
then
4850 -- Attributes are allowed in general, even if their prefix is a
4851 -- formal type. (It seems that certain attributes known not to be
4852 -- static might not be allowed, but there are no rules to prevent
4855 elsif Nkind
(N
) = N_Attribute_Reference
then
4858 -- The name of a discriminant evaluated within its parent type is
4859 -- defined to be preelaborable (10.2.1(8)). Note that we test for
4860 -- names that denote discriminals as well as discriminants to
4861 -- catch references occurring within init procs.
4863 elsif Is_Entity_Name
(N
)
4865 (Ekind
(Entity
(N
)) = E_Discriminant
4867 ((Ekind
(Entity
(N
)) = E_Constant
4868 or else Ekind
(Entity
(N
)) = E_In_Parameter
)
4869 and then Present
(Discriminal_Link
(Entity
(N
)))))
4873 elsif Nkind
(N
) = N_Qualified_Expression
then
4874 return Is_Preelaborable_Expression
(Expression
(N
));
4876 -- For aggregates we have to check that each of the associations
4877 -- is preelaborable.
4879 elsif Nkind
(N
) = N_Aggregate
4880 or else Nkind
(N
) = N_Extension_Aggregate
4882 Is_Array_Aggr
:= Is_Array_Type
(Etype
(N
));
4884 if Is_Array_Aggr
then
4885 Comp_Type
:= Component_Type
(Etype
(N
));
4888 -- Check the ancestor part of extension aggregates, which must
4889 -- be either the name of a type that has preelaborable init or
4890 -- an expression that is preelaborable.
4892 if Nkind
(N
) = N_Extension_Aggregate
then
4894 Anc_Part
: constant Node_Id
:= Ancestor_Part
(N
);
4897 if Is_Entity_Name
(Anc_Part
)
4898 and then Is_Type
(Entity
(Anc_Part
))
4900 if not Has_Preelaborable_Initialization
4906 elsif not Is_Preelaborable_Expression
(Anc_Part
) then
4912 -- Check positional associations
4914 Exp
:= First
(Expressions
(N
));
4915 while Present
(Exp
) loop
4916 if not Is_Preelaborable_Expression
(Exp
) then
4923 -- Check named associations
4925 Assn
:= First
(Component_Associations
(N
));
4926 while Present
(Assn
) loop
4927 Choice
:= First
(Choices
(Assn
));
4928 while Present
(Choice
) loop
4929 if Is_Array_Aggr
then
4930 if Nkind
(Choice
) = N_Others_Choice
then
4933 elsif Nkind
(Choice
) = N_Range
then
4934 if not Is_Static_Range
(Choice
) then
4938 elsif not Is_Static_Expression
(Choice
) then
4943 Comp_Type
:= Etype
(Choice
);
4949 -- If the association has a <> at this point, then we have
4950 -- to check whether the component's type has preelaborable
4951 -- initialization. Note that this only occurs when the
4952 -- association's corresponding component does not have a
4953 -- default expression, the latter case having already been
4954 -- expanded as an expression for the association.
4956 if Box_Present
(Assn
) then
4957 if not Has_Preelaborable_Initialization
(Comp_Type
) then
4961 -- In the expression case we check whether the expression
4962 -- is preelaborable.
4965 not Is_Preelaborable_Expression
(Expression
(Assn
))
4973 -- If we get here then aggregate as a whole is preelaborable
4977 -- All other cases are not preelaborable
4982 end Is_Preelaborable_Expression
;
4984 -- Start of processing for Check_Components
4987 -- Loop through entities of record or protected type
4990 while Present
(Ent
) loop
4992 -- We are interested only in components and discriminants
4994 if Ekind_In
(Ent
, E_Component
, E_Discriminant
) then
4996 -- Get default expression if any. If there is no declaration
4997 -- node, it means we have an internal entity. The parent and
4998 -- tag fields are examples of such entities. For these cases,
4999 -- we just test the type of the entity.
5001 if Present
(Declaration_Node
(Ent
)) then
5002 Exp
:= Expression
(Declaration_Node
(Ent
));
5007 -- A component has PI if it has no default expression and the
5008 -- component type has PI.
5011 if not Has_Preelaborable_Initialization
(Etype
(Ent
)) then
5016 -- Require the default expression to be preelaborable
5018 elsif not Is_Preelaborable_Expression
(Exp
) then
5026 end Check_Components
;
5028 -- Start of processing for Has_Preelaborable_Initialization
5031 -- Immediate return if already marked as known preelaborable init. This
5032 -- covers types for which this function has already been called once
5033 -- and returned True (in which case the result is cached), and also
5034 -- types to which a pragma Preelaborable_Initialization applies.
5036 if Known_To_Have_Preelab_Init
(E
) then
5040 -- If the type is a subtype representing a generic actual type, then
5041 -- test whether its base type has preelaborable initialization since
5042 -- the subtype representing the actual does not inherit this attribute
5043 -- from the actual or formal. (but maybe it should???)
5045 if Is_Generic_Actual_Type
(E
) then
5046 return Has_Preelaborable_Initialization
(Base_Type
(E
));
5049 -- All elementary types have preelaborable initialization
5051 if Is_Elementary_Type
(E
) then
5054 -- Array types have PI if the component type has PI
5056 elsif Is_Array_Type
(E
) then
5057 Has_PE
:= Has_Preelaborable_Initialization
(Component_Type
(E
));
5059 -- A derived type has preelaborable initialization if its parent type
5060 -- has preelaborable initialization and (in the case of a derived record
5061 -- extension) if the non-inherited components all have preelaborable
5062 -- initialization. However, a user-defined controlled type with an
5063 -- overriding Initialize procedure does not have preelaborable
5066 elsif Is_Derived_Type
(E
) then
5068 -- If the derived type is a private extension then it doesn't have
5069 -- preelaborable initialization.
5071 if Ekind
(Base_Type
(E
)) = E_Record_Type_With_Private
then
5075 -- First check whether ancestor type has preelaborable initialization
5077 Has_PE
:= Has_Preelaborable_Initialization
(Etype
(Base_Type
(E
)));
5079 -- If OK, check extension components (if any)
5081 if Has_PE
and then Is_Record_Type
(E
) then
5082 Check_Components
(First_Entity
(E
));
5085 -- Check specifically for 10.2.1(11.4/2) exception: a controlled type
5086 -- with a user defined Initialize procedure does not have PI.
5089 and then Is_Controlled
(E
)
5090 and then Has_Overriding_Initialize
(E
)
5095 -- Private types not derived from a type having preelaborable init and
5096 -- that are not marked with pragma Preelaborable_Initialization do not
5097 -- have preelaborable initialization.
5099 elsif Is_Private_Type
(E
) then
5102 -- Record type has PI if it is non private and all components have PI
5104 elsif Is_Record_Type
(E
) then
5106 Check_Components
(First_Entity
(E
));
5108 -- Protected types must not have entries, and components must meet
5109 -- same set of rules as for record components.
5111 elsif Is_Protected_Type
(E
) then
5112 if Has_Entries
(E
) then
5116 Check_Components
(First_Entity
(E
));
5117 Check_Components
(First_Private_Entity
(E
));
5120 -- Type System.Address always has preelaborable initialization
5122 elsif Is_RTE
(E
, RE_Address
) then
5125 -- In all other cases, type does not have preelaborable initialization
5131 -- If type has preelaborable initialization, cache result
5134 Set_Known_To_Have_Preelab_Init
(E
);
5138 end Has_Preelaborable_Initialization
;
5140 ---------------------------
5141 -- Has_Private_Component --
5142 ---------------------------
5144 function Has_Private_Component
(Type_Id
: Entity_Id
) return Boolean is
5145 Btype
: Entity_Id
:= Base_Type
(Type_Id
);
5146 Component
: Entity_Id
;
5149 if Error_Posted
(Type_Id
)
5150 or else Error_Posted
(Btype
)
5155 if Is_Class_Wide_Type
(Btype
) then
5156 Btype
:= Root_Type
(Btype
);
5159 if Is_Private_Type
(Btype
) then
5161 UT
: constant Entity_Id
:= Underlying_Type
(Btype
);
5164 if No
(Full_View
(Btype
)) then
5165 return not Is_Generic_Type
(Btype
)
5166 and then not Is_Generic_Type
(Root_Type
(Btype
));
5168 return not Is_Generic_Type
(Root_Type
(Full_View
(Btype
)));
5171 return not Is_Frozen
(UT
) and then Has_Private_Component
(UT
);
5175 elsif Is_Array_Type
(Btype
) then
5176 return Has_Private_Component
(Component_Type
(Btype
));
5178 elsif Is_Record_Type
(Btype
) then
5179 Component
:= First_Component
(Btype
);
5180 while Present
(Component
) loop
5181 if Has_Private_Component
(Etype
(Component
)) then
5185 Next_Component
(Component
);
5190 elsif Is_Protected_Type
(Btype
)
5191 and then Present
(Corresponding_Record_Type
(Btype
))
5193 return Has_Private_Component
(Corresponding_Record_Type
(Btype
));
5198 end Has_Private_Component
;
5204 function Has_Stream
(T
: Entity_Id
) return Boolean is
5211 elsif Is_RTE
(Root_Type
(T
), RE_Root_Stream_Type
) then
5214 elsif Is_Array_Type
(T
) then
5215 return Has_Stream
(Component_Type
(T
));
5217 elsif Is_Record_Type
(T
) then
5218 E
:= First_Component
(T
);
5219 while Present
(E
) loop
5220 if Has_Stream
(Etype
(E
)) then
5229 elsif Is_Private_Type
(T
) then
5230 return Has_Stream
(Underlying_Type
(T
));
5241 function Has_Suffix
(E
: Entity_Id
; Suffix
: Character) return Boolean is
5243 Get_Name_String
(Chars
(E
));
5244 return Name_Buffer
(Name_Len
) = Suffix
;
5247 --------------------------
5248 -- Has_Tagged_Component --
5249 --------------------------
5251 function Has_Tagged_Component
(Typ
: Entity_Id
) return Boolean is
5255 if Is_Private_Type
(Typ
)
5256 and then Present
(Underlying_Type
(Typ
))
5258 return Has_Tagged_Component
(Underlying_Type
(Typ
));
5260 elsif Is_Array_Type
(Typ
) then
5261 return Has_Tagged_Component
(Component_Type
(Typ
));
5263 elsif Is_Tagged_Type
(Typ
) then
5266 elsif Is_Record_Type
(Typ
) then
5267 Comp
:= First_Component
(Typ
);
5268 while Present
(Comp
) loop
5269 if Has_Tagged_Component
(Etype
(Comp
)) then
5273 Next_Component
(Comp
);
5281 end Has_Tagged_Component
;
5283 -------------------------
5284 -- Implementation_Kind --
5285 -------------------------
5287 function Implementation_Kind
(Subp
: Entity_Id
) return Name_Id
is
5288 Impl_Prag
: constant Node_Id
:= Get_Rep_Pragma
(Subp
, Name_Implemented
);
5290 pragma Assert
(Present
(Impl_Prag
));
5292 Chars
(Expression
(Last
(Pragma_Argument_Associations
(Impl_Prag
))));
5293 end Implementation_Kind
;
5295 --------------------------
5296 -- Implements_Interface --
5297 --------------------------
5299 function Implements_Interface
5300 (Typ_Ent
: Entity_Id
;
5301 Iface_Ent
: Entity_Id
;
5302 Exclude_Parents
: Boolean := False) return Boolean
5304 Ifaces_List
: Elist_Id
;
5306 Iface
: Entity_Id
:= Base_Type
(Iface_Ent
);
5307 Typ
: Entity_Id
:= Base_Type
(Typ_Ent
);
5310 if Is_Class_Wide_Type
(Typ
) then
5311 Typ
:= Root_Type
(Typ
);
5314 if not Has_Interfaces
(Typ
) then
5318 if Is_Class_Wide_Type
(Iface
) then
5319 Iface
:= Root_Type
(Iface
);
5322 Collect_Interfaces
(Typ
, Ifaces_List
);
5324 Elmt
:= First_Elmt
(Ifaces_List
);
5325 while Present
(Elmt
) loop
5326 if Is_Ancestor
(Node
(Elmt
), Typ
)
5327 and then Exclude_Parents
5331 elsif Node
(Elmt
) = Iface
then
5339 end Implements_Interface
;
5345 function In_Instance
return Boolean is
5346 Curr_Unit
: constant Entity_Id
:= Cunit_Entity
(Current_Sem_Unit
);
5352 and then S
/= Standard_Standard
5354 if (Ekind
(S
) = E_Function
5355 or else Ekind
(S
) = E_Package
5356 or else Ekind
(S
) = E_Procedure
)
5357 and then Is_Generic_Instance
(S
)
5359 -- A child instance is always compiled in the context of a parent
5360 -- instance. Nevertheless, the actuals are not analyzed in an
5361 -- instance context. We detect this case by examining the current
5362 -- compilation unit, which must be a child instance, and checking
5363 -- that it is not currently on the scope stack.
5365 if Is_Child_Unit
(Curr_Unit
)
5367 Nkind
(Unit
(Cunit
(Current_Sem_Unit
)))
5368 = N_Package_Instantiation
5369 and then not In_Open_Scopes
(Curr_Unit
)
5383 ----------------------
5384 -- In_Instance_Body --
5385 ----------------------
5387 function In_Instance_Body
return Boolean is
5393 and then S
/= Standard_Standard
5395 if (Ekind
(S
) = E_Function
5396 or else Ekind
(S
) = E_Procedure
)
5397 and then Is_Generic_Instance
(S
)
5401 elsif Ekind
(S
) = E_Package
5402 and then In_Package_Body
(S
)
5403 and then Is_Generic_Instance
(S
)
5412 end In_Instance_Body
;
5414 -----------------------------
5415 -- In_Instance_Not_Visible --
5416 -----------------------------
5418 function In_Instance_Not_Visible
return Boolean is
5424 and then S
/= Standard_Standard
5426 if (Ekind
(S
) = E_Function
5427 or else Ekind
(S
) = E_Procedure
)
5428 and then Is_Generic_Instance
(S
)
5432 elsif Ekind
(S
) = E_Package
5433 and then (In_Package_Body
(S
) or else In_Private_Part
(S
))
5434 and then Is_Generic_Instance
(S
)
5443 end In_Instance_Not_Visible
;
5445 ------------------------------
5446 -- In_Instance_Visible_Part --
5447 ------------------------------
5449 function In_Instance_Visible_Part
return Boolean is
5455 and then S
/= Standard_Standard
5457 if Ekind
(S
) = E_Package
5458 and then Is_Generic_Instance
(S
)
5459 and then not In_Package_Body
(S
)
5460 and then not In_Private_Part
(S
)
5469 end In_Instance_Visible_Part
;
5471 ---------------------
5472 -- In_Package_Body --
5473 ---------------------
5475 function In_Package_Body
return Boolean is
5481 and then S
/= Standard_Standard
5483 if Ekind
(S
) = E_Package
5484 and then In_Package_Body
(S
)
5493 end In_Package_Body
;
5495 --------------------------------
5496 -- In_Parameter_Specification --
5497 --------------------------------
5499 function In_Parameter_Specification
(N
: Node_Id
) return Boolean is
5504 while Present
(PN
) loop
5505 if Nkind
(PN
) = N_Parameter_Specification
then
5513 end In_Parameter_Specification
;
5515 --------------------------------------
5516 -- In_Subprogram_Or_Concurrent_Unit --
5517 --------------------------------------
5519 function In_Subprogram_Or_Concurrent_Unit
return Boolean is
5524 -- Use scope chain to check successively outer scopes
5530 if K
in Subprogram_Kind
5531 or else K
in Concurrent_Kind
5532 or else K
in Generic_Subprogram_Kind
5536 elsif E
= Standard_Standard
then
5542 end In_Subprogram_Or_Concurrent_Unit
;
5544 ---------------------
5545 -- In_Visible_Part --
5546 ---------------------
5548 function In_Visible_Part
(Scope_Id
: Entity_Id
) return Boolean is
5551 Is_Package_Or_Generic_Package
(Scope_Id
)
5552 and then In_Open_Scopes
(Scope_Id
)
5553 and then not In_Package_Body
(Scope_Id
)
5554 and then not In_Private_Part
(Scope_Id
);
5555 end In_Visible_Part
;
5557 ---------------------------------
5558 -- Insert_Explicit_Dereference --
5559 ---------------------------------
5561 procedure Insert_Explicit_Dereference
(N
: Node_Id
) is
5562 New_Prefix
: constant Node_Id
:= Relocate_Node
(N
);
5563 Ent
: Entity_Id
:= Empty
;
5570 Save_Interps
(N
, New_Prefix
);
5573 Make_Explicit_Dereference
(Sloc
(Parent
(N
)), Prefix
=> New_Prefix
));
5575 Set_Etype
(N
, Designated_Type
(Etype
(New_Prefix
)));
5577 if Is_Overloaded
(New_Prefix
) then
5579 -- The dereference is also overloaded, and its interpretations are
5580 -- the designated types of the interpretations of the original node.
5582 Set_Etype
(N
, Any_Type
);
5584 Get_First_Interp
(New_Prefix
, I
, It
);
5585 while Present
(It
.Nam
) loop
5588 if Is_Access_Type
(T
) then
5589 Add_One_Interp
(N
, Designated_Type
(T
), Designated_Type
(T
));
5592 Get_Next_Interp
(I
, It
);
5598 -- Prefix is unambiguous: mark the original prefix (which might
5599 -- Come_From_Source) as a reference, since the new (relocated) one
5600 -- won't be taken into account.
5602 if Is_Entity_Name
(New_Prefix
) then
5603 Ent
:= Entity
(New_Prefix
);
5606 -- For a retrieval of a subcomponent of some composite object,
5607 -- retrieve the ultimate entity if there is one.
5609 elsif Nkind
(New_Prefix
) = N_Selected_Component
5610 or else Nkind
(New_Prefix
) = N_Indexed_Component
5612 Pref
:= Prefix
(New_Prefix
);
5613 while Present
(Pref
)
5615 (Nkind
(Pref
) = N_Selected_Component
5616 or else Nkind
(Pref
) = N_Indexed_Component
)
5618 Pref
:= Prefix
(Pref
);
5621 if Present
(Pref
) and then Is_Entity_Name
(Pref
) then
5622 Ent
:= Entity
(Pref
);
5626 -- Place the reference on the entity node.
5628 if Present
(Ent
) then
5629 Generate_Reference
(Ent
, Pref
);
5632 end Insert_Explicit_Dereference
;
5634 ------------------------------------------
5635 -- Inspect_Deferred_Constant_Completion --
5636 ------------------------------------------
5638 procedure Inspect_Deferred_Constant_Completion
(Decls
: List_Id
) is
5642 Decl
:= First
(Decls
);
5643 while Present
(Decl
) loop
5645 -- Deferred constant signature
5647 if Nkind
(Decl
) = N_Object_Declaration
5648 and then Constant_Present
(Decl
)
5649 and then No
(Expression
(Decl
))
5651 -- No need to check internally generated constants
5653 and then Comes_From_Source
(Decl
)
5655 -- The constant is not completed. A full object declaration
5656 -- or a pragma Import complete a deferred constant.
5658 and then not Has_Completion
(Defining_Identifier
(Decl
))
5661 ("constant declaration requires initialization expression",
5662 Defining_Identifier
(Decl
));
5665 Decl
:= Next
(Decl
);
5667 end Inspect_Deferred_Constant_Completion
;
5673 function Is_AAMP_Float
(E
: Entity_Id
) return Boolean is
5674 pragma Assert
(Is_Type
(E
));
5676 return AAMP_On_Target
5677 and then Is_Floating_Point_Type
(E
)
5678 and then E
= Base_Type
(E
);
5681 -----------------------------
5682 -- Is_Actual_Out_Parameter --
5683 -----------------------------
5685 function Is_Actual_Out_Parameter
(N
: Node_Id
) return Boolean is
5689 Find_Actual
(N
, Formal
, Call
);
5690 return Present
(Formal
)
5691 and then Ekind
(Formal
) = E_Out_Parameter
;
5692 end Is_Actual_Out_Parameter
;
5694 -------------------------
5695 -- Is_Actual_Parameter --
5696 -------------------------
5698 function Is_Actual_Parameter
(N
: Node_Id
) return Boolean is
5699 PK
: constant Node_Kind
:= Nkind
(Parent
(N
));
5703 when N_Parameter_Association
=>
5704 return N
= Explicit_Actual_Parameter
(Parent
(N
));
5706 when N_Function_Call | N_Procedure_Call_Statement
=>
5707 return Is_List_Member
(N
)
5709 List_Containing
(N
) = Parameter_Associations
(Parent
(N
));
5714 end Is_Actual_Parameter
;
5716 ---------------------
5717 -- Is_Aliased_View --
5718 ---------------------
5720 function Is_Aliased_View
(Obj
: Node_Id
) return Boolean is
5724 if Is_Entity_Name
(Obj
) then
5732 or else (Present
(Renamed_Object
(E
))
5733 and then Is_Aliased_View
(Renamed_Object
(E
)))))
5735 or else ((Is_Formal
(E
)
5736 or else Ekind
(E
) = E_Generic_In_Out_Parameter
5737 or else Ekind
(E
) = E_Generic_In_Parameter
)
5738 and then Is_Tagged_Type
(Etype
(E
)))
5740 or else (Is_Concurrent_Type
(E
)
5741 and then In_Open_Scopes
(E
))
5743 -- Current instance of type, either directly or as rewritten
5744 -- reference to the current object.
5746 or else (Is_Entity_Name
(Original_Node
(Obj
))
5747 and then Present
(Entity
(Original_Node
(Obj
)))
5748 and then Is_Type
(Entity
(Original_Node
(Obj
))))
5750 or else (Is_Type
(E
) and then E
= Current_Scope
)
5752 or else (Is_Incomplete_Or_Private_Type
(E
)
5753 and then Full_View
(E
) = Current_Scope
);
5755 elsif Nkind
(Obj
) = N_Selected_Component
then
5756 return Is_Aliased
(Entity
(Selector_Name
(Obj
)));
5758 elsif Nkind
(Obj
) = N_Indexed_Component
then
5759 return Has_Aliased_Components
(Etype
(Prefix
(Obj
)))
5761 (Is_Access_Type
(Etype
(Prefix
(Obj
)))
5763 Has_Aliased_Components
5764 (Designated_Type
(Etype
(Prefix
(Obj
)))));
5766 elsif Nkind
(Obj
) = N_Unchecked_Type_Conversion
5767 or else Nkind
(Obj
) = N_Type_Conversion
5769 return Is_Tagged_Type
(Etype
(Obj
))
5770 and then Is_Aliased_View
(Expression
(Obj
));
5772 elsif Nkind
(Obj
) = N_Explicit_Dereference
then
5773 return Nkind
(Original_Node
(Obj
)) /= N_Function_Call
;
5778 end Is_Aliased_View
;
5780 -------------------------
5781 -- Is_Ancestor_Package --
5782 -------------------------
5784 function Is_Ancestor_Package
5786 E2
: Entity_Id
) return Boolean
5793 and then Par
/= Standard_Standard
5803 end Is_Ancestor_Package
;
5805 ----------------------
5806 -- Is_Atomic_Object --
5807 ----------------------
5809 function Is_Atomic_Object
(N
: Node_Id
) return Boolean is
5811 function Object_Has_Atomic_Components
(N
: Node_Id
) return Boolean;
5812 -- Determines if given object has atomic components
5814 function Is_Atomic_Prefix
(N
: Node_Id
) return Boolean;
5815 -- If prefix is an implicit dereference, examine designated type
5817 ----------------------
5818 -- Is_Atomic_Prefix --
5819 ----------------------
5821 function Is_Atomic_Prefix
(N
: Node_Id
) return Boolean is
5823 if Is_Access_Type
(Etype
(N
)) then
5825 Has_Atomic_Components
(Designated_Type
(Etype
(N
)));
5827 return Object_Has_Atomic_Components
(N
);
5829 end Is_Atomic_Prefix
;
5831 ----------------------------------
5832 -- Object_Has_Atomic_Components --
5833 ----------------------------------
5835 function Object_Has_Atomic_Components
(N
: Node_Id
) return Boolean is
5837 if Has_Atomic_Components
(Etype
(N
))
5838 or else Is_Atomic
(Etype
(N
))
5842 elsif Is_Entity_Name
(N
)
5843 and then (Has_Atomic_Components
(Entity
(N
))
5844 or else Is_Atomic
(Entity
(N
)))
5848 elsif Nkind
(N
) = N_Indexed_Component
5849 or else Nkind
(N
) = N_Selected_Component
5851 return Is_Atomic_Prefix
(Prefix
(N
));
5856 end Object_Has_Atomic_Components
;
5858 -- Start of processing for Is_Atomic_Object
5861 -- Predicate is not relevant to subprograms
5863 if Is_Entity_Name
(N
)
5864 and then Is_Overloadable
(Entity
(N
))
5868 elsif Is_Atomic
(Etype
(N
))
5869 or else (Is_Entity_Name
(N
) and then Is_Atomic
(Entity
(N
)))
5873 elsif Nkind
(N
) = N_Indexed_Component
5874 or else Nkind
(N
) = N_Selected_Component
5876 return Is_Atomic_Prefix
(Prefix
(N
));
5881 end Is_Atomic_Object
;
5883 -------------------------
5884 -- Is_Coextension_Root --
5885 -------------------------
5887 function Is_Coextension_Root
(N
: Node_Id
) return Boolean is
5890 Nkind
(N
) = N_Allocator
5891 and then Present
(Coextensions
(N
))
5893 -- Anonymous access discriminants carry a list of all nested
5894 -- controlled coextensions.
5896 and then not Is_Dynamic_Coextension
(N
)
5897 and then not Is_Static_Coextension
(N
);
5898 end Is_Coextension_Root
;
5900 -----------------------------
5901 -- Is_Concurrent_Interface --
5902 -----------------------------
5904 function Is_Concurrent_Interface
(T
: Entity_Id
) return Boolean is
5909 (Is_Protected_Interface
(T
)
5910 or else Is_Synchronized_Interface
(T
)
5911 or else Is_Task_Interface
(T
));
5912 end Is_Concurrent_Interface
;
5914 --------------------------------------
5915 -- Is_Controlling_Limited_Procedure --
5916 --------------------------------------
5918 function Is_Controlling_Limited_Procedure
5919 (Proc_Nam
: Entity_Id
) return Boolean
5921 Param_Typ
: Entity_Id
:= Empty
;
5924 if Ekind
(Proc_Nam
) = E_Procedure
5925 and then Present
(Parameter_Specifications
(Parent
(Proc_Nam
)))
5927 Param_Typ
:= Etype
(Parameter_Type
(First
(
5928 Parameter_Specifications
(Parent
(Proc_Nam
)))));
5930 -- In this case where an Itype was created, the procedure call has been
5933 elsif Present
(Associated_Node_For_Itype
(Proc_Nam
))
5934 and then Present
(Original_Node
(Associated_Node_For_Itype
(Proc_Nam
)))
5936 Present
(Parameter_Associations
5937 (Associated_Node_For_Itype
(Proc_Nam
)))
5940 Etype
(First
(Parameter_Associations
5941 (Associated_Node_For_Itype
(Proc_Nam
))));
5944 if Present
(Param_Typ
) then
5946 Is_Interface
(Param_Typ
)
5947 and then Is_Limited_Record
(Param_Typ
);
5951 end Is_Controlling_Limited_Procedure
;
5953 -----------------------------
5954 -- Is_CPP_Constructor_Call --
5955 -----------------------------
5957 function Is_CPP_Constructor_Call
(N
: Node_Id
) return Boolean is
5959 return Nkind
(N
) = N_Function_Call
5960 and then Is_CPP_Class
(Etype
(Etype
(N
)))
5961 and then Is_Constructor
(Entity
(Name
(N
)))
5962 and then Is_Imported
(Entity
(Name
(N
)));
5963 end Is_CPP_Constructor_Call
;
5969 function Is_Delegate
(T
: Entity_Id
) return Boolean is
5970 Desig_Type
: Entity_Id
;
5973 if VM_Target
/= CLI_Target
then
5977 -- Access-to-subprograms are delegates in CIL
5979 if Ekind
(T
) = E_Access_Subprogram_Type
then
5983 if Ekind
(T
) not in Access_Kind
then
5985 -- A delegate is a managed pointer. If no designated type is defined
5986 -- it means that it's not a delegate.
5991 Desig_Type
:= Etype
(Directly_Designated_Type
(T
));
5993 if not Is_Tagged_Type
(Desig_Type
) then
5997 -- Test if the type is inherited from [mscorlib]System.Delegate
5999 while Etype
(Desig_Type
) /= Desig_Type
loop
6000 if Chars
(Scope
(Desig_Type
)) /= No_Name
6001 and then Is_Imported
(Scope
(Desig_Type
))
6002 and then Get_Name_String
(Chars
(Scope
(Desig_Type
))) = "delegate"
6007 Desig_Type
:= Etype
(Desig_Type
);
6013 ----------------------------------------------
6014 -- Is_Dependent_Component_Of_Mutable_Object --
6015 ----------------------------------------------
6017 function Is_Dependent_Component_Of_Mutable_Object
6018 (Object
: Node_Id
) return Boolean
6021 Prefix_Type
: Entity_Id
;
6022 P_Aliased
: Boolean := False;
6025 function Is_Declared_Within_Variant
(Comp
: Entity_Id
) return Boolean;
6026 -- Returns True if and only if Comp is declared within a variant part
6028 --------------------------------
6029 -- Is_Declared_Within_Variant --
6030 --------------------------------
6032 function Is_Declared_Within_Variant
(Comp
: Entity_Id
) return Boolean is
6033 Comp_Decl
: constant Node_Id
:= Parent
(Comp
);
6034 Comp_List
: constant Node_Id
:= Parent
(Comp_Decl
);
6036 return Nkind
(Parent
(Comp_List
)) = N_Variant
;
6037 end Is_Declared_Within_Variant
;
6039 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
6042 if Is_Variable
(Object
) then
6044 if Nkind
(Object
) = N_Selected_Component
then
6045 P
:= Prefix
(Object
);
6046 Prefix_Type
:= Etype
(P
);
6048 if Is_Entity_Name
(P
) then
6050 if Ekind
(Entity
(P
)) = E_Generic_In_Out_Parameter
then
6051 Prefix_Type
:= Base_Type
(Prefix_Type
);
6054 if Is_Aliased
(Entity
(P
)) then
6058 -- A discriminant check on a selected component may be
6059 -- expanded into a dereference when removing side-effects.
6060 -- Recover the original node and its type, which may be
6063 elsif Nkind
(P
) = N_Explicit_Dereference
6064 and then not (Comes_From_Source
(P
))
6066 P
:= Original_Node
(P
);
6067 Prefix_Type
:= Etype
(P
);
6070 -- Check for prefix being an aliased component ???
6075 -- A heap object is constrained by its initial value
6077 -- Ada 2005 (AI-363): Always assume the object could be mutable in
6078 -- the dereferenced case, since the access value might denote an
6079 -- unconstrained aliased object, whereas in Ada 95 the designated
6080 -- object is guaranteed to be constrained. A worst-case assumption
6081 -- has to apply in Ada 2005 because we can't tell at compile time
6082 -- whether the object is "constrained by its initial value"
6083 -- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are
6084 -- semantic rules -- these rules are acknowledged to need fixing).
6086 if Ada_Version
< Ada_2005
then
6087 if Is_Access_Type
(Prefix_Type
)
6088 or else Nkind
(P
) = N_Explicit_Dereference
6093 elsif Ada_Version
>= Ada_2005
then
6094 if Is_Access_Type
(Prefix_Type
) then
6096 -- If the access type is pool-specific, and there is no
6097 -- constrained partial view of the designated type, then the
6098 -- designated object is known to be constrained.
6100 if Ekind
(Prefix_Type
) = E_Access_Type
6101 and then not Has_Constrained_Partial_View
6102 (Designated_Type
(Prefix_Type
))
6106 -- Otherwise (general access type, or there is a constrained
6107 -- partial view of the designated type), we need to check
6108 -- based on the designated type.
6111 Prefix_Type
:= Designated_Type
(Prefix_Type
);
6117 Original_Record_Component
(Entity
(Selector_Name
(Object
)));
6119 -- As per AI-0017, the renaming is illegal in a generic body,
6120 -- even if the subtype is indefinite.
6122 -- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
6124 if not Is_Constrained
(Prefix_Type
)
6125 and then (not Is_Indefinite_Subtype
(Prefix_Type
)
6127 (Is_Generic_Type
(Prefix_Type
)
6128 and then Ekind
(Current_Scope
) = E_Generic_Package
6129 and then In_Package_Body
(Current_Scope
)))
6131 and then (Is_Declared_Within_Variant
(Comp
)
6132 or else Has_Discriminant_Dependent_Constraint
(Comp
))
6133 and then (not P_Aliased
or else Ada_Version
>= Ada_2005
)
6139 Is_Dependent_Component_Of_Mutable_Object
(Prefix
(Object
));
6143 elsif Nkind
(Object
) = N_Indexed_Component
6144 or else Nkind
(Object
) = N_Slice
6146 return Is_Dependent_Component_Of_Mutable_Object
(Prefix
(Object
));
6148 -- A type conversion that Is_Variable is a view conversion:
6149 -- go back to the denoted object.
6151 elsif Nkind
(Object
) = N_Type_Conversion
then
6153 Is_Dependent_Component_Of_Mutable_Object
(Expression
(Object
));
6158 end Is_Dependent_Component_Of_Mutable_Object
;
6160 ---------------------
6161 -- Is_Dereferenced --
6162 ---------------------
6164 function Is_Dereferenced
(N
: Node_Id
) return Boolean is
6165 P
: constant Node_Id
:= Parent
(N
);
6168 (Nkind
(P
) = N_Selected_Component
6170 Nkind
(P
) = N_Explicit_Dereference
6172 Nkind
(P
) = N_Indexed_Component
6174 Nkind
(P
) = N_Slice
)
6175 and then Prefix
(P
) = N
;
6176 end Is_Dereferenced
;
6178 ----------------------
6179 -- Is_Descendent_Of --
6180 ----------------------
6182 function Is_Descendent_Of
(T1
: Entity_Id
; T2
: Entity_Id
) return Boolean is
6187 pragma Assert
(Nkind
(T1
) in N_Entity
);
6188 pragma Assert
(Nkind
(T2
) in N_Entity
);
6190 T
:= Base_Type
(T1
);
6192 -- Immediate return if the types match
6197 -- Comment needed here ???
6199 elsif Ekind
(T
) = E_Class_Wide_Type
then
6200 return Etype
(T
) = T2
;
6208 -- Done if we found the type we are looking for
6213 -- Done if no more derivations to check
6220 -- Following test catches error cases resulting from prev errors
6222 elsif No
(Etyp
) then
6225 elsif Is_Private_Type
(T
) and then Etyp
= Full_View
(T
) then
6228 elsif Is_Private_Type
(Etyp
) and then Full_View
(Etyp
) = T
then
6232 T
:= Base_Type
(Etyp
);
6235 end Is_Descendent_Of
;
6241 function Is_False
(U
: Uint
) return Boolean is
6246 ---------------------------
6247 -- Is_Fixed_Model_Number --
6248 ---------------------------
6250 function Is_Fixed_Model_Number
(U
: Ureal
; T
: Entity_Id
) return Boolean is
6251 S
: constant Ureal
:= Small_Value
(T
);
6252 M
: Urealp
.Save_Mark
;
6256 R
:= (U
= UR_Trunc
(U
/ S
) * S
);
6259 end Is_Fixed_Model_Number
;
6261 -------------------------------
6262 -- Is_Fully_Initialized_Type --
6263 -------------------------------
6265 function Is_Fully_Initialized_Type
(Typ
: Entity_Id
) return Boolean is
6267 if Is_Scalar_Type
(Typ
) then
6270 elsif Is_Access_Type
(Typ
) then
6273 elsif Is_Array_Type
(Typ
) then
6274 if Is_Fully_Initialized_Type
(Component_Type
(Typ
)) then
6278 -- An interesting case, if we have a constrained type one of whose
6279 -- bounds is known to be null, then there are no elements to be
6280 -- initialized, so all the elements are initialized!
6282 if Is_Constrained
(Typ
) then
6285 Indx_Typ
: Entity_Id
;
6289 Indx
:= First_Index
(Typ
);
6290 while Present
(Indx
) loop
6291 if Etype
(Indx
) = Any_Type
then
6294 -- If index is a range, use directly
6296 elsif Nkind
(Indx
) = N_Range
then
6297 Lbd
:= Low_Bound
(Indx
);
6298 Hbd
:= High_Bound
(Indx
);
6301 Indx_Typ
:= Etype
(Indx
);
6303 if Is_Private_Type
(Indx_Typ
) then
6304 Indx_Typ
:= Full_View
(Indx_Typ
);
6307 if No
(Indx_Typ
) or else Etype
(Indx_Typ
) = Any_Type
then
6310 Lbd
:= Type_Low_Bound
(Indx_Typ
);
6311 Hbd
:= Type_High_Bound
(Indx_Typ
);
6315 if Compile_Time_Known_Value
(Lbd
)
6316 and then Compile_Time_Known_Value
(Hbd
)
6318 if Expr_Value
(Hbd
) < Expr_Value
(Lbd
) then
6328 -- If no null indexes, then type is not fully initialized
6334 elsif Is_Record_Type
(Typ
) then
6335 if Has_Discriminants
(Typ
)
6337 Present
(Discriminant_Default_Value
(First_Discriminant
(Typ
)))
6338 and then Is_Fully_Initialized_Variant
(Typ
)
6343 -- Controlled records are considered to be fully initialized if
6344 -- there is a user defined Initialize routine. This may not be
6345 -- entirely correct, but as the spec notes, we are guessing here
6346 -- what is best from the point of view of issuing warnings.
6348 if Is_Controlled
(Typ
) then
6350 Utyp
: constant Entity_Id
:= Underlying_Type
(Typ
);
6353 if Present
(Utyp
) then
6355 Init
: constant Entity_Id
:=
6357 (Underlying_Type
(Typ
), Name_Initialize
));
6361 and then Comes_From_Source
(Init
)
6363 Is_Predefined_File_Name
6364 (File_Name
(Get_Source_File_Index
(Sloc
(Init
))))
6368 elsif Has_Null_Extension
(Typ
)
6370 Is_Fully_Initialized_Type
6371 (Etype
(Base_Type
(Typ
)))
6380 -- Otherwise see if all record components are initialized
6386 Ent
:= First_Entity
(Typ
);
6387 while Present
(Ent
) loop
6388 if Chars
(Ent
) = Name_uController
then
6391 elsif Ekind
(Ent
) = E_Component
6392 and then (No
(Parent
(Ent
))
6393 or else No
(Expression
(Parent
(Ent
))))
6394 and then not Is_Fully_Initialized_Type
(Etype
(Ent
))
6396 -- Special VM case for tag components, which need to be
6397 -- defined in this case, but are never initialized as VMs
6398 -- are using other dispatching mechanisms. Ignore this
6399 -- uninitialized case. Note that this applies both to the
6400 -- uTag entry and the main vtable pointer (CPP_Class case).
6402 and then (Tagged_Type_Expansion
or else not Is_Tag
(Ent
))
6411 -- No uninitialized components, so type is fully initialized.
6412 -- Note that this catches the case of no components as well.
6416 elsif Is_Concurrent_Type
(Typ
) then
6419 elsif Is_Private_Type
(Typ
) then
6421 U
: constant Entity_Id
:= Underlying_Type
(Typ
);
6427 return Is_Fully_Initialized_Type
(U
);
6434 end Is_Fully_Initialized_Type
;
6436 ----------------------------------
6437 -- Is_Fully_Initialized_Variant --
6438 ----------------------------------
6440 function Is_Fully_Initialized_Variant
(Typ
: Entity_Id
) return Boolean is
6441 Loc
: constant Source_Ptr
:= Sloc
(Typ
);
6442 Constraints
: constant List_Id
:= New_List
;
6443 Components
: constant Elist_Id
:= New_Elmt_List
;
6444 Comp_Elmt
: Elmt_Id
;
6446 Comp_List
: Node_Id
;
6448 Discr_Val
: Node_Id
;
6450 Report_Errors
: Boolean;
6451 pragma Warnings
(Off
, Report_Errors
);
6454 if Serious_Errors_Detected
> 0 then
6458 if Is_Record_Type
(Typ
)
6459 and then Nkind
(Parent
(Typ
)) = N_Full_Type_Declaration
6460 and then Nkind
(Type_Definition
(Parent
(Typ
))) = N_Record_Definition
6462 Comp_List
:= Component_List
(Type_Definition
(Parent
(Typ
)));
6464 Discr
:= First_Discriminant
(Typ
);
6465 while Present
(Discr
) loop
6466 if Nkind
(Parent
(Discr
)) = N_Discriminant_Specification
then
6467 Discr_Val
:= Expression
(Parent
(Discr
));
6469 if Present
(Discr_Val
)
6470 and then Is_OK_Static_Expression
(Discr_Val
)
6472 Append_To
(Constraints
,
6473 Make_Component_Association
(Loc
,
6474 Choices
=> New_List
(New_Occurrence_Of
(Discr
, Loc
)),
6475 Expression
=> New_Copy
(Discr_Val
)));
6483 Next_Discriminant
(Discr
);
6488 Comp_List
=> Comp_List
,
6489 Governed_By
=> Constraints
,
6491 Report_Errors
=> Report_Errors
);
6493 -- Check that each component present is fully initialized
6495 Comp_Elmt
:= First_Elmt
(Components
);
6496 while Present
(Comp_Elmt
) loop
6497 Comp_Id
:= Node
(Comp_Elmt
);
6499 if Ekind
(Comp_Id
) = E_Component
6500 and then (No
(Parent
(Comp_Id
))
6501 or else No
(Expression
(Parent
(Comp_Id
))))
6502 and then not Is_Fully_Initialized_Type
(Etype
(Comp_Id
))
6507 Next_Elmt
(Comp_Elmt
);
6512 elsif Is_Private_Type
(Typ
) then
6514 U
: constant Entity_Id
:= Underlying_Type
(Typ
);
6520 return Is_Fully_Initialized_Variant
(U
);
6526 end Is_Fully_Initialized_Variant
;
6532 -- We seem to have a lot of overlapping functions that do similar things
6533 -- (testing for left hand sides or lvalues???). Anyway, since this one is
6534 -- purely syntactic, it should be in Sem_Aux I would think???
6536 function Is_LHS
(N
: Node_Id
) return Boolean is
6537 P
: constant Node_Id
:= Parent
(N
);
6539 return Nkind
(P
) = N_Assignment_Statement
6540 and then Name
(P
) = N
;
6543 ----------------------------
6544 -- Is_Inherited_Operation --
6545 ----------------------------
6547 function Is_Inherited_Operation
(E
: Entity_Id
) return Boolean is
6548 Kind
: constant Node_Kind
:= Nkind
(Parent
(E
));
6550 pragma Assert
(Is_Overloadable
(E
));
6551 return Kind
= N_Full_Type_Declaration
6552 or else Kind
= N_Private_Extension_Declaration
6553 or else Kind
= N_Subtype_Declaration
6554 or else (Ekind
(E
) = E_Enumeration_Literal
6555 and then Is_Derived_Type
(Etype
(E
)));
6556 end Is_Inherited_Operation
;
6558 -----------------------------
6559 -- Is_Library_Level_Entity --
6560 -----------------------------
6562 function Is_Library_Level_Entity
(E
: Entity_Id
) return Boolean is
6564 -- The following is a small optimization, and it also properly handles
6565 -- discriminals, which in task bodies might appear in expressions before
6566 -- the corresponding procedure has been created, and which therefore do
6567 -- not have an assigned scope.
6569 if Is_Formal
(E
) then
6573 -- Normal test is simply that the enclosing dynamic scope is Standard
6575 return Enclosing_Dynamic_Scope
(E
) = Standard_Standard
;
6576 end Is_Library_Level_Entity
;
6578 ---------------------------------
6579 -- Is_Local_Variable_Reference --
6580 ---------------------------------
6582 function Is_Local_Variable_Reference
(Expr
: Node_Id
) return Boolean is
6584 if not Is_Entity_Name
(Expr
) then
6589 Ent
: constant Entity_Id
:= Entity
(Expr
);
6590 Sub
: constant Entity_Id
:= Enclosing_Subprogram
(Ent
);
6592 if not Ekind_In
(Ent
, E_Variable
, E_In_Out_Parameter
) then
6595 return Present
(Sub
) and then Sub
= Current_Subprogram
;
6599 end Is_Local_Variable_Reference
;
6601 -------------------------
6602 -- Is_Object_Reference --
6603 -------------------------
6605 function Is_Object_Reference
(N
: Node_Id
) return Boolean is
6607 if Is_Entity_Name
(N
) then
6608 return Present
(Entity
(N
)) and then Is_Object
(Entity
(N
));
6612 when N_Indexed_Component | N_Slice
=>
6614 Is_Object_Reference
(Prefix
(N
))
6615 or else Is_Access_Type
(Etype
(Prefix
(N
)));
6617 -- In Ada95, a function call is a constant object; a procedure
6620 when N_Function_Call
=>
6621 return Etype
(N
) /= Standard_Void_Type
;
6623 -- A reference to the stream attribute Input is a function call
6625 when N_Attribute_Reference
=>
6626 return Attribute_Name
(N
) = Name_Input
;
6628 when N_Selected_Component
=>
6630 Is_Object_Reference
(Selector_Name
(N
))
6632 (Is_Object_Reference
(Prefix
(N
))
6633 or else Is_Access_Type
(Etype
(Prefix
(N
))));
6635 when N_Explicit_Dereference
=>
6638 -- A view conversion of a tagged object is an object reference
6640 when N_Type_Conversion
=>
6641 return Is_Tagged_Type
(Etype
(Subtype_Mark
(N
)))
6642 and then Is_Tagged_Type
(Etype
(Expression
(N
)))
6643 and then Is_Object_Reference
(Expression
(N
));
6645 -- An unchecked type conversion is considered to be an object if
6646 -- the operand is an object (this construction arises only as a
6647 -- result of expansion activities).
6649 when N_Unchecked_Type_Conversion
=>
6656 end Is_Object_Reference
;
6658 -----------------------------------
6659 -- Is_OK_Variable_For_Out_Formal --
6660 -----------------------------------
6662 function Is_OK_Variable_For_Out_Formal
(AV
: Node_Id
) return Boolean is
6664 Note_Possible_Modification
(AV
, Sure
=> True);
6666 -- We must reject parenthesized variable names. The check for
6667 -- Comes_From_Source is present because there are currently
6668 -- cases where the compiler violates this rule (e.g. passing
6669 -- a task object to its controlled Initialize routine).
6671 if Paren_Count
(AV
) > 0 and then Comes_From_Source
(AV
) then
6674 -- A variable is always allowed
6676 elsif Is_Variable
(AV
) then
6679 -- Unchecked conversions are allowed only if they come from the
6680 -- generated code, which sometimes uses unchecked conversions for out
6681 -- parameters in cases where code generation is unaffected. We tell
6682 -- source unchecked conversions by seeing if they are rewrites of an
6683 -- original Unchecked_Conversion function call, or of an explicit
6684 -- conversion of a function call.
6686 elsif Nkind
(AV
) = N_Unchecked_Type_Conversion
then
6687 if Nkind
(Original_Node
(AV
)) = N_Function_Call
then
6690 elsif Comes_From_Source
(AV
)
6691 and then Nkind
(Original_Node
(Expression
(AV
))) = N_Function_Call
6695 elsif Nkind
(Original_Node
(AV
)) = N_Type_Conversion
then
6696 return Is_OK_Variable_For_Out_Formal
(Expression
(AV
));
6702 -- Normal type conversions are allowed if argument is a variable
6704 elsif Nkind
(AV
) = N_Type_Conversion
then
6705 if Is_Variable
(Expression
(AV
))
6706 and then Paren_Count
(Expression
(AV
)) = 0
6708 Note_Possible_Modification
(Expression
(AV
), Sure
=> True);
6711 -- We also allow a non-parenthesized expression that raises
6712 -- constraint error if it rewrites what used to be a variable
6714 elsif Raises_Constraint_Error
(Expression
(AV
))
6715 and then Paren_Count
(Expression
(AV
)) = 0
6716 and then Is_Variable
(Original_Node
(Expression
(AV
)))
6720 -- Type conversion of something other than a variable
6726 -- If this node is rewritten, then test the original form, if that is
6727 -- OK, then we consider the rewritten node OK (for example, if the
6728 -- original node is a conversion, then Is_Variable will not be true
6729 -- but we still want to allow the conversion if it converts a variable).
6731 elsif Original_Node
(AV
) /= AV
then
6732 return Is_OK_Variable_For_Out_Formal
(Original_Node
(AV
));
6734 -- All other non-variables are rejected
6739 end Is_OK_Variable_For_Out_Formal
;
6741 -----------------------------------
6742 -- Is_Partially_Initialized_Type --
6743 -----------------------------------
6745 function Is_Partially_Initialized_Type
(Typ
: Entity_Id
) return Boolean is
6747 if Is_Scalar_Type
(Typ
) then
6750 elsif Is_Access_Type
(Typ
) then
6753 elsif Is_Array_Type
(Typ
) then
6755 -- If component type is partially initialized, so is array type
6757 if Is_Partially_Initialized_Type
(Component_Type
(Typ
)) then
6760 -- Otherwise we are only partially initialized if we are fully
6761 -- initialized (this is the empty array case, no point in us
6762 -- duplicating that code here).
6765 return Is_Fully_Initialized_Type
(Typ
);
6768 elsif Is_Record_Type
(Typ
) then
6770 -- A discriminated type is always partially initialized
6772 if Has_Discriminants
(Typ
) then
6775 -- A tagged type is always partially initialized
6777 elsif Is_Tagged_Type
(Typ
) then
6780 -- Case of non-discriminated record
6786 Component_Present
: Boolean := False;
6787 -- Set True if at least one component is present. If no
6788 -- components are present, then record type is fully
6789 -- initialized (another odd case, like the null array).
6792 -- Loop through components
6794 Ent
:= First_Entity
(Typ
);
6795 while Present
(Ent
) loop
6796 if Ekind
(Ent
) = E_Component
then
6797 Component_Present
:= True;
6799 -- If a component has an initialization expression then
6800 -- the enclosing record type is partially initialized
6802 if Present
(Parent
(Ent
))
6803 and then Present
(Expression
(Parent
(Ent
)))
6807 -- If a component is of a type which is itself partially
6808 -- initialized, then the enclosing record type is also.
6810 elsif Is_Partially_Initialized_Type
(Etype
(Ent
)) then
6818 -- No initialized components found. If we found any components
6819 -- they were all uninitialized so the result is false.
6821 if Component_Present
then
6824 -- But if we found no components, then all the components are
6825 -- initialized so we consider the type to be initialized.
6833 -- Concurrent types are always fully initialized
6835 elsif Is_Concurrent_Type
(Typ
) then
6838 -- For a private type, go to underlying type. If there is no underlying
6839 -- type then just assume this partially initialized. Not clear if this
6840 -- can happen in a non-error case, but no harm in testing for this.
6842 elsif Is_Private_Type
(Typ
) then
6844 U
: constant Entity_Id
:= Underlying_Type
(Typ
);
6849 return Is_Partially_Initialized_Type
(U
);
6853 -- For any other type (are there any?) assume partially initialized
6858 end Is_Partially_Initialized_Type
;
6860 ------------------------------------
6861 -- Is_Potentially_Persistent_Type --
6862 ------------------------------------
6864 function Is_Potentially_Persistent_Type
(T
: Entity_Id
) return Boolean is
6869 -- For private type, test corresponding full type
6871 if Is_Private_Type
(T
) then
6872 return Is_Potentially_Persistent_Type
(Full_View
(T
));
6874 -- Scalar types are potentially persistent
6876 elsif Is_Scalar_Type
(T
) then
6879 -- Record type is potentially persistent if not tagged and the types of
6880 -- all it components are potentially persistent, and no component has
6881 -- an initialization expression.
6883 elsif Is_Record_Type
(T
)
6884 and then not Is_Tagged_Type
(T
)
6885 and then not Is_Partially_Initialized_Type
(T
)
6887 Comp
:= First_Component
(T
);
6888 while Present
(Comp
) loop
6889 if not Is_Potentially_Persistent_Type
(Etype
(Comp
)) then
6898 -- Array type is potentially persistent if its component type is
6899 -- potentially persistent and if all its constraints are static.
6901 elsif Is_Array_Type
(T
) then
6902 if not Is_Potentially_Persistent_Type
(Component_Type
(T
)) then
6906 Indx
:= First_Index
(T
);
6907 while Present
(Indx
) loop
6908 if not Is_OK_Static_Subtype
(Etype
(Indx
)) then
6917 -- All other types are not potentially persistent
6922 end Is_Potentially_Persistent_Type
;
6924 ---------------------------------
6925 -- Is_Protected_Self_Reference --
6926 ---------------------------------
6928 function Is_Protected_Self_Reference
(N
: Node_Id
) return Boolean is
6930 function In_Access_Definition
(N
: Node_Id
) return Boolean;
6931 -- Returns true if N belongs to an access definition
6933 --------------------------
6934 -- In_Access_Definition --
6935 --------------------------
6937 function In_Access_Definition
(N
: Node_Id
) return Boolean is
6942 while Present
(P
) loop
6943 if Nkind
(P
) = N_Access_Definition
then
6951 end In_Access_Definition
;
6953 -- Start of processing for Is_Protected_Self_Reference
6956 -- Verify that prefix is analyzed and has the proper form. Note that
6957 -- the attributes Elab_Spec, Elab_Body, and UET_Address, which also
6958 -- produce the address of an entity, do not analyze their prefix
6959 -- because they denote entities that are not necessarily visible.
6960 -- Neither of them can apply to a protected type.
6962 return Ada_Version
>= Ada_2005
6963 and then Is_Entity_Name
(N
)
6964 and then Present
(Entity
(N
))
6965 and then Is_Protected_Type
(Entity
(N
))
6966 and then In_Open_Scopes
(Entity
(N
))
6967 and then not In_Access_Definition
(N
);
6968 end Is_Protected_Self_Reference
;
6970 -----------------------------
6971 -- Is_RCI_Pkg_Spec_Or_Body --
6972 -----------------------------
6974 function Is_RCI_Pkg_Spec_Or_Body
(Cunit
: Node_Id
) return Boolean is
6976 function Is_RCI_Pkg_Decl_Cunit
(Cunit
: Node_Id
) return Boolean;
6977 -- Return True if the unit of Cunit is an RCI package declaration
6979 ---------------------------
6980 -- Is_RCI_Pkg_Decl_Cunit --
6981 ---------------------------
6983 function Is_RCI_Pkg_Decl_Cunit
(Cunit
: Node_Id
) return Boolean is
6984 The_Unit
: constant Node_Id
:= Unit
(Cunit
);
6987 if Nkind
(The_Unit
) /= N_Package_Declaration
then
6991 return Is_Remote_Call_Interface
(Defining_Entity
(The_Unit
));
6992 end Is_RCI_Pkg_Decl_Cunit
;
6994 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
6997 return Is_RCI_Pkg_Decl_Cunit
(Cunit
)
6999 (Nkind
(Unit
(Cunit
)) = N_Package_Body
7000 and then Is_RCI_Pkg_Decl_Cunit
(Library_Unit
(Cunit
)));
7001 end Is_RCI_Pkg_Spec_Or_Body
;
7003 -----------------------------------------
7004 -- Is_Remote_Access_To_Class_Wide_Type --
7005 -----------------------------------------
7007 function Is_Remote_Access_To_Class_Wide_Type
7008 (E
: Entity_Id
) return Boolean
7011 -- A remote access to class-wide type is a general access to object type
7012 -- declared in the visible part of a Remote_Types or Remote_Call_
7015 return Ekind
(E
) = E_General_Access_Type
7016 and then (Is_Remote_Call_Interface
(E
) or else Is_Remote_Types
(E
));
7017 end Is_Remote_Access_To_Class_Wide_Type
;
7019 -----------------------------------------
7020 -- Is_Remote_Access_To_Subprogram_Type --
7021 -----------------------------------------
7023 function Is_Remote_Access_To_Subprogram_Type
7024 (E
: Entity_Id
) return Boolean
7027 return (Ekind
(E
) = E_Access_Subprogram_Type
7028 or else (Ekind
(E
) = E_Record_Type
7029 and then Present
(Corresponding_Remote_Type
(E
))))
7030 and then (Is_Remote_Call_Interface
(E
) or else Is_Remote_Types
(E
));
7031 end Is_Remote_Access_To_Subprogram_Type
;
7033 --------------------
7034 -- Is_Remote_Call --
7035 --------------------
7037 function Is_Remote_Call
(N
: Node_Id
) return Boolean is
7039 if Nkind
(N
) /= N_Procedure_Call_Statement
7040 and then Nkind
(N
) /= N_Function_Call
7042 -- An entry call cannot be remote
7046 elsif Nkind
(Name
(N
)) in N_Has_Entity
7047 and then Is_Remote_Call_Interface
(Entity
(Name
(N
)))
7049 -- A subprogram declared in the spec of a RCI package is remote
7053 elsif Nkind
(Name
(N
)) = N_Explicit_Dereference
7054 and then Is_Remote_Access_To_Subprogram_Type
7055 (Etype
(Prefix
(Name
(N
))))
7057 -- The dereference of a RAS is a remote call
7061 elsif Present
(Controlling_Argument
(N
))
7062 and then Is_Remote_Access_To_Class_Wide_Type
7063 (Etype
(Controlling_Argument
(N
)))
7065 -- Any primitive operation call with a controlling argument of
7066 -- a RACW type is a remote call.
7071 -- All other calls are local calls
7076 ----------------------
7077 -- Is_Renamed_Entry --
7078 ----------------------
7080 function Is_Renamed_Entry
(Proc_Nam
: Entity_Id
) return Boolean is
7081 Orig_Node
: Node_Id
:= Empty
;
7082 Subp_Decl
: Node_Id
:= Parent
(Parent
(Proc_Nam
));
7084 function Is_Entry
(Nam
: Node_Id
) return Boolean;
7085 -- Determine whether Nam is an entry. Traverse selectors if there are
7086 -- nested selected components.
7092 function Is_Entry
(Nam
: Node_Id
) return Boolean is
7094 if Nkind
(Nam
) = N_Selected_Component
then
7095 return Is_Entry
(Selector_Name
(Nam
));
7098 return Ekind
(Entity
(Nam
)) = E_Entry
;
7101 -- Start of processing for Is_Renamed_Entry
7104 if Present
(Alias
(Proc_Nam
)) then
7105 Subp_Decl
:= Parent
(Parent
(Alias
(Proc_Nam
)));
7108 -- Look for a rewritten subprogram renaming declaration
7110 if Nkind
(Subp_Decl
) = N_Subprogram_Declaration
7111 and then Present
(Original_Node
(Subp_Decl
))
7113 Orig_Node
:= Original_Node
(Subp_Decl
);
7116 -- The rewritten subprogram is actually an entry
7118 if Present
(Orig_Node
)
7119 and then Nkind
(Orig_Node
) = N_Subprogram_Renaming_Declaration
7120 and then Is_Entry
(Name
(Orig_Node
))
7126 end Is_Renamed_Entry
;
7128 ----------------------
7129 -- Is_Selector_Name --
7130 ----------------------
7132 function Is_Selector_Name
(N
: Node_Id
) return Boolean is
7134 if not Is_List_Member
(N
) then
7136 P
: constant Node_Id
:= Parent
(N
);
7137 K
: constant Node_Kind
:= Nkind
(P
);
7140 (K
= N_Expanded_Name
or else
7141 K
= N_Generic_Association
or else
7142 K
= N_Parameter_Association
or else
7143 K
= N_Selected_Component
)
7144 and then Selector_Name
(P
) = N
;
7149 L
: constant List_Id
:= List_Containing
(N
);
7150 P
: constant Node_Id
:= Parent
(L
);
7152 return (Nkind
(P
) = N_Discriminant_Association
7153 and then Selector_Names
(P
) = L
)
7155 (Nkind
(P
) = N_Component_Association
7156 and then Choices
(P
) = L
);
7159 end Is_Selector_Name
;
7165 function Is_Statement
(N
: Node_Id
) return Boolean is
7168 Nkind
(N
) in N_Statement_Other_Than_Procedure_Call
7169 or else Nkind
(N
) = N_Procedure_Call_Statement
;
7172 ---------------------------------
7173 -- Is_Synchronized_Tagged_Type --
7174 ---------------------------------
7176 function Is_Synchronized_Tagged_Type
(E
: Entity_Id
) return Boolean is
7177 Kind
: constant Entity_Kind
:= Ekind
(Base_Type
(E
));
7180 -- A task or protected type derived from an interface is a tagged type.
7181 -- Such a tagged type is called a synchronized tagged type, as are
7182 -- synchronized interfaces and private extensions whose declaration
7183 -- includes the reserved word synchronized.
7185 return (Is_Tagged_Type
(E
)
7186 and then (Kind
= E_Task_Type
7187 or else Kind
= E_Protected_Type
))
7190 and then Is_Synchronized_Interface
(E
))
7192 (Ekind
(E
) = E_Record_Type_With_Private
7193 and then (Synchronized_Present
(Parent
(E
))
7194 or else Is_Synchronized_Interface
(Etype
(E
))));
7195 end Is_Synchronized_Tagged_Type
;
7201 function Is_Transfer
(N
: Node_Id
) return Boolean is
7202 Kind
: constant Node_Kind
:= Nkind
(N
);
7205 if Kind
= N_Simple_Return_Statement
7207 Kind
= N_Extended_Return_Statement
7209 Kind
= N_Goto_Statement
7211 Kind
= N_Raise_Statement
7213 Kind
= N_Requeue_Statement
7217 elsif (Kind
= N_Exit_Statement
or else Kind
in N_Raise_xxx_Error
)
7218 and then No
(Condition
(N
))
7222 elsif Kind
= N_Procedure_Call_Statement
7223 and then Is_Entity_Name
(Name
(N
))
7224 and then Present
(Entity
(Name
(N
)))
7225 and then No_Return
(Entity
(Name
(N
)))
7229 elsif Nkind
(Original_Node
(N
)) = N_Raise_Statement
then
7241 function Is_True
(U
: Uint
) return Boolean is
7246 -------------------------------
7247 -- Is_Universal_Numeric_Type --
7248 -------------------------------
7250 function Is_Universal_Numeric_Type
(T
: Entity_Id
) return Boolean is
7252 return T
= Universal_Integer
or else T
= Universal_Real
;
7253 end Is_Universal_Numeric_Type
;
7259 function Is_Value_Type
(T
: Entity_Id
) return Boolean is
7261 return VM_Target
= CLI_Target
7262 and then Nkind
(T
) in N_Has_Chars
7263 and then Chars
(T
) /= No_Name
7264 and then Get_Name_String
(Chars
(T
)) = "valuetype";
7267 ---------------------
7268 -- Is_VMS_Operator --
7269 ---------------------
7271 function Is_VMS_Operator
(Op
: Entity_Id
) return Boolean is
7273 -- The VMS operators are declared in a child of System that is loaded
7274 -- through pragma Extend_System. In some rare cases a program is run
7275 -- with this extension but without indicating that the target is VMS.
7277 return Ekind
(Op
) = E_Function
7278 and then Is_Intrinsic_Subprogram
(Op
)
7280 ((Present_System_Aux
7281 and then Scope
(Op
) = System_Aux_Id
)
7284 and then Scope
(Scope
(Op
)) = RTU_Entity
(System
)));
7285 end Is_VMS_Operator
;
7291 function Is_Variable
(N
: Node_Id
) return Boolean is
7293 Orig_Node
: constant Node_Id
:= Original_Node
(N
);
7294 -- We do the test on the original node, since this is basically a test
7295 -- of syntactic categories, so it must not be disturbed by whatever
7296 -- rewriting might have occurred. For example, an aggregate, which is
7297 -- certainly NOT a variable, could be turned into a variable by
7300 function In_Protected_Function
(E
: Entity_Id
) return Boolean;
7301 -- Within a protected function, the private components of the enclosing
7302 -- protected type are constants. A function nested within a (protected)
7303 -- procedure is not itself protected.
7305 function Is_Variable_Prefix
(P
: Node_Id
) return Boolean;
7306 -- Prefixes can involve implicit dereferences, in which case we must
7307 -- test for the case of a reference of a constant access type, which can
7308 -- can never be a variable.
7310 ---------------------------
7311 -- In_Protected_Function --
7312 ---------------------------
7314 function In_Protected_Function
(E
: Entity_Id
) return Boolean is
7315 Prot
: constant Entity_Id
:= Scope
(E
);
7319 if not Is_Protected_Type
(Prot
) then
7323 while Present
(S
) and then S
/= Prot
loop
7324 if Ekind
(S
) = E_Function
and then Scope
(S
) = Prot
then
7333 end In_Protected_Function
;
7335 ------------------------
7336 -- Is_Variable_Prefix --
7337 ------------------------
7339 function Is_Variable_Prefix
(P
: Node_Id
) return Boolean is
7341 if Is_Access_Type
(Etype
(P
)) then
7342 return not Is_Access_Constant
(Root_Type
(Etype
(P
)));
7344 -- For the case of an indexed component whose prefix has a packed
7345 -- array type, the prefix has been rewritten into a type conversion.
7346 -- Determine variable-ness from the converted expression.
7348 elsif Nkind
(P
) = N_Type_Conversion
7349 and then not Comes_From_Source
(P
)
7350 and then Is_Array_Type
(Etype
(P
))
7351 and then Is_Packed
(Etype
(P
))
7353 return Is_Variable
(Expression
(P
));
7356 return Is_Variable
(P
);
7358 end Is_Variable_Prefix
;
7360 -- Start of processing for Is_Variable
7363 -- Definitely OK if Assignment_OK is set. Since this is something that
7364 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
7366 if Nkind
(N
) in N_Subexpr
and then Assignment_OK
(N
) then
7369 -- Normally we go to the original node, but there is one exception where
7370 -- we use the rewritten node, namely when it is an explicit dereference.
7371 -- The generated code may rewrite a prefix which is an access type with
7372 -- an explicit dereference. The dereference is a variable, even though
7373 -- the original node may not be (since it could be a constant of the
7376 -- In Ada 2005 we have a further case to consider: the prefix may be a
7377 -- function call given in prefix notation. The original node appears to
7378 -- be a selected component, but we need to examine the call.
7380 elsif Nkind
(N
) = N_Explicit_Dereference
7381 and then Nkind
(Orig_Node
) /= N_Explicit_Dereference
7382 and then Present
(Etype
(Orig_Node
))
7383 and then Is_Access_Type
(Etype
(Orig_Node
))
7385 -- Note that if the prefix is an explicit dereference that does not
7386 -- come from source, we must check for a rewritten function call in
7387 -- prefixed notation before other forms of rewriting, to prevent a
7391 (Nkind
(Orig_Node
) = N_Function_Call
7392 and then not Is_Access_Constant
(Etype
(Prefix
(N
))))
7394 Is_Variable_Prefix
(Original_Node
(Prefix
(N
)));
7396 -- A function call is never a variable
7398 elsif Nkind
(N
) = N_Function_Call
then
7401 -- All remaining checks use the original node
7403 elsif Is_Entity_Name
(Orig_Node
)
7404 and then Present
(Entity
(Orig_Node
))
7407 E
: constant Entity_Id
:= Entity
(Orig_Node
);
7408 K
: constant Entity_Kind
:= Ekind
(E
);
7411 return (K
= E_Variable
7412 and then Nkind
(Parent
(E
)) /= N_Exception_Handler
)
7413 or else (K
= E_Component
7414 and then not In_Protected_Function
(E
))
7415 or else K
= E_Out_Parameter
7416 or else K
= E_In_Out_Parameter
7417 or else K
= E_Generic_In_Out_Parameter
7419 -- Current instance of type:
7421 or else (Is_Type
(E
) and then In_Open_Scopes
(E
))
7422 or else (Is_Incomplete_Or_Private_Type
(E
)
7423 and then In_Open_Scopes
(Full_View
(E
)));
7427 case Nkind
(Orig_Node
) is
7428 when N_Indexed_Component | N_Slice
=>
7429 return Is_Variable_Prefix
(Prefix
(Orig_Node
));
7431 when N_Selected_Component
=>
7432 return Is_Variable_Prefix
(Prefix
(Orig_Node
))
7433 and then Is_Variable
(Selector_Name
(Orig_Node
));
7435 -- For an explicit dereference, the type of the prefix cannot
7436 -- be an access to constant or an access to subprogram.
7438 when N_Explicit_Dereference
=>
7440 Typ
: constant Entity_Id
:= Etype
(Prefix
(Orig_Node
));
7442 return Is_Access_Type
(Typ
)
7443 and then not Is_Access_Constant
(Root_Type
(Typ
))
7444 and then Ekind
(Typ
) /= E_Access_Subprogram_Type
;
7447 -- The type conversion is the case where we do not deal with the
7448 -- context dependent special case of an actual parameter. Thus
7449 -- the type conversion is only considered a variable for the
7450 -- purposes of this routine if the target type is tagged. However,
7451 -- a type conversion is considered to be a variable if it does not
7452 -- come from source (this deals for example with the conversions
7453 -- of expressions to their actual subtypes).
7455 when N_Type_Conversion
=>
7456 return Is_Variable
(Expression
(Orig_Node
))
7458 (not Comes_From_Source
(Orig_Node
)
7460 (Is_Tagged_Type
(Etype
(Subtype_Mark
(Orig_Node
)))
7462 Is_Tagged_Type
(Etype
(Expression
(Orig_Node
)))));
7464 -- GNAT allows an unchecked type conversion as a variable. This
7465 -- only affects the generation of internal expanded code, since
7466 -- calls to instantiations of Unchecked_Conversion are never
7467 -- considered variables (since they are function calls).
7468 -- This is also true for expression actions.
7470 when N_Unchecked_Type_Conversion
=>
7471 return Is_Variable
(Expression
(Orig_Node
));
7479 ---------------------------
7480 -- Is_Visibly_Controlled --
7481 ---------------------------
7483 function Is_Visibly_Controlled
(T
: Entity_Id
) return Boolean is
7484 Root
: constant Entity_Id
:= Root_Type
(T
);
7486 return Chars
(Scope
(Root
)) = Name_Finalization
7487 and then Chars
(Scope
(Scope
(Root
))) = Name_Ada
7488 and then Scope
(Scope
(Scope
(Root
))) = Standard_Standard
;
7489 end Is_Visibly_Controlled
;
7491 ------------------------
7492 -- Is_Volatile_Object --
7493 ------------------------
7495 function Is_Volatile_Object
(N
: Node_Id
) return Boolean is
7497 function Object_Has_Volatile_Components
(N
: Node_Id
) return Boolean;
7498 -- Determines if given object has volatile components
7500 function Is_Volatile_Prefix
(N
: Node_Id
) return Boolean;
7501 -- If prefix is an implicit dereference, examine designated type
7503 ------------------------
7504 -- Is_Volatile_Prefix --
7505 ------------------------
7507 function Is_Volatile_Prefix
(N
: Node_Id
) return Boolean is
7508 Typ
: constant Entity_Id
:= Etype
(N
);
7511 if Is_Access_Type
(Typ
) then
7513 Dtyp
: constant Entity_Id
:= Designated_Type
(Typ
);
7516 return Is_Volatile
(Dtyp
)
7517 or else Has_Volatile_Components
(Dtyp
);
7521 return Object_Has_Volatile_Components
(N
);
7523 end Is_Volatile_Prefix
;
7525 ------------------------------------
7526 -- Object_Has_Volatile_Components --
7527 ------------------------------------
7529 function Object_Has_Volatile_Components
(N
: Node_Id
) return Boolean is
7530 Typ
: constant Entity_Id
:= Etype
(N
);
7533 if Is_Volatile
(Typ
)
7534 or else Has_Volatile_Components
(Typ
)
7538 elsif Is_Entity_Name
(N
)
7539 and then (Has_Volatile_Components
(Entity
(N
))
7540 or else Is_Volatile
(Entity
(N
)))
7544 elsif Nkind
(N
) = N_Indexed_Component
7545 or else Nkind
(N
) = N_Selected_Component
7547 return Is_Volatile_Prefix
(Prefix
(N
));
7552 end Object_Has_Volatile_Components
;
7554 -- Start of processing for Is_Volatile_Object
7557 if Is_Volatile
(Etype
(N
))
7558 or else (Is_Entity_Name
(N
) and then Is_Volatile
(Entity
(N
)))
7562 elsif Nkind
(N
) = N_Indexed_Component
7563 or else Nkind
(N
) = N_Selected_Component
7565 return Is_Volatile_Prefix
(Prefix
(N
));
7570 end Is_Volatile_Object
;
7572 -------------------------
7573 -- Kill_Current_Values --
7574 -------------------------
7576 procedure Kill_Current_Values
7578 Last_Assignment_Only
: Boolean := False)
7581 -- ??? do we have to worry about clearing cached checks?
7583 if Is_Assignable
(Ent
) then
7584 Set_Last_Assignment
(Ent
, Empty
);
7587 if Is_Object
(Ent
) then
7588 if not Last_Assignment_Only
then
7590 Set_Current_Value
(Ent
, Empty
);
7592 if not Can_Never_Be_Null
(Ent
) then
7593 Set_Is_Known_Non_Null
(Ent
, False);
7596 Set_Is_Known_Null
(Ent
, False);
7598 -- Reset Is_Known_Valid unless type is always valid, or if we have
7599 -- a loop parameter (loop parameters are always valid, since their
7600 -- bounds are defined by the bounds given in the loop header).
7602 if not Is_Known_Valid
(Etype
(Ent
))
7603 and then Ekind
(Ent
) /= E_Loop_Parameter
7605 Set_Is_Known_Valid
(Ent
, False);
7609 end Kill_Current_Values
;
7611 procedure Kill_Current_Values
(Last_Assignment_Only
: Boolean := False) is
7614 procedure Kill_Current_Values_For_Entity_Chain
(E
: Entity_Id
);
7615 -- Clear current value for entity E and all entities chained to E
7617 ------------------------------------------
7618 -- Kill_Current_Values_For_Entity_Chain --
7619 ------------------------------------------
7621 procedure Kill_Current_Values_For_Entity_Chain
(E
: Entity_Id
) is
7625 while Present
(Ent
) loop
7626 Kill_Current_Values
(Ent
, Last_Assignment_Only
);
7629 end Kill_Current_Values_For_Entity_Chain
;
7631 -- Start of processing for Kill_Current_Values
7634 -- Kill all saved checks, a special case of killing saved values
7636 if not Last_Assignment_Only
then
7640 -- Loop through relevant scopes, which includes the current scope and
7641 -- any parent scopes if the current scope is a block or a package.
7646 -- Clear current values of all entities in current scope
7648 Kill_Current_Values_For_Entity_Chain
(First_Entity
(S
));
7650 -- If scope is a package, also clear current values of all
7651 -- private entities in the scope.
7653 if Is_Package_Or_Generic_Package
(S
)
7654 or else Is_Concurrent_Type
(S
)
7656 Kill_Current_Values_For_Entity_Chain
(First_Private_Entity
(S
));
7659 -- If this is a not a subprogram, deal with parents
7661 if not Is_Subprogram
(S
) then
7663 exit Scope_Loop
when S
= Standard_Standard
;
7667 end loop Scope_Loop
;
7668 end Kill_Current_Values
;
7670 --------------------------
7671 -- Kill_Size_Check_Code --
7672 --------------------------
7674 procedure Kill_Size_Check_Code
(E
: Entity_Id
) is
7676 if (Ekind
(E
) = E_Constant
or else Ekind
(E
) = E_Variable
)
7677 and then Present
(Size_Check_Code
(E
))
7679 Remove
(Size_Check_Code
(E
));
7680 Set_Size_Check_Code
(E
, Empty
);
7682 end Kill_Size_Check_Code
;
7684 --------------------------
7685 -- Known_To_Be_Assigned --
7686 --------------------------
7688 function Known_To_Be_Assigned
(N
: Node_Id
) return Boolean is
7689 P
: constant Node_Id
:= Parent
(N
);
7694 -- Test left side of assignment
7696 when N_Assignment_Statement
=>
7697 return N
= Name
(P
);
7699 -- Function call arguments are never lvalues
7701 when N_Function_Call
=>
7704 -- Positional parameter for procedure or accept call
7706 when N_Procedure_Call_Statement |
7715 Proc
:= Get_Subprogram_Entity
(P
);
7721 -- If we are not a list member, something is strange, so
7722 -- be conservative and return False.
7724 if not Is_List_Member
(N
) then
7728 -- We are going to find the right formal by stepping forward
7729 -- through the formals, as we step backwards in the actuals.
7731 Form
:= First_Formal
(Proc
);
7734 -- If no formal, something is weird, so be conservative
7735 -- and return False.
7746 return Ekind
(Form
) /= E_In_Parameter
;
7749 -- Named parameter for procedure or accept call
7751 when N_Parameter_Association
=>
7757 Proc
:= Get_Subprogram_Entity
(Parent
(P
));
7763 -- Loop through formals to find the one that matches
7765 Form
:= First_Formal
(Proc
);
7767 -- If no matching formal, that's peculiar, some kind of
7768 -- previous error, so return False to be conservative.
7774 -- Else test for match
7776 if Chars
(Form
) = Chars
(Selector_Name
(P
)) then
7777 return Ekind
(Form
) /= E_In_Parameter
;
7784 -- Test for appearing in a conversion that itself appears
7785 -- in an lvalue context, since this should be an lvalue.
7787 when N_Type_Conversion
=>
7788 return Known_To_Be_Assigned
(P
);
7790 -- All other references are definitely not known to be modifications
7796 end Known_To_Be_Assigned
;
7802 function May_Be_Lvalue
(N
: Node_Id
) return Boolean is
7803 P
: constant Node_Id
:= Parent
(N
);
7808 -- Test left side of assignment
7810 when N_Assignment_Statement
=>
7811 return N
= Name
(P
);
7813 -- Test prefix of component or attribute. Note that the prefix of an
7814 -- explicit or implicit dereference cannot be an l-value.
7816 when N_Attribute_Reference
=>
7817 return N
= Prefix
(P
)
7818 and then Name_Implies_Lvalue_Prefix
(Attribute_Name
(P
));
7820 -- For an expanded name, the name is an lvalue if the expanded name
7821 -- is an lvalue, but the prefix is never an lvalue, since it is just
7822 -- the scope where the name is found.
7824 when N_Expanded_Name
=>
7825 if N
= Prefix
(P
) then
7826 return May_Be_Lvalue
(P
);
7831 -- For a selected component A.B, A is certainly an lvalue if A.B is.
7832 -- B is a little interesting, if we have A.B := 3, there is some
7833 -- discussion as to whether B is an lvalue or not, we choose to say
7834 -- it is. Note however that A is not an lvalue if it is of an access
7835 -- type since this is an implicit dereference.
7837 when N_Selected_Component
=>
7839 and then Present
(Etype
(N
))
7840 and then Is_Access_Type
(Etype
(N
))
7844 return May_Be_Lvalue
(P
);
7847 -- For an indexed component or slice, the index or slice bounds is
7848 -- never an lvalue. The prefix is an lvalue if the indexed component
7849 -- or slice is an lvalue, except if it is an access type, where we
7850 -- have an implicit dereference.
7852 when N_Indexed_Component
=>
7854 or else (Present
(Etype
(N
)) and then Is_Access_Type
(Etype
(N
)))
7858 return May_Be_Lvalue
(P
);
7861 -- Prefix of a reference is an lvalue if the reference is an lvalue
7864 return May_Be_Lvalue
(P
);
7866 -- Prefix of explicit dereference is never an lvalue
7868 when N_Explicit_Dereference
=>
7871 -- Function call arguments are never lvalues
7873 when N_Function_Call
=>
7876 -- Positional parameter for procedure, entry, or accept call
7878 when N_Procedure_Call_Statement |
7879 N_Entry_Call_Statement |
7888 Proc
:= Get_Subprogram_Entity
(P
);
7894 -- If we are not a list member, something is strange, so
7895 -- be conservative and return True.
7897 if not Is_List_Member
(N
) then
7901 -- We are going to find the right formal by stepping forward
7902 -- through the formals, as we step backwards in the actuals.
7904 Form
:= First_Formal
(Proc
);
7907 -- If no formal, something is weird, so be conservative
7919 return Ekind
(Form
) /= E_In_Parameter
;
7922 -- Named parameter for procedure or accept call
7924 when N_Parameter_Association
=>
7930 Proc
:= Get_Subprogram_Entity
(Parent
(P
));
7936 -- Loop through formals to find the one that matches
7938 Form
:= First_Formal
(Proc
);
7940 -- If no matching formal, that's peculiar, some kind of
7941 -- previous error, so return True to be conservative.
7947 -- Else test for match
7949 if Chars
(Form
) = Chars
(Selector_Name
(P
)) then
7950 return Ekind
(Form
) /= E_In_Parameter
;
7957 -- Test for appearing in a conversion that itself appears in an
7958 -- lvalue context, since this should be an lvalue.
7960 when N_Type_Conversion
=>
7961 return May_Be_Lvalue
(P
);
7963 -- Test for appearance in object renaming declaration
7965 when N_Object_Renaming_Declaration
=>
7968 -- All other references are definitely not lvalues
7976 -----------------------
7977 -- Mark_Coextensions --
7978 -----------------------
7980 procedure Mark_Coextensions
(Context_Nod
: Node_Id
; Root_Nod
: Node_Id
) is
7981 Is_Dynamic
: Boolean;
7982 -- Indicates whether the context causes nested coextensions to be
7983 -- dynamic or static
7985 function Mark_Allocator
(N
: Node_Id
) return Traverse_Result
;
7986 -- Recognize an allocator node and label it as a dynamic coextension
7988 --------------------
7989 -- Mark_Allocator --
7990 --------------------
7992 function Mark_Allocator
(N
: Node_Id
) return Traverse_Result
is
7994 if Nkind
(N
) = N_Allocator
then
7996 Set_Is_Dynamic_Coextension
(N
);
7998 -- If the allocator expression is potentially dynamic, it may
7999 -- be expanded out of order and require dynamic allocation
8000 -- anyway, so we treat the coextension itself as dynamic.
8001 -- Potential optimization ???
8003 elsif Nkind
(Expression
(N
)) = N_Qualified_Expression
8004 and then Nkind
(Expression
(Expression
(N
))) = N_Op_Concat
8006 Set_Is_Dynamic_Coextension
(N
);
8009 Set_Is_Static_Coextension
(N
);
8016 procedure Mark_Allocators
is new Traverse_Proc
(Mark_Allocator
);
8018 -- Start of processing Mark_Coextensions
8021 case Nkind
(Context_Nod
) is
8022 when N_Assignment_Statement |
8023 N_Simple_Return_Statement
=>
8024 Is_Dynamic
:= Nkind
(Expression
(Context_Nod
)) = N_Allocator
;
8026 when N_Object_Declaration
=>
8027 Is_Dynamic
:= Nkind
(Root_Nod
) = N_Allocator
;
8029 -- This routine should not be called for constructs which may not
8030 -- contain coextensions.
8033 raise Program_Error
;
8036 Mark_Allocators
(Root_Nod
);
8037 end Mark_Coextensions
;
8039 ----------------------
8040 -- Needs_One_Actual --
8041 ----------------------
8043 function Needs_One_Actual
(E
: Entity_Id
) return Boolean is
8047 if Ada_Version
>= Ada_2005
8048 and then Present
(First_Formal
(E
))
8050 Formal
:= Next_Formal
(First_Formal
(E
));
8051 while Present
(Formal
) loop
8052 if No
(Default_Value
(Formal
)) then
8056 Next_Formal
(Formal
);
8064 end Needs_One_Actual
;
8066 ------------------------
8067 -- New_Copy_List_Tree --
8068 ------------------------
8070 function New_Copy_List_Tree
(List
: List_Id
) return List_Id
is
8075 if List
= No_List
then
8082 while Present
(E
) loop
8083 Append
(New_Copy_Tree
(E
), NL
);
8089 end New_Copy_List_Tree
;
8095 use Atree
.Unchecked_Access
;
8096 use Atree_Private_Part
;
8098 -- Our approach here requires a two pass traversal of the tree. The
8099 -- first pass visits all nodes that eventually will be copied looking
8100 -- for defining Itypes. If any defining Itypes are found, then they are
8101 -- copied, and an entry is added to the replacement map. In the second
8102 -- phase, the tree is copied, using the replacement map to replace any
8103 -- Itype references within the copied tree.
8105 -- The following hash tables are used if the Map supplied has more
8106 -- than hash threshhold entries to speed up access to the map. If
8107 -- there are fewer entries, then the map is searched sequentially
8108 -- (because setting up a hash table for only a few entries takes
8109 -- more time than it saves.
8111 function New_Copy_Hash
(E
: Entity_Id
) return NCT_Header_Num
;
8112 -- Hash function used for hash operations
8118 function New_Copy_Hash
(E
: Entity_Id
) return NCT_Header_Num
is
8120 return Nat
(E
) mod (NCT_Header_Num
'Last + 1);
8127 -- The hash table NCT_Assoc associates old entities in the table
8128 -- with their corresponding new entities (i.e. the pairs of entries
8129 -- presented in the original Map argument are Key-Element pairs).
8131 package NCT_Assoc
is new Simple_HTable
(
8132 Header_Num
=> NCT_Header_Num
,
8133 Element
=> Entity_Id
,
8134 No_Element
=> Empty
,
8136 Hash
=> New_Copy_Hash
,
8137 Equal
=> Types
."=");
8139 ---------------------
8140 -- NCT_Itype_Assoc --
8141 ---------------------
8143 -- The hash table NCT_Itype_Assoc contains entries only for those
8144 -- old nodes which have a non-empty Associated_Node_For_Itype set.
8145 -- The key is the associated node, and the element is the new node
8146 -- itself (NOT the associated node for the new node).
8148 package NCT_Itype_Assoc
is new Simple_HTable
(
8149 Header_Num
=> NCT_Header_Num
,
8150 Element
=> Entity_Id
,
8151 No_Element
=> Empty
,
8153 Hash
=> New_Copy_Hash
,
8154 Equal
=> Types
."=");
8156 -- Start of processing for New_Copy_Tree function
8158 function New_Copy_Tree
8160 Map
: Elist_Id
:= No_Elist
;
8161 New_Sloc
: Source_Ptr
:= No_Location
;
8162 New_Scope
: Entity_Id
:= Empty
) return Node_Id
8164 Actual_Map
: Elist_Id
:= Map
;
8165 -- This is the actual map for the copy. It is initialized with the
8166 -- given elements, and then enlarged as required for Itypes that are
8167 -- copied during the first phase of the copy operation. The visit
8168 -- procedures add elements to this map as Itypes are encountered.
8169 -- The reason we cannot use Map directly, is that it may well be
8170 -- (and normally is) initialized to No_Elist, and if we have mapped
8171 -- entities, we have to reset it to point to a real Elist.
8173 function Assoc
(N
: Node_Or_Entity_Id
) return Node_Id
;
8174 -- Called during second phase to map entities into their corresponding
8175 -- copies using Actual_Map. If the argument is not an entity, or is not
8176 -- in Actual_Map, then it is returned unchanged.
8178 procedure Build_NCT_Hash_Tables
;
8179 -- Builds hash tables (number of elements >= threshold value)
8181 function Copy_Elist_With_Replacement
8182 (Old_Elist
: Elist_Id
) return Elist_Id
;
8183 -- Called during second phase to copy element list doing replacements
8185 procedure Copy_Itype_With_Replacement
(New_Itype
: Entity_Id
);
8186 -- Called during the second phase to process a copied Itype. The actual
8187 -- copy happened during the first phase (so that we could make the entry
8188 -- in the mapping), but we still have to deal with the descendents of
8189 -- the copied Itype and copy them where necessary.
8191 function Copy_List_With_Replacement
(Old_List
: List_Id
) return List_Id
;
8192 -- Called during second phase to copy list doing replacements
8194 function Copy_Node_With_Replacement
(Old_Node
: Node_Id
) return Node_Id
;
8195 -- Called during second phase to copy node doing replacements
8197 procedure Visit_Elist
(E
: Elist_Id
);
8198 -- Called during first phase to visit all elements of an Elist
8200 procedure Visit_Field
(F
: Union_Id
; N
: Node_Id
);
8201 -- Visit a single field, recursing to call Visit_Node or Visit_List
8202 -- if the field is a syntactic descendent of the current node (i.e.
8203 -- its parent is Node N).
8205 procedure Visit_Itype
(Old_Itype
: Entity_Id
);
8206 -- Called during first phase to visit subsidiary fields of a defining
8207 -- Itype, and also create a copy and make an entry in the replacement
8208 -- map for the new copy.
8210 procedure Visit_List
(L
: List_Id
);
8211 -- Called during first phase to visit all elements of a List
8213 procedure Visit_Node
(N
: Node_Or_Entity_Id
);
8214 -- Called during first phase to visit a node and all its subtrees
8220 function Assoc
(N
: Node_Or_Entity_Id
) return Node_Id
is
8225 if not Has_Extension
(N
) or else No
(Actual_Map
) then
8228 elsif NCT_Hash_Tables_Used
then
8229 Ent
:= NCT_Assoc
.Get
(Entity_Id
(N
));
8231 if Present
(Ent
) then
8237 -- No hash table used, do serial search
8240 E
:= First_Elmt
(Actual_Map
);
8241 while Present
(E
) loop
8242 if Node
(E
) = N
then
8243 return Node
(Next_Elmt
(E
));
8245 E
:= Next_Elmt
(Next_Elmt
(E
));
8253 ---------------------------
8254 -- Build_NCT_Hash_Tables --
8255 ---------------------------
8257 procedure Build_NCT_Hash_Tables
is
8261 if NCT_Hash_Table_Setup
then
8263 NCT_Itype_Assoc
.Reset
;
8266 Elmt
:= First_Elmt
(Actual_Map
);
8267 while Present
(Elmt
) loop
8270 -- Get new entity, and associate old and new
8273 NCT_Assoc
.Set
(Ent
, Node
(Elmt
));
8275 if Is_Type
(Ent
) then
8277 Anode
: constant Entity_Id
:=
8278 Associated_Node_For_Itype
(Ent
);
8281 if Present
(Anode
) then
8283 -- Enter a link between the associated node of the
8284 -- old Itype and the new Itype, for updating later
8285 -- when node is copied.
8287 NCT_Itype_Assoc
.Set
(Anode
, Node
(Elmt
));
8295 NCT_Hash_Tables_Used
:= True;
8296 NCT_Hash_Table_Setup
:= True;
8297 end Build_NCT_Hash_Tables
;
8299 ---------------------------------
8300 -- Copy_Elist_With_Replacement --
8301 ---------------------------------
8303 function Copy_Elist_With_Replacement
8304 (Old_Elist
: Elist_Id
) return Elist_Id
8307 New_Elist
: Elist_Id
;
8310 if No
(Old_Elist
) then
8314 New_Elist
:= New_Elmt_List
;
8316 M
:= First_Elmt
(Old_Elist
);
8317 while Present
(M
) loop
8318 Append_Elmt
(Copy_Node_With_Replacement
(Node
(M
)), New_Elist
);
8324 end Copy_Elist_With_Replacement
;
8326 ---------------------------------
8327 -- Copy_Itype_With_Replacement --
8328 ---------------------------------
8330 -- This routine exactly parallels its phase one analog Visit_Itype,
8332 procedure Copy_Itype_With_Replacement
(New_Itype
: Entity_Id
) is
8334 -- Translate Next_Entity, Scope and Etype fields, in case they
8335 -- reference entities that have been mapped into copies.
8337 Set_Next_Entity
(New_Itype
, Assoc
(Next_Entity
(New_Itype
)));
8338 Set_Etype
(New_Itype
, Assoc
(Etype
(New_Itype
)));
8340 if Present
(New_Scope
) then
8341 Set_Scope
(New_Itype
, New_Scope
);
8343 Set_Scope
(New_Itype
, Assoc
(Scope
(New_Itype
)));
8346 -- Copy referenced fields
8348 if Is_Discrete_Type
(New_Itype
) then
8349 Set_Scalar_Range
(New_Itype
,
8350 Copy_Node_With_Replacement
(Scalar_Range
(New_Itype
)));
8352 elsif Has_Discriminants
(Base_Type
(New_Itype
)) then
8353 Set_Discriminant_Constraint
(New_Itype
,
8354 Copy_Elist_With_Replacement
8355 (Discriminant_Constraint
(New_Itype
)));
8357 elsif Is_Array_Type
(New_Itype
) then
8358 if Present
(First_Index
(New_Itype
)) then
8359 Set_First_Index
(New_Itype
,
8360 First
(Copy_List_With_Replacement
8361 (List_Containing
(First_Index
(New_Itype
)))));
8364 if Is_Packed
(New_Itype
) then
8365 Set_Packed_Array_Type
(New_Itype
,
8366 Copy_Node_With_Replacement
8367 (Packed_Array_Type
(New_Itype
)));
8370 end Copy_Itype_With_Replacement
;
8372 --------------------------------
8373 -- Copy_List_With_Replacement --
8374 --------------------------------
8376 function Copy_List_With_Replacement
8377 (Old_List
: List_Id
) return List_Id
8383 if Old_List
= No_List
then
8387 New_List
:= Empty_List
;
8389 E
:= First
(Old_List
);
8390 while Present
(E
) loop
8391 Append
(Copy_Node_With_Replacement
(E
), New_List
);
8397 end Copy_List_With_Replacement
;
8399 --------------------------------
8400 -- Copy_Node_With_Replacement --
8401 --------------------------------
8403 function Copy_Node_With_Replacement
8404 (Old_Node
: Node_Id
) return Node_Id
8408 procedure Adjust_Named_Associations
8409 (Old_Node
: Node_Id
;
8410 New_Node
: Node_Id
);
8411 -- If a call node has named associations, these are chained through
8412 -- the First_Named_Actual, Next_Named_Actual links. These must be
8413 -- propagated separately to the new parameter list, because these
8414 -- are not syntactic fields.
8416 function Copy_Field_With_Replacement
8417 (Field
: Union_Id
) return Union_Id
;
8418 -- Given Field, which is a field of Old_Node, return a copy of it
8419 -- if it is a syntactic field (i.e. its parent is Node), setting
8420 -- the parent of the copy to poit to New_Node. Otherwise returns
8421 -- the field (possibly mapped if it is an entity).
8423 -------------------------------
8424 -- Adjust_Named_Associations --
8425 -------------------------------
8427 procedure Adjust_Named_Associations
8428 (Old_Node
: Node_Id
;
8438 Old_E
:= First
(Parameter_Associations
(Old_Node
));
8439 New_E
:= First
(Parameter_Associations
(New_Node
));
8440 while Present
(Old_E
) loop
8441 if Nkind
(Old_E
) = N_Parameter_Association
8442 and then Present
(Next_Named_Actual
(Old_E
))
8444 if First_Named_Actual
(Old_Node
)
8445 = Explicit_Actual_Parameter
(Old_E
)
8447 Set_First_Named_Actual
8448 (New_Node
, Explicit_Actual_Parameter
(New_E
));
8451 -- Now scan parameter list from the beginning,to locate
8452 -- next named actual, which can be out of order.
8454 Old_Next
:= First
(Parameter_Associations
(Old_Node
));
8455 New_Next
:= First
(Parameter_Associations
(New_Node
));
8457 while Nkind
(Old_Next
) /= N_Parameter_Association
8458 or else Explicit_Actual_Parameter
(Old_Next
)
8459 /= Next_Named_Actual
(Old_E
)
8465 Set_Next_Named_Actual
8466 (New_E
, Explicit_Actual_Parameter
(New_Next
));
8472 end Adjust_Named_Associations
;
8474 ---------------------------------
8475 -- Copy_Field_With_Replacement --
8476 ---------------------------------
8478 function Copy_Field_With_Replacement
8479 (Field
: Union_Id
) return Union_Id
8482 if Field
= Union_Id
(Empty
) then
8485 elsif Field
in Node_Range
then
8487 Old_N
: constant Node_Id
:= Node_Id
(Field
);
8491 -- If syntactic field, as indicated by the parent pointer
8492 -- being set, then copy the referenced node recursively.
8494 if Parent
(Old_N
) = Old_Node
then
8495 New_N
:= Copy_Node_With_Replacement
(Old_N
);
8497 if New_N
/= Old_N
then
8498 Set_Parent
(New_N
, New_Node
);
8501 -- For semantic fields, update possible entity reference
8502 -- from the replacement map.
8505 New_N
:= Assoc
(Old_N
);
8508 return Union_Id
(New_N
);
8511 elsif Field
in List_Range
then
8513 Old_L
: constant List_Id
:= List_Id
(Field
);
8517 -- If syntactic field, as indicated by the parent pointer,
8518 -- then recursively copy the entire referenced list.
8520 if Parent
(Old_L
) = Old_Node
then
8521 New_L
:= Copy_List_With_Replacement
(Old_L
);
8522 Set_Parent
(New_L
, New_Node
);
8524 -- For semantic list, just returned unchanged
8530 return Union_Id
(New_L
);
8533 -- Anything other than a list or a node is returned unchanged
8538 end Copy_Field_With_Replacement
;
8540 -- Start of processing for Copy_Node_With_Replacement
8543 if Old_Node
<= Empty_Or_Error
then
8546 elsif Has_Extension
(Old_Node
) then
8547 return Assoc
(Old_Node
);
8550 New_Node
:= New_Copy
(Old_Node
);
8552 -- If the node we are copying is the associated node of a
8553 -- previously copied Itype, then adjust the associated node
8554 -- of the copy of that Itype accordingly.
8556 if Present
(Actual_Map
) then
8562 -- Case of hash table used
8564 if NCT_Hash_Tables_Used
then
8565 Ent
:= NCT_Itype_Assoc
.Get
(Old_Node
);
8567 if Present
(Ent
) then
8568 Set_Associated_Node_For_Itype
(Ent
, New_Node
);
8571 -- Case of no hash table used
8574 E
:= First_Elmt
(Actual_Map
);
8575 while Present
(E
) loop
8576 if Is_Itype
(Node
(E
))
8578 Old_Node
= Associated_Node_For_Itype
(Node
(E
))
8580 Set_Associated_Node_For_Itype
8581 (Node
(Next_Elmt
(E
)), New_Node
);
8584 E
:= Next_Elmt
(Next_Elmt
(E
));
8590 -- Recursively copy descendents
8593 (New_Node
, Copy_Field_With_Replacement
(Field1
(New_Node
)));
8595 (New_Node
, Copy_Field_With_Replacement
(Field2
(New_Node
)));
8597 (New_Node
, Copy_Field_With_Replacement
(Field3
(New_Node
)));
8599 (New_Node
, Copy_Field_With_Replacement
(Field4
(New_Node
)));
8601 (New_Node
, Copy_Field_With_Replacement
(Field5
(New_Node
)));
8603 -- Adjust Sloc of new node if necessary
8605 if New_Sloc
/= No_Location
then
8606 Set_Sloc
(New_Node
, New_Sloc
);
8608 -- If we adjust the Sloc, then we are essentially making
8609 -- a completely new node, so the Comes_From_Source flag
8610 -- should be reset to the proper default value.
8612 Nodes
.Table
(New_Node
).Comes_From_Source
:=
8613 Default_Node
.Comes_From_Source
;
8616 -- If the node is call and has named associations,
8617 -- set the corresponding links in the copy.
8619 if (Nkind
(Old_Node
) = N_Function_Call
8620 or else Nkind
(Old_Node
) = N_Entry_Call_Statement
8622 Nkind
(Old_Node
) = N_Procedure_Call_Statement
)
8623 and then Present
(First_Named_Actual
(Old_Node
))
8625 Adjust_Named_Associations
(Old_Node
, New_Node
);
8628 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
8629 -- The replacement mechanism applies to entities, and is not used
8630 -- here. Eventually we may need a more general graph-copying
8631 -- routine. For now, do a sequential search to find desired node.
8633 if Nkind
(Old_Node
) = N_Handled_Sequence_Of_Statements
8634 and then Present
(First_Real_Statement
(Old_Node
))
8637 Old_F
: constant Node_Id
:= First_Real_Statement
(Old_Node
);
8641 N1
:= First
(Statements
(Old_Node
));
8642 N2
:= First
(Statements
(New_Node
));
8644 while N1
/= Old_F
loop
8649 Set_First_Real_Statement
(New_Node
, N2
);
8654 -- All done, return copied node
8657 end Copy_Node_With_Replacement
;
8663 procedure Visit_Elist
(E
: Elist_Id
) is
8667 Elmt
:= First_Elmt
(E
);
8669 while Elmt
/= No_Elmt
loop
8670 Visit_Node
(Node
(Elmt
));
8680 procedure Visit_Field
(F
: Union_Id
; N
: Node_Id
) is
8682 if F
= Union_Id
(Empty
) then
8685 elsif F
in Node_Range
then
8687 -- Copy node if it is syntactic, i.e. its parent pointer is
8688 -- set to point to the field that referenced it (certain
8689 -- Itypes will also meet this criterion, which is fine, since
8690 -- these are clearly Itypes that do need to be copied, since
8691 -- we are copying their parent.)
8693 if Parent
(Node_Id
(F
)) = N
then
8694 Visit_Node
(Node_Id
(F
));
8697 -- Another case, if we are pointing to an Itype, then we want
8698 -- to copy it if its associated node is somewhere in the tree
8701 -- Note: the exclusion of self-referential copies is just an
8702 -- optimization, since the search of the already copied list
8703 -- would catch it, but it is a common case (Etype pointing
8704 -- to itself for an Itype that is a base type).
8706 elsif Has_Extension
(Node_Id
(F
))
8707 and then Is_Itype
(Entity_Id
(F
))
8708 and then Node_Id
(F
) /= N
8714 P
:= Associated_Node_For_Itype
(Node_Id
(F
));
8715 while Present
(P
) loop
8717 Visit_Node
(Node_Id
(F
));
8724 -- An Itype whose parent is not being copied definitely
8725 -- should NOT be copied, since it does not belong in any
8726 -- sense to the copied subtree.
8732 elsif F
in List_Range
8733 and then Parent
(List_Id
(F
)) = N
8735 Visit_List
(List_Id
(F
));
8744 procedure Visit_Itype
(Old_Itype
: Entity_Id
) is
8745 New_Itype
: Entity_Id
;
8750 -- Itypes that describe the designated type of access to subprograms
8751 -- have the structure of subprogram declarations, with signatures,
8752 -- etc. Either we duplicate the signatures completely, or choose to
8753 -- share such itypes, which is fine because their elaboration will
8754 -- have no side effects.
8756 if Ekind
(Old_Itype
) = E_Subprogram_Type
then
8760 New_Itype
:= New_Copy
(Old_Itype
);
8762 -- The new Itype has all the attributes of the old one, and
8763 -- we just copy the contents of the entity. However, the back-end
8764 -- needs different names for debugging purposes, so we create a
8765 -- new internal name for it in all cases.
8767 Set_Chars
(New_Itype
, New_Internal_Name
('T'));
8769 -- If our associated node is an entity that has already been copied,
8770 -- then set the associated node of the copy to point to the right
8771 -- copy. If we have copied an Itype that is itself the associated
8772 -- node of some previously copied Itype, then we set the right
8773 -- pointer in the other direction.
8775 if Present
(Actual_Map
) then
8777 -- Case of hash tables used
8779 if NCT_Hash_Tables_Used
then
8781 Ent
:= NCT_Assoc
.Get
(Associated_Node_For_Itype
(Old_Itype
));
8783 if Present
(Ent
) then
8784 Set_Associated_Node_For_Itype
(New_Itype
, Ent
);
8787 Ent
:= NCT_Itype_Assoc
.Get
(Old_Itype
);
8788 if Present
(Ent
) then
8789 Set_Associated_Node_For_Itype
(Ent
, New_Itype
);
8791 -- If the hash table has no association for this Itype and
8792 -- its associated node, enter one now.
8796 (Associated_Node_For_Itype
(Old_Itype
), New_Itype
);
8799 -- Case of hash tables not used
8802 E
:= First_Elmt
(Actual_Map
);
8803 while Present
(E
) loop
8804 if Associated_Node_For_Itype
(Old_Itype
) = Node
(E
) then
8805 Set_Associated_Node_For_Itype
8806 (New_Itype
, Node
(Next_Elmt
(E
)));
8809 if Is_Type
(Node
(E
))
8811 Old_Itype
= Associated_Node_For_Itype
(Node
(E
))
8813 Set_Associated_Node_For_Itype
8814 (Node
(Next_Elmt
(E
)), New_Itype
);
8817 E
:= Next_Elmt
(Next_Elmt
(E
));
8822 if Present
(Freeze_Node
(New_Itype
)) then
8823 Set_Is_Frozen
(New_Itype
, False);
8824 Set_Freeze_Node
(New_Itype
, Empty
);
8827 -- Add new association to map
8829 if No
(Actual_Map
) then
8830 Actual_Map
:= New_Elmt_List
;
8833 Append_Elmt
(Old_Itype
, Actual_Map
);
8834 Append_Elmt
(New_Itype
, Actual_Map
);
8836 if NCT_Hash_Tables_Used
then
8837 NCT_Assoc
.Set
(Old_Itype
, New_Itype
);
8840 NCT_Table_Entries
:= NCT_Table_Entries
+ 1;
8842 if NCT_Table_Entries
> NCT_Hash_Threshhold
then
8843 Build_NCT_Hash_Tables
;
8847 -- If a record subtype is simply copied, the entity list will be
8848 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
8850 if Ekind_In
(Old_Itype
, E_Record_Subtype
, E_Class_Wide_Subtype
) then
8851 Set_Cloned_Subtype
(New_Itype
, Old_Itype
);
8854 -- Visit descendents that eventually get copied
8856 Visit_Field
(Union_Id
(Etype
(Old_Itype
)), Old_Itype
);
8858 if Is_Discrete_Type
(Old_Itype
) then
8859 Visit_Field
(Union_Id
(Scalar_Range
(Old_Itype
)), Old_Itype
);
8861 elsif Has_Discriminants
(Base_Type
(Old_Itype
)) then
8862 -- ??? This should involve call to Visit_Field
8863 Visit_Elist
(Discriminant_Constraint
(Old_Itype
));
8865 elsif Is_Array_Type
(Old_Itype
) then
8866 if Present
(First_Index
(Old_Itype
)) then
8867 Visit_Field
(Union_Id
(List_Containing
8868 (First_Index
(Old_Itype
))),
8872 if Is_Packed
(Old_Itype
) then
8873 Visit_Field
(Union_Id
(Packed_Array_Type
(Old_Itype
)),
8883 procedure Visit_List
(L
: List_Id
) is
8886 if L
/= No_List
then
8889 while Present
(N
) loop
8900 procedure Visit_Node
(N
: Node_Or_Entity_Id
) is
8902 -- Start of processing for Visit_Node
8905 -- Handle case of an Itype, which must be copied
8907 if Has_Extension
(N
)
8908 and then Is_Itype
(N
)
8910 -- Nothing to do if already in the list. This can happen with an
8911 -- Itype entity that appears more than once in the tree.
8912 -- Note that we do not want to visit descendents in this case.
8914 -- Test for already in list when hash table is used
8916 if NCT_Hash_Tables_Used
then
8917 if Present
(NCT_Assoc
.Get
(Entity_Id
(N
))) then
8921 -- Test for already in list when hash table not used
8927 if Present
(Actual_Map
) then
8928 E
:= First_Elmt
(Actual_Map
);
8929 while Present
(E
) loop
8930 if Node
(E
) = N
then
8933 E
:= Next_Elmt
(Next_Elmt
(E
));
8943 -- Visit descendents
8945 Visit_Field
(Field1
(N
), N
);
8946 Visit_Field
(Field2
(N
), N
);
8947 Visit_Field
(Field3
(N
), N
);
8948 Visit_Field
(Field4
(N
), N
);
8949 Visit_Field
(Field5
(N
), N
);
8952 -- Start of processing for New_Copy_Tree
8957 -- See if we should use hash table
8959 if No
(Actual_Map
) then
8960 NCT_Hash_Tables_Used
:= False;
8967 NCT_Table_Entries
:= 0;
8969 Elmt
:= First_Elmt
(Actual_Map
);
8970 while Present
(Elmt
) loop
8971 NCT_Table_Entries
:= NCT_Table_Entries
+ 1;
8976 if NCT_Table_Entries
> NCT_Hash_Threshhold
then
8977 Build_NCT_Hash_Tables
;
8979 NCT_Hash_Tables_Used
:= False;
8984 -- Hash table set up if required, now start phase one by visiting
8985 -- top node (we will recursively visit the descendents).
8987 Visit_Node
(Source
);
8989 -- Now the second phase of the copy can start. First we process
8990 -- all the mapped entities, copying their descendents.
8992 if Present
(Actual_Map
) then
8995 New_Itype
: Entity_Id
;
8997 Elmt
:= First_Elmt
(Actual_Map
);
8998 while Present
(Elmt
) loop
9000 New_Itype
:= Node
(Elmt
);
9001 Copy_Itype_With_Replacement
(New_Itype
);
9007 -- Now we can copy the actual tree
9009 return Copy_Node_With_Replacement
(Source
);
9012 -------------------------
9013 -- New_External_Entity --
9014 -------------------------
9016 function New_External_Entity
9017 (Kind
: Entity_Kind
;
9018 Scope_Id
: Entity_Id
;
9019 Sloc_Value
: Source_Ptr
;
9020 Related_Id
: Entity_Id
;
9022 Suffix_Index
: Nat
:= 0;
9023 Prefix
: Character := ' ') return Entity_Id
9025 N
: constant Entity_Id
:=
9026 Make_Defining_Identifier
(Sloc_Value
,
9028 (Chars
(Related_Id
), Suffix
, Suffix_Index
, Prefix
));
9031 Set_Ekind
(N
, Kind
);
9032 Set_Is_Internal
(N
, True);
9033 Append_Entity
(N
, Scope_Id
);
9034 Set_Public_Status
(N
);
9036 if Kind
in Type_Kind
then
9037 Init_Size_Align
(N
);
9041 end New_External_Entity
;
9043 -------------------------
9044 -- New_Internal_Entity --
9045 -------------------------
9047 function New_Internal_Entity
9048 (Kind
: Entity_Kind
;
9049 Scope_Id
: Entity_Id
;
9050 Sloc_Value
: Source_Ptr
;
9051 Id_Char
: Character) return Entity_Id
9053 N
: constant Entity_Id
:= Make_Temporary
(Sloc_Value
, Id_Char
);
9056 Set_Ekind
(N
, Kind
);
9057 Set_Is_Internal
(N
, True);
9058 Append_Entity
(N
, Scope_Id
);
9060 if Kind
in Type_Kind
then
9061 Init_Size_Align
(N
);
9065 end New_Internal_Entity
;
9071 function Next_Actual
(Actual_Id
: Node_Id
) return Node_Id
is
9075 -- If we are pointing at a positional parameter, it is a member of a
9076 -- node list (the list of parameters), and the next parameter is the
9077 -- next node on the list, unless we hit a parameter association, then
9078 -- we shift to using the chain whose head is the First_Named_Actual in
9079 -- the parent, and then is threaded using the Next_Named_Actual of the
9080 -- Parameter_Association. All this fiddling is because the original node
9081 -- list is in the textual call order, and what we need is the
9082 -- declaration order.
9084 if Is_List_Member
(Actual_Id
) then
9085 N
:= Next
(Actual_Id
);
9087 if Nkind
(N
) = N_Parameter_Association
then
9088 return First_Named_Actual
(Parent
(Actual_Id
));
9094 return Next_Named_Actual
(Parent
(Actual_Id
));
9098 procedure Next_Actual
(Actual_Id
: in out Node_Id
) is
9100 Actual_Id
:= Next_Actual
(Actual_Id
);
9103 -----------------------
9104 -- Normalize_Actuals --
9105 -----------------------
9107 -- Chain actuals according to formals of subprogram. If there are no named
9108 -- associations, the chain is simply the list of Parameter Associations,
9109 -- since the order is the same as the declaration order. If there are named
9110 -- associations, then the First_Named_Actual field in the N_Function_Call
9111 -- or N_Procedure_Call_Statement node points to the Parameter_Association
9112 -- node for the parameter that comes first in declaration order. The
9113 -- remaining named parameters are then chained in declaration order using
9114 -- Next_Named_Actual.
9116 -- This routine also verifies that the number of actuals is compatible with
9117 -- the number and default values of formals, but performs no type checking
9118 -- (type checking is done by the caller).
9120 -- If the matching succeeds, Success is set to True and the caller proceeds
9121 -- with type-checking. If the match is unsuccessful, then Success is set to
9122 -- False, and the caller attempts a different interpretation, if there is
9125 -- If the flag Report is on, the call is not overloaded, and a failure to
9126 -- match can be reported here, rather than in the caller.
9128 procedure Normalize_Actuals
9132 Success
: out Boolean)
9134 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
9135 Actual
: Node_Id
:= Empty
;
9137 Last
: Node_Id
:= Empty
;
9138 First_Named
: Node_Id
:= Empty
;
9141 Formals_To_Match
: Integer := 0;
9142 Actuals_To_Match
: Integer := 0;
9144 procedure Chain
(A
: Node_Id
);
9145 -- Add named actual at the proper place in the list, using the
9146 -- Next_Named_Actual link.
9148 function Reporting
return Boolean;
9149 -- Determines if an error is to be reported. To report an error, we
9150 -- need Report to be True, and also we do not report errors caused
9151 -- by calls to init procs that occur within other init procs. Such
9152 -- errors must always be cascaded errors, since if all the types are
9153 -- declared correctly, the compiler will certainly build decent calls!
9159 procedure Chain
(A
: Node_Id
) is
9163 -- Call node points to first actual in list
9165 Set_First_Named_Actual
(N
, Explicit_Actual_Parameter
(A
));
9168 Set_Next_Named_Actual
(Last
, Explicit_Actual_Parameter
(A
));
9172 Set_Next_Named_Actual
(Last
, Empty
);
9179 function Reporting
return Boolean is
9184 elsif not Within_Init_Proc
then
9187 elsif Is_Init_Proc
(Entity
(Name
(N
))) then
9195 -- Start of processing for Normalize_Actuals
9198 if Is_Access_Type
(S
) then
9200 -- The name in the call is a function call that returns an access
9201 -- to subprogram. The designated type has the list of formals.
9203 Formal
:= First_Formal
(Designated_Type
(S
));
9205 Formal
:= First_Formal
(S
);
9208 while Present
(Formal
) loop
9209 Formals_To_Match
:= Formals_To_Match
+ 1;
9210 Next_Formal
(Formal
);
9213 -- Find if there is a named association, and verify that no positional
9214 -- associations appear after named ones.
9216 if Present
(Actuals
) then
9217 Actual
:= First
(Actuals
);
9220 while Present
(Actual
)
9221 and then Nkind
(Actual
) /= N_Parameter_Association
9223 Actuals_To_Match
:= Actuals_To_Match
+ 1;
9227 if No
(Actual
) and Actuals_To_Match
= Formals_To_Match
then
9229 -- Most common case: positional notation, no defaults
9234 elsif Actuals_To_Match
> Formals_To_Match
then
9236 -- Too many actuals: will not work
9239 if Is_Entity_Name
(Name
(N
)) then
9240 Error_Msg_N
("too many arguments in call to&", Name
(N
));
9242 Error_Msg_N
("too many arguments in call", N
);
9250 First_Named
:= Actual
;
9252 while Present
(Actual
) loop
9253 if Nkind
(Actual
) /= N_Parameter_Association
then
9255 ("positional parameters not allowed after named ones", Actual
);
9260 Actuals_To_Match
:= Actuals_To_Match
+ 1;
9266 if Present
(Actuals
) then
9267 Actual
:= First
(Actuals
);
9270 Formal
:= First_Formal
(S
);
9271 while Present
(Formal
) loop
9273 -- Match the formals in order. If the corresponding actual is
9274 -- positional, nothing to do. Else scan the list of named actuals
9275 -- to find the one with the right name.
9278 and then Nkind
(Actual
) /= N_Parameter_Association
9281 Actuals_To_Match
:= Actuals_To_Match
- 1;
9282 Formals_To_Match
:= Formals_To_Match
- 1;
9285 -- For named parameters, search the list of actuals to find
9286 -- one that matches the next formal name.
9288 Actual
:= First_Named
;
9290 while Present
(Actual
) loop
9291 if Chars
(Selector_Name
(Actual
)) = Chars
(Formal
) then
9294 Actuals_To_Match
:= Actuals_To_Match
- 1;
9295 Formals_To_Match
:= Formals_To_Match
- 1;
9303 if Ekind
(Formal
) /= E_In_Parameter
9304 or else No
(Default_Value
(Formal
))
9307 if (Comes_From_Source
(S
)
9308 or else Sloc
(S
) = Standard_Location
)
9309 and then Is_Overloadable
(S
)
9313 (Nkind
(Parent
(N
)) = N_Procedure_Call_Statement
9315 (Nkind
(Parent
(N
)) = N_Function_Call
9317 Nkind
(Parent
(N
)) = N_Parameter_Association
))
9318 and then Ekind
(S
) /= E_Function
9320 Set_Etype
(N
, Etype
(S
));
9322 Error_Msg_Name_1
:= Chars
(S
);
9323 Error_Msg_Sloc
:= Sloc
(S
);
9325 ("missing argument for parameter & " &
9326 "in call to % declared #", N
, Formal
);
9329 elsif Is_Overloadable
(S
) then
9330 Error_Msg_Name_1
:= Chars
(S
);
9332 -- Point to type derivation that generated the
9335 Error_Msg_Sloc
:= Sloc
(Parent
(S
));
9338 ("missing argument for parameter & " &
9339 "in call to % (inherited) #", N
, Formal
);
9343 ("missing argument for parameter &", N
, Formal
);
9351 Formals_To_Match
:= Formals_To_Match
- 1;
9356 Next_Formal
(Formal
);
9359 if Formals_To_Match
= 0 and then Actuals_To_Match
= 0 then
9366 -- Find some superfluous named actual that did not get
9367 -- attached to the list of associations.
9369 Actual
:= First
(Actuals
);
9370 while Present
(Actual
) loop
9371 if Nkind
(Actual
) = N_Parameter_Association
9372 and then Actual
/= Last
9373 and then No
(Next_Named_Actual
(Actual
))
9375 Error_Msg_N
("unmatched actual & in call",
9376 Selector_Name
(Actual
));
9387 end Normalize_Actuals
;
9389 --------------------------------
9390 -- Note_Possible_Modification --
9391 --------------------------------
9393 procedure Note_Possible_Modification
(N
: Node_Id
; Sure
: Boolean) is
9394 Modification_Comes_From_Source
: constant Boolean :=
9395 Comes_From_Source
(Parent
(N
));
9401 -- Loop to find referenced entity, if there is one
9408 if Is_Entity_Name
(Exp
) then
9409 Ent
:= Entity
(Exp
);
9411 -- If the entity is missing, it is an undeclared identifier,
9412 -- and there is nothing to annotate.
9418 elsif Nkind
(Exp
) = N_Explicit_Dereference
then
9420 P
: constant Node_Id
:= Prefix
(Exp
);
9423 if Nkind
(P
) = N_Selected_Component
9425 Entry_Formal
(Entity
(Selector_Name
(P
))))
9427 -- Case of a reference to an entry formal
9429 Ent
:= Entry_Formal
(Entity
(Selector_Name
(P
)));
9431 elsif Nkind
(P
) = N_Identifier
9432 and then Nkind
(Parent
(Entity
(P
))) = N_Object_Declaration
9433 and then Present
(Expression
(Parent
(Entity
(P
))))
9434 and then Nkind
(Expression
(Parent
(Entity
(P
))))
9437 -- Case of a reference to a value on which side effects have
9440 Exp
:= Prefix
(Expression
(Parent
(Entity
(P
))));
9449 elsif Nkind
(Exp
) = N_Type_Conversion
9450 or else Nkind
(Exp
) = N_Unchecked_Type_Conversion
9452 Exp
:= Expression
(Exp
);
9455 elsif Nkind
(Exp
) = N_Slice
9456 or else Nkind
(Exp
) = N_Indexed_Component
9457 or else Nkind
(Exp
) = N_Selected_Component
9459 Exp
:= Prefix
(Exp
);
9466 -- Now look for entity being referenced
9468 if Present
(Ent
) then
9469 if Is_Object
(Ent
) then
9470 if Comes_From_Source
(Exp
)
9471 or else Modification_Comes_From_Source
9473 -- Give warning if pragma unmodified given and we are
9474 -- sure this is a modification.
9476 if Has_Pragma_Unmodified
(Ent
) and then Sure
then
9477 Error_Msg_NE
("?pragma Unmodified given for &!", N
, Ent
);
9480 Set_Never_Set_In_Source
(Ent
, False);
9483 Set_Is_True_Constant
(Ent
, False);
9484 Set_Current_Value
(Ent
, Empty
);
9485 Set_Is_Known_Null
(Ent
, False);
9487 if not Can_Never_Be_Null
(Ent
) then
9488 Set_Is_Known_Non_Null
(Ent
, False);
9491 -- Follow renaming chain
9493 if (Ekind
(Ent
) = E_Variable
or else Ekind
(Ent
) = E_Constant
)
9494 and then Present
(Renamed_Object
(Ent
))
9496 Exp
:= Renamed_Object
(Ent
);
9500 -- Generate a reference only if the assignment comes from
9501 -- source. This excludes, for example, calls to a dispatching
9502 -- assignment operation when the left-hand side is tagged.
9504 if Modification_Comes_From_Source
then
9505 Generate_Reference
(Ent
, Exp
, 'm');
9508 Check_Nested_Access
(Ent
);
9513 -- If we are sure this is a modification from source, and we know
9514 -- this modifies a constant, then give an appropriate warning.
9516 if Overlays_Constant
(Ent
)
9517 and then Modification_Comes_From_Source
9521 A
: constant Node_Id
:= Address_Clause
(Ent
);
9525 Exp
: constant Node_Id
:= Expression
(A
);
9527 if Nkind
(Exp
) = N_Attribute_Reference
9528 and then Attribute_Name
(Exp
) = Name_Address
9529 and then Is_Entity_Name
(Prefix
(Exp
))
9531 Error_Msg_Sloc
:= Sloc
(A
);
9533 ("constant& may be modified via address clause#?",
9534 N
, Entity
(Prefix
(Exp
)));
9544 end Note_Possible_Modification
;
9546 -------------------------
9547 -- Object_Access_Level --
9548 -------------------------
9550 function Object_Access_Level
(Obj
: Node_Id
) return Uint
is
9553 -- Returns the static accessibility level of the view denoted by Obj. Note
9554 -- that the value returned is the result of a call to Scope_Depth. Only
9555 -- scope depths associated with dynamic scopes can actually be returned.
9556 -- Since only relative levels matter for accessibility checking, the fact
9557 -- that the distance between successive levels of accessibility is not
9558 -- always one is immaterial (invariant: if level(E2) is deeper than
9559 -- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
9561 function Reference_To
(Obj
: Node_Id
) return Node_Id
;
9562 -- An explicit dereference is created when removing side-effects from
9563 -- expressions for constraint checking purposes. In this case a local
9564 -- access type is created for it. The correct access level is that of
9565 -- the original source node. We detect this case by noting that the
9566 -- prefix of the dereference is created by an object declaration whose
9567 -- initial expression is a reference.
9573 function Reference_To
(Obj
: Node_Id
) return Node_Id
is
9574 Pref
: constant Node_Id
:= Prefix
(Obj
);
9576 if Is_Entity_Name
(Pref
)
9577 and then Nkind
(Parent
(Entity
(Pref
))) = N_Object_Declaration
9578 and then Present
(Expression
(Parent
(Entity
(Pref
))))
9579 and then Nkind
(Expression
(Parent
(Entity
(Pref
)))) = N_Reference
9581 return (Prefix
(Expression
(Parent
(Entity
(Pref
)))));
9587 -- Start of processing for Object_Access_Level
9590 if Is_Entity_Name
(Obj
) then
9593 if Is_Prival
(E
) then
9594 E
:= Prival_Link
(E
);
9597 -- If E is a type then it denotes a current instance. For this case
9598 -- we add one to the normal accessibility level of the type to ensure
9599 -- that current instances are treated as always being deeper than
9600 -- than the level of any visible named access type (see 3.10.2(21)).
9603 return Type_Access_Level
(E
) + 1;
9605 elsif Present
(Renamed_Object
(E
)) then
9606 return Object_Access_Level
(Renamed_Object
(E
));
9608 -- Similarly, if E is a component of the current instance of a
9609 -- protected type, any instance of it is assumed to be at a deeper
9610 -- level than the type. For a protected object (whose type is an
9611 -- anonymous protected type) its components are at the same level
9612 -- as the type itself.
9614 elsif not Is_Overloadable
(E
)
9615 and then Ekind
(Scope
(E
)) = E_Protected_Type
9616 and then Comes_From_Source
(Scope
(E
))
9618 return Type_Access_Level
(Scope
(E
)) + 1;
9621 return Scope_Depth
(Enclosing_Dynamic_Scope
(E
));
9624 elsif Nkind
(Obj
) = N_Selected_Component
then
9625 if Is_Access_Type
(Etype
(Prefix
(Obj
))) then
9626 return Type_Access_Level
(Etype
(Prefix
(Obj
)));
9628 return Object_Access_Level
(Prefix
(Obj
));
9631 elsif Nkind
(Obj
) = N_Indexed_Component
then
9632 if Is_Access_Type
(Etype
(Prefix
(Obj
))) then
9633 return Type_Access_Level
(Etype
(Prefix
(Obj
)));
9635 return Object_Access_Level
(Prefix
(Obj
));
9638 elsif Nkind
(Obj
) = N_Explicit_Dereference
then
9640 -- If the prefix is a selected access discriminant then we make a
9641 -- recursive call on the prefix, which will in turn check the level
9642 -- of the prefix object of the selected discriminant.
9644 if Nkind
(Prefix
(Obj
)) = N_Selected_Component
9645 and then Ekind
(Etype
(Prefix
(Obj
))) = E_Anonymous_Access_Type
9647 Ekind
(Entity
(Selector_Name
(Prefix
(Obj
)))) = E_Discriminant
9649 return Object_Access_Level
(Prefix
(Obj
));
9651 elsif not (Comes_From_Source
(Obj
)) then
9653 Ref
: constant Node_Id
:= Reference_To
(Obj
);
9655 if Present
(Ref
) then
9656 return Object_Access_Level
(Ref
);
9658 return Type_Access_Level
(Etype
(Prefix
(Obj
)));
9663 return Type_Access_Level
(Etype
(Prefix
(Obj
)));
9666 elsif Nkind
(Obj
) = N_Type_Conversion
9667 or else Nkind
(Obj
) = N_Unchecked_Type_Conversion
9669 return Object_Access_Level
(Expression
(Obj
));
9671 elsif Nkind
(Obj
) = N_Function_Call
then
9673 -- Function results are objects, so we get either the access level of
9674 -- the function or, in the case of an indirect call, the level of the
9675 -- access-to-subprogram type. (This code is used for Ada 95, but it
9676 -- looks wrong, because it seems that we should be checking the level
9677 -- of the call itself, even for Ada 95. However, using the Ada 2005
9678 -- version of the code causes regressions in several tests that are
9679 -- compiled with -gnat95. ???)
9681 if Ada_Version
< Ada_2005
then
9682 if Is_Entity_Name
(Name
(Obj
)) then
9683 return Subprogram_Access_Level
(Entity
(Name
(Obj
)));
9685 return Type_Access_Level
(Etype
(Prefix
(Name
(Obj
))));
9688 -- For Ada 2005, the level of the result object of a function call is
9689 -- defined to be the level of the call's innermost enclosing master.
9690 -- We determine that by querying the depth of the innermost enclosing
9694 Return_Master_Scope_Depth_Of_Call
: declare
9696 function Innermost_Master_Scope_Depth
9697 (N
: Node_Id
) return Uint
;
9698 -- Returns the scope depth of the given node's innermost
9699 -- enclosing dynamic scope (effectively the accessibility
9700 -- level of the innermost enclosing master).
9702 ----------------------------------
9703 -- Innermost_Master_Scope_Depth --
9704 ----------------------------------
9706 function Innermost_Master_Scope_Depth
9707 (N
: Node_Id
) return Uint
9709 Node_Par
: Node_Id
:= Parent
(N
);
9712 -- Locate the nearest enclosing node (by traversing Parents)
9713 -- that Defining_Entity can be applied to, and return the
9714 -- depth of that entity's nearest enclosing dynamic scope.
9716 while Present
(Node_Par
) loop
9717 case Nkind
(Node_Par
) is
9718 when N_Component_Declaration |
9719 N_Entry_Declaration |
9720 N_Formal_Object_Declaration |
9721 N_Formal_Type_Declaration |
9722 N_Full_Type_Declaration |
9723 N_Incomplete_Type_Declaration |
9724 N_Loop_Parameter_Specification |
9725 N_Object_Declaration |
9726 N_Protected_Type_Declaration |
9727 N_Private_Extension_Declaration |
9728 N_Private_Type_Declaration |
9729 N_Subtype_Declaration |
9730 N_Function_Specification |
9731 N_Procedure_Specification |
9732 N_Task_Type_Declaration |
9734 N_Generic_Instantiation |
9736 N_Implicit_Label_Declaration |
9737 N_Package_Declaration |
9738 N_Single_Task_Declaration |
9739 N_Subprogram_Declaration |
9740 N_Generic_Declaration |
9741 N_Renaming_Declaration |
9743 N_Formal_Subprogram_Declaration |
9744 N_Abstract_Subprogram_Declaration |
9746 N_Exception_Declaration |
9747 N_Formal_Package_Declaration |
9748 N_Number_Declaration |
9749 N_Package_Specification |
9750 N_Parameter_Specification |
9751 N_Single_Protected_Declaration |
9755 (Nearest_Dynamic_Scope
9756 (Defining_Entity
(Node_Par
)));
9762 Node_Par
:= Parent
(Node_Par
);
9765 pragma Assert
(False);
9767 -- Should never reach the following return
9769 return Scope_Depth
(Current_Scope
) + 1;
9770 end Innermost_Master_Scope_Depth
;
9772 -- Start of processing for Return_Master_Scope_Depth_Of_Call
9775 return Innermost_Master_Scope_Depth
(Obj
);
9776 end Return_Master_Scope_Depth_Of_Call
;
9779 -- For convenience we handle qualified expressions, even though
9780 -- they aren't technically object names.
9782 elsif Nkind
(Obj
) = N_Qualified_Expression
then
9783 return Object_Access_Level
(Expression
(Obj
));
9785 -- Otherwise return the scope level of Standard.
9786 -- (If there are cases that fall through
9787 -- to this point they will be treated as
9788 -- having global accessibility for now. ???)
9791 return Scope_Depth
(Standard_Standard
);
9793 end Object_Access_Level
;
9795 -----------------------
9796 -- Private_Component --
9797 -----------------------
9799 function Private_Component
(Type_Id
: Entity_Id
) return Entity_Id
is
9800 Ancestor
: constant Entity_Id
:= Base_Type
(Type_Id
);
9802 function Trace_Components
9804 Check
: Boolean) return Entity_Id
;
9805 -- Recursive function that does the work, and checks against circular
9806 -- definition for each subcomponent type.
9808 ----------------------
9809 -- Trace_Components --
9810 ----------------------
9812 function Trace_Components
9814 Check
: Boolean) return Entity_Id
9816 Btype
: constant Entity_Id
:= Base_Type
(T
);
9817 Component
: Entity_Id
;
9819 Candidate
: Entity_Id
:= Empty
;
9822 if Check
and then Btype
= Ancestor
then
9823 Error_Msg_N
("circular type definition", Type_Id
);
9827 if Is_Private_Type
(Btype
)
9828 and then not Is_Generic_Type
(Btype
)
9830 if Present
(Full_View
(Btype
))
9831 and then Is_Record_Type
(Full_View
(Btype
))
9832 and then not Is_Frozen
(Btype
)
9834 -- To indicate that the ancestor depends on a private type, the
9835 -- current Btype is sufficient. However, to check for circular
9836 -- definition we must recurse on the full view.
9838 Candidate
:= Trace_Components
(Full_View
(Btype
), True);
9840 if Candidate
= Any_Type
then
9850 elsif Is_Array_Type
(Btype
) then
9851 return Trace_Components
(Component_Type
(Btype
), True);
9853 elsif Is_Record_Type
(Btype
) then
9854 Component
:= First_Entity
(Btype
);
9855 while Present
(Component
) loop
9857 -- Skip anonymous types generated by constrained components
9859 if not Is_Type
(Component
) then
9860 P
:= Trace_Components
(Etype
(Component
), True);
9863 if P
= Any_Type
then
9871 Next_Entity
(Component
);
9879 end Trace_Components
;
9881 -- Start of processing for Private_Component
9884 return Trace_Components
(Type_Id
, False);
9885 end Private_Component
;
9887 ---------------------------
9888 -- Primitive_Names_Match --
9889 ---------------------------
9891 function Primitive_Names_Match
(E1
, E2
: Entity_Id
) return Boolean is
9893 function Non_Internal_Name
(E
: Entity_Id
) return Name_Id
;
9894 -- Given an internal name, returns the corresponding non-internal name
9896 ------------------------
9897 -- Non_Internal_Name --
9898 ------------------------
9900 function Non_Internal_Name
(E
: Entity_Id
) return Name_Id
is
9902 Get_Name_String
(Chars
(E
));
9903 Name_Len
:= Name_Len
- 1;
9905 end Non_Internal_Name
;
9907 -- Start of processing for Primitive_Names_Match
9910 pragma Assert
(Present
(E1
) and then Present
(E2
));
9912 return Chars
(E1
) = Chars
(E2
)
9914 (not Is_Internal_Name
(Chars
(E1
))
9915 and then Is_Internal_Name
(Chars
(E2
))
9916 and then Non_Internal_Name
(E2
) = Chars
(E1
))
9918 (not Is_Internal_Name
(Chars
(E2
))
9919 and then Is_Internal_Name
(Chars
(E1
))
9920 and then Non_Internal_Name
(E1
) = Chars
(E2
))
9922 (Is_Predefined_Dispatching_Operation
(E1
)
9923 and then Is_Predefined_Dispatching_Operation
(E2
)
9924 and then Same_TSS
(E1
, E2
))
9926 (Is_Init_Proc
(E1
) and then Is_Init_Proc
(E2
));
9927 end Primitive_Names_Match
;
9929 -----------------------
9930 -- Process_End_Label --
9931 -----------------------
9933 procedure Process_End_Label
9942 Label_Ref
: Boolean;
9943 -- Set True if reference to end label itself is required
9946 -- Gets set to the operator symbol or identifier that references the
9947 -- entity Ent. For the child unit case, this is the identifier from the
9948 -- designator. For other cases, this is simply Endl.
9950 procedure Generate_Parent_Ref
(N
: Node_Id
; E
: Entity_Id
);
9951 -- N is an identifier node that appears as a parent unit reference in
9952 -- the case where Ent is a child unit. This procedure generates an
9953 -- appropriate cross-reference entry. E is the corresponding entity.
9955 -------------------------
9956 -- Generate_Parent_Ref --
9957 -------------------------
9959 procedure Generate_Parent_Ref
(N
: Node_Id
; E
: Entity_Id
) is
9961 -- If names do not match, something weird, skip reference
9963 if Chars
(E
) = Chars
(N
) then
9965 -- Generate the reference. We do NOT consider this as a reference
9966 -- for unreferenced symbol purposes.
9968 Generate_Reference
(E
, N
, 'r', Set_Ref
=> False, Force
=> True);
9971 Style
.Check_Identifier
(N
, E
);
9974 end Generate_Parent_Ref
;
9976 -- Start of processing for Process_End_Label
9979 -- If no node, ignore. This happens in some error situations, and
9980 -- also for some internally generated structures where no end label
9981 -- references are required in any case.
9987 -- Nothing to do if no End_Label, happens for internally generated
9988 -- constructs where we don't want an end label reference anyway. Also
9989 -- nothing to do if Endl is a string literal, which means there was
9990 -- some prior error (bad operator symbol)
9992 Endl
:= End_Label
(N
);
9994 if No
(Endl
) or else Nkind
(Endl
) = N_String_Literal
then
9998 -- Reference node is not in extended main source unit
10000 if not In_Extended_Main_Source_Unit
(N
) then
10002 -- Generally we do not collect references except for the extended
10003 -- main source unit. The one exception is the 'e' entry for a
10004 -- package spec, where it is useful for a client to have the
10005 -- ending information to define scopes.
10011 Label_Ref
:= False;
10013 -- For this case, we can ignore any parent references, but we
10014 -- need the package name itself for the 'e' entry.
10016 if Nkind
(Endl
) = N_Designator
then
10017 Endl
:= Identifier
(Endl
);
10021 -- Reference is in extended main source unit
10026 -- For designator, generate references for the parent entries
10028 if Nkind
(Endl
) = N_Designator
then
10030 -- Generate references for the prefix if the END line comes from
10031 -- source (otherwise we do not need these references) We climb the
10032 -- scope stack to find the expected entities.
10034 if Comes_From_Source
(Endl
) then
10035 Nam
:= Name
(Endl
);
10036 Scop
:= Current_Scope
;
10037 while Nkind
(Nam
) = N_Selected_Component
loop
10038 Scop
:= Scope
(Scop
);
10039 exit when No
(Scop
);
10040 Generate_Parent_Ref
(Selector_Name
(Nam
), Scop
);
10041 Nam
:= Prefix
(Nam
);
10044 if Present
(Scop
) then
10045 Generate_Parent_Ref
(Nam
, Scope
(Scop
));
10049 Endl
:= Identifier
(Endl
);
10053 -- If the end label is not for the given entity, then either we have
10054 -- some previous error, or this is a generic instantiation for which
10055 -- we do not need to make a cross-reference in this case anyway. In
10056 -- either case we simply ignore the call.
10058 if Chars
(Ent
) /= Chars
(Endl
) then
10062 -- If label was really there, then generate a normal reference and then
10063 -- adjust the location in the end label to point past the name (which
10064 -- should almost always be the semicolon).
10066 Loc
:= Sloc
(Endl
);
10068 if Comes_From_Source
(Endl
) then
10070 -- If a label reference is required, then do the style check and
10071 -- generate an l-type cross-reference entry for the label
10074 if Style_Check
then
10075 Style
.Check_Identifier
(Endl
, Ent
);
10078 Generate_Reference
(Ent
, Endl
, 'l', Set_Ref
=> False);
10081 -- Set the location to point past the label (normally this will
10082 -- mean the semicolon immediately following the label). This is
10083 -- done for the sake of the 'e' or 't' entry generated below.
10085 Get_Decoded_Name_String
(Chars
(Endl
));
10086 Set_Sloc
(Endl
, Sloc
(Endl
) + Source_Ptr
(Name_Len
));
10089 -- Now generate the e/t reference
10091 Generate_Reference
(Ent
, Endl
, Typ
, Set_Ref
=> False, Force
=> True);
10093 -- Restore Sloc, in case modified above, since we have an identifier
10094 -- and the normal Sloc should be left set in the tree.
10096 Set_Sloc
(Endl
, Loc
);
10097 end Process_End_Label
;
10103 -- We do the conversion to get the value of the real string by using
10104 -- the scanner, see Sinput for details on use of the internal source
10105 -- buffer for scanning internal strings.
10107 function Real_Convert
(S
: String) return Node_Id
is
10108 Save_Src
: constant Source_Buffer_Ptr
:= Source
;
10109 Negative
: Boolean;
10112 Source
:= Internal_Source_Ptr
;
10115 for J
in S
'Range loop
10116 Source
(Source_Ptr
(J
)) := S
(J
);
10119 Source
(S
'Length + 1) := EOF
;
10121 if Source
(Scan_Ptr
) = '-' then
10123 Scan_Ptr
:= Scan_Ptr
+ 1;
10131 Set_Realval
(Token_Node
, UR_Negate
(Realval
(Token_Node
)));
10134 Source
:= Save_Src
;
10138 ------------------------------------
10139 -- References_Generic_Formal_Type --
10140 ------------------------------------
10142 function References_Generic_Formal_Type
(N
: Node_Id
) return Boolean is
10144 function Process
(N
: Node_Id
) return Traverse_Result
;
10145 -- Process one node in search for generic formal type
10151 function Process
(N
: Node_Id
) return Traverse_Result
is
10153 if Nkind
(N
) in N_Has_Entity
then
10155 E
: constant Entity_Id
:= Entity
(N
);
10157 if Present
(E
) then
10158 if Is_Generic_Type
(E
) then
10160 elsif Present
(Etype
(E
))
10161 and then Is_Generic_Type
(Etype
(E
))
10172 function Traverse
is new Traverse_Func
(Process
);
10173 -- Traverse tree to look for generic type
10176 if Inside_A_Generic
then
10177 return Traverse
(N
) = Abandon
;
10181 end References_Generic_Formal_Type
;
10183 --------------------
10184 -- Remove_Homonym --
10185 --------------------
10187 procedure Remove_Homonym
(E
: Entity_Id
) is
10188 Prev
: Entity_Id
:= Empty
;
10192 if E
= Current_Entity
(E
) then
10193 if Present
(Homonym
(E
)) then
10194 Set_Current_Entity
(Homonym
(E
));
10196 Set_Name_Entity_Id
(Chars
(E
), Empty
);
10199 H
:= Current_Entity
(E
);
10200 while Present
(H
) and then H
/= E
loop
10205 Set_Homonym
(Prev
, Homonym
(E
));
10207 end Remove_Homonym
;
10209 ---------------------
10210 -- Rep_To_Pos_Flag --
10211 ---------------------
10213 function Rep_To_Pos_Flag
(E
: Entity_Id
; Loc
: Source_Ptr
) return Node_Id
is
10215 return New_Occurrence_Of
10216 (Boolean_Literals
(not Range_Checks_Suppressed
(E
)), Loc
);
10217 end Rep_To_Pos_Flag
;
10219 --------------------
10220 -- Require_Entity --
10221 --------------------
10223 procedure Require_Entity
(N
: Node_Id
) is
10225 if Is_Entity_Name
(N
) and then No
(Entity
(N
)) then
10226 if Total_Errors_Detected
/= 0 then
10227 Set_Entity
(N
, Any_Id
);
10229 raise Program_Error
;
10232 end Require_Entity
;
10234 ------------------------------
10235 -- Requires_Transient_Scope --
10236 ------------------------------
10238 -- A transient scope is required when variable-sized temporaries are
10239 -- allocated in the primary or secondary stack, or when finalization
10240 -- actions must be generated before the next instruction.
10242 function Requires_Transient_Scope
(Id
: Entity_Id
) return Boolean is
10243 Typ
: constant Entity_Id
:= Underlying_Type
(Id
);
10245 -- Start of processing for Requires_Transient_Scope
10248 -- This is a private type which is not completed yet. This can only
10249 -- happen in a default expression (of a formal parameter or of a
10250 -- record component). Do not expand transient scope in this case
10255 -- Do not expand transient scope for non-existent procedure return
10257 elsif Typ
= Standard_Void_Type
then
10260 -- Elementary types do not require a transient scope
10262 elsif Is_Elementary_Type
(Typ
) then
10265 -- Generally, indefinite subtypes require a transient scope, since the
10266 -- back end cannot generate temporaries, since this is not a valid type
10267 -- for declaring an object. It might be possible to relax this in the
10268 -- future, e.g. by declaring the maximum possible space for the type.
10270 elsif Is_Indefinite_Subtype
(Typ
) then
10273 -- Functions returning tagged types may dispatch on result so their
10274 -- returned value is allocated on the secondary stack. Controlled
10275 -- type temporaries need finalization.
10277 elsif Is_Tagged_Type
(Typ
)
10278 or else Has_Controlled_Component
(Typ
)
10280 return not Is_Value_Type
(Typ
);
10284 elsif Is_Record_Type
(Typ
) then
10288 Comp
:= First_Entity
(Typ
);
10289 while Present
(Comp
) loop
10290 if Ekind
(Comp
) = E_Component
10291 and then Requires_Transient_Scope
(Etype
(Comp
))
10295 Next_Entity
(Comp
);
10302 -- String literal types never require transient scope
10304 elsif Ekind
(Typ
) = E_String_Literal_Subtype
then
10307 -- Array type. Note that we already know that this is a constrained
10308 -- array, since unconstrained arrays will fail the indefinite test.
10310 elsif Is_Array_Type
(Typ
) then
10312 -- If component type requires a transient scope, the array does too
10314 if Requires_Transient_Scope
(Component_Type
(Typ
)) then
10317 -- Otherwise, we only need a transient scope if the size is not
10318 -- known at compile time.
10321 return not Size_Known_At_Compile_Time
(Typ
);
10324 -- All other cases do not require a transient scope
10329 end Requires_Transient_Scope
;
10331 --------------------------
10332 -- Reset_Analyzed_Flags --
10333 --------------------------
10335 procedure Reset_Analyzed_Flags
(N
: Node_Id
) is
10337 function Clear_Analyzed
(N
: Node_Id
) return Traverse_Result
;
10338 -- Function used to reset Analyzed flags in tree. Note that we do
10339 -- not reset Analyzed flags in entities, since there is no need to
10340 -- reanalyze entities, and indeed, it is wrong to do so, since it
10341 -- can result in generating auxiliary stuff more than once.
10343 --------------------
10344 -- Clear_Analyzed --
10345 --------------------
10347 function Clear_Analyzed
(N
: Node_Id
) return Traverse_Result
is
10349 if not Has_Extension
(N
) then
10350 Set_Analyzed
(N
, False);
10354 end Clear_Analyzed
;
10356 procedure Reset_Analyzed
is new Traverse_Proc
(Clear_Analyzed
);
10358 -- Start of processing for Reset_Analyzed_Flags
10361 Reset_Analyzed
(N
);
10362 end Reset_Analyzed_Flags
;
10364 ---------------------------
10365 -- Safe_To_Capture_Value --
10366 ---------------------------
10368 function Safe_To_Capture_Value
10371 Cond
: Boolean := False) return Boolean
10374 -- The only entities for which we track constant values are variables
10375 -- which are not renamings, constants, out parameters, and in out
10376 -- parameters, so check if we have this case.
10378 -- Note: it may seem odd to track constant values for constants, but in
10379 -- fact this routine is used for other purposes than simply capturing
10380 -- the value. In particular, the setting of Known[_Non]_Null.
10382 if (Ekind
(Ent
) = E_Variable
and then No
(Renamed_Object
(Ent
)))
10384 Ekind
(Ent
) = E_Constant
10386 Ekind
(Ent
) = E_Out_Parameter
10388 Ekind
(Ent
) = E_In_Out_Parameter
10392 -- For conditionals, we also allow loop parameters and all formals,
10393 -- including in parameters.
10397 (Ekind
(Ent
) = E_Loop_Parameter
10399 Ekind
(Ent
) = E_In_Parameter
)
10403 -- For all other cases, not just unsafe, but impossible to capture
10404 -- Current_Value, since the above are the only entities which have
10405 -- Current_Value fields.
10411 -- Skip if volatile or aliased, since funny things might be going on in
10412 -- these cases which we cannot necessarily track. Also skip any variable
10413 -- for which an address clause is given, or whose address is taken. Also
10414 -- never capture value of library level variables (an attempt to do so
10415 -- can occur in the case of package elaboration code).
10417 if Treat_As_Volatile
(Ent
)
10418 or else Is_Aliased
(Ent
)
10419 or else Present
(Address_Clause
(Ent
))
10420 or else Address_Taken
(Ent
)
10421 or else (Is_Library_Level_Entity
(Ent
)
10422 and then Ekind
(Ent
) = E_Variable
)
10427 -- OK, all above conditions are met. We also require that the scope of
10428 -- the reference be the same as the scope of the entity, not counting
10429 -- packages and blocks and loops.
10432 E_Scope
: constant Entity_Id
:= Scope
(Ent
);
10433 R_Scope
: Entity_Id
;
10436 R_Scope
:= Current_Scope
;
10437 while R_Scope
/= Standard_Standard
loop
10438 exit when R_Scope
= E_Scope
;
10440 if not Ekind_In
(R_Scope
, E_Package
, E_Block
, E_Loop
) then
10443 R_Scope
:= Scope
(R_Scope
);
10448 -- We also require that the reference does not appear in a context
10449 -- where it is not sure to be executed (i.e. a conditional context
10450 -- or an exception handler). We skip this if Cond is True, since the
10451 -- capturing of values from conditional tests handles this ok.
10465 while Present
(P
) loop
10466 if Nkind
(P
) = N_If_Statement
10467 or else Nkind
(P
) = N_Case_Statement
10468 or else (Nkind
(P
) in N_Short_Circuit
10469 and then Desc
= Right_Opnd
(P
))
10470 or else (Nkind
(P
) = N_Conditional_Expression
10471 and then Desc
/= First
(Expressions
(P
)))
10472 or else Nkind
(P
) = N_Exception_Handler
10473 or else Nkind
(P
) = N_Selective_Accept
10474 or else Nkind
(P
) = N_Conditional_Entry_Call
10475 or else Nkind
(P
) = N_Timed_Entry_Call
10476 or else Nkind
(P
) = N_Asynchronous_Select
10486 -- OK, looks safe to set value
10489 end Safe_To_Capture_Value
;
10495 function Same_Name
(N1
, N2
: Node_Id
) return Boolean is
10496 K1
: constant Node_Kind
:= Nkind
(N1
);
10497 K2
: constant Node_Kind
:= Nkind
(N2
);
10500 if (K1
= N_Identifier
or else K1
= N_Defining_Identifier
)
10501 and then (K2
= N_Identifier
or else K2
= N_Defining_Identifier
)
10503 return Chars
(N1
) = Chars
(N2
);
10505 elsif (K1
= N_Selected_Component
or else K1
= N_Expanded_Name
)
10506 and then (K2
= N_Selected_Component
or else K2
= N_Expanded_Name
)
10508 return Same_Name
(Selector_Name
(N1
), Selector_Name
(N2
))
10509 and then Same_Name
(Prefix
(N1
), Prefix
(N2
));
10520 function Same_Object
(Node1
, Node2
: Node_Id
) return Boolean is
10521 N1
: constant Node_Id
:= Original_Node
(Node1
);
10522 N2
: constant Node_Id
:= Original_Node
(Node2
);
10523 -- We do the tests on original nodes, since we are most interested
10524 -- in the original source, not any expansion that got in the way.
10526 K1
: constant Node_Kind
:= Nkind
(N1
);
10527 K2
: constant Node_Kind
:= Nkind
(N2
);
10530 -- First case, both are entities with same entity
10532 if K1
in N_Has_Entity
and then K2
in N_Has_Entity
then
10534 EN1
: constant Entity_Id
:= Entity
(N1
);
10535 EN2
: constant Entity_Id
:= Entity
(N2
);
10537 if Present
(EN1
) and then Present
(EN2
)
10538 and then (Ekind_In
(EN1
, E_Variable
, E_Constant
)
10539 or else Is_Formal
(EN1
))
10547 -- Second case, selected component with same selector, same record
10549 if K1
= N_Selected_Component
10550 and then K2
= N_Selected_Component
10551 and then Chars
(Selector_Name
(N1
)) = Chars
(Selector_Name
(N2
))
10553 return Same_Object
(Prefix
(N1
), Prefix
(N2
));
10555 -- Third case, indexed component with same subscripts, same array
10557 elsif K1
= N_Indexed_Component
10558 and then K2
= N_Indexed_Component
10559 and then Same_Object
(Prefix
(N1
), Prefix
(N2
))
10564 E1
:= First
(Expressions
(N1
));
10565 E2
:= First
(Expressions
(N2
));
10566 while Present
(E1
) loop
10567 if not Same_Value
(E1
, E2
) then
10578 -- Fourth case, slice of same array with same bounds
10581 and then K2
= N_Slice
10582 and then Nkind
(Discrete_Range
(N1
)) = N_Range
10583 and then Nkind
(Discrete_Range
(N2
)) = N_Range
10584 and then Same_Value
(Low_Bound
(Discrete_Range
(N1
)),
10585 Low_Bound
(Discrete_Range
(N2
)))
10586 and then Same_Value
(High_Bound
(Discrete_Range
(N1
)),
10587 High_Bound
(Discrete_Range
(N2
)))
10589 return Same_Name
(Prefix
(N1
), Prefix
(N2
));
10591 -- All other cases, not clearly the same object
10602 function Same_Type
(T1
, T2
: Entity_Id
) return Boolean is
10607 elsif not Is_Constrained
(T1
)
10608 and then not Is_Constrained
(T2
)
10609 and then Base_Type
(T1
) = Base_Type
(T2
)
10613 -- For now don't bother with case of identical constraints, to be
10614 -- fiddled with later on perhaps (this is only used for optimization
10615 -- purposes, so it is not critical to do a best possible job)
10626 function Same_Value
(Node1
, Node2
: Node_Id
) return Boolean is
10628 if Compile_Time_Known_Value
(Node1
)
10629 and then Compile_Time_Known_Value
(Node2
)
10630 and then Expr_Value
(Node1
) = Expr_Value
(Node2
)
10633 elsif Same_Object
(Node1
, Node2
) then
10644 procedure Save_Actual
(N
: Node_Id
; Writable
: Boolean := False) is
10646 if Is_Entity_Name
(N
)
10648 Nkind_In
(N
, N_Indexed_Component
, N_Selected_Component
, N_Slice
)
10650 (Nkind
(N
) = N_Attribute_Reference
10651 and then Attribute_Name
(N
) = Name_Access
)
10654 -- We are only interested in IN OUT parameters of inner calls
10657 or else Nkind
(Parent
(N
)) = N_Function_Call
10658 or else Nkind
(Parent
(N
)) in N_Op
10660 Actuals_In_Call
.Increment_Last
;
10661 Actuals_In_Call
.Table
(Actuals_In_Call
.Last
) := (N
, Writable
);
10666 ------------------------
10667 -- Scope_Is_Transient --
10668 ------------------------
10670 function Scope_Is_Transient
return Boolean is
10672 return Scope_Stack
.Table
(Scope_Stack
.Last
).Is_Transient
;
10673 end Scope_Is_Transient
;
10679 function Scope_Within
(Scope1
, Scope2
: Entity_Id
) return Boolean is
10684 while Scop
/= Standard_Standard
loop
10685 Scop
:= Scope
(Scop
);
10687 if Scop
= Scope2
then
10695 --------------------------
10696 -- Scope_Within_Or_Same --
10697 --------------------------
10699 function Scope_Within_Or_Same
(Scope1
, Scope2
: Entity_Id
) return Boolean is
10704 while Scop
/= Standard_Standard
loop
10705 if Scop
= Scope2
then
10708 Scop
:= Scope
(Scop
);
10713 end Scope_Within_Or_Same
;
10715 --------------------
10716 -- Set_Convention --
10717 --------------------
10719 procedure Set_Convention
(E
: Entity_Id
; Val
: Snames
.Convention_Id
) is
10721 Basic_Set_Convention
(E
, Val
);
10724 and then Is_Access_Subprogram_Type
(Base_Type
(E
))
10725 and then Has_Foreign_Convention
(E
)
10727 Set_Can_Use_Internal_Rep
(E
, False);
10729 end Set_Convention
;
10731 ------------------------
10732 -- Set_Current_Entity --
10733 ------------------------
10735 -- The given entity is to be set as the currently visible definition
10736 -- of its associated name (i.e. the Node_Id associated with its name).
10737 -- All we have to do is to get the name from the identifier, and
10738 -- then set the associated Node_Id to point to the given entity.
10740 procedure Set_Current_Entity
(E
: Entity_Id
) is
10742 Set_Name_Entity_Id
(Chars
(E
), E
);
10743 end Set_Current_Entity
;
10745 ---------------------------
10746 -- Set_Debug_Info_Needed --
10747 ---------------------------
10749 procedure Set_Debug_Info_Needed
(T
: Entity_Id
) is
10751 procedure Set_Debug_Info_Needed_If_Not_Set
(E
: Entity_Id
);
10752 pragma Inline
(Set_Debug_Info_Needed_If_Not_Set
);
10753 -- Used to set debug info in a related node if not set already
10755 --------------------------------------
10756 -- Set_Debug_Info_Needed_If_Not_Set --
10757 --------------------------------------
10759 procedure Set_Debug_Info_Needed_If_Not_Set
(E
: Entity_Id
) is
10762 and then not Needs_Debug_Info
(E
)
10764 Set_Debug_Info_Needed
(E
);
10766 -- For a private type, indicate that the full view also needs
10767 -- debug information.
10770 and then Is_Private_Type
(E
)
10771 and then Present
(Full_View
(E
))
10773 Set_Debug_Info_Needed
(Full_View
(E
));
10776 end Set_Debug_Info_Needed_If_Not_Set
;
10778 -- Start of processing for Set_Debug_Info_Needed
10781 -- Nothing to do if argument is Empty or has Debug_Info_Off set, which
10782 -- indicates that Debug_Info_Needed is never required for the entity.
10785 or else Debug_Info_Off
(T
)
10790 -- Set flag in entity itself. Note that we will go through the following
10791 -- circuitry even if the flag is already set on T. That's intentional,
10792 -- it makes sure that the flag will be set in subsidiary entities.
10794 Set_Needs_Debug_Info
(T
);
10796 -- Set flag on subsidiary entities if not set already
10798 if Is_Object
(T
) then
10799 Set_Debug_Info_Needed_If_Not_Set
(Etype
(T
));
10801 elsif Is_Type
(T
) then
10802 Set_Debug_Info_Needed_If_Not_Set
(Etype
(T
));
10804 if Is_Record_Type
(T
) then
10806 Ent
: Entity_Id
:= First_Entity
(T
);
10808 while Present
(Ent
) loop
10809 Set_Debug_Info_Needed_If_Not_Set
(Ent
);
10814 -- For a class wide subtype, we also need debug information
10815 -- for the equivalent type.
10817 if Ekind
(T
) = E_Class_Wide_Subtype
then
10818 Set_Debug_Info_Needed_If_Not_Set
(Equivalent_Type
(T
));
10821 elsif Is_Array_Type
(T
) then
10822 Set_Debug_Info_Needed_If_Not_Set
(Component_Type
(T
));
10825 Indx
: Node_Id
:= First_Index
(T
);
10827 while Present
(Indx
) loop
10828 Set_Debug_Info_Needed_If_Not_Set
(Etype
(Indx
));
10829 Indx
:= Next_Index
(Indx
);
10833 if Is_Packed
(T
) then
10834 Set_Debug_Info_Needed_If_Not_Set
(Packed_Array_Type
(T
));
10837 elsif Is_Access_Type
(T
) then
10838 Set_Debug_Info_Needed_If_Not_Set
(Directly_Designated_Type
(T
));
10840 elsif Is_Private_Type
(T
) then
10841 Set_Debug_Info_Needed_If_Not_Set
(Full_View
(T
));
10843 elsif Is_Protected_Type
(T
) then
10844 Set_Debug_Info_Needed_If_Not_Set
(Corresponding_Record_Type
(T
));
10847 end Set_Debug_Info_Needed
;
10849 ---------------------------------
10850 -- Set_Entity_With_Style_Check --
10851 ---------------------------------
10853 procedure Set_Entity_With_Style_Check
(N
: Node_Id
; Val
: Entity_Id
) is
10854 Val_Actual
: Entity_Id
;
10858 Set_Entity
(N
, Val
);
10861 and then not Suppress_Style_Checks
(Val
)
10862 and then not In_Instance
10864 if Nkind
(N
) = N_Identifier
then
10866 elsif Nkind
(N
) = N_Expanded_Name
then
10867 Nod
:= Selector_Name
(N
);
10872 -- A special situation arises for derived operations, where we want
10873 -- to do the check against the parent (since the Sloc of the derived
10874 -- operation points to the derived type declaration itself).
10877 while not Comes_From_Source
(Val_Actual
)
10878 and then Nkind
(Val_Actual
) in N_Entity
10879 and then (Ekind
(Val_Actual
) = E_Enumeration_Literal
10880 or else Is_Subprogram
(Val_Actual
)
10881 or else Is_Generic_Subprogram
(Val_Actual
))
10882 and then Present
(Alias
(Val_Actual
))
10884 Val_Actual
:= Alias
(Val_Actual
);
10887 -- Renaming declarations for generic actuals do not come from source,
10888 -- and have a different name from that of the entity they rename, so
10889 -- there is no style check to perform here.
10891 if Chars
(Nod
) = Chars
(Val_Actual
) then
10892 Style
.Check_Identifier
(Nod
, Val_Actual
);
10896 Set_Entity
(N
, Val
);
10897 end Set_Entity_With_Style_Check
;
10899 ------------------------
10900 -- Set_Name_Entity_Id --
10901 ------------------------
10903 procedure Set_Name_Entity_Id
(Id
: Name_Id
; Val
: Entity_Id
) is
10905 Set_Name_Table_Info
(Id
, Int
(Val
));
10906 end Set_Name_Entity_Id
;
10908 ---------------------
10909 -- Set_Next_Actual --
10910 ---------------------
10912 procedure Set_Next_Actual
(Ass1_Id
: Node_Id
; Ass2_Id
: Node_Id
) is
10914 if Nkind
(Parent
(Ass1_Id
)) = N_Parameter_Association
then
10915 Set_First_Named_Actual
(Parent
(Ass1_Id
), Ass2_Id
);
10917 end Set_Next_Actual
;
10919 ----------------------------------
10920 -- Set_Optimize_Alignment_Flags --
10921 ----------------------------------
10923 procedure Set_Optimize_Alignment_Flags
(E
: Entity_Id
) is
10925 if Optimize_Alignment
= 'S' then
10926 Set_Optimize_Alignment_Space
(E
);
10927 elsif Optimize_Alignment
= 'T' then
10928 Set_Optimize_Alignment_Time
(E
);
10930 end Set_Optimize_Alignment_Flags
;
10932 -----------------------
10933 -- Set_Public_Status --
10934 -----------------------
10936 procedure Set_Public_Status
(Id
: Entity_Id
) is
10937 S
: constant Entity_Id
:= Current_Scope
;
10939 function Within_HSS_Or_If
(E
: Entity_Id
) return Boolean;
10940 -- Determines if E is defined within handled statement sequence or
10941 -- an if statement, returns True if so, False otherwise.
10943 ----------------------
10944 -- Within_HSS_Or_If --
10945 ----------------------
10947 function Within_HSS_Or_If
(E
: Entity_Id
) return Boolean is
10950 N
:= Declaration_Node
(E
);
10957 elsif Nkind_In
(N
, N_Handled_Sequence_Of_Statements
,
10963 end Within_HSS_Or_If
;
10965 -- Start of processing for Set_Public_Status
10968 -- Everything in the scope of Standard is public
10970 if S
= Standard_Standard
then
10971 Set_Is_Public
(Id
);
10973 -- Entity is definitely not public if enclosing scope is not public
10975 elsif not Is_Public
(S
) then
10978 -- An object or function declaration that occurs in a handled sequence
10979 -- of statements or within an if statement is the declaration for a
10980 -- temporary object or local subprogram generated by the expander. It
10981 -- never needs to be made public and furthermore, making it public can
10982 -- cause back end problems.
10984 elsif Nkind_In
(Parent
(Id
), N_Object_Declaration
,
10985 N_Function_Specification
)
10986 and then Within_HSS_Or_If
(Id
)
10990 -- Entities in public packages or records are public
10992 elsif Ekind
(S
) = E_Package
or Is_Record_Type
(S
) then
10993 Set_Is_Public
(Id
);
10995 -- The bounds of an entry family declaration can generate object
10996 -- declarations that are visible to the back-end, e.g. in the
10997 -- the declaration of a composite type that contains tasks.
10999 elsif Is_Concurrent_Type
(S
)
11000 and then not Has_Completion
(S
)
11001 and then Nkind
(Parent
(Id
)) = N_Object_Declaration
11003 Set_Is_Public
(Id
);
11005 end Set_Public_Status
;
11007 -----------------------------
11008 -- Set_Referenced_Modified --
11009 -----------------------------
11011 procedure Set_Referenced_Modified
(N
: Node_Id
; Out_Param
: Boolean) is
11015 -- Deal with indexed or selected component where prefix is modified
11017 if Nkind_In
(N
, N_Indexed_Component
, N_Selected_Component
) then
11018 Pref
:= Prefix
(N
);
11020 -- If prefix is access type, then it is the designated object that is
11021 -- being modified, which means we have no entity to set the flag on.
11023 if No
(Etype
(Pref
)) or else Is_Access_Type
(Etype
(Pref
)) then
11026 -- Otherwise chase the prefix
11029 Set_Referenced_Modified
(Pref
, Out_Param
);
11032 -- Otherwise see if we have an entity name (only other case to process)
11034 elsif Is_Entity_Name
(N
) and then Present
(Entity
(N
)) then
11035 Set_Referenced_As_LHS
(Entity
(N
), not Out_Param
);
11036 Set_Referenced_As_Out_Parameter
(Entity
(N
), Out_Param
);
11038 end Set_Referenced_Modified
;
11040 ----------------------------
11041 -- Set_Scope_Is_Transient --
11042 ----------------------------
11044 procedure Set_Scope_Is_Transient
(V
: Boolean := True) is
11046 Scope_Stack
.Table
(Scope_Stack
.Last
).Is_Transient
:= V
;
11047 end Set_Scope_Is_Transient
;
11049 -------------------
11050 -- Set_Size_Info --
11051 -------------------
11053 procedure Set_Size_Info
(T1
, T2
: Entity_Id
) is
11055 -- We copy Esize, but not RM_Size, since in general RM_Size is
11056 -- subtype specific and does not get inherited by all subtypes.
11058 Set_Esize
(T1
, Esize
(T2
));
11059 Set_Has_Biased_Representation
(T1
, Has_Biased_Representation
(T2
));
11061 if Is_Discrete_Or_Fixed_Point_Type
(T1
)
11063 Is_Discrete_Or_Fixed_Point_Type
(T2
)
11065 Set_Is_Unsigned_Type
(T1
, Is_Unsigned_Type
(T2
));
11068 Set_Alignment
(T1
, Alignment
(T2
));
11071 --------------------
11072 -- Static_Integer --
11073 --------------------
11075 function Static_Integer
(N
: Node_Id
) return Uint
is
11077 Analyze_And_Resolve
(N
, Any_Integer
);
11080 or else Error_Posted
(N
)
11081 or else Etype
(N
) = Any_Type
11086 if Is_Static_Expression
(N
) then
11087 if not Raises_Constraint_Error
(N
) then
11088 return Expr_Value
(N
);
11093 elsif Etype
(N
) = Any_Type
then
11097 Flag_Non_Static_Expr
11098 ("static integer expression required here", N
);
11101 end Static_Integer
;
11103 --------------------------
11104 -- Statically_Different --
11105 --------------------------
11107 function Statically_Different
(E1
, E2
: Node_Id
) return Boolean is
11108 R1
: constant Node_Id
:= Get_Referenced_Object
(E1
);
11109 R2
: constant Node_Id
:= Get_Referenced_Object
(E2
);
11111 return Is_Entity_Name
(R1
)
11112 and then Is_Entity_Name
(R2
)
11113 and then Entity
(R1
) /= Entity
(R2
)
11114 and then not Is_Formal
(Entity
(R1
))
11115 and then not Is_Formal
(Entity
(R2
));
11116 end Statically_Different
;
11118 -----------------------------
11119 -- Subprogram_Access_Level --
11120 -----------------------------
11122 function Subprogram_Access_Level
(Subp
: Entity_Id
) return Uint
is
11124 if Present
(Alias
(Subp
)) then
11125 return Subprogram_Access_Level
(Alias
(Subp
));
11127 return Scope_Depth
(Enclosing_Dynamic_Scope
(Subp
));
11129 end Subprogram_Access_Level
;
11135 procedure Trace_Scope
(N
: Node_Id
; E
: Entity_Id
; Msg
: String) is
11137 if Debug_Flag_W
then
11138 for J
in 0 .. Scope_Stack
.Last
loop
11143 Write_Name
(Chars
(E
));
11144 Write_Str
(" from ");
11145 Write_Location
(Sloc
(N
));
11150 -----------------------
11151 -- Transfer_Entities --
11152 -----------------------
11154 procedure Transfer_Entities
(From
: Entity_Id
; To
: Entity_Id
) is
11155 Ent
: Entity_Id
:= First_Entity
(From
);
11162 if (Last_Entity
(To
)) = Empty
then
11163 Set_First_Entity
(To
, Ent
);
11165 Set_Next_Entity
(Last_Entity
(To
), Ent
);
11168 Set_Last_Entity
(To
, Last_Entity
(From
));
11170 while Present
(Ent
) loop
11171 Set_Scope
(Ent
, To
);
11173 if not Is_Public
(Ent
) then
11174 Set_Public_Status
(Ent
);
11177 and then Ekind
(Ent
) = E_Record_Subtype
11180 -- The components of the propagated Itype must be public
11186 Comp
:= First_Entity
(Ent
);
11187 while Present
(Comp
) loop
11188 Set_Is_Public
(Comp
);
11189 Next_Entity
(Comp
);
11198 Set_First_Entity
(From
, Empty
);
11199 Set_Last_Entity
(From
, Empty
);
11200 end Transfer_Entities
;
11202 -----------------------
11203 -- Type_Access_Level --
11204 -----------------------
11206 function Type_Access_Level
(Typ
: Entity_Id
) return Uint
is
11210 Btyp
:= Base_Type
(Typ
);
11212 -- Ada 2005 (AI-230): For most cases of anonymous access types, we
11213 -- simply use the level where the type is declared. This is true for
11214 -- stand-alone object declarations, and for anonymous access types
11215 -- associated with components the level is the same as that of the
11216 -- enclosing composite type. However, special treatment is needed for
11217 -- the cases of access parameters, return objects of an anonymous access
11218 -- type, and, in Ada 95, access discriminants of limited types.
11220 if Ekind
(Btyp
) in Access_Kind
then
11221 if Ekind
(Btyp
) = E_Anonymous_Access_Type
then
11223 -- If the type is a nonlocal anonymous access type (such as for
11224 -- an access parameter) we treat it as being declared at the
11225 -- library level to ensure that names such as X.all'access don't
11226 -- fail static accessibility checks.
11228 if not Is_Local_Anonymous_Access
(Typ
) then
11229 return Scope_Depth
(Standard_Standard
);
11231 -- If this is a return object, the accessibility level is that of
11232 -- the result subtype of the enclosing function. The test here is
11233 -- little complicated, because we have to account for extended
11234 -- return statements that have been rewritten as blocks, in which
11235 -- case we have to find and the Is_Return_Object attribute of the
11236 -- itype's associated object. It would be nice to find a way to
11237 -- simplify this test, but it doesn't seem worthwhile to add a new
11238 -- flag just for purposes of this test. ???
11240 elsif Ekind
(Scope
(Btyp
)) = E_Return_Statement
11243 and then Nkind
(Associated_Node_For_Itype
(Btyp
)) =
11244 N_Object_Declaration
11245 and then Is_Return_Object
11246 (Defining_Identifier
11247 (Associated_Node_For_Itype
(Btyp
))))
11253 Scop
:= Scope
(Scope
(Btyp
));
11254 while Present
(Scop
) loop
11255 exit when Ekind
(Scop
) = E_Function
;
11256 Scop
:= Scope
(Scop
);
11259 -- Treat the return object's type as having the level of the
11260 -- function's result subtype (as per RM05-6.5(5.3/2)).
11262 return Type_Access_Level
(Etype
(Scop
));
11267 Btyp
:= Root_Type
(Btyp
);
11269 -- The accessibility level of anonymous access types associated with
11270 -- discriminants is that of the current instance of the type, and
11271 -- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
11273 -- AI-402: access discriminants have accessibility based on the
11274 -- object rather than the type in Ada 2005, so the above paragraph
11277 -- ??? Needs completion with rules from AI-416
11279 if Ada_Version
<= Ada_95
11280 and then Ekind
(Typ
) = E_Anonymous_Access_Type
11281 and then Present
(Associated_Node_For_Itype
(Typ
))
11282 and then Nkind
(Associated_Node_For_Itype
(Typ
)) =
11283 N_Discriminant_Specification
11285 return Scope_Depth
(Enclosing_Dynamic_Scope
(Btyp
)) + 1;
11289 return Scope_Depth
(Enclosing_Dynamic_Scope
(Btyp
));
11290 end Type_Access_Level
;
11292 --------------------------
11293 -- Unit_Declaration_Node --
11294 --------------------------
11296 function Unit_Declaration_Node
(Unit_Id
: Entity_Id
) return Node_Id
is
11297 N
: Node_Id
:= Parent
(Unit_Id
);
11300 -- Predefined operators do not have a full function declaration
11302 if Ekind
(Unit_Id
) = E_Operator
then
11306 -- Isn't there some better way to express the following ???
11308 while Nkind
(N
) /= N_Abstract_Subprogram_Declaration
11309 and then Nkind
(N
) /= N_Formal_Package_Declaration
11310 and then Nkind
(N
) /= N_Function_Instantiation
11311 and then Nkind
(N
) /= N_Generic_Package_Declaration
11312 and then Nkind
(N
) /= N_Generic_Subprogram_Declaration
11313 and then Nkind
(N
) /= N_Package_Declaration
11314 and then Nkind
(N
) /= N_Package_Body
11315 and then Nkind
(N
) /= N_Package_Instantiation
11316 and then Nkind
(N
) /= N_Package_Renaming_Declaration
11317 and then Nkind
(N
) /= N_Procedure_Instantiation
11318 and then Nkind
(N
) /= N_Protected_Body
11319 and then Nkind
(N
) /= N_Subprogram_Declaration
11320 and then Nkind
(N
) /= N_Subprogram_Body
11321 and then Nkind
(N
) /= N_Subprogram_Body_Stub
11322 and then Nkind
(N
) /= N_Subprogram_Renaming_Declaration
11323 and then Nkind
(N
) /= N_Task_Body
11324 and then Nkind
(N
) /= N_Task_Type_Declaration
11325 and then Nkind
(N
) not in N_Formal_Subprogram_Declaration
11326 and then Nkind
(N
) not in N_Generic_Renaming_Declaration
11329 pragma Assert
(Present
(N
));
11333 end Unit_Declaration_Node
;
11335 ------------------------------
11336 -- Universal_Interpretation --
11337 ------------------------------
11339 function Universal_Interpretation
(Opnd
: Node_Id
) return Entity_Id
is
11340 Index
: Interp_Index
;
11344 -- The argument may be a formal parameter of an operator or subprogram
11345 -- with multiple interpretations, or else an expression for an actual.
11347 if Nkind
(Opnd
) = N_Defining_Identifier
11348 or else not Is_Overloaded
(Opnd
)
11350 if Etype
(Opnd
) = Universal_Integer
11351 or else Etype
(Opnd
) = Universal_Real
11353 return Etype
(Opnd
);
11359 Get_First_Interp
(Opnd
, Index
, It
);
11360 while Present
(It
.Typ
) loop
11361 if It
.Typ
= Universal_Integer
11362 or else It
.Typ
= Universal_Real
11367 Get_Next_Interp
(Index
, It
);
11372 end Universal_Interpretation
;
11378 function Unqualify
(Expr
: Node_Id
) return Node_Id
is
11380 -- Recurse to handle unlikely case of multiple levels of qualification
11382 if Nkind
(Expr
) = N_Qualified_Expression
then
11383 return Unqualify
(Expression
(Expr
));
11385 -- Normal case, not a qualified expression
11392 ----------------------
11393 -- Within_Init_Proc --
11394 ----------------------
11396 function Within_Init_Proc
return Boolean is
11400 S
:= Current_Scope
;
11401 while not Is_Overloadable
(S
) loop
11402 if S
= Standard_Standard
then
11409 return Is_Init_Proc
(S
);
11410 end Within_Init_Proc
;
11416 procedure Wrong_Type
(Expr
: Node_Id
; Expected_Type
: Entity_Id
) is
11417 Found_Type
: constant Entity_Id
:= First_Subtype
(Etype
(Expr
));
11418 Expec_Type
: constant Entity_Id
:= First_Subtype
(Expected_Type
);
11420 function Has_One_Matching_Field
return Boolean;
11421 -- Determines if Expec_Type is a record type with a single component or
11422 -- discriminant whose type matches the found type or is one dimensional
11423 -- array whose component type matches the found type.
11425 ----------------------------
11426 -- Has_One_Matching_Field --
11427 ----------------------------
11429 function Has_One_Matching_Field
return Boolean is
11433 if Is_Array_Type
(Expec_Type
)
11434 and then Number_Dimensions
(Expec_Type
) = 1
11436 Covers
(Etype
(Component_Type
(Expec_Type
)), Found_Type
)
11440 elsif not Is_Record_Type
(Expec_Type
) then
11444 E
:= First_Entity
(Expec_Type
);
11449 elsif (Ekind
(E
) /= E_Discriminant
11450 and then Ekind
(E
) /= E_Component
)
11451 or else (Chars
(E
) = Name_uTag
11452 or else Chars
(E
) = Name_uParent
)
11461 if not Covers
(Etype
(E
), Found_Type
) then
11464 elsif Present
(Next_Entity
(E
)) then
11471 end Has_One_Matching_Field
;
11473 -- Start of processing for Wrong_Type
11476 -- Don't output message if either type is Any_Type, or if a message
11477 -- has already been posted for this node. We need to do the latter
11478 -- check explicitly (it is ordinarily done in Errout), because we
11479 -- are using ! to force the output of the error messages.
11481 if Expec_Type
= Any_Type
11482 or else Found_Type
= Any_Type
11483 or else Error_Posted
(Expr
)
11487 -- In an instance, there is an ongoing problem with completion of
11488 -- type derived from private types. Their structure is what Gigi
11489 -- expects, but the Etype is the parent type rather than the
11490 -- derived private type itself. Do not flag error in this case. The
11491 -- private completion is an entity without a parent, like an Itype.
11492 -- Similarly, full and partial views may be incorrect in the instance.
11493 -- There is no simple way to insure that it is consistent ???
11495 elsif In_Instance
then
11496 if Etype
(Etype
(Expr
)) = Etype
(Expected_Type
)
11498 (Has_Private_Declaration
(Expected_Type
)
11499 or else Has_Private_Declaration
(Etype
(Expr
)))
11500 and then No
(Parent
(Expected_Type
))
11506 -- An interesting special check. If the expression is parenthesized
11507 -- and its type corresponds to the type of the sole component of the
11508 -- expected record type, or to the component type of the expected one
11509 -- dimensional array type, then assume we have a bad aggregate attempt.
11511 if Nkind
(Expr
) in N_Subexpr
11512 and then Paren_Count
(Expr
) /= 0
11513 and then Has_One_Matching_Field
11515 Error_Msg_N
("positional aggregate cannot have one component", Expr
);
11517 -- Another special check, if we are looking for a pool-specific access
11518 -- type and we found an E_Access_Attribute_Type, then we have the case
11519 -- of an Access attribute being used in a context which needs a pool-
11520 -- specific type, which is never allowed. The one extra check we make
11521 -- is that the expected designated type covers the Found_Type.
11523 elsif Is_Access_Type
(Expec_Type
)
11524 and then Ekind
(Found_Type
) = E_Access_Attribute_Type
11525 and then Ekind
(Base_Type
(Expec_Type
)) /= E_General_Access_Type
11526 and then Ekind
(Base_Type
(Expec_Type
)) /= E_Anonymous_Access_Type
11528 (Designated_Type
(Expec_Type
), Designated_Type
(Found_Type
))
11530 Error_Msg_N
-- CODEFIX
11531 ("result must be general access type!", Expr
);
11532 Error_Msg_NE
-- CODEFIX
11533 ("add ALL to }!", Expr
, Expec_Type
);
11535 -- Another special check, if the expected type is an integer type,
11536 -- but the expression is of type System.Address, and the parent is
11537 -- an addition or subtraction operation whose left operand is the
11538 -- expression in question and whose right operand is of an integral
11539 -- type, then this is an attempt at address arithmetic, so give
11540 -- appropriate message.
11542 elsif Is_Integer_Type
(Expec_Type
)
11543 and then Is_RTE
(Found_Type
, RE_Address
)
11544 and then (Nkind
(Parent
(Expr
)) = N_Op_Add
11546 Nkind
(Parent
(Expr
)) = N_Op_Subtract
)
11547 and then Expr
= Left_Opnd
(Parent
(Expr
))
11548 and then Is_Integer_Type
(Etype
(Right_Opnd
(Parent
(Expr
))))
11551 ("address arithmetic not predefined in package System",
11554 ("\possible missing with/use of System.Storage_Elements",
11558 -- If the expected type is an anonymous access type, as for access
11559 -- parameters and discriminants, the error is on the designated types.
11561 elsif Ekind
(Expec_Type
) = E_Anonymous_Access_Type
then
11562 if Comes_From_Source
(Expec_Type
) then
11563 Error_Msg_NE
("expected}!", Expr
, Expec_Type
);
11566 ("expected an access type with designated}",
11567 Expr
, Designated_Type
(Expec_Type
));
11570 if Is_Access_Type
(Found_Type
)
11571 and then not Comes_From_Source
(Found_Type
)
11574 ("\\found an access type with designated}!",
11575 Expr
, Designated_Type
(Found_Type
));
11577 if From_With_Type
(Found_Type
) then
11578 Error_Msg_NE
("\\found incomplete}!", Expr
, Found_Type
);
11579 Error_Msg_Qual_Level
:= 99;
11580 Error_Msg_NE
-- CODEFIX
11581 ("\\missing `WITH &;", Expr
, Scope
(Found_Type
));
11582 Error_Msg_Qual_Level
:= 0;
11584 Error_Msg_NE
("found}!", Expr
, Found_Type
);
11588 -- Normal case of one type found, some other type expected
11591 -- If the names of the two types are the same, see if some number
11592 -- of levels of qualification will help. Don't try more than three
11593 -- levels, and if we get to standard, it's no use (and probably
11594 -- represents an error in the compiler) Also do not bother with
11595 -- internal scope names.
11598 Expec_Scope
: Entity_Id
;
11599 Found_Scope
: Entity_Id
;
11602 Expec_Scope
:= Expec_Type
;
11603 Found_Scope
:= Found_Type
;
11605 for Levels
in Int
range 0 .. 3 loop
11606 if Chars
(Expec_Scope
) /= Chars
(Found_Scope
) then
11607 Error_Msg_Qual_Level
:= Levels
;
11611 Expec_Scope
:= Scope
(Expec_Scope
);
11612 Found_Scope
:= Scope
(Found_Scope
);
11614 exit when Expec_Scope
= Standard_Standard
11615 or else Found_Scope
= Standard_Standard
11616 or else not Comes_From_Source
(Expec_Scope
)
11617 or else not Comes_From_Source
(Found_Scope
);
11621 if Is_Record_Type
(Expec_Type
)
11622 and then Present
(Corresponding_Remote_Type
(Expec_Type
))
11624 Error_Msg_NE
("expected}!", Expr
,
11625 Corresponding_Remote_Type
(Expec_Type
));
11627 Error_Msg_NE
("expected}!", Expr
, Expec_Type
);
11630 if Is_Entity_Name
(Expr
)
11631 and then Is_Package_Or_Generic_Package
(Entity
(Expr
))
11633 Error_Msg_N
("\\found package name!", Expr
);
11635 elsif Is_Entity_Name
(Expr
)
11637 (Ekind
(Entity
(Expr
)) = E_Procedure
11639 Ekind
(Entity
(Expr
)) = E_Generic_Procedure
)
11641 if Ekind
(Expec_Type
) = E_Access_Subprogram_Type
then
11643 ("found procedure name, possibly missing Access attribute!",
11647 ("\\found procedure name instead of function!", Expr
);
11650 elsif Nkind
(Expr
) = N_Function_Call
11651 and then Ekind
(Expec_Type
) = E_Access_Subprogram_Type
11652 and then Etype
(Designated_Type
(Expec_Type
)) = Etype
(Expr
)
11653 and then No
(Parameter_Associations
(Expr
))
11656 ("found function name, possibly missing Access attribute!",
11659 -- Catch common error: a prefix or infix operator which is not
11660 -- directly visible because the type isn't.
11662 elsif Nkind
(Expr
) in N_Op
11663 and then Is_Overloaded
(Expr
)
11664 and then not Is_Immediately_Visible
(Expec_Type
)
11665 and then not Is_Potentially_Use_Visible
(Expec_Type
)
11666 and then not In_Use
(Expec_Type
)
11667 and then Has_Compatible_Type
(Right_Opnd
(Expr
), Expec_Type
)
11670 ("operator of the type is not directly visible!", Expr
);
11672 elsif Ekind
(Found_Type
) = E_Void
11673 and then Present
(Parent
(Found_Type
))
11674 and then Nkind
(Parent
(Found_Type
)) = N_Full_Type_Declaration
11676 Error_Msg_NE
("\\found premature usage of}!", Expr
, Found_Type
);
11679 Error_Msg_NE
("\\found}!", Expr
, Found_Type
);
11682 -- A special check for cases like M1 and M2 = 0 where M1 and M2 are
11683 -- of the same modular type, and (M1 and M2) = 0 was intended.
11685 if Expec_Type
= Standard_Boolean
11686 and then Is_Modular_Integer_Type
(Found_Type
)
11687 and then Nkind_In
(Parent
(Expr
), N_Op_And
, N_Op_Or
, N_Op_Xor
)
11688 and then Nkind
(Right_Opnd
(Parent
(Expr
))) in N_Op_Compare
11691 Op
: constant Node_Id
:= Right_Opnd
(Parent
(Expr
));
11692 L
: constant Node_Id
:= Left_Opnd
(Op
);
11693 R
: constant Node_Id
:= Right_Opnd
(Op
);
11695 -- The case for the message is when the left operand of the
11696 -- comparison is the same modular type, or when it is an
11697 -- integer literal (or other universal integer expression),
11698 -- which would have been typed as the modular type if the
11699 -- parens had been there.
11701 if (Etype
(L
) = Found_Type
11703 Etype
(L
) = Universal_Integer
)
11704 and then Is_Integer_Type
(Etype
(R
))
11707 ("\\possible missing parens for modular operation", Expr
);
11712 -- Reset error message qualification indication
11714 Error_Msg_Qual_Level
:= 0;