1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2003, 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, 59 Temple Place - Suite 330, Boston, --
20 -- MA 02111-1307, 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 Errout
; use Errout
;
31 with Exp_Util
; use Exp_Util
;
32 with Hostparm
; use Hostparm
;
33 with Itypes
; use Itypes
;
34 with Lib
.Xref
; use Lib
.Xref
;
35 with Namet
; use Namet
;
36 with Nlists
; use Nlists
;
37 with Nmake
; use Nmake
;
39 with Output
; use Output
;
40 with Restrict
; use Restrict
;
42 with Sem_Cat
; use Sem_Cat
;
43 with Sem_Ch3
; use Sem_Ch3
;
44 with Sem_Ch8
; use Sem_Ch8
;
45 with Sem_Dist
; use Sem_Dist
;
46 with Sem_Eval
; use Sem_Eval
;
47 with Sem_Res
; use Sem_Res
;
48 with Sem_Util
; use Sem_Util
;
49 with Sem_Type
; use Sem_Type
;
50 with Stand
; use Stand
;
51 with Sinfo
; use Sinfo
;
52 with Snames
; use Snames
;
53 with Tbuild
; use Tbuild
;
55 with GNAT
.Spelling_Checker
; use GNAT
.Spelling_Checker
;
57 package body Sem_Ch4
is
59 -----------------------
60 -- Local Subprograms --
61 -----------------------
63 procedure Analyze_Expression
(N
: Node_Id
);
64 -- For expressions that are not names, this is just a call to analyze.
65 -- If the expression is a name, it may be a call to a parameterless
66 -- function, and if so must be converted into an explicit call node
67 -- and analyzed as such. This deproceduring must be done during the first
68 -- pass of overload resolution, because otherwise a procedure call with
69 -- overloaded actuals may fail to resolve. See 4327-001 for an example.
71 procedure Analyze_Operator_Call
(N
: Node_Id
; Op_Id
: Entity_Id
);
72 -- Analyze a call of the form "+"(x, y), etc. The prefix of the call
73 -- is an operator name or an expanded name whose selector is an operator
74 -- name, and one possible interpretation is as a predefined operator.
76 procedure Analyze_Overloaded_Selected_Component
(N
: Node_Id
);
77 -- If the prefix of a selected_component is overloaded, the proper
78 -- interpretation that yields a record type with the proper selector
79 -- name must be selected.
81 procedure Analyze_User_Defined_Binary_Op
(N
: Node_Id
; Op_Id
: Entity_Id
);
82 -- Procedure to analyze a user defined binary operator, which is resolved
83 -- like a function, but instead of a list of actuals it is presented
84 -- with the left and right operands of an operator node.
86 procedure Analyze_User_Defined_Unary_Op
(N
: Node_Id
; Op_Id
: Entity_Id
);
87 -- Procedure to analyze a user defined unary operator, which is resolved
88 -- like a function, but instead of a list of actuals, it is presented with
89 -- the operand of the operator node.
91 procedure Ambiguous_Operands
(N
: Node_Id
);
92 -- for equality, membership, and comparison operators with overloaded
93 -- arguments, list possible interpretations.
95 procedure Analyze_One_Call
99 Success
: out Boolean);
100 -- Check one interpretation of an overloaded subprogram name for
101 -- compatibility with the types of the actuals in a call. If there is a
102 -- single interpretation which does not match, post error if Report is
105 -- Nam is the entity that provides the formals against which the actuals
106 -- are checked. Nam is either the name of a subprogram, or the internal
107 -- subprogram type constructed for an access_to_subprogram. If the actuals
108 -- are compatible with Nam, then Nam is added to the list of candidate
109 -- interpretations for N, and Success is set to True.
111 procedure Check_Misspelled_Selector
114 -- Give possible misspelling diagnostic if Sel is likely to be
115 -- a misspelling of one of the selectors of the Prefix.
116 -- This is called by Analyze_Selected_Component after producing
117 -- an invalid selector error message.
119 function Defined_In_Scope
(T
: Entity_Id
; S
: Entity_Id
) return Boolean;
120 -- Verify that type T is declared in scope S. Used to find intepretations
121 -- for operators given by expanded names. This is abstracted as a separate
122 -- function to handle extensions to System, where S is System, but T is
123 -- declared in the extension.
125 procedure Find_Arithmetic_Types
129 -- L and R are the operands of an arithmetic operator. Find
130 -- consistent pairs of interpretations for L and R that have a
131 -- numeric type consistent with the semantics of the operator.
133 procedure Find_Comparison_Types
137 -- L and R are operands of a comparison operator. Find consistent
138 -- pairs of interpretations for L and R.
140 procedure Find_Concatenation_Types
144 -- For the four varieties of concatenation.
146 procedure Find_Equality_Types
150 -- Ditto for equality operators.
152 procedure Find_Boolean_Types
156 -- Ditto for binary logical operations.
158 procedure Find_Negation_Types
162 -- Find consistent interpretation for operand of negation operator.
164 procedure Find_Non_Universal_Interpretations
169 -- For equality and comparison operators, the result is always boolean,
170 -- and the legality of the operation is determined from the visibility
171 -- of the operand types. If one of the operands has a universal interpre-
172 -- tation, the legality check uses some compatible non-universal
173 -- interpretation of the other operand. N can be an operator node, or
174 -- a function call whose name is an operator designator.
176 procedure Find_Unary_Types
180 -- Unary arithmetic types: plus, minus, abs.
182 procedure Check_Arithmetic_Pair
186 -- Subsidiary procedure to Find_Arithmetic_Types. T1 and T2 are valid
187 -- types for left and right operand. Determine whether they constitute
188 -- a valid pair for the given operator, and record the corresponding
189 -- interpretation of the operator node. The node N may be an operator
190 -- node (the usual case) or a function call whose prefix is an operator
191 -- designator. In both cases Op_Id is the operator name itself.
193 procedure Diagnose_Call
(N
: Node_Id
; Nam
: Node_Id
);
194 -- Give detailed information on overloaded call where none of the
195 -- interpretations match. N is the call node, Nam the designator for
196 -- the overloaded entity being called.
198 function Junk_Operand
(N
: Node_Id
) return Boolean;
199 -- Test for an operand that is an inappropriate entity (e.g. a package
200 -- name or a label). If so, issue an error message and return True. If
201 -- the operand is not an inappropriate entity kind, return False.
203 procedure Operator_Check
(N
: Node_Id
);
204 -- Verify that an operator has received some valid interpretation.
205 -- If none was found, determine whether a use clause would make the
206 -- operation legal. The variable Candidate_Type (defined in Sem_Type) is
207 -- set for every type compatible with the operator, even if the operator
208 -- for the type is not directly visible. The routine uses this type to emit
209 -- a more informative message.
211 function Try_Indexed_Call
216 -- If a function has defaults for all its actuals, a call to it may
217 -- in fact be an indexing on the result of the call. Try_Indexed_Call
218 -- attempts the interpretation as an indexing, prior to analysis as
219 -- a call. If both are possible, the node is overloaded with both
220 -- interpretations (same symbol but two different types).
222 function Try_Indirect_Call
227 -- Similarly, a function F that needs no actuals can return an access
228 -- to a subprogram, and the call F (X) interpreted as F.all (X). In
229 -- this case the call may be overloaded with both interpretations.
231 ------------------------
232 -- Ambiguous_Operands --
233 ------------------------
235 procedure Ambiguous_Operands
(N
: Node_Id
) is
236 procedure List_Operand_Interps
(Opnd
: Node_Id
);
238 procedure List_Operand_Interps
(Opnd
: Node_Id
) is
243 if Is_Overloaded
(Opnd
) then
244 if Nkind
(Opnd
) in N_Op
then
247 elsif Nkind
(Opnd
) = N_Function_Call
then
258 if Opnd
= Left_Opnd
(N
) then
260 ("\left operand has the following interpretations", N
);
263 ("\right operand has the following interpretations", N
);
267 List_Interps
(Nam
, Err
);
268 end List_Operand_Interps
;
272 or else Nkind
(N
) = N_Not_In
274 Error_Msg_N
("ambiguous operands for membership", N
);
276 elsif Nkind
(N
) = N_Op_Eq
277 or else Nkind
(N
) = N_Op_Ne
279 Error_Msg_N
("ambiguous operands for equality", N
);
282 Error_Msg_N
("ambiguous operands for comparison", N
);
285 if All_Errors_Mode
then
286 List_Operand_Interps
(Left_Opnd
(N
));
287 List_Operand_Interps
(Right_Opnd
(N
));
292 "\use '/'R'E'P'O'R'T'_'E'R'R'O'R'S'='F'U'L'L for details",
295 Error_Msg_N
("\use -gnatf for details", N
);
298 end Ambiguous_Operands
;
300 -----------------------
301 -- Analyze_Aggregate --
302 -----------------------
304 -- Most of the analysis of Aggregates requires that the type be known,
305 -- and is therefore put off until resolution.
307 procedure Analyze_Aggregate
(N
: Node_Id
) is
309 if No
(Etype
(N
)) then
310 Set_Etype
(N
, Any_Composite
);
312 end Analyze_Aggregate
;
314 -----------------------
315 -- Analyze_Allocator --
316 -----------------------
318 procedure Analyze_Allocator
(N
: Node_Id
) is
319 Loc
: constant Source_Ptr
:= Sloc
(N
);
320 Sav_Errs
: constant Nat
:= Serious_Errors_Detected
;
321 E
: Node_Id
:= Expression
(N
);
322 Acc_Type
: Entity_Id
;
326 Check_Restriction
(No_Allocators
, N
);
328 if Nkind
(E
) = N_Qualified_Expression
then
329 Acc_Type
:= Create_Itype
(E_Allocator_Type
, N
);
330 Set_Etype
(Acc_Type
, Acc_Type
);
331 Init_Size_Align
(Acc_Type
);
332 Find_Type
(Subtype_Mark
(E
));
333 Type_Id
:= Entity
(Subtype_Mark
(E
));
334 Check_Fully_Declared
(Type_Id
, N
);
335 Set_Directly_Designated_Type
(Acc_Type
, Type_Id
);
337 if Is_Protected_Type
(Type_Id
) then
338 Check_Restriction
(No_Protected_Type_Allocators
, N
);
341 if Is_Limited_Type
(Type_Id
)
342 and then Comes_From_Source
(N
)
343 and then not In_Instance_Body
345 -- Ada0Y (AI-287): Do not post an error if the expression corres-
346 -- ponds to a limited aggregate. Limited aggregates are checked in
347 -- sem_aggr in a per-component manner (cf. Get_Value subprogram).
349 if Extensions_Allowed
350 and then Nkind
(Expression
(E
)) = N_Aggregate
354 Error_Msg_N
("initialization not allowed for limited types", N
);
355 Explain_Limited_Type
(Type_Id
, N
);
359 Analyze_And_Resolve
(Expression
(E
), Type_Id
);
361 -- A qualified expression requires an exact match of the type,
362 -- class-wide matching is not allowed.
364 if Is_Class_Wide_Type
(Type_Id
)
365 and then Base_Type
(Etype
(Expression
(E
))) /= Base_Type
(Type_Id
)
367 Wrong_Type
(Expression
(E
), Type_Id
);
370 Check_Non_Static_Context
(Expression
(E
));
372 -- We don't analyze the qualified expression itself because it's
373 -- part of the allocator
375 Set_Etype
(E
, Type_Id
);
382 -- If the allocator includes a N_Subtype_Indication then a
383 -- constraint is present, otherwise the node is a subtype mark.
384 -- Introduce an explicit subtype declaration into the tree
385 -- defining some anonymous subtype and rewrite the allocator to
386 -- use this subtype rather than the subtype indication.
388 -- It is important to introduce the explicit subtype declaration
389 -- so that the bounds of the subtype indication are attached to
390 -- the tree in case the allocator is inside a generic unit.
392 if Nkind
(E
) = N_Subtype_Indication
then
394 -- A constraint is only allowed for a composite type in Ada
395 -- 95. In Ada 83, a constraint is also allowed for an
396 -- access-to-composite type, but the constraint is ignored.
398 Find_Type
(Subtype_Mark
(E
));
400 if Is_Elementary_Type
(Entity
(Subtype_Mark
(E
))) then
402 and then Is_Access_Type
(Entity
(Subtype_Mark
(E
))))
404 Error_Msg_N
("constraint not allowed here", E
);
406 if Nkind
(Constraint
(E
))
407 = N_Index_Or_Discriminant_Constraint
410 ("\if qualified expression was meant, " &
411 "use apostrophe", Constraint
(E
));
415 -- Get rid of the bogus constraint:
417 Rewrite
(E
, New_Copy_Tree
(Subtype_Mark
(E
)));
418 Analyze_Allocator
(N
);
422 if Expander_Active
then
424 Make_Defining_Identifier
(Loc
, New_Internal_Name
('S'));
427 Make_Subtype_Declaration
(Loc
,
428 Defining_Identifier
=> Def_Id
,
429 Subtype_Indication
=> Relocate_Node
(E
)));
431 if Sav_Errs
/= Serious_Errors_Detected
432 and then Nkind
(Constraint
(E
))
433 = N_Index_Or_Discriminant_Constraint
436 ("if qualified expression was meant, " &
437 "use apostrophe!", Constraint
(E
));
440 E
:= New_Occurrence_Of
(Def_Id
, Loc
);
441 Rewrite
(Expression
(N
), E
);
445 Type_Id
:= Process_Subtype
(E
, N
);
446 Acc_Type
:= Create_Itype
(E_Allocator_Type
, N
);
447 Set_Etype
(Acc_Type
, Acc_Type
);
448 Init_Size_Align
(Acc_Type
);
449 Set_Directly_Designated_Type
(Acc_Type
, Type_Id
);
450 Check_Fully_Declared
(Type_Id
, N
);
452 -- Check for missing initialization. Skip this check if we already
453 -- had errors on analyzing the allocator, since in that case these
454 -- are probably cascaded errors
456 if Is_Indefinite_Subtype
(Type_Id
)
457 and then Serious_Errors_Detected
= Sav_Errs
459 if Is_Class_Wide_Type
(Type_Id
) then
461 ("initialization required in class-wide allocation", N
);
464 ("initialization required in unconstrained allocation", N
);
470 if Is_Abstract
(Type_Id
) then
471 Error_Msg_N
("cannot allocate abstract object", E
);
474 if Has_Task
(Designated_Type
(Acc_Type
)) then
475 Check_Restriction
(Max_Tasks
, N
);
476 Check_Restriction
(No_Task_Allocators
, N
);
479 Set_Etype
(N
, Acc_Type
);
481 if not Is_Library_Level_Entity
(Acc_Type
) then
482 Check_Restriction
(No_Local_Allocators
, N
);
485 if Serious_Errors_Detected
> Sav_Errs
then
486 Set_Error_Posted
(N
);
487 Set_Etype
(N
, Any_Type
);
489 end Analyze_Allocator
;
491 ---------------------------
492 -- Analyze_Arithmetic_Op --
493 ---------------------------
495 procedure Analyze_Arithmetic_Op
(N
: Node_Id
) is
496 L
: constant Node_Id
:= Left_Opnd
(N
);
497 R
: constant Node_Id
:= Right_Opnd
(N
);
501 Candidate_Type
:= Empty
;
502 Analyze_Expression
(L
);
503 Analyze_Expression
(R
);
505 -- If the entity is already set, the node is the instantiation of
506 -- a generic node with a non-local reference, or was manufactured
507 -- by a call to Make_Op_xxx. In either case the entity is known to
508 -- be valid, and we do not need to collect interpretations, instead
509 -- we just get the single possible interpretation.
513 if Present
(Op_Id
) then
514 if Ekind
(Op_Id
) = E_Operator
then
516 if (Nkind
(N
) = N_Op_Divide
or else
517 Nkind
(N
) = N_Op_Mod
or else
518 Nkind
(N
) = N_Op_Multiply
or else
519 Nkind
(N
) = N_Op_Rem
)
520 and then Treat_Fixed_As_Integer
(N
)
524 Set_Etype
(N
, Any_Type
);
525 Find_Arithmetic_Types
(L
, R
, Op_Id
, N
);
529 Set_Etype
(N
, Any_Type
);
530 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
533 -- Entity is not already set, so we do need to collect interpretations
536 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
537 Set_Etype
(N
, Any_Type
);
539 while Present
(Op_Id
) loop
540 if Ekind
(Op_Id
) = E_Operator
541 and then Present
(Next_Entity
(First_Entity
(Op_Id
)))
543 Find_Arithmetic_Types
(L
, R
, Op_Id
, N
);
545 -- The following may seem superfluous, because an operator cannot
546 -- be generic, but this ignores the cleverness of the author of
549 elsif Is_Overloadable
(Op_Id
) then
550 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
553 Op_Id
:= Homonym
(Op_Id
);
558 end Analyze_Arithmetic_Op
;
564 -- Function, procedure, and entry calls are checked here. The Name
565 -- in the call may be overloaded. The actuals have been analyzed
566 -- and may themselves be overloaded. On exit from this procedure, the node
567 -- N may have zero, one or more interpretations. In the first case an error
568 -- message is produced. In the last case, the node is flagged as overloaded
569 -- and the interpretations are collected in All_Interp.
571 -- If the name is an Access_To_Subprogram, it cannot be overloaded, but
572 -- the type-checking is similar to that of other calls.
574 procedure Analyze_Call
(N
: Node_Id
) is
575 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
576 Nam
: Node_Id
:= Name
(N
);
580 Success
: Boolean := False;
582 function Name_Denotes_Function
return Boolean;
583 -- If the type of the name is an access to subprogram, this may be
584 -- the type of a name, or the return type of the function being called.
585 -- If the name is not an entity then it can denote a protected function.
586 -- Until we distinguish Etype from Return_Type, we must use this
587 -- routine to resolve the meaning of the name in the call.
589 ---------------------------
590 -- Name_Denotes_Function --
591 ---------------------------
593 function Name_Denotes_Function
return Boolean is
595 if Is_Entity_Name
(Nam
) then
596 return Ekind
(Entity
(Nam
)) = E_Function
;
598 elsif Nkind
(Nam
) = N_Selected_Component
then
599 return Ekind
(Entity
(Selector_Name
(Nam
))) = E_Function
;
604 end Name_Denotes_Function
;
606 -- Start of processing for Analyze_Call
609 -- Initialize the type of the result of the call to the error type,
610 -- which will be reset if the type is successfully resolved.
612 Set_Etype
(N
, Any_Type
);
614 if not Is_Overloaded
(Nam
) then
616 -- Only one interpretation to check
618 if Ekind
(Etype
(Nam
)) = E_Subprogram_Type
then
619 Nam_Ent
:= Etype
(Nam
);
621 elsif Is_Access_Type
(Etype
(Nam
))
622 and then Ekind
(Designated_Type
(Etype
(Nam
))) = E_Subprogram_Type
623 and then not Name_Denotes_Function
625 Nam_Ent
:= Designated_Type
(Etype
(Nam
));
626 Insert_Explicit_Dereference
(Nam
);
628 -- Selected component case. Simple entry or protected operation,
629 -- where the entry name is given by the selector name.
631 elsif Nkind
(Nam
) = N_Selected_Component
then
632 Nam_Ent
:= Entity
(Selector_Name
(Nam
));
634 if Ekind
(Nam_Ent
) /= E_Entry
635 and then Ekind
(Nam_Ent
) /= E_Entry_Family
636 and then Ekind
(Nam_Ent
) /= E_Function
637 and then Ekind
(Nam_Ent
) /= E_Procedure
639 Error_Msg_N
("name in call is not a callable entity", Nam
);
640 Set_Etype
(N
, Any_Type
);
644 -- If the name is an Indexed component, it can be a call to a member
645 -- of an entry family. The prefix must be a selected component whose
646 -- selector is the entry. Analyze_Procedure_Call normalizes several
647 -- kinds of call into this form.
649 elsif Nkind
(Nam
) = N_Indexed_Component
then
651 if Nkind
(Prefix
(Nam
)) = N_Selected_Component
then
652 Nam_Ent
:= Entity
(Selector_Name
(Prefix
(Nam
)));
655 Error_Msg_N
("name in call is not a callable entity", Nam
);
656 Set_Etype
(N
, Any_Type
);
661 elsif not Is_Entity_Name
(Nam
) then
662 Error_Msg_N
("name in call is not a callable entity", Nam
);
663 Set_Etype
(N
, Any_Type
);
667 Nam_Ent
:= Entity
(Nam
);
669 -- If no interpretations, give error message
671 if not Is_Overloadable
(Nam_Ent
) then
673 L
: constant Boolean := Is_List_Member
(N
);
674 K
: constant Node_Kind
:= Nkind
(Parent
(N
));
677 -- If the node is in a list whose parent is not an
678 -- expression then it must be an attempted procedure call.
680 if L
and then K
not in N_Subexpr
then
681 if Ekind
(Entity
(Nam
)) = E_Generic_Procedure
then
683 ("must instantiate generic procedure& before call",
687 ("procedure or entry name expected", Nam
);
690 -- Check for tasking cases where only an entry call will do
693 and then (K
= N_Entry_Call_Alternative
694 or else K
= N_Triggering_Alternative
)
696 Error_Msg_N
("entry name expected", Nam
);
698 -- Otherwise give general error message
701 Error_Msg_N
("invalid prefix in call", Nam
);
709 Analyze_One_Call
(N
, Nam_Ent
, True, Success
);
712 -- An overloaded selected component must denote overloaded
713 -- operations of a concurrent type. The interpretations are
714 -- attached to the simple name of those operations.
716 if Nkind
(Nam
) = N_Selected_Component
then
717 Nam
:= Selector_Name
(Nam
);
720 Get_First_Interp
(Nam
, X
, It
);
722 while Present
(It
.Nam
) loop
725 -- Name may be call that returns an access to subprogram, or more
726 -- generally an overloaded expression one of whose interpretations
727 -- yields an access to subprogram. If the name is an entity, we
728 -- do not dereference, because the node is a call that returns
729 -- the access type: note difference between f(x), where the call
730 -- may return an access subprogram type, and f(x)(y), where the
731 -- type returned by the call to f is implicitly dereferenced to
732 -- analyze the outer call.
734 if Is_Access_Type
(Nam_Ent
) then
735 Nam_Ent
:= Designated_Type
(Nam_Ent
);
737 elsif Is_Access_Type
(Etype
(Nam_Ent
))
738 and then not Is_Entity_Name
(Nam
)
739 and then Ekind
(Designated_Type
(Etype
(Nam_Ent
)))
742 Nam_Ent
:= Designated_Type
(Etype
(Nam_Ent
));
745 Analyze_One_Call
(N
, Nam_Ent
, False, Success
);
747 -- If the interpretation succeeds, mark the proper type of the
748 -- prefix (any valid candidate will do). If not, remove the
749 -- candidate interpretation. This only needs to be done for
750 -- overloaded protected operations, for other entities disambi-
751 -- guation is done directly in Resolve.
754 Set_Etype
(Nam
, It
.Typ
);
756 elsif Nkind
(Name
(N
)) = N_Selected_Component
757 or else Nkind
(Name
(N
)) = N_Function_Call
762 Get_Next_Interp
(X
, It
);
765 -- If the name is the result of a function call, it can only
766 -- be a call to a function returning an access to subprogram.
767 -- Insert explicit dereference.
769 if Nkind
(Nam
) = N_Function_Call
then
770 Insert_Explicit_Dereference
(Nam
);
773 if Etype
(N
) = Any_Type
then
775 -- None of the interpretations is compatible with the actuals
777 Diagnose_Call
(N
, Nam
);
779 -- Special checks for uninstantiated put routines
781 if Nkind
(N
) = N_Procedure_Call_Statement
782 and then Is_Entity_Name
(Nam
)
783 and then Chars
(Nam
) = Name_Put
784 and then List_Length
(Actuals
) = 1
787 Arg
: constant Node_Id
:= First
(Actuals
);
791 if Nkind
(Arg
) = N_Parameter_Association
then
792 Typ
:= Etype
(Explicit_Actual_Parameter
(Arg
));
797 if Is_Signed_Integer_Type
(Typ
) then
799 ("possible missing instantiation of " &
800 "'Text_'I'O.'Integer_'I'O!", Nam
);
802 elsif Is_Modular_Integer_Type
(Typ
) then
804 ("possible missing instantiation of " &
805 "'Text_'I'O.'Modular_'I'O!", Nam
);
807 elsif Is_Floating_Point_Type
(Typ
) then
809 ("possible missing instantiation of " &
810 "'Text_'I'O.'Float_'I'O!", Nam
);
812 elsif Is_Ordinary_Fixed_Point_Type
(Typ
) then
814 ("possible missing instantiation of " &
815 "'Text_'I'O.'Fixed_'I'O!", Nam
);
817 elsif Is_Decimal_Fixed_Point_Type
(Typ
) then
819 ("possible missing instantiation of " &
820 "'Text_'I'O.'Decimal_'I'O!", Nam
);
822 elsif Is_Enumeration_Type
(Typ
) then
824 ("possible missing instantiation of " &
825 "'Text_'I'O.'Enumeration_'I'O!", Nam
);
830 elsif not Is_Overloaded
(N
)
831 and then Is_Entity_Name
(Nam
)
833 -- Resolution yields a single interpretation. Verify that
834 -- is has the proper capitalization.
836 Set_Entity_With_Style_Check
(Nam
, Entity
(Nam
));
837 Generate_Reference
(Entity
(Nam
), Nam
);
839 Set_Etype
(Nam
, Etype
(Entity
(Nam
)));
846 ---------------------------
847 -- Analyze_Comparison_Op --
848 ---------------------------
850 procedure Analyze_Comparison_Op
(N
: Node_Id
) is
851 L
: constant Node_Id
:= Left_Opnd
(N
);
852 R
: constant Node_Id
:= Right_Opnd
(N
);
853 Op_Id
: Entity_Id
:= Entity
(N
);
856 Set_Etype
(N
, Any_Type
);
857 Candidate_Type
:= Empty
;
859 Analyze_Expression
(L
);
860 Analyze_Expression
(R
);
862 if Present
(Op_Id
) then
864 if Ekind
(Op_Id
) = E_Operator
then
865 Find_Comparison_Types
(L
, R
, Op_Id
, N
);
867 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
870 if Is_Overloaded
(L
) then
871 Set_Etype
(L
, Intersect_Types
(L
, R
));
875 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
877 while Present
(Op_Id
) loop
879 if Ekind
(Op_Id
) = E_Operator
then
880 Find_Comparison_Types
(L
, R
, Op_Id
, N
);
882 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
885 Op_Id
:= Homonym
(Op_Id
);
890 end Analyze_Comparison_Op
;
892 ---------------------------
893 -- Analyze_Concatenation --
894 ---------------------------
896 -- If the only one-dimensional array type in scope is String,
897 -- this is the resulting type of the operation. Otherwise there
898 -- will be a concatenation operation defined for each user-defined
899 -- one-dimensional array.
901 procedure Analyze_Concatenation
(N
: Node_Id
) is
902 L
: constant Node_Id
:= Left_Opnd
(N
);
903 R
: constant Node_Id
:= Right_Opnd
(N
);
904 Op_Id
: Entity_Id
:= Entity
(N
);
909 Set_Etype
(N
, Any_Type
);
910 Candidate_Type
:= Empty
;
912 Analyze_Expression
(L
);
913 Analyze_Expression
(R
);
915 -- If the entity is present, the node appears in an instance,
916 -- and denotes a predefined concatenation operation. The resulting
917 -- type is obtained from the arguments when possible. If the arguments
918 -- are aggregates, the array type and the concatenation type must be
921 if Present
(Op_Id
) then
922 if Ekind
(Op_Id
) = E_Operator
then
924 LT
:= Base_Type
(Etype
(L
));
925 RT
:= Base_Type
(Etype
(R
));
927 if Is_Array_Type
(LT
)
928 and then (RT
= LT
or else RT
= Base_Type
(Component_Type
(LT
)))
930 Add_One_Interp
(N
, Op_Id
, LT
);
932 elsif Is_Array_Type
(RT
)
933 and then LT
= Base_Type
(Component_Type
(RT
))
935 Add_One_Interp
(N
, Op_Id
, RT
);
937 -- If one operand is a string type or a user-defined array type,
938 -- and the other is a literal, result is of the specific type.
941 (Root_Type
(LT
) = Standard_String
942 or else Scope
(LT
) /= Standard_Standard
)
943 and then Etype
(R
) = Any_String
945 Add_One_Interp
(N
, Op_Id
, LT
);
948 (Root_Type
(RT
) = Standard_String
949 or else Scope
(RT
) /= Standard_Standard
)
950 and then Etype
(L
) = Any_String
952 Add_One_Interp
(N
, Op_Id
, RT
);
954 elsif not Is_Generic_Type
(Etype
(Op_Id
)) then
955 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
958 -- Type and its operations must be visible.
960 Set_Entity
(N
, Empty
);
961 Analyze_Concatenation
(N
);
966 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
970 Op_Id
:= Get_Name_Entity_Id
(Name_Op_Concat
);
972 while Present
(Op_Id
) loop
973 if Ekind
(Op_Id
) = E_Operator
then
974 Find_Concatenation_Types
(L
, R
, Op_Id
, N
);
976 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
979 Op_Id
:= Homonym
(Op_Id
);
984 end Analyze_Concatenation
;
986 ------------------------------------
987 -- Analyze_Conditional_Expression --
988 ------------------------------------
990 procedure Analyze_Conditional_Expression
(N
: Node_Id
) is
991 Condition
: constant Node_Id
:= First
(Expressions
(N
));
992 Then_Expr
: constant Node_Id
:= Next
(Condition
);
993 Else_Expr
: constant Node_Id
:= Next
(Then_Expr
);
996 Analyze_Expression
(Condition
);
997 Analyze_Expression
(Then_Expr
);
998 Analyze_Expression
(Else_Expr
);
999 Set_Etype
(N
, Etype
(Then_Expr
));
1000 end Analyze_Conditional_Expression
;
1002 -------------------------
1003 -- Analyze_Equality_Op --
1004 -------------------------
1006 procedure Analyze_Equality_Op
(N
: Node_Id
) is
1007 Loc
: constant Source_Ptr
:= Sloc
(N
);
1008 L
: constant Node_Id
:= Left_Opnd
(N
);
1009 R
: constant Node_Id
:= Right_Opnd
(N
);
1013 Set_Etype
(N
, Any_Type
);
1014 Candidate_Type
:= Empty
;
1016 Analyze_Expression
(L
);
1017 Analyze_Expression
(R
);
1019 -- If the entity is set, the node is a generic instance with a non-local
1020 -- reference to the predefined operator or to a user-defined function.
1021 -- It can also be an inequality that is expanded into the negation of a
1022 -- call to a user-defined equality operator.
1024 -- For the predefined case, the result is Boolean, regardless of the
1025 -- type of the operands. The operands may even be limited, if they are
1026 -- generic actuals. If they are overloaded, label the left argument with
1027 -- the common type that must be present, or with the type of the formal
1028 -- of the user-defined function.
1030 if Present
(Entity
(N
)) then
1032 Op_Id
:= Entity
(N
);
1034 if Ekind
(Op_Id
) = E_Operator
then
1035 Add_One_Interp
(N
, Op_Id
, Standard_Boolean
);
1037 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1040 if Is_Overloaded
(L
) then
1042 if Ekind
(Op_Id
) = E_Operator
then
1043 Set_Etype
(L
, Intersect_Types
(L
, R
));
1045 Set_Etype
(L
, Etype
(First_Formal
(Op_Id
)));
1050 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
1052 while Present
(Op_Id
) loop
1054 if Ekind
(Op_Id
) = E_Operator
then
1055 Find_Equality_Types
(L
, R
, Op_Id
, N
);
1057 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1060 Op_Id
:= Homonym
(Op_Id
);
1064 -- If there was no match, and the operator is inequality, this may
1065 -- be a case where inequality has not been made explicit, as for
1066 -- tagged types. Analyze the node as the negation of an equality
1067 -- operation. This cannot be done earlier, because before analysis
1068 -- we cannot rule out the presence of an explicit inequality.
1070 if Etype
(N
) = Any_Type
1071 and then Nkind
(N
) = N_Op_Ne
1073 Op_Id
:= Get_Name_Entity_Id
(Name_Op_Eq
);
1075 while Present
(Op_Id
) loop
1077 if Ekind
(Op_Id
) = E_Operator
then
1078 Find_Equality_Types
(L
, R
, Op_Id
, N
);
1080 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1083 Op_Id
:= Homonym
(Op_Id
);
1086 if Etype
(N
) /= Any_Type
then
1087 Op_Id
:= Entity
(N
);
1093 Left_Opnd
=> Relocate_Node
(Left_Opnd
(N
)),
1094 Right_Opnd
=> Relocate_Node
(Right_Opnd
(N
)))));
1096 Set_Entity
(Right_Opnd
(N
), Op_Id
);
1102 end Analyze_Equality_Op
;
1104 ----------------------------------
1105 -- Analyze_Explicit_Dereference --
1106 ----------------------------------
1108 procedure Analyze_Explicit_Dereference
(N
: Node_Id
) is
1109 Loc
: constant Source_Ptr
:= Sloc
(N
);
1110 P
: constant Node_Id
:= Prefix
(N
);
1116 function Is_Function_Type
return Boolean;
1117 -- Check whether node may be interpreted as an implicit function call.
1119 function Is_Function_Type
return Boolean is
1124 if not Is_Overloaded
(N
) then
1125 return Ekind
(Base_Type
(Etype
(N
))) = E_Subprogram_Type
1126 and then Etype
(Base_Type
(Etype
(N
))) /= Standard_Void_Type
;
1129 Get_First_Interp
(N
, I
, It
);
1131 while Present
(It
.Nam
) loop
1132 if Ekind
(Base_Type
(It
.Typ
)) /= E_Subprogram_Type
1133 or else Etype
(Base_Type
(It
.Typ
)) = Standard_Void_Type
1138 Get_Next_Interp
(I
, It
);
1143 end Is_Function_Type
;
1147 Set_Etype
(N
, Any_Type
);
1149 -- Test for remote access to subprogram type, and if so return
1150 -- after rewriting the original tree.
1152 if Remote_AST_E_Dereference
(P
) then
1156 -- Normal processing for other than remote access to subprogram type
1158 if not Is_Overloaded
(P
) then
1159 if Is_Access_Type
(Etype
(P
)) then
1161 -- Set the Etype. We need to go thru Is_For_Access_Subtypes
1162 -- to avoid other problems caused by the Private_Subtype
1163 -- and it is safe to go to the Base_Type because this is the
1164 -- same as converting the access value to its Base_Type.
1167 DT
: Entity_Id
:= Designated_Type
(Etype
(P
));
1170 if Ekind
(DT
) = E_Private_Subtype
1171 and then Is_For_Access_Subtype
(DT
)
1173 DT
:= Base_Type
(DT
);
1179 elsif Etype
(P
) /= Any_Type
then
1180 Error_Msg_N
("prefix of dereference must be an access type", N
);
1185 Get_First_Interp
(P
, I
, It
);
1187 while Present
(It
.Nam
) loop
1190 if Is_Access_Type
(T
) then
1191 Add_One_Interp
(N
, Designated_Type
(T
), Designated_Type
(T
));
1194 Get_Next_Interp
(I
, It
);
1199 -- Error if no interpretation of the prefix has an access type.
1201 if Etype
(N
) = Any_Type
then
1203 ("access type required in prefix of explicit dereference", P
);
1204 Set_Etype
(N
, Any_Type
);
1210 and then Nkind
(Parent
(N
)) /= N_Indexed_Component
1212 and then (Nkind
(Parent
(N
)) /= N_Function_Call
1213 or else N
/= Name
(Parent
(N
)))
1215 and then (Nkind
(Parent
(N
)) /= N_Procedure_Call_Statement
1216 or else N
/= Name
(Parent
(N
)))
1218 and then Nkind
(Parent
(N
)) /= N_Subprogram_Renaming_Declaration
1219 and then (Nkind
(Parent
(N
)) /= N_Attribute_Reference
1221 (Attribute_Name
(Parent
(N
)) /= Name_Address
1223 Attribute_Name
(Parent
(N
)) /= Name_Access
))
1225 -- Name is a function call with no actuals, in a context that
1226 -- requires deproceduring (including as an actual in an enclosing
1227 -- function or procedure call). We can conceive of pathological cases
1228 -- where the prefix might include functions that return access to
1229 -- subprograms and others that return a regular type. Disambiguation
1230 -- of those will have to take place in Resolve. See e.g. 7117-014.
1233 Make_Function_Call
(Loc
,
1234 Name
=> Make_Explicit_Dereference
(Loc
, P
),
1235 Parameter_Associations
=> New_List
);
1237 -- If the prefix is overloaded, remove operations that have formals,
1238 -- we know that this is a parameterless call.
1240 if Is_Overloaded
(P
) then
1241 Get_First_Interp
(P
, I
, It
);
1243 while Present
(It
.Nam
) loop
1246 if No
(First_Formal
(Base_Type
(Designated_Type
(T
)))) then
1252 Get_Next_Interp
(I
, It
);
1260 -- A value of remote access-to-class-wide must not be dereferenced
1263 Validate_Remote_Access_To_Class_Wide_Type
(N
);
1265 end Analyze_Explicit_Dereference
;
1267 ------------------------
1268 -- Analyze_Expression --
1269 ------------------------
1271 procedure Analyze_Expression
(N
: Node_Id
) is
1274 Check_Parameterless_Call
(N
);
1275 end Analyze_Expression
;
1277 ------------------------------------
1278 -- Analyze_Indexed_Component_Form --
1279 ------------------------------------
1281 procedure Analyze_Indexed_Component_Form
(N
: Node_Id
) is
1282 P
: constant Node_Id
:= Prefix
(N
);
1283 Exprs
: constant List_Id
:= Expressions
(N
);
1289 procedure Process_Function_Call
;
1290 -- Prefix in indexed component form is an overloadable entity,
1291 -- so the node is a function call. Reformat it as such.
1293 procedure Process_Indexed_Component
;
1294 -- Prefix in indexed component form is actually an indexed component.
1295 -- This routine processes it, knowing that the prefix is already
1298 procedure Process_Indexed_Component_Or_Slice
;
1299 -- An indexed component with a single index may designate a slice if
1300 -- the index is a subtype mark. This routine disambiguates these two
1301 -- cases by resolving the prefix to see if it is a subtype mark.
1303 procedure Process_Overloaded_Indexed_Component
;
1304 -- If the prefix of an indexed component is overloaded, the proper
1305 -- interpretation is selected by the index types and the context.
1307 ---------------------------
1308 -- Process_Function_Call --
1309 ---------------------------
1311 procedure Process_Function_Call
is
1315 Change_Node
(N
, N_Function_Call
);
1317 Set_Parameter_Associations
(N
, Exprs
);
1318 Actual
:= First
(Parameter_Associations
(N
));
1320 while Present
(Actual
) loop
1322 Check_Parameterless_Call
(Actual
);
1323 Next_Actual
(Actual
);
1327 end Process_Function_Call
;
1329 -------------------------------
1330 -- Process_Indexed_Component --
1331 -------------------------------
1333 procedure Process_Indexed_Component
is
1335 Array_Type
: Entity_Id
;
1337 Entry_Family
: Entity_Id
;
1340 Exp
:= First
(Exprs
);
1342 if Is_Overloaded
(P
) then
1343 Process_Overloaded_Indexed_Component
;
1346 Array_Type
:= Etype
(P
);
1348 -- Prefix must be appropriate for an array type.
1349 -- Dereference the prefix if it is an access type.
1351 if Is_Access_Type
(Array_Type
) then
1352 Array_Type
:= Designated_Type
(Array_Type
);
1353 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
1356 if Is_Array_Type
(Array_Type
) then
1359 elsif (Is_Entity_Name
(P
)
1361 Ekind
(Entity
(P
)) = E_Entry_Family
)
1363 (Nkind
(P
) = N_Selected_Component
1365 Is_Entity_Name
(Selector_Name
(P
))
1367 Ekind
(Entity
(Selector_Name
(P
))) = E_Entry_Family
)
1369 if Is_Entity_Name
(P
) then
1370 Entry_Family
:= Entity
(P
);
1372 Entry_Family
:= Entity
(Selector_Name
(P
));
1376 Set_Etype
(N
, Any_Type
);
1378 if not Has_Compatible_Type
1379 (Exp
, Entry_Index_Type
(Entry_Family
))
1381 Error_Msg_N
("invalid index type in entry name", N
);
1383 elsif Present
(Next
(Exp
)) then
1384 Error_Msg_N
("too many subscripts in entry reference", N
);
1387 Set_Etype
(N
, Etype
(P
));
1392 elsif Is_Record_Type
(Array_Type
)
1393 and then Remote_AST_I_Dereference
(P
)
1397 elsif Array_Type
= Any_Type
then
1398 Set_Etype
(N
, Any_Type
);
1401 -- Here we definitely have a bad indexing
1404 if Nkind
(Parent
(N
)) = N_Requeue_Statement
1406 ((Is_Entity_Name
(P
)
1407 and then Ekind
(Entity
(P
)) = E_Entry
)
1409 (Nkind
(P
) = N_Selected_Component
1410 and then Is_Entity_Name
(Selector_Name
(P
))
1411 and then Ekind
(Entity
(Selector_Name
(P
))) = E_Entry
))
1414 ("REQUEUE does not permit parameters", First
(Exprs
));
1416 elsif Is_Entity_Name
(P
)
1417 and then Etype
(P
) = Standard_Void_Type
1419 Error_Msg_NE
("incorrect use of&", P
, Entity
(P
));
1422 Error_Msg_N
("array type required in indexed component", P
);
1425 Set_Etype
(N
, Any_Type
);
1429 Index
:= First_Index
(Array_Type
);
1431 while Present
(Index
) and then Present
(Exp
) loop
1432 if not Has_Compatible_Type
(Exp
, Etype
(Index
)) then
1433 Wrong_Type
(Exp
, Etype
(Index
));
1434 Set_Etype
(N
, Any_Type
);
1442 Set_Etype
(N
, Component_Type
(Array_Type
));
1444 if Present
(Index
) then
1446 ("too few subscripts in array reference", First
(Exprs
));
1448 elsif Present
(Exp
) then
1449 Error_Msg_N
("too many subscripts in array reference", Exp
);
1453 end Process_Indexed_Component
;
1455 ----------------------------------------
1456 -- Process_Indexed_Component_Or_Slice --
1457 ----------------------------------------
1459 procedure Process_Indexed_Component_Or_Slice
is
1461 Exp
:= First
(Exprs
);
1463 while Present
(Exp
) loop
1464 Analyze_Expression
(Exp
);
1468 Exp
:= First
(Exprs
);
1470 -- If one index is present, and it is a subtype name, then the
1471 -- node denotes a slice (note that the case of an explicit range
1472 -- for a slice was already built as an N_Slice node in the first
1473 -- place, so that case is not handled here).
1475 -- We use a replace rather than a rewrite here because this is one
1476 -- of the cases in which the tree built by the parser is plain wrong.
1479 and then Is_Entity_Name
(Exp
)
1480 and then Is_Type
(Entity
(Exp
))
1483 Make_Slice
(Sloc
(N
),
1485 Discrete_Range
=> New_Copy
(Exp
)));
1488 -- Otherwise (more than one index present, or single index is not
1489 -- a subtype name), then we have the indexed component case.
1492 Process_Indexed_Component
;
1494 end Process_Indexed_Component_Or_Slice
;
1496 ------------------------------------------
1497 -- Process_Overloaded_Indexed_Component --
1498 ------------------------------------------
1500 procedure Process_Overloaded_Indexed_Component
is
1509 Set_Etype
(N
, Any_Type
);
1510 Get_First_Interp
(P
, I
, It
);
1512 while Present
(It
.Nam
) loop
1515 if Is_Access_Type
(Typ
) then
1516 Typ
:= Designated_Type
(Typ
);
1517 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
1520 if Is_Array_Type
(Typ
) then
1522 -- Got a candidate: verify that index types are compatible
1524 Index
:= First_Index
(Typ
);
1527 Exp
:= First
(Exprs
);
1529 while Present
(Index
) and then Present
(Exp
) loop
1530 if Has_Compatible_Type
(Exp
, Etype
(Index
)) then
1542 if Found
and then No
(Index
) and then No
(Exp
) then
1544 Etype
(Component_Type
(Typ
)),
1545 Etype
(Component_Type
(Typ
)));
1549 Get_Next_Interp
(I
, It
);
1552 if Etype
(N
) = Any_Type
then
1553 Error_Msg_N
("no legal interpetation for indexed component", N
);
1554 Set_Is_Overloaded
(N
, False);
1558 end Process_Overloaded_Indexed_Component
;
1560 ------------------------------------
1561 -- Analyze_Indexed_Component_Form --
1562 ------------------------------------
1565 -- Get name of array, function or type
1568 if Nkind
(N
) = N_Function_Call
1569 or else Nkind
(N
) = N_Procedure_Call_Statement
1571 -- If P is an explicit dereference whose prefix is of a
1572 -- remote access-to-subprogram type, then N has already
1573 -- been rewritten as a subprogram call and analyzed.
1578 pragma Assert
(Nkind
(N
) = N_Indexed_Component
);
1580 P_T
:= Base_Type
(Etype
(P
));
1582 if Is_Entity_Name
(P
)
1583 or else Nkind
(P
) = N_Operator_Symbol
1587 if Ekind
(U_N
) in Type_Kind
then
1589 -- Reformat node as a type conversion.
1591 E
:= Remove_Head
(Exprs
);
1593 if Present
(First
(Exprs
)) then
1595 ("argument of type conversion must be single expression", N
);
1598 Change_Node
(N
, N_Type_Conversion
);
1599 Set_Subtype_Mark
(N
, P
);
1601 Set_Expression
(N
, E
);
1603 -- After changing the node, call for the specific Analysis
1604 -- routine directly, to avoid a double call to the expander.
1606 Analyze_Type_Conversion
(N
);
1610 if Is_Overloadable
(U_N
) then
1611 Process_Function_Call
;
1613 elsif Ekind
(Etype
(P
)) = E_Subprogram_Type
1614 or else (Is_Access_Type
(Etype
(P
))
1616 Ekind
(Designated_Type
(Etype
(P
))) = E_Subprogram_Type
)
1618 -- Call to access_to-subprogram with possible implicit dereference
1620 Process_Function_Call
;
1622 elsif Is_Generic_Subprogram
(U_N
) then
1624 -- A common beginner's (or C++ templates fan) error.
1626 Error_Msg_N
("generic subprogram cannot be called", N
);
1627 Set_Etype
(N
, Any_Type
);
1631 Process_Indexed_Component_Or_Slice
;
1634 -- If not an entity name, prefix is an expression that may denote
1635 -- an array or an access-to-subprogram.
1638 if Ekind
(P_T
) = E_Subprogram_Type
1639 or else (Is_Access_Type
(P_T
)
1641 Ekind
(Designated_Type
(P_T
)) = E_Subprogram_Type
)
1643 Process_Function_Call
;
1645 elsif Nkind
(P
) = N_Selected_Component
1646 and then Ekind
(Entity
(Selector_Name
(P
))) = E_Function
1648 Process_Function_Call
;
1651 -- Indexed component, slice, or a call to a member of a family
1652 -- entry, which will be converted to an entry call later.
1654 Process_Indexed_Component_Or_Slice
;
1657 end Analyze_Indexed_Component_Form
;
1659 ------------------------
1660 -- Analyze_Logical_Op --
1661 ------------------------
1663 procedure Analyze_Logical_Op
(N
: Node_Id
) is
1664 L
: constant Node_Id
:= Left_Opnd
(N
);
1665 R
: constant Node_Id
:= Right_Opnd
(N
);
1666 Op_Id
: Entity_Id
:= Entity
(N
);
1669 Set_Etype
(N
, Any_Type
);
1670 Candidate_Type
:= Empty
;
1672 Analyze_Expression
(L
);
1673 Analyze_Expression
(R
);
1675 if Present
(Op_Id
) then
1677 if Ekind
(Op_Id
) = E_Operator
then
1678 Find_Boolean_Types
(L
, R
, Op_Id
, N
);
1680 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1684 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
1686 while Present
(Op_Id
) loop
1687 if Ekind
(Op_Id
) = E_Operator
then
1688 Find_Boolean_Types
(L
, R
, Op_Id
, N
);
1690 Analyze_User_Defined_Binary_Op
(N
, Op_Id
);
1693 Op_Id
:= Homonym
(Op_Id
);
1698 end Analyze_Logical_Op
;
1700 ---------------------------
1701 -- Analyze_Membership_Op --
1702 ---------------------------
1704 procedure Analyze_Membership_Op
(N
: Node_Id
) is
1705 L
: constant Node_Id
:= Left_Opnd
(N
);
1706 R
: constant Node_Id
:= Right_Opnd
(N
);
1708 Index
: Interp_Index
;
1710 Found
: Boolean := False;
1714 procedure Try_One_Interp
(T1
: Entity_Id
);
1715 -- Routine to try one proposed interpretation. Note that the context
1716 -- of the operation plays no role in resolving the arguments, so that
1717 -- if there is more than one interpretation of the operands that is
1718 -- compatible with a membership test, the operation is ambiguous.
1720 procedure Try_One_Interp
(T1
: Entity_Id
) is
1722 if Has_Compatible_Type
(R
, T1
) then
1724 and then Base_Type
(T1
) /= Base_Type
(T_F
)
1726 It
:= Disambiguate
(L
, I_F
, Index
, Any_Type
);
1728 if It
= No_Interp
then
1729 Ambiguous_Operands
(N
);
1730 Set_Etype
(L
, Any_Type
);
1748 -- Start of processing for Analyze_Membership_Op
1751 Analyze_Expression
(L
);
1753 if Nkind
(R
) = N_Range
1754 or else (Nkind
(R
) = N_Attribute_Reference
1755 and then Attribute_Name
(R
) = Name_Range
)
1759 if not Is_Overloaded
(L
) then
1760 Try_One_Interp
(Etype
(L
));
1763 Get_First_Interp
(L
, Index
, It
);
1765 while Present
(It
.Typ
) loop
1766 Try_One_Interp
(It
.Typ
);
1767 Get_Next_Interp
(Index
, It
);
1771 -- If not a range, it can only be a subtype mark, or else there
1772 -- is a more basic error, to be diagnosed in Find_Type.
1777 if Is_Entity_Name
(R
) then
1778 Check_Fully_Declared
(Entity
(R
), R
);
1782 -- Compatibility between expression and subtype mark or range is
1783 -- checked during resolution. The result of the operation is Boolean
1786 Set_Etype
(N
, Standard_Boolean
);
1787 end Analyze_Membership_Op
;
1789 ----------------------
1790 -- Analyze_Negation --
1791 ----------------------
1793 procedure Analyze_Negation
(N
: Node_Id
) is
1794 R
: constant Node_Id
:= Right_Opnd
(N
);
1795 Op_Id
: Entity_Id
:= Entity
(N
);
1798 Set_Etype
(N
, Any_Type
);
1799 Candidate_Type
:= Empty
;
1801 Analyze_Expression
(R
);
1803 if Present
(Op_Id
) then
1804 if Ekind
(Op_Id
) = E_Operator
then
1805 Find_Negation_Types
(R
, Op_Id
, N
);
1807 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
1811 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
1813 while Present
(Op_Id
) loop
1814 if Ekind
(Op_Id
) = E_Operator
then
1815 Find_Negation_Types
(R
, Op_Id
, N
);
1817 Analyze_User_Defined_Unary_Op
(N
, Op_Id
);
1820 Op_Id
:= Homonym
(Op_Id
);
1825 end Analyze_Negation
;
1831 procedure Analyze_Null
(N
: Node_Id
) is
1833 Set_Etype
(N
, Any_Access
);
1836 ----------------------
1837 -- Analyze_One_Call --
1838 ----------------------
1840 procedure Analyze_One_Call
1844 Success
: out Boolean)
1846 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
1847 Prev_T
: constant Entity_Id
:= Etype
(N
);
1850 Is_Indexed
: Boolean := False;
1851 Subp_Type
: constant Entity_Id
:= Etype
(Nam
);
1854 procedure Indicate_Name_And_Type
;
1855 -- If candidate interpretation matches, indicate name and type of
1856 -- result on call node.
1858 ----------------------------
1859 -- Indicate_Name_And_Type --
1860 ----------------------------
1862 procedure Indicate_Name_And_Type
is
1864 Add_One_Interp
(N
, Nam
, Etype
(Nam
));
1867 -- If the prefix of the call is a name, indicate the entity
1868 -- being called. If it is not a name, it is an expression that
1869 -- denotes an access to subprogram or else an entry or family. In
1870 -- the latter case, the name is a selected component, and the entity
1871 -- being called is noted on the selector.
1873 if not Is_Type
(Nam
) then
1874 if Is_Entity_Name
(Name
(N
))
1875 or else Nkind
(Name
(N
)) = N_Operator_Symbol
1877 Set_Entity
(Name
(N
), Nam
);
1879 elsif Nkind
(Name
(N
)) = N_Selected_Component
then
1880 Set_Entity
(Selector_Name
(Name
(N
)), Nam
);
1884 if Debug_Flag_E
and not Report
then
1885 Write_Str
(" Overloaded call ");
1886 Write_Int
(Int
(N
));
1887 Write_Str
(" compatible with ");
1888 Write_Int
(Int
(Nam
));
1891 end Indicate_Name_And_Type
;
1893 -- Start of processing for Analyze_One_Call
1898 -- If the subprogram has no formals, or if all the formals have
1899 -- defaults, and the return type is an array type, the node may
1900 -- denote an indexing of the result of a parameterless call.
1902 if Needs_No_Actuals
(Nam
)
1903 and then Present
(Actuals
)
1905 if Is_Array_Type
(Subp_Type
) then
1906 Is_Indexed
:= Try_Indexed_Call
(N
, Nam
, Subp_Type
);
1908 elsif Is_Access_Type
(Subp_Type
)
1909 and then Is_Array_Type
(Designated_Type
(Subp_Type
))
1912 Try_Indexed_Call
(N
, Nam
, Designated_Type
(Subp_Type
));
1914 elsif Is_Access_Type
(Subp_Type
)
1915 and then Ekind
(Designated_Type
(Subp_Type
)) = E_Subprogram_Type
1917 Is_Indexed
:= Try_Indirect_Call
(N
, Nam
, Subp_Type
);
1922 Normalize_Actuals
(N
, Nam
, (Report
and not Is_Indexed
), Norm_OK
);
1926 -- Mismatch in number or names of parameters
1928 if Debug_Flag_E
then
1929 Write_Str
(" normalization fails in call ");
1930 Write_Int
(Int
(N
));
1931 Write_Str
(" with subprogram ");
1932 Write_Int
(Int
(Nam
));
1936 -- If the context expects a function call, discard any interpretation
1937 -- that is a procedure. If the node is not overloaded, leave as is for
1938 -- better error reporting when type mismatch is found.
1940 elsif Nkind
(N
) = N_Function_Call
1941 and then Is_Overloaded
(Name
(N
))
1942 and then Ekind
(Nam
) = E_Procedure
1946 -- Ditto for function calls in a procedure context.
1948 elsif Nkind
(N
) = N_Procedure_Call_Statement
1949 and then Is_Overloaded
(Name
(N
))
1950 and then Etype
(Nam
) /= Standard_Void_Type
1954 elsif not Present
(Actuals
) then
1956 -- If Normalize succeeds, then there are default parameters for
1959 Indicate_Name_And_Type
;
1961 elsif Ekind
(Nam
) = E_Operator
then
1962 if Nkind
(N
) = N_Procedure_Call_Statement
then
1966 -- This can occur when the prefix of the call is an operator
1967 -- name or an expanded name whose selector is an operator name.
1969 Analyze_Operator_Call
(N
, Nam
);
1971 if Etype
(N
) /= Prev_T
then
1973 -- There may be a user-defined operator that hides the
1974 -- current interpretation. We must check for this independently
1975 -- of the analysis of the call with the user-defined operation,
1976 -- because the parameter names may be wrong and yet the hiding
1977 -- takes place. Fixes b34014o.
1979 if Is_Overloaded
(Name
(N
)) then
1985 Get_First_Interp
(Name
(N
), I
, It
);
1987 while Present
(It
.Nam
) loop
1989 if Ekind
(It
.Nam
) /= E_Operator
1990 and then Hides_Op
(It
.Nam
, Nam
)
1993 (First_Actual
(N
), Etype
(First_Formal
(It
.Nam
)))
1994 and then (No
(Next_Actual
(First_Actual
(N
)))
1995 or else Has_Compatible_Type
1996 (Next_Actual
(First_Actual
(N
)),
1997 Etype
(Next_Formal
(First_Formal
(It
.Nam
)))))
1999 Set_Etype
(N
, Prev_T
);
2003 Get_Next_Interp
(I
, It
);
2008 -- If operator matches formals, record its name on the call.
2009 -- If the operator is overloaded, Resolve will select the
2010 -- correct one from the list of interpretations. The call
2011 -- node itself carries the first candidate.
2013 Set_Entity
(Name
(N
), Nam
);
2016 elsif Report
and then Etype
(N
) = Any_Type
then
2017 Error_Msg_N
("incompatible arguments for operator", N
);
2021 -- Normalize_Actuals has chained the named associations in the
2022 -- correct order of the formals.
2024 Actual
:= First_Actual
(N
);
2025 Formal
:= First_Formal
(Nam
);
2027 while Present
(Actual
) and then Present
(Formal
) loop
2029 if Nkind
(Parent
(Actual
)) /= N_Parameter_Association
2030 or else Chars
(Selector_Name
(Parent
(Actual
))) = Chars
(Formal
)
2032 if Has_Compatible_Type
(Actual
, Etype
(Formal
)) then
2033 Next_Actual
(Actual
);
2034 Next_Formal
(Formal
);
2037 if Debug_Flag_E
then
2038 Write_Str
(" type checking fails in call ");
2039 Write_Int
(Int
(N
));
2040 Write_Str
(" with formal ");
2041 Write_Int
(Int
(Formal
));
2042 Write_Str
(" in subprogram ");
2043 Write_Int
(Int
(Nam
));
2047 if Report
and not Is_Indexed
then
2049 Wrong_Type
(Actual
, Etype
(Formal
));
2051 if Nkind
(Actual
) = N_Op_Eq
2052 and then Nkind
(Left_Opnd
(Actual
)) = N_Identifier
2054 Formal
:= First_Formal
(Nam
);
2056 while Present
(Formal
) loop
2058 if Chars
(Left_Opnd
(Actual
)) = Chars
(Formal
) then
2060 ("possible misspelling of `='>`!", Actual
);
2064 Next_Formal
(Formal
);
2068 if All_Errors_Mode
then
2069 Error_Msg_Sloc
:= Sloc
(Nam
);
2071 if Is_Overloadable
(Nam
)
2072 and then Present
(Alias
(Nam
))
2073 and then not Comes_From_Source
(Nam
)
2076 (" =='> in call to &#(inherited)!", Actual
, Nam
);
2078 Error_Msg_NE
(" =='> in call to &#!", Actual
, Nam
);
2087 -- Normalize_Actuals has verified that a default value exists
2088 -- for this formal. Current actual names a subsequent formal.
2090 Next_Formal
(Formal
);
2094 -- On exit, all actuals match.
2096 Indicate_Name_And_Type
;
2098 end Analyze_One_Call
;
2100 ----------------------------
2101 -- Analyze_Operator_Call --
2102 ----------------------------
2104 procedure Analyze_Operator_Call
(N
: Node_Id
; Op_Id
: Entity_Id
) is
2105 Op_Name
: constant Name_Id
:= Chars
(Op_Id
);
2106 Act1
: constant Node_Id
:= First_Actual
(N
);
2107 Act2
: constant Node_Id
:= Next_Actual
(Act1
);
2110 if Present
(Act2
) then
2112 -- Maybe binary operators
2114 if Present
(Next_Actual
(Act2
)) then
2116 -- Too many actuals for an operator
2120 elsif Op_Name
= Name_Op_Add
2121 or else Op_Name
= Name_Op_Subtract
2122 or else Op_Name
= Name_Op_Multiply
2123 or else Op_Name
= Name_Op_Divide
2124 or else Op_Name
= Name_Op_Mod
2125 or else Op_Name
= Name_Op_Rem
2126 or else Op_Name
= Name_Op_Expon
2128 Find_Arithmetic_Types
(Act1
, Act2
, Op_Id
, N
);
2130 elsif Op_Name
= Name_Op_And
2131 or else Op_Name
= Name_Op_Or
2132 or else Op_Name
= Name_Op_Xor
2134 Find_Boolean_Types
(Act1
, Act2
, Op_Id
, N
);
2136 elsif Op_Name
= Name_Op_Lt
2137 or else Op_Name
= Name_Op_Le
2138 or else Op_Name
= Name_Op_Gt
2139 or else Op_Name
= Name_Op_Ge
2141 Find_Comparison_Types
(Act1
, Act2
, Op_Id
, N
);
2143 elsif Op_Name
= Name_Op_Eq
2144 or else Op_Name
= Name_Op_Ne
2146 Find_Equality_Types
(Act1
, Act2
, Op_Id
, N
);
2148 elsif Op_Name
= Name_Op_Concat
then
2149 Find_Concatenation_Types
(Act1
, Act2
, Op_Id
, N
);
2151 -- Is this else null correct, or should it be an abort???
2160 if Op_Name
= Name_Op_Subtract
or else
2161 Op_Name
= Name_Op_Add
or else
2162 Op_Name
= Name_Op_Abs
2164 Find_Unary_Types
(Act1
, Op_Id
, N
);
2167 Op_Name
= Name_Op_Not
2169 Find_Negation_Types
(Act1
, Op_Id
, N
);
2171 -- Is this else null correct, or should it be an abort???
2177 end Analyze_Operator_Call
;
2179 -------------------------------------------
2180 -- Analyze_Overloaded_Selected_Component --
2181 -------------------------------------------
2183 procedure Analyze_Overloaded_Selected_Component
(N
: Node_Id
) is
2184 Nam
: constant Node_Id
:= Prefix
(N
);
2185 Sel
: constant Node_Id
:= Selector_Name
(N
);
2192 Get_First_Interp
(Nam
, I
, It
);
2194 Set_Etype
(Sel
, Any_Type
);
2196 while Present
(It
.Typ
) loop
2197 if Is_Access_Type
(It
.Typ
) then
2198 T
:= Designated_Type
(It
.Typ
);
2199 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
2205 if Is_Record_Type
(T
) then
2206 Comp
:= First_Entity
(T
);
2208 while Present
(Comp
) loop
2210 if Chars
(Comp
) = Chars
(Sel
)
2211 and then Is_Visible_Component
(Comp
)
2213 Set_Entity_With_Style_Check
(Sel
, Comp
);
2214 Generate_Reference
(Comp
, Sel
);
2216 Set_Etype
(Sel
, Etype
(Comp
));
2217 Add_One_Interp
(N
, Etype
(Comp
), Etype
(Comp
));
2219 -- This also specifies a candidate to resolve the name.
2220 -- Further overloading will be resolved from context.
2222 Set_Etype
(Nam
, It
.Typ
);
2228 elsif Is_Concurrent_Type
(T
) then
2229 Comp
:= First_Entity
(T
);
2231 while Present
(Comp
)
2232 and then Comp
/= First_Private_Entity
(T
)
2234 if Chars
(Comp
) = Chars
(Sel
) then
2235 if Is_Overloadable
(Comp
) then
2236 Add_One_Interp
(Sel
, Comp
, Etype
(Comp
));
2238 Set_Entity_With_Style_Check
(Sel
, Comp
);
2239 Generate_Reference
(Comp
, Sel
);
2242 Set_Etype
(Sel
, Etype
(Comp
));
2243 Set_Etype
(N
, Etype
(Comp
));
2244 Set_Etype
(Nam
, It
.Typ
);
2246 -- For access type case, introduce explicit deference for
2247 -- more uniform treatment of entry calls.
2249 if Is_Access_Type
(Etype
(Nam
)) then
2250 Insert_Explicit_Dereference
(Nam
);
2252 (Warn_On_Dereference
, "?implicit dereference", N
);
2259 Set_Is_Overloaded
(N
, Is_Overloaded
(Sel
));
2262 Get_Next_Interp
(I
, It
);
2265 if Etype
(N
) = Any_Type
then
2266 Error_Msg_NE
("undefined selector& for overloaded prefix", N
, Sel
);
2267 Set_Entity
(Sel
, Any_Id
);
2268 Set_Etype
(Sel
, Any_Type
);
2271 end Analyze_Overloaded_Selected_Component
;
2273 ----------------------------------
2274 -- Analyze_Qualified_Expression --
2275 ----------------------------------
2277 procedure Analyze_Qualified_Expression
(N
: Node_Id
) is
2278 Mark
: constant Entity_Id
:= Subtype_Mark
(N
);
2282 Set_Etype
(N
, Any_Type
);
2286 if T
= Any_Type
then
2289 Check_Fully_Declared
(T
, N
);
2291 Analyze_Expression
(Expression
(N
));
2293 end Analyze_Qualified_Expression
;
2299 procedure Analyze_Range
(N
: Node_Id
) is
2300 L
: constant Node_Id
:= Low_Bound
(N
);
2301 H
: constant Node_Id
:= High_Bound
(N
);
2302 I1
, I2
: Interp_Index
;
2305 procedure Check_Common_Type
(T1
, T2
: Entity_Id
);
2306 -- Verify the compatibility of two types, and choose the
2307 -- non universal one if the other is universal.
2309 procedure Check_High_Bound
(T
: Entity_Id
);
2310 -- Test one interpretation of the low bound against all those
2311 -- of the high bound.
2313 procedure Check_Universal_Expression
(N
: Node_Id
);
2314 -- In Ada83, reject bounds of a universal range that are not
2315 -- literals or entity names.
2317 -----------------------
2318 -- Check_Common_Type --
2319 -----------------------
2321 procedure Check_Common_Type
(T1
, T2
: Entity_Id
) is
2323 if Covers
(T1
, T2
) or else Covers
(T2
, T1
) then
2324 if T1
= Universal_Integer
2325 or else T1
= Universal_Real
2326 or else T1
= Any_Character
2328 Add_One_Interp
(N
, Base_Type
(T2
), Base_Type
(T2
));
2331 Add_One_Interp
(N
, T1
, T1
);
2334 Add_One_Interp
(N
, Base_Type
(T1
), Base_Type
(T1
));
2337 end Check_Common_Type
;
2339 ----------------------
2340 -- Check_High_Bound --
2341 ----------------------
2343 procedure Check_High_Bound
(T
: Entity_Id
) is
2345 if not Is_Overloaded
(H
) then
2346 Check_Common_Type
(T
, Etype
(H
));
2348 Get_First_Interp
(H
, I2
, It2
);
2350 while Present
(It2
.Typ
) loop
2351 Check_Common_Type
(T
, It2
.Typ
);
2352 Get_Next_Interp
(I2
, It2
);
2355 end Check_High_Bound
;
2357 -----------------------------
2358 -- Is_Universal_Expression --
2359 -----------------------------
2361 procedure Check_Universal_Expression
(N
: Node_Id
) is
2363 if Etype
(N
) = Universal_Integer
2364 and then Nkind
(N
) /= N_Integer_Literal
2365 and then not Is_Entity_Name
(N
)
2366 and then Nkind
(N
) /= N_Attribute_Reference
2368 Error_Msg_N
("illegal bound in discrete range", N
);
2370 end Check_Universal_Expression
;
2372 -- Start of processing for Analyze_Range
2375 Set_Etype
(N
, Any_Type
);
2376 Analyze_Expression
(L
);
2377 Analyze_Expression
(H
);
2379 if Etype
(L
) = Any_Type
or else Etype
(H
) = Any_Type
then
2383 if not Is_Overloaded
(L
) then
2384 Check_High_Bound
(Etype
(L
));
2386 Get_First_Interp
(L
, I1
, It1
);
2388 while Present
(It1
.Typ
) loop
2389 Check_High_Bound
(It1
.Typ
);
2390 Get_Next_Interp
(I1
, It1
);
2394 -- If result is Any_Type, then we did not find a compatible pair
2396 if Etype
(N
) = Any_Type
then
2397 Error_Msg_N
("incompatible types in range ", N
);
2403 (Nkind
(Parent
(N
)) = N_Loop_Parameter_Specification
2404 or else Nkind
(Parent
(N
)) = N_Constrained_Array_Definition
)
2406 Check_Universal_Expression
(L
);
2407 Check_Universal_Expression
(H
);
2411 -----------------------
2412 -- Analyze_Reference --
2413 -----------------------
2415 procedure Analyze_Reference
(N
: Node_Id
) is
2416 P
: constant Node_Id
:= Prefix
(N
);
2417 Acc_Type
: Entity_Id
;
2421 Acc_Type
:= Create_Itype
(E_Allocator_Type
, N
);
2422 Set_Etype
(Acc_Type
, Acc_Type
);
2423 Init_Size_Align
(Acc_Type
);
2424 Set_Directly_Designated_Type
(Acc_Type
, Etype
(P
));
2425 Set_Etype
(N
, Acc_Type
);
2426 end Analyze_Reference
;
2428 --------------------------------
2429 -- Analyze_Selected_Component --
2430 --------------------------------
2432 -- Prefix is a record type or a task or protected type. In the
2433 -- later case, the selector must denote a visible entry.
2435 procedure Analyze_Selected_Component
(N
: Node_Id
) is
2436 Name
: constant Node_Id
:= Prefix
(N
);
2437 Sel
: constant Node_Id
:= Selector_Name
(N
);
2439 Entity_List
: Entity_Id
;
2440 Prefix_Type
: Entity_Id
;
2445 -- Start of processing for Analyze_Selected_Component
2448 Set_Etype
(N
, Any_Type
);
2450 if Is_Overloaded
(Name
) then
2451 Analyze_Overloaded_Selected_Component
(N
);
2454 elsif Etype
(Name
) = Any_Type
then
2455 Set_Entity
(Sel
, Any_Id
);
2456 Set_Etype
(Sel
, Any_Type
);
2460 -- Function calls that are prefixes of selected components must be
2461 -- fully resolved in case we need to build an actual subtype, or
2462 -- do some other operation requiring a fully resolved prefix.
2464 -- Note: Resolving all Nkinds of nodes here doesn't work.
2465 -- (Breaks 2129-008) ???.
2467 if Nkind
(Name
) = N_Function_Call
then
2471 Prefix_Type
:= Etype
(Name
);
2474 if Is_Access_Type
(Prefix_Type
) then
2476 -- A RACW object can never be used as prefix of a selected
2477 -- component since that means it is dereferenced without
2478 -- being a controlling operand of a dispatching operation
2481 if Is_Remote_Access_To_Class_Wide_Type
(Prefix_Type
)
2482 and then Comes_From_Source
(N
)
2485 ("invalid dereference of a remote access to class-wide value",
2488 -- Normal case of selected component applied to access type
2491 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
2494 Prefix_Type
:= Designated_Type
(Prefix_Type
);
2497 if Ekind
(Prefix_Type
) = E_Private_Subtype
then
2498 Prefix_Type
:= Base_Type
(Prefix_Type
);
2501 Entity_List
:= Prefix_Type
;
2503 -- For class-wide types, use the entity list of the root type. This
2504 -- indirection is specially important for private extensions because
2505 -- only the root type get switched (not the class-wide type).
2507 if Is_Class_Wide_Type
(Prefix_Type
) then
2508 Entity_List
:= Root_Type
(Prefix_Type
);
2511 Comp
:= First_Entity
(Entity_List
);
2513 -- If the selector has an original discriminant, the node appears in
2514 -- an instance. Replace the discriminant with the corresponding one
2515 -- in the current discriminated type. For nested generics, this must
2516 -- be done transitively, so note the new original discriminant.
2518 if Nkind
(Sel
) = N_Identifier
2519 and then Present
(Original_Discriminant
(Sel
))
2521 Comp
:= Find_Corresponding_Discriminant
(Sel
, Prefix_Type
);
2523 -- Mark entity before rewriting, for completeness and because
2524 -- subsequent semantic checks might examine the original node.
2526 Set_Entity
(Sel
, Comp
);
2527 Rewrite
(Selector_Name
(N
),
2528 New_Occurrence_Of
(Comp
, Sloc
(N
)));
2529 Set_Original_Discriminant
(Selector_Name
(N
), Comp
);
2530 Set_Etype
(N
, Etype
(Comp
));
2532 if Is_Access_Type
(Etype
(Name
)) then
2533 Insert_Explicit_Dereference
(Name
);
2534 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
2537 elsif Is_Record_Type
(Prefix_Type
) then
2539 -- Find component with given name
2541 while Present
(Comp
) loop
2543 if Chars
(Comp
) = Chars
(Sel
)
2544 and then Is_Visible_Component
(Comp
)
2546 Set_Entity_With_Style_Check
(Sel
, Comp
);
2547 Generate_Reference
(Comp
, Sel
);
2549 Set_Etype
(Sel
, Etype
(Comp
));
2551 if Ekind
(Comp
) = E_Discriminant
then
2552 if Is_Unchecked_Union
(Prefix_Type
) then
2554 ("cannot reference discriminant of Unchecked_Union",
2558 if Is_Generic_Type
(Prefix_Type
)
2560 Is_Generic_Type
(Root_Type
(Prefix_Type
))
2562 Set_Original_Discriminant
(Sel
, Comp
);
2566 -- Resolve the prefix early otherwise it is not possible to
2567 -- build the actual subtype of the component: it may need
2568 -- to duplicate this prefix and duplication is only allowed
2569 -- on fully resolved expressions.
2573 -- We never need an actual subtype for the case of a selection
2574 -- for a indexed component of a non-packed array, since in
2575 -- this case gigi generates all the checks and can find the
2576 -- necessary bounds information.
2578 -- We also do not need an actual subtype for the case of
2579 -- a first, last, length, or range attribute applied to a
2580 -- non-packed array, since gigi can again get the bounds in
2581 -- these cases (gigi cannot handle the packed case, since it
2582 -- has the bounds of the packed array type, not the original
2583 -- bounds of the type). However, if the prefix is itself a
2584 -- selected component, as in a.b.c (i), gigi may regard a.b.c
2585 -- as a dynamic-sized temporary, so we do generate an actual
2586 -- subtype for this case.
2588 Parent_N
:= Parent
(N
);
2590 if not Is_Packed
(Etype
(Comp
))
2592 ((Nkind
(Parent_N
) = N_Indexed_Component
2593 and then Nkind
(Name
) /= N_Selected_Component
)
2595 (Nkind
(Parent_N
) = N_Attribute_Reference
2596 and then (Attribute_Name
(Parent_N
) = Name_First
2598 Attribute_Name
(Parent_N
) = Name_Last
2600 Attribute_Name
(Parent_N
) = Name_Length
2602 Attribute_Name
(Parent_N
) = Name_Range
)))
2604 Set_Etype
(N
, Etype
(Comp
));
2606 -- In all other cases, we currently build an actual subtype. It
2607 -- seems likely that many of these cases can be avoided, but
2608 -- right now, the front end makes direct references to the
2609 -- bounds (e.g. in generating a length check), and if we do
2610 -- not make an actual subtype, we end up getting a direct
2611 -- reference to a discriminant which will not do.
2615 Build_Actual_Subtype_Of_Component
(Etype
(Comp
), N
);
2616 Insert_Action
(N
, Act_Decl
);
2618 if No
(Act_Decl
) then
2619 Set_Etype
(N
, Etype
(Comp
));
2622 -- Component type depends on discriminants. Enter the
2623 -- main attributes of the subtype.
2626 Subt
: constant Entity_Id
:=
2627 Defining_Identifier
(Act_Decl
);
2630 Set_Etype
(Subt
, Base_Type
(Etype
(Comp
)));
2631 Set_Ekind
(Subt
, Ekind
(Etype
(Comp
)));
2632 Set_Etype
(N
, Subt
);
2643 elsif Is_Private_Type
(Prefix_Type
) then
2645 -- Allow access only to discriminants of the type. If the
2646 -- type has no full view, gigi uses the parent type for
2647 -- the components, so we do the same here.
2649 if No
(Full_View
(Prefix_Type
)) then
2650 Entity_List
:= Root_Type
(Base_Type
(Prefix_Type
));
2651 Comp
:= First_Entity
(Entity_List
);
2654 while Present
(Comp
) loop
2656 if Chars
(Comp
) = Chars
(Sel
) then
2657 if Ekind
(Comp
) = E_Discriminant
then
2658 Set_Entity_With_Style_Check
(Sel
, Comp
);
2659 Generate_Reference
(Comp
, Sel
);
2661 Set_Etype
(Sel
, Etype
(Comp
));
2662 Set_Etype
(N
, Etype
(Comp
));
2664 if Is_Generic_Type
(Prefix_Type
)
2666 Is_Generic_Type
(Root_Type
(Prefix_Type
))
2668 Set_Original_Discriminant
(Sel
, Comp
);
2673 ("invisible selector for }",
2674 N
, First_Subtype
(Prefix_Type
));
2675 Set_Entity
(Sel
, Any_Id
);
2676 Set_Etype
(N
, Any_Type
);
2685 elsif Is_Concurrent_Type
(Prefix_Type
) then
2687 -- Prefix is concurrent type. Find visible operation with given name
2688 -- For a task, this can only include entries or discriminants if
2689 -- the task type is not an enclosing scope. If it is an enclosing
2690 -- scope (e.g. in an inner task) then all entities are visible, but
2691 -- the prefix must denote the enclosing scope, i.e. can only be
2692 -- a direct name or an expanded name.
2694 Set_Etype
(Sel
, Any_Type
);
2695 In_Scope
:= In_Open_Scopes
(Prefix_Type
);
2697 while Present
(Comp
) loop
2698 if Chars
(Comp
) = Chars
(Sel
) then
2699 if Is_Overloadable
(Comp
) then
2700 Add_One_Interp
(Sel
, Comp
, Etype
(Comp
));
2702 elsif Ekind
(Comp
) = E_Discriminant
2703 or else Ekind
(Comp
) = E_Entry_Family
2705 and then Is_Entity_Name
(Name
))
2707 Set_Entity_With_Style_Check
(Sel
, Comp
);
2708 Generate_Reference
(Comp
, Sel
);
2714 Set_Etype
(Sel
, Etype
(Comp
));
2715 Set_Etype
(N
, Etype
(Comp
));
2717 if Ekind
(Comp
) = E_Discriminant
then
2718 Set_Original_Discriminant
(Sel
, Comp
);
2721 -- For access type case, introduce explicit deference for
2722 -- more uniform treatment of entry calls.
2724 if Is_Access_Type
(Etype
(Name
)) then
2725 Insert_Explicit_Dereference
(Name
);
2727 (Warn_On_Dereference
, "?implicit dereference", N
);
2733 exit when not In_Scope
2734 and then Comp
= First_Private_Entity
(Prefix_Type
);
2737 Set_Is_Overloaded
(N
, Is_Overloaded
(Sel
));
2742 Error_Msg_NE
("invalid prefix in selected component&", N
, Sel
);
2745 -- If N still has no type, the component is not defined in the prefix.
2747 if Etype
(N
) = Any_Type
then
2749 -- If the prefix is a single concurrent object, use its name in
2750 -- the error message, rather than that of its anonymous type.
2752 if Is_Concurrent_Type
(Prefix_Type
)
2753 and then Is_Internal_Name
(Chars
(Prefix_Type
))
2754 and then not Is_Derived_Type
(Prefix_Type
)
2755 and then Is_Entity_Name
(Name
)
2758 Error_Msg_Node_2
:= Entity
(Name
);
2759 Error_Msg_NE
("no selector& for&", N
, Sel
);
2761 Check_Misspelled_Selector
(Entity_List
, Sel
);
2763 elsif Is_Generic_Type
(Prefix_Type
)
2764 and then Ekind
(Prefix_Type
) = E_Record_Type_With_Private
2765 and then Prefix_Type
/= Etype
(Prefix_Type
)
2766 and then Is_Record_Type
(Etype
(Prefix_Type
))
2768 -- If this is a derived formal type, the parent may have a
2769 -- different visibility at this point. Try for an inherited
2770 -- component before reporting an error.
2772 Set_Etype
(Prefix
(N
), Etype
(Prefix_Type
));
2773 Analyze_Selected_Component
(N
);
2776 elsif Ekind
(Prefix_Type
) = E_Record_Subtype_With_Private
2777 and then Is_Generic_Actual_Type
(Prefix_Type
)
2778 and then Present
(Full_View
(Prefix_Type
))
2780 -- Similarly, if this the actual for a formal derived type,
2781 -- the component inherited from the generic parent may not
2782 -- be visible in the actual, but the selected component is
2789 First_Component
(Generic_Parent_Type
(Parent
(Prefix_Type
)));
2791 while Present
(Comp
) loop
2792 if Chars
(Comp
) = Chars
(Sel
) then
2793 Set_Entity_With_Style_Check
(Sel
, Comp
);
2794 Set_Etype
(Sel
, Etype
(Comp
));
2795 Set_Etype
(N
, Etype
(Comp
));
2799 Next_Component
(Comp
);
2802 pragma Assert
(Etype
(N
) /= Any_Type
);
2806 if Ekind
(Prefix_Type
) = E_Record_Subtype
then
2808 -- Check whether this is a component of the base type
2809 -- which is absent from a statically constrained subtype.
2810 -- This will raise constraint error at run-time, but is
2811 -- not a compile-time error. When the selector is illegal
2812 -- for base type as well fall through and generate a
2813 -- compilation error anyway.
2815 Comp
:= First_Component
(Base_Type
(Prefix_Type
));
2817 while Present
(Comp
) loop
2819 if Chars
(Comp
) = Chars
(Sel
)
2820 and then Is_Visible_Component
(Comp
)
2822 Set_Entity_With_Style_Check
(Sel
, Comp
);
2823 Generate_Reference
(Comp
, Sel
);
2824 Set_Etype
(Sel
, Etype
(Comp
));
2825 Set_Etype
(N
, Etype
(Comp
));
2827 -- Emit appropriate message. Gigi will replace the
2828 -- node subsequently with the appropriate Raise.
2830 Apply_Compile_Time_Constraint_Error
2831 (N
, "component not present in }?",
2832 CE_Discriminant_Check_Failed
,
2833 Ent
=> Prefix_Type
, Rep
=> False);
2834 Set_Raises_Constraint_Error
(N
);
2838 Next_Component
(Comp
);
2843 Error_Msg_Node_2
:= First_Subtype
(Prefix_Type
);
2844 Error_Msg_NE
("no selector& for}", N
, Sel
);
2846 Check_Misspelled_Selector
(Entity_List
, Sel
);
2850 Set_Entity
(Sel
, Any_Id
);
2851 Set_Etype
(Sel
, Any_Type
);
2853 end Analyze_Selected_Component
;
2855 ---------------------------
2856 -- Analyze_Short_Circuit --
2857 ---------------------------
2859 procedure Analyze_Short_Circuit
(N
: Node_Id
) is
2860 L
: constant Node_Id
:= Left_Opnd
(N
);
2861 R
: constant Node_Id
:= Right_Opnd
(N
);
2866 Analyze_Expression
(L
);
2867 Analyze_Expression
(R
);
2868 Set_Etype
(N
, Any_Type
);
2870 if not Is_Overloaded
(L
) then
2872 if Root_Type
(Etype
(L
)) = Standard_Boolean
2873 and then Has_Compatible_Type
(R
, Etype
(L
))
2875 Add_One_Interp
(N
, Etype
(L
), Etype
(L
));
2879 Get_First_Interp
(L
, Ind
, It
);
2881 while Present
(It
.Typ
) loop
2882 if Root_Type
(It
.Typ
) = Standard_Boolean
2883 and then Has_Compatible_Type
(R
, It
.Typ
)
2885 Add_One_Interp
(N
, It
.Typ
, It
.Typ
);
2888 Get_Next_Interp
(Ind
, It
);
2892 -- Here we have failed to find an interpretation. Clearly we
2893 -- know that it is not the case that both operands can have
2894 -- an interpretation of Boolean, but this is by far the most
2895 -- likely intended interpretation. So we simply resolve both
2896 -- operands as Booleans, and at least one of these resolutions
2897 -- will generate an error message, and we do not need to give
2898 -- a further error message on the short circuit operation itself.
2900 if Etype
(N
) = Any_Type
then
2901 Resolve
(L
, Standard_Boolean
);
2902 Resolve
(R
, Standard_Boolean
);
2903 Set_Etype
(N
, Standard_Boolean
);
2905 end Analyze_Short_Circuit
;
2911 procedure Analyze_Slice
(N
: Node_Id
) is
2912 P
: constant Node_Id
:= Prefix
(N
);
2913 D
: constant Node_Id
:= Discrete_Range
(N
);
2914 Array_Type
: Entity_Id
;
2916 procedure Analyze_Overloaded_Slice
;
2917 -- If the prefix is overloaded, select those interpretations that
2918 -- yield a one-dimensional array type.
2920 procedure Analyze_Overloaded_Slice
is
2926 Set_Etype
(N
, Any_Type
);
2927 Get_First_Interp
(P
, I
, It
);
2929 while Present
(It
.Nam
) loop
2932 if Is_Access_Type
(Typ
) then
2933 Typ
:= Designated_Type
(Typ
);
2934 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
2937 if Is_Array_Type
(Typ
)
2938 and then Number_Dimensions
(Typ
) = 1
2939 and then Has_Compatible_Type
(D
, Etype
(First_Index
(Typ
)))
2941 Add_One_Interp
(N
, Typ
, Typ
);
2944 Get_Next_Interp
(I
, It
);
2947 if Etype
(N
) = Any_Type
then
2948 Error_Msg_N
("expect array type in prefix of slice", N
);
2950 end Analyze_Overloaded_Slice
;
2952 -- Start of processing for Analyze_Slice
2955 -- Analyze the prefix if not done already
2957 if No
(Etype
(P
)) then
2963 if Is_Overloaded
(P
) then
2964 Analyze_Overloaded_Slice
;
2967 Array_Type
:= Etype
(P
);
2968 Set_Etype
(N
, Any_Type
);
2970 if Is_Access_Type
(Array_Type
) then
2971 Array_Type
:= Designated_Type
(Array_Type
);
2972 Error_Msg_NW
(Warn_On_Dereference
, "?implicit dereference", N
);
2975 if not Is_Array_Type
(Array_Type
) then
2976 Wrong_Type
(P
, Any_Array
);
2978 elsif Number_Dimensions
(Array_Type
) > 1 then
2980 ("type is not one-dimensional array in slice prefix", N
);
2983 Has_Compatible_Type
(D
, Etype
(First_Index
(Array_Type
)))
2985 Wrong_Type
(D
, Etype
(First_Index
(Array_Type
)));
2988 Set_Etype
(N
, Array_Type
);
2993 -----------------------------
2994 -- Analyze_Type_Conversion --
2995 -----------------------------
2997 procedure Analyze_Type_Conversion
(N
: Node_Id
) is
2998 Expr
: constant Node_Id
:= Expression
(N
);
3002 -- If Conversion_OK is set, then the Etype is already set, and the
3003 -- only processing required is to analyze the expression. This is
3004 -- used to construct certain "illegal" conversions which are not
3005 -- allowed by Ada semantics, but can be handled OK by Gigi, see
3006 -- Sinfo for further details.
3008 if Conversion_OK
(N
) then
3013 -- Otherwise full type analysis is required, as well as some semantic
3014 -- checks to make sure the argument of the conversion is appropriate.
3016 Find_Type
(Subtype_Mark
(N
));
3017 T
:= Entity
(Subtype_Mark
(N
));
3019 Check_Fully_Declared
(T
, N
);
3020 Analyze_Expression
(Expr
);
3021 Validate_Remote_Type_Type_Conversion
(N
);
3023 -- Only remaining step is validity checks on the argument. These
3024 -- are skipped if the conversion does not come from the source.
3026 if not Comes_From_Source
(N
) then
3029 elsif Nkind
(Expr
) = N_Null
then
3030 Error_Msg_N
("argument of conversion cannot be null", N
);
3031 Error_Msg_N
("\use qualified expression instead", N
);
3032 Set_Etype
(N
, Any_Type
);
3034 elsif Nkind
(Expr
) = N_Aggregate
then
3035 Error_Msg_N
("argument of conversion cannot be aggregate", N
);
3036 Error_Msg_N
("\use qualified expression instead", N
);
3038 elsif Nkind
(Expr
) = N_Allocator
then
3039 Error_Msg_N
("argument of conversion cannot be an allocator", N
);
3040 Error_Msg_N
("\use qualified expression instead", N
);
3042 elsif Nkind
(Expr
) = N_String_Literal
then
3043 Error_Msg_N
("argument of conversion cannot be string literal", N
);
3044 Error_Msg_N
("\use qualified expression instead", N
);
3046 elsif Nkind
(Expr
) = N_Character_Literal
then
3050 Error_Msg_N
("argument of conversion cannot be character literal",
3052 Error_Msg_N
("\use qualified expression instead", N
);
3055 elsif Nkind
(Expr
) = N_Attribute_Reference
3057 (Attribute_Name
(Expr
) = Name_Access
or else
3058 Attribute_Name
(Expr
) = Name_Unchecked_Access
or else
3059 Attribute_Name
(Expr
) = Name_Unrestricted_Access
)
3061 Error_Msg_N
("argument of conversion cannot be access", N
);
3062 Error_Msg_N
("\use qualified expression instead", N
);
3065 end Analyze_Type_Conversion
;
3067 ----------------------
3068 -- Analyze_Unary_Op --
3069 ----------------------
3071 procedure Analyze_Unary_Op
(N
: Node_Id
) is
3072 R
: constant Node_Id
:= Right_Opnd
(N
);
3073 Op_Id
: Entity_Id
:= Entity
(N
);
3076 Set_Etype
(N
, Any_Type
);
3077 Candidate_Type
:= Empty
;
3079 Analyze_Expression
(R
);
3081 if Present
(Op_Id
) then
3082 if Ekind
(Op_Id
) = E_Operator
then
3083 Find_Unary_Types
(R
, Op_Id
, N
);
3085 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
3089 Op_Id
:= Get_Name_Entity_Id
(Chars
(N
));
3091 while Present
(Op_Id
) loop
3093 if Ekind
(Op_Id
) = E_Operator
then
3094 if No
(Next_Entity
(First_Entity
(Op_Id
))) then
3095 Find_Unary_Types
(R
, Op_Id
, N
);
3098 elsif Is_Overloadable
(Op_Id
) then
3099 Analyze_User_Defined_Unary_Op
(N
, Op_Id
);
3102 Op_Id
:= Homonym
(Op_Id
);
3107 end Analyze_Unary_Op
;
3109 ----------------------------------
3110 -- Analyze_Unchecked_Expression --
3111 ----------------------------------
3113 procedure Analyze_Unchecked_Expression
(N
: Node_Id
) is
3115 Analyze
(Expression
(N
), Suppress
=> All_Checks
);
3116 Set_Etype
(N
, Etype
(Expression
(N
)));
3117 Save_Interps
(Expression
(N
), N
);
3118 end Analyze_Unchecked_Expression
;
3120 ---------------------------------------
3121 -- Analyze_Unchecked_Type_Conversion --
3122 ---------------------------------------
3124 procedure Analyze_Unchecked_Type_Conversion
(N
: Node_Id
) is
3126 Find_Type
(Subtype_Mark
(N
));
3127 Analyze_Expression
(Expression
(N
));
3128 Set_Etype
(N
, Entity
(Subtype_Mark
(N
)));
3129 end Analyze_Unchecked_Type_Conversion
;
3131 ------------------------------------
3132 -- Analyze_User_Defined_Binary_Op --
3133 ------------------------------------
3135 procedure Analyze_User_Defined_Binary_Op
3140 -- Only do analysis if the operator Comes_From_Source, since otherwise
3141 -- the operator was generated by the expander, and all such operators
3142 -- always refer to the operators in package Standard.
3144 if Comes_From_Source
(N
) then
3146 F1
: constant Entity_Id
:= First_Formal
(Op_Id
);
3147 F2
: constant Entity_Id
:= Next_Formal
(F1
);
3150 -- Verify that Op_Id is a visible binary function. Note that since
3151 -- we know Op_Id is overloaded, potentially use visible means use
3152 -- visible for sure (RM 9.4(11)).
3154 if Ekind
(Op_Id
) = E_Function
3155 and then Present
(F2
)
3156 and then (Is_Immediately_Visible
(Op_Id
)
3157 or else Is_Potentially_Use_Visible
(Op_Id
))
3158 and then Has_Compatible_Type
(Left_Opnd
(N
), Etype
(F1
))
3159 and then Has_Compatible_Type
(Right_Opnd
(N
), Etype
(F2
))
3161 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
3163 if Debug_Flag_E
then
3164 Write_Str
("user defined operator ");
3165 Write_Name
(Chars
(Op_Id
));
3166 Write_Str
(" on node ");
3167 Write_Int
(Int
(N
));
3173 end Analyze_User_Defined_Binary_Op
;
3175 -----------------------------------
3176 -- Analyze_User_Defined_Unary_Op --
3177 -----------------------------------
3179 procedure Analyze_User_Defined_Unary_Op
3184 -- Only do analysis if the operator Comes_From_Source, since otherwise
3185 -- the operator was generated by the expander, and all such operators
3186 -- always refer to the operators in package Standard.
3188 if Comes_From_Source
(N
) then
3190 F
: constant Entity_Id
:= First_Formal
(Op_Id
);
3193 -- Verify that Op_Id is a visible unary function. Note that since
3194 -- we know Op_Id is overloaded, potentially use visible means use
3195 -- visible for sure (RM 9.4(11)).
3197 if Ekind
(Op_Id
) = E_Function
3198 and then No
(Next_Formal
(F
))
3199 and then (Is_Immediately_Visible
(Op_Id
)
3200 or else Is_Potentially_Use_Visible
(Op_Id
))
3201 and then Has_Compatible_Type
(Right_Opnd
(N
), Etype
(F
))
3203 Add_One_Interp
(N
, Op_Id
, Etype
(Op_Id
));
3207 end Analyze_User_Defined_Unary_Op
;
3209 ---------------------------
3210 -- Check_Arithmetic_Pair --
3211 ---------------------------
3213 procedure Check_Arithmetic_Pair
3214 (T1
, T2
: Entity_Id
;
3218 Op_Name
: constant Name_Id
:= Chars
(Op_Id
);
3220 function Specific_Type
(T1
, T2
: Entity_Id
) return Entity_Id
;
3221 -- Get specific type (i.e. non-universal type if there is one)
3223 function Specific_Type
(T1
, T2
: Entity_Id
) return Entity_Id
is
3225 if T1
= Universal_Integer
or else T1
= Universal_Real
then
3226 return Base_Type
(T2
);
3228 return Base_Type
(T1
);
3232 -- Start of processing for Check_Arithmetic_Pair
3235 if Op_Name
= Name_Op_Add
or else Op_Name
= Name_Op_Subtract
then
3237 if Is_Numeric_Type
(T1
)
3238 and then Is_Numeric_Type
(T2
)
3239 and then (Covers
(T1
, T2
) or else Covers
(T2
, T1
))
3241 Add_One_Interp
(N
, Op_Id
, Specific_Type
(T1
, T2
));
3244 elsif Op_Name
= Name_Op_Multiply
or else Op_Name
= Name_Op_Divide
then
3246 if Is_Fixed_Point_Type
(T1
)
3247 and then (Is_Fixed_Point_Type
(T2
)
3248 or else T2
= Universal_Real
)
3250 -- If Treat_Fixed_As_Integer is set then the Etype is already set
3251 -- and no further processing is required (this is the case of an
3252 -- operator constructed by Exp_Fixd for a fixed point operation)
3253 -- Otherwise add one interpretation with universal fixed result
3254 -- If the operator is given in functional notation, it comes
3255 -- from source and Fixed_As_Integer cannot apply.
3257 if Nkind
(N
) not in N_Op
3258 or else not Treat_Fixed_As_Integer
(N
)
3260 Add_One_Interp
(N
, Op_Id
, Universal_Fixed
);
3263 elsif Is_Fixed_Point_Type
(T2
)
3264 and then (Nkind
(N
) not in N_Op
3265 or else not Treat_Fixed_As_Integer
(N
))
3266 and then T1
= Universal_Real
3268 Add_One_Interp
(N
, Op_Id
, Universal_Fixed
);
3270 elsif Is_Numeric_Type
(T1
)
3271 and then Is_Numeric_Type
(T2
)
3272 and then (Covers
(T1
, T2
) or else Covers
(T2
, T1
))
3274 Add_One_Interp
(N
, Op_Id
, Specific_Type
(T1
, T2
));
3276 elsif Is_Fixed_Point_Type
(T1
)
3277 and then (Base_Type
(T2
) = Base_Type
(Standard_Integer
)
3278 or else T2
= Universal_Integer
)
3280 Add_One_Interp
(N
, Op_Id
, T1
);
3282 elsif T2
= Universal_Real
3283 and then Base_Type
(T1
) = Base_Type
(Standard_Integer
)
3284 and then Op_Name
= Name_Op_Multiply
3286 Add_One_Interp
(N
, Op_Id
, Any_Fixed
);
3288 elsif T1
= Universal_Real
3289 and then Base_Type
(T2
) = Base_Type
(Standard_Integer
)
3291 Add_One_Interp
(N
, Op_Id
, Any_Fixed
);
3293 elsif Is_Fixed_Point_Type
(T2
)
3294 and then (Base_Type
(T1
) = Base_Type
(Standard_Integer
)
3295 or else T1
= Universal_Integer
)
3296 and then Op_Name
= Name_Op_Multiply
3298 Add_One_Interp
(N
, Op_Id
, T2
);
3300 elsif T1
= Universal_Real
and then T2
= Universal_Integer
then
3301 Add_One_Interp
(N
, Op_Id
, T1
);
3303 elsif T2
= Universal_Real
3304 and then T1
= Universal_Integer
3305 and then Op_Name
= Name_Op_Multiply
3307 Add_One_Interp
(N
, Op_Id
, T2
);
3310 elsif Op_Name
= Name_Op_Mod
or else Op_Name
= Name_Op_Rem
then
3312 -- Note: The fixed-point operands case with Treat_Fixed_As_Integer
3313 -- set does not require any special processing, since the Etype is
3314 -- already set (case of operation constructed by Exp_Fixed).
3316 if Is_Integer_Type
(T1
)
3317 and then (Covers
(T1
, T2
) or else Covers
(T2
, T1
))
3319 Add_One_Interp
(N
, Op_Id
, Specific_Type
(T1
, T2
));
3322 elsif Op_Name
= Name_Op_Expon
then
3324 if Is_Numeric_Type
(T1
)
3325 and then not Is_Fixed_Point_Type
(T1
)
3326 and then (Base_Type
(T2
) = Base_Type
(Standard_Integer
)
3327 or else T2
= Universal_Integer
)
3329 Add_One_Interp
(N
, Op_Id
, Base_Type
(T1
));
3332 else pragma Assert
(Nkind
(N
) in N_Op_Shift
);
3334 -- If not one of the predefined operators, the node may be one
3335 -- of the intrinsic functions. Its kind is always specific, and
3336 -- we can use it directly, rather than the name of the operation.
3338 if Is_Integer_Type
(T1
)
3339 and then (Base_Type
(T2
) = Base_Type
(Standard_Integer
)
3340 or else T2
= Universal_Integer
)
3342 Add_One_Interp
(N
, Op_Id
, Base_Type
(T1
));
3345 end Check_Arithmetic_Pair
;
3347 -------------------------------
3348 -- Check_Misspelled_Selector --
3349 -------------------------------
3351 procedure Check_Misspelled_Selector
3352 (Prefix
: Entity_Id
;
3355 Max_Suggestions
: constant := 2;
3356 Nr_Of_Suggestions
: Natural := 0;
3358 Suggestion_1
: Entity_Id
:= Empty
;
3359 Suggestion_2
: Entity_Id
:= Empty
;
3364 -- All the components of the prefix of selector Sel are matched
3365 -- against Sel and a count is maintained of possible misspellings.
3366 -- When at the end of the analysis there are one or two (not more!)
3367 -- possible misspellings, these misspellings will be suggested as
3368 -- possible correction.
3370 if not (Is_Private_Type
(Prefix
) or Is_Record_Type
(Prefix
)) then
3371 -- Concurrent types should be handled as well ???
3375 Get_Name_String
(Chars
(Sel
));
3378 S
: constant String (1 .. Name_Len
) :=
3379 Name_Buffer
(1 .. Name_Len
);
3382 Comp
:= First_Entity
(Prefix
);
3384 while Nr_Of_Suggestions
<= Max_Suggestions
3385 and then Present
(Comp
)
3388 if Is_Visible_Component
(Comp
) then
3389 Get_Name_String
(Chars
(Comp
));
3391 if Is_Bad_Spelling_Of
(Name_Buffer
(1 .. Name_Len
), S
) then
3392 Nr_Of_Suggestions
:= Nr_Of_Suggestions
+ 1;
3394 case Nr_Of_Suggestions
is
3395 when 1 => Suggestion_1
:= Comp
;
3396 when 2 => Suggestion_2
:= Comp
;
3397 when others => exit;
3402 Comp
:= Next_Entity
(Comp
);
3405 -- Report at most two suggestions
3407 if Nr_Of_Suggestions
= 1 then
3408 Error_Msg_NE
("\possible misspelling of&", Sel
, Suggestion_1
);
3410 elsif Nr_Of_Suggestions
= 2 then
3411 Error_Msg_Node_2
:= Suggestion_2
;
3412 Error_Msg_NE
("\possible misspelling of& or&",
3416 end Check_Misspelled_Selector
;
3418 ----------------------
3419 -- Defined_In_Scope --
3420 ----------------------
3422 function Defined_In_Scope
(T
: Entity_Id
; S
: Entity_Id
) return Boolean
3424 S1
: constant Entity_Id
:= Scope
(Base_Type
(T
));
3428 or else (S1
= System_Aux_Id
and then S
= Scope
(S1
));
3429 end Defined_In_Scope
;
3435 procedure Diagnose_Call
(N
: Node_Id
; Nam
: Node_Id
) is
3442 Void_Interp_Seen
: Boolean := False;
3445 if Extensions_Allowed
then
3446 Actual
:= First_Actual
(N
);
3448 while Present
(Actual
) loop
3449 -- Ada0Y (AI-50217): Post an error in case of premature usage of
3450 -- an entity from the limited view.
3452 if not Analyzed
(Etype
(Actual
))
3453 and then From_With_Type
(Etype
(Actual
))
3455 Error_Msg_Qual_Level
:= 1;
3457 ("missing with_clause for scope of imported type&",
3458 Actual
, Etype
(Actual
));
3459 Error_Msg_Qual_Level
:= 0;
3462 Next_Actual
(Actual
);
3466 -- Analyze each candidate call again, with full error reporting
3470 ("no candidate interpretations match the actuals:!", Nam
);
3471 Err_Mode
:= All_Errors_Mode
;
3472 All_Errors_Mode
:= True;
3474 -- If this is a call to an operation of a concurrent type,
3475 -- the failed interpretations have been removed from the
3476 -- name. Recover them to provide full diagnostics.
3478 if Nkind
(Parent
(Nam
)) = N_Selected_Component
then
3479 Set_Entity
(Nam
, Empty
);
3480 New_Nam
:= New_Copy_Tree
(Parent
(Nam
));
3481 Set_Is_Overloaded
(New_Nam
, False);
3482 Set_Is_Overloaded
(Selector_Name
(New_Nam
), False);
3483 Set_Parent
(New_Nam
, Parent
(Parent
(Nam
)));
3484 Analyze_Selected_Component
(New_Nam
);
3485 Get_First_Interp
(Selector_Name
(New_Nam
), X
, It
);
3487 Get_First_Interp
(Nam
, X
, It
);
3490 while Present
(It
.Nam
) loop
3491 if Etype
(It
.Nam
) = Standard_Void_Type
then
3492 Void_Interp_Seen
:= True;
3495 Analyze_One_Call
(N
, It
.Nam
, True, Success
);
3496 Get_Next_Interp
(X
, It
);
3499 if Nkind
(N
) = N_Function_Call
then
3500 Get_First_Interp
(Nam
, X
, It
);
3502 while Present
(It
.Nam
) loop
3503 if Ekind
(It
.Nam
) = E_Function
3504 or else Ekind
(It
.Nam
) = E_Operator
3508 Get_Next_Interp
(X
, It
);
3512 -- If all interpretations are procedures, this deserves a
3513 -- more precise message. Ditto if this appears as the prefix
3514 -- of a selected component, which may be a lexical error.
3517 "\context requires function call, found procedure name", Nam
);
3519 if Nkind
(Parent
(N
)) = N_Selected_Component
3520 and then N
= Prefix
(Parent
(N
))
3523 "\period should probably be semicolon", Parent
(N
));
3526 elsif Nkind
(N
) = N_Procedure_Call_Statement
3527 and then not Void_Interp_Seen
3530 "\function name found in procedure call", Nam
);
3533 All_Errors_Mode
:= Err_Mode
;
3536 ---------------------------
3537 -- Find_Arithmetic_Types --
3538 ---------------------------
3540 procedure Find_Arithmetic_Types
3545 Index1
, Index2
: Interp_Index
;
3548 procedure Check_Right_Argument
(T
: Entity_Id
);
3549 -- Check right operand of operator
3551 procedure Check_Right_Argument
(T
: Entity_Id
) is
3553 if not Is_Overloaded
(R
) then
3554 Check_Arithmetic_Pair
(T
, Etype
(R
), Op_Id
, N
);
3556 Get_First_Interp
(R
, Index2
, It2
);
3558 while Present
(It2
.Typ
) loop
3559 Check_Arithmetic_Pair
(T
, It2
.Typ
, Op_Id
, N
);
3560 Get_Next_Interp
(Index2
, It2
);
3563 end Check_Right_Argument
;
3565 -- Start processing for Find_Arithmetic_Types
3568 if not Is_Overloaded
(L
) then
3569 Check_Right_Argument
(Etype
(L
));
3572 Get_First_Interp
(L
, Index1
, It1
);
3574 while Present
(It1
.Typ
) loop
3575 Check_Right_Argument
(It1
.Typ
);
3576 Get_Next_Interp
(Index1
, It1
);
3580 end Find_Arithmetic_Types
;
3582 ------------------------
3583 -- Find_Boolean_Types --
3584 ------------------------
3586 procedure Find_Boolean_Types
3591 Index
: Interp_Index
;
3594 procedure Check_Numeric_Argument
(T
: Entity_Id
);
3595 -- Special case for logical operations one of whose operands is an
3596 -- integer literal. If both are literal the result is any modular type.
3598 procedure Check_Numeric_Argument
(T
: Entity_Id
) is
3600 if T
= Universal_Integer
then
3601 Add_One_Interp
(N
, Op_Id
, Any_Modular
);
3603 elsif Is_Modular_Integer_Type
(T
) then
3604 Add_One_Interp
(N
, Op_Id
, T
);
3606 end Check_Numeric_Argument
;
3608 -- Start of processing for Find_Boolean_Types
3611 if not Is_Overloaded
(L
) then
3613 if Etype
(L
) = Universal_Integer
3614 or else Etype
(L
) = Any_Modular
3616 if not Is_Overloaded
(R
) then
3617 Check_Numeric_Argument
(Etype
(R
));
3620 Get_First_Interp
(R
, Index
, It
);
3622 while Present
(It
.Typ
) loop
3623 Check_Numeric_Argument
(It
.Typ
);
3625 Get_Next_Interp
(Index
, It
);
3629 elsif Valid_Boolean_Arg
(Etype
(L
))
3630 and then Has_Compatible_Type
(R
, Etype
(L
))
3632 Add_One_Interp
(N
, Op_Id
, Etype
(L
));
3636 Get_First_Interp
(L
, Index
, It
);
3638 while Present
(It
.Typ
) loop
3639 if Valid_Boolean_Arg
(It
.Typ
)
3640 and then Has_Compatible_Type
(R
, It
.Typ
)
3642 Add_One_Interp
(N
, Op_Id
, It
.Typ
);
3645 Get_Next_Interp
(Index
, It
);
3648 end Find_Boolean_Types
;
3650 ---------------------------
3651 -- Find_Comparison_Types --
3652 ---------------------------
3654 procedure Find_Comparison_Types
3659 Index
: Interp_Index
;
3661 Found
: Boolean := False;
3664 Scop
: Entity_Id
:= Empty
;
3666 procedure Try_One_Interp
(T1
: Entity_Id
);
3667 -- Routine to try one proposed interpretation. Note that the context
3668 -- of the operator plays no role in resolving the arguments, so that
3669 -- if there is more than one interpretation of the operands that is
3670 -- compatible with comparison, the operation is ambiguous.
3672 procedure Try_One_Interp
(T1
: Entity_Id
) is
3675 -- If the operator is an expanded name, then the type of the operand
3676 -- must be defined in the corresponding scope. If the type is
3677 -- universal, the context will impose the correct type.
3680 and then not Defined_In_Scope
(T1
, Scop
)
3681 and then T1
/= Universal_Integer
3682 and then T1
/= Universal_Real
3683 and then T1
/= Any_String
3684 and then T1
/= Any_Composite
3689 if Valid_Comparison_Arg
(T1
)
3690 and then Has_Compatible_Type
(R
, T1
)
3693 and then Base_Type
(T1
) /= Base_Type
(T_F
)
3695 It
:= Disambiguate
(L
, I_F
, Index
, Any_Type
);
3697 if It
= No_Interp
then
3698 Ambiguous_Operands
(N
);
3699 Set_Etype
(L
, Any_Type
);
3713 Find_Non_Universal_Interpretations
(N
, R
, Op_Id
, T1
);
3718 -- Start processing for Find_Comparison_Types
3721 -- If left operand is aggregate, the right operand has to
3722 -- provide a usable type for it.
3724 if Nkind
(L
) = N_Aggregate
3725 and then Nkind
(R
) /= N_Aggregate
3727 Find_Comparison_Types
(R
, L
, Op_Id
, N
);
3731 if Nkind
(N
) = N_Function_Call
3732 and then Nkind
(Name
(N
)) = N_Expanded_Name
3734 Scop
:= Entity
(Prefix
(Name
(N
)));
3736 -- The prefix may be a package renaming, and the subsequent test
3737 -- requires the original package.
3739 if Ekind
(Scop
) = E_Package
3740 and then Present
(Renamed_Entity
(Scop
))
3742 Scop
:= Renamed_Entity
(Scop
);
3743 Set_Entity
(Prefix
(Name
(N
)), Scop
);
3747 if not Is_Overloaded
(L
) then
3748 Try_One_Interp
(Etype
(L
));
3751 Get_First_Interp
(L
, Index
, It
);
3753 while Present
(It
.Typ
) loop
3754 Try_One_Interp
(It
.Typ
);
3755 Get_Next_Interp
(Index
, It
);
3758 end Find_Comparison_Types
;
3760 ----------------------------------------
3761 -- Find_Non_Universal_Interpretations --
3762 ----------------------------------------
3764 procedure Find_Non_Universal_Interpretations
3770 Index
: Interp_Index
;
3774 if T1
= Universal_Integer
3775 or else T1
= Universal_Real
3777 if not Is_Overloaded
(R
) then
3779 (N
, Op_Id
, Standard_Boolean
, Base_Type
(Etype
(R
)));
3781 Get_First_Interp
(R
, Index
, It
);
3783 while Present
(It
.Typ
) loop
3784 if Covers
(It
.Typ
, T1
) then
3786 (N
, Op_Id
, Standard_Boolean
, Base_Type
(It
.Typ
));
3789 Get_Next_Interp
(Index
, It
);
3793 Add_One_Interp
(N
, Op_Id
, Standard_Boolean
, Base_Type
(T1
));
3795 end Find_Non_Universal_Interpretations
;
3797 ------------------------------
3798 -- Find_Concatenation_Types --
3799 ------------------------------
3801 procedure Find_Concatenation_Types
3806 Op_Type
: constant Entity_Id
:= Etype
(Op_Id
);
3809 if Is_Array_Type
(Op_Type
)
3810 and then not Is_Limited_Type
(Op_Type
)
3812 and then (Has_Compatible_Type
(L
, Op_Type
)
3814 Has_Compatible_Type
(L
, Component_Type
(Op_Type
)))
3816 and then (Has_Compatible_Type
(R
, Op_Type
)
3818 Has_Compatible_Type
(R
, Component_Type
(Op_Type
)))
3820 Add_One_Interp
(N
, Op_Id
, Op_Type
);
3822 end Find_Concatenation_Types
;
3824 -------------------------
3825 -- Find_Equality_Types --
3826 -------------------------
3828 procedure Find_Equality_Types
3833 Index
: Interp_Index
;
3835 Found
: Boolean := False;
3838 Scop
: Entity_Id
:= Empty
;
3840 procedure Try_One_Interp
(T1
: Entity_Id
);
3841 -- The context of the operator plays no role in resolving the
3842 -- arguments, so that if there is more than one interpretation
3843 -- of the operands that is compatible with equality, the construct
3844 -- is ambiguous and an error can be emitted now, after trying to
3845 -- disambiguate, i.e. applying preference rules.
3847 procedure Try_One_Interp
(T1
: Entity_Id
) is
3850 -- If the operator is an expanded name, then the type of the operand
3851 -- must be defined in the corresponding scope. If the type is
3852 -- universal, the context will impose the correct type. An anonymous
3853 -- type for a 'Access reference is also universal in this sense, as
3854 -- the actual type is obtained from context.
3857 and then not Defined_In_Scope
(T1
, Scop
)
3858 and then T1
/= Universal_Integer
3859 and then T1
/= Universal_Real
3860 and then T1
/= Any_Access
3861 and then T1
/= Any_String
3862 and then T1
/= Any_Composite
3863 and then (Ekind
(T1
) /= E_Access_Subprogram_Type
3864 or else Comes_From_Source
(T1
))
3869 if T1
/= Standard_Void_Type
3870 and then not Is_Limited_Type
(T1
)
3871 and then not Is_Limited_Composite
(T1
)
3872 and then Ekind
(T1
) /= E_Anonymous_Access_Type
3873 and then Has_Compatible_Type
(R
, T1
)
3876 and then Base_Type
(T1
) /= Base_Type
(T_F
)
3878 It
:= Disambiguate
(L
, I_F
, Index
, Any_Type
);
3880 if It
= No_Interp
then
3881 Ambiguous_Operands
(N
);
3882 Set_Etype
(L
, Any_Type
);
3895 if not Analyzed
(L
) then
3899 Find_Non_Universal_Interpretations
(N
, R
, Op_Id
, T1
);
3901 if Etype
(N
) = Any_Type
then
3903 -- Operator was not visible.
3910 -- Start of processing for Find_Equality_Types
3913 -- If left operand is aggregate, the right operand has to
3914 -- provide a usable type for it.
3916 if Nkind
(L
) = N_Aggregate
3917 and then Nkind
(R
) /= N_Aggregate
3919 Find_Equality_Types
(R
, L
, Op_Id
, N
);
3923 if Nkind
(N
) = N_Function_Call
3924 and then Nkind
(Name
(N
)) = N_Expanded_Name
3926 Scop
:= Entity
(Prefix
(Name
(N
)));
3928 -- The prefix may be a package renaming, and the subsequent test
3929 -- requires the original package.
3931 if Ekind
(Scop
) = E_Package
3932 and then Present
(Renamed_Entity
(Scop
))
3934 Scop
:= Renamed_Entity
(Scop
);
3935 Set_Entity
(Prefix
(Name
(N
)), Scop
);
3939 if not Is_Overloaded
(L
) then
3940 Try_One_Interp
(Etype
(L
));
3943 Get_First_Interp
(L
, Index
, It
);
3945 while Present
(It
.Typ
) loop
3946 Try_One_Interp
(It
.Typ
);
3947 Get_Next_Interp
(Index
, It
);
3950 end Find_Equality_Types
;
3952 -------------------------
3953 -- Find_Negation_Types --
3954 -------------------------
3956 procedure Find_Negation_Types
3961 Index
: Interp_Index
;
3965 if not Is_Overloaded
(R
) then
3967 if Etype
(R
) = Universal_Integer
then
3968 Add_One_Interp
(N
, Op_Id
, Any_Modular
);
3970 elsif Valid_Boolean_Arg
(Etype
(R
)) then
3971 Add_One_Interp
(N
, Op_Id
, Etype
(R
));
3975 Get_First_Interp
(R
, Index
, It
);
3977 while Present
(It
.Typ
) loop
3978 if Valid_Boolean_Arg
(It
.Typ
) then
3979 Add_One_Interp
(N
, Op_Id
, It
.Typ
);
3982 Get_Next_Interp
(Index
, It
);
3985 end Find_Negation_Types
;
3987 ----------------------
3988 -- Find_Unary_Types --
3989 ----------------------
3991 procedure Find_Unary_Types
3996 Index
: Interp_Index
;
4000 if not Is_Overloaded
(R
) then
4001 if Is_Numeric_Type
(Etype
(R
)) then
4002 Add_One_Interp
(N
, Op_Id
, Base_Type
(Etype
(R
)));
4006 Get_First_Interp
(R
, Index
, It
);
4008 while Present
(It
.Typ
) loop
4009 if Is_Numeric_Type
(It
.Typ
) then
4010 Add_One_Interp
(N
, Op_Id
, Base_Type
(It
.Typ
));
4013 Get_Next_Interp
(Index
, It
);
4016 end Find_Unary_Types
;
4022 function Junk_Operand
(N
: Node_Id
) return Boolean is
4026 if Error_Posted
(N
) then
4030 -- Get entity to be tested
4032 if Is_Entity_Name
(N
)
4033 and then Present
(Entity
(N
))
4037 -- An odd case, a procedure name gets converted to a very peculiar
4038 -- function call, and here is where we detect this happening.
4040 elsif Nkind
(N
) = N_Function_Call
4041 and then Is_Entity_Name
(Name
(N
))
4042 and then Present
(Entity
(Name
(N
)))
4046 -- Another odd case, there are at least some cases of selected
4047 -- components where the selected component is not marked as having
4048 -- an entity, even though the selector does have an entity
4050 elsif Nkind
(N
) = N_Selected_Component
4051 and then Present
(Entity
(Selector_Name
(N
)))
4053 Enode
:= Selector_Name
(N
);
4059 -- Now test the entity we got to see if it a bad case
4061 case Ekind
(Entity
(Enode
)) is
4065 ("package name cannot be used as operand", Enode
);
4067 when Generic_Unit_Kind
=>
4069 ("generic unit name cannot be used as operand", Enode
);
4073 ("subtype name cannot be used as operand", Enode
);
4077 ("entry name cannot be used as operand", Enode
);
4081 ("procedure name cannot be used as operand", Enode
);
4085 ("exception name cannot be used as operand", Enode
);
4087 when E_Block | E_Label | E_Loop
=>
4089 ("label name cannot be used as operand", Enode
);
4099 --------------------
4100 -- Operator_Check --
4101 --------------------
4103 procedure Operator_Check
(N
: Node_Id
) is
4105 -- Test for case of no interpretation found for operator
4107 if Etype
(N
) = Any_Type
then
4113 R
:= Right_Opnd
(N
);
4115 if Nkind
(N
) in N_Binary_Op
then
4121 -- If either operand has no type, then don't complain further,
4122 -- since this simply means that we have a propragated error.
4125 or else Etype
(R
) = Any_Type
4126 or else (Nkind
(N
) in N_Binary_Op
and then Etype
(L
) = Any_Type
)
4130 -- We explicitly check for the case of concatenation of
4131 -- component with component to avoid reporting spurious
4132 -- matching array types that might happen to be lurking
4133 -- in distant packages (such as run-time packages). This
4134 -- also prevents inconsistencies in the messages for certain
4135 -- ACVC B tests, which can vary depending on types declared
4136 -- in run-time interfaces. A further improvement, when
4137 -- aggregates are present, is to look for a well-typed operand.
4139 elsif Present
(Candidate_Type
)
4140 and then (Nkind
(N
) /= N_Op_Concat
4141 or else Is_Array_Type
(Etype
(L
))
4142 or else Is_Array_Type
(Etype
(R
)))
4145 if Nkind
(N
) = N_Op_Concat
then
4146 if Etype
(L
) /= Any_Composite
4147 and then Is_Array_Type
(Etype
(L
))
4149 Candidate_Type
:= Etype
(L
);
4151 elsif Etype
(R
) /= Any_Composite
4152 and then Is_Array_Type
(Etype
(R
))
4154 Candidate_Type
:= Etype
(R
);
4159 ("operator for} is not directly visible!",
4160 N
, First_Subtype
(Candidate_Type
));
4161 Error_Msg_N
("use clause would make operation legal!", N
);
4164 -- If either operand is a junk operand (e.g. package name), then
4165 -- post appropriate error messages, but do not complain further.
4167 -- Note that the use of OR in this test instead of OR ELSE
4168 -- is quite deliberate, we may as well check both operands
4169 -- in the binary operator case.
4171 elsif Junk_Operand
(R
)
4172 or (Nkind
(N
) in N_Binary_Op
and then Junk_Operand
(L
))
4176 -- If we have a logical operator, one of whose operands is
4177 -- Boolean, then we know that the other operand cannot resolve
4178 -- to Boolean (since we got no interpretations), but in that
4179 -- case we pretty much know that the other operand should be
4180 -- Boolean, so resolve it that way (generating an error)
4182 elsif Nkind
(N
) = N_Op_And
4186 Nkind
(N
) = N_Op_Xor
4188 if Etype
(L
) = Standard_Boolean
then
4189 Resolve
(R
, Standard_Boolean
);
4191 elsif Etype
(R
) = Standard_Boolean
then
4192 Resolve
(L
, Standard_Boolean
);
4196 -- For an arithmetic operator or comparison operator, if one
4197 -- of the operands is numeric, then we know the other operand
4198 -- is not the same numeric type. If it is a non-numeric type,
4199 -- then probably it is intended to match the other operand.
4201 elsif Nkind
(N
) = N_Op_Add
or else
4202 Nkind
(N
) = N_Op_Divide
or else
4203 Nkind
(N
) = N_Op_Ge
or else
4204 Nkind
(N
) = N_Op_Gt
or else
4205 Nkind
(N
) = N_Op_Le
or else
4206 Nkind
(N
) = N_Op_Lt
or else
4207 Nkind
(N
) = N_Op_Mod
or else
4208 Nkind
(N
) = N_Op_Multiply
or else
4209 Nkind
(N
) = N_Op_Rem
or else
4210 Nkind
(N
) = N_Op_Subtract
4212 if Is_Numeric_Type
(Etype
(L
))
4213 and then not Is_Numeric_Type
(Etype
(R
))
4215 Resolve
(R
, Etype
(L
));
4218 elsif Is_Numeric_Type
(Etype
(R
))
4219 and then not Is_Numeric_Type
(Etype
(L
))
4221 Resolve
(L
, Etype
(R
));
4225 -- Comparisons on A'Access are common enough to deserve a
4228 elsif (Nkind
(N
) = N_Op_Eq
or else
4229 Nkind
(N
) = N_Op_Ne
)
4230 and then Ekind
(Etype
(L
)) = E_Access_Attribute_Type
4231 and then Ekind
(Etype
(R
)) = E_Access_Attribute_Type
4234 ("two access attributes cannot be compared directly", N
);
4236 ("\they must be converted to an explicit type for comparison",
4240 -- Another one for C programmers
4242 elsif Nkind
(N
) = N_Op_Concat
4243 and then Valid_Boolean_Arg
(Etype
(L
))
4244 and then Valid_Boolean_Arg
(Etype
(R
))
4246 Error_Msg_N
("invalid operands for concatenation", N
);
4247 Error_Msg_N
("\maybe AND was meant", N
);
4250 -- A special case for comparison of access parameter with null
4252 elsif Nkind
(N
) = N_Op_Eq
4253 and then Is_Entity_Name
(L
)
4254 and then Nkind
(Parent
(Entity
(L
))) = N_Parameter_Specification
4255 and then Nkind
(Parameter_Type
(Parent
(Entity
(L
)))) =
4257 and then Nkind
(R
) = N_Null
4259 Error_Msg_N
("access parameter is not allowed to be null", L
);
4260 Error_Msg_N
("\(call would raise Constraint_Error)", L
);
4264 -- If we fall through then just give general message. Note
4265 -- that in the following messages, if the operand is overloaded
4266 -- we choose an arbitrary type to complain about, but that is
4267 -- probably more useful than not giving a type at all.
4269 if Nkind
(N
) in N_Unary_Op
then
4270 Error_Msg_Node_2
:= Etype
(R
);
4271 Error_Msg_N
("operator& not defined for}", N
);
4275 if Nkind
(N
) in N_Binary_Op
then
4276 if not Is_Overloaded
(L
)
4277 and then not Is_Overloaded
(R
)
4278 and then Base_Type
(Etype
(L
)) = Base_Type
(Etype
(R
))
4280 Error_Msg_Node_2
:= Etype
(R
);
4281 Error_Msg_N
("there is no applicable operator& for}", N
);
4284 Error_Msg_N
("invalid operand types for operator&", N
);
4286 if Nkind
(N
) /= N_Op_Concat
then
4287 Error_Msg_NE
("\left operand has}!", N
, Etype
(L
));
4288 Error_Msg_NE
("\right operand has}!", N
, Etype
(R
));
4297 -----------------------
4298 -- Try_Indirect_Call --
4299 -----------------------
4301 function Try_Indirect_Call
4307 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
4312 Actual
:= First
(Actuals
);
4313 Formal
:= First_Formal
(Designated_Type
(Typ
));
4314 while Present
(Actual
)
4315 and then Present
(Formal
)
4317 if not Has_Compatible_Type
(Actual
, Etype
(Formal
)) then
4322 Next_Formal
(Formal
);
4325 if No
(Actual
) and then No
(Formal
) then
4326 Add_One_Interp
(N
, Nam
, Etype
(Designated_Type
(Typ
)));
4328 -- Nam is a candidate interpretation for the name in the call,
4329 -- if it is not an indirect call.
4331 if not Is_Type
(Nam
)
4332 and then Is_Entity_Name
(Name
(N
))
4334 Set_Entity
(Name
(N
), Nam
);
4341 end Try_Indirect_Call
;
4343 ----------------------
4344 -- Try_Indexed_Call --
4345 ----------------------
4347 function Try_Indexed_Call
4353 Actuals
: constant List_Id
:= Parameter_Associations
(N
);
4358 Actual
:= First
(Actuals
);
4359 Index
:= First_Index
(Typ
);
4360 while Present
(Actual
)
4361 and then Present
(Index
)
4363 -- If the parameter list has a named association, the expression
4364 -- is definitely a call and not an indexed component.
4366 if Nkind
(Actual
) = N_Parameter_Association
then
4370 if not Has_Compatible_Type
(Actual
, Etype
(Index
)) then
4378 if No
(Actual
) and then No
(Index
) then
4379 Add_One_Interp
(N
, Nam
, Component_Type
(Typ
));
4381 -- Nam is a candidate interpretation for the name in the call,
4382 -- if it is not an indirect call.
4384 if not Is_Type
(Nam
)
4385 and then Is_Entity_Name
(Name
(N
))
4387 Set_Entity
(Name
(N
), Nam
);
4395 end Try_Indexed_Call
;