1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2010, 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. This is split out so
114 -- that we can use RETURN but not skip the debug output at the end.
116 procedure Analyze_Generic_Subprogram_Body (N : Node_Id; Gen_Id : Entity_Id);
117 -- Analyze a generic subprogram body. N is the body to be analyzed, and
118 -- Gen_Id is the defining entity Id for the corresponding spec.
120 procedure Build_Body_To_Inline (N : Node_Id; Subp : Entity_Id);
121 -- If a subprogram has pragma Inline and inlining is active, use generic
122 -- machinery to build an unexpanded body for the subprogram. This body is
123 -- subsequently used for inline expansions at call sites. If subprogram can
124 -- be inlined (depending on size and nature of local declarations) this
125 -- function returns true. Otherwise subprogram body is treated normally.
126 -- If proper warnings are enabled and the subprogram contains a construct
127 -- that cannot be inlined, the offending construct is flagged accordingly.
129 procedure Check_Conformance
132 Ctype : Conformance_Type;
134 Conforms : out Boolean;
135 Err_Loc : Node_Id := Empty;
136 Get_Inst : Boolean := False;
137 Skip_Controlling_Formals : Boolean := False);
138 -- Given two entities, this procedure checks that the profiles associated
139 -- with these entities meet the conformance criterion given by the third
140 -- parameter. If they conform, Conforms is set True and control returns
141 -- to the caller. If they do not conform, Conforms is set to False, and
142 -- in addition, if Errmsg is True on the call, proper messages are output
143 -- to complain about the conformance failure. If Err_Loc is non_Empty
144 -- the error messages are placed on Err_Loc, if Err_Loc is empty, then
145 -- error messages are placed on the appropriate part of the construct
146 -- denoted by New_Id. If Get_Inst is true, then this is a mode conformance
147 -- against a formal access-to-subprogram type so Get_Instance_Of must
150 procedure Check_Subprogram_Order (N : Node_Id);
151 -- N is the N_Subprogram_Body node for a subprogram. This routine applies
152 -- the alpha ordering rule for N if this ordering requirement applicable.
154 procedure Check_Returns
158 Proc : Entity_Id := Empty);
159 -- Called to check for missing return statements in a function body, or for
160 -- returns present in a procedure body which has No_Return set. HSS is the
161 -- handled statement sequence for the subprogram body. This procedure
162 -- checks all flow paths to make sure they either have return (Mode = 'F',
163 -- used for functions) or do not have a return (Mode = 'P', used for
164 -- No_Return procedures). The flag Err is set if there are any control
165 -- paths not explicitly terminated by a return in the function case, and is
166 -- True otherwise. Proc is the entity for the procedure case and is used
167 -- in posting the warning message.
169 procedure Check_Untagged_Equality (Eq_Op : Entity_Id);
170 -- In Ada 2012, a primitive equality operator on an untagged record type
171 -- must appear before the type is frozen, and have the same visibility as
172 -- that of the type. This procedure checks that this rule is met, and
173 -- otherwise emits an error on the subprogram declaration and a warning
174 -- on the earlier freeze point if it is easy to locate.
176 procedure Enter_Overloaded_Entity (S : Entity_Id);
177 -- This procedure makes S, a new overloaded entity, into the first visible
178 -- entity with that name.
180 procedure Install_Entity (E : Entity_Id);
181 -- Make single entity visible. Used for generic formals as well
183 function Is_Non_Overriding_Operation
185 New_E : Entity_Id) return Boolean;
186 -- Enforce the rule given in 12.3(18): a private operation in an instance
187 -- overrides an inherited operation only if the corresponding operation
188 -- was overriding in the generic. This can happen for primitive operations
189 -- of types derived (in the generic unit) from formal private or formal
192 procedure Make_Inequality_Operator (S : Entity_Id);
193 -- Create the declaration for an inequality operator that is implicitly
194 -- created by a user-defined equality operator that yields a boolean.
196 procedure May_Need_Actuals (Fun : Entity_Id);
197 -- Flag functions that can be called without parameters, i.e. those that
198 -- have no parameters, or those for which defaults exist for all parameters
200 procedure Process_PPCs
203 Body_Id : Entity_Id);
204 -- Called from Analyze[_Generic]_Subprogram_Body to deal with scanning post
205 -- conditions for the body and assembling and inserting the _postconditions
206 -- procedure. N is the node for the subprogram body and Body_Id/Spec_Id are
207 -- the entities for the body and separate spec (if there is no separate
208 -- spec, Spec_Id is Empty).
210 procedure Set_Formal_Validity (Formal_Id : Entity_Id);
211 -- Formal_Id is an formal parameter entity. This procedure deals with
212 -- setting the proper validity status for this entity, which depends on
213 -- the kind of parameter and the validity checking mode.
215 ------------------------------
216 -- Analyze_Return_Statement --
217 ------------------------------
219 procedure Analyze_Return_Statement (N : Node_Id) is
221 pragma Assert (Nkind_In (N, N_Simple_Return_Statement,
222 N_Extended_Return_Statement));
224 Returns_Object : constant Boolean :=
225 Nkind (N) = N_Extended_Return_Statement
227 (Nkind (N) = N_Simple_Return_Statement
228 and then Present (Expression (N)));
229 -- True if we're returning something; that is, "return <expression>;"
230 -- or "return Result : T [:= ...]". False for "return;". Used for error
231 -- checking: If Returns_Object is True, N should apply to a function
232 -- body; otherwise N should apply to a procedure body, entry body,
233 -- accept statement, or extended return statement.
235 function Find_What_It_Applies_To return Entity_Id;
236 -- Find the entity representing the innermost enclosing body, accept
237 -- statement, or extended return statement. If the result is a callable
238 -- construct or extended return statement, then this will be the value
239 -- of the Return_Applies_To attribute. Otherwise, the program is
240 -- illegal. See RM-6.5(4/2).
242 -----------------------------
243 -- Find_What_It_Applies_To --
244 -----------------------------
246 function Find_What_It_Applies_To return Entity_Id is
247 Result : Entity_Id := Empty;
250 -- Loop outward through the Scope_Stack, skipping blocks and loops
252 for J in reverse 0 .. Scope_Stack.Last loop
253 Result := Scope_Stack.Table (J).Entity;
254 exit when Ekind (Result) /= E_Block and then
255 Ekind (Result) /= E_Loop;
258 pragma Assert (Present (Result));
260 end Find_What_It_Applies_To;
262 -- Local declarations
264 Scope_Id : constant Entity_Id := Find_What_It_Applies_To;
265 Kind : constant Entity_Kind := Ekind (Scope_Id);
266 Loc : constant Source_Ptr := Sloc (N);
267 Stm_Entity : constant Entity_Id :=
269 (E_Return_Statement, Current_Scope, Loc, 'R');
271 -- Start of processing for Analyze_Return_Statement
274 Set_Return_Statement_Entity (N, Stm_Entity);
276 Set_Etype (Stm_Entity, Standard_Void_Type);
277 Set_Return_Applies_To (Stm_Entity, Scope_Id);
279 -- Place Return entity on scope stack, to simplify enforcement of 6.5
280 -- (4/2): an inner return statement will apply to this extended return.
282 if Nkind (N) = N_Extended_Return_Statement then
283 Push_Scope (Stm_Entity);
286 -- Check that pragma No_Return is obeyed. Don't complain about the
287 -- implicitly-generated return that is placed at the end.
289 if No_Return (Scope_Id) and then Comes_From_Source (N) then
290 Error_Msg_N ("RETURN statement not allowed (No_Return)", N);
293 -- Warn on any unassigned OUT parameters if in procedure
295 if Ekind (Scope_Id) = E_Procedure then
296 Warn_On_Unassigned_Out_Parameter (N, Scope_Id);
299 -- Check that functions return objects, and other things do not
301 if Kind = E_Function or else Kind = E_Generic_Function then
302 if not Returns_Object then
303 Error_Msg_N ("missing expression in return from function", N);
306 elsif Kind = E_Procedure or else Kind = E_Generic_Procedure then
307 if Returns_Object then
308 Error_Msg_N ("procedure cannot return value (use function)", N);
311 elsif Kind = E_Entry or else Kind = E_Entry_Family then
312 if Returns_Object then
313 if Is_Protected_Type (Scope (Scope_Id)) then
314 Error_Msg_N ("entry body cannot return value", N);
316 Error_Msg_N ("accept statement cannot return value", N);
320 elsif Kind = E_Return_Statement then
322 -- We are nested within another return statement, which must be an
323 -- extended_return_statement.
325 if Returns_Object then
327 ("extended_return_statement cannot return value; " &
328 "use `""RETURN;""`", N);
332 Error_Msg_N ("illegal context for return statement", N);
335 if Kind = E_Function or else Kind = E_Generic_Function then
336 Analyze_Function_Return (N);
339 if Nkind (N) = N_Extended_Return_Statement then
343 Kill_Current_Values (Last_Assignment_Only => True);
344 Check_Unreachable_Code (N);
345 end Analyze_Return_Statement;
347 ---------------------------------------------
348 -- Analyze_Abstract_Subprogram_Declaration --
349 ---------------------------------------------
351 procedure Analyze_Abstract_Subprogram_Declaration (N : Node_Id) is
352 Designator : constant Entity_Id :=
353 Analyze_Subprogram_Specification (Specification (N));
354 Scop : constant Entity_Id := Current_Scope;
357 Generate_Definition (Designator);
358 Set_Is_Abstract_Subprogram (Designator);
359 New_Overloaded_Entity (Designator);
360 Check_Delayed_Subprogram (Designator);
362 Set_Categorization_From_Scope (Designator, Scop);
364 if Ekind (Scope (Designator)) = E_Protected_Type then
366 ("abstract subprogram not allowed in protected type", N);
368 -- Issue a warning if the abstract subprogram is neither a dispatching
369 -- operation nor an operation that overrides an inherited subprogram or
370 -- predefined operator, since this most likely indicates a mistake.
372 elsif Warn_On_Redundant_Constructs
373 and then not Is_Dispatching_Operation (Designator)
374 and then not Is_Overriding_Operation (Designator)
375 and then (not Is_Operator_Symbol_Name (Chars (Designator))
376 or else Scop /= Scope (Etype (First_Formal (Designator))))
379 ("?abstract subprogram is not dispatching or overriding", N);
382 Generate_Reference_To_Formals (Designator);
383 Check_Eliminated (Designator);
384 end Analyze_Abstract_Subprogram_Declaration;
386 ----------------------------------------
387 -- Analyze_Extended_Return_Statement --
388 ----------------------------------------
390 procedure Analyze_Extended_Return_Statement (N : Node_Id) is
392 Analyze_Return_Statement (N);
393 end Analyze_Extended_Return_Statement;
395 ----------------------------
396 -- Analyze_Function_Call --
397 ----------------------------
399 procedure Analyze_Function_Call (N : Node_Id) is
400 P : constant Node_Id := Name (N);
401 L : constant List_Id := Parameter_Associations (N);
407 -- A call of the form A.B (X) may be an Ada05 call, which is rewritten
408 -- as B (A, X). If the rewriting is successful, the call has been
409 -- analyzed and we just return.
411 if Nkind (P) = N_Selected_Component
412 and then Name (N) /= P
413 and then Is_Rewrite_Substitution (N)
414 and then Present (Etype (N))
419 -- If error analyzing name, then set Any_Type as result type and return
421 if Etype (P) = Any_Type then
422 Set_Etype (N, Any_Type);
426 -- Otherwise analyze the parameters
430 while Present (Actual) loop
432 Check_Parameterless_Call (Actual);
438 end Analyze_Function_Call;
440 -----------------------------
441 -- Analyze_Function_Return --
442 -----------------------------
444 procedure Analyze_Function_Return (N : Node_Id) is
445 Loc : constant Source_Ptr := Sloc (N);
446 Stm_Entity : constant Entity_Id := Return_Statement_Entity (N);
447 Scope_Id : constant Entity_Id := Return_Applies_To (Stm_Entity);
449 R_Type : constant Entity_Id := Etype (Scope_Id);
450 -- Function result subtype
452 procedure Check_Limited_Return (Expr : Node_Id);
453 -- Check the appropriate (Ada 95 or Ada 2005) rules for returning
454 -- limited types. Used only for simple return statements.
455 -- Expr is the expression returned.
457 procedure Check_Return_Subtype_Indication (Obj_Decl : Node_Id);
458 -- Check that the return_subtype_indication properly matches the result
459 -- subtype of the function, as required by RM-6.5(5.1/2-5.3/2).
461 --------------------------
462 -- Check_Limited_Return --
463 --------------------------
465 procedure Check_Limited_Return (Expr : Node_Id) is
467 -- Ada 2005 (AI-318-02): Return-by-reference types have been
468 -- removed and replaced by anonymous access results. This is an
469 -- incompatibility with Ada 95. Not clear whether this should be
470 -- enforced yet or perhaps controllable with special switch. ???
472 if Is_Limited_Type (R_Type)
473 and then Comes_From_Source (N)
474 and then not In_Instance_Body
475 and then not OK_For_Limited_Init_In_05 (R_Type, Expr)
479 if Ada_Version >= Ada_05
480 and then not Debug_Flag_Dot_L
481 and then not GNAT_Mode
484 ("(Ada 2005) cannot copy object of a limited type " &
485 "(RM-2005 6.5(5.5/2))", Expr);
487 if Is_Immutably_Limited_Type (R_Type) then
489 ("\return by reference not permitted in Ada 2005", Expr);
492 -- Warn in Ada 95 mode, to give folks a heads up about this
495 -- In GNAT mode, this is just a warning, to allow it to be
496 -- evilly turned off. Otherwise it is a real error.
498 elsif Warn_On_Ada_2005_Compatibility or GNAT_Mode then
499 if Is_Immutably_Limited_Type (R_Type) then
501 ("return by reference not permitted in Ada 2005 " &
502 "(RM-2005 6.5(5.5/2))?", Expr);
505 ("cannot copy object of a limited type in Ada 2005 " &
506 "(RM-2005 6.5(5.5/2))?", Expr);
509 -- Ada 95 mode, compatibility warnings disabled
512 return; -- skip continuation messages below
516 ("\consider switching to return of access type", Expr);
517 Explain_Limited_Type (R_Type, Expr);
519 end Check_Limited_Return;
521 -------------------------------------
522 -- Check_Return_Subtype_Indication --
523 -------------------------------------
525 procedure Check_Return_Subtype_Indication (Obj_Decl : Node_Id) is
526 Return_Obj : constant Node_Id := Defining_Identifier (Obj_Decl);
528 R_Stm_Type : constant Entity_Id := Etype (Return_Obj);
529 -- Subtype given in the extended return statement (must match R_Type)
531 Subtype_Ind : constant Node_Id :=
532 Object_Definition (Original_Node (Obj_Decl));
534 R_Type_Is_Anon_Access :
536 Ekind (R_Type) = E_Anonymous_Access_Subprogram_Type
538 Ekind (R_Type) = E_Anonymous_Access_Protected_Subprogram_Type
540 Ekind (R_Type) = E_Anonymous_Access_Type;
541 -- True if return type of the function is an anonymous access type
542 -- Can't we make Is_Anonymous_Access_Type in einfo ???
544 R_Stm_Type_Is_Anon_Access :
546 Ekind (R_Stm_Type) = E_Anonymous_Access_Subprogram_Type
548 Ekind (R_Stm_Type) = E_Anonymous_Access_Protected_Subprogram_Type
550 Ekind (R_Stm_Type) = E_Anonymous_Access_Type;
551 -- True if type of the return object is an anonymous access type
554 -- First, avoid cascaded errors
556 if Error_Posted (Obj_Decl) or else Error_Posted (Subtype_Ind) then
560 -- "return access T" case; check that the return statement also has
561 -- "access T", and that the subtypes statically match:
562 -- if this is an access to subprogram the signatures must match.
564 if R_Type_Is_Anon_Access then
565 if R_Stm_Type_Is_Anon_Access then
567 Ekind (Designated_Type (R_Stm_Type)) /= E_Subprogram_Type
569 if Base_Type (Designated_Type (R_Stm_Type)) /=
570 Base_Type (Designated_Type (R_Type))
571 or else not Subtypes_Statically_Match (R_Stm_Type, R_Type)
574 ("subtype must statically match function result subtype",
575 Subtype_Mark (Subtype_Ind));
579 -- For two anonymous access to subprogram types, the
580 -- types themselves must be type conformant.
582 if not Conforming_Types
583 (R_Stm_Type, R_Type, Fully_Conformant)
586 ("subtype must statically match function result subtype",
592 Error_Msg_N ("must use anonymous access type", Subtype_Ind);
595 -- Subtype indication case: check that the return object's type is
596 -- covered by the result type, and that the subtypes statically match
597 -- when the result subtype is constrained. Also handle record types
598 -- with unknown discriminants for which we have built the underlying
599 -- record view. Coverage is needed to allow specific-type return
600 -- objects when the result type is class-wide (see AI05-32).
602 elsif Covers (Base_Type (R_Type), Base_Type (R_Stm_Type))
603 or else (Is_Underlying_Record_View (Base_Type (R_Stm_Type))
607 Underlying_Record_View (Base_Type (R_Stm_Type))))
609 -- A null exclusion may be present on the return type, on the
610 -- function specification, on the object declaration or on the
613 if Is_Access_Type (R_Type)
615 (Can_Never_Be_Null (R_Type)
616 or else Null_Exclusion_Present (Parent (Scope_Id))) /=
617 Can_Never_Be_Null (R_Stm_Type)
620 ("subtype must statically match function result subtype",
624 -- AI05-103: for elementary types, subtypes must statically match
626 if Is_Constrained (R_Type)
627 or else Is_Access_Type (R_Type)
629 if not Subtypes_Statically_Match (R_Stm_Type, R_Type) then
631 ("subtype must statically match function result subtype",
636 elsif Etype (Base_Type (R_Type)) = R_Stm_Type
637 and then Is_Null_Extension (Base_Type (R_Type))
643 ("wrong type for return_subtype_indication", Subtype_Ind);
645 end Check_Return_Subtype_Indication;
647 ---------------------
648 -- Local Variables --
649 ---------------------
653 -- Start of processing for Analyze_Function_Return
656 Set_Return_Present (Scope_Id);
658 if Nkind (N) = N_Simple_Return_Statement then
659 Expr := Expression (N);
660 Analyze_And_Resolve (Expr, R_Type);
661 Check_Limited_Return (Expr);
664 -- Analyze parts specific to extended_return_statement:
667 Obj_Decl : constant Node_Id :=
668 Last (Return_Object_Declarations (N));
670 HSS : constant Node_Id := Handled_Statement_Sequence (N);
673 Expr := Expression (Obj_Decl);
675 -- Note: The check for OK_For_Limited_Init will happen in
676 -- Analyze_Object_Declaration; we treat it as a normal
677 -- object declaration.
679 Set_Is_Return_Object (Defining_Identifier (Obj_Decl));
682 Check_Return_Subtype_Indication (Obj_Decl);
684 if Present (HSS) then
687 if Present (Exception_Handlers (HSS)) then
689 -- ???Has_Nested_Block_With_Handler needs to be set.
690 -- Probably by creating an actual N_Block_Statement.
691 -- Probably in Expand.
697 -- Mark the return object as referenced, since the return is an
698 -- implicit reference of the object.
700 Set_Referenced (Defining_Identifier (Obj_Decl));
702 Check_References (Stm_Entity);
706 -- Case of Expr present
710 -- Defend against previous errors
712 and then Nkind (Expr) /= N_Empty
713 and then Present (Etype (Expr))
715 -- Apply constraint check. Note that this is done before the implicit
716 -- conversion of the expression done for anonymous access types to
717 -- ensure correct generation of the null-excluding check associated
718 -- with null-excluding expressions found in return statements.
720 Apply_Constraint_Check (Expr, R_Type);
722 -- Ada 2005 (AI-318-02): When the result type is an anonymous access
723 -- type, apply an implicit conversion of the expression to that type
724 -- to force appropriate static and run-time accessibility checks.
726 if Ada_Version >= Ada_05
727 and then Ekind (R_Type) = E_Anonymous_Access_Type
729 Rewrite (Expr, Convert_To (R_Type, Relocate_Node (Expr)));
730 Analyze_And_Resolve (Expr, R_Type);
733 -- If the result type is class-wide, then check that the return
734 -- expression's type is not declared at a deeper level than the
735 -- function (RM05-6.5(5.6/2)).
737 if Ada_Version >= Ada_05
738 and then Is_Class_Wide_Type (R_Type)
740 if Type_Access_Level (Etype (Expr)) >
741 Subprogram_Access_Level (Scope_Id)
744 ("level of return expression type is deeper than " &
745 "class-wide function!", Expr);
749 -- Check incorrect use of dynamically tagged expression
751 if Is_Tagged_Type (R_Type) then
752 Check_Dynamically_Tagged_Expression
758 -- ??? A real run-time accessibility check is needed in cases
759 -- involving dereferences of access parameters. For now we just
760 -- check the static cases.
762 if (Ada_Version < Ada_05 or else Debug_Flag_Dot_L)
763 and then Is_Immutably_Limited_Type (Etype (Scope_Id))
764 and then Object_Access_Level (Expr) >
765 Subprogram_Access_Level (Scope_Id)
768 Make_Raise_Program_Error (Loc,
769 Reason => PE_Accessibility_Check_Failed));
773 ("cannot return a local value by reference?", N);
775 ("\& will be raised at run time?",
776 N, Standard_Program_Error);
780 and then Nkind (Parent (Scope_Id)) = N_Function_Specification
781 and then Null_Exclusion_Present (Parent (Scope_Id))
783 Apply_Compile_Time_Constraint_Error
785 Msg => "(Ada 2005) null not allowed for "
786 & "null-excluding return?",
787 Reason => CE_Null_Not_Allowed);
790 -- Apply checks suggested by AI05-0144 (dangerous order dependence)
791 -- (Disabled for now)
793 -- Check_Order_Dependence;
795 end Analyze_Function_Return;
797 -------------------------------------
798 -- Analyze_Generic_Subprogram_Body --
799 -------------------------------------
801 procedure Analyze_Generic_Subprogram_Body
805 Gen_Decl : constant Node_Id := Unit_Declaration_Node (Gen_Id);
806 Kind : constant Entity_Kind := Ekind (Gen_Id);
812 -- Copy body and disable expansion while analyzing the generic For a
813 -- stub, do not copy the stub (which would load the proper body), this
814 -- will be done when the proper body is analyzed.
816 if Nkind (N) /= N_Subprogram_Body_Stub then
817 New_N := Copy_Generic_Node (N, Empty, Instantiating => False);
822 Spec := Specification (N);
824 -- Within the body of the generic, the subprogram is callable, and
825 -- behaves like the corresponding non-generic unit.
827 Body_Id := Defining_Entity (Spec);
829 if Kind = E_Generic_Procedure
830 and then Nkind (Spec) /= N_Procedure_Specification
832 Error_Msg_N ("invalid body for generic procedure ", Body_Id);
835 elsif Kind = E_Generic_Function
836 and then Nkind (Spec) /= N_Function_Specification
838 Error_Msg_N ("invalid body for generic function ", Body_Id);
842 Set_Corresponding_Body (Gen_Decl, Body_Id);
844 if Has_Completion (Gen_Id)
845 and then Nkind (Parent (N)) /= N_Subunit
847 Error_Msg_N ("duplicate generic body", N);
850 Set_Has_Completion (Gen_Id);
853 if Nkind (N) = N_Subprogram_Body_Stub then
854 Set_Ekind (Defining_Entity (Specification (N)), Kind);
856 Set_Corresponding_Spec (N, Gen_Id);
859 if Nkind (Parent (N)) = N_Compilation_Unit then
860 Set_Cunit_Entity (Current_Sem_Unit, Defining_Entity (N));
863 -- Make generic parameters immediately visible in the body. They are
864 -- needed to process the formals declarations. Then make the formals
865 -- visible in a separate step.
871 First_Ent : Entity_Id;
874 First_Ent := First_Entity (Gen_Id);
877 while Present (E) and then not Is_Formal (E) loop
882 Set_Use (Generic_Formal_Declarations (Gen_Decl));
884 -- Now generic formals are visible, and the specification can be
885 -- analyzed, for subsequent conformance check.
887 Body_Id := Analyze_Subprogram_Specification (Spec);
889 -- Make formal parameters visible
893 -- E is the first formal parameter, we loop through the formals
894 -- installing them so that they will be visible.
896 Set_First_Entity (Gen_Id, E);
897 while Present (E) loop
903 -- Visible generic entity is callable within its own body
905 Set_Ekind (Gen_Id, Ekind (Body_Id));
906 Set_Ekind (Body_Id, E_Subprogram_Body);
907 Set_Convention (Body_Id, Convention (Gen_Id));
908 Set_Is_Obsolescent (Body_Id, Is_Obsolescent (Gen_Id));
909 Set_Scope (Body_Id, Scope (Gen_Id));
910 Check_Fully_Conformant (Body_Id, Gen_Id, Body_Id);
912 if Nkind (N) = N_Subprogram_Body_Stub then
914 -- No body to analyze, so restore state of generic unit
916 Set_Ekind (Gen_Id, Kind);
917 Set_Ekind (Body_Id, Kind);
919 if Present (First_Ent) then
920 Set_First_Entity (Gen_Id, First_Ent);
927 -- If this is a compilation unit, it must be made visible explicitly,
928 -- because the compilation of the declaration, unlike other library
929 -- unit declarations, does not. If it is not a unit, the following
930 -- is redundant but harmless.
932 Set_Is_Immediately_Visible (Gen_Id);
933 Reference_Body_Formals (Gen_Id, Body_Id);
935 if Is_Child_Unit (Gen_Id) then
936 Generate_Reference (Gen_Id, Scope (Gen_Id), 'k', False);
939 Set_Actual_Subtypes (N, Current_Scope);
940 Process_PPCs (N, Gen_Id, Body_Id);
942 -- If the generic unit carries pre- or post-conditions, copy them
943 -- to the original generic tree, so that they are properly added
944 -- to any instantiation.
947 Orig : constant Node_Id := Original_Node (N);
951 Cond := First (Declarations (N));
952 while Present (Cond) loop
953 if Nkind (Cond) = N_Pragma
954 and then Pragma_Name (Cond) = Name_Check
956 Prepend (New_Copy_Tree (Cond), Declarations (Orig));
958 elsif Nkind (Cond) = N_Pragma
959 and then Pragma_Name (Cond) = Name_Postcondition
961 Set_Ekind (Defining_Entity (Orig), Ekind (Gen_Id));
962 Prepend (New_Copy_Tree (Cond), Declarations (Orig));
971 Analyze_Declarations (Declarations (N));
973 Analyze (Handled_Statement_Sequence (N));
975 Save_Global_References (Original_Node (N));
977 -- Prior to exiting the scope, include generic formals again (if any
978 -- are present) in the set of local entities.
980 if Present (First_Ent) then
981 Set_First_Entity (Gen_Id, First_Ent);
984 Check_References (Gen_Id);
987 Process_End_Label (Handled_Statement_Sequence (N), 't', Current_Scope);
989 Check_Subprogram_Order (N);
991 -- Outside of its body, unit is generic again
993 Set_Ekind (Gen_Id, Kind);
994 Generate_Reference (Gen_Id, Body_Id, 'b', Set_Ref => False);
997 Style.Check_Identifier (Body_Id, Gen_Id);
1001 end Analyze_Generic_Subprogram_Body;
1003 -----------------------------
1004 -- Analyze_Operator_Symbol --
1005 -----------------------------
1007 -- An operator symbol such as "+" or "and" may appear in context where the
1008 -- literal denotes an entity name, such as "+"(x, y) or in context when it
1009 -- is just a string, as in (conjunction = "or"). In these cases the parser
1010 -- generates this node, and the semantics does the disambiguation. Other
1011 -- such case are actuals in an instantiation, the generic unit in an
1012 -- instantiation, and pragma arguments.
1014 procedure Analyze_Operator_Symbol (N : Node_Id) is
1015 Par : constant Node_Id := Parent (N);
1018 if (Nkind (Par) = N_Function_Call
1019 and then N = Name (Par))
1020 or else Nkind (Par) = N_Function_Instantiation
1021 or else (Nkind (Par) = N_Indexed_Component
1022 and then N = Prefix (Par))
1023 or else (Nkind (Par) = N_Pragma_Argument_Association
1024 and then not Is_Pragma_String_Literal (Par))
1025 or else Nkind (Par) = N_Subprogram_Renaming_Declaration
1026 or else (Nkind (Par) = N_Attribute_Reference
1027 and then Attribute_Name (Par) /= Name_Value)
1029 Find_Direct_Name (N);
1032 Change_Operator_Symbol_To_String_Literal (N);
1035 end Analyze_Operator_Symbol;
1037 -----------------------------------
1038 -- Analyze_Parameter_Association --
1039 -----------------------------------
1041 procedure Analyze_Parameter_Association (N : Node_Id) is
1043 Analyze (Explicit_Actual_Parameter (N));
1044 end Analyze_Parameter_Association;
1046 --------------------------------------
1047 -- Analyze_Parameterized_Expression --
1048 --------------------------------------
1050 procedure Analyze_Parameterized_Expression (N : Node_Id) is
1051 Loc : constant Source_Ptr := Sloc (N);
1052 LocX : constant Source_Ptr := Sloc (Expression (N));
1055 -- This is one of the occasions on which we write things during semantic
1056 -- analysis. Transform the parameterized expression into an equivalent
1057 -- subprogram body, and then analyze that.
1060 Make_Subprogram_Body (Loc,
1061 Specification => Specification (N),
1062 Declarations => Empty_List,
1063 Handled_Statement_Sequence =>
1064 Make_Handled_Sequence_Of_Statements (LocX,
1065 Statements => New_List (
1066 Make_Simple_Return_Statement (LocX,
1067 Expression => Expression (N))))));
1069 end Analyze_Parameterized_Expression;
1071 ----------------------------
1072 -- Analyze_Procedure_Call --
1073 ----------------------------
1075 procedure Analyze_Procedure_Call (N : Node_Id) is
1076 Loc : constant Source_Ptr := Sloc (N);
1077 P : constant Node_Id := Name (N);
1078 Actuals : constant List_Id := Parameter_Associations (N);
1082 procedure Analyze_Call_And_Resolve;
1083 -- Do Analyze and Resolve calls for procedure call
1084 -- At end, check illegal order dependence.
1086 ------------------------------
1087 -- Analyze_Call_And_Resolve --
1088 ------------------------------
1090 procedure Analyze_Call_And_Resolve is
1092 if Nkind (N) = N_Procedure_Call_Statement then
1094 Resolve (N, Standard_Void_Type);
1096 -- Apply checks suggested by AI05-0144 (Disabled for now)
1098 -- Check_Order_Dependence;
1103 end Analyze_Call_And_Resolve;
1105 -- Start of processing for Analyze_Procedure_Call
1108 -- The syntactic construct: PREFIX ACTUAL_PARAMETER_PART can denote
1109 -- a procedure call or an entry call. The prefix may denote an access
1110 -- to subprogram type, in which case an implicit dereference applies.
1111 -- If the prefix is an indexed component (without implicit dereference)
1112 -- then the construct denotes a call to a member of an entire family.
1113 -- If the prefix is a simple name, it may still denote a call to a
1114 -- parameterless member of an entry family. Resolution of these various
1115 -- interpretations is delicate.
1119 -- If this is a call of the form Obj.Op, the call may have been
1120 -- analyzed and possibly rewritten into a block, in which case
1123 if Analyzed (N) then
1127 -- If there is an error analyzing the name (which may have been
1128 -- rewritten if the original call was in prefix notation) then error
1129 -- has been emitted already, mark node and return.
1132 or else Etype (Name (N)) = Any_Type
1134 Set_Etype (N, Any_Type);
1138 -- Otherwise analyze the parameters
1140 if Present (Actuals) then
1141 Actual := First (Actuals);
1143 while Present (Actual) loop
1145 Check_Parameterless_Call (Actual);
1150 -- Special processing for Elab_Spec and Elab_Body calls
1152 if Nkind (P) = N_Attribute_Reference
1153 and then (Attribute_Name (P) = Name_Elab_Spec
1154 or else Attribute_Name (P) = Name_Elab_Body)
1156 if Present (Actuals) then
1158 ("no parameters allowed for this call", First (Actuals));
1162 Set_Etype (N, Standard_Void_Type);
1165 elsif Is_Entity_Name (P)
1166 and then Is_Record_Type (Etype (Entity (P)))
1167 and then Remote_AST_I_Dereference (P)
1171 elsif Is_Entity_Name (P)
1172 and then Ekind (Entity (P)) /= E_Entry_Family
1174 if Is_Access_Type (Etype (P))
1175 and then Ekind (Designated_Type (Etype (P))) = E_Subprogram_Type
1176 and then No (Actuals)
1177 and then Comes_From_Source (N)
1179 Error_Msg_N ("missing explicit dereference in call", N);
1182 Analyze_Call_And_Resolve;
1184 -- If the prefix is the simple name of an entry family, this is
1185 -- a parameterless call from within the task body itself.
1187 elsif Is_Entity_Name (P)
1188 and then Nkind (P) = N_Identifier
1189 and then Ekind (Entity (P)) = E_Entry_Family
1190 and then Present (Actuals)
1191 and then No (Next (First (Actuals)))
1193 -- Can be call to parameterless entry family. What appears to be the
1194 -- sole argument is in fact the entry index. Rewrite prefix of node
1195 -- accordingly. Source representation is unchanged by this
1199 Make_Indexed_Component (Loc,
1201 Make_Selected_Component (Loc,
1202 Prefix => New_Occurrence_Of (Scope (Entity (P)), Loc),
1203 Selector_Name => New_Occurrence_Of (Entity (P), Loc)),
1204 Expressions => Actuals);
1205 Set_Name (N, New_N);
1206 Set_Etype (New_N, Standard_Void_Type);
1207 Set_Parameter_Associations (N, No_List);
1208 Analyze_Call_And_Resolve;
1210 elsif Nkind (P) = N_Explicit_Dereference then
1211 if Ekind (Etype (P)) = E_Subprogram_Type then
1212 Analyze_Call_And_Resolve;
1214 Error_Msg_N ("expect access to procedure in call", P);
1217 -- The name can be a selected component or an indexed component that
1218 -- yields an access to subprogram. Such a prefix is legal if the call
1219 -- has parameter associations.
1221 elsif Is_Access_Type (Etype (P))
1222 and then Ekind (Designated_Type (Etype (P))) = E_Subprogram_Type
1224 if Present (Actuals) then
1225 Analyze_Call_And_Resolve;
1227 Error_Msg_N ("missing explicit dereference in call ", N);
1230 -- If not an access to subprogram, then the prefix must resolve to the
1231 -- name of an entry, entry family, or protected operation.
1233 -- For the case of a simple entry call, P is a selected component where
1234 -- the prefix is the task and the selector name is the entry. A call to
1235 -- a protected procedure will have the same syntax. If the protected
1236 -- object contains overloaded operations, the entity may appear as a
1237 -- function, the context will select the operation whose type is Void.
1239 elsif Nkind (P) = N_Selected_Component
1240 and then (Ekind (Entity (Selector_Name (P))) = E_Entry
1242 Ekind (Entity (Selector_Name (P))) = E_Procedure
1244 Ekind (Entity (Selector_Name (P))) = E_Function)
1246 Analyze_Call_And_Resolve;
1248 elsif Nkind (P) = N_Selected_Component
1249 and then Ekind (Entity (Selector_Name (P))) = E_Entry_Family
1250 and then Present (Actuals)
1251 and then No (Next (First (Actuals)))
1253 -- Can be call to parameterless entry family. What appears to be the
1254 -- sole argument is in fact the entry index. Rewrite prefix of node
1255 -- accordingly. Source representation is unchanged by this
1259 Make_Indexed_Component (Loc,
1260 Prefix => New_Copy (P),
1261 Expressions => Actuals);
1262 Set_Name (N, New_N);
1263 Set_Etype (New_N, Standard_Void_Type);
1264 Set_Parameter_Associations (N, No_List);
1265 Analyze_Call_And_Resolve;
1267 -- For the case of a reference to an element of an entry family, P is
1268 -- an indexed component whose prefix is a selected component (task and
1269 -- entry family), and whose index is the entry family index.
1271 elsif Nkind (P) = N_Indexed_Component
1272 and then Nkind (Prefix (P)) = N_Selected_Component
1273 and then Ekind (Entity (Selector_Name (Prefix (P)))) = E_Entry_Family
1275 Analyze_Call_And_Resolve;
1277 -- If the prefix is the name of an entry family, it is a call from
1278 -- within the task body itself.
1280 elsif Nkind (P) = N_Indexed_Component
1281 and then Nkind (Prefix (P)) = N_Identifier
1282 and then Ekind (Entity (Prefix (P))) = E_Entry_Family
1285 Make_Selected_Component (Loc,
1286 Prefix => New_Occurrence_Of (Scope (Entity (Prefix (P))), Loc),
1287 Selector_Name => New_Occurrence_Of (Entity (Prefix (P)), Loc));
1288 Rewrite (Prefix (P), New_N);
1290 Analyze_Call_And_Resolve;
1292 -- Anything else is an error
1295 Error_Msg_N ("invalid procedure or entry call", N);
1297 end Analyze_Procedure_Call;
1299 -------------------------------------
1300 -- Analyze_Simple_Return_Statement --
1301 -------------------------------------
1303 procedure Analyze_Simple_Return_Statement (N : Node_Id) is
1305 if Present (Expression (N)) then
1306 Mark_Coextensions (N, Expression (N));
1309 Analyze_Return_Statement (N);
1310 end Analyze_Simple_Return_Statement;
1312 -------------------------
1313 -- Analyze_Return_Type --
1314 -------------------------
1316 procedure Analyze_Return_Type (N : Node_Id) is
1317 Designator : constant Entity_Id := Defining_Entity (N);
1318 Typ : Entity_Id := Empty;
1321 -- Normal case where result definition does not indicate an error
1323 if Result_Definition (N) /= Error then
1324 if Nkind (Result_Definition (N)) = N_Access_Definition then
1326 -- Ada 2005 (AI-254): Handle anonymous access to subprograms
1329 AD : constant Node_Id :=
1330 Access_To_Subprogram_Definition (Result_Definition (N));
1332 if Present (AD) and then Protected_Present (AD) then
1333 Typ := Replace_Anonymous_Access_To_Protected_Subprogram (N);
1335 Typ := Access_Definition (N, Result_Definition (N));
1339 Set_Parent (Typ, Result_Definition (N));
1340 Set_Is_Local_Anonymous_Access (Typ);
1341 Set_Etype (Designator, Typ);
1343 -- Ada 2005 (AI-231): Ensure proper usage of null exclusion
1345 Null_Exclusion_Static_Checks (N);
1347 -- Subtype_Mark case
1350 Find_Type (Result_Definition (N));
1351 Typ := Entity (Result_Definition (N));
1352 Set_Etype (Designator, Typ);
1354 -- Ada 2005 (AI-231): Ensure proper usage of null exclusion
1356 Null_Exclusion_Static_Checks (N);
1358 -- If a null exclusion is imposed on the result type, then create
1359 -- a null-excluding itype (an access subtype) and use it as the
1360 -- function's Etype. Note that the null exclusion checks are done
1361 -- right before this, because they don't get applied to types that
1362 -- do not come from source.
1364 if Is_Access_Type (Typ)
1365 and then Null_Exclusion_Present (N)
1367 Set_Etype (Designator,
1368 Create_Null_Excluding_Itype
1371 Scope_Id => Scope (Current_Scope)));
1373 -- The new subtype must be elaborated before use because
1374 -- it is visible outside of the function. However its base
1375 -- type may not be frozen yet, so the reference that will
1376 -- force elaboration must be attached to the freezing of
1379 -- If the return specification appears on a proper body,
1380 -- the subtype will have been created already on the spec.
1382 if Is_Frozen (Typ) then
1383 if Nkind (Parent (N)) = N_Subprogram_Body
1384 and then Nkind (Parent (Parent (N))) = N_Subunit
1388 Build_Itype_Reference (Etype (Designator), Parent (N));
1392 Ensure_Freeze_Node (Typ);
1395 IR : constant Node_Id := Make_Itype_Reference (Sloc (N));
1397 Set_Itype (IR, Etype (Designator));
1398 Append_Freeze_Actions (Typ, New_List (IR));
1403 Set_Etype (Designator, Typ);
1406 if Ekind (Typ) = E_Incomplete_Type
1407 and then Is_Value_Type (Typ)
1411 elsif Ekind (Typ) = E_Incomplete_Type
1412 or else (Is_Class_Wide_Type (Typ)
1414 Ekind (Root_Type (Typ)) = E_Incomplete_Type)
1417 ("invalid use of incomplete type&", Designator, Typ);
1421 -- Case where result definition does indicate an error
1424 Set_Etype (Designator, Any_Type);
1426 end Analyze_Return_Type;
1428 -----------------------------
1429 -- Analyze_Subprogram_Body --
1430 -----------------------------
1432 procedure Analyze_Subprogram_Body (N : Node_Id) is
1433 Loc : constant Source_Ptr := Sloc (N);
1434 Body_Spec : constant Node_Id := Specification (N);
1435 Body_Id : constant Entity_Id := Defining_Entity (Body_Spec);
1438 if Debug_Flag_C then
1439 Write_Str ("==> subprogram body ");
1440 Write_Name (Chars (Body_Id));
1441 Write_Str (" from ");
1442 Write_Location (Loc);
1447 Trace_Scope (N, Body_Id, " Analyze subprogram: ");
1449 -- The real work is split out into the helper, so it can do "return;"
1450 -- without skipping the debug output:
1452 Analyze_Subprogram_Body_Helper (N);
1454 if Debug_Flag_C then
1456 Write_Str ("<== subprogram body ");
1457 Write_Name (Chars (Body_Id));
1458 Write_Str (" from ");
1459 Write_Location (Loc);
1462 end Analyze_Subprogram_Body;
1464 ------------------------------------
1465 -- Analyze_Subprogram_Body_Helper --
1466 ------------------------------------
1468 -- This procedure is called for regular subprogram bodies, generic bodies,
1469 -- and for subprogram stubs of both kinds. In the case of stubs, only the
1470 -- specification matters, and is used to create a proper declaration for
1471 -- the subprogram, or to perform conformance checks.
1473 procedure Analyze_Subprogram_Body_Helper (N : Node_Id) is
1474 Loc : constant Source_Ptr := Sloc (N);
1475 Body_Deleted : constant Boolean := False;
1476 Body_Spec : constant Node_Id := Specification (N);
1477 Body_Id : Entity_Id := Defining_Entity (Body_Spec);
1478 Prev_Id : constant Entity_Id := Current_Entity_In_Scope (Body_Id);
1479 Conformant : Boolean;
1482 Prot_Typ : Entity_Id := Empty;
1483 Spec_Id : Entity_Id;
1484 Spec_Decl : Node_Id := Empty;
1486 Last_Real_Spec_Entity : Entity_Id := Empty;
1487 -- When we analyze a separate spec, the entity chain ends up containing
1488 -- the formals, as well as any itypes generated during analysis of the
1489 -- default expressions for parameters, or the arguments of associated
1490 -- precondition/postcondition pragmas (which are analyzed in the context
1491 -- of the spec since they have visibility on formals).
1493 -- These entities belong with the spec and not the body. However we do
1494 -- the analysis of the body in the context of the spec (again to obtain
1495 -- visibility to the formals), and all the entities generated during
1496 -- this analysis end up also chained to the entity chain of the spec.
1497 -- But they really belong to the body, and there is circuitry to move
1498 -- them from the spec to the body.
1500 -- However, when we do this move, we don't want to move the real spec
1501 -- entities (first para above) to the body. The Last_Real_Spec_Entity
1502 -- variable points to the last real spec entity, so we only move those
1503 -- chained beyond that point. It is initialized to Empty to deal with
1504 -- the case where there is no separate spec.
1506 procedure Check_Anonymous_Return;
1507 -- Ada 2005: if a function returns an access type that denotes a task,
1508 -- or a type that contains tasks, we must create a master entity for
1509 -- the anonymous type, which typically will be used in an allocator
1510 -- in the body of the function.
1512 procedure Check_Inline_Pragma (Spec : in out Node_Id);
1513 -- Look ahead to recognize a pragma that may appear after the body.
1514 -- If there is a previous spec, check that it appears in the same
1515 -- declarative part. If the pragma is Inline_Always, perform inlining
1516 -- unconditionally, otherwise only if Front_End_Inlining is requested.
1517 -- If the body acts as a spec, and inlining is required, we create a
1518 -- subprogram declaration for it, in order to attach the body to inline.
1519 -- If pragma does not appear after the body, check whether there is
1520 -- an inline pragma before any local declarations.
1522 procedure Check_Missing_Return;
1523 -- Checks for a function with a no return statements, and also performs
1524 -- the warning checks implemented by Check_Returns.
1526 function Disambiguate_Spec return Entity_Id;
1527 -- When a primitive is declared between the private view and the full
1528 -- view of a concurrent type which implements an interface, a special
1529 -- mechanism is used to find the corresponding spec of the primitive
1532 function Is_Private_Concurrent_Primitive
1533 (Subp_Id : Entity_Id) return Boolean;
1534 -- Determine whether subprogram Subp_Id is a primitive of a concurrent
1535 -- type that implements an interface and has a private view.
1537 procedure Set_Trivial_Subprogram (N : Node_Id);
1538 -- Sets the Is_Trivial_Subprogram flag in both spec and body of the
1539 -- subprogram whose body is being analyzed. N is the statement node
1540 -- causing the flag to be set, if the following statement is a return
1541 -- of an entity, we mark the entity as set in source to suppress any
1542 -- warning on the stylized use of function stubs with a dummy return.
1544 procedure Verify_Overriding_Indicator;
1545 -- If there was a previous spec, the entity has been entered in the
1546 -- current scope previously. If the body itself carries an overriding
1547 -- indicator, check that it is consistent with the known status of the
1550 ----------------------------
1551 -- Check_Anonymous_Return --
1552 ----------------------------
1554 procedure Check_Anonymous_Return is
1560 if Present (Spec_Id) then
1566 if Ekind (Scop) = E_Function
1567 and then Ekind (Etype (Scop)) = E_Anonymous_Access_Type
1568 and then not Is_Thunk (Scop)
1569 and then (Has_Task (Designated_Type (Etype (Scop)))
1571 (Is_Class_Wide_Type (Designated_Type (Etype (Scop)))
1573 Is_Limited_Record (Designated_Type (Etype (Scop)))))
1574 and then Expander_Active
1576 -- Avoid cases with no tasking support
1578 and then RTE_Available (RE_Current_Master)
1579 and then not Restriction_Active (No_Task_Hierarchy)
1582 Make_Object_Declaration (Loc,
1583 Defining_Identifier =>
1584 Make_Defining_Identifier (Loc, Name_uMaster),
1585 Constant_Present => True,
1586 Object_Definition =>
1587 New_Reference_To (RTE (RE_Master_Id), Loc),
1589 Make_Explicit_Dereference (Loc,
1590 New_Reference_To (RTE (RE_Current_Master), Loc)));
1592 if Present (Declarations (N)) then
1593 Prepend (Decl, Declarations (N));
1595 Set_Declarations (N, New_List (Decl));
1598 Set_Master_Id (Etype (Scop), Defining_Identifier (Decl));
1599 Set_Has_Master_Entity (Scop);
1601 -- Now mark the containing scope as a task master
1604 while Nkind (Par) /= N_Compilation_Unit loop
1605 Par := Parent (Par);
1606 pragma Assert (Present (Par));
1608 -- If we fall off the top, we are at the outer level, and
1609 -- the environment task is our effective master, so nothing
1613 (Par, N_Task_Body, N_Block_Statement, N_Subprogram_Body)
1615 Set_Is_Task_Master (Par, True);
1620 end Check_Anonymous_Return;
1622 -------------------------
1623 -- Check_Inline_Pragma --
1624 -------------------------
1626 procedure Check_Inline_Pragma (Spec : in out Node_Id) is
1630 function Is_Inline_Pragma (N : Node_Id) return Boolean;
1631 -- True when N is a pragma Inline or Inline_Always that applies
1632 -- to this subprogram.
1634 -----------------------
1635 -- Is_Inline_Pragma --
1636 -----------------------
1638 function Is_Inline_Pragma (N : Node_Id) return Boolean is
1641 Nkind (N) = N_Pragma
1643 (Pragma_Name (N) = Name_Inline_Always
1646 and then Pragma_Name (N) = Name_Inline))
1649 (Expression (First (Pragma_Argument_Associations (N))))
1651 end Is_Inline_Pragma;
1653 -- Start of processing for Check_Inline_Pragma
1656 if not Expander_Active then
1660 if Is_List_Member (N)
1661 and then Present (Next (N))
1662 and then Is_Inline_Pragma (Next (N))
1666 elsif Nkind (N) /= N_Subprogram_Body_Stub
1667 and then Present (Declarations (N))
1668 and then Is_Inline_Pragma (First (Declarations (N)))
1670 Prag := First (Declarations (N));
1676 if Present (Prag) then
1677 if Present (Spec_Id) then
1678 if In_Same_List (N, Unit_Declaration_Node (Spec_Id)) then
1683 -- Create a subprogram declaration, to make treatment uniform
1686 Subp : constant Entity_Id :=
1687 Make_Defining_Identifier (Loc, Chars (Body_Id));
1688 Decl : constant Node_Id :=
1689 Make_Subprogram_Declaration (Loc,
1691 New_Copy_Tree (Specification (N)));
1694 Set_Defining_Unit_Name (Specification (Decl), Subp);
1696 if Present (First_Formal (Body_Id)) then
1697 Plist := Copy_Parameter_List (Body_Id);
1698 Set_Parameter_Specifications
1699 (Specification (Decl), Plist);
1702 Insert_Before (N, Decl);
1705 Set_Has_Pragma_Inline (Subp);
1707 if Pragma_Name (Prag) = Name_Inline_Always then
1708 Set_Is_Inlined (Subp);
1709 Set_Has_Pragma_Inline_Always (Subp);
1716 end Check_Inline_Pragma;
1718 --------------------------
1719 -- Check_Missing_Return --
1720 --------------------------
1722 procedure Check_Missing_Return is
1724 Missing_Ret : Boolean;
1727 if Nkind (Body_Spec) = N_Function_Specification then
1728 if Present (Spec_Id) then
1734 if Return_Present (Id) then
1735 Check_Returns (HSS, 'F', Missing_Ret);
1738 Set_Has_Missing_Return (Id);
1741 elsif (Is_Generic_Subprogram (Id)
1742 or else not Is_Machine_Code_Subprogram (Id))
1743 and then not Body_Deleted
1745 Error_Msg_N ("missing RETURN statement in function body", N);
1748 -- If procedure with No_Return, check returns
1750 elsif Nkind (Body_Spec) = N_Procedure_Specification
1751 and then Present (Spec_Id)
1752 and then No_Return (Spec_Id)
1754 Check_Returns (HSS, 'P', Missing_Ret, Spec_Id);
1756 end Check_Missing_Return;
1758 -----------------------
1759 -- Disambiguate_Spec --
1760 -----------------------
1762 function Disambiguate_Spec return Entity_Id is
1763 Priv_Spec : Entity_Id;
1766 procedure Replace_Types (To_Corresponding : Boolean);
1767 -- Depending on the flag, replace the type of formal parameters of
1768 -- Body_Id if it is a concurrent type implementing interfaces with
1769 -- the corresponding record type or the other way around.
1771 procedure Replace_Types (To_Corresponding : Boolean) is
1773 Formal_Typ : Entity_Id;
1776 Formal := First_Formal (Body_Id);
1777 while Present (Formal) loop
1778 Formal_Typ := Etype (Formal);
1780 -- From concurrent type to corresponding record
1782 if To_Corresponding then
1783 if Is_Concurrent_Type (Formal_Typ)
1784 and then Present (Corresponding_Record_Type (Formal_Typ))
1785 and then Present (Interfaces (
1786 Corresponding_Record_Type (Formal_Typ)))
1789 Corresponding_Record_Type (Formal_Typ));
1792 -- From corresponding record to concurrent type
1795 if Is_Concurrent_Record_Type (Formal_Typ)
1796 and then Present (Interfaces (Formal_Typ))
1799 Corresponding_Concurrent_Type (Formal_Typ));
1803 Next_Formal (Formal);
1807 -- Start of processing for Disambiguate_Spec
1810 -- Try to retrieve the specification of the body as is. All error
1811 -- messages are suppressed because the body may not have a spec in
1812 -- its current state.
1814 Spec_N := Find_Corresponding_Spec (N, False);
1816 -- It is possible that this is the body of a primitive declared
1817 -- between a private and a full view of a concurrent type. The
1818 -- controlling parameter of the spec carries the concurrent type,
1819 -- not the corresponding record type as transformed by Analyze_
1820 -- Subprogram_Specification. In such cases, we undo the change
1821 -- made by the analysis of the specification and try to find the
1824 -- Note that wrappers already have their corresponding specs and
1825 -- bodies set during their creation, so if the candidate spec is
1826 -- a wrapper, then we definitely need to swap all types to their
1827 -- original concurrent status.
1830 or else Is_Primitive_Wrapper (Spec_N)
1832 -- Restore all references of corresponding record types to the
1833 -- original concurrent types.
1835 Replace_Types (To_Corresponding => False);
1836 Priv_Spec := Find_Corresponding_Spec (N, False);
1838 -- The current body truly belongs to a primitive declared between
1839 -- a private and a full view. We leave the modified body as is,
1840 -- and return the true spec.
1842 if Present (Priv_Spec)
1843 and then Is_Private_Primitive (Priv_Spec)
1848 -- In case that this is some sort of error, restore the original
1849 -- state of the body.
1851 Replace_Types (To_Corresponding => True);
1855 end Disambiguate_Spec;
1857 -------------------------------------
1858 -- Is_Private_Concurrent_Primitive --
1859 -------------------------------------
1861 function Is_Private_Concurrent_Primitive
1862 (Subp_Id : Entity_Id) return Boolean
1864 Formal_Typ : Entity_Id;
1867 if Present (First_Formal (Subp_Id)) then
1868 Formal_Typ := Etype (First_Formal (Subp_Id));
1870 if Is_Concurrent_Record_Type (Formal_Typ) then
1871 Formal_Typ := Corresponding_Concurrent_Type (Formal_Typ);
1874 -- The type of the first formal is a concurrent tagged type with
1878 Is_Concurrent_Type (Formal_Typ)
1879 and then Is_Tagged_Type (Formal_Typ)
1880 and then Has_Private_Declaration (Formal_Typ);
1884 end Is_Private_Concurrent_Primitive;
1886 ----------------------------
1887 -- Set_Trivial_Subprogram --
1888 ----------------------------
1890 procedure Set_Trivial_Subprogram (N : Node_Id) is
1891 Nxt : constant Node_Id := Next (N);
1894 Set_Is_Trivial_Subprogram (Body_Id);
1896 if Present (Spec_Id) then
1897 Set_Is_Trivial_Subprogram (Spec_Id);
1901 and then Nkind (Nxt) = N_Simple_Return_Statement
1902 and then No (Next (Nxt))
1903 and then Present (Expression (Nxt))
1904 and then Is_Entity_Name (Expression (Nxt))
1906 Set_Never_Set_In_Source (Entity (Expression (Nxt)), False);
1908 end Set_Trivial_Subprogram;
1910 ---------------------------------
1911 -- Verify_Overriding_Indicator --
1912 ---------------------------------
1914 procedure Verify_Overriding_Indicator is
1916 if Must_Override (Body_Spec) then
1917 if Nkind (Spec_Id) = N_Defining_Operator_Symbol
1918 and then Operator_Matches_Spec (Spec_Id, Spec_Id)
1922 elsif not Is_Overriding_Operation (Spec_Id) then
1924 ("subprogram& is not overriding", Body_Spec, Spec_Id);
1927 elsif Must_Not_Override (Body_Spec) then
1928 if Is_Overriding_Operation (Spec_Id) then
1930 ("subprogram& overrides inherited operation",
1931 Body_Spec, Spec_Id);
1933 elsif Nkind (Spec_Id) = N_Defining_Operator_Symbol
1934 and then Operator_Matches_Spec (Spec_Id, Spec_Id)
1937 ("subprogram & overrides predefined operator ",
1938 Body_Spec, Spec_Id);
1940 -- If this is not a primitive operation or protected subprogram,
1941 -- then the overriding indicator is altogether illegal.
1943 elsif not Is_Primitive (Spec_Id)
1944 and then Ekind (Scope (Spec_Id)) /= E_Protected_Type
1947 ("overriding indicator only allowed " &
1948 "if subprogram is primitive",
1952 elsif Style_Check -- ??? incorrect use of Style_Check!
1953 and then Is_Overriding_Operation (Spec_Id)
1955 pragma Assert (Unit_Declaration_Node (Body_Id) = N);
1956 Style.Missing_Overriding (N, Body_Id);
1958 end Verify_Overriding_Indicator;
1960 -- Start of processing for Analyze_Subprogram_Body_Helper
1963 -- Generic subprograms are handled separately. They always have a
1964 -- generic specification. Determine whether current scope has a
1965 -- previous declaration.
1967 -- If the subprogram body is defined within an instance of the same
1968 -- name, the instance appears as a package renaming, and will be hidden
1969 -- within the subprogram.
1971 if Present (Prev_Id)
1972 and then not Is_Overloadable (Prev_Id)
1973 and then (Nkind (Parent (Prev_Id)) /= N_Package_Renaming_Declaration
1974 or else Comes_From_Source (Prev_Id))
1976 if Is_Generic_Subprogram (Prev_Id) then
1978 Set_Is_Compilation_Unit (Body_Id, Is_Compilation_Unit (Spec_Id));
1979 Set_Is_Child_Unit (Body_Id, Is_Child_Unit (Spec_Id));
1981 Analyze_Generic_Subprogram_Body (N, Spec_Id);
1983 if Nkind (N) = N_Subprogram_Body then
1984 HSS := Handled_Statement_Sequence (N);
1985 Check_Missing_Return;
1991 -- Previous entity conflicts with subprogram name. Attempting to
1992 -- enter name will post error.
1994 Enter_Name (Body_Id);
1998 -- Non-generic case, find the subprogram declaration, if one was seen,
1999 -- or enter new overloaded entity in the current scope. If the
2000 -- Current_Entity is the Body_Id itself, the unit is being analyzed as
2001 -- part of the context of one of its subunits. No need to redo the
2004 elsif Prev_Id = Body_Id
2005 and then Has_Completion (Body_Id)
2010 Body_Id := Analyze_Subprogram_Specification (Body_Spec);
2012 if Nkind (N) = N_Subprogram_Body_Stub
2013 or else No (Corresponding_Spec (N))
2015 if Is_Private_Concurrent_Primitive (Body_Id) then
2016 Spec_Id := Disambiguate_Spec;
2018 Spec_Id := Find_Corresponding_Spec (N);
2021 -- If this is a duplicate body, no point in analyzing it
2023 if Error_Posted (N) then
2027 -- A subprogram body should cause freezing of its own declaration,
2028 -- but if there was no previous explicit declaration, then the
2029 -- subprogram will get frozen too late (there may be code within
2030 -- the body that depends on the subprogram having been frozen,
2031 -- such as uses of extra formals), so we force it to be frozen
2032 -- here. Same holds if the body and spec are compilation units.
2033 -- Finally, if the return type is an anonymous access to protected
2034 -- subprogram, it must be frozen before the body because its
2035 -- expansion has generated an equivalent type that is used when
2036 -- elaborating the body.
2038 if No (Spec_Id) then
2039 Freeze_Before (N, Body_Id);
2041 elsif Nkind (Parent (N)) = N_Compilation_Unit then
2042 Freeze_Before (N, Spec_Id);
2044 elsif Is_Access_Subprogram_Type (Etype (Body_Id)) then
2045 Freeze_Before (N, Etype (Body_Id));
2049 Spec_Id := Corresponding_Spec (N);
2053 -- Do not inline any subprogram that contains nested subprograms, since
2054 -- the backend inlining circuit seems to generate uninitialized
2055 -- references in this case. We know this happens in the case of front
2056 -- end ZCX support, but it also appears it can happen in other cases as
2057 -- well. The backend often rejects attempts to inline in the case of
2058 -- nested procedures anyway, so little if anything is lost by this.
2059 -- Note that this is test is for the benefit of the back-end. There is
2060 -- a separate test for front-end inlining that also rejects nested
2063 -- Do not do this test if errors have been detected, because in some
2064 -- error cases, this code blows up, and we don't need it anyway if
2065 -- there have been errors, since we won't get to the linker anyway.
2067 if Comes_From_Source (Body_Id)
2068 and then Serious_Errors_Detected = 0
2072 P_Ent := Scope (P_Ent);
2073 exit when No (P_Ent) or else P_Ent = Standard_Standard;
2075 if Is_Subprogram (P_Ent) then
2076 Set_Is_Inlined (P_Ent, False);
2078 if Comes_From_Source (P_Ent)
2079 and then Has_Pragma_Inline (P_Ent)
2082 ("cannot inline& (nested subprogram)?",
2089 Check_Inline_Pragma (Spec_Id);
2091 -- Deal with special case of a fully private operation in the body of
2092 -- the protected type. We must create a declaration for the subprogram,
2093 -- in order to attach the protected subprogram that will be used in
2094 -- internal calls. We exclude compiler generated bodies from the
2095 -- expander since the issue does not arise for those cases.
2098 and then Comes_From_Source (N)
2099 and then Is_Protected_Type (Current_Scope)
2101 Spec_Id := Build_Private_Protected_Declaration (N);
2104 -- If a separate spec is present, then deal with freezing issues
2106 if Present (Spec_Id) then
2107 Spec_Decl := Unit_Declaration_Node (Spec_Id);
2108 Verify_Overriding_Indicator;
2110 -- In general, the spec will be frozen when we start analyzing the
2111 -- body. However, for internally generated operations, such as
2112 -- wrapper functions for inherited operations with controlling
2113 -- results, the spec may not have been frozen by the time we
2114 -- expand the freeze actions that include the bodies. In particular,
2115 -- extra formals for accessibility or for return-in-place may need
2116 -- to be generated. Freeze nodes, if any, are inserted before the
2119 if not Is_Frozen (Spec_Id)
2120 and then Expander_Active
2122 -- Force the generation of its freezing node to ensure proper
2123 -- management of access types in the backend.
2125 -- This is definitely needed for some cases, but it is not clear
2126 -- why, to be investigated further???
2128 Set_Has_Delayed_Freeze (Spec_Id);
2129 Insert_Actions (N, Freeze_Entity (Spec_Id, Loc));
2133 -- Mark presence of postcondition procedure in current scope and mark
2134 -- the procedure itself as needing debug info. The latter is important
2135 -- when analyzing decision coverage (for example, for MC/DC coverage).
2137 if Chars (Body_Id) = Name_uPostconditions then
2138 Set_Has_Postconditions (Current_Scope);
2139 Set_Debug_Info_Needed (Body_Id);
2142 -- Place subprogram on scope stack, and make formals visible. If there
2143 -- is a spec, the visible entity remains that of the spec.
2145 if Present (Spec_Id) then
2146 Generate_Reference (Spec_Id, Body_Id, 'b', Set_Ref => False);
2148 if Is_Child_Unit (Spec_Id) then
2149 Generate_Reference (Spec_Id, Scope (Spec_Id), 'k', False);
2153 Style.Check_Identifier (Body_Id, Spec_Id);
2156 Set_Is_Compilation_Unit (Body_Id, Is_Compilation_Unit (Spec_Id));
2157 Set_Is_Child_Unit (Body_Id, Is_Child_Unit (Spec_Id));
2159 if Is_Abstract_Subprogram (Spec_Id) then
2160 Error_Msg_N ("an abstract subprogram cannot have a body", N);
2164 Set_Convention (Body_Id, Convention (Spec_Id));
2165 Set_Has_Completion (Spec_Id);
2167 if Is_Protected_Type (Scope (Spec_Id)) then
2168 Prot_Typ := Scope (Spec_Id);
2171 -- If this is a body generated for a renaming, do not check for
2172 -- full conformance. The check is redundant, because the spec of
2173 -- the body is a copy of the spec in the renaming declaration,
2174 -- and the test can lead to spurious errors on nested defaults.
2176 if Present (Spec_Decl)
2177 and then not Comes_From_Source (N)
2179 (Nkind (Original_Node (Spec_Decl)) =
2180 N_Subprogram_Renaming_Declaration
2181 or else (Present (Corresponding_Body (Spec_Decl))
2183 Nkind (Unit_Declaration_Node
2184 (Corresponding_Body (Spec_Decl))) =
2185 N_Subprogram_Renaming_Declaration))
2189 -- Conversely, the spec may have been generated for specless body
2190 -- with an inline pragma.
2192 elsif Comes_From_Source (N)
2193 and then not Comes_From_Source (Spec_Id)
2194 and then Has_Pragma_Inline (Spec_Id)
2201 Fully_Conformant, True, Conformant, Body_Id);
2204 -- If the body is not fully conformant, we have to decide if we
2205 -- should analyze it or not. If it has a really messed up profile
2206 -- then we probably should not analyze it, since we will get too
2207 -- many bogus messages.
2209 -- Our decision is to go ahead in the non-fully conformant case
2210 -- only if it is at least mode conformant with the spec. Note
2211 -- that the call to Check_Fully_Conformant has issued the proper
2212 -- error messages to complain about the lack of conformance.
2215 and then not Mode_Conformant (Body_Id, Spec_Id)
2221 if Spec_Id /= Body_Id then
2222 Reference_Body_Formals (Spec_Id, Body_Id);
2225 if Nkind (N) /= N_Subprogram_Body_Stub then
2226 Set_Corresponding_Spec (N, Spec_Id);
2228 -- Ada 2005 (AI-345): If the operation is a primitive operation
2229 -- of a concurrent type, the type of the first parameter has been
2230 -- replaced with the corresponding record, which is the proper
2231 -- run-time structure to use. However, within the body there may
2232 -- be uses of the formals that depend on primitive operations
2233 -- of the type (in particular calls in prefixed form) for which
2234 -- we need the original concurrent type. The operation may have
2235 -- several controlling formals, so the replacement must be done
2238 if Comes_From_Source (Spec_Id)
2239 and then Present (First_Entity (Spec_Id))
2240 and then Ekind (Etype (First_Entity (Spec_Id))) = E_Record_Type
2241 and then Is_Tagged_Type (Etype (First_Entity (Spec_Id)))
2243 Present (Interfaces (Etype (First_Entity (Spec_Id))))
2246 (Corresponding_Concurrent_Type
2247 (Etype (First_Entity (Spec_Id))))
2250 Typ : constant Entity_Id := Etype (First_Entity (Spec_Id));
2254 Form := First_Formal (Spec_Id);
2255 while Present (Form) loop
2256 if Etype (Form) = Typ then
2257 Set_Etype (Form, Corresponding_Concurrent_Type (Typ));
2265 -- Make the formals visible, and place subprogram on scope stack.
2266 -- This is also the point at which we set Last_Real_Spec_Entity
2267 -- to mark the entities which will not be moved to the body.
2269 Install_Formals (Spec_Id);
2270 Last_Real_Spec_Entity := Last_Entity (Spec_Id);
2271 Push_Scope (Spec_Id);
2273 -- Make sure that the subprogram is immediately visible. For
2274 -- child units that have no separate spec this is indispensable.
2275 -- Otherwise it is safe albeit redundant.
2277 Set_Is_Immediately_Visible (Spec_Id);
2280 Set_Corresponding_Body (Unit_Declaration_Node (Spec_Id), Body_Id);
2281 Set_Ekind (Body_Id, E_Subprogram_Body);
2282 Set_Scope (Body_Id, Scope (Spec_Id));
2283 Set_Is_Obsolescent (Body_Id, Is_Obsolescent (Spec_Id));
2285 -- Case of subprogram body with no previous spec
2289 and then Comes_From_Source (Body_Id)
2290 and then not Suppress_Style_Checks (Body_Id)
2291 and then not In_Instance
2293 Style.Body_With_No_Spec (N);
2296 New_Overloaded_Entity (Body_Id);
2298 if Nkind (N) /= N_Subprogram_Body_Stub then
2299 Set_Acts_As_Spec (N);
2300 Generate_Definition (Body_Id);
2302 (Body_Id, Body_Id, 'b', Set_Ref => False, Force => True);
2303 Generate_Reference_To_Formals (Body_Id);
2304 Install_Formals (Body_Id);
2305 Push_Scope (Body_Id);
2309 -- If the return type is an anonymous access type whose designated type
2310 -- is the limited view of a class-wide type and the non-limited view is
2311 -- available, update the return type accordingly.
2313 if Ada_Version >= Ada_05
2314 and then Comes_From_Source (N)
2321 Rtyp := Etype (Current_Scope);
2323 if Ekind (Rtyp) = E_Anonymous_Access_Type then
2324 Etyp := Directly_Designated_Type (Rtyp);
2326 if Is_Class_Wide_Type (Etyp)
2327 and then From_With_Type (Etyp)
2329 Set_Directly_Designated_Type
2330 (Etype (Current_Scope), Available_View (Etyp));
2336 -- If this is the proper body of a stub, we must verify that the stub
2337 -- conforms to the body, and to the previous spec if one was present.
2338 -- we know already that the body conforms to that spec. This test is
2339 -- only required for subprograms that come from source.
2341 if Nkind (Parent (N)) = N_Subunit
2342 and then Comes_From_Source (N)
2343 and then not Error_Posted (Body_Id)
2344 and then Nkind (Corresponding_Stub (Parent (N))) =
2345 N_Subprogram_Body_Stub
2348 Old_Id : constant Entity_Id :=
2350 (Specification (Corresponding_Stub (Parent (N))));
2352 Conformant : Boolean := False;
2355 if No (Spec_Id) then
2356 Check_Fully_Conformant (Body_Id, Old_Id);
2360 (Body_Id, Old_Id, Fully_Conformant, False, Conformant);
2362 if not Conformant then
2364 -- The stub was taken to be a new declaration. Indicate
2365 -- that it lacks a body.
2367 Set_Has_Completion (Old_Id, False);
2373 Set_Has_Completion (Body_Id);
2374 Check_Eliminated (Body_Id);
2376 if Nkind (N) = N_Subprogram_Body_Stub then
2379 elsif Present (Spec_Id)
2380 and then Expander_Active
2382 (Has_Pragma_Inline_Always (Spec_Id)
2383 or else (Has_Pragma_Inline (Spec_Id) and Front_End_Inlining))
2385 Build_Body_To_Inline (N, Spec_Id);
2388 -- Ada 2005 (AI-262): In library subprogram bodies, after the analysis
2389 -- if its specification we have to install the private withed units.
2390 -- This holds for child units as well.
2392 if Is_Compilation_Unit (Body_Id)
2393 or else Nkind (Parent (N)) = N_Compilation_Unit
2395 Install_Private_With_Clauses (Body_Id);
2398 Check_Anonymous_Return;
2400 -- Set the Protected_Formal field of each extra formal of the protected
2401 -- subprogram to reference the corresponding extra formal of the
2402 -- subprogram that implements it. For regular formals this occurs when
2403 -- the protected subprogram's declaration is expanded, but the extra
2404 -- formals don't get created until the subprogram is frozen. We need to
2405 -- do this before analyzing the protected subprogram's body so that any
2406 -- references to the original subprogram's extra formals will be changed
2407 -- refer to the implementing subprogram's formals (see Expand_Formal).
2409 if Present (Spec_Id)
2410 and then Is_Protected_Type (Scope (Spec_Id))
2411 and then Present (Protected_Body_Subprogram (Spec_Id))
2414 Impl_Subp : constant Entity_Id :=
2415 Protected_Body_Subprogram (Spec_Id);
2416 Prot_Ext_Formal : Entity_Id := Extra_Formals (Spec_Id);
2417 Impl_Ext_Formal : Entity_Id := Extra_Formals (Impl_Subp);
2419 while Present (Prot_Ext_Formal) loop
2420 pragma Assert (Present (Impl_Ext_Formal));
2421 Set_Protected_Formal (Prot_Ext_Formal, Impl_Ext_Formal);
2422 Next_Formal_With_Extras (Prot_Ext_Formal);
2423 Next_Formal_With_Extras (Impl_Ext_Formal);
2428 -- Now we can go on to analyze the body
2430 HSS := Handled_Statement_Sequence (N);
2431 Set_Actual_Subtypes (N, Current_Scope);
2433 -- Deal with preconditions and postconditions
2435 Process_PPCs (N, Spec_Id, Body_Id);
2437 -- Add a declaration for the Protection object, renaming declarations
2438 -- for discriminals and privals and finally a declaration for the entry
2439 -- family index (if applicable). This form of early expansion is done
2440 -- when the Expander is active because Install_Private_Data_Declarations
2441 -- references entities which were created during regular expansion.
2444 and then Comes_From_Source (N)
2445 and then Present (Prot_Typ)
2446 and then Present (Spec_Id)
2447 and then not Is_Eliminated (Spec_Id)
2449 Install_Private_Data_Declarations
2450 (Sloc (N), Spec_Id, Prot_Typ, N, Declarations (N));
2453 -- Analyze the declarations (this call will analyze the precondition
2454 -- Check pragmas we prepended to the list, as well as the declaration
2455 -- of the _Postconditions procedure).
2457 Analyze_Declarations (Declarations (N));
2459 -- Check completion, and analyze the statements
2462 Inspect_Deferred_Constant_Completion (Declarations (N));
2465 -- Deal with end of scope processing for the body
2467 Process_End_Label (HSS, 't', Current_Scope);
2469 Check_Subprogram_Order (N);
2470 Set_Analyzed (Body_Id);
2472 -- If we have a separate spec, then the analysis of the declarations
2473 -- caused the entities in the body to be chained to the spec id, but
2474 -- we want them chained to the body id. Only the formal parameters
2475 -- end up chained to the spec id in this case.
2477 if Present (Spec_Id) then
2479 -- We must conform to the categorization of our spec
2481 Validate_Categorization_Dependency (N, Spec_Id);
2483 -- And if this is a child unit, the parent units must conform
2485 if Is_Child_Unit (Spec_Id) then
2486 Validate_Categorization_Dependency
2487 (Unit_Declaration_Node (Spec_Id), Spec_Id);
2490 -- Here is where we move entities from the spec to the body
2492 -- Case where there are entities that stay with the spec
2494 if Present (Last_Real_Spec_Entity) then
2496 -- No body entities (happens when the only real spec entities
2497 -- come from precondition and postcondition pragmas)
2499 if No (Last_Entity (Body_Id)) then
2501 (Body_Id, Next_Entity (Last_Real_Spec_Entity));
2503 -- Body entities present (formals), so chain stuff past them
2507 (Last_Entity (Body_Id), Next_Entity (Last_Real_Spec_Entity));
2510 Set_Next_Entity (Last_Real_Spec_Entity, Empty);
2511 Set_Last_Entity (Body_Id, Last_Entity (Spec_Id));
2512 Set_Last_Entity (Spec_Id, Last_Real_Spec_Entity);
2514 -- Case where there are no spec entities, in this case there can
2515 -- be no body entities either, so just move everything.
2518 pragma Assert (No (Last_Entity (Body_Id)));
2519 Set_First_Entity (Body_Id, First_Entity (Spec_Id));
2520 Set_Last_Entity (Body_Id, Last_Entity (Spec_Id));
2521 Set_First_Entity (Spec_Id, Empty);
2522 Set_Last_Entity (Spec_Id, Empty);
2526 Check_Missing_Return;
2528 -- Now we are going to check for variables that are never modified in
2529 -- the body of the procedure. But first we deal with a special case
2530 -- where we want to modify this check. If the body of the subprogram
2531 -- starts with a raise statement or its equivalent, or if the body
2532 -- consists entirely of a null statement, then it is pretty obvious
2533 -- that it is OK to not reference the parameters. For example, this
2534 -- might be the following common idiom for a stubbed function:
2535 -- statement of the procedure raises an exception. In particular this
2536 -- deals with the common idiom of a stubbed function, which might
2537 -- appear as something like
2539 -- function F (A : Integer) return Some_Type;
2542 -- raise Program_Error;
2546 -- Here the purpose of X is simply to satisfy the annoying requirement
2547 -- in Ada that there be at least one return, and we certainly do not
2548 -- want to go posting warnings on X that it is not initialized! On
2549 -- the other hand, if X is entirely unreferenced that should still
2552 -- What we do is to detect these cases, and if we find them, flag the
2553 -- subprogram as being Is_Trivial_Subprogram and then use that flag to
2554 -- suppress unwanted warnings. For the case of the function stub above
2555 -- we have a special test to set X as apparently assigned to suppress
2562 -- Skip initial labels (for one thing this occurs when we are in
2563 -- front end ZCX mode, but in any case it is irrelevant), and also
2564 -- initial Push_xxx_Error_Label nodes, which are also irrelevant.
2566 Stm := First (Statements (HSS));
2567 while Nkind (Stm) = N_Label
2568 or else Nkind (Stm) in N_Push_xxx_Label
2573 -- Do the test on the original statement before expansion
2576 Ostm : constant Node_Id := Original_Node (Stm);
2579 -- If explicit raise statement, turn on flag
2581 if Nkind (Ostm) = N_Raise_Statement then
2582 Set_Trivial_Subprogram (Stm);
2584 -- If null statement, and no following statements, turn on flag
2586 elsif Nkind (Stm) = N_Null_Statement
2587 and then Comes_From_Source (Stm)
2588 and then No (Next (Stm))
2590 Set_Trivial_Subprogram (Stm);
2592 -- Check for explicit call cases which likely raise an exception
2594 elsif Nkind (Ostm) = N_Procedure_Call_Statement then
2595 if Is_Entity_Name (Name (Ostm)) then
2597 Ent : constant Entity_Id := Entity (Name (Ostm));
2600 -- If the procedure is marked No_Return, then likely it
2601 -- raises an exception, but in any case it is not coming
2602 -- back here, so turn on the flag.
2604 if Ekind (Ent) = E_Procedure
2605 and then No_Return (Ent)
2607 Set_Trivial_Subprogram (Stm);
2615 -- Check for variables that are never modified
2621 -- If there is a separate spec, then transfer Never_Set_In_Source
2622 -- flags from out parameters to the corresponding entities in the
2623 -- body. The reason we do that is we want to post error flags on
2624 -- the body entities, not the spec entities.
2626 if Present (Spec_Id) then
2627 E1 := First_Entity (Spec_Id);
2628 while Present (E1) loop
2629 if Ekind (E1) = E_Out_Parameter then
2630 E2 := First_Entity (Body_Id);
2631 while Present (E2) loop
2632 exit when Chars (E1) = Chars (E2);
2636 if Present (E2) then
2637 Set_Never_Set_In_Source (E2, Never_Set_In_Source (E1));
2645 -- Check references in body unless it was deleted. Note that the
2646 -- check of Body_Deleted here is not just for efficiency, it is
2647 -- necessary to avoid junk warnings on formal parameters.
2649 if not Body_Deleted then
2650 Check_References (Body_Id);
2653 end Analyze_Subprogram_Body_Helper;
2655 ------------------------------------
2656 -- Analyze_Subprogram_Declaration --
2657 ------------------------------------
2659 procedure Analyze_Subprogram_Declaration (N : Node_Id) is
2660 Loc : constant Source_Ptr := Sloc (N);
2661 Designator : Entity_Id;
2663 Scop : constant Entity_Id := Current_Scope;
2664 Null_Body : Node_Id := Empty;
2666 -- Start of processing for Analyze_Subprogram_Declaration
2669 -- For a null procedure, capture the profile before analysis, for
2670 -- expansion at the freeze point and at each point of call.
2671 -- The body will only be used if the procedure has preconditions.
2672 -- In that case the body is analyzed at the freeze point.
2674 if Nkind (Specification (N)) = N_Procedure_Specification
2675 and then Null_Present (Specification (N))
2676 and then Expander_Active
2679 Make_Subprogram_Body (Loc,
2681 New_Copy_Tree (Specification (N)),
2684 Handled_Statement_Sequence =>
2685 Make_Handled_Sequence_Of_Statements (Loc,
2686 Statements => New_List (Make_Null_Statement (Loc))));
2688 -- Create new entities for body and formals
2690 Set_Defining_Unit_Name (Specification (Null_Body),
2691 Make_Defining_Identifier (Loc, Chars (Defining_Entity (N))));
2692 Set_Corresponding_Body (N, Defining_Entity (Null_Body));
2694 Form := First (Parameter_Specifications (Specification (Null_Body)));
2695 while Present (Form) loop
2696 Set_Defining_Identifier (Form,
2697 Make_Defining_Identifier (Loc,
2698 Chars (Defining_Identifier (Form))));
2702 if Is_Protected_Type (Current_Scope) then
2703 Error_Msg_N ("protected operation cannot be a null procedure", N);
2707 Designator := Analyze_Subprogram_Specification (Specification (N));
2708 Generate_Definition (Designator);
2710 if Debug_Flag_C then
2711 Write_Str ("==> subprogram spec ");
2712 Write_Name (Chars (Designator));
2713 Write_Str (" from ");
2714 Write_Location (Sloc (N));
2719 if Nkind (Specification (N)) = N_Procedure_Specification
2720 and then Null_Present (Specification (N))
2722 Set_Has_Completion (Designator);
2724 if Present (Null_Body) then
2725 Set_Corresponding_Body (N, Defining_Entity (Null_Body));
2726 Set_Body_To_Inline (N, Null_Body);
2727 Set_Is_Inlined (Designator);
2731 Validate_RCI_Subprogram_Declaration (N);
2732 New_Overloaded_Entity (Designator);
2733 Check_Delayed_Subprogram (Designator);
2735 -- If the type of the first formal of the current subprogram is a
2736 -- nongeneric tagged private type, mark the subprogram as being a
2737 -- private primitive. Ditto if this is a function with controlling
2738 -- result, and the return type is currently private. In both cases,
2739 -- the type of the controlling argument or result must be in the
2740 -- current scope for the operation to be primitive.
2742 if Has_Controlling_Result (Designator)
2743 and then Is_Private_Type (Etype (Designator))
2744 and then Scope (Etype (Designator)) = Current_Scope
2745 and then not Is_Generic_Actual_Type (Etype (Designator))
2747 Set_Is_Private_Primitive (Designator);
2749 elsif Present (First_Formal (Designator)) then
2751 Formal_Typ : constant Entity_Id :=
2752 Etype (First_Formal (Designator));
2754 Set_Is_Private_Primitive (Designator,
2755 Is_Tagged_Type (Formal_Typ)
2756 and then Scope (Formal_Typ) = Current_Scope
2757 and then Is_Private_Type (Formal_Typ)
2758 and then not Is_Generic_Actual_Type (Formal_Typ));
2762 -- Ada 2005 (AI-251): Abstract interface primitives must be abstract
2765 if Ada_Version >= Ada_05
2766 and then Comes_From_Source (N)
2767 and then Is_Dispatching_Operation (Designator)
2774 if Has_Controlling_Result (Designator) then
2775 Etyp := Etype (Designator);
2778 E := First_Entity (Designator);
2780 and then Is_Formal (E)
2781 and then not Is_Controlling_Formal (E)
2789 if Is_Access_Type (Etyp) then
2790 Etyp := Directly_Designated_Type (Etyp);
2793 if Is_Interface (Etyp)
2794 and then not Is_Abstract_Subprogram (Designator)
2795 and then not (Ekind (Designator) = E_Procedure
2796 and then Null_Present (Specification (N)))
2798 Error_Msg_Name_1 := Chars (Defining_Entity (N));
2800 ("(Ada 2005) interface subprogram % must be abstract or null",
2806 -- What is the following code for, it used to be
2808 -- ??? Set_Suppress_Elaboration_Checks
2809 -- ??? (Designator, Elaboration_Checks_Suppressed (Designator));
2811 -- The following seems equivalent, but a bit dubious
2813 if Elaboration_Checks_Suppressed (Designator) then
2814 Set_Kill_Elaboration_Checks (Designator);
2817 if Scop /= Standard_Standard
2818 and then not Is_Child_Unit (Designator)
2820 Set_Categorization_From_Scope (Designator, Scop);
2822 -- For a compilation unit, check for library-unit pragmas
2824 Push_Scope (Designator);
2825 Set_Categorization_From_Pragmas (N);
2826 Validate_Categorization_Dependency (N, Designator);
2830 -- For a compilation unit, set body required. This flag will only be
2831 -- reset if a valid Import or Interface pragma is processed later on.
2833 if Nkind (Parent (N)) = N_Compilation_Unit then
2834 Set_Body_Required (Parent (N), True);
2836 if Ada_Version >= Ada_05
2837 and then Nkind (Specification (N)) = N_Procedure_Specification
2838 and then Null_Present (Specification (N))
2841 ("null procedure cannot be declared at library level", N);
2845 Generate_Reference_To_Formals (Designator);
2846 Check_Eliminated (Designator);
2848 if Debug_Flag_C then
2850 Write_Str ("<== subprogram spec ");
2851 Write_Name (Chars (Designator));
2852 Write_Str (" from ");
2853 Write_Location (Sloc (N));
2856 end Analyze_Subprogram_Declaration;
2858 --------------------------------------
2859 -- Analyze_Subprogram_Specification --
2860 --------------------------------------
2862 -- Reminder: N here really is a subprogram specification (not a subprogram
2863 -- declaration). This procedure is called to analyze the specification in
2864 -- both subprogram bodies and subprogram declarations (specs).
2866 function Analyze_Subprogram_Specification (N : Node_Id) return Entity_Id is
2867 Designator : constant Entity_Id := Defining_Entity (N);
2868 Formals : constant List_Id := Parameter_Specifications (N);
2870 -- Start of processing for Analyze_Subprogram_Specification
2873 Generate_Definition (Designator);
2875 if Nkind (N) = N_Function_Specification then
2876 Set_Ekind (Designator, E_Function);
2877 Set_Mechanism (Designator, Default_Mechanism);
2880 Set_Ekind (Designator, E_Procedure);
2881 Set_Etype (Designator, Standard_Void_Type);
2884 -- Introduce new scope for analysis of the formals and the return type
2886 Set_Scope (Designator, Current_Scope);
2888 if Present (Formals) then
2889 Push_Scope (Designator);
2890 Process_Formals (Formals, N);
2892 -- Ada 2005 (AI-345): If this is an overriding operation of an
2893 -- inherited interface operation, and the controlling type is
2894 -- a synchronized type, replace the type with its corresponding
2895 -- record, to match the proper signature of an overriding operation.
2896 -- Same processing for an access parameter whose designated type is
2897 -- derived from a synchronized interface.
2899 if Ada_Version >= Ada_05 then
2902 Formal_Typ : Entity_Id;
2903 Rec_Typ : Entity_Id;
2904 Desig_Typ : Entity_Id;
2907 Formal := First_Formal (Designator);
2908 while Present (Formal) loop
2909 Formal_Typ := Etype (Formal);
2911 if Is_Concurrent_Type (Formal_Typ)
2912 and then Present (Corresponding_Record_Type (Formal_Typ))
2914 Rec_Typ := Corresponding_Record_Type (Formal_Typ);
2916 if Present (Interfaces (Rec_Typ)) then
2917 Set_Etype (Formal, Rec_Typ);
2920 elsif Ekind (Formal_Typ) = E_Anonymous_Access_Type then
2921 Desig_Typ := Designated_Type (Formal_Typ);
2923 if Is_Concurrent_Type (Desig_Typ)
2924 and then Present (Corresponding_Record_Type (Desig_Typ))
2926 Rec_Typ := Corresponding_Record_Type (Desig_Typ);
2928 if Present (Interfaces (Rec_Typ)) then
2929 Set_Directly_Designated_Type (Formal_Typ, Rec_Typ);
2934 Next_Formal (Formal);
2941 -- The subprogram scope is pushed and popped around the processing of
2942 -- the return type for consistency with call above to Process_Formals
2943 -- (which itself can call Analyze_Return_Type), and to ensure that any
2944 -- itype created for the return type will be associated with the proper
2947 elsif Nkind (N) = N_Function_Specification then
2948 Push_Scope (Designator);
2950 Analyze_Return_Type (N);
2955 if Nkind (N) = N_Function_Specification then
2956 if Nkind (Designator) = N_Defining_Operator_Symbol then
2957 Valid_Operator_Definition (Designator);
2960 May_Need_Actuals (Designator);
2962 -- Ada 2005 (AI-251): If the return type is abstract, verify that
2963 -- the subprogram is abstract also. This does not apply to renaming
2964 -- declarations, where abstractness is inherited.
2966 -- In case of primitives associated with abstract interface types
2967 -- the check is applied later (see Analyze_Subprogram_Declaration).
2969 if not Nkind_In (Parent (N), N_Subprogram_Renaming_Declaration,
2970 N_Abstract_Subprogram_Declaration,
2971 N_Formal_Abstract_Subprogram_Declaration)
2973 if Is_Abstract_Type (Etype (Designator))
2974 and then not Is_Interface (Etype (Designator))
2977 ("function that returns abstract type must be abstract", N);
2979 -- Ada 2012 (AI-0073): extend this test to subprograms with an
2980 -- access result whose designated type is abstract.
2982 elsif Nkind (Result_Definition (N)) = N_Access_Definition
2984 not Is_Class_Wide_Type (Designated_Type (Etype (Designator)))
2985 and then Is_Abstract_Type (Designated_Type (Etype (Designator)))
2986 and then Ada_Version >= Ada_12
2988 Error_Msg_N ("function whose access result designates "
2989 & "abstract type must be abstract", N);
2995 end Analyze_Subprogram_Specification;
2997 --------------------------
2998 -- Build_Body_To_Inline --
2999 --------------------------
3001 procedure Build_Body_To_Inline (N : Node_Id; Subp : Entity_Id) is
3002 Decl : constant Node_Id := Unit_Declaration_Node (Subp);
3003 Original_Body : Node_Id;
3004 Body_To_Analyze : Node_Id;
3005 Max_Size : constant := 10;
3006 Stat_Count : Integer := 0;
3008 function Has_Excluded_Declaration (Decls : List_Id) return Boolean;
3009 -- Check for declarations that make inlining not worthwhile
3011 function Has_Excluded_Statement (Stats : List_Id) return Boolean;
3012 -- Check for statements that make inlining not worthwhile: any tasking
3013 -- statement, nested at any level. Keep track of total number of
3014 -- elementary statements, as a measure of acceptable size.
3016 function Has_Pending_Instantiation return Boolean;
3017 -- If some enclosing body contains instantiations that appear before the
3018 -- corresponding generic body, the enclosing body has a freeze node so
3019 -- that it can be elaborated after the generic itself. This might
3020 -- conflict with subsequent inlinings, so that it is unsafe to try to
3021 -- inline in such a case.
3023 function Has_Single_Return return Boolean;
3024 -- In general we cannot inline functions that return unconstrained type.
3025 -- However, we can handle such functions if all return statements return
3026 -- a local variable that is the only declaration in the body of the
3027 -- function. In that case the call can be replaced by that local
3028 -- variable as is done for other inlined calls.
3030 procedure Remove_Pragmas;
3031 -- A pragma Unreferenced or pragma Unmodified that mentions a formal
3032 -- parameter has no meaning when the body is inlined and the formals
3033 -- are rewritten. Remove it from body to inline. The analysis of the
3034 -- non-inlined body will handle the pragma properly.
3036 function Uses_Secondary_Stack (Bod : Node_Id) return Boolean;
3037 -- If the body of the subprogram includes a call that returns an
3038 -- unconstrained type, the secondary stack is involved, and it
3039 -- is not worth inlining.
3041 ------------------------------
3042 -- Has_Excluded_Declaration --
3043 ------------------------------
3045 function Has_Excluded_Declaration (Decls : List_Id) return Boolean is
3048 function Is_Unchecked_Conversion (D : Node_Id) return Boolean;
3049 -- Nested subprograms make a given body ineligible for inlining, but
3050 -- we make an exception for instantiations of unchecked conversion.
3051 -- The body has not been analyzed yet, so check the name, and verify
3052 -- that the visible entity with that name is the predefined unit.
3054 -----------------------------
3055 -- Is_Unchecked_Conversion --
3056 -----------------------------
3058 function Is_Unchecked_Conversion (D : Node_Id) return Boolean is
3059 Id : constant Node_Id := Name (D);
3063 if Nkind (Id) = N_Identifier
3064 and then Chars (Id) = Name_Unchecked_Conversion
3066 Conv := Current_Entity (Id);
3068 elsif Nkind_In (Id, N_Selected_Component, N_Expanded_Name)
3069 and then Chars (Selector_Name (Id)) = Name_Unchecked_Conversion
3071 Conv := Current_Entity (Selector_Name (Id));
3076 return Present (Conv)
3077 and then Is_Predefined_File_Name
3078 (Unit_File_Name (Get_Source_Unit (Conv)))
3079 and then Is_Intrinsic_Subprogram (Conv);
3080 end Is_Unchecked_Conversion;
3082 -- Start of processing for Has_Excluded_Declaration
3086 while Present (D) loop
3087 if (Nkind (D) = N_Function_Instantiation
3088 and then not Is_Unchecked_Conversion (D))
3089 or else Nkind_In (D, N_Protected_Type_Declaration,
3090 N_Package_Declaration,
3091 N_Package_Instantiation,
3093 N_Procedure_Instantiation,
3094 N_Task_Type_Declaration)
3097 ("cannot inline & (non-allowed declaration)?", D, Subp);
3105 end Has_Excluded_Declaration;
3107 ----------------------------
3108 -- Has_Excluded_Statement --
3109 ----------------------------
3111 function Has_Excluded_Statement (Stats : List_Id) return Boolean is
3117 while Present (S) loop
3118 Stat_Count := Stat_Count + 1;
3120 if Nkind_In (S, N_Abort_Statement,
3121 N_Asynchronous_Select,
3122 N_Conditional_Entry_Call,
3123 N_Delay_Relative_Statement,
3124 N_Delay_Until_Statement,
3129 ("cannot inline & (non-allowed statement)?", S, Subp);
3132 elsif Nkind (S) = N_Block_Statement then
3133 if Present (Declarations (S))
3134 and then Has_Excluded_Declaration (Declarations (S))
3138 elsif Present (Handled_Statement_Sequence (S))
3141 (Exception_Handlers (Handled_Statement_Sequence (S)))
3143 Has_Excluded_Statement
3144 (Statements (Handled_Statement_Sequence (S))))
3149 elsif Nkind (S) = N_Case_Statement then
3150 E := First (Alternatives (S));
3151 while Present (E) loop
3152 if Has_Excluded_Statement (Statements (E)) then
3159 elsif Nkind (S) = N_If_Statement then
3160 if Has_Excluded_Statement (Then_Statements (S)) then
3164 if Present (Elsif_Parts (S)) then
3165 E := First (Elsif_Parts (S));
3166 while Present (E) loop
3167 if Has_Excluded_Statement (Then_Statements (E)) then
3174 if Present (Else_Statements (S))
3175 and then Has_Excluded_Statement (Else_Statements (S))
3180 elsif Nkind (S) = N_Loop_Statement
3181 and then Has_Excluded_Statement (Statements (S))
3185 elsif Nkind (S) = N_Extended_Return_Statement then
3186 if Has_Excluded_Statement
3187 (Statements (Handled_Statement_Sequence (S)))
3189 (Exception_Handlers (Handled_Statement_Sequence (S)))
3199 end Has_Excluded_Statement;
3201 -------------------------------
3202 -- Has_Pending_Instantiation --
3203 -------------------------------
3205 function Has_Pending_Instantiation return Boolean is
3210 while Present (S) loop
3211 if Is_Compilation_Unit (S)
3212 or else Is_Child_Unit (S)
3216 elsif Ekind (S) = E_Package
3217 and then Has_Forward_Instantiation (S)
3226 end Has_Pending_Instantiation;
3228 ------------------------
3229 -- Has_Single_Return --
3230 ------------------------
3232 function Has_Single_Return return Boolean is
3233 Return_Statement : Node_Id := Empty;
3235 function Check_Return (N : Node_Id) return Traverse_Result;
3241 function Check_Return (N : Node_Id) return Traverse_Result is
3243 if Nkind (N) = N_Simple_Return_Statement then
3244 if Present (Expression (N))
3245 and then Is_Entity_Name (Expression (N))
3247 if No (Return_Statement) then
3248 Return_Statement := N;
3251 elsif Chars (Expression (N)) =
3252 Chars (Expression (Return_Statement))
3260 -- A return statement within an extended return is a noop
3263 elsif No (Expression (N))
3264 and then Nkind (Parent (Parent (N))) =
3265 N_Extended_Return_Statement
3270 -- Expression has wrong form
3275 -- We can only inline a build-in-place function if
3276 -- it has a single extended return.
3278 elsif Nkind (N) = N_Extended_Return_Statement then
3279 if No (Return_Statement) then
3280 Return_Statement := N;
3292 function Check_All_Returns is new Traverse_Func (Check_Return);
3294 -- Start of processing for Has_Single_Return
3297 if Check_All_Returns (N) /= OK then
3300 elsif Nkind (Return_Statement) = N_Extended_Return_Statement then
3304 return Present (Declarations (N))
3305 and then Present (First (Declarations (N)))
3306 and then Chars (Expression (Return_Statement)) =
3307 Chars (Defining_Identifier (First (Declarations (N))));
3309 end Has_Single_Return;
3311 --------------------
3312 -- Remove_Pragmas --
3313 --------------------
3315 procedure Remove_Pragmas is
3320 Decl := First (Declarations (Body_To_Analyze));
3321 while Present (Decl) loop
3324 if Nkind (Decl) = N_Pragma
3325 and then (Pragma_Name (Decl) = Name_Unreferenced
3327 Pragma_Name (Decl) = Name_Unmodified)
3336 --------------------------
3337 -- Uses_Secondary_Stack --
3338 --------------------------
3340 function Uses_Secondary_Stack (Bod : Node_Id) return Boolean is
3341 function Check_Call (N : Node_Id) return Traverse_Result;
3342 -- Look for function calls that return an unconstrained type
3348 function Check_Call (N : Node_Id) return Traverse_Result is
3350 if Nkind (N) = N_Function_Call
3351 and then Is_Entity_Name (Name (N))
3352 and then Is_Composite_Type (Etype (Entity (Name (N))))
3353 and then not Is_Constrained (Etype (Entity (Name (N))))
3356 ("cannot inline & (call returns unconstrained type)?",
3364 function Check_Calls is new Traverse_Func (Check_Call);
3367 return Check_Calls (Bod) = Abandon;
3368 end Uses_Secondary_Stack;
3370 -- Start of processing for Build_Body_To_Inline
3373 -- Return immediately if done already
3375 if Nkind (Decl) = N_Subprogram_Declaration
3376 and then Present (Body_To_Inline (Decl))
3380 -- Functions that return unconstrained composite types require
3381 -- secondary stack handling, and cannot currently be inlined, unless
3382 -- all return statements return a local variable that is the first
3383 -- local declaration in the body.
3385 elsif Ekind (Subp) = E_Function
3386 and then not Is_Scalar_Type (Etype (Subp))
3387 and then not Is_Access_Type (Etype (Subp))
3388 and then not Is_Constrained (Etype (Subp))
3390 if not Has_Single_Return then
3392 ("cannot inline & (unconstrained return type)?", N, Subp);
3396 -- Ditto for functions that return controlled types, where controlled
3397 -- actions interfere in complex ways with inlining.
3399 elsif Ekind (Subp) = E_Function
3400 and then Needs_Finalization (Etype (Subp))
3403 ("cannot inline & (controlled return type)?", N, Subp);
3407 if Present (Declarations (N))
3408 and then Has_Excluded_Declaration (Declarations (N))
3413 if Present (Handled_Statement_Sequence (N)) then
3414 if Present (Exception_Handlers (Handled_Statement_Sequence (N))) then
3416 ("cannot inline& (exception handler)?",
3417 First (Exception_Handlers (Handled_Statement_Sequence (N))),
3421 Has_Excluded_Statement
3422 (Statements (Handled_Statement_Sequence (N)))
3428 -- We do not inline a subprogram that is too large, unless it is
3429 -- marked Inline_Always. This pragma does not suppress the other
3430 -- checks on inlining (forbidden declarations, handlers, etc).
3432 if Stat_Count > Max_Size
3433 and then not Has_Pragma_Inline_Always (Subp)
3435 Cannot_Inline ("cannot inline& (body too large)?", N, Subp);
3439 if Has_Pending_Instantiation then
3441 ("cannot inline& (forward instance within enclosing body)?",
3446 -- Within an instance, the body to inline must be treated as a nested
3447 -- generic, so that the proper global references are preserved.
3449 -- Note that we do not do this at the library level, because it is not
3450 -- needed, and furthermore this causes trouble if front end inlining
3451 -- is activated (-gnatN).
3453 if In_Instance and then Scope (Current_Scope) /= Standard_Standard then
3454 Save_Env (Scope (Current_Scope), Scope (Current_Scope));
3455 Original_Body := Copy_Generic_Node (N, Empty, True);
3457 Original_Body := Copy_Separate_Tree (N);
3460 -- We need to capture references to the formals in order to substitute
3461 -- the actuals at the point of inlining, i.e. instantiation. To treat
3462 -- the formals as globals to the body to inline, we nest it within
3463 -- a dummy parameterless subprogram, declared within the real one.
3464 -- To avoid generating an internal name (which is never public, and
3465 -- which affects serial numbers of other generated names), we use
3466 -- an internal symbol that cannot conflict with user declarations.
3468 Set_Parameter_Specifications (Specification (Original_Body), No_List);
3469 Set_Defining_Unit_Name
3470 (Specification (Original_Body),
3471 Make_Defining_Identifier (Sloc (N), Name_uParent));
3472 Set_Corresponding_Spec (Original_Body, Empty);
3474 Body_To_Analyze := Copy_Generic_Node (Original_Body, Empty, False);
3476 -- Set return type of function, which is also global and does not need
3479 if Ekind (Subp) = E_Function then
3480 Set_Result_Definition (Specification (Body_To_Analyze),
3481 New_Occurrence_Of (Etype (Subp), Sloc (N)));
3484 if No (Declarations (N)) then
3485 Set_Declarations (N, New_List (Body_To_Analyze));
3487 Append (Body_To_Analyze, Declarations (N));
3490 Expander_Mode_Save_And_Set (False);
3493 Analyze (Body_To_Analyze);
3494 Push_Scope (Defining_Entity (Body_To_Analyze));
3495 Save_Global_References (Original_Body);
3497 Remove (Body_To_Analyze);
3499 Expander_Mode_Restore;
3501 -- Restore environment if previously saved
3503 if In_Instance and then Scope (Current_Scope) /= Standard_Standard then
3507 -- If secondary stk used there is no point in inlining. We have
3508 -- already issued the warning in this case, so nothing to do.
3510 if Uses_Secondary_Stack (Body_To_Analyze) then
3514 Set_Body_To_Inline (Decl, Original_Body);
3515 Set_Ekind (Defining_Entity (Original_Body), Ekind (Subp));
3516 Set_Is_Inlined (Subp);
3517 end Build_Body_To_Inline;
3523 procedure Cannot_Inline (Msg : String; N : Node_Id; Subp : Entity_Id) is
3525 -- Do not emit warning if this is a predefined unit which is not the
3526 -- main unit. With validity checks enabled, some predefined subprograms
3527 -- may contain nested subprograms and become ineligible for inlining.
3529 if Is_Predefined_File_Name (Unit_File_Name (Get_Source_Unit (Subp)))
3530 and then not In_Extended_Main_Source_Unit (Subp)
3534 elsif Has_Pragma_Inline_Always (Subp) then
3536 -- Remove last character (question mark) to make this into an error,
3537 -- because the Inline_Always pragma cannot be obeyed.
3539 Error_Msg_NE (Msg (Msg'First .. Msg'Last - 1), N, Subp);
3541 elsif Ineffective_Inline_Warnings then
3542 Error_Msg_NE (Msg, N, Subp);
3546 -----------------------
3547 -- Check_Conformance --
3548 -----------------------
3550 procedure Check_Conformance
3551 (New_Id : Entity_Id;
3553 Ctype : Conformance_Type;
3555 Conforms : out Boolean;
3556 Err_Loc : Node_Id := Empty;
3557 Get_Inst : Boolean := False;
3558 Skip_Controlling_Formals : Boolean := False)
3560 procedure Conformance_Error (Msg : String; N : Node_Id := New_Id);
3561 -- Sets Conforms to False. If Errmsg is False, then that's all it does.
3562 -- If Errmsg is True, then processing continues to post an error message
3563 -- for conformance error on given node. Two messages are output. The
3564 -- first message points to the previous declaration with a general "no
3565 -- conformance" message. The second is the detailed reason, supplied as
3566 -- Msg. The parameter N provide information for a possible & insertion
3567 -- in the message, and also provides the location for posting the
3568 -- message in the absence of a specified Err_Loc location.
3570 -----------------------
3571 -- Conformance_Error --
3572 -----------------------
3574 procedure Conformance_Error (Msg : String; N : Node_Id := New_Id) is
3581 if No (Err_Loc) then
3587 Error_Msg_Sloc := Sloc (Old_Id);
3590 when Type_Conformant =>
3591 Error_Msg_N -- CODEFIX
3592 ("not type conformant with declaration#!", Enode);
3594 when Mode_Conformant =>
3595 if Nkind (Parent (Old_Id)) = N_Full_Type_Declaration then
3597 ("not mode conformant with operation inherited#!",
3601 ("not mode conformant with declaration#!", Enode);
3604 when Subtype_Conformant =>
3605 if Nkind (Parent (Old_Id)) = N_Full_Type_Declaration then
3607 ("not subtype conformant with operation inherited#!",
3611 ("not subtype conformant with declaration#!", Enode);
3614 when Fully_Conformant =>
3615 if Nkind (Parent (Old_Id)) = N_Full_Type_Declaration then
3616 Error_Msg_N -- CODEFIX
3617 ("not fully conformant with operation inherited#!",
3620 Error_Msg_N -- CODEFIX
3621 ("not fully conformant with declaration#!", Enode);
3625 Error_Msg_NE (Msg, Enode, N);
3627 end Conformance_Error;
3631 Old_Type : constant Entity_Id := Etype (Old_Id);
3632 New_Type : constant Entity_Id := Etype (New_Id);
3633 Old_Formal : Entity_Id;
3634 New_Formal : Entity_Id;
3635 Access_Types_Match : Boolean;
3636 Old_Formal_Base : Entity_Id;
3637 New_Formal_Base : Entity_Id;
3639 -- Start of processing for Check_Conformance
3644 -- We need a special case for operators, since they don't appear
3647 if Ctype = Type_Conformant then
3648 if Ekind (New_Id) = E_Operator
3649 and then Operator_Matches_Spec (New_Id, Old_Id)
3655 -- If both are functions/operators, check return types conform
3657 if Old_Type /= Standard_Void_Type
3658 and then New_Type /= Standard_Void_Type
3661 -- If we are checking interface conformance we omit controlling
3662 -- arguments and result, because we are only checking the conformance
3663 -- of the remaining parameters.
3665 if Has_Controlling_Result (Old_Id)
3666 and then Has_Controlling_Result (New_Id)
3667 and then Skip_Controlling_Formals
3671 elsif not Conforming_Types (Old_Type, New_Type, Ctype, Get_Inst) then
3672 Conformance_Error ("\return type does not match!", New_Id);
3676 -- Ada 2005 (AI-231): In case of anonymous access types check the
3677 -- null-exclusion and access-to-constant attributes match.
3679 if Ada_Version >= Ada_05
3680 and then Ekind (Etype (Old_Type)) = E_Anonymous_Access_Type
3682 (Can_Never_Be_Null (Old_Type)
3683 /= Can_Never_Be_Null (New_Type)
3684 or else Is_Access_Constant (Etype (Old_Type))
3685 /= Is_Access_Constant (Etype (New_Type)))
3687 Conformance_Error ("\return type does not match!", New_Id);
3691 -- If either is a function/operator and the other isn't, error
3693 elsif Old_Type /= Standard_Void_Type
3694 or else New_Type /= Standard_Void_Type
3696 Conformance_Error ("\functions can only match functions!", New_Id);
3700 -- In subtype conformant case, conventions must match (RM 6.3.1(16)).
3701 -- If this is a renaming as body, refine error message to indicate that
3702 -- the conflict is with the original declaration. If the entity is not
3703 -- frozen, the conventions don't have to match, the one of the renamed
3704 -- entity is inherited.
3706 if Ctype >= Subtype_Conformant then
3707 if Convention (Old_Id) /= Convention (New_Id) then
3709 if not Is_Frozen (New_Id) then
3712 elsif Present (Err_Loc)
3713 and then Nkind (Err_Loc) = N_Subprogram_Renaming_Declaration
3714 and then Present (Corresponding_Spec (Err_Loc))
3716 Error_Msg_Name_1 := Chars (New_Id);
3718 Name_Ada + Convention_Id'Pos (Convention (New_Id));
3719 Conformance_Error ("\prior declaration for% has convention %!");
3722 Conformance_Error ("\calling conventions do not match!");
3727 elsif Is_Formal_Subprogram (Old_Id)
3728 or else Is_Formal_Subprogram (New_Id)
3730 Conformance_Error ("\formal subprograms not allowed!");
3735 -- Deal with parameters
3737 -- Note: we use the entity information, rather than going directly
3738 -- to the specification in the tree. This is not only simpler, but
3739 -- absolutely necessary for some cases of conformance tests between
3740 -- operators, where the declaration tree simply does not exist!
3742 Old_Formal := First_Formal (Old_Id);
3743 New_Formal := First_Formal (New_Id);
3744 while Present (Old_Formal) and then Present (New_Formal) loop
3745 if Is_Controlling_Formal (Old_Formal)
3746 and then Is_Controlling_Formal (New_Formal)
3747 and then Skip_Controlling_Formals
3749 -- The controlling formals will have different types when
3750 -- comparing an interface operation with its match, but both
3751 -- or neither must be access parameters.
3753 if Is_Access_Type (Etype (Old_Formal))
3755 Is_Access_Type (Etype (New_Formal))
3757 goto Skip_Controlling_Formal;
3760 ("\access parameter does not match!", New_Formal);
3764 if Ctype = Fully_Conformant then
3766 -- Names must match. Error message is more accurate if we do
3767 -- this before checking that the types of the formals match.
3769 if Chars (Old_Formal) /= Chars (New_Formal) then
3770 Conformance_Error ("\name & does not match!", New_Formal);
3772 -- Set error posted flag on new formal as well to stop
3773 -- junk cascaded messages in some cases.
3775 Set_Error_Posted (New_Formal);
3779 -- Null exclusion must match
3781 if Null_Exclusion_Present (Parent (Old_Formal))
3783 Null_Exclusion_Present (Parent (New_Formal))
3785 -- Only give error if both come from source. This should be
3786 -- investigated some time, since it should not be needed ???
3788 if Comes_From_Source (Old_Formal)
3790 Comes_From_Source (New_Formal)
3793 ("\null exclusion for & does not match", New_Formal);
3795 -- Mark error posted on the new formal to avoid duplicated
3796 -- complaint about types not matching.
3798 Set_Error_Posted (New_Formal);
3803 -- Ada 2005 (AI-423): Possible access [sub]type and itype match. This
3804 -- case occurs whenever a subprogram is being renamed and one of its
3805 -- parameters imposes a null exclusion. For example:
3807 -- type T is null record;
3808 -- type Acc_T is access T;
3809 -- subtype Acc_T_Sub is Acc_T;
3811 -- procedure P (Obj : not null Acc_T_Sub); -- itype
3812 -- procedure Ren_P (Obj : Acc_T_Sub) -- subtype
3815 Old_Formal_Base := Etype (Old_Formal);
3816 New_Formal_Base := Etype (New_Formal);
3819 Old_Formal_Base := Get_Instance_Of (Old_Formal_Base);
3820 New_Formal_Base := Get_Instance_Of (New_Formal_Base);
3823 Access_Types_Match := Ada_Version >= Ada_05
3825 -- Ensure that this rule is only applied when New_Id is a
3826 -- renaming of Old_Id.
3828 and then Nkind (Parent (Parent (New_Id))) =
3829 N_Subprogram_Renaming_Declaration
3830 and then Nkind (Name (Parent (Parent (New_Id)))) in N_Has_Entity
3831 and then Present (Entity (Name (Parent (Parent (New_Id)))))
3832 and then Entity (Name (Parent (Parent (New_Id)))) = Old_Id
3834 -- Now handle the allowed access-type case
3836 and then Is_Access_Type (Old_Formal_Base)
3837 and then Is_Access_Type (New_Formal_Base)
3839 -- The type kinds must match. The only exception occurs with
3840 -- multiple generics of the form:
3843 -- type F is private; type A is private;
3844 -- type F_Ptr is access F; type A_Ptr is access A;
3845 -- with proc F_P (X : F_Ptr); with proc A_P (X : A_Ptr);
3846 -- package F_Pack is ... package A_Pack is
3847 -- package F_Inst is
3848 -- new F_Pack (A, A_Ptr, A_P);
3850 -- When checking for conformance between the parameters of A_P
3851 -- and F_P, the type kinds of F_Ptr and A_Ptr will not match
3852 -- because the compiler has transformed A_Ptr into a subtype of
3853 -- F_Ptr. We catch this case in the code below.
3855 and then (Ekind (Old_Formal_Base) = Ekind (New_Formal_Base)
3857 (Is_Generic_Type (Old_Formal_Base)
3858 and then Is_Generic_Type (New_Formal_Base)
3859 and then Is_Internal (New_Formal_Base)
3860 and then Etype (Etype (New_Formal_Base)) =
3862 and then Directly_Designated_Type (Old_Formal_Base) =
3863 Directly_Designated_Type (New_Formal_Base)
3864 and then ((Is_Itype (Old_Formal_Base)
3865 and then Can_Never_Be_Null (Old_Formal_Base))
3867 (Is_Itype (New_Formal_Base)
3868 and then Can_Never_Be_Null (New_Formal_Base)));
3870 -- Types must always match. In the visible part of an instance,
3871 -- usual overloading rules for dispatching operations apply, and
3872 -- we check base types (not the actual subtypes).
3874 if In_Instance_Visible_Part
3875 and then Is_Dispatching_Operation (New_Id)
3877 if not Conforming_Types
3878 (T1 => Base_Type (Etype (Old_Formal)),
3879 T2 => Base_Type (Etype (New_Formal)),
3881 Get_Inst => Get_Inst)
3882 and then not Access_Types_Match
3884 Conformance_Error ("\type of & does not match!", New_Formal);
3888 elsif not Conforming_Types
3889 (T1 => Old_Formal_Base,
3890 T2 => New_Formal_Base,
3892 Get_Inst => Get_Inst)
3893 and then not Access_Types_Match
3895 -- Don't give error message if old type is Any_Type. This test
3896 -- avoids some cascaded errors, e.g. in case of a bad spec.
3898 if Errmsg and then Old_Formal_Base = Any_Type then
3901 Conformance_Error ("\type of & does not match!", New_Formal);
3907 -- For mode conformance, mode must match
3909 if Ctype >= Mode_Conformant then
3910 if Parameter_Mode (Old_Formal) /= Parameter_Mode (New_Formal) then
3911 Conformance_Error ("\mode of & does not match!", New_Formal);
3914 -- Part of mode conformance for access types is having the same
3915 -- constant modifier.
3917 elsif Access_Types_Match
3918 and then Is_Access_Constant (Old_Formal_Base) /=
3919 Is_Access_Constant (New_Formal_Base)
3922 ("\constant modifier does not match!", New_Formal);
3927 if Ctype >= Subtype_Conformant then
3929 -- Ada 2005 (AI-231): In case of anonymous access types check
3930 -- the null-exclusion and access-to-constant attributes must
3933 if Ada_Version >= Ada_05
3934 and then Ekind (Etype (Old_Formal)) = E_Anonymous_Access_Type
3935 and then Ekind (Etype (New_Formal)) = E_Anonymous_Access_Type
3937 (Can_Never_Be_Null (Old_Formal) /=
3938 Can_Never_Be_Null (New_Formal)
3940 Is_Access_Constant (Etype (Old_Formal)) /=
3941 Is_Access_Constant (Etype (New_Formal)))
3943 -- Do not complain if error already posted on New_Formal. This
3944 -- avoids some redundant error messages.
3946 and then not Error_Posted (New_Formal)
3948 -- It is allowed to omit the null-exclusion in case of stream
3949 -- attribute subprograms. We recognize stream subprograms
3950 -- through their TSS-generated suffix.
3953 TSS_Name : constant TSS_Name_Type := Get_TSS_Name (New_Id);
3955 if TSS_Name /= TSS_Stream_Read
3956 and then TSS_Name /= TSS_Stream_Write
3957 and then TSS_Name /= TSS_Stream_Input
3958 and then TSS_Name /= TSS_Stream_Output
3961 ("\type of & does not match!", New_Formal);
3968 -- Full conformance checks
3970 if Ctype = Fully_Conformant then
3972 -- We have checked already that names match
3974 if Parameter_Mode (Old_Formal) = E_In_Parameter then
3976 -- Check default expressions for in parameters
3979 NewD : constant Boolean :=
3980 Present (Default_Value (New_Formal));
3981 OldD : constant Boolean :=
3982 Present (Default_Value (Old_Formal));
3984 if NewD or OldD then
3986 -- The old default value has been analyzed because the
3987 -- current full declaration will have frozen everything
3988 -- before. The new default value has not been analyzed,
3989 -- so analyze it now before we check for conformance.
3992 Push_Scope (New_Id);
3993 Preanalyze_Spec_Expression
3994 (Default_Value (New_Formal), Etype (New_Formal));
3998 if not (NewD and OldD)
3999 or else not Fully_Conformant_Expressions
4000 (Default_Value (Old_Formal),
4001 Default_Value (New_Formal))
4004 ("\default expression for & does not match!",
4013 -- A couple of special checks for Ada 83 mode. These checks are
4014 -- skipped if either entity is an operator in package Standard,
4015 -- or if either old or new instance is not from the source program.
4017 if Ada_Version = Ada_83
4018 and then Sloc (Old_Id) > Standard_Location
4019 and then Sloc (New_Id) > Standard_Location
4020 and then Comes_From_Source (Old_Id)
4021 and then Comes_From_Source (New_Id)
4024 Old_Param : constant Node_Id := Declaration_Node (Old_Formal);
4025 New_Param : constant Node_Id := Declaration_Node (New_Formal);
4028 -- Explicit IN must be present or absent in both cases. This
4029 -- test is required only in the full conformance case.
4031 if In_Present (Old_Param) /= In_Present (New_Param)
4032 and then Ctype = Fully_Conformant
4035 ("\(Ada 83) IN must appear in both declarations",
4040 -- Grouping (use of comma in param lists) must be the same
4041 -- This is where we catch a misconformance like:
4044 -- A : Integer; B : Integer
4046 -- which are represented identically in the tree except
4047 -- for the setting of the flags More_Ids and Prev_Ids.
4049 if More_Ids (Old_Param) /= More_Ids (New_Param)
4050 or else Prev_Ids (Old_Param) /= Prev_Ids (New_Param)
4053 ("\grouping of & does not match!", New_Formal);
4059 -- This label is required when skipping controlling formals
4061 <<Skip_Controlling_Formal>>
4063 Next_Formal (Old_Formal);
4064 Next_Formal (New_Formal);
4067 if Present (Old_Formal) then
4068 Conformance_Error ("\too few parameters!");
4071 elsif Present (New_Formal) then
4072 Conformance_Error ("\too many parameters!", New_Formal);
4075 end Check_Conformance;
4077 -----------------------
4078 -- Check_Conventions --
4079 -----------------------
4081 procedure Check_Conventions (Typ : Entity_Id) is
4082 Ifaces_List : Elist_Id;
4084 procedure Check_Convention (Op : Entity_Id);
4085 -- Verify that the convention of inherited dispatching operation Op is
4086 -- consistent among all subprograms it overrides. In order to minimize
4087 -- the search, Search_From is utilized to designate a specific point in
4088 -- the list rather than iterating over the whole list once more.
4090 ----------------------
4091 -- Check_Convention --
4092 ----------------------
4094 procedure Check_Convention (Op : Entity_Id) is
4095 Iface_Elmt : Elmt_Id;
4096 Iface_Prim_Elmt : Elmt_Id;
4097 Iface_Prim : Entity_Id;
4100 Iface_Elmt := First_Elmt (Ifaces_List);
4101 while Present (Iface_Elmt) loop
4103 First_Elmt (Primitive_Operations (Node (Iface_Elmt)));
4104 while Present (Iface_Prim_Elmt) loop
4105 Iface_Prim := Node (Iface_Prim_Elmt);
4107 if Is_Interface_Conformant (Typ, Iface_Prim, Op)
4108 and then Convention (Iface_Prim) /= Convention (Op)
4111 ("inconsistent conventions in primitive operations", Typ);
4113 Error_Msg_Name_1 := Chars (Op);
4114 Error_Msg_Name_2 := Get_Convention_Name (Convention (Op));
4115 Error_Msg_Sloc := Sloc (Op);
4117 if Comes_From_Source (Op) or else No (Alias (Op)) then
4118 if not Is_Overriding_Operation (Op) then
4119 Error_Msg_N ("\\primitive % defined #", Typ);
4122 ("\\overriding operation % with " &
4123 "convention % defined #", Typ);
4126 else pragma Assert (Present (Alias (Op)));
4127 Error_Msg_Sloc := Sloc (Alias (Op));
4129 ("\\inherited operation % with " &
4130 "convention % defined #", Typ);
4133 Error_Msg_Name_1 := Chars (Op);
4135 Get_Convention_Name (Convention (Iface_Prim));
4136 Error_Msg_Sloc := Sloc (Iface_Prim);
4138 ("\\overridden operation % with " &
4139 "convention % defined #", Typ);
4141 -- Avoid cascading errors
4146 Next_Elmt (Iface_Prim_Elmt);
4149 Next_Elmt (Iface_Elmt);
4151 end Check_Convention;
4155 Prim_Op : Entity_Id;
4156 Prim_Op_Elmt : Elmt_Id;
4158 -- Start of processing for Check_Conventions
4161 if not Has_Interfaces (Typ) then
4165 Collect_Interfaces (Typ, Ifaces_List);
4167 -- The algorithm checks every overriding dispatching operation against
4168 -- all the corresponding overridden dispatching operations, detecting
4169 -- differences in conventions.
4171 Prim_Op_Elmt := First_Elmt (Primitive_Operations (Typ));
4172 while Present (Prim_Op_Elmt) loop
4173 Prim_Op := Node (Prim_Op_Elmt);
4175 -- A small optimization: skip the predefined dispatching operations
4176 -- since they always have the same convention.
4178 if not Is_Predefined_Dispatching_Operation (Prim_Op) then
4179 Check_Convention (Prim_Op);
4182 Next_Elmt (Prim_Op_Elmt);
4184 end Check_Conventions;
4186 ------------------------------
4187 -- Check_Delayed_Subprogram --
4188 ------------------------------
4190 procedure Check_Delayed_Subprogram (Designator : Entity_Id) is
4193 procedure Possible_Freeze (T : Entity_Id);
4194 -- T is the type of either a formal parameter or of the return type.
4195 -- If T is not yet frozen and needs a delayed freeze, then the
4196 -- subprogram itself must be delayed. If T is the limited view of an
4197 -- incomplete type the subprogram must be frozen as well, because
4198 -- T may depend on local types that have not been frozen yet.
4200 ---------------------
4201 -- Possible_Freeze --
4202 ---------------------
4204 procedure Possible_Freeze (T : Entity_Id) is
4206 if Has_Delayed_Freeze (T) and then not Is_Frozen (T) then
4207 Set_Has_Delayed_Freeze (Designator);
4209 elsif Is_Access_Type (T)
4210 and then Has_Delayed_Freeze (Designated_Type (T))
4211 and then not Is_Frozen (Designated_Type (T))
4213 Set_Has_Delayed_Freeze (Designator);
4215 elsif Ekind (T) = E_Incomplete_Type and then From_With_Type (T) then
4216 Set_Has_Delayed_Freeze (Designator);
4219 end Possible_Freeze;
4221 -- Start of processing for Check_Delayed_Subprogram
4224 -- Never need to freeze abstract subprogram
4226 if Ekind (Designator) /= E_Subprogram_Type
4227 and then Is_Abstract_Subprogram (Designator)
4231 -- Need delayed freeze if return type itself needs a delayed
4232 -- freeze and is not yet frozen.
4234 Possible_Freeze (Etype (Designator));
4235 Possible_Freeze (Base_Type (Etype (Designator))); -- needed ???
4237 -- Need delayed freeze if any of the formal types themselves need
4238 -- a delayed freeze and are not yet frozen.
4240 F := First_Formal (Designator);
4241 while Present (F) loop
4242 Possible_Freeze (Etype (F));
4243 Possible_Freeze (Base_Type (Etype (F))); -- needed ???
4248 -- Mark functions that return by reference. Note that it cannot be
4249 -- done for delayed_freeze subprograms because the underlying
4250 -- returned type may not be known yet (for private types)
4252 if not Has_Delayed_Freeze (Designator)
4253 and then Expander_Active
4256 Typ : constant Entity_Id := Etype (Designator);
4257 Utyp : constant Entity_Id := Underlying_Type (Typ);
4259 if Is_Immutably_Limited_Type (Typ) then
4260 Set_Returns_By_Ref (Designator);
4261 elsif Present (Utyp) and then CW_Or_Has_Controlled_Part (Utyp) then
4262 Set_Returns_By_Ref (Designator);
4266 end Check_Delayed_Subprogram;
4268 ------------------------------------
4269 -- Check_Discriminant_Conformance --
4270 ------------------------------------
4272 procedure Check_Discriminant_Conformance
4277 Old_Discr : Entity_Id := First_Discriminant (Prev);
4278 New_Discr : Node_Id := First (Discriminant_Specifications (N));
4279 New_Discr_Id : Entity_Id;
4280 New_Discr_Type : Entity_Id;
4282 procedure Conformance_Error (Msg : String; N : Node_Id);
4283 -- Post error message for conformance error on given node. Two messages
4284 -- are output. The first points to the previous declaration with a
4285 -- general "no conformance" message. The second is the detailed reason,
4286 -- supplied as Msg. The parameter N provide information for a possible
4287 -- & insertion in the message.
4289 -----------------------
4290 -- Conformance_Error --
4291 -----------------------
4293 procedure Conformance_Error (Msg : String; N : Node_Id) is
4295 Error_Msg_Sloc := Sloc (Prev_Loc);
4296 Error_Msg_N -- CODEFIX
4297 ("not fully conformant with declaration#!", N);
4298 Error_Msg_NE (Msg, N, N);
4299 end Conformance_Error;
4301 -- Start of processing for Check_Discriminant_Conformance
4304 while Present (Old_Discr) and then Present (New_Discr) loop
4306 New_Discr_Id := Defining_Identifier (New_Discr);
4308 -- The subtype mark of the discriminant on the full type has not
4309 -- been analyzed so we do it here. For an access discriminant a new
4312 if Nkind (Discriminant_Type (New_Discr)) = N_Access_Definition then
4314 Access_Definition (N, Discriminant_Type (New_Discr));
4317 Analyze (Discriminant_Type (New_Discr));
4318 New_Discr_Type := Etype (Discriminant_Type (New_Discr));
4320 -- Ada 2005: if the discriminant definition carries a null
4321 -- exclusion, create an itype to check properly for consistency
4322 -- with partial declaration.
4324 if Is_Access_Type (New_Discr_Type)
4325 and then Null_Exclusion_Present (New_Discr)
4328 Create_Null_Excluding_Itype
4329 (T => New_Discr_Type,
4330 Related_Nod => New_Discr,
4331 Scope_Id => Current_Scope);
4335 if not Conforming_Types
4336 (Etype (Old_Discr), New_Discr_Type, Fully_Conformant)
4338 Conformance_Error ("type of & does not match!", New_Discr_Id);
4341 -- Treat the new discriminant as an occurrence of the old one,
4342 -- for navigation purposes, and fill in some semantic
4343 -- information, for completeness.
4345 Generate_Reference (Old_Discr, New_Discr_Id, 'r');
4346 Set_Etype (New_Discr_Id, Etype (Old_Discr));
4347 Set_Scope (New_Discr_Id, Scope (Old_Discr));
4352 if Chars (Old_Discr) /= Chars (Defining_Identifier (New_Discr)) then
4353 Conformance_Error ("name & does not match!", New_Discr_Id);
4357 -- Default expressions must match
4360 NewD : constant Boolean :=
4361 Present (Expression (New_Discr));
4362 OldD : constant Boolean :=
4363 Present (Expression (Parent (Old_Discr)));
4366 if NewD or OldD then
4368 -- The old default value has been analyzed and expanded,
4369 -- because the current full declaration will have frozen
4370 -- everything before. The new default values have not been
4371 -- expanded, so expand now to check conformance.
4374 Preanalyze_Spec_Expression
4375 (Expression (New_Discr), New_Discr_Type);
4378 if not (NewD and OldD)
4379 or else not Fully_Conformant_Expressions
4380 (Expression (Parent (Old_Discr)),
4381 Expression (New_Discr))
4385 ("default expression for & does not match!",
4392 -- In Ada 83 case, grouping must match: (A,B : X) /= (A : X; B : X)
4394 if Ada_Version = Ada_83 then
4396 Old_Disc : constant Node_Id := Declaration_Node (Old_Discr);
4399 -- Grouping (use of comma in param lists) must be the same
4400 -- This is where we catch a misconformance like:
4403 -- A : Integer; B : Integer
4405 -- which are represented identically in the tree except
4406 -- for the setting of the flags More_Ids and Prev_Ids.
4408 if More_Ids (Old_Disc) /= More_Ids (New_Discr)
4409 or else Prev_Ids (Old_Disc) /= Prev_Ids (New_Discr)
4412 ("grouping of & does not match!", New_Discr_Id);
4418 Next_Discriminant (Old_Discr);
4422 if Present (Old_Discr) then
4423 Conformance_Error ("too few discriminants!", Defining_Identifier (N));
4426 elsif Present (New_Discr) then
4428 ("too many discriminants!", Defining_Identifier (New_Discr));
4431 end Check_Discriminant_Conformance;
4433 ----------------------------
4434 -- Check_Fully_Conformant --
4435 ----------------------------
4437 procedure Check_Fully_Conformant
4438 (New_Id : Entity_Id;
4440 Err_Loc : Node_Id := Empty)
4443 pragma Warnings (Off, Result);
4446 (New_Id, Old_Id, Fully_Conformant, True, Result, Err_Loc);
4447 end Check_Fully_Conformant;
4449 ---------------------------
4450 -- Check_Mode_Conformant --
4451 ---------------------------
4453 procedure Check_Mode_Conformant
4454 (New_Id : Entity_Id;
4456 Err_Loc : Node_Id := Empty;
4457 Get_Inst : Boolean := False)
4460 pragma Warnings (Off, Result);
4463 (New_Id, Old_Id, Mode_Conformant, True, Result, Err_Loc, Get_Inst);
4464 end Check_Mode_Conformant;
4466 --------------------------------
4467 -- Check_Overriding_Indicator --
4468 --------------------------------
4470 procedure Check_Overriding_Indicator
4472 Overridden_Subp : Entity_Id;
4473 Is_Primitive : Boolean)
4479 -- No overriding indicator for literals
4481 if Ekind (Subp) = E_Enumeration_Literal then
4484 elsif Ekind (Subp) = E_Entry then
4485 Decl := Parent (Subp);
4487 -- No point in analyzing a malformed operator
4489 elsif Nkind (Subp) = N_Defining_Operator_Symbol
4490 and then Error_Posted (Subp)
4495 Decl := Unit_Declaration_Node (Subp);
4498 if Nkind_In (Decl, N_Subprogram_Body,
4499 N_Subprogram_Body_Stub,
4500 N_Subprogram_Declaration,
4501 N_Abstract_Subprogram_Declaration,
4502 N_Subprogram_Renaming_Declaration)
4504 Spec := Specification (Decl);
4506 elsif Nkind (Decl) = N_Entry_Declaration then
4513 -- The overriding operation is type conformant with the overridden one,
4514 -- but the names of the formals are not required to match. If the names
4515 -- appear permuted in the overriding operation, this is a possible
4516 -- source of confusion that is worth diagnosing. Controlling formals
4517 -- often carry names that reflect the type, and it is not worthwhile
4518 -- requiring that their names match.
4520 if Present (Overridden_Subp)
4521 and then Nkind (Subp) /= N_Defining_Operator_Symbol
4528 Form1 := First_Formal (Subp);
4529 Form2 := First_Formal (Overridden_Subp);
4531 -- If the overriding operation is a synchronized operation, skip
4532 -- the first parameter of the overridden operation, which is
4533 -- implicit in the new one. If the operation is declared in the
4534 -- body it is not primitive and all formals must match.
4536 if Is_Concurrent_Type (Scope (Subp))
4537 and then Is_Tagged_Type (Scope (Subp))
4538 and then not Has_Completion (Scope (Subp))
4540 Form2 := Next_Formal (Form2);
4543 if Present (Form1) then
4544 Form1 := Next_Formal (Form1);
4545 Form2 := Next_Formal (Form2);
4548 while Present (Form1) loop
4549 if not Is_Controlling_Formal (Form1)
4550 and then Present (Next_Formal (Form2))
4551 and then Chars (Form1) = Chars (Next_Formal (Form2))
4553 Error_Msg_Node_2 := Alias (Overridden_Subp);
4554 Error_Msg_Sloc := Sloc (Error_Msg_Node_2);
4556 ("& does not match corresponding formal of&#",
4561 Next_Formal (Form1);
4562 Next_Formal (Form2);
4567 -- If there is an overridden subprogram, then check that there is no
4568 -- "not overriding" indicator, and mark the subprogram as overriding.
4569 -- This is not done if the overridden subprogram is marked as hidden,
4570 -- which can occur for the case of inherited controlled operations
4571 -- (see Derive_Subprogram), unless the inherited subprogram's parent
4572 -- subprogram is not itself hidden. (Note: This condition could probably
4573 -- be simplified, leaving out the testing for the specific controlled
4574 -- cases, but it seems safer and clearer this way, and echoes similar
4575 -- special-case tests of this kind in other places.)
4577 if Present (Overridden_Subp)
4578 and then (not Is_Hidden (Overridden_Subp)
4580 ((Chars (Overridden_Subp) = Name_Initialize
4581 or else Chars (Overridden_Subp) = Name_Adjust
4582 or else Chars (Overridden_Subp) = Name_Finalize)
4583 and then Present (Alias (Overridden_Subp))
4584 and then not Is_Hidden (Alias (Overridden_Subp))))
4586 if Must_Not_Override (Spec) then
4587 Error_Msg_Sloc := Sloc (Overridden_Subp);
4589 if Ekind (Subp) = E_Entry then
4591 ("entry & overrides inherited operation #", Spec, Subp);
4594 ("subprogram & overrides inherited operation #", Spec, Subp);
4597 elsif Is_Subprogram (Subp) then
4598 Set_Is_Overriding_Operation (Subp);
4601 -- If primitive flag is set or this is a protected operation, then
4602 -- the operation is overriding at the point of its declaration, so
4603 -- warn if necessary. Otherwise it may have been declared before the
4604 -- operation it overrides and no check is required.
4607 and then not Must_Override (Spec)
4608 and then (Is_Primitive
4609 or else Ekind (Scope (Subp)) = E_Protected_Type)
4611 Style.Missing_Overriding (Decl, Subp);
4614 -- If Subp is an operator, it may override a predefined operation, if
4615 -- it is defined in the same scope as the type to which it applies.
4616 -- In that case Overridden_Subp is empty because of our implicit
4617 -- representation for predefined operators. We have to check whether the
4618 -- signature of Subp matches that of a predefined operator. Note that
4619 -- first argument provides the name of the operator, and the second
4620 -- argument the signature that may match that of a standard operation.
4621 -- If the indicator is overriding, then the operator must match a
4622 -- predefined signature, because we know already that there is no
4623 -- explicit overridden operation.
4625 elsif Nkind (Subp) = N_Defining_Operator_Symbol then
4627 Typ : constant Entity_Id :=
4628 Base_Type (Etype (First_Formal (Subp)));
4630 Can_Override : constant Boolean :=
4631 Operator_Matches_Spec (Subp, Subp)
4632 and then Scope (Subp) = Scope (Typ)
4633 and then not Is_Class_Wide_Type (Typ);
4636 if Must_Not_Override (Spec) then
4638 -- If this is not a primitive or a protected subprogram, then
4639 -- "not overriding" is illegal.
4642 and then Ekind (Scope (Subp)) /= E_Protected_Type
4645 ("overriding indicator only allowed "
4646 & "if subprogram is primitive", Subp);
4648 elsif Can_Override then
4650 ("subprogram& overrides predefined operator ", Spec, Subp);
4653 elsif Must_Override (Spec) then
4654 if Is_Overriding_Operation (Subp) then
4657 elsif not Can_Override then
4658 Error_Msg_NE ("subprogram & is not overriding", Spec, Subp);
4661 elsif not Error_Posted (Subp)
4662 and then Style_Check
4663 and then Can_Override
4665 not Is_Predefined_File_Name
4666 (Unit_File_Name (Get_Source_Unit (Subp)))
4668 Set_Is_Overriding_Operation (Subp);
4670 -- If style checks are enabled, indicate that the indicator is
4671 -- missing. However, at the point of declaration, the type of
4672 -- which this is a primitive operation may be private, in which
4673 -- case the indicator would be premature.
4675 if Has_Private_Declaration (Etype (Subp))
4676 or else Has_Private_Declaration (Etype (First_Formal (Subp)))
4680 Style.Missing_Overriding (Decl, Subp);
4685 elsif Must_Override (Spec) then
4686 if Ekind (Subp) = E_Entry then
4687 Error_Msg_NE ("entry & is not overriding", Spec, Subp);
4689 Error_Msg_NE ("subprogram & is not overriding", Spec, Subp);
4692 -- If the operation is marked "not overriding" and it's not primitive
4693 -- then an error is issued, unless this is an operation of a task or
4694 -- protected type (RM05-8.3.1(3/2-4/2)). Error cases where "overriding"
4695 -- has been specified have already been checked above.
4697 elsif Must_Not_Override (Spec)
4698 and then not Is_Primitive
4699 and then Ekind (Subp) /= E_Entry
4700 and then Ekind (Scope (Subp)) /= E_Protected_Type
4703 ("overriding indicator only allowed if subprogram is primitive",
4707 end Check_Overriding_Indicator;
4713 -- Note: this procedure needs to know far too much about how the expander
4714 -- messes with exceptions. The use of the flag Exception_Junk and the
4715 -- incorporation of knowledge of Exp_Ch11.Expand_Local_Exception_Handlers
4716 -- works, but is not very clean. It would be better if the expansion
4717 -- routines would leave Original_Node working nicely, and we could use
4718 -- Original_Node here to ignore all the peculiar expander messing ???
4720 procedure Check_Returns
4724 Proc : Entity_Id := Empty)
4728 procedure Check_Statement_Sequence (L : List_Id);
4729 -- Internal recursive procedure to check a list of statements for proper
4730 -- termination by a return statement (or a transfer of control or a
4731 -- compound statement that is itself internally properly terminated).
4733 ------------------------------
4734 -- Check_Statement_Sequence --
4735 ------------------------------
4737 procedure Check_Statement_Sequence (L : List_Id) is
4742 Raise_Exception_Call : Boolean;
4743 -- Set True if statement sequence terminated by Raise_Exception call
4744 -- or a Reraise_Occurrence call.
4747 Raise_Exception_Call := False;
4749 -- Get last real statement
4751 Last_Stm := Last (L);
4753 -- Deal with digging out exception handler statement sequences that
4754 -- have been transformed by the local raise to goto optimization.
4755 -- See Exp_Ch11.Expand_Local_Exception_Handlers for details. If this
4756 -- optimization has occurred, we are looking at something like:
4759 -- original stmts in block
4763 -- goto L1; | omitted if No_Exception_Propagation
4768 -- goto L3; -- skip handler when exception not raised
4770 -- <<L1>> -- target label for local exception
4784 -- and what we have to do is to dig out the estmts1 and estmts2
4785 -- sequences (which were the original sequences of statements in
4786 -- the exception handlers) and check them.
4788 if Nkind (Last_Stm) = N_Label
4789 and then Exception_Junk (Last_Stm)
4795 exit when Nkind (Stm) /= N_Block_Statement;
4796 exit when not Exception_Junk (Stm);
4799 exit when Nkind (Stm) /= N_Label;
4800 exit when not Exception_Junk (Stm);
4801 Check_Statement_Sequence
4802 (Statements (Handled_Statement_Sequence (Next (Stm))));
4807 exit when Nkind (Stm) /= N_Goto_Statement;
4808 exit when not Exception_Junk (Stm);
4812 -- Don't count pragmas
4814 while Nkind (Last_Stm) = N_Pragma
4816 -- Don't count call to SS_Release (can happen after Raise_Exception)
4819 (Nkind (Last_Stm) = N_Procedure_Call_Statement
4821 Nkind (Name (Last_Stm)) = N_Identifier
4823 Is_RTE (Entity (Name (Last_Stm)), RE_SS_Release))
4825 -- Don't count exception junk
4828 (Nkind_In (Last_Stm, N_Goto_Statement,
4830 N_Object_Declaration)
4831 and then Exception_Junk (Last_Stm))
4832 or else Nkind (Last_Stm) in N_Push_xxx_Label
4833 or else Nkind (Last_Stm) in N_Pop_xxx_Label
4838 -- Here we have the "real" last statement
4840 Kind := Nkind (Last_Stm);
4842 -- Transfer of control, OK. Note that in the No_Return procedure
4843 -- case, we already diagnosed any explicit return statements, so
4844 -- we can treat them as OK in this context.
4846 if Is_Transfer (Last_Stm) then
4849 -- Check cases of explicit non-indirect procedure calls
4851 elsif Kind = N_Procedure_Call_Statement
4852 and then Is_Entity_Name (Name (Last_Stm))
4854 -- Check call to Raise_Exception procedure which is treated
4855 -- specially, as is a call to Reraise_Occurrence.
4857 -- We suppress the warning in these cases since it is likely that
4858 -- the programmer really does not expect to deal with the case
4859 -- of Null_Occurrence, and thus would find a warning about a
4860 -- missing return curious, and raising Program_Error does not
4861 -- seem such a bad behavior if this does occur.
4863 -- Note that in the Ada 2005 case for Raise_Exception, the actual
4864 -- behavior will be to raise Constraint_Error (see AI-329).
4866 if Is_RTE (Entity (Name (Last_Stm)), RE_Raise_Exception)
4868 Is_RTE (Entity (Name (Last_Stm)), RE_Reraise_Occurrence)
4870 Raise_Exception_Call := True;
4872 -- For Raise_Exception call, test first argument, if it is
4873 -- an attribute reference for a 'Identity call, then we know
4874 -- that the call cannot possibly return.
4877 Arg : constant Node_Id :=
4878 Original_Node (First_Actual (Last_Stm));
4880 if Nkind (Arg) = N_Attribute_Reference
4881 and then Attribute_Name (Arg) = Name_Identity
4888 -- If statement, need to look inside if there is an else and check
4889 -- each constituent statement sequence for proper termination.
4891 elsif Kind = N_If_Statement
4892 and then Present (Else_Statements (Last_Stm))
4894 Check_Statement_Sequence (Then_Statements (Last_Stm));
4895 Check_Statement_Sequence (Else_Statements (Last_Stm));
4897 if Present (Elsif_Parts (Last_Stm)) then
4899 Elsif_Part : Node_Id := First (Elsif_Parts (Last_Stm));
4902 while Present (Elsif_Part) loop
4903 Check_Statement_Sequence (Then_Statements (Elsif_Part));
4911 -- Case statement, check each case for proper termination
4913 elsif Kind = N_Case_Statement then
4917 Case_Alt := First_Non_Pragma (Alternatives (Last_Stm));
4918 while Present (Case_Alt) loop
4919 Check_Statement_Sequence (Statements (Case_Alt));
4920 Next_Non_Pragma (Case_Alt);
4926 -- Block statement, check its handled sequence of statements
4928 elsif Kind = N_Block_Statement then
4934 (Handled_Statement_Sequence (Last_Stm), Mode, Err1);
4943 -- Loop statement. If there is an iteration scheme, we can definitely
4944 -- fall out of the loop. Similarly if there is an exit statement, we
4945 -- can fall out. In either case we need a following return.
4947 elsif Kind = N_Loop_Statement then
4948 if Present (Iteration_Scheme (Last_Stm))
4949 or else Has_Exit (Entity (Identifier (Last_Stm)))
4953 -- A loop with no exit statement or iteration scheme is either
4954 -- an infinite loop, or it has some other exit (raise/return).
4955 -- In either case, no warning is required.
4961 -- Timed entry call, check entry call and delay alternatives
4963 -- Note: in expanded code, the timed entry call has been converted
4964 -- to a set of expanded statements on which the check will work
4965 -- correctly in any case.
4967 elsif Kind = N_Timed_Entry_Call then
4969 ECA : constant Node_Id := Entry_Call_Alternative (Last_Stm);
4970 DCA : constant Node_Id := Delay_Alternative (Last_Stm);
4973 -- If statement sequence of entry call alternative is missing,
4974 -- then we can definitely fall through, and we post the error
4975 -- message on the entry call alternative itself.
4977 if No (Statements (ECA)) then
4980 -- If statement sequence of delay alternative is missing, then
4981 -- we can definitely fall through, and we post the error
4982 -- message on the delay alternative itself.
4984 -- Note: if both ECA and DCA are missing the return, then we
4985 -- post only one message, should be enough to fix the bugs.
4986 -- If not we will get a message next time on the DCA when the
4989 elsif No (Statements (DCA)) then
4992 -- Else check both statement sequences
4995 Check_Statement_Sequence (Statements (ECA));
4996 Check_Statement_Sequence (Statements (DCA));
5001 -- Conditional entry call, check entry call and else part
5003 -- Note: in expanded code, the conditional entry call has been
5004 -- converted to a set of expanded statements on which the check
5005 -- will work correctly in any case.
5007 elsif Kind = N_Conditional_Entry_Call then
5009 ECA : constant Node_Id := Entry_Call_Alternative (Last_Stm);
5012 -- If statement sequence of entry call alternative is missing,
5013 -- then we can definitely fall through, and we post the error
5014 -- message on the entry call alternative itself.
5016 if No (Statements (ECA)) then
5019 -- Else check statement sequence and else part
5022 Check_Statement_Sequence (Statements (ECA));
5023 Check_Statement_Sequence (Else_Statements (Last_Stm));
5029 -- If we fall through, issue appropriate message
5032 if not Raise_Exception_Call then
5034 ("?RETURN statement missing following this statement!",
5037 ("\?Program_Error may be raised at run time!",
5041 -- Note: we set Err even though we have not issued a warning
5042 -- because we still have a case of a missing return. This is
5043 -- an extremely marginal case, probably will never be noticed
5044 -- but we might as well get it right.
5048 -- Otherwise we have the case of a procedure marked No_Return
5051 if not Raise_Exception_Call then
5053 ("?implied return after this statement " &
5054 "will raise Program_Error",
5057 ("\?procedure & is marked as No_Return!",
5062 RE : constant Node_Id :=
5063 Make_Raise_Program_Error (Sloc (Last_Stm),
5064 Reason => PE_Implicit_Return);
5066 Insert_After (Last_Stm, RE);
5070 end Check_Statement_Sequence;
5072 -- Start of processing for Check_Returns
5076 Check_Statement_Sequence (Statements (HSS));
5078 if Present (Exception_Handlers (HSS)) then
5079 Handler := First_Non_Pragma (Exception_Handlers (HSS));
5080 while Present (Handler) loop
5081 Check_Statement_Sequence (Statements (Handler));
5082 Next_Non_Pragma (Handler);
5087 ----------------------------
5088 -- Check_Subprogram_Order --
5089 ----------------------------
5091 procedure Check_Subprogram_Order (N : Node_Id) is
5093 function Subprogram_Name_Greater (S1, S2 : String) return Boolean;
5094 -- This is used to check if S1 > S2 in the sense required by this
5095 -- test, for example nameab < namec, but name2 < name10.
5097 -----------------------------
5098 -- Subprogram_Name_Greater --
5099 -----------------------------
5101 function Subprogram_Name_Greater (S1, S2 : String) return Boolean is
5106 -- Remove trailing numeric parts
5109 while S1 (L1) in '0' .. '9' loop
5114 while S2 (L2) in '0' .. '9' loop
5118 -- If non-numeric parts non-equal, that's decisive
5120 if S1 (S1'First .. L1) < S2 (S2'First .. L2) then
5123 elsif S1 (S1'First .. L1) > S2 (S2'First .. L2) then
5126 -- If non-numeric parts equal, compare suffixed numeric parts. Note
5127 -- that a missing suffix is treated as numeric zero in this test.
5131 while L1 < S1'Last loop
5133 N1 := N1 * 10 + Character'Pos (S1 (L1)) - Character'Pos ('0');
5137 while L2 < S2'Last loop
5139 N2 := N2 * 10 + Character'Pos (S2 (L2)) - Character'Pos ('0');
5144 end Subprogram_Name_Greater;
5146 -- Start of processing for Check_Subprogram_Order
5149 -- Check body in alpha order if this is option
5152 and then Style_Check_Order_Subprograms
5153 and then Nkind (N) = N_Subprogram_Body
5154 and then Comes_From_Source (N)
5155 and then In_Extended_Main_Source_Unit (N)
5159 renames Scope_Stack.Table
5160 (Scope_Stack.Last).Last_Subprogram_Name;
5162 Body_Id : constant Entity_Id :=
5163 Defining_Entity (Specification (N));
5166 Get_Decoded_Name_String (Chars (Body_Id));
5169 if Subprogram_Name_Greater
5170 (LSN.all, Name_Buffer (1 .. Name_Len))
5172 Style.Subprogram_Not_In_Alpha_Order (Body_Id);
5178 LSN := new String'(Name_Buffer (1 .. Name_Len));
5181 end Check_Subprogram_Order;
5183 ------------------------------
5184 -- Check_Subtype_Conformant --
5185 ------------------------------
5187 procedure Check_Subtype_Conformant
5188 (New_Id : Entity_Id;
5190 Err_Loc : Node_Id := Empty;
5191 Skip_Controlling_Formals : Boolean := False)
5194 pragma Warnings (Off, Result);
5197 (New_Id, Old_Id, Subtype_Conformant, True, Result, Err_Loc,
5198 Skip_Controlling_Formals => Skip_Controlling_Formals);
5199 end Check_Subtype_Conformant;
5201 ---------------------------
5202 -- Check_Type_Conformant --
5203 ---------------------------
5205 procedure Check_Type_Conformant
5206 (New_Id : Entity_Id;
5208 Err_Loc : Node_Id := Empty)
5211 pragma Warnings (Off, Result);
5214 (New_Id, Old_Id, Type_Conformant, True, Result, Err_Loc);
5215 end Check_Type_Conformant;
5217 ----------------------
5218 -- Conforming_Types --
5219 ----------------------
5221 function Conforming_Types
5224 Ctype : Conformance_Type;
5225 Get_Inst : Boolean := False) return Boolean
5227 Type_1 : Entity_Id := T1;
5228 Type_2 : Entity_Id := T2;
5229 Are_Anonymous_Access_To_Subprogram_Types : Boolean := False;
5231 function Base_Types_Match (T1, T2 : Entity_Id) return Boolean;
5232 -- If neither T1 nor T2 are generic actual types, or if they are in
5233 -- different scopes (e.g. parent and child instances), then verify that
5234 -- the base types are equal. Otherwise T1 and T2 must be on the same
5235 -- subtype chain. The whole purpose of this procedure is to prevent
5236 -- spurious ambiguities in an instantiation that may arise if two
5237 -- distinct generic types are instantiated with the same actual.
5239 function Find_Designated_Type (T : Entity_Id) return Entity_Id;
5240 -- An access parameter can designate an incomplete type. If the
5241 -- incomplete type is the limited view of a type from a limited_
5242 -- with_clause, check whether the non-limited view is available. If
5243 -- it is a (non-limited) incomplete type, get the full view.
5245 function Matches_Limited_With_View (T1, T2 : Entity_Id) return Boolean;
5246 -- Returns True if and only if either T1 denotes a limited view of T2
5247 -- or T2 denotes a limited view of T1. This can arise when the limited
5248 -- with view of a type is used in a subprogram declaration and the
5249 -- subprogram body is in the scope of a regular with clause for the
5250 -- same unit. In such a case, the two type entities can be considered
5251 -- identical for purposes of conformance checking.
5253 ----------------------
5254 -- Base_Types_Match --
5255 ----------------------
5257 function Base_Types_Match (T1, T2 : Entity_Id) return Boolean is
5262 elsif Base_Type (T1) = Base_Type (T2) then
5264 -- The following is too permissive. A more precise test should
5265 -- check that the generic actual is an ancestor subtype of the
5268 return not Is_Generic_Actual_Type (T1)
5269 or else not Is_Generic_Actual_Type (T2)
5270 or else Scope (T1) /= Scope (T2);
5275 end Base_Types_Match;
5277 --------------------------
5278 -- Find_Designated_Type --
5279 --------------------------
5281 function Find_Designated_Type (T : Entity_Id) return Entity_Id is
5285 Desig := Directly_Designated_Type (T);
5287 if Ekind (Desig) = E_Incomplete_Type then
5289 -- If regular incomplete type, get full view if available
5291 if Present (Full_View (Desig)) then
5292 Desig := Full_View (Desig);
5294 -- If limited view of a type, get non-limited view if available,
5295 -- and check again for a regular incomplete type.
5297 elsif Present (Non_Limited_View (Desig)) then
5298 Desig := Get_Full_View (Non_Limited_View (Desig));
5303 end Find_Designated_Type;
5305 -------------------------------
5306 -- Matches_Limited_With_View --
5307 -------------------------------
5309 function Matches_Limited_With_View (T1, T2 : Entity_Id) return Boolean is
5311 -- In some cases a type imported through a limited_with clause, and
5312 -- its nonlimited view are both visible, for example in an anonymous
5313 -- access-to-class-wide type in a formal. Both entities designate the
5316 if From_With_Type (T1)
5317 and then T2 = Available_View (T1)
5321 elsif From_With_Type (T2)
5322 and then T1 = Available_View (T2)
5329 end Matches_Limited_With_View;
5331 -- Start of processing for Conforming_Types
5334 -- The context is an instance association for a formal
5335 -- access-to-subprogram type; the formal parameter types require
5336 -- mapping because they may denote other formal parameters of the
5340 Type_1 := Get_Instance_Of (T1);
5341 Type_2 := Get_Instance_Of (T2);
5344 -- If one of the types is a view of the other introduced by a limited
5345 -- with clause, treat these as conforming for all purposes.
5347 if Matches_Limited_With_View (T1, T2) then
5350 elsif Base_Types_Match (Type_1, Type_2) then
5351 return Ctype <= Mode_Conformant
5352 or else Subtypes_Statically_Match (Type_1, Type_2);
5354 elsif Is_Incomplete_Or_Private_Type (Type_1)
5355 and then Present (Full_View (Type_1))
5356 and then Base_Types_Match (Full_View (Type_1), Type_2)
5358 return Ctype <= Mode_Conformant
5359 or else Subtypes_Statically_Match (Full_View (Type_1), Type_2);
5361 elsif Ekind (Type_2) = E_Incomplete_Type
5362 and then Present (Full_View (Type_2))
5363 and then Base_Types_Match (Type_1, Full_View (Type_2))
5365 return Ctype <= Mode_Conformant
5366 or else Subtypes_Statically_Match (Type_1, Full_View (Type_2));
5368 elsif Is_Private_Type (Type_2)
5369 and then In_Instance
5370 and then Present (Full_View (Type_2))
5371 and then Base_Types_Match (Type_1, Full_View (Type_2))
5373 return Ctype <= Mode_Conformant
5374 or else Subtypes_Statically_Match (Type_1, Full_View (Type_2));
5377 -- Ada 2005 (AI-254): Anonymous access-to-subprogram types must be
5378 -- treated recursively because they carry a signature.
5380 Are_Anonymous_Access_To_Subprogram_Types :=
5381 Ekind (Type_1) = Ekind (Type_2)
5383 (Ekind (Type_1) = E_Anonymous_Access_Subprogram_Type
5385 Ekind (Type_1) = E_Anonymous_Access_Protected_Subprogram_Type);
5387 -- Test anonymous access type case. For this case, static subtype
5388 -- matching is required for mode conformance (RM 6.3.1(15)). We check
5389 -- the base types because we may have built internal subtype entities
5390 -- to handle null-excluding types (see Process_Formals).
5392 if (Ekind (Base_Type (Type_1)) = E_Anonymous_Access_Type
5394 Ekind (Base_Type (Type_2)) = E_Anonymous_Access_Type)
5395 or else Are_Anonymous_Access_To_Subprogram_Types -- Ada 2005 (AI-254)
5398 Desig_1 : Entity_Id;
5399 Desig_2 : Entity_Id;
5402 -- In Ada2005, access constant indicators must match for
5403 -- subtype conformance.
5405 if Ada_Version >= Ada_05
5406 and then Ctype >= Subtype_Conformant
5408 Is_Access_Constant (Type_1) /= Is_Access_Constant (Type_2)
5413 Desig_1 := Find_Designated_Type (Type_1);
5415 Desig_2 := Find_Designated_Type (Type_2);
5417 -- If the context is an instance association for a formal
5418 -- access-to-subprogram type; formal access parameter designated
5419 -- types require mapping because they may denote other formal
5420 -- parameters of the generic unit.
5423 Desig_1 := Get_Instance_Of (Desig_1);
5424 Desig_2 := Get_Instance_Of (Desig_2);
5427 -- It is possible for a Class_Wide_Type to be introduced for an
5428 -- incomplete type, in which case there is a separate class_ wide
5429 -- type for the full view. The types conform if their Etypes
5430 -- conform, i.e. one may be the full view of the other. This can
5431 -- only happen in the context of an access parameter, other uses
5432 -- of an incomplete Class_Wide_Type are illegal.
5434 if Is_Class_Wide_Type (Desig_1)
5435 and then Is_Class_Wide_Type (Desig_2)
5439 (Etype (Base_Type (Desig_1)),
5440 Etype (Base_Type (Desig_2)), Ctype);
5442 elsif Are_Anonymous_Access_To_Subprogram_Types then
5443 if Ada_Version < Ada_05 then
5444 return Ctype = Type_Conformant
5446 Subtypes_Statically_Match (Desig_1, Desig_2);
5448 -- We must check the conformance of the signatures themselves
5452 Conformant : Boolean;
5455 (Desig_1, Desig_2, Ctype, False, Conformant);
5461 return Base_Type (Desig_1) = Base_Type (Desig_2)
5462 and then (Ctype = Type_Conformant
5464 Subtypes_Statically_Match (Desig_1, Desig_2));
5468 -- Otherwise definitely no match
5471 if ((Ekind (Type_1) = E_Anonymous_Access_Type
5472 and then Is_Access_Type (Type_2))
5473 or else (Ekind (Type_2) = E_Anonymous_Access_Type
5474 and then Is_Access_Type (Type_1)))
5477 (Designated_Type (Type_1), Designated_Type (Type_2), Ctype)
5479 May_Hide_Profile := True;
5484 end Conforming_Types;
5486 --------------------------
5487 -- Create_Extra_Formals --
5488 --------------------------
5490 procedure Create_Extra_Formals (E : Entity_Id) is
5492 First_Extra : Entity_Id := Empty;
5493 Last_Extra : Entity_Id;
5494 Formal_Type : Entity_Id;
5495 P_Formal : Entity_Id := Empty;
5497 function Add_Extra_Formal
5498 (Assoc_Entity : Entity_Id;
5501 Suffix : String) return Entity_Id;
5502 -- Add an extra formal to the current list of formals and extra formals.
5503 -- The extra formal is added to the end of the list of extra formals,
5504 -- and also returned as the result. These formals are always of mode IN.
5505 -- The new formal has the type Typ, is declared in Scope, and its name
5506 -- is given by a concatenation of the name of Assoc_Entity and Suffix.
5507 -- The following suffixes are currently used. They should not be changed
5508 -- without coordinating with CodePeer, which makes use of these to
5509 -- provide better messages.
5511 -- O denotes the Constrained bit.
5512 -- L denotes the accessibility level.
5513 -- BIP_xxx denotes an extra formal for a build-in-place function. See
5514 -- the full list in exp_ch6.BIP_Formal_Kind.
5516 ----------------------
5517 -- Add_Extra_Formal --
5518 ----------------------
5520 function Add_Extra_Formal
5521 (Assoc_Entity : Entity_Id;
5524 Suffix : String) return Entity_Id
5526 EF : constant Entity_Id :=
5527 Make_Defining_Identifier (Sloc (Assoc_Entity),
5528 Chars => New_External_Name (Chars (Assoc_Entity),
5532 -- A little optimization. Never generate an extra formal for the
5533 -- _init operand of an initialization procedure, since it could
5536 if Chars (Formal) = Name_uInit then
5540 Set_Ekind (EF, E_In_Parameter);
5541 Set_Actual_Subtype (EF, Typ);
5542 Set_Etype (EF, Typ);
5543 Set_Scope (EF, Scope);
5544 Set_Mechanism (EF, Default_Mechanism);
5545 Set_Formal_Validity (EF);
5547 if No (First_Extra) then
5549 Set_Extra_Formals (Scope, First_Extra);
5552 if Present (Last_Extra) then
5553 Set_Extra_Formal (Last_Extra, EF);
5559 end Add_Extra_Formal;
5561 -- Start of processing for Create_Extra_Formals
5564 -- We never generate extra formals if expansion is not active
5565 -- because we don't need them unless we are generating code.
5567 if not Expander_Active then
5571 -- If this is a derived subprogram then the subtypes of the parent
5572 -- subprogram's formal parameters will be used to determine the need
5573 -- for extra formals.
5575 if Is_Overloadable (E) and then Present (Alias (E)) then
5576 P_Formal := First_Formal (Alias (E));
5579 Last_Extra := Empty;
5580 Formal := First_Formal (E);
5581 while Present (Formal) loop
5582 Last_Extra := Formal;
5583 Next_Formal (Formal);
5586 -- If Extra_formals were already created, don't do it again. This
5587 -- situation may arise for subprogram types created as part of
5588 -- dispatching calls (see Expand_Dispatching_Call)
5590 if Present (Last_Extra) and then
5591 Present (Extra_Formal (Last_Extra))
5596 -- If the subprogram is a predefined dispatching subprogram then don't
5597 -- generate any extra constrained or accessibility level formals. In
5598 -- general we suppress these for internal subprograms (by not calling
5599 -- Freeze_Subprogram and Create_Extra_Formals at all), but internally
5600 -- generated stream attributes do get passed through because extra
5601 -- build-in-place formals are needed in some cases (limited 'Input).
5603 if Is_Predefined_Internal_Operation (E) then
5604 goto Test_For_BIP_Extras;
5607 Formal := First_Formal (E);
5608 while Present (Formal) loop
5610 -- Create extra formal for supporting the attribute 'Constrained.
5611 -- The case of a private type view without discriminants also
5612 -- requires the extra formal if the underlying type has defaulted
5615 if Ekind (Formal) /= E_In_Parameter then
5616 if Present (P_Formal) then
5617 Formal_Type := Etype (P_Formal);
5619 Formal_Type := Etype (Formal);
5622 -- Do not produce extra formals for Unchecked_Union parameters.
5623 -- Jump directly to the end of the loop.
5625 if Is_Unchecked_Union (Base_Type (Formal_Type)) then
5626 goto Skip_Extra_Formal_Generation;
5629 if not Has_Discriminants (Formal_Type)
5630 and then Ekind (Formal_Type) in Private_Kind
5631 and then Present (Underlying_Type (Formal_Type))
5633 Formal_Type := Underlying_Type (Formal_Type);
5636 if Has_Discriminants (Formal_Type)
5637 and then not Is_Constrained (Formal_Type)
5638 and then not Is_Indefinite_Subtype (Formal_Type)
5640 Set_Extra_Constrained
5641 (Formal, Add_Extra_Formal (Formal, Standard_Boolean, E, "O"));
5645 -- Create extra formal for supporting accessibility checking. This
5646 -- is done for both anonymous access formals and formals of named
5647 -- access types that are marked as controlling formals. The latter
5648 -- case can occur when Expand_Dispatching_Call creates a subprogram
5649 -- type and substitutes the types of access-to-class-wide actuals
5650 -- for the anonymous access-to-specific-type of controlling formals.
5651 -- Base_Type is applied because in cases where there is a null
5652 -- exclusion the formal may have an access subtype.
5654 -- This is suppressed if we specifically suppress accessibility
5655 -- checks at the package level for either the subprogram, or the
5656 -- package in which it resides. However, we do not suppress it
5657 -- simply if the scope has accessibility checks suppressed, since
5658 -- this could cause trouble when clients are compiled with a
5659 -- different suppression setting. The explicit checks at the
5660 -- package level are safe from this point of view.
5662 if (Ekind (Base_Type (Etype (Formal))) = E_Anonymous_Access_Type
5663 or else (Is_Controlling_Formal (Formal)
5664 and then Is_Access_Type (Base_Type (Etype (Formal)))))
5666 (Explicit_Suppress (E, Accessibility_Check)
5668 Explicit_Suppress (Scope (E), Accessibility_Check))
5671 or else Present (Extra_Accessibility (P_Formal)))
5673 Set_Extra_Accessibility
5674 (Formal, Add_Extra_Formal (Formal, Standard_Natural, E, "L"));
5677 -- This label is required when skipping extra formal generation for
5678 -- Unchecked_Union parameters.
5680 <<Skip_Extra_Formal_Generation>>
5682 if Present (P_Formal) then
5683 Next_Formal (P_Formal);
5686 Next_Formal (Formal);
5689 <<Test_For_BIP_Extras>>
5691 -- Ada 2005 (AI-318-02): In the case of build-in-place functions, add
5692 -- appropriate extra formals. See type Exp_Ch6.BIP_Formal_Kind.
5694 if Ada_Version >= Ada_05 and then Is_Build_In_Place_Function (E) then
5696 Result_Subt : constant Entity_Id := Etype (E);
5698 Discard : Entity_Id;
5699 pragma Warnings (Off, Discard);
5702 -- In the case of functions with unconstrained result subtypes,
5703 -- add a 4-state formal indicating whether the return object is
5704 -- allocated by the caller (1), or should be allocated by the
5705 -- callee on the secondary stack (2), in the global heap (3), or
5706 -- in a user-defined storage pool (4). For the moment we just use
5707 -- Natural for the type of this formal. Note that this formal
5708 -- isn't usually needed in the case where the result subtype is
5709 -- constrained, but it is needed when the function has a tagged
5710 -- result, because generally such functions can be called in a
5711 -- dispatching context and such calls must be handled like calls
5712 -- to a class-wide function.
5714 if not Is_Constrained (Underlying_Type (Result_Subt))
5715 or else Is_Tagged_Type (Underlying_Type (Result_Subt))
5719 (E, Standard_Natural,
5720 E, BIP_Formal_Suffix (BIP_Alloc_Form));
5723 -- For functions whose result type has controlled parts, we have
5724 -- an extra formal of type System.Finalization_Implementation.
5725 -- Finalizable_Ptr_Ptr. That is, we are passing a pointer to a
5726 -- finalization list (which is itself a pointer). This extra
5727 -- formal is then passed along to Move_Final_List in case of
5728 -- successful completion of a return statement. We cannot pass an
5729 -- 'in out' parameter, because we need to update the finalization
5730 -- list during an abort-deferred region, rather than using
5731 -- copy-back after the function returns. This is true even if we
5732 -- are able to get away with having 'in out' parameters, which are
5733 -- normally illegal for functions. This formal is also needed when
5734 -- the function has a tagged result.
5736 if Needs_BIP_Final_List (E) then
5739 (E, RTE (RE_Finalizable_Ptr_Ptr),
5740 E, BIP_Formal_Suffix (BIP_Final_List));
5743 -- If the result type contains tasks, we have two extra formals:
5744 -- the master of the tasks to be created, and the caller's
5745 -- activation chain.
5747 if Has_Task (Result_Subt) then
5750 (E, RTE (RE_Master_Id),
5751 E, BIP_Formal_Suffix (BIP_Master));
5754 (E, RTE (RE_Activation_Chain_Access),
5755 E, BIP_Formal_Suffix (BIP_Activation_Chain));
5758 -- All build-in-place functions get an extra formal that will be
5759 -- passed the address of the return object within the caller.
5762 Formal_Type : constant Entity_Id :=
5764 (E_Anonymous_Access_Type, E,
5765 Scope_Id => Scope (E));
5767 Set_Directly_Designated_Type (Formal_Type, Result_Subt);
5768 Set_Etype (Formal_Type, Formal_Type);
5769 Set_Depends_On_Private
5770 (Formal_Type, Has_Private_Component (Formal_Type));
5771 Set_Is_Public (Formal_Type, Is_Public (Scope (Formal_Type)));
5772 Set_Is_Access_Constant (Formal_Type, False);
5774 -- Ada 2005 (AI-50217): Propagate the attribute that indicates
5775 -- the designated type comes from the limited view (for
5776 -- back-end purposes).
5778 Set_From_With_Type (Formal_Type, From_With_Type (Result_Subt));
5780 Layout_Type (Formal_Type);
5784 (E, Formal_Type, E, BIP_Formal_Suffix (BIP_Object_Access));
5788 end Create_Extra_Formals;
5790 -----------------------------
5791 -- Enter_Overloaded_Entity --
5792 -----------------------------
5794 procedure Enter_Overloaded_Entity (S : Entity_Id) is
5795 E : Entity_Id := Current_Entity_In_Scope (S);
5796 C_E : Entity_Id := Current_Entity (S);
5800 Set_Has_Homonym (E);
5801 Set_Has_Homonym (S);
5804 Set_Is_Immediately_Visible (S);
5805 Set_Scope (S, Current_Scope);
5807 -- Chain new entity if front of homonym in current scope, so that
5808 -- homonyms are contiguous.
5813 while Homonym (C_E) /= E loop
5814 C_E := Homonym (C_E);
5817 Set_Homonym (C_E, S);
5821 Set_Current_Entity (S);
5826 Append_Entity (S, Current_Scope);
5827 Set_Public_Status (S);
5829 if Debug_Flag_E then
5830 Write_Str ("New overloaded entity chain: ");
5831 Write_Name (Chars (S));
5834 while Present (E) loop
5835 Write_Str (" "); Write_Int (Int (E));
5842 -- Generate warning for hiding
5845 and then Comes_From_Source (S)
5846 and then In_Extended_Main_Source_Unit (S)
5853 -- Warn unless genuine overloading
5855 if (not Is_Overloadable (E) or else Subtype_Conformant (E, S))
5856 and then (Is_Immediately_Visible (E)
5858 Is_Potentially_Use_Visible (S))
5860 Error_Msg_Sloc := Sloc (E);
5861 Error_Msg_N ("declaration of & hides one#?", S);
5865 end Enter_Overloaded_Entity;
5867 -----------------------------
5868 -- Check_Untagged_Equality --
5869 -----------------------------
5871 procedure Check_Untagged_Equality (Eq_Op : Entity_Id) is
5872 Typ : constant Entity_Id := Etype (First_Formal (Eq_Op));
5873 Decl : constant Node_Id := Unit_Declaration_Node (Eq_Op);
5877 if Nkind (Decl) = N_Subprogram_Declaration
5878 and then Is_Record_Type (Typ)
5879 and then not Is_Tagged_Type (Typ)
5881 if Is_Frozen (Typ) then
5883 ("equality operator must be declared "
5884 & "before type& is frozen", Eq_Op, Typ);
5886 Obj_Decl := Next (Parent (Typ));
5887 while Present (Obj_Decl)
5888 and then Obj_Decl /= Decl
5890 if Nkind (Obj_Decl) = N_Object_Declaration
5891 and then Etype (Defining_Identifier (Obj_Decl)) = Typ
5893 Error_Msg_NE ("type& is frozen by declaration?",
5896 ("\an equality operator cannot be declared after this "
5897 & "point ('R'M 4.5.2 (9.8)) (Ada 2012))?", Obj_Decl);
5904 elsif not In_Same_List (Parent (Typ), Decl)
5905 and then not Is_Limited_Type (Typ)
5907 Error_Msg_N ("equality operator appears too late", Eq_Op);
5910 end Check_Untagged_Equality;
5912 -----------------------------
5913 -- Find_Corresponding_Spec --
5914 -----------------------------
5916 function Find_Corresponding_Spec
5918 Post_Error : Boolean := True) return Entity_Id
5920 Spec : constant Node_Id := Specification (N);
5921 Designator : constant Entity_Id := Defining_Entity (Spec);
5926 E := Current_Entity (Designator);
5927 while Present (E) loop
5929 -- We are looking for a matching spec. It must have the same scope,
5930 -- and the same name, and either be type conformant, or be the case
5931 -- of a library procedure spec and its body (which belong to one
5932 -- another regardless of whether they are type conformant or not).
5934 if Scope (E) = Current_Scope then
5935 if Current_Scope = Standard_Standard
5936 or else (Ekind (E) = Ekind (Designator)
5937 and then Type_Conformant (E, Designator))
5939 -- Within an instantiation, we know that spec and body are
5940 -- subtype conformant, because they were subtype conformant
5941 -- in the generic. We choose the subtype-conformant entity
5942 -- here as well, to resolve spurious ambiguities in the
5943 -- instance that were not present in the generic (i.e. when
5944 -- two different types are given the same actual). If we are
5945 -- looking for a spec to match a body, full conformance is
5949 Set_Convention (Designator, Convention (E));
5951 if Nkind (N) = N_Subprogram_Body
5952 and then Present (Homonym (E))
5953 and then not Fully_Conformant (E, Designator)
5957 elsif not Subtype_Conformant (E, Designator) then
5962 if not Has_Completion (E) then
5963 if Nkind (N) /= N_Subprogram_Body_Stub then
5964 Set_Corresponding_Spec (N, E);
5967 Set_Has_Completion (E);
5970 elsif Nkind (Parent (N)) = N_Subunit then
5972 -- If this is the proper body of a subunit, the completion
5973 -- flag is set when analyzing the stub.
5977 -- If E is an internal function with a controlling result
5978 -- that was created for an operation inherited by a null
5979 -- extension, it may be overridden by a body without a previous
5980 -- spec (one more reason why these should be shunned). In that
5981 -- case remove the generated body if present, because the
5982 -- current one is the explicit overriding.
5984 elsif Ekind (E) = E_Function
5985 and then Ada_Version >= Ada_05
5986 and then not Comes_From_Source (E)
5987 and then Has_Controlling_Result (E)
5988 and then Is_Null_Extension (Etype (E))
5989 and then Comes_From_Source (Spec)
5991 Set_Has_Completion (E, False);
5994 and then Nkind (Parent (E)) = N_Function_Specification
5997 (Unit_Declaration_Node
5998 (Corresponding_Body (Unit_Declaration_Node (E))));
6002 -- If expansion is disabled, or if the wrapper function has
6003 -- not been generated yet, this a late body overriding an
6004 -- inherited operation, or it is an overriding by some other
6005 -- declaration before the controlling result is frozen. In
6006 -- either case this is a declaration of a new entity.
6012 -- If the body already exists, then this is an error unless
6013 -- the previous declaration is the implicit declaration of a
6014 -- derived subprogram, or this is a spurious overloading in an
6017 elsif No (Alias (E))
6018 and then not Is_Intrinsic_Subprogram (E)
6019 and then not In_Instance
6022 Error_Msg_Sloc := Sloc (E);
6024 if Is_Imported (E) then
6026 ("body not allowed for imported subprogram & declared#",
6029 Error_Msg_NE ("duplicate body for & declared#", N, E);
6033 -- Child units cannot be overloaded, so a conformance mismatch
6034 -- between body and a previous spec is an error.
6036 elsif Is_Child_Unit (E)
6038 Nkind (Unit_Declaration_Node (Designator)) = N_Subprogram_Body
6040 Nkind (Parent (Unit_Declaration_Node (Designator))) =
6045 ("body of child unit does not match previous declaration", N);
6053 -- On exit, we know that no previous declaration of subprogram exists
6056 end Find_Corresponding_Spec;
6058 ----------------------
6059 -- Fully_Conformant --
6060 ----------------------
6062 function Fully_Conformant (New_Id, Old_Id : Entity_Id) return Boolean is
6065 Check_Conformance (New_Id, Old_Id, Fully_Conformant, False, Result);
6067 end Fully_Conformant;
6069 ----------------------------------
6070 -- Fully_Conformant_Expressions --
6071 ----------------------------------
6073 function Fully_Conformant_Expressions
6074 (Given_E1 : Node_Id;
6075 Given_E2 : Node_Id) return Boolean
6077 E1 : constant Node_Id := Original_Node (Given_E1);
6078 E2 : constant Node_Id := Original_Node (Given_E2);
6079 -- We always test conformance on original nodes, since it is possible
6080 -- for analysis and/or expansion to make things look as though they
6081 -- conform when they do not, e.g. by converting 1+2 into 3.
6083 function FCE (Given_E1, Given_E2 : Node_Id) return Boolean
6084 renames Fully_Conformant_Expressions;
6086 function FCL (L1, L2 : List_Id) return Boolean;
6087 -- Compare elements of two lists for conformance. Elements have to
6088 -- be conformant, and actuals inserted as default parameters do not
6089 -- match explicit actuals with the same value.
6091 function FCO (Op_Node, Call_Node : Node_Id) return Boolean;
6092 -- Compare an operator node with a function call
6098 function FCL (L1, L2 : List_Id) return Boolean is
6102 if L1 = No_List then
6108 if L2 = No_List then
6114 -- Compare two lists, skipping rewrite insertions (we want to
6115 -- compare the original trees, not the expanded versions!)
6118 if Is_Rewrite_Insertion (N1) then
6120 elsif Is_Rewrite_Insertion (N2) then
6126 elsif not FCE (N1, N2) then
6139 function FCO (Op_Node, Call_Node : Node_Id) return Boolean is
6140 Actuals : constant List_Id := Parameter_Associations (Call_Node);
6145 or else Entity (Op_Node) /= Entity (Name (Call_Node))
6150 Act := First (Actuals);
6152 if Nkind (Op_Node) in N_Binary_Op then
6153 if not FCE (Left_Opnd (Op_Node), Act) then
6160 return Present (Act)
6161 and then FCE (Right_Opnd (Op_Node), Act)
6162 and then No (Next (Act));
6166 -- Start of processing for Fully_Conformant_Expressions
6169 -- Non-conformant if paren count does not match. Note: if some idiot
6170 -- complains that we don't do this right for more than 3 levels of
6171 -- parentheses, they will be treated with the respect they deserve!
6173 if Paren_Count (E1) /= Paren_Count (E2) then
6176 -- If same entities are referenced, then they are conformant even if
6177 -- they have different forms (RM 8.3.1(19-20)).
6179 elsif Is_Entity_Name (E1) and then Is_Entity_Name (E2) then
6180 if Present (Entity (E1)) then
6181 return Entity (E1) = Entity (E2)
6182 or else (Chars (Entity (E1)) = Chars (Entity (E2))
6183 and then Ekind (Entity (E1)) = E_Discriminant
6184 and then Ekind (Entity (E2)) = E_In_Parameter);
6186 elsif Nkind (E1) = N_Expanded_Name
6187 and then Nkind (E2) = N_Expanded_Name
6188 and then Nkind (Selector_Name (E1)) = N_Character_Literal
6189 and then Nkind (Selector_Name (E2)) = N_Character_Literal
6191 return Chars (Selector_Name (E1)) = Chars (Selector_Name (E2));
6194 -- Identifiers in component associations don't always have
6195 -- entities, but their names must conform.
6197 return Nkind (E1) = N_Identifier
6198 and then Nkind (E2) = N_Identifier
6199 and then Chars (E1) = Chars (E2);
6202 elsif Nkind (E1) = N_Character_Literal
6203 and then Nkind (E2) = N_Expanded_Name
6205 return Nkind (Selector_Name (E2)) = N_Character_Literal
6206 and then Chars (E1) = Chars (Selector_Name (E2));
6208 elsif Nkind (E2) = N_Character_Literal
6209 and then Nkind (E1) = N_Expanded_Name
6211 return Nkind (Selector_Name (E1)) = N_Character_Literal
6212 and then Chars (E2) = Chars (Selector_Name (E1));
6214 elsif Nkind (E1) in N_Op
6215 and then Nkind (E2) = N_Function_Call
6217 return FCO (E1, E2);
6219 elsif Nkind (E2) in N_Op
6220 and then Nkind (E1) = N_Function_Call
6222 return FCO (E2, E1);
6224 -- Otherwise we must have the same syntactic entity
6226 elsif Nkind (E1) /= Nkind (E2) then
6229 -- At this point, we specialize by node type
6236 FCL (Expressions (E1), Expressions (E2))
6238 FCL (Component_Associations (E1),
6239 Component_Associations (E2));
6242 if Nkind (Expression (E1)) = N_Qualified_Expression
6244 Nkind (Expression (E2)) = N_Qualified_Expression
6246 return FCE (Expression (E1), Expression (E2));
6248 -- Check that the subtype marks and any constraints
6253 Indic1 : constant Node_Id := Expression (E1);
6254 Indic2 : constant Node_Id := Expression (E2);
6259 if Nkind (Indic1) /= N_Subtype_Indication then
6261 Nkind (Indic2) /= N_Subtype_Indication
6262 and then Entity (Indic1) = Entity (Indic2);
6264 elsif Nkind (Indic2) /= N_Subtype_Indication then
6266 Nkind (Indic1) /= N_Subtype_Indication
6267 and then Entity (Indic1) = Entity (Indic2);
6270 if Entity (Subtype_Mark (Indic1)) /=
6271 Entity (Subtype_Mark (Indic2))
6276 Elt1 := First (Constraints (Constraint (Indic1)));
6277 Elt2 := First (Constraints (Constraint (Indic2)));
6278 while Present (Elt1) and then Present (Elt2) loop
6279 if not FCE (Elt1, Elt2) then
6292 when N_Attribute_Reference =>
6294 Attribute_Name (E1) = Attribute_Name (E2)
6295 and then FCL (Expressions (E1), Expressions (E2));
6299 Entity (E1) = Entity (E2)
6300 and then FCE (Left_Opnd (E1), Left_Opnd (E2))
6301 and then FCE (Right_Opnd (E1), Right_Opnd (E2));
6303 when N_Short_Circuit | N_Membership_Test =>
6305 FCE (Left_Opnd (E1), Left_Opnd (E2))
6307 FCE (Right_Opnd (E1), Right_Opnd (E2));
6309 when N_Case_Expression =>
6315 if not FCE (Expression (E1), Expression (E2)) then
6319 Alt1 := First (Alternatives (E1));
6320 Alt2 := First (Alternatives (E2));
6322 if Present (Alt1) /= Present (Alt2) then
6324 elsif No (Alt1) then
6328 if not FCE (Expression (Alt1), Expression (Alt2))
6329 or else not FCL (Discrete_Choices (Alt1),
6330 Discrete_Choices (Alt2))
6341 when N_Character_Literal =>
6343 Char_Literal_Value (E1) = Char_Literal_Value (E2);
6345 when N_Component_Association =>
6347 FCL (Choices (E1), Choices (E2))
6349 FCE (Expression (E1), Expression (E2));
6351 when N_Conditional_Expression =>
6353 FCL (Expressions (E1), Expressions (E2));
6355 when N_Explicit_Dereference =>
6357 FCE (Prefix (E1), Prefix (E2));
6359 when N_Extension_Aggregate =>
6361 FCL (Expressions (E1), Expressions (E2))
6362 and then Null_Record_Present (E1) =
6363 Null_Record_Present (E2)
6364 and then FCL (Component_Associations (E1),
6365 Component_Associations (E2));
6367 when N_Function_Call =>
6369 FCE (Name (E1), Name (E2))
6371 FCL (Parameter_Associations (E1),
6372 Parameter_Associations (E2));
6374 when N_Indexed_Component =>
6376 FCE (Prefix (E1), Prefix (E2))
6378 FCL (Expressions (E1), Expressions (E2));
6380 when N_Integer_Literal =>
6381 return (Intval (E1) = Intval (E2));
6386 when N_Operator_Symbol =>
6388 Chars (E1) = Chars (E2);
6390 when N_Others_Choice =>
6393 when N_Parameter_Association =>
6395 Chars (Selector_Name (E1)) = Chars (Selector_Name (E2))
6396 and then FCE (Explicit_Actual_Parameter (E1),
6397 Explicit_Actual_Parameter (E2));
6399 when N_Qualified_Expression =>
6401 FCE (Subtype_Mark (E1), Subtype_Mark (E2))
6403 FCE (Expression (E1), Expression (E2));
6407 FCE (Low_Bound (E1), Low_Bound (E2))
6409 FCE (High_Bound (E1), High_Bound (E2));
6411 when N_Real_Literal =>
6412 return (Realval (E1) = Realval (E2));
6414 when N_Selected_Component =>
6416 FCE (Prefix (E1), Prefix (E2))
6418 FCE (Selector_Name (E1), Selector_Name (E2));
6422 FCE (Prefix (E1), Prefix (E2))
6424 FCE (Discrete_Range (E1), Discrete_Range (E2));
6426 when N_String_Literal =>
6428 S1 : constant String_Id := Strval (E1);
6429 S2 : constant String_Id := Strval (E2);
6430 L1 : constant Nat := String_Length (S1);
6431 L2 : constant Nat := String_Length (S2);
6438 for J in 1 .. L1 loop
6439 if Get_String_Char (S1, J) /=
6440 Get_String_Char (S2, J)
6450 when N_Type_Conversion =>
6452 FCE (Subtype_Mark (E1), Subtype_Mark (E2))
6454 FCE (Expression (E1), Expression (E2));
6458 Entity (E1) = Entity (E2)
6460 FCE (Right_Opnd (E1), Right_Opnd (E2));
6462 when N_Unchecked_Type_Conversion =>
6464 FCE (Subtype_Mark (E1), Subtype_Mark (E2))
6466 FCE (Expression (E1), Expression (E2));
6468 -- All other node types cannot appear in this context. Strictly
6469 -- we should raise a fatal internal error. Instead we just ignore
6470 -- the nodes. This means that if anyone makes a mistake in the
6471 -- expander and mucks an expression tree irretrievably, the
6472 -- result will be a failure to detect a (probably very obscure)
6473 -- case of non-conformance, which is better than bombing on some
6474 -- case where two expressions do in fact conform.
6481 end Fully_Conformant_Expressions;
6483 ----------------------------------------
6484 -- Fully_Conformant_Discrete_Subtypes --
6485 ----------------------------------------
6487 function Fully_Conformant_Discrete_Subtypes
6488 (Given_S1 : Node_Id;
6489 Given_S2 : Node_Id) return Boolean
6491 S1 : constant Node_Id := Original_Node (Given_S1);
6492 S2 : constant Node_Id := Original_Node (Given_S2);
6494 function Conforming_Bounds (B1, B2 : Node_Id) return Boolean;
6495 -- Special-case for a bound given by a discriminant, which in the body
6496 -- is replaced with the discriminal of the enclosing type.
6498 function Conforming_Ranges (R1, R2 : Node_Id) return Boolean;
6499 -- Check both bounds
6501 -----------------------
6502 -- Conforming_Bounds --
6503 -----------------------
6505 function Conforming_Bounds (B1, B2 : Node_Id) return Boolean is
6507 if Is_Entity_Name (B1)
6508 and then Is_Entity_Name (B2)
6509 and then Ekind (Entity (B1)) = E_Discriminant
6511 return Chars (B1) = Chars (B2);
6514 return Fully_Conformant_Expressions (B1, B2);
6516 end Conforming_Bounds;
6518 -----------------------
6519 -- Conforming_Ranges --
6520 -----------------------
6522 function Conforming_Ranges (R1, R2 : Node_Id) return Boolean is
6525 Conforming_Bounds (Low_Bound (R1), Low_Bound (R2))
6527 Conforming_Bounds (High_Bound (R1), High_Bound (R2));
6528 end Conforming_Ranges;
6530 -- Start of processing for Fully_Conformant_Discrete_Subtypes
6533 if Nkind (S1) /= Nkind (S2) then
6536 elsif Is_Entity_Name (S1) then
6537 return Entity (S1) = Entity (S2);
6539 elsif Nkind (S1) = N_Range then
6540 return Conforming_Ranges (S1, S2);
6542 elsif Nkind (S1) = N_Subtype_Indication then
6544 Entity (Subtype_Mark (S1)) = Entity (Subtype_Mark (S2))
6547 (Range_Expression (Constraint (S1)),
6548 Range_Expression (Constraint (S2)));
6552 end Fully_Conformant_Discrete_Subtypes;
6554 --------------------
6555 -- Install_Entity --
6556 --------------------
6558 procedure Install_Entity (E : Entity_Id) is
6559 Prev : constant Entity_Id := Current_Entity (E);
6561 Set_Is_Immediately_Visible (E);
6562 Set_Current_Entity (E);
6563 Set_Homonym (E, Prev);
6566 ---------------------
6567 -- Install_Formals --
6568 ---------------------
6570 procedure Install_Formals (Id : Entity_Id) is
6573 F := First_Formal (Id);
6574 while Present (F) loop
6578 end Install_Formals;
6580 -----------------------------
6581 -- Is_Interface_Conformant --
6582 -----------------------------
6584 function Is_Interface_Conformant
6585 (Tagged_Type : Entity_Id;
6586 Iface_Prim : Entity_Id;
6587 Prim : Entity_Id) return Boolean
6589 Iface : constant Entity_Id := Find_Dispatching_Type (Iface_Prim);
6590 Typ : constant Entity_Id := Find_Dispatching_Type (Prim);
6593 pragma Assert (Is_Subprogram (Iface_Prim)
6594 and then Is_Subprogram (Prim)
6595 and then Is_Dispatching_Operation (Iface_Prim)
6596 and then Is_Dispatching_Operation (Prim));
6598 pragma Assert (Is_Interface (Iface)
6599 or else (Present (Alias (Iface_Prim))
6602 (Find_Dispatching_Type (Ultimate_Alias (Iface_Prim)))));
6604 if Prim = Iface_Prim
6605 or else not Is_Subprogram (Prim)
6606 or else Ekind (Prim) /= Ekind (Iface_Prim)
6607 or else not Is_Dispatching_Operation (Prim)
6608 or else Scope (Prim) /= Scope (Tagged_Type)
6610 or else Base_Type (Typ) /= Tagged_Type
6611 or else not Primitive_Names_Match (Iface_Prim, Prim)
6615 -- Case of a procedure, or a function that does not have a controlling
6616 -- result (I or access I).
6618 elsif Ekind (Iface_Prim) = E_Procedure
6619 or else Etype (Prim) = Etype (Iface_Prim)
6620 or else not Has_Controlling_Result (Prim)
6622 return Type_Conformant
6623 (Iface_Prim, Prim, Skip_Controlling_Formals => True);
6625 -- Case of a function returning an interface, or an access to one.
6626 -- Check that the return types correspond.
6628 elsif Implements_Interface (Typ, Iface) then
6629 if (Ekind (Etype (Prim)) = E_Anonymous_Access_Type)
6631 (Ekind (Etype (Iface_Prim)) = E_Anonymous_Access_Type)
6636 Type_Conformant (Prim, Iface_Prim,
6637 Skip_Controlling_Formals => True);
6643 end Is_Interface_Conformant;
6645 ---------------------------------
6646 -- Is_Non_Overriding_Operation --
6647 ---------------------------------
6649 function Is_Non_Overriding_Operation
6650 (Prev_E : Entity_Id;
6651 New_E : Entity_Id) return Boolean
6655 G_Typ : Entity_Id := Empty;
6657 function Get_Generic_Parent_Type (F_Typ : Entity_Id) return Entity_Id;
6658 -- If F_Type is a derived type associated with a generic actual subtype,
6659 -- then return its Generic_Parent_Type attribute, else return Empty.
6661 function Types_Correspond
6662 (P_Type : Entity_Id;
6663 N_Type : Entity_Id) return Boolean;
6664 -- Returns true if and only if the types (or designated types in the
6665 -- case of anonymous access types) are the same or N_Type is derived
6666 -- directly or indirectly from P_Type.
6668 -----------------------------
6669 -- Get_Generic_Parent_Type --
6670 -----------------------------
6672 function Get_Generic_Parent_Type (F_Typ : Entity_Id) return Entity_Id is
6677 if Is_Derived_Type (F_Typ)
6678 and then Nkind (Parent (F_Typ)) = N_Full_Type_Declaration
6680 -- The tree must be traversed to determine the parent subtype in
6681 -- the generic unit, which unfortunately isn't always available
6682 -- via semantic attributes. ??? (Note: The use of Original_Node
6683 -- is needed for cases where a full derived type has been
6686 Indic := Subtype_Indication
6687 (Type_Definition (Original_Node (Parent (F_Typ))));
6689 if Nkind (Indic) = N_Subtype_Indication then
6690 G_Typ := Entity (Subtype_Mark (Indic));
6692 G_Typ := Entity (Indic);
6695 if Nkind (Parent (G_Typ)) = N_Subtype_Declaration
6696 and then Present (Generic_Parent_Type (Parent (G_Typ)))
6698 return Generic_Parent_Type (Parent (G_Typ));
6703 end Get_Generic_Parent_Type;
6705 ----------------------
6706 -- Types_Correspond --
6707 ----------------------
6709 function Types_Correspond
6710 (P_Type : Entity_Id;
6711 N_Type : Entity_Id) return Boolean
6713 Prev_Type : Entity_Id := Base_Type (P_Type);
6714 New_Type : Entity_Id := Base_Type (N_Type);
6717 if Ekind (Prev_Type) = E_Anonymous_Access_Type then
6718 Prev_Type := Designated_Type (Prev_Type);
6721 if Ekind (New_Type) = E_Anonymous_Access_Type then
6722 New_Type := Designated_Type (New_Type);
6725 if Prev_Type = New_Type then
6728 elsif not Is_Class_Wide_Type (New_Type) then
6729 while Etype (New_Type) /= New_Type loop
6730 New_Type := Etype (New_Type);
6731 if New_Type = Prev_Type then
6737 end Types_Correspond;
6739 -- Start of processing for Is_Non_Overriding_Operation
6742 -- In the case where both operations are implicit derived subprograms
6743 -- then neither overrides the other. This can only occur in certain
6744 -- obscure cases (e.g., derivation from homographs created in a generic
6747 if Present (Alias (Prev_E)) and then Present (Alias (New_E)) then
6750 elsif Ekind (Current_Scope) = E_Package
6751 and then Is_Generic_Instance (Current_Scope)
6752 and then In_Private_Part (Current_Scope)
6753 and then Comes_From_Source (New_E)
6755 -- We examine the formals and result subtype of the inherited
6756 -- operation, to determine whether their type is derived from (the
6757 -- instance of) a generic type.
6759 Formal := First_Formal (Prev_E);
6760 while Present (Formal) loop
6761 F_Typ := Base_Type (Etype (Formal));
6763 if Ekind (F_Typ) = E_Anonymous_Access_Type then
6764 F_Typ := Designated_Type (F_Typ);
6767 G_Typ := Get_Generic_Parent_Type (F_Typ);
6769 Next_Formal (Formal);
6772 if No (G_Typ) and then Ekind (Prev_E) = E_Function then
6773 G_Typ := Get_Generic_Parent_Type (Base_Type (Etype (Prev_E)));
6780 -- If the generic type is a private type, then the original operation
6781 -- was not overriding in the generic, because there was no primitive
6782 -- operation to override.
6784 if Nkind (Parent (G_Typ)) = N_Formal_Type_Declaration
6785 and then Nkind (Formal_Type_Definition (Parent (G_Typ))) =
6786 N_Formal_Private_Type_Definition
6790 -- The generic parent type is the ancestor of a formal derived
6791 -- type declaration. We need to check whether it has a primitive
6792 -- operation that should be overridden by New_E in the generic.
6796 P_Formal : Entity_Id;
6797 N_Formal : Entity_Id;
6801 Prim_Elt : Elmt_Id := First_Elmt (Primitive_Operations (G_Typ));
6804 while Present (Prim_Elt) loop
6805 P_Prim := Node (Prim_Elt);
6807 if Chars (P_Prim) = Chars (New_E)
6808 and then Ekind (P_Prim) = Ekind (New_E)
6810 P_Formal := First_Formal (P_Prim);
6811 N_Formal := First_Formal (New_E);
6812 while Present (P_Formal) and then Present (N_Formal) loop
6813 P_Typ := Etype (P_Formal);
6814 N_Typ := Etype (N_Formal);
6816 if not Types_Correspond (P_Typ, N_Typ) then
6820 Next_Entity (P_Formal);
6821 Next_Entity (N_Formal);
6824 -- Found a matching primitive operation belonging to the
6825 -- formal ancestor type, so the new subprogram is
6829 and then No (N_Formal)
6830 and then (Ekind (New_E) /= E_Function
6833 (Etype (P_Prim), Etype (New_E)))
6839 Next_Elmt (Prim_Elt);
6842 -- If no match found, then the new subprogram does not
6843 -- override in the generic (nor in the instance).
6851 end Is_Non_Overriding_Operation;
6853 ------------------------------
6854 -- Make_Inequality_Operator --
6855 ------------------------------
6857 -- S is the defining identifier of an equality operator. We build a
6858 -- subprogram declaration with the right signature. This operation is
6859 -- intrinsic, because it is always expanded as the negation of the
6860 -- call to the equality function.
6862 procedure Make_Inequality_Operator (S : Entity_Id) is
6863 Loc : constant Source_Ptr := Sloc (S);
6866 Op_Name : Entity_Id;
6868 FF : constant Entity_Id := First_Formal (S);
6869 NF : constant Entity_Id := Next_Formal (FF);
6872 -- Check that equality was properly defined, ignore call if not
6879 A : constant Entity_Id :=
6880 Make_Defining_Identifier (Sloc (FF),
6881 Chars => Chars (FF));
6883 B : constant Entity_Id :=
6884 Make_Defining_Identifier (Sloc (NF),
6885 Chars => Chars (NF));
6888 Op_Name := Make_Defining_Operator_Symbol (Loc, Name_Op_Ne);
6890 Formals := New_List (
6891 Make_Parameter_Specification (Loc,
6892 Defining_Identifier => A,
6894 New_Reference_To (Etype (First_Formal (S)),
6895 Sloc (Etype (First_Formal (S))))),
6897 Make_Parameter_Specification (Loc,
6898 Defining_Identifier => B,
6900 New_Reference_To (Etype (Next_Formal (First_Formal (S))),
6901 Sloc (Etype (Next_Formal (First_Formal (S)))))));
6904 Make_Subprogram_Declaration (Loc,
6906 Make_Function_Specification (Loc,
6907 Defining_Unit_Name => Op_Name,
6908 Parameter_Specifications => Formals,
6909 Result_Definition =>
6910 New_Reference_To (Standard_Boolean, Loc)));
6912 -- Insert inequality right after equality if it is explicit or after
6913 -- the derived type when implicit. These entities are created only
6914 -- for visibility purposes, and eventually replaced in the course of
6915 -- expansion, so they do not need to be attached to the tree and seen
6916 -- by the back-end. Keeping them internal also avoids spurious
6917 -- freezing problems. The declaration is inserted in the tree for
6918 -- analysis, and removed afterwards. If the equality operator comes
6919 -- from an explicit declaration, attach the inequality immediately
6920 -- after. Else the equality is inherited from a derived type
6921 -- declaration, so insert inequality after that declaration.
6923 if No (Alias (S)) then
6924 Insert_After (Unit_Declaration_Node (S), Decl);
6925 elsif Is_List_Member (Parent (S)) then
6926 Insert_After (Parent (S), Decl);
6928 Insert_After (Parent (Etype (First_Formal (S))), Decl);
6931 Mark_Rewrite_Insertion (Decl);
6932 Set_Is_Intrinsic_Subprogram (Op_Name);
6935 Set_Has_Completion (Op_Name);
6936 Set_Corresponding_Equality (Op_Name, S);
6937 Set_Is_Abstract_Subprogram (Op_Name, Is_Abstract_Subprogram (S));
6939 end Make_Inequality_Operator;
6941 ----------------------
6942 -- May_Need_Actuals --
6943 ----------------------
6945 procedure May_Need_Actuals (Fun : Entity_Id) is
6950 F := First_Formal (Fun);
6952 while Present (F) loop
6953 if No (Default_Value (F)) then
6961 Set_Needs_No_Actuals (Fun, B);
6962 end May_Need_Actuals;
6964 ---------------------
6965 -- Mode_Conformant --
6966 ---------------------
6968 function Mode_Conformant (New_Id, Old_Id : Entity_Id) return Boolean is
6971 Check_Conformance (New_Id, Old_Id, Mode_Conformant, False, Result);
6973 end Mode_Conformant;
6975 ---------------------------
6976 -- New_Overloaded_Entity --
6977 ---------------------------
6979 procedure New_Overloaded_Entity
6981 Derived_Type : Entity_Id := Empty)
6983 Overridden_Subp : Entity_Id := Empty;
6984 -- Set if the current scope has an operation that is type-conformant
6985 -- with S, and becomes hidden by S.
6987 Is_Primitive_Subp : Boolean;
6988 -- Set to True if the new subprogram is primitive
6991 -- Entity that S overrides
6993 Prev_Vis : Entity_Id := Empty;
6994 -- Predecessor of E in Homonym chain
6996 procedure Check_For_Primitive_Subprogram
6997 (Is_Primitive : out Boolean;
6998 Is_Overriding : Boolean := False);
6999 -- If the subprogram being analyzed is a primitive operation of the type
7000 -- of a formal or result, set the Has_Primitive_Operations flag on the
7001 -- type, and set Is_Primitive to True (otherwise set to False). Set the
7002 -- corresponding flag on the entity itself for later use.
7004 procedure Check_Synchronized_Overriding
7005 (Def_Id : Entity_Id;
7006 Overridden_Subp : out Entity_Id);
7007 -- First determine if Def_Id is an entry or a subprogram either defined
7008 -- in the scope of a task or protected type, or is a primitive of such
7009 -- a type. Check whether Def_Id overrides a subprogram of an interface
7010 -- implemented by the synchronized type, return the overridden entity
7013 function Is_Private_Declaration (E : Entity_Id) return Boolean;
7014 -- Check that E is declared in the private part of the current package,
7015 -- or in the package body, where it may hide a previous declaration.
7016 -- We can't use In_Private_Part by itself because this flag is also
7017 -- set when freezing entities, so we must examine the place of the
7018 -- declaration in the tree, and recognize wrapper packages as well.
7020 function Is_Overriding_Alias
7022 New_E : Entity_Id) return Boolean;
7023 -- Check whether new subprogram and old subprogram are both inherited
7024 -- from subprograms that have distinct dispatch table entries. This can
7025 -- occur with derivations from instances with accidental homonyms.
7026 -- The function is conservative given that the converse is only true
7027 -- within instances that contain accidental overloadings.
7029 ------------------------------------
7030 -- Check_For_Primitive_Subprogram --
7031 ------------------------------------
7033 procedure Check_For_Primitive_Subprogram
7034 (Is_Primitive : out Boolean;
7035 Is_Overriding : Boolean := False)
7041 function Visible_Part_Type (T : Entity_Id) return Boolean;
7042 -- Returns true if T is declared in the visible part of the current
7043 -- package scope; otherwise returns false. Assumes that T is declared
7046 procedure Check_Private_Overriding (T : Entity_Id);
7047 -- Checks that if a primitive abstract subprogram of a visible
7048 -- abstract type is declared in a private part, then it must override
7049 -- an abstract subprogram declared in the visible part. Also checks
7050 -- that if a primitive function with a controlling result is declared
7051 -- in a private part, then it must override a function declared in
7052 -- the visible part.
7054 ------------------------------
7055 -- Check_Private_Overriding --
7056 ------------------------------
7058 procedure Check_Private_Overriding (T : Entity_Id) is
7060 if Is_Package_Or_Generic_Package (Current_Scope)
7061 and then In_Private_Part (Current_Scope)
7062 and then Visible_Part_Type (T)
7063 and then not In_Instance
7065 if Is_Abstract_Type (T)
7066 and then Is_Abstract_Subprogram (S)
7067 and then (not Is_Overriding
7068 or else not Is_Abstract_Subprogram (E))
7071 ("abstract subprograms must be visible "
7072 & "(RM 3.9.3(10))!", S);
7074 elsif Ekind (S) = E_Function
7075 and then not Is_Overriding
7077 if Is_Tagged_Type (T)
7078 and then T = Base_Type (Etype (S))
7081 ("private function with tagged result must"
7082 & " override visible-part function", S);
7084 ("\move subprogram to the visible part"
7085 & " (RM 3.9.3(10))", S);
7087 -- AI05-0073: extend this test to the case of a function
7088 -- with a controlling access result.
7090 elsif Ekind (Etype (S)) = E_Anonymous_Access_Type
7091 and then Is_Tagged_Type (Designated_Type (Etype (S)))
7093 not Is_Class_Wide_Type (Designated_Type (Etype (S)))
7094 and then Ada_Version >= Ada_12
7097 ("private function with controlling access result "
7098 & "must override visible-part function", S);
7100 ("\move subprogram to the visible part"
7101 & " (RM 3.9.3(10))", S);
7105 end Check_Private_Overriding;
7107 -----------------------
7108 -- Visible_Part_Type --
7109 -----------------------
7111 function Visible_Part_Type (T : Entity_Id) return Boolean is
7112 P : constant Node_Id := Unit_Declaration_Node (Scope (T));
7116 -- If the entity is a private type, then it must be declared in a
7119 if Ekind (T) in Private_Kind then
7123 -- Otherwise, we traverse the visible part looking for its
7124 -- corresponding declaration. We cannot use the declaration
7125 -- node directly because in the private part the entity of a
7126 -- private type is the one in the full view, which does not
7127 -- indicate that it is the completion of something visible.
7129 N := First (Visible_Declarations (Specification (P)));
7130 while Present (N) loop
7131 if Nkind (N) = N_Full_Type_Declaration
7132 and then Present (Defining_Identifier (N))
7133 and then T = Defining_Identifier (N)
7137 elsif Nkind_In (N, N_Private_Type_Declaration,
7138 N_Private_Extension_Declaration)
7139 and then Present (Defining_Identifier (N))
7140 and then T = Full_View (Defining_Identifier (N))
7149 end Visible_Part_Type;
7151 -- Start of processing for Check_For_Primitive_Subprogram
7154 Is_Primitive := False;
7156 if not Comes_From_Source (S) then
7159 -- If subprogram is at library level, it is not primitive operation
7161 elsif Current_Scope = Standard_Standard then
7164 elsif (Is_Package_Or_Generic_Package (Current_Scope)
7165 and then not In_Package_Body (Current_Scope))
7166 or else Is_Overriding
7168 -- For function, check return type
7170 if Ekind (S) = E_Function then
7171 if Ekind (Etype (S)) = E_Anonymous_Access_Type then
7172 F_Typ := Designated_Type (Etype (S));
7177 B_Typ := Base_Type (F_Typ);
7179 if Scope (B_Typ) = Current_Scope
7180 and then not Is_Class_Wide_Type (B_Typ)
7181 and then not Is_Generic_Type (B_Typ)
7183 Is_Primitive := True;
7184 Set_Has_Primitive_Operations (B_Typ);
7185 Set_Is_Primitive (S);
7186 Check_Private_Overriding (B_Typ);
7190 -- For all subprograms, check formals
7192 Formal := First_Formal (S);
7193 while Present (Formal) loop
7194 if Ekind (Etype (Formal)) = E_Anonymous_Access_Type then
7195 F_Typ := Designated_Type (Etype (Formal));
7197 F_Typ := Etype (Formal);
7200 B_Typ := Base_Type (F_Typ);
7202 if Ekind (B_Typ) = E_Access_Subtype then
7203 B_Typ := Base_Type (B_Typ);
7206 if Scope (B_Typ) = Current_Scope
7207 and then not Is_Class_Wide_Type (B_Typ)
7208 and then not Is_Generic_Type (B_Typ)
7210 Is_Primitive := True;
7211 Set_Is_Primitive (S);
7212 Set_Has_Primitive_Operations (B_Typ);
7213 Check_Private_Overriding (B_Typ);
7216 Next_Formal (Formal);
7219 end Check_For_Primitive_Subprogram;
7221 -----------------------------------
7222 -- Check_Synchronized_Overriding --
7223 -----------------------------------
7225 procedure Check_Synchronized_Overriding
7226 (Def_Id : Entity_Id;
7227 Overridden_Subp : out Entity_Id)
7229 Ifaces_List : Elist_Id;
7233 function Matches_Prefixed_View_Profile
7234 (Prim_Params : List_Id;
7235 Iface_Params : List_Id) return Boolean;
7236 -- Determine whether a subprogram's parameter profile Prim_Params
7237 -- matches that of a potentially overridden interface subprogram
7238 -- Iface_Params. Also determine if the type of first parameter of
7239 -- Iface_Params is an implemented interface.
7241 -----------------------------------
7242 -- Matches_Prefixed_View_Profile --
7243 -----------------------------------
7245 function Matches_Prefixed_View_Profile
7246 (Prim_Params : List_Id;
7247 Iface_Params : List_Id) return Boolean
7249 Iface_Id : Entity_Id;
7250 Iface_Param : Node_Id;
7251 Iface_Typ : Entity_Id;
7252 Prim_Id : Entity_Id;
7253 Prim_Param : Node_Id;
7254 Prim_Typ : Entity_Id;
7256 function Is_Implemented
7257 (Ifaces_List : Elist_Id;
7258 Iface : Entity_Id) return Boolean;
7259 -- Determine if Iface is implemented by the current task or
7262 --------------------
7263 -- Is_Implemented --
7264 --------------------
7266 function Is_Implemented
7267 (Ifaces_List : Elist_Id;
7268 Iface : Entity_Id) return Boolean
7270 Iface_Elmt : Elmt_Id;
7273 Iface_Elmt := First_Elmt (Ifaces_List);
7274 while Present (Iface_Elmt) loop
7275 if Node (Iface_Elmt) = Iface then
7279 Next_Elmt (Iface_Elmt);
7285 -- Start of processing for Matches_Prefixed_View_Profile
7288 Iface_Param := First (Iface_Params);
7289 Iface_Typ := Etype (Defining_Identifier (Iface_Param));
7291 if Is_Access_Type (Iface_Typ) then
7292 Iface_Typ := Designated_Type (Iface_Typ);
7295 Prim_Param := First (Prim_Params);
7297 -- The first parameter of the potentially overridden subprogram
7298 -- must be an interface implemented by Prim.
7300 if not Is_Interface (Iface_Typ)
7301 or else not Is_Implemented (Ifaces_List, Iface_Typ)
7306 -- The checks on the object parameters are done, move onto the
7307 -- rest of the parameters.
7309 if not In_Scope then
7310 Prim_Param := Next (Prim_Param);
7313 Iface_Param := Next (Iface_Param);
7314 while Present (Iface_Param) and then Present (Prim_Param) loop
7315 Iface_Id := Defining_Identifier (Iface_Param);
7316 Iface_Typ := Find_Parameter_Type (Iface_Param);
7318 Prim_Id := Defining_Identifier (Prim_Param);
7319 Prim_Typ := Find_Parameter_Type (Prim_Param);
7321 if Ekind (Iface_Typ) = E_Anonymous_Access_Type
7322 and then Ekind (Prim_Typ) = E_Anonymous_Access_Type
7323 and then Is_Concurrent_Type (Designated_Type (Prim_Typ))
7325 Iface_Typ := Designated_Type (Iface_Typ);
7326 Prim_Typ := Designated_Type (Prim_Typ);
7329 -- Case of multiple interface types inside a parameter profile
7331 -- (Obj_Param : in out Iface; ...; Param : Iface)
7333 -- If the interface type is implemented, then the matching type
7334 -- in the primitive should be the implementing record type.
7336 if Ekind (Iface_Typ) = E_Record_Type
7337 and then Is_Interface (Iface_Typ)
7338 and then Is_Implemented (Ifaces_List, Iface_Typ)
7340 if Prim_Typ /= Typ then
7344 -- The two parameters must be both mode and subtype conformant
7346 elsif Ekind (Iface_Id) /= Ekind (Prim_Id)
7348 Conforming_Types (Iface_Typ, Prim_Typ, Subtype_Conformant)
7357 -- One of the two lists contains more parameters than the other
7359 if Present (Iface_Param) or else Present (Prim_Param) then
7364 end Matches_Prefixed_View_Profile;
7366 -- Start of processing for Check_Synchronized_Overriding
7369 Overridden_Subp := Empty;
7371 -- Def_Id must be an entry or a subprogram. We should skip predefined
7372 -- primitives internally generated by the frontend; however at this
7373 -- stage predefined primitives are still not fully decorated. As a
7374 -- minor optimization we skip here internally generated subprograms.
7376 if (Ekind (Def_Id) /= E_Entry
7377 and then Ekind (Def_Id) /= E_Function
7378 and then Ekind (Def_Id) /= E_Procedure)
7379 or else not Comes_From_Source (Def_Id)
7384 -- Search for the concurrent declaration since it contains the list
7385 -- of all implemented interfaces. In this case, the subprogram is
7386 -- declared within the scope of a protected or a task type.
7388 if Present (Scope (Def_Id))
7389 and then Is_Concurrent_Type (Scope (Def_Id))
7390 and then not Is_Generic_Actual_Type (Scope (Def_Id))
7392 Typ := Scope (Def_Id);
7395 -- The enclosing scope is not a synchronized type and the subprogram
7398 elsif No (First_Formal (Def_Id)) then
7401 -- The subprogram has formals and hence it may be a primitive of a
7405 Typ := Etype (First_Formal (Def_Id));
7407 if Is_Access_Type (Typ) then
7408 Typ := Directly_Designated_Type (Typ);
7411 if Is_Concurrent_Type (Typ)
7412 and then not Is_Generic_Actual_Type (Typ)
7416 -- This case occurs when the concurrent type is declared within
7417 -- a generic unit. As a result the corresponding record has been
7418 -- built and used as the type of the first formal, we just have
7419 -- to retrieve the corresponding concurrent type.
7421 elsif Is_Concurrent_Record_Type (Typ)
7422 and then Present (Corresponding_Concurrent_Type (Typ))
7424 Typ := Corresponding_Concurrent_Type (Typ);
7432 -- There is no overriding to check if is an inherited operation in a
7433 -- type derivation on for a generic actual.
7435 Collect_Interfaces (Typ, Ifaces_List);
7437 if Is_Empty_Elmt_List (Ifaces_List) then
7441 -- Determine whether entry or subprogram Def_Id overrides a primitive
7442 -- operation that belongs to one of the interfaces in Ifaces_List.
7445 Candidate : Entity_Id := Empty;
7446 Hom : Entity_Id := Empty;
7447 Iface_Typ : Entity_Id;
7448 Subp : Entity_Id := Empty;
7451 -- Traverse the homonym chain, looking at a potentially
7452 -- overridden subprogram that belongs to an implemented
7455 Hom := Current_Entity_In_Scope (Def_Id);
7456 while Present (Hom) loop
7460 or else not Is_Overloadable (Subp)
7461 or else not Is_Primitive (Subp)
7462 or else not Is_Dispatching_Operation (Subp)
7463 or else not Present (Find_Dispatching_Type (Subp))
7464 or else not Is_Interface (Find_Dispatching_Type (Subp))
7468 -- Entries and procedures can override abstract or null
7469 -- interface procedures
7471 elsif (Ekind (Def_Id) = E_Procedure
7472 or else Ekind (Def_Id) = E_Entry)
7473 and then Ekind (Subp) = E_Procedure
7474 and then Matches_Prefixed_View_Profile
7475 (Parameter_Specifications (Parent (Def_Id)),
7476 Parameter_Specifications (Parent (Subp)))
7480 -- For an overridden subprogram Subp, check whether the mode
7481 -- of its first parameter is correct depending on the kind
7482 -- of synchronized type.
7485 Formal : constant Node_Id := First_Formal (Candidate);
7488 -- In order for an entry or a protected procedure to
7489 -- override, the first parameter of the overridden
7490 -- routine must be of mode "out", "in out" or
7491 -- access-to-variable.
7493 if (Ekind (Candidate) = E_Entry
7494 or else Ekind (Candidate) = E_Procedure)
7495 and then Is_Protected_Type (Typ)
7496 and then Ekind (Formal) /= E_In_Out_Parameter
7497 and then Ekind (Formal) /= E_Out_Parameter
7498 and then Nkind (Parameter_Type (Parent (Formal)))
7499 /= N_Access_Definition
7503 -- All other cases are OK since a task entry or routine
7504 -- does not have a restriction on the mode of the first
7505 -- parameter of the overridden interface routine.
7508 Overridden_Subp := Candidate;
7513 -- Functions can override abstract interface functions
7515 elsif Ekind (Def_Id) = E_Function
7516 and then Ekind (Subp) = E_Function
7517 and then Matches_Prefixed_View_Profile
7518 (Parameter_Specifications (Parent (Def_Id)),
7519 Parameter_Specifications (Parent (Subp)))
7520 and then Etype (Result_Definition (Parent (Def_Id))) =
7521 Etype (Result_Definition (Parent (Subp)))
7523 Overridden_Subp := Subp;
7527 Hom := Homonym (Hom);
7530 -- After examining all candidates for overriding, we are
7531 -- left with the best match which is a mode incompatible
7532 -- interface routine. Do not emit an error if the Expander
7533 -- is active since this error will be detected later on
7534 -- after all concurrent types are expanded and all wrappers
7535 -- are built. This check is meant for spec-only
7538 if Present (Candidate)
7539 and then not Expander_Active
7542 Find_Parameter_Type (Parent (First_Formal (Candidate)));
7544 -- Def_Id is primitive of a protected type, declared
7545 -- inside the type, and the candidate is primitive of a
7546 -- limited or synchronized interface.
7549 and then Is_Protected_Type (Typ)
7551 (Is_Limited_Interface (Iface_Typ)
7552 or else Is_Protected_Interface (Iface_Typ)
7553 or else Is_Synchronized_Interface (Iface_Typ)
7554 or else Is_Task_Interface (Iface_Typ))
7556 -- Must reword this message, comma before to in -gnatj
7560 ("first formal of & must be of mode `OUT`, `IN OUT`"
7561 & " or access-to-variable", Typ, Candidate);
7563 ("\to be overridden by protected procedure or entry "
7564 & "(RM 9.4(11.9/2))", Typ);
7568 Overridden_Subp := Candidate;
7571 end Check_Synchronized_Overriding;
7573 ----------------------------
7574 -- Is_Private_Declaration --
7575 ----------------------------
7577 function Is_Private_Declaration (E : Entity_Id) return Boolean is
7578 Priv_Decls : List_Id;
7579 Decl : constant Node_Id := Unit_Declaration_Node (E);
7582 if Is_Package_Or_Generic_Package (Current_Scope)
7583 and then In_Private_Part (Current_Scope)
7586 Private_Declarations (
7587 Specification (Unit_Declaration_Node (Current_Scope)));
7589 return In_Package_Body (Current_Scope)
7591 (Is_List_Member (Decl)
7592 and then List_Containing (Decl) = Priv_Decls)
7593 or else (Nkind (Parent (Decl)) = N_Package_Specification
7596 (Defining_Entity (Parent (Decl)))
7597 and then List_Containing (Parent (Parent (Decl)))
7602 end Is_Private_Declaration;
7604 --------------------------
7605 -- Is_Overriding_Alias --
7606 --------------------------
7608 function Is_Overriding_Alias
7610 New_E : Entity_Id) return Boolean
7612 AO : constant Entity_Id := Alias (Old_E);
7613 AN : constant Entity_Id := Alias (New_E);
7616 return Scope (AO) /= Scope (AN)
7617 or else No (DTC_Entity (AO))
7618 or else No (DTC_Entity (AN))
7619 or else DT_Position (AO) = DT_Position (AN);
7620 end Is_Overriding_Alias;
7622 -- Start of processing for New_Overloaded_Entity
7625 -- We need to look for an entity that S may override. This must be a
7626 -- homonym in the current scope, so we look for the first homonym of
7627 -- S in the current scope as the starting point for the search.
7629 E := Current_Entity_In_Scope (S);
7631 -- Ada 2005 (AI-251): Derivation of abstract interface primitives.
7632 -- They are directly added to the list of primitive operations of
7633 -- Derived_Type, unless this is a rederivation in the private part
7634 -- of an operation that was already derived in the visible part of
7635 -- the current package.
7637 if Ada_Version >= Ada_05
7638 and then Present (Derived_Type)
7639 and then Present (Alias (S))
7640 and then Is_Dispatching_Operation (Alias (S))
7641 and then Present (Find_Dispatching_Type (Alias (S)))
7642 and then Is_Interface (Find_Dispatching_Type (Alias (S)))
7644 -- For private types, when the full-view is processed we propagate to
7645 -- the full view the non-overridden entities whose attribute "alias"
7646 -- references an interface primitive. These entities were added by
7647 -- Derive_Subprograms to ensure that interface primitives are
7650 -- Inside_Freeze_Actions is non zero when S corresponds with an
7651 -- internal entity that links an interface primitive with its
7652 -- covering primitive through attribute Interface_Alias (see
7653 -- Add_Internal_Interface_Entities)
7655 if Inside_Freezing_Actions = 0
7656 and then Is_Package_Or_Generic_Package (Current_Scope)
7657 and then In_Private_Part (Current_Scope)
7658 and then Nkind (Parent (E)) = N_Private_Extension_Declaration
7659 and then Nkind (Parent (S)) = N_Full_Type_Declaration
7660 and then Full_View (Defining_Identifier (Parent (E)))
7661 = Defining_Identifier (Parent (S))
7662 and then Alias (E) = Alias (S)
7664 Check_Operation_From_Private_View (S, E);
7665 Set_Is_Dispatching_Operation (S);
7670 Enter_Overloaded_Entity (S);
7671 Check_Dispatching_Operation (S, Empty);
7672 Check_For_Primitive_Subprogram (Is_Primitive_Subp);
7678 -- If there is no homonym then this is definitely not overriding
7681 Enter_Overloaded_Entity (S);
7682 Check_Dispatching_Operation (S, Empty);
7683 Check_For_Primitive_Subprogram (Is_Primitive_Subp);
7685 -- If subprogram has an explicit declaration, check whether it
7686 -- has an overriding indicator.
7688 if Comes_From_Source (S) then
7689 Check_Synchronized_Overriding (S, Overridden_Subp);
7690 Check_Overriding_Indicator
7691 (S, Overridden_Subp, Is_Primitive => Is_Primitive_Subp);
7694 -- If there is a homonym that is not overloadable, then we have an
7695 -- error, except for the special cases checked explicitly below.
7697 elsif not Is_Overloadable (E) then
7699 -- Check for spurious conflict produced by a subprogram that has the
7700 -- same name as that of the enclosing generic package. The conflict
7701 -- occurs within an instance, between the subprogram and the renaming
7702 -- declaration for the package. After the subprogram, the package
7703 -- renaming declaration becomes hidden.
7705 if Ekind (E) = E_Package
7706 and then Present (Renamed_Object (E))
7707 and then Renamed_Object (E) = Current_Scope
7708 and then Nkind (Parent (Renamed_Object (E))) =
7709 N_Package_Specification
7710 and then Present (Generic_Parent (Parent (Renamed_Object (E))))
7713 Set_Is_Immediately_Visible (E, False);
7714 Enter_Overloaded_Entity (S);
7715 Set_Homonym (S, Homonym (E));
7716 Check_Dispatching_Operation (S, Empty);
7717 Check_Overriding_Indicator (S, Empty, Is_Primitive => False);
7719 -- If the subprogram is implicit it is hidden by the previous
7720 -- declaration. However if it is dispatching, it must appear in the
7721 -- dispatch table anyway, because it can be dispatched to even if it
7722 -- cannot be called directly.
7724 elsif Present (Alias (S))
7725 and then not Comes_From_Source (S)
7727 Set_Scope (S, Current_Scope);
7729 if Is_Dispatching_Operation (Alias (S)) then
7730 Check_Dispatching_Operation (S, Empty);
7736 Error_Msg_Sloc := Sloc (E);
7738 -- Generate message, with useful additional warning if in generic
7740 if Is_Generic_Unit (E) then
7741 Error_Msg_N ("previous generic unit cannot be overloaded", S);
7742 Error_Msg_N ("\& conflicts with declaration#", S);
7744 Error_Msg_N ("& conflicts with declaration#", S);
7750 -- E exists and is overloadable
7753 Check_Synchronized_Overriding (S, Overridden_Subp);
7755 -- Loop through E and its homonyms to determine if any of them is
7756 -- the candidate for overriding by S.
7758 while Present (E) loop
7760 -- Definitely not interesting if not in the current scope
7762 if Scope (E) /= Current_Scope then
7765 -- Check if we have type conformance
7767 elsif Type_Conformant (E, S) then
7769 -- If the old and new entities have the same profile and one
7770 -- is not the body of the other, then this is an error, unless
7771 -- one of them is implicitly declared.
7773 -- There are some cases when both can be implicit, for example
7774 -- when both a literal and a function that overrides it are
7775 -- inherited in a derivation, or when an inherited operation
7776 -- of a tagged full type overrides the inherited operation of
7777 -- a private extension. Ada 83 had a special rule for the
7778 -- literal case. In Ada95, the later implicit operation hides
7779 -- the former, and the literal is always the former. In the
7780 -- odd case where both are derived operations declared at the
7781 -- same point, both operations should be declared, and in that
7782 -- case we bypass the following test and proceed to the next
7783 -- part. This can only occur for certain obscure cases in
7784 -- instances, when an operation on a type derived from a formal
7785 -- private type does not override a homograph inherited from
7786 -- the actual. In subsequent derivations of such a type, the
7787 -- DT positions of these operations remain distinct, if they
7790 if Present (Alias (S))
7791 and then (No (Alias (E))
7792 or else Comes_From_Source (E)
7793 or else Is_Abstract_Subprogram (S)
7795 (Is_Dispatching_Operation (E)
7796 and then Is_Overriding_Alias (E, S)))
7797 and then Ekind (E) /= E_Enumeration_Literal
7799 -- When an derived operation is overloaded it may be due to
7800 -- the fact that the full view of a private extension
7801 -- re-inherits. It has to be dealt with.
7803 if Is_Package_Or_Generic_Package (Current_Scope)
7804 and then In_Private_Part (Current_Scope)
7806 Check_Operation_From_Private_View (S, E);
7809 -- In any case the implicit operation remains hidden by
7810 -- the existing declaration, which is overriding.
7812 Set_Is_Overriding_Operation (E);
7814 if Comes_From_Source (E) then
7815 Check_Overriding_Indicator (E, S, Is_Primitive => False);
7817 -- Indicate that E overrides the operation from which
7820 if Present (Alias (S)) then
7821 Set_Overridden_Operation (E, Alias (S));
7823 Set_Overridden_Operation (E, S);
7829 -- Within an instance, the renaming declarations for actual
7830 -- subprograms may become ambiguous, but they do not hide each
7833 elsif Ekind (E) /= E_Entry
7834 and then not Comes_From_Source (E)
7835 and then not Is_Generic_Instance (E)
7836 and then (Present (Alias (E))
7837 or else Is_Intrinsic_Subprogram (E))
7838 and then (not In_Instance
7839 or else No (Parent (E))
7840 or else Nkind (Unit_Declaration_Node (E)) /=
7841 N_Subprogram_Renaming_Declaration)
7843 -- A subprogram child unit is not allowed to override an
7844 -- inherited subprogram (10.1.1(20)).
7846 if Is_Child_Unit (S) then
7848 ("child unit overrides inherited subprogram in parent",
7853 if Is_Non_Overriding_Operation (E, S) then
7854 Enter_Overloaded_Entity (S);
7856 if No (Derived_Type)
7857 or else Is_Tagged_Type (Derived_Type)
7859 Check_Dispatching_Operation (S, Empty);
7865 -- E is a derived operation or an internal operator which
7866 -- is being overridden. Remove E from further visibility.
7867 -- Furthermore, if E is a dispatching operation, it must be
7868 -- replaced in the list of primitive operations of its type
7869 -- (see Override_Dispatching_Operation).
7871 Overridden_Subp := E;
7877 Prev := First_Entity (Current_Scope);
7878 while Present (Prev)
7879 and then Next_Entity (Prev) /= E
7884 -- It is possible for E to be in the current scope and
7885 -- yet not in the entity chain. This can only occur in a
7886 -- generic context where E is an implicit concatenation
7887 -- in the formal part, because in a generic body the
7888 -- entity chain starts with the formals.
7891 (Present (Prev) or else Chars (E) = Name_Op_Concat);
7893 -- E must be removed both from the entity_list of the
7894 -- current scope, and from the visibility chain
7896 if Debug_Flag_E then
7897 Write_Str ("Override implicit operation ");
7898 Write_Int (Int (E));
7902 -- If E is a predefined concatenation, it stands for four
7903 -- different operations. As a result, a single explicit
7904 -- declaration does not hide it. In a possible ambiguous
7905 -- situation, Disambiguate chooses the user-defined op,
7906 -- so it is correct to retain the previous internal one.
7908 if Chars (E) /= Name_Op_Concat
7909 or else Ekind (E) /= E_Operator
7911 -- For nondispatching derived operations that are
7912 -- overridden by a subprogram declared in the private
7913 -- part of a package, we retain the derived subprogram
7914 -- but mark it as not immediately visible. If the
7915 -- derived operation was declared in the visible part
7916 -- then this ensures that it will still be visible
7917 -- outside the package with the proper signature
7918 -- (calls from outside must also be directed to this
7919 -- version rather than the overriding one, unlike the
7920 -- dispatching case). Calls from inside the package
7921 -- will still resolve to the overriding subprogram
7922 -- since the derived one is marked as not visible
7923 -- within the package.
7925 -- If the private operation is dispatching, we achieve
7926 -- the overriding by keeping the implicit operation
7927 -- but setting its alias to be the overriding one. In
7928 -- this fashion the proper body is executed in all
7929 -- cases, but the original signature is used outside
7932 -- If the overriding is not in the private part, we
7933 -- remove the implicit operation altogether.
7935 if Is_Private_Declaration (S) then
7936 if not Is_Dispatching_Operation (E) then
7937 Set_Is_Immediately_Visible (E, False);
7939 -- Work done in Override_Dispatching_Operation,
7940 -- so nothing else need to be done here.
7946 -- Find predecessor of E in Homonym chain
7948 if E = Current_Entity (E) then
7951 Prev_Vis := Current_Entity (E);
7952 while Homonym (Prev_Vis) /= E loop
7953 Prev_Vis := Homonym (Prev_Vis);
7957 if Prev_Vis /= Empty then
7959 -- Skip E in the visibility chain
7961 Set_Homonym (Prev_Vis, Homonym (E));
7964 Set_Name_Entity_Id (Chars (E), Homonym (E));
7967 Set_Next_Entity (Prev, Next_Entity (E));
7969 if No (Next_Entity (Prev)) then
7970 Set_Last_Entity (Current_Scope, Prev);
7976 Enter_Overloaded_Entity (S);
7977 Set_Is_Overriding_Operation (S);
7978 Check_Overriding_Indicator (S, E, Is_Primitive => True);
7980 -- If S is a user-defined subprogram or a null procedure
7981 -- expanded to override an inherited null procedure, then
7982 -- indicate that E overrides the operation from which S
7983 -- is inherited. It seems odd that Overridden_Operation
7984 -- isn't set in all cases where Is_Overriding_Operation
7985 -- is true, but doing so causes infinite loops in the
7986 -- compiler for implicit overriding subprograms. ???
7988 if Comes_From_Source (S)
7990 (Present (Parent (S))
7992 Nkind (Parent (S)) = N_Procedure_Specification
7994 Null_Present (Parent (S)))
7996 if Present (Alias (E)) then
7997 Set_Overridden_Operation (S, Alias (E));
7999 Set_Overridden_Operation (S, E);
8003 if Is_Dispatching_Operation (E) then
8005 -- An overriding dispatching subprogram inherits the
8006 -- convention of the overridden subprogram (by
8009 Set_Convention (S, Convention (E));
8010 Check_Dispatching_Operation (S, E);
8013 Check_Dispatching_Operation (S, Empty);
8016 Check_For_Primitive_Subprogram
8017 (Is_Primitive_Subp, Is_Overriding => True);
8018 goto Check_Inequality;
8021 -- Apparent redeclarations in instances can occur when two
8022 -- formal types get the same actual type. The subprograms in
8023 -- in the instance are legal, even if not callable from the
8024 -- outside. Calls from within are disambiguated elsewhere.
8025 -- For dispatching operations in the visible part, the usual
8026 -- rules apply, and operations with the same profile are not
8029 elsif (In_Instance_Visible_Part
8030 and then not Is_Dispatching_Operation (E))
8031 or else In_Instance_Not_Visible
8035 -- Here we have a real error (identical profile)
8038 Error_Msg_Sloc := Sloc (E);
8040 -- Avoid cascaded errors if the entity appears in
8041 -- subsequent calls.
8043 Set_Scope (S, Current_Scope);
8045 -- Generate error, with extra useful warning for the case
8046 -- of a generic instance with no completion.
8048 if Is_Generic_Instance (S)
8049 and then not Has_Completion (E)
8052 ("instantiation cannot provide body for&", S);
8053 Error_Msg_N ("\& conflicts with declaration#", S);
8055 Error_Msg_N ("& conflicts with declaration#", S);
8062 -- If one subprogram has an access parameter and the other
8063 -- a parameter of an access type, calls to either might be
8064 -- ambiguous. Verify that parameters match except for the
8065 -- access parameter.
8067 if May_Hide_Profile then
8073 F1 := First_Formal (S);
8074 F2 := First_Formal (E);
8075 while Present (F1) and then Present (F2) loop
8076 if Is_Access_Type (Etype (F1)) then
8077 if not Is_Access_Type (Etype (F2))
8078 or else not Conforming_Types
8079 (Designated_Type (Etype (F1)),
8080 Designated_Type (Etype (F2)),
8083 May_Hide_Profile := False;
8087 not Conforming_Types
8088 (Etype (F1), Etype (F2), Type_Conformant)
8090 May_Hide_Profile := False;
8101 Error_Msg_NE ("calls to& may be ambiguous?", S, S);
8110 -- On exit, we know that S is a new entity
8112 Enter_Overloaded_Entity (S);
8113 Check_For_Primitive_Subprogram (Is_Primitive_Subp);
8114 Check_Overriding_Indicator
8115 (S, Overridden_Subp, Is_Primitive => Is_Primitive_Subp);
8117 -- If S is a derived operation for an untagged type then by
8118 -- definition it's not a dispatching operation (even if the parent
8119 -- operation was dispatching), so we don't call
8120 -- Check_Dispatching_Operation in that case.
8122 if No (Derived_Type)
8123 or else Is_Tagged_Type (Derived_Type)
8125 Check_Dispatching_Operation (S, Empty);
8129 -- If this is a user-defined equality operator that is not a derived
8130 -- subprogram, create the corresponding inequality. If the operation is
8131 -- dispatching, the expansion is done elsewhere, and we do not create
8132 -- an explicit inequality operation.
8134 <<Check_Inequality>>
8135 if Chars (S) = Name_Op_Eq
8136 and then Etype (S) = Standard_Boolean
8137 and then Present (Parent (S))
8138 and then not Is_Dispatching_Operation (S)
8140 Make_Inequality_Operator (S);
8142 if Ada_Version >= Ada_12 then
8143 Check_Untagged_Equality (S);
8146 end New_Overloaded_Entity;
8148 ---------------------
8149 -- Process_Formals --
8150 ---------------------
8152 procedure Process_Formals
8154 Related_Nod : Node_Id)
8156 Param_Spec : Node_Id;
8158 Formal_Type : Entity_Id;
8162 Num_Out_Params : Nat := 0;
8163 First_Out_Param : Entity_Id := Empty;
8164 -- Used for setting Is_Only_Out_Parameter
8166 function Designates_From_With_Type (Typ : Entity_Id) return Boolean;
8167 -- Determine whether an access type designates a type coming from a
8170 function Is_Class_Wide_Default (D : Node_Id) return Boolean;
8171 -- Check whether the default has a class-wide type. After analysis the
8172 -- default has the type of the formal, so we must also check explicitly
8173 -- for an access attribute.
8175 -------------------------------
8176 -- Designates_From_With_Type --
8177 -------------------------------
8179 function Designates_From_With_Type (Typ : Entity_Id) return Boolean is
8180 Desig : Entity_Id := Typ;
8183 if Is_Access_Type (Desig) then
8184 Desig := Directly_Designated_Type (Desig);
8187 if Is_Class_Wide_Type (Desig) then
8188 Desig := Root_Type (Desig);
8192 Ekind (Desig) = E_Incomplete_Type
8193 and then From_With_Type (Desig);
8194 end Designates_From_With_Type;
8196 ---------------------------
8197 -- Is_Class_Wide_Default --
8198 ---------------------------
8200 function Is_Class_Wide_Default (D : Node_Id) return Boolean is
8202 return Is_Class_Wide_Type (Designated_Type (Etype (D)))
8203 or else (Nkind (D) = N_Attribute_Reference
8204 and then Attribute_Name (D) = Name_Access
8205 and then Is_Class_Wide_Type (Etype (Prefix (D))));
8206 end Is_Class_Wide_Default;
8208 -- Start of processing for Process_Formals
8211 -- In order to prevent premature use of the formals in the same formal
8212 -- part, the Ekind is left undefined until all default expressions are
8213 -- analyzed. The Ekind is established in a separate loop at the end.
8215 Param_Spec := First (T);
8216 while Present (Param_Spec) loop
8217 Formal := Defining_Identifier (Param_Spec);
8218 Set_Never_Set_In_Source (Formal, True);
8219 Enter_Name (Formal);
8221 -- Case of ordinary parameters
8223 if Nkind (Parameter_Type (Param_Spec)) /= N_Access_Definition then
8224 Find_Type (Parameter_Type (Param_Spec));
8225 Ptype := Parameter_Type (Param_Spec);
8227 if Ptype = Error then
8231 Formal_Type := Entity (Ptype);
8233 if Is_Incomplete_Type (Formal_Type)
8235 (Is_Class_Wide_Type (Formal_Type)
8236 and then Is_Incomplete_Type (Root_Type (Formal_Type)))
8238 -- Ada 2005 (AI-326): Tagged incomplete types allowed in
8239 -- primitive operations, as long as their completion is
8240 -- in the same declarative part. If in the private part
8241 -- this means that the type cannot be a Taft-amendment type.
8242 -- Check is done on package exit. For access to subprograms,
8243 -- the use is legal for Taft-amendment types.
8245 if Is_Tagged_Type (Formal_Type) then
8246 if Ekind (Scope (Current_Scope)) = E_Package
8247 and then In_Private_Part (Scope (Current_Scope))
8248 and then not From_With_Type (Formal_Type)
8249 and then not Is_Class_Wide_Type (Formal_Type)
8252 (Parent (T), N_Access_Function_Definition,
8253 N_Access_Procedure_Definition)
8257 Private_Dependents (Base_Type (Formal_Type)));
8261 -- Special handling of Value_Type for CIL case
8263 elsif Is_Value_Type (Formal_Type) then
8266 elsif not Nkind_In (Parent (T), N_Access_Function_Definition,
8267 N_Access_Procedure_Definition)
8270 ("invalid use of incomplete type&",
8271 Param_Spec, Formal_Type);
8273 -- Further checks on the legality of incomplete types
8274 -- in formal parts must be delayed until the freeze point
8275 -- of the enclosing subprogram or access to subprogram.
8278 elsif Ekind (Formal_Type) = E_Void then
8279 Error_Msg_NE ("premature use of&",
8280 Parameter_Type (Param_Spec), Formal_Type);
8283 -- Ada 2005 (AI-231): Create and decorate an internal subtype
8284 -- declaration corresponding to the null-excluding type of the
8285 -- formal in the enclosing scope. Finally, replace the parameter
8286 -- type of the formal with the internal subtype.
8288 if Ada_Version >= Ada_05
8289 and then Null_Exclusion_Present (Param_Spec)
8291 if not Is_Access_Type (Formal_Type) then
8293 ("`NOT NULL` allowed only for an access type", Param_Spec);
8296 if Can_Never_Be_Null (Formal_Type)
8297 and then Comes_From_Source (Related_Nod)
8300 ("`NOT NULL` not allowed (& already excludes null)",
8306 Create_Null_Excluding_Itype
8308 Related_Nod => Related_Nod,
8309 Scope_Id => Scope (Current_Scope));
8311 -- If the designated type of the itype is an itype we
8312 -- decorate it with the Has_Delayed_Freeze attribute to
8313 -- avoid problems with the backend.
8316 -- type T is access procedure;
8317 -- procedure Op (O : not null T);
8319 if Is_Itype (Directly_Designated_Type (Formal_Type)) then
8320 Set_Has_Delayed_Freeze (Formal_Type);
8325 -- An access formal type
8329 Access_Definition (Related_Nod, Parameter_Type (Param_Spec));
8331 -- No need to continue if we already notified errors
8333 if not Present (Formal_Type) then
8337 -- Ada 2005 (AI-254)
8340 AD : constant Node_Id :=
8341 Access_To_Subprogram_Definition
8342 (Parameter_Type (Param_Spec));
8344 if Present (AD) and then Protected_Present (AD) then
8346 Replace_Anonymous_Access_To_Protected_Subprogram
8352 Set_Etype (Formal, Formal_Type);
8353 Default := Expression (Param_Spec);
8355 if Present (Default) then
8356 if Out_Present (Param_Spec) then
8358 ("default initialization only allowed for IN parameters",
8362 -- Do the special preanalysis of the expression (see section on
8363 -- "Handling of Default Expressions" in the spec of package Sem).
8365 Preanalyze_Spec_Expression (Default, Formal_Type);
8367 -- An access to constant cannot be the default for
8368 -- an access parameter that is an access to variable.
8370 if Ekind (Formal_Type) = E_Anonymous_Access_Type
8371 and then not Is_Access_Constant (Formal_Type)
8372 and then Is_Access_Type (Etype (Default))
8373 and then Is_Access_Constant (Etype (Default))
8376 ("formal that is access to variable cannot be initialized " &
8377 "with an access-to-constant expression", Default);
8380 -- Check that the designated type of an access parameter's default
8381 -- is not a class-wide type unless the parameter's designated type
8382 -- is also class-wide.
8384 if Ekind (Formal_Type) = E_Anonymous_Access_Type
8385 and then not Designates_From_With_Type (Formal_Type)
8386 and then Is_Class_Wide_Default (Default)
8387 and then not Is_Class_Wide_Type (Designated_Type (Formal_Type))
8390 ("access to class-wide expression not allowed here", Default);
8393 -- Check incorrect use of dynamically tagged expressions
8395 if Is_Tagged_Type (Formal_Type) then
8396 Check_Dynamically_Tagged_Expression
8399 Related_Nod => Default);
8403 -- Ada 2005 (AI-231): Static checks
8405 if Ada_Version >= Ada_05
8406 and then Is_Access_Type (Etype (Formal))
8407 and then Can_Never_Be_Null (Etype (Formal))
8409 Null_Exclusion_Static_Checks (Param_Spec);
8416 -- If this is the formal part of a function specification, analyze the
8417 -- subtype mark in the context where the formals are visible but not
8418 -- yet usable, and may hide outer homographs.
8420 if Nkind (Related_Nod) = N_Function_Specification then
8421 Analyze_Return_Type (Related_Nod);
8424 -- Now set the kind (mode) of each formal
8426 Param_Spec := First (T);
8428 while Present (Param_Spec) loop
8429 Formal := Defining_Identifier (Param_Spec);
8430 Set_Formal_Mode (Formal);
8432 if Ekind (Formal) = E_In_Parameter then
8433 Set_Default_Value (Formal, Expression (Param_Spec));
8435 if Present (Expression (Param_Spec)) then
8436 Default := Expression (Param_Spec);
8438 if Is_Scalar_Type (Etype (Default)) then
8440 (Parameter_Type (Param_Spec)) /= N_Access_Definition
8442 Formal_Type := Entity (Parameter_Type (Param_Spec));
8445 Formal_Type := Access_Definition
8446 (Related_Nod, Parameter_Type (Param_Spec));
8449 Apply_Scalar_Range_Check (Default, Formal_Type);
8453 elsif Ekind (Formal) = E_Out_Parameter then
8454 Num_Out_Params := Num_Out_Params + 1;
8456 if Num_Out_Params = 1 then
8457 First_Out_Param := Formal;
8460 elsif Ekind (Formal) = E_In_Out_Parameter then
8461 Num_Out_Params := Num_Out_Params + 1;
8467 if Present (First_Out_Param) and then Num_Out_Params = 1 then
8468 Set_Is_Only_Out_Parameter (First_Out_Param);
8470 end Process_Formals;
8476 procedure Process_PPCs
8478 Spec_Id : Entity_Id;
8479 Body_Id : Entity_Id)
8481 Loc : constant Source_Ptr := Sloc (N);
8483 Plist : List_Id := No_List;
8487 function Grab_PPC (Nam : Name_Id) return Node_Id;
8488 -- Prag contains an analyzed precondition or postcondition pragma.
8489 -- This function copies the pragma, changes it to the corresponding
8490 -- Check pragma and returns the Check pragma as the result. The
8491 -- argument Nam is either Name_Precondition or Name_Postcondition.
8497 function Grab_PPC (Nam : Name_Id) return Node_Id is
8498 CP : constant Node_Id := New_Copy_Tree (Prag);
8501 -- Set Analyzed to false, since we want to reanalyze the check
8502 -- procedure. Note that it is only at the outer level that we
8503 -- do this fiddling, for the spec cases, the already preanalyzed
8504 -- parameters are not affected.
8506 -- For a postcondition pragma within a generic, preserve the pragma
8507 -- for later expansion.
8509 Set_Analyzed (CP, False);
8511 if Nam = Name_Postcondition
8512 and then not Expander_Active
8517 -- Change pragma into corresponding pragma Check
8519 Prepend_To (Pragma_Argument_Associations (CP),
8520 Make_Pragma_Argument_Association (Sloc (Prag),
8522 Make_Identifier (Loc,
8524 Set_Pragma_Identifier (CP,
8525 Make_Identifier (Sloc (Prag),
8526 Chars => Name_Check));
8531 -- Start of processing for Process_PPCs
8534 -- Nothing to do if we are not generating code
8536 if Operating_Mode /= Generate_Code then
8540 -- Grab preconditions from spec
8542 if Present (Spec_Id) then
8544 -- Loop through PPC pragmas from spec. Note that preconditions from
8545 -- the body will be analyzed and converted when we scan the body
8546 -- declarations below.
8548 Prag := Spec_PPC_List (Spec_Id);
8549 while Present (Prag) loop
8550 if Pragma_Name (Prag) = Name_Precondition
8551 and then Pragma_Enabled (Prag)
8553 -- Add pragma Check at the start of the declarations of N.
8554 -- Note that this processing reverses the order of the list,
8555 -- which is what we want since new entries were chained to
8556 -- the head of the list.
8558 Prepend (Grab_PPC (Name_Precondition), Declarations (N));
8561 Prag := Next_Pragma (Prag);
8565 -- Build postconditions procedure if needed and prepend the following
8566 -- declaration to the start of the declarations for the subprogram.
8568 -- procedure _postconditions [(_Result : resulttype)] is
8570 -- pragma Check (Postcondition, condition [,message]);
8571 -- pragma Check (Postcondition, condition [,message]);
8575 -- First we deal with the postconditions in the body
8577 if Is_Non_Empty_List (Declarations (N)) then
8579 -- Loop through declarations
8581 Prag := First (Declarations (N));
8582 while Present (Prag) loop
8583 if Nkind (Prag) = N_Pragma then
8585 -- If pragma, capture if enabled postcondition, else ignore
8587 if Pragma_Name (Prag) = Name_Postcondition
8588 and then Check_Enabled (Name_Postcondition)
8590 if Plist = No_List then
8591 Plist := Empty_List;
8596 -- If expansion is disabled, as in a generic unit,
8597 -- save pragma for later expansion.
8599 if not Expander_Active then
8600 Prepend (Grab_PPC (Name_Postcondition), Declarations (N));
8602 Append (Grab_PPC (Name_Postcondition), Plist);
8608 -- Not a pragma, if comes from source, then end scan
8610 elsif Comes_From_Source (Prag) then
8613 -- Skip stuff not coming from source
8621 -- Now deal with any postconditions from the spec
8623 if Present (Spec_Id) then
8625 -- Loop through PPC pragmas from spec
8627 Prag := Spec_PPC_List (Spec_Id);
8628 while Present (Prag) loop
8629 if Pragma_Name (Prag) = Name_Postcondition
8630 and then Pragma_Enabled (Prag)
8632 if Plist = No_List then
8633 Plist := Empty_List;
8636 if not Expander_Active then
8637 Prepend (Grab_PPC (Name_Postcondition), Declarations (N));
8639 Append (Grab_PPC (Name_Postcondition), Plist);
8643 Prag := Next_Pragma (Prag);
8647 -- If we had any postconditions and expansion is enabled, build
8648 -- the _Postconditions procedure.
8651 and then Expander_Active
8653 Subp := Defining_Entity (N);
8655 if Etype (Subp) /= Standard_Void_Type then
8657 Make_Parameter_Specification (Loc,
8658 Defining_Identifier =>
8659 Make_Defining_Identifier (Loc,
8660 Chars => Name_uResult),
8661 Parameter_Type => New_Occurrence_Of (Etype (Subp), Loc)));
8667 Post_Proc : constant Entity_Id :=
8668 Make_Defining_Identifier (Loc,
8669 Chars => Name_uPostconditions);
8670 -- The entity for the _Postconditions procedure
8672 Prepend_To (Declarations (N),
8673 Make_Subprogram_Body (Loc,
8675 Make_Procedure_Specification (Loc,
8676 Defining_Unit_Name => Post_Proc,
8677 Parameter_Specifications => Parms),
8679 Declarations => Empty_List,
8681 Handled_Statement_Sequence =>
8682 Make_Handled_Sequence_Of_Statements (Loc,
8683 Statements => Plist)));
8685 -- If this is a procedure, set the Postcondition_Proc attribute on
8686 -- the proper defining entity for the subprogram.
8688 if Etype (Subp) = Standard_Void_Type then
8689 if Present (Spec_Id) then
8690 Set_Postcondition_Proc (Spec_Id, Post_Proc);
8692 Set_Postcondition_Proc (Body_Id, Post_Proc);
8697 if Present (Spec_Id) then
8698 Set_Has_Postconditions (Spec_Id);
8700 Set_Has_Postconditions (Body_Id);
8705 ----------------------------
8706 -- Reference_Body_Formals --
8707 ----------------------------
8709 procedure Reference_Body_Formals (Spec : Entity_Id; Bod : Entity_Id) is
8714 if Error_Posted (Spec) then
8718 -- Iterate over both lists. They may be of different lengths if the two
8719 -- specs are not conformant.
8721 Fs := First_Formal (Spec);
8722 Fb := First_Formal (Bod);
8723 while Present (Fs) and then Present (Fb) loop
8724 Generate_Reference (Fs, Fb, 'b');
8727 Style.Check_Identifier (Fb, Fs);
8730 Set_Spec_Entity (Fb, Fs);
8731 Set_Referenced (Fs, False);
8735 end Reference_Body_Formals;
8737 -------------------------
8738 -- Set_Actual_Subtypes --
8739 -------------------------
8741 procedure Set_Actual_Subtypes (N : Node_Id; Subp : Entity_Id) is
8742 Loc : constant Source_Ptr := Sloc (N);
8746 First_Stmt : Node_Id := Empty;
8747 AS_Needed : Boolean;
8750 -- If this is an empty initialization procedure, no need to create
8751 -- actual subtypes (small optimization).
8753 if Ekind (Subp) = E_Procedure
8754 and then Is_Null_Init_Proc (Subp)
8759 Formal := First_Formal (Subp);
8760 while Present (Formal) loop
8761 T := Etype (Formal);
8763 -- We never need an actual subtype for a constrained formal
8765 if Is_Constrained (T) then
8768 -- If we have unknown discriminants, then we do not need an actual
8769 -- subtype, or more accurately we cannot figure it out! Note that
8770 -- all class-wide types have unknown discriminants.
8772 elsif Has_Unknown_Discriminants (T) then
8775 -- At this stage we have an unconstrained type that may need an
8776 -- actual subtype. For sure the actual subtype is needed if we have
8777 -- an unconstrained array type.
8779 elsif Is_Array_Type (T) then
8782 -- The only other case needing an actual subtype is an unconstrained
8783 -- record type which is an IN parameter (we cannot generate actual
8784 -- subtypes for the OUT or IN OUT case, since an assignment can
8785 -- change the discriminant values. However we exclude the case of
8786 -- initialization procedures, since discriminants are handled very
8787 -- specially in this context, see the section entitled "Handling of
8788 -- Discriminants" in Einfo.
8790 -- We also exclude the case of Discrim_SO_Functions (functions used
8791 -- in front end layout mode for size/offset values), since in such
8792 -- functions only discriminants are referenced, and not only are such
8793 -- subtypes not needed, but they cannot always be generated, because
8794 -- of order of elaboration issues.
8796 elsif Is_Record_Type (T)
8797 and then Ekind (Formal) = E_In_Parameter
8798 and then Chars (Formal) /= Name_uInit
8799 and then not Is_Unchecked_Union (T)
8800 and then not Is_Discrim_SO_Function (Subp)
8804 -- All other cases do not need an actual subtype
8810 -- Generate actual subtypes for unconstrained arrays and
8811 -- unconstrained discriminated records.
8814 if Nkind (N) = N_Accept_Statement then
8816 -- If expansion is active, The formal is replaced by a local
8817 -- variable that renames the corresponding entry of the
8818 -- parameter block, and it is this local variable that may
8819 -- require an actual subtype.
8821 if Expander_Active then
8822 Decl := Build_Actual_Subtype (T, Renamed_Object (Formal));
8824 Decl := Build_Actual_Subtype (T, Formal);
8827 if Present (Handled_Statement_Sequence (N)) then
8829 First (Statements (Handled_Statement_Sequence (N)));
8830 Prepend (Decl, Statements (Handled_Statement_Sequence (N)));
8831 Mark_Rewrite_Insertion (Decl);
8833 -- If the accept statement has no body, there will be no
8834 -- reference to the actuals, so no need to compute actual
8841 Decl := Build_Actual_Subtype (T, Formal);
8842 Prepend (Decl, Declarations (N));
8843 Mark_Rewrite_Insertion (Decl);
8846 -- The declaration uses the bounds of an existing object, and
8847 -- therefore needs no constraint checks.
8849 Analyze (Decl, Suppress => All_Checks);
8851 -- We need to freeze manually the generated type when it is
8852 -- inserted anywhere else than in a declarative part.
8854 if Present (First_Stmt) then
8855 Insert_List_Before_And_Analyze (First_Stmt,
8856 Freeze_Entity (Defining_Identifier (Decl), Loc));
8859 if Nkind (N) = N_Accept_Statement
8860 and then Expander_Active
8862 Set_Actual_Subtype (Renamed_Object (Formal),
8863 Defining_Identifier (Decl));
8865 Set_Actual_Subtype (Formal, Defining_Identifier (Decl));
8869 Next_Formal (Formal);
8871 end Set_Actual_Subtypes;
8873 ---------------------
8874 -- Set_Formal_Mode --
8875 ---------------------
8877 procedure Set_Formal_Mode (Formal_Id : Entity_Id) is
8878 Spec : constant Node_Id := Parent (Formal_Id);
8881 -- Note: we set Is_Known_Valid for IN parameters and IN OUT parameters
8882 -- since we ensure that corresponding actuals are always valid at the
8883 -- point of the call.
8885 if Out_Present (Spec) then
8886 if Ekind (Scope (Formal_Id)) = E_Function
8887 or else Ekind (Scope (Formal_Id)) = E_Generic_Function
8889 Error_Msg_N ("functions can only have IN parameters", Spec);
8890 Set_Ekind (Formal_Id, E_In_Parameter);
8892 elsif In_Present (Spec) then
8893 Set_Ekind (Formal_Id, E_In_Out_Parameter);
8896 Set_Ekind (Formal_Id, E_Out_Parameter);
8897 Set_Never_Set_In_Source (Formal_Id, True);
8898 Set_Is_True_Constant (Formal_Id, False);
8899 Set_Current_Value (Formal_Id, Empty);
8903 Set_Ekind (Formal_Id, E_In_Parameter);
8906 -- Set Is_Known_Non_Null for access parameters since the language
8907 -- guarantees that access parameters are always non-null. We also set
8908 -- Can_Never_Be_Null, since there is no way to change the value.
8910 if Nkind (Parameter_Type (Spec)) = N_Access_Definition then
8912 -- Ada 2005 (AI-231): In Ada95, access parameters are always non-
8913 -- null; In Ada 2005, only if then null_exclusion is explicit.
8915 if Ada_Version < Ada_05
8916 or else Can_Never_Be_Null (Etype (Formal_Id))
8918 Set_Is_Known_Non_Null (Formal_Id);
8919 Set_Can_Never_Be_Null (Formal_Id);
8922 -- Ada 2005 (AI-231): Null-exclusion access subtype
8924 elsif Is_Access_Type (Etype (Formal_Id))
8925 and then Can_Never_Be_Null (Etype (Formal_Id))
8927 Set_Is_Known_Non_Null (Formal_Id);
8930 Set_Mechanism (Formal_Id, Default_Mechanism);
8931 Set_Formal_Validity (Formal_Id);
8932 end Set_Formal_Mode;
8934 -------------------------
8935 -- Set_Formal_Validity --
8936 -------------------------
8938 procedure Set_Formal_Validity (Formal_Id : Entity_Id) is
8940 -- If no validity checking, then we cannot assume anything about the
8941 -- validity of parameters, since we do not know there is any checking
8942 -- of the validity on the call side.
8944 if not Validity_Checks_On then
8947 -- If validity checking for parameters is enabled, this means we are
8948 -- not supposed to make any assumptions about argument values.
8950 elsif Validity_Check_Parameters then
8953 -- If we are checking in parameters, we will assume that the caller is
8954 -- also checking parameters, so we can assume the parameter is valid.
8956 elsif Ekind (Formal_Id) = E_In_Parameter
8957 and then Validity_Check_In_Params
8959 Set_Is_Known_Valid (Formal_Id, True);
8961 -- Similar treatment for IN OUT parameters
8963 elsif Ekind (Formal_Id) = E_In_Out_Parameter
8964 and then Validity_Check_In_Out_Params
8966 Set_Is_Known_Valid (Formal_Id, True);
8968 end Set_Formal_Validity;
8970 ------------------------
8971 -- Subtype_Conformant --
8972 ------------------------
8974 function Subtype_Conformant
8975 (New_Id : Entity_Id;
8977 Skip_Controlling_Formals : Boolean := False) return Boolean
8981 Check_Conformance (New_Id, Old_Id, Subtype_Conformant, False, Result,
8982 Skip_Controlling_Formals => Skip_Controlling_Formals);
8984 end Subtype_Conformant;
8986 ---------------------
8987 -- Type_Conformant --
8988 ---------------------
8990 function Type_Conformant
8991 (New_Id : Entity_Id;
8993 Skip_Controlling_Formals : Boolean := False) return Boolean
8997 May_Hide_Profile := False;
9000 (New_Id, Old_Id, Type_Conformant, False, Result,
9001 Skip_Controlling_Formals => Skip_Controlling_Formals);
9003 end Type_Conformant;
9005 -------------------------------
9006 -- Valid_Operator_Definition --
9007 -------------------------------
9009 procedure Valid_Operator_Definition (Designator : Entity_Id) is
9012 Id : constant Name_Id := Chars (Designator);
9016 F := First_Formal (Designator);
9017 while Present (F) loop
9020 if Present (Default_Value (F)) then
9022 ("default values not allowed for operator parameters",
9029 -- Verify that user-defined operators have proper number of arguments
9030 -- First case of operators which can only be unary
9033 or else Id = Name_Op_Abs
9037 -- Case of operators which can be unary or binary
9039 elsif Id = Name_Op_Add
9040 or Id = Name_Op_Subtract
9042 N_OK := (N in 1 .. 2);
9044 -- All other operators can only be binary
9052 ("incorrect number of arguments for operator", Designator);
9056 and then Base_Type (Etype (Designator)) = Standard_Boolean
9057 and then not Is_Intrinsic_Subprogram (Designator)
9060 ("explicit definition of inequality not allowed", Designator);
9062 end Valid_Operator_Definition;