1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2011, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Atree; use Atree;
27 with Checks; use Checks;
28 with Einfo; use Einfo;
29 with Elists; use Elists;
30 with Errout; use Errout;
31 with Exp_Ch3; use Exp_Ch3;
32 with Exp_Ch6; use Exp_Ch6;
33 with Exp_Ch11; use Exp_Ch11;
34 with Exp_Dbug; use Exp_Dbug;
35 with Exp_Disp; use Exp_Disp;
36 with Exp_Sel; use Exp_Sel;
37 with Exp_Smem; use Exp_Smem;
38 with Exp_Tss; use Exp_Tss;
39 with Exp_Util; use Exp_Util;
40 with Freeze; use Freeze;
42 with Itypes; use Itypes;
43 with Namet; use Namet;
44 with Nlists; use Nlists;
45 with Nmake; use Nmake;
47 with Restrict; use Restrict;
48 with Rident; use Rident;
49 with Rtsfind; use Rtsfind;
51 with Sem_Aux; use Sem_Aux;
52 with Sem_Ch6; use Sem_Ch6;
53 with Sem_Ch8; use Sem_Ch8;
54 with Sem_Ch11; use Sem_Ch11;
55 with Sem_Elab; use Sem_Elab;
56 with Sem_Eval; use Sem_Eval;
57 with Sem_Res; use Sem_Res;
58 with Sem_Util; use Sem_Util;
59 with Sinfo; use Sinfo;
60 with Snames; use Snames;
61 with Stand; use Stand;
62 with Stringt; use Stringt;
63 with Targparm; use Targparm;
64 with Tbuild; use Tbuild;
65 with Uintp; use Uintp;
67 package body Exp_Ch9 is
69 -- The following constant establishes the upper bound for the index of
70 -- an entry family. It is used to limit the allocated size of protected
71 -- types with defaulted discriminant of an integer type, when the bound
72 -- of some entry family depends on a discriminant. The limitation to
73 -- entry families of 128K should be reasonable in all cases, and is a
74 -- documented implementation restriction. It will be lifted when protected
75 -- entry families are re-implemented as a single ordered queue.
77 Entry_Family_Bound : constant Int := 2**16;
79 -----------------------
80 -- Local Subprograms --
81 -----------------------
83 function Actual_Index_Expression
87 Tsk : Entity_Id) return Node_Id;
88 -- Compute the index position for an entry call. Tsk is the target task. If
89 -- the bounds of some entry family depend on discriminants, the expression
90 -- computed by this function uses the discriminants of the target task.
92 procedure Add_Object_Pointer
96 -- Prepend an object pointer declaration to the declaration list Decls.
97 -- This object pointer is initialized to a type conversion of the System.
98 -- Address pointer passed to entry barrier functions and entry body
101 procedure Add_Formal_Renamings
106 -- Create renaming declarations for the formals, inside the procedure that
107 -- implements an entry body. The renamings make the original names of the
108 -- formals accessible to gdb, and serve no other purpose.
109 -- Spec is the specification of the procedure being built.
110 -- Decls is the list of declarations to be enhanced.
111 -- Ent is the entity for the original entry body.
113 function Build_Accept_Body (Astat : Node_Id) return Node_Id;
114 -- Transform accept statement into a block with added exception handler.
115 -- Used both for simple accept statements and for accept alternatives in
116 -- select statements. Astat is the accept statement.
118 function Build_Barrier_Function
121 Pid : Node_Id) return Node_Id;
122 -- Build the function body returning the value of the barrier expression
123 -- for the specified entry body.
125 function Build_Barrier_Function_Specification
127 Def_Id : Entity_Id) return Node_Id;
128 -- Build a specification for a function implementing the protected entry
129 -- barrier of the specified entry body.
131 function Build_Corresponding_Record
134 Loc : Source_Ptr) return Node_Id;
135 -- Common to tasks and protected types. Copy discriminant specifications,
136 -- build record declaration. N is the type declaration, Ctyp is the
137 -- concurrent entity (task type or protected type).
139 function Build_Entry_Count_Expression
140 (Concurrent_Type : Node_Id;
141 Component_List : List_Id;
142 Loc : Source_Ptr) return Node_Id;
143 -- Compute number of entries for concurrent object. This is a count of
144 -- simple entries, followed by an expression that computes the length
145 -- of the range of each entry family. A single array with that size is
146 -- allocated for each concurrent object of the type.
148 function Build_Parameter_Block
152 Decls : List_Id) return Entity_Id;
153 -- Generate an access type for each actual parameter in the list Actuals.
154 -- Create an encapsulating record that contains all the actuals and return
155 -- its type. Generate:
156 -- type Ann1 is access all <actual1-type>
158 -- type AnnN is access all <actualN-type>
159 -- type Pnn is record
165 procedure Build_PPC_Wrapper (E : Entity_Id; Decl : Node_Id);
166 -- Build body of wrapper procedure for an entry or entry family that has
167 -- pre/postconditions. The body gathers the PPC's and expands them in the
168 -- usual way, and performs the entry call itself. This way preconditions
169 -- are evaluated before the call is queued. E is the entry in question,
170 -- and Decl is the enclosing synchronized type declaration at whose
171 -- freeze point the generated body is analyzed.
173 function Build_Renamed_Formal_Declaration
177 Renamed_Formal : Node_Id) return Node_Id;
178 -- Create a renaming declaration for a formal, within a protected entry
179 -- body or an accept body. The renamed object is a component of the
180 -- parameter block that is a parameter in the entry call.
182 -- In Ada2012, If the formal is an incomplete tagged type, the renaming
183 -- does not dereference the corresponding component to prevent an illegal
184 -- use of the incomplete type (AI05-0151).
186 procedure Build_Wrapper_Bodies
190 -- Ada 2005 (AI-345): Typ is either a concurrent type or the corresponding
191 -- record of a concurrent type. N is the insertion node where all bodies
192 -- will be placed. This routine builds the bodies of the subprograms which
193 -- serve as an indirection mechanism to overriding primitives of concurrent
194 -- types, entries and protected procedures. Any new body is analyzed.
196 procedure Build_Wrapper_Specs
200 -- Ada 2005 (AI-345): Typ is either a concurrent type or the corresponding
201 -- record of a concurrent type. N is the insertion node where all specs
202 -- will be placed. This routine builds the specs of the subprograms which
203 -- serve as an indirection mechanism to overriding primitives of concurrent
204 -- types, entries and protected procedures. Any new spec is analyzed.
206 function Build_Find_Body_Index (Typ : Entity_Id) return Node_Id;
207 -- Build the function that translates the entry index in the call
208 -- (which depends on the size of entry families) into an index into the
209 -- Entry_Bodies_Array, to determine the body and barrier function used
210 -- in a protected entry call. A pointer to this function appears in every
213 function Build_Find_Body_Index_Spec (Typ : Entity_Id) return Node_Id;
214 -- Build subprogram declaration for previous one
216 function Build_Protected_Entry
219 Pid : Node_Id) return Node_Id;
220 -- Build the procedure implementing the statement sequence of the specified
223 function Build_Protected_Entry_Specification
226 Ent_Id : Entity_Id) return Node_Id;
227 -- Build a specification for the procedure implementing the statements of
228 -- the specified entry body. Add attributes associating it with the entry
229 -- defining identifier Ent_Id.
231 function Build_Protected_Spec
233 Obj_Type : Entity_Id;
235 Unprotected : Boolean := False) return List_Id;
236 -- Utility shared by Build_Protected_Sub_Spec and Expand_Access_Protected_
237 -- Subprogram_Type. Builds signature of protected subprogram, adding the
238 -- formal that corresponds to the object itself. For an access to protected
239 -- subprogram, there is no object type to specify, so the parameter has
240 -- type Address and mode In. An indirect call through such a pointer will
241 -- convert the address to a reference to the actual object. The object is
242 -- a limited record and therefore a by_reference type.
244 function Build_Protected_Subprogram_Body
247 N_Op_Spec : Node_Id) return Node_Id;
248 -- This function is used to construct the protected version of a protected
249 -- subprogram. Its statement sequence first defers abort, then locks
250 -- the associated protected object, and then enters a block that contains
251 -- a call to the unprotected version of the subprogram (for details, see
252 -- Build_Unprotected_Subprogram_Body). This block statement requires
253 -- a cleanup handler that unlocks the object in all cases.
254 -- (see Exp_Ch7.Expand_Cleanup_Actions).
256 function Build_Selected_Name
258 Selector : Entity_Id;
259 Append_Char : Character := ' ') return Name_Id;
260 -- Build a name in the form of Prefix__Selector, with an optional
261 -- character appended. This is used for internal subprograms generated
262 -- for operations of protected types, including barrier functions.
263 -- For the subprograms generated for entry bodies and entry barriers,
264 -- the generated name includes a sequence number that makes names
265 -- unique in the presence of entry overloading. This is necessary
266 -- because entry body procedures and barrier functions all have the
269 procedure Build_Simple_Entry_Call
274 -- Some comments here would be useful ???
276 function Build_Task_Proc_Specification (T : Entity_Id) return Node_Id;
277 -- This routine constructs a specification for the procedure that we will
278 -- build for the task body for task type T. The spec has the form:
280 -- procedure tnameB (_Task : access tnameV);
282 -- where name is the character name taken from the task type entity that
283 -- is passed as the argument to the procedure, and tnameV is the task
284 -- value type that is associated with the task type.
286 function Build_Unprotected_Subprogram_Body
288 Pid : Node_Id) return Node_Id;
289 -- This routine constructs the unprotected version of a protected
290 -- subprogram body, which is contains all of the code in the
291 -- original, unexpanded body. This is the version of the protected
292 -- subprogram that is called from all protected operations on the same
293 -- object, including the protected version of the same subprogram.
295 procedure Collect_Entry_Families
298 Current_Node : in out Node_Id;
299 Conctyp : Entity_Id);
300 -- For each entry family in a concurrent type, create an anonymous array
301 -- type of the right size, and add a component to the corresponding_record.
303 function Concurrent_Object
304 (Spec_Id : Entity_Id;
305 Conc_Typ : Entity_Id) return Entity_Id;
306 -- Given a subprogram entity Spec_Id and concurrent type Conc_Typ, return
307 -- the entity associated with the concurrent object in the Protected_Body_
308 -- Subprogram or the Task_Body_Procedure of Spec_Id. The returned entity
309 -- denotes formal parameter _O, _object or _task.
311 function Copy_Result_Type (Res : Node_Id) return Node_Id;
312 -- Copy the result type of a function specification, when building the
313 -- internal operation corresponding to a protected function, or when
314 -- expanding an access to protected function. If the result is an anonymous
315 -- access to subprogram itself, we need to create a new signature with the
316 -- same parameter names and the same resolved types, but with new entities
319 procedure Debug_Private_Data_Declarations (Decls : List_Id);
320 -- Decls is a list which may contain the declarations created by Install_
321 -- Private_Data_Declarations. All generated entities are marked as needing
322 -- debug info and debug nodes are manually generation where necessary. This
323 -- step of the expansion must to be done after private data has been moved
324 -- to its final resting scope to ensure proper visibility of debug objects.
326 function Family_Offset
331 Cap : Boolean) return Node_Id;
332 -- Compute (Hi - Lo) for two entry family indexes. Hi is the index in
333 -- an accept statement, or the upper bound in the discrete subtype of
334 -- an entry declaration. Lo is the corresponding lower bound. Ttyp is
335 -- the concurrent type of the entry. If Cap is true, the result is
336 -- capped according to Entry_Family_Bound.
343 Cap : Boolean) return Node_Id;
344 -- Compute (Hi - Lo) + 1 Max 0, to determine the number of entries in
345 -- a family, and handle properly the superflat case. This is equivalent
346 -- to the use of 'Length on the index type, but must use Family_Offset
347 -- to handle properly the case of bounds that depend on discriminants.
348 -- If Cap is true, the result is capped according to Entry_Family_Bound.
350 procedure Extract_Dispatching_Call
352 Call_Ent : out Entity_Id;
353 Object : out Entity_Id;
354 Actuals : out List_Id;
355 Formals : out List_Id);
356 -- Given a dispatching call, extract the entity of the name of the call,
357 -- its actual dispatching object, its actual parameters and the formal
358 -- parameters of the overridden interface-level version. If the type of
359 -- the dispatching object is an access type then an explicit dereference
360 -- is returned in Object.
362 procedure Extract_Entry
364 Concval : out Node_Id;
366 Index : out Node_Id);
367 -- Given an entry call, returns the associated concurrent object,
368 -- the entry name, and the entry family index.
370 function Find_Task_Or_Protected_Pragma
372 P : Name_Id) return Node_Id;
373 -- Searches the task or protected definition T for the first occurrence
374 -- of the pragma whose name is given by P. The caller has ensured that
375 -- the pragma is present in the task definition. A special case is that
376 -- when P is Name_uPriority, the call will also find Interrupt_Priority.
377 -- ??? Should be implemented with the rep item chain mechanism.
379 function Index_Object (Spec_Id : Entity_Id) return Entity_Id;
380 -- Given a subprogram identifier, return the entity which is associated
381 -- with the protection entry index in the Protected_Body_Subprogram or the
382 -- Task_Body_Procedure of Spec_Id. The returned entity denotes formal
385 function Is_Potentially_Large_Family
386 (Base_Index : Entity_Id;
389 Hi : Node_Id) return Boolean;
391 function Is_Private_Primitive_Subprogram (Id : Entity_Id) return Boolean;
392 -- Determine whether Id is a function or a procedure and is marked as a
393 -- private primitive.
395 function Null_Statements (Stats : List_Id) return Boolean;
396 -- Used to check DO-END sequence. Checks for equivalent of DO NULL; END.
397 -- Allows labels, and pragma Warnings/Unreferenced in the sequence as
398 -- well to still count as null. Returns True for a null sequence. The
399 -- argument is the list of statements from the DO-END sequence.
401 function Parameter_Block_Pack
407 Stmts : List_Id) return Entity_Id;
408 -- Set the components of the generated parameter block with the values of
409 -- the actual parameters. Generate aliased temporaries to capture the
410 -- values for types that are passed by copy. Otherwise generate a reference
411 -- to the actual's value. Return the address of the aggregate block.
413 -- Jnn1 : alias <formal-type1>;
414 -- Jnn1 := <actual1>;
417 -- Jnn1'unchecked_access;
418 -- <actual2>'reference;
421 function Parameter_Block_Unpack
425 Formals : List_Id) return List_Id;
426 -- Retrieve the values of the components from the parameter block and
427 -- assign then to the original actual parameters. Generate:
428 -- <actual1> := P.<formal1>;
430 -- <actualN> := P.<formalN>;
432 function Trivial_Accept_OK return Boolean;
433 -- If there is no DO-END block for an accept, or if the DO-END block has
434 -- only null statements, then it is possible to do the Rendezvous with much
435 -- less overhead using the Accept_Trivial routine in the run-time library.
436 -- However, this is not always a valid optimization. Whether it is valid or
437 -- not depends on the Task_Dispatching_Policy. The issue is whether a full
438 -- rescheduling action is required or not. In FIFO_Within_Priorities, such
439 -- a rescheduling is required, so this optimization is not allowed. This
440 -- function returns True if the optimization is permitted.
442 -----------------------------
443 -- Actual_Index_Expression --
444 -----------------------------
446 function Actual_Index_Expression
450 Tsk : Entity_Id) return Node_Id
452 Ttyp : constant Entity_Id := Etype (Tsk);
460 function Actual_Family_Offset (Hi, Lo : Node_Id) return Node_Id;
461 -- Compute difference between bounds of entry family
463 --------------------------
464 -- Actual_Family_Offset --
465 --------------------------
467 function Actual_Family_Offset (Hi, Lo : Node_Id) return Node_Id is
469 function Actual_Discriminant_Ref (Bound : Node_Id) return Node_Id;
470 -- Replace a reference to a discriminant with a selected component
471 -- denoting the discriminant of the target task.
473 -----------------------------
474 -- Actual_Discriminant_Ref --
475 -----------------------------
477 function Actual_Discriminant_Ref (Bound : Node_Id) return Node_Id is
478 Typ : constant Entity_Id := Etype (Bound);
482 if not Is_Entity_Name (Bound)
483 or else Ekind (Entity (Bound)) /= E_Discriminant
485 if Nkind (Bound) = N_Attribute_Reference then
488 B := New_Copy_Tree (Bound);
493 Make_Selected_Component (Sloc,
494 Prefix => New_Copy_Tree (Tsk),
495 Selector_Name => New_Occurrence_Of (Entity (Bound), Sloc));
497 Analyze_And_Resolve (B, Typ);
501 Make_Attribute_Reference (Sloc,
502 Attribute_Name => Name_Pos,
503 Prefix => New_Occurrence_Of (Etype (Bound), Sloc),
504 Expressions => New_List (B));
505 end Actual_Discriminant_Ref;
507 -- Start of processing for Actual_Family_Offset
511 Make_Op_Subtract (Sloc,
512 Left_Opnd => Actual_Discriminant_Ref (Hi),
513 Right_Opnd => Actual_Discriminant_Ref (Lo));
514 end Actual_Family_Offset;
516 -- Start of processing for Actual_Index_Expression
519 -- The queues of entries and entry families appear in textual order in
520 -- the associated record. The entry index is computed as the sum of the
521 -- number of queues for all entries that precede the designated one, to
522 -- which is added the index expression, if this expression denotes a
523 -- member of a family.
525 -- The following is a place holder for the count of simple entries
527 Num := Make_Integer_Literal (Sloc, 1);
529 -- We construct an expression which is a series of addition operations.
530 -- See comments in Entry_Index_Expression, which is identical in
533 if Present (Index) then
534 S := Etype (Discrete_Subtype_Definition (Declaration_Node (Ent)));
541 Actual_Family_Offset (
542 Make_Attribute_Reference (Sloc,
543 Attribute_Name => Name_Pos,
544 Prefix => New_Reference_To (Base_Type (S), Sloc),
545 Expressions => New_List (Relocate_Node (Index))),
546 Type_Low_Bound (S)));
551 -- Now add lengths of preceding entries and entry families
553 Prev := First_Entity (Ttyp);
555 while Chars (Prev) /= Chars (Ent)
556 or else (Ekind (Prev) /= Ekind (Ent))
557 or else not Sem_Ch6.Type_Conformant (Ent, Prev)
559 if Ekind (Prev) = E_Entry then
560 Set_Intval (Num, Intval (Num) + 1);
562 elsif Ekind (Prev) = E_Entry_Family then
564 Etype (Discrete_Subtype_Definition (Declaration_Node (Prev)));
566 -- The need for the following full view retrieval stems from
567 -- this complex case of nested generics and tasking:
570 -- type Formal_Index is range <>;
573 -- type Index is private;
580 -- type Index is new Formal_Index range 1 .. 10;
583 -- package body Outer is
585 -- entry Fam (Index); -- (2)
588 -- package body Inner is -- (3)
596 -- We are currently building the index expression for the entry
597 -- call "T.E" (1). Part of the expansion must mention the range
598 -- of the discrete type "Index" (2) of entry family "Fam".
599 -- However only the private view of type "Index" is available to
600 -- the inner generic (3) because there was no prior mention of
601 -- the type inside "Inner". This visibility requirement is
602 -- implicit and cannot be detected during the construction of
603 -- the generic trees and needs special handling.
606 and then Is_Private_Type (S)
607 and then Present (Full_View (S))
612 Lo := Type_Low_Bound (S);
613 Hi := Type_High_Bound (S);
621 Actual_Family_Offset (Hi, Lo),
623 Make_Integer_Literal (Sloc, 1)));
625 -- Other components are anonymous types to be ignored
635 end Actual_Index_Expression;
637 --------------------------
638 -- Add_Formal_Renamings --
639 --------------------------
641 procedure Add_Formal_Renamings
647 Ptr : constant Entity_Id :=
649 (Next (First (Parameter_Specifications (Spec))));
650 -- The name of the formal that holds the address of the parameter block
657 Renamed_Formal : Node_Id;
660 Formal := First_Formal (Ent);
661 while Present (Formal) loop
662 Comp := Entry_Component (Formal);
664 Make_Defining_Identifier (Sloc (Formal),
665 Chars => Chars (Formal));
666 Set_Etype (New_F, Etype (Formal));
667 Set_Scope (New_F, Ent);
669 -- Now we set debug info needed on New_F even though it does not
670 -- come from source, so that the debugger will get the right
671 -- information for these generated names.
673 Set_Debug_Info_Needed (New_F);
675 if Ekind (Formal) = E_In_Parameter then
676 Set_Ekind (New_F, E_Constant);
678 Set_Ekind (New_F, E_Variable);
679 Set_Extra_Constrained (New_F, Extra_Constrained (Formal));
682 Set_Actual_Subtype (New_F, Actual_Subtype (Formal));
685 Make_Selected_Component (Loc,
687 Unchecked_Convert_To (Entry_Parameters_Type (Ent),
688 Make_Identifier (Loc, Chars (Ptr))),
689 Selector_Name => New_Reference_To (Comp, Loc));
692 Build_Renamed_Formal_Declaration
693 (New_F, Formal, Comp, Renamed_Formal);
695 Append (Decl, Decls);
696 Set_Renamed_Object (Formal, New_F);
697 Next_Formal (Formal);
699 end Add_Formal_Renamings;
701 ------------------------
702 -- Add_Object_Pointer --
703 ------------------------
705 procedure Add_Object_Pointer
707 Conc_Typ : Entity_Id;
710 Rec_Typ : constant Entity_Id := Corresponding_Record_Type (Conc_Typ);
715 -- Create the renaming declaration for the Protection object of a
716 -- protected type. _Object is used by Complete_Entry_Body.
717 -- ??? An attempt to make this a renaming was unsuccessful.
719 -- Build the entity for the access type
722 Make_Defining_Identifier (Loc,
723 New_External_Name (Chars (Rec_Typ), 'P'));
726 -- _object : poVP := poVP!O;
729 Make_Object_Declaration (Loc,
730 Defining_Identifier =>
731 Make_Defining_Identifier (Loc, Name_uObject),
733 New_Reference_To (Obj_Ptr, Loc),
735 Unchecked_Convert_To (Obj_Ptr, Make_Identifier (Loc, Name_uO)));
736 Set_Debug_Info_Needed (Defining_Identifier (Decl));
737 Prepend_To (Decls, Decl);
740 -- type poVP is access poV;
743 Make_Full_Type_Declaration (Loc,
744 Defining_Identifier =>
747 Make_Access_To_Object_Definition (Loc,
748 Subtype_Indication =>
749 New_Reference_To (Rec_Typ, Loc)));
750 Set_Debug_Info_Needed (Defining_Identifier (Decl));
751 Prepend_To (Decls, Decl);
752 end Add_Object_Pointer;
754 -----------------------
755 -- Build_Accept_Body --
756 -----------------------
758 function Build_Accept_Body (Astat : Node_Id) return Node_Id is
759 Loc : constant Source_Ptr := Sloc (Astat);
760 Stats : constant Node_Id := Handled_Statement_Sequence (Astat);
767 -- At the end of the statement sequence, Complete_Rendezvous is called.
768 -- A label skipping the Complete_Rendezvous, and all other accept
769 -- processing, has already been added for the expansion of requeue
770 -- statements. The Sloc is copied from the last statement since it
771 -- is really part of this last statement.
775 (Sloc (Last (Statements (Stats))), RE_Complete_Rendezvous);
776 Insert_Before (Last (Statements (Stats)), Call);
779 -- If exception handlers are present, then append Complete_Rendezvous
780 -- calls to the handlers, and construct the required outer block. As
781 -- above, the Sloc is copied from the last statement in the sequence.
783 if Present (Exception_Handlers (Stats)) then
784 Hand := First (Exception_Handlers (Stats));
785 while Present (Hand) loop
788 (Sloc (Last (Statements (Hand))), RE_Complete_Rendezvous);
789 Append (Call, Statements (Hand));
795 Make_Handled_Sequence_Of_Statements (Loc,
796 Statements => New_List (
797 Make_Block_Statement (Loc,
798 Handled_Statement_Sequence => Stats)));
804 -- At this stage we know that the new statement sequence does not
805 -- have an exception handler part, so we supply one to call
806 -- Exceptional_Complete_Rendezvous. This handler is
808 -- when all others =>
809 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
811 -- We handle Abort_Signal to make sure that we properly catch the abort
812 -- case and wake up the caller.
814 Ohandle := Make_Others_Choice (Loc);
815 Set_All_Others (Ohandle);
817 Set_Exception_Handlers (New_S,
819 Make_Implicit_Exception_Handler (Loc,
820 Exception_Choices => New_List (Ohandle),
822 Statements => New_List (
823 Make_Procedure_Call_Statement (Sloc (Stats),
824 Name => New_Reference_To (
825 RTE (RE_Exceptional_Complete_Rendezvous), Sloc (Stats)),
826 Parameter_Associations => New_List (
827 Make_Function_Call (Sloc (Stats),
828 Name => New_Reference_To (
829 RTE (RE_Get_GNAT_Exception), Sloc (Stats)))))))));
831 Set_Parent (New_S, Astat); -- temp parent for Analyze call
832 Analyze_Exception_Handlers (Exception_Handlers (New_S));
833 Expand_Exception_Handlers (New_S);
835 -- Exceptional_Complete_Rendezvous must be called with abort
836 -- still deferred, which is the case for a "when all others" handler.
839 end Build_Accept_Body;
841 -----------------------------------
842 -- Build_Activation_Chain_Entity --
843 -----------------------------------
845 procedure Build_Activation_Chain_Entity (N : Node_Id) is
846 function Has_Activation_Chain (Stmt : Node_Id) return Boolean;
847 -- Determine whether an extended return statement has an activation
850 --------------------------
851 -- Has_Activation_Chain --
852 --------------------------
854 function Has_Activation_Chain (Stmt : Node_Id) return Boolean is
858 Decl := First (Return_Object_Declarations (Stmt));
859 while Present (Decl) loop
860 if Nkind (Decl) = N_Object_Declaration
861 and then Chars (Defining_Identifier (Decl)) = Name_uChain
870 end Has_Activation_Chain;
877 -- Start of processing for Build_Activation_Chain_Entity
880 -- Traverse the parent chain looking for an enclosing construct which
881 -- contains an activation chain variable. The construct is either a
882 -- body, a block, or an extended return.
886 while not Nkind_In (Par, N_Block_Statement,
888 N_Extended_Return_Statement,
890 N_Package_Declaration,
897 -- When the enclosing construct is a package body, the activation chain
898 -- variable is declared in the body, but the Activation_Chain_Entity is
899 -- attached to the spec.
901 if Nkind (Par) = N_Package_Body then
902 Decls := Declarations (Par);
903 Par := Unit_Declaration_Node (Corresponding_Spec (Par));
905 elsif Nkind (Par) = N_Package_Declaration then
906 Decls := Visible_Declarations (Specification (Par));
908 elsif Nkind (Par) = N_Extended_Return_Statement then
909 Decls := Return_Object_Declarations (Par);
912 Decls := Declarations (Par);
915 -- If an activation chain entity has not been declared already, create
918 if Nkind (Par) = N_Extended_Return_Statement
919 or else No (Activation_Chain_Entity (Par))
921 -- Since extended return statements do not store the entity of the
922 -- chain, examine the return object declarations to avoid creating
925 if Nkind (Par) = N_Extended_Return_Statement
926 and then Has_Activation_Chain (Par)
936 Chain := Make_Defining_Identifier (Sloc (N), Name_uChain);
938 -- Note: An extended return statement is not really a task
939 -- activator, but it does have an activation chain on which to
940 -- store the tasks temporarily. On successful return, the tasks
941 -- on this chain are moved to the chain passed in by the caller.
942 -- We do not build an Activation_Chain_Entity for an extended
943 -- return statement, because we do not want to build a call to
944 -- Activate_Tasks. Task activation is the responsibility of the
947 if Nkind (Par) /= N_Extended_Return_Statement then
948 Set_Activation_Chain_Entity (Par, Chain);
952 Make_Object_Declaration (Sloc (Par),
953 Defining_Identifier => Chain,
954 Aliased_Present => True,
956 New_Reference_To (RTE (RE_Activation_Chain), Sloc (Par)));
958 Prepend_To (Decls, Decl);
962 end Build_Activation_Chain_Entity;
964 ----------------------------
965 -- Build_Barrier_Function --
966 ----------------------------
968 function Build_Barrier_Function
971 Pid : Node_Id) return Node_Id
973 Ent_Formals : constant Node_Id := Entry_Body_Formal_Part (N);
974 Cond : constant Node_Id := Condition (Ent_Formals);
975 Loc : constant Source_Ptr := Sloc (Cond);
976 Func_Id : constant Entity_Id := Barrier_Function (Ent);
977 Op_Decls : constant List_Id := New_List;
982 -- Add a declaration for the Protection object, renaming declarations
983 -- for the discriminals and privals and finally a declaration for the
984 -- entry family index (if applicable).
986 Install_Private_Data_Declarations (Sloc (N),
992 Family => Ekind (Ent) = E_Entry_Family);
994 -- If compiling with -fpreserve-control-flow, make sure we insert an
995 -- IF statement so that the back-end knows to generate a conditional
996 -- branch instruction, even if the condition is just the name of a
999 if Opt.Suppress_Control_Flow_Optimizations then
1000 Stmt := Make_Implicit_If_Statement (Cond,
1002 Then_Statements => New_List (
1003 Make_Simple_Return_Statement (Loc,
1004 New_Occurrence_Of (Standard_True, Loc))),
1005 Else_Statements => New_List (
1006 Make_Simple_Return_Statement (Loc,
1007 New_Occurrence_Of (Standard_False, Loc))));
1010 Stmt := Make_Simple_Return_Statement (Loc, Cond);
1013 -- Note: the condition in the barrier function needs to be properly
1014 -- processed for the C/Fortran boolean possibility, but this happens
1015 -- automatically since the return statement does this normalization.
1018 Make_Subprogram_Body (Loc,
1020 Build_Barrier_Function_Specification (Loc,
1021 Make_Defining_Identifier (Loc, Chars (Func_Id))),
1022 Declarations => Op_Decls,
1023 Handled_Statement_Sequence =>
1024 Make_Handled_Sequence_Of_Statements (Loc,
1025 Statements => New_List (Stmt)));
1026 Set_Is_Entry_Barrier_Function (Func_Body);
1029 end Build_Barrier_Function;
1031 ------------------------------------------
1032 -- Build_Barrier_Function_Specification --
1033 ------------------------------------------
1035 function Build_Barrier_Function_Specification
1037 Def_Id : Entity_Id) return Node_Id
1040 Set_Debug_Info_Needed (Def_Id);
1042 return Make_Function_Specification (Loc,
1043 Defining_Unit_Name => Def_Id,
1044 Parameter_Specifications => New_List (
1045 Make_Parameter_Specification (Loc,
1046 Defining_Identifier =>
1047 Make_Defining_Identifier (Loc, Name_uO),
1049 New_Reference_To (RTE (RE_Address), Loc)),
1051 Make_Parameter_Specification (Loc,
1052 Defining_Identifier =>
1053 Make_Defining_Identifier (Loc, Name_uE),
1055 New_Reference_To (RTE (RE_Protected_Entry_Index), Loc))),
1057 Result_Definition =>
1058 New_Reference_To (Standard_Boolean, Loc));
1059 end Build_Barrier_Function_Specification;
1061 --------------------------
1062 -- Build_Call_With_Task --
1063 --------------------------
1065 function Build_Call_With_Task
1067 E : Entity_Id) return Node_Id
1069 Loc : constant Source_Ptr := Sloc (N);
1072 Make_Function_Call (Loc,
1073 Name => New_Reference_To (E, Loc),
1074 Parameter_Associations => New_List (Concurrent_Ref (N)));
1075 end Build_Call_With_Task;
1077 --------------------------------
1078 -- Build_Corresponding_Record --
1079 --------------------------------
1081 function Build_Corresponding_Record
1084 Loc : Source_Ptr) return Node_Id
1086 Rec_Ent : constant Entity_Id :=
1087 Make_Defining_Identifier
1088 (Loc, New_External_Name (Chars (Ctyp), 'V'));
1091 New_Disc : Entity_Id;
1095 Set_Corresponding_Record_Type (Ctyp, Rec_Ent);
1096 Set_Ekind (Rec_Ent, E_Record_Type);
1097 Set_Has_Delayed_Freeze (Rec_Ent, Has_Delayed_Freeze (Ctyp));
1098 Set_Is_Concurrent_Record_Type (Rec_Ent, True);
1099 Set_Corresponding_Concurrent_Type (Rec_Ent, Ctyp);
1100 Set_Stored_Constraint (Rec_Ent, No_Elist);
1103 -- Use discriminals to create list of discriminants for record, and
1104 -- create new discriminals for use in default expressions, etc. It is
1105 -- worth noting that a task discriminant gives rise to 5 entities;
1107 -- a) The original discriminant.
1108 -- b) The discriminal for use in the task.
1109 -- c) The discriminant of the corresponding record.
1110 -- d) The discriminal for the init proc of the corresponding record.
1111 -- e) The local variable that renames the discriminant in the procedure
1112 -- for the task body.
1114 -- In fact the discriminals b) are used in the renaming declarations
1115 -- for e). See details in einfo (Handling of Discriminants).
1117 if Present (Discriminant_Specifications (N)) then
1119 Disc := First_Discriminant (Ctyp);
1121 while Present (Disc) loop
1122 New_Disc := CR_Discriminant (Disc);
1125 Make_Discriminant_Specification (Loc,
1126 Defining_Identifier => New_Disc,
1127 Discriminant_Type =>
1128 New_Occurrence_Of (Etype (Disc), Loc),
1130 New_Copy (Discriminant_Default_Value (Disc))));
1132 Next_Discriminant (Disc);
1139 -- Now we can construct the record type declaration. Note that this
1140 -- record is "limited tagged". It is "limited" to reflect the underlying
1141 -- limitedness of the task or protected object that it represents, and
1142 -- ensuring for example that it is properly passed by reference. It is
1143 -- "tagged" to give support to dispatching calls through interfaces. We
1144 -- propagate here the list of interfaces covered by the concurrent type
1145 -- (Ada 2005: AI-345).
1148 Make_Full_Type_Declaration (Loc,
1149 Defining_Identifier => Rec_Ent,
1150 Discriminant_Specifications => Dlist,
1152 Make_Record_Definition (Loc,
1154 Make_Component_List (Loc,
1155 Component_Items => Cdecls),
1157 Ada_Version >= Ada_2005 and then Is_Tagged_Type (Ctyp),
1158 Interface_List => Interface_List (N),
1159 Limited_Present => True));
1160 end Build_Corresponding_Record;
1162 ----------------------------------
1163 -- Build_Entry_Count_Expression --
1164 ----------------------------------
1166 function Build_Entry_Count_Expression
1167 (Concurrent_Type : Node_Id;
1168 Component_List : List_Id;
1169 Loc : Source_Ptr) return Node_Id
1181 -- Count number of non-family entries
1184 Ent := First_Entity (Concurrent_Type);
1185 while Present (Ent) loop
1186 if Ekind (Ent) = E_Entry then
1193 Ecount := Make_Integer_Literal (Loc, Eindx);
1195 -- Loop through entry families building the addition nodes
1197 Ent := First_Entity (Concurrent_Type);
1198 Comp := First (Component_List);
1199 while Present (Ent) loop
1200 if Ekind (Ent) = E_Entry_Family then
1201 while Chars (Ent) /= Chars (Defining_Identifier (Comp)) loop
1205 Typ := Etype (Discrete_Subtype_Definition (Parent (Ent)));
1206 Hi := Type_High_Bound (Typ);
1207 Lo := Type_Low_Bound (Typ);
1208 Large := Is_Potentially_Large_Family
1209 (Base_Type (Typ), Concurrent_Type, Lo, Hi);
1212 Left_Opnd => Ecount,
1213 Right_Opnd => Family_Size
1214 (Loc, Hi, Lo, Concurrent_Type, Large));
1221 end Build_Entry_Count_Expression;
1223 -----------------------
1224 -- Build_Entry_Names --
1225 -----------------------
1227 function Build_Entry_Names (Conc_Typ : Entity_Id) return Node_Id is
1228 Loc : constant Source_Ptr := Sloc (Conc_Typ);
1234 Typ : Entity_Id := Conc_Typ;
1236 procedure Build_Entry_Family_Name (Id : Entity_Id);
1238 -- for Lnn in Family_Low .. Family_High loop
1241 -- (_init._object <or> _init._task_id,
1243 -- new String ("<Entry name>(" & Lnn'Img & ")"));
1245 -- Note that the bounds of the range may reference discriminants. The
1246 -- above construct is added directly to the statements of the block.
1248 procedure Build_Entry_Name (Id : Entity_Id);
1252 -- (_init._object <or>_init._task_id,
1254 -- new String ("<Entry name>");
1255 -- The above construct is added directly to the statements of the block.
1257 function Build_Set_Entry_Name_Call (Arg3 : Node_Id) return Node_Id;
1258 -- Generate the call to the runtime routine Set_Entry_Name with actuals
1259 -- _init._task_id or _init._object, Inn and Arg3.
1261 procedure Increment_Index (Stmts : List_Id);
1262 -- Generate the following and add it to Stmts
1265 -----------------------------
1266 -- Build_Entry_Family_Name --
1267 -----------------------------
1269 procedure Build_Entry_Family_Name (Id : Entity_Id) is
1270 Def : constant Node_Id :=
1271 Discrete_Subtype_Definition (Parent (Id));
1272 L_Id : constant Entity_Id := Make_Temporary (Loc, 'L');
1273 L_Stmts : constant List_Id := New_List;
1276 function Build_Range (Def : Node_Id) return Node_Id;
1277 -- Given a discrete subtype definition of an entry family, generate a
1278 -- range node which covers the range of Def's type.
1284 function Build_Range (Def : Node_Id) return Node_Id is
1285 High : Node_Id := Type_High_Bound (Etype (Def));
1286 Low : Node_Id := Type_Low_Bound (Etype (Def));
1289 -- If a bound references a discriminant, generate an identifier
1290 -- with the same name. Resolution will map it to the formals of
1293 if Is_Entity_Name (Low)
1294 and then Ekind (Entity (Low)) = E_Discriminant
1296 Low := Make_Identifier (Loc, Chars (Low));
1298 Low := New_Copy_Tree (Low);
1301 if Is_Entity_Name (High)
1302 and then Ekind (Entity (High)) = E_Discriminant
1304 High := Make_Identifier (Loc, Chars (High));
1306 High := New_Copy_Tree (High);
1312 High_Bound => High);
1315 -- Start of processing for Build_Entry_Family_Name
1318 Get_Name_String (Chars (Id));
1320 -- Add a leading '('
1322 Add_Char_To_Name_Buffer ('(');
1325 -- new String'("<Entry name>(" & Lnn'Img & ")");
1327 -- This is an implicit heap allocation, and Comes_From_Source is
1328 -- False, which ensures that it will get flagged as a violation of
1329 -- No_Implicit_Heap_Allocations when that restriction applies.
1332 Make_Allocator (Loc,
1333 Make_Qualified_Expression (Loc,
1335 New_Reference_To (Standard_String, Loc),
1337 Make_Op_Concat (Loc,
1339 Make_Op_Concat (Loc,
1341 Make_String_Literal (Loc,
1342 Strval => String_From_Name_Buffer),
1344 Make_Attribute_Reference (Loc,
1346 New_Reference_To (L_Id, Loc),
1347 Attribute_Name => Name_Img)),
1349 Make_String_Literal (Loc,
1352 Increment_Index (L_Stmts);
1353 Append_To (L_Stmts, Build_Set_Entry_Name_Call (Val));
1356 -- for Lnn in Family_Low .. Family_High loop
1359 -- (_init._object <or> _init._task_id, Inn, <Val>);
1363 Make_Loop_Statement (Loc,
1365 Make_Iteration_Scheme (Loc,
1366 Loop_Parameter_Specification =>
1367 Make_Loop_Parameter_Specification (Loc,
1368 Defining_Identifier => L_Id,
1369 Discrete_Subtype_Definition => Build_Range (Def))),
1370 Statements => L_Stmts,
1371 End_Label => Empty));
1372 end Build_Entry_Family_Name;
1374 ----------------------
1375 -- Build_Entry_Name --
1376 ----------------------
1378 procedure Build_Entry_Name (Id : Entity_Id) is
1382 Get_Name_String (Chars (Id));
1384 -- This is an implicit heap allocation, and Comes_From_Source is
1385 -- False, which ensures that it will get flagged as a violation of
1386 -- No_Implicit_Heap_Allocations when that restriction applies.
1389 Make_Allocator (Loc,
1390 Make_Qualified_Expression (Loc,
1392 New_Reference_To (Standard_String, Loc),
1394 Make_String_Literal (Loc,
1395 String_From_Name_Buffer)));
1397 Increment_Index (B_Stmts);
1398 Append_To (B_Stmts, Build_Set_Entry_Name_Call (Val));
1399 end Build_Entry_Name;
1401 -------------------------------
1402 -- Build_Set_Entry_Name_Call --
1403 -------------------------------
1405 function Build_Set_Entry_Name_Call (Arg3 : Node_Id) return Node_Id is
1410 -- Determine the proper name for the first argument and the RTS
1413 if Is_Protected_Type (Typ) then
1414 Arg1 := Name_uObject;
1415 Proc := RO_PE_Set_Entry_Name;
1417 else pragma Assert (Is_Task_Type (Typ));
1418 Arg1 := Name_uTask_Id;
1419 Proc := RO_TS_Set_Entry_Name;
1423 -- Set_Entry_Name (_init.Arg1, Inn, Arg3);
1426 Make_Procedure_Call_Statement (Loc,
1428 New_Reference_To (RTE (Proc), Loc),
1429 Parameter_Associations => New_List (
1430 Make_Selected_Component (Loc, -- _init._object
1431 Prefix => -- _init._task_id
1432 Make_Identifier (Loc, Name_uInit),
1434 Make_Identifier (Loc, Arg1)),
1435 New_Reference_To (Index, Loc), -- Inn
1437 end Build_Set_Entry_Name_Call;
1439 ---------------------
1440 -- Increment_Index --
1441 ---------------------
1443 procedure Increment_Index (Stmts : List_Id) is
1449 Make_Assignment_Statement (Loc,
1451 New_Reference_To (Index, Loc),
1455 New_Reference_To (Index, Loc),
1457 Make_Integer_Literal (Loc, 1))));
1458 end Increment_Index;
1460 -- Start of processing for Build_Entry_Names
1463 -- Retrieve the original concurrent type
1465 if Is_Concurrent_Record_Type (Typ) then
1466 Typ := Corresponding_Concurrent_Type (Typ);
1469 pragma Assert (Is_Protected_Type (Typ) or else Is_Task_Type (Typ));
1471 -- Nothing to do if the type has no entries
1473 if not Has_Entries (Typ) then
1477 -- Avoid generating entry names for a protected type with only one entry
1479 if Is_Protected_Type (Typ)
1480 and then Find_Protection_Type (Typ) /= RTE (RE_Protection_Entries)
1485 Index := Make_Temporary (Loc, 'I');
1487 -- Step 1: Generate the declaration of the index variable:
1488 -- Inn : Protected_Entry_Index := 0;
1490 -- Inn : Task_Entry_Index := 0;
1492 if Is_Protected_Type (Typ) then
1493 Index_Typ := RE_Protected_Entry_Index;
1495 Index_Typ := RE_Task_Entry_Index;
1498 B_Decls := New_List;
1500 Make_Object_Declaration (Loc,
1501 Defining_Identifier => Index,
1502 Object_Definition => New_Reference_To (RTE (Index_Typ), Loc),
1503 Expression => Make_Integer_Literal (Loc, 0)));
1505 B_Stmts := New_List;
1507 -- Step 2: Generate a call to Set_Entry_Name for each entry and entry
1510 Comp := First_Entity (Typ);
1511 while Present (Comp) loop
1512 if Ekind (Comp) = E_Entry then
1513 Build_Entry_Name (Comp);
1515 elsif Ekind (Comp) = E_Entry_Family then
1516 Build_Entry_Family_Name (Comp);
1522 -- Step 3: Wrap the statements in a block
1525 Make_Block_Statement (Loc,
1526 Declarations => B_Decls,
1527 Handled_Statement_Sequence =>
1528 Make_Handled_Sequence_Of_Statements (Loc,
1529 Statements => B_Stmts));
1530 end Build_Entry_Names;
1532 ---------------------------
1533 -- Build_Parameter_Block --
1534 ---------------------------
1536 function Build_Parameter_Block
1540 Decls : List_Id) return Entity_Id
1546 Has_Comp : Boolean := False;
1550 Actual := First (Actuals);
1552 Formal := Defining_Identifier (First (Formals));
1554 while Present (Actual) loop
1555 if not Is_Controlling_Actual (Actual) then
1558 -- type Ann is access all <actual-type>
1560 Comp_Nam := Make_Temporary (Loc, 'A');
1563 Make_Full_Type_Declaration (Loc,
1564 Defining_Identifier => Comp_Nam,
1566 Make_Access_To_Object_Definition (Loc,
1567 All_Present => True,
1568 Constant_Present => Ekind (Formal) = E_In_Parameter,
1569 Subtype_Indication =>
1570 New_Reference_To (Etype (Actual), Loc))));
1576 Make_Component_Declaration (Loc,
1577 Defining_Identifier =>
1578 Make_Defining_Identifier (Loc, Chars (Formal)),
1579 Component_Definition =>
1580 Make_Component_Definition (Loc,
1583 Subtype_Indication =>
1584 New_Reference_To (Comp_Nam, Loc))));
1589 Next_Actual (Actual);
1590 Next_Formal_With_Extras (Formal);
1593 Rec_Nam := Make_Temporary (Loc, 'P');
1598 -- type Pnn is record
1603 -- where Pnn is a parameter wrapping record, Param1 .. ParamN are
1604 -- the original parameter names and Ann1 .. AnnN are the access to
1608 Make_Full_Type_Declaration (Loc,
1609 Defining_Identifier =>
1612 Make_Record_Definition (Loc,
1614 Make_Component_List (Loc, Comps))));
1617 -- type Pnn is null record;
1620 Make_Full_Type_Declaration (Loc,
1621 Defining_Identifier =>
1624 Make_Record_Definition (Loc,
1625 Null_Present => True,
1626 Component_List => Empty)));
1630 end Build_Parameter_Block;
1632 --------------------------------------
1633 -- Build_Renamed_Formal_Declaration --
1634 --------------------------------------
1636 function Build_Renamed_Formal_Declaration
1640 Renamed_Formal : Node_Id) return Node_Id
1642 Loc : constant Source_Ptr := Sloc (New_F);
1646 -- If the formal is a tagged incomplete type, it is already passed
1647 -- by reference, so it is sufficient to rename the pointer component
1648 -- that corresponds to the actual. Otherwise we need to dereference
1649 -- the pointer component to obtain the actual.
1651 if Is_Incomplete_Type (Etype (Formal))
1652 and then Is_Tagged_Type (Etype (Formal))
1655 Make_Object_Renaming_Declaration (Loc,
1656 Defining_Identifier => New_F,
1657 Subtype_Mark => New_Reference_To (Etype (Comp), Loc),
1658 Name => Renamed_Formal);
1662 Make_Object_Renaming_Declaration (Loc,
1663 Defining_Identifier => New_F,
1664 Subtype_Mark => New_Reference_To (Etype (Formal), Loc),
1666 Make_Explicit_Dereference (Loc, Renamed_Formal));
1670 end Build_Renamed_Formal_Declaration;
1672 -----------------------
1673 -- Build_PPC_Wrapper --
1674 -----------------------
1676 procedure Build_PPC_Wrapper (E : Entity_Id; Decl : Node_Id) is
1677 Loc : constant Source_Ptr := Sloc (E);
1678 Synch_Type : constant Entity_Id := Scope (E);
1680 Wrapper_Id : constant Entity_Id :=
1681 Make_Defining_Identifier (Loc,
1682 Chars => New_External_Name (Chars (E), 'E'));
1683 -- the wrapper procedure name
1685 Wrapper_Body : Node_Id;
1687 Synch_Id : constant Entity_Id :=
1688 Make_Defining_Identifier (Loc,
1689 Chars => New_External_Name (Chars (Scope (E)), 'A'));
1690 -- The parameter that designates the synchronized object in the call
1692 Actuals : constant List_Id := New_List;
1693 -- the actuals in the entry call.
1695 Decls : constant List_Id := New_List;
1697 Entry_Call : Node_Id;
1698 Entry_Name : Node_Id;
1701 -- The specification of the wrapper procedure
1705 -- Only build the wrapper if entry has pre/postconditions.
1706 -- Should this be done unconditionally instead ???
1712 P := Spec_PPC_List (Contract (E));
1717 -- Transfer ppc pragmas to the declarations of the wrapper
1719 while Present (P) loop
1720 if Pragma_Name (P) = Name_Precondition
1721 or else Pragma_Name (P) = Name_Postcondition
1723 Append (Relocate_Node (P), Decls);
1724 Set_Analyzed (Last (Decls), False);
1727 P := Next_Pragma (P);
1731 -- First formal is synchronized object
1734 Make_Parameter_Specification (Loc,
1735 Defining_Identifier => Synch_Id,
1736 Out_Present => True,
1738 Parameter_Type => New_Occurrence_Of (Scope (E), Loc)));
1741 Make_Selected_Component (Loc,
1742 Prefix => New_Occurrence_Of (Synch_Id, Loc),
1743 Selector_Name => New_Occurrence_Of (E, Loc));
1745 -- If entity is entry family, second formal is the corresponding index,
1746 -- and entry name is an indexed component.
1748 if Ekind (E) = E_Entry_Family then
1750 Index : constant Entity_Id :=
1751 Make_Defining_Identifier (Loc, Name_I);
1754 Make_Parameter_Specification (Loc,
1755 Defining_Identifier => Index,
1757 New_Occurrence_Of (Entry_Index_Type (E), Loc)));
1760 Make_Indexed_Component (Loc,
1761 Prefix => Entry_Name,
1762 Expressions => New_List (New_Occurrence_Of (Index, Loc)));
1767 Make_Procedure_Call_Statement (Loc,
1769 Parameter_Associations => Actuals);
1771 -- Now add formals that match those of the entry, and build actuals for
1772 -- the nested entry call.
1776 New_Form : Entity_Id;
1777 Parm_Spec : Node_Id;
1780 Form := First_Formal (E);
1781 while Present (Form) loop
1782 New_Form := Make_Defining_Identifier (Loc, Chars (Form));
1784 Make_Parameter_Specification (Loc,
1785 Defining_Identifier => New_Form,
1786 Out_Present => Out_Present (Parent (Form)),
1787 In_Present => In_Present (Parent (Form)),
1788 Parameter_Type => New_Occurrence_Of (Etype (Form), Loc));
1790 Append (Parm_Spec, Specs);
1791 Append (New_Occurrence_Of (New_Form, Loc), Actuals);
1796 -- Add renaming declarations for the discriminants of the enclosing
1797 -- type, which may be visible in the preconditions.
1799 if Has_Discriminants (Synch_Type) then
1805 D := First_Discriminant (Synch_Type);
1806 while Present (D) loop
1808 Make_Object_Renaming_Declaration (Loc,
1809 Defining_Identifier =>
1810 Make_Defining_Identifier (Loc, Chars (D)),
1811 Subtype_Mark => New_Reference_To (Etype (D), Loc),
1813 Make_Selected_Component (Loc,
1814 Prefix => New_Reference_To (Synch_Id, Loc),
1815 Selector_Name => Make_Identifier (Loc, Chars (D))));
1816 Prepend (Decl, Decls);
1817 Next_Discriminant (D);
1822 Set_PPC_Wrapper (E, Wrapper_Id);
1824 Make_Subprogram_Body (Loc,
1826 Make_Procedure_Specification (Loc,
1827 Defining_Unit_Name => Wrapper_Id,
1828 Parameter_Specifications => Specs),
1829 Declarations => Decls,
1830 Handled_Statement_Sequence =>
1831 Make_Handled_Sequence_Of_Statements (Loc,
1832 Statements => New_List (Entry_Call)));
1834 -- The wrapper body is analyzed when the enclosing type is frozen
1836 Append_Freeze_Action (Defining_Entity (Decl), Wrapper_Body);
1837 end Build_PPC_Wrapper;
1839 --------------------------
1840 -- Build_Wrapper_Bodies --
1841 --------------------------
1843 procedure Build_Wrapper_Bodies
1848 Rec_Typ : Entity_Id;
1850 function Build_Wrapper_Body
1852 Subp_Id : Entity_Id;
1853 Obj_Typ : Entity_Id;
1854 Formals : List_Id) return Node_Id;
1855 -- Ada 2005 (AI-345): Build the body that wraps a primitive operation
1856 -- associated with a protected or task type. Subp_Id is the subprogram
1857 -- name which will be wrapped. Obj_Typ is the type of the new formal
1858 -- parameter which handles dispatching and object notation. Formals are
1859 -- the original formals of Subp_Id which will be explicitly replicated.
1861 ------------------------
1862 -- Build_Wrapper_Body --
1863 ------------------------
1865 function Build_Wrapper_Body
1867 Subp_Id : Entity_Id;
1868 Obj_Typ : Entity_Id;
1869 Formals : List_Id) return Node_Id
1871 Body_Spec : Node_Id;
1874 Body_Spec := Build_Wrapper_Spec (Subp_Id, Obj_Typ, Formals);
1876 -- The subprogram is not overriding or is not a primitive declared
1877 -- between two views.
1879 if No (Body_Spec) then
1884 Actuals : List_Id := No_List;
1886 First_Form : Node_Id;
1891 -- Map formals to actuals. Use the list built for the wrapper
1892 -- spec, skipping the object notation parameter.
1894 First_Form := First (Parameter_Specifications (Body_Spec));
1896 Formal := First_Form;
1899 if Present (Formal) then
1900 Actuals := New_List;
1901 while Present (Formal) loop
1903 Make_Identifier (Loc,
1904 Chars => Chars (Defining_Identifier (Formal))));
1909 -- Special processing for primitives declared between a private
1910 -- type and its completion: the wrapper needs a properly typed
1911 -- parameter if the wrapped operation has a controlling first
1912 -- parameter. Note that this might not be the case for a function
1913 -- with a controlling result.
1915 if Is_Private_Primitive_Subprogram (Subp_Id) then
1916 if No (Actuals) then
1917 Actuals := New_List;
1920 if Is_Controlling_Formal (First_Formal (Subp_Id)) then
1921 Prepend_To (Actuals,
1922 Unchecked_Convert_To
1923 (Corresponding_Concurrent_Type (Obj_Typ),
1924 Make_Identifier (Loc, Name_uO)));
1927 Prepend_To (Actuals,
1928 Make_Identifier (Loc,
1929 Chars => Chars (Defining_Identifier (First_Form))));
1932 Nam := New_Reference_To (Subp_Id, Loc);
1934 -- An access-to-variable object parameter requires an explicit
1935 -- dereference in the unchecked conversion. This case occurs
1936 -- when a protected entry wrapper must override an interface
1937 -- level procedure with interface access as first parameter.
1939 -- O.all.Subp_Id (Formal_1, ..., Formal_N)
1941 if Nkind (Parameter_Type (First_Form)) =
1945 Make_Explicit_Dereference (Loc,
1946 Prefix => Make_Identifier (Loc, Name_uO));
1948 Conv_Id := Make_Identifier (Loc, Name_uO);
1952 Make_Selected_Component (Loc,
1954 Unchecked_Convert_To
1955 (Corresponding_Concurrent_Type (Obj_Typ), Conv_Id),
1956 Selector_Name => New_Reference_To (Subp_Id, Loc));
1959 -- Create the subprogram body. For a function, the call to the
1960 -- actual subprogram has to be converted to the corresponding
1961 -- record if it is a controlling result.
1963 if Ekind (Subp_Id) = E_Function then
1969 Make_Function_Call (Loc,
1971 Parameter_Associations => Actuals);
1973 if Has_Controlling_Result (Subp_Id) then
1975 Unchecked_Convert_To
1976 (Corresponding_Record_Type (Etype (Subp_Id)), Res);
1980 Make_Subprogram_Body (Loc,
1981 Specification => Body_Spec,
1982 Declarations => Empty_List,
1983 Handled_Statement_Sequence =>
1984 Make_Handled_Sequence_Of_Statements (Loc,
1985 Statements => New_List (
1986 Make_Simple_Return_Statement (Loc, Res))));
1991 Make_Subprogram_Body (Loc,
1992 Specification => Body_Spec,
1993 Declarations => Empty_List,
1994 Handled_Statement_Sequence =>
1995 Make_Handled_Sequence_Of_Statements (Loc,
1996 Statements => New_List (
1997 Make_Procedure_Call_Statement (Loc,
1999 Parameter_Associations => Actuals))));
2002 end Build_Wrapper_Body;
2004 -- Start of processing for Build_Wrapper_Bodies
2007 if Is_Concurrent_Type (Typ) then
2008 Rec_Typ := Corresponding_Record_Type (Typ);
2013 -- Generate wrapper bodies for a concurrent type which implements an
2016 if Present (Interfaces (Rec_Typ)) then
2018 Insert_Nod : Node_Id;
2020 Prim_Elmt : Elmt_Id;
2021 Prim_Decl : Node_Id;
2023 Wrap_Body : Node_Id;
2024 Wrap_Id : Entity_Id;
2029 -- Examine all primitive operations of the corresponding record
2030 -- type, looking for wrapper specs. Generate bodies in order to
2033 Prim_Elmt := First_Elmt (Primitive_Operations (Rec_Typ));
2034 while Present (Prim_Elmt) loop
2035 Prim := Node (Prim_Elmt);
2037 if (Ekind (Prim) = E_Function
2038 or else Ekind (Prim) = E_Procedure)
2039 and then Is_Primitive_Wrapper (Prim)
2041 Subp := Wrapped_Entity (Prim);
2042 Prim_Decl := Parent (Parent (Prim));
2045 Build_Wrapper_Body (Loc,
2048 Formals => Parameter_Specifications (Parent (Subp)));
2049 Wrap_Id := Defining_Unit_Name (Specification (Wrap_Body));
2051 Set_Corresponding_Spec (Wrap_Body, Prim);
2052 Set_Corresponding_Body (Prim_Decl, Wrap_Id);
2054 Insert_After (Insert_Nod, Wrap_Body);
2055 Insert_Nod := Wrap_Body;
2057 Analyze (Wrap_Body);
2060 Next_Elmt (Prim_Elmt);
2064 end Build_Wrapper_Bodies;
2066 ------------------------
2067 -- Build_Wrapper_Spec --
2068 ------------------------
2070 function Build_Wrapper_Spec
2071 (Subp_Id : Entity_Id;
2072 Obj_Typ : Entity_Id;
2073 Formals : List_Id) return Node_Id
2075 Loc : constant Source_Ptr := Sloc (Subp_Id);
2076 First_Param : Node_Id;
2078 Iface_Elmt : Elmt_Id;
2079 Iface_Op : Entity_Id;
2080 Iface_Op_Elmt : Elmt_Id;
2082 function Overriding_Possible
2083 (Iface_Op : Entity_Id;
2084 Wrapper : Entity_Id) return Boolean;
2085 -- Determine whether a primitive operation can be overridden by Wrapper.
2086 -- Iface_Op is the candidate primitive operation of an interface type,
2087 -- Wrapper is the generated entry wrapper.
2089 function Replicate_Formals
2091 Formals : List_Id) return List_Id;
2092 -- An explicit parameter replication is required due to the Is_Entry_
2093 -- Formal flag being set for all the formals of an entry. The explicit
2094 -- replication removes the flag that would otherwise cause a different
2095 -- path of analysis.
2097 -------------------------
2098 -- Overriding_Possible --
2099 -------------------------
2101 function Overriding_Possible
2102 (Iface_Op : Entity_Id;
2103 Wrapper : Entity_Id) return Boolean
2105 Iface_Op_Spec : constant Node_Id := Parent (Iface_Op);
2106 Wrapper_Spec : constant Node_Id := Parent (Wrapper);
2108 function Type_Conformant_Parameters
2109 (Iface_Op_Params : List_Id;
2110 Wrapper_Params : List_Id) return Boolean;
2111 -- Determine whether the parameters of the generated entry wrapper
2112 -- and those of a primitive operation are type conformant. During
2113 -- this check, the first parameter of the primitive operation is
2114 -- skipped if it is a controlling argument: protected functions
2115 -- may have a controlling result.
2117 --------------------------------
2118 -- Type_Conformant_Parameters --
2119 --------------------------------
2121 function Type_Conformant_Parameters
2122 (Iface_Op_Params : List_Id;
2123 Wrapper_Params : List_Id) return Boolean
2125 Iface_Op_Param : Node_Id;
2126 Iface_Op_Typ : Entity_Id;
2127 Wrapper_Param : Node_Id;
2128 Wrapper_Typ : Entity_Id;
2131 -- Skip the first (controlling) parameter of primitive operation
2133 Iface_Op_Param := First (Iface_Op_Params);
2135 if Present (First_Formal (Iface_Op))
2136 and then Is_Controlling_Formal (First_Formal (Iface_Op))
2138 Iface_Op_Param := Next (Iface_Op_Param);
2141 Wrapper_Param := First (Wrapper_Params);
2142 while Present (Iface_Op_Param)
2143 and then Present (Wrapper_Param)
2145 Iface_Op_Typ := Find_Parameter_Type (Iface_Op_Param);
2146 Wrapper_Typ := Find_Parameter_Type (Wrapper_Param);
2148 -- The two parameters must be mode conformant
2150 if not Conforming_Types
2151 (Iface_Op_Typ, Wrapper_Typ, Mode_Conformant)
2156 Next (Iface_Op_Param);
2157 Next (Wrapper_Param);
2160 -- One of the lists is longer than the other
2162 if Present (Iface_Op_Param) or else Present (Wrapper_Param) then
2167 end Type_Conformant_Parameters;
2169 -- Start of processing for Overriding_Possible
2172 if Chars (Iface_Op) /= Chars (Wrapper) then
2176 -- If an inherited subprogram is implemented by a protected procedure
2177 -- or an entry, then the first parameter of the inherited subprogram
2178 -- shall be of mode OUT or IN OUT, or access-to-variable parameter.
2180 if Ekind (Iface_Op) = E_Procedure
2181 and then Present (Parameter_Specifications (Iface_Op_Spec))
2184 Obj_Param : constant Node_Id :=
2185 First (Parameter_Specifications (Iface_Op_Spec));
2187 if not Out_Present (Obj_Param)
2188 and then Nkind (Parameter_Type (Obj_Param)) /=
2197 Type_Conformant_Parameters (
2198 Parameter_Specifications (Iface_Op_Spec),
2199 Parameter_Specifications (Wrapper_Spec));
2200 end Overriding_Possible;
2202 -----------------------
2203 -- Replicate_Formals --
2204 -----------------------
2206 function Replicate_Formals
2208 Formals : List_Id) return List_Id
2210 New_Formals : constant List_Id := New_List;
2212 Param_Type : Node_Id;
2215 Formal := First (Formals);
2217 -- Skip the object parameter when dealing with primitives declared
2218 -- between two views.
2220 if Is_Private_Primitive_Subprogram (Subp_Id)
2221 and then not Has_Controlling_Result (Subp_Id)
2223 Formal := Next (Formal);
2226 while Present (Formal) loop
2228 -- Create an explicit copy of the entry parameter
2230 -- When creating the wrapper subprogram for a primitive operation
2231 -- of a protected interface we must construct an equivalent
2232 -- signature to that of the overriding operation. For regular
2233 -- parameters we can just use the type of the formal, but for
2234 -- access to subprogram parameters we need to reanalyze the
2235 -- parameter type to create local entities for the signature of
2236 -- the subprogram type. Using the entities of the overriding
2237 -- subprogram will result in out-of-scope errors in the back-end.
2239 if Nkind (Parameter_Type (Formal)) = N_Access_Definition then
2240 Param_Type := Copy_Separate_Tree (Parameter_Type (Formal));
2243 New_Reference_To (Etype (Parameter_Type (Formal)), Loc);
2246 Append_To (New_Formals,
2247 Make_Parameter_Specification (Loc,
2248 Defining_Identifier =>
2249 Make_Defining_Identifier (Loc,
2250 Chars => Chars (Defining_Identifier (Formal))),
2251 In_Present => In_Present (Formal),
2252 Out_Present => Out_Present (Formal),
2253 Parameter_Type => Param_Type));
2259 end Replicate_Formals;
2261 -- Start of processing for Build_Wrapper_Spec
2264 -- There is no point in building wrappers for non-tagged concurrent
2267 pragma Assert (Is_Tagged_Type (Obj_Typ));
2269 -- An entry or a protected procedure can override a routine where the
2270 -- controlling formal is either IN OUT, OUT or is of access-to-variable
2271 -- type. Since the wrapper must have the exact same signature as that of
2272 -- the overridden subprogram, we try to find the overriding candidate
2273 -- and use its controlling formal.
2275 First_Param := Empty;
2277 -- Check every implemented interface
2279 if Present (Interfaces (Obj_Typ)) then
2280 Iface_Elmt := First_Elmt (Interfaces (Obj_Typ));
2281 Search : while Present (Iface_Elmt) loop
2282 Iface := Node (Iface_Elmt);
2284 -- Check every interface primitive
2286 if Present (Primitive_Operations (Iface)) then
2287 Iface_Op_Elmt := First_Elmt (Primitive_Operations (Iface));
2288 while Present (Iface_Op_Elmt) loop
2289 Iface_Op := Node (Iface_Op_Elmt);
2291 -- Ignore predefined primitives
2293 if not Is_Predefined_Dispatching_Operation (Iface_Op) then
2294 Iface_Op := Ultimate_Alias (Iface_Op);
2296 -- The current primitive operation can be overridden by
2297 -- the generated entry wrapper.
2299 if Overriding_Possible (Iface_Op, Subp_Id) then
2301 First (Parameter_Specifications (Parent (Iface_Op)));
2307 Next_Elmt (Iface_Op_Elmt);
2311 Next_Elmt (Iface_Elmt);
2315 -- Ada 2012 (AI05-0090-1): If no interface primitive is covered by
2316 -- this subprogram and this is not a primitive declared between two
2317 -- views then force the generation of a wrapper. As an optimization,
2318 -- previous versions of the frontend avoid generating the wrapper;
2319 -- however, the wrapper facilitates locating and reporting an error
2320 -- when a duplicate declaration is found later. See example in
2324 and then not Is_Private_Primitive_Subprogram (Subp_Id)
2327 (Corresponding_Concurrent_Type (Obj_Typ))
2330 Make_Parameter_Specification (Loc,
2331 Defining_Identifier => Make_Defining_Identifier (Loc, Name_uO),
2333 Out_Present => False,
2334 Parameter_Type => New_Reference_To (Obj_Typ, Loc));
2336 -- For entries and procedures of protected types the mode of
2337 -- the controlling argument must be in-out.
2341 Make_Parameter_Specification (Loc,
2342 Defining_Identifier =>
2343 Make_Defining_Identifier (Loc,
2346 Out_Present => (Ekind (Subp_Id) /= E_Function),
2347 Parameter_Type => New_Reference_To (Obj_Typ, Loc));
2352 Wrapper_Id : constant Entity_Id :=
2353 Make_Defining_Identifier (Loc, Chars (Subp_Id));
2354 New_Formals : List_Id;
2355 Obj_Param : Node_Id;
2356 Obj_Param_Typ : Entity_Id;
2359 -- Minimum decoration is needed to catch the entity in
2360 -- Sem_Ch6.Override_Dispatching_Operation.
2362 if Ekind (Subp_Id) = E_Function then
2363 Set_Ekind (Wrapper_Id, E_Function);
2365 Set_Ekind (Wrapper_Id, E_Procedure);
2368 Set_Is_Primitive_Wrapper (Wrapper_Id);
2369 Set_Wrapped_Entity (Wrapper_Id, Subp_Id);
2370 Set_Is_Private_Primitive (Wrapper_Id,
2371 Is_Private_Primitive_Subprogram (Subp_Id));
2373 -- Process the formals
2375 New_Formals := Replicate_Formals (Loc, Formals);
2377 -- A function with a controlling result and no first controlling
2378 -- formal needs no additional parameter.
2380 if Has_Controlling_Result (Subp_Id)
2382 (No (First_Formal (Subp_Id))
2383 or else not Is_Controlling_Formal (First_Formal (Subp_Id)))
2387 -- Routine Subp_Id has been found to override an interface primitive.
2388 -- If the interface operation has an access parameter, create a copy
2389 -- of it, with the same null exclusion indicator if present.
2391 elsif Present (First_Param) then
2392 if Nkind (Parameter_Type (First_Param)) = N_Access_Definition then
2394 Make_Access_Definition (Loc,
2396 New_Reference_To (Obj_Typ, Loc));
2397 Set_Null_Exclusion_Present (Obj_Param_Typ,
2398 Null_Exclusion_Present (Parameter_Type (First_Param)));
2401 Obj_Param_Typ := New_Reference_To (Obj_Typ, Loc);
2405 Make_Parameter_Specification (Loc,
2406 Defining_Identifier =>
2407 Make_Defining_Identifier (Loc,
2409 In_Present => In_Present (First_Param),
2410 Out_Present => Out_Present (First_Param),
2411 Parameter_Type => Obj_Param_Typ);
2413 Prepend_To (New_Formals, Obj_Param);
2415 -- If we are dealing with a primitive declared between two views,
2416 -- implemented by a synchronized operation, we need to create
2417 -- a default parameter. The mode of the parameter must match that
2418 -- of the primitive operation.
2421 pragma Assert (Is_Private_Primitive_Subprogram (Subp_Id));
2423 Make_Parameter_Specification (Loc,
2424 Defining_Identifier =>
2425 Make_Defining_Identifier (Loc, Name_uO),
2426 In_Present => In_Present (Parent (First_Entity (Subp_Id))),
2427 Out_Present => Ekind (Subp_Id) /= E_Function,
2428 Parameter_Type => New_Reference_To (Obj_Typ, Loc));
2429 Prepend_To (New_Formals, Obj_Param);
2432 -- Build the final spec. If it is a function with a controlling
2433 -- result, it is a primitive operation of the corresponding
2434 -- record type, so mark the spec accordingly.
2436 if Ekind (Subp_Id) = E_Function then
2441 if Has_Controlling_Result (Subp_Id) then
2444 (Corresponding_Record_Type (Etype (Subp_Id)), Loc);
2446 Res_Def := New_Copy (Result_Definition (Parent (Subp_Id)));
2450 Make_Function_Specification (Loc,
2451 Defining_Unit_Name => Wrapper_Id,
2452 Parameter_Specifications => New_Formals,
2453 Result_Definition => Res_Def);
2457 Make_Procedure_Specification (Loc,
2458 Defining_Unit_Name => Wrapper_Id,
2459 Parameter_Specifications => New_Formals);
2462 end Build_Wrapper_Spec;
2464 -------------------------
2465 -- Build_Wrapper_Specs --
2466 -------------------------
2468 procedure Build_Wrapper_Specs
2474 Rec_Typ : Entity_Id;
2475 procedure Scan_Declarations (L : List_Id);
2476 -- Common processing for visible and private declarations
2477 -- of a protected type.
2479 procedure Scan_Declarations (L : List_Id) is
2481 Wrap_Decl : Node_Id;
2482 Wrap_Spec : Node_Id;
2490 while Present (Decl) loop
2493 if Nkind (Decl) = N_Entry_Declaration
2494 and then Ekind (Defining_Identifier (Decl)) = E_Entry
2498 (Subp_Id => Defining_Identifier (Decl),
2500 Formals => Parameter_Specifications (Decl));
2502 elsif Nkind (Decl) = N_Subprogram_Declaration then
2505 (Subp_Id => Defining_Unit_Name (Specification (Decl)),
2508 Parameter_Specifications (Specification (Decl)));
2511 if Present (Wrap_Spec) then
2513 Make_Subprogram_Declaration (Loc,
2514 Specification => Wrap_Spec);
2516 Insert_After (N, Wrap_Decl);
2519 Analyze (Wrap_Decl);
2524 end Scan_Declarations;
2526 -- start of processing for Build_Wrapper_Specs
2529 if Is_Protected_Type (Typ) then
2530 Def := Protected_Definition (Parent (Typ));
2531 else pragma Assert (Is_Task_Type (Typ));
2532 Def := Task_Definition (Parent (Typ));
2535 Rec_Typ := Corresponding_Record_Type (Typ);
2537 -- Generate wrapper specs for a concurrent type which implements an
2538 -- interface. Operations in both the visible and private parts may
2539 -- implement progenitor operations.
2541 if Present (Interfaces (Rec_Typ))
2542 and then Present (Def)
2544 Scan_Declarations (Visible_Declarations (Def));
2545 Scan_Declarations (Private_Declarations (Def));
2547 end Build_Wrapper_Specs;
2549 ---------------------------
2550 -- Build_Find_Body_Index --
2551 ---------------------------
2553 function Build_Find_Body_Index (Typ : Entity_Id) return Node_Id is
2554 Loc : constant Source_Ptr := Sloc (Typ);
2557 Has_F : Boolean := False;
2559 If_St : Node_Id := Empty;
2562 Decls : List_Id := New_List;
2565 Siz : Node_Id := Empty;
2567 procedure Add_If_Clause (Expr : Node_Id);
2568 -- Add test for range of current entry
2570 function Convert_Discriminant_Ref (Bound : Node_Id) return Node_Id;
2571 -- If a bound of an entry is given by a discriminant, retrieve the
2572 -- actual value of the discriminant from the enclosing object.
2578 procedure Add_If_Clause (Expr : Node_Id) is
2580 Stats : constant List_Id :=
2582 Make_Simple_Return_Statement (Loc,
2583 Expression => Make_Integer_Literal (Loc, Index + 1)));
2586 -- Index for current entry body
2590 -- Compute total length of entry queues so far
2598 Right_Opnd => Expr);
2603 Left_Opnd => Make_Identifier (Loc, Name_uE),
2606 -- Map entry queue indexes in the range of the current family
2607 -- into the current index, that designates the entry body.
2611 Make_Implicit_If_Statement (Typ,
2613 Then_Statements => Stats,
2614 Elsif_Parts => New_List);
2620 Make_Elsif_Part (Loc,
2622 Then_Statements => Stats),
2623 Elsif_Parts (If_St));
2627 ------------------------------
2628 -- Convert_Discriminant_Ref --
2629 ------------------------------
2631 function Convert_Discriminant_Ref (Bound : Node_Id) return Node_Id is
2635 if Is_Entity_Name (Bound)
2636 and then Ekind (Entity (Bound)) = E_Discriminant
2639 Make_Selected_Component (Loc,
2641 Unchecked_Convert_To (Corresponding_Record_Type (Typ),
2642 Make_Explicit_Dereference (Loc,
2643 Make_Identifier (Loc, Name_uObject))),
2644 Selector_Name => Make_Identifier (Loc, Chars (Bound)));
2645 Set_Etype (B, Etype (Entity (Bound)));
2647 B := New_Copy_Tree (Bound);
2651 end Convert_Discriminant_Ref;
2653 -- Start of processing for Build_Find_Body_Index
2656 Spec := Build_Find_Body_Index_Spec (Typ);
2658 Ent := First_Entity (Typ);
2659 while Present (Ent) loop
2660 if Ekind (Ent) = E_Entry_Family then
2670 -- If the protected type has no entry families, there is a one-one
2671 -- correspondence between entry queue and entry body.
2674 Make_Simple_Return_Statement (Loc,
2675 Expression => Make_Identifier (Loc, Name_uE));
2678 -- Suppose entries e1, e2, ... have size l1, l2, ... we generate
2681 -- if E <= l1 then return 1;
2682 -- elsif E <= l1 + l2 then return 2;
2687 Ent := First_Entity (Typ);
2689 Add_Object_Pointer (Loc, Typ, Decls);
2691 while Present (Ent) loop
2692 if Ekind (Ent) = E_Entry then
2693 Add_If_Clause (Make_Integer_Literal (Loc, 1));
2695 elsif Ekind (Ent) = E_Entry_Family then
2696 E_Typ := Etype (Discrete_Subtype_Definition (Parent (Ent)));
2697 Hi := Convert_Discriminant_Ref (Type_High_Bound (E_Typ));
2698 Lo := Convert_Discriminant_Ref (Type_Low_Bound (E_Typ));
2699 Add_If_Clause (Family_Size (Loc, Hi, Lo, Typ, False));
2708 Make_Simple_Return_Statement (Loc,
2709 Expression => Make_Integer_Literal (Loc, 1));
2711 elsif Nkind (Ret) = N_If_Statement then
2713 -- Ranges are in increasing order, so last one doesn't need guard
2716 Nod : constant Node_Id := Last (Elsif_Parts (Ret));
2719 Set_Else_Statements (Ret, Then_Statements (Nod));
2725 Make_Subprogram_Body (Loc,
2726 Specification => Spec,
2727 Declarations => Decls,
2728 Handled_Statement_Sequence =>
2729 Make_Handled_Sequence_Of_Statements (Loc,
2730 Statements => New_List (Ret)));
2731 end Build_Find_Body_Index;
2733 --------------------------------
2734 -- Build_Find_Body_Index_Spec --
2735 --------------------------------
2737 function Build_Find_Body_Index_Spec (Typ : Entity_Id) return Node_Id is
2738 Loc : constant Source_Ptr := Sloc (Typ);
2739 Id : constant Entity_Id :=
2740 Make_Defining_Identifier (Loc,
2741 Chars => New_External_Name (Chars (Typ), 'F'));
2742 Parm1 : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uO);
2743 Parm2 : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uE);
2747 Make_Function_Specification (Loc,
2748 Defining_Unit_Name => Id,
2749 Parameter_Specifications => New_List (
2750 Make_Parameter_Specification (Loc,
2751 Defining_Identifier => Parm1,
2753 New_Reference_To (RTE (RE_Address), Loc)),
2755 Make_Parameter_Specification (Loc,
2756 Defining_Identifier => Parm2,
2758 New_Reference_To (RTE (RE_Protected_Entry_Index), Loc))),
2759 Result_Definition => New_Occurrence_Of (
2760 RTE (RE_Protected_Entry_Index), Loc));
2761 end Build_Find_Body_Index_Spec;
2763 -------------------------
2764 -- Build_Master_Entity --
2765 -------------------------
2767 procedure Build_Master_Entity (E : Entity_Id) is
2768 Loc : constant Source_Ptr := Sloc (E);
2774 S := Find_Master_Scope (E);
2776 -- Nothing to do if we already built a master entity for this scope
2777 -- or if there is no task hierarchy.
2779 if Has_Master_Entity (S)
2780 or else Restriction_Active (No_Task_Hierarchy)
2785 -- Otherwise first build the master entity
2786 -- _Master : constant Master_Id := Current_Master.all;
2787 -- and insert it just before the current declaration
2790 Make_Object_Declaration (Loc,
2791 Defining_Identifier =>
2792 Make_Defining_Identifier (Loc, Name_uMaster),
2793 Constant_Present => True,
2794 Object_Definition => New_Reference_To (RTE (RE_Master_Id), Loc),
2796 Make_Explicit_Dereference (Loc,
2797 New_Reference_To (RTE (RE_Current_Master), Loc)));
2800 Insert_Before (P, Decl);
2803 Set_Has_Master_Entity (S);
2805 -- Now mark the containing scope as a task master
2807 while Nkind (P) /= N_Compilation_Unit loop
2810 -- If we fall off the top, we are at the outer level, and the
2811 -- environment task is our effective master, so nothing to mark.
2814 (P, N_Task_Body, N_Block_Statement, N_Subprogram_Body)
2816 Set_Is_Task_Master (P, True);
2819 elsif Nkind (Parent (P)) = N_Subunit then
2820 P := Corresponding_Stub (Parent (P));
2823 end Build_Master_Entity;
2825 -----------------------------------------
2826 -- Build_Private_Protected_Declaration --
2827 -----------------------------------------
2829 function Build_Private_Protected_Declaration
2830 (N : Node_Id) return Entity_Id
2832 Loc : constant Source_Ptr := Sloc (N);
2833 Body_Id : constant Entity_Id := Defining_Entity (N);
2838 Spec_Id : Entity_Id;
2841 Formal := First_Formal (Body_Id);
2843 -- The protected operation always has at least one formal, namely the
2844 -- object itself, but it is only placed in the parameter list if
2845 -- expansion is enabled.
2847 if Present (Formal) or else Expander_Active then
2848 Plist := Copy_Parameter_List (Body_Id);
2853 if Nkind (Specification (N)) = N_Procedure_Specification then
2855 Make_Procedure_Specification (Loc,
2856 Defining_Unit_Name =>
2857 Make_Defining_Identifier (Sloc (Body_Id),
2858 Chars => Chars (Body_Id)),
2859 Parameter_Specifications =>
2863 Make_Function_Specification (Loc,
2864 Defining_Unit_Name =>
2865 Make_Defining_Identifier (Sloc (Body_Id),
2866 Chars => Chars (Body_Id)),
2867 Parameter_Specifications => Plist,
2868 Result_Definition =>
2869 New_Occurrence_Of (Etype (Body_Id), Loc));
2872 Decl := Make_Subprogram_Declaration (Loc, Specification => New_Spec);
2873 Insert_Before (N, Decl);
2874 Spec_Id := Defining_Unit_Name (New_Spec);
2876 -- Indicate that the entity comes from source, to ensure that cross-
2877 -- reference information is properly generated. The body itself is
2878 -- rewritten during expansion, and the body entity will not appear in
2879 -- calls to the operation.
2881 Set_Comes_From_Source (Spec_Id, True);
2883 Set_Has_Completion (Spec_Id);
2884 Set_Convention (Spec_Id, Convention_Protected);
2886 end Build_Private_Protected_Declaration;
2888 ---------------------------
2889 -- Build_Protected_Entry --
2890 ---------------------------
2892 function Build_Protected_Entry
2895 Pid : Node_Id) return Node_Id
2897 Loc : constant Source_Ptr := Sloc (N);
2899 Decls : constant List_Id := Declarations (N);
2900 End_Lab : constant Node_Id :=
2901 End_Label (Handled_Statement_Sequence (N));
2902 End_Loc : constant Source_Ptr :=
2903 Sloc (Last (Statements (Handled_Statement_Sequence (N))));
2904 -- Used for the generated call to Complete_Entry_Body
2906 Han_Loc : Source_Ptr;
2907 -- Used for the exception handler, inserted at end of the body
2909 Op_Decls : constant List_Id := New_List;
2917 -- Set the source location on the exception handler only when debugging
2918 -- the expanded code (see Make_Implicit_Exception_Handler).
2920 if Debug_Generated_Code then
2923 -- Otherwise the inserted code should not be visible to the debugger
2926 Han_Loc := No_Location;
2930 Make_Defining_Identifier (Loc,
2931 Chars => Chars (Protected_Body_Subprogram (Ent)));
2933 Build_Protected_Entry_Specification (Loc, Edef, Empty);
2935 -- Add the following declarations:
2936 -- type poVP is access poV;
2937 -- _object : poVP := poVP (_O);
2939 -- where _O is the formal parameter associated with the concurrent
2940 -- object. These declarations are needed for Complete_Entry_Body.
2942 Add_Object_Pointer (Loc, Pid, Op_Decls);
2944 -- Add renamings for all formals, the Protection object, discriminals,
2945 -- privals and the entry index constant for use by debugger.
2947 Add_Formal_Renamings (Espec, Op_Decls, Ent, Loc);
2948 Debug_Private_Data_Declarations (Decls);
2950 case Corresponding_Runtime_Package (Pid) is
2951 when System_Tasking_Protected_Objects_Entries =>
2953 New_Reference_To (RTE (RE_Complete_Entry_Body), Loc);
2955 when System_Tasking_Protected_Objects_Single_Entry =>
2957 New_Reference_To (RTE (RE_Complete_Single_Entry_Body), Loc);
2960 raise Program_Error;
2963 Op_Stats := New_List (
2964 Make_Block_Statement (Loc,
2965 Declarations => Decls,
2966 Handled_Statement_Sequence =>
2967 Handled_Statement_Sequence (N)),
2969 Make_Procedure_Call_Statement (End_Loc,
2971 Parameter_Associations => New_List (
2972 Make_Attribute_Reference (End_Loc,
2974 Make_Selected_Component (End_Loc,
2975 Prefix => Make_Identifier (End_Loc, Name_uObject),
2976 Selector_Name => Make_Identifier (End_Loc, Name_uObject)),
2977 Attribute_Name => Name_Unchecked_Access))));
2979 -- When exceptions can not be propagated, we never need to call
2980 -- Exception_Complete_Entry_Body
2982 if No_Exception_Handlers_Set then
2984 Make_Subprogram_Body (Loc,
2985 Specification => Espec,
2986 Declarations => Op_Decls,
2987 Handled_Statement_Sequence =>
2988 Make_Handled_Sequence_Of_Statements (Loc,
2989 Statements => Op_Stats,
2990 End_Label => End_Lab));
2993 Ohandle := Make_Others_Choice (Loc);
2994 Set_All_Others (Ohandle);
2996 case Corresponding_Runtime_Package (Pid) is
2997 when System_Tasking_Protected_Objects_Entries =>
3000 (RTE (RE_Exceptional_Complete_Entry_Body), Loc);
3002 when System_Tasking_Protected_Objects_Single_Entry =>
3005 (RTE (RE_Exceptional_Complete_Single_Entry_Body), Loc);
3008 raise Program_Error;
3011 -- Establish link between subprogram body entity and source entry.
3013 Set_Corresponding_Protected_Entry (Edef, Ent);
3015 -- Create body of entry procedure. The renaming declarations are
3016 -- placed ahead of the block that contains the actual entry body.
3019 Make_Subprogram_Body (Loc,
3020 Specification => Espec,
3021 Declarations => Op_Decls,
3022 Handled_Statement_Sequence =>
3023 Make_Handled_Sequence_Of_Statements (Loc,
3024 Statements => Op_Stats,
3025 End_Label => End_Lab,
3026 Exception_Handlers => New_List (
3027 Make_Implicit_Exception_Handler (Han_Loc,
3028 Exception_Choices => New_List (Ohandle),
3030 Statements => New_List (
3031 Make_Procedure_Call_Statement (Han_Loc,
3033 Parameter_Associations => New_List (
3034 Make_Attribute_Reference (Han_Loc,
3036 Make_Selected_Component (Han_Loc,
3038 Make_Identifier (Han_Loc, Name_uObject),
3040 Make_Identifier (Han_Loc, Name_uObject)),
3041 Attribute_Name => Name_Unchecked_Access),
3043 Make_Function_Call (Han_Loc,
3044 Name => New_Reference_To (
3045 RTE (RE_Get_GNAT_Exception), Loc)))))))));
3047 end Build_Protected_Entry;
3049 -----------------------------------------
3050 -- Build_Protected_Entry_Specification --
3051 -----------------------------------------
3053 function Build_Protected_Entry_Specification
3056 Ent_Id : Entity_Id) return Node_Id
3058 P : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uP);
3061 Set_Debug_Info_Needed (Def_Id);
3063 if Present (Ent_Id) then
3064 Append_Elmt (P, Accept_Address (Ent_Id));
3068 Make_Procedure_Specification (Loc,
3069 Defining_Unit_Name => Def_Id,
3070 Parameter_Specifications => New_List (
3071 Make_Parameter_Specification (Loc,
3072 Defining_Identifier =>
3073 Make_Defining_Identifier (Loc, Name_uO),
3075 New_Reference_To (RTE (RE_Address), Loc)),
3077 Make_Parameter_Specification (Loc,
3078 Defining_Identifier => P,
3080 New_Reference_To (RTE (RE_Address), Loc)),
3082 Make_Parameter_Specification (Loc,
3083 Defining_Identifier =>
3084 Make_Defining_Identifier (Loc, Name_uE),
3086 New_Reference_To (RTE (RE_Protected_Entry_Index), Loc))));
3087 end Build_Protected_Entry_Specification;
3089 --------------------------
3090 -- Build_Protected_Spec --
3091 --------------------------
3093 function Build_Protected_Spec
3095 Obj_Type : Entity_Id;
3097 Unprotected : Boolean := False) return List_Id
3099 Loc : constant Source_Ptr := Sloc (N);
3102 New_Plist : List_Id;
3103 New_Param : Node_Id;
3106 New_Plist := New_List;
3108 Formal := First_Formal (Ident);
3109 while Present (Formal) loop
3111 Make_Parameter_Specification (Loc,
3112 Defining_Identifier =>
3113 Make_Defining_Identifier (Sloc (Formal), Chars (Formal)),
3114 In_Present => In_Present (Parent (Formal)),
3115 Out_Present => Out_Present (Parent (Formal)),
3116 Parameter_Type => New_Reference_To (Etype (Formal), Loc));
3119 Set_Protected_Formal (Formal, Defining_Identifier (New_Param));
3122 Append (New_Param, New_Plist);
3123 Next_Formal (Formal);
3126 -- If the subprogram is a procedure and the context is not an access
3127 -- to protected subprogram, the parameter is in-out. Otherwise it is
3131 Make_Parameter_Specification (Loc,
3132 Defining_Identifier =>
3133 Make_Defining_Identifier (Loc, Name_uObject),
3136 (Etype (Ident) = Standard_Void_Type
3137 and then not Is_RTE (Obj_Type, RE_Address)),
3139 New_Reference_To (Obj_Type, Loc));
3140 Set_Debug_Info_Needed (Defining_Identifier (Decl));
3141 Prepend_To (New_Plist, Decl);
3144 end Build_Protected_Spec;
3146 ---------------------------------------
3147 -- Build_Protected_Sub_Specification --
3148 ---------------------------------------
3150 function Build_Protected_Sub_Specification
3152 Prot_Typ : Entity_Id;
3153 Mode : Subprogram_Protection_Mode) return Node_Id
3155 Loc : constant Source_Ptr := Sloc (N);
3159 New_Plist : List_Id;
3162 Append_Chr : constant array (Subprogram_Protection_Mode) of Character :=
3163 (Dispatching_Mode => ' ',
3164 Protected_Mode => 'P',
3165 Unprotected_Mode => 'N');
3168 if Ekind (Defining_Unit_Name (Specification (N))) =
3171 Decl := Unit_Declaration_Node (Corresponding_Spec (N));
3176 Def_Id := Defining_Unit_Name (Specification (Decl));
3179 Build_Protected_Spec
3180 (Decl, Corresponding_Record_Type (Prot_Typ), Def_Id,
3181 Mode = Unprotected_Mode);
3183 Make_Defining_Identifier (Loc,
3184 Chars => Build_Selected_Name (Prot_Typ, Def_Id, Append_Chr (Mode)));
3186 -- The unprotected operation carries the user code, and debugging
3187 -- information must be generated for it, even though this spec does
3188 -- not come from source. It is also convenient to allow gdb to step
3189 -- into the protected operation, even though it only contains lock/
3192 Set_Debug_Info_Needed (New_Id);
3194 -- If a pragma Eliminate applies to the source entity, the internal
3195 -- subprograms will be eliminated as well.
3197 Set_Is_Eliminated (New_Id, Is_Eliminated (Def_Id));
3199 if Nkind (Specification (Decl)) = N_Procedure_Specification then
3201 Make_Procedure_Specification (Loc,
3202 Defining_Unit_Name => New_Id,
3203 Parameter_Specifications => New_Plist);
3205 -- Create a new specification for the anonymous subprogram type
3209 Make_Function_Specification (Loc,
3210 Defining_Unit_Name => New_Id,
3211 Parameter_Specifications => New_Plist,
3212 Result_Definition =>
3213 Copy_Result_Type (Result_Definition (Specification (Decl))));
3215 Set_Return_Present (Defining_Unit_Name (New_Spec));
3219 end Build_Protected_Sub_Specification;
3221 -------------------------------------
3222 -- Build_Protected_Subprogram_Body --
3223 -------------------------------------
3225 function Build_Protected_Subprogram_Body
3228 N_Op_Spec : Node_Id) return Node_Id
3230 Loc : constant Source_Ptr := Sloc (N);
3232 P_Op_Spec : Node_Id;
3235 Unprot_Call : Node_Id;
3237 Lock_Name : Node_Id;
3238 Lock_Stmt : Node_Id;
3239 Service_Name : Node_Id;
3241 Return_Stmt : Node_Id := Empty; -- init to avoid gcc 3 warning
3242 Pre_Stmts : List_Id := No_List; -- init to avoid gcc 3 warning
3244 Object_Parm : Node_Id;
3247 function Is_Exception_Safe (Subprogram : Node_Id) return Boolean;
3248 -- Tell whether a given subprogram cannot raise an exception
3250 -----------------------
3251 -- Is_Exception_Safe --
3252 -----------------------
3254 function Is_Exception_Safe (Subprogram : Node_Id) return Boolean is
3256 function Has_Side_Effect (N : Node_Id) return Boolean;
3257 -- Return True whenever encountering a subprogram call or raise
3258 -- statement of any kind in the sequence of statements
3260 ---------------------
3261 -- Has_Side_Effect --
3262 ---------------------
3264 -- What is this doing buried two levels down in exp_ch9. It seems
3265 -- like a generally useful function, and indeed there may be code
3266 -- duplication going on here ???
3268 function Has_Side_Effect (N : Node_Id) return Boolean is
3272 function Is_Call_Or_Raise (N : Node_Id) return Boolean;
3273 -- Indicate whether N is a subprogram call or a raise statement
3275 ----------------------
3276 -- Is_Call_Or_Raise --
3277 ----------------------
3279 function Is_Call_Or_Raise (N : Node_Id) return Boolean is
3281 return Nkind_In (N, N_Procedure_Call_Statement,
3284 N_Raise_Constraint_Error,
3285 N_Raise_Program_Error,
3286 N_Raise_Storage_Error);
3287 end Is_Call_Or_Raise;
3289 -- Start of processing for Has_Side_Effect
3293 while Present (Stmt) loop
3294 if Is_Call_Or_Raise (Stmt) then
3298 -- An object declaration can also contain a function call
3299 -- or a raise statement
3301 if Nkind (Stmt) = N_Object_Declaration then
3302 Expr := Expression (Stmt);
3304 if Present (Expr) and then Is_Call_Or_Raise (Expr) then
3313 end Has_Side_Effect;
3315 -- Start of processing for Is_Exception_Safe
3318 -- If the checks handled by the back end are not disabled, we cannot
3319 -- ensure that no exception will be raised.
3321 if not Access_Checks_Suppressed (Empty)
3322 or else not Discriminant_Checks_Suppressed (Empty)
3323 or else not Range_Checks_Suppressed (Empty)
3324 or else not Index_Checks_Suppressed (Empty)
3325 or else Opt.Stack_Checking_Enabled
3330 if Has_Side_Effect (First (Declarations (Subprogram)))
3333 First (Statements (Handled_Statement_Sequence (Subprogram))))
3339 end Is_Exception_Safe;
3341 -- Start of processing for Build_Protected_Subprogram_Body
3344 Op_Spec := Specification (N);
3345 Exc_Safe := Is_Exception_Safe (N);
3348 Build_Protected_Sub_Specification (N, Pid, Protected_Mode);
3350 -- Build a list of the formal parameters of the protected version of
3351 -- the subprogram to use as the actual parameters of the unprotected
3354 Uactuals := New_List;
3355 Pformal := First (Parameter_Specifications (P_Op_Spec));
3356 while Present (Pformal) loop
3357 Append_To (Uactuals,
3358 Make_Identifier (Loc, Chars (Defining_Identifier (Pformal))));
3362 -- Make a call to the unprotected version of the subprogram built above
3363 -- for use by the protected version built below.
3365 if Nkind (Op_Spec) = N_Function_Specification then
3367 R := Make_Temporary (Loc, 'R');
3369 Make_Object_Declaration (Loc,
3370 Defining_Identifier => R,
3371 Constant_Present => True,
3372 Object_Definition => New_Copy (Result_Definition (N_Op_Spec)),
3374 Make_Function_Call (Loc,
3375 Name => Make_Identifier (Loc,
3376 Chars => Chars (Defining_Unit_Name (N_Op_Spec))),
3377 Parameter_Associations => Uactuals));
3380 Make_Simple_Return_Statement (Loc,
3381 Expression => New_Reference_To (R, Loc));
3384 Unprot_Call := Make_Simple_Return_Statement (Loc,
3385 Expression => Make_Function_Call (Loc,
3387 Make_Identifier (Loc,
3388 Chars => Chars (Defining_Unit_Name (N_Op_Spec))),
3389 Parameter_Associations => Uactuals));
3394 Make_Procedure_Call_Statement (Loc,
3396 Make_Identifier (Loc, Chars (Defining_Unit_Name (N_Op_Spec))),
3397 Parameter_Associations => Uactuals);
3400 -- Wrap call in block that will be covered by an at_end handler
3402 if not Exc_Safe then
3403 Unprot_Call := Make_Block_Statement (Loc,
3404 Handled_Statement_Sequence =>
3405 Make_Handled_Sequence_Of_Statements (Loc,
3406 Statements => New_List (Unprot_Call)));
3409 -- Make the protected subprogram body. This locks the protected
3410 -- object and calls the unprotected version of the subprogram.
3412 case Corresponding_Runtime_Package (Pid) is
3413 when System_Tasking_Protected_Objects_Entries =>
3414 Lock_Name := New_Reference_To (RTE (RE_Lock_Entries), Loc);
3415 Service_Name := New_Reference_To (RTE (RE_Service_Entries), Loc);
3417 when System_Tasking_Protected_Objects_Single_Entry =>
3418 Lock_Name := New_Reference_To (RTE (RE_Lock_Entry), Loc);
3419 Service_Name := New_Reference_To (RTE (RE_Service_Entry), Loc);
3421 when System_Tasking_Protected_Objects =>
3422 Lock_Name := New_Reference_To (RTE (RE_Lock), Loc);
3423 Service_Name := New_Reference_To (RTE (RE_Unlock), Loc);
3426 raise Program_Error;
3430 Make_Attribute_Reference (Loc,
3432 Make_Selected_Component (Loc,
3433 Prefix => Make_Identifier (Loc, Name_uObject),
3434 Selector_Name => Make_Identifier (Loc, Name_uObject)),
3435 Attribute_Name => Name_Unchecked_Access);
3437 Lock_Stmt := Make_Procedure_Call_Statement (Loc,
3439 Parameter_Associations => New_List (Object_Parm));
3441 if Abort_Allowed then
3443 Make_Procedure_Call_Statement (Loc,
3444 Name => New_Reference_To (RTE (RE_Abort_Defer), Loc),
3445 Parameter_Associations => Empty_List),
3449 Stmts := New_List (Lock_Stmt);
3452 if not Exc_Safe then
3453 Append (Unprot_Call, Stmts);
3455 if Nkind (Op_Spec) = N_Function_Specification then
3457 Stmts := Empty_List;
3459 Append (Unprot_Call, Stmts);
3463 Make_Procedure_Call_Statement (Loc,
3464 Name => Service_Name,
3465 Parameter_Associations =>
3466 New_List (New_Copy_Tree (Object_Parm))),
3469 if Abort_Allowed then
3471 Make_Procedure_Call_Statement (Loc,
3472 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc),
3473 Parameter_Associations => Empty_List),
3477 if Nkind (Op_Spec) = N_Function_Specification then
3478 Append (Return_Stmt, Stmts);
3479 Append (Make_Block_Statement (Loc,
3480 Declarations => New_List (Unprot_Call),
3481 Handled_Statement_Sequence =>
3482 Make_Handled_Sequence_Of_Statements (Loc,
3483 Statements => Stmts)), Pre_Stmts);
3489 Make_Subprogram_Body (Loc,
3490 Declarations => Empty_List,
3491 Specification => P_Op_Spec,
3492 Handled_Statement_Sequence =>
3493 Make_Handled_Sequence_Of_Statements (Loc, Statements => Stmts));
3495 if not Exc_Safe then
3496 Set_Is_Protected_Subprogram_Body (Sub_Body);
3500 end Build_Protected_Subprogram_Body;
3502 -------------------------------------
3503 -- Build_Protected_Subprogram_Call --
3504 -------------------------------------
3506 procedure Build_Protected_Subprogram_Call
3510 External : Boolean := True)
3512 Loc : constant Source_Ptr := Sloc (N);
3513 Sub : constant Entity_Id := Entity (Name);
3519 New_Sub := New_Occurrence_Of (External_Subprogram (Sub), Loc);
3522 New_Occurrence_Of (Protected_Body_Subprogram (Sub), Loc);
3525 if Present (Parameter_Associations (N)) then
3526 Params := New_Copy_List_Tree (Parameter_Associations (N));
3531 -- If the type is an untagged derived type, convert to the root type,
3532 -- which is the one on which the operations are defined.
3534 if Nkind (Rec) = N_Unchecked_Type_Conversion
3535 and then not Is_Tagged_Type (Etype (Rec))
3536 and then Is_Derived_Type (Etype (Rec))
3538 Set_Etype (Rec, Root_Type (Etype (Rec)));
3539 Set_Subtype_Mark (Rec,
3540 New_Occurrence_Of (Root_Type (Etype (Rec)), Sloc (N)));
3543 Prepend (Rec, Params);
3545 if Ekind (Sub) = E_Procedure then
3547 Make_Procedure_Call_Statement (Loc,
3549 Parameter_Associations => Params));
3552 pragma Assert (Ekind (Sub) = E_Function);
3554 Make_Function_Call (Loc,
3556 Parameter_Associations => Params));
3560 and then Nkind (Rec) = N_Unchecked_Type_Conversion
3561 and then Is_Entity_Name (Expression (Rec))
3562 and then Is_Shared_Passive (Entity (Expression (Rec)))
3564 Add_Shared_Var_Lock_Procs (N);
3566 end Build_Protected_Subprogram_Call;
3568 -------------------------
3569 -- Build_Selected_Name --
3570 -------------------------
3572 function Build_Selected_Name
3573 (Prefix : Entity_Id;
3574 Selector : Entity_Id;
3575 Append_Char : Character := ' ') return Name_Id
3577 Select_Buffer : String (1 .. Hostparm.Max_Name_Length);
3578 Select_Len : Natural;
3581 Get_Name_String (Chars (Selector));
3582 Select_Len := Name_Len;
3583 Select_Buffer (1 .. Select_Len) := Name_Buffer (1 .. Name_Len);
3584 Get_Name_String (Chars (Prefix));
3586 -- If scope is anonymous type, discard suffix to recover name of
3587 -- single protected object. Otherwise use protected type name.
3589 if Name_Buffer (Name_Len) = 'T' then
3590 Name_Len := Name_Len - 1;
3593 Add_Str_To_Name_Buffer ("__");
3594 for J in 1 .. Select_Len loop
3595 Add_Char_To_Name_Buffer (Select_Buffer (J));
3598 -- Now add the Append_Char if specified. The encoding to follow
3599 -- depends on the type of entity. If Append_Char is either 'N' or 'P',
3600 -- then the entity is associated to a protected type subprogram.
3601 -- Otherwise, it is a protected type entry. For each case, the
3602 -- encoding to follow for the suffix is documented in exp_dbug.ads.
3604 -- It would be better to encapsulate this as a routine in Exp_Dbug ???
3606 if Append_Char /= ' ' then
3607 if Append_Char = 'P' or Append_Char = 'N' then
3608 Add_Char_To_Name_Buffer (Append_Char);
3611 Add_Str_To_Name_Buffer ((1 => '_', 2 => Append_Char));
3612 return New_External_Name (Name_Find, ' ', -1);
3617 end Build_Selected_Name;
3619 -----------------------------
3620 -- Build_Simple_Entry_Call --
3621 -----------------------------
3623 -- A task entry call is converted to a call to Call_Simple
3626 -- P : parms := (parm, parm, parm);
3628 -- Call_Simple (acceptor-task, entry-index, P'Address);
3634 -- Here Pnn is an aggregate of the type constructed for the entry to hold
3635 -- the parameters, and the constructed aggregate value contains either the
3636 -- parameters or, in the case of non-elementary types, references to these
3637 -- parameters. Then the address of this aggregate is passed to the runtime
3638 -- routine, along with the task id value and the task entry index value.
3639 -- Pnn is only required if parameters are present.
3641 -- The assignments after the call are present only in the case of in-out
3642 -- or out parameters for elementary types, and are used to assign back the
3643 -- resulting values of such parameters.
3645 -- Note: the reason that we insert a block here is that in the context
3646 -- of selects, conditional entry calls etc. the entry call statement
3647 -- appears on its own, not as an element of a list.
3649 -- A protected entry call is converted to a Protected_Entry_Call:
3652 -- P : E1_Params := (param, param, param);
3654 -- Bnn : Communications_Block;
3657 -- P : E1_Params := (param, param, param);
3658 -- Bnn : Communications_Block;
3661 -- Protected_Entry_Call (
3662 -- Object => po._object'Access,
3663 -- E => <entry index>;
3664 -- Uninterpreted_Data => P'Address;
3665 -- Mode => Simple_Call;
3672 procedure Build_Simple_Entry_Call
3681 -- If call has been inlined, nothing left to do
3683 if Nkind (N) = N_Block_Statement then
3687 -- Convert entry call to Call_Simple call
3690 Loc : constant Source_Ptr := Sloc (N);
3691 Parms : constant List_Id := Parameter_Associations (N);
3692 Stats : constant List_Id := New_List;
3695 Comm_Name : Entity_Id;
3699 Ent_Acc : Entity_Id;
3701 Iface_Tag : Entity_Id;
3702 Iface_Typ : Entity_Id;
3715 -- Simple entry and entry family cases merge here
3717 Ent := Entity (Ename);
3718 Ent_Acc := Entry_Parameters_Type (Ent);
3719 Conctyp := Etype (Concval);
3721 -- If prefix is an access type, dereference to obtain the task type
3723 if Is_Access_Type (Conctyp) then
3724 Conctyp := Designated_Type (Conctyp);
3727 -- Special case for protected subprogram calls
3729 if Is_Protected_Type (Conctyp)
3730 and then Is_Subprogram (Entity (Ename))
3732 if not Is_Eliminated (Entity (Ename)) then
3733 Build_Protected_Subprogram_Call
3734 (N, Ename, Convert_Concurrent (Concval, Conctyp));
3741 -- First parameter is the Task_Id value from the task value or the
3742 -- Object from the protected object value, obtained by selecting
3743 -- the _Task_Id or _Object from the result of doing an unchecked
3744 -- conversion to convert the value to the corresponding record type.
3746 if Nkind (Concval) = N_Function_Call
3747 and then Is_Task_Type (Conctyp)
3748 and then Ada_Version >= Ada_2005
3751 ExpR : constant Node_Id := Relocate_Node (Concval);
3752 Obj : constant Entity_Id := Make_Temporary (Loc, 'F', ExpR);
3757 Make_Object_Declaration (Loc,
3758 Defining_Identifier => Obj,
3759 Object_Definition => New_Occurrence_Of (Conctyp, Loc),
3760 Expression => ExpR);
3761 Set_Etype (Obj, Conctyp);
3762 Decls := New_List (Decl);
3763 Rewrite (Concval, New_Occurrence_Of (Obj, Loc));
3770 Parm1 := Concurrent_Ref (Concval);
3772 -- Second parameter is the entry index, computed by the routine
3773 -- provided for this purpose. The value of this expression is
3774 -- assigned to an intermediate variable to assure that any entry
3775 -- family index expressions are evaluated before the entry
3779 or else Restriction_Active (No_Entry_Queue) = False
3780 or else not Is_Protected_Type (Conctyp)
3781 or else Number_Entries (Conctyp) > 1
3782 or else (Has_Attach_Handler (Conctyp)
3783 and then not Restricted_Profile)
3785 X := Make_Defining_Identifier (Loc, Name_uX);
3788 Make_Object_Declaration (Loc,
3789 Defining_Identifier => X,
3790 Object_Definition =>
3791 New_Reference_To (RTE (RE_Task_Entry_Index), Loc),
3792 Expression => Actual_Index_Expression (
3793 Loc, Entity (Ename), Index, Concval));
3795 Append_To (Decls, Xdecl);
3796 Parm2 := New_Reference_To (X, Loc);
3803 -- The third parameter is the packaged parameters. If there are
3804 -- none, then it is just the null address, since nothing is passed.
3807 Parm3 := New_Reference_To (RTE (RE_Null_Address), Loc);
3810 -- Case of parameters present, where third argument is the address
3811 -- of a packaged record containing the required parameter values.
3814 -- First build a list of parameter values, which are references to
3815 -- objects of the parameter types.
3819 Actual := First_Actual (N);
3820 Formal := First_Formal (Ent);
3822 while Present (Actual) loop
3824 -- If it is a by_copy_type, copy it to a new variable. The
3825 -- packaged record has a field that points to this variable.
3827 if Is_By_Copy_Type (Etype (Actual)) then
3829 Make_Object_Declaration (Loc,
3830 Defining_Identifier => Make_Temporary (Loc, 'J'),
3831 Aliased_Present => True,
3832 Object_Definition =>
3833 New_Reference_To (Etype (Formal), Loc));
3835 -- Mark the object as not needing initialization since the
3836 -- initialization is performed separately, avoiding errors
3837 -- on cases such as formals of null-excluding access types.
3839 Set_No_Initialization (N_Node);
3841 -- We must make an assignment statement separate for the
3842 -- case of limited type. We cannot assign it unless the
3843 -- Assignment_OK flag is set first. An out formal of an
3844 -- access type must also be initialized from the actual,
3845 -- as stated in RM 6.4.1 (13).
3847 if Ekind (Formal) /= E_Out_Parameter
3848 or else Is_Access_Type (Etype (Formal))
3851 New_Reference_To (Defining_Identifier (N_Node), Loc);
3852 Set_Assignment_OK (N_Var);
3854 Make_Assignment_Statement (Loc,
3856 Expression => Relocate_Node (Actual)));
3859 Append (N_Node, Decls);
3862 Make_Attribute_Reference (Loc,
3863 Attribute_Name => Name_Unchecked_Access,
3865 New_Reference_To (Defining_Identifier (N_Node), Loc)));
3867 -- If it is a VM_By_Copy_Actual, copy it to a new variable
3869 elsif Is_VM_By_Copy_Actual (Actual) then
3871 Make_Object_Declaration (Loc,
3872 Defining_Identifier => Make_Temporary (Loc, 'J'),
3873 Aliased_Present => True,
3874 Object_Definition =>
3875 New_Reference_To (Etype (Formal), Loc),
3876 Expression => New_Copy_Tree (Actual));
3877 Set_Assignment_OK (N_Node);
3879 Append (N_Node, Decls);
3882 Make_Attribute_Reference (Loc,
3883 Attribute_Name => Name_Unchecked_Access,
3885 New_Reference_To (Defining_Identifier (N_Node), Loc)));
3888 -- Interface class-wide formal
3890 if Ada_Version >= Ada_2005
3891 and then Ekind (Etype (Formal)) = E_Class_Wide_Type
3892 and then Is_Interface (Etype (Formal))
3894 Iface_Typ := Etype (Etype (Formal));
3897 -- formal_iface_type! (actual.iface_tag)'reference
3900 Find_Interface_Tag (Etype (Actual), Iface_Typ);
3901 pragma Assert (Present (Iface_Tag));
3904 Make_Reference (Loc,
3905 Unchecked_Convert_To (Iface_Typ,
3906 Make_Selected_Component (Loc,
3908 Relocate_Node (Actual),
3910 New_Reference_To (Iface_Tag, Loc)))));
3916 Make_Reference (Loc, Relocate_Node (Actual)));
3920 Next_Actual (Actual);
3921 Next_Formal_With_Extras (Formal);
3924 -- Now build the declaration of parameters initialized with the
3925 -- aggregate containing this constructed parameter list.
3927 P := Make_Defining_Identifier (Loc, Name_uP);
3930 Make_Object_Declaration (Loc,
3931 Defining_Identifier => P,
3932 Object_Definition =>
3933 New_Reference_To (Designated_Type (Ent_Acc), Loc),
3935 Make_Aggregate (Loc, Expressions => Plist));
3938 Make_Attribute_Reference (Loc,
3939 Prefix => New_Reference_To (P, Loc),
3940 Attribute_Name => Name_Address);
3942 Append (Pdecl, Decls);
3945 -- Now we can create the call, case of protected type
3947 if Is_Protected_Type (Conctyp) then
3948 case Corresponding_Runtime_Package (Conctyp) is
3949 when System_Tasking_Protected_Objects_Entries =>
3951 -- Change the type of the index declaration
3953 Set_Object_Definition (Xdecl,
3954 New_Reference_To (RTE (RE_Protected_Entry_Index), Loc));
3956 -- Some additional declarations for protected entry calls
3962 -- Bnn : Communications_Block;
3964 Comm_Name := Make_Temporary (Loc, 'B');
3967 Make_Object_Declaration (Loc,
3968 Defining_Identifier => Comm_Name,
3969 Object_Definition =>
3970 New_Reference_To (RTE (RE_Communication_Block), Loc)));
3972 -- Some additional statements for protected entry calls
3974 -- Protected_Entry_Call (
3975 -- Object => po._object'Access,
3976 -- E => <entry index>;
3977 -- Uninterpreted_Data => P'Address;
3978 -- Mode => Simple_Call;
3982 Make_Procedure_Call_Statement (Loc,
3984 New_Reference_To (RTE (RE_Protected_Entry_Call), Loc),
3986 Parameter_Associations => New_List (
3987 Make_Attribute_Reference (Loc,
3988 Attribute_Name => Name_Unchecked_Access,
3992 New_Reference_To (RTE (RE_Simple_Call), Loc),
3993 New_Occurrence_Of (Comm_Name, Loc)));
3995 when System_Tasking_Protected_Objects_Single_Entry =>
3996 -- Protected_Single_Entry_Call (
3997 -- Object => po._object'Access,
3998 -- Uninterpreted_Data => P'Address;
3999 -- Mode => Simple_Call);
4002 Make_Procedure_Call_Statement (Loc,
4003 Name => New_Reference_To (
4004 RTE (RE_Protected_Single_Entry_Call), Loc),
4006 Parameter_Associations => New_List (
4007 Make_Attribute_Reference (Loc,
4008 Attribute_Name => Name_Unchecked_Access,
4011 New_Reference_To (RTE (RE_Simple_Call), Loc)));
4014 raise Program_Error;
4017 -- Case of task type
4021 Make_Procedure_Call_Statement (Loc,
4022 Name => New_Reference_To (RTE (RE_Call_Simple), Loc),
4023 Parameter_Associations => New_List (Parm1, Parm2, Parm3));
4027 Append_To (Stats, Call);
4029 -- If there are out or in/out parameters by copy add assignment
4030 -- statements for the result values.
4032 if Present (Parms) then
4033 Actual := First_Actual (N);
4034 Formal := First_Formal (Ent);
4036 Set_Assignment_OK (Actual);
4037 while Present (Actual) loop
4038 if (Is_By_Copy_Type (Etype (Actual))
4039 or else Is_VM_By_Copy_Actual (Actual))
4040 and then Ekind (Formal) /= E_In_Parameter
4043 Make_Assignment_Statement (Loc,
4044 Name => New_Copy (Actual),
4046 Make_Explicit_Dereference (Loc,
4047 Make_Selected_Component (Loc,
4048 Prefix => New_Reference_To (P, Loc),
4050 Make_Identifier (Loc, Chars (Formal)))));
4052 -- In all cases (including limited private types) we want
4053 -- the assignment to be valid.
4055 Set_Assignment_OK (Name (N_Node));
4057 -- If the call is the triggering alternative in an
4058 -- asynchronous select, or the entry_call alternative of a
4059 -- conditional entry call, the assignments for in-out
4060 -- parameters are incorporated into the statement list that
4061 -- follows, so that there are executed only if the entry
4064 if (Nkind (Parent (N)) = N_Triggering_Alternative
4065 and then N = Triggering_Statement (Parent (N)))
4067 (Nkind (Parent (N)) = N_Entry_Call_Alternative
4068 and then N = Entry_Call_Statement (Parent (N)))
4070 if No (Statements (Parent (N))) then
4071 Set_Statements (Parent (N), New_List);
4074 Prepend (N_Node, Statements (Parent (N)));
4077 Insert_After (Call, N_Node);
4081 Next_Actual (Actual);
4082 Next_Formal_With_Extras (Formal);
4086 -- Finally, create block and analyze it
4089 Make_Block_Statement (Loc,
4090 Declarations => Decls,
4091 Handled_Statement_Sequence =>
4092 Make_Handled_Sequence_Of_Statements (Loc,
4093 Statements => Stats)));
4097 end Build_Simple_Entry_Call;
4099 --------------------------------
4100 -- Build_Task_Activation_Call --
4101 --------------------------------
4103 procedure Build_Task_Activation_Call (N : Node_Id) is
4104 Loc : constant Source_Ptr := Sloc (N);
4111 -- Get the activation chain entity. Except in the case of a package
4112 -- body, this is in the node that was passed. For a package body, we
4113 -- have to find the corresponding package declaration node.
4115 if Nkind (N) = N_Package_Body then
4116 P := Corresponding_Spec (N);
4119 exit when Nkind (P) = N_Package_Declaration;
4122 Chain := Activation_Chain_Entity (P);
4125 Chain := Activation_Chain_Entity (N);
4128 if Present (Chain) then
4129 if Restricted_Profile then
4130 Name := New_Reference_To (RTE (RE_Activate_Restricted_Tasks), Loc);
4132 Name := New_Reference_To (RTE (RE_Activate_Tasks), Loc);
4136 Make_Procedure_Call_Statement (Loc,
4138 Parameter_Associations =>
4139 New_List (Make_Attribute_Reference (Loc,
4140 Prefix => New_Occurrence_Of (Chain, Loc),
4141 Attribute_Name => Name_Unchecked_Access)));
4143 if Nkind (N) = N_Package_Declaration then
4144 if Present (Corresponding_Body (N)) then
4147 elsif Present (Private_Declarations (Specification (N))) then
4148 Append (Call, Private_Declarations (Specification (N)));
4151 Append (Call, Visible_Declarations (Specification (N)));
4155 if Present (Handled_Statement_Sequence (N)) then
4157 -- The call goes at the start of the statement sequence
4158 -- after the start of exception range label if one is present.
4164 Stm := First (Statements (Handled_Statement_Sequence (N)));
4166 -- A special case, skip exception range label if one is
4167 -- present (from front end zcx processing).
4169 if Nkind (Stm) = N_Label and then Exception_Junk (Stm) then
4173 -- Another special case, if the first statement is a block
4174 -- from optimization of a local raise to a goto, then the
4175 -- call goes inside this block.
4177 if Nkind (Stm) = N_Block_Statement
4178 and then Exception_Junk (Stm)
4181 First (Statements (Handled_Statement_Sequence (Stm)));
4184 -- Insertion point is after any exception label pushes,
4185 -- since we want it covered by any local handlers.
4187 while Nkind (Stm) in N_Push_xxx_Label loop
4191 -- Now we have the proper insertion point
4193 Insert_Before (Stm, Call);
4197 Set_Handled_Statement_Sequence (N,
4198 Make_Handled_Sequence_Of_Statements (Loc,
4199 Statements => New_List (Call)));
4204 Check_Task_Activation (N);
4206 end Build_Task_Activation_Call;
4208 -------------------------------
4209 -- Build_Task_Allocate_Block --
4210 -------------------------------
4212 procedure Build_Task_Allocate_Block
4217 T : constant Entity_Id := Entity (Expression (N));
4218 Init : constant Entity_Id := Base_Init_Proc (T);
4219 Loc : constant Source_Ptr := Sloc (N);
4220 Chain : constant Entity_Id :=
4221 Make_Defining_Identifier (Loc, Name_uChain);
4222 Blkent : constant Entity_Id := Make_Temporary (Loc, 'A');
4227 Make_Block_Statement (Loc,
4228 Identifier => New_Reference_To (Blkent, Loc),
4229 Declarations => New_List (
4231 -- _Chain : Activation_Chain;
4233 Make_Object_Declaration (Loc,
4234 Defining_Identifier => Chain,
4235 Aliased_Present => True,
4236 Object_Definition =>
4237 New_Reference_To (RTE (RE_Activation_Chain), Loc))),
4239 Handled_Statement_Sequence =>
4240 Make_Handled_Sequence_Of_Statements (Loc,
4242 Statements => New_List (
4246 Make_Procedure_Call_Statement (Loc,
4247 Name => New_Reference_To (Init, Loc),
4248 Parameter_Associations => Args),
4250 -- Activate_Tasks (_Chain);
4252 Make_Procedure_Call_Statement (Loc,
4253 Name => New_Reference_To (RTE (RE_Activate_Tasks), Loc),
4254 Parameter_Associations => New_List (
4255 Make_Attribute_Reference (Loc,
4256 Prefix => New_Reference_To (Chain, Loc),
4257 Attribute_Name => Name_Unchecked_Access))))),
4259 Has_Created_Identifier => True,
4260 Is_Task_Allocation_Block => True);
4263 Make_Implicit_Label_Declaration (Loc,
4264 Defining_Identifier => Blkent,
4265 Label_Construct => Block));
4267 Append_To (Actions, Block);
4269 Set_Activation_Chain_Entity (Block, Chain);
4270 end Build_Task_Allocate_Block;
4272 -----------------------------------------------
4273 -- Build_Task_Allocate_Block_With_Init_Stmts --
4274 -----------------------------------------------
4276 procedure Build_Task_Allocate_Block_With_Init_Stmts
4279 Init_Stmts : List_Id)
4281 Loc : constant Source_Ptr := Sloc (N);
4282 Chain : constant Entity_Id :=
4283 Make_Defining_Identifier (Loc, Name_uChain);
4284 Blkent : constant Entity_Id := Make_Temporary (Loc, 'A');
4288 Append_To (Init_Stmts,
4289 Make_Procedure_Call_Statement (Loc,
4290 Name => New_Reference_To (RTE (RE_Activate_Tasks), Loc),
4291 Parameter_Associations => New_List (
4292 Make_Attribute_Reference (Loc,
4293 Prefix => New_Reference_To (Chain, Loc),
4294 Attribute_Name => Name_Unchecked_Access))));
4297 Make_Block_Statement (Loc,
4298 Identifier => New_Reference_To (Blkent, Loc),
4299 Declarations => New_List (
4301 -- _Chain : Activation_Chain;
4303 Make_Object_Declaration (Loc,
4304 Defining_Identifier => Chain,
4305 Aliased_Present => True,
4306 Object_Definition =>
4307 New_Reference_To (RTE (RE_Activation_Chain), Loc))),
4309 Handled_Statement_Sequence =>
4310 Make_Handled_Sequence_Of_Statements (Loc, Init_Stmts),
4312 Has_Created_Identifier => True,
4313 Is_Task_Allocation_Block => True);
4316 Make_Implicit_Label_Declaration (Loc,
4317 Defining_Identifier => Blkent,
4318 Label_Construct => Block));
4320 Append_To (Actions, Block);
4322 Set_Activation_Chain_Entity (Block, Chain);
4323 end Build_Task_Allocate_Block_With_Init_Stmts;
4325 -----------------------------------
4326 -- Build_Task_Proc_Specification --
4327 -----------------------------------
4329 function Build_Task_Proc_Specification (T : Entity_Id) return Node_Id is
4330 Loc : constant Source_Ptr := Sloc (T);
4331 Spec_Id : Entity_Id;
4334 -- Case of explicit task type, suffix TB
4336 if Comes_From_Source (T) then
4338 Make_Defining_Identifier (Loc,
4339 Chars => New_External_Name (Chars (T), "TB"));
4341 -- Case of anonymous task type, suffix B
4345 Make_Defining_Identifier (Loc,
4346 Chars => New_External_Name (Chars (T), 'B'));
4349 Set_Is_Internal (Spec_Id);
4351 -- Associate the procedure with the task, if this is the declaration
4352 -- (and not the body) of the procedure.
4354 if No (Task_Body_Procedure (T)) then
4355 Set_Task_Body_Procedure (T, Spec_Id);
4359 Make_Procedure_Specification (Loc,
4360 Defining_Unit_Name => Spec_Id,
4361 Parameter_Specifications => New_List (
4362 Make_Parameter_Specification (Loc,
4363 Defining_Identifier =>
4364 Make_Defining_Identifier (Loc, Name_uTask),
4366 Make_Access_Definition (Loc,
4368 New_Reference_To (Corresponding_Record_Type (T), Loc)))));
4369 end Build_Task_Proc_Specification;
4371 ---------------------------------------
4372 -- Build_Unprotected_Subprogram_Body --
4373 ---------------------------------------
4375 function Build_Unprotected_Subprogram_Body
4377 Pid : Node_Id) return Node_Id
4379 Decls : constant List_Id := Declarations (N);
4382 -- Add renamings for the Protection object, discriminals, privals and
4383 -- the entry index constant for use by debugger.
4385 Debug_Private_Data_Declarations (Decls);
4387 -- Make an unprotected version of the subprogram for use within the same
4388 -- object, with a new name and an additional parameter representing the
4392 Make_Subprogram_Body (Sloc (N),
4394 Build_Protected_Sub_Specification (N, Pid, Unprotected_Mode),
4395 Declarations => Decls,
4396 Handled_Statement_Sequence => Handled_Statement_Sequence (N));
4397 end Build_Unprotected_Subprogram_Body;
4399 ----------------------------
4400 -- Collect_Entry_Families --
4401 ----------------------------
4403 procedure Collect_Entry_Families
4406 Current_Node : in out Node_Id;
4407 Conctyp : Entity_Id)
4410 Efam_Decl : Node_Id;
4411 Efam_Type : Entity_Id;
4414 Efam := First_Entity (Conctyp);
4415 while Present (Efam) loop
4416 if Ekind (Efam) = E_Entry_Family then
4417 Efam_Type := Make_Temporary (Loc, 'F');
4422 (Etype (Discrete_Subtype_Definition (Parent (Efam))));
4424 Bas_Decl : Node_Id := Empty;
4429 (Discrete_Subtype_Definition (Parent (Efam)), Lo, Hi);
4431 if Is_Potentially_Large_Family (Bas, Conctyp, Lo, Hi) then
4432 Bas := Make_Temporary (Loc, 'B');
4435 Make_Subtype_Declaration (Loc,
4436 Defining_Identifier => Bas,
4437 Subtype_Indication =>
4438 Make_Subtype_Indication (Loc,
4440 New_Occurrence_Of (Standard_Integer, Loc),
4442 Make_Range_Constraint (Loc,
4443 Range_Expression => Make_Range (Loc,
4444 Make_Integer_Literal
4445 (Loc, -Entry_Family_Bound),
4446 Make_Integer_Literal
4447 (Loc, Entry_Family_Bound - 1)))));
4449 Insert_After (Current_Node, Bas_Decl);
4450 Current_Node := Bas_Decl;
4455 Make_Full_Type_Declaration (Loc,
4456 Defining_Identifier => Efam_Type,
4458 Make_Unconstrained_Array_Definition (Loc,
4460 (New_List (New_Occurrence_Of (Bas, Loc))),
4462 Component_Definition =>
4463 Make_Component_Definition (Loc,
4464 Aliased_Present => False,
4465 Subtype_Indication =>
4466 New_Reference_To (Standard_Character, Loc))));
4469 Insert_After (Current_Node, Efam_Decl);
4470 Current_Node := Efam_Decl;
4471 Analyze (Efam_Decl);
4474 Make_Component_Declaration (Loc,
4475 Defining_Identifier =>
4476 Make_Defining_Identifier (Loc, Chars (Efam)),
4478 Component_Definition =>
4479 Make_Component_Definition (Loc,
4480 Aliased_Present => False,
4481 Subtype_Indication =>
4482 Make_Subtype_Indication (Loc,
4484 New_Occurrence_Of (Efam_Type, Loc),
4487 Make_Index_Or_Discriminant_Constraint (Loc,
4488 Constraints => New_List (
4490 (Etype (Discrete_Subtype_Definition
4491 (Parent (Efam))), Loc)))))));
4497 end Collect_Entry_Families;
4499 -----------------------
4500 -- Concurrent_Object --
4501 -----------------------
4503 function Concurrent_Object
4504 (Spec_Id : Entity_Id;
4505 Conc_Typ : Entity_Id) return Entity_Id
4508 -- Parameter _O or _object
4510 if Is_Protected_Type (Conc_Typ) then
4511 return First_Formal (Protected_Body_Subprogram (Spec_Id));
4516 pragma Assert (Is_Task_Type (Conc_Typ));
4517 return First_Formal (Task_Body_Procedure (Conc_Typ));
4519 end Concurrent_Object;
4521 ----------------------
4522 -- Copy_Result_Type --
4523 ----------------------
4525 function Copy_Result_Type (Res : Node_Id) return Node_Id is
4526 New_Res : constant Node_Id := New_Copy_Tree (Res);
4531 -- If the result type is an access_to_subprogram, we must create
4532 -- new entities for its spec.
4534 if Nkind (New_Res) = N_Access_Definition
4535 and then Present (Access_To_Subprogram_Definition (New_Res))
4537 -- Provide new entities for the formals
4539 Par_Spec := First (Parameter_Specifications
4540 (Access_To_Subprogram_Definition (New_Res)));
4541 while Present (Par_Spec) loop
4542 Formal := Defining_Identifier (Par_Spec);
4543 Set_Defining_Identifier (Par_Spec,
4544 Make_Defining_Identifier (Sloc (Formal), Chars (Formal)));
4550 end Copy_Result_Type;
4552 --------------------
4553 -- Concurrent_Ref --
4554 --------------------
4556 -- The expression returned for a reference to a concurrent object has the
4559 -- taskV!(name)._Task_Id
4563 -- objectV!(name)._Object
4565 -- for a protected object. For the case of an access to a concurrent
4566 -- object, there is an extra explicit dereference:
4568 -- taskV!(name.all)._Task_Id
4569 -- objectV!(name.all)._Object
4571 -- here taskV and objectV are the types for the associated records, which
4572 -- contain the required _Task_Id and _Object fields for tasks and protected
4573 -- objects, respectively.
4575 -- For the case of a task type name, the expression is
4579 -- i.e. a call to the Self function which returns precisely this Task_Id
4581 -- For the case of a protected type name, the expression is
4585 -- which is a renaming of the _object field of the current object
4586 -- record, passed into protected operations as a parameter.
4588 function Concurrent_Ref (N : Node_Id) return Node_Id is
4589 Loc : constant Source_Ptr := Sloc (N);
4590 Ntyp : constant Entity_Id := Etype (N);
4594 function Is_Current_Task (T : Entity_Id) return Boolean;
4595 -- Check whether the reference is to the immediately enclosing task
4596 -- type, or to an outer one (rare but legal).
4598 ---------------------
4599 -- Is_Current_Task --
4600 ---------------------
4602 function Is_Current_Task (T : Entity_Id) return Boolean is
4606 Scop := Current_Scope;
4607 while Present (Scop)
4608 and then Scop /= Standard_Standard
4614 elsif Is_Task_Type (Scop) then
4617 -- If this is a procedure nested within the task type, we must
4618 -- assume that it can be called from an inner task, and therefore
4619 -- cannot treat it as a local reference.
4621 elsif Is_Overloadable (Scop)
4622 and then In_Open_Scopes (T)
4627 Scop := Scope (Scop);
4631 -- We know that we are within the task body, so should have found it
4634 raise Program_Error;
4635 end Is_Current_Task;
4637 -- Start of processing for Concurrent_Ref
4640 if Is_Access_Type (Ntyp) then
4641 Dtyp := Designated_Type (Ntyp);
4643 if Is_Protected_Type (Dtyp) then
4644 Sel := Name_uObject;
4646 Sel := Name_uTask_Id;
4650 Make_Selected_Component (Loc,
4652 Unchecked_Convert_To (Corresponding_Record_Type (Dtyp),
4653 Make_Explicit_Dereference (Loc, N)),
4654 Selector_Name => Make_Identifier (Loc, Sel));
4656 elsif Is_Entity_Name (N)
4657 and then Is_Concurrent_Type (Entity (N))
4659 if Is_Task_Type (Entity (N)) then
4661 if Is_Current_Task (Entity (N)) then
4663 Make_Function_Call (Loc,
4664 Name => New_Reference_To (RTE (RE_Self), Loc));
4669 T_Self : constant Entity_Id := Make_Temporary (Loc, 'T');
4670 T_Body : constant Node_Id :=
4671 Parent (Corresponding_Body (Parent (Entity (N))));
4675 Make_Object_Declaration (Loc,
4676 Defining_Identifier => T_Self,
4677 Object_Definition =>
4678 New_Occurrence_Of (RTE (RO_ST_Task_Id), Loc),
4680 Make_Function_Call (Loc,
4681 Name => New_Reference_To (RTE (RE_Self), Loc)));
4682 Prepend (Decl, Declarations (T_Body));
4684 Set_Scope (T_Self, Entity (N));
4685 return New_Occurrence_Of (T_Self, Loc);
4690 pragma Assert (Is_Protected_Type (Entity (N)));
4693 New_Reference_To (Find_Protection_Object (Current_Scope), Loc);
4697 if Is_Protected_Type (Ntyp) then
4698 Sel := Name_uObject;
4700 elsif Is_Task_Type (Ntyp) then
4701 Sel := Name_uTask_Id;
4704 raise Program_Error;
4708 Make_Selected_Component (Loc,
4710 Unchecked_Convert_To (Corresponding_Record_Type (Ntyp),
4712 Selector_Name => Make_Identifier (Loc, Sel));
4716 ------------------------
4717 -- Convert_Concurrent --
4718 ------------------------
4720 function Convert_Concurrent
4722 Typ : Entity_Id) return Node_Id
4725 if not Is_Concurrent_Type (Typ) then
4729 Unchecked_Convert_To
4730 (Corresponding_Record_Type (Typ), New_Copy_Tree (N));
4732 end Convert_Concurrent;
4734 -------------------------------------
4735 -- Debug_Private_Data_Declarations --
4736 -------------------------------------
4738 procedure Debug_Private_Data_Declarations (Decls : List_Id) is
4739 Debug_Nod : Node_Id;
4743 Decl := First (Decls);
4744 while Present (Decl)
4745 and then not Comes_From_Source (Decl)
4747 -- Declaration for concurrent entity _object and its access type,
4748 -- along with the entry index subtype:
4749 -- type prot_typVP is access prot_typV;
4750 -- _object : prot_typVP := prot_typV (_O);
4751 -- subtype Jnn is <Type of Index> range Low .. High;
4753 if Nkind_In (Decl, N_Full_Type_Declaration, N_Object_Declaration) then
4754 Set_Debug_Info_Needed (Defining_Identifier (Decl));
4756 -- Declaration for the Protection object, discriminals, privals and
4757 -- entry index constant:
4758 -- conc_typR : protection_typ renames _object._object;
4759 -- discr_nameD : discr_typ renames _object.discr_name;
4760 -- discr_nameD : discr_typ renames _task.discr_name;
4761 -- prival_name : comp_typ renames _object.comp_name;
4762 -- J : constant Jnn :=
4763 -- Jnn'Val (_E - <Index expression> + Jnn'Pos (Jnn'First));
4765 elsif Nkind (Decl) = N_Object_Renaming_Declaration then
4766 Set_Debug_Info_Needed (Defining_Identifier (Decl));
4767 Debug_Nod := Debug_Renaming_Declaration (Decl);
4769 if Present (Debug_Nod) then
4770 Insert_After (Decl, Debug_Nod);
4776 end Debug_Private_Data_Declarations;
4778 ----------------------------
4779 -- Entry_Index_Expression --
4780 ----------------------------
4782 function Entry_Index_Expression
4786 Ttyp : Entity_Id) return Node_Id
4796 -- The queues of entries and entry families appear in textual order in
4797 -- the associated record. The entry index is computed as the sum of the
4798 -- number of queues for all entries that precede the designated one, to
4799 -- which is added the index expression, if this expression denotes a
4800 -- member of a family.
4802 -- The following is a place holder for the count of simple entries
4804 Num := Make_Integer_Literal (Sloc, 1);
4806 -- We construct an expression which is a series of addition operations.
4807 -- The first operand is the number of single entries that precede this
4808 -- one, the second operand is the index value relative to the start of
4809 -- the referenced family, and the remaining operands are the lengths of
4810 -- the entry families that precede this entry, i.e. the constructed
4813 -- number_simple_entries +
4814 -- (s'pos (index-value) - s'pos (family'first)) + 1 +
4815 -- family'length + ...
4817 -- where index-value is the given index value, and s is the index
4818 -- subtype (we have to use pos because the subtype might be an
4819 -- enumeration type preventing direct subtraction). Note that the task
4820 -- entry array is one-indexed.
4822 -- The upper bound of the entry family may be a discriminant, so we
4823 -- retrieve the lower bound explicitly to compute offset, rather than
4824 -- using the index subtype which may mention a discriminant.
4826 if Present (Index) then
4827 S := Etype (Discrete_Subtype_Definition (Declaration_Node (Ent)));
4836 Make_Attribute_Reference (Sloc,
4837 Attribute_Name => Name_Pos,
4838 Prefix => New_Reference_To (Base_Type (S), Sloc),
4839 Expressions => New_List (Relocate_Node (Index))),
4847 -- Now add lengths of preceding entries and entry families
4849 Prev := First_Entity (Ttyp);
4851 while Chars (Prev) /= Chars (Ent)
4852 or else (Ekind (Prev) /= Ekind (Ent))
4853 or else not Sem_Ch6.Type_Conformant (Ent, Prev)
4855 if Ekind (Prev) = E_Entry then
4856 Set_Intval (Num, Intval (Num) + 1);
4858 elsif Ekind (Prev) = E_Entry_Family then
4860 Etype (Discrete_Subtype_Definition (Declaration_Node (Prev)));
4861 Lo := Type_Low_Bound (S);
4862 Hi := Type_High_Bound (S);
4867 Right_Opnd => Family_Size (Sloc, Hi, Lo, Ttyp, False));
4869 -- Other components are anonymous types to be ignored
4879 end Entry_Index_Expression;
4881 ---------------------------
4882 -- Establish_Task_Master --
4883 ---------------------------
4885 procedure Establish_Task_Master (N : Node_Id) is
4888 if Restriction_Active (No_Task_Hierarchy) = False then
4889 Call := Build_Runtime_Call (Sloc (N), RE_Enter_Master);
4890 Prepend_To (Declarations (N), Call);
4893 end Establish_Task_Master;
4895 --------------------------------
4896 -- Expand_Accept_Declarations --
4897 --------------------------------
4899 -- Part of the expansion of an accept statement involves the creation of
4900 -- a declaration that can be referenced from the statement sequence of
4905 -- This declaration is inserted immediately before the accept statement
4906 -- and it is important that it be inserted before the statements of the
4907 -- statement sequence are analyzed. Thus it would be too late to create
4908 -- this declaration in the Expand_N_Accept_Statement routine, which is
4909 -- why there is a separate procedure to be called directly from Sem_Ch9.
4911 -- Ann is used to hold the address of the record containing the parameters
4912 -- (see Expand_N_Entry_Call for more details on how this record is built).
4913 -- References to the parameters do an unchecked conversion of this address
4914 -- to a pointer to the required record type, and then access the field that
4915 -- holds the value of the required parameter. The entity for the address
4916 -- variable is held as the top stack element (i.e. the last element) of the
4917 -- Accept_Address stack in the corresponding entry entity, and this element
4918 -- must be set in place before the statements are processed.
4920 -- The above description applies to the case of a stand alone accept
4921 -- statement, i.e. one not appearing as part of a select alternative.
4923 -- For the case of an accept that appears as part of a select alternative
4924 -- of a selective accept, we must still create the declaration right away,
4925 -- since Ann is needed immediately, but there is an important difference:
4927 -- The declaration is inserted before the selective accept, not before
4928 -- the accept statement (which is not part of a list anyway, and so would
4929 -- not accommodate inserted declarations)
4931 -- We only need one address variable for the entire selective accept. So
4932 -- the Ann declaration is created only for the first accept alternative,
4933 -- and subsequent accept alternatives reference the same Ann variable.
4935 -- We can distinguish the two cases by seeing whether the accept statement
4936 -- is part of a list. If not, then it must be in an accept alternative.
4938 -- To expand the requeue statement, a label is provided at the end of the
4939 -- accept statement or alternative of which it is a part, so that the
4940 -- statement can be skipped after the requeue is complete. This label is
4941 -- created here rather than during the expansion of the accept statement,
4942 -- because it will be needed by any requeue statements within the accept,
4943 -- which are expanded before the accept.
4945 procedure Expand_Accept_Declarations (N : Node_Id; Ent : Entity_Id) is
4946 Loc : constant Source_Ptr := Sloc (N);
4947 Stats : constant Node_Id := Handled_Statement_Sequence (N);
4948 Ann : Entity_Id := Empty;
4956 if Full_Expander_Active then
4958 -- If we have no handled statement sequence, we may need to build
4959 -- a dummy sequence consisting of a null statement. This can be
4960 -- skipped if the trivial accept optimization is permitted.
4962 if not Trivial_Accept_OK
4964 (No (Stats) or else Null_Statements (Statements (Stats)))
4966 Set_Handled_Statement_Sequence (N,
4967 Make_Handled_Sequence_Of_Statements (Loc,
4968 Statements => New_List (Make_Null_Statement (Loc))));
4971 -- Create and declare two labels to be placed at the end of the
4972 -- accept statement. The first label is used to allow requeues to
4973 -- skip the remainder of entry processing. The second label is used
4974 -- to skip the remainder of entry processing if the rendezvous
4975 -- completes in the middle of the accept body.
4977 if Present (Handled_Statement_Sequence (N)) then
4982 Ent := Make_Temporary (Loc, 'L');
4983 Lab_Id := New_Reference_To (Ent, Loc);
4984 Lab := Make_Label (Loc, Lab_Id);
4986 Make_Implicit_Label_Declaration (Loc,
4987 Defining_Identifier => Ent,
4988 Label_Construct => Lab);
4989 Append (Lab, Statements (Handled_Statement_Sequence (N)));
4991 Ent := Make_Temporary (Loc, 'L');
4992 Lab_Id := New_Reference_To (Ent, Loc);
4993 Lab := Make_Label (Loc, Lab_Id);
4995 Make_Implicit_Label_Declaration (Loc,
4996 Defining_Identifier => Ent,
4997 Label_Construct => Lab);
4998 Append (Lab, Statements (Handled_Statement_Sequence (N)));
5006 -- Case of stand alone accept statement
5008 if Is_List_Member (N) then
5010 if Present (Handled_Statement_Sequence (N)) then
5011 Ann := Make_Temporary (Loc, 'A');
5014 Make_Object_Declaration (Loc,
5015 Defining_Identifier => Ann,
5016 Object_Definition =>
5017 New_Reference_To (RTE (RE_Address), Loc));
5019 Insert_Before (N, Adecl);
5022 Insert_Before (N, Ldecl);
5025 Insert_Before (N, Ldecl2);
5029 -- Case of accept statement which is in an accept alternative
5033 Acc_Alt : constant Node_Id := Parent (N);
5034 Sel_Acc : constant Node_Id := Parent (Acc_Alt);
5038 pragma Assert (Nkind (Acc_Alt) = N_Accept_Alternative);
5039 pragma Assert (Nkind (Sel_Acc) = N_Selective_Accept);
5041 -- ??? Consider a single label for select statements
5043 if Present (Handled_Statement_Sequence (N)) then
5045 Statements (Handled_Statement_Sequence (N)));
5049 Statements (Handled_Statement_Sequence (N)));
5053 -- Find first accept alternative of the selective accept. A
5054 -- valid selective accept must have at least one accept in it.
5056 Alt := First (Select_Alternatives (Sel_Acc));
5058 while Nkind (Alt) /= N_Accept_Alternative loop
5062 -- If we are the first accept statement, then we have to create
5063 -- the Ann variable, as for the stand alone case, except that
5064 -- it is inserted before the selective accept. Similarly, a
5065 -- label for requeue expansion must be declared.
5067 if N = Accept_Statement (Alt) then
5068 Ann := Make_Temporary (Loc, 'A');
5070 Make_Object_Declaration (Loc,
5071 Defining_Identifier => Ann,
5072 Object_Definition =>
5073 New_Reference_To (RTE (RE_Address), Loc));
5075 Insert_Before (Sel_Acc, Adecl);
5078 -- If we are not the first accept statement, then find the Ann
5079 -- variable allocated by the first accept and use it.
5083 Node (Last_Elmt (Accept_Address
5084 (Entity (Entry_Direct_Name (Accept_Statement (Alt))))));
5089 -- Merge here with Ann either created or referenced, and Adecl
5090 -- pointing to the corresponding declaration. Remaining processing
5091 -- is the same for the two cases.
5093 if Present (Ann) then
5094 Append_Elmt (Ann, Accept_Address (Ent));
5095 Set_Debug_Info_Needed (Ann);
5098 -- Create renaming declarations for the entry formals. Each reference
5099 -- to a formal becomes a dereference of a component of the parameter
5100 -- block, whose address is held in Ann. These declarations are
5101 -- eventually inserted into the accept block, and analyzed there so
5102 -- that they have the proper scope for gdb and do not conflict with
5103 -- other declarations.
5105 if Present (Parameter_Specifications (N))
5106 and then Present (Handled_Statement_Sequence (N))
5113 Renamed_Formal : Node_Id;
5117 Formal := First_Formal (Ent);
5119 while Present (Formal) loop
5120 Comp := Entry_Component (Formal);
5122 Make_Defining_Identifier (Loc, Chars (Formal));
5124 Set_Etype (New_F, Etype (Formal));
5125 Set_Scope (New_F, Ent);
5127 -- Now we set debug info needed on New_F even though it does
5128 -- not come from source, so that the debugger will get the
5129 -- right information for these generated names.
5131 Set_Debug_Info_Needed (New_F);
5133 if Ekind (Formal) = E_In_Parameter then
5134 Set_Ekind (New_F, E_Constant);
5136 Set_Ekind (New_F, E_Variable);
5137 Set_Extra_Constrained (New_F, Extra_Constrained (Formal));
5140 Set_Actual_Subtype (New_F, Actual_Subtype (Formal));
5143 Make_Selected_Component (Loc,
5145 Unchecked_Convert_To (
5146 Entry_Parameters_Type (Ent),
5147 New_Reference_To (Ann, Loc)),
5149 New_Reference_To (Comp, Loc));
5152 Build_Renamed_Formal_Declaration
5153 (New_F, Formal, Comp, Renamed_Formal);
5155 if No (Declarations (N)) then
5156 Set_Declarations (N, New_List);
5159 Append (Decl, Declarations (N));
5160 Set_Renamed_Object (Formal, New_F);
5161 Next_Formal (Formal);
5168 end Expand_Accept_Declarations;
5170 ---------------------------------------------
5171 -- Expand_Access_Protected_Subprogram_Type --
5172 ---------------------------------------------
5174 procedure Expand_Access_Protected_Subprogram_Type (N : Node_Id) is
5175 Loc : constant Source_Ptr := Sloc (N);
5177 T : constant Entity_Id := Defining_Identifier (N);
5178 D_T : constant Entity_Id := Designated_Type (T);
5179 D_T2 : constant Entity_Id := Make_Temporary (Loc, 'D');
5180 E_T : constant Entity_Id := Make_Temporary (Loc, 'E');
5181 P_List : constant List_Id := Build_Protected_Spec
5182 (N, RTE (RE_Address), D_T, False);
5188 -- Create access to subprogram with full signature
5190 if Etype (D_T) /= Standard_Void_Type then
5192 Make_Access_Function_Definition (Loc,
5193 Parameter_Specifications => P_List,
5194 Result_Definition =>
5195 Copy_Result_Type (Result_Definition (Type_Definition (N))));
5199 Make_Access_Procedure_Definition (Loc,
5200 Parameter_Specifications => P_List);
5204 Make_Full_Type_Declaration (Loc,
5205 Defining_Identifier => D_T2,
5206 Type_Definition => Def1);
5208 Insert_After (N, Decl1);
5211 -- Associate the access to subprogram with its original access to
5212 -- protected subprogram type. Needed by the backend to know that this
5213 -- type corresponds with an access to protected subprogram type.
5215 Set_Original_Access_Type (D_T2, T);
5217 -- Create Equivalent_Type, a record with two components for an access to
5218 -- object and an access to subprogram.
5221 Make_Component_Declaration (Loc,
5222 Defining_Identifier => Make_Temporary (Loc, 'P'),
5223 Component_Definition =>
5224 Make_Component_Definition (Loc,
5225 Aliased_Present => False,
5226 Subtype_Indication =>
5227 New_Occurrence_Of (RTE (RE_Address), Loc))),
5229 Make_Component_Declaration (Loc,
5230 Defining_Identifier => Make_Temporary (Loc, 'S'),
5231 Component_Definition =>
5232 Make_Component_Definition (Loc,
5233 Aliased_Present => False,
5234 Subtype_Indication => New_Occurrence_Of (D_T2, Loc))));
5237 Make_Full_Type_Declaration (Loc,
5238 Defining_Identifier => E_T,
5240 Make_Record_Definition (Loc,
5242 Make_Component_List (Loc,
5243 Component_Items => Comps)));
5245 Insert_After (Decl1, Decl2);
5247 Set_Equivalent_Type (T, E_T);
5248 end Expand_Access_Protected_Subprogram_Type;
5250 --------------------------
5251 -- Expand_Entry_Barrier --
5252 --------------------------
5254 procedure Expand_Entry_Barrier (N : Node_Id; Ent : Entity_Id) is
5255 Cond : constant Node_Id :=
5256 Condition (Entry_Body_Formal_Part (N));
5257 Prot : constant Entity_Id := Scope (Ent);
5258 Spec_Decl : constant Node_Id := Parent (Prot);
5261 Body_Decl : Node_Id;
5264 if No_Run_Time_Mode then
5265 Error_Msg_CRT ("entry barrier", N);
5269 -- The body of the entry barrier must be analyzed in the context of the
5270 -- protected object, but its scope is external to it, just as any other
5271 -- unprotected version of a protected operation. The specification has
5272 -- been produced when the protected type declaration was elaborated. We
5273 -- build the body, insert it in the enclosing scope, but analyze it in
5274 -- the current context. A more uniform approach would be to treat the
5275 -- barrier just as a protected function, and discard the protected
5276 -- version of it because it is never called.
5278 if Full_Expander_Active then
5279 B_F := Build_Barrier_Function (N, Ent, Prot);
5280 Func := Barrier_Function (Ent);
5281 Set_Corresponding_Spec (B_F, Func);
5283 Body_Decl := Parent (Corresponding_Body (Spec_Decl));
5285 if Nkind (Parent (Body_Decl)) = N_Subunit then
5286 Body_Decl := Corresponding_Stub (Parent (Body_Decl));
5289 Insert_Before_And_Analyze (Body_Decl, B_F);
5291 Set_Discriminals (Spec_Decl);
5292 Set_Scope (Func, Scope (Prot));
5295 Analyze_And_Resolve (Cond, Any_Boolean);
5298 -- The Ravenscar profile restricts barriers to simple variables declared
5299 -- within the protected object. We also allow Boolean constants, since
5300 -- these appear in several published examples and are also allowed by
5301 -- the Aonix compiler.
5303 -- Note that after analysis variables in this context will be replaced
5304 -- by the corresponding prival, that is to say a renaming of a selected
5305 -- component of the form _Object.Var. If expansion is disabled, as
5306 -- within a generic, we check that the entity appears in the current
5309 if Is_Entity_Name (Cond) then
5311 -- A small optimization of useless renamings. If the scope of the
5312 -- entity of the condition is not the barrier function, then the
5313 -- condition does not reference any of the generated renamings
5314 -- within the function.
5316 if Full_Expander_Active
5317 and then Scope (Entity (Cond)) /= Func
5319 Set_Declarations (B_F, Empty_List);
5322 if Entity (Cond) = Standard_False
5324 Entity (Cond) = Standard_True
5328 elsif not Expander_Active
5329 and then Scope (Entity (Cond)) = Current_Scope
5333 -- Check for case of _object.all.field (note that the explicit
5334 -- dereference gets inserted by analyze/expand of _object.field)
5336 elsif Present (Renamed_Object (Entity (Cond)))
5338 Nkind (Renamed_Object (Entity (Cond))) = N_Selected_Component
5342 (Prefix (Renamed_Object (Entity (Cond))))) = Name_uObject
5348 -- It is not a boolean variable or literal, so check the restriction
5350 Check_Restriction (Simple_Barriers, Cond);
5351 end Expand_Entry_Barrier;
5353 ------------------------------
5354 -- Expand_N_Abort_Statement --
5355 ------------------------------
5357 -- Expand abort T1, T2, .. Tn; into:
5358 -- Abort_Tasks (Task_List'(1 => T1.Task_Id, 2 => T2.Task_Id ...))
5360 procedure Expand_N_Abort_Statement (N : Node_Id) is
5361 Loc : constant Source_Ptr := Sloc (N);
5362 Tlist : constant List_Id := Names (N);
5368 Aggr := Make_Aggregate (Loc, Component_Associations => New_List);
5371 Tasknm := First (Tlist);
5373 while Present (Tasknm) loop
5376 -- A task interface class-wide type object is being aborted.
5377 -- Retrieve its _task_id by calling a dispatching routine.
5379 if Ada_Version >= Ada_2005
5380 and then Ekind (Etype (Tasknm)) = E_Class_Wide_Type
5381 and then Is_Interface (Etype (Tasknm))
5382 and then Is_Task_Interface (Etype (Tasknm))
5384 Append_To (Component_Associations (Aggr),
5385 Make_Component_Association (Loc,
5386 Choices => New_List (
5387 Make_Integer_Literal (Loc, Count)),
5390 -- Task_Id (Tasknm._disp_get_task_id)
5392 Make_Unchecked_Type_Conversion (Loc,
5394 New_Reference_To (RTE (RO_ST_Task_Id), Loc),
5396 Make_Selected_Component (Loc,
5397 Prefix => New_Copy_Tree (Tasknm),
5399 Make_Identifier (Loc, Name_uDisp_Get_Task_Id)))));
5402 Append_To (Component_Associations (Aggr),
5403 Make_Component_Association (Loc,
5404 Choices => New_List (
5405 Make_Integer_Literal (Loc, Count)),
5406 Expression => Concurrent_Ref (Tasknm)));
5413 Make_Procedure_Call_Statement (Loc,
5414 Name => New_Reference_To (RTE (RE_Abort_Tasks), Loc),
5415 Parameter_Associations => New_List (
5416 Make_Qualified_Expression (Loc,
5417 Subtype_Mark => New_Reference_To (RTE (RE_Task_List), Loc),
5418 Expression => Aggr))));
5421 end Expand_N_Abort_Statement;
5423 -------------------------------
5424 -- Expand_N_Accept_Statement --
5425 -------------------------------
5427 -- This procedure handles expansion of accept statements that stand
5428 -- alone, i.e. they are not part of an accept alternative. The expansion
5429 -- of accept statement in accept alternatives is handled by the routines
5430 -- Expand_N_Accept_Alternative and Expand_N_Selective_Accept. The
5431 -- following description applies only to stand alone accept statements.
5433 -- If there is no handled statement sequence, or only null statements,
5434 -- then this is called a trivial accept, and the expansion is:
5436 -- Accept_Trivial (entry-index)
5438 -- If there is a handled statement sequence, then the expansion is:
5445 -- Accept_Call (entry-index, Ann);
5446 -- Renaming_Declarations for formals
5447 -- <statement sequence from N_Accept_Statement node>
5448 -- Complete_Rendezvous;
5453 -- <exception handler from N_Accept_Statement node>
5454 -- Complete_Rendezvous;
5456 -- <exception handler from N_Accept_Statement node>
5457 -- Complete_Rendezvous;
5462 -- when all others =>
5463 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
5466 -- The first three declarations were already inserted ahead of the accept
5467 -- statement by the Expand_Accept_Declarations procedure, which was called
5468 -- directly from the semantics during analysis of the accept statement,
5469 -- before analyzing its contained statements.
5471 -- The declarations from the N_Accept_Statement, as noted in Sinfo, come
5472 -- from possible expansion activity (the original source of course does
5473 -- not have any declarations associated with the accept statement, since
5474 -- an accept statement has no declarative part). In particular, if the
5475 -- expander is active, the first such declaration is the declaration of
5476 -- the Accept_Params_Ptr entity (see Sem_Ch9.Analyze_Accept_Statement).
5478 -- The two blocks are merged into a single block if the inner block has
5479 -- no exception handlers, but otherwise two blocks are required, since
5480 -- exceptions might be raised in the exception handlers of the inner
5481 -- block, and Exceptional_Complete_Rendezvous must be called.
5483 procedure Expand_N_Accept_Statement (N : Node_Id) is
5484 Loc : constant Source_Ptr := Sloc (N);
5485 Stats : constant Node_Id := Handled_Statement_Sequence (N);
5486 Ename : constant Node_Id := Entry_Direct_Name (N);
5487 Eindx : constant Node_Id := Entry_Index (N);
5488 Eent : constant Entity_Id := Entity (Ename);
5489 Acstack : constant Elist_Id := Accept_Address (Eent);
5490 Ann : constant Entity_Id := Node (Last_Elmt (Acstack));
5491 Ttyp : constant Entity_Id := Etype (Scope (Eent));
5496 -- Start of processing for Expand_N_Accept_Statement
5499 -- If accept statement is not part of a list, then its parent must be
5500 -- an accept alternative, and, as described above, we do not do any
5501 -- expansion for such accept statements at this level.
5503 if not Is_List_Member (N) then
5504 pragma Assert (Nkind (Parent (N)) = N_Accept_Alternative);
5507 -- Trivial accept case (no statement sequence, or null statements).
5508 -- If the accept statement has declarations, then just insert them
5509 -- before the procedure call.
5511 elsif Trivial_Accept_OK
5512 and then (No (Stats) or else Null_Statements (Statements (Stats)))
5514 -- Remove declarations for renamings, because the parameter block
5515 -- will not be assigned.
5522 D := First (Declarations (N));
5524 while Present (D) loop
5526 if Nkind (D) = N_Object_Renaming_Declaration then
5534 if Present (Declarations (N)) then
5535 Insert_Actions (N, Declarations (N));
5539 Make_Procedure_Call_Statement (Loc,
5540 Name => New_Reference_To (RTE (RE_Accept_Trivial), Loc),
5541 Parameter_Associations => New_List (
5542 Entry_Index_Expression (Loc, Entity (Ename), Eindx, Ttyp))));
5546 -- Discard Entry_Address that was created for it, so it will not be
5547 -- emitted if this accept statement is in the statement part of a
5548 -- delay alternative.
5550 if Present (Stats) then
5551 Remove_Last_Elmt (Acstack);
5554 -- Case of statement sequence present
5557 -- Construct the block, using the declarations from the accept
5558 -- statement if any to initialize the declarations of the block.
5560 Blkent := Make_Temporary (Loc, 'A');
5561 Set_Ekind (Blkent, E_Block);
5562 Set_Etype (Blkent, Standard_Void_Type);
5563 Set_Scope (Blkent, Current_Scope);
5566 Make_Block_Statement (Loc,
5567 Identifier => New_Reference_To (Blkent, Loc),
5568 Declarations => Declarations (N),
5569 Handled_Statement_Sequence => Build_Accept_Body (N));
5571 -- For the analysis of the generated declarations, the parent node
5572 -- must be properly set.
5574 Set_Parent (Block, Parent (N));
5576 -- Prepend call to Accept_Call to main statement sequence If the
5577 -- accept has exception handlers, the statement sequence is wrapped
5578 -- in a block. Insert call and renaming declarations in the
5579 -- declarations of the block, so they are elaborated before the
5583 Make_Procedure_Call_Statement (Loc,
5584 Name => New_Reference_To (RTE (RE_Accept_Call), Loc),
5585 Parameter_Associations => New_List (
5586 Entry_Index_Expression (Loc, Entity (Ename), Eindx, Ttyp),
5587 New_Reference_To (Ann, Loc)));
5589 if Parent (Stats) = N then
5590 Prepend (Call, Statements (Stats));
5599 Push_Scope (Blkent);
5607 D := First (Declarations (N));
5608 while Present (D) loop
5611 if Nkind (D) = N_Object_Renaming_Declaration then
5613 -- The renaming declarations for the formals were created
5614 -- during analysis of the accept statement, and attached to
5615 -- the list of declarations. Place them now in the context
5616 -- of the accept block or subprogram.
5619 Typ := Entity (Subtype_Mark (D));
5620 Insert_After (Call, D);
5623 -- If the formal is class_wide, it does not have an actual
5624 -- subtype. The analysis of the renaming declaration creates
5625 -- one, but we need to retain the class-wide nature of the
5628 if Is_Class_Wide_Type (Typ) then
5629 Set_Etype (Defining_Identifier (D), Typ);
5640 -- Replace the accept statement by the new block
5645 -- Last step is to unstack the Accept_Address value
5647 Remove_Last_Elmt (Acstack);
5649 end Expand_N_Accept_Statement;
5651 ----------------------------------
5652 -- Expand_N_Asynchronous_Select --
5653 ----------------------------------
5655 -- This procedure assumes that the trigger statement is an entry call or
5656 -- a dispatching procedure call. A delay alternative should already have
5657 -- been expanded into an entry call to the appropriate delay object Wait
5660 -- If the trigger is a task entry call, the select is implemented with
5661 -- a Task_Entry_Call:
5666 -- P : parms := (parm, parm, parm);
5668 -- -- Clean is added by Exp_Ch7.Expand_Cleanup_Actions
5670 -- procedure _clean is
5673 -- Cancel_Task_Entry_Call (C);
5680 -- (<acceptor-task>, -- Acceptor
5681 -- <entry-index>, -- E
5682 -- P'Address, -- Uninterpreted_Data
5683 -- Asynchronous_Call, -- Mode
5684 -- B); -- Rendezvous_Successful
5691 -- _clean; -- Added by Exp_Ch7.Expand_Cleanup_Actions
5694 -- when Abort_Signal => Abort_Undefer;
5701 -- <triggered-statements>
5705 -- Note that Build_Simple_Entry_Call is used to expand the entry of the
5706 -- asynchronous entry call (by Expand_N_Entry_Call_Statement procedure)
5710 -- P : parms := (parm, parm, parm);
5712 -- Call_Simple (acceptor-task, entry-index, P'Address);
5718 -- so the task at hand is to convert the latter expansion into the former
5720 -- If the trigger is a protected entry call, the select is implemented
5721 -- with Protected_Entry_Call:
5724 -- P : E1_Params := (param, param, param);
5725 -- Bnn : Communications_Block;
5730 -- -- Clean is added by Exp_Ch7.Expand_Cleanup_Actions
5732 -- procedure _clean is
5735 -- if Enqueued (Bnn) then
5736 -- Cancel_Protected_Entry_Call (Bnn);
5743 -- Protected_Entry_Call
5744 -- (po._object'Access, -- Object
5745 -- <entry index>, -- E
5746 -- P'Address, -- Uninterpreted_Data
5747 -- Asynchronous_Call, -- Mode
5750 -- if Enqueued (Bnn) then
5754 -- _clean; -- Added by Exp_Ch7.Expand_Cleanup_Actions
5757 -- when Abort_Signal => Abort_Undefer;
5760 -- if not Cancelled (Bnn) then
5761 -- <triggered-statements>
5765 -- Build_Simple_Entry_Call is used to expand the all to a simple protected
5769 -- P : E1_Params := (param, param, param);
5770 -- Bnn : Communications_Block;
5773 -- Protected_Entry_Call
5774 -- (po._object'Access, -- Object
5775 -- <entry index>, -- E
5776 -- P'Address, -- Uninterpreted_Data
5777 -- Simple_Call, -- Mode
5784 -- Ada 2005 (AI-345): If the trigger is a dispatching call, the select is
5788 -- B : Boolean := False;
5789 -- Bnn : Communication_Block;
5790 -- C : Ada.Tags.Prim_Op_Kind;
5791 -- D : System.Storage_Elements.Dummy_Communication_Block;
5792 -- K : Ada.Tags.Tagged_Kind :=
5793 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
5794 -- P : Parameters := (Param1 .. ParamN);
5799 -- if K = Ada.Tags.TK_Limited_Tagged then
5800 -- <dispatching-call>;
5801 -- <triggering-statements>;
5805 -- Ada.Tags.Get_Offset_Index
5806 -- (Ada.Tags.Tag (<object>), DT_Position (<dispatching-call>));
5808 -- _Disp_Get_Prim_Op_Kind (<object>, S, C);
5810 -- if C = POK_Protected_Entry then
5812 -- procedure _clean is
5814 -- if Enqueued (Bnn) then
5815 -- Cancel_Protected_Entry_Call (Bnn);
5821 -- _Disp_Asynchronous_Select
5822 -- (<object>, S, P'Address, D, B);
5823 -- Bnn := Communication_Block (D);
5825 -- Param1 := P.Param1;
5827 -- ParamN := P.ParamN;
5829 -- if Enqueued (Bnn) then
5830 -- <abortable-statements>
5833 -- _clean; -- Added by Exp_Ch7.Expand_Cleanup_Actions
5836 -- when Abort_Signal => Abort_Undefer;
5839 -- if not Cancelled (Bnn) then
5840 -- <triggering-statements>
5843 -- elsif C = POK_Task_Entry then
5845 -- procedure _clean is
5847 -- Cancel_Task_Entry_Call (U);
5853 -- _Disp_Asynchronous_Select
5854 -- (<object>, S, P'Address, D, B);
5855 -- Bnn := Communication_Bloc (D);
5857 -- Param1 := P.Param1;
5859 -- ParamN := P.ParamN;
5864 -- <abortable-statements>
5866 -- _clean; -- Added by Exp_Ch7.Expand_Cleanup_Actions
5869 -- when Abort_Signal => Abort_Undefer;
5873 -- <triggering-statements>
5878 -- <dispatching-call>;
5879 -- <triggering-statements>
5884 -- The job is to convert this to the asynchronous form
5886 -- If the trigger is a delay statement, it will have been expanded into a
5887 -- call to one of the GNARL delay procedures. This routine will convert
5888 -- this into a protected entry call on a delay object and then continue
5889 -- processing as for a protected entry call trigger. This requires
5890 -- declaring a Delay_Block object and adding a pointer to this object to
5891 -- the parameter list of the delay procedure to form the parameter list of
5892 -- the entry call. This object is used by the runtime to queue the delay
5895 -- For a description of the use of P and the assignments after the call,
5896 -- see Expand_N_Entry_Call_Statement.
5898 procedure Expand_N_Asynchronous_Select (N : Node_Id) is
5899 Loc : constant Source_Ptr := Sloc (N);
5900 Abrt : constant Node_Id := Abortable_Part (N);
5901 Astats : constant List_Id := Statements (Abrt);
5902 Trig : constant Node_Id := Triggering_Alternative (N);
5903 Tstats : constant List_Id := Statements (Trig);
5905 Abort_Block_Ent : Entity_Id;
5906 Abortable_Block : Node_Id;
5908 Blk_Ent : Entity_Id;
5909 Blk_Typ : Entity_Id;
5911 Call_Ent : Entity_Id;
5912 Cancel_Param : Entity_Id;
5913 Cleanup_Block : Node_Id;
5914 Cleanup_Block_Ent : Entity_Id;
5915 Cleanup_Stmts : List_Id;
5916 Conc_Typ_Stmts : List_Id;
5918 Dblock_Ent : Entity_Id;
5923 Enqueue_Call : Node_Id;
5926 Handler_Stmt : Node_Id;
5928 Lim_Typ_Stmts : List_Id;
5934 ProtE_Stmts : List_Id;
5935 ProtP_Stmts : List_Id;
5938 TaskE_Stmts : List_Id;
5940 B : Entity_Id; -- Call status flag
5941 Bnn : Entity_Id; -- Communication block
5942 C : Entity_Id; -- Call kind
5943 K : Entity_Id; -- Tagged kind
5944 P : Entity_Id; -- Parameter block
5945 S : Entity_Id; -- Primitive operation slot
5946 T : Entity_Id; -- Additional status flag
5949 Process_Statements_For_Controlled_Objects (Trig);
5950 Process_Statements_For_Controlled_Objects (Abrt);
5952 Blk_Ent := Make_Temporary (Loc, 'A');
5953 Ecall := Triggering_Statement (Trig);
5955 -- The arguments in the call may require dynamic allocation, and the
5956 -- call statement may have been transformed into a block. The block
5957 -- may contain additional declarations for internal entities, and the
5958 -- original call is found by sequential search.
5960 if Nkind (Ecall) = N_Block_Statement then
5961 Ecall := First (Statements (Handled_Statement_Sequence (Ecall)));
5962 while not Nkind_In (Ecall, N_Procedure_Call_Statement,
5963 N_Entry_Call_Statement)
5969 -- This is either a dispatching call or a delay statement used as a
5970 -- trigger which was expanded into a procedure call.
5972 if Nkind (Ecall) = N_Procedure_Call_Statement then
5973 if Ada_Version >= Ada_2005
5975 (No (Original_Node (Ecall))
5976 or else not Nkind_In (Original_Node (Ecall),
5977 N_Delay_Relative_Statement,
5978 N_Delay_Until_Statement))
5980 Extract_Dispatching_Call (Ecall, Call_Ent, Obj, Actuals, Formals);
5985 -- Call status flag processing, generate:
5986 -- B : Boolean := False;
5988 B := Build_B (Loc, Decls);
5990 -- Communication block processing, generate:
5991 -- Bnn : Communication_Block;
5993 Bnn := Make_Temporary (Loc, 'B');
5995 Make_Object_Declaration (Loc,
5996 Defining_Identifier => Bnn,
5997 Object_Definition =>
5998 New_Reference_To (RTE (RE_Communication_Block), Loc)));
6000 -- Call kind processing, generate:
6001 -- C : Ada.Tags.Prim_Op_Kind;
6003 C := Build_C (Loc, Decls);
6005 -- Tagged kind processing, generate:
6006 -- K : Ada.Tags.Tagged_Kind :=
6007 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
6009 -- Dummy communication block, generate:
6010 -- D : Dummy_Communication_Block;
6013 Make_Object_Declaration (Loc,
6014 Defining_Identifier =>
6015 Make_Defining_Identifier (Loc, Name_uD),
6016 Object_Definition =>
6018 RTE (RE_Dummy_Communication_Block), Loc)));
6020 K := Build_K (Loc, Decls, Obj);
6022 -- Parameter block processing
6024 Blk_Typ := Build_Parameter_Block
6025 (Loc, Actuals, Formals, Decls);
6026 P := Parameter_Block_Pack
6027 (Loc, Blk_Typ, Actuals, Formals, Decls, Stmts);
6029 -- Dispatch table slot processing, generate:
6032 S := Build_S (Loc, Decls);
6034 -- Additional status flag processing, generate:
6037 T := Make_Temporary (Loc, 'T');
6039 Make_Object_Declaration (Loc,
6040 Defining_Identifier => T,
6041 Object_Definition =>
6042 New_Reference_To (Standard_Boolean, Loc)));
6044 ------------------------------
6045 -- Protected entry handling --
6046 ------------------------------
6049 -- Param1 := P.Param1;
6051 -- ParamN := P.ParamN;
6053 Cleanup_Stmts := Parameter_Block_Unpack (Loc, P, Actuals, Formals);
6056 -- Bnn := Communication_Block (D);
6058 Prepend_To (Cleanup_Stmts,
6059 Make_Assignment_Statement (Loc,
6061 New_Reference_To (Bnn, Loc),
6063 Make_Unchecked_Type_Conversion (Loc,
6065 New_Reference_To (RTE (RE_Communication_Block), Loc),
6066 Expression => Make_Identifier (Loc, Name_uD))));
6069 -- _Disp_Asynchronous_Select (<object>, S, P'Address, D, B);
6071 Prepend_To (Cleanup_Stmts,
6072 Make_Procedure_Call_Statement (Loc,
6075 Find_Prim_Op (Etype (Etype (Obj)),
6076 Name_uDisp_Asynchronous_Select),
6078 Parameter_Associations =>
6080 New_Copy_Tree (Obj), -- <object>
6081 New_Reference_To (S, Loc), -- S
6082 Make_Attribute_Reference (Loc, -- P'Address
6084 New_Reference_To (P, Loc),
6087 Make_Identifier (Loc, Name_uD), -- D
6088 New_Reference_To (B, Loc)))); -- B
6091 -- if Enqueued (Bnn) then
6092 -- <abortable-statements>
6095 Append_To (Cleanup_Stmts,
6096 Make_If_Statement (Loc,
6098 Make_Function_Call (Loc,
6100 New_Reference_To (RTE (RE_Enqueued), Loc),
6101 Parameter_Associations =>
6103 New_Reference_To (Bnn, Loc))),
6106 New_Copy_List_Tree (Astats)));
6108 -- Wrap the statements in a block. Exp_Ch7.Expand_Cleanup_Actions
6109 -- will then generate a _clean for the communication block Bnn.
6113 -- procedure _clean is
6115 -- if Enqueued (Bnn) then
6116 -- Cancel_Protected_Entry_Call (Bnn);
6125 Cleanup_Block_Ent := Make_Temporary (Loc, 'C');
6127 Build_Cleanup_Block (Loc, Cleanup_Block_Ent, Cleanup_Stmts, Bnn);
6129 -- Wrap the cleanup block in an exception handling block
6135 -- when Abort_Signal => Abort_Undefer;
6138 Abort_Block_Ent := Make_Temporary (Loc, 'A');
6141 Make_Implicit_Label_Declaration (Loc,
6142 Defining_Identifier =>
6146 (Loc, Abort_Block_Ent, Cleanup_Block_Ent, Cleanup_Block));
6149 -- if not Cancelled (Bnn) then
6150 -- <triggering-statements>
6153 Append_To (ProtE_Stmts,
6154 Make_If_Statement (Loc,
6158 Make_Function_Call (Loc,
6160 New_Reference_To (RTE (RE_Cancelled), Loc),
6161 Parameter_Associations =>
6163 New_Reference_To (Bnn, Loc)))),
6166 New_Copy_List_Tree (Tstats)));
6168 -------------------------
6169 -- Task entry handling --
6170 -------------------------
6173 -- Param1 := P.Param1;
6175 -- ParamN := P.ParamN;
6177 TaskE_Stmts := Parameter_Block_Unpack (Loc, P, Actuals, Formals);
6180 -- Bnn := Communication_Block (D);
6182 Append_To (TaskE_Stmts,
6183 Make_Assignment_Statement (Loc,
6185 New_Reference_To (Bnn, Loc),
6187 Make_Unchecked_Type_Conversion (Loc,
6189 New_Reference_To (RTE (RE_Communication_Block), Loc),
6190 Expression => Make_Identifier (Loc, Name_uD))));
6193 -- _Disp_Asynchronous_Select (<object>, S, P'Address, D, B);
6195 Prepend_To (TaskE_Stmts,
6196 Make_Procedure_Call_Statement (Loc,
6199 Find_Prim_Op (Etype (Etype (Obj)),
6200 Name_uDisp_Asynchronous_Select),
6202 Parameter_Associations =>
6204 New_Copy_Tree (Obj), -- <object>
6205 New_Reference_To (S, Loc), -- S
6206 Make_Attribute_Reference (Loc, -- P'Address
6208 New_Reference_To (P, Loc),
6211 Make_Identifier (Loc, Name_uD), -- D
6212 New_Reference_To (B, Loc)))); -- B
6217 Prepend_To (TaskE_Stmts,
6218 Make_Procedure_Call_Statement (Loc,
6220 New_Reference_To (RTE (RE_Abort_Defer), Loc),
6221 Parameter_Associations =>
6226 -- <abortable-statements>
6228 Cleanup_Stmts := New_Copy_List_Tree (Astats);
6230 Prepend_To (Cleanup_Stmts,
6231 Make_Procedure_Call_Statement (Loc,
6233 New_Reference_To (RTE (RE_Abort_Undefer), Loc),
6234 Parameter_Associations =>
6237 -- Wrap the statements in a block. Exp_Ch7.Expand_Cleanup_Actions
6238 -- will generate a _clean for the additional status flag.
6242 -- procedure _clean is
6244 -- Cancel_Task_Entry_Call (U);
6252 Cleanup_Block_Ent := Make_Temporary (Loc, 'C');
6254 Build_Cleanup_Block (Loc, Cleanup_Block_Ent, Cleanup_Stmts, T);
6256 -- Wrap the cleanup block in an exception handling block
6262 -- when Abort_Signal => Abort_Undefer;
6265 Abort_Block_Ent := Make_Temporary (Loc, 'A');
6267 Append_To (TaskE_Stmts,
6268 Make_Implicit_Label_Declaration (Loc,
6269 Defining_Identifier => Abort_Block_Ent));
6271 Append_To (TaskE_Stmts,
6273 (Loc, Abort_Block_Ent, Cleanup_Block_Ent, Cleanup_Block));
6277 -- <triggering-statements>
6280 Append_To (TaskE_Stmts,
6281 Make_If_Statement (Loc,
6285 New_Reference_To (T, Loc)),
6288 New_Copy_List_Tree (Tstats)));
6290 ----------------------------------
6291 -- Protected procedure handling --
6292 ----------------------------------
6295 -- <dispatching-call>;
6296 -- <triggering-statements>
6298 ProtP_Stmts := New_Copy_List_Tree (Tstats);
6299 Prepend_To (ProtP_Stmts, New_Copy_Tree (Ecall));
6302 -- S := Ada.Tags.Get_Offset_Index
6303 -- (Ada.Tags.Tag (<object>), DT_Position (Call_Ent));
6306 New_List (Build_S_Assignment (Loc, S, Obj, Call_Ent));
6309 -- _Disp_Get_Prim_Op_Kind (<object>, S, C);
6311 Append_To (Conc_Typ_Stmts,
6312 Make_Procedure_Call_Statement (Loc,
6315 Find_Prim_Op (Etype (Etype (Obj)),
6316 Name_uDisp_Get_Prim_Op_Kind),
6318 Parameter_Associations =>
6320 New_Copy_Tree (Obj),
6321 New_Reference_To (S, Loc),
6322 New_Reference_To (C, Loc))));
6325 -- if C = POK_Procedure_Entry then
6327 -- elsif C = POK_Task_Entry then
6333 Append_To (Conc_Typ_Stmts,
6334 Make_If_Statement (Loc,
6338 New_Reference_To (C, Loc),
6340 New_Reference_To (RTE (RE_POK_Protected_Entry), Loc)),
6347 Make_Elsif_Part (Loc,
6351 New_Reference_To (C, Loc),
6353 New_Reference_To (RTE (RE_POK_Task_Entry), Loc)),
6362 -- <dispatching-call>;
6363 -- <triggering-statements>
6365 Lim_Typ_Stmts := New_Copy_List_Tree (Tstats);
6366 Prepend_To (Lim_Typ_Stmts, New_Copy_Tree (Ecall));
6369 -- if K = Ada.Tags.TK_Limited_Tagged then
6376 Make_If_Statement (Loc,
6380 New_Reference_To (K, Loc),
6382 New_Reference_To (RTE (RE_TK_Limited_Tagged), Loc)),
6391 Make_Block_Statement (Loc,
6394 Handled_Statement_Sequence =>
6395 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
6400 -- Delay triggering statement processing
6403 -- Add a Delay_Block object to the parameter list of the delay
6404 -- procedure to form the parameter list of the Wait entry call.
6406 Dblock_Ent := Make_Temporary (Loc, 'D');
6408 Pdef := Entity (Name (Ecall));
6410 if Is_RTE (Pdef, RO_CA_Delay_For) then
6412 New_Reference_To (RTE (RE_Enqueue_Duration), Loc);
6414 elsif Is_RTE (Pdef, RO_CA_Delay_Until) then
6416 New_Reference_To (RTE (RE_Enqueue_Calendar), Loc);
6418 else pragma Assert (Is_RTE (Pdef, RO_RT_Delay_Until));
6419 Enqueue_Call := New_Reference_To (RTE (RE_Enqueue_RT), Loc);
6422 Append_To (Parameter_Associations (Ecall),
6423 Make_Attribute_Reference (Loc,
6424 Prefix => New_Reference_To (Dblock_Ent, Loc),
6425 Attribute_Name => Name_Unchecked_Access));
6427 -- Create the inner block to protect the abortable part
6429 Hdle := New_List (Build_Abort_Block_Handler (Loc));
6432 Make_Procedure_Call_Statement (Loc,
6433 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc)));
6436 Make_Block_Statement (Loc,
6437 Identifier => New_Reference_To (Blk_Ent, Loc),
6438 Handled_Statement_Sequence =>
6439 Make_Handled_Sequence_Of_Statements (Loc,
6440 Statements => Astats),
6441 Has_Created_Identifier => True,
6442 Is_Asynchronous_Call_Block => True);
6444 -- Append call to if Enqueue (When, DB'Unchecked_Access) then
6447 Make_Implicit_If_Statement (N,
6448 Condition => Make_Function_Call (Loc,
6449 Name => Enqueue_Call,
6450 Parameter_Associations => Parameter_Associations (Ecall)),
6452 New_List (Make_Block_Statement (Loc,
6453 Handled_Statement_Sequence =>
6454 Make_Handled_Sequence_Of_Statements (Loc,
6455 Statements => New_List (
6456 Make_Implicit_Label_Declaration (Loc,
6457 Defining_Identifier => Blk_Ent,
6458 Label_Construct => Abortable_Block),
6460 Exception_Handlers => Hdle)))));
6462 Stmts := New_List (Ecall);
6464 -- Construct statement sequence for new block
6467 Make_Implicit_If_Statement (N,
6468 Condition => Make_Function_Call (Loc,
6469 Name => New_Reference_To (
6470 RTE (RE_Timed_Out), Loc),
6471 Parameter_Associations => New_List (
6472 Make_Attribute_Reference (Loc,
6473 Prefix => New_Reference_To (Dblock_Ent, Loc),
6474 Attribute_Name => Name_Unchecked_Access))),
6475 Then_Statements => Tstats));
6477 -- The result is the new block
6479 Set_Entry_Cancel_Parameter (Blk_Ent, Dblock_Ent);
6482 Make_Block_Statement (Loc,
6483 Declarations => New_List (
6484 Make_Object_Declaration (Loc,
6485 Defining_Identifier => Dblock_Ent,
6486 Aliased_Present => True,
6487 Object_Definition => New_Reference_To (
6488 RTE (RE_Delay_Block), Loc))),
6490 Handled_Statement_Sequence =>
6491 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
6501 Extract_Entry (Ecall, Concval, Ename, Index);
6502 Build_Simple_Entry_Call (Ecall, Concval, Ename, Index);
6504 Stmts := Statements (Handled_Statement_Sequence (Ecall));
6505 Decls := Declarations (Ecall);
6507 if Is_Protected_Type (Etype (Concval)) then
6509 -- Get the declarations of the block expanded from the entry call
6511 Decl := First (Decls);
6512 while Present (Decl)
6514 (Nkind (Decl) /= N_Object_Declaration
6515 or else not Is_RTE (Etype (Object_Definition (Decl)),
6516 RE_Communication_Block))
6521 pragma Assert (Present (Decl));
6522 Cancel_Param := Defining_Identifier (Decl);
6524 -- Change the mode of the Protected_Entry_Call call
6526 -- Protected_Entry_Call (
6527 -- Object => po._object'Access,
6528 -- E => <entry index>;
6529 -- Uninterpreted_Data => P'Address;
6530 -- Mode => Asynchronous_Call;
6533 Stmt := First (Stmts);
6535 -- Skip assignments to temporaries created for in-out parameters
6537 -- This makes unwarranted assumptions about the shape of the expanded
6538 -- tree for the call, and should be cleaned up ???
6540 while Nkind (Stmt) /= N_Procedure_Call_Statement loop
6546 Param := First (Parameter_Associations (Call));
6547 while Present (Param)
6548 and then not Is_RTE (Etype (Param), RE_Call_Modes)
6553 pragma Assert (Present (Param));
6554 Rewrite (Param, New_Reference_To (RTE (RE_Asynchronous_Call), Loc));
6557 -- Append an if statement to execute the abortable part
6560 -- if Enqueued (Bnn) then
6563 Make_Implicit_If_Statement (N,
6564 Condition => Make_Function_Call (Loc,
6565 Name => New_Reference_To (RTE (RE_Enqueued), Loc),
6566 Parameter_Associations => New_List (
6567 New_Reference_To (Cancel_Param, Loc))),
6568 Then_Statements => Astats));
6571 Make_Block_Statement (Loc,
6572 Identifier => New_Reference_To (Blk_Ent, Loc),
6573 Handled_Statement_Sequence =>
6574 Make_Handled_Sequence_Of_Statements (Loc,
6575 Statements => Stmts),
6576 Has_Created_Identifier => True,
6577 Is_Asynchronous_Call_Block => True);
6579 -- For the VM call Update_Exception instead of Abort_Undefer.
6580 -- See 4jexcept.ads for an explanation.
6582 if VM_Target = No_VM then
6583 if Exception_Mechanism = Back_End_Exceptions then
6585 -- Aborts are not deferred at beginning of exception handlers
6588 Handler_Stmt := Make_Null_Statement (Loc);
6591 Handler_Stmt := Make_Procedure_Call_Statement (Loc,
6592 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc),
6593 Parameter_Associations => No_List);
6596 Handler_Stmt := Make_Procedure_Call_Statement (Loc,
6597 Name => New_Reference_To (RTE (RE_Update_Exception), Loc),
6598 Parameter_Associations => New_List (
6599 Make_Function_Call (Loc,
6600 Name => New_Occurrence_Of
6601 (RTE (RE_Current_Target_Exception), Loc))));
6605 Make_Block_Statement (Loc,
6606 Handled_Statement_Sequence =>
6607 Make_Handled_Sequence_Of_Statements (Loc,
6608 Statements => New_List (
6609 Make_Implicit_Label_Declaration (Loc,
6610 Defining_Identifier => Blk_Ent,
6611 Label_Construct => Abortable_Block),
6616 Exception_Handlers => New_List (
6617 Make_Implicit_Exception_Handler (Loc,
6619 -- when Abort_Signal =>
6620 -- Abort_Undefer.all;
6622 Exception_Choices =>
6623 New_List (New_Reference_To (Stand.Abort_Signal, Loc)),
6624 Statements => New_List (Handler_Stmt))))),
6626 -- if not Cancelled (Bnn) then
6627 -- triggered statements
6630 Make_Implicit_If_Statement (N,
6631 Condition => Make_Op_Not (Loc,
6633 Make_Function_Call (Loc,
6634 Name => New_Occurrence_Of (RTE (RE_Cancelled), Loc),
6635 Parameter_Associations => New_List (
6636 New_Occurrence_Of (Cancel_Param, Loc)))),
6637 Then_Statements => Tstats));
6639 -- Asynchronous task entry call
6646 B := Make_Defining_Identifier (Loc, Name_uB);
6648 -- Insert declaration of B in declarations of existing block
6651 Make_Object_Declaration (Loc,
6652 Defining_Identifier => B,
6653 Object_Definition => New_Reference_To (Standard_Boolean, Loc)));
6655 Cancel_Param := Make_Defining_Identifier (Loc, Name_uC);
6657 -- Insert declaration of C in declarations of existing block
6660 Make_Object_Declaration (Loc,
6661 Defining_Identifier => Cancel_Param,
6662 Object_Definition => New_Reference_To (Standard_Boolean, Loc)));
6664 -- Remove and save the call to Call_Simple
6666 Stmt := First (Stmts);
6668 -- Skip assignments to temporaries created for in-out parameters.
6669 -- This makes unwarranted assumptions about the shape of the expanded
6670 -- tree for the call, and should be cleaned up ???
6672 while Nkind (Stmt) /= N_Procedure_Call_Statement loop
6678 -- Create the inner block to protect the abortable part
6680 Hdle := New_List (Build_Abort_Block_Handler (Loc));
6683 Make_Procedure_Call_Statement (Loc,
6684 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc)));
6687 Make_Block_Statement (Loc,
6688 Identifier => New_Reference_To (Blk_Ent, Loc),
6689 Handled_Statement_Sequence =>
6690 Make_Handled_Sequence_Of_Statements (Loc,
6691 Statements => Astats),
6692 Has_Created_Identifier => True,
6693 Is_Asynchronous_Call_Block => True);
6696 Make_Block_Statement (Loc,
6697 Handled_Statement_Sequence =>
6698 Make_Handled_Sequence_Of_Statements (Loc,
6699 Statements => New_List (
6700 Make_Implicit_Label_Declaration (Loc,
6701 Defining_Identifier =>
6706 Exception_Handlers => Hdle)));
6708 -- Create new call statement
6710 Params := Parameter_Associations (Call);
6713 New_Reference_To (RTE (RE_Asynchronous_Call), Loc));
6715 New_Reference_To (B, Loc));
6718 Make_Procedure_Call_Statement (Loc,
6720 New_Reference_To (RTE (RE_Task_Entry_Call), Loc),
6721 Parameter_Associations => Params));
6723 -- Construct statement sequence for new block
6726 Make_Implicit_If_Statement (N,
6729 New_Reference_To (Cancel_Param, Loc)),
6730 Then_Statements => Tstats));
6732 -- Protected the call against abort
6735 Make_Procedure_Call_Statement (Loc,
6736 Name => New_Reference_To (RTE (RE_Abort_Defer), Loc),
6737 Parameter_Associations => Empty_List));
6740 Set_Entry_Cancel_Parameter (Blk_Ent, Cancel_Param);
6742 -- The result is the new block
6745 Make_Block_Statement (Loc,
6746 Declarations => Decls,
6747 Handled_Statement_Sequence =>
6748 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
6751 end Expand_N_Asynchronous_Select;
6753 -------------------------------------
6754 -- Expand_N_Conditional_Entry_Call --
6755 -------------------------------------
6757 -- The conditional task entry call is converted to a call to
6762 -- P : parms := (parm, parm, parm);
6766 -- (<acceptor-task>, -- Acceptor
6767 -- <entry-index>, -- E
6768 -- P'Address, -- Uninterpreted_Data
6769 -- Conditional_Call, -- Mode
6770 -- B); -- Rendezvous_Successful
6775 -- normal-statements
6781 -- For a description of the use of P and the assignments after the call,
6782 -- see Expand_N_Entry_Call_Statement. Note that the entry call of the
6783 -- conditional entry call has already been expanded (by the Expand_N_Entry
6784 -- _Call_Statement procedure) as follows:
6787 -- P : parms := (parm, parm, parm);
6789 -- ... info for in-out parameters
6790 -- Call_Simple (acceptor-task, entry-index, P'Address);
6796 -- so the task at hand is to convert the latter expansion into the former
6798 -- The conditional protected entry call is converted to a call to
6799 -- Protected_Entry_Call:
6802 -- P : parms := (parm, parm, parm);
6803 -- Bnn : Communications_Block;
6806 -- Protected_Entry_Call
6807 -- (po._object'Access, -- Object
6808 -- <entry index>, -- E
6809 -- P'Address, -- Uninterpreted_Data
6810 -- Conditional_Call, -- Mode
6815 -- if Cancelled (Bnn) then
6818 -- normal-statements
6822 -- Ada 2005 (AI-345): A dispatching conditional entry call is converted
6826 -- B : Boolean := False;
6827 -- C : Ada.Tags.Prim_Op_Kind;
6828 -- K : Ada.Tags.Tagged_Kind :=
6829 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
6830 -- P : Parameters := (Param1 .. ParamN);
6834 -- if K = Ada.Tags.TK_Limited_Tagged then
6835 -- <dispatching-call>;
6836 -- <triggering-statements>
6840 -- Ada.Tags.Get_Offset_Index
6841 -- (Ada.Tags.Tag (<object>), DT_Position (<dispatching-call>));
6843 -- _Disp_Conditional_Select (<object>, S, P'Address, C, B);
6845 -- if C = POK_Protected_Entry
6846 -- or else C = POK_Task_Entry
6848 -- Param1 := P.Param1;
6850 -- ParamN := P.ParamN;
6854 -- if C = POK_Procedure
6855 -- or else C = POK_Protected_Procedure
6856 -- or else C = POK_Task_Procedure
6858 -- <dispatching-call>;
6861 -- <triggering-statements>
6863 -- <else-statements>
6868 procedure Expand_N_Conditional_Entry_Call (N : Node_Id) is
6869 Loc : constant Source_Ptr := Sloc (N);
6870 Alt : constant Node_Id := Entry_Call_Alternative (N);
6871 Blk : Node_Id := Entry_Call_Statement (Alt);
6874 Blk_Typ : Entity_Id;
6876 Call_Ent : Entity_Id;
6877 Conc_Typ_Stmts : List_Id;
6881 Lim_Typ_Stmts : List_Id;
6888 Transient_Blk : Node_Id;
6891 B : Entity_Id; -- Call status flag
6892 C : Entity_Id; -- Call kind
6893 K : Entity_Id; -- Tagged kind
6894 P : Entity_Id; -- Parameter block
6895 S : Entity_Id; -- Primitive operation slot
6898 Process_Statements_For_Controlled_Objects (N);
6900 if Ada_Version >= Ada_2005
6901 and then Nkind (Blk) = N_Procedure_Call_Statement
6903 Extract_Dispatching_Call (Blk, Call_Ent, Obj, Actuals, Formals);
6908 -- Call status flag processing, generate:
6909 -- B : Boolean := False;
6911 B := Build_B (Loc, Decls);
6913 -- Call kind processing, generate:
6914 -- C : Ada.Tags.Prim_Op_Kind;
6916 C := Build_C (Loc, Decls);
6918 -- Tagged kind processing, generate:
6919 -- K : Ada.Tags.Tagged_Kind :=
6920 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
6922 K := Build_K (Loc, Decls, Obj);
6924 -- Parameter block processing
6926 Blk_Typ := Build_Parameter_Block (Loc, Actuals, Formals, Decls);
6927 P := Parameter_Block_Pack
6928 (Loc, Blk_Typ, Actuals, Formals, Decls, Stmts);
6930 -- Dispatch table slot processing, generate:
6933 S := Build_S (Loc, Decls);
6936 -- S := Ada.Tags.Get_Offset_Index
6937 -- (Ada.Tags.Tag (<object>), DT_Position (Call_Ent));
6940 New_List (Build_S_Assignment (Loc, S, Obj, Call_Ent));
6943 -- _Disp_Conditional_Select (<object>, S, P'Address, C, B);
6945 Append_To (Conc_Typ_Stmts,
6946 Make_Procedure_Call_Statement (Loc,
6949 Find_Prim_Op (Etype (Etype (Obj)),
6950 Name_uDisp_Conditional_Select),
6952 Parameter_Associations =>
6954 New_Copy_Tree (Obj), -- <object>
6955 New_Reference_To (S, Loc), -- S
6956 Make_Attribute_Reference (Loc, -- P'Address
6958 New_Reference_To (P, Loc),
6961 New_Reference_To (C, Loc), -- C
6962 New_Reference_To (B, Loc)))); -- B
6965 -- if C = POK_Protected_Entry
6966 -- or else C = POK_Task_Entry
6968 -- Param1 := P.Param1;
6970 -- ParamN := P.ParamN;
6973 Unpack := Parameter_Block_Unpack (Loc, P, Actuals, Formals);
6975 -- Generate the if statement only when the packed parameters need
6976 -- explicit assignments to their corresponding actuals.
6978 if Present (Unpack) then
6979 Append_To (Conc_Typ_Stmts,
6980 Make_If_Statement (Loc,
6987 New_Reference_To (C, Loc),
6989 New_Reference_To (RTE (
6990 RE_POK_Protected_Entry), Loc)),
6994 New_Reference_To (C, Loc),
6996 New_Reference_To (RTE (RE_POK_Task_Entry), Loc))),
7004 -- if C = POK_Procedure
7005 -- or else C = POK_Protected_Procedure
7006 -- or else C = POK_Task_Procedure
7008 -- <dispatching-call>
7010 -- <normal-statements>
7012 -- <else-statements>
7015 N_Stats := New_Copy_List_Tree (Statements (Alt));
7017 Prepend_To (N_Stats,
7018 Make_If_Statement (Loc,
7024 New_Reference_To (C, Loc),
7026 New_Reference_To (RTE (RE_POK_Procedure), Loc)),
7033 New_Reference_To (C, Loc),
7035 New_Reference_To (RTE (
7036 RE_POK_Protected_Procedure), Loc)),
7041 New_Reference_To (C, Loc),
7043 New_Reference_To (RTE (
7044 RE_POK_Task_Procedure), Loc)))),
7049 Append_To (Conc_Typ_Stmts,
7050 Make_If_Statement (Loc,
7051 Condition => New_Reference_To (B, Loc),
7052 Then_Statements => N_Stats,
7053 Else_Statements => Else_Statements (N)));
7056 -- <dispatching-call>;
7057 -- <triggering-statements>
7059 Lim_Typ_Stmts := New_Copy_List_Tree (Statements (Alt));
7060 Prepend_To (Lim_Typ_Stmts, New_Copy_Tree (Blk));
7063 -- if K = Ada.Tags.TK_Limited_Tagged then
7070 Make_If_Statement (Loc,
7074 New_Reference_To (K, Loc),
7076 New_Reference_To (RTE (RE_TK_Limited_Tagged), Loc)),
7085 Make_Block_Statement (Loc,
7088 Handled_Statement_Sequence =>
7089 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
7091 -- As described above, The entry alternative is transformed into a
7092 -- block that contains the gnulli call, and possibly assignment
7093 -- statements for in-out parameters. The gnulli call may itself be
7094 -- rewritten into a transient block if some unconstrained parameters
7095 -- require it. We need to retrieve the call to complete its parameter
7100 First_Real_Statement (Handled_Statement_Sequence (Blk));
7102 if Present (Transient_Blk)
7103 and then Nkind (Transient_Blk) = N_Block_Statement
7105 Blk := Transient_Blk;
7108 Stmts := Statements (Handled_Statement_Sequence (Blk));
7109 Stmt := First (Stmts);
7110 while Nkind (Stmt) /= N_Procedure_Call_Statement loop
7115 Params := Parameter_Associations (Call);
7117 if Is_RTE (Entity (Name (Call)), RE_Protected_Entry_Call) then
7119 -- Substitute Conditional_Entry_Call for Simple_Call parameter
7121 Param := First (Params);
7122 while Present (Param)
7123 and then not Is_RTE (Etype (Param), RE_Call_Modes)
7128 pragma Assert (Present (Param));
7129 Rewrite (Param, New_Reference_To (RTE (RE_Conditional_Call), Loc));
7133 -- Find the Communication_Block parameter for the call to the
7134 -- Cancelled function.
7136 Decl := First (Declarations (Blk));
7137 while Present (Decl)
7138 and then not Is_RTE (Etype (Object_Definition (Decl)),
7139 RE_Communication_Block)
7144 -- Add an if statement to execute the else part if the call
7145 -- does not succeed (as indicated by the Cancelled predicate).
7148 Make_Implicit_If_Statement (N,
7149 Condition => Make_Function_Call (Loc,
7150 Name => New_Reference_To (RTE (RE_Cancelled), Loc),
7151 Parameter_Associations => New_List (
7152 New_Reference_To (Defining_Identifier (Decl), Loc))),
7153 Then_Statements => Else_Statements (N),
7154 Else_Statements => Statements (Alt)));
7157 B := Make_Defining_Identifier (Loc, Name_uB);
7159 -- Insert declaration of B in declarations of existing block
7161 if No (Declarations (Blk)) then
7162 Set_Declarations (Blk, New_List);
7165 Prepend_To (Declarations (Blk),
7166 Make_Object_Declaration (Loc,
7167 Defining_Identifier => B,
7168 Object_Definition =>
7169 New_Reference_To (Standard_Boolean, Loc)));
7171 -- Create new call statement
7174 New_Reference_To (RTE (RE_Conditional_Call), Loc));
7175 Append_To (Params, New_Reference_To (B, Loc));
7178 Make_Procedure_Call_Statement (Loc,
7179 Name => New_Reference_To (RTE (RE_Task_Entry_Call), Loc),
7180 Parameter_Associations => Params));
7182 -- Construct statement sequence for new block
7185 Make_Implicit_If_Statement (N,
7186 Condition => New_Reference_To (B, Loc),
7187 Then_Statements => Statements (Alt),
7188 Else_Statements => Else_Statements (N)));
7191 -- The result is the new block
7194 Make_Block_Statement (Loc,
7195 Declarations => Declarations (Blk),
7196 Handled_Statement_Sequence =>
7197 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
7201 end Expand_N_Conditional_Entry_Call;
7203 ---------------------------------------
7204 -- Expand_N_Delay_Relative_Statement --
7205 ---------------------------------------
7207 -- Delay statement is implemented as a procedure call to Delay_For
7208 -- defined in Ada.Calendar.Delays in order to reduce the overhead of
7209 -- simple delays imposed by the use of Protected Objects.
7211 procedure Expand_N_Delay_Relative_Statement (N : Node_Id) is
7212 Loc : constant Source_Ptr := Sloc (N);
7215 Make_Procedure_Call_Statement (Loc,
7216 Name => New_Reference_To (RTE (RO_CA_Delay_For), Loc),
7217 Parameter_Associations => New_List (Expression (N))));
7219 end Expand_N_Delay_Relative_Statement;
7221 ------------------------------------
7222 -- Expand_N_Delay_Until_Statement --
7223 ------------------------------------
7225 -- Delay Until statement is implemented as a procedure call to
7226 -- Delay_Until defined in Ada.Calendar.Delays and Ada.Real_Time.Delays.
7228 procedure Expand_N_Delay_Until_Statement (N : Node_Id) is
7229 Loc : constant Source_Ptr := Sloc (N);
7233 if Is_RTE (Base_Type (Etype (Expression (N))), RO_CA_Time) then
7234 Typ := RTE (RO_CA_Delay_Until);
7236 Typ := RTE (RO_RT_Delay_Until);
7240 Make_Procedure_Call_Statement (Loc,
7241 Name => New_Reference_To (Typ, Loc),
7242 Parameter_Associations => New_List (Expression (N))));
7245 end Expand_N_Delay_Until_Statement;
7247 -------------------------
7248 -- Expand_N_Entry_Body --
7249 -------------------------
7251 procedure Expand_N_Entry_Body (N : Node_Id) is
7253 -- Associate discriminals with the next protected operation body to be
7256 if Present (Next_Protected_Operation (N)) then
7257 Set_Discriminals (Parent (Current_Scope));
7259 end Expand_N_Entry_Body;
7261 -----------------------------------
7262 -- Expand_N_Entry_Call_Statement --
7263 -----------------------------------
7265 -- An entry call is expanded into GNARLI calls to implement a simple entry
7266 -- call (see Build_Simple_Entry_Call).
7268 procedure Expand_N_Entry_Call_Statement (N : Node_Id) is
7274 if No_Run_Time_Mode then
7275 Error_Msg_CRT ("entry call", N);
7279 -- If this entry call is part of an asynchronous select, don't expand it
7280 -- here; it will be expanded with the select statement. Don't expand
7281 -- timed entry calls either, as they are translated into asynchronous
7284 -- ??? This whole approach is questionable; it may be better to go back
7285 -- to allowing the expansion to take place and then attempting to fix it
7286 -- up in Expand_N_Asynchronous_Select. The tricky part is figuring out
7287 -- whether the expanded call is on a task or protected entry.
7289 if (Nkind (Parent (N)) /= N_Triggering_Alternative
7290 or else N /= Triggering_Statement (Parent (N)))
7291 and then (Nkind (Parent (N)) /= N_Entry_Call_Alternative
7292 or else N /= Entry_Call_Statement (Parent (N))
7293 or else Nkind (Parent (Parent (N))) /= N_Timed_Entry_Call)
7295 Extract_Entry (N, Concval, Ename, Index);
7296 Build_Simple_Entry_Call (N, Concval, Ename, Index);
7298 end Expand_N_Entry_Call_Statement;
7300 --------------------------------
7301 -- Expand_N_Entry_Declaration --
7302 --------------------------------
7304 -- If there are parameters, then first, each of the formals is marked by
7305 -- setting Is_Entry_Formal. Next a record type is built which is used to
7306 -- hold the parameter values. The name of this record type is entryP where
7307 -- entry is the name of the entry, with an additional corresponding access
7308 -- type called entryPA. The record type has matching components for each
7309 -- formal (the component names are the same as the formal names). For
7310 -- elementary types, the component type matches the formal type. For
7311 -- composite types, an access type is declared (with the name formalA)
7312 -- which designates the formal type, and the type of the component is this
7313 -- access type. Finally the Entry_Component of each formal is set to
7314 -- reference the corresponding record component.
7316 procedure Expand_N_Entry_Declaration (N : Node_Id) is
7317 Loc : constant Source_Ptr := Sloc (N);
7318 Entry_Ent : constant Entity_Id := Defining_Identifier (N);
7319 Components : List_Id;
7322 Last_Decl : Node_Id;
7323 Component : Entity_Id;
7326 Rec_Ent : Entity_Id;
7327 Acc_Ent : Entity_Id;
7330 Formal := First_Formal (Entry_Ent);
7333 -- Most processing is done only if parameters are present
7335 if Present (Formal) then
7336 Components := New_List;
7338 -- Loop through formals
7340 while Present (Formal) loop
7341 Set_Is_Entry_Formal (Formal);
7343 Make_Defining_Identifier (Sloc (Formal), Chars (Formal));
7344 Set_Entry_Component (Formal, Component);
7345 Set_Entry_Formal (Component, Formal);
7346 Ftype := Etype (Formal);
7348 -- Declare new access type and then append
7350 Ctype := Make_Temporary (Loc, 'A');
7353 Make_Full_Type_Declaration (Loc,
7354 Defining_Identifier => Ctype,
7356 Make_Access_To_Object_Definition (Loc,
7357 All_Present => True,
7358 Constant_Present => Ekind (Formal) = E_In_Parameter,
7359 Subtype_Indication => New_Reference_To (Ftype, Loc)));
7361 Insert_After (Last_Decl, Decl);
7364 Append_To (Components,
7365 Make_Component_Declaration (Loc,
7366 Defining_Identifier => Component,
7367 Component_Definition =>
7368 Make_Component_Definition (Loc,
7369 Aliased_Present => False,
7370 Subtype_Indication => New_Reference_To (Ctype, Loc))));
7372 Next_Formal_With_Extras (Formal);
7375 -- Create the Entry_Parameter_Record declaration
7377 Rec_Ent := Make_Temporary (Loc, 'P');
7380 Make_Full_Type_Declaration (Loc,
7381 Defining_Identifier => Rec_Ent,
7383 Make_Record_Definition (Loc,
7385 Make_Component_List (Loc,
7386 Component_Items => Components)));
7388 Insert_After (Last_Decl, Decl);
7391 -- Construct and link in the corresponding access type
7393 Acc_Ent := Make_Temporary (Loc, 'A');
7395 Set_Entry_Parameters_Type (Entry_Ent, Acc_Ent);
7398 Make_Full_Type_Declaration (Loc,
7399 Defining_Identifier => Acc_Ent,
7401 Make_Access_To_Object_Definition (Loc,
7402 All_Present => True,
7403 Subtype_Indication => New_Reference_To (Rec_Ent, Loc)));
7405 Insert_After (Last_Decl, Decl);
7407 end Expand_N_Entry_Declaration;
7409 -----------------------------
7410 -- Expand_N_Protected_Body --
7411 -----------------------------
7413 -- Protected bodies are expanded to the completion of the subprograms
7414 -- created for the corresponding protected type. These are a protected and
7415 -- unprotected version of each protected subprogram in the object, a
7416 -- function to calculate each entry barrier, and a procedure to execute the
7417 -- sequence of statements of each protected entry body. For example, for
7418 -- protected type ptype:
7421 -- (O : System.Address;
7422 -- E : Protected_Entry_Index)
7425 -- <discriminant renamings>
7426 -- <private object renamings>
7428 -- return <barrier expression>;
7431 -- procedure pprocN (_object : in out poV;...) is
7432 -- <discriminant renamings>
7433 -- <private object renamings>
7435 -- <sequence of statements>
7438 -- procedure pprocP (_object : in out poV;...) is
7439 -- procedure _clean is
7442 -- ptypeS (_object, Pn);
7443 -- Unlock (_object._object'Access);
7444 -- Abort_Undefer.all;
7449 -- Lock (_object._object'Access);
7450 -- pprocN (_object;...);
7455 -- function pfuncN (_object : poV;...) return Return_Type is
7456 -- <discriminant renamings>
7457 -- <private object renamings>
7459 -- <sequence of statements>
7462 -- function pfuncP (_object : poV) return Return_Type is
7463 -- procedure _clean is
7465 -- Unlock (_object._object'Access);
7466 -- Abort_Undefer.all;
7471 -- Lock (_object._object'Access);
7472 -- return pfuncN (_object);
7479 -- (O : System.Address;
7480 -- P : System.Address;
7481 -- E : Protected_Entry_Index)
7483 -- <discriminant renamings>
7484 -- <private object renamings>
7485 -- type poVP is access poV;
7486 -- _Object : ptVP := ptVP!(O);
7490 -- <statement sequence>
7491 -- Complete_Entry_Body (_Object._Object);
7493 -- when all others =>
7494 -- Exceptional_Complete_Entry_Body (
7495 -- _Object._Object, Get_GNAT_Exception);
7499 -- The type poV is the record created for the protected type to hold
7500 -- the state of the protected object.
7502 procedure Expand_N_Protected_Body (N : Node_Id) is
7503 Loc : constant Source_Ptr := Sloc (N);
7504 Pid : constant Entity_Id := Corresponding_Spec (N);
7506 Current_Node : Node_Id;
7507 Disp_Op_Body : Node_Id;
7508 New_Op_Body : Node_Id;
7509 Num_Entries : Natural := 0;
7513 function Build_Dispatching_Subprogram_Body
7516 Prot_Bod : Node_Id) return Node_Id;
7517 -- Build a dispatching version of the protected subprogram body. The
7518 -- newly generated subprogram contains a call to the original protected
7519 -- body. The following code is generated:
7521 -- function <protected-function-name> (Param1 .. ParamN) return
7524 -- return <protected-function-name>P (Param1 .. ParamN);
7525 -- end <protected-function-name>;
7529 -- procedure <protected-procedure-name> (Param1 .. ParamN) is
7531 -- <protected-procedure-name>P (Param1 .. ParamN);
7532 -- end <protected-procedure-name>
7534 ---------------------------------------
7535 -- Build_Dispatching_Subprogram_Body --
7536 ---------------------------------------
7538 function Build_Dispatching_Subprogram_Body
7541 Prot_Bod : Node_Id) return Node_Id
7543 Loc : constant Source_Ptr := Sloc (N);
7550 -- Generate a specification without a letter suffix in order to
7551 -- override an interface function or procedure.
7553 Spec := Build_Protected_Sub_Specification (N, Pid, Dispatching_Mode);
7555 -- The formal parameters become the actuals of the protected function
7556 -- or procedure call.
7558 Actuals := New_List;
7559 Formal := First (Parameter_Specifications (Spec));
7560 while Present (Formal) loop
7562 Make_Identifier (Loc, Chars (Defining_Identifier (Formal))));
7567 if Nkind (Spec) = N_Procedure_Specification then
7570 Make_Procedure_Call_Statement (Loc,
7572 New_Reference_To (Corresponding_Spec (Prot_Bod), Loc),
7573 Parameter_Associations => Actuals));
7575 pragma Assert (Nkind (Spec) = N_Function_Specification);
7579 Make_Simple_Return_Statement (Loc,
7581 Make_Function_Call (Loc,
7583 New_Reference_To (Corresponding_Spec (Prot_Bod), Loc),
7584 Parameter_Associations => Actuals)));
7588 Make_Subprogram_Body (Loc,
7589 Declarations => Empty_List,
7590 Specification => Spec,
7591 Handled_Statement_Sequence =>
7592 Make_Handled_Sequence_Of_Statements (Loc, Stmts));
7593 end Build_Dispatching_Subprogram_Body;
7595 -- Start of processing for Expand_N_Protected_Body
7598 if No_Run_Time_Mode then
7599 Error_Msg_CRT ("protected body", N);
7603 -- This is the proper body corresponding to a stub. The declarations
7604 -- must be inserted at the point of the stub, which in turn is in the
7605 -- declarative part of the parent unit.
7607 if Nkind (Parent (N)) = N_Subunit then
7608 Current_Node := Corresponding_Stub (Parent (N));
7613 Op_Body := First (Declarations (N));
7615 -- The protected body is replaced with the bodies of its
7616 -- protected operations, and the declarations for internal objects
7617 -- that may have been created for entry family bounds.
7619 Rewrite (N, Make_Null_Statement (Sloc (N)));
7622 while Present (Op_Body) loop
7623 case Nkind (Op_Body) is
7624 when N_Subprogram_Declaration =>
7627 when N_Subprogram_Body =>
7629 -- Do not create bodies for eliminated operations
7631 if not Is_Eliminated (Defining_Entity (Op_Body))
7632 and then not Is_Eliminated (Corresponding_Spec (Op_Body))
7635 Build_Unprotected_Subprogram_Body (Op_Body, Pid);
7637 Insert_After (Current_Node, New_Op_Body);
7638 Current_Node := New_Op_Body;
7639 Analyze (New_Op_Body);
7641 -- Build the corresponding protected operation. It may
7642 -- appear that this is needed only if this is a visible
7643 -- operation of the type, or if it is an interrupt handler,
7644 -- and this was the strategy used previously in GNAT.
7645 -- However, the operation may be exported through a 'Access
7646 -- to an external caller. This is the common idiom in code
7647 -- that uses the Ada 2005 Timing_Events package. As a result
7648 -- we need to produce the protected body for both visible
7649 -- and private operations, as well as operations that only
7650 -- have a body in the source, and for which we create a
7651 -- declaration in the protected body itself.
7653 if Present (Corresponding_Spec (Op_Body)) then
7655 Build_Protected_Subprogram_Body (
7656 Op_Body, Pid, Specification (New_Op_Body));
7658 Insert_After (Current_Node, New_Op_Body);
7659 Analyze (New_Op_Body);
7661 Current_Node := New_Op_Body;
7663 -- Generate an overriding primitive operation body for
7664 -- this subprogram if the protected type implements an
7667 if Ada_Version >= Ada_2005
7669 Present (Interfaces (Corresponding_Record_Type (Pid)))
7672 Build_Dispatching_Subprogram_Body
7673 (Op_Body, Pid, New_Op_Body);
7675 Insert_After (Current_Node, Disp_Op_Body);
7676 Analyze (Disp_Op_Body);
7678 Current_Node := Disp_Op_Body;
7683 when N_Entry_Body =>
7684 Op_Id := Defining_Identifier (Op_Body);
7685 Num_Entries := Num_Entries + 1;
7687 New_Op_Body := Build_Protected_Entry (Op_Body, Op_Id, Pid);
7689 Insert_After (Current_Node, New_Op_Body);
7690 Current_Node := New_Op_Body;
7691 Analyze (New_Op_Body);
7693 when N_Implicit_Label_Declaration =>
7696 when N_Itype_Reference =>
7697 Insert_After (Current_Node, New_Copy (Op_Body));
7699 when N_Freeze_Entity =>
7700 New_Op_Body := New_Copy (Op_Body);
7702 if Present (Entity (Op_Body))
7703 and then Freeze_Node (Entity (Op_Body)) = Op_Body
7705 Set_Freeze_Node (Entity (Op_Body), New_Op_Body);
7708 Insert_After (Current_Node, New_Op_Body);
7709 Current_Node := New_Op_Body;
7710 Analyze (New_Op_Body);
7713 New_Op_Body := New_Copy (Op_Body);
7714 Insert_After (Current_Node, New_Op_Body);
7715 Current_Node := New_Op_Body;
7716 Analyze (New_Op_Body);
7718 when N_Object_Declaration =>
7719 pragma Assert (not Comes_From_Source (Op_Body));
7720 New_Op_Body := New_Copy (Op_Body);
7721 Insert_After (Current_Node, New_Op_Body);
7722 Current_Node := New_Op_Body;
7723 Analyze (New_Op_Body);
7726 raise Program_Error;
7733 -- Finally, create the body of the function that maps an entry index
7734 -- into the corresponding body index, except when there is no entry, or
7735 -- in a Ravenscar-like profile.
7737 if Corresponding_Runtime_Package (Pid) =
7738 System_Tasking_Protected_Objects_Entries
7740 New_Op_Body := Build_Find_Body_Index (Pid);
7741 Insert_After (Current_Node, New_Op_Body);
7742 Current_Node := New_Op_Body;
7743 Analyze (New_Op_Body);
7746 -- Ada 2005 (AI-345): Construct the primitive wrapper bodies after the
7747 -- protected body. At this point all wrapper specs have been created,
7748 -- frozen and included in the dispatch table for the protected type.
7750 if Ada_Version >= Ada_2005 then
7751 Build_Wrapper_Bodies (Loc, Pid, Current_Node);
7753 end Expand_N_Protected_Body;
7755 -----------------------------------------
7756 -- Expand_N_Protected_Type_Declaration --
7757 -----------------------------------------
7759 -- First we create a corresponding record type declaration used to
7760 -- represent values of this protected type.
7761 -- The general form of this type declaration is
7763 -- type poV (discriminants) is record
7764 -- _Object : aliased <kind>Protection
7765 -- [(<entry count> [, <handler count>])];
7766 -- [entry_family : array (bounds) of Void;]
7767 -- <private data fields>
7770 -- The discriminants are present only if the corresponding protected type
7771 -- has discriminants, and they exactly mirror the protected type
7772 -- discriminants. The private data fields similarly mirror the private
7773 -- declarations of the protected type.
7775 -- The Object field is always present. It contains RTS specific data used
7776 -- to control the protected object. It is declared as Aliased so that it
7777 -- can be passed as a pointer to the RTS. This allows the protected record
7778 -- to be referenced within RTS data structures. An appropriate Protection
7779 -- type and discriminant are generated.
7781 -- The Service field is present for protected objects with entries. It
7782 -- contains sufficient information to allow the entry service procedure for
7783 -- this object to be called when the object is not known till runtime.
7785 -- One entry_family component is present for each entry family in the
7786 -- task definition (see Expand_N_Task_Type_Declaration).
7788 -- When a protected object is declared, an instance of the protected type
7789 -- value record is created. The elaboration of this declaration creates the
7790 -- correct bounds for the entry families, and also evaluates the priority
7791 -- expression if needed. The initialization routine for the protected type
7792 -- itself then calls Initialize_Protection with appropriate parameters to
7793 -- initialize the value of the Task_Id field. Install_Handlers may be also
7794 -- called if a pragma Attach_Handler applies.
7796 -- Note: this record is passed to the subprograms created by the expansion
7797 -- of protected subprograms and entries. It is an in parameter to protected
7798 -- functions and an in out parameter to procedures and entry bodies. The
7799 -- Entity_Id for this created record type is placed in the
7800 -- Corresponding_Record_Type field of the associated protected type entity.
7802 -- Next we create a procedure specifications for protected subprograms and
7803 -- entry bodies. For each protected subprograms two subprograms are
7804 -- created, an unprotected and a protected version. The unprotected version
7805 -- is called from within other operations of the same protected object.
7807 -- We also build the call to register the procedure if a pragma
7808 -- Interrupt_Handler applies.
7810 -- A single subprogram is created to service all entry bodies; it has an
7811 -- additional boolean out parameter indicating that the previous entry call
7812 -- made by the current task was serviced immediately, i.e. not by proxy.
7813 -- The O parameter contains a pointer to a record object of the type
7814 -- described above. An untyped interface is used here to allow this
7815 -- procedure to be called in places where the type of the object to be
7816 -- serviced is not known. This must be done, for example, when a call that
7817 -- may have been requeued is cancelled; the corresponding object must be
7818 -- serviced, but which object that is not known till runtime.
7821 -- (O : System.Address; P : out Boolean);
7822 -- procedure pprocN (_object : in out poV);
7823 -- procedure pproc (_object : in out poV);
7824 -- function pfuncN (_object : poV);
7825 -- function pfunc (_object : poV);
7828 -- Note that this must come after the record type declaration, since
7829 -- the specs refer to this type.
7831 procedure Expand_N_Protected_Type_Declaration (N : Node_Id) is
7832 Loc : constant Source_Ptr := Sloc (N);
7833 Prot_Typ : constant Entity_Id := Defining_Identifier (N);
7835 Pdef : constant Node_Id := Protected_Definition (N);
7836 -- This contains two lists; one for visible and one for private decls
7840 Discr_Map : constant Elist_Id := New_Elmt_List;
7844 Comp_Id : Entity_Id;
7846 Current_Node : Node_Id := N;
7847 Bdef : Entity_Id := Empty; -- avoid uninit warning
7848 Edef : Entity_Id := Empty; -- avoid uninit warning
7849 Entries_Aggr : Node_Id;
7850 Body_Id : Entity_Id;
7853 Object_Comp : Node_Id;
7855 procedure Check_Inlining (Subp : Entity_Id);
7856 -- If the original operation has a pragma Inline, propagate the flag
7857 -- to the internal body, for possible inlining later on. The source
7858 -- operation is invisible to the back-end and is never actually called.
7860 function Static_Component_Size (Comp : Entity_Id) return Boolean;
7861 -- When compiling under the Ravenscar profile, private components must
7862 -- have a static size, or else a protected object will require heap
7863 -- allocation, violating the corresponding restriction. It is preferable
7864 -- to make this check here, because it provides a better error message
7865 -- than the back-end, which refers to the object as a whole.
7867 procedure Register_Handler;
7868 -- For a protected operation that is an interrupt handler, add the
7869 -- freeze action that will register it as such.
7871 --------------------
7872 -- Check_Inlining --
7873 --------------------
7875 procedure Check_Inlining (Subp : Entity_Id) is
7877 if Is_Inlined (Subp) then
7878 Set_Is_Inlined (Protected_Body_Subprogram (Subp));
7879 Set_Is_Inlined (Subp, False);
7883 ---------------------------------
7884 -- Check_Static_Component_Size --
7885 ---------------------------------
7887 function Static_Component_Size (Comp : Entity_Id) return Boolean is
7888 Typ : constant Entity_Id := Etype (Comp);
7892 if Is_Scalar_Type (Typ) then
7895 elsif Is_Array_Type (Typ) then
7896 return Compile_Time_Known_Bounds (Typ);
7898 elsif Is_Record_Type (Typ) then
7899 C := First_Component (Typ);
7900 while Present (C) loop
7901 if not Static_Component_Size (C) then
7910 -- Any other types will be checked by the back-end
7915 end Static_Component_Size;
7917 ----------------------
7918 -- Register_Handler --
7919 ----------------------
7921 procedure Register_Handler is
7923 -- All semantic checks already done in Sem_Prag
7925 Prot_Proc : constant Entity_Id :=
7927 (Specification (Current_Node));
7929 Proc_Address : constant Node_Id :=
7930 Make_Attribute_Reference (Loc,
7931 Prefix => New_Reference_To (Prot_Proc, Loc),
7932 Attribute_Name => Name_Address);
7934 RTS_Call : constant Entity_Id :=
7935 Make_Procedure_Call_Statement (Loc,
7938 RTE (RE_Register_Interrupt_Handler), Loc),
7939 Parameter_Associations =>
7940 New_List (Proc_Address));
7942 Append_Freeze_Action (Prot_Proc, RTS_Call);
7943 end Register_Handler;
7945 -- Start of processing for Expand_N_Protected_Type_Declaration
7948 if Present (Corresponding_Record_Type (Prot_Typ)) then
7951 Rec_Decl := Build_Corresponding_Record (N, Prot_Typ, Loc);
7954 Cdecls := Component_Items (Component_List (Type_Definition (Rec_Decl)));
7956 Qualify_Entity_Names (N);
7958 -- If the type has discriminants, their occurrences in the declaration
7959 -- have been replaced by the corresponding discriminals. For components
7960 -- that are constrained by discriminants, their homologues in the
7961 -- corresponding record type must refer to the discriminants of that
7962 -- record, so we must apply a new renaming to subtypes_indications:
7964 -- protected discriminant => discriminal => record discriminant
7966 -- This replacement is not applied to default expressions, for which
7967 -- the discriminal is correct.
7969 if Has_Discriminants (Prot_Typ) then
7975 Disc := First_Discriminant (Prot_Typ);
7976 Decl := First (Discriminant_Specifications (Rec_Decl));
7977 while Present (Disc) loop
7978 Append_Elmt (Discriminal (Disc), Discr_Map);
7979 Append_Elmt (Defining_Identifier (Decl), Discr_Map);
7980 Next_Discriminant (Disc);
7986 -- Fill in the component declarations
7988 -- Add components for entry families. For each entry family, create an
7989 -- anonymous type declaration with the same size, and analyze the type.
7991 Collect_Entry_Families (Loc, Cdecls, Current_Node, Prot_Typ);
7993 -- Prepend the _Object field with the right type to the component list.
7994 -- We need to compute the number of entries, and in some cases the
7995 -- number of Attach_Handler pragmas.
7999 Num_Attach_Handler : Int := 0;
8000 Protection_Subtype : Node_Id;
8001 Entry_Count_Expr : constant Node_Id :=
8002 Build_Entry_Count_Expression
8003 (Prot_Typ, Cdecls, Loc);
8006 -- Could this be simplified using Corresponding_Runtime_Package???
8008 if Has_Attach_Handler (Prot_Typ) then
8009 Ritem := First_Rep_Item (Prot_Typ);
8010 while Present (Ritem) loop
8011 if Nkind (Ritem) = N_Pragma
8012 and then Pragma_Name (Ritem) = Name_Attach_Handler
8014 Num_Attach_Handler := Num_Attach_Handler + 1;
8017 Next_Rep_Item (Ritem);
8020 if Restricted_Profile then
8021 if Has_Entries (Prot_Typ) then
8022 Protection_Subtype :=
8023 New_Reference_To (RTE (RE_Protection_Entry), Loc);
8025 Protection_Subtype :=
8026 New_Reference_To (RTE (RE_Protection), Loc);
8029 Protection_Subtype :=
8030 Make_Subtype_Indication
8034 (RTE (RE_Static_Interrupt_Protection), Loc),
8036 Make_Index_Or_Discriminant_Constraint (
8038 Constraints => New_List (
8040 Make_Integer_Literal (Loc, Num_Attach_Handler))));
8043 elsif Has_Interrupt_Handler (Prot_Typ)
8044 and then not Restriction_Active (No_Dynamic_Attachment)
8046 Protection_Subtype :=
8047 Make_Subtype_Indication (
8049 Subtype_Mark => New_Reference_To
8050 (RTE (RE_Dynamic_Interrupt_Protection), Loc),
8052 Make_Index_Or_Discriminant_Constraint (
8054 Constraints => New_List (Entry_Count_Expr)));
8056 -- Type has explicit entries or generated primitive entry wrappers
8058 elsif Has_Entries (Prot_Typ)
8059 or else (Ada_Version >= Ada_2005
8060 and then Present (Interface_List (N)))
8062 case Corresponding_Runtime_Package (Prot_Typ) is
8063 when System_Tasking_Protected_Objects_Entries =>
8064 Protection_Subtype :=
8065 Make_Subtype_Indication (Loc,
8067 New_Reference_To (RTE (RE_Protection_Entries), Loc),
8069 Make_Index_Or_Discriminant_Constraint (
8071 Constraints => New_List (Entry_Count_Expr)));
8073 when System_Tasking_Protected_Objects_Single_Entry =>
8074 Protection_Subtype :=
8075 New_Reference_To (RTE (RE_Protection_Entry), Loc);
8078 raise Program_Error;
8082 Protection_Subtype := New_Reference_To (RTE (RE_Protection), Loc);
8086 Make_Component_Declaration (Loc,
8087 Defining_Identifier =>
8088 Make_Defining_Identifier (Loc, Name_uObject),
8089 Component_Definition =>
8090 Make_Component_Definition (Loc,
8091 Aliased_Present => True,
8092 Subtype_Indication => Protection_Subtype));
8095 pragma Assert (Present (Pdef));
8097 -- Add private field components
8099 if Present (Private_Declarations (Pdef)) then
8100 Priv := First (Private_Declarations (Pdef));
8102 while Present (Priv) loop
8104 if Nkind (Priv) = N_Component_Declaration then
8105 if not Static_Component_Size (Defining_Identifier (Priv)) then
8107 -- When compiling for a restricted profile, the private
8108 -- components must have a static size. If not, this is an
8109 -- error for a single protected declaration, and rates a
8110 -- warning on a protected type declaration.
8112 if not Comes_From_Source (Prot_Typ) then
8113 Check_Restriction (No_Implicit_Heap_Allocations, Priv);
8115 elsif Restriction_Active (No_Implicit_Heap_Allocations) then
8116 Error_Msg_N ("component has non-static size?", Priv);
8118 ("\creation of protected object of type& will violate"
8119 & " restriction No_Implicit_Heap_Allocations?",
8124 -- The component definition consists of a subtype indication,
8125 -- or (in Ada 2005) an access definition. Make a copy of the
8126 -- proper definition.
8129 Old_Comp : constant Node_Id := Component_Definition (Priv);
8130 Oent : constant Entity_Id := Defining_Identifier (Priv);
8132 Nent : constant Entity_Id :=
8133 Make_Defining_Identifier (Sloc (Oent),
8134 Chars => Chars (Oent));
8137 if Present (Subtype_Indication (Old_Comp)) then
8139 Make_Component_Definition (Sloc (Oent),
8140 Aliased_Present => False,
8141 Subtype_Indication =>
8142 New_Copy_Tree (Subtype_Indication (Old_Comp),
8146 Make_Component_Definition (Sloc (Oent),
8147 Aliased_Present => False,
8148 Access_Definition =>
8149 New_Copy_Tree (Access_Definition (Old_Comp),
8154 Make_Component_Declaration (Loc,
8155 Defining_Identifier => Nent,
8156 Component_Definition => New_Comp,
8157 Expression => Expression (Priv));
8159 Set_Has_Per_Object_Constraint (Nent,
8160 Has_Per_Object_Constraint (Oent));
8162 Append_To (Cdecls, New_Priv);
8165 elsif Nkind (Priv) = N_Subprogram_Declaration then
8167 -- Make the unprotected version of the subprogram available
8168 -- for expansion of intra object calls. There is need for
8169 -- a protected version only if the subprogram is an interrupt
8170 -- handler, otherwise this operation can only be called from
8174 Make_Subprogram_Declaration (Loc,
8176 Build_Protected_Sub_Specification
8177 (Priv, Prot_Typ, Unprotected_Mode));
8179 Insert_After (Current_Node, Sub);
8182 Set_Protected_Body_Subprogram
8183 (Defining_Unit_Name (Specification (Priv)),
8184 Defining_Unit_Name (Specification (Sub)));
8185 Check_Inlining (Defining_Unit_Name (Specification (Priv)));
8186 Current_Node := Sub;
8189 Make_Subprogram_Declaration (Loc,
8191 Build_Protected_Sub_Specification
8192 (Priv, Prot_Typ, Protected_Mode));
8194 Insert_After (Current_Node, Sub);
8196 Current_Node := Sub;
8198 if Is_Interrupt_Handler
8199 (Defining_Unit_Name (Specification (Priv)))
8201 if not Restricted_Profile then
8211 -- Put the _Object component after the private component so that it
8212 -- be finalized early as required by 9.4 (20)
8214 Append_To (Cdecls, Object_Comp);
8216 Insert_After (Current_Node, Rec_Decl);
8217 Current_Node := Rec_Decl;
8219 -- Analyze the record declaration immediately after construction,
8220 -- because the initialization procedure is needed for single object
8221 -- declarations before the next entity is analyzed (the freeze call
8222 -- that generates this initialization procedure is found below).
8224 Analyze (Rec_Decl, Suppress => All_Checks);
8226 -- Ada 2005 (AI-345): Construct the primitive entry wrappers before
8227 -- the corresponding record is frozen. If any wrappers are generated,
8228 -- Current_Node is updated accordingly.
8230 if Ada_Version >= Ada_2005 then
8231 Build_Wrapper_Specs (Loc, Prot_Typ, Current_Node);
8234 -- Collect pointers to entry bodies and their barriers, to be placed
8235 -- in the Entry_Bodies_Array for the type. For each entry/family we
8236 -- add an expression to the aggregate which is the initial value of
8237 -- this array. The array is declared after all protected subprograms.
8239 if Has_Entries (Prot_Typ) then
8240 Entries_Aggr := Make_Aggregate (Loc, Expressions => New_List);
8242 Entries_Aggr := Empty;
8245 -- Build two new procedure specifications for each protected subprogram;
8246 -- one to call from outside the object and one to call from inside.
8247 -- Build a barrier function and an entry body action procedure
8248 -- specification for each protected entry. Initialize the entry body
8249 -- array. If subprogram is flagged as eliminated, do not generate any
8250 -- internal operations.
8254 Comp := First (Visible_Declarations (Pdef));
8256 while Present (Comp) loop
8257 if Nkind (Comp) = N_Subprogram_Declaration then
8259 Make_Subprogram_Declaration (Loc,
8261 Build_Protected_Sub_Specification
8262 (Comp, Prot_Typ, Unprotected_Mode));
8264 Insert_After (Current_Node, Sub);
8267 Set_Protected_Body_Subprogram
8268 (Defining_Unit_Name (Specification (Comp)),
8269 Defining_Unit_Name (Specification (Sub)));
8270 Check_Inlining (Defining_Unit_Name (Specification (Comp)));
8272 -- Make the protected version of the subprogram available for
8273 -- expansion of external calls.
8275 Current_Node := Sub;
8278 Make_Subprogram_Declaration (Loc,
8280 Build_Protected_Sub_Specification
8281 (Comp, Prot_Typ, Protected_Mode));
8283 Insert_After (Current_Node, Sub);
8286 Current_Node := Sub;
8288 -- Generate an overriding primitive operation specification for
8289 -- this subprogram if the protected type implements an interface.
8291 if Ada_Version >= Ada_2005
8293 Present (Interfaces (Corresponding_Record_Type (Prot_Typ)))
8296 Make_Subprogram_Declaration (Loc,
8298 Build_Protected_Sub_Specification
8299 (Comp, Prot_Typ, Dispatching_Mode));
8301 Insert_After (Current_Node, Sub);
8304 Current_Node := Sub;
8307 -- If a pragma Interrupt_Handler applies, build and add a call to
8308 -- Register_Interrupt_Handler to the freezing actions of the
8309 -- protected version (Current_Node) of the subprogram:
8311 -- system.interrupts.register_interrupt_handler
8312 -- (prot_procP'address);
8314 if not Restricted_Profile
8315 and then Is_Interrupt_Handler
8316 (Defining_Unit_Name (Specification (Comp)))
8321 elsif Nkind (Comp) = N_Entry_Declaration then
8322 E_Count := E_Count + 1;
8323 Comp_Id := Defining_Identifier (Comp);
8326 Make_Defining_Identifier (Loc,
8327 Build_Selected_Name (Prot_Typ, Comp_Id, 'E'));
8329 Make_Subprogram_Declaration (Loc,
8331 Build_Protected_Entry_Specification (Loc, Edef, Comp_Id));
8333 Insert_After (Current_Node, Sub);
8336 -- build wrapper procedure for pre/postconditions.
8338 Build_PPC_Wrapper (Comp_Id, N);
8340 Set_Protected_Body_Subprogram
8341 (Defining_Identifier (Comp),
8342 Defining_Unit_Name (Specification (Sub)));
8344 Current_Node := Sub;
8347 Make_Defining_Identifier (Loc,
8348 Chars => Build_Selected_Name (Prot_Typ, Comp_Id, 'B'));
8350 Make_Subprogram_Declaration (Loc,
8352 Build_Barrier_Function_Specification (Loc, Bdef));
8354 Insert_After (Current_Node, Sub);
8356 Set_Protected_Body_Subprogram (Bdef, Bdef);
8357 Set_Barrier_Function (Comp_Id, Bdef);
8358 Set_Scope (Bdef, Scope (Comp_Id));
8359 Current_Node := Sub;
8361 -- Collect pointers to the protected subprogram and the barrier
8362 -- of the current entry, for insertion into Entry_Bodies_Array.
8365 Make_Aggregate (Loc,
8366 Expressions => New_List (
8367 Make_Attribute_Reference (Loc,
8368 Prefix => New_Reference_To (Bdef, Loc),
8369 Attribute_Name => Name_Unrestricted_Access),
8370 Make_Attribute_Reference (Loc,
8371 Prefix => New_Reference_To (Edef, Loc),
8372 Attribute_Name => Name_Unrestricted_Access))),
8373 Expressions (Entries_Aggr));
8380 -- If there are some private entry declarations, expand it as if they
8381 -- were visible entries.
8383 if Present (Private_Declarations (Pdef)) then
8384 Comp := First (Private_Declarations (Pdef));
8385 while Present (Comp) loop
8386 if Nkind (Comp) = N_Entry_Declaration then
8387 E_Count := E_Count + 1;
8388 Comp_Id := Defining_Identifier (Comp);
8391 Make_Defining_Identifier (Loc,
8392 Build_Selected_Name (Prot_Typ, Comp_Id, 'E'));
8394 Make_Subprogram_Declaration (Loc,
8396 Build_Protected_Entry_Specification (Loc, Edef, Comp_Id));
8398 Insert_After (Current_Node, Sub);
8401 Set_Protected_Body_Subprogram
8402 (Defining_Identifier (Comp),
8403 Defining_Unit_Name (Specification (Sub)));
8405 Current_Node := Sub;
8408 Make_Defining_Identifier (Loc,
8409 Chars => Build_Selected_Name (Prot_Typ, Comp_Id, 'E'));
8412 Make_Subprogram_Declaration (Loc,
8414 Build_Barrier_Function_Specification (Loc, Bdef));
8416 Insert_After (Current_Node, Sub);
8418 Set_Protected_Body_Subprogram (Bdef, Bdef);
8419 Set_Barrier_Function (Comp_Id, Bdef);
8420 Set_Scope (Bdef, Scope (Comp_Id));
8421 Current_Node := Sub;
8423 -- Collect pointers to the protected subprogram and the barrier
8424 -- of the current entry, for insertion into Entry_Bodies_Array.
8426 Append_To (Expressions (Entries_Aggr),
8427 Make_Aggregate (Loc,
8428 Expressions => New_List (
8429 Make_Attribute_Reference (Loc,
8430 Prefix => New_Reference_To (Bdef, Loc),
8431 Attribute_Name => Name_Unrestricted_Access),
8432 Make_Attribute_Reference (Loc,
8433 Prefix => New_Reference_To (Edef, Loc),
8434 Attribute_Name => Name_Unrestricted_Access))));
8441 -- Emit declaration for Entry_Bodies_Array, now that the addresses of
8442 -- all protected subprograms have been collected.
8444 if Has_Entries (Prot_Typ) then
8446 Make_Defining_Identifier (Sloc (Prot_Typ),
8447 Chars => New_External_Name (Chars (Prot_Typ), 'A'));
8449 case Corresponding_Runtime_Package (Prot_Typ) is
8450 when System_Tasking_Protected_Objects_Entries =>
8451 Body_Arr := Make_Object_Declaration (Loc,
8452 Defining_Identifier => Body_Id,
8453 Aliased_Present => True,
8454 Object_Definition =>
8455 Make_Subtype_Indication (Loc,
8456 Subtype_Mark => New_Reference_To (
8457 RTE (RE_Protected_Entry_Body_Array), Loc),
8459 Make_Index_Or_Discriminant_Constraint (Loc,
8460 Constraints => New_List (
8462 Make_Integer_Literal (Loc, 1),
8463 Make_Integer_Literal (Loc, E_Count))))),
8464 Expression => Entries_Aggr);
8466 when System_Tasking_Protected_Objects_Single_Entry =>
8467 Body_Arr := Make_Object_Declaration (Loc,
8468 Defining_Identifier => Body_Id,
8469 Aliased_Present => True,
8470 Object_Definition => New_Reference_To
8471 (RTE (RE_Entry_Body), Loc),
8473 Make_Aggregate (Loc,
8474 Expressions => New_List (
8475 Make_Attribute_Reference (Loc,
8476 Prefix => New_Reference_To (Bdef, Loc),
8477 Attribute_Name => Name_Unrestricted_Access),
8478 Make_Attribute_Reference (Loc,
8479 Prefix => New_Reference_To (Edef, Loc),
8480 Attribute_Name => Name_Unrestricted_Access))));
8483 raise Program_Error;
8486 -- A pointer to this array will be placed in the corresponding record
8487 -- by its initialization procedure so this needs to be analyzed here.
8489 Insert_After (Current_Node, Body_Arr);
8490 Current_Node := Body_Arr;
8493 Set_Entry_Bodies_Array (Prot_Typ, Body_Id);
8495 -- Finally, build the function that maps an entry index into the
8496 -- corresponding body. A pointer to this function is placed in each
8497 -- object of the type. Except for a ravenscar-like profile (no abort,
8498 -- no entry queue, 1 entry)
8500 if Corresponding_Runtime_Package (Prot_Typ) =
8501 System_Tasking_Protected_Objects_Entries
8504 Make_Subprogram_Declaration (Loc,
8505 Specification => Build_Find_Body_Index_Spec (Prot_Typ));
8506 Insert_After (Current_Node, Sub);
8510 end Expand_N_Protected_Type_Declaration;
8512 --------------------------------
8513 -- Expand_N_Requeue_Statement --
8514 --------------------------------
8516 -- A non-dispatching requeue statement is expanded into one of four GNARLI
8517 -- operations, depending on the source and destination (task or protected
8518 -- object). A dispatching requeue statement is expanded into a call to the
8519 -- predefined primitive _Disp_Requeue. In addition, code is generated to
8520 -- jump around the remainder of processing for the original entry and, if
8521 -- the destination is (different) protected object, to attempt to service
8522 -- it. The following illustrates the various cases:
8525 -- (O : System.Address;
8526 -- P : System.Address;
8527 -- E : Protected_Entry_Index)
8529 -- <discriminant renamings>
8530 -- <private object renamings>
8531 -- type poVP is access poV;
8532 -- _object : ptVP := ptVP!(O);
8536 -- <start of statement sequence for entry>
8538 -- -- Requeue from one protected entry body to another protected
8541 -- Requeue_Protected_Entry (
8542 -- _object._object'Access,
8543 -- new._object'Access,
8548 -- <some more of the statement sequence for entry>
8550 -- -- Requeue from an entry body to a task entry
8552 -- Requeue_Protected_To_Task_Entry (
8558 -- <rest of statement sequence for entry>
8559 -- Complete_Entry_Body (_object._object);
8562 -- when all others =>
8563 -- Exceptional_Complete_Entry_Body (
8564 -- _object._object, Get_GNAT_Exception);
8568 -- Requeue of a task entry call to a task entry
8570 -- Accept_Call (E, Ann);
8571 -- <start of statement sequence for accept statement>
8572 -- Requeue_Task_Entry (New._task_id, E, Abort_Present);
8574 -- <rest of statement sequence for accept statement>
8576 -- Complete_Rendezvous;
8579 -- when all others =>
8580 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
8582 -- Requeue of a task entry call to a protected entry
8584 -- Accept_Call (E, Ann);
8585 -- <start of statement sequence for accept statement>
8586 -- Requeue_Task_To_Protected_Entry (
8587 -- new._object'Access,
8592 -- <rest of statement sequence for accept statement>
8594 -- Complete_Rendezvous;
8597 -- when all others =>
8598 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
8600 -- Ada 2012 (AI05-0030): Dispatching requeue to an interface primitive
8601 -- marked by pragma Implemented (XXX, By_Entry).
8603 -- The requeue is inside a protected entry:
8606 -- (O : System.Address;
8607 -- P : System.Address;
8608 -- E : Protected_Entry_Index)
8610 -- <discriminant renamings>
8611 -- <private object renamings>
8612 -- type poVP is access poV;
8613 -- _object : ptVP := ptVP!(O);
8617 -- <start of statement sequence for entry>
8620 -- (<interface class-wide object>,
8623 -- Ada.Tags.Get_Offset_Index
8625 -- <interface dispatch table index of target entry>),
8629 -- <rest of statement sequence for entry>
8630 -- Complete_Entry_Body (_object._object);
8633 -- when all others =>
8634 -- Exceptional_Complete_Entry_Body (
8635 -- _object._object, Get_GNAT_Exception);
8639 -- The requeue is inside a task entry:
8641 -- Accept_Call (E, Ann);
8642 -- <start of statement sequence for accept statement>
8644 -- (<interface class-wide object>,
8647 -- Ada.Tags.Get_Offset_Index
8649 -- <interface dispatch table index of target entrt>),
8653 -- <rest of statement sequence for accept statement>
8655 -- Complete_Rendezvous;
8658 -- when all others =>
8659 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
8661 -- Ada 2012 (AI05-0030): Dispatching requeue to an interface primitive
8662 -- marked by pragma Implemented (XXX, By_Protected_Procedure). The requeue
8663 -- statement is replaced by a dispatching call with actual parameters taken
8664 -- from the inner-most accept statement or entry body.
8666 -- Target.Primitive (Param1, ..., ParamN);
8668 -- Ada 2012 (AI05-0030): Dispatching requeue to an interface primitive
8669 -- marked by pragma Implemented (XXX, By_Any) or not marked at all.
8672 -- S : constant Offset_Index :=
8673 -- Get_Offset_Index (Tag (Concval), DT_Position (Ename));
8674 -- C : constant Prim_Op_Kind := Get_Prim_Op_Kind (Tag (Concval), S);
8677 -- if C = POK_Protected_Entry
8678 -- or else C = POK_Task_Entry
8680 -- <statements for dispatching requeue>
8682 -- elsif C = POK_Protected_Procedure then
8683 -- <dispatching call equivalent>
8686 -- raise Program_Error;
8690 procedure Expand_N_Requeue_Statement (N : Node_Id) is
8691 Loc : constant Source_Ptr := Sloc (N);
8692 Conc_Typ : Entity_Id;
8696 Old_Typ : Entity_Id;
8698 function Build_Dispatching_Call_Equivalent return Node_Id;
8699 -- Ada 2012 (AI05-0030): N denotes a dispatching requeue statement of
8700 -- the form Concval.Ename. It is statically known that Ename is allowed
8701 -- to be implemented by a protected procedure. Create a dispatching call
8702 -- equivalent of Concval.Ename taking the actual parameters from the
8703 -- inner-most accept statement or entry body.
8705 function Build_Dispatching_Requeue return Node_Id;
8706 -- Ada 2012 (AI05-0030): N denotes a dispatching requeue statement of
8707 -- the form Concval.Ename. It is statically known that Ename is allowed
8708 -- to be implemented by a protected or a task entry. Create a call to
8709 -- primitive _Disp_Requeue which handles the low-level actions.
8711 function Build_Dispatching_Requeue_To_Any return Node_Id;
8712 -- Ada 2012 (AI05-0030): N denotes a dispatching requeue statement of
8713 -- the form Concval.Ename. Ename is either marked by pragma Implemented
8714 -- (XXX, By_Any) or not marked at all. Create a block which determines
8715 -- at runtime whether Ename denotes an entry or a procedure and perform
8716 -- the appropriate kind of dispatching select.
8718 function Build_Normal_Requeue return Node_Id;
8719 -- N denotes a non-dispatching requeue statement to either a task or a
8720 -- protected entry. Build the appropriate runtime call to perform the
8723 function Build_Skip_Statement (Search : Node_Id) return Node_Id;
8724 -- For a protected entry, create a return statement to skip the rest of
8725 -- the entry body. Otherwise, create a goto statement to skip the rest
8726 -- of a task accept statement. The lookup for the enclosing entry body
8727 -- or accept statement starts from Search.
8729 ---------------------------------------
8730 -- Build_Dispatching_Call_Equivalent --
8731 ---------------------------------------
8733 function Build_Dispatching_Call_Equivalent return Node_Id is
8734 Call_Ent : constant Entity_Id := Entity (Ename);
8735 Obj : constant Node_Id := Original_Node (Concval);
8742 -- Climb the parent chain looking for the inner-most entry body or
8743 -- accept statement.
8746 while Present (Acc_Ent)
8747 and then not Nkind_In (Acc_Ent, N_Accept_Statement,
8750 Acc_Ent := Parent (Acc_Ent);
8753 -- A requeue statement should be housed inside an entry body or an
8754 -- accept statement at some level. If this is not the case, then the
8755 -- tree is malformed.
8757 pragma Assert (Present (Acc_Ent));
8759 -- Recover the list of formal parameters
8761 if Nkind (Acc_Ent) = N_Entry_Body then
8762 Acc_Ent := Entry_Body_Formal_Part (Acc_Ent);
8765 Formals := Parameter_Specifications (Acc_Ent);
8767 -- Create the actual parameters for the dispatching call. These are
8768 -- simply copies of the entry body or accept statement formals in the
8769 -- same order as they appear.
8773 if Present (Formals) then
8774 Actuals := New_List;
8775 Formal := First (Formals);
8776 while Present (Formal) loop
8778 Make_Identifier (Loc, Chars (Defining_Identifier (Formal))));
8784 -- Obj.Call_Ent (Actuals);
8787 Make_Procedure_Call_Statement (Loc,
8789 Make_Selected_Component (Loc,
8790 Prefix => Make_Identifier (Loc, Chars (Obj)),
8791 Selector_Name => Make_Identifier (Loc, Chars (Call_Ent))),
8793 Parameter_Associations => Actuals);
8794 end Build_Dispatching_Call_Equivalent;
8796 -------------------------------
8797 -- Build_Dispatching_Requeue --
8798 -------------------------------
8800 function Build_Dispatching_Requeue return Node_Id is
8801 Params : constant List_Id := New_List;
8804 -- Process the "with abort" parameter
8807 New_Reference_To (Boolean_Literals (Abort_Present (N)), Loc));
8809 -- Process the entry wrapper's position in the primary dispatch
8810 -- table parameter. Generate:
8812 -- Ada.Tags.Get_Offset_Index
8813 -- (Ada.Tags.Tag (Concval),
8814 -- <interface dispatch table position of Ename>)
8816 if Tagged_Type_Expansion then
8818 Make_Function_Call (Loc,
8819 Name => New_Reference_To (RTE (RE_Get_Offset_Index), Loc),
8820 Parameter_Associations => New_List (
8821 Unchecked_Convert_To (RTE (RE_Tag), Concval),
8822 Make_Integer_Literal (Loc, DT_Position (Entity (Ename))))));
8828 Make_Function_Call (Loc,
8829 Name => New_Reference_To (RTE (RE_Get_Offset_Index), Loc),
8831 Parameter_Associations => New_List (
8835 Make_Attribute_Reference (Loc,
8837 Attribute_Name => Name_Tag),
8841 Make_Attribute_Reference (Loc,
8842 Prefix => New_Reference_To (Etype (Concval), Loc),
8843 Attribute_Name => Name_Tag),
8847 Make_Integer_Literal (Loc, DT_Position (Entity (Ename))))));
8850 -- Specific actuals for protected to XXX requeue
8852 if Is_Protected_Type (Old_Typ) then
8854 Make_Attribute_Reference (Loc, -- _object'Address
8856 Concurrent_Ref (New_Occurrence_Of (Old_Typ, Loc)),
8857 Attribute_Name => Name_Address));
8859 Prepend_To (Params, -- True
8860 New_Reference_To (Standard_True, Loc));
8862 -- Specific actuals for task to XXX requeue
8865 pragma Assert (Is_Task_Type (Old_Typ));
8867 Prepend_To (Params, -- null
8868 New_Reference_To (RTE (RE_Null_Address), Loc));
8870 Prepend_To (Params, -- False
8871 New_Reference_To (Standard_False, Loc));
8874 -- Add the object parameter
8876 Prepend_To (Params, New_Copy_Tree (Concval));
8879 -- _Disp_Requeue (<Params>);
8882 Make_Procedure_Call_Statement (Loc,
8883 Name => Make_Identifier (Loc, Name_uDisp_Requeue),
8884 Parameter_Associations => Params);
8885 end Build_Dispatching_Requeue;
8887 --------------------------------------
8888 -- Build_Dispatching_Requeue_To_Any --
8889 --------------------------------------
8891 function Build_Dispatching_Requeue_To_Any return Node_Id is
8892 Call_Ent : constant Entity_Id := Entity (Ename);
8893 Obj : constant Node_Id := Original_Node (Concval);
8894 Skip : constant Node_Id := Build_Skip_Statement (N);
8904 -- Dispatch table slot processing, generate:
8907 S := Build_S (Loc, Decls);
8909 -- Call kind processing, generate:
8910 -- C : Ada.Tags.Prim_Op_Kind;
8912 C := Build_C (Loc, Decls);
8915 -- S := Ada.Tags.Get_Offset_Index
8916 -- (Ada.Tags.Tag (Obj), DT_Position (Call_Ent));
8918 Append_To (Stmts, Build_S_Assignment (Loc, S, Obj, Call_Ent));
8921 -- _Disp_Get_Prim_Op_Kind (Obj, S, C);
8924 Make_Procedure_Call_Statement (Loc,
8927 Find_Prim_Op (Etype (Etype (Obj)),
8928 Name_uDisp_Get_Prim_Op_Kind),
8930 Parameter_Associations => New_List (
8931 New_Copy_Tree (Obj),
8932 New_Reference_To (S, Loc),
8933 New_Reference_To (C, Loc))));
8937 -- if C = POK_Protected_Entry
8938 -- or else C = POK_Task_Entry
8941 Make_If_Statement (Loc,
8947 New_Reference_To (C, Loc),
8949 New_Reference_To (RTE (RE_POK_Protected_Entry), Loc)),
8954 New_Reference_To (C, Loc),
8956 New_Reference_To (RTE (RE_POK_Task_Entry), Loc))),
8958 -- Dispatching requeue equivalent
8960 Then_Statements => New_List (
8961 Build_Dispatching_Requeue,
8964 -- elsif C = POK_Protected_Procedure then
8966 Elsif_Parts => New_List (
8967 Make_Elsif_Part (Loc,
8971 New_Reference_To (C, Loc),
8974 RTE (RE_POK_Protected_Procedure), Loc)),
8976 -- Dispatching call equivalent
8978 Then_Statements => New_List (
8979 Build_Dispatching_Call_Equivalent))),
8982 -- raise Program_Error;
8985 Else_Statements => New_List (
8986 Make_Raise_Program_Error (Loc,
8987 Reason => PE_Explicit_Raise))));
8989 -- Wrap everything into a block
8992 Make_Block_Statement (Loc,
8993 Declarations => Decls,
8994 Handled_Statement_Sequence =>
8995 Make_Handled_Sequence_Of_Statements (Loc,
8996 Statements => Stmts));
8997 end Build_Dispatching_Requeue_To_Any;
8999 --------------------------
9000 -- Build_Normal_Requeue --
9001 --------------------------
9003 function Build_Normal_Requeue return Node_Id is
9004 Params : constant List_Id := New_List;
9009 -- Process the "with abort" parameter
9012 New_Reference_To (Boolean_Literals (Abort_Present (N)), Loc));
9014 -- Add the index expression to the parameters. It is common among all
9018 Entry_Index_Expression (Loc, Entity (Ename), Index, Conc_Typ));
9020 if Is_Protected_Type (Old_Typ) then
9022 Self_Param : Node_Id;
9026 Make_Attribute_Reference (Loc,
9028 Concurrent_Ref (New_Occurrence_Of (Old_Typ, Loc)),
9030 Name_Unchecked_Access);
9032 -- Protected to protected requeue
9034 if Is_Protected_Type (Conc_Typ) then
9037 RTE (RE_Requeue_Protected_Entry), Loc);
9040 Make_Attribute_Reference (Loc,
9042 Concurrent_Ref (Concval),
9044 Name_Unchecked_Access);
9046 -- Protected to task requeue
9048 else pragma Assert (Is_Task_Type (Conc_Typ));
9051 RTE (RE_Requeue_Protected_To_Task_Entry), Loc);
9053 Param := Concurrent_Ref (Concval);
9056 Prepend_To (Params, Param);
9057 Prepend_To (Params, Self_Param);
9060 else pragma Assert (Is_Task_Type (Old_Typ));
9062 -- Task to protected requeue
9064 if Is_Protected_Type (Conc_Typ) then
9067 RTE (RE_Requeue_Task_To_Protected_Entry), Loc);
9070 Make_Attribute_Reference (Loc,
9072 Concurrent_Ref (Concval),
9074 Name_Unchecked_Access);
9076 -- Task to task requeue
9078 else pragma Assert (Is_Task_Type (Conc_Typ));
9080 New_Reference_To (RTE (RE_Requeue_Task_Entry), Loc);
9082 Param := Concurrent_Ref (Concval);
9085 Prepend_To (Params, Param);
9089 Make_Procedure_Call_Statement (Loc,
9091 Parameter_Associations => Params);
9092 end Build_Normal_Requeue;
9094 --------------------------
9095 -- Build_Skip_Statement --
9096 --------------------------
9098 function Build_Skip_Statement (Search : Node_Id) return Node_Id is
9099 Skip_Stmt : Node_Id;
9102 -- Build a return statement to skip the rest of the entire body
9104 if Is_Protected_Type (Old_Typ) then
9105 Skip_Stmt := Make_Simple_Return_Statement (Loc);
9107 -- If the requeue is within a task, find the end label of the
9108 -- enclosing accept statement and create a goto statement to it.
9116 -- Climb the parent chain looking for the enclosing accept
9119 Acc := Parent (Search);
9121 and then Nkind (Acc) /= N_Accept_Statement
9123 Acc := Parent (Acc);
9126 -- The last statement is the second label used for completing
9127 -- the rendezvous the usual way. The label we are looking for
9128 -- is right before it.
9131 Prev (Last (Statements (Handled_Statement_Sequence (Acc))));
9133 pragma Assert (Nkind (Label) = N_Label);
9135 -- Generate a goto statement to skip the rest of the accept
9138 Make_Goto_Statement (Loc,
9140 New_Occurrence_Of (Entity (Identifier (Label)), Loc));
9144 Set_Analyzed (Skip_Stmt);
9147 end Build_Skip_Statement;
9149 -- Start of processing for Expand_N_Requeue_Statement
9152 -- Extract the components of the entry call
9154 Extract_Entry (N, Concval, Ename, Index);
9155 Conc_Typ := Etype (Concval);
9157 -- Examine the scope stack in order to find nearest enclosing protected
9158 -- or task type. This will constitute our invocation source.
9160 Old_Typ := Current_Scope;
9161 while Present (Old_Typ)
9162 and then not Is_Protected_Type (Old_Typ)
9163 and then not Is_Task_Type (Old_Typ)
9165 Old_Typ := Scope (Old_Typ);
9168 -- Ada 2012 (AI05-0030): We have a dispatching requeue of the form
9169 -- Concval.Ename where the type of Concval is class-wide concurrent
9172 if Ada_Version >= Ada_2012
9173 and then Present (Concval)
9174 and then Is_Class_Wide_Type (Conc_Typ)
9175 and then Is_Concurrent_Interface (Conc_Typ)
9178 Has_Impl : Boolean := False;
9179 Impl_Kind : Name_Id := No_Name;
9182 -- Check whether the Ename is flagged by pragma Implemented
9184 if Has_Rep_Pragma (Entity (Ename), Name_Implemented) then
9186 Impl_Kind := Implementation_Kind (Entity (Ename));
9189 -- The procedure_or_entry_NAME is guaranteed to be overridden by
9190 -- an entry. Create a call to predefined primitive _Disp_Requeue.
9193 and then Impl_Kind = Name_By_Entry
9195 Rewrite (N, Build_Dispatching_Requeue);
9197 Insert_After (N, Build_Skip_Statement (N));
9199 -- The procedure_or_entry_NAME is guaranteed to be overridden by
9200 -- a protected procedure. In this case the requeue is transformed
9201 -- into a dispatching call.
9204 and then Impl_Kind = Name_By_Protected_Procedure
9206 Rewrite (N, Build_Dispatching_Call_Equivalent);
9209 -- The procedure_or_entry_NAME's implementation kind is either
9210 -- By_Any or pragma Implemented was not applied at all. In this
9211 -- case a runtime test determines whether Ename denotes an entry
9212 -- or a protected procedure and performs the appropriate call.
9215 Rewrite (N, Build_Dispatching_Requeue_To_Any);
9220 -- Processing for regular (non-dispatching) requeues
9223 Rewrite (N, Build_Normal_Requeue);
9225 Insert_After (N, Build_Skip_Statement (N));
9227 end Expand_N_Requeue_Statement;
9229 -------------------------------
9230 -- Expand_N_Selective_Accept --
9231 -------------------------------
9233 procedure Expand_N_Selective_Accept (N : Node_Id) is
9234 Loc : constant Source_Ptr := Sloc (N);
9235 Alts : constant List_Id := Select_Alternatives (N);
9237 -- Note: in the below declarations a lot of new lists are allocated
9238 -- unconditionally which may well not end up being used. That's
9239 -- not a good idea since it wastes space gratuitously ???
9241 Accept_Case : List_Id;
9242 Accept_List : constant List_Id := New_List;
9245 Alt_List : constant List_Id := New_List;
9246 Alt_Stats : List_Id;
9247 Ann : Entity_Id := Empty;
9250 Check_Guard : Boolean := True;
9252 Decls : constant List_Id := New_List;
9253 Stats : constant List_Id := New_List;
9254 Body_List : constant List_Id := New_List;
9255 Trailing_List : constant List_Id := New_List;
9258 Else_Present : Boolean := False;
9259 Terminate_Alt : Node_Id := Empty;
9260 Select_Mode : Node_Id;
9262 Delay_Case : List_Id;
9263 Delay_Count : Integer := 0;
9264 Delay_Val : Entity_Id;
9265 Delay_Index : Entity_Id;
9266 Delay_Min : Entity_Id;
9267 Delay_Num : Int := 1;
9268 Delay_Alt_List : List_Id := New_List;
9269 Delay_List : constant List_Id := New_List;
9273 First_Delay : Boolean := True;
9274 Guard_Open : Entity_Id;
9280 Num_Accept : Nat := 0;
9283 Time_Type : Entity_Id;
9285 Select_Call : Node_Id;
9287 Qnam : constant Entity_Id :=
9288 Make_Defining_Identifier (Loc, New_External_Name ('S', 0));
9290 Xnam : constant Entity_Id :=
9291 Make_Defining_Identifier (Loc, New_External_Name ('J', 1));
9293 -----------------------
9294 -- Local subprograms --
9295 -----------------------
9297 function Accept_Or_Raise return List_Id;
9298 -- For the rare case where delay alternatives all have guards, and
9299 -- all of them are closed, it is still possible that there were open
9300 -- accept alternatives with no callers. We must reexamine the
9301 -- Accept_List, and execute a selective wait with no else if some
9302 -- accept is open. If none, we raise program_error.
9304 procedure Add_Accept (Alt : Node_Id);
9305 -- Process a single accept statement in a select alternative. Build
9306 -- procedure for body of accept, and add entry to dispatch table with
9307 -- expression for guard, in preparation for call to run time select.
9309 function Make_And_Declare_Label (Num : Int) return Node_Id;
9310 -- Manufacture a label using Num as a serial number and declare it.
9311 -- The declaration is appended to Decls. The label marks the trailing
9312 -- statements of an accept or delay alternative.
9314 function Make_Select_Call (Select_Mode : Entity_Id) return Node_Id;
9315 -- Build call to Selective_Wait runtime routine
9317 procedure Process_Delay_Alternative (Alt : Node_Id; Index : Int);
9318 -- Add code to compare value of delay with previous values, and
9319 -- generate case entry for trailing statements.
9321 procedure Process_Accept_Alternative
9325 -- Add code to call corresponding procedure, and branch to
9326 -- trailing statements, if any.
9328 ---------------------
9329 -- Accept_Or_Raise --
9330 ---------------------
9332 function Accept_Or_Raise return List_Id is
9335 J : constant Entity_Id := Make_Temporary (Loc, 'J');
9338 -- We generate the following:
9340 -- for J in q'range loop
9341 -- if q(J).S /=null_task_entry then
9342 -- selective_wait (simple_mode,...);
9348 -- if no rendez_vous then
9349 -- raise program_error;
9352 -- Note that the code needs to know that the selector name
9353 -- in an Accept_Alternative is named S.
9355 Cond := Make_Op_Ne (Loc,
9357 Make_Selected_Component (Loc,
9359 Make_Indexed_Component (Loc,
9360 Prefix => New_Reference_To (Qnam, Loc),
9361 Expressions => New_List (New_Reference_To (J, Loc))),
9362 Selector_Name => Make_Identifier (Loc, Name_S)),
9364 New_Reference_To (RTE (RE_Null_Task_Entry), Loc));
9367 Make_Implicit_Loop_Statement (N,
9368 Identifier => Empty,
9370 Make_Iteration_Scheme (Loc,
9371 Loop_Parameter_Specification =>
9372 Make_Loop_Parameter_Specification (Loc,
9373 Defining_Identifier => J,
9374 Discrete_Subtype_Definition =>
9375 Make_Attribute_Reference (Loc,
9376 Prefix => New_Reference_To (Qnam, Loc),
9377 Attribute_Name => Name_Range,
9378 Expressions => New_List (
9379 Make_Integer_Literal (Loc, 1))))),
9381 Statements => New_List (
9382 Make_Implicit_If_Statement (N,
9384 Then_Statements => New_List (
9386 New_Reference_To (RTE (RE_Simple_Mode), Loc)),
9387 Make_Exit_Statement (Loc))))));
9390 Make_Raise_Program_Error (Loc,
9391 Condition => Make_Op_Eq (Loc,
9392 Left_Opnd => New_Reference_To (Xnam, Loc),
9394 New_Reference_To (RTE (RE_No_Rendezvous), Loc)),
9395 Reason => PE_All_Guards_Closed));
9398 end Accept_Or_Raise;
9404 procedure Add_Accept (Alt : Node_Id) is
9405 Acc_Stm : constant Node_Id := Accept_Statement (Alt);
9406 Ename : constant Node_Id := Entry_Direct_Name (Acc_Stm);
9407 Eloc : constant Source_Ptr := Sloc (Ename);
9408 Eent : constant Entity_Id := Entity (Ename);
9409 Index : constant Node_Id := Entry_Index (Acc_Stm);
9410 Null_Body : Node_Id;
9411 Proc_Body : Node_Id;
9418 Ann := Node (Last_Elmt (Accept_Address (Eent)));
9421 if Present (Condition (Alt)) then
9423 Make_Conditional_Expression (Eloc, New_List (
9425 Entry_Index_Expression (Eloc, Eent, Index, Scope (Eent)),
9426 New_Reference_To (RTE (RE_Null_Task_Entry), Eloc)));
9429 Entry_Index_Expression
9430 (Eloc, Eent, Index, Scope (Eent));
9433 if Present (Handled_Statement_Sequence (Accept_Statement (Alt))) then
9434 Null_Body := New_Reference_To (Standard_False, Eloc);
9436 if Abort_Allowed then
9437 Call := Make_Procedure_Call_Statement (Eloc,
9438 Name => New_Reference_To (RTE (RE_Abort_Undefer), Eloc));
9439 Insert_Before (First (Statements (Handled_Statement_Sequence (
9440 Accept_Statement (Alt)))), Call);
9445 Make_Defining_Identifier (Eloc,
9446 New_External_Name (Chars (Ename), 'A', Num_Accept));
9448 if Comes_From_Source (Alt) then
9449 Set_Debug_Info_Needed (PB_Ent);
9453 Make_Subprogram_Body (Eloc,
9455 Make_Procedure_Specification (Eloc,
9456 Defining_Unit_Name => PB_Ent),
9457 Declarations => Declarations (Acc_Stm),
9458 Handled_Statement_Sequence =>
9459 Build_Accept_Body (Accept_Statement (Alt)));
9461 -- During the analysis of the body of the accept statement, any
9462 -- zero cost exception handler records were collected in the
9463 -- Accept_Handler_Records field of the N_Accept_Alternative node.
9464 -- This is where we move them to where they belong, namely the
9465 -- newly created procedure.
9467 Set_Handler_Records (PB_Ent, Accept_Handler_Records (Alt));
9468 Append (Proc_Body, Body_List);
9471 Null_Body := New_Reference_To (Standard_True, Eloc);
9473 -- if accept statement has declarations, insert above, given that
9474 -- we are not creating a body for the accept.
9476 if Present (Declarations (Acc_Stm)) then
9477 Insert_Actions (N, Declarations (Acc_Stm));
9481 Append_To (Accept_List,
9482 Make_Aggregate (Eloc, Expressions => New_List (Null_Body, Expr)));
9484 Num_Accept := Num_Accept + 1;
9487 ----------------------------
9488 -- Make_And_Declare_Label --
9489 ----------------------------
9491 function Make_And_Declare_Label (Num : Int) return Node_Id is
9495 Lab_Id := Make_Identifier (Loc, New_External_Name ('L', Num));
9497 Make_Label (Loc, Lab_Id);
9500 Make_Implicit_Label_Declaration (Loc,
9501 Defining_Identifier =>
9502 Make_Defining_Identifier (Loc, Chars (Lab_Id)),
9503 Label_Construct => Lab));
9506 end Make_And_Declare_Label;
9508 ----------------------
9509 -- Make_Select_Call --
9510 ----------------------
9512 function Make_Select_Call (Select_Mode : Entity_Id) return Node_Id is
9513 Params : constant List_Id := New_List;
9517 Make_Attribute_Reference (Loc,
9518 Prefix => New_Reference_To (Qnam, Loc),
9519 Attribute_Name => Name_Unchecked_Access),
9521 Append (Select_Mode, Params);
9522 Append (New_Reference_To (Ann, Loc), Params);
9523 Append (New_Reference_To (Xnam, Loc), Params);
9526 Make_Procedure_Call_Statement (Loc,
9527 Name => New_Reference_To (RTE (RE_Selective_Wait), Loc),
9528 Parameter_Associations => Params);
9529 end Make_Select_Call;
9531 --------------------------------
9532 -- Process_Accept_Alternative --
9533 --------------------------------
9535 procedure Process_Accept_Alternative
9540 Choices : List_Id := No_List;
9541 Alt_Stats : List_Id;
9544 Adjust_Condition (Condition (Alt));
9545 Alt_Stats := No_List;
9547 if Present (Handled_Statement_Sequence (Accept_Statement (Alt))) then
9548 Choices := New_List (
9549 Make_Integer_Literal (Loc, Index));
9551 Alt_Stats := New_List (
9552 Make_Procedure_Call_Statement (Sloc (Proc),
9553 Name => New_Reference_To (
9554 Defining_Unit_Name (Specification (Proc)), Sloc (Proc))));
9557 if Statements (Alt) /= Empty_List then
9559 if No (Alt_Stats) then
9561 -- Accept with no body, followed by trailing statements
9563 Choices := New_List (
9564 Make_Integer_Literal (Loc, Index));
9566 Alt_Stats := New_List;
9569 -- After the call, if any, branch to trailing statements. We
9570 -- create a label for each, as well as the corresponding label
9573 Lab := Make_And_Declare_Label (Index);
9574 Append_To (Alt_Stats,
9575 Make_Goto_Statement (Loc,
9576 Name => New_Copy (Identifier (Lab))));
9578 Append (Lab, Trailing_List);
9579 Append_List (Statements (Alt), Trailing_List);
9580 Append_To (Trailing_List,
9581 Make_Goto_Statement (Loc,
9582 Name => New_Copy (Identifier (End_Lab))));
9585 if Present (Alt_Stats) then
9587 -- Procedure call. and/or trailing statements
9589 Append_To (Alt_List,
9590 Make_Case_Statement_Alternative (Loc,
9591 Discrete_Choices => Choices,
9592 Statements => Alt_Stats));
9594 end Process_Accept_Alternative;
9596 -------------------------------
9597 -- Process_Delay_Alternative --
9598 -------------------------------
9600 procedure Process_Delay_Alternative (Alt : Node_Id; Index : Int) is
9603 Delay_Alt : List_Id;
9606 -- Deal with C/Fortran boolean as delay condition
9608 Adjust_Condition (Condition (Alt));
9610 -- Determine the smallest specified delay
9612 -- for each delay alternative generate:
9614 -- if guard-expression then
9615 -- Delay_Val := delay-expression;
9616 -- Guard_Open := True;
9617 -- if Delay_Val < Delay_Min then
9618 -- Delay_Min := Delay_Val;
9619 -- Delay_Index := Index;
9623 -- The enclosing if-statement is omitted if there is no guard
9628 First_Delay := False;
9630 Delay_Alt := New_List (
9631 Make_Assignment_Statement (Loc,
9632 Name => New_Reference_To (Delay_Min, Loc),
9633 Expression => Expression (Delay_Statement (Alt))));
9635 if Delay_Count > 1 then
9636 Append_To (Delay_Alt,
9637 Make_Assignment_Statement (Loc,
9638 Name => New_Reference_To (Delay_Index, Loc),
9639 Expression => Make_Integer_Literal (Loc, Index)));
9643 Delay_Alt := New_List (
9644 Make_Assignment_Statement (Loc,
9645 Name => New_Reference_To (Delay_Val, Loc),
9646 Expression => Expression (Delay_Statement (Alt))));
9648 if Time_Type = Standard_Duration then
9651 Left_Opnd => New_Reference_To (Delay_Val, Loc),
9652 Right_Opnd => New_Reference_To (Delay_Min, Loc));
9655 -- The scope of the time type must define a comparison
9656 -- operator. The scope itself may not be visible, so we
9657 -- construct a node with entity information to insure that
9658 -- semantic analysis can find the proper operator.
9661 Make_Function_Call (Loc,
9662 Name => Make_Selected_Component (Loc,
9663 Prefix => New_Reference_To (Scope (Time_Type), Loc),
9665 Make_Operator_Symbol (Loc,
9666 Chars => Name_Op_Lt,
9667 Strval => No_String)),
9668 Parameter_Associations =>
9670 New_Reference_To (Delay_Val, Loc),
9671 New_Reference_To (Delay_Min, Loc)));
9673 Set_Entity (Prefix (Name (Cond)), Scope (Time_Type));
9676 Append_To (Delay_Alt,
9677 Make_Implicit_If_Statement (N,
9679 Then_Statements => New_List (
9680 Make_Assignment_Statement (Loc,
9681 Name => New_Reference_To (Delay_Min, Loc),
9682 Expression => New_Reference_To (Delay_Val, Loc)),
9684 Make_Assignment_Statement (Loc,
9685 Name => New_Reference_To (Delay_Index, Loc),
9686 Expression => Make_Integer_Literal (Loc, Index)))));
9690 Append_To (Delay_Alt,
9691 Make_Assignment_Statement (Loc,
9692 Name => New_Reference_To (Guard_Open, Loc),
9693 Expression => New_Reference_To (Standard_True, Loc)));
9696 if Present (Condition (Alt)) then
9697 Delay_Alt := New_List (
9698 Make_Implicit_If_Statement (N,
9699 Condition => Condition (Alt),
9700 Then_Statements => Delay_Alt));
9703 Append_List (Delay_Alt, Delay_List);
9705 -- If the delay alternative has a statement part, add choice to the
9706 -- case statements for delays.
9708 if Present (Statements (Alt)) then
9710 if Delay_Count = 1 then
9711 Append_List (Statements (Alt), Delay_Alt_List);
9714 Choices := New_List (
9715 Make_Integer_Literal (Loc, Index));
9717 Append_To (Delay_Alt_List,
9718 Make_Case_Statement_Alternative (Loc,
9719 Discrete_Choices => Choices,
9720 Statements => Statements (Alt)));
9723 elsif Delay_Count = 1 then
9725 -- If the single delay has no trailing statements, add a branch
9726 -- to the exit label to the selective wait.
9728 Delay_Alt_List := New_List (
9729 Make_Goto_Statement (Loc,
9730 Name => New_Copy (Identifier (End_Lab))));
9733 end Process_Delay_Alternative;
9735 -- Start of processing for Expand_N_Selective_Accept
9738 Process_Statements_For_Controlled_Objects (N);
9740 -- First insert some declarations before the select. The first is:
9744 -- This variable holds the parameters passed to the accept body. This
9745 -- declaration has already been inserted by the time we get here by
9746 -- a call to Expand_Accept_Declarations made from the semantics when
9747 -- processing the first accept statement contained in the select. We
9748 -- can find this entity as Accept_Address (E), where E is any of the
9749 -- entries references by contained accept statements.
9751 -- The first step is to scan the list of Selective_Accept_Statements
9752 -- to find this entity, and also count the number of accepts, and
9753 -- determine if terminated, delay or else is present:
9757 Alt := First (Alts);
9758 while Present (Alt) loop
9759 Process_Statements_For_Controlled_Objects (Alt);
9761 if Nkind (Alt) = N_Accept_Alternative then
9764 elsif Nkind (Alt) = N_Delay_Alternative then
9765 Delay_Count := Delay_Count + 1;
9767 -- If the delays are relative delays, the delay expressions have
9768 -- type Standard_Duration. Otherwise they must have some time type
9769 -- recognized by GNAT.
9771 if Nkind (Delay_Statement (Alt)) = N_Delay_Relative_Statement then
9772 Time_Type := Standard_Duration;
9774 Time_Type := Etype (Expression (Delay_Statement (Alt)));
9776 if Is_RTE (Base_Type (Etype (Time_Type)), RO_CA_Time)
9777 or else Is_RTE (Base_Type (Etype (Time_Type)), RO_RT_Time)
9782 "& is not a time type (RM 9.6(6))",
9783 Expression (Delay_Statement (Alt)), Time_Type);
9784 Time_Type := Standard_Duration;
9785 Set_Etype (Expression (Delay_Statement (Alt)), Any_Type);
9789 if No (Condition (Alt)) then
9791 -- This guard will always be open
9793 Check_Guard := False;
9796 elsif Nkind (Alt) = N_Terminate_Alternative then
9797 Adjust_Condition (Condition (Alt));
9798 Terminate_Alt := Alt;
9801 Num_Alts := Num_Alts + 1;
9805 Else_Present := Present (Else_Statements (N));
9807 -- At the same time (see procedure Add_Accept) we build the accept list:
9809 -- Qnn : Accept_List (1 .. num-select) := (
9810 -- (null-body, entry-index),
9811 -- (null-body, entry-index),
9813 -- (null_body, entry-index));
9815 -- In the above declaration, null-body is True if the corresponding
9816 -- accept has no body, and false otherwise. The entry is either the
9817 -- entry index expression if there is no guard, or if a guard is
9818 -- present, then a conditional expression of the form:
9820 -- (if guard then entry-index else Null_Task_Entry)
9822 -- If a guard is statically known to be false, the entry can simply
9823 -- be omitted from the accept list.
9826 Make_Object_Declaration (Loc,
9827 Defining_Identifier => Qnam,
9828 Object_Definition =>
9829 New_Reference_To (RTE (RE_Accept_List), Loc),
9830 Aliased_Present => True,
9833 Make_Qualified_Expression (Loc,
9835 New_Reference_To (RTE (RE_Accept_List), Loc),
9837 Make_Aggregate (Loc, Expressions => Accept_List)));
9841 -- Then we declare the variable that holds the index for the accept
9842 -- that will be selected for service:
9844 -- Xnn : Select_Index;
9847 Make_Object_Declaration (Loc,
9848 Defining_Identifier => Xnam,
9849 Object_Definition =>
9850 New_Reference_To (RTE (RE_Select_Index), Loc),
9852 New_Reference_To (RTE (RE_No_Rendezvous), Loc));
9856 -- After this follow procedure declarations for each accept body
9863 -- where the ... are statements from the corresponding procedure body.
9864 -- No parameters are involved, since the parameters are passed via Ann
9865 -- and the parameter references have already been expanded to be direct
9866 -- references to Ann (see Exp_Ch2.Expand_Entry_Parameter). Furthermore,
9867 -- any embedded tasking statements (which would normally be illegal in
9868 -- procedures), have been converted to calls to the tasking runtime so
9869 -- there is no problem in putting them into procedures.
9871 -- The original accept statement has been expanded into a block in
9872 -- the same fashion as for simple accepts (see Build_Accept_Body).
9874 -- Note: we don't really need to build these procedures for the case
9875 -- where no delay statement is present, but it is just as easy to
9876 -- build them unconditionally, and not significantly inefficient,
9877 -- since if they are short they will be inlined anyway.
9879 -- The procedure declarations have been assembled in Body_List
9881 -- If delays are present, we must compute the required delay.
9882 -- We first generate the declarations:
9884 -- Delay_Index : Boolean := 0;
9885 -- Delay_Min : Some_Time_Type.Time;
9886 -- Delay_Val : Some_Time_Type.Time;
9888 -- Delay_Index will be set to the index of the minimum delay, i.e. the
9889 -- active delay that is actually chosen as the basis for the possible
9890 -- delay if an immediate rendez-vous is not possible.
9892 -- In the most common case there is a single delay statement, and this
9893 -- is handled specially.
9895 if Delay_Count > 0 then
9897 -- Generate the required declarations
9900 Make_Defining_Identifier (Loc, New_External_Name ('D', 1));
9902 Make_Defining_Identifier (Loc, New_External_Name ('D', 2));
9904 Make_Defining_Identifier (Loc, New_External_Name ('D', 3));
9907 Make_Object_Declaration (Loc,
9908 Defining_Identifier => Delay_Val,
9909 Object_Definition => New_Reference_To (Time_Type, Loc)));
9912 Make_Object_Declaration (Loc,
9913 Defining_Identifier => Delay_Index,
9914 Object_Definition => New_Reference_To (Standard_Integer, Loc),
9915 Expression => Make_Integer_Literal (Loc, 0)));
9918 Make_Object_Declaration (Loc,
9919 Defining_Identifier => Delay_Min,
9920 Object_Definition => New_Reference_To (Time_Type, Loc),
9922 Unchecked_Convert_To (Time_Type,
9923 Make_Attribute_Reference (Loc,
9925 New_Occurrence_Of (Underlying_Type (Time_Type), Loc),
9926 Attribute_Name => Name_Last))));
9928 -- Create Duration and Delay_Mode objects used for passing a delay
9931 D := Make_Temporary (Loc, 'D');
9932 M := Make_Temporary (Loc, 'M');
9938 -- Note that these values are defined in s-osprim.ads and must
9941 -- Relative : constant := 0;
9942 -- Absolute_Calendar : constant := 1;
9943 -- Absolute_RT : constant := 2;
9945 if Time_Type = Standard_Duration then
9946 Discr := Make_Integer_Literal (Loc, 0);
9948 elsif Is_RTE (Base_Type (Etype (Time_Type)), RO_CA_Time) then
9949 Discr := Make_Integer_Literal (Loc, 1);
9953 (Is_RTE (Base_Type (Etype (Time_Type)), RO_RT_Time));
9954 Discr := Make_Integer_Literal (Loc, 2);
9958 Make_Object_Declaration (Loc,
9959 Defining_Identifier => D,
9960 Object_Definition =>
9961 New_Reference_To (Standard_Duration, Loc)));
9964 Make_Object_Declaration (Loc,
9965 Defining_Identifier => M,
9966 Object_Definition =>
9967 New_Reference_To (Standard_Integer, Loc),
9968 Expression => Discr));
9973 Make_Defining_Identifier (Loc, New_External_Name ('G', 1));
9976 Make_Object_Declaration (Loc,
9977 Defining_Identifier => Guard_Open,
9978 Object_Definition => New_Reference_To (Standard_Boolean, Loc),
9979 Expression => New_Reference_To (Standard_False, Loc)));
9982 -- Delay_Count is zero, don't need M and D set (suppress warning)
9989 if Present (Terminate_Alt) then
9991 -- If the terminate alternative guard is False, use
9992 -- Simple_Mode; otherwise use Terminate_Mode.
9994 if Present (Condition (Terminate_Alt)) then
9995 Select_Mode := Make_Conditional_Expression (Loc,
9996 New_List (Condition (Terminate_Alt),
9997 New_Reference_To (RTE (RE_Terminate_Mode), Loc),
9998 New_Reference_To (RTE (RE_Simple_Mode), Loc)));
10000 Select_Mode := New_Reference_To (RTE (RE_Terminate_Mode), Loc);
10003 elsif Else_Present or Delay_Count > 0 then
10004 Select_Mode := New_Reference_To (RTE (RE_Else_Mode), Loc);
10007 Select_Mode := New_Reference_To (RTE (RE_Simple_Mode), Loc);
10010 Select_Call := Make_Select_Call (Select_Mode);
10011 Append (Select_Call, Stats);
10013 -- Now generate code to act on the result. There is an entry
10014 -- in this case for each accept statement with a non-null body,
10015 -- followed by a branch to the statements that follow the Accept.
10016 -- In the absence of delay alternatives, we generate:
10019 -- when No_Rendezvous => -- omitted if simple mode
10034 -- Lab0: Else_Statements;
10037 -- Lab1: Trailing_Statements1;
10040 -- Lab2: Trailing_Statements2;
10045 -- Generate label for common exit
10047 End_Lab := Make_And_Declare_Label (Num_Alts + 1);
10049 -- First entry is the default case, when no rendezvous is possible
10051 Choices := New_List (New_Reference_To (RTE (RE_No_Rendezvous), Loc));
10053 if Else_Present then
10055 -- If no rendezvous is possible, the else part is executed
10057 Lab := Make_And_Declare_Label (0);
10058 Alt_Stats := New_List (
10059 Make_Goto_Statement (Loc,
10060 Name => New_Copy (Identifier (Lab))));
10062 Append (Lab, Trailing_List);
10063 Append_List (Else_Statements (N), Trailing_List);
10064 Append_To (Trailing_List,
10065 Make_Goto_Statement (Loc,
10066 Name => New_Copy (Identifier (End_Lab))));
10068 Alt_Stats := New_List (
10069 Make_Goto_Statement (Loc,
10070 Name => New_Copy (Identifier (End_Lab))));
10073 Append_To (Alt_List,
10074 Make_Case_Statement_Alternative (Loc,
10075 Discrete_Choices => Choices,
10076 Statements => Alt_Stats));
10078 -- We make use of the fact that Accept_Index is an integer type, and
10079 -- generate successive literals for entries for each accept. Only those
10080 -- for which there is a body or trailing statements get a case entry.
10082 Alt := First (Select_Alternatives (N));
10083 Proc := First (Body_List);
10084 while Present (Alt) loop
10086 if Nkind (Alt) = N_Accept_Alternative then
10087 Process_Accept_Alternative (Alt, Index, Proc);
10088 Index := Index + 1;
10091 (Handled_Statement_Sequence (Accept_Statement (Alt)))
10096 elsif Nkind (Alt) = N_Delay_Alternative then
10097 Process_Delay_Alternative (Alt, Delay_Num);
10098 Delay_Num := Delay_Num + 1;
10104 -- An others choice is always added to the main case, as well
10105 -- as the delay case (to satisfy the compiler).
10107 Append_To (Alt_List,
10108 Make_Case_Statement_Alternative (Loc,
10109 Discrete_Choices =>
10110 New_List (Make_Others_Choice (Loc)),
10112 New_List (Make_Goto_Statement (Loc,
10113 Name => New_Copy (Identifier (End_Lab))))));
10115 Accept_Case := New_List (
10116 Make_Case_Statement (Loc,
10117 Expression => New_Reference_To (Xnam, Loc),
10118 Alternatives => Alt_List));
10120 Append_List (Trailing_List, Accept_Case);
10121 Append (End_Lab, Accept_Case);
10122 Append_List (Body_List, Decls);
10124 -- Construct case statement for trailing statements of delay
10125 -- alternatives, if there are several of them.
10127 if Delay_Count > 1 then
10128 Append_To (Delay_Alt_List,
10129 Make_Case_Statement_Alternative (Loc,
10130 Discrete_Choices =>
10131 New_List (Make_Others_Choice (Loc)),
10133 New_List (Make_Null_Statement (Loc))));
10135 Delay_Case := New_List (
10136 Make_Case_Statement (Loc,
10137 Expression => New_Reference_To (Delay_Index, Loc),
10138 Alternatives => Delay_Alt_List));
10140 Delay_Case := Delay_Alt_List;
10143 -- If there are no delay alternatives, we append the case statement
10144 -- to the statement list.
10146 if Delay_Count = 0 then
10147 Append_List (Accept_Case, Stats);
10149 -- Delay alternatives present
10152 -- If delay alternatives are present we generate:
10154 -- find minimum delay.
10155 -- DX := minimum delay;
10156 -- M := <delay mode>;
10157 -- Timed_Selective_Wait (Q'Unchecked_Access, Delay_Mode, P,
10160 -- if X = No_Rendezvous then
10161 -- case statement for delay statements.
10163 -- case statement for accept alternatives.
10174 -- The type of the delay expression is known to be legal
10176 if Time_Type = Standard_Duration then
10177 Conv := New_Reference_To (Delay_Min, Loc);
10179 elsif Is_RTE (Base_Type (Etype (Time_Type)), RO_CA_Time) then
10180 Conv := Make_Function_Call (Loc,
10181 New_Reference_To (RTE (RO_CA_To_Duration), Loc),
10182 New_List (New_Reference_To (Delay_Min, Loc)));
10186 (Is_RTE (Base_Type (Etype (Time_Type)), RO_RT_Time));
10188 Conv := Make_Function_Call (Loc,
10189 New_Reference_To (RTE (RO_RT_To_Duration), Loc),
10190 New_List (New_Reference_To (Delay_Min, Loc)));
10193 Stmt := Make_Assignment_Statement (Loc,
10194 Name => New_Reference_To (D, Loc),
10195 Expression => Conv);
10197 -- Change the value for Accept_Modes. (Else_Mode -> Delay_Mode)
10199 Parms := Parameter_Associations (Select_Call);
10200 Parm := First (Parms);
10202 while Present (Parm)
10203 and then Parm /= Select_Mode
10208 pragma Assert (Present (Parm));
10209 Rewrite (Parm, New_Reference_To (RTE (RE_Delay_Mode), Loc));
10212 -- Prepare two new parameters of Duration and Delay_Mode type
10213 -- which represent the value and the mode of the minimum delay.
10216 Insert_After (Parm, New_Reference_To (M, Loc));
10217 Insert_After (Parm, New_Reference_To (D, Loc));
10219 -- Create a call to RTS
10221 Rewrite (Select_Call,
10222 Make_Procedure_Call_Statement (Loc,
10223 Name => New_Reference_To (RTE (RE_Timed_Selective_Wait), Loc),
10224 Parameter_Associations => Parms));
10226 -- This new call should follow the calculation of the minimum
10229 Insert_List_Before (Select_Call, Delay_List);
10231 if Check_Guard then
10233 Make_Implicit_If_Statement (N,
10234 Condition => New_Reference_To (Guard_Open, Loc),
10236 New_List (New_Copy_Tree (Stmt),
10237 New_Copy_Tree (Select_Call)),
10238 Else_Statements => Accept_Or_Raise);
10239 Rewrite (Select_Call, Stmt);
10241 Insert_Before (Select_Call, Stmt);
10245 Make_Implicit_If_Statement (N,
10246 Condition => Make_Op_Eq (Loc,
10247 Left_Opnd => New_Reference_To (Xnam, Loc),
10249 New_Reference_To (RTE (RE_No_Rendezvous), Loc)),
10251 Then_Statements => Delay_Case,
10252 Else_Statements => Accept_Case);
10254 Append (Cases, Stats);
10258 -- Replace accept statement with appropriate block
10261 Make_Block_Statement (Loc,
10262 Declarations => Decls,
10263 Handled_Statement_Sequence =>
10264 Make_Handled_Sequence_Of_Statements (Loc,
10265 Statements => Stats));
10267 Rewrite (N, Block);
10270 -- Note: have to worry more about abort deferral in above code ???
10272 -- Final step is to unstack the Accept_Address entries for all accept
10273 -- statements appearing in accept alternatives in the select statement
10275 Alt := First (Alts);
10276 while Present (Alt) loop
10277 if Nkind (Alt) = N_Accept_Alternative then
10278 Remove_Last_Elmt (Accept_Address
10279 (Entity (Entry_Direct_Name (Accept_Statement (Alt)))));
10284 end Expand_N_Selective_Accept;
10286 --------------------------------------
10287 -- Expand_N_Single_Task_Declaration --
10288 --------------------------------------
10290 -- Single task declarations should never be present after semantic
10291 -- analysis, since we expect them to be replaced by a declaration of an
10292 -- anonymous task type, followed by a declaration of the task object. We
10293 -- include this routine to make sure that is happening!
10295 procedure Expand_N_Single_Task_Declaration (N : Node_Id) is
10297 raise Program_Error;
10298 end Expand_N_Single_Task_Declaration;
10300 ------------------------
10301 -- Expand_N_Task_Body --
10302 ------------------------
10304 -- Given a task body
10306 -- task body tname is
10312 -- This expansion routine converts it into a procedure and sets the
10313 -- elaboration flag for the procedure to true, to represent the fact
10314 -- that the task body is now elaborated:
10316 -- procedure tnameB (_Task : access tnameV) is
10317 -- discriminal : dtype renames _Task.discriminant;
10319 -- procedure _clean is
10321 -- Abort_Defer.all;
10323 -- Abort_Undefer.all;
10328 -- Abort_Undefer.all;
10330 -- System.Task_Stages.Complete_Activation;
10338 -- In addition, if the task body is an activator, then a call to activate
10339 -- tasks is added at the start of the statements, before the call to
10340 -- Complete_Activation, and if in addition the task is a master then it
10341 -- must be established as a master. These calls are inserted and analyzed
10342 -- in Expand_Cleanup_Actions, when the Handled_Sequence_Of_Statements is
10345 -- There is one discriminal declaration line generated for each
10346 -- discriminant that is present to provide an easy reference point for
10347 -- discriminant references inside the body (see Exp_Ch2.Expand_Name).
10349 -- Note on relationship to GNARLI definition. In the GNARLI definition,
10350 -- task body procedures have a profile (Arg : System.Address). That is
10351 -- needed because GNARLI has to use the same access-to-subprogram type
10352 -- for all task types. We depend here on knowing that in GNAT, passing
10353 -- an address argument by value is identical to passing a record value
10354 -- by access (in either case a single pointer is passed), so even though
10355 -- this procedure has the wrong profile. In fact it's all OK, since the
10356 -- callings sequence is identical.
10358 procedure Expand_N_Task_Body (N : Node_Id) is
10359 Loc : constant Source_Ptr := Sloc (N);
10360 Ttyp : constant Entity_Id := Corresponding_Spec (N);
10364 Insert_Nod : Node_Id;
10365 -- Used to determine the proper location of wrapper body insertions
10368 -- Add renaming declarations for discriminals and a declaration for the
10369 -- entry family index (if applicable).
10371 Install_Private_Data_Declarations
10372 (Loc, Task_Body_Procedure (Ttyp), Ttyp, N, Declarations (N));
10374 -- Add a call to Abort_Undefer at the very beginning of the task
10375 -- body since this body is called with abort still deferred.
10377 if Abort_Allowed then
10378 Call := Build_Runtime_Call (Loc, RE_Abort_Undefer);
10380 (First (Statements (Handled_Statement_Sequence (N))), Call);
10384 -- The statement part has already been protected with an at_end and
10385 -- cleanup actions. The call to Complete_Activation must be placed
10386 -- at the head of the sequence of statements of that block. The
10387 -- declarations have been merged in this sequence of statements but
10388 -- the first real statement is accessible from the First_Real_Statement
10389 -- field (which was set for exactly this purpose).
10391 if Restricted_Profile then
10392 Call := Build_Runtime_Call (Loc, RE_Complete_Restricted_Activation);
10394 Call := Build_Runtime_Call (Loc, RE_Complete_Activation);
10398 (First_Real_Statement (Handled_Statement_Sequence (N)), Call);
10402 Make_Subprogram_Body (Loc,
10403 Specification => Build_Task_Proc_Specification (Ttyp),
10404 Declarations => Declarations (N),
10405 Handled_Statement_Sequence => Handled_Statement_Sequence (N));
10407 -- If the task contains generic instantiations, cleanup actions are
10408 -- delayed until after instantiation. Transfer the activation chain to
10409 -- the subprogram, to insure that the activation call is properly
10410 -- generated. It the task body contains inner tasks, indicate that the
10411 -- subprogram is a task master.
10413 if Delay_Cleanups (Ttyp) then
10414 Set_Activation_Chain_Entity (New_N, Activation_Chain_Entity (N));
10415 Set_Is_Task_Master (New_N, Is_Task_Master (N));
10418 Rewrite (N, New_N);
10421 -- Set elaboration flag immediately after task body. If the body is a
10422 -- subunit, the flag is set in the declarative part containing the stub.
10424 if Nkind (Parent (N)) /= N_Subunit then
10426 Make_Assignment_Statement (Loc,
10428 Make_Identifier (Loc, New_External_Name (Chars (Ttyp), 'E')),
10429 Expression => New_Reference_To (Standard_True, Loc)));
10432 -- Ada 2005 (AI-345): Construct the primitive entry wrapper bodies after
10433 -- the task body. At this point all wrapper specs have been created,
10434 -- frozen and included in the dispatch table for the task type.
10436 if Ada_Version >= Ada_2005 then
10437 if Nkind (Parent (N)) = N_Subunit then
10438 Insert_Nod := Corresponding_Stub (Parent (N));
10443 Build_Wrapper_Bodies (Loc, Ttyp, Insert_Nod);
10445 end Expand_N_Task_Body;
10447 ------------------------------------
10448 -- Expand_N_Task_Type_Declaration --
10449 ------------------------------------
10451 -- We have several things to do. First we must create a Boolean flag used
10452 -- to mark if the body is elaborated yet. This variable gets set to True
10453 -- when the body of the task is elaborated (we can't rely on the normal
10454 -- ABE mechanism for the task body, since we need to pass an access to
10455 -- this elaboration boolean to the runtime routines).
10457 -- taskE : aliased Boolean := False;
10459 -- Next a variable is declared to hold the task stack size (either the
10460 -- default : Unspecified_Size, or a value that is set by a pragma
10461 -- Storage_Size). If the value of the pragma Storage_Size is static, then
10462 -- the variable is initialized with this value:
10464 -- taskZ : Size_Type := Unspecified_Size;
10466 -- taskZ : Size_Type := Size_Type (size_expression);
10468 -- Note: No variable is needed to hold the task relative deadline since
10469 -- its value would never be static because the parameter is of a private
10470 -- type (Ada.Real_Time.Time_Span).
10472 -- Next we create a corresponding record type declaration used to represent
10473 -- values of this task. The general form of this type declaration is
10475 -- type taskV (discriminants) is record
10476 -- _Task_Id : Task_Id;
10477 -- entry_family : array (bounds) of Void;
10478 -- _Priority : Integer := priority_expression;
10479 -- _Size : Size_Type := size_expression;
10480 -- _Task_Info : Task_Info_Type := task_info_expression;
10481 -- _CPU : Integer := cpu_range_expression;
10482 -- _Relative_Deadline : Time_Span := time_span_expression;
10483 -- _Domain : Dispatching_Domain := dd_expression;
10486 -- The discriminants are present only if the corresponding task type has
10487 -- discriminants, and they exactly mirror the task type discriminants.
10489 -- The Id field is always present. It contains the Task_Id value, as set by
10490 -- the call to Create_Task. Note that although the task is limited, the
10491 -- task value record type is not limited, so there is no problem in passing
10492 -- this field as an out parameter to Create_Task.
10494 -- One entry_family component is present for each entry family in the task
10495 -- definition. The bounds correspond to the bounds of the entry family
10496 -- (which may depend on discriminants). The element type is void, since we
10497 -- only need the bounds information for determining the entry index. Note
10498 -- that the use of an anonymous array would normally be illegal in this
10499 -- context, but this is a parser check, and the semantics is quite prepared
10500 -- to handle such a case.
10502 -- The _Size field is present only if a Storage_Size pragma appears in the
10503 -- task definition. The expression captures the argument that was present
10504 -- in the pragma, and is used to override the task stack size otherwise
10505 -- associated with the task type.
10507 -- The _Priority field is present only if a Priority or Interrupt_Priority
10508 -- pragma appears in the task definition. The expression captures the
10509 -- argument that was present in the pragma, and is used to provide the Size
10510 -- parameter to the call to Create_Task.
10512 -- The _Task_Info field is present only if a Task_Info pragma appears in
10513 -- the task definition. The expression captures the argument that was
10514 -- present in the pragma, and is used to provide the Task_Image parameter
10515 -- to the call to Create_Task.
10517 -- The _CPU field is present only if a CPU pragma appears in the task
10518 -- definition. The expression captures the argument that was present in
10519 -- the pragma, and is used to provide the CPU parameter to the call to
10522 -- The _Relative_Deadline field is present only if a Relative_Deadline
10523 -- pragma appears in the task definition. The expression captures the
10524 -- argument that was present in the pragma, and is used to provide the
10525 -- Relative_Deadline parameter to the call to Create_Task.
10527 -- The _Domain field is present only if a Dispatching_Domain pragma or
10528 -- aspect appears in the task definition. The expression captures the
10529 -- argument that was present in the pragma or aspect, and is used to
10530 -- provide the Dispatching_Domain parameter to the call to Create_Task.
10532 -- When a task is declared, an instance of the task value record is
10533 -- created. The elaboration of this declaration creates the correct bounds
10534 -- for the entry families, and also evaluates the size, priority, and
10535 -- task_Info expressions if needed. The initialization routine for the task
10536 -- type itself then calls Create_Task with appropriate parameters to
10537 -- initialize the value of the Task_Id field.
10539 -- Note: the address of this record is passed as the "Discriminants"
10540 -- parameter for Create_Task. Since Create_Task merely passes this onto the
10541 -- body procedure, it does not matter that it does not quite match the
10542 -- GNARLI model of what is being passed (the record contains more than just
10543 -- the discriminants, but the discriminants can be found from the record
10546 -- The Entity_Id for this created record type is placed in the
10547 -- Corresponding_Record_Type field of the associated task type entity.
10549 -- Next we create a procedure specification for the task body procedure:
10551 -- procedure taskB (_Task : access taskV);
10553 -- Note that this must come after the record type declaration, since
10554 -- the spec refers to this type. It turns out that the initialization
10555 -- procedure for the value type references the task body spec, but that's
10556 -- fine, since it won't be generated till the freeze point for the type,
10557 -- which is certainly after the task body spec declaration.
10559 -- Finally, we set the task index value field of the entry attribute in
10560 -- the case of a simple entry.
10562 procedure Expand_N_Task_Type_Declaration (N : Node_Id) is
10563 Loc : constant Source_Ptr := Sloc (N);
10564 Tasktyp : constant Entity_Id := Etype (Defining_Identifier (N));
10565 Tasknm : constant Name_Id := Chars (Tasktyp);
10566 Taskdef : constant Node_Id := Task_Definition (N);
10568 Proc_Spec : Node_Id;
10569 Rec_Decl : Node_Id;
10570 Rec_Ent : Entity_Id;
10572 Elab_Decl : Node_Id;
10573 Size_Decl : Node_Id;
10574 Body_Decl : Node_Id;
10575 Task_Size : Node_Id;
10576 Ent_Stack : Entity_Id;
10577 Decl_Stack : Node_Id;
10580 -- If already expanded, nothing to do
10582 if Present (Corresponding_Record_Type (Tasktyp)) then
10586 -- Here we will do the expansion
10588 Rec_Decl := Build_Corresponding_Record (N, Tasktyp, Loc);
10590 Rec_Ent := Defining_Identifier (Rec_Decl);
10591 Cdecls := Component_Items (Component_List
10592 (Type_Definition (Rec_Decl)));
10594 Qualify_Entity_Names (N);
10596 -- First create the elaboration variable
10599 Make_Object_Declaration (Loc,
10600 Defining_Identifier =>
10601 Make_Defining_Identifier (Sloc (Tasktyp),
10602 Chars => New_External_Name (Tasknm, 'E')),
10603 Aliased_Present => True,
10604 Object_Definition => New_Reference_To (Standard_Boolean, Loc),
10605 Expression => New_Reference_To (Standard_False, Loc));
10606 Insert_After (N, Elab_Decl);
10608 -- Next create the declaration of the size variable (tasknmZ)
10610 Set_Storage_Size_Variable (Tasktyp,
10611 Make_Defining_Identifier (Sloc (Tasktyp),
10612 Chars => New_External_Name (Tasknm, 'Z')));
10614 if Present (Taskdef) and then Has_Storage_Size_Pragma (Taskdef) and then
10615 Is_Static_Expression (Expression (First (
10616 Pragma_Argument_Associations (Find_Task_Or_Protected_Pragma (
10617 Taskdef, Name_Storage_Size)))))
10620 Make_Object_Declaration (Loc,
10621 Defining_Identifier => Storage_Size_Variable (Tasktyp),
10622 Object_Definition => New_Reference_To (RTE (RE_Size_Type), Loc),
10624 Convert_To (RTE (RE_Size_Type),
10626 Expression (First (
10627 Pragma_Argument_Associations (
10628 Find_Task_Or_Protected_Pragma
10629 (Taskdef, Name_Storage_Size)))))));
10633 Make_Object_Declaration (Loc,
10634 Defining_Identifier => Storage_Size_Variable (Tasktyp),
10635 Object_Definition => New_Reference_To (RTE (RE_Size_Type), Loc),
10636 Expression => New_Reference_To (RTE (RE_Unspecified_Size), Loc));
10639 Insert_After (Elab_Decl, Size_Decl);
10641 -- Next build the rest of the corresponding record declaration. This is
10642 -- done last, since the corresponding record initialization procedure
10643 -- will reference the previously created entities.
10645 -- Fill in the component declarations -- first the _Task_Id field
10648 Make_Component_Declaration (Loc,
10649 Defining_Identifier =>
10650 Make_Defining_Identifier (Loc, Name_uTask_Id),
10651 Component_Definition =>
10652 Make_Component_Definition (Loc,
10653 Aliased_Present => False,
10654 Subtype_Indication => New_Reference_To (RTE (RO_ST_Task_Id),
10657 -- Declare static ATCB (that is, created by the expander) if we are
10658 -- using the Restricted run time.
10660 if Restricted_Profile then
10662 Make_Component_Declaration (Loc,
10663 Defining_Identifier =>
10664 Make_Defining_Identifier (Loc, Name_uATCB),
10666 Component_Definition =>
10667 Make_Component_Definition (Loc,
10668 Aliased_Present => True,
10669 Subtype_Indication => Make_Subtype_Indication (Loc,
10670 Subtype_Mark => New_Occurrence_Of
10671 (RTE (RE_Ada_Task_Control_Block), Loc),
10674 Make_Index_Or_Discriminant_Constraint (Loc,
10676 New_List (Make_Integer_Literal (Loc, 0)))))));
10680 -- Declare static stack (that is, created by the expander) if we are
10681 -- using the Restricted run time on a bare board configuration.
10683 if Restricted_Profile
10684 and then Preallocated_Stacks_On_Target
10686 -- First we need to extract the appropriate stack size
10688 Ent_Stack := Make_Defining_Identifier (Loc, Name_uStack);
10690 if Present (Taskdef) and then Has_Storage_Size_Pragma (Taskdef) then
10692 Expr_N : constant Node_Id :=
10693 Expression (First (
10694 Pragma_Argument_Associations (
10695 Find_Task_Or_Protected_Pragma
10696 (Taskdef, Name_Storage_Size))));
10697 Etyp : constant Entity_Id := Etype (Expr_N);
10698 P : constant Node_Id := Parent (Expr_N);
10701 -- The stack is defined inside the corresponding record.
10702 -- Therefore if the size of the stack is set by means of
10703 -- a discriminant, we must reference the discriminant of the
10704 -- corresponding record type.
10706 if Nkind (Expr_N) in N_Has_Entity
10707 and then Present (Discriminal_Link (Entity (Expr_N)))
10711 (CR_Discriminant (Discriminal_Link (Entity (Expr_N))),
10713 Set_Parent (Task_Size, P);
10714 Set_Etype (Task_Size, Etyp);
10715 Set_Analyzed (Task_Size);
10718 Task_Size := Relocate_Node (Expr_N);
10724 New_Reference_To (RTE (RE_Default_Stack_Size), Loc);
10727 Decl_Stack := Make_Component_Declaration (Loc,
10728 Defining_Identifier => Ent_Stack,
10730 Component_Definition =>
10731 Make_Component_Definition (Loc,
10732 Aliased_Present => True,
10733 Subtype_Indication => Make_Subtype_Indication (Loc,
10735 New_Occurrence_Of (RTE (RE_Storage_Array), Loc),
10738 Make_Index_Or_Discriminant_Constraint (Loc,
10739 Constraints => New_List (Make_Range (Loc,
10740 Low_Bound => Make_Integer_Literal (Loc, 1),
10741 High_Bound => Convert_To (RTE (RE_Storage_Offset),
10744 Append_To (Cdecls, Decl_Stack);
10746 -- The appropriate alignment for the stack is ensured by the run-time
10747 -- code in charge of task creation.
10751 -- Add components for entry families
10753 Collect_Entry_Families (Loc, Cdecls, Size_Decl, Tasktyp);
10755 -- Add the _Priority component if a Priority pragma is present
10757 if Present (Taskdef) and then Has_Pragma_Priority (Taskdef) then
10759 Prag : constant Node_Id :=
10760 Find_Task_Or_Protected_Pragma (Taskdef, Name_Priority);
10764 Expr := First (Pragma_Argument_Associations (Prag));
10766 if Nkind (Expr) = N_Pragma_Argument_Association then
10767 Expr := Expression (Expr);
10770 Expr := New_Copy_Tree (Expr);
10772 -- Add conversion to proper type to do range check if required
10773 -- Note that for runtime units, we allow out of range interrupt
10774 -- priority values to be used in a priority pragma. This is for
10775 -- the benefit of some versions of System.Interrupts which use
10776 -- a special server task with maximum interrupt priority.
10778 if Pragma_Name (Prag) = Name_Priority
10779 and then not GNAT_Mode
10781 Rewrite (Expr, Convert_To (RTE (RE_Priority), Expr));
10783 Rewrite (Expr, Convert_To (RTE (RE_Any_Priority), Expr));
10787 Make_Component_Declaration (Loc,
10788 Defining_Identifier =>
10789 Make_Defining_Identifier (Loc, Name_uPriority),
10790 Component_Definition =>
10791 Make_Component_Definition (Loc,
10792 Aliased_Present => False,
10793 Subtype_Indication => New_Reference_To (Standard_Integer,
10795 Expression => Expr));
10799 -- Add the _Task_Size component if a Storage_Size pragma is present
10801 if Present (Taskdef)
10802 and then Has_Storage_Size_Pragma (Taskdef)
10805 Make_Component_Declaration (Loc,
10806 Defining_Identifier =>
10807 Make_Defining_Identifier (Loc, Name_uSize),
10809 Component_Definition =>
10810 Make_Component_Definition (Loc,
10811 Aliased_Present => False,
10812 Subtype_Indication => New_Reference_To (RTE (RE_Size_Type),
10816 Convert_To (RTE (RE_Size_Type),
10818 Expression (First (
10819 Pragma_Argument_Associations (
10820 Find_Task_Or_Protected_Pragma
10821 (Taskdef, Name_Storage_Size))))))));
10824 -- Add the _Task_Info component if a Task_Info pragma is present
10826 if Present (Taskdef) and then Has_Task_Info_Pragma (Taskdef) then
10828 Make_Component_Declaration (Loc,
10829 Defining_Identifier =>
10830 Make_Defining_Identifier (Loc, Name_uTask_Info),
10832 Component_Definition =>
10833 Make_Component_Definition (Loc,
10834 Aliased_Present => False,
10835 Subtype_Indication =>
10836 New_Reference_To (RTE (RE_Task_Info_Type), Loc)),
10838 Expression => New_Copy (
10839 Expression (First (
10840 Pragma_Argument_Associations (
10841 Find_Task_Or_Protected_Pragma
10842 (Taskdef, Name_Task_Info)))))));
10845 -- Add the _CPU component if a CPU pragma is present
10847 if Present (Taskdef) and then Has_Pragma_CPU (Taskdef) then
10849 Make_Component_Declaration (Loc,
10850 Defining_Identifier =>
10851 Make_Defining_Identifier (Loc, Name_uCPU),
10853 Component_Definition =>
10854 Make_Component_Definition (Loc,
10855 Aliased_Present => False,
10856 Subtype_Indication =>
10857 New_Reference_To (RTE (RE_CPU_Range), Loc)),
10859 Expression => New_Copy (
10860 Expression (First (
10861 Pragma_Argument_Associations (
10862 Find_Task_Or_Protected_Pragma
10863 (Taskdef, Name_CPU)))))));
10866 -- Add the _Relative_Deadline component if a Relative_Deadline pragma is
10867 -- present. If we are using a restricted run time this component will
10868 -- not be added (deadlines are not allowed by the Ravenscar profile).
10870 if not Restricted_Profile
10871 and then Present (Taskdef)
10872 and then Has_Relative_Deadline_Pragma (Taskdef)
10875 Make_Component_Declaration (Loc,
10876 Defining_Identifier =>
10877 Make_Defining_Identifier (Loc, Name_uRelative_Deadline),
10879 Component_Definition =>
10880 Make_Component_Definition (Loc,
10881 Aliased_Present => False,
10882 Subtype_Indication =>
10883 New_Reference_To (RTE (RE_Time_Span), Loc)),
10886 Convert_To (RTE (RE_Time_Span),
10888 Expression (First (
10889 Pragma_Argument_Associations (
10890 Find_Task_Or_Protected_Pragma
10891 (Taskdef, Name_Relative_Deadline))))))));
10894 -- Add the _Dispatching_Domain component if a Dispatching_Domain pragma
10895 -- or aspect is present. If we are using a restricted run time this
10896 -- component will not be added (dispatching domains are not allowed by
10897 -- the Ravenscar profile).
10899 if not Restricted_Profile
10900 and then Present (Taskdef)
10901 and then Has_Pragma_Dispatching_Domain (Taskdef)
10904 Make_Component_Declaration (Loc,
10905 Defining_Identifier =>
10906 Make_Defining_Identifier (Loc, Name_uDispatching_Domain),
10908 Component_Definition =>
10909 Make_Component_Definition (Loc,
10910 Aliased_Present => False,
10911 Subtype_Indication =>
10913 (RTE (RE_Dispatching_Domain_Access), Loc)),
10916 Unchecked_Convert_To (RTE (RE_Dispatching_Domain_Access),
10920 (Pragma_Argument_Associations
10921 (Find_Task_Or_Protected_Pragma
10922 (Taskdef, Name_Dispatching_Domain))))))));
10925 Insert_After (Size_Decl, Rec_Decl);
10927 -- Analyze the record declaration immediately after construction,
10928 -- because the initialization procedure is needed for single task
10929 -- declarations before the next entity is analyzed.
10931 Analyze (Rec_Decl);
10933 -- Create the declaration of the task body procedure
10935 Proc_Spec := Build_Task_Proc_Specification (Tasktyp);
10937 Make_Subprogram_Declaration (Loc,
10938 Specification => Proc_Spec);
10940 Insert_After (Rec_Decl, Body_Decl);
10942 -- The subprogram does not comes from source, so we have to indicate the
10943 -- need for debugging information explicitly.
10945 if Comes_From_Source (Original_Node (N)) then
10946 Set_Debug_Info_Needed (Defining_Entity (Proc_Spec));
10949 -- Ada 2005 (AI-345): Construct the primitive entry wrapper specs before
10950 -- the corresponding record has been frozen.
10952 if Ada_Version >= Ada_2005 then
10953 Build_Wrapper_Specs (Loc, Tasktyp, Rec_Decl);
10956 -- Ada 2005 (AI-345): We must defer freezing to allow further
10957 -- declaration of primitive subprograms covering task interfaces
10959 if Ada_Version <= Ada_95 then
10961 -- Now we can freeze the corresponding record. This needs manually
10962 -- freezing, since it is really part of the task type, and the task
10963 -- type is frozen at this stage. We of course need the initialization
10964 -- procedure for this corresponding record type and we won't get it
10965 -- in time if we don't freeze now.
10968 L : constant List_Id := Freeze_Entity (Rec_Ent, N);
10970 if Is_Non_Empty_List (L) then
10971 Insert_List_After (Body_Decl, L);
10976 -- Complete the expansion of access types to the current task type, if
10977 -- any were declared.
10979 Expand_Previous_Access_Type (Tasktyp);
10981 -- Create wrappers for entries that have pre/postconditions
10987 Ent := First_Entity (Tasktyp);
10988 while Present (Ent) loop
10989 if Ekind_In (Ent, E_Entry, E_Entry_Family)
10990 and then Present (Spec_PPC_List (Contract (Ent)))
10992 Build_PPC_Wrapper (Ent, N);
10998 end Expand_N_Task_Type_Declaration;
11000 -------------------------------
11001 -- Expand_N_Timed_Entry_Call --
11002 -------------------------------
11004 -- A timed entry call in normal case is not implemented using ATC mechanism
11005 -- anymore for efficiency reason.
11015 -- is expanded as follow:
11017 -- 1) When T.E is a task entry_call;
11021 -- X : Task_Entry_Index := <entry index>;
11022 -- DX : Duration := To_Duration (D);
11023 -- M : Delay_Mode := <discriminant>;
11024 -- P : parms := (parm, parm, parm);
11027 -- Timed_Protected_Entry_Call
11028 -- (<acceptor-task>, X, P'Address, DX, M, B);
11036 -- 2) When T.E is a protected entry_call;
11040 -- X : Protected_Entry_Index := <entry index>;
11041 -- DX : Duration := To_Duration (D);
11042 -- M : Delay_Mode := <discriminant>;
11043 -- P : parms := (parm, parm, parm);
11046 -- Timed_Protected_Entry_Call
11047 -- (<object>'unchecked_access, X, P'Address, DX, M, B);
11055 -- 3) Ada 2005 (AI-345): When T.E is a dispatching procedure call;
11058 -- B : Boolean := False;
11059 -- C : Ada.Tags.Prim_Op_Kind;
11060 -- DX : Duration := To_Duration (D)
11061 -- K : Ada.Tags.Tagged_Kind :=
11062 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
11063 -- M : Integer :=...;
11064 -- P : Parameters := (Param1 .. ParamN);
11068 -- if K = Ada.Tags.TK_Limited_Tagged then
11069 -- <dispatching-call>;
11070 -- <triggering-statements>
11074 -- Ada.Tags.Get_Offset_Index
11075 -- (Ada.Tags.Tag (<object>), DT_Position (<dispatching-call>));
11077 -- _Disp_Timed_Select (<object>, S, P'Address, DX, M, C, B);
11079 -- if C = POK_Protected_Entry
11080 -- or else C = POK_Task_Entry
11082 -- Param1 := P.Param1;
11084 -- ParamN := P.ParamN;
11088 -- if C = POK_Procedure
11089 -- or else C = POK_Protected_Procedure
11090 -- or else C = POK_Task_Procedure
11092 -- <dispatching-call>;
11095 -- <triggering-statements>
11097 -- <timed-statements>
11102 -- The triggering statement and the sequence of timed statements have not
11103 -- been analyzed yet (see Analyzed_Timed_Entry_Call). They may contain
11104 -- local declarations, and therefore the copies that are made during
11105 -- expansion must be disjoint, as for any other inlining.
11107 procedure Expand_N_Timed_Entry_Call (N : Node_Id) is
11108 Loc : constant Source_Ptr := Sloc (N);
11110 E_Call : Node_Id :=
11111 Entry_Call_Statement (Entry_Call_Alternative (N));
11112 E_Stats : constant List_Id :=
11113 Statements (Entry_Call_Alternative (N));
11114 D_Stat : Node_Id :=
11115 Delay_Statement (Delay_Alternative (N));
11116 D_Stats : constant List_Id :=
11117 Statements (Delay_Alternative (N));
11120 Blk_Typ : Entity_Id;
11122 Call_Ent : Entity_Id;
11123 Conc_Typ_Stmts : List_Id;
11127 D_Type : Entity_Id;
11133 Is_Disp_Select : Boolean;
11134 Lim_Typ_Stmts : List_Id;
11143 B : Entity_Id; -- Call status flag
11144 C : Entity_Id; -- Call kind
11145 D : Entity_Id; -- Delay
11146 K : Entity_Id; -- Tagged kind
11147 M : Entity_Id; -- Delay mode
11148 P : Entity_Id; -- Parameter block
11149 S : Entity_Id; -- Primitive operation slot
11152 -- Under the Ravenscar profile, timed entry calls are excluded. An error
11153 -- was already reported on spec, so do not attempt to expand the call.
11155 if Restriction_Active (No_Select_Statements) then
11159 Process_Statements_For_Controlled_Objects (Entry_Call_Alternative (N));
11160 Process_Statements_For_Controlled_Objects (Delay_Alternative (N));
11162 -- The arguments in the call may require dynamic allocation, and the
11163 -- call statement may have been transformed into a block. The block
11164 -- may contain additional declarations for internal entities, and the
11165 -- original call is found by sequential search.
11167 if Nkind (E_Call) = N_Block_Statement then
11168 E_Call := First (Statements (Handled_Statement_Sequence (E_Call)));
11169 while not Nkind_In (E_Call, N_Procedure_Call_Statement,
11170 N_Entry_Call_Statement)
11177 Ada_Version >= Ada_2005
11178 and then Nkind (E_Call) = N_Procedure_Call_Statement;
11180 if Is_Disp_Select then
11181 Extract_Dispatching_Call (E_Call, Call_Ent, Obj, Actuals, Formals);
11187 -- B : Boolean := False;
11189 B := Build_B (Loc, Decls);
11192 -- C : Ada.Tags.Prim_Op_Kind;
11194 C := Build_C (Loc, Decls);
11196 -- Because the analysis of all statements was disabled, manually
11197 -- analyze the delay statement.
11200 D_Stat := Original_Node (D_Stat);
11203 -- Build an entry call using Simple_Entry_Call
11205 Extract_Entry (E_Call, Concval, Ename, Index);
11206 Build_Simple_Entry_Call (E_Call, Concval, Ename, Index);
11208 Decls := Declarations (E_Call);
11209 Stmts := Statements (Handled_Statement_Sequence (E_Call));
11218 B := Make_Defining_Identifier (Loc, Name_uB);
11221 Make_Object_Declaration (Loc,
11222 Defining_Identifier => B,
11223 Object_Definition => New_Reference_To (Standard_Boolean, Loc)));
11226 -- Duration and mode processing
11228 D_Type := Base_Type (Etype (Expression (D_Stat)));
11230 -- Use the type of the delay expression (Calendar or Real_Time) to
11231 -- generate the appropriate conversion.
11233 if Nkind (D_Stat) = N_Delay_Relative_Statement then
11234 D_Disc := Make_Integer_Literal (Loc, 0);
11235 D_Conv := Relocate_Node (Expression (D_Stat));
11237 elsif Is_RTE (D_Type, RO_CA_Time) then
11238 D_Disc := Make_Integer_Literal (Loc, 1);
11240 Make_Function_Call (Loc,
11241 Name => New_Reference_To (RTE (RO_CA_To_Duration), Loc),
11242 Parameter_Associations =>
11243 New_List (New_Copy (Expression (D_Stat))));
11245 else pragma Assert (Is_RTE (D_Type, RO_RT_Time));
11246 D_Disc := Make_Integer_Literal (Loc, 2);
11248 Make_Function_Call (Loc,
11249 Name => New_Reference_To (RTE (RO_RT_To_Duration), Loc),
11250 Parameter_Associations =>
11251 New_List (New_Copy (Expression (D_Stat))));
11254 D := Make_Temporary (Loc, 'D');
11260 Make_Object_Declaration (Loc,
11261 Defining_Identifier => D,
11262 Object_Definition => New_Reference_To (Standard_Duration, Loc)));
11264 M := Make_Temporary (Loc, 'M');
11267 -- M : Integer := (0 | 1 | 2);
11270 Make_Object_Declaration (Loc,
11271 Defining_Identifier => M,
11272 Object_Definition => New_Reference_To (Standard_Integer, Loc),
11273 Expression => D_Disc));
11275 -- Do the assignment at this stage only because the evaluation of the
11276 -- expression must not occur before (see ACVC C97302A).
11279 Make_Assignment_Statement (Loc,
11280 Name => New_Reference_To (D, Loc),
11281 Expression => D_Conv));
11283 -- Parameter block processing
11285 -- Manually create the parameter block for dispatching calls. In the
11286 -- case of entries, the block has already been created during the call
11287 -- to Build_Simple_Entry_Call.
11289 if Is_Disp_Select then
11291 -- Tagged kind processing, generate:
11292 -- K : Ada.Tags.Tagged_Kind :=
11293 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag <object>));
11295 K := Build_K (Loc, Decls, Obj);
11297 Blk_Typ := Build_Parameter_Block (Loc, Actuals, Formals, Decls);
11299 Parameter_Block_Pack (Loc, Blk_Typ, Actuals, Formals, Decls, Stmts);
11301 -- Dispatch table slot processing, generate:
11304 S := Build_S (Loc, Decls);
11307 -- S := Ada.Tags.Get_Offset_Index
11308 -- (Ada.Tags.Tag (<object>), DT_Position (Call_Ent));
11311 New_List (Build_S_Assignment (Loc, S, Obj, Call_Ent));
11314 -- _Disp_Timed_Select (<object>, S, P'Address, D, M, C, B);
11316 -- where Obj is the controlling formal parameter, S is the dispatch
11317 -- table slot number of the dispatching operation, P is the wrapped
11318 -- parameter block, D is the duration, M is the duration mode, C is
11319 -- the call kind and B is the call status.
11321 Params := New_List;
11323 Append_To (Params, New_Copy_Tree (Obj));
11324 Append_To (Params, New_Reference_To (S, Loc));
11326 Make_Attribute_Reference (Loc,
11327 Prefix => New_Reference_To (P, Loc),
11328 Attribute_Name => Name_Address));
11329 Append_To (Params, New_Reference_To (D, Loc));
11330 Append_To (Params, New_Reference_To (M, Loc));
11331 Append_To (Params, New_Reference_To (C, Loc));
11332 Append_To (Params, New_Reference_To (B, Loc));
11334 Append_To (Conc_Typ_Stmts,
11335 Make_Procedure_Call_Statement (Loc,
11339 (Etype (Etype (Obj)), Name_uDisp_Timed_Select), Loc),
11340 Parameter_Associations => Params));
11343 -- if C = POK_Protected_Entry
11344 -- or else C = POK_Task_Entry
11346 -- Param1 := P.Param1;
11348 -- ParamN := P.ParamN;
11351 Unpack := Parameter_Block_Unpack (Loc, P, Actuals, Formals);
11353 -- Generate the if statement only when the packed parameters need
11354 -- explicit assignments to their corresponding actuals.
11356 if Present (Unpack) then
11357 Append_To (Conc_Typ_Stmts,
11358 Make_If_Statement (Loc,
11364 Left_Opnd => New_Reference_To (C, Loc),
11367 (RTE (RE_POK_Protected_Entry), Loc)),
11371 Left_Opnd => New_Reference_To (C, Loc),
11373 New_Reference_To (RTE (RE_POK_Task_Entry), Loc))),
11375 Then_Statements => Unpack));
11381 -- if C = POK_Procedure
11382 -- or else C = POK_Protected_Procedure
11383 -- or else C = POK_Task_Procedure
11385 -- <dispatching-call>
11387 -- <triggering-statements>
11389 -- <timed-statements>
11392 N_Stats := Copy_Separate_List (E_Stats);
11394 Prepend_To (N_Stats,
11395 Make_If_Statement (Loc,
11401 Left_Opnd => New_Reference_To (C, Loc),
11403 New_Reference_To (RTE (RE_POK_Procedure), Loc)),
11409 Left_Opnd => New_Reference_To (C, Loc),
11411 New_Reference_To (RTE (
11412 RE_POK_Protected_Procedure), Loc)),
11415 Left_Opnd => New_Reference_To (C, Loc),
11418 (RTE (RE_POK_Task_Procedure), Loc)))),
11420 Then_Statements => New_List (E_Call)));
11422 Append_To (Conc_Typ_Stmts,
11423 Make_If_Statement (Loc,
11424 Condition => New_Reference_To (B, Loc),
11425 Then_Statements => N_Stats,
11426 Else_Statements => D_Stats));
11429 -- <dispatching-call>;
11430 -- <triggering-statements>
11432 Lim_Typ_Stmts := Copy_Separate_List (E_Stats);
11433 Prepend_To (Lim_Typ_Stmts, New_Copy_Tree (E_Call));
11436 -- if K = Ada.Tags.TK_Limited_Tagged then
11443 Make_If_Statement (Loc,
11446 Left_Opnd => New_Reference_To (K, Loc),
11448 New_Reference_To (RTE (RE_TK_Limited_Tagged), Loc)),
11449 Then_Statements => Lim_Typ_Stmts,
11450 Else_Statements => Conc_Typ_Stmts));
11453 -- Skip assignments to temporaries created for in-out parameters.
11454 -- This makes unwarranted assumptions about the shape of the expanded
11455 -- tree for the call, and should be cleaned up ???
11457 Stmt := First (Stmts);
11458 while Nkind (Stmt) /= N_Procedure_Call_Statement loop
11462 -- Do the assignment at this stage only because the evaluation
11463 -- of the expression must not occur before (see ACVC C97302A).
11465 Insert_Before (Stmt,
11466 Make_Assignment_Statement (Loc,
11467 Name => New_Reference_To (D, Loc),
11468 Expression => D_Conv));
11471 Params := Parameter_Associations (Call);
11473 -- For a protected type, we build a Timed_Protected_Entry_Call
11475 if Is_Protected_Type (Etype (Concval)) then
11477 -- Create a new call statement
11479 Param := First (Params);
11480 while Present (Param)
11481 and then not Is_RTE (Etype (Param), RE_Call_Modes)
11486 Dummy := Remove_Next (Next (Param));
11488 -- Remove garbage is following the Cancel_Param if present
11490 Dummy := Next (Param);
11492 -- Remove the mode of the Protected_Entry_Call call, then remove
11493 -- the Communication_Block of the Protected_Entry_Call call, and
11494 -- finally add Duration and a Delay_Mode parameter
11496 pragma Assert (Present (Param));
11497 Rewrite (Param, New_Reference_To (D, Loc));
11499 Rewrite (Dummy, New_Reference_To (M, Loc));
11501 -- Add a Boolean flag for successful entry call
11503 Append_To (Params, New_Reference_To (B, Loc));
11505 case Corresponding_Runtime_Package (Etype (Concval)) is
11506 when System_Tasking_Protected_Objects_Entries =>
11508 Make_Procedure_Call_Statement (Loc,
11511 (RTE (RE_Timed_Protected_Entry_Call), Loc),
11512 Parameter_Associations => Params));
11514 when System_Tasking_Protected_Objects_Single_Entry =>
11515 Param := First (Params);
11516 while Present (Param)
11518 Is_RTE (Etype (Param), RE_Protected_Entry_Index)
11526 Make_Procedure_Call_Statement (Loc,
11529 (RTE (RE_Timed_Protected_Single_Entry_Call), Loc),
11530 Parameter_Associations => Params));
11533 raise Program_Error;
11536 -- For the task case, build a Timed_Task_Entry_Call
11539 -- Create a new call statement
11541 Append_To (Params, New_Reference_To (D, Loc));
11542 Append_To (Params, New_Reference_To (M, Loc));
11543 Append_To (Params, New_Reference_To (B, Loc));
11546 Make_Procedure_Call_Statement (Loc,
11548 New_Reference_To (RTE (RE_Timed_Task_Entry_Call), Loc),
11549 Parameter_Associations => Params));
11553 Make_Implicit_If_Statement (N,
11554 Condition => New_Reference_To (B, Loc),
11555 Then_Statements => E_Stats,
11556 Else_Statements => D_Stats));
11560 Make_Block_Statement (Loc,
11561 Declarations => Decls,
11562 Handled_Statement_Sequence =>
11563 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
11566 end Expand_N_Timed_Entry_Call;
11568 ----------------------------------------
11569 -- Expand_Protected_Body_Declarations --
11570 ----------------------------------------
11572 procedure Expand_Protected_Body_Declarations
11574 Spec_Id : Entity_Id)
11577 if No_Run_Time_Mode then
11578 Error_Msg_CRT ("protected body", N);
11581 elsif Full_Expander_Active then
11583 -- Associate discriminals with the first subprogram or entry body to
11586 if Present (First_Protected_Operation (Declarations (N))) then
11587 Set_Discriminals (Parent (Spec_Id));
11590 end Expand_Protected_Body_Declarations;
11592 -------------------------
11593 -- External_Subprogram --
11594 -------------------------
11596 function External_Subprogram (E : Entity_Id) return Entity_Id is
11597 Subp : constant Entity_Id := Protected_Body_Subprogram (E);
11600 -- The internal and external subprograms follow each other on the entity
11601 -- chain. Note that previously private operations had no separate
11602 -- external subprogram. We now create one in all cases, because a
11603 -- private operation may actually appear in an external call, through
11604 -- a 'Access reference used for a callback.
11606 -- If the operation is a function that returns an anonymous access type,
11607 -- the corresponding itype appears before the operation, and must be
11610 -- This mechanism is fragile, there should be a real link between the
11611 -- two versions of the operation, but there is no place to put it ???
11613 if Is_Access_Type (Next_Entity (Subp)) then
11614 return Next_Entity (Next_Entity (Subp));
11616 return Next_Entity (Subp);
11618 end External_Subprogram;
11620 ------------------------------
11621 -- Extract_Dispatching_Call --
11622 ------------------------------
11624 procedure Extract_Dispatching_Call
11626 Call_Ent : out Entity_Id;
11627 Object : out Entity_Id;
11628 Actuals : out List_Id;
11629 Formals : out List_Id)
11631 Call_Nam : Node_Id;
11634 pragma Assert (Nkind (N) = N_Procedure_Call_Statement);
11636 if Present (Original_Node (N)) then
11637 Call_Nam := Name (Original_Node (N));
11639 Call_Nam := Name (N);
11642 -- Retrieve the name of the dispatching procedure. It contains the
11643 -- dispatch table slot number.
11646 case Nkind (Call_Nam) is
11647 when N_Identifier =>
11650 when N_Selected_Component =>
11651 Call_Nam := Selector_Name (Call_Nam);
11654 raise Program_Error;
11659 Actuals := Parameter_Associations (N);
11660 Call_Ent := Entity (Call_Nam);
11661 Formals := Parameter_Specifications (Parent (Call_Ent));
11662 Object := First (Actuals);
11664 if Present (Original_Node (Object)) then
11665 Object := Original_Node (Object);
11668 -- If the type of the dispatching object is an access type then return
11669 -- an explicit dereference.
11671 if Is_Access_Type (Etype (Object)) then
11672 Object := Make_Explicit_Dereference (Sloc (N), Object);
11675 end Extract_Dispatching_Call;
11677 -------------------
11678 -- Extract_Entry --
11679 -------------------
11681 procedure Extract_Entry
11683 Concval : out Node_Id;
11684 Ename : out Node_Id;
11685 Index : out Node_Id)
11687 Nam : constant Node_Id := Name (N);
11690 -- For a simple entry, the name is a selected component, with the
11691 -- prefix being the task value, and the selector being the entry.
11693 if Nkind (Nam) = N_Selected_Component then
11694 Concval := Prefix (Nam);
11695 Ename := Selector_Name (Nam);
11698 -- For a member of an entry family, the name is an indexed component
11699 -- where the prefix is a selected component, whose prefix in turn is
11700 -- the task value, and whose selector is the entry family. The single
11701 -- expression in the expressions list of the indexed component is the
11702 -- subscript for the family.
11704 else pragma Assert (Nkind (Nam) = N_Indexed_Component);
11705 Concval := Prefix (Prefix (Nam));
11706 Ename := Selector_Name (Prefix (Nam));
11707 Index := First (Expressions (Nam));
11711 -------------------
11712 -- Family_Offset --
11713 -------------------
11715 function Family_Offset
11720 Cap : Boolean) return Node_Id
11726 function Convert_Discriminant_Ref (Bound : Node_Id) return Node_Id;
11727 -- If one of the bounds is a reference to a discriminant, replace with
11728 -- corresponding discriminal of type. Within the body of a task retrieve
11729 -- the renamed discriminant by simple visibility, using its generated
11730 -- name. Within a protected object, find the original discriminant and
11731 -- replace it with the discriminal of the current protected operation.
11733 ------------------------------
11734 -- Convert_Discriminant_Ref --
11735 ------------------------------
11737 function Convert_Discriminant_Ref (Bound : Node_Id) return Node_Id is
11738 Loc : constant Source_Ptr := Sloc (Bound);
11743 if Is_Entity_Name (Bound)
11744 and then Ekind (Entity (Bound)) = E_Discriminant
11746 if Is_Task_Type (Ttyp)
11747 and then Has_Completion (Ttyp)
11749 B := Make_Identifier (Loc, Chars (Entity (Bound)));
11750 Find_Direct_Name (B);
11752 elsif Is_Protected_Type (Ttyp) then
11753 D := First_Discriminant (Ttyp);
11754 while Chars (D) /= Chars (Entity (Bound)) loop
11755 Next_Discriminant (D);
11758 B := New_Reference_To (Discriminal (D), Loc);
11761 B := New_Reference_To (Discriminal (Entity (Bound)), Loc);
11764 elsif Nkind (Bound) = N_Attribute_Reference then
11768 B := New_Copy_Tree (Bound);
11772 Make_Attribute_Reference (Loc,
11773 Attribute_Name => Name_Pos,
11774 Prefix => New_Occurrence_Of (Etype (Bound), Loc),
11775 Expressions => New_List (B));
11776 end Convert_Discriminant_Ref;
11778 -- Start of processing for Family_Offset
11781 Real_Hi := Convert_Discriminant_Ref (Hi);
11782 Real_Lo := Convert_Discriminant_Ref (Lo);
11785 if Is_Task_Type (Ttyp) then
11786 Ityp := RTE (RE_Task_Entry_Index);
11788 Ityp := RTE (RE_Protected_Entry_Index);
11792 Make_Attribute_Reference (Loc,
11793 Prefix => New_Reference_To (Ityp, Loc),
11794 Attribute_Name => Name_Min,
11795 Expressions => New_List (
11797 Make_Integer_Literal (Loc, Entry_Family_Bound - 1)));
11800 Make_Attribute_Reference (Loc,
11801 Prefix => New_Reference_To (Ityp, Loc),
11802 Attribute_Name => Name_Max,
11803 Expressions => New_List (
11805 Make_Integer_Literal (Loc, -Entry_Family_Bound)));
11808 return Make_Op_Subtract (Loc, Real_Hi, Real_Lo);
11815 function Family_Size
11820 Cap : Boolean) return Node_Id
11825 if Is_Task_Type (Ttyp) then
11826 Ityp := RTE (RE_Task_Entry_Index);
11828 Ityp := RTE (RE_Protected_Entry_Index);
11832 Make_Attribute_Reference (Loc,
11833 Prefix => New_Reference_To (Ityp, Loc),
11834 Attribute_Name => Name_Max,
11835 Expressions => New_List (
11838 Family_Offset (Loc, Hi, Lo, Ttyp, Cap),
11840 Make_Integer_Literal (Loc, 1)),
11841 Make_Integer_Literal (Loc, 0)));
11844 -----------------------
11845 -- Find_Master_Scope --
11846 -----------------------
11848 function Find_Master_Scope (E : Entity_Id) return Entity_Id is
11852 -- In Ada2005, the master is the innermost enclosing scope that is not
11853 -- transient. If the enclosing block is the rewriting of a call or the
11854 -- scope is an extended return statement this is valid master. The
11855 -- master in an extended return is only used within the return, and is
11856 -- subsequently overwritten in Move_Activation_Chain, but it must exist
11857 -- now before that overwriting occurs.
11861 if Ada_Version >= Ada_2005 then
11862 while Is_Internal (S) loop
11863 if Nkind (Parent (S)) = N_Block_Statement
11865 Nkind (Original_Node (Parent (S))) = N_Procedure_Call_Statement
11869 elsif Ekind (S) = E_Return_Statement then
11879 end Find_Master_Scope;
11881 -----------------------------------
11882 -- Find_Task_Or_Protected_Pragma --
11883 -----------------------------------
11885 function Find_Task_Or_Protected_Pragma
11887 P : Name_Id) return Node_Id
11892 N := First (Visible_Declarations (T));
11893 while Present (N) loop
11894 if Nkind (N) = N_Pragma then
11895 if Pragma_Name (N) = P then
11898 elsif P = Name_Priority
11899 and then Pragma_Name (N) = Name_Interrupt_Priority
11912 N := First (Private_Declarations (T));
11913 while Present (N) loop
11914 if Nkind (N) = N_Pragma then
11915 if Pragma_Name (N) = P then
11918 elsif P = Name_Priority
11919 and then Pragma_Name (N) = Name_Interrupt_Priority
11932 raise Program_Error;
11933 end Find_Task_Or_Protected_Pragma;
11935 -------------------------------
11936 -- First_Protected_Operation --
11937 -------------------------------
11939 function First_Protected_Operation (D : List_Id) return Node_Id is
11940 First_Op : Node_Id;
11943 First_Op := First (D);
11944 while Present (First_Op)
11945 and then not Nkind_In (First_Op, N_Subprogram_Body, N_Entry_Body)
11951 end First_Protected_Operation;
11953 ---------------------------------------
11954 -- Install_Private_Data_Declarations --
11955 ---------------------------------------
11957 procedure Install_Private_Data_Declarations
11959 Spec_Id : Entity_Id;
11960 Conc_Typ : Entity_Id;
11961 Body_Nod : Node_Id;
11963 Barrier : Boolean := False;
11964 Family : Boolean := False)
11966 Is_Protected : constant Boolean := Is_Protected_Type (Conc_Typ);
11969 Insert_Node : Node_Id := Empty;
11970 Obj_Ent : Entity_Id;
11972 procedure Add (Decl : Node_Id);
11973 -- Add a single declaration after Insert_Node. If this is the first
11974 -- addition, Decl is added to the front of Decls and it becomes the
11977 function Replace_Bound (Bound : Node_Id) return Node_Id;
11978 -- The bounds of an entry index may depend on discriminants, create a
11979 -- reference to the corresponding prival. Otherwise return a duplicate
11980 -- of the original bound.
11986 procedure Add (Decl : Node_Id) is
11988 if No (Insert_Node) then
11989 Prepend_To (Decls, Decl);
11991 Insert_After (Insert_Node, Decl);
11994 Insert_Node := Decl;
11997 --------------------------
11998 -- Replace_Discriminant --
11999 --------------------------
12001 function Replace_Bound (Bound : Node_Id) return Node_Id is
12003 if Nkind (Bound) = N_Identifier
12004 and then Is_Discriminal (Entity (Bound))
12006 return Make_Identifier (Loc, Chars (Entity (Bound)));
12008 return Duplicate_Subexpr (Bound);
12012 -- Start of processing for Install_Private_Data_Declarations
12015 -- Step 1: Retrieve the concurrent object entity. Obj_Ent can denote
12016 -- formal parameter _O, _object or _task depending on the context.
12018 Obj_Ent := Concurrent_Object (Spec_Id, Conc_Typ);
12020 -- Special processing of _O for barrier functions, protected entries
12027 (Ekind (Spec_Id) = E_Entry
12028 or else Ekind (Spec_Id) = E_Entry_Family))
12031 Conc_Rec : constant Entity_Id :=
12032 Corresponding_Record_Type (Conc_Typ);
12033 Typ_Id : constant Entity_Id :=
12034 Make_Defining_Identifier (Loc,
12035 New_External_Name (Chars (Conc_Rec), 'P'));
12038 -- type prot_typVP is access prot_typV;
12041 Make_Full_Type_Declaration (Loc,
12042 Defining_Identifier => Typ_Id,
12044 Make_Access_To_Object_Definition (Loc,
12045 Subtype_Indication =>
12046 New_Reference_To (Conc_Rec, Loc)));
12050 -- _object : prot_typVP := prot_typV (_O);
12053 Make_Object_Declaration (Loc,
12054 Defining_Identifier =>
12055 Make_Defining_Identifier (Loc, Name_uObject),
12056 Object_Definition => New_Reference_To (Typ_Id, Loc),
12058 Unchecked_Convert_To (Typ_Id,
12059 New_Reference_To (Obj_Ent, Loc)));
12062 -- Set the reference to the concurrent object
12064 Obj_Ent := Defining_Identifier (Decl);
12068 -- Step 2: Create the Protection object and build its declaration for
12069 -- any protected entry (family) of subprogram.
12071 if Is_Protected then
12073 Prot_Ent : constant Entity_Id := Make_Temporary (Loc, 'R');
12077 Set_Protection_Object (Spec_Id, Prot_Ent);
12079 -- Determine the proper protection type
12081 if Has_Attach_Handler (Conc_Typ)
12082 and then not Restricted_Profile
12083 and then not Restriction_Active (No_Dynamic_Attachment)
12085 Prot_Typ := RE_Static_Interrupt_Protection;
12087 elsif Has_Interrupt_Handler (Conc_Typ)
12088 and then not Restriction_Active (No_Dynamic_Attachment)
12090 Prot_Typ := RE_Dynamic_Interrupt_Protection;
12092 -- The type has explicit entries or generated primitive entry
12095 elsif Has_Entries (Conc_Typ)
12097 (Ada_Version >= Ada_2005
12098 and then Present (Interface_List (Parent (Conc_Typ))))
12100 case Corresponding_Runtime_Package (Conc_Typ) is
12101 when System_Tasking_Protected_Objects_Entries =>
12102 Prot_Typ := RE_Protection_Entries;
12104 when System_Tasking_Protected_Objects_Single_Entry =>
12105 Prot_Typ := RE_Protection_Entry;
12108 raise Program_Error;
12112 Prot_Typ := RE_Protection;
12116 -- conc_typR : protection_typ renames _object._object;
12119 Make_Object_Renaming_Declaration (Loc,
12120 Defining_Identifier => Prot_Ent,
12122 New_Reference_To (RTE (Prot_Typ), Loc),
12124 Make_Selected_Component (Loc,
12125 Prefix => New_Reference_To (Obj_Ent, Loc),
12126 Selector_Name => Make_Identifier (Loc, Name_uObject)));
12131 -- Step 3: Add discriminant renamings (if any)
12133 if Has_Discriminants (Conc_Typ) then
12138 D := First_Discriminant (Conc_Typ);
12139 while Present (D) loop
12141 -- Adjust the source location
12143 Set_Sloc (Discriminal (D), Loc);
12146 -- discr_name : discr_typ renames _object.discr_name;
12148 -- discr_name : discr_typ renames _task.discr_name;
12151 Make_Object_Renaming_Declaration (Loc,
12152 Defining_Identifier => Discriminal (D),
12153 Subtype_Mark => New_Reference_To (Etype (D), Loc),
12155 Make_Selected_Component (Loc,
12156 Prefix => New_Reference_To (Obj_Ent, Loc),
12157 Selector_Name => Make_Identifier (Loc, Chars (D))));
12160 Next_Discriminant (D);
12165 -- Step 4: Add private component renamings (if any)
12167 if Is_Protected then
12168 Def := Protected_Definition (Parent (Conc_Typ));
12170 if Present (Private_Declarations (Def)) then
12173 Comp_Id : Entity_Id;
12174 Decl_Id : Entity_Id;
12177 Comp := First (Private_Declarations (Def));
12178 while Present (Comp) loop
12179 if Nkind (Comp) = N_Component_Declaration then
12180 Comp_Id := Defining_Identifier (Comp);
12182 Make_Defining_Identifier (Loc, Chars (Comp_Id));
12184 -- Minimal decoration
12186 if Ekind (Spec_Id) = E_Function then
12187 Set_Ekind (Decl_Id, E_Constant);
12189 Set_Ekind (Decl_Id, E_Variable);
12192 Set_Prival (Comp_Id, Decl_Id);
12193 Set_Prival_Link (Decl_Id, Comp_Id);
12194 Set_Is_Aliased (Decl_Id, Is_Aliased (Comp_Id));
12197 -- comp_name : comp_typ renames _object.comp_name;
12200 Make_Object_Renaming_Declaration (Loc,
12201 Defining_Identifier => Decl_Id,
12203 New_Reference_To (Etype (Comp_Id), Loc),
12205 Make_Selected_Component (Loc,
12207 New_Reference_To (Obj_Ent, Loc),
12209 Make_Identifier (Loc, Chars (Comp_Id))));
12219 -- Step 5: Add the declaration of the entry index and the associated
12220 -- type for barrier functions and entry families.
12222 if (Barrier and then Family)
12223 or else Ekind (Spec_Id) = E_Entry_Family
12226 E : constant Entity_Id := Index_Object (Spec_Id);
12227 Index : constant Entity_Id :=
12228 Defining_Identifier (
12229 Entry_Index_Specification (
12230 Entry_Body_Formal_Part (Body_Nod)));
12231 Index_Con : constant Entity_Id :=
12232 Make_Defining_Identifier (Loc, Chars (Index));
12234 Index_Typ : Entity_Id;
12238 -- Minimal decoration
12240 Set_Ekind (Index_Con, E_Constant);
12241 Set_Entry_Index_Constant (Index, Index_Con);
12242 Set_Discriminal_Link (Index_Con, Index);
12244 -- Retrieve the bounds of the entry family
12246 High := Type_High_Bound (Etype (Index));
12247 Low := Type_Low_Bound (Etype (Index));
12249 -- In the simple case the entry family is given by a subtype
12250 -- mark and the index constant has the same type.
12252 if Is_Entity_Name (Original_Node (
12253 Discrete_Subtype_Definition (Parent (Index))))
12255 Index_Typ := Etype (Index);
12257 -- Otherwise a new subtype declaration is required
12260 High := Replace_Bound (High);
12261 Low := Replace_Bound (Low);
12263 Index_Typ := Make_Temporary (Loc, 'J');
12266 -- subtype Jnn is <Etype of Index> range Low .. High;
12269 Make_Subtype_Declaration (Loc,
12270 Defining_Identifier => Index_Typ,
12271 Subtype_Indication =>
12272 Make_Subtype_Indication (Loc,
12274 New_Reference_To (Base_Type (Etype (Index)), Loc),
12276 Make_Range_Constraint (Loc,
12277 Range_Expression =>
12278 Make_Range (Loc, Low, High))));
12282 Set_Etype (Index_Con, Index_Typ);
12284 -- Create the object which designates the index:
12285 -- J : constant Jnn :=
12286 -- Jnn'Val (_E - <index expr> + Jnn'Pos (Jnn'First));
12288 -- where Jnn is the subtype created above or the original type of
12289 -- the index, _E is a formal of the protected body subprogram and
12290 -- <index expr> is the index of the first family member.
12293 Make_Object_Declaration (Loc,
12294 Defining_Identifier => Index_Con,
12295 Constant_Present => True,
12296 Object_Definition =>
12297 New_Reference_To (Index_Typ, Loc),
12300 Make_Attribute_Reference (Loc,
12302 New_Reference_To (Index_Typ, Loc),
12303 Attribute_Name => Name_Val,
12305 Expressions => New_List (
12309 Make_Op_Subtract (Loc,
12311 New_Reference_To (E, Loc),
12313 Entry_Index_Expression (Loc,
12314 Defining_Identifier (Body_Nod),
12318 Make_Attribute_Reference (Loc,
12320 New_Reference_To (Index_Typ, Loc),
12321 Attribute_Name => Name_Pos,
12322 Expressions => New_List (
12323 Make_Attribute_Reference (Loc,
12325 New_Reference_To (Index_Typ, Loc),
12326 Attribute_Name => Name_First)))))));
12330 end Install_Private_Data_Declarations;
12332 ---------------------------------
12333 -- Is_Potentially_Large_Family --
12334 ---------------------------------
12336 function Is_Potentially_Large_Family
12337 (Base_Index : Entity_Id;
12338 Conctyp : Entity_Id;
12340 Hi : Node_Id) return Boolean
12343 return Scope (Base_Index) = Standard_Standard
12344 and then Base_Index = Base_Type (Standard_Integer)
12345 and then Has_Discriminants (Conctyp)
12347 (Discriminant_Default_Value (First_Discriminant (Conctyp)))
12349 (Denotes_Discriminant (Lo, True)
12350 or else Denotes_Discriminant (Hi, True));
12351 end Is_Potentially_Large_Family;
12353 -------------------------------------
12354 -- Is_Private_Primitive_Subprogram --
12355 -------------------------------------
12357 function Is_Private_Primitive_Subprogram (Id : Entity_Id) return Boolean is
12360 (Ekind (Id) = E_Function or else Ekind (Id) = E_Procedure)
12361 and then Is_Private_Primitive (Id);
12362 end Is_Private_Primitive_Subprogram;
12368 function Index_Object (Spec_Id : Entity_Id) return Entity_Id is
12369 Bod_Subp : constant Entity_Id := Protected_Body_Subprogram (Spec_Id);
12370 Formal : Entity_Id;
12373 Formal := First_Formal (Bod_Subp);
12374 while Present (Formal) loop
12376 -- Look for formal parameter _E
12378 if Chars (Formal) = Name_uE then
12382 Next_Formal (Formal);
12385 -- A protected body subprogram should always have the parameter in
12388 raise Program_Error;
12391 --------------------------------
12392 -- Make_Initialize_Protection --
12393 --------------------------------
12395 function Make_Initialize_Protection
12396 (Protect_Rec : Entity_Id) return List_Id
12398 Loc : constant Source_Ptr := Sloc (Protect_Rec);
12402 Ptyp : constant Node_Id :=
12403 Corresponding_Concurrent_Type (Protect_Rec);
12405 L : constant List_Id := New_List;
12406 Has_Entry : constant Boolean := Has_Entries (Ptyp);
12407 Restricted : constant Boolean := Restricted_Profile;
12410 -- We may need two calls to properly initialize the object, one to
12411 -- Initialize_Protection, and possibly one to Install_Handlers if we
12412 -- have a pragma Attach_Handler.
12414 -- Get protected declaration. In the case of a task type declaration,
12415 -- this is simply the parent of the protected type entity. In the single
12416 -- protected object declaration, this parent will be the implicit type,
12417 -- and we can find the corresponding single protected object declaration
12418 -- by searching forward in the declaration list in the tree.
12420 -- Is the test for N_Single_Protected_Declaration needed here??? Nodes
12421 -- of this type should have been removed during semantic analysis.
12423 Pdec := Parent (Ptyp);
12424 while not Nkind_In (Pdec, N_Protected_Type_Declaration,
12425 N_Single_Protected_Declaration)
12430 -- Now we can find the object definition from this declaration
12432 Pdef := Protected_Definition (Pdec);
12434 -- Build the parameter list for the call. Note that _Init is the name
12435 -- of the formal for the object to be initialized, which is the task
12436 -- value record itself.
12440 -- Object parameter. This is a pointer to the object of type
12441 -- Protection used by the GNARL to control the protected object.
12444 Make_Attribute_Reference (Loc,
12446 Make_Selected_Component (Loc,
12447 Prefix => Make_Identifier (Loc, Name_uInit),
12448 Selector_Name => Make_Identifier (Loc, Name_uObject)),
12449 Attribute_Name => Name_Unchecked_Access));
12451 -- Priority parameter. Set to Unspecified_Priority unless there is a
12452 -- priority pragma, in which case we take the value from the pragma,
12453 -- or there is an interrupt pragma and no priority pragma, and we
12454 -- set the ceiling to Interrupt_Priority'Last, an implementation-
12455 -- defined value, see D.3(10).
12458 and then Has_Pragma_Priority (Pdef)
12461 Prio : constant Node_Id :=
12464 (Pragma_Argument_Associations
12465 (Find_Task_Or_Protected_Pragma
12466 (Pdef, Name_Priority))));
12470 -- If priority is a static expression, then we can duplicate it
12471 -- with no problem and simply append it to the argument list.
12473 if Is_Static_Expression (Prio) then
12475 Duplicate_Subexpr_No_Checks (Prio));
12477 -- Otherwise, the priority may be a per-object expression, if it
12478 -- depends on a discriminant of the type. In this case, create
12479 -- local variable to capture the expression. Note that it is
12480 -- really necessary to create this variable explicitly. It might
12481 -- be thought that removing side effects would the appropriate
12482 -- approach, but that could generate declarations improperly
12483 -- placed in the enclosing scope.
12485 -- Note: Use System.Any_Priority as the expected type for the
12486 -- non-static priority expression, in case the expression has not
12487 -- been analyzed yet (as occurs for example with pragma
12488 -- Interrupt_Priority).
12491 Temp := Make_Temporary (Loc, 'R', Prio);
12493 Make_Object_Declaration (Loc,
12494 Defining_Identifier => Temp,
12495 Object_Definition =>
12496 New_Occurrence_Of (RTE (RE_Any_Priority), Loc),
12497 Expression => Relocate_Node (Prio)));
12499 Append_To (Args, New_Occurrence_Of (Temp, Loc));
12503 -- When no priority is specified but an xx_Handler pragma is, we default
12504 -- to System.Interrupts.Default_Interrupt_Priority, see D.3(10).
12506 elsif Has_Attach_Handler (Ptyp)
12507 or else Has_Interrupt_Handler (Ptyp)
12510 New_Reference_To (RTE (RE_Default_Interrupt_Priority), Loc));
12512 -- Normal case, no priority or xx_Handler specified, default priority
12516 New_Reference_To (RTE (RE_Unspecified_Priority), Loc));
12519 -- Test for Compiler_Info parameter. This parameter allows entry body
12520 -- procedures and barrier functions to be called from the runtime. It
12521 -- is a pointer to the record generated by the compiler to represent
12522 -- the protected object.
12524 -- A protected type without entries that covers an interface and
12525 -- overrides the abstract routines with protected procedures is
12526 -- considered equivalent to a protected type with entries in the
12527 -- context of dispatching select statements.
12530 or else Has_Interfaces (Protect_Rec)
12532 ((Has_Attach_Handler (Ptyp) or else Has_Interrupt_Handler (Ptyp))
12533 and then not Restriction_Active (No_Dynamic_Attachment))
12536 Pkg_Id : constant RTU_Id := Corresponding_Runtime_Package (Ptyp);
12538 Called_Subp : RE_Id;
12542 when System_Tasking_Protected_Objects_Entries =>
12543 Called_Subp := RE_Initialize_Protection_Entries;
12545 when System_Tasking_Protected_Objects =>
12546 Called_Subp := RE_Initialize_Protection;
12548 when System_Tasking_Protected_Objects_Single_Entry =>
12549 Called_Subp := RE_Initialize_Protection_Entry;
12552 raise Program_Error;
12556 or else not Restricted
12557 or else Has_Interfaces (Protect_Rec)
12560 Make_Attribute_Reference (Loc,
12561 Prefix => Make_Identifier (Loc, Name_uInit),
12562 Attribute_Name => Name_Address));
12565 -- Entry_Bodies parameter. This is a pointer to an array of
12566 -- pointers to the entry body procedures and barrier functions of
12567 -- the object. If the protected type has no entries this object
12568 -- will not exist, in this case, pass a null.
12571 P_Arr := Entry_Bodies_Array (Ptyp);
12574 Make_Attribute_Reference (Loc,
12575 Prefix => New_Reference_To (P_Arr, Loc),
12576 Attribute_Name => Name_Unrestricted_Access));
12578 if Pkg_Id = System_Tasking_Protected_Objects_Entries then
12580 -- Find index mapping function (clumsy but ok for now)
12582 while Ekind (P_Arr) /= E_Function loop
12583 Next_Entity (P_Arr);
12587 Make_Attribute_Reference (Loc,
12588 Prefix => New_Reference_To (P_Arr, Loc),
12589 Attribute_Name => Name_Unrestricted_Access));
12591 -- Build_Entry_Names generation flag. When set to true, the
12592 -- runtime will allocate an array to hold the string names
12593 -- of protected entries.
12595 if not Restricted_Profile then
12596 if Entry_Names_OK then
12598 New_Reference_To (Standard_True, Loc));
12601 New_Reference_To (Standard_False, Loc));
12606 elsif Pkg_Id = System_Tasking_Protected_Objects_Single_Entry then
12607 Append_To (Args, Make_Null (Loc));
12609 elsif Pkg_Id = System_Tasking_Protected_Objects_Entries then
12610 Append_To (Args, Make_Null (Loc));
12611 Append_To (Args, Make_Null (Loc));
12612 Append_To (Args, New_Reference_To (Standard_False, Loc));
12616 Make_Procedure_Call_Statement (Loc,
12617 Name => New_Reference_To (RTE (Called_Subp), Loc),
12618 Parameter_Associations => Args));
12622 Make_Procedure_Call_Statement (Loc,
12623 Name => New_Reference_To (RTE (RE_Initialize_Protection), Loc),
12624 Parameter_Associations => Args));
12627 if Has_Attach_Handler (Ptyp) then
12629 -- We have a list of N Attach_Handler (ProcI, ExprI), and we have to
12630 -- make the following call:
12632 -- Install_Handlers (_object,
12633 -- ((Expr1, Proc1'access), ...., (ExprN, ProcN'access));
12635 -- or, in the case of Ravenscar:
12637 -- Install_Restricted_Handlers
12638 -- ((Expr1, Proc1'access), ...., (ExprN, ProcN'access));
12641 Args : constant List_Id := New_List;
12642 Table : constant List_Id := New_List;
12643 Ritem : Node_Id := First_Rep_Item (Ptyp);
12646 -- Build the Attach_Handler table argument
12648 while Present (Ritem) loop
12649 if Nkind (Ritem) = N_Pragma
12650 and then Pragma_Name (Ritem) = Name_Attach_Handler
12653 Handler : constant Node_Id :=
12654 First (Pragma_Argument_Associations (Ritem));
12656 Interrupt : constant Node_Id := Next (Handler);
12657 Expr : constant Node_Id := Expression (Interrupt);
12661 Make_Aggregate (Loc, Expressions => New_List (
12662 Unchecked_Convert_To
12663 (RTE (RE_System_Interrupt_Id), Expr),
12664 Make_Attribute_Reference (Loc,
12665 Prefix => Make_Selected_Component (Loc,
12666 Make_Identifier (Loc, Name_uInit),
12667 Duplicate_Subexpr_No_Checks
12668 (Expression (Handler))),
12669 Attribute_Name => Name_Access))));
12673 Next_Rep_Item (Ritem);
12676 -- Append the table argument we just built
12678 Append_To (Args, Make_Aggregate (Loc, Table));
12680 -- Append the Install_Handlers (or Install_Restricted_Handlers)
12681 -- call to the statements.
12684 -- Call a simplified version of Install_Handlers to be used
12685 -- when the Ravenscar restrictions are in effect
12686 -- (Install_Restricted_Handlers).
12689 Make_Procedure_Call_Statement (Loc,
12692 (RTE (RE_Install_Restricted_Handlers), Loc),
12693 Parameter_Associations => Args));
12696 -- First, prepends the _object argument
12699 Make_Attribute_Reference (Loc,
12701 Make_Selected_Component (Loc,
12702 Prefix => Make_Identifier (Loc, Name_uInit),
12703 Selector_Name => Make_Identifier (Loc, Name_uObject)),
12704 Attribute_Name => Name_Unchecked_Access));
12706 -- Then, insert call to Install_Handlers
12709 Make_Procedure_Call_Statement (Loc,
12710 Name => New_Reference_To (RTE (RE_Install_Handlers), Loc),
12711 Parameter_Associations => Args));
12717 end Make_Initialize_Protection;
12719 ---------------------------
12720 -- Make_Task_Create_Call --
12721 ---------------------------
12723 function Make_Task_Create_Call (Task_Rec : Entity_Id) return Node_Id is
12724 Loc : constant Source_Ptr := Sloc (Task_Rec);
12734 Ttyp := Corresponding_Concurrent_Type (Task_Rec);
12735 Tnam := Chars (Ttyp);
12737 -- Get task declaration. In the case of a task type declaration, this is
12738 -- simply the parent of the task type entity. In the single task
12739 -- declaration, this parent will be the implicit type, and we can find
12740 -- the corresponding single task declaration by searching forward in the
12741 -- declaration list in the tree.
12743 -- Is the test for N_Single_Task_Declaration needed here??? Nodes of
12744 -- this type should have been removed during semantic analysis.
12746 Tdec := Parent (Ttyp);
12747 while not Nkind_In (Tdec, N_Task_Type_Declaration,
12748 N_Single_Task_Declaration)
12753 -- Now we can find the task definition from this declaration
12755 Tdef := Task_Definition (Tdec);
12757 -- Build the parameter list for the call. Note that _Init is the name
12758 -- of the formal for the object to be initialized, which is the task
12759 -- value record itself.
12763 -- Priority parameter. Set to Unspecified_Priority unless there is a
12764 -- priority pragma, in which case we take the value from the pragma.
12766 if Present (Tdef) and then Has_Pragma_Priority (Tdef) then
12768 Make_Selected_Component (Loc,
12769 Prefix => Make_Identifier (Loc, Name_uInit),
12770 Selector_Name => Make_Identifier (Loc, Name_uPriority)));
12773 New_Reference_To (RTE (RE_Unspecified_Priority), Loc));
12776 -- Optional Stack parameter
12778 if Restricted_Profile then
12780 -- If the stack has been preallocated by the expander then
12781 -- pass its address. Otherwise, pass a null address.
12783 if Preallocated_Stacks_On_Target then
12785 Make_Attribute_Reference (Loc,
12787 Make_Selected_Component (Loc,
12788 Prefix => Make_Identifier (Loc, Name_uInit),
12789 Selector_Name => Make_Identifier (Loc, Name_uStack)),
12790 Attribute_Name => Name_Address));
12794 New_Reference_To (RTE (RE_Null_Address), Loc));
12798 -- Size parameter. If no Storage_Size pragma is present, then
12799 -- the size is taken from the taskZ variable for the type, which
12800 -- is either Unspecified_Size, or has been reset by the use of
12801 -- a Storage_Size attribute definition clause. If a pragma is
12802 -- present, then the size is taken from the _Size field of the
12803 -- task value record, which was set from the pragma value.
12806 and then Has_Storage_Size_Pragma (Tdef)
12809 Make_Selected_Component (Loc,
12810 Prefix => Make_Identifier (Loc, Name_uInit),
12811 Selector_Name => Make_Identifier (Loc, Name_uSize)));
12815 New_Reference_To (Storage_Size_Variable (Ttyp), Loc));
12818 -- Task_Info parameter. Set to Unspecified_Task_Info unless there is a
12819 -- Task_Info pragma, in which case we take the value from the pragma.
12822 and then Has_Task_Info_Pragma (Tdef)
12825 Make_Selected_Component (Loc,
12826 Prefix => Make_Identifier (Loc, Name_uInit),
12827 Selector_Name => Make_Identifier (Loc, Name_uTask_Info)));
12831 New_Reference_To (RTE (RE_Unspecified_Task_Info), Loc));
12834 -- CPU parameter. Set to Unspecified_CPU unless there is a CPU pragma,
12835 -- in which case we take the value from the pragma. The parameter is
12836 -- passed as an Integer because in the case of unspecified CPU the
12837 -- value is not in the range of CPU_Range.
12839 if Present (Tdef) and then Has_Pragma_CPU (Tdef) then
12841 Convert_To (Standard_Integer,
12842 Make_Selected_Component (Loc,
12843 Prefix => Make_Identifier (Loc, Name_uInit),
12844 Selector_Name => Make_Identifier (Loc, Name_uCPU))));
12848 New_Reference_To (RTE (RE_Unspecified_CPU), Loc));
12851 if not Restricted_Profile then
12853 -- Deadline parameter. If no Relative_Deadline pragma is present,
12854 -- then the deadline is Time_Span_Zero. If a pragma is present, then
12855 -- the deadline is taken from the _Relative_Deadline field of the
12856 -- task value record, which was set from the pragma value. Note that
12857 -- this parameter must not be generated for the restricted profiles
12858 -- since Ravenscar does not allow deadlines.
12860 -- Case where pragma Relative_Deadline applies: use given value
12862 if Present (Tdef) and then Has_Relative_Deadline_Pragma (Tdef) then
12864 Make_Selected_Component (Loc,
12866 Make_Identifier (Loc, Name_uInit),
12868 Make_Identifier (Loc, Name_uRelative_Deadline)));
12870 -- No pragma Relative_Deadline apply to the task
12874 New_Reference_To (RTE (RE_Time_Span_Zero), Loc));
12877 -- Dispatching_Domain parameter. If no Dispatching_Domain pragma or
12878 -- aspect is present, then the dispatching domain is null. If a
12879 -- pragma or aspect is present, then the dispatching domain is taken
12880 -- from the _Dispatching_Domain field of the task value record,
12881 -- which was set from the pragma value. Note that this parameter
12882 -- must not be generated for the restricted profiles since Ravenscar
12883 -- does not allow dispatching domains.
12885 -- Case where pragma or aspect Dispatching_Domain applies: use given
12888 if Present (Tdef) and then Has_Pragma_Dispatching_Domain (Tdef) then
12890 Make_Selected_Component (Loc,
12892 Make_Identifier (Loc, Name_uInit),
12894 Make_Identifier (Loc, Name_uDispatching_Domain)));
12896 -- No pragma or aspect Dispatching_Domain apply to the task
12899 Append_To (Args, Make_Null (Loc));
12902 -- Number of entries. This is an expression of the form:
12904 -- n + _Init.a'Length + _Init.a'B'Length + ...
12906 -- where a,b... are the entry family names for the task definition
12909 Build_Entry_Count_Expression
12914 (Parent (Corresponding_Record_Type (Ttyp))))),
12916 Append_To (Args, Ecount);
12918 -- Master parameter. This is a reference to the _Master parameter of
12919 -- the initialization procedure, except in the case of the pragma
12920 -- Restrictions (No_Task_Hierarchy) where the value is fixed to
12921 -- System.Tasking.Library_Task_Level.
12923 if Restriction_Active (No_Task_Hierarchy) = False then
12924 Append_To (Args, Make_Identifier (Loc, Name_uMaster));
12927 New_Occurrence_Of (RTE (RE_Library_Task_Level), Loc));
12931 -- State parameter. This is a pointer to the task body procedure. The
12932 -- required value is obtained by taking 'Unrestricted_Access of the task
12933 -- body procedure and converting it (with an unchecked conversion) to
12934 -- the type required by the task kernel. For further details, see the
12935 -- description of Expand_N_Task_Body. We use 'Unrestricted_Access rather
12936 -- than 'Address in order to avoid creating trampolines.
12939 Body_Proc : constant Node_Id := Get_Task_Body_Procedure (Ttyp);
12940 Subp_Ptr_Typ : constant Node_Id :=
12941 Create_Itype (E_Access_Subprogram_Type, Tdec);
12942 Ref : constant Node_Id := Make_Itype_Reference (Loc);
12945 Set_Directly_Designated_Type (Subp_Ptr_Typ, Body_Proc);
12946 Set_Etype (Subp_Ptr_Typ, Subp_Ptr_Typ);
12948 -- Be sure to freeze a reference to the access-to-subprogram type,
12949 -- otherwise gigi will complain that it's in the wrong scope, because
12950 -- it's actually inside the init procedure for the record type that
12951 -- corresponds to the task type.
12953 -- This processing is causing a crash in the .NET/JVM back ends that
12954 -- is not yet understood, so skip it in these cases ???
12956 if VM_Target = No_VM then
12957 Set_Itype (Ref, Subp_Ptr_Typ);
12958 Append_Freeze_Action (Task_Rec, Ref);
12961 Unchecked_Convert_To (RTE (RE_Task_Procedure_Access),
12962 Make_Qualified_Expression (Loc,
12963 Subtype_Mark => New_Reference_To (Subp_Ptr_Typ, Loc),
12965 Make_Attribute_Reference (Loc,
12967 New_Occurrence_Of (Body_Proc, Loc),
12968 Attribute_Name => Name_Unrestricted_Access))));
12970 -- For the .NET/JVM cases revert to the original code below ???
12974 Unchecked_Convert_To (RTE (RE_Task_Procedure_Access),
12975 Make_Attribute_Reference (Loc,
12977 New_Occurrence_Of (Body_Proc, Loc),
12978 Attribute_Name => Name_Address)));
12982 -- Discriminants parameter. This is just the address of the task
12983 -- value record itself (which contains the discriminant values
12986 Make_Attribute_Reference (Loc,
12987 Prefix => Make_Identifier (Loc, Name_uInit),
12988 Attribute_Name => Name_Address));
12990 -- Elaborated parameter. This is an access to the elaboration Boolean
12993 Make_Attribute_Reference (Loc,
12994 Prefix => Make_Identifier (Loc, New_External_Name (Tnam, 'E')),
12995 Attribute_Name => Name_Unchecked_Access));
12997 -- Chain parameter. This is a reference to the _Chain parameter of
12998 -- the initialization procedure.
13000 Append_To (Args, Make_Identifier (Loc, Name_uChain));
13002 -- Task name parameter. Take this from the _Task_Id parameter to the
13003 -- init call unless there is a Task_Name pragma, in which case we take
13004 -- the value from the pragma.
13007 and then Has_Task_Name_Pragma (Tdef)
13009 -- Copy expression in full, because it may be dynamic and have
13015 (Pragma_Argument_Associations
13016 (Find_Task_Or_Protected_Pragma
13017 (Tdef, Name_Task_Name))))));
13020 Append_To (Args, Make_Identifier (Loc, Name_uTask_Name));
13023 -- Created_Task parameter. This is the _Task_Id field of the task
13027 Make_Selected_Component (Loc,
13028 Prefix => Make_Identifier (Loc, Name_uInit),
13029 Selector_Name => Make_Identifier (Loc, Name_uTask_Id)));
13031 -- Build_Entry_Names generation flag. When set to true, the runtime
13032 -- will allocate an array to hold the string names of task entries.
13034 if not Restricted_Profile then
13035 if Has_Entries (Ttyp)
13036 and then Entry_Names_OK
13038 Append_To (Args, New_Reference_To (Standard_True, Loc));
13040 Append_To (Args, New_Reference_To (Standard_False, Loc));
13044 if Restricted_Profile then
13045 Name := New_Reference_To (RTE (RE_Create_Restricted_Task), Loc);
13047 Name := New_Reference_To (RTE (RE_Create_Task), Loc);
13051 Make_Procedure_Call_Statement (Loc,
13053 Parameter_Associations => Args);
13054 end Make_Task_Create_Call;
13056 ------------------------------
13057 -- Next_Protected_Operation --
13058 ------------------------------
13060 function Next_Protected_Operation (N : Node_Id) return Node_Id is
13064 Next_Op := Next (N);
13065 while Present (Next_Op)
13066 and then not Nkind_In (Next_Op, N_Subprogram_Body, N_Entry_Body)
13072 end Next_Protected_Operation;
13074 ---------------------
13075 -- Null_Statements --
13076 ---------------------
13078 function Null_Statements (Stats : List_Id) return Boolean is
13082 Stmt := First (Stats);
13083 while Nkind (Stmt) /= N_Empty
13084 and then (Nkind_In (Stmt, N_Null_Statement, N_Label)
13086 (Nkind (Stmt) = N_Pragma
13087 and then (Pragma_Name (Stmt) = Name_Unreferenced
13089 Pragma_Name (Stmt) = Name_Unmodified
13091 Pragma_Name (Stmt) = Name_Warnings)))
13096 return Nkind (Stmt) = N_Empty;
13097 end Null_Statements;
13099 --------------------------
13100 -- Parameter_Block_Pack --
13101 --------------------------
13103 function Parameter_Block_Pack
13105 Blk_Typ : Entity_Id;
13109 Stmts : List_Id) return Node_Id
13111 Actual : Entity_Id;
13112 Expr : Node_Id := Empty;
13113 Formal : Entity_Id;
13114 Has_Param : Boolean := False;
13117 Temp_Asn : Node_Id;
13118 Temp_Nam : Node_Id;
13121 Actual := First (Actuals);
13122 Formal := Defining_Identifier (First (Formals));
13123 Params := New_List;
13125 while Present (Actual) loop
13126 if Is_By_Copy_Type (Etype (Actual)) then
13128 -- Jnn : aliased <formal-type>
13130 Temp_Nam := Make_Temporary (Loc, 'J');
13133 Make_Object_Declaration (Loc,
13136 Defining_Identifier =>
13138 Object_Definition =>
13139 New_Reference_To (Etype (Formal), Loc)));
13141 if Ekind (Formal) /= E_Out_Parameter then
13147 New_Reference_To (Temp_Nam, Loc);
13149 Set_Assignment_OK (Temp_Asn);
13152 Make_Assignment_Statement (Loc,
13156 New_Copy_Tree (Actual)));
13160 -- Jnn'unchecked_access
13163 Make_Attribute_Reference (Loc,
13165 Name_Unchecked_Access,
13167 New_Reference_To (Temp_Nam, Loc)));
13171 -- The controlling parameter is omitted
13174 if not Is_Controlling_Actual (Actual) then
13176 Make_Reference (Loc, New_Copy_Tree (Actual)));
13182 Next_Actual (Actual);
13183 Next_Formal_With_Extras (Formal);
13187 Expr := Make_Aggregate (Loc, Params);
13192 -- J1'unchecked_access;
13193 -- <actual2>'reference;
13196 P := Make_Temporary (Loc, 'P');
13199 Make_Object_Declaration (Loc,
13200 Defining_Identifier =>
13202 Object_Definition =>
13203 New_Reference_To (Blk_Typ, Loc),
13208 end Parameter_Block_Pack;
13210 ----------------------------
13211 -- Parameter_Block_Unpack --
13212 ----------------------------
13214 function Parameter_Block_Unpack
13218 Formals : List_Id) return List_Id
13220 Actual : Entity_Id;
13222 Formal : Entity_Id;
13223 Has_Asnmt : Boolean := False;
13224 Result : constant List_Id := New_List;
13227 Actual := First (Actuals);
13228 Formal := Defining_Identifier (First (Formals));
13229 while Present (Actual) loop
13230 if Is_By_Copy_Type (Etype (Actual))
13231 and then Ekind (Formal) /= E_In_Parameter
13234 -- <actual> := P.<formal>;
13237 Make_Assignment_Statement (Loc,
13241 Make_Explicit_Dereference (Loc,
13242 Make_Selected_Component (Loc,
13244 New_Reference_To (P, Loc),
13246 Make_Identifier (Loc, Chars (Formal)))));
13248 Set_Assignment_OK (Name (Asnmt));
13249 Append_To (Result, Asnmt);
13254 Next_Actual (Actual);
13255 Next_Formal_With_Extras (Formal);
13261 return New_List (Make_Null_Statement (Loc));
13263 end Parameter_Block_Unpack;
13265 ----------------------
13266 -- Set_Discriminals --
13267 ----------------------
13269 procedure Set_Discriminals (Dec : Node_Id) is
13272 D_Minal : Entity_Id;
13275 pragma Assert (Nkind (Dec) = N_Protected_Type_Declaration);
13276 Pdef := Defining_Identifier (Dec);
13278 if Has_Discriminants (Pdef) then
13279 D := First_Discriminant (Pdef);
13280 while Present (D) loop
13282 Make_Defining_Identifier (Sloc (D),
13283 Chars => New_External_Name (Chars (D), 'D'));
13285 Set_Ekind (D_Minal, E_Constant);
13286 Set_Etype (D_Minal, Etype (D));
13287 Set_Scope (D_Minal, Pdef);
13288 Set_Discriminal (D, D_Minal);
13289 Set_Discriminal_Link (D_Minal, D);
13291 Next_Discriminant (D);
13294 end Set_Discriminals;
13296 -----------------------
13297 -- Trivial_Accept_OK --
13298 -----------------------
13300 function Trivial_Accept_OK return Boolean is
13302 case Opt.Task_Dispatching_Policy is
13304 -- If we have the default task dispatching policy in effect, we can
13305 -- definitely do the optimization (one way of looking at this is to
13306 -- think of the formal definition of the default policy being allowed
13307 -- to run any task it likes after a rendezvous, so even if notionally
13308 -- a full rescheduling occurs, we can say that our dispatching policy
13309 -- (i.e. the default dispatching policy) reorders the queue to be the
13310 -- same as just before the call.
13315 -- FIFO_Within_Priorities certainly does not permit this
13316 -- optimization since the Rendezvous is a scheduling action that may
13317 -- require some other task to be run.
13322 -- For now, disallow the optimization for all other policies. This
13323 -- may be over-conservative, but it is certainly not incorrect.
13329 end Trivial_Accept_OK;