1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2014, 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 Fname
; use Fname
;
34 with Itypes
; use Itypes
;
36 with Lib
.Xref
; use Lib
.Xref
;
37 with Namet
; use Namet
;
38 with Namet
.Sp
; use Namet
.Sp
;
39 with Nlists
; use Nlists
;
40 with Nmake
; use Nmake
;
42 with Output
; use Output
;
43 with Restrict
; use Restrict
;
44 with Rident
; use Rident
;
46 with Sem_Aux
; use Sem_Aux
;
47 with Sem_Case
; use Sem_Case
;
48 with Sem_Cat
; use Sem_Cat
;
49 with Sem_Ch3
; use Sem_Ch3
;
50 with Sem_Ch6
; use Sem_Ch6
;
51 with Sem_Ch8
; use Sem_Ch8
;
52 with Sem_Dim
; use Sem_Dim
;
53 with Sem_Disp
; use Sem_Disp
;
54 with Sem_Dist
; use Sem_Dist
;
55 with Sem_Eval
; use Sem_Eval
;
56 with Sem_Res
; use Sem_Res
;
57 with Sem_Type
; use Sem_Type
;
58 with Sem_Util
; use Sem_Util
;
59 with Sem_Warn
; use Sem_Warn
;
60 with Stand
; use Stand
;
61 with Sinfo
; use Sinfo
;
62 with Snames
; use Snames
;
63 with Tbuild
; use Tbuild
;
64 with Uintp
; use Uintp
;
66 package body Sem_Ch4
is
68 -----------------------
69 -- Local Subprograms --
70 -----------------------
72 procedure Analyze_Concatenation_Rest
(N
: Node_Id
);
73 -- Does the "rest" of the work of Analyze_Concatenation, after the left
74 -- operand has been analyzed. See Analyze_Concatenation for details.
76 procedure Analyze_Expression
(N
: Node_Id
);
77 -- For expressions that are not names, this is just a call to analyze. If
78 -- the expression is a name, it may be a call to a parameterless function,
79 -- and if so must be converted into an explicit call node and analyzed as
80 -- such. This deproceduring must be done during the first pass of overload
81 -- resolution, because otherwise a procedure call with overloaded actuals
82 -- may fail to resolve.
84 procedure Analyze_Operator_Call
(N
: Node_Id
; Op_Id
: Entity_Id
);
85 -- Analyze a call of the form "+"(x, y), etc. The prefix of the call is an
86 -- operator name or an expanded name whose selector is an operator name,
87 -- and one possible interpretation is as a predefined operator.
89 procedure Analyze_Overloaded_Selected_Component
(N
: Node_Id
);
90 -- If the prefix of a selected_component is overloaded, the proper
91 -- interpretation that yields a record type with the proper selector
92 -- name must be selected.
94 procedure Analyze_User_Defined_Binary_Op
(N
: Node_Id
; Op_Id
: Entity_Id
);
95 -- Procedure to analyze a user defined binary operator, which is resolved
96 -- like a function, but instead of a list of actuals it is presented
97 -- with the left and right operands of an operator node.
99 procedure Analyze_User_Defined_Unary_Op
(N
: Node_Id
; Op_Id
: Entity_Id
);
100 -- Procedure to analyze a user defined unary operator, which is resolved
101 -- like a function, but instead of a list of actuals, it is presented with
102 -- the operand of the operator node.
104 procedure Ambiguous_Operands
(N
: Node_Id
);
105 -- For equality, membership, and comparison operators with overloaded
106 -- arguments, list possible interpretations.
108 procedure Analyze_One_Call
112 Success
: out Boolean;
113 Skip_First
: Boolean := False);
114 -- Check one interpretation of an overloaded subprogram name for
115 -- compatibility with the types of the actuals in a call. If there is a
116 -- single interpretation which does not match, post error if Report is
119 -- Nam is the entity that provides the formals against which the actuals
120 -- are checked. Nam is either the name of a subprogram, or the internal
121 -- subprogram type constructed for an access_to_subprogram. If the actuals
122 -- are compatible with Nam, then Nam is added to the list of candidate
123 -- interpretations for N, and Success is set to True.
125 -- The flag Skip_First is used when analyzing a call that was rewritten
126 -- from object notation. In this case the first actual may have to receive
127 -- an explicit dereference, depending on the first formal of the operation
128 -- being called. The caller will have verified that the object is legal
129 -- for the call. If the remaining parameters match, the first parameter
130 -- will rewritten as a dereference if needed, prior to completing analysis.
132 procedure Check_Misspelled_Selector
135 -- Give possible misspelling message if Sel seems likely to be a mis-
136 -- spelling of one of the selectors of the Prefix. This is called by
137 -- Analyze_Selected_Component after producing an invalid selector error
140 function Defined_In_Scope
(T
: Entity_Id
; S
: Entity_Id
) return Boolean;
141 -- Verify that type T is declared in scope S. Used to find interpretations
142 -- for operators given by expanded names. This is abstracted as a separate
143 -- function to handle extensions to System, where S is System, but T is
144 -- declared in the extension.
146 procedure Find_Arithmetic_Types
150 -- L and R are the operands of an arithmetic operator. Find consistent
151 -- pairs of interpretations for L and R that have a numeric type consistent
152 -- with the semantics of the operator.
154 procedure Find_Comparison_Types
158 -- L and R are operands of a comparison operator. Find consistent pairs of
159 -- interpretations for L and R.
161 procedure Find_Concatenation_Types
165 -- For the four varieties of concatenation
167 procedure Find_Equality_Types
171 -- Ditto for equality operators
173 procedure Find_Boolean_Types
177 -- Ditto for binary logical operations
179 procedure Find_Negation_Types
183 -- Find consistent interpretation for operand of negation operator
185 procedure Find_Non_Universal_Interpretations
190 -- For equality and comparison operators, the result is always boolean,
191 -- and the legality of the operation is determined from the visibility
192 -- of the operand types. If one of the operands has a universal interpre-
193 -- tation, the legality check uses some compatible non-universal
194 -- interpretation of the other operand. N can be an operator node, or
195 -- a function call whose name is an operator designator. Any_Access, which
196 -- is the initial type of the literal NULL, is a universal type for the
197 -- purpose of this routine.
199 function Find_Primitive_Operation
(N
: Node_Id
) return Boolean;
200 -- Find candidate interpretations for the name Obj.Proc when it appears
201 -- in a subprogram renaming declaration.
203 procedure Find_Unary_Types
207 -- Unary arithmetic types: plus, minus, abs
209 procedure Check_Arithmetic_Pair
213 -- Subsidiary procedure to Find_Arithmetic_Types. T1 and T2 are valid
214 -- types for left and right operand. Determine whether they constitute
215 -- a valid pair for the given operator, and record the corresponding
216 -- interpretation of the operator node. The node N may be an operator
217 -- node (the usual case) or a function call whose prefix is an operator
218 -- designator. In both cases Op_Id is the operator name itself.
220 procedure Diagnose_Call
(N
: Node_Id
; Nam
: Node_Id
);
221 -- Give detailed information on overloaded call where none of the
222 -- interpretations match. N is the call node, Nam the designator for
223 -- the overloaded entity being called.
225 function Junk_Operand
(N
: Node_Id
) return Boolean;
226 -- Test for an operand that is an inappropriate entity (e.g. a package
227 -- name or a label). If so, issue an error message and return True. If
228 -- the operand is not an inappropriate entity kind, return False.
230 procedure Operator_Check
(N
: Node_Id
);
231 -- Verify that an operator has received some valid interpretation. If none
232 -- was found, determine whether a use clause would make the operation
233 -- legal. The variable Candidate_Type (defined in Sem_Type) is set for
234 -- every type compatible with the operator, even if the operator for the
235 -- type is not directly visible. The routine uses this type to emit a more
236 -- informative message.
238 function Process_Implicit_Dereference_Prefix
240 P
: Node_Id
) return Entity_Id
;
241 -- Called when P is the prefix of an implicit dereference, denoting an
242 -- object E. The function returns the designated type of the prefix, taking
243 -- into account that the designated type of an anonymous access type may be
244 -- a limited view, when the non-limited view is visible.
245 -- If in semantics only mode (-gnatc or generic), the function also records
246 -- that the prefix is a reference to E, if any. Normally, such a reference
247 -- is generated only when the implicit dereference is expanded into an
248 -- explicit one, but for consistency we must generate the reference when
249 -- expansion is disabled as well.
251 procedure Remove_Abstract_Operations
(N
: Node_Id
);
252 -- Ada 2005: implementation of AI-310. An abstract non-dispatching
253 -- operation is not a candidate interpretation.
255 function Try_Container_Indexing
258 Exprs
: List_Id
) return Boolean;
259 -- AI05-0139: Generalized indexing to support iterators over containers
261 function Try_Indexed_Call
265 Skip_First
: Boolean) return Boolean;
266 -- If a function has defaults for all its actuals, a call to it may in fact
267 -- be an indexing on the result of the call. Try_Indexed_Call attempts the
268 -- interpretation as an indexing, prior to analysis as a call. If both are
269 -- possible, the node is overloaded with both interpretations (same symbol
270 -- but two different types). If the call is written in prefix form, the
271 -- prefix becomes the first parameter in the call, and only the remaining
272 -- actuals must be checked for the presence of defaults.
274 function Try_Indirect_Call
277 Typ
: Entity_Id
) return Boolean;
278 -- Similarly, a function F that needs no actuals can return an access to a
279 -- subprogram, and the call F (X) interpreted as F.all (X). In this case
280 -- the call may be overloaded with both interpretations.
282 function Try_Object_Operation
284 CW_Test_Only
: Boolean := False) return Boolean;
285 -- Ada 2005 (AI-252): Support the object.operation notation. If node N
286 -- is a call in this notation, it is transformed into a normal subprogram
287 -- call where the prefix is a parameter, and True is returned. If node
288 -- N is not of this form, it is unchanged, and False is returned. if
289 -- CW_Test_Only is true then N is an N_Selected_Component node which
290 -- is part of a call to an entry or procedure of a tagged concurrent
291 -- type and this routine is invoked to search for class-wide subprograms
292 -- conflicting with the target entity.
294 procedure wpo
(T
: Entity_Id
);
295 pragma Warnings
(Off
, wpo
);
296 -- Used for debugging: obtain list of primitive operations even if
297 -- type is not frozen and dispatch table is not built yet.
299 ------------------------
300 -- Ambiguous_Operands --
301 ------------------------
303 procedure Ambiguous_Operands
(N
: Node_Id
) is
304 procedure List_Operand_Interps
(Opnd
: Node_Id
);
306 --------------------------
307 -- List_Operand_Interps --
308 --------------------------
310 procedure List_Operand_Interps
(Opnd
: Node_Id
) is
315 if Is_Overloaded
(Opnd
) then
316 if Nkind
(Opnd
) in N_Op
then
318 elsif Nkind
(Opnd
) = N_Function_Call
then
320 elsif Ada_Version
>= Ada_2012
then
326 Get_First_Interp
(Opnd
, I
, It
);
327 while Present
(It
.Nam
) loop
328 if Has_Implicit_Dereference
(It
.Typ
) then
330 ("can be interpreted as implicit dereference", Opnd
);
334 Get_Next_Interp
(I
, It
);
345 if Opnd
= Left_Opnd
(N
) then
346 Error_Msg_N
("\left operand has the following interpretations", N
);
349 ("\right operand has the following interpretations", N
);
353 List_Interps
(Nam
, Err
);
354 end List_Operand_Interps
;
356 -- Start of processing for Ambiguous_Operands
359 if Nkind
(N
) in N_Membership_Test
then
360 Error_Msg_N
("ambiguous operands for membership", N
);
362 elsif Nkind_In
(N
, N_Op_Eq
, N_Op_Ne
) then
363 Error_Msg_N
("ambiguous operands for equality", N
);
366 Error_Msg_N
("ambiguous operands for comparison", N
);
369 if All_Errors_Mode
then
370 List_Operand_Interps
(Left_Opnd
(N
));
371 List_Operand_Interps
(Right_Opnd
(N
));
373 Error_Msg_N
("\use -gnatf switch for details", N
);
375 end Ambiguous_Operands
;
377 -----------------------
378 -- Analyze_Aggregate --
379 -----------------------
381 -- Most of the analysis of Aggregates requires that the type be known,
382 -- and is therefore put off until resolution.
384 procedure Analyze_Aggregate
(N
: Node_Id
) is
386 if No
(Etype
(N
)) then
387 Set_Etype
(N
, Any_Composite
);
389 end Analyze_Aggregate
;
391 -----------------------
392 -- Analyze_Allocator --
393 -----------------------
395 procedure Analyze_Allocator
(N
: Node_Id
) is
396 Loc
: constant Source_Ptr
:= Sloc
(N
);
397 Sav_Errs
: constant Nat
:= Serious_Errors_Detected
;
398 E
: Node_Id
:= Expression
(N
);
399 Acc_Type
: Entity_Id
;
406 Check_SPARK_05_Restriction
("allocator is not allowed", N
);
408 -- Deal with allocator restrictions
410 -- In accordance with H.4(7), the No_Allocators restriction only applies
411 -- to user-written allocators. The same consideration applies to the
412 -- No_Standard_Allocators_Before_Elaboration restriction.
414 if Comes_From_Source
(N
) then
415 Check_Restriction
(No_Allocators
, N
);
417 -- Processing for No_Standard_Allocators_After_Elaboration, loop to
418 -- look at enclosing context, checking task/main subprogram case.
422 while Present
(P
) loop
424 -- For the task case we need a handled sequence of statements,
425 -- where the occurrence of the allocator is within the statements
426 -- and the parent is a task body
428 if Nkind
(P
) = N_Handled_Sequence_Of_Statements
429 and then Is_List_Member
(C
)
430 and then List_Containing
(C
) = Statements
(P
)
432 Onode
:= Original_Node
(Parent
(P
));
434 -- Check for allocator within task body, this is a definite
435 -- violation of No_Allocators_After_Elaboration we can detect
438 if Nkind
(Onode
) = N_Task_Body
then
440 (No_Standard_Allocators_After_Elaboration
, N
);
445 -- The other case is appearance in a subprogram body. This is
446 -- a violation if this is a library level subprogram with no
447 -- parameters. Note that this is now a static error even if the
448 -- subprogram is not the main program (this is a change, in an
449 -- earlier version only the main program was affected, and the
450 -- check had to be done in the binder.
452 if Nkind
(P
) = N_Subprogram_Body
453 and then Nkind
(Parent
(P
)) = N_Compilation_Unit
454 and then No
(Parameter_Specifications
(Specification
(P
)))
457 (No_Standard_Allocators_After_Elaboration
, N
);
465 -- Ada 2012 (AI05-0111-3): Analyze the subpool_specification, if
466 -- any. The expected type for the name is any type. A non-overloading
467 -- rule then requires it to be of a type descended from
468 -- System.Storage_Pools.Subpools.Subpool_Handle.
470 -- This isn't exactly what the AI says, but it seems to be the right
471 -- rule. The AI should be fixed.???
474 Subpool
: constant Node_Id
:= Subpool_Handle_Name
(N
);
477 if Present
(Subpool
) then
480 if Is_Overloaded
(Subpool
) then
481 Error_Msg_N
("ambiguous subpool handle", Subpool
);
484 -- Check that Etype (Subpool) is descended from Subpool_Handle
490 -- Analyze the qualified expression or subtype indication
492 if Nkind
(E
) = N_Qualified_Expression
then
493 Acc_Type
:= Create_Itype
(E_Allocator_Type
, N
);
494 Set_Etype
(Acc_Type
, Acc_Type
);
495 Find_Type
(Subtype_Mark
(E
));
497 -- Analyze the qualified expression, and apply the name resolution
498 -- rule given in 4.7(3).
501 Type_Id
:= Etype
(E
);
502 Set_Directly_Designated_Type
(Acc_Type
, Type_Id
);
504 -- Allocators generated by the build-in-place expansion mechanism
505 -- are explicitly marked as coming from source but do not need to be
506 -- checked for limited initialization. To exclude this case, ensure
507 -- that the parent of the allocator is a source node.
509 if Is_Limited_Type
(Type_Id
)
510 and then Comes_From_Source
(N
)
511 and then Comes_From_Source
(Parent
(N
))
512 and then not In_Instance_Body
514 if not OK_For_Limited_Init
(Type_Id
, Expression
(E
)) then
515 Error_Msg_N
("initialization not allowed for limited types", N
);
516 Explain_Limited_Type
(Type_Id
, N
);
520 -- A qualified expression requires an exact match of the type,
521 -- class-wide matching is not allowed.
523 -- if Is_Class_Wide_Type (Type_Id)
524 -- and then Base_Type
525 -- (Etype (Expression (E))) /= Base_Type (Type_Id)
527 -- Wrong_Type (Expression (E), Type_Id);
530 -- We don't analyze the qualified expression itself because it's
531 -- part of the allocator. It is fully analyzed and resolved when
532 -- the allocator is resolved with the context type.
534 Set_Etype
(E
, Type_Id
);
536 -- Case where allocator has a subtype indication
541 Base_Typ
: Entity_Id
;
544 -- If the allocator includes a N_Subtype_Indication then a
545 -- constraint is present, otherwise the node is a subtype mark.
546 -- Introduce an explicit subtype declaration into the tree
547 -- defining some anonymous subtype and rewrite the allocator to
548 -- use this subtype rather than the subtype indication.
550 -- It is important to introduce the explicit subtype declaration
551 -- so that the bounds of the subtype indication are attached to
552 -- the tree in case the allocator is inside a generic unit.
554 if Nkind
(E
) = N_Subtype_Indication
then
556 -- A constraint is only allowed for a composite type in Ada
557 -- 95. In Ada 83, a constraint is also allowed for an
558 -- access-to-composite type, but the constraint is ignored.
560 Find_Type
(Subtype_Mark
(E
));
561 Base_Typ
:= Entity
(Subtype_Mark
(E
));
563 if Is_Elementary_Type
(Base_Typ
) then
564 if not (Ada_Version
= Ada_83
565 and then Is_Access_Type
(Base_Typ
))
567 Error_Msg_N
("constraint not allowed here", E
);
569 if Nkind
(Constraint
(E
)) =
570 N_Index_Or_Discriminant_Constraint
572 Error_Msg_N
-- CODEFIX
573 ("\if qualified expression was meant, " &
574 "use apostrophe", Constraint
(E
));
578 -- Get rid of the bogus constraint:
580 Rewrite
(E
, New_Copy_Tree
(Subtype_Mark
(E
)));
581 Analyze_Allocator
(N
);
585 if Expander_Active
then
586 Def_Id
:= Make_Temporary
(Loc
, 'S');
589 Make_Subtype_Declaration
(Loc
,
590 Defining_Identifier
=> Def_Id
,
591 Subtype_Indication
=> Relocate_Node
(E
)));
593 if Sav_Errs
/= Serious_Errors_Detected
594 and then Nkind
(Constraint
(E
)) =
595 N_Index_Or_Discriminant_Constraint
597 Error_Msg_N
-- CODEFIX
598 ("if qualified expression was meant, "
599 & "use apostrophe!", Constraint
(E
));
602 E
:= New_Occurrence_Of
(Def_Id
, Loc
);
603 Rewrite
(Expression
(N
), E
);
607 Type_Id
:= Process_Subtype
(E
, N
);
608 Acc_Type
:= Create_Itype
(E_Allocator_Type
, N
);
609 Set_Etype
(Acc_Type
, Acc_Type
);
610 Set_Directly_Designated_Type
(Acc_Type
, Type_Id
);
611 Check_Fully_Declared
(Type_Id
, N
);
613 -- Ada 2005 (AI-231): If the designated type is itself an access
614 -- type that excludes null, its default initialization will
615 -- be a null object, and we can insert an unconditional raise
616 -- before the allocator.
618 -- Ada 2012 (AI-104): A not null indication here is altogether
621 if Can_Never_Be_Null
(Type_Id
) then
623 Not_Null_Check
: constant Node_Id
:=
624 Make_Raise_Constraint_Error
(Sloc
(E
),
625 Reason
=> CE_Null_Not_Allowed
);
628 if Expander_Active
then
629 Insert_Action
(N
, Not_Null_Check
);
630 Analyze
(Not_Null_Check
);
632 elsif Warn_On_Ada_2012_Compatibility
then
634 ("null value not allowed here in Ada 2012?y?", E
);
639 -- Check for missing initialization. Skip this check if we already
640 -- had errors on analyzing the allocator, since in that case these
641 -- are probably cascaded errors.
643 if Is_Indefinite_Subtype
(Type_Id
)
644 and then Serious_Errors_Detected
= Sav_Errs
646 -- The build-in-place machinery may produce an allocator when
647 -- the designated type is indefinite but the underlying type is
648 -- not. In this case the unknown discriminants are meaningless
649 -- and should not trigger error messages. Check the parent node
650 -- because the allocator is marked as coming from source.
652 if Present
(Underlying_Type
(Type_Id
))
653 and then not Is_Indefinite_Subtype
(Underlying_Type
(Type_Id
))
654 and then not Comes_From_Source
(Parent
(N
))
658 elsif Is_Class_Wide_Type
(Type_Id
) then
660 ("initialization required in class-wide allocation", N
);
663 if Ada_Version
< Ada_2005
664 and then Is_Limited_Type
(Type_Id
)
666 Error_Msg_N
("unconstrained allocation not allowed", N
);
668 if Is_Array_Type
(Type_Id
) then
670 ("\constraint with array bounds required", N
);
672 elsif Has_Unknown_Discriminants
(Type_Id
) then
675 else pragma Assert
(Has_Discriminants
(Type_Id
));
677 ("\constraint with discriminant values required", N
);
680 -- Limited Ada 2005 and general non-limited case
684 ("uninitialized unconstrained allocation not allowed",
687 if Is_Array_Type
(Type_Id
) then
689 ("\qualified expression or constraint with " &
690 "array bounds required", N
);
692 elsif Has_Unknown_Discriminants
(Type_Id
) then
693 Error_Msg_N
("\qualified expression required", N
);
695 else pragma Assert
(Has_Discriminants
(Type_Id
));
697 ("\qualified expression or constraint with " &
698 "discriminant values required", N
);
706 if Is_Abstract_Type
(Type_Id
) then
707 Error_Msg_N
("cannot allocate abstract object", E
);
710 if Has_Task
(Designated_Type
(Acc_Type
)) then
711 Check_Restriction
(No_Tasking
, N
);
712 Check_Restriction
(Max_Tasks
, N
);
713 Check_Restriction
(No_Task_Allocators
, N
);
716 -- Check restriction against dynamically allocated protected objects
718 if Has_Protected
(Designated_Type
(Acc_Type
)) then
719 Check_Restriction
(No_Protected_Type_Allocators
, N
);
722 -- AI05-0013-1: No_Nested_Finalization forbids allocators if the access
723 -- type is nested, and the designated type needs finalization. The rule
724 -- is conservative in that class-wide types need finalization.
726 if Needs_Finalization
(Designated_Type
(Acc_Type
))
727 and then not Is_Library_Level_Entity
(Acc_Type
)
729 Check_Restriction
(No_Nested_Finalization
, N
);
732 -- Check that an allocator of a nested access type doesn't create a
733 -- protected object when restriction No_Local_Protected_Objects applies.
735 if Has_Protected
(Designated_Type
(Acc_Type
))
736 and then not Is_Library_Level_Entity
(Acc_Type
)
738 Check_Restriction
(No_Local_Protected_Objects
, N
);
741 -- If the No_Streams restriction is set, check that the type of the
742 -- object is not, and does not contain, any subtype derived from
743 -- Ada.Streams.Root_Stream_Type. Note that we guard the call to
744 -- Has_Stream just for efficiency reasons. There is no point in
745 -- spending time on a Has_Stream check if the restriction is not set.
747 if Restriction_Check_Required
(No_Streams
) then
748 if Has_Stream
(Designated_Type
(Acc_Type
)) then
749 Check_Restriction
(No_Streams
, N
);
753 Set_Etype
(N
, Acc_Type
);
755 if not Is_Library_Level_Entity
(Acc_Type
) then
756 Check_Restriction
(No_Local_Allocators
, N
);
759 if Serious_Errors_Detected
> Sav_Errs
then
760 Set_Error_Posted
(N
);
761 Set_Etype
(N
, Any_Type
);
763 end Analyze_Allocator
;
765 ---------------------------
766 -- Analyze_Arithmetic_Op --
767 ---------------------------
769 procedure Analyze_Arithmetic_Op
(N
: Node_Id
) is
770 L
: constant Node_Id
:= Left_Opnd
(N
);
771 R
: constant Node_Id
:= Right_Opnd
(N
);
775 Candidate_Type
:= Empty
;
776 Analyze_Expression
(L
);
777 Analyze_Expression
(R
);
779 -- If the entity is already set, the node is the instantiation of a
780 -- generic node with a non-local reference, or was manufactured by a
781 -- call to Make_Op_xxx. In either case the entity is known to be valid,
782 -- and we do not need to collect interpretations, instead we just get
783 -- the single possible interpretation.
787 if Present
(Op_Id
) then
788 if Ekind
(Op_Id
) = E_Operator
then
790 if Nkind_In
(N
, N_Op_Divide
, N_Op_Mod
, N_Op_Multiply
, N_Op_Rem
)
791 and then Treat_Fixed_As_Integer
(N
)
795 Set_Etype
(N
, Any_Type
);
796 Find_Arithmetic_Types
(L
, R
, Op_Id
, N
);
800 Set_Etype
(N
, Any_Type
);
801 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
804 -- Entity is not already set, so we do need to collect interpretations
807 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
808 Set_Etype
(N
, Any_Type
);
810 while Present
(Op_Id
) loop
811 if Ekind
(Op_Id
) = E_Operator
812 and then Present
(Next_Entity
(First_Entity
(Op_Id
)))
814 Find_Arithmetic_Types
(L
, R
, Op_Id
, N
);
816 -- The following may seem superfluous, because an operator cannot
817 -- be generic, but this ignores the cleverness of the author of
820 elsif Is_Overloadable
(Op_Id
) then
821 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
824 Op_Id
:= Homonym
(Op_Id
);
829 end Analyze_Arithmetic_Op
;
835 -- Function, procedure, and entry calls are checked here. The Name in
836 -- the call may be overloaded. The actuals have been analyzed and may
837 -- themselves be overloaded. On exit from this procedure, the node N
838 -- may have zero, one or more interpretations. In the first case an
839 -- error message is produced. In the last case, the node is flagged
840 -- as overloaded and the interpretations are collected in All_Interp.
842 -- If the name is an Access_To_Subprogram, it cannot be overloaded, but
843 -- the type-checking is similar to that of other calls.
845 procedure Analyze_Call
(N
: Node_Id
) is
846 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
851 Success
: Boolean := False;
853 Deref
: Boolean := False;
854 -- Flag indicates whether an interpretation of the prefix is a
855 -- parameterless call that returns an access_to_subprogram.
857 procedure Check_Ghost_Subprogram_Call
;
858 -- Verify the legality of a call to a ghost subprogram. Such calls can
859 -- appear only in assertion expressions except subtype predicates or
860 -- from within another ghost subprogram.
862 procedure Check_Mixed_Parameter_And_Named_Associations
;
863 -- Check that parameter and named associations are not mixed. This is
864 -- a restriction in SPARK mode.
866 function Name_Denotes_Function
return Boolean;
867 -- If the type of the name is an access to subprogram, this may be the
868 -- type of a name, or the return type of the function being called. If
869 -- the name is not an entity then it can denote a protected function.
870 -- Until we distinguish Etype from Return_Type, we must use this routine
871 -- to resolve the meaning of the name in the call.
873 procedure No_Interpretation
;
874 -- Output error message when no valid interpretation exists
876 ---------------------------------
877 -- Check_Ghost_Subprogram_Call --
878 ---------------------------------
880 procedure Check_Ghost_Subprogram_Call
is
884 -- Do not perform the check while preanalyzing the enclosing context
885 -- because the call is not in its final place. Premature attempts to
886 -- verify the placement lead to bogus errors.
888 if In_Spec_Expression
then
891 -- The ghost subprogram appears inside an assertion expression which
892 -- is one of the allowed cases.
894 elsif In_Assertion_Expression_Pragma
(N
) then
897 -- Otherwise see if it inside another ghost subprogram
900 -- Loop to climb scopes
903 while Present
(S
) and then S
/= Standard_Standard
loop
905 -- The call appears inside another ghost subprogram
907 if Is_Ghost_Subprogram
(S
) then
914 -- If we fall through the loop it was not within another
915 -- ghost subprogram, so we have bad placement.
918 ("call to ghost subprogram must appear in assertion expression "
919 & "or another ghost subprogram", N
);
921 end Check_Ghost_Subprogram_Call
;
923 --------------------------------------------------
924 -- Check_Mixed_Parameter_And_Named_Associations --
925 --------------------------------------------------
927 procedure Check_Mixed_Parameter_And_Named_Associations
is
929 Named_Seen
: Boolean;
934 Actual
:= First
(Actuals
);
935 while Present
(Actual
) loop
936 case Nkind
(Actual
) is
937 when N_Parameter_Association
=>
939 Check_SPARK_05_Restriction
940 ("named association cannot follow positional one",
950 end Check_Mixed_Parameter_And_Named_Associations
;
952 ---------------------------
953 -- Name_Denotes_Function --
954 ---------------------------
956 function Name_Denotes_Function
return Boolean is
958 if Is_Entity_Name
(Nam
) then
959 return Ekind
(Entity
(Nam
)) = E_Function
;
961 elsif Nkind
(Nam
) = N_Selected_Component
then
962 return Ekind
(Entity
(Selector_Name
(Nam
))) = E_Function
;
967 end Name_Denotes_Function
;
969 -----------------------
970 -- No_Interpretation --
971 -----------------------
973 procedure No_Interpretation
is
974 L
: constant Boolean := Is_List_Member
(N
);
975 K
: constant Node_Kind
:= Nkind
(Parent
(N
));
978 -- If the node is in a list whose parent is not an expression then it
979 -- must be an attempted procedure call.
981 if L
and then K
not in N_Subexpr
then
982 if Ekind
(Entity
(Nam
)) = E_Generic_Procedure
then
984 ("must instantiate generic procedure& before call",
988 ("procedure or entry name expected", Nam
);
991 -- Check for tasking cases where only an entry call will do
994 and then Nkind_In
(K
, N_Entry_Call_Alternative
,
995 N_Triggering_Alternative
)
997 Error_Msg_N
("entry name expected", Nam
);
999 -- Otherwise give general error message
1002 Error_Msg_N
("invalid prefix in call", Nam
);
1004 end No_Interpretation
;
1006 -- Start of processing for Analyze_Call
1009 if Restriction_Check_Required
(SPARK_05
) then
1010 Check_Mixed_Parameter_And_Named_Associations
;
1013 -- Initialize the type of the result of the call to the error type,
1014 -- which will be reset if the type is successfully resolved.
1016 Set_Etype
(N
, Any_Type
);
1020 if not Is_Overloaded
(Nam
) then
1022 -- Only one interpretation to check
1024 if Ekind
(Etype
(Nam
)) = E_Subprogram_Type
then
1025 Nam_Ent
:= Etype
(Nam
);
1027 -- If the prefix is an access_to_subprogram, this may be an indirect
1028 -- call. This is the case if the name in the call is not an entity
1029 -- name, or if it is a function name in the context of a procedure
1030 -- call. In this latter case, we have a call to a parameterless
1031 -- function that returns a pointer_to_procedure which is the entity
1032 -- being called. Finally, F (X) may be a call to a parameterless
1033 -- function that returns a pointer to a function with parameters.
1034 -- Note that if F returns an access-to-subprogram whose designated
1035 -- type is an array, F (X) cannot be interpreted as an indirect call
1036 -- through the result of the call to F.
1038 elsif Is_Access_Type
(Etype
(Nam
))
1039 and then Ekind
(Designated_Type
(Etype
(Nam
))) = E_Subprogram_Type
1041 (not Name_Denotes_Function
1042 or else Nkind
(N
) = N_Procedure_Call_Statement
1044 (Nkind
(Parent
(N
)) /= N_Explicit_Dereference
1045 and then Is_Entity_Name
(Nam
)
1046 and then No
(First_Formal
(Entity
(Nam
)))
1048 Is_Array_Type
(Etype
(Designated_Type
(Etype
(Nam
))))
1049 and then Present
(Actuals
)))
1051 Nam_Ent
:= Designated_Type
(Etype
(Nam
));
1052 Insert_Explicit_Dereference
(Nam
);
1054 -- Selected component case. Simple entry or protected operation,
1055 -- where the entry name is given by the selector name.
1057 elsif Nkind
(Nam
) = N_Selected_Component
then
1058 Nam_Ent
:= Entity
(Selector_Name
(Nam
));
1060 if not Ekind_In
(Nam_Ent
, E_Entry
,
1065 Error_Msg_N
("name in call is not a callable entity", Nam
);
1066 Set_Etype
(N
, Any_Type
);
1070 -- If the name is an Indexed component, it can be a call to a member
1071 -- of an entry family. The prefix must be a selected component whose
1072 -- selector is the entry. Analyze_Procedure_Call normalizes several
1073 -- kinds of call into this form.
1075 elsif Nkind
(Nam
) = N_Indexed_Component
then
1076 if Nkind
(Prefix
(Nam
)) = N_Selected_Component
then
1077 Nam_Ent
:= Entity
(Selector_Name
(Prefix
(Nam
)));
1079 Error_Msg_N
("name in call is not a callable entity", Nam
);
1080 Set_Etype
(N
, Any_Type
);
1084 elsif not Is_Entity_Name
(Nam
) then
1085 Error_Msg_N
("name in call is not a callable entity", Nam
);
1086 Set_Etype
(N
, Any_Type
);
1090 Nam_Ent
:= Entity
(Nam
);
1092 -- If not overloadable, this may be a generalized indexing
1093 -- operation with named associations. Rewrite again as an
1094 -- indexed component and analyze as container indexing.
1096 if not Is_Overloadable
(Nam_Ent
) then
1098 (Find_Value_Of_Aspect
1099 (Etype
(Nam_Ent
), Aspect_Constant_Indexing
))
1102 Make_Indexed_Component
(Sloc
(N
),
1104 Expressions
=> Parameter_Associations
(N
)));
1106 if Try_Container_Indexing
(N
, Nam
, Expressions
(N
)) then
1120 -- Operations generated for RACW stub types are called only through
1121 -- dispatching, and can never be the static interpretation of a call.
1123 if Is_RACW_Stub_Type_Operation
(Nam_Ent
) then
1128 Analyze_One_Call
(N
, Nam_Ent
, True, Success
);
1130 -- If this is an indirect call, the return type of the access_to
1131 -- subprogram may be an incomplete type. At the point of the call,
1132 -- use the full type if available, and at the same time update the
1133 -- return type of the access_to_subprogram.
1136 and then Nkind
(Nam
) = N_Explicit_Dereference
1137 and then Ekind
(Etype
(N
)) = E_Incomplete_Type
1138 and then Present
(Full_View
(Etype
(N
)))
1140 Set_Etype
(N
, Full_View
(Etype
(N
)));
1141 Set_Etype
(Nam_Ent
, Etype
(N
));
1147 -- An overloaded selected component must denote overloaded operations
1148 -- of a concurrent type. The interpretations are attached to the
1149 -- simple name of those operations.
1151 if Nkind
(Nam
) = N_Selected_Component
then
1152 Nam
:= Selector_Name
(Nam
);
1155 Get_First_Interp
(Nam
, X
, It
);
1157 while Present
(It
.Nam
) loop
1161 -- Name may be call that returns an access to subprogram, or more
1162 -- generally an overloaded expression one of whose interpretations
1163 -- yields an access to subprogram. If the name is an entity, we do
1164 -- not dereference, because the node is a call that returns the
1165 -- access type: note difference between f(x), where the call may
1166 -- return an access subprogram type, and f(x)(y), where the type
1167 -- returned by the call to f is implicitly dereferenced to analyze
1170 if Is_Access_Type
(Nam_Ent
) then
1171 Nam_Ent
:= Designated_Type
(Nam_Ent
);
1173 elsif Is_Access_Type
(Etype
(Nam_Ent
))
1175 (not Is_Entity_Name
(Nam
)
1176 or else Nkind
(N
) = N_Procedure_Call_Statement
)
1177 and then Ekind
(Designated_Type
(Etype
(Nam_Ent
)))
1180 Nam_Ent
:= Designated_Type
(Etype
(Nam_Ent
));
1182 if Is_Entity_Name
(Nam
) then
1187 -- If the call has been rewritten from a prefixed call, the first
1188 -- parameter has been analyzed, but may need a subsequent
1189 -- dereference, so skip its analysis now.
1191 if N
/= Original_Node
(N
)
1192 and then Nkind
(Original_Node
(N
)) = Nkind
(N
)
1193 and then Nkind
(Name
(N
)) /= Nkind
(Name
(Original_Node
(N
)))
1194 and then Present
(Parameter_Associations
(N
))
1195 and then Present
(Etype
(First
(Parameter_Associations
(N
))))
1198 (N
, Nam_Ent
, False, Success
, Skip_First
=> True);
1200 Analyze_One_Call
(N
, Nam_Ent
, False, Success
);
1203 -- If the interpretation succeeds, mark the proper type of the
1204 -- prefix (any valid candidate will do). If not, remove the
1205 -- candidate interpretation. This only needs to be done for
1206 -- overloaded protected operations, for other entities disambi-
1207 -- guation is done directly in Resolve.
1211 and then Nkind
(Parent
(N
)) /= N_Explicit_Dereference
1213 Set_Entity
(Nam
, It
.Nam
);
1214 Insert_Explicit_Dereference
(Nam
);
1215 Set_Etype
(Nam
, Nam_Ent
);
1218 Set_Etype
(Nam
, It
.Typ
);
1221 elsif Nkind_In
(Name
(N
), N_Selected_Component
,
1227 Get_Next_Interp
(X
, It
);
1230 -- If the name is the result of a function call, it can only be a
1231 -- call to a function returning an access to subprogram. Insert
1232 -- explicit dereference.
1234 if Nkind
(Nam
) = N_Function_Call
then
1235 Insert_Explicit_Dereference
(Nam
);
1238 if Etype
(N
) = Any_Type
then
1240 -- None of the interpretations is compatible with the actuals
1242 Diagnose_Call
(N
, Nam
);
1244 -- Special checks for uninstantiated put routines
1246 if Nkind
(N
) = N_Procedure_Call_Statement
1247 and then Is_Entity_Name
(Nam
)
1248 and then Chars
(Nam
) = Name_Put
1249 and then List_Length
(Actuals
) = 1
1252 Arg
: constant Node_Id
:= First
(Actuals
);
1256 if Nkind
(Arg
) = N_Parameter_Association
then
1257 Typ
:= Etype
(Explicit_Actual_Parameter
(Arg
));
1262 if Is_Signed_Integer_Type
(Typ
) then
1264 ("possible missing instantiation of "
1265 & "'Text_'I'O.'Integer_'I'O!", Nam
);
1267 elsif Is_Modular_Integer_Type
(Typ
) then
1269 ("possible missing instantiation of "
1270 & "'Text_'I'O.'Modular_'I'O!", Nam
);
1272 elsif Is_Floating_Point_Type
(Typ
) then
1274 ("possible missing instantiation of "
1275 & "'Text_'I'O.'Float_'I'O!", Nam
);
1277 elsif Is_Ordinary_Fixed_Point_Type
(Typ
) then
1279 ("possible missing instantiation of "
1280 & "'Text_'I'O.'Fixed_'I'O!", Nam
);
1282 elsif Is_Decimal_Fixed_Point_Type
(Typ
) then
1284 ("possible missing instantiation of "
1285 & "'Text_'I'O.'Decimal_'I'O!", Nam
);
1287 elsif Is_Enumeration_Type
(Typ
) then
1289 ("possible missing instantiation of "
1290 & "'Text_'I'O.'Enumeration_'I'O!", Nam
);
1295 elsif not Is_Overloaded
(N
)
1296 and then Is_Entity_Name
(Nam
)
1298 -- Resolution yields a single interpretation. Verify that the
1299 -- reference has capitalization consistent with the declaration.
1301 Set_Entity_With_Checks
(Nam
, Entity
(Nam
));
1302 Generate_Reference
(Entity
(Nam
), Nam
);
1304 Set_Etype
(Nam
, Etype
(Entity
(Nam
)));
1306 Remove_Abstract_Operations
(N
);
1312 -- A call to a ghost subprogram is allowed only in assertion expressions
1313 -- excluding subtype predicates or from within another ghost subprogram.
1315 if Is_Ghost_Subprogram
(Get_Subprogram_Entity
(N
)) then
1316 Check_Ghost_Subprogram_Call
;
1320 -----------------------------
1321 -- Analyze_Case_Expression --
1322 -----------------------------
1324 procedure Analyze_Case_Expression
(N
: Node_Id
) is
1325 procedure Non_Static_Choice_Error
(Choice
: Node_Id
);
1326 -- Error routine invoked by the generic instantiation below when
1327 -- the case expression has a non static choice.
1329 package Case_Choices_Analysis
is new
1330 Generic_Analyze_Choices
1331 (Process_Associated_Node
=> No_OP
);
1332 use Case_Choices_Analysis
;
1334 package Case_Choices_Checking
is new
1335 Generic_Check_Choices
1336 (Process_Empty_Choice
=> No_OP
,
1337 Process_Non_Static_Choice
=> Non_Static_Choice_Error
,
1338 Process_Associated_Node
=> No_OP
);
1339 use Case_Choices_Checking
;
1341 -----------------------------
1342 -- Non_Static_Choice_Error --
1343 -----------------------------
1345 procedure Non_Static_Choice_Error
(Choice
: Node_Id
) is
1347 Flag_Non_Static_Expr
1348 ("choice given in case expression is not static!", Choice
);
1349 end Non_Static_Choice_Error
;
1353 Expr
: constant Node_Id
:= Expression
(N
);
1355 Exp_Type
: Entity_Id
;
1356 Exp_Btype
: Entity_Id
;
1358 FirstX
: Node_Id
:= Empty
;
1359 -- First expression in the case for which there is some type information
1360 -- available, i.e. it is not Any_Type, which can happen because of some
1361 -- error, or from the use of e.g. raise Constraint_Error.
1363 Others_Present
: Boolean;
1364 -- Indicates if Others was present
1366 Wrong_Alt
: Node_Id
;
1367 -- For error reporting
1369 -- Start of processing for Analyze_Case_Expression
1372 if Comes_From_Source
(N
) then
1373 Check_Compiler_Unit
("case expression", N
);
1376 Analyze_And_Resolve
(Expr
, Any_Discrete
);
1377 Check_Unset_Reference
(Expr
);
1378 Exp_Type
:= Etype
(Expr
);
1379 Exp_Btype
:= Base_Type
(Exp_Type
);
1381 Alt
:= First
(Alternatives
(N
));
1382 while Present
(Alt
) loop
1383 Analyze
(Expression
(Alt
));
1385 if No
(FirstX
) and then Etype
(Expression
(Alt
)) /= Any_Type
then
1386 FirstX
:= Expression
(Alt
);
1392 -- Get our initial type from the first expression for which we got some
1393 -- useful type information from the expression.
1395 if not Is_Overloaded
(FirstX
) then
1396 Set_Etype
(N
, Etype
(FirstX
));
1404 Set_Etype
(N
, Any_Type
);
1406 Get_First_Interp
(FirstX
, I
, It
);
1407 while Present
(It
.Nam
) loop
1409 -- For each interpretation of the first expression, we only
1410 -- add the interpretation if every other expression in the
1411 -- case expression alternatives has a compatible type.
1413 Alt
:= Next
(First
(Alternatives
(N
)));
1414 while Present
(Alt
) loop
1415 exit when not Has_Compatible_Type
(Expression
(Alt
), It
.Typ
);
1420 Add_One_Interp
(N
, It
.Typ
, It
.Typ
);
1426 Get_Next_Interp
(I
, It
);
1431 Exp_Btype
:= Base_Type
(Exp_Type
);
1433 -- The expression must be of a discrete type which must be determinable
1434 -- independently of the context in which the expression occurs, but
1435 -- using the fact that the expression must be of a discrete type.
1436 -- Moreover, the type this expression must not be a character literal
1437 -- (which is always ambiguous).
1439 -- If error already reported by Resolve, nothing more to do
1441 if Exp_Btype
= Any_Discrete
or else Exp_Btype
= Any_Type
then
1444 -- Special casee message for character literal
1446 elsif Exp_Btype
= Any_Character
then
1448 ("character literal as case expression is ambiguous", Expr
);
1452 if Etype
(N
) = Any_Type
and then Present
(Wrong_Alt
) then
1454 ("type incompatible with that of previous alternatives",
1455 Expression
(Wrong_Alt
));
1459 -- If the case expression is a formal object of mode in out, then
1460 -- treat it as having a nonstatic subtype by forcing use of the base
1461 -- type (which has to get passed to Check_Case_Choices below). Also
1462 -- use base type when the case expression is parenthesized.
1464 if Paren_Count
(Expr
) > 0
1465 or else (Is_Entity_Name
(Expr
)
1466 and then Ekind
(Entity
(Expr
)) = E_Generic_In_Out_Parameter
)
1468 Exp_Type
:= Exp_Btype
;
1471 -- The case expression alternatives cover the range of a static subtype
1472 -- subject to aspect Static_Predicate. Do not check the choices when the
1473 -- case expression has not been fully analyzed yet because this may lead
1476 if Is_OK_Static_Subtype
(Exp_Type
)
1477 and then Has_Static_Predicate_Aspect
(Exp_Type
)
1478 and then In_Spec_Expression
1482 -- Call Analyze_Choices and Check_Choices to do the rest of the work
1485 Analyze_Choices
(Alternatives
(N
), Exp_Type
);
1486 Check_Choices
(N
, Alternatives
(N
), Exp_Type
, Others_Present
);
1489 if Exp_Type
= Universal_Integer
and then not Others_Present
then
1491 ("case on universal integer requires OTHERS choice", Expr
);
1493 end Analyze_Case_Expression
;
1495 ---------------------------
1496 -- Analyze_Comparison_Op --
1497 ---------------------------
1499 procedure Analyze_Comparison_Op
(N
: Node_Id
) is
1500 L
: constant Node_Id
:= Left_Opnd
(N
);
1501 R
: constant Node_Id
:= Right_Opnd
(N
);
1502 Op_Id
: Entity_Id
:= Entity
(N
);
1505 Set_Etype
(N
, Any_Type
);
1506 Candidate_Type
:= Empty
;
1508 Analyze_Expression
(L
);
1509 Analyze_Expression
(R
);
1511 if Present
(Op_Id
) then
1512 if Ekind
(Op_Id
) = E_Operator
then
1513 Find_Comparison_Types
(L
, R
, Op_Id
, N
);
1515 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1518 if Is_Overloaded
(L
) then
1519 Set_Etype
(L
, Intersect_Types
(L
, R
));
1523 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
1524 while Present
(Op_Id
) loop
1525 if Ekind
(Op_Id
) = E_Operator
then
1526 Find_Comparison_Types
(L
, R
, Op_Id
, N
);
1528 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1531 Op_Id
:= Homonym
(Op_Id
);
1536 end Analyze_Comparison_Op
;
1538 ---------------------------
1539 -- Analyze_Concatenation --
1540 ---------------------------
1542 procedure Analyze_Concatenation
(N
: Node_Id
) is
1544 -- We wish to avoid deep recursion, because concatenations are often
1545 -- deeply nested, as in A&B&...&Z. Therefore, we walk down the left
1546 -- operands nonrecursively until we find something that is not a
1547 -- concatenation (A in this case), or has already been analyzed. We
1548 -- analyze that, and then walk back up the tree following Parent
1549 -- pointers, calling Analyze_Concatenation_Rest to do the rest of the
1550 -- work at each level. The Parent pointers allow us to avoid recursion,
1551 -- and thus avoid running out of memory.
1557 Candidate_Type
:= Empty
;
1559 -- The following code is equivalent to:
1561 -- Set_Etype (N, Any_Type);
1562 -- Analyze_Expression (Left_Opnd (N));
1563 -- Analyze_Concatenation_Rest (N);
1565 -- where the Analyze_Expression call recurses back here if the left
1566 -- operand is a concatenation.
1568 -- Walk down left operands
1571 Set_Etype
(NN
, Any_Type
);
1572 L
:= Left_Opnd
(NN
);
1573 exit when Nkind
(L
) /= N_Op_Concat
or else Analyzed
(L
);
1577 -- Now (given the above example) NN is A&B and L is A
1579 -- First analyze L ...
1581 Analyze_Expression
(L
);
1583 -- ... then walk NN back up until we reach N (where we started), calling
1584 -- Analyze_Concatenation_Rest along the way.
1587 Analyze_Concatenation_Rest
(NN
);
1591 end Analyze_Concatenation
;
1593 --------------------------------
1594 -- Analyze_Concatenation_Rest --
1595 --------------------------------
1597 -- If the only one-dimensional array type in scope is String,
1598 -- this is the resulting type of the operation. Otherwise there
1599 -- will be a concatenation operation defined for each user-defined
1600 -- one-dimensional array.
1602 procedure Analyze_Concatenation_Rest
(N
: Node_Id
) is
1603 L
: constant Node_Id
:= Left_Opnd
(N
);
1604 R
: constant Node_Id
:= Right_Opnd
(N
);
1605 Op_Id
: Entity_Id
:= Entity
(N
);
1610 Analyze_Expression
(R
);
1612 -- If the entity is present, the node appears in an instance, and
1613 -- denotes a predefined concatenation operation. The resulting type is
1614 -- obtained from the arguments when possible. If the arguments are
1615 -- aggregates, the array type and the concatenation type must be
1618 if Present
(Op_Id
) then
1619 if Ekind
(Op_Id
) = E_Operator
then
1620 LT
:= Base_Type
(Etype
(L
));
1621 RT
:= Base_Type
(Etype
(R
));
1623 if Is_Array_Type
(LT
)
1624 and then (RT
= LT
or else RT
= Base_Type
(Component_Type
(LT
)))
1626 Add_One_Interp
(N
, Op_Id
, LT
);
1628 elsif Is_Array_Type
(RT
)
1629 and then LT
= Base_Type
(Component_Type
(RT
))
1631 Add_One_Interp
(N
, Op_Id
, RT
);
1633 -- If one operand is a string type or a user-defined array type,
1634 -- and the other is a literal, result is of the specific type.
1637 (Root_Type
(LT
) = Standard_String
1638 or else Scope
(LT
) /= Standard_Standard
)
1639 and then Etype
(R
) = Any_String
1641 Add_One_Interp
(N
, Op_Id
, LT
);
1644 (Root_Type
(RT
) = Standard_String
1645 or else Scope
(RT
) /= Standard_Standard
)
1646 and then Etype
(L
) = Any_String
1648 Add_One_Interp
(N
, Op_Id
, RT
);
1650 elsif not Is_Generic_Type
(Etype
(Op_Id
)) then
1651 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1654 -- Type and its operations must be visible
1656 Set_Entity
(N
, Empty
);
1657 Analyze_Concatenation
(N
);
1661 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1665 Op_Id
:= Get_Name_Entity_Id
(Name_Op_Concat
);
1666 while Present
(Op_Id
) loop
1667 if Ekind
(Op_Id
) = E_Operator
then
1669 -- Do not consider operators declared in dead code, they can
1670 -- not be part of the resolution.
1672 if Is_Eliminated
(Op_Id
) then
1675 Find_Concatenation_Types
(L
, R
, Op_Id
, N
);
1679 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1682 Op_Id
:= Homonym
(Op_Id
);
1687 end Analyze_Concatenation_Rest
;
1689 -------------------------
1690 -- Analyze_Equality_Op --
1691 -------------------------
1693 procedure Analyze_Equality_Op
(N
: Node_Id
) is
1694 Loc
: constant Source_Ptr
:= Sloc
(N
);
1695 L
: constant Node_Id
:= Left_Opnd
(N
);
1696 R
: constant Node_Id
:= Right_Opnd
(N
);
1700 Set_Etype
(N
, Any_Type
);
1701 Candidate_Type
:= Empty
;
1703 Analyze_Expression
(L
);
1704 Analyze_Expression
(R
);
1706 -- If the entity is set, the node is a generic instance with a non-local
1707 -- reference to the predefined operator or to a user-defined function.
1708 -- It can also be an inequality that is expanded into the negation of a
1709 -- call to a user-defined equality operator.
1711 -- For the predefined case, the result is Boolean, regardless of the
1712 -- type of the operands. The operands may even be limited, if they are
1713 -- generic actuals. If they are overloaded, label the left argument with
1714 -- the common type that must be present, or with the type of the formal
1715 -- of the user-defined function.
1717 if Present
(Entity
(N
)) then
1718 Op_Id
:= Entity
(N
);
1720 if Ekind
(Op_Id
) = E_Operator
then
1721 Add_One_Interp
(N
, Op_Id
, Standard_Boolean
);
1723 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1726 if Is_Overloaded
(L
) then
1727 if Ekind
(Op_Id
) = E_Operator
then
1728 Set_Etype
(L
, Intersect_Types
(L
, R
));
1730 Set_Etype
(L
, Etype
(First_Formal
(Op_Id
)));
1735 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
1736 while Present
(Op_Id
) loop
1737 if Ekind
(Op_Id
) = E_Operator
then
1738 Find_Equality_Types
(L
, R
, Op_Id
, N
);
1740 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1743 Op_Id
:= Homonym
(Op_Id
);
1747 -- If there was no match, and the operator is inequality, this may
1748 -- be a case where inequality has not been made explicit, as for
1749 -- tagged types. Analyze the node as the negation of an equality
1750 -- operation. This cannot be done earlier, because before analysis
1751 -- we cannot rule out the presence of an explicit inequality.
1753 if Etype
(N
) = Any_Type
1754 and then Nkind
(N
) = N_Op_Ne
1756 Op_Id
:= Get_Name_Entity_Id
(Name_Op_Eq
);
1757 while Present
(Op_Id
) loop
1758 if Ekind
(Op_Id
) = E_Operator
then
1759 Find_Equality_Types
(L
, R
, Op_Id
, N
);
1761 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1764 Op_Id
:= Homonym
(Op_Id
);
1767 if Etype
(N
) /= Any_Type
then
1768 Op_Id
:= Entity
(N
);
1774 Left_Opnd
=> Left_Opnd
(N
),
1775 Right_Opnd
=> Right_Opnd
(N
))));
1777 Set_Entity
(Right_Opnd
(N
), Op_Id
);
1783 end Analyze_Equality_Op
;
1785 ----------------------------------
1786 -- Analyze_Explicit_Dereference --
1787 ----------------------------------
1789 procedure Analyze_Explicit_Dereference
(N
: Node_Id
) is
1790 Loc
: constant Source_Ptr
:= Sloc
(N
);
1791 P
: constant Node_Id
:= Prefix
(N
);
1797 function Is_Function_Type
return Boolean;
1798 -- Check whether node may be interpreted as an implicit function call
1800 ----------------------
1801 -- Is_Function_Type --
1802 ----------------------
1804 function Is_Function_Type
return Boolean is
1809 if not Is_Overloaded
(N
) then
1810 return Ekind
(Base_Type
(Etype
(N
))) = E_Subprogram_Type
1811 and then Etype
(Base_Type
(Etype
(N
))) /= Standard_Void_Type
;
1814 Get_First_Interp
(N
, I
, It
);
1815 while Present
(It
.Nam
) loop
1816 if Ekind
(Base_Type
(It
.Typ
)) /= E_Subprogram_Type
1817 or else Etype
(Base_Type
(It
.Typ
)) = Standard_Void_Type
1822 Get_Next_Interp
(I
, It
);
1827 end Is_Function_Type
;
1829 -- Start of processing for Analyze_Explicit_Dereference
1832 -- If source node, check SPARK restriction. We guard this with the
1833 -- source node check, because ???
1835 if Comes_From_Source
(N
) then
1836 Check_SPARK_05_Restriction
("explicit dereference is not allowed", N
);
1839 -- In formal verification mode, keep track of all reads and writes
1840 -- through explicit dereferences.
1842 if GNATprove_Mode
then
1843 SPARK_Specific
.Generate_Dereference
(N
);
1847 Set_Etype
(N
, Any_Type
);
1849 -- Test for remote access to subprogram type, and if so return
1850 -- after rewriting the original tree.
1852 if Remote_AST_E_Dereference
(P
) then
1856 -- Normal processing for other than remote access to subprogram type
1858 if not Is_Overloaded
(P
) then
1859 if Is_Access_Type
(Etype
(P
)) then
1861 -- Set the Etype. We need to go through Is_For_Access_Subtypes to
1862 -- avoid other problems caused by the Private_Subtype and it is
1863 -- safe to go to the Base_Type because this is the same as
1864 -- converting the access value to its Base_Type.
1867 DT
: Entity_Id
:= Designated_Type
(Etype
(P
));
1870 if Ekind
(DT
) = E_Private_Subtype
1871 and then Is_For_Access_Subtype
(DT
)
1873 DT
:= Base_Type
(DT
);
1876 -- An explicit dereference is a legal occurrence of an
1877 -- incomplete type imported through a limited_with clause,
1878 -- if the full view is visible.
1880 if From_Limited_With
(DT
)
1881 and then not From_Limited_With
(Scope
(DT
))
1883 (Is_Immediately_Visible
(Scope
(DT
))
1885 (Is_Child_Unit
(Scope
(DT
))
1886 and then Is_Visible_Lib_Unit
(Scope
(DT
))))
1888 Set_Etype
(N
, Available_View
(DT
));
1895 elsif Etype
(P
) /= Any_Type
then
1896 Error_Msg_N
("prefix of dereference must be an access type", N
);
1901 Get_First_Interp
(P
, I
, It
);
1902 while Present
(It
.Nam
) loop
1905 if Is_Access_Type
(T
) then
1906 Add_One_Interp
(N
, Designated_Type
(T
), Designated_Type
(T
));
1909 Get_Next_Interp
(I
, It
);
1912 -- Error if no interpretation of the prefix has an access type
1914 if Etype
(N
) = Any_Type
then
1916 ("access type required in prefix of explicit dereference", P
);
1917 Set_Etype
(N
, Any_Type
);
1923 and then Nkind
(Parent
(N
)) /= N_Indexed_Component
1925 and then (Nkind
(Parent
(N
)) /= N_Function_Call
1926 or else N
/= Name
(Parent
(N
)))
1928 and then (Nkind
(Parent
(N
)) /= N_Procedure_Call_Statement
1929 or else N
/= Name
(Parent
(N
)))
1931 and then Nkind
(Parent
(N
)) /= N_Subprogram_Renaming_Declaration
1932 and then (Nkind
(Parent
(N
)) /= N_Attribute_Reference
1934 (Attribute_Name
(Parent
(N
)) /= Name_Address
1936 Attribute_Name
(Parent
(N
)) /= Name_Access
))
1938 -- Name is a function call with no actuals, in a context that
1939 -- requires deproceduring (including as an actual in an enclosing
1940 -- function or procedure call). There are some pathological cases
1941 -- where the prefix might include functions that return access to
1942 -- subprograms and others that return a regular type. Disambiguation
1943 -- of those has to take place in Resolve.
1946 Make_Function_Call
(Loc
,
1947 Name
=> Make_Explicit_Dereference
(Loc
, P
),
1948 Parameter_Associations
=> New_List
);
1950 -- If the prefix is overloaded, remove operations that have formals,
1951 -- we know that this is a parameterless call.
1953 if Is_Overloaded
(P
) then
1954 Get_First_Interp
(P
, I
, It
);
1955 while Present
(It
.Nam
) loop
1958 if No
(First_Formal
(Base_Type
(Designated_Type
(T
)))) then
1964 Get_Next_Interp
(I
, It
);
1971 elsif not Is_Function_Type
1972 and then Is_Overloaded
(N
)
1974 -- The prefix may include access to subprograms and other access
1975 -- types. If the context selects the interpretation that is a
1976 -- function call (not a procedure call) we cannot rewrite the node
1977 -- yet, but we include the result of the call interpretation.
1979 Get_First_Interp
(N
, I
, It
);
1980 while Present
(It
.Nam
) loop
1981 if Ekind
(Base_Type
(It
.Typ
)) = E_Subprogram_Type
1982 and then Etype
(Base_Type
(It
.Typ
)) /= Standard_Void_Type
1983 and then Nkind
(Parent
(N
)) /= N_Procedure_Call_Statement
1985 Add_One_Interp
(N
, Etype
(It
.Typ
), Etype
(It
.Typ
));
1988 Get_Next_Interp
(I
, It
);
1992 -- A value of remote access-to-class-wide must not be dereferenced
1995 Validate_Remote_Access_To_Class_Wide_Type
(N
);
1996 end Analyze_Explicit_Dereference
;
1998 ------------------------
1999 -- Analyze_Expression --
2000 ------------------------
2002 procedure Analyze_Expression
(N
: Node_Id
) is
2005 -- If the expression is an indexed component that will be rewritten
2006 -- as a container indexing, it has already been analyzed.
2008 if Nkind
(N
) = N_Indexed_Component
2009 and then Present
(Generalized_Indexing
(N
))
2015 Check_Parameterless_Call
(N
);
2017 end Analyze_Expression
;
2019 -------------------------------------
2020 -- Analyze_Expression_With_Actions --
2021 -------------------------------------
2023 procedure Analyze_Expression_With_Actions
(N
: Node_Id
) is
2027 A
:= First
(Actions
(N
));
2028 while Present
(A
) loop
2033 Analyze_Expression
(Expression
(N
));
2034 Set_Etype
(N
, Etype
(Expression
(N
)));
2035 end Analyze_Expression_With_Actions
;
2037 ---------------------------
2038 -- Analyze_If_Expression --
2039 ---------------------------
2041 procedure Analyze_If_Expression
(N
: Node_Id
) is
2042 Condition
: constant Node_Id
:= First
(Expressions
(N
));
2043 Then_Expr
: constant Node_Id
:= Next
(Condition
);
2044 Else_Expr
: Node_Id
;
2047 -- Defend against error of missing expressions from previous error
2049 if No
(Then_Expr
) then
2050 Check_Error_Detected
;
2054 if Comes_From_Source
(N
) then
2055 Check_SPARK_05_Restriction
("if expression is not allowed", N
);
2058 Else_Expr
:= Next
(Then_Expr
);
2060 if Comes_From_Source
(N
) then
2061 Check_Compiler_Unit
("if expression", N
);
2064 -- Analyze and resolve the condition. We need to resolve this now so
2065 -- that it gets folded to True/False if possible, before we analyze
2066 -- the THEN/ELSE branches, because when analyzing these branches, we
2067 -- may call Is_Statically_Unevaluated, which expects the condition of
2068 -- an enclosing IF to have been analyze/resolved/evaluated.
2070 Analyze_Expression
(Condition
);
2071 Resolve
(Condition
, Any_Boolean
);
2073 -- Analyze THEN expression and (if present) ELSE expression. For those
2074 -- we delay resolution in the normal manner, because of overloading etc.
2076 Analyze_Expression
(Then_Expr
);
2078 if Present
(Else_Expr
) then
2079 Analyze_Expression
(Else_Expr
);
2082 -- If then expression not overloaded, then that decides the type
2084 if not Is_Overloaded
(Then_Expr
) then
2085 Set_Etype
(N
, Etype
(Then_Expr
));
2087 -- Case where then expression is overloaded
2095 Set_Etype
(N
, Any_Type
);
2097 -- Shouldn't the following statement be down in the ELSE of the
2098 -- following loop? ???
2100 Get_First_Interp
(Then_Expr
, I
, It
);
2102 -- if no Else_Expression the conditional must be boolean
2104 if No
(Else_Expr
) then
2105 Set_Etype
(N
, Standard_Boolean
);
2107 -- Else_Expression Present. For each possible intepretation of
2108 -- the Then_Expression, add it only if the Else_Expression has
2109 -- a compatible type.
2112 while Present
(It
.Nam
) loop
2113 if Has_Compatible_Type
(Else_Expr
, It
.Typ
) then
2114 Add_One_Interp
(N
, It
.Typ
, It
.Typ
);
2117 Get_Next_Interp
(I
, It
);
2122 end Analyze_If_Expression
;
2124 ------------------------------------
2125 -- Analyze_Indexed_Component_Form --
2126 ------------------------------------
2128 procedure Analyze_Indexed_Component_Form
(N
: Node_Id
) is
2129 P
: constant Node_Id
:= Prefix
(N
);
2130 Exprs
: constant List_Id
:= Expressions
(N
);
2136 procedure Process_Function_Call
;
2137 -- Prefix in indexed component form is an overloadable entity,
2138 -- so the node is a function call. Reformat it as such.
2140 procedure Process_Indexed_Component
;
2141 -- Prefix in indexed component form is actually an indexed component.
2142 -- This routine processes it, knowing that the prefix is already
2145 procedure Process_Indexed_Component_Or_Slice
;
2146 -- An indexed component with a single index may designate a slice if
2147 -- the index is a subtype mark. This routine disambiguates these two
2148 -- cases by resolving the prefix to see if it is a subtype mark.
2150 procedure Process_Overloaded_Indexed_Component
;
2151 -- If the prefix of an indexed component is overloaded, the proper
2152 -- interpretation is selected by the index types and the context.
2154 ---------------------------
2155 -- Process_Function_Call --
2156 ---------------------------
2158 procedure Process_Function_Call
is
2159 Loc
: constant Source_Ptr
:= Sloc
(N
);
2163 Change_Node
(N
, N_Function_Call
);
2165 Set_Parameter_Associations
(N
, Exprs
);
2167 -- Analyze actuals prior to analyzing the call itself
2169 Actual
:= First
(Parameter_Associations
(N
));
2170 while Present
(Actual
) loop
2172 Check_Parameterless_Call
(Actual
);
2174 -- Move to next actual. Note that we use Next, not Next_Actual
2175 -- here. The reason for this is a bit subtle. If a function call
2176 -- includes named associations, the parser recognizes the node as
2177 -- a call, and it is analyzed as such. If all associations are
2178 -- positional, the parser builds an indexed_component node, and
2179 -- it is only after analysis of the prefix that the construct
2180 -- is recognized as a call, in which case Process_Function_Call
2181 -- rewrites the node and analyzes the actuals. If the list of
2182 -- actuals is malformed, the parser may leave the node as an
2183 -- indexed component (despite the presence of named associations).
2184 -- The iterator Next_Actual is equivalent to Next if the list is
2185 -- positional, but follows the normalized chain of actuals when
2186 -- named associations are present. In this case normalization has
2187 -- not taken place, and actuals remain unanalyzed, which leads to
2188 -- subsequent crashes or loops if there is an attempt to continue
2189 -- analysis of the program.
2191 -- IF there is a single actual and it is a type name, the node
2192 -- can only be interpreted as a slice of a parameterless call.
2193 -- Rebuild the node as such and analyze.
2195 if No
(Next
(Actual
))
2196 and then Is_Entity_Name
(Actual
)
2197 and then Is_Type
(Entity
(Actual
))
2198 and then Is_Discrete_Type
(Entity
(Actual
))
2204 New_Occurrence_Of
(Entity
(Actual
), Loc
)));
2214 end Process_Function_Call
;
2216 -------------------------------
2217 -- Process_Indexed_Component --
2218 -------------------------------
2220 procedure Process_Indexed_Component
is
2222 Array_Type
: Entity_Id
;
2224 Pent
: Entity_Id
:= Empty
;
2227 Exp
:= First
(Exprs
);
2229 if Is_Overloaded
(P
) then
2230 Process_Overloaded_Indexed_Component
;
2233 Array_Type
:= Etype
(P
);
2235 if Is_Entity_Name
(P
) then
2237 elsif Nkind
(P
) = N_Selected_Component
2238 and then Is_Entity_Name
(Selector_Name
(P
))
2240 Pent
:= Entity
(Selector_Name
(P
));
2243 -- Prefix must be appropriate for an array type, taking into
2244 -- account a possible implicit dereference.
2246 if Is_Access_Type
(Array_Type
) then
2248 (Warn_On_Dereference
, "?d?implicit dereference", N
);
2249 Array_Type
:= Process_Implicit_Dereference_Prefix
(Pent
, P
);
2252 if Is_Array_Type
(Array_Type
) then
2255 elsif Present
(Pent
) and then Ekind
(Pent
) = E_Entry_Family
then
2257 Set_Etype
(N
, Any_Type
);
2259 if not Has_Compatible_Type
2260 (Exp
, Entry_Index_Type
(Pent
))
2262 Error_Msg_N
("invalid index type in entry name", N
);
2264 elsif Present
(Next
(Exp
)) then
2265 Error_Msg_N
("too many subscripts in entry reference", N
);
2268 Set_Etype
(N
, Etype
(P
));
2273 elsif Is_Record_Type
(Array_Type
)
2274 and then Remote_AST_I_Dereference
(P
)
2278 elsif Try_Container_Indexing
(N
, P
, Exprs
) then
2281 elsif Array_Type
= Any_Type
then
2282 Set_Etype
(N
, Any_Type
);
2284 -- In most cases the analysis of the prefix will have emitted
2285 -- an error already, but if the prefix may be interpreted as a
2286 -- call in prefixed notation, the report is left to the caller.
2287 -- To prevent cascaded errors, report only if no previous ones.
2289 if Serious_Errors_Detected
= 0 then
2290 Error_Msg_N
("invalid prefix in indexed component", P
);
2292 if Nkind
(P
) = N_Expanded_Name
then
2293 Error_Msg_NE
("\& is not visible", P
, Selector_Name
(P
));
2299 -- Here we definitely have a bad indexing
2302 if Nkind
(Parent
(N
)) = N_Requeue_Statement
2303 and then Present
(Pent
) and then Ekind
(Pent
) = E_Entry
2306 ("REQUEUE does not permit parameters", First
(Exprs
));
2308 elsif Is_Entity_Name
(P
)
2309 and then Etype
(P
) = Standard_Void_Type
2311 Error_Msg_NE
("incorrect use of&", P
, Entity
(P
));
2314 Error_Msg_N
("array type required in indexed component", P
);
2317 Set_Etype
(N
, Any_Type
);
2321 Index
:= First_Index
(Array_Type
);
2322 while Present
(Index
) and then Present
(Exp
) loop
2323 if not Has_Compatible_Type
(Exp
, Etype
(Index
)) then
2324 Wrong_Type
(Exp
, Etype
(Index
));
2325 Set_Etype
(N
, Any_Type
);
2333 Set_Etype
(N
, Component_Type
(Array_Type
));
2334 Check_Implicit_Dereference
(N
, Etype
(N
));
2336 if Present
(Index
) then
2338 ("too few subscripts in array reference", First
(Exprs
));
2340 elsif Present
(Exp
) then
2341 Error_Msg_N
("too many subscripts in array reference", Exp
);
2344 end Process_Indexed_Component
;
2346 ----------------------------------------
2347 -- Process_Indexed_Component_Or_Slice --
2348 ----------------------------------------
2350 procedure Process_Indexed_Component_Or_Slice
is
2352 Exp
:= First
(Exprs
);
2353 while Present
(Exp
) loop
2354 Analyze_Expression
(Exp
);
2358 Exp
:= First
(Exprs
);
2360 -- If one index is present, and it is a subtype name, then the
2361 -- node denotes a slice (note that the case of an explicit range
2362 -- for a slice was already built as an N_Slice node in the first
2363 -- place, so that case is not handled here).
2365 -- We use a replace rather than a rewrite here because this is one
2366 -- of the cases in which the tree built by the parser is plain wrong.
2369 and then Is_Entity_Name
(Exp
)
2370 and then Is_Type
(Entity
(Exp
))
2373 Make_Slice
(Sloc
(N
),
2375 Discrete_Range
=> New_Copy
(Exp
)));
2378 -- Otherwise (more than one index present, or single index is not
2379 -- a subtype name), then we have the indexed component case.
2382 Process_Indexed_Component
;
2384 end Process_Indexed_Component_Or_Slice
;
2386 ------------------------------------------
2387 -- Process_Overloaded_Indexed_Component --
2388 ------------------------------------------
2390 procedure Process_Overloaded_Indexed_Component
is
2399 Set_Etype
(N
, Any_Type
);
2401 Get_First_Interp
(P
, I
, It
);
2402 while Present
(It
.Nam
) loop
2405 if Is_Access_Type
(Typ
) then
2406 Typ
:= Designated_Type
(Typ
);
2408 (Warn_On_Dereference
, "?d?implicit dereference", N
);
2411 if Is_Array_Type
(Typ
) then
2413 -- Got a candidate: verify that index types are compatible
2415 Index
:= First_Index
(Typ
);
2417 Exp
:= First
(Exprs
);
2418 while Present
(Index
) and then Present
(Exp
) loop
2419 if Has_Compatible_Type
(Exp
, Etype
(Index
)) then
2431 if Found
and then No
(Index
) and then No
(Exp
) then
2433 CT
: constant Entity_Id
:=
2434 Base_Type
(Component_Type
(Typ
));
2436 Add_One_Interp
(N
, CT
, CT
);
2437 Check_Implicit_Dereference
(N
, CT
);
2441 elsif Try_Container_Indexing
(N
, P
, Exprs
) then
2446 Get_Next_Interp
(I
, It
);
2449 if Etype
(N
) = Any_Type
then
2450 Error_Msg_N
("no legal interpretation for indexed component", N
);
2451 Set_Is_Overloaded
(N
, False);
2455 end Process_Overloaded_Indexed_Component
;
2457 -- Start of processing for Analyze_Indexed_Component_Form
2460 -- Get name of array, function or type
2464 -- If P is an explicit dereference whose prefix is of a remote access-
2465 -- to-subprogram type, then N has already been rewritten as a subprogram
2466 -- call and analyzed.
2468 if Nkind
(N
) in N_Subprogram_Call
then
2471 -- When the prefix is attribute 'Loop_Entry and the sole expression of
2472 -- the indexed component denotes a loop name, the indexed form is turned
2473 -- into an attribute reference.
2475 elsif Nkind
(N
) = N_Attribute_Reference
2476 and then Attribute_Name
(N
) = Name_Loop_Entry
2481 pragma Assert
(Nkind
(N
) = N_Indexed_Component
);
2483 P_T
:= Base_Type
(Etype
(P
));
2485 if Is_Entity_Name
(P
) and then Present
(Entity
(P
)) then
2488 if Is_Type
(U_N
) then
2490 -- Reformat node as a type conversion
2492 E
:= Remove_Head
(Exprs
);
2494 if Present
(First
(Exprs
)) then
2496 ("argument of type conversion must be single expression", N
);
2499 Change_Node
(N
, N_Type_Conversion
);
2500 Set_Subtype_Mark
(N
, P
);
2502 Set_Expression
(N
, E
);
2504 -- After changing the node, call for the specific Analysis
2505 -- routine directly, to avoid a double call to the expander.
2507 Analyze_Type_Conversion
(N
);
2511 if Is_Overloadable
(U_N
) then
2512 Process_Function_Call
;
2514 elsif Ekind
(Etype
(P
)) = E_Subprogram_Type
2515 or else (Is_Access_Type
(Etype
(P
))
2517 Ekind
(Designated_Type
(Etype
(P
))) =
2520 -- Call to access_to-subprogram with possible implicit dereference
2522 Process_Function_Call
;
2524 elsif Is_Generic_Subprogram
(U_N
) then
2526 -- A common beginner's (or C++ templates fan) error
2528 Error_Msg_N
("generic subprogram cannot be called", N
);
2529 Set_Etype
(N
, Any_Type
);
2533 Process_Indexed_Component_Or_Slice
;
2536 -- If not an entity name, prefix is an expression that may denote
2537 -- an array or an access-to-subprogram.
2540 if Ekind
(P_T
) = E_Subprogram_Type
2541 or else (Is_Access_Type
(P_T
)
2543 Ekind
(Designated_Type
(P_T
)) = E_Subprogram_Type
)
2545 Process_Function_Call
;
2547 elsif Nkind
(P
) = N_Selected_Component
2548 and then Present
(Entity
(Selector_Name
(P
)))
2549 and then Is_Overloadable
(Entity
(Selector_Name
(P
)))
2551 Process_Function_Call
;
2553 -- In ASIS mode within a generic, a prefixed call is analyzed and
2554 -- partially rewritten but the original indexed component has not
2555 -- yet been rewritten as a call. Perform the replacement now.
2557 elsif Nkind
(P
) = N_Selected_Component
2558 and then Nkind
(Parent
(P
)) = N_Function_Call
2561 Rewrite
(N
, Parent
(P
));
2565 -- Indexed component, slice, or a call to a member of a family
2566 -- entry, which will be converted to an entry call later.
2568 Process_Indexed_Component_Or_Slice
;
2572 Analyze_Dimension
(N
);
2573 end Analyze_Indexed_Component_Form
;
2575 ------------------------
2576 -- Analyze_Logical_Op --
2577 ------------------------
2579 procedure Analyze_Logical_Op
(N
: Node_Id
) is
2580 L
: constant Node_Id
:= Left_Opnd
(N
);
2581 R
: constant Node_Id
:= Right_Opnd
(N
);
2582 Op_Id
: Entity_Id
:= Entity
(N
);
2585 Set_Etype
(N
, Any_Type
);
2586 Candidate_Type
:= Empty
;
2588 Analyze_Expression
(L
);
2589 Analyze_Expression
(R
);
2591 if Present
(Op_Id
) then
2593 if Ekind
(Op_Id
) = E_Operator
then
2594 Find_Boolean_Types
(L
, R
, Op_Id
, N
);
2596 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
2600 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
2601 while Present
(Op_Id
) loop
2602 if Ekind
(Op_Id
) = E_Operator
then
2603 Find_Boolean_Types
(L
, R
, Op_Id
, N
);
2605 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
2608 Op_Id
:= Homonym
(Op_Id
);
2613 end Analyze_Logical_Op
;
2615 ---------------------------
2616 -- Analyze_Membership_Op --
2617 ---------------------------
2619 procedure Analyze_Membership_Op
(N
: Node_Id
) is
2620 Loc
: constant Source_Ptr
:= Sloc
(N
);
2621 L
: constant Node_Id
:= Left_Opnd
(N
);
2622 R
: constant Node_Id
:= Right_Opnd
(N
);
2624 Index
: Interp_Index
;
2626 Found
: Boolean := False;
2630 procedure Try_One_Interp
(T1
: Entity_Id
);
2631 -- Routine to try one proposed interpretation. Note that the context
2632 -- of the operation plays no role in resolving the arguments, so that
2633 -- if there is more than one interpretation of the operands that is
2634 -- compatible with a membership test, the operation is ambiguous.
2636 --------------------
2637 -- Try_One_Interp --
2638 --------------------
2640 procedure Try_One_Interp
(T1
: Entity_Id
) is
2642 if Has_Compatible_Type
(R
, T1
) then
2644 and then Base_Type
(T1
) /= Base_Type
(T_F
)
2646 It
:= Disambiguate
(L
, I_F
, Index
, Any_Type
);
2648 if It
= No_Interp
then
2649 Ambiguous_Operands
(N
);
2650 Set_Etype
(L
, Any_Type
);
2667 procedure Analyze_Set_Membership
;
2668 -- If a set of alternatives is present, analyze each and find the
2669 -- common type to which they must all resolve.
2671 ----------------------------
2672 -- Analyze_Set_Membership --
2673 ----------------------------
2675 procedure Analyze_Set_Membership
is
2677 Index
: Interp_Index
;
2679 Candidate_Interps
: Node_Id
;
2680 Common_Type
: Entity_Id
:= Empty
;
2683 if Comes_From_Source
(N
) then
2684 Check_Compiler_Unit
("set membership", N
);
2688 Candidate_Interps
:= L
;
2690 if not Is_Overloaded
(L
) then
2691 Common_Type
:= Etype
(L
);
2693 Alt
:= First
(Alternatives
(N
));
2694 while Present
(Alt
) loop
2697 if not Has_Compatible_Type
(Alt
, Common_Type
) then
2698 Wrong_Type
(Alt
, Common_Type
);
2705 Alt
:= First
(Alternatives
(N
));
2706 while Present
(Alt
) loop
2708 if not Is_Overloaded
(Alt
) then
2709 Common_Type
:= Etype
(Alt
);
2712 Get_First_Interp
(Alt
, Index
, It
);
2713 while Present
(It
.Typ
) loop
2715 Has_Compatible_Type
(Candidate_Interps
, It
.Typ
)
2717 Remove_Interp
(Index
);
2720 Get_Next_Interp
(Index
, It
);
2723 Get_First_Interp
(Alt
, Index
, It
);
2726 Error_Msg_N
("alternative has no legal type", Alt
);
2730 -- If alternative is not overloaded, we have a unique type
2733 Set_Etype
(Alt
, It
.Typ
);
2734 Get_Next_Interp
(Index
, It
);
2737 Set_Is_Overloaded
(Alt
, False);
2738 Common_Type
:= Etype
(Alt
);
2741 Candidate_Interps
:= Alt
;
2748 Set_Etype
(N
, Standard_Boolean
);
2750 if Present
(Common_Type
) then
2751 Set_Etype
(L
, Common_Type
);
2752 Set_Is_Overloaded
(L
, False);
2755 Error_Msg_N
("cannot resolve membership operation", N
);
2757 end Analyze_Set_Membership
;
2759 -- Start of processing for Analyze_Membership_Op
2762 Analyze_Expression
(L
);
2764 if No
(R
) and then Ada_Version
>= Ada_2012
then
2765 Analyze_Set_Membership
;
2769 if Nkind
(R
) = N_Range
2770 or else (Nkind
(R
) = N_Attribute_Reference
2771 and then Attribute_Name
(R
) = Name_Range
)
2775 if not Is_Overloaded
(L
) then
2776 Try_One_Interp
(Etype
(L
));
2779 Get_First_Interp
(L
, Index
, It
);
2780 while Present
(It
.Typ
) loop
2781 Try_One_Interp
(It
.Typ
);
2782 Get_Next_Interp
(Index
, It
);
2786 -- If not a range, it can be a subtype mark, or else it is a degenerate
2787 -- membership test with a singleton value, i.e. a test for equality,
2788 -- if the types are compatible.
2793 if Is_Entity_Name
(R
)
2794 and then Is_Type
(Entity
(R
))
2797 Check_Fully_Declared
(Entity
(R
), R
);
2799 elsif Ada_Version
>= Ada_2012
2800 and then Has_Compatible_Type
(R
, Etype
(L
))
2802 if Nkind
(N
) = N_In
then
2818 -- In all versions of the language, if we reach this point there
2819 -- is a previous error that will be diagnosed below.
2825 -- Compatibility between expression and subtype mark or range is
2826 -- checked during resolution. The result of the operation is Boolean
2829 Set_Etype
(N
, Standard_Boolean
);
2831 if Comes_From_Source
(N
)
2832 and then Present
(Right_Opnd
(N
))
2833 and then Is_CPP_Class
(Etype
(Etype
(Right_Opnd
(N
))))
2835 Error_Msg_N
("membership test not applicable to cpp-class types", N
);
2837 end Analyze_Membership_Op
;
2843 procedure Analyze_Mod
(N
: Node_Id
) is
2845 -- A special warning check, if we have an expression of the form:
2846 -- expr mod 2 * literal
2847 -- where literal is 64 or less, then probably what was meant was
2848 -- expr mod 2 ** literal
2849 -- so issue an appropriate warning.
2851 if Warn_On_Suspicious_Modulus_Value
2852 and then Nkind
(Right_Opnd
(N
)) = N_Integer_Literal
2853 and then Intval
(Right_Opnd
(N
)) = Uint_2
2854 and then Nkind
(Parent
(N
)) = N_Op_Multiply
2855 and then Nkind
(Right_Opnd
(Parent
(N
))) = N_Integer_Literal
2856 and then Intval
(Right_Opnd
(Parent
(N
))) <= Uint_64
2859 ("suspicious MOD value, was '*'* intended'??M?", Parent
(N
));
2862 -- Remaining processing is same as for other arithmetic operators
2864 Analyze_Arithmetic_Op
(N
);
2867 ----------------------
2868 -- Analyze_Negation --
2869 ----------------------
2871 procedure Analyze_Negation
(N
: Node_Id
) is
2872 R
: constant Node_Id
:= Right_Opnd
(N
);
2873 Op_Id
: Entity_Id
:= Entity
(N
);
2876 Set_Etype
(N
, Any_Type
);
2877 Candidate_Type
:= Empty
;
2879 Analyze_Expression
(R
);
2881 if Present
(Op_Id
) then
2882 if Ekind
(Op_Id
) = E_Operator
then
2883 Find_Negation_Types
(R
, Op_Id
, N
);
2885 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
2889 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
2890 while Present
(Op_Id
) loop
2891 if Ekind
(Op_Id
) = E_Operator
then
2892 Find_Negation_Types
(R
, Op_Id
, N
);
2894 Analyze_User_Defined_Unary_Op
(N
, Op_Id
);
2897 Op_Id
:= Homonym
(Op_Id
);
2902 end Analyze_Negation
;
2908 procedure Analyze_Null
(N
: Node_Id
) is
2910 Check_SPARK_05_Restriction
("null is not allowed", N
);
2912 Set_Etype
(N
, Any_Access
);
2915 ----------------------
2916 -- Analyze_One_Call --
2917 ----------------------
2919 procedure Analyze_One_Call
2923 Success
: out Boolean;
2924 Skip_First
: Boolean := False)
2926 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
2927 Prev_T
: constant Entity_Id
:= Etype
(N
);
2929 Must_Skip
: constant Boolean := Skip_First
2930 or else Nkind
(Original_Node
(N
)) = N_Selected_Component
2932 (Nkind
(Original_Node
(N
)) = N_Indexed_Component
2933 and then Nkind
(Prefix
(Original_Node
(N
)))
2934 = N_Selected_Component
);
2935 -- The first formal must be omitted from the match when trying to find
2936 -- a primitive operation that is a possible interpretation, and also
2937 -- after the call has been rewritten, because the corresponding actual
2938 -- is already known to be compatible, and because this may be an
2939 -- indexing of a call with default parameters.
2943 Is_Indexed
: Boolean := False;
2944 Is_Indirect
: Boolean := False;
2945 Subp_Type
: constant Entity_Id
:= Etype
(Nam
);
2948 function Operator_Hidden_By
(Fun
: Entity_Id
) return Boolean;
2949 -- There may be a user-defined operator that hides the current
2950 -- interpretation. We must check for this independently of the
2951 -- analysis of the call with the user-defined operation, because
2952 -- the parameter names may be wrong and yet the hiding takes place.
2953 -- This fixes a problem with ACATS test B34014O.
2955 -- When the type Address is a visible integer type, and the DEC
2956 -- system extension is visible, the predefined operator may be
2957 -- hidden as well, by one of the address operations in auxdec.
2958 -- Finally, The abstract operations on address do not hide the
2959 -- predefined operator (this is the purpose of making them abstract).
2961 procedure Indicate_Name_And_Type
;
2962 -- If candidate interpretation matches, indicate name and type of
2963 -- result on call node.
2965 ----------------------------
2966 -- Indicate_Name_And_Type --
2967 ----------------------------
2969 procedure Indicate_Name_And_Type
is
2971 Add_One_Interp
(N
, Nam
, Etype
(Nam
));
2972 Check_Implicit_Dereference
(N
, Etype
(Nam
));
2975 -- If the prefix of the call is a name, indicate the entity
2976 -- being called. If it is not a name, it is an expression that
2977 -- denotes an access to subprogram or else an entry or family. In
2978 -- the latter case, the name is a selected component, and the entity
2979 -- being called is noted on the selector.
2981 if not Is_Type
(Nam
) then
2982 if Is_Entity_Name
(Name
(N
)) then
2983 Set_Entity
(Name
(N
), Nam
);
2985 elsif Nkind
(Name
(N
)) = N_Selected_Component
then
2986 Set_Entity
(Selector_Name
(Name
(N
)), Nam
);
2990 if Debug_Flag_E
and not Report
then
2991 Write_Str
(" Overloaded call ");
2992 Write_Int
(Int
(N
));
2993 Write_Str
(" compatible with ");
2994 Write_Int
(Int
(Nam
));
2997 end Indicate_Name_And_Type
;
2999 ------------------------
3000 -- Operator_Hidden_By --
3001 ------------------------
3003 function Operator_Hidden_By
(Fun
: Entity_Id
) return Boolean is
3004 Act1
: constant Node_Id
:= First_Actual
(N
);
3005 Act2
: constant Node_Id
:= Next_Actual
(Act1
);
3006 Form1
: constant Entity_Id
:= First_Formal
(Fun
);
3007 Form2
: constant Entity_Id
:= Next_Formal
(Form1
);
3010 if Ekind
(Fun
) /= E_Function
or else Is_Abstract_Subprogram
(Fun
) then
3013 elsif not Has_Compatible_Type
(Act1
, Etype
(Form1
)) then
3016 elsif Present
(Form2
) then
3018 or else not Has_Compatible_Type
(Act2
, Etype
(Form2
))
3023 elsif Present
(Act2
) then
3027 -- Now we know that the arity of the operator matches the function,
3028 -- and the function call is a valid interpretation. The function
3029 -- hides the operator if it has the right signature, or if one of
3030 -- its operands is a non-abstract operation on Address when this is
3031 -- a visible integer type.
3033 return Hides_Op
(Fun
, Nam
)
3034 or else Is_Descendent_Of_Address
(Etype
(Form1
))
3037 and then Is_Descendent_Of_Address
(Etype
(Form2
)));
3038 end Operator_Hidden_By
;
3040 -- Start of processing for Analyze_One_Call
3045 -- If the subprogram has no formals or if all the formals have defaults,
3046 -- and the return type is an array type, the node may denote an indexing
3047 -- of the result of a parameterless call. In Ada 2005, the subprogram
3048 -- may have one non-defaulted formal, and the call may have been written
3049 -- in prefix notation, so that the rebuilt parameter list has more than
3052 if not Is_Overloadable
(Nam
)
3053 and then Ekind
(Nam
) /= E_Subprogram_Type
3054 and then Ekind
(Nam
) /= E_Entry_Family
3059 -- An indexing requires at least one actual. The name of the call cannot
3060 -- be an implicit indirect call, so it cannot be a generated explicit
3063 if not Is_Empty_List
(Actuals
)
3065 (Needs_No_Actuals
(Nam
)
3067 (Needs_One_Actual
(Nam
)
3068 and then Present
(Next_Actual
(First
(Actuals
)))))
3070 if Is_Array_Type
(Subp_Type
)
3072 (Nkind
(Name
(N
)) /= N_Explicit_Dereference
3073 or else Comes_From_Source
(Name
(N
)))
3075 Is_Indexed
:= Try_Indexed_Call
(N
, Nam
, Subp_Type
, Must_Skip
);
3077 elsif Is_Access_Type
(Subp_Type
)
3078 and then Is_Array_Type
(Designated_Type
(Subp_Type
))
3082 (N
, Nam
, Designated_Type
(Subp_Type
), Must_Skip
);
3084 -- The prefix can also be a parameterless function that returns an
3085 -- access to subprogram, in which case this is an indirect call.
3086 -- If this succeeds, an explicit dereference is added later on,
3087 -- in Analyze_Call or Resolve_Call.
3089 elsif Is_Access_Type
(Subp_Type
)
3090 and then Ekind
(Designated_Type
(Subp_Type
)) = E_Subprogram_Type
3092 Is_Indirect
:= Try_Indirect_Call
(N
, Nam
, Subp_Type
);
3097 -- If the call has been transformed into a slice, it is of the form
3098 -- F (Subtype) where F is parameterless. The node has been rewritten in
3099 -- Try_Indexed_Call and there is nothing else to do.
3102 and then Nkind
(N
) = N_Slice
3108 (N
, Nam
, (Report
and not Is_Indexed
and not Is_Indirect
), Norm_OK
);
3112 -- If an indirect call is a possible interpretation, indicate
3113 -- success to the caller. This may be an indexing of an explicit
3114 -- dereference of a call that returns an access type (see above).
3118 and then Nkind
(Name
(N
)) = N_Explicit_Dereference
3119 and then Comes_From_Source
(Name
(N
)))
3124 -- Mismatch in number or names of parameters
3126 elsif Debug_Flag_E
then
3127 Write_Str
(" normalization fails in call ");
3128 Write_Int
(Int
(N
));
3129 Write_Str
(" with subprogram ");
3130 Write_Int
(Int
(Nam
));
3134 -- If the context expects a function call, discard any interpretation
3135 -- that is a procedure. If the node is not overloaded, leave as is for
3136 -- better error reporting when type mismatch is found.
3138 elsif Nkind
(N
) = N_Function_Call
3139 and then Is_Overloaded
(Name
(N
))
3140 and then Ekind
(Nam
) = E_Procedure
3144 -- Ditto for function calls in a procedure context
3146 elsif Nkind
(N
) = N_Procedure_Call_Statement
3147 and then Is_Overloaded
(Name
(N
))
3148 and then Etype
(Nam
) /= Standard_Void_Type
3152 elsif No
(Actuals
) then
3154 -- If Normalize succeeds, then there are default parameters for
3157 Indicate_Name_And_Type
;
3159 elsif Ekind
(Nam
) = E_Operator
then
3160 if Nkind
(N
) = N_Procedure_Call_Statement
then
3164 -- This can occur when the prefix of the call is an operator
3165 -- name or an expanded name whose selector is an operator name.
3167 Analyze_Operator_Call
(N
, Nam
);
3169 if Etype
(N
) /= Prev_T
then
3171 -- Check that operator is not hidden by a function interpretation
3173 if Is_Overloaded
(Name
(N
)) then
3179 Get_First_Interp
(Name
(N
), I
, It
);
3180 while Present
(It
.Nam
) loop
3181 if Operator_Hidden_By
(It
.Nam
) then
3182 Set_Etype
(N
, Prev_T
);
3186 Get_Next_Interp
(I
, It
);
3191 -- If operator matches formals, record its name on the call.
3192 -- If the operator is overloaded, Resolve will select the
3193 -- correct one from the list of interpretations. The call
3194 -- node itself carries the first candidate.
3196 Set_Entity
(Name
(N
), Nam
);
3199 elsif Report
and then Etype
(N
) = Any_Type
then
3200 Error_Msg_N
("incompatible arguments for operator", N
);
3204 -- Normalize_Actuals has chained the named associations in the
3205 -- correct order of the formals.
3207 Actual
:= First_Actual
(N
);
3208 Formal
:= First_Formal
(Nam
);
3210 -- If we are analyzing a call rewritten from object notation, skip
3211 -- first actual, which may be rewritten later as an explicit
3215 Next_Actual
(Actual
);
3216 Next_Formal
(Formal
);
3219 while Present
(Actual
) and then Present
(Formal
) loop
3220 if Nkind
(Parent
(Actual
)) /= N_Parameter_Association
3221 or else Chars
(Selector_Name
(Parent
(Actual
))) = Chars
(Formal
)
3223 -- The actual can be compatible with the formal, but we must
3224 -- also check that the context is not an address type that is
3225 -- visibly an integer type. In this case the use of literals is
3226 -- illegal, except in the body of descendents of system, where
3227 -- arithmetic operations on address are of course used.
3229 if Has_Compatible_Type
(Actual
, Etype
(Formal
))
3231 (Etype
(Actual
) /= Universal_Integer
3232 or else not Is_Descendent_Of_Address
(Etype
(Formal
))
3234 Is_Predefined_File_Name
3235 (Unit_File_Name
(Get_Source_Unit
(N
))))
3237 Next_Actual
(Actual
);
3238 Next_Formal
(Formal
);
3240 -- In Allow_Integer_Address mode, we allow an actual integer to
3241 -- match a formal address type and vice versa. We only do this
3242 -- if we are certain that an error will otherwise be issued
3244 elsif Address_Integer_Convert_OK
3245 (Etype
(Actual
), Etype
(Formal
))
3246 and then (Report
and not Is_Indexed
and not Is_Indirect
)
3248 -- Handle this case by introducing an unchecked conversion
3251 Unchecked_Convert_To
(Etype
(Formal
),
3252 Relocate_Node
(Actual
)));
3253 Analyze_And_Resolve
(Actual
, Etype
(Formal
));
3254 Next_Actual
(Actual
);
3255 Next_Formal
(Formal
);
3258 if Debug_Flag_E
then
3259 Write_Str
(" type checking fails in call ");
3260 Write_Int
(Int
(N
));
3261 Write_Str
(" with formal ");
3262 Write_Int
(Int
(Formal
));
3263 Write_Str
(" in subprogram ");
3264 Write_Int
(Int
(Nam
));
3268 -- Comment needed on the following test???
3270 if Report
and not Is_Indexed
and not Is_Indirect
then
3272 -- Ada 2005 (AI-251): Complete the error notification
3273 -- to help new Ada 2005 users.
3275 if Is_Class_Wide_Type
(Etype
(Formal
))
3276 and then Is_Interface
(Etype
(Etype
(Formal
)))
3277 and then not Interface_Present_In_Ancestor
3278 (Typ
=> Etype
(Actual
),
3279 Iface
=> Etype
(Etype
(Formal
)))
3282 ("(Ada 2005) does not implement interface }",
3283 Actual
, Etype
(Etype
(Formal
)));
3286 Wrong_Type
(Actual
, Etype
(Formal
));
3288 if Nkind
(Actual
) = N_Op_Eq
3289 and then Nkind
(Left_Opnd
(Actual
)) = N_Identifier
3291 Formal
:= First_Formal
(Nam
);
3292 while Present
(Formal
) loop
3293 if Chars
(Left_Opnd
(Actual
)) = Chars
(Formal
) then
3294 Error_Msg_N
-- CODEFIX
3295 ("possible misspelling of `='>`!", Actual
);
3299 Next_Formal
(Formal
);
3303 if All_Errors_Mode
then
3304 Error_Msg_Sloc
:= Sloc
(Nam
);
3306 if Etype
(Formal
) = Any_Type
then
3308 ("there is no legal actual parameter", Actual
);
3311 if Is_Overloadable
(Nam
)
3312 and then Present
(Alias
(Nam
))
3313 and then not Comes_From_Source
(Nam
)
3316 ("\\ =='> in call to inherited operation & #!",
3319 elsif Ekind
(Nam
) = E_Subprogram_Type
then
3321 Access_To_Subprogram_Typ
:
3322 constant Entity_Id
:=
3324 (Associated_Node_For_Itype
(Nam
));
3327 ("\\ =='> in call to dereference of &#!",
3328 Actual
, Access_To_Subprogram_Typ
);
3333 ("\\ =='> in call to &#!", Actual
, Nam
);
3343 -- Normalize_Actuals has verified that a default value exists
3344 -- for this formal. Current actual names a subsequent formal.
3346 Next_Formal
(Formal
);
3350 -- On exit, all actuals match
3352 Indicate_Name_And_Type
;
3354 end Analyze_One_Call
;
3356 ---------------------------
3357 -- Analyze_Operator_Call --
3358 ---------------------------
3360 procedure Analyze_Operator_Call
(N
: Node_Id
; Op_Id
: Entity_Id
) is
3361 Op_Name
: constant Name_Id
:= Chars
(Op_Id
);
3362 Act1
: constant Node_Id
:= First_Actual
(N
);
3363 Act2
: constant Node_Id
:= Next_Actual
(Act1
);
3366 -- Binary operator case
3368 if Present
(Act2
) then
3370 -- If more than two operands, then not binary operator after all
3372 if Present
(Next_Actual
(Act2
)) then
3376 -- Otherwise action depends on operator
3386 Find_Arithmetic_Types
(Act1
, Act2
, Op_Id
, N
);
3391 Find_Boolean_Types
(Act1
, Act2
, Op_Id
, N
);
3397 Find_Comparison_Types
(Act1
, Act2
, Op_Id
, N
);
3401 Find_Equality_Types
(Act1
, Act2
, Op_Id
, N
);
3403 when Name_Op_Concat
=>
3404 Find_Concatenation_Types
(Act1
, Act2
, Op_Id
, N
);
3406 -- Is this when others, or should it be an abort???
3412 -- Unary operator case
3416 when Name_Op_Subtract |
3419 Find_Unary_Types
(Act1
, Op_Id
, N
);
3422 Find_Negation_Types
(Act1
, Op_Id
, N
);
3424 -- Is this when others correct, or should it be an abort???
3430 end Analyze_Operator_Call
;
3432 -------------------------------------------
3433 -- Analyze_Overloaded_Selected_Component --
3434 -------------------------------------------
3436 procedure Analyze_Overloaded_Selected_Component
(N
: Node_Id
) is
3437 Nam
: constant Node_Id
:= Prefix
(N
);
3438 Sel
: constant Node_Id
:= Selector_Name
(N
);
3445 Set_Etype
(Sel
, Any_Type
);
3447 Get_First_Interp
(Nam
, I
, It
);
3448 while Present
(It
.Typ
) loop
3449 if Is_Access_Type
(It
.Typ
) then
3450 T
:= Designated_Type
(It
.Typ
);
3451 Error_Msg_NW
(Warn_On_Dereference
, "?d?implicit dereference", N
);
3456 -- Locate the component. For a private prefix the selector can denote
3459 if Is_Record_Type
(T
) or else Is_Private_Type
(T
) then
3461 -- If the prefix is a class-wide type, the visible components are
3462 -- those of the base type.
3464 if Is_Class_Wide_Type
(T
) then
3468 Comp
:= First_Entity
(T
);
3469 while Present
(Comp
) loop
3470 if Chars
(Comp
) = Chars
(Sel
)
3471 and then Is_Visible_Component
(Comp
)
3474 -- AI05-105: if the context is an object renaming with
3475 -- an anonymous access type, the expected type of the
3476 -- object must be anonymous. This is a name resolution rule.
3478 if Nkind
(Parent
(N
)) /= N_Object_Renaming_Declaration
3479 or else No
(Access_Definition
(Parent
(N
)))
3480 or else Ekind
(Etype
(Comp
)) = E_Anonymous_Access_Type
3482 Ekind
(Etype
(Comp
)) = E_Anonymous_Access_Subprogram_Type
3484 Set_Entity
(Sel
, Comp
);
3485 Set_Etype
(Sel
, Etype
(Comp
));
3486 Add_One_Interp
(N
, Etype
(Comp
), Etype
(Comp
));
3487 Check_Implicit_Dereference
(N
, Etype
(Comp
));
3489 -- This also specifies a candidate to resolve the name.
3490 -- Further overloading will be resolved from context.
3491 -- The selector name itself does not carry overloading
3494 Set_Etype
(Nam
, It
.Typ
);
3497 -- Named access type in the context of a renaming
3498 -- declaration with an access definition. Remove
3499 -- inapplicable candidate.
3508 elsif Is_Concurrent_Type
(T
) then
3509 Comp
:= First_Entity
(T
);
3510 while Present
(Comp
)
3511 and then Comp
/= First_Private_Entity
(T
)
3513 if Chars
(Comp
) = Chars
(Sel
) then
3514 if Is_Overloadable
(Comp
) then
3515 Add_One_Interp
(Sel
, Comp
, Etype
(Comp
));
3517 Set_Entity_With_Checks
(Sel
, Comp
);
3518 Generate_Reference
(Comp
, Sel
);
3521 Set_Etype
(Sel
, Etype
(Comp
));
3522 Set_Etype
(N
, Etype
(Comp
));
3523 Set_Etype
(Nam
, It
.Typ
);
3525 -- For access type case, introduce explicit dereference for
3526 -- more uniform treatment of entry calls. Do this only once
3527 -- if several interpretations yield an access type.
3529 if Is_Access_Type
(Etype
(Nam
))
3530 and then Nkind
(Nam
) /= N_Explicit_Dereference
3532 Insert_Explicit_Dereference
(Nam
);
3534 (Warn_On_Dereference
, "?d?implicit dereference", N
);
3541 Set_Is_Overloaded
(N
, Is_Overloaded
(Sel
));
3544 Get_Next_Interp
(I
, It
);
3547 if Etype
(N
) = Any_Type
3548 and then not Try_Object_Operation
(N
)
3550 Error_Msg_NE
("undefined selector& for overloaded prefix", N
, Sel
);
3551 Set_Entity
(Sel
, Any_Id
);
3552 Set_Etype
(Sel
, Any_Type
);
3554 end Analyze_Overloaded_Selected_Component
;
3556 ----------------------------------
3557 -- Analyze_Qualified_Expression --
3558 ----------------------------------
3560 procedure Analyze_Qualified_Expression
(N
: Node_Id
) is
3561 Mark
: constant Entity_Id
:= Subtype_Mark
(N
);
3562 Expr
: constant Node_Id
:= Expression
(N
);
3568 Analyze_Expression
(Expr
);
3570 Set_Etype
(N
, Any_Type
);
3575 if T
= Any_Type
then
3579 Check_Fully_Declared
(T
, N
);
3581 -- If expected type is class-wide, check for exact match before
3582 -- expansion, because if the expression is a dispatching call it
3583 -- may be rewritten as explicit dereference with class-wide result.
3584 -- If expression is overloaded, retain only interpretations that
3585 -- will yield exact matches.
3587 if Is_Class_Wide_Type
(T
) then
3588 if not Is_Overloaded
(Expr
) then
3589 if Base_Type
(Etype
(Expr
)) /= Base_Type
(T
) then
3590 if Nkind
(Expr
) = N_Aggregate
then
3591 Error_Msg_N
("type of aggregate cannot be class-wide", Expr
);
3593 Wrong_Type
(Expr
, T
);
3598 Get_First_Interp
(Expr
, I
, It
);
3600 while Present
(It
.Nam
) loop
3601 if Base_Type
(It
.Typ
) /= Base_Type
(T
) then
3605 Get_Next_Interp
(I
, It
);
3611 end Analyze_Qualified_Expression
;
3613 -----------------------------------
3614 -- Analyze_Quantified_Expression --
3615 -----------------------------------
3617 procedure Analyze_Quantified_Expression
(N
: Node_Id
) is
3618 function Is_Empty_Range
(Typ
: Entity_Id
) return Boolean;
3619 -- If the iterator is part of a quantified expression, and the range is
3620 -- known to be statically empty, emit a warning and replace expression
3621 -- with its static value. Returns True if the replacement occurs.
3623 function No_Else_Or_Trivial_True
(If_Expr
: Node_Id
) return Boolean;
3624 -- Determine whether if expression If_Expr lacks an else part or if it
3625 -- has one, it evaluates to True.
3627 --------------------
3628 -- Is_Empty_Range --
3629 --------------------
3631 function Is_Empty_Range
(Typ
: Entity_Id
) return Boolean is
3632 Loc
: constant Source_Ptr
:= Sloc
(N
);
3635 if Is_Array_Type
(Typ
)
3636 and then Compile_Time_Known_Bounds
(Typ
)
3638 (Expr_Value
(Type_Low_Bound
(Etype
(First_Index
(Typ
)))) >
3639 Expr_Value
(Type_High_Bound
(Etype
(First_Index
(Typ
)))))
3641 Preanalyze_And_Resolve
(Condition
(N
), Standard_Boolean
);
3643 if All_Present
(N
) then
3645 ("??quantified expression with ALL "
3646 & "over a null range has value True", N
);
3647 Rewrite
(N
, New_Occurrence_Of
(Standard_True
, Loc
));
3651 ("??quantified expression with SOME "
3652 & "over a null range has value False", N
);
3653 Rewrite
(N
, New_Occurrence_Of
(Standard_False
, Loc
));
3664 -----------------------------
3665 -- No_Else_Or_Trivial_True --
3666 -----------------------------
3668 function No_Else_Or_Trivial_True
(If_Expr
: Node_Id
) return Boolean is
3669 Else_Expr
: constant Node_Id
:=
3670 Next
(Next
(First
(Expressions
(If_Expr
))));
3674 or else (Compile_Time_Known_Value
(Else_Expr
)
3675 and then Is_True
(Expr_Value
(Else_Expr
)));
3676 end No_Else_Or_Trivial_True
;
3680 Cond
: constant Node_Id
:= Condition
(N
);
3681 Loop_Id
: Entity_Id
;
3682 QE_Scop
: Entity_Id
;
3684 -- Start of processing for Analyze_Quantified_Expression
3687 Check_SPARK_05_Restriction
("quantified expression is not allowed", N
);
3689 -- Create a scope to emulate the loop-like behavior of the quantified
3690 -- expression. The scope is needed to provide proper visibility of the
3693 QE_Scop
:= New_Internal_Entity
(E_Loop
, Current_Scope
, Sloc
(N
), 'L');
3694 Set_Etype
(QE_Scop
, Standard_Void_Type
);
3695 Set_Scope
(QE_Scop
, Current_Scope
);
3696 Set_Parent
(QE_Scop
, N
);
3698 Push_Scope
(QE_Scop
);
3700 -- All constituents are preanalyzed and resolved to avoid untimely
3701 -- generation of various temporaries and types. Full analysis and
3702 -- expansion is carried out when the quantified expression is
3703 -- transformed into an expression with actions.
3705 if Present
(Iterator_Specification
(N
)) then
3706 Preanalyze
(Iterator_Specification
(N
));
3708 -- Do not proceed with the analysis when the range of iteration is
3709 -- empty. The appropriate error is issued by Is_Empty_Range.
3711 if Is_Entity_Name
(Name
(Iterator_Specification
(N
)))
3712 and then Is_Empty_Range
(Etype
(Name
(Iterator_Specification
(N
))))
3717 else pragma Assert
(Present
(Loop_Parameter_Specification
(N
)));
3719 Loop_Par
: constant Node_Id
:= Loop_Parameter_Specification
(N
);
3722 Preanalyze
(Loop_Par
);
3724 if Nkind
(Discrete_Subtype_Definition
(Loop_Par
)) = N_Function_Call
3725 and then Parent
(Loop_Par
) /= N
3727 -- The parser cannot distinguish between a loop specification
3728 -- and an iterator specification. If after pre-analysis the
3729 -- proper form has been recognized, rewrite the expression to
3730 -- reflect the right kind. This is needed for proper ASIS
3731 -- navigation. If expansion is enabled, the transformation is
3732 -- performed when the expression is rewritten as a loop.
3734 Set_Iterator_Specification
(N
,
3735 New_Copy_Tree
(Iterator_Specification
(Parent
(Loop_Par
))));
3737 Set_Defining_Identifier
(Iterator_Specification
(N
),
3738 Relocate_Node
(Defining_Identifier
(Loop_Par
)));
3739 Set_Name
(Iterator_Specification
(N
),
3740 Relocate_Node
(Discrete_Subtype_Definition
(Loop_Par
)));
3741 Set_Comes_From_Source
(Iterator_Specification
(N
),
3742 Comes_From_Source
(Loop_Parameter_Specification
(N
)));
3743 Set_Loop_Parameter_Specification
(N
, Empty
);
3748 Preanalyze_And_Resolve
(Cond
, Standard_Boolean
);
3751 Set_Etype
(N
, Standard_Boolean
);
3753 -- Verify that the loop variable is used within the condition of the
3754 -- quantified expression.
3756 if Present
(Iterator_Specification
(N
)) then
3757 Loop_Id
:= Defining_Identifier
(Iterator_Specification
(N
));
3759 Loop_Id
:= Defining_Identifier
(Loop_Parameter_Specification
(N
));
3762 if Warn_On_Suspicious_Contract
3763 and then not Referenced
(Loop_Id
, Cond
)
3765 Error_Msg_N
("?T?unused variable &", Loop_Id
);
3768 -- Diagnose a possible misuse of the SOME existential quantifier. When
3769 -- we have a quantified expression of the form:
3771 -- for some X => (if P then Q [else True])
3773 -- any value for X that makes P False results in the if expression being
3774 -- trivially True, and so also results in the the quantified expression
3775 -- being trivially True.
3777 if Warn_On_Suspicious_Contract
3778 and then not All_Present
(N
)
3779 and then Nkind
(Cond
) = N_If_Expression
3780 and then No_Else_Or_Trivial_True
(Cond
)
3782 Error_Msg_N
("?T?suspicious expression", N
);
3783 Error_Msg_N
("\\did you mean (for all X ='> (if P then Q))", N
);
3784 Error_Msg_N
("\\or (for some X ='> P and then Q) instead'?", N
);
3786 end Analyze_Quantified_Expression
;
3792 procedure Analyze_Range
(N
: Node_Id
) is
3793 L
: constant Node_Id
:= Low_Bound
(N
);
3794 H
: constant Node_Id
:= High_Bound
(N
);
3795 I1
, I2
: Interp_Index
;
3798 procedure Check_Common_Type
(T1
, T2
: Entity_Id
);
3799 -- Verify the compatibility of two types, and choose the
3800 -- non universal one if the other is universal.
3802 procedure Check_High_Bound
(T
: Entity_Id
);
3803 -- Test one interpretation of the low bound against all those
3804 -- of the high bound.
3806 procedure Check_Universal_Expression
(N
: Node_Id
);
3807 -- In Ada 83, reject bounds of a universal range that are not literals
3810 -----------------------
3811 -- Check_Common_Type --
3812 -----------------------
3814 procedure Check_Common_Type
(T1
, T2
: Entity_Id
) is
3816 if Covers
(T1
=> T1
, T2
=> T2
)
3818 Covers
(T1
=> T2
, T2
=> T1
)
3820 if T1
= Universal_Integer
3821 or else T1
= Universal_Real
3822 or else T1
= Any_Character
3824 Add_One_Interp
(N
, Base_Type
(T2
), Base_Type
(T2
));
3827 Add_One_Interp
(N
, T1
, T1
);
3830 Add_One_Interp
(N
, Base_Type
(T1
), Base_Type
(T1
));
3833 end Check_Common_Type
;
3835 ----------------------
3836 -- Check_High_Bound --
3837 ----------------------
3839 procedure Check_High_Bound
(T
: Entity_Id
) is
3841 if not Is_Overloaded
(H
) then
3842 Check_Common_Type
(T
, Etype
(H
));
3844 Get_First_Interp
(H
, I2
, It2
);
3845 while Present
(It2
.Typ
) loop
3846 Check_Common_Type
(T
, It2
.Typ
);
3847 Get_Next_Interp
(I2
, It2
);
3850 end Check_High_Bound
;
3852 -----------------------------
3853 -- Is_Universal_Expression --
3854 -----------------------------
3856 procedure Check_Universal_Expression
(N
: Node_Id
) is
3858 if Etype
(N
) = Universal_Integer
3859 and then Nkind
(N
) /= N_Integer_Literal
3860 and then not Is_Entity_Name
(N
)
3861 and then Nkind
(N
) /= N_Attribute_Reference
3863 Error_Msg_N
("illegal bound in discrete range", N
);
3865 end Check_Universal_Expression
;
3867 -- Start of processing for Analyze_Range
3870 Set_Etype
(N
, Any_Type
);
3871 Analyze_Expression
(L
);
3872 Analyze_Expression
(H
);
3874 if Etype
(L
) = Any_Type
or else Etype
(H
) = Any_Type
then
3878 if not Is_Overloaded
(L
) then
3879 Check_High_Bound
(Etype
(L
));
3881 Get_First_Interp
(L
, I1
, It1
);
3882 while Present
(It1
.Typ
) loop
3883 Check_High_Bound
(It1
.Typ
);
3884 Get_Next_Interp
(I1
, It1
);
3888 -- If result is Any_Type, then we did not find a compatible pair
3890 if Etype
(N
) = Any_Type
then
3891 Error_Msg_N
("incompatible types in range ", N
);
3895 if Ada_Version
= Ada_83
3897 (Nkind
(Parent
(N
)) = N_Loop_Parameter_Specification
3898 or else Nkind
(Parent
(N
)) = N_Constrained_Array_Definition
)
3900 Check_Universal_Expression
(L
);
3901 Check_Universal_Expression
(H
);
3904 Check_Function_Writable_Actuals
(N
);
3907 -----------------------
3908 -- Analyze_Reference --
3909 -----------------------
3911 procedure Analyze_Reference
(N
: Node_Id
) is
3912 P
: constant Node_Id
:= Prefix
(N
);
3915 Acc_Type
: Entity_Id
;
3920 -- An interesting error check, if we take the 'Reference of an object
3921 -- for which a pragma Atomic or Volatile has been given, and the type
3922 -- of the object is not Atomic or Volatile, then we are in trouble. The
3923 -- problem is that no trace of the atomic/volatile status will remain
3924 -- for the backend to respect when it deals with the resulting pointer,
3925 -- since the pointer type will not be marked atomic (it is a pointer to
3926 -- the base type of the object).
3928 -- It is not clear if that can ever occur, but in case it does, we will
3929 -- generate an error message. Not clear if this message can ever be
3930 -- generated, and pretty clear that it represents a bug if it is, still
3931 -- seems worth checking, except in CodePeer mode where we do not really
3932 -- care and don't want to bother the user.
3936 if Is_Entity_Name
(P
)
3937 and then Is_Object_Reference
(P
)
3938 and then not CodePeer_Mode
3943 if (Has_Atomic_Components
(E
)
3944 and then not Has_Atomic_Components
(T
))
3946 (Has_Volatile_Components
(E
)
3947 and then not Has_Volatile_Components
(T
))
3948 or else (Is_Atomic
(E
) and then not Is_Atomic
(T
))
3949 or else (Is_Volatile
(E
) and then not Is_Volatile
(T
))
3951 Error_Msg_N
("cannot take reference to Atomic/Volatile object", N
);
3955 -- Carry on with normal processing
3957 Acc_Type
:= Create_Itype
(E_Allocator_Type
, N
);
3958 Set_Etype
(Acc_Type
, Acc_Type
);
3959 Set_Directly_Designated_Type
(Acc_Type
, Etype
(P
));
3960 Set_Etype
(N
, Acc_Type
);
3961 end Analyze_Reference
;
3963 --------------------------------
3964 -- Analyze_Selected_Component --
3965 --------------------------------
3967 -- Prefix is a record type or a task or protected type. In the latter case,
3968 -- the selector must denote a visible entry.
3970 procedure Analyze_Selected_Component
(N
: Node_Id
) is
3971 Name
: constant Node_Id
:= Prefix
(N
);
3972 Sel
: constant Node_Id
:= Selector_Name
(N
);
3975 Has_Candidate
: Boolean := False;
3978 Pent
: Entity_Id
:= Empty
;
3979 Prefix_Type
: Entity_Id
;
3981 Type_To_Use
: Entity_Id
;
3982 -- In most cases this is the Prefix_Type, but if the Prefix_Type is
3983 -- a class-wide type, we use its root type, whose components are
3984 -- present in the class-wide type.
3986 Is_Single_Concurrent_Object
: Boolean;
3987 -- Set True if the prefix is a single task or a single protected object
3989 procedure Find_Component_In_Instance
(Rec
: Entity_Id
);
3990 -- In an instance, a component of a private extension may not be visible
3991 -- while it was visible in the generic. Search candidate scope for a
3992 -- component with the proper identifier. This is only done if all other
3993 -- searches have failed. If a match is found, the Etype of both N and
3994 -- Sel are set from this component, and the entity of Sel is set to
3995 -- reference this component. If no match is found, Entity (Sel) remains
3998 function Has_Mode_Conformant_Spec
(Comp
: Entity_Id
) return Boolean;
3999 -- It is known that the parent of N denotes a subprogram call. Comp
4000 -- is an overloadable component of the concurrent type of the prefix.
4001 -- Determine whether all formals of the parent of N and Comp are mode
4002 -- conformant. If the parent node is not analyzed yet it may be an
4003 -- indexed component rather than a function call.
4005 --------------------------------
4006 -- Find_Component_In_Instance --
4007 --------------------------------
4009 procedure Find_Component_In_Instance
(Rec
: Entity_Id
) is
4013 Comp
:= First_Component
(Rec
);
4014 while Present
(Comp
) loop
4015 if Chars
(Comp
) = Chars
(Sel
) then
4016 Set_Entity_With_Checks
(Sel
, Comp
);
4017 Set_Etype
(Sel
, Etype
(Comp
));
4018 Set_Etype
(N
, Etype
(Comp
));
4022 Next_Component
(Comp
);
4025 -- If we fall through, no match, so no changes made
4028 end Find_Component_In_Instance
;
4030 ------------------------------
4031 -- Has_Mode_Conformant_Spec --
4032 ------------------------------
4034 function Has_Mode_Conformant_Spec
(Comp
: Entity_Id
) return Boolean is
4035 Comp_Param
: Entity_Id
;
4037 Param_Typ
: Entity_Id
;
4040 Comp_Param
:= First_Formal
(Comp
);
4042 if Nkind
(Parent
(N
)) = N_Indexed_Component
then
4043 Param
:= First
(Expressions
(Parent
(N
)));
4045 Param
:= First
(Parameter_Associations
(Parent
(N
)));
4048 while Present
(Comp_Param
)
4049 and then Present
(Param
)
4051 Param_Typ
:= Find_Parameter_Type
(Param
);
4053 if Present
(Param_Typ
)
4055 not Conforming_Types
4056 (Etype
(Comp_Param
), Param_Typ
, Mode_Conformant
)
4061 Next_Formal
(Comp_Param
);
4065 -- One of the specs has additional formals; there is no match, unless
4066 -- this may be an indexing of a parameterless call.
4068 -- Note that when expansion is disabled, the corresponding record
4069 -- type of synchronized types is not constructed, so that there is
4070 -- no point is attempting an interpretation as a prefixed call, as
4071 -- this is bound to fail because the primitive operations will not
4072 -- be properly located.
4074 if Present
(Comp_Param
) or else Present
(Param
) then
4075 if Needs_No_Actuals
(Comp
)
4076 and then Is_Array_Type
(Etype
(Comp
))
4077 and then not Expander_Active
4086 end Has_Mode_Conformant_Spec
;
4088 -- Start of processing for Analyze_Selected_Component
4091 Set_Etype
(N
, Any_Type
);
4093 if Is_Overloaded
(Name
) then
4094 Analyze_Overloaded_Selected_Component
(N
);
4097 elsif Etype
(Name
) = Any_Type
then
4098 Set_Entity
(Sel
, Any_Id
);
4099 Set_Etype
(Sel
, Any_Type
);
4103 Prefix_Type
:= Etype
(Name
);
4106 if Is_Access_Type
(Prefix_Type
) then
4108 -- A RACW object can never be used as prefix of a selected component
4109 -- since that means it is dereferenced without being a controlling
4110 -- operand of a dispatching operation (RM E.2.2(16/1)). Before
4111 -- reporting an error, we must check whether this is actually a
4112 -- dispatching call in prefix form.
4114 if Is_Remote_Access_To_Class_Wide_Type
(Prefix_Type
)
4115 and then Comes_From_Source
(N
)
4117 if Try_Object_Operation
(N
) then
4121 ("invalid dereference of a remote access-to-class-wide value",
4125 -- Normal case of selected component applied to access type
4128 Error_Msg_NW
(Warn_On_Dereference
, "?d?implicit dereference", N
);
4130 if Is_Entity_Name
(Name
) then
4131 Pent
:= Entity
(Name
);
4132 elsif Nkind
(Name
) = N_Selected_Component
4133 and then Is_Entity_Name
(Selector_Name
(Name
))
4135 Pent
:= Entity
(Selector_Name
(Name
));
4138 Prefix_Type
:= Process_Implicit_Dereference_Prefix
(Pent
, Name
);
4141 -- If we have an explicit dereference of a remote access-to-class-wide
4142 -- value, then issue an error (see RM-E.2.2(16/1)). However we first
4143 -- have to check for the case of a prefix that is a controlling operand
4144 -- of a prefixed dispatching call, as the dereference is legal in that
4145 -- case. Normally this condition is checked in Validate_Remote_Access_
4146 -- To_Class_Wide_Type, but we have to defer the checking for selected
4147 -- component prefixes because of the prefixed dispatching call case.
4148 -- Note that implicit dereferences are checked for this just above.
4150 elsif Nkind
(Name
) = N_Explicit_Dereference
4151 and then Is_Remote_Access_To_Class_Wide_Type
(Etype
(Prefix
(Name
)))
4152 and then Comes_From_Source
(N
)
4154 if Try_Object_Operation
(N
) then
4158 ("invalid dereference of a remote access-to-class-wide value",
4163 -- (Ada 2005): if the prefix is the limited view of a type, and
4164 -- the context already includes the full view, use the full view
4165 -- in what follows, either to retrieve a component of to find
4166 -- a primitive operation. If the prefix is an explicit dereference,
4167 -- set the type of the prefix to reflect this transformation.
4168 -- If the non-limited view is itself an incomplete type, get the
4169 -- full view if available.
4171 if Is_Incomplete_Type
(Prefix_Type
)
4172 and then From_Limited_With
(Prefix_Type
)
4173 and then Present
(Non_Limited_View
(Prefix_Type
))
4175 Prefix_Type
:= Get_Full_View
(Non_Limited_View
(Prefix_Type
));
4177 if Nkind
(N
) = N_Explicit_Dereference
then
4178 Set_Etype
(Prefix
(N
), Prefix_Type
);
4181 elsif Ekind
(Prefix_Type
) = E_Class_Wide_Type
4182 and then From_Limited_With
(Prefix_Type
)
4183 and then Present
(Non_Limited_View
(Etype
(Prefix_Type
)))
4186 Class_Wide_Type
(Non_Limited_View
(Etype
(Prefix_Type
)));
4188 if Nkind
(N
) = N_Explicit_Dereference
then
4189 Set_Etype
(Prefix
(N
), Prefix_Type
);
4193 if Ekind
(Prefix_Type
) = E_Private_Subtype
then
4194 Prefix_Type
:= Base_Type
(Prefix_Type
);
4197 Type_To_Use
:= Prefix_Type
;
4199 -- For class-wide types, use the entity list of the root type. This
4200 -- indirection is specially important for private extensions because
4201 -- only the root type get switched (not the class-wide type).
4203 if Is_Class_Wide_Type
(Prefix_Type
) then
4204 Type_To_Use
:= Root_Type
(Prefix_Type
);
4207 -- If the prefix is a single concurrent object, use its name in error
4208 -- messages, rather than that of its anonymous type.
4210 Is_Single_Concurrent_Object
:=
4211 Is_Concurrent_Type
(Prefix_Type
)
4212 and then Is_Internal_Name
(Chars
(Prefix_Type
))
4213 and then not Is_Derived_Type
(Prefix_Type
)
4214 and then Is_Entity_Name
(Name
);
4216 Comp
:= First_Entity
(Type_To_Use
);
4218 -- If the selector has an original discriminant, the node appears in
4219 -- an instance. Replace the discriminant with the corresponding one
4220 -- in the current discriminated type. For nested generics, this must
4221 -- be done transitively, so note the new original discriminant.
4223 if Nkind
(Sel
) = N_Identifier
4224 and then In_Instance
4225 and then Present
(Original_Discriminant
(Sel
))
4227 Comp
:= Find_Corresponding_Discriminant
(Sel
, Prefix_Type
);
4229 -- Mark entity before rewriting, for completeness and because
4230 -- subsequent semantic checks might examine the original node.
4232 Set_Entity
(Sel
, Comp
);
4233 Rewrite
(Selector_Name
(N
), New_Occurrence_Of
(Comp
, Sloc
(N
)));
4234 Set_Original_Discriminant
(Selector_Name
(N
), Comp
);
4235 Set_Etype
(N
, Etype
(Comp
));
4236 Check_Implicit_Dereference
(N
, Etype
(Comp
));
4238 if Is_Access_Type
(Etype
(Name
)) then
4239 Insert_Explicit_Dereference
(Name
);
4240 Error_Msg_NW
(Warn_On_Dereference
, "?d?implicit dereference", N
);
4243 elsif Is_Record_Type
(Prefix_Type
) then
4245 -- Find component with given name. In an instance, if the node is
4246 -- known as a prefixed call, do not examine components whose
4247 -- visibility may be accidental.
4249 while Present
(Comp
) and then not Is_Prefixed_Call
(N
) loop
4250 if Chars
(Comp
) = Chars
(Sel
)
4251 and then Is_Visible_Component
(Comp
, N
)
4253 Set_Entity_With_Checks
(Sel
, Comp
);
4254 Set_Etype
(Sel
, Etype
(Comp
));
4256 if Ekind
(Comp
) = E_Discriminant
then
4257 if Is_Unchecked_Union
(Base_Type
(Prefix_Type
)) then
4259 ("cannot reference discriminant of unchecked union",
4263 if Is_Generic_Type
(Prefix_Type
)
4265 Is_Generic_Type
(Root_Type
(Prefix_Type
))
4267 Set_Original_Discriminant
(Sel
, Comp
);
4271 -- Resolve the prefix early otherwise it is not possible to
4272 -- build the actual subtype of the component: it may need
4273 -- to duplicate this prefix and duplication is only allowed
4274 -- on fully resolved expressions.
4278 -- Ada 2005 (AI-50217): Check wrong use of incomplete types or
4279 -- subtypes in a package specification.
4282 -- limited with Pkg;
4284 -- type Acc_Inc is access Pkg.T;
4286 -- N : Natural := X.all.Comp; -- ERROR, limited view
4287 -- end Pkg; -- Comp is not visible
4289 if Nkind
(Name
) = N_Explicit_Dereference
4290 and then From_Limited_With
(Etype
(Prefix
(Name
)))
4291 and then not Is_Potentially_Use_Visible
(Etype
(Name
))
4292 and then Nkind
(Parent
(Cunit_Entity
(Current_Sem_Unit
))) =
4293 N_Package_Specification
4296 ("premature usage of incomplete}", Prefix
(Name
),
4297 Etype
(Prefix
(Name
)));
4300 -- We never need an actual subtype for the case of a selection
4301 -- for a indexed component of a non-packed array, since in
4302 -- this case gigi generates all the checks and can find the
4303 -- necessary bounds information.
4305 -- We also do not need an actual subtype for the case of a
4306 -- first, last, length, or range attribute applied to a
4307 -- non-packed array, since gigi can again get the bounds in
4308 -- these cases (gigi cannot handle the packed case, since it
4309 -- has the bounds of the packed array type, not the original
4310 -- bounds of the type). However, if the prefix is itself a
4311 -- selected component, as in a.b.c (i), gigi may regard a.b.c
4312 -- as a dynamic-sized temporary, so we do generate an actual
4313 -- subtype for this case.
4315 Parent_N
:= Parent
(N
);
4317 if not Is_Packed
(Etype
(Comp
))
4319 ((Nkind
(Parent_N
) = N_Indexed_Component
4320 and then Nkind
(Name
) /= N_Selected_Component
)
4322 (Nkind
(Parent_N
) = N_Attribute_Reference
4324 Nam_In
(Attribute_Name
(Parent_N
), Name_First
,
4329 Set_Etype
(N
, Etype
(Comp
));
4331 -- If full analysis is not enabled, we do not generate an
4332 -- actual subtype, because in the absence of expansion
4333 -- reference to a formal of a protected type, for example,
4334 -- will not be properly transformed, and will lead to
4335 -- out-of-scope references in gigi.
4337 -- In all other cases, we currently build an actual subtype.
4338 -- It seems likely that many of these cases can be avoided,
4339 -- but right now, the front end makes direct references to the
4340 -- bounds (e.g. in generating a length check), and if we do
4341 -- not make an actual subtype, we end up getting a direct
4342 -- reference to a discriminant, which will not do.
4344 elsif Full_Analysis
then
4346 Build_Actual_Subtype_Of_Component
(Etype
(Comp
), N
);
4347 Insert_Action
(N
, Act_Decl
);
4349 if No
(Act_Decl
) then
4350 Set_Etype
(N
, Etype
(Comp
));
4353 -- Component type depends on discriminants. Enter the
4354 -- main attributes of the subtype.
4357 Subt
: constant Entity_Id
:=
4358 Defining_Identifier
(Act_Decl
);
4361 Set_Etype
(Subt
, Base_Type
(Etype
(Comp
)));
4362 Set_Ekind
(Subt
, Ekind
(Etype
(Comp
)));
4363 Set_Etype
(N
, Subt
);
4367 -- If Full_Analysis not enabled, just set the Etype
4370 Set_Etype
(N
, Etype
(Comp
));
4373 Check_Implicit_Dereference
(N
, Etype
(N
));
4377 -- If the prefix is a private extension, check only the visible
4378 -- components of the partial view. This must include the tag,
4379 -- which can appear in expanded code in a tag check.
4381 if Ekind
(Type_To_Use
) = E_Record_Type_With_Private
4382 and then Chars
(Selector_Name
(N
)) /= Name_uTag
4384 exit when Comp
= Last_Entity
(Type_To_Use
);
4390 -- Ada 2005 (AI-252): The selected component can be interpreted as
4391 -- a prefixed view of a subprogram. Depending on the context, this is
4392 -- either a name that can appear in a renaming declaration, or part
4393 -- of an enclosing call given in prefix form.
4395 -- Ada 2005 (AI05-0030): In the case of dispatching requeue, the
4396 -- selected component should resolve to a name.
4398 if Ada_Version
>= Ada_2005
4399 and then Is_Tagged_Type
(Prefix_Type
)
4400 and then not Is_Concurrent_Type
(Prefix_Type
)
4402 if Nkind
(Parent
(N
)) = N_Generic_Association
4403 or else Nkind
(Parent
(N
)) = N_Requeue_Statement
4404 or else Nkind
(Parent
(N
)) = N_Subprogram_Renaming_Declaration
4406 if Find_Primitive_Operation
(N
) then
4410 elsif Try_Object_Operation
(N
) then
4414 -- If the transformation fails, it will be necessary to redo the
4415 -- analysis with all errors enabled, to indicate candidate
4416 -- interpretations and reasons for each failure ???
4420 elsif Is_Private_Type
(Prefix_Type
) then
4422 -- Allow access only to discriminants of the type. If the type has
4423 -- no full view, gigi uses the parent type for the components, so we
4424 -- do the same here.
4426 if No
(Full_View
(Prefix_Type
)) then
4427 Type_To_Use
:= Root_Type
(Base_Type
(Prefix_Type
));
4428 Comp
:= First_Entity
(Type_To_Use
);
4431 while Present
(Comp
) loop
4432 if Chars
(Comp
) = Chars
(Sel
) then
4433 if Ekind
(Comp
) = E_Discriminant
then
4434 Set_Entity_With_Checks
(Sel
, Comp
);
4435 Generate_Reference
(Comp
, Sel
);
4437 Set_Etype
(Sel
, Etype
(Comp
));
4438 Set_Etype
(N
, Etype
(Comp
));
4439 Check_Implicit_Dereference
(N
, Etype
(N
));
4441 if Is_Generic_Type
(Prefix_Type
)
4442 or else Is_Generic_Type
(Root_Type
(Prefix_Type
))
4444 Set_Original_Discriminant
(Sel
, Comp
);
4447 -- Before declaring an error, check whether this is tagged
4448 -- private type and a call to a primitive operation.
4450 elsif Ada_Version
>= Ada_2005
4451 and then Is_Tagged_Type
(Prefix_Type
)
4452 and then Try_Object_Operation
(N
)
4457 Error_Msg_Node_2
:= First_Subtype
(Prefix_Type
);
4458 Error_Msg_NE
("invisible selector& for }", N
, Sel
);
4459 Set_Entity
(Sel
, Any_Id
);
4460 Set_Etype
(N
, Any_Type
);
4469 elsif Is_Concurrent_Type
(Prefix_Type
) then
4471 -- Find visible operation with given name. For a protected type,
4472 -- the possible candidates are discriminants, entries or protected
4473 -- procedures. For a task type, the set can only include entries or
4474 -- discriminants if the task type is not an enclosing scope. If it
4475 -- is an enclosing scope (e.g. in an inner task) then all entities
4476 -- are visible, but the prefix must denote the enclosing scope, i.e.
4477 -- can only be a direct name or an expanded name.
4479 Set_Etype
(Sel
, Any_Type
);
4480 In_Scope
:= In_Open_Scopes
(Prefix_Type
);
4482 while Present
(Comp
) loop
4483 if Chars
(Comp
) = Chars
(Sel
) then
4484 if Is_Overloadable
(Comp
) then
4485 Add_One_Interp
(Sel
, Comp
, Etype
(Comp
));
4487 -- If the prefix is tagged, the correct interpretation may
4488 -- lie in the primitive or class-wide operations of the
4489 -- type. Perform a simple conformance check to determine
4490 -- whether Try_Object_Operation should be invoked even if
4491 -- a visible entity is found.
4493 if Is_Tagged_Type
(Prefix_Type
)
4495 Nkind_In
(Parent
(N
), N_Procedure_Call_Statement
,
4497 N_Indexed_Component
)
4498 and then Has_Mode_Conformant_Spec
(Comp
)
4500 Has_Candidate
:= True;
4503 -- Note: a selected component may not denote a component of a
4504 -- protected type (4.1.3(7)).
4506 elsif Ekind_In
(Comp
, E_Discriminant
, E_Entry_Family
)
4508 and then not Is_Protected_Type
(Prefix_Type
)
4509 and then Is_Entity_Name
(Name
))
4511 Set_Entity_With_Checks
(Sel
, Comp
);
4512 Generate_Reference
(Comp
, Sel
);
4514 -- The selector is not overloadable, so we have a candidate
4517 Has_Candidate
:= True;
4523 Set_Etype
(Sel
, Etype
(Comp
));
4524 Set_Etype
(N
, Etype
(Comp
));
4526 if Ekind
(Comp
) = E_Discriminant
then
4527 Set_Original_Discriminant
(Sel
, Comp
);
4530 -- For access type case, introduce explicit dereference for
4531 -- more uniform treatment of entry calls.
4533 if Is_Access_Type
(Etype
(Name
)) then
4534 Insert_Explicit_Dereference
(Name
);
4536 (Warn_On_Dereference
, "?d?implicit dereference", N
);
4542 exit when not In_Scope
4544 Comp
= First_Private_Entity
(Base_Type
(Prefix_Type
));
4547 -- If there is no visible entity with the given name or none of the
4548 -- visible entities are plausible interpretations, check whether
4549 -- there is some other primitive operation with that name.
4551 if Ada_Version
>= Ada_2005
4552 and then Is_Tagged_Type
(Prefix_Type
)
4554 if (Etype
(N
) = Any_Type
4555 or else not Has_Candidate
)
4556 and then Try_Object_Operation
(N
)
4560 -- If the context is not syntactically a procedure call, it
4561 -- may be a call to a primitive function declared outside of
4562 -- the synchronized type.
4564 -- If the context is a procedure call, there might still be
4565 -- an overloading between an entry and a primitive procedure
4566 -- declared outside of the synchronized type, called in prefix
4567 -- notation. This is harder to disambiguate because in one case
4568 -- the controlling formal is implicit ???
4570 elsif Nkind
(Parent
(N
)) /= N_Procedure_Call_Statement
4571 and then Nkind
(Parent
(N
)) /= N_Indexed_Component
4572 and then Try_Object_Operation
(N
)
4577 -- Ada 2012 (AI05-0090-1): If we found a candidate of a call to an
4578 -- entry or procedure of a tagged concurrent type we must check
4579 -- if there are class-wide subprograms covering the primitive. If
4580 -- true then Try_Object_Operation reports the error.
4583 and then Is_Concurrent_Type
(Prefix_Type
)
4584 and then Nkind
(Parent
(N
)) = N_Procedure_Call_Statement
4586 -- Duplicate the call. This is required to avoid problems with
4587 -- the tree transformations performed by Try_Object_Operation.
4588 -- Set properly the parent of the copied call, because it is
4589 -- about to be reanalyzed.
4593 Par
: constant Node_Id
:= New_Copy_Tree
(Parent
(N
));
4596 Set_Parent
(Par
, Parent
(Parent
(N
)));
4598 if Try_Object_Operation
4599 (Sinfo
.Name
(Par
), CW_Test_Only
=> True)
4607 if Etype
(N
) = Any_Type
and then Is_Protected_Type
(Prefix_Type
) then
4609 -- Case of a prefix of a protected type: selector might denote
4610 -- an invisible private component.
4612 Comp
:= First_Private_Entity
(Base_Type
(Prefix_Type
));
4613 while Present
(Comp
) and then Chars
(Comp
) /= Chars
(Sel
) loop
4617 if Present
(Comp
) then
4618 if Is_Single_Concurrent_Object
then
4619 Error_Msg_Node_2
:= Entity
(Name
);
4620 Error_Msg_NE
("invisible selector& for &", N
, Sel
);
4623 Error_Msg_Node_2
:= First_Subtype
(Prefix_Type
);
4624 Error_Msg_NE
("invisible selector& for }", N
, Sel
);
4630 Set_Is_Overloaded
(N
, Is_Overloaded
(Sel
));
4635 Error_Msg_NE
("invalid prefix in selected component&", N
, Sel
);
4638 -- If N still has no type, the component is not defined in the prefix
4640 if Etype
(N
) = Any_Type
then
4642 if Is_Single_Concurrent_Object
then
4643 Error_Msg_Node_2
:= Entity
(Name
);
4644 Error_Msg_NE
("no selector& for&", N
, Sel
);
4646 Check_Misspelled_Selector
(Type_To_Use
, Sel
);
4648 -- If this is a derived formal type, the parent may have different
4649 -- visibility at this point. Try for an inherited component before
4650 -- reporting an error.
4652 elsif Is_Generic_Type
(Prefix_Type
)
4653 and then Ekind
(Prefix_Type
) = E_Record_Type_With_Private
4654 and then Prefix_Type
/= Etype
(Prefix_Type
)
4655 and then Is_Record_Type
(Etype
(Prefix_Type
))
4657 Set_Etype
(Prefix
(N
), Etype
(Prefix_Type
));
4658 Analyze_Selected_Component
(N
);
4661 -- Similarly, if this is the actual for a formal derived type, or
4662 -- a derived type thereof, the component inherited from the generic
4663 -- parent may not be visible in the actual, but the selected
4664 -- component is legal. Climb up the derivation chain of the generic
4665 -- parent type until we find the proper ancestor type.
4667 elsif In_Instance
and then Is_Tagged_Type
(Prefix_Type
) then
4669 Par
: Entity_Id
:= Prefix_Type
;
4671 -- Climb up derivation chain to generic actual subtype
4673 while not Is_Generic_Actual_Type
(Par
) loop
4674 if Ekind
(Par
) = E_Record_Type
then
4675 Par
:= Parent_Subtype
(Par
);
4678 exit when Par
= Etype
(Par
);
4683 if Present
(Par
) and then Is_Generic_Actual_Type
(Par
) then
4685 -- Now look for component in ancestor types
4687 Par
:= Generic_Parent_Type
(Declaration_Node
(Par
));
4689 Find_Component_In_Instance
(Par
);
4690 exit when Present
(Entity
(Sel
))
4691 or else Par
= Etype
(Par
);
4695 -- In ASIS mode the generic parent type may be absent. Examine
4696 -- the parent type directly for a component that may have been
4697 -- visible in a parent generic unit.
4699 elsif Is_Derived_Type
(Prefix_Type
) then
4700 Par
:= Etype
(Prefix_Type
);
4701 Find_Component_In_Instance
(Par
);
4705 -- The search above must have eventually succeeded, since the
4706 -- selected component was legal in the generic.
4708 if No
(Entity
(Sel
)) then
4709 raise Program_Error
;
4714 -- Component not found, specialize error message when appropriate
4717 if Ekind
(Prefix_Type
) = E_Record_Subtype
then
4719 -- Check whether this is a component of the base type which
4720 -- is absent from a statically constrained subtype. This will
4721 -- raise constraint error at run time, but is not a compile-
4722 -- time error. When the selector is illegal for base type as
4723 -- well fall through and generate a compilation error anyway.
4725 Comp
:= First_Component
(Base_Type
(Prefix_Type
));
4726 while Present
(Comp
) loop
4727 if Chars
(Comp
) = Chars
(Sel
)
4728 and then Is_Visible_Component
(Comp
)
4730 Set_Entity_With_Checks
(Sel
, Comp
);
4731 Generate_Reference
(Comp
, Sel
);
4732 Set_Etype
(Sel
, Etype
(Comp
));
4733 Set_Etype
(N
, Etype
(Comp
));
4735 -- Emit appropriate message. The node will be replaced
4736 -- by an appropriate raise statement.
4738 -- Note that in SPARK mode, as with all calls to apply a
4739 -- compile time constraint error, this will be made into
4740 -- an error to simplify the processing of the formal
4741 -- verification backend.
4743 Apply_Compile_Time_Constraint_Error
4744 (N
, "component not present in }??",
4745 CE_Discriminant_Check_Failed
,
4746 Ent
=> Prefix_Type
, Rep
=> False);
4748 Set_Raises_Constraint_Error
(N
);
4752 Next_Component
(Comp
);
4757 Error_Msg_Node_2
:= First_Subtype
(Prefix_Type
);
4758 Error_Msg_NE
("no selector& for}", N
, Sel
);
4760 -- Add information in the case of an incomplete prefix
4762 if Is_Incomplete_Type
(Type_To_Use
) then
4764 Inc
: constant Entity_Id
:= First_Subtype
(Type_To_Use
);
4767 if From_Limited_With
(Scope
(Type_To_Use
)) then
4769 ("\limited view of& has no components", N
, Inc
);
4773 ("\premature usage of incomplete type&", N
, Inc
);
4775 if Nkind
(Parent
(Inc
)) =
4776 N_Incomplete_Type_Declaration
4778 -- Record location of premature use in entity so that
4779 -- a continuation message is generated when the
4780 -- completion is seen.
4782 Set_Premature_Use
(Parent
(Inc
), N
);
4788 Check_Misspelled_Selector
(Type_To_Use
, Sel
);
4791 Set_Entity
(Sel
, Any_Id
);
4792 Set_Etype
(Sel
, Any_Type
);
4794 end Analyze_Selected_Component
;
4796 ---------------------------
4797 -- Analyze_Short_Circuit --
4798 ---------------------------
4800 procedure Analyze_Short_Circuit
(N
: Node_Id
) is
4801 L
: constant Node_Id
:= Left_Opnd
(N
);
4802 R
: constant Node_Id
:= Right_Opnd
(N
);
4807 Analyze_Expression
(L
);
4808 Analyze_Expression
(R
);
4809 Set_Etype
(N
, Any_Type
);
4811 if not Is_Overloaded
(L
) then
4812 if Root_Type
(Etype
(L
)) = Standard_Boolean
4813 and then Has_Compatible_Type
(R
, Etype
(L
))
4815 Add_One_Interp
(N
, Etype
(L
), Etype
(L
));
4819 Get_First_Interp
(L
, Ind
, It
);
4820 while Present
(It
.Typ
) loop
4821 if Root_Type
(It
.Typ
) = Standard_Boolean
4822 and then Has_Compatible_Type
(R
, It
.Typ
)
4824 Add_One_Interp
(N
, It
.Typ
, It
.Typ
);
4827 Get_Next_Interp
(Ind
, It
);
4831 -- Here we have failed to find an interpretation. Clearly we know that
4832 -- it is not the case that both operands can have an interpretation of
4833 -- Boolean, but this is by far the most likely intended interpretation.
4834 -- So we simply resolve both operands as Booleans, and at least one of
4835 -- these resolutions will generate an error message, and we do not need
4836 -- to give another error message on the short circuit operation itself.
4838 if Etype
(N
) = Any_Type
then
4839 Resolve
(L
, Standard_Boolean
);
4840 Resolve
(R
, Standard_Boolean
);
4841 Set_Etype
(N
, Standard_Boolean
);
4843 end Analyze_Short_Circuit
;
4849 procedure Analyze_Slice
(N
: Node_Id
) is
4850 D
: constant Node_Id
:= Discrete_Range
(N
);
4851 P
: constant Node_Id
:= Prefix
(N
);
4852 Array_Type
: Entity_Id
;
4853 Index_Type
: Entity_Id
;
4855 procedure Analyze_Overloaded_Slice
;
4856 -- If the prefix is overloaded, select those interpretations that
4857 -- yield a one-dimensional array type.
4859 ------------------------------
4860 -- Analyze_Overloaded_Slice --
4861 ------------------------------
4863 procedure Analyze_Overloaded_Slice
is
4869 Set_Etype
(N
, Any_Type
);
4871 Get_First_Interp
(P
, I
, It
);
4872 while Present
(It
.Nam
) loop
4875 if Is_Access_Type
(Typ
) then
4876 Typ
:= Designated_Type
(Typ
);
4878 (Warn_On_Dereference
, "?d?implicit dereference", N
);
4881 if Is_Array_Type
(Typ
)
4882 and then Number_Dimensions
(Typ
) = 1
4883 and then Has_Compatible_Type
(D
, Etype
(First_Index
(Typ
)))
4885 Add_One_Interp
(N
, Typ
, Typ
);
4888 Get_Next_Interp
(I
, It
);
4891 if Etype
(N
) = Any_Type
then
4892 Error_Msg_N
("expect array type in prefix of slice", N
);
4894 end Analyze_Overloaded_Slice
;
4896 -- Start of processing for Analyze_Slice
4899 if Comes_From_Source
(N
) then
4900 Check_SPARK_05_Restriction
("slice is not allowed", N
);
4906 if Is_Overloaded
(P
) then
4907 Analyze_Overloaded_Slice
;
4910 Array_Type
:= Etype
(P
);
4911 Set_Etype
(N
, Any_Type
);
4913 if Is_Access_Type
(Array_Type
) then
4914 Array_Type
:= Designated_Type
(Array_Type
);
4915 Error_Msg_NW
(Warn_On_Dereference
, "?d?implicit dereference", N
);
4918 if not Is_Array_Type
(Array_Type
) then
4919 Wrong_Type
(P
, Any_Array
);
4921 elsif Number_Dimensions
(Array_Type
) > 1 then
4923 ("type is not one-dimensional array in slice prefix", N
);
4926 if Ekind
(Array_Type
) = E_String_Literal_Subtype
then
4927 Index_Type
:= Etype
(String_Literal_Low_Bound
(Array_Type
));
4929 Index_Type
:= Etype
(First_Index
(Array_Type
));
4932 if not Has_Compatible_Type
(D
, Index_Type
) then
4933 Wrong_Type
(D
, Index_Type
);
4935 Set_Etype
(N
, Array_Type
);
4941 -----------------------------
4942 -- Analyze_Type_Conversion --
4943 -----------------------------
4945 procedure Analyze_Type_Conversion
(N
: Node_Id
) is
4946 Expr
: constant Node_Id
:= Expression
(N
);
4950 -- If Conversion_OK is set, then the Etype is already set, and the
4951 -- only processing required is to analyze the expression. This is
4952 -- used to construct certain "illegal" conversions which are not
4953 -- allowed by Ada semantics, but can be handled OK by Gigi, see
4954 -- Sinfo for further details.
4956 if Conversion_OK
(N
) then
4961 -- Otherwise full type analysis is required, as well as some semantic
4962 -- checks to make sure the argument of the conversion is appropriate.
4964 Find_Type
(Subtype_Mark
(N
));
4965 T
:= Entity
(Subtype_Mark
(N
));
4967 Check_Fully_Declared
(T
, N
);
4968 Analyze_Expression
(Expr
);
4969 Validate_Remote_Type_Type_Conversion
(N
);
4971 -- Only remaining step is validity checks on the argument. These
4972 -- are skipped if the conversion does not come from the source.
4974 if not Comes_From_Source
(N
) then
4977 -- If there was an error in a generic unit, no need to replicate the
4978 -- error message. Conversely, constant-folding in the generic may
4979 -- transform the argument of a conversion into a string literal, which
4980 -- is legal. Therefore the following tests are not performed in an
4981 -- instance. The same applies to an inlined body.
4983 elsif In_Instance
or In_Inlined_Body
then
4986 elsif Nkind
(Expr
) = N_Null
then
4987 Error_Msg_N
("argument of conversion cannot be null", N
);
4988 Error_Msg_N
("\use qualified expression instead", N
);
4989 Set_Etype
(N
, Any_Type
);
4991 elsif Nkind
(Expr
) = N_Aggregate
then
4992 Error_Msg_N
("argument of conversion cannot be aggregate", N
);
4993 Error_Msg_N
("\use qualified expression instead", N
);
4995 elsif Nkind
(Expr
) = N_Allocator
then
4996 Error_Msg_N
("argument of conversion cannot be an allocator", N
);
4997 Error_Msg_N
("\use qualified expression instead", N
);
4999 elsif Nkind
(Expr
) = N_String_Literal
then
5000 Error_Msg_N
("argument of conversion cannot be string literal", N
);
5001 Error_Msg_N
("\use qualified expression instead", N
);
5003 elsif Nkind
(Expr
) = N_Character_Literal
then
5004 if Ada_Version
= Ada_83
then
5007 Error_Msg_N
("argument of conversion cannot be character literal",
5009 Error_Msg_N
("\use qualified expression instead", N
);
5012 elsif Nkind
(Expr
) = N_Attribute_Reference
5014 Nam_In
(Attribute_Name
(Expr
), Name_Access
,
5015 Name_Unchecked_Access
,
5016 Name_Unrestricted_Access
)
5018 Error_Msg_N
("argument of conversion cannot be access", N
);
5019 Error_Msg_N
("\use qualified expression instead", N
);
5021 end Analyze_Type_Conversion
;
5023 ----------------------
5024 -- Analyze_Unary_Op --
5025 ----------------------
5027 procedure Analyze_Unary_Op
(N
: Node_Id
) is
5028 R
: constant Node_Id
:= Right_Opnd
(N
);
5029 Op_Id
: Entity_Id
:= Entity
(N
);
5032 Set_Etype
(N
, Any_Type
);
5033 Candidate_Type
:= Empty
;
5035 Analyze_Expression
(R
);
5037 if Present
(Op_Id
) then
5038 if Ekind
(Op_Id
) = E_Operator
then
5039 Find_Unary_Types
(R
, Op_Id
, N
);
5041 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
5045 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
5046 while Present
(Op_Id
) loop
5047 if Ekind
(Op_Id
) = E_Operator
then
5048 if No
(Next_Entity
(First_Entity
(Op_Id
))) then
5049 Find_Unary_Types
(R
, Op_Id
, N
);
5052 elsif Is_Overloadable
(Op_Id
) then
5053 Analyze_User_Defined_Unary_Op
(N
, Op_Id
);
5056 Op_Id
:= Homonym
(Op_Id
);
5061 end Analyze_Unary_Op
;
5063 ----------------------------------
5064 -- Analyze_Unchecked_Expression --
5065 ----------------------------------
5067 procedure Analyze_Unchecked_Expression
(N
: Node_Id
) is
5069 Analyze
(Expression
(N
), Suppress
=> All_Checks
);
5070 Set_Etype
(N
, Etype
(Expression
(N
)));
5071 Save_Interps
(Expression
(N
), N
);
5072 end Analyze_Unchecked_Expression
;
5074 ---------------------------------------
5075 -- Analyze_Unchecked_Type_Conversion --
5076 ---------------------------------------
5078 procedure Analyze_Unchecked_Type_Conversion
(N
: Node_Id
) is
5080 Find_Type
(Subtype_Mark
(N
));
5081 Analyze_Expression
(Expression
(N
));
5082 Set_Etype
(N
, Entity
(Subtype_Mark
(N
)));
5083 end Analyze_Unchecked_Type_Conversion
;
5085 ------------------------------------
5086 -- Analyze_User_Defined_Binary_Op --
5087 ------------------------------------
5089 procedure Analyze_User_Defined_Binary_Op
5094 -- Only do analysis if the operator Comes_From_Source, since otherwise
5095 -- the operator was generated by the expander, and all such operators
5096 -- always refer to the operators in package Standard.
5098 if Comes_From_Source
(N
) then
5100 F1
: constant Entity_Id
:= First_Formal
(Op_Id
);
5101 F2
: constant Entity_Id
:= Next_Formal
(F1
);
5104 -- Verify that Op_Id is a visible binary function. Note that since
5105 -- we know Op_Id is overloaded, potentially use visible means use
5106 -- visible for sure (RM 9.4(11)).
5108 if Ekind
(Op_Id
) = E_Function
5109 and then Present
(F2
)
5110 and then (Is_Immediately_Visible
(Op_Id
)
5111 or else Is_Potentially_Use_Visible
(Op_Id
))
5112 and then Has_Compatible_Type
(Left_Opnd
(N
), Etype
(F1
))
5113 and then Has_Compatible_Type
(Right_Opnd
(N
), Etype
(F2
))
5115 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
5117 -- If the left operand is overloaded, indicate that the current
5118 -- type is a viable candidate. This is redundant in most cases,
5119 -- but for equality and comparison operators where the context
5120 -- does not impose a type on the operands, setting the proper
5121 -- type is necessary to avoid subsequent ambiguities during
5122 -- resolution, when both user-defined and predefined operators
5123 -- may be candidates.
5125 if Is_Overloaded
(Left_Opnd
(N
)) then
5126 Set_Etype
(Left_Opnd
(N
), Etype
(F1
));
5129 if Debug_Flag_E
then
5130 Write_Str
("user defined operator ");
5131 Write_Name
(Chars
(Op_Id
));
5132 Write_Str
(" on node ");
5133 Write_Int
(Int
(N
));
5139 end Analyze_User_Defined_Binary_Op
;
5141 -----------------------------------
5142 -- Analyze_User_Defined_Unary_Op --
5143 -----------------------------------
5145 procedure Analyze_User_Defined_Unary_Op
5150 -- Only do analysis if the operator Comes_From_Source, since otherwise
5151 -- the operator was generated by the expander, and all such operators
5152 -- always refer to the operators in package Standard.
5154 if Comes_From_Source
(N
) then
5156 F
: constant Entity_Id
:= First_Formal
(Op_Id
);
5159 -- Verify that Op_Id is a visible unary function. Note that since
5160 -- we know Op_Id is overloaded, potentially use visible means use
5161 -- visible for sure (RM 9.4(11)).
5163 if Ekind
(Op_Id
) = E_Function
5164 and then No
(Next_Formal
(F
))
5165 and then (Is_Immediately_Visible
(Op_Id
)
5166 or else Is_Potentially_Use_Visible
(Op_Id
))
5167 and then Has_Compatible_Type
(Right_Opnd
(N
), Etype
(F
))
5169 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
5173 end Analyze_User_Defined_Unary_Op
;
5175 ---------------------------
5176 -- Check_Arithmetic_Pair --
5177 ---------------------------
5179 procedure Check_Arithmetic_Pair
5180 (T1
, T2
: Entity_Id
;
5184 Op_Name
: constant Name_Id
:= Chars
(Op_Id
);
5186 function Has_Fixed_Op
(Typ
: Entity_Id
; Op
: Entity_Id
) return Boolean;
5187 -- Check whether the fixed-point type Typ has a user-defined operator
5188 -- (multiplication or division) that should hide the corresponding
5189 -- predefined operator. Used to implement Ada 2005 AI-264, to make
5190 -- such operators more visible and therefore useful.
5192 -- If the name of the operation is an expanded name with prefix
5193 -- Standard, the predefined universal fixed operator is available,
5194 -- as specified by AI-420 (RM 4.5.5 (19.1/2)).
5196 function Specific_Type
(T1
, T2
: Entity_Id
) return Entity_Id
;
5197 -- Get specific type (i.e. non-universal type if there is one)
5203 function Has_Fixed_Op
(Typ
: Entity_Id
; Op
: Entity_Id
) return Boolean is
5204 Bas
: constant Entity_Id
:= Base_Type
(Typ
);
5210 -- If the universal_fixed operation is given explicitly the rule
5211 -- concerning primitive operations of the type do not apply.
5213 if Nkind
(N
) = N_Function_Call
5214 and then Nkind
(Name
(N
)) = N_Expanded_Name
5215 and then Entity
(Prefix
(Name
(N
))) = Standard_Standard
5220 -- The operation is treated as primitive if it is declared in the
5221 -- same scope as the type, and therefore on the same entity chain.
5223 Ent
:= Next_Entity
(Typ
);
5224 while Present
(Ent
) loop
5225 if Chars
(Ent
) = Chars
(Op
) then
5226 F1
:= First_Formal
(Ent
);
5227 F2
:= Next_Formal
(F1
);
5229 -- The operation counts as primitive if either operand or
5230 -- result are of the given base type, and both operands are
5231 -- fixed point types.
5233 if (Base_Type
(Etype
(F1
)) = Bas
5234 and then Is_Fixed_Point_Type
(Etype
(F2
)))
5237 (Base_Type
(Etype
(F2
)) = Bas
5238 and then Is_Fixed_Point_Type
(Etype
(F1
)))
5241 (Base_Type
(Etype
(Ent
)) = Bas
5242 and then Is_Fixed_Point_Type
(Etype
(F1
))
5243 and then Is_Fixed_Point_Type
(Etype
(F2
)))
5259 function Specific_Type
(T1
, T2
: Entity_Id
) return Entity_Id
is
5261 if T1
= Universal_Integer
or else T1
= Universal_Real
then
5262 return Base_Type
(T2
);
5264 return Base_Type
(T1
);
5268 -- Start of processing for Check_Arithmetic_Pair
5271 if Nam_In
(Op_Name
, Name_Op_Add
, Name_Op_Subtract
) then
5272 if Is_Numeric_Type
(T1
)
5273 and then Is_Numeric_Type
(T2
)
5274 and then (Covers
(T1
=> T1
, T2
=> T2
)
5276 Covers
(T1
=> T2
, T2
=> T1
))
5278 Add_One_Interp
(N
, Op_Id
, Specific_Type
(T1
, T2
));
5281 elsif Nam_In
(Op_Name
, Name_Op_Multiply
, Name_Op_Divide
) then
5282 if Is_Fixed_Point_Type
(T1
)
5283 and then (Is_Fixed_Point_Type
(T2
) or else T2
= Universal_Real
)
5285 -- If Treat_Fixed_As_Integer is set then the Etype is already set
5286 -- and no further processing is required (this is the case of an
5287 -- operator constructed by Exp_Fixd for a fixed point operation)
5288 -- Otherwise add one interpretation with universal fixed result
5289 -- If the operator is given in functional notation, it comes
5290 -- from source and Fixed_As_Integer cannot apply.
5292 if (Nkind
(N
) not in N_Op
5293 or else not Treat_Fixed_As_Integer
(N
))
5295 (not Has_Fixed_Op
(T1
, Op_Id
)
5296 or else Nkind
(Parent
(N
)) = N_Type_Conversion
)
5298 Add_One_Interp
(N
, Op_Id
, Universal_Fixed
);
5301 elsif Is_Fixed_Point_Type
(T2
)
5302 and then (Nkind
(N
) not in N_Op
5303 or else not Treat_Fixed_As_Integer
(N
))
5304 and then T1
= Universal_Real
5306 (not Has_Fixed_Op
(T1
, Op_Id
)
5307 or else Nkind
(Parent
(N
)) = N_Type_Conversion
)
5309 Add_One_Interp
(N
, Op_Id
, Universal_Fixed
);
5311 elsif Is_Numeric_Type
(T1
)
5312 and then Is_Numeric_Type
(T2
)
5313 and then (Covers
(T1
=> T1
, T2
=> T2
)
5315 Covers
(T1
=> T2
, T2
=> T1
))
5317 Add_One_Interp
(N
, Op_Id
, Specific_Type
(T1
, T2
));
5319 elsif Is_Fixed_Point_Type
(T1
)
5320 and then (Base_Type
(T2
) = Base_Type
(Standard_Integer
)
5321 or else T2
= Universal_Integer
)
5323 Add_One_Interp
(N
, Op_Id
, T1
);
5325 elsif T2
= Universal_Real
5326 and then Base_Type
(T1
) = Base_Type
(Standard_Integer
)
5327 and then Op_Name
= Name_Op_Multiply
5329 Add_One_Interp
(N
, Op_Id
, Any_Fixed
);
5331 elsif T1
= Universal_Real
5332 and then Base_Type
(T2
) = Base_Type
(Standard_Integer
)
5334 Add_One_Interp
(N
, Op_Id
, Any_Fixed
);
5336 elsif Is_Fixed_Point_Type
(T2
)
5337 and then (Base_Type
(T1
) = Base_Type
(Standard_Integer
)
5338 or else T1
= Universal_Integer
)
5339 and then Op_Name
= Name_Op_Multiply
5341 Add_One_Interp
(N
, Op_Id
, T2
);
5343 elsif T1
= Universal_Real
and then T2
= Universal_Integer
then
5344 Add_One_Interp
(N
, Op_Id
, T1
);
5346 elsif T2
= Universal_Real
5347 and then T1
= Universal_Integer
5348 and then Op_Name
= Name_Op_Multiply
5350 Add_One_Interp
(N
, Op_Id
, T2
);
5353 elsif Op_Name
= Name_Op_Mod
or else Op_Name
= Name_Op_Rem
then
5355 -- Note: The fixed-point operands case with Treat_Fixed_As_Integer
5356 -- set does not require any special processing, since the Etype is
5357 -- already set (case of operation constructed by Exp_Fixed).
5359 if Is_Integer_Type
(T1
)
5360 and then (Covers
(T1
=> T1
, T2
=> T2
)
5362 Covers
(T1
=> T2
, T2
=> T1
))
5364 Add_One_Interp
(N
, Op_Id
, Specific_Type
(T1
, T2
));
5367 elsif Op_Name
= Name_Op_Expon
then
5368 if Is_Numeric_Type
(T1
)
5369 and then not Is_Fixed_Point_Type
(T1
)
5370 and then (Base_Type
(T2
) = Base_Type
(Standard_Integer
)
5371 or else T2
= Universal_Integer
)
5373 Add_One_Interp
(N
, Op_Id
, Base_Type
(T1
));
5376 else pragma Assert
(Nkind
(N
) in N_Op_Shift
);
5378 -- If not one of the predefined operators, the node may be one
5379 -- of the intrinsic functions. Its kind is always specific, and
5380 -- we can use it directly, rather than the name of the operation.
5382 if Is_Integer_Type
(T1
)
5383 and then (Base_Type
(T2
) = Base_Type
(Standard_Integer
)
5384 or else T2
= Universal_Integer
)
5386 Add_One_Interp
(N
, Op_Id
, Base_Type
(T1
));
5389 end Check_Arithmetic_Pair
;
5391 -------------------------------
5392 -- Check_Misspelled_Selector --
5393 -------------------------------
5395 procedure Check_Misspelled_Selector
5396 (Prefix
: Entity_Id
;
5399 Max_Suggestions
: constant := 2;
5400 Nr_Of_Suggestions
: Natural := 0;
5402 Suggestion_1
: Entity_Id
:= Empty
;
5403 Suggestion_2
: Entity_Id
:= Empty
;
5408 -- All the components of the prefix of selector Sel are matched against
5409 -- Sel and a count is maintained of possible misspellings. When at
5410 -- the end of the analysis there are one or two (not more) possible
5411 -- misspellings, these misspellings will be suggested as possible
5414 if not (Is_Private_Type
(Prefix
) or else Is_Record_Type
(Prefix
)) then
5416 -- Concurrent types should be handled as well ???
5421 Comp
:= First_Entity
(Prefix
);
5422 while Nr_Of_Suggestions
<= Max_Suggestions
and then Present
(Comp
) loop
5423 if Is_Visible_Component
(Comp
) then
5424 if Is_Bad_Spelling_Of
(Chars
(Comp
), Chars
(Sel
)) then
5425 Nr_Of_Suggestions
:= Nr_Of_Suggestions
+ 1;
5427 case Nr_Of_Suggestions
is
5428 when 1 => Suggestion_1
:= Comp
;
5429 when 2 => Suggestion_2
:= Comp
;
5430 when others => exit;
5435 Comp
:= Next_Entity
(Comp
);
5438 -- Report at most two suggestions
5440 if Nr_Of_Suggestions
= 1 then
5441 Error_Msg_NE
-- CODEFIX
5442 ("\possible misspelling of&", Sel
, Suggestion_1
);
5444 elsif Nr_Of_Suggestions
= 2 then
5445 Error_Msg_Node_2
:= Suggestion_2
;
5446 Error_Msg_NE
-- CODEFIX
5447 ("\possible misspelling of& or&", Sel
, Suggestion_1
);
5449 end Check_Misspelled_Selector
;
5451 ----------------------
5452 -- Defined_In_Scope --
5453 ----------------------
5455 function Defined_In_Scope
(T
: Entity_Id
; S
: Entity_Id
) return Boolean
5457 S1
: constant Entity_Id
:= Scope
(Base_Type
(T
));
5460 or else (S1
= System_Aux_Id
and then S
= Scope
(S1
));
5461 end Defined_In_Scope
;
5467 procedure Diagnose_Call
(N
: Node_Id
; Nam
: Node_Id
) is
5473 Void_Interp_Seen
: Boolean := False;
5476 pragma Warnings
(Off
, Boolean);
5479 if Ada_Version
>= Ada_2005
then
5480 Actual
:= First_Actual
(N
);
5481 while Present
(Actual
) loop
5483 -- Ada 2005 (AI-50217): Post an error in case of premature
5484 -- usage of an entity from the limited view.
5486 if not Analyzed
(Etype
(Actual
))
5487 and then From_Limited_With
(Etype
(Actual
))
5489 Error_Msg_Qual_Level
:= 1;
5491 ("missing with_clause for scope of imported type&",
5492 Actual
, Etype
(Actual
));
5493 Error_Msg_Qual_Level
:= 0;
5496 Next_Actual
(Actual
);
5500 -- Analyze each candidate call again, with full error reporting
5504 ("no candidate interpretations match the actuals:!", Nam
);
5505 Err_Mode
:= All_Errors_Mode
;
5506 All_Errors_Mode
:= True;
5508 -- If this is a call to an operation of a concurrent type,
5509 -- the failed interpretations have been removed from the
5510 -- name. Recover them to provide full diagnostics.
5512 if Nkind
(Parent
(Nam
)) = N_Selected_Component
then
5513 Set_Entity
(Nam
, Empty
);
5514 New_Nam
:= New_Copy_Tree
(Parent
(Nam
));
5515 Set_Is_Overloaded
(New_Nam
, False);
5516 Set_Is_Overloaded
(Selector_Name
(New_Nam
), False);
5517 Set_Parent
(New_Nam
, Parent
(Parent
(Nam
)));
5518 Analyze_Selected_Component
(New_Nam
);
5519 Get_First_Interp
(Selector_Name
(New_Nam
), X
, It
);
5521 Get_First_Interp
(Nam
, X
, It
);
5524 while Present
(It
.Nam
) loop
5525 if Etype
(It
.Nam
) = Standard_Void_Type
then
5526 Void_Interp_Seen
:= True;
5529 Analyze_One_Call
(N
, It
.Nam
, True, Success
);
5530 Get_Next_Interp
(X
, It
);
5533 if Nkind
(N
) = N_Function_Call
then
5534 Get_First_Interp
(Nam
, X
, It
);
5535 while Present
(It
.Nam
) loop
5536 if Ekind_In
(It
.Nam
, E_Function
, E_Operator
) then
5539 Get_Next_Interp
(X
, It
);
5543 -- If all interpretations are procedures, this deserves a
5544 -- more precise message. Ditto if this appears as the prefix
5545 -- of a selected component, which may be a lexical error.
5548 ("\context requires function call, found procedure name", Nam
);
5550 if Nkind
(Parent
(N
)) = N_Selected_Component
5551 and then N
= Prefix
(Parent
(N
))
5553 Error_Msg_N
-- CODEFIX
5554 ("\period should probably be semicolon", Parent
(N
));
5557 elsif Nkind
(N
) = N_Procedure_Call_Statement
5558 and then not Void_Interp_Seen
5561 "\function name found in procedure call", Nam
);
5564 All_Errors_Mode
:= Err_Mode
;
5567 ---------------------------
5568 -- Find_Arithmetic_Types --
5569 ---------------------------
5571 procedure Find_Arithmetic_Types
5576 Index1
: Interp_Index
;
5577 Index2
: Interp_Index
;
5581 procedure Check_Right_Argument
(T
: Entity_Id
);
5582 -- Check right operand of operator
5584 --------------------------
5585 -- Check_Right_Argument --
5586 --------------------------
5588 procedure Check_Right_Argument
(T
: Entity_Id
) is
5590 if not Is_Overloaded
(R
) then
5591 Check_Arithmetic_Pair
(T
, Etype
(R
), Op_Id
, N
);
5593 Get_First_Interp
(R
, Index2
, It2
);
5594 while Present
(It2
.Typ
) loop
5595 Check_Arithmetic_Pair
(T
, It2
.Typ
, Op_Id
, N
);
5596 Get_Next_Interp
(Index2
, It2
);
5599 end Check_Right_Argument
;
5601 -- Start of processing for Find_Arithmetic_Types
5604 if not Is_Overloaded
(L
) then
5605 Check_Right_Argument
(Etype
(L
));
5608 Get_First_Interp
(L
, Index1
, It1
);
5609 while Present
(It1
.Typ
) loop
5610 Check_Right_Argument
(It1
.Typ
);
5611 Get_Next_Interp
(Index1
, It1
);
5615 end Find_Arithmetic_Types
;
5617 ------------------------
5618 -- Find_Boolean_Types --
5619 ------------------------
5621 procedure Find_Boolean_Types
5626 Index
: Interp_Index
;
5629 procedure Check_Numeric_Argument
(T
: Entity_Id
);
5630 -- Special case for logical operations one of whose operands is an
5631 -- integer literal. If both are literal the result is any modular type.
5633 ----------------------------
5634 -- Check_Numeric_Argument --
5635 ----------------------------
5637 procedure Check_Numeric_Argument
(T
: Entity_Id
) is
5639 if T
= Universal_Integer
then
5640 Add_One_Interp
(N
, Op_Id
, Any_Modular
);
5642 elsif Is_Modular_Integer_Type
(T
) then
5643 Add_One_Interp
(N
, Op_Id
, T
);
5645 end Check_Numeric_Argument
;
5647 -- Start of processing for Find_Boolean_Types
5650 if not Is_Overloaded
(L
) then
5651 if Etype
(L
) = Universal_Integer
5652 or else Etype
(L
) = Any_Modular
5654 if not Is_Overloaded
(R
) then
5655 Check_Numeric_Argument
(Etype
(R
));
5658 Get_First_Interp
(R
, Index
, It
);
5659 while Present
(It
.Typ
) loop
5660 Check_Numeric_Argument
(It
.Typ
);
5661 Get_Next_Interp
(Index
, It
);
5665 -- If operands are aggregates, we must assume that they may be
5666 -- boolean arrays, and leave disambiguation for the second pass.
5667 -- If only one is an aggregate, verify that the other one has an
5668 -- interpretation as a boolean array
5670 elsif Nkind
(L
) = N_Aggregate
then
5671 if Nkind
(R
) = N_Aggregate
then
5672 Add_One_Interp
(N
, Op_Id
, Etype
(L
));
5674 elsif not Is_Overloaded
(R
) then
5675 if Valid_Boolean_Arg
(Etype
(R
)) then
5676 Add_One_Interp
(N
, Op_Id
, Etype
(R
));
5680 Get_First_Interp
(R
, Index
, It
);
5681 while Present
(It
.Typ
) loop
5682 if Valid_Boolean_Arg
(It
.Typ
) then
5683 Add_One_Interp
(N
, Op_Id
, It
.Typ
);
5686 Get_Next_Interp
(Index
, It
);
5690 elsif Valid_Boolean_Arg
(Etype
(L
))
5691 and then Has_Compatible_Type
(R
, Etype
(L
))
5693 Add_One_Interp
(N
, Op_Id
, Etype
(L
));
5697 Get_First_Interp
(L
, Index
, It
);
5698 while Present
(It
.Typ
) loop
5699 if Valid_Boolean_Arg
(It
.Typ
)
5700 and then Has_Compatible_Type
(R
, It
.Typ
)
5702 Add_One_Interp
(N
, Op_Id
, It
.Typ
);
5705 Get_Next_Interp
(Index
, It
);
5708 end Find_Boolean_Types
;
5710 ---------------------------
5711 -- Find_Comparison_Types --
5712 ---------------------------
5714 procedure Find_Comparison_Types
5719 Index
: Interp_Index
;
5721 Found
: Boolean := False;
5724 Scop
: Entity_Id
:= Empty
;
5726 procedure Try_One_Interp
(T1
: Entity_Id
);
5727 -- Routine to try one proposed interpretation. Note that the context
5728 -- of the operator plays no role in resolving the arguments, so that
5729 -- if there is more than one interpretation of the operands that is
5730 -- compatible with comparison, the operation is ambiguous.
5732 --------------------
5733 -- Try_One_Interp --
5734 --------------------
5736 procedure Try_One_Interp
(T1
: Entity_Id
) is
5739 -- If the operator is an expanded name, then the type of the operand
5740 -- must be defined in the corresponding scope. If the type is
5741 -- universal, the context will impose the correct type.
5744 and then not Defined_In_Scope
(T1
, Scop
)
5745 and then T1
/= Universal_Integer
5746 and then T1
/= Universal_Real
5747 and then T1
/= Any_String
5748 and then T1
/= Any_Composite
5753 if Valid_Comparison_Arg
(T1
) and then Has_Compatible_Type
(R
, T1
) then
5754 if Found
and then Base_Type
(T1
) /= Base_Type
(T_F
) then
5755 It
:= Disambiguate
(L
, I_F
, Index
, Any_Type
);
5757 if It
= No_Interp
then
5758 Ambiguous_Operands
(N
);
5759 Set_Etype
(L
, Any_Type
);
5773 Find_Non_Universal_Interpretations
(N
, R
, Op_Id
, T1
);
5778 -- Start of processing for Find_Comparison_Types
5781 -- If left operand is aggregate, the right operand has to
5782 -- provide a usable type for it.
5784 if Nkind
(L
) = N_Aggregate
and then Nkind
(R
) /= N_Aggregate
then
5785 Find_Comparison_Types
(L
=> R
, R
=> L
, Op_Id
=> Op_Id
, N
=> N
);
5789 if Nkind
(N
) = N_Function_Call
5790 and then Nkind
(Name
(N
)) = N_Expanded_Name
5792 Scop
:= Entity
(Prefix
(Name
(N
)));
5794 -- The prefix may be a package renaming, and the subsequent test
5795 -- requires the original package.
5797 if Ekind
(Scop
) = E_Package
5798 and then Present
(Renamed_Entity
(Scop
))
5800 Scop
:= Renamed_Entity
(Scop
);
5801 Set_Entity
(Prefix
(Name
(N
)), Scop
);
5805 if not Is_Overloaded
(L
) then
5806 Try_One_Interp
(Etype
(L
));
5809 Get_First_Interp
(L
, Index
, It
);
5810 while Present
(It
.Typ
) loop
5811 Try_One_Interp
(It
.Typ
);
5812 Get_Next_Interp
(Index
, It
);
5815 end Find_Comparison_Types
;
5817 ----------------------------------------
5818 -- Find_Non_Universal_Interpretations --
5819 ----------------------------------------
5821 procedure Find_Non_Universal_Interpretations
5827 Index
: Interp_Index
;
5831 if T1
= Universal_Integer
or else T1
= Universal_Real
5833 -- If the left operand of an equality operator is null, the visibility
5834 -- of the operator must be determined from the interpretation of the
5835 -- right operand. This processing must be done for Any_Access, which
5836 -- is the internal representation of the type of the literal null.
5838 or else T1
= Any_Access
5840 if not Is_Overloaded
(R
) then
5841 Add_One_Interp
(N
, Op_Id
, Standard_Boolean
, Base_Type
(Etype
(R
)));
5843 Get_First_Interp
(R
, Index
, It
);
5844 while Present
(It
.Typ
) loop
5845 if Covers
(It
.Typ
, T1
) then
5847 (N
, Op_Id
, Standard_Boolean
, Base_Type
(It
.Typ
));
5850 Get_Next_Interp
(Index
, It
);
5854 Add_One_Interp
(N
, Op_Id
, Standard_Boolean
, Base_Type
(T1
));
5856 end Find_Non_Universal_Interpretations
;
5858 ------------------------------
5859 -- Find_Concatenation_Types --
5860 ------------------------------
5862 procedure Find_Concatenation_Types
5867 Op_Type
: constant Entity_Id
:= Etype
(Op_Id
);
5870 if Is_Array_Type
(Op_Type
)
5871 and then not Is_Limited_Type
(Op_Type
)
5873 and then (Has_Compatible_Type
(L
, Op_Type
)
5875 Has_Compatible_Type
(L
, Component_Type
(Op_Type
)))
5877 and then (Has_Compatible_Type
(R
, Op_Type
)
5879 Has_Compatible_Type
(R
, Component_Type
(Op_Type
)))
5881 Add_One_Interp
(N
, Op_Id
, Op_Type
);
5883 end Find_Concatenation_Types
;
5885 -------------------------
5886 -- Find_Equality_Types --
5887 -------------------------
5889 procedure Find_Equality_Types
5894 Index
: Interp_Index
;
5896 Found
: Boolean := False;
5899 Scop
: Entity_Id
:= Empty
;
5901 procedure Try_One_Interp
(T1
: Entity_Id
);
5902 -- The context of the equality operator plays no role in resolving the
5903 -- arguments, so that if there is more than one interpretation of the
5904 -- operands that is compatible with equality, the construct is ambiguous
5905 -- and an error can be emitted now, after trying to disambiguate, i.e.
5906 -- applying preference rules.
5908 --------------------
5909 -- Try_One_Interp --
5910 --------------------
5912 procedure Try_One_Interp
(T1
: Entity_Id
) is
5913 Bas
: constant Entity_Id
:= Base_Type
(T1
);
5916 -- If the operator is an expanded name, then the type of the operand
5917 -- must be defined in the corresponding scope. If the type is
5918 -- universal, the context will impose the correct type. An anonymous
5919 -- type for a 'Access reference is also universal in this sense, as
5920 -- the actual type is obtained from context.
5922 -- In Ada 2005, the equality operator for anonymous access types
5923 -- is declared in Standard, and preference rules apply to it.
5925 if Present
(Scop
) then
5926 if Defined_In_Scope
(T1
, Scop
)
5927 or else T1
= Universal_Integer
5928 or else T1
= Universal_Real
5929 or else T1
= Any_Access
5930 or else T1
= Any_String
5931 or else T1
= Any_Composite
5932 or else (Ekind
(T1
) = E_Access_Subprogram_Type
5933 and then not Comes_From_Source
(T1
))
5937 elsif Ekind
(T1
) = E_Anonymous_Access_Type
5938 and then Scop
= Standard_Standard
5943 -- The scope does not contain an operator for the type
5948 -- If we have infix notation, the operator must be usable. Within
5949 -- an instance, if the type is already established we know it is
5950 -- correct. If an operand is universal it is compatible with any
5953 elsif In_Open_Scopes
(Scope
(Bas
))
5954 or else Is_Potentially_Use_Visible
(Bas
)
5955 or else In_Use
(Bas
)
5956 or else (In_Use
(Scope
(Bas
)) and then not Is_Hidden
(Bas
))
5958 -- In an instance, the type may have been immediately visible.
5959 -- Either the types are compatible, or one operand is universal
5960 -- (numeric or null).
5962 or else (In_Instance
5964 (First_Subtype
(T1
) = First_Subtype
(Etype
(R
))
5965 or else Nkind
(R
) = N_Null
5967 (Is_Numeric_Type
(T1
)
5968 and then Is_Universal_Numeric_Type
(Etype
(R
)))))
5970 -- In Ada 2005, the equality on anonymous access types is declared
5971 -- in Standard, and is always visible.
5973 or else Ekind
(T1
) = E_Anonymous_Access_Type
5978 -- Save candidate type for subsequent error message, if any
5980 if not Is_Limited_Type
(T1
) then
5981 Candidate_Type
:= T1
;
5987 -- Ada 2005 (AI-230): Keep restriction imposed by Ada 83 and 95:
5988 -- Do not allow anonymous access types in equality operators.
5990 if Ada_Version
< Ada_2005
5991 and then Ekind
(T1
) = E_Anonymous_Access_Type
5996 -- If the right operand has a type compatible with T1, check for an
5997 -- acceptable interpretation, unless T1 is limited (no predefined
5998 -- equality available), or this is use of a "/=" for a tagged type.
5999 -- In the latter case, possible interpretations of equality need
6000 -- to be considered, we don't want the default inequality declared
6001 -- in Standard to be chosen, and the "/=" will be rewritten as a
6002 -- negation of "=" (see the end of Analyze_Equality_Op). This ensures
6003 -- that that rewriting happens during analysis rather than being
6004 -- delayed until expansion (this is needed for ASIS, which only sees
6005 -- the unexpanded tree). Note that if the node is N_Op_Ne, but Op_Id
6006 -- is Name_Op_Eq then we still proceed with the interpretation,
6007 -- because that indicates the potential rewriting case where the
6008 -- interpretation to consider is actually "=" and the node may be
6009 -- about to be rewritten by Analyze_Equality_Op.
6011 if T1
/= Standard_Void_Type
6012 and then Has_Compatible_Type
(R
, T1
)
6015 ((not Is_Limited_Type
(T1
)
6016 and then not Is_Limited_Composite
(T1
))
6020 and then not Is_Limited_Type
(Component_Type
(T1
))
6021 and then Available_Full_View_Of_Component
(T1
)))
6024 (Nkind
(N
) /= N_Op_Ne
6025 or else not Is_Tagged_Type
(T1
)
6026 or else Chars
(Op_Id
) = Name_Op_Eq
)
6029 and then Base_Type
(T1
) /= Base_Type
(T_F
)
6031 It
:= Disambiguate
(L
, I_F
, Index
, Any_Type
);
6033 if It
= No_Interp
then
6034 Ambiguous_Operands
(N
);
6035 Set_Etype
(L
, Any_Type
);
6048 if not Analyzed
(L
) then
6052 Find_Non_Universal_Interpretations
(N
, R
, Op_Id
, T1
);
6054 -- Case of operator was not visible, Etype still set to Any_Type
6056 if Etype
(N
) = Any_Type
then
6060 elsif Scop
= Standard_Standard
6061 and then Ekind
(T1
) = E_Anonymous_Access_Type
6067 -- Start of processing for Find_Equality_Types
6070 -- If left operand is aggregate, the right operand has to
6071 -- provide a usable type for it.
6073 if Nkind
(L
) = N_Aggregate
6074 and then Nkind
(R
) /= N_Aggregate
6076 Find_Equality_Types
(L
=> R
, R
=> L
, Op_Id
=> Op_Id
, N
=> N
);
6080 if Nkind
(N
) = N_Function_Call
6081 and then Nkind
(Name
(N
)) = N_Expanded_Name
6083 Scop
:= Entity
(Prefix
(Name
(N
)));
6085 -- The prefix may be a package renaming, and the subsequent test
6086 -- requires the original package.
6088 if Ekind
(Scop
) = E_Package
6089 and then Present
(Renamed_Entity
(Scop
))
6091 Scop
:= Renamed_Entity
(Scop
);
6092 Set_Entity
(Prefix
(Name
(N
)), Scop
);
6096 if not Is_Overloaded
(L
) then
6097 Try_One_Interp
(Etype
(L
));
6100 Get_First_Interp
(L
, Index
, It
);
6101 while Present
(It
.Typ
) loop
6102 Try_One_Interp
(It
.Typ
);
6103 Get_Next_Interp
(Index
, It
);
6106 end Find_Equality_Types
;
6108 -------------------------
6109 -- Find_Negation_Types --
6110 -------------------------
6112 procedure Find_Negation_Types
6117 Index
: Interp_Index
;
6121 if not Is_Overloaded
(R
) then
6122 if Etype
(R
) = Universal_Integer
then
6123 Add_One_Interp
(N
, Op_Id
, Any_Modular
);
6124 elsif Valid_Boolean_Arg
(Etype
(R
)) then
6125 Add_One_Interp
(N
, Op_Id
, Etype
(R
));
6129 Get_First_Interp
(R
, Index
, It
);
6130 while Present
(It
.Typ
) loop
6131 if Valid_Boolean_Arg
(It
.Typ
) then
6132 Add_One_Interp
(N
, Op_Id
, It
.Typ
);
6135 Get_Next_Interp
(Index
, It
);
6138 end Find_Negation_Types
;
6140 ------------------------------
6141 -- Find_Primitive_Operation --
6142 ------------------------------
6144 function Find_Primitive_Operation
(N
: Node_Id
) return Boolean is
6145 Obj
: constant Node_Id
:= Prefix
(N
);
6146 Op
: constant Node_Id
:= Selector_Name
(N
);
6153 Set_Etype
(Op
, Any_Type
);
6155 if Is_Access_Type
(Etype
(Obj
)) then
6156 Typ
:= Designated_Type
(Etype
(Obj
));
6161 if Is_Class_Wide_Type
(Typ
) then
6162 Typ
:= Root_Type
(Typ
);
6165 Prims
:= Primitive_Operations
(Typ
);
6167 Prim
:= First_Elmt
(Prims
);
6168 while Present
(Prim
) loop
6169 if Chars
(Node
(Prim
)) = Chars
(Op
) then
6170 Add_One_Interp
(Op
, Node
(Prim
), Etype
(Node
(Prim
)));
6171 Set_Etype
(N
, Etype
(Node
(Prim
)));
6177 -- Now look for class-wide operations of the type or any of its
6178 -- ancestors by iterating over the homonyms of the selector.
6181 Cls_Type
: constant Entity_Id
:= Class_Wide_Type
(Typ
);
6185 Hom
:= Current_Entity
(Op
);
6186 while Present
(Hom
) loop
6187 if (Ekind
(Hom
) = E_Procedure
6189 Ekind
(Hom
) = E_Function
)
6190 and then Scope
(Hom
) = Scope
(Typ
)
6191 and then Present
(First_Formal
(Hom
))
6193 (Base_Type
(Etype
(First_Formal
(Hom
))) = Cls_Type
6195 (Is_Access_Type
(Etype
(First_Formal
(Hom
)))
6197 Ekind
(Etype
(First_Formal
(Hom
))) =
6198 E_Anonymous_Access_Type
6201 (Designated_Type
(Etype
(First_Formal
(Hom
)))) =
6204 Add_One_Interp
(Op
, Hom
, Etype
(Hom
));
6205 Set_Etype
(N
, Etype
(Hom
));
6208 Hom
:= Homonym
(Hom
);
6212 return Etype
(Op
) /= Any_Type
;
6213 end Find_Primitive_Operation
;
6215 ----------------------
6216 -- Find_Unary_Types --
6217 ----------------------
6219 procedure Find_Unary_Types
6224 Index
: Interp_Index
;
6228 if not Is_Overloaded
(R
) then
6229 if Is_Numeric_Type
(Etype
(R
)) then
6231 -- In an instance a generic actual may be a numeric type even if
6232 -- the formal in the generic unit was not. In that case, the
6233 -- predefined operator was not a possible interpretation in the
6234 -- generic, and cannot be one in the instance, unless the operator
6235 -- is an actual of an instance.
6239 not Is_Numeric_Type
(Corresponding_Generic_Type
(Etype
(R
)))
6243 Add_One_Interp
(N
, Op_Id
, Base_Type
(Etype
(R
)));
6248 Get_First_Interp
(R
, Index
, It
);
6249 while Present
(It
.Typ
) loop
6250 if Is_Numeric_Type
(It
.Typ
) then
6254 (Corresponding_Generic_Type
(Etype
(It
.Typ
)))
6259 Add_One_Interp
(N
, Op_Id
, Base_Type
(It
.Typ
));
6263 Get_Next_Interp
(Index
, It
);
6266 end Find_Unary_Types
;
6272 function Junk_Operand
(N
: Node_Id
) return Boolean is
6276 if Error_Posted
(N
) then
6280 -- Get entity to be tested
6282 if Is_Entity_Name
(N
)
6283 and then Present
(Entity
(N
))
6287 -- An odd case, a procedure name gets converted to a very peculiar
6288 -- function call, and here is where we detect this happening.
6290 elsif Nkind
(N
) = N_Function_Call
6291 and then Is_Entity_Name
(Name
(N
))
6292 and then Present
(Entity
(Name
(N
)))
6296 -- Another odd case, there are at least some cases of selected
6297 -- components where the selected component is not marked as having
6298 -- an entity, even though the selector does have an entity
6300 elsif Nkind
(N
) = N_Selected_Component
6301 and then Present
(Entity
(Selector_Name
(N
)))
6303 Enode
:= Selector_Name
(N
);
6309 -- Now test the entity we got to see if it is a bad case
6311 case Ekind
(Entity
(Enode
)) is
6315 ("package name cannot be used as operand", Enode
);
6317 when Generic_Unit_Kind
=>
6319 ("generic unit name cannot be used as operand", Enode
);
6323 ("subtype name cannot be used as operand", Enode
);
6327 ("entry name cannot be used as operand", Enode
);
6331 ("procedure name cannot be used as operand", Enode
);
6335 ("exception name cannot be used as operand", Enode
);
6337 when E_Block | E_Label | E_Loop
=>
6339 ("label name cannot be used as operand", Enode
);
6349 --------------------
6350 -- Operator_Check --
6351 --------------------
6353 procedure Operator_Check
(N
: Node_Id
) is
6355 Remove_Abstract_Operations
(N
);
6357 -- Test for case of no interpretation found for operator
6359 if Etype
(N
) = Any_Type
then
6363 Op_Id
: Entity_Id
:= Empty
;
6366 R
:= Right_Opnd
(N
);
6368 if Nkind
(N
) in N_Binary_Op
then
6374 -- If either operand has no type, then don't complain further,
6375 -- since this simply means that we have a propagated error.
6378 or else Etype
(R
) = Any_Type
6379 or else (Nkind
(N
) in N_Binary_Op
and then Etype
(L
) = Any_Type
)
6381 -- For the rather unusual case where one of the operands is
6382 -- a Raise_Expression, whose initial type is Any_Type, use
6383 -- the type of the other operand.
6385 if Nkind
(L
) = N_Raise_Expression
then
6386 Set_Etype
(L
, Etype
(R
));
6387 Set_Etype
(N
, Etype
(R
));
6389 elsif Nkind
(R
) = N_Raise_Expression
then
6390 Set_Etype
(R
, Etype
(L
));
6391 Set_Etype
(N
, Etype
(L
));
6396 -- We explicitly check for the case of concatenation of component
6397 -- with component to avoid reporting spurious matching array types
6398 -- that might happen to be lurking in distant packages (such as
6399 -- run-time packages). This also prevents inconsistencies in the
6400 -- messages for certain ACVC B tests, which can vary depending on
6401 -- types declared in run-time interfaces. Another improvement when
6402 -- aggregates are present is to look for a well-typed operand.
6404 elsif Present
(Candidate_Type
)
6405 and then (Nkind
(N
) /= N_Op_Concat
6406 or else Is_Array_Type
(Etype
(L
))
6407 or else Is_Array_Type
(Etype
(R
)))
6409 if Nkind
(N
) = N_Op_Concat
then
6410 if Etype
(L
) /= Any_Composite
6411 and then Is_Array_Type
(Etype
(L
))
6413 Candidate_Type
:= Etype
(L
);
6415 elsif Etype
(R
) /= Any_Composite
6416 and then Is_Array_Type
(Etype
(R
))
6418 Candidate_Type
:= Etype
(R
);
6422 Error_Msg_NE
-- CODEFIX
6423 ("operator for} is not directly visible!",
6424 N
, First_Subtype
(Candidate_Type
));
6427 U
: constant Node_Id
:=
6428 Cunit
(Get_Source_Unit
(Candidate_Type
));
6430 if Unit_Is_Visible
(U
) then
6431 Error_Msg_N
-- CODEFIX
6432 ("use clause would make operation legal!", N
);
6434 Error_Msg_NE
-- CODEFIX
6435 ("add with_clause and use_clause for&!",
6436 N
, Defining_Entity
(Unit
(U
)));
6441 -- If either operand is a junk operand (e.g. package name), then
6442 -- post appropriate error messages, but do not complain further.
6444 -- Note that the use of OR in this test instead of OR ELSE is
6445 -- quite deliberate, we may as well check both operands in the
6446 -- binary operator case.
6448 elsif Junk_Operand
(R
)
6449 or -- really mean OR here and not OR ELSE, see above
6450 (Nkind
(N
) in N_Binary_Op
and then Junk_Operand
(L
))
6454 -- If we have a logical operator, one of whose operands is
6455 -- Boolean, then we know that the other operand cannot resolve to
6456 -- Boolean (since we got no interpretations), but in that case we
6457 -- pretty much know that the other operand should be Boolean, so
6458 -- resolve it that way (generating an error)
6460 elsif Nkind_In
(N
, N_Op_And
, N_Op_Or
, N_Op_Xor
) then
6461 if Etype
(L
) = Standard_Boolean
then
6462 Resolve
(R
, Standard_Boolean
);
6464 elsif Etype
(R
) = Standard_Boolean
then
6465 Resolve
(L
, Standard_Boolean
);
6469 -- For an arithmetic operator or comparison operator, if one
6470 -- of the operands is numeric, then we know the other operand
6471 -- is not the same numeric type. If it is a non-numeric type,
6472 -- then probably it is intended to match the other operand.
6474 elsif Nkind_In
(N
, N_Op_Add
,
6480 Nkind_In
(N
, N_Op_Lt
,
6486 -- If Allow_Integer_Address is active, check whether the
6487 -- operation becomes legal after converting an operand.
6489 if Is_Numeric_Type
(Etype
(L
))
6490 and then not Is_Numeric_Type
(Etype
(R
))
6492 if Address_Integer_Convert_OK
(Etype
(R
), Etype
(L
)) then
6494 Unchecked_Convert_To
(Etype
(L
), Relocate_Node
(R
)));
6496 if Nkind_In
(N
, N_Op_Ge
, N_Op_Gt
, N_Op_Le
, N_Op_Lt
) then
6497 Analyze_Comparison_Op
(N
);
6499 Analyze_Arithmetic_Op
(N
);
6502 Resolve
(R
, Etype
(L
));
6507 elsif Is_Numeric_Type
(Etype
(R
))
6508 and then not Is_Numeric_Type
(Etype
(L
))
6510 if Address_Integer_Convert_OK
(Etype
(L
), Etype
(R
)) then
6512 Unchecked_Convert_To
(Etype
(R
), Relocate_Node
(L
)));
6514 if Nkind_In
(N
, N_Op_Ge
, N_Op_Gt
, N_Op_Le
, N_Op_Lt
) then
6515 Analyze_Comparison_Op
(N
);
6517 Analyze_Arithmetic_Op
(N
);
6523 Resolve
(L
, Etype
(R
));
6528 elsif Allow_Integer_Address
6529 and then Is_Descendent_Of_Address
(Etype
(L
))
6530 and then Is_Descendent_Of_Address
(Etype
(R
))
6531 and then not Error_Posted
(N
)
6534 Addr_Type
: constant Entity_Id
:= Etype
(L
);
6538 Unchecked_Convert_To
(
6539 Standard_Integer
, Relocate_Node
(L
)));
6541 Unchecked_Convert_To
(
6542 Standard_Integer
, Relocate_Node
(R
)));
6544 if Nkind_In
(N
, N_Op_Ge
, N_Op_Gt
, N_Op_Le
, N_Op_Lt
) then
6545 Analyze_Comparison_Op
(N
);
6547 Analyze_Arithmetic_Op
(N
);
6550 -- If this is an operand in an enclosing arithmetic
6551 -- operation, Convert the result as an address so that
6552 -- arithmetic folding of address can continue.
6554 if Nkind
(Parent
(N
)) in N_Op
then
6556 Unchecked_Convert_To
(Addr_Type
, Relocate_Node
(N
)));
6563 -- Comparisons on A'Access are common enough to deserve a
6566 elsif Nkind_In
(N
, N_Op_Eq
, N_Op_Ne
)
6567 and then Ekind
(Etype
(L
)) = E_Access_Attribute_Type
6568 and then Ekind
(Etype
(R
)) = E_Access_Attribute_Type
6571 ("two access attributes cannot be compared directly", N
);
6573 ("\use qualified expression for one of the operands",
6577 -- Another one for C programmers
6579 elsif Nkind
(N
) = N_Op_Concat
6580 and then Valid_Boolean_Arg
(Etype
(L
))
6581 and then Valid_Boolean_Arg
(Etype
(R
))
6583 Error_Msg_N
("invalid operands for concatenation", N
);
6584 Error_Msg_N
-- CODEFIX
6585 ("\maybe AND was meant", N
);
6588 -- A special case for comparison of access parameter with null
6590 elsif Nkind
(N
) = N_Op_Eq
6591 and then Is_Entity_Name
(L
)
6592 and then Nkind
(Parent
(Entity
(L
))) = N_Parameter_Specification
6593 and then Nkind
(Parameter_Type
(Parent
(Entity
(L
)))) =
6595 and then Nkind
(R
) = N_Null
6597 Error_Msg_N
("access parameter is not allowed to be null", L
);
6598 Error_Msg_N
("\(call would raise Constraint_Error)", L
);
6601 -- Another special case for exponentiation, where the right
6602 -- operand must be Natural, independently of the base.
6604 elsif Nkind
(N
) = N_Op_Expon
6605 and then Is_Numeric_Type
(Etype
(L
))
6606 and then not Is_Overloaded
(R
)
6608 First_Subtype
(Base_Type
(Etype
(R
))) /= Standard_Integer
6609 and then Base_Type
(Etype
(R
)) /= Universal_Integer
6611 if Ada_Version
>= Ada_2012
6612 and then Has_Dimension_System
(Etype
(L
))
6615 ("exponent for dimensioned type must be a rational" &
6616 ", found}", R
, Etype
(R
));
6619 ("exponent must be of type Natural, found}", R
, Etype
(R
));
6624 elsif Nkind_In
(N
, N_Op_Eq
, N_Op_Ne
) then
6625 if Address_Integer_Convert_OK
(Etype
(R
), Etype
(L
)) then
6627 Unchecked_Convert_To
(Etype
(L
), Relocate_Node
(R
)));
6628 Analyze_Equality_Op
(N
);
6633 -- If we fall through then just give general message. Note that in
6634 -- the following messages, if the operand is overloaded we choose
6635 -- an arbitrary type to complain about, but that is probably more
6636 -- useful than not giving a type at all.
6638 if Nkind
(N
) in N_Unary_Op
then
6639 Error_Msg_Node_2
:= Etype
(R
);
6640 Error_Msg_N
("operator& not defined for}", N
);
6644 if Nkind
(N
) in N_Binary_Op
then
6645 if not Is_Overloaded
(L
)
6646 and then not Is_Overloaded
(R
)
6647 and then Base_Type
(Etype
(L
)) = Base_Type
(Etype
(R
))
6649 Error_Msg_Node_2
:= First_Subtype
(Etype
(R
));
6650 Error_Msg_N
("there is no applicable operator& for}", N
);
6653 -- Another attempt to find a fix: one of the candidate
6654 -- interpretations may not be use-visible. This has
6655 -- already been checked for predefined operators, so
6656 -- we examine only user-defined functions.
6658 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
6660 while Present
(Op_Id
) loop
6661 if Ekind
(Op_Id
) /= E_Operator
6662 and then Is_Overloadable
(Op_Id
)
6664 if not Is_Immediately_Visible
(Op_Id
)
6665 and then not In_Use
(Scope
(Op_Id
))
6666 and then not Is_Abstract_Subprogram
(Op_Id
)
6667 and then not Is_Hidden
(Op_Id
)
6668 and then Ekind
(Scope
(Op_Id
)) = E_Package
6671 (L
, Etype
(First_Formal
(Op_Id
)))
6673 (Next_Formal
(First_Formal
(Op_Id
)))
6677 Etype
(Next_Formal
(First_Formal
(Op_Id
))))
6680 ("No legal interpretation for operator&", N
);
6682 ("\use clause on& would make operation legal",
6688 Op_Id
:= Homonym
(Op_Id
);
6692 Error_Msg_N
("invalid operand types for operator&", N
);
6694 if Nkind
(N
) /= N_Op_Concat
then
6695 Error_Msg_NE
("\left operand has}!", N
, Etype
(L
));
6696 Error_Msg_NE
("\right operand has}!", N
, Etype
(R
));
6698 -- For concatenation operators it is more difficult to
6699 -- determine which is the wrong operand. It is worth
6700 -- flagging explicitly an access type, for those who
6701 -- might think that a dereference happens here.
6703 elsif Is_Access_Type
(Etype
(L
)) then
6704 Error_Msg_N
("\left operand is access type", N
);
6706 elsif Is_Access_Type
(Etype
(R
)) then
6707 Error_Msg_N
("\right operand is access type", N
);
6717 -----------------------------------------
6718 -- Process_Implicit_Dereference_Prefix --
6719 -----------------------------------------
6721 function Process_Implicit_Dereference_Prefix
6723 P
: Entity_Id
) return Entity_Id
6726 Typ
: constant Entity_Id
:= Designated_Type
(Etype
(P
));
6730 and then (Operating_Mode
= Check_Semantics
or else not Expander_Active
)
6732 -- We create a dummy reference to E to ensure that the reference is
6733 -- not considered as part of an assignment (an implicit dereference
6734 -- can never assign to its prefix). The Comes_From_Source attribute
6735 -- needs to be propagated for accurate warnings.
6737 Ref
:= New_Occurrence_Of
(E
, Sloc
(P
));
6738 Set_Comes_From_Source
(Ref
, Comes_From_Source
(P
));
6739 Generate_Reference
(E
, Ref
);
6742 -- An implicit dereference is a legal occurrence of an incomplete type
6743 -- imported through a limited_with clause, if the full view is visible.
6745 if From_Limited_With
(Typ
)
6746 and then not From_Limited_With
(Scope
(Typ
))
6748 (Is_Immediately_Visible
(Scope
(Typ
))
6750 (Is_Child_Unit
(Scope
(Typ
))
6751 and then Is_Visible_Lib_Unit
(Scope
(Typ
))))
6753 return Available_View
(Typ
);
6757 end Process_Implicit_Dereference_Prefix
;
6759 --------------------------------
6760 -- Remove_Abstract_Operations --
6761 --------------------------------
6763 procedure Remove_Abstract_Operations
(N
: Node_Id
) is
6764 Abstract_Op
: Entity_Id
:= Empty
;
6765 Address_Descendent
: Boolean := False;
6769 -- AI-310: If overloaded, remove abstract non-dispatching operations. We
6770 -- activate this if either extensions are enabled, or if the abstract
6771 -- operation in question comes from a predefined file. This latter test
6772 -- allows us to use abstract to make operations invisible to users. In
6773 -- particular, if type Address is non-private and abstract subprograms
6774 -- are used to hide its operators, they will be truly hidden.
6776 type Operand_Position
is (First_Op
, Second_Op
);
6777 Univ_Type
: constant Entity_Id
:= Universal_Interpretation
(N
);
6779 procedure Remove_Address_Interpretations
(Op
: Operand_Position
);
6780 -- Ambiguities may arise when the operands are literal and the address
6781 -- operations in s-auxdec are visible. In that case, remove the
6782 -- interpretation of a literal as Address, to retain the semantics
6783 -- of Address as a private type.
6785 ------------------------------------
6786 -- Remove_Address_Interpretations --
6787 ------------------------------------
6789 procedure Remove_Address_Interpretations
(Op
: Operand_Position
) is
6793 if Is_Overloaded
(N
) then
6794 Get_First_Interp
(N
, I
, It
);
6795 while Present
(It
.Nam
) loop
6796 Formal
:= First_Entity
(It
.Nam
);
6798 if Op
= Second_Op
then
6799 Formal
:= Next_Entity
(Formal
);
6802 if Is_Descendent_Of_Address
(Etype
(Formal
)) then
6803 Address_Descendent
:= True;
6807 Get_Next_Interp
(I
, It
);
6810 end Remove_Address_Interpretations
;
6812 -- Start of processing for Remove_Abstract_Operations
6815 if Is_Overloaded
(N
) then
6816 if Debug_Flag_V
then
6817 Write_Str
("Remove_Abstract_Operations: ");
6818 Write_Overloads
(N
);
6821 Get_First_Interp
(N
, I
, It
);
6823 while Present
(It
.Nam
) loop
6824 if Is_Overloadable
(It
.Nam
)
6825 and then Is_Abstract_Subprogram
(It
.Nam
)
6826 and then not Is_Dispatching_Operation
(It
.Nam
)
6828 Abstract_Op
:= It
.Nam
;
6830 if Is_Descendent_Of_Address
(It
.Typ
) then
6831 Address_Descendent
:= True;
6835 -- In Ada 2005, this operation does not participate in overload
6836 -- resolution. If the operation is defined in a predefined
6837 -- unit, it is one of the operations declared abstract in some
6838 -- variants of System, and it must be removed as well.
6840 elsif Ada_Version
>= Ada_2005
6841 or else Is_Predefined_File_Name
6842 (Unit_File_Name
(Get_Source_Unit
(It
.Nam
)))
6849 Get_Next_Interp
(I
, It
);
6852 if No
(Abstract_Op
) then
6854 -- If some interpretation yields an integer type, it is still
6855 -- possible that there are address interpretations. Remove them
6856 -- if one operand is a literal, to avoid spurious ambiguities
6857 -- on systems where Address is a visible integer type.
6859 if Is_Overloaded
(N
)
6860 and then Nkind
(N
) in N_Op
6861 and then Is_Integer_Type
(Etype
(N
))
6863 if Nkind
(N
) in N_Binary_Op
then
6864 if Nkind
(Right_Opnd
(N
)) = N_Integer_Literal
then
6865 Remove_Address_Interpretations
(Second_Op
);
6867 elsif Nkind
(Right_Opnd
(N
)) = N_Integer_Literal
then
6868 Remove_Address_Interpretations
(First_Op
);
6873 elsif Nkind
(N
) in N_Op
then
6875 -- Remove interpretations that treat literals as addresses. This
6876 -- is never appropriate, even when Address is defined as a visible
6877 -- Integer type. The reason is that we would really prefer Address
6878 -- to behave as a private type, even in this case. If Address is a
6879 -- visible integer type, we get lots of overload ambiguities.
6881 if Nkind
(N
) in N_Binary_Op
then
6883 U1
: constant Boolean :=
6884 Present
(Universal_Interpretation
(Right_Opnd
(N
)));
6885 U2
: constant Boolean :=
6886 Present
(Universal_Interpretation
(Left_Opnd
(N
)));
6890 Remove_Address_Interpretations
(Second_Op
);
6894 Remove_Address_Interpretations
(First_Op
);
6897 if not (U1
and U2
) then
6899 -- Remove corresponding predefined operator, which is
6900 -- always added to the overload set.
6902 Get_First_Interp
(N
, I
, It
);
6903 while Present
(It
.Nam
) loop
6904 if Scope
(It
.Nam
) = Standard_Standard
6905 and then Base_Type
(It
.Typ
) =
6906 Base_Type
(Etype
(Abstract_Op
))
6911 Get_Next_Interp
(I
, It
);
6914 elsif Is_Overloaded
(N
)
6915 and then Present
(Univ_Type
)
6917 -- If both operands have a universal interpretation,
6918 -- it is still necessary to remove interpretations that
6919 -- yield Address. Any remaining ambiguities will be
6920 -- removed in Disambiguate.
6922 Get_First_Interp
(N
, I
, It
);
6923 while Present
(It
.Nam
) loop
6924 if Is_Descendent_Of_Address
(It
.Typ
) then
6927 elsif not Is_Type
(It
.Nam
) then
6928 Set_Entity
(N
, It
.Nam
);
6931 Get_Next_Interp
(I
, It
);
6937 elsif Nkind
(N
) = N_Function_Call
6939 (Nkind
(Name
(N
)) = N_Operator_Symbol
6941 (Nkind
(Name
(N
)) = N_Expanded_Name
6943 Nkind
(Selector_Name
(Name
(N
))) = N_Operator_Symbol
))
6947 Arg1
: constant Node_Id
:= First
(Parameter_Associations
(N
));
6948 U1
: constant Boolean :=
6949 Present
(Universal_Interpretation
(Arg1
));
6950 U2
: constant Boolean :=
6951 Present
(Next
(Arg1
)) and then
6952 Present
(Universal_Interpretation
(Next
(Arg1
)));
6956 Remove_Address_Interpretations
(First_Op
);
6960 Remove_Address_Interpretations
(Second_Op
);
6963 if not (U1
and U2
) then
6964 Get_First_Interp
(N
, I
, It
);
6965 while Present
(It
.Nam
) loop
6966 if Scope
(It
.Nam
) = Standard_Standard
6967 and then It
.Typ
= Base_Type
(Etype
(Abstract_Op
))
6972 Get_Next_Interp
(I
, It
);
6978 -- If the removal has left no valid interpretations, emit an error
6979 -- message now and label node as illegal.
6981 if Present
(Abstract_Op
) then
6982 Get_First_Interp
(N
, I
, It
);
6986 -- Removal of abstract operation left no viable candidate
6988 Set_Etype
(N
, Any_Type
);
6989 Error_Msg_Sloc
:= Sloc
(Abstract_Op
);
6991 ("cannot call abstract operation& declared#", N
, Abstract_Op
);
6993 -- In Ada 2005, an abstract operation may disable predefined
6994 -- operators. Since the context is not yet known, we mark the
6995 -- predefined operators as potentially hidden. Do not include
6996 -- predefined operators when addresses are involved since this
6997 -- case is handled separately.
6999 elsif Ada_Version
>= Ada_2005
and then not Address_Descendent
then
7000 while Present
(It
.Nam
) loop
7001 if Is_Numeric_Type
(It
.Typ
)
7002 and then Scope
(It
.Typ
) = Standard_Standard
7004 Set_Abstract_Op
(I
, Abstract_Op
);
7007 Get_Next_Interp
(I
, It
);
7012 if Debug_Flag_V
then
7013 Write_Str
("Remove_Abstract_Operations done: ");
7014 Write_Overloads
(N
);
7017 end Remove_Abstract_Operations
;
7019 ----------------------------
7020 -- Try_Container_Indexing --
7021 ----------------------------
7023 function Try_Container_Indexing
7026 Exprs
: List_Id
) return Boolean
7028 Loc
: constant Source_Ptr
:= Sloc
(N
);
7033 Func_Name
: Node_Id
;
7037 C_Type
:= Etype
(Prefix
);
7039 -- If indexing a class-wide container, obtain indexing primitive
7040 -- from specific type.
7042 if Is_Class_Wide_Type
(C_Type
) then
7043 C_Type
:= Etype
(Base_Type
(C_Type
));
7046 -- Check whether type has a specified indexing aspect
7050 if Is_Variable
(Prefix
) then
7052 Find_Value_Of_Aspect
(Etype
(Prefix
), Aspect_Variable_Indexing
);
7055 if No
(Func_Name
) then
7057 Find_Value_Of_Aspect
(Etype
(Prefix
), Aspect_Constant_Indexing
);
7060 -- If aspect does not exist the expression is illegal. Error is
7061 -- diagnosed in caller.
7063 if No
(Func_Name
) then
7065 -- The prefix itself may be an indexing of a container: rewrite
7066 -- as such and re-analyze.
7068 if Has_Implicit_Dereference
(Etype
(Prefix
)) then
7069 Build_Explicit_Dereference
7070 (Prefix
, First_Discriminant
(Etype
(Prefix
)));
7071 return Try_Container_Indexing
(N
, Prefix
, Exprs
);
7077 -- If the container type is derived from another container type, the
7078 -- value of the inherited aspect is the Reference operation declared
7079 -- for the parent type.
7081 -- However, Reference is also a primitive operation of the type, and
7082 -- the inherited operation has a different signature. We retrieve the
7083 -- right one from the list of primitive operations of the derived type.
7085 -- Note that predefined containers are typically all derived from one
7086 -- of the Controlled types. The code below is motivated by containers
7087 -- that are derived from other types with a Reference aspect.
7089 -- Additional machinery may be needed for types that have several user-
7090 -- defined Reference operations with different signatures ???
7092 elsif Is_Derived_Type
(C_Type
)
7093 and then Etype
(First_Formal
(Entity
(Func_Name
))) /= Etype
(Prefix
)
7095 Func
:= Find_Prim_Op
(C_Type
, Chars
(Func_Name
));
7096 Func_Name
:= New_Occurrence_Of
(Func
, Loc
);
7099 Assoc
:= New_List
(Relocate_Node
(Prefix
));
7101 -- A generalized indexing may have nore than one index expression, so
7102 -- transfer all of them to the argument list to be used in the call.
7103 -- Note that there may be named associations, in which case the node
7104 -- was rewritten earlier as a call, and has been transformed back into
7105 -- an indexed expression to share the following processing.
7107 -- The generalized indexing node is the one on which analysis and
7108 -- resolution take place. Before expansion the original node is replaced
7109 -- with the generalized indexing node, which is a call, possibly with
7110 -- a dereference operation.
7112 if Comes_From_Source
(N
) then
7113 Check_Compiler_Unit
("generalized indexing", N
);
7119 Arg
:= First
(Exprs
);
7120 while Present
(Arg
) loop
7121 Append
(Relocate_Node
(Arg
), Assoc
);
7126 if not Is_Overloaded
(Func_Name
) then
7127 Func
:= Entity
(Func_Name
);
7129 Make_Function_Call
(Loc
,
7130 Name
=> New_Occurrence_Of
(Func
, Loc
),
7131 Parameter_Associations
=> Assoc
);
7132 Set_Parent
(Indexing
, Parent
(N
));
7133 Set_Generalized_Indexing
(N
, Indexing
);
7135 Set_Etype
(N
, Etype
(Indexing
));
7137 -- If the return type of the indexing function is a reference type,
7138 -- add the dereference as a possible interpretation. Note that the
7139 -- indexing aspect may be a function that returns the element type
7140 -- with no intervening implicit dereference, and that the reference
7141 -- discriminant is not the first discriminant.
7143 if Has_Discriminants
(Etype
(Func
)) then
7144 Disc
:= First_Discriminant
(Etype
(Func
));
7145 while Present
(Disc
) loop
7147 Elmt_Type
: Entity_Id
;
7149 if Has_Implicit_Dereference
(Disc
) then
7150 Elmt_Type
:= Designated_Type
(Etype
(Disc
));
7151 Add_One_Interp
(Indexing
, Disc
, Elmt_Type
);
7152 Add_One_Interp
(N
, Disc
, Elmt_Type
);
7157 Next_Discriminant
(Disc
);
7163 Make_Function_Call
(Loc
,
7164 Name
=> Make_Identifier
(Loc
, Chars
(Func_Name
)),
7165 Parameter_Associations
=> Assoc
);
7167 Set_Parent
(Indexing
, Parent
(N
));
7168 Set_Generalized_Indexing
(N
, Indexing
);
7176 Get_First_Interp
(Func_Name
, I
, It
);
7177 Set_Etype
(Indexing
, Any_Type
);
7178 while Present
(It
.Nam
) loop
7179 Analyze_One_Call
(Indexing
, It
.Nam
, False, Success
);
7182 Set_Etype
(Name
(Indexing
), It
.Typ
);
7183 Set_Entity
(Name
(Indexing
), It
.Nam
);
7184 Set_Etype
(N
, Etype
(Indexing
));
7186 -- Add implicit dereference interpretation
7188 if Has_Discriminants
(Etype
(It
.Nam
)) then
7189 Disc
:= First_Discriminant
(Etype
(It
.Nam
));
7190 while Present
(Disc
) loop
7191 if Has_Implicit_Dereference
(Disc
) then
7193 (Indexing
, Disc
, Designated_Type
(Etype
(Disc
)));
7195 (N
, Disc
, Designated_Type
(Etype
(Disc
)));
7199 Next_Discriminant
(Disc
);
7206 Get_Next_Interp
(I
, It
);
7211 if Etype
(Indexing
) = Any_Type
then
7213 ("container cannot be indexed with&", N
, Etype
(First
(Exprs
)));
7214 Rewrite
(N
, New_Occurrence_Of
(Any_Id
, Loc
));
7218 end Try_Container_Indexing
;
7220 -----------------------
7221 -- Try_Indirect_Call --
7222 -----------------------
7224 function Try_Indirect_Call
7227 Typ
: Entity_Id
) return Boolean
7233 pragma Warnings
(Off
, Call_OK
);
7236 Normalize_Actuals
(N
, Designated_Type
(Typ
), False, Call_OK
);
7238 Actual
:= First_Actual
(N
);
7239 Formal
:= First_Formal
(Designated_Type
(Typ
));
7240 while Present
(Actual
) and then Present
(Formal
) loop
7241 if not Has_Compatible_Type
(Actual
, Etype
(Formal
)) then
7246 Next_Formal
(Formal
);
7249 if No
(Actual
) and then No
(Formal
) then
7250 Add_One_Interp
(N
, Nam
, Etype
(Designated_Type
(Typ
)));
7252 -- Nam is a candidate interpretation for the name in the call,
7253 -- if it is not an indirect call.
7255 if not Is_Type
(Nam
)
7256 and then Is_Entity_Name
(Name
(N
))
7258 Set_Entity
(Name
(N
), Nam
);
7266 end Try_Indirect_Call
;
7268 ----------------------
7269 -- Try_Indexed_Call --
7270 ----------------------
7272 function Try_Indexed_Call
7276 Skip_First
: Boolean) return Boolean
7278 Loc
: constant Source_Ptr
:= Sloc
(N
);
7279 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
7284 Actual
:= First
(Actuals
);
7286 -- If the call was originally written in prefix form, skip the first
7287 -- actual, which is obviously not defaulted.
7293 Index
:= First_Index
(Typ
);
7294 while Present
(Actual
) and then Present
(Index
) loop
7296 -- If the parameter list has a named association, the expression
7297 -- is definitely a call and not an indexed component.
7299 if Nkind
(Actual
) = N_Parameter_Association
then
7303 if Is_Entity_Name
(Actual
)
7304 and then Is_Type
(Entity
(Actual
))
7305 and then No
(Next
(Actual
))
7307 -- A single actual that is a type name indicates a slice if the
7308 -- type is discrete, and an error otherwise.
7310 if Is_Discrete_Type
(Entity
(Actual
)) then
7314 Make_Function_Call
(Loc
,
7315 Name
=> Relocate_Node
(Name
(N
))),
7317 New_Occurrence_Of
(Entity
(Actual
), Sloc
(Actual
))));
7322 Error_Msg_N
("invalid use of type in expression", Actual
);
7323 Set_Etype
(N
, Any_Type
);
7328 elsif not Has_Compatible_Type
(Actual
, Etype
(Index
)) then
7336 if No
(Actual
) and then No
(Index
) then
7337 Add_One_Interp
(N
, Nam
, Component_Type
(Typ
));
7339 -- Nam is a candidate interpretation for the name in the call,
7340 -- if it is not an indirect call.
7342 if not Is_Type
(Nam
)
7343 and then Is_Entity_Name
(Name
(N
))
7345 Set_Entity
(Name
(N
), Nam
);
7352 end Try_Indexed_Call
;
7354 --------------------------
7355 -- Try_Object_Operation --
7356 --------------------------
7358 function Try_Object_Operation
7359 (N
: Node_Id
; CW_Test_Only
: Boolean := False) return Boolean
7361 K
: constant Node_Kind
:= Nkind
(Parent
(N
));
7362 Is_Subprg_Call
: constant Boolean := K
in N_Subprogram_Call
;
7363 Loc
: constant Source_Ptr
:= Sloc
(N
);
7364 Obj
: constant Node_Id
:= Prefix
(N
);
7366 Subprog
: constant Node_Id
:=
7367 Make_Identifier
(Sloc
(Selector_Name
(N
)),
7368 Chars
=> Chars
(Selector_Name
(N
)));
7369 -- Identifier on which possible interpretations will be collected
7371 Report_Error
: Boolean := False;
7372 -- If no candidate interpretation matches the context, redo analysis
7373 -- with Report_Error True to provide additional information.
7376 Candidate
: Entity_Id
:= Empty
;
7377 New_Call_Node
: Node_Id
:= Empty
;
7378 Node_To_Replace
: Node_Id
;
7379 Obj_Type
: Entity_Id
:= Etype
(Obj
);
7380 Success
: Boolean := False;
7382 function Valid_Candidate
7385 Subp
: Entity_Id
) return Entity_Id
;
7386 -- If the subprogram is a valid interpretation, record it, and add
7387 -- to the list of interpretations of Subprog. Otherwise return Empty.
7389 procedure Complete_Object_Operation
7390 (Call_Node
: Node_Id
;
7391 Node_To_Replace
: Node_Id
);
7392 -- Make Subprog the name of Call_Node, replace Node_To_Replace with
7393 -- Call_Node, insert the object (or its dereference) as the first actual
7394 -- in the call, and complete the analysis of the call.
7396 procedure Report_Ambiguity
(Op
: Entity_Id
);
7397 -- If a prefixed procedure call is ambiguous, indicate whether the
7398 -- call includes an implicit dereference or an implicit 'Access.
7400 procedure Transform_Object_Operation
7401 (Call_Node
: out Node_Id
;
7402 Node_To_Replace
: out Node_Id
);
7403 -- Transform Obj.Operation (X, Y,,) into Operation (Obj, X, Y ..)
7404 -- Call_Node is the resulting subprogram call, Node_To_Replace is
7405 -- either N or the parent of N, and Subprog is a reference to the
7406 -- subprogram we are trying to match.
7408 function Try_Class_Wide_Operation
7409 (Call_Node
: Node_Id
;
7410 Node_To_Replace
: Node_Id
) return Boolean;
7411 -- Traverse all ancestor types looking for a class-wide subprogram
7412 -- for which the current operation is a valid non-dispatching call.
7414 procedure Try_One_Prefix_Interpretation
(T
: Entity_Id
);
7415 -- If prefix is overloaded, its interpretation may include different
7416 -- tagged types, and we must examine the primitive operations and
7417 -- the class-wide operations of each in order to find candidate
7418 -- interpretations for the call as a whole.
7420 function Try_Primitive_Operation
7421 (Call_Node
: Node_Id
;
7422 Node_To_Replace
: Node_Id
) return Boolean;
7423 -- Traverse the list of primitive subprograms looking for a dispatching
7424 -- operation for which the current node is a valid call .
7426 ---------------------
7427 -- Valid_Candidate --
7428 ---------------------
7430 function Valid_Candidate
7433 Subp
: Entity_Id
) return Entity_Id
7435 Arr_Type
: Entity_Id
;
7436 Comp_Type
: Entity_Id
;
7439 -- If the subprogram is a valid interpretation, record it in global
7440 -- variable Subprog, to collect all possible overloadings.
7443 if Subp
/= Entity
(Subprog
) then
7444 Add_One_Interp
(Subprog
, Subp
, Etype
(Subp
));
7448 -- If the call may be an indexed call, retrieve component type of
7449 -- resulting expression, and add possible interpretation.
7454 if Nkind
(Call
) = N_Function_Call
7455 and then Nkind
(Parent
(N
)) = N_Indexed_Component
7456 and then Needs_One_Actual
(Subp
)
7458 if Is_Array_Type
(Etype
(Subp
)) then
7459 Arr_Type
:= Etype
(Subp
);
7461 elsif Is_Access_Type
(Etype
(Subp
))
7462 and then Is_Array_Type
(Designated_Type
(Etype
(Subp
)))
7464 Arr_Type
:= Designated_Type
(Etype
(Subp
));
7468 if Present
(Arr_Type
) then
7470 -- Verify that the actuals (excluding the object) match the types
7478 Actual
:= Next
(First_Actual
(Call
));
7479 Index
:= First_Index
(Arr_Type
);
7480 while Present
(Actual
) and then Present
(Index
) loop
7481 if not Has_Compatible_Type
(Actual
, Etype
(Index
)) then
7486 Next_Actual
(Actual
);
7492 and then Present
(Arr_Type
)
7494 Comp_Type
:= Component_Type
(Arr_Type
);
7498 if Present
(Comp_Type
)
7499 and then Etype
(Subprog
) /= Comp_Type
7501 Add_One_Interp
(Subprog
, Subp
, Comp_Type
);
7505 if Etype
(Call
) /= Any_Type
then
7510 end Valid_Candidate
;
7512 -------------------------------
7513 -- Complete_Object_Operation --
7514 -------------------------------
7516 procedure Complete_Object_Operation
7517 (Call_Node
: Node_Id
;
7518 Node_To_Replace
: Node_Id
)
7520 Control
: constant Entity_Id
:= First_Formal
(Entity
(Subprog
));
7521 Formal_Type
: constant Entity_Id
:= Etype
(Control
);
7522 First_Actual
: Node_Id
;
7525 -- Place the name of the operation, with its interpretations,
7526 -- on the rewritten call.
7528 Set_Name
(Call_Node
, Subprog
);
7530 First_Actual
:= First
(Parameter_Associations
(Call_Node
));
7532 -- For cross-reference purposes, treat the new node as being in the
7533 -- source if the original one is. Set entity and type, even though
7534 -- they may be overwritten during resolution if overloaded.
7536 Set_Comes_From_Source
(Subprog
, Comes_From_Source
(N
));
7537 Set_Comes_From_Source
(Call_Node
, Comes_From_Source
(N
));
7539 if Nkind
(N
) = N_Selected_Component
7540 and then not Inside_A_Generic
7542 Set_Entity
(Selector_Name
(N
), Entity
(Subprog
));
7543 Set_Etype
(Selector_Name
(N
), Etype
(Entity
(Subprog
)));
7546 -- If need be, rewrite first actual as an explicit dereference. If
7547 -- the call is overloaded, the rewriting can only be done once the
7548 -- primitive operation is identified.
7550 if Is_Overloaded
(Subprog
) then
7552 -- The prefix itself may be overloaded, and its interpretations
7553 -- must be propagated to the new actual in the call.
7555 if Is_Overloaded
(Obj
) then
7556 Save_Interps
(Obj
, First_Actual
);
7559 Rewrite
(First_Actual
, Obj
);
7561 elsif not Is_Access_Type
(Formal_Type
)
7562 and then Is_Access_Type
(Etype
(Obj
))
7564 Rewrite
(First_Actual
,
7565 Make_Explicit_Dereference
(Sloc
(Obj
), Obj
));
7566 Analyze
(First_Actual
);
7568 -- If we need to introduce an explicit dereference, verify that
7569 -- the resulting actual is compatible with the mode of the formal.
7571 if Ekind
(First_Formal
(Entity
(Subprog
))) /= E_In_Parameter
7572 and then Is_Access_Constant
(Etype
(Obj
))
7575 ("expect variable in call to&", Prefix
(N
), Entity
(Subprog
));
7578 -- Conversely, if the formal is an access parameter and the object
7579 -- is not, replace the actual with a 'Access reference. Its analysis
7580 -- will check that the object is aliased.
7582 elsif Is_Access_Type
(Formal_Type
)
7583 and then not Is_Access_Type
(Etype
(Obj
))
7585 -- A special case: A.all'access is illegal if A is an access to a
7586 -- constant and the context requires an access to a variable.
7588 if not Is_Access_Constant
(Formal_Type
) then
7589 if (Nkind
(Obj
) = N_Explicit_Dereference
7590 and then Is_Access_Constant
(Etype
(Prefix
(Obj
))))
7591 or else not Is_Variable
(Obj
)
7594 ("actual for& must be a variable", Obj
, Control
);
7598 Rewrite
(First_Actual
,
7599 Make_Attribute_Reference
(Loc
,
7600 Attribute_Name
=> Name_Access
,
7601 Prefix
=> Relocate_Node
(Obj
)));
7603 if not Is_Aliased_View
(Obj
) then
7605 ("object in prefixed call to& must be aliased"
7606 & " (RM-2005 4.3.1 (13))",
7607 Prefix
(First_Actual
), Subprog
);
7610 Analyze
(First_Actual
);
7613 if Is_Overloaded
(Obj
) then
7614 Save_Interps
(Obj
, First_Actual
);
7617 Rewrite
(First_Actual
, Obj
);
7620 Rewrite
(Node_To_Replace
, Call_Node
);
7622 -- Propagate the interpretations collected in subprog to the new
7623 -- function call node, to be resolved from context.
7625 if Is_Overloaded
(Subprog
) then
7626 Save_Interps
(Subprog
, Node_To_Replace
);
7629 -- The type of the subprogram may be a limited view obtained
7630 -- transitively from another unit. If full view is available,
7631 -- use it to analyze call.
7634 T
: constant Entity_Id
:= Etype
(Subprog
);
7636 if From_Limited_With
(T
) then
7637 Set_Etype
(Entity
(Subprog
), Available_View
(T
));
7641 Analyze
(Node_To_Replace
);
7643 -- If the operation has been rewritten into a call, which may get
7644 -- subsequently an explicit dereference, preserve the type on the
7645 -- original node (selected component or indexed component) for
7646 -- subsequent legality tests, e.g. Is_Variable. which examines
7647 -- the original node.
7649 if Nkind
(Node_To_Replace
) = N_Function_Call
then
7651 (Original_Node
(Node_To_Replace
), Etype
(Node_To_Replace
));
7654 end Complete_Object_Operation
;
7656 ----------------------
7657 -- Report_Ambiguity --
7658 ----------------------
7660 procedure Report_Ambiguity
(Op
: Entity_Id
) is
7661 Access_Actual
: constant Boolean :=
7662 Is_Access_Type
(Etype
(Prefix
(N
)));
7663 Access_Formal
: Boolean := False;
7666 Error_Msg_Sloc
:= Sloc
(Op
);
7668 if Present
(First_Formal
(Op
)) then
7669 Access_Formal
:= Is_Access_Type
(Etype
(First_Formal
(Op
)));
7672 if Access_Formal
and then not Access_Actual
then
7673 if Nkind
(Parent
(Op
)) = N_Full_Type_Declaration
then
7675 ("\possible interpretation "
7676 & "(inherited, with implicit 'Access) #", N
);
7679 ("\possible interpretation (with implicit 'Access) #", N
);
7682 elsif not Access_Formal
and then Access_Actual
then
7683 if Nkind
(Parent
(Op
)) = N_Full_Type_Declaration
then
7685 ("\possible interpretation "
7686 & "(inherited, with implicit dereference) #", N
);
7689 ("\possible interpretation (with implicit dereference) #", N
);
7693 if Nkind
(Parent
(Op
)) = N_Full_Type_Declaration
then
7694 Error_Msg_N
("\possible interpretation (inherited)#", N
);
7696 Error_Msg_N
-- CODEFIX
7697 ("\possible interpretation#", N
);
7700 end Report_Ambiguity
;
7702 --------------------------------
7703 -- Transform_Object_Operation --
7704 --------------------------------
7706 procedure Transform_Object_Operation
7707 (Call_Node
: out Node_Id
;
7708 Node_To_Replace
: out Node_Id
)
7710 Dummy
: constant Node_Id
:= New_Copy
(Obj
);
7711 -- Placeholder used as a first parameter in the call, replaced
7712 -- eventually by the proper object.
7714 Parent_Node
: constant Node_Id
:= Parent
(N
);
7720 -- Common case covering 1) Call to a procedure and 2) Call to a
7721 -- function that has some additional actuals.
7723 if Nkind
(Parent_Node
) in N_Subprogram_Call
7725 -- N is a selected component node containing the name of the
7726 -- subprogram. If N is not the name of the parent node we must
7727 -- not replace the parent node by the new construct. This case
7728 -- occurs when N is a parameterless call to a subprogram that
7729 -- is an actual parameter of a call to another subprogram. For
7731 -- Some_Subprogram (..., Obj.Operation, ...)
7733 and then Name
(Parent_Node
) = N
7735 Node_To_Replace
:= Parent_Node
;
7737 Actuals
:= Parameter_Associations
(Parent_Node
);
7739 if Present
(Actuals
) then
7740 Prepend
(Dummy
, Actuals
);
7742 Actuals
:= New_List
(Dummy
);
7745 if Nkind
(Parent_Node
) = N_Procedure_Call_Statement
then
7747 Make_Procedure_Call_Statement
(Loc
,
7748 Name
=> New_Copy
(Subprog
),
7749 Parameter_Associations
=> Actuals
);
7753 Make_Function_Call
(Loc
,
7754 Name
=> New_Copy
(Subprog
),
7755 Parameter_Associations
=> Actuals
);
7758 -- Before analysis, a function call appears as an indexed component
7759 -- if there are no named associations.
7761 elsif Nkind
(Parent_Node
) = N_Indexed_Component
7762 and then N
= Prefix
(Parent_Node
)
7764 Node_To_Replace
:= Parent_Node
;
7765 Actuals
:= Expressions
(Parent_Node
);
7767 Actual
:= First
(Actuals
);
7768 while Present
(Actual
) loop
7773 Prepend
(Dummy
, Actuals
);
7776 Make_Function_Call
(Loc
,
7777 Name
=> New_Copy
(Subprog
),
7778 Parameter_Associations
=> Actuals
);
7780 -- Parameterless call: Obj.F is rewritten as F (Obj)
7783 Node_To_Replace
:= N
;
7786 Make_Function_Call
(Loc
,
7787 Name
=> New_Copy
(Subprog
),
7788 Parameter_Associations
=> New_List
(Dummy
));
7790 end Transform_Object_Operation
;
7792 ------------------------------
7793 -- Try_Class_Wide_Operation --
7794 ------------------------------
7796 function Try_Class_Wide_Operation
7797 (Call_Node
: Node_Id
;
7798 Node_To_Replace
: Node_Id
) return Boolean
7800 Anc_Type
: Entity_Id
;
7801 Matching_Op
: Entity_Id
:= Empty
;
7804 procedure Traverse_Homonyms
7805 (Anc_Type
: Entity_Id
;
7806 Error
: out Boolean);
7807 -- Traverse the homonym chain of the subprogram searching for those
7808 -- homonyms whose first formal has the Anc_Type's class-wide type,
7809 -- or an anonymous access type designating the class-wide type. If
7810 -- an ambiguity is detected, then Error is set to True.
7812 procedure Traverse_Interfaces
7813 (Anc_Type
: Entity_Id
;
7814 Error
: out Boolean);
7815 -- Traverse the list of interfaces, if any, associated with Anc_Type
7816 -- and search for acceptable class-wide homonyms associated with each
7817 -- interface. If an ambiguity is detected, then Error is set to True.
7819 -----------------------
7820 -- Traverse_Homonyms --
7821 -----------------------
7823 procedure Traverse_Homonyms
7824 (Anc_Type
: Entity_Id
;
7825 Error
: out Boolean)
7827 Cls_Type
: Entity_Id
;
7835 Cls_Type
:= Class_Wide_Type
(Anc_Type
);
7837 Hom
:= Current_Entity
(Subprog
);
7839 -- Find a non-hidden operation whose first parameter is of the
7840 -- class-wide type, a subtype thereof, or an anonymous access
7841 -- to same. If in an instance, the operation can be considered
7842 -- even if hidden (it may be hidden because the instantiation
7843 -- is expanded after the containing package has been analyzed).
7845 while Present
(Hom
) loop
7846 if Ekind_In
(Hom
, E_Procedure
, E_Function
)
7847 and then (not Is_Hidden
(Hom
) or else In_Instance
)
7848 and then Scope
(Hom
) = Scope
(Anc_Type
)
7849 and then Present
(First_Formal
(Hom
))
7851 (Base_Type
(Etype
(First_Formal
(Hom
))) = Cls_Type
7853 (Is_Access_Type
(Etype
(First_Formal
(Hom
)))
7855 Ekind
(Etype
(First_Formal
(Hom
))) =
7856 E_Anonymous_Access_Type
7859 (Designated_Type
(Etype
(First_Formal
(Hom
)))) =
7862 -- If the context is a procedure call, ignore functions
7863 -- in the name of the call.
7865 if Ekind
(Hom
) = E_Function
7866 and then Nkind
(Parent
(N
)) = N_Procedure_Call_Statement
7867 and then N
= Name
(Parent
(N
))
7871 -- If the context is a function call, ignore procedures
7872 -- in the name of the call.
7874 elsif Ekind
(Hom
) = E_Procedure
7875 and then Nkind
(Parent
(N
)) /= N_Procedure_Call_Statement
7880 Set_Etype
(Call_Node
, Any_Type
);
7881 Set_Is_Overloaded
(Call_Node
, False);
7884 if No
(Matching_Op
) then
7885 Hom_Ref
:= New_Occurrence_Of
(Hom
, Sloc
(Subprog
));
7886 Set_Etype
(Call_Node
, Any_Type
);
7887 Set_Parent
(Call_Node
, Parent
(Node_To_Replace
));
7889 Set_Name
(Call_Node
, Hom_Ref
);
7894 Report
=> Report_Error
,
7896 Skip_First
=> True);
7899 Valid_Candidate
(Success
, Call_Node
, Hom
);
7905 Report
=> Report_Error
,
7907 Skip_First
=> True);
7909 if Present
(Valid_Candidate
(Success
, Call_Node
, Hom
))
7910 and then Nkind
(Call_Node
) /= N_Function_Call
7912 Error_Msg_NE
("ambiguous call to&", N
, Hom
);
7913 Report_Ambiguity
(Matching_Op
);
7914 Report_Ambiguity
(Hom
);
7922 Hom
:= Homonym
(Hom
);
7924 end Traverse_Homonyms
;
7926 -------------------------
7927 -- Traverse_Interfaces --
7928 -------------------------
7930 procedure Traverse_Interfaces
7931 (Anc_Type
: Entity_Id
;
7932 Error
: out Boolean)
7934 Intface_List
: constant List_Id
:=
7935 Abstract_Interface_List
(Anc_Type
);
7941 if Is_Non_Empty_List
(Intface_List
) then
7942 Intface
:= First
(Intface_List
);
7943 while Present
(Intface
) loop
7945 -- Look for acceptable class-wide homonyms associated with
7948 Traverse_Homonyms
(Etype
(Intface
), Error
);
7954 -- Continue the search by looking at each of the interface's
7955 -- associated interface ancestors.
7957 Traverse_Interfaces
(Etype
(Intface
), Error
);
7966 end Traverse_Interfaces
;
7968 -- Start of processing for Try_Class_Wide_Operation
7971 -- If we are searching only for conflicting class-wide subprograms
7972 -- then initialize directly Matching_Op with the target entity.
7974 if CW_Test_Only
then
7975 Matching_Op
:= Entity
(Selector_Name
(N
));
7978 -- Loop through ancestor types (including interfaces), traversing
7979 -- the homonym chain of the subprogram, trying out those homonyms
7980 -- whose first formal has the class-wide type of the ancestor, or
7981 -- an anonymous access type designating the class-wide type.
7983 Anc_Type
:= Obj_Type
;
7985 -- Look for a match among homonyms associated with the ancestor
7987 Traverse_Homonyms
(Anc_Type
, Error
);
7993 -- Continue the search for matches among homonyms associated with
7994 -- any interfaces implemented by the ancestor.
7996 Traverse_Interfaces
(Anc_Type
, Error
);
8002 exit when Etype
(Anc_Type
) = Anc_Type
;
8003 Anc_Type
:= Etype
(Anc_Type
);
8006 if Present
(Matching_Op
) then
8007 Set_Etype
(Call_Node
, Etype
(Matching_Op
));
8010 return Present
(Matching_Op
);
8011 end Try_Class_Wide_Operation
;
8013 -----------------------------------
8014 -- Try_One_Prefix_Interpretation --
8015 -----------------------------------
8017 procedure Try_One_Prefix_Interpretation
(T
: Entity_Id
) is
8021 if Is_Access_Type
(Obj_Type
) then
8022 Obj_Type
:= Designated_Type
(Obj_Type
);
8025 if Ekind
(Obj_Type
) = E_Private_Subtype
then
8026 Obj_Type
:= Base_Type
(Obj_Type
);
8029 if Is_Class_Wide_Type
(Obj_Type
) then
8030 Obj_Type
:= Etype
(Class_Wide_Type
(Obj_Type
));
8033 -- The type may have be obtained through a limited_with clause,
8034 -- in which case the primitive operations are available on its
8035 -- non-limited view. If still incomplete, retrieve full view.
8037 if Ekind
(Obj_Type
) = E_Incomplete_Type
8038 and then From_Limited_With
(Obj_Type
)
8040 Obj_Type
:= Get_Full_View
(Non_Limited_View
(Obj_Type
));
8043 -- If the object is not tagged, or the type is still an incomplete
8044 -- type, this is not a prefixed call.
8046 if not Is_Tagged_Type
(Obj_Type
)
8047 or else Is_Incomplete_Type
(Obj_Type
)
8053 Dup_Call_Node
: constant Node_Id
:= New_Copy
(New_Call_Node
);
8054 CW_Result
: Boolean;
8055 Prim_Result
: Boolean;
8056 pragma Unreferenced
(CW_Result
);
8059 if not CW_Test_Only
then
8061 Try_Primitive_Operation
8062 (Call_Node
=> New_Call_Node
,
8063 Node_To_Replace
=> Node_To_Replace
);
8066 -- Check if there is a class-wide subprogram covering the
8067 -- primitive. This check must be done even if a candidate
8068 -- was found in order to report ambiguous calls.
8070 if not (Prim_Result
) then
8072 Try_Class_Wide_Operation
8073 (Call_Node
=> New_Call_Node
,
8074 Node_To_Replace
=> Node_To_Replace
);
8076 -- If we found a primitive we search for class-wide subprograms
8077 -- using a duplicate of the call node (done to avoid missing its
8078 -- decoration if there is no ambiguity).
8082 Try_Class_Wide_Operation
8083 (Call_Node
=> Dup_Call_Node
,
8084 Node_To_Replace
=> Node_To_Replace
);
8087 end Try_One_Prefix_Interpretation
;
8089 -----------------------------
8090 -- Try_Primitive_Operation --
8091 -----------------------------
8093 function Try_Primitive_Operation
8094 (Call_Node
: Node_Id
;
8095 Node_To_Replace
: Node_Id
) return Boolean
8098 Prim_Op
: Entity_Id
;
8099 Matching_Op
: Entity_Id
:= Empty
;
8100 Prim_Op_Ref
: Node_Id
:= Empty
;
8102 Corr_Type
: Entity_Id
:= Empty
;
8103 -- If the prefix is a synchronized type, the controlling type of
8104 -- the primitive operation is the corresponding record type, else
8105 -- this is the object type itself.
8107 Success
: Boolean := False;
8109 function Collect_Generic_Type_Ops
(T
: Entity_Id
) return Elist_Id
;
8110 -- For tagged types the candidate interpretations are found in
8111 -- the list of primitive operations of the type and its ancestors.
8112 -- For formal tagged types we have to find the operations declared
8113 -- in the same scope as the type (including in the generic formal
8114 -- part) because the type itself carries no primitive operations,
8115 -- except for formal derived types that inherit the operations of
8116 -- the parent and progenitors.
8118 -- If the context is a generic subprogram body, the generic formals
8119 -- are visible by name, but are not in the entity list of the
8120 -- subprogram because that list starts with the subprogram formals.
8121 -- We retrieve the candidate operations from the generic declaration.
8123 function Is_Private_Overriding
(Op
: Entity_Id
) return Boolean;
8124 -- An operation that overrides an inherited operation in the private
8125 -- part of its package may be hidden, but if the inherited operation
8126 -- is visible a direct call to it will dispatch to the private one,
8127 -- which is therefore a valid candidate.
8129 function Valid_First_Argument_Of
(Op
: Entity_Id
) return Boolean;
8130 -- Verify that the prefix, dereferenced if need be, is a valid
8131 -- controlling argument in a call to Op. The remaining actuals
8132 -- are checked in the subsequent call to Analyze_One_Call.
8134 ------------------------------
8135 -- Collect_Generic_Type_Ops --
8136 ------------------------------
8138 function Collect_Generic_Type_Ops
(T
: Entity_Id
) return Elist_Id
is
8139 Bas
: constant Entity_Id
:= Base_Type
(T
);
8140 Candidates
: constant Elist_Id
:= New_Elmt_List
;
8144 procedure Check_Candidate
;
8145 -- The operation is a candidate if its first parameter is a
8146 -- controlling operand of the desired type.
8148 -----------------------
8149 -- Check_Candidate; --
8150 -----------------------
8152 procedure Check_Candidate
is
8154 Formal
:= First_Formal
(Subp
);
8157 and then Is_Controlling_Formal
(Formal
)
8159 (Base_Type
(Etype
(Formal
)) = Bas
8161 (Is_Access_Type
(Etype
(Formal
))
8162 and then Designated_Type
(Etype
(Formal
)) = Bas
))
8164 Append_Elmt
(Subp
, Candidates
);
8166 end Check_Candidate
;
8168 -- Start of processing for Collect_Generic_Type_Ops
8171 if Is_Derived_Type
(T
) then
8172 return Primitive_Operations
(T
);
8174 elsif Ekind_In
(Scope
(T
), E_Procedure
, E_Function
) then
8176 -- Scan the list of generic formals to find subprograms
8177 -- that may have a first controlling formal of the type.
8179 if Nkind
(Unit_Declaration_Node
(Scope
(T
))) =
8180 N_Generic_Subprogram_Declaration
8187 First
(Generic_Formal_Declarations
8188 (Unit_Declaration_Node
(Scope
(T
))));
8189 while Present
(Decl
) loop
8190 if Nkind
(Decl
) in N_Formal_Subprogram_Declaration
then
8191 Subp
:= Defining_Entity
(Decl
);
8202 -- Scan the list of entities declared in the same scope as
8203 -- the type. In general this will be an open scope, given that
8204 -- the call we are analyzing can only appear within a generic
8205 -- declaration or body (either the one that declares T, or a
8208 -- For a subtype representing a generic actual type, go to the
8211 if Is_Generic_Actual_Type
(T
) then
8212 Subp
:= First_Entity
(Scope
(Base_Type
(T
)));
8214 Subp
:= First_Entity
(Scope
(T
));
8217 while Present
(Subp
) loop
8218 if Is_Overloadable
(Subp
) then
8227 end Collect_Generic_Type_Ops
;
8229 ---------------------------
8230 -- Is_Private_Overriding --
8231 ---------------------------
8233 function Is_Private_Overriding
(Op
: Entity_Id
) return Boolean is
8234 Visible_Op
: constant Entity_Id
:= Homonym
(Op
);
8237 return Present
(Visible_Op
)
8238 and then Scope
(Op
) = Scope
(Visible_Op
)
8239 and then not Comes_From_Source
(Visible_Op
)
8240 and then Alias
(Visible_Op
) = Op
8241 and then not Is_Hidden
(Visible_Op
);
8242 end Is_Private_Overriding
;
8244 -----------------------------
8245 -- Valid_First_Argument_Of --
8246 -----------------------------
8248 function Valid_First_Argument_Of
(Op
: Entity_Id
) return Boolean is
8249 Typ
: Entity_Id
:= Etype
(First_Formal
(Op
));
8252 if Is_Concurrent_Type
(Typ
)
8253 and then Present
(Corresponding_Record_Type
(Typ
))
8255 Typ
:= Corresponding_Record_Type
(Typ
);
8258 -- Simple case. Object may be a subtype of the tagged type or
8259 -- may be the corresponding record of a synchronized type.
8261 return Obj_Type
= Typ
8262 or else Base_Type
(Obj_Type
) = Typ
8263 or else Corr_Type
= Typ
8265 -- Prefix can be dereferenced
8268 (Is_Access_Type
(Corr_Type
)
8269 and then Designated_Type
(Corr_Type
) = Typ
)
8271 -- Formal is an access parameter, for which the object
8272 -- can provide an access.
8275 (Ekind
(Typ
) = E_Anonymous_Access_Type
8277 Base_Type
(Designated_Type
(Typ
)) = Base_Type
(Corr_Type
));
8278 end Valid_First_Argument_Of
;
8280 -- Start of processing for Try_Primitive_Operation
8283 -- Look for subprograms in the list of primitive operations. The name
8284 -- must be identical, and the kind of call indicates the expected
8285 -- kind of operation (function or procedure). If the type is a
8286 -- (tagged) synchronized type, the primitive ops are attached to the
8287 -- corresponding record (base) type.
8289 if Is_Concurrent_Type
(Obj_Type
) then
8290 if Present
(Corresponding_Record_Type
(Obj_Type
)) then
8291 Corr_Type
:= Base_Type
(Corresponding_Record_Type
(Obj_Type
));
8292 Elmt
:= First_Elmt
(Primitive_Operations
(Corr_Type
));
8294 Corr_Type
:= Obj_Type
;
8295 Elmt
:= First_Elmt
(Collect_Generic_Type_Ops
(Obj_Type
));
8298 elsif not Is_Generic_Type
(Obj_Type
) then
8299 Corr_Type
:= Obj_Type
;
8300 Elmt
:= First_Elmt
(Primitive_Operations
(Obj_Type
));
8303 Corr_Type
:= Obj_Type
;
8304 Elmt
:= First_Elmt
(Collect_Generic_Type_Ops
(Obj_Type
));
8307 while Present
(Elmt
) loop
8308 Prim_Op
:= Node
(Elmt
);
8310 if Chars
(Prim_Op
) = Chars
(Subprog
)
8311 and then Present
(First_Formal
(Prim_Op
))
8312 and then Valid_First_Argument_Of
(Prim_Op
)
8314 (Nkind
(Call_Node
) = N_Function_Call
)
8316 (Ekind
(Prim_Op
) = E_Function
)
8318 -- Ada 2005 (AI-251): If this primitive operation corresponds
8319 -- to an immediate ancestor interface there is no need to add
8320 -- it to the list of interpretations; the corresponding aliased
8321 -- primitive is also in this list of primitive operations and
8322 -- will be used instead.
8324 if (Present
(Interface_Alias
(Prim_Op
))
8325 and then Is_Ancestor
(Find_Dispatching_Type
8326 (Alias
(Prim_Op
)), Corr_Type
))
8328 -- Do not consider hidden primitives unless the type is in an
8329 -- open scope or we are within an instance, where visibility
8330 -- is known to be correct, or else if this is an overriding
8331 -- operation in the private part for an inherited operation.
8333 or else (Is_Hidden
(Prim_Op
)
8334 and then not Is_Immediately_Visible
(Obj_Type
)
8335 and then not In_Instance
8336 and then not Is_Private_Overriding
(Prim_Op
))
8341 Set_Etype
(Call_Node
, Any_Type
);
8342 Set_Is_Overloaded
(Call_Node
, False);
8344 if No
(Matching_Op
) then
8345 Prim_Op_Ref
:= New_Occurrence_Of
(Prim_Op
, Sloc
(Subprog
));
8346 Candidate
:= Prim_Op
;
8348 Set_Parent
(Call_Node
, Parent
(Node_To_Replace
));
8350 Set_Name
(Call_Node
, Prim_Op_Ref
);
8356 Report
=> Report_Error
,
8358 Skip_First
=> True);
8360 Matching_Op
:= Valid_Candidate
(Success
, Call_Node
, Prim_Op
);
8362 -- More than one interpretation, collect for subsequent
8363 -- disambiguation. If this is a procedure call and there
8364 -- is another match, report ambiguity now.
8370 Report
=> Report_Error
,
8372 Skip_First
=> True);
8374 if Present
(Valid_Candidate
(Success
, Call_Node
, Prim_Op
))
8375 and then Nkind
(Call_Node
) /= N_Function_Call
8377 Error_Msg_NE
("ambiguous call to&", N
, Prim_Op
);
8378 Report_Ambiguity
(Matching_Op
);
8379 Report_Ambiguity
(Prim_Op
);
8389 if Present
(Matching_Op
) then
8390 Set_Etype
(Call_Node
, Etype
(Matching_Op
));
8393 return Present
(Matching_Op
);
8394 end Try_Primitive_Operation
;
8396 -- Start of processing for Try_Object_Operation
8399 Analyze_Expression
(Obj
);
8401 -- Analyze the actuals if node is known to be a subprogram call
8403 if Is_Subprg_Call
and then N
= Name
(Parent
(N
)) then
8404 Actual
:= First
(Parameter_Associations
(Parent
(N
)));
8405 while Present
(Actual
) loop
8406 Analyze_Expression
(Actual
);
8411 -- Build a subprogram call node, using a copy of Obj as its first
8412 -- actual. This is a placeholder, to be replaced by an explicit
8413 -- dereference when needed.
8415 Transform_Object_Operation
8416 (Call_Node
=> New_Call_Node
,
8417 Node_To_Replace
=> Node_To_Replace
);
8419 Set_Etype
(New_Call_Node
, Any_Type
);
8420 Set_Etype
(Subprog
, Any_Type
);
8421 Set_Parent
(New_Call_Node
, Parent
(Node_To_Replace
));
8423 if not Is_Overloaded
(Obj
) then
8424 Try_One_Prefix_Interpretation
(Obj_Type
);
8431 Get_First_Interp
(Obj
, I
, It
);
8432 while Present
(It
.Nam
) loop
8433 Try_One_Prefix_Interpretation
(It
.Typ
);
8434 Get_Next_Interp
(I
, It
);
8439 if Etype
(New_Call_Node
) /= Any_Type
then
8441 -- No need to complete the tree transformations if we are only
8442 -- searching for conflicting class-wide subprograms
8444 if CW_Test_Only
then
8447 Complete_Object_Operation
8448 (Call_Node
=> New_Call_Node
,
8449 Node_To_Replace
=> Node_To_Replace
);
8453 elsif Present
(Candidate
) then
8455 -- The argument list is not type correct. Re-analyze with error
8456 -- reporting enabled, and use one of the possible candidates.
8457 -- In All_Errors_Mode, re-analyze all failed interpretations.
8459 if All_Errors_Mode
then
8460 Report_Error
:= True;
8461 if Try_Primitive_Operation
8462 (Call_Node
=> New_Call_Node
,
8463 Node_To_Replace
=> Node_To_Replace
)
8466 Try_Class_Wide_Operation
8467 (Call_Node
=> New_Call_Node
,
8468 Node_To_Replace
=> Node_To_Replace
)
8475 (N
=> New_Call_Node
,
8479 Skip_First
=> True);
8482 -- No need for further errors
8487 -- There was no candidate operation, so report it as an error
8488 -- in the caller: Analyze_Selected_Component.
8492 end Try_Object_Operation
;
8498 procedure wpo
(T
: Entity_Id
) is
8503 if not Is_Tagged_Type
(T
) then
8507 E
:= First_Elmt
(Primitive_Operations
(Base_Type
(T
)));
8508 while Present
(E
) loop
8510 Write_Int
(Int
(Op
));
8511 Write_Str
(" === ");
8512 Write_Name
(Chars
(Op
));
8514 Write_Name
(Chars
(Scope
(Op
)));