1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2015, 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 Treepr
; -- ???For debugging code below
28 with Aspects
; use Aspects
;
29 with Atree
; use Atree
;
30 with Casing
; use Casing
;
31 with Checks
; use Checks
;
32 with Debug
; use Debug
;
33 with Elists
; use Elists
;
34 with Errout
; use Errout
;
35 with Exp_Ch11
; use Exp_Ch11
;
36 with Exp_Disp
; use Exp_Disp
;
37 with Exp_Util
; use Exp_Util
;
38 with Fname
; use Fname
;
39 with Freeze
; use Freeze
;
40 with Ghost
; use Ghost
;
42 with Lib
.Xref
; use Lib
.Xref
;
43 with Namet
.Sp
; use Namet
.Sp
;
44 with Nlists
; use Nlists
;
45 with Nmake
; use Nmake
;
46 with Output
; use Output
;
47 with Restrict
; use Restrict
;
48 with Rident
; use Rident
;
49 with Rtsfind
; use Rtsfind
;
51 with Sem_Aux
; use Sem_Aux
;
52 with Sem_Attr
; use Sem_Attr
;
53 with Sem_Ch6
; use Sem_Ch6
;
54 with Sem_Ch8
; use Sem_Ch8
;
55 with Sem_Ch13
; use Sem_Ch13
;
56 with Sem_Disp
; use Sem_Disp
;
57 with Sem_Eval
; use Sem_Eval
;
58 with Sem_Prag
; use Sem_Prag
;
59 with Sem_Res
; use Sem_Res
;
60 with Sem_Warn
; use Sem_Warn
;
61 with Sem_Type
; use Sem_Type
;
62 with Sinfo
; use Sinfo
;
63 with Sinput
; use Sinput
;
64 with Stand
; use Stand
;
66 with Stringt
; use Stringt
;
67 with Targparm
; use Targparm
;
68 with Tbuild
; use Tbuild
;
69 with Ttypes
; use Ttypes
;
70 with Uname
; use Uname
;
72 with GNAT
.HTable
; use GNAT
.HTable
;
74 package body Sem_Util
is
76 ----------------------------------------
77 -- Global Variables for New_Copy_Tree --
78 ----------------------------------------
80 -- These global variables are used by New_Copy_Tree. See description of the
81 -- body of this subprogram for details. Global variables can be safely used
82 -- by New_Copy_Tree, since there is no case of a recursive call from the
83 -- processing inside New_Copy_Tree.
85 NCT_Hash_Threshold
: constant := 20;
86 -- If there are more than this number of pairs of entries in the map, then
87 -- Hash_Tables_Used will be set, and the hash tables will be initialized
88 -- and used for the searches.
90 NCT_Hash_Tables_Used
: Boolean := False;
91 -- Set to True if hash tables are in use
93 NCT_Table_Entries
: Nat
:= 0;
94 -- Count entries in table to see if threshold is reached
96 NCT_Hash_Table_Setup
: Boolean := False;
97 -- Set to True if hash table contains data. We set this True if we setup
98 -- the hash table with data, and leave it set permanently from then on,
99 -- this is a signal that second and subsequent users of the hash table
100 -- must clear the old entries before reuse.
102 subtype NCT_Header_Num
is Int
range 0 .. 511;
103 -- Defines range of headers in hash tables (512 headers)
105 -----------------------
106 -- Local Subprograms --
107 -----------------------
109 function Build_Component_Subtype
112 T
: Entity_Id
) return Node_Id
;
113 -- This function builds the subtype for Build_Actual_Subtype_Of_Component
114 -- and Build_Discriminal_Subtype_Of_Component. C is a list of constraints,
115 -- Loc is the source location, T is the original subtype.
117 function Has_Enabled_Property
118 (Item_Id
: Entity_Id
;
119 Property
: Name_Id
) return Boolean;
120 -- Subsidiary to routines Async_xxx_Enabled and Effective_xxx_Enabled.
121 -- Determine whether an abstract state or a variable denoted by entity
122 -- Item_Id has enabled property Property.
124 function Has_Null_Extension
(T
: Entity_Id
) return Boolean;
125 -- T is a derived tagged type. Check whether the type extension is null.
126 -- If the parent type is fully initialized, T can be treated as such.
128 function Is_Fully_Initialized_Variant
(Typ
: Entity_Id
) return Boolean;
129 -- Subsidiary to Is_Fully_Initialized_Type. For an unconstrained type
130 -- with discriminants whose default values are static, examine only the
131 -- components in the selected variant to determine whether all of them
134 ------------------------------
135 -- Abstract_Interface_List --
136 ------------------------------
138 function Abstract_Interface_List
(Typ
: Entity_Id
) return List_Id
is
142 if Is_Concurrent_Type
(Typ
) then
144 -- If we are dealing with a synchronized subtype, go to the base
145 -- type, whose declaration has the interface list.
147 -- Shouldn't this be Declaration_Node???
149 Nod
:= Parent
(Base_Type
(Typ
));
151 if Nkind
(Nod
) = N_Full_Type_Declaration
then
155 elsif Ekind
(Typ
) = E_Record_Type_With_Private
then
156 if Nkind
(Parent
(Typ
)) = N_Full_Type_Declaration
then
157 Nod
:= Type_Definition
(Parent
(Typ
));
159 elsif Nkind
(Parent
(Typ
)) = N_Private_Type_Declaration
then
160 if Present
(Full_View
(Typ
))
162 Nkind
(Parent
(Full_View
(Typ
))) = N_Full_Type_Declaration
164 Nod
:= Type_Definition
(Parent
(Full_View
(Typ
)));
166 -- If the full-view is not available we cannot do anything else
167 -- here (the source has errors).
173 -- Support for generic formals with interfaces is still missing ???
175 elsif Nkind
(Parent
(Typ
)) = N_Formal_Type_Declaration
then
180 (Nkind
(Parent
(Typ
)) = N_Private_Extension_Declaration
);
184 elsif Ekind
(Typ
) = E_Record_Subtype
then
185 Nod
:= Type_Definition
(Parent
(Etype
(Typ
)));
187 elsif Ekind
(Typ
) = E_Record_Subtype_With_Private
then
189 -- Recurse, because parent may still be a private extension. Also
190 -- note that the full view of the subtype or the full view of its
191 -- base type may (both) be unavailable.
193 return Abstract_Interface_List
(Etype
(Typ
));
195 else pragma Assert
((Ekind
(Typ
)) = E_Record_Type
);
196 if Nkind
(Parent
(Typ
)) = N_Formal_Type_Declaration
then
197 Nod
:= Formal_Type_Definition
(Parent
(Typ
));
199 Nod
:= Type_Definition
(Parent
(Typ
));
203 return Interface_List
(Nod
);
204 end Abstract_Interface_List
;
206 --------------------------------
207 -- Add_Access_Type_To_Process --
208 --------------------------------
210 procedure Add_Access_Type_To_Process
(E
: Entity_Id
; A
: Entity_Id
) is
214 Ensure_Freeze_Node
(E
);
215 L
:= Access_Types_To_Process
(Freeze_Node
(E
));
219 Set_Access_Types_To_Process
(Freeze_Node
(E
), L
);
223 end Add_Access_Type_To_Process
;
225 --------------------------
226 -- Add_Block_Identifier --
227 --------------------------
229 procedure Add_Block_Identifier
(N
: Node_Id
; Id
: out Entity_Id
) is
230 Loc
: constant Source_Ptr
:= Sloc
(N
);
233 pragma Assert
(Nkind
(N
) = N_Block_Statement
);
235 -- The block already has a label, return its entity
237 if Present
(Identifier
(N
)) then
238 Id
:= Entity
(Identifier
(N
));
240 -- Create a new block label and set its attributes
243 Id
:= New_Internal_Entity
(E_Block
, Current_Scope
, Loc
, 'B');
244 Set_Etype
(Id
, Standard_Void_Type
);
247 Set_Identifier
(N
, New_Occurrence_Of
(Id
, Loc
));
248 Set_Block_Node
(Id
, Identifier
(N
));
250 end Add_Block_Identifier
;
252 ----------------------------
253 -- Add_Global_Declaration --
254 ----------------------------
256 procedure Add_Global_Declaration
(N
: Node_Id
) is
257 Aux_Node
: constant Node_Id
:= Aux_Decls_Node
(Cunit
(Current_Sem_Unit
));
260 if No
(Declarations
(Aux_Node
)) then
261 Set_Declarations
(Aux_Node
, New_List
);
264 Append_To
(Declarations
(Aux_Node
), N
);
266 end Add_Global_Declaration
;
268 --------------------------------
269 -- Address_Integer_Convert_OK --
270 --------------------------------
272 function Address_Integer_Convert_OK
(T1
, T2
: Entity_Id
) return Boolean is
274 if Allow_Integer_Address
275 and then ((Is_Descendent_Of_Address
(T1
)
276 and then Is_Private_Type
(T1
)
277 and then Is_Integer_Type
(T2
))
279 (Is_Descendent_Of_Address
(T2
)
280 and then Is_Private_Type
(T2
)
281 and then Is_Integer_Type
(T1
)))
287 end Address_Integer_Convert_OK
;
293 -- For now, just 8/16/32/64. but analyze later if AAMP is special???
295 function Addressable
(V
: Uint
) return Boolean is
297 return V
= Uint_8
or else
303 function Addressable
(V
: Int
) return Boolean is
311 ---------------------------------
312 -- Aggregate_Constraint_Checks --
313 ---------------------------------
315 procedure Aggregate_Constraint_Checks
317 Check_Typ
: Entity_Id
)
319 Exp_Typ
: constant Entity_Id
:= Etype
(Exp
);
322 if Raises_Constraint_Error
(Exp
) then
326 -- Ada 2005 (AI-230): Generate a conversion to an anonymous access
327 -- component's type to force the appropriate accessibility checks.
329 -- Ada 2005 (AI-231): Generate conversion to the null-excluding
330 -- type to force the corresponding run-time check
332 if Is_Access_Type
(Check_Typ
)
333 and then ((Is_Local_Anonymous_Access
(Check_Typ
))
334 or else (Can_Never_Be_Null
(Check_Typ
)
335 and then not Can_Never_Be_Null
(Exp_Typ
)))
337 Rewrite
(Exp
, Convert_To
(Check_Typ
, Relocate_Node
(Exp
)));
338 Analyze_And_Resolve
(Exp
, Check_Typ
);
339 Check_Unset_Reference
(Exp
);
342 -- This is really expansion activity, so make sure that expansion is
343 -- on and is allowed. In GNATprove mode, we also want check flags to
344 -- be added in the tree, so that the formal verification can rely on
345 -- those to be present. In GNATprove mode for formal verification, some
346 -- treatment typically only done during expansion needs to be performed
347 -- on the tree, but it should not be applied inside generics. Otherwise,
348 -- this breaks the name resolution mechanism for generic instances.
350 if not Expander_Active
351 and (Inside_A_Generic
or not Full_Analysis
or not GNATprove_Mode
)
356 -- First check if we have to insert discriminant checks
358 if Has_Discriminants
(Exp_Typ
) then
359 Apply_Discriminant_Check
(Exp
, Check_Typ
);
361 -- Next emit length checks for array aggregates
363 elsif Is_Array_Type
(Exp_Typ
) then
364 Apply_Length_Check
(Exp
, Check_Typ
);
366 -- Finally emit scalar and string checks. If we are dealing with a
367 -- scalar literal we need to check by hand because the Etype of
368 -- literals is not necessarily correct.
370 elsif Is_Scalar_Type
(Exp_Typ
)
371 and then Compile_Time_Known_Value
(Exp
)
373 if Is_Out_Of_Range
(Exp
, Base_Type
(Check_Typ
)) then
374 Apply_Compile_Time_Constraint_Error
375 (Exp
, "value not in range of}??", CE_Range_Check_Failed
,
376 Ent
=> Base_Type
(Check_Typ
),
377 Typ
=> Base_Type
(Check_Typ
));
379 elsif Is_Out_Of_Range
(Exp
, Check_Typ
) then
380 Apply_Compile_Time_Constraint_Error
381 (Exp
, "value not in range of}??", CE_Range_Check_Failed
,
385 elsif not Range_Checks_Suppressed
(Check_Typ
) then
386 Apply_Scalar_Range_Check
(Exp
, Check_Typ
);
389 -- Verify that target type is also scalar, to prevent view anomalies
390 -- in instantiations.
392 elsif (Is_Scalar_Type
(Exp_Typ
)
393 or else Nkind
(Exp
) = N_String_Literal
)
394 and then Is_Scalar_Type
(Check_Typ
)
395 and then Exp_Typ
/= Check_Typ
397 if Is_Entity_Name
(Exp
)
398 and then Ekind
(Entity
(Exp
)) = E_Constant
400 -- If expression is a constant, it is worthwhile checking whether
401 -- it is a bound of the type.
403 if (Is_Entity_Name
(Type_Low_Bound
(Check_Typ
))
404 and then Entity
(Exp
) = Entity
(Type_Low_Bound
(Check_Typ
)))
406 (Is_Entity_Name
(Type_High_Bound
(Check_Typ
))
407 and then Entity
(Exp
) = Entity
(Type_High_Bound
(Check_Typ
)))
412 Rewrite
(Exp
, Convert_To
(Check_Typ
, Relocate_Node
(Exp
)));
413 Analyze_And_Resolve
(Exp
, Check_Typ
);
414 Check_Unset_Reference
(Exp
);
417 -- Could use a comment on this case ???
420 Rewrite
(Exp
, Convert_To
(Check_Typ
, Relocate_Node
(Exp
)));
421 Analyze_And_Resolve
(Exp
, Check_Typ
);
422 Check_Unset_Reference
(Exp
);
426 end Aggregate_Constraint_Checks
;
428 -----------------------
429 -- Alignment_In_Bits --
430 -----------------------
432 function Alignment_In_Bits
(E
: Entity_Id
) return Uint
is
434 return Alignment
(E
) * System_Storage_Unit
;
435 end Alignment_In_Bits
;
437 --------------------------------------
438 -- All_Composite_Constraints_Static --
439 --------------------------------------
441 function All_Composite_Constraints_Static
442 (Constr
: Node_Id
) return Boolean
445 if No
(Constr
) or else Error_Posted
(Constr
) then
449 case Nkind
(Constr
) is
451 if Nkind
(Constr
) in N_Has_Entity
452 and then Present
(Entity
(Constr
))
454 if Is_Type
(Entity
(Constr
)) then
456 not Is_Discrete_Type
(Entity
(Constr
))
457 or else Is_OK_Static_Subtype
(Entity
(Constr
));
460 elsif Nkind
(Constr
) = N_Range
then
462 Is_OK_Static_Expression
(Low_Bound
(Constr
))
464 Is_OK_Static_Expression
(High_Bound
(Constr
));
466 elsif Nkind
(Constr
) = N_Attribute_Reference
467 and then Attribute_Name
(Constr
) = Name_Range
470 Is_OK_Static_Expression
471 (Type_Low_Bound
(Etype
(Prefix
(Constr
))))
473 Is_OK_Static_Expression
474 (Type_High_Bound
(Etype
(Prefix
(Constr
))));
478 not Present
(Etype
(Constr
)) -- previous error
479 or else not Is_Discrete_Type
(Etype
(Constr
))
480 or else Is_OK_Static_Expression
(Constr
);
482 when N_Discriminant_Association
=>
483 return All_Composite_Constraints_Static
(Expression
(Constr
));
485 when N_Range_Constraint
=>
487 All_Composite_Constraints_Static
(Range_Expression
(Constr
));
489 when N_Index_Or_Discriminant_Constraint
=>
491 One_Cstr
: Entity_Id
;
493 One_Cstr
:= First
(Constraints
(Constr
));
494 while Present
(One_Cstr
) loop
495 if not All_Composite_Constraints_Static
(One_Cstr
) then
505 when N_Subtype_Indication
=>
507 All_Composite_Constraints_Static
(Subtype_Mark
(Constr
))
509 All_Composite_Constraints_Static
(Constraint
(Constr
));
514 end All_Composite_Constraints_Static
;
516 ---------------------------------
517 -- Append_Inherited_Subprogram --
518 ---------------------------------
520 procedure Append_Inherited_Subprogram
(S
: Entity_Id
) is
521 Par
: constant Entity_Id
:= Alias
(S
);
522 -- The parent subprogram
524 Scop
: constant Entity_Id
:= Scope
(Par
);
525 -- The scope of definition of the parent subprogram
527 Typ
: constant Entity_Id
:= Defining_Entity
(Parent
(S
));
528 -- The derived type of which S is a primitive operation
534 if Ekind
(Current_Scope
) = E_Package
535 and then In_Private_Part
(Current_Scope
)
536 and then Has_Private_Declaration
(Typ
)
537 and then Is_Tagged_Type
(Typ
)
538 and then Scop
= Current_Scope
540 -- The inherited operation is available at the earliest place after
541 -- the derived type declaration ( RM 7.3.1 (6/1)). This is only
542 -- relevant for type extensions. If the parent operation appears
543 -- after the type extension, the operation is not visible.
546 (Visible_Declarations
547 (Package_Specification
(Current_Scope
)));
548 while Present
(Decl
) loop
549 if Nkind
(Decl
) = N_Private_Extension_Declaration
550 and then Defining_Entity
(Decl
) = Typ
552 if Sloc
(Decl
) > Sloc
(Par
) then
553 Next_E
:= Next_Entity
(Par
);
554 Set_Next_Entity
(Par
, S
);
555 Set_Next_Entity
(S
, Next_E
);
567 -- If partial view is not a type extension, or it appears before the
568 -- subprogram declaration, insert normally at end of entity list.
570 Append_Entity
(S
, Current_Scope
);
571 end Append_Inherited_Subprogram
;
573 -----------------------------------------
574 -- Apply_Compile_Time_Constraint_Error --
575 -----------------------------------------
577 procedure Apply_Compile_Time_Constraint_Error
580 Reason
: RT_Exception_Code
;
581 Ent
: Entity_Id
:= Empty
;
582 Typ
: Entity_Id
:= Empty
;
583 Loc
: Source_Ptr
:= No_Location
;
584 Rep
: Boolean := True;
585 Warn
: Boolean := False)
587 Stat
: constant Boolean := Is_Static_Expression
(N
);
588 R_Stat
: constant Node_Id
:=
589 Make_Raise_Constraint_Error
(Sloc
(N
), Reason
=> Reason
);
600 (Compile_Time_Constraint_Error
(N
, Msg
, Ent
, Loc
, Warn
=> Warn
));
606 -- Now we replace the node by an N_Raise_Constraint_Error node
607 -- This does not need reanalyzing, so set it as analyzed now.
610 Set_Analyzed
(N
, True);
613 Set_Raises_Constraint_Error
(N
);
615 -- Now deal with possible local raise handling
617 Possible_Local_Raise
(N
, Standard_Constraint_Error
);
619 -- If the original expression was marked as static, the result is
620 -- still marked as static, but the Raises_Constraint_Error flag is
621 -- always set so that further static evaluation is not attempted.
624 Set_Is_Static_Expression
(N
);
626 end Apply_Compile_Time_Constraint_Error
;
628 ---------------------------
629 -- Async_Readers_Enabled --
630 ---------------------------
632 function Async_Readers_Enabled
(Id
: Entity_Id
) return Boolean is
634 return Has_Enabled_Property
(Id
, Name_Async_Readers
);
635 end Async_Readers_Enabled
;
637 ---------------------------
638 -- Async_Writers_Enabled --
639 ---------------------------
641 function Async_Writers_Enabled
(Id
: Entity_Id
) return Boolean is
643 return Has_Enabled_Property
(Id
, Name_Async_Writers
);
644 end Async_Writers_Enabled
;
646 --------------------------------------
647 -- Available_Full_View_Of_Component --
648 --------------------------------------
650 function Available_Full_View_Of_Component
(T
: Entity_Id
) return Boolean is
651 ST
: constant Entity_Id
:= Scope
(T
);
652 SCT
: constant Entity_Id
:= Scope
(Component_Type
(T
));
654 return In_Open_Scopes
(ST
)
655 and then In_Open_Scopes
(SCT
)
656 and then Scope_Depth
(ST
) >= Scope_Depth
(SCT
);
657 end Available_Full_View_Of_Component
;
663 procedure Bad_Attribute
666 Warn
: Boolean := False)
669 Error_Msg_Warn
:= Warn
;
670 Error_Msg_N
("unrecognized attribute&<<", N
);
672 -- Check for possible misspelling
674 Error_Msg_Name_1
:= First_Attribute_Name
;
675 while Error_Msg_Name_1
<= Last_Attribute_Name
loop
676 if Is_Bad_Spelling_Of
(Nam
, Error_Msg_Name_1
) then
677 Error_Msg_N
-- CODEFIX
678 ("\possible misspelling of %<<", N
);
682 Error_Msg_Name_1
:= Error_Msg_Name_1
+ 1;
686 --------------------------------
687 -- Bad_Predicated_Subtype_Use --
688 --------------------------------
690 procedure Bad_Predicated_Subtype_Use
694 Suggest_Static
: Boolean := False)
699 -- Avoid cascaded errors
701 if Error_Posted
(N
) then
705 if Inside_A_Generic
then
706 Gen
:= Current_Scope
;
707 while Present
(Gen
) and then Ekind
(Gen
) /= E_Generic_Package
loop
715 if Is_Generic_Formal
(Typ
) and then Is_Discrete_Type
(Typ
) then
716 Set_No_Predicate_On_Actual
(Typ
);
719 elsif Has_Predicates
(Typ
) then
720 if Is_Generic_Actual_Type
(Typ
) then
722 -- The restriction on loop parameters is only that the type
723 -- should have no dynamic predicates.
725 if Nkind
(Parent
(N
)) = N_Loop_Parameter_Specification
726 and then not Has_Dynamic_Predicate_Aspect
(Typ
)
727 and then Is_OK_Static_Subtype
(Typ
)
732 Gen
:= Current_Scope
;
733 while not Is_Generic_Instance
(Gen
) loop
737 pragma Assert
(Present
(Gen
));
739 if Ekind
(Gen
) = E_Package
and then In_Package_Body
(Gen
) then
740 Error_Msg_Warn
:= SPARK_Mode
/= On
;
741 Error_Msg_FE
(Msg
& "<<", N
, Typ
);
742 Error_Msg_F
("\Program_Error [<<", N
);
745 Make_Raise_Program_Error
(Sloc
(N
),
746 Reason
=> PE_Bad_Predicated_Generic_Type
));
749 Error_Msg_FE
(Msg
& "<<", N
, Typ
);
753 Error_Msg_FE
(Msg
, N
, Typ
);
756 -- Emit an optional suggestion on how to remedy the error if the
757 -- context warrants it.
759 if Suggest_Static
and then Has_Static_Predicate
(Typ
) then
760 Error_Msg_FE
("\predicate of & should be marked static", N
, Typ
);
763 end Bad_Predicated_Subtype_Use
;
765 -----------------------------------------
766 -- Bad_Unordered_Enumeration_Reference --
767 -----------------------------------------
769 function Bad_Unordered_Enumeration_Reference
771 T
: Entity_Id
) return Boolean
774 return Is_Enumeration_Type
(T
)
775 and then Warn_On_Unordered_Enumeration_Type
776 and then not Is_Generic_Type
(T
)
777 and then Comes_From_Source
(N
)
778 and then not Has_Pragma_Ordered
(T
)
779 and then not In_Same_Extended_Unit
(N
, T
);
780 end Bad_Unordered_Enumeration_Reference
;
782 --------------------------
783 -- Build_Actual_Subtype --
784 --------------------------
786 function Build_Actual_Subtype
788 N
: Node_Or_Entity_Id
) return Node_Id
791 -- Normally Sloc (N), but may point to corresponding body in some cases
793 Constraints
: List_Id
;
799 Disc_Type
: Entity_Id
;
805 if Nkind
(N
) = N_Defining_Identifier
then
806 Obj
:= New_Occurrence_Of
(N
, Loc
);
808 -- If this is a formal parameter of a subprogram declaration, and
809 -- we are compiling the body, we want the declaration for the
810 -- actual subtype to carry the source position of the body, to
811 -- prevent anomalies in gdb when stepping through the code.
813 if Is_Formal
(N
) then
815 Decl
: constant Node_Id
:= Unit_Declaration_Node
(Scope
(N
));
817 if Nkind
(Decl
) = N_Subprogram_Declaration
818 and then Present
(Corresponding_Body
(Decl
))
820 Loc
:= Sloc
(Corresponding_Body
(Decl
));
829 if Is_Array_Type
(T
) then
830 Constraints
:= New_List
;
831 for J
in 1 .. Number_Dimensions
(T
) loop
833 -- Build an array subtype declaration with the nominal subtype and
834 -- the bounds of the actual. Add the declaration in front of the
835 -- local declarations for the subprogram, for analysis before any
836 -- reference to the formal in the body.
839 Make_Attribute_Reference
(Loc
,
841 Duplicate_Subexpr_No_Checks
(Obj
, Name_Req
=> True),
842 Attribute_Name
=> Name_First
,
843 Expressions
=> New_List
(
844 Make_Integer_Literal
(Loc
, J
)));
847 Make_Attribute_Reference
(Loc
,
849 Duplicate_Subexpr_No_Checks
(Obj
, Name_Req
=> True),
850 Attribute_Name
=> Name_Last
,
851 Expressions
=> New_List
(
852 Make_Integer_Literal
(Loc
, J
)));
854 Append
(Make_Range
(Loc
, Lo
, Hi
), Constraints
);
857 -- If the type has unknown discriminants there is no constrained
858 -- subtype to build. This is never called for a formal or for a
859 -- lhs, so returning the type is ok ???
861 elsif Has_Unknown_Discriminants
(T
) then
865 Constraints
:= New_List
;
867 -- Type T is a generic derived type, inherit the discriminants from
870 if Is_Private_Type
(T
)
871 and then No
(Full_View
(T
))
873 -- T was flagged as an error if it was declared as a formal
874 -- derived type with known discriminants. In this case there
875 -- is no need to look at the parent type since T already carries
876 -- its own discriminants.
878 and then not Error_Posted
(T
)
880 Disc_Type
:= Etype
(Base_Type
(T
));
885 Discr
:= First_Discriminant
(Disc_Type
);
886 while Present
(Discr
) loop
887 Append_To
(Constraints
,
888 Make_Selected_Component
(Loc
,
890 Duplicate_Subexpr_No_Checks
(Obj
),
891 Selector_Name
=> New_Occurrence_Of
(Discr
, Loc
)));
892 Next_Discriminant
(Discr
);
896 Subt
:= Make_Temporary
(Loc
, 'S', Related_Node
=> N
);
897 Set_Is_Internal
(Subt
);
900 Make_Subtype_Declaration
(Loc
,
901 Defining_Identifier
=> Subt
,
902 Subtype_Indication
=>
903 Make_Subtype_Indication
(Loc
,
904 Subtype_Mark
=> New_Occurrence_Of
(T
, Loc
),
906 Make_Index_Or_Discriminant_Constraint
(Loc
,
907 Constraints
=> Constraints
)));
909 Mark_Rewrite_Insertion
(Decl
);
911 end Build_Actual_Subtype
;
913 ---------------------------------------
914 -- Build_Actual_Subtype_Of_Component --
915 ---------------------------------------
917 function Build_Actual_Subtype_Of_Component
919 N
: Node_Id
) return Node_Id
921 Loc
: constant Source_Ptr
:= Sloc
(N
);
922 P
: constant Node_Id
:= Prefix
(N
);
925 Index_Typ
: Entity_Id
;
927 Desig_Typ
: Entity_Id
;
928 -- This is either a copy of T, or if T is an access type, then it is
929 -- the directly designated type of this access type.
931 function Build_Actual_Array_Constraint
return List_Id
;
932 -- If one or more of the bounds of the component depends on
933 -- discriminants, build actual constraint using the discriminants
936 function Build_Actual_Record_Constraint
return List_Id
;
937 -- Similar to previous one, for discriminated components constrained
938 -- by the discriminant of the enclosing object.
940 -----------------------------------
941 -- Build_Actual_Array_Constraint --
942 -----------------------------------
944 function Build_Actual_Array_Constraint
return List_Id
is
945 Constraints
: constant List_Id
:= New_List
;
953 Indx
:= First_Index
(Desig_Typ
);
954 while Present
(Indx
) loop
955 Old_Lo
:= Type_Low_Bound
(Etype
(Indx
));
956 Old_Hi
:= Type_High_Bound
(Etype
(Indx
));
958 if Denotes_Discriminant
(Old_Lo
) then
960 Make_Selected_Component
(Loc
,
961 Prefix
=> New_Copy_Tree
(P
),
962 Selector_Name
=> New_Occurrence_Of
(Entity
(Old_Lo
), Loc
));
965 Lo
:= New_Copy_Tree
(Old_Lo
);
967 -- The new bound will be reanalyzed in the enclosing
968 -- declaration. For literal bounds that come from a type
969 -- declaration, the type of the context must be imposed, so
970 -- insure that analysis will take place. For non-universal
971 -- types this is not strictly necessary.
973 Set_Analyzed
(Lo
, False);
976 if Denotes_Discriminant
(Old_Hi
) then
978 Make_Selected_Component
(Loc
,
979 Prefix
=> New_Copy_Tree
(P
),
980 Selector_Name
=> New_Occurrence_Of
(Entity
(Old_Hi
), Loc
));
983 Hi
:= New_Copy_Tree
(Old_Hi
);
984 Set_Analyzed
(Hi
, False);
987 Append
(Make_Range
(Loc
, Lo
, Hi
), Constraints
);
992 end Build_Actual_Array_Constraint
;
994 ------------------------------------
995 -- Build_Actual_Record_Constraint --
996 ------------------------------------
998 function Build_Actual_Record_Constraint
return List_Id
is
999 Constraints
: constant List_Id
:= New_List
;
1004 D
:= First_Elmt
(Discriminant_Constraint
(Desig_Typ
));
1005 while Present
(D
) loop
1006 if Denotes_Discriminant
(Node
(D
)) then
1007 D_Val
:= Make_Selected_Component
(Loc
,
1008 Prefix
=> New_Copy_Tree
(P
),
1009 Selector_Name
=> New_Occurrence_Of
(Entity
(Node
(D
)), Loc
));
1012 D_Val
:= New_Copy_Tree
(Node
(D
));
1015 Append
(D_Val
, Constraints
);
1020 end Build_Actual_Record_Constraint
;
1022 -- Start of processing for Build_Actual_Subtype_Of_Component
1025 -- Why the test for Spec_Expression mode here???
1027 if In_Spec_Expression
then
1030 -- More comments for the rest of this body would be good ???
1032 elsif Nkind
(N
) = N_Explicit_Dereference
then
1033 if Is_Composite_Type
(T
)
1034 and then not Is_Constrained
(T
)
1035 and then not (Is_Class_Wide_Type
(T
)
1036 and then Is_Constrained
(Root_Type
(T
)))
1037 and then not Has_Unknown_Discriminants
(T
)
1039 -- If the type of the dereference is already constrained, it is an
1042 if Is_Array_Type
(Etype
(N
))
1043 and then Is_Constrained
(Etype
(N
))
1047 Remove_Side_Effects
(P
);
1048 return Build_Actual_Subtype
(T
, N
);
1055 if Ekind
(T
) = E_Access_Subtype
then
1056 Desig_Typ
:= Designated_Type
(T
);
1061 if Ekind
(Desig_Typ
) = E_Array_Subtype
then
1062 Id
:= First_Index
(Desig_Typ
);
1063 while Present
(Id
) loop
1064 Index_Typ
:= Underlying_Type
(Etype
(Id
));
1066 if Denotes_Discriminant
(Type_Low_Bound
(Index_Typ
))
1068 Denotes_Discriminant
(Type_High_Bound
(Index_Typ
))
1070 Remove_Side_Effects
(P
);
1072 Build_Component_Subtype
1073 (Build_Actual_Array_Constraint
, Loc
, Base_Type
(T
));
1079 elsif Is_Composite_Type
(Desig_Typ
)
1080 and then Has_Discriminants
(Desig_Typ
)
1081 and then not Has_Unknown_Discriminants
(Desig_Typ
)
1083 if Is_Private_Type
(Desig_Typ
)
1084 and then No
(Discriminant_Constraint
(Desig_Typ
))
1086 Desig_Typ
:= Full_View
(Desig_Typ
);
1089 D
:= First_Elmt
(Discriminant_Constraint
(Desig_Typ
));
1090 while Present
(D
) loop
1091 if Denotes_Discriminant
(Node
(D
)) then
1092 Remove_Side_Effects
(P
);
1094 Build_Component_Subtype
(
1095 Build_Actual_Record_Constraint
, Loc
, Base_Type
(T
));
1102 -- If none of the above, the actual and nominal subtypes are the same
1105 end Build_Actual_Subtype_Of_Component
;
1107 -----------------------------
1108 -- Build_Component_Subtype --
1109 -----------------------------
1111 function Build_Component_Subtype
1114 T
: Entity_Id
) return Node_Id
1120 -- Unchecked_Union components do not require component subtypes
1122 if Is_Unchecked_Union
(T
) then
1126 Subt
:= Make_Temporary
(Loc
, 'S');
1127 Set_Is_Internal
(Subt
);
1130 Make_Subtype_Declaration
(Loc
,
1131 Defining_Identifier
=> Subt
,
1132 Subtype_Indication
=>
1133 Make_Subtype_Indication
(Loc
,
1134 Subtype_Mark
=> New_Occurrence_Of
(Base_Type
(T
), Loc
),
1136 Make_Index_Or_Discriminant_Constraint
(Loc
,
1137 Constraints
=> C
)));
1139 Mark_Rewrite_Insertion
(Decl
);
1141 end Build_Component_Subtype
;
1143 ----------------------------------
1144 -- Build_Default_Init_Cond_Call --
1145 ----------------------------------
1147 function Build_Default_Init_Cond_Call
1150 Typ
: Entity_Id
) return Node_Id
1152 Proc_Id
: constant Entity_Id
:= Default_Init_Cond_Procedure
(Typ
);
1153 Formal_Typ
: constant Entity_Id
:= Etype
(First_Formal
(Proc_Id
));
1157 Make_Procedure_Call_Statement
(Loc
,
1158 Name
=> New_Occurrence_Of
(Proc_Id
, Loc
),
1159 Parameter_Associations
=> New_List
(
1160 Make_Unchecked_Type_Conversion
(Loc
,
1161 Subtype_Mark
=> New_Occurrence_Of
(Formal_Typ
, Loc
),
1162 Expression
=> New_Occurrence_Of
(Obj_Id
, Loc
))));
1163 end Build_Default_Init_Cond_Call
;
1165 ----------------------------------------------
1166 -- Build_Default_Init_Cond_Procedure_Bodies --
1167 ----------------------------------------------
1169 procedure Build_Default_Init_Cond_Procedure_Bodies
(Priv_Decls
: List_Id
) is
1170 procedure Build_Default_Init_Cond_Procedure_Body
(Typ
: Entity_Id
);
1171 -- If type Typ is subject to pragma Default_Initial_Condition, build the
1172 -- body of the procedure which verifies the assumption of the pragma at
1173 -- run time. The generated body is added after the type declaration.
1175 --------------------------------------------
1176 -- Build_Default_Init_Cond_Procedure_Body --
1177 --------------------------------------------
1179 procedure Build_Default_Init_Cond_Procedure_Body
(Typ
: Entity_Id
) is
1180 Param_Id
: Entity_Id
;
1181 -- The entity of the sole formal parameter of the default initial
1182 -- condition procedure.
1184 procedure Replace_Type_Reference
(N
: Node_Id
);
1185 -- Replace a single reference to type Typ with a reference to formal
1186 -- parameter Param_Id.
1188 ----------------------------
1189 -- Replace_Type_Reference --
1190 ----------------------------
1192 procedure Replace_Type_Reference
(N
: Node_Id
) is
1194 Rewrite
(N
, New_Occurrence_Of
(Param_Id
, Sloc
(N
)));
1195 end Replace_Type_Reference
;
1197 procedure Replace_Type_References
is
1198 new Replace_Type_References_Generic
(Replace_Type_Reference
);
1202 Loc
: constant Source_Ptr
:= Sloc
(Typ
);
1203 Prag
: constant Node_Id
:=
1204 Get_Pragma
(Typ
, Pragma_Default_Initial_Condition
);
1205 Proc_Id
: constant Entity_Id
:= Default_Init_Cond_Procedure
(Typ
);
1206 Spec_Decl
: constant Node_Id
:= Unit_Declaration_Node
(Proc_Id
);
1207 Body_Decl
: Node_Id
;
1211 Save_Ghost_Mode
: constant Ghost_Mode_Type
:= Ghost_Mode
;
1213 -- Start of processing for Build_Default_Init_Cond_Procedure_Body
1216 -- The procedure should be generated only for [sub]types subject to
1217 -- pragma Default_Initial_Condition. Types that inherit the pragma do
1218 -- not get this specialized procedure.
1220 pragma Assert
(Has_Default_Init_Cond
(Typ
));
1221 pragma Assert
(Present
(Prag
));
1222 pragma Assert
(Present
(Proc_Id
));
1224 -- Nothing to do if the body was already built
1226 if Present
(Corresponding_Body
(Spec_Decl
)) then
1230 -- The related type may be subject to pragma Ghost. Set the mode now
1231 -- to ensure that the analysis and expansion produce Ghost nodes.
1233 Set_Ghost_Mode_From_Entity
(Typ
);
1235 Param_Id
:= First_Formal
(Proc_Id
);
1237 -- The pragma has an argument. Note that the argument is analyzed
1238 -- after all references to the current instance of the type are
1241 if Present
(Pragma_Argument_Associations
(Prag
)) then
1243 Get_Pragma_Arg
(First
(Pragma_Argument_Associations
(Prag
)));
1245 if Nkind
(Expr
) = N_Null
then
1246 Stmt
:= Make_Null_Statement
(Loc
);
1248 -- Preserve the original argument of the pragma by replicating it.
1249 -- Replace all references to the current instance of the type with
1250 -- references to the formal parameter.
1253 Expr
:= New_Copy_Tree
(Expr
);
1254 Replace_Type_References
(Expr
, Typ
);
1257 -- pragma Check (Default_Initial_Condition, <Expr>);
1261 Pragma_Identifier
=>
1262 Make_Identifier
(Loc
, Name_Check
),
1264 Pragma_Argument_Associations
=> New_List
(
1265 Make_Pragma_Argument_Association
(Loc
,
1267 Make_Identifier
(Loc
,
1268 Chars
=> Name_Default_Initial_Condition
)),
1269 Make_Pragma_Argument_Association
(Loc
,
1270 Expression
=> Expr
)));
1273 -- Otherwise the pragma appears without an argument
1276 Stmt
:= Make_Null_Statement
(Loc
);
1280 -- procedure <Typ>Default_Init_Cond (I : <Typ>) is
1283 -- end <Typ>Default_Init_Cond;
1286 Make_Subprogram_Body
(Loc
,
1288 Copy_Separate_Tree
(Specification
(Spec_Decl
)),
1289 Declarations
=> Empty_List
,
1290 Handled_Statement_Sequence
=>
1291 Make_Handled_Sequence_Of_Statements
(Loc
,
1292 Statements
=> New_List
(Stmt
)));
1294 -- Link the spec and body of the default initial condition procedure
1295 -- to prevent the generation of a duplicate body.
1297 Set_Corresponding_Body
(Spec_Decl
, Defining_Entity
(Body_Decl
));
1298 Set_Corresponding_Spec
(Body_Decl
, Proc_Id
);
1300 Insert_After_And_Analyze
(Declaration_Node
(Typ
), Body_Decl
);
1301 Ghost_Mode
:= Save_Ghost_Mode
;
1302 end Build_Default_Init_Cond_Procedure_Body
;
1309 -- Start of processing for Build_Default_Init_Cond_Procedure_Bodies
1312 -- Inspect the private declarations looking for [sub]type declarations
1314 Decl
:= First
(Priv_Decls
);
1315 while Present
(Decl
) loop
1316 if Nkind_In
(Decl
, N_Full_Type_Declaration
,
1317 N_Subtype_Declaration
)
1319 Typ
:= Defining_Entity
(Decl
);
1321 -- Guard against partially decorate types due to previous errors
1323 if Is_Type
(Typ
) then
1325 -- If the type is subject to pragma Default_Initial_Condition,
1326 -- generate the body of the internal procedure which verifies
1327 -- the assertion of the pragma at run time.
1329 if Has_Default_Init_Cond
(Typ
) then
1330 Build_Default_Init_Cond_Procedure_Body
(Typ
);
1332 -- A derived type inherits the default initial condition
1333 -- procedure from its parent type.
1335 elsif Has_Inherited_Default_Init_Cond
(Typ
) then
1336 Inherit_Default_Init_Cond_Procedure
(Typ
);
1343 end Build_Default_Init_Cond_Procedure_Bodies
;
1345 ---------------------------------------------------
1346 -- Build_Default_Init_Cond_Procedure_Declaration --
1347 ---------------------------------------------------
1349 procedure Build_Default_Init_Cond_Procedure_Declaration
(Typ
: Entity_Id
) is
1350 Loc
: constant Source_Ptr
:= Sloc
(Typ
);
1351 Prag
: constant Node_Id
:=
1352 Get_Pragma
(Typ
, Pragma_Default_Initial_Condition
);
1354 Save_Ghost_Mode
: constant Ghost_Mode_Type
:= Ghost_Mode
;
1356 Proc_Id
: Entity_Id
;
1359 -- The procedure should be generated only for types subject to pragma
1360 -- Default_Initial_Condition. Types that inherit the pragma do not get
1361 -- this specialized procedure.
1363 pragma Assert
(Has_Default_Init_Cond
(Typ
));
1364 pragma Assert
(Present
(Prag
));
1366 -- Nothing to do if default initial condition procedure already built
1368 if Present
(Default_Init_Cond_Procedure
(Typ
)) then
1372 -- The related type may be subject to pragma Ghost. Set the mode now to
1373 -- ensure that the analysis and expansion produce Ghost nodes.
1375 Set_Ghost_Mode_From_Entity
(Typ
);
1378 Make_Defining_Identifier
(Loc
,
1379 Chars
=> New_External_Name
(Chars
(Typ
), "Default_Init_Cond"));
1381 -- Associate default initial condition procedure with the private type
1383 Set_Ekind
(Proc_Id
, E_Procedure
);
1384 Set_Is_Default_Init_Cond_Procedure
(Proc_Id
);
1385 Set_Default_Init_Cond_Procedure
(Typ
, Proc_Id
);
1387 -- Mark the default initial condition procedure explicitly as Ghost
1388 -- because it does not come from source.
1390 if Ghost_Mode
> None
then
1391 Set_Is_Ghost_Entity
(Proc_Id
);
1395 -- procedure <Typ>Default_Init_Cond (Inn : <Typ>);
1397 Insert_After_And_Analyze
(Prag
,
1398 Make_Subprogram_Declaration
(Loc
,
1400 Make_Procedure_Specification
(Loc
,
1401 Defining_Unit_Name
=> Proc_Id
,
1402 Parameter_Specifications
=> New_List
(
1403 Make_Parameter_Specification
(Loc
,
1404 Defining_Identifier
=> Make_Temporary
(Loc
, 'I'),
1405 Parameter_Type
=> New_Occurrence_Of
(Typ
, Loc
))))));
1407 Ghost_Mode
:= Save_Ghost_Mode
;
1408 end Build_Default_Init_Cond_Procedure_Declaration
;
1410 ---------------------------
1411 -- Build_Default_Subtype --
1412 ---------------------------
1414 function Build_Default_Subtype
1416 N
: Node_Id
) return Entity_Id
1418 Loc
: constant Source_Ptr
:= Sloc
(N
);
1422 -- The base type that is to be constrained by the defaults
1425 if not Has_Discriminants
(T
) or else Is_Constrained
(T
) then
1429 Bas
:= Base_Type
(T
);
1431 -- If T is non-private but its base type is private, this is the
1432 -- completion of a subtype declaration whose parent type is private
1433 -- (see Complete_Private_Subtype in Sem_Ch3). The proper discriminants
1434 -- are to be found in the full view of the base. Check that the private
1435 -- status of T and its base differ.
1437 if Is_Private_Type
(Bas
)
1438 and then not Is_Private_Type
(T
)
1439 and then Present
(Full_View
(Bas
))
1441 Bas
:= Full_View
(Bas
);
1444 Disc
:= First_Discriminant
(T
);
1446 if No
(Discriminant_Default_Value
(Disc
)) then
1451 Act
: constant Entity_Id
:= Make_Temporary
(Loc
, 'S');
1452 Constraints
: constant List_Id
:= New_List
;
1456 while Present
(Disc
) loop
1457 Append_To
(Constraints
,
1458 New_Copy_Tree
(Discriminant_Default_Value
(Disc
)));
1459 Next_Discriminant
(Disc
);
1463 Make_Subtype_Declaration
(Loc
,
1464 Defining_Identifier
=> Act
,
1465 Subtype_Indication
=>
1466 Make_Subtype_Indication
(Loc
,
1467 Subtype_Mark
=> New_Occurrence_Of
(Bas
, Loc
),
1469 Make_Index_Or_Discriminant_Constraint
(Loc
,
1470 Constraints
=> Constraints
)));
1472 Insert_Action
(N
, Decl
);
1474 -- If the context is a component declaration the subtype declaration
1475 -- will be analyzed when the enclosing type is frozen, otherwise do
1478 if Ekind
(Current_Scope
) /= E_Record_Type
then
1484 end Build_Default_Subtype
;
1486 --------------------------------------------
1487 -- Build_Discriminal_Subtype_Of_Component --
1488 --------------------------------------------
1490 function Build_Discriminal_Subtype_Of_Component
1491 (T
: Entity_Id
) return Node_Id
1493 Loc
: constant Source_Ptr
:= Sloc
(T
);
1497 function Build_Discriminal_Array_Constraint
return List_Id
;
1498 -- If one or more of the bounds of the component depends on
1499 -- discriminants, build actual constraint using the discriminants
1502 function Build_Discriminal_Record_Constraint
return List_Id
;
1503 -- Similar to previous one, for discriminated components constrained by
1504 -- the discriminant of the enclosing object.
1506 ----------------------------------------
1507 -- Build_Discriminal_Array_Constraint --
1508 ----------------------------------------
1510 function Build_Discriminal_Array_Constraint
return List_Id
is
1511 Constraints
: constant List_Id
:= New_List
;
1519 Indx
:= First_Index
(T
);
1520 while Present
(Indx
) loop
1521 Old_Lo
:= Type_Low_Bound
(Etype
(Indx
));
1522 Old_Hi
:= Type_High_Bound
(Etype
(Indx
));
1524 if Denotes_Discriminant
(Old_Lo
) then
1525 Lo
:= New_Occurrence_Of
(Discriminal
(Entity
(Old_Lo
)), Loc
);
1528 Lo
:= New_Copy_Tree
(Old_Lo
);
1531 if Denotes_Discriminant
(Old_Hi
) then
1532 Hi
:= New_Occurrence_Of
(Discriminal
(Entity
(Old_Hi
)), Loc
);
1535 Hi
:= New_Copy_Tree
(Old_Hi
);
1538 Append
(Make_Range
(Loc
, Lo
, Hi
), Constraints
);
1543 end Build_Discriminal_Array_Constraint
;
1545 -----------------------------------------
1546 -- Build_Discriminal_Record_Constraint --
1547 -----------------------------------------
1549 function Build_Discriminal_Record_Constraint
return List_Id
is
1550 Constraints
: constant List_Id
:= New_List
;
1555 D
:= First_Elmt
(Discriminant_Constraint
(T
));
1556 while Present
(D
) loop
1557 if Denotes_Discriminant
(Node
(D
)) then
1559 New_Occurrence_Of
(Discriminal
(Entity
(Node
(D
))), Loc
);
1561 D_Val
:= New_Copy_Tree
(Node
(D
));
1564 Append
(D_Val
, Constraints
);
1569 end Build_Discriminal_Record_Constraint
;
1571 -- Start of processing for Build_Discriminal_Subtype_Of_Component
1574 if Ekind
(T
) = E_Array_Subtype
then
1575 Id
:= First_Index
(T
);
1576 while Present
(Id
) loop
1577 if Denotes_Discriminant
(Type_Low_Bound
(Etype
(Id
)))
1579 Denotes_Discriminant
(Type_High_Bound
(Etype
(Id
)))
1581 return Build_Component_Subtype
1582 (Build_Discriminal_Array_Constraint
, Loc
, T
);
1588 elsif Ekind
(T
) = E_Record_Subtype
1589 and then Has_Discriminants
(T
)
1590 and then not Has_Unknown_Discriminants
(T
)
1592 D
:= First_Elmt
(Discriminant_Constraint
(T
));
1593 while Present
(D
) loop
1594 if Denotes_Discriminant
(Node
(D
)) then
1595 return Build_Component_Subtype
1596 (Build_Discriminal_Record_Constraint
, Loc
, T
);
1603 -- If none of the above, the actual and nominal subtypes are the same
1606 end Build_Discriminal_Subtype_Of_Component
;
1608 ------------------------------
1609 -- Build_Elaboration_Entity --
1610 ------------------------------
1612 procedure Build_Elaboration_Entity
(N
: Node_Id
; Spec_Id
: Entity_Id
) is
1613 Loc
: constant Source_Ptr
:= Sloc
(N
);
1615 Elab_Ent
: Entity_Id
;
1617 procedure Set_Package_Name
(Ent
: Entity_Id
);
1618 -- Given an entity, sets the fully qualified name of the entity in
1619 -- Name_Buffer, with components separated by double underscores. This
1620 -- is a recursive routine that climbs the scope chain to Standard.
1622 ----------------------
1623 -- Set_Package_Name --
1624 ----------------------
1626 procedure Set_Package_Name
(Ent
: Entity_Id
) is
1628 if Scope
(Ent
) /= Standard_Standard
then
1629 Set_Package_Name
(Scope
(Ent
));
1632 Nam
: constant String := Get_Name_String
(Chars
(Ent
));
1634 Name_Buffer
(Name_Len
+ 1) := '_';
1635 Name_Buffer
(Name_Len
+ 2) := '_';
1636 Name_Buffer
(Name_Len
+ 3 .. Name_Len
+ Nam
'Length + 2) := Nam
;
1637 Name_Len
:= Name_Len
+ Nam
'Length + 2;
1641 Get_Name_String
(Chars
(Ent
));
1643 end Set_Package_Name
;
1645 -- Start of processing for Build_Elaboration_Entity
1648 -- Ignore call if already constructed
1650 if Present
(Elaboration_Entity
(Spec_Id
)) then
1653 -- Ignore in ASIS mode, elaboration entity is not in source and plays
1654 -- no role in analysis.
1656 elsif ASIS_Mode
then
1659 -- See if we need elaboration entity. We always need it for the dynamic
1660 -- elaboration model, since it is needed to properly generate the PE
1661 -- exception for access before elaboration.
1663 elsif Dynamic_Elaboration_Checks
then
1666 -- For the static model, we don't need the elaboration counter if this
1667 -- unit is sure to have no elaboration code, since that means there
1668 -- is no elaboration unit to be called. Note that we can't just decide
1669 -- after the fact by looking to see whether there was elaboration code,
1670 -- because that's too late to make this decision.
1672 elsif Restriction_Active
(No_Elaboration_Code
) then
1675 -- Similarly, for the static model, we can skip the elaboration counter
1676 -- if we have the No_Multiple_Elaboration restriction, since for the
1677 -- static model, that's the only purpose of the counter (to avoid
1678 -- multiple elaboration).
1680 elsif Restriction_Active
(No_Multiple_Elaboration
) then
1684 -- Here we need the elaboration entity
1686 -- Construct name of elaboration entity as xxx_E, where xxx is the unit
1687 -- name with dots replaced by double underscore. We have to manually
1688 -- construct this name, since it will be elaborated in the outer scope,
1689 -- and thus will not have the unit name automatically prepended.
1691 Set_Package_Name
(Spec_Id
);
1692 Add_Str_To_Name_Buffer
("_E");
1694 -- Create elaboration counter
1696 Elab_Ent
:= Make_Defining_Identifier
(Loc
, Chars
=> Name_Find
);
1697 Set_Elaboration_Entity
(Spec_Id
, Elab_Ent
);
1700 Make_Object_Declaration
(Loc
,
1701 Defining_Identifier
=> Elab_Ent
,
1702 Object_Definition
=>
1703 New_Occurrence_Of
(Standard_Short_Integer
, Loc
),
1704 Expression
=> Make_Integer_Literal
(Loc
, Uint_0
));
1706 Push_Scope
(Standard_Standard
);
1707 Add_Global_Declaration
(Decl
);
1710 -- Reset True_Constant indication, since we will indeed assign a value
1711 -- to the variable in the binder main. We also kill the Current_Value
1712 -- and Last_Assignment fields for the same reason.
1714 Set_Is_True_Constant
(Elab_Ent
, False);
1715 Set_Current_Value
(Elab_Ent
, Empty
);
1716 Set_Last_Assignment
(Elab_Ent
, Empty
);
1718 -- We do not want any further qualification of the name (if we did not
1719 -- do this, we would pick up the name of the generic package in the case
1720 -- of a library level generic instantiation).
1722 Set_Has_Qualified_Name
(Elab_Ent
);
1723 Set_Has_Fully_Qualified_Name
(Elab_Ent
);
1724 end Build_Elaboration_Entity
;
1726 --------------------------------
1727 -- Build_Explicit_Dereference --
1728 --------------------------------
1730 procedure Build_Explicit_Dereference
1734 Loc
: constant Source_Ptr
:= Sloc
(Expr
);
1739 -- An entity of a type with a reference aspect is overloaded with
1740 -- both interpretations: with and without the dereference. Now that
1741 -- the dereference is made explicit, set the type of the node properly,
1742 -- to prevent anomalies in the backend. Same if the expression is an
1743 -- overloaded function call whose return type has a reference aspect.
1745 if Is_Entity_Name
(Expr
) then
1746 Set_Etype
(Expr
, Etype
(Entity
(Expr
)));
1748 elsif Nkind
(Expr
) = N_Function_Call
then
1750 -- If the name of the indexing function is overloaded, locate the one
1751 -- whose return type has an implicit dereference on the desired
1752 -- discriminant, and set entity and type of function call.
1754 if Is_Overloaded
(Name
(Expr
)) then
1755 Get_First_Interp
(Name
(Expr
), I
, It
);
1757 while Present
(It
.Nam
) loop
1758 if Ekind
((It
.Typ
)) = E_Record_Type
1759 and then First_Entity
((It
.Typ
)) = Disc
1761 Set_Entity
(Name
(Expr
), It
.Nam
);
1762 Set_Etype
(Name
(Expr
), Etype
(It
.Nam
));
1766 Get_Next_Interp
(I
, It
);
1770 -- Set type of call from resolved function name.
1772 Set_Etype
(Expr
, Etype
(Name
(Expr
)));
1775 Set_Is_Overloaded
(Expr
, False);
1777 -- The expression will often be a generalized indexing that yields a
1778 -- container element that is then dereferenced, in which case the
1779 -- generalized indexing call is also non-overloaded.
1781 if Nkind
(Expr
) = N_Indexed_Component
1782 and then Present
(Generalized_Indexing
(Expr
))
1784 Set_Is_Overloaded
(Generalized_Indexing
(Expr
), False);
1788 Make_Explicit_Dereference
(Loc
,
1790 Make_Selected_Component
(Loc
,
1791 Prefix
=> Relocate_Node
(Expr
),
1792 Selector_Name
=> New_Occurrence_Of
(Disc
, Loc
))));
1793 Set_Etype
(Prefix
(Expr
), Etype
(Disc
));
1794 Set_Etype
(Expr
, Designated_Type
(Etype
(Disc
)));
1795 end Build_Explicit_Dereference
;
1797 -----------------------------------
1798 -- Cannot_Raise_Constraint_Error --
1799 -----------------------------------
1801 function Cannot_Raise_Constraint_Error
(Expr
: Node_Id
) return Boolean is
1803 if Compile_Time_Known_Value
(Expr
) then
1806 elsif Do_Range_Check
(Expr
) then
1809 elsif Raises_Constraint_Error
(Expr
) then
1813 case Nkind
(Expr
) is
1814 when N_Identifier
=>
1817 when N_Expanded_Name
=>
1820 when N_Selected_Component
=>
1821 return not Do_Discriminant_Check
(Expr
);
1823 when N_Attribute_Reference
=>
1824 if Do_Overflow_Check
(Expr
) then
1827 elsif No
(Expressions
(Expr
)) then
1835 N
:= First
(Expressions
(Expr
));
1836 while Present
(N
) loop
1837 if Cannot_Raise_Constraint_Error
(N
) then
1848 when N_Type_Conversion
=>
1849 if Do_Overflow_Check
(Expr
)
1850 or else Do_Length_Check
(Expr
)
1851 or else Do_Tag_Check
(Expr
)
1855 return Cannot_Raise_Constraint_Error
(Expression
(Expr
));
1858 when N_Unchecked_Type_Conversion
=>
1859 return Cannot_Raise_Constraint_Error
(Expression
(Expr
));
1862 if Do_Overflow_Check
(Expr
) then
1865 return Cannot_Raise_Constraint_Error
(Right_Opnd
(Expr
));
1872 if Do_Division_Check
(Expr
)
1874 Do_Overflow_Check
(Expr
)
1879 Cannot_Raise_Constraint_Error
(Left_Opnd
(Expr
))
1881 Cannot_Raise_Constraint_Error
(Right_Opnd
(Expr
));
1900 N_Op_Shift_Right_Arithmetic |
1904 if Do_Overflow_Check
(Expr
) then
1908 Cannot_Raise_Constraint_Error
(Left_Opnd
(Expr
))
1910 Cannot_Raise_Constraint_Error
(Right_Opnd
(Expr
));
1917 end Cannot_Raise_Constraint_Error
;
1919 -----------------------------
1920 -- Check_Part_Of_Reference --
1921 -----------------------------
1923 procedure Check_Part_Of_Reference
(Var_Id
: Entity_Id
; Ref
: Node_Id
) is
1924 Conc_Typ
: constant Entity_Id
:= Encapsulating_State
(Var_Id
);
1926 OK_Use
: Boolean := False;
1929 Spec_Id
: Entity_Id
;
1932 -- Traverse the parent chain looking for a suitable context for the
1933 -- reference to the concurrent constituent.
1935 Par
:= Parent
(Ref
);
1936 while Present
(Par
) loop
1937 if Nkind
(Par
) = N_Pragma
then
1938 Prag_Nam
:= Pragma_Name
(Par
);
1940 -- A concurrent constituent is allowed to appear in pragmas
1941 -- Initial_Condition and Initializes as this is part of the
1942 -- elaboration checks for the constituent (SPARK RM 9.3).
1944 if Nam_In
(Prag_Nam
, Name_Initial_Condition
, Name_Initializes
) then
1948 -- When the reference appears within pragma Depends or Global,
1949 -- check whether the pragma applies to a single task type. Note
1950 -- that the pragma is not encapsulated by the type definition,
1951 -- but this is still a valid context.
1953 elsif Nam_In
(Prag_Nam
, Name_Depends
, Name_Global
) then
1954 Decl
:= Find_Related_Declaration_Or_Body
(Par
);
1956 if Nkind
(Decl
) = N_Object_Declaration
1957 and then Defining_Entity
(Decl
) = Conc_Typ
1964 -- The reference appears somewhere in the definition of the single
1965 -- protected/task type (SPARK RM 9.3).
1967 elsif Nkind_In
(Par
, N_Single_Protected_Declaration
,
1968 N_Single_Task_Declaration
)
1969 and then Defining_Entity
(Par
) = Conc_Typ
1974 -- The reference appears within the expanded declaration or the body
1975 -- of the single protected/task type (SPARK RM 9.3).
1977 elsif Nkind_In
(Par
, N_Protected_Body
,
1978 N_Protected_Type_Declaration
,
1980 N_Task_Type_Declaration
)
1982 Spec_Id
:= Unique_Defining_Entity
(Par
);
1984 if Present
(Anonymous_Object
(Spec_Id
))
1985 and then Anonymous_Object
(Spec_Id
) = Conc_Typ
1991 -- The reference has been relocated within an internally generated
1992 -- package or subprogram. Assume that the reference is legal as the
1993 -- real check was already performed in the original context of the
1996 elsif Nkind_In
(Par
, N_Package_Body
,
1997 N_Package_Declaration
,
1999 N_Subprogram_Declaration
)
2000 and then not Comes_From_Source
(Par
)
2005 -- The reference has been relocated to an inlined body for GNATprove.
2006 -- Assume that the reference is legal as the real check was already
2007 -- performed in the original context of the reference.
2009 elsif GNATprove_Mode
2010 and then Nkind
(Par
) = N_Subprogram_Body
2011 and then Chars
(Defining_Entity
(Par
)) = Name_uParent
2017 Par
:= Parent
(Par
);
2020 -- The reference is illegal as it appears outside the definition or
2021 -- body of the single protected/task type.
2025 ("reference to variable & cannot appear in this context",
2027 Error_Msg_Name_1
:= Chars
(Var_Id
);
2029 if Ekind
(Conc_Typ
) = E_Protected_Type
then
2031 ("\% is constituent of single protected type &", Ref
, Conc_Typ
);
2034 ("\% is constituent of single task type &", Ref
, Conc_Typ
);
2037 end Check_Part_Of_Reference
;
2039 -----------------------------------------
2040 -- Check_Dynamically_Tagged_Expression --
2041 -----------------------------------------
2043 procedure Check_Dynamically_Tagged_Expression
2046 Related_Nod
: Node_Id
)
2049 pragma Assert
(Is_Tagged_Type
(Typ
));
2051 -- In order to avoid spurious errors when analyzing the expanded code,
2052 -- this check is done only for nodes that come from source and for
2053 -- actuals of generic instantiations.
2055 if (Comes_From_Source
(Related_Nod
)
2056 or else In_Generic_Actual
(Expr
))
2057 and then (Is_Class_Wide_Type
(Etype
(Expr
))
2058 or else Is_Dynamically_Tagged
(Expr
))
2059 and then Is_Tagged_Type
(Typ
)
2060 and then not Is_Class_Wide_Type
(Typ
)
2062 Error_Msg_N
("dynamically tagged expression not allowed!", Expr
);
2064 end Check_Dynamically_Tagged_Expression
;
2066 --------------------------
2067 -- Check_Fully_Declared --
2068 --------------------------
2070 procedure Check_Fully_Declared
(T
: Entity_Id
; N
: Node_Id
) is
2072 if Ekind
(T
) = E_Incomplete_Type
then
2074 -- Ada 2005 (AI-50217): If the type is available through a limited
2075 -- with_clause, verify that its full view has been analyzed.
2077 if From_Limited_With
(T
)
2078 and then Present
(Non_Limited_View
(T
))
2079 and then Ekind
(Non_Limited_View
(T
)) /= E_Incomplete_Type
2081 -- The non-limited view is fully declared
2087 ("premature usage of incomplete}", N
, First_Subtype
(T
));
2090 -- Need comments for these tests ???
2092 elsif Has_Private_Component
(T
)
2093 and then not Is_Generic_Type
(Root_Type
(T
))
2094 and then not In_Spec_Expression
2096 -- Special case: if T is the anonymous type created for a single
2097 -- task or protected object, use the name of the source object.
2099 if Is_Concurrent_Type
(T
)
2100 and then not Comes_From_Source
(T
)
2101 and then Nkind
(N
) = N_Object_Declaration
2104 ("type of& has incomplete component",
2105 N
, Defining_Identifier
(N
));
2108 ("premature usage of incomplete}",
2109 N
, First_Subtype
(T
));
2112 end Check_Fully_Declared
;
2114 -------------------------------------------
2115 -- Check_Function_With_Address_Parameter --
2116 -------------------------------------------
2118 procedure Check_Function_With_Address_Parameter
(Subp_Id
: Entity_Id
) is
2123 F
:= First_Formal
(Subp_Id
);
2124 while Present
(F
) loop
2127 if Is_Private_Type
(T
) and then Present
(Full_View
(T
)) then
2131 if Is_Descendent_Of_Address
(T
) or else Is_Limited_Type
(T
) then
2132 Set_Is_Pure
(Subp_Id
, False);
2138 end Check_Function_With_Address_Parameter
;
2140 -------------------------------------
2141 -- Check_Function_Writable_Actuals --
2142 -------------------------------------
2144 procedure Check_Function_Writable_Actuals
(N
: Node_Id
) is
2145 Writable_Actuals_List
: Elist_Id
:= No_Elist
;
2146 Identifiers_List
: Elist_Id
:= No_Elist
;
2147 Aggr_Error_Node
: Node_Id
:= Empty
;
2148 Error_Node
: Node_Id
:= Empty
;
2150 procedure Collect_Identifiers
(N
: Node_Id
);
2151 -- In a single traversal of subtree N collect in Writable_Actuals_List
2152 -- all the actuals of functions with writable actuals, and in the list
2153 -- Identifiers_List collect all the identifiers that are not actuals of
2154 -- functions with writable actuals. If a writable actual is referenced
2155 -- twice as writable actual then Error_Node is set to reference its
2156 -- second occurrence, the error is reported, and the tree traversal
2159 function Get_Function_Id
(Call
: Node_Id
) return Entity_Id
;
2160 -- Return the entity associated with the function call
2162 procedure Preanalyze_Without_Errors
(N
: Node_Id
);
2163 -- Preanalyze N without reporting errors. Very dubious, you can't just
2164 -- go analyzing things more than once???
2166 -------------------------
2167 -- Collect_Identifiers --
2168 -------------------------
2170 procedure Collect_Identifiers
(N
: Node_Id
) is
2172 function Check_Node
(N
: Node_Id
) return Traverse_Result
;
2173 -- Process a single node during the tree traversal to collect the
2174 -- writable actuals of functions and all the identifiers which are
2175 -- not writable actuals of functions.
2177 function Contains
(List
: Elist_Id
; N
: Node_Id
) return Boolean;
2178 -- Returns True if List has a node whose Entity is Entity (N)
2180 -------------------------
2181 -- Check_Function_Call --
2182 -------------------------
2184 function Check_Node
(N
: Node_Id
) return Traverse_Result
is
2185 Is_Writable_Actual
: Boolean := False;
2189 if Nkind
(N
) = N_Identifier
then
2191 -- No analysis possible if the entity is not decorated
2193 if No
(Entity
(N
)) then
2196 -- Don't collect identifiers of packages, called functions, etc
2198 elsif Ekind_In
(Entity
(N
), E_Package
,
2205 -- For rewritten nodes, continue the traversal in the original
2206 -- subtree. Needed to handle aggregates in original expressions
2207 -- extracted from the tree by Remove_Side_Effects.
2209 elsif Is_Rewrite_Substitution
(N
) then
2210 Collect_Identifiers
(Original_Node
(N
));
2213 -- For now we skip aggregate discriminants, since they require
2214 -- performing the analysis in two phases to identify conflicts:
2215 -- first one analyzing discriminants and second one analyzing
2216 -- the rest of components (since at run time, discriminants are
2217 -- evaluated prior to components): too much computation cost
2218 -- to identify a corner case???
2220 elsif Nkind
(Parent
(N
)) = N_Component_Association
2221 and then Nkind_In
(Parent
(Parent
(N
)),
2223 N_Extension_Aggregate
)
2226 Choice
: constant Node_Id
:= First
(Choices
(Parent
(N
)));
2229 if Ekind
(Entity
(N
)) = E_Discriminant
then
2232 elsif Expression
(Parent
(N
)) = N
2233 and then Nkind
(Choice
) = N_Identifier
2234 and then Ekind
(Entity
(Choice
)) = E_Discriminant
2240 -- Analyze if N is a writable actual of a function
2242 elsif Nkind
(Parent
(N
)) = N_Function_Call
then
2244 Call
: constant Node_Id
:= Parent
(N
);
2249 Id
:= Get_Function_Id
(Call
);
2251 -- In case of previous error, no check is possible
2257 if Ekind_In
(Id
, E_Function
, E_Generic_Function
)
2258 and then Has_Out_Or_In_Out_Parameter
(Id
)
2260 Formal
:= First_Formal
(Id
);
2261 Actual
:= First_Actual
(Call
);
2262 while Present
(Actual
) and then Present
(Formal
) loop
2264 if Ekind_In
(Formal
, E_Out_Parameter
,
2267 Is_Writable_Actual
:= True;
2273 Next_Formal
(Formal
);
2274 Next_Actual
(Actual
);
2280 if Is_Writable_Actual
then
2282 -- Skip checking the error in non-elementary types since
2283 -- RM 6.4.1(6.15/3) is restricted to elementary types, but
2284 -- store this actual in Writable_Actuals_List since it is
2285 -- needed to perform checks on other constructs that have
2286 -- arbitrary order of evaluation (for example, aggregates).
2288 if not Is_Elementary_Type
(Etype
(N
)) then
2289 if not Contains
(Writable_Actuals_List
, N
) then
2290 Append_New_Elmt
(N
, To
=> Writable_Actuals_List
);
2293 -- Second occurrence of an elementary type writable actual
2295 elsif Contains
(Writable_Actuals_List
, N
) then
2297 -- Report the error on the second occurrence of the
2298 -- identifier. We cannot assume that N is the second
2299 -- occurrence (according to their location in the
2300 -- sources), since Traverse_Func walks through Field2
2301 -- last (see comment in the body of Traverse_Func).
2307 Elmt
:= First_Elmt
(Writable_Actuals_List
);
2308 while Present
(Elmt
)
2309 and then Entity
(Node
(Elmt
)) /= Entity
(N
)
2314 if Sloc
(N
) > Sloc
(Node
(Elmt
)) then
2317 Error_Node
:= Node
(Elmt
);
2321 ("value may be affected by call to & "
2322 & "because order of evaluation is arbitrary",
2327 -- First occurrence of a elementary type writable actual
2330 Append_New_Elmt
(N
, To
=> Writable_Actuals_List
);
2334 if Identifiers_List
= No_Elist
then
2335 Identifiers_List
:= New_Elmt_List
;
2338 Append_Unique_Elmt
(N
, Identifiers_List
);
2351 N
: Node_Id
) return Boolean
2353 pragma Assert
(Nkind
(N
) in N_Has_Entity
);
2358 if List
= No_Elist
then
2362 Elmt
:= First_Elmt
(List
);
2363 while Present
(Elmt
) loop
2364 if Entity
(Node
(Elmt
)) = Entity
(N
) then
2378 procedure Do_Traversal
is new Traverse_Proc
(Check_Node
);
2379 -- The traversal procedure
2381 -- Start of processing for Collect_Identifiers
2384 if Present
(Error_Node
) then
2388 if Nkind
(N
) in N_Subexpr
and then Is_OK_Static_Expression
(N
) then
2393 end Collect_Identifiers
;
2395 ---------------------
2396 -- Get_Function_Id --
2397 ---------------------
2399 function Get_Function_Id
(Call
: Node_Id
) return Entity_Id
is
2400 Nam
: constant Node_Id
:= Name
(Call
);
2404 if Nkind
(Nam
) = N_Explicit_Dereference
then
2406 pragma Assert
(Ekind
(Id
) = E_Subprogram_Type
);
2408 elsif Nkind
(Nam
) = N_Selected_Component
then
2409 Id
:= Entity
(Selector_Name
(Nam
));
2411 elsif Nkind
(Nam
) = N_Indexed_Component
then
2412 Id
:= Entity
(Selector_Name
(Prefix
(Nam
)));
2419 end Get_Function_Id
;
2421 -------------------------------
2422 -- Preanalyze_Without_Errors --
2423 -------------------------------
2425 procedure Preanalyze_Without_Errors
(N
: Node_Id
) is
2426 Status
: constant Boolean := Get_Ignore_Errors
;
2428 Set_Ignore_Errors
(True);
2430 Set_Ignore_Errors
(Status
);
2431 end Preanalyze_Without_Errors
;
2433 -- Start of processing for Check_Function_Writable_Actuals
2436 -- The check only applies to Ada 2012 code on which Check_Actuals has
2437 -- been set, and only to constructs that have multiple constituents
2438 -- whose order of evaluation is not specified by the language.
2440 if Ada_Version
< Ada_2012
2441 or else not Check_Actuals
(N
)
2442 or else (not (Nkind
(N
) in N_Op
)
2443 and then not (Nkind
(N
) in N_Membership_Test
)
2444 and then not Nkind_In
(N
, N_Range
,
2446 N_Extension_Aggregate
,
2447 N_Full_Type_Declaration
,
2449 N_Procedure_Call_Statement
,
2450 N_Entry_Call_Statement
))
2451 or else (Nkind
(N
) = N_Full_Type_Declaration
2452 and then not Is_Record_Type
(Defining_Identifier
(N
)))
2454 -- In addition, this check only applies to source code, not to code
2455 -- generated by constraint checks.
2457 or else not Comes_From_Source
(N
)
2462 -- If a construct C has two or more direct constituents that are names
2463 -- or expressions whose evaluation may occur in an arbitrary order, at
2464 -- least one of which contains a function call with an in out or out
2465 -- parameter, then the construct is legal only if: for each name N that
2466 -- is passed as a parameter of mode in out or out to some inner function
2467 -- call C2 (not including the construct C itself), there is no other
2468 -- name anywhere within a direct constituent of the construct C other
2469 -- than the one containing C2, that is known to refer to the same
2470 -- object (RM 6.4.1(6.17/3)).
2474 Collect_Identifiers
(Low_Bound
(N
));
2475 Collect_Identifiers
(High_Bound
(N
));
2477 when N_Op | N_Membership_Test
=>
2482 Collect_Identifiers
(Left_Opnd
(N
));
2484 if Present
(Right_Opnd
(N
)) then
2485 Collect_Identifiers
(Right_Opnd
(N
));
2488 if Nkind_In
(N
, N_In
, N_Not_In
)
2489 and then Present
(Alternatives
(N
))
2491 Expr
:= First
(Alternatives
(N
));
2492 while Present
(Expr
) loop
2493 Collect_Identifiers
(Expr
);
2500 when N_Full_Type_Declaration
=>
2502 function Get_Record_Part
(N
: Node_Id
) return Node_Id
;
2503 -- Return the record part of this record type definition
2505 function Get_Record_Part
(N
: Node_Id
) return Node_Id
is
2506 Type_Def
: constant Node_Id
:= Type_Definition
(N
);
2508 if Nkind
(Type_Def
) = N_Derived_Type_Definition
then
2509 return Record_Extension_Part
(Type_Def
);
2513 end Get_Record_Part
;
2516 Def_Id
: Entity_Id
:= Defining_Identifier
(N
);
2517 Rec
: Node_Id
:= Get_Record_Part
(N
);
2520 -- No need to perform any analysis if the record has no
2523 if No
(Rec
) or else No
(Component_List
(Rec
)) then
2527 -- Collect the identifiers starting from the deepest
2528 -- derivation. Done to report the error in the deepest
2532 if Present
(Component_List
(Rec
)) then
2533 Comp
:= First
(Component_Items
(Component_List
(Rec
)));
2534 while Present
(Comp
) loop
2535 if Nkind
(Comp
) = N_Component_Declaration
2536 and then Present
(Expression
(Comp
))
2538 Collect_Identifiers
(Expression
(Comp
));
2545 exit when No
(Underlying_Type
(Etype
(Def_Id
)))
2546 or else Base_Type
(Underlying_Type
(Etype
(Def_Id
)))
2549 Def_Id
:= Base_Type
(Underlying_Type
(Etype
(Def_Id
)));
2550 Rec
:= Get_Record_Part
(Parent
(Def_Id
));
2554 when N_Subprogram_Call |
2555 N_Entry_Call_Statement
=>
2557 Id
: constant Entity_Id
:= Get_Function_Id
(N
);
2562 Formal
:= First_Formal
(Id
);
2563 Actual
:= First_Actual
(N
);
2564 while Present
(Actual
) and then Present
(Formal
) loop
2565 if Ekind_In
(Formal
, E_Out_Parameter
,
2568 Collect_Identifiers
(Actual
);
2571 Next_Formal
(Formal
);
2572 Next_Actual
(Actual
);
2577 N_Extension_Aggregate
=>
2581 Comp_Expr
: Node_Id
;
2584 -- Handle the N_Others_Choice of array aggregates with static
2585 -- bounds. There is no need to perform this analysis in
2586 -- aggregates without static bounds since we cannot evaluate
2587 -- if the N_Others_Choice covers several elements. There is
2588 -- no need to handle the N_Others choice of record aggregates
2589 -- since at this stage it has been already expanded by
2590 -- Resolve_Record_Aggregate.
2592 if Is_Array_Type
(Etype
(N
))
2593 and then Nkind
(N
) = N_Aggregate
2594 and then Present
(Aggregate_Bounds
(N
))
2595 and then Compile_Time_Known_Bounds
(Etype
(N
))
2596 and then Expr_Value
(High_Bound
(Aggregate_Bounds
(N
)))
2598 Expr_Value
(Low_Bound
(Aggregate_Bounds
(N
)))
2601 Count_Components
: Uint
:= Uint_0
;
2602 Num_Components
: Uint
;
2603 Others_Assoc
: Node_Id
;
2604 Others_Choice
: Node_Id
:= Empty
;
2605 Others_Box_Present
: Boolean := False;
2608 -- Count positional associations
2610 if Present
(Expressions
(N
)) then
2611 Comp_Expr
:= First
(Expressions
(N
));
2612 while Present
(Comp_Expr
) loop
2613 Count_Components
:= Count_Components
+ 1;
2618 -- Count the rest of elements and locate the N_Others
2621 Assoc
:= First
(Component_Associations
(N
));
2622 while Present
(Assoc
) loop
2623 Choice
:= First
(Choices
(Assoc
));
2624 while Present
(Choice
) loop
2625 if Nkind
(Choice
) = N_Others_Choice
then
2626 Others_Assoc
:= Assoc
;
2627 Others_Choice
:= Choice
;
2628 Others_Box_Present
:= Box_Present
(Assoc
);
2630 -- Count several components
2632 elsif Nkind_In
(Choice
, N_Range
,
2633 N_Subtype_Indication
)
2634 or else (Is_Entity_Name
(Choice
)
2635 and then Is_Type
(Entity
(Choice
)))
2640 Get_Index_Bounds
(Choice
, L
, H
);
2642 (Compile_Time_Known_Value
(L
)
2643 and then Compile_Time_Known_Value
(H
));
2646 + Expr_Value
(H
) - Expr_Value
(L
) + 1;
2649 -- Count single component. No other case available
2650 -- since we are handling an aggregate with static
2654 pragma Assert
(Is_OK_Static_Expression
(Choice
)
2655 or else Nkind
(Choice
) = N_Identifier
2656 or else Nkind
(Choice
) = N_Integer_Literal
);
2658 Count_Components
:= Count_Components
+ 1;
2668 Expr_Value
(High_Bound
(Aggregate_Bounds
(N
))) -
2669 Expr_Value
(Low_Bound
(Aggregate_Bounds
(N
))) + 1;
2671 pragma Assert
(Count_Components
<= Num_Components
);
2673 -- Handle the N_Others choice if it covers several
2676 if Present
(Others_Choice
)
2677 and then (Num_Components
- Count_Components
) > 1
2679 if not Others_Box_Present
then
2681 -- At this stage, if expansion is active, the
2682 -- expression of the others choice has not been
2683 -- analyzed. Hence we generate a duplicate and
2684 -- we analyze it silently to have available the
2685 -- minimum decoration required to collect the
2688 if not Expander_Active
then
2689 Comp_Expr
:= Expression
(Others_Assoc
);
2692 New_Copy_Tree
(Expression
(Others_Assoc
));
2693 Preanalyze_Without_Errors
(Comp_Expr
);
2696 Collect_Identifiers
(Comp_Expr
);
2698 if Writable_Actuals_List
/= No_Elist
then
2700 -- As suggested by Robert, at current stage we
2701 -- report occurrences of this case as warnings.
2704 ("writable function parameter may affect "
2705 & "value in other component because order "
2706 & "of evaluation is unspecified??",
2707 Node
(First_Elmt
(Writable_Actuals_List
)));
2713 -- For an array aggregate, a discrete_choice_list that has
2714 -- a nonstatic range is considered as two or more separate
2715 -- occurrences of the expression (RM 6.4.1(20/3)).
2717 elsif Is_Array_Type
(Etype
(N
))
2718 and then Nkind
(N
) = N_Aggregate
2719 and then Present
(Aggregate_Bounds
(N
))
2720 and then not Compile_Time_Known_Bounds
(Etype
(N
))
2722 -- Collect identifiers found in the dynamic bounds
2725 Count_Components
: Natural := 0;
2726 Low
, High
: Node_Id
;
2729 Assoc
:= First
(Component_Associations
(N
));
2730 while Present
(Assoc
) loop
2731 Choice
:= First
(Choices
(Assoc
));
2732 while Present
(Choice
) loop
2733 if Nkind_In
(Choice
, N_Range
,
2734 N_Subtype_Indication
)
2735 or else (Is_Entity_Name
(Choice
)
2736 and then Is_Type
(Entity
(Choice
)))
2738 Get_Index_Bounds
(Choice
, Low
, High
);
2740 if not Compile_Time_Known_Value
(Low
) then
2741 Collect_Identifiers
(Low
);
2743 if No
(Aggr_Error_Node
) then
2744 Aggr_Error_Node
:= Low
;
2748 if not Compile_Time_Known_Value
(High
) then
2749 Collect_Identifiers
(High
);
2751 if No
(Aggr_Error_Node
) then
2752 Aggr_Error_Node
:= High
;
2756 -- The RM rule is violated if there is more than
2757 -- a single choice in a component association.
2760 Count_Components
:= Count_Components
+ 1;
2762 if No
(Aggr_Error_Node
)
2763 and then Count_Components
> 1
2765 Aggr_Error_Node
:= Choice
;
2768 if not Compile_Time_Known_Value
(Choice
) then
2769 Collect_Identifiers
(Choice
);
2781 -- Handle ancestor part of extension aggregates
2783 if Nkind
(N
) = N_Extension_Aggregate
then
2784 Collect_Identifiers
(Ancestor_Part
(N
));
2787 -- Handle positional associations
2789 if Present
(Expressions
(N
)) then
2790 Comp_Expr
:= First
(Expressions
(N
));
2791 while Present
(Comp_Expr
) loop
2792 if not Is_OK_Static_Expression
(Comp_Expr
) then
2793 Collect_Identifiers
(Comp_Expr
);
2800 -- Handle discrete associations
2802 if Present
(Component_Associations
(N
)) then
2803 Assoc
:= First
(Component_Associations
(N
));
2804 while Present
(Assoc
) loop
2806 if not Box_Present
(Assoc
) then
2807 Choice
:= First
(Choices
(Assoc
));
2808 while Present
(Choice
) loop
2810 -- For now we skip discriminants since it requires
2811 -- performing the analysis in two phases: first one
2812 -- analyzing discriminants and second one analyzing
2813 -- the rest of components since discriminants are
2814 -- evaluated prior to components: too much extra
2815 -- work to detect a corner case???
2817 if Nkind
(Choice
) in N_Has_Entity
2818 and then Present
(Entity
(Choice
))
2819 and then Ekind
(Entity
(Choice
)) = E_Discriminant
2823 elsif Box_Present
(Assoc
) then
2827 if not Analyzed
(Expression
(Assoc
)) then
2829 New_Copy_Tree
(Expression
(Assoc
));
2830 Set_Parent
(Comp_Expr
, Parent
(N
));
2831 Preanalyze_Without_Errors
(Comp_Expr
);
2833 Comp_Expr
:= Expression
(Assoc
);
2836 Collect_Identifiers
(Comp_Expr
);
2852 -- No further action needed if we already reported an error
2854 if Present
(Error_Node
) then
2858 -- Check violation of RM 6.20/3 in aggregates
2860 if Present
(Aggr_Error_Node
)
2861 and then Writable_Actuals_List
/= No_Elist
2864 ("value may be affected by call in other component because they "
2865 & "are evaluated in unspecified order",
2866 Node
(First_Elmt
(Writable_Actuals_List
)));
2870 -- Check if some writable argument of a function is referenced
2872 if Writable_Actuals_List
/= No_Elist
2873 and then Identifiers_List
/= No_Elist
2880 Elmt_1
:= First_Elmt
(Writable_Actuals_List
);
2881 while Present
(Elmt_1
) loop
2882 Elmt_2
:= First_Elmt
(Identifiers_List
);
2883 while Present
(Elmt_2
) loop
2884 if Entity
(Node
(Elmt_1
)) = Entity
(Node
(Elmt_2
)) then
2885 case Nkind
(Parent
(Node
(Elmt_2
))) is
2887 N_Component_Association |
2888 N_Component_Declaration
=>
2890 ("value may be affected by call in other "
2891 & "component because they are evaluated "
2892 & "in unspecified order",
2895 when N_In | N_Not_In
=>
2897 ("value may be affected by call in other "
2898 & "alternative because they are evaluated "
2899 & "in unspecified order",
2904 ("value of actual may be affected by call in "
2905 & "other actual because they are evaluated "
2906 & "in unspecified order",
2918 end Check_Function_Writable_Actuals
;
2920 --------------------------------
2921 -- Check_Implicit_Dereference --
2922 --------------------------------
2924 procedure Check_Implicit_Dereference
(N
: Node_Id
; Typ
: Entity_Id
) is
2930 if Nkind
(N
) = N_Indexed_Component
2931 and then Present
(Generalized_Indexing
(N
))
2933 Nam
:= Generalized_Indexing
(N
);
2938 if Ada_Version
< Ada_2012
2939 or else not Has_Implicit_Dereference
(Base_Type
(Typ
))
2943 elsif not Comes_From_Source
(N
)
2944 and then Nkind
(N
) /= N_Indexed_Component
2948 elsif Is_Entity_Name
(Nam
) and then Is_Type
(Entity
(Nam
)) then
2952 Disc
:= First_Discriminant
(Typ
);
2953 while Present
(Disc
) loop
2954 if Has_Implicit_Dereference
(Disc
) then
2955 Desig
:= Designated_Type
(Etype
(Disc
));
2956 Add_One_Interp
(Nam
, Disc
, Desig
);
2958 -- If the node is a generalized indexing, add interpretation
2959 -- to that node as well, for subsequent resolution.
2961 if Nkind
(N
) = N_Indexed_Component
then
2962 Add_One_Interp
(N
, Disc
, Desig
);
2965 -- If the operation comes from a generic unit and the context
2966 -- is a selected component, the selector name may be global
2967 -- and set in the instance already. Remove the entity to
2968 -- force resolution of the selected component, and the
2969 -- generation of an explicit dereference if needed.
2972 and then Nkind
(Parent
(Nam
)) = N_Selected_Component
2974 Set_Entity
(Selector_Name
(Parent
(Nam
)), Empty
);
2980 Next_Discriminant
(Disc
);
2983 end Check_Implicit_Dereference
;
2985 ----------------------------------
2986 -- Check_Internal_Protected_Use --
2987 ----------------------------------
2989 procedure Check_Internal_Protected_Use
(N
: Node_Id
; Nam
: Entity_Id
) is
2995 while Present
(S
) loop
2996 if S
= Standard_Standard
then
2999 elsif Ekind
(S
) = E_Function
3000 and then Ekind
(Scope
(S
)) = E_Protected_Type
3009 if Scope
(Nam
) = Prot
and then Ekind
(Nam
) /= E_Function
then
3011 -- An indirect function call (e.g. a callback within a protected
3012 -- function body) is not statically illegal. If the access type is
3013 -- anonymous and is the type of an access parameter, the scope of Nam
3014 -- will be the protected type, but it is not a protected operation.
3016 if Ekind
(Nam
) = E_Subprogram_Type
3018 Nkind
(Associated_Node_For_Itype
(Nam
)) = N_Function_Specification
3022 elsif Nkind
(N
) = N_Subprogram_Renaming_Declaration
then
3024 ("within protected function cannot use protected "
3025 & "procedure in renaming or as generic actual", N
);
3027 elsif Nkind
(N
) = N_Attribute_Reference
then
3029 ("within protected function cannot take access of "
3030 & " protected procedure", N
);
3034 ("within protected function, protected object is constant", N
);
3036 ("\cannot call operation that may modify it", N
);
3039 end Check_Internal_Protected_Use
;
3041 ---------------------------------------
3042 -- Check_Later_Vs_Basic_Declarations --
3043 ---------------------------------------
3045 procedure Check_Later_Vs_Basic_Declarations
3047 During_Parsing
: Boolean)
3049 Body_Sloc
: Source_Ptr
;
3052 function Is_Later_Declarative_Item
(Decl
: Node_Id
) return Boolean;
3053 -- Return whether Decl is considered as a declarative item.
3054 -- When During_Parsing is True, the semantics of Ada 83 is followed.
3055 -- When During_Parsing is False, the semantics of SPARK is followed.
3057 -------------------------------
3058 -- Is_Later_Declarative_Item --
3059 -------------------------------
3061 function Is_Later_Declarative_Item
(Decl
: Node_Id
) return Boolean is
3063 if Nkind
(Decl
) in N_Later_Decl_Item
then
3066 elsif Nkind
(Decl
) = N_Pragma
then
3069 elsif During_Parsing
then
3072 -- In SPARK, a package declaration is not considered as a later
3073 -- declarative item.
3075 elsif Nkind
(Decl
) = N_Package_Declaration
then
3078 -- In SPARK, a renaming is considered as a later declarative item
3080 elsif Nkind
(Decl
) in N_Renaming_Declaration
then
3086 end Is_Later_Declarative_Item
;
3088 -- Start of processing for Check_Later_Vs_Basic_Declarations
3091 Decl
:= First
(Decls
);
3093 -- Loop through sequence of basic declarative items
3095 Outer
: while Present
(Decl
) loop
3096 if not Nkind_In
(Decl
, N_Subprogram_Body
, N_Package_Body
, N_Task_Body
)
3097 and then Nkind
(Decl
) not in N_Body_Stub
3101 -- Once a body is encountered, we only allow later declarative
3102 -- items. The inner loop checks the rest of the list.
3105 Body_Sloc
:= Sloc
(Decl
);
3107 Inner
: while Present
(Decl
) loop
3108 if not Is_Later_Declarative_Item
(Decl
) then
3109 if During_Parsing
then
3110 if Ada_Version
= Ada_83
then
3111 Error_Msg_Sloc
:= Body_Sloc
;
3113 ("(Ada 83) decl cannot appear after body#", Decl
);
3116 Error_Msg_Sloc
:= Body_Sloc
;
3117 Check_SPARK_05_Restriction
3118 ("decl cannot appear after body#", Decl
);
3126 end Check_Later_Vs_Basic_Declarations
;
3128 ---------------------------
3129 -- Check_No_Hidden_State --
3130 ---------------------------
3132 procedure Check_No_Hidden_State
(Id
: Entity_Id
) is
3133 function Has_Null_Abstract_State
(Pkg
: Entity_Id
) return Boolean;
3134 -- Determine whether the entity of a package denoted by Pkg has a null
3137 -----------------------------
3138 -- Has_Null_Abstract_State --
3139 -----------------------------
3141 function Has_Null_Abstract_State
(Pkg
: Entity_Id
) return Boolean is
3142 States
: constant Elist_Id
:= Abstract_States
(Pkg
);
3145 -- Check first available state of related package. A null abstract
3146 -- state always appears as the sole element of the state list.
3150 and then Is_Null_State
(Node
(First_Elmt
(States
)));
3151 end Has_Null_Abstract_State
;
3155 Context
: Entity_Id
:= Empty
;
3156 Not_Visible
: Boolean := False;
3159 -- Start of processing for Check_No_Hidden_State
3162 pragma Assert
(Ekind_In
(Id
, E_Abstract_State
, E_Variable
));
3164 -- Find the proper context where the object or state appears
3167 while Present
(Scop
) loop
3170 -- Keep track of the context's visibility
3172 Not_Visible
:= Not_Visible
or else In_Private_Part
(Context
);
3174 -- Prevent the search from going too far
3176 if Context
= Standard_Standard
then
3179 -- Objects and states that appear immediately within a subprogram or
3180 -- inside a construct nested within a subprogram do not introduce a
3181 -- hidden state. They behave as local variable declarations.
3183 elsif Is_Subprogram
(Context
) then
3186 -- When examining a package body, use the entity of the spec as it
3187 -- carries the abstract state declarations.
3189 elsif Ekind
(Context
) = E_Package_Body
then
3190 Context
:= Spec_Entity
(Context
);
3193 -- Stop the traversal when a package subject to a null abstract state
3196 if Ekind_In
(Context
, E_Generic_Package
, E_Package
)
3197 and then Has_Null_Abstract_State
(Context
)
3202 Scop
:= Scope
(Scop
);
3205 -- At this point we know that there is at least one package with a null
3206 -- abstract state in visibility. Emit an error message unconditionally
3207 -- if the entity being processed is a state because the placement of the
3208 -- related package is irrelevant. This is not the case for objects as
3209 -- the intermediate context matters.
3211 if Present
(Context
)
3212 and then (Ekind
(Id
) = E_Abstract_State
or else Not_Visible
)
3214 Error_Msg_N
("cannot introduce hidden state &", Id
);
3215 Error_Msg_NE
("\package & has null abstract state", Id
, Context
);
3217 end Check_No_Hidden_State
;
3219 ----------------------------------------
3220 -- Check_Nonvolatile_Function_Profile --
3221 ----------------------------------------
3223 procedure Check_Nonvolatile_Function_Profile
(Func_Id
: Entity_Id
) is
3227 -- Inspect all formal parameters
3229 Formal
:= First_Formal
(Func_Id
);
3230 while Present
(Formal
) loop
3231 if Is_Effectively_Volatile
(Etype
(Formal
)) then
3233 ("nonvolatile function & cannot have a volatile parameter",
3237 Next_Formal
(Formal
);
3240 -- Inspect the return type
3242 if Is_Effectively_Volatile
(Etype
(Func_Id
)) then
3244 ("nonvolatile function & cannot have a volatile return type",
3245 Result_Definition
(Parent
(Func_Id
)), Func_Id
);
3247 end Check_Nonvolatile_Function_Profile
;
3249 ------------------------------------------
3250 -- Check_Potentially_Blocking_Operation --
3251 ------------------------------------------
3253 procedure Check_Potentially_Blocking_Operation
(N
: Node_Id
) is
3257 -- N is one of the potentially blocking operations listed in 9.5.1(8).
3258 -- When pragma Detect_Blocking is active, the run time will raise
3259 -- Program_Error. Here we only issue a warning, since we generally
3260 -- support the use of potentially blocking operations in the absence
3263 -- Indirect blocking through a subprogram call cannot be diagnosed
3264 -- statically without interprocedural analysis, so we do not attempt
3267 S
:= Scope
(Current_Scope
);
3268 while Present
(S
) and then S
/= Standard_Standard
loop
3269 if Is_Protected_Type
(S
) then
3271 ("potentially blocking operation in protected operation??", N
);
3277 end Check_Potentially_Blocking_Operation
;
3279 ---------------------------------
3280 -- Check_Result_And_Post_State --
3281 ---------------------------------
3283 procedure Check_Result_And_Post_State
(Subp_Id
: Entity_Id
) is
3284 procedure Check_Result_And_Post_State_In_Pragma
3286 Result_Seen
: in out Boolean);
3287 -- Determine whether pragma Prag mentions attribute 'Result and whether
3288 -- the pragma contains an expression that evaluates differently in pre-
3289 -- and post-state. Prag is a [refined] postcondition or a contract-cases
3290 -- pragma. Result_Seen is set when the pragma mentions attribute 'Result
3292 function Has_In_Out_Parameter
(Subp_Id
: Entity_Id
) return Boolean;
3293 -- Determine whether subprogram Subp_Id contains at least one IN OUT
3294 -- formal parameter.
3296 -------------------------------------------
3297 -- Check_Result_And_Post_State_In_Pragma --
3298 -------------------------------------------
3300 procedure Check_Result_And_Post_State_In_Pragma
3302 Result_Seen
: in out Boolean)
3304 procedure Check_Expression
(Expr
: Node_Id
);
3305 -- Perform the 'Result and post-state checks on a given expression
3307 function Is_Function_Result
(N
: Node_Id
) return Traverse_Result
;
3308 -- Attempt to find attribute 'Result in a subtree denoted by N
3310 function Is_Trivial_Boolean
(N
: Node_Id
) return Boolean;
3311 -- Determine whether source node N denotes "True" or "False"
3313 function Mentions_Post_State
(N
: Node_Id
) return Boolean;
3314 -- Determine whether a subtree denoted by N mentions any construct
3315 -- that denotes a post-state.
3317 procedure Check_Function_Result
is
3318 new Traverse_Proc
(Is_Function_Result
);
3320 ----------------------
3321 -- Check_Expression --
3322 ----------------------
3324 procedure Check_Expression
(Expr
: Node_Id
) is
3326 if not Is_Trivial_Boolean
(Expr
) then
3327 Check_Function_Result
(Expr
);
3329 if not Mentions_Post_State
(Expr
) then
3330 if Pragma_Name
(Prag
) = Name_Contract_Cases
then
3332 ("contract case does not check the outcome of calling "
3333 & "&?T?", Expr
, Subp_Id
);
3335 elsif Pragma_Name
(Prag
) = Name_Refined_Post
then
3337 ("refined postcondition does not check the outcome of "
3338 & "calling &?T?", Prag
, Subp_Id
);
3342 ("postcondition does not check the outcome of calling "
3343 & "&?T?", Prag
, Subp_Id
);
3347 end Check_Expression
;
3349 ------------------------
3350 -- Is_Function_Result --
3351 ------------------------
3353 function Is_Function_Result
(N
: Node_Id
) return Traverse_Result
is
3355 if Is_Attribute_Result
(N
) then
3356 Result_Seen
:= True;
3359 -- Continue the traversal
3364 end Is_Function_Result
;
3366 ------------------------
3367 -- Is_Trivial_Boolean --
3368 ------------------------
3370 function Is_Trivial_Boolean
(N
: Node_Id
) return Boolean is
3373 Comes_From_Source
(N
)
3374 and then Is_Entity_Name
(N
)
3375 and then (Entity
(N
) = Standard_True
3377 Entity
(N
) = Standard_False
);
3378 end Is_Trivial_Boolean
;
3380 -------------------------
3381 -- Mentions_Post_State --
3382 -------------------------
3384 function Mentions_Post_State
(N
: Node_Id
) return Boolean is
3385 Post_State_Seen
: Boolean := False;
3387 function Is_Post_State
(N
: Node_Id
) return Traverse_Result
;
3388 -- Attempt to find a construct that denotes a post-state. If this
3389 -- is the case, set flag Post_State_Seen.
3395 function Is_Post_State
(N
: Node_Id
) return Traverse_Result
is
3399 if Nkind_In
(N
, N_Explicit_Dereference
, N_Function_Call
) then
3400 Post_State_Seen
:= True;
3403 elsif Nkind_In
(N
, N_Expanded_Name
, N_Identifier
) then
3406 -- The entity may be modifiable through an implicit
3410 or else Ekind
(Ent
) in Assignable_Kind
3411 or else (Is_Access_Type
(Etype
(Ent
))
3412 and then Nkind
(Parent
(N
)) =
3413 N_Selected_Component
)
3415 Post_State_Seen
:= True;
3419 elsif Nkind
(N
) = N_Attribute_Reference
then
3420 if Attribute_Name
(N
) = Name_Old
then
3423 elsif Attribute_Name
(N
) = Name_Result
then
3424 Post_State_Seen
:= True;
3432 procedure Find_Post_State
is new Traverse_Proc
(Is_Post_State
);
3434 -- Start of processing for Mentions_Post_State
3437 Find_Post_State
(N
);
3439 return Post_State_Seen
;
3440 end Mentions_Post_State
;
3444 Expr
: constant Node_Id
:=
3446 (First
(Pragma_Argument_Associations
(Prag
)));
3447 Nam
: constant Name_Id
:= Pragma_Name
(Prag
);
3450 -- Start of processing for Check_Result_And_Post_State_In_Pragma
3453 -- Examine all consequences
3455 if Nam
= Name_Contract_Cases
then
3456 CCase
:= First
(Component_Associations
(Expr
));
3457 while Present
(CCase
) loop
3458 Check_Expression
(Expression
(CCase
));
3463 -- Examine the expression of a postcondition
3465 else pragma Assert
(Nam_In
(Nam
, Name_Postcondition
,
3466 Name_Refined_Post
));
3467 Check_Expression
(Expr
);
3469 end Check_Result_And_Post_State_In_Pragma
;
3471 --------------------------
3472 -- Has_In_Out_Parameter --
3473 --------------------------
3475 function Has_In_Out_Parameter
(Subp_Id
: Entity_Id
) return Boolean is
3479 -- Traverse the formals looking for an IN OUT parameter
3481 Formal
:= First_Formal
(Subp_Id
);
3482 while Present
(Formal
) loop
3483 if Ekind
(Formal
) = E_In_Out_Parameter
then
3487 Next_Formal
(Formal
);
3491 end Has_In_Out_Parameter
;
3495 Items
: constant Node_Id
:= Contract
(Subp_Id
);
3496 Subp_Decl
: constant Node_Id
:= Unit_Declaration_Node
(Subp_Id
);
3497 Case_Prag
: Node_Id
:= Empty
;
3498 Post_Prag
: Node_Id
:= Empty
;
3500 Seen_In_Case
: Boolean := False;
3501 Seen_In_Post
: Boolean := False;
3502 Spec_Id
: Entity_Id
;
3504 -- Start of processing for Check_Result_And_Post_State
3507 -- The lack of attribute 'Result or a post-state is classified as a
3508 -- suspicious contract. Do not perform the check if the corresponding
3509 -- swich is not set.
3511 if not Warn_On_Suspicious_Contract
then
3514 -- Nothing to do if there is no contract
3516 elsif No
(Items
) then
3520 -- Retrieve the entity of the subprogram spec (if any)
3522 if Nkind
(Subp_Decl
) = N_Subprogram_Body
3523 and then Present
(Corresponding_Spec
(Subp_Decl
))
3525 Spec_Id
:= Corresponding_Spec
(Subp_Decl
);
3527 elsif Nkind
(Subp_Decl
) = N_Subprogram_Body_Stub
3528 and then Present
(Corresponding_Spec_Of_Stub
(Subp_Decl
))
3530 Spec_Id
:= Corresponding_Spec_Of_Stub
(Subp_Decl
);
3536 -- Examine all postconditions for attribute 'Result and a post-state
3538 Prag
:= Pre_Post_Conditions
(Items
);
3539 while Present
(Prag
) loop
3540 if Nam_In
(Pragma_Name
(Prag
), Name_Postcondition
,
3542 and then not Error_Posted
(Prag
)
3545 Check_Result_And_Post_State_In_Pragma
(Prag
, Seen_In_Post
);
3548 Prag
:= Next_Pragma
(Prag
);
3551 -- Examine the contract cases of the subprogram for attribute 'Result
3552 -- and a post-state.
3554 Prag
:= Contract_Test_Cases
(Items
);
3555 while Present
(Prag
) loop
3556 if Pragma_Name
(Prag
) = Name_Contract_Cases
3557 and then not Error_Posted
(Prag
)
3560 Check_Result_And_Post_State_In_Pragma
(Prag
, Seen_In_Case
);
3563 Prag
:= Next_Pragma
(Prag
);
3566 -- Do not emit any errors if the subprogram is not a function
3568 if not Ekind_In
(Spec_Id
, E_Function
, E_Generic_Function
) then
3571 -- Regardless of whether the function has postconditions or contract
3572 -- cases, or whether they mention attribute 'Result, an IN OUT formal
3573 -- parameter is always treated as a result.
3575 elsif Has_In_Out_Parameter
(Spec_Id
) then
3578 -- The function has both a postcondition and contract cases and they do
3579 -- not mention attribute 'Result.
3581 elsif Present
(Case_Prag
)
3582 and then not Seen_In_Case
3583 and then Present
(Post_Prag
)
3584 and then not Seen_In_Post
3587 ("neither postcondition nor contract cases mention function "
3588 & "result?T?", Post_Prag
);
3590 -- The function has contract cases only and they do not mention
3591 -- attribute 'Result.
3593 elsif Present
(Case_Prag
) and then not Seen_In_Case
then
3594 Error_Msg_N
("contract cases do not mention result?T?", Case_Prag
);
3596 -- The function has postconditions only and they do not mention
3597 -- attribute 'Result.
3599 elsif Present
(Post_Prag
) and then not Seen_In_Post
then
3601 ("postcondition does not mention function result?T?", Post_Prag
);
3603 end Check_Result_And_Post_State
;
3605 ------------------------------
3606 -- Check_Unprotected_Access --
3607 ------------------------------
3609 procedure Check_Unprotected_Access
3613 Cont_Encl_Typ
: Entity_Id
;
3614 Pref_Encl_Typ
: Entity_Id
;
3616 function Enclosing_Protected_Type
(Obj
: Node_Id
) return Entity_Id
;
3617 -- Check whether Obj is a private component of a protected object.
3618 -- Return the protected type where the component resides, Empty
3621 function Is_Public_Operation
return Boolean;
3622 -- Verify that the enclosing operation is callable from outside the
3623 -- protected object, to minimize false positives.
3625 ------------------------------
3626 -- Enclosing_Protected_Type --
3627 ------------------------------
3629 function Enclosing_Protected_Type
(Obj
: Node_Id
) return Entity_Id
is
3631 if Is_Entity_Name
(Obj
) then
3633 Ent
: Entity_Id
:= Entity
(Obj
);
3636 -- The object can be a renaming of a private component, use
3637 -- the original record component.
3639 if Is_Prival
(Ent
) then
3640 Ent
:= Prival_Link
(Ent
);
3643 if Is_Protected_Type
(Scope
(Ent
)) then
3649 -- For indexed and selected components, recursively check the prefix
3651 if Nkind_In
(Obj
, N_Indexed_Component
, N_Selected_Component
) then
3652 return Enclosing_Protected_Type
(Prefix
(Obj
));
3654 -- The object does not denote a protected component
3659 end Enclosing_Protected_Type
;
3661 -------------------------
3662 -- Is_Public_Operation --
3663 -------------------------
3665 function Is_Public_Operation
return Boolean is
3671 while Present
(S
) and then S
/= Pref_Encl_Typ
loop
3672 if Scope
(S
) = Pref_Encl_Typ
then
3673 E
:= First_Entity
(Pref_Encl_Typ
);
3675 and then E
/= First_Private_Entity
(Pref_Encl_Typ
)
3689 end Is_Public_Operation
;
3691 -- Start of processing for Check_Unprotected_Access
3694 if Nkind
(Expr
) = N_Attribute_Reference
3695 and then Attribute_Name
(Expr
) = Name_Unchecked_Access
3697 Cont_Encl_Typ
:= Enclosing_Protected_Type
(Context
);
3698 Pref_Encl_Typ
:= Enclosing_Protected_Type
(Prefix
(Expr
));
3700 -- Check whether we are trying to export a protected component to a
3701 -- context with an equal or lower access level.
3703 if Present
(Pref_Encl_Typ
)
3704 and then No
(Cont_Encl_Typ
)
3705 and then Is_Public_Operation
3706 and then Scope_Depth
(Pref_Encl_Typ
) >=
3707 Object_Access_Level
(Context
)
3710 ("??possible unprotected access to protected data", Expr
);
3713 end Check_Unprotected_Access
;
3715 ------------------------------
3716 -- Check_Unused_Body_States --
3717 ------------------------------
3719 procedure Check_Unused_Body_States
(Body_Id
: Entity_Id
) is
3720 procedure Process_Refinement_Clause
3723 -- Inspect all constituents of refinement clause Clause and remove any
3724 -- matches from body state list States.
3726 procedure Report_Unused_Body_States
(States
: Elist_Id
);
3727 -- Emit errors for each abstract state or object found in list States
3729 -------------------------------
3730 -- Process_Refinement_Clause --
3731 -------------------------------
3733 procedure Process_Refinement_Clause
3737 procedure Process_Constituent
(Constit
: Node_Id
);
3738 -- Remove constituent Constit from body state list States
3740 -------------------------
3741 -- Process_Constituent --
3742 -------------------------
3744 procedure Process_Constituent
(Constit
: Node_Id
) is
3745 Constit_Id
: Entity_Id
;
3748 -- Guard against illegal constituents. Only abstract states and
3749 -- objects can appear on the right hand side of a refinement.
3751 if Is_Entity_Name
(Constit
) then
3752 Constit_Id
:= Entity_Of
(Constit
);
3754 if Present
(Constit_Id
)
3755 and then Ekind_In
(Constit_Id
, E_Abstract_State
,
3759 Remove
(States
, Constit_Id
);
3762 end Process_Constituent
;
3768 -- Start of processing for Process_Refinement_Clause
3771 if Nkind
(Clause
) = N_Component_Association
then
3772 Constit
:= Expression
(Clause
);
3774 -- Multiple constituents appear as an aggregate
3776 if Nkind
(Constit
) = N_Aggregate
then
3777 Constit
:= First
(Expressions
(Constit
));
3778 while Present
(Constit
) loop
3779 Process_Constituent
(Constit
);
3783 -- Various forms of a single constituent
3786 Process_Constituent
(Constit
);
3789 end Process_Refinement_Clause
;
3791 -------------------------------
3792 -- Report_Unused_Body_States --
3793 -------------------------------
3795 procedure Report_Unused_Body_States
(States
: Elist_Id
) is
3796 Posted
: Boolean := False;
3797 State_Elmt
: Elmt_Id
;
3798 State_Id
: Entity_Id
;
3801 if Present
(States
) then
3802 State_Elmt
:= First_Elmt
(States
);
3803 while Present
(State_Elmt
) loop
3804 State_Id
:= Node
(State_Elmt
);
3806 -- Constants are part of the hidden state of a package, but the
3807 -- compiler cannot determine whether they have variable input
3808 -- (SPARK RM 7.1.1(2)) and cannot classify them properly as a
3809 -- hidden state. Do not emit an error when a constant does not
3810 -- participate in a state refinement, even though it acts as a
3813 if Ekind
(State_Id
) = E_Constant
then
3816 -- Generate an error message of the form:
3818 -- body of package ... has unused hidden states
3819 -- abstract state ... defined at ...
3820 -- variable ... defined at ...
3826 ("body of package & has unused hidden states", Body_Id
);
3829 Error_Msg_Sloc
:= Sloc
(State_Id
);
3831 if Ekind
(State_Id
) = E_Abstract_State
then
3833 ("\abstract state & defined #", Body_Id
, State_Id
);
3836 SPARK_Msg_NE
("\variable & defined #", Body_Id
, State_Id
);
3840 Next_Elmt
(State_Elmt
);
3843 end Report_Unused_Body_States
;
3847 Prag
: constant Node_Id
:= Get_Pragma
(Body_Id
, Pragma_Refined_State
);
3848 Spec_Id
: constant Entity_Id
:= Spec_Entity
(Body_Id
);
3852 -- Start of processing for Check_Unused_Body_States
3855 -- Inspect the clauses of pragma Refined_State and determine whether all
3856 -- visible states declared within the package body participate in the
3859 if Present
(Prag
) then
3860 Clause
:= Expression
(Get_Argument
(Prag
, Spec_Id
));
3861 States
:= Collect_Body_States
(Body_Id
);
3863 -- Multiple non-null state refinements appear as an aggregate
3865 if Nkind
(Clause
) = N_Aggregate
then
3866 Clause
:= First
(Component_Associations
(Clause
));
3867 while Present
(Clause
) loop
3868 Process_Refinement_Clause
(Clause
, States
);
3872 -- Various forms of a single state refinement
3875 Process_Refinement_Clause
(Clause
, States
);
3878 -- Ensure that all abstract states and objects declared in the
3879 -- package body state space are utilized as constituents.
3881 Report_Unused_Body_States
(States
);
3883 end Check_Unused_Body_States
;
3885 -------------------------
3886 -- Collect_Body_States --
3887 -------------------------
3889 function Collect_Body_States
(Body_Id
: Entity_Id
) return Elist_Id
is
3890 function Is_Visible_Object
(Obj_Id
: Entity_Id
) return Boolean;
3891 -- Determine whether object Obj_Id is a suitable visible state of a
3894 procedure Collect_Visible_States
3895 (Pack_Id
: Entity_Id
;
3896 States
: in out Elist_Id
);
3897 -- Gather the entities of all abstract states and objects declared in
3898 -- the visible state space of package Pack_Id.
3900 ----------------------------
3901 -- Collect_Visible_States --
3902 ----------------------------
3904 procedure Collect_Visible_States
3905 (Pack_Id
: Entity_Id
;
3906 States
: in out Elist_Id
)
3908 Item_Id
: Entity_Id
;
3911 -- Traverse the entity chain of the package and inspect all visible
3914 Item_Id
:= First_Entity
(Pack_Id
);
3915 while Present
(Item_Id
) and then not In_Private_Part
(Item_Id
) loop
3917 -- Do not consider internally generated items as those cannot be
3918 -- named and participate in refinement.
3920 if not Comes_From_Source
(Item_Id
) then
3923 elsif Ekind
(Item_Id
) = E_Abstract_State
then
3924 Append_New_Elmt
(Item_Id
, States
);
3926 elsif Ekind_In
(Item_Id
, E_Constant
, E_Variable
)
3927 and then Is_Visible_Object
(Item_Id
)
3929 Append_New_Elmt
(Item_Id
, States
);
3931 -- Recursively gather the visible states of a nested package
3933 elsif Ekind
(Item_Id
) = E_Package
then
3934 Collect_Visible_States
(Item_Id
, States
);
3937 Next_Entity
(Item_Id
);
3939 end Collect_Visible_States
;
3941 -----------------------
3942 -- Is_Visible_Object --
3943 -----------------------
3945 function Is_Visible_Object
(Obj_Id
: Entity_Id
) return Boolean is
3947 -- Objects that map generic formals to their actuals are not visible
3948 -- from outside the generic instantiation.
3950 if Present
(Corresponding_Generic_Association
3951 (Declaration_Node
(Obj_Id
)))
3955 -- Constituents of a single protected/task type act as components of
3956 -- the type and are not visible from outside the type.
3958 elsif Ekind
(Obj_Id
) = E_Variable
3959 and then Present
(Encapsulating_State
(Obj_Id
))
3960 and then Is_Single_Concurrent_Object
(Encapsulating_State
(Obj_Id
))
3967 end Is_Visible_Object
;
3971 Body_Decl
: constant Node_Id
:= Unit_Declaration_Node
(Body_Id
);
3973 Item_Id
: Entity_Id
;
3974 States
: Elist_Id
:= No_Elist
;
3976 -- Start of processing for Collect_Body_States
3979 -- Inspect the declarations of the body looking for source objects,
3980 -- packages and package instantiations. Note that even though this
3981 -- processing is very similar to Collect_Visible_States, a package
3982 -- body does not have a First/Next_Entity list.
3984 Decl
:= First
(Declarations
(Body_Decl
));
3985 while Present
(Decl
) loop
3987 -- Capture source objects as internally generated temporaries cannot
3988 -- be named and participate in refinement.
3990 if Nkind
(Decl
) = N_Object_Declaration
then
3991 Item_Id
:= Defining_Entity
(Decl
);
3993 if Comes_From_Source
(Item_Id
)
3994 and then Is_Visible_Object
(Item_Id
)
3996 Append_New_Elmt
(Item_Id
, States
);
3999 -- Capture the visible abstract states and objects of a source
4000 -- package [instantiation].
4002 elsif Nkind
(Decl
) = N_Package_Declaration
then
4003 Item_Id
:= Defining_Entity
(Decl
);
4005 if Comes_From_Source
(Item_Id
) then
4006 Collect_Visible_States
(Item_Id
, States
);
4014 end Collect_Body_States
;
4016 ------------------------
4017 -- Collect_Interfaces --
4018 ------------------------
4020 procedure Collect_Interfaces
4022 Ifaces_List
: out Elist_Id
;
4023 Exclude_Parents
: Boolean := False;
4024 Use_Full_View
: Boolean := True)
4026 procedure Collect
(Typ
: Entity_Id
);
4027 -- Subsidiary subprogram used to traverse the whole list
4028 -- of directly and indirectly implemented interfaces
4034 procedure Collect
(Typ
: Entity_Id
) is
4035 Ancestor
: Entity_Id
;
4043 -- Handle private types and subtypes
4046 and then Is_Private_Type
(Typ
)
4047 and then Present
(Full_View
(Typ
))
4049 Full_T
:= Full_View
(Typ
);
4051 if Ekind
(Full_T
) = E_Record_Subtype
then
4052 Full_T
:= Full_View
(Etype
(Typ
));
4056 -- Include the ancestor if we are generating the whole list of
4057 -- abstract interfaces.
4059 if Etype
(Full_T
) /= Typ
4061 -- Protect the frontend against wrong sources. For example:
4064 -- type A is tagged null record;
4065 -- type B is new A with private;
4066 -- type C is new A with private;
4068 -- type B is new C with null record;
4069 -- type C is new B with null record;
4072 and then Etype
(Full_T
) /= T
4074 Ancestor
:= Etype
(Full_T
);
4077 if Is_Interface
(Ancestor
) and then not Exclude_Parents
then
4078 Append_Unique_Elmt
(Ancestor
, Ifaces_List
);
4082 -- Traverse the graph of ancestor interfaces
4084 if Is_Non_Empty_List
(Abstract_Interface_List
(Full_T
)) then
4085 Id
:= First
(Abstract_Interface_List
(Full_T
));
4086 while Present
(Id
) loop
4087 Iface
:= Etype
(Id
);
4089 -- Protect against wrong uses. For example:
4090 -- type I is interface;
4091 -- type O is tagged null record;
4092 -- type Wrong is new I and O with null record; -- ERROR
4094 if Is_Interface
(Iface
) then
4096 and then Etype
(T
) /= T
4097 and then Interface_Present_In_Ancestor
(Etype
(T
), Iface
)
4102 Append_Unique_Elmt
(Iface
, Ifaces_List
);
4111 -- Start of processing for Collect_Interfaces
4114 pragma Assert
(Is_Tagged_Type
(T
) or else Is_Concurrent_Type
(T
));
4115 Ifaces_List
:= New_Elmt_List
;
4117 end Collect_Interfaces
;
4119 ----------------------------------
4120 -- Collect_Interface_Components --
4121 ----------------------------------
4123 procedure Collect_Interface_Components
4124 (Tagged_Type
: Entity_Id
;
4125 Components_List
: out Elist_Id
)
4127 procedure Collect
(Typ
: Entity_Id
);
4128 -- Subsidiary subprogram used to climb to the parents
4134 procedure Collect
(Typ
: Entity_Id
) is
4135 Tag_Comp
: Entity_Id
;
4136 Parent_Typ
: Entity_Id
;
4139 -- Handle private types
4141 if Present
(Full_View
(Etype
(Typ
))) then
4142 Parent_Typ
:= Full_View
(Etype
(Typ
));
4144 Parent_Typ
:= Etype
(Typ
);
4147 if Parent_Typ
/= Typ
4149 -- Protect the frontend against wrong sources. For example:
4152 -- type A is tagged null record;
4153 -- type B is new A with private;
4154 -- type C is new A with private;
4156 -- type B is new C with null record;
4157 -- type C is new B with null record;
4160 and then Parent_Typ
/= Tagged_Type
4162 Collect
(Parent_Typ
);
4165 -- Collect the components containing tags of secondary dispatch
4168 Tag_Comp
:= Next_Tag_Component
(First_Tag_Component
(Typ
));
4169 while Present
(Tag_Comp
) loop
4170 pragma Assert
(Present
(Related_Type
(Tag_Comp
)));
4171 Append_Elmt
(Tag_Comp
, Components_List
);
4173 Tag_Comp
:= Next_Tag_Component
(Tag_Comp
);
4177 -- Start of processing for Collect_Interface_Components
4180 pragma Assert
(Ekind
(Tagged_Type
) = E_Record_Type
4181 and then Is_Tagged_Type
(Tagged_Type
));
4183 Components_List
:= New_Elmt_List
;
4184 Collect
(Tagged_Type
);
4185 end Collect_Interface_Components
;
4187 -----------------------------
4188 -- Collect_Interfaces_Info --
4189 -----------------------------
4191 procedure Collect_Interfaces_Info
4193 Ifaces_List
: out Elist_Id
;
4194 Components_List
: out Elist_Id
;
4195 Tags_List
: out Elist_Id
)
4197 Comps_List
: Elist_Id
;
4198 Comp_Elmt
: Elmt_Id
;
4199 Comp_Iface
: Entity_Id
;
4200 Iface_Elmt
: Elmt_Id
;
4203 function Search_Tag
(Iface
: Entity_Id
) return Entity_Id
;
4204 -- Search for the secondary tag associated with the interface type
4205 -- Iface that is implemented by T.
4211 function Search_Tag
(Iface
: Entity_Id
) return Entity_Id
is
4214 if not Is_CPP_Class
(T
) then
4215 ADT
:= Next_Elmt
(Next_Elmt
(First_Elmt
(Access_Disp_Table
(T
))));
4217 ADT
:= Next_Elmt
(First_Elmt
(Access_Disp_Table
(T
)));
4221 and then Is_Tag
(Node
(ADT
))
4222 and then Related_Type
(Node
(ADT
)) /= Iface
4224 -- Skip secondary dispatch table referencing thunks to user
4225 -- defined primitives covered by this interface.
4227 pragma Assert
(Has_Suffix
(Node
(ADT
), 'P'));
4230 -- Skip secondary dispatch tables of Ada types
4232 if not Is_CPP_Class
(T
) then
4234 -- Skip secondary dispatch table referencing thunks to
4235 -- predefined primitives.
4237 pragma Assert
(Has_Suffix
(Node
(ADT
), 'Y'));
4240 -- Skip secondary dispatch table referencing user-defined
4241 -- primitives covered by this interface.
4243 pragma Assert
(Has_Suffix
(Node
(ADT
), 'D'));
4246 -- Skip secondary dispatch table referencing predefined
4249 pragma Assert
(Has_Suffix
(Node
(ADT
), 'Z'));
4254 pragma Assert
(Is_Tag
(Node
(ADT
)));
4258 -- Start of processing for Collect_Interfaces_Info
4261 Collect_Interfaces
(T
, Ifaces_List
);
4262 Collect_Interface_Components
(T
, Comps_List
);
4264 -- Search for the record component and tag associated with each
4265 -- interface type of T.
4267 Components_List
:= New_Elmt_List
;
4268 Tags_List
:= New_Elmt_List
;
4270 Iface_Elmt
:= First_Elmt
(Ifaces_List
);
4271 while Present
(Iface_Elmt
) loop
4272 Iface
:= Node
(Iface_Elmt
);
4274 -- Associate the primary tag component and the primary dispatch table
4275 -- with all the interfaces that are parents of T
4277 if Is_Ancestor
(Iface
, T
, Use_Full_View
=> True) then
4278 Append_Elmt
(First_Tag_Component
(T
), Components_List
);
4279 Append_Elmt
(Node
(First_Elmt
(Access_Disp_Table
(T
))), Tags_List
);
4281 -- Otherwise search for the tag component and secondary dispatch
4285 Comp_Elmt
:= First_Elmt
(Comps_List
);
4286 while Present
(Comp_Elmt
) loop
4287 Comp_Iface
:= Related_Type
(Node
(Comp_Elmt
));
4289 if Comp_Iface
= Iface
4290 or else Is_Ancestor
(Iface
, Comp_Iface
, Use_Full_View
=> True)
4292 Append_Elmt
(Node
(Comp_Elmt
), Components_List
);
4293 Append_Elmt
(Search_Tag
(Comp_Iface
), Tags_List
);
4297 Next_Elmt
(Comp_Elmt
);
4299 pragma Assert
(Present
(Comp_Elmt
));
4302 Next_Elmt
(Iface_Elmt
);
4304 end Collect_Interfaces_Info
;
4306 ---------------------
4307 -- Collect_Parents --
4308 ---------------------
4310 procedure Collect_Parents
4312 List
: out Elist_Id
;
4313 Use_Full_View
: Boolean := True)
4315 Current_Typ
: Entity_Id
:= T
;
4316 Parent_Typ
: Entity_Id
;
4319 List
:= New_Elmt_List
;
4321 -- No action if the if the type has no parents
4323 if T
= Etype
(T
) then
4328 Parent_Typ
:= Etype
(Current_Typ
);
4330 if Is_Private_Type
(Parent_Typ
)
4331 and then Present
(Full_View
(Parent_Typ
))
4332 and then Use_Full_View
4334 Parent_Typ
:= Full_View
(Base_Type
(Parent_Typ
));
4337 Append_Elmt
(Parent_Typ
, List
);
4339 exit when Parent_Typ
= Current_Typ
;
4340 Current_Typ
:= Parent_Typ
;
4342 end Collect_Parents
;
4344 ----------------------------------
4345 -- Collect_Primitive_Operations --
4346 ----------------------------------
4348 function Collect_Primitive_Operations
(T
: Entity_Id
) return Elist_Id
is
4349 B_Type
: constant Entity_Id
:= Base_Type
(T
);
4350 B_Decl
: constant Node_Id
:= Original_Node
(Parent
(B_Type
));
4351 B_Scope
: Entity_Id
:= Scope
(B_Type
);
4355 Is_Type_In_Pkg
: Boolean;
4356 Formal_Derived
: Boolean := False;
4359 function Match
(E
: Entity_Id
) return Boolean;
4360 -- True if E's base type is B_Type, or E is of an anonymous access type
4361 -- and the base type of its designated type is B_Type.
4367 function Match
(E
: Entity_Id
) return Boolean is
4368 Etyp
: Entity_Id
:= Etype
(E
);
4371 if Ekind
(Etyp
) = E_Anonymous_Access_Type
then
4372 Etyp
:= Designated_Type
(Etyp
);
4375 -- In Ada 2012 a primitive operation may have a formal of an
4376 -- incomplete view of the parent type.
4378 return Base_Type
(Etyp
) = B_Type
4380 (Ada_Version
>= Ada_2012
4381 and then Ekind
(Etyp
) = E_Incomplete_Type
4382 and then Full_View
(Etyp
) = B_Type
);
4385 -- Start of processing for Collect_Primitive_Operations
4388 -- For tagged types, the primitive operations are collected as they
4389 -- are declared, and held in an explicit list which is simply returned.
4391 if Is_Tagged_Type
(B_Type
) then
4392 return Primitive_Operations
(B_Type
);
4394 -- An untagged generic type that is a derived type inherits the
4395 -- primitive operations of its parent type. Other formal types only
4396 -- have predefined operators, which are not explicitly represented.
4398 elsif Is_Generic_Type
(B_Type
) then
4399 if Nkind
(B_Decl
) = N_Formal_Type_Declaration
4400 and then Nkind
(Formal_Type_Definition
(B_Decl
)) =
4401 N_Formal_Derived_Type_Definition
4403 Formal_Derived
:= True;
4405 return New_Elmt_List
;
4409 Op_List
:= New_Elmt_List
;
4411 if B_Scope
= Standard_Standard
then
4412 if B_Type
= Standard_String
then
4413 Append_Elmt
(Standard_Op_Concat
, Op_List
);
4415 elsif B_Type
= Standard_Wide_String
then
4416 Append_Elmt
(Standard_Op_Concatw
, Op_List
);
4422 -- Locate the primitive subprograms of the type
4425 -- The primitive operations appear after the base type, except
4426 -- if the derivation happens within the private part of B_Scope
4427 -- and the type is a private type, in which case both the type
4428 -- and some primitive operations may appear before the base
4429 -- type, and the list of candidates starts after the type.
4431 if In_Open_Scopes
(B_Scope
)
4432 and then Scope
(T
) = B_Scope
4433 and then In_Private_Part
(B_Scope
)
4435 Id
:= Next_Entity
(T
);
4437 -- In Ada 2012, If the type has an incomplete partial view, there
4438 -- may be primitive operations declared before the full view, so
4439 -- we need to start scanning from the incomplete view, which is
4440 -- earlier on the entity chain.
4442 elsif Nkind
(Parent
(B_Type
)) = N_Full_Type_Declaration
4443 and then Present
(Incomplete_View
(Parent
(B_Type
)))
4445 Id
:= Defining_Entity
(Incomplete_View
(Parent
(B_Type
)));
4447 -- If T is a derived from a type with an incomplete view declared
4448 -- elsewhere, that incomplete view is irrelevant, we want the
4449 -- operations in the scope of T.
4451 if Scope
(Id
) /= Scope
(B_Type
) then
4452 Id
:= Next_Entity
(B_Type
);
4456 Id
:= Next_Entity
(B_Type
);
4459 -- Set flag if this is a type in a package spec
4462 Is_Package_Or_Generic_Package
(B_Scope
)
4464 Nkind
(Parent
(Declaration_Node
(First_Subtype
(T
)))) /=
4467 while Present
(Id
) loop
4469 -- Test whether the result type or any of the parameter types of
4470 -- each subprogram following the type match that type when the
4471 -- type is declared in a package spec, is a derived type, or the
4472 -- subprogram is marked as primitive. (The Is_Primitive test is
4473 -- needed to find primitives of nonderived types in declarative
4474 -- parts that happen to override the predefined "=" operator.)
4476 -- Note that generic formal subprograms are not considered to be
4477 -- primitive operations and thus are never inherited.
4479 if Is_Overloadable
(Id
)
4480 and then (Is_Type_In_Pkg
4481 or else Is_Derived_Type
(B_Type
)
4482 or else Is_Primitive
(Id
))
4483 and then Nkind
(Parent
(Parent
(Id
)))
4484 not in N_Formal_Subprogram_Declaration
4492 Formal
:= First_Formal
(Id
);
4493 while Present
(Formal
) loop
4494 if Match
(Formal
) then
4499 Next_Formal
(Formal
);
4503 -- For a formal derived type, the only primitives are the ones
4504 -- inherited from the parent type. Operations appearing in the
4505 -- package declaration are not primitive for it.
4508 and then (not Formal_Derived
or else Present
(Alias
(Id
)))
4510 -- In the special case of an equality operator aliased to
4511 -- an overriding dispatching equality belonging to the same
4512 -- type, we don't include it in the list of primitives.
4513 -- This avoids inheriting multiple equality operators when
4514 -- deriving from untagged private types whose full type is
4515 -- tagged, which can otherwise cause ambiguities. Note that
4516 -- this should only happen for this kind of untagged parent
4517 -- type, since normally dispatching operations are inherited
4518 -- using the type's Primitive_Operations list.
4520 if Chars
(Id
) = Name_Op_Eq
4521 and then Is_Dispatching_Operation
(Id
)
4522 and then Present
(Alias
(Id
))
4523 and then Present
(Overridden_Operation
(Alias
(Id
)))
4524 and then Base_Type
(Etype
(First_Entity
(Id
))) =
4525 Base_Type
(Etype
(First_Entity
(Alias
(Id
))))
4529 -- Include the subprogram in the list of primitives
4532 Append_Elmt
(Id
, Op_List
);
4539 -- For a type declared in System, some of its operations may
4540 -- appear in the target-specific extension to System.
4543 and then B_Scope
= RTU_Entity
(System
)
4544 and then Present_System_Aux
4546 B_Scope
:= System_Aux_Id
;
4547 Id
:= First_Entity
(System_Aux_Id
);
4553 end Collect_Primitive_Operations
;
4555 -----------------------------------
4556 -- Compile_Time_Constraint_Error --
4557 -----------------------------------
4559 function Compile_Time_Constraint_Error
4562 Ent
: Entity_Id
:= Empty
;
4563 Loc
: Source_Ptr
:= No_Location
;
4564 Warn
: Boolean := False) return Node_Id
4566 Msgc
: String (1 .. Msg
'Length + 3);
4567 -- Copy of message, with room for possible ?? or << and ! at end
4573 -- Start of processing for Compile_Time_Constraint_Error
4576 -- If this is a warning, convert it into an error if we are in code
4577 -- subject to SPARK_Mode being set ON.
4579 Error_Msg_Warn
:= SPARK_Mode
/= On
;
4581 -- A static constraint error in an instance body is not a fatal error.
4582 -- we choose to inhibit the message altogether, because there is no
4583 -- obvious node (for now) on which to post it. On the other hand the
4584 -- offending node must be replaced with a constraint_error in any case.
4586 -- No messages are generated if we already posted an error on this node
4588 if not Error_Posted
(N
) then
4589 if Loc
/= No_Location
then
4595 -- Copy message to Msgc, converting any ? in the message into
4596 -- < instead, so that we have an error in GNATprove mode.
4600 for J
in 1 .. Msgl
loop
4601 if Msg
(J
) = '?' and then (J
= 1 or else Msg
(J
) /= ''') then
4604 Msgc
(J
) := Msg
(J
);
4608 -- Message is a warning, even in Ada 95 case
4610 if Msg
(Msg
'Last) = '?' or else Msg
(Msg
'Last) = '<' then
4613 -- In Ada 83, all messages are warnings. In the private part and
4614 -- the body of an instance, constraint_checks are only warnings.
4615 -- We also make this a warning if the Warn parameter is set.
4618 or else (Ada_Version
= Ada_83
and then Comes_From_Source
(N
))
4626 elsif In_Instance_Not_Visible
then
4633 -- Otherwise we have a real error message (Ada 95 static case)
4634 -- and we make this an unconditional message. Note that in the
4635 -- warning case we do not make the message unconditional, it seems
4636 -- quite reasonable to delete messages like this (about exceptions
4637 -- that will be raised) in dead code.
4645 -- One more test, skip the warning if the related expression is
4646 -- statically unevaluated, since we don't want to warn about what
4647 -- will happen when something is evaluated if it never will be
4650 if not Is_Statically_Unevaluated
(N
) then
4651 Error_Msg_Warn
:= SPARK_Mode
/= On
;
4653 if Present
(Ent
) then
4654 Error_Msg_NEL
(Msgc
(1 .. Msgl
), N
, Ent
, Eloc
);
4656 Error_Msg_NEL
(Msgc
(1 .. Msgl
), N
, Etype
(N
), Eloc
);
4661 -- Check whether the context is an Init_Proc
4663 if Inside_Init_Proc
then
4665 Conc_Typ
: constant Entity_Id
:=
4666 Corresponding_Concurrent_Type
4667 (Entity
(Parameter_Type
(First
4668 (Parameter_Specifications
4669 (Parent
(Current_Scope
))))));
4672 -- Don't complain if the corresponding concurrent type
4673 -- doesn't come from source (i.e. a single task/protected
4676 if Present
(Conc_Typ
)
4677 and then not Comes_From_Source
(Conc_Typ
)
4680 ("\& [<<", N
, Standard_Constraint_Error
, Eloc
);
4683 if GNATprove_Mode
then
4685 ("\& would have been raised for objects of this "
4686 & "type", N
, Standard_Constraint_Error
, Eloc
);
4689 ("\& will be raised for objects of this type??",
4690 N
, Standard_Constraint_Error
, Eloc
);
4696 Error_Msg_NEL
("\& [<<", N
, Standard_Constraint_Error
, Eloc
);
4700 Error_Msg
("\static expression fails Constraint_Check", Eloc
);
4701 Set_Error_Posted
(N
);
4707 end Compile_Time_Constraint_Error
;
4709 -----------------------
4710 -- Conditional_Delay --
4711 -----------------------
4713 procedure Conditional_Delay
(New_Ent
, Old_Ent
: Entity_Id
) is
4715 if Has_Delayed_Freeze
(Old_Ent
) and then not Is_Frozen
(Old_Ent
) then
4716 Set_Has_Delayed_Freeze
(New_Ent
);
4718 end Conditional_Delay
;
4720 ----------------------------
4721 -- Contains_Refined_State --
4722 ----------------------------
4724 function Contains_Refined_State
(Prag
: Node_Id
) return Boolean is
4725 function Has_State_In_Dependency
(List
: Node_Id
) return Boolean;
4726 -- Determine whether a dependency list mentions a state with a visible
4729 function Has_State_In_Global
(List
: Node_Id
) return Boolean;
4730 -- Determine whether a global list mentions a state with a visible
4733 function Is_Refined_State
(Item
: Node_Id
) return Boolean;
4734 -- Determine whether Item is a reference to an abstract state with a
4735 -- visible refinement.
4737 -----------------------------
4738 -- Has_State_In_Dependency --
4739 -----------------------------
4741 function Has_State_In_Dependency
(List
: Node_Id
) return Boolean is
4746 -- A null dependency list does not mention any states
4748 if Nkind
(List
) = N_Null
then
4751 -- Dependency clauses appear as component associations of an
4754 elsif Nkind
(List
) = N_Aggregate
4755 and then Present
(Component_Associations
(List
))
4757 Clause
:= First
(Component_Associations
(List
));
4758 while Present
(Clause
) loop
4760 -- Inspect the outputs of a dependency clause
4762 Output
:= First
(Choices
(Clause
));
4763 while Present
(Output
) loop
4764 if Is_Refined_State
(Output
) then
4771 -- Inspect the outputs of a dependency clause
4773 if Is_Refined_State
(Expression
(Clause
)) then
4780 -- If we get here, then none of the dependency clauses mention a
4781 -- state with visible refinement.
4785 -- An illegal pragma managed to sneak in
4788 raise Program_Error
;
4790 end Has_State_In_Dependency
;
4792 -------------------------
4793 -- Has_State_In_Global --
4794 -------------------------
4796 function Has_State_In_Global
(List
: Node_Id
) return Boolean is
4800 -- A null global list does not mention any states
4802 if Nkind
(List
) = N_Null
then
4805 -- Simple global list or moded global list declaration
4807 elsif Nkind
(List
) = N_Aggregate
then
4809 -- The declaration of a simple global list appear as a collection
4812 if Present
(Expressions
(List
)) then
4813 Item
:= First
(Expressions
(List
));
4814 while Present
(Item
) loop
4815 if Is_Refined_State
(Item
) then
4822 -- The declaration of a moded global list appears as a collection
4823 -- of component associations where individual choices denote
4827 Item
:= First
(Component_Associations
(List
));
4828 while Present
(Item
) loop
4829 if Has_State_In_Global
(Expression
(Item
)) then
4837 -- If we get here, then the simple/moded global list did not
4838 -- mention any states with a visible refinement.
4842 -- Single global item declaration
4844 elsif Is_Entity_Name
(List
) then
4845 return Is_Refined_State
(List
);
4847 -- An illegal pragma managed to sneak in
4850 raise Program_Error
;
4852 end Has_State_In_Global
;
4854 ----------------------
4855 -- Is_Refined_State --
4856 ----------------------
4858 function Is_Refined_State
(Item
: Node_Id
) return Boolean is
4860 Item_Id
: Entity_Id
;
4863 if Nkind
(Item
) = N_Null
then
4866 -- States cannot be subject to attribute 'Result. This case arises
4867 -- in dependency relations.
4869 elsif Nkind
(Item
) = N_Attribute_Reference
4870 and then Attribute_Name
(Item
) = Name_Result
4874 -- Multiple items appear as an aggregate. This case arises in
4875 -- dependency relations.
4877 elsif Nkind
(Item
) = N_Aggregate
4878 and then Present
(Expressions
(Item
))
4880 Elmt
:= First
(Expressions
(Item
));
4881 while Present
(Elmt
) loop
4882 if Is_Refined_State
(Elmt
) then
4889 -- If we get here, then none of the inputs or outputs reference a
4890 -- state with visible refinement.
4897 Item_Id
:= Entity_Of
(Item
);
4901 and then Ekind
(Item_Id
) = E_Abstract_State
4902 and then Has_Visible_Refinement
(Item_Id
);
4904 end Is_Refined_State
;
4908 Arg
: constant Node_Id
:=
4909 Get_Pragma_Arg
(First
(Pragma_Argument_Associations
(Prag
)));
4910 Nam
: constant Name_Id
:= Pragma_Name
(Prag
);
4912 -- Start of processing for Contains_Refined_State
4915 if Nam
= Name_Depends
then
4916 return Has_State_In_Dependency
(Arg
);
4918 else pragma Assert
(Nam
= Name_Global
);
4919 return Has_State_In_Global
(Arg
);
4921 end Contains_Refined_State
;
4923 -------------------------
4924 -- Copy_Component_List --
4925 -------------------------
4927 function Copy_Component_List
4929 Loc
: Source_Ptr
) return List_Id
4932 Comps
: constant List_Id
:= New_List
;
4935 Comp
:= First_Component
(Underlying_Type
(R_Typ
));
4936 while Present
(Comp
) loop
4937 if Comes_From_Source
(Comp
) then
4939 Comp_Decl
: constant Node_Id
:= Declaration_Node
(Comp
);
4942 Make_Component_Declaration
(Loc
,
4943 Defining_Identifier
=>
4944 Make_Defining_Identifier
(Loc
, Chars
(Comp
)),
4945 Component_Definition
=>
4947 (Component_Definition
(Comp_Decl
), New_Sloc
=> Loc
)));
4951 Next_Component
(Comp
);
4955 end Copy_Component_List
;
4957 -------------------------
4958 -- Copy_Parameter_List --
4959 -------------------------
4961 function Copy_Parameter_List
(Subp_Id
: Entity_Id
) return List_Id
is
4962 Loc
: constant Source_Ptr
:= Sloc
(Subp_Id
);
4967 if No
(First_Formal
(Subp_Id
)) then
4971 Formal
:= First_Formal
(Subp_Id
);
4972 while Present
(Formal
) loop
4974 Make_Parameter_Specification
(Loc
,
4975 Defining_Identifier
=>
4976 Make_Defining_Identifier
(Sloc
(Formal
), Chars
(Formal
)),
4977 In_Present
=> In_Present
(Parent
(Formal
)),
4978 Out_Present
=> Out_Present
(Parent
(Formal
)),
4980 New_Occurrence_Of
(Etype
(Formal
), Loc
),
4982 New_Copy_Tree
(Expression
(Parent
(Formal
)))));
4984 Next_Formal
(Formal
);
4989 end Copy_Parameter_List
;
4991 --------------------------
4992 -- Copy_Subprogram_Spec --
4993 --------------------------
4995 function Copy_Subprogram_Spec
(Spec
: Node_Id
) return Node_Id
is
4997 Formal_Spec
: Node_Id
;
5001 -- The structure of the original tree must be replicated without any
5002 -- alterations. Use New_Copy_Tree for this purpose.
5004 Result
:= New_Copy_Tree
(Spec
);
5006 -- Create a new entity for the defining unit name
5008 Def_Id
:= Defining_Unit_Name
(Result
);
5009 Set_Defining_Unit_Name
(Result
,
5010 Make_Defining_Identifier
(Sloc
(Def_Id
), Chars
(Def_Id
)));
5012 -- Create new entities for the formal parameters
5014 if Present
(Parameter_Specifications
(Result
)) then
5015 Formal_Spec
:= First
(Parameter_Specifications
(Result
));
5016 while Present
(Formal_Spec
) loop
5017 Def_Id
:= Defining_Identifier
(Formal_Spec
);
5018 Set_Defining_Identifier
(Formal_Spec
,
5019 Make_Defining_Identifier
(Sloc
(Def_Id
), Chars
(Def_Id
)));
5026 end Copy_Subprogram_Spec
;
5028 --------------------------------
5029 -- Corresponding_Generic_Type --
5030 --------------------------------
5032 function Corresponding_Generic_Type
(T
: Entity_Id
) return Entity_Id
is
5038 if not Is_Generic_Actual_Type
(T
) then
5041 -- If the actual is the actual of an enclosing instance, resolution
5042 -- was correct in the generic.
5044 elsif Nkind
(Parent
(T
)) = N_Subtype_Declaration
5045 and then Is_Entity_Name
(Subtype_Indication
(Parent
(T
)))
5047 Is_Generic_Actual_Type
(Entity
(Subtype_Indication
(Parent
(T
))))
5054 if Is_Wrapper_Package
(Inst
) then
5055 Inst
:= Related_Instance
(Inst
);
5060 (Specification
(Unit_Declaration_Node
(Inst
)));
5062 -- Generic actual has the same name as the corresponding formal
5064 Typ
:= First_Entity
(Gen
);
5065 while Present
(Typ
) loop
5066 if Chars
(Typ
) = Chars
(T
) then
5075 end Corresponding_Generic_Type
;
5077 --------------------
5078 -- Current_Entity --
5079 --------------------
5081 -- The currently visible definition for a given identifier is the
5082 -- one most chained at the start of the visibility chain, i.e. the
5083 -- one that is referenced by the Node_Id value of the name of the
5084 -- given identifier.
5086 function Current_Entity
(N
: Node_Id
) return Entity_Id
is
5088 return Get_Name_Entity_Id
(Chars
(N
));
5091 -----------------------------
5092 -- Current_Entity_In_Scope --
5093 -----------------------------
5095 function Current_Entity_In_Scope
(N
: Node_Id
) return Entity_Id
is
5097 CS
: constant Entity_Id
:= Current_Scope
;
5099 Transient_Case
: constant Boolean := Scope_Is_Transient
;
5102 E
:= Get_Name_Entity_Id
(Chars
(N
));
5104 and then Scope
(E
) /= CS
5105 and then (not Transient_Case
or else Scope
(E
) /= Scope
(CS
))
5111 end Current_Entity_In_Scope
;
5117 function Current_Scope
return Entity_Id
is
5119 if Scope_Stack
.Last
= -1 then
5120 return Standard_Standard
;
5123 C
: constant Entity_Id
:=
5124 Scope_Stack
.Table
(Scope_Stack
.Last
).Entity
;
5129 return Standard_Standard
;
5135 ------------------------
5136 -- Current_Subprogram --
5137 ------------------------
5139 function Current_Subprogram
return Entity_Id
is
5140 Scop
: constant Entity_Id
:= Current_Scope
;
5142 if Is_Subprogram_Or_Generic_Subprogram
(Scop
) then
5145 return Enclosing_Subprogram
(Scop
);
5147 end Current_Subprogram
;
5149 ----------------------------------
5150 -- Deepest_Type_Access_Level --
5151 ----------------------------------
5153 function Deepest_Type_Access_Level
(Typ
: Entity_Id
) return Uint
is
5155 if Ekind
(Typ
) = E_Anonymous_Access_Type
5156 and then not Is_Local_Anonymous_Access
(Typ
)
5157 and then Nkind
(Associated_Node_For_Itype
(Typ
)) = N_Object_Declaration
5159 -- Typ is the type of an Ada 2012 stand-alone object of an anonymous
5163 Scope_Depth
(Enclosing_Dynamic_Scope
5164 (Defining_Identifier
5165 (Associated_Node_For_Itype
(Typ
))));
5167 -- For generic formal type, return Int'Last (infinite).
5168 -- See comment preceding Is_Generic_Type call in Type_Access_Level.
5170 elsif Is_Generic_Type
(Root_Type
(Typ
)) then
5171 return UI_From_Int
(Int
'Last);
5174 return Type_Access_Level
(Typ
);
5176 end Deepest_Type_Access_Level
;
5178 ---------------------
5179 -- Defining_Entity --
5180 ---------------------
5182 function Defining_Entity
5184 Empty_On_Errors
: Boolean := False) return Entity_Id
5186 Err
: Entity_Id
:= Empty
;
5190 when N_Abstract_Subprogram_Declaration |
5191 N_Expression_Function |
5192 N_Formal_Subprogram_Declaration |
5193 N_Generic_Package_Declaration |
5194 N_Generic_Subprogram_Declaration |
5195 N_Package_Declaration |
5197 N_Subprogram_Body_Stub |
5198 N_Subprogram_Declaration |
5199 N_Subprogram_Renaming_Declaration
5201 return Defining_Entity
(Specification
(N
));
5203 when N_Component_Declaration |
5204 N_Defining_Program_Unit_Name |
5205 N_Discriminant_Specification |
5207 N_Entry_Declaration |
5208 N_Entry_Index_Specification |
5209 N_Exception_Declaration |
5210 N_Exception_Renaming_Declaration |
5211 N_Formal_Object_Declaration |
5212 N_Formal_Package_Declaration |
5213 N_Formal_Type_Declaration |
5214 N_Full_Type_Declaration |
5215 N_Implicit_Label_Declaration |
5216 N_Incomplete_Type_Declaration |
5217 N_Loop_Parameter_Specification |
5218 N_Number_Declaration |
5219 N_Object_Declaration |
5220 N_Object_Renaming_Declaration |
5221 N_Package_Body_Stub |
5222 N_Parameter_Specification |
5223 N_Private_Extension_Declaration |
5224 N_Private_Type_Declaration |
5226 N_Protected_Body_Stub |
5227 N_Protected_Type_Declaration |
5228 N_Single_Protected_Declaration |
5229 N_Single_Task_Declaration |
5230 N_Subtype_Declaration |
5233 N_Task_Type_Declaration
5235 return Defining_Identifier
(N
);
5238 return Defining_Entity
(Proper_Body
(N
));
5240 when N_Function_Instantiation |
5241 N_Function_Specification |
5242 N_Generic_Function_Renaming_Declaration |
5243 N_Generic_Package_Renaming_Declaration |
5244 N_Generic_Procedure_Renaming_Declaration |
5246 N_Package_Instantiation |
5247 N_Package_Renaming_Declaration |
5248 N_Package_Specification |
5249 N_Procedure_Instantiation |
5250 N_Procedure_Specification
5253 Nam
: constant Node_Id
:= Defining_Unit_Name
(N
);
5256 if Nkind
(Nam
) in N_Entity
then
5259 -- For Error, make up a name and attach to declaration so we
5260 -- can continue semantic analysis.
5262 elsif Nam
= Error
then
5263 if Empty_On_Errors
then
5266 Err
:= Make_Temporary
(Sloc
(N
), 'T');
5267 Set_Defining_Unit_Name
(N
, Err
);
5272 -- If not an entity, get defining identifier
5275 return Defining_Identifier
(Nam
);
5279 when N_Block_Statement |
5281 return Entity
(Identifier
(N
));
5284 if Empty_On_Errors
then
5287 raise Program_Error
;
5291 end Defining_Entity
;
5293 --------------------------
5294 -- Denotes_Discriminant --
5295 --------------------------
5297 function Denotes_Discriminant
5299 Check_Concurrent
: Boolean := False) return Boolean
5304 if not Is_Entity_Name
(N
) or else No
(Entity
(N
)) then
5310 -- If we are checking for a protected type, the discriminant may have
5311 -- been rewritten as the corresponding discriminal of the original type
5312 -- or of the corresponding concurrent record, depending on whether we
5313 -- are in the spec or body of the protected type.
5315 return Ekind
(E
) = E_Discriminant
5318 and then Ekind
(E
) = E_In_Parameter
5319 and then Present
(Discriminal_Link
(E
))
5321 (Is_Concurrent_Type
(Scope
(Discriminal_Link
(E
)))
5323 Is_Concurrent_Record_Type
(Scope
(Discriminal_Link
(E
)))));
5324 end Denotes_Discriminant
;
5326 -------------------------
5327 -- Denotes_Same_Object --
5328 -------------------------
5330 function Denotes_Same_Object
(A1
, A2
: Node_Id
) return Boolean is
5331 Obj1
: Node_Id
:= A1
;
5332 Obj2
: Node_Id
:= A2
;
5334 function Has_Prefix
(N
: Node_Id
) return Boolean;
5335 -- Return True if N has attribute Prefix
5337 function Is_Renaming
(N
: Node_Id
) return Boolean;
5338 -- Return true if N names a renaming entity
5340 function Is_Valid_Renaming
(N
: Node_Id
) return Boolean;
5341 -- For renamings, return False if the prefix of any dereference within
5342 -- the renamed object_name is a variable, or any expression within the
5343 -- renamed object_name contains references to variables or calls on
5344 -- nonstatic functions; otherwise return True (RM 6.4.1(6.10/3))
5350 function Has_Prefix
(N
: Node_Id
) return Boolean is
5354 N_Attribute_Reference
,
5356 N_Explicit_Dereference
,
5357 N_Indexed_Component
,
5359 N_Selected_Component
,
5367 function Is_Renaming
(N
: Node_Id
) return Boolean is
5369 return Is_Entity_Name
(N
)
5370 and then Present
(Renamed_Entity
(Entity
(N
)));
5373 -----------------------
5374 -- Is_Valid_Renaming --
5375 -----------------------
5377 function Is_Valid_Renaming
(N
: Node_Id
) return Boolean is
5379 function Check_Renaming
(N
: Node_Id
) return Boolean;
5380 -- Recursive function used to traverse all the prefixes of N
5382 function Check_Renaming
(N
: Node_Id
) return Boolean is
5385 and then not Check_Renaming
(Renamed_Entity
(Entity
(N
)))
5390 if Nkind
(N
) = N_Indexed_Component
then
5395 Indx
:= First
(Expressions
(N
));
5396 while Present
(Indx
) loop
5397 if not Is_OK_Static_Expression
(Indx
) then
5406 if Has_Prefix
(N
) then
5408 P
: constant Node_Id
:= Prefix
(N
);
5411 if Nkind
(N
) = N_Explicit_Dereference
5412 and then Is_Variable
(P
)
5416 elsif Is_Entity_Name
(P
)
5417 and then Ekind
(Entity
(P
)) = E_Function
5421 elsif Nkind
(P
) = N_Function_Call
then
5425 -- Recursion to continue traversing the prefix of the
5426 -- renaming expression
5428 return Check_Renaming
(P
);
5435 -- Start of processing for Is_Valid_Renaming
5438 return Check_Renaming
(N
);
5439 end Is_Valid_Renaming
;
5441 -- Start of processing for Denotes_Same_Object
5444 -- Both names statically denote the same stand-alone object or parameter
5445 -- (RM 6.4.1(6.5/3))
5447 if Is_Entity_Name
(Obj1
)
5448 and then Is_Entity_Name
(Obj2
)
5449 and then Entity
(Obj1
) = Entity
(Obj2
)
5454 -- For renamings, the prefix of any dereference within the renamed
5455 -- object_name is not a variable, and any expression within the
5456 -- renamed object_name contains no references to variables nor
5457 -- calls on nonstatic functions (RM 6.4.1(6.10/3)).
5459 if Is_Renaming
(Obj1
) then
5460 if Is_Valid_Renaming
(Obj1
) then
5461 Obj1
:= Renamed_Entity
(Entity
(Obj1
));
5467 if Is_Renaming
(Obj2
) then
5468 if Is_Valid_Renaming
(Obj2
) then
5469 Obj2
:= Renamed_Entity
(Entity
(Obj2
));
5475 -- No match if not same node kind (such cases are handled by
5476 -- Denotes_Same_Prefix)
5478 if Nkind
(Obj1
) /= Nkind
(Obj2
) then
5481 -- After handling valid renamings, one of the two names statically
5482 -- denoted a renaming declaration whose renamed object_name is known
5483 -- to denote the same object as the other (RM 6.4.1(6.10/3))
5485 elsif Is_Entity_Name
(Obj1
) then
5486 if Is_Entity_Name
(Obj2
) then
5487 return Entity
(Obj1
) = Entity
(Obj2
);
5492 -- Both names are selected_components, their prefixes are known to
5493 -- denote the same object, and their selector_names denote the same
5494 -- component (RM 6.4.1(6.6/3)).
5496 elsif Nkind
(Obj1
) = N_Selected_Component
then
5497 return Denotes_Same_Object
(Prefix
(Obj1
), Prefix
(Obj2
))
5499 Entity
(Selector_Name
(Obj1
)) = Entity
(Selector_Name
(Obj2
));
5501 -- Both names are dereferences and the dereferenced names are known to
5502 -- denote the same object (RM 6.4.1(6.7/3))
5504 elsif Nkind
(Obj1
) = N_Explicit_Dereference
then
5505 return Denotes_Same_Object
(Prefix
(Obj1
), Prefix
(Obj2
));
5507 -- Both names are indexed_components, their prefixes are known to denote
5508 -- the same object, and each of the pairs of corresponding index values
5509 -- are either both static expressions with the same static value or both
5510 -- names that are known to denote the same object (RM 6.4.1(6.8/3))
5512 elsif Nkind
(Obj1
) = N_Indexed_Component
then
5513 if not Denotes_Same_Object
(Prefix
(Obj1
), Prefix
(Obj2
)) then
5521 Indx1
:= First
(Expressions
(Obj1
));
5522 Indx2
:= First
(Expressions
(Obj2
));
5523 while Present
(Indx1
) loop
5525 -- Indexes must denote the same static value or same object
5527 if Is_OK_Static_Expression
(Indx1
) then
5528 if not Is_OK_Static_Expression
(Indx2
) then
5531 elsif Expr_Value
(Indx1
) /= Expr_Value
(Indx2
) then
5535 elsif not Denotes_Same_Object
(Indx1
, Indx2
) then
5547 -- Both names are slices, their prefixes are known to denote the same
5548 -- object, and the two slices have statically matching index constraints
5549 -- (RM 6.4.1(6.9/3))
5551 elsif Nkind
(Obj1
) = N_Slice
5552 and then Denotes_Same_Object
(Prefix
(Obj1
), Prefix
(Obj2
))
5555 Lo1
, Lo2
, Hi1
, Hi2
: Node_Id
;
5558 Get_Index_Bounds
(Etype
(Obj1
), Lo1
, Hi1
);
5559 Get_Index_Bounds
(Etype
(Obj2
), Lo2
, Hi2
);
5561 -- Check whether bounds are statically identical. There is no
5562 -- attempt to detect partial overlap of slices.
5564 return Denotes_Same_Object
(Lo1
, Lo2
)
5566 Denotes_Same_Object
(Hi1
, Hi2
);
5569 -- In the recursion, literals appear as indexes
5571 elsif Nkind
(Obj1
) = N_Integer_Literal
5573 Nkind
(Obj2
) = N_Integer_Literal
5575 return Intval
(Obj1
) = Intval
(Obj2
);
5580 end Denotes_Same_Object
;
5582 -------------------------
5583 -- Denotes_Same_Prefix --
5584 -------------------------
5586 function Denotes_Same_Prefix
(A1
, A2
: Node_Id
) return Boolean is
5588 if Is_Entity_Name
(A1
) then
5589 if Nkind_In
(A2
, N_Selected_Component
, N_Indexed_Component
)
5590 and then not Is_Access_Type
(Etype
(A1
))
5592 return Denotes_Same_Object
(A1
, Prefix
(A2
))
5593 or else Denotes_Same_Prefix
(A1
, Prefix
(A2
));
5598 elsif Is_Entity_Name
(A2
) then
5599 return Denotes_Same_Prefix
(A1
=> A2
, A2
=> A1
);
5601 elsif Nkind_In
(A1
, N_Selected_Component
, N_Indexed_Component
, N_Slice
)
5603 Nkind_In
(A2
, N_Selected_Component
, N_Indexed_Component
, N_Slice
)
5606 Root1
, Root2
: Node_Id
;
5607 Depth1
, Depth2
: Int
:= 0;
5610 Root1
:= Prefix
(A1
);
5611 while not Is_Entity_Name
(Root1
) loop
5613 (Root1
, N_Selected_Component
, N_Indexed_Component
)
5617 Root1
:= Prefix
(Root1
);
5620 Depth1
:= Depth1
+ 1;
5623 Root2
:= Prefix
(A2
);
5624 while not Is_Entity_Name
(Root2
) loop
5625 if not Nkind_In
(Root2
, N_Selected_Component
,
5626 N_Indexed_Component
)
5630 Root2
:= Prefix
(Root2
);
5633 Depth2
:= Depth2
+ 1;
5636 -- If both have the same depth and they do not denote the same
5637 -- object, they are disjoint and no warning is needed.
5639 if Depth1
= Depth2
then
5642 elsif Depth1
> Depth2
then
5643 Root1
:= Prefix
(A1
);
5644 for J
in 1 .. Depth1
- Depth2
- 1 loop
5645 Root1
:= Prefix
(Root1
);
5648 return Denotes_Same_Object
(Root1
, A2
);
5651 Root2
:= Prefix
(A2
);
5652 for J
in 1 .. Depth2
- Depth1
- 1 loop
5653 Root2
:= Prefix
(Root2
);
5656 return Denotes_Same_Object
(A1
, Root2
);
5663 end Denotes_Same_Prefix
;
5665 ----------------------
5666 -- Denotes_Variable --
5667 ----------------------
5669 function Denotes_Variable
(N
: Node_Id
) return Boolean is
5671 return Is_Variable
(N
) and then Paren_Count
(N
) = 0;
5672 end Denotes_Variable
;
5674 -----------------------------
5675 -- Depends_On_Discriminant --
5676 -----------------------------
5678 function Depends_On_Discriminant
(N
: Node_Id
) return Boolean is
5683 Get_Index_Bounds
(N
, L
, H
);
5684 return Denotes_Discriminant
(L
) or else Denotes_Discriminant
(H
);
5685 end Depends_On_Discriminant
;
5687 -------------------------
5688 -- Designate_Same_Unit --
5689 -------------------------
5691 function Designate_Same_Unit
5693 Name2
: Node_Id
) return Boolean
5695 K1
: constant Node_Kind
:= Nkind
(Name1
);
5696 K2
: constant Node_Kind
:= Nkind
(Name2
);
5698 function Prefix_Node
(N
: Node_Id
) return Node_Id
;
5699 -- Returns the parent unit name node of a defining program unit name
5700 -- or the prefix if N is a selected component or an expanded name.
5702 function Select_Node
(N
: Node_Id
) return Node_Id
;
5703 -- Returns the defining identifier node of a defining program unit
5704 -- name or the selector node if N is a selected component or an
5711 function Prefix_Node
(N
: Node_Id
) return Node_Id
is
5713 if Nkind
(N
) = N_Defining_Program_Unit_Name
then
5724 function Select_Node
(N
: Node_Id
) return Node_Id
is
5726 if Nkind
(N
) = N_Defining_Program_Unit_Name
then
5727 return Defining_Identifier
(N
);
5729 return Selector_Name
(N
);
5733 -- Start of processing for Designate_Same_Unit
5736 if Nkind_In
(K1
, N_Identifier
, N_Defining_Identifier
)
5738 Nkind_In
(K2
, N_Identifier
, N_Defining_Identifier
)
5740 return Chars
(Name1
) = Chars
(Name2
);
5742 elsif Nkind_In
(K1
, N_Expanded_Name
,
5743 N_Selected_Component
,
5744 N_Defining_Program_Unit_Name
)
5746 Nkind_In
(K2
, N_Expanded_Name
,
5747 N_Selected_Component
,
5748 N_Defining_Program_Unit_Name
)
5751 (Chars
(Select_Node
(Name1
)) = Chars
(Select_Node
(Name2
)))
5753 Designate_Same_Unit
(Prefix_Node
(Name1
), Prefix_Node
(Name2
));
5758 end Designate_Same_Unit
;
5760 ------------------------------------------
5761 -- function Dynamic_Accessibility_Level --
5762 ------------------------------------------
5764 function Dynamic_Accessibility_Level
(Expr
: Node_Id
) return Node_Id
is
5766 Loc
: constant Source_Ptr
:= Sloc
(Expr
);
5768 function Make_Level_Literal
(Level
: Uint
) return Node_Id
;
5769 -- Construct an integer literal representing an accessibility level
5770 -- with its type set to Natural.
5772 ------------------------
5773 -- Make_Level_Literal --
5774 ------------------------
5776 function Make_Level_Literal
(Level
: Uint
) return Node_Id
is
5777 Result
: constant Node_Id
:= Make_Integer_Literal
(Loc
, Level
);
5779 Set_Etype
(Result
, Standard_Natural
);
5781 end Make_Level_Literal
;
5783 -- Start of processing for Dynamic_Accessibility_Level
5786 if Is_Entity_Name
(Expr
) then
5789 if Present
(Renamed_Object
(E
)) then
5790 return Dynamic_Accessibility_Level
(Renamed_Object
(E
));
5793 if Is_Formal
(E
) or else Ekind_In
(E
, E_Variable
, E_Constant
) then
5794 if Present
(Extra_Accessibility
(E
)) then
5795 return New_Occurrence_Of
(Extra_Accessibility
(E
), Loc
);
5800 -- Unimplemented: Ptr.all'Access, where Ptr has Extra_Accessibility ???
5802 case Nkind
(Expr
) is
5804 -- For access discriminant, the level of the enclosing object
5806 when N_Selected_Component
=>
5807 if Ekind
(Entity
(Selector_Name
(Expr
))) = E_Discriminant
5808 and then Ekind
(Etype
(Entity
(Selector_Name
(Expr
)))) =
5809 E_Anonymous_Access_Type
5811 return Make_Level_Literal
(Object_Access_Level
(Expr
));
5814 when N_Attribute_Reference
=>
5815 case Get_Attribute_Id
(Attribute_Name
(Expr
)) is
5817 -- For X'Access, the level of the prefix X
5819 when Attribute_Access
=>
5820 return Make_Level_Literal
5821 (Object_Access_Level
(Prefix
(Expr
)));
5823 -- Treat the unchecked attributes as library-level
5825 when Attribute_Unchecked_Access |
5826 Attribute_Unrestricted_Access
=>
5827 return Make_Level_Literal
(Scope_Depth
(Standard_Standard
));
5829 -- No other access-valued attributes
5832 raise Program_Error
;
5837 -- Unimplemented: depends on context. As an actual parameter where
5838 -- formal type is anonymous, use
5839 -- Scope_Depth (Current_Scope) + 1.
5840 -- For other cases, see 3.10.2(14/3) and following. ???
5844 when N_Type_Conversion
=>
5845 if not Is_Local_Anonymous_Access
(Etype
(Expr
)) then
5847 -- Handle type conversions introduced for a rename of an
5848 -- Ada 2012 stand-alone object of an anonymous access type.
5850 return Dynamic_Accessibility_Level
(Expression
(Expr
));
5857 return Make_Level_Literal
(Type_Access_Level
(Etype
(Expr
)));
5858 end Dynamic_Accessibility_Level
;
5860 -----------------------------------
5861 -- Effective_Extra_Accessibility --
5862 -----------------------------------
5864 function Effective_Extra_Accessibility
(Id
: Entity_Id
) return Entity_Id
is
5866 if Present
(Renamed_Object
(Id
))
5867 and then Is_Entity_Name
(Renamed_Object
(Id
))
5869 return Effective_Extra_Accessibility
(Entity
(Renamed_Object
(Id
)));
5871 return Extra_Accessibility
(Id
);
5873 end Effective_Extra_Accessibility
;
5875 -----------------------------
5876 -- Effective_Reads_Enabled --
5877 -----------------------------
5879 function Effective_Reads_Enabled
(Id
: Entity_Id
) return Boolean is
5881 return Has_Enabled_Property
(Id
, Name_Effective_Reads
);
5882 end Effective_Reads_Enabled
;
5884 ------------------------------
5885 -- Effective_Writes_Enabled --
5886 ------------------------------
5888 function Effective_Writes_Enabled
(Id
: Entity_Id
) return Boolean is
5890 return Has_Enabled_Property
(Id
, Name_Effective_Writes
);
5891 end Effective_Writes_Enabled
;
5893 ------------------------------
5894 -- Enclosing_Comp_Unit_Node --
5895 ------------------------------
5897 function Enclosing_Comp_Unit_Node
(N
: Node_Id
) return Node_Id
is
5898 Current_Node
: Node_Id
;
5902 while Present
(Current_Node
)
5903 and then Nkind
(Current_Node
) /= N_Compilation_Unit
5905 Current_Node
:= Parent
(Current_Node
);
5908 if Nkind
(Current_Node
) /= N_Compilation_Unit
then
5911 return Current_Node
;
5913 end Enclosing_Comp_Unit_Node
;
5915 --------------------------
5916 -- Enclosing_CPP_Parent --
5917 --------------------------
5919 function Enclosing_CPP_Parent
(Typ
: Entity_Id
) return Entity_Id
is
5920 Parent_Typ
: Entity_Id
:= Typ
;
5923 while not Is_CPP_Class
(Parent_Typ
)
5924 and then Etype
(Parent_Typ
) /= Parent_Typ
5926 Parent_Typ
:= Etype
(Parent_Typ
);
5928 if Is_Private_Type
(Parent_Typ
) then
5929 Parent_Typ
:= Full_View
(Base_Type
(Parent_Typ
));
5933 pragma Assert
(Is_CPP_Class
(Parent_Typ
));
5935 end Enclosing_CPP_Parent
;
5937 ---------------------------
5938 -- Enclosing_Declaration --
5939 ---------------------------
5941 function Enclosing_Declaration
(N
: Node_Id
) return Node_Id
is
5942 Decl
: Node_Id
:= N
;
5945 while Present
(Decl
)
5946 and then not (Nkind
(Decl
) in N_Declaration
5948 Nkind
(Decl
) in N_Later_Decl_Item
)
5950 Decl
:= Parent
(Decl
);
5954 end Enclosing_Declaration
;
5956 ----------------------------
5957 -- Enclosing_Generic_Body --
5958 ----------------------------
5960 function Enclosing_Generic_Body
5961 (N
: Node_Id
) return Node_Id
5969 while Present
(P
) loop
5970 if Nkind
(P
) = N_Package_Body
5971 or else Nkind
(P
) = N_Subprogram_Body
5973 Spec
:= Corresponding_Spec
(P
);
5975 if Present
(Spec
) then
5976 Decl
:= Unit_Declaration_Node
(Spec
);
5978 if Nkind
(Decl
) = N_Generic_Package_Declaration
5979 or else Nkind
(Decl
) = N_Generic_Subprogram_Declaration
5990 end Enclosing_Generic_Body
;
5992 ----------------------------
5993 -- Enclosing_Generic_Unit --
5994 ----------------------------
5996 function Enclosing_Generic_Unit
5997 (N
: Node_Id
) return Node_Id
6005 while Present
(P
) loop
6006 if Nkind
(P
) = N_Generic_Package_Declaration
6007 or else Nkind
(P
) = N_Generic_Subprogram_Declaration
6011 elsif Nkind
(P
) = N_Package_Body
6012 or else Nkind
(P
) = N_Subprogram_Body
6014 Spec
:= Corresponding_Spec
(P
);
6016 if Present
(Spec
) then
6017 Decl
:= Unit_Declaration_Node
(Spec
);
6019 if Nkind
(Decl
) = N_Generic_Package_Declaration
6020 or else Nkind
(Decl
) = N_Generic_Subprogram_Declaration
6031 end Enclosing_Generic_Unit
;
6033 -------------------------------
6034 -- Enclosing_Lib_Unit_Entity --
6035 -------------------------------
6037 function Enclosing_Lib_Unit_Entity
6038 (E
: Entity_Id
:= Current_Scope
) return Entity_Id
6040 Unit_Entity
: Entity_Id
;
6043 -- Look for enclosing library unit entity by following scope links.
6044 -- Equivalent to, but faster than indexing through the scope stack.
6047 while (Present
(Scope
(Unit_Entity
))
6048 and then Scope
(Unit_Entity
) /= Standard_Standard
)
6049 and not Is_Child_Unit
(Unit_Entity
)
6051 Unit_Entity
:= Scope
(Unit_Entity
);
6055 end Enclosing_Lib_Unit_Entity
;
6057 -----------------------------
6058 -- Enclosing_Lib_Unit_Node --
6059 -----------------------------
6061 function Enclosing_Lib_Unit_Node
(N
: Node_Id
) return Node_Id
is
6062 Encl_Unit
: Node_Id
;
6065 Encl_Unit
:= Enclosing_Comp_Unit_Node
(N
);
6066 while Present
(Encl_Unit
)
6067 and then Nkind
(Unit
(Encl_Unit
)) = N_Subunit
6069 Encl_Unit
:= Library_Unit
(Encl_Unit
);
6073 end Enclosing_Lib_Unit_Node
;
6075 -----------------------
6076 -- Enclosing_Package --
6077 -----------------------
6079 function Enclosing_Package
(E
: Entity_Id
) return Entity_Id
is
6080 Dynamic_Scope
: constant Entity_Id
:= Enclosing_Dynamic_Scope
(E
);
6083 if Dynamic_Scope
= Standard_Standard
then
6084 return Standard_Standard
;
6086 elsif Dynamic_Scope
= Empty
then
6089 elsif Ekind_In
(Dynamic_Scope
, E_Package
, E_Package_Body
,
6092 return Dynamic_Scope
;
6095 return Enclosing_Package
(Dynamic_Scope
);
6097 end Enclosing_Package
;
6099 -------------------------------------
6100 -- Enclosing_Package_Or_Subprogram --
6101 -------------------------------------
6103 function Enclosing_Package_Or_Subprogram
(E
: Entity_Id
) return Entity_Id
is
6108 while Present
(S
) loop
6109 if Is_Package_Or_Generic_Package
(S
)
6110 or else Ekind
(S
) = E_Package_Body
6114 elsif Is_Subprogram_Or_Generic_Subprogram
(S
)
6115 or else Ekind
(S
) = E_Subprogram_Body
6125 end Enclosing_Package_Or_Subprogram
;
6127 --------------------------
6128 -- Enclosing_Subprogram --
6129 --------------------------
6131 function Enclosing_Subprogram
(E
: Entity_Id
) return Entity_Id
is
6132 Dynamic_Scope
: constant Entity_Id
:= Enclosing_Dynamic_Scope
(E
);
6135 if Dynamic_Scope
= Standard_Standard
then
6138 elsif Dynamic_Scope
= Empty
then
6141 elsif Ekind
(Dynamic_Scope
) = E_Subprogram_Body
then
6142 return Corresponding_Spec
(Parent
(Parent
(Dynamic_Scope
)));
6144 elsif Ekind
(Dynamic_Scope
) = E_Block
6145 or else Ekind
(Dynamic_Scope
) = E_Return_Statement
6147 return Enclosing_Subprogram
(Dynamic_Scope
);
6149 elsif Ekind
(Dynamic_Scope
) = E_Task_Type
then
6150 return Get_Task_Body_Procedure
(Dynamic_Scope
);
6152 elsif Ekind
(Dynamic_Scope
) = E_Limited_Private_Type
6153 and then Present
(Full_View
(Dynamic_Scope
))
6154 and then Ekind
(Full_View
(Dynamic_Scope
)) = E_Task_Type
6156 return Get_Task_Body_Procedure
(Full_View
(Dynamic_Scope
));
6158 -- No body is generated if the protected operation is eliminated
6160 elsif Convention
(Dynamic_Scope
) = Convention_Protected
6161 and then not Is_Eliminated
(Dynamic_Scope
)
6162 and then Present
(Protected_Body_Subprogram
(Dynamic_Scope
))
6164 return Protected_Body_Subprogram
(Dynamic_Scope
);
6167 return Dynamic_Scope
;
6169 end Enclosing_Subprogram
;
6171 ------------------------
6172 -- Ensure_Freeze_Node --
6173 ------------------------
6175 procedure Ensure_Freeze_Node
(E
: Entity_Id
) is
6178 if No
(Freeze_Node
(E
)) then
6179 FN
:= Make_Freeze_Entity
(Sloc
(E
));
6180 Set_Has_Delayed_Freeze
(E
);
6181 Set_Freeze_Node
(E
, FN
);
6182 Set_Access_Types_To_Process
(FN
, No_Elist
);
6183 Set_TSS_Elist
(FN
, No_Elist
);
6186 end Ensure_Freeze_Node
;
6192 procedure Enter_Name
(Def_Id
: Entity_Id
) is
6193 C
: constant Entity_Id
:= Current_Entity
(Def_Id
);
6194 E
: constant Entity_Id
:= Current_Entity_In_Scope
(Def_Id
);
6195 S
: constant Entity_Id
:= Current_Scope
;
6198 Generate_Definition
(Def_Id
);
6200 -- Add new name to current scope declarations. Check for duplicate
6201 -- declaration, which may or may not be a genuine error.
6205 -- Case of previous entity entered because of a missing declaration
6206 -- or else a bad subtype indication. Best is to use the new entity,
6207 -- and make the previous one invisible.
6209 if Etype
(E
) = Any_Type
then
6210 Set_Is_Immediately_Visible
(E
, False);
6212 -- Case of renaming declaration constructed for package instances.
6213 -- if there is an explicit declaration with the same identifier,
6214 -- the renaming is not immediately visible any longer, but remains
6215 -- visible through selected component notation.
6217 elsif Nkind
(Parent
(E
)) = N_Package_Renaming_Declaration
6218 and then not Comes_From_Source
(E
)
6220 Set_Is_Immediately_Visible
(E
, False);
6222 -- The new entity may be the package renaming, which has the same
6223 -- same name as a generic formal which has been seen already.
6225 elsif Nkind
(Parent
(Def_Id
)) = N_Package_Renaming_Declaration
6226 and then not Comes_From_Source
(Def_Id
)
6228 Set_Is_Immediately_Visible
(E
, False);
6230 -- For a fat pointer corresponding to a remote access to subprogram,
6231 -- we use the same identifier as the RAS type, so that the proper
6232 -- name appears in the stub. This type is only retrieved through
6233 -- the RAS type and never by visibility, and is not added to the
6234 -- visibility list (see below).
6236 elsif Nkind
(Parent
(Def_Id
)) = N_Full_Type_Declaration
6237 and then Ekind
(Def_Id
) = E_Record_Type
6238 and then Present
(Corresponding_Remote_Type
(Def_Id
))
6242 -- Case of an implicit operation or derived literal. The new entity
6243 -- hides the implicit one, which is removed from all visibility,
6244 -- i.e. the entity list of its scope, and homonym chain of its name.
6246 elsif (Is_Overloadable
(E
) and then Is_Inherited_Operation
(E
))
6247 or else Is_Internal
(E
)
6251 Prev_Vis
: Entity_Id
;
6252 Decl
: constant Node_Id
:= Parent
(E
);
6255 -- If E is an implicit declaration, it cannot be the first
6256 -- entity in the scope.
6258 Prev
:= First_Entity
(Current_Scope
);
6259 while Present
(Prev
) and then Next_Entity
(Prev
) /= E
loop
6265 -- If E is not on the entity chain of the current scope,
6266 -- it is an implicit declaration in the generic formal
6267 -- part of a generic subprogram. When analyzing the body,
6268 -- the generic formals are visible but not on the entity
6269 -- chain of the subprogram. The new entity will become
6270 -- the visible one in the body.
6273 (Nkind
(Parent
(Decl
)) = N_Generic_Subprogram_Declaration
);
6277 Set_Next_Entity
(Prev
, Next_Entity
(E
));
6279 if No
(Next_Entity
(Prev
)) then
6280 Set_Last_Entity
(Current_Scope
, Prev
);
6283 if E
= Current_Entity
(E
) then
6287 Prev_Vis
:= Current_Entity
(E
);
6288 while Homonym
(Prev_Vis
) /= E
loop
6289 Prev_Vis
:= Homonym
(Prev_Vis
);
6293 if Present
(Prev_Vis
) then
6295 -- Skip E in the visibility chain
6297 Set_Homonym
(Prev_Vis
, Homonym
(E
));
6300 Set_Name_Entity_Id
(Chars
(E
), Homonym
(E
));
6305 -- This section of code could use a comment ???
6307 elsif Present
(Etype
(E
))
6308 and then Is_Concurrent_Type
(Etype
(E
))
6313 -- If the homograph is a protected component renaming, it should not
6314 -- be hiding the current entity. Such renamings are treated as weak
6317 elsif Is_Prival
(E
) then
6318 Set_Is_Immediately_Visible
(E
, False);
6320 -- In this case the current entity is a protected component renaming.
6321 -- Perform minimal decoration by setting the scope and return since
6322 -- the prival should not be hiding other visible entities.
6324 elsif Is_Prival
(Def_Id
) then
6325 Set_Scope
(Def_Id
, Current_Scope
);
6328 -- Analogous to privals, the discriminal generated for an entry index
6329 -- parameter acts as a weak declaration. Perform minimal decoration
6330 -- to avoid bogus errors.
6332 elsif Is_Discriminal
(Def_Id
)
6333 and then Ekind
(Discriminal_Link
(Def_Id
)) = E_Entry_Index_Parameter
6335 Set_Scope
(Def_Id
, Current_Scope
);
6338 -- In the body or private part of an instance, a type extension may
6339 -- introduce a component with the same name as that of an actual. The
6340 -- legality rule is not enforced, but the semantics of the full type
6341 -- with two components of same name are not clear at this point???
6343 elsif In_Instance_Not_Visible
then
6346 -- When compiling a package body, some child units may have become
6347 -- visible. They cannot conflict with local entities that hide them.
6349 elsif Is_Child_Unit
(E
)
6350 and then In_Open_Scopes
(Scope
(E
))
6351 and then not Is_Immediately_Visible
(E
)
6355 -- Conversely, with front-end inlining we may compile the parent body
6356 -- first, and a child unit subsequently. The context is now the
6357 -- parent spec, and body entities are not visible.
6359 elsif Is_Child_Unit
(Def_Id
)
6360 and then Is_Package_Body_Entity
(E
)
6361 and then not In_Package_Body
(Current_Scope
)
6365 -- Case of genuine duplicate declaration
6368 Error_Msg_Sloc
:= Sloc
(E
);
6370 -- If the previous declaration is an incomplete type declaration
6371 -- this may be an attempt to complete it with a private type. The
6372 -- following avoids confusing cascaded errors.
6374 if Nkind
(Parent
(E
)) = N_Incomplete_Type_Declaration
6375 and then Nkind
(Parent
(Def_Id
)) = N_Private_Type_Declaration
6378 ("incomplete type cannot be completed with a private " &
6379 "declaration", Parent
(Def_Id
));
6380 Set_Is_Immediately_Visible
(E
, False);
6381 Set_Full_View
(E
, Def_Id
);
6383 -- An inherited component of a record conflicts with a new
6384 -- discriminant. The discriminant is inserted first in the scope,
6385 -- but the error should be posted on it, not on the component.
6387 elsif Ekind
(E
) = E_Discriminant
6388 and then Present
(Scope
(Def_Id
))
6389 and then Scope
(Def_Id
) /= Current_Scope
6391 Error_Msg_Sloc
:= Sloc
(Def_Id
);
6392 Error_Msg_N
("& conflicts with declaration#", E
);
6395 -- If the name of the unit appears in its own context clause, a
6396 -- dummy package with the name has already been created, and the
6397 -- error emitted. Try to continue quietly.
6399 elsif Error_Posted
(E
)
6400 and then Sloc
(E
) = No_Location
6401 and then Nkind
(Parent
(E
)) = N_Package_Specification
6402 and then Current_Scope
= Standard_Standard
6404 Set_Scope
(Def_Id
, Current_Scope
);
6408 Error_Msg_N
("& conflicts with declaration#", Def_Id
);
6410 -- Avoid cascaded messages with duplicate components in
6413 if Ekind_In
(E
, E_Component
, E_Discriminant
) then
6418 if Nkind
(Parent
(Parent
(Def_Id
))) =
6419 N_Generic_Subprogram_Declaration
6421 Defining_Entity
(Specification
(Parent
(Parent
(Def_Id
))))
6423 Error_Msg_N
("\generic units cannot be overloaded", Def_Id
);
6426 -- If entity is in standard, then we are in trouble, because it
6427 -- means that we have a library package with a duplicated name.
6428 -- That's hard to recover from, so abort.
6430 if S
= Standard_Standard
then
6431 raise Unrecoverable_Error
;
6433 -- Otherwise we continue with the declaration. Having two
6434 -- identical declarations should not cause us too much trouble.
6442 -- If we fall through, declaration is OK, at least OK enough to continue
6444 -- If Def_Id is a discriminant or a record component we are in the midst
6445 -- of inheriting components in a derived record definition. Preserve
6446 -- their Ekind and Etype.
6448 if Ekind_In
(Def_Id
, E_Discriminant
, E_Component
) then
6451 -- If a type is already set, leave it alone (happens when a type
6452 -- declaration is reanalyzed following a call to the optimizer).
6454 elsif Present
(Etype
(Def_Id
)) then
6457 -- Otherwise, the kind E_Void insures that premature uses of the entity
6458 -- will be detected. Any_Type insures that no cascaded errors will occur
6461 Set_Ekind
(Def_Id
, E_Void
);
6462 Set_Etype
(Def_Id
, Any_Type
);
6465 -- Inherited discriminants and components in derived record types are
6466 -- immediately visible. Itypes are not.
6468 -- Unless the Itype is for a record type with a corresponding remote
6469 -- type (what is that about, it was not commented ???)
6471 if Ekind_In
(Def_Id
, E_Discriminant
, E_Component
)
6473 ((not Is_Record_Type
(Def_Id
)
6474 or else No
(Corresponding_Remote_Type
(Def_Id
)))
6475 and then not Is_Itype
(Def_Id
))
6477 Set_Is_Immediately_Visible
(Def_Id
);
6478 Set_Current_Entity
(Def_Id
);
6481 Set_Homonym
(Def_Id
, C
);
6482 Append_Entity
(Def_Id
, S
);
6483 Set_Public_Status
(Def_Id
);
6485 -- Declaring a homonym is not allowed in SPARK ...
6487 if Present
(C
) and then Restriction_Check_Required
(SPARK_05
) then
6489 Enclosing_Subp
: constant Node_Id
:= Enclosing_Subprogram
(Def_Id
);
6490 Enclosing_Pack
: constant Node_Id
:= Enclosing_Package
(Def_Id
);
6491 Other_Scope
: constant Node_Id
:= Enclosing_Dynamic_Scope
(C
);
6494 -- ... unless the new declaration is in a subprogram, and the
6495 -- visible declaration is a variable declaration or a parameter
6496 -- specification outside that subprogram.
6498 if Present
(Enclosing_Subp
)
6499 and then Nkind_In
(Parent
(C
), N_Object_Declaration
,
6500 N_Parameter_Specification
)
6501 and then not Scope_Within_Or_Same
(Other_Scope
, Enclosing_Subp
)
6505 -- ... or the new declaration is in a package, and the visible
6506 -- declaration occurs outside that package.
6508 elsif Present
(Enclosing_Pack
)
6509 and then not Scope_Within_Or_Same
(Other_Scope
, Enclosing_Pack
)
6513 -- ... or the new declaration is a component declaration in a
6514 -- record type definition.
6516 elsif Nkind
(Parent
(Def_Id
)) = N_Component_Declaration
then
6519 -- Don't issue error for non-source entities
6521 elsif Comes_From_Source
(Def_Id
)
6522 and then Comes_From_Source
(C
)
6524 Error_Msg_Sloc
:= Sloc
(C
);
6525 Check_SPARK_05_Restriction
6526 ("redeclaration of identifier &#", Def_Id
);
6531 -- Warn if new entity hides an old one
6533 if Warn_On_Hiding
and then Present
(C
)
6535 -- Don't warn for record components since they always have a well
6536 -- defined scope which does not confuse other uses. Note that in
6537 -- some cases, Ekind has not been set yet.
6539 and then Ekind
(C
) /= E_Component
6540 and then Ekind
(C
) /= E_Discriminant
6541 and then Nkind
(Parent
(C
)) /= N_Component_Declaration
6542 and then Ekind
(Def_Id
) /= E_Component
6543 and then Ekind
(Def_Id
) /= E_Discriminant
6544 and then Nkind
(Parent
(Def_Id
)) /= N_Component_Declaration
6546 -- Don't warn for one character variables. It is too common to use
6547 -- such variables as locals and will just cause too many false hits.
6549 and then Length_Of_Name
(Chars
(C
)) /= 1
6551 -- Don't warn for non-source entities
6553 and then Comes_From_Source
(C
)
6554 and then Comes_From_Source
(Def_Id
)
6556 -- Don't warn unless entity in question is in extended main source
6558 and then In_Extended_Main_Source_Unit
(Def_Id
)
6560 -- Finally, the hidden entity must be either immediately visible or
6561 -- use visible (i.e. from a used package).
6564 (Is_Immediately_Visible
(C
)
6566 Is_Potentially_Use_Visible
(C
))
6568 Error_Msg_Sloc
:= Sloc
(C
);
6569 Error_Msg_N
("declaration hides &#?h?", Def_Id
);
6577 function Entity_Of
(N
: Node_Id
) return Entity_Id
is
6583 if Is_Entity_Name
(N
) then
6586 -- Follow a possible chain of renamings to reach the root renamed
6590 and then Is_Object
(Id
)
6591 and then Present
(Renamed_Object
(Id
))
6593 if Is_Entity_Name
(Renamed_Object
(Id
)) then
6594 Id
:= Entity
(Renamed_Object
(Id
));
6605 --------------------------
6606 -- Explain_Limited_Type --
6607 --------------------------
6609 procedure Explain_Limited_Type
(T
: Entity_Id
; N
: Node_Id
) is
6613 -- For array, component type must be limited
6615 if Is_Array_Type
(T
) then
6616 Error_Msg_Node_2
:= T
;
6618 ("\component type& of type& is limited", N
, Component_Type
(T
));
6619 Explain_Limited_Type
(Component_Type
(T
), N
);
6621 elsif Is_Record_Type
(T
) then
6623 -- No need for extra messages if explicit limited record
6625 if Is_Limited_Record
(Base_Type
(T
)) then
6629 -- Otherwise find a limited component. Check only components that
6630 -- come from source, or inherited components that appear in the
6631 -- source of the ancestor.
6633 C
:= First_Component
(T
);
6634 while Present
(C
) loop
6635 if Is_Limited_Type
(Etype
(C
))
6637 (Comes_From_Source
(C
)
6639 (Present
(Original_Record_Component
(C
))
6641 Comes_From_Source
(Original_Record_Component
(C
))))
6643 Error_Msg_Node_2
:= T
;
6644 Error_Msg_NE
("\component& of type& has limited type", N
, C
);
6645 Explain_Limited_Type
(Etype
(C
), N
);
6652 -- The type may be declared explicitly limited, even if no component
6653 -- of it is limited, in which case we fall out of the loop.
6656 end Explain_Limited_Type
;
6658 -------------------------------
6659 -- Extensions_Visible_Status --
6660 -------------------------------
6662 function Extensions_Visible_Status
6663 (Id
: Entity_Id
) return Extensions_Visible_Mode
6672 -- When a formal parameter is subject to Extensions_Visible, the pragma
6673 -- is stored in the contract of related subprogram.
6675 if Is_Formal
(Id
) then
6678 elsif Is_Subprogram_Or_Generic_Subprogram
(Id
) then
6681 -- No other construct carries this pragma
6684 return Extensions_Visible_None
;
6687 Prag
:= Get_Pragma
(Subp
, Pragma_Extensions_Visible
);
6689 -- In certain cases analysis may request the Extensions_Visible status
6690 -- of an expression function before the pragma has been analyzed yet.
6691 -- Inspect the declarative items after the expression function looking
6692 -- for the pragma (if any).
6694 if No
(Prag
) and then Is_Expression_Function
(Subp
) then
6695 Decl
:= Next
(Unit_Declaration_Node
(Subp
));
6696 while Present
(Decl
) loop
6697 if Nkind
(Decl
) = N_Pragma
6698 and then Pragma_Name
(Decl
) = Name_Extensions_Visible
6703 -- A source construct ends the region where Extensions_Visible may
6704 -- appear, stop the traversal. An expanded expression function is
6705 -- no longer a source construct, but it must still be recognized.
6707 elsif Comes_From_Source
(Decl
)
6709 (Nkind_In
(Decl
, N_Subprogram_Body
,
6710 N_Subprogram_Declaration
)
6711 and then Is_Expression_Function
(Defining_Entity
(Decl
)))
6720 -- Extract the value from the Boolean expression (if any)
6722 if Present
(Prag
) then
6723 Arg
:= First
(Pragma_Argument_Associations
(Prag
));
6725 if Present
(Arg
) then
6726 Expr
:= Get_Pragma_Arg
(Arg
);
6728 -- When the associated subprogram is an expression function, the
6729 -- argument of the pragma may not have been analyzed.
6731 if not Analyzed
(Expr
) then
6732 Preanalyze_And_Resolve
(Expr
, Standard_Boolean
);
6735 -- Guard against cascading errors when the argument of pragma
6736 -- Extensions_Visible is not a valid static Boolean expression.
6738 if Error_Posted
(Expr
) then
6739 return Extensions_Visible_None
;
6741 elsif Is_True
(Expr_Value
(Expr
)) then
6742 return Extensions_Visible_True
;
6745 return Extensions_Visible_False
;
6748 -- Otherwise the aspect or pragma defaults to True
6751 return Extensions_Visible_True
;
6754 -- Otherwise aspect or pragma Extensions_Visible is not inherited or
6755 -- directly specified. In SPARK code, its value defaults to "False".
6757 elsif SPARK_Mode
= On
then
6758 return Extensions_Visible_False
;
6760 -- In non-SPARK code, aspect or pragma Extensions_Visible defaults to
6764 return Extensions_Visible_True
;
6766 end Extensions_Visible_Status
;
6772 procedure Find_Actual
6774 Formal
: out Entity_Id
;
6777 Context
: constant Node_Id
:= Parent
(N
);
6782 if Nkind_In
(Context
, N_Indexed_Component
, N_Selected_Component
)
6783 and then N
= Prefix
(Context
)
6785 Find_Actual
(Context
, Formal
, Call
);
6788 elsif Nkind
(Context
) = N_Parameter_Association
6789 and then N
= Explicit_Actual_Parameter
(Context
)
6791 Call
:= Parent
(Context
);
6793 elsif Nkind_In
(Context
, N_Entry_Call_Statement
,
6795 N_Procedure_Call_Statement
)
6805 -- If we have a call to a subprogram look for the parameter. Note that
6806 -- we exclude overloaded calls, since we don't know enough to be sure
6807 -- of giving the right answer in this case.
6809 if Nkind_In
(Call
, N_Entry_Call_Statement
,
6811 N_Procedure_Call_Statement
)
6813 Call_Nam
:= Name
(Call
);
6815 -- A call to a protected or task entry appears as a selected
6816 -- component rather than an expanded name.
6818 if Nkind
(Call_Nam
) = N_Selected_Component
then
6819 Call_Nam
:= Selector_Name
(Call_Nam
);
6822 if Is_Entity_Name
(Call_Nam
)
6823 and then Present
(Entity
(Call_Nam
))
6824 and then Is_Overloadable
(Entity
(Call_Nam
))
6825 and then not Is_Overloaded
(Call_Nam
)
6827 -- If node is name in call it is not an actual
6829 if N
= Call_Nam
then
6835 -- Fall here if we are definitely a parameter
6837 Actual
:= First_Actual
(Call
);
6838 Formal
:= First_Formal
(Entity
(Call_Nam
));
6839 while Present
(Formal
) and then Present
(Actual
) loop
6843 -- An actual that is the prefix in a prefixed call may have
6844 -- been rewritten in the call, after the deferred reference
6845 -- was collected. Check if sloc and kinds and names match.
6847 elsif Sloc
(Actual
) = Sloc
(N
)
6848 and then Nkind
(Actual
) = N_Identifier
6849 and then Nkind
(Actual
) = Nkind
(N
)
6850 and then Chars
(Actual
) = Chars
(N
)
6855 Actual
:= Next_Actual
(Actual
);
6856 Formal
:= Next_Formal
(Formal
);
6862 -- Fall through here if we did not find matching actual
6868 ---------------------------
6869 -- Find_Body_Discriminal --
6870 ---------------------------
6872 function Find_Body_Discriminal
6873 (Spec_Discriminant
: Entity_Id
) return Entity_Id
6879 -- If expansion is suppressed, then the scope can be the concurrent type
6880 -- itself rather than a corresponding concurrent record type.
6882 if Is_Concurrent_Type
(Scope
(Spec_Discriminant
)) then
6883 Tsk
:= Scope
(Spec_Discriminant
);
6886 pragma Assert
(Is_Concurrent_Record_Type
(Scope
(Spec_Discriminant
)));
6888 Tsk
:= Corresponding_Concurrent_Type
(Scope
(Spec_Discriminant
));
6891 -- Find discriminant of original concurrent type, and use its current
6892 -- discriminal, which is the renaming within the task/protected body.
6894 Disc
:= First_Discriminant
(Tsk
);
6895 while Present
(Disc
) loop
6896 if Chars
(Disc
) = Chars
(Spec_Discriminant
) then
6897 return Discriminal
(Disc
);
6900 Next_Discriminant
(Disc
);
6903 -- That loop should always succeed in finding a matching entry and
6904 -- returning. Fatal error if not.
6906 raise Program_Error
;
6907 end Find_Body_Discriminal
;
6909 -------------------------------------
6910 -- Find_Corresponding_Discriminant --
6911 -------------------------------------
6913 function Find_Corresponding_Discriminant
6915 Typ
: Entity_Id
) return Entity_Id
6917 Par_Disc
: Entity_Id
;
6918 Old_Disc
: Entity_Id
;
6919 New_Disc
: Entity_Id
;
6922 Par_Disc
:= Original_Record_Component
(Original_Discriminant
(Id
));
6924 -- The original type may currently be private, and the discriminant
6925 -- only appear on its full view.
6927 if Is_Private_Type
(Scope
(Par_Disc
))
6928 and then not Has_Discriminants
(Scope
(Par_Disc
))
6929 and then Present
(Full_View
(Scope
(Par_Disc
)))
6931 Old_Disc
:= First_Discriminant
(Full_View
(Scope
(Par_Disc
)));
6933 Old_Disc
:= First_Discriminant
(Scope
(Par_Disc
));
6936 if Is_Class_Wide_Type
(Typ
) then
6937 New_Disc
:= First_Discriminant
(Root_Type
(Typ
));
6939 New_Disc
:= First_Discriminant
(Typ
);
6942 while Present
(Old_Disc
) and then Present
(New_Disc
) loop
6943 if Old_Disc
= Par_Disc
then
6947 Next_Discriminant
(Old_Disc
);
6948 Next_Discriminant
(New_Disc
);
6951 -- Should always find it
6953 raise Program_Error
;
6954 end Find_Corresponding_Discriminant
;
6956 ----------------------------------
6957 -- Find_Enclosing_Iterator_Loop --
6958 ----------------------------------
6960 function Find_Enclosing_Iterator_Loop
(Id
: Entity_Id
) return Entity_Id
is
6965 -- Traverse the scope chain looking for an iterator loop. Such loops are
6966 -- usually transformed into blocks, hence the use of Original_Node.
6969 while Present
(S
) and then S
/= Standard_Standard
loop
6970 if Ekind
(S
) = E_Loop
6971 and then Nkind
(Parent
(S
)) = N_Implicit_Label_Declaration
6973 Constr
:= Original_Node
(Label_Construct
(Parent
(S
)));
6975 if Nkind
(Constr
) = N_Loop_Statement
6976 and then Present
(Iteration_Scheme
(Constr
))
6977 and then Nkind
(Iterator_Specification
6978 (Iteration_Scheme
(Constr
))) =
6979 N_Iterator_Specification
6989 end Find_Enclosing_Iterator_Loop
;
6991 ------------------------------------
6992 -- Find_Loop_In_Conditional_Block --
6993 ------------------------------------
6995 function Find_Loop_In_Conditional_Block
(N
: Node_Id
) return Node_Id
is
7001 if Nkind
(Stmt
) = N_If_Statement
then
7002 Stmt
:= First
(Then_Statements
(Stmt
));
7005 pragma Assert
(Nkind
(Stmt
) = N_Block_Statement
);
7007 -- Inspect the statements of the conditional block. In general the loop
7008 -- should be the first statement in the statement sequence of the block,
7009 -- but the finalization machinery may have introduced extra object
7012 Stmt
:= First
(Statements
(Handled_Statement_Sequence
(Stmt
)));
7013 while Present
(Stmt
) loop
7014 if Nkind
(Stmt
) = N_Loop_Statement
then
7021 -- The expansion of attribute 'Loop_Entry produced a malformed block
7023 raise Program_Error
;
7024 end Find_Loop_In_Conditional_Block
;
7026 --------------------------
7027 -- Find_Overlaid_Entity --
7028 --------------------------
7030 procedure Find_Overlaid_Entity
7032 Ent
: out Entity_Id
;
7038 -- We are looking for one of the two following forms:
7040 -- for X'Address use Y'Address
7044 -- Const : constant Address := expr;
7046 -- for X'Address use Const;
7048 -- In the second case, the expr is either Y'Address, or recursively a
7049 -- constant that eventually references Y'Address.
7054 if Nkind
(N
) = N_Attribute_Definition_Clause
7055 and then Chars
(N
) = Name_Address
7057 Expr
:= Expression
(N
);
7059 -- This loop checks the form of the expression for Y'Address,
7060 -- using recursion to deal with intermediate constants.
7063 -- Check for Y'Address
7065 if Nkind
(Expr
) = N_Attribute_Reference
7066 and then Attribute_Name
(Expr
) = Name_Address
7068 Expr
:= Prefix
(Expr
);
7071 -- Check for Const where Const is a constant entity
7073 elsif Is_Entity_Name
(Expr
)
7074 and then Ekind
(Entity
(Expr
)) = E_Constant
7076 Expr
:= Constant_Value
(Entity
(Expr
));
7078 -- Anything else does not need checking
7085 -- This loop checks the form of the prefix for an entity, using
7086 -- recursion to deal with intermediate components.
7089 -- Check for Y where Y is an entity
7091 if Is_Entity_Name
(Expr
) then
7092 Ent
:= Entity
(Expr
);
7095 -- Check for components
7098 Nkind_In
(Expr
, N_Selected_Component
, N_Indexed_Component
)
7100 Expr
:= Prefix
(Expr
);
7103 -- Anything else does not need checking
7110 end Find_Overlaid_Entity
;
7112 -------------------------
7113 -- Find_Parameter_Type --
7114 -------------------------
7116 function Find_Parameter_Type
(Param
: Node_Id
) return Entity_Id
is
7118 if Nkind
(Param
) /= N_Parameter_Specification
then
7121 -- For an access parameter, obtain the type from the formal entity
7122 -- itself, because access to subprogram nodes do not carry a type.
7123 -- Shouldn't we always use the formal entity ???
7125 elsif Nkind
(Parameter_Type
(Param
)) = N_Access_Definition
then
7126 return Etype
(Defining_Identifier
(Param
));
7129 return Etype
(Parameter_Type
(Param
));
7131 end Find_Parameter_Type
;
7133 -----------------------------------
7134 -- Find_Placement_In_State_Space --
7135 -----------------------------------
7137 procedure Find_Placement_In_State_Space
7138 (Item_Id
: Entity_Id
;
7139 Placement
: out State_Space_Kind
;
7140 Pack_Id
: out Entity_Id
)
7142 Context
: Entity_Id
;
7145 -- Assume that the item does not appear in the state space of a package
7147 Placement
:= Not_In_Package
;
7150 -- Climb the scope stack and examine the enclosing context
7152 Context
:= Scope
(Item_Id
);
7153 while Present
(Context
) and then Context
/= Standard_Standard
loop
7154 if Ekind
(Context
) = E_Package
then
7157 -- A package body is a cut off point for the traversal as the item
7158 -- cannot be visible to the outside from this point on. Note that
7159 -- this test must be done first as a body is also classified as a
7162 if In_Package_Body
(Context
) then
7163 Placement
:= Body_State_Space
;
7166 -- The private part of a package is a cut off point for the
7167 -- traversal as the item cannot be visible to the outside from
7170 elsif In_Private_Part
(Context
) then
7171 Placement
:= Private_State_Space
;
7174 -- When the item appears in the visible state space of a package,
7175 -- continue to climb the scope stack as this may not be the final
7179 Placement
:= Visible_State_Space
;
7181 -- The visible state space of a child unit acts as the proper
7182 -- placement of an item.
7184 if Is_Child_Unit
(Context
) then
7189 -- The item or its enclosing package appear in a construct that has
7193 Placement
:= Not_In_Package
;
7197 Context
:= Scope
(Context
);
7199 end Find_Placement_In_State_Space
;
7201 ------------------------
7202 -- Find_Specific_Type --
7203 ------------------------
7205 function Find_Specific_Type
(CW
: Entity_Id
) return Entity_Id
is
7206 Typ
: Entity_Id
:= Root_Type
(CW
);
7209 if Ekind
(Typ
) = E_Incomplete_Type
then
7210 if From_Limited_With
(Typ
) then
7211 Typ
:= Non_Limited_View
(Typ
);
7213 Typ
:= Full_View
(Typ
);
7217 if Is_Private_Type
(Typ
)
7218 and then not Is_Tagged_Type
(Typ
)
7219 and then Present
(Full_View
(Typ
))
7221 return Full_View
(Typ
);
7225 end Find_Specific_Type
;
7227 -----------------------------
7228 -- Find_Static_Alternative --
7229 -----------------------------
7231 function Find_Static_Alternative
(N
: Node_Id
) return Node_Id
is
7232 Expr
: constant Node_Id
:= Expression
(N
);
7233 Val
: constant Uint
:= Expr_Value
(Expr
);
7238 Alt
:= First
(Alternatives
(N
));
7241 if Nkind
(Alt
) /= N_Pragma
then
7242 Choice
:= First
(Discrete_Choices
(Alt
));
7243 while Present
(Choice
) loop
7245 -- Others choice, always matches
7247 if Nkind
(Choice
) = N_Others_Choice
then
7250 -- Range, check if value is in the range
7252 elsif Nkind
(Choice
) = N_Range
then
7254 Val
>= Expr_Value
(Low_Bound
(Choice
))
7256 Val
<= Expr_Value
(High_Bound
(Choice
));
7258 -- Choice is a subtype name. Note that we know it must
7259 -- be a static subtype, since otherwise it would have
7260 -- been diagnosed as illegal.
7262 elsif Is_Entity_Name
(Choice
)
7263 and then Is_Type
(Entity
(Choice
))
7265 exit Search
when Is_In_Range
(Expr
, Etype
(Choice
),
7266 Assume_Valid
=> False);
7268 -- Choice is a subtype indication
7270 elsif Nkind
(Choice
) = N_Subtype_Indication
then
7272 C
: constant Node_Id
:= Constraint
(Choice
);
7273 R
: constant Node_Id
:= Range_Expression
(C
);
7277 Val
>= Expr_Value
(Low_Bound
(R
))
7279 Val
<= Expr_Value
(High_Bound
(R
));
7282 -- Choice is a simple expression
7285 exit Search
when Val
= Expr_Value
(Choice
);
7293 pragma Assert
(Present
(Alt
));
7296 -- The above loop *must* terminate by finding a match, since
7297 -- we know the case statement is valid, and the value of the
7298 -- expression is known at compile time. When we fall out of
7299 -- the loop, Alt points to the alternative that we know will
7300 -- be selected at run time.
7303 end Find_Static_Alternative
;
7309 function First_Actual
(Node
: Node_Id
) return Node_Id
is
7313 if No
(Parameter_Associations
(Node
)) then
7317 N
:= First
(Parameter_Associations
(Node
));
7319 if Nkind
(N
) = N_Parameter_Association
then
7320 return First_Named_Actual
(Node
);
7330 function Fix_Msg
(Id
: Entity_Id
; Msg
: String) return String is
7331 Is_Task
: constant Boolean :=
7332 Ekind_In
(Id
, E_Task_Body
, E_Task_Type
)
7333 or else Is_Single_Task_Object
(Id
);
7334 Msg_Last
: constant Natural := Msg
'Last;
7335 Msg_Index
: Natural;
7336 Res
: String (Msg
'Range) := (others => ' ');
7337 Res_Index
: Natural;
7340 -- Copy all characters from the input message Msg to result Res with
7341 -- suitable replacements.
7343 Msg_Index
:= Msg
'First;
7344 Res_Index
:= Res
'First;
7345 while Msg_Index
<= Msg_Last
loop
7347 -- Replace "subprogram" with a different word
7349 if Msg_Index
<= Msg_Last
- 10
7350 and then Msg
(Msg_Index
.. Msg_Index
+ 9) = "subprogram"
7352 if Ekind_In
(Id
, E_Entry
, E_Entry_Family
) then
7353 Res
(Res_Index
.. Res_Index
+ 4) := "entry";
7354 Res_Index
:= Res_Index
+ 5;
7357 Res
(Res_Index
.. Res_Index
+ 8) := "task type";
7358 Res_Index
:= Res_Index
+ 9;
7361 Res
(Res_Index
.. Res_Index
+ 9) := "subprogram";
7362 Res_Index
:= Res_Index
+ 10;
7365 Msg_Index
:= Msg_Index
+ 10;
7367 -- Replace "protected" with a different word
7369 elsif Msg_Index
<= Msg_Last
- 9
7370 and then Msg
(Msg_Index
.. Msg_Index
+ 8) = "protected"
7373 Res
(Res_Index
.. Res_Index
+ 3) := "task";
7374 Res_Index
:= Res_Index
+ 4;
7375 Msg_Index
:= Msg_Index
+ 9;
7377 -- Otherwise copy the character
7380 Res
(Res_Index
) := Msg
(Msg_Index
);
7381 Msg_Index
:= Msg_Index
+ 1;
7382 Res_Index
:= Res_Index
+ 1;
7386 return Res
(Res
'First .. Res_Index
- 1);
7389 -----------------------
7390 -- Gather_Components --
7391 -----------------------
7393 procedure Gather_Components
7395 Comp_List
: Node_Id
;
7396 Governed_By
: List_Id
;
7398 Report_Errors
: out Boolean)
7402 Discrete_Choice
: Node_Id
;
7403 Comp_Item
: Node_Id
;
7405 Discrim
: Entity_Id
;
7406 Discrim_Name
: Node_Id
;
7407 Discrim_Value
: Node_Id
;
7410 Report_Errors
:= False;
7412 if No
(Comp_List
) or else Null_Present
(Comp_List
) then
7415 elsif Present
(Component_Items
(Comp_List
)) then
7416 Comp_Item
:= First
(Component_Items
(Comp_List
));
7422 while Present
(Comp_Item
) loop
7424 -- Skip the tag of a tagged record, the interface tags, as well
7425 -- as all items that are not user components (anonymous types,
7426 -- rep clauses, Parent field, controller field).
7428 if Nkind
(Comp_Item
) = N_Component_Declaration
then
7430 Comp
: constant Entity_Id
:= Defining_Identifier
(Comp_Item
);
7432 if not Is_Tag
(Comp
) and then Chars
(Comp
) /= Name_uParent
then
7433 Append_Elmt
(Comp
, Into
);
7441 if No
(Variant_Part
(Comp_List
)) then
7444 Discrim_Name
:= Name
(Variant_Part
(Comp_List
));
7445 Variant
:= First_Non_Pragma
(Variants
(Variant_Part
(Comp_List
)));
7448 -- Look for the discriminant that governs this variant part.
7449 -- The discriminant *must* be in the Governed_By List
7451 Assoc
:= First
(Governed_By
);
7452 Find_Constraint
: loop
7453 Discrim
:= First
(Choices
(Assoc
));
7454 exit Find_Constraint
when Chars
(Discrim_Name
) = Chars
(Discrim
)
7455 or else (Present
(Corresponding_Discriminant
(Entity
(Discrim
)))
7457 Chars
(Corresponding_Discriminant
(Entity
(Discrim
))) =
7458 Chars
(Discrim_Name
))
7459 or else Chars
(Original_Record_Component
(Entity
(Discrim
)))
7460 = Chars
(Discrim_Name
);
7462 if No
(Next
(Assoc
)) then
7463 if not Is_Constrained
(Typ
)
7464 and then Is_Derived_Type
(Typ
)
7465 and then Present
(Stored_Constraint
(Typ
))
7467 -- If the type is a tagged type with inherited discriminants,
7468 -- use the stored constraint on the parent in order to find
7469 -- the values of discriminants that are otherwise hidden by an
7470 -- explicit constraint. Renamed discriminants are handled in
7473 -- If several parent discriminants are renamed by a single
7474 -- discriminant of the derived type, the call to obtain the
7475 -- Corresponding_Discriminant field only retrieves the last
7476 -- of them. We recover the constraint on the others from the
7477 -- Stored_Constraint as well.
7484 D
:= First_Discriminant
(Etype
(Typ
));
7485 C
:= First_Elmt
(Stored_Constraint
(Typ
));
7486 while Present
(D
) and then Present
(C
) loop
7487 if Chars
(Discrim_Name
) = Chars
(D
) then
7488 if Is_Entity_Name
(Node
(C
))
7489 and then Entity
(Node
(C
)) = Entity
(Discrim
)
7491 -- D is renamed by Discrim, whose value is given in
7498 Make_Component_Association
(Sloc
(Typ
),
7500 (New_Occurrence_Of
(D
, Sloc
(Typ
))),
7501 Duplicate_Subexpr_No_Checks
(Node
(C
)));
7503 exit Find_Constraint
;
7506 Next_Discriminant
(D
);
7513 if No
(Next
(Assoc
)) then
7514 Error_Msg_NE
(" missing value for discriminant&",
7515 First
(Governed_By
), Discrim_Name
);
7516 Report_Errors
:= True;
7521 end loop Find_Constraint
;
7523 Discrim_Value
:= Expression
(Assoc
);
7525 if not Is_OK_Static_Expression
(Discrim_Value
) then
7527 -- If the variant part is governed by a discriminant of the type
7528 -- this is an error. If the variant part and the discriminant are
7529 -- inherited from an ancestor this is legal (AI05-120) unless the
7530 -- components are being gathered for an aggregate, in which case
7531 -- the caller must check Report_Errors.
7533 if Scope
(Original_Record_Component
7534 ((Entity
(First
(Choices
(Assoc
)))))) = Typ
7537 ("value for discriminant & must be static!",
7538 Discrim_Value
, Discrim
);
7539 Why_Not_Static
(Discrim_Value
);
7542 Report_Errors
:= True;
7546 Search_For_Discriminant_Value
: declare
7552 UI_Discrim_Value
: constant Uint
:= Expr_Value
(Discrim_Value
);
7555 Find_Discrete_Value
: while Present
(Variant
) loop
7556 Discrete_Choice
:= First
(Discrete_Choices
(Variant
));
7557 while Present
(Discrete_Choice
) loop
7558 exit Find_Discrete_Value
when
7559 Nkind
(Discrete_Choice
) = N_Others_Choice
;
7561 Get_Index_Bounds
(Discrete_Choice
, Low
, High
);
7563 UI_Low
:= Expr_Value
(Low
);
7564 UI_High
:= Expr_Value
(High
);
7566 exit Find_Discrete_Value
when
7567 UI_Low
<= UI_Discrim_Value
7569 UI_High
>= UI_Discrim_Value
;
7571 Next
(Discrete_Choice
);
7574 Next_Non_Pragma
(Variant
);
7575 end loop Find_Discrete_Value
;
7576 end Search_For_Discriminant_Value
;
7578 if No
(Variant
) then
7580 ("value of discriminant & is out of range", Discrim_Value
, Discrim
);
7581 Report_Errors
:= True;
7585 -- If we have found the corresponding choice, recursively add its
7586 -- components to the Into list. The nested components are part of
7587 -- the same record type.
7590 (Typ
, Component_List
(Variant
), Governed_By
, Into
, Report_Errors
);
7591 end Gather_Components
;
7593 ------------------------
7594 -- Get_Actual_Subtype --
7595 ------------------------
7597 function Get_Actual_Subtype
(N
: Node_Id
) return Entity_Id
is
7598 Typ
: constant Entity_Id
:= Etype
(N
);
7599 Utyp
: Entity_Id
:= Underlying_Type
(Typ
);
7608 -- If what we have is an identifier that references a subprogram
7609 -- formal, or a variable or constant object, then we get the actual
7610 -- subtype from the referenced entity if one has been built.
7612 if Nkind
(N
) = N_Identifier
7614 (Is_Formal
(Entity
(N
))
7615 or else Ekind
(Entity
(N
)) = E_Constant
7616 or else Ekind
(Entity
(N
)) = E_Variable
)
7617 and then Present
(Actual_Subtype
(Entity
(N
)))
7619 return Actual_Subtype
(Entity
(N
));
7621 -- Actual subtype of unchecked union is always itself. We never need
7622 -- the "real" actual subtype. If we did, we couldn't get it anyway
7623 -- because the discriminant is not available. The restrictions on
7624 -- Unchecked_Union are designed to make sure that this is OK.
7626 elsif Is_Unchecked_Union
(Base_Type
(Utyp
)) then
7629 -- Here for the unconstrained case, we must find actual subtype
7630 -- No actual subtype is available, so we must build it on the fly.
7632 -- Checking the type, not the underlying type, for constrainedness
7633 -- seems to be necessary. Maybe all the tests should be on the type???
7635 elsif (not Is_Constrained
(Typ
))
7636 and then (Is_Array_Type
(Utyp
)
7637 or else (Is_Record_Type
(Utyp
)
7638 and then Has_Discriminants
(Utyp
)))
7639 and then not Has_Unknown_Discriminants
(Utyp
)
7640 and then not (Ekind
(Utyp
) = E_String_Literal_Subtype
)
7642 -- Nothing to do if in spec expression (why not???)
7644 if In_Spec_Expression
then
7647 elsif Is_Private_Type
(Typ
) and then not Has_Discriminants
(Typ
) then
7649 -- If the type has no discriminants, there is no subtype to
7650 -- build, even if the underlying type is discriminated.
7654 -- Else build the actual subtype
7657 Decl
:= Build_Actual_Subtype
(Typ
, N
);
7658 Atyp
:= Defining_Identifier
(Decl
);
7660 -- If Build_Actual_Subtype generated a new declaration then use it
7664 -- The actual subtype is an Itype, so analyze the declaration,
7665 -- but do not attach it to the tree, to get the type defined.
7667 Set_Parent
(Decl
, N
);
7668 Set_Is_Itype
(Atyp
);
7669 Analyze
(Decl
, Suppress
=> All_Checks
);
7670 Set_Associated_Node_For_Itype
(Atyp
, N
);
7671 Set_Has_Delayed_Freeze
(Atyp
, False);
7673 -- We need to freeze the actual subtype immediately. This is
7674 -- needed, because otherwise this Itype will not get frozen
7675 -- at all, and it is always safe to freeze on creation because
7676 -- any associated types must be frozen at this point.
7678 Freeze_Itype
(Atyp
, N
);
7681 -- Otherwise we did not build a declaration, so return original
7688 -- For all remaining cases, the actual subtype is the same as
7689 -- the nominal type.
7694 end Get_Actual_Subtype
;
7696 -------------------------------------
7697 -- Get_Actual_Subtype_If_Available --
7698 -------------------------------------
7700 function Get_Actual_Subtype_If_Available
(N
: Node_Id
) return Entity_Id
is
7701 Typ
: constant Entity_Id
:= Etype
(N
);
7704 -- If what we have is an identifier that references a subprogram
7705 -- formal, or a variable or constant object, then we get the actual
7706 -- subtype from the referenced entity if one has been built.
7708 if Nkind
(N
) = N_Identifier
7710 (Is_Formal
(Entity
(N
))
7711 or else Ekind
(Entity
(N
)) = E_Constant
7712 or else Ekind
(Entity
(N
)) = E_Variable
)
7713 and then Present
(Actual_Subtype
(Entity
(N
)))
7715 return Actual_Subtype
(Entity
(N
));
7717 -- Otherwise the Etype of N is returned unchanged
7722 end Get_Actual_Subtype_If_Available
;
7724 ------------------------
7725 -- Get_Body_From_Stub --
7726 ------------------------
7728 function Get_Body_From_Stub
(N
: Node_Id
) return Node_Id
is
7730 return Proper_Body
(Unit
(Library_Unit
(N
)));
7731 end Get_Body_From_Stub
;
7733 ---------------------
7734 -- Get_Cursor_Type --
7735 ---------------------
7737 function Get_Cursor_Type
7739 Typ
: Entity_Id
) return Entity_Id
7743 First_Op
: Entity_Id
;
7747 -- If error already detected, return
7749 if Error_Posted
(Aspect
) then
7753 -- The cursor type for an Iterable aspect is the return type of a
7754 -- non-overloaded First primitive operation. Locate association for
7757 Assoc
:= First
(Component_Associations
(Expression
(Aspect
)));
7759 while Present
(Assoc
) loop
7760 if Chars
(First
(Choices
(Assoc
))) = Name_First
then
7761 First_Op
:= Expression
(Assoc
);
7768 if First_Op
= Any_Id
then
7769 Error_Msg_N
("aspect Iterable must specify First operation", Aspect
);
7775 -- Locate function with desired name and profile in scope of type
7776 -- In the rare case where the type is an integer type, a base type
7777 -- is created for it, check that the base type of the first formal
7778 -- of First matches the base type of the domain.
7780 Func
:= First_Entity
(Scope
(Typ
));
7781 while Present
(Func
) loop
7782 if Chars
(Func
) = Chars
(First_Op
)
7783 and then Ekind
(Func
) = E_Function
7784 and then Present
(First_Formal
(Func
))
7785 and then Base_Type
(Etype
(First_Formal
(Func
))) = Base_Type
(Typ
)
7786 and then No
(Next_Formal
(First_Formal
(Func
)))
7788 if Cursor
/= Any_Type
then
7790 ("Operation First for iterable type must be unique", Aspect
);
7793 Cursor
:= Etype
(Func
);
7800 -- If not found, no way to resolve remaining primitives.
7802 if Cursor
= Any_Type
then
7804 ("No legal primitive operation First for Iterable type", Aspect
);
7808 end Get_Cursor_Type
;
7810 function Get_Cursor_Type
(Typ
: Entity_Id
) return Entity_Id
is
7812 return Etype
(Get_Iterable_Type_Primitive
(Typ
, Name_First
));
7813 end Get_Cursor_Type
;
7815 -------------------------------
7816 -- Get_Default_External_Name --
7817 -------------------------------
7819 function Get_Default_External_Name
(E
: Node_Or_Entity_Id
) return Node_Id
is
7821 Get_Decoded_Name_String
(Chars
(E
));
7823 if Opt
.External_Name_Imp_Casing
= Uppercase
then
7824 Set_Casing
(All_Upper_Case
);
7826 Set_Casing
(All_Lower_Case
);
7830 Make_String_Literal
(Sloc
(E
),
7831 Strval
=> String_From_Name_Buffer
);
7832 end Get_Default_External_Name
;
7834 --------------------------
7835 -- Get_Enclosing_Object --
7836 --------------------------
7838 function Get_Enclosing_Object
(N
: Node_Id
) return Entity_Id
is
7840 if Is_Entity_Name
(N
) then
7844 when N_Indexed_Component |
7846 N_Selected_Component
=>
7848 -- If not generating code, a dereference may be left implicit.
7849 -- In thoses cases, return Empty.
7851 if Is_Access_Type
(Etype
(Prefix
(N
))) then
7854 return Get_Enclosing_Object
(Prefix
(N
));
7857 when N_Type_Conversion
=>
7858 return Get_Enclosing_Object
(Expression
(N
));
7864 end Get_Enclosing_Object
;
7866 ---------------------------
7867 -- Get_Enum_Lit_From_Pos --
7868 ---------------------------
7870 function Get_Enum_Lit_From_Pos
7873 Loc
: Source_Ptr
) return Node_Id
7875 Btyp
: Entity_Id
:= Base_Type
(T
);
7879 -- In the case where the literal is of type Character, Wide_Character
7880 -- or Wide_Wide_Character or of a type derived from them, there needs
7881 -- to be some special handling since there is no explicit chain of
7882 -- literals to search. Instead, an N_Character_Literal node is created
7883 -- with the appropriate Char_Code and Chars fields.
7885 if Is_Standard_Character_Type
(T
) then
7886 Set_Character_Literal_Name
(UI_To_CC
(Pos
));
7888 Make_Character_Literal
(Loc
,
7890 Char_Literal_Value
=> Pos
);
7892 -- For all other cases, we have a complete table of literals, and
7893 -- we simply iterate through the chain of literal until the one
7894 -- with the desired position value is found.
7897 if Is_Private_Type
(Btyp
) and then Present
(Full_View
(Btyp
)) then
7898 Btyp
:= Full_View
(Btyp
);
7901 Lit
:= First_Literal
(Btyp
);
7902 for J
in 1 .. UI_To_Int
(Pos
) loop
7906 return New_Occurrence_Of
(Lit
, Loc
);
7908 end Get_Enum_Lit_From_Pos
;
7910 ------------------------
7911 -- Get_Generic_Entity --
7912 ------------------------
7914 function Get_Generic_Entity
(N
: Node_Id
) return Entity_Id
is
7915 Ent
: constant Entity_Id
:= Entity
(Name
(N
));
7917 if Present
(Renamed_Object
(Ent
)) then
7918 return Renamed_Object
(Ent
);
7922 end Get_Generic_Entity
;
7924 -------------------------------------
7925 -- Get_Incomplete_View_Of_Ancestor --
7926 -------------------------------------
7928 function Get_Incomplete_View_Of_Ancestor
(E
: Entity_Id
) return Entity_Id
is
7929 Cur_Unit
: constant Entity_Id
:= Cunit_Entity
(Current_Sem_Unit
);
7930 Par_Scope
: Entity_Id
;
7931 Par_Type
: Entity_Id
;
7934 -- The incomplete view of an ancestor is only relevant for private
7935 -- derived types in child units.
7937 if not Is_Derived_Type
(E
)
7938 or else not Is_Child_Unit
(Cur_Unit
)
7943 Par_Scope
:= Scope
(Cur_Unit
);
7944 if No
(Par_Scope
) then
7948 Par_Type
:= Etype
(Base_Type
(E
));
7950 -- Traverse list of ancestor types until we find one declared in
7951 -- a parent or grandparent unit (two levels seem sufficient).
7953 while Present
(Par_Type
) loop
7954 if Scope
(Par_Type
) = Par_Scope
7955 or else Scope
(Par_Type
) = Scope
(Par_Scope
)
7959 elsif not Is_Derived_Type
(Par_Type
) then
7963 Par_Type
:= Etype
(Base_Type
(Par_Type
));
7967 -- If none found, there is no relevant ancestor type.
7971 end Get_Incomplete_View_Of_Ancestor
;
7973 ----------------------
7974 -- Get_Index_Bounds --
7975 ----------------------
7977 procedure Get_Index_Bounds
(N
: Node_Id
; L
, H
: out Node_Id
) is
7978 Kind
: constant Node_Kind
:= Nkind
(N
);
7982 if Kind
= N_Range
then
7984 H
:= High_Bound
(N
);
7986 elsif Kind
= N_Subtype_Indication
then
7987 R
:= Range_Expression
(Constraint
(N
));
7995 L
:= Low_Bound
(Range_Expression
(Constraint
(N
)));
7996 H
:= High_Bound
(Range_Expression
(Constraint
(N
)));
7999 elsif Is_Entity_Name
(N
) and then Is_Type
(Entity
(N
)) then
8000 if Error_Posted
(Scalar_Range
(Entity
(N
))) then
8004 elsif Nkind
(Scalar_Range
(Entity
(N
))) = N_Subtype_Indication
then
8005 Get_Index_Bounds
(Scalar_Range
(Entity
(N
)), L
, H
);
8008 L
:= Low_Bound
(Scalar_Range
(Entity
(N
)));
8009 H
:= High_Bound
(Scalar_Range
(Entity
(N
)));
8013 -- N is an expression, indicating a range with one value
8018 end Get_Index_Bounds
;
8020 ---------------------------------
8021 -- Get_Iterable_Type_Primitive --
8022 ---------------------------------
8024 function Get_Iterable_Type_Primitive
8026 Nam
: Name_Id
) return Entity_Id
8028 Funcs
: constant Node_Id
:= Find_Value_Of_Aspect
(Typ
, Aspect_Iterable
);
8036 Assoc
:= First
(Component_Associations
(Funcs
));
8037 while Present
(Assoc
) loop
8038 if Chars
(First
(Choices
(Assoc
))) = Nam
then
8039 return Entity
(Expression
(Assoc
));
8042 Assoc
:= Next
(Assoc
);
8047 end Get_Iterable_Type_Primitive
;
8049 ----------------------------------
8050 -- Get_Library_Unit_Name_string --
8051 ----------------------------------
8053 procedure Get_Library_Unit_Name_String
(Decl_Node
: Node_Id
) is
8054 Unit_Name_Id
: constant Unit_Name_Type
:= Get_Unit_Name
(Decl_Node
);
8057 Get_Unit_Name_String
(Unit_Name_Id
);
8059 -- Remove seven last character (" (spec)" or " (body)")
8061 Name_Len
:= Name_Len
- 7;
8062 pragma Assert
(Name_Buffer
(Name_Len
+ 1) = ' ');
8063 end Get_Library_Unit_Name_String
;
8065 ------------------------
8066 -- Get_Name_Entity_Id --
8067 ------------------------
8069 function Get_Name_Entity_Id
(Id
: Name_Id
) return Entity_Id
is
8071 return Entity_Id
(Get_Name_Table_Int
(Id
));
8072 end Get_Name_Entity_Id
;
8074 ------------------------------
8075 -- Get_Name_From_CTC_Pragma --
8076 ------------------------------
8078 function Get_Name_From_CTC_Pragma
(N
: Node_Id
) return String_Id
is
8079 Arg
: constant Node_Id
:=
8080 Get_Pragma_Arg
(First
(Pragma_Argument_Associations
(N
)));
8082 return Strval
(Expr_Value_S
(Arg
));
8083 end Get_Name_From_CTC_Pragma
;
8085 -----------------------
8086 -- Get_Parent_Entity --
8087 -----------------------
8089 function Get_Parent_Entity
(Unit
: Node_Id
) return Entity_Id
is
8091 if Nkind
(Unit
) = N_Package_Body
8092 and then Nkind
(Original_Node
(Unit
)) = N_Package_Instantiation
8094 return Defining_Entity
8095 (Specification
(Instance_Spec
(Original_Node
(Unit
))));
8096 elsif Nkind
(Unit
) = N_Package_Instantiation
then
8097 return Defining_Entity
(Specification
(Instance_Spec
(Unit
)));
8099 return Defining_Entity
(Unit
);
8101 end Get_Parent_Entity
;
8107 function Get_Pragma_Id
(N
: Node_Id
) return Pragma_Id
is
8109 return Get_Pragma_Id
(Pragma_Name
(N
));
8112 -----------------------
8113 -- Get_Reason_String --
8114 -----------------------
8116 procedure Get_Reason_String
(N
: Node_Id
) is
8118 if Nkind
(N
) = N_String_Literal
then
8119 Store_String_Chars
(Strval
(N
));
8121 elsif Nkind
(N
) = N_Op_Concat
then
8122 Get_Reason_String
(Left_Opnd
(N
));
8123 Get_Reason_String
(Right_Opnd
(N
));
8125 -- If not of required form, error
8129 ("Reason for pragma Warnings has wrong form", N
);
8131 ("\must be string literal or concatenation of string literals", N
);
8134 end Get_Reason_String
;
8136 --------------------------------
8137 -- Get_Reference_Discriminant --
8138 --------------------------------
8140 function Get_Reference_Discriminant
(Typ
: Entity_Id
) return Entity_Id
is
8144 D
:= First_Discriminant
(Typ
);
8145 while Present
(D
) loop
8146 if Has_Implicit_Dereference
(D
) then
8149 Next_Discriminant
(D
);
8153 end Get_Reference_Discriminant
;
8155 ---------------------------
8156 -- Get_Referenced_Object --
8157 ---------------------------
8159 function Get_Referenced_Object
(N
: Node_Id
) return Node_Id
is
8164 while Is_Entity_Name
(R
)
8165 and then Present
(Renamed_Object
(Entity
(R
)))
8167 R
:= Renamed_Object
(Entity
(R
));
8171 end Get_Referenced_Object
;
8173 ------------------------
8174 -- Get_Renamed_Entity --
8175 ------------------------
8177 function Get_Renamed_Entity
(E
: Entity_Id
) return Entity_Id
is
8182 while Present
(Renamed_Entity
(R
)) loop
8183 R
:= Renamed_Entity
(R
);
8187 end Get_Renamed_Entity
;
8189 -----------------------
8190 -- Get_Return_Object --
8191 -----------------------
8193 function Get_Return_Object
(N
: Node_Id
) return Entity_Id
is
8197 Decl
:= First
(Return_Object_Declarations
(N
));
8198 while Present
(Decl
) loop
8199 exit when Nkind
(Decl
) = N_Object_Declaration
8200 and then Is_Return_Object
(Defining_Identifier
(Decl
));
8204 pragma Assert
(Present
(Decl
));
8205 return Defining_Identifier
(Decl
);
8206 end Get_Return_Object
;
8208 ---------------------------
8209 -- Get_Subprogram_Entity --
8210 ---------------------------
8212 function Get_Subprogram_Entity
(Nod
: Node_Id
) return Entity_Id
is
8214 Subp_Id
: Entity_Id
;
8217 if Nkind
(Nod
) = N_Accept_Statement
then
8218 Subp
:= Entry_Direct_Name
(Nod
);
8220 elsif Nkind
(Nod
) = N_Slice
then
8221 Subp
:= Prefix
(Nod
);
8227 -- Strip the subprogram call
8230 if Nkind_In
(Subp
, N_Explicit_Dereference
,
8231 N_Indexed_Component
,
8232 N_Selected_Component
)
8234 Subp
:= Prefix
(Subp
);
8236 elsif Nkind_In
(Subp
, N_Type_Conversion
,
8237 N_Unchecked_Type_Conversion
)
8239 Subp
:= Expression
(Subp
);
8246 -- Extract the entity of the subprogram call
8248 if Is_Entity_Name
(Subp
) then
8249 Subp_Id
:= Entity
(Subp
);
8251 if Ekind
(Subp_Id
) = E_Access_Subprogram_Type
then
8252 Subp_Id
:= Directly_Designated_Type
(Subp_Id
);
8255 if Is_Subprogram
(Subp_Id
) then
8261 -- The search did not find a construct that denotes a subprogram
8266 end Get_Subprogram_Entity
;
8268 -----------------------------
8269 -- Get_Task_Body_Procedure --
8270 -----------------------------
8272 function Get_Task_Body_Procedure
(E
: Entity_Id
) return Node_Id
is
8274 -- Note: A task type may be the completion of a private type with
8275 -- discriminants. When performing elaboration checks on a task
8276 -- declaration, the current view of the type may be the private one,
8277 -- and the procedure that holds the body of the task is held in its
8280 -- This is an odd function, why not have Task_Body_Procedure do
8281 -- the following digging???
8283 return Task_Body_Procedure
(Underlying_Type
(Root_Type
(E
)));
8284 end Get_Task_Body_Procedure
;
8286 -------------------------
8287 -- Get_User_Defined_Eq --
8288 -------------------------
8290 function Get_User_Defined_Eq
(E
: Entity_Id
) return Entity_Id
is
8295 Prim
:= First_Elmt
(Collect_Primitive_Operations
(E
));
8296 while Present
(Prim
) loop
8299 if Chars
(Op
) = Name_Op_Eq
8300 and then Etype
(Op
) = Standard_Boolean
8301 and then Etype
(First_Formal
(Op
)) = E
8302 and then Etype
(Next_Formal
(First_Formal
(Op
))) = E
8311 end Get_User_Defined_Eq
;
8313 -----------------------
8314 -- Has_Access_Values --
8315 -----------------------
8317 function Has_Access_Values
(T
: Entity_Id
) return Boolean is
8318 Typ
: constant Entity_Id
:= Underlying_Type
(T
);
8321 -- Case of a private type which is not completed yet. This can only
8322 -- happen in the case of a generic format type appearing directly, or
8323 -- as a component of the type to which this function is being applied
8324 -- at the top level. Return False in this case, since we certainly do
8325 -- not know that the type contains access types.
8330 elsif Is_Access_Type
(Typ
) then
8333 elsif Is_Array_Type
(Typ
) then
8334 return Has_Access_Values
(Component_Type
(Typ
));
8336 elsif Is_Record_Type
(Typ
) then
8341 -- Loop to Check components
8343 Comp
:= First_Component_Or_Discriminant
(Typ
);
8344 while Present
(Comp
) loop
8346 -- Check for access component, tag field does not count, even
8347 -- though it is implemented internally using an access type.
8349 if Has_Access_Values
(Etype
(Comp
))
8350 and then Chars
(Comp
) /= Name_uTag
8355 Next_Component_Or_Discriminant
(Comp
);
8364 end Has_Access_Values
;
8366 ------------------------------
8367 -- Has_Compatible_Alignment --
8368 ------------------------------
8370 function Has_Compatible_Alignment
8373 Layout_Done
: Boolean) return Alignment_Result
8375 function Has_Compatible_Alignment_Internal
8378 Layout_Done
: Boolean;
8379 Default
: Alignment_Result
) return Alignment_Result
;
8380 -- This is the internal recursive function that actually does the work.
8381 -- There is one additional parameter, which says what the result should
8382 -- be if no alignment information is found, and there is no definite
8383 -- indication of compatible alignments. At the outer level, this is set
8384 -- to Unknown, but for internal recursive calls in the case where types
8385 -- are known to be correct, it is set to Known_Compatible.
8387 ---------------------------------------
8388 -- Has_Compatible_Alignment_Internal --
8389 ---------------------------------------
8391 function Has_Compatible_Alignment_Internal
8394 Layout_Done
: Boolean;
8395 Default
: Alignment_Result
) return Alignment_Result
8397 Result
: Alignment_Result
:= Known_Compatible
;
8398 -- Holds the current status of the result. Note that once a value of
8399 -- Known_Incompatible is set, it is sticky and does not get changed
8400 -- to Unknown (the value in Result only gets worse as we go along,
8403 Offs
: Uint
:= No_Uint
;
8404 -- Set to a factor of the offset from the base object when Expr is a
8405 -- selected or indexed component, based on Component_Bit_Offset and
8406 -- Component_Size respectively. A negative value is used to represent
8407 -- a value which is not known at compile time.
8409 procedure Check_Prefix
;
8410 -- Checks the prefix recursively in the case where the expression
8411 -- is an indexed or selected component.
8413 procedure Set_Result
(R
: Alignment_Result
);
8414 -- If R represents a worse outcome (unknown instead of known
8415 -- compatible, or known incompatible), then set Result to R.
8421 procedure Check_Prefix
is
8423 -- The subtlety here is that in doing a recursive call to check
8424 -- the prefix, we have to decide what to do in the case where we
8425 -- don't find any specific indication of an alignment problem.
8427 -- At the outer level, we normally set Unknown as the result in
8428 -- this case, since we can only set Known_Compatible if we really
8429 -- know that the alignment value is OK, but for the recursive
8430 -- call, in the case where the types match, and we have not
8431 -- specified a peculiar alignment for the object, we are only
8432 -- concerned about suspicious rep clauses, the default case does
8433 -- not affect us, since the compiler will, in the absence of such
8434 -- rep clauses, ensure that the alignment is correct.
8436 if Default
= Known_Compatible
8438 (Etype
(Obj
) = Etype
(Expr
)
8439 and then (Unknown_Alignment
(Obj
)
8441 Alignment
(Obj
) = Alignment
(Etype
(Obj
))))
8444 (Has_Compatible_Alignment_Internal
8445 (Obj
, Prefix
(Expr
), Layout_Done
, Known_Compatible
));
8447 -- In all other cases, we need a full check on the prefix
8451 (Has_Compatible_Alignment_Internal
8452 (Obj
, Prefix
(Expr
), Layout_Done
, Unknown
));
8460 procedure Set_Result
(R
: Alignment_Result
) is
8467 -- Start of processing for Has_Compatible_Alignment_Internal
8470 -- If Expr is a selected component, we must make sure there is no
8471 -- potentially troublesome component clause and that the record is
8472 -- not packed if the layout is not done.
8474 if Nkind
(Expr
) = N_Selected_Component
then
8476 -- Packing generates unknown alignment if layout is not done
8478 if Is_Packed
(Etype
(Prefix
(Expr
))) and then not Layout_Done
then
8479 Set_Result
(Unknown
);
8482 -- Check prefix and component offset
8485 Offs
:= Component_Bit_Offset
(Entity
(Selector_Name
(Expr
)));
8487 -- If Expr is an indexed component, we must make sure there is no
8488 -- potentially troublesome Component_Size clause and that the array
8489 -- is not bit-packed if the layout is not done.
8491 elsif Nkind
(Expr
) = N_Indexed_Component
then
8493 Typ
: constant Entity_Id
:= Etype
(Prefix
(Expr
));
8494 Ind
: constant Node_Id
:= First_Index
(Typ
);
8497 -- Packing generates unknown alignment if layout is not done
8499 if Is_Bit_Packed_Array
(Typ
) and then not Layout_Done
then
8500 Set_Result
(Unknown
);
8503 -- Check prefix and component offset
8506 Offs
:= Component_Size
(Typ
);
8508 -- Small optimization: compute the full offset when possible
8511 and then Offs
> Uint_0
8512 and then Present
(Ind
)
8513 and then Nkind
(Ind
) = N_Range
8514 and then Compile_Time_Known_Value
(Low_Bound
(Ind
))
8515 and then Compile_Time_Known_Value
(First
(Expressions
(Expr
)))
8517 Offs
:= Offs
* (Expr_Value
(First
(Expressions
(Expr
)))
8518 - Expr_Value
(Low_Bound
((Ind
))));
8523 -- If we have a null offset, the result is entirely determined by
8524 -- the base object and has already been computed recursively.
8526 if Offs
= Uint_0
then
8529 -- Case where we know the alignment of the object
8531 elsif Known_Alignment
(Obj
) then
8533 ObjA
: constant Uint
:= Alignment
(Obj
);
8534 ExpA
: Uint
:= No_Uint
;
8535 SizA
: Uint
:= No_Uint
;
8538 -- If alignment of Obj is 1, then we are always OK
8541 Set_Result
(Known_Compatible
);
8543 -- Alignment of Obj is greater than 1, so we need to check
8546 -- If we have an offset, see if it is compatible
8548 if Offs
/= No_Uint
and Offs
> Uint_0
then
8549 if Offs
mod (System_Storage_Unit
* ObjA
) /= 0 then
8550 Set_Result
(Known_Incompatible
);
8553 -- See if Expr is an object with known alignment
8555 elsif Is_Entity_Name
(Expr
)
8556 and then Known_Alignment
(Entity
(Expr
))
8558 ExpA
:= Alignment
(Entity
(Expr
));
8560 -- Otherwise, we can use the alignment of the type of
8561 -- Expr given that we already checked for
8562 -- discombobulating rep clauses for the cases of indexed
8563 -- and selected components above.
8565 elsif Known_Alignment
(Etype
(Expr
)) then
8566 ExpA
:= Alignment
(Etype
(Expr
));
8568 -- Otherwise the alignment is unknown
8571 Set_Result
(Default
);
8574 -- If we got an alignment, see if it is acceptable
8576 if ExpA
/= No_Uint
and then ExpA
< ObjA
then
8577 Set_Result
(Known_Incompatible
);
8580 -- If Expr is not a piece of a larger object, see if size
8581 -- is given. If so, check that it is not too small for the
8582 -- required alignment.
8584 if Offs
/= No_Uint
then
8587 -- See if Expr is an object with known size
8589 elsif Is_Entity_Name
(Expr
)
8590 and then Known_Static_Esize
(Entity
(Expr
))
8592 SizA
:= Esize
(Entity
(Expr
));
8594 -- Otherwise, we check the object size of the Expr type
8596 elsif Known_Static_Esize
(Etype
(Expr
)) then
8597 SizA
:= Esize
(Etype
(Expr
));
8600 -- If we got a size, see if it is a multiple of the Obj
8601 -- alignment, if not, then the alignment cannot be
8602 -- acceptable, since the size is always a multiple of the
8605 if SizA
/= No_Uint
then
8606 if SizA
mod (ObjA
* Ttypes
.System_Storage_Unit
) /= 0 then
8607 Set_Result
(Known_Incompatible
);
8613 -- If we do not know required alignment, any non-zero offset is a
8614 -- potential problem (but certainly may be OK, so result is unknown).
8616 elsif Offs
/= No_Uint
then
8617 Set_Result
(Unknown
);
8619 -- If we can't find the result by direct comparison of alignment
8620 -- values, then there is still one case that we can determine known
8621 -- result, and that is when we can determine that the types are the
8622 -- same, and no alignments are specified. Then we known that the
8623 -- alignments are compatible, even if we don't know the alignment
8624 -- value in the front end.
8626 elsif Etype
(Obj
) = Etype
(Expr
) then
8628 -- Types are the same, but we have to check for possible size
8629 -- and alignments on the Expr object that may make the alignment
8630 -- different, even though the types are the same.
8632 if Is_Entity_Name
(Expr
) then
8634 -- First check alignment of the Expr object. Any alignment less
8635 -- than Maximum_Alignment is worrisome since this is the case
8636 -- where we do not know the alignment of Obj.
8638 if Known_Alignment
(Entity
(Expr
))
8639 and then UI_To_Int
(Alignment
(Entity
(Expr
))) <
8640 Ttypes
.Maximum_Alignment
8642 Set_Result
(Unknown
);
8644 -- Now check size of Expr object. Any size that is not an
8645 -- even multiple of Maximum_Alignment is also worrisome
8646 -- since it may cause the alignment of the object to be less
8647 -- than the alignment of the type.
8649 elsif Known_Static_Esize
(Entity
(Expr
))
8651 (UI_To_Int
(Esize
(Entity
(Expr
))) mod
8652 (Ttypes
.Maximum_Alignment
* Ttypes
.System_Storage_Unit
))
8655 Set_Result
(Unknown
);
8657 -- Otherwise same type is decisive
8660 Set_Result
(Known_Compatible
);
8664 -- Another case to deal with is when there is an explicit size or
8665 -- alignment clause when the types are not the same. If so, then the
8666 -- result is Unknown. We don't need to do this test if the Default is
8667 -- Unknown, since that result will be set in any case.
8669 elsif Default
/= Unknown
8670 and then (Has_Size_Clause
(Etype
(Expr
))
8672 Has_Alignment_Clause
(Etype
(Expr
)))
8674 Set_Result
(Unknown
);
8676 -- If no indication found, set default
8679 Set_Result
(Default
);
8682 -- Return worst result found
8685 end Has_Compatible_Alignment_Internal
;
8687 -- Start of processing for Has_Compatible_Alignment
8690 -- If Obj has no specified alignment, then set alignment from the type
8691 -- alignment. Perhaps we should always do this, but for sure we should
8692 -- do it when there is an address clause since we can do more if the
8693 -- alignment is known.
8695 if Unknown_Alignment
(Obj
) then
8696 Set_Alignment
(Obj
, Alignment
(Etype
(Obj
)));
8699 -- Now do the internal call that does all the work
8702 Has_Compatible_Alignment_Internal
(Obj
, Expr
, Layout_Done
, Unknown
);
8703 end Has_Compatible_Alignment
;
8705 ----------------------
8706 -- Has_Declarations --
8707 ----------------------
8709 function Has_Declarations
(N
: Node_Id
) return Boolean is
8711 return Nkind_In
(Nkind
(N
), N_Accept_Statement
,
8713 N_Compilation_Unit_Aux
,
8719 N_Package_Specification
);
8720 end Has_Declarations
;
8722 ---------------------------------
8723 -- Has_Defaulted_Discriminants --
8724 ---------------------------------
8726 function Has_Defaulted_Discriminants
(Typ
: Entity_Id
) return Boolean is
8728 return Has_Discriminants
(Typ
)
8729 and then Present
(First_Discriminant
(Typ
))
8730 and then Present
(Discriminant_Default_Value
8731 (First_Discriminant
(Typ
)));
8732 end Has_Defaulted_Discriminants
;
8738 function Has_Denormals
(E
: Entity_Id
) return Boolean is
8740 return Is_Floating_Point_Type
(E
) and then Denorm_On_Target
;
8743 -------------------------------------------
8744 -- Has_Discriminant_Dependent_Constraint --
8745 -------------------------------------------
8747 function Has_Discriminant_Dependent_Constraint
8748 (Comp
: Entity_Id
) return Boolean
8750 Comp_Decl
: constant Node_Id
:= Parent
(Comp
);
8751 Subt_Indic
: Node_Id
;
8756 -- Discriminants can't depend on discriminants
8758 if Ekind
(Comp
) = E_Discriminant
then
8762 Subt_Indic
:= Subtype_Indication
(Component_Definition
(Comp_Decl
));
8764 if Nkind
(Subt_Indic
) = N_Subtype_Indication
then
8765 Constr
:= Constraint
(Subt_Indic
);
8767 if Nkind
(Constr
) = N_Index_Or_Discriminant_Constraint
then
8768 Assn
:= First
(Constraints
(Constr
));
8769 while Present
(Assn
) loop
8770 case Nkind
(Assn
) is
8771 when N_Subtype_Indication |
8775 if Depends_On_Discriminant
(Assn
) then
8779 when N_Discriminant_Association
=>
8780 if Depends_On_Discriminant
(Expression
(Assn
)) then
8795 end Has_Discriminant_Dependent_Constraint
;
8797 --------------------------------------
8798 -- Has_Effectively_Volatile_Profile --
8799 --------------------------------------
8801 function Has_Effectively_Volatile_Profile
8802 (Subp_Id
: Entity_Id
) return Boolean
8807 -- Inspect the formal parameters looking for an effectively volatile
8810 Formal
:= First_Formal
(Subp_Id
);
8811 while Present
(Formal
) loop
8812 if Is_Effectively_Volatile
(Etype
(Formal
)) then
8816 Next_Formal
(Formal
);
8819 -- Inspect the return type of functions
8821 if Ekind_In
(Subp_Id
, E_Function
, E_Generic_Function
)
8822 and then Is_Effectively_Volatile
(Etype
(Subp_Id
))
8828 end Has_Effectively_Volatile_Profile
;
8830 --------------------------
8831 -- Has_Enabled_Property --
8832 --------------------------
8834 function Has_Enabled_Property
8835 (Item_Id
: Entity_Id
;
8836 Property
: Name_Id
) return Boolean
8838 function State_Has_Enabled_Property
return Boolean;
8839 -- Determine whether a state denoted by Item_Id has the property enabled
8841 function Variable_Has_Enabled_Property
return Boolean;
8842 -- Determine whether a variable denoted by Item_Id has the property
8845 --------------------------------
8846 -- State_Has_Enabled_Property --
8847 --------------------------------
8849 function State_Has_Enabled_Property
return Boolean is
8850 Decl
: constant Node_Id
:= Parent
(Item_Id
);
8858 -- The declaration of an external abstract state appears as an
8859 -- extension aggregate. If this is not the case, properties can never
8862 if Nkind
(Decl
) /= N_Extension_Aggregate
then
8866 -- When External appears as a simple option, it automatically enables
8869 Opt
:= First
(Expressions
(Decl
));
8870 while Present
(Opt
) loop
8871 if Nkind
(Opt
) = N_Identifier
8872 and then Chars
(Opt
) = Name_External
8880 -- When External specifies particular properties, inspect those and
8881 -- find the desired one (if any).
8883 Opt
:= First
(Component_Associations
(Decl
));
8884 while Present
(Opt
) loop
8885 Opt_Nam
:= First
(Choices
(Opt
));
8887 if Nkind
(Opt_Nam
) = N_Identifier
8888 and then Chars
(Opt_Nam
) = Name_External
8890 Props
:= Expression
(Opt
);
8892 -- Multiple properties appear as an aggregate
8894 if Nkind
(Props
) = N_Aggregate
then
8896 -- Simple property form
8898 Prop
:= First
(Expressions
(Props
));
8899 while Present
(Prop
) loop
8900 if Chars
(Prop
) = Property
then
8907 -- Property with expression form
8909 Prop
:= First
(Component_Associations
(Props
));
8910 while Present
(Prop
) loop
8911 Prop_Nam
:= First
(Choices
(Prop
));
8913 -- The property can be represented in two ways:
8914 -- others => <value>
8915 -- <property> => <value>
8917 if Nkind
(Prop_Nam
) = N_Others_Choice
8918 or else (Nkind
(Prop_Nam
) = N_Identifier
8919 and then Chars
(Prop_Nam
) = Property
)
8921 return Is_True
(Expr_Value
(Expression
(Prop
)));
8930 return Chars
(Props
) = Property
;
8938 end State_Has_Enabled_Property
;
8940 -----------------------------------
8941 -- Variable_Has_Enabled_Property --
8942 -----------------------------------
8944 function Variable_Has_Enabled_Property
return Boolean is
8945 function Is_Enabled
(Prag
: Node_Id
) return Boolean;
8946 -- Determine whether property pragma Prag (if present) denotes an
8947 -- enabled property.
8953 function Is_Enabled
(Prag
: Node_Id
) return Boolean is
8957 if Present
(Prag
) then
8958 Arg1
:= First
(Pragma_Argument_Associations
(Prag
));
8960 -- The pragma has an optional Boolean expression, the related
8961 -- property is enabled only when the expression evaluates to
8964 if Present
(Arg1
) then
8965 return Is_True
(Expr_Value
(Get_Pragma_Arg
(Arg1
)));
8967 -- Otherwise the lack of expression enables the property by
8974 -- The property was never set in the first place
8983 AR
: constant Node_Id
:=
8984 Get_Pragma
(Item_Id
, Pragma_Async_Readers
);
8985 AW
: constant Node_Id
:=
8986 Get_Pragma
(Item_Id
, Pragma_Async_Writers
);
8987 ER
: constant Node_Id
:=
8988 Get_Pragma
(Item_Id
, Pragma_Effective_Reads
);
8989 EW
: constant Node_Id
:=
8990 Get_Pragma
(Item_Id
, Pragma_Effective_Writes
);
8992 -- Start of processing for Variable_Has_Enabled_Property
8995 -- A non-effectively volatile object can never possess external
8998 if not Is_Effectively_Volatile
(Item_Id
) then
9001 -- External properties related to variables come in two flavors -
9002 -- explicit and implicit. The explicit case is characterized by the
9003 -- presence of a property pragma with an optional Boolean flag. The
9004 -- property is enabled when the flag evaluates to True or the flag is
9005 -- missing altogether.
9007 elsif Property
= Name_Async_Readers
and then Is_Enabled
(AR
) then
9010 elsif Property
= Name_Async_Writers
and then Is_Enabled
(AW
) then
9013 elsif Property
= Name_Effective_Reads
and then Is_Enabled
(ER
) then
9016 elsif Property
= Name_Effective_Writes
and then Is_Enabled
(EW
) then
9019 -- The implicit case lacks all property pragmas
9021 elsif No
(AR
) and then No
(AW
) and then No
(ER
) and then No
(EW
) then
9027 end Variable_Has_Enabled_Property
;
9029 -- Start of processing for Has_Enabled_Property
9032 -- Abstract states and variables have a flexible scheme of specifying
9033 -- external properties.
9035 if Ekind
(Item_Id
) = E_Abstract_State
then
9036 return State_Has_Enabled_Property
;
9038 elsif Ekind
(Item_Id
) = E_Variable
then
9039 return Variable_Has_Enabled_Property
;
9041 -- Otherwise a property is enabled when the related item is effectively
9045 return Is_Effectively_Volatile
(Item_Id
);
9047 end Has_Enabled_Property
;
9049 -------------------------------------
9050 -- Has_Full_Default_Initialization --
9051 -------------------------------------
9053 function Has_Full_Default_Initialization
(Typ
: Entity_Id
) return Boolean is
9059 -- A private type and its full view is fully default initialized when it
9060 -- is subject to pragma Default_Initial_Condition without an argument or
9061 -- with a non-null argument. Since any type may act as the full view of
9062 -- a private type, this check must be performed prior to the specialized
9065 if Has_Default_Init_Cond
(Typ
)
9066 or else Has_Inherited_Default_Init_Cond
(Typ
)
9068 Prag
:= Get_Pragma
(Typ
, Pragma_Default_Initial_Condition
);
9070 -- Pragma Default_Initial_Condition must be present if one of the
9071 -- related entity flags is set.
9073 pragma Assert
(Present
(Prag
));
9074 Arg
:= First
(Pragma_Argument_Associations
(Prag
));
9076 -- A non-null argument guarantees full default initialization
9078 if Present
(Arg
) then
9079 return Nkind
(Arg
) /= N_Null
;
9081 -- Otherwise the missing argument defaults the pragma to "True" which
9082 -- is considered a non-null argument (see above).
9089 -- A scalar type is fully default initialized if it is subject to aspect
9092 if Is_Scalar_Type
(Typ
) then
9093 return Has_Default_Aspect
(Typ
);
9095 -- An array type is fully default initialized if its element type is
9096 -- scalar and the array type carries aspect Default_Component_Value or
9097 -- the element type is fully default initialized.
9099 elsif Is_Array_Type
(Typ
) then
9101 Has_Default_Aspect
(Typ
)
9102 or else Has_Full_Default_Initialization
(Component_Type
(Typ
));
9104 -- A protected type, record type or type extension is fully default
9105 -- initialized if all its components either carry an initialization
9106 -- expression or have a type that is fully default initialized. The
9107 -- parent type of a type extension must be fully default initialized.
9109 elsif Is_Record_Type
(Typ
) or else Is_Protected_Type
(Typ
) then
9111 -- Inspect all entities defined in the scope of the type, looking for
9112 -- uninitialized components.
9114 Comp
:= First_Entity
(Typ
);
9115 while Present
(Comp
) loop
9116 if Ekind
(Comp
) = E_Component
9117 and then Comes_From_Source
(Comp
)
9118 and then No
(Expression
(Parent
(Comp
)))
9119 and then not Has_Full_Default_Initialization
(Etype
(Comp
))
9127 -- Ensure that the parent type of a type extension is fully default
9130 if Etype
(Typ
) /= Typ
9131 and then not Has_Full_Default_Initialization
(Etype
(Typ
))
9136 -- If we get here, then all components and parent portion are fully
9137 -- default initialized.
9141 -- A task type is fully default initialized by default
9143 elsif Is_Task_Type
(Typ
) then
9146 -- Otherwise the type is not fully default initialized
9151 end Has_Full_Default_Initialization
;
9153 --------------------
9154 -- Has_Infinities --
9155 --------------------
9157 function Has_Infinities
(E
: Entity_Id
) return Boolean is
9160 Is_Floating_Point_Type
(E
)
9161 and then Nkind
(Scalar_Range
(E
)) = N_Range
9162 and then Includes_Infinities
(Scalar_Range
(E
));
9165 --------------------
9166 -- Has_Interfaces --
9167 --------------------
9169 function Has_Interfaces
9171 Use_Full_View
: Boolean := True) return Boolean
9173 Typ
: Entity_Id
:= Base_Type
(T
);
9176 -- Handle concurrent types
9178 if Is_Concurrent_Type
(Typ
) then
9179 Typ
:= Corresponding_Record_Type
(Typ
);
9182 if not Present
(Typ
)
9183 or else not Is_Record_Type
(Typ
)
9184 or else not Is_Tagged_Type
(Typ
)
9189 -- Handle private types
9191 if Use_Full_View
and then Present
(Full_View
(Typ
)) then
9192 Typ
:= Full_View
(Typ
);
9195 -- Handle concurrent record types
9197 if Is_Concurrent_Record_Type
(Typ
)
9198 and then Is_Non_Empty_List
(Abstract_Interface_List
(Typ
))
9204 if Is_Interface
(Typ
)
9206 (Is_Record_Type
(Typ
)
9207 and then Present
(Interfaces
(Typ
))
9208 and then not Is_Empty_Elmt_List
(Interfaces
(Typ
)))
9213 exit when Etype
(Typ
) = Typ
9215 -- Handle private types
9217 or else (Present
(Full_View
(Etype
(Typ
)))
9218 and then Full_View
(Etype
(Typ
)) = Typ
)
9220 -- Protect frontend against wrong sources with cyclic derivations
9222 or else Etype
(Typ
) = T
;
9224 -- Climb to the ancestor type handling private types
9226 if Present
(Full_View
(Etype
(Typ
))) then
9227 Typ
:= Full_View
(Etype
(Typ
));
9236 ---------------------------------
9237 -- Has_No_Obvious_Side_Effects --
9238 ---------------------------------
9240 function Has_No_Obvious_Side_Effects
(N
: Node_Id
) return Boolean is
9242 -- For now, just handle literals, constants, and non-volatile
9243 -- variables and expressions combining these with operators or
9244 -- short circuit forms.
9246 if Nkind
(N
) in N_Numeric_Or_String_Literal
then
9249 elsif Nkind
(N
) = N_Character_Literal
then
9252 elsif Nkind
(N
) in N_Unary_Op
then
9253 return Has_No_Obvious_Side_Effects
(Right_Opnd
(N
));
9255 elsif Nkind
(N
) in N_Binary_Op
or else Nkind
(N
) in N_Short_Circuit
then
9256 return Has_No_Obvious_Side_Effects
(Left_Opnd
(N
))
9258 Has_No_Obvious_Side_Effects
(Right_Opnd
(N
));
9260 elsif Nkind
(N
) = N_Expression_With_Actions
9261 and then Is_Empty_List
(Actions
(N
))
9263 return Has_No_Obvious_Side_Effects
(Expression
(N
));
9265 elsif Nkind
(N
) in N_Has_Entity
then
9266 return Present
(Entity
(N
))
9267 and then Ekind_In
(Entity
(N
), E_Variable
,
9269 E_Enumeration_Literal
,
9273 and then not Is_Volatile
(Entity
(N
));
9278 end Has_No_Obvious_Side_Effects
;
9280 -----------------------------
9281 -- Has_Non_Null_Refinement --
9282 -----------------------------
9284 function Has_Non_Null_Refinement
(Id
: Entity_Id
) return Boolean is
9286 pragma Assert
(Ekind
(Id
) = E_Abstract_State
);
9288 -- For a refinement to be non-null, the first constituent must be
9289 -- anything other than null.
9291 if Present
(Refinement_Constituents
(Id
)) then
9293 Nkind
(Node
(First_Elmt
(Refinement_Constituents
(Id
)))) /= N_Null
;
9297 end Has_Non_Null_Refinement
;
9299 ------------------------
9300 -- Has_Null_Exclusion --
9301 ------------------------
9303 function Has_Null_Exclusion
(N
: Node_Id
) return Boolean is
9306 when N_Access_Definition |
9307 N_Access_Function_Definition |
9308 N_Access_Procedure_Definition |
9309 N_Access_To_Object_Definition |
9311 N_Derived_Type_Definition |
9312 N_Function_Specification |
9313 N_Subtype_Declaration
=>
9314 return Null_Exclusion_Present
(N
);
9316 when N_Component_Definition |
9317 N_Formal_Object_Declaration |
9318 N_Object_Renaming_Declaration
=>
9319 if Present
(Subtype_Mark
(N
)) then
9320 return Null_Exclusion_Present
(N
);
9321 else pragma Assert
(Present
(Access_Definition
(N
)));
9322 return Null_Exclusion_Present
(Access_Definition
(N
));
9325 when N_Discriminant_Specification
=>
9326 if Nkind
(Discriminant_Type
(N
)) = N_Access_Definition
then
9327 return Null_Exclusion_Present
(Discriminant_Type
(N
));
9329 return Null_Exclusion_Present
(N
);
9332 when N_Object_Declaration
=>
9333 if Nkind
(Object_Definition
(N
)) = N_Access_Definition
then
9334 return Null_Exclusion_Present
(Object_Definition
(N
));
9336 return Null_Exclusion_Present
(N
);
9339 when N_Parameter_Specification
=>
9340 if Nkind
(Parameter_Type
(N
)) = N_Access_Definition
then
9341 return Null_Exclusion_Present
(Parameter_Type
(N
));
9343 return Null_Exclusion_Present
(N
);
9350 end Has_Null_Exclusion
;
9352 ------------------------
9353 -- Has_Null_Extension --
9354 ------------------------
9356 function Has_Null_Extension
(T
: Entity_Id
) return Boolean is
9357 B
: constant Entity_Id
:= Base_Type
(T
);
9362 if Nkind
(Parent
(B
)) = N_Full_Type_Declaration
9363 and then Present
(Record_Extension_Part
(Type_Definition
(Parent
(B
))))
9365 Ext
:= Record_Extension_Part
(Type_Definition
(Parent
(B
)));
9367 if Present
(Ext
) then
9368 if Null_Present
(Ext
) then
9371 Comps
:= Component_List
(Ext
);
9373 -- The null component list is rewritten during analysis to
9374 -- include the parent component. Any other component indicates
9375 -- that the extension was not originally null.
9377 return Null_Present
(Comps
)
9378 or else No
(Next
(First
(Component_Items
(Comps
))));
9387 end Has_Null_Extension
;
9389 -------------------------
9390 -- Has_Null_Refinement --
9391 -------------------------
9393 function Has_Null_Refinement
(Id
: Entity_Id
) return Boolean is
9395 pragma Assert
(Ekind
(Id
) = E_Abstract_State
);
9397 -- For a refinement to be null, the state's sole constituent must be a
9400 if Present
(Refinement_Constituents
(Id
)) then
9402 Nkind
(Node
(First_Elmt
(Refinement_Constituents
(Id
)))) = N_Null
;
9406 end Has_Null_Refinement
;
9408 -------------------------------
9409 -- Has_Overriding_Initialize --
9410 -------------------------------
9412 function Has_Overriding_Initialize
(T
: Entity_Id
) return Boolean is
9413 BT
: constant Entity_Id
:= Base_Type
(T
);
9417 if Is_Controlled
(BT
) then
9418 if Is_RTU
(Scope
(BT
), Ada_Finalization
) then
9421 elsif Present
(Primitive_Operations
(BT
)) then
9422 P
:= First_Elmt
(Primitive_Operations
(BT
));
9423 while Present
(P
) loop
9425 Init
: constant Entity_Id
:= Node
(P
);
9426 Formal
: constant Entity_Id
:= First_Formal
(Init
);
9428 if Ekind
(Init
) = E_Procedure
9429 and then Chars
(Init
) = Name_Initialize
9430 and then Comes_From_Source
(Init
)
9431 and then Present
(Formal
)
9432 and then Etype
(Formal
) = BT
9433 and then No
(Next_Formal
(Formal
))
9434 and then (Ada_Version
< Ada_2012
9435 or else not Null_Present
(Parent
(Init
)))
9445 -- Here if type itself does not have a non-null Initialize operation:
9446 -- check immediate ancestor.
9448 if Is_Derived_Type
(BT
)
9449 and then Has_Overriding_Initialize
(Etype
(BT
))
9456 end Has_Overriding_Initialize
;
9458 --------------------------------------
9459 -- Has_Preelaborable_Initialization --
9460 --------------------------------------
9462 function Has_Preelaborable_Initialization
(E
: Entity_Id
) return Boolean is
9465 procedure Check_Components
(E
: Entity_Id
);
9466 -- Check component/discriminant chain, sets Has_PE False if a component
9467 -- or discriminant does not meet the preelaborable initialization rules.
9469 ----------------------
9470 -- Check_Components --
9471 ----------------------
9473 procedure Check_Components
(E
: Entity_Id
) is
9477 function Is_Preelaborable_Expression
(N
: Node_Id
) return Boolean;
9478 -- Returns True if and only if the expression denoted by N does not
9479 -- violate restrictions on preelaborable constructs (RM-10.2.1(5-9)).
9481 ---------------------------------
9482 -- Is_Preelaborable_Expression --
9483 ---------------------------------
9485 function Is_Preelaborable_Expression
(N
: Node_Id
) return Boolean is
9489 Comp_Type
: Entity_Id
;
9490 Is_Array_Aggr
: Boolean;
9493 if Is_OK_Static_Expression
(N
) then
9496 elsif Nkind
(N
) = N_Null
then
9499 -- Attributes are allowed in general, even if their prefix is a
9500 -- formal type. (It seems that certain attributes known not to be
9501 -- static might not be allowed, but there are no rules to prevent
9504 elsif Nkind
(N
) = N_Attribute_Reference
then
9507 -- The name of a discriminant evaluated within its parent type is
9508 -- defined to be preelaborable (10.2.1(8)). Note that we test for
9509 -- names that denote discriminals as well as discriminants to
9510 -- catch references occurring within init procs.
9512 elsif Is_Entity_Name
(N
)
9514 (Ekind
(Entity
(N
)) = E_Discriminant
9515 or else (Ekind_In
(Entity
(N
), E_Constant
, E_In_Parameter
)
9516 and then Present
(Discriminal_Link
(Entity
(N
)))))
9520 elsif Nkind
(N
) = N_Qualified_Expression
then
9521 return Is_Preelaborable_Expression
(Expression
(N
));
9523 -- For aggregates we have to check that each of the associations
9524 -- is preelaborable.
9526 elsif Nkind_In
(N
, N_Aggregate
, N_Extension_Aggregate
) then
9527 Is_Array_Aggr
:= Is_Array_Type
(Etype
(N
));
9529 if Is_Array_Aggr
then
9530 Comp_Type
:= Component_Type
(Etype
(N
));
9533 -- Check the ancestor part of extension aggregates, which must
9534 -- be either the name of a type that has preelaborable init or
9535 -- an expression that is preelaborable.
9537 if Nkind
(N
) = N_Extension_Aggregate
then
9539 Anc_Part
: constant Node_Id
:= Ancestor_Part
(N
);
9542 if Is_Entity_Name
(Anc_Part
)
9543 and then Is_Type
(Entity
(Anc_Part
))
9545 if not Has_Preelaborable_Initialization
9551 elsif not Is_Preelaborable_Expression
(Anc_Part
) then
9557 -- Check positional associations
9559 Exp
:= First
(Expressions
(N
));
9560 while Present
(Exp
) loop
9561 if not Is_Preelaborable_Expression
(Exp
) then
9568 -- Check named associations
9570 Assn
:= First
(Component_Associations
(N
));
9571 while Present
(Assn
) loop
9572 Choice
:= First
(Choices
(Assn
));
9573 while Present
(Choice
) loop
9574 if Is_Array_Aggr
then
9575 if Nkind
(Choice
) = N_Others_Choice
then
9578 elsif Nkind
(Choice
) = N_Range
then
9579 if not Is_OK_Static_Range
(Choice
) then
9583 elsif not Is_OK_Static_Expression
(Choice
) then
9588 Comp_Type
:= Etype
(Choice
);
9594 -- If the association has a <> at this point, then we have
9595 -- to check whether the component's type has preelaborable
9596 -- initialization. Note that this only occurs when the
9597 -- association's corresponding component does not have a
9598 -- default expression, the latter case having already been
9599 -- expanded as an expression for the association.
9601 if Box_Present
(Assn
) then
9602 if not Has_Preelaborable_Initialization
(Comp_Type
) then
9606 -- In the expression case we check whether the expression
9607 -- is preelaborable.
9610 not Is_Preelaborable_Expression
(Expression
(Assn
))
9618 -- If we get here then aggregate as a whole is preelaborable
9622 -- All other cases are not preelaborable
9627 end Is_Preelaborable_Expression
;
9629 -- Start of processing for Check_Components
9632 -- Loop through entities of record or protected type
9635 while Present
(Ent
) loop
9637 -- We are interested only in components and discriminants
9644 -- Get default expression if any. If there is no declaration
9645 -- node, it means we have an internal entity. The parent and
9646 -- tag fields are examples of such entities. For such cases,
9647 -- we just test the type of the entity.
9649 if Present
(Declaration_Node
(Ent
)) then
9650 Exp
:= Expression
(Declaration_Node
(Ent
));
9653 when E_Discriminant
=>
9655 -- Note: for a renamed discriminant, the Declaration_Node
9656 -- may point to the one from the ancestor, and have a
9657 -- different expression, so use the proper attribute to
9658 -- retrieve the expression from the derived constraint.
9660 Exp
:= Discriminant_Default_Value
(Ent
);
9663 goto Check_Next_Entity
;
9666 -- A component has PI if it has no default expression and the
9667 -- component type has PI.
9670 if not Has_Preelaborable_Initialization
(Etype
(Ent
)) then
9675 -- Require the default expression to be preelaborable
9677 elsif not Is_Preelaborable_Expression
(Exp
) then
9682 <<Check_Next_Entity
>>
9685 end Check_Components
;
9687 -- Start of processing for Has_Preelaborable_Initialization
9690 -- Immediate return if already marked as known preelaborable init. This
9691 -- covers types for which this function has already been called once
9692 -- and returned True (in which case the result is cached), and also
9693 -- types to which a pragma Preelaborable_Initialization applies.
9695 if Known_To_Have_Preelab_Init
(E
) then
9699 -- If the type is a subtype representing a generic actual type, then
9700 -- test whether its base type has preelaborable initialization since
9701 -- the subtype representing the actual does not inherit this attribute
9702 -- from the actual or formal. (but maybe it should???)
9704 if Is_Generic_Actual_Type
(E
) then
9705 return Has_Preelaborable_Initialization
(Base_Type
(E
));
9708 -- All elementary types have preelaborable initialization
9710 if Is_Elementary_Type
(E
) then
9713 -- Array types have PI if the component type has PI
9715 elsif Is_Array_Type
(E
) then
9716 Has_PE
:= Has_Preelaborable_Initialization
(Component_Type
(E
));
9718 -- A derived type has preelaborable initialization if its parent type
9719 -- has preelaborable initialization and (in the case of a derived record
9720 -- extension) if the non-inherited components all have preelaborable
9721 -- initialization. However, a user-defined controlled type with an
9722 -- overriding Initialize procedure does not have preelaborable
9725 elsif Is_Derived_Type
(E
) then
9727 -- If the derived type is a private extension then it doesn't have
9728 -- preelaborable initialization.
9730 if Ekind
(Base_Type
(E
)) = E_Record_Type_With_Private
then
9734 -- First check whether ancestor type has preelaborable initialization
9736 Has_PE
:= Has_Preelaborable_Initialization
(Etype
(Base_Type
(E
)));
9738 -- If OK, check extension components (if any)
9740 if Has_PE
and then Is_Record_Type
(E
) then
9741 Check_Components
(First_Entity
(E
));
9744 -- Check specifically for 10.2.1(11.4/2) exception: a controlled type
9745 -- with a user defined Initialize procedure does not have PI. If
9746 -- the type is untagged, the control primitives come from a component
9747 -- that has already been checked.
9750 and then Is_Controlled
(E
)
9751 and then Is_Tagged_Type
(E
)
9752 and then Has_Overriding_Initialize
(E
)
9757 -- Private types not derived from a type having preelaborable init and
9758 -- that are not marked with pragma Preelaborable_Initialization do not
9759 -- have preelaborable initialization.
9761 elsif Is_Private_Type
(E
) then
9764 -- Record type has PI if it is non private and all components have PI
9766 elsif Is_Record_Type
(E
) then
9768 Check_Components
(First_Entity
(E
));
9770 -- Protected types must not have entries, and components must meet
9771 -- same set of rules as for record components.
9773 elsif Is_Protected_Type
(E
) then
9774 if Has_Entries
(E
) then
9778 Check_Components
(First_Entity
(E
));
9779 Check_Components
(First_Private_Entity
(E
));
9782 -- Type System.Address always has preelaborable initialization
9784 elsif Is_RTE
(E
, RE_Address
) then
9787 -- In all other cases, type does not have preelaborable initialization
9793 -- If type has preelaborable initialization, cache result
9796 Set_Known_To_Have_Preelab_Init
(E
);
9800 end Has_Preelaborable_Initialization
;
9802 ---------------------------
9803 -- Has_Private_Component --
9804 ---------------------------
9806 function Has_Private_Component
(Type_Id
: Entity_Id
) return Boolean is
9807 Btype
: Entity_Id
:= Base_Type
(Type_Id
);
9808 Component
: Entity_Id
;
9811 if Error_Posted
(Type_Id
)
9812 or else Error_Posted
(Btype
)
9817 if Is_Class_Wide_Type
(Btype
) then
9818 Btype
:= Root_Type
(Btype
);
9821 if Is_Private_Type
(Btype
) then
9823 UT
: constant Entity_Id
:= Underlying_Type
(Btype
);
9826 if No
(Full_View
(Btype
)) then
9827 return not Is_Generic_Type
(Btype
)
9829 not Is_Generic_Type
(Root_Type
(Btype
));
9831 return not Is_Generic_Type
(Root_Type
(Full_View
(Btype
)));
9834 return not Is_Frozen
(UT
) and then Has_Private_Component
(UT
);
9838 elsif Is_Array_Type
(Btype
) then
9839 return Has_Private_Component
(Component_Type
(Btype
));
9841 elsif Is_Record_Type
(Btype
) then
9842 Component
:= First_Component
(Btype
);
9843 while Present
(Component
) loop
9844 if Has_Private_Component
(Etype
(Component
)) then
9848 Next_Component
(Component
);
9853 elsif Is_Protected_Type
(Btype
)
9854 and then Present
(Corresponding_Record_Type
(Btype
))
9856 return Has_Private_Component
(Corresponding_Record_Type
(Btype
));
9861 end Has_Private_Component
;
9863 ----------------------
9864 -- Has_Signed_Zeros --
9865 ----------------------
9867 function Has_Signed_Zeros
(E
: Entity_Id
) return Boolean is
9869 return Is_Floating_Point_Type
(E
) and then Signed_Zeros_On_Target
;
9870 end Has_Signed_Zeros
;
9872 ------------------------------
9873 -- Has_Significant_Contract --
9874 ------------------------------
9876 function Has_Significant_Contract
(Subp_Id
: Entity_Id
) return Boolean is
9877 Subp_Nam
: constant Name_Id
:= Chars
(Subp_Id
);
9880 -- _Finalizer procedure
9882 if Subp_Nam
= Name_uFinalizer
then
9885 -- _Postconditions procedure
9887 elsif Subp_Nam
= Name_uPostconditions
then
9890 -- Predicate function
9892 elsif Ekind
(Subp_Id
) = E_Function
9893 and then Is_Predicate_Function
(Subp_Id
)
9899 elsif Get_TSS_Name
(Subp_Id
) /= TSS_Null
then
9905 end Has_Significant_Contract
;
9907 -----------------------------
9908 -- Has_Static_Array_Bounds --
9909 -----------------------------
9911 function Has_Static_Array_Bounds
(Typ
: Node_Id
) return Boolean is
9912 Ndims
: constant Nat
:= Number_Dimensions
(Typ
);
9919 -- Unconstrained types do not have static bounds
9921 if not Is_Constrained
(Typ
) then
9925 -- First treat string literals specially, as the lower bound and length
9926 -- of string literals are not stored like those of arrays.
9928 -- A string literal always has static bounds
9930 if Ekind
(Typ
) = E_String_Literal_Subtype
then
9934 -- Treat all dimensions in turn
9936 Index
:= First_Index
(Typ
);
9937 for Indx
in 1 .. Ndims
loop
9939 -- In case of an illegal index which is not a discrete type, return
9940 -- that the type is not static.
9942 if not Is_Discrete_Type
(Etype
(Index
))
9943 or else Etype
(Index
) = Any_Type
9948 Get_Index_Bounds
(Index
, Low
, High
);
9950 if Error_Posted
(Low
) or else Error_Posted
(High
) then
9954 if Is_OK_Static_Expression
(Low
)
9956 Is_OK_Static_Expression
(High
)
9966 -- If we fall through the loop, all indexes matched
9969 end Has_Static_Array_Bounds
;
9975 function Has_Stream
(T
: Entity_Id
) return Boolean is
9982 elsif Is_RTE
(Root_Type
(T
), RE_Root_Stream_Type
) then
9985 elsif Is_Array_Type
(T
) then
9986 return Has_Stream
(Component_Type
(T
));
9988 elsif Is_Record_Type
(T
) then
9989 E
:= First_Component
(T
);
9990 while Present
(E
) loop
9991 if Has_Stream
(Etype
(E
)) then
10000 elsif Is_Private_Type
(T
) then
10001 return Has_Stream
(Underlying_Type
(T
));
10012 function Has_Suffix
(E
: Entity_Id
; Suffix
: Character) return Boolean is
10014 Get_Name_String
(Chars
(E
));
10015 return Name_Buffer
(Name_Len
) = Suffix
;
10022 function Add_Suffix
(E
: Entity_Id
; Suffix
: Character) return Name_Id
is
10024 Get_Name_String
(Chars
(E
));
10025 Add_Char_To_Name_Buffer
(Suffix
);
10029 -------------------
10030 -- Remove_Suffix --
10031 -------------------
10033 function Remove_Suffix
(E
: Entity_Id
; Suffix
: Character) return Name_Id
is
10035 pragma Assert
(Has_Suffix
(E
, Suffix
));
10036 Get_Name_String
(Chars
(E
));
10037 Name_Len
:= Name_Len
- 1;
10041 --------------------------
10042 -- Has_Tagged_Component --
10043 --------------------------
10045 function Has_Tagged_Component
(Typ
: Entity_Id
) return Boolean is
10049 if Is_Private_Type
(Typ
) and then Present
(Underlying_Type
(Typ
)) then
10050 return Has_Tagged_Component
(Underlying_Type
(Typ
));
10052 elsif Is_Array_Type
(Typ
) then
10053 return Has_Tagged_Component
(Component_Type
(Typ
));
10055 elsif Is_Tagged_Type
(Typ
) then
10058 elsif Is_Record_Type
(Typ
) then
10059 Comp
:= First_Component
(Typ
);
10060 while Present
(Comp
) loop
10061 if Has_Tagged_Component
(Etype
(Comp
)) then
10065 Next_Component
(Comp
);
10073 end Has_Tagged_Component
;
10075 -----------------------------
10076 -- Has_Undefined_Reference --
10077 -----------------------------
10079 function Has_Undefined_Reference
(Expr
: Node_Id
) return Boolean is
10080 Has_Undef_Ref
: Boolean := False;
10081 -- Flag set when expression Expr contains at least one undefined
10084 function Is_Undefined_Reference
(N
: Node_Id
) return Traverse_Result
;
10085 -- Determine whether N denotes a reference and if it does, whether it is
10088 ----------------------------
10089 -- Is_Undefined_Reference --
10090 ----------------------------
10092 function Is_Undefined_Reference
(N
: Node_Id
) return Traverse_Result
is
10094 if Is_Entity_Name
(N
)
10095 and then Present
(Entity
(N
))
10096 and then Entity
(N
) = Any_Id
10098 Has_Undef_Ref
:= True;
10103 end Is_Undefined_Reference
;
10105 procedure Find_Undefined_References
is
10106 new Traverse_Proc
(Is_Undefined_Reference
);
10108 -- Start of processing for Has_Undefined_Reference
10111 Find_Undefined_References
(Expr
);
10113 return Has_Undef_Ref
;
10114 end Has_Undefined_Reference
;
10116 ----------------------------
10117 -- Has_Volatile_Component --
10118 ----------------------------
10120 function Has_Volatile_Component
(Typ
: Entity_Id
) return Boolean is
10124 if Has_Volatile_Components
(Typ
) then
10127 elsif Is_Array_Type
(Typ
) then
10128 return Is_Volatile
(Component_Type
(Typ
));
10130 elsif Is_Record_Type
(Typ
) then
10131 Comp
:= First_Component
(Typ
);
10132 while Present
(Comp
) loop
10133 if Is_Volatile_Object
(Comp
) then
10137 Comp
:= Next_Component
(Comp
);
10142 end Has_Volatile_Component
;
10144 -------------------------
10145 -- Implementation_Kind --
10146 -------------------------
10148 function Implementation_Kind
(Subp
: Entity_Id
) return Name_Id
is
10149 Impl_Prag
: constant Node_Id
:= Get_Rep_Pragma
(Subp
, Name_Implemented
);
10152 pragma Assert
(Present
(Impl_Prag
));
10153 Arg
:= Last
(Pragma_Argument_Associations
(Impl_Prag
));
10154 return Chars
(Get_Pragma_Arg
(Arg
));
10155 end Implementation_Kind
;
10157 --------------------------
10158 -- Implements_Interface --
10159 --------------------------
10161 function Implements_Interface
10162 (Typ_Ent
: Entity_Id
;
10163 Iface_Ent
: Entity_Id
;
10164 Exclude_Parents
: Boolean := False) return Boolean
10166 Ifaces_List
: Elist_Id
;
10168 Iface
: Entity_Id
:= Base_Type
(Iface_Ent
);
10169 Typ
: Entity_Id
:= Base_Type
(Typ_Ent
);
10172 if Is_Class_Wide_Type
(Typ
) then
10173 Typ
:= Root_Type
(Typ
);
10176 if not Has_Interfaces
(Typ
) then
10180 if Is_Class_Wide_Type
(Iface
) then
10181 Iface
:= Root_Type
(Iface
);
10184 Collect_Interfaces
(Typ
, Ifaces_List
);
10186 Elmt
:= First_Elmt
(Ifaces_List
);
10187 while Present
(Elmt
) loop
10188 if Is_Ancestor
(Node
(Elmt
), Typ
, Use_Full_View
=> True)
10189 and then Exclude_Parents
10193 elsif Node
(Elmt
) = Iface
then
10201 end Implements_Interface
;
10203 ------------------------------------
10204 -- In_Assertion_Expression_Pragma --
10205 ------------------------------------
10207 function In_Assertion_Expression_Pragma
(N
: Node_Id
) return Boolean is
10209 Prag
: Node_Id
:= Empty
;
10212 -- Climb the parent chain looking for an enclosing pragma
10215 while Present
(Par
) loop
10216 if Nkind
(Par
) = N_Pragma
then
10220 -- Precondition-like pragmas are expanded into if statements, check
10221 -- the original node instead.
10223 elsif Nkind
(Original_Node
(Par
)) = N_Pragma
then
10224 Prag
:= Original_Node
(Par
);
10227 -- The expansion of attribute 'Old generates a constant to capture
10228 -- the result of the prefix. If the parent traversal reaches
10229 -- one of these constants, then the node technically came from a
10230 -- postcondition-like pragma. Note that the Ekind is not tested here
10231 -- because N may be the expression of an object declaration which is
10232 -- currently being analyzed. Such objects carry Ekind of E_Void.
10234 elsif Nkind
(Par
) = N_Object_Declaration
10235 and then Constant_Present
(Par
)
10236 and then Stores_Attribute_Old_Prefix
(Defining_Entity
(Par
))
10240 -- Prevent the search from going too far
10242 elsif Is_Body_Or_Package_Declaration
(Par
) then
10246 Par
:= Parent
(Par
);
10251 and then Assertion_Expression_Pragma
(Get_Pragma_Id
(Prag
));
10252 end In_Assertion_Expression_Pragma
;
10258 function In_Instance
return Boolean is
10259 Curr_Unit
: constant Entity_Id
:= Cunit_Entity
(Current_Sem_Unit
);
10263 S
:= Current_Scope
;
10264 while Present
(S
) and then S
/= Standard_Standard
loop
10265 if Ekind_In
(S
, E_Function
, E_Package
, E_Procedure
)
10266 and then Is_Generic_Instance
(S
)
10268 -- A child instance is always compiled in the context of a parent
10269 -- instance. Nevertheless, the actuals are not analyzed in an
10270 -- instance context. We detect this case by examining the current
10271 -- compilation unit, which must be a child instance, and checking
10272 -- that it is not currently on the scope stack.
10274 if Is_Child_Unit
(Curr_Unit
)
10275 and then Nkind
(Unit
(Cunit
(Current_Sem_Unit
))) =
10276 N_Package_Instantiation
10277 and then not In_Open_Scopes
(Curr_Unit
)
10291 ----------------------
10292 -- In_Instance_Body --
10293 ----------------------
10295 function In_Instance_Body
return Boolean is
10299 S
:= Current_Scope
;
10300 while Present
(S
) and then S
/= Standard_Standard
loop
10301 if Ekind_In
(S
, E_Function
, E_Procedure
)
10302 and then Is_Generic_Instance
(S
)
10306 elsif Ekind
(S
) = E_Package
10307 and then In_Package_Body
(S
)
10308 and then Is_Generic_Instance
(S
)
10317 end In_Instance_Body
;
10319 -----------------------------
10320 -- In_Instance_Not_Visible --
10321 -----------------------------
10323 function In_Instance_Not_Visible
return Boolean is
10327 S
:= Current_Scope
;
10328 while Present
(S
) and then S
/= Standard_Standard
loop
10329 if Ekind_In
(S
, E_Function
, E_Procedure
)
10330 and then Is_Generic_Instance
(S
)
10334 elsif Ekind
(S
) = E_Package
10335 and then (In_Package_Body
(S
) or else In_Private_Part
(S
))
10336 and then Is_Generic_Instance
(S
)
10345 end In_Instance_Not_Visible
;
10347 ------------------------------
10348 -- In_Instance_Visible_Part --
10349 ------------------------------
10351 function In_Instance_Visible_Part
return Boolean is
10355 S
:= Current_Scope
;
10356 while Present
(S
) and then S
/= Standard_Standard
loop
10357 if Ekind
(S
) = E_Package
10358 and then Is_Generic_Instance
(S
)
10359 and then not In_Package_Body
(S
)
10360 and then not In_Private_Part
(S
)
10369 end In_Instance_Visible_Part
;
10371 ---------------------
10372 -- In_Package_Body --
10373 ---------------------
10375 function In_Package_Body
return Boolean is
10379 S
:= Current_Scope
;
10380 while Present
(S
) and then S
/= Standard_Standard
loop
10381 if Ekind
(S
) = E_Package
and then In_Package_Body
(S
) then
10389 end In_Package_Body
;
10391 --------------------------------
10392 -- In_Parameter_Specification --
10393 --------------------------------
10395 function In_Parameter_Specification
(N
: Node_Id
) return Boolean is
10400 while Present
(PN
) loop
10401 if Nkind
(PN
) = N_Parameter_Specification
then
10409 end In_Parameter_Specification
;
10411 --------------------------
10412 -- In_Pragma_Expression --
10413 --------------------------
10415 function In_Pragma_Expression
(N
: Node_Id
; Nam
: Name_Id
) return Boolean is
10422 elsif Nkind
(P
) = N_Pragma
and then Pragma_Name
(P
) = Nam
then
10428 end In_Pragma_Expression
;
10430 -------------------------------------
10431 -- In_Reverse_Storage_Order_Object --
10432 -------------------------------------
10434 function In_Reverse_Storage_Order_Object
(N
: Node_Id
) return Boolean is
10436 Btyp
: Entity_Id
:= Empty
;
10439 -- Climb up indexed components
10443 case Nkind
(Pref
) is
10444 when N_Selected_Component
=>
10445 Pref
:= Prefix
(Pref
);
10448 when N_Indexed_Component
=>
10449 Pref
:= Prefix
(Pref
);
10457 if Present
(Pref
) then
10458 Btyp
:= Base_Type
(Etype
(Pref
));
10461 return Present
(Btyp
)
10462 and then (Is_Record_Type
(Btyp
) or else Is_Array_Type
(Btyp
))
10463 and then Reverse_Storage_Order
(Btyp
);
10464 end In_Reverse_Storage_Order_Object
;
10466 --------------------------------------
10467 -- In_Subprogram_Or_Concurrent_Unit --
10468 --------------------------------------
10470 function In_Subprogram_Or_Concurrent_Unit
return Boolean is
10475 -- Use scope chain to check successively outer scopes
10477 E
:= Current_Scope
;
10481 if K
in Subprogram_Kind
10482 or else K
in Concurrent_Kind
10483 or else K
in Generic_Subprogram_Kind
10487 elsif E
= Standard_Standard
then
10493 end In_Subprogram_Or_Concurrent_Unit
;
10495 ---------------------
10496 -- In_Visible_Part --
10497 ---------------------
10499 function In_Visible_Part
(Scope_Id
: Entity_Id
) return Boolean is
10501 return Is_Package_Or_Generic_Package
(Scope_Id
)
10502 and then In_Open_Scopes
(Scope_Id
)
10503 and then not In_Package_Body
(Scope_Id
)
10504 and then not In_Private_Part
(Scope_Id
);
10505 end In_Visible_Part
;
10507 --------------------------------
10508 -- Incomplete_Or_Partial_View --
10509 --------------------------------
10511 function Incomplete_Or_Partial_View
(Id
: Entity_Id
) return Entity_Id
is
10512 function Inspect_Decls
10514 Taft
: Boolean := False) return Entity_Id
;
10515 -- Check whether a declarative region contains the incomplete or partial
10518 -------------------
10519 -- Inspect_Decls --
10520 -------------------
10522 function Inspect_Decls
10524 Taft
: Boolean := False) return Entity_Id
10530 Decl
:= First
(Decls
);
10531 while Present
(Decl
) loop
10535 if Nkind
(Decl
) = N_Incomplete_Type_Declaration
then
10536 Match
:= Defining_Identifier
(Decl
);
10540 if Nkind_In
(Decl
, N_Private_Extension_Declaration
,
10541 N_Private_Type_Declaration
)
10543 Match
:= Defining_Identifier
(Decl
);
10548 and then Present
(Full_View
(Match
))
10549 and then Full_View
(Match
) = Id
10564 -- Start of processing for Incomplete_Or_Partial_View
10567 -- Deferred constant or incomplete type case
10569 Prev
:= Current_Entity_In_Scope
(Id
);
10572 and then (Is_Incomplete_Type
(Prev
) or else Ekind
(Prev
) = E_Constant
)
10573 and then Present
(Full_View
(Prev
))
10574 and then Full_View
(Prev
) = Id
10579 -- Private or Taft amendment type case
10582 Pkg
: constant Entity_Id
:= Scope
(Id
);
10583 Pkg_Decl
: Node_Id
:= Pkg
;
10586 if Present
(Pkg
) and then Ekind
(Pkg
) = E_Package
then
10587 while Nkind
(Pkg_Decl
) /= N_Package_Specification
loop
10588 Pkg_Decl
:= Parent
(Pkg_Decl
);
10591 -- It is knows that Typ has a private view, look for it in the
10592 -- visible declarations of the enclosing scope. A special case
10593 -- of this is when the two views have been exchanged - the full
10594 -- appears earlier than the private.
10596 if Has_Private_Declaration
(Id
) then
10597 Prev
:= Inspect_Decls
(Visible_Declarations
(Pkg_Decl
));
10599 -- Exchanged view case, look in the private declarations
10602 Prev
:= Inspect_Decls
(Private_Declarations
(Pkg_Decl
));
10607 -- Otherwise if this is the package body, then Typ is a potential
10608 -- Taft amendment type. The incomplete view should be located in
10609 -- the private declarations of the enclosing scope.
10611 elsif In_Package_Body
(Pkg
) then
10612 return Inspect_Decls
(Private_Declarations
(Pkg_Decl
), True);
10617 -- The type has no incomplete or private view
10620 end Incomplete_Or_Partial_View
;
10622 -----------------------------------------
10623 -- Inherit_Default_Init_Cond_Procedure --
10624 -----------------------------------------
10626 procedure Inherit_Default_Init_Cond_Procedure
(Typ
: Entity_Id
) is
10627 Par_Typ
: constant Entity_Id
:= Etype
(Typ
);
10630 -- A derived type inherits the default initial condition procedure of
10631 -- its parent type.
10633 if No
(Default_Init_Cond_Procedure
(Typ
)) then
10634 Set_Default_Init_Cond_Procedure
10635 (Typ
, Default_Init_Cond_Procedure
(Par_Typ
));
10637 end Inherit_Default_Init_Cond_Procedure
;
10639 ----------------------------
10640 -- Inherit_Rep_Item_Chain --
10641 ----------------------------
10643 procedure Inherit_Rep_Item_Chain
(Typ
: Entity_Id
; From_Typ
: Entity_Id
) is
10644 From_Item
: constant Node_Id
:= First_Rep_Item
(From_Typ
);
10645 Item
: Node_Id
:= Empty
;
10646 Last_Item
: Node_Id
:= Empty
;
10649 -- Reach the end of the destination type's chain (if any) and capture
10652 Item
:= First_Rep_Item
(Typ
);
10653 while Present
(Item
) loop
10655 -- Do not inherit a chain that has been inherited already
10657 if Item
= From_Item
then
10662 Item
:= Next_Rep_Item
(Item
);
10665 Item
:= First_Rep_Item
(From_Typ
);
10667 -- Additional check when both parent and current type have rep.
10668 -- items, to prevent circularities when the derivation completes
10669 -- a private declaration and inherits from both views of the parent.
10670 -- There may be a remaining problem with the proper ordering of
10671 -- attribute specifications and aspects on the chains of the four
10672 -- entities involved. ???
10674 if Present
(Item
) and then Present
(From_Item
) then
10675 while Present
(Item
) loop
10676 if Item
= First_Rep_Item
(Typ
) then
10680 Item
:= Next_Rep_Item
(Item
);
10684 -- When the destination type has a rep item chain, the chain of the
10685 -- source type is appended to it.
10687 if Present
(Last_Item
) then
10688 Set_Next_Rep_Item
(Last_Item
, From_Item
);
10690 -- Otherwise the destination type directly inherits the rep item chain
10691 -- of the source type (if any).
10694 Set_First_Rep_Item
(Typ
, From_Item
);
10696 end Inherit_Rep_Item_Chain
;
10698 ---------------------------------
10699 -- Insert_Explicit_Dereference --
10700 ---------------------------------
10702 procedure Insert_Explicit_Dereference
(N
: Node_Id
) is
10703 New_Prefix
: constant Node_Id
:= Relocate_Node
(N
);
10704 Ent
: Entity_Id
:= Empty
;
10711 Save_Interps
(N
, New_Prefix
);
10714 Make_Explicit_Dereference
(Sloc
(Parent
(N
)),
10715 Prefix
=> New_Prefix
));
10717 Set_Etype
(N
, Designated_Type
(Etype
(New_Prefix
)));
10719 if Is_Overloaded
(New_Prefix
) then
10721 -- The dereference is also overloaded, and its interpretations are
10722 -- the designated types of the interpretations of the original node.
10724 Set_Etype
(N
, Any_Type
);
10726 Get_First_Interp
(New_Prefix
, I
, It
);
10727 while Present
(It
.Nam
) loop
10730 if Is_Access_Type
(T
) then
10731 Add_One_Interp
(N
, Designated_Type
(T
), Designated_Type
(T
));
10734 Get_Next_Interp
(I
, It
);
10740 -- Prefix is unambiguous: mark the original prefix (which might
10741 -- Come_From_Source) as a reference, since the new (relocated) one
10742 -- won't be taken into account.
10744 if Is_Entity_Name
(New_Prefix
) then
10745 Ent
:= Entity
(New_Prefix
);
10746 Pref
:= New_Prefix
;
10748 -- For a retrieval of a subcomponent of some composite object,
10749 -- retrieve the ultimate entity if there is one.
10751 elsif Nkind_In
(New_Prefix
, N_Selected_Component
,
10752 N_Indexed_Component
)
10754 Pref
:= Prefix
(New_Prefix
);
10755 while Present
(Pref
)
10756 and then Nkind_In
(Pref
, N_Selected_Component
,
10757 N_Indexed_Component
)
10759 Pref
:= Prefix
(Pref
);
10762 if Present
(Pref
) and then Is_Entity_Name
(Pref
) then
10763 Ent
:= Entity
(Pref
);
10767 -- Place the reference on the entity node
10769 if Present
(Ent
) then
10770 Generate_Reference
(Ent
, Pref
);
10773 end Insert_Explicit_Dereference
;
10775 ------------------------------------------
10776 -- Inspect_Deferred_Constant_Completion --
10777 ------------------------------------------
10779 procedure Inspect_Deferred_Constant_Completion
(Decls
: List_Id
) is
10783 Decl
:= First
(Decls
);
10784 while Present
(Decl
) loop
10786 -- Deferred constant signature
10788 if Nkind
(Decl
) = N_Object_Declaration
10789 and then Constant_Present
(Decl
)
10790 and then No
(Expression
(Decl
))
10792 -- No need to check internally generated constants
10794 and then Comes_From_Source
(Decl
)
10796 -- The constant is not completed. A full object declaration or a
10797 -- pragma Import complete a deferred constant.
10799 and then not Has_Completion
(Defining_Identifier
(Decl
))
10802 ("constant declaration requires initialization expression",
10803 Defining_Identifier
(Decl
));
10806 Decl
:= Next
(Decl
);
10808 end Inspect_Deferred_Constant_Completion
;
10810 -----------------------------
10811 -- Install_Generic_Formals --
10812 -----------------------------
10814 procedure Install_Generic_Formals
(Subp_Id
: Entity_Id
) is
10818 pragma Assert
(Is_Generic_Subprogram
(Subp_Id
));
10820 E
:= First_Entity
(Subp_Id
);
10821 while Present
(E
) loop
10822 Install_Entity
(E
);
10825 end Install_Generic_Formals
;
10827 -----------------------------
10828 -- Is_Actual_Out_Parameter --
10829 -----------------------------
10831 function Is_Actual_Out_Parameter
(N
: Node_Id
) return Boolean is
10832 Formal
: Entity_Id
;
10835 Find_Actual
(N
, Formal
, Call
);
10836 return Present
(Formal
) and then Ekind
(Formal
) = E_Out_Parameter
;
10837 end Is_Actual_Out_Parameter
;
10839 -------------------------
10840 -- Is_Actual_Parameter --
10841 -------------------------
10843 function Is_Actual_Parameter
(N
: Node_Id
) return Boolean is
10844 PK
: constant Node_Kind
:= Nkind
(Parent
(N
));
10848 when N_Parameter_Association
=>
10849 return N
= Explicit_Actual_Parameter
(Parent
(N
));
10851 when N_Subprogram_Call
=>
10852 return Is_List_Member
(N
)
10854 List_Containing
(N
) = Parameter_Associations
(Parent
(N
));
10859 end Is_Actual_Parameter
;
10861 --------------------------------
10862 -- Is_Actual_Tagged_Parameter --
10863 --------------------------------
10865 function Is_Actual_Tagged_Parameter
(N
: Node_Id
) return Boolean is
10866 Formal
: Entity_Id
;
10869 Find_Actual
(N
, Formal
, Call
);
10870 return Present
(Formal
) and then Is_Tagged_Type
(Etype
(Formal
));
10871 end Is_Actual_Tagged_Parameter
;
10873 ---------------------
10874 -- Is_Aliased_View --
10875 ---------------------
10877 function Is_Aliased_View
(Obj
: Node_Id
) return Boolean is
10881 if Is_Entity_Name
(Obj
) then
10888 or else (Present
(Renamed_Object
(E
))
10889 and then Is_Aliased_View
(Renamed_Object
(E
)))))
10891 or else ((Is_Formal
(E
)
10892 or else Ekind_In
(E
, E_Generic_In_Out_Parameter
,
10893 E_Generic_In_Parameter
))
10894 and then Is_Tagged_Type
(Etype
(E
)))
10896 or else (Is_Concurrent_Type
(E
) and then In_Open_Scopes
(E
))
10898 -- Current instance of type, either directly or as rewritten
10899 -- reference to the current object.
10901 or else (Is_Entity_Name
(Original_Node
(Obj
))
10902 and then Present
(Entity
(Original_Node
(Obj
)))
10903 and then Is_Type
(Entity
(Original_Node
(Obj
))))
10905 or else (Is_Type
(E
) and then E
= Current_Scope
)
10907 or else (Is_Incomplete_Or_Private_Type
(E
)
10908 and then Full_View
(E
) = Current_Scope
)
10910 -- Ada 2012 AI05-0053: the return object of an extended return
10911 -- statement is aliased if its type is immutably limited.
10913 or else (Is_Return_Object
(E
)
10914 and then Is_Limited_View
(Etype
(E
)));
10916 elsif Nkind
(Obj
) = N_Selected_Component
then
10917 return Is_Aliased
(Entity
(Selector_Name
(Obj
)));
10919 elsif Nkind
(Obj
) = N_Indexed_Component
then
10920 return Has_Aliased_Components
(Etype
(Prefix
(Obj
)))
10922 (Is_Access_Type
(Etype
(Prefix
(Obj
)))
10923 and then Has_Aliased_Components
10924 (Designated_Type
(Etype
(Prefix
(Obj
)))));
10926 elsif Nkind_In
(Obj
, N_Unchecked_Type_Conversion
, N_Type_Conversion
) then
10927 return Is_Tagged_Type
(Etype
(Obj
))
10928 and then Is_Aliased_View
(Expression
(Obj
));
10930 elsif Nkind
(Obj
) = N_Explicit_Dereference
then
10931 return Nkind
(Original_Node
(Obj
)) /= N_Function_Call
;
10936 end Is_Aliased_View
;
10938 -------------------------
10939 -- Is_Ancestor_Package --
10940 -------------------------
10942 function Is_Ancestor_Package
10944 E2
: Entity_Id
) return Boolean
10950 while Present
(Par
) and then Par
/= Standard_Standard
loop
10955 Par
:= Scope
(Par
);
10959 end Is_Ancestor_Package
;
10961 ----------------------
10962 -- Is_Atomic_Object --
10963 ----------------------
10965 function Is_Atomic_Object
(N
: Node_Id
) return Boolean is
10967 function Object_Has_Atomic_Components
(N
: Node_Id
) return Boolean;
10968 -- Determines if given object has atomic components
10970 function Is_Atomic_Prefix
(N
: Node_Id
) return Boolean;
10971 -- If prefix is an implicit dereference, examine designated type
10973 ----------------------
10974 -- Is_Atomic_Prefix --
10975 ----------------------
10977 function Is_Atomic_Prefix
(N
: Node_Id
) return Boolean is
10979 if Is_Access_Type
(Etype
(N
)) then
10981 Has_Atomic_Components
(Designated_Type
(Etype
(N
)));
10983 return Object_Has_Atomic_Components
(N
);
10985 end Is_Atomic_Prefix
;
10987 ----------------------------------
10988 -- Object_Has_Atomic_Components --
10989 ----------------------------------
10991 function Object_Has_Atomic_Components
(N
: Node_Id
) return Boolean is
10993 if Has_Atomic_Components
(Etype
(N
))
10994 or else Is_Atomic
(Etype
(N
))
10998 elsif Is_Entity_Name
(N
)
10999 and then (Has_Atomic_Components
(Entity
(N
))
11000 or else Is_Atomic
(Entity
(N
)))
11004 elsif Nkind
(N
) = N_Selected_Component
11005 and then Is_Atomic
(Entity
(Selector_Name
(N
)))
11009 elsif Nkind
(N
) = N_Indexed_Component
11010 or else Nkind
(N
) = N_Selected_Component
11012 return Is_Atomic_Prefix
(Prefix
(N
));
11017 end Object_Has_Atomic_Components
;
11019 -- Start of processing for Is_Atomic_Object
11022 -- Predicate is not relevant to subprograms
11024 if Is_Entity_Name
(N
) and then Is_Overloadable
(Entity
(N
)) then
11027 elsif Is_Atomic
(Etype
(N
))
11028 or else (Is_Entity_Name
(N
) and then Is_Atomic
(Entity
(N
)))
11032 elsif Nkind
(N
) = N_Selected_Component
11033 and then Is_Atomic
(Entity
(Selector_Name
(N
)))
11037 elsif Nkind
(N
) = N_Indexed_Component
11038 or else Nkind
(N
) = N_Selected_Component
11040 return Is_Atomic_Prefix
(Prefix
(N
));
11045 end Is_Atomic_Object
;
11047 -----------------------------
11048 -- Is_Atomic_Or_VFA_Object --
11049 -----------------------------
11051 function Is_Atomic_Or_VFA_Object
(N
: Node_Id
) return Boolean is
11053 return Is_Atomic_Object
(N
)
11054 or else (Is_Object_Reference
(N
)
11055 and then Is_Entity_Name
(N
)
11056 and then (Is_Volatile_Full_Access
(Entity
(N
))
11058 Is_Volatile_Full_Access
(Etype
(Entity
(N
)))));
11059 end Is_Atomic_Or_VFA_Object
;
11061 -------------------------
11062 -- Is_Attribute_Result --
11063 -------------------------
11065 function Is_Attribute_Result
(N
: Node_Id
) return Boolean is
11067 return Nkind
(N
) = N_Attribute_Reference
11068 and then Attribute_Name
(N
) = Name_Result
;
11069 end Is_Attribute_Result
;
11071 -------------------------
11072 -- Is_Attribute_Update --
11073 -------------------------
11075 function Is_Attribute_Update
(N
: Node_Id
) return Boolean is
11077 return Nkind
(N
) = N_Attribute_Reference
11078 and then Attribute_Name
(N
) = Name_Update
;
11079 end Is_Attribute_Update
;
11081 ------------------------------------
11082 -- Is_Body_Or_Package_Declaration --
11083 ------------------------------------
11085 function Is_Body_Or_Package_Declaration
(N
: Node_Id
) return Boolean is
11087 return Nkind_In
(N
, N_Entry_Body
,
11089 N_Package_Declaration
,
11093 end Is_Body_Or_Package_Declaration
;
11095 -----------------------
11096 -- Is_Bounded_String --
11097 -----------------------
11099 function Is_Bounded_String
(T
: Entity_Id
) return Boolean is
11100 Under
: constant Entity_Id
:= Underlying_Type
(Root_Type
(T
));
11103 -- Check whether T is ultimately derived from Ada.Strings.Superbounded.
11104 -- Super_String, or one of the [Wide_]Wide_ versions. This will
11105 -- be True for all the Bounded_String types in instances of the
11106 -- Generic_Bounded_Length generics, and for types derived from those.
11108 return Present
(Under
)
11109 and then (Is_RTE
(Root_Type
(Under
), RO_SU_Super_String
) or else
11110 Is_RTE
(Root_Type
(Under
), RO_WI_Super_String
) or else
11111 Is_RTE
(Root_Type
(Under
), RO_WW_Super_String
));
11112 end Is_Bounded_String
;
11114 -------------------------
11115 -- Is_Child_Or_Sibling --
11116 -------------------------
11118 function Is_Child_Or_Sibling
11119 (Pack_1
: Entity_Id
;
11120 Pack_2
: Entity_Id
) return Boolean
11122 function Distance_From_Standard
(Pack
: Entity_Id
) return Nat
;
11123 -- Given an arbitrary package, return the number of "climbs" necessary
11124 -- to reach scope Standard_Standard.
11126 procedure Equalize_Depths
11127 (Pack
: in out Entity_Id
;
11128 Depth
: in out Nat
;
11129 Depth_To_Reach
: Nat
);
11130 -- Given an arbitrary package, its depth and a target depth to reach,
11131 -- climb the scope chain until the said depth is reached. The pointer
11132 -- to the package and its depth a modified during the climb.
11134 ----------------------------
11135 -- Distance_From_Standard --
11136 ----------------------------
11138 function Distance_From_Standard
(Pack
: Entity_Id
) return Nat
is
11145 while Present
(Scop
) and then Scop
/= Standard_Standard
loop
11147 Scop
:= Scope
(Scop
);
11151 end Distance_From_Standard
;
11153 ---------------------
11154 -- Equalize_Depths --
11155 ---------------------
11157 procedure Equalize_Depths
11158 (Pack
: in out Entity_Id
;
11159 Depth
: in out Nat
;
11160 Depth_To_Reach
: Nat
)
11163 -- The package must be at a greater or equal depth
11165 if Depth
< Depth_To_Reach
then
11166 raise Program_Error
;
11169 -- Climb the scope chain until the desired depth is reached
11171 while Present
(Pack
) and then Depth
/= Depth_To_Reach
loop
11172 Pack
:= Scope
(Pack
);
11173 Depth
:= Depth
- 1;
11175 end Equalize_Depths
;
11179 P_1
: Entity_Id
:= Pack_1
;
11180 P_1_Child
: Boolean := False;
11181 P_1_Depth
: Nat
:= Distance_From_Standard
(P_1
);
11182 P_2
: Entity_Id
:= Pack_2
;
11183 P_2_Child
: Boolean := False;
11184 P_2_Depth
: Nat
:= Distance_From_Standard
(P_2
);
11186 -- Start of processing for Is_Child_Or_Sibling
11190 (Ekind
(Pack_1
) = E_Package
and then Ekind
(Pack_2
) = E_Package
);
11192 -- Both packages denote the same entity, therefore they cannot be
11193 -- children or siblings.
11198 -- One of the packages is at a deeper level than the other. Note that
11199 -- both may still come from differen hierarchies.
11207 elsif P_1_Depth
> P_2_Depth
then
11210 Depth
=> P_1_Depth
,
11211 Depth_To_Reach
=> P_2_Depth
);
11220 elsif P_2_Depth
> P_1_Depth
then
11223 Depth
=> P_2_Depth
,
11224 Depth_To_Reach
=> P_1_Depth
);
11228 -- At this stage the package pointers have been elevated to the same
11229 -- depth. If the related entities are the same, then one package is a
11230 -- potential child of the other:
11234 -- X became P_1 P_2 or vica versa
11240 return Is_Child_Unit
(Pack_1
);
11242 else pragma Assert
(P_2_Child
);
11243 return Is_Child_Unit
(Pack_2
);
11246 -- The packages may come from the same package chain or from entirely
11247 -- different hierarcies. To determine this, climb the scope stack until
11248 -- a common root is found.
11250 -- (root) (root 1) (root 2)
11255 while Present
(P_1
) and then Present
(P_2
) loop
11257 -- The two packages may be siblings
11260 return Is_Child_Unit
(Pack_1
) and then Is_Child_Unit
(Pack_2
);
11263 P_1
:= Scope
(P_1
);
11264 P_2
:= Scope
(P_2
);
11269 end Is_Child_Or_Sibling
;
11271 -----------------------------
11272 -- Is_Concurrent_Interface --
11273 -----------------------------
11275 function Is_Concurrent_Interface
(T
: Entity_Id
) return Boolean is
11277 return Is_Interface
(T
)
11279 (Is_Protected_Interface
(T
)
11280 or else Is_Synchronized_Interface
(T
)
11281 or else Is_Task_Interface
(T
));
11282 end Is_Concurrent_Interface
;
11284 -----------------------
11285 -- Is_Constant_Bound --
11286 -----------------------
11288 function Is_Constant_Bound
(Exp
: Node_Id
) return Boolean is
11290 if Compile_Time_Known_Value
(Exp
) then
11293 elsif Is_Entity_Name
(Exp
) and then Present
(Entity
(Exp
)) then
11294 return Is_Constant_Object
(Entity
(Exp
))
11295 or else Ekind
(Entity
(Exp
)) = E_Enumeration_Literal
;
11297 elsif Nkind
(Exp
) in N_Binary_Op
then
11298 return Is_Constant_Bound
(Left_Opnd
(Exp
))
11299 and then Is_Constant_Bound
(Right_Opnd
(Exp
))
11300 and then Scope
(Entity
(Exp
)) = Standard_Standard
;
11305 end Is_Constant_Bound
;
11307 ---------------------------
11308 -- Is_Container_Element --
11309 ---------------------------
11311 function Is_Container_Element
(Exp
: Node_Id
) return Boolean is
11312 Loc
: constant Source_Ptr
:= Sloc
(Exp
);
11313 Pref
: constant Node_Id
:= Prefix
(Exp
);
11316 -- Call to an indexing aspect
11318 Cont_Typ
: Entity_Id
;
11319 -- The type of the container being accessed
11321 Elem_Typ
: Entity_Id
;
11322 -- Its element type
11324 Indexing
: Entity_Id
;
11325 Is_Const
: Boolean;
11326 -- Indicates that constant indexing is used, and the element is thus
11329 Ref_Typ
: Entity_Id
;
11330 -- The reference type returned by the indexing operation
11333 -- If C is a container, in a context that imposes the element type of
11334 -- that container, the indexing notation C (X) is rewritten as:
11336 -- Indexing (C, X).Discr.all
11338 -- where Indexing is one of the indexing aspects of the container.
11339 -- If the context does not require a reference, the construct can be
11344 -- First, verify that the construct has the proper form
11346 if not Expander_Active
then
11349 elsif Nkind
(Pref
) /= N_Selected_Component
then
11352 elsif Nkind
(Prefix
(Pref
)) /= N_Function_Call
then
11356 Call
:= Prefix
(Pref
);
11357 Ref_Typ
:= Etype
(Call
);
11360 if not Has_Implicit_Dereference
(Ref_Typ
)
11361 or else No
(First
(Parameter_Associations
(Call
)))
11362 or else not Is_Entity_Name
(Name
(Call
))
11367 -- Retrieve type of container object, and its iterator aspects
11369 Cont_Typ
:= Etype
(First
(Parameter_Associations
(Call
)));
11370 Indexing
:= Find_Value_Of_Aspect
(Cont_Typ
, Aspect_Constant_Indexing
);
11373 if No
(Indexing
) then
11375 -- Container should have at least one indexing operation
11379 elsif Entity
(Name
(Call
)) /= Entity
(Indexing
) then
11381 -- This may be a variable indexing operation
11383 Indexing
:= Find_Value_Of_Aspect
(Cont_Typ
, Aspect_Variable_Indexing
);
11386 or else Entity
(Name
(Call
)) /= Entity
(Indexing
)
11395 Elem_Typ
:= Find_Value_Of_Aspect
(Cont_Typ
, Aspect_Iterator_Element
);
11397 if No
(Elem_Typ
) or else Entity
(Elem_Typ
) /= Etype
(Exp
) then
11401 -- Check that the expression is not the target of an assignment, in
11402 -- which case the rewriting is not possible.
11404 if not Is_Const
then
11410 while Present
(Par
)
11412 if Nkind
(Parent
(Par
)) = N_Assignment_Statement
11413 and then Par
= Name
(Parent
(Par
))
11417 -- A renaming produces a reference, and the transformation
11420 elsif Nkind
(Parent
(Par
)) = N_Object_Renaming_Declaration
then
11424 (Nkind
(Parent
(Par
)), N_Function_Call
,
11425 N_Procedure_Call_Statement
,
11426 N_Entry_Call_Statement
)
11428 -- Check that the element is not part of an actual for an
11429 -- in-out parameter.
11436 F
:= First_Formal
(Entity
(Name
(Parent
(Par
))));
11437 A
:= First
(Parameter_Associations
(Parent
(Par
)));
11438 while Present
(F
) loop
11439 if A
= Par
and then Ekind
(F
) /= E_In_Parameter
then
11448 -- E_In_Parameter in a call: element is not modified.
11453 Par
:= Parent
(Par
);
11458 -- The expression has the proper form and the context requires the
11459 -- element type. Retrieve the Element function of the container and
11460 -- rewrite the construct as a call to it.
11466 Op
:= First_Elmt
(Primitive_Operations
(Cont_Typ
));
11467 while Present
(Op
) loop
11468 exit when Chars
(Node
(Op
)) = Name_Element
;
11477 Make_Function_Call
(Loc
,
11478 Name
=> New_Occurrence_Of
(Node
(Op
), Loc
),
11479 Parameter_Associations
=> Parameter_Associations
(Call
)));
11480 Analyze_And_Resolve
(Exp
, Entity
(Elem_Typ
));
11484 end Is_Container_Element
;
11486 ----------------------------
11487 -- Is_Contract_Annotation --
11488 ----------------------------
11490 function Is_Contract_Annotation
(Item
: Node_Id
) return Boolean is
11492 return Is_Package_Contract_Annotation
(Item
)
11494 Is_Subprogram_Contract_Annotation
(Item
);
11495 end Is_Contract_Annotation
;
11497 --------------------------------------
11498 -- Is_Controlling_Limited_Procedure --
11499 --------------------------------------
11501 function Is_Controlling_Limited_Procedure
11502 (Proc_Nam
: Entity_Id
) return Boolean
11504 Param_Typ
: Entity_Id
:= Empty
;
11507 if Ekind
(Proc_Nam
) = E_Procedure
11508 and then Present
(Parameter_Specifications
(Parent
(Proc_Nam
)))
11510 Param_Typ
:= Etype
(Parameter_Type
(First
(
11511 Parameter_Specifications
(Parent
(Proc_Nam
)))));
11513 -- In this case where an Itype was created, the procedure call has been
11516 elsif Present
(Associated_Node_For_Itype
(Proc_Nam
))
11517 and then Present
(Original_Node
(Associated_Node_For_Itype
(Proc_Nam
)))
11519 Present
(Parameter_Associations
11520 (Associated_Node_For_Itype
(Proc_Nam
)))
11523 Etype
(First
(Parameter_Associations
11524 (Associated_Node_For_Itype
(Proc_Nam
))));
11527 if Present
(Param_Typ
) then
11529 Is_Interface
(Param_Typ
)
11530 and then Is_Limited_Record
(Param_Typ
);
11534 end Is_Controlling_Limited_Procedure
;
11536 -----------------------------
11537 -- Is_CPP_Constructor_Call --
11538 -----------------------------
11540 function Is_CPP_Constructor_Call
(N
: Node_Id
) return Boolean is
11542 return Nkind
(N
) = N_Function_Call
11543 and then Is_CPP_Class
(Etype
(Etype
(N
)))
11544 and then Is_Constructor
(Entity
(Name
(N
)))
11545 and then Is_Imported
(Entity
(Name
(N
)));
11546 end Is_CPP_Constructor_Call
;
11548 -------------------------
11549 -- Is_Current_Instance --
11550 -------------------------
11552 function Is_Current_Instance
(N
: Node_Id
) return Boolean is
11553 Typ
: constant Entity_Id
:= Entity
(N
);
11557 -- Simplest case: entity is a concurrent type and we are currently
11558 -- inside the body. This will eventually be expanded into a
11559 -- call to Self (for tasks) or _object (for protected objects).
11561 if Is_Concurrent_Type
(Typ
) and then In_Open_Scopes
(Typ
) then
11565 -- Check whether the context is a (sub)type declaration for the
11569 while Present
(P
) loop
11570 if Nkind_In
(P
, N_Full_Type_Declaration
,
11571 N_Private_Type_Declaration
,
11572 N_Subtype_Declaration
)
11573 and then Comes_From_Source
(P
)
11574 and then Defining_Entity
(P
) = Typ
11583 -- In any other context this is not a current occurrence
11586 end Is_Current_Instance
;
11588 --------------------
11589 -- Is_Declaration --
11590 --------------------
11592 function Is_Declaration
(N
: Node_Id
) return Boolean is
11595 when N_Abstract_Subprogram_Declaration |
11596 N_Exception_Declaration |
11597 N_Exception_Renaming_Declaration |
11598 N_Full_Type_Declaration |
11599 N_Generic_Function_Renaming_Declaration |
11600 N_Generic_Package_Declaration |
11601 N_Generic_Package_Renaming_Declaration |
11602 N_Generic_Procedure_Renaming_Declaration |
11603 N_Generic_Subprogram_Declaration |
11604 N_Number_Declaration |
11605 N_Object_Declaration |
11606 N_Object_Renaming_Declaration |
11607 N_Package_Declaration |
11608 N_Package_Renaming_Declaration |
11609 N_Private_Extension_Declaration |
11610 N_Private_Type_Declaration |
11611 N_Subprogram_Declaration |
11612 N_Subprogram_Renaming_Declaration |
11613 N_Subtype_Declaration
=>
11619 end Is_Declaration
;
11621 --------------------------------
11622 -- Is_Declared_Within_Variant --
11623 --------------------------------
11625 function Is_Declared_Within_Variant
(Comp
: Entity_Id
) return Boolean is
11626 Comp_Decl
: constant Node_Id
:= Parent
(Comp
);
11627 Comp_List
: constant Node_Id
:= Parent
(Comp_Decl
);
11629 return Nkind
(Parent
(Comp_List
)) = N_Variant
;
11630 end Is_Declared_Within_Variant
;
11632 ----------------------------------------------
11633 -- Is_Dependent_Component_Of_Mutable_Object --
11634 ----------------------------------------------
11636 function Is_Dependent_Component_Of_Mutable_Object
11637 (Object
: Node_Id
) return Boolean
11640 Prefix_Type
: Entity_Id
;
11641 P_Aliased
: Boolean := False;
11644 Deref
: Node_Id
:= Object
;
11645 -- Dereference node, in something like X.all.Y(2)
11647 -- Start of processing for Is_Dependent_Component_Of_Mutable_Object
11650 -- Find the dereference node if any
11652 while Nkind_In
(Deref
, N_Indexed_Component
,
11653 N_Selected_Component
,
11656 Deref
:= Prefix
(Deref
);
11659 -- Ada 2005: If we have a component or slice of a dereference,
11660 -- something like X.all.Y (2), and the type of X is access-to-constant,
11661 -- Is_Variable will return False, because it is indeed a constant
11662 -- view. But it might be a view of a variable object, so we want the
11663 -- following condition to be True in that case.
11665 if Is_Variable
(Object
)
11666 or else (Ada_Version
>= Ada_2005
11667 and then Nkind
(Deref
) = N_Explicit_Dereference
)
11669 if Nkind
(Object
) = N_Selected_Component
then
11670 P
:= Prefix
(Object
);
11671 Prefix_Type
:= Etype
(P
);
11673 if Is_Entity_Name
(P
) then
11674 if Ekind
(Entity
(P
)) = E_Generic_In_Out_Parameter
then
11675 Prefix_Type
:= Base_Type
(Prefix_Type
);
11678 if Is_Aliased
(Entity
(P
)) then
11682 -- A discriminant check on a selected component may be expanded
11683 -- into a dereference when removing side-effects. Recover the
11684 -- original node and its type, which may be unconstrained.
11686 elsif Nkind
(P
) = N_Explicit_Dereference
11687 and then not (Comes_From_Source
(P
))
11689 P
:= Original_Node
(P
);
11690 Prefix_Type
:= Etype
(P
);
11693 -- Check for prefix being an aliased component???
11699 -- A heap object is constrained by its initial value
11701 -- Ada 2005 (AI-363): Always assume the object could be mutable in
11702 -- the dereferenced case, since the access value might denote an
11703 -- unconstrained aliased object, whereas in Ada 95 the designated
11704 -- object is guaranteed to be constrained. A worst-case assumption
11705 -- has to apply in Ada 2005 because we can't tell at compile
11706 -- time whether the object is "constrained by its initial value"
11707 -- (despite the fact that 3.10.2(26/2) and 8.5.1(5/2) are semantic
11708 -- rules (these rules are acknowledged to need fixing).
11710 if Ada_Version
< Ada_2005
then
11711 if Is_Access_Type
(Prefix_Type
)
11712 or else Nkind
(P
) = N_Explicit_Dereference
11717 else pragma Assert
(Ada_Version
>= Ada_2005
);
11718 if Is_Access_Type
(Prefix_Type
) then
11720 -- If the access type is pool-specific, and there is no
11721 -- constrained partial view of the designated type, then the
11722 -- designated object is known to be constrained.
11724 if Ekind
(Prefix_Type
) = E_Access_Type
11725 and then not Object_Type_Has_Constrained_Partial_View
11726 (Typ
=> Designated_Type
(Prefix_Type
),
11727 Scop
=> Current_Scope
)
11731 -- Otherwise (general access type, or there is a constrained
11732 -- partial view of the designated type), we need to check
11733 -- based on the designated type.
11736 Prefix_Type
:= Designated_Type
(Prefix_Type
);
11742 Original_Record_Component
(Entity
(Selector_Name
(Object
)));
11744 -- As per AI-0017, the renaming is illegal in a generic body, even
11745 -- if the subtype is indefinite.
11747 -- Ada 2005 (AI-363): In Ada 2005 an aliased object can be mutable
11749 if not Is_Constrained
(Prefix_Type
)
11750 and then (Is_Definite_Subtype
(Prefix_Type
)
11752 (Is_Generic_Type
(Prefix_Type
)
11753 and then Ekind
(Current_Scope
) = E_Generic_Package
11754 and then In_Package_Body
(Current_Scope
)))
11756 and then (Is_Declared_Within_Variant
(Comp
)
11757 or else Has_Discriminant_Dependent_Constraint
(Comp
))
11758 and then (not P_Aliased
or else Ada_Version
>= Ada_2005
)
11762 -- If the prefix is of an access type at this point, then we want
11763 -- to return False, rather than calling this function recursively
11764 -- on the access object (which itself might be a discriminant-
11765 -- dependent component of some other object, but that isn't
11766 -- relevant to checking the object passed to us). This avoids
11767 -- issuing wrong errors when compiling with -gnatc, where there
11768 -- can be implicit dereferences that have not been expanded.
11770 elsif Is_Access_Type
(Etype
(Prefix
(Object
))) then
11775 Is_Dependent_Component_Of_Mutable_Object
(Prefix
(Object
));
11778 elsif Nkind
(Object
) = N_Indexed_Component
11779 or else Nkind
(Object
) = N_Slice
11781 return Is_Dependent_Component_Of_Mutable_Object
(Prefix
(Object
));
11783 -- A type conversion that Is_Variable is a view conversion:
11784 -- go back to the denoted object.
11786 elsif Nkind
(Object
) = N_Type_Conversion
then
11788 Is_Dependent_Component_Of_Mutable_Object
(Expression
(Object
));
11793 end Is_Dependent_Component_Of_Mutable_Object
;
11795 ---------------------
11796 -- Is_Dereferenced --
11797 ---------------------
11799 function Is_Dereferenced
(N
: Node_Id
) return Boolean is
11800 P
: constant Node_Id
:= Parent
(N
);
11802 return Nkind_In
(P
, N_Selected_Component
,
11803 N_Explicit_Dereference
,
11804 N_Indexed_Component
,
11806 and then Prefix
(P
) = N
;
11807 end Is_Dereferenced
;
11809 ----------------------
11810 -- Is_Descendent_Of --
11811 ----------------------
11813 function Is_Descendent_Of
(T1
: Entity_Id
; T2
: Entity_Id
) return Boolean is
11818 pragma Assert
(Nkind
(T1
) in N_Entity
);
11819 pragma Assert
(Nkind
(T2
) in N_Entity
);
11821 T
:= Base_Type
(T1
);
11823 -- Immediate return if the types match
11828 -- Comment needed here ???
11830 elsif Ekind
(T
) = E_Class_Wide_Type
then
11831 return Etype
(T
) = T2
;
11839 -- Done if we found the type we are looking for
11844 -- Done if no more derivations to check
11851 -- Following test catches error cases resulting from prev errors
11853 elsif No
(Etyp
) then
11856 elsif Is_Private_Type
(T
) and then Etyp
= Full_View
(T
) then
11859 elsif Is_Private_Type
(Etyp
) and then Full_View
(Etyp
) = T
then
11863 T
:= Base_Type
(Etyp
);
11866 end Is_Descendent_Of
;
11868 ----------------------------------------
11869 -- Is_Descendant_Of_Suspension_Object --
11870 ----------------------------------------
11872 function Is_Descendant_Of_Suspension_Object
11873 (Typ
: Entity_Id
) return Boolean
11875 Cur_Typ
: Entity_Id
;
11876 Par_Typ
: Entity_Id
;
11879 -- Climb the type derivation chain checking each parent type against
11880 -- Suspension_Object.
11882 Cur_Typ
:= Base_Type
(Typ
);
11883 while Present
(Cur_Typ
) loop
11884 Par_Typ
:= Etype
(Cur_Typ
);
11886 -- The current type is a match
11888 if Is_Suspension_Object
(Cur_Typ
) then
11891 -- Stop the traversal once the root of the derivation chain has been
11892 -- reached. In that case the current type is its own base type.
11894 elsif Cur_Typ
= Par_Typ
then
11898 Cur_Typ
:= Base_Type
(Par_Typ
);
11902 end Is_Descendant_Of_Suspension_Object
;
11904 ---------------------------------------------
11905 -- Is_Double_Precision_Floating_Point_Type --
11906 ---------------------------------------------
11908 function Is_Double_Precision_Floating_Point_Type
11909 (E
: Entity_Id
) return Boolean is
11911 return Is_Floating_Point_Type
(E
)
11912 and then Machine_Radix_Value
(E
) = Uint_2
11913 and then Machine_Mantissa_Value
(E
) = UI_From_Int
(53)
11914 and then Machine_Emax_Value
(E
) = Uint_2
** Uint_10
11915 and then Machine_Emin_Value
(E
) = Uint_3
- (Uint_2
** Uint_10
);
11916 end Is_Double_Precision_Floating_Point_Type
;
11918 -----------------------------
11919 -- Is_Effectively_Volatile --
11920 -----------------------------
11922 function Is_Effectively_Volatile
(Id
: Entity_Id
) return Boolean is
11924 if Is_Type
(Id
) then
11926 -- An arbitrary type is effectively volatile when it is subject to
11927 -- pragma Atomic or Volatile.
11929 if Is_Volatile
(Id
) then
11932 -- An array type is effectively volatile when it is subject to pragma
11933 -- Atomic_Components or Volatile_Components or its compolent type is
11934 -- effectively volatile.
11936 elsif Is_Array_Type
(Id
) then
11938 Has_Volatile_Components
(Id
)
11940 Is_Effectively_Volatile
(Component_Type
(Base_Type
(Id
)));
11942 -- A protected type is always volatile
11944 elsif Is_Protected_Type
(Id
) then
11947 -- A descendant of Ada.Synchronous_Task_Control.Suspension_Object is
11948 -- automatically volatile.
11950 elsif Is_Descendant_Of_Suspension_Object
(Id
) then
11953 -- Otherwise the type is not effectively volatile
11959 -- Otherwise Id denotes an object
11964 or else Has_Volatile_Components
(Id
)
11965 or else Is_Effectively_Volatile
(Etype
(Id
));
11967 end Is_Effectively_Volatile
;
11969 ------------------------------------
11970 -- Is_Effectively_Volatile_Object --
11971 ------------------------------------
11973 function Is_Effectively_Volatile_Object
(N
: Node_Id
) return Boolean is
11975 if Is_Entity_Name
(N
) then
11976 return Is_Effectively_Volatile
(Entity
(N
));
11978 elsif Nkind
(N
) = N_Expanded_Name
then
11979 return Is_Effectively_Volatile
(Entity
(N
));
11981 elsif Nkind
(N
) = N_Indexed_Component
then
11982 return Is_Effectively_Volatile_Object
(Prefix
(N
));
11984 elsif Nkind
(N
) = N_Selected_Component
then
11986 Is_Effectively_Volatile_Object
(Prefix
(N
))
11988 Is_Effectively_Volatile_Object
(Selector_Name
(N
));
11993 end Is_Effectively_Volatile_Object
;
11995 -------------------
11996 -- Is_Entry_Body --
11997 -------------------
11999 function Is_Entry_Body
(Id
: Entity_Id
) return Boolean is
12002 Ekind_In
(Id
, E_Entry
, E_Entry_Family
)
12003 and then Nkind
(Unit_Declaration_Node
(Id
)) = N_Entry_Body
;
12006 --------------------------
12007 -- Is_Entry_Declaration --
12008 --------------------------
12010 function Is_Entry_Declaration
(Id
: Entity_Id
) return Boolean is
12013 Ekind_In
(Id
, E_Entry
, E_Entry_Family
)
12014 and then Nkind
(Unit_Declaration_Node
(Id
)) = N_Entry_Declaration
;
12015 end Is_Entry_Declaration
;
12017 ----------------------------
12018 -- Is_Expression_Function --
12019 ----------------------------
12021 function Is_Expression_Function
(Subp
: Entity_Id
) return Boolean is
12023 if Ekind_In
(Subp
, E_Function
, E_Subprogram_Body
) then
12025 Nkind
(Original_Node
(Unit_Declaration_Node
(Subp
))) =
12026 N_Expression_Function
;
12030 end Is_Expression_Function
;
12032 ------------------------------------------
12033 -- Is_Expression_Function_Or_Completion --
12034 ------------------------------------------
12036 function Is_Expression_Function_Or_Completion
12037 (Subp
: Entity_Id
) return Boolean
12039 Subp_Decl
: Node_Id
;
12042 if Ekind
(Subp
) = E_Function
then
12043 Subp_Decl
:= Unit_Declaration_Node
(Subp
);
12045 -- The function declaration is either an expression function or is
12046 -- completed by an expression function body.
12049 Is_Expression_Function
(Subp
)
12050 or else (Nkind
(Subp_Decl
) = N_Subprogram_Declaration
12051 and then Present
(Corresponding_Body
(Subp_Decl
))
12052 and then Is_Expression_Function
12053 (Corresponding_Body
(Subp_Decl
)));
12055 elsif Ekind
(Subp
) = E_Subprogram_Body
then
12056 return Is_Expression_Function
(Subp
);
12061 end Is_Expression_Function_Or_Completion
;
12063 -----------------------
12064 -- Is_EVF_Expression --
12065 -----------------------
12067 function Is_EVF_Expression
(N
: Node_Id
) return Boolean is
12068 Orig_N
: constant Node_Id
:= Original_Node
(N
);
12074 -- Detect a reference to a formal parameter of a specific tagged type
12075 -- whose related subprogram is subject to pragma Expresions_Visible with
12078 if Is_Entity_Name
(N
) and then Present
(Entity
(N
)) then
12083 and then Is_Specific_Tagged_Type
(Etype
(Id
))
12084 and then Extensions_Visible_Status
(Id
) =
12085 Extensions_Visible_False
;
12087 -- A case expression is an EVF expression when it contains at least one
12088 -- EVF dependent_expression. Note that a case expression may have been
12089 -- expanded, hence the use of Original_Node.
12091 elsif Nkind
(Orig_N
) = N_Case_Expression
then
12092 Alt
:= First
(Alternatives
(Orig_N
));
12093 while Present
(Alt
) loop
12094 if Is_EVF_Expression
(Expression
(Alt
)) then
12101 -- An if expression is an EVF expression when it contains at least one
12102 -- EVF dependent_expression. Note that an if expression may have been
12103 -- expanded, hence the use of Original_Node.
12105 elsif Nkind
(Orig_N
) = N_If_Expression
then
12106 Expr
:= Next
(First
(Expressions
(Orig_N
)));
12107 while Present
(Expr
) loop
12108 if Is_EVF_Expression
(Expr
) then
12115 -- A qualified expression or a type conversion is an EVF expression when
12116 -- its operand is an EVF expression.
12118 elsif Nkind_In
(N
, N_Qualified_Expression
,
12119 N_Unchecked_Type_Conversion
,
12122 return Is_EVF_Expression
(Expression
(N
));
12124 -- Attributes 'Loop_Entry, 'Old, and 'Update are EVF expressions when
12125 -- their prefix denotes an EVF expression.
12127 elsif Nkind
(N
) = N_Attribute_Reference
12128 and then Nam_In
(Attribute_Name
(N
), Name_Loop_Entry
,
12132 return Is_EVF_Expression
(Prefix
(N
));
12136 end Is_EVF_Expression
;
12142 function Is_False
(U
: Uint
) return Boolean is
12147 ---------------------------
12148 -- Is_Fixed_Model_Number --
12149 ---------------------------
12151 function Is_Fixed_Model_Number
(U
: Ureal
; T
: Entity_Id
) return Boolean is
12152 S
: constant Ureal
:= Small_Value
(T
);
12153 M
: Urealp
.Save_Mark
;
12157 R
:= (U
= UR_Trunc
(U
/ S
) * S
);
12158 Urealp
.Release
(M
);
12160 end Is_Fixed_Model_Number
;
12162 -------------------------------
12163 -- Is_Fully_Initialized_Type --
12164 -------------------------------
12166 function Is_Fully_Initialized_Type
(Typ
: Entity_Id
) return Boolean is
12170 if Is_Scalar_Type
(Typ
) then
12172 -- A scalar type with an aspect Default_Value is fully initialized
12174 -- Note: Iniitalize/Normalize_Scalars also ensure full initialization
12175 -- of a scalar type, but we don't take that into account here, since
12176 -- we don't want these to affect warnings.
12178 return Has_Default_Aspect
(Typ
);
12180 elsif Is_Access_Type
(Typ
) then
12183 elsif Is_Array_Type
(Typ
) then
12184 if Is_Fully_Initialized_Type
(Component_Type
(Typ
))
12185 or else (Ada_Version
>= Ada_2012
and then Has_Default_Aspect
(Typ
))
12190 -- An interesting case, if we have a constrained type one of whose
12191 -- bounds is known to be null, then there are no elements to be
12192 -- initialized, so all the elements are initialized.
12194 if Is_Constrained
(Typ
) then
12197 Indx_Typ
: Entity_Id
;
12198 Lbd
, Hbd
: Node_Id
;
12201 Indx
:= First_Index
(Typ
);
12202 while Present
(Indx
) loop
12203 if Etype
(Indx
) = Any_Type
then
12206 -- If index is a range, use directly
12208 elsif Nkind
(Indx
) = N_Range
then
12209 Lbd
:= Low_Bound
(Indx
);
12210 Hbd
:= High_Bound
(Indx
);
12213 Indx_Typ
:= Etype
(Indx
);
12215 if Is_Private_Type
(Indx_Typ
) then
12216 Indx_Typ
:= Full_View
(Indx_Typ
);
12219 if No
(Indx_Typ
) or else Etype
(Indx_Typ
) = Any_Type
then
12222 Lbd
:= Type_Low_Bound
(Indx_Typ
);
12223 Hbd
:= Type_High_Bound
(Indx_Typ
);
12227 if Compile_Time_Known_Value
(Lbd
)
12229 Compile_Time_Known_Value
(Hbd
)
12231 if Expr_Value
(Hbd
) < Expr_Value
(Lbd
) then
12241 -- If no null indexes, then type is not fully initialized
12247 elsif Is_Record_Type
(Typ
) then
12248 if Has_Discriminants
(Typ
)
12250 Present
(Discriminant_Default_Value
(First_Discriminant
(Typ
)))
12251 and then Is_Fully_Initialized_Variant
(Typ
)
12256 -- We consider bounded string types to be fully initialized, because
12257 -- otherwise we get false alarms when the Data component is not
12258 -- default-initialized.
12260 if Is_Bounded_String
(Typ
) then
12264 -- Controlled records are considered to be fully initialized if
12265 -- there is a user defined Initialize routine. This may not be
12266 -- entirely correct, but as the spec notes, we are guessing here
12267 -- what is best from the point of view of issuing warnings.
12269 if Is_Controlled
(Typ
) then
12271 Utyp
: constant Entity_Id
:= Underlying_Type
(Typ
);
12274 if Present
(Utyp
) then
12276 Init
: constant Entity_Id
:=
12277 (Find_Optional_Prim_Op
12278 (Underlying_Type
(Typ
), Name_Initialize
));
12282 and then Comes_From_Source
(Init
)
12284 Is_Predefined_File_Name
12285 (File_Name
(Get_Source_File_Index
(Sloc
(Init
))))
12289 elsif Has_Null_Extension
(Typ
)
12291 Is_Fully_Initialized_Type
12292 (Etype
(Base_Type
(Typ
)))
12301 -- Otherwise see if all record components are initialized
12307 Ent
:= First_Entity
(Typ
);
12308 while Present
(Ent
) loop
12309 if Ekind
(Ent
) = E_Component
12310 and then (No
(Parent
(Ent
))
12311 or else No
(Expression
(Parent
(Ent
))))
12312 and then not Is_Fully_Initialized_Type
(Etype
(Ent
))
12314 -- Special VM case for tag components, which need to be
12315 -- defined in this case, but are never initialized as VMs
12316 -- are using other dispatching mechanisms. Ignore this
12317 -- uninitialized case. Note that this applies both to the
12318 -- uTag entry and the main vtable pointer (CPP_Class case).
12320 and then (Tagged_Type_Expansion
or else not Is_Tag
(Ent
))
12329 -- No uninitialized components, so type is fully initialized.
12330 -- Note that this catches the case of no components as well.
12334 elsif Is_Concurrent_Type
(Typ
) then
12337 elsif Is_Private_Type
(Typ
) then
12339 U
: constant Entity_Id
:= Underlying_Type
(Typ
);
12345 return Is_Fully_Initialized_Type
(U
);
12352 end Is_Fully_Initialized_Type
;
12354 ----------------------------------
12355 -- Is_Fully_Initialized_Variant --
12356 ----------------------------------
12358 function Is_Fully_Initialized_Variant
(Typ
: Entity_Id
) return Boolean is
12359 Loc
: constant Source_Ptr
:= Sloc
(Typ
);
12360 Constraints
: constant List_Id
:= New_List
;
12361 Components
: constant Elist_Id
:= New_Elmt_List
;
12362 Comp_Elmt
: Elmt_Id
;
12364 Comp_List
: Node_Id
;
12366 Discr_Val
: Node_Id
;
12368 Report_Errors
: Boolean;
12369 pragma Warnings
(Off
, Report_Errors
);
12372 if Serious_Errors_Detected
> 0 then
12376 if Is_Record_Type
(Typ
)
12377 and then Nkind
(Parent
(Typ
)) = N_Full_Type_Declaration
12378 and then Nkind
(Type_Definition
(Parent
(Typ
))) = N_Record_Definition
12380 Comp_List
:= Component_List
(Type_Definition
(Parent
(Typ
)));
12382 Discr
:= First_Discriminant
(Typ
);
12383 while Present
(Discr
) loop
12384 if Nkind
(Parent
(Discr
)) = N_Discriminant_Specification
then
12385 Discr_Val
:= Expression
(Parent
(Discr
));
12387 if Present
(Discr_Val
)
12388 and then Is_OK_Static_Expression
(Discr_Val
)
12390 Append_To
(Constraints
,
12391 Make_Component_Association
(Loc
,
12392 Choices
=> New_List
(New_Occurrence_Of
(Discr
, Loc
)),
12393 Expression
=> New_Copy
(Discr_Val
)));
12401 Next_Discriminant
(Discr
);
12406 Comp_List
=> Comp_List
,
12407 Governed_By
=> Constraints
,
12408 Into
=> Components
,
12409 Report_Errors
=> Report_Errors
);
12411 -- Check that each component present is fully initialized
12413 Comp_Elmt
:= First_Elmt
(Components
);
12414 while Present
(Comp_Elmt
) loop
12415 Comp_Id
:= Node
(Comp_Elmt
);
12417 if Ekind
(Comp_Id
) = E_Component
12418 and then (No
(Parent
(Comp_Id
))
12419 or else No
(Expression
(Parent
(Comp_Id
))))
12420 and then not Is_Fully_Initialized_Type
(Etype
(Comp_Id
))
12425 Next_Elmt
(Comp_Elmt
);
12430 elsif Is_Private_Type
(Typ
) then
12432 U
: constant Entity_Id
:= Underlying_Type
(Typ
);
12438 return Is_Fully_Initialized_Variant
(U
);
12445 end Is_Fully_Initialized_Variant
;
12447 ------------------------------------
12448 -- Is_Generic_Declaration_Or_Body --
12449 ------------------------------------
12451 function Is_Generic_Declaration_Or_Body
(Decl
: Node_Id
) return Boolean is
12452 Spec_Decl
: Node_Id
;
12455 -- Package/subprogram body
12457 if Nkind_In
(Decl
, N_Package_Body
, N_Subprogram_Body
)
12458 and then Present
(Corresponding_Spec
(Decl
))
12460 Spec_Decl
:= Unit_Declaration_Node
(Corresponding_Spec
(Decl
));
12462 -- Package/subprogram body stub
12464 elsif Nkind_In
(Decl
, N_Package_Body_Stub
, N_Subprogram_Body_Stub
)
12465 and then Present
(Corresponding_Spec_Of_Stub
(Decl
))
12468 Unit_Declaration_Node
(Corresponding_Spec_Of_Stub
(Decl
));
12476 -- Rather than inspecting the defining entity of the spec declaration,
12477 -- look at its Nkind. This takes care of the case where the analysis of
12478 -- a generic body modifies the Ekind of its spec to allow for recursive
12482 Nkind_In
(Spec_Decl
, N_Generic_Package_Declaration
,
12483 N_Generic_Subprogram_Declaration
);
12484 end Is_Generic_Declaration_Or_Body
;
12486 ----------------------------
12487 -- Is_Inherited_Operation --
12488 ----------------------------
12490 function Is_Inherited_Operation
(E
: Entity_Id
) return Boolean is
12491 pragma Assert
(Is_Overloadable
(E
));
12492 Kind
: constant Node_Kind
:= Nkind
(Parent
(E
));
12494 return Kind
= N_Full_Type_Declaration
12495 or else Kind
= N_Private_Extension_Declaration
12496 or else Kind
= N_Subtype_Declaration
12497 or else (Ekind
(E
) = E_Enumeration_Literal
12498 and then Is_Derived_Type
(Etype
(E
)));
12499 end Is_Inherited_Operation
;
12501 -------------------------------------
12502 -- Is_Inherited_Operation_For_Type --
12503 -------------------------------------
12505 function Is_Inherited_Operation_For_Type
12507 Typ
: Entity_Id
) return Boolean
12510 -- Check that the operation has been created by the type declaration
12512 return Is_Inherited_Operation
(E
)
12513 and then Defining_Identifier
(Parent
(E
)) = Typ
;
12514 end Is_Inherited_Operation_For_Type
;
12520 function Is_Iterator
(Typ
: Entity_Id
) return Boolean is
12521 function Denotes_Iterator
(Iter_Typ
: Entity_Id
) return Boolean;
12522 -- Determine whether type Iter_Typ is a predefined forward or reversible
12525 ----------------------
12526 -- Denotes_Iterator --
12527 ----------------------
12529 function Denotes_Iterator
(Iter_Typ
: Entity_Id
) return Boolean is
12532 Nam_In
(Chars
(Iter_Typ
), Name_Forward_Iterator
,
12533 Name_Reversible_Iterator
)
12534 and then Is_Predefined_File_Name
12535 (Unit_File_Name
(Get_Source_Unit
(Iter_Typ
)));
12536 end Denotes_Iterator
;
12540 Iface_Elmt
: Elmt_Id
;
12543 -- Start of processing for Is_Iterator
12546 -- The type may be a subtype of a descendant of the proper instance of
12547 -- the predefined interface type, so we must use the root type of the
12548 -- given type. The same is done for Is_Reversible_Iterator.
12550 if Is_Class_Wide_Type
(Typ
)
12551 and then Denotes_Iterator
(Root_Type
(Typ
))
12555 elsif not Is_Tagged_Type
(Typ
) or else not Is_Derived_Type
(Typ
) then
12558 elsif Present
(Find_Value_Of_Aspect
(Typ
, Aspect_Iterable
)) then
12562 Collect_Interfaces
(Typ
, Ifaces
);
12564 Iface_Elmt
:= First_Elmt
(Ifaces
);
12565 while Present
(Iface_Elmt
) loop
12566 if Denotes_Iterator
(Node
(Iface_Elmt
)) then
12570 Next_Elmt
(Iface_Elmt
);
12577 ----------------------------
12578 -- Is_Iterator_Over_Array --
12579 ----------------------------
12581 function Is_Iterator_Over_Array
(N
: Node_Id
) return Boolean is
12582 Container
: constant Node_Id
:= Name
(N
);
12583 Container_Typ
: constant Entity_Id
:= Base_Type
(Etype
(Container
));
12585 return Is_Array_Type
(Container_Typ
);
12586 end Is_Iterator_Over_Array
;
12592 -- We seem to have a lot of overlapping functions that do similar things
12593 -- (testing for left hand sides or lvalues???).
12595 function Is_LHS
(N
: Node_Id
) return Is_LHS_Result
is
12596 P
: constant Node_Id
:= Parent
(N
);
12599 -- Return True if we are the left hand side of an assignment statement
12601 if Nkind
(P
) = N_Assignment_Statement
then
12602 if Name
(P
) = N
then
12608 -- Case of prefix of indexed or selected component or slice
12610 elsif Nkind_In
(P
, N_Indexed_Component
, N_Selected_Component
, N_Slice
)
12611 and then N
= Prefix
(P
)
12613 -- Here we have the case where the parent P is N.Q or N(Q .. R).
12614 -- If P is an LHS, then N is also effectively an LHS, but there
12615 -- is an important exception. If N is of an access type, then
12616 -- what we really have is N.all.Q (or N.all(Q .. R)). In either
12617 -- case this makes N.all a left hand side but not N itself.
12619 -- If we don't know the type yet, this is the case where we return
12620 -- Unknown, since the answer depends on the type which is unknown.
12622 if No
(Etype
(N
)) then
12625 -- We have an Etype set, so we can check it
12627 elsif Is_Access_Type
(Etype
(N
)) then
12630 -- OK, not access type case, so just test whole expression
12636 -- All other cases are not left hand sides
12643 -----------------------------
12644 -- Is_Library_Level_Entity --
12645 -----------------------------
12647 function Is_Library_Level_Entity
(E
: Entity_Id
) return Boolean is
12649 -- The following is a small optimization, and it also properly handles
12650 -- discriminals, which in task bodies might appear in expressions before
12651 -- the corresponding procedure has been created, and which therefore do
12652 -- not have an assigned scope.
12654 if Is_Formal
(E
) then
12658 -- Normal test is simply that the enclosing dynamic scope is Standard
12660 return Enclosing_Dynamic_Scope
(E
) = Standard_Standard
;
12661 end Is_Library_Level_Entity
;
12663 --------------------------------
12664 -- Is_Limited_Class_Wide_Type --
12665 --------------------------------
12667 function Is_Limited_Class_Wide_Type
(Typ
: Entity_Id
) return Boolean is
12670 Is_Class_Wide_Type
(Typ
)
12671 and then (Is_Limited_Type
(Typ
) or else From_Limited_With
(Typ
));
12672 end Is_Limited_Class_Wide_Type
;
12674 ---------------------------------
12675 -- Is_Local_Variable_Reference --
12676 ---------------------------------
12678 function Is_Local_Variable_Reference
(Expr
: Node_Id
) return Boolean is
12680 if not Is_Entity_Name
(Expr
) then
12685 Ent
: constant Entity_Id
:= Entity
(Expr
);
12686 Sub
: constant Entity_Id
:= Enclosing_Subprogram
(Ent
);
12688 if not Ekind_In
(Ent
, E_Variable
, E_In_Out_Parameter
) then
12691 return Present
(Sub
) and then Sub
= Current_Subprogram
;
12695 end Is_Local_Variable_Reference
;
12697 -----------------------------------------------
12698 -- Is_Nontrivial_Default_Init_Cond_Procedure --
12699 -----------------------------------------------
12701 function Is_Nontrivial_Default_Init_Cond_Procedure
12702 (Id
: Entity_Id
) return Boolean
12704 Body_Decl
: Node_Id
;
12708 if Ekind
(Id
) = E_Procedure
12709 and then Is_Default_Init_Cond_Procedure
(Id
)
12712 Unit_Declaration_Node
12713 (Corresponding_Body
(Unit_Declaration_Node
(Id
)));
12715 -- The body of the Default_Initial_Condition procedure must contain
12716 -- at least one statement, otherwise the generation of the subprogram
12719 pragma Assert
(Present
(Handled_Statement_Sequence
(Body_Decl
)));
12721 -- To qualify as nontrivial, the first statement of the procedure
12722 -- must be a check in the form of an if statement. If the original
12723 -- Default_Initial_Condition expression was folded, then the first
12724 -- statement is not a check.
12726 Stmt
:= First
(Statements
(Handled_Statement_Sequence
(Body_Decl
)));
12729 Nkind
(Stmt
) = N_If_Statement
12730 and then Nkind
(Original_Node
(Stmt
)) = N_Pragma
;
12734 end Is_Nontrivial_Default_Init_Cond_Procedure
;
12736 -------------------------
12737 -- Is_Object_Reference --
12738 -------------------------
12740 function Is_Object_Reference
(N
: Node_Id
) return Boolean is
12741 function Is_Internally_Generated_Renaming
(N
: Node_Id
) return Boolean;
12742 -- Determine whether N is the name of an internally-generated renaming
12744 --------------------------------------
12745 -- Is_Internally_Generated_Renaming --
12746 --------------------------------------
12748 function Is_Internally_Generated_Renaming
(N
: Node_Id
) return Boolean is
12753 while Present
(P
) loop
12754 if Nkind
(P
) = N_Object_Renaming_Declaration
then
12755 return not Comes_From_Source
(P
);
12756 elsif Is_List_Member
(P
) then
12764 end Is_Internally_Generated_Renaming
;
12766 -- Start of processing for Is_Object_Reference
12769 if Is_Entity_Name
(N
) then
12770 return Present
(Entity
(N
)) and then Is_Object
(Entity
(N
));
12774 when N_Indexed_Component | N_Slice
=>
12776 Is_Object_Reference
(Prefix
(N
))
12777 or else Is_Access_Type
(Etype
(Prefix
(N
)));
12779 -- In Ada 95, a function call is a constant object; a procedure
12782 when N_Function_Call
=>
12783 return Etype
(N
) /= Standard_Void_Type
;
12785 -- Attributes 'Input, 'Loop_Entry, 'Old and 'Result produce
12788 when N_Attribute_Reference
=>
12790 Nam_In
(Attribute_Name
(N
), Name_Input
,
12795 when N_Selected_Component
=>
12797 Is_Object_Reference
(Selector_Name
(N
))
12799 (Is_Object_Reference
(Prefix
(N
))
12800 or else Is_Access_Type
(Etype
(Prefix
(N
))));
12802 when N_Explicit_Dereference
=>
12805 -- A view conversion of a tagged object is an object reference
12807 when N_Type_Conversion
=>
12808 return Is_Tagged_Type
(Etype
(Subtype_Mark
(N
)))
12809 and then Is_Tagged_Type
(Etype
(Expression
(N
)))
12810 and then Is_Object_Reference
(Expression
(N
));
12812 -- An unchecked type conversion is considered to be an object if
12813 -- the operand is an object (this construction arises only as a
12814 -- result of expansion activities).
12816 when N_Unchecked_Type_Conversion
=>
12819 -- Allow string literals to act as objects as long as they appear
12820 -- in internally-generated renamings. The expansion of iterators
12821 -- may generate such renamings when the range involves a string
12824 when N_String_Literal
=>
12825 return Is_Internally_Generated_Renaming
(Parent
(N
));
12827 -- AI05-0003: In Ada 2012 a qualified expression is a name.
12828 -- This allows disambiguation of function calls and the use
12829 -- of aggregates in more contexts.
12831 when N_Qualified_Expression
=>
12832 if Ada_Version
< Ada_2012
then
12835 return Is_Object_Reference
(Expression
(N
))
12836 or else Nkind
(Expression
(N
)) = N_Aggregate
;
12843 end Is_Object_Reference
;
12845 -----------------------------------
12846 -- Is_OK_Variable_For_Out_Formal --
12847 -----------------------------------
12849 function Is_OK_Variable_For_Out_Formal
(AV
: Node_Id
) return Boolean is
12851 Note_Possible_Modification
(AV
, Sure
=> True);
12853 -- We must reject parenthesized variable names. Comes_From_Source is
12854 -- checked because there are currently cases where the compiler violates
12855 -- this rule (e.g. passing a task object to its controlled Initialize
12856 -- routine). This should be properly documented in sinfo???
12858 if Paren_Count
(AV
) > 0 and then Comes_From_Source
(AV
) then
12861 -- A variable is always allowed
12863 elsif Is_Variable
(AV
) then
12866 -- Generalized indexing operations are rewritten as explicit
12867 -- dereferences, and it is only during resolution that we can
12868 -- check whether the context requires an access_to_variable type.
12870 elsif Nkind
(AV
) = N_Explicit_Dereference
12871 and then Ada_Version
>= Ada_2012
12872 and then Nkind
(Original_Node
(AV
)) = N_Indexed_Component
12873 and then Present
(Etype
(Original_Node
(AV
)))
12874 and then Has_Implicit_Dereference
(Etype
(Original_Node
(AV
)))
12876 return not Is_Access_Constant
(Etype
(Prefix
(AV
)));
12878 -- Unchecked conversions are allowed only if they come from the
12879 -- generated code, which sometimes uses unchecked conversions for out
12880 -- parameters in cases where code generation is unaffected. We tell
12881 -- source unchecked conversions by seeing if they are rewrites of
12882 -- an original Unchecked_Conversion function call, or of an explicit
12883 -- conversion of a function call or an aggregate (as may happen in the
12884 -- expansion of a packed array aggregate).
12886 elsif Nkind
(AV
) = N_Unchecked_Type_Conversion
then
12887 if Nkind_In
(Original_Node
(AV
), N_Function_Call
, N_Aggregate
) then
12890 elsif Comes_From_Source
(AV
)
12891 and then Nkind
(Original_Node
(Expression
(AV
))) = N_Function_Call
12895 elsif Nkind
(Original_Node
(AV
)) = N_Type_Conversion
then
12896 return Is_OK_Variable_For_Out_Formal
(Expression
(AV
));
12902 -- Normal type conversions are allowed if argument is a variable
12904 elsif Nkind
(AV
) = N_Type_Conversion
then
12905 if Is_Variable
(Expression
(AV
))
12906 and then Paren_Count
(Expression
(AV
)) = 0
12908 Note_Possible_Modification
(Expression
(AV
), Sure
=> True);
12911 -- We also allow a non-parenthesized expression that raises
12912 -- constraint error if it rewrites what used to be a variable
12914 elsif Raises_Constraint_Error
(Expression
(AV
))
12915 and then Paren_Count
(Expression
(AV
)) = 0
12916 and then Is_Variable
(Original_Node
(Expression
(AV
)))
12920 -- Type conversion of something other than a variable
12926 -- If this node is rewritten, then test the original form, if that is
12927 -- OK, then we consider the rewritten node OK (for example, if the
12928 -- original node is a conversion, then Is_Variable will not be true
12929 -- but we still want to allow the conversion if it converts a variable).
12931 elsif Original_Node
(AV
) /= AV
then
12933 -- In Ada 2012, the explicit dereference may be a rewritten call to a
12934 -- Reference function.
12936 if Ada_Version
>= Ada_2012
12937 and then Nkind
(Original_Node
(AV
)) = N_Function_Call
12939 Has_Implicit_Dereference
(Etype
(Name
(Original_Node
(AV
))))
12942 -- Check that this is not a constant reference.
12944 return not Is_Access_Constant
(Etype
(Prefix
(AV
)));
12946 elsif Has_Implicit_Dereference
(Etype
(Original_Node
(AV
))) then
12948 not Is_Access_Constant
(Etype
12949 (Get_Reference_Discriminant
(Etype
(Original_Node
(AV
)))));
12952 return Is_OK_Variable_For_Out_Formal
(Original_Node
(AV
));
12955 -- All other non-variables are rejected
12960 end Is_OK_Variable_For_Out_Formal
;
12962 ------------------------------------
12963 -- Is_Package_Contract_Annotation --
12964 ------------------------------------
12966 function Is_Package_Contract_Annotation
(Item
: Node_Id
) return Boolean is
12970 if Nkind
(Item
) = N_Aspect_Specification
then
12971 Nam
:= Chars
(Identifier
(Item
));
12973 else pragma Assert
(Nkind
(Item
) = N_Pragma
);
12974 Nam
:= Pragma_Name
(Item
);
12977 return Nam
= Name_Abstract_State
12978 or else Nam
= Name_Initial_Condition
12979 or else Nam
= Name_Initializes
12980 or else Nam
= Name_Refined_State
;
12981 end Is_Package_Contract_Annotation
;
12983 -----------------------------------
12984 -- Is_Partially_Initialized_Type --
12985 -----------------------------------
12987 function Is_Partially_Initialized_Type
12989 Include_Implicit
: Boolean := True) return Boolean
12992 if Is_Scalar_Type
(Typ
) then
12995 elsif Is_Access_Type
(Typ
) then
12996 return Include_Implicit
;
12998 elsif Is_Array_Type
(Typ
) then
13000 -- If component type is partially initialized, so is array type
13002 if Is_Partially_Initialized_Type
13003 (Component_Type
(Typ
), Include_Implicit
)
13007 -- Otherwise we are only partially initialized if we are fully
13008 -- initialized (this is the empty array case, no point in us
13009 -- duplicating that code here).
13012 return Is_Fully_Initialized_Type
(Typ
);
13015 elsif Is_Record_Type
(Typ
) then
13017 -- A discriminated type is always partially initialized if in
13020 if Has_Discriminants
(Typ
) and then Include_Implicit
then
13023 -- A tagged type is always partially initialized
13025 elsif Is_Tagged_Type
(Typ
) then
13028 -- Case of non-discriminated record
13034 Component_Present
: Boolean := False;
13035 -- Set True if at least one component is present. If no
13036 -- components are present, then record type is fully
13037 -- initialized (another odd case, like the null array).
13040 -- Loop through components
13042 Ent
:= First_Entity
(Typ
);
13043 while Present
(Ent
) loop
13044 if Ekind
(Ent
) = E_Component
then
13045 Component_Present
:= True;
13047 -- If a component has an initialization expression then
13048 -- the enclosing record type is partially initialized
13050 if Present
(Parent
(Ent
))
13051 and then Present
(Expression
(Parent
(Ent
)))
13055 -- If a component is of a type which is itself partially
13056 -- initialized, then the enclosing record type is also.
13058 elsif Is_Partially_Initialized_Type
13059 (Etype
(Ent
), Include_Implicit
)
13068 -- No initialized components found. If we found any components
13069 -- they were all uninitialized so the result is false.
13071 if Component_Present
then
13074 -- But if we found no components, then all the components are
13075 -- initialized so we consider the type to be initialized.
13083 -- Concurrent types are always fully initialized
13085 elsif Is_Concurrent_Type
(Typ
) then
13088 -- For a private type, go to underlying type. If there is no underlying
13089 -- type then just assume this partially initialized. Not clear if this
13090 -- can happen in a non-error case, but no harm in testing for this.
13092 elsif Is_Private_Type
(Typ
) then
13094 U
: constant Entity_Id
:= Underlying_Type
(Typ
);
13099 return Is_Partially_Initialized_Type
(U
, Include_Implicit
);
13103 -- For any other type (are there any?) assume partially initialized
13108 end Is_Partially_Initialized_Type
;
13110 ------------------------------------
13111 -- Is_Potentially_Persistent_Type --
13112 ------------------------------------
13114 function Is_Potentially_Persistent_Type
(T
: Entity_Id
) return Boolean is
13119 -- For private type, test corresponding full type
13121 if Is_Private_Type
(T
) then
13122 return Is_Potentially_Persistent_Type
(Full_View
(T
));
13124 -- Scalar types are potentially persistent
13126 elsif Is_Scalar_Type
(T
) then
13129 -- Record type is potentially persistent if not tagged and the types of
13130 -- all it components are potentially persistent, and no component has
13131 -- an initialization expression.
13133 elsif Is_Record_Type
(T
)
13134 and then not Is_Tagged_Type
(T
)
13135 and then not Is_Partially_Initialized_Type
(T
)
13137 Comp
:= First_Component
(T
);
13138 while Present
(Comp
) loop
13139 if not Is_Potentially_Persistent_Type
(Etype
(Comp
)) then
13142 Next_Entity
(Comp
);
13148 -- Array type is potentially persistent if its component type is
13149 -- potentially persistent and if all its constraints are static.
13151 elsif Is_Array_Type
(T
) then
13152 if not Is_Potentially_Persistent_Type
(Component_Type
(T
)) then
13156 Indx
:= First_Index
(T
);
13157 while Present
(Indx
) loop
13158 if not Is_OK_Static_Subtype
(Etype
(Indx
)) then
13167 -- All other types are not potentially persistent
13172 end Is_Potentially_Persistent_Type
;
13174 --------------------------------
13175 -- Is_Potentially_Unevaluated --
13176 --------------------------------
13178 function Is_Potentially_Unevaluated
(N
: Node_Id
) return Boolean is
13186 -- A postcondition whose expression is a short-circuit is broken down
13187 -- into individual aspects for better exception reporting. The original
13188 -- short-circuit expression is rewritten as the second operand, and an
13189 -- occurrence of 'Old in that operand is potentially unevaluated.
13190 -- See Sem_ch13.adb for details of this transformation.
13192 if Nkind
(Original_Node
(Par
)) = N_And_Then
then
13196 while not Nkind_In
(Par
, N_If_Expression
,
13204 Par
:= Parent
(Par
);
13206 -- If the context is not an expression, or if is the result of
13207 -- expansion of an enclosing construct (such as another attribute)
13208 -- the predicate does not apply.
13210 if Nkind
(Par
) not in N_Subexpr
13211 or else not Comes_From_Source
(Par
)
13217 if Nkind
(Par
) = N_If_Expression
then
13218 return Is_Elsif
(Par
) or else Expr
/= First
(Expressions
(Par
));
13220 elsif Nkind
(Par
) = N_Case_Expression
then
13221 return Expr
/= Expression
(Par
);
13223 elsif Nkind_In
(Par
, N_And_Then
, N_Or_Else
) then
13224 return Expr
= Right_Opnd
(Par
);
13226 elsif Nkind_In
(Par
, N_In
, N_Not_In
) then
13227 return Expr
/= Left_Opnd
(Par
);
13232 end Is_Potentially_Unevaluated
;
13234 ---------------------------------
13235 -- Is_Protected_Self_Reference --
13236 ---------------------------------
13238 function Is_Protected_Self_Reference
(N
: Node_Id
) return Boolean is
13240 function In_Access_Definition
(N
: Node_Id
) return Boolean;
13241 -- Returns true if N belongs to an access definition
13243 --------------------------
13244 -- In_Access_Definition --
13245 --------------------------
13247 function In_Access_Definition
(N
: Node_Id
) return Boolean is
13252 while Present
(P
) loop
13253 if Nkind
(P
) = N_Access_Definition
then
13261 end In_Access_Definition
;
13263 -- Start of processing for Is_Protected_Self_Reference
13266 -- Verify that prefix is analyzed and has the proper form. Note that
13267 -- the attributes Elab_Spec, Elab_Body and Elab_Subp_Body which also
13268 -- produce the address of an entity, do not analyze their prefix
13269 -- because they denote entities that are not necessarily visible.
13270 -- Neither of them can apply to a protected type.
13272 return Ada_Version
>= Ada_2005
13273 and then Is_Entity_Name
(N
)
13274 and then Present
(Entity
(N
))
13275 and then Is_Protected_Type
(Entity
(N
))
13276 and then In_Open_Scopes
(Entity
(N
))
13277 and then not In_Access_Definition
(N
);
13278 end Is_Protected_Self_Reference
;
13280 -----------------------------
13281 -- Is_RCI_Pkg_Spec_Or_Body --
13282 -----------------------------
13284 function Is_RCI_Pkg_Spec_Or_Body
(Cunit
: Node_Id
) return Boolean is
13286 function Is_RCI_Pkg_Decl_Cunit
(Cunit
: Node_Id
) return Boolean;
13287 -- Return True if the unit of Cunit is an RCI package declaration
13289 ---------------------------
13290 -- Is_RCI_Pkg_Decl_Cunit --
13291 ---------------------------
13293 function Is_RCI_Pkg_Decl_Cunit
(Cunit
: Node_Id
) return Boolean is
13294 The_Unit
: constant Node_Id
:= Unit
(Cunit
);
13297 if Nkind
(The_Unit
) /= N_Package_Declaration
then
13301 return Is_Remote_Call_Interface
(Defining_Entity
(The_Unit
));
13302 end Is_RCI_Pkg_Decl_Cunit
;
13304 -- Start of processing for Is_RCI_Pkg_Spec_Or_Body
13307 return Is_RCI_Pkg_Decl_Cunit
(Cunit
)
13309 (Nkind
(Unit
(Cunit
)) = N_Package_Body
13310 and then Is_RCI_Pkg_Decl_Cunit
(Library_Unit
(Cunit
)));
13311 end Is_RCI_Pkg_Spec_Or_Body
;
13313 -----------------------------------------
13314 -- Is_Remote_Access_To_Class_Wide_Type --
13315 -----------------------------------------
13317 function Is_Remote_Access_To_Class_Wide_Type
13318 (E
: Entity_Id
) return Boolean
13321 -- A remote access to class-wide type is a general access to object type
13322 -- declared in the visible part of a Remote_Types or Remote_Call_
13325 return Ekind
(E
) = E_General_Access_Type
13326 and then (Is_Remote_Call_Interface
(E
) or else Is_Remote_Types
(E
));
13327 end Is_Remote_Access_To_Class_Wide_Type
;
13329 -----------------------------------------
13330 -- Is_Remote_Access_To_Subprogram_Type --
13331 -----------------------------------------
13333 function Is_Remote_Access_To_Subprogram_Type
13334 (E
: Entity_Id
) return Boolean
13337 return (Ekind
(E
) = E_Access_Subprogram_Type
13338 or else (Ekind
(E
) = E_Record_Type
13339 and then Present
(Corresponding_Remote_Type
(E
))))
13340 and then (Is_Remote_Call_Interface
(E
) or else Is_Remote_Types
(E
));
13341 end Is_Remote_Access_To_Subprogram_Type
;
13343 --------------------
13344 -- Is_Remote_Call --
13345 --------------------
13347 function Is_Remote_Call
(N
: Node_Id
) return Boolean is
13349 if Nkind
(N
) not in N_Subprogram_Call
then
13351 -- An entry call cannot be remote
13355 elsif Nkind
(Name
(N
)) in N_Has_Entity
13356 and then Is_Remote_Call_Interface
(Entity
(Name
(N
)))
13358 -- A subprogram declared in the spec of a RCI package is remote
13362 elsif Nkind
(Name
(N
)) = N_Explicit_Dereference
13363 and then Is_Remote_Access_To_Subprogram_Type
13364 (Etype
(Prefix
(Name
(N
))))
13366 -- The dereference of a RAS is a remote call
13370 elsif Present
(Controlling_Argument
(N
))
13371 and then Is_Remote_Access_To_Class_Wide_Type
13372 (Etype
(Controlling_Argument
(N
)))
13374 -- Any primitive operation call with a controlling argument of
13375 -- a RACW type is a remote call.
13380 -- All other calls are local calls
13383 end Is_Remote_Call
;
13385 ----------------------
13386 -- Is_Renamed_Entry --
13387 ----------------------
13389 function Is_Renamed_Entry
(Proc_Nam
: Entity_Id
) return Boolean is
13390 Orig_Node
: Node_Id
:= Empty
;
13391 Subp_Decl
: Node_Id
:= Parent
(Parent
(Proc_Nam
));
13393 function Is_Entry
(Nam
: Node_Id
) return Boolean;
13394 -- Determine whether Nam is an entry. Traverse selectors if there are
13395 -- nested selected components.
13401 function Is_Entry
(Nam
: Node_Id
) return Boolean is
13403 if Nkind
(Nam
) = N_Selected_Component
then
13404 return Is_Entry
(Selector_Name
(Nam
));
13407 return Ekind
(Entity
(Nam
)) = E_Entry
;
13410 -- Start of processing for Is_Renamed_Entry
13413 if Present
(Alias
(Proc_Nam
)) then
13414 Subp_Decl
:= Parent
(Parent
(Alias
(Proc_Nam
)));
13417 -- Look for a rewritten subprogram renaming declaration
13419 if Nkind
(Subp_Decl
) = N_Subprogram_Declaration
13420 and then Present
(Original_Node
(Subp_Decl
))
13422 Orig_Node
:= Original_Node
(Subp_Decl
);
13425 -- The rewritten subprogram is actually an entry
13427 if Present
(Orig_Node
)
13428 and then Nkind
(Orig_Node
) = N_Subprogram_Renaming_Declaration
13429 and then Is_Entry
(Name
(Orig_Node
))
13435 end Is_Renamed_Entry
;
13437 -----------------------------
13438 -- Is_Renaming_Declaration --
13439 -----------------------------
13441 function Is_Renaming_Declaration
(N
: Node_Id
) return Boolean is
13444 when N_Exception_Renaming_Declaration |
13445 N_Generic_Function_Renaming_Declaration |
13446 N_Generic_Package_Renaming_Declaration |
13447 N_Generic_Procedure_Renaming_Declaration |
13448 N_Object_Renaming_Declaration |
13449 N_Package_Renaming_Declaration |
13450 N_Subprogram_Renaming_Declaration
=>
13456 end Is_Renaming_Declaration
;
13458 ----------------------------
13459 -- Is_Reversible_Iterator --
13460 ----------------------------
13462 function Is_Reversible_Iterator
(Typ
: Entity_Id
) return Boolean is
13463 Ifaces_List
: Elist_Id
;
13464 Iface_Elmt
: Elmt_Id
;
13468 if Is_Class_Wide_Type
(Typ
)
13469 and then Chars
(Root_Type
(Typ
)) = Name_Reversible_Iterator
13470 and then Is_Predefined_File_Name
13471 (Unit_File_Name
(Get_Source_Unit
(Root_Type
(Typ
))))
13475 elsif not Is_Tagged_Type
(Typ
) or else not Is_Derived_Type
(Typ
) then
13479 Collect_Interfaces
(Typ
, Ifaces_List
);
13481 Iface_Elmt
:= First_Elmt
(Ifaces_List
);
13482 while Present
(Iface_Elmt
) loop
13483 Iface
:= Node
(Iface_Elmt
);
13484 if Chars
(Iface
) = Name_Reversible_Iterator
13486 Is_Predefined_File_Name
13487 (Unit_File_Name
(Get_Source_Unit
(Iface
)))
13492 Next_Elmt
(Iface_Elmt
);
13497 end Is_Reversible_Iterator
;
13499 ----------------------
13500 -- Is_Selector_Name --
13501 ----------------------
13503 function Is_Selector_Name
(N
: Node_Id
) return Boolean is
13505 if not Is_List_Member
(N
) then
13507 P
: constant Node_Id
:= Parent
(N
);
13509 return Nkind_In
(P
, N_Expanded_Name
,
13510 N_Generic_Association
,
13511 N_Parameter_Association
,
13512 N_Selected_Component
)
13513 and then Selector_Name
(P
) = N
;
13518 L
: constant List_Id
:= List_Containing
(N
);
13519 P
: constant Node_Id
:= Parent
(L
);
13521 return (Nkind
(P
) = N_Discriminant_Association
13522 and then Selector_Names
(P
) = L
)
13524 (Nkind
(P
) = N_Component_Association
13525 and then Choices
(P
) = L
);
13528 end Is_Selector_Name
;
13530 ---------------------------------
13531 -- Is_Single_Concurrent_Object --
13532 ---------------------------------
13534 function Is_Single_Concurrent_Object
(Id
: Entity_Id
) return Boolean is
13537 Is_Single_Protected_Object
(Id
) or else Is_Single_Task_Object
(Id
);
13538 end Is_Single_Concurrent_Object
;
13540 -------------------------------
13541 -- Is_Single_Concurrent_Type --
13542 -------------------------------
13544 function Is_Single_Concurrent_Type
(Id
: Entity_Id
) return Boolean is
13547 Ekind_In
(Id
, E_Protected_Type
, E_Task_Type
)
13548 and then Is_Single_Concurrent_Type_Declaration
13549 (Declaration_Node
(Id
));
13550 end Is_Single_Concurrent_Type
;
13552 -------------------------------------------
13553 -- Is_Single_Concurrent_Type_Declaration --
13554 -------------------------------------------
13556 function Is_Single_Concurrent_Type_Declaration
13557 (N
: Node_Id
) return Boolean
13560 return Nkind_In
(Original_Node
(N
), N_Single_Protected_Declaration
,
13561 N_Single_Task_Declaration
);
13562 end Is_Single_Concurrent_Type_Declaration
;
13564 ---------------------------------------------
13565 -- Is_Single_Precision_Floating_Point_Type --
13566 ---------------------------------------------
13568 function Is_Single_Precision_Floating_Point_Type
13569 (E
: Entity_Id
) return Boolean is
13571 return Is_Floating_Point_Type
(E
)
13572 and then Machine_Radix_Value
(E
) = Uint_2
13573 and then Machine_Mantissa_Value
(E
) = Uint_24
13574 and then Machine_Emax_Value
(E
) = Uint_2
** Uint_7
13575 and then Machine_Emin_Value
(E
) = Uint_3
- (Uint_2
** Uint_7
);
13576 end Is_Single_Precision_Floating_Point_Type
;
13578 --------------------------------
13579 -- Is_Single_Protected_Object --
13580 --------------------------------
13582 function Is_Single_Protected_Object
(Id
: Entity_Id
) return Boolean is
13585 Ekind
(Id
) = E_Variable
13586 and then Ekind
(Etype
(Id
)) = E_Protected_Type
13587 and then Is_Single_Concurrent_Type
(Etype
(Id
));
13588 end Is_Single_Protected_Object
;
13590 ---------------------------
13591 -- Is_Single_Task_Object --
13592 ---------------------------
13594 function Is_Single_Task_Object
(Id
: Entity_Id
) return Boolean is
13597 Ekind
(Id
) = E_Variable
13598 and then Ekind
(Etype
(Id
)) = E_Task_Type
13599 and then Is_Single_Concurrent_Type
(Etype
(Id
));
13600 end Is_Single_Task_Object
;
13602 -------------------------------------
13603 -- Is_SPARK_05_Initialization_Expr --
13604 -------------------------------------
13606 function Is_SPARK_05_Initialization_Expr
(N
: Node_Id
) return Boolean is
13609 Comp_Assn
: Node_Id
;
13610 Orig_N
: constant Node_Id
:= Original_Node
(N
);
13615 if not Comes_From_Source
(Orig_N
) then
13619 pragma Assert
(Nkind
(Orig_N
) in N_Subexpr
);
13621 case Nkind
(Orig_N
) is
13622 when N_Character_Literal |
13623 N_Integer_Literal |
13625 N_String_Literal
=>
13628 when N_Identifier |
13630 if Is_Entity_Name
(Orig_N
)
13631 and then Present
(Entity
(Orig_N
)) -- needed in some cases
13633 case Ekind
(Entity
(Orig_N
)) is
13635 E_Enumeration_Literal |
13640 if Is_Type
(Entity
(Orig_N
)) then
13648 when N_Qualified_Expression |
13649 N_Type_Conversion
=>
13650 Is_Ok
:= Is_SPARK_05_Initialization_Expr
(Expression
(Orig_N
));
13653 Is_Ok
:= Is_SPARK_05_Initialization_Expr
(Right_Opnd
(Orig_N
));
13657 N_Membership_Test
=>
13658 Is_Ok
:= Is_SPARK_05_Initialization_Expr
(Left_Opnd
(Orig_N
))
13660 Is_SPARK_05_Initialization_Expr
(Right_Opnd
(Orig_N
));
13663 N_Extension_Aggregate
=>
13664 if Nkind
(Orig_N
) = N_Extension_Aggregate
then
13666 Is_SPARK_05_Initialization_Expr
(Ancestor_Part
(Orig_N
));
13669 Expr
:= First
(Expressions
(Orig_N
));
13670 while Present
(Expr
) loop
13671 if not Is_SPARK_05_Initialization_Expr
(Expr
) then
13679 Comp_Assn
:= First
(Component_Associations
(Orig_N
));
13680 while Present
(Comp_Assn
) loop
13681 Expr
:= Expression
(Comp_Assn
);
13683 -- Note: test for Present here needed for box assocation
13686 and then not Is_SPARK_05_Initialization_Expr
(Expr
)
13695 when N_Attribute_Reference
=>
13696 if Nkind
(Prefix
(Orig_N
)) in N_Subexpr
then
13697 Is_Ok
:= Is_SPARK_05_Initialization_Expr
(Prefix
(Orig_N
));
13700 Expr
:= First
(Expressions
(Orig_N
));
13701 while Present
(Expr
) loop
13702 if not Is_SPARK_05_Initialization_Expr
(Expr
) then
13710 -- Selected components might be expanded named not yet resolved, so
13711 -- default on the safe side. (Eg on sparklex.ads)
13713 when N_Selected_Component
=>
13722 end Is_SPARK_05_Initialization_Expr
;
13724 ----------------------------------
13725 -- Is_SPARK_05_Object_Reference --
13726 ----------------------------------
13728 function Is_SPARK_05_Object_Reference
(N
: Node_Id
) return Boolean is
13730 if Is_Entity_Name
(N
) then
13731 return Present
(Entity
(N
))
13733 (Ekind_In
(Entity
(N
), E_Constant
, E_Variable
)
13734 or else Ekind
(Entity
(N
)) in Formal_Kind
);
13738 when N_Selected_Component
=>
13739 return Is_SPARK_05_Object_Reference
(Prefix
(N
));
13745 end Is_SPARK_05_Object_Reference
;
13747 -----------------------------
13748 -- Is_Specific_Tagged_Type --
13749 -----------------------------
13751 function Is_Specific_Tagged_Type
(Typ
: Entity_Id
) return Boolean is
13752 Full_Typ
: Entity_Id
;
13755 -- Handle private types
13757 if Is_Private_Type
(Typ
) and then Present
(Full_View
(Typ
)) then
13758 Full_Typ
:= Full_View
(Typ
);
13763 -- A specific tagged type is a non-class-wide tagged type
13765 return Is_Tagged_Type
(Full_Typ
) and not Is_Class_Wide_Type
(Full_Typ
);
13766 end Is_Specific_Tagged_Type
;
13772 function Is_Statement
(N
: Node_Id
) return Boolean is
13775 Nkind
(N
) in N_Statement_Other_Than_Procedure_Call
13776 or else Nkind
(N
) = N_Procedure_Call_Statement
;
13779 ---------------------------------------
13780 -- Is_Subprogram_Contract_Annotation --
13781 ---------------------------------------
13783 function Is_Subprogram_Contract_Annotation
13784 (Item
: Node_Id
) return Boolean
13789 if Nkind
(Item
) = N_Aspect_Specification
then
13790 Nam
:= Chars
(Identifier
(Item
));
13792 else pragma Assert
(Nkind
(Item
) = N_Pragma
);
13793 Nam
:= Pragma_Name
(Item
);
13796 return Nam
= Name_Contract_Cases
13797 or else Nam
= Name_Depends
13798 or else Nam
= Name_Extensions_Visible
13799 or else Nam
= Name_Global
13800 or else Nam
= Name_Post
13801 or else Nam
= Name_Post_Class
13802 or else Nam
= Name_Postcondition
13803 or else Nam
= Name_Pre
13804 or else Nam
= Name_Pre_Class
13805 or else Nam
= Name_Precondition
13806 or else Nam
= Name_Refined_Depends
13807 or else Nam
= Name_Refined_Global
13808 or else Nam
= Name_Refined_Post
13809 or else Nam
= Name_Test_Case
;
13810 end Is_Subprogram_Contract_Annotation
;
13812 --------------------------------------------------
13813 -- Is_Subprogram_Stub_Without_Prior_Declaration --
13814 --------------------------------------------------
13816 function Is_Subprogram_Stub_Without_Prior_Declaration
13817 (N
: Node_Id
) return Boolean
13820 -- A subprogram stub without prior declaration serves as declaration for
13821 -- the actual subprogram body. As such, it has an attached defining
13822 -- entity of E_[Generic_]Function or E_[Generic_]Procedure.
13824 return Nkind
(N
) = N_Subprogram_Body_Stub
13825 and then Ekind
(Defining_Entity
(N
)) /= E_Subprogram_Body
;
13826 end Is_Subprogram_Stub_Without_Prior_Declaration
;
13828 --------------------------
13829 -- Is_Suspension_Object --
13830 --------------------------
13832 function Is_Suspension_Object
(Id
: Entity_Id
) return Boolean is
13834 -- This approach does an exact name match rather than to rely on
13835 -- RTSfind. Routine Is_Effectively_Volatile is used by clients of the
13836 -- front end at point where all auxiliary tables are locked and any
13837 -- modifications to them are treated as violations. Do not tamper with
13838 -- the tables, instead examine the Chars fields of all the scopes of Id.
13841 Chars
(Id
) = Name_Suspension_Object
13842 and then Present
(Scope
(Id
))
13843 and then Chars
(Scope
(Id
)) = Name_Synchronous_Task_Control
13844 and then Present
(Scope
(Scope
(Id
)))
13845 and then Chars
(Scope
(Scope
(Id
))) = Name_Ada
13846 and then Present
(Scope
(Scope
(Scope
(Id
))))
13847 and then Scope
(Scope
(Scope
(Id
))) = Standard_Standard
;
13848 end Is_Suspension_Object
;
13850 ----------------------------
13851 -- Is_Synchronized_Object --
13852 ----------------------------
13854 function Is_Synchronized_Object
(Id
: Entity_Id
) return Boolean is
13858 if Is_Object
(Id
) then
13860 -- The object is synchronized if it is of a type that yields a
13861 -- synchronized object.
13863 if Yields_Synchronized_Object
(Etype
(Id
)) then
13866 -- The object is synchronized if it is atomic and Async_Writers is
13869 elsif Is_Atomic
(Id
) and then Async_Writers_Enabled
(Id
) then
13872 -- A constant is a synchronized object by default
13874 elsif Ekind
(Id
) = E_Constant
then
13877 -- A variable is a synchronized object if it is subject to pragma
13878 -- Constant_After_Elaboration.
13880 elsif Ekind
(Id
) = E_Variable
then
13881 Prag
:= Get_Pragma
(Id
, Pragma_Constant_After_Elaboration
);
13883 return Present
(Prag
) and then Is_Enabled_Pragma
(Prag
);
13887 -- Otherwise the input is not an object or it does not qualify as a
13888 -- synchronized object.
13891 end Is_Synchronized_Object
;
13893 ---------------------------------
13894 -- Is_Synchronized_Tagged_Type --
13895 ---------------------------------
13897 function Is_Synchronized_Tagged_Type
(E
: Entity_Id
) return Boolean is
13898 Kind
: constant Entity_Kind
:= Ekind
(Base_Type
(E
));
13901 -- A task or protected type derived from an interface is a tagged type.
13902 -- Such a tagged type is called a synchronized tagged type, as are
13903 -- synchronized interfaces and private extensions whose declaration
13904 -- includes the reserved word synchronized.
13906 return (Is_Tagged_Type
(E
)
13907 and then (Kind
= E_Task_Type
13909 Kind
= E_Protected_Type
))
13912 and then Is_Synchronized_Interface
(E
))
13914 (Ekind
(E
) = E_Record_Type_With_Private
13915 and then Nkind
(Parent
(E
)) = N_Private_Extension_Declaration
13916 and then (Synchronized_Present
(Parent
(E
))
13917 or else Is_Synchronized_Interface
(Etype
(E
))));
13918 end Is_Synchronized_Tagged_Type
;
13924 function Is_Transfer
(N
: Node_Id
) return Boolean is
13925 Kind
: constant Node_Kind
:= Nkind
(N
);
13928 if Kind
= N_Simple_Return_Statement
13930 Kind
= N_Extended_Return_Statement
13932 Kind
= N_Goto_Statement
13934 Kind
= N_Raise_Statement
13936 Kind
= N_Requeue_Statement
13940 elsif (Kind
= N_Exit_Statement
or else Kind
in N_Raise_xxx_Error
)
13941 and then No
(Condition
(N
))
13945 elsif Kind
= N_Procedure_Call_Statement
13946 and then Is_Entity_Name
(Name
(N
))
13947 and then Present
(Entity
(Name
(N
)))
13948 and then No_Return
(Entity
(Name
(N
)))
13952 elsif Nkind
(Original_Node
(N
)) = N_Raise_Statement
then
13964 function Is_True
(U
: Uint
) return Boolean is
13969 --------------------------------------
13970 -- Is_Unchecked_Conversion_Instance --
13971 --------------------------------------
13973 function Is_Unchecked_Conversion_Instance
(Id
: Entity_Id
) return Boolean is
13974 Gen_Par
: Entity_Id
;
13977 -- Look for a function whose generic parent is the predefined intrinsic
13978 -- function Unchecked_Conversion.
13980 if Ekind
(Id
) = E_Function
then
13981 Gen_Par
:= Generic_Parent
(Parent
(Id
));
13985 and then Chars
(Gen_Par
) = Name_Unchecked_Conversion
13986 and then Is_Intrinsic_Subprogram
(Gen_Par
)
13987 and then Is_Predefined_File_Name
13988 (Unit_File_Name
(Get_Source_Unit
(Gen_Par
)));
13992 end Is_Unchecked_Conversion_Instance
;
13994 -------------------------------
13995 -- Is_Universal_Numeric_Type --
13996 -------------------------------
13998 function Is_Universal_Numeric_Type
(T
: Entity_Id
) return Boolean is
14000 return T
= Universal_Integer
or else T
= Universal_Real
;
14001 end Is_Universal_Numeric_Type
;
14003 ----------------------------
14004 -- Is_Variable_Size_Array --
14005 ----------------------------
14007 function Is_Variable_Size_Array
(E
: Entity_Id
) return Boolean is
14011 pragma Assert
(Is_Array_Type
(E
));
14013 -- Check if some index is initialized with a non-constant value
14015 Idx
:= First_Index
(E
);
14016 while Present
(Idx
) loop
14017 if Nkind
(Idx
) = N_Range
then
14018 if not Is_Constant_Bound
(Low_Bound
(Idx
))
14019 or else not Is_Constant_Bound
(High_Bound
(Idx
))
14025 Idx
:= Next_Index
(Idx
);
14029 end Is_Variable_Size_Array
;
14031 -----------------------------
14032 -- Is_Variable_Size_Record --
14033 -----------------------------
14035 function Is_Variable_Size_Record
(E
: Entity_Id
) return Boolean is
14037 Comp_Typ
: Entity_Id
;
14040 pragma Assert
(Is_Record_Type
(E
));
14042 Comp
:= First_Entity
(E
);
14043 while Present
(Comp
) loop
14044 Comp_Typ
:= Etype
(Comp
);
14046 -- Recursive call if the record type has discriminants
14048 if Is_Record_Type
(Comp_Typ
)
14049 and then Has_Discriminants
(Comp_Typ
)
14050 and then Is_Variable_Size_Record
(Comp_Typ
)
14054 elsif Is_Array_Type
(Comp_Typ
)
14055 and then Is_Variable_Size_Array
(Comp_Typ
)
14060 Next_Entity
(Comp
);
14064 end Is_Variable_Size_Record
;
14070 function Is_Variable
14072 Use_Original_Node
: Boolean := True) return Boolean
14074 Orig_Node
: Node_Id
;
14076 function In_Protected_Function
(E
: Entity_Id
) return Boolean;
14077 -- Within a protected function, the private components of the enclosing
14078 -- protected type are constants. A function nested within a (protected)
14079 -- procedure is not itself protected. Within the body of a protected
14080 -- function the current instance of the protected type is a constant.
14082 function Is_Variable_Prefix
(P
: Node_Id
) return Boolean;
14083 -- Prefixes can involve implicit dereferences, in which case we must
14084 -- test for the case of a reference of a constant access type, which can
14085 -- can never be a variable.
14087 ---------------------------
14088 -- In_Protected_Function --
14089 ---------------------------
14091 function In_Protected_Function
(E
: Entity_Id
) return Boolean is
14096 -- E is the current instance of a type
14098 if Is_Type
(E
) then
14107 if not Is_Protected_Type
(Prot
) then
14111 S
:= Current_Scope
;
14112 while Present
(S
) and then S
/= Prot
loop
14113 if Ekind
(S
) = E_Function
and then Scope
(S
) = Prot
then
14122 end In_Protected_Function
;
14124 ------------------------
14125 -- Is_Variable_Prefix --
14126 ------------------------
14128 function Is_Variable_Prefix
(P
: Node_Id
) return Boolean is
14130 if Is_Access_Type
(Etype
(P
)) then
14131 return not Is_Access_Constant
(Root_Type
(Etype
(P
)));
14133 -- For the case of an indexed component whose prefix has a packed
14134 -- array type, the prefix has been rewritten into a type conversion.
14135 -- Determine variable-ness from the converted expression.
14137 elsif Nkind
(P
) = N_Type_Conversion
14138 and then not Comes_From_Source
(P
)
14139 and then Is_Array_Type
(Etype
(P
))
14140 and then Is_Packed
(Etype
(P
))
14142 return Is_Variable
(Expression
(P
));
14145 return Is_Variable
(P
);
14147 end Is_Variable_Prefix
;
14149 -- Start of processing for Is_Variable
14152 -- Special check, allow x'Deref(expr) as a variable
14154 if Nkind
(N
) = N_Attribute_Reference
14155 and then Attribute_Name
(N
) = Name_Deref
14160 -- Check if we perform the test on the original node since this may be a
14161 -- test of syntactic categories which must not be disturbed by whatever
14162 -- rewriting might have occurred. For example, an aggregate, which is
14163 -- certainly NOT a variable, could be turned into a variable by
14166 if Use_Original_Node
then
14167 Orig_Node
:= Original_Node
(N
);
14172 -- Definitely OK if Assignment_OK is set. Since this is something that
14173 -- only gets set for expanded nodes, the test is on N, not Orig_Node.
14175 if Nkind
(N
) in N_Subexpr
and then Assignment_OK
(N
) then
14178 -- Normally we go to the original node, but there is one exception where
14179 -- we use the rewritten node, namely when it is an explicit dereference.
14180 -- The generated code may rewrite a prefix which is an access type with
14181 -- an explicit dereference. The dereference is a variable, even though
14182 -- the original node may not be (since it could be a constant of the
14185 -- In Ada 2005 we have a further case to consider: the prefix may be a
14186 -- function call given in prefix notation. The original node appears to
14187 -- be a selected component, but we need to examine the call.
14189 elsif Nkind
(N
) = N_Explicit_Dereference
14190 and then Nkind
(Orig_Node
) /= N_Explicit_Dereference
14191 and then Present
(Etype
(Orig_Node
))
14192 and then Is_Access_Type
(Etype
(Orig_Node
))
14194 -- Note that if the prefix is an explicit dereference that does not
14195 -- come from source, we must check for a rewritten function call in
14196 -- prefixed notation before other forms of rewriting, to prevent a
14200 (Nkind
(Orig_Node
) = N_Function_Call
14201 and then not Is_Access_Constant
(Etype
(Prefix
(N
))))
14203 Is_Variable_Prefix
(Original_Node
(Prefix
(N
)));
14205 -- in Ada 2012, the dereference may have been added for a type with
14206 -- a declared implicit dereference aspect. Check that it is not an
14207 -- access to constant.
14209 elsif Nkind
(N
) = N_Explicit_Dereference
14210 and then Present
(Etype
(Orig_Node
))
14211 and then Ada_Version
>= Ada_2012
14212 and then Has_Implicit_Dereference
(Etype
(Orig_Node
))
14214 return not Is_Access_Constant
(Etype
(Prefix
(N
)));
14216 -- A function call is never a variable
14218 elsif Nkind
(N
) = N_Function_Call
then
14221 -- All remaining checks use the original node
14223 elsif Is_Entity_Name
(Orig_Node
)
14224 and then Present
(Entity
(Orig_Node
))
14227 E
: constant Entity_Id
:= Entity
(Orig_Node
);
14228 K
: constant Entity_Kind
:= Ekind
(E
);
14231 return (K
= E_Variable
14232 and then Nkind
(Parent
(E
)) /= N_Exception_Handler
)
14233 or else (K
= E_Component
14234 and then not In_Protected_Function
(E
))
14235 or else K
= E_Out_Parameter
14236 or else K
= E_In_Out_Parameter
14237 or else K
= E_Generic_In_Out_Parameter
14239 -- Current instance of type. If this is a protected type, check
14240 -- we are not within the body of one of its protected functions.
14242 or else (Is_Type
(E
)
14243 and then In_Open_Scopes
(E
)
14244 and then not In_Protected_Function
(E
))
14246 or else (Is_Incomplete_Or_Private_Type
(E
)
14247 and then In_Open_Scopes
(Full_View
(E
)));
14251 case Nkind
(Orig_Node
) is
14252 when N_Indexed_Component | N_Slice
=>
14253 return Is_Variable_Prefix
(Prefix
(Orig_Node
));
14255 when N_Selected_Component
=>
14256 return (Is_Variable
(Selector_Name
(Orig_Node
))
14257 and then Is_Variable_Prefix
(Prefix
(Orig_Node
)))
14259 (Nkind
(N
) = N_Expanded_Name
14260 and then Scope
(Entity
(N
)) = Entity
(Prefix
(N
)));
14262 -- For an explicit dereference, the type of the prefix cannot
14263 -- be an access to constant or an access to subprogram.
14265 when N_Explicit_Dereference
=>
14267 Typ
: constant Entity_Id
:= Etype
(Prefix
(Orig_Node
));
14269 return Is_Access_Type
(Typ
)
14270 and then not Is_Access_Constant
(Root_Type
(Typ
))
14271 and then Ekind
(Typ
) /= E_Access_Subprogram_Type
;
14274 -- The type conversion is the case where we do not deal with the
14275 -- context dependent special case of an actual parameter. Thus
14276 -- the type conversion is only considered a variable for the
14277 -- purposes of this routine if the target type is tagged. However,
14278 -- a type conversion is considered to be a variable if it does not
14279 -- come from source (this deals for example with the conversions
14280 -- of expressions to their actual subtypes).
14282 when N_Type_Conversion
=>
14283 return Is_Variable
(Expression
(Orig_Node
))
14285 (not Comes_From_Source
(Orig_Node
)
14287 (Is_Tagged_Type
(Etype
(Subtype_Mark
(Orig_Node
)))
14289 Is_Tagged_Type
(Etype
(Expression
(Orig_Node
)))));
14291 -- GNAT allows an unchecked type conversion as a variable. This
14292 -- only affects the generation of internal expanded code, since
14293 -- calls to instantiations of Unchecked_Conversion are never
14294 -- considered variables (since they are function calls).
14296 when N_Unchecked_Type_Conversion
=>
14297 return Is_Variable
(Expression
(Orig_Node
));
14305 ---------------------------
14306 -- Is_Visibly_Controlled --
14307 ---------------------------
14309 function Is_Visibly_Controlled
(T
: Entity_Id
) return Boolean is
14310 Root
: constant Entity_Id
:= Root_Type
(T
);
14312 return Chars
(Scope
(Root
)) = Name_Finalization
14313 and then Chars
(Scope
(Scope
(Root
))) = Name_Ada
14314 and then Scope
(Scope
(Scope
(Root
))) = Standard_Standard
;
14315 end Is_Visibly_Controlled
;
14317 --------------------------
14318 -- Is_Volatile_Function --
14319 --------------------------
14321 function Is_Volatile_Function
(Func_Id
: Entity_Id
) return Boolean is
14323 -- The caller must ensure that Func_Id denotes a function
14325 pragma Assert
(Ekind_In
(Func_Id
, E_Function
, E_Generic_Function
));
14327 -- A protected function is automatically volatile
14329 if Is_Primitive
(Func_Id
)
14330 and then Present
(First_Formal
(Func_Id
))
14331 and then Is_Protected_Type
(Etype
(First_Formal
(Func_Id
)))
14332 and then Etype
(First_Formal
(Func_Id
)) = Scope
(Func_Id
)
14336 -- An instance of Ada.Unchecked_Conversion is a volatile function if
14337 -- either the source or the target are effectively volatile.
14339 elsif Is_Unchecked_Conversion_Instance
(Func_Id
)
14340 and then Has_Effectively_Volatile_Profile
(Func_Id
)
14344 -- Otherwise the function is treated as volatile if it is subject to
14345 -- enabled pragma Volatile_Function.
14349 Is_Enabled_Pragma
(Get_Pragma
(Func_Id
, Pragma_Volatile_Function
));
14351 end Is_Volatile_Function
;
14353 ------------------------
14354 -- Is_Volatile_Object --
14355 ------------------------
14357 function Is_Volatile_Object
(N
: Node_Id
) return Boolean is
14359 function Is_Volatile_Prefix
(N
: Node_Id
) return Boolean;
14360 -- If prefix is an implicit dereference, examine designated type
14362 function Object_Has_Volatile_Components
(N
: Node_Id
) return Boolean;
14363 -- Determines if given object has volatile components
14365 ------------------------
14366 -- Is_Volatile_Prefix --
14367 ------------------------
14369 function Is_Volatile_Prefix
(N
: Node_Id
) return Boolean is
14370 Typ
: constant Entity_Id
:= Etype
(N
);
14373 if Is_Access_Type
(Typ
) then
14375 Dtyp
: constant Entity_Id
:= Designated_Type
(Typ
);
14378 return Is_Volatile
(Dtyp
)
14379 or else Has_Volatile_Components
(Dtyp
);
14383 return Object_Has_Volatile_Components
(N
);
14385 end Is_Volatile_Prefix
;
14387 ------------------------------------
14388 -- Object_Has_Volatile_Components --
14389 ------------------------------------
14391 function Object_Has_Volatile_Components
(N
: Node_Id
) return Boolean is
14392 Typ
: constant Entity_Id
:= Etype
(N
);
14395 if Is_Volatile
(Typ
)
14396 or else Has_Volatile_Components
(Typ
)
14400 elsif Is_Entity_Name
(N
)
14401 and then (Has_Volatile_Components
(Entity
(N
))
14402 or else Is_Volatile
(Entity
(N
)))
14406 elsif Nkind
(N
) = N_Indexed_Component
14407 or else Nkind
(N
) = N_Selected_Component
14409 return Is_Volatile_Prefix
(Prefix
(N
));
14414 end Object_Has_Volatile_Components
;
14416 -- Start of processing for Is_Volatile_Object
14419 if Nkind
(N
) = N_Defining_Identifier
then
14420 return Is_Volatile
(N
) or else Is_Volatile
(Etype
(N
));
14422 elsif Nkind
(N
) = N_Expanded_Name
then
14423 return Is_Volatile_Object
(Entity
(N
));
14425 elsif Is_Volatile
(Etype
(N
))
14426 or else (Is_Entity_Name
(N
) and then Is_Volatile
(Entity
(N
)))
14430 elsif Nkind_In
(N
, N_Indexed_Component
, N_Selected_Component
)
14431 and then Is_Volatile_Prefix
(Prefix
(N
))
14435 elsif Nkind
(N
) = N_Selected_Component
14436 and then Is_Volatile
(Entity
(Selector_Name
(N
)))
14443 end Is_Volatile_Object
;
14445 ---------------------------
14446 -- Itype_Has_Declaration --
14447 ---------------------------
14449 function Itype_Has_Declaration
(Id
: Entity_Id
) return Boolean is
14451 pragma Assert
(Is_Itype
(Id
));
14452 return Present
(Parent
(Id
))
14453 and then Nkind_In
(Parent
(Id
), N_Full_Type_Declaration
,
14454 N_Subtype_Declaration
)
14455 and then Defining_Entity
(Parent
(Id
)) = Id
;
14456 end Itype_Has_Declaration
;
14458 -------------------------
14459 -- Kill_Current_Values --
14460 -------------------------
14462 procedure Kill_Current_Values
14464 Last_Assignment_Only
: Boolean := False)
14467 if Is_Assignable
(Ent
) then
14468 Set_Last_Assignment
(Ent
, Empty
);
14471 if Is_Object
(Ent
) then
14472 if not Last_Assignment_Only
then
14474 Set_Current_Value
(Ent
, Empty
);
14476 -- Do not reset the Is_Known_[Non_]Null and Is_Known_Valid flags
14477 -- for a constant. Once the constant is elaborated, its value is
14478 -- not changed, therefore the associated flags that describe the
14479 -- value should not be modified either.
14481 if Ekind
(Ent
) = E_Constant
then
14484 -- Non-constant entities
14487 if not Can_Never_Be_Null
(Ent
) then
14488 Set_Is_Known_Non_Null
(Ent
, False);
14491 Set_Is_Known_Null
(Ent
, False);
14493 -- Reset the Is_Known_Valid flag unless the type is always
14494 -- valid. This does not apply to a loop parameter because its
14495 -- bounds are defined by the loop header and therefore always
14498 if not Is_Known_Valid
(Etype
(Ent
))
14499 and then Ekind
(Ent
) /= E_Loop_Parameter
14501 Set_Is_Known_Valid
(Ent
, False);
14506 end Kill_Current_Values
;
14508 procedure Kill_Current_Values
(Last_Assignment_Only
: Boolean := False) is
14511 procedure Kill_Current_Values_For_Entity_Chain
(E
: Entity_Id
);
14512 -- Clear current value for entity E and all entities chained to E
14514 ------------------------------------------
14515 -- Kill_Current_Values_For_Entity_Chain --
14516 ------------------------------------------
14518 procedure Kill_Current_Values_For_Entity_Chain
(E
: Entity_Id
) is
14522 while Present
(Ent
) loop
14523 Kill_Current_Values
(Ent
, Last_Assignment_Only
);
14526 end Kill_Current_Values_For_Entity_Chain
;
14528 -- Start of processing for Kill_Current_Values
14531 -- Kill all saved checks, a special case of killing saved values
14533 if not Last_Assignment_Only
then
14537 -- Loop through relevant scopes, which includes the current scope and
14538 -- any parent scopes if the current scope is a block or a package.
14540 S
:= Current_Scope
;
14543 -- Clear current values of all entities in current scope
14545 Kill_Current_Values_For_Entity_Chain
(First_Entity
(S
));
14547 -- If scope is a package, also clear current values of all private
14548 -- entities in the scope.
14550 if Is_Package_Or_Generic_Package
(S
)
14551 or else Is_Concurrent_Type
(S
)
14553 Kill_Current_Values_For_Entity_Chain
(First_Private_Entity
(S
));
14556 -- If this is a not a subprogram, deal with parents
14558 if not Is_Subprogram
(S
) then
14560 exit Scope_Loop
when S
= Standard_Standard
;
14564 end loop Scope_Loop
;
14565 end Kill_Current_Values
;
14567 --------------------------
14568 -- Kill_Size_Check_Code --
14569 --------------------------
14571 procedure Kill_Size_Check_Code
(E
: Entity_Id
) is
14573 if (Ekind
(E
) = E_Constant
or else Ekind
(E
) = E_Variable
)
14574 and then Present
(Size_Check_Code
(E
))
14576 Remove
(Size_Check_Code
(E
));
14577 Set_Size_Check_Code
(E
, Empty
);
14579 end Kill_Size_Check_Code
;
14581 --------------------------
14582 -- Known_To_Be_Assigned --
14583 --------------------------
14585 function Known_To_Be_Assigned
(N
: Node_Id
) return Boolean is
14586 P
: constant Node_Id
:= Parent
(N
);
14591 -- Test left side of assignment
14593 when N_Assignment_Statement
=>
14594 return N
= Name
(P
);
14596 -- Function call arguments are never lvalues
14598 when N_Function_Call
=>
14601 -- Positional parameter for procedure or accept call
14603 when N_Procedure_Call_Statement |
14612 Proc
:= Get_Subprogram_Entity
(P
);
14618 -- If we are not a list member, something is strange, so
14619 -- be conservative and return False.
14621 if not Is_List_Member
(N
) then
14625 -- We are going to find the right formal by stepping forward
14626 -- through the formals, as we step backwards in the actuals.
14628 Form
:= First_Formal
(Proc
);
14631 -- If no formal, something is weird, so be conservative
14632 -- and return False.
14639 exit when No
(Act
);
14640 Next_Formal
(Form
);
14643 return Ekind
(Form
) /= E_In_Parameter
;
14646 -- Named parameter for procedure or accept call
14648 when N_Parameter_Association
=>
14654 Proc
:= Get_Subprogram_Entity
(Parent
(P
));
14660 -- Loop through formals to find the one that matches
14662 Form
:= First_Formal
(Proc
);
14664 -- If no matching formal, that's peculiar, some kind of
14665 -- previous error, so return False to be conservative.
14666 -- Actually this also happens in legal code in the case
14667 -- where P is a parameter association for an Extra_Formal???
14673 -- Else test for match
14675 if Chars
(Form
) = Chars
(Selector_Name
(P
)) then
14676 return Ekind
(Form
) /= E_In_Parameter
;
14679 Next_Formal
(Form
);
14683 -- Test for appearing in a conversion that itself appears
14684 -- in an lvalue context, since this should be an lvalue.
14686 when N_Type_Conversion
=>
14687 return Known_To_Be_Assigned
(P
);
14689 -- All other references are definitely not known to be modifications
14695 end Known_To_Be_Assigned
;
14697 ---------------------------
14698 -- Last_Source_Statement --
14699 ---------------------------
14701 function Last_Source_Statement
(HSS
: Node_Id
) return Node_Id
is
14705 N
:= Last
(Statements
(HSS
));
14706 while Present
(N
) loop
14707 exit when Comes_From_Source
(N
);
14712 end Last_Source_Statement
;
14714 ----------------------------------
14715 -- Matching_Static_Array_Bounds --
14716 ----------------------------------
14718 function Matching_Static_Array_Bounds
14720 R_Typ
: Node_Id
) return Boolean
14722 L_Ndims
: constant Nat
:= Number_Dimensions
(L_Typ
);
14723 R_Ndims
: constant Nat
:= Number_Dimensions
(R_Typ
);
14735 if L_Ndims
/= R_Ndims
then
14739 -- Unconstrained types do not have static bounds
14741 if not Is_Constrained
(L_Typ
) or else not Is_Constrained
(R_Typ
) then
14745 -- First treat specially the first dimension, as the lower bound and
14746 -- length of string literals are not stored like those of arrays.
14748 if Ekind
(L_Typ
) = E_String_Literal_Subtype
then
14749 L_Low
:= String_Literal_Low_Bound
(L_Typ
);
14750 L_Len
:= String_Literal_Length
(L_Typ
);
14752 L_Index
:= First_Index
(L_Typ
);
14753 Get_Index_Bounds
(L_Index
, L_Low
, L_High
);
14755 if Is_OK_Static_Expression
(L_Low
)
14757 Is_OK_Static_Expression
(L_High
)
14759 if Expr_Value
(L_High
) < Expr_Value
(L_Low
) then
14762 L_Len
:= (Expr_Value
(L_High
) - Expr_Value
(L_Low
)) + 1;
14769 if Ekind
(R_Typ
) = E_String_Literal_Subtype
then
14770 R_Low
:= String_Literal_Low_Bound
(R_Typ
);
14771 R_Len
:= String_Literal_Length
(R_Typ
);
14773 R_Index
:= First_Index
(R_Typ
);
14774 Get_Index_Bounds
(R_Index
, R_Low
, R_High
);
14776 if Is_OK_Static_Expression
(R_Low
)
14778 Is_OK_Static_Expression
(R_High
)
14780 if Expr_Value
(R_High
) < Expr_Value
(R_Low
) then
14783 R_Len
:= (Expr_Value
(R_High
) - Expr_Value
(R_Low
)) + 1;
14790 if (Is_OK_Static_Expression
(L_Low
)
14792 Is_OK_Static_Expression
(R_Low
))
14793 and then Expr_Value
(L_Low
) = Expr_Value
(R_Low
)
14794 and then L_Len
= R_Len
14801 -- Then treat all other dimensions
14803 for Indx
in 2 .. L_Ndims
loop
14807 Get_Index_Bounds
(L_Index
, L_Low
, L_High
);
14808 Get_Index_Bounds
(R_Index
, R_Low
, R_High
);
14810 if (Is_OK_Static_Expression
(L_Low
) and then
14811 Is_OK_Static_Expression
(L_High
) and then
14812 Is_OK_Static_Expression
(R_Low
) and then
14813 Is_OK_Static_Expression
(R_High
))
14814 and then (Expr_Value
(L_Low
) = Expr_Value
(R_Low
)
14816 Expr_Value
(L_High
) = Expr_Value
(R_High
))
14824 -- If we fall through the loop, all indexes matched
14827 end Matching_Static_Array_Bounds
;
14829 -------------------
14830 -- May_Be_Lvalue --
14831 -------------------
14833 function May_Be_Lvalue
(N
: Node_Id
) return Boolean is
14834 P
: constant Node_Id
:= Parent
(N
);
14839 -- Test left side of assignment
14841 when N_Assignment_Statement
=>
14842 return N
= Name
(P
);
14844 -- Test prefix of component or attribute. Note that the prefix of an
14845 -- explicit or implicit dereference cannot be an l-value.
14847 when N_Attribute_Reference
=>
14848 return N
= Prefix
(P
)
14849 and then Name_Implies_Lvalue_Prefix
(Attribute_Name
(P
));
14851 -- For an expanded name, the name is an lvalue if the expanded name
14852 -- is an lvalue, but the prefix is never an lvalue, since it is just
14853 -- the scope where the name is found.
14855 when N_Expanded_Name
=>
14856 if N
= Prefix
(P
) then
14857 return May_Be_Lvalue
(P
);
14862 -- For a selected component A.B, A is certainly an lvalue if A.B is.
14863 -- B is a little interesting, if we have A.B := 3, there is some
14864 -- discussion as to whether B is an lvalue or not, we choose to say
14865 -- it is. Note however that A is not an lvalue if it is of an access
14866 -- type since this is an implicit dereference.
14868 when N_Selected_Component
=>
14870 and then Present
(Etype
(N
))
14871 and then Is_Access_Type
(Etype
(N
))
14875 return May_Be_Lvalue
(P
);
14878 -- For an indexed component or slice, the index or slice bounds is
14879 -- never an lvalue. The prefix is an lvalue if the indexed component
14880 -- or slice is an lvalue, except if it is an access type, where we
14881 -- have an implicit dereference.
14883 when N_Indexed_Component | N_Slice
=>
14885 or else (Present
(Etype
(N
)) and then Is_Access_Type
(Etype
(N
)))
14889 return May_Be_Lvalue
(P
);
14892 -- Prefix of a reference is an lvalue if the reference is an lvalue
14894 when N_Reference
=>
14895 return May_Be_Lvalue
(P
);
14897 -- Prefix of explicit dereference is never an lvalue
14899 when N_Explicit_Dereference
=>
14902 -- Positional parameter for subprogram, entry, or accept call.
14903 -- In older versions of Ada function call arguments are never
14904 -- lvalues. In Ada 2012 functions can have in-out parameters.
14906 when N_Subprogram_Call |
14907 N_Entry_Call_Statement |
14910 if Nkind
(P
) = N_Function_Call
and then Ada_Version
< Ada_2012
then
14914 -- The following mechanism is clumsy and fragile. A single flag
14915 -- set in Resolve_Actuals would be preferable ???
14923 Proc
:= Get_Subprogram_Entity
(P
);
14929 -- If we are not a list member, something is strange, so be
14930 -- conservative and return True.
14932 if not Is_List_Member
(N
) then
14936 -- We are going to find the right formal by stepping forward
14937 -- through the formals, as we step backwards in the actuals.
14939 Form
:= First_Formal
(Proc
);
14942 -- If no formal, something is weird, so be conservative and
14950 exit when No
(Act
);
14951 Next_Formal
(Form
);
14954 return Ekind
(Form
) /= E_In_Parameter
;
14957 -- Named parameter for procedure or accept call
14959 when N_Parameter_Association
=>
14965 Proc
:= Get_Subprogram_Entity
(Parent
(P
));
14971 -- Loop through formals to find the one that matches
14973 Form
:= First_Formal
(Proc
);
14975 -- If no matching formal, that's peculiar, some kind of
14976 -- previous error, so return True to be conservative.
14977 -- Actually happens with legal code for an unresolved call
14978 -- where we may get the wrong homonym???
14984 -- Else test for match
14986 if Chars
(Form
) = Chars
(Selector_Name
(P
)) then
14987 return Ekind
(Form
) /= E_In_Parameter
;
14990 Next_Formal
(Form
);
14994 -- Test for appearing in a conversion that itself appears in an
14995 -- lvalue context, since this should be an lvalue.
14997 when N_Type_Conversion
=>
14998 return May_Be_Lvalue
(P
);
15000 -- Test for appearance in object renaming declaration
15002 when N_Object_Renaming_Declaration
=>
15005 -- All other references are definitely not lvalues
15013 -----------------------
15014 -- Mark_Coextensions --
15015 -----------------------
15017 procedure Mark_Coextensions
(Context_Nod
: Node_Id
; Root_Nod
: Node_Id
) is
15018 Is_Dynamic
: Boolean;
15019 -- Indicates whether the context causes nested coextensions to be
15020 -- dynamic or static
15022 function Mark_Allocator
(N
: Node_Id
) return Traverse_Result
;
15023 -- Recognize an allocator node and label it as a dynamic coextension
15025 --------------------
15026 -- Mark_Allocator --
15027 --------------------
15029 function Mark_Allocator
(N
: Node_Id
) return Traverse_Result
is
15031 if Nkind
(N
) = N_Allocator
then
15033 Set_Is_Dynamic_Coextension
(N
);
15035 -- If the allocator expression is potentially dynamic, it may
15036 -- be expanded out of order and require dynamic allocation
15037 -- anyway, so we treat the coextension itself as dynamic.
15038 -- Potential optimization ???
15040 elsif Nkind
(Expression
(N
)) = N_Qualified_Expression
15041 and then Nkind
(Expression
(Expression
(N
))) = N_Op_Concat
15043 Set_Is_Dynamic_Coextension
(N
);
15045 Set_Is_Static_Coextension
(N
);
15050 end Mark_Allocator
;
15052 procedure Mark_Allocators
is new Traverse_Proc
(Mark_Allocator
);
15054 -- Start of processing for Mark_Coextensions
15057 -- An allocator that appears on the right-hand side of an assignment is
15058 -- treated as a potentially dynamic coextension when the right-hand side
15059 -- is an allocator or a qualified expression.
15061 -- Obj := new ...'(new Coextension ...);
15063 if Nkind
(Context_Nod
) = N_Assignment_Statement
then
15065 Nkind_In
(Expression
(Context_Nod
), N_Allocator
,
15066 N_Qualified_Expression
);
15068 -- An allocator that appears within the expression of a simple return
15069 -- statement is treated as a potentially dynamic coextension when the
15070 -- expression is either aggregate, allocator, or qualified expression.
15072 -- return (new Coextension ...);
15073 -- return new ...'(new Coextension ...);
15075 elsif Nkind
(Context_Nod
) = N_Simple_Return_Statement
then
15077 Nkind_In
(Expression
(Context_Nod
), N_Aggregate
,
15079 N_Qualified_Expression
);
15081 -- An alloctor that appears within the initialization expression of an
15082 -- object declaration is considered a potentially dynamic coextension
15083 -- when the initialization expression is an allocator or a qualified
15086 -- Obj : ... := new ...'(new Coextension ...);
15088 -- A similar case arises when the object declaration is part of an
15089 -- extended return statement.
15091 -- return Obj : ... := new ...'(new Coextension ...);
15092 -- return Obj : ... := (new Coextension ...);
15094 elsif Nkind
(Context_Nod
) = N_Object_Declaration
then
15096 Nkind_In
(Root_Nod
, N_Allocator
, N_Qualified_Expression
)
15098 Nkind
(Parent
(Context_Nod
)) = N_Extended_Return_Statement
;
15100 -- This routine should not be called with constructs that cannot contain
15104 raise Program_Error
;
15107 Mark_Allocators
(Root_Nod
);
15108 end Mark_Coextensions
;
15110 ----------------------
15111 -- Needs_One_Actual --
15112 ----------------------
15114 function Needs_One_Actual
(E
: Entity_Id
) return Boolean is
15115 Formal
: Entity_Id
;
15118 -- Ada 2005 or later, and formals present
15120 if Ada_Version
>= Ada_2005
and then Present
(First_Formal
(E
)) then
15121 Formal
:= Next_Formal
(First_Formal
(E
));
15122 while Present
(Formal
) loop
15123 if No
(Default_Value
(Formal
)) then
15127 Next_Formal
(Formal
);
15132 -- Ada 83/95 or no formals
15137 end Needs_One_Actual
;
15139 ------------------------
15140 -- New_Copy_List_Tree --
15141 ------------------------
15143 function New_Copy_List_Tree
(List
: List_Id
) return List_Id
is
15148 if List
= No_List
then
15155 while Present
(E
) loop
15156 Append
(New_Copy_Tree
(E
), NL
);
15162 end New_Copy_List_Tree
;
15164 --------------------------------------------------
15165 -- New_Copy_Tree Auxiliary Data and Subprograms --
15166 --------------------------------------------------
15168 use Atree
.Unchecked_Access
;
15169 use Atree_Private_Part
;
15171 -- Our approach here requires a two pass traversal of the tree. The
15172 -- first pass visits all nodes that eventually will be copied looking
15173 -- for defining Itypes. If any defining Itypes are found, then they are
15174 -- copied, and an entry is added to the replacement map. In the second
15175 -- phase, the tree is copied, using the replacement map to replace any
15176 -- Itype references within the copied tree.
15178 -- The following hash tables are used if the Map supplied has more
15179 -- than hash threshold entries to speed up access to the map. If
15180 -- there are fewer entries, then the map is searched sequentially
15181 -- (because setting up a hash table for only a few entries takes
15182 -- more time than it saves.
15184 function New_Copy_Hash
(E
: Entity_Id
) return NCT_Header_Num
;
15185 -- Hash function used for hash operations
15187 -------------------
15188 -- New_Copy_Hash --
15189 -------------------
15191 function New_Copy_Hash
(E
: Entity_Id
) return NCT_Header_Num
is
15193 return Nat
(E
) mod (NCT_Header_Num
'Last + 1);
15200 -- The hash table NCT_Assoc associates old entities in the table
15201 -- with their corresponding new entities (i.e. the pairs of entries
15202 -- presented in the original Map argument are Key-Element pairs).
15204 package NCT_Assoc
is new Simple_HTable
(
15205 Header_Num
=> NCT_Header_Num
,
15206 Element
=> Entity_Id
,
15207 No_Element
=> Empty
,
15209 Hash
=> New_Copy_Hash
,
15210 Equal
=> Types
."=");
15212 ---------------------
15213 -- NCT_Itype_Assoc --
15214 ---------------------
15216 -- The hash table NCT_Itype_Assoc contains entries only for those
15217 -- old nodes which have a non-empty Associated_Node_For_Itype set.
15218 -- The key is the associated node, and the element is the new node
15219 -- itself (NOT the associated node for the new node).
15221 package NCT_Itype_Assoc
is new Simple_HTable
(
15222 Header_Num
=> NCT_Header_Num
,
15223 Element
=> Entity_Id
,
15224 No_Element
=> Empty
,
15226 Hash
=> New_Copy_Hash
,
15227 Equal
=> Types
."=");
15229 -------------------
15230 -- New_Copy_Tree --
15231 -------------------
15233 function New_Copy_Tree
15235 Map
: Elist_Id
:= No_Elist
;
15236 New_Sloc
: Source_Ptr
:= No_Location
;
15237 New_Scope
: Entity_Id
:= Empty
) return Node_Id
15239 Actual_Map
: Elist_Id
:= Map
;
15240 -- This is the actual map for the copy. It is initialized with the
15241 -- given elements, and then enlarged as required for Itypes that are
15242 -- copied during the first phase of the copy operation. The visit
15243 -- procedures add elements to this map as Itypes are encountered.
15244 -- The reason we cannot use Map directly, is that it may well be
15245 -- (and normally is) initialized to No_Elist, and if we have mapped
15246 -- entities, we have to reset it to point to a real Elist.
15248 function Assoc
(N
: Node_Or_Entity_Id
) return Node_Id
;
15249 -- Called during second phase to map entities into their corresponding
15250 -- copies using Actual_Map. If the argument is not an entity, or is not
15251 -- in Actual_Map, then it is returned unchanged.
15253 procedure Build_NCT_Hash_Tables
;
15254 -- Builds hash tables (number of elements >= threshold value)
15256 function Copy_Elist_With_Replacement
15257 (Old_Elist
: Elist_Id
) return Elist_Id
;
15258 -- Called during second phase to copy element list doing replacements
15260 procedure Copy_Itype_With_Replacement
(New_Itype
: Entity_Id
);
15261 -- Called during the second phase to process a copied Itype. The actual
15262 -- copy happened during the first phase (so that we could make the entry
15263 -- in the mapping), but we still have to deal with the descendents of
15264 -- the copied Itype and copy them where necessary.
15266 function Copy_List_With_Replacement
(Old_List
: List_Id
) return List_Id
;
15267 -- Called during second phase to copy list doing replacements
15269 function Copy_Node_With_Replacement
(Old_Node
: Node_Id
) return Node_Id
;
15270 -- Called during second phase to copy node doing replacements
15272 procedure Visit_Elist
(E
: Elist_Id
);
15273 -- Called during first phase to visit all elements of an Elist
15275 procedure Visit_Field
(F
: Union_Id
; N
: Node_Id
);
15276 -- Visit a single field, recursing to call Visit_Node or Visit_List
15277 -- if the field is a syntactic descendent of the current node (i.e.
15278 -- its parent is Node N).
15280 procedure Visit_Itype
(Old_Itype
: Entity_Id
);
15281 -- Called during first phase to visit subsidiary fields of a defining
15282 -- Itype, and also create a copy and make an entry in the replacement
15283 -- map for the new copy.
15285 procedure Visit_List
(L
: List_Id
);
15286 -- Called during first phase to visit all elements of a List
15288 procedure Visit_Node
(N
: Node_Or_Entity_Id
);
15289 -- Called during first phase to visit a node and all its subtrees
15295 function Assoc
(N
: Node_Or_Entity_Id
) return Node_Id
is
15300 if not Has_Extension
(N
) or else No
(Actual_Map
) then
15303 elsif NCT_Hash_Tables_Used
then
15304 Ent
:= NCT_Assoc
.Get
(Entity_Id
(N
));
15306 if Present
(Ent
) then
15312 -- No hash table used, do serial search
15315 E
:= First_Elmt
(Actual_Map
);
15316 while Present
(E
) loop
15317 if Node
(E
) = N
then
15318 return Node
(Next_Elmt
(E
));
15320 E
:= Next_Elmt
(Next_Elmt
(E
));
15328 ---------------------------
15329 -- Build_NCT_Hash_Tables --
15330 ---------------------------
15332 procedure Build_NCT_Hash_Tables
is
15336 if NCT_Hash_Table_Setup
then
15338 NCT_Itype_Assoc
.Reset
;
15341 Elmt
:= First_Elmt
(Actual_Map
);
15342 while Present
(Elmt
) loop
15343 Ent
:= Node
(Elmt
);
15345 -- Get new entity, and associate old and new
15348 NCT_Assoc
.Set
(Ent
, Node
(Elmt
));
15350 if Is_Type
(Ent
) then
15352 Anode
: constant Entity_Id
:=
15353 Associated_Node_For_Itype
(Ent
);
15356 if Present
(Anode
) then
15358 -- Enter a link between the associated node of the
15359 -- old Itype and the new Itype, for updating later
15360 -- when node is copied.
15362 NCT_Itype_Assoc
.Set
(Anode
, Node
(Elmt
));
15370 NCT_Hash_Tables_Used
:= True;
15371 NCT_Hash_Table_Setup
:= True;
15372 end Build_NCT_Hash_Tables
;
15374 ---------------------------------
15375 -- Copy_Elist_With_Replacement --
15376 ---------------------------------
15378 function Copy_Elist_With_Replacement
15379 (Old_Elist
: Elist_Id
) return Elist_Id
15382 New_Elist
: Elist_Id
;
15385 if No
(Old_Elist
) then
15389 New_Elist
:= New_Elmt_List
;
15391 M
:= First_Elmt
(Old_Elist
);
15392 while Present
(M
) loop
15393 Append_Elmt
(Copy_Node_With_Replacement
(Node
(M
)), New_Elist
);
15399 end Copy_Elist_With_Replacement
;
15401 ---------------------------------
15402 -- Copy_Itype_With_Replacement --
15403 ---------------------------------
15405 -- This routine exactly parallels its phase one analog Visit_Itype,
15407 procedure Copy_Itype_With_Replacement
(New_Itype
: Entity_Id
) is
15409 -- Translate Next_Entity, Scope and Etype fields, in case they
15410 -- reference entities that have been mapped into copies.
15412 Set_Next_Entity
(New_Itype
, Assoc
(Next_Entity
(New_Itype
)));
15413 Set_Etype
(New_Itype
, Assoc
(Etype
(New_Itype
)));
15415 if Present
(New_Scope
) then
15416 Set_Scope
(New_Itype
, New_Scope
);
15418 Set_Scope
(New_Itype
, Assoc
(Scope
(New_Itype
)));
15421 -- Copy referenced fields
15423 if Is_Discrete_Type
(New_Itype
) then
15424 Set_Scalar_Range
(New_Itype
,
15425 Copy_Node_With_Replacement
(Scalar_Range
(New_Itype
)));
15427 elsif Has_Discriminants
(Base_Type
(New_Itype
)) then
15428 Set_Discriminant_Constraint
(New_Itype
,
15429 Copy_Elist_With_Replacement
15430 (Discriminant_Constraint
(New_Itype
)));
15432 elsif Is_Array_Type
(New_Itype
) then
15433 if Present
(First_Index
(New_Itype
)) then
15434 Set_First_Index
(New_Itype
,
15435 First
(Copy_List_With_Replacement
15436 (List_Containing
(First_Index
(New_Itype
)))));
15439 if Is_Packed
(New_Itype
) then
15440 Set_Packed_Array_Impl_Type
(New_Itype
,
15441 Copy_Node_With_Replacement
15442 (Packed_Array_Impl_Type
(New_Itype
)));
15445 end Copy_Itype_With_Replacement
;
15447 --------------------------------
15448 -- Copy_List_With_Replacement --
15449 --------------------------------
15451 function Copy_List_With_Replacement
15452 (Old_List
: List_Id
) return List_Id
15454 New_List
: List_Id
;
15458 if Old_List
= No_List
then
15462 New_List
:= Empty_List
;
15464 E
:= First
(Old_List
);
15465 while Present
(E
) loop
15466 Append
(Copy_Node_With_Replacement
(E
), New_List
);
15472 end Copy_List_With_Replacement
;
15474 --------------------------------
15475 -- Copy_Node_With_Replacement --
15476 --------------------------------
15478 function Copy_Node_With_Replacement
15479 (Old_Node
: Node_Id
) return Node_Id
15481 New_Node
: Node_Id
;
15483 procedure Adjust_Named_Associations
15484 (Old_Node
: Node_Id
;
15485 New_Node
: Node_Id
);
15486 -- If a call node has named associations, these are chained through
15487 -- the First_Named_Actual, Next_Named_Actual links. These must be
15488 -- propagated separately to the new parameter list, because these
15489 -- are not syntactic fields.
15491 function Copy_Field_With_Replacement
15492 (Field
: Union_Id
) return Union_Id
;
15493 -- Given Field, which is a field of Old_Node, return a copy of it
15494 -- if it is a syntactic field (i.e. its parent is Node), setting
15495 -- the parent of the copy to poit to New_Node. Otherwise returns
15496 -- the field (possibly mapped if it is an entity).
15498 -------------------------------
15499 -- Adjust_Named_Associations --
15500 -------------------------------
15502 procedure Adjust_Named_Associations
15503 (Old_Node
: Node_Id
;
15504 New_Node
: Node_Id
)
15509 Old_Next
: Node_Id
;
15510 New_Next
: Node_Id
;
15513 Old_E
:= First
(Parameter_Associations
(Old_Node
));
15514 New_E
:= First
(Parameter_Associations
(New_Node
));
15515 while Present
(Old_E
) loop
15516 if Nkind
(Old_E
) = N_Parameter_Association
15517 and then Present
(Next_Named_Actual
(Old_E
))
15519 if First_Named_Actual
(Old_Node
)
15520 = Explicit_Actual_Parameter
(Old_E
)
15522 Set_First_Named_Actual
15523 (New_Node
, Explicit_Actual_Parameter
(New_E
));
15526 -- Now scan parameter list from the beginning,to locate
15527 -- next named actual, which can be out of order.
15529 Old_Next
:= First
(Parameter_Associations
(Old_Node
));
15530 New_Next
:= First
(Parameter_Associations
(New_Node
));
15532 while Nkind
(Old_Next
) /= N_Parameter_Association
15533 or else Explicit_Actual_Parameter
(Old_Next
) /=
15534 Next_Named_Actual
(Old_E
)
15540 Set_Next_Named_Actual
15541 (New_E
, Explicit_Actual_Parameter
(New_Next
));
15547 end Adjust_Named_Associations
;
15549 ---------------------------------
15550 -- Copy_Field_With_Replacement --
15551 ---------------------------------
15553 function Copy_Field_With_Replacement
15554 (Field
: Union_Id
) return Union_Id
15557 if Field
= Union_Id
(Empty
) then
15560 elsif Field
in Node_Range
then
15562 Old_N
: constant Node_Id
:= Node_Id
(Field
);
15566 -- If syntactic field, as indicated by the parent pointer
15567 -- being set, then copy the referenced node recursively.
15569 if Parent
(Old_N
) = Old_Node
then
15570 New_N
:= Copy_Node_With_Replacement
(Old_N
);
15572 if New_N
/= Old_N
then
15573 Set_Parent
(New_N
, New_Node
);
15576 -- For semantic fields, update possible entity reference
15577 -- from the replacement map.
15580 New_N
:= Assoc
(Old_N
);
15583 return Union_Id
(New_N
);
15586 elsif Field
in List_Range
then
15588 Old_L
: constant List_Id
:= List_Id
(Field
);
15592 -- If syntactic field, as indicated by the parent pointer,
15593 -- then recursively copy the entire referenced list.
15595 if Parent
(Old_L
) = Old_Node
then
15596 New_L
:= Copy_List_With_Replacement
(Old_L
);
15597 Set_Parent
(New_L
, New_Node
);
15599 -- For semantic list, just returned unchanged
15605 return Union_Id
(New_L
);
15608 -- Anything other than a list or a node is returned unchanged
15613 end Copy_Field_With_Replacement
;
15615 -- Start of processing for Copy_Node_With_Replacement
15618 if Old_Node
<= Empty_Or_Error
then
15621 elsif Has_Extension
(Old_Node
) then
15622 return Assoc
(Old_Node
);
15625 New_Node
:= New_Copy
(Old_Node
);
15627 -- If the node we are copying is the associated node of a
15628 -- previously copied Itype, then adjust the associated node
15629 -- of the copy of that Itype accordingly.
15631 if Present
(Actual_Map
) then
15637 -- Case of hash table used
15639 if NCT_Hash_Tables_Used
then
15640 Ent
:= NCT_Itype_Assoc
.Get
(Old_Node
);
15642 if Present
(Ent
) then
15643 Set_Associated_Node_For_Itype
(Ent
, New_Node
);
15646 -- Case of no hash table used
15649 E
:= First_Elmt
(Actual_Map
);
15650 while Present
(E
) loop
15651 if Is_Itype
(Node
(E
))
15653 Old_Node
= Associated_Node_For_Itype
(Node
(E
))
15655 Set_Associated_Node_For_Itype
15656 (Node
(Next_Elmt
(E
)), New_Node
);
15659 E
:= Next_Elmt
(Next_Elmt
(E
));
15665 -- Recursively copy descendents
15668 (New_Node
, Copy_Field_With_Replacement
(Field1
(New_Node
)));
15670 (New_Node
, Copy_Field_With_Replacement
(Field2
(New_Node
)));
15672 (New_Node
, Copy_Field_With_Replacement
(Field3
(New_Node
)));
15674 (New_Node
, Copy_Field_With_Replacement
(Field4
(New_Node
)));
15676 (New_Node
, Copy_Field_With_Replacement
(Field5
(New_Node
)));
15678 -- Adjust Sloc of new node if necessary
15680 if New_Sloc
/= No_Location
then
15681 Set_Sloc
(New_Node
, New_Sloc
);
15683 -- If we adjust the Sloc, then we are essentially making
15684 -- a completely new node, so the Comes_From_Source flag
15685 -- should be reset to the proper default value.
15687 Nodes
.Table
(New_Node
).Comes_From_Source
:=
15688 Default_Node
.Comes_From_Source
;
15691 -- If the node is call and has named associations,
15692 -- set the corresponding links in the copy.
15694 if (Nkind
(Old_Node
) = N_Function_Call
15695 or else Nkind
(Old_Node
) = N_Entry_Call_Statement
15697 Nkind
(Old_Node
) = N_Procedure_Call_Statement
)
15698 and then Present
(First_Named_Actual
(Old_Node
))
15700 Adjust_Named_Associations
(Old_Node
, New_Node
);
15703 -- Reset First_Real_Statement for Handled_Sequence_Of_Statements.
15704 -- The replacement mechanism applies to entities, and is not used
15705 -- here. Eventually we may need a more general graph-copying
15706 -- routine. For now, do a sequential search to find desired node.
15708 if Nkind
(Old_Node
) = N_Handled_Sequence_Of_Statements
15709 and then Present
(First_Real_Statement
(Old_Node
))
15712 Old_F
: constant Node_Id
:= First_Real_Statement
(Old_Node
);
15716 N1
:= First
(Statements
(Old_Node
));
15717 N2
:= First
(Statements
(New_Node
));
15719 while N1
/= Old_F
loop
15724 Set_First_Real_Statement
(New_Node
, N2
);
15729 -- All done, return copied node
15732 end Copy_Node_With_Replacement
;
15738 procedure Visit_Elist
(E
: Elist_Id
) is
15741 if Present
(E
) then
15742 Elmt
:= First_Elmt
(E
);
15744 while Elmt
/= No_Elmt
loop
15745 Visit_Node
(Node
(Elmt
));
15755 procedure Visit_Field
(F
: Union_Id
; N
: Node_Id
) is
15757 if F
= Union_Id
(Empty
) then
15760 elsif F
in Node_Range
then
15762 -- Copy node if it is syntactic, i.e. its parent pointer is
15763 -- set to point to the field that referenced it (certain
15764 -- Itypes will also meet this criterion, which is fine, since
15765 -- these are clearly Itypes that do need to be copied, since
15766 -- we are copying their parent.)
15768 if Parent
(Node_Id
(F
)) = N
then
15769 Visit_Node
(Node_Id
(F
));
15772 -- Another case, if we are pointing to an Itype, then we want
15773 -- to copy it if its associated node is somewhere in the tree
15776 -- Note: the exclusion of self-referential copies is just an
15777 -- optimization, since the search of the already copied list
15778 -- would catch it, but it is a common case (Etype pointing
15779 -- to itself for an Itype that is a base type).
15781 elsif Has_Extension
(Node_Id
(F
))
15782 and then Is_Itype
(Entity_Id
(F
))
15783 and then Node_Id
(F
) /= N
15789 P
:= Associated_Node_For_Itype
(Node_Id
(F
));
15790 while Present
(P
) loop
15792 Visit_Node
(Node_Id
(F
));
15799 -- An Itype whose parent is not being copied definitely
15800 -- should NOT be copied, since it does not belong in any
15801 -- sense to the copied subtree.
15807 elsif F
in List_Range
and then Parent
(List_Id
(F
)) = N
then
15808 Visit_List
(List_Id
(F
));
15817 procedure Visit_Itype
(Old_Itype
: Entity_Id
) is
15818 New_Itype
: Entity_Id
;
15823 -- Itypes that describe the designated type of access to subprograms
15824 -- have the structure of subprogram declarations, with signatures,
15825 -- etc. Either we duplicate the signatures completely, or choose to
15826 -- share such itypes, which is fine because their elaboration will
15827 -- have no side effects.
15829 if Ekind
(Old_Itype
) = E_Subprogram_Type
then
15833 New_Itype
:= New_Copy
(Old_Itype
);
15835 -- The new Itype has all the attributes of the old one, and
15836 -- we just copy the contents of the entity. However, the back-end
15837 -- needs different names for debugging purposes, so we create a
15838 -- new internal name for it in all cases.
15840 Set_Chars
(New_Itype
, New_Internal_Name
('T'));
15842 -- If our associated node is an entity that has already been copied,
15843 -- then set the associated node of the copy to point to the right
15844 -- copy. If we have copied an Itype that is itself the associated
15845 -- node of some previously copied Itype, then we set the right
15846 -- pointer in the other direction.
15848 if Present
(Actual_Map
) then
15850 -- Case of hash tables used
15852 if NCT_Hash_Tables_Used
then
15854 Ent
:= NCT_Assoc
.Get
(Associated_Node_For_Itype
(Old_Itype
));
15856 if Present
(Ent
) then
15857 Set_Associated_Node_For_Itype
(New_Itype
, Ent
);
15860 Ent
:= NCT_Itype_Assoc
.Get
(Old_Itype
);
15861 if Present
(Ent
) then
15862 Set_Associated_Node_For_Itype
(Ent
, New_Itype
);
15864 -- If the hash table has no association for this Itype and
15865 -- its associated node, enter one now.
15868 NCT_Itype_Assoc
.Set
15869 (Associated_Node_For_Itype
(Old_Itype
), New_Itype
);
15872 -- Case of hash tables not used
15875 E
:= First_Elmt
(Actual_Map
);
15876 while Present
(E
) loop
15877 if Associated_Node_For_Itype
(Old_Itype
) = Node
(E
) then
15878 Set_Associated_Node_For_Itype
15879 (New_Itype
, Node
(Next_Elmt
(E
)));
15882 if Is_Type
(Node
(E
))
15883 and then Old_Itype
= Associated_Node_For_Itype
(Node
(E
))
15885 Set_Associated_Node_For_Itype
15886 (Node
(Next_Elmt
(E
)), New_Itype
);
15889 E
:= Next_Elmt
(Next_Elmt
(E
));
15894 if Present
(Freeze_Node
(New_Itype
)) then
15895 Set_Is_Frozen
(New_Itype
, False);
15896 Set_Freeze_Node
(New_Itype
, Empty
);
15899 -- Add new association to map
15901 if No
(Actual_Map
) then
15902 Actual_Map
:= New_Elmt_List
;
15905 Append_Elmt
(Old_Itype
, Actual_Map
);
15906 Append_Elmt
(New_Itype
, Actual_Map
);
15908 if NCT_Hash_Tables_Used
then
15909 NCT_Assoc
.Set
(Old_Itype
, New_Itype
);
15912 NCT_Table_Entries
:= NCT_Table_Entries
+ 1;
15914 if NCT_Table_Entries
> NCT_Hash_Threshold
then
15915 Build_NCT_Hash_Tables
;
15919 -- If a record subtype is simply copied, the entity list will be
15920 -- shared. Thus cloned_Subtype must be set to indicate the sharing.
15922 if Ekind_In
(Old_Itype
, E_Record_Subtype
, E_Class_Wide_Subtype
) then
15923 Set_Cloned_Subtype
(New_Itype
, Old_Itype
);
15926 -- Visit descendents that eventually get copied
15928 Visit_Field
(Union_Id
(Etype
(Old_Itype
)), Old_Itype
);
15930 if Is_Discrete_Type
(Old_Itype
) then
15931 Visit_Field
(Union_Id
(Scalar_Range
(Old_Itype
)), Old_Itype
);
15933 elsif Has_Discriminants
(Base_Type
(Old_Itype
)) then
15934 -- ??? This should involve call to Visit_Field
15935 Visit_Elist
(Discriminant_Constraint
(Old_Itype
));
15937 elsif Is_Array_Type
(Old_Itype
) then
15938 if Present
(First_Index
(Old_Itype
)) then
15939 Visit_Field
(Union_Id
(List_Containing
15940 (First_Index
(Old_Itype
))),
15944 if Is_Packed
(Old_Itype
) then
15945 Visit_Field
(Union_Id
(Packed_Array_Impl_Type
(Old_Itype
)),
15955 procedure Visit_List
(L
: List_Id
) is
15958 if L
/= No_List
then
15961 while Present
(N
) loop
15972 procedure Visit_Node
(N
: Node_Or_Entity_Id
) is
15974 -- Start of processing for Visit_Node
15977 -- Handle case of an Itype, which must be copied
15979 if Has_Extension
(N
) and then Is_Itype
(N
) then
15981 -- Nothing to do if already in the list. This can happen with an
15982 -- Itype entity that appears more than once in the tree.
15983 -- Note that we do not want to visit descendents in this case.
15985 -- Test for already in list when hash table is used
15987 if NCT_Hash_Tables_Used
then
15988 if Present
(NCT_Assoc
.Get
(Entity_Id
(N
))) then
15992 -- Test for already in list when hash table not used
15998 if Present
(Actual_Map
) then
15999 E
:= First_Elmt
(Actual_Map
);
16000 while Present
(E
) loop
16001 if Node
(E
) = N
then
16004 E
:= Next_Elmt
(Next_Elmt
(E
));
16014 -- Visit descendents
16016 Visit_Field
(Field1
(N
), N
);
16017 Visit_Field
(Field2
(N
), N
);
16018 Visit_Field
(Field3
(N
), N
);
16019 Visit_Field
(Field4
(N
), N
);
16020 Visit_Field
(Field5
(N
), N
);
16023 -- Start of processing for New_Copy_Tree
16028 -- See if we should use hash table
16030 if No
(Actual_Map
) then
16031 NCT_Hash_Tables_Used
:= False;
16038 NCT_Table_Entries
:= 0;
16040 Elmt
:= First_Elmt
(Actual_Map
);
16041 while Present
(Elmt
) loop
16042 NCT_Table_Entries
:= NCT_Table_Entries
+ 1;
16047 if NCT_Table_Entries
> NCT_Hash_Threshold
then
16048 Build_NCT_Hash_Tables
;
16050 NCT_Hash_Tables_Used
:= False;
16055 -- Hash table set up if required, now start phase one by visiting
16056 -- top node (we will recursively visit the descendents).
16058 Visit_Node
(Source
);
16060 -- Now the second phase of the copy can start. First we process
16061 -- all the mapped entities, copying their descendents.
16063 if Present
(Actual_Map
) then
16066 New_Itype
: Entity_Id
;
16068 Elmt
:= First_Elmt
(Actual_Map
);
16069 while Present
(Elmt
) loop
16071 New_Itype
:= Node
(Elmt
);
16073 if Is_Itype
(New_Itype
) then
16074 Copy_Itype_With_Replacement
(New_Itype
);
16081 -- Now we can copy the actual tree
16083 return Copy_Node_With_Replacement
(Source
);
16086 -------------------------
16087 -- New_External_Entity --
16088 -------------------------
16090 function New_External_Entity
16091 (Kind
: Entity_Kind
;
16092 Scope_Id
: Entity_Id
;
16093 Sloc_Value
: Source_Ptr
;
16094 Related_Id
: Entity_Id
;
16095 Suffix
: Character;
16096 Suffix_Index
: Nat
:= 0;
16097 Prefix
: Character := ' ') return Entity_Id
16099 N
: constant Entity_Id
:=
16100 Make_Defining_Identifier
(Sloc_Value
,
16102 (Chars
(Related_Id
), Suffix
, Suffix_Index
, Prefix
));
16105 Set_Ekind
(N
, Kind
);
16106 Set_Is_Internal
(N
, True);
16107 Append_Entity
(N
, Scope_Id
);
16108 Set_Public_Status
(N
);
16110 if Kind
in Type_Kind
then
16111 Init_Size_Align
(N
);
16115 end New_External_Entity
;
16117 -------------------------
16118 -- New_Internal_Entity --
16119 -------------------------
16121 function New_Internal_Entity
16122 (Kind
: Entity_Kind
;
16123 Scope_Id
: Entity_Id
;
16124 Sloc_Value
: Source_Ptr
;
16125 Id_Char
: Character) return Entity_Id
16127 N
: constant Entity_Id
:= Make_Temporary
(Sloc_Value
, Id_Char
);
16130 Set_Ekind
(N
, Kind
);
16131 Set_Is_Internal
(N
, True);
16132 Append_Entity
(N
, Scope_Id
);
16134 if Kind
in Type_Kind
then
16135 Init_Size_Align
(N
);
16139 end New_Internal_Entity
;
16145 function Next_Actual
(Actual_Id
: Node_Id
) return Node_Id
is
16149 -- If we are pointing at a positional parameter, it is a member of a
16150 -- node list (the list of parameters), and the next parameter is the
16151 -- next node on the list, unless we hit a parameter association, then
16152 -- we shift to using the chain whose head is the First_Named_Actual in
16153 -- the parent, and then is threaded using the Next_Named_Actual of the
16154 -- Parameter_Association. All this fiddling is because the original node
16155 -- list is in the textual call order, and what we need is the
16156 -- declaration order.
16158 if Is_List_Member
(Actual_Id
) then
16159 N
:= Next
(Actual_Id
);
16161 if Nkind
(N
) = N_Parameter_Association
then
16162 return First_Named_Actual
(Parent
(Actual_Id
));
16168 return Next_Named_Actual
(Parent
(Actual_Id
));
16172 procedure Next_Actual
(Actual_Id
: in out Node_Id
) is
16174 Actual_Id
:= Next_Actual
(Actual_Id
);
16177 -----------------------
16178 -- Normalize_Actuals --
16179 -----------------------
16181 -- Chain actuals according to formals of subprogram. If there are no named
16182 -- associations, the chain is simply the list of Parameter Associations,
16183 -- since the order is the same as the declaration order. If there are named
16184 -- associations, then the First_Named_Actual field in the N_Function_Call
16185 -- or N_Procedure_Call_Statement node points to the Parameter_Association
16186 -- node for the parameter that comes first in declaration order. The
16187 -- remaining named parameters are then chained in declaration order using
16188 -- Next_Named_Actual.
16190 -- This routine also verifies that the number of actuals is compatible with
16191 -- the number and default values of formals, but performs no type checking
16192 -- (type checking is done by the caller).
16194 -- If the matching succeeds, Success is set to True and the caller proceeds
16195 -- with type-checking. If the match is unsuccessful, then Success is set to
16196 -- False, and the caller attempts a different interpretation, if there is
16199 -- If the flag Report is on, the call is not overloaded, and a failure to
16200 -- match can be reported here, rather than in the caller.
16202 procedure Normalize_Actuals
16206 Success
: out Boolean)
16208 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
16209 Actual
: Node_Id
:= Empty
;
16210 Formal
: Entity_Id
;
16211 Last
: Node_Id
:= Empty
;
16212 First_Named
: Node_Id
:= Empty
;
16215 Formals_To_Match
: Integer := 0;
16216 Actuals_To_Match
: Integer := 0;
16218 procedure Chain
(A
: Node_Id
);
16219 -- Add named actual at the proper place in the list, using the
16220 -- Next_Named_Actual link.
16222 function Reporting
return Boolean;
16223 -- Determines if an error is to be reported. To report an error, we
16224 -- need Report to be True, and also we do not report errors caused
16225 -- by calls to init procs that occur within other init procs. Such
16226 -- errors must always be cascaded errors, since if all the types are
16227 -- declared correctly, the compiler will certainly build decent calls.
16233 procedure Chain
(A
: Node_Id
) is
16237 -- Call node points to first actual in list
16239 Set_First_Named_Actual
(N
, Explicit_Actual_Parameter
(A
));
16242 Set_Next_Named_Actual
(Last
, Explicit_Actual_Parameter
(A
));
16246 Set_Next_Named_Actual
(Last
, Empty
);
16253 function Reporting
return Boolean is
16258 elsif not Within_Init_Proc
then
16261 elsif Is_Init_Proc
(Entity
(Name
(N
))) then
16269 -- Start of processing for Normalize_Actuals
16272 if Is_Access_Type
(S
) then
16274 -- The name in the call is a function call that returns an access
16275 -- to subprogram. The designated type has the list of formals.
16277 Formal
:= First_Formal
(Designated_Type
(S
));
16279 Formal
:= First_Formal
(S
);
16282 while Present
(Formal
) loop
16283 Formals_To_Match
:= Formals_To_Match
+ 1;
16284 Next_Formal
(Formal
);
16287 -- Find if there is a named association, and verify that no positional
16288 -- associations appear after named ones.
16290 if Present
(Actuals
) then
16291 Actual
:= First
(Actuals
);
16294 while Present
(Actual
)
16295 and then Nkind
(Actual
) /= N_Parameter_Association
16297 Actuals_To_Match
:= Actuals_To_Match
+ 1;
16301 if No
(Actual
) and Actuals_To_Match
= Formals_To_Match
then
16303 -- Most common case: positional notation, no defaults
16308 elsif Actuals_To_Match
> Formals_To_Match
then
16310 -- Too many actuals: will not work
16313 if Is_Entity_Name
(Name
(N
)) then
16314 Error_Msg_N
("too many arguments in call to&", Name
(N
));
16316 Error_Msg_N
("too many arguments in call", N
);
16324 First_Named
:= Actual
;
16326 while Present
(Actual
) loop
16327 if Nkind
(Actual
) /= N_Parameter_Association
then
16329 ("positional parameters not allowed after named ones", Actual
);
16334 Actuals_To_Match
:= Actuals_To_Match
+ 1;
16340 if Present
(Actuals
) then
16341 Actual
:= First
(Actuals
);
16344 Formal
:= First_Formal
(S
);
16345 while Present
(Formal
) loop
16347 -- Match the formals in order. If the corresponding actual is
16348 -- positional, nothing to do. Else scan the list of named actuals
16349 -- to find the one with the right name.
16351 if Present
(Actual
)
16352 and then Nkind
(Actual
) /= N_Parameter_Association
16355 Actuals_To_Match
:= Actuals_To_Match
- 1;
16356 Formals_To_Match
:= Formals_To_Match
- 1;
16359 -- For named parameters, search the list of actuals to find
16360 -- one that matches the next formal name.
16362 Actual
:= First_Named
;
16364 while Present
(Actual
) loop
16365 if Chars
(Selector_Name
(Actual
)) = Chars
(Formal
) then
16368 Actuals_To_Match
:= Actuals_To_Match
- 1;
16369 Formals_To_Match
:= Formals_To_Match
- 1;
16377 if Ekind
(Formal
) /= E_In_Parameter
16378 or else No
(Default_Value
(Formal
))
16381 if (Comes_From_Source
(S
)
16382 or else Sloc
(S
) = Standard_Location
)
16383 and then Is_Overloadable
(S
)
16387 Nkind_In
(Parent
(N
), N_Procedure_Call_Statement
,
16389 N_Parameter_Association
)
16390 and then Ekind
(S
) /= E_Function
16392 Set_Etype
(N
, Etype
(S
));
16395 Error_Msg_Name_1
:= Chars
(S
);
16396 Error_Msg_Sloc
:= Sloc
(S
);
16398 ("missing argument for parameter & "
16399 & "in call to % declared #", N
, Formal
);
16402 elsif Is_Overloadable
(S
) then
16403 Error_Msg_Name_1
:= Chars
(S
);
16405 -- Point to type derivation that generated the
16408 Error_Msg_Sloc
:= Sloc
(Parent
(S
));
16411 ("missing argument for parameter & "
16412 & "in call to % (inherited) #", N
, Formal
);
16416 ("missing argument for parameter &", N
, Formal
);
16424 Formals_To_Match
:= Formals_To_Match
- 1;
16429 Next_Formal
(Formal
);
16432 if Formals_To_Match
= 0 and then Actuals_To_Match
= 0 then
16439 -- Find some superfluous named actual that did not get
16440 -- attached to the list of associations.
16442 Actual
:= First
(Actuals
);
16443 while Present
(Actual
) loop
16444 if Nkind
(Actual
) = N_Parameter_Association
16445 and then Actual
/= Last
16446 and then No
(Next_Named_Actual
(Actual
))
16448 Error_Msg_N
("unmatched actual & in call",
16449 Selector_Name
(Actual
));
16460 end Normalize_Actuals
;
16462 --------------------------------
16463 -- Note_Possible_Modification --
16464 --------------------------------
16466 procedure Note_Possible_Modification
(N
: Node_Id
; Sure
: Boolean) is
16467 Modification_Comes_From_Source
: constant Boolean :=
16468 Comes_From_Source
(Parent
(N
));
16474 -- Loop to find referenced entity, if there is one
16480 if Is_Entity_Name
(Exp
) then
16481 Ent
:= Entity
(Exp
);
16483 -- If the entity is missing, it is an undeclared identifier,
16484 -- and there is nothing to annotate.
16490 elsif Nkind
(Exp
) = N_Explicit_Dereference
then
16492 P
: constant Node_Id
:= Prefix
(Exp
);
16495 -- In formal verification mode, keep track of all reads and
16496 -- writes through explicit dereferences.
16498 if GNATprove_Mode
then
16499 SPARK_Specific
.Generate_Dereference
(N
, 'm');
16502 if Nkind
(P
) = N_Selected_Component
16503 and then Present
(Entry_Formal
(Entity
(Selector_Name
(P
))))
16505 -- Case of a reference to an entry formal
16507 Ent
:= Entry_Formal
(Entity
(Selector_Name
(P
)));
16509 elsif Nkind
(P
) = N_Identifier
16510 and then Nkind
(Parent
(Entity
(P
))) = N_Object_Declaration
16511 and then Present
(Expression
(Parent
(Entity
(P
))))
16512 and then Nkind
(Expression
(Parent
(Entity
(P
)))) =
16515 -- Case of a reference to a value on which side effects have
16518 Exp
:= Prefix
(Expression
(Parent
(Entity
(P
))));
16526 elsif Nkind_In
(Exp
, N_Type_Conversion
,
16527 N_Unchecked_Type_Conversion
)
16529 Exp
:= Expression
(Exp
);
16532 elsif Nkind_In
(Exp
, N_Slice
,
16533 N_Indexed_Component
,
16534 N_Selected_Component
)
16536 -- Special check, if the prefix is an access type, then return
16537 -- since we are modifying the thing pointed to, not the prefix.
16538 -- When we are expanding, most usually the prefix is replaced
16539 -- by an explicit dereference, and this test is not needed, but
16540 -- in some cases (notably -gnatc mode and generics) when we do
16541 -- not do full expansion, we need this special test.
16543 if Is_Access_Type
(Etype
(Prefix
(Exp
))) then
16546 -- Otherwise go to prefix and keep going
16549 Exp
:= Prefix
(Exp
);
16553 -- All other cases, not a modification
16559 -- Now look for entity being referenced
16561 if Present
(Ent
) then
16562 if Is_Object
(Ent
) then
16563 if Comes_From_Source
(Exp
)
16564 or else Modification_Comes_From_Source
16566 -- Give warning if pragma unmodified given and we are
16567 -- sure this is a modification.
16569 if Has_Pragma_Unmodified
(Ent
) and then Sure
then
16570 Error_Msg_NE
("??pragma Unmodified given for &!", N
, Ent
);
16573 Set_Never_Set_In_Source
(Ent
, False);
16576 Set_Is_True_Constant
(Ent
, False);
16577 Set_Current_Value
(Ent
, Empty
);
16578 Set_Is_Known_Null
(Ent
, False);
16580 if not Can_Never_Be_Null
(Ent
) then
16581 Set_Is_Known_Non_Null
(Ent
, False);
16584 -- Follow renaming chain
16586 if (Ekind
(Ent
) = E_Variable
or else Ekind
(Ent
) = E_Constant
)
16587 and then Present
(Renamed_Object
(Ent
))
16589 Exp
:= Renamed_Object
(Ent
);
16591 -- If the entity is the loop variable in an iteration over
16592 -- a container, retrieve container expression to indicate
16593 -- possible modification.
16595 if Present
(Related_Expression
(Ent
))
16596 and then Nkind
(Parent
(Related_Expression
(Ent
))) =
16597 N_Iterator_Specification
16599 Exp
:= Original_Node
(Related_Expression
(Ent
));
16604 -- The expression may be the renaming of a subcomponent of an
16605 -- array or container. The assignment to the subcomponent is
16606 -- a modification of the container.
16608 elsif Comes_From_Source
(Original_Node
(Exp
))
16609 and then Nkind_In
(Original_Node
(Exp
), N_Selected_Component
,
16610 N_Indexed_Component
)
16612 Exp
:= Prefix
(Original_Node
(Exp
));
16616 -- Generate a reference only if the assignment comes from
16617 -- source. This excludes, for example, calls to a dispatching
16618 -- assignment operation when the left-hand side is tagged. In
16619 -- GNATprove mode, we need those references also on generated
16620 -- code, as these are used to compute the local effects of
16623 if Modification_Comes_From_Source
or GNATprove_Mode
then
16624 Generate_Reference
(Ent
, Exp
, 'm');
16626 -- If the target of the assignment is the bound variable
16627 -- in an iterator, indicate that the corresponding array
16628 -- or container is also modified.
16630 if Ada_Version
>= Ada_2012
16631 and then Nkind
(Parent
(Ent
)) = N_Iterator_Specification
16634 Domain
: constant Node_Id
:= Name
(Parent
(Ent
));
16637 -- TBD : in the full version of the construct, the
16638 -- domain of iteration can be given by an expression.
16640 if Is_Entity_Name
(Domain
) then
16641 Generate_Reference
(Entity
(Domain
), Exp
, 'm');
16642 Set_Is_True_Constant
(Entity
(Domain
), False);
16643 Set_Never_Set_In_Source
(Entity
(Domain
), False);
16652 -- If we are sure this is a modification from source, and we know
16653 -- this modifies a constant, then give an appropriate warning.
16656 and then Modification_Comes_From_Source
16657 and then Overlays_Constant
(Ent
)
16658 and then Address_Clause_Overlay_Warnings
16661 Addr
: constant Node_Id
:= Address_Clause
(Ent
);
16666 Find_Overlaid_Entity
(Addr
, O_Ent
, Off
);
16668 Error_Msg_Sloc
:= Sloc
(Addr
);
16670 ("??constant& may be modified via address clause#",
16681 end Note_Possible_Modification
;
16683 -------------------------
16684 -- Object_Access_Level --
16685 -------------------------
16687 -- Returns the static accessibility level of the view denoted by Obj. Note
16688 -- that the value returned is the result of a call to Scope_Depth. Only
16689 -- scope depths associated with dynamic scopes can actually be returned.
16690 -- Since only relative levels matter for accessibility checking, the fact
16691 -- that the distance between successive levels of accessibility is not
16692 -- always one is immaterial (invariant: if level(E2) is deeper than
16693 -- level(E1), then Scope_Depth(E1) < Scope_Depth(E2)).
16695 function Object_Access_Level
(Obj
: Node_Id
) return Uint
is
16696 function Is_Interface_Conversion
(N
: Node_Id
) return Boolean;
16697 -- Determine whether N is a construct of the form
16698 -- Some_Type (Operand._tag'Address)
16699 -- This construct appears in the context of dispatching calls.
16701 function Reference_To
(Obj
: Node_Id
) return Node_Id
;
16702 -- An explicit dereference is created when removing side-effects from
16703 -- expressions for constraint checking purposes. In this case a local
16704 -- access type is created for it. The correct access level is that of
16705 -- the original source node. We detect this case by noting that the
16706 -- prefix of the dereference is created by an object declaration whose
16707 -- initial expression is a reference.
16709 -----------------------------
16710 -- Is_Interface_Conversion --
16711 -----------------------------
16713 function Is_Interface_Conversion
(N
: Node_Id
) return Boolean is
16715 return Nkind
(N
) = N_Unchecked_Type_Conversion
16716 and then Nkind
(Expression
(N
)) = N_Attribute_Reference
16717 and then Attribute_Name
(Expression
(N
)) = Name_Address
;
16718 end Is_Interface_Conversion
;
16724 function Reference_To
(Obj
: Node_Id
) return Node_Id
is
16725 Pref
: constant Node_Id
:= Prefix
(Obj
);
16727 if Is_Entity_Name
(Pref
)
16728 and then Nkind
(Parent
(Entity
(Pref
))) = N_Object_Declaration
16729 and then Present
(Expression
(Parent
(Entity
(Pref
))))
16730 and then Nkind
(Expression
(Parent
(Entity
(Pref
)))) = N_Reference
16732 return (Prefix
(Expression
(Parent
(Entity
(Pref
)))));
16742 -- Start of processing for Object_Access_Level
16745 if Nkind
(Obj
) = N_Defining_Identifier
16746 or else Is_Entity_Name
(Obj
)
16748 if Nkind
(Obj
) = N_Defining_Identifier
then
16754 if Is_Prival
(E
) then
16755 E
:= Prival_Link
(E
);
16758 -- If E is a type then it denotes a current instance. For this case
16759 -- we add one to the normal accessibility level of the type to ensure
16760 -- that current instances are treated as always being deeper than
16761 -- than the level of any visible named access type (see 3.10.2(21)).
16763 if Is_Type
(E
) then
16764 return Type_Access_Level
(E
) + 1;
16766 elsif Present
(Renamed_Object
(E
)) then
16767 return Object_Access_Level
(Renamed_Object
(E
));
16769 -- Similarly, if E is a component of the current instance of a
16770 -- protected type, any instance of it is assumed to be at a deeper
16771 -- level than the type. For a protected object (whose type is an
16772 -- anonymous protected type) its components are at the same level
16773 -- as the type itself.
16775 elsif not Is_Overloadable
(E
)
16776 and then Ekind
(Scope
(E
)) = E_Protected_Type
16777 and then Comes_From_Source
(Scope
(E
))
16779 return Type_Access_Level
(Scope
(E
)) + 1;
16782 -- Aliased formals of functions take their access level from the
16783 -- point of call, i.e. require a dynamic check. For static check
16784 -- purposes, this is smaller than the level of the subprogram
16785 -- itself. For procedures the aliased makes no difference.
16788 and then Is_Aliased
(E
)
16789 and then Ekind
(Scope
(E
)) = E_Function
16791 return Type_Access_Level
(Etype
(E
));
16794 return Scope_Depth
(Enclosing_Dynamic_Scope
(E
));
16798 elsif Nkind
(Obj
) = N_Selected_Component
then
16799 if Is_Access_Type
(Etype
(Prefix
(Obj
))) then
16800 return Type_Access_Level
(Etype
(Prefix
(Obj
)));
16802 return Object_Access_Level
(Prefix
(Obj
));
16805 elsif Nkind
(Obj
) = N_Indexed_Component
then
16806 if Is_Access_Type
(Etype
(Prefix
(Obj
))) then
16807 return Type_Access_Level
(Etype
(Prefix
(Obj
)));
16809 return Object_Access_Level
(Prefix
(Obj
));
16812 elsif Nkind
(Obj
) = N_Explicit_Dereference
then
16814 -- If the prefix is a selected access discriminant then we make a
16815 -- recursive call on the prefix, which will in turn check the level
16816 -- of the prefix object of the selected discriminant.
16818 -- In Ada 2012, if the discriminant has implicit dereference and
16819 -- the context is a selected component, treat this as an object of
16820 -- unknown scope (see below). This is necessary in compile-only mode;
16821 -- otherwise expansion will already have transformed the prefix into
16824 if Nkind
(Prefix
(Obj
)) = N_Selected_Component
16825 and then Ekind
(Etype
(Prefix
(Obj
))) = E_Anonymous_Access_Type
16827 Ekind
(Entity
(Selector_Name
(Prefix
(Obj
)))) = E_Discriminant
16829 (not Has_Implicit_Dereference
16830 (Entity
(Selector_Name
(Prefix
(Obj
))))
16831 or else Nkind
(Parent
(Obj
)) /= N_Selected_Component
)
16833 return Object_Access_Level
(Prefix
(Obj
));
16835 -- Detect an interface conversion in the context of a dispatching
16836 -- call. Use the original form of the conversion to find the access
16837 -- level of the operand.
16839 elsif Is_Interface
(Etype
(Obj
))
16840 and then Is_Interface_Conversion
(Prefix
(Obj
))
16841 and then Nkind
(Original_Node
(Obj
)) = N_Type_Conversion
16843 return Object_Access_Level
(Original_Node
(Obj
));
16845 elsif not Comes_From_Source
(Obj
) then
16847 Ref
: constant Node_Id
:= Reference_To
(Obj
);
16849 if Present
(Ref
) then
16850 return Object_Access_Level
(Ref
);
16852 return Type_Access_Level
(Etype
(Prefix
(Obj
)));
16857 return Type_Access_Level
(Etype
(Prefix
(Obj
)));
16860 elsif Nkind_In
(Obj
, N_Type_Conversion
, N_Unchecked_Type_Conversion
) then
16861 return Object_Access_Level
(Expression
(Obj
));
16863 elsif Nkind
(Obj
) = N_Function_Call
then
16865 -- Function results are objects, so we get either the access level of
16866 -- the function or, in the case of an indirect call, the level of the
16867 -- access-to-subprogram type. (This code is used for Ada 95, but it
16868 -- looks wrong, because it seems that we should be checking the level
16869 -- of the call itself, even for Ada 95. However, using the Ada 2005
16870 -- version of the code causes regressions in several tests that are
16871 -- compiled with -gnat95. ???)
16873 if Ada_Version
< Ada_2005
then
16874 if Is_Entity_Name
(Name
(Obj
)) then
16875 return Subprogram_Access_Level
(Entity
(Name
(Obj
)));
16877 return Type_Access_Level
(Etype
(Prefix
(Name
(Obj
))));
16880 -- For Ada 2005, the level of the result object of a function call is
16881 -- defined to be the level of the call's innermost enclosing master.
16882 -- We determine that by querying the depth of the innermost enclosing
16886 Return_Master_Scope_Depth_Of_Call
: declare
16888 function Innermost_Master_Scope_Depth
16889 (N
: Node_Id
) return Uint
;
16890 -- Returns the scope depth of the given node's innermost
16891 -- enclosing dynamic scope (effectively the accessibility
16892 -- level of the innermost enclosing master).
16894 ----------------------------------
16895 -- Innermost_Master_Scope_Depth --
16896 ----------------------------------
16898 function Innermost_Master_Scope_Depth
16899 (N
: Node_Id
) return Uint
16901 Node_Par
: Node_Id
:= Parent
(N
);
16904 -- Locate the nearest enclosing node (by traversing Parents)
16905 -- that Defining_Entity can be applied to, and return the
16906 -- depth of that entity's nearest enclosing dynamic scope.
16908 while Present
(Node_Par
) loop
16909 case Nkind
(Node_Par
) is
16910 when N_Component_Declaration |
16911 N_Entry_Declaration |
16912 N_Formal_Object_Declaration |
16913 N_Formal_Type_Declaration |
16914 N_Full_Type_Declaration |
16915 N_Incomplete_Type_Declaration |
16916 N_Loop_Parameter_Specification |
16917 N_Object_Declaration |
16918 N_Protected_Type_Declaration |
16919 N_Private_Extension_Declaration |
16920 N_Private_Type_Declaration |
16921 N_Subtype_Declaration |
16922 N_Function_Specification |
16923 N_Procedure_Specification |
16924 N_Task_Type_Declaration |
16926 N_Generic_Instantiation |
16928 N_Implicit_Label_Declaration |
16929 N_Package_Declaration |
16930 N_Single_Task_Declaration |
16931 N_Subprogram_Declaration |
16932 N_Generic_Declaration |
16933 N_Renaming_Declaration |
16934 N_Block_Statement |
16935 N_Formal_Subprogram_Declaration |
16936 N_Abstract_Subprogram_Declaration |
16938 N_Exception_Declaration |
16939 N_Formal_Package_Declaration |
16940 N_Number_Declaration |
16941 N_Package_Specification |
16942 N_Parameter_Specification |
16943 N_Single_Protected_Declaration |
16947 (Nearest_Dynamic_Scope
16948 (Defining_Entity
(Node_Par
)));
16954 Node_Par
:= Parent
(Node_Par
);
16957 pragma Assert
(False);
16959 -- Should never reach the following return
16961 return Scope_Depth
(Current_Scope
) + 1;
16962 end Innermost_Master_Scope_Depth
;
16964 -- Start of processing for Return_Master_Scope_Depth_Of_Call
16967 return Innermost_Master_Scope_Depth
(Obj
);
16968 end Return_Master_Scope_Depth_Of_Call
;
16971 -- For convenience we handle qualified expressions, even though they
16972 -- aren't technically object names.
16974 elsif Nkind
(Obj
) = N_Qualified_Expression
then
16975 return Object_Access_Level
(Expression
(Obj
));
16977 -- Ditto for aggregates. They have the level of the temporary that
16978 -- will hold their value.
16980 elsif Nkind
(Obj
) = N_Aggregate
then
16981 return Object_Access_Level
(Current_Scope
);
16983 -- Otherwise return the scope level of Standard. (If there are cases
16984 -- that fall through to this point they will be treated as having
16985 -- global accessibility for now. ???)
16988 return Scope_Depth
(Standard_Standard
);
16990 end Object_Access_Level
;
16992 ---------------------------------
16993 -- Original_Aspect_Pragma_Name --
16994 ---------------------------------
16996 function Original_Aspect_Pragma_Name
(N
: Node_Id
) return Name_Id
is
16998 Item_Nam
: Name_Id
;
17001 pragma Assert
(Nkind_In
(N
, N_Aspect_Specification
, N_Pragma
));
17005 -- The pragma was generated to emulate an aspect, use the original
17006 -- aspect specification.
17008 if Nkind
(Item
) = N_Pragma
and then From_Aspect_Specification
(Item
) then
17009 Item
:= Corresponding_Aspect
(Item
);
17012 -- Retrieve the name of the aspect/pragma. Note that Pre, Pre_Class,
17013 -- Post and Post_Class rewrite their pragma identifier to preserve the
17015 -- ??? this is kludgey
17017 if Nkind
(Item
) = N_Pragma
then
17018 Item_Nam
:= Chars
(Original_Node
(Pragma_Identifier
(Item
)));
17021 pragma Assert
(Nkind
(Item
) = N_Aspect_Specification
);
17022 Item_Nam
:= Chars
(Identifier
(Item
));
17025 -- Deal with 'Class by converting the name to its _XXX form
17027 if Class_Present
(Item
) then
17028 if Item_Nam
= Name_Invariant
then
17029 Item_Nam
:= Name_uInvariant
;
17031 elsif Item_Nam
= Name_Post
then
17032 Item_Nam
:= Name_uPost
;
17034 elsif Item_Nam
= Name_Pre
then
17035 Item_Nam
:= Name_uPre
;
17037 elsif Nam_In
(Item_Nam
, Name_Type_Invariant
,
17038 Name_Type_Invariant_Class
)
17040 Item_Nam
:= Name_uType_Invariant
;
17042 -- Nothing to do for other cases (e.g. a Check that derived from
17043 -- Pre_Class and has the flag set). Also we do nothing if the name
17044 -- is already in special _xxx form.
17050 end Original_Aspect_Pragma_Name
;
17052 --------------------------------------
17053 -- Original_Corresponding_Operation --
17054 --------------------------------------
17056 function Original_Corresponding_Operation
(S
: Entity_Id
) return Entity_Id
17058 Typ
: constant Entity_Id
:= Find_Dispatching_Type
(S
);
17061 -- If S is an inherited primitive S2 the original corresponding
17062 -- operation of S is the original corresponding operation of S2
17064 if Present
(Alias
(S
))
17065 and then Find_Dispatching_Type
(Alias
(S
)) /= Typ
17067 return Original_Corresponding_Operation
(Alias
(S
));
17069 -- If S overrides an inherited subprogram S2 the original corresponding
17070 -- operation of S is the original corresponding operation of S2
17072 elsif Present
(Overridden_Operation
(S
)) then
17073 return Original_Corresponding_Operation
(Overridden_Operation
(S
));
17075 -- otherwise it is S itself
17080 end Original_Corresponding_Operation
;
17082 ----------------------
17083 -- Policy_In_Effect --
17084 ----------------------
17086 function Policy_In_Effect
(Policy
: Name_Id
) return Name_Id
is
17087 function Policy_In_List
(List
: Node_Id
) return Name_Id
;
17088 -- Determine the mode of a policy in a N_Pragma list
17090 --------------------
17091 -- Policy_In_List --
17092 --------------------
17094 function Policy_In_List
(List
: Node_Id
) return Name_Id
is
17101 while Present
(Prag
) loop
17102 Arg1
:= First
(Pragma_Argument_Associations
(Prag
));
17103 Arg2
:= Next
(Arg1
);
17105 Arg1
:= Get_Pragma_Arg
(Arg1
);
17106 Arg2
:= Get_Pragma_Arg
(Arg2
);
17108 -- The current Check_Policy pragma matches the requested policy or
17109 -- appears in the single argument form (Assertion, policy_id).
17111 if Nam_In
(Chars
(Arg1
), Name_Assertion
, Policy
) then
17112 return Chars
(Arg2
);
17115 Prag
:= Next_Pragma
(Prag
);
17119 end Policy_In_List
;
17125 -- Start of processing for Policy_In_Effect
17128 if not Is_Valid_Assertion_Kind
(Policy
) then
17129 raise Program_Error
;
17132 -- Inspect all policy pragmas that appear within scopes (if any)
17134 Kind
:= Policy_In_List
(Check_Policy_List
);
17136 -- Inspect all configuration policy pragmas (if any)
17138 if Kind
= No_Name
then
17139 Kind
:= Policy_In_List
(Check_Policy_List_Config
);
17142 -- The context lacks policy pragmas, determine the mode based on whether
17143 -- assertions are enabled at the configuration level. This ensures that
17144 -- the policy is preserved when analyzing generics.
17146 if Kind
= No_Name
then
17147 if Assertions_Enabled_Config
then
17148 Kind
:= Name_Check
;
17150 Kind
:= Name_Ignore
;
17155 end Policy_In_Effect
;
17157 ----------------------------------
17158 -- Predicate_Tests_On_Arguments --
17159 ----------------------------------
17161 function Predicate_Tests_On_Arguments
(Subp
: Entity_Id
) return Boolean is
17163 -- Always test predicates on indirect call
17165 if Ekind
(Subp
) = E_Subprogram_Type
then
17168 -- Do not test predicates on call to generated default Finalize, since
17169 -- we are not interested in whether something we are finalizing (and
17170 -- typically destroying) satisfies its predicates.
17172 elsif Chars
(Subp
) = Name_Finalize
17173 and then not Comes_From_Source
(Subp
)
17177 -- Do not test predicates on any internally generated routines
17179 elsif Is_Internal_Name
(Chars
(Subp
)) then
17182 -- Do not test predicates on call to Init_Proc, since if needed the
17183 -- predicate test will occur at some other point.
17185 elsif Is_Init_Proc
(Subp
) then
17188 -- Do not test predicates on call to predicate function, since this
17189 -- would cause infinite recursion.
17191 elsif Ekind
(Subp
) = E_Function
17192 and then (Is_Predicate_Function
(Subp
)
17194 Is_Predicate_Function_M
(Subp
))
17198 -- For now, no other exceptions
17203 end Predicate_Tests_On_Arguments
;
17205 -----------------------
17206 -- Private_Component --
17207 -----------------------
17209 function Private_Component
(Type_Id
: Entity_Id
) return Entity_Id
is
17210 Ancestor
: constant Entity_Id
:= Base_Type
(Type_Id
);
17212 function Trace_Components
17214 Check
: Boolean) return Entity_Id
;
17215 -- Recursive function that does the work, and checks against circular
17216 -- definition for each subcomponent type.
17218 ----------------------
17219 -- Trace_Components --
17220 ----------------------
17222 function Trace_Components
17224 Check
: Boolean) return Entity_Id
17226 Btype
: constant Entity_Id
:= Base_Type
(T
);
17227 Component
: Entity_Id
;
17229 Candidate
: Entity_Id
:= Empty
;
17232 if Check
and then Btype
= Ancestor
then
17233 Error_Msg_N
("circular type definition", Type_Id
);
17237 if Is_Private_Type
(Btype
) and then not Is_Generic_Type
(Btype
) then
17238 if Present
(Full_View
(Btype
))
17239 and then Is_Record_Type
(Full_View
(Btype
))
17240 and then not Is_Frozen
(Btype
)
17242 -- To indicate that the ancestor depends on a private type, the
17243 -- current Btype is sufficient. However, to check for circular
17244 -- definition we must recurse on the full view.
17246 Candidate
:= Trace_Components
(Full_View
(Btype
), True);
17248 if Candidate
= Any_Type
then
17258 elsif Is_Array_Type
(Btype
) then
17259 return Trace_Components
(Component_Type
(Btype
), True);
17261 elsif Is_Record_Type
(Btype
) then
17262 Component
:= First_Entity
(Btype
);
17263 while Present
(Component
)
17264 and then Comes_From_Source
(Component
)
17266 -- Skip anonymous types generated by constrained components
17268 if not Is_Type
(Component
) then
17269 P
:= Trace_Components
(Etype
(Component
), True);
17271 if Present
(P
) then
17272 if P
= Any_Type
then
17280 Next_Entity
(Component
);
17288 end Trace_Components
;
17290 -- Start of processing for Private_Component
17293 return Trace_Components
(Type_Id
, False);
17294 end Private_Component
;
17296 ---------------------------
17297 -- Primitive_Names_Match --
17298 ---------------------------
17300 function Primitive_Names_Match
(E1
, E2
: Entity_Id
) return Boolean is
17302 function Non_Internal_Name
(E
: Entity_Id
) return Name_Id
;
17303 -- Given an internal name, returns the corresponding non-internal name
17305 ------------------------
17306 -- Non_Internal_Name --
17307 ------------------------
17309 function Non_Internal_Name
(E
: Entity_Id
) return Name_Id
is
17311 Get_Name_String
(Chars
(E
));
17312 Name_Len
:= Name_Len
- 1;
17314 end Non_Internal_Name
;
17316 -- Start of processing for Primitive_Names_Match
17319 pragma Assert
(Present
(E1
) and then Present
(E2
));
17321 return Chars
(E1
) = Chars
(E2
)
17323 (not Is_Internal_Name
(Chars
(E1
))
17324 and then Is_Internal_Name
(Chars
(E2
))
17325 and then Non_Internal_Name
(E2
) = Chars
(E1
))
17327 (not Is_Internal_Name
(Chars
(E2
))
17328 and then Is_Internal_Name
(Chars
(E1
))
17329 and then Non_Internal_Name
(E1
) = Chars
(E2
))
17331 (Is_Predefined_Dispatching_Operation
(E1
)
17332 and then Is_Predefined_Dispatching_Operation
(E2
)
17333 and then Same_TSS
(E1
, E2
))
17335 (Is_Init_Proc
(E1
) and then Is_Init_Proc
(E2
));
17336 end Primitive_Names_Match
;
17338 -----------------------
17339 -- Process_End_Label --
17340 -----------------------
17342 procedure Process_End_Label
17351 Label_Ref
: Boolean;
17352 -- Set True if reference to end label itself is required
17355 -- Gets set to the operator symbol or identifier that references the
17356 -- entity Ent. For the child unit case, this is the identifier from the
17357 -- designator. For other cases, this is simply Endl.
17359 procedure Generate_Parent_Ref
(N
: Node_Id
; E
: Entity_Id
);
17360 -- N is an identifier node that appears as a parent unit reference in
17361 -- the case where Ent is a child unit. This procedure generates an
17362 -- appropriate cross-reference entry. E is the corresponding entity.
17364 -------------------------
17365 -- Generate_Parent_Ref --
17366 -------------------------
17368 procedure Generate_Parent_Ref
(N
: Node_Id
; E
: Entity_Id
) is
17370 -- If names do not match, something weird, skip reference
17372 if Chars
(E
) = Chars
(N
) then
17374 -- Generate the reference. We do NOT consider this as a reference
17375 -- for unreferenced symbol purposes.
17377 Generate_Reference
(E
, N
, 'r', Set_Ref
=> False, Force
=> True);
17379 if Style_Check
then
17380 Style
.Check_Identifier
(N
, E
);
17383 end Generate_Parent_Ref
;
17385 -- Start of processing for Process_End_Label
17388 -- If no node, ignore. This happens in some error situations, and
17389 -- also for some internally generated structures where no end label
17390 -- references are required in any case.
17396 -- Nothing to do if no End_Label, happens for internally generated
17397 -- constructs where we don't want an end label reference anyway. Also
17398 -- nothing to do if Endl is a string literal, which means there was
17399 -- some prior error (bad operator symbol)
17401 Endl
:= End_Label
(N
);
17403 if No
(Endl
) or else Nkind
(Endl
) = N_String_Literal
then
17407 -- Reference node is not in extended main source unit
17409 if not In_Extended_Main_Source_Unit
(N
) then
17411 -- Generally we do not collect references except for the extended
17412 -- main source unit. The one exception is the 'e' entry for a
17413 -- package spec, where it is useful for a client to have the
17414 -- ending information to define scopes.
17420 Label_Ref
:= False;
17422 -- For this case, we can ignore any parent references, but we
17423 -- need the package name itself for the 'e' entry.
17425 if Nkind
(Endl
) = N_Designator
then
17426 Endl
:= Identifier
(Endl
);
17430 -- Reference is in extended main source unit
17435 -- For designator, generate references for the parent entries
17437 if Nkind
(Endl
) = N_Designator
then
17439 -- Generate references for the prefix if the END line comes from
17440 -- source (otherwise we do not need these references) We climb the
17441 -- scope stack to find the expected entities.
17443 if Comes_From_Source
(Endl
) then
17444 Nam
:= Name
(Endl
);
17445 Scop
:= Current_Scope
;
17446 while Nkind
(Nam
) = N_Selected_Component
loop
17447 Scop
:= Scope
(Scop
);
17448 exit when No
(Scop
);
17449 Generate_Parent_Ref
(Selector_Name
(Nam
), Scop
);
17450 Nam
:= Prefix
(Nam
);
17453 if Present
(Scop
) then
17454 Generate_Parent_Ref
(Nam
, Scope
(Scop
));
17458 Endl
:= Identifier
(Endl
);
17462 -- If the end label is not for the given entity, then either we have
17463 -- some previous error, or this is a generic instantiation for which
17464 -- we do not need to make a cross-reference in this case anyway. In
17465 -- either case we simply ignore the call.
17467 if Chars
(Ent
) /= Chars
(Endl
) then
17471 -- If label was really there, then generate a normal reference and then
17472 -- adjust the location in the end label to point past the name (which
17473 -- should almost always be the semicolon).
17475 Loc
:= Sloc
(Endl
);
17477 if Comes_From_Source
(Endl
) then
17479 -- If a label reference is required, then do the style check and
17480 -- generate an l-type cross-reference entry for the label
17483 if Style_Check
then
17484 Style
.Check_Identifier
(Endl
, Ent
);
17487 Generate_Reference
(Ent
, Endl
, 'l', Set_Ref
=> False);
17490 -- Set the location to point past the label (normally this will
17491 -- mean the semicolon immediately following the label). This is
17492 -- done for the sake of the 'e' or 't' entry generated below.
17494 Get_Decoded_Name_String
(Chars
(Endl
));
17495 Set_Sloc
(Endl
, Sloc
(Endl
) + Source_Ptr
(Name_Len
));
17498 -- In SPARK mode, no missing label is allowed for packages and
17499 -- subprogram bodies. Detect those cases by testing whether
17500 -- Process_End_Label was called for a body (Typ = 't') or a package.
17502 if Restriction_Check_Required
(SPARK_05
)
17503 and then (Typ
= 't' or else Ekind
(Ent
) = E_Package
)
17505 Error_Msg_Node_1
:= Endl
;
17506 Check_SPARK_05_Restriction
17507 ("`END &` required", Endl
, Force
=> True);
17511 -- Now generate the e/t reference
17513 Generate_Reference
(Ent
, Endl
, Typ
, Set_Ref
=> False, Force
=> True);
17515 -- Restore Sloc, in case modified above, since we have an identifier
17516 -- and the normal Sloc should be left set in the tree.
17518 Set_Sloc
(Endl
, Loc
);
17519 end Process_End_Label
;
17521 ---------------------------------------
17522 -- Record_Possible_Part_Of_Reference --
17523 ---------------------------------------
17525 procedure Record_Possible_Part_Of_Reference
17526 (Var_Id
: Entity_Id
;
17529 Encap
: constant Entity_Id
:= Encapsulating_State
(Var_Id
);
17533 -- The variable is a constituent of a single protected/task type. Such
17534 -- a variable acts as a component of the type and must appear within a
17535 -- specific region (SPARK RM 9.3). Instead of recording the reference,
17536 -- verify its legality now.
17538 if Present
(Encap
) and then Is_Single_Concurrent_Object
(Encap
) then
17539 Check_Part_Of_Reference
(Var_Id
, Ref
);
17541 -- The variable is subject to pragma Part_Of and may eventually become a
17542 -- constituent of a single protected/task type. Record the reference to
17543 -- verify its placement when the contract of the variable is analyzed.
17545 elsif Present
(Get_Pragma
(Var_Id
, Pragma_Part_Of
)) then
17546 Refs
:= Part_Of_References
(Var_Id
);
17549 Refs
:= New_Elmt_List
;
17550 Set_Part_Of_References
(Var_Id
, Refs
);
17553 Append_Elmt
(Ref
, Refs
);
17555 end Record_Possible_Part_Of_Reference
;
17561 function Referenced
(Id
: Entity_Id
; Expr
: Node_Id
) return Boolean is
17562 Seen
: Boolean := False;
17564 function Is_Reference
(N
: Node_Id
) return Traverse_Result
;
17565 -- Determine whether node N denotes a reference to Id. If this is the
17566 -- case, set global flag Seen to True and stop the traversal.
17572 function Is_Reference
(N
: Node_Id
) return Traverse_Result
is
17574 if Is_Entity_Name
(N
)
17575 and then Present
(Entity
(N
))
17576 and then Entity
(N
) = Id
17585 procedure Inspect_Expression
is new Traverse_Proc
(Is_Reference
);
17587 -- Start of processing for Referenced
17590 Inspect_Expression
(Expr
);
17594 ------------------------------------
17595 -- References_Generic_Formal_Type --
17596 ------------------------------------
17598 function References_Generic_Formal_Type
(N
: Node_Id
) return Boolean is
17600 function Process
(N
: Node_Id
) return Traverse_Result
;
17601 -- Process one node in search for generic formal type
17607 function Process
(N
: Node_Id
) return Traverse_Result
is
17609 if Nkind
(N
) in N_Has_Entity
then
17611 E
: constant Entity_Id
:= Entity
(N
);
17613 if Present
(E
) then
17614 if Is_Generic_Type
(E
) then
17616 elsif Present
(Etype
(E
))
17617 and then Is_Generic_Type
(Etype
(E
))
17628 function Traverse
is new Traverse_Func
(Process
);
17629 -- Traverse tree to look for generic type
17632 if Inside_A_Generic
then
17633 return Traverse
(N
) = Abandon
;
17637 end References_Generic_Formal_Type
;
17639 --------------------
17640 -- Remove_Homonym --
17641 --------------------
17643 procedure Remove_Homonym
(E
: Entity_Id
) is
17644 Prev
: Entity_Id
:= Empty
;
17648 if E
= Current_Entity
(E
) then
17649 if Present
(Homonym
(E
)) then
17650 Set_Current_Entity
(Homonym
(E
));
17652 Set_Name_Entity_Id
(Chars
(E
), Empty
);
17656 H
:= Current_Entity
(E
);
17657 while Present
(H
) and then H
/= E
loop
17662 -- If E is not on the homonym chain, nothing to do
17664 if Present
(H
) then
17665 Set_Homonym
(Prev
, Homonym
(E
));
17668 end Remove_Homonym
;
17670 ------------------------------
17671 -- Remove_Overloaded_Entity --
17672 ------------------------------
17674 procedure Remove_Overloaded_Entity
(Id
: Entity_Id
) is
17675 procedure Remove_Primitive_Of
(Typ
: Entity_Id
);
17676 -- Remove primitive subprogram Id from the list of primitives that
17677 -- belong to type Typ.
17679 -------------------------
17680 -- Remove_Primitive_Of --
17681 -------------------------
17683 procedure Remove_Primitive_Of
(Typ
: Entity_Id
) is
17687 if Is_Tagged_Type
(Typ
) then
17688 Prims
:= Direct_Primitive_Operations
(Typ
);
17690 if Present
(Prims
) then
17691 Remove
(Prims
, Id
);
17694 end Remove_Primitive_Of
;
17698 Scop
: constant Entity_Id
:= Scope
(Id
);
17699 Formal
: Entity_Id
;
17700 Prev_Id
: Entity_Id
;
17702 -- Start of processing for Remove_Overloaded_Entity
17705 -- Remove the entity from the homonym chain. When the entity is the
17706 -- head of the chain, associate the entry in the name table with its
17707 -- homonym effectively making it the new head of the chain.
17709 if Current_Entity
(Id
) = Id
then
17710 Set_Name_Entity_Id
(Chars
(Id
), Homonym
(Id
));
17712 -- Otherwise link the previous and next homonyms
17715 Prev_Id
:= Current_Entity
(Id
);
17716 while Present
(Prev_Id
) and then Homonym
(Prev_Id
) /= Id
loop
17717 Prev_Id
:= Homonym
(Prev_Id
);
17720 Set_Homonym
(Prev_Id
, Homonym
(Id
));
17723 -- Remove the entity from the scope entity chain. When the entity is
17724 -- the head of the chain, set the next entity as the new head of the
17727 if First_Entity
(Scop
) = Id
then
17729 Set_First_Entity
(Scop
, Next_Entity
(Id
));
17731 -- Otherwise the entity is either in the middle of the chain or it acts
17732 -- as its tail. Traverse and link the previous and next entities.
17735 Prev_Id
:= First_Entity
(Scop
);
17736 while Present
(Prev_Id
) and then Next_Entity
(Prev_Id
) /= Id
loop
17737 Next_Entity
(Prev_Id
);
17740 Set_Next_Entity
(Prev_Id
, Next_Entity
(Id
));
17743 -- Handle the case where the entity acts as the tail of the scope entity
17746 if Last_Entity
(Scop
) = Id
then
17747 Set_Last_Entity
(Scop
, Prev_Id
);
17750 -- The entity denotes a primitive subprogram. Remove it from the list of
17751 -- primitives of the associated controlling type.
17753 if Ekind_In
(Id
, E_Function
, E_Procedure
) and then Is_Primitive
(Id
) then
17754 Formal
:= First_Formal
(Id
);
17755 while Present
(Formal
) loop
17756 if Is_Controlling_Formal
(Formal
) then
17757 Remove_Primitive_Of
(Etype
(Formal
));
17761 Next_Formal
(Formal
);
17764 if Ekind
(Id
) = E_Function
and then Has_Controlling_Result
(Id
) then
17765 Remove_Primitive_Of
(Etype
(Id
));
17768 end Remove_Overloaded_Entity
;
17770 ---------------------
17771 -- Rep_To_Pos_Flag --
17772 ---------------------
17774 function Rep_To_Pos_Flag
(E
: Entity_Id
; Loc
: Source_Ptr
) return Node_Id
is
17776 return New_Occurrence_Of
17777 (Boolean_Literals
(not Range_Checks_Suppressed
(E
)), Loc
);
17778 end Rep_To_Pos_Flag
;
17780 --------------------
17781 -- Require_Entity --
17782 --------------------
17784 procedure Require_Entity
(N
: Node_Id
) is
17786 if Is_Entity_Name
(N
) and then No
(Entity
(N
)) then
17787 if Total_Errors_Detected
/= 0 then
17788 Set_Entity
(N
, Any_Id
);
17790 raise Program_Error
;
17793 end Require_Entity
;
17795 -------------------------------
17796 -- Requires_State_Refinement --
17797 -------------------------------
17799 function Requires_State_Refinement
17800 (Spec_Id
: Entity_Id
;
17801 Body_Id
: Entity_Id
) return Boolean
17803 function Mode_Is_Off
(Prag
: Node_Id
) return Boolean;
17804 -- Given pragma SPARK_Mode, determine whether the mode is Off
17810 function Mode_Is_Off
(Prag
: Node_Id
) return Boolean is
17814 -- The default SPARK mode is On
17820 Mode
:= Get_Pragma_Arg
(First
(Pragma_Argument_Associations
(Prag
)));
17822 -- Then the pragma lacks an argument, the default mode is On
17827 return Chars
(Mode
) = Name_Off
;
17831 -- Start of processing for Requires_State_Refinement
17834 -- A package that does not define at least one abstract state cannot
17835 -- possibly require refinement.
17837 if No
(Abstract_States
(Spec_Id
)) then
17840 -- The package instroduces a single null state which does not merit
17843 elsif Has_Null_Abstract_State
(Spec_Id
) then
17846 -- Check whether the package body is subject to pragma SPARK_Mode. If
17847 -- it is and the mode is Off, the package body is considered to be in
17848 -- regular Ada and does not require refinement.
17850 elsif Mode_Is_Off
(SPARK_Pragma
(Body_Id
)) then
17853 -- The body's SPARK_Mode may be inherited from a similar pragma that
17854 -- appears in the private declarations of the spec. The pragma we are
17855 -- interested appears as the second entry in SPARK_Pragma.
17857 elsif Present
(SPARK_Pragma
(Spec_Id
))
17858 and then Mode_Is_Off
(Next_Pragma
(SPARK_Pragma
(Spec_Id
)))
17862 -- The spec defines at least one abstract state and the body has no way
17863 -- of circumventing the refinement.
17868 end Requires_State_Refinement
;
17870 ------------------------------
17871 -- Requires_Transient_Scope --
17872 ------------------------------
17874 -- A transient scope is required when variable-sized temporaries are
17875 -- allocated on the secondary stack, or when finalization actions must be
17876 -- generated before the next instruction.
17878 function Old_Requires_Transient_Scope
(Id
: Entity_Id
) return Boolean;
17879 function New_Requires_Transient_Scope
(Id
: Entity_Id
) return Boolean;
17880 -- ???We retain the old and new algorithms for Requires_Transient_Scope for
17881 -- the time being. New_Requires_Transient_Scope is used by default; the
17882 -- debug switch -gnatdQ can be used to do Old_Requires_Transient_Scope
17883 -- instead. The intent is to use this temporarily to measure before/after
17884 -- efficiency. Note: when this temporary code is removed, the documentation
17885 -- of dQ in debug.adb should be removed.
17887 procedure Results_Differ
(Id
: Entity_Id
);
17888 -- ???Debugging code. Called when the Old_ and New_ results differ. Will be
17889 -- removed when New_Requires_Transient_Scope becomes
17890 -- Requires_Transient_Scope and Old_Requires_Transient_Scope is eliminated.
17892 procedure Results_Differ
(Id
: Entity_Id
) is
17894 if False then -- False to disable; True for debugging
17895 Treepr
.Print_Tree_Node
(Id
);
17897 if Old_Requires_Transient_Scope
(Id
) =
17898 New_Requires_Transient_Scope
(Id
)
17900 raise Program_Error
;
17903 end Results_Differ
;
17905 function Requires_Transient_Scope
(Id
: Entity_Id
) return Boolean is
17906 Old_Result
: constant Boolean := Old_Requires_Transient_Scope
(Id
);
17909 if Debug_Flag_QQ
then
17914 New_Result
: constant Boolean := New_Requires_Transient_Scope
(Id
);
17917 -- Assert that we're not putting things on the secondary stack if we
17918 -- didn't before; we are trying to AVOID secondary stack when
17921 if not Old_Result
then
17922 pragma Assert
(not New_Result
);
17926 if New_Result
/= Old_Result
then
17927 Results_Differ
(Id
);
17932 end Requires_Transient_Scope
;
17934 ----------------------------------
17935 -- Old_Requires_Transient_Scope --
17936 ----------------------------------
17938 function Old_Requires_Transient_Scope
(Id
: Entity_Id
) return Boolean is
17939 Typ
: constant Entity_Id
:= Underlying_Type
(Id
);
17942 -- This is a private type which is not completed yet. This can only
17943 -- happen in a default expression (of a formal parameter or of a
17944 -- record component). Do not expand transient scope in this case.
17949 -- Do not expand transient scope for non-existent procedure return
17951 elsif Typ
= Standard_Void_Type
then
17954 -- Elementary types do not require a transient scope
17956 elsif Is_Elementary_Type
(Typ
) then
17959 -- Generally, indefinite subtypes require a transient scope, since the
17960 -- back end cannot generate temporaries, since this is not a valid type
17961 -- for declaring an object. It might be possible to relax this in the
17962 -- future, e.g. by declaring the maximum possible space for the type.
17964 elsif not Is_Definite_Subtype
(Typ
) then
17967 -- Functions returning tagged types may dispatch on result so their
17968 -- returned value is allocated on the secondary stack. Controlled
17969 -- type temporaries need finalization.
17971 elsif Is_Tagged_Type
(Typ
) or else Has_Controlled_Component
(Typ
) then
17976 elsif Is_Record_Type
(Typ
) then
17981 Comp
:= First_Entity
(Typ
);
17982 while Present
(Comp
) loop
17983 if Ekind
(Comp
) = E_Component
then
17985 -- ???It's not clear we need a full recursive call to
17986 -- Old_Requires_Transient_Scope here. Note that the
17987 -- following can't happen.
17989 pragma Assert
(Is_Definite_Subtype
(Etype
(Comp
)));
17990 pragma Assert
(not Has_Controlled_Component
(Etype
(Comp
)));
17992 if Old_Requires_Transient_Scope
(Etype
(Comp
)) then
17997 Next_Entity
(Comp
);
18003 -- String literal types never require transient scope
18005 elsif Ekind
(Typ
) = E_String_Literal_Subtype
then
18008 -- Array type. Note that we already know that this is a constrained
18009 -- array, since unconstrained arrays will fail the indefinite test.
18011 elsif Is_Array_Type
(Typ
) then
18013 -- If component type requires a transient scope, the array does too
18015 if Old_Requires_Transient_Scope
(Component_Type
(Typ
)) then
18018 -- Otherwise, we only need a transient scope if the size depends on
18019 -- the value of one or more discriminants.
18022 return Size_Depends_On_Discriminant
(Typ
);
18025 -- All other cases do not require a transient scope
18028 pragma Assert
(Is_Protected_Type
(Typ
) or else Is_Task_Type
(Typ
));
18031 end Old_Requires_Transient_Scope
;
18033 ----------------------------------
18034 -- New_Requires_Transient_Scope --
18035 ----------------------------------
18037 function New_Requires_Transient_Scope
(Id
: Entity_Id
) return Boolean is
18039 function Caller_Known_Size_Record
(Typ
: Entity_Id
) return Boolean;
18040 -- This is called for untagged records and protected types, with
18041 -- nondefaulted discriminants. Returns True if the size of function
18042 -- results is known at the call site, False otherwise. Returns False
18043 -- if there is a variant part that depends on the discriminants of
18044 -- this type, or if there is an array constrained by the discriminants
18045 -- of this type. ???Currently, this is overly conservative (the array
18046 -- could be nested inside some other record that is constrained by
18047 -- nondiscriminants). That is, the recursive calls are too conservative.
18049 function Large_Max_Size_Mutable
(Typ
: Entity_Id
) return Boolean;
18050 -- Returns True if Typ is a nonlimited record with defaulted
18051 -- discriminants whose max size makes it unsuitable for allocating on
18052 -- the primary stack.
18054 ------------------------------
18055 -- Caller_Known_Size_Record --
18056 ------------------------------
18058 function Caller_Known_Size_Record
(Typ
: Entity_Id
) return Boolean is
18059 pragma Assert
(Typ
= Underlying_Type
(Typ
));
18062 if Has_Variant_Part
(Typ
) and then not Is_Definite_Subtype
(Typ
) then
18070 Comp
:= First_Entity
(Typ
);
18071 while Present
(Comp
) loop
18073 -- Only look at E_Component entities. No need to look at
18074 -- E_Discriminant entities, and we must ignore internal
18075 -- subtypes generated for constrained components.
18077 if Ekind
(Comp
) = E_Component
then
18079 Comp_Type
: constant Entity_Id
:=
18080 Underlying_Type
(Etype
(Comp
));
18083 if Is_Record_Type
(Comp_Type
)
18085 Is_Protected_Type
(Comp_Type
)
18087 if not Caller_Known_Size_Record
(Comp_Type
) then
18091 elsif Is_Array_Type
(Comp_Type
) then
18092 if Size_Depends_On_Discriminant
(Comp_Type
) then
18099 Next_Entity
(Comp
);
18104 end Caller_Known_Size_Record
;
18106 ------------------------------
18107 -- Large_Max_Size_Mutable --
18108 ------------------------------
18110 function Large_Max_Size_Mutable
(Typ
: Entity_Id
) return Boolean is
18111 pragma Assert
(Typ
= Underlying_Type
(Typ
));
18113 function Is_Large_Discrete_Type
(T
: Entity_Id
) return Boolean;
18114 -- Returns true if the discrete type T has a large range
18116 ----------------------------
18117 -- Is_Large_Discrete_Type --
18118 ----------------------------
18120 function Is_Large_Discrete_Type
(T
: Entity_Id
) return Boolean is
18121 Threshold
: constant Int
:= 16;
18122 -- Arbitrary threshold above which we consider it "large". We want
18123 -- a fairly large threshold, because these large types really
18124 -- shouldn't have default discriminants in the first place, in
18128 return UI_To_Int
(RM_Size
(T
)) > Threshold
;
18129 end Is_Large_Discrete_Type
;
18132 if Is_Record_Type
(Typ
)
18133 and then not Is_Limited_View
(Typ
)
18134 and then Has_Defaulted_Discriminants
(Typ
)
18136 -- Loop through the components, looking for an array whose upper
18137 -- bound(s) depends on discriminants, where both the subtype of
18138 -- the discriminant and the index subtype are too large.
18144 Comp
:= First_Entity
(Typ
);
18145 while Present
(Comp
) loop
18146 if Ekind
(Comp
) = E_Component
then
18148 Comp_Type
: constant Entity_Id
:=
18149 Underlying_Type
(Etype
(Comp
));
18155 if Is_Array_Type
(Comp_Type
) then
18156 Indx
:= First_Index
(Comp_Type
);
18158 while Present
(Indx
) loop
18159 Ityp
:= Etype
(Indx
);
18160 Hi
:= Type_High_Bound
(Ityp
);
18162 if Nkind
(Hi
) = N_Identifier
18163 and then Ekind
(Entity
(Hi
)) = E_Discriminant
18164 and then Is_Large_Discrete_Type
(Ityp
)
18165 and then Is_Large_Discrete_Type
18166 (Etype
(Entity
(Hi
)))
18177 Next_Entity
(Comp
);
18183 end Large_Max_Size_Mutable
;
18185 -- Local declarations
18187 Typ
: constant Entity_Id
:= Underlying_Type
(Id
);
18189 -- Start of processing for New_Requires_Transient_Scope
18192 -- This is a private type which is not completed yet. This can only
18193 -- happen in a default expression (of a formal parameter or of a
18194 -- record component). Do not expand transient scope in this case.
18199 -- Do not expand transient scope for non-existent procedure return or
18200 -- string literal types.
18202 elsif Typ
= Standard_Void_Type
18203 or else Ekind
(Typ
) = E_String_Literal_Subtype
18207 -- If Typ is a generic formal incomplete type, then we want to look at
18208 -- the actual type.
18210 elsif Ekind
(Typ
) = E_Record_Subtype
18211 and then Present
(Cloned_Subtype
(Typ
))
18213 return New_Requires_Transient_Scope
(Cloned_Subtype
(Typ
));
18215 -- Functions returning specific tagged types may dispatch on result, so
18216 -- their returned value is allocated on the secondary stack, even in the
18217 -- definite case. We must treat nondispatching functions the same way,
18218 -- because access-to-function types can point at both, so the calling
18219 -- conventions must be compatible. Is_Tagged_Type includes controlled
18220 -- types and class-wide types. Controlled type temporaries need
18223 -- ???It's not clear why we need to return noncontrolled types with
18224 -- controlled components on the secondary stack.
18226 elsif Is_Tagged_Type
(Typ
) or else Has_Controlled_Component
(Typ
) then
18229 -- Untagged definite subtypes are known size. This includes all
18230 -- elementary [sub]types. Tasks are known size even if they have
18231 -- discriminants. So we return False here, with one exception:
18232 -- For a type like:
18233 -- type T (Last : Natural := 0) is
18234 -- X : String (1 .. Last);
18236 -- we return True. That's because for "P(F(...));", where F returns T,
18237 -- we don't know the size of the result at the call site, so if we
18238 -- allocated it on the primary stack, we would have to allocate the
18239 -- maximum size, which is way too big.
18241 elsif Is_Definite_Subtype
(Typ
) or else Is_Task_Type
(Typ
) then
18242 return Large_Max_Size_Mutable
(Typ
);
18244 -- Indefinite (discriminated) untagged record or protected type
18246 elsif Is_Record_Type
(Typ
) or else Is_Protected_Type
(Typ
) then
18247 return not Caller_Known_Size_Record
(Typ
);
18249 -- Unconstrained array
18252 pragma Assert
(Is_Array_Type
(Typ
) and not Is_Definite_Subtype
(Typ
));
18255 end New_Requires_Transient_Scope
;
18257 --------------------------
18258 -- Reset_Analyzed_Flags --
18259 --------------------------
18261 procedure Reset_Analyzed_Flags
(N
: Node_Id
) is
18263 function Clear_Analyzed
(N
: Node_Id
) return Traverse_Result
;
18264 -- Function used to reset Analyzed flags in tree. Note that we do
18265 -- not reset Analyzed flags in entities, since there is no need to
18266 -- reanalyze entities, and indeed, it is wrong to do so, since it
18267 -- can result in generating auxiliary stuff more than once.
18269 --------------------
18270 -- Clear_Analyzed --
18271 --------------------
18273 function Clear_Analyzed
(N
: Node_Id
) return Traverse_Result
is
18275 if not Has_Extension
(N
) then
18276 Set_Analyzed
(N
, False);
18280 end Clear_Analyzed
;
18282 procedure Reset_Analyzed
is new Traverse_Proc
(Clear_Analyzed
);
18284 -- Start of processing for Reset_Analyzed_Flags
18287 Reset_Analyzed
(N
);
18288 end Reset_Analyzed_Flags
;
18290 ------------------------
18291 -- Restore_SPARK_Mode --
18292 ------------------------
18294 procedure Restore_SPARK_Mode
(Mode
: SPARK_Mode_Type
) is
18296 SPARK_Mode
:= Mode
;
18297 end Restore_SPARK_Mode
;
18299 --------------------------------
18300 -- Returns_Unconstrained_Type --
18301 --------------------------------
18303 function Returns_Unconstrained_Type
(Subp
: Entity_Id
) return Boolean is
18305 return Ekind
(Subp
) = E_Function
18306 and then not Is_Scalar_Type
(Etype
(Subp
))
18307 and then not Is_Access_Type
(Etype
(Subp
))
18308 and then not Is_Constrained
(Etype
(Subp
));
18309 end Returns_Unconstrained_Type
;
18311 ----------------------------
18312 -- Root_Type_Of_Full_View --
18313 ----------------------------
18315 function Root_Type_Of_Full_View
(T
: Entity_Id
) return Entity_Id
is
18316 Rtyp
: constant Entity_Id
:= Root_Type
(T
);
18319 -- The root type of the full view may itself be a private type. Keep
18320 -- looking for the ultimate derivation parent.
18322 if Is_Private_Type
(Rtyp
) and then Present
(Full_View
(Rtyp
)) then
18323 return Root_Type_Of_Full_View
(Full_View
(Rtyp
));
18327 end Root_Type_Of_Full_View
;
18329 ---------------------------
18330 -- Safe_To_Capture_Value --
18331 ---------------------------
18333 function Safe_To_Capture_Value
18336 Cond
: Boolean := False) return Boolean
18339 -- The only entities for which we track constant values are variables
18340 -- which are not renamings, constants, out parameters, and in out
18341 -- parameters, so check if we have this case.
18343 -- Note: it may seem odd to track constant values for constants, but in
18344 -- fact this routine is used for other purposes than simply capturing
18345 -- the value. In particular, the setting of Known[_Non]_Null.
18347 if (Ekind
(Ent
) = E_Variable
and then No
(Renamed_Object
(Ent
)))
18349 Ekind_In
(Ent
, E_Constant
, E_Out_Parameter
, E_In_Out_Parameter
)
18353 -- For conditionals, we also allow loop parameters and all formals,
18354 -- including in parameters.
18356 elsif Cond
and then Ekind_In
(Ent
, E_Loop_Parameter
, E_In_Parameter
) then
18359 -- For all other cases, not just unsafe, but impossible to capture
18360 -- Current_Value, since the above are the only entities which have
18361 -- Current_Value fields.
18367 -- Skip if volatile or aliased, since funny things might be going on in
18368 -- these cases which we cannot necessarily track. Also skip any variable
18369 -- for which an address clause is given, or whose address is taken. Also
18370 -- never capture value of library level variables (an attempt to do so
18371 -- can occur in the case of package elaboration code).
18373 if Treat_As_Volatile
(Ent
)
18374 or else Is_Aliased
(Ent
)
18375 or else Present
(Address_Clause
(Ent
))
18376 or else Address_Taken
(Ent
)
18377 or else (Is_Library_Level_Entity
(Ent
)
18378 and then Ekind
(Ent
) = E_Variable
)
18383 -- OK, all above conditions are met. We also require that the scope of
18384 -- the reference be the same as the scope of the entity, not counting
18385 -- packages and blocks and loops.
18388 E_Scope
: constant Entity_Id
:= Scope
(Ent
);
18389 R_Scope
: Entity_Id
;
18392 R_Scope
:= Current_Scope
;
18393 while R_Scope
/= Standard_Standard
loop
18394 exit when R_Scope
= E_Scope
;
18396 if not Ekind_In
(R_Scope
, E_Package
, E_Block
, E_Loop
) then
18399 R_Scope
:= Scope
(R_Scope
);
18404 -- We also require that the reference does not appear in a context
18405 -- where it is not sure to be executed (i.e. a conditional context
18406 -- or an exception handler). We skip this if Cond is True, since the
18407 -- capturing of values from conditional tests handles this ok.
18420 -- Seems dubious that case expressions are not handled here ???
18423 while Present
(P
) loop
18424 if Nkind
(P
) = N_If_Statement
18425 or else Nkind
(P
) = N_Case_Statement
18426 or else (Nkind
(P
) in N_Short_Circuit
18427 and then Desc
= Right_Opnd
(P
))
18428 or else (Nkind
(P
) = N_If_Expression
18429 and then Desc
/= First
(Expressions
(P
)))
18430 or else Nkind
(P
) = N_Exception_Handler
18431 or else Nkind
(P
) = N_Selective_Accept
18432 or else Nkind
(P
) = N_Conditional_Entry_Call
18433 or else Nkind
(P
) = N_Timed_Entry_Call
18434 or else Nkind
(P
) = N_Asynchronous_Select
18442 -- A special Ada 2012 case: the original node may be part
18443 -- of the else_actions of a conditional expression, in which
18444 -- case it might not have been expanded yet, and appears in
18445 -- a non-syntactic list of actions. In that case it is clearly
18446 -- not safe to save a value.
18449 and then Is_List_Member
(Desc
)
18450 and then No
(Parent
(List_Containing
(Desc
)))
18458 -- OK, looks safe to set value
18461 end Safe_To_Capture_Value
;
18467 function Same_Name
(N1
, N2
: Node_Id
) return Boolean is
18468 K1
: constant Node_Kind
:= Nkind
(N1
);
18469 K2
: constant Node_Kind
:= Nkind
(N2
);
18472 if (K1
= N_Identifier
or else K1
= N_Defining_Identifier
)
18473 and then (K2
= N_Identifier
or else K2
= N_Defining_Identifier
)
18475 return Chars
(N1
) = Chars
(N2
);
18477 elsif (K1
= N_Selected_Component
or else K1
= N_Expanded_Name
)
18478 and then (K2
= N_Selected_Component
or else K2
= N_Expanded_Name
)
18480 return Same_Name
(Selector_Name
(N1
), Selector_Name
(N2
))
18481 and then Same_Name
(Prefix
(N1
), Prefix
(N2
));
18492 function Same_Object
(Node1
, Node2
: Node_Id
) return Boolean is
18493 N1
: constant Node_Id
:= Original_Node
(Node1
);
18494 N2
: constant Node_Id
:= Original_Node
(Node2
);
18495 -- We do the tests on original nodes, since we are most interested
18496 -- in the original source, not any expansion that got in the way.
18498 K1
: constant Node_Kind
:= Nkind
(N1
);
18499 K2
: constant Node_Kind
:= Nkind
(N2
);
18502 -- First case, both are entities with same entity
18504 if K1
in N_Has_Entity
and then K2
in N_Has_Entity
then
18506 EN1
: constant Entity_Id
:= Entity
(N1
);
18507 EN2
: constant Entity_Id
:= Entity
(N2
);
18509 if Present
(EN1
) and then Present
(EN2
)
18510 and then (Ekind_In
(EN1
, E_Variable
, E_Constant
)
18511 or else Is_Formal
(EN1
))
18519 -- Second case, selected component with same selector, same record
18521 if K1
= N_Selected_Component
18522 and then K2
= N_Selected_Component
18523 and then Chars
(Selector_Name
(N1
)) = Chars
(Selector_Name
(N2
))
18525 return Same_Object
(Prefix
(N1
), Prefix
(N2
));
18527 -- Third case, indexed component with same subscripts, same array
18529 elsif K1
= N_Indexed_Component
18530 and then K2
= N_Indexed_Component
18531 and then Same_Object
(Prefix
(N1
), Prefix
(N2
))
18536 E1
:= First
(Expressions
(N1
));
18537 E2
:= First
(Expressions
(N2
));
18538 while Present
(E1
) loop
18539 if not Same_Value
(E1
, E2
) then
18550 -- Fourth case, slice of same array with same bounds
18553 and then K2
= N_Slice
18554 and then Nkind
(Discrete_Range
(N1
)) = N_Range
18555 and then Nkind
(Discrete_Range
(N2
)) = N_Range
18556 and then Same_Value
(Low_Bound
(Discrete_Range
(N1
)),
18557 Low_Bound
(Discrete_Range
(N2
)))
18558 and then Same_Value
(High_Bound
(Discrete_Range
(N1
)),
18559 High_Bound
(Discrete_Range
(N2
)))
18561 return Same_Name
(Prefix
(N1
), Prefix
(N2
));
18563 -- All other cases, not clearly the same object
18574 function Same_Type
(T1
, T2
: Entity_Id
) return Boolean is
18579 elsif not Is_Constrained
(T1
)
18580 and then not Is_Constrained
(T2
)
18581 and then Base_Type
(T1
) = Base_Type
(T2
)
18585 -- For now don't bother with case of identical constraints, to be
18586 -- fiddled with later on perhaps (this is only used for optimization
18587 -- purposes, so it is not critical to do a best possible job)
18598 function Same_Value
(Node1
, Node2
: Node_Id
) return Boolean is
18600 if Compile_Time_Known_Value
(Node1
)
18601 and then Compile_Time_Known_Value
(Node2
)
18602 and then Expr_Value
(Node1
) = Expr_Value
(Node2
)
18605 elsif Same_Object
(Node1
, Node2
) then
18612 -----------------------------
18613 -- Save_SPARK_Mode_And_Set --
18614 -----------------------------
18616 procedure Save_SPARK_Mode_And_Set
18617 (Context
: Entity_Id
;
18618 Mode
: out SPARK_Mode_Type
)
18621 -- Save the current mode in effect
18623 Mode
:= SPARK_Mode
;
18625 -- Do not consider illegal or partially decorated constructs
18627 if Ekind
(Context
) = E_Void
or else Error_Posted
(Context
) then
18630 elsif Present
(SPARK_Pragma
(Context
)) then
18631 SPARK_Mode
:= Get_SPARK_Mode_From_Pragma
(SPARK_Pragma
(Context
));
18633 end Save_SPARK_Mode_And_Set
;
18635 -------------------------
18636 -- Scalar_Part_Present --
18637 -------------------------
18639 function Scalar_Part_Present
(T
: Entity_Id
) return Boolean is
18643 if Is_Scalar_Type
(T
) then
18646 elsif Is_Array_Type
(T
) then
18647 return Scalar_Part_Present
(Component_Type
(T
));
18649 elsif Is_Record_Type
(T
) or else Has_Discriminants
(T
) then
18650 C
:= First_Component_Or_Discriminant
(T
);
18651 while Present
(C
) loop
18652 if Scalar_Part_Present
(Etype
(C
)) then
18655 Next_Component_Or_Discriminant
(C
);
18661 end Scalar_Part_Present
;
18663 ------------------------
18664 -- Scope_Is_Transient --
18665 ------------------------
18667 function Scope_Is_Transient
return Boolean is
18669 return Scope_Stack
.Table
(Scope_Stack
.Last
).Is_Transient
;
18670 end Scope_Is_Transient
;
18676 function Scope_Within
(Scope1
, Scope2
: Entity_Id
) return Boolean is
18681 while Scop
/= Standard_Standard
loop
18682 Scop
:= Scope
(Scop
);
18684 if Scop
= Scope2
then
18692 --------------------------
18693 -- Scope_Within_Or_Same --
18694 --------------------------
18696 function Scope_Within_Or_Same
(Scope1
, Scope2
: Entity_Id
) return Boolean is
18701 while Scop
/= Standard_Standard
loop
18702 if Scop
= Scope2
then
18705 Scop
:= Scope
(Scop
);
18710 end Scope_Within_Or_Same
;
18712 --------------------
18713 -- Set_Convention --
18714 --------------------
18716 procedure Set_Convention
(E
: Entity_Id
; Val
: Snames
.Convention_Id
) is
18718 Basic_Set_Convention
(E
, Val
);
18721 and then Is_Access_Subprogram_Type
(Base_Type
(E
))
18722 and then Has_Foreign_Convention
(E
)
18725 -- A pragma Convention in an instance may apply to the subtype
18726 -- created for a formal, in which case we have already verified
18727 -- that conventions of actual and formal match and there is nothing
18728 -- to flag on the subtype.
18730 if In_Instance
then
18733 Set_Can_Use_Internal_Rep
(E
, False);
18737 -- If E is an object or component, and the type of E is an anonymous
18738 -- access type with no convention set, then also set the convention of
18739 -- the anonymous access type. We do not do this for anonymous protected
18740 -- types, since protected types always have the default convention.
18742 if Present
(Etype
(E
))
18743 and then (Is_Object
(E
)
18744 or else Ekind
(E
) = E_Component
18746 -- Allow E_Void (happens for pragma Convention appearing
18747 -- in the middle of a record applying to a component)
18749 or else Ekind
(E
) = E_Void
)
18752 Typ
: constant Entity_Id
:= Etype
(E
);
18755 if Ekind_In
(Typ
, E_Anonymous_Access_Type
,
18756 E_Anonymous_Access_Subprogram_Type
)
18757 and then not Has_Convention_Pragma
(Typ
)
18759 Basic_Set_Convention
(Typ
, Val
);
18760 Set_Has_Convention_Pragma
(Typ
);
18762 -- And for the access subprogram type, deal similarly with the
18763 -- designated E_Subprogram_Type if it is also internal (which
18766 if Ekind
(Typ
) = E_Anonymous_Access_Subprogram_Type
then
18768 Dtype
: constant Entity_Id
:= Designated_Type
(Typ
);
18770 if Ekind
(Dtype
) = E_Subprogram_Type
18771 and then Is_Itype
(Dtype
)
18772 and then not Has_Convention_Pragma
(Dtype
)
18774 Basic_Set_Convention
(Dtype
, Val
);
18775 Set_Has_Convention_Pragma
(Dtype
);
18782 end Set_Convention
;
18784 ------------------------
18785 -- Set_Current_Entity --
18786 ------------------------
18788 -- The given entity is to be set as the currently visible definition of its
18789 -- associated name (i.e. the Node_Id associated with its name). All we have
18790 -- to do is to get the name from the identifier, and then set the
18791 -- associated Node_Id to point to the given entity.
18793 procedure Set_Current_Entity
(E
: Entity_Id
) is
18795 Set_Name_Entity_Id
(Chars
(E
), E
);
18796 end Set_Current_Entity
;
18798 ---------------------------
18799 -- Set_Debug_Info_Needed --
18800 ---------------------------
18802 procedure Set_Debug_Info_Needed
(T
: Entity_Id
) is
18804 procedure Set_Debug_Info_Needed_If_Not_Set
(E
: Entity_Id
);
18805 pragma Inline
(Set_Debug_Info_Needed_If_Not_Set
);
18806 -- Used to set debug info in a related node if not set already
18808 --------------------------------------
18809 -- Set_Debug_Info_Needed_If_Not_Set --
18810 --------------------------------------
18812 procedure Set_Debug_Info_Needed_If_Not_Set
(E
: Entity_Id
) is
18814 if Present
(E
) and then not Needs_Debug_Info
(E
) then
18815 Set_Debug_Info_Needed
(E
);
18817 -- For a private type, indicate that the full view also needs
18818 -- debug information.
18821 and then Is_Private_Type
(E
)
18822 and then Present
(Full_View
(E
))
18824 Set_Debug_Info_Needed
(Full_View
(E
));
18827 end Set_Debug_Info_Needed_If_Not_Set
;
18829 -- Start of processing for Set_Debug_Info_Needed
18832 -- Nothing to do if argument is Empty or has Debug_Info_Off set, which
18833 -- indicates that Debug_Info_Needed is never required for the entity.
18834 -- Nothing to do if entity comes from a predefined file. Library files
18835 -- are compiled without debug information, but inlined bodies of these
18836 -- routines may appear in user code, and debug information on them ends
18837 -- up complicating debugging the user code.
18840 or else Debug_Info_Off
(T
)
18844 elsif In_Inlined_Body
18845 and then Is_Predefined_File_Name
18846 (Unit_File_Name
(Get_Source_Unit
(Sloc
(T
))))
18848 Set_Needs_Debug_Info
(T
, False);
18851 -- Set flag in entity itself. Note that we will go through the following
18852 -- circuitry even if the flag is already set on T. That's intentional,
18853 -- it makes sure that the flag will be set in subsidiary entities.
18855 Set_Needs_Debug_Info
(T
);
18857 -- Set flag on subsidiary entities if not set already
18859 if Is_Object
(T
) then
18860 Set_Debug_Info_Needed_If_Not_Set
(Etype
(T
));
18862 elsif Is_Type
(T
) then
18863 Set_Debug_Info_Needed_If_Not_Set
(Etype
(T
));
18865 if Is_Record_Type
(T
) then
18867 Ent
: Entity_Id
:= First_Entity
(T
);
18869 while Present
(Ent
) loop
18870 Set_Debug_Info_Needed_If_Not_Set
(Ent
);
18875 -- For a class wide subtype, we also need debug information
18876 -- for the equivalent type.
18878 if Ekind
(T
) = E_Class_Wide_Subtype
then
18879 Set_Debug_Info_Needed_If_Not_Set
(Equivalent_Type
(T
));
18882 elsif Is_Array_Type
(T
) then
18883 Set_Debug_Info_Needed_If_Not_Set
(Component_Type
(T
));
18886 Indx
: Node_Id
:= First_Index
(T
);
18888 while Present
(Indx
) loop
18889 Set_Debug_Info_Needed_If_Not_Set
(Etype
(Indx
));
18890 Indx
:= Next_Index
(Indx
);
18894 -- For a packed array type, we also need debug information for
18895 -- the type used to represent the packed array. Conversely, we
18896 -- also need it for the former if we need it for the latter.
18898 if Is_Packed
(T
) then
18899 Set_Debug_Info_Needed_If_Not_Set
(Packed_Array_Impl_Type
(T
));
18902 if Is_Packed_Array_Impl_Type
(T
) then
18903 Set_Debug_Info_Needed_If_Not_Set
(Original_Array_Type
(T
));
18906 elsif Is_Access_Type
(T
) then
18907 Set_Debug_Info_Needed_If_Not_Set
(Directly_Designated_Type
(T
));
18909 elsif Is_Private_Type
(T
) then
18911 FV
: constant Entity_Id
:= Full_View
(T
);
18914 Set_Debug_Info_Needed_If_Not_Set
(FV
);
18916 -- If the full view is itself a derived private type, we need
18917 -- debug information on its underlying type.
18920 and then Is_Private_Type
(FV
)
18921 and then Present
(Underlying_Full_View
(FV
))
18923 Set_Needs_Debug_Info
(Underlying_Full_View
(FV
));
18927 elsif Is_Protected_Type
(T
) then
18928 Set_Debug_Info_Needed_If_Not_Set
(Corresponding_Record_Type
(T
));
18930 elsif Is_Scalar_Type
(T
) then
18932 -- If the subrange bounds are materialized by dedicated constant
18933 -- objects, also include them in the debug info to make sure the
18934 -- debugger can properly use them.
18936 if Present
(Scalar_Range
(T
))
18937 and then Nkind
(Scalar_Range
(T
)) = N_Range
18940 Low_Bnd
: constant Node_Id
:= Type_Low_Bound
(T
);
18941 High_Bnd
: constant Node_Id
:= Type_High_Bound
(T
);
18944 if Is_Entity_Name
(Low_Bnd
) then
18945 Set_Debug_Info_Needed_If_Not_Set
(Entity
(Low_Bnd
));
18948 if Is_Entity_Name
(High_Bnd
) then
18949 Set_Debug_Info_Needed_If_Not_Set
(Entity
(High_Bnd
));
18955 end Set_Debug_Info_Needed
;
18957 ----------------------------
18958 -- Set_Entity_With_Checks --
18959 ----------------------------
18961 procedure Set_Entity_With_Checks
(N
: Node_Id
; Val
: Entity_Id
) is
18962 Val_Actual
: Entity_Id
;
18964 Post_Node
: Node_Id
;
18967 -- Unconditionally set the entity
18969 Set_Entity
(N
, Val
);
18971 -- The node to post on is the selector in the case of an expanded name,
18972 -- and otherwise the node itself.
18974 if Nkind
(N
) = N_Expanded_Name
then
18975 Post_Node
:= Selector_Name
(N
);
18980 -- Check for violation of No_Fixed_IO
18982 if Restriction_Check_Required
(No_Fixed_IO
)
18984 ((RTU_Loaded
(Ada_Text_IO
)
18985 and then (Is_RTE
(Val
, RE_Decimal_IO
)
18987 Is_RTE
(Val
, RE_Fixed_IO
)))
18990 (RTU_Loaded
(Ada_Wide_Text_IO
)
18991 and then (Is_RTE
(Val
, RO_WT_Decimal_IO
)
18993 Is_RTE
(Val
, RO_WT_Fixed_IO
)))
18996 (RTU_Loaded
(Ada_Wide_Wide_Text_IO
)
18997 and then (Is_RTE
(Val
, RO_WW_Decimal_IO
)
18999 Is_RTE
(Val
, RO_WW_Fixed_IO
))))
19001 -- A special extra check, don't complain about a reference from within
19002 -- the Ada.Interrupts package itself!
19004 and then not In_Same_Extended_Unit
(N
, Val
)
19006 Check_Restriction
(No_Fixed_IO
, Post_Node
);
19009 -- Remaining checks are only done on source nodes. Note that we test
19010 -- for violation of No_Fixed_IO even on non-source nodes, because the
19011 -- cases for checking violations of this restriction are instantiations
19012 -- where the reference in the instance has Comes_From_Source False.
19014 if not Comes_From_Source
(N
) then
19018 -- Check for violation of No_Abort_Statements, which is triggered by
19019 -- call to Ada.Task_Identification.Abort_Task.
19021 if Restriction_Check_Required
(No_Abort_Statements
)
19022 and then (Is_RTE
(Val
, RE_Abort_Task
))
19024 -- A special extra check, don't complain about a reference from within
19025 -- the Ada.Task_Identification package itself!
19027 and then not In_Same_Extended_Unit
(N
, Val
)
19029 Check_Restriction
(No_Abort_Statements
, Post_Node
);
19032 if Val
= Standard_Long_Long_Integer
then
19033 Check_Restriction
(No_Long_Long_Integers
, Post_Node
);
19036 -- Check for violation of No_Dynamic_Attachment
19038 if Restriction_Check_Required
(No_Dynamic_Attachment
)
19039 and then RTU_Loaded
(Ada_Interrupts
)
19040 and then (Is_RTE
(Val
, RE_Is_Reserved
) or else
19041 Is_RTE
(Val
, RE_Is_Attached
) or else
19042 Is_RTE
(Val
, RE_Current_Handler
) or else
19043 Is_RTE
(Val
, RE_Attach_Handler
) or else
19044 Is_RTE
(Val
, RE_Exchange_Handler
) or else
19045 Is_RTE
(Val
, RE_Detach_Handler
) or else
19046 Is_RTE
(Val
, RE_Reference
))
19048 -- A special extra check, don't complain about a reference from within
19049 -- the Ada.Interrupts package itself!
19051 and then not In_Same_Extended_Unit
(N
, Val
)
19053 Check_Restriction
(No_Dynamic_Attachment
, Post_Node
);
19056 -- Check for No_Implementation_Identifiers
19058 if Restriction_Check_Required
(No_Implementation_Identifiers
) then
19060 -- We have an implementation defined entity if it is marked as
19061 -- implementation defined, or is defined in a package marked as
19062 -- implementation defined. However, library packages themselves
19063 -- are excluded (we don't want to flag Interfaces itself, just
19064 -- the entities within it).
19066 if (Is_Implementation_Defined
(Val
)
19068 (Present
(Scope
(Val
))
19069 and then Is_Implementation_Defined
(Scope
(Val
))))
19070 and then not (Ekind_In
(Val
, E_Package
, E_Generic_Package
)
19071 and then Is_Library_Level_Entity
(Val
))
19073 Check_Restriction
(No_Implementation_Identifiers
, Post_Node
);
19077 -- Do the style check
19080 and then not Suppress_Style_Checks
(Val
)
19081 and then not In_Instance
19083 if Nkind
(N
) = N_Identifier
then
19085 elsif Nkind
(N
) = N_Expanded_Name
then
19086 Nod
:= Selector_Name
(N
);
19091 -- A special situation arises for derived operations, where we want
19092 -- to do the check against the parent (since the Sloc of the derived
19093 -- operation points to the derived type declaration itself).
19096 while not Comes_From_Source
(Val_Actual
)
19097 and then Nkind
(Val_Actual
) in N_Entity
19098 and then (Ekind
(Val_Actual
) = E_Enumeration_Literal
19099 or else Is_Subprogram_Or_Generic_Subprogram
(Val_Actual
))
19100 and then Present
(Alias
(Val_Actual
))
19102 Val_Actual
:= Alias
(Val_Actual
);
19105 -- Renaming declarations for generic actuals do not come from source,
19106 -- and have a different name from that of the entity they rename, so
19107 -- there is no style check to perform here.
19109 if Chars
(Nod
) = Chars
(Val_Actual
) then
19110 Style
.Check_Identifier
(Nod
, Val_Actual
);
19114 Set_Entity
(N
, Val
);
19115 end Set_Entity_With_Checks
;
19117 ------------------------
19118 -- Set_Name_Entity_Id --
19119 ------------------------
19121 procedure Set_Name_Entity_Id
(Id
: Name_Id
; Val
: Entity_Id
) is
19123 Set_Name_Table_Int
(Id
, Int
(Val
));
19124 end Set_Name_Entity_Id
;
19126 ---------------------
19127 -- Set_Next_Actual --
19128 ---------------------
19130 procedure Set_Next_Actual
(Ass1_Id
: Node_Id
; Ass2_Id
: Node_Id
) is
19132 if Nkind
(Parent
(Ass1_Id
)) = N_Parameter_Association
then
19133 Set_First_Named_Actual
(Parent
(Ass1_Id
), Ass2_Id
);
19135 end Set_Next_Actual
;
19137 ----------------------------------
19138 -- Set_Optimize_Alignment_Flags --
19139 ----------------------------------
19141 procedure Set_Optimize_Alignment_Flags
(E
: Entity_Id
) is
19143 if Optimize_Alignment
= 'S' then
19144 Set_Optimize_Alignment_Space
(E
);
19145 elsif Optimize_Alignment
= 'T' then
19146 Set_Optimize_Alignment_Time
(E
);
19148 end Set_Optimize_Alignment_Flags
;
19150 -----------------------
19151 -- Set_Public_Status --
19152 -----------------------
19154 procedure Set_Public_Status
(Id
: Entity_Id
) is
19155 S
: constant Entity_Id
:= Current_Scope
;
19157 function Within_HSS_Or_If
(E
: Entity_Id
) return Boolean;
19158 -- Determines if E is defined within handled statement sequence or
19159 -- an if statement, returns True if so, False otherwise.
19161 ----------------------
19162 -- Within_HSS_Or_If --
19163 ----------------------
19165 function Within_HSS_Or_If
(E
: Entity_Id
) return Boolean is
19168 N
:= Declaration_Node
(E
);
19175 elsif Nkind_In
(N
, N_Handled_Sequence_Of_Statements
,
19181 end Within_HSS_Or_If
;
19183 -- Start of processing for Set_Public_Status
19186 -- Everything in the scope of Standard is public
19188 if S
= Standard_Standard
then
19189 Set_Is_Public
(Id
);
19191 -- Entity is definitely not public if enclosing scope is not public
19193 elsif not Is_Public
(S
) then
19196 -- An object or function declaration that occurs in a handled sequence
19197 -- of statements or within an if statement is the declaration for a
19198 -- temporary object or local subprogram generated by the expander. It
19199 -- never needs to be made public and furthermore, making it public can
19200 -- cause back end problems.
19202 elsif Nkind_In
(Parent
(Id
), N_Object_Declaration
,
19203 N_Function_Specification
)
19204 and then Within_HSS_Or_If
(Id
)
19208 -- Entities in public packages or records are public
19210 elsif Ekind
(S
) = E_Package
or Is_Record_Type
(S
) then
19211 Set_Is_Public
(Id
);
19213 -- The bounds of an entry family declaration can generate object
19214 -- declarations that are visible to the back-end, e.g. in the
19215 -- the declaration of a composite type that contains tasks.
19217 elsif Is_Concurrent_Type
(S
)
19218 and then not Has_Completion
(S
)
19219 and then Nkind
(Parent
(Id
)) = N_Object_Declaration
19221 Set_Is_Public
(Id
);
19223 end Set_Public_Status
;
19225 -----------------------------
19226 -- Set_Referenced_Modified --
19227 -----------------------------
19229 procedure Set_Referenced_Modified
(N
: Node_Id
; Out_Param
: Boolean) is
19233 -- Deal with indexed or selected component where prefix is modified
19235 if Nkind_In
(N
, N_Indexed_Component
, N_Selected_Component
) then
19236 Pref
:= Prefix
(N
);
19238 -- If prefix is access type, then it is the designated object that is
19239 -- being modified, which means we have no entity to set the flag on.
19241 if No
(Etype
(Pref
)) or else Is_Access_Type
(Etype
(Pref
)) then
19244 -- Otherwise chase the prefix
19247 Set_Referenced_Modified
(Pref
, Out_Param
);
19250 -- Otherwise see if we have an entity name (only other case to process)
19252 elsif Is_Entity_Name
(N
) and then Present
(Entity
(N
)) then
19253 Set_Referenced_As_LHS
(Entity
(N
), not Out_Param
);
19254 Set_Referenced_As_Out_Parameter
(Entity
(N
), Out_Param
);
19256 end Set_Referenced_Modified
;
19258 ----------------------------
19259 -- Set_Scope_Is_Transient --
19260 ----------------------------
19262 procedure Set_Scope_Is_Transient
(V
: Boolean := True) is
19264 Scope_Stack
.Table
(Scope_Stack
.Last
).Is_Transient
:= V
;
19265 end Set_Scope_Is_Transient
;
19267 -------------------
19268 -- Set_Size_Info --
19269 -------------------
19271 procedure Set_Size_Info
(T1
, T2
: Entity_Id
) is
19273 -- We copy Esize, but not RM_Size, since in general RM_Size is
19274 -- subtype specific and does not get inherited by all subtypes.
19276 Set_Esize
(T1
, Esize
(T2
));
19277 Set_Has_Biased_Representation
(T1
, Has_Biased_Representation
(T2
));
19279 if Is_Discrete_Or_Fixed_Point_Type
(T1
)
19281 Is_Discrete_Or_Fixed_Point_Type
(T2
)
19283 Set_Is_Unsigned_Type
(T1
, Is_Unsigned_Type
(T2
));
19286 Set_Alignment
(T1
, Alignment
(T2
));
19289 --------------------
19290 -- Static_Boolean --
19291 --------------------
19293 function Static_Boolean
(N
: Node_Id
) return Uint
is
19295 Analyze_And_Resolve
(N
, Standard_Boolean
);
19298 or else Error_Posted
(N
)
19299 or else Etype
(N
) = Any_Type
19304 if Is_OK_Static_Expression
(N
) then
19305 if not Raises_Constraint_Error
(N
) then
19306 return Expr_Value
(N
);
19311 elsif Etype
(N
) = Any_Type
then
19315 Flag_Non_Static_Expr
19316 ("static boolean expression required here", N
);
19319 end Static_Boolean
;
19321 --------------------
19322 -- Static_Integer --
19323 --------------------
19325 function Static_Integer
(N
: Node_Id
) return Uint
is
19327 Analyze_And_Resolve
(N
, Any_Integer
);
19330 or else Error_Posted
(N
)
19331 or else Etype
(N
) = Any_Type
19336 if Is_OK_Static_Expression
(N
) then
19337 if not Raises_Constraint_Error
(N
) then
19338 return Expr_Value
(N
);
19343 elsif Etype
(N
) = Any_Type
then
19347 Flag_Non_Static_Expr
19348 ("static integer expression required here", N
);
19351 end Static_Integer
;
19353 --------------------------
19354 -- Statically_Different --
19355 --------------------------
19357 function Statically_Different
(E1
, E2
: Node_Id
) return Boolean is
19358 R1
: constant Node_Id
:= Get_Referenced_Object
(E1
);
19359 R2
: constant Node_Id
:= Get_Referenced_Object
(E2
);
19361 return Is_Entity_Name
(R1
)
19362 and then Is_Entity_Name
(R2
)
19363 and then Entity
(R1
) /= Entity
(R2
)
19364 and then not Is_Formal
(Entity
(R1
))
19365 and then not Is_Formal
(Entity
(R2
));
19366 end Statically_Different
;
19368 --------------------------------------
19369 -- Subject_To_Loop_Entry_Attributes --
19370 --------------------------------------
19372 function Subject_To_Loop_Entry_Attributes
(N
: Node_Id
) return Boolean is
19378 -- The expansion mechanism transform a loop subject to at least one
19379 -- 'Loop_Entry attribute into a conditional block. Infinite loops lack
19380 -- the conditional part.
19382 if Nkind_In
(Stmt
, N_Block_Statement
, N_If_Statement
)
19383 and then Nkind
(Original_Node
(N
)) = N_Loop_Statement
19385 Stmt
:= Original_Node
(N
);
19389 Nkind
(Stmt
) = N_Loop_Statement
19390 and then Present
(Identifier
(Stmt
))
19391 and then Present
(Entity
(Identifier
(Stmt
)))
19392 and then Has_Loop_Entry_Attributes
(Entity
(Identifier
(Stmt
)));
19393 end Subject_To_Loop_Entry_Attributes
;
19395 -----------------------------
19396 -- Subprogram_Access_Level --
19397 -----------------------------
19399 function Subprogram_Access_Level
(Subp
: Entity_Id
) return Uint
is
19401 if Present
(Alias
(Subp
)) then
19402 return Subprogram_Access_Level
(Alias
(Subp
));
19404 return Scope_Depth
(Enclosing_Dynamic_Scope
(Subp
));
19406 end Subprogram_Access_Level
;
19408 -------------------------------
19409 -- Support_Atomic_Primitives --
19410 -------------------------------
19412 function Support_Atomic_Primitives
(Typ
: Entity_Id
) return Boolean is
19416 -- Verify the alignment of Typ is known
19418 if not Known_Alignment
(Typ
) then
19422 if Known_Static_Esize
(Typ
) then
19423 Size
:= UI_To_Int
(Esize
(Typ
));
19425 -- If the Esize (Object_Size) is unknown at compile time, look at the
19426 -- RM_Size (Value_Size) which may have been set by an explicit rep item.
19428 elsif Known_Static_RM_Size
(Typ
) then
19429 Size
:= UI_To_Int
(RM_Size
(Typ
));
19431 -- Otherwise, the size is considered to be unknown.
19437 -- Check that the size of the component is 8, 16, 32 or 64 bits and that
19438 -- Typ is properly aligned.
19441 when 8 |
16 |
32 |
64 =>
19442 return Size
= UI_To_Int
(Alignment
(Typ
)) * 8;
19446 end Support_Atomic_Primitives
;
19452 procedure Trace_Scope
(N
: Node_Id
; E
: Entity_Id
; Msg
: String) is
19454 if Debug_Flag_W
then
19455 for J
in 0 .. Scope_Stack
.Last
loop
19460 Write_Name
(Chars
(E
));
19461 Write_Str
(" from ");
19462 Write_Location
(Sloc
(N
));
19467 -----------------------
19468 -- Transfer_Entities --
19469 -----------------------
19471 procedure Transfer_Entities
(From
: Entity_Id
; To
: Entity_Id
) is
19472 procedure Set_Public_Status_Of
(Id
: Entity_Id
);
19473 -- Set the Is_Public attribute of arbitrary entity Id by calling routine
19474 -- Set_Public_Status. If successfull and Id denotes a record type, set
19475 -- the Is_Public attribute of its fields.
19477 --------------------------
19478 -- Set_Public_Status_Of --
19479 --------------------------
19481 procedure Set_Public_Status_Of
(Id
: Entity_Id
) is
19485 if not Is_Public
(Id
) then
19486 Set_Public_Status
(Id
);
19488 -- When the input entity is a public record type, ensure that all
19489 -- its internal fields are also exposed to the linker. The fields
19490 -- of a class-wide type are never made public.
19493 and then Is_Record_Type
(Id
)
19494 and then not Is_Class_Wide_Type
(Id
)
19496 Field
:= First_Entity
(Id
);
19497 while Present
(Field
) loop
19498 Set_Is_Public
(Field
);
19499 Next_Entity
(Field
);
19503 end Set_Public_Status_Of
;
19507 Full_Id
: Entity_Id
;
19510 -- Start of processing for Transfer_Entities
19513 Id
:= First_Entity
(From
);
19515 if Present
(Id
) then
19517 -- Merge the entity chain of the source scope with that of the
19518 -- destination scope.
19520 if Present
(Last_Entity
(To
)) then
19521 Set_Next_Entity
(Last_Entity
(To
), Id
);
19523 Set_First_Entity
(To
, Id
);
19526 Set_Last_Entity
(To
, Last_Entity
(From
));
19528 -- Inspect the entities of the source scope and update their Scope
19531 while Present
(Id
) loop
19532 Set_Scope
(Id
, To
);
19533 Set_Public_Status_Of
(Id
);
19535 -- Handle an internally generated full view for a private type
19537 if Is_Private_Type
(Id
)
19538 and then Present
(Full_View
(Id
))
19539 and then Is_Itype
(Full_View
(Id
))
19541 Full_Id
:= Full_View
(Id
);
19543 Set_Scope
(Full_Id
, To
);
19544 Set_Public_Status_Of
(Full_Id
);
19550 Set_First_Entity
(From
, Empty
);
19551 Set_Last_Entity
(From
, Empty
);
19553 end Transfer_Entities
;
19555 -----------------------
19556 -- Type_Access_Level --
19557 -----------------------
19559 function Type_Access_Level
(Typ
: Entity_Id
) return Uint
is
19563 Btyp
:= Base_Type
(Typ
);
19565 -- Ada 2005 (AI-230): For most cases of anonymous access types, we
19566 -- simply use the level where the type is declared. This is true for
19567 -- stand-alone object declarations, and for anonymous access types
19568 -- associated with components the level is the same as that of the
19569 -- enclosing composite type. However, special treatment is needed for
19570 -- the cases of access parameters, return objects of an anonymous access
19571 -- type, and, in Ada 95, access discriminants of limited types.
19573 if Is_Access_Type
(Btyp
) then
19574 if Ekind
(Btyp
) = E_Anonymous_Access_Type
then
19576 -- If the type is a nonlocal anonymous access type (such as for
19577 -- an access parameter) we treat it as being declared at the
19578 -- library level to ensure that names such as X.all'access don't
19579 -- fail static accessibility checks.
19581 if not Is_Local_Anonymous_Access
(Typ
) then
19582 return Scope_Depth
(Standard_Standard
);
19584 -- If this is a return object, the accessibility level is that of
19585 -- the result subtype of the enclosing function. The test here is
19586 -- little complicated, because we have to account for extended
19587 -- return statements that have been rewritten as blocks, in which
19588 -- case we have to find and the Is_Return_Object attribute of the
19589 -- itype's associated object. It would be nice to find a way to
19590 -- simplify this test, but it doesn't seem worthwhile to add a new
19591 -- flag just for purposes of this test. ???
19593 elsif Ekind
(Scope
(Btyp
)) = E_Return_Statement
19596 and then Nkind
(Associated_Node_For_Itype
(Btyp
)) =
19597 N_Object_Declaration
19598 and then Is_Return_Object
19599 (Defining_Identifier
19600 (Associated_Node_For_Itype
(Btyp
))))
19606 Scop
:= Scope
(Scope
(Btyp
));
19607 while Present
(Scop
) loop
19608 exit when Ekind
(Scop
) = E_Function
;
19609 Scop
:= Scope
(Scop
);
19612 -- Treat the return object's type as having the level of the
19613 -- function's result subtype (as per RM05-6.5(5.3/2)).
19615 return Type_Access_Level
(Etype
(Scop
));
19620 Btyp
:= Root_Type
(Btyp
);
19622 -- The accessibility level of anonymous access types associated with
19623 -- discriminants is that of the current instance of the type, and
19624 -- that's deeper than the type itself (AARM 3.10.2 (12.3.21)).
19626 -- AI-402: access discriminants have accessibility based on the
19627 -- object rather than the type in Ada 2005, so the above paragraph
19630 -- ??? Needs completion with rules from AI-416
19632 if Ada_Version
<= Ada_95
19633 and then Ekind
(Typ
) = E_Anonymous_Access_Type
19634 and then Present
(Associated_Node_For_Itype
(Typ
))
19635 and then Nkind
(Associated_Node_For_Itype
(Typ
)) =
19636 N_Discriminant_Specification
19638 return Scope_Depth
(Enclosing_Dynamic_Scope
(Btyp
)) + 1;
19642 -- Return library level for a generic formal type. This is done because
19643 -- RM(10.3.2) says that "The statically deeper relationship does not
19644 -- apply to ... a descendant of a generic formal type". Rather than
19645 -- checking at each point where a static accessibility check is
19646 -- performed to see if we are dealing with a formal type, this rule is
19647 -- implemented by having Type_Access_Level and Deepest_Type_Access_Level
19648 -- return extreme values for a formal type; Deepest_Type_Access_Level
19649 -- returns Int'Last. By calling the appropriate function from among the
19650 -- two, we ensure that the static accessibility check will pass if we
19651 -- happen to run into a formal type. More specifically, we should call
19652 -- Deepest_Type_Access_Level instead of Type_Access_Level whenever the
19653 -- call occurs as part of a static accessibility check and the error
19654 -- case is the case where the type's level is too shallow (as opposed
19657 if Is_Generic_Type
(Root_Type
(Btyp
)) then
19658 return Scope_Depth
(Standard_Standard
);
19661 return Scope_Depth
(Enclosing_Dynamic_Scope
(Btyp
));
19662 end Type_Access_Level
;
19664 ------------------------------------
19665 -- Type_Without_Stream_Operation --
19666 ------------------------------------
19668 function Type_Without_Stream_Operation
19670 Op
: TSS_Name_Type
:= TSS_Null
) return Entity_Id
19672 BT
: constant Entity_Id
:= Base_Type
(T
);
19673 Op_Missing
: Boolean;
19676 if not Restriction_Active
(No_Default_Stream_Attributes
) then
19680 if Is_Elementary_Type
(T
) then
19681 if Op
= TSS_Null
then
19683 No
(TSS
(BT
, TSS_Stream_Read
))
19684 or else No
(TSS
(BT
, TSS_Stream_Write
));
19687 Op_Missing
:= No
(TSS
(BT
, Op
));
19696 elsif Is_Array_Type
(T
) then
19697 return Type_Without_Stream_Operation
(Component_Type
(T
), Op
);
19699 elsif Is_Record_Type
(T
) then
19705 Comp
:= First_Component
(T
);
19706 while Present
(Comp
) loop
19707 C_Typ
:= Type_Without_Stream_Operation
(Etype
(Comp
), Op
);
19709 if Present
(C_Typ
) then
19713 Next_Component
(Comp
);
19719 elsif Is_Private_Type
(T
) and then Present
(Full_View
(T
)) then
19720 return Type_Without_Stream_Operation
(Full_View
(T
), Op
);
19724 end Type_Without_Stream_Operation
;
19726 ----------------------------
19727 -- Unique_Defining_Entity --
19728 ----------------------------
19730 function Unique_Defining_Entity
(N
: Node_Id
) return Entity_Id
is
19732 return Unique_Entity
(Defining_Entity
(N
));
19733 end Unique_Defining_Entity
;
19735 -------------------
19736 -- Unique_Entity --
19737 -------------------
19739 function Unique_Entity
(E
: Entity_Id
) return Entity_Id
is
19740 U
: Entity_Id
:= E
;
19746 if Present
(Full_View
(E
)) then
19747 U
:= Full_View
(E
);
19751 if Nkind
(Parent
(E
)) = N_Entry_Body
then
19753 Prot_Item
: Entity_Id
;
19755 -- Traverse the entity list of the protected type and locate
19756 -- an entry declaration which matches the entry body.
19758 Prot_Item
:= First_Entity
(Scope
(E
));
19759 while Present
(Prot_Item
) loop
19760 if Ekind
(Prot_Item
) = E_Entry
19761 and then Corresponding_Body
(Parent
(Prot_Item
)) = E
19767 Next_Entity
(Prot_Item
);
19772 when Formal_Kind
=>
19773 if Present
(Spec_Entity
(E
)) then
19774 U
:= Spec_Entity
(E
);
19777 when E_Package_Body
=>
19780 if Nkind
(P
) = N_Defining_Program_Unit_Name
then
19784 if Nkind
(P
) = N_Package_Body
19785 and then Present
(Corresponding_Spec
(P
))
19787 U
:= Corresponding_Spec
(P
);
19789 elsif Nkind
(P
) = N_Package_Body_Stub
19790 and then Present
(Corresponding_Spec_Of_Stub
(P
))
19792 U
:= Corresponding_Spec_Of_Stub
(P
);
19795 when E_Protected_Body
=>
19798 if Nkind
(P
) = N_Protected_Body
19799 and then Present
(Corresponding_Spec
(P
))
19801 U
:= Corresponding_Spec
(P
);
19803 elsif Nkind
(P
) = N_Protected_Body_Stub
19804 and then Present
(Corresponding_Spec_Of_Stub
(P
))
19806 U
:= Corresponding_Spec_Of_Stub
(P
);
19809 when E_Subprogram_Body
=>
19812 if Nkind
(P
) = N_Defining_Program_Unit_Name
then
19818 if Nkind
(P
) = N_Subprogram_Body
19819 and then Present
(Corresponding_Spec
(P
))
19821 U
:= Corresponding_Spec
(P
);
19823 elsif Nkind
(P
) = N_Subprogram_Body_Stub
19824 and then Present
(Corresponding_Spec_Of_Stub
(P
))
19826 U
:= Corresponding_Spec_Of_Stub
(P
);
19829 when E_Task_Body
=>
19832 if Nkind
(P
) = N_Task_Body
19833 and then Present
(Corresponding_Spec
(P
))
19835 U
:= Corresponding_Spec
(P
);
19837 elsif Nkind
(P
) = N_Task_Body_Stub
19838 and then Present
(Corresponding_Spec_Of_Stub
(P
))
19840 U
:= Corresponding_Spec_Of_Stub
(P
);
19844 if Present
(Full_View
(E
)) then
19845 U
:= Full_View
(E
);
19859 function Unique_Name
(E
: Entity_Id
) return String is
19861 -- Names of E_Subprogram_Body or E_Package_Body entities are not
19862 -- reliable, as they may not include the overloading suffix. Instead,
19863 -- when looking for the name of E or one of its enclosing scope, we get
19864 -- the name of the corresponding Unique_Entity.
19866 function Get_Scoped_Name
(E
: Entity_Id
) return String;
19867 -- Return the name of E prefixed by all the names of the scopes to which
19868 -- E belongs, except for Standard.
19870 ---------------------
19871 -- Get_Scoped_Name --
19872 ---------------------
19874 function Get_Scoped_Name
(E
: Entity_Id
) return String is
19875 Name
: constant String := Get_Name_String
(Chars
(E
));
19877 if Has_Fully_Qualified_Name
(E
)
19878 or else Scope
(E
) = Standard_Standard
19882 return Get_Scoped_Name
(Unique_Entity
(Scope
(E
))) & "__" & Name
;
19884 end Get_Scoped_Name
;
19886 -- Start of processing for Unique_Name
19889 if E
= Standard_Standard
then
19890 return Get_Name_String
(Name_Standard
);
19892 elsif Scope
(E
) = Standard_Standard
19893 and then not (Ekind
(E
) = E_Package
or else Is_Subprogram
(E
))
19895 return Get_Name_String
(Name_Standard
) & "__" &
19896 Get_Name_String
(Chars
(E
));
19898 elsif Ekind
(E
) = E_Enumeration_Literal
then
19899 return Unique_Name
(Etype
(E
)) & "__" & Get_Name_String
(Chars
(E
));
19902 return Get_Scoped_Name
(Unique_Entity
(E
));
19906 ---------------------
19907 -- Unit_Is_Visible --
19908 ---------------------
19910 function Unit_Is_Visible
(U
: Entity_Id
) return Boolean is
19911 Curr
: constant Node_Id
:= Cunit
(Current_Sem_Unit
);
19912 Curr_Entity
: constant Entity_Id
:= Cunit_Entity
(Current_Sem_Unit
);
19914 function Unit_In_Parent_Context
(Par_Unit
: Node_Id
) return Boolean;
19915 -- For a child unit, check whether unit appears in a with_clause
19918 function Unit_In_Context
(Comp_Unit
: Node_Id
) return Boolean;
19919 -- Scan the context clause of one compilation unit looking for a
19920 -- with_clause for the unit in question.
19922 ----------------------------
19923 -- Unit_In_Parent_Context --
19924 ----------------------------
19926 function Unit_In_Parent_Context
(Par_Unit
: Node_Id
) return Boolean is
19928 if Unit_In_Context
(Par_Unit
) then
19931 elsif Is_Child_Unit
(Defining_Entity
(Unit
(Par_Unit
))) then
19932 return Unit_In_Parent_Context
(Parent_Spec
(Unit
(Par_Unit
)));
19937 end Unit_In_Parent_Context
;
19939 ---------------------
19940 -- Unit_In_Context --
19941 ---------------------
19943 function Unit_In_Context
(Comp_Unit
: Node_Id
) return Boolean is
19947 Clause
:= First
(Context_Items
(Comp_Unit
));
19948 while Present
(Clause
) loop
19949 if Nkind
(Clause
) = N_With_Clause
then
19950 if Library_Unit
(Clause
) = U
then
19953 -- The with_clause may denote a renaming of the unit we are
19954 -- looking for, eg. Text_IO which renames Ada.Text_IO.
19957 Renamed_Entity
(Entity
(Name
(Clause
))) =
19958 Defining_Entity
(Unit
(U
))
19968 end Unit_In_Context
;
19970 -- Start of processing for Unit_Is_Visible
19973 -- The currrent unit is directly visible
19978 elsif Unit_In_Context
(Curr
) then
19981 -- If the current unit is a body, check the context of the spec
19983 elsif Nkind
(Unit
(Curr
)) = N_Package_Body
19985 (Nkind
(Unit
(Curr
)) = N_Subprogram_Body
19986 and then not Acts_As_Spec
(Unit
(Curr
)))
19988 if Unit_In_Context
(Library_Unit
(Curr
)) then
19993 -- If the spec is a child unit, examine the parents
19995 if Is_Child_Unit
(Curr_Entity
) then
19996 if Nkind
(Unit
(Curr
)) in N_Unit_Body
then
19998 Unit_In_Parent_Context
19999 (Parent_Spec
(Unit
(Library_Unit
(Curr
))));
20001 return Unit_In_Parent_Context
(Parent_Spec
(Unit
(Curr
)));
20007 end Unit_Is_Visible
;
20009 ------------------------------
20010 -- Universal_Interpretation --
20011 ------------------------------
20013 function Universal_Interpretation
(Opnd
: Node_Id
) return Entity_Id
is
20014 Index
: Interp_Index
;
20018 -- The argument may be a formal parameter of an operator or subprogram
20019 -- with multiple interpretations, or else an expression for an actual.
20021 if Nkind
(Opnd
) = N_Defining_Identifier
20022 or else not Is_Overloaded
(Opnd
)
20024 if Etype
(Opnd
) = Universal_Integer
20025 or else Etype
(Opnd
) = Universal_Real
20027 return Etype
(Opnd
);
20033 Get_First_Interp
(Opnd
, Index
, It
);
20034 while Present
(It
.Typ
) loop
20035 if It
.Typ
= Universal_Integer
20036 or else It
.Typ
= Universal_Real
20041 Get_Next_Interp
(Index
, It
);
20046 end Universal_Interpretation
;
20052 function Unqualify
(Expr
: Node_Id
) return Node_Id
is
20054 -- Recurse to handle unlikely case of multiple levels of qualification
20056 if Nkind
(Expr
) = N_Qualified_Expression
then
20057 return Unqualify
(Expression
(Expr
));
20059 -- Normal case, not a qualified expression
20066 -----------------------
20067 -- Visible_Ancestors --
20068 -----------------------
20070 function Visible_Ancestors
(Typ
: Entity_Id
) return Elist_Id
is
20076 pragma Assert
(Is_Record_Type
(Typ
) and then Is_Tagged_Type
(Typ
));
20078 -- Collect all the parents and progenitors of Typ. If the full-view of
20079 -- private parents and progenitors is available then it is used to
20080 -- generate the list of visible ancestors; otherwise their partial
20081 -- view is added to the resulting list.
20086 Use_Full_View
=> True);
20090 Ifaces_List
=> List_2
,
20091 Exclude_Parents
=> True,
20092 Use_Full_View
=> True);
20094 -- Join the two lists. Avoid duplications because an interface may
20095 -- simultaneously be parent and progenitor of a type.
20097 Elmt
:= First_Elmt
(List_2
);
20098 while Present
(Elmt
) loop
20099 Append_Unique_Elmt
(Node
(Elmt
), List_1
);
20104 end Visible_Ancestors
;
20106 ----------------------
20107 -- Within_Init_Proc --
20108 ----------------------
20110 function Within_Init_Proc
return Boolean is
20114 S
:= Current_Scope
;
20115 while not Is_Overloadable
(S
) loop
20116 if S
= Standard_Standard
then
20123 return Is_Init_Proc
(S
);
20124 end Within_Init_Proc
;
20130 function Within_Scope
(E
: Entity_Id
; S
: Entity_Id
) return Boolean is
20137 elsif SE
= Standard_Standard
then
20149 procedure Wrong_Type
(Expr
: Node_Id
; Expected_Type
: Entity_Id
) is
20150 Found_Type
: constant Entity_Id
:= First_Subtype
(Etype
(Expr
));
20151 Expec_Type
: constant Entity_Id
:= First_Subtype
(Expected_Type
);
20153 Matching_Field
: Entity_Id
;
20154 -- Entity to give a more precise suggestion on how to write a one-
20155 -- element positional aggregate.
20157 function Has_One_Matching_Field
return Boolean;
20158 -- Determines if Expec_Type is a record type with a single component or
20159 -- discriminant whose type matches the found type or is one dimensional
20160 -- array whose component type matches the found type. In the case of
20161 -- one discriminant, we ignore the variant parts. That's not accurate,
20162 -- but good enough for the warning.
20164 ----------------------------
20165 -- Has_One_Matching_Field --
20166 ----------------------------
20168 function Has_One_Matching_Field
return Boolean is
20172 Matching_Field
:= Empty
;
20174 if Is_Array_Type
(Expec_Type
)
20175 and then Number_Dimensions
(Expec_Type
) = 1
20176 and then Covers
(Etype
(Component_Type
(Expec_Type
)), Found_Type
)
20178 -- Use type name if available. This excludes multidimensional
20179 -- arrays and anonymous arrays.
20181 if Comes_From_Source
(Expec_Type
) then
20182 Matching_Field
:= Expec_Type
;
20184 -- For an assignment, use name of target
20186 elsif Nkind
(Parent
(Expr
)) = N_Assignment_Statement
20187 and then Is_Entity_Name
(Name
(Parent
(Expr
)))
20189 Matching_Field
:= Entity
(Name
(Parent
(Expr
)));
20194 elsif not Is_Record_Type
(Expec_Type
) then
20198 E
:= First_Entity
(Expec_Type
);
20203 elsif not Ekind_In
(E
, E_Discriminant
, E_Component
)
20204 or else Nam_In
(Chars
(E
), Name_uTag
, Name_uParent
)
20213 if not Covers
(Etype
(E
), Found_Type
) then
20216 elsif Present
(Next_Entity
(E
))
20217 and then (Ekind
(E
) = E_Component
20218 or else Ekind
(Next_Entity
(E
)) = E_Discriminant
)
20223 Matching_Field
:= E
;
20227 end Has_One_Matching_Field
;
20229 -- Start of processing for Wrong_Type
20232 -- Don't output message if either type is Any_Type, or if a message
20233 -- has already been posted for this node. We need to do the latter
20234 -- check explicitly (it is ordinarily done in Errout), because we
20235 -- are using ! to force the output of the error messages.
20237 if Expec_Type
= Any_Type
20238 or else Found_Type
= Any_Type
20239 or else Error_Posted
(Expr
)
20243 -- If one of the types is a Taft-Amendment type and the other it its
20244 -- completion, it must be an illegal use of a TAT in the spec, for
20245 -- which an error was already emitted. Avoid cascaded errors.
20247 elsif Is_Incomplete_Type
(Expec_Type
)
20248 and then Has_Completion_In_Body
(Expec_Type
)
20249 and then Full_View
(Expec_Type
) = Etype
(Expr
)
20253 elsif Is_Incomplete_Type
(Etype
(Expr
))
20254 and then Has_Completion_In_Body
(Etype
(Expr
))
20255 and then Full_View
(Etype
(Expr
)) = Expec_Type
20259 -- In an instance, there is an ongoing problem with completion of
20260 -- type derived from private types. Their structure is what Gigi
20261 -- expects, but the Etype is the parent type rather than the
20262 -- derived private type itself. Do not flag error in this case. The
20263 -- private completion is an entity without a parent, like an Itype.
20264 -- Similarly, full and partial views may be incorrect in the instance.
20265 -- There is no simple way to insure that it is consistent ???
20267 -- A similar view discrepancy can happen in an inlined body, for the
20268 -- same reason: inserted body may be outside of the original package
20269 -- and only partial views are visible at the point of insertion.
20271 elsif In_Instance
or else In_Inlined_Body
then
20272 if Etype
(Etype
(Expr
)) = Etype
(Expected_Type
)
20274 (Has_Private_Declaration
(Expected_Type
)
20275 or else Has_Private_Declaration
(Etype
(Expr
)))
20276 and then No
(Parent
(Expected_Type
))
20280 elsif Nkind
(Parent
(Expr
)) = N_Qualified_Expression
20281 and then Entity
(Subtype_Mark
(Parent
(Expr
))) = Expected_Type
20285 elsif Is_Private_Type
(Expected_Type
)
20286 and then Present
(Full_View
(Expected_Type
))
20287 and then Covers
(Full_View
(Expected_Type
), Etype
(Expr
))
20291 -- Conversely, type of expression may be the private one
20293 elsif Is_Private_Type
(Base_Type
(Etype
(Expr
)))
20294 and then Full_View
(Base_Type
(Etype
(Expr
))) = Expected_Type
20300 -- An interesting special check. If the expression is parenthesized
20301 -- and its type corresponds to the type of the sole component of the
20302 -- expected record type, or to the component type of the expected one
20303 -- dimensional array type, then assume we have a bad aggregate attempt.
20305 if Nkind
(Expr
) in N_Subexpr
20306 and then Paren_Count
(Expr
) /= 0
20307 and then Has_One_Matching_Field
20309 Error_Msg_N
("positional aggregate cannot have one component", Expr
);
20311 if Present
(Matching_Field
) then
20312 if Is_Array_Type
(Expec_Type
) then
20314 ("\write instead `&''First ='> ...`", Expr
, Matching_Field
);
20317 ("\write instead `& ='> ...`", Expr
, Matching_Field
);
20321 -- Another special check, if we are looking for a pool-specific access
20322 -- type and we found an E_Access_Attribute_Type, then we have the case
20323 -- of an Access attribute being used in a context which needs a pool-
20324 -- specific type, which is never allowed. The one extra check we make
20325 -- is that the expected designated type covers the Found_Type.
20327 elsif Is_Access_Type
(Expec_Type
)
20328 and then Ekind
(Found_Type
) = E_Access_Attribute_Type
20329 and then Ekind
(Base_Type
(Expec_Type
)) /= E_General_Access_Type
20330 and then Ekind
(Base_Type
(Expec_Type
)) /= E_Anonymous_Access_Type
20332 (Designated_Type
(Expec_Type
), Designated_Type
(Found_Type
))
20334 Error_Msg_N
-- CODEFIX
20335 ("result must be general access type!", Expr
);
20336 Error_Msg_NE
-- CODEFIX
20337 ("add ALL to }!", Expr
, Expec_Type
);
20339 -- Another special check, if the expected type is an integer type,
20340 -- but the expression is of type System.Address, and the parent is
20341 -- an addition or subtraction operation whose left operand is the
20342 -- expression in question and whose right operand is of an integral
20343 -- type, then this is an attempt at address arithmetic, so give
20344 -- appropriate message.
20346 elsif Is_Integer_Type
(Expec_Type
)
20347 and then Is_RTE
(Found_Type
, RE_Address
)
20348 and then Nkind_In
(Parent
(Expr
), N_Op_Add
, N_Op_Subtract
)
20349 and then Expr
= Left_Opnd
(Parent
(Expr
))
20350 and then Is_Integer_Type
(Etype
(Right_Opnd
(Parent
(Expr
))))
20353 ("address arithmetic not predefined in package System",
20356 ("\possible missing with/use of System.Storage_Elements",
20360 -- If the expected type is an anonymous access type, as for access
20361 -- parameters and discriminants, the error is on the designated types.
20363 elsif Ekind
(Expec_Type
) = E_Anonymous_Access_Type
then
20364 if Comes_From_Source
(Expec_Type
) then
20365 Error_Msg_NE
("expected}!", Expr
, Expec_Type
);
20368 ("expected an access type with designated}",
20369 Expr
, Designated_Type
(Expec_Type
));
20372 if Is_Access_Type
(Found_Type
)
20373 and then not Comes_From_Source
(Found_Type
)
20376 ("\\found an access type with designated}!",
20377 Expr
, Designated_Type
(Found_Type
));
20379 if From_Limited_With
(Found_Type
) then
20380 Error_Msg_NE
("\\found incomplete}!", Expr
, Found_Type
);
20381 Error_Msg_Qual_Level
:= 99;
20382 Error_Msg_NE
-- CODEFIX
20383 ("\\missing `WITH &;", Expr
, Scope
(Found_Type
));
20384 Error_Msg_Qual_Level
:= 0;
20386 Error_Msg_NE
("found}!", Expr
, Found_Type
);
20390 -- Normal case of one type found, some other type expected
20393 -- If the names of the two types are the same, see if some number
20394 -- of levels of qualification will help. Don't try more than three
20395 -- levels, and if we get to standard, it's no use (and probably
20396 -- represents an error in the compiler) Also do not bother with
20397 -- internal scope names.
20400 Expec_Scope
: Entity_Id
;
20401 Found_Scope
: Entity_Id
;
20404 Expec_Scope
:= Expec_Type
;
20405 Found_Scope
:= Found_Type
;
20407 for Levels
in Nat
range 0 .. 3 loop
20408 if Chars
(Expec_Scope
) /= Chars
(Found_Scope
) then
20409 Error_Msg_Qual_Level
:= Levels
;
20413 Expec_Scope
:= Scope
(Expec_Scope
);
20414 Found_Scope
:= Scope
(Found_Scope
);
20416 exit when Expec_Scope
= Standard_Standard
20417 or else Found_Scope
= Standard_Standard
20418 or else not Comes_From_Source
(Expec_Scope
)
20419 or else not Comes_From_Source
(Found_Scope
);
20423 if Is_Record_Type
(Expec_Type
)
20424 and then Present
(Corresponding_Remote_Type
(Expec_Type
))
20426 Error_Msg_NE
("expected}!", Expr
,
20427 Corresponding_Remote_Type
(Expec_Type
));
20429 Error_Msg_NE
("expected}!", Expr
, Expec_Type
);
20432 if Is_Entity_Name
(Expr
)
20433 and then Is_Package_Or_Generic_Package
(Entity
(Expr
))
20435 Error_Msg_N
("\\found package name!", Expr
);
20437 elsif Is_Entity_Name
(Expr
)
20438 and then Ekind_In
(Entity
(Expr
), E_Procedure
, E_Generic_Procedure
)
20440 if Ekind
(Expec_Type
) = E_Access_Subprogram_Type
then
20442 ("found procedure name, possibly missing Access attribute!",
20446 ("\\found procedure name instead of function!", Expr
);
20449 elsif Nkind
(Expr
) = N_Function_Call
20450 and then Ekind
(Expec_Type
) = E_Access_Subprogram_Type
20451 and then Etype
(Designated_Type
(Expec_Type
)) = Etype
(Expr
)
20452 and then No
(Parameter_Associations
(Expr
))
20455 ("found function name, possibly missing Access attribute!",
20458 -- Catch common error: a prefix or infix operator which is not
20459 -- directly visible because the type isn't.
20461 elsif Nkind
(Expr
) in N_Op
20462 and then Is_Overloaded
(Expr
)
20463 and then not Is_Immediately_Visible
(Expec_Type
)
20464 and then not Is_Potentially_Use_Visible
(Expec_Type
)
20465 and then not In_Use
(Expec_Type
)
20466 and then Has_Compatible_Type
(Right_Opnd
(Expr
), Expec_Type
)
20469 ("operator of the type is not directly visible!", Expr
);
20471 elsif Ekind
(Found_Type
) = E_Void
20472 and then Present
(Parent
(Found_Type
))
20473 and then Nkind
(Parent
(Found_Type
)) = N_Full_Type_Declaration
20475 Error_Msg_NE
("\\found premature usage of}!", Expr
, Found_Type
);
20478 Error_Msg_NE
("\\found}!", Expr
, Found_Type
);
20481 -- A special check for cases like M1 and M2 = 0 where M1 and M2 are
20482 -- of the same modular type, and (M1 and M2) = 0 was intended.
20484 if Expec_Type
= Standard_Boolean
20485 and then Is_Modular_Integer_Type
(Found_Type
)
20486 and then Nkind_In
(Parent
(Expr
), N_Op_And
, N_Op_Or
, N_Op_Xor
)
20487 and then Nkind
(Right_Opnd
(Parent
(Expr
))) in N_Op_Compare
20490 Op
: constant Node_Id
:= Right_Opnd
(Parent
(Expr
));
20491 L
: constant Node_Id
:= Left_Opnd
(Op
);
20492 R
: constant Node_Id
:= Right_Opnd
(Op
);
20495 -- The case for the message is when the left operand of the
20496 -- comparison is the same modular type, or when it is an
20497 -- integer literal (or other universal integer expression),
20498 -- which would have been typed as the modular type if the
20499 -- parens had been there.
20501 if (Etype
(L
) = Found_Type
20503 Etype
(L
) = Universal_Integer
)
20504 and then Is_Integer_Type
(Etype
(R
))
20507 ("\\possible missing parens for modular operation", Expr
);
20512 -- Reset error message qualification indication
20514 Error_Msg_Qual_Level
:= 0;
20518 --------------------------------
20519 -- Yields_Synchronized_Object --
20520 --------------------------------
20522 function Yields_Synchronized_Object
(Typ
: Entity_Id
) return Boolean is
20523 Has_Sync_Comp
: Boolean := False;
20527 -- An array type yields a synchronized object if its component type
20528 -- yields a synchronized object.
20530 if Is_Array_Type
(Typ
) then
20531 return Yields_Synchronized_Object
(Component_Type
(Typ
));
20533 -- A descendant of type Ada.Synchronous_Task_Control.Suspension_Object
20534 -- yields a synchronized object by default.
20536 elsif Is_Descendant_Of_Suspension_Object
(Typ
) then
20539 -- A protected type yields a synchronized object by default
20541 elsif Is_Protected_Type
(Typ
) then
20544 -- A record type or type extension yields a synchronized object when its
20545 -- discriminants (if any) lack default values and all components are of
20546 -- a type that yelds a synchronized object.
20548 elsif Is_Record_Type
(Typ
) then
20550 -- Inspect all entities defined in the scope of the type, looking for
20551 -- components of a type that does not yeld a synchronized object or
20552 -- for discriminants with default values.
20554 Id
:= First_Entity
(Typ
);
20555 while Present
(Id
) loop
20556 if Comes_From_Source
(Id
) then
20557 if Ekind
(Id
) = E_Component
then
20558 if Yields_Synchronized_Object
(Etype
(Id
)) then
20559 Has_Sync_Comp
:= True;
20561 -- The component does not yield a synchronized object
20567 elsif Ekind
(Id
) = E_Discriminant
20568 and then Present
(Expression
(Parent
(Id
)))
20577 -- Ensure that the parent type of a type extension yields a
20578 -- synchronized object.
20580 if Etype
(Typ
) /= Typ
20581 and then not Yields_Synchronized_Object
(Etype
(Typ
))
20586 -- If we get here, then all discriminants lack default values and all
20587 -- components are of a type that yields a synchronized object.
20589 return Has_Sync_Comp
;
20591 -- A synchronized interface type yields a synchronized object by default
20593 elsif Is_Synchronized_Interface
(Typ
) then
20596 -- A task type yelds a synchronized object by default
20598 elsif Is_Task_Type
(Typ
) then
20601 -- Otherwise the type does not yield a synchronized object
20606 end Yields_Synchronized_Object
;