1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2004, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 2, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
20 -- MA 02111-1307, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Atree; use Atree;
28 with Checks; use Checks;
29 with Debug; use Debug;
30 with Einfo; use Einfo;
31 with Errout; use Errout;
32 with Elists; use Elists;
33 with Exp_Ch2; use Exp_Ch2;
34 with Exp_Ch3; use Exp_Ch3;
35 with Exp_Ch7; use Exp_Ch7;
36 with Exp_Ch9; use Exp_Ch9;
37 with Exp_Ch11; use Exp_Ch11;
38 with Exp_Dbug; use Exp_Dbug;
39 with Exp_Disp; use Exp_Disp;
40 with Exp_Dist; use Exp_Dist;
41 with Exp_Intr; use Exp_Intr;
42 with Exp_Pakd; use Exp_Pakd;
43 with Exp_Tss; use Exp_Tss;
44 with Exp_Util; use Exp_Util;
45 with Fname; use Fname;
46 with Freeze; use Freeze;
47 with Hostparm; use Hostparm;
48 with Inline; use Inline;
50 with Nlists; use Nlists;
51 with Nmake; use Nmake;
53 with Restrict; use Restrict;
54 with Rident; use Rident;
55 with Rtsfind; use Rtsfind;
57 with Sem_Ch6; use Sem_Ch6;
58 with Sem_Ch8; use Sem_Ch8;
59 with Sem_Ch12; use Sem_Ch12;
60 with Sem_Ch13; use Sem_Ch13;
61 with Sem_Disp; use Sem_Disp;
62 with Sem_Dist; use Sem_Dist;
63 with Sem_Res; use Sem_Res;
64 with Sem_Util; use Sem_Util;
65 with Sinfo; use Sinfo;
66 with Snames; use Snames;
67 with Stand; use Stand;
68 with Tbuild; use Tbuild;
69 with Ttypes; use Ttypes;
70 with Uintp; use Uintp;
71 with Validsw; use Validsw;
73 package body Exp_Ch6 is
75 -----------------------
76 -- Local Subprograms --
77 -----------------------
79 procedure Check_Overriding_Operation (Subp : Entity_Id);
80 -- Subp is a dispatching operation. Check whether it may override an
81 -- inherited private operation, in which case its DT entry is that of
82 -- the hidden operation, not the one it may have received earlier.
83 -- This must be done before emitting the code to set the corresponding
84 -- DT to the address of the subprogram. The actual placement of Subp in
85 -- the proper place in the list of primitive operations is done in
86 -- Declare_Inherited_Private_Subprograms, which also has to deal with
87 -- implicit operations. This duplication is unavoidable for now???
89 procedure Detect_Infinite_Recursion (N : Node_Id; Spec : Entity_Id);
90 -- This procedure is called only if the subprogram body N, whose spec
91 -- has the given entity Spec, contains a parameterless recursive call.
92 -- It attempts to generate runtime code to detect if this a case of
93 -- infinite recursion.
95 -- The body is scanned to determine dependencies. If the only external
96 -- dependencies are on a small set of scalar variables, then the values
97 -- of these variables are captured on entry to the subprogram, and if
98 -- the values are not changed for the call, we know immediately that
99 -- we have an infinite recursion.
101 procedure Expand_Actuals (N : Node_Id; Subp : Entity_Id);
102 -- For each actual of an in-out parameter which is a numeric conversion
103 -- of the form T(A), where A denotes a variable, we insert the declaration:
105 -- Temp : T := T (A);
107 -- prior to the call. Then we replace the actual with a reference to Temp,
108 -- and append the assignment:
110 -- A := TypeA (Temp);
112 -- after the call. Here TypeA is the actual type of variable A.
113 -- For out parameters, the initial declaration has no expression.
114 -- If A is not an entity name, we generate instead:
116 -- Var : TypeA renames A;
117 -- Temp : T := Var; -- omitting expression for out parameter.
119 -- Var := TypeA (Temp);
121 -- For other in-out parameters, we emit the required constraint checks
122 -- before and/or after the call.
124 -- For all parameter modes, actuals that denote components and slices
125 -- of packed arrays are expanded into suitable temporaries.
127 procedure Expand_Inlined_Call
130 Orig_Subp : Entity_Id);
131 -- If called subprogram can be inlined by the front-end, retrieve the
132 -- analyzed body, replace formals with actuals and expand call in place.
133 -- Generate thunks for actuals that are expressions, and insert the
134 -- corresponding constant declarations before the call. If the original
135 -- call is to a derived operation, the return type is the one of the
136 -- derived operation, but the body is that of the original, so return
137 -- expressions in the body must be converted to the desired type (which
138 -- is simply not noted in the tree without inline expansion).
140 function Expand_Protected_Object_Reference
145 procedure Expand_Protected_Subprogram_Call
149 -- A call to a protected subprogram within the protected object may appear
150 -- as a regular call. The list of actuals must be expanded to contain a
151 -- reference to the object itself, and the call becomes a call to the
152 -- corresponding protected subprogram.
154 --------------------------------
155 -- Check_Overriding_Operation --
156 --------------------------------
158 procedure Check_Overriding_Operation (Subp : Entity_Id) is
159 Typ : constant Entity_Id := Find_Dispatching_Type (Subp);
160 Op_List : constant Elist_Id := Primitive_Operations (Typ);
166 if Is_Derived_Type (Typ)
167 and then not Is_Private_Type (Typ)
168 and then In_Open_Scopes (Scope (Etype (Typ)))
169 and then Typ = Base_Type (Typ)
171 -- Subp overrides an inherited private operation if there is
172 -- an inherited operation with a different name than Subp (see
173 -- Derive_Subprogram) whose Alias is a hidden subprogram with
174 -- the same name as Subp.
176 Op_Elmt := First_Elmt (Op_List);
177 while Present (Op_Elmt) loop
178 Prim_Op := Node (Op_Elmt);
179 Par_Op := Alias (Prim_Op);
182 and then not Comes_From_Source (Prim_Op)
183 and then Chars (Prim_Op) /= Chars (Par_Op)
184 and then Chars (Par_Op) = Chars (Subp)
185 and then Is_Hidden (Par_Op)
186 and then Type_Conformant (Prim_Op, Subp)
188 Set_DT_Position (Subp, DT_Position (Prim_Op));
194 end Check_Overriding_Operation;
196 -------------------------------
197 -- Detect_Infinite_Recursion --
198 -------------------------------
200 procedure Detect_Infinite_Recursion (N : Node_Id; Spec : Entity_Id) is
201 Loc : constant Source_Ptr := Sloc (N);
203 Var_List : constant Elist_Id := New_Elmt_List;
204 -- List of globals referenced by body of procedure
206 Call_List : constant Elist_Id := New_Elmt_List;
207 -- List of recursive calls in body of procedure
209 Shad_List : constant Elist_Id := New_Elmt_List;
210 -- List of entity id's for entities created to capture the
211 -- value of referenced globals on entry to the procedure.
213 Scop : constant Uint := Scope_Depth (Spec);
214 -- This is used to record the scope depth of the current
215 -- procedure, so that we can identify global references.
217 Max_Vars : constant := 4;
218 -- Do not test more than four global variables
220 Count_Vars : Natural := 0;
221 -- Count variables found so far
233 function Process (Nod : Node_Id) return Traverse_Result;
234 -- Function to traverse the subprogram body (using Traverse_Func)
240 function Process (Nod : Node_Id) return Traverse_Result is
244 if Nkind (Nod) = N_Procedure_Call_Statement then
246 -- Case of one of the detected recursive calls
248 if Is_Entity_Name (Name (Nod))
249 and then Has_Recursive_Call (Entity (Name (Nod)))
250 and then Entity (Name (Nod)) = Spec
252 Append_Elmt (Nod, Call_List);
255 -- Any other procedure call may have side effects
261 -- A call to a pure function can always be ignored
263 elsif Nkind (Nod) = N_Function_Call
264 and then Is_Entity_Name (Name (Nod))
265 and then Is_Pure (Entity (Name (Nod)))
269 -- Case of an identifier reference
271 elsif Nkind (Nod) = N_Identifier then
274 -- If no entity, then ignore the reference
276 -- Not clear why this can happen. To investigate, remove this
277 -- test and look at the crash that occurs here in 3401-004 ???
282 -- Ignore entities with no Scope, again not clear how this
283 -- can happen, to investigate, look at 4108-008 ???
285 elsif No (Scope (Ent)) then
288 -- Ignore the reference if not to a more global object
290 elsif Scope_Depth (Scope (Ent)) >= Scop then
293 -- References to types, exceptions and constants are always OK
296 or else Ekind (Ent) = E_Exception
297 or else Ekind (Ent) = E_Constant
301 -- If other than a non-volatile scalar variable, we have some
302 -- kind of global reference (e.g. to a function) that we cannot
303 -- deal with so we forget the attempt.
305 elsif Ekind (Ent) /= E_Variable
306 or else not Is_Scalar_Type (Etype (Ent))
307 or else Treat_As_Volatile (Ent)
311 -- Otherwise we have a reference to a global scalar
314 -- Loop through global entities already detected
316 Elm := First_Elmt (Var_List);
318 -- If not detected before, record this new global reference
321 Count_Vars := Count_Vars + 1;
323 if Count_Vars <= Max_Vars then
324 Append_Elmt (Entity (Nod), Var_List);
331 -- If recorded before, ignore
333 elsif Node (Elm) = Entity (Nod) then
336 -- Otherwise keep looking
346 -- For all other node kinds, recursively visit syntactic children
353 function Traverse_Body is new Traverse_Func;
355 -- Start of processing for Detect_Infinite_Recursion
358 -- Do not attempt detection in No_Implicit_Conditional mode,
359 -- since we won't be able to generate the code to handle the
360 -- recursion in any case.
362 if Restriction_Active (No_Implicit_Conditionals) then
366 -- Otherwise do traversal and quit if we get abandon signal
368 if Traverse_Body (N) = Abandon then
371 -- We must have a call, since Has_Recursive_Call was set. If not
372 -- just ignore (this is only an error check, so if we have a funny
373 -- situation, due to bugs or errors, we do not want to bomb!)
375 elsif Is_Empty_Elmt_List (Call_List) then
379 -- Here is the case where we detect recursion at compile time
381 -- Push our current scope for analyzing the declarations and
382 -- code that we will insert for the checking.
386 -- This loop builds temporary variables for each of the
387 -- referenced globals, so that at the end of the loop the
388 -- list Shad_List contains these temporaries in one-to-one
389 -- correspondence with the elements in Var_List.
392 Elm := First_Elmt (Var_List);
393 while Present (Elm) loop
396 Make_Defining_Identifier (Loc,
397 Chars => New_Internal_Name ('S'));
398 Append_Elmt (Ent, Shad_List);
400 -- Insert a declaration for this temporary at the start of
401 -- the declarations for the procedure. The temporaries are
402 -- declared as constant objects initialized to the current
403 -- values of the corresponding temporaries.
406 Make_Object_Declaration (Loc,
407 Defining_Identifier => Ent,
408 Object_Definition => New_Occurrence_Of (Etype (Var), Loc),
409 Constant_Present => True,
410 Expression => New_Occurrence_Of (Var, Loc));
413 Prepend (Decl, Declarations (N));
415 Insert_After (Last, Decl);
423 -- Loop through calls
425 Call := First_Elmt (Call_List);
426 while Present (Call) loop
428 -- Build a predicate expression of the form
431 -- and then global1 = temp1
432 -- and then global2 = temp2
435 -- This predicate determines if any of the global values
436 -- referenced by the procedure have changed since the
437 -- current call, if not an infinite recursion is assured.
439 Test := New_Occurrence_Of (Standard_True, Loc);
441 Elm1 := First_Elmt (Var_List);
442 Elm2 := First_Elmt (Shad_List);
443 while Present (Elm1) loop
449 Left_Opnd => New_Occurrence_Of (Node (Elm1), Loc),
450 Right_Opnd => New_Occurrence_Of (Node (Elm2), Loc)));
456 -- Now we replace the call with the sequence
458 -- if no-changes (see above) then
459 -- raise Storage_Error;
464 Rewrite (Node (Call),
465 Make_If_Statement (Loc,
467 Then_Statements => New_List (
468 Make_Raise_Storage_Error (Loc,
469 Reason => SE_Infinite_Recursion)),
471 Else_Statements => New_List (
472 Relocate_Node (Node (Call)))));
474 Analyze (Node (Call));
479 -- Remove temporary scope stack entry used for analysis
482 end Detect_Infinite_Recursion;
488 procedure Expand_Actuals (N : Node_Id; Subp : Entity_Id) is
489 Loc : constant Source_Ptr := Sloc (N);
494 E_Formal : Entity_Id;
496 procedure Add_Call_By_Copy_Code;
497 -- For cases where the parameter must be passed by copy, this routine
498 -- generates a temporary variable into which the actual is copied and
499 -- then passes this as the parameter. For an OUT or IN OUT parameter,
500 -- an assignment is also generated to copy the result back. The call
501 -- also takes care of any constraint checks required for the type
502 -- conversion case (on both the way in and the way out).
504 procedure Add_Packed_Call_By_Copy_Code;
505 -- This is used when the actual involves a reference to an element
506 -- of a packed array, where we can appropriately use a simpler
507 -- approach than the full call by copy code. We just copy the value
508 -- in and out of an appropriate temporary.
510 procedure Check_Fortran_Logical;
511 -- A value of type Logical that is passed through a formal parameter
512 -- must be normalized because .TRUE. usually does not have the same
513 -- representation as True. We assume that .FALSE. = False = 0.
514 -- What about functions that return a logical type ???
516 function Make_Var (Actual : Node_Id) return Entity_Id;
517 -- Returns an entity that refers to the given actual parameter,
518 -- Actual (not including any type conversion). If Actual is an
519 -- entity name, then this entity is returned unchanged, otherwise
520 -- a renaming is created to provide an entity for the actual.
522 procedure Reset_Packed_Prefix;
523 -- The expansion of a packed array component reference is delayed in
524 -- the context of a call. Now we need to complete the expansion, so we
525 -- unmark the analyzed bits in all prefixes.
527 ---------------------------
528 -- Add_Call_By_Copy_Code --
529 ---------------------------
531 procedure Add_Call_By_Copy_Code is
540 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
542 if Nkind (Actual) = N_Type_Conversion then
543 V_Typ := Etype (Expression (Actual));
545 -- If the formal is an (in-)out parameter, capture the name
546 -- of the variable in order to build the post-call assignment.
548 Var := Make_Var (Expression (Actual));
550 Crep := not Same_Representation
551 (Etype (Formal), Etype (Expression (Actual)));
554 V_Typ := Etype (Actual);
555 Var := Make_Var (Actual);
559 -- Setup initialization for case of in out parameter, or an out
560 -- parameter where the formal is an unconstrained array (in the
561 -- latter case, we have to pass in an object with bounds).
563 if Ekind (Formal) = E_In_Out_Parameter
564 or else (Is_Array_Type (Etype (Formal))
566 not Is_Constrained (Etype (Formal)))
568 if Nkind (Actual) = N_Type_Conversion then
569 if Conversion_OK (Actual) then
570 Init := OK_Convert_To
571 (Etype (Formal), New_Occurrence_Of (Var, Loc));
574 (Etype (Formal), New_Occurrence_Of (Var, Loc));
577 Init := New_Occurrence_Of (Var, Loc);
580 -- An initialization is created for packed conversions as
581 -- actuals for out parameters to enable Make_Object_Declaration
582 -- to determine the proper subtype for N_Node. Note that this
583 -- is wasteful because the extra copying on the call side is
584 -- not required for such out parameters. ???
586 elsif Ekind (Formal) = E_Out_Parameter
587 and then Nkind (Actual) = N_Type_Conversion
588 and then (Is_Bit_Packed_Array (Etype (Formal))
590 Is_Bit_Packed_Array (Etype (Expression (Actual))))
592 if Conversion_OK (Actual) then
594 OK_Convert_To (Etype (Formal), New_Occurrence_Of (Var, Loc));
597 Convert_To (Etype (Formal), New_Occurrence_Of (Var, Loc));
600 elsif Ekind (Formal) = E_In_Parameter then
601 Init := New_Occurrence_Of (Var, Loc);
608 Make_Object_Declaration (Loc,
609 Defining_Identifier => Temp,
611 New_Occurrence_Of (Etype (Formal), Loc),
613 Set_Assignment_OK (N_Node);
614 Insert_Action (N, N_Node);
616 -- Now, normally the deal here is that we use the defining
617 -- identifier created by that object declaration. There is
618 -- one exception to this. In the change of representation case
619 -- the above declaration will end up looking like:
621 -- temp : type := identifier;
623 -- And in this case we might as well use the identifier directly
624 -- and eliminate the temporary. Note that the analysis of the
625 -- declaration was not a waste of time in that case, since it is
626 -- what generated the necessary change of representation code. If
627 -- the change of representation introduced additional code, as in
628 -- a fixed-integer conversion, the expression is not an identifier
632 and then Present (Expression (N_Node))
633 and then Is_Entity_Name (Expression (N_Node))
635 Temp := Entity (Expression (N_Node));
636 Rewrite (N_Node, Make_Null_Statement (Loc));
639 -- For IN parameter, all we do is to replace the actual
641 if Ekind (Formal) = E_In_Parameter then
642 Rewrite (Actual, New_Reference_To (Temp, Loc));
645 -- Processing for OUT or IN OUT parameter
648 -- If type conversion, use reverse conversion on exit
650 if Nkind (Actual) = N_Type_Conversion then
651 if Conversion_OK (Actual) then
652 Expr := OK_Convert_To (V_Typ, New_Occurrence_Of (Temp, Loc));
654 Expr := Convert_To (V_Typ, New_Occurrence_Of (Temp, Loc));
657 Expr := New_Occurrence_Of (Temp, Loc);
660 Rewrite (Actual, New_Reference_To (Temp, Loc));
663 Append_To (Post_Call,
664 Make_Assignment_Statement (Loc,
665 Name => New_Occurrence_Of (Var, Loc),
666 Expression => Expr));
668 Set_Assignment_OK (Name (Last (Post_Call)));
670 end Add_Call_By_Copy_Code;
672 ----------------------------------
673 -- Add_Packed_Call_By_Copy_Code --
674 ----------------------------------
676 procedure Add_Packed_Call_By_Copy_Code is
686 -- Prepare to generate code
688 Temp := Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
689 Incod := Relocate_Node (Actual);
690 Outcod := New_Copy_Tree (Incod);
692 -- Generate declaration of temporary variable, initializing it
693 -- with the input parameter unless we have an OUT variable.
695 if Ekind (Formal) = E_Out_Parameter then
700 Make_Object_Declaration (Loc,
701 Defining_Identifier => Temp,
703 New_Occurrence_Of (Etype (Formal), Loc),
704 Expression => Incod));
706 -- The actual is simply a reference to the temporary
708 Rewrite (Actual, New_Occurrence_Of (Temp, Loc));
710 -- Generate copy out if OUT or IN OUT parameter
712 if Ekind (Formal) /= E_In_Parameter then
714 Rhs := New_Occurrence_Of (Temp, Loc);
716 -- Deal with conversion
718 if Nkind (Lhs) = N_Type_Conversion then
719 Lhs := Expression (Lhs);
720 Rhs := Convert_To (Etype (Actual), Rhs);
723 Append_To (Post_Call,
724 Make_Assignment_Statement (Loc,
728 end Add_Packed_Call_By_Copy_Code;
730 ---------------------------
731 -- Check_Fortran_Logical --
732 ---------------------------
734 procedure Check_Fortran_Logical is
735 Logical : constant Entity_Id := Etype (Formal);
738 -- Note: this is very incomplete, e.g. it does not handle arrays
739 -- of logical values. This is really not the right approach at all???)
742 if Convention (Subp) = Convention_Fortran
743 and then Root_Type (Etype (Formal)) = Standard_Boolean
744 and then Ekind (Formal) /= E_In_Parameter
746 Var := Make_Var (Actual);
747 Append_To (Post_Call,
748 Make_Assignment_Statement (Loc,
749 Name => New_Occurrence_Of (Var, Loc),
751 Unchecked_Convert_To (
754 Left_Opnd => New_Occurrence_Of (Var, Loc),
756 Unchecked_Convert_To (
758 New_Occurrence_Of (Standard_False, Loc))))));
760 end Check_Fortran_Logical;
766 function Make_Var (Actual : Node_Id) return Entity_Id is
770 if Is_Entity_Name (Actual) then
771 return Entity (Actual);
774 Var := Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
777 Make_Object_Renaming_Declaration (Loc,
778 Defining_Identifier => Var,
780 New_Occurrence_Of (Etype (Actual), Loc),
781 Name => Relocate_Node (Actual));
783 Insert_Action (N, N_Node);
788 -------------------------
789 -- Reset_Packed_Prefix --
790 -------------------------
792 procedure Reset_Packed_Prefix is
793 Pfx : Node_Id := Actual;
797 Set_Analyzed (Pfx, False);
798 exit when Nkind (Pfx) /= N_Selected_Component
799 and then Nkind (Pfx) /= N_Indexed_Component;
802 end Reset_Packed_Prefix;
804 -- Start of processing for Expand_Actuals
807 Formal := First_Formal (Subp);
808 Actual := First_Actual (N);
810 Post_Call := New_List;
812 while Present (Formal) loop
813 E_Formal := Etype (Formal);
815 if Is_Scalar_Type (E_Formal)
816 or else Nkind (Actual) = N_Slice
818 Check_Fortran_Logical;
822 elsif Ekind (Formal) /= E_Out_Parameter then
824 -- The unusual case of the current instance of a protected type
825 -- requires special handling. This can only occur in the context
826 -- of a call within the body of a protected operation.
828 if Is_Entity_Name (Actual)
829 and then Ekind (Entity (Actual)) = E_Protected_Type
830 and then In_Open_Scopes (Entity (Actual))
832 if Scope (Subp) /= Entity (Actual) then
833 Error_Msg_N ("operation outside protected type may not "
834 & "call back its protected operations?", Actual);
838 Expand_Protected_Object_Reference (N, Entity (Actual)));
841 Apply_Constraint_Check (Actual, E_Formal);
843 -- Out parameter case. No constraint checks on access type
846 elsif Is_Access_Type (E_Formal) then
851 elsif Has_Discriminants (Base_Type (E_Formal))
852 or else Has_Non_Null_Base_Init_Proc (E_Formal)
854 Apply_Constraint_Check (Actual, E_Formal);
859 Apply_Constraint_Check (Actual, Base_Type (E_Formal));
862 -- Processing for IN-OUT and OUT parameters
864 if Ekind (Formal) /= E_In_Parameter then
866 -- For type conversions of arrays, apply length/range checks
868 if Is_Array_Type (E_Formal)
869 and then Nkind (Actual) = N_Type_Conversion
871 if Is_Constrained (E_Formal) then
872 Apply_Length_Check (Expression (Actual), E_Formal);
874 Apply_Range_Check (Expression (Actual), E_Formal);
878 -- If argument is a type conversion for a type that is passed
879 -- by copy, then we must pass the parameter by copy.
881 if Nkind (Actual) = N_Type_Conversion
883 (Is_Numeric_Type (E_Formal)
884 or else Is_Access_Type (E_Formal)
885 or else Is_Enumeration_Type (E_Formal)
886 or else Is_Bit_Packed_Array (Etype (Formal))
887 or else Is_Bit_Packed_Array (Etype (Expression (Actual)))
889 -- Also pass by copy if change of representation
891 or else not Same_Representation
893 Etype (Expression (Actual))))
895 Add_Call_By_Copy_Code;
897 -- References to components of bit packed arrays are expanded
898 -- at this point, rather than at the point of analysis of the
899 -- actuals, to handle the expansion of the assignment to
900 -- [in] out parameters.
902 elsif Is_Ref_To_Bit_Packed_Array (Actual) then
903 Add_Packed_Call_By_Copy_Code;
905 -- References to slices of bit packed arrays are expanded
907 elsif Is_Ref_To_Bit_Packed_Slice (Actual) then
908 Add_Call_By_Copy_Code;
910 -- References to possibly unaligned slices of arrays are expanded
912 elsif Is_Possibly_Unaligned_Slice (Actual) then
913 Add_Call_By_Copy_Code;
915 -- Deal with access types where the actual subtpe and the
916 -- formal subtype are not the same, requiring a check.
918 -- It is necessary to exclude tagged types because of "downward
919 -- conversion" errors and a strange assertion error in namet
920 -- from gnatf in bug 1215-001 ???
922 elsif Is_Access_Type (E_Formal)
923 and then not Same_Type (E_Formal, Etype (Actual))
924 and then not Is_Tagged_Type (Designated_Type (E_Formal))
926 Add_Call_By_Copy_Code;
928 elsif Is_Entity_Name (Actual)
929 and then Treat_As_Volatile (Entity (Actual))
930 and then not Is_Scalar_Type (Etype (Entity (Actual)))
931 and then not Treat_As_Volatile (E_Formal)
933 Add_Call_By_Copy_Code;
935 elsif Nkind (Actual) = N_Indexed_Component
936 and then Is_Entity_Name (Prefix (Actual))
937 and then Has_Volatile_Components (Entity (Prefix (Actual)))
939 Add_Call_By_Copy_Code;
942 -- Processing for IN parameters
945 -- For IN parameters is in the packed array case, we expand an
946 -- indexed component (the circuit in Exp_Ch4 deliberately left
947 -- indexed components appearing as actuals untouched, so that
948 -- the special processing above for the OUT and IN OUT cases
949 -- could be performed. We could make the test in Exp_Ch4 more
950 -- complex and have it detect the parameter mode, but it is
951 -- easier simply to handle all cases here.
953 if Nkind (Actual) = N_Indexed_Component
954 and then Is_Packed (Etype (Prefix (Actual)))
957 Expand_Packed_Element_Reference (Actual);
959 -- If we have a reference to a bit packed array, we copy it,
960 -- since the actual must be byte aligned.
962 -- Is this really necessary in all cases???
964 elsif Is_Ref_To_Bit_Packed_Array (Actual) then
965 Add_Packed_Call_By_Copy_Code;
967 -- Similarly, we have to expand slices of packed arrays here
968 -- because the result must be byte aligned.
970 elsif Is_Ref_To_Bit_Packed_Slice (Actual) then
971 Add_Call_By_Copy_Code;
973 -- Only processing remaining is to pass by copy if this is a
974 -- reference to a possibly unaligned slice, since the caller
975 -- expects an appropriately aligned argument.
977 elsif Is_Possibly_Unaligned_Slice (Actual) then
978 Add_Call_By_Copy_Code;
982 Next_Formal (Formal);
983 Next_Actual (Actual);
986 -- Find right place to put post call stuff if it is present
988 if not Is_Empty_List (Post_Call) then
990 -- If call is not a list member, it must be the triggering
991 -- statement of a triggering alternative or an entry call
992 -- alternative, and we can add the post call stuff to the
993 -- corresponding statement list.
995 if not Is_List_Member (N) then
997 P : constant Node_Id := Parent (N);
1000 pragma Assert (Nkind (P) = N_Triggering_Alternative
1001 or else Nkind (P) = N_Entry_Call_Alternative);
1003 if Is_Non_Empty_List (Statements (P)) then
1004 Insert_List_Before_And_Analyze
1005 (First (Statements (P)), Post_Call);
1007 Set_Statements (P, Post_Call);
1011 -- Otherwise, normal case where N is in a statement sequence,
1012 -- just put the post-call stuff after the call statement.
1015 Insert_Actions_After (N, Post_Call);
1019 -- The call node itself is re-analyzed in Expand_Call.
1027 -- This procedure handles expansion of function calls and procedure call
1028 -- statements (i.e. it serves as the body for Expand_N_Function_Call and
1029 -- Expand_N_Procedure_Call_Statement. Processing for calls includes:
1031 -- Replace call to Raise_Exception by Raise_Exception always if possible
1032 -- Provide values of actuals for all formals in Extra_Formals list
1033 -- Replace "call" to enumeration literal function by literal itself
1034 -- Rewrite call to predefined operator as operator
1035 -- Replace actuals to in-out parameters that are numeric conversions,
1036 -- with explicit assignment to temporaries before and after the call.
1037 -- Remove optional actuals if First_Optional_Parameter specified.
1039 -- Note that the list of actuals has been filled with default expressions
1040 -- during semantic analysis of the call. Only the extra actuals required
1041 -- for the 'Constrained attribute and for accessibility checks are added
1044 procedure Expand_Call (N : Node_Id) is
1045 Loc : constant Source_Ptr := Sloc (N);
1046 Remote : constant Boolean := Is_Remote_Call (N);
1048 Orig_Subp : Entity_Id := Empty;
1049 Parent_Subp : Entity_Id;
1050 Parent_Formal : Entity_Id;
1053 Prev : Node_Id := Empty;
1054 Prev_Orig : Node_Id;
1056 Extra_Actuals : List_Id := No_List;
1059 procedure Add_Actual_Parameter (Insert_Param : Node_Id);
1060 -- Adds one entry to the end of the actual parameter list. Used for
1061 -- default parameters and for extra actuals (for Extra_Formals).
1062 -- The argument is an N_Parameter_Association node.
1064 procedure Add_Extra_Actual (Expr : Node_Id; EF : Entity_Id);
1065 -- Adds an extra actual to the list of extra actuals. Expr
1066 -- is the expression for the value of the actual, EF is the
1067 -- entity for the extra formal.
1069 function Inherited_From_Formal (S : Entity_Id) return Entity_Id;
1070 -- Within an instance, a type derived from a non-tagged formal derived
1071 -- type inherits from the original parent, not from the actual. This is
1072 -- tested in 4723-003. The current derivation mechanism has the derived
1073 -- type inherit from the actual, which is only correct outside of the
1074 -- instance. If the subprogram is inherited, we test for this particular
1075 -- case through a convoluted tree traversal before setting the proper
1076 -- subprogram to be called.
1078 --------------------------
1079 -- Add_Actual_Parameter --
1080 --------------------------
1082 procedure Add_Actual_Parameter (Insert_Param : Node_Id) is
1083 Actual_Expr : constant Node_Id :=
1084 Explicit_Actual_Parameter (Insert_Param);
1087 -- Case of insertion is first named actual
1089 if No (Prev) or else
1090 Nkind (Parent (Prev)) /= N_Parameter_Association
1092 Set_Next_Named_Actual (Insert_Param, First_Named_Actual (N));
1093 Set_First_Named_Actual (N, Actual_Expr);
1096 if not Present (Parameter_Associations (N)) then
1097 Set_Parameter_Associations (N, New_List);
1098 Append (Insert_Param, Parameter_Associations (N));
1101 Insert_After (Prev, Insert_Param);
1104 -- Case of insertion is not first named actual
1107 Set_Next_Named_Actual
1108 (Insert_Param, Next_Named_Actual (Parent (Prev)));
1109 Set_Next_Named_Actual (Parent (Prev), Actual_Expr);
1110 Append (Insert_Param, Parameter_Associations (N));
1113 Prev := Actual_Expr;
1114 end Add_Actual_Parameter;
1116 ----------------------
1117 -- Add_Extra_Actual --
1118 ----------------------
1120 procedure Add_Extra_Actual (Expr : Node_Id; EF : Entity_Id) is
1121 Loc : constant Source_Ptr := Sloc (Expr);
1124 if Extra_Actuals = No_List then
1125 Extra_Actuals := New_List;
1126 Set_Parent (Extra_Actuals, N);
1129 Append_To (Extra_Actuals,
1130 Make_Parameter_Association (Loc,
1131 Explicit_Actual_Parameter => Expr,
1133 Make_Identifier (Loc, Chars (EF))));
1135 Analyze_And_Resolve (Expr, Etype (EF));
1136 end Add_Extra_Actual;
1138 ---------------------------
1139 -- Inherited_From_Formal --
1140 ---------------------------
1142 function Inherited_From_Formal (S : Entity_Id) return Entity_Id is
1144 Gen_Par : Entity_Id;
1145 Gen_Prim : Elist_Id;
1150 -- If the operation is inherited, it is attached to the corresponding
1151 -- type derivation. If the parent in the derivation is a generic
1152 -- actual, it is a subtype of the actual, and we have to recover the
1153 -- original derived type declaration to find the proper parent.
1155 if Nkind (Parent (S)) /= N_Full_Type_Declaration
1156 or else not Is_Derived_Type (Defining_Identifier (Parent (S)))
1157 or else Nkind (Type_Definition (Original_Node (Parent (S))))
1158 /= N_Derived_Type_Definition
1159 or else not In_Instance
1166 (Type_Definition (Original_Node (Parent (S)))));
1168 if Nkind (Indic) = N_Subtype_Indication then
1169 Par := Entity (Subtype_Mark (Indic));
1171 Par := Entity (Indic);
1175 if not Is_Generic_Actual_Type (Par)
1176 or else Is_Tagged_Type (Par)
1177 or else Nkind (Parent (Par)) /= N_Subtype_Declaration
1178 or else not In_Open_Scopes (Scope (Par))
1183 Gen_Par := Generic_Parent_Type (Parent (Par));
1186 -- If the generic parent type is still the generic type, this
1187 -- is a private formal, not a derived formal, and there are no
1188 -- operations inherited from the formal.
1190 if Nkind (Parent (Gen_Par)) = N_Formal_Type_Declaration then
1194 Gen_Prim := Collect_Primitive_Operations (Gen_Par);
1195 Elmt := First_Elmt (Gen_Prim);
1197 while Present (Elmt) loop
1198 if Chars (Node (Elmt)) = Chars (S) then
1204 F1 := First_Formal (S);
1205 F2 := First_Formal (Node (Elmt));
1208 and then Present (F2)
1211 if Etype (F1) = Etype (F2)
1212 or else Etype (F2) = Gen_Par
1218 exit; -- not the right subprogram
1230 raise Program_Error;
1231 end Inherited_From_Formal;
1233 -- Start of processing for Expand_Call
1236 -- Ignore if previous error
1238 if Nkind (N) in N_Has_Etype and then Etype (N) = Any_Type then
1242 -- Call using access to subprogram with explicit dereference
1244 if Nkind (Name (N)) = N_Explicit_Dereference then
1245 Subp := Etype (Name (N));
1246 Parent_Subp := Empty;
1248 -- Case of call to simple entry, where the Name is a selected component
1249 -- whose prefix is the task, and whose selector name is the entry name
1251 elsif Nkind (Name (N)) = N_Selected_Component then
1252 Subp := Entity (Selector_Name (Name (N)));
1253 Parent_Subp := Empty;
1255 -- Case of call to member of entry family, where Name is an indexed
1256 -- component, with the prefix being a selected component giving the
1257 -- task and entry family name, and the index being the entry index.
1259 elsif Nkind (Name (N)) = N_Indexed_Component then
1260 Subp := Entity (Selector_Name (Prefix (Name (N))));
1261 Parent_Subp := Empty;
1266 Subp := Entity (Name (N));
1267 Parent_Subp := Alias (Subp);
1269 -- Replace call to Raise_Exception by call to Raise_Exception_Always
1270 -- if we can tell that the first parameter cannot possibly be null.
1271 -- This helps optimization and also generation of warnings.
1273 if not Restriction_Active (No_Exception_Handlers)
1274 and then Is_RTE (Subp, RE_Raise_Exception)
1277 FA : constant Node_Id := Original_Node (First_Actual (N));
1280 -- The case we catch is where the first argument is obtained
1281 -- using the Identity attribute (which must always be non-null)
1283 if Nkind (FA) = N_Attribute_Reference
1284 and then Attribute_Name (FA) = Name_Identity
1286 Subp := RTE (RE_Raise_Exception_Always);
1287 Set_Entity (Name (N), Subp);
1292 if Ekind (Subp) = E_Entry then
1293 Parent_Subp := Empty;
1297 -- First step, compute extra actuals, corresponding to any
1298 -- Extra_Formals present. Note that we do not access Extra_Formals
1299 -- directly, instead we simply note the presence of the extra
1300 -- formals as we process the regular formals and collect the
1301 -- corresponding actuals in Extra_Actuals.
1303 -- We also generate any required range checks for actuals as we go
1304 -- through the loop, since this is a convenient place to do this.
1306 Formal := First_Formal (Subp);
1307 Actual := First_Actual (N);
1308 while Present (Formal) loop
1310 -- Generate range check if required (not activated yet ???)
1312 -- if Do_Range_Check (Actual) then
1313 -- Set_Do_Range_Check (Actual, False);
1314 -- Generate_Range_Check
1315 -- (Actual, Etype (Formal), CE_Range_Check_Failed);
1318 -- Prepare to examine current entry
1321 Prev_Orig := Original_Node (Prev);
1323 -- Create possible extra actual for constrained case. Usually,
1324 -- the extra actual is of the form actual'constrained, but since
1325 -- this attribute is only available for unconstrained records,
1326 -- TRUE is expanded if the type of the formal happens to be
1327 -- constrained (for instance when this procedure is inherited
1328 -- from an unconstrained record to a constrained one) or if the
1329 -- actual has no discriminant (its type is constrained). An
1330 -- exception to this is the case of a private type without
1331 -- discriminants. In this case we pass FALSE because the
1332 -- object has underlying discriminants with defaults.
1334 if Present (Extra_Constrained (Formal)) then
1335 if Ekind (Etype (Prev)) in Private_Kind
1336 and then not Has_Discriminants (Base_Type (Etype (Prev)))
1339 New_Occurrence_Of (Standard_False, Loc),
1340 Extra_Constrained (Formal));
1342 elsif Is_Constrained (Etype (Formal))
1343 or else not Has_Discriminants (Etype (Prev))
1346 New_Occurrence_Of (Standard_True, Loc),
1347 Extra_Constrained (Formal));
1350 -- If the actual is a type conversion, then the constrained
1351 -- test applies to the actual, not the target type.
1354 Act_Prev : Node_Id := Prev;
1357 -- Test for unchecked conversions as well, which can
1358 -- occur as out parameter actuals on calls to stream
1361 while Nkind (Act_Prev) = N_Type_Conversion
1362 or else Nkind (Act_Prev) = N_Unchecked_Type_Conversion
1364 Act_Prev := Expression (Act_Prev);
1368 Make_Attribute_Reference (Sloc (Prev),
1370 Duplicate_Subexpr_No_Checks
1371 (Act_Prev, Name_Req => True),
1372 Attribute_Name => Name_Constrained),
1373 Extra_Constrained (Formal));
1378 -- Create possible extra actual for accessibility level
1380 if Present (Extra_Accessibility (Formal)) then
1381 if Is_Entity_Name (Prev_Orig) then
1383 -- When passing an access parameter as the actual to another
1384 -- access parameter we need to pass along the actual's own
1385 -- associated access level parameter. This is done if we are
1386 -- in the scope of the formal access parameter (if this is an
1387 -- inlined body the extra formal is irrelevant).
1389 if Ekind (Entity (Prev_Orig)) in Formal_Kind
1390 and then Ekind (Etype (Prev_Orig)) = E_Anonymous_Access_Type
1391 and then In_Open_Scopes (Scope (Entity (Prev_Orig)))
1394 Parm_Ent : constant Entity_Id := Param_Entity (Prev_Orig);
1397 pragma Assert (Present (Parm_Ent));
1399 if Present (Extra_Accessibility (Parm_Ent)) then
1402 (Extra_Accessibility (Parm_Ent), Loc),
1403 Extra_Accessibility (Formal));
1405 -- If the actual access parameter does not have an
1406 -- associated extra formal providing its scope level,
1407 -- then treat the actual as having library-level
1412 Make_Integer_Literal (Loc,
1413 Intval => Scope_Depth (Standard_Standard)),
1414 Extra_Accessibility (Formal));
1418 -- The actual is a normal access value, so just pass the
1419 -- level of the actual's access type.
1423 Make_Integer_Literal (Loc,
1424 Intval => Type_Access_Level (Etype (Prev_Orig))),
1425 Extra_Accessibility (Formal));
1429 case Nkind (Prev_Orig) is
1431 when N_Attribute_Reference =>
1433 case Get_Attribute_Id (Attribute_Name (Prev_Orig)) is
1435 -- For X'Access, pass on the level of the prefix X
1437 when Attribute_Access =>
1439 Make_Integer_Literal (Loc,
1441 Object_Access_Level (Prefix (Prev_Orig))),
1442 Extra_Accessibility (Formal));
1444 -- Treat the unchecked attributes as library-level
1446 when Attribute_Unchecked_Access |
1447 Attribute_Unrestricted_Access =>
1449 Make_Integer_Literal (Loc,
1450 Intval => Scope_Depth (Standard_Standard)),
1451 Extra_Accessibility (Formal));
1453 -- No other cases of attributes returning access
1454 -- values that can be passed to access parameters
1457 raise Program_Error;
1461 -- For allocators we pass the level of the execution of
1462 -- the called subprogram, which is one greater than the
1463 -- current scope level.
1467 Make_Integer_Literal (Loc,
1468 Scope_Depth (Current_Scope) + 1),
1469 Extra_Accessibility (Formal));
1471 -- For other cases we simply pass the level of the
1472 -- actual's access type.
1476 Make_Integer_Literal (Loc,
1477 Intval => Type_Access_Level (Etype (Prev_Orig))),
1478 Extra_Accessibility (Formal));
1484 -- Perform the check of 4.6(49) that prevents a null value
1485 -- from being passed as an actual to an access parameter.
1486 -- Note that the check is elided in the common cases of
1487 -- passing an access attribute or access parameter as an
1488 -- actual. Also, we currently don't enforce this check for
1489 -- expander-generated actuals and when -gnatdj is set.
1491 if Ekind (Etype (Formal)) /= E_Anonymous_Access_Type
1492 or else Access_Checks_Suppressed (Subp)
1496 elsif Debug_Flag_J then
1499 elsif not Comes_From_Source (Prev) then
1502 elsif Is_Entity_Name (Prev)
1503 and then Ekind (Etype (Prev)) = E_Anonymous_Access_Type
1507 elsif Nkind (Prev) = N_Allocator
1508 or else Nkind (Prev) = N_Attribute_Reference
1512 -- Suppress null checks when passing to access parameters
1513 -- of Java subprograms. (Should this be done for other
1514 -- foreign conventions as well ???)
1516 elsif Convention (Subp) = Convention_Java then
1519 -- Ada 0Y (AI-231): do not force the check in case of Ada 0Y unless
1520 -- it is a null-excluding type
1522 elsif not Extensions_Allowed
1523 or else Can_Never_Be_Null (Etype (Prev))
1527 Left_Opnd => Duplicate_Subexpr_No_Checks (Prev),
1528 Right_Opnd => Make_Null (Loc));
1529 Insert_Action (Prev,
1530 Make_Raise_Constraint_Error (Loc,
1532 Reason => CE_Access_Parameter_Is_Null));
1535 -- Perform appropriate validity checks on parameters that
1538 if Validity_Checks_On then
1539 if Ekind (Formal) = E_In_Parameter
1540 and then Validity_Check_In_Params
1542 -- If the actual is an indexed component of a packed
1543 -- type, it has not been expanded yet. It will be
1544 -- copied in the validity code that follows, and has
1545 -- to be expanded appropriately, so reanalyze it.
1547 if Nkind (Actual) = N_Indexed_Component then
1548 Set_Analyzed (Actual, False);
1551 Ensure_Valid (Actual);
1553 elsif Ekind (Formal) = E_In_Out_Parameter
1554 and then Validity_Check_In_Out_Params
1556 Ensure_Valid (Actual);
1560 -- For IN OUT and OUT parameters, ensure that subscripts are valid
1561 -- since this is a left side reference. We only do this for calls
1562 -- from the source program since we assume that compiler generated
1563 -- calls explicitly generate any required checks. We also need it
1564 -- only if we are doing standard validity checks, since clearly it
1565 -- is not needed if validity checks are off, and in subscript
1566 -- validity checking mode, all indexed components are checked with
1567 -- a call directly from Expand_N_Indexed_Component.
1569 if Comes_From_Source (N)
1570 and then Ekind (Formal) /= E_In_Parameter
1571 and then Validity_Checks_On
1572 and then Validity_Check_Default
1573 and then not Validity_Check_Subscripts
1575 Check_Valid_Lvalue_Subscripts (Actual);
1578 -- Mark any scalar OUT parameter that is a simple variable
1579 -- as no longer known to be valid (unless the type is always
1580 -- valid). This reflects the fact that if an OUT parameter
1581 -- is never set in a procedure, then it can become invalid
1582 -- on return from the procedure.
1584 if Ekind (Formal) = E_Out_Parameter
1585 and then Is_Entity_Name (Actual)
1586 and then Ekind (Entity (Actual)) = E_Variable
1587 and then not Is_Known_Valid (Etype (Actual))
1589 Set_Is_Known_Valid (Entity (Actual), False);
1592 -- For an OUT or IN OUT parameter of an access type, if the
1593 -- actual is an entity, then it is no longer known to be non-null.
1595 if Ekind (Formal) /= E_In_Parameter
1596 and then Is_Entity_Name (Actual)
1597 and then Is_Access_Type (Etype (Actual))
1599 Set_Is_Known_Non_Null (Entity (Actual), False);
1602 -- If the formal is class wide and the actual is an aggregate, force
1603 -- evaluation so that the back end who does not know about class-wide
1604 -- type, does not generate a temporary of the wrong size.
1606 if not Is_Class_Wide_Type (Etype (Formal)) then
1609 elsif Nkind (Actual) = N_Aggregate
1610 or else (Nkind (Actual) = N_Qualified_Expression
1611 and then Nkind (Expression (Actual)) = N_Aggregate)
1613 Force_Evaluation (Actual);
1616 -- In a remote call, if the formal is of a class-wide type, check
1617 -- that the actual meets the requirements described in E.4(18).
1620 and then Is_Class_Wide_Type (Etype (Formal))
1622 Insert_Action (Actual,
1623 Make_Implicit_If_Statement (N,
1626 Get_Remotely_Callable
1627 (Duplicate_Subexpr_Move_Checks (Actual))),
1628 Then_Statements => New_List (
1629 Make_Raise_Program_Error (Loc,
1630 Reason => PE_Illegal_RACW_E_4_18))));
1633 Next_Actual (Actual);
1634 Next_Formal (Formal);
1637 -- If we are expanding a rhs of an assignement we need to check if
1638 -- tag propagation is needed. This code belongs theorically in Analyze
1639 -- Assignment but has to be done earlier (bottom-up) because the
1640 -- assignment might be transformed into a declaration for an uncons-
1641 -- trained value, if the expression is classwide.
1643 if Nkind (N) = N_Function_Call
1644 and then Is_Tag_Indeterminate (N)
1645 and then Is_Entity_Name (Name (N))
1648 Ass : Node_Id := Empty;
1651 if Nkind (Parent (N)) = N_Assignment_Statement then
1654 elsif Nkind (Parent (N)) = N_Qualified_Expression
1655 and then Nkind (Parent (Parent (N))) = N_Assignment_Statement
1657 Ass := Parent (Parent (N));
1661 and then Is_Class_Wide_Type (Etype (Name (Ass)))
1663 if Etype (N) /= Root_Type (Etype (Name (Ass))) then
1665 ("tag-indeterminate expression must have type&"
1666 & "('R'M 5.2 (6))", N, Root_Type (Etype (Name (Ass))));
1668 Propagate_Tag (Name (Ass), N);
1671 -- The call will be rewritten as a dispatching call, and
1672 -- expanded as such.
1679 -- Deals with Dispatch_Call if we still have a call, before expanding
1680 -- extra actuals since this will be done on the re-analysis of the
1681 -- dispatching call. Note that we do not try to shorten the actual
1682 -- list for a dispatching call, it would not make sense to do so.
1683 -- Expansion of dispatching calls is suppressed when Java_VM, because
1684 -- the JVM back end directly handles the generation of dispatching
1685 -- calls and would have to undo any expansion to an indirect call.
1687 if (Nkind (N) = N_Function_Call
1688 or else Nkind (N) = N_Procedure_Call_Statement)
1689 and then Present (Controlling_Argument (N))
1690 and then not Java_VM
1692 Expand_Dispatch_Call (N);
1694 -- The following return is worrisome. Is it really OK to
1695 -- skip all remaining processing in this procedure ???
1699 -- Similarly, expand calls to RCI subprograms on which pragma
1700 -- All_Calls_Remote applies. The rewriting will be reanalyzed
1701 -- later. Do this only when the call comes from source since we do
1702 -- not want such a rewritting to occur in expanded code.
1704 elsif Is_All_Remote_Call (N) then
1705 Expand_All_Calls_Remote_Subprogram_Call (N);
1707 -- Similarly, do not add extra actuals for an entry call whose entity
1708 -- is a protected procedure, or for an internal protected subprogram
1709 -- call, because it will be rewritten as a protected subprogram call
1710 -- and reanalyzed (see Expand_Protected_Subprogram_Call).
1712 elsif Is_Protected_Type (Scope (Subp))
1713 and then (Ekind (Subp) = E_Procedure
1714 or else Ekind (Subp) = E_Function)
1718 -- During that loop we gathered the extra actuals (the ones that
1719 -- correspond to Extra_Formals), so now they can be appended.
1722 while Is_Non_Empty_List (Extra_Actuals) loop
1723 Add_Actual_Parameter (Remove_Head (Extra_Actuals));
1727 if Ekind (Subp) = E_Procedure
1728 or else (Ekind (Subp) = E_Subprogram_Type
1729 and then Etype (Subp) = Standard_Void_Type)
1730 or else Is_Entry (Subp)
1732 Expand_Actuals (N, Subp);
1735 -- If the subprogram is a renaming, or if it is inherited, replace it
1736 -- in the call with the name of the actual subprogram being called.
1737 -- If this is a dispatching call, the run-time decides what to call.
1738 -- The Alias attribute does not apply to entries.
1740 if Nkind (N) /= N_Entry_Call_Statement
1741 and then No (Controlling_Argument (N))
1742 and then Present (Parent_Subp)
1744 if Present (Inherited_From_Formal (Subp)) then
1745 Parent_Subp := Inherited_From_Formal (Subp);
1747 while Present (Alias (Parent_Subp)) loop
1748 Parent_Subp := Alias (Parent_Subp);
1752 Set_Entity (Name (N), Parent_Subp);
1754 if Is_Abstract (Parent_Subp)
1755 and then not In_Instance
1758 ("cannot call abstract subprogram &!", Name (N), Parent_Subp);
1761 -- Add an explicit conversion for parameter of the derived type.
1762 -- This is only done for scalar and access in-parameters. Others
1763 -- have been expanded in expand_actuals.
1765 Formal := First_Formal (Subp);
1766 Parent_Formal := First_Formal (Parent_Subp);
1767 Actual := First_Actual (N);
1769 -- It is not clear that conversion is needed for intrinsic
1770 -- subprograms, but it certainly is for those that are user-
1771 -- defined, and that can be inherited on derivation, namely
1772 -- unchecked conversion and deallocation.
1773 -- General case needs study ???
1775 if not Is_Intrinsic_Subprogram (Parent_Subp)
1776 or else Is_Generic_Instance (Parent_Subp)
1778 while Present (Formal) loop
1780 if Etype (Formal) /= Etype (Parent_Formal)
1781 and then Is_Scalar_Type (Etype (Formal))
1782 and then Ekind (Formal) = E_In_Parameter
1783 and then not Raises_Constraint_Error (Actual)
1786 OK_Convert_To (Etype (Parent_Formal),
1787 Relocate_Node (Actual)));
1790 Resolve (Actual, Etype (Parent_Formal));
1791 Enable_Range_Check (Actual);
1793 elsif Is_Access_Type (Etype (Formal))
1794 and then Base_Type (Etype (Parent_Formal))
1795 /= Base_Type (Etype (Actual))
1797 if Ekind (Formal) /= E_In_Parameter then
1799 Convert_To (Etype (Parent_Formal),
1800 Relocate_Node (Actual)));
1803 Resolve (Actual, Etype (Parent_Formal));
1806 Ekind (Etype (Parent_Formal)) = E_Anonymous_Access_Type
1807 and then Designated_Type (Etype (Parent_Formal))
1809 Designated_Type (Etype (Actual))
1810 and then not Is_Controlling_Formal (Formal)
1812 -- This unchecked conversion is not necessary unless
1813 -- inlining is enabled, because in that case the type
1814 -- mismatch may become visible in the body about to be
1818 Unchecked_Convert_To (Etype (Parent_Formal),
1819 Relocate_Node (Actual)));
1822 Resolve (Actual, Etype (Parent_Formal));
1826 Next_Formal (Formal);
1827 Next_Formal (Parent_Formal);
1828 Next_Actual (Actual);
1833 Subp := Parent_Subp;
1836 -- Check for violation of No_Abort_Statements
1838 if Is_RTE (Subp, RE_Abort_Task) then
1839 Check_Restriction (No_Abort_Statements, N);
1841 -- Check for violation of No_Dynamic_Attachment
1843 elsif RTU_Loaded (Ada_Interrupts)
1844 and then (Is_RTE (Subp, RE_Is_Reserved) or else
1845 Is_RTE (Subp, RE_Is_Attached) or else
1846 Is_RTE (Subp, RE_Current_Handler) or else
1847 Is_RTE (Subp, RE_Attach_Handler) or else
1848 Is_RTE (Subp, RE_Exchange_Handler) or else
1849 Is_RTE (Subp, RE_Detach_Handler) or else
1850 Is_RTE (Subp, RE_Reference))
1852 Check_Restriction (No_Dynamic_Attachment, N);
1855 -- Deal with case where call is an explicit dereference
1857 if Nkind (Name (N)) = N_Explicit_Dereference then
1859 -- Handle case of access to protected subprogram type
1861 if Ekind (Base_Type (Etype (Prefix (Name (N))))) =
1862 E_Access_Protected_Subprogram_Type
1864 -- If this is a call through an access to protected operation,
1865 -- the prefix has the form (object'address, operation'access).
1866 -- Rewrite as a for other protected calls: the object is the
1867 -- first parameter of the list of actuals.
1874 Ptr : constant Node_Id := Prefix (Name (N));
1876 T : constant Entity_Id :=
1877 Equivalent_Type (Base_Type (Etype (Ptr)));
1879 D_T : constant Entity_Id :=
1880 Designated_Type (Base_Type (Etype (Ptr)));
1883 Obj := Make_Selected_Component (Loc,
1884 Prefix => Unchecked_Convert_To (T, Ptr),
1885 Selector_Name => New_Occurrence_Of (First_Entity (T), Loc));
1887 Nam := Make_Selected_Component (Loc,
1888 Prefix => Unchecked_Convert_To (T, Ptr),
1889 Selector_Name => New_Occurrence_Of (
1890 Next_Entity (First_Entity (T)), Loc));
1892 Nam := Make_Explicit_Dereference (Loc, Nam);
1894 if Present (Parameter_Associations (N)) then
1895 Parm := Parameter_Associations (N);
1900 Prepend (Obj, Parm);
1902 if Etype (D_T) = Standard_Void_Type then
1903 Call := Make_Procedure_Call_Statement (Loc,
1905 Parameter_Associations => Parm);
1907 Call := Make_Function_Call (Loc,
1909 Parameter_Associations => Parm);
1912 Set_First_Named_Actual (Call, First_Named_Actual (N));
1913 Set_Etype (Call, Etype (D_T));
1915 -- We do not re-analyze the call to avoid infinite recursion.
1916 -- We analyze separately the prefix and the object, and set
1917 -- the checks on the prefix that would otherwise be emitted
1918 -- when resolving a call.
1922 Apply_Access_Check (Nam);
1929 -- If this is a call to an intrinsic subprogram, then perform the
1930 -- appropriate expansion to the corresponding tree node and we
1931 -- are all done (since after that the call is gone!)
1933 if Is_Intrinsic_Subprogram (Subp) then
1934 Expand_Intrinsic_Call (N, Subp);
1938 if Ekind (Subp) = E_Function
1939 or else Ekind (Subp) = E_Procedure
1941 if Is_Inlined (Subp) then
1943 Inlined_Subprogram : declare
1945 Must_Inline : Boolean := False;
1946 Spec : constant Node_Id := Unit_Declaration_Node (Subp);
1947 Scop : constant Entity_Id := Scope (Subp);
1949 function In_Unfrozen_Instance return Boolean;
1950 -- If the subprogram comes from an instance in the same
1951 -- unit, and the instance is not yet frozen, inlining might
1952 -- trigger order-of-elaboration problems in gigi.
1954 --------------------------
1955 -- In_Unfrozen_Instance --
1956 --------------------------
1958 function In_Unfrozen_Instance return Boolean is
1959 S : Entity_Id := Scop;
1963 and then S /= Standard_Standard
1965 if Is_Generic_Instance (S)
1966 and then Present (Freeze_Node (S))
1967 and then not Analyzed (Freeze_Node (S))
1976 end In_Unfrozen_Instance;
1978 -- Start of processing for Inlined_Subprogram
1981 -- Verify that the body to inline has already been seen,
1982 -- and that if the body is in the current unit the inlining
1983 -- does not occur earlier. This avoids order-of-elaboration
1984 -- problems in gigi.
1987 or else Nkind (Spec) /= N_Subprogram_Declaration
1988 or else No (Body_To_Inline (Spec))
1990 Must_Inline := False;
1992 -- If this an inherited function that returns a private
1993 -- type, do not inline if the full view is an unconstrained
1994 -- array, because such calls cannot be inlined.
1996 elsif Present (Orig_Subp)
1997 and then Is_Array_Type (Etype (Orig_Subp))
1998 and then not Is_Constrained (Etype (Orig_Subp))
2000 Must_Inline := False;
2002 elsif In_Unfrozen_Instance then
2003 Must_Inline := False;
2006 Bod := Body_To_Inline (Spec);
2008 if (In_Extended_Main_Code_Unit (N)
2009 or else In_Extended_Main_Code_Unit (Parent (N))
2010 or else Is_Always_Inlined (Subp))
2011 and then (not In_Same_Extended_Unit (Sloc (Bod), Loc)
2013 Earlier_In_Extended_Unit (Sloc (Bod), Loc))
2015 Must_Inline := True;
2017 -- If we are compiling a package body that is not the main
2018 -- unit, it must be for inlining/instantiation purposes,
2019 -- in which case we inline the call to insure that the same
2020 -- temporaries are generated when compiling the body by
2021 -- itself. Otherwise link errors can occur.
2023 -- If the function being called is itself in the main unit,
2024 -- we cannot inline, because there is a risk of double
2025 -- elaboration and/or circularity: the inlining can make
2026 -- visible a private entity in the body of the main unit,
2027 -- that gigi will see before its sees its proper definition.
2029 elsif not (In_Extended_Main_Code_Unit (N))
2030 and then In_Package_Body
2032 Must_Inline := not In_Extended_Main_Source_Unit (Subp);
2037 Expand_Inlined_Call (N, Subp, Orig_Subp);
2040 -- Let the back end handle it
2042 Add_Inlined_Body (Subp);
2044 if Front_End_Inlining
2045 and then Nkind (Spec) = N_Subprogram_Declaration
2046 and then (In_Extended_Main_Code_Unit (N))
2047 and then No (Body_To_Inline (Spec))
2048 and then not Has_Completion (Subp)
2049 and then In_Same_Extended_Unit (Sloc (Spec), Loc)
2052 ("cannot inline& (body not seen yet)?",
2056 end Inlined_Subprogram;
2060 -- Check for a protected subprogram. This is either an intra-object
2061 -- call, or a protected function call. Protected procedure calls are
2062 -- rewritten as entry calls and handled accordingly.
2064 Scop := Scope (Subp);
2066 if Nkind (N) /= N_Entry_Call_Statement
2067 and then Is_Protected_Type (Scop)
2069 -- If the call is an internal one, it is rewritten as a call to
2070 -- to the corresponding unprotected subprogram.
2072 Expand_Protected_Subprogram_Call (N, Subp, Scop);
2075 -- Functions returning controlled objects need special attention
2077 if Controlled_Type (Etype (Subp))
2078 and then not Is_Return_By_Reference_Type (Etype (Subp))
2080 Expand_Ctrl_Function_Call (N);
2083 -- Test for First_Optional_Parameter, and if so, truncate parameter
2084 -- list if there are optional parameters at the trailing end.
2085 -- Note we never delete procedures for call via a pointer.
2087 if (Ekind (Subp) = E_Procedure or else Ekind (Subp) = E_Function)
2088 and then Present (First_Optional_Parameter (Subp))
2091 Last_Keep_Arg : Node_Id;
2094 -- Last_Keep_Arg will hold the last actual that should be
2095 -- retained. If it remains empty at the end, it means that
2096 -- all parameters are optional.
2098 Last_Keep_Arg := Empty;
2100 -- Find first optional parameter, must be present since we
2101 -- checked the validity of the parameter before setting it.
2103 Formal := First_Formal (Subp);
2104 Actual := First_Actual (N);
2105 while Formal /= First_Optional_Parameter (Subp) loop
2106 Last_Keep_Arg := Actual;
2107 Next_Formal (Formal);
2108 Next_Actual (Actual);
2111 -- We have Formal and Actual pointing to the first potentially
2112 -- droppable argument. We can drop all the trailing arguments
2113 -- whose actual matches the default. Note that we know that all
2114 -- remaining formals have defaults, because we checked that this
2115 -- requirement was met before setting First_Optional_Parameter.
2117 -- We use Fully_Conformant_Expressions to check for identity
2118 -- between formals and actuals, which may miss some cases, but
2119 -- on the other hand, this is only an optimization (if we fail
2120 -- to truncate a parameter it does not affect functionality).
2121 -- So if the default is 3 and the actual is 1+2, we consider
2122 -- them unequal, which hardly seems worrisome.
2124 while Present (Formal) loop
2125 if not Fully_Conformant_Expressions
2126 (Actual, Default_Value (Formal))
2128 Last_Keep_Arg := Actual;
2131 Next_Formal (Formal);
2132 Next_Actual (Actual);
2135 -- If no arguments, delete entire list, this is the easy case
2137 if No (Last_Keep_Arg) then
2138 while Is_Non_Empty_List (Parameter_Associations (N)) loop
2139 Delete_Tree (Remove_Head (Parameter_Associations (N)));
2142 Set_Parameter_Associations (N, No_List);
2143 Set_First_Named_Actual (N, Empty);
2145 -- Case where at the last retained argument is positional. This
2146 -- is also an easy case, since the retained arguments are already
2147 -- in the right form, and we don't need to worry about the order
2148 -- of arguments that get eliminated.
2150 elsif Is_List_Member (Last_Keep_Arg) then
2151 while Present (Next (Last_Keep_Arg)) loop
2152 Delete_Tree (Remove_Next (Last_Keep_Arg));
2155 Set_First_Named_Actual (N, Empty);
2157 -- This is the annoying case where the last retained argument
2158 -- is a named parameter. Since the original arguments are not
2159 -- in declaration order, we may have to delete some fairly
2160 -- random collection of arguments.
2168 pragma Warnings (Off, Discard);
2171 -- First step, remove all the named parameters from the
2172 -- list (they are still chained using First_Named_Actual
2173 -- and Next_Named_Actual, so we have not lost them!)
2175 Temp := First (Parameter_Associations (N));
2177 -- Case of all parameters named, remove them all
2179 if Nkind (Temp) = N_Parameter_Association then
2180 while Is_Non_Empty_List (Parameter_Associations (N)) loop
2181 Temp := Remove_Head (Parameter_Associations (N));
2184 -- Case of mixed positional/named, remove named parameters
2187 while Nkind (Next (Temp)) /= N_Parameter_Association loop
2191 while Present (Next (Temp)) loop
2192 Discard := Remove_Next (Temp);
2196 -- Now we loop through the named parameters, till we get
2197 -- to the last one to be retained, adding them to the list.
2198 -- Note that the Next_Named_Actual list does not need to be
2199 -- touched since we are only reordering them on the actual
2200 -- parameter association list.
2202 Passoc := Parent (First_Named_Actual (N));
2204 Temp := Relocate_Node (Passoc);
2206 (Parameter_Associations (N), Temp);
2208 Last_Keep_Arg = Explicit_Actual_Parameter (Passoc);
2209 Passoc := Parent (Next_Named_Actual (Passoc));
2212 Set_Next_Named_Actual (Temp, Empty);
2215 Temp := Next_Named_Actual (Passoc);
2216 exit when No (Temp);
2217 Set_Next_Named_Actual
2218 (Passoc, Next_Named_Actual (Parent (Temp)));
2227 --------------------------
2228 -- Expand_Inlined_Call --
2229 --------------------------
2231 procedure Expand_Inlined_Call
2234 Orig_Subp : Entity_Id)
2236 Loc : constant Source_Ptr := Sloc (N);
2237 Is_Predef : constant Boolean :=
2238 Is_Predefined_File_Name
2239 (Unit_File_Name (Get_Source_Unit (Subp)));
2240 Orig_Bod : constant Node_Id :=
2241 Body_To_Inline (Unit_Declaration_Node (Subp));
2246 Exit_Lab : Entity_Id := Empty;
2253 Ret_Type : Entity_Id;
2256 Temp_Typ : Entity_Id;
2258 procedure Make_Exit_Label;
2259 -- Build declaration for exit label to be used in Return statements.
2261 function Process_Formals (N : Node_Id) return Traverse_Result;
2262 -- Replace occurrence of a formal with the corresponding actual, or
2263 -- the thunk generated for it.
2265 function Process_Sloc (Nod : Node_Id) return Traverse_Result;
2266 -- If the call being expanded is that of an internal subprogram,
2267 -- set the sloc of the generated block to that of the call itself,
2268 -- so that the expansion is skipped by the -next- command in gdb.
2269 -- Same processing for a subprogram in a predefined file, e.g.
2270 -- Ada.Tags. If Debug_Generated_Code is true, suppress this change
2271 -- to simplify our own development.
2273 procedure Rewrite_Function_Call (N : Node_Id; Blk : Node_Id);
2274 -- If the function body is a single expression, replace call with
2275 -- expression, else insert block appropriately.
2277 procedure Rewrite_Procedure_Call (N : Node_Id; Blk : Node_Id);
2278 -- If procedure body has no local variables, inline body without
2279 -- creating block, otherwise rewrite call with block.
2281 ---------------------
2282 -- Make_Exit_Label --
2283 ---------------------
2285 procedure Make_Exit_Label is
2287 -- Create exit label for subprogram, if one doesn't exist yet.
2289 if No (Exit_Lab) then
2290 Lab_Id := Make_Identifier (Loc, New_Internal_Name ('L'));
2292 Make_Defining_Identifier (Loc, Chars (Lab_Id)));
2293 Exit_Lab := Make_Label (Loc, Lab_Id);
2296 Make_Implicit_Label_Declaration (Loc,
2297 Defining_Identifier => Entity (Lab_Id),
2298 Label_Construct => Exit_Lab);
2300 end Make_Exit_Label;
2302 ---------------------
2303 -- Process_Formals --
2304 ---------------------
2306 function Process_Formals (N : Node_Id) return Traverse_Result is
2312 if Is_Entity_Name (N)
2313 and then Present (Entity (N))
2318 and then Scope (E) = Subp
2320 A := Renamed_Object (E);
2322 if Is_Entity_Name (A) then
2323 Rewrite (N, New_Occurrence_Of (Entity (A), Loc));
2325 elsif Nkind (A) = N_Defining_Identifier then
2326 Rewrite (N, New_Occurrence_Of (A, Loc));
2328 else -- numeric literal
2329 Rewrite (N, New_Copy (A));
2335 elsif Nkind (N) = N_Return_Statement then
2337 if No (Expression (N)) then
2339 Rewrite (N, Make_Goto_Statement (Loc,
2340 Name => New_Copy (Lab_Id)));
2343 if Nkind (Parent (N)) = N_Handled_Sequence_Of_Statements
2344 and then Nkind (Parent (Parent (N))) = N_Subprogram_Body
2346 -- Function body is a single expression. No need for
2352 Num_Ret := Num_Ret + 1;
2356 -- Because of the presence of private types, the views of the
2357 -- expression and the context may be different, so place an
2358 -- unchecked conversion to the context type to avoid spurious
2359 -- errors, eg. when the expression is a numeric literal and
2360 -- the context is private. If the expression is an aggregate,
2361 -- use a qualified expression, because an aggregate is not a
2362 -- legal argument of a conversion.
2364 if Nkind (Expression (N)) = N_Aggregate
2365 or else Nkind (Expression (N)) = N_Null
2368 Make_Qualified_Expression (Sloc (N),
2369 Subtype_Mark => New_Occurrence_Of (Ret_Type, Sloc (N)),
2370 Expression => Relocate_Node (Expression (N)));
2373 Unchecked_Convert_To
2374 (Ret_Type, Relocate_Node (Expression (N)));
2377 if Nkind (Targ) = N_Defining_Identifier then
2379 Make_Assignment_Statement (Loc,
2380 Name => New_Occurrence_Of (Targ, Loc),
2381 Expression => Ret));
2384 Make_Assignment_Statement (Loc,
2385 Name => New_Copy (Targ),
2386 Expression => Ret));
2389 Set_Assignment_OK (Name (N));
2391 if Present (Exit_Lab) then
2393 Make_Goto_Statement (Loc,
2394 Name => New_Copy (Lab_Id)));
2400 -- Remove pragma Unreferenced since it may refer to formals that
2401 -- are not visible in the inlined body, and in any case we will
2402 -- not be posting warnings on the inlined body so it is unneeded.
2404 elsif Nkind (N) = N_Pragma
2405 and then Chars (N) = Name_Unreferenced
2407 Rewrite (N, Make_Null_Statement (Sloc (N)));
2413 end Process_Formals;
2415 procedure Replace_Formals is new Traverse_Proc (Process_Formals);
2421 function Process_Sloc (Nod : Node_Id) return Traverse_Result is
2423 if not Debug_Generated_Code then
2424 Set_Sloc (Nod, Sloc (N));
2425 Set_Comes_From_Source (Nod, False);
2431 procedure Reset_Slocs is new Traverse_Proc (Process_Sloc);
2433 ---------------------------
2434 -- Rewrite_Function_Call --
2435 ---------------------------
2437 procedure Rewrite_Function_Call (N : Node_Id; Blk : Node_Id) is
2438 HSS : constant Node_Id := Handled_Statement_Sequence (Blk);
2439 Fst : constant Node_Id := First (Statements (HSS));
2442 -- Optimize simple case: function body is a single return statement,
2443 -- which has been expanded into an assignment.
2445 if Is_Empty_List (Declarations (Blk))
2446 and then Nkind (Fst) = N_Assignment_Statement
2447 and then No (Next (Fst))
2450 -- The function call may have been rewritten as the temporary
2451 -- that holds the result of the call, in which case remove the
2452 -- now useless declaration.
2454 if Nkind (N) = N_Identifier
2455 and then Nkind (Parent (Entity (N))) = N_Object_Declaration
2457 Rewrite (Parent (Entity (N)), Make_Null_Statement (Loc));
2460 Rewrite (N, Expression (Fst));
2462 elsif Nkind (N) = N_Identifier
2463 and then Nkind (Parent (Entity (N))) = N_Object_Declaration
2466 -- The block assigns the result of the call to the temporary.
2468 Insert_After (Parent (Entity (N)), Blk);
2470 elsif Nkind (Parent (N)) = N_Assignment_Statement
2471 and then Is_Entity_Name (Name (Parent (N)))
2474 -- Replace assignment with the block
2477 Original_Assignment : constant Node_Id := Parent (N);
2480 -- Preserve the original assignment node to keep the
2481 -- complete assignment subtree consistent enough for
2482 -- Analyze_Assignment to proceed (specifically, the
2483 -- original Lhs node must still have an assignment
2484 -- statement as its parent).
2486 -- We cannot rely on Original_Node to go back from the
2487 -- block node to the assignment node, because the
2488 -- assignment might already be a rewrite substitution.
2490 Discard_Node (Relocate_Node (Original_Assignment));
2491 Rewrite (Original_Assignment, Blk);
2494 elsif Nkind (Parent (N)) = N_Object_Declaration then
2495 Set_Expression (Parent (N), Empty);
2496 Insert_After (Parent (N), Blk);
2498 end Rewrite_Function_Call;
2500 ----------------------------
2501 -- Rewrite_Procedure_Call --
2502 ----------------------------
2504 procedure Rewrite_Procedure_Call (N : Node_Id; Blk : Node_Id) is
2505 HSS : constant Node_Id := Handled_Statement_Sequence (Blk);
2507 if Is_Empty_List (Declarations (Blk)) then
2508 Insert_List_After (N, Statements (HSS));
2509 Rewrite (N, Make_Null_Statement (Loc));
2513 end Rewrite_Procedure_Call;
2515 -- Start of processing for Expand_Inlined_Call
2518 -- Check for special case of To_Address call, and if so, just
2519 -- do an unchecked conversion instead of expanding the call.
2520 -- Not only is this more efficient, but it also avoids a
2521 -- problem with order of elaboration when address clauses
2522 -- are inlined (address expr elaborated at wrong point).
2524 if Subp = RTE (RE_To_Address) then
2526 Unchecked_Convert_To
2528 Relocate_Node (First_Actual (N))));
2532 if Nkind (Orig_Bod) = N_Defining_Identifier then
2534 -- Subprogram is a renaming_as_body. Calls appearing after the
2535 -- renaming can be replaced with calls to the renamed entity
2536 -- directly, because the subprograms are subtype conformant.
2538 Set_Name (N, New_Occurrence_Of (Orig_Bod, Loc));
2542 -- Use generic machinery to copy body of inlined subprogram, as if it
2543 -- were an instantiation, resetting source locations appropriately, so
2544 -- that nested inlined calls appear in the main unit.
2546 Save_Env (Subp, Empty);
2547 Set_Copied_Sloc_For_Inlined_Body (N, Defining_Entity (Orig_Bod));
2549 Bod := Copy_Generic_Node (Orig_Bod, Empty, Instantiating => True);
2551 Make_Block_Statement (Loc,
2552 Declarations => Declarations (Bod),
2553 Handled_Statement_Sequence => Handled_Statement_Sequence (Bod));
2555 if No (Declarations (Bod)) then
2556 Set_Declarations (Blk, New_List);
2559 -- If this is a derived function, establish the proper return type.
2561 if Present (Orig_Subp)
2562 and then Orig_Subp /= Subp
2564 Ret_Type := Etype (Orig_Subp);
2566 Ret_Type := Etype (Subp);
2569 F := First_Formal (Subp);
2570 A := First_Actual (N);
2572 -- Create temporaries for the actuals that are expressions, or that
2573 -- are scalars and require copying to preserve semantics.
2575 while Present (F) loop
2576 if Present (Renamed_Object (F)) then
2577 Error_Msg_N (" cannot inline call to recursive subprogram", N);
2581 -- If the argument may be a controlling argument in a call within
2582 -- the inlined body, we must preserve its classwide nature to
2583 -- insure that dynamic dispatching take place subsequently.
2584 -- If the formal has a constraint it must be preserved to retain
2585 -- the semantics of the body.
2587 if Is_Class_Wide_Type (Etype (F))
2588 or else (Is_Access_Type (Etype (F))
2590 Is_Class_Wide_Type (Designated_Type (Etype (F))))
2592 Temp_Typ := Etype (F);
2594 elsif Base_Type (Etype (F)) = Base_Type (Etype (A))
2595 and then Etype (F) /= Base_Type (Etype (F))
2597 Temp_Typ := Etype (F);
2600 Temp_Typ := Etype (A);
2603 -- If the actual is a simple name or a literal, no need to
2604 -- create a temporary, object can be used directly.
2606 if (Is_Entity_Name (A)
2608 (not Is_Scalar_Type (Etype (A))
2609 or else Ekind (Entity (A)) = E_Enumeration_Literal))
2611 or else Nkind (A) = N_Real_Literal
2612 or else Nkind (A) = N_Integer_Literal
2613 or else Nkind (A) = N_Character_Literal
2615 if Etype (F) /= Etype (A) then
2617 (F, Unchecked_Convert_To (Etype (F), Relocate_Node (A)));
2619 Set_Renamed_Object (F, A);
2624 Make_Defining_Identifier (Loc,
2625 Chars => New_Internal_Name ('C'));
2627 -- If the actual for an in/in-out parameter is a view conversion,
2628 -- make it into an unchecked conversion, given that an untagged
2629 -- type conversion is not a proper object for a renaming.
2631 -- In-out conversions that involve real conversions have already
2632 -- been transformed in Expand_Actuals.
2634 if Nkind (A) = N_Type_Conversion
2635 and then Ekind (F) /= E_In_Parameter
2637 New_A := Make_Unchecked_Type_Conversion (Loc,
2638 Subtype_Mark => New_Occurrence_Of (Etype (F), Loc),
2639 Expression => Relocate_Node (Expression (A)));
2641 elsif Etype (F) /= Etype (A) then
2642 New_A := Unchecked_Convert_To (Etype (F), Relocate_Node (A));
2643 Temp_Typ := Etype (F);
2646 New_A := Relocate_Node (A);
2649 Set_Sloc (New_A, Sloc (N));
2651 if Ekind (F) = E_In_Parameter
2652 and then not Is_Limited_Type (Etype (A))
2655 Make_Object_Declaration (Loc,
2656 Defining_Identifier => Temp,
2657 Constant_Present => True,
2658 Object_Definition => New_Occurrence_Of (Temp_Typ, Loc),
2659 Expression => New_A);
2662 Make_Object_Renaming_Declaration (Loc,
2663 Defining_Identifier => Temp,
2664 Subtype_Mark => New_Occurrence_Of (Temp_Typ, Loc),
2668 Prepend (Decl, Declarations (Blk));
2669 Set_Renamed_Object (F, Temp);
2676 -- Establish target of function call. If context is not assignment or
2677 -- declaration, create a temporary as a target. The declaration for
2678 -- the temporary may be subsequently optimized away if the body is a
2679 -- single expression, or if the left-hand side of the assignment is
2682 if Ekind (Subp) = E_Function then
2683 if Nkind (Parent (N)) = N_Assignment_Statement
2684 and then Is_Entity_Name (Name (Parent (N)))
2686 Targ := Name (Parent (N));
2689 -- Replace call with temporary, and create its declaration.
2692 Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
2695 Make_Object_Declaration (Loc,
2696 Defining_Identifier => Temp,
2697 Object_Definition =>
2698 New_Occurrence_Of (Ret_Type, Loc));
2700 Set_No_Initialization (Decl);
2701 Insert_Action (N, Decl);
2702 Rewrite (N, New_Occurrence_Of (Temp, Loc));
2707 -- Traverse the tree and replace formals with actuals or their thunks.
2708 -- Attach block to tree before analysis and rewriting.
2710 Replace_Formals (Blk);
2711 Set_Parent (Blk, N);
2713 if not Comes_From_Source (Subp)
2719 if Present (Exit_Lab) then
2721 -- If the body was a single expression, the single return statement
2722 -- and the corresponding label are useless.
2726 Nkind (Last (Statements (Handled_Statement_Sequence (Blk)))) =
2729 Remove (Last (Statements (Handled_Statement_Sequence (Blk))));
2731 Append (Lab_Decl, (Declarations (Blk)));
2732 Append (Exit_Lab, Statements (Handled_Statement_Sequence (Blk)));
2736 -- Analyze Blk with In_Inlined_Body set, to avoid spurious errors on
2737 -- conflicting private views that Gigi would ignore. If this is a
2738 -- predefined unit, analyze with checks off, as is done in the non-
2739 -- inlined run-time units.
2742 I_Flag : constant Boolean := In_Inlined_Body;
2745 In_Inlined_Body := True;
2749 Style : constant Boolean := Style_Check;
2751 Style_Check := False;
2752 Analyze (Blk, Suppress => All_Checks);
2753 Style_Check := Style;
2760 In_Inlined_Body := I_Flag;
2763 if Ekind (Subp) = E_Procedure then
2764 Rewrite_Procedure_Call (N, Blk);
2766 Rewrite_Function_Call (N, Blk);
2771 -- Cleanup mapping between formals and actuals, for other expansions.
2773 F := First_Formal (Subp);
2775 while Present (F) loop
2776 Set_Renamed_Object (F, Empty);
2779 end Expand_Inlined_Call;
2781 ----------------------------
2782 -- Expand_N_Function_Call --
2783 ----------------------------
2785 procedure Expand_N_Function_Call (N : Node_Id) is
2786 Typ : constant Entity_Id := Etype (N);
2788 function Returned_By_Reference return Boolean;
2789 -- If the return type is returned through the secondary stack. that is
2790 -- by reference, we don't want to create a temp to force stack checking.
2791 -- Shouldn't this function be moved to exp_util???
2793 ---------------------------
2794 -- Returned_By_Reference --
2795 ---------------------------
2797 function Returned_By_Reference return Boolean is
2798 S : Entity_Id := Current_Scope;
2801 if Is_Return_By_Reference_Type (Typ) then
2804 elsif Nkind (Parent (N)) /= N_Return_Statement then
2807 elsif Requires_Transient_Scope (Typ) then
2809 -- Verify that the return type of the enclosing function has
2810 -- the same constrained status as that of the expression.
2812 while Ekind (S) /= E_Function loop
2816 return Is_Constrained (Typ) = Is_Constrained (Etype (S));
2820 end Returned_By_Reference;
2822 -- Start of processing for Expand_N_Function_Call
2825 -- A special check. If stack checking is enabled, and the return type
2826 -- might generate a large temporary, and the call is not the right
2827 -- side of an assignment, then generate an explicit temporary. We do
2828 -- this because otherwise gigi may generate a large temporary on the
2829 -- fly and this can cause trouble with stack checking.
2831 if May_Generate_Large_Temp (Typ)
2832 and then Nkind (Parent (N)) /= N_Assignment_Statement
2834 (Nkind (Parent (N)) /= N_Qualified_Expression
2835 or else Nkind (Parent (Parent (N))) /= N_Assignment_Statement)
2837 (Nkind (Parent (N)) /= N_Object_Declaration
2838 or else Expression (Parent (N)) /= N)
2839 and then not Returned_By_Reference
2841 if Stack_Checking_Enabled then
2843 -- Note: it might be thought that it would be OK to use a call
2844 -- to Force_Evaluation here, but that's not good enough, because
2845 -- that can results in a 'Reference construct that may still
2846 -- need a temporary.
2849 Loc : constant Source_Ptr := Sloc (N);
2850 Temp_Obj : constant Entity_Id :=
2851 Make_Defining_Identifier (Loc,
2852 Chars => New_Internal_Name ('F'));
2853 Temp_Typ : Entity_Id := Typ;
2860 if Is_Tagged_Type (Typ)
2861 and then Present (Controlling_Argument (N))
2863 if Nkind (Parent (N)) /= N_Procedure_Call_Statement
2864 and then Nkind (Parent (N)) /= N_Function_Call
2866 -- If this is a tag-indeterminate call, the object must
2869 if Is_Tag_Indeterminate (N) then
2870 Temp_Typ := Class_Wide_Type (Typ);
2874 -- If this is a dispatching call that is itself the
2875 -- controlling argument of an enclosing call, the
2876 -- nominal subtype of the object that replaces it must
2877 -- be classwide, so that dispatching will take place
2878 -- properly. If it is not a controlling argument, the
2879 -- object is not classwide.
2881 Proc := Entity (Name (Parent (N)));
2882 F := First_Formal (Proc);
2883 A := First_Actual (Parent (N));
2890 if Is_Controlling_Formal (F) then
2891 Temp_Typ := Class_Wide_Type (Typ);
2897 Make_Object_Declaration (Loc,
2898 Defining_Identifier => Temp_Obj,
2899 Object_Definition => New_Occurrence_Of (Temp_Typ, Loc),
2900 Constant_Present => True,
2901 Expression => Relocate_Node (N));
2902 Set_Assignment_OK (Decl);
2904 Insert_Actions (N, New_List (Decl));
2905 Rewrite (N, New_Occurrence_Of (Temp_Obj, Loc));
2909 -- If stack-checking is not enabled, increment serial number
2910 -- for internal names, so that subsequent symbols are consistent
2911 -- with and without stack-checking.
2913 Synchronize_Serial_Number;
2915 -- Now we can expand the call with consistent symbol names
2920 -- Normal case, expand the call
2925 end Expand_N_Function_Call;
2927 ---------------------------------------
2928 -- Expand_N_Procedure_Call_Statement --
2929 ---------------------------------------
2931 procedure Expand_N_Procedure_Call_Statement (N : Node_Id) is
2934 end Expand_N_Procedure_Call_Statement;
2936 ------------------------------
2937 -- Expand_N_Subprogram_Body --
2938 ------------------------------
2940 -- Add poll call if ATC polling is enabled
2942 -- Add return statement if last statement in body is not a return
2943 -- statement (this makes things easier on Gigi which does not want
2944 -- to have to handle a missing return).
2946 -- Add call to Activate_Tasks if body is a task activator
2948 -- Deal with possible detection of infinite recursion
2950 -- Eliminate body completely if convention stubbed
2952 -- Encode entity names within body, since we will not need to reference
2953 -- these entities any longer in the front end.
2955 -- Initialize scalar out parameters if Initialize/Normalize_Scalars
2957 -- Reset Pure indication if any parameter has root type System.Address
2961 procedure Expand_N_Subprogram_Body (N : Node_Id) is
2962 Loc : constant Source_Ptr := Sloc (N);
2963 H : constant Node_Id := Handled_Statement_Sequence (N);
2964 Body_Id : Entity_Id;
2965 Spec_Id : Entity_Id;
2972 procedure Add_Return (S : List_Id);
2973 -- Append a return statement to the statement sequence S if the last
2974 -- statement is not already a return or a goto statement. Note that
2975 -- the latter test is not critical, it does not matter if we add a
2976 -- few extra returns, since they get eliminated anyway later on.
2978 procedure Expand_Thread_Body;
2979 -- Perform required expansion of a thread body
2985 procedure Add_Return (S : List_Id) is
2987 if not Is_Transfer (Last (S)) then
2989 -- The source location for the return is the end label
2990 -- of the procedure in all cases. This is a bit odd when
2991 -- there are exception handlers, but not much else we can do.
2993 Append_To (S, Make_Return_Statement (Sloc (End_Label (H))));
2997 ------------------------
2998 -- Expand_Thread_Body --
2999 ------------------------
3001 -- The required expansion of a thread body is as follows
3003 -- procedure <thread body procedure name> is
3005 -- _Secondary_Stack : aliased
3006 -- Storage_Elements.Storage_Array
3007 -- (1 .. Storage_Offset (Sec_Stack_Size));
3008 -- for _Secondary_Stack'Alignment use Standard'Maximum_Alignment;
3010 -- _Process_ATSD : aliased System.Threads.ATSD;
3013 -- System.Threads.Thread_Body_Enter;
3014 -- (_Secondary_Stack'Address,
3015 -- _Secondary_Stack'Length,
3016 -- _Process_ATSD'Address);
3019 -- <user declarations>
3021 -- <user statements>
3022 -- <user exception handlers>
3025 -- System.Threads.Thread_Body_Leave;
3028 -- when E : others =>
3029 -- System.Threads.Thread_Body_Exceptional_Exit (E);
3032 -- Note the exception handler is omitted if pragma Restriction
3033 -- No_Exception_Handlers is currently active.
3035 procedure Expand_Thread_Body is
3036 User_Decls : constant List_Id := Declarations (N);
3037 Sec_Stack_Len : Node_Id;
3039 TB_Pragma : constant Node_Id :=
3040 Get_Rep_Pragma (Spec_Id, Name_Thread_Body);
3043 Ent_ATSD : Entity_Id;
3047 Decl_ATSD : Node_Id;
3049 Excep_Handlers : List_Id;
3052 New_Scope (Spec_Id);
3054 -- Get proper setting for secondary stack size
3056 if List_Length (Pragma_Argument_Associations (TB_Pragma)) = 2 then
3058 Expression (Last (Pragma_Argument_Associations (TB_Pragma)));
3061 New_Occurrence_Of (RTE (RE_Default_Secondary_Stack_Size), Loc);
3064 Sec_Stack_Len := Convert_To (RTE (RE_Storage_Offset), Sec_Stack_Len);
3066 -- Build and set declarations for the wrapped thread body
3068 Ent_SS := Make_Defining_Identifier (Loc, Name_uSecondary_Stack);
3069 Ent_ATSD := Make_Defining_Identifier (Loc, Name_uProcess_ATSD);
3072 Make_Object_Declaration (Loc,
3073 Defining_Identifier => Ent_SS,
3074 Aliased_Present => True,
3075 Object_Definition =>
3076 Make_Subtype_Indication (Loc,
3078 New_Occurrence_Of (RTE (RE_Storage_Array), Loc),
3080 Make_Index_Or_Discriminant_Constraint (Loc,
3081 Constraints => New_List (
3083 Low_Bound => Make_Integer_Literal (Loc, 1),
3084 High_Bound => Sec_Stack_Len)))));
3087 Make_Object_Declaration (Loc,
3088 Defining_Identifier => Ent_ATSD,
3089 Aliased_Present => True,
3090 Object_Definition => New_Occurrence_Of (RTE (RE_ATSD), Loc));
3092 Set_Declarations (N, New_List (Decl_SS, Decl_ATSD));
3094 Analyze (Decl_ATSD);
3095 Set_Alignment (Ent_SS, UI_From_Int (Maximum_Alignment));
3097 -- Create new exception handler
3099 if Restriction_Active (No_Exception_Handlers) then
3100 Excep_Handlers := No_List;
3103 Check_Restriction (No_Exception_Handlers, N);
3105 Ent_EO := Make_Defining_Identifier (Loc, Name_uE);
3107 Excep_Handlers := New_List (
3108 Make_Exception_Handler (Loc,
3109 Choice_Parameter => Ent_EO,
3110 Exception_Choices => New_List (
3111 Make_Others_Choice (Loc)),
3112 Statements => New_List (
3113 Make_Procedure_Call_Statement (Loc,
3116 (RTE (RE_Thread_Body_Exceptional_Exit), Loc),
3117 Parameter_Associations => New_List (
3118 New_Occurrence_Of (Ent_EO, Loc))))));
3121 -- Now build new handled statement sequence and analyze it
3123 Set_Handled_Statement_Sequence (N,
3124 Make_Handled_Sequence_Of_Statements (Loc,
3125 Statements => New_List (
3127 Make_Procedure_Call_Statement (Loc,
3128 Name => New_Occurrence_Of (RTE (RE_Thread_Body_Enter), Loc),
3129 Parameter_Associations => New_List (
3131 Make_Attribute_Reference (Loc,
3132 Prefix => New_Occurrence_Of (Ent_SS, Loc),
3133 Attribute_Name => Name_Address),
3135 Make_Attribute_Reference (Loc,
3136 Prefix => New_Occurrence_Of (Ent_SS, Loc),
3137 Attribute_Name => Name_Length),
3139 Make_Attribute_Reference (Loc,
3140 Prefix => New_Occurrence_Of (Ent_ATSD, Loc),
3141 Attribute_Name => Name_Address))),
3143 Make_Block_Statement (Loc,
3144 Declarations => User_Decls,
3145 Handled_Statement_Sequence => H),
3147 Make_Procedure_Call_Statement (Loc,
3148 Name => New_Occurrence_Of (RTE (RE_Thread_Body_Leave), Loc))),
3150 Exception_Handlers => Excep_Handlers));
3152 Analyze (Handled_Statement_Sequence (N));
3154 end Expand_Thread_Body;
3156 -- Start of processing for Expand_N_Subprogram_Body
3159 -- Set L to either the list of declarations if present, or
3160 -- to the list of statements if no declarations are present.
3161 -- This is used to insert new stuff at the start.
3163 if Is_Non_Empty_List (Declarations (N)) then
3164 L := Declarations (N);
3166 L := Statements (Handled_Statement_Sequence (N));
3169 -- Need poll on entry to subprogram if polling enabled. We only
3170 -- do this for non-empty subprograms, since it does not seem
3171 -- necessary to poll for a dummy null subprogram.
3173 if Is_Non_Empty_List (L) then
3174 Generate_Poll_Call (First (L));
3177 -- Find entity for subprogram
3179 Body_Id := Defining_Entity (N);
3181 if Present (Corresponding_Spec (N)) then
3182 Spec_Id := Corresponding_Spec (N);
3187 -- If this is a Pure function which has any parameters whose root
3188 -- type is System.Address, reset the Pure indication, since it will
3189 -- likely cause incorrect code to be generated as the parameter is
3190 -- probably a pointer, and the fact that the same pointer is passed
3191 -- does not mean that the same value is being referenced.
3193 -- Note that if the programmer gave an explicit Pure_Function pragma,
3194 -- then we believe the programmer, and leave the subprogram Pure.
3196 -- This code should probably be at the freeze point, so that it
3197 -- happens even on a -gnatc (or more importantly -gnatt) compile
3198 -- so that the semantic tree has Is_Pure set properly ???
3200 if Is_Pure (Spec_Id)
3201 and then Is_Subprogram (Spec_Id)
3202 and then not Has_Pragma_Pure_Function (Spec_Id)
3205 F : Entity_Id := First_Formal (Spec_Id);
3208 while Present (F) loop
3209 if Is_Descendent_Of_Address (Etype (F)) then
3210 Set_Is_Pure (Spec_Id, False);
3212 if Spec_Id /= Body_Id then
3213 Set_Is_Pure (Body_Id, False);
3224 -- Initialize any scalar OUT args if Initialize/Normalize_Scalars
3226 if Init_Or_Norm_Scalars and then Is_Subprogram (Spec_Id) then
3228 F : Entity_Id := First_Formal (Spec_Id);
3229 V : constant Boolean := Validity_Checks_On;
3232 -- We turn off validity checking, since we do not want any
3233 -- check on the initializing value itself (which we know
3234 -- may well be invalid!)
3236 Validity_Checks_On := False;
3238 -- Loop through formals
3240 while Present (F) loop
3241 if Is_Scalar_Type (Etype (F))
3242 and then Ekind (F) = E_Out_Parameter
3244 Insert_Before_And_Analyze (First (L),
3245 Make_Assignment_Statement (Loc,
3246 Name => New_Occurrence_Of (F, Loc),
3247 Expression => Get_Simple_Init_Val (Etype (F), Loc)));
3253 Validity_Checks_On := V;
3257 Scop := Scope (Spec_Id);
3259 -- Add discriminal renamings to protected subprograms.
3260 -- Install new discriminals for expansion of the next
3261 -- subprogram of this protected type, if any.
3263 if Is_List_Member (N)
3264 and then Present (Parent (List_Containing (N)))
3265 and then Nkind (Parent (List_Containing (N))) = N_Protected_Body
3267 Add_Discriminal_Declarations
3268 (Declarations (N), Scop, Name_uObject, Loc);
3269 Add_Private_Declarations (Declarations (N), Scop, Name_uObject, Loc);
3271 -- Associate privals and discriminals with the next protected
3272 -- operation body to be expanded. These are used to expand
3273 -- references to private data objects and discriminants,
3276 Next_Op := Next_Protected_Operation (N);
3278 if Present (Next_Op) then
3279 Dec := Parent (Base_Type (Scop));
3280 Set_Privals (Dec, Next_Op, Loc);
3281 Set_Discriminals (Dec);
3285 -- Clear out statement list for stubbed procedure
3287 if Present (Corresponding_Spec (N)) then
3288 Set_Elaboration_Flag (N, Spec_Id);
3290 if Convention (Spec_Id) = Convention_Stubbed
3291 or else Is_Eliminated (Spec_Id)
3293 Set_Declarations (N, Empty_List);
3294 Set_Handled_Statement_Sequence (N,
3295 Make_Handled_Sequence_Of_Statements (Loc,
3296 Statements => New_List (
3297 Make_Null_Statement (Loc))));
3302 -- Returns_By_Ref flag is normally set when the subprogram is frozen
3303 -- but subprograms with no specs are not frozen
3306 Typ : constant Entity_Id := Etype (Spec_Id);
3307 Utyp : constant Entity_Id := Underlying_Type (Typ);
3310 if not Acts_As_Spec (N)
3311 and then Nkind (Parent (Parent (Spec_Id))) /=
3312 N_Subprogram_Body_Stub
3316 elsif Is_Return_By_Reference_Type (Typ) then
3317 Set_Returns_By_Ref (Spec_Id);
3319 elsif Present (Utyp) and then Controlled_Type (Utyp) then
3320 Set_Returns_By_Ref (Spec_Id);
3324 -- For a procedure, we add a return for all possible syntactic ends
3325 -- of the subprogram. Note that reanalysis is not necessary in this
3326 -- case since it would require a lot of work and accomplish nothing.
3328 if Ekind (Spec_Id) = E_Procedure
3329 or else Ekind (Spec_Id) = E_Generic_Procedure
3331 Add_Return (Statements (H));
3333 if Present (Exception_Handlers (H)) then
3334 Except_H := First_Non_Pragma (Exception_Handlers (H));
3336 while Present (Except_H) loop
3337 Add_Return (Statements (Except_H));
3338 Next_Non_Pragma (Except_H);
3342 -- For a function, we must deal with the case where there is at
3343 -- least one missing return. What we do is to wrap the entire body
3344 -- of the function in a block:
3357 -- raise Program_Error;
3360 -- This approach is necessary because the raise must be signalled
3361 -- to the caller, not handled by any local handler (RM 6.4(11)).
3363 -- Note: we do not need to analyze the constructed sequence here,
3364 -- since it has no handler, and an attempt to analyze the handled
3365 -- statement sequence twice is risky in various ways (e.g. the
3366 -- issue of expanding cleanup actions twice).
3368 elsif Has_Missing_Return (Spec_Id) then
3370 Hloc : constant Source_Ptr := Sloc (H);
3371 Blok : constant Node_Id :=
3372 Make_Block_Statement (Hloc,
3373 Handled_Statement_Sequence => H);
3374 Rais : constant Node_Id :=
3375 Make_Raise_Program_Error (Hloc,
3376 Reason => PE_Missing_Return);
3379 Set_Handled_Statement_Sequence (N,
3380 Make_Handled_Sequence_Of_Statements (Hloc,
3381 Statements => New_List (Blok, Rais)));
3383 New_Scope (Spec_Id);
3390 -- If subprogram contains a parameterless recursive call, then we may
3391 -- have an infinite recursion, so see if we can generate code to check
3392 -- for this possibility if storage checks are not suppressed.
3394 if Ekind (Spec_Id) = E_Procedure
3395 and then Has_Recursive_Call (Spec_Id)
3396 and then not Storage_Checks_Suppressed (Spec_Id)
3398 Detect_Infinite_Recursion (N, Spec_Id);
3401 -- Finally, if we are in Normalize_Scalars mode, then any scalar out
3402 -- parameters must be initialized to the appropriate default value.
3404 if Ekind (Spec_Id) = E_Procedure and then Normalize_Scalars then
3411 Formal := First_Formal (Spec_Id);
3413 while Present (Formal) loop
3414 Floc := Sloc (Formal);
3416 if Ekind (Formal) = E_Out_Parameter
3417 and then Is_Scalar_Type (Etype (Formal))
3420 Make_Assignment_Statement (Floc,
3421 Name => New_Occurrence_Of (Formal, Floc),
3423 Get_Simple_Init_Val (Etype (Formal), Floc));
3424 Prepend (Stm, Declarations (N));
3428 Next_Formal (Formal);
3433 -- Deal with thread body
3435 if Is_Thread_Body (Spec_Id) then
3439 -- If the subprogram does not have pending instantiations, then we
3440 -- must generate the subprogram descriptor now, since the code for
3441 -- the subprogram is complete, and this is our last chance. However
3442 -- if there are pending instantiations, then the code is not
3443 -- complete, and we will delay the generation.
3445 if Is_Subprogram (Spec_Id)
3446 and then not Delay_Subprogram_Descriptors (Spec_Id)
3448 Generate_Subprogram_Descriptor_For_Subprogram (N, Spec_Id);
3451 -- Set to encode entity names in package body before gigi is called
3453 Qualify_Entity_Names (N);
3454 end Expand_N_Subprogram_Body;
3456 -----------------------------------
3457 -- Expand_N_Subprogram_Body_Stub --
3458 -----------------------------------
3460 procedure Expand_N_Subprogram_Body_Stub (N : Node_Id) is
3462 if Present (Corresponding_Body (N)) then
3463 Expand_N_Subprogram_Body (
3464 Unit_Declaration_Node (Corresponding_Body (N)));
3466 end Expand_N_Subprogram_Body_Stub;
3468 -------------------------------------
3469 -- Expand_N_Subprogram_Declaration --
3470 -------------------------------------
3472 -- If the declaration appears within a protected body, it is a private
3473 -- operation of the protected type. We must create the corresponding
3474 -- protected subprogram an associated formals. For a normal protected
3475 -- operation, this is done when expanding the protected type declaration.
3477 procedure Expand_N_Subprogram_Declaration (N : Node_Id) is
3478 Loc : constant Source_Ptr := Sloc (N);
3479 Subp : constant Entity_Id := Defining_Entity (N);
3480 Scop : constant Entity_Id := Scope (Subp);
3481 Prot_Decl : Node_Id;
3483 Prot_Id : Entity_Id;
3486 -- Deal with case of protected subprogram. Do not generate
3487 -- protected operation if operation is flagged as eliminated.
3489 if Is_List_Member (N)
3490 and then Present (Parent (List_Containing (N)))
3491 and then Nkind (Parent (List_Containing (N))) = N_Protected_Body
3492 and then Is_Protected_Type (Scop)
3494 if No (Protected_Body_Subprogram (Subp))
3495 and then not Is_Eliminated (Subp)
3498 Make_Subprogram_Declaration (Loc,
3500 Build_Protected_Sub_Specification
3501 (N, Scop, Unprotected => True));
3503 -- The protected subprogram is declared outside of the protected
3504 -- body. Given that the body has frozen all entities so far, we
3505 -- analyze the subprogram and perform freezing actions explicitly.
3506 -- If the body is a subunit, the insertion point is before the
3507 -- stub in the parent.
3509 Prot_Bod := Parent (List_Containing (N));
3511 if Nkind (Parent (Prot_Bod)) = N_Subunit then
3512 Prot_Bod := Corresponding_Stub (Parent (Prot_Bod));
3515 Insert_Before (Prot_Bod, Prot_Decl);
3516 Prot_Id := Defining_Unit_Name (Specification (Prot_Decl));
3518 New_Scope (Scope (Scop));
3519 Analyze (Prot_Decl);
3520 Create_Extra_Formals (Prot_Id);
3521 Set_Protected_Body_Subprogram (Subp, Prot_Id);
3525 end Expand_N_Subprogram_Declaration;
3527 ---------------------------------------
3528 -- Expand_Protected_Object_Reference --
3529 ---------------------------------------
3531 function Expand_Protected_Object_Reference
3536 Loc : constant Source_Ptr := Sloc (N);
3543 Rec := Make_Identifier (Loc, Name_uObject);
3544 Set_Etype (Rec, Corresponding_Record_Type (Scop));
3546 -- Find enclosing protected operation, and retrieve its first
3547 -- parameter, which denotes the enclosing protected object.
3548 -- If the enclosing operation is an entry, we are immediately
3549 -- within the protected body, and we can retrieve the object
3550 -- from the service entries procedure. A barrier function has
3551 -- has the same signature as an entry. A barrier function is
3552 -- compiled within the protected object, but unlike protected
3553 -- operations its never needs locks, so that its protected body
3554 -- subprogram points to itself.
3556 Proc := Current_Scope;
3558 while Present (Proc)
3559 and then Scope (Proc) /= Scop
3561 Proc := Scope (Proc);
3564 Corr := Protected_Body_Subprogram (Proc);
3568 -- Previous error left expansion incomplete.
3569 -- Nothing to do on this call.
3576 (First (Parameter_Specifications (Parent (Corr))));
3578 if Is_Subprogram (Proc)
3579 and then Proc /= Corr
3581 -- Protected function or procedure.
3583 Set_Entity (Rec, Param);
3585 -- Rec is a reference to an entity which will not be in scope
3586 -- when the call is reanalyzed, and needs no further analysis.
3591 -- Entry or barrier function for entry body.
3592 -- The first parameter of the entry body procedure is a
3593 -- pointer to the object. We create a local variable
3594 -- of the proper type, duplicating what is done to define
3595 -- _object later on.
3599 Obj_Ptr : constant Entity_Id := Make_Defining_Identifier (Loc,
3601 New_Internal_Name ('T'));
3605 Make_Full_Type_Declaration (Loc,
3606 Defining_Identifier => Obj_Ptr,
3608 Make_Access_To_Object_Definition (Loc,
3609 Subtype_Indication =>
3611 (Corresponding_Record_Type (Scop), Loc))));
3613 Insert_Actions (N, Decls);
3614 Insert_Actions (N, Freeze_Entity (Obj_Ptr, Sloc (N)));
3617 Make_Explicit_Dereference (Loc,
3618 Unchecked_Convert_To (Obj_Ptr,
3619 New_Occurrence_Of (Param, Loc)));
3621 -- Analyze new actual. Other actuals in calls are already
3622 -- analyzed and the list of actuals is not renalyzed after
3625 Set_Parent (Rec, N);
3631 end Expand_Protected_Object_Reference;
3633 --------------------------------------
3634 -- Expand_Protected_Subprogram_Call --
3635 --------------------------------------
3637 procedure Expand_Protected_Subprogram_Call
3645 -- If the protected object is not an enclosing scope, this is
3646 -- an inter-object function call. Inter-object procedure
3647 -- calls are expanded by Exp_Ch9.Build_Simple_Entry_Call.
3648 -- The call is intra-object only if the subprogram being
3649 -- called is in the protected body being compiled, and if the
3650 -- protected object in the call is statically the enclosing type.
3651 -- The object may be an component of some other data structure,
3652 -- in which case this must be handled as an inter-object call.
3654 if not In_Open_Scopes (Scop)
3655 or else not Is_Entity_Name (Name (N))
3657 if Nkind (Name (N)) = N_Selected_Component then
3658 Rec := Prefix (Name (N));
3661 pragma Assert (Nkind (Name (N)) = N_Indexed_Component);
3662 Rec := Prefix (Prefix (Name (N)));
3665 Build_Protected_Subprogram_Call (N,
3666 Name => New_Occurrence_Of (Subp, Sloc (N)),
3667 Rec => Convert_Concurrent (Rec, Etype (Rec)),
3671 Rec := Expand_Protected_Object_Reference (N, Scop);
3677 Build_Protected_Subprogram_Call (N,
3686 -- If it is a function call it can appear in elaboration code and
3687 -- the called entity must be frozen here.
3689 if Ekind (Subp) = E_Function then
3690 Freeze_Expression (Name (N));
3692 end Expand_Protected_Subprogram_Call;
3694 -----------------------
3695 -- Freeze_Subprogram --
3696 -----------------------
3698 procedure Freeze_Subprogram (N : Node_Id) is
3699 E : constant Entity_Id := Entity (N);
3702 -- When a primitive is frozen, enter its name in the corresponding
3703 -- dispatch table. If the DTC_Entity field is not set this is an
3704 -- overridden primitive that can be ignored. We suppress the
3705 -- initialization of the dispatch table entry when Java_VM because
3706 -- the dispatching mechanism is handled internally by the JVM.
3708 if Is_Dispatching_Operation (E)
3709 and then not Is_Abstract (E)
3710 and then Present (DTC_Entity (E))
3711 and then not Is_CPP_Class (Scope (DTC_Entity (E)))
3712 and then not Java_VM
3714 Check_Overriding_Operation (E);
3715 Insert_After (N, Fill_DT_Entry (Sloc (N), E));
3718 -- Mark functions that return by reference. Note that it cannot be
3719 -- part of the normal semantic analysis of the spec since the
3720 -- underlying returned type may not be known yet (for private types)
3723 Typ : constant Entity_Id := Etype (E);
3724 Utyp : constant Entity_Id := Underlying_Type (Typ);
3727 if Is_Return_By_Reference_Type (Typ) then
3728 Set_Returns_By_Ref (E);
3730 elsif Present (Utyp) and then Controlled_Type (Utyp) then
3731 Set_Returns_By_Ref (E);
3734 end Freeze_Subprogram;
OSDN Git Service
