1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2018, 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 Checks
; use Checks
;
28 with Debug
; use Debug
;
29 with Debug_A
; use Debug_A
;
30 with Einfo
; use Einfo
;
31 with Errout
; use Errout
;
32 with Expander
; use Expander
;
33 with Exp_Disp
; use Exp_Disp
;
34 with Exp_Ch6
; use Exp_Ch6
;
35 with Exp_Ch7
; use Exp_Ch7
;
36 with Exp_Tss
; use Exp_Tss
;
37 with Exp_Util
; use Exp_Util
;
38 with Freeze
; use Freeze
;
39 with Ghost
; use Ghost
;
40 with Inline
; use Inline
;
41 with Itypes
; use Itypes
;
43 with Lib
.Xref
; use Lib
.Xref
;
44 with Namet
; use Namet
;
45 with Nmake
; use Nmake
;
46 with Nlists
; use Nlists
;
48 with Output
; use Output
;
49 with Par_SCO
; use Par_SCO
;
50 with Restrict
; use Restrict
;
51 with Rident
; use Rident
;
52 with Rtsfind
; use Rtsfind
;
54 with Sem_Aux
; use Sem_Aux
;
55 with Sem_Aggr
; use Sem_Aggr
;
56 with Sem_Attr
; use Sem_Attr
;
57 with Sem_Cat
; use Sem_Cat
;
58 with Sem_Ch4
; use Sem_Ch4
;
59 with Sem_Ch3
; use Sem_Ch3
;
60 with Sem_Ch6
; use Sem_Ch6
;
61 with Sem_Ch8
; use Sem_Ch8
;
62 with Sem_Ch13
; use Sem_Ch13
;
63 with Sem_Dim
; use Sem_Dim
;
64 with Sem_Disp
; use Sem_Disp
;
65 with Sem_Dist
; use Sem_Dist
;
66 with Sem_Elab
; use Sem_Elab
;
67 with Sem_Elim
; use Sem_Elim
;
68 with Sem_Eval
; use Sem_Eval
;
69 with Sem_Intr
; use Sem_Intr
;
70 with Sem_Util
; use Sem_Util
;
71 with Targparm
; use Targparm
;
72 with Sem_Type
; use Sem_Type
;
73 with Sem_Warn
; use Sem_Warn
;
74 with Sinfo
; use Sinfo
;
75 with Sinfo
.CN
; use Sinfo
.CN
;
76 with Snames
; use Snames
;
77 with Stand
; use Stand
;
78 with Stringt
; use Stringt
;
79 with Style
; use Style
;
80 with Tbuild
; use Tbuild
;
81 with Uintp
; use Uintp
;
82 with Urealp
; use Urealp
;
84 package body Sem_Res
is
86 -----------------------
87 -- Local Subprograms --
88 -----------------------
90 -- Second pass (top-down) type checking and overload resolution procedures
91 -- Typ is the type required by context. These procedures propagate the
92 -- type information recursively to the descendants of N. If the node is not
93 -- overloaded, its Etype is established in the first pass. If overloaded,
94 -- the Resolve routines set the correct type. For arithmetic operators, the
95 -- Etype is the base type of the context.
97 -- Note that Resolve_Attribute is separated off in Sem_Attr
99 procedure Check_Discriminant_Use
(N
: Node_Id
);
100 -- Enforce the restrictions on the use of discriminants when constraining
101 -- a component of a discriminated type (record or concurrent type).
103 procedure Check_For_Visible_Operator
(N
: Node_Id
; T
: Entity_Id
);
104 -- Given a node for an operator associated with type T, check that the
105 -- operator is visible. Operators all of whose operands are universal must
106 -- be checked for visibility during resolution because their type is not
107 -- determinable based on their operands.
109 procedure Check_Fully_Declared_Prefix
112 -- Check that the type of the prefix of a dereference is not incomplete
114 function Check_Infinite_Recursion
(N
: Node_Id
) return Boolean;
115 -- Given a call node, N, which is known to occur immediately within the
116 -- subprogram being called, determines whether it is a detectable case of
117 -- an infinite recursion, and if so, outputs appropriate messages. Returns
118 -- True if an infinite recursion is detected, and False otherwise.
120 procedure Check_No_Direct_Boolean_Operators
(N
: Node_Id
);
121 -- N is the node for a logical operator. If the operator is predefined, and
122 -- the root type of the operands is Standard.Boolean, then a check is made
123 -- for restriction No_Direct_Boolean_Operators. This procedure also handles
124 -- the style check for Style_Check_Boolean_And_Or.
126 function Is_Atomic_Ref_With_Address
(N
: Node_Id
) return Boolean;
127 -- N is either an indexed component or a selected component. This function
128 -- returns true if the prefix refers to an object that has an address
129 -- clause (the case in which we may want to issue a warning).
131 function Is_Definite_Access_Type
(E
: Entity_Id
) return Boolean;
132 -- Determine whether E is an access type declared by an access declaration,
133 -- and not an (anonymous) allocator type.
135 function Is_Predefined_Op
(Nam
: Entity_Id
) return Boolean;
136 -- Utility to check whether the entity for an operator is a predefined
137 -- operator, in which case the expression is left as an operator in the
138 -- tree (else it is rewritten into a call). An instance of an intrinsic
139 -- conversion operation may be given an operator name, but is not treated
140 -- like an operator. Note that an operator that is an imported back-end
141 -- builtin has convention Intrinsic, but is expected to be rewritten into
142 -- a call, so such an operator is not treated as predefined by this
145 procedure Preanalyze_And_Resolve
148 With_Freezing
: Boolean);
149 -- Subsidiary of public versions of Preanalyze_And_Resolve.
151 procedure Replace_Actual_Discriminants
(N
: Node_Id
; Default
: Node_Id
);
152 -- If a default expression in entry call N depends on the discriminants
153 -- of the task, it must be replaced with a reference to the discriminant
154 -- of the task being called.
156 procedure Resolve_Op_Concat_Arg
161 -- Internal procedure for Resolve_Op_Concat to resolve one operand of
162 -- concatenation operator. The operand is either of the array type or of
163 -- the component type. If the operand is an aggregate, and the component
164 -- type is composite, this is ambiguous if component type has aggregates.
166 procedure Resolve_Op_Concat_First
(N
: Node_Id
; Typ
: Entity_Id
);
167 -- Does the first part of the work of Resolve_Op_Concat
169 procedure Resolve_Op_Concat_Rest
(N
: Node_Id
; Typ
: Entity_Id
);
170 -- Does the "rest" of the work of Resolve_Op_Concat, after the left operand
171 -- has been resolved. See Resolve_Op_Concat for details.
173 procedure Resolve_Allocator
(N
: Node_Id
; Typ
: Entity_Id
);
174 procedure Resolve_Arithmetic_Op
(N
: Node_Id
; Typ
: Entity_Id
);
175 procedure Resolve_Call
(N
: Node_Id
; Typ
: Entity_Id
);
176 procedure Resolve_Case_Expression
(N
: Node_Id
; Typ
: Entity_Id
);
177 procedure Resolve_Character_Literal
(N
: Node_Id
; Typ
: Entity_Id
);
178 procedure Resolve_Comparison_Op
(N
: Node_Id
; Typ
: Entity_Id
);
179 procedure Resolve_Entity_Name
(N
: Node_Id
; Typ
: Entity_Id
);
180 procedure Resolve_Equality_Op
(N
: Node_Id
; Typ
: Entity_Id
);
181 procedure Resolve_Explicit_Dereference
(N
: Node_Id
; Typ
: Entity_Id
);
182 procedure Resolve_Expression_With_Actions
(N
: Node_Id
; Typ
: Entity_Id
);
183 procedure Resolve_If_Expression
(N
: Node_Id
; Typ
: Entity_Id
);
184 procedure Resolve_Generalized_Indexing
(N
: Node_Id
; Typ
: Entity_Id
);
185 procedure Resolve_Indexed_Component
(N
: Node_Id
; Typ
: Entity_Id
);
186 procedure Resolve_Integer_Literal
(N
: Node_Id
; Typ
: Entity_Id
);
187 procedure Resolve_Logical_Op
(N
: Node_Id
; Typ
: Entity_Id
);
188 procedure Resolve_Membership_Op
(N
: Node_Id
; Typ
: Entity_Id
);
189 procedure Resolve_Null
(N
: Node_Id
; Typ
: Entity_Id
);
190 procedure Resolve_Operator_Symbol
(N
: Node_Id
; Typ
: Entity_Id
);
191 procedure Resolve_Op_Concat
(N
: Node_Id
; Typ
: Entity_Id
);
192 procedure Resolve_Op_Expon
(N
: Node_Id
; Typ
: Entity_Id
);
193 procedure Resolve_Op_Not
(N
: Node_Id
; Typ
: Entity_Id
);
194 procedure Resolve_Qualified_Expression
(N
: Node_Id
; Typ
: Entity_Id
);
195 procedure Resolve_Raise_Expression
(N
: Node_Id
; Typ
: Entity_Id
);
196 procedure Resolve_Range
(N
: Node_Id
; Typ
: Entity_Id
);
197 procedure Resolve_Real_Literal
(N
: Node_Id
; Typ
: Entity_Id
);
198 procedure Resolve_Reference
(N
: Node_Id
; Typ
: Entity_Id
);
199 procedure Resolve_Selected_Component
(N
: Node_Id
; Typ
: Entity_Id
);
200 procedure Resolve_Shift
(N
: Node_Id
; Typ
: Entity_Id
);
201 procedure Resolve_Short_Circuit
(N
: Node_Id
; Typ
: Entity_Id
);
202 procedure Resolve_Slice
(N
: Node_Id
; Typ
: Entity_Id
);
203 procedure Resolve_String_Literal
(N
: Node_Id
; Typ
: Entity_Id
);
204 procedure Resolve_Target_Name
(N
: Node_Id
; Typ
: Entity_Id
);
205 procedure Resolve_Type_Conversion
(N
: Node_Id
; Typ
: Entity_Id
);
206 procedure Resolve_Unary_Op
(N
: Node_Id
; Typ
: Entity_Id
);
207 procedure Resolve_Unchecked_Expression
(N
: Node_Id
; Typ
: Entity_Id
);
208 procedure Resolve_Unchecked_Type_Conversion
(N
: Node_Id
; Typ
: Entity_Id
);
210 function Operator_Kind
212 Is_Binary
: Boolean) return Node_Kind
;
213 -- Utility to map the name of an operator into the corresponding Node. Used
214 -- by other node rewriting procedures.
216 procedure Resolve_Actuals
(N
: Node_Id
; Nam
: Entity_Id
);
217 -- Resolve actuals of call, and add default expressions for missing ones.
218 -- N is the Node_Id for the subprogram call, and Nam is the entity of the
219 -- called subprogram.
221 procedure Resolve_Entry_Call
(N
: Node_Id
; Typ
: Entity_Id
);
222 -- Called from Resolve_Call, when the prefix denotes an entry or element
223 -- of entry family. Actuals are resolved as for subprograms, and the node
224 -- is rebuilt as an entry call. Also called for protected operations. Typ
225 -- is the context type, which is used when the operation is a protected
226 -- function with no arguments, and the return value is indexed.
228 procedure Resolve_Intrinsic_Operator
(N
: Node_Id
; Typ
: Entity_Id
);
229 -- A call to a user-defined intrinsic operator is rewritten as a call to
230 -- the corresponding predefined operator, with suitable conversions. Note
231 -- that this applies only for intrinsic operators that denote predefined
232 -- operators, not ones that are intrinsic imports of back-end builtins.
234 procedure Resolve_Intrinsic_Unary_Operator
(N
: Node_Id
; Typ
: Entity_Id
);
235 -- Ditto, for arithmetic unary operators
237 procedure Rewrite_Operator_As_Call
(N
: Node_Id
; Nam
: Entity_Id
);
238 -- If an operator node resolves to a call to a user-defined operator,
239 -- rewrite the node as a function call.
241 procedure Make_Call_Into_Operator
245 -- Inverse transformation: if an operator is given in functional notation,
246 -- then after resolving the node, transform into an operator node, so that
247 -- operands are resolved properly. Recall that predefined operators do not
248 -- have a full signature and special resolution rules apply.
250 procedure Rewrite_Renamed_Operator
254 -- An operator can rename another, e.g. in an instantiation. In that
255 -- case, the proper operator node must be constructed and resolved.
257 procedure Set_String_Literal_Subtype
(N
: Node_Id
; Typ
: Entity_Id
);
258 -- The String_Literal_Subtype is built for all strings that are not
259 -- operands of a static concatenation operation. If the argument is not
260 -- a N_String_Literal node, then the call has no effect.
262 procedure Set_Slice_Subtype
(N
: Node_Id
);
263 -- Build subtype of array type, with the range specified by the slice
265 procedure Simplify_Type_Conversion
(N
: Node_Id
);
266 -- Called after N has been resolved and evaluated, but before range checks
267 -- have been applied. Currently simplifies a combination of floating-point
268 -- to integer conversion and Rounding or Truncation attribute.
270 function Unique_Fixed_Point_Type
(N
: Node_Id
) return Entity_Id
;
271 -- A universal_fixed expression in an universal context is unambiguous if
272 -- there is only one applicable fixed point type. Determining whether there
273 -- is only one requires a search over all visible entities, and happens
274 -- only in very pathological cases (see 6115-006).
276 -------------------------
277 -- Ambiguous_Character --
278 -------------------------
280 procedure Ambiguous_Character
(C
: Node_Id
) is
284 if Nkind
(C
) = N_Character_Literal
then
285 Error_Msg_N
("ambiguous character literal", C
);
287 -- First the ones in Standard
289 Error_Msg_N
("\\possible interpretation: Character!", C
);
290 Error_Msg_N
("\\possible interpretation: Wide_Character!", C
);
292 -- Include Wide_Wide_Character in Ada 2005 mode
294 if Ada_Version
>= Ada_2005
then
295 Error_Msg_N
("\\possible interpretation: Wide_Wide_Character!", C
);
298 -- Now any other types that match
300 E
:= Current_Entity
(C
);
301 while Present
(E
) loop
302 Error_Msg_NE
("\\possible interpretation:}!", C
, Etype
(E
));
306 end Ambiguous_Character
;
308 -------------------------
309 -- Analyze_And_Resolve --
310 -------------------------
312 procedure Analyze_And_Resolve
(N
: Node_Id
) is
316 end Analyze_And_Resolve
;
318 procedure Analyze_And_Resolve
(N
: Node_Id
; Typ
: Entity_Id
) is
322 end Analyze_And_Resolve
;
324 -- Versions with check(s) suppressed
326 procedure Analyze_And_Resolve
331 Scop
: constant Entity_Id
:= Current_Scope
;
334 if Suppress
= All_Checks
then
336 Sva
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
338 Scope_Suppress
.Suppress
:= (others => True);
339 Analyze_And_Resolve
(N
, Typ
);
340 Scope_Suppress
.Suppress
:= Sva
;
345 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
347 Scope_Suppress
.Suppress
(Suppress
) := True;
348 Analyze_And_Resolve
(N
, Typ
);
349 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
353 if Current_Scope
/= Scop
354 and then Scope_Is_Transient
356 -- This can only happen if a transient scope was created for an inner
357 -- expression, which will be removed upon completion of the analysis
358 -- of an enclosing construct. The transient scope must have the
359 -- suppress status of the enclosing environment, not of this Analyze
362 Scope_Stack
.Table
(Scope_Stack
.Last
).Save_Scope_Suppress
:=
365 end Analyze_And_Resolve
;
367 procedure Analyze_And_Resolve
371 Scop
: constant Entity_Id
:= Current_Scope
;
374 if Suppress
= All_Checks
then
376 Sva
: constant Suppress_Array
:= Scope_Suppress
.Suppress
;
378 Scope_Suppress
.Suppress
:= (others => True);
379 Analyze_And_Resolve
(N
);
380 Scope_Suppress
.Suppress
:= Sva
;
385 Svg
: constant Boolean := Scope_Suppress
.Suppress
(Suppress
);
387 Scope_Suppress
.Suppress
(Suppress
) := True;
388 Analyze_And_Resolve
(N
);
389 Scope_Suppress
.Suppress
(Suppress
) := Svg
;
393 if Current_Scope
/= Scop
and then Scope_Is_Transient
then
394 Scope_Stack
.Table
(Scope_Stack
.Last
).Save_Scope_Suppress
:=
397 end Analyze_And_Resolve
;
399 ----------------------------
400 -- Check_Discriminant_Use --
401 ----------------------------
403 procedure Check_Discriminant_Use
(N
: Node_Id
) is
404 PN
: constant Node_Id
:= Parent
(N
);
405 Disc
: constant Entity_Id
:= Entity
(N
);
410 -- Any use in a spec-expression is legal
412 if In_Spec_Expression
then
415 elsif Nkind
(PN
) = N_Range
then
417 -- Discriminant cannot be used to constrain a scalar type
421 if Nkind
(P
) = N_Range_Constraint
422 and then Nkind
(Parent
(P
)) = N_Subtype_Indication
423 and then Nkind
(Parent
(Parent
(P
))) = N_Component_Definition
425 Error_Msg_N
("discriminant cannot constrain scalar type", N
);
427 elsif Nkind
(P
) = N_Index_Or_Discriminant_Constraint
then
429 -- The following check catches the unusual case where a
430 -- discriminant appears within an index constraint that is part
431 -- of a larger expression within a constraint on a component,
432 -- e.g. "C : Int range 1 .. F (new A(1 .. D))". For now we only
433 -- check case of record components, and note that a similar check
434 -- should also apply in the case of discriminant constraints
437 -- Note that the check for N_Subtype_Declaration below is to
438 -- detect the valid use of discriminants in the constraints of a
439 -- subtype declaration when this subtype declaration appears
440 -- inside the scope of a record type (which is syntactically
441 -- illegal, but which may be created as part of derived type
442 -- processing for records). See Sem_Ch3.Build_Derived_Record_Type
445 if Ekind
(Current_Scope
) = E_Record_Type
446 and then Scope
(Disc
) = Current_Scope
448 (Nkind
(Parent
(P
)) = N_Subtype_Indication
450 Nkind_In
(Parent
(Parent
(P
)), N_Component_Definition
,
451 N_Subtype_Declaration
)
452 and then Paren_Count
(N
) = 0)
455 ("discriminant must appear alone in component constraint", N
);
459 -- Detect a common error:
461 -- type R (D : Positive := 100) is record
462 -- Name : String (1 .. D);
465 -- The default value causes an object of type R to be allocated
466 -- with room for Positive'Last characters. The RM does not mandate
467 -- the allocation of the maximum size, but that is what GNAT does
468 -- so we should warn the programmer that there is a problem.
470 Check_Large
: declare
476 function Large_Storage_Type
(T
: Entity_Id
) return Boolean;
477 -- Return True if type T has a large enough range that any
478 -- array whose index type covered the whole range of the type
479 -- would likely raise Storage_Error.
481 ------------------------
482 -- Large_Storage_Type --
483 ------------------------
485 function Large_Storage_Type
(T
: Entity_Id
) return Boolean is
487 -- The type is considered large if its bounds are known at
488 -- compile time and if it requires at least as many bits as
489 -- a Positive to store the possible values.
491 return Compile_Time_Known_Value
(Type_Low_Bound
(T
))
492 and then Compile_Time_Known_Value
(Type_High_Bound
(T
))
494 Minimum_Size
(T
, Biased
=> True) >=
495 RM_Size
(Standard_Positive
);
496 end Large_Storage_Type
;
498 -- Start of processing for Check_Large
501 -- Check that the Disc has a large range
503 if not Large_Storage_Type
(Etype
(Disc
)) then
507 -- If the enclosing type is limited, we allocate only the
508 -- default value, not the maximum, and there is no need for
511 if Is_Limited_Type
(Scope
(Disc
)) then
515 -- Check that it is the high bound
517 if N
/= High_Bound
(PN
)
518 or else No
(Discriminant_Default_Value
(Disc
))
523 -- Check the array allows a large range at this bound. First
528 if Nkind
(SI
) /= N_Subtype_Indication
then
532 T
:= Entity
(Subtype_Mark
(SI
));
534 if not Is_Array_Type
(T
) then
538 -- Next, find the dimension
540 TB
:= First_Index
(T
);
541 CB
:= First
(Constraints
(P
));
543 and then Present
(TB
)
544 and then Present
(CB
)
555 -- Now, check the dimension has a large range
557 if not Large_Storage_Type
(Etype
(TB
)) then
561 -- Warn about the danger
564 ("??creation of & object may raise Storage_Error!",
573 -- Legal case is in index or discriminant constraint
575 elsif Nkind_In
(PN
, N_Index_Or_Discriminant_Constraint
,
576 N_Discriminant_Association
)
578 if Paren_Count
(N
) > 0 then
580 ("discriminant in constraint must appear alone", N
);
582 elsif Nkind
(N
) = N_Expanded_Name
583 and then Comes_From_Source
(N
)
586 ("discriminant must appear alone as a direct name", N
);
591 -- Otherwise, context is an expression. It should not be within (i.e. a
592 -- subexpression of) a constraint for a component.
597 while not Nkind_In
(P
, N_Component_Declaration
,
598 N_Subtype_Indication
,
606 -- If the discriminant is used in an expression that is a bound of a
607 -- scalar type, an Itype is created and the bounds are attached to
608 -- its range, not to the original subtype indication. Such use is of
609 -- course a double fault.
611 if (Nkind
(P
) = N_Subtype_Indication
612 and then Nkind_In
(Parent
(P
), N_Component_Definition
,
613 N_Derived_Type_Definition
)
614 and then D
= Constraint
(P
))
616 -- The constraint itself may be given by a subtype indication,
617 -- rather than by a more common discrete range.
619 or else (Nkind
(P
) = N_Subtype_Indication
621 Nkind
(Parent
(P
)) = N_Index_Or_Discriminant_Constraint
)
622 or else Nkind
(P
) = N_Entry_Declaration
623 or else Nkind
(D
) = N_Defining_Identifier
626 ("discriminant in constraint must appear alone", N
);
629 end Check_Discriminant_Use
;
631 --------------------------------
632 -- Check_For_Visible_Operator --
633 --------------------------------
635 procedure Check_For_Visible_Operator
(N
: Node_Id
; T
: Entity_Id
) is
637 if Is_Invisible_Operator
(N
, T
) then
638 Error_Msg_NE
-- CODEFIX
639 ("operator for} is not directly visible!", N
, First_Subtype
(T
));
640 Error_Msg_N
-- CODEFIX
641 ("use clause would make operation legal!", N
);
643 end Check_For_Visible_Operator
;
645 ----------------------------------
646 -- Check_Fully_Declared_Prefix --
647 ----------------------------------
649 procedure Check_Fully_Declared_Prefix
654 -- Check that the designated type of the prefix of a dereference is
655 -- not an incomplete type. This cannot be done unconditionally, because
656 -- dereferences of private types are legal in default expressions. This
657 -- case is taken care of in Check_Fully_Declared, called below. There
658 -- are also 2005 cases where it is legal for the prefix to be unfrozen.
660 -- This consideration also applies to similar checks for allocators,
661 -- qualified expressions, and type conversions.
663 -- An additional exception concerns other per-object expressions that
664 -- are not directly related to component declarations, in particular
665 -- representation pragmas for tasks. These will be per-object
666 -- expressions if they depend on discriminants or some global entity.
667 -- If the task has access discriminants, the designated type may be
668 -- incomplete at the point the expression is resolved. This resolution
669 -- takes place within the body of the initialization procedure, where
670 -- the discriminant is replaced by its discriminal.
672 if Is_Entity_Name
(Pref
)
673 and then Ekind
(Entity
(Pref
)) = E_In_Parameter
677 -- Ada 2005 (AI-326): Tagged incomplete types allowed. The wrong usages
678 -- are handled by Analyze_Access_Attribute, Analyze_Assignment,
679 -- Analyze_Object_Renaming, and Freeze_Entity.
681 elsif Ada_Version
>= Ada_2005
682 and then Is_Entity_Name
(Pref
)
683 and then Is_Access_Type
(Etype
(Pref
))
684 and then Ekind
(Directly_Designated_Type
(Etype
(Pref
))) =
686 and then Is_Tagged_Type
(Directly_Designated_Type
(Etype
(Pref
)))
690 Check_Fully_Declared
(Typ
, Parent
(Pref
));
692 end Check_Fully_Declared_Prefix
;
694 ------------------------------
695 -- Check_Infinite_Recursion --
696 ------------------------------
698 function Check_Infinite_Recursion
(N
: Node_Id
) return Boolean is
702 function Same_Argument_List
return Boolean;
703 -- Check whether list of actuals is identical to list of formals of
704 -- called function (which is also the enclosing scope).
706 ------------------------
707 -- Same_Argument_List --
708 ------------------------
710 function Same_Argument_List
return Boolean is
716 if not Is_Entity_Name
(Name
(N
)) then
719 Subp
:= Entity
(Name
(N
));
722 F
:= First_Formal
(Subp
);
723 A
:= First_Actual
(N
);
724 while Present
(F
) and then Present
(A
) loop
725 if not Is_Entity_Name
(A
) or else Entity
(A
) /= F
then
734 end Same_Argument_List
;
736 -- Start of processing for Check_Infinite_Recursion
739 -- Special case, if this is a procedure call and is a call to the
740 -- current procedure with the same argument list, then this is for
741 -- sure an infinite recursion and we insert a call to raise SE.
743 if Is_List_Member
(N
)
744 and then List_Length
(List_Containing
(N
)) = 1
745 and then Same_Argument_List
748 P
: constant Node_Id
:= Parent
(N
);
750 if Nkind
(P
) = N_Handled_Sequence_Of_Statements
751 and then Nkind
(Parent
(P
)) = N_Subprogram_Body
752 and then Is_Empty_List
(Declarations
(Parent
(P
)))
754 Error_Msg_Warn
:= SPARK_Mode
/= On
;
755 Error_Msg_N
("!infinite recursion<<", N
);
756 Error_Msg_N
("\!Storage_Error [<<", N
);
758 Make_Raise_Storage_Error
(Sloc
(N
),
759 Reason
=> SE_Infinite_Recursion
));
765 -- If not that special case, search up tree, quitting if we reach a
766 -- construct (e.g. a conditional) that tells us that this is not a
767 -- case for an infinite recursion warning.
773 -- If no parent, then we were not inside a subprogram, this can for
774 -- example happen when processing certain pragmas in a spec. Just
775 -- return False in this case.
781 -- Done if we get to subprogram body, this is definitely an infinite
782 -- recursion case if we did not find anything to stop us.
784 exit when Nkind
(P
) = N_Subprogram_Body
;
786 -- If appearing in conditional, result is false
788 if Nkind_In
(P
, N_Or_Else
,
797 elsif Nkind
(P
) = N_Handled_Sequence_Of_Statements
798 and then C
/= First
(Statements
(P
))
800 -- If the call is the expression of a return statement and the
801 -- actuals are identical to the formals, it's worth a warning.
802 -- However, we skip this if there is an immediately preceding
803 -- raise statement, since the call is never executed.
805 -- Furthermore, this corresponds to a common idiom:
807 -- function F (L : Thing) return Boolean is
809 -- raise Program_Error;
813 -- for generating a stub function
815 if Nkind
(Parent
(N
)) = N_Simple_Return_Statement
816 and then Same_Argument_List
818 exit when not Is_List_Member
(Parent
(N
));
820 -- OK, return statement is in a statement list, look for raise
826 -- Skip past N_Freeze_Entity nodes generated by expansion
828 Nod
:= Prev
(Parent
(N
));
830 and then Nkind
(Nod
) = N_Freeze_Entity
835 -- If no raise statement, give warning. We look at the
836 -- original node, because in the case of "raise ... with
837 -- ...", the node has been transformed into a call.
839 exit when Nkind
(Original_Node
(Nod
)) /= N_Raise_Statement
841 (Nkind
(Nod
) not in N_Raise_xxx_Error
842 or else Present
(Condition
(Nod
)));
853 Error_Msg_Warn
:= SPARK_Mode
/= On
;
854 Error_Msg_N
("!possible infinite recursion<<", N
);
855 Error_Msg_N
("\!??Storage_Error ]<<", N
);
858 end Check_Infinite_Recursion
;
860 ---------------------------------------
861 -- Check_No_Direct_Boolean_Operators --
862 ---------------------------------------
864 procedure Check_No_Direct_Boolean_Operators
(N
: Node_Id
) is
866 if Scope
(Entity
(N
)) = Standard_Standard
867 and then Root_Type
(Etype
(Left_Opnd
(N
))) = Standard_Boolean
869 -- Restriction only applies to original source code
871 if Comes_From_Source
(N
) then
872 Check_Restriction
(No_Direct_Boolean_Operators
, N
);
876 -- Do style check (but skip if in instance, error is on template)
879 if not In_Instance
then
880 Check_Boolean_Operator
(N
);
883 end Check_No_Direct_Boolean_Operators
;
885 ------------------------------
886 -- Check_Parameterless_Call --
887 ------------------------------
889 procedure Check_Parameterless_Call
(N
: Node_Id
) is
892 function Prefix_Is_Access_Subp
return Boolean;
893 -- If the prefix is of an access_to_subprogram type, the node must be
894 -- rewritten as a call. Ditto if the prefix is overloaded and all its
895 -- interpretations are access to subprograms.
897 ---------------------------
898 -- Prefix_Is_Access_Subp --
899 ---------------------------
901 function Prefix_Is_Access_Subp
return Boolean is
906 -- If the context is an attribute reference that can apply to
907 -- functions, this is never a parameterless call (RM 4.1.4(6)).
909 if Nkind
(Parent
(N
)) = N_Attribute_Reference
910 and then Nam_In
(Attribute_Name
(Parent
(N
)), Name_Address
,
917 if not Is_Overloaded
(N
) then
919 Ekind
(Etype
(N
)) = E_Subprogram_Type
920 and then Base_Type
(Etype
(Etype
(N
))) /= Standard_Void_Type
;
922 Get_First_Interp
(N
, I
, It
);
923 while Present
(It
.Typ
) loop
924 if Ekind
(It
.Typ
) /= E_Subprogram_Type
925 or else Base_Type
(Etype
(It
.Typ
)) = Standard_Void_Type
930 Get_Next_Interp
(I
, It
);
935 end Prefix_Is_Access_Subp
;
937 -- Start of processing for Check_Parameterless_Call
940 -- Defend against junk stuff if errors already detected
942 if Total_Errors_Detected
/= 0 then
943 if Nkind
(N
) in N_Has_Etype
and then Etype
(N
) = Any_Type
then
945 elsif Nkind
(N
) in N_Has_Chars
946 and then not Is_Valid_Name
(Chars
(N
))
954 -- If the context expects a value, and the name is a procedure, this is
955 -- most likely a missing 'Access. Don't try to resolve the parameterless
956 -- call, error will be caught when the outer call is analyzed.
958 if Is_Entity_Name
(N
)
959 and then Ekind
(Entity
(N
)) = E_Procedure
960 and then not Is_Overloaded
(N
)
962 Nkind_In
(Parent
(N
), N_Parameter_Association
,
964 N_Procedure_Call_Statement
)
969 -- Rewrite as call if overloadable entity that is (or could be, in the
970 -- overloaded case) a function call. If we know for sure that the entity
971 -- is an enumeration literal, we do not rewrite it.
973 -- If the entity is the name of an operator, it cannot be a call because
974 -- operators cannot have default parameters. In this case, this must be
975 -- a string whose contents coincide with an operator name. Set the kind
976 -- of the node appropriately.
978 if (Is_Entity_Name
(N
)
979 and then Nkind
(N
) /= N_Operator_Symbol
980 and then Is_Overloadable
(Entity
(N
))
981 and then (Ekind
(Entity
(N
)) /= E_Enumeration_Literal
982 or else Is_Overloaded
(N
)))
984 -- Rewrite as call if it is an explicit dereference of an expression of
985 -- a subprogram access type, and the subprogram type is not that of a
986 -- procedure or entry.
989 (Nkind
(N
) = N_Explicit_Dereference
and then Prefix_Is_Access_Subp
)
991 -- Rewrite as call if it is a selected component which is a function,
992 -- this is the case of a call to a protected function (which may be
993 -- overloaded with other protected operations).
996 (Nkind
(N
) = N_Selected_Component
997 and then (Ekind
(Entity
(Selector_Name
(N
))) = E_Function
999 (Ekind_In
(Entity
(Selector_Name
(N
)), E_Entry
,
1001 and then Is_Overloaded
(Selector_Name
(N
)))))
1003 -- If one of the above three conditions is met, rewrite as call. Apply
1004 -- the rewriting only once.
1007 if Nkind
(Parent
(N
)) /= N_Function_Call
1008 or else N
/= Name
(Parent
(N
))
1011 -- This may be a prefixed call that was not fully analyzed, e.g.
1012 -- an actual in an instance.
1014 if Ada_Version
>= Ada_2005
1015 and then Nkind
(N
) = N_Selected_Component
1016 and then Is_Dispatching_Operation
(Entity
(Selector_Name
(N
)))
1018 Analyze_Selected_Component
(N
);
1020 if Nkind
(N
) /= N_Selected_Component
then
1025 -- The node is the name of the parameterless call. Preserve its
1026 -- descendants, which may be complex expressions.
1028 Nam
:= Relocate_Node
(N
);
1030 -- If overloaded, overload set belongs to new copy
1032 Save_Interps
(N
, Nam
);
1034 -- Change node to parameterless function call (note that the
1035 -- Parameter_Associations associations field is left set to Empty,
1036 -- its normal default value since there are no parameters)
1038 Change_Node
(N
, N_Function_Call
);
1040 Set_Sloc
(N
, Sloc
(Nam
));
1044 elsif Nkind
(N
) = N_Parameter_Association
then
1045 Check_Parameterless_Call
(Explicit_Actual_Parameter
(N
));
1047 elsif Nkind
(N
) = N_Operator_Symbol
then
1048 Change_Operator_Symbol_To_String_Literal
(N
);
1049 Set_Is_Overloaded
(N
, False);
1050 Set_Etype
(N
, Any_String
);
1052 end Check_Parameterless_Call
;
1054 --------------------------------
1055 -- Is_Atomic_Ref_With_Address --
1056 --------------------------------
1058 function Is_Atomic_Ref_With_Address
(N
: Node_Id
) return Boolean is
1059 Pref
: constant Node_Id
:= Prefix
(N
);
1062 if not Is_Entity_Name
(Pref
) then
1067 Pent
: constant Entity_Id
:= Entity
(Pref
);
1068 Ptyp
: constant Entity_Id
:= Etype
(Pent
);
1070 return not Is_Access_Type
(Ptyp
)
1071 and then (Is_Atomic
(Ptyp
) or else Is_Atomic
(Pent
))
1072 and then Present
(Address_Clause
(Pent
));
1075 end Is_Atomic_Ref_With_Address
;
1077 -----------------------------
1078 -- Is_Definite_Access_Type --
1079 -----------------------------
1081 function Is_Definite_Access_Type
(E
: Entity_Id
) return Boolean is
1082 Btyp
: constant Entity_Id
:= Base_Type
(E
);
1084 return Ekind
(Btyp
) = E_Access_Type
1085 or else (Ekind
(Btyp
) = E_Access_Subprogram_Type
1086 and then Comes_From_Source
(Btyp
));
1087 end Is_Definite_Access_Type
;
1089 ----------------------
1090 -- Is_Predefined_Op --
1091 ----------------------
1093 function Is_Predefined_Op
(Nam
: Entity_Id
) return Boolean is
1095 -- Predefined operators are intrinsic subprograms
1097 if not Is_Intrinsic_Subprogram
(Nam
) then
1101 -- A call to a back-end builtin is never a predefined operator
1103 if Is_Imported
(Nam
) and then Present
(Interface_Name
(Nam
)) then
1107 return not Is_Generic_Instance
(Nam
)
1108 and then Chars
(Nam
) in Any_Operator_Name
1109 and then (No
(Alias
(Nam
)) or else Is_Predefined_Op
(Alias
(Nam
)));
1110 end Is_Predefined_Op
;
1112 -----------------------------
1113 -- Make_Call_Into_Operator --
1114 -----------------------------
1116 procedure Make_Call_Into_Operator
1121 Op_Name
: constant Name_Id
:= Chars
(Op_Id
);
1122 Act1
: Node_Id
:= First_Actual
(N
);
1123 Act2
: Node_Id
:= Next_Actual
(Act1
);
1124 Error
: Boolean := False;
1125 Func
: constant Entity_Id
:= Entity
(Name
(N
));
1126 Is_Binary
: constant Boolean := Present
(Act2
);
1128 Opnd_Type
: Entity_Id
:= Empty
;
1129 Orig_Type
: Entity_Id
:= Empty
;
1132 type Kind_Test
is access function (E
: Entity_Id
) return Boolean;
1134 function Operand_Type_In_Scope
(S
: Entity_Id
) return Boolean;
1135 -- If the operand is not universal, and the operator is given by an
1136 -- expanded name, verify that the operand has an interpretation with a
1137 -- type defined in the given scope of the operator.
1139 function Type_In_P
(Test
: Kind_Test
) return Entity_Id
;
1140 -- Find a type of the given class in package Pack that contains the
1143 ---------------------------
1144 -- Operand_Type_In_Scope --
1145 ---------------------------
1147 function Operand_Type_In_Scope
(S
: Entity_Id
) return Boolean is
1148 Nod
: constant Node_Id
:= Right_Opnd
(Op_Node
);
1153 if not Is_Overloaded
(Nod
) then
1154 return Scope
(Base_Type
(Etype
(Nod
))) = S
;
1157 Get_First_Interp
(Nod
, I
, It
);
1158 while Present
(It
.Typ
) loop
1159 if Scope
(Base_Type
(It
.Typ
)) = S
then
1163 Get_Next_Interp
(I
, It
);
1168 end Operand_Type_In_Scope
;
1174 function Type_In_P
(Test
: Kind_Test
) return Entity_Id
is
1177 function In_Decl
return Boolean;
1178 -- Verify that node is not part of the type declaration for the
1179 -- candidate type, which would otherwise be invisible.
1185 function In_Decl
return Boolean is
1186 Decl_Node
: constant Node_Id
:= Parent
(E
);
1192 if Etype
(E
) = Any_Type
then
1195 elsif No
(Decl_Node
) then
1200 and then Nkind
(N2
) /= N_Compilation_Unit
1202 if N2
= Decl_Node
then
1213 -- Start of processing for Type_In_P
1216 -- If the context type is declared in the prefix package, this is the
1217 -- desired base type.
1219 if Scope
(Base_Type
(Typ
)) = Pack
and then Test
(Typ
) then
1220 return Base_Type
(Typ
);
1223 E
:= First_Entity
(Pack
);
1224 while Present
(E
) loop
1225 if Test
(E
) and then not In_Decl
then
1236 -- Start of processing for Make_Call_Into_Operator
1239 Op_Node
:= New_Node
(Operator_Kind
(Op_Name
, Is_Binary
), Sloc
(N
));
1241 -- Ensure that the corresponding operator has the same parent as the
1242 -- original call. This guarantees that parent traversals performed by
1243 -- the ABE mechanism succeed.
1245 Set_Parent
(Op_Node
, Parent
(N
));
1250 Set_Left_Opnd
(Op_Node
, Relocate_Node
(Act1
));
1251 Set_Right_Opnd
(Op_Node
, Relocate_Node
(Act2
));
1252 Save_Interps
(Act1
, Left_Opnd
(Op_Node
));
1253 Save_Interps
(Act2
, Right_Opnd
(Op_Node
));
1254 Act1
:= Left_Opnd
(Op_Node
);
1255 Act2
:= Right_Opnd
(Op_Node
);
1260 Set_Right_Opnd
(Op_Node
, Relocate_Node
(Act1
));
1261 Save_Interps
(Act1
, Right_Opnd
(Op_Node
));
1262 Act1
:= Right_Opnd
(Op_Node
);
1265 -- If the operator is denoted by an expanded name, and the prefix is
1266 -- not Standard, but the operator is a predefined one whose scope is
1267 -- Standard, then this is an implicit_operator, inserted as an
1268 -- interpretation by the procedure of the same name. This procedure
1269 -- overestimates the presence of implicit operators, because it does
1270 -- not examine the type of the operands. Verify now that the operand
1271 -- type appears in the given scope. If right operand is universal,
1272 -- check the other operand. In the case of concatenation, either
1273 -- argument can be the component type, so check the type of the result.
1274 -- If both arguments are literals, look for a type of the right kind
1275 -- defined in the given scope. This elaborate nonsense is brought to
1276 -- you courtesy of b33302a. The type itself must be frozen, so we must
1277 -- find the type of the proper class in the given scope.
1279 -- A final wrinkle is the multiplication operator for fixed point types,
1280 -- which is defined in Standard only, and not in the scope of the
1281 -- fixed point type itself.
1283 if Nkind
(Name
(N
)) = N_Expanded_Name
then
1284 Pack
:= Entity
(Prefix
(Name
(N
)));
1286 -- If this is a package renaming, get renamed entity, which will be
1287 -- the scope of the operands if operaton is type-correct.
1289 if Present
(Renamed_Entity
(Pack
)) then
1290 Pack
:= Renamed_Entity
(Pack
);
1293 -- If the entity being called is defined in the given package, it is
1294 -- a renaming of a predefined operator, and known to be legal.
1296 if Scope
(Entity
(Name
(N
))) = Pack
1297 and then Pack
/= Standard_Standard
1301 -- Visibility does not need to be checked in an instance: if the
1302 -- operator was not visible in the generic it has been diagnosed
1303 -- already, else there is an implicit copy of it in the instance.
1305 elsif In_Instance
then
1308 elsif Nam_In
(Op_Name
, Name_Op_Multiply
, Name_Op_Divide
)
1309 and then Is_Fixed_Point_Type
(Etype
(Left_Opnd
(Op_Node
)))
1310 and then Is_Fixed_Point_Type
(Etype
(Right_Opnd
(Op_Node
)))
1312 if Pack
/= Standard_Standard
then
1316 -- Ada 2005 AI-420: Predefined equality on Universal_Access is
1319 elsif Ada_Version
>= Ada_2005
1320 and then Nam_In
(Op_Name
, Name_Op_Eq
, Name_Op_Ne
)
1321 and then Ekind
(Etype
(Act1
)) = E_Anonymous_Access_Type
1326 Opnd_Type
:= Base_Type
(Etype
(Right_Opnd
(Op_Node
)));
1328 if Op_Name
= Name_Op_Concat
then
1329 Opnd_Type
:= Base_Type
(Typ
);
1331 elsif (Scope
(Opnd_Type
) = Standard_Standard
1333 or else (Nkind
(Right_Opnd
(Op_Node
)) = N_Attribute_Reference
1335 and then not Comes_From_Source
(Opnd_Type
))
1337 Opnd_Type
:= Base_Type
(Etype
(Left_Opnd
(Op_Node
)));
1340 if Scope
(Opnd_Type
) = Standard_Standard
then
1342 -- Verify that the scope contains a type that corresponds to
1343 -- the given literal. Optimize the case where Pack is Standard.
1345 if Pack
/= Standard_Standard
then
1346 if Opnd_Type
= Universal_Integer
then
1347 Orig_Type
:= Type_In_P
(Is_Integer_Type
'Access);
1349 elsif Opnd_Type
= Universal_Real
then
1350 Orig_Type
:= Type_In_P
(Is_Real_Type
'Access);
1352 elsif Opnd_Type
= Any_String
then
1353 Orig_Type
:= Type_In_P
(Is_String_Type
'Access);
1355 elsif Opnd_Type
= Any_Access
then
1356 Orig_Type
:= Type_In_P
(Is_Definite_Access_Type
'Access);
1358 elsif Opnd_Type
= Any_Composite
then
1359 Orig_Type
:= Type_In_P
(Is_Composite_Type
'Access);
1361 if Present
(Orig_Type
) then
1362 if Has_Private_Component
(Orig_Type
) then
1365 Set_Etype
(Act1
, Orig_Type
);
1368 Set_Etype
(Act2
, Orig_Type
);
1377 Error
:= No
(Orig_Type
);
1380 elsif Ekind
(Opnd_Type
) = E_Allocator_Type
1381 and then No
(Type_In_P
(Is_Definite_Access_Type
'Access))
1385 -- If the type is defined elsewhere, and the operator is not
1386 -- defined in the given scope (by a renaming declaration, e.g.)
1387 -- then this is an error as well. If an extension of System is
1388 -- present, and the type may be defined there, Pack must be
1391 elsif Scope
(Opnd_Type
) /= Pack
1392 and then Scope
(Op_Id
) /= Pack
1393 and then (No
(System_Aux_Id
)
1394 or else Scope
(Opnd_Type
) /= System_Aux_Id
1395 or else Pack
/= Scope
(System_Aux_Id
))
1397 if not Is_Overloaded
(Right_Opnd
(Op_Node
)) then
1400 Error
:= not Operand_Type_In_Scope
(Pack
);
1403 elsif Pack
= Standard_Standard
1404 and then not Operand_Type_In_Scope
(Standard_Standard
)
1411 Error_Msg_Node_2
:= Pack
;
1413 ("& not declared in&", N
, Selector_Name
(Name
(N
)));
1414 Set_Etype
(N
, Any_Type
);
1417 -- Detect a mismatch between the context type and the result type
1418 -- in the named package, which is otherwise not detected if the
1419 -- operands are universal. Check is only needed if source entity is
1420 -- an operator, not a function that renames an operator.
1422 elsif Nkind
(Parent
(N
)) /= N_Type_Conversion
1423 and then Ekind
(Entity
(Name
(N
))) = E_Operator
1424 and then Is_Numeric_Type
(Typ
)
1425 and then not Is_Universal_Numeric_Type
(Typ
)
1426 and then Scope
(Base_Type
(Typ
)) /= Pack
1427 and then not In_Instance
1429 if Is_Fixed_Point_Type
(Typ
)
1430 and then Nam_In
(Op_Name
, Name_Op_Multiply
, Name_Op_Divide
)
1432 -- Already checked above
1436 -- Operator may be defined in an extension of System
1438 elsif Present
(System_Aux_Id
)
1439 and then Present
(Opnd_Type
)
1440 and then Scope
(Opnd_Type
) = System_Aux_Id
1445 -- Could we use Wrong_Type here??? (this would require setting
1446 -- Etype (N) to the actual type found where Typ was expected).
1448 Error_Msg_NE
("expect }", N
, Typ
);
1453 Set_Chars
(Op_Node
, Op_Name
);
1455 if not Is_Private_Type
(Etype
(N
)) then
1456 Set_Etype
(Op_Node
, Base_Type
(Etype
(N
)));
1458 Set_Etype
(Op_Node
, Etype
(N
));
1461 -- If this is a call to a function that renames a predefined equality,
1462 -- the renaming declaration provides a type that must be used to
1463 -- resolve the operands. This must be done now because resolution of
1464 -- the equality node will not resolve any remaining ambiguity, and it
1465 -- assumes that the first operand is not overloaded.
1467 if Nam_In
(Op_Name
, Name_Op_Eq
, Name_Op_Ne
)
1468 and then Ekind
(Func
) = E_Function
1469 and then Is_Overloaded
(Act1
)
1471 Resolve
(Act1
, Base_Type
(Etype
(First_Formal
(Func
))));
1472 Resolve
(Act2
, Base_Type
(Etype
(First_Formal
(Func
))));
1475 Set_Entity
(Op_Node
, Op_Id
);
1476 Generate_Reference
(Op_Id
, N
, ' ');
1478 -- Do rewrite setting Comes_From_Source on the result if the original
1479 -- call came from source. Although it is not strictly the case that the
1480 -- operator as such comes from the source, logically it corresponds
1481 -- exactly to the function call in the source, so it should be marked
1482 -- this way (e.g. to make sure that validity checks work fine).
1485 CS
: constant Boolean := Comes_From_Source
(N
);
1487 Rewrite
(N
, Op_Node
);
1488 Set_Comes_From_Source
(N
, CS
);
1491 -- If this is an arithmetic operator and the result type is private,
1492 -- the operands and the result must be wrapped in conversion to
1493 -- expose the underlying numeric type and expand the proper checks,
1494 -- e.g. on division.
1496 if Is_Private_Type
(Typ
) then
1506 Resolve_Intrinsic_Operator
(N
, Typ
);
1512 Resolve_Intrinsic_Unary_Operator
(N
, Typ
);
1521 -- If in ASIS_Mode, propagate operand types to original actuals of
1522 -- function call, which would otherwise not be fully resolved. If
1523 -- the call has already been constant-folded, nothing to do. We
1524 -- relocate the operand nodes rather than copy them, to preserve
1525 -- original_node pointers, given that the operands themselves may
1526 -- have been rewritten. If the call was itself a rewriting of an
1527 -- operator node, nothing to do.
1530 and then Nkind
(N
) in N_Op
1531 and then Nkind
(Original_Node
(N
)) = N_Function_Call
1535 R
: constant Node_Id
:= Right_Opnd
(N
);
1537 Old_First
: constant Node_Id
:=
1538 First
(Parameter_Associations
(Original_Node
(N
)));
1544 Old_Sec
:= Next
(Old_First
);
1546 -- If the original call has named associations, replace the
1547 -- explicit actual parameter in the association with the proper
1548 -- resolved operand.
1550 if Nkind
(Old_First
) = N_Parameter_Association
then
1551 if Chars
(Selector_Name
(Old_First
)) =
1552 Chars
(First_Entity
(Op_Id
))
1554 Rewrite
(Explicit_Actual_Parameter
(Old_First
),
1557 Rewrite
(Explicit_Actual_Parameter
(Old_First
),
1562 Rewrite
(Old_First
, Relocate_Node
(L
));
1565 if Nkind
(Old_Sec
) = N_Parameter_Association
then
1566 if Chars
(Selector_Name
(Old_Sec
)) =
1567 Chars
(First_Entity
(Op_Id
))
1569 Rewrite
(Explicit_Actual_Parameter
(Old_Sec
),
1572 Rewrite
(Explicit_Actual_Parameter
(Old_Sec
),
1577 Rewrite
(Old_Sec
, Relocate_Node
(R
));
1581 if Nkind
(Old_First
) = N_Parameter_Association
then
1582 Rewrite
(Explicit_Actual_Parameter
(Old_First
),
1585 Rewrite
(Old_First
, Relocate_Node
(R
));
1590 Set_Parent
(Original_Node
(N
), Parent
(N
));
1592 end Make_Call_Into_Operator
;
1598 function Operator_Kind
1600 Is_Binary
: Boolean) return Node_Kind
1605 -- Use CASE statement or array???
1608 if Op_Name
= Name_Op_And
then
1610 elsif Op_Name
= Name_Op_Or
then
1612 elsif Op_Name
= Name_Op_Xor
then
1614 elsif Op_Name
= Name_Op_Eq
then
1616 elsif Op_Name
= Name_Op_Ne
then
1618 elsif Op_Name
= Name_Op_Lt
then
1620 elsif Op_Name
= Name_Op_Le
then
1622 elsif Op_Name
= Name_Op_Gt
then
1624 elsif Op_Name
= Name_Op_Ge
then
1626 elsif Op_Name
= Name_Op_Add
then
1628 elsif Op_Name
= Name_Op_Subtract
then
1629 Kind
:= N_Op_Subtract
;
1630 elsif Op_Name
= Name_Op_Concat
then
1631 Kind
:= N_Op_Concat
;
1632 elsif Op_Name
= Name_Op_Multiply
then
1633 Kind
:= N_Op_Multiply
;
1634 elsif Op_Name
= Name_Op_Divide
then
1635 Kind
:= N_Op_Divide
;
1636 elsif Op_Name
= Name_Op_Mod
then
1638 elsif Op_Name
= Name_Op_Rem
then
1640 elsif Op_Name
= Name_Op_Expon
then
1643 raise Program_Error
;
1649 if Op_Name
= Name_Op_Add
then
1651 elsif Op_Name
= Name_Op_Subtract
then
1653 elsif Op_Name
= Name_Op_Abs
then
1655 elsif Op_Name
= Name_Op_Not
then
1658 raise Program_Error
;
1665 ----------------------------
1666 -- Preanalyze_And_Resolve --
1667 ----------------------------
1669 procedure Preanalyze_And_Resolve
1672 With_Freezing
: Boolean)
1674 Save_Full_Analysis
: constant Boolean := Full_Analysis
;
1675 Save_Must_Not_Freeze
: constant Boolean := Must_Not_Freeze
(N
);
1676 Save_Preanalysis_Count
: constant Nat
:=
1677 Inside_Preanalysis_Without_Freezing
;
1679 pragma Assert
(Nkind
(N
) in N_Subexpr
);
1681 if not With_Freezing
then
1682 Set_Must_Not_Freeze
(N
);
1683 Inside_Preanalysis_Without_Freezing
:=
1684 Inside_Preanalysis_Without_Freezing
+ 1;
1687 Full_Analysis
:= False;
1688 Expander_Mode_Save_And_Set
(False);
1690 -- Normally, we suppress all checks for this preanalysis. There is no
1691 -- point in processing them now, since they will be applied properly
1692 -- and in the proper location when the default expressions reanalyzed
1693 -- and reexpanded later on. We will also have more information at that
1694 -- point for possible suppression of individual checks.
1696 -- However, in SPARK mode, most expansion is suppressed, and this
1697 -- later reanalysis and reexpansion may not occur. SPARK mode does
1698 -- require the setting of checking flags for proof purposes, so we
1699 -- do the SPARK preanalysis without suppressing checks.
1701 -- This special handling for SPARK mode is required for example in the
1702 -- case of Ada 2012 constructs such as quantified expressions, which are
1703 -- expanded in two separate steps.
1705 if GNATprove_Mode
then
1706 Analyze_And_Resolve
(N
, T
);
1708 Analyze_And_Resolve
(N
, T
, Suppress
=> All_Checks
);
1711 Expander_Mode_Restore
;
1712 Full_Analysis
:= Save_Full_Analysis
;
1713 Set_Must_Not_Freeze
(N
, Save_Must_Not_Freeze
);
1715 if not With_Freezing
then
1716 Inside_Preanalysis_Without_Freezing
:=
1717 Inside_Preanalysis_Without_Freezing
- 1;
1721 (Inside_Preanalysis_Without_Freezing
= Save_Preanalysis_Count
);
1722 end Preanalyze_And_Resolve
;
1724 ----------------------------
1725 -- Preanalyze_And_Resolve --
1726 ----------------------------
1728 procedure Preanalyze_And_Resolve
(N
: Node_Id
; T
: Entity_Id
) is
1730 Preanalyze_And_Resolve
(N
, T
, With_Freezing
=> False);
1731 end Preanalyze_And_Resolve
;
1733 -- Version without context type
1735 procedure Preanalyze_And_Resolve
(N
: Node_Id
) is
1736 Save_Full_Analysis
: constant Boolean := Full_Analysis
;
1739 Full_Analysis
:= False;
1740 Expander_Mode_Save_And_Set
(False);
1743 Resolve
(N
, Etype
(N
), Suppress
=> All_Checks
);
1745 Expander_Mode_Restore
;
1746 Full_Analysis
:= Save_Full_Analysis
;
1747 end Preanalyze_And_Resolve
;
1749 ------------------------------------------
1750 -- Preanalyze_With_Freezing_And_Resolve --
1751 ------------------------------------------
1753 procedure Preanalyze_With_Freezing_And_Resolve
1758 Preanalyze_And_Resolve
(N
, T
, With_Freezing
=> True);
1759 end Preanalyze_With_Freezing_And_Resolve
;
1761 ----------------------------------
1762 -- Replace_Actual_Discriminants --
1763 ----------------------------------
1765 procedure Replace_Actual_Discriminants
(N
: Node_Id
; Default
: Node_Id
) is
1766 Loc
: constant Source_Ptr
:= Sloc
(N
);
1767 Tsk
: Node_Id
:= Empty
;
1769 function Process_Discr
(Nod
: Node_Id
) return Traverse_Result
;
1770 -- Comment needed???
1776 function Process_Discr
(Nod
: Node_Id
) return Traverse_Result
is
1780 if Nkind
(Nod
) = N_Identifier
then
1781 Ent
:= Entity
(Nod
);
1784 and then Ekind
(Ent
) = E_Discriminant
1787 Make_Selected_Component
(Loc
,
1788 Prefix
=> New_Copy_Tree
(Tsk
, New_Sloc
=> Loc
),
1789 Selector_Name
=> Make_Identifier
(Loc
, Chars
(Ent
))));
1791 Set_Etype
(Nod
, Etype
(Ent
));
1799 procedure Replace_Discrs
is new Traverse_Proc
(Process_Discr
);
1801 -- Start of processing for Replace_Actual_Discriminants
1804 if Expander_Active
then
1807 -- Allow the replacement of concurrent discriminants in GNATprove even
1808 -- though this is a light expansion activity. Note that generic units
1809 -- are not modified.
1811 elsif GNATprove_Mode
and not Inside_A_Generic
then
1818 if Nkind
(Name
(N
)) = N_Selected_Component
then
1819 Tsk
:= Prefix
(Name
(N
));
1821 elsif Nkind
(Name
(N
)) = N_Indexed_Component
then
1822 Tsk
:= Prefix
(Prefix
(Name
(N
)));
1825 if Present
(Tsk
) then
1826 Replace_Discrs
(Default
);
1828 end Replace_Actual_Discriminants
;
1834 procedure Resolve
(N
: Node_Id
; Typ
: Entity_Id
) is
1835 Ambiguous
: Boolean := False;
1836 Ctx_Type
: Entity_Id
:= Typ
;
1837 Expr_Type
: Entity_Id
:= Empty
; -- prevent junk warning
1838 Err_Type
: Entity_Id
:= Empty
;
1839 Found
: Boolean := False;
1842 I1
: Interp_Index
:= 0; -- prevent junk warning
1845 Seen
: Entity_Id
:= Empty
; -- prevent junk warning
1847 function Comes_From_Predefined_Lib_Unit
(Nod
: Node_Id
) return Boolean;
1848 -- Determine whether a node comes from a predefined library unit or
1851 procedure Patch_Up_Value
(N
: Node_Id
; Typ
: Entity_Id
);
1852 -- Try and fix up a literal so that it matches its expected type. New
1853 -- literals are manufactured if necessary to avoid cascaded errors.
1855 procedure Report_Ambiguous_Argument
;
1856 -- Additional diagnostics when an ambiguous call has an ambiguous
1857 -- argument (typically a controlling actual).
1859 procedure Resolution_Failed
;
1860 -- Called when attempt at resolving current expression fails
1862 ------------------------------------
1863 -- Comes_From_Predefined_Lib_Unit --
1864 -------------------------------------
1866 function Comes_From_Predefined_Lib_Unit
(Nod
: Node_Id
) return Boolean is
1869 Sloc
(Nod
) = Standard_Location
or else In_Predefined_Unit
(Nod
);
1870 end Comes_From_Predefined_Lib_Unit
;
1872 --------------------
1873 -- Patch_Up_Value --
1874 --------------------
1876 procedure Patch_Up_Value
(N
: Node_Id
; Typ
: Entity_Id
) is
1878 if Nkind
(N
) = N_Integer_Literal
and then Is_Real_Type
(Typ
) then
1880 Make_Real_Literal
(Sloc
(N
),
1881 Realval
=> UR_From_Uint
(Intval
(N
))));
1882 Set_Etype
(N
, Universal_Real
);
1883 Set_Is_Static_Expression
(N
);
1885 elsif Nkind
(N
) = N_Real_Literal
and then Is_Integer_Type
(Typ
) then
1887 Make_Integer_Literal
(Sloc
(N
),
1888 Intval
=> UR_To_Uint
(Realval
(N
))));
1889 Set_Etype
(N
, Universal_Integer
);
1890 Set_Is_Static_Expression
(N
);
1892 elsif Nkind
(N
) = N_String_Literal
1893 and then Is_Character_Type
(Typ
)
1895 Set_Character_Literal_Name
(Char_Code
(Character'Pos ('A')));
1897 Make_Character_Literal
(Sloc
(N
),
1899 Char_Literal_Value
=>
1900 UI_From_Int
(Character'Pos ('A'))));
1901 Set_Etype
(N
, Any_Character
);
1902 Set_Is_Static_Expression
(N
);
1904 elsif Nkind
(N
) /= N_String_Literal
and then Is_String_Type
(Typ
) then
1906 Make_String_Literal
(Sloc
(N
),
1907 Strval
=> End_String
));
1909 elsif Nkind
(N
) = N_Range
then
1910 Patch_Up_Value
(Low_Bound
(N
), Typ
);
1911 Patch_Up_Value
(High_Bound
(N
), Typ
);
1915 -------------------------------
1916 -- Report_Ambiguous_Argument --
1917 -------------------------------
1919 procedure Report_Ambiguous_Argument
is
1920 Arg
: constant Node_Id
:= First
(Parameter_Associations
(N
));
1925 if Nkind
(Arg
) = N_Function_Call
1926 and then Is_Entity_Name
(Name
(Arg
))
1927 and then Is_Overloaded
(Name
(Arg
))
1929 Error_Msg_NE
("ambiguous call to&", Arg
, Name
(Arg
));
1931 -- Could use comments on what is going on here???
1933 Get_First_Interp
(Name
(Arg
), I
, It
);
1934 while Present
(It
.Nam
) loop
1935 Error_Msg_Sloc
:= Sloc
(It
.Nam
);
1937 if Nkind
(Parent
(It
.Nam
)) = N_Full_Type_Declaration
then
1938 Error_Msg_N
("interpretation (inherited) #!", Arg
);
1940 Error_Msg_N
("interpretation #!", Arg
);
1943 Get_Next_Interp
(I
, It
);
1946 end Report_Ambiguous_Argument
;
1948 -----------------------
1949 -- Resolution_Failed --
1950 -----------------------
1952 procedure Resolution_Failed
is
1954 Patch_Up_Value
(N
, Typ
);
1956 -- Set the type to the desired one to minimize cascaded errors. Note
1957 -- that this is an approximation and does not work in all cases.
1961 Debug_A_Exit
("resolving ", N
, " (done, resolution failed)");
1962 Set_Is_Overloaded
(N
, False);
1964 -- The caller will return without calling the expander, so we need
1965 -- to set the analyzed flag. Note that it is fine to set Analyzed
1966 -- to True even if we are in the middle of a shallow analysis,
1967 -- (see the spec of sem for more details) since this is an error
1968 -- situation anyway, and there is no point in repeating the
1969 -- analysis later (indeed it won't work to repeat it later, since
1970 -- we haven't got a clear resolution of which entity is being
1973 Set_Analyzed
(N
, True);
1975 end Resolution_Failed
;
1977 -- Start of processing for Resolve
1984 -- Access attribute on remote subprogram cannot be used for a non-remote
1985 -- access-to-subprogram type.
1987 if Nkind
(N
) = N_Attribute_Reference
1988 and then Nam_In
(Attribute_Name
(N
), Name_Access
,
1989 Name_Unrestricted_Access
,
1990 Name_Unchecked_Access
)
1991 and then Comes_From_Source
(N
)
1992 and then Is_Entity_Name
(Prefix
(N
))
1993 and then Is_Subprogram
(Entity
(Prefix
(N
)))
1994 and then Is_Remote_Call_Interface
(Entity
(Prefix
(N
)))
1995 and then not Is_Remote_Access_To_Subprogram_Type
(Typ
)
1998 ("prefix must statically denote a non-remote subprogram", N
);
2001 From_Lib
:= Comes_From_Predefined_Lib_Unit
(N
);
2003 -- If the context is a Remote_Access_To_Subprogram, access attributes
2004 -- must be resolved with the corresponding fat pointer. There is no need
2005 -- to check for the attribute name since the return type of an
2006 -- attribute is never a remote type.
2008 if Nkind
(N
) = N_Attribute_Reference
2009 and then Comes_From_Source
(N
)
2010 and then (Is_Remote_Call_Interface
(Typ
) or else Is_Remote_Types
(Typ
))
2013 Attr
: constant Attribute_Id
:=
2014 Get_Attribute_Id
(Attribute_Name
(N
));
2015 Pref
: constant Node_Id
:= Prefix
(N
);
2018 Is_Remote
: Boolean := True;
2021 -- Check that Typ is a remote access-to-subprogram type
2023 if Is_Remote_Access_To_Subprogram_Type
(Typ
) then
2025 -- Prefix (N) must statically denote a remote subprogram
2026 -- declared in a package specification.
2028 if Attr
= Attribute_Access
or else
2029 Attr
= Attribute_Unchecked_Access
or else
2030 Attr
= Attribute_Unrestricted_Access
2032 Decl
:= Unit_Declaration_Node
(Entity
(Pref
));
2034 if Nkind
(Decl
) = N_Subprogram_Body
then
2035 Spec
:= Corresponding_Spec
(Decl
);
2037 if Present
(Spec
) then
2038 Decl
:= Unit_Declaration_Node
(Spec
);
2042 Spec
:= Parent
(Decl
);
2044 if not Is_Entity_Name
(Prefix
(N
))
2045 or else Nkind
(Spec
) /= N_Package_Specification
2047 not Is_Remote_Call_Interface
(Defining_Entity
(Spec
))
2051 ("prefix must statically denote a remote subprogram ",
2055 -- If we are generating code in distributed mode, perform
2056 -- semantic checks against corresponding remote entities.
2059 and then Get_PCS_Name
/= Name_No_DSA
2061 Check_Subtype_Conformant
2062 (New_Id
=> Entity
(Prefix
(N
)),
2063 Old_Id
=> Designated_Type
2064 (Corresponding_Remote_Type
(Typ
)),
2068 Process_Remote_AST_Attribute
(N
, Typ
);
2076 Debug_A_Entry
("resolving ", N
);
2078 if Debug_Flag_V
then
2079 Write_Overloads
(N
);
2082 if Comes_From_Source
(N
) then
2083 if Is_Fixed_Point_Type
(Typ
) then
2084 Check_Restriction
(No_Fixed_Point
, N
);
2086 elsif Is_Floating_Point_Type
(Typ
)
2087 and then Typ
/= Universal_Real
2088 and then Typ
/= Any_Real
2090 Check_Restriction
(No_Floating_Point
, N
);
2094 -- Return if already analyzed
2096 if Analyzed
(N
) then
2097 Debug_A_Exit
("resolving ", N
, " (done, already analyzed)");
2098 Analyze_Dimension
(N
);
2101 -- Any case of Any_Type as the Etype value means that we had a
2104 elsif Etype
(N
) = Any_Type
then
2105 Debug_A_Exit
("resolving ", N
, " (done, Etype = Any_Type)");
2109 Check_Parameterless_Call
(N
);
2111 -- The resolution of an Expression_With_Actions is determined by
2114 if Nkind
(N
) = N_Expression_With_Actions
then
2115 Resolve
(Expression
(N
), Typ
);
2118 Expr_Type
:= Etype
(Expression
(N
));
2120 -- If not overloaded, then we know the type, and all that needs doing
2121 -- is to check that this type is compatible with the context.
2123 elsif not Is_Overloaded
(N
) then
2124 Found
:= Covers
(Typ
, Etype
(N
));
2125 Expr_Type
:= Etype
(N
);
2127 -- In the overloaded case, we must select the interpretation that
2128 -- is compatible with the context (i.e. the type passed to Resolve)
2131 -- Loop through possible interpretations
2133 Get_First_Interp
(N
, I
, It
);
2134 Interp_Loop
: while Present
(It
.Typ
) loop
2135 if Debug_Flag_V
then
2136 Write_Str
("Interp: ");
2140 -- We are only interested in interpretations that are compatible
2141 -- with the expected type, any other interpretations are ignored.
2143 if not Covers
(Typ
, It
.Typ
) then
2144 if Debug_Flag_V
then
2145 Write_Str
(" interpretation incompatible with context");
2150 -- Skip the current interpretation if it is disabled by an
2151 -- abstract operator. This action is performed only when the
2152 -- type against which we are resolving is the same as the
2153 -- type of the interpretation.
2155 if Ada_Version
>= Ada_2005
2156 and then It
.Typ
= Typ
2157 and then Typ
/= Universal_Integer
2158 and then Typ
/= Universal_Real
2159 and then Present
(It
.Abstract_Op
)
2161 if Debug_Flag_V
then
2162 Write_Line
("Skip.");
2168 -- First matching interpretation
2174 Expr_Type
:= It
.Typ
;
2176 -- Matching interpretation that is not the first, maybe an
2177 -- error, but there are some cases where preference rules are
2178 -- used to choose between the two possibilities. These and
2179 -- some more obscure cases are handled in Disambiguate.
2182 -- If the current statement is part of a predefined library
2183 -- unit, then all interpretations which come from user level
2184 -- packages should not be considered. Check previous and
2188 if not Comes_From_Predefined_Lib_Unit
(It
.Nam
) then
2191 elsif not Comes_From_Predefined_Lib_Unit
(Seen
) then
2193 -- Previous interpretation must be discarded
2197 Expr_Type
:= It
.Typ
;
2198 Set_Entity
(N
, Seen
);
2203 -- Otherwise apply further disambiguation steps
2205 Error_Msg_Sloc
:= Sloc
(Seen
);
2206 It1
:= Disambiguate
(N
, I1
, I
, Typ
);
2208 -- Disambiguation has succeeded. Skip the remaining
2211 if It1
/= No_Interp
then
2213 Expr_Type
:= It1
.Typ
;
2215 while Present
(It
.Typ
) loop
2216 Get_Next_Interp
(I
, It
);
2220 -- Before we issue an ambiguity complaint, check for the
2221 -- case of a subprogram call where at least one of the
2222 -- arguments is Any_Type, and if so suppress the message,
2223 -- since it is a cascaded error. This can also happen for
2224 -- a generalized indexing operation.
2226 if Nkind
(N
) in N_Subprogram_Call
2227 or else (Nkind
(N
) = N_Indexed_Component
2228 and then Present
(Generalized_Indexing
(N
)))
2235 if Nkind
(N
) = N_Indexed_Component
then
2236 Rewrite
(N
, Generalized_Indexing
(N
));
2239 A
:= First_Actual
(N
);
2240 while Present
(A
) loop
2243 if Nkind
(E
) = N_Parameter_Association
then
2244 E
:= Explicit_Actual_Parameter
(E
);
2247 if Etype
(E
) = Any_Type
then
2248 if Debug_Flag_V
then
2249 Write_Str
("Any_Type in call");
2260 elsif Nkind
(N
) in N_Binary_Op
2261 and then (Etype
(Left_Opnd
(N
)) = Any_Type
2262 or else Etype
(Right_Opnd
(N
)) = Any_Type
)
2266 elsif Nkind
(N
) in N_Unary_Op
2267 and then Etype
(Right_Opnd
(N
)) = Any_Type
2272 -- Not that special case, so issue message using the flag
2273 -- Ambiguous to control printing of the header message
2274 -- only at the start of an ambiguous set.
2276 if not Ambiguous
then
2277 if Nkind
(N
) = N_Function_Call
2278 and then Nkind
(Name
(N
)) = N_Explicit_Dereference
2281 ("ambiguous expression (cannot resolve indirect "
2284 Error_Msg_NE
-- CODEFIX
2285 ("ambiguous expression (cannot resolve&)!",
2291 if Nkind
(Parent
(Seen
)) = N_Full_Type_Declaration
then
2293 ("\\possible interpretation (inherited)#!", N
);
2295 Error_Msg_N
-- CODEFIX
2296 ("\\possible interpretation#!", N
);
2299 if Nkind
(N
) in N_Subprogram_Call
2300 and then Present
(Parameter_Associations
(N
))
2302 Report_Ambiguous_Argument
;
2306 Error_Msg_Sloc
:= Sloc
(It
.Nam
);
2308 -- By default, the error message refers to the candidate
2309 -- interpretation. But if it is a predefined operator, it
2310 -- is implicitly declared at the declaration of the type
2311 -- of the operand. Recover the sloc of that declaration
2312 -- for the error message.
2314 if Nkind
(N
) in N_Op
2315 and then Scope
(It
.Nam
) = Standard_Standard
2316 and then not Is_Overloaded
(Right_Opnd
(N
))
2317 and then Scope
(Base_Type
(Etype
(Right_Opnd
(N
)))) /=
2320 Err_Type
:= First_Subtype
(Etype
(Right_Opnd
(N
)));
2322 if Comes_From_Source
(Err_Type
)
2323 and then Present
(Parent
(Err_Type
))
2325 Error_Msg_Sloc
:= Sloc
(Parent
(Err_Type
));
2328 elsif Nkind
(N
) in N_Binary_Op
2329 and then Scope
(It
.Nam
) = Standard_Standard
2330 and then not Is_Overloaded
(Left_Opnd
(N
))
2331 and then Scope
(Base_Type
(Etype
(Left_Opnd
(N
)))) /=
2334 Err_Type
:= First_Subtype
(Etype
(Left_Opnd
(N
)));
2336 if Comes_From_Source
(Err_Type
)
2337 and then Present
(Parent
(Err_Type
))
2339 Error_Msg_Sloc
:= Sloc
(Parent
(Err_Type
));
2342 -- If this is an indirect call, use the subprogram_type
2343 -- in the message, to have a meaningful location. Also
2344 -- indicate if this is an inherited operation, created
2345 -- by a type declaration.
2347 elsif Nkind
(N
) = N_Function_Call
2348 and then Nkind
(Name
(N
)) = N_Explicit_Dereference
2349 and then Is_Type
(It
.Nam
)
2353 Sloc
(Associated_Node_For_Itype
(Err_Type
));
2358 if Nkind
(N
) in N_Op
2359 and then Scope
(It
.Nam
) = Standard_Standard
2360 and then Present
(Err_Type
)
2362 -- Special-case the message for universal_fixed
2363 -- operators, which are not declared with the type
2364 -- of the operand, but appear forever in Standard.
2366 if It
.Typ
= Universal_Fixed
2367 and then Scope
(It
.Nam
) = Standard_Standard
2370 ("\\possible interpretation as universal_fixed "
2371 & "operation (RM 4.5.5 (19))", N
);
2374 ("\\possible interpretation (predefined)#!", N
);
2378 Nkind
(Parent
(It
.Nam
)) = N_Full_Type_Declaration
2381 ("\\possible interpretation (inherited)#!", N
);
2383 Error_Msg_N
-- CODEFIX
2384 ("\\possible interpretation#!", N
);
2390 -- We have a matching interpretation, Expr_Type is the type
2391 -- from this interpretation, and Seen is the entity.
2393 -- For an operator, just set the entity name. The type will be
2394 -- set by the specific operator resolution routine.
2396 if Nkind
(N
) in N_Op
then
2397 Set_Entity
(N
, Seen
);
2398 Generate_Reference
(Seen
, N
);
2400 elsif Nkind_In
(N
, N_Case_Expression
,
2401 N_Character_Literal
,
2405 Set_Etype
(N
, Expr_Type
);
2407 -- AI05-0139-2: Expression is overloaded because type has
2408 -- implicit dereference. If type matches context, no implicit
2409 -- dereference is involved. If the expression is an entity,
2410 -- generate a reference to it, as this is not done for an
2411 -- overloaded construct during analysis.
2413 elsif Has_Implicit_Dereference
(Expr_Type
) then
2414 Set_Etype
(N
, Expr_Type
);
2415 Set_Is_Overloaded
(N
, False);
2417 if Is_Entity_Name
(N
) then
2418 Generate_Reference
(Entity
(N
), N
);
2423 elsif Is_Overloaded
(N
)
2424 and then Present
(It
.Nam
)
2425 and then Ekind
(It
.Nam
) = E_Discriminant
2426 and then Has_Implicit_Dereference
(It
.Nam
)
2428 -- If the node is a general indexing, the dereference is
2429 -- is inserted when resolving the rewritten form, else
2432 if Nkind
(N
) /= N_Indexed_Component
2433 or else No
(Generalized_Indexing
(N
))
2435 Build_Explicit_Dereference
(N
, It
.Nam
);
2438 -- For an explicit dereference, attribute reference, range,
2439 -- short-circuit form (which is not an operator node), or call
2440 -- with a name that is an explicit dereference, there is
2441 -- nothing to be done at this point.
2443 elsif Nkind_In
(N
, N_Attribute_Reference
,
2445 N_Explicit_Dereference
,
2447 N_Indexed_Component
,
2450 N_Selected_Component
,
2452 or else Nkind
(Name
(N
)) = N_Explicit_Dereference
2456 -- For procedure or function calls, set the type of the name,
2457 -- and also the entity pointer for the prefix.
2459 elsif Nkind
(N
) in N_Subprogram_Call
2460 and then Is_Entity_Name
(Name
(N
))
2462 Set_Etype
(Name
(N
), Expr_Type
);
2463 Set_Entity
(Name
(N
), Seen
);
2464 Generate_Reference
(Seen
, Name
(N
));
2466 elsif Nkind
(N
) = N_Function_Call
2467 and then Nkind
(Name
(N
)) = N_Selected_Component
2469 Set_Etype
(Name
(N
), Expr_Type
);
2470 Set_Entity
(Selector_Name
(Name
(N
)), Seen
);
2471 Generate_Reference
(Seen
, Selector_Name
(Name
(N
)));
2473 -- For all other cases, just set the type of the Name
2476 Set_Etype
(Name
(N
), Expr_Type
);
2483 -- Move to next interpretation
2485 exit Interp_Loop
when No
(It
.Typ
);
2487 Get_Next_Interp
(I
, It
);
2488 end loop Interp_Loop
;
2491 -- At this stage Found indicates whether or not an acceptable
2492 -- interpretation exists. If not, then we have an error, except that if
2493 -- the context is Any_Type as a result of some other error, then we
2494 -- suppress the error report.
2497 if Typ
/= Any_Type
then
2499 -- If type we are looking for is Void, then this is the procedure
2500 -- call case, and the error is simply that what we gave is not a
2501 -- procedure name (we think of procedure calls as expressions with
2502 -- types internally, but the user doesn't think of them this way).
2504 if Typ
= Standard_Void_Type
then
2506 -- Special case message if function used as a procedure
2508 if Nkind
(N
) = N_Procedure_Call_Statement
2509 and then Is_Entity_Name
(Name
(N
))
2510 and then Ekind
(Entity
(Name
(N
))) = E_Function
2513 ("cannot use call to function & as a statement",
2514 Name
(N
), Entity
(Name
(N
)));
2516 ("\return value of a function call cannot be ignored",
2519 -- Otherwise give general message (not clear what cases this
2520 -- covers, but no harm in providing for them).
2523 Error_Msg_N
("expect procedure name in procedure call", N
);
2528 -- Otherwise we do have a subexpression with the wrong type
2530 -- Check for the case of an allocator which uses an access type
2531 -- instead of the designated type. This is a common error and we
2532 -- specialize the message, posting an error on the operand of the
2533 -- allocator, complaining that we expected the designated type of
2536 elsif Nkind
(N
) = N_Allocator
2537 and then Is_Access_Type
(Typ
)
2538 and then Is_Access_Type
(Etype
(N
))
2539 and then Designated_Type
(Etype
(N
)) = Typ
2541 Wrong_Type
(Expression
(N
), Designated_Type
(Typ
));
2544 -- Check for view mismatch on Null in instances, for which the
2545 -- view-swapping mechanism has no identifier.
2547 elsif (In_Instance
or else In_Inlined_Body
)
2548 and then (Nkind
(N
) = N_Null
)
2549 and then Is_Private_Type
(Typ
)
2550 and then Is_Access_Type
(Full_View
(Typ
))
2552 Resolve
(N
, Full_View
(Typ
));
2556 -- Check for an aggregate. Sometimes we can get bogus aggregates
2557 -- from misuse of parentheses, and we are about to complain about
2558 -- the aggregate without even looking inside it.
2560 -- Instead, if we have an aggregate of type Any_Composite, then
2561 -- analyze and resolve the component fields, and then only issue
2562 -- another message if we get no errors doing this (otherwise
2563 -- assume that the errors in the aggregate caused the problem).
2565 elsif Nkind
(N
) = N_Aggregate
2566 and then Etype
(N
) = Any_Composite
2568 -- Disable expansion in any case. If there is a type mismatch
2569 -- it may be fatal to try to expand the aggregate. The flag
2570 -- would otherwise be set to false when the error is posted.
2572 Expander_Active
:= False;
2575 procedure Check_Aggr
(Aggr
: Node_Id
);
2576 -- Check one aggregate, and set Found to True if we have a
2577 -- definite error in any of its elements
2579 procedure Check_Elmt
(Aelmt
: Node_Id
);
2580 -- Check one element of aggregate and set Found to True if
2581 -- we definitely have an error in the element.
2587 procedure Check_Aggr
(Aggr
: Node_Id
) is
2591 if Present
(Expressions
(Aggr
)) then
2592 Elmt
:= First
(Expressions
(Aggr
));
2593 while Present
(Elmt
) loop
2599 if Present
(Component_Associations
(Aggr
)) then
2600 Elmt
:= First
(Component_Associations
(Aggr
));
2601 while Present
(Elmt
) loop
2603 -- If this is a default-initialized component, then
2604 -- there is nothing to check. The box will be
2605 -- replaced by the appropriate call during late
2608 if Nkind
(Elmt
) /= N_Iterated_Component_Association
2609 and then not Box_Present
(Elmt
)
2611 Check_Elmt
(Expression
(Elmt
));
2623 procedure Check_Elmt
(Aelmt
: Node_Id
) is
2625 -- If we have a nested aggregate, go inside it (to
2626 -- attempt a naked analyze-resolve of the aggregate can
2627 -- cause undesirable cascaded errors). Do not resolve
2628 -- expression if it needs a type from context, as for
2629 -- integer * fixed expression.
2631 if Nkind
(Aelmt
) = N_Aggregate
then
2637 if not Is_Overloaded
(Aelmt
)
2638 and then Etype
(Aelmt
) /= Any_Fixed
2643 if Etype
(Aelmt
) = Any_Type
then
2654 -- Looks like we have a type error, but check for special case
2655 -- of Address wanted, integer found, with the configuration pragma
2656 -- Allow_Integer_Address active. If we have this case, introduce
2657 -- an unchecked conversion to allow the integer expression to be
2658 -- treated as an Address. The reverse case of integer wanted,
2659 -- Address found, is treated in an analogous manner.
2661 if Address_Integer_Convert_OK
(Typ
, Etype
(N
)) then
2662 Rewrite
(N
, Unchecked_Convert_To
(Typ
, Relocate_Node
(N
)));
2663 Analyze_And_Resolve
(N
, Typ
);
2666 -- Under relaxed RM semantics silently replace occurrences of null
2667 -- by System.Address_Null.
2669 elsif Null_To_Null_Address_Convert_OK
(N
, Typ
) then
2670 Replace_Null_By_Null_Address
(N
);
2671 Analyze_And_Resolve
(N
, Typ
);
2675 -- That special Allow_Integer_Address check did not apply, so we
2676 -- have a real type error. If an error message was issued already,
2677 -- Found got reset to True, so if it's still False, issue standard
2678 -- Wrong_Type message.
2681 if Is_Overloaded
(N
) and then Nkind
(N
) = N_Function_Call
then
2683 Subp_Name
: Node_Id
;
2686 if Is_Entity_Name
(Name
(N
)) then
2687 Subp_Name
:= Name
(N
);
2689 elsif Nkind
(Name
(N
)) = N_Selected_Component
then
2691 -- Protected operation: retrieve operation name
2693 Subp_Name
:= Selector_Name
(Name
(N
));
2696 raise Program_Error
;
2699 Error_Msg_Node_2
:= Typ
;
2701 ("no visible interpretation of& matches expected type&",
2705 if All_Errors_Mode
then
2707 Index
: Interp_Index
;
2711 Error_Msg_N
("\\possible interpretations:", N
);
2713 Get_First_Interp
(Name
(N
), Index
, It
);
2714 while Present
(It
.Nam
) loop
2715 Error_Msg_Sloc
:= Sloc
(It
.Nam
);
2716 Error_Msg_Node_2
:= It
.Nam
;
2718 ("\\ type& for & declared#", N
, It
.Typ
);
2719 Get_Next_Interp
(Index
, It
);
2724 Error_Msg_N
("\use -gnatf for details", N
);
2728 Wrong_Type
(N
, Typ
);
2736 -- Test if we have more than one interpretation for the context
2738 elsif Ambiguous
then
2742 -- Only one intepretation
2745 -- In Ada 2005, if we have something like "X : T := 2 + 2;", where
2746 -- the "+" on T is abstract, and the operands are of universal type,
2747 -- the above code will have (incorrectly) resolved the "+" to the
2748 -- universal one in Standard. Therefore check for this case and give
2749 -- an error. We can't do this earlier, because it would cause legal
2750 -- cases to get errors (when some other type has an abstract "+").
2752 if Ada_Version
>= Ada_2005
2753 and then Nkind
(N
) in N_Op
2754 and then Is_Overloaded
(N
)
2755 and then Is_Universal_Numeric_Type
(Etype
(Entity
(N
)))
2757 Get_First_Interp
(N
, I
, It
);
2758 while Present
(It
.Typ
) loop
2759 if Present
(It
.Abstract_Op
) and then
2760 Etype
(It
.Abstract_Op
) = Typ
2763 ("cannot call abstract subprogram &!", N
, It
.Abstract_Op
);
2767 Get_Next_Interp
(I
, It
);
2771 -- Here we have an acceptable interpretation for the context
2773 -- Propagate type information and normalize tree for various
2774 -- predefined operations. If the context only imposes a class of
2775 -- types, rather than a specific type, propagate the actual type
2778 if Typ
= Any_Integer
or else
2779 Typ
= Any_Boolean
or else
2780 Typ
= Any_Modular
or else
2781 Typ
= Any_Real
or else
2784 Ctx_Type
:= Expr_Type
;
2786 -- Any_Fixed is legal in a real context only if a specific fixed-
2787 -- point type is imposed. If Norman Cohen can be confused by this,
2788 -- it deserves a separate message.
2791 and then Expr_Type
= Any_Fixed
2793 Error_Msg_N
("illegal context for mixed mode operation", N
);
2794 Set_Etype
(N
, Universal_Real
);
2795 Ctx_Type
:= Universal_Real
;
2799 -- A user-defined operator is transformed into a function call at
2800 -- this point, so that further processing knows that operators are
2801 -- really operators (i.e. are predefined operators). User-defined
2802 -- operators that are intrinsic are just renamings of the predefined
2803 -- ones, and need not be turned into calls either, but if they rename
2804 -- a different operator, we must transform the node accordingly.
2805 -- Instantiations of Unchecked_Conversion are intrinsic but are
2806 -- treated as functions, even if given an operator designator.
2808 if Nkind
(N
) in N_Op
2809 and then Present
(Entity
(N
))
2810 and then Ekind
(Entity
(N
)) /= E_Operator
2812 if not Is_Predefined_Op
(Entity
(N
)) then
2813 Rewrite_Operator_As_Call
(N
, Entity
(N
));
2815 elsif Present
(Alias
(Entity
(N
)))
2817 Nkind
(Parent
(Parent
(Entity
(N
)))) =
2818 N_Subprogram_Renaming_Declaration
2820 Rewrite_Renamed_Operator
(N
, Alias
(Entity
(N
)), Typ
);
2822 -- If the node is rewritten, it will be fully resolved in
2823 -- Rewrite_Renamed_Operator.
2825 if Analyzed
(N
) then
2831 case N_Subexpr
'(Nkind (N)) is
2833 Resolve_Aggregate (N, Ctx_Type);
2836 Resolve_Allocator (N, Ctx_Type);
2838 when N_Short_Circuit =>
2839 Resolve_Short_Circuit (N, Ctx_Type);
2841 when N_Attribute_Reference =>
2842 Resolve_Attribute (N, Ctx_Type);
2844 when N_Case_Expression =>
2845 Resolve_Case_Expression (N, Ctx_Type);
2847 when N_Character_Literal =>
2848 Resolve_Character_Literal (N, Ctx_Type);
2850 when N_Delta_Aggregate =>
2851 Resolve_Delta_Aggregate (N, Ctx_Type);
2853 when N_Expanded_Name =>
2854 Resolve_Entity_Name (N, Ctx_Type);
2856 when N_Explicit_Dereference =>
2857 Resolve_Explicit_Dereference (N, Ctx_Type);
2859 when N_Expression_With_Actions =>
2860 Resolve_Expression_With_Actions (N, Ctx_Type);
2862 when N_Extension_Aggregate =>
2863 Resolve_Extension_Aggregate (N, Ctx_Type);
2865 when N_Function_Call =>
2866 Resolve_Call (N, Ctx_Type);
2868 when N_Identifier =>
2869 Resolve_Entity_Name (N, Ctx_Type);
2871 when N_If_Expression =>
2872 Resolve_If_Expression (N, Ctx_Type);
2874 when N_Indexed_Component =>
2875 Resolve_Indexed_Component (N, Ctx_Type);
2877 when N_Integer_Literal =>
2878 Resolve_Integer_Literal (N, Ctx_Type);
2880 when N_Membership_Test =>
2881 Resolve_Membership_Op (N, Ctx_Type);
2884 Resolve_Null (N, Ctx_Type);
2890 Resolve_Logical_Op (N, Ctx_Type);
2895 Resolve_Equality_Op (N, Ctx_Type);
2902 Resolve_Comparison_Op (N, Ctx_Type);
2905 Resolve_Op_Not (N, Ctx_Type);
2914 Resolve_Arithmetic_Op (N, Ctx_Type);
2917 Resolve_Op_Concat (N, Ctx_Type);
2920 Resolve_Op_Expon (N, Ctx_Type);
2926 Resolve_Unary_Op (N, Ctx_Type);
2929 Resolve_Shift (N, Ctx_Type);
2931 when N_Procedure_Call_Statement =>
2932 Resolve_Call (N, Ctx_Type);
2934 when N_Operator_Symbol =>
2935 Resolve_Operator_Symbol (N, Ctx_Type);
2937 when N_Qualified_Expression =>
2938 Resolve_Qualified_Expression (N, Ctx_Type);
2940 -- Why is the following null, needs a comment ???
2942 when N_Quantified_Expression =>
2945 when N_Raise_Expression =>
2946 Resolve_Raise_Expression (N, Ctx_Type);
2948 when N_Raise_xxx_Error =>
2949 Set_Etype (N, Ctx_Type);
2952 Resolve_Range (N, Ctx_Type);
2954 when N_Real_Literal =>
2955 Resolve_Real_Literal (N, Ctx_Type);
2958 Resolve_Reference (N, Ctx_Type);
2960 when N_Selected_Component =>
2961 Resolve_Selected_Component (N, Ctx_Type);
2964 Resolve_Slice (N, Ctx_Type);
2966 when N_String_Literal =>
2967 Resolve_String_Literal (N, Ctx_Type);
2969 when N_Target_Name =>
2970 Resolve_Target_Name (N, Ctx_Type);
2972 when N_Type_Conversion =>
2973 Resolve_Type_Conversion (N, Ctx_Type);
2975 when N_Unchecked_Expression =>
2976 Resolve_Unchecked_Expression (N, Ctx_Type);
2978 when N_Unchecked_Type_Conversion =>
2979 Resolve_Unchecked_Type_Conversion (N, Ctx_Type);
2982 -- Mark relevant use-type and use-package clauses as effective using
2983 -- the original node because constant folding may have occured and
2984 -- removed references that need to be examined.
2986 if Nkind (Original_Node (N)) in N_Op then
2987 Mark_Use_Clauses (Original_Node (N));
2990 -- Ada 2012 (AI05-0149): Apply an (implicit) conversion to an
2991 -- expression of an anonymous access type that occurs in the context
2992 -- of a named general access type, except when the expression is that
2993 -- of a membership test. This ensures proper legality checking in
2994 -- terms of allowed conversions (expressions that would be illegal to
2995 -- convert implicitly are allowed in membership tests).
2997 if Ada_Version >= Ada_2012
2998 and then Ekind (Ctx_Type) = E_General_Access_Type
2999 and then Ekind (Etype (N)) = E_Anonymous_Access_Type
3000 and then Nkind (Parent (N)) not in N_Membership_Test
3002 Rewrite (N, Convert_To (Ctx_Type, Relocate_Node (N)));
3003 Analyze_And_Resolve (N, Ctx_Type);
3006 -- If the subexpression was replaced by a non-subexpression, then
3007 -- all we do is to expand it. The only legitimate case we know of
3008 -- is converting procedure call statement to entry call statements,
3009 -- but there may be others, so we are making this test general.
3011 if Nkind (N) not in N_Subexpr then
3012 Debug_A_Exit ("resolving ", N, " (done)");
3017 -- The expression is definitely NOT overloaded at this point, so
3018 -- we reset the Is_Overloaded flag to avoid any confusion when
3019 -- reanalyzing the node.
3021 Set_Is_Overloaded (N, False);
3023 -- Freeze expression type, entity if it is a name, and designated
3024 -- type if it is an allocator (RM 13.14(10,11,13)).
3026 -- Now that the resolution of the type of the node is complete, and
3027 -- we did not detect an error, we can expand this node. We skip the
3028 -- expand call if we are in a default expression, see section
3029 -- "Handling of Default Expressions" in Sem spec.
3031 Debug_A_Exit ("resolving ", N, " (done)");
3033 -- We unconditionally freeze the expression, even if we are in
3034 -- default expression mode (the Freeze_Expression routine tests this
3035 -- flag and only freezes static types if it is set).
3037 -- Ada 2012 (AI05-177): The declaration of an expression function
3038 -- does not cause freezing, but we never reach here in that case.
3039 -- Here we are resolving the corresponding expanded body, so we do
3040 -- need to perform normal freezing.
3042 -- As elsewhere we do not emit freeze node within a generic. We make
3043 -- an exception for entities that are expressions, only to detect
3044 -- misuses of deferred constants and preserve the output of various
3047 if not Inside_A_Generic or else Is_Entity_Name (N) then
3048 Freeze_Expression (N);
3051 -- Now we can do the expansion
3061 -- Version with check(s) suppressed
3063 procedure Resolve (N : Node_Id; Typ : Entity_Id; Suppress : Check_Id) is
3065 if Suppress = All_Checks then
3067 Sva : constant Suppress_Array := Scope_Suppress.Suppress;
3069 Scope_Suppress.Suppress := (others => True);
3071 Scope_Suppress.Suppress := Sva;
3076 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
3078 Scope_Suppress.Suppress (Suppress) := True;
3080 Scope_Suppress.Suppress (Suppress) := Svg;
3089 -- Version with implicit type
3091 procedure Resolve (N : Node_Id) is
3093 Resolve (N, Etype (N));
3096 ---------------------
3097 -- Resolve_Actuals --
3098 ---------------------
3100 procedure Resolve_Actuals (N : Node_Id; Nam : Entity_Id) is
3101 Loc : constant Source_Ptr := Sloc (N);
3104 A_Typ : Entity_Id := Empty; -- init to avoid warning
3107 Prev : Node_Id := Empty;
3109 Real_F : Entity_Id := Empty; -- init to avoid warning
3111 Real_Subp : Entity_Id;
3112 -- If the subprogram being called is an inherited operation for
3113 -- a formal derived type in an instance, Real_Subp is the subprogram
3114 -- that will be called. It may have different formal names than the
3115 -- operation of the formal in the generic, so after actual is resolved
3116 -- the name of the actual in a named association must carry the name
3117 -- of the actual of the subprogram being called.
3119 procedure Check_Aliased_Parameter;
3120 -- Check rules on aliased parameters and related accessibility rules
3121 -- in (RM 3.10.2 (10.2-10.4)).
3123 procedure Check_Argument_Order;
3124 -- Performs a check for the case where the actuals are all simple
3125 -- identifiers that correspond to the formal names, but in the wrong
3126 -- order, which is considered suspicious and cause for a warning.
3128 procedure Check_Prefixed_Call;
3129 -- If the original node is an overloaded call in prefix notation,
3130 -- insert an 'Access or a dereference as needed over the first actual
.
3131 -- Try_Object_Operation has already verified that there is a valid
3132 -- interpretation, but the form of the actual can only be determined
3133 -- once the primitive operation is identified.
3135 procedure Flag_Effectively_Volatile_Objects
(Expr
: Node_Id
);
3136 -- Emit an error concerning the illegal usage of an effectively volatile
3137 -- object in interfering context (SPARK RM 7.13(12)).
3139 procedure Insert_Default
;
3140 -- If the actual is missing in a call, insert in the actuals list
3141 -- an instance of the default expression. The insertion is always
3142 -- a named association.
3144 function Same_Ancestor
(T1
, T2
: Entity_Id
) return Boolean;
3145 -- Check whether T1 and T2, or their full views, are derived from a
3146 -- common type. Used to enforce the restrictions on array conversions
3149 function Static_Concatenation
(N
: Node_Id
) return Boolean;
3150 -- Predicate to determine whether an actual that is a concatenation
3151 -- will be evaluated statically and does not need a transient scope.
3152 -- This must be determined before the actual is resolved and expanded
3153 -- because if needed the transient scope must be introduced earlier.
3155 -----------------------------
3156 -- Check_Aliased_Parameter --
3157 -----------------------------
3159 procedure Check_Aliased_Parameter
is
3160 Nominal_Subt
: Entity_Id
;
3163 if Is_Aliased
(F
) then
3164 if Is_Tagged_Type
(A_Typ
) then
3167 elsif Is_Aliased_View
(A
) then
3168 if Is_Constr_Subt_For_U_Nominal
(A_Typ
) then
3169 Nominal_Subt
:= Base_Type
(A_Typ
);
3171 Nominal_Subt
:= A_Typ
;
3174 if Subtypes_Statically_Match
(F_Typ
, Nominal_Subt
) then
3177 -- In a generic body assume the worst for generic formals:
3178 -- they can have a constrained partial view (AI05-041).
3180 elsif Has_Discriminants
(F_Typ
)
3181 and then not Is_Constrained
(F_Typ
)
3182 and then not Has_Constrained_Partial_View
(F_Typ
)
3183 and then not Is_Generic_Type
(F_Typ
)
3188 Error_Msg_NE
("untagged actual does not match "
3189 & "aliased formal&", A
, F
);
3193 Error_Msg_NE
("actual for aliased formal& must be "
3194 & "aliased object", A
, F
);
3197 if Ekind
(Nam
) = E_Procedure
then
3200 elsif Ekind
(Etype
(Nam
)) = E_Anonymous_Access_Type
then
3201 if Nkind
(Parent
(N
)) = N_Type_Conversion
3202 and then Type_Access_Level
(Etype
(Parent
(N
))) <
3203 Object_Access_Level
(A
)
3205 Error_Msg_N
("aliased actual has wrong accessibility", A
);
3208 elsif Nkind
(Parent
(N
)) = N_Qualified_Expression
3209 and then Nkind
(Parent
(Parent
(N
))) = N_Allocator
3210 and then Type_Access_Level
(Etype
(Parent
(Parent
(N
)))) <
3211 Object_Access_Level
(A
)
3214 ("aliased actual in allocator has wrong accessibility", A
);
3217 end Check_Aliased_Parameter
;
3219 --------------------------
3220 -- Check_Argument_Order --
3221 --------------------------
3223 procedure Check_Argument_Order
is
3225 -- Nothing to do if no parameters, or original node is neither a
3226 -- function call nor a procedure call statement (happens in the
3227 -- operator-transformed-to-function call case), or the call does
3228 -- not come from source, or this warning is off.
3230 if not Warn_On_Parameter_Order
3231 or else No
(Parameter_Associations
(N
))
3232 or else Nkind
(Original_Node
(N
)) not in N_Subprogram_Call
3233 or else not Comes_From_Source
(N
)
3239 Nargs
: constant Nat
:= List_Length
(Parameter_Associations
(N
));
3242 -- Nothing to do if only one parameter
3248 -- Here if at least two arguments
3251 Actuals
: array (1 .. Nargs
) of Node_Id
;
3255 Wrong_Order
: Boolean := False;
3256 -- Set True if an out of order case is found
3259 -- Collect identifier names of actuals, fail if any actual is
3260 -- not a simple identifier, and record max length of name.
3262 Actual
:= First
(Parameter_Associations
(N
));
3263 for J
in Actuals
'Range loop
3264 if Nkind
(Actual
) /= N_Identifier
then
3267 Actuals
(J
) := Actual
;
3272 -- If we got this far, all actuals are identifiers and the list
3273 -- of their names is stored in the Actuals array.
3275 Formal
:= First_Formal
(Nam
);
3276 for J
in Actuals
'Range loop
3278 -- If we ran out of formals, that's odd, probably an error
3279 -- which will be detected elsewhere, but abandon the search.
3285 -- If name matches and is in order OK
3287 if Chars
(Formal
) = Chars
(Actuals
(J
)) then
3291 -- If no match, see if it is elsewhere in list and if so
3292 -- flag potential wrong order if type is compatible.
3294 for K
in Actuals
'Range loop
3295 if Chars
(Formal
) = Chars
(Actuals
(K
))
3297 Has_Compatible_Type
(Actuals
(K
), Etype
(Formal
))
3299 Wrong_Order
:= True;
3309 <<Continue
>> Next_Formal
(Formal
);
3312 -- If Formals left over, also probably an error, skip warning
3314 if Present
(Formal
) then
3318 -- Here we give the warning if something was out of order
3322 ("?P?actuals for this call may be in wrong order", N
);
3326 end Check_Argument_Order
;
3328 -------------------------
3329 -- Check_Prefixed_Call --
3330 -------------------------
3332 procedure Check_Prefixed_Call
is
3333 Act
: constant Node_Id
:= First_Actual
(N
);
3334 A_Type
: constant Entity_Id
:= Etype
(Act
);
3335 F_Type
: constant Entity_Id
:= Etype
(First_Formal
(Nam
));
3336 Orig
: constant Node_Id
:= Original_Node
(N
);
3340 -- Check whether the call is a prefixed call, with or without
3341 -- additional actuals.
3343 if Nkind
(Orig
) = N_Selected_Component
3345 (Nkind
(Orig
) = N_Indexed_Component
3346 and then Nkind
(Prefix
(Orig
)) = N_Selected_Component
3347 and then Is_Entity_Name
(Prefix
(Prefix
(Orig
)))
3348 and then Is_Entity_Name
(Act
)
3349 and then Chars
(Act
) = Chars
(Prefix
(Prefix
(Orig
))))
3351 if Is_Access_Type
(A_Type
)
3352 and then not Is_Access_Type
(F_Type
)
3354 -- Introduce dereference on object in prefix
3357 Make_Explicit_Dereference
(Sloc
(Act
),
3358 Prefix
=> Relocate_Node
(Act
));
3359 Rewrite
(Act
, New_A
);
3362 elsif Is_Access_Type
(F_Type
)
3363 and then not Is_Access_Type
(A_Type
)
3365 -- Introduce an implicit 'Access in prefix
3367 if not Is_Aliased_View
(Act
) then
3369 ("object in prefixed call to& must be aliased "
3370 & "(RM 4.1.3 (13 1/2))",
3375 Make_Attribute_Reference
(Loc
,
3376 Attribute_Name
=> Name_Access
,
3377 Prefix
=> Relocate_Node
(Act
)));
3382 end Check_Prefixed_Call
;
3384 ---------------------------------------
3385 -- Flag_Effectively_Volatile_Objects --
3386 ---------------------------------------
3388 procedure Flag_Effectively_Volatile_Objects
(Expr
: Node_Id
) is
3389 function Flag_Object
(N
: Node_Id
) return Traverse_Result
;
3390 -- Determine whether arbitrary node N denotes an effectively volatile
3391 -- object and if it does, emit an error.
3397 function Flag_Object
(N
: Node_Id
) return Traverse_Result
is
3401 -- Do not consider nested function calls because they have already
3402 -- been processed during their own resolution.
3404 if Nkind
(N
) = N_Function_Call
then
3407 elsif Is_Entity_Name
(N
) and then Present
(Entity
(N
)) then
3411 and then Is_Effectively_Volatile
(Id
)
3412 and then (Async_Writers_Enabled
(Id
)
3413 or else Effective_Reads_Enabled
(Id
))
3416 ("volatile object cannot appear in this context (SPARK "
3417 & "RM 7.1.3(11))", N
);
3425 procedure Flag_Objects
is new Traverse_Proc
(Flag_Object
);
3427 -- Start of processing for Flag_Effectively_Volatile_Objects
3430 Flag_Objects
(Expr
);
3431 end Flag_Effectively_Volatile_Objects
;
3433 --------------------
3434 -- Insert_Default --
3435 --------------------
3437 procedure Insert_Default
is
3442 -- Missing argument in call, nothing to insert
3444 if No
(Default_Value
(F
)) then
3448 -- Note that we do a full New_Copy_Tree, so that any associated
3449 -- Itypes are properly copied. This may not be needed any more,
3450 -- but it does no harm as a safety measure. Defaults of a generic
3451 -- formal may be out of bounds of the corresponding actual (see
3452 -- cc1311b) and an additional check may be required.
3457 New_Scope
=> Current_Scope
,
3460 -- Propagate dimension information, if any.
3462 Copy_Dimensions
(Default_Value
(F
), Actval
);
3464 if Is_Concurrent_Type
(Scope
(Nam
))
3465 and then Has_Discriminants
(Scope
(Nam
))
3467 Replace_Actual_Discriminants
(N
, Actval
);
3470 if Is_Overloadable
(Nam
)
3471 and then Present
(Alias
(Nam
))
3473 if Base_Type
(Etype
(F
)) /= Base_Type
(Etype
(Actval
))
3474 and then not Is_Tagged_Type
(Etype
(F
))
3476 -- If default is a real literal, do not introduce a
3477 -- conversion whose effect may depend on the run-time
3478 -- size of universal real.
3480 if Nkind
(Actval
) = N_Real_Literal
then
3481 Set_Etype
(Actval
, Base_Type
(Etype
(F
)));
3483 Actval
:= Unchecked_Convert_To
(Etype
(F
), Actval
);
3487 if Is_Scalar_Type
(Etype
(F
)) then
3488 Enable_Range_Check
(Actval
);
3491 Set_Parent
(Actval
, N
);
3493 -- Resolve aggregates with their base type, to avoid scope
3494 -- anomalies: the subtype was first built in the subprogram
3495 -- declaration, and the current call may be nested.
3497 if Nkind
(Actval
) = N_Aggregate
then
3498 Analyze_And_Resolve
(Actval
, Etype
(F
));
3500 Analyze_And_Resolve
(Actval
, Etype
(Actval
));
3504 Set_Parent
(Actval
, N
);
3506 -- See note above concerning aggregates
3508 if Nkind
(Actval
) = N_Aggregate
3509 and then Has_Discriminants
(Etype
(Actval
))
3511 Analyze_And_Resolve
(Actval
, Base_Type
(Etype
(Actval
)));
3513 -- Resolve entities with their own type, which may differ from
3514 -- the type of a reference in a generic context (the view
3515 -- swapping mechanism did not anticipate the re-analysis of
3516 -- default values in calls).
3518 elsif Is_Entity_Name
(Actval
) then
3519 Analyze_And_Resolve
(Actval
, Etype
(Entity
(Actval
)));
3522 Analyze_And_Resolve
(Actval
, Etype
(Actval
));
3526 -- If default is a tag indeterminate function call, propagate tag
3527 -- to obtain proper dispatching.
3529 if Is_Controlling_Formal
(F
)
3530 and then Nkind
(Default_Value
(F
)) = N_Function_Call
3532 Set_Is_Controlling_Actual
(Actval
);
3536 -- If the default expression raises constraint error, then just
3537 -- silently replace it with an N_Raise_Constraint_Error node, since
3538 -- we already gave the warning on the subprogram spec. If node is
3539 -- already a Raise_Constraint_Error leave as is, to prevent loops in
3540 -- the warnings removal machinery.
3542 if Raises_Constraint_Error
(Actval
)
3543 and then Nkind
(Actval
) /= N_Raise_Constraint_Error
3546 Make_Raise_Constraint_Error
(Loc
,
3547 Reason
=> CE_Range_Check_Failed
));
3549 Set_Raises_Constraint_Error
(Actval
);
3550 Set_Etype
(Actval
, Etype
(F
));
3554 Make_Parameter_Association
(Loc
,
3555 Explicit_Actual_Parameter
=> Actval
,
3556 Selector_Name
=> Make_Identifier
(Loc
, Chars
(F
)));
3558 -- Case of insertion is first named actual
3561 or else Nkind
(Parent
(Prev
)) /= N_Parameter_Association
3563 Set_Next_Named_Actual
(Assoc
, First_Named_Actual
(N
));
3564 Set_First_Named_Actual
(N
, Actval
);
3567 if No
(Parameter_Associations
(N
)) then
3568 Set_Parameter_Associations
(N
, New_List
(Assoc
));
3570 Append
(Assoc
, Parameter_Associations
(N
));
3574 Insert_After
(Prev
, Assoc
);
3577 -- Case of insertion is not first named actual
3580 Set_Next_Named_Actual
3581 (Assoc
, Next_Named_Actual
(Parent
(Prev
)));
3582 Set_Next_Named_Actual
(Parent
(Prev
), Actval
);
3583 Append
(Assoc
, Parameter_Associations
(N
));
3586 Mark_Rewrite_Insertion
(Assoc
);
3587 Mark_Rewrite_Insertion
(Actval
);
3596 function Same_Ancestor
(T1
, T2
: Entity_Id
) return Boolean is
3597 FT1
: Entity_Id
:= T1
;
3598 FT2
: Entity_Id
:= T2
;
3601 if Is_Private_Type
(T1
)
3602 and then Present
(Full_View
(T1
))
3604 FT1
:= Full_View
(T1
);
3607 if Is_Private_Type
(T2
)
3608 and then Present
(Full_View
(T2
))
3610 FT2
:= Full_View
(T2
);
3613 return Root_Type
(Base_Type
(FT1
)) = Root_Type
(Base_Type
(FT2
));
3616 --------------------------
3617 -- Static_Concatenation --
3618 --------------------------
3620 function Static_Concatenation
(N
: Node_Id
) return Boolean is
3623 when N_String_Literal
=>
3628 -- Concatenation is static when both operands are static and
3629 -- the concatenation operator is a predefined one.
3631 return Scope
(Entity
(N
)) = Standard_Standard
3633 Static_Concatenation
(Left_Opnd
(N
))
3635 Static_Concatenation
(Right_Opnd
(N
));
3638 if Is_Entity_Name
(N
) then
3640 Ent
: constant Entity_Id
:= Entity
(N
);
3642 return Ekind
(Ent
) = E_Constant
3643 and then Present
(Constant_Value
(Ent
))
3645 Is_OK_Static_Expression
(Constant_Value
(Ent
));
3652 end Static_Concatenation
;
3654 -- Start of processing for Resolve_Actuals
3657 Check_Argument_Order
;
3659 if Is_Overloadable
(Nam
)
3660 and then Is_Inherited_Operation
(Nam
)
3661 and then In_Instance
3662 and then Present
(Alias
(Nam
))
3663 and then Present
(Overridden_Operation
(Alias
(Nam
)))
3665 Real_Subp
:= Alias
(Nam
);
3670 if Present
(First_Actual
(N
)) then
3671 Check_Prefixed_Call
;
3674 A
:= First_Actual
(N
);
3675 F
:= First_Formal
(Nam
);
3677 if Present
(Real_Subp
) then
3678 Real_F
:= First_Formal
(Real_Subp
);
3681 while Present
(F
) loop
3682 if No
(A
) and then Needs_No_Actuals
(Nam
) then
3685 -- If we have an error in any actual or formal, indicated by a type
3686 -- of Any_Type, then abandon resolution attempt, and set result type
3687 -- to Any_Type. Skip this if the actual is a Raise_Expression, whose
3688 -- type is imposed from context.
3690 elsif (Present
(A
) and then Etype
(A
) = Any_Type
)
3691 or else Etype
(F
) = Any_Type
3693 if Nkind
(A
) /= N_Raise_Expression
then
3694 Set_Etype
(N
, Any_Type
);
3699 -- Case where actual is present
3701 -- If the actual is an entity, generate a reference to it now. We
3702 -- do this before the actual is resolved, because a formal of some
3703 -- protected subprogram, or a task discriminant, will be rewritten
3704 -- during expansion, and the source entity reference may be lost.
3707 and then Is_Entity_Name
(A
)
3708 and then Comes_From_Source
(A
)
3710 -- Annotate the tree by creating a variable reference marker when
3711 -- the actual denotes a variable reference, in case the reference
3712 -- is folded or optimized away. The variable reference marker is
3713 -- automatically saved for later examination by the ABE Processing
3714 -- phase. The status of the reference is set as follows:
3718 -- write IN OUT, OUT
3720 if Needs_Variable_Reference_Marker
3724 Build_Variable_Reference_Marker
3726 Read
=> Ekind
(F
) /= E_Out_Parameter
,
3727 Write
=> Ekind
(F
) /= E_In_Parameter
);
3730 Orig_A
:= Entity
(A
);
3732 if Present
(Orig_A
) then
3733 if Is_Formal
(Orig_A
)
3734 and then Ekind
(F
) /= E_In_Parameter
3736 Generate_Reference
(Orig_A
, A
, 'm');
3738 elsif not Is_Overloaded
(A
) then
3739 if Ekind
(F
) /= E_Out_Parameter
then
3740 Generate_Reference
(Orig_A
, A
);
3742 -- RM 6.4.1(12): For an out parameter that is passed by
3743 -- copy, the formal parameter object is created, and:
3745 -- * For an access type, the formal parameter is initialized
3746 -- from the value of the actual, without checking that the
3747 -- value satisfies any constraint, any predicate, or any
3748 -- exclusion of the null value.
3750 -- * For a scalar type that has the Default_Value aspect
3751 -- specified, the formal parameter is initialized from the
3752 -- value of the actual, without checking that the value
3753 -- satisfies any constraint or any predicate.
3754 -- I do not understand why this case is included??? this is
3755 -- not a case where an OUT parameter is treated as IN OUT.
3757 -- * For a composite type with discriminants or that has
3758 -- implicit initial values for any subcomponents, the
3759 -- behavior is as for an in out parameter passed by copy.
3761 -- Hence for these cases we generate the read reference now
3762 -- (the write reference will be generated later by
3763 -- Note_Possible_Modification).
3765 elsif Is_By_Copy_Type
(Etype
(F
))
3767 (Is_Access_Type
(Etype
(F
))
3769 (Is_Scalar_Type
(Etype
(F
))
3771 Present
(Default_Aspect_Value
(Etype
(F
))))
3773 (Is_Composite_Type
(Etype
(F
))
3774 and then (Has_Discriminants
(Etype
(F
))
3775 or else Is_Partially_Initialized_Type
3778 Generate_Reference
(Orig_A
, A
);
3785 and then (Nkind
(Parent
(A
)) /= N_Parameter_Association
3786 or else Chars
(Selector_Name
(Parent
(A
))) = Chars
(F
))
3788 -- If style checking mode on, check match of formal name
3791 if Nkind
(Parent
(A
)) = N_Parameter_Association
then
3792 Check_Identifier
(Selector_Name
(Parent
(A
)), F
);
3796 -- If the formal is Out or In_Out, do not resolve and expand the
3797 -- conversion, because it is subsequently expanded into explicit
3798 -- temporaries and assignments. However, the object of the
3799 -- conversion can be resolved. An exception is the case of tagged
3800 -- type conversion with a class-wide actual. In that case we want
3801 -- the tag check to occur and no temporary will be needed (no
3802 -- representation change can occur) and the parameter is passed by
3803 -- reference, so we go ahead and resolve the type conversion.
3804 -- Another exception is the case of reference to component or
3805 -- subcomponent of a bit-packed array, in which case we want to
3806 -- defer expansion to the point the in and out assignments are
3809 if Ekind
(F
) /= E_In_Parameter
3810 and then Nkind
(A
) = N_Type_Conversion
3811 and then not Is_Class_Wide_Type
(Etype
(Expression
(A
)))
3812 and then not Is_Interface
(Etype
(A
))
3814 if Ekind
(F
) = E_In_Out_Parameter
3815 and then Is_Array_Type
(Etype
(F
))
3817 -- In a view conversion, the conversion must be legal in
3818 -- both directions, and thus both component types must be
3819 -- aliased, or neither (4.6 (8)).
3821 -- The extra rule in 4.6 (24.9.2) seems unduly restrictive:
3822 -- the privacy requirement should not apply to generic
3823 -- types, and should be checked in an instance. ARG query
3826 if Has_Aliased_Components
(Etype
(Expression
(A
))) /=
3827 Has_Aliased_Components
(Etype
(F
))
3830 ("both component types in a view conversion must be"
3831 & " aliased, or neither", A
);
3833 -- Comment here??? what set of cases???
3836 not Same_Ancestor
(Etype
(F
), Etype
(Expression
(A
)))
3838 -- Check view conv between unrelated by ref array types
3840 if Is_By_Reference_Type
(Etype
(F
))
3841 or else Is_By_Reference_Type
(Etype
(Expression
(A
)))
3844 ("view conversion between unrelated by reference "
3845 & "array types not allowed (\'A'I-00246)", A
);
3847 -- In Ada 2005 mode, check view conversion component
3848 -- type cannot be private, tagged, or volatile. Note
3849 -- that we only apply this to source conversions. The
3850 -- generated code can contain conversions which are
3851 -- not subject to this test, and we cannot extract the
3852 -- component type in such cases since it is not present.
3854 elsif Comes_From_Source
(A
)
3855 and then Ada_Version
>= Ada_2005
3858 Comp_Type
: constant Entity_Id
:=
3860 (Etype
(Expression
(A
)));
3862 if (Is_Private_Type
(Comp_Type
)
3863 and then not Is_Generic_Type
(Comp_Type
))
3864 or else Is_Tagged_Type
(Comp_Type
)
3865 or else Is_Volatile
(Comp_Type
)
3868 ("component type of a view conversion cannot"
3869 & " be private, tagged, or volatile"
3878 -- Resolve expression if conversion is all OK
3880 if (Conversion_OK
(A
)
3881 or else Valid_Conversion
(A
, Etype
(A
), Expression
(A
)))
3882 and then not Is_Ref_To_Bit_Packed_Array
(Expression
(A
))
3884 Resolve
(Expression
(A
));
3887 -- If the actual is a function call that returns a limited
3888 -- unconstrained object that needs finalization, create a
3889 -- transient scope for it, so that it can receive the proper
3890 -- finalization list.
3892 elsif Expander_Active
3893 and then Nkind
(A
) = N_Function_Call
3894 and then Is_Limited_Record
(Etype
(F
))
3895 and then not Is_Constrained
(Etype
(F
))
3896 and then (Needs_Finalization
(Etype
(F
))
3897 or else Has_Task
(Etype
(F
)))
3899 Establish_Transient_Scope
(A
, Manage_Sec_Stack
=> False);
3900 Resolve
(A
, Etype
(F
));
3902 -- A small optimization: if one of the actuals is a concatenation
3903 -- create a block around a procedure call to recover stack space.
3904 -- This alleviates stack usage when several procedure calls in
3905 -- the same statement list use concatenation. We do not perform
3906 -- this wrapping for code statements, where the argument is a
3907 -- static string, and we want to preserve warnings involving
3908 -- sequences of such statements.
3910 elsif Expander_Active
3911 and then Nkind
(A
) = N_Op_Concat
3912 and then Nkind
(N
) = N_Procedure_Call_Statement
3913 and then not (Is_Intrinsic_Subprogram
(Nam
)
3914 and then Chars
(Nam
) = Name_Asm
)
3915 and then not Static_Concatenation
(A
)
3917 Establish_Transient_Scope
(A
, Manage_Sec_Stack
=> False);
3918 Resolve
(A
, Etype
(F
));
3921 if Nkind
(A
) = N_Type_Conversion
3922 and then Is_Array_Type
(Etype
(F
))
3923 and then not Same_Ancestor
(Etype
(F
), Etype
(Expression
(A
)))
3925 (Is_Limited_Type
(Etype
(F
))
3926 or else Is_Limited_Type
(Etype
(Expression
(A
))))
3929 ("conversion between unrelated limited array types not "
3930 & "allowed ('A'I-00246)", A
);
3932 if Is_Limited_Type
(Etype
(F
)) then
3933 Explain_Limited_Type
(Etype
(F
), A
);
3936 if Is_Limited_Type
(Etype
(Expression
(A
))) then
3937 Explain_Limited_Type
(Etype
(Expression
(A
)), A
);
3941 -- (Ada 2005: AI-251): If the actual is an allocator whose
3942 -- directly designated type is a class-wide interface, we build
3943 -- an anonymous access type to use it as the type of the
3944 -- allocator. Later, when the subprogram call is expanded, if
3945 -- the interface has a secondary dispatch table the expander
3946 -- will add a type conversion to force the correct displacement
3949 if Nkind
(A
) = N_Allocator
then
3951 DDT
: constant Entity_Id
:=
3952 Directly_Designated_Type
(Base_Type
(Etype
(F
)));
3954 New_Itype
: Entity_Id
;
3957 if Is_Class_Wide_Type
(DDT
)
3958 and then Is_Interface
(DDT
)
3960 New_Itype
:= Create_Itype
(E_Anonymous_Access_Type
, A
);
3961 Set_Etype
(New_Itype
, Etype
(A
));
3962 Set_Directly_Designated_Type
3963 (New_Itype
, Directly_Designated_Type
(Etype
(A
)));
3964 Set_Etype
(A
, New_Itype
);
3967 -- Ada 2005, AI-162:If the actual is an allocator, the
3968 -- innermost enclosing statement is the master of the
3969 -- created object. This needs to be done with expansion
3970 -- enabled only, otherwise the transient scope will not
3971 -- be removed in the expansion of the wrapped construct.
3974 and then (Needs_Finalization
(DDT
)
3975 or else Has_Task
(DDT
))
3977 Establish_Transient_Scope
3978 (A
, Manage_Sec_Stack
=> False);
3982 if Ekind
(Etype
(F
)) = E_Anonymous_Access_Type
then
3983 Check_Restriction
(No_Access_Parameter_Allocators
, A
);
3987 -- (Ada 2005): The call may be to a primitive operation of a
3988 -- tagged synchronized type, declared outside of the type. In
3989 -- this case the controlling actual must be converted to its
3990 -- corresponding record type, which is the formal type. The
3991 -- actual may be a subtype, either because of a constraint or
3992 -- because it is a generic actual, so use base type to locate
3995 F_Typ
:= Base_Type
(Etype
(F
));
3997 if Is_Tagged_Type
(F_Typ
)
3998 and then (Is_Concurrent_Type
(F_Typ
)
3999 or else Is_Concurrent_Record_Type
(F_Typ
))
4001 -- If the actual is overloaded, look for an interpretation
4002 -- that has a synchronized type.
4004 if not Is_Overloaded
(A
) then
4005 A_Typ
:= Base_Type
(Etype
(A
));
4009 Index
: Interp_Index
;
4013 Get_First_Interp
(A
, Index
, It
);
4014 while Present
(It
.Typ
) loop
4015 if Is_Concurrent_Type
(It
.Typ
)
4016 or else Is_Concurrent_Record_Type
(It
.Typ
)
4018 A_Typ
:= Base_Type
(It
.Typ
);
4022 Get_Next_Interp
(Index
, It
);
4028 Full_A_Typ
: Entity_Id
;
4031 if Present
(Full_View
(A_Typ
)) then
4032 Full_A_Typ
:= Base_Type
(Full_View
(A_Typ
));
4034 Full_A_Typ
:= A_Typ
;
4037 -- Tagged synchronized type (case 1): the actual is a
4040 if Is_Concurrent_Type
(A_Typ
)
4041 and then Corresponding_Record_Type
(A_Typ
) = F_Typ
4044 Unchecked_Convert_To
4045 (Corresponding_Record_Type
(A_Typ
), A
));
4046 Resolve
(A
, Etype
(F
));
4048 -- Tagged synchronized type (case 2): the formal is a
4051 elsif Ekind
(Full_A_Typ
) = E_Record_Type
4053 (Corresponding_Concurrent_Type
(Full_A_Typ
))
4054 and then Is_Concurrent_Type
(F_Typ
)
4055 and then Present
(Corresponding_Record_Type
(F_Typ
))
4056 and then Full_A_Typ
= Corresponding_Record_Type
(F_Typ
)
4058 Resolve
(A
, Corresponding_Record_Type
(F_Typ
));
4063 Resolve
(A
, Etype
(F
));
4067 -- Not a synchronized operation
4070 Resolve
(A
, Etype
(F
));
4077 -- An actual cannot be an untagged formal incomplete type
4079 if Ekind
(A_Typ
) = E_Incomplete_Type
4080 and then not Is_Tagged_Type
(A_Typ
)
4081 and then Is_Generic_Type
(A_Typ
)
4084 ("invalid use of untagged formal incomplete type", A
);
4087 if Comes_From_Source
(Original_Node
(N
))
4088 and then Nkind_In
(Original_Node
(N
), N_Function_Call
,
4089 N_Procedure_Call_Statement
)
4091 -- In formal mode, check that actual parameters matching
4092 -- formals of tagged types are objects (or ancestor type
4093 -- conversions of objects), not general expressions.
4095 if Is_Actual_Tagged_Parameter
(A
) then
4096 if Is_SPARK_05_Object_Reference
(A
) then
4099 elsif Nkind
(A
) = N_Type_Conversion
then
4101 Operand
: constant Node_Id
:= Expression
(A
);
4102 Operand_Typ
: constant Entity_Id
:= Etype
(Operand
);
4103 Target_Typ
: constant Entity_Id
:= A_Typ
;
4106 if not Is_SPARK_05_Object_Reference
(Operand
) then
4107 Check_SPARK_05_Restriction
4108 ("object required", Operand
);
4110 -- In formal mode, the only view conversions are those
4111 -- involving ancestor conversion of an extended type.
4114 (Is_Tagged_Type
(Target_Typ
)
4115 and then not Is_Class_Wide_Type
(Target_Typ
)
4116 and then Is_Tagged_Type
(Operand_Typ
)
4117 and then not Is_Class_Wide_Type
(Operand_Typ
)
4118 and then Is_Ancestor
(Target_Typ
, Operand_Typ
))
4121 (F
, E_Out_Parameter
, E_In_Out_Parameter
)
4123 Check_SPARK_05_Restriction
4124 ("ancestor conversion is the only permitted "
4125 & "view conversion", A
);
4127 Check_SPARK_05_Restriction
4128 ("ancestor conversion required", A
);
4137 Check_SPARK_05_Restriction
("object required", A
);
4140 -- In formal mode, the only view conversions are those
4141 -- involving ancestor conversion of an extended type.
4143 elsif Nkind
(A
) = N_Type_Conversion
4144 and then Ekind_In
(F
, E_Out_Parameter
, E_In_Out_Parameter
)
4146 Check_SPARK_05_Restriction
4147 ("ancestor conversion is the only permitted view "
4152 -- has warnings suppressed, then we reset Never_Set_In_Source for
4153 -- the calling entity. The reason for this is to catch cases like
4154 -- GNAT.Spitbol.Patterns.Vstring_Var where the called subprogram
4155 -- uses trickery to modify an IN parameter.
4157 if Ekind
(F
) = E_In_Parameter
4158 and then Is_Entity_Name
(A
)
4159 and then Present
(Entity
(A
))
4160 and then Ekind
(Entity
(A
)) = E_Variable
4161 and then Has_Warnings_Off
(F_Typ
)
4163 Set_Never_Set_In_Source
(Entity
(A
), False);
4166 -- Perform error checks for IN and IN OUT parameters
4168 if Ekind
(F
) /= E_Out_Parameter
then
4170 -- Check unset reference. For scalar parameters, it is clearly
4171 -- wrong to pass an uninitialized value as either an IN or
4172 -- IN-OUT parameter. For composites, it is also clearly an
4173 -- error to pass a completely uninitialized value as an IN
4174 -- parameter, but the case of IN OUT is trickier. We prefer
4175 -- not to give a warning here. For example, suppose there is
4176 -- a routine that sets some component of a record to False.
4177 -- It is perfectly reasonable to make this IN-OUT and allow
4178 -- either initialized or uninitialized records to be passed
4181 -- For partially initialized composite values, we also avoid
4182 -- warnings, since it is quite likely that we are passing a
4183 -- partially initialized value and only the initialized fields
4184 -- will in fact be read in the subprogram.
4186 if Is_Scalar_Type
(A_Typ
)
4187 or else (Ekind
(F
) = E_In_Parameter
4188 and then not Is_Partially_Initialized_Type
(A_Typ
))
4190 Check_Unset_Reference
(A
);
4193 -- In Ada 83 we cannot pass an OUT parameter as an IN or IN OUT
4194 -- actual to a nested call, since this constitutes a reading of
4195 -- the parameter, which is not allowed.
4197 if Ada_Version
= Ada_83
4198 and then Is_Entity_Name
(A
)
4199 and then Ekind
(Entity
(A
)) = E_Out_Parameter
4201 Error_Msg_N
("(Ada 83) illegal reading of out parameter", A
);
4205 -- In -gnatd.q mode, forget that a given array is constant when
4206 -- it is passed as an IN parameter to a foreign-convention
4207 -- subprogram. This is in case the subprogram evilly modifies the
4208 -- object. Of course, correct code would use IN OUT.
4211 and then Ekind
(F
) = E_In_Parameter
4212 and then Has_Foreign_Convention
(Nam
)
4213 and then Is_Array_Type
(F_Typ
)
4214 and then Nkind
(A
) in N_Has_Entity
4215 and then Present
(Entity
(A
))
4217 Set_Is_True_Constant
(Entity
(A
), False);
4220 -- Case of OUT or IN OUT parameter
4222 if Ekind
(F
) /= E_In_Parameter
then
4224 -- For an Out parameter, check for useless assignment. Note
4225 -- that we can't set Last_Assignment this early, because we may
4226 -- kill current values in Resolve_Call, and that call would
4227 -- clobber the Last_Assignment field.
4229 -- Note: call Warn_On_Useless_Assignment before doing the check
4230 -- below for Is_OK_Variable_For_Out_Formal so that the setting
4231 -- of Referenced_As_LHS/Referenced_As_Out_Formal properly
4232 -- reflects the last assignment, not this one.
4234 if Ekind
(F
) = E_Out_Parameter
then
4235 if Warn_On_Modified_As_Out_Parameter
(F
)
4236 and then Is_Entity_Name
(A
)
4237 and then Present
(Entity
(A
))
4238 and then Comes_From_Source
(N
)
4240 Warn_On_Useless_Assignment
(Entity
(A
), A
);
4244 -- Validate the form of the actual. Note that the call to
4245 -- Is_OK_Variable_For_Out_Formal generates the required
4246 -- reference in this case.
4248 -- A call to an initialization procedure for an aggregate
4249 -- component may initialize a nested component of a constant
4250 -- designated object. In this context the object is variable.
4252 if not Is_OK_Variable_For_Out_Formal
(A
)
4253 and then not Is_Init_Proc
(Nam
)
4255 Error_Msg_NE
("actual for& must be a variable", A
, F
);
4257 if Is_Subprogram
(Current_Scope
) then
4258 if Is_Invariant_Procedure
(Current_Scope
)
4259 or else Is_Partial_Invariant_Procedure
(Current_Scope
)
4262 ("function used in invariant cannot modify its "
4265 elsif Is_Predicate_Function
(Current_Scope
) then
4267 ("function used in predicate cannot modify its "
4273 -- What's the following about???
4275 if Is_Entity_Name
(A
) then
4276 Kill_Checks
(Entity
(A
));
4282 if Etype
(A
) = Any_Type
then
4283 Set_Etype
(N
, Any_Type
);
4287 -- Apply appropriate constraint/predicate checks for IN [OUT] case
4289 if Ekind_In
(F
, E_In_Parameter
, E_In_Out_Parameter
) then
4291 -- Apply predicate tests except in certain special cases. Note
4292 -- that it might be more consistent to apply these only when
4293 -- expansion is active (in Exp_Ch6.Expand_Actuals), as we do
4294 -- for the outbound predicate tests ??? In any case indicate
4295 -- the function being called, for better warnings if the call
4296 -- leads to an infinite recursion.
4298 if Predicate_Tests_On_Arguments
(Nam
) then
4299 Apply_Predicate_Check
(A
, F_Typ
, Nam
);
4302 -- Apply required constraint checks
4304 -- Gigi looks at the check flag and uses the appropriate types.
4305 -- For now since one flag is used there is an optimization
4306 -- which might not be done in the IN OUT case since Gigi does
4307 -- not do any analysis. More thought required about this ???
4309 -- In fact is this comment obsolete??? doesn't the expander now
4310 -- generate all these tests anyway???
4312 if Is_Scalar_Type
(Etype
(A
)) then
4313 Apply_Scalar_Range_Check
(A
, F_Typ
);
4315 elsif Is_Array_Type
(Etype
(A
)) then
4316 Apply_Length_Check
(A
, F_Typ
);
4318 elsif Is_Record_Type
(F_Typ
)
4319 and then Has_Discriminants
(F_Typ
)
4320 and then Is_Constrained
(F_Typ
)
4321 and then (not Is_Derived_Type
(F_Typ
)
4322 or else Comes_From_Source
(Nam
))
4324 Apply_Discriminant_Check
(A
, F_Typ
);
4326 -- For view conversions of a discriminated object, apply
4327 -- check to object itself, the conversion alreay has the
4330 if Nkind
(A
) = N_Type_Conversion
4331 and then Is_Constrained
(Etype
(Expression
(A
)))
4333 Apply_Discriminant_Check
(Expression
(A
), F_Typ
);
4336 elsif Is_Access_Type
(F_Typ
)
4337 and then Is_Array_Type
(Designated_Type
(F_Typ
))
4338 and then Is_Constrained
(Designated_Type
(F_Typ
))
4340 Apply_Length_Check
(A
, F_Typ
);
4342 elsif Is_Access_Type
(F_Typ
)
4343 and then Has_Discriminants
(Designated_Type
(F_Typ
))
4344 and then Is_Constrained
(Designated_Type
(F_Typ
))
4346 Apply_Discriminant_Check
(A
, F_Typ
);
4349 Apply_Range_Check
(A
, F_Typ
);
4352 -- Ada 2005 (AI-231): Note that the controlling parameter case
4353 -- already existed in Ada 95, which is partially checked
4354 -- elsewhere (see Checks), and we don't want the warning
4355 -- message to differ.
4357 if Is_Access_Type
(F_Typ
)
4358 and then Can_Never_Be_Null
(F_Typ
)
4359 and then Known_Null
(A
)
4361 if Is_Controlling_Formal
(F
) then
4362 Apply_Compile_Time_Constraint_Error
4364 Msg
=> "null value not allowed here??",
4365 Reason
=> CE_Access_Check_Failed
);
4367 elsif Ada_Version
>= Ada_2005
then
4368 Apply_Compile_Time_Constraint_Error
4370 Msg
=> "(Ada 2005) null not allowed in "
4371 & "null-excluding formal??",
4372 Reason
=> CE_Null_Not_Allowed
);
4377 -- Checks for OUT parameters and IN OUT parameters
4379 if Ekind_In
(F
, E_Out_Parameter
, E_In_Out_Parameter
) then
4381 -- If there is a type conversion, make sure the return value
4382 -- meets the constraints of the variable before the conversion.
4384 if Nkind
(A
) = N_Type_Conversion
then
4385 if Is_Scalar_Type
(A_Typ
) then
4386 Apply_Scalar_Range_Check
4387 (Expression
(A
), Etype
(Expression
(A
)), A_Typ
);
4389 -- In addition, the returned value of the parameter must
4390 -- satisfy the bounds of the object type (see comment
4393 Apply_Scalar_Range_Check
(A
, A_Typ
, F_Typ
);
4397 (Expression
(A
), Etype
(Expression
(A
)), A_Typ
);
4400 -- If no conversion, apply scalar range checks and length check
4401 -- based on the subtype of the actual (NOT that of the formal).
4402 -- This indicates that the check takes place on return from the
4403 -- call. During expansion the required constraint checks are
4404 -- inserted. In GNATprove mode, in the absence of expansion,
4405 -- the flag indicates that the returned value is valid.
4408 if Is_Scalar_Type
(F_Typ
) then
4409 Apply_Scalar_Range_Check
(A
, A_Typ
, F_Typ
);
4411 elsif Is_Array_Type
(F_Typ
)
4412 and then Ekind
(F
) = E_Out_Parameter
4414 Apply_Length_Check
(A
, F_Typ
);
4416 Apply_Range_Check
(A
, A_Typ
, F_Typ
);
4420 -- Note: we do not apply the predicate checks for the case of
4421 -- OUT and IN OUT parameters. They are instead applied in the
4422 -- Expand_Actuals routine in Exp_Ch6.
4425 -- An actual associated with an access parameter is implicitly
4426 -- converted to the anonymous access type of the formal and must
4427 -- satisfy the legality checks for access conversions.
4429 if Ekind
(F_Typ
) = E_Anonymous_Access_Type
then
4430 if not Valid_Conversion
(A
, F_Typ
, A
) then
4432 ("invalid implicit conversion for access parameter", A
);
4435 -- If the actual is an access selected component of a variable,
4436 -- the call may modify its designated object. It is reasonable
4437 -- to treat this as a potential modification of the enclosing
4438 -- record, to prevent spurious warnings that it should be
4439 -- declared as a constant, because intuitively programmers
4440 -- regard the designated subcomponent as part of the record.
4442 if Nkind
(A
) = N_Selected_Component
4443 and then Is_Entity_Name
(Prefix
(A
))
4444 and then not Is_Constant_Object
(Entity
(Prefix
(A
)))
4446 Note_Possible_Modification
(A
, Sure
=> False);
4450 -- Check bad case of atomic/volatile argument (RM C.6(12))
4452 if Is_By_Reference_Type
(Etype
(F
))
4453 and then Comes_From_Source
(N
)
4455 if Is_Atomic_Object
(A
)
4456 and then not Is_Atomic
(Etype
(F
))
4459 ("cannot pass atomic argument to non-atomic formal&",
4462 elsif Is_Volatile_Object
(A
)
4463 and then not Is_Volatile
(Etype
(F
))
4466 ("cannot pass volatile argument to non-volatile formal&",
4471 -- Check that subprograms don't have improper controlling
4472 -- arguments (RM 3.9.2 (9)).
4474 -- A primitive operation may have an access parameter of an
4475 -- incomplete tagged type, but a dispatching call is illegal
4476 -- if the type is still incomplete.
4478 if Is_Controlling_Formal
(F
) then
4479 Set_Is_Controlling_Actual
(A
);
4481 if Ekind
(Etype
(F
)) = E_Anonymous_Access_Type
then
4483 Desig
: constant Entity_Id
:= Designated_Type
(Etype
(F
));
4485 if Ekind
(Desig
) = E_Incomplete_Type
4486 and then No
(Full_View
(Desig
))
4487 and then No
(Non_Limited_View
(Desig
))
4490 ("premature use of incomplete type& "
4491 & "in dispatching call", A
, Desig
);
4496 elsif Nkind
(A
) = N_Explicit_Dereference
then
4497 Validate_Remote_Access_To_Class_Wide_Type
(A
);
4500 -- Apply legality rule 3.9.2 (9/1)
4502 if (Is_Class_Wide_Type
(A_Typ
) or else Is_Dynamically_Tagged
(A
))
4503 and then not Is_Class_Wide_Type
(F_Typ
)
4504 and then not Is_Controlling_Formal
(F
)
4505 and then not In_Instance
4507 Error_Msg_N
("class-wide argument not allowed here!", A
);
4509 if Is_Subprogram
(Nam
) and then Comes_From_Source
(Nam
) then
4510 Error_Msg_Node_2
:= F_Typ
;
4512 ("& is not a dispatching operation of &!", A
, Nam
);
4515 -- Apply the checks described in 3.10.2(27): if the context is a
4516 -- specific access-to-object, the actual cannot be class-wide.
4517 -- Use base type to exclude access_to_subprogram cases.
4519 elsif Is_Access_Type
(A_Typ
)
4520 and then Is_Access_Type
(F_Typ
)
4521 and then not Is_Access_Subprogram_Type
(Base_Type
(F_Typ
))
4522 and then (Is_Class_Wide_Type
(Designated_Type
(A_Typ
))
4523 or else (Nkind
(A
) = N_Attribute_Reference
4525 Is_Class_Wide_Type
(Etype
(Prefix
(A
)))))
4526 and then not Is_Class_Wide_Type
(Designated_Type
(F_Typ
))
4527 and then not Is_Controlling_Formal
(F
)
4529 -- Disable these checks for call to imported C++ subprograms
4532 (Is_Entity_Name
(Name
(N
))
4533 and then Is_Imported
(Entity
(Name
(N
)))
4534 and then Convention
(Entity
(Name
(N
))) = Convention_CPP
)
4537 ("access to class-wide argument not allowed here!", A
);
4539 if Is_Subprogram
(Nam
) and then Comes_From_Source
(Nam
) then
4540 Error_Msg_Node_2
:= Designated_Type
(F_Typ
);
4542 ("& is not a dispatching operation of &!", A
, Nam
);
4546 Check_Aliased_Parameter
;
4550 -- If it is a named association, treat the selector_name as a
4551 -- proper identifier, and mark the corresponding entity.
4553 if Nkind
(Parent
(A
)) = N_Parameter_Association
4555 -- Ignore reference in SPARK mode, as it refers to an entity not
4556 -- in scope at the point of reference, so the reference should
4557 -- be ignored for computing effects of subprograms.
4559 and then not GNATprove_Mode
4561 -- If subprogram is overridden, use name of formal that
4564 if Present
(Real_Subp
) then
4565 Set_Entity
(Selector_Name
(Parent
(A
)), Real_F
);
4566 Set_Etype
(Selector_Name
(Parent
(A
)), Etype
(Real_F
));
4569 Set_Entity
(Selector_Name
(Parent
(A
)), F
);
4570 Generate_Reference
(F
, Selector_Name
(Parent
(A
)));
4571 Set_Etype
(Selector_Name
(Parent
(A
)), F_Typ
);
4572 Generate_Reference
(F_Typ
, N
, ' ');
4578 if Ekind
(F
) /= E_Out_Parameter
then
4579 Check_Unset_Reference
(A
);
4582 -- The following checks are only relevant when SPARK_Mode is on as
4583 -- they are not standard Ada legality rule. Internally generated
4584 -- temporaries are ignored.
4586 if SPARK_Mode
= On
and then Comes_From_Source
(A
) then
4588 -- An effectively volatile object may act as an actual when the
4589 -- corresponding formal is of a non-scalar effectively volatile
4590 -- type (SPARK RM 7.1.3(11)).
4592 if not Is_Scalar_Type
(Etype
(F
))
4593 and then Is_Effectively_Volatile
(Etype
(F
))
4597 -- An effectively volatile object may act as an actual in a
4598 -- call to an instance of Unchecked_Conversion.
4599 -- (SPARK RM 7.1.3(11)).
4601 elsif Is_Unchecked_Conversion_Instance
(Nam
) then
4604 -- The actual denotes an object
4606 elsif Is_Effectively_Volatile_Object
(A
) then
4608 ("volatile object cannot act as actual in a call (SPARK "
4609 & "RM 7.1.3(11))", A
);
4611 -- Otherwise the actual denotes an expression. Inspect the
4612 -- expression and flag each effectively volatile object with
4613 -- enabled property Async_Writers or Effective_Reads as illegal
4614 -- because it apprears within an interfering context. Note that
4615 -- this is usually done in Resolve_Entity_Name, but when the
4616 -- effectively volatile object appears as an actual in a call,
4617 -- the call must be resolved first.
4620 Flag_Effectively_Volatile_Objects
(A
);
4623 -- An effectively volatile variable cannot act as an actual
4624 -- parameter in a procedure call when the variable has enabled
4625 -- property Effective_Reads and the corresponding formal is of
4626 -- mode IN (SPARK RM 7.1.3(10)).
4628 if Ekind
(Nam
) = E_Procedure
4629 and then Ekind
(F
) = E_In_Parameter
4630 and then Is_Entity_Name
(A
)
4634 if Ekind
(A_Id
) = E_Variable
4635 and then Is_Effectively_Volatile
(Etype
(A_Id
))
4636 and then Effective_Reads_Enabled
(A_Id
)
4639 ("effectively volatile variable & cannot appear as "
4640 & "actual in procedure call", A
, A_Id
);
4642 Error_Msg_Name_1
:= Name_Effective_Reads
;
4643 Error_Msg_N
("\\variable has enabled property %", A
);
4644 Error_Msg_N
("\\corresponding formal has mode IN", A
);
4649 -- A formal parameter of a specific tagged type whose related
4650 -- subprogram is subject to pragma Extensions_Visible with value
4651 -- "False" cannot act as an actual in a subprogram with value
4652 -- "True" (SPARK RM 6.1.7(3)).
4654 if Is_EVF_Expression
(A
)
4655 and then Extensions_Visible_Status
(Nam
) =
4656 Extensions_Visible_True
4659 ("formal parameter cannot act as actual parameter when "
4660 & "Extensions_Visible is False", A
);
4662 ("\subprogram & has Extensions_Visible True", A
, Nam
);
4665 -- The actual parameter of a Ghost subprogram whose formal is of
4666 -- mode IN OUT or OUT must be a Ghost variable (SPARK RM 6.9(12)).
4668 if Comes_From_Source
(Nam
)
4669 and then Is_Ghost_Entity
(Nam
)
4670 and then Ekind_In
(F
, E_In_Out_Parameter
, E_Out_Parameter
)
4671 and then Is_Entity_Name
(A
)
4672 and then Present
(Entity
(A
))
4673 and then not Is_Ghost_Entity
(Entity
(A
))
4676 ("non-ghost variable & cannot appear as actual in call to "
4677 & "ghost procedure", A
, Entity
(A
));
4679 if Ekind
(F
) = E_In_Out_Parameter
then
4680 Error_Msg_N
("\corresponding formal has mode `IN OUT`", A
);
4682 Error_Msg_N
("\corresponding formal has mode OUT", A
);
4688 -- Case where actual is not present
4696 if Present
(Real_Subp
) then
4697 Next_Formal
(Real_F
);
4700 end Resolve_Actuals
;
4702 -----------------------
4703 -- Resolve_Allocator --
4704 -----------------------
4706 procedure Resolve_Allocator
(N
: Node_Id
; Typ
: Entity_Id
) is
4707 Desig_T
: constant Entity_Id
:= Designated_Type
(Typ
);
4708 E
: constant Node_Id
:= Expression
(N
);
4710 Discrim
: Entity_Id
;
4713 Assoc
: Node_Id
:= Empty
;
4716 procedure Check_Allocator_Discrim_Accessibility
4717 (Disc_Exp
: Node_Id
;
4718 Alloc_Typ
: Entity_Id
);
4719 -- Check that accessibility level associated with an access discriminant
4720 -- initialized in an allocator by the expression Disc_Exp is not deeper
4721 -- than the level of the allocator type Alloc_Typ. An error message is
4722 -- issued if this condition is violated. Specialized checks are done for
4723 -- the cases of a constraint expression which is an access attribute or
4724 -- an access discriminant.
4726 function In_Dispatching_Context
return Boolean;
4727 -- If the allocator is an actual in a call, it is allowed to be class-
4728 -- wide when the context is not because it is a controlling actual.
4730 -------------------------------------------
4731 -- Check_Allocator_Discrim_Accessibility --
4732 -------------------------------------------
4734 procedure Check_Allocator_Discrim_Accessibility
4735 (Disc_Exp
: Node_Id
;
4736 Alloc_Typ
: Entity_Id
)
4739 if Type_Access_Level
(Etype
(Disc_Exp
)) >
4740 Deepest_Type_Access_Level
(Alloc_Typ
)
4743 ("operand type has deeper level than allocator type", Disc_Exp
);
4745 -- When the expression is an Access attribute the level of the prefix
4746 -- object must not be deeper than that of the allocator's type.
4748 elsif Nkind
(Disc_Exp
) = N_Attribute_Reference
4749 and then Get_Attribute_Id
(Attribute_Name
(Disc_Exp
)) =
4751 and then Object_Access_Level
(Prefix
(Disc_Exp
)) >
4752 Deepest_Type_Access_Level
(Alloc_Typ
)
4755 ("prefix of attribute has deeper level than allocator type",
4758 -- When the expression is an access discriminant the check is against
4759 -- the level of the prefix object.
4761 elsif Ekind
(Etype
(Disc_Exp
)) = E_Anonymous_Access_Type
4762 and then Nkind
(Disc_Exp
) = N_Selected_Component
4763 and then Object_Access_Level
(Prefix
(Disc_Exp
)) >
4764 Deepest_Type_Access_Level
(Alloc_Typ
)
4767 ("access discriminant has deeper level than allocator type",
4770 -- All other cases are legal
4775 end Check_Allocator_Discrim_Accessibility
;
4777 ----------------------------
4778 -- In_Dispatching_Context --
4779 ----------------------------
4781 function In_Dispatching_Context
return Boolean is
4782 Par
: constant Node_Id
:= Parent
(N
);
4785 return Nkind
(Par
) in N_Subprogram_Call
4786 and then Is_Entity_Name
(Name
(Par
))
4787 and then Is_Dispatching_Operation
(Entity
(Name
(Par
)));
4788 end In_Dispatching_Context
;
4790 -- Start of processing for Resolve_Allocator
4793 -- Replace general access with specific type
4795 if Ekind
(Etype
(N
)) = E_Allocator_Type
then
4796 Set_Etype
(N
, Base_Type
(Typ
));
4799 if Is_Abstract_Type
(Typ
) then
4800 Error_Msg_N
("type of allocator cannot be abstract", N
);
4803 -- For qualified expression, resolve the expression using the given
4804 -- subtype (nothing to do for type mark, subtype indication)
4806 if Nkind
(E
) = N_Qualified_Expression
then
4807 if Is_Class_Wide_Type
(Etype
(E
))
4808 and then not Is_Class_Wide_Type
(Desig_T
)
4809 and then not In_Dispatching_Context
4812 ("class-wide allocator not allowed for this access type", N
);
4815 Resolve
(Expression
(E
), Etype
(E
));
4816 Check_Non_Static_Context
(Expression
(E
));
4817 Check_Unset_Reference
(Expression
(E
));
4819 -- Allocators generated by the build-in-place expansion mechanism
4820 -- are explicitly marked as coming from source but do not need to be
4821 -- checked for limited initialization. To exclude this case, ensure
4822 -- that the parent of the allocator is a source node.
4823 -- The return statement constructed for an Expression_Function does
4824 -- not come from source but requires a limited check.
4826 if Is_Limited_Type
(Etype
(E
))
4827 and then Comes_From_Source
(N
)
4829 (Comes_From_Source
(Parent
(N
))
4831 (Ekind
(Current_Scope
) = E_Function
4832 and then Nkind
(Original_Node
(Unit_Declaration_Node
4833 (Current_Scope
))) = N_Expression_Function
))
4834 and then not In_Instance_Body
4836 if not OK_For_Limited_Init
(Etype
(E
), Expression
(E
)) then
4837 if Nkind
(Parent
(N
)) = N_Assignment_Statement
then
4839 ("illegal expression for initialized allocator of a "
4840 & "limited type (RM 7.5 (2.7/2))", N
);
4843 ("initialization not allowed for limited types", N
);
4846 Explain_Limited_Type
(Etype
(E
), N
);
4850 -- A qualified expression requires an exact match of the type. Class-
4851 -- wide matching is not allowed.
4853 if (Is_Class_Wide_Type
(Etype
(Expression
(E
)))
4854 or else Is_Class_Wide_Type
(Etype
(E
)))
4855 and then Base_Type
(Etype
(Expression
(E
))) /= Base_Type
(Etype
(E
))
4857 Wrong_Type
(Expression
(E
), Etype
(E
));
4860 -- Calls to build-in-place functions are not currently supported in
4861 -- allocators for access types associated with a simple storage pool.
4862 -- Supporting such allocators may require passing additional implicit
4863 -- parameters to build-in-place functions (or a significant revision
4864 -- of the current b-i-p implementation to unify the handling for
4865 -- multiple kinds of storage pools). ???
4867 if Is_Limited_View
(Desig_T
)
4868 and then Nkind
(Expression
(E
)) = N_Function_Call
4871 Pool
: constant Entity_Id
:=
4872 Associated_Storage_Pool
(Root_Type
(Typ
));
4876 Present
(Get_Rep_Pragma
4877 (Etype
(Pool
), Name_Simple_Storage_Pool_Type
))
4880 ("limited function calls not yet supported in simple "
4881 & "storage pool allocators", Expression
(E
));
4886 -- A special accessibility check is needed for allocators that
4887 -- constrain access discriminants. The level of the type of the
4888 -- expression used to constrain an access discriminant cannot be
4889 -- deeper than the type of the allocator (in contrast to access
4890 -- parameters, where the level of the actual can be arbitrary).
4892 -- We can't use Valid_Conversion to perform this check because in
4893 -- general the type of the allocator is unrelated to the type of
4894 -- the access discriminant.
4896 if Ekind
(Typ
) /= E_Anonymous_Access_Type
4897 or else Is_Local_Anonymous_Access
(Typ
)
4899 Subtyp
:= Entity
(Subtype_Mark
(E
));
4901 Aggr
:= Original_Node
(Expression
(E
));
4903 if Has_Discriminants
(Subtyp
)
4904 and then Nkind_In
(Aggr
, N_Aggregate
, N_Extension_Aggregate
)
4906 Discrim
:= First_Discriminant
(Base_Type
(Subtyp
));
4908 -- Get the first component expression of the aggregate
4910 if Present
(Expressions
(Aggr
)) then
4911 Disc_Exp
:= First
(Expressions
(Aggr
));
4913 elsif Present
(Component_Associations
(Aggr
)) then
4914 Assoc
:= First
(Component_Associations
(Aggr
));
4916 if Present
(Assoc
) then
4917 Disc_Exp
:= Expression
(Assoc
);
4926 while Present
(Discrim
) and then Present
(Disc_Exp
) loop
4927 if Ekind
(Etype
(Discrim
)) = E_Anonymous_Access_Type
then
4928 Check_Allocator_Discrim_Accessibility
(Disc_Exp
, Typ
);
4931 Next_Discriminant
(Discrim
);
4933 if Present
(Discrim
) then
4934 if Present
(Assoc
) then
4936 Disc_Exp
:= Expression
(Assoc
);
4938 elsif Present
(Next
(Disc_Exp
)) then
4942 Assoc
:= First
(Component_Associations
(Aggr
));
4944 if Present
(Assoc
) then
4945 Disc_Exp
:= Expression
(Assoc
);
4955 -- For a subtype mark or subtype indication, freeze the subtype
4958 Freeze_Expression
(E
);
4960 if Is_Access_Constant
(Typ
) and then not No_Initialization
(N
) then
4962 ("initialization required for access-to-constant allocator", N
);
4965 -- A special accessibility check is needed for allocators that
4966 -- constrain access discriminants. The level of the type of the
4967 -- expression used to constrain an access discriminant cannot be
4968 -- deeper than the type of the allocator (in contrast to access
4969 -- parameters, where the level of the actual can be arbitrary).
4970 -- We can't use Valid_Conversion to perform this check because
4971 -- in general the type of the allocator is unrelated to the type
4972 -- of the access discriminant.
4974 if Nkind
(Original_Node
(E
)) = N_Subtype_Indication
4975 and then (Ekind
(Typ
) /= E_Anonymous_Access_Type
4976 or else Is_Local_Anonymous_Access
(Typ
))
4978 Subtyp
:= Entity
(Subtype_Mark
(Original_Node
(E
)));
4980 if Has_Discriminants
(Subtyp
) then
4981 Discrim
:= First_Discriminant
(Base_Type
(Subtyp
));
4982 Constr
:= First
(Constraints
(Constraint
(Original_Node
(E
))));
4983 while Present
(Discrim
) and then Present
(Constr
) loop
4984 if Ekind
(Etype
(Discrim
)) = E_Anonymous_Access_Type
then
4985 if Nkind
(Constr
) = N_Discriminant_Association
then
4986 Disc_Exp
:= Original_Node
(Expression
(Constr
));
4988 Disc_Exp
:= Original_Node
(Constr
);
4991 Check_Allocator_Discrim_Accessibility
(Disc_Exp
, Typ
);
4994 Next_Discriminant
(Discrim
);
5001 -- Ada 2005 (AI-344): A class-wide allocator requires an accessibility
5002 -- check that the level of the type of the created object is not deeper
5003 -- than the level of the allocator's access type, since extensions can
5004 -- now occur at deeper levels than their ancestor types. This is a
5005 -- static accessibility level check; a run-time check is also needed in
5006 -- the case of an initialized allocator with a class-wide argument (see
5007 -- Expand_Allocator_Expression).
5009 if Ada_Version
>= Ada_2005
5010 and then Is_Class_Wide_Type
(Desig_T
)
5013 Exp_Typ
: Entity_Id
;
5016 if Nkind
(E
) = N_Qualified_Expression
then
5017 Exp_Typ
:= Etype
(E
);
5018 elsif Nkind
(E
) = N_Subtype_Indication
then
5019 Exp_Typ
:= Entity
(Subtype_Mark
(Original_Node
(E
)));
5021 Exp_Typ
:= Entity
(E
);
5024 if Type_Access_Level
(Exp_Typ
) >
5025 Deepest_Type_Access_Level
(Typ
)
5027 if In_Instance_Body
then
5028 Error_Msg_Warn
:= SPARK_Mode
/= On
;
5030 ("type in allocator has deeper level than designated "
5031 & "class-wide type<<", E
);
5032 Error_Msg_N
("\Program_Error [<<", E
);
5035 Make_Raise_Program_Error
(Sloc
(N
),
5036 Reason
=> PE_Accessibility_Check_Failed
));
5039 -- Do not apply Ada 2005 accessibility checks on a class-wide
5040 -- allocator if the type given in the allocator is a formal
5041 -- type. A run-time check will be performed in the instance.
5043 elsif not Is_Generic_Type
(Exp_Typ
) then
5045 ("type in allocator has deeper level than designated "
5046 & "class-wide type", E
);
5052 -- Check for allocation from an empty storage pool. But do not complain
5053 -- if it's a return statement for a build-in-place function, because the
5054 -- allocator is there just in case the caller uses an allocator. If the
5055 -- caller does use an allocator, it will be caught at the call site.
5057 if No_Pool_Assigned
(Typ
)
5058 and then not Alloc_For_BIP_Return
(N
)
5060 Error_Msg_N
("allocation from empty storage pool!", N
);
5062 -- If the context is an unchecked conversion, as may happen within an
5063 -- inlined subprogram, the allocator is being resolved with its own
5064 -- anonymous type. In that case, if the target type has a specific
5065 -- storage pool, it must be inherited explicitly by the allocator type.
5067 elsif Nkind
(Parent
(N
)) = N_Unchecked_Type_Conversion
5068 and then No
(Associated_Storage_Pool
(Typ
))
5070 Set_Associated_Storage_Pool
5071 (Typ
, Associated_Storage_Pool
(Etype
(Parent
(N
))));
5074 if Ekind
(Etype
(N
)) = E_Anonymous_Access_Type
then
5075 Check_Restriction
(No_Anonymous_Allocators
, N
);
5078 -- Check that an allocator with task parts isn't for a nested access
5079 -- type when restriction No_Task_Hierarchy applies.
5081 if not Is_Library_Level_Entity
(Base_Type
(Typ
))
5082 and then Has_Task
(Base_Type
(Desig_T
))
5084 Check_Restriction
(No_Task_Hierarchy
, N
);
5087 -- An illegal allocator may be rewritten as a raise Program_Error
5090 if Nkind
(N
) = N_Allocator
then
5092 -- Avoid coextension processing for an allocator that is the
5093 -- expansion of a build-in-place function call.
5095 if Nkind
(Original_Node
(N
)) = N_Allocator
5096 and then Nkind
(Expression
(Original_Node
(N
))) =
5097 N_Qualified_Expression
5098 and then Nkind
(Expression
(Expression
(Original_Node
(N
)))) =
5100 and then Is_Expanded_Build_In_Place_Call
5101 (Expression
(Expression
(Original_Node
(N
))))
5103 null; -- b-i-p function call case
5106 -- An anonymous access discriminant is the definition of a
5109 if Ekind
(Typ
) = E_Anonymous_Access_Type
5110 and then Nkind
(Associated_Node_For_Itype
(Typ
)) =
5111 N_Discriminant_Specification
5114 Discr
: constant Entity_Id
:=
5115 Defining_Identifier
(Associated_Node_For_Itype
(Typ
));
5118 Check_Restriction
(No_Coextensions
, N
);
5120 -- Ada 2012 AI05-0052: If the designated type of the
5121 -- allocator is limited, then the allocator shall not
5122 -- be used to define the value of an access discriminant
5123 -- unless the discriminated type is immutably limited.
5125 if Ada_Version
>= Ada_2012
5126 and then Is_Limited_Type
(Desig_T
)
5127 and then not Is_Limited_View
(Scope
(Discr
))
5130 ("only immutably limited types can have anonymous "
5131 & "access discriminants designating a limited type",
5136 -- Avoid marking an allocator as a dynamic coextension if it is
5137 -- within a static construct.
5139 if not Is_Static_Coextension
(N
) then
5140 Set_Is_Dynamic_Coextension
(N
);
5142 -- Finalization and deallocation of coextensions utilizes an
5143 -- approximate implementation which does not directly adhere
5144 -- to the semantic rules. Warn on potential issues involving
5147 if Is_Controlled
(Desig_T
) then
5149 ("??coextension will not be finalized when its "
5150 & "associated owner is deallocated or finalized", N
);
5153 ("??coextension will not be deallocated when its "
5154 & "associated owner is deallocated", N
);
5158 -- Cleanup for potential static coextensions
5161 Set_Is_Dynamic_Coextension
(N
, False);
5162 Set_Is_Static_Coextension
(N
, False);
5164 -- Anonymous access-to-controlled objects are not finalized on
5165 -- time because this involves run-time ownership and currently
5166 -- this property is not available. In rare cases the object may
5167 -- not be finalized at all. Warn on potential issues involving
5168 -- anonymous access-to-controlled objects.
5170 if Ekind
(Typ
) = E_Anonymous_Access_Type
5171 and then Is_Controlled_Active
(Desig_T
)
5174 ("??object designated by anonymous access object might "
5175 & "not be finalized until its enclosing library unit "
5176 & "goes out of scope", N
);
5177 Error_Msg_N
("\use named access type instead", N
);
5183 -- Report a simple error: if the designated object is a local task,
5184 -- its body has not been seen yet, and its activation will fail an
5185 -- elaboration check.
5187 if Is_Task_Type
(Desig_T
)
5188 and then Scope
(Base_Type
(Desig_T
)) = Current_Scope
5189 and then Is_Compilation_Unit
(Current_Scope
)
5190 and then Ekind
(Current_Scope
) = E_Package
5191 and then not In_Package_Body
(Current_Scope
)
5193 Error_Msg_Warn
:= SPARK_Mode
/= On
;
5194 Error_Msg_N
("cannot activate task before body seen<<", N
);
5195 Error_Msg_N
("\Program_Error [<<", N
);
5198 -- Ada 2012 (AI05-0111-3): Detect an attempt to allocate a task or a
5199 -- type with a task component on a subpool. This action must raise
5200 -- Program_Error at runtime.
5202 if Ada_Version
>= Ada_2012
5203 and then Nkind
(N
) = N_Allocator
5204 and then Present
(Subpool_Handle_Name
(N
))
5205 and then Has_Task
(Desig_T
)
5207 Error_Msg_Warn
:= SPARK_Mode
/= On
;
5208 Error_Msg_N
("cannot allocate task on subpool<<", N
);
5209 Error_Msg_N
("\Program_Error [<<", N
);
5212 Make_Raise_Program_Error
(Sloc
(N
),
5213 Reason
=> PE_Explicit_Raise
));
5216 end Resolve_Allocator
;
5218 ---------------------------
5219 -- Resolve_Arithmetic_Op --
5220 ---------------------------
5222 -- Used for resolving all arithmetic operators except exponentiation
5224 procedure Resolve_Arithmetic_Op
(N
: Node_Id
; Typ
: Entity_Id
) is
5225 L
: constant Node_Id
:= Left_Opnd
(N
);
5226 R
: constant Node_Id
:= Right_Opnd
(N
);
5227 TL
: constant Entity_Id
:= Base_Type
(Etype
(L
));
5228 TR
: constant Entity_Id
:= Base_Type
(Etype
(R
));
5232 B_Typ
: constant Entity_Id
:= Base_Type
(Typ
);
5233 -- We do the resolution using the base type, because intermediate values
5234 -- in expressions always are of the base type, not a subtype of it.
5236 function Expected_Type_Is_Any_Real
(N
: Node_Id
) return Boolean;
5237 -- Returns True if N is in a context that expects "any real type"
5239 function Is_Integer_Or_Universal
(N
: Node_Id
) return Boolean;
5240 -- Return True iff given type is Integer or universal real/integer
5242 procedure Set_Mixed_Mode_Operand
(N
: Node_Id
; T
: Entity_Id
);
5243 -- Choose type of integer literal in fixed-point operation to conform
5244 -- to available fixed-point type. T is the type of the other operand,
5245 -- which is needed to determine the expected type of N.
5247 procedure Set_Operand_Type
(N
: Node_Id
);
5248 -- Set operand type to T if universal
5250 -------------------------------
5251 -- Expected_Type_Is_Any_Real --
5252 -------------------------------
5254 function Expected_Type_Is_Any_Real
(N
: Node_Id
) return Boolean is
5256 -- N is the expression after "delta" in a fixed_point_definition;
5259 return Nkind_In
(Parent
(N
), N_Ordinary_Fixed_Point_Definition
,
5260 N_Decimal_Fixed_Point_Definition
,
5262 -- N is one of the bounds in a real_range_specification;
5265 N_Real_Range_Specification
,
5267 -- N is the expression of a delta_constraint;
5270 N_Delta_Constraint
);
5271 end Expected_Type_Is_Any_Real
;
5273 -----------------------------
5274 -- Is_Integer_Or_Universal --
5275 -----------------------------
5277 function Is_Integer_Or_Universal
(N
: Node_Id
) return Boolean is
5279 Index
: Interp_Index
;
5283 if not Is_Overloaded
(N
) then
5285 return Base_Type
(T
) = Base_Type
(Standard_Integer
)
5286 or else T
= Universal_Integer
5287 or else T
= Universal_Real
;
5289 Get_First_Interp
(N
, Index
, It
);
5290 while Present
(It
.Typ
) loop
5291 if Base_Type
(It
.Typ
) = Base_Type
(Standard_Integer
)
5292 or else It
.Typ
= Universal_Integer
5293 or else It
.Typ
= Universal_Real
5298 Get_Next_Interp
(Index
, It
);
5303 end Is_Integer_Or_Universal
;
5305 ----------------------------
5306 -- Set_Mixed_Mode_Operand --
5307 ----------------------------
5309 procedure Set_Mixed_Mode_Operand
(N
: Node_Id
; T
: Entity_Id
) is
5310 Index
: Interp_Index
;
5314 if Universal_Interpretation
(N
) = Universal_Integer
then
5316 -- A universal integer literal is resolved as standard integer
5317 -- except in the case of a fixed-point result, where we leave it
5318 -- as universal (to be handled by Exp_Fixd later on)
5320 if Is_Fixed_Point_Type
(T
) then
5321 Resolve
(N
, Universal_Integer
);
5323 Resolve
(N
, Standard_Integer
);
5326 elsif Universal_Interpretation
(N
) = Universal_Real
5327 and then (T
= Base_Type
(Standard_Integer
)
5328 or else T
= Universal_Integer
5329 or else T
= Universal_Real
)
5331 -- A universal real can appear in a fixed-type context. We resolve
5332 -- the literal with that context, even though this might raise an
5333 -- exception prematurely (the other operand may be zero).
5337 elsif Etype
(N
) = Base_Type
(Standard_Integer
)
5338 and then T
= Universal_Real
5339 and then Is_Overloaded
(N
)
5341 -- Integer arg in mixed-mode operation. Resolve with universal
5342 -- type, in case preference rule must be applied.
5344 Resolve
(N
, Universal_Integer
);
5346 elsif Etype
(N
) = T
and then B_Typ
/= Universal_Fixed
then
5348 -- If the operand is part of a fixed multiplication operation,
5349 -- a conversion will be applied to each operand, so resolve it
5350 -- with its own type.
5352 if Nkind_In
(Parent
(N
), N_Op_Divide
, N_Op_Multiply
) then
5356 -- Not a mixed-mode operation, resolve with context
5361 elsif Etype
(N
) = Any_Fixed
then
5363 -- N may itself be a mixed-mode operation, so use context type
5367 elsif Is_Fixed_Point_Type
(T
)
5368 and then B_Typ
= Universal_Fixed
5369 and then Is_Overloaded
(N
)
5371 -- Must be (fixed * fixed) operation, operand must have one
5372 -- compatible interpretation.
5374 Resolve
(N
, Any_Fixed
);
5376 elsif Is_Fixed_Point_Type
(B_Typ
)
5377 and then (T
= Universal_Real
or else Is_Fixed_Point_Type
(T
))
5378 and then Is_Overloaded
(N
)
5380 -- C * F(X) in a fixed context, where C is a real literal or a
5381 -- fixed-point expression. F must have either a fixed type
5382 -- interpretation or an integer interpretation, but not both.
5384 Get_First_Interp
(N
, Index
, It
);
5385 while Present
(It
.Typ
) loop
5386 if Base_Type
(It
.Typ
) = Base_Type
(Standard_Integer
) then
5387 if Analyzed
(N
) then
5388 Error_Msg_N
("ambiguous operand in fixed operation", N
);
5390 Resolve
(N
, Standard_Integer
);
5393 elsif Is_Fixed_Point_Type
(It
.Typ
) then
5394 if Analyzed
(N
) then
5395 Error_Msg_N
("ambiguous operand in fixed operation", N
);
5397 Resolve
(N
, It
.Typ
);
5401 Get_Next_Interp
(Index
, It
);
5404 -- Reanalyze the literal with the fixed type of the context. If
5405 -- context is Universal_Fixed, we are within a conversion, leave
5406 -- the literal as a universal real because there is no usable
5407 -- fixed type, and the target of the conversion plays no role in
5421 if B_Typ
= Universal_Fixed
5422 and then Nkind
(Op2
) = N_Real_Literal
5424 T2
:= Universal_Real
;
5429 Set_Analyzed
(Op2
, False);
5433 -- A universal real conditional expression can appear in a fixed-type
5434 -- context and must be resolved with that context to facilitate the
5435 -- code generation in the back end.
5437 elsif Nkind_In
(N
, N_Case_Expression
, N_If_Expression
)
5438 and then Etype
(N
) = Universal_Real
5439 and then Is_Fixed_Point_Type
(B_Typ
)
5446 end Set_Mixed_Mode_Operand
;
5448 ----------------------
5449 -- Set_Operand_Type --
5450 ----------------------
5452 procedure Set_Operand_Type
(N
: Node_Id
) is
5454 if Etype
(N
) = Universal_Integer
5455 or else Etype
(N
) = Universal_Real
5459 end Set_Operand_Type
;
5461 -- Start of processing for Resolve_Arithmetic_Op
5464 if Comes_From_Source
(N
)
5465 and then Ekind
(Entity
(N
)) = E_Function
5466 and then Is_Imported
(Entity
(N
))
5467 and then Is_Intrinsic_Subprogram
(Entity
(N
))
5469 Resolve_Intrinsic_Operator
(N
, Typ
);
5472 -- Special-case for mixed-mode universal expressions or fixed point type
5473 -- operation: each argument is resolved separately. The same treatment
5474 -- is required if one of the operands of a fixed point operation is
5475 -- universal real, since in this case we don't do a conversion to a
5476 -- specific fixed-point type (instead the expander handles the case).
5478 -- Set the type of the node to its universal interpretation because
5479 -- legality checks on an exponentiation operand need the context.
5481 elsif (B_Typ
= Universal_Integer
or else B_Typ
= Universal_Real
)
5482 and then Present
(Universal_Interpretation
(L
))
5483 and then Present
(Universal_Interpretation
(R
))
5485 Set_Etype
(N
, B_Typ
);
5486 Resolve
(L
, Universal_Interpretation
(L
));
5487 Resolve
(R
, Universal_Interpretation
(R
));
5489 elsif (B_Typ
= Universal_Real
5490 or else Etype
(N
) = Universal_Fixed
5491 or else (Etype
(N
) = Any_Fixed
5492 and then Is_Fixed_Point_Type
(B_Typ
))
5493 or else (Is_Fixed_Point_Type
(B_Typ
)
5494 and then (Is_Integer_Or_Universal
(L
)
5496 Is_Integer_Or_Universal
(R
))))
5497 and then Nkind_In
(N
, N_Op_Multiply
, N_Op_Divide
)
5499 if TL
= Universal_Integer
or else TR
= Universal_Integer
then
5500 Check_For_Visible_Operator
(N
, B_Typ
);
5503 -- If context is a fixed type and one operand is integer, the other
5504 -- is resolved with the type of the context.
5506 if Is_Fixed_Point_Type
(B_Typ
)
5507 and then (Base_Type
(TL
) = Base_Type
(Standard_Integer
)
5508 or else TL
= Universal_Integer
)
5513 elsif Is_Fixed_Point_Type
(B_Typ
)
5514 and then (Base_Type
(TR
) = Base_Type
(Standard_Integer
)
5515 or else TR
= Universal_Integer
)
5520 -- If both operands are universal and the context is a floating
5521 -- point type, the operands are resolved to the type of the context.
5523 elsif Is_Floating_Point_Type
(B_Typ
) then
5528 Set_Mixed_Mode_Operand
(L
, TR
);
5529 Set_Mixed_Mode_Operand
(R
, TL
);
5532 -- Check the rule in RM05-4.5.5(19.1/2) disallowing universal_fixed
5533 -- multiplying operators from being used when the expected type is
5534 -- also universal_fixed. Note that B_Typ will be Universal_Fixed in
5535 -- some cases where the expected type is actually Any_Real;
5536 -- Expected_Type_Is_Any_Real takes care of that case.
5538 if Etype
(N
) = Universal_Fixed
5539 or else Etype
(N
) = Any_Fixed
5541 if B_Typ
= Universal_Fixed
5542 and then not Expected_Type_Is_Any_Real
(N
)
5543 and then not Nkind_In
(Parent
(N
), N_Type_Conversion
,
5544 N_Unchecked_Type_Conversion
)
5546 Error_Msg_N
("type cannot be determined from context!", N
);
5547 Error_Msg_N
("\explicit conversion to result type required", N
);
5549 Set_Etype
(L
, Any_Type
);
5550 Set_Etype
(R
, Any_Type
);
5553 if Ada_Version
= Ada_83
5554 and then Etype
(N
) = Universal_Fixed
5556 Nkind_In
(Parent
(N
), N_Type_Conversion
,
5557 N_Unchecked_Type_Conversion
)
5560 ("(Ada 83) fixed-point operation needs explicit "
5564 -- The expected type is "any real type" in contexts like
5566 -- type T is delta <universal_fixed-expression> ...
5568 -- in which case we need to set the type to Universal_Real
5569 -- so that static expression evaluation will work properly.
5571 if Expected_Type_Is_Any_Real
(N
) then
5572 Set_Etype
(N
, Universal_Real
);
5574 Set_Etype
(N
, B_Typ
);
5578 elsif Is_Fixed_Point_Type
(B_Typ
)
5579 and then (Is_Integer_Or_Universal
(L
)
5580 or else Nkind
(L
) = N_Real_Literal
5581 or else Nkind
(R
) = N_Real_Literal
5582 or else Is_Integer_Or_Universal
(R
))
5584 Set_Etype
(N
, B_Typ
);
5586 elsif Etype
(N
) = Any_Fixed
then
5588 -- If no previous errors, this is only possible if one operand is
5589 -- overloaded and the context is universal. Resolve as such.
5591 Set_Etype
(N
, B_Typ
);
5595 if (TL
= Universal_Integer
or else TL
= Universal_Real
)
5597 (TR
= Universal_Integer
or else TR
= Universal_Real
)
5599 Check_For_Visible_Operator
(N
, B_Typ
);
5602 -- If the context is Universal_Fixed and the operands are also
5603 -- universal fixed, this is an error, unless there is only one
5604 -- applicable fixed_point type (usually Duration).
5606 if B_Typ
= Universal_Fixed
and then Etype
(L
) = Universal_Fixed
then
5607 T
:= Unique_Fixed_Point_Type
(N
);
5609 if T
= Any_Type
then
5622 -- If one of the arguments was resolved to a non-universal type.
5623 -- label the result of the operation itself with the same type.
5624 -- Do the same for the universal argument, if any.
5626 T
:= Intersect_Types
(L
, R
);
5627 Set_Etype
(N
, Base_Type
(T
));
5628 Set_Operand_Type
(L
);
5629 Set_Operand_Type
(R
);
5632 Generate_Operator_Reference
(N
, Typ
);
5633 Analyze_Dimension
(N
);
5634 Eval_Arithmetic_Op
(N
);
5636 -- In SPARK, a multiplication or division with operands of fixed point
5637 -- types must be qualified or explicitly converted to identify the
5640 if (Is_Fixed_Point_Type
(Etype
(L
))
5641 or else Is_Fixed_Point_Type
(Etype
(R
)))
5642 and then Nkind_In
(N
, N_Op_Multiply
, N_Op_Divide
)
5644 not Nkind_In
(Parent
(N
), N_Qualified_Expression
, N_Type_Conversion
)
5646 Check_SPARK_05_Restriction
5647 ("operation should be qualified or explicitly converted", N
);
5650 -- Set overflow and division checking bit
5652 if Nkind
(N
) in N_Op
then
5653 if not Overflow_Checks_Suppressed
(Etype
(N
)) then
5654 Enable_Overflow_Check
(N
);
5657 -- Give warning if explicit division by zero
5659 if Nkind_In
(N
, N_Op_Divide
, N_Op_Rem
, N_Op_Mod
)
5660 and then not Division_Checks_Suppressed
(Etype
(N
))
5662 Rop
:= Right_Opnd
(N
);
5664 if Compile_Time_Known_Value
(Rop
)
5665 and then ((Is_Integer_Type
(Etype
(Rop
))
5666 and then Expr_Value
(Rop
) = Uint_0
)
5668 (Is_Real_Type
(Etype
(Rop
))
5669 and then Expr_Value_R
(Rop
) = Ureal_0
))
5671 -- Specialize the warning message according to the operation.
5672 -- When SPARK_Mode is On, force a warning instead of an error
5673 -- in that case, as this likely corresponds to deactivated
5674 -- code. The following warnings are for the case
5679 -- For division, we have two cases, for float division
5680 -- of an unconstrained float type, on a machine where
5681 -- Machine_Overflows is false, we don't get an exception
5682 -- at run-time, but rather an infinity or Nan. The Nan
5683 -- case is pretty obscure, so just warn about infinities.
5685 if Is_Floating_Point_Type
(Typ
)
5686 and then not Is_Constrained
(Typ
)
5687 and then not Machine_Overflows_On_Target
5690 ("float division by zero, may generate "
5691 & "'+'/'- infinity??", Right_Opnd
(N
));
5693 -- For all other cases, we get a Constraint_Error
5696 Apply_Compile_Time_Constraint_Error
5697 (N
, "division by zero??", CE_Divide_By_Zero
,
5698 Loc
=> Sloc
(Right_Opnd
(N
)),
5699 Warn
=> SPARK_Mode
= On
);
5703 Apply_Compile_Time_Constraint_Error
5704 (N
, "rem with zero divisor??", CE_Divide_By_Zero
,
5705 Loc
=> Sloc
(Right_Opnd
(N
)),
5706 Warn
=> SPARK_Mode
= On
);
5709 Apply_Compile_Time_Constraint_Error
5710 (N
, "mod with zero divisor??", CE_Divide_By_Zero
,
5711 Loc
=> Sloc
(Right_Opnd
(N
)),
5712 Warn
=> SPARK_Mode
= On
);
5714 -- Division by zero can only happen with division, rem,
5715 -- and mod operations.
5718 raise Program_Error
;
5721 -- In GNATprove mode, we enable the division check so that
5722 -- GNATprove will issue a message if it cannot be proved.
5724 if GNATprove_Mode
then
5725 Activate_Division_Check
(N
);
5728 -- Otherwise just set the flag to check at run time
5731 Activate_Division_Check
(N
);
5735 -- If Restriction No_Implicit_Conditionals is active, then it is
5736 -- violated if either operand can be negative for mod, or for rem
5737 -- if both operands can be negative.
5739 if Restriction_Check_Required
(No_Implicit_Conditionals
)
5740 and then Nkind_In
(N
, N_Op_Rem
, N_Op_Mod
)
5749 -- Set if corresponding operand might be negative
5753 (Left_Opnd
(N
), OK
, Lo
, Hi
, Assume_Valid
=> True);
5754 LNeg
:= (not OK
) or else Lo
< 0;
5757 (Right_Opnd
(N
), OK
, Lo
, Hi
, Assume_Valid
=> True);
5758 RNeg
:= (not OK
) or else Lo
< 0;
5760 -- Check if we will be generating conditionals. There are two
5761 -- cases where that can happen, first for REM, the only case
5762 -- is largest negative integer mod -1, where the division can
5763 -- overflow, but we still have to give the right result. The
5764 -- front end generates a test for this annoying case. Here we
5765 -- just test if both operands can be negative (that's what the
5766 -- expander does, so we match its logic here).
5768 -- The second case is mod where either operand can be negative.
5769 -- In this case, the back end has to generate additional tests.
5771 if (Nkind
(N
) = N_Op_Rem
and then (LNeg
and RNeg
))
5773 (Nkind
(N
) = N_Op_Mod
and then (LNeg
or RNeg
))
5775 Check_Restriction
(No_Implicit_Conditionals
, N
);
5781 Check_Unset_Reference
(L
);
5782 Check_Unset_Reference
(R
);
5783 end Resolve_Arithmetic_Op
;
5789 procedure Resolve_Call
(N
: Node_Id
; Typ
: Entity_Id
) is
5790 function Same_Or_Aliased_Subprograms
5792 E
: Entity_Id
) return Boolean;
5793 -- Returns True if the subprogram entity S is the same as E or else
5794 -- S is an alias of E.
5796 ---------------------------------
5797 -- Same_Or_Aliased_Subprograms --
5798 ---------------------------------
5800 function Same_Or_Aliased_Subprograms
5802 E
: Entity_Id
) return Boolean
5804 Subp_Alias
: constant Entity_Id
:= Alias
(S
);
5806 return S
= E
or else (Present
(Subp_Alias
) and then Subp_Alias
= E
);
5807 end Same_Or_Aliased_Subprograms
;
5811 Loc
: constant Source_Ptr
:= Sloc
(N
);
5812 Subp
: constant Node_Id
:= Name
(N
);
5813 Body_Id
: Entity_Id
;
5823 -- Start of processing for Resolve_Call
5826 -- Preserve relevant elaboration-related attributes of the context which
5827 -- are no longer available or very expensive to recompute once analysis,
5828 -- resolution, and expansion are over.
5830 Mark_Elaboration_Attributes
5836 -- The context imposes a unique interpretation with type Typ on a
5837 -- procedure or function call. Find the entity of the subprogram that
5838 -- yields the expected type, and propagate the corresponding formal
5839 -- constraints on the actuals. The caller has established that an
5840 -- interpretation exists, and emitted an error if not unique.
5842 -- First deal with the case of a call to an access-to-subprogram,
5843 -- dereference made explicit in Analyze_Call.
5845 if Ekind
(Etype
(Subp
)) = E_Subprogram_Type
then
5846 if not Is_Overloaded
(Subp
) then
5847 Nam
:= Etype
(Subp
);
5850 -- Find the interpretation whose type (a subprogram type) has a
5851 -- return type that is compatible with the context. Analysis of
5852 -- the node has established that one exists.
5856 Get_First_Interp
(Subp
, I
, It
);
5857 while Present
(It
.Typ
) loop
5858 if Covers
(Typ
, Etype
(It
.Typ
)) then
5863 Get_Next_Interp
(I
, It
);
5867 raise Program_Error
;
5871 -- If the prefix is not an entity, then resolve it
5873 if not Is_Entity_Name
(Subp
) then
5874 Resolve
(Subp
, Nam
);
5877 -- For an indirect call, we always invalidate checks, since we do not
5878 -- know whether the subprogram is local or global. Yes we could do
5879 -- better here, e.g. by knowing that there are no local subprograms,
5880 -- but it does not seem worth the effort. Similarly, we kill all
5881 -- knowledge of current constant values.
5883 Kill_Current_Values
;
5885 -- If this is a procedure call which is really an entry call, do
5886 -- the conversion of the procedure call to an entry call. Protected
5887 -- operations use the same circuitry because the name in the call
5888 -- can be an arbitrary expression with special resolution rules.
5890 elsif Nkind_In
(Subp
, N_Selected_Component
, N_Indexed_Component
)
5891 or else (Is_Entity_Name
(Subp
)
5892 and then Ekind_In
(Entity
(Subp
), E_Entry
, E_Entry_Family
))
5894 Resolve_Entry_Call
(N
, Typ
);
5896 if Legacy_Elaboration_Checks
then
5897 Check_Elab_Call
(N
);
5900 -- Annotate the tree by creating a call marker in case the original
5901 -- call is transformed by expansion. The call marker is automatically
5902 -- saved for later examination by the ABE Processing phase.
5904 Build_Call_Marker
(N
);
5906 -- Kill checks and constant values, as above for indirect case
5907 -- Who knows what happens when another task is activated?
5909 Kill_Current_Values
;
5912 -- Normal subprogram call with name established in Resolve
5914 elsif not (Is_Type
(Entity
(Subp
))) then
5915 Nam
:= Entity
(Subp
);
5916 Set_Entity_With_Checks
(Subp
, Nam
);
5918 -- Otherwise we must have the case of an overloaded call
5921 pragma Assert
(Is_Overloaded
(Subp
));
5923 -- Initialize Nam to prevent warning (we know it will be assigned
5924 -- in the loop below, but the compiler does not know that).
5928 Get_First_Interp
(Subp
, I
, It
);
5929 while Present
(It
.Typ
) loop
5930 if Covers
(Typ
, It
.Typ
) then
5932 Set_Entity_With_Checks
(Subp
, Nam
);
5936 Get_Next_Interp
(I
, It
);
5940 if Is_Access_Subprogram_Type
(Base_Type
(Etype
(Nam
)))
5941 and then not Is_Access_Subprogram_Type
(Base_Type
(Typ
))
5942 and then Nkind
(Subp
) /= N_Explicit_Dereference
5943 and then Present
(Parameter_Associations
(N
))
5945 -- The prefix is a parameterless function call that returns an access
5946 -- to subprogram. If parameters are present in the current call, add
5947 -- add an explicit dereference. We use the base type here because
5948 -- within an instance these may be subtypes.
5950 -- The dereference is added either in Analyze_Call or here. Should
5951 -- be consolidated ???
5953 Set_Is_Overloaded
(Subp
, False);
5954 Set_Etype
(Subp
, Etype
(Nam
));
5955 Insert_Explicit_Dereference
(Subp
);
5956 Nam
:= Designated_Type
(Etype
(Nam
));
5957 Resolve
(Subp
, Nam
);
5960 -- Check that a call to Current_Task does not occur in an entry body
5962 if Is_RTE
(Nam
, RE_Current_Task
) then
5971 -- Exclude calls that occur within the default of a formal
5972 -- parameter of the entry, since those are evaluated outside
5975 exit when No
(P
) or else Nkind
(P
) = N_Parameter_Specification
;
5977 if Nkind
(P
) = N_Entry_Body
5978 or else (Nkind
(P
) = N_Subprogram_Body
5979 and then Is_Entry_Barrier_Function
(P
))
5982 Error_Msg_Warn
:= SPARK_Mode
/= On
;
5984 ("& should not be used in entry body (RM C.7(17))<<",
5986 Error_Msg_NE
("\Program_Error [<<", N
, Nam
);
5988 Make_Raise_Program_Error
(Loc
,
5989 Reason
=> PE_Current_Task_In_Entry_Body
));
5990 Set_Etype
(N
, Rtype
);
5997 -- Check that a procedure call does not occur in the context of the
5998 -- entry call statement of a conditional or timed entry call. Note that
5999 -- the case of a call to a subprogram renaming of an entry will also be
6000 -- rejected. The test for N not being an N_Entry_Call_Statement is
6001 -- defensive, covering the possibility that the processing of entry
6002 -- calls might reach this point due to later modifications of the code
6005 if Nkind
(Parent
(N
)) = N_Entry_Call_Alternative
6006 and then Nkind
(N
) /= N_Entry_Call_Statement
6007 and then Entry_Call_Statement
(Parent
(N
)) = N
6009 if Ada_Version
< Ada_2005
then
6010 Error_Msg_N
("entry call required in select statement", N
);
6012 -- Ada 2005 (AI-345): If a procedure_call_statement is used
6013 -- for a procedure_or_entry_call, the procedure_name or
6014 -- procedure_prefix of the procedure_call_statement shall denote
6015 -- an entry renamed by a procedure, or (a view of) a primitive
6016 -- subprogram of a limited interface whose first parameter is
6017 -- a controlling parameter.
6019 elsif Nkind
(N
) = N_Procedure_Call_Statement
6020 and then not Is_Renamed_Entry
(Nam
)
6021 and then not Is_Controlling_Limited_Procedure
(Nam
)
6024 ("entry call or dispatching primitive of interface required", N
);
6028 -- If the SPARK_05 restriction is active, we are not allowed
6029 -- to have a call to a subprogram before we see its completion.
6031 if not Has_Completion
(Nam
)
6032 and then Restriction_Check_Required
(SPARK_05
)
6034 -- Don't flag strange internal calls
6036 and then Comes_From_Source
(N
)
6037 and then Comes_From_Source
(Nam
)
6039 -- Only flag calls in extended main source
6041 and then In_Extended_Main_Source_Unit
(Nam
)
6042 and then In_Extended_Main_Source_Unit
(N
)
6044 -- Exclude enumeration literals from this processing
6046 and then Ekind
(Nam
) /= E_Enumeration_Literal
6048 Check_SPARK_05_Restriction
6049 ("call to subprogram cannot appear before its body", N
);
6052 -- Check that this is not a call to a protected procedure or entry from
6053 -- within a protected function.
6055 Check_Internal_Protected_Use
(N
, Nam
);
6057 -- Freeze the subprogram name if not in a spec-expression. Note that
6058 -- we freeze procedure calls as well as function calls. Procedure calls
6059 -- are not frozen according to the rules (RM 13.14(14)) because it is
6060 -- impossible to have a procedure call to a non-frozen procedure in
6061 -- pure Ada, but in the code that we generate in the expander, this
6062 -- rule needs extending because we can generate procedure calls that
6065 -- In Ada 2012, expression functions may be called within pre/post
6066 -- conditions of subsequent functions or expression functions. Such
6067 -- calls do not freeze when they appear within generated bodies,
6068 -- (including the body of another expression function) which would
6069 -- place the freeze node in the wrong scope. An expression function
6070 -- is frozen in the usual fashion, by the appearance of a real body,
6071 -- or at the end of a declarative part. However an implicit call to
6072 -- an expression function may appear when it is part of a default
6073 -- expression in a call to an initialiation procedure, and must be
6074 -- frozen now, even if the body is inserted at a later point.
6076 if Is_Entity_Name
(Subp
)
6077 and then not In_Spec_Expression
6078 and then not Is_Expression_Function_Or_Completion
(Current_Scope
)
6080 (not Is_Expression_Function_Or_Completion
(Entity
(Subp
))
6081 or else Scope
(Entity
(Subp
)) = Current_Scope
)
6083 if Is_Expression_Function
(Entity
(Subp
)) then
6085 -- Force freeze of expression function in call
6087 Set_Comes_From_Source
(Subp
, True);
6088 Set_Must_Not_Freeze
(Subp
, False);
6091 Freeze_Expression
(Subp
);
6094 -- For a predefined operator, the type of the result is the type imposed
6095 -- by context, except for a predefined operation on universal fixed.
6096 -- Otherwise the type of the call is the type returned by the subprogram
6099 if Is_Predefined_Op
(Nam
) then
6100 if Etype
(N
) /= Universal_Fixed
then
6104 -- If the subprogram returns an array type, and the context requires the
6105 -- component type of that array type, the node is really an indexing of
6106 -- the parameterless call. Resolve as such. A pathological case occurs
6107 -- when the type of the component is an access to the array type. In
6108 -- this case the call is truly ambiguous. If the call is to an intrinsic
6109 -- subprogram, it can't be an indexed component. This check is necessary
6110 -- because if it's Unchecked_Conversion, and we have "type T_Ptr is
6111 -- access T;" and "type T is array (...) of T_Ptr;" (i.e. an array of
6112 -- pointers to the same array), the compiler gets confused and does an
6113 -- infinite recursion.
6115 elsif (Needs_No_Actuals
(Nam
) or else Needs_One_Actual
(Nam
))
6117 ((Is_Array_Type
(Etype
(Nam
))
6118 and then Covers
(Typ
, Component_Type
(Etype
(Nam
))))
6120 (Is_Access_Type
(Etype
(Nam
))
6121 and then Is_Array_Type
(Designated_Type
(Etype
(Nam
)))
6123 Covers
(Typ
, Component_Type
(Designated_Type
(Etype
(Nam
))))
6124 and then not Is_Intrinsic_Subprogram
(Entity
(Subp
))))
6127 Index_Node
: Node_Id
;
6129 Ret_Type
: constant Entity_Id
:= Etype
(Nam
);
6132 -- If this is a parameterless call there is no ambiguity and the
6133 -- call has the type of the function.
6135 if No
(First_Actual
(N
)) then
6136 Set_Etype
(N
, Etype
(Nam
));
6138 if Present
(First_Formal
(Nam
)) then
6139 Resolve_Actuals
(N
, Nam
);
6142 -- Annotate the tree by creating a call marker in case the
6143 -- original call is transformed by expansion. The call marker
6144 -- is automatically saved for later examination by the ABE
6145 -- Processing phase.
6147 Build_Call_Marker
(N
);
6149 elsif Is_Access_Type
(Ret_Type
)
6151 and then Ret_Type
= Component_Type
(Designated_Type
(Ret_Type
))
6154 ("cannot disambiguate function call and indexing", N
);
6156 New_Subp
:= Relocate_Node
(Subp
);
6158 -- The called entity may be an explicit dereference, in which
6159 -- case there is no entity to set.
6161 if Nkind
(New_Subp
) /= N_Explicit_Dereference
then
6162 Set_Entity
(Subp
, Nam
);
6165 if (Is_Array_Type
(Ret_Type
)
6166 and then Component_Type
(Ret_Type
) /= Any_Type
)
6168 (Is_Access_Type
(Ret_Type
)
6170 Component_Type
(Designated_Type
(Ret_Type
)) /= Any_Type
)
6172 if Needs_No_Actuals
(Nam
) then
6174 -- Indexed call to a parameterless function
6177 Make_Indexed_Component
(Loc
,
6179 Make_Function_Call
(Loc
, Name
=> New_Subp
),
6180 Expressions
=> Parameter_Associations
(N
));
6182 -- An Ada 2005 prefixed call to a primitive operation
6183 -- whose first parameter is the prefix. This prefix was
6184 -- prepended to the parameter list, which is actually a
6185 -- list of indexes. Remove the prefix in order to build
6186 -- the proper indexed component.
6189 Make_Indexed_Component
(Loc
,
6191 Make_Function_Call
(Loc
,
6193 Parameter_Associations
=>
6195 (Remove_Head
(Parameter_Associations
(N
)))),
6196 Expressions
=> Parameter_Associations
(N
));
6199 -- Preserve the parenthesis count of the node
6201 Set_Paren_Count
(Index_Node
, Paren_Count
(N
));
6203 -- Since we are correcting a node classification error made
6204 -- by the parser, we call Replace rather than Rewrite.
6206 Replace
(N
, Index_Node
);
6208 Set_Etype
(Prefix
(N
), Ret_Type
);
6210 Resolve_Indexed_Component
(N
, Typ
);
6212 if Legacy_Elaboration_Checks
then
6213 Check_Elab_Call
(Prefix
(N
));
6216 -- Annotate the tree by creating a call marker in case
6217 -- the original call is transformed by expansion. The call
6218 -- marker is automatically saved for later examination by
6219 -- the ABE Processing phase.
6221 Build_Call_Marker
(Prefix
(N
));
6229 -- If the called function is not declared in the main unit and it
6230 -- returns the limited view of type then use the available view (as
6231 -- is done in Try_Object_Operation) to prevent back-end confusion;
6232 -- for the function entity itself. The call must appear in a context
6233 -- where the nonlimited view is available. If the function entity is
6234 -- in the extended main unit then no action is needed, because the
6235 -- back end handles this case. In either case the type of the call
6236 -- is the nonlimited view.
6238 if From_Limited_With
(Etype
(Nam
))
6239 and then Present
(Available_View
(Etype
(Nam
)))
6241 Set_Etype
(N
, Available_View
(Etype
(Nam
)));
6243 if not In_Extended_Main_Code_Unit
(Nam
) then
6244 Set_Etype
(Nam
, Available_View
(Etype
(Nam
)));
6248 Set_Etype
(N
, Etype
(Nam
));
6252 -- In the case where the call is to an overloaded subprogram, Analyze
6253 -- calls Normalize_Actuals once per overloaded subprogram. Therefore in
6254 -- such a case Normalize_Actuals needs to be called once more to order
6255 -- the actuals correctly. Otherwise the call will have the ordering
6256 -- given by the last overloaded subprogram whether this is the correct
6257 -- one being called or not.
6259 if Is_Overloaded
(Subp
) then
6260 Normalize_Actuals
(N
, Nam
, False, Norm_OK
);
6261 pragma Assert
(Norm_OK
);
6264 -- In any case, call is fully resolved now. Reset Overload flag, to
6265 -- prevent subsequent overload resolution if node is analyzed again
6267 Set_Is_Overloaded
(Subp
, False);
6268 Set_Is_Overloaded
(N
, False);
6270 -- A Ghost entity must appear in a specific context
6272 if Is_Ghost_Entity
(Nam
) and then Comes_From_Source
(N
) then
6273 Check_Ghost_Context
(Nam
, N
);
6276 -- If we are calling the current subprogram from immediately within its
6277 -- body, then that is the case where we can sometimes detect cases of
6278 -- infinite recursion statically. Do not try this in case restriction
6279 -- No_Recursion is in effect anyway, and do it only for source calls.
6281 if Comes_From_Source
(N
) then
6282 Scop
:= Current_Scope
;
6284 -- Check violation of SPARK_05 restriction which does not permit
6285 -- a subprogram body to contain a call to the subprogram directly.
6287 if Restriction_Check_Required
(SPARK_05
)
6288 and then Same_Or_Aliased_Subprograms
(Nam
, Scop
)
6290 Check_SPARK_05_Restriction
6291 ("subprogram may not contain direct call to itself", N
);
6294 -- Issue warning for possible infinite recursion in the absence
6295 -- of the No_Recursion restriction.
6297 if Same_Or_Aliased_Subprograms
(Nam
, Scop
)
6298 and then not Restriction_Active
(No_Recursion
)
6299 and then Check_Infinite_Recursion
(N
)
6301 -- Here we detected and flagged an infinite recursion, so we do
6302 -- not need to test the case below for further warnings. Also we
6303 -- are all done if we now have a raise SE node.
6305 if Nkind
(N
) = N_Raise_Storage_Error
then
6309 -- If call is to immediately containing subprogram, then check for
6310 -- the case of a possible run-time detectable infinite recursion.
6313 Scope_Loop
: while Scop
/= Standard_Standard
loop
6314 if Same_Or_Aliased_Subprograms
(Nam
, Scop
) then
6316 -- Although in general case, recursion is not statically
6317 -- checkable, the case of calling an immediately containing
6318 -- subprogram is easy to catch.
6320 Check_Restriction
(No_Recursion
, N
);
6322 -- If the recursive call is to a parameterless subprogram,
6323 -- then even if we can't statically detect infinite
6324 -- recursion, this is pretty suspicious, and we output a
6325 -- warning. Furthermore, we will try later to detect some
6326 -- cases here at run time by expanding checking code (see
6327 -- Detect_Infinite_Recursion in package Exp_Ch6).
6329 -- If the recursive call is within a handler, do not emit a
6330 -- warning, because this is a common idiom: loop until input
6331 -- is correct, catch illegal input in handler and restart.
6333 if No
(First_Formal
(Nam
))
6334 and then Etype
(Nam
) = Standard_Void_Type
6335 and then not Error_Posted
(N
)
6336 and then Nkind
(Parent
(N
)) /= N_Exception_Handler
6338 -- For the case of a procedure call. We give the message
6339 -- only if the call is the first statement in a sequence
6340 -- of statements, or if all previous statements are
6341 -- simple assignments. This is simply a heuristic to
6342 -- decrease false positives, without losing too many good
6343 -- warnings. The idea is that these previous statements
6344 -- may affect global variables the procedure depends on.
6345 -- We also exclude raise statements, that may arise from
6346 -- constraint checks and are probably unrelated to the
6347 -- intended control flow.
6349 if Nkind
(N
) = N_Procedure_Call_Statement
6350 and then Is_List_Member
(N
)
6356 while Present
(P
) loop
6357 if not Nkind_In
(P
, N_Assignment_Statement
,
6358 N_Raise_Constraint_Error
)
6368 -- Do not give warning if we are in a conditional context
6371 K
: constant Node_Kind
:= Nkind
(Parent
(N
));
6373 if (K
= N_Loop_Statement
6374 and then Present
(Iteration_Scheme
(Parent
(N
))))
6375 or else K
= N_If_Statement
6376 or else K
= N_Elsif_Part
6377 or else K
= N_Case_Statement_Alternative
6383 -- Here warning is to be issued
6385 Set_Has_Recursive_Call
(Nam
);
6386 Error_Msg_Warn
:= SPARK_Mode
/= On
;
6387 Error_Msg_N
("possible infinite recursion<<!", N
);
6388 Error_Msg_N
("\Storage_Error ]<<!", N
);
6394 Scop
:= Scope
(Scop
);
6395 end loop Scope_Loop
;
6399 -- Check obsolescent reference to Ada.Characters.Handling subprogram
6401 Check_Obsolescent_2005_Entity
(Nam
, Subp
);
6403 -- If subprogram name is a predefined operator, it was given in
6404 -- functional notation. Replace call node with operator node, so
6405 -- that actuals can be resolved appropriately.
6407 if Is_Predefined_Op
(Nam
) or else Ekind
(Nam
) = E_Operator
then
6408 Make_Call_Into_Operator
(N
, Typ
, Entity
(Name
(N
)));
6411 elsif Present
(Alias
(Nam
))
6412 and then Is_Predefined_Op
(Alias
(Nam
))
6414 Resolve_Actuals
(N
, Nam
);
6415 Make_Call_Into_Operator
(N
, Typ
, Alias
(Nam
));
6419 -- Create a transient scope if the resulting type requires it
6421 -- There are several notable exceptions:
6423 -- a) In init procs, the transient scope overhead is not needed, and is
6424 -- even incorrect when the call is a nested initialization call for a
6425 -- component whose expansion may generate adjust calls. However, if the
6426 -- call is some other procedure call within an initialization procedure
6427 -- (for example a call to Create_Task in the init_proc of the task
6428 -- run-time record) a transient scope must be created around this call.
6430 -- b) Enumeration literal pseudo-calls need no transient scope
6432 -- c) Intrinsic subprograms (Unchecked_Conversion and source info
6433 -- functions) do not use the secondary stack even though the return
6434 -- type may be unconstrained.
6436 -- d) Calls to a build-in-place function, since such functions may
6437 -- allocate their result directly in a target object, and cases where
6438 -- the result does get allocated in the secondary stack are checked for
6439 -- within the specialized Exp_Ch6 procedures for expanding those
6440 -- build-in-place calls.
6442 -- e) Calls to inlinable expression functions do not use the secondary
6443 -- stack (since the call will be replaced by its returned object).
6445 -- f) If the subprogram is marked Inline_Always, then even if it returns
6446 -- an unconstrained type the call does not require use of the secondary
6447 -- stack. However, inlining will only take place if the body to inline
6448 -- is already present. It may not be available if e.g. the subprogram is
6449 -- declared in a child instance.
6452 and then Has_Pragma_Inline
(Nam
)
6453 and then Nkind
(Unit_Declaration_Node
(Nam
)) = N_Subprogram_Declaration
6454 and then Present
(Body_To_Inline
(Unit_Declaration_Node
(Nam
)))
6458 elsif Ekind
(Nam
) = E_Enumeration_Literal
6459 or else Is_Build_In_Place_Function
(Nam
)
6460 or else Is_Intrinsic_Subprogram
(Nam
)
6461 or else Is_Inlinable_Expression_Function
(Nam
)
6465 elsif Expander_Active
6466 and then Ekind_In
(Nam
, E_Function
, E_Subprogram_Type
)
6467 and then Requires_Transient_Scope
(Etype
(Nam
))
6469 Establish_Transient_Scope
(N
, Manage_Sec_Stack
=> True);
6471 -- If the call appears within the bounds of a loop, it will be
6472 -- rewritten and reanalyzed, nothing left to do here.
6474 if Nkind
(N
) /= N_Function_Call
then
6479 -- A protected function cannot be called within the definition of the
6480 -- enclosing protected type, unless it is part of a pre/postcondition
6481 -- on another protected operation. This may appear in the entry wrapper
6482 -- created for an entry with preconditions.
6484 if Is_Protected_Type
(Scope
(Nam
))
6485 and then In_Open_Scopes
(Scope
(Nam
))
6486 and then not Has_Completion
(Scope
(Nam
))
6487 and then not In_Spec_Expression
6488 and then not Is_Entry_Wrapper
(Current_Scope
)
6491 ("& cannot be called before end of protected definition", N
, Nam
);
6494 -- Propagate interpretation to actuals, and add default expressions
6497 if Present
(First_Formal
(Nam
)) then
6498 Resolve_Actuals
(N
, Nam
);
6500 -- Overloaded literals are rewritten as function calls, for purpose of
6501 -- resolution. After resolution, we can replace the call with the
6504 elsif Ekind
(Nam
) = E_Enumeration_Literal
then
6505 Copy_Node
(Subp
, N
);
6506 Resolve_Entity_Name
(N
, Typ
);
6508 -- Avoid validation, since it is a static function call
6510 Generate_Reference
(Nam
, Subp
);
6514 -- If the subprogram is not global, then kill all saved values and
6515 -- checks. This is a bit conservative, since in many cases we could do
6516 -- better, but it is not worth the effort. Similarly, we kill constant
6517 -- values. However we do not need to do this for internal entities
6518 -- (unless they are inherited user-defined subprograms), since they
6519 -- are not in the business of molesting local values.
6521 -- If the flag Suppress_Value_Tracking_On_Calls is set, then we also
6522 -- kill all checks and values for calls to global subprograms. This
6523 -- takes care of the case where an access to a local subprogram is
6524 -- taken, and could be passed directly or indirectly and then called
6525 -- from almost any context.
6527 -- Note: we do not do this step till after resolving the actuals. That
6528 -- way we still take advantage of the current value information while
6529 -- scanning the actuals.
6531 -- We suppress killing values if we are processing the nodes associated
6532 -- with N_Freeze_Entity nodes. Otherwise the declaration of a tagged
6533 -- type kills all the values as part of analyzing the code that
6534 -- initializes the dispatch tables.
6536 if Inside_Freezing_Actions
= 0
6537 and then (not Is_Library_Level_Entity
(Nam
)
6538 or else Suppress_Value_Tracking_On_Call
6539 (Nearest_Dynamic_Scope
(Current_Scope
)))
6540 and then (Comes_From_Source
(Nam
)
6541 or else (Present
(Alias
(Nam
))
6542 and then Comes_From_Source
(Alias
(Nam
))))
6544 Kill_Current_Values
;
6547 -- If we are warning about unread OUT parameters, this is the place to
6548 -- set Last_Assignment for OUT and IN OUT parameters. We have to do this
6549 -- after the above call to Kill_Current_Values (since that call clears
6550 -- the Last_Assignment field of all local variables).
6552 if (Warn_On_Modified_Unread
or Warn_On_All_Unread_Out_Parameters
)
6553 and then Comes_From_Source
(N
)
6554 and then In_Extended_Main_Source_Unit
(N
)
6561 F
:= First_Formal
(Nam
);
6562 A
:= First_Actual
(N
);
6563 while Present
(F
) and then Present
(A
) loop
6564 if Ekind_In
(F
, E_Out_Parameter
, E_In_Out_Parameter
)
6565 and then Warn_On_Modified_As_Out_Parameter
(F
)
6566 and then Is_Entity_Name
(A
)
6567 and then Present
(Entity
(A
))
6568 and then Comes_From_Source
(N
)
6569 and then Safe_To_Capture_Value
(N
, Entity
(A
))
6571 Set_Last_Assignment
(Entity
(A
), A
);
6580 -- If the subprogram is a primitive operation, check whether or not
6581 -- it is a correct dispatching call.
6583 if Is_Overloadable
(Nam
)
6584 and then Is_Dispatching_Operation
(Nam
)
6586 Check_Dispatching_Call
(N
);
6588 elsif Ekind
(Nam
) /= E_Subprogram_Type
6589 and then Is_Abstract_Subprogram
(Nam
)
6590 and then not In_Instance
6592 Error_Msg_NE
("cannot call abstract subprogram &!", N
, Nam
);
6595 -- If this is a dispatching call, generate the appropriate reference,
6596 -- for better source navigation in GPS.
6598 if Is_Overloadable
(Nam
)
6599 and then Present
(Controlling_Argument
(N
))
6601 Generate_Reference
(Nam
, Subp
, 'R');
6603 -- Normal case, not a dispatching call: generate a call reference
6606 Generate_Reference
(Nam
, Subp
, 's');
6609 if Is_Intrinsic_Subprogram
(Nam
) then
6610 Check_Intrinsic_Call
(N
);
6613 -- Check for violation of restriction No_Specific_Termination_Handlers
6614 -- and warn on a potentially blocking call to Abort_Task.
6616 if Restriction_Check_Required
(No_Specific_Termination_Handlers
)
6617 and then (Is_RTE
(Nam
, RE_Set_Specific_Handler
)
6619 Is_RTE
(Nam
, RE_Specific_Handler
))
6621 Check_Restriction
(No_Specific_Termination_Handlers
, N
);
6623 elsif Is_RTE
(Nam
, RE_Abort_Task
) then
6624 Check_Potentially_Blocking_Operation
(N
);
6627 -- A call to Ada.Real_Time.Timing_Events.Set_Handler to set a relative
6628 -- timing event violates restriction No_Relative_Delay (AI-0211). We
6629 -- need to check the second argument to determine whether it is an
6630 -- absolute or relative timing event.
6632 if Restriction_Check_Required
(No_Relative_Delay
)
6633 and then Is_RTE
(Nam
, RE_Set_Handler
)
6634 and then Is_RTE
(Etype
(Next_Actual
(First_Actual
(N
))), RE_Time_Span
)
6636 Check_Restriction
(No_Relative_Delay
, N
);
6639 -- Issue an error for a call to an eliminated subprogram. This routine
6640 -- will not perform the check if the call appears within a default
6643 Check_For_Eliminated_Subprogram
(Subp
, Nam
);
6645 -- In formal mode, the primitive operations of a tagged type or type
6646 -- extension do not include functions that return the tagged type.
6648 if Nkind
(N
) = N_Function_Call
6649 and then Is_Tagged_Type
(Etype
(N
))
6650 and then Is_Entity_Name
(Name
(N
))
6651 and then Is_Inherited_Operation_For_Type
(Entity
(Name
(N
)), Etype
(N
))
6653 Check_SPARK_05_Restriction
("function not inherited", N
);
6656 -- Implement rule in 12.5.1 (23.3/2): In an instance, if the actual is
6657 -- class-wide and the call dispatches on result in a context that does
6658 -- not provide a tag, the call raises Program_Error.
6660 if Nkind
(N
) = N_Function_Call
6661 and then In_Instance
6662 and then Is_Generic_Actual_Type
(Typ
)
6663 and then Is_Class_Wide_Type
(Typ
)
6664 and then Has_Controlling_Result
(Nam
)
6665 and then Nkind
(Parent
(N
)) = N_Object_Declaration
6667 -- Verify that none of the formals are controlling
6670 Call_OK
: Boolean := False;
6674 F
:= First_Formal
(Nam
);
6675 while Present
(F
) loop
6676 if Is_Controlling_Formal
(F
) then
6685 Error_Msg_Warn
:= SPARK_Mode
/= On
;
6686 Error_Msg_N
("!cannot determine tag of result<<", N
);
6687 Error_Msg_N
("\Program_Error [<<!", N
);
6689 Make_Raise_Program_Error
(Sloc
(N
),
6690 Reason
=> PE_Explicit_Raise
));
6695 -- Check for calling a function with OUT or IN OUT parameter when the
6696 -- calling context (us right now) is not Ada 2012, so does not allow
6697 -- OUT or IN OUT parameters in function calls. Functions declared in
6698 -- a predefined unit are OK, as they may be called indirectly from a
6699 -- user-declared instantiation.
6701 if Ada_Version
< Ada_2012
6702 and then Ekind
(Nam
) = E_Function
6703 and then Has_Out_Or_In_Out_Parameter
(Nam
)
6704 and then not In_Predefined_Unit
(Nam
)
6706 Error_Msg_NE
("& has at least one OUT or `IN OUT` parameter", N
, Nam
);
6707 Error_Msg_N
("\call to this function only allowed in Ada 2012", N
);
6710 -- Check the dimensions of the actuals in the call. For function calls,
6711 -- propagate the dimensions from the returned type to N.
6713 Analyze_Dimension_Call
(N
, Nam
);
6715 -- All done, evaluate call and deal with elaboration issues
6719 if Legacy_Elaboration_Checks
then
6720 Check_Elab_Call
(N
);
6723 -- Annotate the tree by creating a call marker in case the original call
6724 -- is transformed by expansion. The call marker is automatically saved
6725 -- for later examination by the ABE Processing phase.
6727 Build_Call_Marker
(N
);
6729 -- In GNATprove mode, expansion is disabled, but we want to inline some
6730 -- subprograms to facilitate formal verification. Indirect calls through
6731 -- a subprogram type or within a generic cannot be inlined. Inlining is
6732 -- performed only for calls subject to SPARK_Mode on.
6735 and then SPARK_Mode
= On
6736 and then Is_Overloadable
(Nam
)
6737 and then not Inside_A_Generic
6739 Nam_UA
:= Ultimate_Alias
(Nam
);
6740 Nam_Decl
:= Unit_Declaration_Node
(Nam_UA
);
6742 if Nkind
(Nam_Decl
) = N_Subprogram_Declaration
then
6743 Body_Id
:= Corresponding_Body
(Nam_Decl
);
6745 -- Nothing to do if the subprogram is not eligible for inlining in
6746 -- GNATprove mode, or inlining is disabled with switch -gnatdm
6748 if not Is_Inlined_Always
(Nam_UA
)
6749 or else not Can_Be_Inlined_In_GNATprove_Mode
(Nam_UA
, Body_Id
)
6750 or else Debug_Flag_M
6754 -- Calls cannot be inlined inside assertions, as GNATprove treats
6755 -- assertions as logic expressions. Only issue a message when the
6756 -- body has been seen, otherwise this leads to spurious messages
6757 -- on expression functions.
6759 elsif In_Assertion_Expr
/= 0 then
6760 if Present
(Body_Id
) then
6762 ("cannot inline & (in assertion expression)?", N
, Nam_UA
);
6765 -- Calls cannot be inlined inside default expressions
6767 elsif In_Default_Expr
then
6769 ("cannot inline & (in default expression)?", N
, Nam_UA
);
6771 -- Inlining should not be performed during preanalysis
6773 elsif Full_Analysis
then
6775 -- Do not inline calls inside expression functions or functions
6776 -- generated by the front end for subtype predicates, as this
6777 -- would prevent interpreting them as logical formulas in
6778 -- GNATprove. Only issue a message when the body has been seen,
6779 -- otherwise this leads to spurious messages on callees that
6780 -- are themselves expression functions.
6782 if Present
(Current_Subprogram
)
6784 (Is_Expression_Function_Or_Completion
(Current_Subprogram
)
6785 or else Is_Predicate_Function
(Current_Subprogram
)
6786 or else Is_Invariant_Procedure
(Current_Subprogram
)
6787 or else Is_DIC_Procedure
(Current_Subprogram
))
6789 if Present
(Body_Id
)
6790 and then Present
(Body_To_Inline
(Nam_Decl
))
6792 if Is_Predicate_Function
(Current_Subprogram
) then
6794 ("cannot inline & (inside predicate)?",
6797 elsif Is_Invariant_Procedure
(Current_Subprogram
) then
6799 ("cannot inline & (inside invariant)?",
6802 elsif Is_DIC_Procedure
(Current_Subprogram
) then
6804 ("cannot inline & (inside Default_Initial_Condition)?",
6809 ("cannot inline & (inside expression function)?",
6814 -- With the one-pass inlining technique, a call cannot be
6815 -- inlined if the corresponding body has not been seen yet.
6817 elsif No
(Body_Id
) then
6819 ("cannot inline & (body not seen yet)?", N
, Nam_UA
);
6821 -- Nothing to do if there is no body to inline, indicating that
6822 -- the subprogram is not suitable for inlining in GNATprove
6825 elsif No
(Body_To_Inline
(Nam_Decl
)) then
6828 -- Calls cannot be inlined inside potentially unevaluated
6829 -- expressions, as this would create complex actions inside
6830 -- expressions, that are not handled by GNATprove.
6832 elsif Is_Potentially_Unevaluated
(N
) then
6834 ("cannot inline & (in potentially unevaluated context)?",
6837 -- Do not inline calls which would possibly lead to missing a
6838 -- type conversion check on an input parameter.
6840 elsif not Call_Can_Be_Inlined_In_GNATprove_Mode
(N
, Nam
) then
6842 ("cannot inline & (possible check on input parameters)?",
6845 -- Otherwise, inline the call, issuing an info message when
6849 if Debug_Flag_Underscore_F
then
6851 ("info: analyzing call to & in context?", N
, Nam_UA
);
6854 Expand_Inlined_Call
(N
, Nam_UA
, Nam
);
6860 Mark_Use_Clauses
(Subp
);
6862 Warn_On_Overlapping_Actuals
(Nam
, N
);
6865 -----------------------------
6866 -- Resolve_Case_Expression --
6867 -----------------------------
6869 procedure Resolve_Case_Expression
(N
: Node_Id
; Typ
: Entity_Id
) is
6872 Alt_Typ
: Entity_Id
;
6876 Alt
:= First
(Alternatives
(N
));
6877 while Present
(Alt
) loop
6878 Alt_Expr
:= Expression
(Alt
);
6880 if Error_Posted
(Alt_Expr
) then
6884 Resolve
(Alt_Expr
, Typ
);
6885 Alt_Typ
:= Etype
(Alt_Expr
);
6887 -- When the expression is of a scalar subtype different from the
6888 -- result subtype, then insert a conversion to ensure the generation
6889 -- of a constraint check.
6891 if Is_Scalar_Type
(Alt_Typ
) and then Alt_Typ
/= Typ
then
6892 Rewrite
(Alt_Expr
, Convert_To
(Typ
, Alt_Expr
));
6893 Analyze_And_Resolve
(Alt_Expr
, Typ
);
6899 -- Apply RM 4.5.7 (17/3): whether the expression is statically or
6900 -- dynamically tagged must be known statically.
6902 if Is_Tagged_Type
(Typ
) and then not Is_Class_Wide_Type
(Typ
) then
6903 Alt
:= First
(Alternatives
(N
));
6904 Is_Dyn
:= Is_Dynamically_Tagged
(Expression
(Alt
));
6906 while Present
(Alt
) loop
6907 if Is_Dynamically_Tagged
(Expression
(Alt
)) /= Is_Dyn
then
6909 ("all or none of the dependent expressions can be "
6910 & "dynamically tagged", N
);
6918 Eval_Case_Expression
(N
);
6919 Analyze_Dimension
(N
);
6920 end Resolve_Case_Expression
;
6922 -------------------------------
6923 -- Resolve_Character_Literal --
6924 -------------------------------
6926 procedure Resolve_Character_Literal
(N
: Node_Id
; Typ
: Entity_Id
) is
6927 B_Typ
: constant Entity_Id
:= Base_Type
(Typ
);
6931 -- Verify that the character does belong to the type of the context
6933 Set_Etype
(N
, B_Typ
);
6934 Eval_Character_Literal
(N
);
6936 -- Wide_Wide_Character literals must always be defined, since the set
6937 -- of wide wide character literals is complete, i.e. if a character
6938 -- literal is accepted by the parser, then it is OK for wide wide
6939 -- character (out of range character literals are rejected).
6941 if Root_Type
(B_Typ
) = Standard_Wide_Wide_Character
then
6944 -- Always accept character literal for type Any_Character, which
6945 -- occurs in error situations and in comparisons of literals, both
6946 -- of which should accept all literals.
6948 elsif B_Typ
= Any_Character
then
6951 -- For Standard.Character or a type derived from it, check that the
6952 -- literal is in range.
6954 elsif Root_Type
(B_Typ
) = Standard_Character
then
6955 if In_Character_Range
(UI_To_CC
(Char_Literal_Value
(N
))) then
6959 -- For Standard.Wide_Character or a type derived from it, check that the
6960 -- literal is in range.
6962 elsif Root_Type
(B_Typ
) = Standard_Wide_Character
then
6963 if In_Wide_Character_Range
(UI_To_CC
(Char_Literal_Value
(N
))) then
6967 -- If the entity is already set, this has already been resolved in a
6968 -- generic context, or comes from expansion. Nothing else to do.
6970 elsif Present
(Entity
(N
)) then
6973 -- Otherwise we have a user defined character type, and we can use the
6974 -- standard visibility mechanisms to locate the referenced entity.
6977 C
:= Current_Entity
(N
);
6978 while Present
(C
) loop
6979 if Etype
(C
) = B_Typ
then
6980 Set_Entity_With_Checks
(N
, C
);
6981 Generate_Reference
(C
, N
);
6989 -- If we fall through, then the literal does not match any of the
6990 -- entries of the enumeration type. This isn't just a constraint error
6991 -- situation, it is an illegality (see RM 4.2).
6994 ("character not defined for }", N
, First_Subtype
(B_Typ
));
6995 end Resolve_Character_Literal
;
6997 ---------------------------
6998 -- Resolve_Comparison_Op --
6999 ---------------------------
7001 -- Context requires a boolean type, and plays no role in resolution.
7002 -- Processing identical to that for equality operators. The result type is
7003 -- the base type, which matters when pathological subtypes of booleans with
7004 -- limited ranges are used.
7006 procedure Resolve_Comparison_Op
(N
: Node_Id
; Typ
: Entity_Id
) is
7007 L
: constant Node_Id
:= Left_Opnd
(N
);
7008 R
: constant Node_Id
:= Right_Opnd
(N
);
7012 -- If this is an intrinsic operation which is not predefined, use the
7013 -- types of its declared arguments to resolve the possibly overloaded
7014 -- operands. Otherwise the operands are unambiguous and specify the
7017 if Scope
(Entity
(N
)) /= Standard_Standard
then
7018 T
:= Etype
(First_Entity
(Entity
(N
)));
7021 T
:= Find_Unique_Type
(L
, R
);
7023 if T
= Any_Fixed
then
7024 T
:= Unique_Fixed_Point_Type
(L
);
7028 Set_Etype
(N
, Base_Type
(Typ
));
7029 Generate_Reference
(T
, N
, ' ');
7031 -- Skip remaining processing if already set to Any_Type
7033 if T
= Any_Type
then
7037 -- Deal with other error cases
7039 if T
= Any_String
or else
7040 T
= Any_Composite
or else
7043 if T
= Any_Character
then
7044 Ambiguous_Character
(L
);
7046 Error_Msg_N
("ambiguous operands for comparison", N
);
7049 Set_Etype
(N
, Any_Type
);
7053 -- Resolve the operands if types OK
7057 Check_Unset_Reference
(L
);
7058 Check_Unset_Reference
(R
);
7059 Generate_Operator_Reference
(N
, T
);
7060 Check_Low_Bound_Tested
(N
);
7062 -- In SPARK, ordering operators <, <=, >, >= are not defined for Boolean
7063 -- types or array types except String.
7065 if Is_Boolean_Type
(T
) then
7066 Check_SPARK_05_Restriction
7067 ("comparison is not defined on Boolean type", N
);
7069 elsif Is_Array_Type
(T
)
7070 and then Base_Type
(T
) /= Standard_String
7072 Check_SPARK_05_Restriction
7073 ("comparison is not defined on array types other than String", N
);
7076 -- Check comparison on unordered enumeration
7078 if Bad_Unordered_Enumeration_Reference
(N
, Etype
(L
)) then
7079 Error_Msg_Sloc
:= Sloc
(Etype
(L
));
7081 ("comparison on unordered enumeration type& declared#?U?",
7085 Analyze_Dimension
(N
);
7087 -- Evaluate the relation (note we do this after the above check since
7088 -- this Eval call may change N to True/False. Skip this evaluation
7089 -- inside assertions, in order to keep assertions as written by users
7090 -- for tools that rely on these, e.g. GNATprove for loop invariants.
7091 -- Except evaluation is still performed even inside assertions for
7092 -- comparisons between values of universal type, which are useless
7093 -- for static analysis tools, and not supported even by GNATprove.
7095 if In_Assertion_Expr
= 0
7096 or else (Is_Universal_Numeric_Type
(Etype
(L
))
7098 Is_Universal_Numeric_Type
(Etype
(R
)))
7100 Eval_Relational_Op
(N
);
7102 end Resolve_Comparison_Op
;
7104 -----------------------------------------
7105 -- Resolve_Discrete_Subtype_Indication --
7106 -----------------------------------------
7108 procedure Resolve_Discrete_Subtype_Indication
7116 Analyze
(Subtype_Mark
(N
));
7117 S
:= Entity
(Subtype_Mark
(N
));
7119 if Nkind
(Constraint
(N
)) /= N_Range_Constraint
then
7120 Error_Msg_N
("expect range constraint for discrete type", N
);
7121 Set_Etype
(N
, Any_Type
);
7124 R
:= Range_Expression
(Constraint
(N
));
7132 if Base_Type
(S
) /= Base_Type
(Typ
) then
7134 ("expect subtype of }", N
, First_Subtype
(Typ
));
7136 -- Rewrite the constraint as a range of Typ
7137 -- to allow compilation to proceed further.
7140 Rewrite
(Low_Bound
(R
),
7141 Make_Attribute_Reference
(Sloc
(Low_Bound
(R
)),
7142 Prefix
=> New_Occurrence_Of
(Typ
, Sloc
(R
)),
7143 Attribute_Name
=> Name_First
));
7144 Rewrite
(High_Bound
(R
),
7145 Make_Attribute_Reference
(Sloc
(High_Bound
(R
)),
7146 Prefix
=> New_Occurrence_Of
(Typ
, Sloc
(R
)),
7147 Attribute_Name
=> Name_First
));
7151 Set_Etype
(N
, Etype
(R
));
7153 -- Additionally, we must check that the bounds are compatible
7154 -- with the given subtype, which might be different from the
7155 -- type of the context.
7157 Apply_Range_Check
(R
, S
);
7159 -- ??? If the above check statically detects a Constraint_Error
7160 -- it replaces the offending bound(s) of the range R with a
7161 -- Constraint_Error node. When the itype which uses these bounds
7162 -- is frozen the resulting call to Duplicate_Subexpr generates
7163 -- a new temporary for the bounds.
7165 -- Unfortunately there are other itypes that are also made depend
7166 -- on these bounds, so when Duplicate_Subexpr is called they get
7167 -- a forward reference to the newly created temporaries and Gigi
7168 -- aborts on such forward references. This is probably sign of a
7169 -- more fundamental problem somewhere else in either the order of
7170 -- itype freezing or the way certain itypes are constructed.
7172 -- To get around this problem we call Remove_Side_Effects right
7173 -- away if either bounds of R are a Constraint_Error.
7176 L
: constant Node_Id
:= Low_Bound
(R
);
7177 H
: constant Node_Id
:= High_Bound
(R
);
7180 if Nkind
(L
) = N_Raise_Constraint_Error
then
7181 Remove_Side_Effects
(L
);
7184 if Nkind
(H
) = N_Raise_Constraint_Error
then
7185 Remove_Side_Effects
(H
);
7189 Check_Unset_Reference
(Low_Bound
(R
));
7190 Check_Unset_Reference
(High_Bound
(R
));
7193 end Resolve_Discrete_Subtype_Indication
;
7195 -------------------------
7196 -- Resolve_Entity_Name --
7197 -------------------------
7199 -- Used to resolve identifiers and expanded names
7201 procedure Resolve_Entity_Name
(N
: Node_Id
; Typ
: Entity_Id
) is
7202 function Is_Assignment_Or_Object_Expression
7204 Expr
: Node_Id
) return Boolean;
7205 -- Determine whether node Context denotes an assignment statement or an
7206 -- object declaration whose expression is node Expr.
7208 ----------------------------------------
7209 -- Is_Assignment_Or_Object_Expression --
7210 ----------------------------------------
7212 function Is_Assignment_Or_Object_Expression
7214 Expr
: Node_Id
) return Boolean
7217 if Nkind_In
(Context
, N_Assignment_Statement
,
7218 N_Object_Declaration
)
7219 and then Expression
(Context
) = Expr
7223 -- Check whether a construct that yields a name is the expression of
7224 -- an assignment statement or an object declaration.
7226 elsif (Nkind_In
(Context
, N_Attribute_Reference
,
7227 N_Explicit_Dereference
,
7228 N_Indexed_Component
,
7229 N_Selected_Component
,
7231 and then Prefix
(Context
) = Expr
)
7233 (Nkind_In
(Context
, N_Type_Conversion
,
7234 N_Unchecked_Type_Conversion
)
7235 and then Expression
(Context
) = Expr
)
7238 Is_Assignment_Or_Object_Expression
7239 (Context
=> Parent
(Context
),
7242 -- Otherwise the context is not an assignment statement or an object
7248 end Is_Assignment_Or_Object_Expression
;
7252 E
: constant Entity_Id
:= Entity
(N
);
7255 -- Start of processing for Resolve_Entity_Name
7258 -- If garbage from errors, set to Any_Type and return
7260 if No
(E
) and then Total_Errors_Detected
/= 0 then
7261 Set_Etype
(N
, Any_Type
);
7265 -- Replace named numbers by corresponding literals. Note that this is
7266 -- the one case where Resolve_Entity_Name must reset the Etype, since
7267 -- it is currently marked as universal.
7269 if Ekind
(E
) = E_Named_Integer
then
7271 Eval_Named_Integer
(N
);
7273 elsif Ekind
(E
) = E_Named_Real
then
7275 Eval_Named_Real
(N
);
7277 -- For enumeration literals, we need to make sure that a proper style
7278 -- check is done, since such literals are overloaded, and thus we did
7279 -- not do a style check during the first phase of analysis.
7281 elsif Ekind
(E
) = E_Enumeration_Literal
then
7282 Set_Entity_With_Checks
(N
, E
);
7283 Eval_Entity_Name
(N
);
7285 -- Case of (sub)type name appearing in a context where an expression
7286 -- is expected. This is legal if occurrence is a current instance.
7287 -- See RM 8.6 (17/3).
7289 elsif Is_Type
(E
) then
7290 if Is_Current_Instance
(N
) then
7293 -- Any other use is an error
7297 ("invalid use of subtype mark in expression or call", N
);
7300 -- Check discriminant use if entity is discriminant in current scope,
7301 -- i.e. discriminant of record or concurrent type currently being
7302 -- analyzed. Uses in corresponding body are unrestricted.
7304 elsif Ekind
(E
) = E_Discriminant
7305 and then Scope
(E
) = Current_Scope
7306 and then not Has_Completion
(Current_Scope
)
7308 Check_Discriminant_Use
(N
);
7310 -- A parameterless generic function cannot appear in a context that
7311 -- requires resolution.
7313 elsif Ekind
(E
) = E_Generic_Function
then
7314 Error_Msg_N
("illegal use of generic function", N
);
7316 -- In Ada 83 an OUT parameter cannot be read, but attributes of
7317 -- array types (i.e. bounds and length) are legal.
7319 elsif Ekind
(E
) = E_Out_Parameter
7320 and then (Nkind
(Parent
(N
)) /= N_Attribute_Reference
7321 or else Is_Scalar_Type
(Etype
(E
)))
7323 and then (Nkind
(Parent
(N
)) in N_Op
7324 or else Nkind
(Parent
(N
)) = N_Explicit_Dereference
7325 or else Is_Assignment_Or_Object_Expression
7326 (Context
=> Parent
(N
),
7329 if Ada_Version
= Ada_83
then
7330 Error_Msg_N
("(Ada 83) illegal reading of out parameter", N
);
7333 -- In all other cases, just do the possible static evaluation
7336 -- A deferred constant that appears in an expression must have a
7337 -- completion, unless it has been removed by in-place expansion of
7338 -- an aggregate. A constant that is a renaming does not need
7341 if Ekind
(E
) = E_Constant
7342 and then Comes_From_Source
(E
)
7343 and then No
(Constant_Value
(E
))
7344 and then Is_Frozen
(Etype
(E
))
7345 and then not In_Spec_Expression
7346 and then not Is_Imported
(E
)
7347 and then Nkind
(Parent
(E
)) /= N_Object_Renaming_Declaration
7349 if No_Initialization
(Parent
(E
))
7350 or else (Present
(Full_View
(E
))
7351 and then No_Initialization
(Parent
(Full_View
(E
))))
7356 ("deferred constant is frozen before completion", N
);
7360 Eval_Entity_Name
(N
);
7365 -- When the entity appears in a parameter association, retrieve the
7366 -- related subprogram call.
7368 if Nkind
(Par
) = N_Parameter_Association
then
7369 Par
:= Parent
(Par
);
7372 if Comes_From_Source
(N
) then
7374 -- The following checks are only relevant when SPARK_Mode is on as
7375 -- they are not standard Ada legality rules.
7377 if SPARK_Mode
= On
then
7379 -- An effectively volatile object subject to enabled properties
7380 -- Async_Writers or Effective_Reads must appear in non-interfering
7381 -- context (SPARK RM 7.1.3(12)).
7384 and then Is_Effectively_Volatile
(E
)
7385 and then (Async_Writers_Enabled
(E
)
7386 or else Effective_Reads_Enabled
(E
))
7387 and then not Is_OK_Volatile_Context
(Par
, N
)
7390 ("volatile object cannot appear in this context "
7391 & "(SPARK RM 7.1.3(12))", N
);
7394 -- Check for possible elaboration issues with respect to reads of
7395 -- variables. The act of renaming the variable is not considered a
7396 -- read as it simply establishes an alias.
7398 if Legacy_Elaboration_Checks
7399 and then Ekind
(E
) = E_Variable
7400 and then Dynamic_Elaboration_Checks
7401 and then Nkind
(Par
) /= N_Object_Renaming_Declaration
7403 Check_Elab_Call
(N
);
7407 -- The variable may eventually become a constituent of a single
7408 -- protected/task type. Record the reference now and verify its
7409 -- legality when analyzing the contract of the variable
7412 if Ekind
(E
) = E_Variable
then
7413 Record_Possible_Part_Of_Reference
(E
, N
);
7416 -- A Ghost entity must appear in a specific context
7418 if Is_Ghost_Entity
(E
) then
7419 Check_Ghost_Context
(E
, N
);
7423 -- We may be resolving an entity within expanded code, so a reference to
7424 -- an entity should be ignored when calculating effective use clauses to
7425 -- avoid inappropriate marking.
7427 if Comes_From_Source
(N
) then
7428 Mark_Use_Clauses
(E
);
7430 end Resolve_Entity_Name
;
7436 procedure Resolve_Entry
(Entry_Name
: Node_Id
) is
7437 Loc
: constant Source_Ptr
:= Sloc
(Entry_Name
);
7445 function Actual_Index_Type
(E
: Entity_Id
) return Entity_Id
;
7446 -- If the bounds of the entry family being called depend on task
7447 -- discriminants, build a new index subtype where a discriminant is
7448 -- replaced with the value of the discriminant of the target task.
7449 -- The target task is the prefix of the entry name in the call.
7451 -----------------------
7452 -- Actual_Index_Type --
7453 -----------------------
7455 function Actual_Index_Type
(E
: Entity_Id
) return Entity_Id
is
7456 Typ
: constant Entity_Id
:= Entry_Index_Type
(E
);
7457 Tsk
: constant Entity_Id
:= Scope
(E
);
7458 Lo
: constant Node_Id
:= Type_Low_Bound
(Typ
);
7459 Hi
: constant Node_Id
:= Type_High_Bound
(Typ
);
7462 function Actual_Discriminant_Ref
(Bound
: Node_Id
) return Node_Id
;
7463 -- If the bound is given by a discriminant, replace with a reference
7464 -- to the discriminant of the same name in the target task. If the
7465 -- entry name is the target of a requeue statement and the entry is
7466 -- in the current protected object, the bound to be used is the
7467 -- discriminal of the object (see Apply_Range_Checks for details of
7468 -- the transformation).
7470 -----------------------------
7471 -- Actual_Discriminant_Ref --
7472 -----------------------------
7474 function Actual_Discriminant_Ref
(Bound
: Node_Id
) return Node_Id
is
7475 Typ
: constant Entity_Id
:= Etype
(Bound
);
7479 Remove_Side_Effects
(Bound
);
7481 if not Is_Entity_Name
(Bound
)
7482 or else Ekind
(Entity
(Bound
)) /= E_Discriminant
7486 elsif Is_Protected_Type
(Tsk
)
7487 and then In_Open_Scopes
(Tsk
)
7488 and then Nkind
(Parent
(Entry_Name
)) = N_Requeue_Statement
7490 -- Note: here Bound denotes a discriminant of the corresponding
7491 -- record type tskV, whose discriminal is a formal of the
7492 -- init-proc tskVIP. What we want is the body discriminal,
7493 -- which is associated to the discriminant of the original
7494 -- concurrent type tsk.
7496 return New_Occurrence_Of
7497 (Find_Body_Discriminal
(Entity
(Bound
)), Loc
);
7501 Make_Selected_Component
(Loc
,
7502 Prefix
=> New_Copy_Tree
(Prefix
(Prefix
(Entry_Name
))),
7503 Selector_Name
=> New_Occurrence_Of
(Entity
(Bound
), Loc
));
7508 end Actual_Discriminant_Ref
;
7510 -- Start of processing for Actual_Index_Type
7513 if not Has_Discriminants
(Tsk
)
7514 or else (not Is_Entity_Name
(Lo
) and then not Is_Entity_Name
(Hi
))
7516 return Entry_Index_Type
(E
);
7519 New_T
:= Create_Itype
(Ekind
(Typ
), Parent
(Entry_Name
));
7520 Set_Etype
(New_T
, Base_Type
(Typ
));
7521 Set_Size_Info
(New_T
, Typ
);
7522 Set_RM_Size
(New_T
, RM_Size
(Typ
));
7523 Set_Scalar_Range
(New_T
,
7524 Make_Range
(Sloc
(Entry_Name
),
7525 Low_Bound
=> Actual_Discriminant_Ref
(Lo
),
7526 High_Bound
=> Actual_Discriminant_Ref
(Hi
)));
7530 end Actual_Index_Type
;
7532 -- Start of processing for Resolve_Entry
7535 -- Find name of entry being called, and resolve prefix of name with its
7536 -- own type. The prefix can be overloaded, and the name and signature of
7537 -- the entry must be taken into account.
7539 if Nkind
(Entry_Name
) = N_Indexed_Component
then
7541 -- Case of dealing with entry family within the current tasks
7543 E_Name
:= Prefix
(Entry_Name
);
7546 E_Name
:= Entry_Name
;
7549 if Is_Entity_Name
(E_Name
) then
7551 -- Entry call to an entry (or entry family) in the current task. This
7552 -- is legal even though the task will deadlock. Rewrite as call to
7555 -- This can also be a call to an entry in an enclosing task. If this
7556 -- is a single task, we have to retrieve its name, because the scope
7557 -- of the entry is the task type, not the object. If the enclosing
7558 -- task is a task type, the identity of the task is given by its own
7561 -- Finally this can be a requeue on an entry of the same task or
7562 -- protected object.
7564 S
:= Scope
(Entity
(E_Name
));
7566 for J
in reverse 0 .. Scope_Stack
.Last
loop
7567 if Is_Task_Type
(Scope_Stack
.Table
(J
).Entity
)
7568 and then not Comes_From_Source
(S
)
7570 -- S is an enclosing task or protected object. The concurrent
7571 -- declaration has been converted into a type declaration, and
7572 -- the object itself has an object declaration that follows
7573 -- the type in the same declarative part.
7575 Tsk
:= Next_Entity
(S
);
7576 while Etype
(Tsk
) /= S
loop
7583 elsif S
= Scope_Stack
.Table
(J
).Entity
then
7585 -- Call to current task. Will be transformed into call to Self
7593 Make_Selected_Component
(Loc
,
7594 Prefix
=> New_Occurrence_Of
(S
, Loc
),
7596 New_Occurrence_Of
(Entity
(E_Name
), Loc
));
7597 Rewrite
(E_Name
, New_N
);
7600 elsif Nkind
(Entry_Name
) = N_Selected_Component
7601 and then Is_Overloaded
(Prefix
(Entry_Name
))
7603 -- Use the entry name (which must be unique at this point) to find
7604 -- the prefix that returns the corresponding task/protected type.
7607 Pref
: constant Node_Id
:= Prefix
(Entry_Name
);
7608 Ent
: constant Entity_Id
:= Entity
(Selector_Name
(Entry_Name
));
7613 Get_First_Interp
(Pref
, I
, It
);
7614 while Present
(It
.Typ
) loop
7615 if Scope
(Ent
) = It
.Typ
then
7616 Set_Etype
(Pref
, It
.Typ
);
7620 Get_Next_Interp
(I
, It
);
7625 if Nkind
(Entry_Name
) = N_Selected_Component
then
7626 Resolve
(Prefix
(Entry_Name
));
7628 else pragma Assert
(Nkind
(Entry_Name
) = N_Indexed_Component
);
7629 Nam
:= Entity
(Selector_Name
(Prefix
(Entry_Name
)));
7630 Resolve
(Prefix
(Prefix
(Entry_Name
)));
7631 Index
:= First
(Expressions
(Entry_Name
));
7632 Resolve
(Index
, Entry_Index_Type
(Nam
));
7634 -- Generate a reference for the index when it denotes an entity
7636 if Is_Entity_Name
(Index
) then
7637 Generate_Reference
(Entity
(Index
), Nam
);
7640 -- Up to this point the expression could have been the actual in a
7641 -- simple entry call, and be given by a named association.
7643 if Nkind
(Index
) = N_Parameter_Association
then
7644 Error_Msg_N
("expect expression for entry index", Index
);
7646 Apply_Range_Check
(Index
, Actual_Index_Type
(Nam
));
7651 ------------------------
7652 -- Resolve_Entry_Call --
7653 ------------------------
7655 procedure Resolve_Entry_Call
(N
: Node_Id
; Typ
: Entity_Id
) is
7656 Entry_Name
: constant Node_Id
:= Name
(N
);
7657 Loc
: constant Source_Ptr
:= Sloc
(Entry_Name
);
7665 -- We kill all checks here, because it does not seem worth the effort to
7666 -- do anything better, an entry call is a big operation.
7670 -- Processing of the name is similar for entry calls and protected
7671 -- operation calls. Once the entity is determined, we can complete
7672 -- the resolution of the actuals.
7674 -- The selector may be overloaded, in the case of a protected object
7675 -- with overloaded functions. The type of the context is used for
7678 if Nkind
(Entry_Name
) = N_Selected_Component
7679 and then Is_Overloaded
(Selector_Name
(Entry_Name
))
7680 and then Typ
/= Standard_Void_Type
7687 Get_First_Interp
(Selector_Name
(Entry_Name
), I
, It
);
7688 while Present
(It
.Typ
) loop
7689 if Covers
(Typ
, It
.Typ
) then
7690 Set_Entity
(Selector_Name
(Entry_Name
), It
.Nam
);
7691 Set_Etype
(Entry_Name
, It
.Typ
);
7693 Generate_Reference
(It
.Typ
, N
, ' ');
7696 Get_Next_Interp
(I
, It
);
7701 Resolve_Entry
(Entry_Name
);
7703 if Nkind
(Entry_Name
) = N_Selected_Component
then
7705 -- Simple entry or protected operation call
7707 Nam
:= Entity
(Selector_Name
(Entry_Name
));
7708 Obj
:= Prefix
(Entry_Name
);
7710 if Is_Subprogram
(Nam
) then
7711 Check_For_Eliminated_Subprogram
(Entry_Name
, Nam
);
7714 Was_Over
:= Is_Overloaded
(Selector_Name
(Entry_Name
));
7716 else pragma Assert
(Nkind
(Entry_Name
) = N_Indexed_Component
);
7718 -- Call to member of entry family
7720 Nam
:= Entity
(Selector_Name
(Prefix
(Entry_Name
)));
7721 Obj
:= Prefix
(Prefix
(Entry_Name
));
7722 Was_Over
:= Is_Overloaded
(Selector_Name
(Prefix
(Entry_Name
)));
7725 -- We cannot in general check the maximum depth of protected entry calls
7726 -- at compile time. But we can tell that any protected entry call at all
7727 -- violates a specified nesting depth of zero.
7729 if Is_Protected_Type
(Scope
(Nam
)) then
7730 Check_Restriction
(Max_Entry_Queue_Length
, N
);
7733 -- Use context type to disambiguate a protected function that can be
7734 -- called without actuals and that returns an array type, and where the
7735 -- argument list may be an indexing of the returned value.
7737 if Ekind
(Nam
) = E_Function
7738 and then Needs_No_Actuals
(Nam
)
7739 and then Present
(Parameter_Associations
(N
))
7741 ((Is_Array_Type
(Etype
(Nam
))
7742 and then Covers
(Typ
, Component_Type
(Etype
(Nam
))))
7744 or else (Is_Access_Type
(Etype
(Nam
))
7745 and then Is_Array_Type
(Designated_Type
(Etype
(Nam
)))
7749 Component_Type
(Designated_Type
(Etype
(Nam
))))))
7752 Index_Node
: Node_Id
;
7756 Make_Indexed_Component
(Loc
,
7758 Make_Function_Call
(Loc
, Name
=> Relocate_Node
(Entry_Name
)),
7759 Expressions
=> Parameter_Associations
(N
));
7761 -- Since we are correcting a node classification error made by the
7762 -- parser, we call Replace rather than Rewrite.
7764 Replace
(N
, Index_Node
);
7765 Set_Etype
(Prefix
(N
), Etype
(Nam
));
7767 Resolve_Indexed_Component
(N
, Typ
);
7772 if Ekind_In
(Nam
, E_Entry
, E_Entry_Family
)
7773 and then Present
(Contract_Wrapper
(Nam
))
7774 and then Current_Scope
/= Contract_Wrapper
(Nam
)
7776 -- Note the entity being called before rewriting the call, so that
7777 -- it appears used at this point.
7779 Generate_Reference
(Nam
, Entry_Name
, 'r');
7781 -- Rewrite as call to the precondition wrapper, adding the task
7782 -- object to the list of actuals. If the call is to a member of an
7783 -- entry family, include the index as well.
7787 New_Actuals
: List_Id
;
7790 New_Actuals
:= New_List
(Obj
);
7792 if Nkind
(Entry_Name
) = N_Indexed_Component
then
7793 Append_To
(New_Actuals
,
7794 New_Copy_Tree
(First
(Expressions
(Entry_Name
))));
7797 Append_List
(Parameter_Associations
(N
), New_Actuals
);
7799 Make_Procedure_Call_Statement
(Loc
,
7801 New_Occurrence_Of
(Contract_Wrapper
(Nam
), Loc
),
7802 Parameter_Associations
=> New_Actuals
);
7803 Rewrite
(N
, New_Call
);
7805 -- Preanalyze and resolve new call. Current procedure is called
7806 -- from Resolve_Call, after which expansion will take place.
7808 Preanalyze_And_Resolve
(N
);
7813 -- The operation name may have been overloaded. Order the actuals
7814 -- according to the formals of the resolved entity, and set the return
7815 -- type to that of the operation.
7818 Normalize_Actuals
(N
, Nam
, False, Norm_OK
);
7819 pragma Assert
(Norm_OK
);
7820 Set_Etype
(N
, Etype
(Nam
));
7822 -- Reset the Is_Overloaded flag, since resolution is now completed
7824 -- Simple entry call
7826 if Nkind
(Entry_Name
) = N_Selected_Component
then
7827 Set_Is_Overloaded
(Selector_Name
(Entry_Name
), False);
7829 -- Call to a member of an entry family
7831 else pragma Assert
(Nkind
(Entry_Name
) = N_Indexed_Component
);
7832 Set_Is_Overloaded
(Selector_Name
(Prefix
(Entry_Name
)), False);
7836 Resolve_Actuals
(N
, Nam
);
7837 Check_Internal_Protected_Use
(N
, Nam
);
7839 -- Create a call reference to the entry
7841 Generate_Reference
(Nam
, Entry_Name
, 's');
7843 if Ekind_In
(Nam
, E_Entry
, E_Entry_Family
) then
7844 Check_Potentially_Blocking_Operation
(N
);
7847 -- Verify that a procedure call cannot masquerade as an entry
7848 -- call where an entry call is expected.
7850 if Ekind
(Nam
) = E_Procedure
then
7851 if Nkind
(Parent
(N
)) = N_Entry_Call_Alternative
7852 and then N
= Entry_Call_Statement
(Parent
(N
))
7854 Error_Msg_N
("entry call required in select statement", N
);
7856 elsif Nkind
(Parent
(N
)) = N_Triggering_Alternative
7857 and then N
= Triggering_Statement
(Parent
(N
))
7859 Error_Msg_N
("triggering statement cannot be procedure call", N
);
7861 elsif Ekind
(Scope
(Nam
)) = E_Task_Type
7862 and then not In_Open_Scopes
(Scope
(Nam
))
7864 Error_Msg_N
("task has no entry with this name", Entry_Name
);
7868 -- After resolution, entry calls and protected procedure calls are
7869 -- changed into entry calls, for expansion. The structure of the node
7870 -- does not change, so it can safely be done in place. Protected
7871 -- function calls must keep their structure because they are
7874 if Ekind
(Nam
) /= E_Function
then
7876 -- A protected operation that is not a function may modify the
7877 -- corresponding object, and cannot apply to a constant. If this
7878 -- is an internal call, the prefix is the type itself.
7880 if Is_Protected_Type
(Scope
(Nam
))
7881 and then not Is_Variable
(Obj
)
7882 and then (not Is_Entity_Name
(Obj
)
7883 or else not Is_Type
(Entity
(Obj
)))
7886 ("prefix of protected procedure or entry call must be variable",
7891 Entry_Call
: Node_Id
;
7895 Make_Entry_Call_Statement
(Loc
,
7897 Parameter_Associations
=> Parameter_Associations
(N
));
7899 -- Inherit relevant attributes from the original call
7901 Set_First_Named_Actual
7902 (Entry_Call
, First_Named_Actual
(N
));
7904 Set_Is_Elaboration_Checks_OK_Node
7905 (Entry_Call
, Is_Elaboration_Checks_OK_Node
(N
));
7907 Set_Is_Elaboration_Warnings_OK_Node
7908 (Entry_Call
, Is_Elaboration_Warnings_OK_Node
(N
));
7910 Set_Is_SPARK_Mode_On_Node
7911 (Entry_Call
, Is_SPARK_Mode_On_Node
(N
));
7913 Rewrite
(N
, Entry_Call
);
7914 Set_Analyzed
(N
, True);
7917 -- Protected functions can return on the secondary stack, in which case
7918 -- we must trigger the transient scope mechanism.
7920 elsif Expander_Active
7921 and then Requires_Transient_Scope
(Etype
(Nam
))
7923 Establish_Transient_Scope
(N
, Manage_Sec_Stack
=> True);
7925 end Resolve_Entry_Call
;
7927 -------------------------
7928 -- Resolve_Equality_Op --
7929 -------------------------
7931 -- Both arguments must have the same type, and the boolean context does
7932 -- not participate in the resolution. The first pass verifies that the
7933 -- interpretation is not ambiguous, and the type of the left argument is
7934 -- correctly set, or is Any_Type in case of ambiguity. If both arguments
7935 -- are strings or aggregates, allocators, or Null, they are ambiguous even
7936 -- though they carry a single (universal) type. Diagnose this case here.
7938 procedure Resolve_Equality_Op
(N
: Node_Id
; Typ
: Entity_Id
) is
7939 L
: constant Node_Id
:= Left_Opnd
(N
);
7940 R
: constant Node_Id
:= Right_Opnd
(N
);
7941 T
: Entity_Id
:= Find_Unique_Type
(L
, R
);
7943 procedure Check_If_Expression
(Cond
: Node_Id
);
7944 -- The resolution rule for if expressions requires that each such must
7945 -- have a unique type. This means that if several dependent expressions
7946 -- are of a non-null anonymous access type, and the context does not
7947 -- impose an expected type (as can be the case in an equality operation)
7948 -- the expression must be rejected.
7950 procedure Explain_Redundancy
(N
: Node_Id
);
7951 -- Attempt to explain the nature of a redundant comparison with True. If
7952 -- the expression N is too complex, this routine issues a general error
7955 function Find_Unique_Access_Type
return Entity_Id
;
7956 -- In the case of allocators and access attributes, the context must
7957 -- provide an indication of the specific access type to be used. If
7958 -- one operand is of such a "generic" access type, check whether there
7959 -- is a specific visible access type that has the same designated type.
7960 -- This is semantically dubious, and of no interest to any real code,
7961 -- but c48008a makes it all worthwhile.
7963 -------------------------
7964 -- Check_If_Expression --
7965 -------------------------
7967 procedure Check_If_Expression
(Cond
: Node_Id
) is
7968 Then_Expr
: Node_Id
;
7969 Else_Expr
: Node_Id
;
7972 if Nkind
(Cond
) = N_If_Expression
then
7973 Then_Expr
:= Next
(First
(Expressions
(Cond
)));
7974 Else_Expr
:= Next
(Then_Expr
);
7976 if Nkind
(Then_Expr
) /= N_Null
7977 and then Nkind
(Else_Expr
) /= N_Null
7979 Error_Msg_N
("cannot determine type of if expression", Cond
);
7982 end Check_If_Expression
;
7984 ------------------------
7985 -- Explain_Redundancy --
7986 ------------------------
7988 procedure Explain_Redundancy
(N
: Node_Id
) is
7996 -- Strip the operand down to an entity
7999 if Nkind
(Val
) = N_Selected_Component
then
8000 Val
:= Selector_Name
(Val
);
8006 -- The construct denotes an entity
8008 if Is_Entity_Name
(Val
) and then Present
(Entity
(Val
)) then
8009 Val_Id
:= Entity
(Val
);
8011 -- Do not generate an error message when the comparison is done
8012 -- against the enumeration literal Standard.True.
8014 if Ekind
(Val_Id
) /= E_Enumeration_Literal
then
8016 -- Build a customized error message
8019 Add_Str_To_Name_Buffer
("?r?");
8021 if Ekind
(Val_Id
) = E_Component
then
8022 Add_Str_To_Name_Buffer
("component ");
8024 elsif Ekind
(Val_Id
) = E_Constant
then
8025 Add_Str_To_Name_Buffer
("constant ");
8027 elsif Ekind
(Val_Id
) = E_Discriminant
then
8028 Add_Str_To_Name_Buffer
("discriminant ");
8030 elsif Is_Formal
(Val_Id
) then
8031 Add_Str_To_Name_Buffer
("parameter ");
8033 elsif Ekind
(Val_Id
) = E_Variable
then
8034 Add_Str_To_Name_Buffer
("variable ");
8037 Add_Str_To_Name_Buffer
("& is always True!");
8040 Error_Msg_NE
(Get_Name_String
(Error
), Val
, Val_Id
);
8043 -- The construct is too complex to disect, issue a general message
8046 Error_Msg_N
("?r?expression is always True!", Val
);
8048 end Explain_Redundancy
;
8050 -----------------------------
8051 -- Find_Unique_Access_Type --
8052 -----------------------------
8054 function Find_Unique_Access_Type
return Entity_Id
is
8060 if Ekind_In
(Etype
(R
), E_Allocator_Type
,
8061 E_Access_Attribute_Type
)
8063 Acc
:= Designated_Type
(Etype
(R
));
8065 elsif Ekind_In
(Etype
(L
), E_Allocator_Type
,
8066 E_Access_Attribute_Type
)
8068 Acc
:= Designated_Type
(Etype
(L
));
8074 while S
/= Standard_Standard
loop
8075 E
:= First_Entity
(S
);
8076 while Present
(E
) loop
8078 and then Is_Access_Type
(E
)
8079 and then Ekind
(E
) /= E_Allocator_Type
8080 and then Designated_Type
(E
) = Base_Type
(Acc
)
8092 end Find_Unique_Access_Type
;
8094 -- Start of processing for Resolve_Equality_Op
8097 Set_Etype
(N
, Base_Type
(Typ
));
8098 Generate_Reference
(T
, N
, ' ');
8100 if T
= Any_Fixed
then
8101 T
:= Unique_Fixed_Point_Type
(L
);
8104 if T
/= Any_Type
then
8105 if T
= Any_String
or else
8106 T
= Any_Composite
or else
8109 if T
= Any_Character
then
8110 Ambiguous_Character
(L
);
8112 Error_Msg_N
("ambiguous operands for equality", N
);
8115 Set_Etype
(N
, Any_Type
);
8118 elsif T
= Any_Access
8119 or else Ekind_In
(T
, E_Allocator_Type
, E_Access_Attribute_Type
)
8121 T
:= Find_Unique_Access_Type
;
8124 Error_Msg_N
("ambiguous operands for equality", N
);
8125 Set_Etype
(N
, Any_Type
);
8129 -- If expressions must have a single type, and if the context does
8130 -- not impose one the dependent expressions cannot be anonymous
8133 -- Why no similar processing for case expressions???
8135 elsif Ada_Version
>= Ada_2012
8136 and then Ekind_In
(Etype
(L
), E_Anonymous_Access_Type
,
8137 E_Anonymous_Access_Subprogram_Type
)
8138 and then Ekind_In
(Etype
(R
), E_Anonymous_Access_Type
,
8139 E_Anonymous_Access_Subprogram_Type
)
8141 Check_If_Expression
(L
);
8142 Check_If_Expression
(R
);
8148 -- In SPARK, equality operators = and /= for array types other than
8149 -- String are only defined when, for each index position, the
8150 -- operands have equal static bounds.
8152 if Is_Array_Type
(T
) then
8154 -- Protect call to Matching_Static_Array_Bounds to avoid costly
8155 -- operation if not needed.
8157 if Restriction_Check_Required
(SPARK_05
)
8158 and then Base_Type
(T
) /= Standard_String
8159 and then Base_Type
(Etype
(L
)) = Base_Type
(Etype
(R
))
8160 and then Etype
(L
) /= Any_Composite
-- or else L in error
8161 and then Etype
(R
) /= Any_Composite
-- or else R in error
8162 and then not Matching_Static_Array_Bounds
(Etype
(L
), Etype
(R
))
8164 Check_SPARK_05_Restriction
8165 ("array types should have matching static bounds", N
);
8169 -- If the unique type is a class-wide type then it will be expanded
8170 -- into a dispatching call to the predefined primitive. Therefore we
8171 -- check here for potential violation of such restriction.
8173 if Is_Class_Wide_Type
(T
) then
8174 Check_Restriction
(No_Dispatching_Calls
, N
);
8177 -- Only warn for redundant equality comparison to True for objects
8178 -- (e.g. "X = True") and operations (e.g. "(X < Y) = True"). For
8179 -- other expressions, it may be a matter of preference to write
8180 -- "Expr = True" or "Expr".
8182 if Warn_On_Redundant_Constructs
8183 and then Comes_From_Source
(N
)
8184 and then Comes_From_Source
(R
)
8185 and then Is_Entity_Name
(R
)
8186 and then Entity
(R
) = Standard_True
8188 ((Is_Entity_Name
(L
) and then Is_Object
(Entity
(L
)))
8192 Error_Msg_N
-- CODEFIX
8193 ("?r?comparison with True is redundant!", N
);
8194 Explain_Redundancy
(Original_Node
(R
));
8197 Check_Unset_Reference
(L
);
8198 Check_Unset_Reference
(R
);
8199 Generate_Operator_Reference
(N
, T
);
8200 Check_Low_Bound_Tested
(N
);
8202 -- If this is an inequality, it may be the implicit inequality
8203 -- created for a user-defined operation, in which case the corres-
8204 -- ponding equality operation is not intrinsic, and the operation
8205 -- cannot be constant-folded. Else fold.
8207 if Nkind
(N
) = N_Op_Eq
8208 or else Comes_From_Source
(Entity
(N
))
8209 or else Ekind
(Entity
(N
)) = E_Operator
8210 or else Is_Intrinsic_Subprogram
8211 (Corresponding_Equality
(Entity
(N
)))
8213 Analyze_Dimension
(N
);
8214 Eval_Relational_Op
(N
);
8216 elsif Nkind
(N
) = N_Op_Ne
8217 and then Is_Abstract_Subprogram
(Entity
(N
))
8219 Error_Msg_NE
("cannot call abstract subprogram &!", N
, Entity
(N
));
8222 -- Ada 2005: If one operand is an anonymous access type, convert the
8223 -- other operand to it, to ensure that the underlying types match in
8224 -- the back-end. Same for access_to_subprogram, and the conversion
8225 -- verifies that the types are subtype conformant.
8227 -- We apply the same conversion in the case one of the operands is a
8228 -- private subtype of the type of the other.
8230 -- Why the Expander_Active test here ???
8234 (Ekind_In
(T
, E_Anonymous_Access_Type
,
8235 E_Anonymous_Access_Subprogram_Type
)
8236 or else Is_Private_Type
(T
))
8238 if Etype
(L
) /= T
then
8240 Make_Unchecked_Type_Conversion
(Sloc
(L
),
8241 Subtype_Mark
=> New_Occurrence_Of
(T
, Sloc
(L
)),
8242 Expression
=> Relocate_Node
(L
)));
8243 Analyze_And_Resolve
(L
, T
);
8246 if (Etype
(R
)) /= T
then
8248 Make_Unchecked_Type_Conversion
(Sloc
(R
),
8249 Subtype_Mark
=> New_Occurrence_Of
(Etype
(L
), Sloc
(R
)),
8250 Expression
=> Relocate_Node
(R
)));
8251 Analyze_And_Resolve
(R
, T
);
8255 end Resolve_Equality_Op
;
8257 ----------------------------------
8258 -- Resolve_Explicit_Dereference --
8259 ----------------------------------
8261 procedure Resolve_Explicit_Dereference
(N
: Node_Id
; Typ
: Entity_Id
) is
8262 Loc
: constant Source_Ptr
:= Sloc
(N
);
8264 P
: constant Node_Id
:= Prefix
(N
);
8267 -- The candidate prefix type, if overloaded
8273 Check_Fully_Declared_Prefix
(Typ
, P
);
8276 -- A useful optimization: check whether the dereference denotes an
8277 -- element of a container, and if so rewrite it as a call to the
8278 -- corresponding Element function.
8280 -- Disabled for now, on advice of ARG. A more restricted form of the
8281 -- predicate might be acceptable ???
8283 -- if Is_Container_Element (N) then
8287 if Is_Overloaded
(P
) then
8289 -- Use the context type to select the prefix that has the correct
8290 -- designated type. Keep the first match, which will be the inner-
8293 Get_First_Interp
(P
, I
, It
);
8295 while Present
(It
.Typ
) loop
8296 if Is_Access_Type
(It
.Typ
)
8297 and then Covers
(Typ
, Designated_Type
(It
.Typ
))
8303 -- Remove access types that do not match, but preserve access
8304 -- to subprogram interpretations, in case a further dereference
8305 -- is needed (see below).
8307 elsif Ekind
(It
.Typ
) /= E_Access_Subprogram_Type
then
8311 Get_Next_Interp
(I
, It
);
8314 if Present
(P_Typ
) then
8316 Set_Etype
(N
, Designated_Type
(P_Typ
));
8319 -- If no interpretation covers the designated type of the prefix,
8320 -- this is the pathological case where not all implementations of
8321 -- the prefix allow the interpretation of the node as a call. Now
8322 -- that the expected type is known, Remove other interpretations
8323 -- from prefix, rewrite it as a call, and resolve again, so that
8324 -- the proper call node is generated.
8326 Get_First_Interp
(P
, I
, It
);
8327 while Present
(It
.Typ
) loop
8328 if Ekind
(It
.Typ
) /= E_Access_Subprogram_Type
then
8332 Get_Next_Interp
(I
, It
);
8336 Make_Function_Call
(Loc
,
8338 Make_Explicit_Dereference
(Loc
,
8340 Parameter_Associations
=> New_List
);
8342 Save_Interps
(N
, New_N
);
8344 Analyze_And_Resolve
(N
, Typ
);
8348 -- If not overloaded, resolve P with its own type
8354 -- If the prefix might be null, add an access check
8356 if Is_Access_Type
(Etype
(P
))
8357 and then not Can_Never_Be_Null
(Etype
(P
))
8359 Apply_Access_Check
(N
);
8362 -- If the designated type is a packed unconstrained array type, and the
8363 -- explicit dereference is not in the context of an attribute reference,
8364 -- then we must compute and set the actual subtype, since it is needed
8365 -- by Gigi. The reason we exclude the attribute case is that this is
8366 -- handled fine by Gigi, and in fact we use such attributes to build the
8367 -- actual subtype. We also exclude generated code (which builds actual
8368 -- subtypes directly if they are needed).
8370 if Is_Array_Type
(Etype
(N
))
8371 and then Is_Packed
(Etype
(N
))
8372 and then not Is_Constrained
(Etype
(N
))
8373 and then Nkind
(Parent
(N
)) /= N_Attribute_Reference
8374 and then Comes_From_Source
(N
)
8376 Set_Etype
(N
, Get_Actual_Subtype
(N
));
8379 Analyze_Dimension
(N
);
8381 -- Note: No Eval processing is required for an explicit dereference,
8382 -- because such a name can never be static.
8384 end Resolve_Explicit_Dereference
;
8386 -------------------------------------
8387 -- Resolve_Expression_With_Actions --
8388 -------------------------------------
8390 procedure Resolve_Expression_With_Actions
(N
: Node_Id
; Typ
: Entity_Id
) is
8394 -- If N has no actions, and its expression has been constant folded,
8395 -- then rewrite N as just its expression. Note, we can't do this in
8396 -- the general case of Is_Empty_List (Actions (N)) as this would cause
8397 -- Expression (N) to be expanded again.
8399 if Is_Empty_List
(Actions
(N
))
8400 and then Compile_Time_Known_Value
(Expression
(N
))
8402 Rewrite
(N
, Expression
(N
));
8404 end Resolve_Expression_With_Actions
;
8406 ----------------------------------
8407 -- Resolve_Generalized_Indexing --
8408 ----------------------------------
8410 procedure Resolve_Generalized_Indexing
(N
: Node_Id
; Typ
: Entity_Id
) is
8411 Indexing
: constant Node_Id
:= Generalized_Indexing
(N
);
8417 -- In ASIS mode, propagate the information about the indexes back to
8418 -- to the original indexing node. The generalized indexing is either
8419 -- a function call, or a dereference of one. The actuals include the
8420 -- prefix of the original node, which is the container expression.
8423 Resolve
(Indexing
, Typ
);
8424 Set_Etype
(N
, Etype
(Indexing
));
8425 Set_Is_Overloaded
(N
, False);
8428 while Nkind_In
(Call
, N_Explicit_Dereference
, N_Selected_Component
)
8430 Call
:= Prefix
(Call
);
8433 if Nkind
(Call
) = N_Function_Call
then
8434 Indexes
:= New_Copy_List
(Parameter_Associations
(Call
));
8435 Pref
:= Remove_Head
(Indexes
);
8436 Set_Expressions
(N
, Indexes
);
8438 -- If expression is to be reanalyzed, reset Generalized_Indexing
8439 -- to recreate call node, as is the case when the expression is
8440 -- part of an expression function.
8442 if In_Spec_Expression
then
8443 Set_Generalized_Indexing
(N
, Empty
);
8446 Set_Prefix
(N
, Pref
);
8450 Rewrite
(N
, Indexing
);
8453 end Resolve_Generalized_Indexing
;
8455 ---------------------------
8456 -- Resolve_If_Expression --
8457 ---------------------------
8459 procedure Resolve_If_Expression
(N
: Node_Id
; Typ
: Entity_Id
) is
8460 Condition
: constant Node_Id
:= First
(Expressions
(N
));
8461 Then_Expr
: Node_Id
;
8462 Else_Expr
: Node_Id
;
8464 procedure Apply_Check
(Expr
: Node_Id
);
8465 -- When a dependent expression is of a subtype different from the
8466 -- context subtype, then insert a qualification to ensure the
8467 -- generation of a constraint check. This was previously done only
8468 -- for scalar types.
8474 procedure Apply_Check
(Expr
: Node_Id
) is
8475 Loc
: constant Source_Ptr
:= Sloc
(Expr
);
8476 Expr_Type
: constant Entity_Id
:= Etype
(Expr
);
8480 and then not Is_Tagged_Type
(Typ
)
8481 and then not Is_Access_Type
(Typ
)
8482 and then Is_Constrained
(Typ
)
8483 and then not Inside_A_Generic
8486 Make_Qualified_Expression
(Loc
,
8487 Subtype_Mark
=> New_Occurrence_Of
(Typ
, Loc
),
8488 Expression
=> Relocate_Node
(Expr
)));
8489 Analyze_And_Resolve
(Expr
, Typ
);
8494 -- Defend against malformed expressions
8496 if No
(Condition
) then
8500 Then_Expr
:= Next
(Condition
);
8502 if No
(Then_Expr
) then
8506 Else_Expr
:= Next
(Then_Expr
);
8508 Resolve
(Condition
, Any_Boolean
);
8509 Resolve
(Then_Expr
, Typ
);
8510 Apply_Check
(Then_Expr
);
8512 -- If ELSE expression present, just resolve using the determined type
8513 -- If type is universal, resolve to any member of the class.
8515 if Present
(Else_Expr
) then
8516 if Typ
= Universal_Integer
then
8517 Resolve
(Else_Expr
, Any_Integer
);
8519 elsif Typ
= Universal_Real
then
8520 Resolve
(Else_Expr
, Any_Real
);
8523 Resolve
(Else_Expr
, Typ
);
8526 Apply_Check
(Else_Expr
);
8528 -- Apply RM 4.5.7 (17/3): whether the expression is statically or
8529 -- dynamically tagged must be known statically.
8531 if Is_Tagged_Type
(Typ
) and then not Is_Class_Wide_Type
(Typ
) then
8532 if Is_Dynamically_Tagged
(Then_Expr
) /=
8533 Is_Dynamically_Tagged
(Else_Expr
)
8535 Error_Msg_N
("all or none of the dependent expressions "
8536 & "can be dynamically tagged", N
);
8540 -- If no ELSE expression is present, root type must be Standard.Boolean
8541 -- and we provide a Standard.True result converted to the appropriate
8542 -- Boolean type (in case it is a derived boolean type).
8544 elsif Root_Type
(Typ
) = Standard_Boolean
then
8546 Convert_To
(Typ
, New_Occurrence_Of
(Standard_True
, Sloc
(N
)));
8547 Analyze_And_Resolve
(Else_Expr
, Typ
);
8548 Append_To
(Expressions
(N
), Else_Expr
);
8551 Error_Msg_N
("can only omit ELSE expression in Boolean case", N
);
8552 Append_To
(Expressions
(N
), Error
);
8557 if not Error_Posted
(N
) then
8558 Eval_If_Expression
(N
);
8561 Analyze_Dimension
(N
);
8562 end Resolve_If_Expression
;
8564 -------------------------------
8565 -- Resolve_Indexed_Component --
8566 -------------------------------
8568 procedure Resolve_Indexed_Component
(N
: Node_Id
; Typ
: Entity_Id
) is
8569 Name
: constant Node_Id
:= Prefix
(N
);
8571 Array_Type
: Entity_Id
:= Empty
; -- to prevent junk warning
8575 if Present
(Generalized_Indexing
(N
)) then
8576 Resolve_Generalized_Indexing
(N
, Typ
);
8580 if Is_Overloaded
(Name
) then
8582 -- Use the context type to select the prefix that yields the correct
8588 I1
: Interp_Index
:= 0;
8589 P
: constant Node_Id
:= Prefix
(N
);
8590 Found
: Boolean := False;
8593 Get_First_Interp
(P
, I
, It
);
8594 while Present
(It
.Typ
) loop
8595 if (Is_Array_Type
(It
.Typ
)
8596 and then Covers
(Typ
, Component_Type
(It
.Typ
)))
8597 or else (Is_Access_Type
(It
.Typ
)
8598 and then Is_Array_Type
(Designated_Type
(It
.Typ
))
8602 Component_Type
(Designated_Type
(It
.Typ
))))
8605 It
:= Disambiguate
(P
, I1
, I
, Any_Type
);
8607 if It
= No_Interp
then
8608 Error_Msg_N
("ambiguous prefix for indexing", N
);
8614 Array_Type
:= It
.Typ
;
8620 Array_Type
:= It
.Typ
;
8625 Get_Next_Interp
(I
, It
);
8630 Array_Type
:= Etype
(Name
);
8633 Resolve
(Name
, Array_Type
);
8634 Array_Type
:= Get_Actual_Subtype_If_Available
(Name
);
8636 -- If prefix is access type, dereference to get real array type.
8637 -- Note: we do not apply an access check because the expander always
8638 -- introduces an explicit dereference, and the check will happen there.
8640 if Is_Access_Type
(Array_Type
) then
8641 Array_Type
:= Designated_Type
(Array_Type
);
8644 -- If name was overloaded, set component type correctly now
8645 -- If a misplaced call to an entry family (which has no index types)
8646 -- return. Error will be diagnosed from calling context.
8648 if Is_Array_Type
(Array_Type
) then
8649 Set_Etype
(N
, Component_Type
(Array_Type
));
8654 Index
:= First_Index
(Array_Type
);
8655 Expr
:= First
(Expressions
(N
));
8657 -- The prefix may have resolved to a string literal, in which case its
8658 -- etype has a special representation. This is only possible currently
8659 -- if the prefix is a static concatenation, written in functional
8662 if Ekind
(Array_Type
) = E_String_Literal_Subtype
then
8663 Resolve
(Expr
, Standard_Positive
);
8666 while Present
(Index
) and Present
(Expr
) loop
8667 Resolve
(Expr
, Etype
(Index
));
8668 Check_Unset_Reference
(Expr
);
8670 if Is_Scalar_Type
(Etype
(Expr
)) then
8671 Apply_Scalar_Range_Check
(Expr
, Etype
(Index
));
8673 Apply_Range_Check
(Expr
, Get_Actual_Subtype
(Index
));
8681 Analyze_Dimension
(N
);
8683 -- Do not generate the warning on suspicious index if we are analyzing
8684 -- package Ada.Tags; otherwise we will report the warning with the
8685 -- Prims_Ptr field of the dispatch table.
8687 if Scope
(Etype
(Prefix
(N
))) = Standard_Standard
8689 Is_RTU
(Cunit_Entity
(Get_Source_Unit
(Etype
(Prefix
(N
)))),
8692 Warn_On_Suspicious_Index
(Name
, First
(Expressions
(N
)));
8693 Eval_Indexed_Component
(N
);
8696 -- If the array type is atomic, and the component is not atomic, then
8697 -- this is worth a warning, since we have a situation where the access
8698 -- to the component may cause extra read/writes of the atomic array
8699 -- object, or partial word accesses, which could be unexpected.
8701 if Nkind
(N
) = N_Indexed_Component
8702 and then Is_Atomic_Ref_With_Address
(N
)
8703 and then not (Has_Atomic_Components
(Array_Type
)
8704 or else (Is_Entity_Name
(Prefix
(N
))
8705 and then Has_Atomic_Components
8706 (Entity
(Prefix
(N
)))))
8707 and then not Is_Atomic
(Component_Type
(Array_Type
))
8710 ("??access to non-atomic component of atomic array", Prefix
(N
));
8712 ("??\may cause unexpected accesses to atomic object", Prefix
(N
));
8714 end Resolve_Indexed_Component
;
8716 -----------------------------
8717 -- Resolve_Integer_Literal --
8718 -----------------------------
8720 procedure Resolve_Integer_Literal
(N
: Node_Id
; Typ
: Entity_Id
) is
8723 Eval_Integer_Literal
(N
);
8724 end Resolve_Integer_Literal
;
8726 --------------------------------
8727 -- Resolve_Intrinsic_Operator --
8728 --------------------------------
8730 procedure Resolve_Intrinsic_Operator
(N
: Node_Id
; Typ
: Entity_Id
) is
8731 Btyp
: constant Entity_Id
:= Base_Type
(Underlying_Type
(Typ
));
8736 function Convert_Operand
(Opnd
: Node_Id
) return Node_Id
;
8737 -- If the operand is a literal, it cannot be the expression in a
8738 -- conversion. Use a qualified expression instead.
8740 ---------------------
8741 -- Convert_Operand --
8742 ---------------------
8744 function Convert_Operand
(Opnd
: Node_Id
) return Node_Id
is
8745 Loc
: constant Source_Ptr
:= Sloc
(Opnd
);
8749 if Nkind_In
(Opnd
, N_Integer_Literal
, N_Real_Literal
) then
8751 Make_Qualified_Expression
(Loc
,
8752 Subtype_Mark
=> New_Occurrence_Of
(Btyp
, Loc
),
8753 Expression
=> Relocate_Node
(Opnd
));
8757 Res
:= Unchecked_Convert_To
(Btyp
, Opnd
);
8761 end Convert_Operand
;
8763 -- Start of processing for Resolve_Intrinsic_Operator
8766 -- We must preserve the original entity in a generic setting, so that
8767 -- the legality of the operation can be verified in an instance.
8769 if not Expander_Active
then
8774 while Scope
(Op
) /= Standard_Standard
loop
8776 pragma Assert
(Present
(Op
));
8780 Set_Is_Overloaded
(N
, False);
8782 -- If the result or operand types are private, rewrite with unchecked
8783 -- conversions on the operands and the result, to expose the proper
8784 -- underlying numeric type.
8786 if Is_Private_Type
(Typ
)
8787 or else Is_Private_Type
(Etype
(Left_Opnd
(N
)))
8788 or else Is_Private_Type
(Etype
(Right_Opnd
(N
)))
8790 Arg1
:= Convert_Operand
(Left_Opnd
(N
));
8792 if Nkind
(N
) = N_Op_Expon
then
8793 Arg2
:= Unchecked_Convert_To
(Standard_Integer
, Right_Opnd
(N
));
8795 Arg2
:= Convert_Operand
(Right_Opnd
(N
));
8798 if Nkind
(Arg1
) = N_Type_Conversion
then
8799 Save_Interps
(Left_Opnd
(N
), Expression
(Arg1
));
8802 if Nkind
(Arg2
) = N_Type_Conversion
then
8803 Save_Interps
(Right_Opnd
(N
), Expression
(Arg2
));
8806 Set_Left_Opnd
(N
, Arg1
);
8807 Set_Right_Opnd
(N
, Arg2
);
8809 Set_Etype
(N
, Btyp
);
8810 Rewrite
(N
, Unchecked_Convert_To
(Typ
, N
));
8813 elsif Typ
/= Etype
(Left_Opnd
(N
))
8814 or else Typ
/= Etype
(Right_Opnd
(N
))
8816 -- Add explicit conversion where needed, and save interpretations in
8817 -- case operands are overloaded.
8819 Arg1
:= Convert_To
(Typ
, Left_Opnd
(N
));
8820 Arg2
:= Convert_To
(Typ
, Right_Opnd
(N
));
8822 if Nkind
(Arg1
) = N_Type_Conversion
then
8823 Save_Interps
(Left_Opnd
(N
), Expression
(Arg1
));
8825 Save_Interps
(Left_Opnd
(N
), Arg1
);
8828 if Nkind
(Arg2
) = N_Type_Conversion
then
8829 Save_Interps
(Right_Opnd
(N
), Expression
(Arg2
));
8831 Save_Interps
(Right_Opnd
(N
), Arg2
);
8834 Rewrite
(Left_Opnd
(N
), Arg1
);
8835 Rewrite
(Right_Opnd
(N
), Arg2
);
8838 Resolve_Arithmetic_Op
(N
, Typ
);
8841 Resolve_Arithmetic_Op
(N
, Typ
);
8843 end Resolve_Intrinsic_Operator
;
8845 --------------------------------------
8846 -- Resolve_Intrinsic_Unary_Operator --
8847 --------------------------------------
8849 procedure Resolve_Intrinsic_Unary_Operator
8853 Btyp
: constant Entity_Id
:= Base_Type
(Underlying_Type
(Typ
));
8859 while Scope
(Op
) /= Standard_Standard
loop
8861 pragma Assert
(Present
(Op
));
8866 if Is_Private_Type
(Typ
) then
8867 Arg2
:= Unchecked_Convert_To
(Btyp
, Right_Opnd
(N
));
8868 Save_Interps
(Right_Opnd
(N
), Expression
(Arg2
));
8870 Set_Right_Opnd
(N
, Arg2
);
8872 Set_Etype
(N
, Btyp
);
8873 Rewrite
(N
, Unchecked_Convert_To
(Typ
, N
));
8877 Resolve_Unary_Op
(N
, Typ
);
8879 end Resolve_Intrinsic_Unary_Operator
;
8881 ------------------------
8882 -- Resolve_Logical_Op --
8883 ------------------------
8885 procedure Resolve_Logical_Op
(N
: Node_Id
; Typ
: Entity_Id
) is
8889 Check_No_Direct_Boolean_Operators
(N
);
8891 -- Predefined operations on scalar types yield the base type. On the
8892 -- other hand, logical operations on arrays yield the type of the
8893 -- arguments (and the context).
8895 if Is_Array_Type
(Typ
) then
8898 B_Typ
:= Base_Type
(Typ
);
8901 -- The following test is required because the operands of the operation
8902 -- may be literals, in which case the resulting type appears to be
8903 -- compatible with a signed integer type, when in fact it is compatible
8904 -- only with modular types. If the context itself is universal, the
8905 -- operation is illegal.
8907 if not Valid_Boolean_Arg
(Typ
) then
8908 Error_Msg_N
("invalid context for logical operation", N
);
8909 Set_Etype
(N
, Any_Type
);
8912 elsif Typ
= Any_Modular
then
8914 ("no modular type available in this context", N
);
8915 Set_Etype
(N
, Any_Type
);
8918 elsif Is_Modular_Integer_Type
(Typ
)
8919 and then Etype
(Left_Opnd
(N
)) = Universal_Integer
8920 and then Etype
(Right_Opnd
(N
)) = Universal_Integer
8922 Check_For_Visible_Operator
(N
, B_Typ
);
8925 -- Replace AND by AND THEN, or OR by OR ELSE, if Short_Circuit_And_Or
8926 -- is active and the result type is standard Boolean (do not mess with
8927 -- ops that return a nonstandard Boolean type, because something strange
8930 -- Note: you might expect this replacement to be done during expansion,
8931 -- but that doesn't work, because when the pragma Short_Circuit_And_Or
8932 -- is used, no part of the right operand of an "and" or "or" operator
8933 -- should be executed if the left operand would short-circuit the
8934 -- evaluation of the corresponding "and then" or "or else". If we left
8935 -- the replacement to expansion time, then run-time checks associated
8936 -- with such operands would be evaluated unconditionally, due to being
8937 -- before the condition prior to the rewriting as short-circuit forms
8938 -- during expansion.
8940 if Short_Circuit_And_Or
8941 and then B_Typ
= Standard_Boolean
8942 and then Nkind_In
(N
, N_Op_And
, N_Op_Or
)
8944 -- Mark the corresponding putative SCO operator as truly a logical
8945 -- (and short-circuit) operator.
8947 if Generate_SCO
and then Comes_From_Source
(N
) then
8948 Set_SCO_Logical_Operator
(N
);
8951 if Nkind
(N
) = N_Op_And
then
8953 Make_And_Then
(Sloc
(N
),
8954 Left_Opnd
=> Relocate_Node
(Left_Opnd
(N
)),
8955 Right_Opnd
=> Relocate_Node
(Right_Opnd
(N
))));
8956 Analyze_And_Resolve
(N
, B_Typ
);
8958 -- Case of OR changed to OR ELSE
8962 Make_Or_Else
(Sloc
(N
),
8963 Left_Opnd
=> Relocate_Node
(Left_Opnd
(N
)),
8964 Right_Opnd
=> Relocate_Node
(Right_Opnd
(N
))));
8965 Analyze_And_Resolve
(N
, B_Typ
);
8968 -- Return now, since analysis of the rewritten ops will take care of
8969 -- other reference bookkeeping and expression folding.
8974 Resolve
(Left_Opnd
(N
), B_Typ
);
8975 Resolve
(Right_Opnd
(N
), B_Typ
);
8977 Check_Unset_Reference
(Left_Opnd
(N
));
8978 Check_Unset_Reference
(Right_Opnd
(N
));
8980 Set_Etype
(N
, B_Typ
);
8981 Generate_Operator_Reference
(N
, B_Typ
);
8982 Eval_Logical_Op
(N
);
8984 -- In SPARK, logical operations AND, OR and XOR for arrays are defined
8985 -- only when both operands have same static lower and higher bounds. Of
8986 -- course the types have to match, so only check if operands are
8987 -- compatible and the node itself has no errors.
8989 if Is_Array_Type
(B_Typ
)
8990 and then Nkind
(N
) in N_Binary_Op
8993 Left_Typ
: constant Node_Id
:= Etype
(Left_Opnd
(N
));
8994 Right_Typ
: constant Node_Id
:= Etype
(Right_Opnd
(N
));
8997 -- Protect call to Matching_Static_Array_Bounds to avoid costly
8998 -- operation if not needed.
9000 if Restriction_Check_Required
(SPARK_05
)
9001 and then Base_Type
(Left_Typ
) = Base_Type
(Right_Typ
)
9002 and then Left_Typ
/= Any_Composite
-- or Left_Opnd in error
9003 and then Right_Typ
/= Any_Composite
-- or Right_Opnd in error
9004 and then not Matching_Static_Array_Bounds
(Left_Typ
, Right_Typ
)
9006 Check_SPARK_05_Restriction
9007 ("array types should have matching static bounds", N
);
9011 end Resolve_Logical_Op
;
9013 ---------------------------
9014 -- Resolve_Membership_Op --
9015 ---------------------------
9017 -- The context can only be a boolean type, and does not determine the
9018 -- arguments. Arguments should be unambiguous, but the preference rule for
9019 -- universal types applies.
9021 procedure Resolve_Membership_Op
(N
: Node_Id
; Typ
: Entity_Id
) is
9022 pragma Warnings
(Off
, Typ
);
9024 L
: constant Node_Id
:= Left_Opnd
(N
);
9025 R
: constant Node_Id
:= Right_Opnd
(N
);
9028 procedure Resolve_Set_Membership
;
9029 -- Analysis has determined a unique type for the left operand. Use it to
9030 -- resolve the disjuncts.
9032 ----------------------------
9033 -- Resolve_Set_Membership --
9034 ----------------------------
9036 procedure Resolve_Set_Membership
is
9041 -- If the left operand is overloaded, find type compatible with not
9042 -- overloaded alternative of the right operand.
9044 if Is_Overloaded
(L
) then
9046 Alt
:= First
(Alternatives
(N
));
9047 while Present
(Alt
) loop
9048 if not Is_Overloaded
(Alt
) then
9049 Ltyp
:= Intersect_Types
(L
, Alt
);
9056 -- Unclear how to resolve expression if all alternatives are also
9060 Error_Msg_N
("ambiguous expression", N
);
9069 Alt
:= First
(Alternatives
(N
));
9070 while Present
(Alt
) loop
9072 -- Alternative is an expression, a range
9073 -- or a subtype mark.
9075 if not Is_Entity_Name
(Alt
)
9076 or else not Is_Type
(Entity
(Alt
))
9078 Resolve
(Alt
, Ltyp
);
9084 -- Check for duplicates for discrete case
9086 if Is_Discrete_Type
(Ltyp
) then
9093 Alts
: array (0 .. List_Length
(Alternatives
(N
))) of Ent
;
9097 -- Loop checking duplicates. This is quadratic, but giant sets
9098 -- are unlikely in this context so it's a reasonable choice.
9101 Alt
:= First
(Alternatives
(N
));
9102 while Present
(Alt
) loop
9103 if Is_OK_Static_Expression
(Alt
)
9104 and then (Nkind_In
(Alt
, N_Integer_Literal
,
9105 N_Character_Literal
)
9106 or else Nkind
(Alt
) in N_Has_Entity
)
9109 Alts
(Nalts
) := (Alt
, Expr_Value
(Alt
));
9111 for J
in 1 .. Nalts
- 1 loop
9112 if Alts
(J
).Val
= Alts
(Nalts
).Val
then
9113 Error_Msg_Sloc
:= Sloc
(Alts
(J
).Alt
);
9114 Error_Msg_N
("duplicate of value given#??", Alt
);
9124 -- RM 4.5.2 (28.1/3) specifies that for types other than records or
9125 -- limited types, evaluation of a membership test uses the predefined
9126 -- equality for the type. This may be confusing to users, and the
9127 -- following warning appears useful for the most common case.
9129 if Is_Scalar_Type
(Ltyp
)
9130 and then Present
(Get_User_Defined_Eq
(Ltyp
))
9133 ("membership test on& uses predefined equality?", N
, Ltyp
);
9135 ("\even if user-defined equality exists (RM 4.5.2 (28.1/3)?", N
);
9137 end Resolve_Set_Membership
;
9139 -- Start of processing for Resolve_Membership_Op
9142 if L
= Error
or else R
= Error
then
9146 if Present
(Alternatives
(N
)) then
9147 Resolve_Set_Membership
;
9150 elsif not Is_Overloaded
(R
)
9152 (Etype
(R
) = Universal_Integer
9154 Etype
(R
) = Universal_Real
)
9155 and then Is_Overloaded
(L
)
9159 -- Ada 2005 (AI-251): Support the following case:
9161 -- type I is interface;
9162 -- type T is tagged ...
9164 -- function Test (O : I'Class) is
9166 -- return O in T'Class.
9169 -- In this case we have nothing else to do. The membership test will be
9170 -- done at run time.
9172 elsif Ada_Version
>= Ada_2005
9173 and then Is_Class_Wide_Type
(Etype
(L
))
9174 and then Is_Interface
(Etype
(L
))
9175 and then not Is_Interface
(Etype
(R
))
9179 T
:= Intersect_Types
(L
, R
);
9182 -- If mixed-mode operations are present and operands are all literal,
9183 -- the only interpretation involves Duration, which is probably not
9184 -- the intention of the programmer.
9186 if T
= Any_Fixed
then
9187 T
:= Unique_Fixed_Point_Type
(N
);
9189 if T
= Any_Type
then
9195 Check_Unset_Reference
(L
);
9197 if Nkind
(R
) = N_Range
9198 and then not Is_Scalar_Type
(T
)
9200 Error_Msg_N
("scalar type required for range", R
);
9203 if Is_Entity_Name
(R
) then
9204 Freeze_Expression
(R
);
9207 Check_Unset_Reference
(R
);
9210 -- Here after resolving membership operation
9214 Eval_Membership_Op
(N
);
9215 end Resolve_Membership_Op
;
9221 procedure Resolve_Null
(N
: Node_Id
; Typ
: Entity_Id
) is
9222 Loc
: constant Source_Ptr
:= Sloc
(N
);
9225 -- Handle restriction against anonymous null access values This
9226 -- restriction can be turned off using -gnatdj.
9228 -- Ada 2005 (AI-231): Remove restriction
9230 if Ada_Version
< Ada_2005
9231 and then not Debug_Flag_J
9232 and then Ekind
(Typ
) = E_Anonymous_Access_Type
9233 and then Comes_From_Source
(N
)
9235 -- In the common case of a call which uses an explicitly null value
9236 -- for an access parameter, give specialized error message.
9238 if Nkind
(Parent
(N
)) in N_Subprogram_Call
then
9240 ("null is not allowed as argument for an access parameter", N
);
9242 -- Standard message for all other cases (are there any?)
9246 ("null cannot be of an anonymous access type", N
);
9250 -- Ada 2005 (AI-231): Generate the null-excluding check in case of
9251 -- assignment to a null-excluding object.
9253 if Ada_Version
>= Ada_2005
9254 and then Can_Never_Be_Null
(Typ
)
9255 and then Nkind
(Parent
(N
)) = N_Assignment_Statement
9257 if Inside_Init_Proc
then
9259 -- Decide whether to generate an if_statement around our
9260 -- null-excluding check to avoid them on certain internal object
9261 -- declarations by looking at the type the current Init_Proc
9265 -- if T1b_skip_null_excluding_check then
9266 -- [constraint_error "access check failed"]
9269 if Needs_Conditional_Null_Excluding_Check
9270 (Etype
(First_Formal
(Enclosing_Init_Proc
)))
9273 Make_If_Statement
(Loc
,
9275 Make_Identifier
(Loc
,
9277 (Chars
(Typ
), "_skip_null_excluding_check")),
9280 Make_Raise_Constraint_Error
(Loc
,
9281 Reason
=> CE_Access_Check_Failed
))));
9283 -- Otherwise, simply create the check
9287 Make_Raise_Constraint_Error
(Loc
,
9288 Reason
=> CE_Access_Check_Failed
));
9292 (Compile_Time_Constraint_Error
(N
,
9293 "(Ada 2005) null not allowed in null-excluding objects??"),
9294 Make_Raise_Constraint_Error
(Loc
,
9295 Reason
=> CE_Access_Check_Failed
));
9299 -- In a distributed context, null for a remote access to subprogram may
9300 -- need to be replaced with a special record aggregate. In this case,
9301 -- return after having done the transformation.
9303 if (Ekind
(Typ
) = E_Record_Type
9304 or else Is_Remote_Access_To_Subprogram_Type
(Typ
))
9305 and then Remote_AST_Null_Value
(N
, Typ
)
9310 -- The null literal takes its type from the context
9315 -----------------------
9316 -- Resolve_Op_Concat --
9317 -----------------------
9319 procedure Resolve_Op_Concat
(N
: Node_Id
; Typ
: Entity_Id
) is
9321 -- We wish to avoid deep recursion, because concatenations are often
9322 -- deeply nested, as in A&B&...&Z. Therefore, we walk down the left
9323 -- operands nonrecursively until we find something that is not a simple
9324 -- concatenation (A in this case). We resolve that, and then walk back
9325 -- up the tree following Parent pointers, calling Resolve_Op_Concat_Rest
9326 -- to do the rest of the work at each level. The Parent pointers allow
9327 -- us to avoid recursion, and thus avoid running out of memory. See also
9328 -- Sem_Ch4.Analyze_Concatenation, where a similar approach is used.
9334 -- The following code is equivalent to:
9336 -- Resolve_Op_Concat_First (NN, Typ);
9337 -- Resolve_Op_Concat_Arg (N, ...);
9338 -- Resolve_Op_Concat_Rest (N, Typ);
9340 -- where the Resolve_Op_Concat_Arg call recurses back here if the left
9341 -- operand is a concatenation.
9343 -- Walk down left operands
9346 Resolve_Op_Concat_First
(NN
, Typ
);
9347 Op1
:= Left_Opnd
(NN
);
9348 exit when not (Nkind
(Op1
) = N_Op_Concat
9349 and then not Is_Array_Type
(Component_Type
(Typ
))
9350 and then Entity
(Op1
) = Entity
(NN
));
9354 -- Now (given the above example) NN is A&B and Op1 is A
9356 -- First resolve Op1 ...
9358 Resolve_Op_Concat_Arg
(NN
, Op1
, Typ
, Is_Component_Left_Opnd
(NN
));
9360 -- ... then walk NN back up until we reach N (where we started), calling
9361 -- Resolve_Op_Concat_Rest along the way.
9364 Resolve_Op_Concat_Rest
(NN
, Typ
);
9369 if Base_Type
(Etype
(N
)) /= Standard_String
then
9370 Check_SPARK_05_Restriction
9371 ("result of concatenation should have type String", N
);
9373 end Resolve_Op_Concat
;
9375 ---------------------------
9376 -- Resolve_Op_Concat_Arg --
9377 ---------------------------
9379 procedure Resolve_Op_Concat_Arg
9385 Btyp
: constant Entity_Id
:= Base_Type
(Typ
);
9386 Ctyp
: constant Entity_Id
:= Component_Type
(Typ
);
9391 or else (not Is_Overloaded
(Arg
)
9392 and then Etype
(Arg
) /= Any_Composite
9393 and then Covers
(Ctyp
, Etype
(Arg
)))
9395 Resolve
(Arg
, Ctyp
);
9397 Resolve
(Arg
, Btyp
);
9400 -- If both Array & Array and Array & Component are visible, there is a
9401 -- potential ambiguity that must be reported.
9403 elsif Has_Compatible_Type
(Arg
, Ctyp
) then
9404 if Nkind
(Arg
) = N_Aggregate
9405 and then Is_Composite_Type
(Ctyp
)
9407 if Is_Private_Type
(Ctyp
) then
9408 Resolve
(Arg
, Btyp
);
9410 -- If the operation is user-defined and not overloaded use its
9411 -- profile. The operation may be a renaming, in which case it has
9412 -- been rewritten, and we want the original profile.
9414 elsif not Is_Overloaded
(N
)
9415 and then Comes_From_Source
(Entity
(Original_Node
(N
)))
9416 and then Ekind
(Entity
(Original_Node
(N
))) = E_Function
9420 (Next_Formal
(First_Formal
(Entity
(Original_Node
(N
))))));
9423 -- Otherwise an aggregate may match both the array type and the
9427 Error_Msg_N
("ambiguous aggregate must be qualified", Arg
);
9428 Set_Etype
(Arg
, Any_Type
);
9432 if Is_Overloaded
(Arg
)
9433 and then Has_Compatible_Type
(Arg
, Typ
)
9434 and then Etype
(Arg
) /= Any_Type
9442 Get_First_Interp
(Arg
, I
, It
);
9444 Get_Next_Interp
(I
, It
);
9446 -- Special-case the error message when the overloading is
9447 -- caused by a function that yields an array and can be
9448 -- called without parameters.
9450 if It
.Nam
= Func
then
9451 Error_Msg_Sloc
:= Sloc
(Func
);
9452 Error_Msg_N
("ambiguous call to function#", Arg
);
9454 ("\\interpretation as call yields&", Arg
, Typ
);
9456 ("\\interpretation as indexing of call yields&",
9457 Arg
, Component_Type
(Typ
));
9460 Error_Msg_N
("ambiguous operand for concatenation!", Arg
);
9462 Get_First_Interp
(Arg
, I
, It
);
9463 while Present
(It
.Nam
) loop
9464 Error_Msg_Sloc
:= Sloc
(It
.Nam
);
9466 if Base_Type
(It
.Typ
) = Btyp
9468 Base_Type
(It
.Typ
) = Base_Type
(Ctyp
)
9470 Error_Msg_N
-- CODEFIX
9471 ("\\possible interpretation#", Arg
);
9474 Get_Next_Interp
(I
, It
);
9480 Resolve
(Arg
, Component_Type
(Typ
));
9482 if Nkind
(Arg
) = N_String_Literal
then
9483 Set_Etype
(Arg
, Component_Type
(Typ
));
9486 if Arg
= Left_Opnd
(N
) then
9487 Set_Is_Component_Left_Opnd
(N
);
9489 Set_Is_Component_Right_Opnd
(N
);
9494 Resolve
(Arg
, Btyp
);
9497 -- Concatenation is restricted in SPARK: each operand must be either a
9498 -- string literal, the name of a string constant, a static character or
9499 -- string expression, or another concatenation. Arg cannot be a
9500 -- concatenation here as callers of Resolve_Op_Concat_Arg call it
9501 -- separately on each final operand, past concatenation operations.
9503 if Is_Character_Type
(Etype
(Arg
)) then
9504 if not Is_OK_Static_Expression
(Arg
) then
9505 Check_SPARK_05_Restriction
9506 ("character operand for concatenation should be static", Arg
);
9509 elsif Is_String_Type
(Etype
(Arg
)) then
9510 if not (Nkind_In
(Arg
, N_Identifier
, N_Expanded_Name
)
9511 and then Is_Constant_Object
(Entity
(Arg
)))
9512 and then not Is_OK_Static_Expression
(Arg
)
9514 Check_SPARK_05_Restriction
9515 ("string operand for concatenation should be static", Arg
);
9518 -- Do not issue error on an operand that is neither a character nor a
9519 -- string, as the error is issued in Resolve_Op_Concat.
9525 Check_Unset_Reference
(Arg
);
9526 end Resolve_Op_Concat_Arg
;
9528 -----------------------------
9529 -- Resolve_Op_Concat_First --
9530 -----------------------------
9532 procedure Resolve_Op_Concat_First
(N
: Node_Id
; Typ
: Entity_Id
) is
9533 Btyp
: constant Entity_Id
:= Base_Type
(Typ
);
9534 Op1
: constant Node_Id
:= Left_Opnd
(N
);
9535 Op2
: constant Node_Id
:= Right_Opnd
(N
);
9538 -- The parser folds an enormous sequence of concatenations of string
9539 -- literals into "" & "...", where the Is_Folded_In_Parser flag is set
9540 -- in the right operand. If the expression resolves to a predefined "&"
9541 -- operator, all is well. Otherwise, the parser's folding is wrong, so
9542 -- we give an error. See P_Simple_Expression in Par.Ch4.
9544 if Nkind
(Op2
) = N_String_Literal
9545 and then Is_Folded_In_Parser
(Op2
)
9546 and then Ekind
(Entity
(N
)) = E_Function
9548 pragma Assert
(Nkind
(Op1
) = N_String_Literal
-- should be ""
9549 and then String_Length
(Strval
(Op1
)) = 0);
9550 Error_Msg_N
("too many user-defined concatenations", N
);
9554 Set_Etype
(N
, Btyp
);
9556 if Is_Limited_Composite
(Btyp
) then
9557 Error_Msg_N
("concatenation not available for limited array", N
);
9558 Explain_Limited_Type
(Btyp
, N
);
9560 end Resolve_Op_Concat_First
;
9562 ----------------------------
9563 -- Resolve_Op_Concat_Rest --
9564 ----------------------------
9566 procedure Resolve_Op_Concat_Rest
(N
: Node_Id
; Typ
: Entity_Id
) is
9567 Op1
: constant Node_Id
:= Left_Opnd
(N
);
9568 Op2
: constant Node_Id
:= Right_Opnd
(N
);
9571 Resolve_Op_Concat_Arg
(N
, Op2
, Typ
, Is_Component_Right_Opnd
(N
));
9573 Generate_Operator_Reference
(N
, Typ
);
9575 if Is_String_Type
(Typ
) then
9576 Eval_Concatenation
(N
);
9579 -- If this is not a static concatenation, but the result is a string
9580 -- type (and not an array of strings) ensure that static string operands
9581 -- have their subtypes properly constructed.
9583 if Nkind
(N
) /= N_String_Literal
9584 and then Is_Character_Type
(Component_Type
(Typ
))
9586 Set_String_Literal_Subtype
(Op1
, Typ
);
9587 Set_String_Literal_Subtype
(Op2
, Typ
);
9589 end Resolve_Op_Concat_Rest
;
9591 ----------------------
9592 -- Resolve_Op_Expon --
9593 ----------------------
9595 procedure Resolve_Op_Expon
(N
: Node_Id
; Typ
: Entity_Id
) is
9596 B_Typ
: constant Entity_Id
:= Base_Type
(Typ
);
9599 -- Catch attempts to do fixed-point exponentiation with universal
9600 -- operands, which is a case where the illegality is not caught during
9601 -- normal operator analysis. This is not done in preanalysis mode
9602 -- since the tree is not fully decorated during preanalysis.
9604 if Full_Analysis
then
9605 if Is_Fixed_Point_Type
(Typ
) and then Comes_From_Source
(N
) then
9606 Error_Msg_N
("exponentiation not available for fixed point", N
);
9609 elsif Nkind
(Parent
(N
)) in N_Op
9610 and then Present
(Etype
(Parent
(N
)))
9611 and then Is_Fixed_Point_Type
(Etype
(Parent
(N
)))
9612 and then Etype
(N
) = Universal_Real
9613 and then Comes_From_Source
(N
)
9615 Error_Msg_N
("exponentiation not available for fixed point", N
);
9620 if Comes_From_Source
(N
)
9621 and then Ekind
(Entity
(N
)) = E_Function
9622 and then Is_Imported
(Entity
(N
))
9623 and then Is_Intrinsic_Subprogram
(Entity
(N
))
9625 Resolve_Intrinsic_Operator
(N
, Typ
);
9629 if Etype
(Left_Opnd
(N
)) = Universal_Integer
9630 or else Etype
(Left_Opnd
(N
)) = Universal_Real
9632 Check_For_Visible_Operator
(N
, B_Typ
);
9635 -- We do the resolution using the base type, because intermediate values
9636 -- in expressions are always of the base type, not a subtype of it.
9638 Resolve
(Left_Opnd
(N
), B_Typ
);
9639 Resolve
(Right_Opnd
(N
), Standard_Integer
);
9641 -- For integer types, right argument must be in Natural range
9643 if Is_Integer_Type
(Typ
) then
9644 Apply_Scalar_Range_Check
(Right_Opnd
(N
), Standard_Natural
);
9647 Check_Unset_Reference
(Left_Opnd
(N
));
9648 Check_Unset_Reference
(Right_Opnd
(N
));
9650 Set_Etype
(N
, B_Typ
);
9651 Generate_Operator_Reference
(N
, B_Typ
);
9653 Analyze_Dimension
(N
);
9655 if Ada_Version
>= Ada_2012
and then Has_Dimension_System
(B_Typ
) then
9656 -- Evaluate the exponentiation operator for dimensioned type
9658 Eval_Op_Expon_For_Dimensioned_Type
(N
, B_Typ
);
9663 -- Set overflow checking bit. Much cleverer code needed here eventually
9664 -- and perhaps the Resolve routines should be separated for the various
9665 -- arithmetic operations, since they will need different processing. ???
9667 if Nkind
(N
) in N_Op
then
9668 if not Overflow_Checks_Suppressed
(Etype
(N
)) then
9669 Enable_Overflow_Check
(N
);
9672 end Resolve_Op_Expon
;
9674 --------------------
9675 -- Resolve_Op_Not --
9676 --------------------
9678 procedure Resolve_Op_Not
(N
: Node_Id
; Typ
: Entity_Id
) is
9681 function Parent_Is_Boolean
return Boolean;
9682 -- This function determines if the parent node is a boolean operator or
9683 -- operation (comparison op, membership test, or short circuit form) and
9684 -- the not in question is the left operand of this operation. Note that
9685 -- if the not is in parens, then false is returned.
9687 -----------------------
9688 -- Parent_Is_Boolean --
9689 -----------------------
9691 function Parent_Is_Boolean
return Boolean is
9693 if Paren_Count
(N
) /= 0 then
9697 case Nkind
(Parent
(N
)) is
9712 return Left_Opnd
(Parent
(N
)) = N
;
9718 end Parent_Is_Boolean
;
9720 -- Start of processing for Resolve_Op_Not
9723 -- Predefined operations on scalar types yield the base type. On the
9724 -- other hand, logical operations on arrays yield the type of the
9725 -- arguments (and the context).
9727 if Is_Array_Type
(Typ
) then
9730 B_Typ
:= Base_Type
(Typ
);
9733 -- Straightforward case of incorrect arguments
9735 if not Valid_Boolean_Arg
(Typ
) then
9736 Error_Msg_N
("invalid operand type for operator&", N
);
9737 Set_Etype
(N
, Any_Type
);
9740 -- Special case of probable missing parens
9742 elsif Typ
= Universal_Integer
or else Typ
= Any_Modular
then
9743 if Parent_Is_Boolean
then
9745 ("operand of not must be enclosed in parentheses",
9749 ("no modular type available in this context", N
);
9752 Set_Etype
(N
, Any_Type
);
9755 -- OK resolution of NOT
9758 -- Warn if non-boolean types involved. This is a case like not a < b
9759 -- where a and b are modular, where we will get (not a) < b and most
9760 -- likely not (a < b) was intended.
9762 if Warn_On_Questionable_Missing_Parens
9763 and then not Is_Boolean_Type
(Typ
)
9764 and then Parent_Is_Boolean
9766 Error_Msg_N
("?q?not expression should be parenthesized here!", N
);
9769 -- Warn on double negation if checking redundant constructs
9771 if Warn_On_Redundant_Constructs
9772 and then Comes_From_Source
(N
)
9773 and then Comes_From_Source
(Right_Opnd
(N
))
9774 and then Root_Type
(Typ
) = Standard_Boolean
9775 and then Nkind
(Right_Opnd
(N
)) = N_Op_Not
9777 Error_Msg_N
("redundant double negation?r?", N
);
9780 -- Complete resolution and evaluation of NOT
9782 Resolve
(Right_Opnd
(N
), B_Typ
);
9783 Check_Unset_Reference
(Right_Opnd
(N
));
9784 Set_Etype
(N
, B_Typ
);
9785 Generate_Operator_Reference
(N
, B_Typ
);
9790 -----------------------------
9791 -- Resolve_Operator_Symbol --
9792 -----------------------------
9794 -- Nothing to be done, all resolved already
9796 procedure Resolve_Operator_Symbol
(N
: Node_Id
; Typ
: Entity_Id
) is
9797 pragma Warnings
(Off
, N
);
9798 pragma Warnings
(Off
, Typ
);
9802 end Resolve_Operator_Symbol
;
9804 ----------------------------------
9805 -- Resolve_Qualified_Expression --
9806 ----------------------------------
9808 procedure Resolve_Qualified_Expression
(N
: Node_Id
; Typ
: Entity_Id
) is
9809 pragma Warnings
(Off
, Typ
);
9811 Target_Typ
: constant Entity_Id
:= Entity
(Subtype_Mark
(N
));
9812 Expr
: constant Node_Id
:= Expression
(N
);
9815 Resolve
(Expr
, Target_Typ
);
9817 -- Protect call to Matching_Static_Array_Bounds to avoid costly
9818 -- operation if not needed.
9820 if Restriction_Check_Required
(SPARK_05
)
9821 and then Is_Array_Type
(Target_Typ
)
9822 and then Is_Array_Type
(Etype
(Expr
))
9823 and then Etype
(Expr
) /= Any_Composite
-- or else Expr in error
9824 and then not Matching_Static_Array_Bounds
(Target_Typ
, Etype
(Expr
))
9826 Check_SPARK_05_Restriction
9827 ("array types should have matching static bounds", N
);
9830 -- A qualified expression requires an exact match of the type, class-
9831 -- wide matching is not allowed. However, if the qualifying type is
9832 -- specific and the expression has a class-wide type, it may still be
9833 -- okay, since it can be the result of the expansion of a call to a
9834 -- dispatching function, so we also have to check class-wideness of the
9835 -- type of the expression's original node.
9837 if (Is_Class_Wide_Type
(Target_Typ
)
9839 (Is_Class_Wide_Type
(Etype
(Expr
))
9840 and then Is_Class_Wide_Type
(Etype
(Original_Node
(Expr
)))))
9841 and then Base_Type
(Etype
(Expr
)) /= Base_Type
(Target_Typ
)
9843 Wrong_Type
(Expr
, Target_Typ
);
9846 -- If the target type is unconstrained, then we reset the type of the
9847 -- result from the type of the expression. For other cases, the actual
9848 -- subtype of the expression is the target type.
9850 if Is_Composite_Type
(Target_Typ
)
9851 and then not Is_Constrained
(Target_Typ
)
9853 Set_Etype
(N
, Etype
(Expr
));
9856 Analyze_Dimension
(N
);
9857 Eval_Qualified_Expression
(N
);
9859 -- If we still have a qualified expression after the static evaluation,
9860 -- then apply a scalar range check if needed. The reason that we do this
9861 -- after the Eval call is that otherwise, the application of the range
9862 -- check may convert an illegal static expression and result in warning
9863 -- rather than giving an error (e.g Integer'(Integer'Last + 1)).
9865 if Nkind
(N
) = N_Qualified_Expression
and then Is_Scalar_Type
(Typ
) then
9866 Apply_Scalar_Range_Check
(Expr
, Typ
);
9869 -- Finally, check whether a predicate applies to the target type. This
9870 -- comes from AI12-0100. As for type conversions, check the enclosing
9871 -- context to prevent an infinite expansion.
9873 if Has_Predicates
(Target_Typ
) then
9874 if Nkind
(Parent
(N
)) = N_Function_Call
9875 and then Present
(Name
(Parent
(N
)))
9876 and then (Is_Predicate_Function
(Entity
(Name
(Parent
(N
))))
9878 Is_Predicate_Function_M
(Entity
(Name
(Parent
(N
)))))
9882 -- In the case of a qualified expression in an allocator, the check
9883 -- is applied when expanding the allocator, so avoid redundant check.
9885 elsif Nkind
(N
) = N_Qualified_Expression
9886 and then Nkind
(Parent
(N
)) /= N_Allocator
9888 Apply_Predicate_Check
(N
, Target_Typ
);
9891 end Resolve_Qualified_Expression
;
9893 ------------------------------
9894 -- Resolve_Raise_Expression --
9895 ------------------------------
9897 procedure Resolve_Raise_Expression
(N
: Node_Id
; Typ
: Entity_Id
) is
9899 if Typ
= Raise_Type
then
9900 Error_Msg_N
("cannot find unique type for raise expression", N
);
9901 Set_Etype
(N
, Any_Type
);
9905 end Resolve_Raise_Expression
;
9911 procedure Resolve_Range
(N
: Node_Id
; Typ
: Entity_Id
) is
9912 L
: constant Node_Id
:= Low_Bound
(N
);
9913 H
: constant Node_Id
:= High_Bound
(N
);
9915 function First_Last_Ref
return Boolean;
9916 -- Returns True if N is of the form X'First .. X'Last where X is the
9917 -- same entity for both attributes.
9919 --------------------
9920 -- First_Last_Ref --
9921 --------------------
9923 function First_Last_Ref
return Boolean is
9924 Lorig
: constant Node_Id
:= Original_Node
(L
);
9925 Horig
: constant Node_Id
:= Original_Node
(H
);
9928 if Nkind
(Lorig
) = N_Attribute_Reference
9929 and then Nkind
(Horig
) = N_Attribute_Reference
9930 and then Attribute_Name
(Lorig
) = Name_First
9931 and then Attribute_Name
(Horig
) = Name_Last
9934 PL
: constant Node_Id
:= Prefix
(Lorig
);
9935 PH
: constant Node_Id
:= Prefix
(Horig
);
9937 if Is_Entity_Name
(PL
)
9938 and then Is_Entity_Name
(PH
)
9939 and then Entity
(PL
) = Entity
(PH
)
9949 -- Start of processing for Resolve_Range
9954 -- The lower bound should be in Typ. The higher bound can be in Typ's
9955 -- base type if the range is null. It may still be invalid if it is
9956 -- higher than the lower bound. This is checked later in the context in
9957 -- which the range appears.
9960 Resolve
(H
, Base_Type
(Typ
));
9962 -- Reanalyze the lower bound after both bounds have been analyzed, so
9963 -- that the range is known to be static or not by now. This may trigger
9964 -- more compile-time evaluation, which is useful for static analysis
9965 -- with GNATprove. This is not needed for compilation or static analysis
9966 -- with CodePeer, as full expansion does that evaluation then.
9968 if GNATprove_Mode
then
9969 Set_Analyzed
(L
, False);
9973 -- Check for inappropriate range on unordered enumeration type
9975 if Bad_Unordered_Enumeration_Reference
(N
, Typ
)
9977 -- Exclude X'First .. X'Last if X is the same entity for both
9979 and then not First_Last_Ref
9981 Error_Msg_Sloc
:= Sloc
(Typ
);
9983 ("subrange of unordered enumeration type& declared#?U?", N
, Typ
);
9986 Check_Unset_Reference
(L
);
9987 Check_Unset_Reference
(H
);
9989 -- We have to check the bounds for being within the base range as
9990 -- required for a non-static context. Normally this is automatic and
9991 -- done as part of evaluating expressions, but the N_Range node is an
9992 -- exception, since in GNAT we consider this node to be a subexpression,
9993 -- even though in Ada it is not. The circuit in Sem_Eval could check for
9994 -- this, but that would put the test on the main evaluation path for
9997 Check_Non_Static_Context
(L
);
9998 Check_Non_Static_Context
(H
);
10000 -- Check for an ambiguous range over character literals. This will
10001 -- happen with a membership test involving only literals.
10003 if Typ
= Any_Character
then
10004 Ambiguous_Character
(L
);
10005 Set_Etype
(N
, Any_Type
);
10009 -- If bounds are static, constant-fold them, so size computations are
10010 -- identical between front-end and back-end. Do not perform this
10011 -- transformation while analyzing generic units, as type information
10012 -- would be lost when reanalyzing the constant node in the instance.
10014 if Is_Discrete_Type
(Typ
) and then Expander_Active
then
10015 if Is_OK_Static_Expression
(L
) then
10016 Fold_Uint
(L
, Expr_Value
(L
), Is_OK_Static_Expression
(L
));
10019 if Is_OK_Static_Expression
(H
) then
10020 Fold_Uint
(H
, Expr_Value
(H
), Is_OK_Static_Expression
(H
));
10025 --------------------------
10026 -- Resolve_Real_Literal --
10027 --------------------------
10029 procedure Resolve_Real_Literal
(N
: Node_Id
; Typ
: Entity_Id
) is
10030 Actual_Typ
: constant Entity_Id
:= Etype
(N
);
10033 -- Special processing for fixed-point literals to make sure that the
10034 -- value is an exact multiple of small where this is required. We skip
10035 -- this for the universal real case, and also for generic types.
10037 if Is_Fixed_Point_Type
(Typ
)
10038 and then Typ
/= Universal_Fixed
10039 and then Typ
/= Any_Fixed
10040 and then not Is_Generic_Type
(Typ
)
10043 Val
: constant Ureal
:= Realval
(N
);
10044 Cintr
: constant Ureal
:= Val
/ Small_Value
(Typ
);
10045 Cint
: constant Uint
:= UR_Trunc
(Cintr
);
10046 Den
: constant Uint
:= Norm_Den
(Cintr
);
10050 -- Case of literal is not an exact multiple of the Small
10054 -- For a source program literal for a decimal fixed-point type,
10055 -- this is statically illegal (RM 4.9(36)).
10057 if Is_Decimal_Fixed_Point_Type
(Typ
)
10058 and then Actual_Typ
= Universal_Real
10059 and then Comes_From_Source
(N
)
10061 Error_Msg_N
("value has extraneous low order digits", N
);
10064 -- Generate a warning if literal from source
10066 if Is_OK_Static_Expression
(N
)
10067 and then Warn_On_Bad_Fixed_Value
10070 ("?b?static fixed-point value is not a multiple of Small!",
10074 -- Replace literal by a value that is the exact representation
10075 -- of a value of the type, i.e. a multiple of the small value,
10076 -- by truncation, since Machine_Rounds is false for all GNAT
10077 -- fixed-point types (RM 4.9(38)).
10079 Stat
:= Is_OK_Static_Expression
(N
);
10081 Make_Real_Literal
(Sloc
(N
),
10082 Realval
=> Small_Value
(Typ
) * Cint
));
10084 Set_Is_Static_Expression
(N
, Stat
);
10087 -- In all cases, set the corresponding integer field
10089 Set_Corresponding_Integer_Value
(N
, Cint
);
10093 -- Now replace the actual type by the expected type as usual
10095 Set_Etype
(N
, Typ
);
10096 Eval_Real_Literal
(N
);
10097 end Resolve_Real_Literal
;
10099 -----------------------
10100 -- Resolve_Reference --
10101 -----------------------
10103 procedure Resolve_Reference
(N
: Node_Id
; Typ
: Entity_Id
) is
10104 P
: constant Node_Id
:= Prefix
(N
);
10107 -- Replace general access with specific type
10109 if Ekind
(Etype
(N
)) = E_Allocator_Type
then
10110 Set_Etype
(N
, Base_Type
(Typ
));
10113 Resolve
(P
, Designated_Type
(Etype
(N
)));
10115 -- If we are taking the reference of a volatile entity, then treat it as
10116 -- a potential modification of this entity. This is too conservative,
10117 -- but necessary because remove side effects can cause transformations
10118 -- of normal assignments into reference sequences that otherwise fail to
10119 -- notice the modification.
10121 if Is_Entity_Name
(P
) and then Treat_As_Volatile
(Entity
(P
)) then
10122 Note_Possible_Modification
(P
, Sure
=> False);
10124 end Resolve_Reference
;
10126 --------------------------------
10127 -- Resolve_Selected_Component --
10128 --------------------------------
10130 procedure Resolve_Selected_Component
(N
: Node_Id
; Typ
: Entity_Id
) is
10132 Comp1
: Entity_Id
:= Empty
; -- prevent junk warning
10133 P
: constant Node_Id
:= Prefix
(N
);
10134 S
: constant Node_Id
:= Selector_Name
(N
);
10135 T
: Entity_Id
:= Etype
(P
);
10137 I1
: Interp_Index
:= 0; -- prevent junk warning
10142 function Init_Component
return Boolean;
10143 -- Check whether this is the initialization of a component within an
10144 -- init proc (by assignment or call to another init proc). If true,
10145 -- there is no need for a discriminant check.
10147 --------------------
10148 -- Init_Component --
10149 --------------------
10151 function Init_Component
return Boolean is
10153 return Inside_Init_Proc
10154 and then Nkind
(Prefix
(N
)) = N_Identifier
10155 and then Chars
(Prefix
(N
)) = Name_uInit
10156 and then Nkind
(Parent
(Parent
(N
))) = N_Case_Statement_Alternative
;
10157 end Init_Component
;
10159 -- Start of processing for Resolve_Selected_Component
10162 if Is_Overloaded
(P
) then
10164 -- Use the context type to select the prefix that has a selector
10165 -- of the correct name and type.
10168 Get_First_Interp
(P
, I
, It
);
10170 Search
: while Present
(It
.Typ
) loop
10171 if Is_Access_Type
(It
.Typ
) then
10172 T
:= Designated_Type
(It
.Typ
);
10177 -- Locate selected component. For a private prefix the selector
10178 -- can denote a discriminant.
10180 if Is_Record_Type
(T
) or else Is_Private_Type
(T
) then
10182 -- The visible components of a class-wide type are those of
10185 if Is_Class_Wide_Type
(T
) then
10189 Comp
:= First_Entity
(T
);
10190 while Present
(Comp
) loop
10191 if Chars
(Comp
) = Chars
(S
)
10192 and then Covers
(Typ
, Etype
(Comp
))
10201 It
:= Disambiguate
(P
, I1
, I
, Any_Type
);
10203 if It
= No_Interp
then
10205 ("ambiguous prefix for selected component", N
);
10206 Set_Etype
(N
, Typ
);
10212 -- There may be an implicit dereference. Retrieve
10213 -- designated record type.
10215 if Is_Access_Type
(It1
.Typ
) then
10216 T
:= Designated_Type
(It1
.Typ
);
10221 if Scope
(Comp1
) /= T
then
10223 -- Resolution chooses the new interpretation.
10224 -- Find the component with the right name.
10226 Comp1
:= First_Entity
(T
);
10227 while Present
(Comp1
)
10228 and then Chars
(Comp1
) /= Chars
(S
)
10230 Comp1
:= Next_Entity
(Comp1
);
10239 Comp
:= Next_Entity
(Comp
);
10243 Get_Next_Interp
(I
, It
);
10246 -- There must be a legal interpretation at this point
10248 pragma Assert
(Found
);
10249 Resolve
(P
, It1
.Typ
);
10250 Set_Etype
(N
, Typ
);
10251 Set_Entity_With_Checks
(S
, Comp1
);
10253 -- The type of the context and that of the component are
10254 -- compatible and in general identical, but if they are anonymous
10255 -- access-to-subprogram types, the relevant type is that of the
10256 -- component. This matters in Unnest_Subprograms mode, where the
10257 -- relevant context is the one in which the type is declared, not
10258 -- the point of use. This determines what activation record to use.
10260 if Ekind
(Typ
) = E_Anonymous_Access_Subprogram_Type
then
10261 Set_Etype
(N
, Etype
(Comp1
));
10265 -- Resolve prefix with its type
10270 -- Generate cross-reference. We needed to wait until full overloading
10271 -- resolution was complete to do this, since otherwise we can't tell if
10272 -- we are an lvalue or not.
10274 if May_Be_Lvalue
(N
) then
10275 Generate_Reference
(Entity
(S
), S
, 'm');
10277 Generate_Reference
(Entity
(S
), S
, 'r');
10280 -- If prefix is an access type, the node will be transformed into an
10281 -- explicit dereference during expansion. The type of the node is the
10282 -- designated type of that of the prefix.
10284 if Is_Access_Type
(Etype
(P
)) then
10285 T
:= Designated_Type
(Etype
(P
));
10286 Check_Fully_Declared_Prefix
(T
, P
);
10291 -- Set flag for expander if discriminant check required on a component
10292 -- appearing within a variant.
10294 if Has_Discriminants
(T
)
10295 and then Ekind
(Entity
(S
)) = E_Component
10296 and then Present
(Original_Record_Component
(Entity
(S
)))
10297 and then Ekind
(Original_Record_Component
(Entity
(S
))) = E_Component
10299 Is_Declared_Within_Variant
(Original_Record_Component
(Entity
(S
)))
10300 and then not Discriminant_Checks_Suppressed
(T
)
10301 and then not Init_Component
10303 Set_Do_Discriminant_Check
(N
);
10306 if Ekind
(Entity
(S
)) = E_Void
then
10307 Error_Msg_N
("premature use of component", S
);
10310 -- If the prefix is a record conversion, this may be a renamed
10311 -- discriminant whose bounds differ from those of the original
10312 -- one, so we must ensure that a range check is performed.
10314 if Nkind
(P
) = N_Type_Conversion
10315 and then Ekind
(Entity
(S
)) = E_Discriminant
10316 and then Is_Discrete_Type
(Typ
)
10318 Set_Etype
(N
, Base_Type
(Typ
));
10321 -- Note: No Eval processing is required, because the prefix is of a
10322 -- record type, or protected type, and neither can possibly be static.
10324 -- If the record type is atomic, and the component is non-atomic, then
10325 -- this is worth a warning, since we have a situation where the access
10326 -- to the component may cause extra read/writes of the atomic array
10327 -- object, or partial word accesses, both of which may be unexpected.
10329 if Nkind
(N
) = N_Selected_Component
10330 and then Is_Atomic_Ref_With_Address
(N
)
10331 and then not Is_Atomic
(Entity
(S
))
10332 and then not Is_Atomic
(Etype
(Entity
(S
)))
10335 ("??access to non-atomic component of atomic record",
10338 ("\??may cause unexpected accesses to atomic object",
10342 Analyze_Dimension
(N
);
10343 end Resolve_Selected_Component
;
10345 -------------------
10346 -- Resolve_Shift --
10347 -------------------
10349 procedure Resolve_Shift
(N
: Node_Id
; Typ
: Entity_Id
) is
10350 B_Typ
: constant Entity_Id
:= Base_Type
(Typ
);
10351 L
: constant Node_Id
:= Left_Opnd
(N
);
10352 R
: constant Node_Id
:= Right_Opnd
(N
);
10355 -- We do the resolution using the base type, because intermediate values
10356 -- in expressions always are of the base type, not a subtype of it.
10358 Resolve
(L
, B_Typ
);
10359 Resolve
(R
, Standard_Natural
);
10361 Check_Unset_Reference
(L
);
10362 Check_Unset_Reference
(R
);
10364 Set_Etype
(N
, B_Typ
);
10365 Generate_Operator_Reference
(N
, B_Typ
);
10369 ---------------------------
10370 -- Resolve_Short_Circuit --
10371 ---------------------------
10373 procedure Resolve_Short_Circuit
(N
: Node_Id
; Typ
: Entity_Id
) is
10374 B_Typ
: constant Entity_Id
:= Base_Type
(Typ
);
10375 L
: constant Node_Id
:= Left_Opnd
(N
);
10376 R
: constant Node_Id
:= Right_Opnd
(N
);
10379 -- Ensure all actions associated with the left operand (e.g.
10380 -- finalization of transient objects) are fully evaluated locally within
10381 -- an expression with actions. This is particularly helpful for coverage
10382 -- analysis. However this should not happen in generics or if option
10383 -- Minimize_Expression_With_Actions is set.
10385 if Expander_Active
and not Minimize_Expression_With_Actions
then
10387 Reloc_L
: constant Node_Id
:= Relocate_Node
(L
);
10389 Save_Interps
(Old_N
=> L
, New_N
=> Reloc_L
);
10392 Make_Expression_With_Actions
(Sloc
(L
),
10393 Actions
=> New_List
,
10394 Expression
=> Reloc_L
));
10396 -- Set Comes_From_Source on L to preserve warnings for unset
10399 Set_Comes_From_Source
(L
, Comes_From_Source
(Reloc_L
));
10403 Resolve
(L
, B_Typ
);
10404 Resolve
(R
, B_Typ
);
10406 -- Check for issuing warning for always False assert/check, this happens
10407 -- when assertions are turned off, in which case the pragma Assert/Check
10408 -- was transformed into:
10410 -- if False and then <condition> then ...
10412 -- and we detect this pattern
10414 if Warn_On_Assertion_Failure
10415 and then Is_Entity_Name
(R
)
10416 and then Entity
(R
) = Standard_False
10417 and then Nkind
(Parent
(N
)) = N_If_Statement
10418 and then Nkind
(N
) = N_And_Then
10419 and then Is_Entity_Name
(L
)
10420 and then Entity
(L
) = Standard_False
10423 Orig
: constant Node_Id
:= Original_Node
(Parent
(N
));
10426 -- Special handling of Asssert pragma
10428 if Nkind
(Orig
) = N_Pragma
10429 and then Pragma_Name
(Orig
) = Name_Assert
10432 Expr
: constant Node_Id
:=
10435 (First
(Pragma_Argument_Associations
(Orig
))));
10438 -- Don't warn if original condition is explicit False,
10439 -- since obviously the failure is expected in this case.
10441 if Is_Entity_Name
(Expr
)
10442 and then Entity
(Expr
) = Standard_False
10446 -- Issue warning. We do not want the deletion of the
10447 -- IF/AND-THEN to take this message with it. We achieve this
10448 -- by making sure that the expanded code points to the Sloc
10449 -- of the expression, not the original pragma.
10452 -- Note: Use Error_Msg_F here rather than Error_Msg_N.
10453 -- The source location of the expression is not usually
10454 -- the best choice here. For example, it gets located on
10455 -- the last AND keyword in a chain of boolean expressiond
10456 -- AND'ed together. It is best to put the message on the
10457 -- first character of the assertion, which is the effect
10458 -- of the First_Node call here.
10461 ("?A?assertion would fail at run time!",
10463 (First
(Pragma_Argument_Associations
(Orig
))));
10467 -- Similar processing for Check pragma
10469 elsif Nkind
(Orig
) = N_Pragma
10470 and then Pragma_Name
(Orig
) = Name_Check
10472 -- Don't want to warn if original condition is explicit False
10475 Expr
: constant Node_Id
:=
10478 (Next
(First
(Pragma_Argument_Associations
(Orig
)))));
10480 if Is_Entity_Name
(Expr
)
10481 and then Entity
(Expr
) = Standard_False
10488 -- Again use Error_Msg_F rather than Error_Msg_N, see
10489 -- comment above for an explanation of why we do this.
10492 ("?A?check would fail at run time!",
10494 (Last
(Pragma_Argument_Associations
(Orig
))));
10501 -- Continue with processing of short circuit
10503 Check_Unset_Reference
(L
);
10504 Check_Unset_Reference
(R
);
10506 Set_Etype
(N
, B_Typ
);
10507 Eval_Short_Circuit
(N
);
10508 end Resolve_Short_Circuit
;
10510 -------------------
10511 -- Resolve_Slice --
10512 -------------------
10514 procedure Resolve_Slice
(N
: Node_Id
; Typ
: Entity_Id
) is
10515 Drange
: constant Node_Id
:= Discrete_Range
(N
);
10516 Name
: constant Node_Id
:= Prefix
(N
);
10517 Array_Type
: Entity_Id
:= Empty
;
10518 Dexpr
: Node_Id
:= Empty
;
10519 Index_Type
: Entity_Id
;
10522 if Is_Overloaded
(Name
) then
10524 -- Use the context type to select the prefix that yields the correct
10529 I1
: Interp_Index
:= 0;
10531 P
: constant Node_Id
:= Prefix
(N
);
10532 Found
: Boolean := False;
10535 Get_First_Interp
(P
, I
, It
);
10536 while Present
(It
.Typ
) loop
10537 if (Is_Array_Type
(It
.Typ
)
10538 and then Covers
(Typ
, It
.Typ
))
10539 or else (Is_Access_Type
(It
.Typ
)
10540 and then Is_Array_Type
(Designated_Type
(It
.Typ
))
10541 and then Covers
(Typ
, Designated_Type
(It
.Typ
)))
10544 It
:= Disambiguate
(P
, I1
, I
, Any_Type
);
10546 if It
= No_Interp
then
10547 Error_Msg_N
("ambiguous prefix for slicing", N
);
10548 Set_Etype
(N
, Typ
);
10552 Array_Type
:= It
.Typ
;
10557 Array_Type
:= It
.Typ
;
10562 Get_Next_Interp
(I
, It
);
10567 Array_Type
:= Etype
(Name
);
10570 Resolve
(Name
, Array_Type
);
10572 if Is_Access_Type
(Array_Type
) then
10573 Apply_Access_Check
(N
);
10574 Array_Type
:= Designated_Type
(Array_Type
);
10576 -- If the prefix is an access to an unconstrained array, we must use
10577 -- the actual subtype of the object to perform the index checks. The
10578 -- object denoted by the prefix is implicit in the node, so we build
10579 -- an explicit representation for it in order to compute the actual
10582 if not Is_Constrained
(Array_Type
) then
10583 Remove_Side_Effects
(Prefix
(N
));
10586 Obj
: constant Node_Id
:=
10587 Make_Explicit_Dereference
(Sloc
(N
),
10588 Prefix
=> New_Copy_Tree
(Prefix
(N
)));
10590 Set_Etype
(Obj
, Array_Type
);
10591 Set_Parent
(Obj
, Parent
(N
));
10592 Array_Type
:= Get_Actual_Subtype
(Obj
);
10596 elsif Is_Entity_Name
(Name
)
10597 or else Nkind
(Name
) = N_Explicit_Dereference
10598 or else (Nkind
(Name
) = N_Function_Call
10599 and then not Is_Constrained
(Etype
(Name
)))
10601 Array_Type
:= Get_Actual_Subtype
(Name
);
10603 -- If the name is a selected component that depends on discriminants,
10604 -- build an actual subtype for it. This can happen only when the name
10605 -- itself is overloaded; otherwise the actual subtype is created when
10606 -- the selected component is analyzed.
10608 elsif Nkind
(Name
) = N_Selected_Component
10609 and then Full_Analysis
10610 and then Depends_On_Discriminant
(First_Index
(Array_Type
))
10613 Act_Decl
: constant Node_Id
:=
10614 Build_Actual_Subtype_Of_Component
(Array_Type
, Name
);
10616 Insert_Action
(N
, Act_Decl
);
10617 Array_Type
:= Defining_Identifier
(Act_Decl
);
10620 -- Maybe this should just be "else", instead of checking for the
10621 -- specific case of slice??? This is needed for the case where the
10622 -- prefix is an Image attribute, which gets expanded to a slice, and so
10623 -- has a constrained subtype which we want to use for the slice range
10624 -- check applied below (the range check won't get done if the
10625 -- unconstrained subtype of the 'Image is used).
10627 elsif Nkind
(Name
) = N_Slice
then
10628 Array_Type
:= Etype
(Name
);
10631 -- Obtain the type of the array index
10633 if Ekind
(Array_Type
) = E_String_Literal_Subtype
then
10634 Index_Type
:= Etype
(String_Literal_Low_Bound
(Array_Type
));
10636 Index_Type
:= Etype
(First_Index
(Array_Type
));
10639 -- If name was overloaded, set slice type correctly now
10641 Set_Etype
(N
, Array_Type
);
10643 -- Handle the generation of a range check that compares the array index
10644 -- against the discrete_range. The check is not applied to internally
10645 -- built nodes associated with the expansion of dispatch tables. Check
10646 -- that Ada.Tags has already been loaded to avoid extra dependencies on
10649 if Tagged_Type_Expansion
10650 and then RTU_Loaded
(Ada_Tags
)
10651 and then Nkind
(Prefix
(N
)) = N_Selected_Component
10652 and then Present
(Entity
(Selector_Name
(Prefix
(N
))))
10653 and then Entity
(Selector_Name
(Prefix
(N
))) =
10654 RTE_Record_Component
(RE_Prims_Ptr
)
10658 -- The discrete_range is specified by a subtype indication. Create a
10659 -- shallow copy and inherit the type, parent and source location from
10660 -- the discrete_range. This ensures that the range check is inserted
10661 -- relative to the slice and that the runtime exception points to the
10662 -- proper construct.
10664 elsif Is_Entity_Name
(Drange
) then
10665 Dexpr
:= New_Copy
(Scalar_Range
(Entity
(Drange
)));
10667 Set_Etype
(Dexpr
, Etype
(Drange
));
10668 Set_Parent
(Dexpr
, Parent
(Drange
));
10669 Set_Sloc
(Dexpr
, Sloc
(Drange
));
10671 -- The discrete_range is a regular range. Resolve the bounds and remove
10672 -- their side effects.
10675 Resolve
(Drange
, Base_Type
(Index_Type
));
10677 if Nkind
(Drange
) = N_Range
then
10678 Force_Evaluation
(Low_Bound
(Drange
));
10679 Force_Evaluation
(High_Bound
(Drange
));
10685 if Present
(Dexpr
) then
10686 Apply_Range_Check
(Dexpr
, Index_Type
);
10689 Set_Slice_Subtype
(N
);
10691 -- Check bad use of type with predicates
10697 if Nkind
(Drange
) = N_Subtype_Indication
10698 and then Has_Predicates
(Entity
(Subtype_Mark
(Drange
)))
10700 Subt
:= Entity
(Subtype_Mark
(Drange
));
10702 Subt
:= Etype
(Drange
);
10705 if Has_Predicates
(Subt
) then
10706 Bad_Predicated_Subtype_Use
10707 ("subtype& has predicate, not allowed in slice", Drange
, Subt
);
10711 -- Otherwise here is where we check suspicious indexes
10713 if Nkind
(Drange
) = N_Range
then
10714 Warn_On_Suspicious_Index
(Name
, Low_Bound
(Drange
));
10715 Warn_On_Suspicious_Index
(Name
, High_Bound
(Drange
));
10718 Analyze_Dimension
(N
);
10722 ----------------------------
10723 -- Resolve_String_Literal --
10724 ----------------------------
10726 procedure Resolve_String_Literal
(N
: Node_Id
; Typ
: Entity_Id
) is
10727 C_Typ
: constant Entity_Id
:= Component_Type
(Typ
);
10728 R_Typ
: constant Entity_Id
:= Root_Type
(C_Typ
);
10729 Loc
: constant Source_Ptr
:= Sloc
(N
);
10730 Str
: constant String_Id
:= Strval
(N
);
10731 Strlen
: constant Nat
:= String_Length
(Str
);
10732 Subtype_Id
: Entity_Id
;
10733 Need_Check
: Boolean;
10736 -- For a string appearing in a concatenation, defer creation of the
10737 -- string_literal_subtype until the end of the resolution of the
10738 -- concatenation, because the literal may be constant-folded away. This
10739 -- is a useful optimization for long concatenation expressions.
10741 -- If the string is an aggregate built for a single character (which
10742 -- happens in a non-static context) or a is null string to which special
10743 -- checks may apply, we build the subtype. Wide strings must also get a
10744 -- string subtype if they come from a one character aggregate. Strings
10745 -- generated by attributes might be static, but it is often hard to
10746 -- determine whether the enclosing context is static, so we generate
10747 -- subtypes for them as well, thus losing some rarer optimizations ???
10748 -- Same for strings that come from a static conversion.
10751 (Strlen
= 0 and then Typ
/= Standard_String
)
10752 or else Nkind
(Parent
(N
)) /= N_Op_Concat
10753 or else (N
/= Left_Opnd
(Parent
(N
))
10754 and then N
/= Right_Opnd
(Parent
(N
)))
10755 or else ((Typ
= Standard_Wide_String
10756 or else Typ
= Standard_Wide_Wide_String
)
10757 and then Nkind
(Original_Node
(N
)) /= N_String_Literal
);
10759 -- If the resolving type is itself a string literal subtype, we can just
10760 -- reuse it, since there is no point in creating another.
10762 if Ekind
(Typ
) = E_String_Literal_Subtype
then
10765 elsif Nkind
(Parent
(N
)) = N_Op_Concat
10766 and then not Need_Check
10767 and then not Nkind_In
(Original_Node
(N
), N_Character_Literal
,
10768 N_Attribute_Reference
,
10769 N_Qualified_Expression
,
10774 -- Do not generate a string literal subtype for the default expression
10775 -- of a formal parameter in GNATprove mode. This is because the string
10776 -- subtype is associated with the freezing actions of the subprogram,
10777 -- however freezing is disabled in GNATprove mode and as a result the
10778 -- subtype is unavailable.
10780 elsif GNATprove_Mode
10781 and then Nkind
(Parent
(N
)) = N_Parameter_Specification
10785 -- Otherwise we must create a string literal subtype. Note that the
10786 -- whole idea of string literal subtypes is simply to avoid the need
10787 -- for building a full fledged array subtype for each literal.
10790 Set_String_Literal_Subtype
(N
, Typ
);
10791 Subtype_Id
:= Etype
(N
);
10794 if Nkind
(Parent
(N
)) /= N_Op_Concat
10797 Set_Etype
(N
, Subtype_Id
);
10798 Eval_String_Literal
(N
);
10801 if Is_Limited_Composite
(Typ
)
10802 or else Is_Private_Composite
(Typ
)
10804 Error_Msg_N
("string literal not available for private array", N
);
10805 Set_Etype
(N
, Any_Type
);
10809 -- The validity of a null string has been checked in the call to
10810 -- Eval_String_Literal.
10815 -- Always accept string literal with component type Any_Character, which
10816 -- occurs in error situations and in comparisons of literals, both of
10817 -- which should accept all literals.
10819 elsif R_Typ
= Any_Character
then
10822 -- If the type is bit-packed, then we always transform the string
10823 -- literal into a full fledged aggregate.
10825 elsif Is_Bit_Packed_Array
(Typ
) then
10828 -- Deal with cases of Wide_Wide_String, Wide_String, and String
10831 -- For Standard.Wide_Wide_String, or any other type whose component
10832 -- type is Standard.Wide_Wide_Character, we know that all the
10833 -- characters in the string must be acceptable, since the parser
10834 -- accepted the characters as valid character literals.
10836 if R_Typ
= Standard_Wide_Wide_Character
then
10839 -- For the case of Standard.String, or any other type whose component
10840 -- type is Standard.Character, we must make sure that there are no
10841 -- wide characters in the string, i.e. that it is entirely composed
10842 -- of characters in range of type Character.
10844 -- If the string literal is the result of a static concatenation, the
10845 -- test has already been performed on the components, and need not be
10848 elsif R_Typ
= Standard_Character
10849 and then Nkind
(Original_Node
(N
)) /= N_Op_Concat
10851 for J
in 1 .. Strlen
loop
10852 if not In_Character_Range
(Get_String_Char
(Str
, J
)) then
10854 -- If we are out of range, post error. This is one of the
10855 -- very few places that we place the flag in the middle of
10856 -- a token, right under the offending wide character. Not
10857 -- quite clear if this is right wrt wide character encoding
10858 -- sequences, but it's only an error message.
10861 ("literal out of range of type Standard.Character",
10862 Source_Ptr
(Int
(Loc
) + J
));
10867 -- For the case of Standard.Wide_String, or any other type whose
10868 -- component type is Standard.Wide_Character, we must make sure that
10869 -- there are no wide characters in the string, i.e. that it is
10870 -- entirely composed of characters in range of type Wide_Character.
10872 -- If the string literal is the result of a static concatenation,
10873 -- the test has already been performed on the components, and need
10874 -- not be repeated.
10876 elsif R_Typ
= Standard_Wide_Character
10877 and then Nkind
(Original_Node
(N
)) /= N_Op_Concat
10879 for J
in 1 .. Strlen
loop
10880 if not In_Wide_Character_Range
(Get_String_Char
(Str
, J
)) then
10882 -- If we are out of range, post error. This is one of the
10883 -- very few places that we place the flag in the middle of
10884 -- a token, right under the offending wide character.
10886 -- This is not quite right, because characters in general
10887 -- will take more than one character position ???
10890 ("literal out of range of type Standard.Wide_Character",
10891 Source_Ptr
(Int
(Loc
) + J
));
10896 -- If the root type is not a standard character, then we will convert
10897 -- the string into an aggregate and will let the aggregate code do
10898 -- the checking. Standard Wide_Wide_Character is also OK here.
10904 -- See if the component type of the array corresponding to the string
10905 -- has compile time known bounds. If yes we can directly check
10906 -- whether the evaluation of the string will raise constraint error.
10907 -- Otherwise we need to transform the string literal into the
10908 -- corresponding character aggregate and let the aggregate code do
10909 -- the checking. We use the same transformation if the component
10910 -- type has a static predicate, which will be applied to each
10911 -- character when the aggregate is resolved.
10913 if Is_Standard_Character_Type
(R_Typ
) then
10915 -- Check for the case of full range, where we are definitely OK
10917 if Component_Type
(Typ
) = Base_Type
(Component_Type
(Typ
)) then
10921 -- Here the range is not the complete base type range, so check
10924 Comp_Typ_Lo
: constant Node_Id
:=
10925 Type_Low_Bound
(Component_Type
(Typ
));
10926 Comp_Typ_Hi
: constant Node_Id
:=
10927 Type_High_Bound
(Component_Type
(Typ
));
10932 if Compile_Time_Known_Value
(Comp_Typ_Lo
)
10933 and then Compile_Time_Known_Value
(Comp_Typ_Hi
)
10935 for J
in 1 .. Strlen
loop
10936 Char_Val
:= UI_From_Int
(Int
(Get_String_Char
(Str
, J
)));
10938 if Char_Val
< Expr_Value
(Comp_Typ_Lo
)
10939 or else Char_Val
> Expr_Value
(Comp_Typ_Hi
)
10941 Apply_Compile_Time_Constraint_Error
10942 (N
, "character out of range??",
10943 CE_Range_Check_Failed
,
10944 Loc
=> Source_Ptr
(Int
(Loc
) + J
));
10948 if not Has_Static_Predicate
(C_Typ
) then
10956 -- If we got here we meed to transform the string literal into the
10957 -- equivalent qualified positional array aggregate. This is rather
10958 -- heavy artillery for this situation, but it is hard work to avoid.
10961 Lits
: constant List_Id
:= New_List
;
10962 P
: Source_Ptr
:= Loc
+ 1;
10966 -- Build the character literals, we give them source locations that
10967 -- correspond to the string positions, which is a bit tricky given
10968 -- the possible presence of wide character escape sequences.
10970 for J
in 1 .. Strlen
loop
10971 C
:= Get_String_Char
(Str
, J
);
10972 Set_Character_Literal_Name
(C
);
10975 Make_Character_Literal
(P
,
10976 Chars
=> Name_Find
,
10977 Char_Literal_Value
=> UI_From_CC
(C
)));
10979 if In_Character_Range
(C
) then
10982 -- Should we have a call to Skip_Wide here ???
10991 Make_Qualified_Expression
(Loc
,
10992 Subtype_Mark
=> New_Occurrence_Of
(Typ
, Loc
),
10994 Make_Aggregate
(Loc
, Expressions
=> Lits
)));
10996 Analyze_And_Resolve
(N
, Typ
);
10998 end Resolve_String_Literal
;
11000 -------------------------
11001 -- Resolve_Target_Name --
11002 -------------------------
11004 procedure Resolve_Target_Name
(N
: Node_Id
; Typ
: Entity_Id
) is
11006 Set_Etype
(N
, Typ
);
11007 end Resolve_Target_Name
;
11009 -----------------------------
11010 -- Resolve_Type_Conversion --
11011 -----------------------------
11013 procedure Resolve_Type_Conversion
(N
: Node_Id
; Typ
: Entity_Id
) is
11014 Conv_OK
: constant Boolean := Conversion_OK
(N
);
11015 Operand
: constant Node_Id
:= Expression
(N
);
11016 Operand_Typ
: constant Entity_Id
:= Etype
(Operand
);
11017 Target_Typ
: constant Entity_Id
:= Etype
(N
);
11022 Test_Redundant
: Boolean := Warn_On_Redundant_Constructs
;
11023 -- Set to False to suppress cases where we want to suppress the test
11024 -- for redundancy to avoid possible false positives on this warning.
11028 and then not Valid_Conversion
(N
, Target_Typ
, Operand
)
11033 -- If the Operand Etype is Universal_Fixed, then the conversion is
11034 -- never redundant. We need this check because by the time we have
11035 -- finished the rather complex transformation, the conversion looks
11036 -- redundant when it is not.
11038 if Operand_Typ
= Universal_Fixed
then
11039 Test_Redundant
:= False;
11041 -- If the operand is marked as Any_Fixed, then special processing is
11042 -- required. This is also a case where we suppress the test for a
11043 -- redundant conversion, since most certainly it is not redundant.
11045 elsif Operand_Typ
= Any_Fixed
then
11046 Test_Redundant
:= False;
11048 -- Mixed-mode operation involving a literal. Context must be a fixed
11049 -- type which is applied to the literal subsequently.
11051 -- Multiplication and division involving two fixed type operands must
11052 -- yield a universal real because the result is computed in arbitrary
11055 if Is_Fixed_Point_Type
(Typ
)
11056 and then Nkind_In
(Operand
, N_Op_Divide
, N_Op_Multiply
)
11057 and then Etype
(Left_Opnd
(Operand
)) = Any_Fixed
11058 and then Etype
(Right_Opnd
(Operand
)) = Any_Fixed
11060 Set_Etype
(Operand
, Universal_Real
);
11062 elsif Is_Numeric_Type
(Typ
)
11063 and then Nkind_In
(Operand
, N_Op_Multiply
, N_Op_Divide
)
11064 and then (Etype
(Right_Opnd
(Operand
)) = Universal_Real
11066 Etype
(Left_Opnd
(Operand
)) = Universal_Real
)
11068 -- Return if expression is ambiguous
11070 if Unique_Fixed_Point_Type
(N
) = Any_Type
then
11073 -- If nothing else, the available fixed type is Duration
11076 Set_Etype
(Operand
, Standard_Duration
);
11079 -- Resolve the real operand with largest available precision
11081 if Etype
(Right_Opnd
(Operand
)) = Universal_Real
then
11082 Rop
:= New_Copy_Tree
(Right_Opnd
(Operand
));
11084 Rop
:= New_Copy_Tree
(Left_Opnd
(Operand
));
11087 Resolve
(Rop
, Universal_Real
);
11089 -- If the operand is a literal (it could be a non-static and
11090 -- illegal exponentiation) check whether the use of Duration
11091 -- is potentially inaccurate.
11093 if Nkind
(Rop
) = N_Real_Literal
11094 and then Realval
(Rop
) /= Ureal_0
11095 and then abs (Realval
(Rop
)) < Delta_Value
(Standard_Duration
)
11098 ("??universal real operand can only "
11099 & "be interpreted as Duration!", Rop
);
11101 ("\??precision will be lost in the conversion!", Rop
);
11104 elsif Is_Numeric_Type
(Typ
)
11105 and then Nkind
(Operand
) in N_Op
11106 and then Unique_Fixed_Point_Type
(N
) /= Any_Type
11108 Set_Etype
(Operand
, Standard_Duration
);
11111 Error_Msg_N
("invalid context for mixed mode operation", N
);
11112 Set_Etype
(Operand
, Any_Type
);
11119 -- In SPARK, a type conversion between array types should be restricted
11120 -- to types which have matching static bounds.
11122 -- Protect call to Matching_Static_Array_Bounds to avoid costly
11123 -- operation if not needed.
11125 if Restriction_Check_Required
(SPARK_05
)
11126 and then Is_Array_Type
(Target_Typ
)
11127 and then Is_Array_Type
(Operand_Typ
)
11128 and then Operand_Typ
/= Any_Composite
-- or else Operand in error
11129 and then not Matching_Static_Array_Bounds
(Target_Typ
, Operand_Typ
)
11131 Check_SPARK_05_Restriction
11132 ("array types should have matching static bounds", N
);
11135 -- In formal mode, the operand of an ancestor type conversion must be an
11136 -- object (not an expression).
11138 if Is_Tagged_Type
(Target_Typ
)
11139 and then not Is_Class_Wide_Type
(Target_Typ
)
11140 and then Is_Tagged_Type
(Operand_Typ
)
11141 and then not Is_Class_Wide_Type
(Operand_Typ
)
11142 and then Is_Ancestor
(Target_Typ
, Operand_Typ
)
11143 and then not Is_SPARK_05_Object_Reference
(Operand
)
11145 Check_SPARK_05_Restriction
("object required", Operand
);
11148 Analyze_Dimension
(N
);
11150 -- Note: we do the Eval_Type_Conversion call before applying the
11151 -- required checks for a subtype conversion. This is important, since
11152 -- both are prepared under certain circumstances to change the type
11153 -- conversion to a constraint error node, but in the case of
11154 -- Eval_Type_Conversion this may reflect an illegality in the static
11155 -- case, and we would miss the illegality (getting only a warning
11156 -- message), if we applied the type conversion checks first.
11158 Eval_Type_Conversion
(N
);
11160 -- Even when evaluation is not possible, we may be able to simplify the
11161 -- conversion or its expression. This needs to be done before applying
11162 -- checks, since otherwise the checks may use the original expression
11163 -- and defeat the simplifications. This is specifically the case for
11164 -- elimination of the floating-point Truncation attribute in
11165 -- float-to-int conversions.
11167 Simplify_Type_Conversion
(N
);
11169 -- If after evaluation we still have a type conversion, then we may need
11170 -- to apply checks required for a subtype conversion.
11172 -- Skip these type conversion checks if universal fixed operands
11173 -- operands involved, since range checks are handled separately for
11174 -- these cases (in the appropriate Expand routines in unit Exp_Fixd).
11176 if Nkind
(N
) = N_Type_Conversion
11177 and then not Is_Generic_Type
(Root_Type
(Target_Typ
))
11178 and then Target_Typ
/= Universal_Fixed
11179 and then Operand_Typ
/= Universal_Fixed
11181 Apply_Type_Conversion_Checks
(N
);
11184 -- Issue warning for conversion of simple object to its own type. We
11185 -- have to test the original nodes, since they may have been rewritten
11186 -- by various optimizations.
11188 Orig_N
:= Original_Node
(N
);
11190 -- Here we test for a redundant conversion if the warning mode is
11191 -- active (and was not locally reset), and we have a type conversion
11192 -- from source not appearing in a generic instance.
11195 and then Nkind
(Orig_N
) = N_Type_Conversion
11196 and then Comes_From_Source
(Orig_N
)
11197 and then not In_Instance
11199 Orig_N
:= Original_Node
(Expression
(Orig_N
));
11200 Orig_T
:= Target_Typ
;
11202 -- If the node is part of a larger expression, the Target_Type
11203 -- may not be the original type of the node if the context is a
11204 -- condition. Recover original type to see if conversion is needed.
11206 if Is_Boolean_Type
(Orig_T
)
11207 and then Nkind
(Parent
(N
)) in N_Op
11209 Orig_T
:= Etype
(Parent
(N
));
11212 -- If we have an entity name, then give the warning if the entity
11213 -- is the right type, or if it is a loop parameter covered by the
11214 -- original type (that's needed because loop parameters have an
11215 -- odd subtype coming from the bounds).
11217 if (Is_Entity_Name
(Orig_N
)
11219 (Etype
(Entity
(Orig_N
)) = Orig_T
11221 (Ekind
(Entity
(Orig_N
)) = E_Loop_Parameter
11222 and then Covers
(Orig_T
, Etype
(Entity
(Orig_N
))))))
11224 -- If not an entity, then type of expression must match
11226 or else Etype
(Orig_N
) = Orig_T
11228 -- One more check, do not give warning if the analyzed conversion
11229 -- has an expression with non-static bounds, and the bounds of the
11230 -- target are static. This avoids junk warnings in cases where the
11231 -- conversion is necessary to establish staticness, for example in
11232 -- a case statement.
11234 if not Is_OK_Static_Subtype
(Operand_Typ
)
11235 and then Is_OK_Static_Subtype
(Target_Typ
)
11239 -- Finally, if this type conversion occurs in a context requiring
11240 -- a prefix, and the expression is a qualified expression then the
11241 -- type conversion is not redundant, since a qualified expression
11242 -- is not a prefix, whereas a type conversion is. For example, "X
11243 -- := T'(Funx(...)).Y;" is illegal because a selected component
11244 -- requires a prefix, but a type conversion makes it legal: "X :=
11245 -- T(T'(Funx(...))).Y;"
11247 -- In Ada 2012, a qualified expression is a name, so this idiom is
11248 -- no longer needed, but we still suppress the warning because it
11249 -- seems unfriendly for warnings to pop up when you switch to the
11250 -- newer language version.
11252 elsif Nkind
(Orig_N
) = N_Qualified_Expression
11253 and then Nkind_In
(Parent
(N
), N_Attribute_Reference
,
11254 N_Indexed_Component
,
11255 N_Selected_Component
,
11257 N_Explicit_Dereference
)
11261 -- Never warn on conversion to Long_Long_Integer'Base since
11262 -- that is most likely an artifact of the extended overflow
11263 -- checking and comes from complex expanded code.
11265 elsif Orig_T
= Base_Type
(Standard_Long_Long_Integer
) then
11268 -- Here we give the redundant conversion warning. If it is an
11269 -- entity, give the name of the entity in the message. If not,
11270 -- just mention the expression.
11272 -- Shoudn't we test Warn_On_Redundant_Constructs here ???
11275 if Is_Entity_Name
(Orig_N
) then
11276 Error_Msg_Node_2
:= Orig_T
;
11277 Error_Msg_NE
-- CODEFIX
11278 ("??redundant conversion, & is of type &!",
11279 N
, Entity
(Orig_N
));
11282 ("??redundant conversion, expression is of type&!",
11289 -- Ada 2005 (AI-251): Handle class-wide interface type conversions.
11290 -- No need to perform any interface conversion if the type of the
11291 -- expression coincides with the target type.
11293 if Ada_Version
>= Ada_2005
11294 and then Expander_Active
11295 and then Operand_Typ
/= Target_Typ
11298 Opnd
: Entity_Id
:= Operand_Typ
;
11299 Target
: Entity_Id
:= Target_Typ
;
11302 -- If the type of the operand is a limited view, use nonlimited
11303 -- view when available. If it is a class-wide type, recover the
11304 -- class-wide type of the nonlimited view.
11306 if From_Limited_With
(Opnd
)
11307 and then Has_Non_Limited_View
(Opnd
)
11309 Opnd
:= Non_Limited_View
(Opnd
);
11310 Set_Etype
(Expression
(N
), Opnd
);
11313 if Is_Access_Type
(Opnd
) then
11314 Opnd
:= Designated_Type
(Opnd
);
11317 if Is_Access_Type
(Target_Typ
) then
11318 Target
:= Designated_Type
(Target
);
11321 if Opnd
= Target
then
11324 -- Conversion from interface type
11326 elsif Is_Interface
(Opnd
) then
11328 -- Ada 2005 (AI-217): Handle entities from limited views
11330 if From_Limited_With
(Opnd
) then
11331 Error_Msg_Qual_Level
:= 99;
11332 Error_Msg_NE
-- CODEFIX
11333 ("missing WITH clause on package &", N
,
11334 Cunit_Entity
(Get_Source_Unit
(Base_Type
(Opnd
))));
11336 ("type conversions require visibility of the full view",
11339 elsif From_Limited_With
(Target
)
11341 (Is_Access_Type
(Target_Typ
)
11342 and then Present
(Non_Limited_View
(Etype
(Target
))))
11344 Error_Msg_Qual_Level
:= 99;
11345 Error_Msg_NE
-- CODEFIX
11346 ("missing WITH clause on package &", N
,
11347 Cunit_Entity
(Get_Source_Unit
(Base_Type
(Target
))));
11349 ("type conversions require visibility of the full view",
11353 Expand_Interface_Conversion
(N
);
11356 -- Conversion to interface type
11358 elsif Is_Interface
(Target
) then
11362 if Ekind_In
(Opnd
, E_Protected_Subtype
, E_Task_Subtype
) then
11363 Opnd
:= Etype
(Opnd
);
11366 if Is_Class_Wide_Type
(Opnd
)
11367 or else Interface_Present_In_Ancestor
11371 Expand_Interface_Conversion
(N
);
11373 Error_Msg_Name_1
:= Chars
(Etype
(Target
));
11374 Error_Msg_Name_2
:= Chars
(Opnd
);
11376 ("wrong interface conversion (% is not a progenitor "
11383 -- Ada 2012: once the type conversion is resolved, check whether the
11384 -- operand statisfies the static predicate of the target type.
11386 if Has_Predicates
(Target_Typ
) then
11387 Check_Expression_Against_Static_Predicate
(N
, Target_Typ
);
11390 -- If at this stage we have a real to integer conversion, make sure that
11391 -- the Do_Range_Check flag is set, because such conversions in general
11392 -- need a range check. We only need this if expansion is off.
11393 -- In GNATprove mode, we only do that when converting from fixed-point
11394 -- (as floating-point to integer conversions are now handled in
11395 -- GNATprove mode).
11397 if Nkind
(N
) = N_Type_Conversion
11398 and then not Expander_Active
11399 and then Is_Integer_Type
(Target_Typ
)
11400 and then (Is_Fixed_Point_Type
(Operand_Typ
)
11401 or else (not GNATprove_Mode
11402 and then Is_Floating_Point_Type
(Operand_Typ
)))
11404 Set_Do_Range_Check
(Operand
);
11407 -- Generating C code a type conversion of an access to constrained
11408 -- array type to access to unconstrained array type involves building
11409 -- a fat pointer which in general cannot be generated on the fly. We
11410 -- remove side effects in order to store the result of the conversion
11411 -- into a temporary.
11413 if Modify_Tree_For_C
11414 and then Nkind
(N
) = N_Type_Conversion
11415 and then Nkind
(Parent
(N
)) /= N_Object_Declaration
11416 and then Is_Access_Type
(Etype
(N
))
11417 and then Is_Array_Type
(Designated_Type
(Etype
(N
)))
11418 and then not Is_Constrained
(Designated_Type
(Etype
(N
)))
11419 and then Is_Constrained
(Designated_Type
(Etype
(Expression
(N
))))
11421 Remove_Side_Effects
(N
);
11423 end Resolve_Type_Conversion
;
11425 ----------------------
11426 -- Resolve_Unary_Op --
11427 ----------------------
11429 procedure Resolve_Unary_Op
(N
: Node_Id
; Typ
: Entity_Id
) is
11430 B_Typ
: constant Entity_Id
:= Base_Type
(Typ
);
11431 R
: constant Node_Id
:= Right_Opnd
(N
);
11437 if Is_Modular_Integer_Type
(Typ
) and then Nkind
(N
) /= N_Op_Not
then
11438 Error_Msg_Name_1
:= Chars
(Typ
);
11439 Check_SPARK_05_Restriction
11440 ("unary operator not defined for modular type%", N
);
11443 -- Deal with intrinsic unary operators
11445 if Comes_From_Source
(N
)
11446 and then Ekind
(Entity
(N
)) = E_Function
11447 and then Is_Imported
(Entity
(N
))
11448 and then Is_Intrinsic_Subprogram
(Entity
(N
))
11450 Resolve_Intrinsic_Unary_Operator
(N
, Typ
);
11454 -- Deal with universal cases
11456 if Etype
(R
) = Universal_Integer
11458 Etype
(R
) = Universal_Real
11460 Check_For_Visible_Operator
(N
, B_Typ
);
11463 Set_Etype
(N
, B_Typ
);
11464 Resolve
(R
, B_Typ
);
11466 -- Generate warning for expressions like abs (x mod 2)
11468 if Warn_On_Redundant_Constructs
11469 and then Nkind
(N
) = N_Op_Abs
11471 Determine_Range
(Right_Opnd
(N
), OK
, Lo
, Hi
);
11473 if OK
and then Hi
>= Lo
and then Lo
>= 0 then
11474 Error_Msg_N
-- CODEFIX
11475 ("?r?abs applied to known non-negative value has no effect", N
);
11479 -- Deal with reference generation
11481 Check_Unset_Reference
(R
);
11482 Generate_Operator_Reference
(N
, B_Typ
);
11483 Analyze_Dimension
(N
);
11486 -- Set overflow checking bit. Much cleverer code needed here eventually
11487 -- and perhaps the Resolve routines should be separated for the various
11488 -- arithmetic operations, since they will need different processing ???
11490 if Nkind
(N
) in N_Op
then
11491 if not Overflow_Checks_Suppressed
(Etype
(N
)) then
11492 Enable_Overflow_Check
(N
);
11496 -- Generate warning for expressions like -5 mod 3 for integers. No need
11497 -- to worry in the floating-point case, since parens do not affect the
11498 -- result so there is no point in giving in a warning.
11501 Norig
: constant Node_Id
:= Original_Node
(N
);
11510 if Warn_On_Questionable_Missing_Parens
11511 and then Comes_From_Source
(Norig
)
11512 and then Is_Integer_Type
(Typ
)
11513 and then Nkind
(Norig
) = N_Op_Minus
11515 Rorig
:= Original_Node
(Right_Opnd
(Norig
));
11517 -- We are looking for cases where the right operand is not
11518 -- parenthesized, and is a binary operator, multiply, divide, or
11519 -- mod. These are the cases where the grouping can affect results.
11521 if Paren_Count
(Rorig
) = 0
11522 and then Nkind_In
(Rorig
, N_Op_Mod
, N_Op_Multiply
, N_Op_Divide
)
11524 -- For mod, we always give the warning, since the value is
11525 -- affected by the parenthesization (e.g. (-5) mod 315 /=
11526 -- -(5 mod 315)). But for the other cases, the only concern is
11527 -- overflow, e.g. for the case of 8 big signed (-(2 * 64)
11528 -- overflows, but (-2) * 64 does not). So we try to give the
11529 -- message only when overflow is possible.
11531 if Nkind
(Rorig
) /= N_Op_Mod
11532 and then Compile_Time_Known_Value
(R
)
11534 Val
:= Expr_Value
(R
);
11536 if Compile_Time_Known_Value
(Type_High_Bound
(Typ
)) then
11537 HB
:= Expr_Value
(Type_High_Bound
(Typ
));
11539 HB
:= Expr_Value
(Type_High_Bound
(Base_Type
(Typ
)));
11542 if Compile_Time_Known_Value
(Type_Low_Bound
(Typ
)) then
11543 LB
:= Expr_Value
(Type_Low_Bound
(Typ
));
11545 LB
:= Expr_Value
(Type_Low_Bound
(Base_Type
(Typ
)));
11548 -- Note that the test below is deliberately excluding the
11549 -- largest negative number, since that is a potentially
11550 -- troublesome case (e.g. -2 * x, where the result is the
11551 -- largest negative integer has an overflow with 2 * x).
11553 if Val
> LB
and then Val
<= HB
then
11558 -- For the multiplication case, the only case we have to worry
11559 -- about is when (-a)*b is exactly the largest negative number
11560 -- so that -(a*b) can cause overflow. This can only happen if
11561 -- a is a power of 2, and more generally if any operand is a
11562 -- constant that is not a power of 2, then the parentheses
11563 -- cannot affect whether overflow occurs. We only bother to
11564 -- test the left most operand
11566 -- Loop looking at left operands for one that has known value
11569 Opnd_Loop
: while Nkind
(Opnd
) = N_Op_Multiply
loop
11570 if Compile_Time_Known_Value
(Left_Opnd
(Opnd
)) then
11571 Lval
:= UI_Abs
(Expr_Value
(Left_Opnd
(Opnd
)));
11573 -- Operand value of 0 or 1 skips warning
11578 -- Otherwise check power of 2, if power of 2, warn, if
11579 -- anything else, skip warning.
11582 while Lval
/= 2 loop
11583 if Lval
mod 2 = 1 then
11594 -- Keep looking at left operands
11596 Opnd
:= Left_Opnd
(Opnd
);
11597 end loop Opnd_Loop
;
11599 -- For rem or "/" we can only have a problematic situation
11600 -- if the divisor has a value of minus one or one. Otherwise
11601 -- overflow is impossible (divisor > 1) or we have a case of
11602 -- division by zero in any case.
11604 if Nkind_In
(Rorig
, N_Op_Divide
, N_Op_Rem
)
11605 and then Compile_Time_Known_Value
(Right_Opnd
(Rorig
))
11606 and then UI_Abs
(Expr_Value
(Right_Opnd
(Rorig
))) /= 1
11611 -- If we fall through warning should be issued
11613 -- Shouldn't we test Warn_On_Questionable_Missing_Parens ???
11616 ("??unary minus expression should be parenthesized here!", N
);
11620 end Resolve_Unary_Op
;
11622 ----------------------------------
11623 -- Resolve_Unchecked_Expression --
11624 ----------------------------------
11626 procedure Resolve_Unchecked_Expression
11631 Resolve
(Expression
(N
), Typ
, Suppress
=> All_Checks
);
11632 Set_Etype
(N
, Typ
);
11633 end Resolve_Unchecked_Expression
;
11635 ---------------------------------------
11636 -- Resolve_Unchecked_Type_Conversion --
11637 ---------------------------------------
11639 procedure Resolve_Unchecked_Type_Conversion
11643 pragma Warnings
(Off
, Typ
);
11645 Operand
: constant Node_Id
:= Expression
(N
);
11646 Opnd_Type
: constant Entity_Id
:= Etype
(Operand
);
11649 -- Resolve operand using its own type
11651 Resolve
(Operand
, Opnd_Type
);
11653 -- In an inlined context, the unchecked conversion may be applied
11654 -- to a literal, in which case its type is the type of the context.
11655 -- (In other contexts conversions cannot apply to literals).
11658 and then (Opnd_Type
= Any_Character
or else
11659 Opnd_Type
= Any_Integer
or else
11660 Opnd_Type
= Any_Real
)
11662 Set_Etype
(Operand
, Typ
);
11665 Analyze_Dimension
(N
);
11666 Eval_Unchecked_Conversion
(N
);
11667 end Resolve_Unchecked_Type_Conversion
;
11669 ------------------------------
11670 -- Rewrite_Operator_As_Call --
11671 ------------------------------
11673 procedure Rewrite_Operator_As_Call
(N
: Node_Id
; Nam
: Entity_Id
) is
11674 Loc
: constant Source_Ptr
:= Sloc
(N
);
11675 Actuals
: constant List_Id
:= New_List
;
11679 if Nkind
(N
) in N_Binary_Op
then
11680 Append
(Left_Opnd
(N
), Actuals
);
11683 Append
(Right_Opnd
(N
), Actuals
);
11686 Make_Function_Call
(Sloc
=> Loc
,
11687 Name
=> New_Occurrence_Of
(Nam
, Loc
),
11688 Parameter_Associations
=> Actuals
);
11690 Preserve_Comes_From_Source
(New_N
, N
);
11691 Preserve_Comes_From_Source
(Name
(New_N
), N
);
11692 Rewrite
(N
, New_N
);
11693 Set_Etype
(N
, Etype
(Nam
));
11694 end Rewrite_Operator_As_Call
;
11696 ------------------------------
11697 -- Rewrite_Renamed_Operator --
11698 ------------------------------
11700 procedure Rewrite_Renamed_Operator
11705 Nam
: constant Name_Id
:= Chars
(Op
);
11706 Is_Binary
: constant Boolean := Nkind
(N
) in N_Binary_Op
;
11710 -- Do not perform this transformation within a pre/postcondition,
11711 -- because the expression will be reanalyzed, and the transformation
11712 -- might affect the visibility of the operator, e.g. in an instance.
11713 -- Note that fully analyzed and expanded pre/postconditions appear as
11714 -- pragma Check equivalents.
11716 if In_Pre_Post_Condition
(N
) then
11720 -- Likewise when an expression function is being preanalyzed, since the
11721 -- expression will be reanalyzed as part of the generated body.
11723 if In_Spec_Expression
then
11725 S
: constant Entity_Id
:= Current_Scope_No_Loops
;
11727 if Ekind
(S
) = E_Function
11728 and then Nkind
(Original_Node
(Unit_Declaration_Node
(S
))) =
11729 N_Expression_Function
11736 -- Rewrite the operator node using the real operator, not its renaming.
11737 -- Exclude user-defined intrinsic operations of the same name, which are
11738 -- treated separately and rewritten as calls.
11740 if Ekind
(Op
) /= E_Function
or else Chars
(N
) /= Nam
then
11741 Op_Node
:= New_Node
(Operator_Kind
(Nam
, Is_Binary
), Sloc
(N
));
11742 Set_Chars
(Op_Node
, Nam
);
11743 Set_Etype
(Op_Node
, Etype
(N
));
11744 Set_Entity
(Op_Node
, Op
);
11745 Set_Right_Opnd
(Op_Node
, Right_Opnd
(N
));
11747 -- Indicate that both the original entity and its renaming are
11748 -- referenced at this point.
11750 Generate_Reference
(Entity
(N
), N
);
11751 Generate_Reference
(Op
, N
);
11754 Set_Left_Opnd
(Op_Node
, Left_Opnd
(N
));
11757 Rewrite
(N
, Op_Node
);
11759 -- If the context type is private, add the appropriate conversions so
11760 -- that the operator is applied to the full view. This is done in the
11761 -- routines that resolve intrinsic operators.
11763 if Is_Intrinsic_Subprogram
(Op
) and then Is_Private_Type
(Typ
) then
11773 Resolve_Intrinsic_Operator
(N
, Typ
);
11779 Resolve_Intrinsic_Unary_Operator
(N
, Typ
);
11786 elsif Ekind
(Op
) = E_Function
and then Is_Intrinsic_Subprogram
(Op
) then
11788 -- Operator renames a user-defined operator of the same name. Use the
11789 -- original operator in the node, which is the one Gigi knows about.
11791 Set_Entity
(N
, Op
);
11792 Set_Is_Overloaded
(N
, False);
11794 end Rewrite_Renamed_Operator
;
11796 -----------------------
11797 -- Set_Slice_Subtype --
11798 -----------------------
11800 -- Build an implicit subtype declaration to represent the type delivered by
11801 -- the slice. This is an abbreviated version of an array subtype. We define
11802 -- an index subtype for the slice, using either the subtype name or the
11803 -- discrete range of the slice. To be consistent with index usage elsewhere
11804 -- we create a list header to hold the single index. This list is not
11805 -- otherwise attached to the syntax tree.
11807 procedure Set_Slice_Subtype
(N
: Node_Id
) is
11808 Loc
: constant Source_Ptr
:= Sloc
(N
);
11809 Index_List
: constant List_Id
:= New_List
;
11811 Index_Subtype
: Entity_Id
;
11812 Index_Type
: Entity_Id
;
11813 Slice_Subtype
: Entity_Id
;
11814 Drange
: constant Node_Id
:= Discrete_Range
(N
);
11817 Index_Type
:= Base_Type
(Etype
(Drange
));
11819 if Is_Entity_Name
(Drange
) then
11820 Index_Subtype
:= Entity
(Drange
);
11823 -- We force the evaluation of a range. This is definitely needed in
11824 -- the renamed case, and seems safer to do unconditionally. Note in
11825 -- any case that since we will create and insert an Itype referring
11826 -- to this range, we must make sure any side effect removal actions
11827 -- are inserted before the Itype definition.
11829 if Nkind
(Drange
) = N_Range
then
11830 Force_Evaluation
(Low_Bound
(Drange
));
11831 Force_Evaluation
(High_Bound
(Drange
));
11833 -- If the discrete range is given by a subtype indication, the
11834 -- type of the slice is the base of the subtype mark.
11836 elsif Nkind
(Drange
) = N_Subtype_Indication
then
11838 R
: constant Node_Id
:= Range_Expression
(Constraint
(Drange
));
11840 Index_Type
:= Base_Type
(Entity
(Subtype_Mark
(Drange
)));
11841 Force_Evaluation
(Low_Bound
(R
));
11842 Force_Evaluation
(High_Bound
(R
));
11846 Index_Subtype
:= Create_Itype
(Subtype_Kind
(Ekind
(Index_Type
)), N
);
11848 -- Take a new copy of Drange (where bounds have been rewritten to
11849 -- reference side-effect-free names). Using a separate tree ensures
11850 -- that further expansion (e.g. while rewriting a slice assignment
11851 -- into a FOR loop) does not attempt to remove side effects on the
11852 -- bounds again (which would cause the bounds in the index subtype
11853 -- definition to refer to temporaries before they are defined) (the
11854 -- reason is that some names are considered side effect free here
11855 -- for the subtype, but not in the context of a loop iteration
11858 Set_Scalar_Range
(Index_Subtype
, New_Copy_Tree
(Drange
));
11859 Set_Parent
(Scalar_Range
(Index_Subtype
), Index_Subtype
);
11860 Set_Etype
(Index_Subtype
, Index_Type
);
11861 Set_Size_Info
(Index_Subtype
, Index_Type
);
11862 Set_RM_Size
(Index_Subtype
, RM_Size
(Index_Type
));
11865 Slice_Subtype
:= Create_Itype
(E_Array_Subtype
, N
);
11867 Index
:= New_Occurrence_Of
(Index_Subtype
, Loc
);
11868 Set_Etype
(Index
, Index_Subtype
);
11869 Append
(Index
, Index_List
);
11871 Set_First_Index
(Slice_Subtype
, Index
);
11872 Set_Etype
(Slice_Subtype
, Base_Type
(Etype
(N
)));
11873 Set_Is_Constrained
(Slice_Subtype
, True);
11875 Check_Compile_Time_Size
(Slice_Subtype
);
11877 -- The Etype of the existing Slice node is reset to this slice subtype.
11878 -- Its bounds are obtained from its first index.
11880 Set_Etype
(N
, Slice_Subtype
);
11882 -- For bit-packed slice subtypes, freeze immediately (except in the case
11883 -- of being in a "spec expression" where we never freeze when we first
11884 -- see the expression).
11886 if Is_Bit_Packed_Array
(Slice_Subtype
) and not In_Spec_Expression
then
11887 Freeze_Itype
(Slice_Subtype
, N
);
11889 -- For all other cases insert an itype reference in the slice's actions
11890 -- so that the itype is frozen at the proper place in the tree (i.e. at
11891 -- the point where actions for the slice are analyzed). Note that this
11892 -- is different from freezing the itype immediately, which might be
11893 -- premature (e.g. if the slice is within a transient scope). This needs
11894 -- to be done only if expansion is enabled.
11896 elsif Expander_Active
then
11897 Ensure_Defined
(Typ
=> Slice_Subtype
, N
=> N
);
11899 end Set_Slice_Subtype
;
11901 --------------------------------
11902 -- Set_String_Literal_Subtype --
11903 --------------------------------
11905 procedure Set_String_Literal_Subtype
(N
: Node_Id
; Typ
: Entity_Id
) is
11906 Loc
: constant Source_Ptr
:= Sloc
(N
);
11907 Low_Bound
: constant Node_Id
:=
11908 Type_Low_Bound
(Etype
(First_Index
(Typ
)));
11909 Subtype_Id
: Entity_Id
;
11912 if Nkind
(N
) /= N_String_Literal
then
11916 Subtype_Id
:= Create_Itype
(E_String_Literal_Subtype
, N
);
11917 Set_String_Literal_Length
(Subtype_Id
, UI_From_Int
11918 (String_Length
(Strval
(N
))));
11919 Set_Etype
(Subtype_Id
, Base_Type
(Typ
));
11920 Set_Is_Constrained
(Subtype_Id
);
11921 Set_Etype
(N
, Subtype_Id
);
11923 -- The low bound is set from the low bound of the corresponding index
11924 -- type. Note that we do not store the high bound in the string literal
11925 -- subtype, but it can be deduced if necessary from the length and the
11928 if Is_OK_Static_Expression
(Low_Bound
) then
11929 Set_String_Literal_Low_Bound
(Subtype_Id
, Low_Bound
);
11931 -- If the lower bound is not static we create a range for the string
11932 -- literal, using the index type and the known length of the literal.
11933 -- The index type is not necessarily Positive, so the upper bound is
11934 -- computed as T'Val (T'Pos (Low_Bound) + L - 1).
11938 Index_List
: constant List_Id
:= New_List
;
11939 Index_Type
: constant Entity_Id
:= Etype
(First_Index
(Typ
));
11940 High_Bound
: constant Node_Id
:=
11941 Make_Attribute_Reference
(Loc
,
11942 Attribute_Name
=> Name_Val
,
11944 New_Occurrence_Of
(Index_Type
, Loc
),
11945 Expressions
=> New_List
(
11948 Make_Attribute_Reference
(Loc
,
11949 Attribute_Name
=> Name_Pos
,
11951 New_Occurrence_Of
(Index_Type
, Loc
),
11953 New_List
(New_Copy_Tree
(Low_Bound
))),
11955 Make_Integer_Literal
(Loc
,
11956 String_Length
(Strval
(N
)) - 1))));
11958 Array_Subtype
: Entity_Id
;
11961 Index_Subtype
: Entity_Id
;
11964 if Is_Integer_Type
(Index_Type
) then
11965 Set_String_Literal_Low_Bound
11966 (Subtype_Id
, Make_Integer_Literal
(Loc
, 1));
11969 -- If the index type is an enumeration type, build bounds
11970 -- expression with attributes.
11972 Set_String_Literal_Low_Bound
11974 Make_Attribute_Reference
(Loc
,
11975 Attribute_Name
=> Name_First
,
11977 New_Occurrence_Of
(Base_Type
(Index_Type
), Loc
)));
11978 Set_Etype
(String_Literal_Low_Bound
(Subtype_Id
), Index_Type
);
11981 Analyze_And_Resolve
(String_Literal_Low_Bound
(Subtype_Id
));
11983 -- Build bona fide subtype for the string, and wrap it in an
11984 -- unchecked conversion, because the back end expects the
11985 -- String_Literal_Subtype to have a static lower bound.
11988 Create_Itype
(Subtype_Kind
(Ekind
(Index_Type
)), N
);
11989 Drange
:= Make_Range
(Loc
, New_Copy_Tree
(Low_Bound
), High_Bound
);
11990 Set_Scalar_Range
(Index_Subtype
, Drange
);
11991 Set_Parent
(Drange
, N
);
11992 Analyze_And_Resolve
(Drange
, Index_Type
);
11994 -- In this context, the Index_Type may already have a constraint,
11995 -- so use common base type on string subtype. The base type may
11996 -- be used when generating attributes of the string, for example
11997 -- in the context of a slice assignment.
11999 Set_Etype
(Index_Subtype
, Base_Type
(Index_Type
));
12000 Set_Size_Info
(Index_Subtype
, Index_Type
);
12001 Set_RM_Size
(Index_Subtype
, RM_Size
(Index_Type
));
12003 Array_Subtype
:= Create_Itype
(E_Array_Subtype
, N
);
12005 Index
:= New_Occurrence_Of
(Index_Subtype
, Loc
);
12006 Set_Etype
(Index
, Index_Subtype
);
12007 Append
(Index
, Index_List
);
12009 Set_First_Index
(Array_Subtype
, Index
);
12010 Set_Etype
(Array_Subtype
, Base_Type
(Typ
));
12011 Set_Is_Constrained
(Array_Subtype
, True);
12014 Make_Unchecked_Type_Conversion
(Loc
,
12015 Subtype_Mark
=> New_Occurrence_Of
(Array_Subtype
, Loc
),
12016 Expression
=> Relocate_Node
(N
)));
12017 Set_Etype
(N
, Array_Subtype
);
12020 end Set_String_Literal_Subtype
;
12022 ------------------------------
12023 -- Simplify_Type_Conversion --
12024 ------------------------------
12026 procedure Simplify_Type_Conversion
(N
: Node_Id
) is
12028 if Nkind
(N
) = N_Type_Conversion
then
12030 Operand
: constant Node_Id
:= Expression
(N
);
12031 Target_Typ
: constant Entity_Id
:= Etype
(N
);
12032 Opnd_Typ
: constant Entity_Id
:= Etype
(Operand
);
12035 -- Special processing if the conversion is the expression of a
12036 -- Rounding or Truncation attribute reference. In this case we
12039 -- ityp (ftyp'Rounding (x)) or ityp (ftyp'Truncation (x))
12045 -- with the Float_Truncate flag set to False or True respectively,
12046 -- which is more efficient.
12048 if Is_Floating_Point_Type
(Opnd_Typ
)
12050 (Is_Integer_Type
(Target_Typ
)
12051 or else (Is_Fixed_Point_Type
(Target_Typ
)
12052 and then Conversion_OK
(N
)))
12053 and then Nkind
(Operand
) = N_Attribute_Reference
12054 and then Nam_In
(Attribute_Name
(Operand
), Name_Rounding
,
12058 Truncate
: constant Boolean :=
12059 Attribute_Name
(Operand
) = Name_Truncation
;
12062 Relocate_Node
(First
(Expressions
(Operand
))));
12063 Set_Float_Truncate
(N
, Truncate
);
12068 end Simplify_Type_Conversion
;
12070 -----------------------------
12071 -- Unique_Fixed_Point_Type --
12072 -----------------------------
12074 function Unique_Fixed_Point_Type
(N
: Node_Id
) return Entity_Id
is
12075 procedure Fixed_Point_Error
(T1
: Entity_Id
; T2
: Entity_Id
);
12076 -- Give error messages for true ambiguity. Messages are posted on node
12077 -- N, and entities T1, T2 are the possible interpretations.
12079 -----------------------
12080 -- Fixed_Point_Error --
12081 -----------------------
12083 procedure Fixed_Point_Error
(T1
: Entity_Id
; T2
: Entity_Id
) is
12085 Error_Msg_N
("ambiguous universal_fixed_expression", N
);
12086 Error_Msg_NE
("\\possible interpretation as}", N
, T1
);
12087 Error_Msg_NE
("\\possible interpretation as}", N
, T2
);
12088 end Fixed_Point_Error
;
12098 -- Start of processing for Unique_Fixed_Point_Type
12101 -- The operations on Duration are visible, so Duration is always a
12102 -- possible interpretation.
12104 T1
:= Standard_Duration
;
12106 -- Look for fixed-point types in enclosing scopes
12108 Scop
:= Current_Scope
;
12109 while Scop
/= Standard_Standard
loop
12110 T2
:= First_Entity
(Scop
);
12111 while Present
(T2
) loop
12112 if Is_Fixed_Point_Type
(T2
)
12113 and then Current_Entity
(T2
) = T2
12114 and then Scope
(Base_Type
(T2
)) = Scop
12116 if Present
(T1
) then
12117 Fixed_Point_Error
(T1
, T2
);
12127 Scop
:= Scope
(Scop
);
12130 -- Look for visible fixed type declarations in the context
12132 Item
:= First
(Context_Items
(Cunit
(Current_Sem_Unit
)));
12133 while Present
(Item
) loop
12134 if Nkind
(Item
) = N_With_Clause
then
12135 Scop
:= Entity
(Name
(Item
));
12136 T2
:= First_Entity
(Scop
);
12137 while Present
(T2
) loop
12138 if Is_Fixed_Point_Type
(T2
)
12139 and then Scope
(Base_Type
(T2
)) = Scop
12140 and then (Is_Potentially_Use_Visible
(T2
) or else In_Use
(T2
))
12142 if Present
(T1
) then
12143 Fixed_Point_Error
(T1
, T2
);
12157 if Nkind
(N
) = N_Real_Literal
then
12158 Error_Msg_NE
("??real literal interpreted as }!", N
, T1
);
12161 -- When the context is a type conversion, issue the warning on the
12162 -- expression of the conversion because it is the actual operation.
12164 if Nkind_In
(N
, N_Type_Conversion
, N_Unchecked_Type_Conversion
) then
12165 ErrN
:= Expression
(N
);
12171 ("??universal_fixed expression interpreted as }!", ErrN
, T1
);
12175 end Unique_Fixed_Point_Type
;
12177 ----------------------
12178 -- Valid_Conversion --
12179 ----------------------
12181 function Valid_Conversion
12183 Target
: Entity_Id
;
12185 Report_Errs
: Boolean := True) return Boolean
12187 Target_Type
: constant Entity_Id
:= Base_Type
(Target
);
12188 Opnd_Type
: Entity_Id
:= Etype
(Operand
);
12189 Inc_Ancestor
: Entity_Id
;
12191 function Conversion_Check
12193 Msg
: String) return Boolean;
12194 -- Little routine to post Msg if Valid is False, returns Valid value
12196 procedure Conversion_Error_N
(Msg
: String; N
: Node_Or_Entity_Id
);
12197 -- If Report_Errs, then calls Errout.Error_Msg_N with its arguments
12199 procedure Conversion_Error_NE
12201 N
: Node_Or_Entity_Id
;
12202 E
: Node_Or_Entity_Id
);
12203 -- If Report_Errs, then calls Errout.Error_Msg_NE with its arguments
12205 function In_Instance_Code
return Boolean;
12206 -- Return True if expression is within an instance but is not in one of
12207 -- the actuals of the instantiation. Type conversions within an instance
12208 -- are not rechecked because type visbility may lead to spurious errors,
12209 -- but conversions in an actual for a formal object must be checked.
12211 function Valid_Tagged_Conversion
12212 (Target_Type
: Entity_Id
;
12213 Opnd_Type
: Entity_Id
) return Boolean;
12214 -- Specifically test for validity of tagged conversions
12216 function Valid_Array_Conversion
return Boolean;
12217 -- Check index and component conformance, and accessibility levels if
12218 -- the component types are anonymous access types (Ada 2005).
12220 ----------------------
12221 -- Conversion_Check --
12222 ----------------------
12224 function Conversion_Check
12226 Msg
: String) return Boolean
12231 -- A generic unit has already been analyzed and we have verified
12232 -- that a particular conversion is OK in that context. Since the
12233 -- instance is reanalyzed without relying on the relationships
12234 -- established during the analysis of the generic, it is possible
12235 -- to end up with inconsistent views of private types. Do not emit
12236 -- the error message in such cases. The rest of the machinery in
12237 -- Valid_Conversion still ensures the proper compatibility of
12238 -- target and operand types.
12240 and then not In_Instance_Code
12242 Conversion_Error_N
(Msg
, Operand
);
12246 end Conversion_Check
;
12248 ------------------------
12249 -- Conversion_Error_N --
12250 ------------------------
12252 procedure Conversion_Error_N
(Msg
: String; N
: Node_Or_Entity_Id
) is
12254 if Report_Errs
then
12255 Error_Msg_N
(Msg
, N
);
12257 end Conversion_Error_N
;
12259 -------------------------
12260 -- Conversion_Error_NE --
12261 -------------------------
12263 procedure Conversion_Error_NE
12265 N
: Node_Or_Entity_Id
;
12266 E
: Node_Or_Entity_Id
)
12269 if Report_Errs
then
12270 Error_Msg_NE
(Msg
, N
, E
);
12272 end Conversion_Error_NE
;
12274 ----------------------
12275 -- In_Instance_Code --
12276 ----------------------
12278 function In_Instance_Code
return Boolean is
12282 if not In_Instance
then
12287 while Present
(Par
) loop
12289 -- The expression is part of an actual object if it appears in
12290 -- the generated object declaration in the instance.
12292 if Nkind
(Par
) = N_Object_Declaration
12293 and then Present
(Corresponding_Generic_Association
(Par
))
12299 Nkind
(Par
) in N_Statement_Other_Than_Procedure_Call
12300 or else Nkind
(Par
) in N_Subprogram_Call
12301 or else Nkind
(Par
) in N_Declaration
;
12304 Par
:= Parent
(Par
);
12307 -- Otherwise the expression appears within the instantiated unit
12311 end In_Instance_Code
;
12313 ----------------------------
12314 -- Valid_Array_Conversion --
12315 ----------------------------
12317 function Valid_Array_Conversion
return Boolean is
12318 Opnd_Comp_Type
: constant Entity_Id
:= Component_Type
(Opnd_Type
);
12319 Opnd_Comp_Base
: constant Entity_Id
:= Base_Type
(Opnd_Comp_Type
);
12321 Opnd_Index
: Node_Id
;
12322 Opnd_Index_Type
: Entity_Id
;
12324 Target_Comp_Type
: constant Entity_Id
:=
12325 Component_Type
(Target_Type
);
12326 Target_Comp_Base
: constant Entity_Id
:=
12327 Base_Type
(Target_Comp_Type
);
12329 Target_Index
: Node_Id
;
12330 Target_Index_Type
: Entity_Id
;
12333 -- Error if wrong number of dimensions
12336 Number_Dimensions
(Target_Type
) /= Number_Dimensions
(Opnd_Type
)
12339 ("incompatible number of dimensions for conversion", Operand
);
12342 -- Number of dimensions matches
12345 -- Loop through indexes of the two arrays
12347 Target_Index
:= First_Index
(Target_Type
);
12348 Opnd_Index
:= First_Index
(Opnd_Type
);
12349 while Present
(Target_Index
) and then Present
(Opnd_Index
) loop
12350 Target_Index_Type
:= Etype
(Target_Index
);
12351 Opnd_Index_Type
:= Etype
(Opnd_Index
);
12353 -- Error if index types are incompatible
12355 if not (Is_Integer_Type
(Target_Index_Type
)
12356 and then Is_Integer_Type
(Opnd_Index_Type
))
12357 and then (Root_Type
(Target_Index_Type
)
12358 /= Root_Type
(Opnd_Index_Type
))
12361 ("incompatible index types for array conversion",
12366 Next_Index
(Target_Index
);
12367 Next_Index
(Opnd_Index
);
12370 -- If component types have same base type, all set
12372 if Target_Comp_Base
= Opnd_Comp_Base
then
12375 -- Here if base types of components are not the same. The only
12376 -- time this is allowed is if we have anonymous access types.
12378 -- The conversion of arrays of anonymous access types can lead
12379 -- to dangling pointers. AI-392 formalizes the accessibility
12380 -- checks that must be applied to such conversions to prevent
12381 -- out-of-scope references.
12384 (Target_Comp_Base
, E_Anonymous_Access_Type
,
12385 E_Anonymous_Access_Subprogram_Type
)
12386 and then Ekind
(Opnd_Comp_Base
) = Ekind
(Target_Comp_Base
)
12388 Subtypes_Statically_Match
(Target_Comp_Type
, Opnd_Comp_Type
)
12390 if Type_Access_Level
(Target_Type
) <
12391 Deepest_Type_Access_Level
(Opnd_Type
)
12393 if In_Instance_Body
then
12394 Error_Msg_Warn
:= SPARK_Mode
/= On
;
12396 ("source array type has deeper accessibility "
12397 & "level than target<<", Operand
);
12398 Conversion_Error_N
("\Program_Error [<<", Operand
);
12400 Make_Raise_Program_Error
(Sloc
(N
),
12401 Reason
=> PE_Accessibility_Check_Failed
));
12402 Set_Etype
(N
, Target_Type
);
12405 -- Conversion not allowed because of accessibility levels
12409 ("source array type has deeper accessibility "
12410 & "level than target", Operand
);
12418 -- All other cases where component base types do not match
12422 ("incompatible component types for array conversion",
12427 -- Check that component subtypes statically match. For numeric
12428 -- types this means that both must be either constrained or
12429 -- unconstrained. For enumeration types the bounds must match.
12430 -- All of this is checked in Subtypes_Statically_Match.
12432 if not Subtypes_Statically_Match
12433 (Target_Comp_Type
, Opnd_Comp_Type
)
12436 ("component subtypes must statically match", Operand
);
12442 end Valid_Array_Conversion
;
12444 -----------------------------
12445 -- Valid_Tagged_Conversion --
12446 -----------------------------
12448 function Valid_Tagged_Conversion
12449 (Target_Type
: Entity_Id
;
12450 Opnd_Type
: Entity_Id
) return Boolean
12453 -- Upward conversions are allowed (RM 4.6(22))
12455 if Covers
(Target_Type
, Opnd_Type
)
12456 or else Is_Ancestor
(Target_Type
, Opnd_Type
)
12460 -- Downward conversion are allowed if the operand is class-wide
12463 elsif Is_Class_Wide_Type
(Opnd_Type
)
12464 and then Covers
(Opnd_Type
, Target_Type
)
12468 elsif Covers
(Opnd_Type
, Target_Type
)
12469 or else Is_Ancestor
(Opnd_Type
, Target_Type
)
12472 Conversion_Check
(False,
12473 "downward conversion of tagged objects not allowed");
12475 -- Ada 2005 (AI-251): The conversion to/from interface types is
12476 -- always valid. The types involved may be class-wide (sub)types.
12478 elsif Is_Interface
(Etype
(Base_Type
(Target_Type
)))
12479 or else Is_Interface
(Etype
(Base_Type
(Opnd_Type
)))
12483 -- If the operand is a class-wide type obtained through a limited_
12484 -- with clause, and the context includes the nonlimited view, use
12485 -- it to determine whether the conversion is legal.
12487 elsif Is_Class_Wide_Type
(Opnd_Type
)
12488 and then From_Limited_With
(Opnd_Type
)
12489 and then Present
(Non_Limited_View
(Etype
(Opnd_Type
)))
12490 and then Is_Interface
(Non_Limited_View
(Etype
(Opnd_Type
)))
12494 elsif Is_Access_Type
(Opnd_Type
)
12495 and then Is_Interface
(Directly_Designated_Type
(Opnd_Type
))
12500 Conversion_Error_NE
12501 ("invalid tagged conversion, not compatible with}",
12502 N
, First_Subtype
(Opnd_Type
));
12505 end Valid_Tagged_Conversion
;
12507 -- Start of processing for Valid_Conversion
12510 Check_Parameterless_Call
(Operand
);
12512 if Is_Overloaded
(Operand
) then
12522 -- Remove procedure calls, which syntactically cannot appear in
12523 -- this context, but which cannot be removed by type checking,
12524 -- because the context does not impose a type.
12526 -- The node may be labelled overloaded, but still contain only one
12527 -- interpretation because others were discarded earlier. If this
12528 -- is the case, retain the single interpretation if legal.
12530 Get_First_Interp
(Operand
, I
, It
);
12531 Opnd_Type
:= It
.Typ
;
12532 Get_Next_Interp
(I
, It
);
12534 if Present
(It
.Typ
)
12535 and then Opnd_Type
/= Standard_Void_Type
12537 -- More than one candidate interpretation is available
12539 Get_First_Interp
(Operand
, I
, It
);
12540 while Present
(It
.Typ
) loop
12541 if It
.Typ
= Standard_Void_Type
then
12545 -- When compiling for a system where Address is of a visible
12546 -- integer type, spurious ambiguities can be produced when
12547 -- arithmetic operations have a literal operand and return
12548 -- System.Address or a descendant of it. These ambiguities
12549 -- are usually resolved by the context, but for conversions
12550 -- there is no context type and the removal of the spurious
12551 -- operations must be done explicitly here.
12553 if not Address_Is_Private
12554 and then Is_Descendant_Of_Address
(It
.Typ
)
12559 Get_Next_Interp
(I
, It
);
12563 Get_First_Interp
(Operand
, I
, It
);
12567 if No
(It
.Typ
) then
12568 Conversion_Error_N
("illegal operand in conversion", Operand
);
12572 Get_Next_Interp
(I
, It
);
12574 if Present
(It
.Typ
) then
12577 It1
:= Disambiguate
(Operand
, I1
, I
, Any_Type
);
12579 if It1
= No_Interp
then
12581 ("ambiguous operand in conversion", Operand
);
12583 -- If the interpretation involves a standard operator, use
12584 -- the location of the type, which may be user-defined.
12586 if Sloc
(It
.Nam
) = Standard_Location
then
12587 Error_Msg_Sloc
:= Sloc
(It
.Typ
);
12589 Error_Msg_Sloc
:= Sloc
(It
.Nam
);
12592 Conversion_Error_N
-- CODEFIX
12593 ("\\possible interpretation#!", Operand
);
12595 if Sloc
(N1
) = Standard_Location
then
12596 Error_Msg_Sloc
:= Sloc
(T1
);
12598 Error_Msg_Sloc
:= Sloc
(N1
);
12601 Conversion_Error_N
-- CODEFIX
12602 ("\\possible interpretation#!", Operand
);
12608 Set_Etype
(Operand
, It1
.Typ
);
12609 Opnd_Type
:= It1
.Typ
;
12613 -- Deal with conversion of integer type to address if the pragma
12614 -- Allow_Integer_Address is in effect. We convert the conversion to
12615 -- an unchecked conversion in this case and we are all done.
12617 if Address_Integer_Convert_OK
(Opnd_Type
, Target_Type
) then
12618 Rewrite
(N
, Unchecked_Convert_To
(Target_Type
, Expression
(N
)));
12619 Analyze_And_Resolve
(N
, Target_Type
);
12623 -- If we are within a child unit, check whether the type of the
12624 -- expression has an ancestor in a parent unit, in which case it
12625 -- belongs to its derivation class even if the ancestor is private.
12626 -- See RM 7.3.1 (5.2/3).
12628 Inc_Ancestor
:= Get_Incomplete_View_Of_Ancestor
(Opnd_Type
);
12632 if Is_Numeric_Type
(Target_Type
) then
12634 -- A universal fixed expression can be converted to any numeric type
12636 if Opnd_Type
= Universal_Fixed
then
12639 -- Also no need to check when in an instance or inlined body, because
12640 -- the legality has been established when the template was analyzed.
12641 -- Furthermore, numeric conversions may occur where only a private
12642 -- view of the operand type is visible at the instantiation point.
12643 -- This results in a spurious error if we check that the operand type
12644 -- is a numeric type.
12646 -- Note: in a previous version of this unit, the following tests were
12647 -- applied only for generated code (Comes_From_Source set to False),
12648 -- but in fact the test is required for source code as well, since
12649 -- this situation can arise in source code.
12651 elsif In_Instance_Code
or else In_Inlined_Body
then
12654 -- Otherwise we need the conversion check
12657 return Conversion_Check
12658 (Is_Numeric_Type
(Opnd_Type
)
12660 (Present
(Inc_Ancestor
)
12661 and then Is_Numeric_Type
(Inc_Ancestor
)),
12662 "illegal operand for numeric conversion");
12667 elsif Is_Array_Type
(Target_Type
) then
12668 if not Is_Array_Type
(Opnd_Type
)
12669 or else Opnd_Type
= Any_Composite
12670 or else Opnd_Type
= Any_String
12673 ("illegal operand for array conversion", Operand
);
12677 return Valid_Array_Conversion
;
12680 -- Ada 2005 (AI-251): Internally generated conversions of access to
12681 -- interface types added to force the displacement of the pointer to
12682 -- reference the corresponding dispatch table.
12684 elsif not Comes_From_Source
(N
)
12685 and then Is_Access_Type
(Target_Type
)
12686 and then Is_Interface
(Designated_Type
(Target_Type
))
12690 -- Ada 2005 (AI-251): Anonymous access types where target references an
12693 elsif Is_Access_Type
(Opnd_Type
)
12694 and then Ekind_In
(Target_Type
, E_General_Access_Type
,
12695 E_Anonymous_Access_Type
)
12696 and then Is_Interface
(Directly_Designated_Type
(Target_Type
))
12698 -- Check the static accessibility rule of 4.6(17). Note that the
12699 -- check is not enforced when within an instance body, since the
12700 -- RM requires such cases to be caught at run time.
12702 -- If the operand is a rewriting of an allocator no check is needed
12703 -- because there are no accessibility issues.
12705 if Nkind
(Original_Node
(N
)) = N_Allocator
then
12708 elsif Ekind
(Target_Type
) /= E_Anonymous_Access_Type
then
12709 if Type_Access_Level
(Opnd_Type
) >
12710 Deepest_Type_Access_Level
(Target_Type
)
12712 -- In an instance, this is a run-time check, but one we know
12713 -- will fail, so generate an appropriate warning. The raise
12714 -- will be generated by Expand_N_Type_Conversion.
12716 if In_Instance_Body
then
12717 Error_Msg_Warn
:= SPARK_Mode
/= On
;
12719 ("cannot convert local pointer to non-local access type<<",
12721 Conversion_Error_N
("\Program_Error [<<", Operand
);
12725 ("cannot convert local pointer to non-local access type",
12730 -- Special accessibility checks are needed in the case of access
12731 -- discriminants declared for a limited type.
12733 elsif Ekind
(Opnd_Type
) = E_Anonymous_Access_Type
12734 and then not Is_Local_Anonymous_Access
(Opnd_Type
)
12736 -- When the operand is a selected access discriminant the check
12737 -- needs to be made against the level of the object denoted by
12738 -- the prefix of the selected name (Object_Access_Level handles
12739 -- checking the prefix of the operand for this case).
12741 if Nkind
(Operand
) = N_Selected_Component
12742 and then Object_Access_Level
(Operand
) >
12743 Deepest_Type_Access_Level
(Target_Type
)
12745 -- In an instance, this is a run-time check, but one we know
12746 -- will fail, so generate an appropriate warning. The raise
12747 -- will be generated by Expand_N_Type_Conversion.
12749 if In_Instance_Body
then
12750 Error_Msg_Warn
:= SPARK_Mode
/= On
;
12752 ("cannot convert access discriminant to non-local "
12753 & "access type<<", Operand
);
12754 Conversion_Error_N
("\Program_Error [<<", Operand
);
12756 -- Real error if not in instance body
12760 ("cannot convert access discriminant to non-local "
12761 & "access type", Operand
);
12766 -- The case of a reference to an access discriminant from
12767 -- within a limited type declaration (which will appear as
12768 -- a discriminal) is always illegal because the level of the
12769 -- discriminant is considered to be deeper than any (nameable)
12772 if Is_Entity_Name
(Operand
)
12773 and then not Is_Local_Anonymous_Access
(Opnd_Type
)
12775 Ekind_In
(Entity
(Operand
), E_In_Parameter
, E_Constant
)
12776 and then Present
(Discriminal_Link
(Entity
(Operand
)))
12779 ("discriminant has deeper accessibility level than target",
12788 -- General and anonymous access types
12790 elsif Ekind_In
(Target_Type
, E_General_Access_Type
,
12791 E_Anonymous_Access_Type
)
12794 (Is_Access_Type
(Opnd_Type
)
12796 Ekind_In
(Opnd_Type
, E_Access_Subprogram_Type
,
12797 E_Access_Protected_Subprogram_Type
),
12798 "must be an access-to-object type")
12800 if Is_Access_Constant
(Opnd_Type
)
12801 and then not Is_Access_Constant
(Target_Type
)
12804 ("access-to-constant operand type not allowed", Operand
);
12808 -- Check the static accessibility rule of 4.6(17). Note that the
12809 -- check is not enforced when within an instance body, since the RM
12810 -- requires such cases to be caught at run time.
12812 if Ekind
(Target_Type
) /= E_Anonymous_Access_Type
12813 or else Is_Local_Anonymous_Access
(Target_Type
)
12814 or else Nkind
(Associated_Node_For_Itype
(Target_Type
)) =
12815 N_Object_Declaration
12817 -- Ada 2012 (AI05-0149): Perform legality checking on implicit
12818 -- conversions from an anonymous access type to a named general
12819 -- access type. Such conversions are not allowed in the case of
12820 -- access parameters and stand-alone objects of an anonymous
12821 -- access type. The implicit conversion case is recognized by
12822 -- testing that Comes_From_Source is False and that it's been
12823 -- rewritten. The Comes_From_Source test isn't sufficient because
12824 -- nodes in inlined calls to predefined library routines can have
12825 -- Comes_From_Source set to False. (Is there a better way to test
12826 -- for implicit conversions???)
12828 if Ada_Version
>= Ada_2012
12829 and then not Comes_From_Source
(N
)
12830 and then Is_Rewrite_Substitution
(N
)
12831 and then Ekind
(Target_Type
) = E_General_Access_Type
12832 and then Ekind
(Opnd_Type
) = E_Anonymous_Access_Type
12834 if Is_Itype
(Opnd_Type
) then
12836 -- Implicit conversions aren't allowed for objects of an
12837 -- anonymous access type, since such objects have nonstatic
12838 -- levels in Ada 2012.
12840 if Nkind
(Associated_Node_For_Itype
(Opnd_Type
)) =
12841 N_Object_Declaration
12844 ("implicit conversion of stand-alone anonymous "
12845 & "access object not allowed", Operand
);
12848 -- Implicit conversions aren't allowed for anonymous access
12849 -- parameters. The "not Is_Local_Anonymous_Access_Type" test
12850 -- is done to exclude anonymous access results.
12852 elsif not Is_Local_Anonymous_Access
(Opnd_Type
)
12853 and then Nkind_In
(Associated_Node_For_Itype
(Opnd_Type
),
12854 N_Function_Specification
,
12855 N_Procedure_Specification
)
12858 ("implicit conversion of anonymous access formal "
12859 & "not allowed", Operand
);
12862 -- This is a case where there's an enclosing object whose
12863 -- to which the "statically deeper than" relationship does
12864 -- not apply (such as an access discriminant selected from
12865 -- a dereference of an access parameter).
12867 elsif Object_Access_Level
(Operand
)
12868 = Scope_Depth
(Standard_Standard
)
12871 ("implicit conversion of anonymous access value "
12872 & "not allowed", Operand
);
12875 -- In other cases, the level of the operand's type must be
12876 -- statically less deep than that of the target type, else
12877 -- implicit conversion is disallowed (by RM12-8.6(27.1/3)).
12879 elsif Type_Access_Level
(Opnd_Type
) >
12880 Deepest_Type_Access_Level
(Target_Type
)
12883 ("implicit conversion of anonymous access value "
12884 & "violates accessibility", Operand
);
12889 elsif Type_Access_Level
(Opnd_Type
) >
12890 Deepest_Type_Access_Level
(Target_Type
)
12892 -- In an instance, this is a run-time check, but one we know
12893 -- will fail, so generate an appropriate warning. The raise
12894 -- will be generated by Expand_N_Type_Conversion.
12896 if In_Instance_Body
then
12897 Error_Msg_Warn
:= SPARK_Mode
/= On
;
12899 ("cannot convert local pointer to non-local access type<<",
12901 Conversion_Error_N
("\Program_Error [<<", Operand
);
12903 -- If not in an instance body, this is a real error
12906 -- Avoid generation of spurious error message
12908 if not Error_Posted
(N
) then
12910 ("cannot convert local pointer to non-local access type",
12917 -- Special accessibility checks are needed in the case of access
12918 -- discriminants declared for a limited type.
12920 elsif Ekind
(Opnd_Type
) = E_Anonymous_Access_Type
12921 and then not Is_Local_Anonymous_Access
(Opnd_Type
)
12923 -- When the operand is a selected access discriminant the check
12924 -- needs to be made against the level of the object denoted by
12925 -- the prefix of the selected name (Object_Access_Level handles
12926 -- checking the prefix of the operand for this case).
12928 if Nkind
(Operand
) = N_Selected_Component
12929 and then Object_Access_Level
(Operand
) >
12930 Deepest_Type_Access_Level
(Target_Type
)
12932 -- In an instance, this is a run-time check, but one we know
12933 -- will fail, so generate an appropriate warning. The raise
12934 -- will be generated by Expand_N_Type_Conversion.
12936 if In_Instance_Body
then
12937 Error_Msg_Warn
:= SPARK_Mode
/= On
;
12939 ("cannot convert access discriminant to non-local "
12940 & "access type<<", Operand
);
12941 Conversion_Error_N
("\Program_Error [<<", Operand
);
12943 -- If not in an instance body, this is a real error
12947 ("cannot convert access discriminant to non-local "
12948 & "access type", Operand
);
12953 -- The case of a reference to an access discriminant from
12954 -- within a limited type declaration (which will appear as
12955 -- a discriminal) is always illegal because the level of the
12956 -- discriminant is considered to be deeper than any (nameable)
12959 if Is_Entity_Name
(Operand
)
12961 Ekind_In
(Entity
(Operand
), E_In_Parameter
, E_Constant
)
12962 and then Present
(Discriminal_Link
(Entity
(Operand
)))
12965 ("discriminant has deeper accessibility level than target",
12972 -- In the presence of limited_with clauses we have to use nonlimited
12973 -- views, if available.
12975 Check_Limited
: declare
12976 function Full_Designated_Type
(T
: Entity_Id
) return Entity_Id
;
12977 -- Helper function to handle limited views
12979 --------------------------
12980 -- Full_Designated_Type --
12981 --------------------------
12983 function Full_Designated_Type
(T
: Entity_Id
) return Entity_Id
is
12984 Desig
: constant Entity_Id
:= Designated_Type
(T
);
12987 -- Handle the limited view of a type
12989 if From_Limited_With
(Desig
)
12990 and then Has_Non_Limited_View
(Desig
)
12992 return Available_View
(Desig
);
12996 end Full_Designated_Type
;
12998 -- Local Declarations
13000 Target
: constant Entity_Id
:= Full_Designated_Type
(Target_Type
);
13001 Opnd
: constant Entity_Id
:= Full_Designated_Type
(Opnd_Type
);
13003 Same_Base
: constant Boolean :=
13004 Base_Type
(Target
) = Base_Type
(Opnd
);
13006 -- Start of processing for Check_Limited
13009 if Is_Tagged_Type
(Target
) then
13010 return Valid_Tagged_Conversion
(Target
, Opnd
);
13013 if not Same_Base
then
13014 Conversion_Error_NE
13015 ("target designated type not compatible with }",
13016 N
, Base_Type
(Opnd
));
13019 -- Ada 2005 AI-384: legality rule is symmetric in both
13020 -- designated types. The conversion is legal (with possible
13021 -- constraint check) if either designated type is
13024 elsif Subtypes_Statically_Match
(Target
, Opnd
)
13026 (Has_Discriminants
(Target
)
13028 (not Is_Constrained
(Opnd
)
13029 or else not Is_Constrained
(Target
)))
13031 -- Special case, if Value_Size has been used to make the
13032 -- sizes different, the conversion is not allowed even
13033 -- though the subtypes statically match.
13035 if Known_Static_RM_Size
(Target
)
13036 and then Known_Static_RM_Size
(Opnd
)
13037 and then RM_Size
(Target
) /= RM_Size
(Opnd
)
13039 Conversion_Error_NE
13040 ("target designated subtype not compatible with }",
13042 Conversion_Error_NE
13043 ("\because sizes of the two designated subtypes differ",
13047 -- Normal case where conversion is allowed
13055 ("target designated subtype not compatible with }",
13062 -- Access to subprogram types. If the operand is an access parameter,
13063 -- the type has a deeper accessibility that any master, and cannot be
13064 -- assigned. We must make an exception if the conversion is part of an
13065 -- assignment and the target is the return object of an extended return
13066 -- statement, because in that case the accessibility check takes place
13067 -- after the return.
13069 elsif Is_Access_Subprogram_Type
(Target_Type
)
13071 -- Note: this test of Opnd_Type is there to prevent entering this
13072 -- branch in the case of a remote access to subprogram type, which
13073 -- is internally represented as an E_Record_Type.
13075 and then Is_Access_Type
(Opnd_Type
)
13077 if Ekind
(Base_Type
(Opnd_Type
)) = E_Anonymous_Access_Subprogram_Type
13078 and then Is_Entity_Name
(Operand
)
13079 and then Ekind
(Entity
(Operand
)) = E_In_Parameter
13081 (Nkind
(Parent
(N
)) /= N_Assignment_Statement
13082 or else not Is_Entity_Name
(Name
(Parent
(N
)))
13083 or else not Is_Return_Object
(Entity
(Name
(Parent
(N
)))))
13086 ("illegal attempt to store anonymous access to subprogram",
13089 ("\value has deeper accessibility than any master "
13090 & "(RM 3.10.2 (13))",
13094 ("\use named access type for& instead of access parameter",
13095 Operand
, Entity
(Operand
));
13098 -- Check that the designated types are subtype conformant
13100 Check_Subtype_Conformant
(New_Id
=> Designated_Type
(Target_Type
),
13101 Old_Id
=> Designated_Type
(Opnd_Type
),
13104 -- Check the static accessibility rule of 4.6(20)
13106 if Type_Access_Level
(Opnd_Type
) >
13107 Deepest_Type_Access_Level
(Target_Type
)
13110 ("operand type has deeper accessibility level than target",
13113 -- Check that if the operand type is declared in a generic body,
13114 -- then the target type must be declared within that same body
13115 -- (enforces last sentence of 4.6(20)).
13117 elsif Present
(Enclosing_Generic_Body
(Opnd_Type
)) then
13119 O_Gen
: constant Node_Id
:=
13120 Enclosing_Generic_Body
(Opnd_Type
);
13125 T_Gen
:= Enclosing_Generic_Body
(Target_Type
);
13126 while Present
(T_Gen
) and then T_Gen
/= O_Gen
loop
13127 T_Gen
:= Enclosing_Generic_Body
(T_Gen
);
13130 if T_Gen
/= O_Gen
then
13132 ("target type must be declared in same generic body "
13133 & "as operand type", N
);
13140 -- Remote access to subprogram types
13142 elsif Is_Remote_Access_To_Subprogram_Type
(Target_Type
)
13143 and then Is_Remote_Access_To_Subprogram_Type
(Opnd_Type
)
13145 -- It is valid to convert from one RAS type to another provided
13146 -- that their specification statically match.
13148 -- Note: at this point, remote access to subprogram types have been
13149 -- expanded to their E_Record_Type representation, and we need to
13150 -- go back to the original access type definition using the
13151 -- Corresponding_Remote_Type attribute in order to check that the
13152 -- designated profiles match.
13154 pragma Assert
(Ekind
(Target_Type
) = E_Record_Type
);
13155 pragma Assert
(Ekind
(Opnd_Type
) = E_Record_Type
);
13157 Check_Subtype_Conformant
13159 Designated_Type
(Corresponding_Remote_Type
(Target_Type
)),
13161 Designated_Type
(Corresponding_Remote_Type
(Opnd_Type
)),
13166 -- If it was legal in the generic, it's legal in the instance
13168 elsif In_Instance_Body
then
13171 -- If both are tagged types, check legality of view conversions
13173 elsif Is_Tagged_Type
(Target_Type
)
13175 Is_Tagged_Type
(Opnd_Type
)
13177 return Valid_Tagged_Conversion
(Target_Type
, Opnd_Type
);
13179 -- Types derived from the same root type are convertible
13181 elsif Root_Type
(Target_Type
) = Root_Type
(Opnd_Type
) then
13184 -- In an instance or an inlined body, there may be inconsistent views of
13185 -- the same type, or of types derived from a common root.
13187 elsif (In_Instance
or In_Inlined_Body
)
13189 Root_Type
(Underlying_Type
(Target_Type
)) =
13190 Root_Type
(Underlying_Type
(Opnd_Type
))
13194 -- Special check for common access type error case
13196 elsif Ekind
(Target_Type
) = E_Access_Type
13197 and then Is_Access_Type
(Opnd_Type
)
13199 Conversion_Error_N
("target type must be general access type!", N
);
13200 Conversion_Error_NE
-- CODEFIX
13201 ("add ALL to }!", N
, Target_Type
);
13204 -- Here we have a real conversion error
13207 -- Check for missing regular with_clause when only a limited view of
13208 -- target is available.
13210 if From_Limited_With
(Opnd_Type
) and then In_Package_Body
then
13211 Conversion_Error_NE
13212 ("invalid conversion, not compatible with limited view of }",
13214 Conversion_Error_NE
13215 ("\add with_clause for& to current unit!", N
, Scope
(Opnd_Type
));
13217 elsif Is_Access_Type
(Opnd_Type
)
13218 and then From_Limited_With
(Designated_Type
(Opnd_Type
))
13219 and then In_Package_Body
13221 Conversion_Error_NE
13222 ("invalid conversion, not compatible with }", N
, Opnd_Type
);
13223 Conversion_Error_NE
13224 ("\add with_clause for& to current unit!",
13225 N
, Scope
(Designated_Type
(Opnd_Type
)));
13228 Conversion_Error_NE
13229 ("invalid conversion, not compatible with }", N
, Opnd_Type
);
13234 end Valid_Conversion
;