1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2005 Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 2, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Atree; use Atree;
28 with Checks; use Checks;
29 with Debug; use Debug;
30 with Einfo; use Einfo;
31 with Elists; use Elists;
32 with Errout; use Errout;
33 with Exp_Util; use Exp_Util;
34 with Fname; use Fname;
35 with Itypes; use Itypes;
37 with Lib.Xref; use Lib.Xref;
38 with Namet; use Namet;
39 with Nlists; use Nlists;
40 with Nmake; use Nmake;
42 with Output; use Output;
43 with Restrict; use Restrict;
44 with Rident; use Rident;
46 with Sem_Cat; use Sem_Cat;
47 with Sem_Ch3; use Sem_Ch3;
48 with Sem_Ch8; use Sem_Ch8;
49 with Sem_Dist; use Sem_Dist;
50 with Sem_Eval; use Sem_Eval;
51 with Sem_Res; use Sem_Res;
52 with Sem_Util; use Sem_Util;
53 with Sem_Type; use Sem_Type;
54 with Stand; use Stand;
55 with Sinfo; use Sinfo;
56 with Snames; use Snames;
57 with Tbuild; use Tbuild;
59 with GNAT.Spelling_Checker; use GNAT.Spelling_Checker;
61 package body Sem_Ch4 is
63 -----------------------
64 -- Local Subprograms --
65 -----------------------
67 procedure Analyze_Expression (N : Node_Id);
68 -- For expressions that are not names, this is just a call to analyze.
69 -- If the expression is a name, it may be a call to a parameterless
70 -- function, and if so must be converted into an explicit call node
71 -- and analyzed as such. This deproceduring must be done during the first
72 -- pass of overload resolution, because otherwise a procedure call with
73 -- overloaded actuals may fail to resolve. See 4327-001 for an example.
75 procedure Analyze_Operator_Call (N : Node_Id; Op_Id : Entity_Id);
76 -- Analyze a call of the form "+"(x, y), etc. The prefix of the call
77 -- is an operator name or an expanded name whose selector is an operator
78 -- name, and one possible interpretation is as a predefined operator.
80 procedure Analyze_Overloaded_Selected_Component (N : Node_Id);
81 -- If the prefix of a selected_component is overloaded, the proper
82 -- interpretation that yields a record type with the proper selector
83 -- name must be selected.
85 procedure Analyze_User_Defined_Binary_Op (N : Node_Id; Op_Id : Entity_Id);
86 -- Procedure to analyze a user defined binary operator, which is resolved
87 -- like a function, but instead of a list of actuals it is presented
88 -- with the left and right operands of an operator node.
90 procedure Analyze_User_Defined_Unary_Op (N : Node_Id; Op_Id : Entity_Id);
91 -- Procedure to analyze a user defined unary operator, which is resolved
92 -- like a function, but instead of a list of actuals, it is presented with
93 -- the operand of the operator node.
95 procedure Ambiguous_Operands (N : Node_Id);
96 -- for equality, membership, and comparison operators with overloaded
97 -- arguments, list possible interpretations.
99 procedure Analyze_One_Call
103 Success : out Boolean);
104 -- Check one interpretation of an overloaded subprogram name for
105 -- compatibility with the types of the actuals in a call. If there is a
106 -- single interpretation which does not match, post error if Report is
109 -- Nam is the entity that provides the formals against which the actuals
110 -- are checked. Nam is either the name of a subprogram, or the internal
111 -- subprogram type constructed for an access_to_subprogram. If the actuals
112 -- are compatible with Nam, then Nam is added to the list of candidate
113 -- interpretations for N, and Success is set to True.
115 procedure Check_Misspelled_Selector
118 -- Give possible misspelling diagnostic if Sel is likely to be
119 -- a misspelling of one of the selectors of the Prefix.
120 -- This is called by Analyze_Selected_Component after producing
121 -- an invalid selector error message.
123 function Defined_In_Scope (T : Entity_Id; S : Entity_Id) return Boolean;
124 -- Verify that type T is declared in scope S. Used to find intepretations
125 -- for operators given by expanded names. This is abstracted as a separate
126 -- function to handle extensions to System, where S is System, but T is
127 -- declared in the extension.
129 procedure Find_Arithmetic_Types
133 -- L and R are the operands of an arithmetic operator. Find
134 -- consistent pairs of interpretations for L and R that have a
135 -- numeric type consistent with the semantics of the operator.
137 procedure Find_Comparison_Types
141 -- L and R are operands of a comparison operator. Find consistent
142 -- pairs of interpretations for L and R.
144 procedure Find_Concatenation_Types
148 -- For the four varieties of concatenation
150 procedure Find_Equality_Types
154 -- Ditto for equality operators
156 procedure Find_Boolean_Types
160 -- Ditto for binary logical operations
162 procedure Find_Negation_Types
166 -- Find consistent interpretation for operand of negation operator
168 procedure Find_Non_Universal_Interpretations
173 -- For equality and comparison operators, the result is always boolean,
174 -- and the legality of the operation is determined from the visibility
175 -- of the operand types. If one of the operands has a universal interpre-
176 -- tation, the legality check uses some compatible non-universal
177 -- interpretation of the other operand. N can be an operator node, or
178 -- a function call whose name is an operator designator.
180 procedure Find_Unary_Types
184 -- Unary arithmetic types: plus, minus, abs
186 procedure Check_Arithmetic_Pair
190 -- Subsidiary procedure to Find_Arithmetic_Types. T1 and T2 are valid
191 -- types for left and right operand. Determine whether they constitute
192 -- a valid pair for the given operator, and record the corresponding
193 -- interpretation of the operator node. The node N may be an operator
194 -- node (the usual case) or a function call whose prefix is an operator
195 -- designator. In both cases Op_Id is the operator name itself.
197 procedure Diagnose_Call (N : Node_Id; Nam : Node_Id);
198 -- Give detailed information on overloaded call where none of the
199 -- interpretations match. N is the call node, Nam the designator for
200 -- the overloaded entity being called.
202 function Junk_Operand (N : Node_Id) return Boolean;
203 -- Test for an operand that is an inappropriate entity (e.g. a package
204 -- name or a label). If so, issue an error message and return True. If
205 -- the operand is not an inappropriate entity kind, return False.
207 procedure Operator_Check (N : Node_Id);
208 -- Verify that an operator has received some valid interpretation. If none
209 -- was found, determine whether a use clause would make the operation
210 -- legal. The variable Candidate_Type (defined in Sem_Type) is set for
211 -- every type compatible with the operator, even if the operator for the
212 -- type is not directly visible. The routine uses this type to emit a more
213 -- informative message.
215 procedure Process_Implicit_Dereference_Prefix
218 -- Called when P is the prefix of an implicit dereference, denoting an
219 -- object E. If in semantics only mode (-gnatc or generic), record that is
220 -- a reference to E. Normally, such a reference is generated only when the
221 -- implicit dereference is expanded into an explicit one. E may be empty,
222 -- in which case this procedure does nothing.
224 procedure Remove_Abstract_Operations (N : Node_Id);
225 -- Ada 2005: implementation of AI-310. An abstract non-dispatching
226 -- operation is not a candidate interpretation.
228 function Try_Indexed_Call
231 Typ : Entity_Id) return Boolean;
232 -- If a function has defaults for all its actuals, a call to it may
233 -- in fact be an indexing on the result of the call. Try_Indexed_Call
234 -- attempts the interpretation as an indexing, prior to analysis as
235 -- a call. If both are possible, the node is overloaded with both
236 -- interpretations (same symbol but two different types).
238 function Try_Indirect_Call
241 Typ : Entity_Id) return Boolean;
242 -- Similarly, a function F that needs no actuals can return an access
243 -- to a subprogram, and the call F (X) interpreted as F.all (X). In
244 -- this case the call may be overloaded with both interpretations.
246 function Try_Object_Operation (N : Node_Id) return Boolean;
247 -- Ada 2005 (AI-252): Give support to the object operation notation
249 ------------------------
250 -- Ambiguous_Operands --
251 ------------------------
253 procedure Ambiguous_Operands (N : Node_Id) is
254 procedure List_Operand_Interps (Opnd : Node_Id);
256 --------------------------
257 -- List_Operand_Interps --
258 --------------------------
260 procedure List_Operand_Interps (Opnd : Node_Id) is
265 if Is_Overloaded (Opnd) then
266 if Nkind (Opnd) in N_Op then
268 elsif Nkind (Opnd) = N_Function_Call then
278 if Opnd = Left_Opnd (N) then
280 ("\left operand has the following interpretations", N);
283 ("\right operand has the following interpretations", N);
287 List_Interps (Nam, Err);
288 end List_Operand_Interps;
290 -- Start of processing for Ambiguous_Operands
294 or else Nkind (N) = N_Not_In
296 Error_Msg_N ("ambiguous operands for membership", N);
298 elsif Nkind (N) = N_Op_Eq
299 or else Nkind (N) = N_Op_Ne
301 Error_Msg_N ("ambiguous operands for equality", N);
304 Error_Msg_N ("ambiguous operands for comparison", N);
307 if All_Errors_Mode then
308 List_Operand_Interps (Left_Opnd (N));
309 List_Operand_Interps (Right_Opnd (N));
311 Error_Msg_N ("\use -gnatf switch for details", N);
313 end Ambiguous_Operands;
315 -----------------------
316 -- Analyze_Aggregate --
317 -----------------------
319 -- Most of the analysis of Aggregates requires that the type be known,
320 -- and is therefore put off until resolution.
322 procedure Analyze_Aggregate (N : Node_Id) is
324 if No (Etype (N)) then
325 Set_Etype (N, Any_Composite);
327 end Analyze_Aggregate;
329 -----------------------
330 -- Analyze_Allocator --
331 -----------------------
333 procedure Analyze_Allocator (N : Node_Id) is
334 Loc : constant Source_Ptr := Sloc (N);
335 Sav_Errs : constant Nat := Serious_Errors_Detected;
336 E : Node_Id := Expression (N);
337 Acc_Type : Entity_Id;
341 Check_Restriction (No_Allocators, N);
343 if Nkind (E) = N_Qualified_Expression then
344 Acc_Type := Create_Itype (E_Allocator_Type, N);
345 Set_Etype (Acc_Type, Acc_Type);
346 Init_Size_Align (Acc_Type);
347 Find_Type (Subtype_Mark (E));
348 Type_Id := Entity (Subtype_Mark (E));
349 Check_Fully_Declared (Type_Id, N);
350 Set_Directly_Designated_Type (Acc_Type, Type_Id);
352 if Is_Limited_Type (Type_Id)
353 and then Comes_From_Source (N)
354 and then not In_Instance_Body
356 -- Ada 2005 (AI-287): Do not post an error if the expression
357 -- corresponds to a limited aggregate. Limited aggregates
358 -- are checked in sem_aggr in a per-component manner
359 -- (compare with handling of Get_Value subprogram).
361 if Ada_Version >= Ada_05
362 and then Nkind (Expression (E)) = N_Aggregate
366 Error_Msg_N ("initialization not allowed for limited types", N);
367 Explain_Limited_Type (Type_Id, N);
371 Analyze_And_Resolve (Expression (E), Type_Id);
373 -- A qualified expression requires an exact match of the type,
374 -- class-wide matching is not allowed.
376 if Is_Class_Wide_Type (Type_Id)
377 and then Base_Type (Etype (Expression (E))) /= Base_Type (Type_Id)
379 Wrong_Type (Expression (E), Type_Id);
382 Check_Non_Static_Context (Expression (E));
384 -- We don't analyze the qualified expression itself because it's
385 -- part of the allocator
387 Set_Etype (E, Type_Id);
389 -- Case where no qualified expression is present
394 Base_Typ : Entity_Id;
397 -- If the allocator includes a N_Subtype_Indication then a
398 -- constraint is present, otherwise the node is a subtype mark.
399 -- Introduce an explicit subtype declaration into the tree
400 -- defining some anonymous subtype and rewrite the allocator to
401 -- use this subtype rather than the subtype indication.
403 -- It is important to introduce the explicit subtype declaration
404 -- so that the bounds of the subtype indication are attached to
405 -- the tree in case the allocator is inside a generic unit.
407 if Nkind (E) = N_Subtype_Indication then
409 -- A constraint is only allowed for a composite type in Ada
410 -- 95. In Ada 83, a constraint is also allowed for an
411 -- access-to-composite type, but the constraint is ignored.
413 Find_Type (Subtype_Mark (E));
414 Base_Typ := Entity (Subtype_Mark (E));
416 if Is_Elementary_Type (Base_Typ) then
417 if not (Ada_Version = Ada_83
418 and then Is_Access_Type (Base_Typ))
420 Error_Msg_N ("constraint not allowed here", E);
422 if Nkind (Constraint (E))
423 = N_Index_Or_Discriminant_Constraint
426 ("\if qualified expression was meant, " &
427 "use apostrophe", Constraint (E));
431 -- Get rid of the bogus constraint:
433 Rewrite (E, New_Copy_Tree (Subtype_Mark (E)));
434 Analyze_Allocator (N);
437 -- Ada 2005, AI-363: if the designated type has a constrained
438 -- partial view, it cannot receive a discriminant constraint,
439 -- and the allocated object is unconstrained.
441 elsif Ada_Version >= Ada_05
442 and then Has_Constrained_Partial_View (Base_Typ)
445 ("constraint no allowed when type " &
446 "has a constrained partial view", Constraint (E));
449 if Expander_Active then
451 Make_Defining_Identifier (Loc, New_Internal_Name ('S'));
454 Make_Subtype_Declaration (Loc,
455 Defining_Identifier => Def_Id,
456 Subtype_Indication => Relocate_Node (E)));
458 if Sav_Errs /= Serious_Errors_Detected
459 and then Nkind (Constraint (E))
460 = N_Index_Or_Discriminant_Constraint
463 ("if qualified expression was meant, " &
464 "use apostrophe!", Constraint (E));
467 E := New_Occurrence_Of (Def_Id, Loc);
468 Rewrite (Expression (N), E);
472 Type_Id := Process_Subtype (E, N);
473 Acc_Type := Create_Itype (E_Allocator_Type, N);
474 Set_Etype (Acc_Type, Acc_Type);
475 Init_Size_Align (Acc_Type);
476 Set_Directly_Designated_Type (Acc_Type, Type_Id);
477 Check_Fully_Declared (Type_Id, N);
481 if Can_Never_Be_Null (Type_Id) then
482 Error_Msg_N ("(Ada 2005) qualified expression required",
486 -- Check restriction against dynamically allocated protected
487 -- objects. Note that when limited aggregates are supported,
488 -- a similar test should be applied to an allocator with a
489 -- qualified expression ???
491 if Is_Protected_Type (Type_Id) then
492 Check_Restriction (No_Protected_Type_Allocators, N);
495 -- Check for missing initialization. Skip this check if we already
496 -- had errors on analyzing the allocator, since in that case these
497 -- are probably cascaded errors
499 if Is_Indefinite_Subtype (Type_Id)
500 and then Serious_Errors_Detected = Sav_Errs
502 if Is_Class_Wide_Type (Type_Id) then
504 ("initialization required in class-wide allocation", N);
507 ("initialization required in unconstrained allocation", N);
513 if Is_Abstract (Type_Id) then
514 Error_Msg_N ("cannot allocate abstract object", E);
517 if Has_Task (Designated_Type (Acc_Type)) then
518 Check_Restriction (No_Tasking, N);
519 Check_Restriction (Max_Tasks, N);
520 Check_Restriction (No_Task_Allocators, N);
523 -- If the No_Streams restriction is set, check that the type of the
524 -- object is not, and does not contain, any subtype derived from
525 -- Ada.Streams.Root_Stream_Type. Note that we guard the call to
526 -- Has_Stream just for efficiency reasons. There is no point in
527 -- spending time on a Has_Stream check if the restriction is not set.
529 if Restrictions.Set (No_Streams) then
530 if Has_Stream (Designated_Type (Acc_Type)) then
531 Check_Restriction (No_Streams, N);
535 Set_Etype (N, Acc_Type);
537 if not Is_Library_Level_Entity (Acc_Type) then
538 Check_Restriction (No_Local_Allocators, N);
541 -- Ada 2005 (AI-231): Static checks
543 if Ada_Version >= Ada_05
544 and then (Null_Exclusion_Present (N)
545 or else Can_Never_Be_Null (Etype (N)))
547 Null_Exclusion_Static_Checks (N);
550 if Serious_Errors_Detected > Sav_Errs then
551 Set_Error_Posted (N);
552 Set_Etype (N, Any_Type);
554 end Analyze_Allocator;
556 ---------------------------
557 -- Analyze_Arithmetic_Op --
558 ---------------------------
560 procedure Analyze_Arithmetic_Op (N : Node_Id) is
561 L : constant Node_Id := Left_Opnd (N);
562 R : constant Node_Id := Right_Opnd (N);
566 Candidate_Type := Empty;
567 Analyze_Expression (L);
568 Analyze_Expression (R);
570 -- If the entity is already set, the node is the instantiation of
571 -- a generic node with a non-local reference, or was manufactured
572 -- by a call to Make_Op_xxx. In either case the entity is known to
573 -- be valid, and we do not need to collect interpretations, instead
574 -- we just get the single possible interpretation.
578 if Present (Op_Id) then
579 if Ekind (Op_Id) = E_Operator then
581 if (Nkind (N) = N_Op_Divide or else
582 Nkind (N) = N_Op_Mod or else
583 Nkind (N) = N_Op_Multiply or else
584 Nkind (N) = N_Op_Rem)
585 and then Treat_Fixed_As_Integer (N)
589 Set_Etype (N, Any_Type);
590 Find_Arithmetic_Types (L, R, Op_Id, N);
594 Set_Etype (N, Any_Type);
595 Add_One_Interp (N, Op_Id, Etype (Op_Id));
598 -- Entity is not already set, so we do need to collect interpretations
601 Op_Id := Get_Name_Entity_Id (Chars (N));
602 Set_Etype (N, Any_Type);
604 while Present (Op_Id) loop
605 if Ekind (Op_Id) = E_Operator
606 and then Present (Next_Entity (First_Entity (Op_Id)))
608 Find_Arithmetic_Types (L, R, Op_Id, N);
610 -- The following may seem superfluous, because an operator cannot
611 -- be generic, but this ignores the cleverness of the author of
614 elsif Is_Overloadable (Op_Id) then
615 Analyze_User_Defined_Binary_Op (N, Op_Id);
618 Op_Id := Homonym (Op_Id);
623 end Analyze_Arithmetic_Op;
629 -- Function, procedure, and entry calls are checked here. The Name in
630 -- the call may be overloaded. The actuals have been analyzed and may
631 -- themselves be overloaded. On exit from this procedure, the node N
632 -- may have zero, one or more interpretations. In the first case an
633 -- error message is produced. In the last case, the node is flagged
634 -- as overloaded and the interpretations are collected in All_Interp.
636 -- If the name is an Access_To_Subprogram, it cannot be overloaded, but
637 -- the type-checking is similar to that of other calls.
639 procedure Analyze_Call (N : Node_Id) is
640 Actuals : constant List_Id := Parameter_Associations (N);
641 Nam : Node_Id := Name (N);
645 Success : Boolean := False;
647 function Name_Denotes_Function return Boolean;
648 -- If the type of the name is an access to subprogram, this may be
649 -- the type of a name, or the return type of the function being called.
650 -- If the name is not an entity then it can denote a protected function.
651 -- Until we distinguish Etype from Return_Type, we must use this
652 -- routine to resolve the meaning of the name in the call.
654 ---------------------------
655 -- Name_Denotes_Function --
656 ---------------------------
658 function Name_Denotes_Function return Boolean is
660 if Is_Entity_Name (Nam) then
661 return Ekind (Entity (Nam)) = E_Function;
663 elsif Nkind (Nam) = N_Selected_Component then
664 return Ekind (Entity (Selector_Name (Nam))) = E_Function;
669 end Name_Denotes_Function;
671 -- Start of processing for Analyze_Call
674 -- Initialize the type of the result of the call to the error type,
675 -- which will be reset if the type is successfully resolved.
677 Set_Etype (N, Any_Type);
679 if not Is_Overloaded (Nam) then
681 -- Only one interpretation to check
683 if Ekind (Etype (Nam)) = E_Subprogram_Type then
684 Nam_Ent := Etype (Nam);
686 -- If the prefix is an access_to_subprogram, this may be an indirect
687 -- call. This is the case if the name in the call is not an entity
688 -- name, or if it is a function name in the context of a procedure
689 -- call. In this latter case, we have a call to a parameterless
690 -- function that returns a pointer_to_procedure which is the entity
693 elsif Is_Access_Type (Etype (Nam))
694 and then Ekind (Designated_Type (Etype (Nam))) = E_Subprogram_Type
696 (not Name_Denotes_Function
697 or else Nkind (N) = N_Procedure_Call_Statement)
699 Nam_Ent := Designated_Type (Etype (Nam));
700 Insert_Explicit_Dereference (Nam);
702 -- Selected component case. Simple entry or protected operation,
703 -- where the entry name is given by the selector name.
705 elsif Nkind (Nam) = N_Selected_Component then
706 Nam_Ent := Entity (Selector_Name (Nam));
708 if Ekind (Nam_Ent) /= E_Entry
709 and then Ekind (Nam_Ent) /= E_Entry_Family
710 and then Ekind (Nam_Ent) /= E_Function
711 and then Ekind (Nam_Ent) /= E_Procedure
713 Error_Msg_N ("name in call is not a callable entity", Nam);
714 Set_Etype (N, Any_Type);
718 -- If the name is an Indexed component, it can be a call to a member
719 -- of an entry family. The prefix must be a selected component whose
720 -- selector is the entry. Analyze_Procedure_Call normalizes several
721 -- kinds of call into this form.
723 elsif Nkind (Nam) = N_Indexed_Component then
725 if Nkind (Prefix (Nam)) = N_Selected_Component then
726 Nam_Ent := Entity (Selector_Name (Prefix (Nam)));
728 Error_Msg_N ("name in call is not a callable entity", Nam);
729 Set_Etype (N, Any_Type);
733 elsif not Is_Entity_Name (Nam) then
734 Error_Msg_N ("name in call is not a callable entity", Nam);
735 Set_Etype (N, Any_Type);
739 Nam_Ent := Entity (Nam);
741 -- If no interpretations, give error message
743 if not Is_Overloadable (Nam_Ent) then
745 L : constant Boolean := Is_List_Member (N);
746 K : constant Node_Kind := Nkind (Parent (N));
749 -- If the node is in a list whose parent is not an
750 -- expression then it must be an attempted procedure call.
752 if L and then K not in N_Subexpr then
753 if Ekind (Entity (Nam)) = E_Generic_Procedure then
755 ("must instantiate generic procedure& before call",
759 ("procedure or entry name expected", Nam);
762 -- Check for tasking cases where only an entry call will do
765 and then (K = N_Entry_Call_Alternative
766 or else K = N_Triggering_Alternative)
768 Error_Msg_N ("entry name expected", Nam);
770 -- Otherwise give general error message
773 Error_Msg_N ("invalid prefix in call", Nam);
781 Analyze_One_Call (N, Nam_Ent, True, Success);
784 -- An overloaded selected component must denote overloaded
785 -- operations of a concurrent type. The interpretations are
786 -- attached to the simple name of those operations.
788 if Nkind (Nam) = N_Selected_Component then
789 Nam := Selector_Name (Nam);
792 Get_First_Interp (Nam, X, It);
794 while Present (It.Nam) loop
797 -- Name may be call that returns an access to subprogram, or more
798 -- generally an overloaded expression one of whose interpretations
799 -- yields an access to subprogram. If the name is an entity, we
800 -- do not dereference, because the node is a call that returns
801 -- the access type: note difference between f(x), where the call
802 -- may return an access subprogram type, and f(x)(y), where the
803 -- type returned by the call to f is implicitly dereferenced to
804 -- analyze the outer call.
806 if Is_Access_Type (Nam_Ent) then
807 Nam_Ent := Designated_Type (Nam_Ent);
809 elsif Is_Access_Type (Etype (Nam_Ent))
810 and then not Is_Entity_Name (Nam)
811 and then Ekind (Designated_Type (Etype (Nam_Ent)))
814 Nam_Ent := Designated_Type (Etype (Nam_Ent));
817 Analyze_One_Call (N, Nam_Ent, False, Success);
819 -- If the interpretation succeeds, mark the proper type of the
820 -- prefix (any valid candidate will do). If not, remove the
821 -- candidate interpretation. This only needs to be done for
822 -- overloaded protected operations, for other entities disambi-
823 -- guation is done directly in Resolve.
826 Set_Etype (Nam, It.Typ);
828 elsif Nkind (Name (N)) = N_Selected_Component
829 or else Nkind (Name (N)) = N_Function_Call
834 Get_Next_Interp (X, It);
837 -- If the name is the result of a function call, it can only
838 -- be a call to a function returning an access to subprogram.
839 -- Insert explicit dereference.
841 if Nkind (Nam) = N_Function_Call then
842 Insert_Explicit_Dereference (Nam);
845 if Etype (N) = Any_Type then
847 -- None of the interpretations is compatible with the actuals
849 Diagnose_Call (N, Nam);
851 -- Special checks for uninstantiated put routines
853 if Nkind (N) = N_Procedure_Call_Statement
854 and then Is_Entity_Name (Nam)
855 and then Chars (Nam) = Name_Put
856 and then List_Length (Actuals) = 1
859 Arg : constant Node_Id := First (Actuals);
863 if Nkind (Arg) = N_Parameter_Association then
864 Typ := Etype (Explicit_Actual_Parameter (Arg));
869 if Is_Signed_Integer_Type (Typ) then
871 ("possible missing instantiation of " &
872 "'Text_'I'O.'Integer_'I'O!", Nam);
874 elsif Is_Modular_Integer_Type (Typ) then
876 ("possible missing instantiation of " &
877 "'Text_'I'O.'Modular_'I'O!", Nam);
879 elsif Is_Floating_Point_Type (Typ) then
881 ("possible missing instantiation of " &
882 "'Text_'I'O.'Float_'I'O!", Nam);
884 elsif Is_Ordinary_Fixed_Point_Type (Typ) then
886 ("possible missing instantiation of " &
887 "'Text_'I'O.'Fixed_'I'O!", Nam);
889 elsif Is_Decimal_Fixed_Point_Type (Typ) then
891 ("possible missing instantiation of " &
892 "'Text_'I'O.'Decimal_'I'O!", Nam);
894 elsif Is_Enumeration_Type (Typ) then
896 ("possible missing instantiation of " &
897 "'Text_'I'O.'Enumeration_'I'O!", Nam);
902 elsif not Is_Overloaded (N)
903 and then Is_Entity_Name (Nam)
905 -- Resolution yields a single interpretation. Verify that
906 -- is has the proper capitalization.
908 Set_Entity_With_Style_Check (Nam, Entity (Nam));
909 Generate_Reference (Entity (Nam), Nam);
911 Set_Etype (Nam, Etype (Entity (Nam)));
913 Remove_Abstract_Operations (N);
920 ---------------------------
921 -- Analyze_Comparison_Op --
922 ---------------------------
924 procedure Analyze_Comparison_Op (N : Node_Id) is
925 L : constant Node_Id := Left_Opnd (N);
926 R : constant Node_Id := Right_Opnd (N);
927 Op_Id : Entity_Id := Entity (N);
930 Set_Etype (N, Any_Type);
931 Candidate_Type := Empty;
933 Analyze_Expression (L);
934 Analyze_Expression (R);
936 if Present (Op_Id) then
937 if Ekind (Op_Id) = E_Operator then
938 Find_Comparison_Types (L, R, Op_Id, N);
940 Add_One_Interp (N, Op_Id, Etype (Op_Id));
943 if Is_Overloaded (L) then
944 Set_Etype (L, Intersect_Types (L, R));
948 Op_Id := Get_Name_Entity_Id (Chars (N));
949 while Present (Op_Id) loop
950 if Ekind (Op_Id) = E_Operator then
951 Find_Comparison_Types (L, R, Op_Id, N);
953 Analyze_User_Defined_Binary_Op (N, Op_Id);
956 Op_Id := Homonym (Op_Id);
961 end Analyze_Comparison_Op;
963 ---------------------------
964 -- Analyze_Concatenation --
965 ---------------------------
967 -- If the only one-dimensional array type in scope is String,
968 -- this is the resulting type of the operation. Otherwise there
969 -- will be a concatenation operation defined for each user-defined
970 -- one-dimensional array.
972 procedure Analyze_Concatenation (N : Node_Id) is
973 L : constant Node_Id := Left_Opnd (N);
974 R : constant Node_Id := Right_Opnd (N);
975 Op_Id : Entity_Id := Entity (N);
980 Set_Etype (N, Any_Type);
981 Candidate_Type := Empty;
983 Analyze_Expression (L);
984 Analyze_Expression (R);
986 -- If the entity is present, the node appears in an instance,
987 -- and denotes a predefined concatenation operation. The resulting
988 -- type is obtained from the arguments when possible. If the arguments
989 -- are aggregates, the array type and the concatenation type must be
992 if Present (Op_Id) then
993 if Ekind (Op_Id) = E_Operator then
995 LT := Base_Type (Etype (L));
996 RT := Base_Type (Etype (R));
998 if Is_Array_Type (LT)
999 and then (RT = LT or else RT = Base_Type (Component_Type (LT)))
1001 Add_One_Interp (N, Op_Id, LT);
1003 elsif Is_Array_Type (RT)
1004 and then LT = Base_Type (Component_Type (RT))
1006 Add_One_Interp (N, Op_Id, RT);
1008 -- If one operand is a string type or a user-defined array type,
1009 -- and the other is a literal, result is of the specific type.
1012 (Root_Type (LT) = Standard_String
1013 or else Scope (LT) /= Standard_Standard)
1014 and then Etype (R) = Any_String
1016 Add_One_Interp (N, Op_Id, LT);
1019 (Root_Type (RT) = Standard_String
1020 or else Scope (RT) /= Standard_Standard)
1021 and then Etype (L) = Any_String
1023 Add_One_Interp (N, Op_Id, RT);
1025 elsif not Is_Generic_Type (Etype (Op_Id)) then
1026 Add_One_Interp (N, Op_Id, Etype (Op_Id));
1029 -- Type and its operations must be visible
1031 Set_Entity (N, Empty);
1032 Analyze_Concatenation (N);
1036 Add_One_Interp (N, Op_Id, Etype (Op_Id));
1040 Op_Id := Get_Name_Entity_Id (Name_Op_Concat);
1041 while Present (Op_Id) loop
1042 if Ekind (Op_Id) = E_Operator then
1044 -- Do not consider operators declared in dead code, they can
1045 -- not be part of the resolution.
1047 if Is_Eliminated (Op_Id) then
1050 Find_Concatenation_Types (L, R, Op_Id, N);
1054 Analyze_User_Defined_Binary_Op (N, Op_Id);
1057 Op_Id := Homonym (Op_Id);
1062 end Analyze_Concatenation;
1064 ------------------------------------
1065 -- Analyze_Conditional_Expression --
1066 ------------------------------------
1068 procedure Analyze_Conditional_Expression (N : Node_Id) is
1069 Condition : constant Node_Id := First (Expressions (N));
1070 Then_Expr : constant Node_Id := Next (Condition);
1071 Else_Expr : constant Node_Id := Next (Then_Expr);
1073 Analyze_Expression (Condition);
1074 Analyze_Expression (Then_Expr);
1075 Analyze_Expression (Else_Expr);
1076 Set_Etype (N, Etype (Then_Expr));
1077 end Analyze_Conditional_Expression;
1079 -------------------------
1080 -- Analyze_Equality_Op --
1081 -------------------------
1083 procedure Analyze_Equality_Op (N : Node_Id) is
1084 Loc : constant Source_Ptr := Sloc (N);
1085 L : constant Node_Id := Left_Opnd (N);
1086 R : constant Node_Id := Right_Opnd (N);
1090 Set_Etype (N, Any_Type);
1091 Candidate_Type := Empty;
1093 Analyze_Expression (L);
1094 Analyze_Expression (R);
1096 -- If the entity is set, the node is a generic instance with a non-local
1097 -- reference to the predefined operator or to a user-defined function.
1098 -- It can also be an inequality that is expanded into the negation of a
1099 -- call to a user-defined equality operator.
1101 -- For the predefined case, the result is Boolean, regardless of the
1102 -- type of the operands. The operands may even be limited, if they are
1103 -- generic actuals. If they are overloaded, label the left argument with
1104 -- the common type that must be present, or with the type of the formal
1105 -- of the user-defined function.
1107 if Present (Entity (N)) then
1108 Op_Id := Entity (N);
1110 if Ekind (Op_Id) = E_Operator then
1111 Add_One_Interp (N, Op_Id, Standard_Boolean);
1113 Add_One_Interp (N, Op_Id, Etype (Op_Id));
1116 if Is_Overloaded (L) then
1117 if Ekind (Op_Id) = E_Operator then
1118 Set_Etype (L, Intersect_Types (L, R));
1120 Set_Etype (L, Etype (First_Formal (Op_Id)));
1125 Op_Id := Get_Name_Entity_Id (Chars (N));
1126 while Present (Op_Id) loop
1127 if Ekind (Op_Id) = E_Operator then
1128 Find_Equality_Types (L, R, Op_Id, N);
1130 Analyze_User_Defined_Binary_Op (N, Op_Id);
1133 Op_Id := Homonym (Op_Id);
1137 -- If there was no match, and the operator is inequality, this may
1138 -- be a case where inequality has not been made explicit, as for
1139 -- tagged types. Analyze the node as the negation of an equality
1140 -- operation. This cannot be done earlier, because before analysis
1141 -- we cannot rule out the presence of an explicit inequality.
1143 if Etype (N) = Any_Type
1144 and then Nkind (N) = N_Op_Ne
1146 Op_Id := Get_Name_Entity_Id (Name_Op_Eq);
1148 while Present (Op_Id) loop
1150 if Ekind (Op_Id) = E_Operator then
1151 Find_Equality_Types (L, R, Op_Id, N);
1153 Analyze_User_Defined_Binary_Op (N, Op_Id);
1156 Op_Id := Homonym (Op_Id);
1159 if Etype (N) /= Any_Type then
1160 Op_Id := Entity (N);
1166 Left_Opnd => Relocate_Node (Left_Opnd (N)),
1167 Right_Opnd => Relocate_Node (Right_Opnd (N)))));
1169 Set_Entity (Right_Opnd (N), Op_Id);
1175 end Analyze_Equality_Op;
1177 ----------------------------------
1178 -- Analyze_Explicit_Dereference --
1179 ----------------------------------
1181 procedure Analyze_Explicit_Dereference (N : Node_Id) is
1182 Loc : constant Source_Ptr := Sloc (N);
1183 P : constant Node_Id := Prefix (N);
1189 function Is_Function_Type return Boolean;
1190 -- Check whether node may be interpreted as an implicit function call
1192 ----------------------
1193 -- Is_Function_Type --
1194 ----------------------
1196 function Is_Function_Type return Boolean is
1201 if not Is_Overloaded (N) then
1202 return Ekind (Base_Type (Etype (N))) = E_Subprogram_Type
1203 and then Etype (Base_Type (Etype (N))) /= Standard_Void_Type;
1206 Get_First_Interp (N, I, It);
1208 while Present (It.Nam) loop
1209 if Ekind (Base_Type (It.Typ)) /= E_Subprogram_Type
1210 or else Etype (Base_Type (It.Typ)) = Standard_Void_Type
1215 Get_Next_Interp (I, It);
1220 end Is_Function_Type;
1222 -- Start of processing for Analyze_Explicit_Dereference
1226 Set_Etype (N, Any_Type);
1228 -- Test for remote access to subprogram type, and if so return
1229 -- after rewriting the original tree.
1231 if Remote_AST_E_Dereference (P) then
1235 -- Normal processing for other than remote access to subprogram type
1237 if not Is_Overloaded (P) then
1238 if Is_Access_Type (Etype (P)) then
1240 -- Set the Etype. We need to go thru Is_For_Access_Subtypes
1241 -- to avoid other problems caused by the Private_Subtype
1242 -- and it is safe to go to the Base_Type because this is the
1243 -- same as converting the access value to its Base_Type.
1246 DT : Entity_Id := Designated_Type (Etype (P));
1249 if Ekind (DT) = E_Private_Subtype
1250 and then Is_For_Access_Subtype (DT)
1252 DT := Base_Type (DT);
1258 elsif Etype (P) /= Any_Type then
1259 Error_Msg_N ("prefix of dereference must be an access type", N);
1264 Get_First_Interp (P, I, It);
1266 while Present (It.Nam) loop
1269 if Is_Access_Type (T) then
1270 Add_One_Interp (N, Designated_Type (T), Designated_Type (T));
1273 Get_Next_Interp (I, It);
1276 -- Error if no interpretation of the prefix has an access type
1278 if Etype (N) = Any_Type then
1280 ("access type required in prefix of explicit dereference", P);
1281 Set_Etype (N, Any_Type);
1287 and then Nkind (Parent (N)) /= N_Indexed_Component
1289 and then (Nkind (Parent (N)) /= N_Function_Call
1290 or else N /= Name (Parent (N)))
1292 and then (Nkind (Parent (N)) /= N_Procedure_Call_Statement
1293 or else N /= Name (Parent (N)))
1295 and then Nkind (Parent (N)) /= N_Subprogram_Renaming_Declaration
1296 and then (Nkind (Parent (N)) /= N_Attribute_Reference
1298 (Attribute_Name (Parent (N)) /= Name_Address
1300 Attribute_Name (Parent (N)) /= Name_Access))
1302 -- Name is a function call with no actuals, in a context that
1303 -- requires deproceduring (including as an actual in an enclosing
1304 -- function or procedure call). There are some pathological cases
1305 -- where the prefix might include functions that return access to
1306 -- subprograms and others that return a regular type. Disambiguation
1307 -- of those has to take place in Resolve.
1308 -- See e.g. 7117-014 and E317-001.
1311 Make_Function_Call (Loc,
1312 Name => Make_Explicit_Dereference (Loc, P),
1313 Parameter_Associations => New_List);
1315 -- If the prefix is overloaded, remove operations that have formals,
1316 -- we know that this is a parameterless call.
1318 if Is_Overloaded (P) then
1319 Get_First_Interp (P, I, It);
1320 while Present (It.Nam) loop
1323 if No (First_Formal (Base_Type (Designated_Type (T)))) then
1329 Get_Next_Interp (I, It);
1336 elsif not Is_Function_Type
1337 and then Is_Overloaded (N)
1339 -- The prefix may include access to subprograms and other access
1340 -- types. If the context selects the interpretation that is a call,
1341 -- we cannot rewrite the node yet, but we include the result of
1342 -- the call interpretation.
1344 Get_First_Interp (N, I, It);
1345 while Present (It.Nam) loop
1346 if Ekind (Base_Type (It.Typ)) = E_Subprogram_Type
1347 and then Etype (Base_Type (It.Typ)) /= Standard_Void_Type
1349 Add_One_Interp (N, Etype (It.Typ), Etype (It.Typ));
1352 Get_Next_Interp (I, It);
1356 -- A value of remote access-to-class-wide must not be dereferenced
1359 Validate_Remote_Access_To_Class_Wide_Type (N);
1360 end Analyze_Explicit_Dereference;
1362 ------------------------
1363 -- Analyze_Expression --
1364 ------------------------
1366 procedure Analyze_Expression (N : Node_Id) is
1369 Check_Parameterless_Call (N);
1370 end Analyze_Expression;
1372 ------------------------------------
1373 -- Analyze_Indexed_Component_Form --
1374 ------------------------------------
1376 procedure Analyze_Indexed_Component_Form (N : Node_Id) is
1377 P : constant Node_Id := Prefix (N);
1378 Exprs : constant List_Id := Expressions (N);
1384 procedure Process_Function_Call;
1385 -- Prefix in indexed component form is an overloadable entity,
1386 -- so the node is a function call. Reformat it as such.
1388 procedure Process_Indexed_Component;
1389 -- Prefix in indexed component form is actually an indexed component.
1390 -- This routine processes it, knowing that the prefix is already
1393 procedure Process_Indexed_Component_Or_Slice;
1394 -- An indexed component with a single index may designate a slice if
1395 -- the index is a subtype mark. This routine disambiguates these two
1396 -- cases by resolving the prefix to see if it is a subtype mark.
1398 procedure Process_Overloaded_Indexed_Component;
1399 -- If the prefix of an indexed component is overloaded, the proper
1400 -- interpretation is selected by the index types and the context.
1402 ---------------------------
1403 -- Process_Function_Call --
1404 ---------------------------
1406 procedure Process_Function_Call is
1410 Change_Node (N, N_Function_Call);
1412 Set_Parameter_Associations (N, Exprs);
1414 Actual := First (Parameter_Associations (N));
1415 while Present (Actual) loop
1417 Check_Parameterless_Call (Actual);
1418 Next_Actual (Actual);
1422 end Process_Function_Call;
1424 -------------------------------
1425 -- Process_Indexed_Component --
1426 -------------------------------
1428 procedure Process_Indexed_Component is
1430 Array_Type : Entity_Id;
1432 Pent : Entity_Id := Empty;
1435 Exp := First (Exprs);
1437 if Is_Overloaded (P) then
1438 Process_Overloaded_Indexed_Component;
1441 Array_Type := Etype (P);
1443 if Is_Entity_Name (P) then
1445 elsif Nkind (P) = N_Selected_Component
1446 and then Is_Entity_Name (Selector_Name (P))
1448 Pent := Entity (Selector_Name (P));
1451 -- Prefix must be appropriate for an array type, taking into
1452 -- account a possible implicit dereference.
1454 if Is_Access_Type (Array_Type) then
1455 Array_Type := Designated_Type (Array_Type);
1456 Error_Msg_NW (Warn_On_Dereference, "?implicit dereference", N);
1457 Process_Implicit_Dereference_Prefix (Pent, P);
1460 if Is_Array_Type (Array_Type) then
1463 elsif Present (Pent) and then Ekind (Pent) = E_Entry_Family then
1465 Set_Etype (N, Any_Type);
1467 if not Has_Compatible_Type
1468 (Exp, Entry_Index_Type (Pent))
1470 Error_Msg_N ("invalid index type in entry name", N);
1472 elsif Present (Next (Exp)) then
1473 Error_Msg_N ("too many subscripts in entry reference", N);
1476 Set_Etype (N, Etype (P));
1481 elsif Is_Record_Type (Array_Type)
1482 and then Remote_AST_I_Dereference (P)
1486 elsif Array_Type = Any_Type then
1487 Set_Etype (N, Any_Type);
1490 -- Here we definitely have a bad indexing
1493 if Nkind (Parent (N)) = N_Requeue_Statement
1494 and then Present (Pent) and then Ekind (Pent) = E_Entry
1497 ("REQUEUE does not permit parameters", First (Exprs));
1499 elsif Is_Entity_Name (P)
1500 and then Etype (P) = Standard_Void_Type
1502 Error_Msg_NE ("incorrect use of&", P, Entity (P));
1505 Error_Msg_N ("array type required in indexed component", P);
1508 Set_Etype (N, Any_Type);
1512 Index := First_Index (Array_Type);
1514 while Present (Index) and then Present (Exp) loop
1515 if not Has_Compatible_Type (Exp, Etype (Index)) then
1516 Wrong_Type (Exp, Etype (Index));
1517 Set_Etype (N, Any_Type);
1525 Set_Etype (N, Component_Type (Array_Type));
1527 if Present (Index) then
1529 ("too few subscripts in array reference", First (Exprs));
1531 elsif Present (Exp) then
1532 Error_Msg_N ("too many subscripts in array reference", Exp);
1535 end Process_Indexed_Component;
1537 ----------------------------------------
1538 -- Process_Indexed_Component_Or_Slice --
1539 ----------------------------------------
1541 procedure Process_Indexed_Component_Or_Slice is
1543 Exp := First (Exprs);
1544 while Present (Exp) loop
1545 Analyze_Expression (Exp);
1549 Exp := First (Exprs);
1551 -- If one index is present, and it is a subtype name, then the
1552 -- node denotes a slice (note that the case of an explicit range
1553 -- for a slice was already built as an N_Slice node in the first
1554 -- place, so that case is not handled here).
1556 -- We use a replace rather than a rewrite here because this is one
1557 -- of the cases in which the tree built by the parser is plain wrong.
1560 and then Is_Entity_Name (Exp)
1561 and then Is_Type (Entity (Exp))
1564 Make_Slice (Sloc (N),
1566 Discrete_Range => New_Copy (Exp)));
1569 -- Otherwise (more than one index present, or single index is not
1570 -- a subtype name), then we have the indexed component case.
1573 Process_Indexed_Component;
1575 end Process_Indexed_Component_Or_Slice;
1577 ------------------------------------------
1578 -- Process_Overloaded_Indexed_Component --
1579 ------------------------------------------
1581 procedure Process_Overloaded_Indexed_Component is
1590 Set_Etype (N, Any_Type);
1592 Get_First_Interp (P, I, It);
1593 while Present (It.Nam) loop
1596 if Is_Access_Type (Typ) then
1597 Typ := Designated_Type (Typ);
1598 Error_Msg_NW (Warn_On_Dereference, "?implicit dereference", N);
1601 if Is_Array_Type (Typ) then
1603 -- Got a candidate: verify that index types are compatible
1605 Index := First_Index (Typ);
1607 Exp := First (Exprs);
1608 while Present (Index) and then Present (Exp) loop
1609 if Has_Compatible_Type (Exp, Etype (Index)) then
1621 if Found and then No (Index) and then No (Exp) then
1623 Etype (Component_Type (Typ)),
1624 Etype (Component_Type (Typ)));
1628 Get_Next_Interp (I, It);
1631 if Etype (N) = Any_Type then
1632 Error_Msg_N ("no legal interpetation for indexed component", N);
1633 Set_Is_Overloaded (N, False);
1637 end Process_Overloaded_Indexed_Component;
1639 -- Start of processing for Analyze_Indexed_Component_Form
1642 -- Get name of array, function or type
1645 if Nkind (N) = N_Function_Call
1646 or else Nkind (N) = N_Procedure_Call_Statement
1648 -- If P is an explicit dereference whose prefix is of a
1649 -- remote access-to-subprogram type, then N has already
1650 -- been rewritten as a subprogram call and analyzed.
1655 pragma Assert (Nkind (N) = N_Indexed_Component);
1657 P_T := Base_Type (Etype (P));
1659 if Is_Entity_Name (P)
1660 or else Nkind (P) = N_Operator_Symbol
1664 if Ekind (U_N) in Type_Kind then
1666 -- Reformat node as a type conversion
1668 E := Remove_Head (Exprs);
1670 if Present (First (Exprs)) then
1672 ("argument of type conversion must be single expression", N);
1675 Change_Node (N, N_Type_Conversion);
1676 Set_Subtype_Mark (N, P);
1678 Set_Expression (N, E);
1680 -- After changing the node, call for the specific Analysis
1681 -- routine directly, to avoid a double call to the expander.
1683 Analyze_Type_Conversion (N);
1687 if Is_Overloadable (U_N) then
1688 Process_Function_Call;
1690 elsif Ekind (Etype (P)) = E_Subprogram_Type
1691 or else (Is_Access_Type (Etype (P))
1693 Ekind (Designated_Type (Etype (P))) = E_Subprogram_Type)
1695 -- Call to access_to-subprogram with possible implicit dereference
1697 Process_Function_Call;
1699 elsif Is_Generic_Subprogram (U_N) then
1701 -- A common beginner's (or C++ templates fan) error
1703 Error_Msg_N ("generic subprogram cannot be called", N);
1704 Set_Etype (N, Any_Type);
1708 Process_Indexed_Component_Or_Slice;
1711 -- If not an entity name, prefix is an expression that may denote
1712 -- an array or an access-to-subprogram.
1715 if Ekind (P_T) = E_Subprogram_Type
1716 or else (Is_Access_Type (P_T)
1718 Ekind (Designated_Type (P_T)) = E_Subprogram_Type)
1720 Process_Function_Call;
1722 elsif Nkind (P) = N_Selected_Component
1723 and then Is_Overloadable (Entity (Selector_Name (P)))
1725 Process_Function_Call;
1728 -- Indexed component, slice, or a call to a member of a family
1729 -- entry, which will be converted to an entry call later.
1731 Process_Indexed_Component_Or_Slice;
1734 end Analyze_Indexed_Component_Form;
1736 ------------------------
1737 -- Analyze_Logical_Op --
1738 ------------------------
1740 procedure Analyze_Logical_Op (N : Node_Id) is
1741 L : constant Node_Id := Left_Opnd (N);
1742 R : constant Node_Id := Right_Opnd (N);
1743 Op_Id : Entity_Id := Entity (N);
1746 Set_Etype (N, Any_Type);
1747 Candidate_Type := Empty;
1749 Analyze_Expression (L);
1750 Analyze_Expression (R);
1752 if Present (Op_Id) then
1754 if Ekind (Op_Id) = E_Operator then
1755 Find_Boolean_Types (L, R, Op_Id, N);
1757 Add_One_Interp (N, Op_Id, Etype (Op_Id));
1761 Op_Id := Get_Name_Entity_Id (Chars (N));
1763 while Present (Op_Id) loop
1764 if Ekind (Op_Id) = E_Operator then
1765 Find_Boolean_Types (L, R, Op_Id, N);
1767 Analyze_User_Defined_Binary_Op (N, Op_Id);
1770 Op_Id := Homonym (Op_Id);
1775 end Analyze_Logical_Op;
1777 ---------------------------
1778 -- Analyze_Membership_Op --
1779 ---------------------------
1781 procedure Analyze_Membership_Op (N : Node_Id) is
1782 L : constant Node_Id := Left_Opnd (N);
1783 R : constant Node_Id := Right_Opnd (N);
1785 Index : Interp_Index;
1787 Found : Boolean := False;
1791 procedure Try_One_Interp (T1 : Entity_Id);
1792 -- Routine to try one proposed interpretation. Note that the context
1793 -- of the operation plays no role in resolving the arguments, so that
1794 -- if there is more than one interpretation of the operands that is
1795 -- compatible with a membership test, the operation is ambiguous.
1797 --------------------
1798 -- Try_One_Interp --
1799 --------------------
1801 procedure Try_One_Interp (T1 : Entity_Id) is
1803 if Has_Compatible_Type (R, T1) then
1805 and then Base_Type (T1) /= Base_Type (T_F)
1807 It := Disambiguate (L, I_F, Index, Any_Type);
1809 if It = No_Interp then
1810 Ambiguous_Operands (N);
1811 Set_Etype (L, Any_Type);
1829 -- Start of processing for Analyze_Membership_Op
1832 Analyze_Expression (L);
1834 if Nkind (R) = N_Range
1835 or else (Nkind (R) = N_Attribute_Reference
1836 and then Attribute_Name (R) = Name_Range)
1840 if not Is_Overloaded (L) then
1841 Try_One_Interp (Etype (L));
1844 Get_First_Interp (L, Index, It);
1846 while Present (It.Typ) loop
1847 Try_One_Interp (It.Typ);
1848 Get_Next_Interp (Index, It);
1852 -- If not a range, it can only be a subtype mark, or else there
1853 -- is a more basic error, to be diagnosed in Find_Type.
1858 if Is_Entity_Name (R) then
1859 Check_Fully_Declared (Entity (R), R);
1863 -- Compatibility between expression and subtype mark or range is
1864 -- checked during resolution. The result of the operation is Boolean
1867 Set_Etype (N, Standard_Boolean);
1868 end Analyze_Membership_Op;
1870 ----------------------
1871 -- Analyze_Negation --
1872 ----------------------
1874 procedure Analyze_Negation (N : Node_Id) is
1875 R : constant Node_Id := Right_Opnd (N);
1876 Op_Id : Entity_Id := Entity (N);
1879 Set_Etype (N, Any_Type);
1880 Candidate_Type := Empty;
1882 Analyze_Expression (R);
1884 if Present (Op_Id) then
1885 if Ekind (Op_Id) = E_Operator then
1886 Find_Negation_Types (R, Op_Id, N);
1888 Add_One_Interp (N, Op_Id, Etype (Op_Id));
1892 Op_Id := Get_Name_Entity_Id (Chars (N));
1893 while Present (Op_Id) loop
1894 if Ekind (Op_Id) = E_Operator then
1895 Find_Negation_Types (R, Op_Id, N);
1897 Analyze_User_Defined_Unary_Op (N, Op_Id);
1900 Op_Id := Homonym (Op_Id);
1905 end Analyze_Negation;
1911 procedure Analyze_Null (N : Node_Id) is
1913 Set_Etype (N, Any_Access);
1916 ----------------------
1917 -- Analyze_One_Call --
1918 ----------------------
1920 procedure Analyze_One_Call
1924 Success : out Boolean)
1926 Actuals : constant List_Id := Parameter_Associations (N);
1927 Prev_T : constant Entity_Id := Etype (N);
1930 Is_Indexed : Boolean := False;
1931 Subp_Type : constant Entity_Id := Etype (Nam);
1934 procedure Indicate_Name_And_Type;
1935 -- If candidate interpretation matches, indicate name and type of
1936 -- result on call node.
1938 ----------------------------
1939 -- Indicate_Name_And_Type --
1940 ----------------------------
1942 procedure Indicate_Name_And_Type is
1944 Add_One_Interp (N, Nam, Etype (Nam));
1947 -- If the prefix of the call is a name, indicate the entity
1948 -- being called. If it is not a name, it is an expression that
1949 -- denotes an access to subprogram or else an entry or family. In
1950 -- the latter case, the name is a selected component, and the entity
1951 -- being called is noted on the selector.
1953 if not Is_Type (Nam) then
1954 if Is_Entity_Name (Name (N))
1955 or else Nkind (Name (N)) = N_Operator_Symbol
1957 Set_Entity (Name (N), Nam);
1959 elsif Nkind (Name (N)) = N_Selected_Component then
1960 Set_Entity (Selector_Name (Name (N)), Nam);
1964 if Debug_Flag_E and not Report then
1965 Write_Str (" Overloaded call ");
1966 Write_Int (Int (N));
1967 Write_Str (" compatible with ");
1968 Write_Int (Int (Nam));
1971 end Indicate_Name_And_Type;
1973 -- Start of processing for Analyze_One_Call
1978 -- If the subprogram has no formals, or if all the formals have
1979 -- defaults, and the return type is an array type, the node may
1980 -- denote an indexing of the result of a parameterless call.
1982 if Needs_No_Actuals (Nam)
1983 and then Present (Actuals)
1985 if Is_Array_Type (Subp_Type) then
1986 Is_Indexed := Try_Indexed_Call (N, Nam, Subp_Type);
1988 elsif Is_Access_Type (Subp_Type)
1989 and then Is_Array_Type (Designated_Type (Subp_Type))
1992 Try_Indexed_Call (N, Nam, Designated_Type (Subp_Type));
1994 -- The prefix can also be a parameterless function that returns an
1995 -- access to subprogram. in which case this is an indirect call.
1997 elsif Is_Access_Type (Subp_Type)
1998 and then Ekind (Designated_Type (Subp_Type)) = E_Subprogram_Type
2000 Is_Indexed := Try_Indirect_Call (N, Nam, Subp_Type);
2005 Normalize_Actuals (N, Nam, (Report and not Is_Indexed), Norm_OK);
2009 -- Mismatch in number or names of parameters
2011 if Debug_Flag_E then
2012 Write_Str (" normalization fails in call ");
2013 Write_Int (Int (N));
2014 Write_Str (" with subprogram ");
2015 Write_Int (Int (Nam));
2019 -- If the context expects a function call, discard any interpretation
2020 -- that is a procedure. If the node is not overloaded, leave as is for
2021 -- better error reporting when type mismatch is found.
2023 elsif Nkind (N) = N_Function_Call
2024 and then Is_Overloaded (Name (N))
2025 and then Ekind (Nam) = E_Procedure
2029 -- Ditto for function calls in a procedure context
2031 elsif Nkind (N) = N_Procedure_Call_Statement
2032 and then Is_Overloaded (Name (N))
2033 and then Etype (Nam) /= Standard_Void_Type
2037 elsif not Present (Actuals) then
2039 -- If Normalize succeeds, then there are default parameters for
2042 Indicate_Name_And_Type;
2044 elsif Ekind (Nam) = E_Operator then
2045 if Nkind (N) = N_Procedure_Call_Statement then
2049 -- This can occur when the prefix of the call is an operator
2050 -- name or an expanded name whose selector is an operator name.
2052 Analyze_Operator_Call (N, Nam);
2054 if Etype (N) /= Prev_T then
2056 -- There may be a user-defined operator that hides the
2057 -- current interpretation. We must check for this independently
2058 -- of the analysis of the call with the user-defined operation,
2059 -- because the parameter names may be wrong and yet the hiding
2060 -- takes place. Fixes b34014o.
2062 if Is_Overloaded (Name (N)) then
2068 Get_First_Interp (Name (N), I, It);
2069 while Present (It.Nam) loop
2070 if Ekind (It.Nam) /= E_Operator
2071 and then Hides_Op (It.Nam, Nam)
2074 (First_Actual (N), Etype (First_Formal (It.Nam)))
2075 and then (No (Next_Actual (First_Actual (N)))
2076 or else Has_Compatible_Type
2077 (Next_Actual (First_Actual (N)),
2078 Etype (Next_Formal (First_Formal (It.Nam)))))
2080 Set_Etype (N, Prev_T);
2084 Get_Next_Interp (I, It);
2089 -- If operator matches formals, record its name on the call.
2090 -- If the operator is overloaded, Resolve will select the
2091 -- correct one from the list of interpretations. The call
2092 -- node itself carries the first candidate.
2094 Set_Entity (Name (N), Nam);
2097 elsif Report and then Etype (N) = Any_Type then
2098 Error_Msg_N ("incompatible arguments for operator", N);
2102 -- Normalize_Actuals has chained the named associations in the
2103 -- correct order of the formals.
2105 Actual := First_Actual (N);
2106 Formal := First_Formal (Nam);
2107 while Present (Actual) and then Present (Formal) loop
2108 if Nkind (Parent (Actual)) /= N_Parameter_Association
2109 or else Chars (Selector_Name (Parent (Actual))) = Chars (Formal)
2111 if Has_Compatible_Type (Actual, Etype (Formal)) then
2112 Next_Actual (Actual);
2113 Next_Formal (Formal);
2116 if Debug_Flag_E then
2117 Write_Str (" type checking fails in call ");
2118 Write_Int (Int (N));
2119 Write_Str (" with formal ");
2120 Write_Int (Int (Formal));
2121 Write_Str (" in subprogram ");
2122 Write_Int (Int (Nam));
2126 if Report and not Is_Indexed then
2128 -- Ada 2005 (AI-251): Complete the error notification
2129 -- to help new Ada 2005 users
2131 if Is_Class_Wide_Type (Etype (Formal))
2132 and then Is_Interface (Etype (Etype (Formal)))
2133 and then not Interface_Present_In_Ancestor
2134 (Typ => Etype (Actual),
2135 Iface => Etype (Etype (Formal)))
2137 Error_Msg_Name_1 := Chars (Actual);
2138 Error_Msg_Name_2 := Chars (Etype (Etype (Formal)));
2140 ("(Ada 2005) % does not implement interface %",
2141 Actual, Etype (Etype (Formal)));
2144 Wrong_Type (Actual, Etype (Formal));
2146 if Nkind (Actual) = N_Op_Eq
2147 and then Nkind (Left_Opnd (Actual)) = N_Identifier
2149 Formal := First_Formal (Nam);
2151 while Present (Formal) loop
2153 if Chars (Left_Opnd (Actual)) = Chars (Formal) then
2155 ("possible misspelling of `='>`!", Actual);
2159 Next_Formal (Formal);
2163 if All_Errors_Mode then
2164 Error_Msg_Sloc := Sloc (Nam);
2166 if Is_Overloadable (Nam)
2167 and then Present (Alias (Nam))
2168 and then not Comes_From_Source (Nam)
2171 (" =='> in call to &#(inherited)!", Actual, Nam);
2173 elsif Ekind (Nam) = E_Subprogram_Type then
2175 Access_To_Subprogram_Typ :
2176 constant Entity_Id :=
2178 (Associated_Node_For_Itype (Nam));
2181 " =='> in call to dereference of &#!",
2182 Actual, Access_To_Subprogram_Typ);
2186 Error_Msg_NE (" =='> in call to &#!", Actual, Nam);
2196 -- Normalize_Actuals has verified that a default value exists
2197 -- for this formal. Current actual names a subsequent formal.
2199 Next_Formal (Formal);
2203 -- On exit, all actuals match
2205 Indicate_Name_And_Type;
2207 end Analyze_One_Call;
2209 ---------------------------
2210 -- Analyze_Operator_Call --
2211 ---------------------------
2213 procedure Analyze_Operator_Call (N : Node_Id; Op_Id : Entity_Id) is
2214 Op_Name : constant Name_Id := Chars (Op_Id);
2215 Act1 : constant Node_Id := First_Actual (N);
2216 Act2 : constant Node_Id := Next_Actual (Act1);
2219 -- Binary operator case
2221 if Present (Act2) then
2223 -- If more than two operands, then not binary operator after all
2225 if Present (Next_Actual (Act2)) then
2228 elsif Op_Name = Name_Op_Add
2229 or else Op_Name = Name_Op_Subtract
2230 or else Op_Name = Name_Op_Multiply
2231 or else Op_Name = Name_Op_Divide
2232 or else Op_Name = Name_Op_Mod
2233 or else Op_Name = Name_Op_Rem
2234 or else Op_Name = Name_Op_Expon
2236 Find_Arithmetic_Types (Act1, Act2, Op_Id, N);
2238 elsif Op_Name = Name_Op_And
2239 or else Op_Name = Name_Op_Or
2240 or else Op_Name = Name_Op_Xor
2242 Find_Boolean_Types (Act1, Act2, Op_Id, N);
2244 elsif Op_Name = Name_Op_Lt
2245 or else Op_Name = Name_Op_Le
2246 or else Op_Name = Name_Op_Gt
2247 or else Op_Name = Name_Op_Ge
2249 Find_Comparison_Types (Act1, Act2, Op_Id, N);
2251 elsif Op_Name = Name_Op_Eq
2252 or else Op_Name = Name_Op_Ne
2254 Find_Equality_Types (Act1, Act2, Op_Id, N);
2256 elsif Op_Name = Name_Op_Concat then
2257 Find_Concatenation_Types (Act1, Act2, Op_Id, N);
2259 -- Is this else null correct, or should it be an abort???
2265 -- Unary operator case
2268 if Op_Name = Name_Op_Subtract or else
2269 Op_Name = Name_Op_Add or else
2270 Op_Name = Name_Op_Abs
2272 Find_Unary_Types (Act1, Op_Id, N);
2275 Op_Name = Name_Op_Not
2277 Find_Negation_Types (Act1, Op_Id, N);
2279 -- Is this else null correct, or should it be an abort???
2285 end Analyze_Operator_Call;
2287 -------------------------------------------
2288 -- Analyze_Overloaded_Selected_Component --
2289 -------------------------------------------
2291 procedure Analyze_Overloaded_Selected_Component (N : Node_Id) is
2292 Nam : constant Node_Id := Prefix (N);
2293 Sel : constant Node_Id := Selector_Name (N);
2300 Set_Etype (Sel, Any_Type);
2302 Get_First_Interp (Nam, I, It);
2303 while Present (It.Typ) loop
2304 if Is_Access_Type (It.Typ) then
2305 T := Designated_Type (It.Typ);
2306 Error_Msg_NW (Warn_On_Dereference, "?implicit dereference", N);
2311 if Is_Record_Type (T) then
2312 Comp := First_Entity (T);
2313 while Present (Comp) loop
2314 if Chars (Comp) = Chars (Sel)
2315 and then Is_Visible_Component (Comp)
2317 Set_Entity_With_Style_Check (Sel, Comp);
2318 Generate_Reference (Comp, Sel);
2320 Set_Etype (Sel, Etype (Comp));
2321 Add_One_Interp (N, Etype (Comp), Etype (Comp));
2323 -- This also specifies a candidate to resolve the name.
2324 -- Further overloading will be resolved from context.
2326 Set_Etype (Nam, It.Typ);
2332 elsif Is_Concurrent_Type (T) then
2333 Comp := First_Entity (T);
2334 while Present (Comp)
2335 and then Comp /= First_Private_Entity (T)
2337 if Chars (Comp) = Chars (Sel) then
2338 if Is_Overloadable (Comp) then
2339 Add_One_Interp (Sel, Comp, Etype (Comp));
2341 Set_Entity_With_Style_Check (Sel, Comp);
2342 Generate_Reference (Comp, Sel);
2345 Set_Etype (Sel, Etype (Comp));
2346 Set_Etype (N, Etype (Comp));
2347 Set_Etype (Nam, It.Typ);
2349 -- For access type case, introduce explicit deference for
2350 -- more uniform treatment of entry calls.
2352 if Is_Access_Type (Etype (Nam)) then
2353 Insert_Explicit_Dereference (Nam);
2355 (Warn_On_Dereference, "?implicit dereference", N);
2362 Set_Is_Overloaded (N, Is_Overloaded (Sel));
2365 Get_Next_Interp (I, It);
2368 if Etype (N) = Any_Type then
2369 Error_Msg_NE ("undefined selector& for overloaded prefix", N, Sel);
2370 Set_Entity (Sel, Any_Id);
2371 Set_Etype (Sel, Any_Type);
2373 end Analyze_Overloaded_Selected_Component;
2375 ----------------------------------
2376 -- Analyze_Qualified_Expression --
2377 ----------------------------------
2379 procedure Analyze_Qualified_Expression (N : Node_Id) is
2380 Mark : constant Entity_Id := Subtype_Mark (N);
2384 Set_Etype (N, Any_Type);
2388 if T = Any_Type then
2392 Check_Fully_Declared (T, N);
2393 Analyze_Expression (Expression (N));
2395 end Analyze_Qualified_Expression;
2401 procedure Analyze_Range (N : Node_Id) is
2402 L : constant Node_Id := Low_Bound (N);
2403 H : constant Node_Id := High_Bound (N);
2404 I1, I2 : Interp_Index;
2407 procedure Check_Common_Type (T1, T2 : Entity_Id);
2408 -- Verify the compatibility of two types, and choose the
2409 -- non universal one if the other is universal.
2411 procedure Check_High_Bound (T : Entity_Id);
2412 -- Test one interpretation of the low bound against all those
2413 -- of the high bound.
2415 procedure Check_Universal_Expression (N : Node_Id);
2416 -- In Ada83, reject bounds of a universal range that are not
2417 -- literals or entity names.
2419 -----------------------
2420 -- Check_Common_Type --
2421 -----------------------
2423 procedure Check_Common_Type (T1, T2 : Entity_Id) is
2425 if Covers (T1, T2) or else Covers (T2, T1) then
2426 if T1 = Universal_Integer
2427 or else T1 = Universal_Real
2428 or else T1 = Any_Character
2430 Add_One_Interp (N, Base_Type (T2), Base_Type (T2));
2433 Add_One_Interp (N, T1, T1);
2436 Add_One_Interp (N, Base_Type (T1), Base_Type (T1));
2439 end Check_Common_Type;
2441 ----------------------
2442 -- Check_High_Bound --
2443 ----------------------
2445 procedure Check_High_Bound (T : Entity_Id) is
2447 if not Is_Overloaded (H) then
2448 Check_Common_Type (T, Etype (H));
2450 Get_First_Interp (H, I2, It2);
2451 while Present (It2.Typ) loop
2452 Check_Common_Type (T, It2.Typ);
2453 Get_Next_Interp (I2, It2);
2456 end Check_High_Bound;
2458 -----------------------------
2459 -- Is_Universal_Expression --
2460 -----------------------------
2462 procedure Check_Universal_Expression (N : Node_Id) is
2464 if Etype (N) = Universal_Integer
2465 and then Nkind (N) /= N_Integer_Literal
2466 and then not Is_Entity_Name (N)
2467 and then Nkind (N) /= N_Attribute_Reference
2469 Error_Msg_N ("illegal bound in discrete range", N);
2471 end Check_Universal_Expression;
2473 -- Start of processing for Analyze_Range
2476 Set_Etype (N, Any_Type);
2477 Analyze_Expression (L);
2478 Analyze_Expression (H);
2480 if Etype (L) = Any_Type or else Etype (H) = Any_Type then
2484 if not Is_Overloaded (L) then
2485 Check_High_Bound (Etype (L));
2487 Get_First_Interp (L, I1, It1);
2488 while Present (It1.Typ) loop
2489 Check_High_Bound (It1.Typ);
2490 Get_Next_Interp (I1, It1);
2494 -- If result is Any_Type, then we did not find a compatible pair
2496 if Etype (N) = Any_Type then
2497 Error_Msg_N ("incompatible types in range ", N);
2501 if Ada_Version = Ada_83
2503 (Nkind (Parent (N)) = N_Loop_Parameter_Specification
2504 or else Nkind (Parent (N)) = N_Constrained_Array_Definition)
2506 Check_Universal_Expression (L);
2507 Check_Universal_Expression (H);
2511 -----------------------
2512 -- Analyze_Reference --
2513 -----------------------
2515 procedure Analyze_Reference (N : Node_Id) is
2516 P : constant Node_Id := Prefix (N);
2517 Acc_Type : Entity_Id;
2520 Acc_Type := Create_Itype (E_Allocator_Type, N);
2521 Set_Etype (Acc_Type, Acc_Type);
2522 Init_Size_Align (Acc_Type);
2523 Set_Directly_Designated_Type (Acc_Type, Etype (P));
2524 Set_Etype (N, Acc_Type);
2525 end Analyze_Reference;
2527 --------------------------------
2528 -- Analyze_Selected_Component --
2529 --------------------------------
2531 -- Prefix is a record type or a task or protected type. In the
2532 -- later case, the selector must denote a visible entry.
2534 procedure Analyze_Selected_Component (N : Node_Id) is
2535 Name : constant Node_Id := Prefix (N);
2536 Sel : constant Node_Id := Selector_Name (N);
2538 Entity_List : Entity_Id;
2539 Prefix_Type : Entity_Id;
2540 Pent : Entity_Id := Empty;
2545 -- Start of processing for Analyze_Selected_Component
2548 Set_Etype (N, Any_Type);
2550 if Is_Overloaded (Name) then
2551 Analyze_Overloaded_Selected_Component (N);
2554 elsif Etype (Name) = Any_Type then
2555 Set_Entity (Sel, Any_Id);
2556 Set_Etype (Sel, Any_Type);
2560 -- Function calls that are prefixes of selected components must be
2561 -- fully resolved in case we need to build an actual subtype, or
2562 -- do some other operation requiring a fully resolved prefix.
2564 -- Note: Resolving all Nkinds of nodes here doesn't work.
2565 -- (Breaks 2129-008) ???.
2567 if Nkind (Name) = N_Function_Call then
2571 Prefix_Type := Etype (Name);
2574 if Is_Access_Type (Prefix_Type) then
2576 -- A RACW object can never be used as prefix of a selected
2577 -- component since that means it is dereferenced without
2578 -- being a controlling operand of a dispatching operation
2581 if Is_Remote_Access_To_Class_Wide_Type (Prefix_Type)
2582 and then Comes_From_Source (N)
2585 ("invalid dereference of a remote access to class-wide value",
2588 -- Normal case of selected component applied to access type
2591 Error_Msg_NW (Warn_On_Dereference, "?implicit dereference", N);
2593 if Is_Entity_Name (Name) then
2594 Pent := Entity (Name);
2595 elsif Nkind (Name) = N_Selected_Component
2596 and then Is_Entity_Name (Selector_Name (Name))
2598 Pent := Entity (Selector_Name (Name));
2601 Process_Implicit_Dereference_Prefix (Pent, Name);
2604 Prefix_Type := Designated_Type (Prefix_Type);
2607 if Ekind (Prefix_Type) = E_Private_Subtype then
2608 Prefix_Type := Base_Type (Prefix_Type);
2611 Entity_List := Prefix_Type;
2613 -- For class-wide types, use the entity list of the root type. This
2614 -- indirection is specially important for private extensions because
2615 -- only the root type get switched (not the class-wide type).
2617 if Is_Class_Wide_Type (Prefix_Type) then
2618 Entity_List := Root_Type (Prefix_Type);
2621 Comp := First_Entity (Entity_List);
2623 -- If the selector has an original discriminant, the node appears in
2624 -- an instance. Replace the discriminant with the corresponding one
2625 -- in the current discriminated type. For nested generics, this must
2626 -- be done transitively, so note the new original discriminant.
2628 if Nkind (Sel) = N_Identifier
2629 and then Present (Original_Discriminant (Sel))
2631 Comp := Find_Corresponding_Discriminant (Sel, Prefix_Type);
2633 -- Mark entity before rewriting, for completeness and because
2634 -- subsequent semantic checks might examine the original node.
2636 Set_Entity (Sel, Comp);
2637 Rewrite (Selector_Name (N),
2638 New_Occurrence_Of (Comp, Sloc (N)));
2639 Set_Original_Discriminant (Selector_Name (N), Comp);
2640 Set_Etype (N, Etype (Comp));
2642 if Is_Access_Type (Etype (Name)) then
2643 Insert_Explicit_Dereference (Name);
2644 Error_Msg_NW (Warn_On_Dereference, "?implicit dereference", N);
2647 elsif Is_Record_Type (Prefix_Type) then
2649 -- Find component with given name
2651 while Present (Comp) loop
2652 if Chars (Comp) = Chars (Sel)
2653 and then Is_Visible_Component (Comp)
2655 Set_Entity_With_Style_Check (Sel, Comp);
2656 Generate_Reference (Comp, Sel);
2658 Set_Etype (Sel, Etype (Comp));
2660 if Ekind (Comp) = E_Discriminant then
2661 if Is_Unchecked_Union (Base_Type (Prefix_Type)) then
2663 ("cannot reference discriminant of Unchecked_Union",
2667 if Is_Generic_Type (Prefix_Type)
2669 Is_Generic_Type (Root_Type (Prefix_Type))
2671 Set_Original_Discriminant (Sel, Comp);
2675 -- Resolve the prefix early otherwise it is not possible to
2676 -- build the actual subtype of the component: it may need
2677 -- to duplicate this prefix and duplication is only allowed
2678 -- on fully resolved expressions.
2682 -- We never need an actual subtype for the case of a selection
2683 -- for a indexed component of a non-packed array, since in
2684 -- this case gigi generates all the checks and can find the
2685 -- necessary bounds information.
2687 -- We also do not need an actual subtype for the case of
2688 -- a first, last, length, or range attribute applied to a
2689 -- non-packed array, since gigi can again get the bounds in
2690 -- these cases (gigi cannot handle the packed case, since it
2691 -- has the bounds of the packed array type, not the original
2692 -- bounds of the type). However, if the prefix is itself a
2693 -- selected component, as in a.b.c (i), gigi may regard a.b.c
2694 -- as a dynamic-sized temporary, so we do generate an actual
2695 -- subtype for this case.
2697 Parent_N := Parent (N);
2699 if not Is_Packed (Etype (Comp))
2701 ((Nkind (Parent_N) = N_Indexed_Component
2702 and then Nkind (Name) /= N_Selected_Component)
2704 (Nkind (Parent_N) = N_Attribute_Reference
2705 and then (Attribute_Name (Parent_N) = Name_First
2707 Attribute_Name (Parent_N) = Name_Last
2709 Attribute_Name (Parent_N) = Name_Length
2711 Attribute_Name (Parent_N) = Name_Range)))
2713 Set_Etype (N, Etype (Comp));
2715 -- If full analysis is not enabled, we do not generate an
2716 -- actual subtype, because in the absence of expansion
2717 -- reference to a formal of a protected type, for example,
2718 -- will not be properly transformed, and will lead to
2719 -- out-of-scope references in gigi.
2721 -- In all other cases, we currently build an actual subtype.
2722 -- It seems likely that many of these cases can be avoided,
2723 -- but right now, the front end makes direct references to the
2724 -- bounds (e.g. in generating a length check), and if we do
2725 -- not make an actual subtype, we end up getting a direct
2726 -- reference to a discriminant, which will not do.
2728 elsif Full_Analysis then
2730 Build_Actual_Subtype_Of_Component (Etype (Comp), N);
2731 Insert_Action (N, Act_Decl);
2733 if No (Act_Decl) then
2734 Set_Etype (N, Etype (Comp));
2737 -- Component type depends on discriminants. Enter the
2738 -- main attributes of the subtype.
2741 Subt : constant Entity_Id :=
2742 Defining_Identifier (Act_Decl);
2745 Set_Etype (Subt, Base_Type (Etype (Comp)));
2746 Set_Ekind (Subt, Ekind (Etype (Comp)));
2747 Set_Etype (N, Subt);
2751 -- If Full_Analysis not enabled, just set the Etype
2754 Set_Etype (N, Etype (Comp));
2763 -- Ada 2005 (AI-252)
2765 if Ada_Version >= Ada_05
2766 and then Is_Tagged_Type (Prefix_Type)
2767 and then Try_Object_Operation (N)
2771 -- If the transformation fails, it will be necessary to redo the
2772 -- analysis with all errors enabled, to indicate candidate
2773 -- interpretations and reasons for each failure ???
2777 elsif Is_Private_Type (Prefix_Type) then
2779 -- Allow access only to discriminants of the type. If the type has
2780 -- no full view, gigi uses the parent type for the components, so we
2781 -- do the same here.
2783 if No (Full_View (Prefix_Type)) then
2784 Entity_List := Root_Type (Base_Type (Prefix_Type));
2785 Comp := First_Entity (Entity_List);
2788 while Present (Comp) loop
2789 if Chars (Comp) = Chars (Sel) then
2790 if Ekind (Comp) = E_Discriminant then
2791 Set_Entity_With_Style_Check (Sel, Comp);
2792 Generate_Reference (Comp, Sel);
2794 Set_Etype (Sel, Etype (Comp));
2795 Set_Etype (N, Etype (Comp));
2797 if Is_Generic_Type (Prefix_Type)
2799 Is_Generic_Type (Root_Type (Prefix_Type))
2801 Set_Original_Discriminant (Sel, Comp);
2806 ("invisible selector for }",
2807 N, First_Subtype (Prefix_Type));
2808 Set_Entity (Sel, Any_Id);
2809 Set_Etype (N, Any_Type);
2818 elsif Is_Concurrent_Type (Prefix_Type) then
2820 -- Prefix is concurrent type. Find visible operation with given name
2821 -- For a task, this can only include entries or discriminants if the
2822 -- task type is not an enclosing scope. If it is an enclosing scope
2823 -- (e.g. in an inner task) then all entities are visible, but the
2824 -- prefix must denote the enclosing scope, i.e. can only be a direct
2825 -- name or an expanded name.
2827 Set_Etype (Sel, Any_Type);
2828 In_Scope := In_Open_Scopes (Prefix_Type);
2830 while Present (Comp) loop
2831 if Chars (Comp) = Chars (Sel) then
2832 if Is_Overloadable (Comp) then
2833 Add_One_Interp (Sel, Comp, Etype (Comp));
2835 elsif Ekind (Comp) = E_Discriminant
2836 or else Ekind (Comp) = E_Entry_Family
2838 and then Is_Entity_Name (Name))
2840 Set_Entity_With_Style_Check (Sel, Comp);
2841 Generate_Reference (Comp, Sel);
2847 Set_Etype (Sel, Etype (Comp));
2848 Set_Etype (N, Etype (Comp));
2850 if Ekind (Comp) = E_Discriminant then
2851 Set_Original_Discriminant (Sel, Comp);
2854 -- For access type case, introduce explicit deference for more
2855 -- uniform treatment of entry calls.
2857 if Is_Access_Type (Etype (Name)) then
2858 Insert_Explicit_Dereference (Name);
2860 (Warn_On_Dereference, "?implicit dereference", N);
2866 exit when not In_Scope
2868 Comp = First_Private_Entity (Base_Type (Prefix_Type));
2871 Set_Is_Overloaded (N, Is_Overloaded (Sel));
2876 Error_Msg_NE ("invalid prefix in selected component&", N, Sel);
2879 -- If N still has no type, the component is not defined in the prefix
2881 if Etype (N) = Any_Type then
2883 -- If the prefix is a single concurrent object, use its name in the
2884 -- error message, rather than that of its anonymous type.
2886 if Is_Concurrent_Type (Prefix_Type)
2887 and then Is_Internal_Name (Chars (Prefix_Type))
2888 and then not Is_Derived_Type (Prefix_Type)
2889 and then Is_Entity_Name (Name)
2892 Error_Msg_Node_2 := Entity (Name);
2893 Error_Msg_NE ("no selector& for&", N, Sel);
2895 Check_Misspelled_Selector (Entity_List, Sel);
2897 elsif Is_Generic_Type (Prefix_Type)
2898 and then Ekind (Prefix_Type) = E_Record_Type_With_Private
2899 and then Prefix_Type /= Etype (Prefix_Type)
2900 and then Is_Record_Type (Etype (Prefix_Type))
2902 -- If this is a derived formal type, the parent may have
2903 -- different visibility at this point. Try for an inherited
2904 -- component before reporting an error.
2906 Set_Etype (Prefix (N), Etype (Prefix_Type));
2907 Analyze_Selected_Component (N);
2910 elsif Ekind (Prefix_Type) = E_Record_Subtype_With_Private
2911 and then Is_Generic_Actual_Type (Prefix_Type)
2912 and then Present (Full_View (Prefix_Type))
2914 -- Similarly, if this the actual for a formal derived type, the
2915 -- component inherited from the generic parent may not be visible
2916 -- in the actual, but the selected component is legal.
2923 First_Component (Generic_Parent_Type (Parent (Prefix_Type)));
2924 while Present (Comp) loop
2925 if Chars (Comp) = Chars (Sel) then
2926 Set_Entity_With_Style_Check (Sel, Comp);
2927 Set_Etype (Sel, Etype (Comp));
2928 Set_Etype (N, Etype (Comp));
2932 Next_Component (Comp);
2935 pragma Assert (Etype (N) /= Any_Type);
2939 if Ekind (Prefix_Type) = E_Record_Subtype then
2941 -- Check whether this is a component of the base type
2942 -- which is absent from a statically constrained subtype.
2943 -- This will raise constraint error at run-time, but is
2944 -- not a compile-time error. When the selector is illegal
2945 -- for base type as well fall through and generate a
2946 -- compilation error anyway.
2948 Comp := First_Component (Base_Type (Prefix_Type));
2949 while Present (Comp) loop
2950 if Chars (Comp) = Chars (Sel)
2951 and then Is_Visible_Component (Comp)
2953 Set_Entity_With_Style_Check (Sel, Comp);
2954 Generate_Reference (Comp, Sel);
2955 Set_Etype (Sel, Etype (Comp));
2956 Set_Etype (N, Etype (Comp));
2958 -- Emit appropriate message. Gigi will replace the
2959 -- node subsequently with the appropriate Raise.
2961 Apply_Compile_Time_Constraint_Error
2962 (N, "component not present in }?",
2963 CE_Discriminant_Check_Failed,
2964 Ent => Prefix_Type, Rep => False);
2965 Set_Raises_Constraint_Error (N);
2969 Next_Component (Comp);
2974 Error_Msg_Node_2 := First_Subtype (Prefix_Type);
2975 Error_Msg_NE ("no selector& for}", N, Sel);
2977 Check_Misspelled_Selector (Entity_List, Sel);
2981 Set_Entity (Sel, Any_Id);
2982 Set_Etype (Sel, Any_Type);
2984 end Analyze_Selected_Component;
2986 ---------------------------
2987 -- Analyze_Short_Circuit --
2988 ---------------------------
2990 procedure Analyze_Short_Circuit (N : Node_Id) is
2991 L : constant Node_Id := Left_Opnd (N);
2992 R : constant Node_Id := Right_Opnd (N);
2997 Analyze_Expression (L);
2998 Analyze_Expression (R);
2999 Set_Etype (N, Any_Type);
3001 if not Is_Overloaded (L) then
3003 if Root_Type (Etype (L)) = Standard_Boolean
3004 and then Has_Compatible_Type (R, Etype (L))
3006 Add_One_Interp (N, Etype (L), Etype (L));
3010 Get_First_Interp (L, Ind, It);
3012 while Present (It.Typ) loop
3013 if Root_Type (It.Typ) = Standard_Boolean
3014 and then Has_Compatible_Type (R, It.Typ)
3016 Add_One_Interp (N, It.Typ, It.Typ);
3019 Get_Next_Interp (Ind, It);
3023 -- Here we have failed to find an interpretation. Clearly we
3024 -- know that it is not the case that both operands can have
3025 -- an interpretation of Boolean, but this is by far the most
3026 -- likely intended interpretation. So we simply resolve both
3027 -- operands as Booleans, and at least one of these resolutions
3028 -- will generate an error message, and we do not need to give
3029 -- a further error message on the short circuit operation itself.
3031 if Etype (N) = Any_Type then
3032 Resolve (L, Standard_Boolean);
3033 Resolve (R, Standard_Boolean);
3034 Set_Etype (N, Standard_Boolean);
3036 end Analyze_Short_Circuit;
3042 procedure Analyze_Slice (N : Node_Id) is
3043 P : constant Node_Id := Prefix (N);
3044 D : constant Node_Id := Discrete_Range (N);
3045 Array_Type : Entity_Id;
3047 procedure Analyze_Overloaded_Slice;
3048 -- If the prefix is overloaded, select those interpretations that
3049 -- yield a one-dimensional array type.
3051 ------------------------------
3052 -- Analyze_Overloaded_Slice --
3053 ------------------------------
3055 procedure Analyze_Overloaded_Slice is
3061 Set_Etype (N, Any_Type);
3063 Get_First_Interp (P, I, It);
3064 while Present (It.Nam) loop
3067 if Is_Access_Type (Typ) then
3068 Typ := Designated_Type (Typ);
3069 Error_Msg_NW (Warn_On_Dereference, "?implicit dereference", N);
3072 if Is_Array_Type (Typ)
3073 and then Number_Dimensions (Typ) = 1
3074 and then Has_Compatible_Type (D, Etype (First_Index (Typ)))
3076 Add_One_Interp (N, Typ, Typ);
3079 Get_Next_Interp (I, It);
3082 if Etype (N) = Any_Type then
3083 Error_Msg_N ("expect array type in prefix of slice", N);
3085 end Analyze_Overloaded_Slice;
3087 -- Start of processing for Analyze_Slice
3093 if Is_Overloaded (P) then
3094 Analyze_Overloaded_Slice;
3097 Array_Type := Etype (P);
3098 Set_Etype (N, Any_Type);
3100 if Is_Access_Type (Array_Type) then
3101 Array_Type := Designated_Type (Array_Type);
3102 Error_Msg_NW (Warn_On_Dereference, "?implicit dereference", N);
3105 if not Is_Array_Type (Array_Type) then
3106 Wrong_Type (P, Any_Array);
3108 elsif Number_Dimensions (Array_Type) > 1 then
3110 ("type is not one-dimensional array in slice prefix", N);
3113 Has_Compatible_Type (D, Etype (First_Index (Array_Type)))
3115 Wrong_Type (D, Etype (First_Index (Array_Type)));
3118 Set_Etype (N, Array_Type);
3123 -----------------------------
3124 -- Analyze_Type_Conversion --
3125 -----------------------------
3127 procedure Analyze_Type_Conversion (N : Node_Id) is
3128 Expr : constant Node_Id := Expression (N);
3132 -- If Conversion_OK is set, then the Etype is already set, and the
3133 -- only processing required is to analyze the expression. This is
3134 -- used to construct certain "illegal" conversions which are not
3135 -- allowed by Ada semantics, but can be handled OK by Gigi, see
3136 -- Sinfo for further details.
3138 if Conversion_OK (N) then
3143 -- Otherwise full type analysis is required, as well as some semantic
3144 -- checks to make sure the argument of the conversion is appropriate.
3146 Find_Type (Subtype_Mark (N));
3147 T := Entity (Subtype_Mark (N));
3149 Check_Fully_Declared (T, N);
3150 Analyze_Expression (Expr);
3151 Validate_Remote_Type_Type_Conversion (N);
3153 -- Only remaining step is validity checks on the argument. These
3154 -- are skipped if the conversion does not come from the source.
3156 if not Comes_From_Source (N) then
3159 elsif Nkind (Expr) = N_Null then
3160 Error_Msg_N ("argument of conversion cannot be null", N);
3161 Error_Msg_N ("\use qualified expression instead", N);
3162 Set_Etype (N, Any_Type);
3164 elsif Nkind (Expr) = N_Aggregate then
3165 Error_Msg_N ("argument of conversion cannot be aggregate", N);
3166 Error_Msg_N ("\use qualified expression instead", N);
3168 elsif Nkind (Expr) = N_Allocator then
3169 Error_Msg_N ("argument of conversion cannot be an allocator", N);
3170 Error_Msg_N ("\use qualified expression instead", N);
3172 elsif Nkind (Expr) = N_String_Literal then
3173 Error_Msg_N ("argument of conversion cannot be string literal", N);
3174 Error_Msg_N ("\use qualified expression instead", N);
3176 elsif Nkind (Expr) = N_Character_Literal then
3177 if Ada_Version = Ada_83 then
3180 Error_Msg_N ("argument of conversion cannot be character literal",
3182 Error_Msg_N ("\use qualified expression instead", N);
3185 elsif Nkind (Expr) = N_Attribute_Reference
3187 (Attribute_Name (Expr) = Name_Access or else
3188 Attribute_Name (Expr) = Name_Unchecked_Access or else
3189 Attribute_Name (Expr) = Name_Unrestricted_Access)
3191 Error_Msg_N ("argument of conversion cannot be access", N);
3192 Error_Msg_N ("\use qualified expression instead", N);
3194 end Analyze_Type_Conversion;
3196 ----------------------
3197 -- Analyze_Unary_Op --
3198 ----------------------
3200 procedure Analyze_Unary_Op (N : Node_Id) is
3201 R : constant Node_Id := Right_Opnd (N);
3202 Op_Id : Entity_Id := Entity (N);
3205 Set_Etype (N, Any_Type);
3206 Candidate_Type := Empty;
3208 Analyze_Expression (R);
3210 if Present (Op_Id) then
3211 if Ekind (Op_Id) = E_Operator then
3212 Find_Unary_Types (R, Op_Id, N);
3214 Add_One_Interp (N, Op_Id, Etype (Op_Id));
3218 Op_Id := Get_Name_Entity_Id (Chars (N));
3219 while Present (Op_Id) loop
3220 if Ekind (Op_Id) = E_Operator then
3221 if No (Next_Entity (First_Entity (Op_Id))) then
3222 Find_Unary_Types (R, Op_Id, N);
3225 elsif Is_Overloadable (Op_Id) then
3226 Analyze_User_Defined_Unary_Op (N, Op_Id);
3229 Op_Id := Homonym (Op_Id);
3234 end Analyze_Unary_Op;
3236 ----------------------------------
3237 -- Analyze_Unchecked_Expression --
3238 ----------------------------------
3240 procedure Analyze_Unchecked_Expression (N : Node_Id) is
3242 Analyze (Expression (N), Suppress => All_Checks);
3243 Set_Etype (N, Etype (Expression (N)));
3244 Save_Interps (Expression (N), N);
3245 end Analyze_Unchecked_Expression;
3247 ---------------------------------------
3248 -- Analyze_Unchecked_Type_Conversion --
3249 ---------------------------------------
3251 procedure Analyze_Unchecked_Type_Conversion (N : Node_Id) is
3253 Find_Type (Subtype_Mark (N));
3254 Analyze_Expression (Expression (N));
3255 Set_Etype (N, Entity (Subtype_Mark (N)));
3256 end Analyze_Unchecked_Type_Conversion;
3258 ------------------------------------
3259 -- Analyze_User_Defined_Binary_Op --
3260 ------------------------------------
3262 procedure Analyze_User_Defined_Binary_Op
3267 -- Only do analysis if the operator Comes_From_Source, since otherwise
3268 -- the operator was generated by the expander, and all such operators
3269 -- always refer to the operators in package Standard.
3271 if Comes_From_Source (N) then
3273 F1 : constant Entity_Id := First_Formal (Op_Id);
3274 F2 : constant Entity_Id := Next_Formal (F1);
3277 -- Verify that Op_Id is a visible binary function. Note that since
3278 -- we know Op_Id is overloaded, potentially use visible means use
3279 -- visible for sure (RM 9.4(11)).
3281 if Ekind (Op_Id) = E_Function
3282 and then Present (F2)
3283 and then (Is_Immediately_Visible (Op_Id)
3284 or else Is_Potentially_Use_Visible (Op_Id))
3285 and then Has_Compatible_Type (Left_Opnd (N), Etype (F1))
3286 and then Has_Compatible_Type (Right_Opnd (N), Etype (F2))
3288 Add_One_Interp (N, Op_Id, Etype (Op_Id));
3290 if Debug_Flag_E then
3291 Write_Str ("user defined operator ");
3292 Write_Name (Chars (Op_Id));
3293 Write_Str (" on node ");
3294 Write_Int (Int (N));
3300 end Analyze_User_Defined_Binary_Op;
3302 -----------------------------------
3303 -- Analyze_User_Defined_Unary_Op --
3304 -----------------------------------
3306 procedure Analyze_User_Defined_Unary_Op
3311 -- Only do analysis if the operator Comes_From_Source, since otherwise
3312 -- the operator was generated by the expander, and all such operators
3313 -- always refer to the operators in package Standard.
3315 if Comes_From_Source (N) then
3317 F : constant Entity_Id := First_Formal (Op_Id);
3320 -- Verify that Op_Id is a visible unary function. Note that since
3321 -- we know Op_Id is overloaded, potentially use visible means use
3322 -- visible for sure (RM 9.4(11)).
3324 if Ekind (Op_Id) = E_Function
3325 and then No (Next_Formal (F))
3326 and then (Is_Immediately_Visible (Op_Id)
3327 or else Is_Potentially_Use_Visible (Op_Id))
3328 and then Has_Compatible_Type (Right_Opnd (N), Etype (F))
3330 Add_One_Interp (N, Op_Id, Etype (Op_Id));
3334 end Analyze_User_Defined_Unary_Op;
3336 ---------------------------
3337 -- Check_Arithmetic_Pair --
3338 ---------------------------
3340 procedure Check_Arithmetic_Pair
3341 (T1, T2 : Entity_Id;
3345 Op_Name : constant Name_Id := Chars (Op_Id);
3347 function Has_Fixed_Op (Typ : Entity_Id; Op : Entity_Id) return Boolean;
3348 -- Check whether the fixed-point type Typ has a user-defined operator
3349 -- (multiplication or division) that should hide the corresponding
3350 -- predefined operator. Used to implement Ada 2005 AI-264, to make
3351 -- such operators more visible and therefore useful.
3353 function Specific_Type (T1, T2 : Entity_Id) return Entity_Id;
3354 -- Get specific type (i.e. non-universal type if there is one)
3360 function Has_Fixed_Op (Typ : Entity_Id; Op : Entity_Id) return Boolean is
3366 -- The operation is treated as primitive if it is declared in the
3367 -- same scope as the type, and therefore on the same entity chain.
3369 Ent := Next_Entity (Typ);
3370 while Present (Ent) loop
3371 if Chars (Ent) = Chars (Op) then
3372 F1 := First_Formal (Ent);
3373 F2 := Next_Formal (F1);
3375 -- The operation counts as primitive if either operand or
3376 -- result are of the given type, and both operands are fixed
3379 if (Etype (F1) = Typ
3380 and then Is_Fixed_Point_Type (Etype (F2)))
3384 and then Is_Fixed_Point_Type (Etype (F1)))
3388 and then Is_Fixed_Point_Type (Etype (F1))
3389 and then Is_Fixed_Point_Type (Etype (F2)))
3405 function Specific_Type (T1, T2 : Entity_Id) return Entity_Id is
3407 if T1 = Universal_Integer or else T1 = Universal_Real then
3408 return Base_Type (T2);
3410 return Base_Type (T1);
3414 -- Start of processing for Check_Arithmetic_Pair
3417 if Op_Name = Name_Op_Add or else Op_Name = Name_Op_Subtract then
3419 if Is_Numeric_Type (T1)
3420 and then Is_Numeric_Type (T2)
3421 and then (Covers (T1, T2) or else Covers (T2, T1))
3423 Add_One_Interp (N, Op_Id, Specific_Type (T1, T2));
3426 elsif Op_Name = Name_Op_Multiply or else Op_Name = Name_Op_Divide then
3428 if Is_Fixed_Point_Type (T1)
3429 and then (Is_Fixed_Point_Type (T2)
3430 or else T2 = Universal_Real)
3432 -- If Treat_Fixed_As_Integer is set then the Etype is already set
3433 -- and no further processing is required (this is the case of an
3434 -- operator constructed by Exp_Fixd for a fixed point operation)
3435 -- Otherwise add one interpretation with universal fixed result
3436 -- If the operator is given in functional notation, it comes
3437 -- from source and Fixed_As_Integer cannot apply.
3439 if (Nkind (N) not in N_Op
3440 or else not Treat_Fixed_As_Integer (N))
3442 (not (Ada_Version >= Ada_05 and then Has_Fixed_Op (T1, Op_Id))
3443 or else Nkind (Parent (N)) = N_Type_Conversion)
3445 Add_One_Interp (N, Op_Id, Universal_Fixed);
3448 elsif Is_Fixed_Point_Type (T2)
3449 and then (Nkind (N) not in N_Op
3450 or else not Treat_Fixed_As_Integer (N))
3451 and then T1 = Universal_Real
3453 (not (Ada_Version >= Ada_05 and then Has_Fixed_Op (T1, Op_Id))
3454 or else Nkind (Parent (N)) = N_Type_Conversion)
3456 Add_One_Interp (N, Op_Id, Universal_Fixed);
3458 elsif Is_Numeric_Type (T1)
3459 and then Is_Numeric_Type (T2)
3460 and then (Covers (T1, T2) or else Covers (T2, T1))
3462 Add_One_Interp (N, Op_Id, Specific_Type (T1, T2));
3464 elsif Is_Fixed_Point_Type (T1)
3465 and then (Base_Type (T2) = Base_Type (Standard_Integer)
3466 or else T2 = Universal_Integer)
3468 Add_One_Interp (N, Op_Id, T1);
3470 elsif T2 = Universal_Real
3471 and then Base_Type (T1) = Base_Type (Standard_Integer)
3472 and then Op_Name = Name_Op_Multiply
3474 Add_One_Interp (N, Op_Id, Any_Fixed);
3476 elsif T1 = Universal_Real
3477 and then Base_Type (T2) = Base_Type (Standard_Integer)
3479 Add_One_Interp (N, Op_Id, Any_Fixed);
3481 elsif Is_Fixed_Point_Type (T2)
3482 and then (Base_Type (T1) = Base_Type (Standard_Integer)
3483 or else T1 = Universal_Integer)
3484 and then Op_Name = Name_Op_Multiply
3486 Add_One_Interp (N, Op_Id, T2);
3488 elsif T1 = Universal_Real and then T2 = Universal_Integer then
3489 Add_One_Interp (N, Op_Id, T1);
3491 elsif T2 = Universal_Real
3492 and then T1 = Universal_Integer
3493 and then Op_Name = Name_Op_Multiply
3495 Add_One_Interp (N, Op_Id, T2);
3498 elsif Op_Name = Name_Op_Mod or else Op_Name = Name_Op_Rem then
3500 -- Note: The fixed-point operands case with Treat_Fixed_As_Integer
3501 -- set does not require any special processing, since the Etype is
3502 -- already set (case of operation constructed by Exp_Fixed).
3504 if Is_Integer_Type (T1)
3505 and then (Covers (T1, T2) or else Covers (T2, T1))
3507 Add_One_Interp (N, Op_Id, Specific_Type (T1, T2));
3510 elsif Op_Name = Name_Op_Expon then
3511 if Is_Numeric_Type (T1)
3512 and then not Is_Fixed_Point_Type (T1)
3513 and then (Base_Type (T2) = Base_Type (Standard_Integer)
3514 or else T2 = Universal_Integer)
3516 Add_One_Interp (N, Op_Id, Base_Type (T1));
3519 else pragma Assert (Nkind (N) in N_Op_Shift);
3521 -- If not one of the predefined operators, the node may be one
3522 -- of the intrinsic functions. Its kind is always specific, and
3523 -- we can use it directly, rather than the name of the operation.
3525 if Is_Integer_Type (T1)
3526 and then (Base_Type (T2) = Base_Type (Standard_Integer)
3527 or else T2 = Universal_Integer)
3529 Add_One_Interp (N, Op_Id, Base_Type (T1));
3532 end Check_Arithmetic_Pair;
3534 -------------------------------
3535 -- Check_Misspelled_Selector --
3536 -------------------------------
3538 procedure Check_Misspelled_Selector
3539 (Prefix : Entity_Id;
3542 Max_Suggestions : constant := 2;
3543 Nr_Of_Suggestions : Natural := 0;
3545 Suggestion_1 : Entity_Id := Empty;
3546 Suggestion_2 : Entity_Id := Empty;
3551 -- All the components of the prefix of selector Sel are matched
3552 -- against Sel and a count is maintained of possible misspellings.
3553 -- When at the end of the analysis there are one or two (not more!)
3554 -- possible misspellings, these misspellings will be suggested as
3555 -- possible correction.
3557 if not (Is_Private_Type (Prefix) or else Is_Record_Type (Prefix)) then
3559 -- Concurrent types should be handled as well ???
3564 Get_Name_String (Chars (Sel));
3567 S : constant String (1 .. Name_Len) := Name_Buffer (1 .. Name_Len);
3570 Comp := First_Entity (Prefix);
3571 while Nr_Of_Suggestions <= Max_Suggestions
3572 and then Present (Comp)
3574 if Is_Visible_Component (Comp) then
3575 Get_Name_String (Chars (Comp));
3577 if Is_Bad_Spelling_Of (Name_Buffer (1 .. Name_Len), S) then
3578 Nr_Of_Suggestions := Nr_Of_Suggestions + 1;
3580 case Nr_Of_Suggestions is
3581 when 1 => Suggestion_1 := Comp;
3582 when 2 => Suggestion_2 := Comp;
3583 when others => exit;
3588 Comp := Next_Entity (Comp);
3591 -- Report at most two suggestions
3593 if Nr_Of_Suggestions = 1 then
3594 Error_Msg_NE ("\possible misspelling of&", Sel, Suggestion_1);
3596 elsif Nr_Of_Suggestions = 2 then
3597 Error_Msg_Node_2 := Suggestion_2;
3598 Error_Msg_NE ("\possible misspelling of& or&",
3602 end Check_Misspelled_Selector;
3604 ----------------------
3605 -- Defined_In_Scope --
3606 ----------------------
3608 function Defined_In_Scope (T : Entity_Id; S : Entity_Id) return Boolean
3610 S1 : constant Entity_Id := Scope (Base_Type (T));
3613 or else (S1 = System_Aux_Id and then S = Scope (S1));
3614 end Defined_In_Scope;
3620 procedure Diagnose_Call (N : Node_Id; Nam : Node_Id) is
3627 Void_Interp_Seen : Boolean := False;
3630 if Ada_Version >= Ada_05 then
3631 Actual := First_Actual (N);
3632 while Present (Actual) loop
3634 -- Ada 2005 (AI-50217): Post an error in case of premature
3635 -- usage of an entity from the limited view.
3637 if not Analyzed (Etype (Actual))
3638 and then From_With_Type (Etype (Actual))
3640 Error_Msg_Qual_Level := 1;
3642 ("missing with_clause for scope of imported type&",
3643 Actual, Etype (Actual));
3644 Error_Msg_Qual_Level := 0;
3647 Next_Actual (Actual);
3651 -- Analyze each candidate call again, with full error reporting
3655 ("no candidate interpretations match the actuals:!", Nam);
3656 Err_Mode := All_Errors_Mode;
3657 All_Errors_Mode := True;
3659 -- If this is a call to an operation of a concurrent type,
3660 -- the failed interpretations have been removed from the
3661 -- name. Recover them to provide full diagnostics.
3663 if Nkind (Parent (Nam)) = N_Selected_Component then
3664 Set_Entity (Nam, Empty);
3665 New_Nam := New_Copy_Tree (Parent (Nam));
3666 Set_Is_Overloaded (New_Nam, False);
3667 Set_Is_Overloaded (Selector_Name (New_Nam), False);
3668 Set_Parent (New_Nam, Parent (Parent (Nam)));
3669 Analyze_Selected_Component (New_Nam);
3670 Get_First_Interp (Selector_Name (New_Nam), X, It);
3672 Get_First_Interp (Nam, X, It);
3675 while Present (It.Nam) loop
3676 if Etype (It.Nam) = Standard_Void_Type then
3677 Void_Interp_Seen := True;
3680 Analyze_One_Call (N, It.Nam, True, Success);
3681 Get_Next_Interp (X, It);
3684 if Nkind (N) = N_Function_Call then
3685 Get_First_Interp (Nam, X, It);
3686 while Present (It.Nam) loop
3687 if Ekind (It.Nam) = E_Function
3688 or else Ekind (It.Nam) = E_Operator
3692 Get_Next_Interp (X, It);
3696 -- If all interpretations are procedures, this deserves a
3697 -- more precise message. Ditto if this appears as the prefix
3698 -- of a selected component, which may be a lexical error.
3701 ("\context requires function call, found procedure name", Nam);
3703 if Nkind (Parent (N)) = N_Selected_Component
3704 and then N = Prefix (Parent (N))
3707 "\period should probably be semicolon", Parent (N));
3710 elsif Nkind (N) = N_Procedure_Call_Statement
3711 and then not Void_Interp_Seen
3714 "\function name found in procedure call", Nam);
3717 All_Errors_Mode := Err_Mode;
3720 ---------------------------
3721 -- Find_Arithmetic_Types --
3722 ---------------------------
3724 procedure Find_Arithmetic_Types
3729 Index1 : Interp_Index;
3730 Index2 : Interp_Index;
3734 procedure Check_Right_Argument (T : Entity_Id);
3735 -- Check right operand of operator
3737 --------------------------
3738 -- Check_Right_Argument --
3739 --------------------------
3741 procedure Check_Right_Argument (T : Entity_Id) is
3743 if not Is_Overloaded (R) then
3744 Check_Arithmetic_Pair (T, Etype (R), Op_Id, N);
3746 Get_First_Interp (R, Index2, It2);
3747 while Present (It2.Typ) loop
3748 Check_Arithmetic_Pair (T, It2.Typ, Op_Id, N);
3749 Get_Next_Interp (Index2, It2);
3752 end Check_Right_Argument;
3754 -- Start processing for Find_Arithmetic_Types
3757 if not Is_Overloaded (L) then
3758 Check_Right_Argument (Etype (L));
3761 Get_First_Interp (L, Index1, It1);
3763 while Present (It1.Typ) loop
3764 Check_Right_Argument (It1.Typ);
3765 Get_Next_Interp (Index1, It1);
3769 end Find_Arithmetic_Types;
3771 ------------------------
3772 -- Find_Boolean_Types --
3773 ------------------------
3775 procedure Find_Boolean_Types
3780 Index : Interp_Index;
3783 procedure Check_Numeric_Argument (T : Entity_Id);
3784 -- Special case for logical operations one of whose operands is an
3785 -- integer literal. If both are literal the result is any modular type.
3787 ----------------------------
3788 -- Check_Numeric_Argument --
3789 ----------------------------
3791 procedure Check_Numeric_Argument (T : Entity_Id) is
3793 if T = Universal_Integer then
3794 Add_One_Interp (N, Op_Id, Any_Modular);
3796 elsif Is_Modular_Integer_Type (T) then
3797 Add_One_Interp (N, Op_Id, T);
3799 end Check_Numeric_Argument;
3801 -- Start of processing for Find_Boolean_Types
3804 if not Is_Overloaded (L) then
3805 if Etype (L) = Universal_Integer
3806 or else Etype (L) = Any_Modular
3808 if not Is_Overloaded (R) then
3809 Check_Numeric_Argument (Etype (R));
3812 Get_First_Interp (R, Index, It);
3813 while Present (It.Typ) loop
3814 Check_Numeric_Argument (It.Typ);
3815 Get_Next_Interp (Index, It);
3819 elsif Valid_Boolean_Arg (Etype (L))
3820 and then Has_Compatible_Type (R, Etype (L))
3822 Add_One_Interp (N, Op_Id, Etype (L));
3826 Get_First_Interp (L, Index, It);
3827 while Present (It.Typ) loop
3828 if Valid_Boolean_Arg (It.Typ)
3829 and then Has_Compatible_Type (R, It.Typ)
3831 Add_One_Interp (N, Op_Id, It.Typ);
3834 Get_Next_Interp (Index, It);
3837 end Find_Boolean_Types;
3839 ---------------------------
3840 -- Find_Comparison_Types --
3841 ---------------------------
3843 procedure Find_Comparison_Types
3848 Index : Interp_Index;
3850 Found : Boolean := False;
3853 Scop : Entity_Id := Empty;
3855 procedure Try_One_Interp (T1 : Entity_Id);
3856 -- Routine to try one proposed interpretation. Note that the context
3857 -- of the operator plays no role in resolving the arguments, so that
3858 -- if there is more than one interpretation of the operands that is
3859 -- compatible with comparison, the operation is ambiguous.
3861 --------------------
3862 -- Try_One_Interp --
3863 --------------------
3865 procedure Try_One_Interp (T1 : Entity_Id) is
3868 -- If the operator is an expanded name, then the type of the operand
3869 -- must be defined in the corresponding scope. If the type is
3870 -- universal, the context will impose the correct type.
3873 and then not Defined_In_Scope (T1, Scop)
3874 and then T1 /= Universal_Integer
3875 and then T1 /= Universal_Real
3876 and then T1 /= Any_String
3877 and then T1 /= Any_Composite
3882 if Valid_Comparison_Arg (T1)
3883 and then Has_Compatible_Type (R, T1)
3886 and then Base_Type (T1) /= Base_Type (T_F)
3888 It := Disambiguate (L, I_F, Index, Any_Type);
3890 if It = No_Interp then
3891 Ambiguous_Operands (N);
3892 Set_Etype (L, Any_Type);
3906 Find_Non_Universal_Interpretations (N, R, Op_Id, T1);
3911 -- Start processing for Find_Comparison_Types
3914 -- If left operand is aggregate, the right operand has to
3915 -- provide a usable type for it.
3917 if Nkind (L) = N_Aggregate
3918 and then Nkind (R) /= N_Aggregate
3920 Find_Comparison_Types (R, L, Op_Id, N);
3924 if Nkind (N) = N_Function_Call
3925 and then Nkind (Name (N)) = N_Expanded_Name
3927 Scop := Entity (Prefix (Name (N)));
3929 -- The prefix may be a package renaming, and the subsequent test
3930 -- requires the original package.
3932 if Ekind (Scop) = E_Package
3933 and then Present (Renamed_Entity (Scop))
3935 Scop := Renamed_Entity (Scop);
3936 Set_Entity (Prefix (Name (N)), Scop);
3940 if not Is_Overloaded (L) then
3941 Try_One_Interp (Etype (L));
3944 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_Comparison_Types;
3952 ----------------------------------------
3953 -- Find_Non_Universal_Interpretations --
3954 ----------------------------------------
3956 procedure Find_Non_Universal_Interpretations
3962 Index : Interp_Index;
3966 if T1 = Universal_Integer
3967 or else T1 = Universal_Real
3969 if not Is_Overloaded (R) then
3971 (N, Op_Id, Standard_Boolean, Base_Type (Etype (R)));
3973 Get_First_Interp (R, Index, It);
3974 while Present (It.Typ) loop
3975 if Covers (It.Typ, T1) then
3977 (N, Op_Id, Standard_Boolean, Base_Type (It.Typ));
3980 Get_Next_Interp (Index, It);
3984 Add_One_Interp (N, Op_Id, Standard_Boolean, Base_Type (T1));
3986 end Find_Non_Universal_Interpretations;
3988 ------------------------------
3989 -- Find_Concatenation_Types --
3990 ------------------------------
3992 procedure Find_Concatenation_Types
3997 Op_Type : constant Entity_Id := Etype (Op_Id);
4000 if Is_Array_Type (Op_Type)
4001 and then not Is_Limited_Type (Op_Type)
4003 and then (Has_Compatible_Type (L, Op_Type)
4005 Has_Compatible_Type (L, Component_Type (Op_Type)))
4007 and then (Has_Compatible_Type (R, Op_Type)
4009 Has_Compatible_Type (R, Component_Type (Op_Type)))
4011 Add_One_Interp (N, Op_Id, Op_Type);
4013 end Find_Concatenation_Types;
4015 -------------------------
4016 -- Find_Equality_Types --
4017 -------------------------
4019 procedure Find_Equality_Types
4024 Index : Interp_Index;
4026 Found : Boolean := False;
4029 Scop : Entity_Id := Empty;
4031 procedure Try_One_Interp (T1 : Entity_Id);
4032 -- The context of the operator plays no role in resolving the
4033 -- arguments, so that if there is more than one interpretation
4034 -- of the operands that is compatible with equality, the construct
4035 -- is ambiguous and an error can be emitted now, after trying to
4036 -- disambiguate, i.e. applying preference rules.
4038 --------------------
4039 -- Try_One_Interp --
4040 --------------------
4042 procedure Try_One_Interp (T1 : Entity_Id) is
4044 -- If the operator is an expanded name, then the type of the operand
4045 -- must be defined in the corresponding scope. If the type is
4046 -- universal, the context will impose the correct type. An anonymous
4047 -- type for a 'Access reference is also universal in this sense, as
4048 -- the actual type is obtained from context.
4051 and then not Defined_In_Scope (T1, Scop)
4052 and then T1 /= Universal_Integer
4053 and then T1 /= Universal_Real
4054 and then T1 /= Any_Access
4055 and then T1 /= Any_String
4056 and then T1 /= Any_Composite
4057 and then (Ekind (T1) /= E_Access_Subprogram_Type
4058 or else Comes_From_Source (T1))
4063 -- Ada 2005 (AI-230): Keep restriction imposed by Ada 83 and 95:
4064 -- Do not allow anonymous access types in equality operators.
4066 if Ada_Version < Ada_05
4067 and then Ekind (T1) = E_Anonymous_Access_Type
4072 if T1 /= Standard_Void_Type
4073 and then not Is_Limited_Type (T1)
4074 and then not Is_Limited_Composite (T1)
4075 and then Has_Compatible_Type (R, T1)
4078 and then Base_Type (T1) /= Base_Type (T_F)
4080 It := Disambiguate (L, I_F, Index, Any_Type);
4082 if It = No_Interp then
4083 Ambiguous_Operands (N);
4084 Set_Etype (L, Any_Type);
4097 if not Analyzed (L) then
4101 Find_Non_Universal_Interpretations (N, R, Op_Id, T1);
4103 -- Case of operator was not visible, Etype still set to Any_Type
4105 if Etype (N) = Any_Type then
4111 -- Start of processing for Find_Equality_Types
4114 -- If left operand is aggregate, the right operand has to
4115 -- provide a usable type for it.
4117 if Nkind (L) = N_Aggregate
4118 and then Nkind (R) /= N_Aggregate
4120 Find_Equality_Types (R, L, Op_Id, N);
4124 if Nkind (N) = N_Function_Call
4125 and then Nkind (Name (N)) = N_Expanded_Name
4127 Scop := Entity (Prefix (Name (N)));
4129 -- The prefix may be a package renaming, and the subsequent test
4130 -- requires the original package.
4132 if Ekind (Scop) = E_Package
4133 and then Present (Renamed_Entity (Scop))
4135 Scop := Renamed_Entity (Scop);
4136 Set_Entity (Prefix (Name (N)), Scop);
4140 if not Is_Overloaded (L) then
4141 Try_One_Interp (Etype (L));
4144 Get_First_Interp (L, Index, It);
4145 while Present (It.Typ) loop
4146 Try_One_Interp (It.Typ);
4147 Get_Next_Interp (Index, It);
4150 end Find_Equality_Types;
4152 -------------------------
4153 -- Find_Negation_Types --
4154 -------------------------
4156 procedure Find_Negation_Types
4161 Index : Interp_Index;
4165 if not Is_Overloaded (R) then
4166 if Etype (R) = Universal_Integer then
4167 Add_One_Interp (N, Op_Id, Any_Modular);
4168 elsif Valid_Boolean_Arg (Etype (R)) then
4169 Add_One_Interp (N, Op_Id, Etype (R));
4173 Get_First_Interp (R, Index, It);
4174 while Present (It.Typ) loop
4175 if Valid_Boolean_Arg (It.Typ) then
4176 Add_One_Interp (N, Op_Id, It.Typ);
4179 Get_Next_Interp (Index, It);
4182 end Find_Negation_Types;
4184 ----------------------
4185 -- Find_Unary_Types --
4186 ----------------------
4188 procedure Find_Unary_Types
4193 Index : Interp_Index;
4197 if not Is_Overloaded (R) then
4198 if Is_Numeric_Type (Etype (R)) then
4199 Add_One_Interp (N, Op_Id, Base_Type (Etype (R)));
4203 Get_First_Interp (R, Index, It);
4204 while Present (It.Typ) loop
4205 if Is_Numeric_Type (It.Typ) then
4206 Add_One_Interp (N, Op_Id, Base_Type (It.Typ));
4209 Get_Next_Interp (Index, It);
4212 end Find_Unary_Types;
4218 function Junk_Operand (N : Node_Id) return Boolean is
4222 if Error_Posted (N) then
4226 -- Get entity to be tested
4228 if Is_Entity_Name (N)
4229 and then Present (Entity (N))
4233 -- An odd case, a procedure name gets converted to a very peculiar
4234 -- function call, and here is where we detect this happening.
4236 elsif Nkind (N) = N_Function_Call
4237 and then Is_Entity_Name (Name (N))
4238 and then Present (Entity (Name (N)))
4242 -- Another odd case, there are at least some cases of selected
4243 -- components where the selected component is not marked as having
4244 -- an entity, even though the selector does have an entity
4246 elsif Nkind (N) = N_Selected_Component
4247 and then Present (Entity (Selector_Name (N)))
4249 Enode := Selector_Name (N);
4255 -- Now test the entity we got to see if it a bad case
4257 case Ekind (Entity (Enode)) is
4261 ("package name cannot be used as operand", Enode);
4263 when Generic_Unit_Kind =>
4265 ("generic unit name cannot be used as operand", Enode);
4269 ("subtype name cannot be used as operand", Enode);
4273 ("entry name cannot be used as operand", Enode);
4277 ("procedure name cannot be used as operand", Enode);
4281 ("exception name cannot be used as operand", Enode);
4283 when E_Block | E_Label | E_Loop =>
4285 ("label name cannot be used as operand", Enode);
4295 --------------------
4296 -- Operator_Check --
4297 --------------------
4299 procedure Operator_Check (N : Node_Id) is
4301 Remove_Abstract_Operations (N);
4303 -- Test for case of no interpretation found for operator
4305 if Etype (N) = Any_Type then
4311 R := Right_Opnd (N);
4313 if Nkind (N) in N_Binary_Op then
4319 -- If either operand has no type, then don't complain further,
4320 -- since this simply means that we have a propragated error.
4323 or else Etype (R) = Any_Type
4324 or else (Nkind (N) in N_Binary_Op and then Etype (L) = Any_Type)
4328 -- We explicitly check for the case of concatenation of component
4329 -- with component to avoid reporting spurious matching array types
4330 -- that might happen to be lurking in distant packages (such as
4331 -- run-time packages). This also prevents inconsistencies in the
4332 -- messages for certain ACVC B tests, which can vary depending on
4333 -- types declared in run-time interfaces. Another improvement when
4334 -- aggregates are present is to look for a well-typed operand.
4336 elsif Present (Candidate_Type)
4337 and then (Nkind (N) /= N_Op_Concat
4338 or else Is_Array_Type (Etype (L))
4339 or else Is_Array_Type (Etype (R)))
4342 if Nkind (N) = N_Op_Concat then
4343 if Etype (L) /= Any_Composite
4344 and then Is_Array_Type (Etype (L))
4346 Candidate_Type := Etype (L);
4348 elsif Etype (R) /= Any_Composite
4349 and then Is_Array_Type (Etype (R))
4351 Candidate_Type := Etype (R);
4356 ("operator for} is not directly visible!",
4357 N, First_Subtype (Candidate_Type));
4358 Error_Msg_N ("use clause would make operation legal!", N);
4361 -- If either operand is a junk operand (e.g. package name), then
4362 -- post appropriate error messages, but do not complain further.
4364 -- Note that the use of OR in this test instead of OR ELSE
4365 -- is quite deliberate, we may as well check both operands
4366 -- in the binary operator case.
4368 elsif Junk_Operand (R)
4369 or (Nkind (N) in N_Binary_Op and then Junk_Operand (L))
4373 -- If we have a logical operator, one of whose operands is
4374 -- Boolean, then we know that the other operand cannot resolve
4375 -- to Boolean (since we got no interpretations), but in that
4376 -- case we pretty much know that the other operand should be
4377 -- Boolean, so resolve it that way (generating an error)
4379 elsif Nkind (N) = N_Op_And
4383 Nkind (N) = N_Op_Xor
4385 if Etype (L) = Standard_Boolean then
4386 Resolve (R, Standard_Boolean);
4388 elsif Etype (R) = Standard_Boolean then
4389 Resolve (L, Standard_Boolean);
4393 -- For an arithmetic operator or comparison operator, if one
4394 -- of the operands is numeric, then we know the other operand
4395 -- is not the same numeric type. If it is a non-numeric type,
4396 -- then probably it is intended to match the other operand.
4398 elsif Nkind (N) = N_Op_Add or else
4399 Nkind (N) = N_Op_Divide or else
4400 Nkind (N) = N_Op_Ge or else
4401 Nkind (N) = N_Op_Gt or else
4402 Nkind (N) = N_Op_Le or else
4403 Nkind (N) = N_Op_Lt or else
4404 Nkind (N) = N_Op_Mod or else
4405 Nkind (N) = N_Op_Multiply or else
4406 Nkind (N) = N_Op_Rem or else
4407 Nkind (N) = N_Op_Subtract
4409 if Is_Numeric_Type (Etype (L))
4410 and then not Is_Numeric_Type (Etype (R))
4412 Resolve (R, Etype (L));
4415 elsif Is_Numeric_Type (Etype (R))
4416 and then not Is_Numeric_Type (Etype (L))
4418 Resolve (L, Etype (R));
4422 -- Comparisons on A'Access are common enough to deserve a
4425 elsif (Nkind (N) = N_Op_Eq or else
4426 Nkind (N) = N_Op_Ne)
4427 and then Ekind (Etype (L)) = E_Access_Attribute_Type
4428 and then Ekind (Etype (R)) = E_Access_Attribute_Type
4431 ("two access attributes cannot be compared directly", N);
4433 ("\they must be converted to an explicit type for comparison",
4437 -- Another one for C programmers
4439 elsif Nkind (N) = N_Op_Concat
4440 and then Valid_Boolean_Arg (Etype (L))
4441 and then Valid_Boolean_Arg (Etype (R))
4443 Error_Msg_N ("invalid operands for concatenation", N);
4444 Error_Msg_N ("\maybe AND was meant", N);
4447 -- A special case for comparison of access parameter with null
4449 elsif Nkind (N) = N_Op_Eq
4450 and then Is_Entity_Name (L)
4451 and then Nkind (Parent (Entity (L))) = N_Parameter_Specification
4452 and then Nkind (Parameter_Type (Parent (Entity (L)))) =
4454 and then Nkind (R) = N_Null
4456 Error_Msg_N ("access parameter is not allowed to be null", L);
4457 Error_Msg_N ("\(call would raise Constraint_Error)", L);
4461 -- If we fall through then just give general message. Note
4462 -- that in the following messages, if the operand is overloaded
4463 -- we choose an arbitrary type to complain about, but that is
4464 -- probably more useful than not giving a type at all.
4466 if Nkind (N) in N_Unary_Op then
4467 Error_Msg_Node_2 := Etype (R);
4468 Error_Msg_N ("operator& not defined for}", N);
4472 if Nkind (N) in N_Binary_Op then
4473 if not Is_Overloaded (L)
4474 and then not Is_Overloaded (R)
4475 and then Base_Type (Etype (L)) = Base_Type (Etype (R))
4477 Error_Msg_Node_2 := First_Subtype (Etype (R));
4478 Error_Msg_N ("there is no applicable operator& for}", N);
4481 Error_Msg_N ("invalid operand types for operator&", N);
4483 if Nkind (N) /= N_Op_Concat then
4484 Error_Msg_NE ("\left operand has}!", N, Etype (L));
4485 Error_Msg_NE ("\right operand has}!", N, Etype (R));
4494 -----------------------------------------
4495 -- Process_Implicit_Dereference_Prefix --
4496 -----------------------------------------
4498 procedure Process_Implicit_Dereference_Prefix
4506 and then (Operating_Mode = Check_Semantics or else not Expander_Active)
4508 -- We create a dummy reference to E to ensure that the reference
4509 -- is not considered as part of an assignment (an implicit
4510 -- dereference can never assign to its prefix). The Comes_From_Source
4511 -- attribute needs to be propagated for accurate warnings.
4513 Ref := New_Reference_To (E, Sloc (P));
4514 Set_Comes_From_Source (Ref, Comes_From_Source (P));
4515 Generate_Reference (E, Ref);
4517 end Process_Implicit_Dereference_Prefix;
4519 --------------------------------
4520 -- Remove_Abstract_Operations --
4521 --------------------------------
4523 procedure Remove_Abstract_Operations (N : Node_Id) is
4526 Abstract_Op : Entity_Id := Empty;
4528 -- AI-310: If overloaded, remove abstract non-dispatching
4529 -- operations. We activate this if either extensions are
4530 -- enabled, or if the abstract operation in question comes
4531 -- from a predefined file. This latter test allows us to
4532 -- use abstract to make operations invisible to users. In
4533 -- particular, if type Address is non-private and abstract
4534 -- subprograms are used to hide its operators, they will be
4537 type Operand_Position is (First_Op, Second_Op);
4538 Univ_Type : constant Entity_Id := Universal_Interpretation (N);
4540 procedure Remove_Address_Interpretations (Op : Operand_Position);
4541 -- Ambiguities may arise when the operands are literal and the
4542 -- address operations in s-auxdec are visible. In that case, remove
4543 -- the interpretation of a literal as Address, to retain the semantics
4544 -- of Address as a private type.
4546 ------------------------------------
4547 -- Remove_Address_Interpretations --
4548 ------------------------------------
4550 procedure Remove_Address_Interpretations (Op : Operand_Position) is
4554 if Is_Overloaded (N) then
4555 Get_First_Interp (N, I, It);
4556 while Present (It.Nam) loop
4557 Formal := First_Entity (It.Nam);
4559 if Op = Second_Op then
4560 Formal := Next_Entity (Formal);
4563 if Is_Descendent_Of_Address (Etype (Formal)) then
4567 Get_Next_Interp (I, It);
4570 end Remove_Address_Interpretations;
4572 -- Start of processing for Remove_Abstract_Operations
4575 if Is_Overloaded (N) then
4576 Get_First_Interp (N, I, It);
4578 while Present (It.Nam) loop
4579 if not Is_Type (It.Nam)
4580 and then Is_Abstract (It.Nam)
4581 and then not Is_Dispatching_Operation (It.Nam)
4583 (Ada_Version >= Ada_05
4584 or else Is_Predefined_File_Name
4585 (Unit_File_Name (Get_Source_Unit (It.Nam))))
4588 Abstract_Op := It.Nam;
4593 Get_Next_Interp (I, It);
4596 if No (Abstract_Op) then
4599 elsif Nkind (N) in N_Op then
4601 -- Remove interpretations that treat literals as addresses.
4602 -- This is never appropriate.
4604 if Nkind (N) in N_Binary_Op then
4606 U1 : constant Boolean :=
4607 Present (Universal_Interpretation (Right_Opnd (N)));
4608 U2 : constant Boolean :=
4609 Present (Universal_Interpretation (Left_Opnd (N)));
4612 if U1 and then not U2 then
4613 Remove_Address_Interpretations (Second_Op);
4615 elsif U2 and then not U1 then
4616 Remove_Address_Interpretations (First_Op);
4619 if not (U1 and U2) then
4621 -- Remove corresponding predefined operator, which is
4622 -- always added to the overload set.
4624 Get_First_Interp (N, I, It);
4625 while Present (It.Nam) loop
4626 if Scope (It.Nam) = Standard_Standard
4627 and then Base_Type (It.Typ) =
4628 Base_Type (Etype (Abstract_Op))
4633 Get_Next_Interp (I, It);
4636 elsif Is_Overloaded (N)
4637 and then Present (Univ_Type)
4639 -- If both operands have a universal interpretation,
4640 -- select the predefined operator and discard others.
4642 Get_First_Interp (N, I, It);
4644 while Present (It.Nam) loop
4645 if Scope (It.Nam) = Standard_Standard then
4646 Set_Etype (N, Univ_Type);
4647 Set_Entity (N, It.Nam);
4648 Set_Is_Overloaded (N, False);
4652 Get_Next_Interp (I, It);
4658 elsif Nkind (N) = N_Function_Call
4660 (Nkind (Name (N)) = N_Operator_Symbol
4662 (Nkind (Name (N)) = N_Expanded_Name
4664 Nkind (Selector_Name (Name (N))) = N_Operator_Symbol))
4668 Arg1 : constant Node_Id := First (Parameter_Associations (N));
4669 U1 : constant Boolean :=
4670 Present (Universal_Interpretation (Arg1));
4671 U2 : constant Boolean :=
4672 Present (Next (Arg1)) and then
4673 Present (Universal_Interpretation (Next (Arg1)));
4676 if U1 and then not U2 then
4677 Remove_Address_Interpretations (First_Op);
4679 elsif U2 and then not U1 then
4680 Remove_Address_Interpretations (Second_Op);
4683 if not (U1 and U2) then
4684 Get_First_Interp (N, I, It);
4685 while Present (It.Nam) loop
4686 if Scope (It.Nam) = Standard_Standard
4687 and then It.Typ = Base_Type (Etype (Abstract_Op))
4692 Get_Next_Interp (I, It);
4698 -- If the removal has left no valid interpretations, emit
4699 -- error message now and label node as illegal.
4701 if Present (Abstract_Op) then
4702 Get_First_Interp (N, I, It);
4706 -- Removal of abstract operation left no viable candidate
4708 Set_Etype (N, Any_Type);
4709 Error_Msg_Sloc := Sloc (Abstract_Op);
4711 ("cannot call abstract operation& declared#", N, Abstract_Op);
4715 end Remove_Abstract_Operations;
4717 -----------------------
4718 -- Try_Indirect_Call --
4719 -----------------------
4721 function Try_Indirect_Call
4724 Typ : Entity_Id) return Boolean
4731 Normalize_Actuals (N, Designated_Type (Typ), False, Call_OK);
4732 Actual := First_Actual (N);
4733 Formal := First_Formal (Designated_Type (Typ));
4735 while Present (Actual)
4736 and then Present (Formal)
4738 if not Has_Compatible_Type (Actual, Etype (Formal)) then
4743 Next_Formal (Formal);
4746 if No (Actual) and then No (Formal) then
4747 Add_One_Interp (N, Nam, Etype (Designated_Type (Typ)));
4749 -- Nam is a candidate interpretation for the name in the call,
4750 -- if it is not an indirect call.
4752 if not Is_Type (Nam)
4753 and then Is_Entity_Name (Name (N))
4755 Set_Entity (Name (N), Nam);
4762 end Try_Indirect_Call;
4764 ----------------------
4765 -- Try_Indexed_Call --
4766 ----------------------
4768 function Try_Indexed_Call
4771 Typ : Entity_Id) return Boolean
4773 Actuals : constant List_Id := Parameter_Associations (N);
4778 Actual := First (Actuals);
4779 Index := First_Index (Typ);
4780 while Present (Actual)
4781 and then Present (Index)
4783 -- If the parameter list has a named association, the expression
4784 -- is definitely a call and not an indexed component.
4786 if Nkind (Actual) = N_Parameter_Association then
4790 if not Has_Compatible_Type (Actual, Etype (Index)) then
4798 if No (Actual) and then No (Index) then
4799 Add_One_Interp (N, Nam, Component_Type (Typ));
4801 -- Nam is a candidate interpretation for the name in the call,
4802 -- if it is not an indirect call.
4804 if not Is_Type (Nam)
4805 and then Is_Entity_Name (Name (N))
4807 Set_Entity (Name (N), Nam);
4814 end Try_Indexed_Call;
4816 --------------------------
4817 -- Try_Object_Operation --
4818 --------------------------
4820 function Try_Object_Operation (N : Node_Id) return Boolean is
4821 K : constant Node_Kind := Nkind (Parent (N));
4822 Loc : constant Source_Ptr := Sloc (N);
4823 Is_Subprg_Call : constant Boolean := K = N_Procedure_Call_Statement
4824 or else K = N_Function_Call;
4825 Obj : constant Node_Id := Prefix (N);
4826 Subprog : constant Node_Id := Selector_Name (N);
4829 Call_Node : Node_Id;
4830 Call_Node_Case : Node_Id := Empty;
4831 First_Actual : Node_Id;
4832 Node_To_Replace : Node_Id;
4833 Obj_Type : Entity_Id := Etype (Obj);
4835 procedure Complete_Object_Operation
4836 (Call_Node : Node_Id;
4837 Node_To_Replace : Node_Id;
4839 -- Set Subprog as the name of Call_Node, replace Node_To_Replace with
4840 -- Call_Node and reanalyze Node_To_Replace.
4842 procedure Transform_Object_Operation
4843 (Call_Node : out Node_Id;
4844 First_Actual : Node_Id;
4845 Node_To_Replace : out Node_Id;
4847 -- Transform Object.Operation (...) to Operation (Object, ...)
4848 -- Call_Node is the resulting subprogram call node, First_Actual is
4849 -- either the object Obj or an explicit dereference of Obj in certain
4850 -- cases, Node_To_Replace is either N or the parent of N, and Subprog
4851 -- is the subprogram we are trying to match.
4853 function Try_Class_Wide_Operation
4854 (Call_Node : Node_Id;
4855 Node_To_Replace : Node_Id) return Boolean;
4856 -- Traverse all the ancestor types looking for a class-wide subprogram
4857 -- that matches Subprog.
4859 function Try_Primitive_Operation
4860 (Call_Node : Node_Id;
4861 Node_To_Replace : Node_Id) return Boolean;
4862 -- Traverse the list of primitive subprograms looking for a subprogram
4863 -- than matches Subprog.
4865 -------------------------------
4866 -- Complete_Object_Operation --
4867 -------------------------------
4869 procedure Complete_Object_Operation
4870 (Call_Node : Node_Id;
4871 Node_To_Replace : Node_Id;
4875 Set_Name (Call_Node, New_Copy_Tree (Subprog));
4876 Set_Analyzed (Call_Node, False);
4877 Rewrite (Node_To_Replace, Call_Node);
4878 Analyze (Node_To_Replace);
4879 end Complete_Object_Operation;
4881 --------------------------------
4882 -- Transform_Object_Operation --
4883 --------------------------------
4885 procedure Transform_Object_Operation
4886 (Call_Node : out Node_Id;
4887 First_Actual : Node_Id;
4888 Node_To_Replace : out Node_Id;
4892 Parent_Node : constant Node_Id := Parent (N);
4895 Actuals := New_List (New_Copy_Tree (First_Actual));
4897 if (Nkind (Parent_Node) = N_Function_Call
4899 Nkind (Parent_Node) = N_Procedure_Call_Statement)
4901 -- Avoid recursive calls
4903 and then N /= First (Parameter_Associations (Parent_Node))
4905 Node_To_Replace := Parent_Node;
4907 -- Copy list of actuals in full before attempting to resolve call.
4908 -- This is necessary to ensure that the chaining of named actuals
4909 -- that happens during matching is done on a separate copy.
4914 Actual := First (Parameter_Associations (Parent_Node));
4915 while Present (Actual) loop
4917 New_Actual : constant Node_Id := New_Copy_Tree (Actual);
4920 Append (New_Actual, Actuals);
4922 if Nkind (Actual) = N_Function_Call
4923 and then Is_Overloaded (Name (Actual))
4925 Save_Interps (Name (Actual), Name (New_Actual));
4933 if Nkind (Parent_Node) = N_Procedure_Call_Statement then
4935 Make_Procedure_Call_Statement (Loc,
4936 Name => New_Copy_Tree (Subprog),
4937 Parameter_Associations => Actuals);
4940 pragma Assert (Nkind (Parent_Node) = N_Function_Call);
4943 Make_Function_Call (Loc,
4944 Name => New_Copy_Tree (Subprog),
4945 Parameter_Associations => Actuals);
4949 -- Before analysis, the function call appears as an
4950 -- indexed component.
4952 elsif Nkind (Parent_Node) = N_Indexed_Component then
4953 Node_To_Replace := Parent_Node;
4959 Actual := First (Expressions (Parent_Node));
4960 while Present (Actual) loop
4961 New_Act := New_Copy_Tree (Actual);
4963 Append (New_Act, Actuals);
4969 Make_Function_Call (Loc,
4970 Name => New_Copy_Tree (Subprog),
4971 Parameter_Associations => Actuals);
4973 -- Parameterless call
4976 Node_To_Replace := N;
4979 Make_Function_Call (Loc,
4980 Name => New_Copy_Tree (Subprog),
4981 Parameter_Associations => Actuals);
4983 end Transform_Object_Operation;
4985 ------------------------------
4986 -- Try_Class_Wide_Operation --
4987 ------------------------------
4989 function Try_Class_Wide_Operation
4990 (Call_Node : Node_Id;
4991 Node_To_Replace : Node_Id) return Boolean
4993 Anc_Type : Entity_Id;
5000 -- Loop through ancestor types, traverse their homonym chains and
5001 -- gather all interpretations of the subprogram.
5003 Anc_Type := Obj_Type;
5005 Hom := Current_Entity (Subprog);
5006 while Present (Hom) loop
5007 if (Ekind (Hom) = E_Procedure
5009 Ekind (Hom) = E_Function)
5010 and then Present (First_Formal (Hom))
5011 and then Etype (First_Formal (Hom)) =
5012 Class_Wide_Type (Anc_Type)
5014 Hom_Ref := New_Reference_To (Hom, Loc);
5016 -- When both the type of the object and the type of the
5017 -- first formal of the primitive operation are tagged
5018 -- access types, we use a node with the object as first
5021 if Is_Access_Type (Etype (Obj))
5022 and then Ekind (Etype (First_Formal (Hom))) =
5023 E_Anonymous_Access_Type
5025 -- Allocate the node only once
5027 if not Present (Call_Node_Case) then
5028 Analyze_Expression (Obj);
5031 Transform_Object_Operation (
5032 Call_Node => Call_Node_Case,
5033 First_Actual => Obj,
5034 Node_To_Replace => Dummy,
5035 Subprog => Subprog);
5037 Set_Etype (Call_Node_Case, Any_Type);
5038 Set_Parent (Call_Node_Case, Parent (Node_To_Replace));
5041 Set_Name (Call_Node_Case, Hom_Ref);
5044 N => Call_Node_Case,
5047 Success => Success);
5050 Complete_Object_Operation (
5051 Call_Node => Call_Node_Case,
5052 Node_To_Replace => Node_To_Replace,
5053 Subprog => Hom_Ref);
5058 -- ??? comment required
5061 Set_Name (Call_Node, Hom_Ref);
5067 Success => Success);
5070 Complete_Object_Operation (
5071 Call_Node => Call_Node,
5072 Node_To_Replace => Node_To_Replace,
5073 Subprog => Hom_Ref);
5080 Hom := Homonym (Hom);
5083 -- Climb to ancestor type if there is one
5085 exit when Etype (Anc_Type) = Anc_Type;
5086 Anc_Type := Etype (Anc_Type);
5090 end Try_Class_Wide_Operation;
5092 -----------------------------
5093 -- Try_Primitive_Operation --
5094 -----------------------------
5096 function Try_Primitive_Operation
5097 (Call_Node : Node_Id;
5098 Node_To_Replace : Node_Id) return Boolean
5102 Prim_Op : Entity_Id;
5103 Prim_Op_Ref : Node_Id;
5107 -- Look for the subprogram in the list of primitive operations
5109 Elmt := First_Elmt (Primitive_Operations (Obj_Type));
5110 while Present (Elmt) loop
5111 Prim_Op := Node (Elmt);
5113 if Chars (Prim_Op) = Chars (Subprog)
5114 and then Present (First_Formal (Prim_Op))
5116 Prim_Op_Ref := New_Reference_To (Prim_Op, Loc);
5118 -- When both the type of the object and the type of the first
5119 -- formal of the primitive operation are tagged access types,
5120 -- we use a node with the object as first actual.
5122 if Is_Access_Type (Etype (Obj))
5123 and then Ekind (Etype (First_Formal (Prim_Op))) =
5124 E_Anonymous_Access_Type
5126 -- Allocate the node only once
5128 if not Present (Call_Node_Case) then
5129 Analyze_Expression (Obj);
5132 Transform_Object_Operation (
5133 Call_Node => Call_Node_Case,
5134 First_Actual => Obj,
5135 Node_To_Replace => Dummy,
5136 Subprog => Subprog);
5138 Set_Etype (Call_Node_Case, Any_Type);
5139 Set_Parent (Call_Node_Case, Parent (Node_To_Replace));
5142 Set_Name (Call_Node_Case, Prim_Op_Ref);
5145 N => Call_Node_Case,
5148 Success => Success);
5151 Complete_Object_Operation (
5152 Call_Node => Call_Node_Case,
5153 Node_To_Replace => Node_To_Replace,
5154 Subprog => Prim_Op_Ref);
5159 -- Comment required ???
5162 Set_Name (Call_Node, Prim_Op_Ref);
5168 Success => Success);
5171 Complete_Object_Operation (
5172 Call_Node => Call_Node,
5173 Node_To_Replace => Node_To_Replace,
5174 Subprog => Prim_Op_Ref);
5185 end Try_Primitive_Operation;
5187 -- Start of processing for Try_Object_Operation
5190 if Is_Access_Type (Obj_Type) then
5191 Obj_Type := Designated_Type (Obj_Type);
5194 if Ekind (Obj_Type) = E_Private_Subtype then
5195 Obj_Type := Base_Type (Obj_Type);
5198 if Is_Class_Wide_Type (Obj_Type) then
5199 Obj_Type := Etype (Class_Wide_Type (Obj_Type));
5202 -- Analyze the actuals in case of subprogram call
5204 if Is_Subprg_Call and then N = Name (Parent (N)) then
5205 Actual := First (Parameter_Associations (Parent (N)));
5206 while Present (Actual) loop
5207 Analyze_Expression (Actual);
5212 -- If the object is of an Access type, explicit dereference is
5215 if Is_Access_Type (Etype (Obj)) then
5217 Make_Explicit_Dereference (Sloc (Obj), Obj);
5218 Set_Etype (First_Actual, Obj_Type);
5220 First_Actual := Obj;
5223 Analyze_Expression (First_Actual);
5224 Set_Analyzed (First_Actual);
5226 -- Build a subprogram call node
5228 Transform_Object_Operation (
5229 Call_Node => Call_Node,
5230 First_Actual => First_Actual,
5231 Node_To_Replace => Node_To_Replace,
5232 Subprog => Subprog);
5234 Set_Etype (Call_Node, Any_Type);
5235 Set_Parent (Call_Node, Parent (Node_To_Replace));
5238 Try_Primitive_Operation
5239 (Call_Node => Call_Node,
5240 Node_To_Replace => Node_To_Replace)
5242 Try_Class_Wide_Operation
5243 (Call_Node => Call_Node,
5244 Node_To_Replace => Node_To_Replace);
5245 end Try_Object_Operation;