1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Checks; use Checks;
28 with Debug; use Debug;
29 with Einfo; use Einfo;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Expander; use Expander;
33 with Exp_Ch6; use Exp_Ch6;
34 with Exp_Ch7; use Exp_Ch7;
35 with Exp_Ch9; use Exp_Ch9;
36 with Exp_Disp; use Exp_Disp;
37 with Exp_Tss; use Exp_Tss;
38 with Exp_Util; use Exp_Util;
39 with Fname; use Fname;
40 with Freeze; use Freeze;
41 with Itypes; use Itypes;
42 with Lib.Xref; use Lib.Xref;
43 with Layout; use Layout;
44 with Namet; use Namet;
46 with Nlists; use Nlists;
47 with Nmake; use Nmake;
49 with Output; use Output;
50 with Restrict; use Restrict;
51 with Rident; use Rident;
52 with Rtsfind; use Rtsfind;
54 with Sem_Aux; use Sem_Aux;
55 with Sem_Cat; use Sem_Cat;
56 with Sem_Ch3; use Sem_Ch3;
57 with Sem_Ch4; use Sem_Ch4;
58 with Sem_Ch5; use Sem_Ch5;
59 with Sem_Ch8; use Sem_Ch8;
60 with Sem_Ch10; use Sem_Ch10;
61 with Sem_Ch12; use Sem_Ch12;
62 with Sem_Disp; use Sem_Disp;
63 with Sem_Dist; use Sem_Dist;
64 with Sem_Elim; use Sem_Elim;
65 with Sem_Eval; use Sem_Eval;
66 with Sem_Mech; use Sem_Mech;
67 with Sem_Prag; use Sem_Prag;
68 with Sem_Res; use Sem_Res;
69 with Sem_Util; use Sem_Util;
70 with Sem_Type; use Sem_Type;
71 with Sem_Warn; use Sem_Warn;
72 with Sinput; use Sinput;
73 with Stand; use Stand;
74 with Sinfo; use Sinfo;
75 with Sinfo.CN; use Sinfo.CN;
76 with Snames; use Snames;
77 with Stringt; use Stringt;
79 with Stylesw; use Stylesw;
80 with Tbuild; use Tbuild;
81 with Uintp; use Uintp;
82 with Urealp; use Urealp;
83 with Validsw; use Validsw;
85 package body Sem_Ch6 is
87 May_Hide_Profile : Boolean := False;
88 -- This flag is used to indicate that two formals in two subprograms being
89 -- checked for conformance differ only in that one is an access parameter
90 -- while the other is of a general access type with the same designated
91 -- type. In this case, if the rest of the signatures match, a call to
92 -- either subprogram may be ambiguous, which is worth a warning. The flag
93 -- is set in Compatible_Types, and the warning emitted in
94 -- New_Overloaded_Entity.
96 -----------------------
97 -- Local Subprograms --
98 -----------------------
100 procedure Analyze_Return_Statement (N : Node_Id);
101 -- Common processing for simple_ and extended_return_statements
103 procedure Analyze_Function_Return (N : Node_Id);
104 -- Subsidiary to Analyze_Return_Statement. Called when the return statement
105 -- applies to a [generic] function.
107 procedure Analyze_Return_Type (N : Node_Id);
108 -- Subsidiary to Process_Formals: analyze subtype mark in function
109 -- specification, in a context where the formals are visible and hide
112 procedure Analyze_Subprogram_Body_Helper (N : Node_Id);
113 -- Does all the real work of Analyze_Subprogram_Body
115 procedure Analyze_Generic_Subprogram_Body (N : Node_Id; Gen_Id : Entity_Id);
116 -- Analyze a generic subprogram body. N is the body to be analyzed, and
117 -- Gen_Id is the defining entity Id for the corresponding spec.
119 procedure Build_Body_To_Inline (N : Node_Id; Subp : Entity_Id);
120 -- If a subprogram has pragma Inline and inlining is active, use generic
121 -- machinery to build an unexpanded body for the subprogram. This body is
122 -- subsequently used for inline expansions at call sites. If subprogram can
123 -- be inlined (depending on size and nature of local declarations) this
124 -- function returns true. Otherwise subprogram body is treated normally.
125 -- If proper warnings are enabled and the subprogram contains a construct
126 -- that cannot be inlined, the offending construct is flagged accordingly.
128 procedure Check_Conformance
131 Ctype : Conformance_Type;
133 Conforms : out Boolean;
134 Err_Loc : Node_Id := Empty;
135 Get_Inst : Boolean := False;
136 Skip_Controlling_Formals : Boolean := False);
137 -- Given two entities, this procedure checks that the profiles associated
138 -- with these entities meet the conformance criterion given by the third
139 -- parameter. If they conform, Conforms is set True and control returns
140 -- to the caller. If they do not conform, Conforms is set to False, and
141 -- in addition, if Errmsg is True on the call, proper messages are output
142 -- to complain about the conformance failure. If Err_Loc is non_Empty
143 -- the error messages are placed on Err_Loc, if Err_Loc is empty, then
144 -- error messages are placed on the appropriate part of the construct
145 -- denoted by New_Id. If Get_Inst is true, then this is a mode conformance
146 -- against a formal access-to-subprogram type so Get_Instance_Of must
149 procedure Check_Subprogram_Order (N : Node_Id);
150 -- N is the N_Subprogram_Body node for a subprogram. This routine applies
151 -- the alpha ordering rule for N if this ordering requirement applicable.
153 procedure Check_Returns
157 Proc : Entity_Id := Empty);
158 -- Called to check for missing return statements in a function body, or for
159 -- returns present in a procedure body which has No_Return set. HSS is the
160 -- handled statement sequence for the subprogram body. This procedure
161 -- checks all flow paths to make sure they either have return (Mode = 'F',
162 -- used for functions) or do not have a return (Mode = 'P', used for
163 -- No_Return procedures). The flag Err is set if there are any control
164 -- paths not explicitly terminated by a return in the function case, and is
165 -- True otherwise. Proc is the entity for the procedure case and is used
166 -- in posting the warning message.
168 procedure Enter_Overloaded_Entity (S : Entity_Id);
169 -- This procedure makes S, a new overloaded entity, into the first visible
170 -- entity with that name.
172 procedure Install_Entity (E : Entity_Id);
173 -- Make single entity visible. Used for generic formals as well
175 function Is_Non_Overriding_Operation
177 New_E : Entity_Id) return Boolean;
178 -- Enforce the rule given in 12.3(18): a private operation in an instance
179 -- overrides an inherited operation only if the corresponding operation
180 -- was overriding in the generic. This can happen for primitive operations
181 -- of types derived (in the generic unit) from formal private or formal
184 procedure Make_Inequality_Operator (S : Entity_Id);
185 -- Create the declaration for an inequality operator that is implicitly
186 -- created by a user-defined equality operator that yields a boolean.
188 procedure May_Need_Actuals (Fun : Entity_Id);
189 -- Flag functions that can be called without parameters, i.e. those that
190 -- have no parameters, or those for which defaults exist for all parameters
192 procedure Process_PPCs
195 Body_Id : Entity_Id);
196 -- Called from Analyze[_Generic]_Subprogram_Body to deal with scanning post
197 -- conditions for the body and assembling and inserting the _postconditions
198 -- procedure. N is the node for the subprogram body and Body_Id/Spec_Id are
199 -- the entities for the body and separate spec (if there is no separate
200 -- spec, Spec_Id is Empty).
202 procedure Set_Formal_Validity (Formal_Id : Entity_Id);
203 -- Formal_Id is an formal parameter entity. This procedure deals with
204 -- setting the proper validity status for this entity, which depends on
205 -- the kind of parameter and the validity checking mode.
207 ------------------------------
208 -- Analyze_Return_Statement --
209 ------------------------------
211 procedure Analyze_Return_Statement (N : Node_Id) is
213 pragma Assert (Nkind_In (N, N_Simple_Return_Statement,
214 N_Extended_Return_Statement));
216 Returns_Object : constant Boolean :=
217 Nkind (N) = N_Extended_Return_Statement
219 (Nkind (N) = N_Simple_Return_Statement
220 and then Present (Expression (N)));
221 -- True if we're returning something; that is, "return <expression>;"
222 -- or "return Result : T [:= ...]". False for "return;". Used for error
223 -- checking: If Returns_Object is True, N should apply to a function
224 -- body; otherwise N should apply to a procedure body, entry body,
225 -- accept statement, or extended return statement.
227 function Find_What_It_Applies_To return Entity_Id;
228 -- Find the entity representing the innermost enclosing body, accept
229 -- statement, or extended return statement. If the result is a callable
230 -- construct or extended return statement, then this will be the value
231 -- of the Return_Applies_To attribute. Otherwise, the program is
232 -- illegal. See RM-6.5(4/2).
234 -----------------------------
235 -- Find_What_It_Applies_To --
236 -----------------------------
238 function Find_What_It_Applies_To return Entity_Id is
239 Result : Entity_Id := Empty;
242 -- Loop outward through the Scope_Stack, skipping blocks and loops
244 for J in reverse 0 .. Scope_Stack.Last loop
245 Result := Scope_Stack.Table (J).Entity;
246 exit when Ekind (Result) /= E_Block and then
247 Ekind (Result) /= E_Loop;
250 pragma Assert (Present (Result));
252 end Find_What_It_Applies_To;
254 -- Local declarations
256 Scope_Id : constant Entity_Id := Find_What_It_Applies_To;
257 Kind : constant Entity_Kind := Ekind (Scope_Id);
258 Loc : constant Source_Ptr := Sloc (N);
259 Stm_Entity : constant Entity_Id :=
261 (E_Return_Statement, Current_Scope, Loc, 'R');
263 -- Start of processing for Analyze_Return_Statement
266 Set_Return_Statement_Entity (N, Stm_Entity);
268 Set_Etype (Stm_Entity, Standard_Void_Type);
269 Set_Return_Applies_To (Stm_Entity, Scope_Id);
271 -- Place Return entity on scope stack, to simplify enforcement of 6.5
272 -- (4/2): an inner return statement will apply to this extended return.
274 if Nkind (N) = N_Extended_Return_Statement then
275 Push_Scope (Stm_Entity);
278 -- Check that pragma No_Return is obeyed. Don't complain about the
279 -- implicitly-generated return that is placed at the end.
281 if No_Return (Scope_Id) and then Comes_From_Source (N) then
282 Error_Msg_N ("RETURN statement not allowed (No_Return)", N);
285 -- Warn on any unassigned OUT parameters if in procedure
287 if Ekind (Scope_Id) = E_Procedure then
288 Warn_On_Unassigned_Out_Parameter (N, Scope_Id);
291 -- Check that functions return objects, and other things do not
293 if Kind = E_Function or else Kind = E_Generic_Function then
294 if not Returns_Object then
295 Error_Msg_N ("missing expression in return from function", N);
298 elsif Kind = E_Procedure or else Kind = E_Generic_Procedure then
299 if Returns_Object then
300 Error_Msg_N ("procedure cannot return value (use function)", N);
303 elsif Kind = E_Entry or else Kind = E_Entry_Family then
304 if Returns_Object then
305 if Is_Protected_Type (Scope (Scope_Id)) then
306 Error_Msg_N ("entry body cannot return value", N);
308 Error_Msg_N ("accept statement cannot return value", N);
312 elsif Kind = E_Return_Statement then
314 -- We are nested within another return statement, which must be an
315 -- extended_return_statement.
317 if Returns_Object then
319 ("extended_return_statement cannot return value; " &
320 "use `""RETURN;""`", N);
324 Error_Msg_N ("illegal context for return statement", N);
327 if Kind = E_Function or else Kind = E_Generic_Function then
328 Analyze_Function_Return (N);
331 if Nkind (N) = N_Extended_Return_Statement then
335 Kill_Current_Values (Last_Assignment_Only => True);
336 Check_Unreachable_Code (N);
337 end Analyze_Return_Statement;
339 ---------------------------------------------
340 -- Analyze_Abstract_Subprogram_Declaration --
341 ---------------------------------------------
343 procedure Analyze_Abstract_Subprogram_Declaration (N : Node_Id) is
344 Designator : constant Entity_Id :=
345 Analyze_Subprogram_Specification (Specification (N));
346 Scop : constant Entity_Id := Current_Scope;
349 Generate_Definition (Designator);
350 Set_Is_Abstract_Subprogram (Designator);
351 New_Overloaded_Entity (Designator);
352 Check_Delayed_Subprogram (Designator);
354 Set_Categorization_From_Scope (Designator, Scop);
356 if Ekind (Scope (Designator)) = E_Protected_Type then
358 ("abstract subprogram not allowed in protected type", N);
360 -- Issue a warning if the abstract subprogram is neither a dispatching
361 -- operation nor an operation that overrides an inherited subprogram or
362 -- predefined operator, since this most likely indicates a mistake.
364 elsif Warn_On_Redundant_Constructs
365 and then not Is_Dispatching_Operation (Designator)
366 and then not Is_Overriding_Operation (Designator)
367 and then (not Is_Operator_Symbol_Name (Chars (Designator))
368 or else Scop /= Scope (Etype (First_Formal (Designator))))
371 ("?abstract subprogram is not dispatching or overriding", N);
374 Generate_Reference_To_Formals (Designator);
375 Check_Eliminated (Designator);
376 end Analyze_Abstract_Subprogram_Declaration;
378 ----------------------------------------
379 -- Analyze_Extended_Return_Statement --
380 ----------------------------------------
382 procedure Analyze_Extended_Return_Statement (N : Node_Id) is
384 Analyze_Return_Statement (N);
385 end Analyze_Extended_Return_Statement;
387 ----------------------------
388 -- Analyze_Function_Call --
389 ----------------------------
391 procedure Analyze_Function_Call (N : Node_Id) is
392 P : constant Node_Id := Name (N);
393 L : constant List_Id := Parameter_Associations (N);
399 -- A call of the form A.B (X) may be an Ada05 call, which is rewritten
400 -- as B (A, X). If the rewriting is successful, the call has been
401 -- analyzed and we just return.
403 if Nkind (P) = N_Selected_Component
404 and then Name (N) /= P
405 and then Is_Rewrite_Substitution (N)
406 and then Present (Etype (N))
411 -- If error analyzing name, then set Any_Type as result type and return
413 if Etype (P) = Any_Type then
414 Set_Etype (N, Any_Type);
418 -- Otherwise analyze the parameters
422 while Present (Actual) loop
424 Check_Parameterless_Call (Actual);
430 end Analyze_Function_Call;
432 -----------------------------
433 -- Analyze_Function_Return --
434 -----------------------------
436 procedure Analyze_Function_Return (N : Node_Id) is
437 Loc : constant Source_Ptr := Sloc (N);
438 Stm_Entity : constant Entity_Id := Return_Statement_Entity (N);
439 Scope_Id : constant Entity_Id := Return_Applies_To (Stm_Entity);
441 R_Type : constant Entity_Id := Etype (Scope_Id);
442 -- Function result subtype
444 procedure Check_Limited_Return (Expr : Node_Id);
445 -- Check the appropriate (Ada 95 or Ada 2005) rules for returning
446 -- limited types. Used only for simple return statements.
447 -- Expr is the expression returned.
449 procedure Check_Return_Subtype_Indication (Obj_Decl : Node_Id);
450 -- Check that the return_subtype_indication properly matches the result
451 -- subtype of the function, as required by RM-6.5(5.1/2-5.3/2).
453 --------------------------
454 -- Check_Limited_Return --
455 --------------------------
457 procedure Check_Limited_Return (Expr : Node_Id) is
459 -- Ada 2005 (AI-318-02): Return-by-reference types have been
460 -- removed and replaced by anonymous access results. This is an
461 -- incompatibility with Ada 95. Not clear whether this should be
462 -- enforced yet or perhaps controllable with special switch. ???
464 if Is_Limited_Type (R_Type)
465 and then Comes_From_Source (N)
466 and then not In_Instance_Body
467 and then not OK_For_Limited_Init_In_05 (Expr)
471 if Ada_Version >= Ada_05
472 and then not Debug_Flag_Dot_L
473 and then not GNAT_Mode
476 ("(Ada 2005) cannot copy object of a limited type " &
477 "(RM-2005 6.5(5.5/2))", Expr);
478 if Is_Inherently_Limited_Type (R_Type) then
480 ("\return by reference not permitted in Ada 2005", Expr);
483 -- Warn in Ada 95 mode, to give folks a heads up about this
486 -- In GNAT mode, this is just a warning, to allow it to be
487 -- evilly turned off. Otherwise it is a real error.
489 elsif Warn_On_Ada_2005_Compatibility or GNAT_Mode then
490 if Is_Inherently_Limited_Type (R_Type) then
492 ("return by reference not permitted in Ada 2005 " &
493 "(RM-2005 6.5(5.5/2))?", Expr);
496 ("cannot copy object of a limited type in Ada 2005 " &
497 "(RM-2005 6.5(5.5/2))?", Expr);
500 -- Ada 95 mode, compatibility warnings disabled
503 return; -- skip continuation messages below
507 ("\consider switching to return of access type", Expr);
508 Explain_Limited_Type (R_Type, Expr);
510 end Check_Limited_Return;
512 -------------------------------------
513 -- Check_Return_Subtype_Indication --
514 -------------------------------------
516 procedure Check_Return_Subtype_Indication (Obj_Decl : Node_Id) is
517 Return_Obj : constant Node_Id := Defining_Identifier (Obj_Decl);
518 R_Stm_Type : constant Entity_Id := Etype (Return_Obj);
519 -- Subtype given in the extended return statement;
520 -- this must match R_Type.
522 Subtype_Ind : constant Node_Id :=
523 Object_Definition (Original_Node (Obj_Decl));
525 R_Type_Is_Anon_Access :
527 Ekind (R_Type) = E_Anonymous_Access_Subprogram_Type
529 Ekind (R_Type) = E_Anonymous_Access_Protected_Subprogram_Type
531 Ekind (R_Type) = E_Anonymous_Access_Type;
532 -- True if return type of the function is an anonymous access type
533 -- Can't we make Is_Anonymous_Access_Type in einfo ???
535 R_Stm_Type_Is_Anon_Access :
537 Ekind (R_Stm_Type) = E_Anonymous_Access_Subprogram_Type
539 Ekind (R_Stm_Type) = E_Anonymous_Access_Protected_Subprogram_Type
541 Ekind (R_Stm_Type) = E_Anonymous_Access_Type;
542 -- True if type of the return object is an anonymous access type
545 -- First, avoid cascade errors:
547 if Error_Posted (Obj_Decl) or else Error_Posted (Subtype_Ind) then
551 -- "return access T" case; check that the return statement also has
552 -- "access T", and that the subtypes statically match:
553 -- if this is an access to subprogram the signatures must match.
555 if R_Type_Is_Anon_Access then
556 if R_Stm_Type_Is_Anon_Access then
558 Ekind (Designated_Type (R_Stm_Type)) /= E_Subprogram_Type
560 if Base_Type (Designated_Type (R_Stm_Type)) /=
561 Base_Type (Designated_Type (R_Type))
562 or else not Subtypes_Statically_Match (R_Stm_Type, R_Type)
565 ("subtype must statically match function result subtype",
566 Subtype_Mark (Subtype_Ind));
570 -- For two anonymous access to subprogram types, the
571 -- types themselves must be type conformant.
573 if not Conforming_Types
574 (R_Stm_Type, R_Type, Fully_Conformant)
577 ("subtype must statically match function result subtype",
583 Error_Msg_N ("must use anonymous access type", Subtype_Ind);
586 -- Subtype indication case: check that the types are the same, and
587 -- statically match if appropriate. Also handle record types with
588 -- unknown discriminants for which we have built the underlying
591 elsif Base_Type (R_Stm_Type) = Base_Type (R_Type)
592 or else (Is_Underlying_Record_View (Base_Type (R_Stm_Type))
593 and then Underlying_Record_View (Base_Type (R_Stm_Type))
594 = Base_Type (R_Type))
596 -- A null exclusion may be present on the return type, on the
597 -- function specification, on the object declaration or on the
600 if Is_Access_Type (R_Type)
602 (Can_Never_Be_Null (R_Type)
603 or else Null_Exclusion_Present (Parent (Scope_Id))) /=
604 Can_Never_Be_Null (R_Stm_Type)
607 ("subtype must statically match function result subtype",
611 if Is_Constrained (R_Type) then
612 if not Subtypes_Statically_Match (R_Stm_Type, R_Type) then
614 ("subtype must statically match function result subtype",
619 -- If the function's result type doesn't match the return object
620 -- entity's type, then we check for the case where the result type
621 -- is class-wide, and allow the declaration if the type of the object
622 -- definition matches the class-wide type. This prevents rejection
623 -- in the case where the object declaration is initialized by a call
624 -- to a build-in-place function with a specific result type and the
625 -- object entity had its type changed to that specific type. This is
626 -- also allowed in the case where Obj_Decl does not come from source,
627 -- which can occur for an expansion of a simple return statement of
628 -- a build-in-place class-wide function when the result expression
629 -- has a specific type, because a return object with a specific type
630 -- is created. (Note that the ARG believes that return objects should
631 -- be allowed to have a type covered by a class-wide result type in
632 -- any case, so once that relaxation is made (see AI05-32), the above
633 -- check for type compatibility should be changed to test Covers
634 -- rather than equality, and the following special test will no
635 -- longer be needed. ???)
637 elsif Is_Class_Wide_Type (R_Type)
639 (R_Type = Etype (Object_Definition (Original_Node (Obj_Decl)))
640 or else not Comes_From_Source (Obj_Decl))
646 ("wrong type for return_subtype_indication", Subtype_Ind);
648 end Check_Return_Subtype_Indication;
650 ---------------------
651 -- Local Variables --
652 ---------------------
656 -- Start of processing for Analyze_Function_Return
659 Set_Return_Present (Scope_Id);
661 if Nkind (N) = N_Simple_Return_Statement then
662 Expr := Expression (N);
663 Analyze_And_Resolve (Expr, R_Type);
664 Check_Limited_Return (Expr);
667 -- Analyze parts specific to extended_return_statement:
670 Obj_Decl : constant Node_Id :=
671 Last (Return_Object_Declarations (N));
673 HSS : constant Node_Id := Handled_Statement_Sequence (N);
676 Expr := Expression (Obj_Decl);
678 -- Note: The check for OK_For_Limited_Init will happen in
679 -- Analyze_Object_Declaration; we treat it as a normal
680 -- object declaration.
682 Set_Is_Return_Object (Defining_Identifier (Obj_Decl));
685 Check_Return_Subtype_Indication (Obj_Decl);
687 if Present (HSS) then
690 if Present (Exception_Handlers (HSS)) then
692 -- ???Has_Nested_Block_With_Handler needs to be set.
693 -- Probably by creating an actual N_Block_Statement.
694 -- Probably in Expand.
700 Check_References (Stm_Entity);
704 -- Case of Expr present
708 -- Defend against previous errors
710 and then Nkind (Expr) /= N_Empty
711 and then Present (Etype (Expr))
713 -- Apply constraint check. Note that this is done before the implicit
714 -- conversion of the expression done for anonymous access types to
715 -- ensure correct generation of the null-excluding check associated
716 -- with null-excluding expressions found in return statements.
718 Apply_Constraint_Check (Expr, R_Type);
720 -- Ada 2005 (AI-318-02): When the result type is an anonymous access
721 -- type, apply an implicit conversion of the expression to that type
722 -- to force appropriate static and run-time accessibility checks.
724 if Ada_Version >= Ada_05
725 and then Ekind (R_Type) = E_Anonymous_Access_Type
727 Rewrite (Expr, Convert_To (R_Type, Relocate_Node (Expr)));
728 Analyze_And_Resolve (Expr, R_Type);
731 -- If the result type is class-wide, then check that the return
732 -- expression's type is not declared at a deeper level than the
733 -- function (RM05-6.5(5.6/2)).
735 if Ada_Version >= Ada_05
736 and then Is_Class_Wide_Type (R_Type)
738 if Type_Access_Level (Etype (Expr)) >
739 Subprogram_Access_Level (Scope_Id)
742 ("level of return expression type is deeper than " &
743 "class-wide function!", Expr);
747 if (Is_Class_Wide_Type (Etype (Expr))
748 or else Is_Dynamically_Tagged (Expr))
749 and then not Is_Class_Wide_Type (R_Type)
752 ("dynamically tagged expression not allowed!", Expr);
755 -- ??? A real run-time accessibility check is needed in cases
756 -- involving dereferences of access parameters. For now we just
757 -- check the static cases.
759 if (Ada_Version < Ada_05 or else Debug_Flag_Dot_L)
760 and then Is_Inherently_Limited_Type (Etype (Scope_Id))
761 and then Object_Access_Level (Expr) >
762 Subprogram_Access_Level (Scope_Id)
765 Make_Raise_Program_Error (Loc,
766 Reason => PE_Accessibility_Check_Failed));
770 ("cannot return a local value by reference?", N);
772 ("\& will be raised at run time?",
773 N, Standard_Program_Error);
777 and then Nkind (Parent (Scope_Id)) = N_Function_Specification
778 and then Null_Exclusion_Present (Parent (Scope_Id))
780 Apply_Compile_Time_Constraint_Error
782 Msg => "(Ada 2005) null not allowed for "
783 & "null-excluding return?",
784 Reason => CE_Null_Not_Allowed);
787 end Analyze_Function_Return;
789 -------------------------------------
790 -- Analyze_Generic_Subprogram_Body --
791 -------------------------------------
793 procedure Analyze_Generic_Subprogram_Body
797 Gen_Decl : constant Node_Id := Unit_Declaration_Node (Gen_Id);
798 Kind : constant Entity_Kind := Ekind (Gen_Id);
804 -- Copy body and disable expansion while analyzing the generic For a
805 -- stub, do not copy the stub (which would load the proper body), this
806 -- will be done when the proper body is analyzed.
808 if Nkind (N) /= N_Subprogram_Body_Stub then
809 New_N := Copy_Generic_Node (N, Empty, Instantiating => False);
814 Spec := Specification (N);
816 -- Within the body of the generic, the subprogram is callable, and
817 -- behaves like the corresponding non-generic unit.
819 Body_Id := Defining_Entity (Spec);
821 if Kind = E_Generic_Procedure
822 and then Nkind (Spec) /= N_Procedure_Specification
824 Error_Msg_N ("invalid body for generic procedure ", Body_Id);
827 elsif Kind = E_Generic_Function
828 and then Nkind (Spec) /= N_Function_Specification
830 Error_Msg_N ("invalid body for generic function ", Body_Id);
834 Set_Corresponding_Body (Gen_Decl, Body_Id);
836 if Has_Completion (Gen_Id)
837 and then Nkind (Parent (N)) /= N_Subunit
839 Error_Msg_N ("duplicate generic body", N);
842 Set_Has_Completion (Gen_Id);
845 if Nkind (N) = N_Subprogram_Body_Stub then
846 Set_Ekind (Defining_Entity (Specification (N)), Kind);
848 Set_Corresponding_Spec (N, Gen_Id);
851 if Nkind (Parent (N)) = N_Compilation_Unit then
852 Set_Cunit_Entity (Current_Sem_Unit, Defining_Entity (N));
855 -- Make generic parameters immediately visible in the body. They are
856 -- needed to process the formals declarations. Then make the formals
857 -- visible in a separate step.
863 First_Ent : Entity_Id;
866 First_Ent := First_Entity (Gen_Id);
869 while Present (E) and then not Is_Formal (E) loop
874 Set_Use (Generic_Formal_Declarations (Gen_Decl));
876 -- Now generic formals are visible, and the specification can be
877 -- analyzed, for subsequent conformance check.
879 Body_Id := Analyze_Subprogram_Specification (Spec);
881 -- Make formal parameters visible
885 -- E is the first formal parameter, we loop through the formals
886 -- installing them so that they will be visible.
888 Set_First_Entity (Gen_Id, E);
889 while Present (E) loop
895 -- Visible generic entity is callable within its own body
897 Set_Ekind (Gen_Id, Ekind (Body_Id));
898 Set_Ekind (Body_Id, E_Subprogram_Body);
899 Set_Convention (Body_Id, Convention (Gen_Id));
900 Set_Is_Obsolescent (Body_Id, Is_Obsolescent (Gen_Id));
901 Set_Scope (Body_Id, Scope (Gen_Id));
902 Check_Fully_Conformant (Body_Id, Gen_Id, Body_Id);
904 if Nkind (N) = N_Subprogram_Body_Stub then
906 -- No body to analyze, so restore state of generic unit
908 Set_Ekind (Gen_Id, Kind);
909 Set_Ekind (Body_Id, Kind);
911 if Present (First_Ent) then
912 Set_First_Entity (Gen_Id, First_Ent);
919 -- If this is a compilation unit, it must be made visible explicitly,
920 -- because the compilation of the declaration, unlike other library
921 -- unit declarations, does not. If it is not a unit, the following
922 -- is redundant but harmless.
924 Set_Is_Immediately_Visible (Gen_Id);
925 Reference_Body_Formals (Gen_Id, Body_Id);
927 if Is_Child_Unit (Gen_Id) then
928 Generate_Reference (Gen_Id, Scope (Gen_Id), 'k', False);
931 Set_Actual_Subtypes (N, Current_Scope);
932 Process_PPCs (N, Gen_Id, Body_Id);
934 -- If the generic unit carries pre- or post-conditions, copy them
935 -- to the original generic tree, so that they are properly added
936 -- to any instantiation.
939 Orig : constant Node_Id := Original_Node (N);
943 Cond := First (Declarations (N));
944 while Present (Cond) loop
945 if Nkind (Cond) = N_Pragma
946 and then Pragma_Name (Cond) = Name_Check
948 Prepend (New_Copy_Tree (Cond), Declarations (Orig));
950 elsif Nkind (Cond) = N_Pragma
951 and then Pragma_Name (Cond) = Name_Postcondition
953 Set_Ekind (Defining_Entity (Orig), Ekind (Gen_Id));
954 Prepend (New_Copy_Tree (Cond), Declarations (Orig));
963 Analyze_Declarations (Declarations (N));
965 Analyze (Handled_Statement_Sequence (N));
967 Save_Global_References (Original_Node (N));
969 -- Prior to exiting the scope, include generic formals again (if any
970 -- are present) in the set of local entities.
972 if Present (First_Ent) then
973 Set_First_Entity (Gen_Id, First_Ent);
976 Check_References (Gen_Id);
979 Process_End_Label (Handled_Statement_Sequence (N), 't', Current_Scope);
981 Check_Subprogram_Order (N);
983 -- Outside of its body, unit is generic again
985 Set_Ekind (Gen_Id, Kind);
986 Generate_Reference (Gen_Id, Body_Id, 'b', Set_Ref => False);
989 Style.Check_Identifier (Body_Id, Gen_Id);
992 end Analyze_Generic_Subprogram_Body;
994 -----------------------------
995 -- Analyze_Operator_Symbol --
996 -----------------------------
998 -- An operator symbol such as "+" or "and" may appear in context where the
999 -- literal denotes an entity name, such as "+"(x, y) or in context when it
1000 -- is just a string, as in (conjunction = "or"). In these cases the parser
1001 -- generates this node, and the semantics does the disambiguation. Other
1002 -- such case are actuals in an instantiation, the generic unit in an
1003 -- instantiation, and pragma arguments.
1005 procedure Analyze_Operator_Symbol (N : Node_Id) is
1006 Par : constant Node_Id := Parent (N);
1009 if (Nkind (Par) = N_Function_Call
1010 and then N = Name (Par))
1011 or else Nkind (Par) = N_Function_Instantiation
1012 or else (Nkind (Par) = N_Indexed_Component
1013 and then N = Prefix (Par))
1014 or else (Nkind (Par) = N_Pragma_Argument_Association
1015 and then not Is_Pragma_String_Literal (Par))
1016 or else Nkind (Par) = N_Subprogram_Renaming_Declaration
1017 or else (Nkind (Par) = N_Attribute_Reference
1018 and then Attribute_Name (Par) /= Name_Value)
1020 Find_Direct_Name (N);
1023 Change_Operator_Symbol_To_String_Literal (N);
1026 end Analyze_Operator_Symbol;
1028 -----------------------------------
1029 -- Analyze_Parameter_Association --
1030 -----------------------------------
1032 procedure Analyze_Parameter_Association (N : Node_Id) is
1034 Analyze (Explicit_Actual_Parameter (N));
1035 end Analyze_Parameter_Association;
1037 ----------------------------
1038 -- Analyze_Procedure_Call --
1039 ----------------------------
1041 procedure Analyze_Procedure_Call (N : Node_Id) is
1042 Loc : constant Source_Ptr := Sloc (N);
1043 P : constant Node_Id := Name (N);
1044 Actuals : constant List_Id := Parameter_Associations (N);
1048 procedure Analyze_Call_And_Resolve;
1049 -- Do Analyze and Resolve calls for procedure call
1051 ------------------------------
1052 -- Analyze_Call_And_Resolve --
1053 ------------------------------
1055 procedure Analyze_Call_And_Resolve is
1057 if Nkind (N) = N_Procedure_Call_Statement then
1059 Resolve (N, Standard_Void_Type);
1063 end Analyze_Call_And_Resolve;
1065 -- Start of processing for Analyze_Procedure_Call
1068 -- The syntactic construct: PREFIX ACTUAL_PARAMETER_PART can denote
1069 -- a procedure call or an entry call. The prefix may denote an access
1070 -- to subprogram type, in which case an implicit dereference applies.
1071 -- If the prefix is an indexed component (without implicit dereference)
1072 -- then the construct denotes a call to a member of an entire family.
1073 -- If the prefix is a simple name, it may still denote a call to a
1074 -- parameterless member of an entry family. Resolution of these various
1075 -- interpretations is delicate.
1079 -- If this is a call of the form Obj.Op, the call may have been
1080 -- analyzed and possibly rewritten into a block, in which case
1083 if Analyzed (N) then
1087 -- If error analyzing prefix, then set Any_Type as result and return
1089 if Etype (P) = Any_Type then
1090 Set_Etype (N, Any_Type);
1094 -- Otherwise analyze the parameters
1096 if Present (Actuals) then
1097 Actual := First (Actuals);
1099 while Present (Actual) loop
1101 Check_Parameterless_Call (Actual);
1106 -- Special processing for Elab_Spec and Elab_Body calls
1108 if Nkind (P) = N_Attribute_Reference
1109 and then (Attribute_Name (P) = Name_Elab_Spec
1110 or else Attribute_Name (P) = Name_Elab_Body)
1112 if Present (Actuals) then
1114 ("no parameters allowed for this call", First (Actuals));
1118 Set_Etype (N, Standard_Void_Type);
1121 elsif Is_Entity_Name (P)
1122 and then Is_Record_Type (Etype (Entity (P)))
1123 and then Remote_AST_I_Dereference (P)
1127 elsif Is_Entity_Name (P)
1128 and then Ekind (Entity (P)) /= E_Entry_Family
1130 if Is_Access_Type (Etype (P))
1131 and then Ekind (Designated_Type (Etype (P))) = E_Subprogram_Type
1132 and then No (Actuals)
1133 and then Comes_From_Source (N)
1135 Error_Msg_N ("missing explicit dereference in call", N);
1138 Analyze_Call_And_Resolve;
1140 -- If the prefix is the simple name of an entry family, this is
1141 -- a parameterless call from within the task body itself.
1143 elsif Is_Entity_Name (P)
1144 and then Nkind (P) = N_Identifier
1145 and then Ekind (Entity (P)) = E_Entry_Family
1146 and then Present (Actuals)
1147 and then No (Next (First (Actuals)))
1149 -- Can be call to parameterless entry family. What appears to be the
1150 -- sole argument is in fact the entry index. Rewrite prefix of node
1151 -- accordingly. Source representation is unchanged by this
1155 Make_Indexed_Component (Loc,
1157 Make_Selected_Component (Loc,
1158 Prefix => New_Occurrence_Of (Scope (Entity (P)), Loc),
1159 Selector_Name => New_Occurrence_Of (Entity (P), Loc)),
1160 Expressions => Actuals);
1161 Set_Name (N, New_N);
1162 Set_Etype (New_N, Standard_Void_Type);
1163 Set_Parameter_Associations (N, No_List);
1164 Analyze_Call_And_Resolve;
1166 elsif Nkind (P) = N_Explicit_Dereference then
1167 if Ekind (Etype (P)) = E_Subprogram_Type then
1168 Analyze_Call_And_Resolve;
1170 Error_Msg_N ("expect access to procedure in call", P);
1173 -- The name can be a selected component or an indexed component that
1174 -- yields an access to subprogram. Such a prefix is legal if the call
1175 -- has parameter associations.
1177 elsif Is_Access_Type (Etype (P))
1178 and then Ekind (Designated_Type (Etype (P))) = E_Subprogram_Type
1180 if Present (Actuals) then
1181 Analyze_Call_And_Resolve;
1183 Error_Msg_N ("missing explicit dereference in call ", N);
1186 -- If not an access to subprogram, then the prefix must resolve to the
1187 -- name of an entry, entry family, or protected operation.
1189 -- For the case of a simple entry call, P is a selected component where
1190 -- the prefix is the task and the selector name is the entry. A call to
1191 -- a protected procedure will have the same syntax. If the protected
1192 -- object contains overloaded operations, the entity may appear as a
1193 -- function, the context will select the operation whose type is Void.
1195 elsif Nkind (P) = N_Selected_Component
1196 and then (Ekind (Entity (Selector_Name (P))) = E_Entry
1198 Ekind (Entity (Selector_Name (P))) = E_Procedure
1200 Ekind (Entity (Selector_Name (P))) = E_Function)
1202 Analyze_Call_And_Resolve;
1204 elsif Nkind (P) = N_Selected_Component
1205 and then Ekind (Entity (Selector_Name (P))) = E_Entry_Family
1206 and then Present (Actuals)
1207 and then No (Next (First (Actuals)))
1209 -- Can be call to parameterless entry family. What appears to be the
1210 -- sole argument is in fact the entry index. Rewrite prefix of node
1211 -- accordingly. Source representation is unchanged by this
1215 Make_Indexed_Component (Loc,
1216 Prefix => New_Copy (P),
1217 Expressions => Actuals);
1218 Set_Name (N, New_N);
1219 Set_Etype (New_N, Standard_Void_Type);
1220 Set_Parameter_Associations (N, No_List);
1221 Analyze_Call_And_Resolve;
1223 -- For the case of a reference to an element of an entry family, P is
1224 -- an indexed component whose prefix is a selected component (task and
1225 -- entry family), and whose index is the entry family index.
1227 elsif Nkind (P) = N_Indexed_Component
1228 and then Nkind (Prefix (P)) = N_Selected_Component
1229 and then Ekind (Entity (Selector_Name (Prefix (P)))) = E_Entry_Family
1231 Analyze_Call_And_Resolve;
1233 -- If the prefix is the name of an entry family, it is a call from
1234 -- within the task body itself.
1236 elsif Nkind (P) = N_Indexed_Component
1237 and then Nkind (Prefix (P)) = N_Identifier
1238 and then Ekind (Entity (Prefix (P))) = E_Entry_Family
1241 Make_Selected_Component (Loc,
1242 Prefix => New_Occurrence_Of (Scope (Entity (Prefix (P))), Loc),
1243 Selector_Name => New_Occurrence_Of (Entity (Prefix (P)), Loc));
1244 Rewrite (Prefix (P), New_N);
1246 Analyze_Call_And_Resolve;
1248 -- Anything else is an error
1251 Error_Msg_N ("invalid procedure or entry call", N);
1253 end Analyze_Procedure_Call;
1255 -------------------------------------
1256 -- Analyze_Simple_Return_Statement --
1257 -------------------------------------
1259 procedure Analyze_Simple_Return_Statement (N : Node_Id) is
1261 if Present (Expression (N)) then
1262 Mark_Coextensions (N, Expression (N));
1265 Analyze_Return_Statement (N);
1266 end Analyze_Simple_Return_Statement;
1268 -------------------------
1269 -- Analyze_Return_Type --
1270 -------------------------
1272 procedure Analyze_Return_Type (N : Node_Id) is
1273 Designator : constant Entity_Id := Defining_Entity (N);
1274 Typ : Entity_Id := Empty;
1277 -- Normal case where result definition does not indicate an error
1279 if Result_Definition (N) /= Error then
1280 if Nkind (Result_Definition (N)) = N_Access_Definition then
1282 -- Ada 2005 (AI-254): Handle anonymous access to subprograms
1285 AD : constant Node_Id :=
1286 Access_To_Subprogram_Definition (Result_Definition (N));
1288 if Present (AD) and then Protected_Present (AD) then
1289 Typ := Replace_Anonymous_Access_To_Protected_Subprogram (N);
1291 Typ := Access_Definition (N, Result_Definition (N));
1295 Set_Parent (Typ, Result_Definition (N));
1296 Set_Is_Local_Anonymous_Access (Typ);
1297 Set_Etype (Designator, Typ);
1299 -- Ada 2005 (AI-231): Ensure proper usage of null exclusion
1301 Null_Exclusion_Static_Checks (N);
1303 -- Subtype_Mark case
1306 Find_Type (Result_Definition (N));
1307 Typ := Entity (Result_Definition (N));
1308 Set_Etype (Designator, Typ);
1310 -- Ada 2005 (AI-231): Ensure proper usage of null exclusion
1312 Null_Exclusion_Static_Checks (N);
1314 -- If a null exclusion is imposed on the result type, then create
1315 -- a null-excluding itype (an access subtype) and use it as the
1316 -- function's Etype. Note that the null exclusion checks are done
1317 -- right before this, because they don't get applied to types that
1318 -- do not come from source.
1320 if Is_Access_Type (Typ)
1321 and then Null_Exclusion_Present (N)
1323 Set_Etype (Designator,
1324 Create_Null_Excluding_Itype
1327 Scope_Id => Scope (Current_Scope)));
1329 Set_Etype (Designator, Typ);
1332 if Ekind (Typ) = E_Incomplete_Type
1333 and then Is_Value_Type (Typ)
1337 elsif Ekind (Typ) = E_Incomplete_Type
1338 or else (Is_Class_Wide_Type (Typ)
1340 Ekind (Root_Type (Typ)) = E_Incomplete_Type)
1343 ("invalid use of incomplete type&", Designator, Typ);
1347 -- Case where result definition does indicate an error
1350 Set_Etype (Designator, Any_Type);
1352 end Analyze_Return_Type;
1354 -----------------------------
1355 -- Analyze_Subprogram_Body --
1356 -----------------------------
1358 procedure Analyze_Subprogram_Body (N : Node_Id) is
1359 Loc : constant Source_Ptr := Sloc (N);
1360 Body_Spec : constant Node_Id := Specification (N);
1361 Body_Id : constant Entity_Id := Defining_Entity (Body_Spec);
1364 if Debug_Flag_C then
1365 Write_Str ("==> subprogram body ");
1366 Write_Name (Chars (Body_Id));
1367 Write_Str (" from ");
1368 Write_Location (Loc);
1373 Trace_Scope (N, Body_Id, " Analyze subprogram: ");
1375 -- The real work is split out into the helper, so it can do "return;"
1376 -- without skipping the debug output:
1378 Analyze_Subprogram_Body_Helper (N);
1380 if Debug_Flag_C then
1382 Write_Str ("<== subprogram body ");
1383 Write_Name (Chars (Body_Id));
1384 Write_Str (" from ");
1385 Write_Location (Loc);
1388 end Analyze_Subprogram_Body;
1390 ------------------------------------
1391 -- Analyze_Subprogram_Body_Helper --
1392 ------------------------------------
1394 -- This procedure is called for regular subprogram bodies, generic bodies,
1395 -- and for subprogram stubs of both kinds. In the case of stubs, only the
1396 -- specification matters, and is used to create a proper declaration for
1397 -- the subprogram, or to perform conformance checks.
1399 procedure Analyze_Subprogram_Body_Helper (N : Node_Id) is
1400 Loc : constant Source_Ptr := Sloc (N);
1401 Body_Deleted : constant Boolean := False;
1402 Body_Spec : constant Node_Id := Specification (N);
1403 Body_Id : Entity_Id := Defining_Entity (Body_Spec);
1404 Prev_Id : constant Entity_Id := Current_Entity_In_Scope (Body_Id);
1405 Conformant : Boolean;
1407 Missing_Ret : Boolean;
1409 Prot_Typ : Entity_Id := Empty;
1410 Spec_Id : Entity_Id;
1411 Spec_Decl : Node_Id := Empty;
1413 Last_Real_Spec_Entity : Entity_Id := Empty;
1414 -- When we analyze a separate spec, the entity chain ends up containing
1415 -- the formals, as well as any itypes generated during analysis of the
1416 -- default expressions for parameters, or the arguments of associated
1417 -- precondition/postcondition pragmas (which are analyzed in the context
1418 -- of the spec since they have visibility on formals).
1420 -- These entities belong with the spec and not the body. However we do
1421 -- the analysis of the body in the context of the spec (again to obtain
1422 -- visibility to the formals), and all the entities generated during
1423 -- this analysis end up also chained to the entity chain of the spec.
1424 -- But they really belong to the body, and there is circuitry to move
1425 -- them from the spec to the body.
1427 -- However, when we do this move, we don't want to move the real spec
1428 -- entities (first para above) to the body. The Last_Real_Spec_Entity
1429 -- variable points to the last real spec entity, so we only move those
1430 -- chained beyond that point. It is initialized to Empty to deal with
1431 -- the case where there is no separate spec.
1433 procedure Check_Anonymous_Return;
1434 -- Ada 2005: if a function returns an access type that denotes a task,
1435 -- or a type that contains tasks, we must create a master entity for
1436 -- the anonymous type, which typically will be used in an allocator
1437 -- in the body of the function.
1439 procedure Check_Inline_Pragma (Spec : in out Node_Id);
1440 -- Look ahead to recognize a pragma that may appear after the body.
1441 -- If there is a previous spec, check that it appears in the same
1442 -- declarative part. If the pragma is Inline_Always, perform inlining
1443 -- unconditionally, otherwise only if Front_End_Inlining is requested.
1444 -- If the body acts as a spec, and inlining is required, we create a
1445 -- subprogram declaration for it, in order to attach the body to inline.
1446 -- If pragma does not appear after the body, check whether there is
1447 -- an inline pragma before any local declarations.
1449 function Disambiguate_Spec return Entity_Id;
1450 -- When a primitive is declared between the private view and the full
1451 -- view of a concurrent type which implements an interface, a special
1452 -- mechanism is used to find the corresponding spec of the primitive
1455 function Is_Private_Concurrent_Primitive
1456 (Subp_Id : Entity_Id) return Boolean;
1457 -- Determine whether subprogram Subp_Id is a primitive of a concurrent
1458 -- type that implements an interface and has a private view.
1460 procedure Set_Trivial_Subprogram (N : Node_Id);
1461 -- Sets the Is_Trivial_Subprogram flag in both spec and body of the
1462 -- subprogram whose body is being analyzed. N is the statement node
1463 -- causing the flag to be set, if the following statement is a return
1464 -- of an entity, we mark the entity as set in source to suppress any
1465 -- warning on the stylized use of function stubs with a dummy return.
1467 procedure Verify_Overriding_Indicator;
1468 -- If there was a previous spec, the entity has been entered in the
1469 -- current scope previously. If the body itself carries an overriding
1470 -- indicator, check that it is consistent with the known status of the
1473 ----------------------------
1474 -- Check_Anonymous_Return --
1475 ----------------------------
1477 procedure Check_Anonymous_Return is
1483 if Present (Spec_Id) then
1489 if Ekind (Scop) = E_Function
1490 and then Ekind (Etype (Scop)) = E_Anonymous_Access_Type
1491 and then not Is_Thunk (Scop)
1492 and then (Has_Task (Designated_Type (Etype (Scop)))
1494 (Is_Class_Wide_Type (Designated_Type (Etype (Scop)))
1496 Is_Limited_Record (Designated_Type (Etype (Scop)))))
1497 and then Expander_Active
1499 -- Avoid cases with no tasking support
1501 and then RTE_Available (RE_Current_Master)
1502 and then not Restriction_Active (No_Task_Hierarchy)
1505 Make_Object_Declaration (Loc,
1506 Defining_Identifier =>
1507 Make_Defining_Identifier (Loc, Name_uMaster),
1508 Constant_Present => True,
1509 Object_Definition =>
1510 New_Reference_To (RTE (RE_Master_Id), Loc),
1512 Make_Explicit_Dereference (Loc,
1513 New_Reference_To (RTE (RE_Current_Master), Loc)));
1515 if Present (Declarations (N)) then
1516 Prepend (Decl, Declarations (N));
1518 Set_Declarations (N, New_List (Decl));
1521 Set_Master_Id (Etype (Scop), Defining_Identifier (Decl));
1522 Set_Has_Master_Entity (Scop);
1524 -- Now mark the containing scope as a task master
1527 while Nkind (Par) /= N_Compilation_Unit loop
1528 Par := Parent (Par);
1529 pragma Assert (Present (Par));
1531 -- If we fall off the top, we are at the outer level, and
1532 -- the environment task is our effective master, so nothing
1536 (Par, N_Task_Body, N_Block_Statement, N_Subprogram_Body)
1538 Set_Is_Task_Master (Par, True);
1543 end Check_Anonymous_Return;
1545 -------------------------
1546 -- Check_Inline_Pragma --
1547 -------------------------
1549 procedure Check_Inline_Pragma (Spec : in out Node_Id) is
1553 function Is_Inline_Pragma (N : Node_Id) return Boolean;
1554 -- True when N is a pragma Inline or Inline_Always that applies
1555 -- to this subprogram.
1557 -----------------------
1558 -- Is_Inline_Pragma --
1559 -----------------------
1561 function Is_Inline_Pragma (N : Node_Id) return Boolean is
1564 Nkind (N) = N_Pragma
1566 (Pragma_Name (N) = Name_Inline_Always
1569 and then Pragma_Name (N) = Name_Inline))
1572 (Expression (First (Pragma_Argument_Associations (N))))
1574 end Is_Inline_Pragma;
1576 -- Start of processing for Check_Inline_Pragma
1579 if not Expander_Active then
1583 if Is_List_Member (N)
1584 and then Present (Next (N))
1585 and then Is_Inline_Pragma (Next (N))
1589 elsif Nkind (N) /= N_Subprogram_Body_Stub
1590 and then Present (Declarations (N))
1591 and then Is_Inline_Pragma (First (Declarations (N)))
1593 Prag := First (Declarations (N));
1599 if Present (Prag) then
1600 if Present (Spec_Id) then
1601 if List_Containing (N) =
1602 List_Containing (Unit_Declaration_Node (Spec_Id))
1608 -- Create a subprogram declaration, to make treatment uniform
1611 Subp : constant Entity_Id :=
1612 Make_Defining_Identifier (Loc, Chars (Body_Id));
1613 Decl : constant Node_Id :=
1614 Make_Subprogram_Declaration (Loc,
1615 Specification => New_Copy_Tree (Specification (N)));
1617 Set_Defining_Unit_Name (Specification (Decl), Subp);
1619 if Present (First_Formal (Body_Id)) then
1620 Plist := Copy_Parameter_List (Body_Id);
1621 Set_Parameter_Specifications
1622 (Specification (Decl), Plist);
1625 Insert_Before (N, Decl);
1628 Set_Has_Pragma_Inline (Subp);
1630 if Pragma_Name (Prag) = Name_Inline_Always then
1631 Set_Is_Inlined (Subp);
1632 Set_Has_Pragma_Inline_Always (Subp);
1639 end Check_Inline_Pragma;
1641 -----------------------
1642 -- Disambiguate_Spec --
1643 -----------------------
1645 function Disambiguate_Spec return Entity_Id is
1646 Priv_Spec : Entity_Id;
1649 procedure Replace_Types (To_Corresponding : Boolean);
1650 -- Depending on the flag, replace the type of formal parameters of
1651 -- Body_Id if it is a concurrent type implementing interfaces with
1652 -- the corresponding record type or the other way around.
1654 procedure Replace_Types (To_Corresponding : Boolean) is
1656 Formal_Typ : Entity_Id;
1659 Formal := First_Formal (Body_Id);
1660 while Present (Formal) loop
1661 Formal_Typ := Etype (Formal);
1663 -- From concurrent type to corresponding record
1665 if To_Corresponding then
1666 if Is_Concurrent_Type (Formal_Typ)
1667 and then Present (Corresponding_Record_Type (Formal_Typ))
1668 and then Present (Interfaces (
1669 Corresponding_Record_Type (Formal_Typ)))
1672 Corresponding_Record_Type (Formal_Typ));
1675 -- From corresponding record to concurrent type
1678 if Is_Concurrent_Record_Type (Formal_Typ)
1679 and then Present (Interfaces (Formal_Typ))
1682 Corresponding_Concurrent_Type (Formal_Typ));
1686 Next_Formal (Formal);
1690 -- Start of processing for Disambiguate_Spec
1693 -- Try to retrieve the specification of the body as is. All error
1694 -- messages are suppressed because the body may not have a spec in
1695 -- its current state.
1697 Spec_N := Find_Corresponding_Spec (N, False);
1699 -- It is possible that this is the body of a primitive declared
1700 -- between a private and a full view of a concurrent type. The
1701 -- controlling parameter of the spec carries the concurrent type,
1702 -- not the corresponding record type as transformed by Analyze_
1703 -- Subprogram_Specification. In such cases, we undo the change
1704 -- made by the analysis of the specification and try to find the
1707 -- Note that wrappers already have their corresponding specs and
1708 -- bodies set during their creation, so if the candidate spec is
1709 -- a wrapper, then we definitely need to swap all types to their
1710 -- original concurrent status.
1713 or else Is_Primitive_Wrapper (Spec_N)
1715 -- Restore all references of corresponding record types to the
1716 -- original concurrent types.
1718 Replace_Types (To_Corresponding => False);
1719 Priv_Spec := Find_Corresponding_Spec (N, False);
1721 -- The current body truly belongs to a primitive declared between
1722 -- a private and a full view. We leave the modified body as is,
1723 -- and return the true spec.
1725 if Present (Priv_Spec)
1726 and then Is_Private_Primitive (Priv_Spec)
1731 -- In case that this is some sort of error, restore the original
1732 -- state of the body.
1734 Replace_Types (To_Corresponding => True);
1738 end Disambiguate_Spec;
1740 -------------------------------------
1741 -- Is_Private_Concurrent_Primitive --
1742 -------------------------------------
1744 function Is_Private_Concurrent_Primitive
1745 (Subp_Id : Entity_Id) return Boolean
1747 Formal_Typ : Entity_Id;
1750 if Present (First_Formal (Subp_Id)) then
1751 Formal_Typ := Etype (First_Formal (Subp_Id));
1753 if Is_Concurrent_Record_Type (Formal_Typ) then
1754 Formal_Typ := Corresponding_Concurrent_Type (Formal_Typ);
1757 -- The type of the first formal is a concurrent tagged type with
1761 Is_Concurrent_Type (Formal_Typ)
1762 and then Is_Tagged_Type (Formal_Typ)
1763 and then Has_Private_Declaration (Formal_Typ);
1767 end Is_Private_Concurrent_Primitive;
1769 ----------------------------
1770 -- Set_Trivial_Subprogram --
1771 ----------------------------
1773 procedure Set_Trivial_Subprogram (N : Node_Id) is
1774 Nxt : constant Node_Id := Next (N);
1777 Set_Is_Trivial_Subprogram (Body_Id);
1779 if Present (Spec_Id) then
1780 Set_Is_Trivial_Subprogram (Spec_Id);
1784 and then Nkind (Nxt) = N_Simple_Return_Statement
1785 and then No (Next (Nxt))
1786 and then Present (Expression (Nxt))
1787 and then Is_Entity_Name (Expression (Nxt))
1789 Set_Never_Set_In_Source (Entity (Expression (Nxt)), False);
1791 end Set_Trivial_Subprogram;
1793 ---------------------------------
1794 -- Verify_Overriding_Indicator --
1795 ---------------------------------
1797 procedure Verify_Overriding_Indicator is
1799 if Must_Override (Body_Spec) then
1800 if Nkind (Spec_Id) = N_Defining_Operator_Symbol
1801 and then Operator_Matches_Spec (Spec_Id, Spec_Id)
1805 elsif not Is_Overriding_Operation (Spec_Id) then
1807 ("subprogram& is not overriding", Body_Spec, Spec_Id);
1810 elsif Must_Not_Override (Body_Spec) then
1811 if Is_Overriding_Operation (Spec_Id) then
1813 ("subprogram& overrides inherited operation",
1814 Body_Spec, Spec_Id);
1816 elsif Nkind (Spec_Id) = N_Defining_Operator_Symbol
1817 and then Operator_Matches_Spec (Spec_Id, Spec_Id)
1820 ("subprogram & overrides predefined operator ",
1821 Body_Spec, Spec_Id);
1823 -- If this is not a primitive operation or protected subprogram,
1824 -- then the overriding indicator is altogether illegal.
1826 elsif not Is_Primitive (Spec_Id)
1827 and then Ekind (Scope (Spec_Id)) /= E_Protected_Type
1829 Error_Msg_N ("overriding indicator only allowed " &
1830 "if subprogram is primitive",
1835 and then Is_Overriding_Operation (Spec_Id)
1837 pragma Assert (Unit_Declaration_Node (Body_Id) = N);
1838 Style.Missing_Overriding (N, Body_Id);
1840 end Verify_Overriding_Indicator;
1842 -- Start of processing for Analyze_Subprogram_Body_Helper
1845 -- Generic subprograms are handled separately. They always have a
1846 -- generic specification. Determine whether current scope has a
1847 -- previous declaration.
1849 -- If the subprogram body is defined within an instance of the same
1850 -- name, the instance appears as a package renaming, and will be hidden
1851 -- within the subprogram.
1853 if Present (Prev_Id)
1854 and then not Is_Overloadable (Prev_Id)
1855 and then (Nkind (Parent (Prev_Id)) /= N_Package_Renaming_Declaration
1856 or else Comes_From_Source (Prev_Id))
1858 if Is_Generic_Subprogram (Prev_Id) then
1860 Set_Is_Compilation_Unit (Body_Id, Is_Compilation_Unit (Spec_Id));
1861 Set_Is_Child_Unit (Body_Id, Is_Child_Unit (Spec_Id));
1863 Analyze_Generic_Subprogram_Body (N, Spec_Id);
1867 -- Previous entity conflicts with subprogram name. Attempting to
1868 -- enter name will post error.
1870 Enter_Name (Body_Id);
1874 -- Non-generic case, find the subprogram declaration, if one was seen,
1875 -- or enter new overloaded entity in the current scope. If the
1876 -- Current_Entity is the Body_Id itself, the unit is being analyzed as
1877 -- part of the context of one of its subunits. No need to redo the
1880 elsif Prev_Id = Body_Id
1881 and then Has_Completion (Body_Id)
1886 Body_Id := Analyze_Subprogram_Specification (Body_Spec);
1888 if Nkind (N) = N_Subprogram_Body_Stub
1889 or else No (Corresponding_Spec (N))
1891 if Is_Private_Concurrent_Primitive (Body_Id) then
1892 Spec_Id := Disambiguate_Spec;
1894 Spec_Id := Find_Corresponding_Spec (N);
1897 -- If this is a duplicate body, no point in analyzing it
1899 if Error_Posted (N) then
1903 -- A subprogram body should cause freezing of its own declaration,
1904 -- but if there was no previous explicit declaration, then the
1905 -- subprogram will get frozen too late (there may be code within
1906 -- the body that depends on the subprogram having been frozen,
1907 -- such as uses of extra formals), so we force it to be frozen
1908 -- here. Same holds if the body and spec are compilation units.
1909 -- Finally, if the return type is an anonymous access to protected
1910 -- subprogram, it must be frozen before the body because its
1911 -- expansion has generated an equivalent type that is used when
1912 -- elaborating the body.
1914 if No (Spec_Id) then
1915 Freeze_Before (N, Body_Id);
1917 elsif Nkind (Parent (N)) = N_Compilation_Unit then
1918 Freeze_Before (N, Spec_Id);
1920 elsif Is_Access_Subprogram_Type (Etype (Body_Id)) then
1921 Freeze_Before (N, Etype (Body_Id));
1925 Spec_Id := Corresponding_Spec (N);
1929 -- Do not inline any subprogram that contains nested subprograms, since
1930 -- the backend inlining circuit seems to generate uninitialized
1931 -- references in this case. We know this happens in the case of front
1932 -- end ZCX support, but it also appears it can happen in other cases as
1933 -- well. The backend often rejects attempts to inline in the case of
1934 -- nested procedures anyway, so little if anything is lost by this.
1935 -- Note that this is test is for the benefit of the back-end. There is
1936 -- a separate test for front-end inlining that also rejects nested
1939 -- Do not do this test if errors have been detected, because in some
1940 -- error cases, this code blows up, and we don't need it anyway if
1941 -- there have been errors, since we won't get to the linker anyway.
1943 if Comes_From_Source (Body_Id)
1944 and then Serious_Errors_Detected = 0
1948 P_Ent := Scope (P_Ent);
1949 exit when No (P_Ent) or else P_Ent = Standard_Standard;
1951 if Is_Subprogram (P_Ent) then
1952 Set_Is_Inlined (P_Ent, False);
1954 if Comes_From_Source (P_Ent)
1955 and then Has_Pragma_Inline (P_Ent)
1958 ("cannot inline& (nested subprogram)?",
1965 Check_Inline_Pragma (Spec_Id);
1967 -- Deal with special case of a fully private operation in the body of
1968 -- the protected type. We must create a declaration for the subprogram,
1969 -- in order to attach the protected subprogram that will be used in
1970 -- internal calls. We exclude compiler generated bodies from the
1971 -- expander since the issue does not arise for those cases.
1974 and then Comes_From_Source (N)
1975 and then Is_Protected_Type (Current_Scope)
1984 Formal := First_Formal (Body_Id);
1986 -- The protected operation always has at least one formal, namely
1987 -- the object itself, but it is only placed in the parameter list
1988 -- if expansion is enabled.
1991 or else Expander_Active
1993 Plist := Copy_Parameter_List (Body_Id);
1998 if Nkind (Body_Spec) = N_Procedure_Specification then
2000 Make_Procedure_Specification (Loc,
2001 Defining_Unit_Name =>
2002 Make_Defining_Identifier (Sloc (Body_Id),
2003 Chars => Chars (Body_Id)),
2004 Parameter_Specifications => Plist);
2007 Make_Function_Specification (Loc,
2008 Defining_Unit_Name =>
2009 Make_Defining_Identifier (Sloc (Body_Id),
2010 Chars => Chars (Body_Id)),
2011 Parameter_Specifications => Plist,
2012 Result_Definition =>
2013 New_Occurrence_Of (Etype (Body_Id), Loc));
2017 Make_Subprogram_Declaration (Loc,
2018 Specification => New_Spec);
2019 Insert_Before (N, Decl);
2020 Spec_Id := Defining_Unit_Name (New_Spec);
2022 -- Indicate that the entity comes from source, to ensure that
2023 -- cross-reference information is properly generated. The body
2024 -- itself is rewritten during expansion, and the body entity will
2025 -- not appear in calls to the operation.
2027 Set_Comes_From_Source (Spec_Id, True);
2029 Set_Has_Completion (Spec_Id);
2030 Set_Convention (Spec_Id, Convention_Protected);
2034 -- If a separate spec is present, then deal with freezing issues
2036 if Present (Spec_Id) then
2037 Spec_Decl := Unit_Declaration_Node (Spec_Id);
2038 Verify_Overriding_Indicator;
2040 -- In general, the spec will be frozen when we start analyzing the
2041 -- body. However, for internally generated operations, such as
2042 -- wrapper functions for inherited operations with controlling
2043 -- results, the spec may not have been frozen by the time we
2044 -- expand the freeze actions that include the bodies. In particular,
2045 -- extra formals for accessibility or for return-in-place may need
2046 -- to be generated. Freeze nodes, if any, are inserted before the
2049 if not Is_Frozen (Spec_Id)
2050 and then Expander_Active
2052 -- Force the generation of its freezing node to ensure proper
2053 -- management of access types in the backend.
2055 -- This is definitely needed for some cases, but it is not clear
2056 -- why, to be investigated further???
2058 Set_Has_Delayed_Freeze (Spec_Id);
2059 Insert_Actions (N, Freeze_Entity (Spec_Id, Loc));
2063 -- Mark presence of postcondition proc in current scope
2065 if Chars (Body_Id) = Name_uPostconditions then
2066 Set_Has_Postconditions (Current_Scope);
2069 -- Place subprogram on scope stack, and make formals visible. If there
2070 -- is a spec, the visible entity remains that of the spec.
2072 if Present (Spec_Id) then
2073 Generate_Reference (Spec_Id, Body_Id, 'b', Set_Ref => False);
2075 if Is_Child_Unit (Spec_Id) then
2076 Generate_Reference (Spec_Id, Scope (Spec_Id), 'k', False);
2080 Style.Check_Identifier (Body_Id, Spec_Id);
2083 Set_Is_Compilation_Unit (Body_Id, Is_Compilation_Unit (Spec_Id));
2084 Set_Is_Child_Unit (Body_Id, Is_Child_Unit (Spec_Id));
2086 if Is_Abstract_Subprogram (Spec_Id) then
2087 Error_Msg_N ("an abstract subprogram cannot have a body", N);
2091 Set_Convention (Body_Id, Convention (Spec_Id));
2092 Set_Has_Completion (Spec_Id);
2094 if Is_Protected_Type (Scope (Spec_Id)) then
2095 Prot_Typ := Scope (Spec_Id);
2098 -- If this is a body generated for a renaming, do not check for
2099 -- full conformance. The check is redundant, because the spec of
2100 -- the body is a copy of the spec in the renaming declaration,
2101 -- and the test can lead to spurious errors on nested defaults.
2103 if Present (Spec_Decl)
2104 and then not Comes_From_Source (N)
2106 (Nkind (Original_Node (Spec_Decl)) =
2107 N_Subprogram_Renaming_Declaration
2108 or else (Present (Corresponding_Body (Spec_Decl))
2110 Nkind (Unit_Declaration_Node
2111 (Corresponding_Body (Spec_Decl))) =
2112 N_Subprogram_Renaming_Declaration))
2119 Fully_Conformant, True, Conformant, Body_Id);
2122 -- If the body is not fully conformant, we have to decide if we
2123 -- should analyze it or not. If it has a really messed up profile
2124 -- then we probably should not analyze it, since we will get too
2125 -- many bogus messages.
2127 -- Our decision is to go ahead in the non-fully conformant case
2128 -- only if it is at least mode conformant with the spec. Note
2129 -- that the call to Check_Fully_Conformant has issued the proper
2130 -- error messages to complain about the lack of conformance.
2133 and then not Mode_Conformant (Body_Id, Spec_Id)
2139 if Spec_Id /= Body_Id then
2140 Reference_Body_Formals (Spec_Id, Body_Id);
2143 if Nkind (N) /= N_Subprogram_Body_Stub then
2144 Set_Corresponding_Spec (N, Spec_Id);
2146 -- Ada 2005 (AI-345): If the operation is a primitive operation
2147 -- of a concurrent type, the type of the first parameter has been
2148 -- replaced with the corresponding record, which is the proper
2149 -- run-time structure to use. However, within the body there may
2150 -- be uses of the formals that depend on primitive operations
2151 -- of the type (in particular calls in prefixed form) for which
2152 -- we need the original concurrent type. The operation may have
2153 -- several controlling formals, so the replacement must be done
2156 if Comes_From_Source (Spec_Id)
2157 and then Present (First_Entity (Spec_Id))
2158 and then Ekind (Etype (First_Entity (Spec_Id))) = E_Record_Type
2159 and then Is_Tagged_Type (Etype (First_Entity (Spec_Id)))
2161 Present (Interfaces (Etype (First_Entity (Spec_Id))))
2164 (Corresponding_Concurrent_Type
2165 (Etype (First_Entity (Spec_Id))))
2168 Typ : constant Entity_Id := Etype (First_Entity (Spec_Id));
2172 Form := First_Formal (Spec_Id);
2173 while Present (Form) loop
2174 if Etype (Form) = Typ then
2175 Set_Etype (Form, Corresponding_Concurrent_Type (Typ));
2183 -- Make the formals visible, and place subprogram on scope stack.
2184 -- This is also the point at which we set Last_Real_Spec_Entity
2185 -- to mark the entities which will not be moved to the body.
2187 Install_Formals (Spec_Id);
2188 Last_Real_Spec_Entity := Last_Entity (Spec_Id);
2189 Push_Scope (Spec_Id);
2191 -- Make sure that the subprogram is immediately visible. For
2192 -- child units that have no separate spec this is indispensable.
2193 -- Otherwise it is safe albeit redundant.
2195 Set_Is_Immediately_Visible (Spec_Id);
2198 Set_Corresponding_Body (Unit_Declaration_Node (Spec_Id), Body_Id);
2199 Set_Ekind (Body_Id, E_Subprogram_Body);
2200 Set_Scope (Body_Id, Scope (Spec_Id));
2201 Set_Is_Obsolescent (Body_Id, Is_Obsolescent (Spec_Id));
2203 -- Case of subprogram body with no previous spec
2207 and then Comes_From_Source (Body_Id)
2208 and then not Suppress_Style_Checks (Body_Id)
2209 and then not In_Instance
2211 Style.Body_With_No_Spec (N);
2214 New_Overloaded_Entity (Body_Id);
2216 if Nkind (N) /= N_Subprogram_Body_Stub then
2217 Set_Acts_As_Spec (N);
2218 Generate_Definition (Body_Id);
2220 (Body_Id, Body_Id, 'b', Set_Ref => False, Force => True);
2221 Generate_Reference_To_Formals (Body_Id);
2222 Install_Formals (Body_Id);
2223 Push_Scope (Body_Id);
2227 -- If the return type is an anonymous access type whose designated type
2228 -- is the limited view of a class-wide type and the non-limited view is
2229 -- available, update the return type accordingly.
2231 if Ada_Version >= Ada_05
2232 and then Comes_From_Source (N)
2239 Rtyp := Etype (Current_Scope);
2241 if Ekind (Rtyp) = E_Anonymous_Access_Type then
2242 Etyp := Directly_Designated_Type (Rtyp);
2244 if Is_Class_Wide_Type (Etyp)
2245 and then From_With_Type (Etyp)
2247 Set_Directly_Designated_Type
2248 (Etype (Current_Scope), Available_View (Etyp));
2254 -- If this is the proper body of a stub, we must verify that the stub
2255 -- conforms to the body, and to the previous spec if one was present.
2256 -- we know already that the body conforms to that spec. This test is
2257 -- only required for subprograms that come from source.
2259 if Nkind (Parent (N)) = N_Subunit
2260 and then Comes_From_Source (N)
2261 and then not Error_Posted (Body_Id)
2262 and then Nkind (Corresponding_Stub (Parent (N))) =
2263 N_Subprogram_Body_Stub
2266 Old_Id : constant Entity_Id :=
2268 (Specification (Corresponding_Stub (Parent (N))));
2270 Conformant : Boolean := False;
2273 if No (Spec_Id) then
2274 Check_Fully_Conformant (Body_Id, Old_Id);
2278 (Body_Id, Old_Id, Fully_Conformant, False, Conformant);
2280 if not Conformant then
2282 -- The stub was taken to be a new declaration. Indicate
2283 -- that it lacks a body.
2285 Set_Has_Completion (Old_Id, False);
2291 Set_Has_Completion (Body_Id);
2292 Check_Eliminated (Body_Id);
2294 if Nkind (N) = N_Subprogram_Body_Stub then
2297 elsif Present (Spec_Id)
2298 and then Expander_Active
2300 (Has_Pragma_Inline_Always (Spec_Id)
2301 or else (Has_Pragma_Inline (Spec_Id) and Front_End_Inlining))
2303 Build_Body_To_Inline (N, Spec_Id);
2306 -- Ada 2005 (AI-262): In library subprogram bodies, after the analysis
2307 -- if its specification we have to install the private withed units.
2308 -- This holds for child units as well.
2310 if Is_Compilation_Unit (Body_Id)
2311 or else Nkind (Parent (N)) = N_Compilation_Unit
2313 Install_Private_With_Clauses (Body_Id);
2316 Check_Anonymous_Return;
2318 -- Set the Protected_Formal field of each extra formal of the protected
2319 -- subprogram to reference the corresponding extra formal of the
2320 -- subprogram that implements it. For regular formals this occurs when
2321 -- the protected subprogram's declaration is expanded, but the extra
2322 -- formals don't get created until the subprogram is frozen. We need to
2323 -- do this before analyzing the protected subprogram's body so that any
2324 -- references to the original subprogram's extra formals will be changed
2325 -- refer to the implementing subprogram's formals (see Expand_Formal).
2327 if Present (Spec_Id)
2328 and then Is_Protected_Type (Scope (Spec_Id))
2329 and then Present (Protected_Body_Subprogram (Spec_Id))
2332 Impl_Subp : constant Entity_Id :=
2333 Protected_Body_Subprogram (Spec_Id);
2334 Prot_Ext_Formal : Entity_Id := Extra_Formals (Spec_Id);
2335 Impl_Ext_Formal : Entity_Id := Extra_Formals (Impl_Subp);
2337 while Present (Prot_Ext_Formal) loop
2338 pragma Assert (Present (Impl_Ext_Formal));
2339 Set_Protected_Formal (Prot_Ext_Formal, Impl_Ext_Formal);
2340 Next_Formal_With_Extras (Prot_Ext_Formal);
2341 Next_Formal_With_Extras (Impl_Ext_Formal);
2346 -- Now we can go on to analyze the body
2348 HSS := Handled_Statement_Sequence (N);
2349 Set_Actual_Subtypes (N, Current_Scope);
2351 -- Deal with preconditions and postconditions
2353 Process_PPCs (N, Spec_Id, Body_Id);
2355 -- Add a declaration for the Protection object, renaming declarations
2356 -- for discriminals and privals and finally a declaration for the entry
2357 -- family index (if applicable). This form of early expansion is done
2358 -- when the Expander is active because Install_Private_Data_Declarations
2359 -- references entities which were created during regular expansion.
2362 and then Comes_From_Source (N)
2363 and then Present (Prot_Typ)
2364 and then Present (Spec_Id)
2365 and then not Is_Eliminated (Spec_Id)
2367 Install_Private_Data_Declarations
2368 (Sloc (N), Spec_Id, Prot_Typ, N, Declarations (N));
2371 -- Analyze the declarations (this call will analyze the precondition
2372 -- Check pragmas we prepended to the list, as well as the declaration
2373 -- of the _Postconditions procedure).
2375 Analyze_Declarations (Declarations (N));
2377 -- Check completion, and analyze the statements
2380 Inspect_Deferred_Constant_Completion (Declarations (N));
2383 -- Deal with end of scope processing for the body
2385 Process_End_Label (HSS, 't', Current_Scope);
2387 Check_Subprogram_Order (N);
2388 Set_Analyzed (Body_Id);
2390 -- If we have a separate spec, then the analysis of the declarations
2391 -- caused the entities in the body to be chained to the spec id, but
2392 -- we want them chained to the body id. Only the formal parameters
2393 -- end up chained to the spec id in this case.
2395 if Present (Spec_Id) then
2397 -- We must conform to the categorization of our spec
2399 Validate_Categorization_Dependency (N, Spec_Id);
2401 -- And if this is a child unit, the parent units must conform
2403 if Is_Child_Unit (Spec_Id) then
2404 Validate_Categorization_Dependency
2405 (Unit_Declaration_Node (Spec_Id), Spec_Id);
2408 -- Here is where we move entities from the spec to the body
2410 -- Case where there are entities that stay with the spec
2412 if Present (Last_Real_Spec_Entity) then
2414 -- No body entities (happens when the only real spec entities
2415 -- come from precondition and postcondition pragmas)
2417 if No (Last_Entity (Body_Id)) then
2419 (Body_Id, Next_Entity (Last_Real_Spec_Entity));
2421 -- Body entities present (formals), so chain stuff past them
2425 (Last_Entity (Body_Id), Next_Entity (Last_Real_Spec_Entity));
2428 Set_Next_Entity (Last_Real_Spec_Entity, Empty);
2429 Set_Last_Entity (Body_Id, Last_Entity (Spec_Id));
2430 Set_Last_Entity (Spec_Id, Last_Real_Spec_Entity);
2432 -- Case where there are no spec entities, in this case there can
2433 -- be no body entities either, so just move everything.
2436 pragma Assert (No (Last_Entity (Body_Id)));
2437 Set_First_Entity (Body_Id, First_Entity (Spec_Id));
2438 Set_Last_Entity (Body_Id, Last_Entity (Spec_Id));
2439 Set_First_Entity (Spec_Id, Empty);
2440 Set_Last_Entity (Spec_Id, Empty);
2444 -- If function, check return statements
2446 if Nkind (Body_Spec) = N_Function_Specification then
2451 if Present (Spec_Id) then
2457 if Return_Present (Id) then
2458 Check_Returns (HSS, 'F', Missing_Ret);
2461 Set_Has_Missing_Return (Id);
2464 elsif not Is_Machine_Code_Subprogram (Id)
2465 and then not Body_Deleted
2467 Error_Msg_N ("missing RETURN statement in function body", N);
2471 -- If procedure with No_Return, check returns
2473 elsif Nkind (Body_Spec) = N_Procedure_Specification
2474 and then Present (Spec_Id)
2475 and then No_Return (Spec_Id)
2477 Check_Returns (HSS, 'P', Missing_Ret, Spec_Id);
2480 -- Now we are going to check for variables that are never modified in
2481 -- the body of the procedure. But first we deal with a special case
2482 -- where we want to modify this check. If the body of the subprogram
2483 -- starts with a raise statement or its equivalent, or if the body
2484 -- consists entirely of a null statement, then it is pretty obvious
2485 -- that it is OK to not reference the parameters. For example, this
2486 -- might be the following common idiom for a stubbed function:
2487 -- statement of the procedure raises an exception. In particular this
2488 -- deals with the common idiom of a stubbed function, which might
2489 -- appear as something like
2491 -- function F (A : Integer) return Some_Type;
2494 -- raise Program_Error;
2498 -- Here the purpose of X is simply to satisfy the annoying requirement
2499 -- in Ada that there be at least one return, and we certainly do not
2500 -- want to go posting warnings on X that it is not initialized! On
2501 -- the other hand, if X is entirely unreferenced that should still
2504 -- What we do is to detect these cases, and if we find them, flag the
2505 -- subprogram as being Is_Trivial_Subprogram and then use that flag to
2506 -- suppress unwanted warnings. For the case of the function stub above
2507 -- we have a special test to set X as apparently assigned to suppress
2514 -- Skip initial labels (for one thing this occurs when we are in
2515 -- front end ZCX mode, but in any case it is irrelevant), and also
2516 -- initial Push_xxx_Error_Label nodes, which are also irrelevant.
2518 Stm := First (Statements (HSS));
2519 while Nkind (Stm) = N_Label
2520 or else Nkind (Stm) in N_Push_xxx_Label
2525 -- Do the test on the original statement before expansion
2528 Ostm : constant Node_Id := Original_Node (Stm);
2531 -- If explicit raise statement, turn on flag
2533 if Nkind (Ostm) = N_Raise_Statement then
2534 Set_Trivial_Subprogram (Stm);
2536 -- If null statement, and no following statements, turn on flag
2538 elsif Nkind (Stm) = N_Null_Statement
2539 and then Comes_From_Source (Stm)
2540 and then No (Next (Stm))
2542 Set_Trivial_Subprogram (Stm);
2544 -- Check for explicit call cases which likely raise an exception
2546 elsif Nkind (Ostm) = N_Procedure_Call_Statement then
2547 if Is_Entity_Name (Name (Ostm)) then
2549 Ent : constant Entity_Id := Entity (Name (Ostm));
2552 -- If the procedure is marked No_Return, then likely it
2553 -- raises an exception, but in any case it is not coming
2554 -- back here, so turn on the flag.
2556 if Ekind (Ent) = E_Procedure
2557 and then No_Return (Ent)
2559 Set_Trivial_Subprogram (Stm);
2567 -- Check for variables that are never modified
2573 -- If there is a separate spec, then transfer Never_Set_In_Source
2574 -- flags from out parameters to the corresponding entities in the
2575 -- body. The reason we do that is we want to post error flags on
2576 -- the body entities, not the spec entities.
2578 if Present (Spec_Id) then
2579 E1 := First_Entity (Spec_Id);
2580 while Present (E1) loop
2581 if Ekind (E1) = E_Out_Parameter then
2582 E2 := First_Entity (Body_Id);
2583 while Present (E2) loop
2584 exit when Chars (E1) = Chars (E2);
2588 if Present (E2) then
2589 Set_Never_Set_In_Source (E2, Never_Set_In_Source (E1));
2597 -- Check references in body unless it was deleted. Note that the
2598 -- check of Body_Deleted here is not just for efficiency, it is
2599 -- necessary to avoid junk warnings on formal parameters.
2601 if not Body_Deleted then
2602 Check_References (Body_Id);
2605 end Analyze_Subprogram_Body_Helper;
2607 ------------------------------------
2608 -- Analyze_Subprogram_Declaration --
2609 ------------------------------------
2611 procedure Analyze_Subprogram_Declaration (N : Node_Id) is
2612 Loc : constant Source_Ptr := Sloc (N);
2613 Designator : Entity_Id;
2615 Scop : constant Entity_Id := Current_Scope;
2616 Null_Body : Node_Id := Empty;
2618 -- Start of processing for Analyze_Subprogram_Declaration
2621 -- For a null procedure, capture the profile before analysis, for
2622 -- expansion at the freeze point and at each point of call.
2623 -- The body will only be used if the procedure has preconditions.
2624 -- In that case the body is analyzed at the freeze point.
2626 if Nkind (Specification (N)) = N_Procedure_Specification
2627 and then Null_Present (Specification (N))
2628 and then Expander_Active
2631 Make_Subprogram_Body (Loc,
2633 New_Copy_Tree (Specification (N)),
2636 Handled_Statement_Sequence =>
2637 Make_Handled_Sequence_Of_Statements (Loc,
2638 Statements => New_List (Make_Null_Statement (Loc))));
2640 -- Create new entities for body and formals.
2642 Set_Defining_Unit_Name (Specification (Null_Body),
2643 Make_Defining_Identifier (Loc, Chars (Defining_Entity (N))));
2644 Set_Corresponding_Body (N, Defining_Entity (Null_Body));
2646 Form := First (Parameter_Specifications (Specification (Null_Body)));
2647 while Present (Form) loop
2648 Set_Defining_Identifier (Form,
2649 Make_Defining_Identifier (Loc,
2650 Chars (Defining_Identifier (Form))));
2654 if Is_Protected_Type (Current_Scope) then
2656 ("protected operation cannot be a null procedure", N);
2660 Designator := Analyze_Subprogram_Specification (Specification (N));
2661 Generate_Definition (Designator);
2663 if Debug_Flag_C then
2664 Write_Str ("==> subprogram spec ");
2665 Write_Name (Chars (Designator));
2666 Write_Str (" from ");
2667 Write_Location (Sloc (N));
2672 if Nkind (Specification (N)) = N_Procedure_Specification
2673 and then Null_Present (Specification (N))
2675 Set_Has_Completion (Designator);
2677 if Present (Null_Body) then
2678 Set_Corresponding_Body (N, Defining_Entity (Null_Body));
2679 Set_Body_To_Inline (N, Null_Body);
2680 Set_Is_Inlined (Designator);
2684 Validate_RCI_Subprogram_Declaration (N);
2685 New_Overloaded_Entity (Designator);
2686 Check_Delayed_Subprogram (Designator);
2688 -- If the type of the first formal of the current subprogram is a non
2689 -- generic tagged private type , mark the subprogram as being a private
2692 if Present (First_Formal (Designator)) then
2694 Formal_Typ : constant Entity_Id :=
2695 Etype (First_Formal (Designator));
2697 Set_Is_Private_Primitive (Designator,
2698 Is_Tagged_Type (Formal_Typ)
2699 and then Is_Private_Type (Formal_Typ)
2700 and then not Is_Generic_Actual_Type (Formal_Typ));
2704 -- Ada 2005 (AI-251): Abstract interface primitives must be abstract
2707 if Ada_Version >= Ada_05
2708 and then Comes_From_Source (N)
2709 and then Is_Dispatching_Operation (Designator)
2716 if Has_Controlling_Result (Designator) then
2717 Etyp := Etype (Designator);
2720 E := First_Entity (Designator);
2722 and then Is_Formal (E)
2723 and then not Is_Controlling_Formal (E)
2731 if Is_Access_Type (Etyp) then
2732 Etyp := Directly_Designated_Type (Etyp);
2735 if Is_Interface (Etyp)
2736 and then not Is_Abstract_Subprogram (Designator)
2737 and then not (Ekind (Designator) = E_Procedure
2738 and then Null_Present (Specification (N)))
2740 Error_Msg_Name_1 := Chars (Defining_Entity (N));
2742 ("(Ada 2005) interface subprogram % must be abstract or null",
2748 -- What is the following code for, it used to be
2750 -- ??? Set_Suppress_Elaboration_Checks
2751 -- ??? (Designator, Elaboration_Checks_Suppressed (Designator));
2753 -- The following seems equivalent, but a bit dubious
2755 if Elaboration_Checks_Suppressed (Designator) then
2756 Set_Kill_Elaboration_Checks (Designator);
2759 if Scop /= Standard_Standard
2760 and then not Is_Child_Unit (Designator)
2762 Set_Categorization_From_Scope (Designator, Scop);
2764 -- For a compilation unit, check for library-unit pragmas
2766 Push_Scope (Designator);
2767 Set_Categorization_From_Pragmas (N);
2768 Validate_Categorization_Dependency (N, Designator);
2772 -- For a compilation unit, set body required. This flag will only be
2773 -- reset if a valid Import or Interface pragma is processed later on.
2775 if Nkind (Parent (N)) = N_Compilation_Unit then
2776 Set_Body_Required (Parent (N), True);
2778 if Ada_Version >= Ada_05
2779 and then Nkind (Specification (N)) = N_Procedure_Specification
2780 and then Null_Present (Specification (N))
2783 ("null procedure cannot be declared at library level", N);
2787 Generate_Reference_To_Formals (Designator);
2788 Check_Eliminated (Designator);
2790 if Debug_Flag_C then
2792 Write_Str ("<== subprogram spec ");
2793 Write_Name (Chars (Designator));
2794 Write_Str (" from ");
2795 Write_Location (Sloc (N));
2798 end Analyze_Subprogram_Declaration;
2800 --------------------------------------
2801 -- Analyze_Subprogram_Specification --
2802 --------------------------------------
2804 -- Reminder: N here really is a subprogram specification (not a subprogram
2805 -- declaration). This procedure is called to analyze the specification in
2806 -- both subprogram bodies and subprogram declarations (specs).
2808 function Analyze_Subprogram_Specification (N : Node_Id) return Entity_Id is
2809 Designator : constant Entity_Id := Defining_Entity (N);
2810 Formals : constant List_Id := Parameter_Specifications (N);
2812 -- Start of processing for Analyze_Subprogram_Specification
2815 Generate_Definition (Designator);
2817 if Nkind (N) = N_Function_Specification then
2818 Set_Ekind (Designator, E_Function);
2819 Set_Mechanism (Designator, Default_Mechanism);
2822 Set_Ekind (Designator, E_Procedure);
2823 Set_Etype (Designator, Standard_Void_Type);
2826 -- Introduce new scope for analysis of the formals and the return type
2828 Set_Scope (Designator, Current_Scope);
2830 if Present (Formals) then
2831 Push_Scope (Designator);
2832 Process_Formals (Formals, N);
2834 -- Ada 2005 (AI-345): If this is an overriding operation of an
2835 -- inherited interface operation, and the controlling type is
2836 -- a synchronized type, replace the type with its corresponding
2837 -- record, to match the proper signature of an overriding operation.
2838 -- Same processing for an access parameter whose designated type is
2839 -- derived from a synchronized interface.
2841 if Ada_Version >= Ada_05 then
2844 Formal_Typ : Entity_Id;
2845 Rec_Typ : Entity_Id;
2846 Desig_Typ : Entity_Id;
2849 Formal := First_Formal (Designator);
2850 while Present (Formal) loop
2851 Formal_Typ := Etype (Formal);
2853 if Is_Concurrent_Type (Formal_Typ)
2854 and then Present (Corresponding_Record_Type (Formal_Typ))
2856 Rec_Typ := Corresponding_Record_Type (Formal_Typ);
2858 if Present (Interfaces (Rec_Typ)) then
2859 Set_Etype (Formal, Rec_Typ);
2862 elsif Ekind (Formal_Typ) = E_Anonymous_Access_Type then
2863 Desig_Typ := Designated_Type (Formal_Typ);
2865 if Is_Concurrent_Type (Desig_Typ)
2866 and then Present (Corresponding_Record_Type (Desig_Typ))
2868 Rec_Typ := Corresponding_Record_Type (Desig_Typ);
2870 if Present (Interfaces (Rec_Typ)) then
2871 Set_Directly_Designated_Type (Formal_Typ, Rec_Typ);
2876 Next_Formal (Formal);
2883 -- The subprogram scope is pushed and popped around the processing of
2884 -- the return type for consistency with call above to Process_Formals
2885 -- (which itself can call Analyze_Return_Type), and to ensure that any
2886 -- itype created for the return type will be associated with the proper
2889 elsif Nkind (N) = N_Function_Specification then
2890 Push_Scope (Designator);
2892 Analyze_Return_Type (N);
2897 if Nkind (N) = N_Function_Specification then
2898 if Nkind (Designator) = N_Defining_Operator_Symbol then
2899 Valid_Operator_Definition (Designator);
2902 May_Need_Actuals (Designator);
2904 -- Ada 2005 (AI-251): If the return type is abstract, verify that
2905 -- the subprogram is abstract also. This does not apply to renaming
2906 -- declarations, where abstractness is inherited.
2907 -- In case of primitives associated with abstract interface types
2908 -- the check is applied later (see Analyze_Subprogram_Declaration).
2910 if Is_Abstract_Type (Etype (Designator))
2911 and then not Is_Interface (Etype (Designator))
2912 and then Nkind (Parent (N)) /= N_Subprogram_Renaming_Declaration
2913 and then Nkind (Parent (N)) /=
2914 N_Abstract_Subprogram_Declaration
2916 (Nkind (Parent (N))) /= N_Formal_Abstract_Subprogram_Declaration
2919 ("function that returns abstract type must be abstract", N);
2924 end Analyze_Subprogram_Specification;
2926 --------------------------
2927 -- Build_Body_To_Inline --
2928 --------------------------
2930 procedure Build_Body_To_Inline (N : Node_Id; Subp : Entity_Id) is
2931 Decl : constant Node_Id := Unit_Declaration_Node (Subp);
2932 Original_Body : Node_Id;
2933 Body_To_Analyze : Node_Id;
2934 Max_Size : constant := 10;
2935 Stat_Count : Integer := 0;
2937 function Has_Excluded_Declaration (Decls : List_Id) return Boolean;
2938 -- Check for declarations that make inlining not worthwhile
2940 function Has_Excluded_Statement (Stats : List_Id) return Boolean;
2941 -- Check for statements that make inlining not worthwhile: any tasking
2942 -- statement, nested at any level. Keep track of total number of
2943 -- elementary statements, as a measure of acceptable size.
2945 function Has_Pending_Instantiation return Boolean;
2946 -- If some enclosing body contains instantiations that appear before the
2947 -- corresponding generic body, the enclosing body has a freeze node so
2948 -- that it can be elaborated after the generic itself. This might
2949 -- conflict with subsequent inlinings, so that it is unsafe to try to
2950 -- inline in such a case.
2952 function Has_Single_Return return Boolean;
2953 -- In general we cannot inline functions that return unconstrained type.
2954 -- However, we can handle such functions if all return statements return
2955 -- a local variable that is the only declaration in the body of the
2956 -- function. In that case the call can be replaced by that local
2957 -- variable as is done for other inlined calls.
2959 procedure Remove_Pragmas;
2960 -- A pragma Unreferenced or pragma Unmodified that mentions a formal
2961 -- parameter has no meaning when the body is inlined and the formals
2962 -- are rewritten. Remove it from body to inline. The analysis of the
2963 -- non-inlined body will handle the pragma properly.
2965 function Uses_Secondary_Stack (Bod : Node_Id) return Boolean;
2966 -- If the body of the subprogram includes a call that returns an
2967 -- unconstrained type, the secondary stack is involved, and it
2968 -- is not worth inlining.
2970 ------------------------------
2971 -- Has_Excluded_Declaration --
2972 ------------------------------
2974 function Has_Excluded_Declaration (Decls : List_Id) return Boolean is
2977 function Is_Unchecked_Conversion (D : Node_Id) return Boolean;
2978 -- Nested subprograms make a given body ineligible for inlining, but
2979 -- we make an exception for instantiations of unchecked conversion.
2980 -- The body has not been analyzed yet, so check the name, and verify
2981 -- that the visible entity with that name is the predefined unit.
2983 -----------------------------
2984 -- Is_Unchecked_Conversion --
2985 -----------------------------
2987 function Is_Unchecked_Conversion (D : Node_Id) return Boolean is
2988 Id : constant Node_Id := Name (D);
2992 if Nkind (Id) = N_Identifier
2993 and then Chars (Id) = Name_Unchecked_Conversion
2995 Conv := Current_Entity (Id);
2997 elsif Nkind_In (Id, N_Selected_Component, N_Expanded_Name)
2998 and then Chars (Selector_Name (Id)) = Name_Unchecked_Conversion
3000 Conv := Current_Entity (Selector_Name (Id));
3005 return Present (Conv)
3006 and then Is_Predefined_File_Name
3007 (Unit_File_Name (Get_Source_Unit (Conv)))
3008 and then Is_Intrinsic_Subprogram (Conv);
3009 end Is_Unchecked_Conversion;
3011 -- Start of processing for Has_Excluded_Declaration
3015 while Present (D) loop
3016 if (Nkind (D) = N_Function_Instantiation
3017 and then not Is_Unchecked_Conversion (D))
3018 or else Nkind_In (D, N_Protected_Type_Declaration,
3019 N_Package_Declaration,
3020 N_Package_Instantiation,
3022 N_Procedure_Instantiation,
3023 N_Task_Type_Declaration)
3026 ("cannot inline & (non-allowed declaration)?", D, Subp);
3034 end Has_Excluded_Declaration;
3036 ----------------------------
3037 -- Has_Excluded_Statement --
3038 ----------------------------
3040 function Has_Excluded_Statement (Stats : List_Id) return Boolean is
3046 while Present (S) loop
3047 Stat_Count := Stat_Count + 1;
3049 if Nkind_In (S, N_Abort_Statement,
3050 N_Asynchronous_Select,
3051 N_Conditional_Entry_Call,
3052 N_Delay_Relative_Statement,
3053 N_Delay_Until_Statement,
3058 ("cannot inline & (non-allowed statement)?", S, Subp);
3061 elsif Nkind (S) = N_Block_Statement then
3062 if Present (Declarations (S))
3063 and then Has_Excluded_Declaration (Declarations (S))
3067 elsif Present (Handled_Statement_Sequence (S))
3070 (Exception_Handlers (Handled_Statement_Sequence (S)))
3072 Has_Excluded_Statement
3073 (Statements (Handled_Statement_Sequence (S))))
3078 elsif Nkind (S) = N_Case_Statement then
3079 E := First (Alternatives (S));
3080 while Present (E) loop
3081 if Has_Excluded_Statement (Statements (E)) then
3088 elsif Nkind (S) = N_If_Statement then
3089 if Has_Excluded_Statement (Then_Statements (S)) then
3093 if Present (Elsif_Parts (S)) then
3094 E := First (Elsif_Parts (S));
3095 while Present (E) loop
3096 if Has_Excluded_Statement (Then_Statements (E)) then
3103 if Present (Else_Statements (S))
3104 and then Has_Excluded_Statement (Else_Statements (S))
3109 elsif Nkind (S) = N_Loop_Statement
3110 and then Has_Excluded_Statement (Statements (S))
3119 end Has_Excluded_Statement;
3121 -------------------------------
3122 -- Has_Pending_Instantiation --
3123 -------------------------------
3125 function Has_Pending_Instantiation return Boolean is
3130 while Present (S) loop
3131 if Is_Compilation_Unit (S)
3132 or else Is_Child_Unit (S)
3135 elsif Ekind (S) = E_Package
3136 and then Has_Forward_Instantiation (S)
3145 end Has_Pending_Instantiation;
3147 ------------------------
3148 -- Has_Single_Return --
3149 ------------------------
3151 function Has_Single_Return return Boolean is
3152 Return_Statement : Node_Id := Empty;
3154 function Check_Return (N : Node_Id) return Traverse_Result;
3160 function Check_Return (N : Node_Id) return Traverse_Result is
3162 if Nkind (N) = N_Simple_Return_Statement then
3163 if Present (Expression (N))
3164 and then Is_Entity_Name (Expression (N))
3166 if No (Return_Statement) then
3167 Return_Statement := N;
3170 elsif Chars (Expression (N)) =
3171 Chars (Expression (Return_Statement))
3180 -- Expression has wrong form
3190 function Check_All_Returns is new Traverse_Func (Check_Return);
3192 -- Start of processing for Has_Single_Return
3195 return Check_All_Returns (N) = OK
3196 and then Present (Declarations (N))
3197 and then Present (First (Declarations (N)))
3198 and then Chars (Expression (Return_Statement)) =
3199 Chars (Defining_Identifier (First (Declarations (N))));
3200 end Has_Single_Return;
3202 --------------------
3203 -- Remove_Pragmas --
3204 --------------------
3206 procedure Remove_Pragmas is
3211 Decl := First (Declarations (Body_To_Analyze));
3212 while Present (Decl) loop
3215 if Nkind (Decl) = N_Pragma
3216 and then (Pragma_Name (Decl) = Name_Unreferenced
3218 Pragma_Name (Decl) = Name_Unmodified)
3227 --------------------------
3228 -- Uses_Secondary_Stack --
3229 --------------------------
3231 function Uses_Secondary_Stack (Bod : Node_Id) return Boolean is
3232 function Check_Call (N : Node_Id) return Traverse_Result;
3233 -- Look for function calls that return an unconstrained type
3239 function Check_Call (N : Node_Id) return Traverse_Result is
3241 if Nkind (N) = N_Function_Call
3242 and then Is_Entity_Name (Name (N))
3243 and then Is_Composite_Type (Etype (Entity (Name (N))))
3244 and then not Is_Constrained (Etype (Entity (Name (N))))
3247 ("cannot inline & (call returns unconstrained type)?",
3255 function Check_Calls is new Traverse_Func (Check_Call);
3258 return Check_Calls (Bod) = Abandon;
3259 end Uses_Secondary_Stack;
3261 -- Start of processing for Build_Body_To_Inline
3264 -- Return immediately if done already
3266 if Nkind (Decl) = N_Subprogram_Declaration
3267 and then Present (Body_To_Inline (Decl))
3271 -- Functions that return unconstrained composite types require
3272 -- secondary stack handling, and cannot currently be inlined, unless
3273 -- all return statements return a local variable that is the first
3274 -- local declaration in the body.
3276 elsif Ekind (Subp) = E_Function
3277 and then not Is_Scalar_Type (Etype (Subp))
3278 and then not Is_Access_Type (Etype (Subp))
3279 and then not Is_Constrained (Etype (Subp))
3281 if not Has_Single_Return then
3283 ("cannot inline & (unconstrained return type)?", N, Subp);
3287 -- Ditto for functions that return controlled types, where controlled
3288 -- actions interfere in complex ways with inlining.
3290 elsif Ekind (Subp) = E_Function
3291 and then Needs_Finalization (Etype (Subp))
3294 ("cannot inline & (controlled return type)?", N, Subp);
3298 if Present (Declarations (N))
3299 and then Has_Excluded_Declaration (Declarations (N))
3304 if Present (Handled_Statement_Sequence (N)) then
3305 if Present (Exception_Handlers (Handled_Statement_Sequence (N))) then
3307 ("cannot inline& (exception handler)?",
3308 First (Exception_Handlers (Handled_Statement_Sequence (N))),
3312 Has_Excluded_Statement
3313 (Statements (Handled_Statement_Sequence (N)))
3319 -- We do not inline a subprogram that is too large, unless it is
3320 -- marked Inline_Always. This pragma does not suppress the other
3321 -- checks on inlining (forbidden declarations, handlers, etc).
3323 if Stat_Count > Max_Size
3324 and then not Has_Pragma_Inline_Always (Subp)
3326 Cannot_Inline ("cannot inline& (body too large)?", N, Subp);
3330 if Has_Pending_Instantiation then
3332 ("cannot inline& (forward instance within enclosing body)?",
3337 -- Within an instance, the body to inline must be treated as a nested
3338 -- generic, so that the proper global references are preserved.
3340 -- Note that we do not do this at the library level, because it is not
3341 -- needed, and furthermore this causes trouble if front end inlining
3342 -- is activated (-gnatN).
3344 if In_Instance and then Scope (Current_Scope) /= Standard_Standard then
3345 Save_Env (Scope (Current_Scope), Scope (Current_Scope));
3346 Original_Body := Copy_Generic_Node (N, Empty, True);
3348 Original_Body := Copy_Separate_Tree (N);
3351 -- We need to capture references to the formals in order to substitute
3352 -- the actuals at the point of inlining, i.e. instantiation. To treat
3353 -- the formals as globals to the body to inline, we nest it within
3354 -- a dummy parameterless subprogram, declared within the real one.
3355 -- To avoid generating an internal name (which is never public, and
3356 -- which affects serial numbers of other generated names), we use
3357 -- an internal symbol that cannot conflict with user declarations.
3359 Set_Parameter_Specifications (Specification (Original_Body), No_List);
3360 Set_Defining_Unit_Name
3361 (Specification (Original_Body),
3362 Make_Defining_Identifier (Sloc (N), Name_uParent));
3363 Set_Corresponding_Spec (Original_Body, Empty);
3365 Body_To_Analyze := Copy_Generic_Node (Original_Body, Empty, False);
3367 -- Set return type of function, which is also global and does not need
3370 if Ekind (Subp) = E_Function then
3371 Set_Result_Definition (Specification (Body_To_Analyze),
3372 New_Occurrence_Of (Etype (Subp), Sloc (N)));
3375 if No (Declarations (N)) then
3376 Set_Declarations (N, New_List (Body_To_Analyze));
3378 Append (Body_To_Analyze, Declarations (N));
3381 Expander_Mode_Save_And_Set (False);
3384 Analyze (Body_To_Analyze);
3385 Push_Scope (Defining_Entity (Body_To_Analyze));
3386 Save_Global_References (Original_Body);
3388 Remove (Body_To_Analyze);
3390 Expander_Mode_Restore;
3392 -- Restore environment if previously saved
3394 if In_Instance and then Scope (Current_Scope) /= Standard_Standard then
3398 -- If secondary stk used there is no point in inlining. We have
3399 -- already issued the warning in this case, so nothing to do.
3401 if Uses_Secondary_Stack (Body_To_Analyze) then
3405 Set_Body_To_Inline (Decl, Original_Body);
3406 Set_Ekind (Defining_Entity (Original_Body), Ekind (Subp));
3407 Set_Is_Inlined (Subp);
3408 end Build_Body_To_Inline;
3414 procedure Cannot_Inline (Msg : String; N : Node_Id; Subp : Entity_Id) is
3416 -- Do not emit warning if this is a predefined unit which is not
3417 -- the main unit. With validity checks enabled, some predefined
3418 -- subprograms may contain nested subprograms and become ineligible
3421 if Is_Predefined_File_Name (Unit_File_Name (Get_Source_Unit (Subp)))
3422 and then not In_Extended_Main_Source_Unit (Subp)
3426 elsif Has_Pragma_Inline_Always (Subp) then
3428 -- Remove last character (question mark) to make this into an error,
3429 -- because the Inline_Always pragma cannot be obeyed.
3431 Error_Msg_NE (Msg (Msg'First .. Msg'Last - 1), N, Subp);
3433 elsif Ineffective_Inline_Warnings then
3434 Error_Msg_NE (Msg, N, Subp);
3438 -----------------------
3439 -- Check_Conformance --
3440 -----------------------
3442 procedure Check_Conformance
3443 (New_Id : Entity_Id;
3445 Ctype : Conformance_Type;
3447 Conforms : out Boolean;
3448 Err_Loc : Node_Id := Empty;
3449 Get_Inst : Boolean := False;
3450 Skip_Controlling_Formals : Boolean := False)
3452 procedure Conformance_Error (Msg : String; N : Node_Id := New_Id);
3453 -- Sets Conforms to False. If Errmsg is False, then that's all it does.
3454 -- If Errmsg is True, then processing continues to post an error message
3455 -- for conformance error on given node. Two messages are output. The
3456 -- first message points to the previous declaration with a general "no
3457 -- conformance" message. The second is the detailed reason, supplied as
3458 -- Msg. The parameter N provide information for a possible & insertion
3459 -- in the message, and also provides the location for posting the
3460 -- message in the absence of a specified Err_Loc location.
3462 -----------------------
3463 -- Conformance_Error --
3464 -----------------------
3466 procedure Conformance_Error (Msg : String; N : Node_Id := New_Id) is
3473 if No (Err_Loc) then
3479 Error_Msg_Sloc := Sloc (Old_Id);
3482 when Type_Conformant =>
3483 Error_Msg_N -- CODEFIX
3484 ("not type conformant with declaration#!", Enode);
3486 when Mode_Conformant =>
3487 if Nkind (Parent (Old_Id)) = N_Full_Type_Declaration then
3488 Error_Msg_N -- CODEFIX???
3489 ("not mode conformant with operation inherited#!",
3492 Error_Msg_N -- CODEFIX???
3493 ("not mode conformant with declaration#!", Enode);
3496 when Subtype_Conformant =>
3497 if Nkind (Parent (Old_Id)) = N_Full_Type_Declaration then
3498 Error_Msg_N -- CODEFIX???
3499 ("not subtype conformant with operation inherited#!",
3502 Error_Msg_N -- CODEFIX???
3503 ("not subtype conformant with declaration#!", Enode);
3506 when Fully_Conformant =>
3507 if Nkind (Parent (Old_Id)) = N_Full_Type_Declaration then
3508 Error_Msg_N -- CODEFIX
3509 ("not fully conformant with operation inherited#!",
3512 Error_Msg_N -- CODEFIX
3513 ("not fully conformant with declaration#!", Enode);
3517 Error_Msg_NE (Msg, Enode, N);
3519 end Conformance_Error;
3523 Old_Type : constant Entity_Id := Etype (Old_Id);
3524 New_Type : constant Entity_Id := Etype (New_Id);
3525 Old_Formal : Entity_Id;
3526 New_Formal : Entity_Id;
3527 Access_Types_Match : Boolean;
3528 Old_Formal_Base : Entity_Id;
3529 New_Formal_Base : Entity_Id;
3531 -- Start of processing for Check_Conformance
3536 -- We need a special case for operators, since they don't appear
3539 if Ctype = Type_Conformant then
3540 if Ekind (New_Id) = E_Operator
3541 and then Operator_Matches_Spec (New_Id, Old_Id)
3547 -- If both are functions/operators, check return types conform
3549 if Old_Type /= Standard_Void_Type
3550 and then New_Type /= Standard_Void_Type
3553 -- If we are checking interface conformance we omit controlling
3554 -- arguments and result, because we are only checking the conformance
3555 -- of the remaining parameters.
3557 if Has_Controlling_Result (Old_Id)
3558 and then Has_Controlling_Result (New_Id)
3559 and then Skip_Controlling_Formals
3563 elsif not Conforming_Types (Old_Type, New_Type, Ctype, Get_Inst) then
3564 Conformance_Error ("\return type does not match!", New_Id);
3568 -- Ada 2005 (AI-231): In case of anonymous access types check the
3569 -- null-exclusion and access-to-constant attributes match.
3571 if Ada_Version >= Ada_05
3572 and then Ekind (Etype (Old_Type)) = E_Anonymous_Access_Type
3574 (Can_Never_Be_Null (Old_Type)
3575 /= Can_Never_Be_Null (New_Type)
3576 or else Is_Access_Constant (Etype (Old_Type))
3577 /= Is_Access_Constant (Etype (New_Type)))
3579 Conformance_Error ("\return type does not match!", New_Id);
3583 -- If either is a function/operator and the other isn't, error
3585 elsif Old_Type /= Standard_Void_Type
3586 or else New_Type /= Standard_Void_Type
3588 Conformance_Error ("\functions can only match functions!", New_Id);
3592 -- In subtype conformant case, conventions must match (RM 6.3.1(16)).
3593 -- If this is a renaming as body, refine error message to indicate that
3594 -- the conflict is with the original declaration. If the entity is not
3595 -- frozen, the conventions don't have to match, the one of the renamed
3596 -- entity is inherited.
3598 if Ctype >= Subtype_Conformant then
3599 if Convention (Old_Id) /= Convention (New_Id) then
3601 if not Is_Frozen (New_Id) then
3604 elsif Present (Err_Loc)
3605 and then Nkind (Err_Loc) = N_Subprogram_Renaming_Declaration
3606 and then Present (Corresponding_Spec (Err_Loc))
3608 Error_Msg_Name_1 := Chars (New_Id);
3610 Name_Ada + Convention_Id'Pos (Convention (New_Id));
3612 Conformance_Error ("\prior declaration for% has convention %!");
3615 Conformance_Error ("\calling conventions do not match!");
3620 elsif Is_Formal_Subprogram (Old_Id)
3621 or else Is_Formal_Subprogram (New_Id)
3623 Conformance_Error ("\formal subprograms not allowed!");
3628 -- Deal with parameters
3630 -- Note: we use the entity information, rather than going directly
3631 -- to the specification in the tree. This is not only simpler, but
3632 -- absolutely necessary for some cases of conformance tests between
3633 -- operators, where the declaration tree simply does not exist!
3635 Old_Formal := First_Formal (Old_Id);
3636 New_Formal := First_Formal (New_Id);
3637 while Present (Old_Formal) and then Present (New_Formal) loop
3638 if Is_Controlling_Formal (Old_Formal)
3639 and then Is_Controlling_Formal (New_Formal)
3640 and then Skip_Controlling_Formals
3642 -- The controlling formals will have different types when
3643 -- comparing an interface operation with its match, but both
3644 -- or neither must be access parameters.
3646 if Is_Access_Type (Etype (Old_Formal))
3648 Is_Access_Type (Etype (New_Formal))
3650 goto Skip_Controlling_Formal;
3653 ("\access parameter does not match!", New_Formal);
3657 if Ctype = Fully_Conformant then
3659 -- Names must match. Error message is more accurate if we do
3660 -- this before checking that the types of the formals match.
3662 if Chars (Old_Formal) /= Chars (New_Formal) then
3663 Conformance_Error ("\name & does not match!", New_Formal);
3665 -- Set error posted flag on new formal as well to stop
3666 -- junk cascaded messages in some cases.
3668 Set_Error_Posted (New_Formal);
3673 -- Ada 2005 (AI-423): Possible access [sub]type and itype match. This
3674 -- case occurs whenever a subprogram is being renamed and one of its
3675 -- parameters imposes a null exclusion. For example:
3677 -- type T is null record;
3678 -- type Acc_T is access T;
3679 -- subtype Acc_T_Sub is Acc_T;
3681 -- procedure P (Obj : not null Acc_T_Sub); -- itype
3682 -- procedure Ren_P (Obj : Acc_T_Sub) -- subtype
3685 Old_Formal_Base := Etype (Old_Formal);
3686 New_Formal_Base := Etype (New_Formal);
3689 Old_Formal_Base := Get_Instance_Of (Old_Formal_Base);
3690 New_Formal_Base := Get_Instance_Of (New_Formal_Base);
3693 Access_Types_Match := Ada_Version >= Ada_05
3695 -- Ensure that this rule is only applied when New_Id is a
3696 -- renaming of Old_Id.
3698 and then Nkind (Parent (Parent (New_Id))) =
3699 N_Subprogram_Renaming_Declaration
3700 and then Nkind (Name (Parent (Parent (New_Id)))) in N_Has_Entity
3701 and then Present (Entity (Name (Parent (Parent (New_Id)))))
3702 and then Entity (Name (Parent (Parent (New_Id)))) = Old_Id
3704 -- Now handle the allowed access-type case
3706 and then Is_Access_Type (Old_Formal_Base)
3707 and then Is_Access_Type (New_Formal_Base)
3709 -- The type kinds must match. The only exception occurs with
3710 -- multiple generics of the form:
3713 -- type F is private; type A is private;
3714 -- type F_Ptr is access F; type A_Ptr is access A;
3715 -- with proc F_P (X : F_Ptr); with proc A_P (X : A_Ptr);
3716 -- package F_Pack is ... package A_Pack is
3717 -- package F_Inst is
3718 -- new F_Pack (A, A_Ptr, A_P);
3720 -- When checking for conformance between the parameters of A_P
3721 -- and F_P, the type kinds of F_Ptr and A_Ptr will not match
3722 -- because the compiler has transformed A_Ptr into a subtype of
3723 -- F_Ptr. We catch this case in the code below.
3725 and then (Ekind (Old_Formal_Base) = Ekind (New_Formal_Base)
3727 (Is_Generic_Type (Old_Formal_Base)
3728 and then Is_Generic_Type (New_Formal_Base)
3729 and then Is_Internal (New_Formal_Base)
3730 and then Etype (Etype (New_Formal_Base)) =
3732 and then Directly_Designated_Type (Old_Formal_Base) =
3733 Directly_Designated_Type (New_Formal_Base)
3734 and then ((Is_Itype (Old_Formal_Base)
3735 and then Can_Never_Be_Null (Old_Formal_Base))
3737 (Is_Itype (New_Formal_Base)
3738 and then Can_Never_Be_Null (New_Formal_Base)));
3740 -- Types must always match. In the visible part of an instance,
3741 -- usual overloading rules for dispatching operations apply, and
3742 -- we check base types (not the actual subtypes).
3744 if In_Instance_Visible_Part
3745 and then Is_Dispatching_Operation (New_Id)
3747 if not Conforming_Types
3748 (T1 => Base_Type (Etype (Old_Formal)),
3749 T2 => Base_Type (Etype (New_Formal)),
3751 Get_Inst => Get_Inst)
3752 and then not Access_Types_Match
3754 Conformance_Error ("\type of & does not match!", New_Formal);
3758 elsif not Conforming_Types
3759 (T1 => Old_Formal_Base,
3760 T2 => New_Formal_Base,
3762 Get_Inst => Get_Inst)
3763 and then not Access_Types_Match
3765 -- Don't give error message if old type is Any_Type. This test
3766 -- avoids some cascaded errors, e.g. in case of a bad spec.
3768 if Errmsg and then Old_Formal_Base = Any_Type then
3771 Conformance_Error ("\type of & does not match!", New_Formal);
3777 -- For mode conformance, mode must match
3779 if Ctype >= Mode_Conformant then
3780 if Parameter_Mode (Old_Formal) /= Parameter_Mode (New_Formal) then
3781 Conformance_Error ("\mode of & does not match!", New_Formal);
3784 -- Part of mode conformance for access types is having the same
3785 -- constant modifier.
3787 elsif Access_Types_Match
3788 and then Is_Access_Constant (Old_Formal_Base) /=
3789 Is_Access_Constant (New_Formal_Base)
3792 ("\constant modifier does not match!", New_Formal);
3797 if Ctype >= Subtype_Conformant then
3799 -- Ada 2005 (AI-231): In case of anonymous access types check
3800 -- the null-exclusion and access-to-constant attributes must
3803 if Ada_Version >= Ada_05
3804 and then Ekind (Etype (Old_Formal)) = E_Anonymous_Access_Type
3805 and then Ekind (Etype (New_Formal)) = E_Anonymous_Access_Type
3807 (Can_Never_Be_Null (Old_Formal) /=
3808 Can_Never_Be_Null (New_Formal)
3810 Is_Access_Constant (Etype (Old_Formal)) /=
3811 Is_Access_Constant (Etype (New_Formal)))
3813 -- It is allowed to omit the null-exclusion in case of stream
3814 -- attribute subprograms. We recognize stream subprograms
3815 -- through their TSS-generated suffix.
3818 TSS_Name : constant TSS_Name_Type := Get_TSS_Name (New_Id);
3820 if TSS_Name /= TSS_Stream_Read
3821 and then TSS_Name /= TSS_Stream_Write
3822 and then TSS_Name /= TSS_Stream_Input
3823 and then TSS_Name /= TSS_Stream_Output
3826 ("\type of & does not match!", New_Formal);
3833 -- Full conformance checks
3835 if Ctype = Fully_Conformant then
3837 -- We have checked already that names match
3839 if Parameter_Mode (Old_Formal) = E_In_Parameter then
3841 -- Check default expressions for in parameters
3844 NewD : constant Boolean :=
3845 Present (Default_Value (New_Formal));
3846 OldD : constant Boolean :=
3847 Present (Default_Value (Old_Formal));
3849 if NewD or OldD then
3851 -- The old default value has been analyzed because the
3852 -- current full declaration will have frozen everything
3853 -- before. The new default value has not been analyzed,
3854 -- so analyze it now before we check for conformance.
3857 Push_Scope (New_Id);
3858 Preanalyze_Spec_Expression
3859 (Default_Value (New_Formal), Etype (New_Formal));
3863 if not (NewD and OldD)
3864 or else not Fully_Conformant_Expressions
3865 (Default_Value (Old_Formal),
3866 Default_Value (New_Formal))
3869 ("\default expression for & does not match!",
3878 -- A couple of special checks for Ada 83 mode. These checks are
3879 -- skipped if either entity is an operator in package Standard,
3880 -- or if either old or new instance is not from the source program.
3882 if Ada_Version = Ada_83
3883 and then Sloc (Old_Id) > Standard_Location
3884 and then Sloc (New_Id) > Standard_Location
3885 and then Comes_From_Source (Old_Id)
3886 and then Comes_From_Source (New_Id)
3889 Old_Param : constant Node_Id := Declaration_Node (Old_Formal);
3890 New_Param : constant Node_Id := Declaration_Node (New_Formal);
3893 -- Explicit IN must be present or absent in both cases. This
3894 -- test is required only in the full conformance case.
3896 if In_Present (Old_Param) /= In_Present (New_Param)
3897 and then Ctype = Fully_Conformant
3900 ("\(Ada 83) IN must appear in both declarations",
3905 -- Grouping (use of comma in param lists) must be the same
3906 -- This is where we catch a misconformance like:
3909 -- A : Integer; B : Integer
3911 -- which are represented identically in the tree except
3912 -- for the setting of the flags More_Ids and Prev_Ids.
3914 if More_Ids (Old_Param) /= More_Ids (New_Param)
3915 or else Prev_Ids (Old_Param) /= Prev_Ids (New_Param)
3918 ("\grouping of & does not match!", New_Formal);
3924 -- This label is required when skipping controlling formals
3926 <<Skip_Controlling_Formal>>
3928 Next_Formal (Old_Formal);
3929 Next_Formal (New_Formal);
3932 if Present (Old_Formal) then
3933 Conformance_Error ("\too few parameters!");
3936 elsif Present (New_Formal) then
3937 Conformance_Error ("\too many parameters!", New_Formal);
3940 end Check_Conformance;
3942 -----------------------
3943 -- Check_Conventions --
3944 -----------------------
3946 procedure Check_Conventions (Typ : Entity_Id) is
3947 Ifaces_List : Elist_Id;
3949 procedure Check_Convention (Op : Entity_Id);
3950 -- Verify that the convention of inherited dispatching operation Op is
3951 -- consistent among all subprograms it overrides. In order to minimize
3952 -- the search, Search_From is utilized to designate a specific point in
3953 -- the list rather than iterating over the whole list once more.
3955 ----------------------
3956 -- Check_Convention --
3957 ----------------------
3959 procedure Check_Convention (Op : Entity_Id) is
3960 Iface_Elmt : Elmt_Id;
3961 Iface_Prim_Elmt : Elmt_Id;
3962 Iface_Prim : Entity_Id;
3965 Iface_Elmt := First_Elmt (Ifaces_List);
3966 while Present (Iface_Elmt) loop
3968 First_Elmt (Primitive_Operations (Node (Iface_Elmt)));
3969 while Present (Iface_Prim_Elmt) loop
3970 Iface_Prim := Node (Iface_Prim_Elmt);
3972 if Is_Interface_Conformant (Typ, Iface_Prim, Op)
3973 and then Convention (Iface_Prim) /= Convention (Op)
3976 ("inconsistent conventions in primitive operations", Typ);
3978 Error_Msg_Name_1 := Chars (Op);
3979 Error_Msg_Name_2 := Get_Convention_Name (Convention (Op));
3980 Error_Msg_Sloc := Sloc (Op);
3982 if Comes_From_Source (Op) then
3983 if not Is_Overriding_Operation (Op) then
3984 Error_Msg_N ("\\primitive % defined #", Typ);
3986 Error_Msg_N ("\\overriding operation % with " &
3987 "convention % defined #", Typ);
3990 else pragma Assert (Present (Alias (Op)));
3991 Error_Msg_Sloc := Sloc (Alias (Op));
3992 Error_Msg_N ("\\inherited operation % with " &
3993 "convention % defined #", Typ);
3996 Error_Msg_Name_1 := Chars (Op);
3998 Get_Convention_Name (Convention (Iface_Prim));
3999 Error_Msg_Sloc := Sloc (Iface_Prim);
4000 Error_Msg_N ("\\overridden operation % with " &
4001 "convention % defined #", Typ);
4003 -- Avoid cascading errors
4008 Next_Elmt (Iface_Prim_Elmt);
4011 Next_Elmt (Iface_Elmt);
4013 end Check_Convention;
4017 Prim_Op : Entity_Id;
4018 Prim_Op_Elmt : Elmt_Id;
4020 -- Start of processing for Check_Conventions
4023 if not Has_Interfaces (Typ) then
4027 Collect_Interfaces (Typ, Ifaces_List);
4029 -- The algorithm checks every overriding dispatching operation against
4030 -- all the corresponding overridden dispatching operations, detecting
4031 -- differences in conventions.
4033 Prim_Op_Elmt := First_Elmt (Primitive_Operations (Typ));
4034 while Present (Prim_Op_Elmt) loop
4035 Prim_Op := Node (Prim_Op_Elmt);
4037 -- A small optimization: skip the predefined dispatching operations
4038 -- since they always have the same convention.
4040 if not Is_Predefined_Dispatching_Operation (Prim_Op) then
4041 Check_Convention (Prim_Op);
4044 Next_Elmt (Prim_Op_Elmt);
4046 end Check_Conventions;
4048 ------------------------------
4049 -- Check_Delayed_Subprogram --
4050 ------------------------------
4052 procedure Check_Delayed_Subprogram (Designator : Entity_Id) is
4055 procedure Possible_Freeze (T : Entity_Id);
4056 -- T is the type of either a formal parameter or of the return type.
4057 -- If T is not yet frozen and needs a delayed freeze, then the
4058 -- subprogram itself must be delayed. If T is the limited view of an
4059 -- incomplete type the subprogram must be frozen as well, because
4060 -- T may depend on local types that have not been frozen yet.
4062 ---------------------
4063 -- Possible_Freeze --
4064 ---------------------
4066 procedure Possible_Freeze (T : Entity_Id) is
4068 if Has_Delayed_Freeze (T) and then not Is_Frozen (T) then
4069 Set_Has_Delayed_Freeze (Designator);
4071 elsif Is_Access_Type (T)
4072 and then Has_Delayed_Freeze (Designated_Type (T))
4073 and then not Is_Frozen (Designated_Type (T))
4075 Set_Has_Delayed_Freeze (Designator);
4077 elsif Ekind (T) = E_Incomplete_Type and then From_With_Type (T) then
4078 Set_Has_Delayed_Freeze (Designator);
4081 end Possible_Freeze;
4083 -- Start of processing for Check_Delayed_Subprogram
4086 -- Never need to freeze abstract subprogram
4088 if Ekind (Designator) /= E_Subprogram_Type
4089 and then Is_Abstract_Subprogram (Designator)
4093 -- Need delayed freeze if return type itself needs a delayed
4094 -- freeze and is not yet frozen.
4096 Possible_Freeze (Etype (Designator));
4097 Possible_Freeze (Base_Type (Etype (Designator))); -- needed ???
4099 -- Need delayed freeze if any of the formal types themselves need
4100 -- a delayed freeze and are not yet frozen.
4102 F := First_Formal (Designator);
4103 while Present (F) loop
4104 Possible_Freeze (Etype (F));
4105 Possible_Freeze (Base_Type (Etype (F))); -- needed ???
4110 -- Mark functions that return by reference. Note that it cannot be
4111 -- done for delayed_freeze subprograms because the underlying
4112 -- returned type may not be known yet (for private types)
4114 if not Has_Delayed_Freeze (Designator)
4115 and then Expander_Active
4118 Typ : constant Entity_Id := Etype (Designator);
4119 Utyp : constant Entity_Id := Underlying_Type (Typ);
4122 if Is_Inherently_Limited_Type (Typ) then
4123 Set_Returns_By_Ref (Designator);
4125 elsif Present (Utyp) and then CW_Or_Has_Controlled_Part (Utyp) then
4126 Set_Returns_By_Ref (Designator);
4130 end Check_Delayed_Subprogram;
4132 ------------------------------------
4133 -- Check_Discriminant_Conformance --
4134 ------------------------------------
4136 procedure Check_Discriminant_Conformance
4141 Old_Discr : Entity_Id := First_Discriminant (Prev);
4142 New_Discr : Node_Id := First (Discriminant_Specifications (N));
4143 New_Discr_Id : Entity_Id;
4144 New_Discr_Type : Entity_Id;
4146 procedure Conformance_Error (Msg : String; N : Node_Id);
4147 -- Post error message for conformance error on given node. Two messages
4148 -- are output. The first points to the previous declaration with a
4149 -- general "no conformance" message. The second is the detailed reason,
4150 -- supplied as Msg. The parameter N provide information for a possible
4151 -- & insertion in the message.
4153 -----------------------
4154 -- Conformance_Error --
4155 -----------------------
4157 procedure Conformance_Error (Msg : String; N : Node_Id) is
4159 Error_Msg_Sloc := Sloc (Prev_Loc);
4160 Error_Msg_N -- CODEFIX
4161 ("not fully conformant with declaration#!", N);
4162 Error_Msg_NE (Msg, N, N);
4163 end Conformance_Error;
4165 -- Start of processing for Check_Discriminant_Conformance
4168 while Present (Old_Discr) and then Present (New_Discr) loop
4170 New_Discr_Id := Defining_Identifier (New_Discr);
4172 -- The subtype mark of the discriminant on the full type has not
4173 -- been analyzed so we do it here. For an access discriminant a new
4176 if Nkind (Discriminant_Type (New_Discr)) = N_Access_Definition then
4178 Access_Definition (N, Discriminant_Type (New_Discr));
4181 Analyze (Discriminant_Type (New_Discr));
4182 New_Discr_Type := Etype (Discriminant_Type (New_Discr));
4184 -- Ada 2005: if the discriminant definition carries a null
4185 -- exclusion, create an itype to check properly for consistency
4186 -- with partial declaration.
4188 if Is_Access_Type (New_Discr_Type)
4189 and then Null_Exclusion_Present (New_Discr)
4192 Create_Null_Excluding_Itype
4193 (T => New_Discr_Type,
4194 Related_Nod => New_Discr,
4195 Scope_Id => Current_Scope);
4199 if not Conforming_Types
4200 (Etype (Old_Discr), New_Discr_Type, Fully_Conformant)
4202 Conformance_Error ("type of & does not match!", New_Discr_Id);
4205 -- Treat the new discriminant as an occurrence of the old one,
4206 -- for navigation purposes, and fill in some semantic
4207 -- information, for completeness.
4209 Generate_Reference (Old_Discr, New_Discr_Id, 'r');
4210 Set_Etype (New_Discr_Id, Etype (Old_Discr));
4211 Set_Scope (New_Discr_Id, Scope (Old_Discr));
4216 if Chars (Old_Discr) /= Chars (Defining_Identifier (New_Discr)) then
4217 Conformance_Error ("name & does not match!", New_Discr_Id);
4221 -- Default expressions must match
4224 NewD : constant Boolean :=
4225 Present (Expression (New_Discr));
4226 OldD : constant Boolean :=
4227 Present (Expression (Parent (Old_Discr)));
4230 if NewD or OldD then
4232 -- The old default value has been analyzed and expanded,
4233 -- because the current full declaration will have frozen
4234 -- everything before. The new default values have not been
4235 -- expanded, so expand now to check conformance.
4238 Preanalyze_Spec_Expression
4239 (Expression (New_Discr), New_Discr_Type);
4242 if not (NewD and OldD)
4243 or else not Fully_Conformant_Expressions
4244 (Expression (Parent (Old_Discr)),
4245 Expression (New_Discr))
4249 ("default expression for & does not match!",
4256 -- In Ada 83 case, grouping must match: (A,B : X) /= (A : X; B : X)
4258 if Ada_Version = Ada_83 then
4260 Old_Disc : constant Node_Id := Declaration_Node (Old_Discr);
4263 -- Grouping (use of comma in param lists) must be the same
4264 -- This is where we catch a misconformance like:
4267 -- A : Integer; B : Integer
4269 -- which are represented identically in the tree except
4270 -- for the setting of the flags More_Ids and Prev_Ids.
4272 if More_Ids (Old_Disc) /= More_Ids (New_Discr)
4273 or else Prev_Ids (Old_Disc) /= Prev_Ids (New_Discr)
4276 ("grouping of & does not match!", New_Discr_Id);
4282 Next_Discriminant (Old_Discr);
4286 if Present (Old_Discr) then
4287 Conformance_Error ("too few discriminants!", Defining_Identifier (N));
4290 elsif Present (New_Discr) then
4292 ("too many discriminants!", Defining_Identifier (New_Discr));
4295 end Check_Discriminant_Conformance;
4297 ----------------------------
4298 -- Check_Fully_Conformant --
4299 ----------------------------
4301 procedure Check_Fully_Conformant
4302 (New_Id : Entity_Id;
4304 Err_Loc : Node_Id := Empty)
4307 pragma Warnings (Off, Result);
4310 (New_Id, Old_Id, Fully_Conformant, True, Result, Err_Loc);
4311 end Check_Fully_Conformant;
4313 ---------------------------
4314 -- Check_Mode_Conformant --
4315 ---------------------------
4317 procedure Check_Mode_Conformant
4318 (New_Id : Entity_Id;
4320 Err_Loc : Node_Id := Empty;
4321 Get_Inst : Boolean := False)
4324 pragma Warnings (Off, Result);
4327 (New_Id, Old_Id, Mode_Conformant, True, Result, Err_Loc, Get_Inst);
4328 end Check_Mode_Conformant;
4330 --------------------------------
4331 -- Check_Overriding_Indicator --
4332 --------------------------------
4334 procedure Check_Overriding_Indicator
4336 Overridden_Subp : Entity_Id;
4337 Is_Primitive : Boolean)
4343 -- No overriding indicator for literals
4345 if Ekind (Subp) = E_Enumeration_Literal then
4348 elsif Ekind (Subp) = E_Entry then
4349 Decl := Parent (Subp);
4352 Decl := Unit_Declaration_Node (Subp);
4355 if Nkind_In (Decl, N_Subprogram_Body,
4356 N_Subprogram_Body_Stub,
4357 N_Subprogram_Declaration,
4358 N_Abstract_Subprogram_Declaration,
4359 N_Subprogram_Renaming_Declaration)
4361 Spec := Specification (Decl);
4363 elsif Nkind (Decl) = N_Entry_Declaration then
4370 if Present (Overridden_Subp) then
4371 if Must_Not_Override (Spec) then
4372 Error_Msg_Sloc := Sloc (Overridden_Subp);
4374 if Ekind (Subp) = E_Entry then
4376 ("entry & overrides inherited operation #", Spec, Subp);
4379 ("subprogram & overrides inherited operation #", Spec, Subp);
4382 elsif Is_Subprogram (Subp) then
4383 Set_Is_Overriding_Operation (Subp);
4386 -- If primitive flag is set or this is a protected operation, then
4387 -- the operation is overriding at the point of its declaration, so
4388 -- warn if necessary. Otherwise it may have been declared before the
4389 -- operation it overrides and no check is required.
4392 and then not Must_Override (Spec)
4393 and then (Is_Primitive
4394 or else Ekind (Scope (Subp)) = E_Protected_Type)
4396 Style.Missing_Overriding (Decl, Subp);
4399 -- If Subp is an operator, it may override a predefined operation.
4400 -- In that case overridden_subp is empty because of our implicit
4401 -- representation for predefined operators. We have to check whether the
4402 -- signature of Subp matches that of a predefined operator. Note that
4403 -- first argument provides the name of the operator, and the second
4404 -- argument the signature that may match that of a standard operation.
4405 -- If the indicator is overriding, then the operator must match a
4406 -- predefined signature, because we know already that there is no
4407 -- explicit overridden operation.
4409 elsif Nkind (Subp) = N_Defining_Operator_Symbol then
4411 if Must_Not_Override (Spec) then
4413 -- If this is not a primitive operation or protected subprogram,
4414 -- then "not overriding" is illegal.
4417 and then Ekind (Scope (Subp)) /= E_Protected_Type
4420 ("overriding indicator only allowed "
4421 & "if subprogram is primitive", Subp);
4423 elsif Operator_Matches_Spec (Subp, Subp) then
4425 ("subprogram & overrides predefined operator ", Spec, Subp);
4428 elsif Must_Override (Spec) then
4429 if Is_Overriding_Operation (Subp) then
4430 Set_Is_Overriding_Operation (Subp);
4432 elsif not Operator_Matches_Spec (Subp, Subp) then
4433 Error_Msg_NE ("subprogram & is not overriding", Spec, Subp);
4436 elsif not Error_Posted (Subp)
4437 and then Style_Check
4438 and then Operator_Matches_Spec (Subp, Subp)
4440 not Is_Predefined_File_Name
4441 (Unit_File_Name (Get_Source_Unit (Subp)))
4443 Set_Is_Overriding_Operation (Subp);
4445 -- If style checks are enabled, indicate that the indicator is
4446 -- missing. However, at the point of declaration, the type of
4447 -- which this is a primitive operation may be private, in which
4448 -- case the indicator would be premature.
4450 if Has_Private_Declaration (Etype (Subp))
4451 or else Has_Private_Declaration (Etype (First_Formal (Subp)))
4455 Style.Missing_Overriding (Decl, Subp);
4459 elsif Must_Override (Spec) then
4460 if Ekind (Subp) = E_Entry then
4461 Error_Msg_NE ("entry & is not overriding", Spec, Subp);
4463 Error_Msg_NE ("subprogram & is not overriding", Spec, Subp);
4466 -- If the operation is marked "not overriding" and it's not primitive
4467 -- then an error is issued, unless this is an operation of a task or
4468 -- protected type (RM05-8.3.1(3/2-4/2)). Error cases where "overriding"
4469 -- has been specified have already been checked above.
4471 elsif Must_Not_Override (Spec)
4472 and then not Is_Primitive
4473 and then Ekind (Subp) /= E_Entry
4474 and then Ekind (Scope (Subp)) /= E_Protected_Type
4477 ("overriding indicator only allowed if subprogram is primitive",
4481 end Check_Overriding_Indicator;
4487 -- Note: this procedure needs to know far too much about how the expander
4488 -- messes with exceptions. The use of the flag Exception_Junk and the
4489 -- incorporation of knowledge of Exp_Ch11.Expand_Local_Exception_Handlers
4490 -- works, but is not very clean. It would be better if the expansion
4491 -- routines would leave Original_Node working nicely, and we could use
4492 -- Original_Node here to ignore all the peculiar expander messing ???
4494 procedure Check_Returns
4498 Proc : Entity_Id := Empty)
4502 procedure Check_Statement_Sequence (L : List_Id);
4503 -- Internal recursive procedure to check a list of statements for proper
4504 -- termination by a return statement (or a transfer of control or a
4505 -- compound statement that is itself internally properly terminated).
4507 ------------------------------
4508 -- Check_Statement_Sequence --
4509 ------------------------------
4511 procedure Check_Statement_Sequence (L : List_Id) is
4516 Raise_Exception_Call : Boolean;
4517 -- Set True if statement sequence terminated by Raise_Exception call
4518 -- or a Reraise_Occurrence call.
4521 Raise_Exception_Call := False;
4523 -- Get last real statement
4525 Last_Stm := Last (L);
4527 -- Deal with digging out exception handler statement sequences that
4528 -- have been transformed by the local raise to goto optimization.
4529 -- See Exp_Ch11.Expand_Local_Exception_Handlers for details. If this
4530 -- optimization has occurred, we are looking at something like:
4533 -- original stmts in block
4537 -- goto L1; | omitted if No_Exception_Propagation
4542 -- goto L3; -- skip handler when exception not raised
4544 -- <<L1>> -- target label for local exception
4558 -- and what we have to do is to dig out the estmts1 and estmts2
4559 -- sequences (which were the original sequences of statements in
4560 -- the exception handlers) and check them.
4562 if Nkind (Last_Stm) = N_Label
4563 and then Exception_Junk (Last_Stm)
4569 exit when Nkind (Stm) /= N_Block_Statement;
4570 exit when not Exception_Junk (Stm);
4573 exit when Nkind (Stm) /= N_Label;
4574 exit when not Exception_Junk (Stm);
4575 Check_Statement_Sequence
4576 (Statements (Handled_Statement_Sequence (Next (Stm))));
4581 exit when Nkind (Stm) /= N_Goto_Statement;
4582 exit when not Exception_Junk (Stm);
4586 -- Don't count pragmas
4588 while Nkind (Last_Stm) = N_Pragma
4590 -- Don't count call to SS_Release (can happen after Raise_Exception)
4593 (Nkind (Last_Stm) = N_Procedure_Call_Statement
4595 Nkind (Name (Last_Stm)) = N_Identifier
4597 Is_RTE (Entity (Name (Last_Stm)), RE_SS_Release))
4599 -- Don't count exception junk
4602 (Nkind_In (Last_Stm, N_Goto_Statement,
4604 N_Object_Declaration)
4605 and then Exception_Junk (Last_Stm))
4606 or else Nkind (Last_Stm) in N_Push_xxx_Label
4607 or else Nkind (Last_Stm) in N_Pop_xxx_Label
4612 -- Here we have the "real" last statement
4614 Kind := Nkind (Last_Stm);
4616 -- Transfer of control, OK. Note that in the No_Return procedure
4617 -- case, we already diagnosed any explicit return statements, so
4618 -- we can treat them as OK in this context.
4620 if Is_Transfer (Last_Stm) then
4623 -- Check cases of explicit non-indirect procedure calls
4625 elsif Kind = N_Procedure_Call_Statement
4626 and then Is_Entity_Name (Name (Last_Stm))
4628 -- Check call to Raise_Exception procedure which is treated
4629 -- specially, as is a call to Reraise_Occurrence.
4631 -- We suppress the warning in these cases since it is likely that
4632 -- the programmer really does not expect to deal with the case
4633 -- of Null_Occurrence, and thus would find a warning about a
4634 -- missing return curious, and raising Program_Error does not
4635 -- seem such a bad behavior if this does occur.
4637 -- Note that in the Ada 2005 case for Raise_Exception, the actual
4638 -- behavior will be to raise Constraint_Error (see AI-329).
4640 if Is_RTE (Entity (Name (Last_Stm)), RE_Raise_Exception)
4642 Is_RTE (Entity (Name (Last_Stm)), RE_Reraise_Occurrence)
4644 Raise_Exception_Call := True;
4646 -- For Raise_Exception call, test first argument, if it is
4647 -- an attribute reference for a 'Identity call, then we know
4648 -- that the call cannot possibly return.
4651 Arg : constant Node_Id :=
4652 Original_Node (First_Actual (Last_Stm));
4654 if Nkind (Arg) = N_Attribute_Reference
4655 and then Attribute_Name (Arg) = Name_Identity
4662 -- If statement, need to look inside if there is an else and check
4663 -- each constituent statement sequence for proper termination.
4665 elsif Kind = N_If_Statement
4666 and then Present (Else_Statements (Last_Stm))
4668 Check_Statement_Sequence (Then_Statements (Last_Stm));
4669 Check_Statement_Sequence (Else_Statements (Last_Stm));
4671 if Present (Elsif_Parts (Last_Stm)) then
4673 Elsif_Part : Node_Id := First (Elsif_Parts (Last_Stm));
4676 while Present (Elsif_Part) loop
4677 Check_Statement_Sequence (Then_Statements (Elsif_Part));
4685 -- Case statement, check each case for proper termination
4687 elsif Kind = N_Case_Statement then
4691 Case_Alt := First_Non_Pragma (Alternatives (Last_Stm));
4692 while Present (Case_Alt) loop
4693 Check_Statement_Sequence (Statements (Case_Alt));
4694 Next_Non_Pragma (Case_Alt);
4700 -- Block statement, check its handled sequence of statements
4702 elsif Kind = N_Block_Statement then
4708 (Handled_Statement_Sequence (Last_Stm), Mode, Err1);
4717 -- Loop statement. If there is an iteration scheme, we can definitely
4718 -- fall out of the loop. Similarly if there is an exit statement, we
4719 -- can fall out. In either case we need a following return.
4721 elsif Kind = N_Loop_Statement then
4722 if Present (Iteration_Scheme (Last_Stm))
4723 or else Has_Exit (Entity (Identifier (Last_Stm)))
4727 -- A loop with no exit statement or iteration scheme is either
4728 -- an infinite loop, or it has some other exit (raise/return).
4729 -- In either case, no warning is required.
4735 -- Timed entry call, check entry call and delay alternatives
4737 -- Note: in expanded code, the timed entry call has been converted
4738 -- to a set of expanded statements on which the check will work
4739 -- correctly in any case.
4741 elsif Kind = N_Timed_Entry_Call then
4743 ECA : constant Node_Id := Entry_Call_Alternative (Last_Stm);
4744 DCA : constant Node_Id := Delay_Alternative (Last_Stm);
4747 -- If statement sequence of entry call alternative is missing,
4748 -- then we can definitely fall through, and we post the error
4749 -- message on the entry call alternative itself.
4751 if No (Statements (ECA)) then
4754 -- If statement sequence of delay alternative is missing, then
4755 -- we can definitely fall through, and we post the error
4756 -- message on the delay alternative itself.
4758 -- Note: if both ECA and DCA are missing the return, then we
4759 -- post only one message, should be enough to fix the bugs.
4760 -- If not we will get a message next time on the DCA when the
4763 elsif No (Statements (DCA)) then
4766 -- Else check both statement sequences
4769 Check_Statement_Sequence (Statements (ECA));
4770 Check_Statement_Sequence (Statements (DCA));
4775 -- Conditional entry call, check entry call and else part
4777 -- Note: in expanded code, the conditional entry call has been
4778 -- converted to a set of expanded statements on which the check
4779 -- will work correctly in any case.
4781 elsif Kind = N_Conditional_Entry_Call then
4783 ECA : constant Node_Id := Entry_Call_Alternative (Last_Stm);
4786 -- If statement sequence of entry call alternative is missing,
4787 -- then we can definitely fall through, and we post the error
4788 -- message on the entry call alternative itself.
4790 if No (Statements (ECA)) then
4793 -- Else check statement sequence and else part
4796 Check_Statement_Sequence (Statements (ECA));
4797 Check_Statement_Sequence (Else_Statements (Last_Stm));
4803 -- If we fall through, issue appropriate message
4806 if not Raise_Exception_Call then
4808 ("?RETURN statement missing following this statement!",
4811 ("\?Program_Error may be raised at run time!",
4815 -- Note: we set Err even though we have not issued a warning
4816 -- because we still have a case of a missing return. This is
4817 -- an extremely marginal case, probably will never be noticed
4818 -- but we might as well get it right.
4822 -- Otherwise we have the case of a procedure marked No_Return
4825 if not Raise_Exception_Call then
4827 ("?implied return after this statement " &
4828 "will raise Program_Error",
4831 ("\?procedure & is marked as No_Return!",
4836 RE : constant Node_Id :=
4837 Make_Raise_Program_Error (Sloc (Last_Stm),
4838 Reason => PE_Implicit_Return);
4840 Insert_After (Last_Stm, RE);
4844 end Check_Statement_Sequence;
4846 -- Start of processing for Check_Returns
4850 Check_Statement_Sequence (Statements (HSS));
4852 if Present (Exception_Handlers (HSS)) then
4853 Handler := First_Non_Pragma (Exception_Handlers (HSS));
4854 while Present (Handler) loop
4855 Check_Statement_Sequence (Statements (Handler));
4856 Next_Non_Pragma (Handler);
4861 ----------------------------
4862 -- Check_Subprogram_Order --
4863 ----------------------------
4865 procedure Check_Subprogram_Order (N : Node_Id) is
4867 function Subprogram_Name_Greater (S1, S2 : String) return Boolean;
4868 -- This is used to check if S1 > S2 in the sense required by this
4869 -- test, for example nameab < namec, but name2 < name10.
4871 -----------------------------
4872 -- Subprogram_Name_Greater --
4873 -----------------------------
4875 function Subprogram_Name_Greater (S1, S2 : String) return Boolean is
4880 -- Remove trailing numeric parts
4883 while S1 (L1) in '0' .. '9' loop
4888 while S2 (L2) in '0' .. '9' loop
4892 -- If non-numeric parts non-equal, that's decisive
4894 if S1 (S1'First .. L1) < S2 (S2'First .. L2) then
4897 elsif S1 (S1'First .. L1) > S2 (S2'First .. L2) then
4900 -- If non-numeric parts equal, compare suffixed numeric parts. Note
4901 -- that a missing suffix is treated as numeric zero in this test.
4905 while L1 < S1'Last loop
4907 N1 := N1 * 10 + Character'Pos (S1 (L1)) - Character'Pos ('0');
4911 while L2 < S2'Last loop
4913 N2 := N2 * 10 + Character'Pos (S2 (L2)) - Character'Pos ('0');
4918 end Subprogram_Name_Greater;
4920 -- Start of processing for Check_Subprogram_Order
4923 -- Check body in alpha order if this is option
4926 and then Style_Check_Order_Subprograms
4927 and then Nkind (N) = N_Subprogram_Body
4928 and then Comes_From_Source (N)
4929 and then In_Extended_Main_Source_Unit (N)
4933 renames Scope_Stack.Table
4934 (Scope_Stack.Last).Last_Subprogram_Name;
4936 Body_Id : constant Entity_Id :=
4937 Defining_Entity (Specification (N));
4940 Get_Decoded_Name_String (Chars (Body_Id));
4943 if Subprogram_Name_Greater
4944 (LSN.all, Name_Buffer (1 .. Name_Len))
4946 Style.Subprogram_Not_In_Alpha_Order (Body_Id);
4952 LSN := new String'(Name_Buffer (1 .. Name_Len));
4955 end Check_Subprogram_Order;
4957 ------------------------------
4958 -- Check_Subtype_Conformant --
4959 ------------------------------
4961 procedure Check_Subtype_Conformant
4962 (New_Id : Entity_Id;
4964 Err_Loc : Node_Id := Empty;
4965 Skip_Controlling_Formals : Boolean := False)
4968 pragma Warnings (Off, Result);
4971 (New_Id, Old_Id, Subtype_Conformant, True, Result, Err_Loc,
4972 Skip_Controlling_Formals => Skip_Controlling_Formals);
4973 end Check_Subtype_Conformant;
4975 ---------------------------
4976 -- Check_Type_Conformant --
4977 ---------------------------
4979 procedure Check_Type_Conformant
4980 (New_Id : Entity_Id;
4982 Err_Loc : Node_Id := Empty)
4985 pragma Warnings (Off, Result);
4988 (New_Id, Old_Id, Type_Conformant, True, Result, Err_Loc);
4989 end Check_Type_Conformant;
4991 ----------------------
4992 -- Conforming_Types --
4993 ----------------------
4995 function Conforming_Types
4998 Ctype : Conformance_Type;
4999 Get_Inst : Boolean := False) return Boolean
5001 Type_1 : Entity_Id := T1;
5002 Type_2 : Entity_Id := T2;
5003 Are_Anonymous_Access_To_Subprogram_Types : Boolean := False;
5005 function Base_Types_Match (T1, T2 : Entity_Id) return Boolean;
5006 -- If neither T1 nor T2 are generic actual types, or if they are in
5007 -- different scopes (e.g. parent and child instances), then verify that
5008 -- the base types are equal. Otherwise T1 and T2 must be on the same
5009 -- subtype chain. The whole purpose of this procedure is to prevent
5010 -- spurious ambiguities in an instantiation that may arise if two
5011 -- distinct generic types are instantiated with the same actual.
5013 function Find_Designated_Type (T : Entity_Id) return Entity_Id;
5014 -- An access parameter can designate an incomplete type. If the
5015 -- incomplete type is the limited view of a type from a limited_
5016 -- with_clause, check whether the non-limited view is available. If
5017 -- it is a (non-limited) incomplete type, get the full view.
5019 function Matches_Limited_With_View (T1, T2 : Entity_Id) return Boolean;
5020 -- Returns True if and only if either T1 denotes a limited view of T2
5021 -- or T2 denotes a limited view of T1. This can arise when the limited
5022 -- with view of a type is used in a subprogram declaration and the
5023 -- subprogram body is in the scope of a regular with clause for the
5024 -- same unit. In such a case, the two type entities can be considered
5025 -- identical for purposes of conformance checking.
5027 ----------------------
5028 -- Base_Types_Match --
5029 ----------------------
5031 function Base_Types_Match (T1, T2 : Entity_Id) return Boolean is
5036 elsif Base_Type (T1) = Base_Type (T2) then
5038 -- The following is too permissive. A more precise test should
5039 -- check that the generic actual is an ancestor subtype of the
5042 return not Is_Generic_Actual_Type (T1)
5043 or else not Is_Generic_Actual_Type (T2)
5044 or else Scope (T1) /= Scope (T2);
5049 end Base_Types_Match;
5051 --------------------------
5052 -- Find_Designated_Type --
5053 --------------------------
5055 function Find_Designated_Type (T : Entity_Id) return Entity_Id is
5059 Desig := Directly_Designated_Type (T);
5061 if Ekind (Desig) = E_Incomplete_Type then
5063 -- If regular incomplete type, get full view if available
5065 if Present (Full_View (Desig)) then
5066 Desig := Full_View (Desig);
5068 -- If limited view of a type, get non-limited view if available,
5069 -- and check again for a regular incomplete type.
5071 elsif Present (Non_Limited_View (Desig)) then
5072 Desig := Get_Full_View (Non_Limited_View (Desig));
5077 end Find_Designated_Type;
5079 -------------------------------
5080 -- Matches_Limited_With_View --
5081 -------------------------------
5083 function Matches_Limited_With_View (T1, T2 : Entity_Id) return Boolean is
5085 -- In some cases a type imported through a limited_with clause, and
5086 -- its nonlimited view are both visible, for example in an anonymous
5087 -- access-to-class-wide type in a formal. Both entities designate the
5090 if From_With_Type (T1)
5091 and then T2 = Available_View (T1)
5095 elsif From_With_Type (T2)
5096 and then T1 = Available_View (T2)
5103 end Matches_Limited_With_View;
5105 -- Start of processing for Conforming_Types
5108 -- The context is an instance association for a formal
5109 -- access-to-subprogram type; the formal parameter types require
5110 -- mapping because they may denote other formal parameters of the
5114 Type_1 := Get_Instance_Of (T1);
5115 Type_2 := Get_Instance_Of (T2);
5118 -- If one of the types is a view of the other introduced by a limited
5119 -- with clause, treat these as conforming for all purposes.
5121 if Matches_Limited_With_View (T1, T2) then
5124 elsif Base_Types_Match (Type_1, Type_2) then
5125 return Ctype <= Mode_Conformant
5126 or else Subtypes_Statically_Match (Type_1, Type_2);
5128 elsif Is_Incomplete_Or_Private_Type (Type_1)
5129 and then Present (Full_View (Type_1))
5130 and then Base_Types_Match (Full_View (Type_1), Type_2)
5132 return Ctype <= Mode_Conformant
5133 or else Subtypes_Statically_Match (Full_View (Type_1), Type_2);
5135 elsif Ekind (Type_2) = E_Incomplete_Type
5136 and then Present (Full_View (Type_2))
5137 and then Base_Types_Match (Type_1, Full_View (Type_2))
5139 return Ctype <= Mode_Conformant
5140 or else Subtypes_Statically_Match (Type_1, Full_View (Type_2));
5142 elsif Is_Private_Type (Type_2)
5143 and then In_Instance
5144 and then Present (Full_View (Type_2))
5145 and then Base_Types_Match (Type_1, Full_View (Type_2))
5147 return Ctype <= Mode_Conformant
5148 or else Subtypes_Statically_Match (Type_1, Full_View (Type_2));
5151 -- Ada 2005 (AI-254): Anonymous access-to-subprogram types must be
5152 -- treated recursively because they carry a signature.
5154 Are_Anonymous_Access_To_Subprogram_Types :=
5155 Ekind (Type_1) = Ekind (Type_2)
5157 (Ekind (Type_1) = E_Anonymous_Access_Subprogram_Type
5159 Ekind (Type_1) = E_Anonymous_Access_Protected_Subprogram_Type);
5161 -- Test anonymous access type case. For this case, static subtype
5162 -- matching is required for mode conformance (RM 6.3.1(15)). We check
5163 -- the base types because we may have built internal subtype entities
5164 -- to handle null-excluding types (see Process_Formals).
5166 if (Ekind (Base_Type (Type_1)) = E_Anonymous_Access_Type
5168 Ekind (Base_Type (Type_2)) = E_Anonymous_Access_Type)
5169 or else Are_Anonymous_Access_To_Subprogram_Types -- Ada 2005 (AI-254)
5172 Desig_1 : Entity_Id;
5173 Desig_2 : Entity_Id;
5176 -- In Ada2005, access constant indicators must match for
5177 -- subtype conformance.
5179 if Ada_Version >= Ada_05
5180 and then Ctype >= Subtype_Conformant
5182 Is_Access_Constant (Type_1) /= Is_Access_Constant (Type_2)
5187 Desig_1 := Find_Designated_Type (Type_1);
5189 Desig_2 := Find_Designated_Type (Type_2);
5191 -- If the context is an instance association for a formal
5192 -- access-to-subprogram type; formal access parameter designated
5193 -- types require mapping because they may denote other formal
5194 -- parameters of the generic unit.
5197 Desig_1 := Get_Instance_Of (Desig_1);
5198 Desig_2 := Get_Instance_Of (Desig_2);
5201 -- It is possible for a Class_Wide_Type to be introduced for an
5202 -- incomplete type, in which case there is a separate class_ wide
5203 -- type for the full view. The types conform if their Etypes
5204 -- conform, i.e. one may be the full view of the other. This can
5205 -- only happen in the context of an access parameter, other uses
5206 -- of an incomplete Class_Wide_Type are illegal.
5208 if Is_Class_Wide_Type (Desig_1)
5209 and then Is_Class_Wide_Type (Desig_2)
5213 (Etype (Base_Type (Desig_1)),
5214 Etype (Base_Type (Desig_2)), Ctype);
5216 elsif Are_Anonymous_Access_To_Subprogram_Types then
5217 if Ada_Version < Ada_05 then
5218 return Ctype = Type_Conformant
5220 Subtypes_Statically_Match (Desig_1, Desig_2);
5222 -- We must check the conformance of the signatures themselves
5226 Conformant : Boolean;
5229 (Desig_1, Desig_2, Ctype, False, Conformant);
5235 return Base_Type (Desig_1) = Base_Type (Desig_2)
5236 and then (Ctype = Type_Conformant
5238 Subtypes_Statically_Match (Desig_1, Desig_2));
5242 -- Otherwise definitely no match
5245 if ((Ekind (Type_1) = E_Anonymous_Access_Type
5246 and then Is_Access_Type (Type_2))
5247 or else (Ekind (Type_2) = E_Anonymous_Access_Type
5248 and then Is_Access_Type (Type_1)))
5251 (Designated_Type (Type_1), Designated_Type (Type_2), Ctype)
5253 May_Hide_Profile := True;
5258 end Conforming_Types;
5260 --------------------------
5261 -- Create_Extra_Formals --
5262 --------------------------
5264 procedure Create_Extra_Formals (E : Entity_Id) is
5266 First_Extra : Entity_Id := Empty;
5267 Last_Extra : Entity_Id;
5268 Formal_Type : Entity_Id;
5269 P_Formal : Entity_Id := Empty;
5271 function Add_Extra_Formal
5272 (Assoc_Entity : Entity_Id;
5275 Suffix : String) return Entity_Id;
5276 -- Add an extra formal to the current list of formals and extra formals.
5277 -- The extra formal is added to the end of the list of extra formals,
5278 -- and also returned as the result. These formals are always of mode IN.
5279 -- The new formal has the type Typ, is declared in Scope, and its name
5280 -- is given by a concatenation of the name of Assoc_Entity and Suffix.
5282 ----------------------
5283 -- Add_Extra_Formal --
5284 ----------------------
5286 function Add_Extra_Formal
5287 (Assoc_Entity : Entity_Id;
5290 Suffix : String) return Entity_Id
5292 EF : constant Entity_Id :=
5293 Make_Defining_Identifier (Sloc (Assoc_Entity),
5294 Chars => New_External_Name (Chars (Assoc_Entity),
5298 -- A little optimization. Never generate an extra formal for the
5299 -- _init operand of an initialization procedure, since it could
5302 if Chars (Formal) = Name_uInit then
5306 Set_Ekind (EF, E_In_Parameter);
5307 Set_Actual_Subtype (EF, Typ);
5308 Set_Etype (EF, Typ);
5309 Set_Scope (EF, Scope);
5310 Set_Mechanism (EF, Default_Mechanism);
5311 Set_Formal_Validity (EF);
5313 if No (First_Extra) then
5315 Set_Extra_Formals (Scope, First_Extra);
5318 if Present (Last_Extra) then
5319 Set_Extra_Formal (Last_Extra, EF);
5325 end Add_Extra_Formal;
5327 -- Start of processing for Create_Extra_Formals
5330 -- We never generate extra formals if expansion is not active
5331 -- because we don't need them unless we are generating code.
5333 if not Expander_Active then
5337 -- If this is a derived subprogram then the subtypes of the parent
5338 -- subprogram's formal parameters will be used to determine the need
5339 -- for extra formals.
5341 if Is_Overloadable (E) and then Present (Alias (E)) then
5342 P_Formal := First_Formal (Alias (E));
5345 Last_Extra := Empty;
5346 Formal := First_Formal (E);
5347 while Present (Formal) loop
5348 Last_Extra := Formal;
5349 Next_Formal (Formal);
5352 -- If Extra_formals were already created, don't do it again. This
5353 -- situation may arise for subprogram types created as part of
5354 -- dispatching calls (see Expand_Dispatching_Call)
5356 if Present (Last_Extra) and then
5357 Present (Extra_Formal (Last_Extra))
5362 -- If the subprogram is a predefined dispatching subprogram then don't
5363 -- generate any extra constrained or accessibility level formals. In
5364 -- general we suppress these for internal subprograms (by not calling
5365 -- Freeze_Subprogram and Create_Extra_Formals at all), but internally
5366 -- generated stream attributes do get passed through because extra
5367 -- build-in-place formals are needed in some cases (limited 'Input).
5369 if Is_Predefined_Dispatching_Operation (E) then
5370 goto Test_For_BIP_Extras;
5373 Formal := First_Formal (E);
5374 while Present (Formal) loop
5376 -- Create extra formal for supporting the attribute 'Constrained.
5377 -- The case of a private type view without discriminants also
5378 -- requires the extra formal if the underlying type has defaulted
5381 if Ekind (Formal) /= E_In_Parameter then
5382 if Present (P_Formal) then
5383 Formal_Type := Etype (P_Formal);
5385 Formal_Type := Etype (Formal);
5388 -- Do not produce extra formals for Unchecked_Union parameters.
5389 -- Jump directly to the end of the loop.
5391 if Is_Unchecked_Union (Base_Type (Formal_Type)) then
5392 goto Skip_Extra_Formal_Generation;
5395 if not Has_Discriminants (Formal_Type)
5396 and then Ekind (Formal_Type) in Private_Kind
5397 and then Present (Underlying_Type (Formal_Type))
5399 Formal_Type := Underlying_Type (Formal_Type);
5402 if Has_Discriminants (Formal_Type)
5403 and then not Is_Constrained (Formal_Type)
5404 and then not Is_Indefinite_Subtype (Formal_Type)
5406 Set_Extra_Constrained
5407 (Formal, Add_Extra_Formal (Formal, Standard_Boolean, E, "F"));
5411 -- Create extra formal for supporting accessibility checking. This
5412 -- is done for both anonymous access formals and formals of named
5413 -- access types that are marked as controlling formals. The latter
5414 -- case can occur when Expand_Dispatching_Call creates a subprogram
5415 -- type and substitutes the types of access-to-class-wide actuals
5416 -- for the anonymous access-to-specific-type of controlling formals.
5417 -- Base_Type is applied because in cases where there is a null
5418 -- exclusion the formal may have an access subtype.
5420 -- This is suppressed if we specifically suppress accessibility
5421 -- checks at the package level for either the subprogram, or the
5422 -- package in which it resides. However, we do not suppress it
5423 -- simply if the scope has accessibility checks suppressed, since
5424 -- this could cause trouble when clients are compiled with a
5425 -- different suppression setting. The explicit checks at the
5426 -- package level are safe from this point of view.
5428 if (Ekind (Base_Type (Etype (Formal))) = E_Anonymous_Access_Type
5429 or else (Is_Controlling_Formal (Formal)
5430 and then Is_Access_Type (Base_Type (Etype (Formal)))))
5432 (Explicit_Suppress (E, Accessibility_Check)
5434 Explicit_Suppress (Scope (E), Accessibility_Check))
5437 or else Present (Extra_Accessibility (P_Formal)))
5439 -- Temporary kludge: for now we avoid creating the extra formal
5440 -- for access parameters of protected operations because of
5441 -- problem with the case of internal protected calls. ???
5443 if Nkind (Parent (Parent (Parent (E)))) /= N_Protected_Definition
5444 and then Nkind (Parent (Parent (Parent (E)))) /= N_Protected_Body
5446 Set_Extra_Accessibility
5447 (Formal, Add_Extra_Formal (Formal, Standard_Natural, E, "F"));
5451 -- This label is required when skipping extra formal generation for
5452 -- Unchecked_Union parameters.
5454 <<Skip_Extra_Formal_Generation>>
5456 if Present (P_Formal) then
5457 Next_Formal (P_Formal);
5460 Next_Formal (Formal);
5463 <<Test_For_BIP_Extras>>
5465 -- Ada 2005 (AI-318-02): In the case of build-in-place functions, add
5466 -- appropriate extra formals. See type Exp_Ch6.BIP_Formal_Kind.
5468 if Ada_Version >= Ada_05 and then Is_Build_In_Place_Function (E) then
5470 Result_Subt : constant Entity_Id := Etype (E);
5472 Discard : Entity_Id;
5473 pragma Warnings (Off, Discard);
5476 -- In the case of functions with unconstrained result subtypes,
5477 -- add a 3-state formal indicating whether the return object is
5478 -- allocated by the caller (0), or should be allocated by the
5479 -- callee on the secondary stack (1) or in the global heap (2).
5480 -- For the moment we just use Natural for the type of this formal.
5481 -- Note that this formal isn't usually needed in the case where
5482 -- the result subtype is constrained, but it is needed when the
5483 -- function has a tagged result, because generally such functions
5484 -- can be called in a dispatching context and such calls must be
5485 -- handled like calls to a class-wide function.
5487 if not Is_Constrained (Underlying_Type (Result_Subt))
5488 or else Is_Tagged_Type (Underlying_Type (Result_Subt))
5492 (E, Standard_Natural,
5493 E, BIP_Formal_Suffix (BIP_Alloc_Form));
5496 -- In the case of functions whose result type has controlled
5497 -- parts, we have an extra formal of type
5498 -- System.Finalization_Implementation.Finalizable_Ptr_Ptr. That
5499 -- is, we are passing a pointer to a finalization list (which is
5500 -- itself a pointer). This extra formal is then passed along to
5501 -- Move_Final_List in case of successful completion of a return
5502 -- statement. We cannot pass an 'in out' parameter, because we
5503 -- need to update the finalization list during an abort-deferred
5504 -- region, rather than using copy-back after the function
5505 -- returns. This is true even if we are able to get away with
5506 -- having 'in out' parameters, which are normally illegal for
5507 -- functions. This formal is also needed when the function has
5510 if Needs_BIP_Final_List (E) then
5513 (E, RTE (RE_Finalizable_Ptr_Ptr),
5514 E, BIP_Formal_Suffix (BIP_Final_List));
5517 -- If the result type contains tasks, we have two extra formals:
5518 -- the master of the tasks to be created, and the caller's
5519 -- activation chain.
5521 if Has_Task (Result_Subt) then
5524 (E, RTE (RE_Master_Id),
5525 E, BIP_Formal_Suffix (BIP_Master));
5528 (E, RTE (RE_Activation_Chain_Access),
5529 E, BIP_Formal_Suffix (BIP_Activation_Chain));
5532 -- All build-in-place functions get an extra formal that will be
5533 -- passed the address of the return object within the caller.
5536 Formal_Type : constant Entity_Id :=
5538 (E_Anonymous_Access_Type, E,
5539 Scope_Id => Scope (E));
5541 Set_Directly_Designated_Type (Formal_Type, Result_Subt);
5542 Set_Etype (Formal_Type, Formal_Type);
5543 Set_Depends_On_Private
5544 (Formal_Type, Has_Private_Component (Formal_Type));
5545 Set_Is_Public (Formal_Type, Is_Public (Scope (Formal_Type)));
5546 Set_Is_Access_Constant (Formal_Type, False);
5548 -- Ada 2005 (AI-50217): Propagate the attribute that indicates
5549 -- the designated type comes from the limited view (for
5550 -- back-end purposes).
5552 Set_From_With_Type (Formal_Type, From_With_Type (Result_Subt));
5554 Layout_Type (Formal_Type);
5558 (E, Formal_Type, E, BIP_Formal_Suffix (BIP_Object_Access));
5562 end Create_Extra_Formals;
5564 -----------------------------
5565 -- Enter_Overloaded_Entity --
5566 -----------------------------
5568 procedure Enter_Overloaded_Entity (S : Entity_Id) is
5569 E : Entity_Id := Current_Entity_In_Scope (S);
5570 C_E : Entity_Id := Current_Entity (S);
5574 Set_Has_Homonym (E);
5575 Set_Has_Homonym (S);
5578 Set_Is_Immediately_Visible (S);
5579 Set_Scope (S, Current_Scope);
5581 -- Chain new entity if front of homonym in current scope, so that
5582 -- homonyms are contiguous.
5587 while Homonym (C_E) /= E loop
5588 C_E := Homonym (C_E);
5591 Set_Homonym (C_E, S);
5595 Set_Current_Entity (S);
5600 Append_Entity (S, Current_Scope);
5601 Set_Public_Status (S);
5603 if Debug_Flag_E then
5604 Write_Str ("New overloaded entity chain: ");
5605 Write_Name (Chars (S));
5608 while Present (E) loop
5609 Write_Str (" "); Write_Int (Int (E));
5616 -- Generate warning for hiding
5619 and then Comes_From_Source (S)
5620 and then In_Extended_Main_Source_Unit (S)
5627 -- Warn unless genuine overloading
5629 if (not Is_Overloadable (E) or else Subtype_Conformant (E, S))
5630 and then (Is_Immediately_Visible (E)
5632 Is_Potentially_Use_Visible (S))
5634 Error_Msg_Sloc := Sloc (E);
5635 Error_Msg_N ("declaration of & hides one#?", S);
5639 end Enter_Overloaded_Entity;
5641 -----------------------------
5642 -- Find_Corresponding_Spec --
5643 -----------------------------
5645 function Find_Corresponding_Spec
5647 Post_Error : Boolean := True) return Entity_Id
5649 Spec : constant Node_Id := Specification (N);
5650 Designator : constant Entity_Id := Defining_Entity (Spec);
5655 E := Current_Entity (Designator);
5656 while Present (E) loop
5658 -- We are looking for a matching spec. It must have the same scope,
5659 -- and the same name, and either be type conformant, or be the case
5660 -- of a library procedure spec and its body (which belong to one
5661 -- another regardless of whether they are type conformant or not).
5663 if Scope (E) = Current_Scope then
5664 if Current_Scope = Standard_Standard
5665 or else (Ekind (E) = Ekind (Designator)
5666 and then Type_Conformant (E, Designator))
5668 -- Within an instantiation, we know that spec and body are
5669 -- subtype conformant, because they were subtype conformant
5670 -- in the generic. We choose the subtype-conformant entity
5671 -- here as well, to resolve spurious ambiguities in the
5672 -- instance that were not present in the generic (i.e. when
5673 -- two different types are given the same actual). If we are
5674 -- looking for a spec to match a body, full conformance is
5678 Set_Convention (Designator, Convention (E));
5680 if Nkind (N) = N_Subprogram_Body
5681 and then Present (Homonym (E))
5682 and then not Fully_Conformant (E, Designator)
5686 elsif not Subtype_Conformant (E, Designator) then
5691 if not Has_Completion (E) then
5692 if Nkind (N) /= N_Subprogram_Body_Stub then
5693 Set_Corresponding_Spec (N, E);
5696 Set_Has_Completion (E);
5699 elsif Nkind (Parent (N)) = N_Subunit then
5701 -- If this is the proper body of a subunit, the completion
5702 -- flag is set when analyzing the stub.
5706 -- If E is an internal function with a controlling result
5707 -- that was created for an operation inherited by a null
5708 -- extension, it may be overridden by a body without a previous
5709 -- spec (one more reason why these should be shunned). In that
5710 -- case remove the generated body, because the current one is
5711 -- the explicit overriding.
5713 elsif Ekind (E) = E_Function
5714 and then Ada_Version >= Ada_05
5715 and then not Comes_From_Source (E)
5716 and then Has_Controlling_Result (E)
5717 and then Is_Null_Extension (Etype (E))
5718 and then Comes_From_Source (Spec)
5720 Set_Has_Completion (E, False);
5722 if Expander_Active then
5724 (Unit_Declaration_Node
5725 (Corresponding_Body (Unit_Declaration_Node (E))));
5728 -- If expansion is disabled, the wrapper function has not
5729 -- been generated, and this is the standard case of a late
5730 -- body overriding an inherited operation.
5736 -- If the body already exists, then this is an error unless
5737 -- the previous declaration is the implicit declaration of a
5738 -- derived subprogram, or this is a spurious overloading in an
5741 elsif No (Alias (E))
5742 and then not Is_Intrinsic_Subprogram (E)
5743 and then not In_Instance
5746 Error_Msg_Sloc := Sloc (E);
5748 if Is_Imported (E) then
5750 ("body not allowed for imported subprogram & declared#",
5753 Error_Msg_NE ("duplicate body for & declared#", N, E);
5757 -- Child units cannot be overloaded, so a conformance mismatch
5758 -- between body and a previous spec is an error.
5760 elsif Is_Child_Unit (E)
5762 Nkind (Unit_Declaration_Node (Designator)) = N_Subprogram_Body
5764 Nkind (Parent (Unit_Declaration_Node (Designator))) =
5769 ("body of child unit does not match previous declaration", N);
5777 -- On exit, we know that no previous declaration of subprogram exists
5780 end Find_Corresponding_Spec;
5782 ----------------------
5783 -- Fully_Conformant --
5784 ----------------------
5786 function Fully_Conformant (New_Id, Old_Id : Entity_Id) return Boolean is
5789 Check_Conformance (New_Id, Old_Id, Fully_Conformant, False, Result);
5791 end Fully_Conformant;
5793 ----------------------------------
5794 -- Fully_Conformant_Expressions --
5795 ----------------------------------
5797 function Fully_Conformant_Expressions
5798 (Given_E1 : Node_Id;
5799 Given_E2 : Node_Id) return Boolean
5801 E1 : constant Node_Id := Original_Node (Given_E1);
5802 E2 : constant Node_Id := Original_Node (Given_E2);
5803 -- We always test conformance on original nodes, since it is possible
5804 -- for analysis and/or expansion to make things look as though they
5805 -- conform when they do not, e.g. by converting 1+2 into 3.
5807 function FCE (Given_E1, Given_E2 : Node_Id) return Boolean
5808 renames Fully_Conformant_Expressions;
5810 function FCL (L1, L2 : List_Id) return Boolean;
5811 -- Compare elements of two lists for conformance. Elements have to
5812 -- be conformant, and actuals inserted as default parameters do not
5813 -- match explicit actuals with the same value.
5815 function FCO (Op_Node, Call_Node : Node_Id) return Boolean;
5816 -- Compare an operator node with a function call
5822 function FCL (L1, L2 : List_Id) return Boolean is
5826 if L1 = No_List then
5832 if L2 = No_List then
5838 -- Compare two lists, skipping rewrite insertions (we want to
5839 -- compare the original trees, not the expanded versions!)
5842 if Is_Rewrite_Insertion (N1) then
5844 elsif Is_Rewrite_Insertion (N2) then
5850 elsif not FCE (N1, N2) then
5863 function FCO (Op_Node, Call_Node : Node_Id) return Boolean is
5864 Actuals : constant List_Id := Parameter_Associations (Call_Node);
5869 or else Entity (Op_Node) /= Entity (Name (Call_Node))
5874 Act := First (Actuals);
5876 if Nkind (Op_Node) in N_Binary_Op then
5877 if not FCE (Left_Opnd (Op_Node), Act) then
5884 return Present (Act)
5885 and then FCE (Right_Opnd (Op_Node), Act)
5886 and then No (Next (Act));
5890 -- Start of processing for Fully_Conformant_Expressions
5893 -- Non-conformant if paren count does not match. Note: if some idiot
5894 -- complains that we don't do this right for more than 3 levels of
5895 -- parentheses, they will be treated with the respect they deserve!
5897 if Paren_Count (E1) /= Paren_Count (E2) then
5900 -- If same entities are referenced, then they are conformant even if
5901 -- they have different forms (RM 8.3.1(19-20)).
5903 elsif Is_Entity_Name (E1) and then Is_Entity_Name (E2) then
5904 if Present (Entity (E1)) then
5905 return Entity (E1) = Entity (E2)
5906 or else (Chars (Entity (E1)) = Chars (Entity (E2))
5907 and then Ekind (Entity (E1)) = E_Discriminant
5908 and then Ekind (Entity (E2)) = E_In_Parameter);
5910 elsif Nkind (E1) = N_Expanded_Name
5911 and then Nkind (E2) = N_Expanded_Name
5912 and then Nkind (Selector_Name (E1)) = N_Character_Literal
5913 and then Nkind (Selector_Name (E2)) = N_Character_Literal
5915 return Chars (Selector_Name (E1)) = Chars (Selector_Name (E2));
5918 -- Identifiers in component associations don't always have
5919 -- entities, but their names must conform.
5921 return Nkind (E1) = N_Identifier
5922 and then Nkind (E2) = N_Identifier
5923 and then Chars (E1) = Chars (E2);
5926 elsif Nkind (E1) = N_Character_Literal
5927 and then Nkind (E2) = N_Expanded_Name
5929 return Nkind (Selector_Name (E2)) = N_Character_Literal
5930 and then Chars (E1) = Chars (Selector_Name (E2));
5932 elsif Nkind (E2) = N_Character_Literal
5933 and then Nkind (E1) = N_Expanded_Name
5935 return Nkind (Selector_Name (E1)) = N_Character_Literal
5936 and then Chars (E2) = Chars (Selector_Name (E1));
5938 elsif Nkind (E1) in N_Op
5939 and then Nkind (E2) = N_Function_Call
5941 return FCO (E1, E2);
5943 elsif Nkind (E2) in N_Op
5944 and then Nkind (E1) = N_Function_Call
5946 return FCO (E2, E1);
5948 -- Otherwise we must have the same syntactic entity
5950 elsif Nkind (E1) /= Nkind (E2) then
5953 -- At this point, we specialize by node type
5960 FCL (Expressions (E1), Expressions (E2))
5961 and then FCL (Component_Associations (E1),
5962 Component_Associations (E2));
5965 if Nkind (Expression (E1)) = N_Qualified_Expression
5967 Nkind (Expression (E2)) = N_Qualified_Expression
5969 return FCE (Expression (E1), Expression (E2));
5971 -- Check that the subtype marks and any constraints
5976 Indic1 : constant Node_Id := Expression (E1);
5977 Indic2 : constant Node_Id := Expression (E2);
5982 if Nkind (Indic1) /= N_Subtype_Indication then
5984 Nkind (Indic2) /= N_Subtype_Indication
5985 and then Entity (Indic1) = Entity (Indic2);
5987 elsif Nkind (Indic2) /= N_Subtype_Indication then
5989 Nkind (Indic1) /= N_Subtype_Indication
5990 and then Entity (Indic1) = Entity (Indic2);
5993 if Entity (Subtype_Mark (Indic1)) /=
5994 Entity (Subtype_Mark (Indic2))
5999 Elt1 := First (Constraints (Constraint (Indic1)));
6000 Elt2 := First (Constraints (Constraint (Indic2)));
6001 while Present (Elt1) and then Present (Elt2) loop
6002 if not FCE (Elt1, Elt2) then
6015 when N_Attribute_Reference =>
6017 Attribute_Name (E1) = Attribute_Name (E2)
6018 and then FCL (Expressions (E1), Expressions (E2));
6022 Entity (E1) = Entity (E2)
6023 and then FCE (Left_Opnd (E1), Left_Opnd (E2))
6024 and then FCE (Right_Opnd (E1), Right_Opnd (E2));
6026 when N_And_Then | N_Or_Else | N_Membership_Test =>
6028 FCE (Left_Opnd (E1), Left_Opnd (E2))
6030 FCE (Right_Opnd (E1), Right_Opnd (E2));
6032 when N_Character_Literal =>
6034 Char_Literal_Value (E1) = Char_Literal_Value (E2);
6036 when N_Component_Association =>
6038 FCL (Choices (E1), Choices (E2))
6039 and then FCE (Expression (E1), Expression (E2));
6041 when N_Conditional_Expression =>
6043 FCL (Expressions (E1), Expressions (E2));
6045 when N_Explicit_Dereference =>
6047 FCE (Prefix (E1), Prefix (E2));
6049 when N_Extension_Aggregate =>
6051 FCL (Expressions (E1), Expressions (E2))
6052 and then Null_Record_Present (E1) =
6053 Null_Record_Present (E2)
6054 and then FCL (Component_Associations (E1),
6055 Component_Associations (E2));
6057 when N_Function_Call =>
6059 FCE (Name (E1), Name (E2))
6060 and then FCL (Parameter_Associations (E1),
6061 Parameter_Associations (E2));
6063 when N_Indexed_Component =>
6065 FCE (Prefix (E1), Prefix (E2))
6066 and then FCL (Expressions (E1), Expressions (E2));
6068 when N_Integer_Literal =>
6069 return (Intval (E1) = Intval (E2));
6074 when N_Operator_Symbol =>
6076 Chars (E1) = Chars (E2);
6078 when N_Others_Choice =>
6081 when N_Parameter_Association =>
6083 Chars (Selector_Name (E1)) = Chars (Selector_Name (E2))
6084 and then FCE (Explicit_Actual_Parameter (E1),
6085 Explicit_Actual_Parameter (E2));
6087 when N_Qualified_Expression =>
6089 FCE (Subtype_Mark (E1), Subtype_Mark (E2))
6090 and then FCE (Expression (E1), Expression (E2));
6094 FCE (Low_Bound (E1), Low_Bound (E2))
6095 and then FCE (High_Bound (E1), High_Bound (E2));
6097 when N_Real_Literal =>
6098 return (Realval (E1) = Realval (E2));
6100 when N_Selected_Component =>
6102 FCE (Prefix (E1), Prefix (E2))
6103 and then FCE (Selector_Name (E1), Selector_Name (E2));
6107 FCE (Prefix (E1), Prefix (E2))
6108 and then FCE (Discrete_Range (E1), Discrete_Range (E2));
6110 when N_String_Literal =>
6112 S1 : constant String_Id := Strval (E1);
6113 S2 : constant String_Id := Strval (E2);
6114 L1 : constant Nat := String_Length (S1);
6115 L2 : constant Nat := String_Length (S2);
6122 for J in 1 .. L1 loop
6123 if Get_String_Char (S1, J) /=
6124 Get_String_Char (S2, J)
6134 when N_Type_Conversion =>
6136 FCE (Subtype_Mark (E1), Subtype_Mark (E2))
6137 and then FCE (Expression (E1), Expression (E2));
6141 Entity (E1) = Entity (E2)
6142 and then FCE (Right_Opnd (E1), Right_Opnd (E2));
6144 when N_Unchecked_Type_Conversion =>
6146 FCE (Subtype_Mark (E1), Subtype_Mark (E2))
6147 and then FCE (Expression (E1), Expression (E2));
6149 -- All other node types cannot appear in this context. Strictly
6150 -- we should raise a fatal internal error. Instead we just ignore
6151 -- the nodes. This means that if anyone makes a mistake in the
6152 -- expander and mucks an expression tree irretrievably, the
6153 -- result will be a failure to detect a (probably very obscure)
6154 -- case of non-conformance, which is better than bombing on some
6155 -- case where two expressions do in fact conform.
6162 end Fully_Conformant_Expressions;
6164 ----------------------------------------
6165 -- Fully_Conformant_Discrete_Subtypes --
6166 ----------------------------------------
6168 function Fully_Conformant_Discrete_Subtypes
6169 (Given_S1 : Node_Id;
6170 Given_S2 : Node_Id) return Boolean
6172 S1 : constant Node_Id := Original_Node (Given_S1);
6173 S2 : constant Node_Id := Original_Node (Given_S2);
6175 function Conforming_Bounds (B1, B2 : Node_Id) return Boolean;
6176 -- Special-case for a bound given by a discriminant, which in the body
6177 -- is replaced with the discriminal of the enclosing type.
6179 function Conforming_Ranges (R1, R2 : Node_Id) return Boolean;
6180 -- Check both bounds
6182 -----------------------
6183 -- Conforming_Bounds --
6184 -----------------------
6186 function Conforming_Bounds (B1, B2 : Node_Id) return Boolean is
6188 if Is_Entity_Name (B1)
6189 and then Is_Entity_Name (B2)
6190 and then Ekind (Entity (B1)) = E_Discriminant
6192 return Chars (B1) = Chars (B2);
6195 return Fully_Conformant_Expressions (B1, B2);
6197 end Conforming_Bounds;
6199 -----------------------
6200 -- Conforming_Ranges --
6201 -----------------------
6203 function Conforming_Ranges (R1, R2 : Node_Id) return Boolean is
6206 Conforming_Bounds (Low_Bound (R1), Low_Bound (R2))
6208 Conforming_Bounds (High_Bound (R1), High_Bound (R2));
6209 end Conforming_Ranges;
6211 -- Start of processing for Fully_Conformant_Discrete_Subtypes
6214 if Nkind (S1) /= Nkind (S2) then
6217 elsif Is_Entity_Name (S1) then
6218 return Entity (S1) = Entity (S2);
6220 elsif Nkind (S1) = N_Range then
6221 return Conforming_Ranges (S1, S2);
6223 elsif Nkind (S1) = N_Subtype_Indication then
6225 Entity (Subtype_Mark (S1)) = Entity (Subtype_Mark (S2))
6228 (Range_Expression (Constraint (S1)),
6229 Range_Expression (Constraint (S2)));
6233 end Fully_Conformant_Discrete_Subtypes;
6235 --------------------
6236 -- Install_Entity --
6237 --------------------
6239 procedure Install_Entity (E : Entity_Id) is
6240 Prev : constant Entity_Id := Current_Entity (E);
6242 Set_Is_Immediately_Visible (E);
6243 Set_Current_Entity (E);
6244 Set_Homonym (E, Prev);
6247 ---------------------
6248 -- Install_Formals --
6249 ---------------------
6251 procedure Install_Formals (Id : Entity_Id) is
6254 F := First_Formal (Id);
6255 while Present (F) loop
6259 end Install_Formals;
6261 -----------------------------
6262 -- Is_Interface_Conformant --
6263 -----------------------------
6265 function Is_Interface_Conformant
6266 (Tagged_Type : Entity_Id;
6267 Iface_Prim : Entity_Id;
6268 Prim : Entity_Id) return Boolean
6270 Iface : constant Entity_Id := Find_Dispatching_Type (Iface_Prim);
6271 Typ : constant Entity_Id := Find_Dispatching_Type (Prim);
6274 pragma Assert (Is_Subprogram (Iface_Prim)
6275 and then Is_Subprogram (Prim)
6276 and then Is_Dispatching_Operation (Iface_Prim)
6277 and then Is_Dispatching_Operation (Prim));
6279 pragma Assert (Is_Interface (Iface)
6280 or else (Present (Alias (Iface_Prim))
6283 (Find_Dispatching_Type (Ultimate_Alias (Iface_Prim)))));
6285 if Prim = Iface_Prim
6286 or else not Is_Subprogram (Prim)
6287 or else Ekind (Prim) /= Ekind (Iface_Prim)
6288 or else not Is_Dispatching_Operation (Prim)
6289 or else Scope (Prim) /= Scope (Tagged_Type)
6291 or else Base_Type (Typ) /= Tagged_Type
6292 or else not Primitive_Names_Match (Iface_Prim, Prim)
6296 -- Case of a procedure, or a function that does not have a controlling
6297 -- result (I or access I).
6299 elsif Ekind (Iface_Prim) = E_Procedure
6300 or else Etype (Prim) = Etype (Iface_Prim)
6301 or else not Has_Controlling_Result (Prim)
6303 return Type_Conformant (Prim, Iface_Prim,
6304 Skip_Controlling_Formals => True);
6306 -- Case of a function returning an interface, or an access to one.
6307 -- Check that the return types correspond.
6309 elsif Implements_Interface (Typ, Iface) then
6310 if (Ekind (Etype (Prim)) = E_Anonymous_Access_Type)
6312 (Ekind (Etype (Iface_Prim)) = E_Anonymous_Access_Type)
6317 Type_Conformant (Prim, Iface_Prim,
6318 Skip_Controlling_Formals => True);
6324 end Is_Interface_Conformant;
6326 ---------------------------------
6327 -- Is_Non_Overriding_Operation --
6328 ---------------------------------
6330 function Is_Non_Overriding_Operation
6331 (Prev_E : Entity_Id;
6332 New_E : Entity_Id) return Boolean
6336 G_Typ : Entity_Id := Empty;
6338 function Get_Generic_Parent_Type (F_Typ : Entity_Id) return Entity_Id;
6339 -- If F_Type is a derived type associated with a generic actual subtype,
6340 -- then return its Generic_Parent_Type attribute, else return Empty.
6342 function Types_Correspond
6343 (P_Type : Entity_Id;
6344 N_Type : Entity_Id) return Boolean;
6345 -- Returns true if and only if the types (or designated types in the
6346 -- case of anonymous access types) are the same or N_Type is derived
6347 -- directly or indirectly from P_Type.
6349 -----------------------------
6350 -- Get_Generic_Parent_Type --
6351 -----------------------------
6353 function Get_Generic_Parent_Type (F_Typ : Entity_Id) return Entity_Id is
6358 if Is_Derived_Type (F_Typ)
6359 and then Nkind (Parent (F_Typ)) = N_Full_Type_Declaration
6361 -- The tree must be traversed to determine the parent subtype in
6362 -- the generic unit, which unfortunately isn't always available
6363 -- via semantic attributes. ??? (Note: The use of Original_Node
6364 -- is needed for cases where a full derived type has been
6367 Indic := Subtype_Indication
6368 (Type_Definition (Original_Node (Parent (F_Typ))));
6370 if Nkind (Indic) = N_Subtype_Indication then
6371 G_Typ := Entity (Subtype_Mark (Indic));
6373 G_Typ := Entity (Indic);
6376 if Nkind (Parent (G_Typ)) = N_Subtype_Declaration
6377 and then Present (Generic_Parent_Type (Parent (G_Typ)))
6379 return Generic_Parent_Type (Parent (G_Typ));
6384 end Get_Generic_Parent_Type;
6386 ----------------------
6387 -- Types_Correspond --
6388 ----------------------
6390 function Types_Correspond
6391 (P_Type : Entity_Id;
6392 N_Type : Entity_Id) return Boolean
6394 Prev_Type : Entity_Id := Base_Type (P_Type);
6395 New_Type : Entity_Id := Base_Type (N_Type);
6398 if Ekind (Prev_Type) = E_Anonymous_Access_Type then
6399 Prev_Type := Designated_Type (Prev_Type);
6402 if Ekind (New_Type) = E_Anonymous_Access_Type then
6403 New_Type := Designated_Type (New_Type);
6406 if Prev_Type = New_Type then
6409 elsif not Is_Class_Wide_Type (New_Type) then
6410 while Etype (New_Type) /= New_Type loop
6411 New_Type := Etype (New_Type);
6412 if New_Type = Prev_Type then
6418 end Types_Correspond;
6420 -- Start of processing for Is_Non_Overriding_Operation
6423 -- In the case where both operations are implicit derived subprograms
6424 -- then neither overrides the other. This can only occur in certain
6425 -- obscure cases (e.g., derivation from homographs created in a generic
6428 if Present (Alias (Prev_E)) and then Present (Alias (New_E)) then
6431 elsif Ekind (Current_Scope) = E_Package
6432 and then Is_Generic_Instance (Current_Scope)
6433 and then In_Private_Part (Current_Scope)
6434 and then Comes_From_Source (New_E)
6436 -- We examine the formals and result subtype of the inherited
6437 -- operation, to determine whether their type is derived from (the
6438 -- instance of) a generic type.
6440 Formal := First_Formal (Prev_E);
6442 while Present (Formal) loop
6443 F_Typ := Base_Type (Etype (Formal));
6445 if Ekind (F_Typ) = E_Anonymous_Access_Type then
6446 F_Typ := Designated_Type (F_Typ);
6449 G_Typ := Get_Generic_Parent_Type (F_Typ);
6451 Next_Formal (Formal);
6454 if No (G_Typ) and then Ekind (Prev_E) = E_Function then
6455 G_Typ := Get_Generic_Parent_Type (Base_Type (Etype (Prev_E)));
6462 -- If the generic type is a private type, then the original operation
6463 -- was not overriding in the generic, because there was no primitive
6464 -- operation to override.
6466 if Nkind (Parent (G_Typ)) = N_Formal_Type_Declaration
6467 and then Nkind (Formal_Type_Definition (Parent (G_Typ))) =
6468 N_Formal_Private_Type_Definition
6472 -- The generic parent type is the ancestor of a formal derived
6473 -- type declaration. We need to check whether it has a primitive
6474 -- operation that should be overridden by New_E in the generic.
6478 P_Formal : Entity_Id;
6479 N_Formal : Entity_Id;
6483 Prim_Elt : Elmt_Id := First_Elmt (Primitive_Operations (G_Typ));
6486 while Present (Prim_Elt) loop
6487 P_Prim := Node (Prim_Elt);
6489 if Chars (P_Prim) = Chars (New_E)
6490 and then Ekind (P_Prim) = Ekind (New_E)
6492 P_Formal := First_Formal (P_Prim);
6493 N_Formal := First_Formal (New_E);
6494 while Present (P_Formal) and then Present (N_Formal) loop
6495 P_Typ := Etype (P_Formal);
6496 N_Typ := Etype (N_Formal);
6498 if not Types_Correspond (P_Typ, N_Typ) then
6502 Next_Entity (P_Formal);
6503 Next_Entity (N_Formal);
6506 -- Found a matching primitive operation belonging to the
6507 -- formal ancestor type, so the new subprogram is
6511 and then No (N_Formal)
6512 and then (Ekind (New_E) /= E_Function
6515 (Etype (P_Prim), Etype (New_E)))
6521 Next_Elmt (Prim_Elt);
6524 -- If no match found, then the new subprogram does not
6525 -- override in the generic (nor in the instance).
6533 end Is_Non_Overriding_Operation;
6535 ------------------------------
6536 -- Make_Inequality_Operator --
6537 ------------------------------
6539 -- S is the defining identifier of an equality operator. We build a
6540 -- subprogram declaration with the right signature. This operation is
6541 -- intrinsic, because it is always expanded as the negation of the
6542 -- call to the equality function.
6544 procedure Make_Inequality_Operator (S : Entity_Id) is
6545 Loc : constant Source_Ptr := Sloc (S);
6548 Op_Name : Entity_Id;
6550 FF : constant Entity_Id := First_Formal (S);
6551 NF : constant Entity_Id := Next_Formal (FF);
6554 -- Check that equality was properly defined, ignore call if not
6561 A : constant Entity_Id :=
6562 Make_Defining_Identifier (Sloc (FF),
6563 Chars => Chars (FF));
6565 B : constant Entity_Id :=
6566 Make_Defining_Identifier (Sloc (NF),
6567 Chars => Chars (NF));
6570 Op_Name := Make_Defining_Operator_Symbol (Loc, Name_Op_Ne);
6572 Formals := New_List (
6573 Make_Parameter_Specification (Loc,
6574 Defining_Identifier => A,
6576 New_Reference_To (Etype (First_Formal (S)),
6577 Sloc (Etype (First_Formal (S))))),
6579 Make_Parameter_Specification (Loc,
6580 Defining_Identifier => B,
6582 New_Reference_To (Etype (Next_Formal (First_Formal (S))),
6583 Sloc (Etype (Next_Formal (First_Formal (S)))))));
6586 Make_Subprogram_Declaration (Loc,
6588 Make_Function_Specification (Loc,
6589 Defining_Unit_Name => Op_Name,
6590 Parameter_Specifications => Formals,
6591 Result_Definition =>
6592 New_Reference_To (Standard_Boolean, Loc)));
6594 -- Insert inequality right after equality if it is explicit or after
6595 -- the derived type when implicit. These entities are created only
6596 -- for visibility purposes, and eventually replaced in the course of
6597 -- expansion, so they do not need to be attached to the tree and seen
6598 -- by the back-end. Keeping them internal also avoids spurious
6599 -- freezing problems. The declaration is inserted in the tree for
6600 -- analysis, and removed afterwards. If the equality operator comes
6601 -- from an explicit declaration, attach the inequality immediately
6602 -- after. Else the equality is inherited from a derived type
6603 -- declaration, so insert inequality after that declaration.
6605 if No (Alias (S)) then
6606 Insert_After (Unit_Declaration_Node (S), Decl);
6607 elsif Is_List_Member (Parent (S)) then
6608 Insert_After (Parent (S), Decl);
6610 Insert_After (Parent (Etype (First_Formal (S))), Decl);
6613 Mark_Rewrite_Insertion (Decl);
6614 Set_Is_Intrinsic_Subprogram (Op_Name);
6617 Set_Has_Completion (Op_Name);
6618 Set_Corresponding_Equality (Op_Name, S);
6619 Set_Is_Abstract_Subprogram (Op_Name, Is_Abstract_Subprogram (S));
6621 end Make_Inequality_Operator;
6623 ----------------------
6624 -- May_Need_Actuals --
6625 ----------------------
6627 procedure May_Need_Actuals (Fun : Entity_Id) is
6632 F := First_Formal (Fun);
6634 while Present (F) loop
6635 if No (Default_Value (F)) then
6643 Set_Needs_No_Actuals (Fun, B);
6644 end May_Need_Actuals;
6646 ---------------------
6647 -- Mode_Conformant --
6648 ---------------------
6650 function Mode_Conformant (New_Id, Old_Id : Entity_Id) return Boolean is
6653 Check_Conformance (New_Id, Old_Id, Mode_Conformant, False, Result);
6655 end Mode_Conformant;
6657 ---------------------------
6658 -- New_Overloaded_Entity --
6659 ---------------------------
6661 procedure New_Overloaded_Entity
6663 Derived_Type : Entity_Id := Empty)
6665 Overridden_Subp : Entity_Id := Empty;
6666 -- Set if the current scope has an operation that is type-conformant
6667 -- with S, and becomes hidden by S.
6669 Is_Primitive_Subp : Boolean;
6670 -- Set to True if the new subprogram is primitive
6673 -- Entity that S overrides
6675 Prev_Vis : Entity_Id := Empty;
6676 -- Predecessor of E in Homonym chain
6678 procedure Check_For_Primitive_Subprogram
6679 (Is_Primitive : out Boolean;
6680 Is_Overriding : Boolean := False);
6681 -- If the subprogram being analyzed is a primitive operation of the type
6682 -- of a formal or result, set the Has_Primitive_Operations flag on the
6683 -- type, and set Is_Primitive to True (otherwise set to False). Set the
6684 -- corresponding flag on the entity itself for later use.
6686 procedure Check_Synchronized_Overriding
6687 (Def_Id : Entity_Id;
6688 Overridden_Subp : out Entity_Id);
6689 -- First determine if Def_Id is an entry or a subprogram either defined
6690 -- in the scope of a task or protected type, or is a primitive of such
6691 -- a type. Check whether Def_Id overrides a subprogram of an interface
6692 -- implemented by the synchronized type, return the overridden entity
6695 function Is_Private_Declaration (E : Entity_Id) return Boolean;
6696 -- Check that E is declared in the private part of the current package,
6697 -- or in the package body, where it may hide a previous declaration.
6698 -- We can't use In_Private_Part by itself because this flag is also
6699 -- set when freezing entities, so we must examine the place of the
6700 -- declaration in the tree, and recognize wrapper packages as well.
6702 function Is_Overriding_Alias
6704 New_E : Entity_Id) return Boolean;
6705 -- Check whether new subprogram and old subprogram are both inherited
6706 -- from subprograms that have distinct dispatch table entries. This can
6707 -- occur with derivations from instances with accidental homonyms.
6708 -- The function is conservative given that the converse is only true
6709 -- within instances that contain accidental overloadings.
6711 ------------------------------------
6712 -- Check_For_Primitive_Subprogram --
6713 ------------------------------------
6715 procedure Check_For_Primitive_Subprogram
6716 (Is_Primitive : out Boolean;
6717 Is_Overriding : Boolean := False)
6723 function Visible_Part_Type (T : Entity_Id) return Boolean;
6724 -- Returns true if T is declared in the visible part of the current
6725 -- package scope; otherwise returns false. Assumes that T is declared
6728 procedure Check_Private_Overriding (T : Entity_Id);
6729 -- Checks that if a primitive abstract subprogram of a visible
6730 -- abstract type is declared in a private part, then it must override
6731 -- an abstract subprogram declared in the visible part. Also checks
6732 -- that if a primitive function with a controlling result is declared
6733 -- in a private part, then it must override a function declared in
6734 -- the visible part.
6736 ------------------------------
6737 -- Check_Private_Overriding --
6738 ------------------------------
6740 procedure Check_Private_Overriding (T : Entity_Id) is
6742 if Is_Package_Or_Generic_Package (Current_Scope)
6743 and then In_Private_Part (Current_Scope)
6744 and then Visible_Part_Type (T)
6745 and then not In_Instance
6747 if Is_Abstract_Type (T)
6748 and then Is_Abstract_Subprogram (S)
6749 and then (not Is_Overriding
6750 or else not Is_Abstract_Subprogram (E))
6752 Error_Msg_N ("abstract subprograms must be visible "
6753 & "(RM 3.9.3(10))!", S);
6755 elsif Ekind (S) = E_Function
6756 and then Is_Tagged_Type (T)
6757 and then T = Base_Type (Etype (S))
6758 and then not Is_Overriding
6761 ("private function with tagged result must"
6762 & " override visible-part function", S);
6764 ("\move subprogram to the visible part"
6765 & " (RM 3.9.3(10))", S);
6768 end Check_Private_Overriding;
6770 -----------------------
6771 -- Visible_Part_Type --
6772 -----------------------
6774 function Visible_Part_Type (T : Entity_Id) return Boolean is
6775 P : constant Node_Id := Unit_Declaration_Node (Scope (T));
6779 -- If the entity is a private type, then it must be declared in a
6782 if Ekind (T) in Private_Kind then
6786 -- Otherwise, we traverse the visible part looking for its
6787 -- corresponding declaration. We cannot use the declaration
6788 -- node directly because in the private part the entity of a
6789 -- private type is the one in the full view, which does not
6790 -- indicate that it is the completion of something visible.
6792 N := First (Visible_Declarations (Specification (P)));
6793 while Present (N) loop
6794 if Nkind (N) = N_Full_Type_Declaration
6795 and then Present (Defining_Identifier (N))
6796 and then T = Defining_Identifier (N)
6800 elsif Nkind_In (N, N_Private_Type_Declaration,
6801 N_Private_Extension_Declaration)
6802 and then Present (Defining_Identifier (N))
6803 and then T = Full_View (Defining_Identifier (N))
6812 end Visible_Part_Type;
6814 -- Start of processing for Check_For_Primitive_Subprogram
6817 Is_Primitive := False;
6819 if not Comes_From_Source (S) then
6822 -- If subprogram is at library level, it is not primitive operation
6824 elsif Current_Scope = Standard_Standard then
6827 elsif (Is_Package_Or_Generic_Package (Current_Scope)
6828 and then not In_Package_Body (Current_Scope))
6829 or else Is_Overriding
6831 -- For function, check return type
6833 if Ekind (S) = E_Function then
6834 if Ekind (Etype (S)) = E_Anonymous_Access_Type then
6835 F_Typ := Designated_Type (Etype (S));
6840 B_Typ := Base_Type (F_Typ);
6842 if Scope (B_Typ) = Current_Scope
6843 and then not Is_Class_Wide_Type (B_Typ)
6844 and then not Is_Generic_Type (B_Typ)
6846 Is_Primitive := True;
6847 Set_Has_Primitive_Operations (B_Typ);
6848 Set_Is_Primitive (S);
6849 Check_Private_Overriding (B_Typ);
6853 -- For all subprograms, check formals
6855 Formal := First_Formal (S);
6856 while Present (Formal) loop
6857 if Ekind (Etype (Formal)) = E_Anonymous_Access_Type then
6858 F_Typ := Designated_Type (Etype (Formal));
6860 F_Typ := Etype (Formal);
6863 B_Typ := Base_Type (F_Typ);
6865 if Ekind (B_Typ) = E_Access_Subtype then
6866 B_Typ := Base_Type (B_Typ);
6869 if Scope (B_Typ) = Current_Scope
6870 and then not Is_Class_Wide_Type (B_Typ)
6871 and then not Is_Generic_Type (B_Typ)
6873 Is_Primitive := True;
6874 Set_Is_Primitive (S);
6875 Set_Has_Primitive_Operations (B_Typ);
6876 Check_Private_Overriding (B_Typ);
6879 Next_Formal (Formal);
6882 end Check_For_Primitive_Subprogram;
6884 -----------------------------------
6885 -- Check_Synchronized_Overriding --
6886 -----------------------------------
6888 procedure Check_Synchronized_Overriding
6889 (Def_Id : Entity_Id;
6890 Overridden_Subp : out Entity_Id)
6892 Ifaces_List : Elist_Id;
6896 function Matches_Prefixed_View_Profile
6897 (Prim_Params : List_Id;
6898 Iface_Params : List_Id) return Boolean;
6899 -- Determine whether a subprogram's parameter profile Prim_Params
6900 -- matches that of a potentially overridden interface subprogram
6901 -- Iface_Params. Also determine if the type of first parameter of
6902 -- Iface_Params is an implemented interface.
6904 -----------------------------------
6905 -- Matches_Prefixed_View_Profile --
6906 -----------------------------------
6908 function Matches_Prefixed_View_Profile
6909 (Prim_Params : List_Id;
6910 Iface_Params : List_Id) return Boolean
6912 Iface_Id : Entity_Id;
6913 Iface_Param : Node_Id;
6914 Iface_Typ : Entity_Id;
6915 Prim_Id : Entity_Id;
6916 Prim_Param : Node_Id;
6917 Prim_Typ : Entity_Id;
6919 function Is_Implemented
6920 (Ifaces_List : Elist_Id;
6921 Iface : Entity_Id) return Boolean;
6922 -- Determine if Iface is implemented by the current task or
6925 --------------------
6926 -- Is_Implemented --
6927 --------------------
6929 function Is_Implemented
6930 (Ifaces_List : Elist_Id;
6931 Iface : Entity_Id) return Boolean
6933 Iface_Elmt : Elmt_Id;
6936 Iface_Elmt := First_Elmt (Ifaces_List);
6937 while Present (Iface_Elmt) loop
6938 if Node (Iface_Elmt) = Iface then
6942 Next_Elmt (Iface_Elmt);
6948 -- Start of processing for Matches_Prefixed_View_Profile
6951 Iface_Param := First (Iface_Params);
6952 Iface_Typ := Etype (Defining_Identifier (Iface_Param));
6954 if Is_Access_Type (Iface_Typ) then
6955 Iface_Typ := Designated_Type (Iface_Typ);
6958 Prim_Param := First (Prim_Params);
6960 -- The first parameter of the potentially overridden subprogram
6961 -- must be an interface implemented by Prim.
6963 if not Is_Interface (Iface_Typ)
6964 or else not Is_Implemented (Ifaces_List, Iface_Typ)
6969 -- The checks on the object parameters are done, move onto the
6970 -- rest of the parameters.
6972 if not In_Scope then
6973 Prim_Param := Next (Prim_Param);
6976 Iface_Param := Next (Iface_Param);
6977 while Present (Iface_Param) and then Present (Prim_Param) loop
6978 Iface_Id := Defining_Identifier (Iface_Param);
6979 Iface_Typ := Find_Parameter_Type (Iface_Param);
6981 Prim_Id := Defining_Identifier (Prim_Param);
6982 Prim_Typ := Find_Parameter_Type (Prim_Param);
6984 if Ekind (Iface_Typ) = E_Anonymous_Access_Type
6985 and then Ekind (Prim_Typ) = E_Anonymous_Access_Type
6986 and then Is_Concurrent_Type (Designated_Type (Prim_Typ))
6988 Iface_Typ := Designated_Type (Iface_Typ);
6989 Prim_Typ := Designated_Type (Prim_Typ);
6992 -- Case of multiple interface types inside a parameter profile
6994 -- (Obj_Param : in out Iface; ...; Param : Iface)
6996 -- If the interface type is implemented, then the matching type
6997 -- in the primitive should be the implementing record type.
6999 if Ekind (Iface_Typ) = E_Record_Type
7000 and then Is_Interface (Iface_Typ)
7001 and then Is_Implemented (Ifaces_List, Iface_Typ)
7003 if Prim_Typ /= Typ then
7007 -- The two parameters must be both mode and subtype conformant
7009 elsif Ekind (Iface_Id) /= Ekind (Prim_Id)
7011 Conforming_Types (Iface_Typ, Prim_Typ, Subtype_Conformant)
7020 -- One of the two lists contains more parameters than the other
7022 if Present (Iface_Param) or else Present (Prim_Param) then
7027 end Matches_Prefixed_View_Profile;
7029 -- Start of processing for Check_Synchronized_Overriding
7032 Overridden_Subp := Empty;
7034 -- Def_Id must be an entry or a subprogram. We should skip predefined
7035 -- primitives internally generated by the frontend; however at this
7036 -- stage predefined primitives are still not fully decorated. As a
7037 -- minor optimization we skip here internally generated subprograms.
7039 if (Ekind (Def_Id) /= E_Entry
7040 and then Ekind (Def_Id) /= E_Function
7041 and then Ekind (Def_Id) /= E_Procedure)
7042 or else not Comes_From_Source (Def_Id)
7047 -- Search for the concurrent declaration since it contains the list
7048 -- of all implemented interfaces. In this case, the subprogram is
7049 -- declared within the scope of a protected or a task type.
7051 if Present (Scope (Def_Id))
7052 and then Is_Concurrent_Type (Scope (Def_Id))
7053 and then not Is_Generic_Actual_Type (Scope (Def_Id))
7055 Typ := Scope (Def_Id);
7058 -- The enclosing scope is not a synchronized type and the subprogram
7061 elsif No (First_Formal (Def_Id)) then
7064 -- The subprogram has formals and hence it may be a primitive of a
7068 Typ := Etype (First_Formal (Def_Id));
7070 if Is_Access_Type (Typ) then
7071 Typ := Directly_Designated_Type (Typ);
7074 if Is_Concurrent_Type (Typ)
7075 and then not Is_Generic_Actual_Type (Typ)
7079 -- This case occurs when the concurrent type is declared within
7080 -- a generic unit. As a result the corresponding record has been
7081 -- built and used as the type of the first formal, we just have
7082 -- to retrieve the corresponding concurrent type.
7084 elsif Is_Concurrent_Record_Type (Typ)
7085 and then Present (Corresponding_Concurrent_Type (Typ))
7087 Typ := Corresponding_Concurrent_Type (Typ);
7095 -- There is no overriding to check if is an inherited operation in a
7096 -- type derivation on for a generic actual.
7098 Collect_Interfaces (Typ, Ifaces_List);
7100 if Is_Empty_Elmt_List (Ifaces_List) then
7104 -- Determine whether entry or subprogram Def_Id overrides a primitive
7105 -- operation that belongs to one of the interfaces in Ifaces_List.
7108 Candidate : Entity_Id := Empty;
7109 Hom : Entity_Id := Empty;
7110 Iface_Typ : Entity_Id;
7111 Subp : Entity_Id := Empty;
7114 -- Traverse the homonym chain, looking at a potentially
7115 -- overridden subprogram that belongs to an implemented
7118 Hom := Current_Entity_In_Scope (Def_Id);
7119 while Present (Hom) loop
7123 or else not Is_Overloadable (Subp)
7124 or else not Is_Primitive (Subp)
7125 or else not Is_Dispatching_Operation (Subp)
7126 or else not Is_Interface (Find_Dispatching_Type (Subp))
7130 -- Entries and procedures can override abstract or null
7131 -- interface procedures
7133 elsif (Ekind (Def_Id) = E_Procedure
7134 or else Ekind (Def_Id) = E_Entry)
7135 and then Ekind (Subp) = E_Procedure
7136 and then Matches_Prefixed_View_Profile
7137 (Parameter_Specifications (Parent (Def_Id)),
7138 Parameter_Specifications (Parent (Subp)))
7142 -- For an overridden subprogram Subp, check whether the mode
7143 -- of its first parameter is correct depending on the kind
7144 -- of synchronized type.
7147 Formal : constant Node_Id := First_Formal (Candidate);
7150 -- In order for an entry or a protected procedure to
7151 -- override, the first parameter of the overridden
7152 -- routine must be of mode "out", "in out" or
7153 -- access-to-variable.
7155 if (Ekind (Candidate) = E_Entry
7156 or else Ekind (Candidate) = E_Procedure)
7157 and then Is_Protected_Type (Typ)
7158 and then Ekind (Formal) /= E_In_Out_Parameter
7159 and then Ekind (Formal) /= E_Out_Parameter
7160 and then Nkind (Parameter_Type (Parent (Formal)))
7161 /= N_Access_Definition
7165 -- All other cases are OK since a task entry or routine
7166 -- does not have a restriction on the mode of the first
7167 -- parameter of the overridden interface routine.
7170 Overridden_Subp := Candidate;
7175 -- Functions can override abstract interface functions
7177 elsif Ekind (Def_Id) = E_Function
7178 and then Ekind (Subp) = E_Function
7179 and then Matches_Prefixed_View_Profile
7180 (Parameter_Specifications (Parent (Def_Id)),
7181 Parameter_Specifications (Parent (Subp)))
7182 and then Etype (Result_Definition (Parent (Def_Id))) =
7183 Etype (Result_Definition (Parent (Subp)))
7185 Overridden_Subp := Subp;
7189 Hom := Homonym (Hom);
7192 -- After examining all candidates for overriding, we are
7193 -- left with the best match which is a mode incompatible
7194 -- interface routine. Do not emit an error if the Expander
7195 -- is active since this error will be detected later on
7196 -- after all concurrent types are expanded and all wrappers
7197 -- are built. This check is meant for spec-only
7200 if Present (Candidate)
7201 and then not Expander_Active
7204 Find_Parameter_Type (Parent (First_Formal (Candidate)));
7206 -- Def_Id is primitive of a protected type, declared
7207 -- inside the type, and the candidate is primitive of a
7208 -- limited or synchronized interface.
7211 and then Is_Protected_Type (Typ)
7213 (Is_Limited_Interface (Iface_Typ)
7214 or else Is_Protected_Interface (Iface_Typ)
7215 or else Is_Synchronized_Interface (Iface_Typ)
7216 or else Is_Task_Interface (Iface_Typ))
7218 -- Must reword this message, comma before to in -gnatj
7222 ("first formal of & must be of mode `OUT`, `IN OUT`"
7223 & " or access-to-variable", Typ, Candidate);
7225 ("\to be overridden by protected procedure or entry "
7226 & "(RM 9.4(11.9/2))", Typ);
7230 Overridden_Subp := Candidate;
7233 end Check_Synchronized_Overriding;
7235 ----------------------------
7236 -- Is_Private_Declaration --
7237 ----------------------------
7239 function Is_Private_Declaration (E : Entity_Id) return Boolean is
7240 Priv_Decls : List_Id;
7241 Decl : constant Node_Id := Unit_Declaration_Node (E);
7244 if Is_Package_Or_Generic_Package (Current_Scope)
7245 and then In_Private_Part (Current_Scope)
7248 Private_Declarations (
7249 Specification (Unit_Declaration_Node (Current_Scope)));
7251 return In_Package_Body (Current_Scope)
7253 (Is_List_Member (Decl)
7254 and then List_Containing (Decl) = Priv_Decls)
7255 or else (Nkind (Parent (Decl)) = N_Package_Specification
7258 (Defining_Entity (Parent (Decl)))
7259 and then List_Containing (Parent (Parent (Decl)))
7264 end Is_Private_Declaration;
7266 --------------------------
7267 -- Is_Overriding_Alias --
7268 --------------------------
7270 function Is_Overriding_Alias
7272 New_E : Entity_Id) return Boolean
7274 AO : constant Entity_Id := Alias (Old_E);
7275 AN : constant Entity_Id := Alias (New_E);
7278 return Scope (AO) /= Scope (AN)
7279 or else No (DTC_Entity (AO))
7280 or else No (DTC_Entity (AN))
7281 or else DT_Position (AO) = DT_Position (AN);
7282 end Is_Overriding_Alias;
7284 -- Start of processing for New_Overloaded_Entity
7287 -- We need to look for an entity that S may override. This must be a
7288 -- homonym in the current scope, so we look for the first homonym of
7289 -- S in the current scope as the starting point for the search.
7291 E := Current_Entity_In_Scope (S);
7293 -- If there is no homonym then this is definitely not overriding
7296 Enter_Overloaded_Entity (S);
7297 Check_Dispatching_Operation (S, Empty);
7298 Check_For_Primitive_Subprogram (Is_Primitive_Subp);
7300 -- If subprogram has an explicit declaration, check whether it
7301 -- has an overriding indicator.
7303 if Comes_From_Source (S) then
7304 Check_Synchronized_Overriding (S, Overridden_Subp);
7305 Check_Overriding_Indicator
7306 (S, Overridden_Subp, Is_Primitive => Is_Primitive_Subp);
7309 -- If there is a homonym that is not overloadable, then we have an
7310 -- error, except for the special cases checked explicitly below.
7312 elsif not Is_Overloadable (E) then
7314 -- Check for spurious conflict produced by a subprogram that has the
7315 -- same name as that of the enclosing generic package. The conflict
7316 -- occurs within an instance, between the subprogram and the renaming
7317 -- declaration for the package. After the subprogram, the package
7318 -- renaming declaration becomes hidden.
7320 if Ekind (E) = E_Package
7321 and then Present (Renamed_Object (E))
7322 and then Renamed_Object (E) = Current_Scope
7323 and then Nkind (Parent (Renamed_Object (E))) =
7324 N_Package_Specification
7325 and then Present (Generic_Parent (Parent (Renamed_Object (E))))
7328 Set_Is_Immediately_Visible (E, False);
7329 Enter_Overloaded_Entity (S);
7330 Set_Homonym (S, Homonym (E));
7331 Check_Dispatching_Operation (S, Empty);
7332 Check_Overriding_Indicator (S, Empty, Is_Primitive => False);
7334 -- If the subprogram is implicit it is hidden by the previous
7335 -- declaration. However if it is dispatching, it must appear in the
7336 -- dispatch table anyway, because it can be dispatched to even if it
7337 -- cannot be called directly.
7339 elsif Present (Alias (S))
7340 and then not Comes_From_Source (S)
7342 Set_Scope (S, Current_Scope);
7344 if Is_Dispatching_Operation (Alias (S)) then
7345 Check_Dispatching_Operation (S, Empty);
7351 Error_Msg_Sloc := Sloc (E);
7353 -- Generate message, with useful additional warning if in generic
7355 if Is_Generic_Unit (E) then
7356 Error_Msg_N ("previous generic unit cannot be overloaded", S);
7357 Error_Msg_N ("\& conflicts with declaration#", S);
7359 Error_Msg_N ("& conflicts with declaration#", S);
7365 -- E exists and is overloadable
7368 -- Ada 2005 (AI-251): Derivation of abstract interface primitives
7369 -- need no check against the homonym chain. They are directly added
7370 -- to the list of primitive operations of Derived_Type.
7372 if Ada_Version >= Ada_05
7373 and then Present (Derived_Type)
7374 and then Is_Dispatching_Operation (Alias (S))
7375 and then Present (Find_Dispatching_Type (Alias (S)))
7376 and then Is_Interface (Find_Dispatching_Type (Alias (S)))
7378 goto Add_New_Entity;
7381 Check_Synchronized_Overriding (S, Overridden_Subp);
7383 -- Loop through E and its homonyms to determine if any of them is
7384 -- the candidate for overriding by S.
7386 while Present (E) loop
7388 -- Definitely not interesting if not in the current scope
7390 if Scope (E) /= Current_Scope then
7393 -- Check if we have type conformance
7395 elsif Type_Conformant (E, S) then
7397 -- If the old and new entities have the same profile and one
7398 -- is not the body of the other, then this is an error, unless
7399 -- one of them is implicitly declared.
7401 -- There are some cases when both can be implicit, for example
7402 -- when both a literal and a function that overrides it are
7403 -- inherited in a derivation, or when an inherited operation
7404 -- of a tagged full type overrides the inherited operation of
7405 -- a private extension. Ada 83 had a special rule for the
7406 -- literal case. In Ada95, the later implicit operation hides
7407 -- the former, and the literal is always the former. In the
7408 -- odd case where both are derived operations declared at the
7409 -- same point, both operations should be declared, and in that
7410 -- case we bypass the following test and proceed to the next
7411 -- part. This can only occur for certain obscure cases in
7412 -- instances, when an operation on a type derived from a formal
7413 -- private type does not override a homograph inherited from
7414 -- the actual. In subsequent derivations of such a type, the
7415 -- DT positions of these operations remain distinct, if they
7418 if Present (Alias (S))
7419 and then (No (Alias (E))
7420 or else Comes_From_Source (E)
7421 or else Is_Abstract_Subprogram (S)
7423 (Is_Dispatching_Operation (E)
7424 and then Is_Overriding_Alias (E, S)))
7425 and then Ekind (E) /= E_Enumeration_Literal
7427 -- When an derived operation is overloaded it may be due to
7428 -- the fact that the full view of a private extension
7429 -- re-inherits. It has to be dealt with.
7431 if Is_Package_Or_Generic_Package (Current_Scope)
7432 and then In_Private_Part (Current_Scope)
7434 Check_Operation_From_Private_View (S, E);
7437 -- In any case the implicit operation remains hidden by
7438 -- the existing declaration, which is overriding.
7440 Set_Is_Overriding_Operation (E);
7442 if Comes_From_Source (E) then
7443 Check_Overriding_Indicator (E, S, Is_Primitive => False);
7445 -- Indicate that E overrides the operation from which
7448 if Present (Alias (S)) then
7449 Set_Overridden_Operation (E, Alias (S));
7451 Set_Overridden_Operation (E, S);
7457 -- Within an instance, the renaming declarations for actual
7458 -- subprograms may become ambiguous, but they do not hide each
7461 elsif Ekind (E) /= E_Entry
7462 and then not Comes_From_Source (E)
7463 and then not Is_Generic_Instance (E)
7464 and then (Present (Alias (E))
7465 or else Is_Intrinsic_Subprogram (E))
7466 and then (not In_Instance
7467 or else No (Parent (E))
7468 or else Nkind (Unit_Declaration_Node (E)) /=
7469 N_Subprogram_Renaming_Declaration)
7471 -- A subprogram child unit is not allowed to override an
7472 -- inherited subprogram (10.1.1(20)).
7474 if Is_Child_Unit (S) then
7476 ("child unit overrides inherited subprogram in parent",
7481 if Is_Non_Overriding_Operation (E, S) then
7482 Enter_Overloaded_Entity (S);
7484 if No (Derived_Type)
7485 or else Is_Tagged_Type (Derived_Type)
7487 Check_Dispatching_Operation (S, Empty);
7493 -- E is a derived operation or an internal operator which
7494 -- is being overridden. Remove E from further visibility.
7495 -- Furthermore, if E is a dispatching operation, it must be
7496 -- replaced in the list of primitive operations of its type
7497 -- (see Override_Dispatching_Operation).
7499 Overridden_Subp := E;
7505 Prev := First_Entity (Current_Scope);
7506 while Present (Prev)
7507 and then Next_Entity (Prev) /= E
7512 -- It is possible for E to be in the current scope and
7513 -- yet not in the entity chain. This can only occur in a
7514 -- generic context where E is an implicit concatenation
7515 -- in the formal part, because in a generic body the
7516 -- entity chain starts with the formals.
7519 (Present (Prev) or else Chars (E) = Name_Op_Concat);
7521 -- E must be removed both from the entity_list of the
7522 -- current scope, and from the visibility chain
7524 if Debug_Flag_E then
7525 Write_Str ("Override implicit operation ");
7526 Write_Int (Int (E));
7530 -- If E is a predefined concatenation, it stands for four
7531 -- different operations. As a result, a single explicit
7532 -- declaration does not hide it. In a possible ambiguous
7533 -- situation, Disambiguate chooses the user-defined op,
7534 -- so it is correct to retain the previous internal one.
7536 if Chars (E) /= Name_Op_Concat
7537 or else Ekind (E) /= E_Operator
7539 -- For nondispatching derived operations that are
7540 -- overridden by a subprogram declared in the private
7541 -- part of a package, we retain the derived subprogram
7542 -- but mark it as not immediately visible. If the
7543 -- derived operation was declared in the visible part
7544 -- then this ensures that it will still be visible
7545 -- outside the package with the proper signature
7546 -- (calls from outside must also be directed to this
7547 -- version rather than the overriding one, unlike the
7548 -- dispatching case). Calls from inside the package
7549 -- will still resolve to the overriding subprogram
7550 -- since the derived one is marked as not visible
7551 -- within the package.
7553 -- If the private operation is dispatching, we achieve
7554 -- the overriding by keeping the implicit operation
7555 -- but setting its alias to be the overriding one. In
7556 -- this fashion the proper body is executed in all
7557 -- cases, but the original signature is used outside
7560 -- If the overriding is not in the private part, we
7561 -- remove the implicit operation altogether.
7563 if Is_Private_Declaration (S) then
7564 if not Is_Dispatching_Operation (E) then
7565 Set_Is_Immediately_Visible (E, False);
7567 -- Work done in Override_Dispatching_Operation,
7568 -- so nothing else need to be done here.
7574 -- Find predecessor of E in Homonym chain
7576 if E = Current_Entity (E) then
7579 Prev_Vis := Current_Entity (E);
7580 while Homonym (Prev_Vis) /= E loop
7581 Prev_Vis := Homonym (Prev_Vis);
7585 if Prev_Vis /= Empty then
7587 -- Skip E in the visibility chain
7589 Set_Homonym (Prev_Vis, Homonym (E));
7592 Set_Name_Entity_Id (Chars (E), Homonym (E));
7595 Set_Next_Entity (Prev, Next_Entity (E));
7597 if No (Next_Entity (Prev)) then
7598 Set_Last_Entity (Current_Scope, Prev);
7604 Enter_Overloaded_Entity (S);
7605 Set_Is_Overriding_Operation (S);
7606 Check_Overriding_Indicator (S, E, Is_Primitive => True);
7608 -- Indicate that S overrides the operation from which
7611 if Comes_From_Source (S) then
7612 if Present (Alias (E)) then
7613 Set_Overridden_Operation (S, Alias (E));
7615 Set_Overridden_Operation (S, E);
7619 if Is_Dispatching_Operation (E) then
7621 -- An overriding dispatching subprogram inherits the
7622 -- convention of the overridden subprogram (by
7625 Set_Convention (S, Convention (E));
7626 Check_Dispatching_Operation (S, E);
7629 Check_Dispatching_Operation (S, Empty);
7632 Check_For_Primitive_Subprogram
7633 (Is_Primitive_Subp, Is_Overriding => True);
7634 goto Check_Inequality;
7637 -- Apparent redeclarations in instances can occur when two
7638 -- formal types get the same actual type. The subprograms in
7639 -- in the instance are legal, even if not callable from the
7640 -- outside. Calls from within are disambiguated elsewhere.
7641 -- For dispatching operations in the visible part, the usual
7642 -- rules apply, and operations with the same profile are not
7645 elsif (In_Instance_Visible_Part
7646 and then not Is_Dispatching_Operation (E))
7647 or else In_Instance_Not_Visible
7651 -- Here we have a real error (identical profile)
7654 Error_Msg_Sloc := Sloc (E);
7656 -- Avoid cascaded errors if the entity appears in
7657 -- subsequent calls.
7659 Set_Scope (S, Current_Scope);
7661 -- Generate error, with extra useful warning for the case
7662 -- of a generic instance with no completion.
7664 if Is_Generic_Instance (S)
7665 and then not Has_Completion (E)
7668 ("instantiation cannot provide body for&", S);
7669 Error_Msg_N ("\& conflicts with declaration#", S);
7671 Error_Msg_N ("& conflicts with declaration#", S);
7678 -- If one subprogram has an access parameter and the other
7679 -- a parameter of an access type, calls to either might be
7680 -- ambiguous. Verify that parameters match except for the
7681 -- access parameter.
7683 if May_Hide_Profile then
7689 F1 := First_Formal (S);
7690 F2 := First_Formal (E);
7691 while Present (F1) and then Present (F2) loop
7692 if Is_Access_Type (Etype (F1)) then
7693 if not Is_Access_Type (Etype (F2))
7694 or else not Conforming_Types
7695 (Designated_Type (Etype (F1)),
7696 Designated_Type (Etype (F2)),
7699 May_Hide_Profile := False;
7703 not Conforming_Types
7704 (Etype (F1), Etype (F2), Type_Conformant)
7706 May_Hide_Profile := False;
7717 Error_Msg_NE ("calls to& may be ambiguous?", S, S);
7728 -- On exit, we know that S is a new entity
7730 Enter_Overloaded_Entity (S);
7731 Check_For_Primitive_Subprogram (Is_Primitive_Subp);
7732 Check_Overriding_Indicator
7733 (S, Overridden_Subp, Is_Primitive => Is_Primitive_Subp);
7735 -- If S is a derived operation for an untagged type then by
7736 -- definition it's not a dispatching operation (even if the parent
7737 -- operation was dispatching), so we don't call
7738 -- Check_Dispatching_Operation in that case.
7740 if No (Derived_Type)
7741 or else Is_Tagged_Type (Derived_Type)
7743 Check_Dispatching_Operation (S, Empty);
7747 -- If this is a user-defined equality operator that is not a derived
7748 -- subprogram, create the corresponding inequality. If the operation is
7749 -- dispatching, the expansion is done elsewhere, and we do not create
7750 -- an explicit inequality operation.
7752 <<Check_Inequality>>
7753 if Chars (S) = Name_Op_Eq
7754 and then Etype (S) = Standard_Boolean
7755 and then Present (Parent (S))
7756 and then not Is_Dispatching_Operation (S)
7758 Make_Inequality_Operator (S);
7760 end New_Overloaded_Entity;
7762 ---------------------
7763 -- Process_Formals --
7764 ---------------------
7766 procedure Process_Formals
7768 Related_Nod : Node_Id)
7770 Param_Spec : Node_Id;
7772 Formal_Type : Entity_Id;
7776 Num_Out_Params : Nat := 0;
7777 First_Out_Param : Entity_Id := Empty;
7778 -- Used for setting Is_Only_Out_Parameter
7780 function Is_Class_Wide_Default (D : Node_Id) return Boolean;
7781 -- Check whether the default has a class-wide type. After analysis the
7782 -- default has the type of the formal, so we must also check explicitly
7783 -- for an access attribute.
7785 ---------------------------
7786 -- Is_Class_Wide_Default --
7787 ---------------------------
7789 function Is_Class_Wide_Default (D : Node_Id) return Boolean is
7791 return Is_Class_Wide_Type (Designated_Type (Etype (D)))
7792 or else (Nkind (D) = N_Attribute_Reference
7793 and then Attribute_Name (D) = Name_Access
7794 and then Is_Class_Wide_Type (Etype (Prefix (D))));
7795 end Is_Class_Wide_Default;
7797 -- Start of processing for Process_Formals
7800 -- In order to prevent premature use of the formals in the same formal
7801 -- part, the Ekind is left undefined until all default expressions are
7802 -- analyzed. The Ekind is established in a separate loop at the end.
7804 Param_Spec := First (T);
7805 while Present (Param_Spec) loop
7806 Formal := Defining_Identifier (Param_Spec);
7807 Set_Never_Set_In_Source (Formal, True);
7808 Enter_Name (Formal);
7810 -- Case of ordinary parameters
7812 if Nkind (Parameter_Type (Param_Spec)) /= N_Access_Definition then
7813 Find_Type (Parameter_Type (Param_Spec));
7814 Ptype := Parameter_Type (Param_Spec);
7816 if Ptype = Error then
7820 Formal_Type := Entity (Ptype);
7822 if Is_Incomplete_Type (Formal_Type)
7824 (Is_Class_Wide_Type (Formal_Type)
7825 and then Is_Incomplete_Type (Root_Type (Formal_Type)))
7827 -- Ada 2005 (AI-326): Tagged incomplete types allowed in
7828 -- primitive operations, as long as their completion is
7829 -- in the same declarative part. If in the private part
7830 -- this means that the type cannot be a Taft-amendment type.
7831 -- Check is done on package exit. For access to subprograms,
7832 -- the use is legal for Taft-amendment types.
7834 if Is_Tagged_Type (Formal_Type) then
7835 if Ekind (Scope (Current_Scope)) = E_Package
7836 and then In_Private_Part (Scope (Current_Scope))
7837 and then not From_With_Type (Formal_Type)
7838 and then not Is_Class_Wide_Type (Formal_Type)
7841 (Parent (T), N_Access_Function_Definition,
7842 N_Access_Procedure_Definition)
7846 Private_Dependents (Base_Type (Formal_Type)));
7850 -- Special handling of Value_Type for CIL case
7852 elsif Is_Value_Type (Formal_Type) then
7855 elsif not Nkind_In (Parent (T), N_Access_Function_Definition,
7856 N_Access_Procedure_Definition)
7859 ("invalid use of incomplete type&",
7860 Param_Spec, Formal_Type);
7862 -- Further checks on the legality of incomplete types
7863 -- in formal parts must be delayed until the freeze point
7864 -- of the enclosing subprogram or access to subprogram.
7867 elsif Ekind (Formal_Type) = E_Void then
7868 Error_Msg_NE ("premature use of&",
7869 Parameter_Type (Param_Spec), Formal_Type);
7872 -- Ada 2005 (AI-231): Create and decorate an internal subtype
7873 -- declaration corresponding to the null-excluding type of the
7874 -- formal in the enclosing scope. Finally, replace the parameter
7875 -- type of the formal with the internal subtype.
7877 if Ada_Version >= Ada_05
7878 and then Null_Exclusion_Present (Param_Spec)
7880 if not Is_Access_Type (Formal_Type) then
7882 ("`NOT NULL` allowed only for an access type", Param_Spec);
7885 if Can_Never_Be_Null (Formal_Type)
7886 and then Comes_From_Source (Related_Nod)
7889 ("`NOT NULL` not allowed (& already excludes null)",
7895 Create_Null_Excluding_Itype
7897 Related_Nod => Related_Nod,
7898 Scope_Id => Scope (Current_Scope));
7900 -- If the designated type of the itype is an itype we
7901 -- decorate it with the Has_Delayed_Freeze attribute to
7902 -- avoid problems with the backend.
7905 -- type T is access procedure;
7906 -- procedure Op (O : not null T);
7908 if Is_Itype (Directly_Designated_Type (Formal_Type)) then
7909 Set_Has_Delayed_Freeze (Formal_Type);
7914 -- An access formal type
7918 Access_Definition (Related_Nod, Parameter_Type (Param_Spec));
7920 -- No need to continue if we already notified errors
7922 if not Present (Formal_Type) then
7926 -- Ada 2005 (AI-254)
7929 AD : constant Node_Id :=
7930 Access_To_Subprogram_Definition
7931 (Parameter_Type (Param_Spec));
7933 if Present (AD) and then Protected_Present (AD) then
7935 Replace_Anonymous_Access_To_Protected_Subprogram
7941 Set_Etype (Formal, Formal_Type);
7942 Default := Expression (Param_Spec);
7944 if Present (Default) then
7945 if Out_Present (Param_Spec) then
7947 ("default initialization only allowed for IN parameters",
7951 -- Do the special preanalysis of the expression (see section on
7952 -- "Handling of Default Expressions" in the spec of package Sem).
7954 Preanalyze_Spec_Expression (Default, Formal_Type);
7956 -- An access to constant cannot be the default for
7957 -- an access parameter that is an access to variable.
7959 if Ekind (Formal_Type) = E_Anonymous_Access_Type
7960 and then not Is_Access_Constant (Formal_Type)
7961 and then Is_Access_Type (Etype (Default))
7962 and then Is_Access_Constant (Etype (Default))
7965 ("formal that is access to variable cannot be initialized " &
7966 "with an access-to-constant expression", Default);
7969 -- Check that the designated type of an access parameter's default
7970 -- is not a class-wide type unless the parameter's designated type
7971 -- is also class-wide.
7973 if Ekind (Formal_Type) = E_Anonymous_Access_Type
7974 and then not From_With_Type (Formal_Type)
7975 and then Is_Class_Wide_Default (Default)
7976 and then not Is_Class_Wide_Type (Designated_Type (Formal_Type))
7979 ("access to class-wide expression not allowed here", Default);
7983 -- Ada 2005 (AI-231): Static checks
7985 if Ada_Version >= Ada_05
7986 and then Is_Access_Type (Etype (Formal))
7987 and then Can_Never_Be_Null (Etype (Formal))
7989 Null_Exclusion_Static_Checks (Param_Spec);
7996 -- If this is the formal part of a function specification, analyze the
7997 -- subtype mark in the context where the formals are visible but not
7998 -- yet usable, and may hide outer homographs.
8000 if Nkind (Related_Nod) = N_Function_Specification then
8001 Analyze_Return_Type (Related_Nod);
8004 -- Now set the kind (mode) of each formal
8006 Param_Spec := First (T);
8008 while Present (Param_Spec) loop
8009 Formal := Defining_Identifier (Param_Spec);
8010 Set_Formal_Mode (Formal);
8012 if Ekind (Formal) = E_In_Parameter then
8013 Set_Default_Value (Formal, Expression (Param_Spec));
8015 if Present (Expression (Param_Spec)) then
8016 Default := Expression (Param_Spec);
8018 if Is_Scalar_Type (Etype (Default)) then
8020 (Parameter_Type (Param_Spec)) /= N_Access_Definition
8022 Formal_Type := Entity (Parameter_Type (Param_Spec));
8025 Formal_Type := Access_Definition
8026 (Related_Nod, Parameter_Type (Param_Spec));
8029 Apply_Scalar_Range_Check (Default, Formal_Type);
8033 elsif Ekind (Formal) = E_Out_Parameter then
8034 Num_Out_Params := Num_Out_Params + 1;
8036 if Num_Out_Params = 1 then
8037 First_Out_Param := Formal;
8040 elsif Ekind (Formal) = E_In_Out_Parameter then
8041 Num_Out_Params := Num_Out_Params + 1;
8047 if Present (First_Out_Param) and then Num_Out_Params = 1 then
8048 Set_Is_Only_Out_Parameter (First_Out_Param);
8050 end Process_Formals;
8056 procedure Process_PPCs
8058 Spec_Id : Entity_Id;
8059 Body_Id : Entity_Id)
8061 Loc : constant Source_Ptr := Sloc (N);
8063 Plist : List_Id := No_List;
8067 function Grab_PPC (Nam : Name_Id) return Node_Id;
8068 -- Prag contains an analyzed precondition or postcondition pragma.
8069 -- This function copies the pragma, changes it to the corresponding
8070 -- Check pragma and returns the Check pragma as the result. The
8071 -- argument Nam is either Name_Precondition or Name_Postcondition.
8077 function Grab_PPC (Nam : Name_Id) return Node_Id is
8078 CP : constant Node_Id := New_Copy_Tree (Prag);
8081 -- Set Analyzed to false, since we want to reanalyze the check
8082 -- procedure. Note that it is only at the outer level that we
8083 -- do this fiddling, for the spec cases, the already preanalyzed
8084 -- parameters are not affected.
8086 -- For a postcondition pragma within a generic, preserve the pragma
8087 -- for later expansion.
8089 Set_Analyzed (CP, False);
8091 if Nam = Name_Postcondition
8092 and then not Expander_Active
8097 -- Change pragma into corresponding pragma Check
8099 Prepend_To (Pragma_Argument_Associations (CP),
8100 Make_Pragma_Argument_Association (Sloc (Prag),
8102 Make_Identifier (Loc,
8104 Set_Pragma_Identifier (CP,
8105 Make_Identifier (Sloc (Prag),
8106 Chars => Name_Check));
8111 -- Start of processing for Process_PPCs
8114 -- Nothing to do if we are not generating code
8116 if Operating_Mode /= Generate_Code then
8120 -- Grab preconditions from spec
8122 if Present (Spec_Id) then
8124 -- Loop through PPC pragmas from spec. Note that preconditions from
8125 -- the body will be analyzed and converted when we scan the body
8126 -- declarations below.
8128 Prag := Spec_PPC_List (Spec_Id);
8129 while Present (Prag) loop
8130 if Pragma_Name (Prag) = Name_Precondition
8131 and then PPC_Enabled (Prag)
8133 -- Add pragma Check at the start of the declarations of N.
8134 -- Note that this processing reverses the order of the list,
8135 -- which is what we want since new entries were chained to
8136 -- the head of the list.
8138 Prepend (Grab_PPC (Name_Precondition), Declarations (N));
8141 Prag := Next_Pragma (Prag);
8145 -- Build postconditions procedure if needed and prepend the following
8146 -- declaration to the start of the declarations for the subprogram.
8148 -- procedure _postconditions [(_Result : resulttype)] is
8150 -- pragma Check (Postcondition, condition [,message]);
8151 -- pragma Check (Postcondition, condition [,message]);
8155 -- First we deal with the postconditions in the body
8157 if Is_Non_Empty_List (Declarations (N)) then
8159 -- Loop through declarations
8161 Prag := First (Declarations (N));
8162 while Present (Prag) loop
8163 if Nkind (Prag) = N_Pragma then
8165 -- If pragma, capture if enabled postcondition, else ignore
8167 if Pragma_Name (Prag) = Name_Postcondition
8168 and then Check_Enabled (Name_Postcondition)
8170 if Plist = No_List then
8171 Plist := Empty_List;
8176 -- If expansion is disabled, as in a generic unit,
8177 -- save pragma for later expansion.
8179 if not Expander_Active then
8180 Prepend (Grab_PPC (Name_Postcondition), Declarations (N));
8182 Append (Grab_PPC (Name_Postcondition), Plist);
8188 -- Not a pragma, if comes from source, then end scan
8190 elsif Comes_From_Source (Prag) then
8193 -- Skip stuff not coming from source
8201 -- Now deal with any postconditions from the spec
8203 if Present (Spec_Id) then
8205 -- Loop through PPC pragmas from spec
8207 Prag := Spec_PPC_List (Spec_Id);
8208 while Present (Prag) loop
8209 if Pragma_Name (Prag) = Name_Postcondition
8210 and then PPC_Enabled (Prag)
8212 if Plist = No_List then
8213 Plist := Empty_List;
8216 if not Expander_Active then
8217 Prepend (Grab_PPC (Name_Postcondition), Declarations (N));
8219 Append (Grab_PPC (Name_Postcondition), Plist);
8223 Prag := Next_Pragma (Prag);
8227 -- If we had any postconditions and expansion is enabled, build
8228 -- the _Postconditions procedure.
8231 and then Expander_Active
8233 Subp := Defining_Entity (N);
8235 if Etype (Subp) /= Standard_Void_Type then
8237 Make_Parameter_Specification (Loc,
8238 Defining_Identifier =>
8239 Make_Defining_Identifier (Loc,
8240 Chars => Name_uResult),
8241 Parameter_Type => New_Occurrence_Of (Etype (Subp), Loc)));
8247 Post_Proc : constant Entity_Id :=
8248 Make_Defining_Identifier (Loc,
8249 Chars => Name_uPostconditions);
8250 -- The entity for the _Postconditions procedure
8252 Prepend_To (Declarations (N),
8253 Make_Subprogram_Body (Loc,
8255 Make_Procedure_Specification (Loc,
8256 Defining_Unit_Name => Post_Proc,
8257 Parameter_Specifications => Parms),
8259 Declarations => Empty_List,
8261 Handled_Statement_Sequence =>
8262 Make_Handled_Sequence_Of_Statements (Loc,
8263 Statements => Plist)));
8265 -- If this is a procedure, set the Postcondition_Proc attribute
8267 if Etype (Subp) = Standard_Void_Type then
8268 Set_Postcondition_Proc (Spec_Id, Post_Proc);
8272 if Present (Spec_Id) then
8273 Set_Has_Postconditions (Spec_Id);
8275 Set_Has_Postconditions (Body_Id);
8280 ----------------------------
8281 -- Reference_Body_Formals --
8282 ----------------------------
8284 procedure Reference_Body_Formals (Spec : Entity_Id; Bod : Entity_Id) is
8289 if Error_Posted (Spec) then
8293 -- Iterate over both lists. They may be of different lengths if the two
8294 -- specs are not conformant.
8296 Fs := First_Formal (Spec);
8297 Fb := First_Formal (Bod);
8298 while Present (Fs) and then Present (Fb) loop
8299 Generate_Reference (Fs, Fb, 'b');
8302 Style.Check_Identifier (Fb, Fs);
8305 Set_Spec_Entity (Fb, Fs);
8306 Set_Referenced (Fs, False);
8310 end Reference_Body_Formals;
8312 -------------------------
8313 -- Set_Actual_Subtypes --
8314 -------------------------
8316 procedure Set_Actual_Subtypes (N : Node_Id; Subp : Entity_Id) is
8317 Loc : constant Source_Ptr := Sloc (N);
8321 First_Stmt : Node_Id := Empty;
8322 AS_Needed : Boolean;
8325 -- If this is an empty initialization procedure, no need to create
8326 -- actual subtypes (small optimization).
8328 if Ekind (Subp) = E_Procedure
8329 and then Is_Null_Init_Proc (Subp)
8334 Formal := First_Formal (Subp);
8335 while Present (Formal) loop
8336 T := Etype (Formal);
8338 -- We never need an actual subtype for a constrained formal
8340 if Is_Constrained (T) then
8343 -- If we have unknown discriminants, then we do not need an actual
8344 -- subtype, or more accurately we cannot figure it out! Note that
8345 -- all class-wide types have unknown discriminants.
8347 elsif Has_Unknown_Discriminants (T) then
8350 -- At this stage we have an unconstrained type that may need an
8351 -- actual subtype. For sure the actual subtype is needed if we have
8352 -- an unconstrained array type.
8354 elsif Is_Array_Type (T) then
8357 -- The only other case needing an actual subtype is an unconstrained
8358 -- record type which is an IN parameter (we cannot generate actual
8359 -- subtypes for the OUT or IN OUT case, since an assignment can
8360 -- change the discriminant values. However we exclude the case of
8361 -- initialization procedures, since discriminants are handled very
8362 -- specially in this context, see the section entitled "Handling of
8363 -- Discriminants" in Einfo.
8365 -- We also exclude the case of Discrim_SO_Functions (functions used
8366 -- in front end layout mode for size/offset values), since in such
8367 -- functions only discriminants are referenced, and not only are such
8368 -- subtypes not needed, but they cannot always be generated, because
8369 -- of order of elaboration issues.
8371 elsif Is_Record_Type (T)
8372 and then Ekind (Formal) = E_In_Parameter
8373 and then Chars (Formal) /= Name_uInit
8374 and then not Is_Unchecked_Union (T)
8375 and then not Is_Discrim_SO_Function (Subp)
8379 -- All other cases do not need an actual subtype
8385 -- Generate actual subtypes for unconstrained arrays and
8386 -- unconstrained discriminated records.
8389 if Nkind (N) = N_Accept_Statement then
8391 -- If expansion is active, The formal is replaced by a local
8392 -- variable that renames the corresponding entry of the
8393 -- parameter block, and it is this local variable that may
8394 -- require an actual subtype.
8396 if Expander_Active then
8397 Decl := Build_Actual_Subtype (T, Renamed_Object (Formal));
8399 Decl := Build_Actual_Subtype (T, Formal);
8402 if Present (Handled_Statement_Sequence (N)) then
8404 First (Statements (Handled_Statement_Sequence (N)));
8405 Prepend (Decl, Statements (Handled_Statement_Sequence (N)));
8406 Mark_Rewrite_Insertion (Decl);
8408 -- If the accept statement has no body, there will be no
8409 -- reference to the actuals, so no need to compute actual
8416 Decl := Build_Actual_Subtype (T, Formal);
8417 Prepend (Decl, Declarations (N));
8418 Mark_Rewrite_Insertion (Decl);
8421 -- The declaration uses the bounds of an existing object, and
8422 -- therefore needs no constraint checks.
8424 Analyze (Decl, Suppress => All_Checks);
8426 -- We need to freeze manually the generated type when it is
8427 -- inserted anywhere else than in a declarative part.
8429 if Present (First_Stmt) then
8430 Insert_List_Before_And_Analyze (First_Stmt,
8431 Freeze_Entity (Defining_Identifier (Decl), Loc));
8434 if Nkind (N) = N_Accept_Statement
8435 and then Expander_Active
8437 Set_Actual_Subtype (Renamed_Object (Formal),
8438 Defining_Identifier (Decl));
8440 Set_Actual_Subtype (Formal, Defining_Identifier (Decl));
8444 Next_Formal (Formal);
8446 end Set_Actual_Subtypes;
8448 ---------------------
8449 -- Set_Formal_Mode --
8450 ---------------------
8452 procedure Set_Formal_Mode (Formal_Id : Entity_Id) is
8453 Spec : constant Node_Id := Parent (Formal_Id);
8456 -- Note: we set Is_Known_Valid for IN parameters and IN OUT parameters
8457 -- since we ensure that corresponding actuals are always valid at the
8458 -- point of the call.
8460 if Out_Present (Spec) then
8461 if Ekind (Scope (Formal_Id)) = E_Function
8462 or else Ekind (Scope (Formal_Id)) = E_Generic_Function
8464 Error_Msg_N ("functions can only have IN parameters", Spec);
8465 Set_Ekind (Formal_Id, E_In_Parameter);
8467 elsif In_Present (Spec) then
8468 Set_Ekind (Formal_Id, E_In_Out_Parameter);
8471 Set_Ekind (Formal_Id, E_Out_Parameter);
8472 Set_Never_Set_In_Source (Formal_Id, True);
8473 Set_Is_True_Constant (Formal_Id, False);
8474 Set_Current_Value (Formal_Id, Empty);
8478 Set_Ekind (Formal_Id, E_In_Parameter);
8481 -- Set Is_Known_Non_Null for access parameters since the language
8482 -- guarantees that access parameters are always non-null. We also set
8483 -- Can_Never_Be_Null, since there is no way to change the value.
8485 if Nkind (Parameter_Type (Spec)) = N_Access_Definition then
8487 -- Ada 2005 (AI-231): In Ada95, access parameters are always non-
8488 -- null; In Ada 2005, only if then null_exclusion is explicit.
8490 if Ada_Version < Ada_05
8491 or else Can_Never_Be_Null (Etype (Formal_Id))
8493 Set_Is_Known_Non_Null (Formal_Id);
8494 Set_Can_Never_Be_Null (Formal_Id);
8497 -- Ada 2005 (AI-231): Null-exclusion access subtype
8499 elsif Is_Access_Type (Etype (Formal_Id))
8500 and then Can_Never_Be_Null (Etype (Formal_Id))
8502 Set_Is_Known_Non_Null (Formal_Id);
8505 Set_Mechanism (Formal_Id, Default_Mechanism);
8506 Set_Formal_Validity (Formal_Id);
8507 end Set_Formal_Mode;
8509 -------------------------
8510 -- Set_Formal_Validity --
8511 -------------------------
8513 procedure Set_Formal_Validity (Formal_Id : Entity_Id) is
8515 -- If no validity checking, then we cannot assume anything about the
8516 -- validity of parameters, since we do not know there is any checking
8517 -- of the validity on the call side.
8519 if not Validity_Checks_On then
8522 -- If validity checking for parameters is enabled, this means we are
8523 -- not supposed to make any assumptions about argument values.
8525 elsif Validity_Check_Parameters then
8528 -- If we are checking in parameters, we will assume that the caller is
8529 -- also checking parameters, so we can assume the parameter is valid.
8531 elsif Ekind (Formal_Id) = E_In_Parameter
8532 and then Validity_Check_In_Params
8534 Set_Is_Known_Valid (Formal_Id, True);
8536 -- Similar treatment for IN OUT parameters
8538 elsif Ekind (Formal_Id) = E_In_Out_Parameter
8539 and then Validity_Check_In_Out_Params
8541 Set_Is_Known_Valid (Formal_Id, True);
8543 end Set_Formal_Validity;
8545 ------------------------
8546 -- Subtype_Conformant --
8547 ------------------------
8549 function Subtype_Conformant
8550 (New_Id : Entity_Id;
8552 Skip_Controlling_Formals : Boolean := False) return Boolean
8556 Check_Conformance (New_Id, Old_Id, Subtype_Conformant, False, Result,
8557 Skip_Controlling_Formals => Skip_Controlling_Formals);
8559 end Subtype_Conformant;
8561 ---------------------
8562 -- Type_Conformant --
8563 ---------------------
8565 function Type_Conformant
8566 (New_Id : Entity_Id;
8568 Skip_Controlling_Formals : Boolean := False) return Boolean
8572 May_Hide_Profile := False;
8575 (New_Id, Old_Id, Type_Conformant, False, Result,
8576 Skip_Controlling_Formals => Skip_Controlling_Formals);
8578 end Type_Conformant;
8580 -------------------------------
8581 -- Valid_Operator_Definition --
8582 -------------------------------
8584 procedure Valid_Operator_Definition (Designator : Entity_Id) is
8587 Id : constant Name_Id := Chars (Designator);
8591 F := First_Formal (Designator);
8592 while Present (F) loop
8595 if Present (Default_Value (F)) then
8597 ("default values not allowed for operator parameters",
8604 -- Verify that user-defined operators have proper number of arguments
8605 -- First case of operators which can only be unary
8608 or else Id = Name_Op_Abs
8612 -- Case of operators which can be unary or binary
8614 elsif Id = Name_Op_Add
8615 or Id = Name_Op_Subtract
8617 N_OK := (N in 1 .. 2);
8619 -- All other operators can only be binary
8627 ("incorrect number of arguments for operator", Designator);
8631 and then Base_Type (Etype (Designator)) = Standard_Boolean
8632 and then not Is_Intrinsic_Subprogram (Designator)
8635 ("explicit definition of inequality not allowed", Designator);
8637 end Valid_Operator_Definition;