1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2017, 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 Aspects
; use Aspects
;
27 with Atree
; use Atree
;
28 with Debug
; use Debug
;
29 with Einfo
; use Einfo
;
30 with Elists
; use Elists
;
31 with Errout
; use Errout
;
32 with Exp_Util
; use Exp_Util
;
33 with Itypes
; use Itypes
;
35 with Lib
.Xref
; use Lib
.Xref
;
36 with Namet
; use Namet
;
37 with Namet
.Sp
; use Namet
.Sp
;
38 with Nlists
; use Nlists
;
39 with Nmake
; use Nmake
;
41 with Output
; use Output
;
42 with Restrict
; use Restrict
;
43 with Rident
; use Rident
;
45 with Sem_Aux
; use Sem_Aux
;
46 with Sem_Case
; use Sem_Case
;
47 with Sem_Cat
; use Sem_Cat
;
48 with Sem_Ch3
; use Sem_Ch3
;
49 with Sem_Ch6
; use Sem_Ch6
;
50 with Sem_Ch8
; use Sem_Ch8
;
51 with Sem_Dim
; use Sem_Dim
;
52 with Sem_Disp
; use Sem_Disp
;
53 with Sem_Dist
; use Sem_Dist
;
54 with Sem_Eval
; use Sem_Eval
;
55 with Sem_Res
; use Sem_Res
;
56 with Sem_Type
; use Sem_Type
;
57 with Sem_Util
; use Sem_Util
;
58 with Sem_Warn
; use Sem_Warn
;
59 with Stand
; use Stand
;
60 with Sinfo
; use Sinfo
;
61 with Snames
; use Snames
;
62 with Tbuild
; use Tbuild
;
63 with Uintp
; use Uintp
;
65 package body Sem_Ch4
is
67 -- Tables which speed up the identification of dangerous calls to Ada 2012
68 -- functions with writable actuals (AI05-0144).
70 -- The following table enumerates the Ada constructs which may evaluate in
71 -- arbitrary order. It does not cover all the language constructs which can
72 -- be evaluated in arbitrary order but the subset needed for AI05-0144.
74 Has_Arbitrary_Evaluation_Order
: constant array (Node_Kind
) of Boolean :=
76 N_Assignment_Statement
=> True,
77 N_Entry_Call_Statement
=> True,
78 N_Extension_Aggregate
=> True,
79 N_Full_Type_Declaration
=> True,
80 N_Indexed_Component
=> True,
81 N_Object_Declaration
=> True,
85 N_Array_Type_Definition
=> True,
86 N_Membership_Test
=> True,
88 N_Subprogram_Call
=> True,
91 -- The following table enumerates the nodes on which we stop climbing when
92 -- locating the outermost Ada construct that can be evaluated in arbitrary
95 Stop_Subtree_Climbing
: constant array (Node_Kind
) of Boolean :=
97 N_Assignment_Statement
=> True,
98 N_Entry_Call_Statement
=> True,
99 N_Extended_Return_Statement
=> True,
100 N_Extension_Aggregate
=> True,
101 N_Full_Type_Declaration
=> True,
102 N_Object_Declaration
=> True,
103 N_Object_Renaming_Declaration
=> True,
104 N_Package_Specification
=> True,
106 N_Procedure_Call_Statement
=> True,
107 N_Simple_Return_Statement
=> True,
108 N_Has_Condition
=> True,
111 -----------------------
112 -- Local Subprograms --
113 -----------------------
115 procedure Analyze_Concatenation_Rest
(N
: Node_Id
);
116 -- Does the "rest" of the work of Analyze_Concatenation, after the left
117 -- operand has been analyzed. See Analyze_Concatenation for details.
119 procedure Analyze_Expression
(N
: Node_Id
);
120 -- For expressions that are not names, this is just a call to analyze. If
121 -- the expression is a name, it may be a call to a parameterless function,
122 -- and if so must be converted into an explicit call node and analyzed as
123 -- such. This deproceduring must be done during the first pass of overload
124 -- resolution, because otherwise a procedure call with overloaded actuals
125 -- may fail to resolve.
127 procedure Analyze_Operator_Call
(N
: Node_Id
; Op_Id
: Entity_Id
);
128 -- Analyze a call of the form "+"(x, y), etc. The prefix of the call is an
129 -- operator name or an expanded name whose selector is an operator name,
130 -- and one possible interpretation is as a predefined operator.
132 procedure Analyze_Overloaded_Selected_Component
(N
: Node_Id
);
133 -- If the prefix of a selected_component is overloaded, the proper
134 -- interpretation that yields a record type with the proper selector
135 -- name must be selected.
137 procedure Analyze_User_Defined_Binary_Op
(N
: Node_Id
; Op_Id
: Entity_Id
);
138 -- Procedure to analyze a user defined binary operator, which is resolved
139 -- like a function, but instead of a list of actuals it is presented
140 -- with the left and right operands of an operator node.
142 procedure Analyze_User_Defined_Unary_Op
(N
: Node_Id
; Op_Id
: Entity_Id
);
143 -- Procedure to analyze a user defined unary operator, which is resolved
144 -- like a function, but instead of a list of actuals, it is presented with
145 -- the operand of the operator node.
147 procedure Ambiguous_Operands
(N
: Node_Id
);
148 -- For equality, membership, and comparison operators with overloaded
149 -- arguments, list possible interpretations.
151 procedure Analyze_One_Call
155 Success
: out Boolean;
156 Skip_First
: Boolean := False);
157 -- Check one interpretation of an overloaded subprogram name for
158 -- compatibility with the types of the actuals in a call. If there is a
159 -- single interpretation which does not match, post error if Report is
162 -- Nam is the entity that provides the formals against which the actuals
163 -- are checked. Nam is either the name of a subprogram, or the internal
164 -- subprogram type constructed for an access_to_subprogram. If the actuals
165 -- are compatible with Nam, then Nam is added to the list of candidate
166 -- interpretations for N, and Success is set to True.
168 -- The flag Skip_First is used when analyzing a call that was rewritten
169 -- from object notation. In this case the first actual may have to receive
170 -- an explicit dereference, depending on the first formal of the operation
171 -- being called. The caller will have verified that the object is legal
172 -- for the call. If the remaining parameters match, the first parameter
173 -- will rewritten as a dereference if needed, prior to completing analysis.
175 procedure Check_Misspelled_Selector
178 -- Give possible misspelling message if Sel seems likely to be a mis-
179 -- spelling of one of the selectors of the Prefix. This is called by
180 -- Analyze_Selected_Component after producing an invalid selector error
183 function Defined_In_Scope
(T
: Entity_Id
; S
: Entity_Id
) return Boolean;
184 -- Verify that type T is declared in scope S. Used to find interpretations
185 -- for operators given by expanded names. This is abstracted as a separate
186 -- function to handle extensions to System, where S is System, but T is
187 -- declared in the extension.
189 procedure Find_Arithmetic_Types
193 -- L and R are the operands of an arithmetic operator. Find consistent
194 -- pairs of interpretations for L and R that have a numeric type consistent
195 -- with the semantics of the operator.
197 procedure Find_Comparison_Types
201 -- L and R are operands of a comparison operator. Find consistent pairs of
202 -- interpretations for L and R.
204 procedure Find_Concatenation_Types
208 -- For the four varieties of concatenation
210 procedure Find_Equality_Types
214 -- Ditto for equality operators
216 procedure Find_Boolean_Types
220 -- Ditto for binary logical operations
222 procedure Find_Negation_Types
226 -- Find consistent interpretation for operand of negation operator
228 procedure Find_Non_Universal_Interpretations
233 -- For equality and comparison operators, the result is always boolean, and
234 -- the legality of the operation is determined from the visibility of the
235 -- operand types. If one of the operands has a universal interpretation,
236 -- the legality check uses some compatible non-universal interpretation of
237 -- the other operand. N can be an operator node, or a function call whose
238 -- name is an operator designator. Any_Access, which is the initial type of
239 -- the literal NULL, is a universal type for the purpose of this routine.
241 function Find_Primitive_Operation
(N
: Node_Id
) return Boolean;
242 -- Find candidate interpretations for the name Obj.Proc when it appears in
243 -- a subprogram renaming declaration.
245 procedure Find_Unary_Types
249 -- Unary arithmetic types: plus, minus, abs
251 procedure Check_Arithmetic_Pair
255 -- Subsidiary procedure to Find_Arithmetic_Types. T1 and T2 are valid types
256 -- for left and right operand. Determine whether they constitute a valid
257 -- pair for the given operator, and record the corresponding interpretation
258 -- of the operator node. The node N may be an operator node (the usual
259 -- case) or a function call whose prefix is an operator designator. In
260 -- both cases Op_Id is the operator name itself.
262 procedure Diagnose_Call
(N
: Node_Id
; Nam
: Node_Id
);
263 -- Give detailed information on overloaded call where none of the
264 -- interpretations match. N is the call node, Nam the designator for
265 -- the overloaded entity being called.
267 function Junk_Operand
(N
: Node_Id
) return Boolean;
268 -- Test for an operand that is an inappropriate entity (e.g. a package
269 -- name or a label). If so, issue an error message and return True. If
270 -- the operand is not an inappropriate entity kind, return False.
272 procedure Operator_Check
(N
: Node_Id
);
273 -- Verify that an operator has received some valid interpretation. If none
274 -- was found, determine whether a use clause would make the operation
275 -- legal. The variable Candidate_Type (defined in Sem_Type) is set for
276 -- every type compatible with the operator, even if the operator for the
277 -- type is not directly visible. The routine uses this type to emit a more
278 -- informative message.
280 function Process_Implicit_Dereference_Prefix
282 P
: Node_Id
) return Entity_Id
;
283 -- Called when P is the prefix of an implicit dereference, denoting an
284 -- object E. The function returns the designated type of the prefix, taking
285 -- into account that the designated type of an anonymous access type may be
286 -- a limited view, when the nonlimited view is visible.
288 -- If in semantics only mode (-gnatc or generic), the function also records
289 -- that the prefix is a reference to E, if any. Normally, such a reference
290 -- is generated only when the implicit dereference is expanded into an
291 -- explicit one, but for consistency we must generate the reference when
292 -- expansion is disabled as well.
294 procedure Remove_Abstract_Operations
(N
: Node_Id
);
295 -- Ada 2005: implementation of AI-310. An abstract non-dispatching
296 -- operation is not a candidate interpretation.
298 function Try_Container_Indexing
301 Exprs
: List_Id
) return Boolean;
302 -- AI05-0139: Generalized indexing to support iterators over containers
304 function Try_Indexed_Call
308 Skip_First
: Boolean) return Boolean;
309 -- If a function has defaults for all its actuals, a call to it may in fact
310 -- be an indexing on the result of the call. Try_Indexed_Call attempts the
311 -- interpretation as an indexing, prior to analysis as a call. If both are
312 -- possible, the node is overloaded with both interpretations (same symbol
313 -- but two different types). If the call is written in prefix form, the
314 -- prefix becomes the first parameter in the call, and only the remaining
315 -- actuals must be checked for the presence of defaults.
317 function Try_Indirect_Call
320 Typ
: Entity_Id
) return Boolean;
321 -- Similarly, a function F that needs no actuals can return an access to a
322 -- subprogram, and the call F (X) interpreted as F.all (X). In this case
323 -- the call may be overloaded with both interpretations.
325 procedure wpo
(T
: Entity_Id
);
326 pragma Warnings
(Off
, wpo
);
327 -- Used for debugging: obtain list of primitive operations even if
328 -- type is not frozen and dispatch table is not built yet.
330 ------------------------
331 -- Ambiguous_Operands --
332 ------------------------
334 procedure Ambiguous_Operands
(N
: Node_Id
) is
335 procedure List_Operand_Interps
(Opnd
: Node_Id
);
337 --------------------------
338 -- List_Operand_Interps --
339 --------------------------
341 procedure List_Operand_Interps
(Opnd
: Node_Id
) is
342 Nam
: Node_Id
:= Empty
;
346 if Is_Overloaded
(Opnd
) then
347 if Nkind
(Opnd
) in N_Op
then
350 elsif Nkind
(Opnd
) = N_Function_Call
then
353 elsif Ada_Version
>= Ada_2012
then
359 Get_First_Interp
(Opnd
, I
, It
);
360 while Present
(It
.Nam
) loop
361 if Has_Implicit_Dereference
(It
.Typ
) then
363 ("can be interpreted as implicit dereference", Opnd
);
367 Get_Next_Interp
(I
, It
);
378 if Opnd
= Left_Opnd
(N
) then
380 ("\left operand has the following interpretations", N
);
383 ("\right operand has the following interpretations", N
);
387 List_Interps
(Nam
, Err
);
388 end List_Operand_Interps
;
390 -- Start of processing for Ambiguous_Operands
393 if Nkind
(N
) in N_Membership_Test
then
394 Error_Msg_N
("ambiguous operands for membership", N
);
396 elsif Nkind_In
(N
, N_Op_Eq
, N_Op_Ne
) then
397 Error_Msg_N
("ambiguous operands for equality", N
);
400 Error_Msg_N
("ambiguous operands for comparison", N
);
403 if All_Errors_Mode
then
404 List_Operand_Interps
(Left_Opnd
(N
));
405 List_Operand_Interps
(Right_Opnd
(N
));
407 Error_Msg_N
("\use -gnatf switch for details", N
);
409 end Ambiguous_Operands
;
411 -----------------------
412 -- Analyze_Aggregate --
413 -----------------------
415 -- Most of the analysis of Aggregates requires that the type be known, and
416 -- is therefore put off until resolution of the context. Delta aggregates
417 -- have a base component that determines the enclosing aggregate type so
418 -- its type can be ascertained earlier. This also allows delta aggregates
419 -- to appear in the context of a record type with a private extension, as
420 -- per the latest update of AI12-0127.
422 procedure Analyze_Aggregate
(N
: Node_Id
) is
424 if No
(Etype
(N
)) then
425 if Nkind
(N
) = N_Delta_Aggregate
then
427 Base
: constant Node_Id
:= Expression
(N
);
435 -- If the base is overloaded, propagate interpretations to the
436 -- enclosing aggregate.
438 if Is_Overloaded
(Base
) then
439 Get_First_Interp
(Base
, I
, It
);
440 Set_Etype
(N
, Any_Type
);
442 while Present
(It
.Nam
) loop
443 Add_One_Interp
(N
, It
.Typ
, It
.Typ
);
444 Get_Next_Interp
(I
, It
);
448 Set_Etype
(N
, Etype
(Base
));
453 Set_Etype
(N
, Any_Composite
);
456 end Analyze_Aggregate
;
458 -----------------------
459 -- Analyze_Allocator --
460 -----------------------
462 procedure Analyze_Allocator
(N
: Node_Id
) is
463 Loc
: constant Source_Ptr
:= Sloc
(N
);
464 Sav_Errs
: constant Nat
:= Serious_Errors_Detected
;
465 E
: Node_Id
:= Expression
(N
);
466 Acc_Type
: Entity_Id
;
473 Check_SPARK_05_Restriction
("allocator is not allowed", N
);
475 -- Deal with allocator restrictions
477 -- In accordance with H.4(7), the No_Allocators restriction only applies
478 -- to user-written allocators. The same consideration applies to the
479 -- No_Standard_Allocators_Before_Elaboration restriction.
481 if Comes_From_Source
(N
) then
482 Check_Restriction
(No_Allocators
, N
);
484 -- Processing for No_Standard_Allocators_After_Elaboration, loop to
485 -- look at enclosing context, checking task/main subprogram case.
489 while Present
(P
) loop
491 -- For the task case we need a handled sequence of statements,
492 -- where the occurrence of the allocator is within the statements
493 -- and the parent is a task body
495 if Nkind
(P
) = N_Handled_Sequence_Of_Statements
496 and then Is_List_Member
(C
)
497 and then List_Containing
(C
) = Statements
(P
)
499 Onode
:= Original_Node
(Parent
(P
));
501 -- Check for allocator within task body, this is a definite
502 -- violation of No_Allocators_After_Elaboration we can detect
505 if Nkind
(Onode
) = N_Task_Body
then
507 (No_Standard_Allocators_After_Elaboration
, N
);
512 -- The other case is appearance in a subprogram body. This is
513 -- a violation if this is a library level subprogram with no
514 -- parameters. Note that this is now a static error even if the
515 -- subprogram is not the main program (this is a change, in an
516 -- earlier version only the main program was affected, and the
517 -- check had to be done in the binder.
519 if Nkind
(P
) = N_Subprogram_Body
520 and then Nkind
(Parent
(P
)) = N_Compilation_Unit
521 and then No
(Parameter_Specifications
(Specification
(P
)))
524 (No_Standard_Allocators_After_Elaboration
, N
);
532 -- Ada 2012 (AI05-0111-3): Analyze the subpool_specification, if
533 -- any. The expected type for the name is any type. A non-overloading
534 -- rule then requires it to be of a type descended from
535 -- System.Storage_Pools.Subpools.Subpool_Handle.
537 -- This isn't exactly what the AI says, but it seems to be the right
538 -- rule. The AI should be fixed.???
541 Subpool
: constant Node_Id
:= Subpool_Handle_Name
(N
);
544 if Present
(Subpool
) then
547 if Is_Overloaded
(Subpool
) then
548 Error_Msg_N
("ambiguous subpool handle", Subpool
);
551 -- Check that Etype (Subpool) is descended from Subpool_Handle
557 -- Analyze the qualified expression or subtype indication
559 if Nkind
(E
) = N_Qualified_Expression
then
560 Acc_Type
:= Create_Itype
(E_Allocator_Type
, N
);
561 Set_Etype
(Acc_Type
, Acc_Type
);
562 Find_Type
(Subtype_Mark
(E
));
564 -- Analyze the qualified expression, and apply the name resolution
565 -- rule given in 4.7(3).
568 Type_Id
:= Etype
(E
);
569 Set_Directly_Designated_Type
(Acc_Type
, Type_Id
);
571 -- A qualified expression requires an exact match of the type,
572 -- class-wide matching is not allowed.
574 -- if Is_Class_Wide_Type (Type_Id)
575 -- and then Base_Type
576 -- (Etype (Expression (E))) /= Base_Type (Type_Id)
578 -- Wrong_Type (Expression (E), Type_Id);
581 -- We don't analyze the qualified expression itself because it's
582 -- part of the allocator. It is fully analyzed and resolved when
583 -- the allocator is resolved with the context type.
585 Set_Etype
(E
, Type_Id
);
587 -- Case where allocator has a subtype indication
592 Base_Typ
: Entity_Id
;
595 -- If the allocator includes a N_Subtype_Indication then a
596 -- constraint is present, otherwise the node is a subtype mark.
597 -- Introduce an explicit subtype declaration into the tree
598 -- defining some anonymous subtype and rewrite the allocator to
599 -- use this subtype rather than the subtype indication.
601 -- It is important to introduce the explicit subtype declaration
602 -- so that the bounds of the subtype indication are attached to
603 -- the tree in case the allocator is inside a generic unit.
605 -- Finally, if there is no subtype indication and the type is
606 -- a tagged unconstrained type with discriminants, the designated
607 -- object is constrained by their default values, and it is
608 -- simplest to introduce an explicit constraint now. In some cases
609 -- this is done during expansion, but freeze actions are certain
610 -- to be emitted in the proper order if constraint is explicit.
612 if Is_Entity_Name
(E
) and then Expander_Active
then
614 Type_Id
:= Entity
(E
);
616 if Is_Tagged_Type
(Type_Id
)
617 and then Has_Discriminants
(Type_Id
)
618 and then not Is_Constrained
(Type_Id
)
621 (Discriminant_Default_Value
622 (First_Discriminant
(Type_Id
)))
625 Constr
: constant List_Id
:= New_List
;
626 Loc
: constant Source_Ptr
:= Sloc
(E
);
627 Discr
: Entity_Id
:= First_Discriminant
(Type_Id
);
630 if Present
(Discriminant_Default_Value
(Discr
)) then
631 while Present
(Discr
) loop
632 Append
(Discriminant_Default_Value
(Discr
), Constr
);
633 Next_Discriminant
(Discr
);
637 Make_Subtype_Indication
(Loc
,
638 Subtype_Mark
=> New_Occurrence_Of
(Type_Id
, Loc
),
640 Make_Index_Or_Discriminant_Constraint
(Loc
,
641 Constraints
=> Constr
)));
647 if Nkind
(E
) = N_Subtype_Indication
then
649 -- A constraint is only allowed for a composite type in Ada
650 -- 95. In Ada 83, a constraint is also allowed for an
651 -- access-to-composite type, but the constraint is ignored.
653 Find_Type
(Subtype_Mark
(E
));
654 Base_Typ
:= Entity
(Subtype_Mark
(E
));
656 if Is_Elementary_Type
(Base_Typ
) then
657 if not (Ada_Version
= Ada_83
658 and then Is_Access_Type
(Base_Typ
))
660 Error_Msg_N
("constraint not allowed here", E
);
662 if Nkind
(Constraint
(E
)) =
663 N_Index_Or_Discriminant_Constraint
665 Error_Msg_N
-- CODEFIX
666 ("\if qualified expression was meant, " &
667 "use apostrophe", Constraint
(E
));
671 -- Get rid of the bogus constraint:
673 Rewrite
(E
, New_Copy_Tree
(Subtype_Mark
(E
)));
674 Analyze_Allocator
(N
);
678 if Expander_Active
then
679 Def_Id
:= Make_Temporary
(Loc
, 'S');
682 Make_Subtype_Declaration
(Loc
,
683 Defining_Identifier
=> Def_Id
,
684 Subtype_Indication
=> Relocate_Node
(E
)));
686 if Sav_Errs
/= Serious_Errors_Detected
687 and then Nkind
(Constraint
(E
)) =
688 N_Index_Or_Discriminant_Constraint
690 Error_Msg_N
-- CODEFIX
691 ("if qualified expression was meant, "
692 & "use apostrophe!", Constraint
(E
));
695 E
:= New_Occurrence_Of
(Def_Id
, Loc
);
696 Rewrite
(Expression
(N
), E
);
700 Type_Id
:= Process_Subtype
(E
, N
);
701 Acc_Type
:= Create_Itype
(E_Allocator_Type
, N
);
702 Set_Etype
(Acc_Type
, Acc_Type
);
703 Set_Directly_Designated_Type
(Acc_Type
, Type_Id
);
704 Check_Fully_Declared
(Type_Id
, N
);
706 -- Ada 2005 (AI-231): If the designated type is itself an access
707 -- type that excludes null, its default initialization will
708 -- be a null object, and we can insert an unconditional raise
709 -- before the allocator.
711 -- Ada 2012 (AI-104): A not null indication here is altogether
714 if Can_Never_Be_Null
(Type_Id
) then
716 Not_Null_Check
: constant Node_Id
:=
717 Make_Raise_Constraint_Error
(Sloc
(E
),
718 Reason
=> CE_Null_Not_Allowed
);
721 if Expander_Active
then
722 Insert_Action
(N
, Not_Null_Check
);
723 Analyze
(Not_Null_Check
);
725 elsif Warn_On_Ada_2012_Compatibility
then
727 ("null value not allowed here in Ada 2012?y?", E
);
732 -- Check for missing initialization. Skip this check if we already
733 -- had errors on analyzing the allocator, since in that case these
734 -- are probably cascaded errors.
736 if not Is_Definite_Subtype
(Type_Id
)
737 and then Serious_Errors_Detected
= Sav_Errs
739 -- The build-in-place machinery may produce an allocator when
740 -- the designated type is indefinite but the underlying type is
741 -- not. In this case the unknown discriminants are meaningless
742 -- and should not trigger error messages. Check the parent node
743 -- because the allocator is marked as coming from source.
745 if Present
(Underlying_Type
(Type_Id
))
746 and then Is_Definite_Subtype
(Underlying_Type
(Type_Id
))
747 and then not Comes_From_Source
(Parent
(N
))
751 -- An unusual case arises when the parent of a derived type is
752 -- a limited record extension with unknown discriminants, and
753 -- its full view has no discriminants.
755 -- A more general fix might be to create the proper underlying
756 -- type for such a derived type, but it is a record type with
757 -- no private attributes, so this required extending the
758 -- meaning of this attribute. ???
760 elsif Ekind
(Etype
(Type_Id
)) = E_Record_Type_With_Private
761 and then Present
(Underlying_Type
(Etype
(Type_Id
)))
763 not Has_Discriminants
(Underlying_Type
(Etype
(Type_Id
)))
764 and then not Comes_From_Source
(Parent
(N
))
768 elsif Is_Class_Wide_Type
(Type_Id
) then
770 ("initialization required in class-wide allocation", N
);
773 if Ada_Version
< Ada_2005
774 and then Is_Limited_Type
(Type_Id
)
776 Error_Msg_N
("unconstrained allocation not allowed", N
);
778 if Is_Array_Type
(Type_Id
) then
780 ("\constraint with array bounds required", N
);
782 elsif Has_Unknown_Discriminants
(Type_Id
) then
785 else pragma Assert
(Has_Discriminants
(Type_Id
));
787 ("\constraint with discriminant values required", N
);
790 -- Limited Ada 2005 and general nonlimited case
794 ("uninitialized unconstrained allocation not "
797 if Is_Array_Type
(Type_Id
) then
799 ("\qualified expression or constraint with "
800 & "array bounds required", N
);
802 elsif Has_Unknown_Discriminants
(Type_Id
) then
803 Error_Msg_N
("\qualified expression required", N
);
805 else pragma Assert
(Has_Discriminants
(Type_Id
));
807 ("\qualified expression or constraint with "
808 & "discriminant values required", N
);
816 if Is_Abstract_Type
(Type_Id
) then
817 Error_Msg_N
("cannot allocate abstract object", E
);
820 if Has_Task
(Designated_Type
(Acc_Type
)) then
821 Check_Restriction
(No_Tasking
, N
);
822 Check_Restriction
(Max_Tasks
, N
);
823 Check_Restriction
(No_Task_Allocators
, N
);
826 -- Check restriction against dynamically allocated protected objects
828 if Has_Protected
(Designated_Type
(Acc_Type
)) then
829 Check_Restriction
(No_Protected_Type_Allocators
, N
);
832 -- AI05-0013-1: No_Nested_Finalization forbids allocators if the access
833 -- type is nested, and the designated type needs finalization. The rule
834 -- is conservative in that class-wide types need finalization.
836 if Needs_Finalization
(Designated_Type
(Acc_Type
))
837 and then not Is_Library_Level_Entity
(Acc_Type
)
839 Check_Restriction
(No_Nested_Finalization
, N
);
842 -- Check that an allocator of a nested access type doesn't create a
843 -- protected object when restriction No_Local_Protected_Objects applies.
845 if Has_Protected
(Designated_Type
(Acc_Type
))
846 and then not Is_Library_Level_Entity
(Acc_Type
)
848 Check_Restriction
(No_Local_Protected_Objects
, N
);
851 -- Likewise for No_Local_Timing_Events
853 if Has_Timing_Event
(Designated_Type
(Acc_Type
))
854 and then not Is_Library_Level_Entity
(Acc_Type
)
856 Check_Restriction
(No_Local_Timing_Events
, N
);
859 -- If the No_Streams restriction is set, check that the type of the
860 -- object is not, and does not contain, any subtype derived from
861 -- Ada.Streams.Root_Stream_Type. Note that we guard the call to
862 -- Has_Stream just for efficiency reasons. There is no point in
863 -- spending time on a Has_Stream check if the restriction is not set.
865 if Restriction_Check_Required
(No_Streams
) then
866 if Has_Stream
(Designated_Type
(Acc_Type
)) then
867 Check_Restriction
(No_Streams
, N
);
871 Set_Etype
(N
, Acc_Type
);
873 if not Is_Library_Level_Entity
(Acc_Type
) then
874 Check_Restriction
(No_Local_Allocators
, N
);
877 if Serious_Errors_Detected
> Sav_Errs
then
878 Set_Error_Posted
(N
);
879 Set_Etype
(N
, Any_Type
);
881 end Analyze_Allocator
;
883 ---------------------------
884 -- Analyze_Arithmetic_Op --
885 ---------------------------
887 procedure Analyze_Arithmetic_Op
(N
: Node_Id
) is
888 L
: constant Node_Id
:= Left_Opnd
(N
);
889 R
: constant Node_Id
:= Right_Opnd
(N
);
893 Candidate_Type
:= Empty
;
894 Analyze_Expression
(L
);
895 Analyze_Expression
(R
);
897 -- If the entity is already set, the node is the instantiation of a
898 -- generic node with a non-local reference, or was manufactured by a
899 -- call to Make_Op_xxx. In either case the entity is known to be valid,
900 -- and we do not need to collect interpretations, instead we just get
901 -- the single possible interpretation.
905 if Present
(Op_Id
) then
906 if Ekind
(Op_Id
) = E_Operator
then
908 if Nkind_In
(N
, N_Op_Divide
, N_Op_Mod
, N_Op_Multiply
, N_Op_Rem
)
909 and then Treat_Fixed_As_Integer
(N
)
913 Set_Etype
(N
, Any_Type
);
914 Find_Arithmetic_Types
(L
, R
, Op_Id
, N
);
918 Set_Etype
(N
, Any_Type
);
919 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
922 -- Entity is not already set, so we do need to collect interpretations
925 Set_Etype
(N
, Any_Type
);
927 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
928 while Present
(Op_Id
) loop
929 if Ekind
(Op_Id
) = E_Operator
930 and then Present
(Next_Entity
(First_Entity
(Op_Id
)))
932 Find_Arithmetic_Types
(L
, R
, Op_Id
, N
);
934 -- The following may seem superfluous, because an operator cannot
935 -- be generic, but this ignores the cleverness of the author of
938 elsif Is_Overloadable
(Op_Id
) then
939 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
942 Op_Id
:= Homonym
(Op_Id
);
947 Check_Function_Writable_Actuals
(N
);
948 end Analyze_Arithmetic_Op
;
954 -- Function, procedure, and entry calls are checked here. The Name in
955 -- the call may be overloaded. The actuals have been analyzed and may
956 -- themselves be overloaded. On exit from this procedure, the node N
957 -- may have zero, one or more interpretations. In the first case an
958 -- error message is produced. In the last case, the node is flagged
959 -- as overloaded and the interpretations are collected in All_Interp.
961 -- If the name is an Access_To_Subprogram, it cannot be overloaded, but
962 -- the type-checking is similar to that of other calls.
964 procedure Analyze_Call
(N
: Node_Id
) is
965 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
966 Loc
: constant Source_Ptr
:= Sloc
(N
);
971 Success
: Boolean := False;
973 Deref
: Boolean := False;
974 -- Flag indicates whether an interpretation of the prefix is a
975 -- parameterless call that returns an access_to_subprogram.
977 procedure Check_Mixed_Parameter_And_Named_Associations
;
978 -- Check that parameter and named associations are not mixed. This is
979 -- a restriction in SPARK mode.
981 procedure Check_Writable_Actuals
(N
: Node_Id
);
982 -- If the call has out or in-out parameters then mark its outermost
983 -- enclosing construct as a node on which the writable actuals check
984 -- must be performed.
986 function Name_Denotes_Function
return Boolean;
987 -- If the type of the name is an access to subprogram, this may be the
988 -- type of a name, or the return type of the function being called. If
989 -- the name is not an entity then it can denote a protected function.
990 -- Until we distinguish Etype from Return_Type, we must use this routine
991 -- to resolve the meaning of the name in the call.
993 procedure No_Interpretation
;
994 -- Output error message when no valid interpretation exists
996 --------------------------------------------------
997 -- Check_Mixed_Parameter_And_Named_Associations --
998 --------------------------------------------------
1000 procedure Check_Mixed_Parameter_And_Named_Associations
is
1002 Named_Seen
: Boolean;
1005 Named_Seen
:= False;
1007 Actual
:= First
(Actuals
);
1008 while Present
(Actual
) loop
1009 case Nkind
(Actual
) is
1010 when N_Parameter_Association
=>
1012 Check_SPARK_05_Restriction
1013 ("named association cannot follow positional one",
1024 end Check_Mixed_Parameter_And_Named_Associations
;
1026 ----------------------------
1027 -- Check_Writable_Actuals --
1028 ----------------------------
1030 -- The identification of conflicts in calls to functions with writable
1031 -- actuals is performed in the analysis phase of the front end to ensure
1032 -- that it reports exactly the same errors compiling with and without
1033 -- expansion enabled. It is performed in two stages:
1035 -- 1) When a call to a function with out-mode parameters is found,
1036 -- we climb to the outermost enclosing construct that can be
1037 -- evaluated in arbitrary order and we mark it with the flag
1040 -- 2) When the analysis of the marked node is complete, we traverse
1041 -- its decorated subtree searching for conflicts (see function
1042 -- Sem_Util.Check_Function_Writable_Actuals).
1044 -- The unique exception to this general rule is for aggregates, since
1045 -- their analysis is performed by the front end in the resolution
1046 -- phase. For aggregates we do not climb to their enclosing construct:
1047 -- we restrict the analysis to the subexpressions initializing the
1048 -- aggregate components.
1050 -- This implies that the analysis of expressions containing aggregates
1051 -- is not complete, since there may be conflicts on writable actuals
1052 -- involving subexpressions of the enclosing logical or arithmetic
1053 -- expressions. However, we cannot wait and perform the analysis when
1054 -- the whole subtree is resolved, since the subtrees may be transformed,
1055 -- thus adding extra complexity and computation cost to identify and
1056 -- report exactly the same errors compiling with and without expansion
1059 procedure Check_Writable_Actuals
(N
: Node_Id
) is
1061 if Comes_From_Source
(N
)
1062 and then Present
(Get_Subprogram_Entity
(N
))
1063 and then Has_Out_Or_In_Out_Parameter
(Get_Subprogram_Entity
(N
))
1065 -- For procedures and entries there is no need to climb since
1066 -- we only need to check if the actuals of this call invoke
1067 -- functions whose out-mode parameters overlap.
1069 if Nkind
(N
) /= N_Function_Call
then
1070 Set_Check_Actuals
(N
);
1072 -- For calls to functions we climb to the outermost enclosing
1073 -- construct where the out-mode actuals of this function may
1074 -- introduce conflicts.
1078 Outermost
: Node_Id
:= Empty
; -- init to avoid warning
1082 while Present
(P
) loop
1083 -- For object declarations we can climb to the node from
1084 -- its object definition branch or from its initializing
1085 -- expression. We prefer to mark the child node as the
1086 -- outermost construct to avoid adding further complexity
1087 -- to the routine that will later take care of
1088 -- performing the writable actuals check.
1090 if Has_Arbitrary_Evaluation_Order
(Nkind
(P
))
1091 and then not Nkind_In
(P
, N_Assignment_Statement
,
1092 N_Object_Declaration
)
1097 -- Avoid climbing more than needed
1099 exit when Stop_Subtree_Climbing
(Nkind
(P
))
1100 or else (Nkind
(P
) = N_Range
1102 Nkind_In
(Parent
(P
), N_In
, N_Not_In
));
1107 Set_Check_Actuals
(Outermost
);
1111 end Check_Writable_Actuals
;
1113 ---------------------------
1114 -- Name_Denotes_Function --
1115 ---------------------------
1117 function Name_Denotes_Function
return Boolean is
1119 if Is_Entity_Name
(Nam
) then
1120 return Ekind
(Entity
(Nam
)) = E_Function
;
1121 elsif Nkind
(Nam
) = N_Selected_Component
then
1122 return Ekind
(Entity
(Selector_Name
(Nam
))) = E_Function
;
1126 end Name_Denotes_Function
;
1128 -----------------------
1129 -- No_Interpretation --
1130 -----------------------
1132 procedure No_Interpretation
is
1133 L
: constant Boolean := Is_List_Member
(N
);
1134 K
: constant Node_Kind
:= Nkind
(Parent
(N
));
1137 -- If the node is in a list whose parent is not an expression then it
1138 -- must be an attempted procedure call.
1140 if L
and then K
not in N_Subexpr
then
1141 if Ekind
(Entity
(Nam
)) = E_Generic_Procedure
then
1143 ("must instantiate generic procedure& before call",
1146 Error_Msg_N
("procedure or entry name expected", Nam
);
1149 -- Check for tasking cases where only an entry call will do
1152 and then Nkind_In
(K
, N_Entry_Call_Alternative
,
1153 N_Triggering_Alternative
)
1155 Error_Msg_N
("entry name expected", Nam
);
1157 -- Otherwise give general error message
1160 Error_Msg_N
("invalid prefix in call", Nam
);
1162 end No_Interpretation
;
1164 -- Start of processing for Analyze_Call
1167 if Restriction_Check_Required
(SPARK_05
) then
1168 Check_Mixed_Parameter_And_Named_Associations
;
1171 -- Initialize the type of the result of the call to the error type,
1172 -- which will be reset if the type is successfully resolved.
1174 Set_Etype
(N
, Any_Type
);
1178 if not Is_Overloaded
(Nam
) then
1180 -- Only one interpretation to check
1182 if Ekind
(Etype
(Nam
)) = E_Subprogram_Type
then
1183 Nam_Ent
:= Etype
(Nam
);
1185 -- If the prefix is an access_to_subprogram, this may be an indirect
1186 -- call. This is the case if the name in the call is not an entity
1187 -- name, or if it is a function name in the context of a procedure
1188 -- call. In this latter case, we have a call to a parameterless
1189 -- function that returns a pointer_to_procedure which is the entity
1190 -- being called. Finally, F (X) may be a call to a parameterless
1191 -- function that returns a pointer to a function with parameters.
1192 -- Note that if F returns an access-to-subprogram whose designated
1193 -- type is an array, F (X) cannot be interpreted as an indirect call
1194 -- through the result of the call to F.
1196 elsif Is_Access_Type
(Etype
(Nam
))
1197 and then Ekind
(Designated_Type
(Etype
(Nam
))) = E_Subprogram_Type
1199 (not Name_Denotes_Function
1200 or else Nkind
(N
) = N_Procedure_Call_Statement
1202 (Nkind
(Parent
(N
)) /= N_Explicit_Dereference
1203 and then Is_Entity_Name
(Nam
)
1204 and then No
(First_Formal
(Entity
(Nam
)))
1206 Is_Array_Type
(Etype
(Designated_Type
(Etype
(Nam
))))
1207 and then Present
(Actuals
)))
1209 Nam_Ent
:= Designated_Type
(Etype
(Nam
));
1210 Insert_Explicit_Dereference
(Nam
);
1212 -- Selected component case. Simple entry or protected operation,
1213 -- where the entry name is given by the selector name.
1215 elsif Nkind
(Nam
) = N_Selected_Component
then
1216 Nam_Ent
:= Entity
(Selector_Name
(Nam
));
1218 if not Ekind_In
(Nam_Ent
, E_Entry
,
1223 Error_Msg_N
("name in call is not a callable entity", Nam
);
1224 Set_Etype
(N
, Any_Type
);
1228 -- If the name is an Indexed component, it can be a call to a member
1229 -- of an entry family. The prefix must be a selected component whose
1230 -- selector is the entry. Analyze_Procedure_Call normalizes several
1231 -- kinds of call into this form.
1233 elsif Nkind
(Nam
) = N_Indexed_Component
then
1234 if Nkind
(Prefix
(Nam
)) = N_Selected_Component
then
1235 Nam_Ent
:= Entity
(Selector_Name
(Prefix
(Nam
)));
1237 Error_Msg_N
("name in call is not a callable entity", Nam
);
1238 Set_Etype
(N
, Any_Type
);
1242 elsif not Is_Entity_Name
(Nam
) then
1243 Error_Msg_N
("name in call is not a callable entity", Nam
);
1244 Set_Etype
(N
, Any_Type
);
1248 Nam_Ent
:= Entity
(Nam
);
1250 -- If not overloadable, this may be a generalized indexing
1251 -- operation with named associations. Rewrite again as an
1252 -- indexed component and analyze as container indexing.
1254 if not Is_Overloadable
(Nam_Ent
) then
1256 (Find_Value_Of_Aspect
1257 (Etype
(Nam_Ent
), Aspect_Constant_Indexing
))
1260 Make_Indexed_Component
(Sloc
(N
),
1262 Expressions
=> Parameter_Associations
(N
)));
1264 if Try_Container_Indexing
(N
, Nam
, Expressions
(N
)) then
1278 -- Operations generated for RACW stub types are called only through
1279 -- dispatching, and can never be the static interpretation of a call.
1281 if Is_RACW_Stub_Type_Operation
(Nam_Ent
) then
1286 Analyze_One_Call
(N
, Nam_Ent
, True, Success
);
1288 -- If this is an indirect call, the return type of the access_to
1289 -- subprogram may be an incomplete type. At the point of the call,
1290 -- use the full type if available, and at the same time update the
1291 -- return type of the access_to_subprogram.
1294 and then Nkind
(Nam
) = N_Explicit_Dereference
1295 and then Ekind
(Etype
(N
)) = E_Incomplete_Type
1296 and then Present
(Full_View
(Etype
(N
)))
1298 Set_Etype
(N
, Full_View
(Etype
(N
)));
1299 Set_Etype
(Nam_Ent
, Etype
(N
));
1305 -- An overloaded selected component must denote overloaded operations
1306 -- of a concurrent type. The interpretations are attached to the
1307 -- simple name of those operations.
1309 if Nkind
(Nam
) = N_Selected_Component
then
1310 Nam
:= Selector_Name
(Nam
);
1313 Get_First_Interp
(Nam
, X
, It
);
1314 while Present
(It
.Nam
) loop
1318 -- Name may be call that returns an access to subprogram, or more
1319 -- generally an overloaded expression one of whose interpretations
1320 -- yields an access to subprogram. If the name is an entity, we do
1321 -- not dereference, because the node is a call that returns the
1322 -- access type: note difference between f(x), where the call may
1323 -- return an access subprogram type, and f(x)(y), where the type
1324 -- returned by the call to f is implicitly dereferenced to analyze
1327 if Is_Access_Type
(Nam_Ent
) then
1328 Nam_Ent
:= Designated_Type
(Nam_Ent
);
1330 elsif Is_Access_Type
(Etype
(Nam_Ent
))
1332 (not Is_Entity_Name
(Nam
)
1333 or else Nkind
(N
) = N_Procedure_Call_Statement
)
1334 and then Ekind
(Designated_Type
(Etype
(Nam_Ent
)))
1337 Nam_Ent
:= Designated_Type
(Etype
(Nam_Ent
));
1339 if Is_Entity_Name
(Nam
) then
1344 -- If the call has been rewritten from a prefixed call, the first
1345 -- parameter has been analyzed, but may need a subsequent
1346 -- dereference, so skip its analysis now.
1348 if N
/= Original_Node
(N
)
1349 and then Nkind
(Original_Node
(N
)) = Nkind
(N
)
1350 and then Nkind
(Name
(N
)) /= Nkind
(Name
(Original_Node
(N
)))
1351 and then Present
(Parameter_Associations
(N
))
1352 and then Present
(Etype
(First
(Parameter_Associations
(N
))))
1355 (N
, Nam_Ent
, False, Success
, Skip_First
=> True);
1357 Analyze_One_Call
(N
, Nam_Ent
, False, Success
);
1360 -- If the interpretation succeeds, mark the proper type of the
1361 -- prefix (any valid candidate will do). If not, remove the
1362 -- candidate interpretation. If this is a parameterless call
1363 -- on an anonymous access to subprogram, X is a variable with
1364 -- an access discriminant D, the entity in the interpretation is
1365 -- D, so rewrite X as X.D.all.
1369 and then Nkind
(Parent
(N
)) /= N_Explicit_Dereference
1371 if Ekind
(It
.Nam
) = E_Discriminant
1372 and then Has_Implicit_Dereference
(It
.Nam
)
1375 Make_Explicit_Dereference
(Loc
,
1377 Make_Selected_Component
(Loc
,
1379 New_Occurrence_Of
(Entity
(Nam
), Loc
),
1381 New_Occurrence_Of
(It
.Nam
, Loc
))));
1387 Set_Entity
(Nam
, It
.Nam
);
1388 Insert_Explicit_Dereference
(Nam
);
1389 Set_Etype
(Nam
, Nam_Ent
);
1393 Set_Etype
(Nam
, It
.Typ
);
1396 elsif Nkind_In
(Name
(N
), N_Function_Call
, N_Selected_Component
)
1401 Get_Next_Interp
(X
, It
);
1404 -- If the name is the result of a function call, it can only be a
1405 -- call to a function returning an access to subprogram. Insert
1406 -- explicit dereference.
1408 if Nkind
(Nam
) = N_Function_Call
then
1409 Insert_Explicit_Dereference
(Nam
);
1412 if Etype
(N
) = Any_Type
then
1414 -- None of the interpretations is compatible with the actuals
1416 Diagnose_Call
(N
, Nam
);
1418 -- Special checks for uninstantiated put routines
1420 if Nkind
(N
) = N_Procedure_Call_Statement
1421 and then Is_Entity_Name
(Nam
)
1422 and then Chars
(Nam
) = Name_Put
1423 and then List_Length
(Actuals
) = 1
1426 Arg
: constant Node_Id
:= First
(Actuals
);
1430 if Nkind
(Arg
) = N_Parameter_Association
then
1431 Typ
:= Etype
(Explicit_Actual_Parameter
(Arg
));
1436 if Is_Signed_Integer_Type
(Typ
) then
1438 ("possible missing instantiation of "
1439 & "'Text_'I'O.'Integer_'I'O!", Nam
);
1441 elsif Is_Modular_Integer_Type
(Typ
) then
1443 ("possible missing instantiation of "
1444 & "'Text_'I'O.'Modular_'I'O!", Nam
);
1446 elsif Is_Floating_Point_Type
(Typ
) then
1448 ("possible missing instantiation of "
1449 & "'Text_'I'O.'Float_'I'O!", Nam
);
1451 elsif Is_Ordinary_Fixed_Point_Type
(Typ
) then
1453 ("possible missing instantiation of "
1454 & "'Text_'I'O.'Fixed_'I'O!", Nam
);
1456 elsif Is_Decimal_Fixed_Point_Type
(Typ
) then
1458 ("possible missing instantiation of "
1459 & "'Text_'I'O.'Decimal_'I'O!", Nam
);
1461 elsif Is_Enumeration_Type
(Typ
) then
1463 ("possible missing instantiation of "
1464 & "'Text_'I'O.'Enumeration_'I'O!", Nam
);
1469 elsif not Is_Overloaded
(N
)
1470 and then Is_Entity_Name
(Nam
)
1472 -- Resolution yields a single interpretation. Verify that the
1473 -- reference has capitalization consistent with the declaration.
1475 Set_Entity_With_Checks
(Nam
, Entity
(Nam
));
1476 Generate_Reference
(Entity
(Nam
), Nam
);
1478 Set_Etype
(Nam
, Etype
(Entity
(Nam
)));
1480 Remove_Abstract_Operations
(N
);
1486 if Ada_Version
>= Ada_2012
then
1488 -- Check if the call contains a function with writable actuals
1490 Check_Writable_Actuals
(N
);
1492 -- If found and the outermost construct that can be evaluated in
1493 -- an arbitrary order is precisely this call, then check all its
1496 Check_Function_Writable_Actuals
(N
);
1498 -- The return type of the function may be incomplete. This can be
1499 -- the case if the type is a generic formal, or a limited view. It
1500 -- can also happen when the function declaration appears before the
1501 -- full view of the type (which is legal in Ada 2012) and the call
1502 -- appears in a different unit, in which case the incomplete view
1503 -- must be replaced with the full view (or the nonlimited view)
1504 -- to prevent subsequent type errors. Note that the usual install/
1505 -- removal of limited_with clauses is not sufficient to handle this
1506 -- case, because the limited view may have been captured in another
1507 -- compilation unit that defines the current function.
1509 if Is_Incomplete_Type
(Etype
(N
)) then
1510 if Present
(Full_View
(Etype
(N
))) then
1511 if Is_Entity_Name
(Nam
) then
1512 Set_Etype
(Nam
, Full_View
(Etype
(N
)));
1513 Set_Etype
(Entity
(Nam
), Full_View
(Etype
(N
)));
1516 Set_Etype
(N
, Full_View
(Etype
(N
)));
1518 elsif From_Limited_With
(Etype
(N
))
1519 and then Present
(Non_Limited_View
(Etype
(N
)))
1521 Set_Etype
(N
, Non_Limited_View
(Etype
(N
)));
1523 -- If there is no completion for the type, this may be because
1524 -- there is only a limited view of it and there is nothing in
1525 -- the context of the current unit that has required a regular
1526 -- compilation of the unit containing the type. We recognize
1527 -- this unusual case by the fact that that unit is not analyzed.
1528 -- Note that the call being analyzed is in a different unit from
1529 -- the function declaration, and nothing indicates that the type
1530 -- is a limited view.
1532 elsif Ekind
(Scope
(Etype
(N
))) = E_Package
1533 and then Present
(Limited_View
(Scope
(Etype
(N
))))
1534 and then not Analyzed
(Unit_Declaration_Node
(Scope
(Etype
(N
))))
1537 ("cannot call function that returns limited view of}",
1541 ("\there must be a regular with_clause for package & in the "
1542 & "current unit, or in some unit in its context",
1543 N
, Scope
(Etype
(N
)));
1545 Set_Etype
(N
, Any_Type
);
1551 -----------------------------
1552 -- Analyze_Case_Expression --
1553 -----------------------------
1555 procedure Analyze_Case_Expression
(N
: Node_Id
) is
1556 procedure Non_Static_Choice_Error
(Choice
: Node_Id
);
1557 -- Error routine invoked by the generic instantiation below when
1558 -- the case expression has a non static choice.
1560 package Case_Choices_Analysis
is new
1561 Generic_Analyze_Choices
1562 (Process_Associated_Node
=> No_OP
);
1563 use Case_Choices_Analysis
;
1565 package Case_Choices_Checking
is new
1566 Generic_Check_Choices
1567 (Process_Empty_Choice
=> No_OP
,
1568 Process_Non_Static_Choice
=> Non_Static_Choice_Error
,
1569 Process_Associated_Node
=> No_OP
);
1570 use Case_Choices_Checking
;
1572 -----------------------------
1573 -- Non_Static_Choice_Error --
1574 -----------------------------
1576 procedure Non_Static_Choice_Error
(Choice
: Node_Id
) is
1578 Flag_Non_Static_Expr
1579 ("choice given in case expression is not static!", Choice
);
1580 end Non_Static_Choice_Error
;
1584 Expr
: constant Node_Id
:= Expression
(N
);
1586 Exp_Type
: Entity_Id
;
1587 Exp_Btype
: Entity_Id
;
1589 FirstX
: Node_Id
:= Empty
;
1590 -- First expression in the case for which there is some type information
1591 -- available, i.e. it is not Any_Type, which can happen because of some
1592 -- error, or from the use of e.g. raise Constraint_Error.
1594 Others_Present
: Boolean;
1595 -- Indicates if Others was present
1597 Wrong_Alt
: Node_Id
:= Empty
;
1598 -- For error reporting
1600 -- Start of processing for Analyze_Case_Expression
1603 if Comes_From_Source
(N
) then
1604 Check_Compiler_Unit
("case expression", N
);
1607 Analyze_And_Resolve
(Expr
, Any_Discrete
);
1608 Check_Unset_Reference
(Expr
);
1609 Exp_Type
:= Etype
(Expr
);
1610 Exp_Btype
:= Base_Type
(Exp_Type
);
1612 Alt
:= First
(Alternatives
(N
));
1613 while Present
(Alt
) loop
1614 if Error_Posted
(Expression
(Alt
)) then
1618 Analyze
(Expression
(Alt
));
1620 if No
(FirstX
) and then Etype
(Expression
(Alt
)) /= Any_Type
then
1621 FirstX
:= Expression
(Alt
);
1627 -- Get our initial type from the first expression for which we got some
1628 -- useful type information from the expression.
1634 if not Is_Overloaded
(FirstX
) then
1635 Set_Etype
(N
, Etype
(FirstX
));
1643 Set_Etype
(N
, Any_Type
);
1645 Get_First_Interp
(FirstX
, I
, It
);
1646 while Present
(It
.Nam
) loop
1648 -- For each interpretation of the first expression, we only
1649 -- add the interpretation if every other expression in the
1650 -- case expression alternatives has a compatible type.
1652 Alt
:= Next
(First
(Alternatives
(N
)));
1653 while Present
(Alt
) loop
1654 exit when not Has_Compatible_Type
(Expression
(Alt
), It
.Typ
);
1659 Add_One_Interp
(N
, It
.Typ
, It
.Typ
);
1664 Get_Next_Interp
(I
, It
);
1669 Exp_Btype
:= Base_Type
(Exp_Type
);
1671 -- The expression must be of a discrete type which must be determinable
1672 -- independently of the context in which the expression occurs, but
1673 -- using the fact that the expression must be of a discrete type.
1674 -- Moreover, the type this expression must not be a character literal
1675 -- (which is always ambiguous).
1677 -- If error already reported by Resolve, nothing more to do
1679 if Exp_Btype
= Any_Discrete
or else Exp_Btype
= Any_Type
then
1682 -- Special casee message for character literal
1684 elsif Exp_Btype
= Any_Character
then
1686 ("character literal as case expression is ambiguous", Expr
);
1690 if Etype
(N
) = Any_Type
and then Present
(Wrong_Alt
) then
1692 ("type incompatible with that of previous alternatives",
1693 Expression
(Wrong_Alt
));
1697 -- If the case expression is a formal object of mode in out, then
1698 -- treat it as having a nonstatic subtype by forcing use of the base
1699 -- type (which has to get passed to Check_Case_Choices below). Also
1700 -- use base type when the case expression is parenthesized.
1702 if Paren_Count
(Expr
) > 0
1703 or else (Is_Entity_Name
(Expr
)
1704 and then Ekind
(Entity
(Expr
)) = E_Generic_In_Out_Parameter
)
1706 Exp_Type
:= Exp_Btype
;
1709 -- The case expression alternatives cover the range of a static subtype
1710 -- subject to aspect Static_Predicate. Do not check the choices when the
1711 -- case expression has not been fully analyzed yet because this may lead
1714 if Is_OK_Static_Subtype
(Exp_Type
)
1715 and then Has_Static_Predicate_Aspect
(Exp_Type
)
1716 and then In_Spec_Expression
1720 -- Call Analyze_Choices and Check_Choices to do the rest of the work
1723 Analyze_Choices
(Alternatives
(N
), Exp_Type
);
1724 Check_Choices
(N
, Alternatives
(N
), Exp_Type
, Others_Present
);
1726 if Exp_Type
= Universal_Integer
and then not Others_Present
then
1728 ("case on universal integer requires OTHERS choice", Expr
);
1731 end Analyze_Case_Expression
;
1733 ---------------------------
1734 -- Analyze_Comparison_Op --
1735 ---------------------------
1737 procedure Analyze_Comparison_Op
(N
: Node_Id
) is
1738 L
: constant Node_Id
:= Left_Opnd
(N
);
1739 R
: constant Node_Id
:= Right_Opnd
(N
);
1740 Op_Id
: Entity_Id
:= Entity
(N
);
1743 Set_Etype
(N
, Any_Type
);
1744 Candidate_Type
:= Empty
;
1746 Analyze_Expression
(L
);
1747 Analyze_Expression
(R
);
1749 if Present
(Op_Id
) then
1750 if Ekind
(Op_Id
) = E_Operator
then
1751 Find_Comparison_Types
(L
, R
, Op_Id
, N
);
1753 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1756 if Is_Overloaded
(L
) then
1757 Set_Etype
(L
, Intersect_Types
(L
, R
));
1761 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
1762 while Present
(Op_Id
) loop
1763 if Ekind
(Op_Id
) = E_Operator
then
1764 Find_Comparison_Types
(L
, R
, Op_Id
, N
);
1766 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1769 Op_Id
:= Homonym
(Op_Id
);
1774 Check_Function_Writable_Actuals
(N
);
1775 end Analyze_Comparison_Op
;
1777 ---------------------------
1778 -- Analyze_Concatenation --
1779 ---------------------------
1781 procedure Analyze_Concatenation
(N
: Node_Id
) is
1783 -- We wish to avoid deep recursion, because concatenations are often
1784 -- deeply nested, as in A&B&...&Z. Therefore, we walk down the left
1785 -- operands nonrecursively until we find something that is not a
1786 -- concatenation (A in this case), or has already been analyzed. We
1787 -- analyze that, and then walk back up the tree following Parent
1788 -- pointers, calling Analyze_Concatenation_Rest to do the rest of the
1789 -- work at each level. The Parent pointers allow us to avoid recursion,
1790 -- and thus avoid running out of memory.
1796 Candidate_Type
:= Empty
;
1798 -- The following code is equivalent to:
1800 -- Set_Etype (N, Any_Type);
1801 -- Analyze_Expression (Left_Opnd (N));
1802 -- Analyze_Concatenation_Rest (N);
1804 -- where the Analyze_Expression call recurses back here if the left
1805 -- operand is a concatenation.
1807 -- Walk down left operands
1810 Set_Etype
(NN
, Any_Type
);
1811 L
:= Left_Opnd
(NN
);
1812 exit when Nkind
(L
) /= N_Op_Concat
or else Analyzed
(L
);
1816 -- Now (given the above example) NN is A&B and L is A
1818 -- First analyze L ...
1820 Analyze_Expression
(L
);
1822 -- ... then walk NN back up until we reach N (where we started), calling
1823 -- Analyze_Concatenation_Rest along the way.
1826 Analyze_Concatenation_Rest
(NN
);
1830 end Analyze_Concatenation
;
1832 --------------------------------
1833 -- Analyze_Concatenation_Rest --
1834 --------------------------------
1836 -- If the only one-dimensional array type in scope is String,
1837 -- this is the resulting type of the operation. Otherwise there
1838 -- will be a concatenation operation defined for each user-defined
1839 -- one-dimensional array.
1841 procedure Analyze_Concatenation_Rest
(N
: Node_Id
) is
1842 L
: constant Node_Id
:= Left_Opnd
(N
);
1843 R
: constant Node_Id
:= Right_Opnd
(N
);
1844 Op_Id
: Entity_Id
:= Entity
(N
);
1849 Analyze_Expression
(R
);
1851 -- If the entity is present, the node appears in an instance, and
1852 -- denotes a predefined concatenation operation. The resulting type is
1853 -- obtained from the arguments when possible. If the arguments are
1854 -- aggregates, the array type and the concatenation type must be
1857 if Present
(Op_Id
) then
1858 if Ekind
(Op_Id
) = E_Operator
then
1859 LT
:= Base_Type
(Etype
(L
));
1860 RT
:= Base_Type
(Etype
(R
));
1862 if Is_Array_Type
(LT
)
1863 and then (RT
= LT
or else RT
= Base_Type
(Component_Type
(LT
)))
1865 Add_One_Interp
(N
, Op_Id
, LT
);
1867 elsif Is_Array_Type
(RT
)
1868 and then LT
= Base_Type
(Component_Type
(RT
))
1870 Add_One_Interp
(N
, Op_Id
, RT
);
1872 -- If one operand is a string type or a user-defined array type,
1873 -- and the other is a literal, result is of the specific type.
1876 (Root_Type
(LT
) = Standard_String
1877 or else Scope
(LT
) /= Standard_Standard
)
1878 and then Etype
(R
) = Any_String
1880 Add_One_Interp
(N
, Op_Id
, LT
);
1883 (Root_Type
(RT
) = Standard_String
1884 or else Scope
(RT
) /= Standard_Standard
)
1885 and then Etype
(L
) = Any_String
1887 Add_One_Interp
(N
, Op_Id
, RT
);
1889 elsif not Is_Generic_Type
(Etype
(Op_Id
)) then
1890 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1893 -- Type and its operations must be visible
1895 Set_Entity
(N
, Empty
);
1896 Analyze_Concatenation
(N
);
1900 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1904 Op_Id
:= Get_Name_Entity_Id
(Name_Op_Concat
);
1905 while Present
(Op_Id
) loop
1906 if Ekind
(Op_Id
) = E_Operator
then
1908 -- Do not consider operators declared in dead code, they can
1909 -- not be part of the resolution.
1911 if Is_Eliminated
(Op_Id
) then
1914 Find_Concatenation_Types
(L
, R
, Op_Id
, N
);
1918 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1921 Op_Id
:= Homonym
(Op_Id
);
1926 end Analyze_Concatenation_Rest
;
1928 -------------------------
1929 -- Analyze_Equality_Op --
1930 -------------------------
1932 procedure Analyze_Equality_Op
(N
: Node_Id
) is
1933 Loc
: constant Source_Ptr
:= Sloc
(N
);
1934 L
: constant Node_Id
:= Left_Opnd
(N
);
1935 R
: constant Node_Id
:= Right_Opnd
(N
);
1939 Set_Etype
(N
, Any_Type
);
1940 Candidate_Type
:= Empty
;
1942 Analyze_Expression
(L
);
1943 Analyze_Expression
(R
);
1945 -- If the entity is set, the node is a generic instance with a non-local
1946 -- reference to the predefined operator or to a user-defined function.
1947 -- It can also be an inequality that is expanded into the negation of a
1948 -- call to a user-defined equality operator.
1950 -- For the predefined case, the result is Boolean, regardless of the
1951 -- type of the operands. The operands may even be limited, if they are
1952 -- generic actuals. If they are overloaded, label the left argument with
1953 -- the common type that must be present, or with the type of the formal
1954 -- of the user-defined function.
1956 if Present
(Entity
(N
)) then
1957 Op_Id
:= Entity
(N
);
1959 if Ekind
(Op_Id
) = E_Operator
then
1960 Add_One_Interp
(N
, Op_Id
, Standard_Boolean
);
1962 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1965 if Is_Overloaded
(L
) then
1966 if Ekind
(Op_Id
) = E_Operator
then
1967 Set_Etype
(L
, Intersect_Types
(L
, R
));
1969 Set_Etype
(L
, Etype
(First_Formal
(Op_Id
)));
1974 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
1975 while Present
(Op_Id
) loop
1976 if Ekind
(Op_Id
) = E_Operator
then
1977 Find_Equality_Types
(L
, R
, Op_Id
, N
);
1979 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1982 Op_Id
:= Homonym
(Op_Id
);
1986 -- If there was no match, and the operator is inequality, this may be
1987 -- a case where inequality has not been made explicit, as for tagged
1988 -- types. Analyze the node as the negation of an equality operation.
1989 -- This cannot be done earlier, because before analysis we cannot rule
1990 -- out the presence of an explicit inequality.
1992 if Etype
(N
) = Any_Type
1993 and then Nkind
(N
) = N_Op_Ne
1995 Op_Id
:= Get_Name_Entity_Id
(Name_Op_Eq
);
1996 while Present
(Op_Id
) loop
1997 if Ekind
(Op_Id
) = E_Operator
then
1998 Find_Equality_Types
(L
, R
, Op_Id
, N
);
2000 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
2003 Op_Id
:= Homonym
(Op_Id
);
2006 if Etype
(N
) /= Any_Type
then
2007 Op_Id
:= Entity
(N
);
2013 Left_Opnd
=> Left_Opnd
(N
),
2014 Right_Opnd
=> Right_Opnd
(N
))));
2016 Set_Entity
(Right_Opnd
(N
), Op_Id
);
2022 Check_Function_Writable_Actuals
(N
);
2023 end Analyze_Equality_Op
;
2025 ----------------------------------
2026 -- Analyze_Explicit_Dereference --
2027 ----------------------------------
2029 procedure Analyze_Explicit_Dereference
(N
: Node_Id
) is
2030 Loc
: constant Source_Ptr
:= Sloc
(N
);
2031 P
: constant Node_Id
:= Prefix
(N
);
2037 function Is_Function_Type
return Boolean;
2038 -- Check whether node may be interpreted as an implicit function call
2040 ----------------------
2041 -- Is_Function_Type --
2042 ----------------------
2044 function Is_Function_Type
return Boolean is
2049 if not Is_Overloaded
(N
) then
2050 return Ekind
(Base_Type
(Etype
(N
))) = E_Subprogram_Type
2051 and then Etype
(Base_Type
(Etype
(N
))) /= Standard_Void_Type
;
2054 Get_First_Interp
(N
, I
, It
);
2055 while Present
(It
.Nam
) loop
2056 if Ekind
(Base_Type
(It
.Typ
)) /= E_Subprogram_Type
2057 or else Etype
(Base_Type
(It
.Typ
)) = Standard_Void_Type
2062 Get_Next_Interp
(I
, It
);
2067 end Is_Function_Type
;
2069 -- Start of processing for Analyze_Explicit_Dereference
2072 -- If source node, check SPARK restriction. We guard this with the
2073 -- source node check, because ???
2075 if Comes_From_Source
(N
) then
2076 Check_SPARK_05_Restriction
("explicit dereference is not allowed", N
);
2079 -- In formal verification mode, keep track of all reads and writes
2080 -- through explicit dereferences.
2082 if GNATprove_Mode
then
2083 SPARK_Specific
.Generate_Dereference
(N
);
2087 Set_Etype
(N
, Any_Type
);
2089 -- Test for remote access to subprogram type, and if so return
2090 -- after rewriting the original tree.
2092 if Remote_AST_E_Dereference
(P
) then
2096 -- Normal processing for other than remote access to subprogram type
2098 if not Is_Overloaded
(P
) then
2099 if Is_Access_Type
(Etype
(P
)) then
2101 -- Set the Etype. We need to go through Is_For_Access_Subtypes to
2102 -- avoid other problems caused by the Private_Subtype and it is
2103 -- safe to go to the Base_Type because this is the same as
2104 -- converting the access value to its Base_Type.
2107 DT
: Entity_Id
:= Designated_Type
(Etype
(P
));
2110 if Ekind
(DT
) = E_Private_Subtype
2111 and then Is_For_Access_Subtype
(DT
)
2113 DT
:= Base_Type
(DT
);
2116 -- An explicit dereference is a legal occurrence of an
2117 -- incomplete type imported through a limited_with clause, if
2118 -- the full view is visible, or if we are within an instance
2119 -- body, where the enclosing body has a regular with_clause
2122 if From_Limited_With
(DT
)
2123 and then not From_Limited_With
(Scope
(DT
))
2125 (Is_Immediately_Visible
(Scope
(DT
))
2127 (Is_Child_Unit
(Scope
(DT
))
2128 and then Is_Visible_Lib_Unit
(Scope
(DT
)))
2129 or else In_Instance_Body
)
2131 Set_Etype
(N
, Available_View
(DT
));
2138 elsif Etype
(P
) /= Any_Type
then
2139 Error_Msg_N
("prefix of dereference must be an access type", N
);
2144 Get_First_Interp
(P
, I
, It
);
2145 while Present
(It
.Nam
) loop
2148 if Is_Access_Type
(T
) then
2149 Add_One_Interp
(N
, Designated_Type
(T
), Designated_Type
(T
));
2152 Get_Next_Interp
(I
, It
);
2155 -- Error if no interpretation of the prefix has an access type
2157 if Etype
(N
) = Any_Type
then
2159 ("access type required in prefix of explicit dereference", P
);
2160 Set_Etype
(N
, Any_Type
);
2166 and then Nkind
(Parent
(N
)) /= N_Indexed_Component
2168 and then (Nkind
(Parent
(N
)) /= N_Function_Call
2169 or else N
/= Name
(Parent
(N
)))
2171 and then (Nkind
(Parent
(N
)) /= N_Procedure_Call_Statement
2172 or else N
/= Name
(Parent
(N
)))
2174 and then Nkind
(Parent
(N
)) /= N_Subprogram_Renaming_Declaration
2175 and then (Nkind
(Parent
(N
)) /= N_Attribute_Reference
2177 (Attribute_Name
(Parent
(N
)) /= Name_Address
2179 Attribute_Name
(Parent
(N
)) /= Name_Access
))
2181 -- Name is a function call with no actuals, in a context that
2182 -- requires deproceduring (including as an actual in an enclosing
2183 -- function or procedure call). There are some pathological cases
2184 -- where the prefix might include functions that return access to
2185 -- subprograms and others that return a regular type. Disambiguation
2186 -- of those has to take place in Resolve.
2189 Make_Function_Call
(Loc
,
2190 Name
=> Make_Explicit_Dereference
(Loc
, P
),
2191 Parameter_Associations
=> New_List
);
2193 -- If the prefix is overloaded, remove operations that have formals,
2194 -- we know that this is a parameterless call.
2196 if Is_Overloaded
(P
) then
2197 Get_First_Interp
(P
, I
, It
);
2198 while Present
(It
.Nam
) loop
2201 if No
(First_Formal
(Base_Type
(Designated_Type
(T
)))) then
2207 Get_Next_Interp
(I
, It
);
2214 elsif not Is_Function_Type
2215 and then Is_Overloaded
(N
)
2217 -- The prefix may include access to subprograms and other access
2218 -- types. If the context selects the interpretation that is a
2219 -- function call (not a procedure call) we cannot rewrite the node
2220 -- yet, but we include the result of the call interpretation.
2222 Get_First_Interp
(N
, I
, It
);
2223 while Present
(It
.Nam
) loop
2224 if Ekind
(Base_Type
(It
.Typ
)) = E_Subprogram_Type
2225 and then Etype
(Base_Type
(It
.Typ
)) /= Standard_Void_Type
2226 and then Nkind
(Parent
(N
)) /= N_Procedure_Call_Statement
2228 Add_One_Interp
(N
, Etype
(It
.Typ
), Etype
(It
.Typ
));
2231 Get_Next_Interp
(I
, It
);
2235 -- A value of remote access-to-class-wide must not be dereferenced
2238 Validate_Remote_Access_To_Class_Wide_Type
(N
);
2239 end Analyze_Explicit_Dereference
;
2241 ------------------------
2242 -- Analyze_Expression --
2243 ------------------------
2245 procedure Analyze_Expression
(N
: Node_Id
) is
2248 -- If the expression is an indexed component that will be rewritten
2249 -- as a container indexing, it has already been analyzed.
2251 if Nkind
(N
) = N_Indexed_Component
2252 and then Present
(Generalized_Indexing
(N
))
2258 Check_Parameterless_Call
(N
);
2260 end Analyze_Expression
;
2262 -------------------------------------
2263 -- Analyze_Expression_With_Actions --
2264 -------------------------------------
2266 procedure Analyze_Expression_With_Actions
(N
: Node_Id
) is
2270 A
:= First
(Actions
(N
));
2271 while Present
(A
) loop
2276 Analyze_Expression
(Expression
(N
));
2277 Set_Etype
(N
, Etype
(Expression
(N
)));
2278 end Analyze_Expression_With_Actions
;
2280 ---------------------------
2281 -- Analyze_If_Expression --
2282 ---------------------------
2284 procedure Analyze_If_Expression
(N
: Node_Id
) is
2285 Condition
: constant Node_Id
:= First
(Expressions
(N
));
2286 Then_Expr
: Node_Id
;
2287 Else_Expr
: Node_Id
;
2290 -- Defend against error of missing expressions from previous error
2292 if No
(Condition
) then
2293 Check_Error_Detected
;
2297 Then_Expr
:= Next
(Condition
);
2299 if No
(Then_Expr
) then
2300 Check_Error_Detected
;
2304 Else_Expr
:= Next
(Then_Expr
);
2306 if Comes_From_Source
(N
) then
2307 Check_SPARK_05_Restriction
("if expression is not allowed", N
);
2310 if Comes_From_Source
(N
) then
2311 Check_Compiler_Unit
("if expression", N
);
2314 -- Analyze and resolve the condition. We need to resolve this now so
2315 -- that it gets folded to True/False if possible, before we analyze
2316 -- the THEN/ELSE branches, because when analyzing these branches, we
2317 -- may call Is_Statically_Unevaluated, which expects the condition of
2318 -- an enclosing IF to have been analyze/resolved/evaluated.
2320 Analyze_Expression
(Condition
);
2321 Resolve
(Condition
, Any_Boolean
);
2323 -- Analyze THEN expression and (if present) ELSE expression. For those
2324 -- we delay resolution in the normal manner, because of overloading etc.
2326 Analyze_Expression
(Then_Expr
);
2328 if Present
(Else_Expr
) then
2329 Analyze_Expression
(Else_Expr
);
2332 -- If then expression not overloaded, then that decides the type
2334 if not Is_Overloaded
(Then_Expr
) then
2335 Set_Etype
(N
, Etype
(Then_Expr
));
2337 -- Case where then expression is overloaded
2345 Set_Etype
(N
, Any_Type
);
2347 -- Loop through interpretations of Then_Expr
2349 Get_First_Interp
(Then_Expr
, I
, It
);
2350 while Present
(It
.Nam
) loop
2352 -- Add possible interpretation of Then_Expr if no Else_Expr, or
2353 -- Else_Expr is present and has a compatible type.
2356 or else Has_Compatible_Type
(Else_Expr
, It
.Typ
)
2358 Add_One_Interp
(N
, It
.Typ
, It
.Typ
);
2361 Get_Next_Interp
(I
, It
);
2364 -- If no valid interpretation has been found, then the type of the
2365 -- ELSE expression does not match any interpretation of the THEN
2368 if Etype
(N
) = Any_Type
then
2370 ("type incompatible with that of `THEN` expression",
2376 end Analyze_If_Expression
;
2378 ------------------------------------
2379 -- Analyze_Indexed_Component_Form --
2380 ------------------------------------
2382 procedure Analyze_Indexed_Component_Form
(N
: Node_Id
) is
2383 P
: constant Node_Id
:= Prefix
(N
);
2384 Exprs
: constant List_Id
:= Expressions
(N
);
2390 procedure Process_Function_Call
;
2391 -- Prefix in indexed component form is an overloadable entity, so the
2392 -- node is a function call. Reformat it as such.
2394 procedure Process_Indexed_Component
;
2395 -- Prefix in indexed component form is actually an indexed component.
2396 -- This routine processes it, knowing that the prefix is already
2399 procedure Process_Indexed_Component_Or_Slice
;
2400 -- An indexed component with a single index may designate a slice if
2401 -- the index is a subtype mark. This routine disambiguates these two
2402 -- cases by resolving the prefix to see if it is a subtype mark.
2404 procedure Process_Overloaded_Indexed_Component
;
2405 -- If the prefix of an indexed component is overloaded, the proper
2406 -- interpretation is selected by the index types and the context.
2408 ---------------------------
2409 -- Process_Function_Call --
2410 ---------------------------
2412 procedure Process_Function_Call
is
2413 Loc
: constant Source_Ptr
:= Sloc
(N
);
2417 Change_Node
(N
, N_Function_Call
);
2419 Set_Parameter_Associations
(N
, Exprs
);
2421 -- Analyze actuals prior to analyzing the call itself
2423 Actual
:= First
(Parameter_Associations
(N
));
2424 while Present
(Actual
) loop
2426 Check_Parameterless_Call
(Actual
);
2428 -- Move to next actual. Note that we use Next, not Next_Actual
2429 -- here. The reason for this is a bit subtle. If a function call
2430 -- includes named associations, the parser recognizes the node
2431 -- as a call, and it is analyzed as such. If all associations are
2432 -- positional, the parser builds an indexed_component node, and
2433 -- it is only after analysis of the prefix that the construct
2434 -- is recognized as a call, in which case Process_Function_Call
2435 -- rewrites the node and analyzes the actuals. If the list of
2436 -- actuals is malformed, the parser may leave the node as an
2437 -- indexed component (despite the presence of named associations).
2438 -- The iterator Next_Actual is equivalent to Next if the list is
2439 -- positional, but follows the normalized chain of actuals when
2440 -- named associations are present. In this case normalization has
2441 -- not taken place, and actuals remain unanalyzed, which leads to
2442 -- subsequent crashes or loops if there is an attempt to continue
2443 -- analysis of the program.
2445 -- IF there is a single actual and it is a type name, the node
2446 -- can only be interpreted as a slice of a parameterless call.
2447 -- Rebuild the node as such and analyze.
2449 if No
(Next
(Actual
))
2450 and then Is_Entity_Name
(Actual
)
2451 and then Is_Type
(Entity
(Actual
))
2452 and then Is_Discrete_Type
(Entity
(Actual
))
2458 New_Occurrence_Of
(Entity
(Actual
), Loc
)));
2468 end Process_Function_Call
;
2470 -------------------------------
2471 -- Process_Indexed_Component --
2472 -------------------------------
2474 procedure Process_Indexed_Component
is
2476 Array_Type
: Entity_Id
;
2478 Pent
: Entity_Id
:= Empty
;
2481 Exp
:= First
(Exprs
);
2483 if Is_Overloaded
(P
) then
2484 Process_Overloaded_Indexed_Component
;
2487 Array_Type
:= Etype
(P
);
2489 if Is_Entity_Name
(P
) then
2491 elsif Nkind
(P
) = N_Selected_Component
2492 and then Is_Entity_Name
(Selector_Name
(P
))
2494 Pent
:= Entity
(Selector_Name
(P
));
2497 -- Prefix must be appropriate for an array type, taking into
2498 -- account a possible implicit dereference.
2500 if Is_Access_Type
(Array_Type
) then
2502 (Warn_On_Dereference
, "?d?implicit dereference", N
);
2503 Array_Type
:= Process_Implicit_Dereference_Prefix
(Pent
, P
);
2506 if Is_Array_Type
(Array_Type
) then
2508 -- In order to correctly access First_Index component later,
2509 -- replace string literal subtype by its parent type.
2511 if Ekind
(Array_Type
) = E_String_Literal_Subtype
then
2512 Array_Type
:= Etype
(Array_Type
);
2515 elsif Present
(Pent
) and then Ekind
(Pent
) = E_Entry_Family
then
2517 Set_Etype
(N
, Any_Type
);
2519 if not Has_Compatible_Type
(Exp
, Entry_Index_Type
(Pent
)) then
2520 Error_Msg_N
("invalid index type in entry name", N
);
2522 elsif Present
(Next
(Exp
)) then
2523 Error_Msg_N
("too many subscripts in entry reference", N
);
2526 Set_Etype
(N
, Etype
(P
));
2531 elsif Is_Record_Type
(Array_Type
)
2532 and then Remote_AST_I_Dereference
(P
)
2536 elsif Try_Container_Indexing
(N
, P
, Exprs
) then
2539 elsif Array_Type
= Any_Type
then
2540 Set_Etype
(N
, Any_Type
);
2542 -- In most cases the analysis of the prefix will have emitted
2543 -- an error already, but if the prefix may be interpreted as a
2544 -- call in prefixed notation, the report is left to the caller.
2545 -- To prevent cascaded errors, report only if no previous ones.
2547 if Serious_Errors_Detected
= 0 then
2548 Error_Msg_N
("invalid prefix in indexed component", P
);
2550 if Nkind
(P
) = N_Expanded_Name
then
2551 Error_Msg_NE
("\& is not visible", P
, Selector_Name
(P
));
2557 -- Here we definitely have a bad indexing
2560 if Nkind
(Parent
(N
)) = N_Requeue_Statement
2561 and then Present
(Pent
) and then Ekind
(Pent
) = E_Entry
2564 ("REQUEUE does not permit parameters", First
(Exprs
));
2566 elsif Is_Entity_Name
(P
)
2567 and then Etype
(P
) = Standard_Void_Type
2569 Error_Msg_NE
("incorrect use of &", P
, Entity
(P
));
2572 Error_Msg_N
("array type required in indexed component", P
);
2575 Set_Etype
(N
, Any_Type
);
2579 Index
:= First_Index
(Array_Type
);
2580 while Present
(Index
) and then Present
(Exp
) loop
2581 if not Has_Compatible_Type
(Exp
, Etype
(Index
)) then
2582 Wrong_Type
(Exp
, Etype
(Index
));
2583 Set_Etype
(N
, Any_Type
);
2591 Set_Etype
(N
, Component_Type
(Array_Type
));
2592 Check_Implicit_Dereference
(N
, Etype
(N
));
2594 if Present
(Index
) then
2596 ("too few subscripts in array reference", First
(Exprs
));
2598 elsif Present
(Exp
) then
2599 Error_Msg_N
("too many subscripts in array reference", Exp
);
2602 end Process_Indexed_Component
;
2604 ----------------------------------------
2605 -- Process_Indexed_Component_Or_Slice --
2606 ----------------------------------------
2608 procedure Process_Indexed_Component_Or_Slice
is
2610 Exp
:= First
(Exprs
);
2611 while Present
(Exp
) loop
2612 Analyze_Expression
(Exp
);
2616 Exp
:= First
(Exprs
);
2618 -- If one index is present, and it is a subtype name, then the node
2619 -- denotes a slice (note that the case of an explicit range for a
2620 -- slice was already built as an N_Slice node in the first place,
2621 -- so that case is not handled here).
2623 -- We use a replace rather than a rewrite here because this is one
2624 -- of the cases in which the tree built by the parser is plain wrong.
2627 and then Is_Entity_Name
(Exp
)
2628 and then Is_Type
(Entity
(Exp
))
2631 Make_Slice
(Sloc
(N
),
2633 Discrete_Range
=> New_Copy
(Exp
)));
2636 -- Otherwise (more than one index present, or single index is not
2637 -- a subtype name), then we have the indexed component case.
2640 Process_Indexed_Component
;
2642 end Process_Indexed_Component_Or_Slice
;
2644 ------------------------------------------
2645 -- Process_Overloaded_Indexed_Component --
2646 ------------------------------------------
2648 procedure Process_Overloaded_Indexed_Component
is
2657 Set_Etype
(N
, Any_Type
);
2659 Get_First_Interp
(P
, I
, It
);
2660 while Present
(It
.Nam
) loop
2663 if Is_Access_Type
(Typ
) then
2664 Typ
:= Designated_Type
(Typ
);
2666 (Warn_On_Dereference
, "?d?implicit dereference", N
);
2669 if Is_Array_Type
(Typ
) then
2671 -- Got a candidate: verify that index types are compatible
2673 Index
:= First_Index
(Typ
);
2675 Exp
:= First
(Exprs
);
2676 while Present
(Index
) and then Present
(Exp
) loop
2677 if Has_Compatible_Type
(Exp
, Etype
(Index
)) then
2689 if Found
and then No
(Index
) and then No
(Exp
) then
2691 CT
: constant Entity_Id
:=
2692 Base_Type
(Component_Type
(Typ
));
2694 Add_One_Interp
(N
, CT
, CT
);
2695 Check_Implicit_Dereference
(N
, CT
);
2699 elsif Try_Container_Indexing
(N
, P
, Exprs
) then
2704 Get_Next_Interp
(I
, It
);
2707 if Etype
(N
) = Any_Type
then
2708 Error_Msg_N
("no legal interpretation for indexed component", N
);
2709 Set_Is_Overloaded
(N
, False);
2713 end Process_Overloaded_Indexed_Component
;
2715 -- Start of processing for Analyze_Indexed_Component_Form
2718 -- Get name of array, function or type
2722 -- If P is an explicit dereference whose prefix is of a remote access-
2723 -- to-subprogram type, then N has already been rewritten as a subprogram
2724 -- call and analyzed.
2726 if Nkind
(N
) in N_Subprogram_Call
then
2729 -- When the prefix is attribute 'Loop_Entry and the sole expression of
2730 -- the indexed component denotes a loop name, the indexed form is turned
2731 -- into an attribute reference.
2733 elsif Nkind
(N
) = N_Attribute_Reference
2734 and then Attribute_Name
(N
) = Name_Loop_Entry
2739 pragma Assert
(Nkind
(N
) = N_Indexed_Component
);
2741 P_T
:= Base_Type
(Etype
(P
));
2743 if Is_Entity_Name
(P
) and then Present
(Entity
(P
)) then
2746 if Is_Type
(U_N
) then
2748 -- Reformat node as a type conversion
2750 E
:= Remove_Head
(Exprs
);
2752 if Present
(First
(Exprs
)) then
2754 ("argument of type conversion must be single expression", N
);
2757 Change_Node
(N
, N_Type_Conversion
);
2758 Set_Subtype_Mark
(N
, P
);
2760 Set_Expression
(N
, E
);
2762 -- After changing the node, call for the specific Analysis
2763 -- routine directly, to avoid a double call to the expander.
2765 Analyze_Type_Conversion
(N
);
2769 if Is_Overloadable
(U_N
) then
2770 Process_Function_Call
;
2772 elsif Ekind
(Etype
(P
)) = E_Subprogram_Type
2773 or else (Is_Access_Type
(Etype
(P
))
2775 Ekind
(Designated_Type
(Etype
(P
))) =
2778 -- Call to access_to-subprogram with possible implicit dereference
2780 Process_Function_Call
;
2782 elsif Is_Generic_Subprogram
(U_N
) then
2784 -- A common beginner's (or C++ templates fan) error
2786 Error_Msg_N
("generic subprogram cannot be called", N
);
2787 Set_Etype
(N
, Any_Type
);
2791 Process_Indexed_Component_Or_Slice
;
2794 -- If not an entity name, prefix is an expression that may denote
2795 -- an array or an access-to-subprogram.
2798 if Ekind
(P_T
) = E_Subprogram_Type
2799 or else (Is_Access_Type
(P_T
)
2801 Ekind
(Designated_Type
(P_T
)) = E_Subprogram_Type
)
2803 Process_Function_Call
;
2805 elsif Nkind
(P
) = N_Selected_Component
2806 and then Present
(Entity
(Selector_Name
(P
)))
2807 and then Is_Overloadable
(Entity
(Selector_Name
(P
)))
2809 Process_Function_Call
;
2811 -- In ASIS mode within a generic, a prefixed call is analyzed and
2812 -- partially rewritten but the original indexed component has not
2813 -- yet been rewritten as a call. Perform the replacement now.
2815 elsif Nkind
(P
) = N_Selected_Component
2816 and then Nkind
(Parent
(P
)) = N_Function_Call
2819 Rewrite
(N
, Parent
(P
));
2823 -- Indexed component, slice, or a call to a member of a family
2824 -- entry, which will be converted to an entry call later.
2826 Process_Indexed_Component_Or_Slice
;
2830 Analyze_Dimension
(N
);
2831 end Analyze_Indexed_Component_Form
;
2833 ------------------------
2834 -- Analyze_Logical_Op --
2835 ------------------------
2837 procedure Analyze_Logical_Op
(N
: Node_Id
) is
2838 L
: constant Node_Id
:= Left_Opnd
(N
);
2839 R
: constant Node_Id
:= Right_Opnd
(N
);
2840 Op_Id
: Entity_Id
:= Entity
(N
);
2843 Set_Etype
(N
, Any_Type
);
2844 Candidate_Type
:= Empty
;
2846 Analyze_Expression
(L
);
2847 Analyze_Expression
(R
);
2849 if Present
(Op_Id
) then
2851 if Ekind
(Op_Id
) = E_Operator
then
2852 Find_Boolean_Types
(L
, R
, Op_Id
, N
);
2854 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
2858 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
2859 while Present
(Op_Id
) loop
2860 if Ekind
(Op_Id
) = E_Operator
then
2861 Find_Boolean_Types
(L
, R
, Op_Id
, N
);
2863 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
2866 Op_Id
:= Homonym
(Op_Id
);
2871 Check_Function_Writable_Actuals
(N
);
2872 end Analyze_Logical_Op
;
2874 ---------------------------
2875 -- Analyze_Membership_Op --
2876 ---------------------------
2878 procedure Analyze_Membership_Op
(N
: Node_Id
) is
2879 Loc
: constant Source_Ptr
:= Sloc
(N
);
2880 L
: constant Node_Id
:= Left_Opnd
(N
);
2881 R
: constant Node_Id
:= Right_Opnd
(N
);
2883 Index
: Interp_Index
;
2885 Found
: Boolean := False;
2889 procedure Try_One_Interp
(T1
: Entity_Id
);
2890 -- Routine to try one proposed interpretation. Note that the context
2891 -- of the operation plays no role in resolving the arguments, so that
2892 -- if there is more than one interpretation of the operands that is
2893 -- compatible with a membership test, the operation is ambiguous.
2895 --------------------
2896 -- Try_One_Interp --
2897 --------------------
2899 procedure Try_One_Interp
(T1
: Entity_Id
) is
2901 if Has_Compatible_Type
(R
, T1
) then
2903 and then Base_Type
(T1
) /= Base_Type
(T_F
)
2905 It
:= Disambiguate
(L
, I_F
, Index
, Any_Type
);
2907 if It
= No_Interp
then
2908 Ambiguous_Operands
(N
);
2909 Set_Etype
(L
, Any_Type
);
2926 procedure Analyze_Set_Membership
;
2927 -- If a set of alternatives is present, analyze each and find the
2928 -- common type to which they must all resolve.
2930 ----------------------------
2931 -- Analyze_Set_Membership --
2932 ----------------------------
2934 procedure Analyze_Set_Membership
is
2936 Index
: Interp_Index
;
2938 Candidate_Interps
: Node_Id
;
2939 Common_Type
: Entity_Id
:= Empty
;
2942 if Comes_From_Source
(N
) then
2943 Check_Compiler_Unit
("set membership", N
);
2947 Candidate_Interps
:= L
;
2949 if not Is_Overloaded
(L
) then
2950 Common_Type
:= Etype
(L
);
2952 Alt
:= First
(Alternatives
(N
));
2953 while Present
(Alt
) loop
2956 if not Has_Compatible_Type
(Alt
, Common_Type
) then
2957 Wrong_Type
(Alt
, Common_Type
);
2964 Alt
:= First
(Alternatives
(N
));
2965 while Present
(Alt
) loop
2967 if not Is_Overloaded
(Alt
) then
2968 Common_Type
:= Etype
(Alt
);
2971 Get_First_Interp
(Alt
, Index
, It
);
2972 while Present
(It
.Typ
) loop
2974 Has_Compatible_Type
(Candidate_Interps
, It
.Typ
)
2976 Remove_Interp
(Index
);
2979 Get_Next_Interp
(Index
, It
);
2982 Get_First_Interp
(Alt
, Index
, It
);
2985 Error_Msg_N
("alternative has no legal type", Alt
);
2989 -- If alternative is not overloaded, we have a unique type
2992 Set_Etype
(Alt
, It
.Typ
);
2994 -- If the alternative is an enumeration literal, use the one
2995 -- for this interpretation.
2997 if Is_Entity_Name
(Alt
) then
2998 Set_Entity
(Alt
, It
.Nam
);
3001 Get_Next_Interp
(Index
, It
);
3004 Set_Is_Overloaded
(Alt
, False);
3005 Common_Type
:= Etype
(Alt
);
3008 Candidate_Interps
:= Alt
;
3015 Set_Etype
(N
, Standard_Boolean
);
3017 if Present
(Common_Type
) then
3018 Set_Etype
(L
, Common_Type
);
3020 -- The left operand may still be overloaded, to be resolved using
3024 Error_Msg_N
("cannot resolve membership operation", N
);
3026 end Analyze_Set_Membership
;
3028 -- Start of processing for Analyze_Membership_Op
3031 Analyze_Expression
(L
);
3033 if No
(R
) and then Ada_Version
>= Ada_2012
then
3034 Analyze_Set_Membership
;
3035 Check_Function_Writable_Actuals
(N
);
3040 if Nkind
(R
) = N_Range
3041 or else (Nkind
(R
) = N_Attribute_Reference
3042 and then Attribute_Name
(R
) = Name_Range
)
3046 if not Is_Overloaded
(L
) then
3047 Try_One_Interp
(Etype
(L
));
3050 Get_First_Interp
(L
, Index
, It
);
3051 while Present
(It
.Typ
) loop
3052 Try_One_Interp
(It
.Typ
);
3053 Get_Next_Interp
(Index
, It
);
3057 -- If not a range, it can be a subtype mark, or else it is a degenerate
3058 -- membership test with a singleton value, i.e. a test for equality,
3059 -- if the types are compatible.
3064 if Is_Entity_Name
(R
)
3065 and then Is_Type
(Entity
(R
))
3068 Check_Fully_Declared
(Entity
(R
), R
);
3070 elsif Ada_Version
>= Ada_2012
3071 and then Has_Compatible_Type
(R
, Etype
(L
))
3073 if Nkind
(N
) = N_In
then
3089 -- In all versions of the language, if we reach this point there
3090 -- is a previous error that will be diagnosed below.
3096 -- Compatibility between expression and subtype mark or range is
3097 -- checked during resolution. The result of the operation is Boolean
3100 Set_Etype
(N
, Standard_Boolean
);
3102 if Comes_From_Source
(N
)
3103 and then Present
(Right_Opnd
(N
))
3104 and then Is_CPP_Class
(Etype
(Etype
(Right_Opnd
(N
))))
3106 Error_Msg_N
("membership test not applicable to cpp-class types", N
);
3109 Check_Function_Writable_Actuals
(N
);
3110 end Analyze_Membership_Op
;
3116 procedure Analyze_Mod
(N
: Node_Id
) is
3118 -- A special warning check, if we have an expression of the form:
3119 -- expr mod 2 * literal
3120 -- where literal is 64 or less, then probably what was meant was
3121 -- expr mod 2 ** literal
3122 -- so issue an appropriate warning.
3124 if Warn_On_Suspicious_Modulus_Value
3125 and then Nkind
(Right_Opnd
(N
)) = N_Integer_Literal
3126 and then Intval
(Right_Opnd
(N
)) = Uint_2
3127 and then Nkind
(Parent
(N
)) = N_Op_Multiply
3128 and then Nkind
(Right_Opnd
(Parent
(N
))) = N_Integer_Literal
3129 and then Intval
(Right_Opnd
(Parent
(N
))) <= Uint_64
3132 ("suspicious MOD value, was '*'* intended'??M?", Parent
(N
));
3135 -- Remaining processing is same as for other arithmetic operators
3137 Analyze_Arithmetic_Op
(N
);
3140 ----------------------
3141 -- Analyze_Negation --
3142 ----------------------
3144 procedure Analyze_Negation
(N
: Node_Id
) is
3145 R
: constant Node_Id
:= Right_Opnd
(N
);
3146 Op_Id
: Entity_Id
:= Entity
(N
);
3149 Set_Etype
(N
, Any_Type
);
3150 Candidate_Type
:= Empty
;
3152 Analyze_Expression
(R
);
3154 if Present
(Op_Id
) then
3155 if Ekind
(Op_Id
) = E_Operator
then
3156 Find_Negation_Types
(R
, Op_Id
, N
);
3158 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
3162 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
3163 while Present
(Op_Id
) loop
3164 if Ekind
(Op_Id
) = E_Operator
then
3165 Find_Negation_Types
(R
, Op_Id
, N
);
3167 Analyze_User_Defined_Unary_Op
(N
, Op_Id
);
3170 Op_Id
:= Homonym
(Op_Id
);
3175 end Analyze_Negation
;
3181 procedure Analyze_Null
(N
: Node_Id
) is
3183 Check_SPARK_05_Restriction
("null is not allowed", N
);
3185 Set_Etype
(N
, Any_Access
);
3188 ----------------------
3189 -- Analyze_One_Call --
3190 ----------------------
3192 procedure Analyze_One_Call
3196 Success
: out Boolean;
3197 Skip_First
: Boolean := False)
3199 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
3200 Prev_T
: constant Entity_Id
:= Etype
(N
);
3202 Must_Skip
: constant Boolean := Skip_First
3203 or else Nkind
(Original_Node
(N
)) = N_Selected_Component
3205 (Nkind
(Original_Node
(N
)) = N_Indexed_Component
3206 and then Nkind
(Prefix
(Original_Node
(N
)))
3207 = N_Selected_Component
);
3208 -- The first formal must be omitted from the match when trying to find
3209 -- a primitive operation that is a possible interpretation, and also
3210 -- after the call has been rewritten, because the corresponding actual
3211 -- is already known to be compatible, and because this may be an
3212 -- indexing of a call with default parameters.
3216 Is_Indexed
: Boolean := False;
3217 Is_Indirect
: Boolean := False;
3218 Subp_Type
: constant Entity_Id
:= Etype
(Nam
);
3221 function Compatible_Types_In_Predicate
3223 T2
: Entity_Id
) return Boolean;
3224 -- For an Ada 2012 predicate or invariant, a call may mention an
3225 -- incomplete type, while resolution of the corresponding predicate
3226 -- function may see the full view, as a consequence of the delayed
3227 -- resolution of the corresponding expressions. This may occur in
3228 -- the body of a predicate function, or in a call to such. Anomalies
3229 -- involving private and full views can also happen. In each case,
3230 -- rewrite node or add conversions to remove spurious type errors.
3232 procedure Indicate_Name_And_Type
;
3233 -- If candidate interpretation matches, indicate name and type of result
3236 function Operator_Hidden_By
(Fun
: Entity_Id
) return Boolean;
3237 -- There may be a user-defined operator that hides the current
3238 -- interpretation. We must check for this independently of the
3239 -- analysis of the call with the user-defined operation, because
3240 -- the parameter names may be wrong and yet the hiding takes place.
3241 -- This fixes a problem with ACATS test B34014O.
3243 -- When the type Address is a visible integer type, and the DEC
3244 -- system extension is visible, the predefined operator may be
3245 -- hidden as well, by one of the address operations in auxdec.
3246 -- Finally, The abstract operations on address do not hide the
3247 -- predefined operator (this is the purpose of making them abstract).
3249 -----------------------------------
3250 -- Compatible_Types_In_Predicate --
3251 -----------------------------------
3253 function Compatible_Types_In_Predicate
3255 T2
: Entity_Id
) return Boolean
3257 function Common_Type
(T
: Entity_Id
) return Entity_Id
;
3258 -- Find non-private full view if any, without going to ancestor type
3259 -- (as opposed to Underlying_Type).
3265 function Common_Type
(T
: Entity_Id
) return Entity_Id
is
3267 if Is_Private_Type
(T
) and then Present
(Full_View
(T
)) then
3268 return Base_Type
(Full_View
(T
));
3270 return Base_Type
(T
);
3274 -- Start of processing for Compatible_Types_In_Predicate
3277 if (Ekind
(Current_Scope
) = E_Function
3278 and then Is_Predicate_Function
(Current_Scope
))
3280 (Ekind
(Nam
) = E_Function
3281 and then Is_Predicate_Function
(Nam
))
3283 if Is_Incomplete_Type
(T1
)
3284 and then Present
(Full_View
(T1
))
3285 and then Full_View
(T1
) = T2
3287 Set_Etype
(Formal
, Etype
(Actual
));
3290 elsif Common_Type
(T1
) = Common_Type
(T2
) then
3291 Rewrite
(Actual
, Unchecked_Convert_To
(Etype
(Formal
), Actual
));
3301 end Compatible_Types_In_Predicate
;
3303 ----------------------------
3304 -- Indicate_Name_And_Type --
3305 ----------------------------
3307 procedure Indicate_Name_And_Type
is
3309 Add_One_Interp
(N
, Nam
, Etype
(Nam
));
3310 Check_Implicit_Dereference
(N
, Etype
(Nam
));
3313 -- If the prefix of the call is a name, indicate the entity
3314 -- being called. If it is not a name, it is an expression that
3315 -- denotes an access to subprogram or else an entry or family. In
3316 -- the latter case, the name is a selected component, and the entity
3317 -- being called is noted on the selector.
3319 if not Is_Type
(Nam
) then
3320 if Is_Entity_Name
(Name
(N
)) then
3321 Set_Entity
(Name
(N
), Nam
);
3322 Set_Etype
(Name
(N
), Etype
(Nam
));
3324 elsif Nkind
(Name
(N
)) = N_Selected_Component
then
3325 Set_Entity
(Selector_Name
(Name
(N
)), Nam
);
3329 if Debug_Flag_E
and not Report
then
3330 Write_Str
(" Overloaded call ");
3331 Write_Int
(Int
(N
));
3332 Write_Str
(" compatible with ");
3333 Write_Int
(Int
(Nam
));
3336 end Indicate_Name_And_Type
;
3338 ------------------------
3339 -- Operator_Hidden_By --
3340 ------------------------
3342 function Operator_Hidden_By
(Fun
: Entity_Id
) return Boolean is
3343 Act1
: constant Node_Id
:= First_Actual
(N
);
3344 Act2
: constant Node_Id
:= Next_Actual
(Act1
);
3345 Form1
: constant Entity_Id
:= First_Formal
(Fun
);
3346 Form2
: constant Entity_Id
:= Next_Formal
(Form1
);
3349 if Ekind
(Fun
) /= E_Function
or else Is_Abstract_Subprogram
(Fun
) then
3352 elsif not Has_Compatible_Type
(Act1
, Etype
(Form1
)) then
3355 elsif Present
(Form2
) then
3357 or else not Has_Compatible_Type
(Act2
, Etype
(Form2
))
3362 elsif Present
(Act2
) then
3366 -- Now we know that the arity of the operator matches the function,
3367 -- and the function call is a valid interpretation. The function
3368 -- hides the operator if it has the right signature, or if one of
3369 -- its operands is a non-abstract operation on Address when this is
3370 -- a visible integer type.
3372 return Hides_Op
(Fun
, Nam
)
3373 or else Is_Descendant_Of_Address
(Etype
(Form1
))
3376 and then Is_Descendant_Of_Address
(Etype
(Form2
)));
3377 end Operator_Hidden_By
;
3379 -- Start of processing for Analyze_One_Call
3384 -- If the subprogram has no formals or if all the formals have defaults,
3385 -- and the return type is an array type, the node may denote an indexing
3386 -- of the result of a parameterless call. In Ada 2005, the subprogram
3387 -- may have one non-defaulted formal, and the call may have been written
3388 -- in prefix notation, so that the rebuilt parameter list has more than
3391 if not Is_Overloadable
(Nam
)
3392 and then Ekind
(Nam
) /= E_Subprogram_Type
3393 and then Ekind
(Nam
) /= E_Entry_Family
3398 -- An indexing requires at least one actual. The name of the call cannot
3399 -- be an implicit indirect call, so it cannot be a generated explicit
3402 if not Is_Empty_List
(Actuals
)
3404 (Needs_No_Actuals
(Nam
)
3406 (Needs_One_Actual
(Nam
)
3407 and then Present
(Next_Actual
(First
(Actuals
)))))
3409 if Is_Array_Type
(Subp_Type
)
3411 (Nkind
(Name
(N
)) /= N_Explicit_Dereference
3412 or else Comes_From_Source
(Name
(N
)))
3414 Is_Indexed
:= Try_Indexed_Call
(N
, Nam
, Subp_Type
, Must_Skip
);
3416 elsif Is_Access_Type
(Subp_Type
)
3417 and then Is_Array_Type
(Designated_Type
(Subp_Type
))
3421 (N
, Nam
, Designated_Type
(Subp_Type
), Must_Skip
);
3423 -- The prefix can also be a parameterless function that returns an
3424 -- access to subprogram, in which case this is an indirect call.
3425 -- If this succeeds, an explicit dereference is added later on,
3426 -- in Analyze_Call or Resolve_Call.
3428 elsif Is_Access_Type
(Subp_Type
)
3429 and then Ekind
(Designated_Type
(Subp_Type
)) = E_Subprogram_Type
3431 Is_Indirect
:= Try_Indirect_Call
(N
, Nam
, Subp_Type
);
3436 -- If the call has been transformed into a slice, it is of the form
3437 -- F (Subtype) where F is parameterless. The node has been rewritten in
3438 -- Try_Indexed_Call and there is nothing else to do.
3441 and then Nkind
(N
) = N_Slice
3447 (N
, Nam
, (Report
and not Is_Indexed
and not Is_Indirect
), Norm_OK
);
3451 -- If an indirect call is a possible interpretation, indicate
3452 -- success to the caller. This may be an indexing of an explicit
3453 -- dereference of a call that returns an access type (see above).
3457 and then Nkind
(Name
(N
)) = N_Explicit_Dereference
3458 and then Comes_From_Source
(Name
(N
)))
3463 -- Mismatch in number or names of parameters
3465 elsif Debug_Flag_E
then
3466 Write_Str
(" normalization fails in call ");
3467 Write_Int
(Int
(N
));
3468 Write_Str
(" with subprogram ");
3469 Write_Int
(Int
(Nam
));
3473 -- If the context expects a function call, discard any interpretation
3474 -- that is a procedure. If the node is not overloaded, leave as is for
3475 -- better error reporting when type mismatch is found.
3477 elsif Nkind
(N
) = N_Function_Call
3478 and then Is_Overloaded
(Name
(N
))
3479 and then Ekind
(Nam
) = E_Procedure
3483 -- Ditto for function calls in a procedure context
3485 elsif Nkind
(N
) = N_Procedure_Call_Statement
3486 and then Is_Overloaded
(Name
(N
))
3487 and then Etype
(Nam
) /= Standard_Void_Type
3491 elsif No
(Actuals
) then
3493 -- If Normalize succeeds, then there are default parameters for
3496 Indicate_Name_And_Type
;
3498 elsif Ekind
(Nam
) = E_Operator
then
3499 if Nkind
(N
) = N_Procedure_Call_Statement
then
3503 -- This can occur when the prefix of the call is an operator
3504 -- name or an expanded name whose selector is an operator name.
3506 Analyze_Operator_Call
(N
, Nam
);
3508 if Etype
(N
) /= Prev_T
then
3510 -- Check that operator is not hidden by a function interpretation
3512 if Is_Overloaded
(Name
(N
)) then
3518 Get_First_Interp
(Name
(N
), I
, It
);
3519 while Present
(It
.Nam
) loop
3520 if Operator_Hidden_By
(It
.Nam
) then
3521 Set_Etype
(N
, Prev_T
);
3525 Get_Next_Interp
(I
, It
);
3530 -- If operator matches formals, record its name on the call.
3531 -- If the operator is overloaded, Resolve will select the
3532 -- correct one from the list of interpretations. The call
3533 -- node itself carries the first candidate.
3535 Set_Entity
(Name
(N
), Nam
);
3538 elsif Report
and then Etype
(N
) = Any_Type
then
3539 Error_Msg_N
("incompatible arguments for operator", N
);
3543 -- Normalize_Actuals has chained the named associations in the
3544 -- correct order of the formals.
3546 Actual
:= First_Actual
(N
);
3547 Formal
:= First_Formal
(Nam
);
3549 -- If we are analyzing a call rewritten from object notation, skip
3550 -- first actual, which may be rewritten later as an explicit
3554 Next_Actual
(Actual
);
3555 Next_Formal
(Formal
);
3558 while Present
(Actual
) and then Present
(Formal
) loop
3559 if Nkind
(Parent
(Actual
)) /= N_Parameter_Association
3560 or else Chars
(Selector_Name
(Parent
(Actual
))) = Chars
(Formal
)
3562 -- The actual can be compatible with the formal, but we must
3563 -- also check that the context is not an address type that is
3564 -- visibly an integer type. In this case the use of literals is
3565 -- illegal, except in the body of descendants of system, where
3566 -- arithmetic operations on address are of course used.
3568 if Has_Compatible_Type
(Actual
, Etype
(Formal
))
3570 (Etype
(Actual
) /= Universal_Integer
3571 or else not Is_Descendant_Of_Address
(Etype
(Formal
))
3572 or else In_Predefined_Unit
(N
))
3574 Next_Actual
(Actual
);
3575 Next_Formal
(Formal
);
3577 -- In Allow_Integer_Address mode, we allow an actual integer to
3578 -- match a formal address type and vice versa. We only do this
3579 -- if we are certain that an error will otherwise be issued
3581 elsif Address_Integer_Convert_OK
3582 (Etype
(Actual
), Etype
(Formal
))
3583 and then (Report
and not Is_Indexed
and not Is_Indirect
)
3585 -- Handle this case by introducing an unchecked conversion
3588 Unchecked_Convert_To
(Etype
(Formal
),
3589 Relocate_Node
(Actual
)));
3590 Analyze_And_Resolve
(Actual
, Etype
(Formal
));
3591 Next_Actual
(Actual
);
3592 Next_Formal
(Formal
);
3594 -- Under relaxed RM semantics silently replace occurrences of
3595 -- null by System.Address_Null. We only do this if we know that
3596 -- an error will otherwise be issued.
3598 elsif Null_To_Null_Address_Convert_OK
(Actual
, Etype
(Formal
))
3599 and then (Report
and not Is_Indexed
and not Is_Indirect
)
3601 Replace_Null_By_Null_Address
(Actual
);
3602 Analyze_And_Resolve
(Actual
, Etype
(Formal
));
3603 Next_Actual
(Actual
);
3604 Next_Formal
(Formal
);
3606 elsif Compatible_Types_In_Predicate
3607 (Etype
(Formal
), Etype
(Actual
))
3609 Next_Actual
(Actual
);
3610 Next_Formal
(Formal
);
3612 -- In a complex case where an enclosing generic and a nested
3613 -- generic package, both declared with partially parameterized
3614 -- formal subprograms with the same names, are instantiated
3615 -- with the same type, the types of the actual parameter and
3616 -- that of the formal may appear incompatible at first sight.
3619 -- type Outer_T is private;
3620 -- with function Func (Formal : Outer_T)
3621 -- return ... is <>;
3623 -- package Outer_Gen is
3625 -- type Inner_T is private;
3626 -- with function Func (Formal : Inner_T) -- (1)
3627 -- return ... is <>;
3629 -- package Inner_Gen is
3630 -- function Inner_Func (Formal : Inner_T) -- (2)
3631 -- return ... is (Func (Formal));
3633 -- end Outer_Generic;
3635 -- package Outer_Inst is new Outer_Gen (Actual_T);
3636 -- package Inner_Inst is new Outer_Inst.Inner_Gen (Actual_T);
3638 -- In the example above, the type of parameter
3639 -- Inner_Func.Formal at (2) is incompatible with the type of
3640 -- Func.Formal at (1) in the context of instantiations
3641 -- Outer_Inst and Inner_Inst. In reality both types are generic
3642 -- actual subtypes renaming base type Actual_T as part of the
3643 -- generic prologues for the instantiations.
3645 -- Recognize this case and add a type conversion to allow this
3646 -- kind of generic actual subtype conformance. Note that this
3647 -- is done only when the call is non-overloaded because the
3648 -- resolution mechanism already has the means to disambiguate
3651 elsif not Is_Overloaded
(Name
(N
))
3652 and then Is_Type
(Etype
(Actual
))
3653 and then Is_Type
(Etype
(Formal
))
3654 and then Is_Generic_Actual_Type
(Etype
(Actual
))
3655 and then Is_Generic_Actual_Type
(Etype
(Formal
))
3656 and then Base_Type
(Etype
(Actual
)) =
3657 Base_Type
(Etype
(Formal
))
3660 Convert_To
(Etype
(Formal
), Relocate_Node
(Actual
)));
3661 Analyze_And_Resolve
(Actual
, Etype
(Formal
));
3662 Next_Actual
(Actual
);
3663 Next_Formal
(Formal
);
3665 -- Handle failed type check
3668 if Debug_Flag_E
then
3669 Write_Str
(" type checking fails in call ");
3670 Write_Int
(Int
(N
));
3671 Write_Str
(" with formal ");
3672 Write_Int
(Int
(Formal
));
3673 Write_Str
(" in subprogram ");
3674 Write_Int
(Int
(Nam
));
3678 -- Comment needed on the following test???
3680 if Report
and not Is_Indexed
and not Is_Indirect
then
3682 -- Ada 2005 (AI-251): Complete the error notification
3683 -- to help new Ada 2005 users.
3685 if Is_Class_Wide_Type
(Etype
(Formal
))
3686 and then Is_Interface
(Etype
(Etype
(Formal
)))
3687 and then not Interface_Present_In_Ancestor
3688 (Typ
=> Etype
(Actual
),
3689 Iface
=> Etype
(Etype
(Formal
)))
3692 ("(Ada 2005) does not implement interface }",
3693 Actual
, Etype
(Etype
(Formal
)));
3696 Wrong_Type
(Actual
, Etype
(Formal
));
3698 if Nkind
(Actual
) = N_Op_Eq
3699 and then Nkind
(Left_Opnd
(Actual
)) = N_Identifier
3701 Formal
:= First_Formal
(Nam
);
3702 while Present
(Formal
) loop
3703 if Chars
(Left_Opnd
(Actual
)) = Chars
(Formal
) then
3704 Error_Msg_N
-- CODEFIX
3705 ("possible misspelling of `='>`!", Actual
);
3709 Next_Formal
(Formal
);
3713 if All_Errors_Mode
then
3714 Error_Msg_Sloc
:= Sloc
(Nam
);
3716 if Etype
(Formal
) = Any_Type
then
3718 ("there is no legal actual parameter", Actual
);
3721 if Is_Overloadable
(Nam
)
3722 and then Present
(Alias
(Nam
))
3723 and then not Comes_From_Source
(Nam
)
3726 ("\\ =='> in call to inherited operation & #!",
3729 elsif Ekind
(Nam
) = E_Subprogram_Type
then
3731 Access_To_Subprogram_Typ
:
3732 constant Entity_Id
:=
3734 (Associated_Node_For_Itype
(Nam
));
3737 ("\\ =='> in call to dereference of &#!",
3738 Actual
, Access_To_Subprogram_Typ
);
3743 ("\\ =='> in call to &#!", Actual
, Nam
);
3753 -- Normalize_Actuals has verified that a default value exists
3754 -- for this formal. Current actual names a subsequent formal.
3756 Next_Formal
(Formal
);
3760 -- On exit, all actuals match
3762 Indicate_Name_And_Type
;
3764 end Analyze_One_Call
;
3766 ---------------------------
3767 -- Analyze_Operator_Call --
3768 ---------------------------
3770 procedure Analyze_Operator_Call
(N
: Node_Id
; Op_Id
: Entity_Id
) is
3771 Op_Name
: constant Name_Id
:= Chars
(Op_Id
);
3772 Act1
: constant Node_Id
:= First_Actual
(N
);
3773 Act2
: constant Node_Id
:= Next_Actual
(Act1
);
3776 -- Binary operator case
3778 if Present
(Act2
) then
3780 -- If more than two operands, then not binary operator after all
3782 if Present
(Next_Actual
(Act2
)) then
3786 -- Otherwise action depends on operator
3797 Find_Arithmetic_Types
(Act1
, Act2
, Op_Id
, N
);
3803 Find_Boolean_Types
(Act1
, Act2
, Op_Id
, N
);
3810 Find_Comparison_Types
(Act1
, Act2
, Op_Id
, N
);
3815 Find_Equality_Types
(Act1
, Act2
, Op_Id
, N
);
3817 when Name_Op_Concat
=>
3818 Find_Concatenation_Types
(Act1
, Act2
, Op_Id
, N
);
3820 -- Is this when others, or should it be an abort???
3826 -- Unary operator case
3834 Find_Unary_Types
(Act1
, Op_Id
, N
);
3837 Find_Negation_Types
(Act1
, Op_Id
, N
);
3839 -- Is this when others correct, or should it be an abort???
3845 end Analyze_Operator_Call
;
3847 -------------------------------------------
3848 -- Analyze_Overloaded_Selected_Component --
3849 -------------------------------------------
3851 procedure Analyze_Overloaded_Selected_Component
(N
: Node_Id
) is
3852 Nam
: constant Node_Id
:= Prefix
(N
);
3853 Sel
: constant Node_Id
:= Selector_Name
(N
);
3860 Set_Etype
(Sel
, Any_Type
);
3862 Get_First_Interp
(Nam
, I
, It
);
3863 while Present
(It
.Typ
) loop
3864 if Is_Access_Type
(It
.Typ
) then
3865 T
:= Designated_Type
(It
.Typ
);
3866 Error_Msg_NW
(Warn_On_Dereference
, "?d?implicit dereference", N
);
3871 -- Locate the component. For a private prefix the selector can denote
3874 if Is_Record_Type
(T
) or else Is_Private_Type
(T
) then
3876 -- If the prefix is a class-wide type, the visible components are
3877 -- those of the base type.
3879 if Is_Class_Wide_Type
(T
) then
3883 Comp
:= First_Entity
(T
);
3884 while Present
(Comp
) loop
3885 if Chars
(Comp
) = Chars
(Sel
)
3886 and then Is_Visible_Component
(Comp
)
3889 -- AI05-105: if the context is an object renaming with
3890 -- an anonymous access type, the expected type of the
3891 -- object must be anonymous. This is a name resolution rule.
3893 if Nkind
(Parent
(N
)) /= N_Object_Renaming_Declaration
3894 or else No
(Access_Definition
(Parent
(N
)))
3895 or else Ekind
(Etype
(Comp
)) = E_Anonymous_Access_Type
3897 Ekind
(Etype
(Comp
)) = E_Anonymous_Access_Subprogram_Type
3899 Set_Entity
(Sel
, Comp
);
3900 Set_Etype
(Sel
, Etype
(Comp
));
3901 Add_One_Interp
(N
, Etype
(Comp
), Etype
(Comp
));
3902 Check_Implicit_Dereference
(N
, Etype
(Comp
));
3904 -- This also specifies a candidate to resolve the name.
3905 -- Further overloading will be resolved from context.
3906 -- The selector name itself does not carry overloading
3909 Set_Etype
(Nam
, It
.Typ
);
3912 -- Named access type in the context of a renaming
3913 -- declaration with an access definition. Remove
3914 -- inapplicable candidate.
3923 elsif Is_Concurrent_Type
(T
) then
3924 Comp
:= First_Entity
(T
);
3925 while Present
(Comp
)
3926 and then Comp
/= First_Private_Entity
(T
)
3928 if Chars
(Comp
) = Chars
(Sel
) then
3929 if Is_Overloadable
(Comp
) then
3930 Add_One_Interp
(Sel
, Comp
, Etype
(Comp
));
3932 Set_Entity_With_Checks
(Sel
, Comp
);
3933 Generate_Reference
(Comp
, Sel
);
3936 Set_Etype
(Sel
, Etype
(Comp
));
3937 Set_Etype
(N
, Etype
(Comp
));
3938 Set_Etype
(Nam
, It
.Typ
);
3940 -- For access type case, introduce explicit dereference for
3941 -- more uniform treatment of entry calls. Do this only once
3942 -- if several interpretations yield an access type.
3944 if Is_Access_Type
(Etype
(Nam
))
3945 and then Nkind
(Nam
) /= N_Explicit_Dereference
3947 Insert_Explicit_Dereference
(Nam
);
3949 (Warn_On_Dereference
, "?d?implicit dereference", N
);
3956 Set_Is_Overloaded
(N
, Is_Overloaded
(Sel
));
3959 Get_Next_Interp
(I
, It
);
3962 if Etype
(N
) = Any_Type
3963 and then not Try_Object_Operation
(N
)
3965 Error_Msg_NE
("undefined selector& for overloaded prefix", N
, Sel
);
3966 Set_Entity
(Sel
, Any_Id
);
3967 Set_Etype
(Sel
, Any_Type
);
3969 end Analyze_Overloaded_Selected_Component
;
3971 ----------------------------------
3972 -- Analyze_Qualified_Expression --
3973 ----------------------------------
3975 procedure Analyze_Qualified_Expression
(N
: Node_Id
) is
3976 Mark
: constant Entity_Id
:= Subtype_Mark
(N
);
3977 Expr
: constant Node_Id
:= Expression
(N
);
3983 Analyze_Expression
(Expr
);
3985 Set_Etype
(N
, Any_Type
);
3989 if Nkind_In
(Enclosing_Declaration
(N
), N_Formal_Type_Declaration
,
3990 N_Full_Type_Declaration
,
3991 N_Incomplete_Type_Declaration
,
3992 N_Protected_Type_Declaration
,
3993 N_Private_Extension_Declaration
,
3994 N_Private_Type_Declaration
,
3995 N_Subtype_Declaration
,
3996 N_Task_Type_Declaration
)
3997 and then T
= Defining_Identifier
(Enclosing_Declaration
(N
))
3999 Error_Msg_N
("current instance not allowed", Mark
);
4005 if T
= Any_Type
then
4009 Check_Fully_Declared
(T
, N
);
4011 -- If expected type is class-wide, check for exact match before
4012 -- expansion, because if the expression is a dispatching call it
4013 -- may be rewritten as explicit dereference with class-wide result.
4014 -- If expression is overloaded, retain only interpretations that
4015 -- will yield exact matches.
4017 if Is_Class_Wide_Type
(T
) then
4018 if not Is_Overloaded
(Expr
) then
4019 if Base_Type
(Etype
(Expr
)) /= Base_Type
(T
) then
4020 if Nkind
(Expr
) = N_Aggregate
then
4021 Error_Msg_N
("type of aggregate cannot be class-wide", Expr
);
4023 Wrong_Type
(Expr
, T
);
4028 Get_First_Interp
(Expr
, I
, It
);
4030 while Present
(It
.Nam
) loop
4031 if Base_Type
(It
.Typ
) /= Base_Type
(T
) then
4035 Get_Next_Interp
(I
, It
);
4041 end Analyze_Qualified_Expression
;
4043 -----------------------------------
4044 -- Analyze_Quantified_Expression --
4045 -----------------------------------
4047 procedure Analyze_Quantified_Expression
(N
: Node_Id
) is
4048 function Is_Empty_Range
(Typ
: Entity_Id
) return Boolean;
4049 -- If the iterator is part of a quantified expression, and the range is
4050 -- known to be statically empty, emit a warning and replace expression
4051 -- with its static value. Returns True if the replacement occurs.
4053 function No_Else_Or_Trivial_True
(If_Expr
: Node_Id
) return Boolean;
4054 -- Determine whether if expression If_Expr lacks an else part or if it
4055 -- has one, it evaluates to True.
4057 --------------------
4058 -- Is_Empty_Range --
4059 --------------------
4061 function Is_Empty_Range
(Typ
: Entity_Id
) return Boolean is
4062 Loc
: constant Source_Ptr
:= Sloc
(N
);
4065 if Is_Array_Type
(Typ
)
4066 and then Compile_Time_Known_Bounds
(Typ
)
4068 (Expr_Value
(Type_Low_Bound
(Etype
(First_Index
(Typ
)))) >
4069 Expr_Value
(Type_High_Bound
(Etype
(First_Index
(Typ
)))))
4071 Preanalyze_And_Resolve
(Condition
(N
), Standard_Boolean
);
4073 if All_Present
(N
) then
4075 ("??quantified expression with ALL "
4076 & "over a null range has value True", N
);
4077 Rewrite
(N
, New_Occurrence_Of
(Standard_True
, Loc
));
4081 ("??quantified expression with SOME "
4082 & "over a null range has value False", N
);
4083 Rewrite
(N
, New_Occurrence_Of
(Standard_False
, Loc
));
4094 -----------------------------
4095 -- No_Else_Or_Trivial_True --
4096 -----------------------------
4098 function No_Else_Or_Trivial_True
(If_Expr
: Node_Id
) return Boolean is
4099 Else_Expr
: constant Node_Id
:=
4100 Next
(Next
(First
(Expressions
(If_Expr
))));
4104 or else (Compile_Time_Known_Value
(Else_Expr
)
4105 and then Is_True
(Expr_Value
(Else_Expr
)));
4106 end No_Else_Or_Trivial_True
;
4110 Cond
: constant Node_Id
:= Condition
(N
);
4111 Loop_Id
: Entity_Id
;
4112 QE_Scop
: Entity_Id
;
4114 -- Start of processing for Analyze_Quantified_Expression
4117 Check_SPARK_05_Restriction
("quantified expression is not allowed", N
);
4119 -- Create a scope to emulate the loop-like behavior of the quantified
4120 -- expression. The scope is needed to provide proper visibility of the
4123 QE_Scop
:= New_Internal_Entity
(E_Loop
, Current_Scope
, Sloc
(N
), 'L');
4124 Set_Etype
(QE_Scop
, Standard_Void_Type
);
4125 Set_Scope
(QE_Scop
, Current_Scope
);
4126 Set_Parent
(QE_Scop
, N
);
4128 Push_Scope
(QE_Scop
);
4130 -- All constituents are preanalyzed and resolved to avoid untimely
4131 -- generation of various temporaries and types. Full analysis and
4132 -- expansion is carried out when the quantified expression is
4133 -- transformed into an expression with actions.
4135 if Present
(Iterator_Specification
(N
)) then
4136 Preanalyze
(Iterator_Specification
(N
));
4138 -- Do not proceed with the analysis when the range of iteration is
4139 -- empty. The appropriate error is issued by Is_Empty_Range.
4141 if Is_Entity_Name
(Name
(Iterator_Specification
(N
)))
4142 and then Is_Empty_Range
(Etype
(Name
(Iterator_Specification
(N
))))
4147 else pragma Assert
(Present
(Loop_Parameter_Specification
(N
)));
4149 Loop_Par
: constant Node_Id
:= Loop_Parameter_Specification
(N
);
4152 Preanalyze
(Loop_Par
);
4154 if Nkind
(Discrete_Subtype_Definition
(Loop_Par
)) = N_Function_Call
4155 and then Parent
(Loop_Par
) /= N
4157 -- The parser cannot distinguish between a loop specification
4158 -- and an iterator specification. If after pre-analysis the
4159 -- proper form has been recognized, rewrite the expression to
4160 -- reflect the right kind. This is needed for proper ASIS
4161 -- navigation. If expansion is enabled, the transformation is
4162 -- performed when the expression is rewritten as a loop.
4164 Set_Iterator_Specification
(N
,
4165 New_Copy_Tree
(Iterator_Specification
(Parent
(Loop_Par
))));
4167 Set_Defining_Identifier
(Iterator_Specification
(N
),
4168 Relocate_Node
(Defining_Identifier
(Loop_Par
)));
4169 Set_Name
(Iterator_Specification
(N
),
4170 Relocate_Node
(Discrete_Subtype_Definition
(Loop_Par
)));
4171 Set_Comes_From_Source
(Iterator_Specification
(N
),
4172 Comes_From_Source
(Loop_Parameter_Specification
(N
)));
4173 Set_Loop_Parameter_Specification
(N
, Empty
);
4178 Preanalyze_And_Resolve
(Cond
, Standard_Boolean
);
4181 Set_Etype
(N
, Standard_Boolean
);
4183 -- Verify that the loop variable is used within the condition of the
4184 -- quantified expression.
4186 if Present
(Iterator_Specification
(N
)) then
4187 Loop_Id
:= Defining_Identifier
(Iterator_Specification
(N
));
4189 Loop_Id
:= Defining_Identifier
(Loop_Parameter_Specification
(N
));
4192 if Warn_On_Suspicious_Contract
4193 and then not Referenced
(Loop_Id
, Cond
)
4195 -- Generating C, this check causes spurious warnings on inlined
4196 -- postconditions; we can safely disable it because this check
4197 -- was previously performed when analyzing the internally built
4198 -- postconditions procedure.
4200 if Modify_Tree_For_C
and then In_Inlined_Body
then
4203 Error_Msg_N
("?T?unused variable &", Loop_Id
);
4207 -- Diagnose a possible misuse of the SOME existential quantifier. When
4208 -- we have a quantified expression of the form:
4210 -- for some X => (if P then Q [else True])
4212 -- any value for X that makes P False results in the if expression being
4213 -- trivially True, and so also results in the quantified expression
4214 -- being trivially True.
4216 if Warn_On_Suspicious_Contract
4217 and then not All_Present
(N
)
4218 and then Nkind
(Cond
) = N_If_Expression
4219 and then No_Else_Or_Trivial_True
(Cond
)
4221 Error_Msg_N
("?T?suspicious expression", N
);
4222 Error_Msg_N
("\\did you mean (for all X ='> (if P then Q))", N
);
4223 Error_Msg_N
("\\or (for some X ='> P and then Q) instead'?", N
);
4225 end Analyze_Quantified_Expression
;
4231 procedure Analyze_Range
(N
: Node_Id
) is
4232 L
: constant Node_Id
:= Low_Bound
(N
);
4233 H
: constant Node_Id
:= High_Bound
(N
);
4234 I1
, I2
: Interp_Index
;
4237 procedure Check_Common_Type
(T1
, T2
: Entity_Id
);
4238 -- Verify the compatibility of two types, and choose the
4239 -- non universal one if the other is universal.
4241 procedure Check_High_Bound
(T
: Entity_Id
);
4242 -- Test one interpretation of the low bound against all those
4243 -- of the high bound.
4245 procedure Check_Universal_Expression
(N
: Node_Id
);
4246 -- In Ada 83, reject bounds of a universal range that are not literals
4249 -----------------------
4250 -- Check_Common_Type --
4251 -----------------------
4253 procedure Check_Common_Type
(T1
, T2
: Entity_Id
) is
4255 if Covers
(T1
=> T1
, T2
=> T2
)
4257 Covers
(T1
=> T2
, T2
=> T1
)
4259 if T1
= Universal_Integer
4260 or else T1
= Universal_Real
4261 or else T1
= Any_Character
4263 Add_One_Interp
(N
, Base_Type
(T2
), Base_Type
(T2
));
4266 Add_One_Interp
(N
, T1
, T1
);
4269 Add_One_Interp
(N
, Base_Type
(T1
), Base_Type
(T1
));
4272 end Check_Common_Type
;
4274 ----------------------
4275 -- Check_High_Bound --
4276 ----------------------
4278 procedure Check_High_Bound
(T
: Entity_Id
) is
4280 if not Is_Overloaded
(H
) then
4281 Check_Common_Type
(T
, Etype
(H
));
4283 Get_First_Interp
(H
, I2
, It2
);
4284 while Present
(It2
.Typ
) loop
4285 Check_Common_Type
(T
, It2
.Typ
);
4286 Get_Next_Interp
(I2
, It2
);
4289 end Check_High_Bound
;
4291 -----------------------------
4292 -- Is_Universal_Expression --
4293 -----------------------------
4295 procedure Check_Universal_Expression
(N
: Node_Id
) is
4297 if Etype
(N
) = Universal_Integer
4298 and then Nkind
(N
) /= N_Integer_Literal
4299 and then not Is_Entity_Name
(N
)
4300 and then Nkind
(N
) /= N_Attribute_Reference
4302 Error_Msg_N
("illegal bound in discrete range", N
);
4304 end Check_Universal_Expression
;
4306 -- Start of processing for Analyze_Range
4309 Set_Etype
(N
, Any_Type
);
4310 Analyze_Expression
(L
);
4311 Analyze_Expression
(H
);
4313 if Etype
(L
) = Any_Type
or else Etype
(H
) = Any_Type
then
4317 if not Is_Overloaded
(L
) then
4318 Check_High_Bound
(Etype
(L
));
4320 Get_First_Interp
(L
, I1
, It1
);
4321 while Present
(It1
.Typ
) loop
4322 Check_High_Bound
(It1
.Typ
);
4323 Get_Next_Interp
(I1
, It1
);
4327 -- If result is Any_Type, then we did not find a compatible pair
4329 if Etype
(N
) = Any_Type
then
4330 Error_Msg_N
("incompatible types in range ", N
);
4334 if Ada_Version
= Ada_83
4336 (Nkind
(Parent
(N
)) = N_Loop_Parameter_Specification
4337 or else Nkind
(Parent
(N
)) = N_Constrained_Array_Definition
)
4339 Check_Universal_Expression
(L
);
4340 Check_Universal_Expression
(H
);
4343 Check_Function_Writable_Actuals
(N
);
4346 -----------------------
4347 -- Analyze_Reference --
4348 -----------------------
4350 procedure Analyze_Reference
(N
: Node_Id
) is
4351 P
: constant Node_Id
:= Prefix
(N
);
4354 Acc_Type
: Entity_Id
;
4359 -- An interesting error check, if we take the 'Ref of an object for
4360 -- which a pragma Atomic or Volatile has been given, and the type of the
4361 -- object is not Atomic or Volatile, then we are in trouble. The problem
4362 -- is that no trace of the atomic/volatile status will remain for the
4363 -- backend to respect when it deals with the resulting pointer, since
4364 -- the pointer type will not be marked atomic (it is a pointer to the
4365 -- base type of the object).
4367 -- It is not clear if that can ever occur, but in case it does, we will
4368 -- generate an error message. Not clear if this message can ever be
4369 -- generated, and pretty clear that it represents a bug if it is, still
4370 -- seems worth checking, except in CodePeer mode where we do not really
4371 -- care and don't want to bother the user.
4375 if Is_Entity_Name
(P
)
4376 and then Is_Object_Reference
(P
)
4377 and then not CodePeer_Mode
4382 if (Has_Atomic_Components
(E
)
4383 and then not Has_Atomic_Components
(T
))
4385 (Has_Volatile_Components
(E
)
4386 and then not Has_Volatile_Components
(T
))
4387 or else (Is_Atomic
(E
) and then not Is_Atomic
(T
))
4388 or else (Is_Volatile
(E
) and then not Is_Volatile
(T
))
4390 Error_Msg_N
("cannot take reference to Atomic/Volatile object", N
);
4394 -- Carry on with normal processing
4396 Acc_Type
:= Create_Itype
(E_Allocator_Type
, N
);
4397 Set_Etype
(Acc_Type
, Acc_Type
);
4398 Set_Directly_Designated_Type
(Acc_Type
, Etype
(P
));
4399 Set_Etype
(N
, Acc_Type
);
4400 end Analyze_Reference
;
4402 --------------------------------
4403 -- Analyze_Selected_Component --
4404 --------------------------------
4406 -- Prefix is a record type or a task or protected type. In the latter case,
4407 -- the selector must denote a visible entry.
4409 procedure Analyze_Selected_Component
(N
: Node_Id
) is
4410 Name
: constant Node_Id
:= Prefix
(N
);
4411 Sel
: constant Node_Id
:= Selector_Name
(N
);
4414 Has_Candidate
: Boolean := False;
4415 Hidden_Comp
: Entity_Id
;
4417 Is_Private_Op
: Boolean;
4419 Pent
: Entity_Id
:= Empty
;
4420 Prefix_Type
: Entity_Id
;
4422 Type_To_Use
: Entity_Id
;
4423 -- In most cases this is the Prefix_Type, but if the Prefix_Type is
4424 -- a class-wide type, we use its root type, whose components are
4425 -- present in the class-wide type.
4427 Is_Single_Concurrent_Object
: Boolean;
4428 -- Set True if the prefix is a single task or a single protected object
4430 procedure Find_Component_In_Instance
(Rec
: Entity_Id
);
4431 -- In an instance, a component of a private extension may not be visible
4432 -- while it was visible in the generic. Search candidate scope for a
4433 -- component with the proper identifier. This is only done if all other
4434 -- searches have failed. If a match is found, the Etype of both N and
4435 -- Sel are set from this component, and the entity of Sel is set to
4436 -- reference this component. If no match is found, Entity (Sel) remains
4437 -- unset. For a derived type that is an actual of the instance, the
4438 -- desired component may be found in any ancestor.
4440 function Has_Mode_Conformant_Spec
(Comp
: Entity_Id
) return Boolean;
4441 -- It is known that the parent of N denotes a subprogram call. Comp
4442 -- is an overloadable component of the concurrent type of the prefix.
4443 -- Determine whether all formals of the parent of N and Comp are mode
4444 -- conformant. If the parent node is not analyzed yet it may be an
4445 -- indexed component rather than a function call.
4447 function Has_Dereference
(Nod
: Node_Id
) return Boolean;
4448 -- Check whether prefix includes a dereference at any level.
4450 --------------------------------
4451 -- Find_Component_In_Instance --
4452 --------------------------------
4454 procedure Find_Component_In_Instance
(Rec
: Entity_Id
) is
4460 while Present
(Typ
) loop
4461 Comp
:= First_Component
(Typ
);
4462 while Present
(Comp
) loop
4463 if Chars
(Comp
) = Chars
(Sel
) then
4464 Set_Entity_With_Checks
(Sel
, Comp
);
4465 Set_Etype
(Sel
, Etype
(Comp
));
4466 Set_Etype
(N
, Etype
(Comp
));
4470 Next_Component
(Comp
);
4473 -- If not found, the component may be declared in the parent
4474 -- type or its full view, if any.
4476 if Is_Derived_Type
(Typ
) then
4479 if Is_Private_Type
(Typ
) then
4480 Typ
:= Full_View
(Typ
);
4488 -- If we fall through, no match, so no changes made
4491 end Find_Component_In_Instance
;
4493 ------------------------------
4494 -- Has_Mode_Conformant_Spec --
4495 ------------------------------
4497 function Has_Mode_Conformant_Spec
(Comp
: Entity_Id
) return Boolean is
4498 Comp_Param
: Entity_Id
;
4500 Param_Typ
: Entity_Id
;
4503 Comp_Param
:= First_Formal
(Comp
);
4505 if Nkind
(Parent
(N
)) = N_Indexed_Component
then
4506 Param
:= First
(Expressions
(Parent
(N
)));
4508 Param
:= First
(Parameter_Associations
(Parent
(N
)));
4511 while Present
(Comp_Param
)
4512 and then Present
(Param
)
4514 Param_Typ
:= Find_Parameter_Type
(Param
);
4516 if Present
(Param_Typ
)
4518 not Conforming_Types
4519 (Etype
(Comp_Param
), Param_Typ
, Mode_Conformant
)
4524 Next_Formal
(Comp_Param
);
4528 -- One of the specs has additional formals; there is no match, unless
4529 -- this may be an indexing of a parameterless call.
4531 -- Note that when expansion is disabled, the corresponding record
4532 -- type of synchronized types is not constructed, so that there is
4533 -- no point is attempting an interpretation as a prefixed call, as
4534 -- this is bound to fail because the primitive operations will not
4535 -- be properly located.
4537 if Present
(Comp_Param
) or else Present
(Param
) then
4538 if Needs_No_Actuals
(Comp
)
4539 and then Is_Array_Type
(Etype
(Comp
))
4540 and then not Expander_Active
4549 end Has_Mode_Conformant_Spec
;
4551 ---------------------
4552 -- Has_Dereference --
4553 ---------------------
4555 function Has_Dereference
(Nod
: Node_Id
) return Boolean is
4557 if Nkind
(Nod
) = N_Explicit_Dereference
then
4560 -- When expansion is disabled an explicit dereference may not have
4561 -- been inserted, but if this is an access type the indirection makes
4564 elsif Is_Access_Type
(Etype
(Nod
)) then
4567 elsif Nkind_In
(Nod
, N_Indexed_Component
, N_Selected_Component
) then
4568 return Has_Dereference
(Prefix
(Nod
));
4573 end Has_Dereference
;
4575 -- Start of processing for Analyze_Selected_Component
4578 Set_Etype
(N
, Any_Type
);
4580 if Is_Overloaded
(Name
) then
4581 Analyze_Overloaded_Selected_Component
(N
);
4584 elsif Etype
(Name
) = Any_Type
then
4585 Set_Entity
(Sel
, Any_Id
);
4586 Set_Etype
(Sel
, Any_Type
);
4590 Prefix_Type
:= Etype
(Name
);
4593 if Is_Access_Type
(Prefix_Type
) then
4595 -- A RACW object can never be used as prefix of a selected component
4596 -- since that means it is dereferenced without being a controlling
4597 -- operand of a dispatching operation (RM E.2.2(16/1)). Before
4598 -- reporting an error, we must check whether this is actually a
4599 -- dispatching call in prefix form.
4601 if Is_Remote_Access_To_Class_Wide_Type
(Prefix_Type
)
4602 and then Comes_From_Source
(N
)
4604 if Try_Object_Operation
(N
) then
4608 ("invalid dereference of a remote access-to-class-wide value",
4612 -- Normal case of selected component applied to access type
4615 Error_Msg_NW
(Warn_On_Dereference
, "?d?implicit dereference", N
);
4617 if Is_Entity_Name
(Name
) then
4618 Pent
:= Entity
(Name
);
4619 elsif Nkind
(Name
) = N_Selected_Component
4620 and then Is_Entity_Name
(Selector_Name
(Name
))
4622 Pent
:= Entity
(Selector_Name
(Name
));
4625 Prefix_Type
:= Process_Implicit_Dereference_Prefix
(Pent
, Name
);
4628 -- If we have an explicit dereference of a remote access-to-class-wide
4629 -- value, then issue an error (see RM-E.2.2(16/1)). However we first
4630 -- have to check for the case of a prefix that is a controlling operand
4631 -- of a prefixed dispatching call, as the dereference is legal in that
4632 -- case. Normally this condition is checked in Validate_Remote_Access_
4633 -- To_Class_Wide_Type, but we have to defer the checking for selected
4634 -- component prefixes because of the prefixed dispatching call case.
4635 -- Note that implicit dereferences are checked for this just above.
4637 elsif Nkind
(Name
) = N_Explicit_Dereference
4638 and then Is_Remote_Access_To_Class_Wide_Type
(Etype
(Prefix
(Name
)))
4639 and then Comes_From_Source
(N
)
4641 if Try_Object_Operation
(N
) then
4645 ("invalid dereference of a remote access-to-class-wide value",
4650 -- (Ada 2005): if the prefix is the limited view of a type, and
4651 -- the context already includes the full view, use the full view
4652 -- in what follows, either to retrieve a component of to find
4653 -- a primitive operation. If the prefix is an explicit dereference,
4654 -- set the type of the prefix to reflect this transformation.
4655 -- If the nonlimited view is itself an incomplete type, get the
4656 -- full view if available.
4658 if From_Limited_With
(Prefix_Type
)
4659 and then Has_Non_Limited_View
(Prefix_Type
)
4661 Prefix_Type
:= Get_Full_View
(Non_Limited_View
(Prefix_Type
));
4663 if Nkind
(N
) = N_Explicit_Dereference
then
4664 Set_Etype
(Prefix
(N
), Prefix_Type
);
4668 if Ekind
(Prefix_Type
) = E_Private_Subtype
then
4669 Prefix_Type
:= Base_Type
(Prefix_Type
);
4672 Type_To_Use
:= Prefix_Type
;
4674 -- For class-wide types, use the entity list of the root type. This
4675 -- indirection is specially important for private extensions because
4676 -- only the root type get switched (not the class-wide type).
4678 if Is_Class_Wide_Type
(Prefix_Type
) then
4679 Type_To_Use
:= Root_Type
(Prefix_Type
);
4682 -- If the prefix is a single concurrent object, use its name in error
4683 -- messages, rather than that of its anonymous type.
4685 Is_Single_Concurrent_Object
:=
4686 Is_Concurrent_Type
(Prefix_Type
)
4687 and then Is_Internal_Name
(Chars
(Prefix_Type
))
4688 and then not Is_Derived_Type
(Prefix_Type
)
4689 and then Is_Entity_Name
(Name
);
4691 Comp
:= First_Entity
(Type_To_Use
);
4693 -- If the selector has an original discriminant, the node appears in
4694 -- an instance. Replace the discriminant with the corresponding one
4695 -- in the current discriminated type. For nested generics, this must
4696 -- be done transitively, so note the new original discriminant.
4698 if Nkind
(Sel
) = N_Identifier
4699 and then In_Instance
4700 and then Present
(Original_Discriminant
(Sel
))
4702 Comp
:= Find_Corresponding_Discriminant
(Sel
, Prefix_Type
);
4704 -- Mark entity before rewriting, for completeness and because
4705 -- subsequent semantic checks might examine the original node.
4707 Set_Entity
(Sel
, Comp
);
4708 Rewrite
(Selector_Name
(N
), New_Occurrence_Of
(Comp
, Sloc
(N
)));
4709 Set_Original_Discriminant
(Selector_Name
(N
), Comp
);
4710 Set_Etype
(N
, Etype
(Comp
));
4711 Check_Implicit_Dereference
(N
, Etype
(Comp
));
4713 if Is_Access_Type
(Etype
(Name
)) then
4714 Insert_Explicit_Dereference
(Name
);
4715 Error_Msg_NW
(Warn_On_Dereference
, "?d?implicit dereference", N
);
4718 elsif Is_Record_Type
(Prefix_Type
) then
4720 -- Find component with given name. In an instance, if the node is
4721 -- known as a prefixed call, do not examine components whose
4722 -- visibility may be accidental.
4724 while Present
(Comp
) and then not Is_Prefixed_Call
(N
) loop
4725 if Chars
(Comp
) = Chars
(Sel
)
4726 and then Is_Visible_Component
(Comp
, N
)
4728 Set_Entity_With_Checks
(Sel
, Comp
);
4729 Set_Etype
(Sel
, Etype
(Comp
));
4731 if Ekind
(Comp
) = E_Discriminant
then
4732 if Is_Unchecked_Union
(Base_Type
(Prefix_Type
)) then
4734 ("cannot reference discriminant of unchecked union",
4738 if Is_Generic_Type
(Prefix_Type
)
4740 Is_Generic_Type
(Root_Type
(Prefix_Type
))
4742 Set_Original_Discriminant
(Sel
, Comp
);
4746 -- Resolve the prefix early otherwise it is not possible to
4747 -- build the actual subtype of the component: it may need
4748 -- to duplicate this prefix and duplication is only allowed
4749 -- on fully resolved expressions.
4753 -- Ada 2005 (AI-50217): Check wrong use of incomplete types or
4754 -- subtypes in a package specification.
4757 -- limited with Pkg;
4759 -- type Acc_Inc is access Pkg.T;
4761 -- N : Natural := X.all.Comp; -- ERROR, limited view
4762 -- end Pkg; -- Comp is not visible
4764 if Nkind
(Name
) = N_Explicit_Dereference
4765 and then From_Limited_With
(Etype
(Prefix
(Name
)))
4766 and then not Is_Potentially_Use_Visible
(Etype
(Name
))
4767 and then Nkind
(Parent
(Cunit_Entity
(Current_Sem_Unit
))) =
4768 N_Package_Specification
4771 ("premature usage of incomplete}", Prefix
(Name
),
4772 Etype
(Prefix
(Name
)));
4775 -- We never need an actual subtype for the case of a selection
4776 -- for a indexed component of a non-packed array, since in
4777 -- this case gigi generates all the checks and can find the
4778 -- necessary bounds information.
4780 -- We also do not need an actual subtype for the case of a
4781 -- first, last, length, or range attribute applied to a
4782 -- non-packed array, since gigi can again get the bounds in
4783 -- these cases (gigi cannot handle the packed case, since it
4784 -- has the bounds of the packed array type, not the original
4785 -- bounds of the type). However, if the prefix is itself a
4786 -- selected component, as in a.b.c (i), gigi may regard a.b.c
4787 -- as a dynamic-sized temporary, so we do generate an actual
4788 -- subtype for this case.
4790 Parent_N
:= Parent
(N
);
4792 if not Is_Packed
(Etype
(Comp
))
4794 ((Nkind
(Parent_N
) = N_Indexed_Component
4795 and then Nkind
(Name
) /= N_Selected_Component
)
4797 (Nkind
(Parent_N
) = N_Attribute_Reference
4799 Nam_In
(Attribute_Name
(Parent_N
), Name_First
,
4804 Set_Etype
(N
, Etype
(Comp
));
4806 -- If full analysis is not enabled, we do not generate an
4807 -- actual subtype, because in the absence of expansion
4808 -- reference to a formal of a protected type, for example,
4809 -- will not be properly transformed, and will lead to
4810 -- out-of-scope references in gigi.
4812 -- In all other cases, we currently build an actual subtype.
4813 -- It seems likely that many of these cases can be avoided,
4814 -- but right now, the front end makes direct references to the
4815 -- bounds (e.g. in generating a length check), and if we do
4816 -- not make an actual subtype, we end up getting a direct
4817 -- reference to a discriminant, which will not do.
4819 elsif Full_Analysis
then
4821 Build_Actual_Subtype_Of_Component
(Etype
(Comp
), N
);
4822 Insert_Action
(N
, Act_Decl
);
4824 if No
(Act_Decl
) then
4825 Set_Etype
(N
, Etype
(Comp
));
4828 -- Component type depends on discriminants. Enter the
4829 -- main attributes of the subtype.
4832 Subt
: constant Entity_Id
:=
4833 Defining_Identifier
(Act_Decl
);
4836 Set_Etype
(Subt
, Base_Type
(Etype
(Comp
)));
4837 Set_Ekind
(Subt
, Ekind
(Etype
(Comp
)));
4838 Set_Etype
(N
, Subt
);
4842 -- If Full_Analysis not enabled, just set the Etype
4845 Set_Etype
(N
, Etype
(Comp
));
4848 Check_Implicit_Dereference
(N
, Etype
(N
));
4852 -- If the prefix is a private extension, check only the visible
4853 -- components of the partial view. This must include the tag,
4854 -- which can appear in expanded code in a tag check.
4856 if Ekind
(Type_To_Use
) = E_Record_Type_With_Private
4857 and then Chars
(Selector_Name
(N
)) /= Name_uTag
4859 exit when Comp
= Last_Entity
(Type_To_Use
);
4865 -- Ada 2005 (AI-252): The selected component can be interpreted as
4866 -- a prefixed view of a subprogram. Depending on the context, this is
4867 -- either a name that can appear in a renaming declaration, or part
4868 -- of an enclosing call given in prefix form.
4870 -- Ada 2005 (AI05-0030): In the case of dispatching requeue, the
4871 -- selected component should resolve to a name.
4873 if Ada_Version
>= Ada_2005
4874 and then Is_Tagged_Type
(Prefix_Type
)
4875 and then not Is_Concurrent_Type
(Prefix_Type
)
4877 if Nkind
(Parent
(N
)) = N_Generic_Association
4878 or else Nkind
(Parent
(N
)) = N_Requeue_Statement
4879 or else Nkind
(Parent
(N
)) = N_Subprogram_Renaming_Declaration
4881 if Find_Primitive_Operation
(N
) then
4885 elsif Try_Object_Operation
(N
) then
4889 -- If the transformation fails, it will be necessary to redo the
4890 -- analysis with all errors enabled, to indicate candidate
4891 -- interpretations and reasons for each failure ???
4895 elsif Is_Private_Type
(Prefix_Type
) then
4897 -- Allow access only to discriminants of the type. If the type has
4898 -- no full view, gigi uses the parent type for the components, so we
4899 -- do the same here.
4901 if No
(Full_View
(Prefix_Type
)) then
4902 Type_To_Use
:= Root_Type
(Base_Type
(Prefix_Type
));
4903 Comp
:= First_Entity
(Type_To_Use
);
4906 while Present
(Comp
) loop
4907 if Chars
(Comp
) = Chars
(Sel
) then
4908 if Ekind
(Comp
) = E_Discriminant
then
4909 Set_Entity_With_Checks
(Sel
, Comp
);
4910 Generate_Reference
(Comp
, Sel
);
4912 Set_Etype
(Sel
, Etype
(Comp
));
4913 Set_Etype
(N
, Etype
(Comp
));
4914 Check_Implicit_Dereference
(N
, Etype
(N
));
4916 if Is_Generic_Type
(Prefix_Type
)
4917 or else Is_Generic_Type
(Root_Type
(Prefix_Type
))
4919 Set_Original_Discriminant
(Sel
, Comp
);
4922 -- Before declaring an error, check whether this is tagged
4923 -- private type and a call to a primitive operation.
4925 elsif Ada_Version
>= Ada_2005
4926 and then Is_Tagged_Type
(Prefix_Type
)
4927 and then Try_Object_Operation
(N
)
4932 Error_Msg_Node_2
:= First_Subtype
(Prefix_Type
);
4933 Error_Msg_NE
("invisible selector& for }", N
, Sel
);
4934 Set_Entity
(Sel
, Any_Id
);
4935 Set_Etype
(N
, Any_Type
);
4944 elsif Is_Concurrent_Type
(Prefix_Type
) then
4946 -- Find visible operation with given name. For a protected type,
4947 -- the possible candidates are discriminants, entries or protected
4948 -- subprograms. For a task type, the set can only include entries or
4949 -- discriminants if the task type is not an enclosing scope. If it
4950 -- is an enclosing scope (e.g. in an inner task) then all entities
4951 -- are visible, but the prefix must denote the enclosing scope, i.e.
4952 -- can only be a direct name or an expanded name.
4954 Set_Etype
(Sel
, Any_Type
);
4955 Hidden_Comp
:= Empty
;
4956 In_Scope
:= In_Open_Scopes
(Prefix_Type
);
4957 Is_Private_Op
:= False;
4959 while Present
(Comp
) loop
4961 -- Do not examine private operations of the type if not within
4964 if Chars
(Comp
) = Chars
(Sel
) then
4965 if Is_Overloadable
(Comp
)
4967 or else Comp
/= First_Private_Entity
(Type_To_Use
))
4969 Add_One_Interp
(Sel
, Comp
, Etype
(Comp
));
4970 if Comp
= First_Private_Entity
(Type_To_Use
) then
4971 Is_Private_Op
:= True;
4974 -- If the prefix is tagged, the correct interpretation may
4975 -- lie in the primitive or class-wide operations of the
4976 -- type. Perform a simple conformance check to determine
4977 -- whether Try_Object_Operation should be invoked even if
4978 -- a visible entity is found.
4980 if Is_Tagged_Type
(Prefix_Type
)
4981 and then Nkind_In
(Parent
(N
), N_Function_Call
,
4982 N_Indexed_Component
,
4983 N_Procedure_Call_Statement
)
4984 and then Has_Mode_Conformant_Spec
(Comp
)
4986 Has_Candidate
:= True;
4989 -- Note: a selected component may not denote a component of a
4990 -- protected type (4.1.3(7)).
4992 elsif Ekind_In
(Comp
, E_Discriminant
, E_Entry_Family
)
4994 and then not Is_Protected_Type
(Prefix_Type
)
4995 and then Is_Entity_Name
(Name
))
4997 Set_Entity_With_Checks
(Sel
, Comp
);
4998 Generate_Reference
(Comp
, Sel
);
5000 -- The selector is not overloadable, so we have a candidate
5003 Has_Candidate
:= True;
5006 if Ekind
(Comp
) = E_Component
then
5007 Hidden_Comp
:= Comp
;
5013 Set_Etype
(Sel
, Etype
(Comp
));
5014 Set_Etype
(N
, Etype
(Comp
));
5016 if Ekind
(Comp
) = E_Discriminant
then
5017 Set_Original_Discriminant
(Sel
, Comp
);
5020 -- For access type case, introduce explicit dereference for
5021 -- more uniform treatment of entry calls.
5023 if Is_Access_Type
(Etype
(Name
)) then
5024 Insert_Explicit_Dereference
(Name
);
5026 (Warn_On_Dereference
, "?d?implicit dereference", N
);
5031 if Comp
= First_Private_Entity
(Type_To_Use
) then
5032 if Etype
(Sel
) /= Any_Type
then
5034 -- We have a candiate
5039 -- Indicate that subsequent operations are private,
5040 -- for better error reporting.
5042 Is_Private_Op
:= True;
5046 -- Do not examine private operations if not within scope of
5047 -- the synchronized type.
5049 exit when not In_Scope
5051 Comp
= First_Private_Entity
(Base_Type
(Prefix_Type
));
5055 -- If the scope is a current instance, the prefix cannot be an
5056 -- expression of the same type, unless the selector designates a
5057 -- public operation (otherwise that would represent an attempt to
5058 -- reach an internal entity of another synchronized object).
5060 -- This is legal if prefix is an access to such type and there is
5061 -- a dereference, or is a component with a dereferenced prefix.
5062 -- It is also legal if the prefix is a component of a task type,
5063 -- and the selector is one of the task operations.
5066 and then not Is_Entity_Name
(Name
)
5067 and then not Has_Dereference
(Name
)
5069 if Is_Task_Type
(Prefix_Type
)
5070 and then Present
(Entity
(Sel
))
5071 and then Ekind_In
(Entity
(Sel
), E_Entry
, E_Entry_Family
)
5075 elsif Is_Protected_Type
(Prefix_Type
)
5076 and then Is_Overloadable
(Entity
(Sel
))
5077 and then not Is_Private_Op
5083 ("invalid reference to internal operation of some object of "
5084 & "type &", N
, Type_To_Use
);
5085 Set_Entity
(Sel
, Any_Id
);
5086 Set_Etype
(Sel
, Any_Type
);
5090 -- Another special case: the prefix may denote an object of the type
5091 -- (but not a type) in which case this is an external call and the
5092 -- operation must be public.
5095 and then Is_Object_Reference
(Original_Node
(Prefix
(N
)))
5096 and then Comes_From_Source
(N
)
5097 and then Is_Private_Op
5099 if Present
(Hidden_Comp
) then
5101 ("invalid reference to private component of object of type "
5102 & "&", N
, Type_To_Use
);
5106 ("invalid reference to private operation of some object of "
5107 & "type &", N
, Type_To_Use
);
5110 Set_Entity
(Sel
, Any_Id
);
5111 Set_Etype
(Sel
, Any_Type
);
5115 -- If there is no visible entity with the given name or none of the
5116 -- visible entities are plausible interpretations, check whether
5117 -- there is some other primitive operation with that name.
5119 if Ada_Version
>= Ada_2005
and then Is_Tagged_Type
(Prefix_Type
) then
5120 if (Etype
(N
) = Any_Type
5121 or else not Has_Candidate
)
5122 and then Try_Object_Operation
(N
)
5126 -- If the context is not syntactically a procedure call, it
5127 -- may be a call to a primitive function declared outside of
5128 -- the synchronized type.
5130 -- If the context is a procedure call, there might still be
5131 -- an overloading between an entry and a primitive procedure
5132 -- declared outside of the synchronized type, called in prefix
5133 -- notation. This is harder to disambiguate because in one case
5134 -- the controlling formal is implicit ???
5136 elsif Nkind
(Parent
(N
)) /= N_Procedure_Call_Statement
5137 and then Nkind
(Parent
(N
)) /= N_Indexed_Component
5138 and then Try_Object_Operation
(N
)
5143 -- Ada 2012 (AI05-0090-1): If we found a candidate of a call to an
5144 -- entry or procedure of a tagged concurrent type we must check
5145 -- if there are class-wide subprograms covering the primitive. If
5146 -- true then Try_Object_Operation reports the error.
5149 and then Is_Concurrent_Type
(Prefix_Type
)
5150 and then Nkind
(Parent
(N
)) = N_Procedure_Call_Statement
5152 -- Duplicate the call. This is required to avoid problems with
5153 -- the tree transformations performed by Try_Object_Operation.
5154 -- Set properly the parent of the copied call, because it is
5155 -- about to be reanalyzed.
5158 Par
: constant Node_Id
:= New_Copy_Tree
(Parent
(N
));
5161 Set_Parent
(Par
, Parent
(Parent
(N
)));
5163 if Try_Object_Operation
5164 (Sinfo
.Name
(Par
), CW_Test_Only
=> True)
5172 if Etype
(N
) = Any_Type
and then Is_Protected_Type
(Prefix_Type
) then
5174 -- Case of a prefix of a protected type: selector might denote
5175 -- an invisible private component.
5177 Comp
:= First_Private_Entity
(Base_Type
(Prefix_Type
));
5178 while Present
(Comp
) and then Chars
(Comp
) /= Chars
(Sel
) loop
5182 if Present
(Comp
) then
5183 if Is_Single_Concurrent_Object
then
5184 Error_Msg_Node_2
:= Entity
(Name
);
5185 Error_Msg_NE
("invisible selector& for &", N
, Sel
);
5188 Error_Msg_Node_2
:= First_Subtype
(Prefix_Type
);
5189 Error_Msg_NE
("invisible selector& for }", N
, Sel
);
5195 Set_Is_Overloaded
(N
, Is_Overloaded
(Sel
));
5200 Error_Msg_NE
("invalid prefix in selected component&", N
, Sel
);
5203 -- If N still has no type, the component is not defined in the prefix
5205 if Etype
(N
) = Any_Type
then
5207 if Is_Single_Concurrent_Object
then
5208 Error_Msg_Node_2
:= Entity
(Name
);
5209 Error_Msg_NE
("no selector& for&", N
, Sel
);
5211 Check_Misspelled_Selector
(Type_To_Use
, Sel
);
5213 -- If this is a derived formal type, the parent may have different
5214 -- visibility at this point. Try for an inherited component before
5215 -- reporting an error.
5217 elsif Is_Generic_Type
(Prefix_Type
)
5218 and then Ekind
(Prefix_Type
) = E_Record_Type_With_Private
5219 and then Prefix_Type
/= Etype
(Prefix_Type
)
5220 and then Is_Record_Type
(Etype
(Prefix_Type
))
5222 Set_Etype
(Prefix
(N
), Etype
(Prefix_Type
));
5223 Analyze_Selected_Component
(N
);
5226 -- Similarly, if this is the actual for a formal derived type, or
5227 -- a derived type thereof, the component inherited from the generic
5228 -- parent may not be visible in the actual, but the selected
5229 -- component is legal. Climb up the derivation chain of the generic
5230 -- parent type until we find the proper ancestor type.
5232 elsif In_Instance
and then Is_Tagged_Type
(Prefix_Type
) then
5234 Par
: Entity_Id
:= Prefix_Type
;
5236 -- Climb up derivation chain to generic actual subtype
5238 while not Is_Generic_Actual_Type
(Par
) loop
5239 if Ekind
(Par
) = E_Record_Type
then
5240 Par
:= Parent_Subtype
(Par
);
5243 exit when Par
= Etype
(Par
);
5248 if Present
(Par
) and then Is_Generic_Actual_Type
(Par
) then
5250 -- Now look for component in ancestor types
5252 Par
:= Generic_Parent_Type
(Declaration_Node
(Par
));
5254 Find_Component_In_Instance
(Par
);
5255 exit when Present
(Entity
(Sel
))
5256 or else Par
= Etype
(Par
);
5260 -- Another special case: the type is an extension of a private
5261 -- type T, is an actual in an instance, and we are in the body
5262 -- of the instance, so the generic body had a full view of the
5263 -- type declaration for T or of some ancestor that defines the
5264 -- component in question.
5266 elsif Is_Derived_Type
(Type_To_Use
)
5267 and then Used_As_Generic_Actual
(Type_To_Use
)
5268 and then In_Instance_Body
5270 Find_Component_In_Instance
(Parent_Subtype
(Type_To_Use
));
5272 -- In ASIS mode the generic parent type may be absent. Examine
5273 -- the parent type directly for a component that may have been
5274 -- visible in a parent generic unit.
5276 elsif Is_Derived_Type
(Prefix_Type
) then
5277 Par
:= Etype
(Prefix_Type
);
5278 Find_Component_In_Instance
(Par
);
5282 -- The search above must have eventually succeeded, since the
5283 -- selected component was legal in the generic.
5285 if No
(Entity
(Sel
)) then
5286 raise Program_Error
;
5291 -- Component not found, specialize error message when appropriate
5294 if Ekind
(Prefix_Type
) = E_Record_Subtype
then
5296 -- Check whether this is a component of the base type which
5297 -- is absent from a statically constrained subtype. This will
5298 -- raise constraint error at run time, but is not a compile-
5299 -- time error. When the selector is illegal for base type as
5300 -- well fall through and generate a compilation error anyway.
5302 Comp
:= First_Component
(Base_Type
(Prefix_Type
));
5303 while Present
(Comp
) loop
5304 if Chars
(Comp
) = Chars
(Sel
)
5305 and then Is_Visible_Component
(Comp
)
5307 Set_Entity_With_Checks
(Sel
, Comp
);
5308 Generate_Reference
(Comp
, Sel
);
5309 Set_Etype
(Sel
, Etype
(Comp
));
5310 Set_Etype
(N
, Etype
(Comp
));
5312 -- Emit appropriate message. The node will be replaced
5313 -- by an appropriate raise statement.
5315 -- Note that in SPARK mode, as with all calls to apply a
5316 -- compile time constraint error, this will be made into
5317 -- an error to simplify the processing of the formal
5318 -- verification backend.
5320 Apply_Compile_Time_Constraint_Error
5321 (N
, "component not present in }??",
5322 CE_Discriminant_Check_Failed
,
5323 Ent
=> Prefix_Type
, Rep
=> False);
5325 Set_Raises_Constraint_Error
(N
);
5329 Next_Component
(Comp
);
5334 Error_Msg_Node_2
:= First_Subtype
(Prefix_Type
);
5335 Error_Msg_NE
("no selector& for}", N
, Sel
);
5337 -- Add information in the case of an incomplete prefix
5339 if Is_Incomplete_Type
(Type_To_Use
) then
5341 Inc
: constant Entity_Id
:= First_Subtype
(Type_To_Use
);
5344 if From_Limited_With
(Scope
(Type_To_Use
)) then
5346 ("\limited view of& has no components", N
, Inc
);
5350 ("\premature usage of incomplete type&", N
, Inc
);
5352 if Nkind
(Parent
(Inc
)) =
5353 N_Incomplete_Type_Declaration
5355 -- Record location of premature use in entity so that
5356 -- a continuation message is generated when the
5357 -- completion is seen.
5359 Set_Premature_Use
(Parent
(Inc
), N
);
5365 Check_Misspelled_Selector
(Type_To_Use
, Sel
);
5368 Set_Entity
(Sel
, Any_Id
);
5369 Set_Etype
(Sel
, Any_Type
);
5371 end Analyze_Selected_Component
;
5373 ---------------------------
5374 -- Analyze_Short_Circuit --
5375 ---------------------------
5377 procedure Analyze_Short_Circuit
(N
: Node_Id
) is
5378 L
: constant Node_Id
:= Left_Opnd
(N
);
5379 R
: constant Node_Id
:= Right_Opnd
(N
);
5384 Analyze_Expression
(L
);
5385 Analyze_Expression
(R
);
5386 Set_Etype
(N
, Any_Type
);
5388 if not Is_Overloaded
(L
) then
5389 if Root_Type
(Etype
(L
)) = Standard_Boolean
5390 and then Has_Compatible_Type
(R
, Etype
(L
))
5392 Add_One_Interp
(N
, Etype
(L
), Etype
(L
));
5396 Get_First_Interp
(L
, Ind
, It
);
5397 while Present
(It
.Typ
) loop
5398 if Root_Type
(It
.Typ
) = Standard_Boolean
5399 and then Has_Compatible_Type
(R
, It
.Typ
)
5401 Add_One_Interp
(N
, It
.Typ
, It
.Typ
);
5404 Get_Next_Interp
(Ind
, It
);
5408 -- Here we have failed to find an interpretation. Clearly we know that
5409 -- it is not the case that both operands can have an interpretation of
5410 -- Boolean, but this is by far the most likely intended interpretation.
5411 -- So we simply resolve both operands as Booleans, and at least one of
5412 -- these resolutions will generate an error message, and we do not need
5413 -- to give another error message on the short circuit operation itself.
5415 if Etype
(N
) = Any_Type
then
5416 Resolve
(L
, Standard_Boolean
);
5417 Resolve
(R
, Standard_Boolean
);
5418 Set_Etype
(N
, Standard_Boolean
);
5420 end Analyze_Short_Circuit
;
5426 procedure Analyze_Slice
(N
: Node_Id
) is
5427 D
: constant Node_Id
:= Discrete_Range
(N
);
5428 P
: constant Node_Id
:= Prefix
(N
);
5429 Array_Type
: Entity_Id
;
5430 Index_Type
: Entity_Id
;
5432 procedure Analyze_Overloaded_Slice
;
5433 -- If the prefix is overloaded, select those interpretations that
5434 -- yield a one-dimensional array type.
5436 ------------------------------
5437 -- Analyze_Overloaded_Slice --
5438 ------------------------------
5440 procedure Analyze_Overloaded_Slice
is
5446 Set_Etype
(N
, Any_Type
);
5448 Get_First_Interp
(P
, I
, It
);
5449 while Present
(It
.Nam
) loop
5452 if Is_Access_Type
(Typ
) then
5453 Typ
:= Designated_Type
(Typ
);
5455 (Warn_On_Dereference
, "?d?implicit dereference", N
);
5458 if Is_Array_Type
(Typ
)
5459 and then Number_Dimensions
(Typ
) = 1
5460 and then Has_Compatible_Type
(D
, Etype
(First_Index
(Typ
)))
5462 Add_One_Interp
(N
, Typ
, Typ
);
5465 Get_Next_Interp
(I
, It
);
5468 if Etype
(N
) = Any_Type
then
5469 Error_Msg_N
("expect array type in prefix of slice", N
);
5471 end Analyze_Overloaded_Slice
;
5473 -- Start of processing for Analyze_Slice
5476 if Comes_From_Source
(N
) then
5477 Check_SPARK_05_Restriction
("slice is not allowed", N
);
5483 if Is_Overloaded
(P
) then
5484 Analyze_Overloaded_Slice
;
5487 Array_Type
:= Etype
(P
);
5488 Set_Etype
(N
, Any_Type
);
5490 if Is_Access_Type
(Array_Type
) then
5491 Array_Type
:= Designated_Type
(Array_Type
);
5492 Error_Msg_NW
(Warn_On_Dereference
, "?d?implicit dereference", N
);
5495 if not Is_Array_Type
(Array_Type
) then
5496 Wrong_Type
(P
, Any_Array
);
5498 elsif Number_Dimensions
(Array_Type
) > 1 then
5500 ("type is not one-dimensional array in slice prefix", N
);
5503 if Ekind
(Array_Type
) = E_String_Literal_Subtype
then
5504 Index_Type
:= Etype
(String_Literal_Low_Bound
(Array_Type
));
5506 Index_Type
:= Etype
(First_Index
(Array_Type
));
5509 if not Has_Compatible_Type
(D
, Index_Type
) then
5510 Wrong_Type
(D
, Index_Type
);
5512 Set_Etype
(N
, Array_Type
);
5518 -----------------------------
5519 -- Analyze_Type_Conversion --
5520 -----------------------------
5522 procedure Analyze_Type_Conversion
(N
: Node_Id
) is
5523 Expr
: constant Node_Id
:= Expression
(N
);
5527 -- If Conversion_OK is set, then the Etype is already set, and the only
5528 -- processing required is to analyze the expression. This is used to
5529 -- construct certain "illegal" conversions which are not allowed by Ada
5530 -- semantics, but can be handled by Gigi, see Sinfo for further details.
5532 if Conversion_OK
(N
) then
5537 -- Otherwise full type analysis is required, as well as some semantic
5538 -- checks to make sure the argument of the conversion is appropriate.
5540 Find_Type
(Subtype_Mark
(N
));
5541 Typ
:= Entity
(Subtype_Mark
(N
));
5543 Check_Fully_Declared
(Typ
, N
);
5544 Analyze_Expression
(Expr
);
5545 Validate_Remote_Type_Type_Conversion
(N
);
5547 -- Only remaining step is validity checks on the argument. These
5548 -- are skipped if the conversion does not come from the source.
5550 if not Comes_From_Source
(N
) then
5553 -- If there was an error in a generic unit, no need to replicate the
5554 -- error message. Conversely, constant-folding in the generic may
5555 -- transform the argument of a conversion into a string literal, which
5556 -- is legal. Therefore the following tests are not performed in an
5557 -- instance. The same applies to an inlined body.
5559 elsif In_Instance
or In_Inlined_Body
then
5562 elsif Nkind
(Expr
) = N_Null
then
5563 Error_Msg_N
("argument of conversion cannot be null", N
);
5564 Error_Msg_N
("\use qualified expression instead", N
);
5565 Set_Etype
(N
, Any_Type
);
5567 elsif Nkind
(Expr
) = N_Aggregate
then
5568 Error_Msg_N
("argument of conversion cannot be aggregate", N
);
5569 Error_Msg_N
("\use qualified expression instead", N
);
5571 elsif Nkind
(Expr
) = N_Allocator
then
5572 Error_Msg_N
("argument of conversion cannot be an allocator", N
);
5573 Error_Msg_N
("\use qualified expression instead", N
);
5575 elsif Nkind
(Expr
) = N_String_Literal
then
5576 Error_Msg_N
("argument of conversion cannot be string literal", N
);
5577 Error_Msg_N
("\use qualified expression instead", N
);
5579 elsif Nkind
(Expr
) = N_Character_Literal
then
5580 if Ada_Version
= Ada_83
then
5581 Resolve
(Expr
, Typ
);
5583 Error_Msg_N
("argument of conversion cannot be character literal",
5585 Error_Msg_N
("\use qualified expression instead", N
);
5588 elsif Nkind
(Expr
) = N_Attribute_Reference
5589 and then Nam_In
(Attribute_Name
(Expr
), Name_Access
,
5590 Name_Unchecked_Access
,
5591 Name_Unrestricted_Access
)
5593 Error_Msg_N
("argument of conversion cannot be access", N
);
5594 Error_Msg_N
("\use qualified expression instead", N
);
5597 -- A formal parameter of a specific tagged type whose related subprogram
5598 -- is subject to pragma Extensions_Visible with value "False" cannot
5599 -- appear in a class-wide conversion (SPARK RM 6.1.7(3)). Do not check
5600 -- internally generated expressions.
5602 if Is_Class_Wide_Type
(Typ
)
5603 and then Comes_From_Source
(Expr
)
5604 and then Is_EVF_Expression
(Expr
)
5607 ("formal parameter cannot be converted to class-wide type when "
5608 & "Extensions_Visible is False", Expr
);
5610 end Analyze_Type_Conversion
;
5612 ----------------------
5613 -- Analyze_Unary_Op --
5614 ----------------------
5616 procedure Analyze_Unary_Op
(N
: Node_Id
) is
5617 R
: constant Node_Id
:= Right_Opnd
(N
);
5618 Op_Id
: Entity_Id
:= Entity
(N
);
5621 Set_Etype
(N
, Any_Type
);
5622 Candidate_Type
:= Empty
;
5624 Analyze_Expression
(R
);
5626 if Present
(Op_Id
) then
5627 if Ekind
(Op_Id
) = E_Operator
then
5628 Find_Unary_Types
(R
, Op_Id
, N
);
5630 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
5634 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
5635 while Present
(Op_Id
) loop
5636 if Ekind
(Op_Id
) = E_Operator
then
5637 if No
(Next_Entity
(First_Entity
(Op_Id
))) then
5638 Find_Unary_Types
(R
, Op_Id
, N
);
5641 elsif Is_Overloadable
(Op_Id
) then
5642 Analyze_User_Defined_Unary_Op
(N
, Op_Id
);
5645 Op_Id
:= Homonym
(Op_Id
);
5650 end Analyze_Unary_Op
;
5652 ----------------------------------
5653 -- Analyze_Unchecked_Expression --
5654 ----------------------------------
5656 procedure Analyze_Unchecked_Expression
(N
: Node_Id
) is
5658 Analyze
(Expression
(N
), Suppress
=> All_Checks
);
5659 Set_Etype
(N
, Etype
(Expression
(N
)));
5660 Save_Interps
(Expression
(N
), N
);
5661 end Analyze_Unchecked_Expression
;
5663 ---------------------------------------
5664 -- Analyze_Unchecked_Type_Conversion --
5665 ---------------------------------------
5667 procedure Analyze_Unchecked_Type_Conversion
(N
: Node_Id
) is
5669 Find_Type
(Subtype_Mark
(N
));
5670 Analyze_Expression
(Expression
(N
));
5671 Set_Etype
(N
, Entity
(Subtype_Mark
(N
)));
5672 end Analyze_Unchecked_Type_Conversion
;
5674 ------------------------------------
5675 -- Analyze_User_Defined_Binary_Op --
5676 ------------------------------------
5678 procedure Analyze_User_Defined_Binary_Op
5683 -- Only do analysis if the operator Comes_From_Source, since otherwise
5684 -- the operator was generated by the expander, and all such operators
5685 -- always refer to the operators in package Standard.
5687 if Comes_From_Source
(N
) then
5689 F1
: constant Entity_Id
:= First_Formal
(Op_Id
);
5690 F2
: constant Entity_Id
:= Next_Formal
(F1
);
5693 -- Verify that Op_Id is a visible binary function. Note that since
5694 -- we know Op_Id is overloaded, potentially use visible means use
5695 -- visible for sure (RM 9.4(11)).
5697 if Ekind
(Op_Id
) = E_Function
5698 and then Present
(F2
)
5699 and then (Is_Immediately_Visible
(Op_Id
)
5700 or else Is_Potentially_Use_Visible
(Op_Id
))
5701 and then Has_Compatible_Type
(Left_Opnd
(N
), Etype
(F1
))
5702 and then Has_Compatible_Type
(Right_Opnd
(N
), Etype
(F2
))
5704 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
5706 -- If the left operand is overloaded, indicate that the current
5707 -- type is a viable candidate. This is redundant in most cases,
5708 -- but for equality and comparison operators where the context
5709 -- does not impose a type on the operands, setting the proper
5710 -- type is necessary to avoid subsequent ambiguities during
5711 -- resolution, when both user-defined and predefined operators
5712 -- may be candidates.
5714 if Is_Overloaded
(Left_Opnd
(N
)) then
5715 Set_Etype
(Left_Opnd
(N
), Etype
(F1
));
5718 if Debug_Flag_E
then
5719 Write_Str
("user defined operator ");
5720 Write_Name
(Chars
(Op_Id
));
5721 Write_Str
(" on node ");
5722 Write_Int
(Int
(N
));
5728 end Analyze_User_Defined_Binary_Op
;
5730 -----------------------------------
5731 -- Analyze_User_Defined_Unary_Op --
5732 -----------------------------------
5734 procedure Analyze_User_Defined_Unary_Op
5739 -- Only do analysis if the operator Comes_From_Source, since otherwise
5740 -- the operator was generated by the expander, and all such operators
5741 -- always refer to the operators in package Standard.
5743 if Comes_From_Source
(N
) then
5745 F
: constant Entity_Id
:= First_Formal
(Op_Id
);
5748 -- Verify that Op_Id is a visible unary function. Note that since
5749 -- we know Op_Id is overloaded, potentially use visible means use
5750 -- visible for sure (RM 9.4(11)).
5752 if Ekind
(Op_Id
) = E_Function
5753 and then No
(Next_Formal
(F
))
5754 and then (Is_Immediately_Visible
(Op_Id
)
5755 or else Is_Potentially_Use_Visible
(Op_Id
))
5756 and then Has_Compatible_Type
(Right_Opnd
(N
), Etype
(F
))
5758 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
5762 end Analyze_User_Defined_Unary_Op
;
5764 ---------------------------
5765 -- Check_Arithmetic_Pair --
5766 ---------------------------
5768 procedure Check_Arithmetic_Pair
5769 (T1
, T2
: Entity_Id
;
5773 Op_Name
: constant Name_Id
:= Chars
(Op_Id
);
5775 function Has_Fixed_Op
(Typ
: Entity_Id
; Op
: Entity_Id
) return Boolean;
5776 -- Check whether the fixed-point type Typ has a user-defined operator
5777 -- (multiplication or division) that should hide the corresponding
5778 -- predefined operator. Used to implement Ada 2005 AI-264, to make
5779 -- such operators more visible and therefore useful.
5781 -- If the name of the operation is an expanded name with prefix
5782 -- Standard, the predefined universal fixed operator is available,
5783 -- as specified by AI-420 (RM 4.5.5 (19.1/2)).
5785 function Specific_Type
(T1
, T2
: Entity_Id
) return Entity_Id
;
5786 -- Get specific type (i.e. non-universal type if there is one)
5792 function Has_Fixed_Op
(Typ
: Entity_Id
; Op
: Entity_Id
) return Boolean is
5793 Bas
: constant Entity_Id
:= Base_Type
(Typ
);
5799 -- If the universal_fixed operation is given explicitly the rule
5800 -- concerning primitive operations of the type do not apply.
5802 if Nkind
(N
) = N_Function_Call
5803 and then Nkind
(Name
(N
)) = N_Expanded_Name
5804 and then Entity
(Prefix
(Name
(N
))) = Standard_Standard
5809 -- The operation is treated as primitive if it is declared in the
5810 -- same scope as the type, and therefore on the same entity chain.
5812 Ent
:= Next_Entity
(Typ
);
5813 while Present
(Ent
) loop
5814 if Chars
(Ent
) = Chars
(Op
) then
5815 F1
:= First_Formal
(Ent
);
5816 F2
:= Next_Formal
(F1
);
5818 -- The operation counts as primitive if either operand or
5819 -- result are of the given base type, and both operands are
5820 -- fixed point types.
5822 if (Base_Type
(Etype
(F1
)) = Bas
5823 and then Is_Fixed_Point_Type
(Etype
(F2
)))
5826 (Base_Type
(Etype
(F2
)) = Bas
5827 and then Is_Fixed_Point_Type
(Etype
(F1
)))
5830 (Base_Type
(Etype
(Ent
)) = Bas
5831 and then Is_Fixed_Point_Type
(Etype
(F1
))
5832 and then Is_Fixed_Point_Type
(Etype
(F2
)))
5848 function Specific_Type
(T1
, T2
: Entity_Id
) return Entity_Id
is
5850 if T1
= Universal_Integer
or else T1
= Universal_Real
then
5851 return Base_Type
(T2
);
5853 return Base_Type
(T1
);
5857 -- Start of processing for Check_Arithmetic_Pair
5860 if Nam_In
(Op_Name
, Name_Op_Add
, Name_Op_Subtract
) then
5861 if Is_Numeric_Type
(T1
)
5862 and then Is_Numeric_Type
(T2
)
5863 and then (Covers
(T1
=> T1
, T2
=> T2
)
5865 Covers
(T1
=> T2
, T2
=> T1
))
5867 Add_One_Interp
(N
, Op_Id
, Specific_Type
(T1
, T2
));
5870 elsif Nam_In
(Op_Name
, Name_Op_Multiply
, Name_Op_Divide
) then
5871 if Is_Fixed_Point_Type
(T1
)
5872 and then (Is_Fixed_Point_Type
(T2
) or else T2
= Universal_Real
)
5874 -- If Treat_Fixed_As_Integer is set then the Etype is already set
5875 -- and no further processing is required (this is the case of an
5876 -- operator constructed by Exp_Fixd for a fixed point operation)
5877 -- Otherwise add one interpretation with universal fixed result
5878 -- If the operator is given in functional notation, it comes
5879 -- from source and Fixed_As_Integer cannot apply.
5881 if (Nkind
(N
) not in N_Op
5882 or else not Treat_Fixed_As_Integer
(N
))
5884 (not Has_Fixed_Op
(T1
, Op_Id
)
5885 or else Nkind
(Parent
(N
)) = N_Type_Conversion
)
5887 Add_One_Interp
(N
, Op_Id
, Universal_Fixed
);
5890 elsif Is_Fixed_Point_Type
(T2
)
5891 and then (Nkind
(N
) not in N_Op
5892 or else not Treat_Fixed_As_Integer
(N
))
5893 and then T1
= Universal_Real
5895 (not Has_Fixed_Op
(T1
, Op_Id
)
5896 or else Nkind
(Parent
(N
)) = N_Type_Conversion
)
5898 Add_One_Interp
(N
, Op_Id
, Universal_Fixed
);
5900 elsif Is_Numeric_Type
(T1
)
5901 and then Is_Numeric_Type
(T2
)
5902 and then (Covers
(T1
=> T1
, T2
=> T2
)
5904 Covers
(T1
=> T2
, T2
=> T1
))
5906 Add_One_Interp
(N
, Op_Id
, Specific_Type
(T1
, T2
));
5908 elsif Is_Fixed_Point_Type
(T1
)
5909 and then (Base_Type
(T2
) = Base_Type
(Standard_Integer
)
5910 or else T2
= Universal_Integer
)
5912 Add_One_Interp
(N
, Op_Id
, T1
);
5914 elsif T2
= Universal_Real
5915 and then Base_Type
(T1
) = Base_Type
(Standard_Integer
)
5916 and then Op_Name
= Name_Op_Multiply
5918 Add_One_Interp
(N
, Op_Id
, Any_Fixed
);
5920 elsif T1
= Universal_Real
5921 and then Base_Type
(T2
) = Base_Type
(Standard_Integer
)
5923 Add_One_Interp
(N
, Op_Id
, Any_Fixed
);
5925 elsif Is_Fixed_Point_Type
(T2
)
5926 and then (Base_Type
(T1
) = Base_Type
(Standard_Integer
)
5927 or else T1
= Universal_Integer
)
5928 and then Op_Name
= Name_Op_Multiply
5930 Add_One_Interp
(N
, Op_Id
, T2
);
5932 elsif T1
= Universal_Real
and then T2
= Universal_Integer
then
5933 Add_One_Interp
(N
, Op_Id
, T1
);
5935 elsif T2
= Universal_Real
5936 and then T1
= Universal_Integer
5937 and then Op_Name
= Name_Op_Multiply
5939 Add_One_Interp
(N
, Op_Id
, T2
);
5942 elsif Op_Name
= Name_Op_Mod
or else Op_Name
= Name_Op_Rem
then
5944 -- Note: The fixed-point operands case with Treat_Fixed_As_Integer
5945 -- set does not require any special processing, since the Etype is
5946 -- already set (case of operation constructed by Exp_Fixed).
5948 if Is_Integer_Type
(T1
)
5949 and then (Covers
(T1
=> T1
, T2
=> T2
)
5951 Covers
(T1
=> T2
, T2
=> T1
))
5953 Add_One_Interp
(N
, Op_Id
, Specific_Type
(T1
, T2
));
5956 elsif Op_Name
= Name_Op_Expon
then
5957 if Is_Numeric_Type
(T1
)
5958 and then not Is_Fixed_Point_Type
(T1
)
5959 and then (Base_Type
(T2
) = Base_Type
(Standard_Integer
)
5960 or else T2
= Universal_Integer
)
5962 Add_One_Interp
(N
, Op_Id
, Base_Type
(T1
));
5965 else pragma Assert
(Nkind
(N
) in N_Op_Shift
);
5967 -- If not one of the predefined operators, the node may be one
5968 -- of the intrinsic functions. Its kind is always specific, and
5969 -- we can use it directly, rather than the name of the operation.
5971 if Is_Integer_Type
(T1
)
5972 and then (Base_Type
(T2
) = Base_Type
(Standard_Integer
)
5973 or else T2
= Universal_Integer
)
5975 Add_One_Interp
(N
, Op_Id
, Base_Type
(T1
));
5978 end Check_Arithmetic_Pair
;
5980 -------------------------------
5981 -- Check_Misspelled_Selector --
5982 -------------------------------
5984 procedure Check_Misspelled_Selector
5985 (Prefix
: Entity_Id
;
5988 Max_Suggestions
: constant := 2;
5989 Nr_Of_Suggestions
: Natural := 0;
5991 Suggestion_1
: Entity_Id
:= Empty
;
5992 Suggestion_2
: Entity_Id
:= Empty
;
5997 -- All the components of the prefix of selector Sel are matched against
5998 -- Sel and a count is maintained of possible misspellings. When at
5999 -- the end of the analysis there are one or two (not more) possible
6000 -- misspellings, these misspellings will be suggested as possible
6003 if not (Is_Private_Type
(Prefix
) or else Is_Record_Type
(Prefix
)) then
6005 -- Concurrent types should be handled as well ???
6010 Comp
:= First_Entity
(Prefix
);
6011 while Nr_Of_Suggestions
<= Max_Suggestions
and then Present
(Comp
) loop
6012 if Is_Visible_Component
(Comp
) then
6013 if Is_Bad_Spelling_Of
(Chars
(Comp
), Chars
(Sel
)) then
6014 Nr_Of_Suggestions
:= Nr_Of_Suggestions
+ 1;
6016 case Nr_Of_Suggestions
is
6017 when 1 => Suggestion_1
:= Comp
;
6018 when 2 => Suggestion_2
:= Comp
;
6019 when others => null;
6024 Comp
:= Next_Entity
(Comp
);
6027 -- Report at most two suggestions
6029 if Nr_Of_Suggestions
= 1 then
6030 Error_Msg_NE
-- CODEFIX
6031 ("\possible misspelling of&", Sel
, Suggestion_1
);
6033 elsif Nr_Of_Suggestions
= 2 then
6034 Error_Msg_Node_2
:= Suggestion_2
;
6035 Error_Msg_NE
-- CODEFIX
6036 ("\possible misspelling of& or&", Sel
, Suggestion_1
);
6038 end Check_Misspelled_Selector
;
6040 ----------------------
6041 -- Defined_In_Scope --
6042 ----------------------
6044 function Defined_In_Scope
(T
: Entity_Id
; S
: Entity_Id
) return Boolean
6046 S1
: constant Entity_Id
:= Scope
(Base_Type
(T
));
6049 or else (S1
= System_Aux_Id
and then S
= Scope
(S1
));
6050 end Defined_In_Scope
;
6056 procedure Diagnose_Call
(N
: Node_Id
; Nam
: Node_Id
) is
6062 Void_Interp_Seen
: Boolean := False;
6065 pragma Warnings
(Off
, Boolean);
6068 if Ada_Version
>= Ada_2005
then
6069 Actual
:= First_Actual
(N
);
6070 while Present
(Actual
) loop
6072 -- Ada 2005 (AI-50217): Post an error in case of premature
6073 -- usage of an entity from the limited view.
6075 if not Analyzed
(Etype
(Actual
))
6076 and then From_Limited_With
(Etype
(Actual
))
6078 Error_Msg_Qual_Level
:= 1;
6080 ("missing with_clause for scope of imported type&",
6081 Actual
, Etype
(Actual
));
6082 Error_Msg_Qual_Level
:= 0;
6085 Next_Actual
(Actual
);
6089 -- Before listing the possible candidates, check whether this is
6090 -- a prefix of a selected component that has been rewritten as a
6091 -- parameterless function call because there is a callable candidate
6092 -- interpretation. If there is a hidden package in the list of homonyms
6093 -- of the function name (bad programming style in any case) suggest that
6094 -- this is the intended entity.
6096 if No
(Parameter_Associations
(N
))
6097 and then Nkind
(Parent
(N
)) = N_Selected_Component
6098 and then Nkind
(Parent
(Parent
(N
))) in N_Declaration
6099 and then Is_Overloaded
(Nam
)
6105 Ent
:= Current_Entity
(Nam
);
6106 while Present
(Ent
) loop
6107 if Ekind
(Ent
) = E_Package
then
6109 ("no legal interpretations as function call,!", Nam
);
6110 Error_Msg_NE
("\package& is not visible", N
, Ent
);
6112 Rewrite
(Parent
(N
),
6113 New_Occurrence_Of
(Any_Type
, Sloc
(N
)));
6117 Ent
:= Homonym
(Ent
);
6122 -- Analyze each candidate call again, with full error reporting for
6126 ("no candidate interpretations match the actuals:!", Nam
);
6127 Err_Mode
:= All_Errors_Mode
;
6128 All_Errors_Mode
:= True;
6130 -- If this is a call to an operation of a concurrent type,
6131 -- the failed interpretations have been removed from the
6132 -- name. Recover them to provide full diagnostics.
6134 if Nkind
(Parent
(Nam
)) = N_Selected_Component
then
6135 Set_Entity
(Nam
, Empty
);
6136 New_Nam
:= New_Copy_Tree
(Parent
(Nam
));
6137 Set_Is_Overloaded
(New_Nam
, False);
6138 Set_Is_Overloaded
(Selector_Name
(New_Nam
), False);
6139 Set_Parent
(New_Nam
, Parent
(Parent
(Nam
)));
6140 Analyze_Selected_Component
(New_Nam
);
6141 Get_First_Interp
(Selector_Name
(New_Nam
), X
, It
);
6143 Get_First_Interp
(Nam
, X
, It
);
6146 while Present
(It
.Nam
) loop
6147 if Etype
(It
.Nam
) = Standard_Void_Type
then
6148 Void_Interp_Seen
:= True;
6151 Analyze_One_Call
(N
, It
.Nam
, True, Success
);
6152 Get_Next_Interp
(X
, It
);
6155 if Nkind
(N
) = N_Function_Call
then
6156 Get_First_Interp
(Nam
, X
, It
);
6157 while Present
(It
.Nam
) loop
6158 if Ekind_In
(It
.Nam
, E_Function
, E_Operator
) then
6161 Get_Next_Interp
(X
, It
);
6165 -- If all interpretations are procedures, this deserves a
6166 -- more precise message. Ditto if this appears as the prefix
6167 -- of a selected component, which may be a lexical error.
6170 ("\context requires function call, found procedure name", Nam
);
6172 if Nkind
(Parent
(N
)) = N_Selected_Component
6173 and then N
= Prefix
(Parent
(N
))
6175 Error_Msg_N
-- CODEFIX
6176 ("\period should probably be semicolon", Parent
(N
));
6179 elsif Nkind
(N
) = N_Procedure_Call_Statement
6180 and then not Void_Interp_Seen
6183 "\function name found in procedure call", Nam
);
6186 All_Errors_Mode
:= Err_Mode
;
6189 ---------------------------
6190 -- Find_Arithmetic_Types --
6191 ---------------------------
6193 procedure Find_Arithmetic_Types
6198 Index1
: Interp_Index
;
6199 Index2
: Interp_Index
;
6203 procedure Check_Right_Argument
(T
: Entity_Id
);
6204 -- Check right operand of operator
6206 --------------------------
6207 -- Check_Right_Argument --
6208 --------------------------
6210 procedure Check_Right_Argument
(T
: Entity_Id
) is
6212 if not Is_Overloaded
(R
) then
6213 Check_Arithmetic_Pair
(T
, Etype
(R
), Op_Id
, N
);
6215 Get_First_Interp
(R
, Index2
, It2
);
6216 while Present
(It2
.Typ
) loop
6217 Check_Arithmetic_Pair
(T
, It2
.Typ
, Op_Id
, N
);
6218 Get_Next_Interp
(Index2
, It2
);
6221 end Check_Right_Argument
;
6223 -- Start of processing for Find_Arithmetic_Types
6226 if not Is_Overloaded
(L
) then
6227 Check_Right_Argument
(Etype
(L
));
6230 Get_First_Interp
(L
, Index1
, It1
);
6231 while Present
(It1
.Typ
) loop
6232 Check_Right_Argument
(It1
.Typ
);
6233 Get_Next_Interp
(Index1
, It1
);
6237 end Find_Arithmetic_Types
;
6239 ------------------------
6240 -- Find_Boolean_Types --
6241 ------------------------
6243 procedure Find_Boolean_Types
6248 Index
: Interp_Index
;
6251 procedure Check_Numeric_Argument
(T
: Entity_Id
);
6252 -- Special case for logical operations one of whose operands is an
6253 -- integer literal. If both are literal the result is any modular type.
6255 ----------------------------
6256 -- Check_Numeric_Argument --
6257 ----------------------------
6259 procedure Check_Numeric_Argument
(T
: Entity_Id
) is
6261 if T
= Universal_Integer
then
6262 Add_One_Interp
(N
, Op_Id
, Any_Modular
);
6264 elsif Is_Modular_Integer_Type
(T
) then
6265 Add_One_Interp
(N
, Op_Id
, T
);
6267 end Check_Numeric_Argument
;
6269 -- Start of processing for Find_Boolean_Types
6272 if not Is_Overloaded
(L
) then
6273 if Etype
(L
) = Universal_Integer
6274 or else Etype
(L
) = Any_Modular
6276 if not Is_Overloaded
(R
) then
6277 Check_Numeric_Argument
(Etype
(R
));
6280 Get_First_Interp
(R
, Index
, It
);
6281 while Present
(It
.Typ
) loop
6282 Check_Numeric_Argument
(It
.Typ
);
6283 Get_Next_Interp
(Index
, It
);
6287 -- If operands are aggregates, we must assume that they may be
6288 -- boolean arrays, and leave disambiguation for the second pass.
6289 -- If only one is an aggregate, verify that the other one has an
6290 -- interpretation as a boolean array
6292 elsif Nkind
(L
) = N_Aggregate
then
6293 if Nkind
(R
) = N_Aggregate
then
6294 Add_One_Interp
(N
, Op_Id
, Etype
(L
));
6296 elsif not Is_Overloaded
(R
) then
6297 if Valid_Boolean_Arg
(Etype
(R
)) then
6298 Add_One_Interp
(N
, Op_Id
, Etype
(R
));
6302 Get_First_Interp
(R
, Index
, It
);
6303 while Present
(It
.Typ
) loop
6304 if Valid_Boolean_Arg
(It
.Typ
) then
6305 Add_One_Interp
(N
, Op_Id
, It
.Typ
);
6308 Get_Next_Interp
(Index
, It
);
6312 elsif Valid_Boolean_Arg
(Etype
(L
))
6313 and then Has_Compatible_Type
(R
, Etype
(L
))
6315 Add_One_Interp
(N
, Op_Id
, Etype
(L
));
6319 Get_First_Interp
(L
, Index
, It
);
6320 while Present
(It
.Typ
) loop
6321 if Valid_Boolean_Arg
(It
.Typ
)
6322 and then Has_Compatible_Type
(R
, It
.Typ
)
6324 Add_One_Interp
(N
, Op_Id
, It
.Typ
);
6327 Get_Next_Interp
(Index
, It
);
6330 end Find_Boolean_Types
;
6332 ---------------------------
6333 -- Find_Comparison_Types --
6334 ---------------------------
6336 procedure Find_Comparison_Types
6341 Index
: Interp_Index
;
6343 Found
: Boolean := False;
6346 Scop
: Entity_Id
:= Empty
;
6348 procedure Try_One_Interp
(T1
: Entity_Id
);
6349 -- Routine to try one proposed interpretation. Note that the context
6350 -- of the operator plays no role in resolving the arguments, so that
6351 -- if there is more than one interpretation of the operands that is
6352 -- compatible with comparison, the operation is ambiguous.
6354 --------------------
6355 -- Try_One_Interp --
6356 --------------------
6358 procedure Try_One_Interp
(T1
: Entity_Id
) is
6360 -- If the operator is an expanded name, then the type of the operand
6361 -- must be defined in the corresponding scope. If the type is
6362 -- universal, the context will impose the correct type. Note that we
6363 -- also avoid returning if we are currently within a generic instance
6364 -- due to the fact that the generic package declaration has already
6365 -- been successfully analyzed and Defined_In_Scope expects the base
6366 -- type to be defined within the instance which will never be the
6370 and then not Defined_In_Scope
(T1
, Scop
)
6371 and then not In_Instance
6372 and then T1
/= Universal_Integer
6373 and then T1
/= Universal_Real
6374 and then T1
/= Any_String
6375 and then T1
/= Any_Composite
6380 if Valid_Comparison_Arg
(T1
) and then Has_Compatible_Type
(R
, T1
) then
6381 if Found
and then Base_Type
(T1
) /= Base_Type
(T_F
) then
6382 It
:= Disambiguate
(L
, I_F
, Index
, Any_Type
);
6384 if It
= No_Interp
then
6385 Ambiguous_Operands
(N
);
6386 Set_Etype
(L
, Any_Type
);
6399 Find_Non_Universal_Interpretations
(N
, R
, Op_Id
, T1
);
6403 -- Start of processing for Find_Comparison_Types
6406 -- If left operand is aggregate, the right operand has to
6407 -- provide a usable type for it.
6409 if Nkind
(L
) = N_Aggregate
and then Nkind
(R
) /= N_Aggregate
then
6410 Find_Comparison_Types
(L
=> R
, R
=> L
, Op_Id
=> Op_Id
, N
=> N
);
6414 if Nkind
(N
) = N_Function_Call
6415 and then Nkind
(Name
(N
)) = N_Expanded_Name
6417 Scop
:= Entity
(Prefix
(Name
(N
)));
6419 -- The prefix may be a package renaming, and the subsequent test
6420 -- requires the original package.
6422 if Ekind
(Scop
) = E_Package
6423 and then Present
(Renamed_Entity
(Scop
))
6425 Scop
:= Renamed_Entity
(Scop
);
6426 Set_Entity
(Prefix
(Name
(N
)), Scop
);
6430 if not Is_Overloaded
(L
) then
6431 Try_One_Interp
(Etype
(L
));
6434 Get_First_Interp
(L
, Index
, It
);
6435 while Present
(It
.Typ
) loop
6436 Try_One_Interp
(It
.Typ
);
6437 Get_Next_Interp
(Index
, It
);
6440 end Find_Comparison_Types
;
6442 ----------------------------------------
6443 -- Find_Non_Universal_Interpretations --
6444 ----------------------------------------
6446 procedure Find_Non_Universal_Interpretations
6452 Index
: Interp_Index
;
6456 if T1
= Universal_Integer
or else T1
= Universal_Real
6458 -- If the left operand of an equality operator is null, the visibility
6459 -- of the operator must be determined from the interpretation of the
6460 -- right operand. This processing must be done for Any_Access, which
6461 -- is the internal representation of the type of the literal null.
6463 or else T1
= Any_Access
6465 if not Is_Overloaded
(R
) then
6466 Add_One_Interp
(N
, Op_Id
, Standard_Boolean
, Base_Type
(Etype
(R
)));
6468 Get_First_Interp
(R
, Index
, It
);
6469 while Present
(It
.Typ
) loop
6470 if Covers
(It
.Typ
, T1
) then
6472 (N
, Op_Id
, Standard_Boolean
, Base_Type
(It
.Typ
));
6475 Get_Next_Interp
(Index
, It
);
6479 Add_One_Interp
(N
, Op_Id
, Standard_Boolean
, Base_Type
(T1
));
6481 end Find_Non_Universal_Interpretations
;
6483 ------------------------------
6484 -- Find_Concatenation_Types --
6485 ------------------------------
6487 procedure Find_Concatenation_Types
6492 Is_String
: constant Boolean := Nkind
(L
) = N_String_Literal
6494 Nkind
(R
) = N_String_Literal
;
6495 Op_Type
: constant Entity_Id
:= Etype
(Op_Id
);
6498 if Is_Array_Type
(Op_Type
)
6500 -- Small but very effective optimization: if at least one operand is a
6501 -- string literal, then the type of the operator must be either array
6502 -- of characters or array of strings.
6504 and then (not Is_String
6506 Is_Character_Type
(Component_Type
(Op_Type
))
6508 Is_String_Type
(Component_Type
(Op_Type
)))
6510 and then not Is_Limited_Type
(Op_Type
)
6512 and then (Has_Compatible_Type
(L
, Op_Type
)
6514 Has_Compatible_Type
(L
, Component_Type
(Op_Type
)))
6516 and then (Has_Compatible_Type
(R
, Op_Type
)
6518 Has_Compatible_Type
(R
, Component_Type
(Op_Type
)))
6520 Add_One_Interp
(N
, Op_Id
, Op_Type
);
6522 end Find_Concatenation_Types
;
6524 -------------------------
6525 -- Find_Equality_Types --
6526 -------------------------
6528 procedure Find_Equality_Types
6533 Index
: Interp_Index
;
6535 Found
: Boolean := False;
6538 Scop
: Entity_Id
:= Empty
;
6540 procedure Try_One_Interp
(T1
: Entity_Id
);
6541 -- The context of the equality operator plays no role in resolving the
6542 -- arguments, so that if there is more than one interpretation of the
6543 -- operands that is compatible with equality, the construct is ambiguous
6544 -- and an error can be emitted now, after trying to disambiguate, i.e.
6545 -- applying preference rules.
6547 --------------------
6548 -- Try_One_Interp --
6549 --------------------
6551 procedure Try_One_Interp
(T1
: Entity_Id
) is
6555 -- Perform a sanity check in case of previous errors
6561 Bas
:= Base_Type
(T1
);
6563 -- If the operator is an expanded name, then the type of the operand
6564 -- must be defined in the corresponding scope. If the type is
6565 -- universal, the context will impose the correct type. An anonymous
6566 -- type for a 'Access reference is also universal in this sense, as
6567 -- the actual type is obtained from context.
6569 -- In Ada 2005, the equality operator for anonymous access types
6570 -- is declared in Standard, and preference rules apply to it.
6572 if Present
(Scop
) then
6574 -- Note that we avoid returning if we are currently within a
6575 -- generic instance due to the fact that the generic package
6576 -- declaration has already been successfully analyzed and
6577 -- Defined_In_Scope expects the base type to be defined within
6578 -- the instance which will never be the case.
6580 if Defined_In_Scope
(T1
, Scop
)
6582 or else T1
= Universal_Integer
6583 or else T1
= Universal_Real
6584 or else T1
= Any_Access
6585 or else T1
= Any_String
6586 or else T1
= Any_Composite
6587 or else (Ekind
(T1
) = E_Access_Subprogram_Type
6588 and then not Comes_From_Source
(T1
))
6592 elsif Ekind
(T1
) = E_Anonymous_Access_Type
6593 and then Scop
= Standard_Standard
6598 -- The scope does not contain an operator for the type
6603 -- If we have infix notation, the operator must be usable. Within
6604 -- an instance, if the type is already established we know it is
6605 -- correct. If an operand is universal it is compatible with any
6608 elsif In_Open_Scopes
(Scope
(Bas
))
6609 or else Is_Potentially_Use_Visible
(Bas
)
6610 or else In_Use
(Bas
)
6611 or else (In_Use
(Scope
(Bas
)) and then not Is_Hidden
(Bas
))
6613 -- In an instance, the type may have been immediately visible.
6614 -- Either the types are compatible, or one operand is universal
6615 -- (numeric or null).
6618 ((In_Instance
or else In_Inlined_Body
)
6620 (First_Subtype
(T1
) = First_Subtype
(Etype
(R
))
6621 or else Nkind
(R
) = N_Null
6623 (Is_Numeric_Type
(T1
)
6624 and then Is_Universal_Numeric_Type
(Etype
(R
)))))
6626 -- In Ada 2005, the equality on anonymous access types is declared
6627 -- in Standard, and is always visible.
6629 or else Ekind
(T1
) = E_Anonymous_Access_Type
6634 -- Save candidate type for subsequent error message, if any
6636 if not Is_Limited_Type
(T1
) then
6637 Candidate_Type
:= T1
;
6643 -- Ada 2005 (AI-230): Keep restriction imposed by Ada 83 and 95:
6644 -- Do not allow anonymous access types in equality operators.
6646 if Ada_Version
< Ada_2005
6647 and then Ekind
(T1
) = E_Anonymous_Access_Type
6652 -- If the right operand has a type compatible with T1, check for an
6653 -- acceptable interpretation, unless T1 is limited (no predefined
6654 -- equality available), or this is use of a "/=" for a tagged type.
6655 -- In the latter case, possible interpretations of equality need
6656 -- to be considered, we don't want the default inequality declared
6657 -- in Standard to be chosen, and the "/=" will be rewritten as a
6658 -- negation of "=" (see the end of Analyze_Equality_Op). This ensures
6659 -- that rewriting happens during analysis rather than being
6660 -- delayed until expansion (this is needed for ASIS, which only sees
6661 -- the unexpanded tree). Note that if the node is N_Op_Ne, but Op_Id
6662 -- is Name_Op_Eq then we still proceed with the interpretation,
6663 -- because that indicates the potential rewriting case where the
6664 -- interpretation to consider is actually "=" and the node may be
6665 -- about to be rewritten by Analyze_Equality_Op.
6667 if T1
/= Standard_Void_Type
6668 and then Has_Compatible_Type
(R
, T1
)
6671 ((not Is_Limited_Type
(T1
)
6672 and then not Is_Limited_Composite
(T1
))
6676 and then not Is_Limited_Type
(Component_Type
(T1
))
6677 and then Available_Full_View_Of_Component
(T1
)))
6680 (Nkind
(N
) /= N_Op_Ne
6681 or else not Is_Tagged_Type
(T1
)
6682 or else Chars
(Op_Id
) = Name_Op_Eq
)
6685 and then Base_Type
(T1
) /= Base_Type
(T_F
)
6687 It
:= Disambiguate
(L
, I_F
, Index
, Any_Type
);
6689 if It
= No_Interp
then
6690 Ambiguous_Operands
(N
);
6691 Set_Etype
(L
, Any_Type
);
6704 if not Analyzed
(L
) then
6708 Find_Non_Universal_Interpretations
(N
, R
, Op_Id
, T1
);
6710 -- Case of operator was not visible, Etype still set to Any_Type
6712 if Etype
(N
) = Any_Type
then
6716 elsif Scop
= Standard_Standard
6717 and then Ekind
(T1
) = E_Anonymous_Access_Type
6723 -- Start of processing for Find_Equality_Types
6726 -- If left operand is aggregate, the right operand has to
6727 -- provide a usable type for it.
6729 if Nkind
(L
) = N_Aggregate
6730 and then Nkind
(R
) /= N_Aggregate
6732 Find_Equality_Types
(L
=> R
, R
=> L
, Op_Id
=> Op_Id
, N
=> N
);
6736 if Nkind
(N
) = N_Function_Call
6737 and then Nkind
(Name
(N
)) = N_Expanded_Name
6739 Scop
:= Entity
(Prefix
(Name
(N
)));
6741 -- The prefix may be a package renaming, and the subsequent test
6742 -- requires the original package.
6744 if Ekind
(Scop
) = E_Package
6745 and then Present
(Renamed_Entity
(Scop
))
6747 Scop
:= Renamed_Entity
(Scop
);
6748 Set_Entity
(Prefix
(Name
(N
)), Scop
);
6752 if not Is_Overloaded
(L
) then
6753 Try_One_Interp
(Etype
(L
));
6756 Get_First_Interp
(L
, Index
, It
);
6757 while Present
(It
.Typ
) loop
6758 Try_One_Interp
(It
.Typ
);
6759 Get_Next_Interp
(Index
, It
);
6762 end Find_Equality_Types
;
6764 -------------------------
6765 -- Find_Negation_Types --
6766 -------------------------
6768 procedure Find_Negation_Types
6773 Index
: Interp_Index
;
6777 if not Is_Overloaded
(R
) then
6778 if Etype
(R
) = Universal_Integer
then
6779 Add_One_Interp
(N
, Op_Id
, Any_Modular
);
6780 elsif Valid_Boolean_Arg
(Etype
(R
)) then
6781 Add_One_Interp
(N
, Op_Id
, Etype
(R
));
6785 Get_First_Interp
(R
, Index
, It
);
6786 while Present
(It
.Typ
) loop
6787 if Valid_Boolean_Arg
(It
.Typ
) then
6788 Add_One_Interp
(N
, Op_Id
, It
.Typ
);
6791 Get_Next_Interp
(Index
, It
);
6794 end Find_Negation_Types
;
6796 ------------------------------
6797 -- Find_Primitive_Operation --
6798 ------------------------------
6800 function Find_Primitive_Operation
(N
: Node_Id
) return Boolean is
6801 Obj
: constant Node_Id
:= Prefix
(N
);
6802 Op
: constant Node_Id
:= Selector_Name
(N
);
6809 Set_Etype
(Op
, Any_Type
);
6811 if Is_Access_Type
(Etype
(Obj
)) then
6812 Typ
:= Designated_Type
(Etype
(Obj
));
6817 if Is_Class_Wide_Type
(Typ
) then
6818 Typ
:= Root_Type
(Typ
);
6821 Prims
:= Primitive_Operations
(Typ
);
6823 Prim
:= First_Elmt
(Prims
);
6824 while Present
(Prim
) loop
6825 if Chars
(Node
(Prim
)) = Chars
(Op
) then
6826 Add_One_Interp
(Op
, Node
(Prim
), Etype
(Node
(Prim
)));
6827 Set_Etype
(N
, Etype
(Node
(Prim
)));
6833 -- Now look for class-wide operations of the type or any of its
6834 -- ancestors by iterating over the homonyms of the selector.
6837 Cls_Type
: constant Entity_Id
:= Class_Wide_Type
(Typ
);
6841 Hom
:= Current_Entity
(Op
);
6842 while Present
(Hom
) loop
6843 if (Ekind
(Hom
) = E_Procedure
6845 Ekind
(Hom
) = E_Function
)
6846 and then Scope
(Hom
) = Scope
(Typ
)
6847 and then Present
(First_Formal
(Hom
))
6849 (Base_Type
(Etype
(First_Formal
(Hom
))) = Cls_Type
6851 (Is_Access_Type
(Etype
(First_Formal
(Hom
)))
6853 Ekind
(Etype
(First_Formal
(Hom
))) =
6854 E_Anonymous_Access_Type
6857 (Designated_Type
(Etype
(First_Formal
(Hom
)))) =
6860 Add_One_Interp
(Op
, Hom
, Etype
(Hom
));
6861 Set_Etype
(N
, Etype
(Hom
));
6864 Hom
:= Homonym
(Hom
);
6868 return Etype
(Op
) /= Any_Type
;
6869 end Find_Primitive_Operation
;
6871 ----------------------
6872 -- Find_Unary_Types --
6873 ----------------------
6875 procedure Find_Unary_Types
6880 Index
: Interp_Index
;
6884 if not Is_Overloaded
(R
) then
6885 if Is_Numeric_Type
(Etype
(R
)) then
6887 -- In an instance a generic actual may be a numeric type even if
6888 -- the formal in the generic unit was not. In that case, the
6889 -- predefined operator was not a possible interpretation in the
6890 -- generic, and cannot be one in the instance, unless the operator
6891 -- is an actual of an instance.
6895 not Is_Numeric_Type
(Corresponding_Generic_Type
(Etype
(R
)))
6899 Add_One_Interp
(N
, Op_Id
, Base_Type
(Etype
(R
)));
6904 Get_First_Interp
(R
, Index
, It
);
6905 while Present
(It
.Typ
) loop
6906 if Is_Numeric_Type
(It
.Typ
) then
6910 (Corresponding_Generic_Type
(Etype
(It
.Typ
)))
6915 Add_One_Interp
(N
, Op_Id
, Base_Type
(It
.Typ
));
6919 Get_Next_Interp
(Index
, It
);
6922 end Find_Unary_Types
;
6928 function Junk_Operand
(N
: Node_Id
) return Boolean is
6932 if Error_Posted
(N
) then
6936 -- Get entity to be tested
6938 if Is_Entity_Name
(N
)
6939 and then Present
(Entity
(N
))
6943 -- An odd case, a procedure name gets converted to a very peculiar
6944 -- function call, and here is where we detect this happening.
6946 elsif Nkind
(N
) = N_Function_Call
6947 and then Is_Entity_Name
(Name
(N
))
6948 and then Present
(Entity
(Name
(N
)))
6952 -- Another odd case, there are at least some cases of selected
6953 -- components where the selected component is not marked as having
6954 -- an entity, even though the selector does have an entity
6956 elsif Nkind
(N
) = N_Selected_Component
6957 and then Present
(Entity
(Selector_Name
(N
)))
6959 Enode
:= Selector_Name
(N
);
6965 -- Now test the entity we got to see if it is a bad case
6967 case Ekind
(Entity
(Enode
)) is
6970 ("package name cannot be used as operand", Enode
);
6972 when Generic_Unit_Kind
=>
6974 ("generic unit name cannot be used as operand", Enode
);
6978 ("subtype name cannot be used as operand", Enode
);
6982 ("entry name cannot be used as operand", Enode
);
6986 ("procedure name cannot be used as operand", Enode
);
6990 ("exception name cannot be used as operand", Enode
);
6997 ("label name cannot be used as operand", Enode
);
7006 --------------------
7007 -- Operator_Check --
7008 --------------------
7010 procedure Operator_Check
(N
: Node_Id
) is
7012 Remove_Abstract_Operations
(N
);
7014 -- Test for case of no interpretation found for operator
7016 if Etype
(N
) = Any_Type
then
7020 Op_Id
: Entity_Id
:= Empty
;
7023 R
:= Right_Opnd
(N
);
7025 if Nkind
(N
) in N_Binary_Op
then
7031 -- If either operand has no type, then don't complain further,
7032 -- since this simply means that we have a propagated error.
7035 or else Etype
(R
) = Any_Type
7036 or else (Nkind
(N
) in N_Binary_Op
and then Etype
(L
) = Any_Type
)
7038 -- For the rather unusual case where one of the operands is
7039 -- a Raise_Expression, whose initial type is Any_Type, use
7040 -- the type of the other operand.
7042 if Nkind
(L
) = N_Raise_Expression
then
7043 Set_Etype
(L
, Etype
(R
));
7044 Set_Etype
(N
, Etype
(R
));
7046 elsif Nkind
(R
) = N_Raise_Expression
then
7047 Set_Etype
(R
, Etype
(L
));
7048 Set_Etype
(N
, Etype
(L
));
7053 -- We explicitly check for the case of concatenation of component
7054 -- with component to avoid reporting spurious matching array types
7055 -- that might happen to be lurking in distant packages (such as
7056 -- run-time packages). This also prevents inconsistencies in the
7057 -- messages for certain ACVC B tests, which can vary depending on
7058 -- types declared in run-time interfaces. Another improvement when
7059 -- aggregates are present is to look for a well-typed operand.
7061 elsif Present
(Candidate_Type
)
7062 and then (Nkind
(N
) /= N_Op_Concat
7063 or else Is_Array_Type
(Etype
(L
))
7064 or else Is_Array_Type
(Etype
(R
)))
7066 if Nkind
(N
) = N_Op_Concat
then
7067 if Etype
(L
) /= Any_Composite
7068 and then Is_Array_Type
(Etype
(L
))
7070 Candidate_Type
:= Etype
(L
);
7072 elsif Etype
(R
) /= Any_Composite
7073 and then Is_Array_Type
(Etype
(R
))
7075 Candidate_Type
:= Etype
(R
);
7079 Error_Msg_NE
-- CODEFIX
7080 ("operator for} is not directly visible!",
7081 N
, First_Subtype
(Candidate_Type
));
7084 U
: constant Node_Id
:=
7085 Cunit
(Get_Source_Unit
(Candidate_Type
));
7087 if Unit_Is_Visible
(U
) then
7088 Error_Msg_N
-- CODEFIX
7089 ("use clause would make operation legal!", N
);
7091 Error_Msg_NE
-- CODEFIX
7092 ("add with_clause and use_clause for&!",
7093 N
, Defining_Entity
(Unit
(U
)));
7098 -- If either operand is a junk operand (e.g. package name), then
7099 -- post appropriate error messages, but do not complain further.
7101 -- Note that the use of OR in this test instead of OR ELSE is
7102 -- quite deliberate, we may as well check both operands in the
7103 -- binary operator case.
7105 elsif Junk_Operand
(R
)
7106 or -- really mean OR here and not OR ELSE, see above
7107 (Nkind
(N
) in N_Binary_Op
and then Junk_Operand
(L
))
7111 -- If we have a logical operator, one of whose operands is
7112 -- Boolean, then we know that the other operand cannot resolve to
7113 -- Boolean (since we got no interpretations), but in that case we
7114 -- pretty much know that the other operand should be Boolean, so
7115 -- resolve it that way (generating an error).
7117 elsif Nkind_In
(N
, N_Op_And
, N_Op_Or
, N_Op_Xor
) then
7118 if Etype
(L
) = Standard_Boolean
then
7119 Resolve
(R
, Standard_Boolean
);
7121 elsif Etype
(R
) = Standard_Boolean
then
7122 Resolve
(L
, Standard_Boolean
);
7126 -- For an arithmetic operator or comparison operator, if one
7127 -- of the operands is numeric, then we know the other operand
7128 -- is not the same numeric type. If it is a non-numeric type,
7129 -- then probably it is intended to match the other operand.
7131 elsif Nkind_In
(N
, N_Op_Add
,
7137 Nkind_In
(N
, N_Op_Lt
,
7143 -- If Allow_Integer_Address is active, check whether the
7144 -- operation becomes legal after converting an operand.
7146 if Is_Numeric_Type
(Etype
(L
))
7147 and then not Is_Numeric_Type
(Etype
(R
))
7149 if Address_Integer_Convert_OK
(Etype
(R
), Etype
(L
)) then
7151 Unchecked_Convert_To
(Etype
(L
), Relocate_Node
(R
)));
7153 if Nkind_In
(N
, N_Op_Ge
, N_Op_Gt
, N_Op_Le
, N_Op_Lt
) then
7154 Analyze_Comparison_Op
(N
);
7156 Analyze_Arithmetic_Op
(N
);
7159 Resolve
(R
, Etype
(L
));
7164 elsif Is_Numeric_Type
(Etype
(R
))
7165 and then not Is_Numeric_Type
(Etype
(L
))
7167 if Address_Integer_Convert_OK
(Etype
(L
), Etype
(R
)) then
7169 Unchecked_Convert_To
(Etype
(R
), Relocate_Node
(L
)));
7171 if Nkind_In
(N
, N_Op_Ge
, N_Op_Gt
, N_Op_Le
, N_Op_Lt
) then
7172 Analyze_Comparison_Op
(N
);
7174 Analyze_Arithmetic_Op
(N
);
7180 Resolve
(L
, Etype
(R
));
7185 elsif Allow_Integer_Address
7186 and then Is_Descendant_Of_Address
(Etype
(L
))
7187 and then Is_Descendant_Of_Address
(Etype
(R
))
7188 and then not Error_Posted
(N
)
7191 Addr_Type
: constant Entity_Id
:= Etype
(L
);
7195 Unchecked_Convert_To
(
7196 Standard_Integer
, Relocate_Node
(L
)));
7198 Unchecked_Convert_To
(
7199 Standard_Integer
, Relocate_Node
(R
)));
7201 if Nkind_In
(N
, N_Op_Ge
, N_Op_Gt
, N_Op_Le
, N_Op_Lt
) then
7202 Analyze_Comparison_Op
(N
);
7204 Analyze_Arithmetic_Op
(N
);
7207 -- If this is an operand in an enclosing arithmetic
7208 -- operation, Convert the result as an address so that
7209 -- arithmetic folding of address can continue.
7211 if Nkind
(Parent
(N
)) in N_Op
then
7213 Unchecked_Convert_To
(Addr_Type
, Relocate_Node
(N
)));
7219 -- Under relaxed RM semantics silently replace occurrences of
7220 -- null by System.Address_Null.
7222 elsif Null_To_Null_Address_Convert_OK
(N
) then
7223 Replace_Null_By_Null_Address
(N
);
7225 if Nkind_In
(N
, N_Op_Ge
, N_Op_Gt
, N_Op_Le
, N_Op_Lt
) then
7226 Analyze_Comparison_Op
(N
);
7228 Analyze_Arithmetic_Op
(N
);
7234 -- Comparisons on A'Access are common enough to deserve a
7237 elsif Nkind_In
(N
, N_Op_Eq
, N_Op_Ne
)
7238 and then Ekind
(Etype
(L
)) = E_Access_Attribute_Type
7239 and then Ekind
(Etype
(R
)) = E_Access_Attribute_Type
7242 ("two access attributes cannot be compared directly", N
);
7244 ("\use qualified expression for one of the operands",
7248 -- Another one for C programmers
7250 elsif Nkind
(N
) = N_Op_Concat
7251 and then Valid_Boolean_Arg
(Etype
(L
))
7252 and then Valid_Boolean_Arg
(Etype
(R
))
7254 Error_Msg_N
("invalid operands for concatenation", N
);
7255 Error_Msg_N
-- CODEFIX
7256 ("\maybe AND was meant", N
);
7259 -- A special case for comparison of access parameter with null
7261 elsif Nkind
(N
) = N_Op_Eq
7262 and then Is_Entity_Name
(L
)
7263 and then Nkind
(Parent
(Entity
(L
))) = N_Parameter_Specification
7264 and then Nkind
(Parameter_Type
(Parent
(Entity
(L
)))) =
7266 and then Nkind
(R
) = N_Null
7268 Error_Msg_N
("access parameter is not allowed to be null", L
);
7269 Error_Msg_N
("\(call would raise Constraint_Error)", L
);
7272 -- Another special case for exponentiation, where the right
7273 -- operand must be Natural, independently of the base.
7275 elsif Nkind
(N
) = N_Op_Expon
7276 and then Is_Numeric_Type
(Etype
(L
))
7277 and then not Is_Overloaded
(R
)
7279 First_Subtype
(Base_Type
(Etype
(R
))) /= Standard_Integer
7280 and then Base_Type
(Etype
(R
)) /= Universal_Integer
7282 if Ada_Version
>= Ada_2012
7283 and then Has_Dimension_System
(Etype
(L
))
7286 ("exponent for dimensioned type must be a rational" &
7287 ", found}", R
, Etype
(R
));
7290 ("exponent must be of type Natural, found}", R
, Etype
(R
));
7295 elsif Nkind_In
(N
, N_Op_Eq
, N_Op_Ne
) then
7296 if Address_Integer_Convert_OK
(Etype
(R
), Etype
(L
)) then
7298 Unchecked_Convert_To
(Etype
(L
), Relocate_Node
(R
)));
7299 Analyze_Equality_Op
(N
);
7302 -- Under relaxed RM semantics silently replace occurrences of
7303 -- null by System.Address_Null.
7305 elsif Null_To_Null_Address_Convert_OK
(N
) then
7306 Replace_Null_By_Null_Address
(N
);
7307 Analyze_Equality_Op
(N
);
7312 -- If we fall through then just give general message. Note that in
7313 -- the following messages, if the operand is overloaded we choose
7314 -- an arbitrary type to complain about, but that is probably more
7315 -- useful than not giving a type at all.
7317 if Nkind
(N
) in N_Unary_Op
then
7318 Error_Msg_Node_2
:= Etype
(R
);
7319 Error_Msg_N
("operator& not defined for}", N
);
7323 if Nkind
(N
) in N_Binary_Op
then
7324 if not Is_Overloaded
(L
)
7325 and then not Is_Overloaded
(R
)
7326 and then Base_Type
(Etype
(L
)) = Base_Type
(Etype
(R
))
7328 Error_Msg_Node_2
:= First_Subtype
(Etype
(R
));
7329 Error_Msg_N
("there is no applicable operator& for}", N
);
7332 -- Another attempt to find a fix: one of the candidate
7333 -- interpretations may not be use-visible. This has
7334 -- already been checked for predefined operators, so
7335 -- we examine only user-defined functions.
7337 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
7339 while Present
(Op_Id
) loop
7340 if Ekind
(Op_Id
) /= E_Operator
7341 and then Is_Overloadable
(Op_Id
)
7343 if not Is_Immediately_Visible
(Op_Id
)
7344 and then not In_Use
(Scope
(Op_Id
))
7345 and then not Is_Abstract_Subprogram
(Op_Id
)
7346 and then not Is_Hidden
(Op_Id
)
7347 and then Ekind
(Scope
(Op_Id
)) = E_Package
7350 (L
, Etype
(First_Formal
(Op_Id
)))
7352 (Next_Formal
(First_Formal
(Op_Id
)))
7356 Etype
(Next_Formal
(First_Formal
(Op_Id
))))
7359 ("No legal interpretation for operator&", N
);
7361 ("\use clause on& would make operation legal",
7367 Op_Id
:= Homonym
(Op_Id
);
7371 Error_Msg_N
("invalid operand types for operator&", N
);
7373 if Nkind
(N
) /= N_Op_Concat
then
7374 Error_Msg_NE
("\left operand has}!", N
, Etype
(L
));
7375 Error_Msg_NE
("\right operand has}!", N
, Etype
(R
));
7377 -- For concatenation operators it is more difficult to
7378 -- determine which is the wrong operand. It is worth
7379 -- flagging explicitly an access type, for those who
7380 -- might think that a dereference happens here.
7382 elsif Is_Access_Type
(Etype
(L
)) then
7383 Error_Msg_N
("\left operand is access type", N
);
7385 elsif Is_Access_Type
(Etype
(R
)) then
7386 Error_Msg_N
("\right operand is access type", N
);
7396 -----------------------------------------
7397 -- Process_Implicit_Dereference_Prefix --
7398 -----------------------------------------
7400 function Process_Implicit_Dereference_Prefix
7402 P
: Entity_Id
) return Entity_Id
7405 Typ
: constant Entity_Id
:= Designated_Type
(Etype
(P
));
7409 and then (Operating_Mode
= Check_Semantics
or else not Expander_Active
)
7411 -- We create a dummy reference to E to ensure that the reference is
7412 -- not considered as part of an assignment (an implicit dereference
7413 -- can never assign to its prefix). The Comes_From_Source attribute
7414 -- needs to be propagated for accurate warnings.
7416 Ref
:= New_Occurrence_Of
(E
, Sloc
(P
));
7417 Set_Comes_From_Source
(Ref
, Comes_From_Source
(P
));
7418 Generate_Reference
(E
, Ref
);
7421 -- An implicit dereference is a legal occurrence of an incomplete type
7422 -- imported through a limited_with clause, if the full view is visible.
7424 if From_Limited_With
(Typ
)
7425 and then not From_Limited_With
(Scope
(Typ
))
7427 (Is_Immediately_Visible
(Scope
(Typ
))
7429 (Is_Child_Unit
(Scope
(Typ
))
7430 and then Is_Visible_Lib_Unit
(Scope
(Typ
))))
7432 return Available_View
(Typ
);
7436 end Process_Implicit_Dereference_Prefix
;
7438 --------------------------------
7439 -- Remove_Abstract_Operations --
7440 --------------------------------
7442 procedure Remove_Abstract_Operations
(N
: Node_Id
) is
7443 Abstract_Op
: Entity_Id
:= Empty
;
7444 Address_Descendant
: Boolean := False;
7448 -- AI-310: If overloaded, remove abstract non-dispatching operations. We
7449 -- activate this if either extensions are enabled, or if the abstract
7450 -- operation in question comes from a predefined file. This latter test
7451 -- allows us to use abstract to make operations invisible to users. In
7452 -- particular, if type Address is non-private and abstract subprograms
7453 -- are used to hide its operators, they will be truly hidden.
7455 type Operand_Position
is (First_Op
, Second_Op
);
7456 Univ_Type
: constant Entity_Id
:= Universal_Interpretation
(N
);
7458 procedure Remove_Address_Interpretations
(Op
: Operand_Position
);
7459 -- Ambiguities may arise when the operands are literal and the address
7460 -- operations in s-auxdec are visible. In that case, remove the
7461 -- interpretation of a literal as Address, to retain the semantics
7462 -- of Address as a private type.
7464 ------------------------------------
7465 -- Remove_Address_Interpretations --
7466 ------------------------------------
7468 procedure Remove_Address_Interpretations
(Op
: Operand_Position
) is
7472 if Is_Overloaded
(N
) then
7473 Get_First_Interp
(N
, I
, It
);
7474 while Present
(It
.Nam
) loop
7475 Formal
:= First_Entity
(It
.Nam
);
7477 if Op
= Second_Op
then
7478 Formal
:= Next_Entity
(Formal
);
7481 if Is_Descendant_Of_Address
(Etype
(Formal
)) then
7482 Address_Descendant
:= True;
7486 Get_Next_Interp
(I
, It
);
7489 end Remove_Address_Interpretations
;
7491 -- Start of processing for Remove_Abstract_Operations
7494 if Is_Overloaded
(N
) then
7495 if Debug_Flag_V
then
7496 Write_Str
("Remove_Abstract_Operations: ");
7497 Write_Overloads
(N
);
7500 Get_First_Interp
(N
, I
, It
);
7502 while Present
(It
.Nam
) loop
7503 if Is_Overloadable
(It
.Nam
)
7504 and then Is_Abstract_Subprogram
(It
.Nam
)
7505 and then not Is_Dispatching_Operation
(It
.Nam
)
7507 Abstract_Op
:= It
.Nam
;
7509 if Is_Descendant_Of_Address
(It
.Typ
) then
7510 Address_Descendant
:= True;
7514 -- In Ada 2005, this operation does not participate in overload
7515 -- resolution. If the operation is defined in a predefined
7516 -- unit, it is one of the operations declared abstract in some
7517 -- variants of System, and it must be removed as well.
7519 elsif Ada_Version
>= Ada_2005
7520 or else In_Predefined_Unit
(It
.Nam
)
7527 Get_Next_Interp
(I
, It
);
7530 if No
(Abstract_Op
) then
7532 -- If some interpretation yields an integer type, it is still
7533 -- possible that there are address interpretations. Remove them
7534 -- if one operand is a literal, to avoid spurious ambiguities
7535 -- on systems where Address is a visible integer type.
7537 if Is_Overloaded
(N
)
7538 and then Nkind
(N
) in N_Op
7539 and then Is_Integer_Type
(Etype
(N
))
7541 if Nkind
(N
) in N_Binary_Op
then
7542 if Nkind
(Right_Opnd
(N
)) = N_Integer_Literal
then
7543 Remove_Address_Interpretations
(Second_Op
);
7545 elsif Nkind
(Left_Opnd
(N
)) = N_Integer_Literal
then
7546 Remove_Address_Interpretations
(First_Op
);
7551 elsif Nkind
(N
) in N_Op
then
7553 -- Remove interpretations that treat literals as addresses. This
7554 -- is never appropriate, even when Address is defined as a visible
7555 -- Integer type. The reason is that we would really prefer Address
7556 -- to behave as a private type, even in this case. If Address is a
7557 -- visible integer type, we get lots of overload ambiguities.
7559 if Nkind
(N
) in N_Binary_Op
then
7561 U1
: constant Boolean :=
7562 Present
(Universal_Interpretation
(Right_Opnd
(N
)));
7563 U2
: constant Boolean :=
7564 Present
(Universal_Interpretation
(Left_Opnd
(N
)));
7568 Remove_Address_Interpretations
(Second_Op
);
7572 Remove_Address_Interpretations
(First_Op
);
7575 if not (U1
and U2
) then
7577 -- Remove corresponding predefined operator, which is
7578 -- always added to the overload set.
7580 Get_First_Interp
(N
, I
, It
);
7581 while Present
(It
.Nam
) loop
7582 if Scope
(It
.Nam
) = Standard_Standard
7583 and then Base_Type
(It
.Typ
) =
7584 Base_Type
(Etype
(Abstract_Op
))
7589 Get_Next_Interp
(I
, It
);
7592 elsif Is_Overloaded
(N
)
7593 and then Present
(Univ_Type
)
7595 -- If both operands have a universal interpretation,
7596 -- it is still necessary to remove interpretations that
7597 -- yield Address. Any remaining ambiguities will be
7598 -- removed in Disambiguate.
7600 Get_First_Interp
(N
, I
, It
);
7601 while Present
(It
.Nam
) loop
7602 if Is_Descendant_Of_Address
(It
.Typ
) then
7605 elsif not Is_Type
(It
.Nam
) then
7606 Set_Entity
(N
, It
.Nam
);
7609 Get_Next_Interp
(I
, It
);
7615 elsif Nkind
(N
) = N_Function_Call
7617 (Nkind
(Name
(N
)) = N_Operator_Symbol
7619 (Nkind
(Name
(N
)) = N_Expanded_Name
7621 Nkind
(Selector_Name
(Name
(N
))) = N_Operator_Symbol
))
7625 Arg1
: constant Node_Id
:= First
(Parameter_Associations
(N
));
7626 U1
: constant Boolean :=
7627 Present
(Universal_Interpretation
(Arg1
));
7628 U2
: constant Boolean :=
7629 Present
(Next
(Arg1
)) and then
7630 Present
(Universal_Interpretation
(Next
(Arg1
)));
7634 Remove_Address_Interpretations
(First_Op
);
7638 Remove_Address_Interpretations
(Second_Op
);
7641 if not (U1
and U2
) then
7642 Get_First_Interp
(N
, I
, It
);
7643 while Present
(It
.Nam
) loop
7644 if Scope
(It
.Nam
) = Standard_Standard
7645 and then It
.Typ
= Base_Type
(Etype
(Abstract_Op
))
7650 Get_Next_Interp
(I
, It
);
7656 -- If the removal has left no valid interpretations, emit an error
7657 -- message now and label node as illegal.
7659 if Present
(Abstract_Op
) then
7660 Get_First_Interp
(N
, I
, It
);
7664 -- Removal of abstract operation left no viable candidate
7666 Set_Etype
(N
, Any_Type
);
7667 Error_Msg_Sloc
:= Sloc
(Abstract_Op
);
7669 ("cannot call abstract operation& declared#", N
, Abstract_Op
);
7671 -- In Ada 2005, an abstract operation may disable predefined
7672 -- operators. Since the context is not yet known, we mark the
7673 -- predefined operators as potentially hidden. Do not include
7674 -- predefined operators when addresses are involved since this
7675 -- case is handled separately.
7677 elsif Ada_Version
>= Ada_2005
and then not Address_Descendant
then
7678 while Present
(It
.Nam
) loop
7679 if Is_Numeric_Type
(It
.Typ
)
7680 and then Scope
(It
.Typ
) = Standard_Standard
7682 Set_Abstract_Op
(I
, Abstract_Op
);
7685 Get_Next_Interp
(I
, It
);
7690 if Debug_Flag_V
then
7691 Write_Str
("Remove_Abstract_Operations done: ");
7692 Write_Overloads
(N
);
7695 end Remove_Abstract_Operations
;
7697 ----------------------------
7698 -- Try_Container_Indexing --
7699 ----------------------------
7701 function Try_Container_Indexing
7704 Exprs
: List_Id
) return Boolean
7706 Pref_Typ
: constant Entity_Id
:= Etype
(Prefix
);
7708 function Constant_Indexing_OK
return Boolean;
7709 -- Constant_Indexing is legal if there is no Variable_Indexing defined
7710 -- for the type, or else node not a target of assignment, or an actual
7711 -- for an IN OUT or OUT formal (RM 4.1.6 (11)).
7713 function Expr_Matches_In_Formal
7715 Par
: Node_Id
) return Boolean;
7716 -- Find formal corresponding to given indexed component that is an
7717 -- actual in a call. Note that the enclosing subprogram call has not
7718 -- been analyzed yet, and the parameter list is not normalized, so
7719 -- that if the argument is a parameter association we must match it
7720 -- by name and not by position.
7722 function Find_Indexing_Operations
7725 Is_Constant
: Boolean) return Node_Id
;
7726 -- Return a reference to the primitive operation of type T denoted by
7727 -- name Nam. If the operation is overloaded, the reference carries all
7728 -- interpretations. Flag Is_Constant should be set when the context is
7729 -- constant indexing.
7731 --------------------------
7732 -- Constant_Indexing_OK --
7733 --------------------------
7735 function Constant_Indexing_OK
return Boolean is
7739 if No
(Find_Value_Of_Aspect
(Pref_Typ
, Aspect_Variable_Indexing
)) then
7742 elsif not Is_Variable
(Prefix
) then
7747 while Present
(Par
) loop
7748 if Nkind
(Parent
(Par
)) = N_Assignment_Statement
7749 and then Par
= Name
(Parent
(Par
))
7753 -- The call may be overloaded, in which case we assume that its
7754 -- resolution does not depend on the type of the parameter that
7755 -- includes the indexing operation.
7757 elsif Nkind_In
(Parent
(Par
), N_Function_Call
,
7758 N_Procedure_Call_Statement
)
7759 and then Is_Entity_Name
(Name
(Parent
(Par
)))
7765 -- We should look for an interpretation with the proper
7766 -- number of formals, and determine whether it is an
7767 -- In_Parameter, but for now we examine the formal that
7768 -- corresponds to the indexing, and assume that variable
7769 -- indexing is required if some interpretation has an
7770 -- assignable formal at that position. Still does not
7771 -- cover the most complex cases ???
7773 if Is_Overloaded
(Name
(Parent
(Par
))) then
7775 Proc
: constant Node_Id
:= Name
(Parent
(Par
));
7780 Get_First_Interp
(Proc
, I
, It
);
7781 while Present
(It
.Nam
) loop
7782 if not Expr_Matches_In_Formal
(It
.Nam
, Par
) then
7786 Get_Next_Interp
(I
, It
);
7790 -- All interpretations have a matching in-mode formal
7795 Proc
:= Entity
(Name
(Parent
(Par
)));
7797 -- If this is an indirect call, get formals from
7800 if Is_Access_Subprogram_Type
(Etype
(Proc
)) then
7801 Proc
:= Designated_Type
(Etype
(Proc
));
7805 return Expr_Matches_In_Formal
(Proc
, Par
);
7808 elsif Nkind
(Parent
(Par
)) = N_Object_Renaming_Declaration
then
7811 -- If the indexed component is a prefix it may be the first actual
7812 -- of a prefixed call. Retrieve the called entity, if any, and
7813 -- check its first formal. Determine if the context is a procedure
7814 -- or function call.
7816 elsif Nkind
(Parent
(Par
)) = N_Selected_Component
then
7818 Sel
: constant Node_Id
:= Selector_Name
(Parent
(Par
));
7819 Nam
: constant Entity_Id
:= Current_Entity
(Sel
);
7822 if Present
(Nam
) and then Is_Overloadable
(Nam
) then
7823 if Nkind
(Parent
(Parent
(Par
))) =
7824 N_Procedure_Call_Statement
7828 elsif Ekind
(Nam
) = E_Function
7829 and then Present
(First_Formal
(Nam
))
7831 return Ekind
(First_Formal
(Nam
)) = E_In_Parameter
;
7836 elsif Nkind
(Par
) in N_Op
then
7840 Par
:= Parent
(Par
);
7843 -- In all other cases, constant indexing is legal
7846 end Constant_Indexing_OK
;
7848 ----------------------------
7849 -- Expr_Matches_In_Formal --
7850 ----------------------------
7852 function Expr_Matches_In_Formal
7854 Par
: Node_Id
) return Boolean
7860 Formal
:= First_Formal
(Subp
);
7861 Actual
:= First
(Parameter_Associations
((Parent
(Par
))));
7863 if Nkind
(Par
) /= N_Parameter_Association
then
7865 -- Match by position
7867 while Present
(Actual
) and then Present
(Formal
) loop
7868 exit when Actual
= Par
;
7871 if Present
(Formal
) then
7872 Next_Formal
(Formal
);
7874 -- Otherwise this is a parameter mismatch, the error is
7875 -- reported elsewhere, or else variable indexing is implied.
7885 while Present
(Formal
) loop
7886 exit when Chars
(Formal
) = Chars
(Selector_Name
(Par
));
7887 Next_Formal
(Formal
);
7895 return Present
(Formal
) and then Ekind
(Formal
) = E_In_Parameter
;
7896 end Expr_Matches_In_Formal
;
7898 ------------------------------
7899 -- Find_Indexing_Operations --
7900 ------------------------------
7902 function Find_Indexing_Operations
7905 Is_Constant
: Boolean) return Node_Id
7907 procedure Inspect_Declarations
7909 Ref
: in out Node_Id
);
7910 -- Traverse the declarative list where type Typ resides and collect
7911 -- all suitable interpretations in node Ref.
7913 procedure Inspect_Primitives
7915 Ref
: in out Node_Id
);
7916 -- Traverse the list of primitive operations of type Typ and collect
7917 -- all suitable interpretations in node Ref.
7919 function Is_OK_Candidate
7920 (Subp_Id
: Entity_Id
;
7921 Typ
: Entity_Id
) return Boolean;
7922 -- Determine whether subprogram Subp_Id is a suitable indexing
7923 -- operation for type Typ. To qualify as such, the subprogram must
7924 -- be a function, have at least two parameters, and the type of the
7925 -- first parameter must be either Typ, or Typ'Class, or access [to
7926 -- constant] with designated type Typ or Typ'Class.
7928 procedure Record_Interp
(Subp_Id
: Entity_Id
; Ref
: in out Node_Id
);
7929 -- Store subprogram Subp_Id as an interpretation in node Ref
7931 --------------------------
7932 -- Inspect_Declarations --
7933 --------------------------
7935 procedure Inspect_Declarations
7937 Ref
: in out Node_Id
)
7939 Typ_Decl
: constant Node_Id
:= Declaration_Node
(Typ
);
7941 Subp_Id
: Entity_Id
;
7944 -- Ensure that the routine is not called with itypes, which lack a
7945 -- declarative node.
7947 pragma Assert
(Present
(Typ_Decl
));
7948 pragma Assert
(Is_List_Member
(Typ_Decl
));
7950 Decl
:= First
(List_Containing
(Typ_Decl
));
7951 while Present
(Decl
) loop
7952 if Nkind
(Decl
) = N_Subprogram_Declaration
then
7953 Subp_Id
:= Defining_Entity
(Decl
);
7955 if Is_OK_Candidate
(Subp_Id
, Typ
) then
7956 Record_Interp
(Subp_Id
, Ref
);
7962 end Inspect_Declarations
;
7964 ------------------------
7965 -- Inspect_Primitives --
7966 ------------------------
7968 procedure Inspect_Primitives
7970 Ref
: in out Node_Id
)
7972 Prim_Elmt
: Elmt_Id
;
7973 Prim_Id
: Entity_Id
;
7976 Prim_Elmt
:= First_Elmt
(Primitive_Operations
(Typ
));
7977 while Present
(Prim_Elmt
) loop
7978 Prim_Id
:= Node
(Prim_Elmt
);
7980 if Is_OK_Candidate
(Prim_Id
, Typ
) then
7981 Record_Interp
(Prim_Id
, Ref
);
7984 Next_Elmt
(Prim_Elmt
);
7986 end Inspect_Primitives
;
7988 ---------------------
7989 -- Is_OK_Candidate --
7990 ---------------------
7992 function Is_OK_Candidate
7993 (Subp_Id
: Entity_Id
;
7994 Typ
: Entity_Id
) return Boolean
7997 Formal_Typ
: Entity_Id
;
7998 Param_Typ
: Node_Id
;
8001 -- To classify as a suitable candidate, the subprogram must be a
8002 -- function whose name matches the argument of aspect Constant or
8003 -- Variable_Indexing.
8005 if Ekind
(Subp_Id
) = E_Function
and then Chars
(Subp_Id
) = Nam
then
8006 Formal
:= First_Formal
(Subp_Id
);
8008 -- The candidate requires at least two parameters
8010 if Present
(Formal
) and then Present
(Next_Formal
(Formal
)) then
8011 Formal_Typ
:= Empty
;
8012 Param_Typ
:= Parameter_Type
(Parent
(Formal
));
8014 -- Use the designated type when the first parameter is of an
8017 if Nkind
(Param_Typ
) = N_Access_Definition
8018 and then Present
(Subtype_Mark
(Param_Typ
))
8020 -- When the context is a constant indexing, the access
8021 -- definition must be access-to-constant. This does not
8022 -- apply to variable indexing.
8025 or else Constant_Present
(Param_Typ
)
8027 Formal_Typ
:= Etype
(Subtype_Mark
(Param_Typ
));
8030 -- Otherwise use the parameter type
8033 Formal_Typ
:= Etype
(Param_Typ
);
8036 if Present
(Formal_Typ
) then
8038 -- Use the specific type when the parameter type is
8041 if Is_Class_Wide_Type
(Formal_Typ
) then
8042 Formal_Typ
:= Etype
(Base_Type
(Formal_Typ
));
8045 -- Use the full view when the parameter type is private
8048 if Is_Incomplete_Or_Private_Type
(Formal_Typ
)
8049 and then Present
(Full_View
(Formal_Typ
))
8051 Formal_Typ
:= Full_View
(Formal_Typ
);
8054 -- The type of the first parameter must denote the type
8055 -- of the container or acts as its ancestor type.
8059 or else Is_Ancestor
(Formal_Typ
, Typ
);
8065 end Is_OK_Candidate
;
8071 procedure Record_Interp
(Subp_Id
: Entity_Id
; Ref
: in out Node_Id
) is
8073 if Present
(Ref
) then
8074 Add_One_Interp
(Ref
, Subp_Id
, Etype
(Subp_Id
));
8076 -- Otherwise this is the first interpretation. Create a reference
8077 -- where all remaining interpretations will be collected.
8080 Ref
:= New_Occurrence_Of
(Subp_Id
, Sloc
(T
));
8089 -- Start of processing for Find_Indexing_Operations
8094 -- Use the specific type when the parameter type is class-wide
8096 if Is_Class_Wide_Type
(Typ
) then
8097 Typ
:= Root_Type
(Typ
);
8101 Typ
:= Underlying_Type
(Base_Type
(Typ
));
8103 Inspect_Primitives
(Typ
, Ref
);
8105 -- Now look for explicit declarations of an indexing operation.
8106 -- If the type is private the operation may be declared in the
8107 -- visible part that contains the partial view.
8109 if Is_Private_Type
(T
) then
8110 Inspect_Declarations
(T
, Ref
);
8113 Inspect_Declarations
(Typ
, Ref
);
8116 end Find_Indexing_Operations
;
8120 Loc
: constant Source_Ptr
:= Sloc
(N
);
8124 Func_Name
: Node_Id
;
8127 Is_Constant_Indexing
: Boolean := False;
8128 -- This flag reflects the nature of the container indexing. Note that
8129 -- the context may be suited for constant indexing, but the type may
8130 -- lack a Constant_Indexing annotation.
8132 -- Start of processing for Try_Container_Indexing
8135 -- Node may have been analyzed already when testing for a prefixed
8136 -- call, in which case do not redo analysis.
8138 if Present
(Generalized_Indexing
(N
)) then
8144 -- If indexing a class-wide container, obtain indexing primitive from
8147 if Is_Class_Wide_Type
(C_Type
) then
8148 C_Type
:= Etype
(Base_Type
(C_Type
));
8151 -- Check whether the type has a specified indexing aspect
8155 -- The context is suitable for constant indexing, so obtain the name of
8156 -- the indexing function from aspect Constant_Indexing.
8158 if Constant_Indexing_OK
then
8160 Find_Value_Of_Aspect
(Pref_Typ
, Aspect_Constant_Indexing
);
8163 if Present
(Func_Name
) then
8164 Is_Constant_Indexing
:= True;
8166 -- Otherwise attempt variable indexing
8170 Find_Value_Of_Aspect
(Pref_Typ
, Aspect_Variable_Indexing
);
8173 -- The type is not subject to either form of indexing, therefore the
8174 -- indexed component does not denote container indexing. If this is a
8175 -- true error, it is diagnosed by the caller.
8177 if No
(Func_Name
) then
8179 -- The prefix itself may be an indexing of a container. Rewrite it
8180 -- as such and retry.
8182 if Has_Implicit_Dereference
(Pref_Typ
) then
8183 Build_Explicit_Dereference
(Prefix
, First_Discriminant
(Pref_Typ
));
8184 return Try_Container_Indexing
(N
, Prefix
, Exprs
);
8186 -- Otherwise this is definitely not container indexing
8192 -- If the container type is derived from another container type, the
8193 -- value of the inherited aspect is the Reference operation declared
8194 -- for the parent type.
8196 -- However, Reference is also a primitive operation of the type, and the
8197 -- inherited operation has a different signature. We retrieve the right
8198 -- ones (the function may be overloaded) from the list of primitive
8199 -- operations of the derived type.
8201 -- Note that predefined containers are typically all derived from one of
8202 -- the Controlled types. The code below is motivated by containers that
8203 -- are derived from other types with a Reference aspect.
8205 elsif Is_Derived_Type
(C_Type
)
8206 and then Etype
(First_Formal
(Entity
(Func_Name
))) /= Pref_Typ
8209 Find_Indexing_Operations
8211 Nam
=> Chars
(Func_Name
),
8212 Is_Constant
=> Is_Constant_Indexing
);
8215 Assoc
:= New_List
(Relocate_Node
(Prefix
));
8217 -- A generalized indexing may have nore than one index expression, so
8218 -- transfer all of them to the argument list to be used in the call.
8219 -- Note that there may be named associations, in which case the node
8220 -- was rewritten earlier as a call, and has been transformed back into
8221 -- an indexed expression to share the following processing.
8223 -- The generalized indexing node is the one on which analysis and
8224 -- resolution take place. Before expansion the original node is replaced
8225 -- with the generalized indexing node, which is a call, possibly with a
8226 -- dereference operation.
8228 if Comes_From_Source
(N
) then
8229 Check_Compiler_Unit
("generalized indexing", N
);
8232 -- Create argument list for function call that represents generalized
8233 -- indexing. Note that indices (i.e. actuals) may themselves be
8241 Arg
:= First
(Exprs
);
8242 while Present
(Arg
) loop
8243 New_Arg
:= Relocate_Node
(Arg
);
8245 -- The arguments can be parameter associations, in which case the
8246 -- explicit actual parameter carries the overloadings.
8248 if Nkind
(New_Arg
) /= N_Parameter_Association
then
8249 Save_Interps
(Arg
, New_Arg
);
8252 Append
(New_Arg
, Assoc
);
8257 if not Is_Overloaded
(Func_Name
) then
8258 Func
:= Entity
(Func_Name
);
8261 Make_Function_Call
(Loc
,
8262 Name
=> New_Occurrence_Of
(Func
, Loc
),
8263 Parameter_Associations
=> Assoc
);
8265 Set_Parent
(Indexing
, Parent
(N
));
8266 Set_Generalized_Indexing
(N
, Indexing
);
8268 Set_Etype
(N
, Etype
(Indexing
));
8270 -- If the return type of the indexing function is a reference type,
8271 -- add the dereference as a possible interpretation. Note that the
8272 -- indexing aspect may be a function that returns the element type
8273 -- with no intervening implicit dereference, and that the reference
8274 -- discriminant is not the first discriminant.
8276 if Has_Discriminants
(Etype
(Func
)) then
8277 Check_Implicit_Dereference
(N
, Etype
(Func
));
8281 -- If there are multiple indexing functions, build a function call
8282 -- and analyze it for each of the possible interpretations.
8285 Make_Function_Call
(Loc
,
8287 Make_Identifier
(Loc
, Chars
(Func_Name
)),
8288 Parameter_Associations
=> Assoc
);
8289 Set_Parent
(Indexing
, Parent
(N
));
8290 Set_Generalized_Indexing
(N
, Indexing
);
8291 Set_Etype
(N
, Any_Type
);
8292 Set_Etype
(Name
(Indexing
), Any_Type
);
8300 Get_First_Interp
(Func_Name
, I
, It
);
8301 Set_Etype
(Indexing
, Any_Type
);
8303 -- Analyze each candidate function with the given actuals
8305 while Present
(It
.Nam
) loop
8306 Analyze_One_Call
(Indexing
, It
.Nam
, False, Success
);
8307 Get_Next_Interp
(I
, It
);
8310 -- If there are several successful candidates, resolution will
8311 -- be by result. Mark the interpretations of the function name
8314 if Is_Overloaded
(Indexing
) then
8315 Get_First_Interp
(Indexing
, I
, It
);
8317 while Present
(It
.Nam
) loop
8318 Add_One_Interp
(Name
(Indexing
), It
.Nam
, It
.Typ
);
8319 Get_Next_Interp
(I
, It
);
8323 Set_Etype
(Name
(Indexing
), Etype
(Indexing
));
8326 -- Now add the candidate interpretations to the indexing node
8327 -- itself, to be replaced later by the function call.
8329 if Is_Overloaded
(Name
(Indexing
)) then
8330 Get_First_Interp
(Name
(Indexing
), I
, It
);
8332 while Present
(It
.Nam
) loop
8333 Add_One_Interp
(N
, It
.Nam
, It
.Typ
);
8335 -- Add dereference interpretation if the result type has
8336 -- implicit reference discriminants.
8338 if Has_Discriminants
(Etype
(It
.Nam
)) then
8339 Check_Implicit_Dereference
(N
, Etype
(It
.Nam
));
8342 Get_Next_Interp
(I
, It
);
8346 Set_Etype
(N
, Etype
(Name
(Indexing
)));
8347 if Has_Discriminants
(Etype
(N
)) then
8348 Check_Implicit_Dereference
(N
, Etype
(N
));
8354 if Etype
(Indexing
) = Any_Type
then
8356 ("container cannot be indexed with&", N
, Etype
(First
(Exprs
)));
8357 Rewrite
(N
, New_Occurrence_Of
(Any_Id
, Loc
));
8361 end Try_Container_Indexing
;
8363 -----------------------
8364 -- Try_Indirect_Call --
8365 -----------------------
8367 function Try_Indirect_Call
8370 Typ
: Entity_Id
) return Boolean
8376 pragma Warnings
(Off
, Call_OK
);
8379 Normalize_Actuals
(N
, Designated_Type
(Typ
), False, Call_OK
);
8381 Actual
:= First_Actual
(N
);
8382 Formal
:= First_Formal
(Designated_Type
(Typ
));
8383 while Present
(Actual
) and then Present
(Formal
) loop
8384 if not Has_Compatible_Type
(Actual
, Etype
(Formal
)) then
8389 Next_Formal
(Formal
);
8392 if No
(Actual
) and then No
(Formal
) then
8393 Add_One_Interp
(N
, Nam
, Etype
(Designated_Type
(Typ
)));
8395 -- Nam is a candidate interpretation for the name in the call,
8396 -- if it is not an indirect call.
8398 if not Is_Type
(Nam
)
8399 and then Is_Entity_Name
(Name
(N
))
8401 Set_Entity
(Name
(N
), Nam
);
8409 end Try_Indirect_Call
;
8411 ----------------------
8412 -- Try_Indexed_Call --
8413 ----------------------
8415 function Try_Indexed_Call
8419 Skip_First
: Boolean) return Boolean
8421 Loc
: constant Source_Ptr
:= Sloc
(N
);
8422 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
8427 Actual
:= First
(Actuals
);
8429 -- If the call was originally written in prefix form, skip the first
8430 -- actual, which is obviously not defaulted.
8436 Index
:= First_Index
(Typ
);
8437 while Present
(Actual
) and then Present
(Index
) loop
8439 -- If the parameter list has a named association, the expression
8440 -- is definitely a call and not an indexed component.
8442 if Nkind
(Actual
) = N_Parameter_Association
then
8446 if Is_Entity_Name
(Actual
)
8447 and then Is_Type
(Entity
(Actual
))
8448 and then No
(Next
(Actual
))
8450 -- A single actual that is a type name indicates a slice if the
8451 -- type is discrete, and an error otherwise.
8453 if Is_Discrete_Type
(Entity
(Actual
)) then
8457 Make_Function_Call
(Loc
,
8458 Name
=> Relocate_Node
(Name
(N
))),
8460 New_Occurrence_Of
(Entity
(Actual
), Sloc
(Actual
))));
8465 Error_Msg_N
("invalid use of type in expression", Actual
);
8466 Set_Etype
(N
, Any_Type
);
8471 elsif not Has_Compatible_Type
(Actual
, Etype
(Index
)) then
8479 if No
(Actual
) and then No
(Index
) then
8480 Add_One_Interp
(N
, Nam
, Component_Type
(Typ
));
8482 -- Nam is a candidate interpretation for the name in the call,
8483 -- if it is not an indirect call.
8485 if not Is_Type
(Nam
)
8486 and then Is_Entity_Name
(Name
(N
))
8488 Set_Entity
(Name
(N
), Nam
);
8495 end Try_Indexed_Call
;
8497 --------------------------
8498 -- Try_Object_Operation --
8499 --------------------------
8501 function Try_Object_Operation
8502 (N
: Node_Id
; CW_Test_Only
: Boolean := False) return Boolean
8504 K
: constant Node_Kind
:= Nkind
(Parent
(N
));
8505 Is_Subprg_Call
: constant Boolean := K
in N_Subprogram_Call
;
8506 Loc
: constant Source_Ptr
:= Sloc
(N
);
8507 Obj
: constant Node_Id
:= Prefix
(N
);
8509 Subprog
: constant Node_Id
:=
8510 Make_Identifier
(Sloc
(Selector_Name
(N
)),
8511 Chars
=> Chars
(Selector_Name
(N
)));
8512 -- Identifier on which possible interpretations will be collected
8514 Report_Error
: Boolean := False;
8515 -- If no candidate interpretation matches the context, redo analysis
8516 -- with Report_Error True to provide additional information.
8519 Candidate
: Entity_Id
:= Empty
;
8520 New_Call_Node
: Node_Id
:= Empty
;
8521 Node_To_Replace
: Node_Id
;
8522 Obj_Type
: Entity_Id
:= Etype
(Obj
);
8523 Success
: Boolean := False;
8525 procedure Complete_Object_Operation
8526 (Call_Node
: Node_Id
;
8527 Node_To_Replace
: Node_Id
);
8528 -- Make Subprog the name of Call_Node, replace Node_To_Replace with
8529 -- Call_Node, insert the object (or its dereference) as the first actual
8530 -- in the call, and complete the analysis of the call.
8532 procedure Report_Ambiguity
(Op
: Entity_Id
);
8533 -- If a prefixed procedure call is ambiguous, indicate whether the call
8534 -- includes an implicit dereference or an implicit 'Access.
8536 procedure Transform_Object_Operation
8537 (Call_Node
: out Node_Id
;
8538 Node_To_Replace
: out Node_Id
);
8539 -- Transform Obj.Operation (X, Y,,) into Operation (Obj, X, Y ..)
8540 -- Call_Node is the resulting subprogram call, Node_To_Replace is
8541 -- either N or the parent of N, and Subprog is a reference to the
8542 -- subprogram we are trying to match.
8544 function Try_Class_Wide_Operation
8545 (Call_Node
: Node_Id
;
8546 Node_To_Replace
: Node_Id
) return Boolean;
8547 -- Traverse all ancestor types looking for a class-wide subprogram for
8548 -- which the current operation is a valid non-dispatching call.
8550 procedure Try_One_Prefix_Interpretation
(T
: Entity_Id
);
8551 -- If prefix is overloaded, its interpretation may include different
8552 -- tagged types, and we must examine the primitive operations and the
8553 -- class-wide operations of each in order to find candidate
8554 -- interpretations for the call as a whole.
8556 function Try_Primitive_Operation
8557 (Call_Node
: Node_Id
;
8558 Node_To_Replace
: Node_Id
) return Boolean;
8559 -- Traverse the list of primitive subprograms looking for a dispatching
8560 -- operation for which the current node is a valid call.
8562 function Valid_Candidate
8565 Subp
: Entity_Id
) return Entity_Id
;
8566 -- If the subprogram is a valid interpretation, record it, and add to
8567 -- the list of interpretations of Subprog. Otherwise return Empty.
8569 -------------------------------
8570 -- Complete_Object_Operation --
8571 -------------------------------
8573 procedure Complete_Object_Operation
8574 (Call_Node
: Node_Id
;
8575 Node_To_Replace
: Node_Id
)
8577 Control
: constant Entity_Id
:= First_Formal
(Entity
(Subprog
));
8578 Formal_Type
: constant Entity_Id
:= Etype
(Control
);
8579 First_Actual
: Node_Id
;
8582 -- Place the name of the operation, with its interpretations,
8583 -- on the rewritten call.
8585 Set_Name
(Call_Node
, Subprog
);
8587 First_Actual
:= First
(Parameter_Associations
(Call_Node
));
8589 -- For cross-reference purposes, treat the new node as being in the
8590 -- source if the original one is. Set entity and type, even though
8591 -- they may be overwritten during resolution if overloaded.
8593 Set_Comes_From_Source
(Subprog
, Comes_From_Source
(N
));
8594 Set_Comes_From_Source
(Call_Node
, Comes_From_Source
(N
));
8596 if Nkind
(N
) = N_Selected_Component
8597 and then not Inside_A_Generic
8599 Set_Entity
(Selector_Name
(N
), Entity
(Subprog
));
8600 Set_Etype
(Selector_Name
(N
), Etype
(Entity
(Subprog
)));
8603 -- If need be, rewrite first actual as an explicit dereference. If
8604 -- the call is overloaded, the rewriting can only be done once the
8605 -- primitive operation is identified.
8607 if Is_Overloaded
(Subprog
) then
8609 -- The prefix itself may be overloaded, and its interpretations
8610 -- must be propagated to the new actual in the call.
8612 if Is_Overloaded
(Obj
) then
8613 Save_Interps
(Obj
, First_Actual
);
8616 Rewrite
(First_Actual
, Obj
);
8618 elsif not Is_Access_Type
(Formal_Type
)
8619 and then Is_Access_Type
(Etype
(Obj
))
8621 Rewrite
(First_Actual
,
8622 Make_Explicit_Dereference
(Sloc
(Obj
), Obj
));
8623 Analyze
(First_Actual
);
8625 -- If we need to introduce an explicit dereference, verify that
8626 -- the resulting actual is compatible with the mode of the formal.
8628 if Ekind
(First_Formal
(Entity
(Subprog
))) /= E_In_Parameter
8629 and then Is_Access_Constant
(Etype
(Obj
))
8632 ("expect variable in call to&", Prefix
(N
), Entity
(Subprog
));
8635 -- Conversely, if the formal is an access parameter and the object is
8636 -- not an access type or a reference type (i.e. a type with the
8637 -- Implicit_Dereference aspect specified), replace the actual with a
8638 -- 'Access reference. Its analysis will check that the object is
8641 elsif Is_Access_Type
(Formal_Type
)
8642 and then not Is_Access_Type
(Etype
(Obj
))
8644 (not Has_Implicit_Dereference
(Etype
(Obj
))
8646 not Is_Access_Type
(Designated_Type
(Etype
8647 (Get_Reference_Discriminant
(Etype
(Obj
))))))
8649 -- A special case: A.all'Access is illegal if A is an access to a
8650 -- constant and the context requires an access to a variable.
8652 if not Is_Access_Constant
(Formal_Type
) then
8653 if (Nkind
(Obj
) = N_Explicit_Dereference
8654 and then Is_Access_Constant
(Etype
(Prefix
(Obj
))))
8655 or else not Is_Variable
(Obj
)
8658 ("actual for & must be a variable", Obj
, Control
);
8662 Rewrite
(First_Actual
,
8663 Make_Attribute_Reference
(Loc
,
8664 Attribute_Name
=> Name_Access
,
8665 Prefix
=> Relocate_Node
(Obj
)));
8667 -- If the object is not overloaded verify that taking access of
8668 -- it is legal. Otherwise check is made during resolution.
8670 if not Is_Overloaded
(Obj
)
8671 and then not Is_Aliased_View
(Obj
)
8674 ("object in prefixed call to & must be aliased "
8675 & "(RM 4.1.3 (13 1/2))", Prefix
(First_Actual
), Subprog
);
8678 Analyze
(First_Actual
);
8681 if Is_Overloaded
(Obj
) then
8682 Save_Interps
(Obj
, First_Actual
);
8685 Rewrite
(First_Actual
, Obj
);
8688 -- The operation is obtained from the dispatch table and not by
8689 -- visibility, and may be declared in a unit that is not explicitly
8690 -- referenced in the source, but is nevertheless required in the
8691 -- context of the current unit. Indicate that operation and its scope
8692 -- are referenced, to prevent spurious and misleading warnings. If
8693 -- the operation is overloaded, all primitives are in the same scope
8694 -- and we can use any of them.
8696 Set_Referenced
(Entity
(Subprog
), True);
8697 Set_Referenced
(Scope
(Entity
(Subprog
)), True);
8699 Rewrite
(Node_To_Replace
, Call_Node
);
8701 -- Propagate the interpretations collected in subprog to the new
8702 -- function call node, to be resolved from context.
8704 if Is_Overloaded
(Subprog
) then
8705 Save_Interps
(Subprog
, Node_To_Replace
);
8708 -- The type of the subprogram may be a limited view obtained
8709 -- transitively from another unit. If full view is available,
8710 -- use it to analyze call. If there is no nonlimited view, then
8711 -- this is diagnosed when analyzing the rewritten call.
8714 T
: constant Entity_Id
:= Etype
(Subprog
);
8716 if From_Limited_With
(T
) then
8717 Set_Etype
(Entity
(Subprog
), Available_View
(T
));
8721 Analyze
(Node_To_Replace
);
8723 -- If the operation has been rewritten into a call, which may get
8724 -- subsequently an explicit dereference, preserve the type on the
8725 -- original node (selected component or indexed component) for
8726 -- subsequent legality tests, e.g. Is_Variable. which examines
8727 -- the original node.
8729 if Nkind
(Node_To_Replace
) = N_Function_Call
then
8731 (Original_Node
(Node_To_Replace
), Etype
(Node_To_Replace
));
8734 end Complete_Object_Operation
;
8736 ----------------------
8737 -- Report_Ambiguity --
8738 ----------------------
8740 procedure Report_Ambiguity
(Op
: Entity_Id
) is
8741 Access_Actual
: constant Boolean :=
8742 Is_Access_Type
(Etype
(Prefix
(N
)));
8743 Access_Formal
: Boolean := False;
8746 Error_Msg_Sloc
:= Sloc
(Op
);
8748 if Present
(First_Formal
(Op
)) then
8749 Access_Formal
:= Is_Access_Type
(Etype
(First_Formal
(Op
)));
8752 if Access_Formal
and then not Access_Actual
then
8753 if Nkind
(Parent
(Op
)) = N_Full_Type_Declaration
then
8755 ("\possible interpretation "
8756 & "(inherited, with implicit 'Access) #", N
);
8759 ("\possible interpretation (with implicit 'Access) #", N
);
8762 elsif not Access_Formal
and then Access_Actual
then
8763 if Nkind
(Parent
(Op
)) = N_Full_Type_Declaration
then
8765 ("\possible interpretation "
8766 & "(inherited, with implicit dereference) #", N
);
8769 ("\possible interpretation (with implicit dereference) #", N
);
8773 if Nkind
(Parent
(Op
)) = N_Full_Type_Declaration
then
8774 Error_Msg_N
("\possible interpretation (inherited)#", N
);
8776 Error_Msg_N
-- CODEFIX
8777 ("\possible interpretation#", N
);
8780 end Report_Ambiguity
;
8782 --------------------------------
8783 -- Transform_Object_Operation --
8784 --------------------------------
8786 procedure Transform_Object_Operation
8787 (Call_Node
: out Node_Id
;
8788 Node_To_Replace
: out Node_Id
)
8790 Dummy
: constant Node_Id
:= New_Copy
(Obj
);
8791 -- Placeholder used as a first parameter in the call, replaced
8792 -- eventually by the proper object.
8794 Parent_Node
: constant Node_Id
:= Parent
(N
);
8800 -- Obj may already have been rewritten if it involves an implicit
8801 -- dereference (e.g. if it is an access to a limited view). Preserve
8802 -- a link to the original node for ASIS use.
8804 if not Comes_From_Source
(Obj
) then
8805 Set_Original_Node
(Dummy
, Original_Node
(Obj
));
8808 -- Common case covering 1) Call to a procedure and 2) Call to a
8809 -- function that has some additional actuals.
8811 if Nkind
(Parent_Node
) in N_Subprogram_Call
8813 -- N is a selected component node containing the name of the
8814 -- subprogram. If N is not the name of the parent node we must
8815 -- not replace the parent node by the new construct. This case
8816 -- occurs when N is a parameterless call to a subprogram that
8817 -- is an actual parameter of a call to another subprogram. For
8819 -- Some_Subprogram (..., Obj.Operation, ...)
8821 and then Name
(Parent_Node
) = N
8823 Node_To_Replace
:= Parent_Node
;
8825 Actuals
:= Parameter_Associations
(Parent_Node
);
8827 if Present
(Actuals
) then
8828 Prepend
(Dummy
, Actuals
);
8830 Actuals
:= New_List
(Dummy
);
8833 if Nkind
(Parent_Node
) = N_Procedure_Call_Statement
then
8835 Make_Procedure_Call_Statement
(Loc
,
8836 Name
=> New_Copy
(Subprog
),
8837 Parameter_Associations
=> Actuals
);
8841 Make_Function_Call
(Loc
,
8842 Name
=> New_Copy
(Subprog
),
8843 Parameter_Associations
=> Actuals
);
8846 -- Before analysis, a function call appears as an indexed component
8847 -- if there are no named associations.
8849 elsif Nkind
(Parent_Node
) = N_Indexed_Component
8850 and then N
= Prefix
(Parent_Node
)
8852 Node_To_Replace
:= Parent_Node
;
8853 Actuals
:= Expressions
(Parent_Node
);
8855 Actual
:= First
(Actuals
);
8856 while Present
(Actual
) loop
8861 Prepend
(Dummy
, Actuals
);
8864 Make_Function_Call
(Loc
,
8865 Name
=> New_Copy
(Subprog
),
8866 Parameter_Associations
=> Actuals
);
8868 -- Parameterless call: Obj.F is rewritten as F (Obj)
8871 Node_To_Replace
:= N
;
8874 Make_Function_Call
(Loc
,
8875 Name
=> New_Copy
(Subprog
),
8876 Parameter_Associations
=> New_List
(Dummy
));
8878 end Transform_Object_Operation
;
8880 ------------------------------
8881 -- Try_Class_Wide_Operation --
8882 ------------------------------
8884 function Try_Class_Wide_Operation
8885 (Call_Node
: Node_Id
;
8886 Node_To_Replace
: Node_Id
) return Boolean
8888 Anc_Type
: Entity_Id
;
8889 Matching_Op
: Entity_Id
:= Empty
;
8892 procedure Traverse_Homonyms
8893 (Anc_Type
: Entity_Id
;
8894 Error
: out Boolean);
8895 -- Traverse the homonym chain of the subprogram searching for those
8896 -- homonyms whose first formal has the Anc_Type's class-wide type,
8897 -- or an anonymous access type designating the class-wide type. If
8898 -- an ambiguity is detected, then Error is set to True.
8900 procedure Traverse_Interfaces
8901 (Anc_Type
: Entity_Id
;
8902 Error
: out Boolean);
8903 -- Traverse the list of interfaces, if any, associated with Anc_Type
8904 -- and search for acceptable class-wide homonyms associated with each
8905 -- interface. If an ambiguity is detected, then Error is set to True.
8907 -----------------------
8908 -- Traverse_Homonyms --
8909 -----------------------
8911 procedure Traverse_Homonyms
8912 (Anc_Type
: Entity_Id
;
8913 Error
: out Boolean)
8915 Cls_Type
: Entity_Id
;
8923 Cls_Type
:= Class_Wide_Type
(Anc_Type
);
8925 Hom
:= Current_Entity
(Subprog
);
8927 -- Find a non-hidden operation whose first parameter is of the
8928 -- class-wide type, a subtype thereof, or an anonymous access
8929 -- to same. If in an instance, the operation can be considered
8930 -- even if hidden (it may be hidden because the instantiation
8931 -- is expanded after the containing package has been analyzed).
8933 while Present
(Hom
) loop
8934 if Ekind_In
(Hom
, E_Procedure
, E_Function
)
8935 and then (not Is_Hidden
(Hom
) or else In_Instance
)
8936 and then Scope
(Hom
) = Scope
(Base_Type
(Anc_Type
))
8937 and then Present
(First_Formal
(Hom
))
8939 (Base_Type
(Etype
(First_Formal
(Hom
))) = Cls_Type
8941 (Is_Access_Type
(Etype
(First_Formal
(Hom
)))
8943 Ekind
(Etype
(First_Formal
(Hom
))) =
8944 E_Anonymous_Access_Type
8947 (Designated_Type
(Etype
(First_Formal
(Hom
)))) =
8950 -- If the context is a procedure call, ignore functions
8951 -- in the name of the call.
8953 if Ekind
(Hom
) = E_Function
8954 and then Nkind
(Parent
(N
)) = N_Procedure_Call_Statement
8955 and then N
= Name
(Parent
(N
))
8959 -- If the context is a function call, ignore procedures
8960 -- in the name of the call.
8962 elsif Ekind
(Hom
) = E_Procedure
8963 and then Nkind
(Parent
(N
)) /= N_Procedure_Call_Statement
8968 Set_Etype
(Call_Node
, Any_Type
);
8969 Set_Is_Overloaded
(Call_Node
, False);
8972 if No
(Matching_Op
) then
8973 Hom_Ref
:= New_Occurrence_Of
(Hom
, Sloc
(Subprog
));
8974 Set_Etype
(Call_Node
, Any_Type
);
8975 Set_Parent
(Call_Node
, Parent
(Node_To_Replace
));
8977 Set_Name
(Call_Node
, Hom_Ref
);
8982 Report
=> Report_Error
,
8984 Skip_First
=> True);
8987 Valid_Candidate
(Success
, Call_Node
, Hom
);
8993 Report
=> Report_Error
,
8995 Skip_First
=> True);
8997 -- The same operation may be encountered on two homonym
8998 -- traversals, before and after looking at interfaces.
8999 -- Check for this case before reporting a real ambiguity.
9001 if Present
(Valid_Candidate
(Success
, Call_Node
, Hom
))
9002 and then Nkind
(Call_Node
) /= N_Function_Call
9003 and then Hom
/= Matching_Op
9005 Error_Msg_NE
("ambiguous call to&", N
, Hom
);
9006 Report_Ambiguity
(Matching_Op
);
9007 Report_Ambiguity
(Hom
);
9015 Hom
:= Homonym
(Hom
);
9017 end Traverse_Homonyms
;
9019 -------------------------
9020 -- Traverse_Interfaces --
9021 -------------------------
9023 procedure Traverse_Interfaces
9024 (Anc_Type
: Entity_Id
;
9025 Error
: out Boolean)
9027 Intface_List
: constant List_Id
:=
9028 Abstract_Interface_List
(Anc_Type
);
9034 if Is_Non_Empty_List
(Intface_List
) then
9035 Intface
:= First
(Intface_List
);
9036 while Present
(Intface
) loop
9038 -- Look for acceptable class-wide homonyms associated with
9041 Traverse_Homonyms
(Etype
(Intface
), Error
);
9047 -- Continue the search by looking at each of the interface's
9048 -- associated interface ancestors.
9050 Traverse_Interfaces
(Etype
(Intface
), Error
);
9059 end Traverse_Interfaces
;
9061 -- Start of processing for Try_Class_Wide_Operation
9064 -- If we are searching only for conflicting class-wide subprograms
9065 -- then initialize directly Matching_Op with the target entity.
9067 if CW_Test_Only
then
9068 Matching_Op
:= Entity
(Selector_Name
(N
));
9071 -- Loop through ancestor types (including interfaces), traversing
9072 -- the homonym chain of the subprogram, trying out those homonyms
9073 -- whose first formal has the class-wide type of the ancestor, or
9074 -- an anonymous access type designating the class-wide type.
9076 Anc_Type
:= Obj_Type
;
9078 -- Look for a match among homonyms associated with the ancestor
9080 Traverse_Homonyms
(Anc_Type
, Error
);
9086 -- Continue the search for matches among homonyms associated with
9087 -- any interfaces implemented by the ancestor.
9089 Traverse_Interfaces
(Anc_Type
, Error
);
9095 exit when Etype
(Anc_Type
) = Anc_Type
;
9096 Anc_Type
:= Etype
(Anc_Type
);
9099 if Present
(Matching_Op
) then
9100 Set_Etype
(Call_Node
, Etype
(Matching_Op
));
9103 return Present
(Matching_Op
);
9104 end Try_Class_Wide_Operation
;
9106 -----------------------------------
9107 -- Try_One_Prefix_Interpretation --
9108 -----------------------------------
9110 procedure Try_One_Prefix_Interpretation
(T
: Entity_Id
) is
9111 Prev_Obj_Type
: constant Entity_Id
:= Obj_Type
;
9112 -- If the interpretation does not have a valid candidate type,
9113 -- preserve current value of Obj_Type for subsequent errors.
9118 if Is_Access_Type
(Obj_Type
) then
9119 Obj_Type
:= Designated_Type
(Obj_Type
);
9122 if Ekind_In
(Obj_Type
, E_Private_Subtype
,
9123 E_Record_Subtype_With_Private
)
9125 Obj_Type
:= Base_Type
(Obj_Type
);
9128 if Is_Class_Wide_Type
(Obj_Type
) then
9129 Obj_Type
:= Etype
(Class_Wide_Type
(Obj_Type
));
9132 -- The type may have be obtained through a limited_with clause,
9133 -- in which case the primitive operations are available on its
9134 -- nonlimited view. If still incomplete, retrieve full view.
9136 if Ekind
(Obj_Type
) = E_Incomplete_Type
9137 and then From_Limited_With
(Obj_Type
)
9138 and then Has_Non_Limited_View
(Obj_Type
)
9140 Obj_Type
:= Get_Full_View
(Non_Limited_View
(Obj_Type
));
9143 -- If the object is not tagged, or the type is still an incomplete
9144 -- type, this is not a prefixed call. Restore the previous type as
9145 -- the current one is not a legal candidate.
9147 if not Is_Tagged_Type
(Obj_Type
)
9148 or else Is_Incomplete_Type
(Obj_Type
)
9150 Obj_Type
:= Prev_Obj_Type
;
9155 Dup_Call_Node
: constant Node_Id
:= New_Copy
(New_Call_Node
);
9157 Prim_Result
: Boolean := False;
9160 if not CW_Test_Only
then
9162 Try_Primitive_Operation
9163 (Call_Node
=> New_Call_Node
,
9164 Node_To_Replace
=> Node_To_Replace
);
9167 -- Check if there is a class-wide subprogram covering the
9168 -- primitive. This check must be done even if a candidate
9169 -- was found in order to report ambiguous calls.
9171 if not Prim_Result
then
9173 Try_Class_Wide_Operation
9174 (Call_Node
=> New_Call_Node
,
9175 Node_To_Replace
=> Node_To_Replace
);
9177 -- If we found a primitive we search for class-wide subprograms
9178 -- using a duplicate of the call node (done to avoid missing its
9179 -- decoration if there is no ambiguity).
9183 Try_Class_Wide_Operation
9184 (Call_Node
=> Dup_Call_Node
,
9185 Node_To_Replace
=> Node_To_Replace
);
9188 end Try_One_Prefix_Interpretation
;
9190 -----------------------------
9191 -- Try_Primitive_Operation --
9192 -----------------------------
9194 function Try_Primitive_Operation
9195 (Call_Node
: Node_Id
;
9196 Node_To_Replace
: Node_Id
) return Boolean
9199 Prim_Op
: Entity_Id
;
9200 Matching_Op
: Entity_Id
:= Empty
;
9201 Prim_Op_Ref
: Node_Id
:= Empty
;
9203 Corr_Type
: Entity_Id
:= Empty
;
9204 -- If the prefix is a synchronized type, the controlling type of
9205 -- the primitive operation is the corresponding record type, else
9206 -- this is the object type itself.
9208 Success
: Boolean := False;
9210 function Collect_Generic_Type_Ops
(T
: Entity_Id
) return Elist_Id
;
9211 -- For tagged types the candidate interpretations are found in
9212 -- the list of primitive operations of the type and its ancestors.
9213 -- For formal tagged types we have to find the operations declared
9214 -- in the same scope as the type (including in the generic formal
9215 -- part) because the type itself carries no primitive operations,
9216 -- except for formal derived types that inherit the operations of
9217 -- the parent and progenitors.
9219 -- If the context is a generic subprogram body, the generic formals
9220 -- are visible by name, but are not in the entity list of the
9221 -- subprogram because that list starts with the subprogram formals.
9222 -- We retrieve the candidate operations from the generic declaration.
9224 function Extended_Primitive_Ops
(T
: Entity_Id
) return Elist_Id
;
9225 -- Prefix notation can also be used on operations that are not
9226 -- primitives of the type, but are declared in the same immediate
9227 -- declarative part, which can only mean the corresponding package
9228 -- body (See RM 4.1.3 (9.2/3)). If we are in that body we extend the
9229 -- list of primitives with body operations with the same name that
9230 -- may be candidates, so that Try_Primitive_Operations can examine
9231 -- them if no real primitive is found.
9233 function Is_Private_Overriding
(Op
: Entity_Id
) return Boolean;
9234 -- An operation that overrides an inherited operation in the private
9235 -- part of its package may be hidden, but if the inherited operation
9236 -- is visible a direct call to it will dispatch to the private one,
9237 -- which is therefore a valid candidate.
9239 function Names_Match
9240 (Obj_Type
: Entity_Id
;
9241 Prim_Op
: Entity_Id
;
9242 Subprog
: Entity_Id
) return Boolean;
9243 -- Return True if the names of Prim_Op and Subprog match. If Obj_Type
9244 -- is a protected type then compare also the original name of Prim_Op
9245 -- with the name of Subprog (since the expander may have added a
9246 -- prefix to its original name --see Exp_Ch9.Build_Selected_Name).
9248 function Valid_First_Argument_Of
(Op
: Entity_Id
) return Boolean;
9249 -- Verify that the prefix, dereferenced if need be, is a valid
9250 -- controlling argument in a call to Op. The remaining actuals
9251 -- are checked in the subsequent call to Analyze_One_Call.
9253 ------------------------------
9254 -- Collect_Generic_Type_Ops --
9255 ------------------------------
9257 function Collect_Generic_Type_Ops
(T
: Entity_Id
) return Elist_Id
is
9258 Bas
: constant Entity_Id
:= Base_Type
(T
);
9259 Candidates
: constant Elist_Id
:= New_Elmt_List
;
9263 procedure Check_Candidate
;
9264 -- The operation is a candidate if its first parameter is a
9265 -- controlling operand of the desired type.
9267 -----------------------
9268 -- Check_Candidate; --
9269 -----------------------
9271 procedure Check_Candidate
is
9273 Formal
:= First_Formal
(Subp
);
9276 and then Is_Controlling_Formal
(Formal
)
9278 (Base_Type
(Etype
(Formal
)) = Bas
9280 (Is_Access_Type
(Etype
(Formal
))
9281 and then Designated_Type
(Etype
(Formal
)) = Bas
))
9283 Append_Elmt
(Subp
, Candidates
);
9285 end Check_Candidate
;
9287 -- Start of processing for Collect_Generic_Type_Ops
9290 if Is_Derived_Type
(T
) then
9291 return Primitive_Operations
(T
);
9293 elsif Ekind_In
(Scope
(T
), E_Procedure
, E_Function
) then
9295 -- Scan the list of generic formals to find subprograms
9296 -- that may have a first controlling formal of the type.
9298 if Nkind
(Unit_Declaration_Node
(Scope
(T
))) =
9299 N_Generic_Subprogram_Declaration
9306 First
(Generic_Formal_Declarations
9307 (Unit_Declaration_Node
(Scope
(T
))));
9308 while Present
(Decl
) loop
9309 if Nkind
(Decl
) in N_Formal_Subprogram_Declaration
then
9310 Subp
:= Defining_Entity
(Decl
);
9321 -- Scan the list of entities declared in the same scope as
9322 -- the type. In general this will be an open scope, given that
9323 -- the call we are analyzing can only appear within a generic
9324 -- declaration or body (either the one that declares T, or a
9327 -- For a subtype representing a generic actual type, go to the
9330 if Is_Generic_Actual_Type
(T
) then
9331 Subp
:= First_Entity
(Scope
(Base_Type
(T
)));
9333 Subp
:= First_Entity
(Scope
(T
));
9336 while Present
(Subp
) loop
9337 if Is_Overloadable
(Subp
) then
9346 end Collect_Generic_Type_Ops
;
9348 ----------------------------
9349 -- Extended_Primitive_Ops --
9350 ----------------------------
9352 function Extended_Primitive_Ops
(T
: Entity_Id
) return Elist_Id
is
9353 Type_Scope
: constant Entity_Id
:= Scope
(T
);
9355 Body_Decls
: List_Id
;
9361 Op_List
:= Primitive_Operations
(T
);
9363 if Ekind
(Type_Scope
) = E_Package
9364 and then In_Package_Body
(Type_Scope
)
9365 and then In_Open_Scopes
(Type_Scope
)
9367 -- Retrieve list of declarations of package body.
9371 (Unit_Declaration_Node
9373 (Unit_Declaration_Node
(Type_Scope
))));
9375 Op
:= Current_Entity
(Subprog
);
9377 while Present
(Op
) loop
9378 if Comes_From_Source
(Op
)
9379 and then Is_Overloadable
(Op
)
9381 -- Exclude overriding primitive operations of a type
9382 -- extension declared in the package body, to prevent
9383 -- duplicates in extended list.
9385 and then not Is_Primitive
(Op
)
9386 and then Is_List_Member
(Unit_Declaration_Node
(Op
))
9387 and then List_Containing
(Unit_Declaration_Node
(Op
)) =
9390 if not Op_Found
then
9392 -- Copy list of primitives so it is not affected for
9395 Op_List
:= New_Copy_Elist
(Op_List
);
9399 Append_Elmt
(Op
, Op_List
);
9407 end Extended_Primitive_Ops
;
9409 ---------------------------
9410 -- Is_Private_Overriding --
9411 ---------------------------
9413 function Is_Private_Overriding
(Op
: Entity_Id
) return Boolean is
9414 Visible_Op
: constant Entity_Id
:= Homonym
(Op
);
9417 return Present
(Visible_Op
)
9418 and then Scope
(Op
) = Scope
(Visible_Op
)
9419 and then not Comes_From_Source
(Visible_Op
)
9420 and then Alias
(Visible_Op
) = Op
9421 and then not Is_Hidden
(Visible_Op
);
9422 end Is_Private_Overriding
;
9428 function Names_Match
9429 (Obj_Type
: Entity_Id
;
9430 Prim_Op
: Entity_Id
;
9431 Subprog
: Entity_Id
) return Boolean is
9433 -- Common case: exact match
9435 if Chars
(Prim_Op
) = Chars
(Subprog
) then
9438 -- For protected type primitives the expander may have built the
9439 -- name of the dispatching primitive prepending the type name to
9440 -- avoid conflicts with the name of the protected subprogram (see
9441 -- Exp_Ch9.Build_Selected_Name).
9443 elsif Is_Protected_Type
(Obj_Type
) then
9445 Present
(Original_Protected_Subprogram
(Prim_Op
))
9446 and then Chars
(Original_Protected_Subprogram
(Prim_Op
)) =
9453 -----------------------------
9454 -- Valid_First_Argument_Of --
9455 -----------------------------
9457 function Valid_First_Argument_Of
(Op
: Entity_Id
) return Boolean is
9458 Typ
: Entity_Id
:= Etype
(First_Formal
(Op
));
9461 if Is_Concurrent_Type
(Typ
)
9462 and then Present
(Corresponding_Record_Type
(Typ
))
9464 Typ
:= Corresponding_Record_Type
(Typ
);
9467 -- Simple case. Object may be a subtype of the tagged type or may
9468 -- be the corresponding record of a synchronized type.
9470 return Obj_Type
= Typ
9471 or else Base_Type
(Obj_Type
) = Typ
9472 or else Corr_Type
= Typ
9474 -- Object may be of a derived type whose parent has unknown
9475 -- discriminants, in which case the type matches the underlying
9476 -- record view of its base.
9479 (Has_Unknown_Discriminants
(Typ
)
9480 and then Typ
= Underlying_Record_View
(Base_Type
(Obj_Type
)))
9482 -- Prefix can be dereferenced
9485 (Is_Access_Type
(Corr_Type
)
9486 and then Designated_Type
(Corr_Type
) = Typ
)
9488 -- Formal is an access parameter, for which the object can
9489 -- provide an access.
9492 (Ekind
(Typ
) = E_Anonymous_Access_Type
9494 Base_Type
(Designated_Type
(Typ
)) = Base_Type
(Corr_Type
));
9495 end Valid_First_Argument_Of
;
9497 -- Start of processing for Try_Primitive_Operation
9500 -- Look for subprograms in the list of primitive operations. The name
9501 -- must be identical, and the kind of call indicates the expected
9502 -- kind of operation (function or procedure). If the type is a
9503 -- (tagged) synchronized type, the primitive ops are attached to the
9504 -- corresponding record (base) type.
9506 if Is_Concurrent_Type
(Obj_Type
) then
9507 if Present
(Corresponding_Record_Type
(Obj_Type
)) then
9508 Corr_Type
:= Base_Type
(Corresponding_Record_Type
(Obj_Type
));
9509 Elmt
:= First_Elmt
(Primitive_Operations
(Corr_Type
));
9511 Corr_Type
:= Obj_Type
;
9512 Elmt
:= First_Elmt
(Collect_Generic_Type_Ops
(Obj_Type
));
9515 elsif not Is_Generic_Type
(Obj_Type
) then
9516 Corr_Type
:= Obj_Type
;
9517 Elmt
:= First_Elmt
(Extended_Primitive_Ops
(Obj_Type
));
9520 Corr_Type
:= Obj_Type
;
9521 Elmt
:= First_Elmt
(Collect_Generic_Type_Ops
(Obj_Type
));
9524 while Present
(Elmt
) loop
9525 Prim_Op
:= Node
(Elmt
);
9527 if Names_Match
(Obj_Type
, Prim_Op
, Subprog
)
9528 and then Present
(First_Formal
(Prim_Op
))
9529 and then Valid_First_Argument_Of
(Prim_Op
)
9531 (Nkind
(Call_Node
) = N_Function_Call
)
9533 (Ekind
(Prim_Op
) = E_Function
)
9535 -- Ada 2005 (AI-251): If this primitive operation corresponds
9536 -- to an immediate ancestor interface there is no need to add
9537 -- it to the list of interpretations; the corresponding aliased
9538 -- primitive is also in this list of primitive operations and
9539 -- will be used instead.
9541 if (Present
(Interface_Alias
(Prim_Op
))
9542 and then Is_Ancestor
(Find_Dispatching_Type
9543 (Alias
(Prim_Op
)), Corr_Type
))
9545 -- Do not consider hidden primitives unless the type is in an
9546 -- open scope or we are within an instance, where visibility
9547 -- is known to be correct, or else if this is an overriding
9548 -- operation in the private part for an inherited operation.
9550 or else (Is_Hidden
(Prim_Op
)
9551 and then not Is_Immediately_Visible
(Obj_Type
)
9552 and then not In_Instance
9553 and then not Is_Private_Overriding
(Prim_Op
))
9558 Set_Etype
(Call_Node
, Any_Type
);
9559 Set_Is_Overloaded
(Call_Node
, False);
9561 if No
(Matching_Op
) then
9562 Prim_Op_Ref
:= New_Occurrence_Of
(Prim_Op
, Sloc
(Subprog
));
9563 Candidate
:= Prim_Op
;
9565 Set_Parent
(Call_Node
, Parent
(Node_To_Replace
));
9567 Set_Name
(Call_Node
, Prim_Op_Ref
);
9573 Report
=> Report_Error
,
9575 Skip_First
=> True);
9577 Matching_Op
:= Valid_Candidate
(Success
, Call_Node
, Prim_Op
);
9579 -- More than one interpretation, collect for subsequent
9580 -- disambiguation. If this is a procedure call and there
9581 -- is another match, report ambiguity now.
9587 Report
=> Report_Error
,
9589 Skip_First
=> True);
9591 if Present
(Valid_Candidate
(Success
, Call_Node
, Prim_Op
))
9592 and then Nkind
(Call_Node
) /= N_Function_Call
9594 Error_Msg_NE
("ambiguous call to&", N
, Prim_Op
);
9595 Report_Ambiguity
(Matching_Op
);
9596 Report_Ambiguity
(Prim_Op
);
9606 if Present
(Matching_Op
) then
9607 Set_Etype
(Call_Node
, Etype
(Matching_Op
));
9610 return Present
(Matching_Op
);
9611 end Try_Primitive_Operation
;
9613 ---------------------
9614 -- Valid_Candidate --
9615 ---------------------
9617 function Valid_Candidate
9620 Subp
: Entity_Id
) return Entity_Id
9622 Arr_Type
: Entity_Id
;
9623 Comp_Type
: Entity_Id
;
9626 -- If the subprogram is a valid interpretation, record it in global
9627 -- variable Subprog, to collect all possible overloadings.
9630 if Subp
/= Entity
(Subprog
) then
9631 Add_One_Interp
(Subprog
, Subp
, Etype
(Subp
));
9635 -- If the call may be an indexed call, retrieve component type of
9636 -- resulting expression, and add possible interpretation.
9641 if Nkind
(Call
) = N_Function_Call
9642 and then Nkind
(Parent
(N
)) = N_Indexed_Component
9643 and then Needs_One_Actual
(Subp
)
9645 if Is_Array_Type
(Etype
(Subp
)) then
9646 Arr_Type
:= Etype
(Subp
);
9648 elsif Is_Access_Type
(Etype
(Subp
))
9649 and then Is_Array_Type
(Designated_Type
(Etype
(Subp
)))
9651 Arr_Type
:= Designated_Type
(Etype
(Subp
));
9655 if Present
(Arr_Type
) then
9657 -- Verify that the actuals (excluding the object) match the types
9665 Actual
:= Next
(First_Actual
(Call
));
9666 Index
:= First_Index
(Arr_Type
);
9667 while Present
(Actual
) and then Present
(Index
) loop
9668 if not Has_Compatible_Type
(Actual
, Etype
(Index
)) then
9673 Next_Actual
(Actual
);
9679 and then Present
(Arr_Type
)
9681 Comp_Type
:= Component_Type
(Arr_Type
);
9685 if Present
(Comp_Type
)
9686 and then Etype
(Subprog
) /= Comp_Type
9688 Add_One_Interp
(Subprog
, Subp
, Comp_Type
);
9692 if Etype
(Call
) /= Any_Type
then
9697 end Valid_Candidate
;
9699 -- Start of processing for Try_Object_Operation
9702 Analyze_Expression
(Obj
);
9704 -- Analyze the actuals if node is known to be a subprogram call
9706 if Is_Subprg_Call
and then N
= Name
(Parent
(N
)) then
9707 Actual
:= First
(Parameter_Associations
(Parent
(N
)));
9708 while Present
(Actual
) loop
9709 Analyze_Expression
(Actual
);
9714 -- Build a subprogram call node, using a copy of Obj as its first
9715 -- actual. This is a placeholder, to be replaced by an explicit
9716 -- dereference when needed.
9718 Transform_Object_Operation
9719 (Call_Node
=> New_Call_Node
,
9720 Node_To_Replace
=> Node_To_Replace
);
9722 Set_Etype
(New_Call_Node
, Any_Type
);
9723 Set_Etype
(Subprog
, Any_Type
);
9724 Set_Parent
(New_Call_Node
, Parent
(Node_To_Replace
));
9726 if not Is_Overloaded
(Obj
) then
9727 Try_One_Prefix_Interpretation
(Obj_Type
);
9734 Get_First_Interp
(Obj
, I
, It
);
9735 while Present
(It
.Nam
) loop
9736 Try_One_Prefix_Interpretation
(It
.Typ
);
9737 Get_Next_Interp
(I
, It
);
9742 if Etype
(New_Call_Node
) /= Any_Type
then
9744 -- No need to complete the tree transformations if we are only
9745 -- searching for conflicting class-wide subprograms
9747 if CW_Test_Only
then
9750 Complete_Object_Operation
9751 (Call_Node
=> New_Call_Node
,
9752 Node_To_Replace
=> Node_To_Replace
);
9756 elsif Present
(Candidate
) then
9758 -- The argument list is not type correct. Re-analyze with error
9759 -- reporting enabled, and use one of the possible candidates.
9760 -- In All_Errors_Mode, re-analyze all failed interpretations.
9762 if All_Errors_Mode
then
9763 Report_Error
:= True;
9764 if Try_Primitive_Operation
9765 (Call_Node
=> New_Call_Node
,
9766 Node_To_Replace
=> Node_To_Replace
)
9769 Try_Class_Wide_Operation
9770 (Call_Node
=> New_Call_Node
,
9771 Node_To_Replace
=> Node_To_Replace
)
9778 (N
=> New_Call_Node
,
9782 Skip_First
=> True);
9785 -- No need for further errors
9790 -- There was no candidate operation, so report it as an error
9791 -- in the caller: Analyze_Selected_Component.
9795 end Try_Object_Operation
;
9801 procedure wpo
(T
: Entity_Id
) is
9806 if not Is_Tagged_Type
(T
) then
9810 E
:= First_Elmt
(Primitive_Operations
(Base_Type
(T
)));
9811 while Present
(E
) loop
9813 Write_Int
(Int
(Op
));
9814 Write_Str
(" === ");
9815 Write_Name
(Chars
(Op
));
9817 Write_Name
(Chars
(Scope
(Op
)));