1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2022, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree
; use Atree
;
27 with Einfo
; use Einfo
;
28 with Einfo
.Entities
; use Einfo
.Entities
;
29 with Einfo
.Utils
; use Einfo
.Utils
;
30 with Nlists
; use Nlists
;
31 with Sinfo
; use Sinfo
;
32 with Sinfo
.Nodes
; use Sinfo
.Nodes
;
33 with Sinfo
.Utils
; use Sinfo
.Utils
;
34 with Snames
; use Snames
;
35 with Stand
; use Stand
;
36 with Uintp
; use Uintp
;
38 package body Sem_Aux
is
40 ----------------------
41 -- Ancestor_Subtype --
42 ----------------------
44 function Ancestor_Subtype
(Typ
: Entity_Id
) return Entity_Id
is
46 -- If this is first subtype, or is a base type, then there is no
47 -- ancestor subtype, so we return Empty to indicate this fact.
49 if Is_First_Subtype
(Typ
) or else Is_Base_Type
(Typ
) then
54 D
: constant Node_Id
:= Declaration_Node
(Typ
);
57 -- If we have a subtype declaration, get the ancestor subtype
59 if Nkind
(D
) = N_Subtype_Declaration
then
60 if Nkind
(Subtype_Indication
(D
)) = N_Subtype_Indication
then
61 return Entity
(Subtype_Mark
(Subtype_Indication
(D
)));
63 return Entity
(Subtype_Indication
(D
));
66 -- If not, then no subtype indication is available
78 function Available_View
(Ent
: Entity_Id
) return Entity_Id
is
80 -- Obtain the non-limited view (if available)
82 if Has_Non_Limited_View
(Ent
) then
83 return Get_Full_View
(Non_Limited_View
(Ent
));
85 -- In all other cases, return entity unchanged
96 function Constant_Value
(Ent
: Entity_Id
) return Node_Id
is
97 D
: constant Node_Id
:= Declaration_Node
(Ent
);
101 -- If we have no declaration node, then return no constant value. Not
102 -- clear how this can happen, but it does sometimes and this is the
108 -- Normal case where a declaration node is present
110 elsif Nkind
(D
) = N_Object_Renaming_Declaration
then
111 return Renamed_Object
(Ent
);
113 -- If this is a component declaration whose entity is a constant, it is
114 -- a prival within a protected function (and so has no constant value).
116 elsif Nkind
(D
) = N_Component_Declaration
then
119 -- If there is an expression, return it
121 elsif Present
(Expression
(D
)) then
122 return Expression
(D
);
124 -- For a constant, see if we have a full view
126 elsif Ekind
(Ent
) = E_Constant
127 and then Present
(Full_View
(Ent
))
129 Full_D
:= Parent
(Full_View
(Ent
));
131 -- The full view may have been rewritten as an object renaming
133 if Nkind
(Full_D
) = N_Object_Renaming_Declaration
then
134 return Name
(Full_D
);
136 return Expression
(Full_D
);
139 -- Otherwise we have no expression to return
146 ---------------------------------
147 -- Corresponding_Unsigned_Type --
148 ---------------------------------
150 function Corresponding_Unsigned_Type
(Typ
: Entity_Id
) return Entity_Id
is
151 pragma Assert
(Is_Signed_Integer_Type
(Typ
));
152 Siz
: constant Uint
:= Esize
(Base_Type
(Typ
));
154 if Siz
= Esize
(Standard_Short_Short_Integer
) then
155 return Standard_Short_Short_Unsigned
;
156 elsif Siz
= Esize
(Standard_Short_Integer
) then
157 return Standard_Short_Unsigned
;
158 elsif Siz
= Esize
(Standard_Unsigned
) then
159 return Standard_Unsigned
;
160 elsif Siz
= Esize
(Standard_Long_Integer
) then
161 return Standard_Long_Unsigned
;
162 elsif Siz
= Esize
(Standard_Long_Long_Integer
) then
163 return Standard_Long_Long_Unsigned
;
164 elsif Siz
= Esize
(Standard_Long_Long_Long_Integer
) then
165 return Standard_Long_Long_Long_Unsigned
;
169 end Corresponding_Unsigned_Type
;
171 -----------------------------
172 -- Enclosing_Dynamic_Scope --
173 -----------------------------
175 function Enclosing_Dynamic_Scope
(Ent
: Entity_Id
) return Entity_Id
is
179 -- The following test is an error defense against some syntax errors
180 -- that can leave scopes very messed up.
182 if Ent
= Standard_Standard
then
186 -- Normal case, search enclosing scopes
188 -- Note: the test for Present (S) should not be required, it defends
189 -- against an ill-formed tree.
193 -- If we somehow got an empty value for Scope, the tree must be
194 -- malformed. Rather than blow up we return Standard in this case.
197 return Standard_Standard
;
199 -- Quit if we get to standard or a dynamic scope. We must also
200 -- handle enclosing scopes that have a full view; required to
201 -- locate enclosing scopes that are synchronized private types
202 -- whose full view is a task type.
204 elsif S
= Standard_Standard
205 or else Is_Dynamic_Scope
(S
)
206 or else (Is_Private_Type
(S
)
207 and then Present
(Full_View
(S
))
208 and then Is_Dynamic_Scope
(Full_View
(S
)))
212 -- Otherwise keep climbing
218 end Enclosing_Dynamic_Scope
;
220 ------------------------
221 -- First_Discriminant --
222 ------------------------
224 function First_Discriminant
(Typ
: Entity_Id
) return Entity_Id
is
229 (Has_Discriminants
(Typ
) or else Has_Unknown_Discriminants
(Typ
));
231 Ent
:= First_Entity
(Typ
);
233 -- The discriminants are not necessarily contiguous, because access
234 -- discriminants will generate itypes. They are not the first entities
235 -- either because the tag must be ahead of them.
237 if Chars
(Ent
) = Name_uTag
then
241 -- Skip all hidden stored discriminants if any
243 while Present
(Ent
) loop
244 exit when Ekind
(Ent
) = E_Discriminant
245 and then not Is_Completely_Hidden
(Ent
);
250 -- Call may be on a private type with unknown discriminants, in which
251 -- case Ent is Empty, and as per the spec, we return Empty in this case.
253 -- Historical note: The assertion in previous versions that Ent is a
254 -- discriminant was overly cautious and prevented convenient application
255 -- of this function in the gnatprove context.
258 end First_Discriminant
;
260 -------------------------------
261 -- First_Stored_Discriminant --
262 -------------------------------
264 function First_Stored_Discriminant
(Typ
: Entity_Id
) return Entity_Id
is
267 function Has_Completely_Hidden_Discriminant
268 (Typ
: Entity_Id
) return Boolean;
269 -- Scans the Discriminants to see whether any are Completely_Hidden
270 -- (the mechanism for describing non-specified stored discriminants)
271 -- Note that the entity list for the type may contain anonymous access
272 -- types created by expressions that constrain access discriminants.
274 ----------------------------------------
275 -- Has_Completely_Hidden_Discriminant --
276 ----------------------------------------
278 function Has_Completely_Hidden_Discriminant
279 (Typ
: Entity_Id
) return Boolean
284 pragma Assert
(Ekind
(Typ
) = E_Discriminant
);
287 while Present
(Ent
) loop
289 -- Skip anonymous types that may be created by expressions
290 -- used as discriminant constraints on inherited discriminants.
292 if Is_Itype
(Ent
) then
295 elsif Ekind
(Ent
) = E_Discriminant
296 and then Is_Completely_Hidden
(Ent
)
305 end Has_Completely_Hidden_Discriminant
;
307 -- Start of processing for First_Stored_Discriminant
311 (Has_Discriminants
(Typ
)
312 or else Has_Unknown_Discriminants
(Typ
));
314 Ent
:= First_Entity
(Typ
);
316 if Chars
(Ent
) = Name_uTag
then
320 if Has_Completely_Hidden_Discriminant
(Ent
) then
321 while Present
(Ent
) loop
322 exit when Ekind
(Ent
) = E_Discriminant
323 and then Is_Completely_Hidden
(Ent
);
328 pragma Assert
(Ekind
(Ent
) = E_Discriminant
);
331 end First_Stored_Discriminant
;
337 function First_Subtype
(Typ
: Entity_Id
) return Entity_Id
is
338 B
: constant Entity_Id
:= Base_Type
(Typ
);
339 F
: Node_Id
:= Freeze_Node
(B
);
343 -- The freeze node of a ghost type might have been rewritten in a null
344 -- statement by the time gigi calls First_Subtype on the corresponding
347 if Nkind
(F
) = N_Null_Statement
then
348 F
:= Original_Node
(F
);
351 -- If the base type has no freeze node, it is a type in Standard, and
352 -- always acts as its own first subtype, except where it is one of the
353 -- predefined integer types. If the type is formal, it is also a first
354 -- subtype, and its base type has no freeze node. On the other hand, a
355 -- subtype of a generic formal is not its own first subtype. Its base
356 -- type, if anonymous, is attached to the formal type declaration from
357 -- which the first subtype is obtained.
360 if B
= Base_Type
(Standard_Integer
) then
361 return Standard_Integer
;
363 elsif B
= Base_Type
(Standard_Long_Integer
) then
364 return Standard_Long_Integer
;
366 elsif B
= Base_Type
(Standard_Short_Short_Integer
) then
367 return Standard_Short_Short_Integer
;
369 elsif B
= Base_Type
(Standard_Short_Integer
) then
370 return Standard_Short_Integer
;
372 elsif B
= Base_Type
(Standard_Long_Long_Integer
) then
373 return Standard_Long_Long_Integer
;
375 elsif B
= Base_Type
(Standard_Long_Long_Long_Integer
) then
376 return Standard_Long_Long_Long_Integer
;
378 elsif Is_Generic_Type
(Typ
) then
379 if Present
(Parent
(B
)) then
380 return Defining_Identifier
(Parent
(B
));
382 return Defining_Identifier
(Associated_Node_For_Itype
(B
));
389 -- Otherwise we check the freeze node, if it has a First_Subtype_Link
390 -- then we use that link, otherwise (happens with some Itypes), we use
391 -- the base type itself.
394 Ent
:= First_Subtype_Link
(F
);
396 if Present
(Ent
) then
404 -------------------------
405 -- First_Tag_Component --
406 -------------------------
408 function First_Tag_Component
(Typ
: Entity_Id
) return Entity_Id
is
413 pragma Assert
(Is_Tagged_Type
(Typ
)
414 or else Is_Class_Wide_Equivalent_Type
(Typ
));
418 if Is_Class_Wide_Type
(Ctyp
) then
419 Ctyp
:= Root_Type
(Ctyp
);
422 if Is_Private_Type
(Ctyp
) then
423 Ctyp
:= Underlying_Type
(Ctyp
);
425 -- If the underlying type is missing then the source program has
426 -- errors and there is nothing else to do (the full-type declaration
427 -- associated with the private type declaration is missing).
434 Comp
:= First_Entity
(Ctyp
);
435 while Present
(Comp
) loop
436 if Is_Tag
(Comp
) then
443 -- No tag component found
446 end First_Tag_Component
;
448 -----------------------
449 -- Get_Called_Entity --
450 -----------------------
452 function Get_Called_Entity
(Call
: Node_Id
) return Entity_Id
is
453 Nam
: constant Node_Id
:= Name
(Call
);
457 if Nkind
(Nam
) = N_Explicit_Dereference
then
459 pragma Assert
(Ekind
(Id
) = E_Subprogram_Type
);
461 elsif Nkind
(Nam
) = N_Selected_Component
then
462 Id
:= Entity
(Selector_Name
(Nam
));
464 elsif Nkind
(Nam
) = N_Indexed_Component
then
465 Id
:= Entity
(Selector_Name
(Prefix
(Nam
)));
472 end Get_Called_Entity
;
478 function Get_Rep_Item
481 Check_Parents
: Boolean := True) return Node_Id
486 N
:= First_Rep_Item
(E
);
487 while Present
(N
) loop
489 -- Only one of Priority / Interrupt_Priority can be specified, so
490 -- return whichever one is present to catch illegal duplication.
492 if Nkind
(N
) = N_Pragma
494 (Pragma_Name_Unmapped
(N
) = Nam
495 or else (Nam
= Name_Priority
496 and then Pragma_Name
(N
) =
497 Name_Interrupt_Priority
)
498 or else (Nam
= Name_Interrupt_Priority
499 and then Pragma_Name
(N
) = Name_Priority
))
501 if Check_Parents
then
504 -- If Check_Parents is False, return N if the pragma doesn't
505 -- appear in the Rep_Item chain of the parent.
509 Par
: constant Entity_Id
:= Nearest_Ancestor
(E
);
510 -- This node represents the parent type of type E (if any)
516 elsif not Present_In_Rep_Item
(Par
, N
) then
522 elsif Nkind
(N
) = N_Attribute_Definition_Clause
525 or else (Nam
= Name_Priority
526 and then Chars
(N
) = Name_Interrupt_Priority
))
528 if Check_Parents
or else Entity
(N
) = E
then
532 elsif Nkind
(N
) = N_Aspect_Specification
534 (Chars
(Identifier
(N
)) = Nam
537 and then Chars
(Identifier
(N
)) = Name_Interrupt_Priority
))
539 if Check_Parents
then
542 elsif Entity
(N
) = E
then
546 -- A Ghost-related aspect, if disabled, may have been replaced by a
549 elsif Nkind
(N
) = N_Null_Statement
then
550 N
:= Original_Node
(N
);
559 function Get_Rep_Item
563 Check_Parents
: Boolean := True) return Node_Id
565 Nam1_Item
: constant Node_Id
:= Get_Rep_Item
(E
, Nam1
, Check_Parents
);
566 Nam2_Item
: constant Node_Id
:= Get_Rep_Item
(E
, Nam2
, Check_Parents
);
571 -- Check both Nam1_Item and Nam2_Item are present
573 if No
(Nam1_Item
) then
575 elsif No
(Nam2_Item
) then
579 -- Return the first node encountered in the list
581 N
:= First_Rep_Item
(E
);
582 while Present
(N
) loop
583 if N
= Nam1_Item
or else N
= Nam2_Item
then
597 function Get_Rep_Pragma
600 Check_Parents
: Boolean := True) return Node_Id
602 N
: constant Node_Id
:= Get_Rep_Item
(E
, Nam
, Check_Parents
);
605 if Present
(N
) and then Nkind
(N
) = N_Pragma
then
612 function Get_Rep_Pragma
616 Check_Parents
: Boolean := True) return Node_Id
618 Nam1_Item
: constant Node_Id
:= Get_Rep_Pragma
(E
, Nam1
, Check_Parents
);
619 Nam2_Item
: constant Node_Id
:= Get_Rep_Pragma
(E
, Nam2
, Check_Parents
);
624 -- Check both Nam1_Item and Nam2_Item are present
626 if No
(Nam1_Item
) then
628 elsif No
(Nam2_Item
) then
632 -- Return the first node encountered in the list
634 N
:= First_Rep_Item
(E
);
635 while Present
(N
) loop
636 if N
= Nam1_Item
or else N
= Nam2_Item
then
646 ---------------------------------
647 -- Has_External_Tag_Rep_Clause --
648 ---------------------------------
650 function Has_External_Tag_Rep_Clause
(T
: Entity_Id
) return Boolean is
652 pragma Assert
(Is_Tagged_Type
(T
));
653 return Has_Rep_Item
(T
, Name_External_Tag
, Check_Parents
=> False);
654 end Has_External_Tag_Rep_Clause
;
660 function Has_Rep_Item
663 Check_Parents
: Boolean := True) return Boolean
666 return Present
(Get_Rep_Item
(E
, Nam
, Check_Parents
));
669 function Has_Rep_Item
673 Check_Parents
: Boolean := True) return Boolean
676 return Present
(Get_Rep_Item
(E
, Nam1
, Nam2
, Check_Parents
));
683 function Has_Rep_Pragma
686 Check_Parents
: Boolean := True) return Boolean
689 return Present
(Get_Rep_Pragma
(E
, Nam
, Check_Parents
));
692 function Has_Rep_Pragma
696 Check_Parents
: Boolean := True) return Boolean
699 return Present
(Get_Rep_Pragma
(E
, Nam1
, Nam2
, Check_Parents
));
702 --------------------------------
703 -- Has_Unconstrained_Elements --
704 --------------------------------
706 function Has_Unconstrained_Elements
(T
: Entity_Id
) return Boolean is
707 U_T
: constant Entity_Id
:= Underlying_Type
(T
);
711 elsif Is_Record_Type
(U_T
) then
712 return Has_Discriminants
(U_T
) and then not Is_Constrained
(U_T
);
713 elsif Is_Array_Type
(U_T
) then
714 return Has_Unconstrained_Elements
(Component_Type
(U_T
));
718 end Has_Unconstrained_Elements
;
720 ----------------------
721 -- Has_Variant_Part --
722 ----------------------
724 function Has_Variant_Part
(Typ
: Entity_Id
) return Boolean is
731 if not Is_Type
(Typ
) then
735 FSTyp
:= First_Subtype
(Typ
);
737 if not Has_Discriminants
(FSTyp
) then
741 -- Proceed with cautious checks here, return False if tree is not
742 -- as expected (may be caused by prior errors).
744 Decl
:= Declaration_Node
(FSTyp
);
746 if Nkind
(Decl
) /= N_Full_Type_Declaration
then
750 TDef
:= Type_Definition
(Decl
);
752 if Nkind
(TDef
) /= N_Record_Definition
then
756 CList
:= Component_List
(TDef
);
758 if Nkind
(CList
) /= N_Component_List
then
761 return Present
(Variant_Part
(CList
));
763 end Has_Variant_Part
;
765 ---------------------
766 -- In_Generic_Body --
767 ---------------------
769 function In_Generic_Body
(Id
: Entity_Id
) return Boolean is
773 -- Climb scopes looking for generic body
776 while Present
(S
) and then S
/= Standard_Standard
loop
778 -- Generic package body
780 if Ekind
(S
) = E_Generic_Package
781 and then In_Package_Body
(S
)
785 -- Generic subprogram body
787 elsif Is_Subprogram
(S
)
788 and then Nkind
(Unit_Declaration_Node
(S
)) =
789 N_Generic_Subprogram_Declaration
797 -- False if top of scope stack without finding a generic body
802 -------------------------------
803 -- Initialization_Suppressed --
804 -------------------------------
806 function Initialization_Suppressed
(Typ
: Entity_Id
) return Boolean is
808 return Suppress_Initialization
(Typ
)
809 or else Suppress_Initialization
(Base_Type
(Typ
));
810 end Initialization_Suppressed
;
816 procedure Initialize
is
818 Obsolescent_Warnings
.Init
;
825 function Is_Body
(N
: Node_Id
) return Boolean is
828 N_Body_Stub | N_Entry_Body | N_Package_Body | N_Protected_Body |
829 N_Subprogram_Body | N_Task_Body
;
832 ---------------------
833 -- Is_By_Copy_Type --
834 ---------------------
836 function Is_By_Copy_Type
(Ent
: Entity_Id
) return Boolean is
838 -- If Id is a private type whose full declaration has not been seen,
839 -- we assume for now that it is not a By_Copy type. Clearly this
840 -- attribute should not be used before the type is frozen, but it is
841 -- needed to build the associated record of a protected type. Another
842 -- place where some lookahead for a full view is needed ???
845 Is_Elementary_Type
(Ent
)
846 or else (Is_Private_Type
(Ent
)
847 and then Present
(Underlying_Type
(Ent
))
848 and then Is_Elementary_Type
(Underlying_Type
(Ent
)));
851 --------------------------
852 -- Is_By_Reference_Type --
853 --------------------------
855 function Is_By_Reference_Type
(Ent
: Entity_Id
) return Boolean is
856 Btype
: constant Entity_Id
:= Base_Type
(Ent
);
859 if Is_Private_Type
(Btype
) then
861 Utyp
: constant Entity_Id
:= Underlying_Type
(Btype
);
866 return Is_By_Reference_Type
(Utyp
);
870 elsif Is_Incomplete_Type
(Btype
) then
872 Ftyp
: constant Entity_Id
:= Full_View
(Btype
);
874 -- Return true for a tagged incomplete type built as a shadow
875 -- entity in Build_Limited_Views. It can appear in the profile
876 -- of a thunk and the back end needs to know how it is passed.
879 return Is_Tagged_Type
(Btype
);
881 return Is_By_Reference_Type
(Ftyp
);
885 elsif Is_Concurrent_Type
(Btype
) then
888 elsif Is_Record_Type
(Btype
) then
889 if Is_Limited_Record
(Btype
)
890 or else Is_Tagged_Type
(Btype
)
891 or else Is_Volatile
(Btype
)
900 C
:= First_Component
(Btype
);
901 while Present
(C
) loop
903 -- For each component, test if its type is a by reference
904 -- type and if its type is volatile. Also test the component
905 -- itself for being volatile. This happens for example when
906 -- a Volatile aspect is added to a component.
908 if Is_By_Reference_Type
(Etype
(C
))
909 or else Is_Volatile
(Etype
(C
))
910 or else Is_Volatile
(C
)
922 elsif Is_Array_Type
(Btype
) then
925 or else Is_By_Reference_Type
(Component_Type
(Btype
))
926 or else Is_Volatile
(Component_Type
(Btype
))
927 or else Has_Volatile_Components
(Btype
);
932 end Is_By_Reference_Type
;
934 -------------------------
935 -- Is_Definite_Subtype --
936 -------------------------
938 function Is_Definite_Subtype
(T
: Entity_Id
) return Boolean is
939 pragma Assert
(Is_Type
(T
));
940 K
: constant Entity_Kind
:= Ekind
(T
);
943 if Is_Constrained
(T
) then
946 elsif K
in Array_Kind
947 or else K
in Class_Wide_Kind
948 or else Has_Unknown_Discriminants
(T
)
952 -- Known discriminants: definite if there are default values. Note that
953 -- if any discriminant has a default, they all do.
955 elsif Has_Discriminants
(T
) then
956 return Present
(Discriminant_Default_Value
(First_Discriminant
(T
)));
961 end Is_Definite_Subtype
;
963 ---------------------
964 -- Is_Derived_Type --
965 ---------------------
967 function Is_Derived_Type
(Ent
: Entity_Id
) return B
is
972 and then Base_Type
(Ent
) /= Root_Type
(Ent
)
973 and then not Is_Class_Wide_Type
(Ent
)
975 -- An access_to_subprogram whose result type is a limited view can
976 -- appear in a return statement, without the full view of the result
977 -- type being available. Do not interpret this as a derived type.
979 and then Ekind
(Ent
) /= E_Subprogram_Type
981 if not Is_Numeric_Type
(Root_Type
(Ent
)) then
985 Par
:= Parent
(First_Subtype
(Ent
));
988 and then Nkind
(Par
) = N_Full_Type_Declaration
989 and then Nkind
(Type_Definition
(Par
)) =
990 N_Derived_Type_Definition
;
998 -----------------------
999 -- Is_Generic_Formal --
1000 -----------------------
1002 function Is_Generic_Formal
(E
: Entity_Id
) return Boolean is
1009 -- Formal derived types are rewritten as private extensions, so
1010 -- examine original node.
1012 Kind
:= Nkind
(Original_Node
(Parent
(E
)));
1015 Kind
in N_Formal_Object_Declaration | N_Formal_Type_Declaration
1016 or else Is_Formal_Subprogram
(E
)
1018 (Ekind
(E
) = E_Package
1019 and then Nkind
(Original_Node
(Unit_Declaration_Node
(E
))) =
1020 N_Formal_Package_Declaration
);
1022 end Is_Generic_Formal
;
1024 -------------------------------
1025 -- Is_Immutably_Limited_Type --
1026 -------------------------------
1028 function Is_Immutably_Limited_Type
(Ent
: Entity_Id
) return Boolean is
1029 Btype
: constant Entity_Id
:= Available_View
(Base_Type
(Ent
));
1032 if Is_Limited_Record
(Btype
) then
1035 elsif Ekind
(Btype
) = E_Limited_Private_Type
1036 and then Nkind
(Parent
(Btype
)) = N_Formal_Type_Declaration
1038 return not In_Package_Body
(Scope
((Btype
)));
1040 elsif Is_Private_Type
(Btype
) then
1042 -- AI05-0063: A type derived from a limited private formal type is
1043 -- not immutably limited in a generic body.
1045 if Is_Derived_Type
(Btype
)
1046 and then Is_Generic_Type
(Etype
(Btype
))
1048 if not Is_Limited_Type
(Etype
(Btype
)) then
1051 -- A descendant of a limited formal type is not immutably limited
1052 -- in the generic body, or in the body of a generic child.
1054 elsif Ekind
(Scope
(Etype
(Btype
))) = E_Generic_Package
then
1055 return not In_Package_Body
(Scope
(Btype
));
1065 elsif Is_Concurrent_Type
(Btype
) then
1071 end Is_Immutably_Limited_Type
;
1073 ---------------------
1074 -- Is_Limited_Type --
1075 ---------------------
1077 function Is_Limited_Type
(Ent
: Entity_Id
) return Boolean is
1082 if not Is_Type
(Ent
) then
1086 Btype
:= Base_Type
(Ent
);
1087 Rtype
:= Root_Type
(Btype
);
1089 if Ekind
(Btype
) = E_Limited_Private_Type
1090 or else Is_Limited_Composite
(Btype
)
1094 elsif Is_Concurrent_Type
(Btype
) then
1097 -- The Is_Limited_Record flag normally indicates that the type is
1098 -- limited. The exception is that a type does not inherit limitedness
1099 -- from its interface ancestor. So the type may be derived from a
1100 -- limited interface, but is not limited.
1102 elsif Is_Limited_Record
(Ent
)
1103 and then not Is_Interface
(Ent
)
1107 -- Otherwise we will look around to see if there is some other reason
1108 -- for it to be limited, except that if an error was posted on the
1109 -- entity, then just assume it is non-limited, because it can cause
1110 -- trouble to recurse into a murky entity resulting from other errors.
1112 elsif Error_Posted
(Ent
) then
1115 elsif Is_Record_Type
(Btype
) then
1117 if Is_Limited_Interface
(Ent
) then
1120 -- AI-419: limitedness is not inherited from a limited interface
1122 elsif Is_Limited_Record
(Rtype
) then
1123 return not Is_Interface
(Rtype
)
1124 or else Is_Protected_Interface
(Rtype
)
1125 or else Is_Synchronized_Interface
(Rtype
)
1126 or else Is_Task_Interface
(Rtype
);
1128 elsif Is_Class_Wide_Type
(Btype
) then
1129 return Is_Limited_Type
(Rtype
);
1133 C
: Entity_Id
:= First_Component
(Btype
);
1135 while Present
(C
) loop
1136 if Is_Limited_Type
(Etype
(C
)) then
1147 elsif Is_Array_Type
(Btype
) then
1148 return Is_Limited_Type
(Component_Type
(Btype
));
1153 end Is_Limited_Type
;
1155 ---------------------
1156 -- Is_Limited_View --
1157 ---------------------
1159 function Is_Limited_View
(Ent
: Entity_Id
) return Boolean is
1160 Btype
: constant Entity_Id
:= Available_View
(Base_Type
(Ent
));
1163 if Is_Limited_Record
(Btype
) then
1166 elsif Ekind
(Btype
) = E_Limited_Private_Type
1167 and then Nkind
(Parent
(Btype
)) = N_Formal_Type_Declaration
1169 return not In_Package_Body
(Scope
((Btype
)));
1171 elsif Is_Private_Type
(Btype
) then
1173 -- AI05-0063: A type derived from a limited private formal type is
1174 -- not immutably limited in a generic body.
1176 if Is_Derived_Type
(Btype
)
1177 and then Is_Generic_Type
(Etype
(Btype
))
1179 if not Is_Limited_Type
(Etype
(Btype
)) then
1182 -- A descendant of a limited formal type is not immutably limited
1183 -- in the generic body, or in the body of a generic child.
1185 elsif Ekind
(Scope
(Etype
(Btype
))) = E_Generic_Package
then
1186 return not In_Package_Body
(Scope
(Btype
));
1194 Utyp
: constant Entity_Id
:= Underlying_Type
(Btype
);
1199 return Is_Limited_View
(Utyp
);
1204 elsif Is_Concurrent_Type
(Btype
) then
1207 elsif Is_Record_Type
(Btype
) then
1209 -- Note that we return True for all limited interfaces, even though
1210 -- (unsynchronized) limited interfaces can have descendants that are
1211 -- nonlimited, because this is a predicate on the type itself, and
1212 -- things like functions with limited interface results need to be
1213 -- handled as build in place even though they might return objects
1214 -- of a type that is not inherently limited.
1216 if Is_Class_Wide_Type
(Btype
) then
1217 return Is_Limited_View
(Root_Type
(Btype
));
1224 C
:= First_Component
(Btype
);
1225 while Present
(C
) loop
1227 -- Don't consider components with interface types (which can
1228 -- only occur in the case of a _parent component anyway).
1229 -- They don't have any components, plus it would cause this
1230 -- function to return true for nonlimited types derived from
1231 -- limited interfaces.
1233 if not Is_Interface
(Etype
(C
))
1234 and then Is_Limited_View
(Etype
(C
))
1246 elsif Is_Array_Type
(Btype
) then
1247 return Is_Limited_View
(Component_Type
(Btype
));
1252 end Is_Limited_View
;
1254 ----------------------
1255 -- Nearest_Ancestor --
1256 ----------------------
1258 function Nearest_Ancestor
(Typ
: Entity_Id
) return Entity_Id
is
1259 D
: constant Node_Id
:= Original_Node
(Declaration_Node
(Typ
));
1260 -- We use the original node of the declaration, because derived
1261 -- types from record subtypes are rewritten as record declarations,
1262 -- and it is the original declaration that carries the ancestor.
1265 -- If we have a subtype declaration, get the ancestor subtype
1267 if Nkind
(D
) = N_Subtype_Declaration
then
1268 if Nkind
(Subtype_Indication
(D
)) = N_Subtype_Indication
then
1269 return Entity
(Subtype_Mark
(Subtype_Indication
(D
)));
1271 return Entity
(Subtype_Indication
(D
));
1274 -- If derived type declaration, find who we are derived from
1276 elsif Nkind
(D
) = N_Full_Type_Declaration
1277 and then Nkind
(Type_Definition
(D
)) = N_Derived_Type_Definition
1280 DTD
: constant Entity_Id
:= Type_Definition
(D
);
1281 SI
: constant Entity_Id
:= Subtype_Indication
(DTD
);
1283 if Is_Entity_Name
(SI
) then
1286 return Entity
(Subtype_Mark
(SI
));
1290 -- If this is a concurrent declaration with a nonempty interface list,
1291 -- get the first progenitor. Account for case of a record type created
1292 -- for a concurrent type (which is the only case that seems to occur
1295 elsif Nkind
(D
) = N_Full_Type_Declaration
1296 and then (Is_Concurrent_Type
(Defining_Identifier
(D
))
1297 or else Is_Concurrent_Record_Type
(Defining_Identifier
(D
)))
1298 and then Is_Non_Empty_List
(Interface_List
(Type_Definition
(D
)))
1300 return Entity
(First
(Interface_List
(Type_Definition
(D
))));
1302 -- If derived type and private type, get the full view to find who we
1303 -- are derived from.
1305 elsif Is_Derived_Type
(Typ
)
1306 and then Is_Private_Type
(Typ
)
1307 and then Present
(Full_View
(Typ
))
1309 return Nearest_Ancestor
(Full_View
(Typ
));
1311 -- Otherwise, nothing useful to return, return Empty
1316 end Nearest_Ancestor
;
1318 ---------------------------
1319 -- Nearest_Dynamic_Scope --
1320 ---------------------------
1322 function Nearest_Dynamic_Scope
(Ent
: Entity_Id
) return Entity_Id
is
1324 if Is_Dynamic_Scope
(Ent
) then
1327 return Enclosing_Dynamic_Scope
(Ent
);
1329 end Nearest_Dynamic_Scope
;
1331 ------------------------
1332 -- Next_Tag_Component --
1333 ------------------------
1335 function Next_Tag_Component
(Tag
: Entity_Id
) return Entity_Id
is
1339 pragma Assert
(Is_Tag
(Tag
));
1341 -- Loop to look for next tag component
1343 Comp
:= Next_Entity
(Tag
);
1344 while Present
(Comp
) loop
1345 if Is_Tag
(Comp
) then
1346 pragma Assert
(Chars
(Comp
) /= Name_uTag
);
1353 -- No tag component found
1356 end Next_Tag_Component
;
1358 --------------------------
1359 -- Number_Discriminants --
1360 --------------------------
1362 function Number_Discriminants
(Typ
: Entity_Id
) return Pos
is
1364 Discr
: Entity_Id
:= First_Discriminant
(Typ
);
1367 while Present
(Discr
) loop
1369 Next_Discriminant
(Discr
);
1373 end Number_Discriminants
;
1375 ----------------------------------------------
1376 -- Object_Type_Has_Constrained_Partial_View --
1377 ----------------------------------------------
1379 function Object_Type_Has_Constrained_Partial_View
1381 Scop
: Entity_Id
) return Boolean
1384 return Has_Constrained_Partial_View
(Typ
)
1385 or else (In_Generic_Body
(Scop
)
1386 and then Is_Generic_Type
(Base_Type
(Typ
))
1387 and then (Is_Private_Type
(Base_Type
(Typ
))
1388 or else Is_Derived_Type
(Base_Type
(Typ
)))
1389 and then not Is_Tagged_Type
(Typ
)
1390 and then not (Is_Array_Type
(Typ
)
1391 and then not Is_Constrained
(Typ
))
1392 and then Has_Discriminants
(Typ
));
1393 end Object_Type_Has_Constrained_Partial_View
;
1399 function Package_Body
(E
: Entity_Id
) return Node_Id
is
1400 Body_Decl
: Node_Id
;
1401 Body_Id
: constant Opt_E_Package_Body_Id
:=
1402 Corresponding_Body
(Package_Spec
(E
));
1405 if Present
(Body_Id
) then
1406 Body_Decl
:= Parent
(Body_Id
);
1408 if Nkind
(Body_Decl
) = N_Defining_Program_Unit_Name
then
1409 Body_Decl
:= Parent
(Body_Decl
);
1412 pragma Assert
(Nkind
(Body_Decl
) = N_Package_Body
);
1424 function Package_Spec
(E
: Entity_Id
) return Node_Id
is
1426 return Parent
(Package_Specification
(E
));
1429 ---------------------------
1430 -- Package_Specification --
1431 ---------------------------
1433 function Package_Specification
(E
: Entity_Id
) return Node_Id
is
1437 pragma Assert
(Is_Package_Or_Generic_Package
(E
));
1441 if Nkind
(N
) = N_Defining_Program_Unit_Name
then
1445 pragma Assert
(Nkind
(N
) = N_Package_Specification
);
1448 end Package_Specification
;
1450 ---------------------
1451 -- Subprogram_Body --
1452 ---------------------
1454 function Subprogram_Body
(E
: Entity_Id
) return Node_Id
is
1455 Body_E
: constant Entity_Id
:= Subprogram_Body_Entity
(E
);
1461 return Parent
(Subprogram_Specification
(Body_E
));
1463 end Subprogram_Body
;
1465 ----------------------------
1466 -- Subprogram_Body_Entity --
1467 ----------------------------
1469 function Subprogram_Body_Entity
(E
: Entity_Id
) return Entity_Id
is
1470 N
: constant Node_Id
:= Parent
(Subprogram_Specification
(E
));
1471 -- Declaration for E
1474 -- If this declaration is not a subprogram body, then it must be a
1475 -- subprogram declaration or body stub, from which we can retrieve the
1476 -- entity for the corresponding subprogram body if any, or an abstract
1477 -- subprogram declaration, for which we return Empty.
1480 when N_Subprogram_Body
=>
1483 when N_Subprogram_Body_Stub
1484 | N_Subprogram_Declaration
1486 return Corresponding_Body
(N
);
1491 end Subprogram_Body_Entity
;
1493 ---------------------
1494 -- Subprogram_Spec --
1495 ---------------------
1497 function Subprogram_Spec
(E
: Entity_Id
) return Node_Id
is
1498 N
: constant Node_Id
:= Parent
(Subprogram_Specification
(E
));
1499 -- Declaration for E
1502 -- This declaration is either subprogram declaration or a subprogram
1503 -- body, in which case return Empty.
1505 if Nkind
(N
) = N_Subprogram_Declaration
then
1510 end Subprogram_Spec
;
1512 ------------------------------
1513 -- Subprogram_Specification --
1514 ------------------------------
1516 function Subprogram_Specification
(E
: Entity_Id
) return Node_Id
is
1522 if Nkind
(N
) = N_Defining_Program_Unit_Name
then
1526 -- If the Parent pointer of E is not a subprogram specification node
1527 -- (going through an intermediate N_Defining_Program_Unit_Name node
1528 -- for subprogram units), then E is an inherited operation. Its parent
1529 -- points to the type derivation that produces the inheritance: that's
1530 -- the node that generates the subprogram specification. Its alias
1531 -- is the parent subprogram, and that one points to a subprogram
1532 -- declaration, or to another type declaration if this is a hierarchy
1535 if Nkind
(N
) not in N_Subprogram_Specification
then
1536 pragma Assert
(Present
(Alias
(E
)));
1537 N
:= Subprogram_Specification
(Alias
(E
));
1541 end Subprogram_Specification
;
1543 --------------------
1544 -- Ultimate_Alias --
1545 --------------------
1547 function Ultimate_Alias
(Prim
: Entity_Id
) return Entity_Id
is
1548 E
: Entity_Id
:= Prim
;
1551 while Present
(Alias
(E
)) loop
1552 pragma Assert
(Alias
(E
) /= E
);
1559 --------------------------
1560 -- Unit_Declaration_Node --
1561 --------------------------
1563 function Unit_Declaration_Node
(Unit_Id
: Entity_Id
) return Node_Id
is
1564 N
: Node_Id
:= Parent
(Unit_Id
);
1567 -- Predefined operators do not have a full function declaration
1569 if Ekind
(Unit_Id
) = E_Operator
then
1573 -- Isn't there some better way to express the following ???
1575 while Nkind
(N
) /= N_Abstract_Subprogram_Declaration
1576 and then Nkind
(N
) /= N_Entry_Body
1577 and then Nkind
(N
) /= N_Entry_Declaration
1578 and then Nkind
(N
) /= N_Formal_Package_Declaration
1579 and then Nkind
(N
) /= N_Function_Instantiation
1580 and then Nkind
(N
) /= N_Generic_Package_Declaration
1581 and then Nkind
(N
) /= N_Generic_Subprogram_Declaration
1582 and then Nkind
(N
) /= N_Package_Declaration
1583 and then Nkind
(N
) /= N_Package_Body
1584 and then Nkind
(N
) /= N_Package_Instantiation
1585 and then Nkind
(N
) /= N_Package_Renaming_Declaration
1586 and then Nkind
(N
) /= N_Procedure_Instantiation
1587 and then Nkind
(N
) /= N_Protected_Body
1588 and then Nkind
(N
) /= N_Protected_Type_Declaration
1589 and then Nkind
(N
) /= N_Subprogram_Declaration
1590 and then Nkind
(N
) /= N_Subprogram_Body
1591 and then Nkind
(N
) /= N_Subprogram_Body_Stub
1592 and then Nkind
(N
) /= N_Subprogram_Renaming_Declaration
1593 and then Nkind
(N
) /= N_Task_Body
1594 and then Nkind
(N
) /= N_Task_Type_Declaration
1595 and then Nkind
(N
) not in N_Formal_Subprogram_Declaration
1596 and then Nkind
(N
) not in N_Generic_Renaming_Declaration
1600 -- We don't use Assert here, because that causes an infinite loop
1601 -- when assertions are turned off. Better to crash.
1604 raise Program_Error
;
1609 end Unit_Declaration_Node
;