1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2005, 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 2, 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 COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
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 Nlists
; use Nlists
;
39 with Nmake
; use Nmake
;
41 with Output
; use Output
;
42 with Restrict
; use Restrict
;
43 with Rident
; use Rident
;
45 with Sem_Cat
; use Sem_Cat
;
46 with Sem_Ch3
; use Sem_Ch3
;
47 with Sem_Ch8
; use Sem_Ch8
;
48 with Sem_Dist
; use Sem_Dist
;
49 with Sem_Eval
; use Sem_Eval
;
50 with Sem_Res
; use Sem_Res
;
51 with Sem_Util
; use Sem_Util
;
52 with Sem_Type
; use Sem_Type
;
53 with Stand
; use Stand
;
54 with Sinfo
; use Sinfo
;
55 with Snames
; use Snames
;
56 with Tbuild
; use Tbuild
;
58 with GNAT
.Spelling_Checker
; use GNAT
.Spelling_Checker
;
60 package body Sem_Ch4
is
62 -----------------------
63 -- Local Subprograms --
64 -----------------------
66 procedure Analyze_Expression
(N
: Node_Id
);
67 -- For expressions that are not names, this is just a call to analyze.
68 -- If the expression is a name, it may be a call to a parameterless
69 -- function, and if so must be converted into an explicit call node
70 -- and analyzed as such. This deproceduring must be done during the first
71 -- pass of overload resolution, because otherwise a procedure call with
72 -- overloaded actuals may fail to resolve. See 4327-001 for an example.
74 procedure Analyze_Operator_Call
(N
: Node_Id
; Op_Id
: Entity_Id
);
75 -- Analyze a call of the form "+"(x, y), etc. The prefix of the call
76 -- is an operator name or an expanded name whose selector is an operator
77 -- name, and one possible interpretation is as a predefined operator.
79 procedure Analyze_Overloaded_Selected_Component
(N
: Node_Id
);
80 -- If the prefix of a selected_component is overloaded, the proper
81 -- interpretation that yields a record type with the proper selector
82 -- name must be selected.
84 procedure Analyze_User_Defined_Binary_Op
(N
: Node_Id
; Op_Id
: Entity_Id
);
85 -- Procedure to analyze a user defined binary operator, which is resolved
86 -- like a function, but instead of a list of actuals it is presented
87 -- with the left and right operands of an operator node.
89 procedure Analyze_User_Defined_Unary_Op
(N
: Node_Id
; Op_Id
: Entity_Id
);
90 -- Procedure to analyze a user defined unary operator, which is resolved
91 -- like a function, but instead of a list of actuals, it is presented with
92 -- the operand of the operator node.
94 procedure Ambiguous_Operands
(N
: Node_Id
);
95 -- for equality, membership, and comparison operators with overloaded
96 -- arguments, list possible interpretations.
98 procedure Analyze_One_Call
102 Success
: out Boolean;
103 Skip_First
: Boolean := False);
104 -- Check one interpretation of an overloaded subprogram name for
105 -- compatibility with the types of the actuals in a call. If there is a
106 -- single interpretation which does not match, post error if Report is
109 -- Nam is the entity that provides the formals against which the actuals
110 -- are checked. Nam is either the name of a subprogram, or the internal
111 -- subprogram type constructed for an access_to_subprogram. If the actuals
112 -- are compatible with Nam, then Nam is added to the list of candidate
113 -- interpretations for N, and Success is set to True.
115 -- The flag Skip_First is used when analyzing a call that was rewritten
116 -- from object notation. In this case the first actual may have to receive
117 -- an explicit dereference, depending on the first formal of the operation
118 -- being called. The caller will have verified that the object is legal
119 -- for the call. If the remaining parameters match, the first parameter
120 -- will rewritten as a dereference if needed, prior to completing analysis.
122 procedure Check_Misspelled_Selector
125 -- Give possible misspelling diagnostic if Sel is likely to be
126 -- a misspelling of one of the selectors of the Prefix.
127 -- This is called by Analyze_Selected_Component after producing
128 -- an invalid selector error message.
130 function Defined_In_Scope
(T
: Entity_Id
; S
: Entity_Id
) return Boolean;
131 -- Verify that type T is declared in scope S. Used to find intepretations
132 -- for operators given by expanded names. This is abstracted as a separate
133 -- function to handle extensions to System, where S is System, but T is
134 -- declared in the extension.
136 procedure Find_Arithmetic_Types
140 -- L and R are the operands of an arithmetic operator. Find
141 -- consistent pairs of interpretations for L and R that have a
142 -- numeric type consistent with the semantics of the operator.
144 procedure Find_Comparison_Types
148 -- L and R are operands of a comparison operator. Find consistent
149 -- pairs of interpretations for L and R.
151 procedure Find_Concatenation_Types
155 -- For the four varieties of concatenation
157 procedure Find_Equality_Types
161 -- Ditto for equality operators
163 procedure Find_Boolean_Types
167 -- Ditto for binary logical operations
169 procedure Find_Negation_Types
173 -- Find consistent interpretation for operand of negation operator
175 procedure Find_Non_Universal_Interpretations
180 -- For equality and comparison operators, the result is always boolean,
181 -- and the legality of the operation is determined from the visibility
182 -- of the operand types. If one of the operands has a universal interpre-
183 -- tation, the legality check uses some compatible non-universal
184 -- interpretation of the other operand. N can be an operator node, or
185 -- a function call whose name is an operator designator.
187 procedure Find_Unary_Types
191 -- Unary arithmetic types: plus, minus, abs
193 procedure Check_Arithmetic_Pair
197 -- Subsidiary procedure to Find_Arithmetic_Types. T1 and T2 are valid
198 -- types for left and right operand. Determine whether they constitute
199 -- a valid pair for the given operator, and record the corresponding
200 -- interpretation of the operator node. The node N may be an operator
201 -- node (the usual case) or a function call whose prefix is an operator
202 -- designator. In both cases Op_Id is the operator name itself.
204 procedure Diagnose_Call
(N
: Node_Id
; Nam
: Node_Id
);
205 -- Give detailed information on overloaded call where none of the
206 -- interpretations match. N is the call node, Nam the designator for
207 -- the overloaded entity being called.
209 function Junk_Operand
(N
: Node_Id
) return Boolean;
210 -- Test for an operand that is an inappropriate entity (e.g. a package
211 -- name or a label). If so, issue an error message and return True. If
212 -- the operand is not an inappropriate entity kind, return False.
214 procedure Operator_Check
(N
: Node_Id
);
215 -- Verify that an operator has received some valid interpretation. If none
216 -- was found, determine whether a use clause would make the operation
217 -- legal. The variable Candidate_Type (defined in Sem_Type) is set for
218 -- every type compatible with the operator, even if the operator for the
219 -- type is not directly visible. The routine uses this type to emit a more
220 -- informative message.
222 procedure Process_Implicit_Dereference_Prefix
225 -- Called when P is the prefix of an implicit dereference, denoting an
226 -- object E. If in semantics only mode (-gnatc or generic), record that is
227 -- a reference to E. Normally, such a reference is generated only when the
228 -- implicit dereference is expanded into an explicit one. E may be empty,
229 -- in which case this procedure does nothing.
231 procedure Remove_Abstract_Operations
(N
: Node_Id
);
232 -- Ada 2005: implementation of AI-310. An abstract non-dispatching
233 -- operation is not a candidate interpretation.
235 function Try_Indexed_Call
238 Typ
: Entity_Id
) return Boolean;
239 -- If a function has defaults for all its actuals, a call to it may
240 -- in fact be an indexing on the result of the call. Try_Indexed_Call
241 -- attempts the interpretation as an indexing, prior to analysis as
242 -- a call. If both are possible, the node is overloaded with both
243 -- interpretations (same symbol but two different types).
245 function Try_Indirect_Call
248 Typ
: Entity_Id
) return Boolean;
249 -- Similarly, a function F that needs no actuals can return an access
250 -- to a subprogram, and the call F (X) interpreted as F.all (X). In
251 -- this case the call may be overloaded with both interpretations.
253 function Try_Object_Operation
(N
: Node_Id
) return Boolean;
254 -- Ada 2005 (AI-252): Give support to the object operation notation
256 ------------------------
257 -- Ambiguous_Operands --
258 ------------------------
260 procedure Ambiguous_Operands
(N
: Node_Id
) is
261 procedure List_Operand_Interps
(Opnd
: Node_Id
);
263 --------------------------
264 -- List_Operand_Interps --
265 --------------------------
267 procedure List_Operand_Interps
(Opnd
: Node_Id
) is
272 if Is_Overloaded
(Opnd
) then
273 if Nkind
(Opnd
) in N_Op
then
275 elsif Nkind
(Opnd
) = N_Function_Call
then
285 if Opnd
= Left_Opnd
(N
) then
287 ("\left operand has the following interpretations", N
);
290 ("\right operand has the following interpretations", N
);
294 List_Interps
(Nam
, Err
);
295 end List_Operand_Interps
;
297 -- Start of processing for Ambiguous_Operands
301 or else Nkind
(N
) = N_Not_In
303 Error_Msg_N
("ambiguous operands for membership", N
);
305 elsif Nkind
(N
) = N_Op_Eq
306 or else Nkind
(N
) = N_Op_Ne
308 Error_Msg_N
("ambiguous operands for equality", N
);
311 Error_Msg_N
("ambiguous operands for comparison", N
);
314 if All_Errors_Mode
then
315 List_Operand_Interps
(Left_Opnd
(N
));
316 List_Operand_Interps
(Right_Opnd
(N
));
318 Error_Msg_N
("\use -gnatf switch for details", N
);
320 end Ambiguous_Operands
;
322 -----------------------
323 -- Analyze_Aggregate --
324 -----------------------
326 -- Most of the analysis of Aggregates requires that the type be known,
327 -- and is therefore put off until resolution.
329 procedure Analyze_Aggregate
(N
: Node_Id
) is
331 if No
(Etype
(N
)) then
332 Set_Etype
(N
, Any_Composite
);
334 end Analyze_Aggregate
;
336 -----------------------
337 -- Analyze_Allocator --
338 -----------------------
340 procedure Analyze_Allocator
(N
: Node_Id
) is
341 Loc
: constant Source_Ptr
:= Sloc
(N
);
342 Sav_Errs
: constant Nat
:= Serious_Errors_Detected
;
343 E
: Node_Id
:= Expression
(N
);
344 Acc_Type
: Entity_Id
;
348 Check_Restriction
(No_Allocators
, N
);
350 if Nkind
(E
) = N_Qualified_Expression
then
351 Acc_Type
:= Create_Itype
(E_Allocator_Type
, N
);
352 Set_Etype
(Acc_Type
, Acc_Type
);
353 Init_Size_Align
(Acc_Type
);
354 Find_Type
(Subtype_Mark
(E
));
355 Type_Id
:= Entity
(Subtype_Mark
(E
));
356 Check_Fully_Declared
(Type_Id
, N
);
357 Set_Directly_Designated_Type
(Acc_Type
, Type_Id
);
359 if Is_Limited_Type
(Type_Id
)
360 and then Comes_From_Source
(N
)
361 and then not In_Instance_Body
363 -- Ada 2005 (AI-287): Do not post an error if the expression
364 -- corresponds to a limited aggregate. Limited aggregates
365 -- are checked in sem_aggr in a per-component manner
366 -- (compare with handling of Get_Value subprogram).
368 if Ada_Version
>= Ada_05
369 and then Nkind
(Expression
(E
)) = N_Aggregate
373 Error_Msg_N
("initialization not allowed for limited types", N
);
374 Explain_Limited_Type
(Type_Id
, N
);
378 Analyze_And_Resolve
(Expression
(E
), Type_Id
);
380 -- A qualified expression requires an exact match of the type,
381 -- class-wide matching is not allowed.
383 if Is_Class_Wide_Type
(Type_Id
)
384 and then Base_Type
(Etype
(Expression
(E
))) /= Base_Type
(Type_Id
)
386 Wrong_Type
(Expression
(E
), Type_Id
);
389 Check_Non_Static_Context
(Expression
(E
));
391 -- We don't analyze the qualified expression itself because it's
392 -- part of the allocator
394 Set_Etype
(E
, Type_Id
);
396 -- Case where no qualified expression is present
401 Base_Typ
: Entity_Id
;
404 -- If the allocator includes a N_Subtype_Indication then a
405 -- constraint is present, otherwise the node is a subtype mark.
406 -- Introduce an explicit subtype declaration into the tree
407 -- defining some anonymous subtype and rewrite the allocator to
408 -- use this subtype rather than the subtype indication.
410 -- It is important to introduce the explicit subtype declaration
411 -- so that the bounds of the subtype indication are attached to
412 -- the tree in case the allocator is inside a generic unit.
414 if Nkind
(E
) = N_Subtype_Indication
then
416 -- A constraint is only allowed for a composite type in Ada
417 -- 95. In Ada 83, a constraint is also allowed for an
418 -- access-to-composite type, but the constraint is ignored.
420 Find_Type
(Subtype_Mark
(E
));
421 Base_Typ
:= Entity
(Subtype_Mark
(E
));
423 if Is_Elementary_Type
(Base_Typ
) then
424 if not (Ada_Version
= Ada_83
425 and then Is_Access_Type
(Base_Typ
))
427 Error_Msg_N
("constraint not allowed here", E
);
429 if Nkind
(Constraint
(E
))
430 = N_Index_Or_Discriminant_Constraint
433 ("\if qualified expression was meant, " &
434 "use apostrophe", Constraint
(E
));
438 -- Get rid of the bogus constraint:
440 Rewrite
(E
, New_Copy_Tree
(Subtype_Mark
(E
)));
441 Analyze_Allocator
(N
);
444 -- Ada 2005, AI-363: if the designated type has a constrained
445 -- partial view, it cannot receive a discriminant constraint,
446 -- and the allocated object is unconstrained.
448 elsif Ada_Version
>= Ada_05
449 and then Has_Constrained_Partial_View
(Base_Typ
)
452 ("constraint no allowed when type " &
453 "has a constrained partial view", Constraint
(E
));
456 if Expander_Active
then
458 Make_Defining_Identifier
(Loc
, New_Internal_Name
('S'));
461 Make_Subtype_Declaration
(Loc
,
462 Defining_Identifier
=> Def_Id
,
463 Subtype_Indication
=> Relocate_Node
(E
)));
465 if Sav_Errs
/= Serious_Errors_Detected
466 and then Nkind
(Constraint
(E
))
467 = N_Index_Or_Discriminant_Constraint
470 ("if qualified expression was meant, " &
471 "use apostrophe!", Constraint
(E
));
474 E
:= New_Occurrence_Of
(Def_Id
, Loc
);
475 Rewrite
(Expression
(N
), E
);
479 Type_Id
:= Process_Subtype
(E
, N
);
480 Acc_Type
:= Create_Itype
(E_Allocator_Type
, N
);
481 Set_Etype
(Acc_Type
, Acc_Type
);
482 Init_Size_Align
(Acc_Type
);
483 Set_Directly_Designated_Type
(Acc_Type
, Type_Id
);
484 Check_Fully_Declared
(Type_Id
, N
);
488 if Can_Never_Be_Null
(Type_Id
) then
489 Error_Msg_N
("(Ada 2005) qualified expression required",
493 -- Check restriction against dynamically allocated protected
494 -- objects. Note that when limited aggregates are supported,
495 -- a similar test should be applied to an allocator with a
496 -- qualified expression ???
498 if Is_Protected_Type
(Type_Id
) then
499 Check_Restriction
(No_Protected_Type_Allocators
, N
);
502 -- Check for missing initialization. Skip this check if we already
503 -- had errors on analyzing the allocator, since in that case these
504 -- are probably cascaded errors
506 if Is_Indefinite_Subtype
(Type_Id
)
507 and then Serious_Errors_Detected
= Sav_Errs
509 if Is_Class_Wide_Type
(Type_Id
) then
511 ("initialization required in class-wide allocation", N
);
514 ("initialization required in unconstrained allocation", N
);
520 if Is_Abstract
(Type_Id
) then
521 Error_Msg_N
("cannot allocate abstract object", E
);
524 if Has_Task
(Designated_Type
(Acc_Type
)) then
525 Check_Restriction
(No_Tasking
, N
);
526 Check_Restriction
(Max_Tasks
, N
);
527 Check_Restriction
(No_Task_Allocators
, N
);
530 -- If the No_Streams restriction is set, check that the type of the
531 -- object is not, and does not contain, any subtype derived from
532 -- Ada.Streams.Root_Stream_Type. Note that we guard the call to
533 -- Has_Stream just for efficiency reasons. There is no point in
534 -- spending time on a Has_Stream check if the restriction is not set.
536 if Restrictions
.Set
(No_Streams
) then
537 if Has_Stream
(Designated_Type
(Acc_Type
)) then
538 Check_Restriction
(No_Streams
, N
);
542 Set_Etype
(N
, Acc_Type
);
544 if not Is_Library_Level_Entity
(Acc_Type
) then
545 Check_Restriction
(No_Local_Allocators
, N
);
548 if Serious_Errors_Detected
> Sav_Errs
then
549 Set_Error_Posted
(N
);
550 Set_Etype
(N
, Any_Type
);
552 end Analyze_Allocator
;
554 ---------------------------
555 -- Analyze_Arithmetic_Op --
556 ---------------------------
558 procedure Analyze_Arithmetic_Op
(N
: Node_Id
) is
559 L
: constant Node_Id
:= Left_Opnd
(N
);
560 R
: constant Node_Id
:= Right_Opnd
(N
);
564 Candidate_Type
:= Empty
;
565 Analyze_Expression
(L
);
566 Analyze_Expression
(R
);
568 -- If the entity is already set, the node is the instantiation of
569 -- a generic node with a non-local reference, or was manufactured
570 -- by a call to Make_Op_xxx. In either case the entity is known to
571 -- be valid, and we do not need to collect interpretations, instead
572 -- we just get the single possible interpretation.
576 if Present
(Op_Id
) then
577 if Ekind
(Op_Id
) = E_Operator
then
579 if (Nkind
(N
) = N_Op_Divide
or else
580 Nkind
(N
) = N_Op_Mod
or else
581 Nkind
(N
) = N_Op_Multiply
or else
582 Nkind
(N
) = N_Op_Rem
)
583 and then Treat_Fixed_As_Integer
(N
)
587 Set_Etype
(N
, Any_Type
);
588 Find_Arithmetic_Types
(L
, R
, Op_Id
, N
);
592 Set_Etype
(N
, Any_Type
);
593 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
596 -- Entity is not already set, so we do need to collect interpretations
599 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
600 Set_Etype
(N
, Any_Type
);
602 while Present
(Op_Id
) loop
603 if Ekind
(Op_Id
) = E_Operator
604 and then Present
(Next_Entity
(First_Entity
(Op_Id
)))
606 Find_Arithmetic_Types
(L
, R
, Op_Id
, N
);
608 -- The following may seem superfluous, because an operator cannot
609 -- be generic, but this ignores the cleverness of the author of
612 elsif Is_Overloadable
(Op_Id
) then
613 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
616 Op_Id
:= Homonym
(Op_Id
);
621 end Analyze_Arithmetic_Op
;
627 -- Function, procedure, and entry calls are checked here. The Name in
628 -- the call may be overloaded. The actuals have been analyzed and may
629 -- themselves be overloaded. On exit from this procedure, the node N
630 -- may have zero, one or more interpretations. In the first case an
631 -- error message is produced. In the last case, the node is flagged
632 -- as overloaded and the interpretations are collected in All_Interp.
634 -- If the name is an Access_To_Subprogram, it cannot be overloaded, but
635 -- the type-checking is similar to that of other calls.
637 procedure Analyze_Call
(N
: Node_Id
) is
638 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
639 Nam
: Node_Id
:= Name
(N
);
643 Success
: Boolean := False;
645 function Name_Denotes_Function
return Boolean;
646 -- If the type of the name is an access to subprogram, this may be
647 -- the type of a name, or the return type of the function being called.
648 -- If the name is not an entity then it can denote a protected function.
649 -- Until we distinguish Etype from Return_Type, we must use this
650 -- routine to resolve the meaning of the name in the call.
652 ---------------------------
653 -- Name_Denotes_Function --
654 ---------------------------
656 function Name_Denotes_Function
return Boolean is
658 if Is_Entity_Name
(Nam
) then
659 return Ekind
(Entity
(Nam
)) = E_Function
;
661 elsif Nkind
(Nam
) = N_Selected_Component
then
662 return Ekind
(Entity
(Selector_Name
(Nam
))) = E_Function
;
667 end Name_Denotes_Function
;
669 -- Start of processing for Analyze_Call
672 -- Initialize the type of the result of the call to the error type,
673 -- which will be reset if the type is successfully resolved.
675 Set_Etype
(N
, Any_Type
);
677 if not Is_Overloaded
(Nam
) then
679 -- Only one interpretation to check
681 if Ekind
(Etype
(Nam
)) = E_Subprogram_Type
then
682 Nam_Ent
:= Etype
(Nam
);
684 -- If the prefix is an access_to_subprogram, this may be an indirect
685 -- call. This is the case if the name in the call is not an entity
686 -- name, or if it is a function name in the context of a procedure
687 -- call. In this latter case, we have a call to a parameterless
688 -- function that returns a pointer_to_procedure which is the entity
691 elsif Is_Access_Type
(Etype
(Nam
))
692 and then Ekind
(Designated_Type
(Etype
(Nam
))) = E_Subprogram_Type
694 (not Name_Denotes_Function
695 or else Nkind
(N
) = N_Procedure_Call_Statement
)
697 Nam_Ent
:= Designated_Type
(Etype
(Nam
));
698 Insert_Explicit_Dereference
(Nam
);
700 -- Selected component case. Simple entry or protected operation,
701 -- where the entry name is given by the selector name.
703 elsif Nkind
(Nam
) = N_Selected_Component
then
704 Nam_Ent
:= Entity
(Selector_Name
(Nam
));
706 if Ekind
(Nam_Ent
) /= E_Entry
707 and then Ekind
(Nam_Ent
) /= E_Entry_Family
708 and then Ekind
(Nam_Ent
) /= E_Function
709 and then Ekind
(Nam_Ent
) /= E_Procedure
711 Error_Msg_N
("name in call is not a callable entity", Nam
);
712 Set_Etype
(N
, Any_Type
);
716 -- If the name is an Indexed component, it can be a call to a member
717 -- of an entry family. The prefix must be a selected component whose
718 -- selector is the entry. Analyze_Procedure_Call normalizes several
719 -- kinds of call into this form.
721 elsif Nkind
(Nam
) = N_Indexed_Component
then
723 if Nkind
(Prefix
(Nam
)) = N_Selected_Component
then
724 Nam_Ent
:= Entity
(Selector_Name
(Prefix
(Nam
)));
726 Error_Msg_N
("name in call is not a callable entity", Nam
);
727 Set_Etype
(N
, Any_Type
);
731 elsif not Is_Entity_Name
(Nam
) then
732 Error_Msg_N
("name in call is not a callable entity", Nam
);
733 Set_Etype
(N
, Any_Type
);
737 Nam_Ent
:= Entity
(Nam
);
739 -- If no interpretations, give error message
741 if not Is_Overloadable
(Nam_Ent
) then
743 L
: constant Boolean := Is_List_Member
(N
);
744 K
: constant Node_Kind
:= Nkind
(Parent
(N
));
747 -- If the node is in a list whose parent is not an
748 -- expression then it must be an attempted procedure call.
750 if L
and then K
not in N_Subexpr
then
751 if Ekind
(Entity
(Nam
)) = E_Generic_Procedure
then
753 ("must instantiate generic procedure& before call",
757 ("procedure or entry name expected", Nam
);
760 -- Check for tasking cases where only an entry call will do
763 and then (K
= N_Entry_Call_Alternative
764 or else K
= N_Triggering_Alternative
)
766 Error_Msg_N
("entry name expected", Nam
);
768 -- Otherwise give general error message
771 Error_Msg_N
("invalid prefix in call", Nam
);
779 Analyze_One_Call
(N
, Nam_Ent
, True, Success
);
781 -- If this is an indirect call, the return type of the access_to
782 -- subprogram may be an incomplete type. At the point of the call,
783 -- use the full type if available, and at the same time update
784 -- the return type of the access_to_subprogram.
787 and then Nkind
(Nam
) = N_Explicit_Dereference
788 and then Ekind
(Etype
(N
)) = E_Incomplete_Type
789 and then Present
(Full_View
(Etype
(N
)))
791 Set_Etype
(N
, Full_View
(Etype
(N
)));
792 Set_Etype
(Nam_Ent
, Etype
(N
));
796 -- An overloaded selected component must denote overloaded
797 -- operations of a concurrent type. The interpretations are
798 -- attached to the simple name of those operations.
800 if Nkind
(Nam
) = N_Selected_Component
then
801 Nam
:= Selector_Name
(Nam
);
804 Get_First_Interp
(Nam
, X
, It
);
806 while Present
(It
.Nam
) loop
809 -- Name may be call that returns an access to subprogram, or more
810 -- generally an overloaded expression one of whose interpretations
811 -- yields an access to subprogram. If the name is an entity, we
812 -- do not dereference, because the node is a call that returns
813 -- the access type: note difference between f(x), where the call
814 -- may return an access subprogram type, and f(x)(y), where the
815 -- type returned by the call to f is implicitly dereferenced to
816 -- analyze the outer call.
818 if Is_Access_Type
(Nam_Ent
) then
819 Nam_Ent
:= Designated_Type
(Nam_Ent
);
821 elsif Is_Access_Type
(Etype
(Nam_Ent
))
822 and then not Is_Entity_Name
(Nam
)
823 and then Ekind
(Designated_Type
(Etype
(Nam_Ent
)))
826 Nam_Ent
:= Designated_Type
(Etype
(Nam_Ent
));
829 Analyze_One_Call
(N
, Nam_Ent
, False, Success
);
831 -- If the interpretation succeeds, mark the proper type of the
832 -- prefix (any valid candidate will do). If not, remove the
833 -- candidate interpretation. This only needs to be done for
834 -- overloaded protected operations, for other entities disambi-
835 -- guation is done directly in Resolve.
838 Set_Etype
(Nam
, It
.Typ
);
840 elsif Nkind
(Name
(N
)) = N_Selected_Component
841 or else Nkind
(Name
(N
)) = N_Function_Call
846 Get_Next_Interp
(X
, It
);
849 -- If the name is the result of a function call, it can only
850 -- be a call to a function returning an access to subprogram.
851 -- Insert explicit dereference.
853 if Nkind
(Nam
) = N_Function_Call
then
854 Insert_Explicit_Dereference
(Nam
);
857 if Etype
(N
) = Any_Type
then
859 -- None of the interpretations is compatible with the actuals
861 Diagnose_Call
(N
, Nam
);
863 -- Special checks for uninstantiated put routines
865 if Nkind
(N
) = N_Procedure_Call_Statement
866 and then Is_Entity_Name
(Nam
)
867 and then Chars
(Nam
) = Name_Put
868 and then List_Length
(Actuals
) = 1
871 Arg
: constant Node_Id
:= First
(Actuals
);
875 if Nkind
(Arg
) = N_Parameter_Association
then
876 Typ
:= Etype
(Explicit_Actual_Parameter
(Arg
));
881 if Is_Signed_Integer_Type
(Typ
) then
883 ("possible missing instantiation of " &
884 "'Text_'I'O.'Integer_'I'O!", Nam
);
886 elsif Is_Modular_Integer_Type
(Typ
) then
888 ("possible missing instantiation of " &
889 "'Text_'I'O.'Modular_'I'O!", Nam
);
891 elsif Is_Floating_Point_Type
(Typ
) then
893 ("possible missing instantiation of " &
894 "'Text_'I'O.'Float_'I'O!", Nam
);
896 elsif Is_Ordinary_Fixed_Point_Type
(Typ
) then
898 ("possible missing instantiation of " &
899 "'Text_'I'O.'Fixed_'I'O!", Nam
);
901 elsif Is_Decimal_Fixed_Point_Type
(Typ
) then
903 ("possible missing instantiation of " &
904 "'Text_'I'O.'Decimal_'I'O!", Nam
);
906 elsif Is_Enumeration_Type
(Typ
) then
908 ("possible missing instantiation of " &
909 "'Text_'I'O.'Enumeration_'I'O!", Nam
);
914 elsif not Is_Overloaded
(N
)
915 and then Is_Entity_Name
(Nam
)
917 -- Resolution yields a single interpretation. Verify that
918 -- is has the proper capitalization.
920 Set_Entity_With_Style_Check
(Nam
, Entity
(Nam
));
921 Generate_Reference
(Entity
(Nam
), Nam
);
923 Set_Etype
(Nam
, Etype
(Entity
(Nam
)));
925 Remove_Abstract_Operations
(N
);
932 ---------------------------
933 -- Analyze_Comparison_Op --
934 ---------------------------
936 procedure Analyze_Comparison_Op
(N
: Node_Id
) is
937 L
: constant Node_Id
:= Left_Opnd
(N
);
938 R
: constant Node_Id
:= Right_Opnd
(N
);
939 Op_Id
: Entity_Id
:= Entity
(N
);
942 Set_Etype
(N
, Any_Type
);
943 Candidate_Type
:= Empty
;
945 Analyze_Expression
(L
);
946 Analyze_Expression
(R
);
948 if Present
(Op_Id
) then
949 if Ekind
(Op_Id
) = E_Operator
then
950 Find_Comparison_Types
(L
, R
, Op_Id
, N
);
952 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
955 if Is_Overloaded
(L
) then
956 Set_Etype
(L
, Intersect_Types
(L
, R
));
960 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
961 while Present
(Op_Id
) loop
962 if Ekind
(Op_Id
) = E_Operator
then
963 Find_Comparison_Types
(L
, R
, Op_Id
, N
);
965 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
968 Op_Id
:= Homonym
(Op_Id
);
973 end Analyze_Comparison_Op
;
975 ---------------------------
976 -- Analyze_Concatenation --
977 ---------------------------
979 -- If the only one-dimensional array type in scope is String,
980 -- this is the resulting type of the operation. Otherwise there
981 -- will be a concatenation operation defined for each user-defined
982 -- one-dimensional array.
984 procedure Analyze_Concatenation
(N
: Node_Id
) is
985 L
: constant Node_Id
:= Left_Opnd
(N
);
986 R
: constant Node_Id
:= Right_Opnd
(N
);
987 Op_Id
: Entity_Id
:= Entity
(N
);
992 Set_Etype
(N
, Any_Type
);
993 Candidate_Type
:= Empty
;
995 Analyze_Expression
(L
);
996 Analyze_Expression
(R
);
998 -- If the entity is present, the node appears in an instance,
999 -- and denotes a predefined concatenation operation. The resulting
1000 -- type is obtained from the arguments when possible. If the arguments
1001 -- are aggregates, the array type and the concatenation type must be
1004 if Present
(Op_Id
) then
1005 if Ekind
(Op_Id
) = E_Operator
then
1007 LT
:= Base_Type
(Etype
(L
));
1008 RT
:= Base_Type
(Etype
(R
));
1010 if Is_Array_Type
(LT
)
1011 and then (RT
= LT
or else RT
= Base_Type
(Component_Type
(LT
)))
1013 Add_One_Interp
(N
, Op_Id
, LT
);
1015 elsif Is_Array_Type
(RT
)
1016 and then LT
= Base_Type
(Component_Type
(RT
))
1018 Add_One_Interp
(N
, Op_Id
, RT
);
1020 -- If one operand is a string type or a user-defined array type,
1021 -- and the other is a literal, result is of the specific type.
1024 (Root_Type
(LT
) = Standard_String
1025 or else Scope
(LT
) /= Standard_Standard
)
1026 and then Etype
(R
) = Any_String
1028 Add_One_Interp
(N
, Op_Id
, LT
);
1031 (Root_Type
(RT
) = Standard_String
1032 or else Scope
(RT
) /= Standard_Standard
)
1033 and then Etype
(L
) = Any_String
1035 Add_One_Interp
(N
, Op_Id
, RT
);
1037 elsif not Is_Generic_Type
(Etype
(Op_Id
)) then
1038 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1041 -- Type and its operations must be visible
1043 Set_Entity
(N
, Empty
);
1044 Analyze_Concatenation
(N
);
1048 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1052 Op_Id
:= Get_Name_Entity_Id
(Name_Op_Concat
);
1053 while Present
(Op_Id
) loop
1054 if Ekind
(Op_Id
) = E_Operator
then
1056 -- Do not consider operators declared in dead code, they can
1057 -- not be part of the resolution.
1059 if Is_Eliminated
(Op_Id
) then
1062 Find_Concatenation_Types
(L
, R
, Op_Id
, N
);
1066 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1069 Op_Id
:= Homonym
(Op_Id
);
1074 end Analyze_Concatenation
;
1076 ------------------------------------
1077 -- Analyze_Conditional_Expression --
1078 ------------------------------------
1080 procedure Analyze_Conditional_Expression
(N
: Node_Id
) is
1081 Condition
: constant Node_Id
:= First
(Expressions
(N
));
1082 Then_Expr
: constant Node_Id
:= Next
(Condition
);
1083 Else_Expr
: constant Node_Id
:= Next
(Then_Expr
);
1085 Analyze_Expression
(Condition
);
1086 Analyze_Expression
(Then_Expr
);
1087 Analyze_Expression
(Else_Expr
);
1088 Set_Etype
(N
, Etype
(Then_Expr
));
1089 end Analyze_Conditional_Expression
;
1091 -------------------------
1092 -- Analyze_Equality_Op --
1093 -------------------------
1095 procedure Analyze_Equality_Op
(N
: Node_Id
) is
1096 Loc
: constant Source_Ptr
:= Sloc
(N
);
1097 L
: constant Node_Id
:= Left_Opnd
(N
);
1098 R
: constant Node_Id
:= Right_Opnd
(N
);
1102 Set_Etype
(N
, Any_Type
);
1103 Candidate_Type
:= Empty
;
1105 Analyze_Expression
(L
);
1106 Analyze_Expression
(R
);
1108 -- If the entity is set, the node is a generic instance with a non-local
1109 -- reference to the predefined operator or to a user-defined function.
1110 -- It can also be an inequality that is expanded into the negation of a
1111 -- call to a user-defined equality operator.
1113 -- For the predefined case, the result is Boolean, regardless of the
1114 -- type of the operands. The operands may even be limited, if they are
1115 -- generic actuals. If they are overloaded, label the left argument with
1116 -- the common type that must be present, or with the type of the formal
1117 -- of the user-defined function.
1119 if Present
(Entity
(N
)) then
1120 Op_Id
:= Entity
(N
);
1122 if Ekind
(Op_Id
) = E_Operator
then
1123 Add_One_Interp
(N
, Op_Id
, Standard_Boolean
);
1125 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1128 if Is_Overloaded
(L
) then
1129 if Ekind
(Op_Id
) = E_Operator
then
1130 Set_Etype
(L
, Intersect_Types
(L
, R
));
1132 Set_Etype
(L
, Etype
(First_Formal
(Op_Id
)));
1137 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
1138 while Present
(Op_Id
) loop
1139 if Ekind
(Op_Id
) = E_Operator
then
1140 Find_Equality_Types
(L
, R
, Op_Id
, N
);
1142 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1145 Op_Id
:= Homonym
(Op_Id
);
1149 -- If there was no match, and the operator is inequality, this may
1150 -- be a case where inequality has not been made explicit, as for
1151 -- tagged types. Analyze the node as the negation of an equality
1152 -- operation. This cannot be done earlier, because before analysis
1153 -- we cannot rule out the presence of an explicit inequality.
1155 if Etype
(N
) = Any_Type
1156 and then Nkind
(N
) = N_Op_Ne
1158 Op_Id
:= Get_Name_Entity_Id
(Name_Op_Eq
);
1159 while Present
(Op_Id
) loop
1160 if Ekind
(Op_Id
) = E_Operator
then
1161 Find_Equality_Types
(L
, R
, Op_Id
, N
);
1163 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1166 Op_Id
:= Homonym
(Op_Id
);
1169 if Etype
(N
) /= Any_Type
then
1170 Op_Id
:= Entity
(N
);
1176 Left_Opnd
=> Relocate_Node
(Left_Opnd
(N
)),
1177 Right_Opnd
=> Relocate_Node
(Right_Opnd
(N
)))));
1179 Set_Entity
(Right_Opnd
(N
), Op_Id
);
1185 end Analyze_Equality_Op
;
1187 ----------------------------------
1188 -- Analyze_Explicit_Dereference --
1189 ----------------------------------
1191 procedure Analyze_Explicit_Dereference
(N
: Node_Id
) is
1192 Loc
: constant Source_Ptr
:= Sloc
(N
);
1193 P
: constant Node_Id
:= Prefix
(N
);
1199 function Is_Function_Type
return Boolean;
1200 -- Check whether node may be interpreted as an implicit function call
1202 ----------------------
1203 -- Is_Function_Type --
1204 ----------------------
1206 function Is_Function_Type
return Boolean is
1211 if not Is_Overloaded
(N
) then
1212 return Ekind
(Base_Type
(Etype
(N
))) = E_Subprogram_Type
1213 and then Etype
(Base_Type
(Etype
(N
))) /= Standard_Void_Type
;
1216 Get_First_Interp
(N
, I
, It
);
1217 while Present
(It
.Nam
) loop
1218 if Ekind
(Base_Type
(It
.Typ
)) /= E_Subprogram_Type
1219 or else Etype
(Base_Type
(It
.Typ
)) = Standard_Void_Type
1224 Get_Next_Interp
(I
, It
);
1229 end Is_Function_Type
;
1231 -- Start of processing for Analyze_Explicit_Dereference
1235 Set_Etype
(N
, Any_Type
);
1237 -- Test for remote access to subprogram type, and if so return
1238 -- after rewriting the original tree.
1240 if Remote_AST_E_Dereference
(P
) then
1244 -- Normal processing for other than remote access to subprogram type
1246 if not Is_Overloaded
(P
) then
1247 if Is_Access_Type
(Etype
(P
)) then
1249 -- Set the Etype. We need to go thru Is_For_Access_Subtypes
1250 -- to avoid other problems caused by the Private_Subtype
1251 -- and it is safe to go to the Base_Type because this is the
1252 -- same as converting the access value to its Base_Type.
1255 DT
: Entity_Id
:= Designated_Type
(Etype
(P
));
1258 if Ekind
(DT
) = E_Private_Subtype
1259 and then Is_For_Access_Subtype
(DT
)
1261 DT
:= Base_Type
(DT
);
1267 elsif Etype
(P
) /= Any_Type
then
1268 Error_Msg_N
("prefix of dereference must be an access type", N
);
1273 Get_First_Interp
(P
, I
, It
);
1274 while Present
(It
.Nam
) loop
1277 if Is_Access_Type
(T
) then
1278 Add_One_Interp
(N
, Designated_Type
(T
), Designated_Type
(T
));
1281 Get_Next_Interp
(I
, It
);
1284 -- Error if no interpretation of the prefix has an access type
1286 if Etype
(N
) = Any_Type
then
1288 ("access type required in prefix of explicit dereference", P
);
1289 Set_Etype
(N
, Any_Type
);
1295 and then Nkind
(Parent
(N
)) /= N_Indexed_Component
1297 and then (Nkind
(Parent
(N
)) /= N_Function_Call
1298 or else N
/= Name
(Parent
(N
)))
1300 and then (Nkind
(Parent
(N
)) /= N_Procedure_Call_Statement
1301 or else N
/= Name
(Parent
(N
)))
1303 and then Nkind
(Parent
(N
)) /= N_Subprogram_Renaming_Declaration
1304 and then (Nkind
(Parent
(N
)) /= N_Attribute_Reference
1306 (Attribute_Name
(Parent
(N
)) /= Name_Address
1308 Attribute_Name
(Parent
(N
)) /= Name_Access
))
1310 -- Name is a function call with no actuals, in a context that
1311 -- requires deproceduring (including as an actual in an enclosing
1312 -- function or procedure call). There are some pathological cases
1313 -- where the prefix might include functions that return access to
1314 -- subprograms and others that return a regular type. Disambiguation
1315 -- of those has to take place in Resolve.
1316 -- See e.g. 7117-014 and E317-001.
1319 Make_Function_Call
(Loc
,
1320 Name
=> Make_Explicit_Dereference
(Loc
, P
),
1321 Parameter_Associations
=> New_List
);
1323 -- If the prefix is overloaded, remove operations that have formals,
1324 -- we know that this is a parameterless call.
1326 if Is_Overloaded
(P
) then
1327 Get_First_Interp
(P
, I
, It
);
1328 while Present
(It
.Nam
) loop
1331 if No
(First_Formal
(Base_Type
(Designated_Type
(T
)))) then
1337 Get_Next_Interp
(I
, It
);
1344 elsif not Is_Function_Type
1345 and then Is_Overloaded
(N
)
1347 -- The prefix may include access to subprograms and other access
1348 -- types. If the context selects the interpretation that is a call,
1349 -- we cannot rewrite the node yet, but we include the result of
1350 -- the call interpretation.
1352 Get_First_Interp
(N
, I
, It
);
1353 while Present
(It
.Nam
) loop
1354 if Ekind
(Base_Type
(It
.Typ
)) = E_Subprogram_Type
1355 and then Etype
(Base_Type
(It
.Typ
)) /= Standard_Void_Type
1357 Add_One_Interp
(N
, Etype
(It
.Typ
), Etype
(It
.Typ
));
1360 Get_Next_Interp
(I
, It
);
1364 -- A value of remote access-to-class-wide must not be dereferenced
1367 Validate_Remote_Access_To_Class_Wide_Type
(N
);
1368 end Analyze_Explicit_Dereference
;
1370 ------------------------
1371 -- Analyze_Expression --
1372 ------------------------
1374 procedure Analyze_Expression
(N
: Node_Id
) is
1377 Check_Parameterless_Call
(N
);
1378 end Analyze_Expression
;
1380 ------------------------------------
1381 -- Analyze_Indexed_Component_Form --
1382 ------------------------------------
1384 procedure Analyze_Indexed_Component_Form
(N
: Node_Id
) is
1385 P
: constant Node_Id
:= Prefix
(N
);
1386 Exprs
: constant List_Id
:= Expressions
(N
);
1392 procedure Process_Function_Call
;
1393 -- Prefix in indexed component form is an overloadable entity,
1394 -- so the node is a function call. Reformat it as such.
1396 procedure Process_Indexed_Component
;
1397 -- Prefix in indexed component form is actually an indexed component.
1398 -- This routine processes it, knowing that the prefix is already
1401 procedure Process_Indexed_Component_Or_Slice
;
1402 -- An indexed component with a single index may designate a slice if
1403 -- the index is a subtype mark. This routine disambiguates these two
1404 -- cases by resolving the prefix to see if it is a subtype mark.
1406 procedure Process_Overloaded_Indexed_Component
;
1407 -- If the prefix of an indexed component is overloaded, the proper
1408 -- interpretation is selected by the index types and the context.
1410 ---------------------------
1411 -- Process_Function_Call --
1412 ---------------------------
1414 procedure Process_Function_Call
is
1418 Change_Node
(N
, N_Function_Call
);
1420 Set_Parameter_Associations
(N
, Exprs
);
1422 Actual
:= First
(Parameter_Associations
(N
));
1423 while Present
(Actual
) loop
1425 Check_Parameterless_Call
(Actual
);
1426 Next_Actual
(Actual
);
1430 end Process_Function_Call
;
1432 -------------------------------
1433 -- Process_Indexed_Component --
1434 -------------------------------
1436 procedure Process_Indexed_Component
is
1438 Array_Type
: Entity_Id
;
1440 Pent
: Entity_Id
:= Empty
;
1443 Exp
:= First
(Exprs
);
1445 if Is_Overloaded
(P
) then
1446 Process_Overloaded_Indexed_Component
;
1449 Array_Type
:= Etype
(P
);
1451 if Is_Entity_Name
(P
) then
1453 elsif Nkind
(P
) = N_Selected_Component
1454 and then Is_Entity_Name
(Selector_Name
(P
))
1456 Pent
:= Entity
(Selector_Name
(P
));
1459 -- Prefix must be appropriate for an array type, taking into
1460 -- account a possible implicit dereference.
1462 if Is_Access_Type
(Array_Type
) then
1463 Array_Type
:= Designated_Type
(Array_Type
);
1464 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
1465 Process_Implicit_Dereference_Prefix
(Pent
, P
);
1468 if Is_Array_Type
(Array_Type
) then
1471 elsif Present
(Pent
) and then Ekind
(Pent
) = E_Entry_Family
then
1473 Set_Etype
(N
, Any_Type
);
1475 if not Has_Compatible_Type
1476 (Exp
, Entry_Index_Type
(Pent
))
1478 Error_Msg_N
("invalid index type in entry name", N
);
1480 elsif Present
(Next
(Exp
)) then
1481 Error_Msg_N
("too many subscripts in entry reference", N
);
1484 Set_Etype
(N
, Etype
(P
));
1489 elsif Is_Record_Type
(Array_Type
)
1490 and then Remote_AST_I_Dereference
(P
)
1494 elsif Array_Type
= Any_Type
then
1495 Set_Etype
(N
, Any_Type
);
1498 -- Here we definitely have a bad indexing
1501 if Nkind
(Parent
(N
)) = N_Requeue_Statement
1502 and then Present
(Pent
) and then Ekind
(Pent
) = E_Entry
1505 ("REQUEUE does not permit parameters", First
(Exprs
));
1507 elsif Is_Entity_Name
(P
)
1508 and then Etype
(P
) = Standard_Void_Type
1510 Error_Msg_NE
("incorrect use of&", P
, Entity
(P
));
1513 Error_Msg_N
("array type required in indexed component", P
);
1516 Set_Etype
(N
, Any_Type
);
1520 Index
:= First_Index
(Array_Type
);
1521 while Present
(Index
) and then Present
(Exp
) loop
1522 if not Has_Compatible_Type
(Exp
, Etype
(Index
)) then
1523 Wrong_Type
(Exp
, Etype
(Index
));
1524 Set_Etype
(N
, Any_Type
);
1532 Set_Etype
(N
, Component_Type
(Array_Type
));
1534 if Present
(Index
) then
1536 ("too few subscripts in array reference", First
(Exprs
));
1538 elsif Present
(Exp
) then
1539 Error_Msg_N
("too many subscripts in array reference", Exp
);
1542 end Process_Indexed_Component
;
1544 ----------------------------------------
1545 -- Process_Indexed_Component_Or_Slice --
1546 ----------------------------------------
1548 procedure Process_Indexed_Component_Or_Slice
is
1550 Exp
:= First
(Exprs
);
1551 while Present
(Exp
) loop
1552 Analyze_Expression
(Exp
);
1556 Exp
:= First
(Exprs
);
1558 -- If one index is present, and it is a subtype name, then the
1559 -- node denotes a slice (note that the case of an explicit range
1560 -- for a slice was already built as an N_Slice node in the first
1561 -- place, so that case is not handled here).
1563 -- We use a replace rather than a rewrite here because this is one
1564 -- of the cases in which the tree built by the parser is plain wrong.
1567 and then Is_Entity_Name
(Exp
)
1568 and then Is_Type
(Entity
(Exp
))
1571 Make_Slice
(Sloc
(N
),
1573 Discrete_Range
=> New_Copy
(Exp
)));
1576 -- Otherwise (more than one index present, or single index is not
1577 -- a subtype name), then we have the indexed component case.
1580 Process_Indexed_Component
;
1582 end Process_Indexed_Component_Or_Slice
;
1584 ------------------------------------------
1585 -- Process_Overloaded_Indexed_Component --
1586 ------------------------------------------
1588 procedure Process_Overloaded_Indexed_Component
is
1597 Set_Etype
(N
, Any_Type
);
1599 Get_First_Interp
(P
, I
, It
);
1600 while Present
(It
.Nam
) loop
1603 if Is_Access_Type
(Typ
) then
1604 Typ
:= Designated_Type
(Typ
);
1605 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
1608 if Is_Array_Type
(Typ
) then
1610 -- Got a candidate: verify that index types are compatible
1612 Index
:= First_Index
(Typ
);
1614 Exp
:= First
(Exprs
);
1615 while Present
(Index
) and then Present
(Exp
) loop
1616 if Has_Compatible_Type
(Exp
, Etype
(Index
)) then
1628 if Found
and then No
(Index
) and then No
(Exp
) then
1630 Etype
(Component_Type
(Typ
)),
1631 Etype
(Component_Type
(Typ
)));
1635 Get_Next_Interp
(I
, It
);
1638 if Etype
(N
) = Any_Type
then
1639 Error_Msg_N
("no legal interpetation for indexed component", N
);
1640 Set_Is_Overloaded
(N
, False);
1644 end Process_Overloaded_Indexed_Component
;
1646 -- Start of processing for Analyze_Indexed_Component_Form
1649 -- Get name of array, function or type
1652 if Nkind
(N
) = N_Function_Call
1653 or else Nkind
(N
) = N_Procedure_Call_Statement
1655 -- If P is an explicit dereference whose prefix is of a
1656 -- remote access-to-subprogram type, then N has already
1657 -- been rewritten as a subprogram call and analyzed.
1662 pragma Assert
(Nkind
(N
) = N_Indexed_Component
);
1664 P_T
:= Base_Type
(Etype
(P
));
1666 if Is_Entity_Name
(P
)
1667 or else Nkind
(P
) = N_Operator_Symbol
1671 if Ekind
(U_N
) in Type_Kind
then
1673 -- Reformat node as a type conversion
1675 E
:= Remove_Head
(Exprs
);
1677 if Present
(First
(Exprs
)) then
1679 ("argument of type conversion must be single expression", N
);
1682 Change_Node
(N
, N_Type_Conversion
);
1683 Set_Subtype_Mark
(N
, P
);
1685 Set_Expression
(N
, E
);
1687 -- After changing the node, call for the specific Analysis
1688 -- routine directly, to avoid a double call to the expander.
1690 Analyze_Type_Conversion
(N
);
1694 if Is_Overloadable
(U_N
) then
1695 Process_Function_Call
;
1697 elsif Ekind
(Etype
(P
)) = E_Subprogram_Type
1698 or else (Is_Access_Type
(Etype
(P
))
1700 Ekind
(Designated_Type
(Etype
(P
))) = E_Subprogram_Type
)
1702 -- Call to access_to-subprogram with possible implicit dereference
1704 Process_Function_Call
;
1706 elsif Is_Generic_Subprogram
(U_N
) then
1708 -- A common beginner's (or C++ templates fan) error
1710 Error_Msg_N
("generic subprogram cannot be called", N
);
1711 Set_Etype
(N
, Any_Type
);
1715 Process_Indexed_Component_Or_Slice
;
1718 -- If not an entity name, prefix is an expression that may denote
1719 -- an array or an access-to-subprogram.
1722 if Ekind
(P_T
) = E_Subprogram_Type
1723 or else (Is_Access_Type
(P_T
)
1725 Ekind
(Designated_Type
(P_T
)) = E_Subprogram_Type
)
1727 Process_Function_Call
;
1729 elsif Nkind
(P
) = N_Selected_Component
1730 and then Is_Overloadable
(Entity
(Selector_Name
(P
)))
1732 Process_Function_Call
;
1735 -- Indexed component, slice, or a call to a member of a family
1736 -- entry, which will be converted to an entry call later.
1738 Process_Indexed_Component_Or_Slice
;
1741 end Analyze_Indexed_Component_Form
;
1743 ------------------------
1744 -- Analyze_Logical_Op --
1745 ------------------------
1747 procedure Analyze_Logical_Op
(N
: Node_Id
) is
1748 L
: constant Node_Id
:= Left_Opnd
(N
);
1749 R
: constant Node_Id
:= Right_Opnd
(N
);
1750 Op_Id
: Entity_Id
:= Entity
(N
);
1753 Set_Etype
(N
, Any_Type
);
1754 Candidate_Type
:= Empty
;
1756 Analyze_Expression
(L
);
1757 Analyze_Expression
(R
);
1759 if Present
(Op_Id
) then
1761 if Ekind
(Op_Id
) = E_Operator
then
1762 Find_Boolean_Types
(L
, R
, Op_Id
, N
);
1764 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1768 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
1769 while Present
(Op_Id
) loop
1770 if Ekind
(Op_Id
) = E_Operator
then
1771 Find_Boolean_Types
(L
, R
, Op_Id
, N
);
1773 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1776 Op_Id
:= Homonym
(Op_Id
);
1781 end Analyze_Logical_Op
;
1783 ---------------------------
1784 -- Analyze_Membership_Op --
1785 ---------------------------
1787 procedure Analyze_Membership_Op
(N
: Node_Id
) is
1788 L
: constant Node_Id
:= Left_Opnd
(N
);
1789 R
: constant Node_Id
:= Right_Opnd
(N
);
1791 Index
: Interp_Index
;
1793 Found
: Boolean := False;
1797 procedure Try_One_Interp
(T1
: Entity_Id
);
1798 -- Routine to try one proposed interpretation. Note that the context
1799 -- of the operation plays no role in resolving the arguments, so that
1800 -- if there is more than one interpretation of the operands that is
1801 -- compatible with a membership test, the operation is ambiguous.
1803 --------------------
1804 -- Try_One_Interp --
1805 --------------------
1807 procedure Try_One_Interp
(T1
: Entity_Id
) is
1809 if Has_Compatible_Type
(R
, T1
) then
1811 and then Base_Type
(T1
) /= Base_Type
(T_F
)
1813 It
:= Disambiguate
(L
, I_F
, Index
, Any_Type
);
1815 if It
= No_Interp
then
1816 Ambiguous_Operands
(N
);
1817 Set_Etype
(L
, Any_Type
);
1835 -- Start of processing for Analyze_Membership_Op
1838 Analyze_Expression
(L
);
1840 if Nkind
(R
) = N_Range
1841 or else (Nkind
(R
) = N_Attribute_Reference
1842 and then Attribute_Name
(R
) = Name_Range
)
1846 if not Is_Overloaded
(L
) then
1847 Try_One_Interp
(Etype
(L
));
1850 Get_First_Interp
(L
, Index
, It
);
1851 while Present
(It
.Typ
) loop
1852 Try_One_Interp
(It
.Typ
);
1853 Get_Next_Interp
(Index
, It
);
1857 -- If not a range, it can only be a subtype mark, or else there
1858 -- is a more basic error, to be diagnosed in Find_Type.
1863 if Is_Entity_Name
(R
) then
1864 Check_Fully_Declared
(Entity
(R
), R
);
1868 -- Compatibility between expression and subtype mark or range is
1869 -- checked during resolution. The result of the operation is Boolean
1872 Set_Etype
(N
, Standard_Boolean
);
1873 end Analyze_Membership_Op
;
1875 ----------------------
1876 -- Analyze_Negation --
1877 ----------------------
1879 procedure Analyze_Negation
(N
: Node_Id
) is
1880 R
: constant Node_Id
:= Right_Opnd
(N
);
1881 Op_Id
: Entity_Id
:= Entity
(N
);
1884 Set_Etype
(N
, Any_Type
);
1885 Candidate_Type
:= Empty
;
1887 Analyze_Expression
(R
);
1889 if Present
(Op_Id
) then
1890 if Ekind
(Op_Id
) = E_Operator
then
1891 Find_Negation_Types
(R
, Op_Id
, N
);
1893 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1897 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
1898 while Present
(Op_Id
) loop
1899 if Ekind
(Op_Id
) = E_Operator
then
1900 Find_Negation_Types
(R
, Op_Id
, N
);
1902 Analyze_User_Defined_Unary_Op
(N
, Op_Id
);
1905 Op_Id
:= Homonym
(Op_Id
);
1910 end Analyze_Negation
;
1916 procedure Analyze_Null
(N
: Node_Id
) is
1918 Set_Etype
(N
, Any_Access
);
1921 ----------------------
1922 -- Analyze_One_Call --
1923 ----------------------
1925 procedure Analyze_One_Call
1929 Success
: out Boolean;
1930 Skip_First
: Boolean := False)
1932 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
1933 Prev_T
: constant Entity_Id
:= Etype
(N
);
1936 Is_Indexed
: Boolean := False;
1937 Subp_Type
: constant Entity_Id
:= Etype
(Nam
);
1940 procedure Indicate_Name_And_Type
;
1941 -- If candidate interpretation matches, indicate name and type of
1942 -- result on call node.
1944 ----------------------------
1945 -- Indicate_Name_And_Type --
1946 ----------------------------
1948 procedure Indicate_Name_And_Type
is
1950 Add_One_Interp
(N
, Nam
, Etype
(Nam
));
1953 -- If the prefix of the call is a name, indicate the entity
1954 -- being called. If it is not a name, it is an expression that
1955 -- denotes an access to subprogram or else an entry or family. In
1956 -- the latter case, the name is a selected component, and the entity
1957 -- being called is noted on the selector.
1959 if not Is_Type
(Nam
) then
1960 if Is_Entity_Name
(Name
(N
))
1961 or else Nkind
(Name
(N
)) = N_Operator_Symbol
1963 Set_Entity
(Name
(N
), Nam
);
1965 elsif Nkind
(Name
(N
)) = N_Selected_Component
then
1966 Set_Entity
(Selector_Name
(Name
(N
)), Nam
);
1970 if Debug_Flag_E
and not Report
then
1971 Write_Str
(" Overloaded call ");
1972 Write_Int
(Int
(N
));
1973 Write_Str
(" compatible with ");
1974 Write_Int
(Int
(Nam
));
1977 end Indicate_Name_And_Type
;
1979 -- Start of processing for Analyze_One_Call
1984 -- If the subprogram has no formals, or if all the formals have
1985 -- defaults, and the return type is an array type, the node may
1986 -- denote an indexing of the result of a parameterless call.
1988 if Needs_No_Actuals
(Nam
)
1989 and then Present
(Actuals
)
1991 if Is_Array_Type
(Subp_Type
) then
1992 Is_Indexed
:= Try_Indexed_Call
(N
, Nam
, Subp_Type
);
1994 elsif Is_Access_Type
(Subp_Type
)
1995 and then Is_Array_Type
(Designated_Type
(Subp_Type
))
1998 Try_Indexed_Call
(N
, Nam
, Designated_Type
(Subp_Type
));
2000 -- The prefix can also be a parameterless function that returns an
2001 -- access to subprogram. in which case this is an indirect call.
2003 elsif Is_Access_Type
(Subp_Type
)
2004 and then Ekind
(Designated_Type
(Subp_Type
)) = E_Subprogram_Type
2006 Is_Indexed
:= Try_Indirect_Call
(N
, Nam
, Subp_Type
);
2011 Normalize_Actuals
(N
, Nam
, (Report
and not Is_Indexed
), Norm_OK
);
2015 -- Mismatch in number or names of parameters
2017 if Debug_Flag_E
then
2018 Write_Str
(" normalization fails in call ");
2019 Write_Int
(Int
(N
));
2020 Write_Str
(" with subprogram ");
2021 Write_Int
(Int
(Nam
));
2025 -- If the context expects a function call, discard any interpretation
2026 -- that is a procedure. If the node is not overloaded, leave as is for
2027 -- better error reporting when type mismatch is found.
2029 elsif Nkind
(N
) = N_Function_Call
2030 and then Is_Overloaded
(Name
(N
))
2031 and then Ekind
(Nam
) = E_Procedure
2035 -- Ditto for function calls in a procedure context
2037 elsif Nkind
(N
) = N_Procedure_Call_Statement
2038 and then Is_Overloaded
(Name
(N
))
2039 and then Etype
(Nam
) /= Standard_Void_Type
2043 elsif not Present
(Actuals
) then
2045 -- If Normalize succeeds, then there are default parameters for
2048 Indicate_Name_And_Type
;
2050 elsif Ekind
(Nam
) = E_Operator
then
2051 if Nkind
(N
) = N_Procedure_Call_Statement
then
2055 -- This can occur when the prefix of the call is an operator
2056 -- name or an expanded name whose selector is an operator name.
2058 Analyze_Operator_Call
(N
, Nam
);
2060 if Etype
(N
) /= Prev_T
then
2062 -- There may be a user-defined operator that hides the
2063 -- current interpretation. We must check for this independently
2064 -- of the analysis of the call with the user-defined operation,
2065 -- because the parameter names may be wrong and yet the hiding
2066 -- takes place. Fixes b34014o.
2068 if Is_Overloaded
(Name
(N
)) then
2074 Get_First_Interp
(Name
(N
), I
, It
);
2075 while Present
(It
.Nam
) loop
2076 if Ekind
(It
.Nam
) /= E_Operator
2077 and then Hides_Op
(It
.Nam
, Nam
)
2080 (First_Actual
(N
), Etype
(First_Formal
(It
.Nam
)))
2081 and then (No
(Next_Actual
(First_Actual
(N
)))
2082 or else Has_Compatible_Type
2083 (Next_Actual
(First_Actual
(N
)),
2084 Etype
(Next_Formal
(First_Formal
(It
.Nam
)))))
2086 Set_Etype
(N
, Prev_T
);
2090 Get_Next_Interp
(I
, It
);
2095 -- If operator matches formals, record its name on the call.
2096 -- If the operator is overloaded, Resolve will select the
2097 -- correct one from the list of interpretations. The call
2098 -- node itself carries the first candidate.
2100 Set_Entity
(Name
(N
), Nam
);
2103 elsif Report
and then Etype
(N
) = Any_Type
then
2104 Error_Msg_N
("incompatible arguments for operator", N
);
2108 -- Normalize_Actuals has chained the named associations in the
2109 -- correct order of the formals.
2111 Actual
:= First_Actual
(N
);
2112 Formal
:= First_Formal
(Nam
);
2114 -- If we are analyzing a call rewritten from object notation,
2115 -- skip first actual, which may be rewritten later as an
2116 -- explicit dereference.
2119 Next_Actual
(Actual
);
2120 Next_Formal
(Formal
);
2123 while Present
(Actual
) and then Present
(Formal
) loop
2124 if Nkind
(Parent
(Actual
)) /= N_Parameter_Association
2125 or else Chars
(Selector_Name
(Parent
(Actual
))) = Chars
(Formal
)
2127 if Has_Compatible_Type
(Actual
, Etype
(Formal
)) then
2128 Next_Actual
(Actual
);
2129 Next_Formal
(Formal
);
2132 if Debug_Flag_E
then
2133 Write_Str
(" type checking fails in call ");
2134 Write_Int
(Int
(N
));
2135 Write_Str
(" with formal ");
2136 Write_Int
(Int
(Formal
));
2137 Write_Str
(" in subprogram ");
2138 Write_Int
(Int
(Nam
));
2142 if Report
and not Is_Indexed
then
2144 -- Ada 2005 (AI-251): Complete the error notification
2145 -- to help new Ada 2005 users
2147 if Is_Class_Wide_Type
(Etype
(Formal
))
2148 and then Is_Interface
(Etype
(Etype
(Formal
)))
2149 and then not Interface_Present_In_Ancestor
2150 (Typ
=> Etype
(Actual
),
2151 Iface
=> Etype
(Etype
(Formal
)))
2154 ("(Ada 2005) does not implement interface }",
2155 Actual
, Etype
(Etype
(Formal
)));
2158 Wrong_Type
(Actual
, Etype
(Formal
));
2160 if Nkind
(Actual
) = N_Op_Eq
2161 and then Nkind
(Left_Opnd
(Actual
)) = N_Identifier
2163 Formal
:= First_Formal
(Nam
);
2164 while Present
(Formal
) loop
2165 if Chars
(Left_Opnd
(Actual
)) = Chars
(Formal
) then
2167 ("possible misspelling of `='>`!", Actual
);
2171 Next_Formal
(Formal
);
2175 if All_Errors_Mode
then
2176 Error_Msg_Sloc
:= Sloc
(Nam
);
2178 if Is_Overloadable
(Nam
)
2179 and then Present
(Alias
(Nam
))
2180 and then not Comes_From_Source
(Nam
)
2183 (" =='> in call to &#(inherited)!", Actual
, Nam
);
2185 elsif Ekind
(Nam
) = E_Subprogram_Type
then
2187 Access_To_Subprogram_Typ
:
2188 constant Entity_Id
:=
2190 (Associated_Node_For_Itype
(Nam
));
2193 " =='> in call to dereference of &#!",
2194 Actual
, Access_To_Subprogram_Typ
);
2198 Error_Msg_NE
(" =='> in call to &#!", Actual
, Nam
);
2208 -- Normalize_Actuals has verified that a default value exists
2209 -- for this formal. Current actual names a subsequent formal.
2211 Next_Formal
(Formal
);
2215 -- On exit, all actuals match
2217 Indicate_Name_And_Type
;
2219 end Analyze_One_Call
;
2221 ---------------------------
2222 -- Analyze_Operator_Call --
2223 ---------------------------
2225 procedure Analyze_Operator_Call
(N
: Node_Id
; Op_Id
: Entity_Id
) is
2226 Op_Name
: constant Name_Id
:= Chars
(Op_Id
);
2227 Act1
: constant Node_Id
:= First_Actual
(N
);
2228 Act2
: constant Node_Id
:= Next_Actual
(Act1
);
2231 -- Binary operator case
2233 if Present
(Act2
) then
2235 -- If more than two operands, then not binary operator after all
2237 if Present
(Next_Actual
(Act2
)) then
2240 elsif Op_Name
= Name_Op_Add
2241 or else Op_Name
= Name_Op_Subtract
2242 or else Op_Name
= Name_Op_Multiply
2243 or else Op_Name
= Name_Op_Divide
2244 or else Op_Name
= Name_Op_Mod
2245 or else Op_Name
= Name_Op_Rem
2246 or else Op_Name
= Name_Op_Expon
2248 Find_Arithmetic_Types
(Act1
, Act2
, Op_Id
, N
);
2250 elsif Op_Name
= Name_Op_And
2251 or else Op_Name
= Name_Op_Or
2252 or else Op_Name
= Name_Op_Xor
2254 Find_Boolean_Types
(Act1
, Act2
, Op_Id
, N
);
2256 elsif Op_Name
= Name_Op_Lt
2257 or else Op_Name
= Name_Op_Le
2258 or else Op_Name
= Name_Op_Gt
2259 or else Op_Name
= Name_Op_Ge
2261 Find_Comparison_Types
(Act1
, Act2
, Op_Id
, N
);
2263 elsif Op_Name
= Name_Op_Eq
2264 or else Op_Name
= Name_Op_Ne
2266 Find_Equality_Types
(Act1
, Act2
, Op_Id
, N
);
2268 elsif Op_Name
= Name_Op_Concat
then
2269 Find_Concatenation_Types
(Act1
, Act2
, Op_Id
, N
);
2271 -- Is this else null correct, or should it be an abort???
2277 -- Unary operator case
2280 if Op_Name
= Name_Op_Subtract
or else
2281 Op_Name
= Name_Op_Add
or else
2282 Op_Name
= Name_Op_Abs
2284 Find_Unary_Types
(Act1
, Op_Id
, N
);
2287 Op_Name
= Name_Op_Not
2289 Find_Negation_Types
(Act1
, Op_Id
, N
);
2291 -- Is this else null correct, or should it be an abort???
2297 end Analyze_Operator_Call
;
2299 -------------------------------------------
2300 -- Analyze_Overloaded_Selected_Component --
2301 -------------------------------------------
2303 procedure Analyze_Overloaded_Selected_Component
(N
: Node_Id
) is
2304 Nam
: constant Node_Id
:= Prefix
(N
);
2305 Sel
: constant Node_Id
:= Selector_Name
(N
);
2312 Set_Etype
(Sel
, Any_Type
);
2314 Get_First_Interp
(Nam
, I
, It
);
2315 while Present
(It
.Typ
) loop
2316 if Is_Access_Type
(It
.Typ
) then
2317 T
:= Designated_Type
(It
.Typ
);
2318 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
2323 if Is_Record_Type
(T
) then
2324 Comp
:= First_Entity
(T
);
2325 while Present
(Comp
) loop
2326 if Chars
(Comp
) = Chars
(Sel
)
2327 and then Is_Visible_Component
(Comp
)
2329 Set_Entity_With_Style_Check
(Sel
, Comp
);
2330 Generate_Reference
(Comp
, Sel
);
2332 Set_Etype
(Sel
, Etype
(Comp
));
2333 Add_One_Interp
(N
, Etype
(Comp
), Etype
(Comp
));
2335 -- This also specifies a candidate to resolve the name.
2336 -- Further overloading will be resolved from context.
2338 Set_Etype
(Nam
, It
.Typ
);
2344 elsif Is_Concurrent_Type
(T
) then
2345 Comp
:= First_Entity
(T
);
2346 while Present
(Comp
)
2347 and then Comp
/= First_Private_Entity
(T
)
2349 if Chars
(Comp
) = Chars
(Sel
) then
2350 if Is_Overloadable
(Comp
) then
2351 Add_One_Interp
(Sel
, Comp
, Etype
(Comp
));
2353 Set_Entity_With_Style_Check
(Sel
, Comp
);
2354 Generate_Reference
(Comp
, Sel
);
2357 Set_Etype
(Sel
, Etype
(Comp
));
2358 Set_Etype
(N
, Etype
(Comp
));
2359 Set_Etype
(Nam
, It
.Typ
);
2361 -- For access type case, introduce explicit deference for
2362 -- more uniform treatment of entry calls.
2364 if Is_Access_Type
(Etype
(Nam
)) then
2365 Insert_Explicit_Dereference
(Nam
);
2367 (Warn_On_Dereference
, "?implicit dereference", N
);
2374 Set_Is_Overloaded
(N
, Is_Overloaded
(Sel
));
2377 Get_Next_Interp
(I
, It
);
2380 if Etype
(N
) = Any_Type
then
2381 Error_Msg_NE
("undefined selector& for overloaded prefix", N
, Sel
);
2382 Set_Entity
(Sel
, Any_Id
);
2383 Set_Etype
(Sel
, Any_Type
);
2385 end Analyze_Overloaded_Selected_Component
;
2387 ----------------------------------
2388 -- Analyze_Qualified_Expression --
2389 ----------------------------------
2391 procedure Analyze_Qualified_Expression
(N
: Node_Id
) is
2392 Mark
: constant Entity_Id
:= Subtype_Mark
(N
);
2396 Set_Etype
(N
, Any_Type
);
2400 if T
= Any_Type
then
2404 Check_Fully_Declared
(T
, N
);
2405 Analyze_Expression
(Expression
(N
));
2407 end Analyze_Qualified_Expression
;
2413 procedure Analyze_Range
(N
: Node_Id
) is
2414 L
: constant Node_Id
:= Low_Bound
(N
);
2415 H
: constant Node_Id
:= High_Bound
(N
);
2416 I1
, I2
: Interp_Index
;
2419 procedure Check_Common_Type
(T1
, T2
: Entity_Id
);
2420 -- Verify the compatibility of two types, and choose the
2421 -- non universal one if the other is universal.
2423 procedure Check_High_Bound
(T
: Entity_Id
);
2424 -- Test one interpretation of the low bound against all those
2425 -- of the high bound.
2427 procedure Check_Universal_Expression
(N
: Node_Id
);
2428 -- In Ada83, reject bounds of a universal range that are not
2429 -- literals or entity names.
2431 -----------------------
2432 -- Check_Common_Type --
2433 -----------------------
2435 procedure Check_Common_Type
(T1
, T2
: Entity_Id
) is
2437 if Covers
(T1
, T2
) or else Covers
(T2
, T1
) then
2438 if T1
= Universal_Integer
2439 or else T1
= Universal_Real
2440 or else T1
= Any_Character
2442 Add_One_Interp
(N
, Base_Type
(T2
), Base_Type
(T2
));
2445 Add_One_Interp
(N
, T1
, T1
);
2448 Add_One_Interp
(N
, Base_Type
(T1
), Base_Type
(T1
));
2451 end Check_Common_Type
;
2453 ----------------------
2454 -- Check_High_Bound --
2455 ----------------------
2457 procedure Check_High_Bound
(T
: Entity_Id
) is
2459 if not Is_Overloaded
(H
) then
2460 Check_Common_Type
(T
, Etype
(H
));
2462 Get_First_Interp
(H
, I2
, It2
);
2463 while Present
(It2
.Typ
) loop
2464 Check_Common_Type
(T
, It2
.Typ
);
2465 Get_Next_Interp
(I2
, It2
);
2468 end Check_High_Bound
;
2470 -----------------------------
2471 -- Is_Universal_Expression --
2472 -----------------------------
2474 procedure Check_Universal_Expression
(N
: Node_Id
) is
2476 if Etype
(N
) = Universal_Integer
2477 and then Nkind
(N
) /= N_Integer_Literal
2478 and then not Is_Entity_Name
(N
)
2479 and then Nkind
(N
) /= N_Attribute_Reference
2481 Error_Msg_N
("illegal bound in discrete range", N
);
2483 end Check_Universal_Expression
;
2485 -- Start of processing for Analyze_Range
2488 Set_Etype
(N
, Any_Type
);
2489 Analyze_Expression
(L
);
2490 Analyze_Expression
(H
);
2492 if Etype
(L
) = Any_Type
or else Etype
(H
) = Any_Type
then
2496 if not Is_Overloaded
(L
) then
2497 Check_High_Bound
(Etype
(L
));
2499 Get_First_Interp
(L
, I1
, It1
);
2500 while Present
(It1
.Typ
) loop
2501 Check_High_Bound
(It1
.Typ
);
2502 Get_Next_Interp
(I1
, It1
);
2506 -- If result is Any_Type, then we did not find a compatible pair
2508 if Etype
(N
) = Any_Type
then
2509 Error_Msg_N
("incompatible types in range ", N
);
2513 if Ada_Version
= Ada_83
2515 (Nkind
(Parent
(N
)) = N_Loop_Parameter_Specification
2516 or else Nkind
(Parent
(N
)) = N_Constrained_Array_Definition
)
2518 Check_Universal_Expression
(L
);
2519 Check_Universal_Expression
(H
);
2523 -----------------------
2524 -- Analyze_Reference --
2525 -----------------------
2527 procedure Analyze_Reference
(N
: Node_Id
) is
2528 P
: constant Node_Id
:= Prefix
(N
);
2529 Acc_Type
: Entity_Id
;
2532 Acc_Type
:= Create_Itype
(E_Allocator_Type
, N
);
2533 Set_Etype
(Acc_Type
, Acc_Type
);
2534 Init_Size_Align
(Acc_Type
);
2535 Set_Directly_Designated_Type
(Acc_Type
, Etype
(P
));
2536 Set_Etype
(N
, Acc_Type
);
2537 end Analyze_Reference
;
2539 --------------------------------
2540 -- Analyze_Selected_Component --
2541 --------------------------------
2543 -- Prefix is a record type or a task or protected type. In the
2544 -- later case, the selector must denote a visible entry.
2546 procedure Analyze_Selected_Component
(N
: Node_Id
) is
2547 Name
: constant Node_Id
:= Prefix
(N
);
2548 Sel
: constant Node_Id
:= Selector_Name
(N
);
2550 Entity_List
: Entity_Id
;
2551 Prefix_Type
: Entity_Id
;
2552 Pent
: Entity_Id
:= Empty
;
2557 -- Start of processing for Analyze_Selected_Component
2560 Set_Etype
(N
, Any_Type
);
2562 if Is_Overloaded
(Name
) then
2563 Analyze_Overloaded_Selected_Component
(N
);
2566 elsif Etype
(Name
) = Any_Type
then
2567 Set_Entity
(Sel
, Any_Id
);
2568 Set_Etype
(Sel
, Any_Type
);
2572 Prefix_Type
:= Etype
(Name
);
2575 if Is_Access_Type
(Prefix_Type
) then
2577 -- A RACW object can never be used as prefix of a selected
2578 -- component since that means it is dereferenced without
2579 -- being a controlling operand of a dispatching operation
2582 if Is_Remote_Access_To_Class_Wide_Type
(Prefix_Type
)
2583 and then Comes_From_Source
(N
)
2586 ("invalid dereference of a remote access to class-wide value",
2589 -- Normal case of selected component applied to access type
2592 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
2594 if Is_Entity_Name
(Name
) then
2595 Pent
:= Entity
(Name
);
2596 elsif Nkind
(Name
) = N_Selected_Component
2597 and then Is_Entity_Name
(Selector_Name
(Name
))
2599 Pent
:= Entity
(Selector_Name
(Name
));
2602 Process_Implicit_Dereference_Prefix
(Pent
, Name
);
2605 Prefix_Type
:= Designated_Type
(Prefix_Type
);
2608 if Ekind
(Prefix_Type
) = E_Private_Subtype
then
2609 Prefix_Type
:= Base_Type
(Prefix_Type
);
2612 Entity_List
:= Prefix_Type
;
2614 -- For class-wide types, use the entity list of the root type. This
2615 -- indirection is specially important for private extensions because
2616 -- only the root type get switched (not the class-wide type).
2618 if Is_Class_Wide_Type
(Prefix_Type
) then
2619 Entity_List
:= Root_Type
(Prefix_Type
);
2622 Comp
:= First_Entity
(Entity_List
);
2624 -- If the selector has an original discriminant, the node appears in
2625 -- an instance. Replace the discriminant with the corresponding one
2626 -- in the current discriminated type. For nested generics, this must
2627 -- be done transitively, so note the new original discriminant.
2629 if Nkind
(Sel
) = N_Identifier
2630 and then Present
(Original_Discriminant
(Sel
))
2632 Comp
:= Find_Corresponding_Discriminant
(Sel
, Prefix_Type
);
2634 -- Mark entity before rewriting, for completeness and because
2635 -- subsequent semantic checks might examine the original node.
2637 Set_Entity
(Sel
, Comp
);
2638 Rewrite
(Selector_Name
(N
),
2639 New_Occurrence_Of
(Comp
, Sloc
(N
)));
2640 Set_Original_Discriminant
(Selector_Name
(N
), Comp
);
2641 Set_Etype
(N
, Etype
(Comp
));
2643 if Is_Access_Type
(Etype
(Name
)) then
2644 Insert_Explicit_Dereference
(Name
);
2645 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
2648 elsif Is_Record_Type
(Prefix_Type
) then
2650 -- Find component with given name
2652 while Present
(Comp
) loop
2653 if Chars
(Comp
) = Chars
(Sel
)
2654 and then Is_Visible_Component
(Comp
)
2656 Set_Entity_With_Style_Check
(Sel
, Comp
);
2657 Generate_Reference
(Comp
, Sel
);
2659 Set_Etype
(Sel
, Etype
(Comp
));
2661 if Ekind
(Comp
) = E_Discriminant
then
2662 if Is_Unchecked_Union
(Base_Type
(Prefix_Type
)) then
2664 ("cannot reference discriminant of Unchecked_Union",
2668 if Is_Generic_Type
(Prefix_Type
)
2670 Is_Generic_Type
(Root_Type
(Prefix_Type
))
2672 Set_Original_Discriminant
(Sel
, Comp
);
2676 -- Resolve the prefix early otherwise it is not possible to
2677 -- build the actual subtype of the component: it may need
2678 -- to duplicate this prefix and duplication is only allowed
2679 -- on fully resolved expressions.
2683 -- Ada 2005 (AI-50217): Check wrong use of incomplete type.
2686 -- limited with Pkg;
2688 -- type Acc_Inc is access Pkg.T;
2690 -- N : Natural := X.all.Comp; -- ERROR
2693 if Nkind
(Name
) = N_Explicit_Dereference
2694 and then From_With_Type
(Etype
(Prefix
(Name
)))
2695 and then not Is_Potentially_Use_Visible
(Etype
(Name
))
2698 ("premature usage of incomplete}", Prefix
(Name
),
2699 Etype
(Prefix
(Name
)));
2702 -- We never need an actual subtype for the case of a selection
2703 -- for a indexed component of a non-packed array, since in
2704 -- this case gigi generates all the checks and can find the
2705 -- necessary bounds information.
2707 -- We also do not need an actual subtype for the case of
2708 -- a first, last, length, or range attribute applied to a
2709 -- non-packed array, since gigi can again get the bounds in
2710 -- these cases (gigi cannot handle the packed case, since it
2711 -- has the bounds of the packed array type, not the original
2712 -- bounds of the type). However, if the prefix is itself a
2713 -- selected component, as in a.b.c (i), gigi may regard a.b.c
2714 -- as a dynamic-sized temporary, so we do generate an actual
2715 -- subtype for this case.
2717 Parent_N
:= Parent
(N
);
2719 if not Is_Packed
(Etype
(Comp
))
2721 ((Nkind
(Parent_N
) = N_Indexed_Component
2722 and then Nkind
(Name
) /= N_Selected_Component
)
2724 (Nkind
(Parent_N
) = N_Attribute_Reference
2725 and then (Attribute_Name
(Parent_N
) = Name_First
2727 Attribute_Name
(Parent_N
) = Name_Last
2729 Attribute_Name
(Parent_N
) = Name_Length
2731 Attribute_Name
(Parent_N
) = Name_Range
)))
2733 Set_Etype
(N
, Etype
(Comp
));
2735 -- If full analysis is not enabled, we do not generate an
2736 -- actual subtype, because in the absence of expansion
2737 -- reference to a formal of a protected type, for example,
2738 -- will not be properly transformed, and will lead to
2739 -- out-of-scope references in gigi.
2741 -- In all other cases, we currently build an actual subtype.
2742 -- It seems likely that many of these cases can be avoided,
2743 -- but right now, the front end makes direct references to the
2744 -- bounds (e.g. in generating a length check), and if we do
2745 -- not make an actual subtype, we end up getting a direct
2746 -- reference to a discriminant, which will not do.
2748 elsif Full_Analysis
then
2750 Build_Actual_Subtype_Of_Component
(Etype
(Comp
), N
);
2751 Insert_Action
(N
, Act_Decl
);
2753 if No
(Act_Decl
) then
2754 Set_Etype
(N
, Etype
(Comp
));
2757 -- Component type depends on discriminants. Enter the
2758 -- main attributes of the subtype.
2761 Subt
: constant Entity_Id
:=
2762 Defining_Identifier
(Act_Decl
);
2765 Set_Etype
(Subt
, Base_Type
(Etype
(Comp
)));
2766 Set_Ekind
(Subt
, Ekind
(Etype
(Comp
)));
2767 Set_Etype
(N
, Subt
);
2771 -- If Full_Analysis not enabled, just set the Etype
2774 Set_Etype
(N
, Etype
(Comp
));
2783 -- Ada 2005 (AI-252)
2785 if Ada_Version
>= Ada_05
2786 and then Is_Tagged_Type
(Prefix_Type
)
2787 and then Try_Object_Operation
(N
)
2791 -- If the transformation fails, it will be necessary to redo the
2792 -- analysis with all errors enabled, to indicate candidate
2793 -- interpretations and reasons for each failure ???
2797 elsif Is_Private_Type
(Prefix_Type
) then
2799 -- Allow access only to discriminants of the type. If the type has
2800 -- no full view, gigi uses the parent type for the components, so we
2801 -- do the same here.
2803 if No
(Full_View
(Prefix_Type
)) then
2804 Entity_List
:= Root_Type
(Base_Type
(Prefix_Type
));
2805 Comp
:= First_Entity
(Entity_List
);
2808 while Present
(Comp
) loop
2809 if Chars
(Comp
) = Chars
(Sel
) then
2810 if Ekind
(Comp
) = E_Discriminant
then
2811 Set_Entity_With_Style_Check
(Sel
, Comp
);
2812 Generate_Reference
(Comp
, Sel
);
2814 Set_Etype
(Sel
, Etype
(Comp
));
2815 Set_Etype
(N
, Etype
(Comp
));
2817 if Is_Generic_Type
(Prefix_Type
)
2819 Is_Generic_Type
(Root_Type
(Prefix_Type
))
2821 Set_Original_Discriminant
(Sel
, Comp
);
2826 ("invisible selector for }",
2827 N
, First_Subtype
(Prefix_Type
));
2828 Set_Entity
(Sel
, Any_Id
);
2829 Set_Etype
(N
, Any_Type
);
2838 elsif Is_Concurrent_Type
(Prefix_Type
) then
2840 -- Prefix is concurrent type. Find visible operation with given name
2841 -- For a task, this can only include entries or discriminants if the
2842 -- task type is not an enclosing scope. If it is an enclosing scope
2843 -- (e.g. in an inner task) then all entities are visible, but the
2844 -- prefix must denote the enclosing scope, i.e. can only be a direct
2845 -- name or an expanded name.
2847 Set_Etype
(Sel
, Any_Type
);
2848 In_Scope
:= In_Open_Scopes
(Prefix_Type
);
2850 while Present
(Comp
) loop
2851 if Chars
(Comp
) = Chars
(Sel
) then
2852 if Is_Overloadable
(Comp
) then
2853 Add_One_Interp
(Sel
, Comp
, Etype
(Comp
));
2855 elsif Ekind
(Comp
) = E_Discriminant
2856 or else Ekind
(Comp
) = E_Entry_Family
2858 and then Is_Entity_Name
(Name
))
2860 Set_Entity_With_Style_Check
(Sel
, Comp
);
2861 Generate_Reference
(Comp
, Sel
);
2867 Set_Etype
(Sel
, Etype
(Comp
));
2868 Set_Etype
(N
, Etype
(Comp
));
2870 if Ekind
(Comp
) = E_Discriminant
then
2871 Set_Original_Discriminant
(Sel
, Comp
);
2874 -- For access type case, introduce explicit deference for more
2875 -- uniform treatment of entry calls.
2877 if Is_Access_Type
(Etype
(Name
)) then
2878 Insert_Explicit_Dereference
(Name
);
2880 (Warn_On_Dereference
, "?implicit dereference", N
);
2886 exit when not In_Scope
2888 Comp
= First_Private_Entity
(Base_Type
(Prefix_Type
));
2891 Set_Is_Overloaded
(N
, Is_Overloaded
(Sel
));
2896 Error_Msg_NE
("invalid prefix in selected component&", N
, Sel
);
2899 -- If N still has no type, the component is not defined in the prefix
2901 if Etype
(N
) = Any_Type
then
2903 -- If the prefix is a single concurrent object, use its name in the
2904 -- error message, rather than that of its anonymous type.
2906 if Is_Concurrent_Type
(Prefix_Type
)
2907 and then Is_Internal_Name
(Chars
(Prefix_Type
))
2908 and then not Is_Derived_Type
(Prefix_Type
)
2909 and then Is_Entity_Name
(Name
)
2912 Error_Msg_Node_2
:= Entity
(Name
);
2913 Error_Msg_NE
("no selector& for&", N
, Sel
);
2915 Check_Misspelled_Selector
(Entity_List
, Sel
);
2917 elsif Is_Generic_Type
(Prefix_Type
)
2918 and then Ekind
(Prefix_Type
) = E_Record_Type_With_Private
2919 and then Prefix_Type
/= Etype
(Prefix_Type
)
2920 and then Is_Record_Type
(Etype
(Prefix_Type
))
2922 -- If this is a derived formal type, the parent may have
2923 -- different visibility at this point. Try for an inherited
2924 -- component before reporting an error.
2926 Set_Etype
(Prefix
(N
), Etype
(Prefix_Type
));
2927 Analyze_Selected_Component
(N
);
2930 elsif Ekind
(Prefix_Type
) = E_Record_Subtype_With_Private
2931 and then Is_Generic_Actual_Type
(Prefix_Type
)
2932 and then Present
(Full_View
(Prefix_Type
))
2934 -- Similarly, if this the actual for a formal derived type, the
2935 -- component inherited from the generic parent may not be visible
2936 -- in the actual, but the selected component is legal.
2943 First_Component
(Generic_Parent_Type
(Parent
(Prefix_Type
)));
2944 while Present
(Comp
) loop
2945 if Chars
(Comp
) = Chars
(Sel
) then
2946 Set_Entity_With_Style_Check
(Sel
, Comp
);
2947 Set_Etype
(Sel
, Etype
(Comp
));
2948 Set_Etype
(N
, Etype
(Comp
));
2952 Next_Component
(Comp
);
2955 pragma Assert
(Etype
(N
) /= Any_Type
);
2959 if Ekind
(Prefix_Type
) = E_Record_Subtype
then
2961 -- Check whether this is a component of the base type
2962 -- which is absent from a statically constrained subtype.
2963 -- This will raise constraint error at run-time, but is
2964 -- not a compile-time error. When the selector is illegal
2965 -- for base type as well fall through and generate a
2966 -- compilation error anyway.
2968 Comp
:= First_Component
(Base_Type
(Prefix_Type
));
2969 while Present
(Comp
) loop
2970 if Chars
(Comp
) = Chars
(Sel
)
2971 and then Is_Visible_Component
(Comp
)
2973 Set_Entity_With_Style_Check
(Sel
, Comp
);
2974 Generate_Reference
(Comp
, Sel
);
2975 Set_Etype
(Sel
, Etype
(Comp
));
2976 Set_Etype
(N
, Etype
(Comp
));
2978 -- Emit appropriate message. Gigi will replace the
2979 -- node subsequently with the appropriate Raise.
2981 Apply_Compile_Time_Constraint_Error
2982 (N
, "component not present in }?",
2983 CE_Discriminant_Check_Failed
,
2984 Ent
=> Prefix_Type
, Rep
=> False);
2985 Set_Raises_Constraint_Error
(N
);
2989 Next_Component
(Comp
);
2994 Error_Msg_Node_2
:= First_Subtype
(Prefix_Type
);
2995 Error_Msg_NE
("no selector& for}", N
, Sel
);
2997 Check_Misspelled_Selector
(Entity_List
, Sel
);
3001 Set_Entity
(Sel
, Any_Id
);
3002 Set_Etype
(Sel
, Any_Type
);
3004 end Analyze_Selected_Component
;
3006 ---------------------------
3007 -- Analyze_Short_Circuit --
3008 ---------------------------
3010 procedure Analyze_Short_Circuit
(N
: Node_Id
) is
3011 L
: constant Node_Id
:= Left_Opnd
(N
);
3012 R
: constant Node_Id
:= Right_Opnd
(N
);
3017 Analyze_Expression
(L
);
3018 Analyze_Expression
(R
);
3019 Set_Etype
(N
, Any_Type
);
3021 if not Is_Overloaded
(L
) then
3023 if Root_Type
(Etype
(L
)) = Standard_Boolean
3024 and then Has_Compatible_Type
(R
, Etype
(L
))
3026 Add_One_Interp
(N
, Etype
(L
), Etype
(L
));
3030 Get_First_Interp
(L
, Ind
, It
);
3031 while Present
(It
.Typ
) loop
3032 if Root_Type
(It
.Typ
) = Standard_Boolean
3033 and then Has_Compatible_Type
(R
, It
.Typ
)
3035 Add_One_Interp
(N
, It
.Typ
, It
.Typ
);
3038 Get_Next_Interp
(Ind
, It
);
3042 -- Here we have failed to find an interpretation. Clearly we
3043 -- know that it is not the case that both operands can have
3044 -- an interpretation of Boolean, but this is by far the most
3045 -- likely intended interpretation. So we simply resolve both
3046 -- operands as Booleans, and at least one of these resolutions
3047 -- will generate an error message, and we do not need to give
3048 -- a further error message on the short circuit operation itself.
3050 if Etype
(N
) = Any_Type
then
3051 Resolve
(L
, Standard_Boolean
);
3052 Resolve
(R
, Standard_Boolean
);
3053 Set_Etype
(N
, Standard_Boolean
);
3055 end Analyze_Short_Circuit
;
3061 procedure Analyze_Slice
(N
: Node_Id
) is
3062 P
: constant Node_Id
:= Prefix
(N
);
3063 D
: constant Node_Id
:= Discrete_Range
(N
);
3064 Array_Type
: Entity_Id
;
3066 procedure Analyze_Overloaded_Slice
;
3067 -- If the prefix is overloaded, select those interpretations that
3068 -- yield a one-dimensional array type.
3070 ------------------------------
3071 -- Analyze_Overloaded_Slice --
3072 ------------------------------
3074 procedure Analyze_Overloaded_Slice
is
3080 Set_Etype
(N
, Any_Type
);
3082 Get_First_Interp
(P
, I
, It
);
3083 while Present
(It
.Nam
) loop
3086 if Is_Access_Type
(Typ
) then
3087 Typ
:= Designated_Type
(Typ
);
3088 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
3091 if Is_Array_Type
(Typ
)
3092 and then Number_Dimensions
(Typ
) = 1
3093 and then Has_Compatible_Type
(D
, Etype
(First_Index
(Typ
)))
3095 Add_One_Interp
(N
, Typ
, Typ
);
3098 Get_Next_Interp
(I
, It
);
3101 if Etype
(N
) = Any_Type
then
3102 Error_Msg_N
("expect array type in prefix of slice", N
);
3104 end Analyze_Overloaded_Slice
;
3106 -- Start of processing for Analyze_Slice
3112 if Is_Overloaded
(P
) then
3113 Analyze_Overloaded_Slice
;
3116 Array_Type
:= Etype
(P
);
3117 Set_Etype
(N
, Any_Type
);
3119 if Is_Access_Type
(Array_Type
) then
3120 Array_Type
:= Designated_Type
(Array_Type
);
3121 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
3124 if not Is_Array_Type
(Array_Type
) then
3125 Wrong_Type
(P
, Any_Array
);
3127 elsif Number_Dimensions
(Array_Type
) > 1 then
3129 ("type is not one-dimensional array in slice prefix", N
);
3132 Has_Compatible_Type
(D
, Etype
(First_Index
(Array_Type
)))
3134 Wrong_Type
(D
, Etype
(First_Index
(Array_Type
)));
3137 Set_Etype
(N
, Array_Type
);
3142 -----------------------------
3143 -- Analyze_Type_Conversion --
3144 -----------------------------
3146 procedure Analyze_Type_Conversion
(N
: Node_Id
) is
3147 Expr
: constant Node_Id
:= Expression
(N
);
3151 -- If Conversion_OK is set, then the Etype is already set, and the
3152 -- only processing required is to analyze the expression. This is
3153 -- used to construct certain "illegal" conversions which are not
3154 -- allowed by Ada semantics, but can be handled OK by Gigi, see
3155 -- Sinfo for further details.
3157 if Conversion_OK
(N
) then
3162 -- Otherwise full type analysis is required, as well as some semantic
3163 -- checks to make sure the argument of the conversion is appropriate.
3165 Find_Type
(Subtype_Mark
(N
));
3166 T
:= Entity
(Subtype_Mark
(N
));
3168 Check_Fully_Declared
(T
, N
);
3169 Analyze_Expression
(Expr
);
3170 Validate_Remote_Type_Type_Conversion
(N
);
3172 -- Only remaining step is validity checks on the argument. These
3173 -- are skipped if the conversion does not come from the source.
3175 if not Comes_From_Source
(N
) then
3178 elsif Nkind
(Expr
) = N_Null
then
3179 Error_Msg_N
("argument of conversion cannot be null", N
);
3180 Error_Msg_N
("\use qualified expression instead", N
);
3181 Set_Etype
(N
, Any_Type
);
3183 elsif Nkind
(Expr
) = N_Aggregate
then
3184 Error_Msg_N
("argument of conversion cannot be aggregate", N
);
3185 Error_Msg_N
("\use qualified expression instead", N
);
3187 elsif Nkind
(Expr
) = N_Allocator
then
3188 Error_Msg_N
("argument of conversion cannot be an allocator", N
);
3189 Error_Msg_N
("\use qualified expression instead", N
);
3191 elsif Nkind
(Expr
) = N_String_Literal
then
3192 Error_Msg_N
("argument of conversion cannot be string literal", N
);
3193 Error_Msg_N
("\use qualified expression instead", N
);
3195 elsif Nkind
(Expr
) = N_Character_Literal
then
3196 if Ada_Version
= Ada_83
then
3199 Error_Msg_N
("argument of conversion cannot be character literal",
3201 Error_Msg_N
("\use qualified expression instead", N
);
3204 elsif Nkind
(Expr
) = N_Attribute_Reference
3206 (Attribute_Name
(Expr
) = Name_Access
or else
3207 Attribute_Name
(Expr
) = Name_Unchecked_Access
or else
3208 Attribute_Name
(Expr
) = Name_Unrestricted_Access
)
3210 Error_Msg_N
("argument of conversion cannot be access", N
);
3211 Error_Msg_N
("\use qualified expression instead", N
);
3213 end Analyze_Type_Conversion
;
3215 ----------------------
3216 -- Analyze_Unary_Op --
3217 ----------------------
3219 procedure Analyze_Unary_Op
(N
: Node_Id
) is
3220 R
: constant Node_Id
:= Right_Opnd
(N
);
3221 Op_Id
: Entity_Id
:= Entity
(N
);
3224 Set_Etype
(N
, Any_Type
);
3225 Candidate_Type
:= Empty
;
3227 Analyze_Expression
(R
);
3229 if Present
(Op_Id
) then
3230 if Ekind
(Op_Id
) = E_Operator
then
3231 Find_Unary_Types
(R
, Op_Id
, N
);
3233 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
3237 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
3238 while Present
(Op_Id
) loop
3239 if Ekind
(Op_Id
) = E_Operator
then
3240 if No
(Next_Entity
(First_Entity
(Op_Id
))) then
3241 Find_Unary_Types
(R
, Op_Id
, N
);
3244 elsif Is_Overloadable
(Op_Id
) then
3245 Analyze_User_Defined_Unary_Op
(N
, Op_Id
);
3248 Op_Id
:= Homonym
(Op_Id
);
3253 end Analyze_Unary_Op
;
3255 ----------------------------------
3256 -- Analyze_Unchecked_Expression --
3257 ----------------------------------
3259 procedure Analyze_Unchecked_Expression
(N
: Node_Id
) is
3261 Analyze
(Expression
(N
), Suppress
=> All_Checks
);
3262 Set_Etype
(N
, Etype
(Expression
(N
)));
3263 Save_Interps
(Expression
(N
), N
);
3264 end Analyze_Unchecked_Expression
;
3266 ---------------------------------------
3267 -- Analyze_Unchecked_Type_Conversion --
3268 ---------------------------------------
3270 procedure Analyze_Unchecked_Type_Conversion
(N
: Node_Id
) is
3272 Find_Type
(Subtype_Mark
(N
));
3273 Analyze_Expression
(Expression
(N
));
3274 Set_Etype
(N
, Entity
(Subtype_Mark
(N
)));
3275 end Analyze_Unchecked_Type_Conversion
;
3277 ------------------------------------
3278 -- Analyze_User_Defined_Binary_Op --
3279 ------------------------------------
3281 procedure Analyze_User_Defined_Binary_Op
3286 -- Only do analysis if the operator Comes_From_Source, since otherwise
3287 -- the operator was generated by the expander, and all such operators
3288 -- always refer to the operators in package Standard.
3290 if Comes_From_Source
(N
) then
3292 F1
: constant Entity_Id
:= First_Formal
(Op_Id
);
3293 F2
: constant Entity_Id
:= Next_Formal
(F1
);
3296 -- Verify that Op_Id is a visible binary function. Note that since
3297 -- we know Op_Id is overloaded, potentially use visible means use
3298 -- visible for sure (RM 9.4(11)).
3300 if Ekind
(Op_Id
) = E_Function
3301 and then Present
(F2
)
3302 and then (Is_Immediately_Visible
(Op_Id
)
3303 or else Is_Potentially_Use_Visible
(Op_Id
))
3304 and then Has_Compatible_Type
(Left_Opnd
(N
), Etype
(F1
))
3305 and then Has_Compatible_Type
(Right_Opnd
(N
), Etype
(F2
))
3307 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
3309 if Debug_Flag_E
then
3310 Write_Str
("user defined operator ");
3311 Write_Name
(Chars
(Op_Id
));
3312 Write_Str
(" on node ");
3313 Write_Int
(Int
(N
));
3319 end Analyze_User_Defined_Binary_Op
;
3321 -----------------------------------
3322 -- Analyze_User_Defined_Unary_Op --
3323 -----------------------------------
3325 procedure Analyze_User_Defined_Unary_Op
3330 -- Only do analysis if the operator Comes_From_Source, since otherwise
3331 -- the operator was generated by the expander, and all such operators
3332 -- always refer to the operators in package Standard.
3334 if Comes_From_Source
(N
) then
3336 F
: constant Entity_Id
:= First_Formal
(Op_Id
);
3339 -- Verify that Op_Id is a visible unary function. Note that since
3340 -- we know Op_Id is overloaded, potentially use visible means use
3341 -- visible for sure (RM 9.4(11)).
3343 if Ekind
(Op_Id
) = E_Function
3344 and then No
(Next_Formal
(F
))
3345 and then (Is_Immediately_Visible
(Op_Id
)
3346 or else Is_Potentially_Use_Visible
(Op_Id
))
3347 and then Has_Compatible_Type
(Right_Opnd
(N
), Etype
(F
))
3349 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
3353 end Analyze_User_Defined_Unary_Op
;
3355 ---------------------------
3356 -- Check_Arithmetic_Pair --
3357 ---------------------------
3359 procedure Check_Arithmetic_Pair
3360 (T1
, T2
: Entity_Id
;
3364 Op_Name
: constant Name_Id
:= Chars
(Op_Id
);
3366 function Has_Fixed_Op
(Typ
: Entity_Id
; Op
: Entity_Id
) return Boolean;
3367 -- Check whether the fixed-point type Typ has a user-defined operator
3368 -- (multiplication or division) that should hide the corresponding
3369 -- predefined operator. Used to implement Ada 2005 AI-264, to make
3370 -- such operators more visible and therefore useful.
3372 function Specific_Type
(T1
, T2
: Entity_Id
) return Entity_Id
;
3373 -- Get specific type (i.e. non-universal type if there is one)
3379 function Has_Fixed_Op
(Typ
: Entity_Id
; Op
: Entity_Id
) return Boolean is
3385 -- The operation is treated as primitive if it is declared in the
3386 -- same scope as the type, and therefore on the same entity chain.
3388 Ent
:= Next_Entity
(Typ
);
3389 while Present
(Ent
) loop
3390 if Chars
(Ent
) = Chars
(Op
) then
3391 F1
:= First_Formal
(Ent
);
3392 F2
:= Next_Formal
(F1
);
3394 -- The operation counts as primitive if either operand or
3395 -- result are of the given type, and both operands are fixed
3398 if (Etype
(F1
) = Typ
3399 and then Is_Fixed_Point_Type
(Etype
(F2
)))
3403 and then Is_Fixed_Point_Type
(Etype
(F1
)))
3407 and then Is_Fixed_Point_Type
(Etype
(F1
))
3408 and then Is_Fixed_Point_Type
(Etype
(F2
)))
3424 function Specific_Type
(T1
, T2
: Entity_Id
) return Entity_Id
is
3426 if T1
= Universal_Integer
or else T1
= Universal_Real
then
3427 return Base_Type
(T2
);
3429 return Base_Type
(T1
);
3433 -- Start of processing for Check_Arithmetic_Pair
3436 if Op_Name
= Name_Op_Add
or else Op_Name
= Name_Op_Subtract
then
3438 if Is_Numeric_Type
(T1
)
3439 and then Is_Numeric_Type
(T2
)
3440 and then (Covers
(T1
, T2
) or else Covers
(T2
, T1
))
3442 Add_One_Interp
(N
, Op_Id
, Specific_Type
(T1
, T2
));
3445 elsif Op_Name
= Name_Op_Multiply
or else Op_Name
= Name_Op_Divide
then
3447 if Is_Fixed_Point_Type
(T1
)
3448 and then (Is_Fixed_Point_Type
(T2
)
3449 or else T2
= Universal_Real
)
3451 -- If Treat_Fixed_As_Integer is set then the Etype is already set
3452 -- and no further processing is required (this is the case of an
3453 -- operator constructed by Exp_Fixd for a fixed point operation)
3454 -- Otherwise add one interpretation with universal fixed result
3455 -- If the operator is given in functional notation, it comes
3456 -- from source and Fixed_As_Integer cannot apply.
3458 if (Nkind
(N
) not in N_Op
3459 or else not Treat_Fixed_As_Integer
(N
))
3461 (not (Ada_Version
>= Ada_05
and then Has_Fixed_Op
(T1
, Op_Id
))
3462 or else Nkind
(Parent
(N
)) = N_Type_Conversion
)
3464 Add_One_Interp
(N
, Op_Id
, Universal_Fixed
);
3467 elsif Is_Fixed_Point_Type
(T2
)
3468 and then (Nkind
(N
) not in N_Op
3469 or else not Treat_Fixed_As_Integer
(N
))
3470 and then T1
= Universal_Real
3472 (not (Ada_Version
>= Ada_05
and then Has_Fixed_Op
(T1
, Op_Id
))
3473 or else Nkind
(Parent
(N
)) = N_Type_Conversion
)
3475 Add_One_Interp
(N
, Op_Id
, Universal_Fixed
);
3477 elsif Is_Numeric_Type
(T1
)
3478 and then Is_Numeric_Type
(T2
)
3479 and then (Covers
(T1
, T2
) or else Covers
(T2
, T1
))
3481 Add_One_Interp
(N
, Op_Id
, Specific_Type
(T1
, T2
));
3483 elsif Is_Fixed_Point_Type
(T1
)
3484 and then (Base_Type
(T2
) = Base_Type
(Standard_Integer
)
3485 or else T2
= Universal_Integer
)
3487 Add_One_Interp
(N
, Op_Id
, T1
);
3489 elsif T2
= Universal_Real
3490 and then Base_Type
(T1
) = Base_Type
(Standard_Integer
)
3491 and then Op_Name
= Name_Op_Multiply
3493 Add_One_Interp
(N
, Op_Id
, Any_Fixed
);
3495 elsif T1
= Universal_Real
3496 and then Base_Type
(T2
) = Base_Type
(Standard_Integer
)
3498 Add_One_Interp
(N
, Op_Id
, Any_Fixed
);
3500 elsif Is_Fixed_Point_Type
(T2
)
3501 and then (Base_Type
(T1
) = Base_Type
(Standard_Integer
)
3502 or else T1
= Universal_Integer
)
3503 and then Op_Name
= Name_Op_Multiply
3505 Add_One_Interp
(N
, Op_Id
, T2
);
3507 elsif T1
= Universal_Real
and then T2
= Universal_Integer
then
3508 Add_One_Interp
(N
, Op_Id
, T1
);
3510 elsif T2
= Universal_Real
3511 and then T1
= Universal_Integer
3512 and then Op_Name
= Name_Op_Multiply
3514 Add_One_Interp
(N
, Op_Id
, T2
);
3517 elsif Op_Name
= Name_Op_Mod
or else Op_Name
= Name_Op_Rem
then
3519 -- Note: The fixed-point operands case with Treat_Fixed_As_Integer
3520 -- set does not require any special processing, since the Etype is
3521 -- already set (case of operation constructed by Exp_Fixed).
3523 if Is_Integer_Type
(T1
)
3524 and then (Covers
(T1
, T2
) or else Covers
(T2
, T1
))
3526 Add_One_Interp
(N
, Op_Id
, Specific_Type
(T1
, T2
));
3529 elsif Op_Name
= Name_Op_Expon
then
3530 if Is_Numeric_Type
(T1
)
3531 and then not Is_Fixed_Point_Type
(T1
)
3532 and then (Base_Type
(T2
) = Base_Type
(Standard_Integer
)
3533 or else T2
= Universal_Integer
)
3535 Add_One_Interp
(N
, Op_Id
, Base_Type
(T1
));
3538 else pragma Assert
(Nkind
(N
) in N_Op_Shift
);
3540 -- If not one of the predefined operators, the node may be one
3541 -- of the intrinsic functions. Its kind is always specific, and
3542 -- we can use it directly, rather than the name of the operation.
3544 if Is_Integer_Type
(T1
)
3545 and then (Base_Type
(T2
) = Base_Type
(Standard_Integer
)
3546 or else T2
= Universal_Integer
)
3548 Add_One_Interp
(N
, Op_Id
, Base_Type
(T1
));
3551 end Check_Arithmetic_Pair
;
3553 -------------------------------
3554 -- Check_Misspelled_Selector --
3555 -------------------------------
3557 procedure Check_Misspelled_Selector
3558 (Prefix
: Entity_Id
;
3561 Max_Suggestions
: constant := 2;
3562 Nr_Of_Suggestions
: Natural := 0;
3564 Suggestion_1
: Entity_Id
:= Empty
;
3565 Suggestion_2
: Entity_Id
:= Empty
;
3570 -- All the components of the prefix of selector Sel are matched
3571 -- against Sel and a count is maintained of possible misspellings.
3572 -- When at the end of the analysis there are one or two (not more!)
3573 -- possible misspellings, these misspellings will be suggested as
3574 -- possible correction.
3576 if not (Is_Private_Type
(Prefix
) or else Is_Record_Type
(Prefix
)) then
3578 -- Concurrent types should be handled as well ???
3583 Get_Name_String
(Chars
(Sel
));
3586 S
: constant String (1 .. Name_Len
) := Name_Buffer
(1 .. Name_Len
);
3589 Comp
:= First_Entity
(Prefix
);
3590 while Nr_Of_Suggestions
<= Max_Suggestions
3591 and then Present
(Comp
)
3593 if Is_Visible_Component
(Comp
) then
3594 Get_Name_String
(Chars
(Comp
));
3596 if Is_Bad_Spelling_Of
(Name_Buffer
(1 .. Name_Len
), S
) then
3597 Nr_Of_Suggestions
:= Nr_Of_Suggestions
+ 1;
3599 case Nr_Of_Suggestions
is
3600 when 1 => Suggestion_1
:= Comp
;
3601 when 2 => Suggestion_2
:= Comp
;
3602 when others => exit;
3607 Comp
:= Next_Entity
(Comp
);
3610 -- Report at most two suggestions
3612 if Nr_Of_Suggestions
= 1 then
3613 Error_Msg_NE
("\possible misspelling of&", Sel
, Suggestion_1
);
3615 elsif Nr_Of_Suggestions
= 2 then
3616 Error_Msg_Node_2
:= Suggestion_2
;
3617 Error_Msg_NE
("\possible misspelling of& or&",
3621 end Check_Misspelled_Selector
;
3623 ----------------------
3624 -- Defined_In_Scope --
3625 ----------------------
3627 function Defined_In_Scope
(T
: Entity_Id
; S
: Entity_Id
) return Boolean
3629 S1
: constant Entity_Id
:= Scope
(Base_Type
(T
));
3632 or else (S1
= System_Aux_Id
and then S
= Scope
(S1
));
3633 end Defined_In_Scope
;
3639 procedure Diagnose_Call
(N
: Node_Id
; Nam
: Node_Id
) is
3646 Void_Interp_Seen
: Boolean := False;
3649 if Ada_Version
>= Ada_05
then
3650 Actual
:= First_Actual
(N
);
3651 while Present
(Actual
) loop
3653 -- Ada 2005 (AI-50217): Post an error in case of premature
3654 -- usage of an entity from the limited view.
3656 if not Analyzed
(Etype
(Actual
))
3657 and then From_With_Type
(Etype
(Actual
))
3659 Error_Msg_Qual_Level
:= 1;
3661 ("missing with_clause for scope of imported type&",
3662 Actual
, Etype
(Actual
));
3663 Error_Msg_Qual_Level
:= 0;
3666 Next_Actual
(Actual
);
3670 -- Analyze each candidate call again, with full error reporting
3674 ("no candidate interpretations match the actuals:!", Nam
);
3675 Err_Mode
:= All_Errors_Mode
;
3676 All_Errors_Mode
:= True;
3678 -- If this is a call to an operation of a concurrent type,
3679 -- the failed interpretations have been removed from the
3680 -- name. Recover them to provide full diagnostics.
3682 if Nkind
(Parent
(Nam
)) = N_Selected_Component
then
3683 Set_Entity
(Nam
, Empty
);
3684 New_Nam
:= New_Copy_Tree
(Parent
(Nam
));
3685 Set_Is_Overloaded
(New_Nam
, False);
3686 Set_Is_Overloaded
(Selector_Name
(New_Nam
), False);
3687 Set_Parent
(New_Nam
, Parent
(Parent
(Nam
)));
3688 Analyze_Selected_Component
(New_Nam
);
3689 Get_First_Interp
(Selector_Name
(New_Nam
), X
, It
);
3691 Get_First_Interp
(Nam
, X
, It
);
3694 while Present
(It
.Nam
) loop
3695 if Etype
(It
.Nam
) = Standard_Void_Type
then
3696 Void_Interp_Seen
:= True;
3699 Analyze_One_Call
(N
, It
.Nam
, True, Success
);
3700 Get_Next_Interp
(X
, It
);
3703 if Nkind
(N
) = N_Function_Call
then
3704 Get_First_Interp
(Nam
, X
, It
);
3705 while Present
(It
.Nam
) loop
3706 if Ekind
(It
.Nam
) = E_Function
3707 or else Ekind
(It
.Nam
) = E_Operator
3711 Get_Next_Interp
(X
, It
);
3715 -- If all interpretations are procedures, this deserves a
3716 -- more precise message. Ditto if this appears as the prefix
3717 -- of a selected component, which may be a lexical error.
3720 ("\context requires function call, found procedure name", Nam
);
3722 if Nkind
(Parent
(N
)) = N_Selected_Component
3723 and then N
= Prefix
(Parent
(N
))
3726 "\period should probably be semicolon", Parent
(N
));
3729 elsif Nkind
(N
) = N_Procedure_Call_Statement
3730 and then not Void_Interp_Seen
3733 "\function name found in procedure call", Nam
);
3736 All_Errors_Mode
:= Err_Mode
;
3739 ---------------------------
3740 -- Find_Arithmetic_Types --
3741 ---------------------------
3743 procedure Find_Arithmetic_Types
3748 Index1
: Interp_Index
;
3749 Index2
: Interp_Index
;
3753 procedure Check_Right_Argument
(T
: Entity_Id
);
3754 -- Check right operand of operator
3756 --------------------------
3757 -- Check_Right_Argument --
3758 --------------------------
3760 procedure Check_Right_Argument
(T
: Entity_Id
) is
3762 if not Is_Overloaded
(R
) then
3763 Check_Arithmetic_Pair
(T
, Etype
(R
), Op_Id
, N
);
3765 Get_First_Interp
(R
, Index2
, It2
);
3766 while Present
(It2
.Typ
) loop
3767 Check_Arithmetic_Pair
(T
, It2
.Typ
, Op_Id
, N
);
3768 Get_Next_Interp
(Index2
, It2
);
3771 end Check_Right_Argument
;
3773 -- Start processing for Find_Arithmetic_Types
3776 if not Is_Overloaded
(L
) then
3777 Check_Right_Argument
(Etype
(L
));
3780 Get_First_Interp
(L
, Index1
, It1
);
3781 while Present
(It1
.Typ
) loop
3782 Check_Right_Argument
(It1
.Typ
);
3783 Get_Next_Interp
(Index1
, It1
);
3787 end Find_Arithmetic_Types
;
3789 ------------------------
3790 -- Find_Boolean_Types --
3791 ------------------------
3793 procedure Find_Boolean_Types
3798 Index
: Interp_Index
;
3801 procedure Check_Numeric_Argument
(T
: Entity_Id
);
3802 -- Special case for logical operations one of whose operands is an
3803 -- integer literal. If both are literal the result is any modular type.
3805 ----------------------------
3806 -- Check_Numeric_Argument --
3807 ----------------------------
3809 procedure Check_Numeric_Argument
(T
: Entity_Id
) is
3811 if T
= Universal_Integer
then
3812 Add_One_Interp
(N
, Op_Id
, Any_Modular
);
3814 elsif Is_Modular_Integer_Type
(T
) then
3815 Add_One_Interp
(N
, Op_Id
, T
);
3817 end Check_Numeric_Argument
;
3819 -- Start of processing for Find_Boolean_Types
3822 if not Is_Overloaded
(L
) then
3823 if Etype
(L
) = Universal_Integer
3824 or else Etype
(L
) = Any_Modular
3826 if not Is_Overloaded
(R
) then
3827 Check_Numeric_Argument
(Etype
(R
));
3830 Get_First_Interp
(R
, Index
, It
);
3831 while Present
(It
.Typ
) loop
3832 Check_Numeric_Argument
(It
.Typ
);
3833 Get_Next_Interp
(Index
, It
);
3837 elsif Valid_Boolean_Arg
(Etype
(L
))
3838 and then Has_Compatible_Type
(R
, Etype
(L
))
3840 Add_One_Interp
(N
, Op_Id
, Etype
(L
));
3844 Get_First_Interp
(L
, Index
, It
);
3845 while Present
(It
.Typ
) loop
3846 if Valid_Boolean_Arg
(It
.Typ
)
3847 and then Has_Compatible_Type
(R
, It
.Typ
)
3849 Add_One_Interp
(N
, Op_Id
, It
.Typ
);
3852 Get_Next_Interp
(Index
, It
);
3855 end Find_Boolean_Types
;
3857 ---------------------------
3858 -- Find_Comparison_Types --
3859 ---------------------------
3861 procedure Find_Comparison_Types
3866 Index
: Interp_Index
;
3868 Found
: Boolean := False;
3871 Scop
: Entity_Id
:= Empty
;
3873 procedure Try_One_Interp
(T1
: Entity_Id
);
3874 -- Routine to try one proposed interpretation. Note that the context
3875 -- of the operator plays no role in resolving the arguments, so that
3876 -- if there is more than one interpretation of the operands that is
3877 -- compatible with comparison, the operation is ambiguous.
3879 --------------------
3880 -- Try_One_Interp --
3881 --------------------
3883 procedure Try_One_Interp
(T1
: Entity_Id
) is
3886 -- If the operator is an expanded name, then the type of the operand
3887 -- must be defined in the corresponding scope. If the type is
3888 -- universal, the context will impose the correct type.
3891 and then not Defined_In_Scope
(T1
, Scop
)
3892 and then T1
/= Universal_Integer
3893 and then T1
/= Universal_Real
3894 and then T1
/= Any_String
3895 and then T1
/= Any_Composite
3900 if Valid_Comparison_Arg
(T1
)
3901 and then Has_Compatible_Type
(R
, T1
)
3904 and then Base_Type
(T1
) /= Base_Type
(T_F
)
3906 It
:= Disambiguate
(L
, I_F
, Index
, Any_Type
);
3908 if It
= No_Interp
then
3909 Ambiguous_Operands
(N
);
3910 Set_Etype
(L
, Any_Type
);
3924 Find_Non_Universal_Interpretations
(N
, R
, Op_Id
, T1
);
3929 -- Start processing for Find_Comparison_Types
3932 -- If left operand is aggregate, the right operand has to
3933 -- provide a usable type for it.
3935 if Nkind
(L
) = N_Aggregate
3936 and then Nkind
(R
) /= N_Aggregate
3938 Find_Comparison_Types
(R
, L
, Op_Id
, N
);
3942 if Nkind
(N
) = N_Function_Call
3943 and then Nkind
(Name
(N
)) = N_Expanded_Name
3945 Scop
:= Entity
(Prefix
(Name
(N
)));
3947 -- The prefix may be a package renaming, and the subsequent test
3948 -- requires the original package.
3950 if Ekind
(Scop
) = E_Package
3951 and then Present
(Renamed_Entity
(Scop
))
3953 Scop
:= Renamed_Entity
(Scop
);
3954 Set_Entity
(Prefix
(Name
(N
)), Scop
);
3958 if not Is_Overloaded
(L
) then
3959 Try_One_Interp
(Etype
(L
));
3962 Get_First_Interp
(L
, Index
, It
);
3963 while Present
(It
.Typ
) loop
3964 Try_One_Interp
(It
.Typ
);
3965 Get_Next_Interp
(Index
, It
);
3968 end Find_Comparison_Types
;
3970 ----------------------------------------
3971 -- Find_Non_Universal_Interpretations --
3972 ----------------------------------------
3974 procedure Find_Non_Universal_Interpretations
3980 Index
: Interp_Index
;
3984 if T1
= Universal_Integer
3985 or else T1
= Universal_Real
3987 if not Is_Overloaded
(R
) then
3989 (N
, Op_Id
, Standard_Boolean
, Base_Type
(Etype
(R
)));
3991 Get_First_Interp
(R
, Index
, It
);
3992 while Present
(It
.Typ
) loop
3993 if Covers
(It
.Typ
, T1
) then
3995 (N
, Op_Id
, Standard_Boolean
, Base_Type
(It
.Typ
));
3998 Get_Next_Interp
(Index
, It
);
4002 Add_One_Interp
(N
, Op_Id
, Standard_Boolean
, Base_Type
(T1
));
4004 end Find_Non_Universal_Interpretations
;
4006 ------------------------------
4007 -- Find_Concatenation_Types --
4008 ------------------------------
4010 procedure Find_Concatenation_Types
4015 Op_Type
: constant Entity_Id
:= Etype
(Op_Id
);
4018 if Is_Array_Type
(Op_Type
)
4019 and then not Is_Limited_Type
(Op_Type
)
4021 and then (Has_Compatible_Type
(L
, Op_Type
)
4023 Has_Compatible_Type
(L
, Component_Type
(Op_Type
)))
4025 and then (Has_Compatible_Type
(R
, Op_Type
)
4027 Has_Compatible_Type
(R
, Component_Type
(Op_Type
)))
4029 Add_One_Interp
(N
, Op_Id
, Op_Type
);
4031 end Find_Concatenation_Types
;
4033 -------------------------
4034 -- Find_Equality_Types --
4035 -------------------------
4037 procedure Find_Equality_Types
4042 Index
: Interp_Index
;
4044 Found
: Boolean := False;
4047 Scop
: Entity_Id
:= Empty
;
4049 procedure Try_One_Interp
(T1
: Entity_Id
);
4050 -- The context of the operator plays no role in resolving the
4051 -- arguments, so that if there is more than one interpretation
4052 -- of the operands that is compatible with equality, the construct
4053 -- is ambiguous and an error can be emitted now, after trying to
4054 -- disambiguate, i.e. applying preference rules.
4056 --------------------
4057 -- Try_One_Interp --
4058 --------------------
4060 procedure Try_One_Interp
(T1
: Entity_Id
) is
4062 -- If the operator is an expanded name, then the type of the operand
4063 -- must be defined in the corresponding scope. If the type is
4064 -- universal, the context will impose the correct type. An anonymous
4065 -- type for a 'Access reference is also universal in this sense, as
4066 -- the actual type is obtained from context.
4069 and then not Defined_In_Scope
(T1
, Scop
)
4070 and then T1
/= Universal_Integer
4071 and then T1
/= Universal_Real
4072 and then T1
/= Any_Access
4073 and then T1
/= Any_String
4074 and then T1
/= Any_Composite
4075 and then (Ekind
(T1
) /= E_Access_Subprogram_Type
4076 or else Comes_From_Source
(T1
))
4081 -- Ada 2005 (AI-230): Keep restriction imposed by Ada 83 and 95:
4082 -- Do not allow anonymous access types in equality operators.
4084 if Ada_Version
< Ada_05
4085 and then Ekind
(T1
) = E_Anonymous_Access_Type
4090 if T1
/= Standard_Void_Type
4091 and then not Is_Limited_Type
(T1
)
4092 and then not Is_Limited_Composite
(T1
)
4093 and then Has_Compatible_Type
(R
, T1
)
4096 and then Base_Type
(T1
) /= Base_Type
(T_F
)
4098 It
:= Disambiguate
(L
, I_F
, Index
, Any_Type
);
4100 if It
= No_Interp
then
4101 Ambiguous_Operands
(N
);
4102 Set_Etype
(L
, Any_Type
);
4115 if not Analyzed
(L
) then
4119 Find_Non_Universal_Interpretations
(N
, R
, Op_Id
, T1
);
4121 -- Case of operator was not visible, Etype still set to Any_Type
4123 if Etype
(N
) = Any_Type
then
4129 -- Start of processing for Find_Equality_Types
4132 -- If left operand is aggregate, the right operand has to
4133 -- provide a usable type for it.
4135 if Nkind
(L
) = N_Aggregate
4136 and then Nkind
(R
) /= N_Aggregate
4138 Find_Equality_Types
(R
, L
, Op_Id
, N
);
4142 if Nkind
(N
) = N_Function_Call
4143 and then Nkind
(Name
(N
)) = N_Expanded_Name
4145 Scop
:= Entity
(Prefix
(Name
(N
)));
4147 -- The prefix may be a package renaming, and the subsequent test
4148 -- requires the original package.
4150 if Ekind
(Scop
) = E_Package
4151 and then Present
(Renamed_Entity
(Scop
))
4153 Scop
:= Renamed_Entity
(Scop
);
4154 Set_Entity
(Prefix
(Name
(N
)), Scop
);
4158 if not Is_Overloaded
(L
) then
4159 Try_One_Interp
(Etype
(L
));
4162 Get_First_Interp
(L
, Index
, It
);
4163 while Present
(It
.Typ
) loop
4164 Try_One_Interp
(It
.Typ
);
4165 Get_Next_Interp
(Index
, It
);
4168 end Find_Equality_Types
;
4170 -------------------------
4171 -- Find_Negation_Types --
4172 -------------------------
4174 procedure Find_Negation_Types
4179 Index
: Interp_Index
;
4183 if not Is_Overloaded
(R
) then
4184 if Etype
(R
) = Universal_Integer
then
4185 Add_One_Interp
(N
, Op_Id
, Any_Modular
);
4186 elsif Valid_Boolean_Arg
(Etype
(R
)) then
4187 Add_One_Interp
(N
, Op_Id
, Etype
(R
));
4191 Get_First_Interp
(R
, Index
, It
);
4192 while Present
(It
.Typ
) loop
4193 if Valid_Boolean_Arg
(It
.Typ
) then
4194 Add_One_Interp
(N
, Op_Id
, It
.Typ
);
4197 Get_Next_Interp
(Index
, It
);
4200 end Find_Negation_Types
;
4202 ----------------------
4203 -- Find_Unary_Types --
4204 ----------------------
4206 procedure Find_Unary_Types
4211 Index
: Interp_Index
;
4215 if not Is_Overloaded
(R
) then
4216 if Is_Numeric_Type
(Etype
(R
)) then
4217 Add_One_Interp
(N
, Op_Id
, Base_Type
(Etype
(R
)));
4221 Get_First_Interp
(R
, Index
, It
);
4222 while Present
(It
.Typ
) loop
4223 if Is_Numeric_Type
(It
.Typ
) then
4224 Add_One_Interp
(N
, Op_Id
, Base_Type
(It
.Typ
));
4227 Get_Next_Interp
(Index
, It
);
4230 end Find_Unary_Types
;
4236 function Junk_Operand
(N
: Node_Id
) return Boolean is
4240 if Error_Posted
(N
) then
4244 -- Get entity to be tested
4246 if Is_Entity_Name
(N
)
4247 and then Present
(Entity
(N
))
4251 -- An odd case, a procedure name gets converted to a very peculiar
4252 -- function call, and here is where we detect this happening.
4254 elsif Nkind
(N
) = N_Function_Call
4255 and then Is_Entity_Name
(Name
(N
))
4256 and then Present
(Entity
(Name
(N
)))
4260 -- Another odd case, there are at least some cases of selected
4261 -- components where the selected component is not marked as having
4262 -- an entity, even though the selector does have an entity
4264 elsif Nkind
(N
) = N_Selected_Component
4265 and then Present
(Entity
(Selector_Name
(N
)))
4267 Enode
:= Selector_Name
(N
);
4273 -- Now test the entity we got to see if it is a bad case
4275 case Ekind
(Entity
(Enode
)) is
4279 ("package name cannot be used as operand", Enode
);
4281 when Generic_Unit_Kind
=>
4283 ("generic unit name cannot be used as operand", Enode
);
4287 ("subtype name cannot be used as operand", Enode
);
4291 ("entry name cannot be used as operand", Enode
);
4295 ("procedure name cannot be used as operand", Enode
);
4299 ("exception name cannot be used as operand", Enode
);
4301 when E_Block | E_Label | E_Loop
=>
4303 ("label name cannot be used as operand", Enode
);
4313 --------------------
4314 -- Operator_Check --
4315 --------------------
4317 procedure Operator_Check
(N
: Node_Id
) is
4319 Remove_Abstract_Operations
(N
);
4321 -- Test for case of no interpretation found for operator
4323 if Etype
(N
) = Any_Type
then
4329 R
:= Right_Opnd
(N
);
4331 if Nkind
(N
) in N_Binary_Op
then
4337 -- If either operand has no type, then don't complain further,
4338 -- since this simply means that we have a propagated error.
4341 or else Etype
(R
) = Any_Type
4342 or else (Nkind
(N
) in N_Binary_Op
and then Etype
(L
) = Any_Type
)
4346 -- We explicitly check for the case of concatenation of component
4347 -- with component to avoid reporting spurious matching array types
4348 -- that might happen to be lurking in distant packages (such as
4349 -- run-time packages). This also prevents inconsistencies in the
4350 -- messages for certain ACVC B tests, which can vary depending on
4351 -- types declared in run-time interfaces. Another improvement when
4352 -- aggregates are present is to look for a well-typed operand.
4354 elsif Present
(Candidate_Type
)
4355 and then (Nkind
(N
) /= N_Op_Concat
4356 or else Is_Array_Type
(Etype
(L
))
4357 or else Is_Array_Type
(Etype
(R
)))
4360 if Nkind
(N
) = N_Op_Concat
then
4361 if Etype
(L
) /= Any_Composite
4362 and then Is_Array_Type
(Etype
(L
))
4364 Candidate_Type
:= Etype
(L
);
4366 elsif Etype
(R
) /= Any_Composite
4367 and then Is_Array_Type
(Etype
(R
))
4369 Candidate_Type
:= Etype
(R
);
4374 ("operator for} is not directly visible!",
4375 N
, First_Subtype
(Candidate_Type
));
4376 Error_Msg_N
("use clause would make operation legal!", N
);
4379 -- If either operand is a junk operand (e.g. package name), then
4380 -- post appropriate error messages, but do not complain further.
4382 -- Note that the use of OR in this test instead of OR ELSE
4383 -- is quite deliberate, we may as well check both operands
4384 -- in the binary operator case.
4386 elsif Junk_Operand
(R
)
4387 or (Nkind
(N
) in N_Binary_Op
and then Junk_Operand
(L
))
4391 -- If we have a logical operator, one of whose operands is
4392 -- Boolean, then we know that the other operand cannot resolve
4393 -- to Boolean (since we got no interpretations), but in that
4394 -- case we pretty much know that the other operand should be
4395 -- Boolean, so resolve it that way (generating an error)
4397 elsif Nkind
(N
) = N_Op_And
4401 Nkind
(N
) = N_Op_Xor
4403 if Etype
(L
) = Standard_Boolean
then
4404 Resolve
(R
, Standard_Boolean
);
4406 elsif Etype
(R
) = Standard_Boolean
then
4407 Resolve
(L
, Standard_Boolean
);
4411 -- For an arithmetic operator or comparison operator, if one
4412 -- of the operands is numeric, then we know the other operand
4413 -- is not the same numeric type. If it is a non-numeric type,
4414 -- then probably it is intended to match the other operand.
4416 elsif Nkind
(N
) = N_Op_Add
or else
4417 Nkind
(N
) = N_Op_Divide
or else
4418 Nkind
(N
) = N_Op_Ge
or else
4419 Nkind
(N
) = N_Op_Gt
or else
4420 Nkind
(N
) = N_Op_Le
or else
4421 Nkind
(N
) = N_Op_Lt
or else
4422 Nkind
(N
) = N_Op_Mod
or else
4423 Nkind
(N
) = N_Op_Multiply
or else
4424 Nkind
(N
) = N_Op_Rem
or else
4425 Nkind
(N
) = N_Op_Subtract
4427 if Is_Numeric_Type
(Etype
(L
))
4428 and then not Is_Numeric_Type
(Etype
(R
))
4430 Resolve
(R
, Etype
(L
));
4433 elsif Is_Numeric_Type
(Etype
(R
))
4434 and then not Is_Numeric_Type
(Etype
(L
))
4436 Resolve
(L
, Etype
(R
));
4440 -- Comparisons on A'Access are common enough to deserve a
4443 elsif (Nkind
(N
) = N_Op_Eq
or else
4444 Nkind
(N
) = N_Op_Ne
)
4445 and then Ekind
(Etype
(L
)) = E_Access_Attribute_Type
4446 and then Ekind
(Etype
(R
)) = E_Access_Attribute_Type
4449 ("two access attributes cannot be compared directly", N
);
4451 ("\they must be converted to an explicit type for comparison",
4455 -- Another one for C programmers
4457 elsif Nkind
(N
) = N_Op_Concat
4458 and then Valid_Boolean_Arg
(Etype
(L
))
4459 and then Valid_Boolean_Arg
(Etype
(R
))
4461 Error_Msg_N
("invalid operands for concatenation", N
);
4462 Error_Msg_N
("\maybe AND was meant", N
);
4465 -- A special case for comparison of access parameter with null
4467 elsif Nkind
(N
) = N_Op_Eq
4468 and then Is_Entity_Name
(L
)
4469 and then Nkind
(Parent
(Entity
(L
))) = N_Parameter_Specification
4470 and then Nkind
(Parameter_Type
(Parent
(Entity
(L
)))) =
4472 and then Nkind
(R
) = N_Null
4474 Error_Msg_N
("access parameter is not allowed to be null", L
);
4475 Error_Msg_N
("\(call would raise Constraint_Error)", L
);
4479 -- If we fall through then just give general message. Note
4480 -- that in the following messages, if the operand is overloaded
4481 -- we choose an arbitrary type to complain about, but that is
4482 -- probably more useful than not giving a type at all.
4484 if Nkind
(N
) in N_Unary_Op
then
4485 Error_Msg_Node_2
:= Etype
(R
);
4486 Error_Msg_N
("operator& not defined for}", N
);
4490 if Nkind
(N
) in N_Binary_Op
then
4491 if not Is_Overloaded
(L
)
4492 and then not Is_Overloaded
(R
)
4493 and then Base_Type
(Etype
(L
)) = Base_Type
(Etype
(R
))
4495 Error_Msg_Node_2
:= First_Subtype
(Etype
(R
));
4496 Error_Msg_N
("there is no applicable operator& for}", N
);
4499 Error_Msg_N
("invalid operand types for operator&", N
);
4501 if Nkind
(N
) /= N_Op_Concat
then
4502 Error_Msg_NE
("\left operand has}!", N
, Etype
(L
));
4503 Error_Msg_NE
("\right operand has}!", N
, Etype
(R
));
4512 -----------------------------------------
4513 -- Process_Implicit_Dereference_Prefix --
4514 -----------------------------------------
4516 procedure Process_Implicit_Dereference_Prefix
4524 and then (Operating_Mode
= Check_Semantics
or else not Expander_Active
)
4526 -- We create a dummy reference to E to ensure that the reference
4527 -- is not considered as part of an assignment (an implicit
4528 -- dereference can never assign to its prefix). The Comes_From_Source
4529 -- attribute needs to be propagated for accurate warnings.
4531 Ref
:= New_Reference_To
(E
, Sloc
(P
));
4532 Set_Comes_From_Source
(Ref
, Comes_From_Source
(P
));
4533 Generate_Reference
(E
, Ref
);
4535 end Process_Implicit_Dereference_Prefix
;
4537 --------------------------------
4538 -- Remove_Abstract_Operations --
4539 --------------------------------
4541 procedure Remove_Abstract_Operations
(N
: Node_Id
) is
4544 Abstract_Op
: Entity_Id
:= Empty
;
4546 -- AI-310: If overloaded, remove abstract non-dispatching
4547 -- operations. We activate this if either extensions are
4548 -- enabled, or if the abstract operation in question comes
4549 -- from a predefined file. This latter test allows us to
4550 -- use abstract to make operations invisible to users. In
4551 -- particular, if type Address is non-private and abstract
4552 -- subprograms are used to hide its operators, they will be
4555 type Operand_Position
is (First_Op
, Second_Op
);
4556 Univ_Type
: constant Entity_Id
:= Universal_Interpretation
(N
);
4558 procedure Remove_Address_Interpretations
(Op
: Operand_Position
);
4559 -- Ambiguities may arise when the operands are literal and the
4560 -- address operations in s-auxdec are visible. In that case, remove
4561 -- the interpretation of a literal as Address, to retain the semantics
4562 -- of Address as a private type.
4564 ------------------------------------
4565 -- Remove_Address_Interpretations --
4566 ------------------------------------
4568 procedure Remove_Address_Interpretations
(Op
: Operand_Position
) is
4572 if Is_Overloaded
(N
) then
4573 Get_First_Interp
(N
, I
, It
);
4574 while Present
(It
.Nam
) loop
4575 Formal
:= First_Entity
(It
.Nam
);
4577 if Op
= Second_Op
then
4578 Formal
:= Next_Entity
(Formal
);
4581 if Is_Descendent_Of_Address
(Etype
(Formal
)) then
4585 Get_Next_Interp
(I
, It
);
4588 end Remove_Address_Interpretations
;
4590 -- Start of processing for Remove_Abstract_Operations
4593 if Is_Overloaded
(N
) then
4594 Get_First_Interp
(N
, I
, It
);
4596 while Present
(It
.Nam
) loop
4597 if not Is_Type
(It
.Nam
)
4598 and then Is_Abstract
(It
.Nam
)
4599 and then not Is_Dispatching_Operation
(It
.Nam
)
4601 (Ada_Version
>= Ada_05
4602 or else Is_Predefined_File_Name
4603 (Unit_File_Name
(Get_Source_Unit
(It
.Nam
))))
4606 Abstract_Op
:= It
.Nam
;
4611 Get_Next_Interp
(I
, It
);
4614 if No
(Abstract_Op
) then
4617 elsif Nkind
(N
) in N_Op
then
4619 -- Remove interpretations that treat literals as addresses.
4620 -- This is never appropriate.
4622 if Nkind
(N
) in N_Binary_Op
then
4624 U1
: constant Boolean :=
4625 Present
(Universal_Interpretation
(Right_Opnd
(N
)));
4626 U2
: constant Boolean :=
4627 Present
(Universal_Interpretation
(Left_Opnd
(N
)));
4630 if U1
and then not U2
then
4631 Remove_Address_Interpretations
(Second_Op
);
4633 elsif U2
and then not U1
then
4634 Remove_Address_Interpretations
(First_Op
);
4637 if not (U1
and U2
) then
4639 -- Remove corresponding predefined operator, which is
4640 -- always added to the overload set.
4642 Get_First_Interp
(N
, I
, It
);
4643 while Present
(It
.Nam
) loop
4644 if Scope
(It
.Nam
) = Standard_Standard
4645 and then Base_Type
(It
.Typ
) =
4646 Base_Type
(Etype
(Abstract_Op
))
4651 Get_Next_Interp
(I
, It
);
4654 elsif Is_Overloaded
(N
)
4655 and then Present
(Univ_Type
)
4657 -- If both operands have a universal interpretation,
4658 -- select the predefined operator and discard others.
4660 Get_First_Interp
(N
, I
, It
);
4661 while Present
(It
.Nam
) loop
4662 if Scope
(It
.Nam
) = Standard_Standard
then
4663 Set_Etype
(N
, Univ_Type
);
4664 Set_Entity
(N
, It
.Nam
);
4665 Set_Is_Overloaded
(N
, False);
4669 Get_Next_Interp
(I
, It
);
4675 elsif Nkind
(N
) = N_Function_Call
4677 (Nkind
(Name
(N
)) = N_Operator_Symbol
4679 (Nkind
(Name
(N
)) = N_Expanded_Name
4681 Nkind
(Selector_Name
(Name
(N
))) = N_Operator_Symbol
))
4685 Arg1
: constant Node_Id
:= First
(Parameter_Associations
(N
));
4686 U1
: constant Boolean :=
4687 Present
(Universal_Interpretation
(Arg1
));
4688 U2
: constant Boolean :=
4689 Present
(Next
(Arg1
)) and then
4690 Present
(Universal_Interpretation
(Next
(Arg1
)));
4693 if U1
and then not U2
then
4694 Remove_Address_Interpretations
(First_Op
);
4696 elsif U2
and then not U1
then
4697 Remove_Address_Interpretations
(Second_Op
);
4700 if not (U1
and U2
) then
4701 Get_First_Interp
(N
, I
, It
);
4702 while Present
(It
.Nam
) loop
4703 if Scope
(It
.Nam
) = Standard_Standard
4704 and then It
.Typ
= Base_Type
(Etype
(Abstract_Op
))
4709 Get_Next_Interp
(I
, It
);
4715 -- If the removal has left no valid interpretations, emit
4716 -- error message now and label node as illegal.
4718 if Present
(Abstract_Op
) then
4719 Get_First_Interp
(N
, I
, It
);
4723 -- Removal of abstract operation left no viable candidate
4725 Set_Etype
(N
, Any_Type
);
4726 Error_Msg_Sloc
:= Sloc
(Abstract_Op
);
4728 ("cannot call abstract operation& declared#", N
, Abstract_Op
);
4732 end Remove_Abstract_Operations
;
4734 -----------------------
4735 -- Try_Indirect_Call --
4736 -----------------------
4738 function Try_Indirect_Call
4741 Typ
: Entity_Id
) return Boolean
4748 Normalize_Actuals
(N
, Designated_Type
(Typ
), False, Call_OK
);
4750 Actual
:= First_Actual
(N
);
4751 Formal
:= First_Formal
(Designated_Type
(Typ
));
4752 while Present
(Actual
) and then Present
(Formal
) loop
4753 if not Has_Compatible_Type
(Actual
, Etype
(Formal
)) then
4758 Next_Formal
(Formal
);
4761 if No
(Actual
) and then No
(Formal
) then
4762 Add_One_Interp
(N
, Nam
, Etype
(Designated_Type
(Typ
)));
4764 -- Nam is a candidate interpretation for the name in the call,
4765 -- if it is not an indirect call.
4767 if not Is_Type
(Nam
)
4768 and then Is_Entity_Name
(Name
(N
))
4770 Set_Entity
(Name
(N
), Nam
);
4777 end Try_Indirect_Call
;
4779 ----------------------
4780 -- Try_Indexed_Call --
4781 ----------------------
4783 function Try_Indexed_Call
4786 Typ
: Entity_Id
) return Boolean
4788 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
4793 Actual
:= First
(Actuals
);
4794 Index
:= First_Index
(Typ
);
4795 while Present
(Actual
) and then Present
(Index
) loop
4797 -- If the parameter list has a named association, the expression
4798 -- is definitely a call and not an indexed component.
4800 if Nkind
(Actual
) = N_Parameter_Association
then
4804 if not Has_Compatible_Type
(Actual
, Etype
(Index
)) then
4812 if No
(Actual
) and then No
(Index
) then
4813 Add_One_Interp
(N
, Nam
, Component_Type
(Typ
));
4815 -- Nam is a candidate interpretation for the name in the call,
4816 -- if it is not an indirect call.
4818 if not Is_Type
(Nam
)
4819 and then Is_Entity_Name
(Name
(N
))
4821 Set_Entity
(Name
(N
), Nam
);
4828 end Try_Indexed_Call
;
4830 --------------------------
4831 -- Try_Object_Operation --
4832 --------------------------
4834 function Try_Object_Operation
(N
: Node_Id
) return Boolean is
4835 K
: constant Node_Kind
:= Nkind
(Parent
(N
));
4836 Loc
: constant Source_Ptr
:= Sloc
(N
);
4837 Is_Subprg_Call
: constant Boolean := K
= N_Procedure_Call_Statement
4838 or else K
= N_Function_Call
;
4839 Obj
: constant Node_Id
:= Prefix
(N
);
4840 Subprog
: constant Node_Id
:= Selector_Name
(N
);
4843 New_Call_Node
: Node_Id
:= Empty
;
4844 Node_To_Replace
: Node_Id
;
4845 Obj_Type
: Entity_Id
:= Etype
(Obj
);
4847 procedure Complete_Object_Operation
4848 (Call_Node
: Node_Id
;
4849 Node_To_Replace
: Node_Id
;
4851 -- Make Subprog the name of Call_Node, replace Node_To_Replace with
4852 -- Call_Node, insert the object (or its dereference) as the first actual
4853 -- in the call, and complete the analysis of the call.
4855 procedure Transform_Object_Operation
4856 (Call_Node
: out Node_Id
;
4857 Node_To_Replace
: out Node_Id
;
4859 -- Transform Obj.Operation (X, Y,,) into Operation (Obj, X, Y ..)
4860 -- Call_Node is the resulting subprogram call,
4861 -- Node_To_Replace is either N or the parent of N, and Subprog
4862 -- is a reference to the subprogram we are trying to match.
4864 function Try_Class_Wide_Operation
4865 (Call_Node
: Node_Id
;
4866 Node_To_Replace
: Node_Id
) return Boolean;
4867 -- Traverse all ancestor types looking for a class-wide subprogram
4868 -- for which the current operation is a valid non-dispatching call.
4870 function Try_Primitive_Operation
4871 (Call_Node
: Node_Id
;
4872 Node_To_Replace
: Node_Id
) return Boolean;
4873 -- Traverse the list of primitive subprograms looking for a dispatching
4874 -- operation for which the current node is a valid call .
4876 -------------------------------
4877 -- Complete_Object_Operation --
4878 -------------------------------
4880 procedure Complete_Object_Operation
4881 (Call_Node
: Node_Id
;
4882 Node_To_Replace
: Node_Id
;
4885 First_Actual
: Node_Id
;
4888 First_Actual
:= First
(Parameter_Associations
(Call_Node
));
4889 Set_Name
(Call_Node
, Subprog
);
4891 if Nkind
(N
) = N_Selected_Component
4892 and then not Inside_A_Generic
4894 Set_Entity
(Selector_Name
(N
), Entity
(Subprog
));
4897 -- If need be, rewrite first actual as an explicit dereference
4899 if not Is_Access_Type
(Etype
(First_Formal
(Entity
(Subprog
))))
4900 and then Is_Access_Type
(Etype
(Obj
))
4902 Rewrite
(First_Actual
,
4903 Make_Explicit_Dereference
(Sloc
(Obj
), Obj
));
4904 Analyze
(First_Actual
);
4906 Rewrite
(First_Actual
, Obj
);
4909 Rewrite
(Node_To_Replace
, Call_Node
);
4910 Analyze
(Node_To_Replace
);
4911 end Complete_Object_Operation
;
4913 --------------------------------
4914 -- Transform_Object_Operation --
4915 --------------------------------
4917 procedure Transform_Object_Operation
4918 (Call_Node
: out Node_Id
;
4919 Node_To_Replace
: out Node_Id
;
4922 Parent_Node
: constant Node_Id
:= Parent
(N
);
4924 Dummy
: constant Node_Id
:= New_Copy
(Obj
);
4925 -- Placeholder used as a first parameter in the call, replaced
4926 -- eventually by the proper object.
4932 -- Common case covering 1) Call to a procedure and 2) Call to a
4933 -- function that has some additional actuals.
4935 if (Nkind
(Parent_Node
) = N_Function_Call
4937 Nkind
(Parent_Node
) = N_Procedure_Call_Statement
)
4939 -- N is a selected component node containing the name of the
4940 -- subprogram. If N is not the name of the parent node we must
4941 -- not replace the parent node by the new construct. This case
4942 -- occurs when N is a parameterless call to a subprogram that
4943 -- is an actual parameter of a call to another subprogram. For
4945 -- Some_Subprogram (..., Obj.Operation, ...)
4947 and then Name
(Parent_Node
) = N
4949 Node_To_Replace
:= Parent_Node
;
4951 Actuals
:= Parameter_Associations
(Parent_Node
);
4953 if Present
(Actuals
) then
4954 Prepend
(Dummy
, Actuals
);
4956 Actuals
:= New_List
(Dummy
);
4959 if Nkind
(Parent_Node
) = N_Procedure_Call_Statement
then
4961 Make_Procedure_Call_Statement
(Loc
,
4962 Name
=> New_Copy_Tree
(Subprog
),
4963 Parameter_Associations
=> Actuals
);
4967 Make_Function_Call
(Loc
,
4968 Name
=> New_Copy_Tree
(Subprog
),
4969 Parameter_Associations
=> Actuals
);
4973 -- Before analysis, the function call appears as an indexed component
4974 -- if there are no named associations.
4976 elsif Nkind
(Parent_Node
) = N_Indexed_Component
4977 and then N
= Prefix
(Parent_Node
)
4979 Node_To_Replace
:= Parent_Node
;
4981 Actuals
:= Expressions
(Parent_Node
);
4983 Actual
:= First
(Actuals
);
4984 while Present
(Actual
) loop
4989 Prepend
(Dummy
, Actuals
);
4992 Make_Function_Call
(Loc
,
4993 Name
=> New_Copy_Tree
(Subprog
),
4994 Parameter_Associations
=> Actuals
);
4996 -- Parameterless call: Obj.F is rewritten as F (Obj)
4999 Node_To_Replace
:= N
;
5002 Make_Function_Call
(Loc
,
5003 Name
=> New_Copy_Tree
(Subprog
),
5004 Parameter_Associations
=> New_List
(Dummy
));
5006 end Transform_Object_Operation
;
5008 ------------------------------
5009 -- Try_Class_Wide_Operation --
5010 ------------------------------
5012 function Try_Class_Wide_Operation
5013 (Call_Node
: Node_Id
;
5014 Node_To_Replace
: Node_Id
) return Boolean
5016 Anc_Type
: Entity_Id
;
5022 -- Loop through ancestor types, traverse the homonym chain of the
5023 -- subprogram, and try out those homonyms whose first formal has the
5024 -- class-wide type of the ancestor.
5026 -- Should we verify that it is declared in the same package as the
5027 -- ancestor type ???
5029 Anc_Type
:= Obj_Type
;
5032 Hom
:= Current_Entity
(Subprog
);
5033 while Present
(Hom
) loop
5034 if (Ekind
(Hom
) = E_Procedure
5036 Ekind
(Hom
) = E_Function
)
5037 and then Present
(First_Formal
(Hom
))
5038 and then Etype
(First_Formal
(Hom
)) =
5039 Class_Wide_Type
(Anc_Type
)
5041 Hom_Ref
:= New_Reference_To
(Hom
, Loc
);
5043 Set_Etype
(Call_Node
, Any_Type
);
5044 Set_Parent
(Call_Node
, Parent
(Node_To_Replace
));
5046 Set_Name
(Call_Node
, Hom_Ref
);
5053 Skip_First
=> True);
5057 -- Reformat into the proper call
5059 Complete_Object_Operation
5060 (Call_Node
=> Call_Node
,
5061 Node_To_Replace
=> Node_To_Replace
,
5062 Subprog
=> Hom_Ref
);
5068 Hom
:= Homonym
(Hom
);
5071 -- Examine other ancestor types
5073 exit when Etype
(Anc_Type
) = Anc_Type
;
5074 Anc_Type
:= Etype
(Anc_Type
);
5080 end Try_Class_Wide_Operation
;
5082 -----------------------------
5083 -- Try_Primitive_Operation --
5084 -----------------------------
5086 function Try_Primitive_Operation
5087 (Call_Node
: Node_Id
;
5088 Node_To_Replace
: Node_Id
) return Boolean
5091 Prim_Op
: Entity_Id
;
5092 Prim_Op_Ref
: Node_Id
;
5095 function Valid_First_Argument_Of
(Op
: Entity_Id
) return Boolean;
5096 -- Verify that the prefix, dereferenced if need be, is a valid
5097 -- controlling argument in a call to Op. The remaining actuals
5098 -- are checked in the subsequent call to Analyze_One_Call.
5100 -----------------------------
5101 -- Valid_First_Argument_Of --
5102 -----------------------------
5104 function Valid_First_Argument_Of
(Op
: Entity_Id
) return Boolean is
5105 Typ
: constant Entity_Id
:= Etype
(First_Formal
(Op
));
5110 return Base_Type
(Obj_Type
) = Typ
5112 -- Prefix can be dereferenced
5115 (Is_Access_Type
(Obj_Type
)
5116 and then Designated_Type
(Obj_Type
) = Typ
)
5118 -- Formal is an access parameter, for which the object
5119 -- can provide an access.
5122 (Ekind
(Typ
) = E_Anonymous_Access_Type
5123 and then Designated_Type
(Typ
) = Obj_Type
);
5124 end Valid_First_Argument_Of
;
5126 -- Start of processing for Try_Primitive_Operation
5129 -- Look for the subprogram in the list of primitive operations
5131 Elmt
:= First_Elmt
(Primitive_Operations
(Obj_Type
));
5132 while Present
(Elmt
) loop
5133 Prim_Op
:= Node
(Elmt
);
5135 if Chars
(Prim_Op
) = Chars
(Subprog
)
5136 and then Present
(First_Formal
(Prim_Op
))
5137 and then Valid_First_Argument_Of
(Prim_Op
)
5139 Prim_Op_Ref
:= New_Reference_To
(Prim_Op
, Loc
);
5141 Set_Etype
(Call_Node
, Any_Type
);
5142 Set_Parent
(Call_Node
, Parent
(Node_To_Replace
));
5144 Set_Name
(Call_Node
, Prim_Op_Ref
);
5151 Skip_First
=> True);
5154 Complete_Object_Operation
5155 (Call_Node
=> Call_Node
,
5156 Node_To_Replace
=> Node_To_Replace
,
5157 Subprog
=> Prim_Op_Ref
);
5167 end Try_Primitive_Operation
;
5169 -- Start of processing for Try_Object_Operation
5172 if Is_Access_Type
(Obj_Type
) then
5173 Obj_Type
:= Designated_Type
(Obj_Type
);
5176 if Ekind
(Obj_Type
) = E_Private_Subtype
then
5177 Obj_Type
:= Base_Type
(Obj_Type
);
5180 if Is_Class_Wide_Type
(Obj_Type
) then
5181 Obj_Type
:= Etype
(Class_Wide_Type
(Obj_Type
));
5184 -- The type may have be obtained through a limited_with clause,
5185 -- in which case the primitive operations are available on its
5186 -- non-limited view.
5188 if Ekind
(Obj_Type
) = E_Incomplete_Type
5189 and then From_With_Type
(Obj_Type
)
5191 Obj_Type
:= Non_Limited_View
(Obj_Type
);
5194 if not Is_Tagged_Type
(Obj_Type
) then
5198 -- Analyze the actuals if node is know to be a subprogram call
5200 if Is_Subprg_Call
and then N
= Name
(Parent
(N
)) then
5201 Actual
:= First
(Parameter_Associations
(Parent
(N
)));
5202 while Present
(Actual
) loop
5203 Analyze_Expression
(Actual
);
5208 Analyze_Expression
(Obj
);
5210 -- Build a subprogram call node, using a copy of Obj as its first
5211 -- actual. This is a placeholder, to be replaced by an explicit
5212 -- dereference when needed.
5214 Transform_Object_Operation
5215 (Call_Node
=> New_Call_Node
,
5216 Node_To_Replace
=> Node_To_Replace
,
5217 Subprog
=> Subprog
);
5219 Set_Etype
(New_Call_Node
, Any_Type
);
5220 Set_Parent
(New_Call_Node
, Parent
(Node_To_Replace
));
5223 Try_Primitive_Operation
5224 (Call_Node
=> New_Call_Node
,
5225 Node_To_Replace
=> Node_To_Replace
)
5228 Try_Class_Wide_Operation
5229 (Call_Node
=> New_Call_Node
,
5230 Node_To_Replace
=> Node_To_Replace
);
5231 end Try_Object_Operation
;