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
851 -- Loop to find enclosing construct containing activation chain variable
852 -- The construct is a body, a block, or an extended return.
856 while not Nkind_In (P, N_Subprogram_Body,
858 N_Package_Declaration,
862 N_Extended_Return_Statement)
867 -- If we are in a package body, the activation chain variable is
868 -- declared in the body, but the Activation_Chain_Entity is attached
871 if Nkind (P) = N_Package_Body then
872 Decls := Declarations (P);
873 P := Unit_Declaration_Node (Corresponding_Spec (P));
875 elsif Nkind (P) = N_Package_Declaration then
876 Decls := Visible_Declarations (Specification (P));
878 elsif Nkind (P) = N_Extended_Return_Statement then
879 Decls := Return_Object_Declarations (P);
882 Decls := Declarations (P);
885 -- If activation chain entity not already declared, declare it
887 if Nkind (P) = N_Extended_Return_Statement
888 or else No (Activation_Chain_Entity (P))
890 Chain := Make_Defining_Identifier (Sloc (N), Name_uChain);
892 -- Note: An extended return statement is not really a task activator,
893 -- but it does have an activation chain on which to store the tasks
894 -- temporarily. On successful return, the tasks on this chain are
895 -- moved to the chain passed in by the caller. We do not build an
896 -- Activation_Chain_Entity for an N_Extended_Return_Statement,
897 -- because we do not want to build a call to Activate_Tasks. Task
898 -- activation is the responsibility of the caller.
900 if Nkind (P) /= N_Extended_Return_Statement then
901 Set_Activation_Chain_Entity (P, Chain);
905 Make_Object_Declaration (Sloc (P),
906 Defining_Identifier => Chain,
907 Aliased_Present => True,
909 New_Reference_To (RTE (RE_Activation_Chain), Sloc (P))));
911 Analyze (First (Decls));
913 end Build_Activation_Chain_Entity;
915 ----------------------------
916 -- Build_Barrier_Function --
917 ----------------------------
919 function Build_Barrier_Function
922 Pid : Node_Id) return Node_Id
924 Ent_Formals : constant Node_Id := Entry_Body_Formal_Part (N);
925 Cond : constant Node_Id := Condition (Ent_Formals);
926 Loc : constant Source_Ptr := Sloc (Cond);
927 Func_Id : constant Entity_Id := Barrier_Function (Ent);
928 Op_Decls : constant List_Id := New_List;
933 -- Add a declaration for the Protection object, renaming declarations
934 -- for the discriminals and privals and finally a declaration for the
935 -- entry family index (if applicable).
937 Install_Private_Data_Declarations (Sloc (N),
943 Family => Ekind (Ent) = E_Entry_Family);
945 -- If compiling with -fpreserve-control-flow, make sure we insert an
946 -- IF statement so that the back-end knows to generate a conditional
947 -- branch instruction, even if the condition is just the name of a
950 if Opt.Suppress_Control_Flow_Optimizations then
951 Stmt := Make_Implicit_If_Statement (Cond,
953 Then_Statements => New_List (
954 Make_Simple_Return_Statement (Loc,
955 New_Occurrence_Of (Standard_True, Loc))),
956 Else_Statements => New_List (
957 Make_Simple_Return_Statement (Loc,
958 New_Occurrence_Of (Standard_False, Loc))));
961 Stmt := Make_Simple_Return_Statement (Loc, Cond);
964 -- Note: the condition in the barrier function needs to be properly
965 -- processed for the C/Fortran boolean possibility, but this happens
966 -- automatically since the return statement does this normalization.
969 Make_Subprogram_Body (Loc,
971 Build_Barrier_Function_Specification (Loc,
972 Make_Defining_Identifier (Loc, Chars (Func_Id))),
973 Declarations => Op_Decls,
974 Handled_Statement_Sequence =>
975 Make_Handled_Sequence_Of_Statements (Loc,
976 Statements => New_List (Stmt)));
977 Set_Is_Entry_Barrier_Function (Func_Body);
980 end Build_Barrier_Function;
982 ------------------------------------------
983 -- Build_Barrier_Function_Specification --
984 ------------------------------------------
986 function Build_Barrier_Function_Specification
988 Def_Id : Entity_Id) return Node_Id
991 Set_Debug_Info_Needed (Def_Id);
993 return Make_Function_Specification (Loc,
994 Defining_Unit_Name => Def_Id,
995 Parameter_Specifications => New_List (
996 Make_Parameter_Specification (Loc,
997 Defining_Identifier =>
998 Make_Defining_Identifier (Loc, Name_uO),
1000 New_Reference_To (RTE (RE_Address), Loc)),
1002 Make_Parameter_Specification (Loc,
1003 Defining_Identifier =>
1004 Make_Defining_Identifier (Loc, Name_uE),
1006 New_Reference_To (RTE (RE_Protected_Entry_Index), Loc))),
1008 Result_Definition =>
1009 New_Reference_To (Standard_Boolean, Loc));
1010 end Build_Barrier_Function_Specification;
1012 --------------------------
1013 -- Build_Call_With_Task --
1014 --------------------------
1016 function Build_Call_With_Task
1018 E : Entity_Id) return Node_Id
1020 Loc : constant Source_Ptr := Sloc (N);
1023 Make_Function_Call (Loc,
1024 Name => New_Reference_To (E, Loc),
1025 Parameter_Associations => New_List (Concurrent_Ref (N)));
1026 end Build_Call_With_Task;
1028 --------------------------------
1029 -- Build_Corresponding_Record --
1030 --------------------------------
1032 function Build_Corresponding_Record
1035 Loc : Source_Ptr) return Node_Id
1037 Rec_Ent : constant Entity_Id :=
1038 Make_Defining_Identifier
1039 (Loc, New_External_Name (Chars (Ctyp), 'V'));
1042 New_Disc : Entity_Id;
1046 Set_Corresponding_Record_Type (Ctyp, Rec_Ent);
1047 Set_Ekind (Rec_Ent, E_Record_Type);
1048 Set_Has_Delayed_Freeze (Rec_Ent, Has_Delayed_Freeze (Ctyp));
1049 Set_Is_Concurrent_Record_Type (Rec_Ent, True);
1050 Set_Corresponding_Concurrent_Type (Rec_Ent, Ctyp);
1051 Set_Stored_Constraint (Rec_Ent, No_Elist);
1054 -- Use discriminals to create list of discriminants for record, and
1055 -- create new discriminals for use in default expressions, etc. It is
1056 -- worth noting that a task discriminant gives rise to 5 entities;
1058 -- a) The original discriminant.
1059 -- b) The discriminal for use in the task.
1060 -- c) The discriminant of the corresponding record.
1061 -- d) The discriminal for the init proc of the corresponding record.
1062 -- e) The local variable that renames the discriminant in the procedure
1063 -- for the task body.
1065 -- In fact the discriminals b) are used in the renaming declarations
1066 -- for e). See details in einfo (Handling of Discriminants).
1068 if Present (Discriminant_Specifications (N)) then
1070 Disc := First_Discriminant (Ctyp);
1072 while Present (Disc) loop
1073 New_Disc := CR_Discriminant (Disc);
1076 Make_Discriminant_Specification (Loc,
1077 Defining_Identifier => New_Disc,
1078 Discriminant_Type =>
1079 New_Occurrence_Of (Etype (Disc), Loc),
1081 New_Copy (Discriminant_Default_Value (Disc))));
1083 Next_Discriminant (Disc);
1090 -- Now we can construct the record type declaration. Note that this
1091 -- record is "limited tagged". It is "limited" to reflect the underlying
1092 -- limitedness of the task or protected object that it represents, and
1093 -- ensuring for example that it is properly passed by reference. It is
1094 -- "tagged" to give support to dispatching calls through interfaces. We
1095 -- propagate here the list of interfaces covered by the concurrent type
1096 -- (Ada 2005: AI-345).
1099 Make_Full_Type_Declaration (Loc,
1100 Defining_Identifier => Rec_Ent,
1101 Discriminant_Specifications => Dlist,
1103 Make_Record_Definition (Loc,
1105 Make_Component_List (Loc,
1106 Component_Items => Cdecls),
1108 Ada_Version >= Ada_2005 and then Is_Tagged_Type (Ctyp),
1109 Interface_List => Interface_List (N),
1110 Limited_Present => True));
1111 end Build_Corresponding_Record;
1113 ----------------------------------
1114 -- Build_Entry_Count_Expression --
1115 ----------------------------------
1117 function Build_Entry_Count_Expression
1118 (Concurrent_Type : Node_Id;
1119 Component_List : List_Id;
1120 Loc : Source_Ptr) return Node_Id
1132 -- Count number of non-family entries
1135 Ent := First_Entity (Concurrent_Type);
1136 while Present (Ent) loop
1137 if Ekind (Ent) = E_Entry then
1144 Ecount := Make_Integer_Literal (Loc, Eindx);
1146 -- Loop through entry families building the addition nodes
1148 Ent := First_Entity (Concurrent_Type);
1149 Comp := First (Component_List);
1150 while Present (Ent) loop
1151 if Ekind (Ent) = E_Entry_Family then
1152 while Chars (Ent) /= Chars (Defining_Identifier (Comp)) loop
1156 Typ := Etype (Discrete_Subtype_Definition (Parent (Ent)));
1157 Hi := Type_High_Bound (Typ);
1158 Lo := Type_Low_Bound (Typ);
1159 Large := Is_Potentially_Large_Family
1160 (Base_Type (Typ), Concurrent_Type, Lo, Hi);
1163 Left_Opnd => Ecount,
1164 Right_Opnd => Family_Size
1165 (Loc, Hi, Lo, Concurrent_Type, Large));
1172 end Build_Entry_Count_Expression;
1174 -----------------------
1175 -- Build_Entry_Names --
1176 -----------------------
1178 function Build_Entry_Names (Conc_Typ : Entity_Id) return Node_Id is
1179 Loc : constant Source_Ptr := Sloc (Conc_Typ);
1185 Typ : Entity_Id := Conc_Typ;
1187 procedure Build_Entry_Family_Name (Id : Entity_Id);
1189 -- for Lnn in Family_Low .. Family_High loop
1192 -- (_init._object <or> _init._task_id,
1194 -- new String ("<Entry name>(" & Lnn'Img & ")"));
1196 -- Note that the bounds of the range may reference discriminants. The
1197 -- above construct is added directly to the statements of the block.
1199 procedure Build_Entry_Name (Id : Entity_Id);
1203 -- (_init._object <or>_init._task_id,
1205 -- new String ("<Entry name>");
1206 -- The above construct is added directly to the statements of the block.
1208 function Build_Set_Entry_Name_Call (Arg3 : Node_Id) return Node_Id;
1209 -- Generate the call to the runtime routine Set_Entry_Name with actuals
1210 -- _init._task_id or _init._object, Inn and Arg3.
1212 procedure Increment_Index (Stmts : List_Id);
1213 -- Generate the following and add it to Stmts
1216 -----------------------------
1217 -- Build_Entry_Family_Name --
1218 -----------------------------
1220 procedure Build_Entry_Family_Name (Id : Entity_Id) is
1221 Def : constant Node_Id :=
1222 Discrete_Subtype_Definition (Parent (Id));
1223 L_Id : constant Entity_Id := Make_Temporary (Loc, 'L');
1224 L_Stmts : constant List_Id := New_List;
1227 function Build_Range (Def : Node_Id) return Node_Id;
1228 -- Given a discrete subtype definition of an entry family, generate a
1229 -- range node which covers the range of Def's type.
1235 function Build_Range (Def : Node_Id) return Node_Id is
1236 High : Node_Id := Type_High_Bound (Etype (Def));
1237 Low : Node_Id := Type_Low_Bound (Etype (Def));
1240 -- If a bound references a discriminant, generate an identifier
1241 -- with the same name. Resolution will map it to the formals of
1244 if Is_Entity_Name (Low)
1245 and then Ekind (Entity (Low)) = E_Discriminant
1247 Low := Make_Identifier (Loc, Chars (Low));
1249 Low := New_Copy_Tree (Low);
1252 if Is_Entity_Name (High)
1253 and then Ekind (Entity (High)) = E_Discriminant
1255 High := Make_Identifier (Loc, Chars (High));
1257 High := New_Copy_Tree (High);
1263 High_Bound => High);
1266 -- Start of processing for Build_Entry_Family_Name
1269 Get_Name_String (Chars (Id));
1271 -- Add a leading '('
1273 Add_Char_To_Name_Buffer ('(');
1276 -- new String'("<Entry name>(" & Lnn'Img & ")");
1278 -- This is an implicit heap allocation, and Comes_From_Source is
1279 -- False, which ensures that it will get flagged as a violation of
1280 -- No_Implicit_Heap_Allocations when that restriction applies.
1283 Make_Allocator (Loc,
1284 Make_Qualified_Expression (Loc,
1286 New_Reference_To (Standard_String, Loc),
1288 Make_Op_Concat (Loc,
1290 Make_Op_Concat (Loc,
1292 Make_String_Literal (Loc,
1293 Strval => String_From_Name_Buffer),
1295 Make_Attribute_Reference (Loc,
1297 New_Reference_To (L_Id, Loc),
1298 Attribute_Name => Name_Img)),
1300 Make_String_Literal (Loc,
1303 Increment_Index (L_Stmts);
1304 Append_To (L_Stmts, Build_Set_Entry_Name_Call (Val));
1307 -- for Lnn in Family_Low .. Family_High loop
1310 -- (_init._object <or> _init._task_id, Inn, <Val>);
1314 Make_Loop_Statement (Loc,
1316 Make_Iteration_Scheme (Loc,
1317 Loop_Parameter_Specification =>
1318 Make_Loop_Parameter_Specification (Loc,
1319 Defining_Identifier => L_Id,
1320 Discrete_Subtype_Definition => Build_Range (Def))),
1321 Statements => L_Stmts,
1322 End_Label => Empty));
1323 end Build_Entry_Family_Name;
1325 ----------------------
1326 -- Build_Entry_Name --
1327 ----------------------
1329 procedure Build_Entry_Name (Id : Entity_Id) is
1333 Get_Name_String (Chars (Id));
1335 -- This is an implicit heap allocation, and Comes_From_Source is
1336 -- False, which ensures that it will get flagged as a violation of
1337 -- No_Implicit_Heap_Allocations when that restriction applies.
1340 Make_Allocator (Loc,
1341 Make_Qualified_Expression (Loc,
1343 New_Reference_To (Standard_String, Loc),
1345 Make_String_Literal (Loc,
1346 String_From_Name_Buffer)));
1348 Increment_Index (B_Stmts);
1349 Append_To (B_Stmts, Build_Set_Entry_Name_Call (Val));
1350 end Build_Entry_Name;
1352 -------------------------------
1353 -- Build_Set_Entry_Name_Call --
1354 -------------------------------
1356 function Build_Set_Entry_Name_Call (Arg3 : Node_Id) return Node_Id is
1361 -- Determine the proper name for the first argument and the RTS
1364 if Is_Protected_Type (Typ) then
1365 Arg1 := Name_uObject;
1366 Proc := RO_PE_Set_Entry_Name;
1368 else pragma Assert (Is_Task_Type (Typ));
1369 Arg1 := Name_uTask_Id;
1370 Proc := RO_TS_Set_Entry_Name;
1374 -- Set_Entry_Name (_init.Arg1, Inn, Arg3);
1377 Make_Procedure_Call_Statement (Loc,
1379 New_Reference_To (RTE (Proc), Loc),
1380 Parameter_Associations => New_List (
1381 Make_Selected_Component (Loc, -- _init._object
1382 Prefix => -- _init._task_id
1383 Make_Identifier (Loc, Name_uInit),
1385 Make_Identifier (Loc, Arg1)),
1386 New_Reference_To (Index, Loc), -- Inn
1388 end Build_Set_Entry_Name_Call;
1390 ---------------------
1391 -- Increment_Index --
1392 ---------------------
1394 procedure Increment_Index (Stmts : List_Id) is
1400 Make_Assignment_Statement (Loc,
1402 New_Reference_To (Index, Loc),
1406 New_Reference_To (Index, Loc),
1408 Make_Integer_Literal (Loc, 1))));
1409 end Increment_Index;
1411 -- Start of processing for Build_Entry_Names
1414 -- Retrieve the original concurrent type
1416 if Is_Concurrent_Record_Type (Typ) then
1417 Typ := Corresponding_Concurrent_Type (Typ);
1420 pragma Assert (Is_Protected_Type (Typ) or else Is_Task_Type (Typ));
1422 -- Nothing to do if the type has no entries
1424 if not Has_Entries (Typ) then
1428 -- Avoid generating entry names for a protected type with only one entry
1430 if Is_Protected_Type (Typ)
1431 and then Find_Protection_Type (Typ) /= RTE (RE_Protection_Entries)
1436 Index := Make_Temporary (Loc, 'I');
1438 -- Step 1: Generate the declaration of the index variable:
1439 -- Inn : Protected_Entry_Index := 0;
1441 -- Inn : Task_Entry_Index := 0;
1443 if Is_Protected_Type (Typ) then
1444 Index_Typ := RE_Protected_Entry_Index;
1446 Index_Typ := RE_Task_Entry_Index;
1449 B_Decls := New_List;
1451 Make_Object_Declaration (Loc,
1452 Defining_Identifier => Index,
1453 Object_Definition => New_Reference_To (RTE (Index_Typ), Loc),
1454 Expression => Make_Integer_Literal (Loc, 0)));
1456 B_Stmts := New_List;
1458 -- Step 2: Generate a call to Set_Entry_Name for each entry and entry
1461 Comp := First_Entity (Typ);
1462 while Present (Comp) loop
1463 if Ekind (Comp) = E_Entry then
1464 Build_Entry_Name (Comp);
1466 elsif Ekind (Comp) = E_Entry_Family then
1467 Build_Entry_Family_Name (Comp);
1473 -- Step 3: Wrap the statements in a block
1476 Make_Block_Statement (Loc,
1477 Declarations => B_Decls,
1478 Handled_Statement_Sequence =>
1479 Make_Handled_Sequence_Of_Statements (Loc,
1480 Statements => B_Stmts));
1481 end Build_Entry_Names;
1483 ---------------------------
1484 -- Build_Parameter_Block --
1485 ---------------------------
1487 function Build_Parameter_Block
1491 Decls : List_Id) return Entity_Id
1497 Has_Comp : Boolean := False;
1501 Actual := First (Actuals);
1503 Formal := Defining_Identifier (First (Formals));
1505 while Present (Actual) loop
1506 if not Is_Controlling_Actual (Actual) then
1509 -- type Ann is access all <actual-type>
1511 Comp_Nam := Make_Temporary (Loc, 'A');
1514 Make_Full_Type_Declaration (Loc,
1515 Defining_Identifier => Comp_Nam,
1517 Make_Access_To_Object_Definition (Loc,
1518 All_Present => True,
1519 Constant_Present => Ekind (Formal) = E_In_Parameter,
1520 Subtype_Indication =>
1521 New_Reference_To (Etype (Actual), Loc))));
1527 Make_Component_Declaration (Loc,
1528 Defining_Identifier =>
1529 Make_Defining_Identifier (Loc, Chars (Formal)),
1530 Component_Definition =>
1531 Make_Component_Definition (Loc,
1534 Subtype_Indication =>
1535 New_Reference_To (Comp_Nam, Loc))));
1540 Next_Actual (Actual);
1541 Next_Formal_With_Extras (Formal);
1544 Rec_Nam := Make_Temporary (Loc, 'P');
1549 -- type Pnn is record
1554 -- where Pnn is a parameter wrapping record, Param1 .. ParamN are
1555 -- the original parameter names and Ann1 .. AnnN are the access to
1559 Make_Full_Type_Declaration (Loc,
1560 Defining_Identifier =>
1563 Make_Record_Definition (Loc,
1565 Make_Component_List (Loc, Comps))));
1568 -- type Pnn is null record;
1571 Make_Full_Type_Declaration (Loc,
1572 Defining_Identifier =>
1575 Make_Record_Definition (Loc,
1576 Null_Present => True,
1577 Component_List => Empty)));
1581 end Build_Parameter_Block;
1583 --------------------------------------
1584 -- Build_Renamed_Formal_Declaration --
1585 --------------------------------------
1587 function Build_Renamed_Formal_Declaration
1591 Renamed_Formal : Node_Id) return Node_Id
1593 Loc : constant Source_Ptr := Sloc (New_F);
1597 -- If the formal is a tagged incomplete type, it is already passed
1598 -- by reference, so it is sufficient to rename the pointer component
1599 -- that corresponds to the actual. Otherwise we need to dereference
1600 -- the pointer component to obtain the actual.
1602 if Is_Incomplete_Type (Etype (Formal))
1603 and then Is_Tagged_Type (Etype (Formal))
1606 Make_Object_Renaming_Declaration (Loc,
1607 Defining_Identifier => New_F,
1608 Subtype_Mark => New_Reference_To (Etype (Comp), Loc),
1609 Name => Renamed_Formal);
1613 Make_Object_Renaming_Declaration (Loc,
1614 Defining_Identifier => New_F,
1615 Subtype_Mark => New_Reference_To (Etype (Formal), Loc),
1617 Make_Explicit_Dereference (Loc, Renamed_Formal));
1621 end Build_Renamed_Formal_Declaration;
1623 -----------------------
1624 -- Build_PPC_Wrapper --
1625 -----------------------
1627 procedure Build_PPC_Wrapper (E : Entity_Id; Decl : Node_Id) is
1628 Loc : constant Source_Ptr := Sloc (E);
1629 Synch_Type : constant Entity_Id := Scope (E);
1631 Wrapper_Id : constant Entity_Id :=
1632 Make_Defining_Identifier (Loc,
1633 Chars => New_External_Name (Chars (E), 'E'));
1634 -- the wrapper procedure name
1636 Wrapper_Body : Node_Id;
1638 Synch_Id : constant Entity_Id :=
1639 Make_Defining_Identifier (Loc,
1640 Chars => New_External_Name (Chars (Scope (E)), 'A'));
1641 -- The parameter that designates the synchronized object in the call
1643 Actuals : constant List_Id := New_List;
1644 -- the actuals in the entry call.
1646 Decls : constant List_Id := New_List;
1648 Entry_Call : Node_Id;
1649 Entry_Name : Node_Id;
1652 -- The specification of the wrapper procedure
1656 -- Only build the wrapper if entry has pre/postconditions.
1657 -- Should this be done unconditionally instead ???
1663 P := Spec_PPC_List (Contract (E));
1668 -- Transfer ppc pragmas to the declarations of the wrapper
1670 while Present (P) loop
1671 if Pragma_Name (P) = Name_Precondition
1672 or else Pragma_Name (P) = Name_Postcondition
1674 Append (Relocate_Node (P), Decls);
1675 Set_Analyzed (Last (Decls), False);
1678 P := Next_Pragma (P);
1682 -- First formal is synchronized object
1685 Make_Parameter_Specification (Loc,
1686 Defining_Identifier => Synch_Id,
1687 Out_Present => True,
1689 Parameter_Type => New_Occurrence_Of (Scope (E), Loc)));
1692 Make_Selected_Component (Loc,
1693 Prefix => New_Occurrence_Of (Synch_Id, Loc),
1694 Selector_Name => New_Occurrence_Of (E, Loc));
1696 -- If entity is entry family, second formal is the corresponding index,
1697 -- and entry name is an indexed component.
1699 if Ekind (E) = E_Entry_Family then
1701 Index : constant Entity_Id :=
1702 Make_Defining_Identifier (Loc, Name_I);
1705 Make_Parameter_Specification (Loc,
1706 Defining_Identifier => Index,
1708 New_Occurrence_Of (Entry_Index_Type (E), Loc)));
1711 Make_Indexed_Component (Loc,
1712 Prefix => Entry_Name,
1713 Expressions => New_List (New_Occurrence_Of (Index, Loc)));
1718 Make_Procedure_Call_Statement (Loc,
1720 Parameter_Associations => Actuals);
1722 -- Now add formals that match those of the entry, and build actuals for
1723 -- the nested entry call.
1727 New_Form : Entity_Id;
1728 Parm_Spec : Node_Id;
1731 Form := First_Formal (E);
1732 while Present (Form) loop
1733 New_Form := Make_Defining_Identifier (Loc, Chars (Form));
1735 Make_Parameter_Specification (Loc,
1736 Defining_Identifier => New_Form,
1737 Out_Present => Out_Present (Parent (Form)),
1738 In_Present => In_Present (Parent (Form)),
1739 Parameter_Type => New_Occurrence_Of (Etype (Form), Loc));
1741 Append (Parm_Spec, Specs);
1742 Append (New_Occurrence_Of (New_Form, Loc), Actuals);
1747 -- Add renaming declarations for the discriminants of the enclosing
1748 -- type, which may be visible in the preconditions.
1750 if Has_Discriminants (Synch_Type) then
1756 D := First_Discriminant (Synch_Type);
1757 while Present (D) loop
1759 Make_Object_Renaming_Declaration (Loc,
1760 Defining_Identifier =>
1761 Make_Defining_Identifier (Loc, Chars (D)),
1762 Subtype_Mark => New_Reference_To (Etype (D), Loc),
1764 Make_Selected_Component (Loc,
1765 Prefix => New_Reference_To (Synch_Id, Loc),
1766 Selector_Name => Make_Identifier (Loc, Chars (D))));
1767 Prepend (Decl, Decls);
1768 Next_Discriminant (D);
1773 Set_PPC_Wrapper (E, Wrapper_Id);
1775 Make_Subprogram_Body (Loc,
1777 Make_Procedure_Specification (Loc,
1778 Defining_Unit_Name => Wrapper_Id,
1779 Parameter_Specifications => Specs),
1780 Declarations => Decls,
1781 Handled_Statement_Sequence =>
1782 Make_Handled_Sequence_Of_Statements (Loc,
1783 Statements => New_List (Entry_Call)));
1785 -- The wrapper body is analyzed when the enclosing type is frozen
1787 Append_Freeze_Action (Defining_Entity (Decl), Wrapper_Body);
1788 end Build_PPC_Wrapper;
1790 --------------------------
1791 -- Build_Wrapper_Bodies --
1792 --------------------------
1794 procedure Build_Wrapper_Bodies
1799 Rec_Typ : Entity_Id;
1801 function Build_Wrapper_Body
1803 Subp_Id : Entity_Id;
1804 Obj_Typ : Entity_Id;
1805 Formals : List_Id) return Node_Id;
1806 -- Ada 2005 (AI-345): Build the body that wraps a primitive operation
1807 -- associated with a protected or task type. Subp_Id is the subprogram
1808 -- name which will be wrapped. Obj_Typ is the type of the new formal
1809 -- parameter which handles dispatching and object notation. Formals are
1810 -- the original formals of Subp_Id which will be explicitly replicated.
1812 ------------------------
1813 -- Build_Wrapper_Body --
1814 ------------------------
1816 function Build_Wrapper_Body
1818 Subp_Id : Entity_Id;
1819 Obj_Typ : Entity_Id;
1820 Formals : List_Id) return Node_Id
1822 Body_Spec : Node_Id;
1825 Body_Spec := Build_Wrapper_Spec (Subp_Id, Obj_Typ, Formals);
1827 -- The subprogram is not overriding or is not a primitive declared
1828 -- between two views.
1830 if No (Body_Spec) then
1835 Actuals : List_Id := No_List;
1837 First_Form : Node_Id;
1842 -- Map formals to actuals. Use the list built for the wrapper
1843 -- spec, skipping the object notation parameter.
1845 First_Form := First (Parameter_Specifications (Body_Spec));
1847 Formal := First_Form;
1850 if Present (Formal) then
1851 Actuals := New_List;
1852 while Present (Formal) loop
1854 Make_Identifier (Loc,
1855 Chars => Chars (Defining_Identifier (Formal))));
1860 -- Special processing for primitives declared between a private
1861 -- type and its completion: the wrapper needs a properly typed
1862 -- parameter if the wrapped operation has a controlling first
1863 -- parameter. Note that this might not be the case for a function
1864 -- with a controlling result.
1866 if Is_Private_Primitive_Subprogram (Subp_Id) then
1867 if No (Actuals) then
1868 Actuals := New_List;
1871 if Is_Controlling_Formal (First_Formal (Subp_Id)) then
1872 Prepend_To (Actuals,
1873 Unchecked_Convert_To
1874 (Corresponding_Concurrent_Type (Obj_Typ),
1875 Make_Identifier (Loc, Name_uO)));
1878 Prepend_To (Actuals,
1879 Make_Identifier (Loc,
1880 Chars => Chars (Defining_Identifier (First_Form))));
1883 Nam := New_Reference_To (Subp_Id, Loc);
1885 -- An access-to-variable object parameter requires an explicit
1886 -- dereference in the unchecked conversion. This case occurs
1887 -- when a protected entry wrapper must override an interface
1888 -- level procedure with interface access as first parameter.
1890 -- O.all.Subp_Id (Formal_1, ..., Formal_N)
1892 if Nkind (Parameter_Type (First_Form)) =
1896 Make_Explicit_Dereference (Loc,
1897 Prefix => Make_Identifier (Loc, Name_uO));
1899 Conv_Id := Make_Identifier (Loc, Name_uO);
1903 Make_Selected_Component (Loc,
1905 Unchecked_Convert_To
1906 (Corresponding_Concurrent_Type (Obj_Typ), Conv_Id),
1907 Selector_Name => New_Reference_To (Subp_Id, Loc));
1910 -- Create the subprogram body. For a function, the call to the
1911 -- actual subprogram has to be converted to the corresponding
1912 -- record if it is a controlling result.
1914 if Ekind (Subp_Id) = E_Function then
1920 Make_Function_Call (Loc,
1922 Parameter_Associations => Actuals);
1924 if Has_Controlling_Result (Subp_Id) then
1926 Unchecked_Convert_To
1927 (Corresponding_Record_Type (Etype (Subp_Id)), Res);
1931 Make_Subprogram_Body (Loc,
1932 Specification => Body_Spec,
1933 Declarations => Empty_List,
1934 Handled_Statement_Sequence =>
1935 Make_Handled_Sequence_Of_Statements (Loc,
1936 Statements => New_List (
1937 Make_Simple_Return_Statement (Loc, Res))));
1942 Make_Subprogram_Body (Loc,
1943 Specification => Body_Spec,
1944 Declarations => Empty_List,
1945 Handled_Statement_Sequence =>
1946 Make_Handled_Sequence_Of_Statements (Loc,
1947 Statements => New_List (
1948 Make_Procedure_Call_Statement (Loc,
1950 Parameter_Associations => Actuals))));
1953 end Build_Wrapper_Body;
1955 -- Start of processing for Build_Wrapper_Bodies
1958 if Is_Concurrent_Type (Typ) then
1959 Rec_Typ := Corresponding_Record_Type (Typ);
1964 -- Generate wrapper bodies for a concurrent type which implements an
1967 if Present (Interfaces (Rec_Typ)) then
1969 Insert_Nod : Node_Id;
1971 Prim_Elmt : Elmt_Id;
1972 Prim_Decl : Node_Id;
1974 Wrap_Body : Node_Id;
1975 Wrap_Id : Entity_Id;
1980 -- Examine all primitive operations of the corresponding record
1981 -- type, looking for wrapper specs. Generate bodies in order to
1984 Prim_Elmt := First_Elmt (Primitive_Operations (Rec_Typ));
1985 while Present (Prim_Elmt) loop
1986 Prim := Node (Prim_Elmt);
1988 if (Ekind (Prim) = E_Function
1989 or else Ekind (Prim) = E_Procedure)
1990 and then Is_Primitive_Wrapper (Prim)
1992 Subp := Wrapped_Entity (Prim);
1993 Prim_Decl := Parent (Parent (Prim));
1996 Build_Wrapper_Body (Loc,
1999 Formals => Parameter_Specifications (Parent (Subp)));
2000 Wrap_Id := Defining_Unit_Name (Specification (Wrap_Body));
2002 Set_Corresponding_Spec (Wrap_Body, Prim);
2003 Set_Corresponding_Body (Prim_Decl, Wrap_Id);
2005 Insert_After (Insert_Nod, Wrap_Body);
2006 Insert_Nod := Wrap_Body;
2008 Analyze (Wrap_Body);
2011 Next_Elmt (Prim_Elmt);
2015 end Build_Wrapper_Bodies;
2017 ------------------------
2018 -- Build_Wrapper_Spec --
2019 ------------------------
2021 function Build_Wrapper_Spec
2022 (Subp_Id : Entity_Id;
2023 Obj_Typ : Entity_Id;
2024 Formals : List_Id) return Node_Id
2026 Loc : constant Source_Ptr := Sloc (Subp_Id);
2027 First_Param : Node_Id;
2029 Iface_Elmt : Elmt_Id;
2030 Iface_Op : Entity_Id;
2031 Iface_Op_Elmt : Elmt_Id;
2033 function Overriding_Possible
2034 (Iface_Op : Entity_Id;
2035 Wrapper : Entity_Id) return Boolean;
2036 -- Determine whether a primitive operation can be overridden by Wrapper.
2037 -- Iface_Op is the candidate primitive operation of an interface type,
2038 -- Wrapper is the generated entry wrapper.
2040 function Replicate_Formals
2042 Formals : List_Id) return List_Id;
2043 -- An explicit parameter replication is required due to the Is_Entry_
2044 -- Formal flag being set for all the formals of an entry. The explicit
2045 -- replication removes the flag that would otherwise cause a different
2046 -- path of analysis.
2048 -------------------------
2049 -- Overriding_Possible --
2050 -------------------------
2052 function Overriding_Possible
2053 (Iface_Op : Entity_Id;
2054 Wrapper : Entity_Id) return Boolean
2056 Iface_Op_Spec : constant Node_Id := Parent (Iface_Op);
2057 Wrapper_Spec : constant Node_Id := Parent (Wrapper);
2059 function Type_Conformant_Parameters
2060 (Iface_Op_Params : List_Id;
2061 Wrapper_Params : List_Id) return Boolean;
2062 -- Determine whether the parameters of the generated entry wrapper
2063 -- and those of a primitive operation are type conformant. During
2064 -- this check, the first parameter of the primitive operation is
2065 -- skipped if it is a controlling argument: protected functions
2066 -- may have a controlling result.
2068 --------------------------------
2069 -- Type_Conformant_Parameters --
2070 --------------------------------
2072 function Type_Conformant_Parameters
2073 (Iface_Op_Params : List_Id;
2074 Wrapper_Params : List_Id) return Boolean
2076 Iface_Op_Param : Node_Id;
2077 Iface_Op_Typ : Entity_Id;
2078 Wrapper_Param : Node_Id;
2079 Wrapper_Typ : Entity_Id;
2082 -- Skip the first (controlling) parameter of primitive operation
2084 Iface_Op_Param := First (Iface_Op_Params);
2086 if Present (First_Formal (Iface_Op))
2087 and then Is_Controlling_Formal (First_Formal (Iface_Op))
2089 Iface_Op_Param := Next (Iface_Op_Param);
2092 Wrapper_Param := First (Wrapper_Params);
2093 while Present (Iface_Op_Param)
2094 and then Present (Wrapper_Param)
2096 Iface_Op_Typ := Find_Parameter_Type (Iface_Op_Param);
2097 Wrapper_Typ := Find_Parameter_Type (Wrapper_Param);
2099 -- The two parameters must be mode conformant
2101 if not Conforming_Types
2102 (Iface_Op_Typ, Wrapper_Typ, Mode_Conformant)
2107 Next (Iface_Op_Param);
2108 Next (Wrapper_Param);
2111 -- One of the lists is longer than the other
2113 if Present (Iface_Op_Param) or else Present (Wrapper_Param) then
2118 end Type_Conformant_Parameters;
2120 -- Start of processing for Overriding_Possible
2123 if Chars (Iface_Op) /= Chars (Wrapper) then
2127 -- If an inherited subprogram is implemented by a protected procedure
2128 -- or an entry, then the first parameter of the inherited subprogram
2129 -- shall be of mode OUT or IN OUT, or access-to-variable parameter.
2131 if Ekind (Iface_Op) = E_Procedure
2132 and then Present (Parameter_Specifications (Iface_Op_Spec))
2135 Obj_Param : constant Node_Id :=
2136 First (Parameter_Specifications (Iface_Op_Spec));
2138 if not Out_Present (Obj_Param)
2139 and then Nkind (Parameter_Type (Obj_Param)) /=
2148 Type_Conformant_Parameters (
2149 Parameter_Specifications (Iface_Op_Spec),
2150 Parameter_Specifications (Wrapper_Spec));
2151 end Overriding_Possible;
2153 -----------------------
2154 -- Replicate_Formals --
2155 -----------------------
2157 function Replicate_Formals
2159 Formals : List_Id) return List_Id
2161 New_Formals : constant List_Id := New_List;
2163 Param_Type : Node_Id;
2166 Formal := First (Formals);
2168 -- Skip the object parameter when dealing with primitives declared
2169 -- between two views.
2171 if Is_Private_Primitive_Subprogram (Subp_Id)
2172 and then not Has_Controlling_Result (Subp_Id)
2174 Formal := Next (Formal);
2177 while Present (Formal) loop
2179 -- Create an explicit copy of the entry parameter
2181 -- When creating the wrapper subprogram for a primitive operation
2182 -- of a protected interface we must construct an equivalent
2183 -- signature to that of the overriding operation. For regular
2184 -- parameters we can just use the type of the formal, but for
2185 -- access to subprogram parameters we need to reanalyze the
2186 -- parameter type to create local entities for the signature of
2187 -- the subprogram type. Using the entities of the overriding
2188 -- subprogram will result in out-of-scope errors in the back-end.
2190 if Nkind (Parameter_Type (Formal)) = N_Access_Definition then
2191 Param_Type := Copy_Separate_Tree (Parameter_Type (Formal));
2194 New_Reference_To (Etype (Parameter_Type (Formal)), Loc);
2197 Append_To (New_Formals,
2198 Make_Parameter_Specification (Loc,
2199 Defining_Identifier =>
2200 Make_Defining_Identifier (Loc,
2201 Chars => Chars (Defining_Identifier (Formal))),
2202 In_Present => In_Present (Formal),
2203 Out_Present => Out_Present (Formal),
2204 Parameter_Type => Param_Type));
2210 end Replicate_Formals;
2212 -- Start of processing for Build_Wrapper_Spec
2215 -- There is no point in building wrappers for non-tagged concurrent
2218 pragma Assert (Is_Tagged_Type (Obj_Typ));
2220 -- An entry or a protected procedure can override a routine where the
2221 -- controlling formal is either IN OUT, OUT or is of access-to-variable
2222 -- type. Since the wrapper must have the exact same signature as that of
2223 -- the overridden subprogram, we try to find the overriding candidate
2224 -- and use its controlling formal.
2226 First_Param := Empty;
2228 -- Check every implemented interface
2230 if Present (Interfaces (Obj_Typ)) then
2231 Iface_Elmt := First_Elmt (Interfaces (Obj_Typ));
2232 Search : while Present (Iface_Elmt) loop
2233 Iface := Node (Iface_Elmt);
2235 -- Check every interface primitive
2237 if Present (Primitive_Operations (Iface)) then
2238 Iface_Op_Elmt := First_Elmt (Primitive_Operations (Iface));
2239 while Present (Iface_Op_Elmt) loop
2240 Iface_Op := Node (Iface_Op_Elmt);
2242 -- Ignore predefined primitives
2244 if not Is_Predefined_Dispatching_Operation (Iface_Op) then
2245 Iface_Op := Ultimate_Alias (Iface_Op);
2247 -- The current primitive operation can be overridden by
2248 -- the generated entry wrapper.
2250 if Overriding_Possible (Iface_Op, Subp_Id) then
2252 First (Parameter_Specifications (Parent (Iface_Op)));
2258 Next_Elmt (Iface_Op_Elmt);
2262 Next_Elmt (Iface_Elmt);
2266 -- If the subprogram to be wrapped is not overriding anything or is not
2267 -- a primitive declared between two views, do not produce anything. This
2268 -- avoids spurious errors involving overriding.
2271 and then not Is_Private_Primitive_Subprogram (Subp_Id)
2277 Wrapper_Id : constant Entity_Id :=
2278 Make_Defining_Identifier (Loc, Chars (Subp_Id));
2279 New_Formals : List_Id;
2280 Obj_Param : Node_Id;
2281 Obj_Param_Typ : Entity_Id;
2284 -- Minimum decoration is needed to catch the entity in
2285 -- Sem_Ch6.Override_Dispatching_Operation.
2287 if Ekind (Subp_Id) = E_Function then
2288 Set_Ekind (Wrapper_Id, E_Function);
2290 Set_Ekind (Wrapper_Id, E_Procedure);
2293 Set_Is_Primitive_Wrapper (Wrapper_Id);
2294 Set_Wrapped_Entity (Wrapper_Id, Subp_Id);
2295 Set_Is_Private_Primitive (Wrapper_Id,
2296 Is_Private_Primitive_Subprogram (Subp_Id));
2298 -- Process the formals
2300 New_Formals := Replicate_Formals (Loc, Formals);
2302 -- A function with a controlling result and no first controlling
2303 -- formal needs no additional parameter.
2305 if Has_Controlling_Result (Subp_Id)
2307 (No (First_Formal (Subp_Id))
2308 or else not Is_Controlling_Formal (First_Formal (Subp_Id)))
2312 -- Routine Subp_Id has been found to override an interface primitive.
2313 -- If the interface operation has an access parameter, create a copy
2314 -- of it, with the same null exclusion indicator if present.
2316 elsif Present (First_Param) then
2317 if Nkind (Parameter_Type (First_Param)) = N_Access_Definition then
2319 Make_Access_Definition (Loc,
2321 New_Reference_To (Obj_Typ, Loc));
2322 Set_Null_Exclusion_Present (Obj_Param_Typ,
2323 Null_Exclusion_Present (Parameter_Type (First_Param)));
2326 Obj_Param_Typ := New_Reference_To (Obj_Typ, Loc);
2330 Make_Parameter_Specification (Loc,
2331 Defining_Identifier =>
2332 Make_Defining_Identifier (Loc,
2334 In_Present => In_Present (First_Param),
2335 Out_Present => Out_Present (First_Param),
2336 Parameter_Type => Obj_Param_Typ);
2338 Prepend_To (New_Formals, Obj_Param);
2340 -- If we are dealing with a primitive declared between two views,
2341 -- implemented by a synchronized operation, we need to create
2342 -- a default parameter. The mode of the parameter must match that
2343 -- of the primitive operation.
2346 pragma Assert (Is_Private_Primitive_Subprogram (Subp_Id));
2348 Make_Parameter_Specification (Loc,
2349 Defining_Identifier =>
2350 Make_Defining_Identifier (Loc, Name_uO),
2351 In_Present => In_Present (Parent (First_Entity (Subp_Id))),
2352 Out_Present => Ekind (Subp_Id) /= E_Function,
2353 Parameter_Type => New_Reference_To (Obj_Typ, Loc));
2354 Prepend_To (New_Formals, Obj_Param);
2357 -- Build the final spec. If it is a function with a controlling
2358 -- result, it is a primitive operation of the corresponding
2359 -- record type, so mark the spec accordingly.
2361 if Ekind (Subp_Id) = E_Function then
2366 if Has_Controlling_Result (Subp_Id) then
2369 (Corresponding_Record_Type (Etype (Subp_Id)), Loc);
2371 Res_Def := New_Copy (Result_Definition (Parent (Subp_Id)));
2375 Make_Function_Specification (Loc,
2376 Defining_Unit_Name => Wrapper_Id,
2377 Parameter_Specifications => New_Formals,
2378 Result_Definition => Res_Def);
2382 Make_Procedure_Specification (Loc,
2383 Defining_Unit_Name => Wrapper_Id,
2384 Parameter_Specifications => New_Formals);
2387 end Build_Wrapper_Spec;
2389 -------------------------
2390 -- Build_Wrapper_Specs --
2391 -------------------------
2393 procedure Build_Wrapper_Specs
2399 Rec_Typ : Entity_Id;
2400 procedure Scan_Declarations (L : List_Id);
2401 -- Common processing for visible and private declarations
2402 -- of a protected type.
2404 procedure Scan_Declarations (L : List_Id) is
2406 Wrap_Decl : Node_Id;
2407 Wrap_Spec : Node_Id;
2415 while Present (Decl) loop
2418 if Nkind (Decl) = N_Entry_Declaration
2419 and then Ekind (Defining_Identifier (Decl)) = E_Entry
2423 (Subp_Id => Defining_Identifier (Decl),
2425 Formals => Parameter_Specifications (Decl));
2427 elsif Nkind (Decl) = N_Subprogram_Declaration then
2430 (Subp_Id => Defining_Unit_Name (Specification (Decl)),
2433 Parameter_Specifications (Specification (Decl)));
2436 if Present (Wrap_Spec) then
2438 Make_Subprogram_Declaration (Loc,
2439 Specification => Wrap_Spec);
2441 Insert_After (N, Wrap_Decl);
2444 Analyze (Wrap_Decl);
2449 end Scan_Declarations;
2451 -- start of processing for Build_Wrapper_Specs
2454 if Is_Protected_Type (Typ) then
2455 Def := Protected_Definition (Parent (Typ));
2456 else pragma Assert (Is_Task_Type (Typ));
2457 Def := Task_Definition (Parent (Typ));
2460 Rec_Typ := Corresponding_Record_Type (Typ);
2462 -- Generate wrapper specs for a concurrent type which implements an
2463 -- interface. Operations in both the visible and private parts may
2464 -- implement progenitor operations.
2466 if Present (Interfaces (Rec_Typ))
2467 and then Present (Def)
2469 Scan_Declarations (Visible_Declarations (Def));
2470 Scan_Declarations (Private_Declarations (Def));
2472 end Build_Wrapper_Specs;
2474 ---------------------------
2475 -- Build_Find_Body_Index --
2476 ---------------------------
2478 function Build_Find_Body_Index (Typ : Entity_Id) return Node_Id is
2479 Loc : constant Source_Ptr := Sloc (Typ);
2482 Has_F : Boolean := False;
2484 If_St : Node_Id := Empty;
2487 Decls : List_Id := New_List;
2490 Siz : Node_Id := Empty;
2492 procedure Add_If_Clause (Expr : Node_Id);
2493 -- Add test for range of current entry
2495 function Convert_Discriminant_Ref (Bound : Node_Id) return Node_Id;
2496 -- If a bound of an entry is given by a discriminant, retrieve the
2497 -- actual value of the discriminant from the enclosing object.
2503 procedure Add_If_Clause (Expr : Node_Id) is
2505 Stats : constant List_Id :=
2507 Make_Simple_Return_Statement (Loc,
2508 Expression => Make_Integer_Literal (Loc, Index + 1)));
2511 -- Index for current entry body
2515 -- Compute total length of entry queues so far
2523 Right_Opnd => Expr);
2528 Left_Opnd => Make_Identifier (Loc, Name_uE),
2531 -- Map entry queue indexes in the range of the current family
2532 -- into the current index, that designates the entry body.
2536 Make_Implicit_If_Statement (Typ,
2538 Then_Statements => Stats,
2539 Elsif_Parts => New_List);
2545 Make_Elsif_Part (Loc,
2547 Then_Statements => Stats),
2548 Elsif_Parts (If_St));
2552 ------------------------------
2553 -- Convert_Discriminant_Ref --
2554 ------------------------------
2556 function Convert_Discriminant_Ref (Bound : Node_Id) return Node_Id is
2560 if Is_Entity_Name (Bound)
2561 and then Ekind (Entity (Bound)) = E_Discriminant
2564 Make_Selected_Component (Loc,
2566 Unchecked_Convert_To (Corresponding_Record_Type (Typ),
2567 Make_Explicit_Dereference (Loc,
2568 Make_Identifier (Loc, Name_uObject))),
2569 Selector_Name => Make_Identifier (Loc, Chars (Bound)));
2570 Set_Etype (B, Etype (Entity (Bound)));
2572 B := New_Copy_Tree (Bound);
2576 end Convert_Discriminant_Ref;
2578 -- Start of processing for Build_Find_Body_Index
2581 Spec := Build_Find_Body_Index_Spec (Typ);
2583 Ent := First_Entity (Typ);
2584 while Present (Ent) loop
2585 if Ekind (Ent) = E_Entry_Family then
2595 -- If the protected type has no entry families, there is a one-one
2596 -- correspondence between entry queue and entry body.
2599 Make_Simple_Return_Statement (Loc,
2600 Expression => Make_Identifier (Loc, Name_uE));
2603 -- Suppose entries e1, e2, ... have size l1, l2, ... we generate
2606 -- if E <= l1 then return 1;
2607 -- elsif E <= l1 + l2 then return 2;
2612 Ent := First_Entity (Typ);
2614 Add_Object_Pointer (Loc, Typ, Decls);
2616 while Present (Ent) loop
2617 if Ekind (Ent) = E_Entry then
2618 Add_If_Clause (Make_Integer_Literal (Loc, 1));
2620 elsif Ekind (Ent) = E_Entry_Family then
2621 E_Typ := Etype (Discrete_Subtype_Definition (Parent (Ent)));
2622 Hi := Convert_Discriminant_Ref (Type_High_Bound (E_Typ));
2623 Lo := Convert_Discriminant_Ref (Type_Low_Bound (E_Typ));
2624 Add_If_Clause (Family_Size (Loc, Hi, Lo, Typ, False));
2633 Make_Simple_Return_Statement (Loc,
2634 Expression => Make_Integer_Literal (Loc, 1));
2636 elsif Nkind (Ret) = N_If_Statement then
2638 -- Ranges are in increasing order, so last one doesn't need guard
2641 Nod : constant Node_Id := Last (Elsif_Parts (Ret));
2644 Set_Else_Statements (Ret, Then_Statements (Nod));
2650 Make_Subprogram_Body (Loc,
2651 Specification => Spec,
2652 Declarations => Decls,
2653 Handled_Statement_Sequence =>
2654 Make_Handled_Sequence_Of_Statements (Loc,
2655 Statements => New_List (Ret)));
2656 end Build_Find_Body_Index;
2658 --------------------------------
2659 -- Build_Find_Body_Index_Spec --
2660 --------------------------------
2662 function Build_Find_Body_Index_Spec (Typ : Entity_Id) return Node_Id is
2663 Loc : constant Source_Ptr := Sloc (Typ);
2664 Id : constant Entity_Id :=
2665 Make_Defining_Identifier (Loc,
2666 Chars => New_External_Name (Chars (Typ), 'F'));
2667 Parm1 : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uO);
2668 Parm2 : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uE);
2672 Make_Function_Specification (Loc,
2673 Defining_Unit_Name => Id,
2674 Parameter_Specifications => New_List (
2675 Make_Parameter_Specification (Loc,
2676 Defining_Identifier => Parm1,
2678 New_Reference_To (RTE (RE_Address), Loc)),
2680 Make_Parameter_Specification (Loc,
2681 Defining_Identifier => Parm2,
2683 New_Reference_To (RTE (RE_Protected_Entry_Index), Loc))),
2684 Result_Definition => New_Occurrence_Of (
2685 RTE (RE_Protected_Entry_Index), Loc));
2686 end Build_Find_Body_Index_Spec;
2688 -------------------------
2689 -- Build_Master_Entity --
2690 -------------------------
2692 procedure Build_Master_Entity (E : Entity_Id) is
2693 Loc : constant Source_Ptr := Sloc (E);
2699 S := Find_Master_Scope (E);
2701 -- Nothing to do if we already built a master entity for this scope
2702 -- or if there is no task hierarchy.
2704 if Has_Master_Entity (S)
2705 or else Restriction_Active (No_Task_Hierarchy)
2710 -- Otherwise first build the master entity
2711 -- _Master : constant Master_Id := Current_Master.all;
2712 -- and insert it just before the current declaration
2715 Make_Object_Declaration (Loc,
2716 Defining_Identifier =>
2717 Make_Defining_Identifier (Loc, Name_uMaster),
2718 Constant_Present => True,
2719 Object_Definition => New_Reference_To (RTE (RE_Master_Id), Loc),
2721 Make_Explicit_Dereference (Loc,
2722 New_Reference_To (RTE (RE_Current_Master), Loc)));
2725 Insert_Before (P, Decl);
2728 Set_Has_Master_Entity (S);
2730 -- Now mark the containing scope as a task master
2732 while Nkind (P) /= N_Compilation_Unit loop
2735 -- If we fall off the top, we are at the outer level, and the
2736 -- environment task is our effective master, so nothing to mark.
2739 (P, N_Task_Body, N_Block_Statement, N_Subprogram_Body)
2741 Set_Is_Task_Master (P, True);
2744 elsif Nkind (Parent (P)) = N_Subunit then
2745 P := Corresponding_Stub (Parent (P));
2748 end Build_Master_Entity;
2750 -----------------------------------------
2751 -- Build_Private_Protected_Declaration --
2752 -----------------------------------------
2754 function Build_Private_Protected_Declaration
2755 (N : Node_Id) return Entity_Id
2757 Loc : constant Source_Ptr := Sloc (N);
2758 Body_Id : constant Entity_Id := Defining_Entity (N);
2763 Spec_Id : Entity_Id;
2766 Formal := First_Formal (Body_Id);
2768 -- The protected operation always has at least one formal, namely the
2769 -- object itself, but it is only placed in the parameter list if
2770 -- expansion is enabled.
2772 if Present (Formal) or else Expander_Active then
2773 Plist := Copy_Parameter_List (Body_Id);
2778 if Nkind (Specification (N)) = N_Procedure_Specification then
2780 Make_Procedure_Specification (Loc,
2781 Defining_Unit_Name =>
2782 Make_Defining_Identifier (Sloc (Body_Id),
2783 Chars => Chars (Body_Id)),
2784 Parameter_Specifications =>
2788 Make_Function_Specification (Loc,
2789 Defining_Unit_Name =>
2790 Make_Defining_Identifier (Sloc (Body_Id),
2791 Chars => Chars (Body_Id)),
2792 Parameter_Specifications => Plist,
2793 Result_Definition =>
2794 New_Occurrence_Of (Etype (Body_Id), Loc));
2797 Decl := Make_Subprogram_Declaration (Loc, Specification => New_Spec);
2798 Insert_Before (N, Decl);
2799 Spec_Id := Defining_Unit_Name (New_Spec);
2801 -- Indicate that the entity comes from source, to ensure that cross-
2802 -- reference information is properly generated. The body itself is
2803 -- rewritten during expansion, and the body entity will not appear in
2804 -- calls to the operation.
2806 Set_Comes_From_Source (Spec_Id, True);
2808 Set_Has_Completion (Spec_Id);
2809 Set_Convention (Spec_Id, Convention_Protected);
2811 end Build_Private_Protected_Declaration;
2813 ---------------------------
2814 -- Build_Protected_Entry --
2815 ---------------------------
2817 function Build_Protected_Entry
2820 Pid : Node_Id) return Node_Id
2822 Loc : constant Source_Ptr := Sloc (N);
2824 Decls : constant List_Id := Declarations (N);
2825 End_Lab : constant Node_Id :=
2826 End_Label (Handled_Statement_Sequence (N));
2827 End_Loc : constant Source_Ptr :=
2828 Sloc (Last (Statements (Handled_Statement_Sequence (N))));
2829 -- Used for the generated call to Complete_Entry_Body
2831 Han_Loc : Source_Ptr;
2832 -- Used for the exception handler, inserted at end of the body
2834 Op_Decls : constant List_Id := New_List;
2842 -- Set the source location on the exception handler only when debugging
2843 -- the expanded code (see Make_Implicit_Exception_Handler).
2845 if Debug_Generated_Code then
2848 -- Otherwise the inserted code should not be visible to the debugger
2851 Han_Loc := No_Location;
2855 Make_Defining_Identifier (Loc,
2856 Chars => Chars (Protected_Body_Subprogram (Ent)));
2858 Build_Protected_Entry_Specification (Loc, Edef, Empty);
2860 -- Add the following declarations:
2861 -- type poVP is access poV;
2862 -- _object : poVP := poVP (_O);
2864 -- where _O is the formal parameter associated with the concurrent
2865 -- object. These declarations are needed for Complete_Entry_Body.
2867 Add_Object_Pointer (Loc, Pid, Op_Decls);
2869 -- Add renamings for all formals, the Protection object, discriminals,
2870 -- privals and the entry index constant for use by debugger.
2872 Add_Formal_Renamings (Espec, Op_Decls, Ent, Loc);
2873 Debug_Private_Data_Declarations (Decls);
2875 case Corresponding_Runtime_Package (Pid) is
2876 when System_Tasking_Protected_Objects_Entries =>
2878 New_Reference_To (RTE (RE_Complete_Entry_Body), Loc);
2880 when System_Tasking_Protected_Objects_Single_Entry =>
2882 New_Reference_To (RTE (RE_Complete_Single_Entry_Body), Loc);
2885 raise Program_Error;
2888 Op_Stats := New_List (
2889 Make_Block_Statement (Loc,
2890 Declarations => Decls,
2891 Handled_Statement_Sequence =>
2892 Handled_Statement_Sequence (N)),
2894 Make_Procedure_Call_Statement (End_Loc,
2896 Parameter_Associations => New_List (
2897 Make_Attribute_Reference (End_Loc,
2899 Make_Selected_Component (End_Loc,
2900 Prefix => Make_Identifier (End_Loc, Name_uObject),
2901 Selector_Name => Make_Identifier (End_Loc, Name_uObject)),
2902 Attribute_Name => Name_Unchecked_Access))));
2904 -- When exceptions can not be propagated, we never need to call
2905 -- Exception_Complete_Entry_Body
2907 if No_Exception_Handlers_Set then
2909 Make_Subprogram_Body (Loc,
2910 Specification => Espec,
2911 Declarations => Op_Decls,
2912 Handled_Statement_Sequence =>
2913 Make_Handled_Sequence_Of_Statements (Loc,
2914 Statements => Op_Stats,
2915 End_Label => End_Lab));
2918 Ohandle := Make_Others_Choice (Loc);
2919 Set_All_Others (Ohandle);
2921 case Corresponding_Runtime_Package (Pid) is
2922 when System_Tasking_Protected_Objects_Entries =>
2925 (RTE (RE_Exceptional_Complete_Entry_Body), Loc);
2927 when System_Tasking_Protected_Objects_Single_Entry =>
2930 (RTE (RE_Exceptional_Complete_Single_Entry_Body), Loc);
2933 raise Program_Error;
2936 -- Establish link between subprogram body entity and source entry.
2938 Set_Corresponding_Protected_Entry (Edef, Ent);
2940 -- Create body of entry procedure. The renaming declarations are
2941 -- placed ahead of the block that contains the actual entry body.
2944 Make_Subprogram_Body (Loc,
2945 Specification => Espec,
2946 Declarations => Op_Decls,
2947 Handled_Statement_Sequence =>
2948 Make_Handled_Sequence_Of_Statements (Loc,
2949 Statements => Op_Stats,
2950 End_Label => End_Lab,
2951 Exception_Handlers => New_List (
2952 Make_Implicit_Exception_Handler (Han_Loc,
2953 Exception_Choices => New_List (Ohandle),
2955 Statements => New_List (
2956 Make_Procedure_Call_Statement (Han_Loc,
2958 Parameter_Associations => New_List (
2959 Make_Attribute_Reference (Han_Loc,
2961 Make_Selected_Component (Han_Loc,
2963 Make_Identifier (Han_Loc, Name_uObject),
2965 Make_Identifier (Han_Loc, Name_uObject)),
2966 Attribute_Name => Name_Unchecked_Access),
2968 Make_Function_Call (Han_Loc,
2969 Name => New_Reference_To (
2970 RTE (RE_Get_GNAT_Exception), Loc)))))))));
2972 end Build_Protected_Entry;
2974 -----------------------------------------
2975 -- Build_Protected_Entry_Specification --
2976 -----------------------------------------
2978 function Build_Protected_Entry_Specification
2981 Ent_Id : Entity_Id) return Node_Id
2983 P : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uP);
2986 Set_Debug_Info_Needed (Def_Id);
2988 if Present (Ent_Id) then
2989 Append_Elmt (P, Accept_Address (Ent_Id));
2993 Make_Procedure_Specification (Loc,
2994 Defining_Unit_Name => Def_Id,
2995 Parameter_Specifications => New_List (
2996 Make_Parameter_Specification (Loc,
2997 Defining_Identifier =>
2998 Make_Defining_Identifier (Loc, Name_uO),
3000 New_Reference_To (RTE (RE_Address), Loc)),
3002 Make_Parameter_Specification (Loc,
3003 Defining_Identifier => P,
3005 New_Reference_To (RTE (RE_Address), Loc)),
3007 Make_Parameter_Specification (Loc,
3008 Defining_Identifier =>
3009 Make_Defining_Identifier (Loc, Name_uE),
3011 New_Reference_To (RTE (RE_Protected_Entry_Index), Loc))));
3012 end Build_Protected_Entry_Specification;
3014 --------------------------
3015 -- Build_Protected_Spec --
3016 --------------------------
3018 function Build_Protected_Spec
3020 Obj_Type : Entity_Id;
3022 Unprotected : Boolean := False) return List_Id
3024 Loc : constant Source_Ptr := Sloc (N);
3027 New_Plist : List_Id;
3028 New_Param : Node_Id;
3031 New_Plist := New_List;
3033 Formal := First_Formal (Ident);
3034 while Present (Formal) loop
3036 Make_Parameter_Specification (Loc,
3037 Defining_Identifier =>
3038 Make_Defining_Identifier (Sloc (Formal), Chars (Formal)),
3039 In_Present => In_Present (Parent (Formal)),
3040 Out_Present => Out_Present (Parent (Formal)),
3041 Parameter_Type => New_Reference_To (Etype (Formal), Loc));
3044 Set_Protected_Formal (Formal, Defining_Identifier (New_Param));
3047 Append (New_Param, New_Plist);
3048 Next_Formal (Formal);
3051 -- If the subprogram is a procedure and the context is not an access
3052 -- to protected subprogram, the parameter is in-out. Otherwise it is
3056 Make_Parameter_Specification (Loc,
3057 Defining_Identifier =>
3058 Make_Defining_Identifier (Loc, Name_uObject),
3061 (Etype (Ident) = Standard_Void_Type
3062 and then not Is_RTE (Obj_Type, RE_Address)),
3064 New_Reference_To (Obj_Type, Loc));
3065 Set_Debug_Info_Needed (Defining_Identifier (Decl));
3066 Prepend_To (New_Plist, Decl);
3069 end Build_Protected_Spec;
3071 ---------------------------------------
3072 -- Build_Protected_Sub_Specification --
3073 ---------------------------------------
3075 function Build_Protected_Sub_Specification
3077 Prot_Typ : Entity_Id;
3078 Mode : Subprogram_Protection_Mode) return Node_Id
3080 Loc : constant Source_Ptr := Sloc (N);
3084 New_Plist : List_Id;
3087 Append_Chr : constant array (Subprogram_Protection_Mode) of Character :=
3088 (Dispatching_Mode => ' ',
3089 Protected_Mode => 'P',
3090 Unprotected_Mode => 'N');
3093 if Ekind (Defining_Unit_Name (Specification (N))) =
3096 Decl := Unit_Declaration_Node (Corresponding_Spec (N));
3101 Def_Id := Defining_Unit_Name (Specification (Decl));
3104 Build_Protected_Spec
3105 (Decl, Corresponding_Record_Type (Prot_Typ), Def_Id,
3106 Mode = Unprotected_Mode);
3108 Make_Defining_Identifier (Loc,
3109 Chars => Build_Selected_Name (Prot_Typ, Def_Id, Append_Chr (Mode)));
3111 -- The unprotected operation carries the user code, and debugging
3112 -- information must be generated for it, even though this spec does
3113 -- not come from source. It is also convenient to allow gdb to step
3114 -- into the protected operation, even though it only contains lock/
3117 Set_Debug_Info_Needed (New_Id);
3119 -- If a pragma Eliminate applies to the source entity, the internal
3120 -- subprograms will be eliminated as well.
3122 Set_Is_Eliminated (New_Id, Is_Eliminated (Def_Id));
3124 if Nkind (Specification (Decl)) = N_Procedure_Specification then
3126 Make_Procedure_Specification (Loc,
3127 Defining_Unit_Name => New_Id,
3128 Parameter_Specifications => New_Plist);
3130 -- Create a new specification for the anonymous subprogram type
3134 Make_Function_Specification (Loc,
3135 Defining_Unit_Name => New_Id,
3136 Parameter_Specifications => New_Plist,
3137 Result_Definition =>
3138 Copy_Result_Type (Result_Definition (Specification (Decl))));
3140 Set_Return_Present (Defining_Unit_Name (New_Spec));
3144 end Build_Protected_Sub_Specification;
3146 -------------------------------------
3147 -- Build_Protected_Subprogram_Body --
3148 -------------------------------------
3150 function Build_Protected_Subprogram_Body
3153 N_Op_Spec : Node_Id) return Node_Id
3155 Loc : constant Source_Ptr := Sloc (N);
3157 P_Op_Spec : Node_Id;
3160 Unprot_Call : Node_Id;
3162 Lock_Name : Node_Id;
3163 Lock_Stmt : Node_Id;
3164 Service_Name : Node_Id;
3166 Return_Stmt : Node_Id := Empty; -- init to avoid gcc 3 warning
3167 Pre_Stmts : List_Id := No_List; -- init to avoid gcc 3 warning
3169 Object_Parm : Node_Id;
3172 function Is_Exception_Safe (Subprogram : Node_Id) return Boolean;
3173 -- Tell whether a given subprogram cannot raise an exception
3175 -----------------------
3176 -- Is_Exception_Safe --
3177 -----------------------
3179 function Is_Exception_Safe (Subprogram : Node_Id) return Boolean is
3181 function Has_Side_Effect (N : Node_Id) return Boolean;
3182 -- Return True whenever encountering a subprogram call or raise
3183 -- statement of any kind in the sequence of statements
3185 ---------------------
3186 -- Has_Side_Effect --
3187 ---------------------
3189 -- What is this doing buried two levels down in exp_ch9. It seems
3190 -- like a generally useful function, and indeed there may be code
3191 -- duplication going on here ???
3193 function Has_Side_Effect (N : Node_Id) return Boolean is
3197 function Is_Call_Or_Raise (N : Node_Id) return Boolean;
3198 -- Indicate whether N is a subprogram call or a raise statement
3200 ----------------------
3201 -- Is_Call_Or_Raise --
3202 ----------------------
3204 function Is_Call_Or_Raise (N : Node_Id) return Boolean is
3206 return Nkind_In (N, N_Procedure_Call_Statement,
3209 N_Raise_Constraint_Error,
3210 N_Raise_Program_Error,
3211 N_Raise_Storage_Error);
3212 end Is_Call_Or_Raise;
3214 -- Start of processing for Has_Side_Effect
3218 while Present (Stmt) loop
3219 if Is_Call_Or_Raise (Stmt) then
3223 -- An object declaration can also contain a function call
3224 -- or a raise statement
3226 if Nkind (Stmt) = N_Object_Declaration then
3227 Expr := Expression (Stmt);
3229 if Present (Expr) and then Is_Call_Or_Raise (Expr) then
3238 end Has_Side_Effect;
3240 -- Start of processing for Is_Exception_Safe
3243 -- If the checks handled by the back end are not disabled, we cannot
3244 -- ensure that no exception will be raised.
3246 if not Access_Checks_Suppressed (Empty)
3247 or else not Discriminant_Checks_Suppressed (Empty)
3248 or else not Range_Checks_Suppressed (Empty)
3249 or else not Index_Checks_Suppressed (Empty)
3250 or else Opt.Stack_Checking_Enabled
3255 if Has_Side_Effect (First (Declarations (Subprogram)))
3258 First (Statements (Handled_Statement_Sequence (Subprogram))))
3264 end Is_Exception_Safe;
3266 -- Start of processing for Build_Protected_Subprogram_Body
3269 Op_Spec := Specification (N);
3270 Exc_Safe := Is_Exception_Safe (N);
3273 Build_Protected_Sub_Specification (N, Pid, Protected_Mode);
3275 -- Build a list of the formal parameters of the protected version of
3276 -- the subprogram to use as the actual parameters of the unprotected
3279 Uactuals := New_List;
3280 Pformal := First (Parameter_Specifications (P_Op_Spec));
3281 while Present (Pformal) loop
3282 Append_To (Uactuals,
3283 Make_Identifier (Loc, Chars (Defining_Identifier (Pformal))));
3287 -- Make a call to the unprotected version of the subprogram built above
3288 -- for use by the protected version built below.
3290 if Nkind (Op_Spec) = N_Function_Specification then
3292 R := Make_Temporary (Loc, 'R');
3294 Make_Object_Declaration (Loc,
3295 Defining_Identifier => R,
3296 Constant_Present => True,
3297 Object_Definition => New_Copy (Result_Definition (N_Op_Spec)),
3299 Make_Function_Call (Loc,
3300 Name => Make_Identifier (Loc,
3301 Chars => Chars (Defining_Unit_Name (N_Op_Spec))),
3302 Parameter_Associations => Uactuals));
3305 Make_Simple_Return_Statement (Loc,
3306 Expression => New_Reference_To (R, Loc));
3309 Unprot_Call := Make_Simple_Return_Statement (Loc,
3310 Expression => Make_Function_Call (Loc,
3312 Make_Identifier (Loc,
3313 Chars => Chars (Defining_Unit_Name (N_Op_Spec))),
3314 Parameter_Associations => Uactuals));
3319 Make_Procedure_Call_Statement (Loc,
3321 Make_Identifier (Loc, Chars (Defining_Unit_Name (N_Op_Spec))),
3322 Parameter_Associations => Uactuals);
3325 -- Wrap call in block that will be covered by an at_end handler
3327 if not Exc_Safe then
3328 Unprot_Call := Make_Block_Statement (Loc,
3329 Handled_Statement_Sequence =>
3330 Make_Handled_Sequence_Of_Statements (Loc,
3331 Statements => New_List (Unprot_Call)));
3334 -- Make the protected subprogram body. This locks the protected
3335 -- object and calls the unprotected version of the subprogram.
3337 case Corresponding_Runtime_Package (Pid) is
3338 when System_Tasking_Protected_Objects_Entries =>
3339 Lock_Name := New_Reference_To (RTE (RE_Lock_Entries), Loc);
3340 Service_Name := New_Reference_To (RTE (RE_Service_Entries), Loc);
3342 when System_Tasking_Protected_Objects_Single_Entry =>
3343 Lock_Name := New_Reference_To (RTE (RE_Lock_Entry), Loc);
3344 Service_Name := New_Reference_To (RTE (RE_Service_Entry), Loc);
3346 when System_Tasking_Protected_Objects =>
3347 Lock_Name := New_Reference_To (RTE (RE_Lock), Loc);
3348 Service_Name := New_Reference_To (RTE (RE_Unlock), Loc);
3351 raise Program_Error;
3355 Make_Attribute_Reference (Loc,
3357 Make_Selected_Component (Loc,
3358 Prefix => Make_Identifier (Loc, Name_uObject),
3359 Selector_Name => Make_Identifier (Loc, Name_uObject)),
3360 Attribute_Name => Name_Unchecked_Access);
3362 Lock_Stmt := Make_Procedure_Call_Statement (Loc,
3364 Parameter_Associations => New_List (Object_Parm));
3366 if Abort_Allowed then
3368 Make_Procedure_Call_Statement (Loc,
3369 Name => New_Reference_To (RTE (RE_Abort_Defer), Loc),
3370 Parameter_Associations => Empty_List),
3374 Stmts := New_List (Lock_Stmt);
3377 if not Exc_Safe then
3378 Append (Unprot_Call, Stmts);
3380 if Nkind (Op_Spec) = N_Function_Specification then
3382 Stmts := Empty_List;
3384 Append (Unprot_Call, Stmts);
3388 Make_Procedure_Call_Statement (Loc,
3389 Name => Service_Name,
3390 Parameter_Associations =>
3391 New_List (New_Copy_Tree (Object_Parm))),
3394 if Abort_Allowed then
3396 Make_Procedure_Call_Statement (Loc,
3397 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc),
3398 Parameter_Associations => Empty_List),
3402 if Nkind (Op_Spec) = N_Function_Specification then
3403 Append (Return_Stmt, Stmts);
3404 Append (Make_Block_Statement (Loc,
3405 Declarations => New_List (Unprot_Call),
3406 Handled_Statement_Sequence =>
3407 Make_Handled_Sequence_Of_Statements (Loc,
3408 Statements => Stmts)), Pre_Stmts);
3414 Make_Subprogram_Body (Loc,
3415 Declarations => Empty_List,
3416 Specification => P_Op_Spec,
3417 Handled_Statement_Sequence =>
3418 Make_Handled_Sequence_Of_Statements (Loc, Statements => Stmts));
3420 if not Exc_Safe then
3421 Set_Is_Protected_Subprogram_Body (Sub_Body);
3425 end Build_Protected_Subprogram_Body;
3427 -------------------------------------
3428 -- Build_Protected_Subprogram_Call --
3429 -------------------------------------
3431 procedure Build_Protected_Subprogram_Call
3435 External : Boolean := True)
3437 Loc : constant Source_Ptr := Sloc (N);
3438 Sub : constant Entity_Id := Entity (Name);
3444 New_Sub := New_Occurrence_Of (External_Subprogram (Sub), Loc);
3447 New_Occurrence_Of (Protected_Body_Subprogram (Sub), Loc);
3450 if Present (Parameter_Associations (N)) then
3451 Params := New_Copy_List_Tree (Parameter_Associations (N));
3456 -- If the type is an untagged derived type, convert to the root type,
3457 -- which is the one on which the operations are defined.
3459 if Nkind (Rec) = N_Unchecked_Type_Conversion
3460 and then not Is_Tagged_Type (Etype (Rec))
3461 and then Is_Derived_Type (Etype (Rec))
3463 Set_Etype (Rec, Root_Type (Etype (Rec)));
3464 Set_Subtype_Mark (Rec,
3465 New_Occurrence_Of (Root_Type (Etype (Rec)), Sloc (N)));
3468 Prepend (Rec, Params);
3470 if Ekind (Sub) = E_Procedure then
3472 Make_Procedure_Call_Statement (Loc,
3474 Parameter_Associations => Params));
3477 pragma Assert (Ekind (Sub) = E_Function);
3479 Make_Function_Call (Loc,
3481 Parameter_Associations => Params));
3485 and then Nkind (Rec) = N_Unchecked_Type_Conversion
3486 and then Is_Entity_Name (Expression (Rec))
3487 and then Is_Shared_Passive (Entity (Expression (Rec)))
3489 Add_Shared_Var_Lock_Procs (N);
3491 end Build_Protected_Subprogram_Call;
3493 -------------------------
3494 -- Build_Selected_Name --
3495 -------------------------
3497 function Build_Selected_Name
3498 (Prefix : Entity_Id;
3499 Selector : Entity_Id;
3500 Append_Char : Character := ' ') return Name_Id
3502 Select_Buffer : String (1 .. Hostparm.Max_Name_Length);
3503 Select_Len : Natural;
3506 Get_Name_String (Chars (Selector));
3507 Select_Len := Name_Len;
3508 Select_Buffer (1 .. Select_Len) := Name_Buffer (1 .. Name_Len);
3509 Get_Name_String (Chars (Prefix));
3511 -- If scope is anonymous type, discard suffix to recover name of
3512 -- single protected object. Otherwise use protected type name.
3514 if Name_Buffer (Name_Len) = 'T' then
3515 Name_Len := Name_Len - 1;
3518 Add_Str_To_Name_Buffer ("__");
3519 for J in 1 .. Select_Len loop
3520 Add_Char_To_Name_Buffer (Select_Buffer (J));
3523 -- Now add the Append_Char if specified. The encoding to follow
3524 -- depends on the type of entity. If Append_Char is either 'N' or 'P',
3525 -- then the entity is associated to a protected type subprogram.
3526 -- Otherwise, it is a protected type entry. For each case, the
3527 -- encoding to follow for the suffix is documented in exp_dbug.ads.
3529 -- It would be better to encapsulate this as a routine in Exp_Dbug ???
3531 if Append_Char /= ' ' then
3532 if Append_Char = 'P' or Append_Char = 'N' then
3533 Add_Char_To_Name_Buffer (Append_Char);
3536 Add_Str_To_Name_Buffer ((1 => '_', 2 => Append_Char));
3537 return New_External_Name (Name_Find, ' ', -1);
3542 end Build_Selected_Name;
3544 -----------------------------
3545 -- Build_Simple_Entry_Call --
3546 -----------------------------
3548 -- A task entry call is converted to a call to Call_Simple
3551 -- P : parms := (parm, parm, parm);
3553 -- Call_Simple (acceptor-task, entry-index, P'Address);
3559 -- Here Pnn is an aggregate of the type constructed for the entry to hold
3560 -- the parameters, and the constructed aggregate value contains either the
3561 -- parameters or, in the case of non-elementary types, references to these
3562 -- parameters. Then the address of this aggregate is passed to the runtime
3563 -- routine, along with the task id value and the task entry index value.
3564 -- Pnn is only required if parameters are present.
3566 -- The assignments after the call are present only in the case of in-out
3567 -- or out parameters for elementary types, and are used to assign back the
3568 -- resulting values of such parameters.
3570 -- Note: the reason that we insert a block here is that in the context
3571 -- of selects, conditional entry calls etc. the entry call statement
3572 -- appears on its own, not as an element of a list.
3574 -- A protected entry call is converted to a Protected_Entry_Call:
3577 -- P : E1_Params := (param, param, param);
3579 -- Bnn : Communications_Block;
3582 -- P : E1_Params := (param, param, param);
3583 -- Bnn : Communications_Block;
3586 -- Protected_Entry_Call (
3587 -- Object => po._object'Access,
3588 -- E => <entry index>;
3589 -- Uninterpreted_Data => P'Address;
3590 -- Mode => Simple_Call;
3597 procedure Build_Simple_Entry_Call
3606 -- If call has been inlined, nothing left to do
3608 if Nkind (N) = N_Block_Statement then
3612 -- Convert entry call to Call_Simple call
3615 Loc : constant Source_Ptr := Sloc (N);
3616 Parms : constant List_Id := Parameter_Associations (N);
3617 Stats : constant List_Id := New_List;
3620 Comm_Name : Entity_Id;
3624 Ent_Acc : Entity_Id;
3626 Iface_Tag : Entity_Id;
3627 Iface_Typ : Entity_Id;
3640 -- Simple entry and entry family cases merge here
3642 Ent := Entity (Ename);
3643 Ent_Acc := Entry_Parameters_Type (Ent);
3644 Conctyp := Etype (Concval);
3646 -- If prefix is an access type, dereference to obtain the task type
3648 if Is_Access_Type (Conctyp) then
3649 Conctyp := Designated_Type (Conctyp);
3652 -- Special case for protected subprogram calls
3654 if Is_Protected_Type (Conctyp)
3655 and then Is_Subprogram (Entity (Ename))
3657 if not Is_Eliminated (Entity (Ename)) then
3658 Build_Protected_Subprogram_Call
3659 (N, Ename, Convert_Concurrent (Concval, Conctyp));
3666 -- First parameter is the Task_Id value from the task value or the
3667 -- Object from the protected object value, obtained by selecting
3668 -- the _Task_Id or _Object from the result of doing an unchecked
3669 -- conversion to convert the value to the corresponding record type.
3671 if Nkind (Concval) = N_Function_Call
3672 and then Is_Task_Type (Conctyp)
3673 and then Ada_Version >= Ada_2005
3676 ExpR : constant Node_Id := Relocate_Node (Concval);
3677 Obj : constant Entity_Id := Make_Temporary (Loc, 'F', ExpR);
3682 Make_Object_Declaration (Loc,
3683 Defining_Identifier => Obj,
3684 Object_Definition => New_Occurrence_Of (Conctyp, Loc),
3685 Expression => ExpR);
3686 Set_Etype (Obj, Conctyp);
3687 Decls := New_List (Decl);
3688 Rewrite (Concval, New_Occurrence_Of (Obj, Loc));
3695 Parm1 := Concurrent_Ref (Concval);
3697 -- Second parameter is the entry index, computed by the routine
3698 -- provided for this purpose. The value of this expression is
3699 -- assigned to an intermediate variable to assure that any entry
3700 -- family index expressions are evaluated before the entry
3704 or else Restriction_Active (No_Entry_Queue) = False
3705 or else not Is_Protected_Type (Conctyp)
3706 or else Number_Entries (Conctyp) > 1
3707 or else (Has_Attach_Handler (Conctyp)
3708 and then not Restricted_Profile)
3710 X := Make_Defining_Identifier (Loc, Name_uX);
3713 Make_Object_Declaration (Loc,
3714 Defining_Identifier => X,
3715 Object_Definition =>
3716 New_Reference_To (RTE (RE_Task_Entry_Index), Loc),
3717 Expression => Actual_Index_Expression (
3718 Loc, Entity (Ename), Index, Concval));
3720 Append_To (Decls, Xdecl);
3721 Parm2 := New_Reference_To (X, Loc);
3728 -- The third parameter is the packaged parameters. If there are
3729 -- none, then it is just the null address, since nothing is passed.
3732 Parm3 := New_Reference_To (RTE (RE_Null_Address), Loc);
3735 -- Case of parameters present, where third argument is the address
3736 -- of a packaged record containing the required parameter values.
3739 -- First build a list of parameter values, which are references to
3740 -- objects of the parameter types.
3744 Actual := First_Actual (N);
3745 Formal := First_Formal (Ent);
3747 while Present (Actual) loop
3749 -- If it is a by_copy_type, copy it to a new variable. The
3750 -- packaged record has a field that points to this variable.
3752 if Is_By_Copy_Type (Etype (Actual)) then
3754 Make_Object_Declaration (Loc,
3755 Defining_Identifier => Make_Temporary (Loc, 'J'),
3756 Aliased_Present => True,
3757 Object_Definition =>
3758 New_Reference_To (Etype (Formal), Loc));
3760 -- Mark the object as not needing initialization since the
3761 -- initialization is performed separately, avoiding errors
3762 -- on cases such as formals of null-excluding access types.
3764 Set_No_Initialization (N_Node);
3766 -- We must make an assignment statement separate for the
3767 -- case of limited type. We cannot assign it unless the
3768 -- Assignment_OK flag is set first. An out formal of an
3769 -- access type must also be initialized from the actual,
3770 -- as stated in RM 6.4.1 (13).
3772 if Ekind (Formal) /= E_Out_Parameter
3773 or else Is_Access_Type (Etype (Formal))
3776 New_Reference_To (Defining_Identifier (N_Node), Loc);
3777 Set_Assignment_OK (N_Var);
3779 Make_Assignment_Statement (Loc,
3781 Expression => Relocate_Node (Actual)));
3784 Append (N_Node, Decls);
3787 Make_Attribute_Reference (Loc,
3788 Attribute_Name => Name_Unchecked_Access,
3790 New_Reference_To (Defining_Identifier (N_Node), Loc)));
3792 -- If it is a VM_By_Copy_Actual, copy it to a new variable
3794 elsif Is_VM_By_Copy_Actual (Actual) then
3796 Make_Object_Declaration (Loc,
3797 Defining_Identifier => Make_Temporary (Loc, 'J'),
3798 Aliased_Present => True,
3799 Object_Definition =>
3800 New_Reference_To (Etype (Formal), Loc),
3801 Expression => New_Copy_Tree (Actual));
3802 Set_Assignment_OK (N_Node);
3804 Append (N_Node, Decls);
3807 Make_Attribute_Reference (Loc,
3808 Attribute_Name => Name_Unchecked_Access,
3810 New_Reference_To (Defining_Identifier (N_Node), Loc)));
3813 -- Interface class-wide formal
3815 if Ada_Version >= Ada_2005
3816 and then Ekind (Etype (Formal)) = E_Class_Wide_Type
3817 and then Is_Interface (Etype (Formal))
3819 Iface_Typ := Etype (Etype (Formal));
3822 -- formal_iface_type! (actual.iface_tag)'reference
3825 Find_Interface_Tag (Etype (Actual), Iface_Typ);
3826 pragma Assert (Present (Iface_Tag));
3829 Make_Reference (Loc,
3830 Unchecked_Convert_To (Iface_Typ,
3831 Make_Selected_Component (Loc,
3833 Relocate_Node (Actual),
3835 New_Reference_To (Iface_Tag, Loc)))));
3841 Make_Reference (Loc, Relocate_Node (Actual)));
3845 Next_Actual (Actual);
3846 Next_Formal_With_Extras (Formal);
3849 -- Now build the declaration of parameters initialized with the
3850 -- aggregate containing this constructed parameter list.
3852 P := Make_Defining_Identifier (Loc, Name_uP);
3855 Make_Object_Declaration (Loc,
3856 Defining_Identifier => P,
3857 Object_Definition =>
3858 New_Reference_To (Designated_Type (Ent_Acc), Loc),
3860 Make_Aggregate (Loc, Expressions => Plist));
3863 Make_Attribute_Reference (Loc,
3864 Prefix => New_Reference_To (P, Loc),
3865 Attribute_Name => Name_Address);
3867 Append (Pdecl, Decls);
3870 -- Now we can create the call, case of protected type
3872 if Is_Protected_Type (Conctyp) then
3873 case Corresponding_Runtime_Package (Conctyp) is
3874 when System_Tasking_Protected_Objects_Entries =>
3876 -- Change the type of the index declaration
3878 Set_Object_Definition (Xdecl,
3879 New_Reference_To (RTE (RE_Protected_Entry_Index), Loc));
3881 -- Some additional declarations for protected entry calls
3887 -- Bnn : Communications_Block;
3889 Comm_Name := Make_Temporary (Loc, 'B');
3892 Make_Object_Declaration (Loc,
3893 Defining_Identifier => Comm_Name,
3894 Object_Definition =>
3895 New_Reference_To (RTE (RE_Communication_Block), Loc)));
3897 -- Some additional statements for protected entry calls
3899 -- Protected_Entry_Call (
3900 -- Object => po._object'Access,
3901 -- E => <entry index>;
3902 -- Uninterpreted_Data => P'Address;
3903 -- Mode => Simple_Call;
3907 Make_Procedure_Call_Statement (Loc,
3909 New_Reference_To (RTE (RE_Protected_Entry_Call), Loc),
3911 Parameter_Associations => New_List (
3912 Make_Attribute_Reference (Loc,
3913 Attribute_Name => Name_Unchecked_Access,
3917 New_Reference_To (RTE (RE_Simple_Call), Loc),
3918 New_Occurrence_Of (Comm_Name, Loc)));
3920 when System_Tasking_Protected_Objects_Single_Entry =>
3921 -- Protected_Single_Entry_Call (
3922 -- Object => po._object'Access,
3923 -- Uninterpreted_Data => P'Address;
3924 -- Mode => Simple_Call);
3927 Make_Procedure_Call_Statement (Loc,
3928 Name => New_Reference_To (
3929 RTE (RE_Protected_Single_Entry_Call), Loc),
3931 Parameter_Associations => New_List (
3932 Make_Attribute_Reference (Loc,
3933 Attribute_Name => Name_Unchecked_Access,
3936 New_Reference_To (RTE (RE_Simple_Call), Loc)));
3939 raise Program_Error;
3942 -- Case of task type
3946 Make_Procedure_Call_Statement (Loc,
3947 Name => New_Reference_To (RTE (RE_Call_Simple), Loc),
3948 Parameter_Associations => New_List (Parm1, Parm2, Parm3));
3952 Append_To (Stats, Call);
3954 -- If there are out or in/out parameters by copy add assignment
3955 -- statements for the result values.
3957 if Present (Parms) then
3958 Actual := First_Actual (N);
3959 Formal := First_Formal (Ent);
3961 Set_Assignment_OK (Actual);
3962 while Present (Actual) loop
3963 if (Is_By_Copy_Type (Etype (Actual))
3964 or else Is_VM_By_Copy_Actual (Actual))
3965 and then Ekind (Formal) /= E_In_Parameter
3968 Make_Assignment_Statement (Loc,
3969 Name => New_Copy (Actual),
3971 Make_Explicit_Dereference (Loc,
3972 Make_Selected_Component (Loc,
3973 Prefix => New_Reference_To (P, Loc),
3975 Make_Identifier (Loc, Chars (Formal)))));
3977 -- In all cases (including limited private types) we want
3978 -- the assignment to be valid.
3980 Set_Assignment_OK (Name (N_Node));
3982 -- If the call is the triggering alternative in an
3983 -- asynchronous select, or the entry_call alternative of a
3984 -- conditional entry call, the assignments for in-out
3985 -- parameters are incorporated into the statement list that
3986 -- follows, so that there are executed only if the entry
3989 if (Nkind (Parent (N)) = N_Triggering_Alternative
3990 and then N = Triggering_Statement (Parent (N)))
3992 (Nkind (Parent (N)) = N_Entry_Call_Alternative
3993 and then N = Entry_Call_Statement (Parent (N)))
3995 if No (Statements (Parent (N))) then
3996 Set_Statements (Parent (N), New_List);
3999 Prepend (N_Node, Statements (Parent (N)));
4002 Insert_After (Call, N_Node);
4006 Next_Actual (Actual);
4007 Next_Formal_With_Extras (Formal);
4011 -- Finally, create block and analyze it
4014 Make_Block_Statement (Loc,
4015 Declarations => Decls,
4016 Handled_Statement_Sequence =>
4017 Make_Handled_Sequence_Of_Statements (Loc,
4018 Statements => Stats)));
4022 end Build_Simple_Entry_Call;
4024 --------------------------------
4025 -- Build_Task_Activation_Call --
4026 --------------------------------
4028 procedure Build_Task_Activation_Call (N : Node_Id) is
4029 Loc : constant Source_Ptr := Sloc (N);
4036 -- Get the activation chain entity. Except in the case of a package
4037 -- body, this is in the node that was passed. For a package body, we
4038 -- have to find the corresponding package declaration node.
4040 if Nkind (N) = N_Package_Body then
4041 P := Corresponding_Spec (N);
4044 exit when Nkind (P) = N_Package_Declaration;
4047 Chain := Activation_Chain_Entity (P);
4050 Chain := Activation_Chain_Entity (N);
4053 if Present (Chain) then
4054 if Restricted_Profile then
4055 Name := New_Reference_To (RTE (RE_Activate_Restricted_Tasks), Loc);
4057 Name := New_Reference_To (RTE (RE_Activate_Tasks), Loc);
4061 Make_Procedure_Call_Statement (Loc,
4063 Parameter_Associations =>
4064 New_List (Make_Attribute_Reference (Loc,
4065 Prefix => New_Occurrence_Of (Chain, Loc),
4066 Attribute_Name => Name_Unchecked_Access)));
4068 if Nkind (N) = N_Package_Declaration then
4069 if Present (Corresponding_Body (N)) then
4072 elsif Present (Private_Declarations (Specification (N))) then
4073 Append (Call, Private_Declarations (Specification (N)));
4076 Append (Call, Visible_Declarations (Specification (N)));
4080 if Present (Handled_Statement_Sequence (N)) then
4082 -- The call goes at the start of the statement sequence
4083 -- after the start of exception range label if one is present.
4089 Stm := First (Statements (Handled_Statement_Sequence (N)));
4091 -- A special case, skip exception range label if one is
4092 -- present (from front end zcx processing).
4094 if Nkind (Stm) = N_Label and then Exception_Junk (Stm) then
4098 -- Another special case, if the first statement is a block
4099 -- from optimization of a local raise to a goto, then the
4100 -- call goes inside this block.
4102 if Nkind (Stm) = N_Block_Statement
4103 and then Exception_Junk (Stm)
4106 First (Statements (Handled_Statement_Sequence (Stm)));
4109 -- Insertion point is after any exception label pushes,
4110 -- since we want it covered by any local handlers.
4112 while Nkind (Stm) in N_Push_xxx_Label loop
4116 -- Now we have the proper insertion point
4118 Insert_Before (Stm, Call);
4122 Set_Handled_Statement_Sequence (N,
4123 Make_Handled_Sequence_Of_Statements (Loc,
4124 Statements => New_List (Call)));
4129 Check_Task_Activation (N);
4131 end Build_Task_Activation_Call;
4133 -------------------------------
4134 -- Build_Task_Allocate_Block --
4135 -------------------------------
4137 procedure Build_Task_Allocate_Block
4142 T : constant Entity_Id := Entity (Expression (N));
4143 Init : constant Entity_Id := Base_Init_Proc (T);
4144 Loc : constant Source_Ptr := Sloc (N);
4145 Chain : constant Entity_Id :=
4146 Make_Defining_Identifier (Loc, Name_uChain);
4147 Blkent : constant Entity_Id := Make_Temporary (Loc, 'A');
4152 Make_Block_Statement (Loc,
4153 Identifier => New_Reference_To (Blkent, Loc),
4154 Declarations => New_List (
4156 -- _Chain : Activation_Chain;
4158 Make_Object_Declaration (Loc,
4159 Defining_Identifier => Chain,
4160 Aliased_Present => True,
4161 Object_Definition =>
4162 New_Reference_To (RTE (RE_Activation_Chain), Loc))),
4164 Handled_Statement_Sequence =>
4165 Make_Handled_Sequence_Of_Statements (Loc,
4167 Statements => New_List (
4171 Make_Procedure_Call_Statement (Loc,
4172 Name => New_Reference_To (Init, Loc),
4173 Parameter_Associations => Args),
4175 -- Activate_Tasks (_Chain);
4177 Make_Procedure_Call_Statement (Loc,
4178 Name => New_Reference_To (RTE (RE_Activate_Tasks), Loc),
4179 Parameter_Associations => New_List (
4180 Make_Attribute_Reference (Loc,
4181 Prefix => New_Reference_To (Chain, Loc),
4182 Attribute_Name => Name_Unchecked_Access))))),
4184 Has_Created_Identifier => True,
4185 Is_Task_Allocation_Block => True);
4188 Make_Implicit_Label_Declaration (Loc,
4189 Defining_Identifier => Blkent,
4190 Label_Construct => Block));
4192 Append_To (Actions, Block);
4194 Set_Activation_Chain_Entity (Block, Chain);
4195 end Build_Task_Allocate_Block;
4197 -----------------------------------------------
4198 -- Build_Task_Allocate_Block_With_Init_Stmts --
4199 -----------------------------------------------
4201 procedure Build_Task_Allocate_Block_With_Init_Stmts
4204 Init_Stmts : List_Id)
4206 Loc : constant Source_Ptr := Sloc (N);
4207 Chain : constant Entity_Id :=
4208 Make_Defining_Identifier (Loc, Name_uChain);
4209 Blkent : constant Entity_Id := Make_Temporary (Loc, 'A');
4213 Append_To (Init_Stmts,
4214 Make_Procedure_Call_Statement (Loc,
4215 Name => New_Reference_To (RTE (RE_Activate_Tasks), Loc),
4216 Parameter_Associations => New_List (
4217 Make_Attribute_Reference (Loc,
4218 Prefix => New_Reference_To (Chain, Loc),
4219 Attribute_Name => Name_Unchecked_Access))));
4222 Make_Block_Statement (Loc,
4223 Identifier => New_Reference_To (Blkent, Loc),
4224 Declarations => New_List (
4226 -- _Chain : Activation_Chain;
4228 Make_Object_Declaration (Loc,
4229 Defining_Identifier => Chain,
4230 Aliased_Present => True,
4231 Object_Definition =>
4232 New_Reference_To (RTE (RE_Activation_Chain), Loc))),
4234 Handled_Statement_Sequence =>
4235 Make_Handled_Sequence_Of_Statements (Loc, Init_Stmts),
4237 Has_Created_Identifier => True,
4238 Is_Task_Allocation_Block => True);
4241 Make_Implicit_Label_Declaration (Loc,
4242 Defining_Identifier => Blkent,
4243 Label_Construct => Block));
4245 Append_To (Actions, Block);
4247 Set_Activation_Chain_Entity (Block, Chain);
4248 end Build_Task_Allocate_Block_With_Init_Stmts;
4250 -----------------------------------
4251 -- Build_Task_Proc_Specification --
4252 -----------------------------------
4254 function Build_Task_Proc_Specification (T : Entity_Id) return Node_Id is
4255 Loc : constant Source_Ptr := Sloc (T);
4256 Spec_Id : Entity_Id;
4259 -- Case of explicit task type, suffix TB
4261 if Comes_From_Source (T) then
4263 Make_Defining_Identifier (Loc,
4264 Chars => New_External_Name (Chars (T), "TB"));
4266 -- Case of anonymous task type, suffix B
4270 Make_Defining_Identifier (Loc,
4271 Chars => New_External_Name (Chars (T), 'B'));
4274 Set_Is_Internal (Spec_Id);
4276 -- Associate the procedure with the task, if this is the declaration
4277 -- (and not the body) of the procedure.
4279 if No (Task_Body_Procedure (T)) then
4280 Set_Task_Body_Procedure (T, Spec_Id);
4284 Make_Procedure_Specification (Loc,
4285 Defining_Unit_Name => Spec_Id,
4286 Parameter_Specifications => New_List (
4287 Make_Parameter_Specification (Loc,
4288 Defining_Identifier =>
4289 Make_Defining_Identifier (Loc, Name_uTask),
4291 Make_Access_Definition (Loc,
4293 New_Reference_To (Corresponding_Record_Type (T), Loc)))));
4294 end Build_Task_Proc_Specification;
4296 ---------------------------------------
4297 -- Build_Unprotected_Subprogram_Body --
4298 ---------------------------------------
4300 function Build_Unprotected_Subprogram_Body
4302 Pid : Node_Id) return Node_Id
4304 Decls : constant List_Id := Declarations (N);
4307 -- Add renamings for the Protection object, discriminals, privals and
4308 -- the entry index constant for use by debugger.
4310 Debug_Private_Data_Declarations (Decls);
4312 -- Make an unprotected version of the subprogram for use within the same
4313 -- object, with a new name and an additional parameter representing the
4317 Make_Subprogram_Body (Sloc (N),
4319 Build_Protected_Sub_Specification (N, Pid, Unprotected_Mode),
4320 Declarations => Decls,
4321 Handled_Statement_Sequence => Handled_Statement_Sequence (N));
4322 end Build_Unprotected_Subprogram_Body;
4324 ----------------------------
4325 -- Collect_Entry_Families --
4326 ----------------------------
4328 procedure Collect_Entry_Families
4331 Current_Node : in out Node_Id;
4332 Conctyp : Entity_Id)
4335 Efam_Decl : Node_Id;
4336 Efam_Type : Entity_Id;
4339 Efam := First_Entity (Conctyp);
4340 while Present (Efam) loop
4341 if Ekind (Efam) = E_Entry_Family then
4342 Efam_Type := Make_Temporary (Loc, 'F');
4347 (Etype (Discrete_Subtype_Definition (Parent (Efam))));
4349 Bas_Decl : Node_Id := Empty;
4354 (Discrete_Subtype_Definition (Parent (Efam)), Lo, Hi);
4356 if Is_Potentially_Large_Family (Bas, Conctyp, Lo, Hi) then
4357 Bas := Make_Temporary (Loc, 'B');
4360 Make_Subtype_Declaration (Loc,
4361 Defining_Identifier => Bas,
4362 Subtype_Indication =>
4363 Make_Subtype_Indication (Loc,
4365 New_Occurrence_Of (Standard_Integer, Loc),
4367 Make_Range_Constraint (Loc,
4368 Range_Expression => Make_Range (Loc,
4369 Make_Integer_Literal
4370 (Loc, -Entry_Family_Bound),
4371 Make_Integer_Literal
4372 (Loc, Entry_Family_Bound - 1)))));
4374 Insert_After (Current_Node, Bas_Decl);
4375 Current_Node := Bas_Decl;
4380 Make_Full_Type_Declaration (Loc,
4381 Defining_Identifier => Efam_Type,
4383 Make_Unconstrained_Array_Definition (Loc,
4385 (New_List (New_Occurrence_Of (Bas, Loc))),
4387 Component_Definition =>
4388 Make_Component_Definition (Loc,
4389 Aliased_Present => False,
4390 Subtype_Indication =>
4391 New_Reference_To (Standard_Character, Loc))));
4394 Insert_After (Current_Node, Efam_Decl);
4395 Current_Node := Efam_Decl;
4396 Analyze (Efam_Decl);
4399 Make_Component_Declaration (Loc,
4400 Defining_Identifier =>
4401 Make_Defining_Identifier (Loc, Chars (Efam)),
4403 Component_Definition =>
4404 Make_Component_Definition (Loc,
4405 Aliased_Present => False,
4406 Subtype_Indication =>
4407 Make_Subtype_Indication (Loc,
4409 New_Occurrence_Of (Efam_Type, Loc),
4412 Make_Index_Or_Discriminant_Constraint (Loc,
4413 Constraints => New_List (
4415 (Etype (Discrete_Subtype_Definition
4416 (Parent (Efam))), Loc)))))));
4422 end Collect_Entry_Families;
4424 -----------------------
4425 -- Concurrent_Object --
4426 -----------------------
4428 function Concurrent_Object
4429 (Spec_Id : Entity_Id;
4430 Conc_Typ : Entity_Id) return Entity_Id
4433 -- Parameter _O or _object
4435 if Is_Protected_Type (Conc_Typ) then
4436 return First_Formal (Protected_Body_Subprogram (Spec_Id));
4441 pragma Assert (Is_Task_Type (Conc_Typ));
4442 return First_Formal (Task_Body_Procedure (Conc_Typ));
4444 end Concurrent_Object;
4446 ----------------------
4447 -- Copy_Result_Type --
4448 ----------------------
4450 function Copy_Result_Type (Res : Node_Id) return Node_Id is
4451 New_Res : constant Node_Id := New_Copy_Tree (Res);
4456 -- If the result type is an access_to_subprogram, we must create
4457 -- new entities for its spec.
4459 if Nkind (New_Res) = N_Access_Definition
4460 and then Present (Access_To_Subprogram_Definition (New_Res))
4462 -- Provide new entities for the formals
4464 Par_Spec := First (Parameter_Specifications
4465 (Access_To_Subprogram_Definition (New_Res)));
4466 while Present (Par_Spec) loop
4467 Formal := Defining_Identifier (Par_Spec);
4468 Set_Defining_Identifier (Par_Spec,
4469 Make_Defining_Identifier (Sloc (Formal), Chars (Formal)));
4475 end Copy_Result_Type;
4477 --------------------
4478 -- Concurrent_Ref --
4479 --------------------
4481 -- The expression returned for a reference to a concurrent object has the
4484 -- taskV!(name)._Task_Id
4488 -- objectV!(name)._Object
4490 -- for a protected object. For the case of an access to a concurrent
4491 -- object, there is an extra explicit dereference:
4493 -- taskV!(name.all)._Task_Id
4494 -- objectV!(name.all)._Object
4496 -- here taskV and objectV are the types for the associated records, which
4497 -- contain the required _Task_Id and _Object fields for tasks and protected
4498 -- objects, respectively.
4500 -- For the case of a task type name, the expression is
4504 -- i.e. a call to the Self function which returns precisely this Task_Id
4506 -- For the case of a protected type name, the expression is
4510 -- which is a renaming of the _object field of the current object
4511 -- record, passed into protected operations as a parameter.
4513 function Concurrent_Ref (N : Node_Id) return Node_Id is
4514 Loc : constant Source_Ptr := Sloc (N);
4515 Ntyp : constant Entity_Id := Etype (N);
4519 function Is_Current_Task (T : Entity_Id) return Boolean;
4520 -- Check whether the reference is to the immediately enclosing task
4521 -- type, or to an outer one (rare but legal).
4523 ---------------------
4524 -- Is_Current_Task --
4525 ---------------------
4527 function Is_Current_Task (T : Entity_Id) return Boolean is
4531 Scop := Current_Scope;
4532 while Present (Scop)
4533 and then Scop /= Standard_Standard
4539 elsif Is_Task_Type (Scop) then
4542 -- If this is a procedure nested within the task type, we must
4543 -- assume that it can be called from an inner task, and therefore
4544 -- cannot treat it as a local reference.
4546 elsif Is_Overloadable (Scop)
4547 and then In_Open_Scopes (T)
4552 Scop := Scope (Scop);
4556 -- We know that we are within the task body, so should have found it
4559 raise Program_Error;
4560 end Is_Current_Task;
4562 -- Start of processing for Concurrent_Ref
4565 if Is_Access_Type (Ntyp) then
4566 Dtyp := Designated_Type (Ntyp);
4568 if Is_Protected_Type (Dtyp) then
4569 Sel := Name_uObject;
4571 Sel := Name_uTask_Id;
4575 Make_Selected_Component (Loc,
4577 Unchecked_Convert_To (Corresponding_Record_Type (Dtyp),
4578 Make_Explicit_Dereference (Loc, N)),
4579 Selector_Name => Make_Identifier (Loc, Sel));
4581 elsif Is_Entity_Name (N)
4582 and then Is_Concurrent_Type (Entity (N))
4584 if Is_Task_Type (Entity (N)) then
4586 if Is_Current_Task (Entity (N)) then
4588 Make_Function_Call (Loc,
4589 Name => New_Reference_To (RTE (RE_Self), Loc));
4594 T_Self : constant Entity_Id := Make_Temporary (Loc, 'T');
4595 T_Body : constant Node_Id :=
4596 Parent (Corresponding_Body (Parent (Entity (N))));
4600 Make_Object_Declaration (Loc,
4601 Defining_Identifier => T_Self,
4602 Object_Definition =>
4603 New_Occurrence_Of (RTE (RO_ST_Task_Id), Loc),
4605 Make_Function_Call (Loc,
4606 Name => New_Reference_To (RTE (RE_Self), Loc)));
4607 Prepend (Decl, Declarations (T_Body));
4609 Set_Scope (T_Self, Entity (N));
4610 return New_Occurrence_Of (T_Self, Loc);
4615 pragma Assert (Is_Protected_Type (Entity (N)));
4618 New_Reference_To (Find_Protection_Object (Current_Scope), Loc);
4622 if Is_Protected_Type (Ntyp) then
4623 Sel := Name_uObject;
4625 elsif Is_Task_Type (Ntyp) then
4626 Sel := Name_uTask_Id;
4629 raise Program_Error;
4633 Make_Selected_Component (Loc,
4635 Unchecked_Convert_To (Corresponding_Record_Type (Ntyp),
4637 Selector_Name => Make_Identifier (Loc, Sel));
4641 ------------------------
4642 -- Convert_Concurrent --
4643 ------------------------
4645 function Convert_Concurrent
4647 Typ : Entity_Id) return Node_Id
4650 if not Is_Concurrent_Type (Typ) then
4654 Unchecked_Convert_To
4655 (Corresponding_Record_Type (Typ), New_Copy_Tree (N));
4657 end Convert_Concurrent;
4659 -------------------------------------
4660 -- Debug_Private_Data_Declarations --
4661 -------------------------------------
4663 procedure Debug_Private_Data_Declarations (Decls : List_Id) is
4664 Debug_Nod : Node_Id;
4668 Decl := First (Decls);
4669 while Present (Decl)
4670 and then not Comes_From_Source (Decl)
4672 -- Declaration for concurrent entity _object and its access type,
4673 -- along with the entry index subtype:
4674 -- type prot_typVP is access prot_typV;
4675 -- _object : prot_typVP := prot_typV (_O);
4676 -- subtype Jnn is <Type of Index> range Low .. High;
4678 if Nkind_In (Decl, N_Full_Type_Declaration, N_Object_Declaration) then
4679 Set_Debug_Info_Needed (Defining_Identifier (Decl));
4681 -- Declaration for the Protection object, discriminals, privals and
4682 -- entry index constant:
4683 -- conc_typR : protection_typ renames _object._object;
4684 -- discr_nameD : discr_typ renames _object.discr_name;
4685 -- discr_nameD : discr_typ renames _task.discr_name;
4686 -- prival_name : comp_typ renames _object.comp_name;
4687 -- J : constant Jnn :=
4688 -- Jnn'Val (_E - <Index expression> + Jnn'Pos (Jnn'First));
4690 elsif Nkind (Decl) = N_Object_Renaming_Declaration then
4691 Set_Debug_Info_Needed (Defining_Identifier (Decl));
4692 Debug_Nod := Debug_Renaming_Declaration (Decl);
4694 if Present (Debug_Nod) then
4695 Insert_After (Decl, Debug_Nod);
4701 end Debug_Private_Data_Declarations;
4703 ----------------------------
4704 -- Entry_Index_Expression --
4705 ----------------------------
4707 function Entry_Index_Expression
4711 Ttyp : Entity_Id) return Node_Id
4721 -- The queues of entries and entry families appear in textual order in
4722 -- the associated record. The entry index is computed as the sum of the
4723 -- number of queues for all entries that precede the designated one, to
4724 -- which is added the index expression, if this expression denotes a
4725 -- member of a family.
4727 -- The following is a place holder for the count of simple entries
4729 Num := Make_Integer_Literal (Sloc, 1);
4731 -- We construct an expression which is a series of addition operations.
4732 -- The first operand is the number of single entries that precede this
4733 -- one, the second operand is the index value relative to the start of
4734 -- the referenced family, and the remaining operands are the lengths of
4735 -- the entry families that precede this entry, i.e. the constructed
4738 -- number_simple_entries +
4739 -- (s'pos (index-value) - s'pos (family'first)) + 1 +
4740 -- family'length + ...
4742 -- where index-value is the given index value, and s is the index
4743 -- subtype (we have to use pos because the subtype might be an
4744 -- enumeration type preventing direct subtraction). Note that the task
4745 -- entry array is one-indexed.
4747 -- The upper bound of the entry family may be a discriminant, so we
4748 -- retrieve the lower bound explicitly to compute offset, rather than
4749 -- using the index subtype which may mention a discriminant.
4751 if Present (Index) then
4752 S := Etype (Discrete_Subtype_Definition (Declaration_Node (Ent)));
4761 Make_Attribute_Reference (Sloc,
4762 Attribute_Name => Name_Pos,
4763 Prefix => New_Reference_To (Base_Type (S), Sloc),
4764 Expressions => New_List (Relocate_Node (Index))),
4772 -- Now add lengths of preceding entries and entry families
4774 Prev := First_Entity (Ttyp);
4776 while Chars (Prev) /= Chars (Ent)
4777 or else (Ekind (Prev) /= Ekind (Ent))
4778 or else not Sem_Ch6.Type_Conformant (Ent, Prev)
4780 if Ekind (Prev) = E_Entry then
4781 Set_Intval (Num, Intval (Num) + 1);
4783 elsif Ekind (Prev) = E_Entry_Family then
4785 Etype (Discrete_Subtype_Definition (Declaration_Node (Prev)));
4786 Lo := Type_Low_Bound (S);
4787 Hi := Type_High_Bound (S);
4792 Right_Opnd => Family_Size (Sloc, Hi, Lo, Ttyp, False));
4794 -- Other components are anonymous types to be ignored
4804 end Entry_Index_Expression;
4806 ---------------------------
4807 -- Establish_Task_Master --
4808 ---------------------------
4810 procedure Establish_Task_Master (N : Node_Id) is
4813 if Restriction_Active (No_Task_Hierarchy) = False then
4814 Call := Build_Runtime_Call (Sloc (N), RE_Enter_Master);
4815 Prepend_To (Declarations (N), Call);
4818 end Establish_Task_Master;
4820 --------------------------------
4821 -- Expand_Accept_Declarations --
4822 --------------------------------
4824 -- Part of the expansion of an accept statement involves the creation of
4825 -- a declaration that can be referenced from the statement sequence of
4830 -- This declaration is inserted immediately before the accept statement
4831 -- and it is important that it be inserted before the statements of the
4832 -- statement sequence are analyzed. Thus it would be too late to create
4833 -- this declaration in the Expand_N_Accept_Statement routine, which is
4834 -- why there is a separate procedure to be called directly from Sem_Ch9.
4836 -- Ann is used to hold the address of the record containing the parameters
4837 -- (see Expand_N_Entry_Call for more details on how this record is built).
4838 -- References to the parameters do an unchecked conversion of this address
4839 -- to a pointer to the required record type, and then access the field that
4840 -- holds the value of the required parameter. The entity for the address
4841 -- variable is held as the top stack element (i.e. the last element) of the
4842 -- Accept_Address stack in the corresponding entry entity, and this element
4843 -- must be set in place before the statements are processed.
4845 -- The above description applies to the case of a stand alone accept
4846 -- statement, i.e. one not appearing as part of a select alternative.
4848 -- For the case of an accept that appears as part of a select alternative
4849 -- of a selective accept, we must still create the declaration right away,
4850 -- since Ann is needed immediately, but there is an important difference:
4852 -- The declaration is inserted before the selective accept, not before
4853 -- the accept statement (which is not part of a list anyway, and so would
4854 -- not accommodate inserted declarations)
4856 -- We only need one address variable for the entire selective accept. So
4857 -- the Ann declaration is created only for the first accept alternative,
4858 -- and subsequent accept alternatives reference the same Ann variable.
4860 -- We can distinguish the two cases by seeing whether the accept statement
4861 -- is part of a list. If not, then it must be in an accept alternative.
4863 -- To expand the requeue statement, a label is provided at the end of the
4864 -- accept statement or alternative of which it is a part, so that the
4865 -- statement can be skipped after the requeue is complete. This label is
4866 -- created here rather than during the expansion of the accept statement,
4867 -- because it will be needed by any requeue statements within the accept,
4868 -- which are expanded before the accept.
4870 procedure Expand_Accept_Declarations (N : Node_Id; Ent : Entity_Id) is
4871 Loc : constant Source_Ptr := Sloc (N);
4872 Stats : constant Node_Id := Handled_Statement_Sequence (N);
4873 Ann : Entity_Id := Empty;
4881 if Expander_Active then
4883 -- If we have no handled statement sequence, we may need to build
4884 -- a dummy sequence consisting of a null statement. This can be
4885 -- skipped if the trivial accept optimization is permitted.
4887 if not Trivial_Accept_OK
4889 (No (Stats) or else Null_Statements (Statements (Stats)))
4891 Set_Handled_Statement_Sequence (N,
4892 Make_Handled_Sequence_Of_Statements (Loc,
4893 New_List (Make_Null_Statement (Loc))));
4896 -- Create and declare two labels to be placed at the end of the
4897 -- accept statement. The first label is used to allow requeues to
4898 -- skip the remainder of entry processing. The second label is used
4899 -- to skip the remainder of entry processing if the rendezvous
4900 -- completes in the middle of the accept body.
4902 if Present (Handled_Statement_Sequence (N)) then
4907 Ent := Make_Temporary (Loc, 'L');
4908 Lab_Id := New_Reference_To (Ent, Loc);
4909 Lab := Make_Label (Loc, Lab_Id);
4911 Make_Implicit_Label_Declaration (Loc,
4912 Defining_Identifier => Ent,
4913 Label_Construct => Lab);
4914 Append (Lab, Statements (Handled_Statement_Sequence (N)));
4916 Ent := Make_Temporary (Loc, 'L');
4917 Lab_Id := New_Reference_To (Ent, Loc);
4918 Lab := Make_Label (Loc, Lab_Id);
4920 Make_Implicit_Label_Declaration (Loc,
4921 Defining_Identifier => Ent,
4922 Label_Construct => Lab);
4923 Append (Lab, Statements (Handled_Statement_Sequence (N)));
4931 -- Case of stand alone accept statement
4933 if Is_List_Member (N) then
4935 if Present (Handled_Statement_Sequence (N)) then
4936 Ann := Make_Temporary (Loc, 'A');
4939 Make_Object_Declaration (Loc,
4940 Defining_Identifier => Ann,
4941 Object_Definition =>
4942 New_Reference_To (RTE (RE_Address), Loc));
4944 Insert_Before (N, Adecl);
4947 Insert_Before (N, Ldecl);
4950 Insert_Before (N, Ldecl2);
4954 -- Case of accept statement which is in an accept alternative
4958 Acc_Alt : constant Node_Id := Parent (N);
4959 Sel_Acc : constant Node_Id := Parent (Acc_Alt);
4963 pragma Assert (Nkind (Acc_Alt) = N_Accept_Alternative);
4964 pragma Assert (Nkind (Sel_Acc) = N_Selective_Accept);
4966 -- ??? Consider a single label for select statements
4968 if Present (Handled_Statement_Sequence (N)) then
4970 Statements (Handled_Statement_Sequence (N)));
4974 Statements (Handled_Statement_Sequence (N)));
4978 -- Find first accept alternative of the selective accept. A
4979 -- valid selective accept must have at least one accept in it.
4981 Alt := First (Select_Alternatives (Sel_Acc));
4983 while Nkind (Alt) /= N_Accept_Alternative loop
4987 -- If we are the first accept statement, then we have to create
4988 -- the Ann variable, as for the stand alone case, except that
4989 -- it is inserted before the selective accept. Similarly, a
4990 -- label for requeue expansion must be declared.
4992 if N = Accept_Statement (Alt) then
4993 Ann := Make_Temporary (Loc, 'A');
4995 Make_Object_Declaration (Loc,
4996 Defining_Identifier => Ann,
4997 Object_Definition =>
4998 New_Reference_To (RTE (RE_Address), Loc));
5000 Insert_Before (Sel_Acc, Adecl);
5003 -- If we are not the first accept statement, then find the Ann
5004 -- variable allocated by the first accept and use it.
5008 Node (Last_Elmt (Accept_Address
5009 (Entity (Entry_Direct_Name (Accept_Statement (Alt))))));
5014 -- Merge here with Ann either created or referenced, and Adecl
5015 -- pointing to the corresponding declaration. Remaining processing
5016 -- is the same for the two cases.
5018 if Present (Ann) then
5019 Append_Elmt (Ann, Accept_Address (Ent));
5020 Set_Debug_Info_Needed (Ann);
5023 -- Create renaming declarations for the entry formals. Each reference
5024 -- to a formal becomes a dereference of a component of the parameter
5025 -- block, whose address is held in Ann. These declarations are
5026 -- eventually inserted into the accept block, and analyzed there so
5027 -- that they have the proper scope for gdb and do not conflict with
5028 -- other declarations.
5030 if Present (Parameter_Specifications (N))
5031 and then Present (Handled_Statement_Sequence (N))
5038 Renamed_Formal : Node_Id;
5042 Formal := First_Formal (Ent);
5044 while Present (Formal) loop
5045 Comp := Entry_Component (Formal);
5047 Make_Defining_Identifier (Loc, Chars (Formal));
5049 Set_Etype (New_F, Etype (Formal));
5050 Set_Scope (New_F, Ent);
5052 -- Now we set debug info needed on New_F even though it does
5053 -- not come from source, so that the debugger will get the
5054 -- right information for these generated names.
5056 Set_Debug_Info_Needed (New_F);
5058 if Ekind (Formal) = E_In_Parameter then
5059 Set_Ekind (New_F, E_Constant);
5061 Set_Ekind (New_F, E_Variable);
5062 Set_Extra_Constrained (New_F, Extra_Constrained (Formal));
5065 Set_Actual_Subtype (New_F, Actual_Subtype (Formal));
5068 Make_Selected_Component (Loc,
5070 Unchecked_Convert_To (
5071 Entry_Parameters_Type (Ent),
5072 New_Reference_To (Ann, Loc)),
5074 New_Reference_To (Comp, Loc));
5077 Build_Renamed_Formal_Declaration
5078 (New_F, Formal, Comp, Renamed_Formal);
5080 if No (Declarations (N)) then
5081 Set_Declarations (N, New_List);
5084 Append (Decl, Declarations (N));
5085 Set_Renamed_Object (Formal, New_F);
5086 Next_Formal (Formal);
5093 end Expand_Accept_Declarations;
5095 ---------------------------------------------
5096 -- Expand_Access_Protected_Subprogram_Type --
5097 ---------------------------------------------
5099 procedure Expand_Access_Protected_Subprogram_Type (N : Node_Id) is
5100 Loc : constant Source_Ptr := Sloc (N);
5102 T : constant Entity_Id := Defining_Identifier (N);
5103 D_T : constant Entity_Id := Designated_Type (T);
5104 D_T2 : constant Entity_Id := Make_Temporary (Loc, 'D');
5105 E_T : constant Entity_Id := Make_Temporary (Loc, 'E');
5106 P_List : constant List_Id := Build_Protected_Spec
5107 (N, RTE (RE_Address), D_T, False);
5113 -- Create access to subprogram with full signature
5115 if Etype (D_T) /= Standard_Void_Type then
5117 Make_Access_Function_Definition (Loc,
5118 Parameter_Specifications => P_List,
5119 Result_Definition =>
5120 Copy_Result_Type (Result_Definition (Type_Definition (N))));
5124 Make_Access_Procedure_Definition (Loc,
5125 Parameter_Specifications => P_List);
5129 Make_Full_Type_Declaration (Loc,
5130 Defining_Identifier => D_T2,
5131 Type_Definition => Def1);
5133 Insert_After (N, Decl1);
5136 -- Associate the access to subprogram with its original access to
5137 -- protected subprogram type. Needed by the backend to know that this
5138 -- type corresponds with an access to protected subprogram type.
5140 Set_Original_Access_Type (D_T2, T);
5142 -- Create Equivalent_Type, a record with two components for an access to
5143 -- object and an access to subprogram.
5146 Make_Component_Declaration (Loc,
5147 Defining_Identifier => Make_Temporary (Loc, 'P'),
5148 Component_Definition =>
5149 Make_Component_Definition (Loc,
5150 Aliased_Present => False,
5151 Subtype_Indication =>
5152 New_Occurrence_Of (RTE (RE_Address), Loc))),
5154 Make_Component_Declaration (Loc,
5155 Defining_Identifier => Make_Temporary (Loc, 'S'),
5156 Component_Definition =>
5157 Make_Component_Definition (Loc,
5158 Aliased_Present => False,
5159 Subtype_Indication => New_Occurrence_Of (D_T2, Loc))));
5162 Make_Full_Type_Declaration (Loc,
5163 Defining_Identifier => E_T,
5165 Make_Record_Definition (Loc,
5167 Make_Component_List (Loc,
5168 Component_Items => Comps)));
5170 Insert_After (Decl1, Decl2);
5172 Set_Equivalent_Type (T, E_T);
5173 end Expand_Access_Protected_Subprogram_Type;
5175 --------------------------
5176 -- Expand_Entry_Barrier --
5177 --------------------------
5179 procedure Expand_Entry_Barrier (N : Node_Id; Ent : Entity_Id) is
5180 Cond : constant Node_Id :=
5181 Condition (Entry_Body_Formal_Part (N));
5182 Prot : constant Entity_Id := Scope (Ent);
5183 Spec_Decl : constant Node_Id := Parent (Prot);
5186 Body_Decl : Node_Id;
5189 if No_Run_Time_Mode then
5190 Error_Msg_CRT ("entry barrier", N);
5194 -- The body of the entry barrier must be analyzed in the context of the
5195 -- protected object, but its scope is external to it, just as any other
5196 -- unprotected version of a protected operation. The specification has
5197 -- been produced when the protected type declaration was elaborated. We
5198 -- build the body, insert it in the enclosing scope, but analyze it in
5199 -- the current context. A more uniform approach would be to treat the
5200 -- barrier just as a protected function, and discard the protected
5201 -- version of it because it is never called.
5203 if Expander_Active then
5204 B_F := Build_Barrier_Function (N, Ent, Prot);
5205 Func := Barrier_Function (Ent);
5206 Set_Corresponding_Spec (B_F, Func);
5208 Body_Decl := Parent (Corresponding_Body (Spec_Decl));
5210 if Nkind (Parent (Body_Decl)) = N_Subunit then
5211 Body_Decl := Corresponding_Stub (Parent (Body_Decl));
5214 Insert_Before_And_Analyze (Body_Decl, B_F);
5216 Set_Discriminals (Spec_Decl);
5217 Set_Scope (Func, Scope (Prot));
5220 Analyze_And_Resolve (Cond, Any_Boolean);
5223 -- The Ravenscar profile restricts barriers to simple variables declared
5224 -- within the protected object. We also allow Boolean constants, since
5225 -- these appear in several published examples and are also allowed by
5226 -- the Aonix compiler.
5228 -- Note that after analysis variables in this context will be replaced
5229 -- by the corresponding prival, that is to say a renaming of a selected
5230 -- component of the form _Object.Var. If expansion is disabled, as
5231 -- within a generic, we check that the entity appears in the current
5234 if Is_Entity_Name (Cond) then
5236 -- A small optimization of useless renamings. If the scope of the
5237 -- entity of the condition is not the barrier function, then the
5238 -- condition does not reference any of the generated renamings
5239 -- within the function.
5242 and then Scope (Entity (Cond)) /= Func
5244 Set_Declarations (B_F, Empty_List);
5247 if Entity (Cond) = Standard_False
5249 Entity (Cond) = Standard_True
5253 elsif not Expander_Active
5254 and then Scope (Entity (Cond)) = Current_Scope
5258 -- Check for case of _object.all.field (note that the explicit
5259 -- dereference gets inserted by analyze/expand of _object.field)
5261 elsif Present (Renamed_Object (Entity (Cond)))
5263 Nkind (Renamed_Object (Entity (Cond))) = N_Selected_Component
5267 (Prefix (Renamed_Object (Entity (Cond))))) = Name_uObject
5273 -- It is not a boolean variable or literal, so check the restriction
5275 Check_Restriction (Simple_Barriers, Cond);
5276 end Expand_Entry_Barrier;
5278 ------------------------------
5279 -- Expand_N_Abort_Statement --
5280 ------------------------------
5282 -- Expand abort T1, T2, .. Tn; into:
5283 -- Abort_Tasks (Task_List'(1 => T1.Task_Id, 2 => T2.Task_Id ...))
5285 procedure Expand_N_Abort_Statement (N : Node_Id) is
5286 Loc : constant Source_Ptr := Sloc (N);
5287 Tlist : constant List_Id := Names (N);
5293 Aggr := Make_Aggregate (Loc, Component_Associations => New_List);
5296 Tasknm := First (Tlist);
5298 while Present (Tasknm) loop
5301 -- A task interface class-wide type object is being aborted.
5302 -- Retrieve its _task_id by calling a dispatching routine.
5304 if Ada_Version >= Ada_2005
5305 and then Ekind (Etype (Tasknm)) = E_Class_Wide_Type
5306 and then Is_Interface (Etype (Tasknm))
5307 and then Is_Task_Interface (Etype (Tasknm))
5309 Append_To (Component_Associations (Aggr),
5310 Make_Component_Association (Loc,
5311 Choices => New_List (
5312 Make_Integer_Literal (Loc, Count)),
5315 -- Task_Id (Tasknm._disp_get_task_id)
5317 Make_Unchecked_Type_Conversion (Loc,
5319 New_Reference_To (RTE (RO_ST_Task_Id), Loc),
5321 Make_Selected_Component (Loc,
5322 Prefix => New_Copy_Tree (Tasknm),
5324 Make_Identifier (Loc, Name_uDisp_Get_Task_Id)))));
5327 Append_To (Component_Associations (Aggr),
5328 Make_Component_Association (Loc,
5329 Choices => New_List (
5330 Make_Integer_Literal (Loc, Count)),
5331 Expression => Concurrent_Ref (Tasknm)));
5338 Make_Procedure_Call_Statement (Loc,
5339 Name => New_Reference_To (RTE (RE_Abort_Tasks), Loc),
5340 Parameter_Associations => New_List (
5341 Make_Qualified_Expression (Loc,
5342 Subtype_Mark => New_Reference_To (RTE (RE_Task_List), Loc),
5343 Expression => Aggr))));
5346 end Expand_N_Abort_Statement;
5348 -------------------------------
5349 -- Expand_N_Accept_Statement --
5350 -------------------------------
5352 -- This procedure handles expansion of accept statements that stand
5353 -- alone, i.e. they are not part of an accept alternative. The expansion
5354 -- of accept statement in accept alternatives is handled by the routines
5355 -- Expand_N_Accept_Alternative and Expand_N_Selective_Accept. The
5356 -- following description applies only to stand alone accept statements.
5358 -- If there is no handled statement sequence, or only null statements,
5359 -- then this is called a trivial accept, and the expansion is:
5361 -- Accept_Trivial (entry-index)
5363 -- If there is a handled statement sequence, then the expansion is:
5370 -- Accept_Call (entry-index, Ann);
5371 -- Renaming_Declarations for formals
5372 -- <statement sequence from N_Accept_Statement node>
5373 -- Complete_Rendezvous;
5378 -- <exception handler from N_Accept_Statement node>
5379 -- Complete_Rendezvous;
5381 -- <exception handler from N_Accept_Statement node>
5382 -- Complete_Rendezvous;
5387 -- when all others =>
5388 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
5391 -- The first three declarations were already inserted ahead of the accept
5392 -- statement by the Expand_Accept_Declarations procedure, which was called
5393 -- directly from the semantics during analysis of the accept statement,
5394 -- before analyzing its contained statements.
5396 -- The declarations from the N_Accept_Statement, as noted in Sinfo, come
5397 -- from possible expansion activity (the original source of course does
5398 -- not have any declarations associated with the accept statement, since
5399 -- an accept statement has no declarative part). In particular, if the
5400 -- expander is active, the first such declaration is the declaration of
5401 -- the Accept_Params_Ptr entity (see Sem_Ch9.Analyze_Accept_Statement).
5403 -- The two blocks are merged into a single block if the inner block has
5404 -- no exception handlers, but otherwise two blocks are required, since
5405 -- exceptions might be raised in the exception handlers of the inner
5406 -- block, and Exceptional_Complete_Rendezvous must be called.
5408 procedure Expand_N_Accept_Statement (N : Node_Id) is
5409 Loc : constant Source_Ptr := Sloc (N);
5410 Stats : constant Node_Id := Handled_Statement_Sequence (N);
5411 Ename : constant Node_Id := Entry_Direct_Name (N);
5412 Eindx : constant Node_Id := Entry_Index (N);
5413 Eent : constant Entity_Id := Entity (Ename);
5414 Acstack : constant Elist_Id := Accept_Address (Eent);
5415 Ann : constant Entity_Id := Node (Last_Elmt (Acstack));
5416 Ttyp : constant Entity_Id := Etype (Scope (Eent));
5421 -- Start of processing for Expand_N_Accept_Statement
5424 -- If accept statement is not part of a list, then its parent must be
5425 -- an accept alternative, and, as described above, we do not do any
5426 -- expansion for such accept statements at this level.
5428 if not Is_List_Member (N) then
5429 pragma Assert (Nkind (Parent (N)) = N_Accept_Alternative);
5432 -- Trivial accept case (no statement sequence, or null statements).
5433 -- If the accept statement has declarations, then just insert them
5434 -- before the procedure call.
5436 elsif Trivial_Accept_OK
5437 and then (No (Stats) or else Null_Statements (Statements (Stats)))
5439 -- Remove declarations for renamings, because the parameter block
5440 -- will not be assigned.
5447 D := First (Declarations (N));
5449 while Present (D) loop
5451 if Nkind (D) = N_Object_Renaming_Declaration then
5459 if Present (Declarations (N)) then
5460 Insert_Actions (N, Declarations (N));
5464 Make_Procedure_Call_Statement (Loc,
5465 Name => New_Reference_To (RTE (RE_Accept_Trivial), Loc),
5466 Parameter_Associations => New_List (
5467 Entry_Index_Expression (Loc, Entity (Ename), Eindx, Ttyp))));
5471 -- Discard Entry_Address that was created for it, so it will not be
5472 -- emitted if this accept statement is in the statement part of a
5473 -- delay alternative.
5475 if Present (Stats) then
5476 Remove_Last_Elmt (Acstack);
5479 -- Case of statement sequence present
5482 -- Construct the block, using the declarations from the accept
5483 -- statement if any to initialize the declarations of the block.
5485 Blkent := Make_Temporary (Loc, 'A');
5486 Set_Ekind (Blkent, E_Block);
5487 Set_Etype (Blkent, Standard_Void_Type);
5488 Set_Scope (Blkent, Current_Scope);
5491 Make_Block_Statement (Loc,
5492 Identifier => New_Reference_To (Blkent, Loc),
5493 Declarations => Declarations (N),
5494 Handled_Statement_Sequence => Build_Accept_Body (N));
5496 -- For the analysis of the generated declarations, the parent node
5497 -- must be properly set.
5499 Set_Parent (Block, Parent (N));
5501 -- Prepend call to Accept_Call to main statement sequence If the
5502 -- accept has exception handlers, the statement sequence is wrapped
5503 -- in a block. Insert call and renaming declarations in the
5504 -- declarations of the block, so they are elaborated before the
5508 Make_Procedure_Call_Statement (Loc,
5509 Name => New_Reference_To (RTE (RE_Accept_Call), Loc),
5510 Parameter_Associations => New_List (
5511 Entry_Index_Expression (Loc, Entity (Ename), Eindx, Ttyp),
5512 New_Reference_To (Ann, Loc)));
5514 if Parent (Stats) = N then
5515 Prepend (Call, Statements (Stats));
5524 Push_Scope (Blkent);
5532 D := First (Declarations (N));
5533 while Present (D) loop
5536 if Nkind (D) = N_Object_Renaming_Declaration then
5538 -- The renaming declarations for the formals were created
5539 -- during analysis of the accept statement, and attached to
5540 -- the list of declarations. Place them now in the context
5541 -- of the accept block or subprogram.
5544 Typ := Entity (Subtype_Mark (D));
5545 Insert_After (Call, D);
5548 -- If the formal is class_wide, it does not have an actual
5549 -- subtype. The analysis of the renaming declaration creates
5550 -- one, but we need to retain the class-wide nature of the
5553 if Is_Class_Wide_Type (Typ) then
5554 Set_Etype (Defining_Identifier (D), Typ);
5565 -- Replace the accept statement by the new block
5570 -- Last step is to unstack the Accept_Address value
5572 Remove_Last_Elmt (Acstack);
5574 end Expand_N_Accept_Statement;
5576 ----------------------------------
5577 -- Expand_N_Asynchronous_Select --
5578 ----------------------------------
5580 -- This procedure assumes that the trigger statement is an entry call or
5581 -- a dispatching procedure call. A delay alternative should already have
5582 -- been expanded into an entry call to the appropriate delay object Wait
5585 -- If the trigger is a task entry call, the select is implemented with
5586 -- a Task_Entry_Call:
5591 -- P : parms := (parm, parm, parm);
5593 -- -- Clean is added by Exp_Ch7.Expand_Cleanup_Actions
5595 -- procedure _clean is
5598 -- Cancel_Task_Entry_Call (C);
5605 -- (<acceptor-task>, -- Acceptor
5606 -- <entry-index>, -- E
5607 -- P'Address, -- Uninterpreted_Data
5608 -- Asynchronous_Call, -- Mode
5609 -- B); -- Rendezvous_Successful
5616 -- _clean; -- Added by Exp_Ch7.Expand_Cleanup_Actions
5619 -- when Abort_Signal => Abort_Undefer;
5626 -- <triggered-statements>
5630 -- Note that Build_Simple_Entry_Call is used to expand the entry of the
5631 -- asynchronous entry call (by Expand_N_Entry_Call_Statement procedure)
5635 -- P : parms := (parm, parm, parm);
5637 -- Call_Simple (acceptor-task, entry-index, P'Address);
5643 -- so the task at hand is to convert the latter expansion into the former
5645 -- If the trigger is a protected entry call, the select is implemented
5646 -- with Protected_Entry_Call:
5649 -- P : E1_Params := (param, param, param);
5650 -- Bnn : Communications_Block;
5655 -- -- Clean is added by Exp_Ch7.Expand_Cleanup_Actions
5657 -- procedure _clean is
5660 -- if Enqueued (Bnn) then
5661 -- Cancel_Protected_Entry_Call (Bnn);
5668 -- Protected_Entry_Call
5669 -- (po._object'Access, -- Object
5670 -- <entry index>, -- E
5671 -- P'Address, -- Uninterpreted_Data
5672 -- Asynchronous_Call, -- Mode
5675 -- if Enqueued (Bnn) then
5679 -- _clean; -- Added by Exp_Ch7.Expand_Cleanup_Actions
5682 -- when Abort_Signal => Abort_Undefer;
5685 -- if not Cancelled (Bnn) then
5686 -- <triggered-statements>
5690 -- Build_Simple_Entry_Call is used to expand the all to a simple protected
5694 -- P : E1_Params := (param, param, param);
5695 -- Bnn : Communications_Block;
5698 -- Protected_Entry_Call
5699 -- (po._object'Access, -- Object
5700 -- <entry index>, -- E
5701 -- P'Address, -- Uninterpreted_Data
5702 -- Simple_Call, -- Mode
5709 -- Ada 2005 (AI-345): If the trigger is a dispatching call, the select is
5713 -- B : Boolean := False;
5714 -- Bnn : Communication_Block;
5715 -- C : Ada.Tags.Prim_Op_Kind;
5716 -- D : System.Storage_Elements.Dummy_Communication_Block;
5717 -- K : Ada.Tags.Tagged_Kind :=
5718 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
5719 -- P : Parameters := (Param1 .. ParamN);
5724 -- if K = Ada.Tags.TK_Limited_Tagged then
5725 -- <dispatching-call>;
5726 -- <triggering-statements>;
5730 -- Ada.Tags.Get_Offset_Index
5731 -- (Ada.Tags.Tag (<object>), DT_Position (<dispatching-call>));
5733 -- _Disp_Get_Prim_Op_Kind (<object>, S, C);
5735 -- if C = POK_Protected_Entry then
5737 -- procedure _clean is
5739 -- if Enqueued (Bnn) then
5740 -- Cancel_Protected_Entry_Call (Bnn);
5746 -- _Disp_Asynchronous_Select
5747 -- (<object>, S, P'Address, D, B);
5748 -- Bnn := Communication_Block (D);
5750 -- Param1 := P.Param1;
5752 -- ParamN := P.ParamN;
5754 -- if Enqueued (Bnn) then
5755 -- <abortable-statements>
5758 -- _clean; -- Added by Exp_Ch7.Expand_Cleanup_Actions
5761 -- when Abort_Signal => Abort_Undefer;
5764 -- if not Cancelled (Bnn) then
5765 -- <triggering-statements>
5768 -- elsif C = POK_Task_Entry then
5770 -- procedure _clean is
5772 -- Cancel_Task_Entry_Call (U);
5778 -- _Disp_Asynchronous_Select
5779 -- (<object>, S, P'Address, D, B);
5780 -- Bnn := Communication_Bloc (D);
5782 -- Param1 := P.Param1;
5784 -- ParamN := P.ParamN;
5789 -- <abortable-statements>
5791 -- _clean; -- Added by Exp_Ch7.Expand_Cleanup_Actions
5794 -- when Abort_Signal => Abort_Undefer;
5798 -- <triggering-statements>
5803 -- <dispatching-call>;
5804 -- <triggering-statements>
5809 -- The job is to convert this to the asynchronous form
5811 -- If the trigger is a delay statement, it will have been expanded into a
5812 -- call to one of the GNARL delay procedures. This routine will convert
5813 -- this into a protected entry call on a delay object and then continue
5814 -- processing as for a protected entry call trigger. This requires
5815 -- declaring a Delay_Block object and adding a pointer to this object to
5816 -- the parameter list of the delay procedure to form the parameter list of
5817 -- the entry call. This object is used by the runtime to queue the delay
5820 -- For a description of the use of P and the assignments after the call,
5821 -- see Expand_N_Entry_Call_Statement.
5823 procedure Expand_N_Asynchronous_Select (N : Node_Id) is
5824 Loc : constant Source_Ptr := Sloc (N);
5825 Abrt : constant Node_Id := Abortable_Part (N);
5826 Astats : constant List_Id := Statements (Abrt);
5827 Trig : constant Node_Id := Triggering_Alternative (N);
5828 Tstats : constant List_Id := Statements (Trig);
5830 Abort_Block_Ent : Entity_Id;
5831 Abortable_Block : Node_Id;
5833 Blk_Ent : Entity_Id;
5834 Blk_Typ : Entity_Id;
5836 Call_Ent : Entity_Id;
5837 Cancel_Param : Entity_Id;
5838 Cleanup_Block : Node_Id;
5839 Cleanup_Block_Ent : Entity_Id;
5840 Cleanup_Stmts : List_Id;
5841 Conc_Typ_Stmts : List_Id;
5843 Dblock_Ent : Entity_Id;
5848 Enqueue_Call : Node_Id;
5852 Lim_Typ_Stmts : List_Id;
5858 ProtE_Stmts : List_Id;
5859 ProtP_Stmts : List_Id;
5862 Target_Undefer : RE_Id;
5863 TaskE_Stmts : List_Id;
5864 Undefer_Args : List_Id := No_List;
5866 B : Entity_Id; -- Call status flag
5867 Bnn : Entity_Id; -- Communication block
5868 C : Entity_Id; -- Call kind
5869 K : Entity_Id; -- Tagged kind
5870 P : Entity_Id; -- Parameter block
5871 S : Entity_Id; -- Primitive operation slot
5872 T : Entity_Id; -- Additional status flag
5875 Process_Statements_For_Controlled_Objects (Trig);
5876 Process_Statements_For_Controlled_Objects (Abrt);
5878 Blk_Ent := Make_Temporary (Loc, 'A');
5879 Ecall := Triggering_Statement (Trig);
5881 -- The arguments in the call may require dynamic allocation, and the
5882 -- call statement may have been transformed into a block. The block
5883 -- may contain additional declarations for internal entities, and the
5884 -- original call is found by sequential search.
5886 if Nkind (Ecall) = N_Block_Statement then
5887 Ecall := First (Statements (Handled_Statement_Sequence (Ecall)));
5888 while not Nkind_In (Ecall, N_Procedure_Call_Statement,
5889 N_Entry_Call_Statement)
5895 -- This is either a dispatching call or a delay statement used as a
5896 -- trigger which was expanded into a procedure call.
5898 if Nkind (Ecall) = N_Procedure_Call_Statement then
5899 if Ada_Version >= Ada_2005
5901 (No (Original_Node (Ecall))
5902 or else not Nkind_In (Original_Node (Ecall),
5903 N_Delay_Relative_Statement,
5904 N_Delay_Until_Statement))
5906 Extract_Dispatching_Call (Ecall, Call_Ent, Obj, Actuals, Formals);
5911 -- Call status flag processing, generate:
5912 -- B : Boolean := False;
5914 B := Build_B (Loc, Decls);
5916 -- Communication block processing, generate:
5917 -- Bnn : Communication_Block;
5919 Bnn := Make_Temporary (Loc, 'B');
5921 Make_Object_Declaration (Loc,
5922 Defining_Identifier => Bnn,
5923 Object_Definition =>
5924 New_Reference_To (RTE (RE_Communication_Block), Loc)));
5926 -- Call kind processing, generate:
5927 -- C : Ada.Tags.Prim_Op_Kind;
5929 C := Build_C (Loc, Decls);
5931 -- Tagged kind processing, generate:
5932 -- K : Ada.Tags.Tagged_Kind :=
5933 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
5935 -- Dummy communication block, generate:
5936 -- D : Dummy_Communication_Block;
5939 Make_Object_Declaration (Loc,
5940 Defining_Identifier =>
5941 Make_Defining_Identifier (Loc, Name_uD),
5942 Object_Definition =>
5944 RTE (RE_Dummy_Communication_Block), Loc)));
5946 K := Build_K (Loc, Decls, Obj);
5948 -- Parameter block processing
5950 Blk_Typ := Build_Parameter_Block
5951 (Loc, Actuals, Formals, Decls);
5952 P := Parameter_Block_Pack
5953 (Loc, Blk_Typ, Actuals, Formals, Decls, Stmts);
5955 -- Dispatch table slot processing, generate:
5958 S := Build_S (Loc, Decls);
5960 -- Additional status flag processing, generate:
5963 T := Make_Temporary (Loc, 'T');
5965 Make_Object_Declaration (Loc,
5966 Defining_Identifier => T,
5967 Object_Definition =>
5968 New_Reference_To (Standard_Boolean, Loc)));
5970 ------------------------------
5971 -- Protected entry handling --
5972 ------------------------------
5975 -- Param1 := P.Param1;
5977 -- ParamN := P.ParamN;
5979 Cleanup_Stmts := Parameter_Block_Unpack (Loc, P, Actuals, Formals);
5982 -- Bnn := Communication_Block (D);
5984 Prepend_To (Cleanup_Stmts,
5985 Make_Assignment_Statement (Loc,
5987 New_Reference_To (Bnn, Loc),
5989 Make_Unchecked_Type_Conversion (Loc,
5991 New_Reference_To (RTE (RE_Communication_Block), Loc),
5992 Expression => Make_Identifier (Loc, Name_uD))));
5995 -- _Disp_Asynchronous_Select (<object>, S, P'Address, D, B);
5997 Prepend_To (Cleanup_Stmts,
5998 Make_Procedure_Call_Statement (Loc,
6001 Find_Prim_Op (Etype (Etype (Obj)),
6002 Name_uDisp_Asynchronous_Select),
6004 Parameter_Associations =>
6006 New_Copy_Tree (Obj), -- <object>
6007 New_Reference_To (S, Loc), -- S
6008 Make_Attribute_Reference (Loc, -- P'Address
6010 New_Reference_To (P, Loc),
6013 Make_Identifier (Loc, Name_uD), -- D
6014 New_Reference_To (B, Loc)))); -- B
6017 -- if Enqueued (Bnn) then
6018 -- <abortable-statements>
6021 Append_To (Cleanup_Stmts,
6022 Make_If_Statement (Loc,
6024 Make_Function_Call (Loc,
6026 New_Reference_To (RTE (RE_Enqueued), Loc),
6027 Parameter_Associations =>
6029 New_Reference_To (Bnn, Loc))),
6032 New_Copy_List_Tree (Astats)));
6034 -- Wrap the statements in a block. Exp_Ch7.Expand_Cleanup_Actions
6035 -- will then generate a _clean for the communication block Bnn.
6039 -- procedure _clean is
6041 -- if Enqueued (Bnn) then
6042 -- Cancel_Protected_Entry_Call (Bnn);
6051 Cleanup_Block_Ent := Make_Temporary (Loc, 'C');
6053 Build_Cleanup_Block (Loc, Cleanup_Block_Ent, Cleanup_Stmts, Bnn);
6055 -- Wrap the cleanup block in an exception handling block
6061 -- when Abort_Signal => Abort_Undefer;
6064 Abort_Block_Ent := Make_Temporary (Loc, 'A');
6067 Make_Implicit_Label_Declaration (Loc,
6068 Defining_Identifier =>
6072 (Loc, Abort_Block_Ent, Cleanup_Block_Ent, Cleanup_Block));
6075 -- if not Cancelled (Bnn) then
6076 -- <triggering-statements>
6079 Append_To (ProtE_Stmts,
6080 Make_If_Statement (Loc,
6084 Make_Function_Call (Loc,
6086 New_Reference_To (RTE (RE_Cancelled), Loc),
6087 Parameter_Associations =>
6089 New_Reference_To (Bnn, Loc)))),
6092 New_Copy_List_Tree (Tstats)));
6094 -------------------------
6095 -- Task entry handling --
6096 -------------------------
6099 -- Param1 := P.Param1;
6101 -- ParamN := P.ParamN;
6103 TaskE_Stmts := Parameter_Block_Unpack (Loc, P, Actuals, Formals);
6106 -- Bnn := Communication_Block (D);
6108 Append_To (TaskE_Stmts,
6109 Make_Assignment_Statement (Loc,
6111 New_Reference_To (Bnn, Loc),
6113 Make_Unchecked_Type_Conversion (Loc,
6115 New_Reference_To (RTE (RE_Communication_Block), Loc),
6116 Expression => Make_Identifier (Loc, Name_uD))));
6119 -- _Disp_Asynchronous_Select (<object>, S, P'Address, D, B);
6121 Prepend_To (TaskE_Stmts,
6122 Make_Procedure_Call_Statement (Loc,
6125 Find_Prim_Op (Etype (Etype (Obj)),
6126 Name_uDisp_Asynchronous_Select),
6128 Parameter_Associations =>
6130 New_Copy_Tree (Obj), -- <object>
6131 New_Reference_To (S, Loc), -- S
6132 Make_Attribute_Reference (Loc, -- P'Address
6134 New_Reference_To (P, Loc),
6137 Make_Identifier (Loc, Name_uD), -- D
6138 New_Reference_To (B, Loc)))); -- B
6143 Prepend_To (TaskE_Stmts,
6144 Make_Procedure_Call_Statement (Loc,
6146 New_Reference_To (RTE (RE_Abort_Defer), Loc),
6147 Parameter_Associations =>
6152 -- <abortable-statements>
6154 Cleanup_Stmts := New_Copy_List_Tree (Astats);
6156 Prepend_To (Cleanup_Stmts,
6157 Make_Procedure_Call_Statement (Loc,
6159 New_Reference_To (RTE (RE_Abort_Undefer), Loc),
6160 Parameter_Associations =>
6163 -- Wrap the statements in a block. Exp_Ch7.Expand_Cleanup_Actions
6164 -- will generate a _clean for the additional status flag.
6168 -- procedure _clean is
6170 -- Cancel_Task_Entry_Call (U);
6178 Cleanup_Block_Ent := Make_Temporary (Loc, 'C');
6180 Build_Cleanup_Block (Loc, Cleanup_Block_Ent, Cleanup_Stmts, T);
6182 -- Wrap the cleanup block in an exception handling block
6188 -- when Abort_Signal => Abort_Undefer;
6191 Abort_Block_Ent := Make_Temporary (Loc, 'A');
6193 Append_To (TaskE_Stmts,
6194 Make_Implicit_Label_Declaration (Loc,
6195 Defining_Identifier => Abort_Block_Ent));
6197 Append_To (TaskE_Stmts,
6199 (Loc, Abort_Block_Ent, Cleanup_Block_Ent, Cleanup_Block));
6203 -- <triggering-statements>
6206 Append_To (TaskE_Stmts,
6207 Make_If_Statement (Loc,
6211 New_Reference_To (T, Loc)),
6214 New_Copy_List_Tree (Tstats)));
6216 ----------------------------------
6217 -- Protected procedure handling --
6218 ----------------------------------
6221 -- <dispatching-call>;
6222 -- <triggering-statements>
6224 ProtP_Stmts := New_Copy_List_Tree (Tstats);
6225 Prepend_To (ProtP_Stmts, New_Copy_Tree (Ecall));
6228 -- S := Ada.Tags.Get_Offset_Index
6229 -- (Ada.Tags.Tag (<object>), DT_Position (Call_Ent));
6232 New_List (Build_S_Assignment (Loc, S, Obj, Call_Ent));
6235 -- _Disp_Get_Prim_Op_Kind (<object>, S, C);
6237 Append_To (Conc_Typ_Stmts,
6238 Make_Procedure_Call_Statement (Loc,
6241 Find_Prim_Op (Etype (Etype (Obj)),
6242 Name_uDisp_Get_Prim_Op_Kind),
6244 Parameter_Associations =>
6246 New_Copy_Tree (Obj),
6247 New_Reference_To (S, Loc),
6248 New_Reference_To (C, Loc))));
6251 -- if C = POK_Procedure_Entry then
6253 -- elsif C = POK_Task_Entry then
6259 Append_To (Conc_Typ_Stmts,
6260 Make_If_Statement (Loc,
6264 New_Reference_To (C, Loc),
6266 New_Reference_To (RTE (RE_POK_Protected_Entry), Loc)),
6273 Make_Elsif_Part (Loc,
6277 New_Reference_To (C, Loc),
6279 New_Reference_To (RTE (RE_POK_Task_Entry), Loc)),
6288 -- <dispatching-call>;
6289 -- <triggering-statements>
6291 Lim_Typ_Stmts := New_Copy_List_Tree (Tstats);
6292 Prepend_To (Lim_Typ_Stmts, New_Copy_Tree (Ecall));
6295 -- if K = Ada.Tags.TK_Limited_Tagged then
6302 Make_If_Statement (Loc,
6306 New_Reference_To (K, Loc),
6308 New_Reference_To (RTE (RE_TK_Limited_Tagged), Loc)),
6317 Make_Block_Statement (Loc,
6320 Handled_Statement_Sequence =>
6321 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
6326 -- Delay triggering statement processing
6329 -- Add a Delay_Block object to the parameter list of the delay
6330 -- procedure to form the parameter list of the Wait entry call.
6332 Dblock_Ent := Make_Temporary (Loc, 'D');
6334 Pdef := Entity (Name (Ecall));
6336 if Is_RTE (Pdef, RO_CA_Delay_For) then
6338 New_Reference_To (RTE (RE_Enqueue_Duration), Loc);
6340 elsif Is_RTE (Pdef, RO_CA_Delay_Until) then
6342 New_Reference_To (RTE (RE_Enqueue_Calendar), Loc);
6344 else pragma Assert (Is_RTE (Pdef, RO_RT_Delay_Until));
6345 Enqueue_Call := New_Reference_To (RTE (RE_Enqueue_RT), Loc);
6348 Append_To (Parameter_Associations (Ecall),
6349 Make_Attribute_Reference (Loc,
6350 Prefix => New_Reference_To (Dblock_Ent, Loc),
6351 Attribute_Name => Name_Unchecked_Access));
6353 -- Create the inner block to protect the abortable part
6356 Make_Implicit_Exception_Handler (Loc,
6357 Exception_Choices =>
6358 New_List (New_Reference_To (Stand.Abort_Signal, Loc)),
6359 Statements => New_List (
6360 Make_Procedure_Call_Statement (Loc,
6361 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc)))));
6364 Make_Procedure_Call_Statement (Loc,
6365 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc)));
6368 Make_Block_Statement (Loc,
6369 Identifier => New_Reference_To (Blk_Ent, Loc),
6370 Handled_Statement_Sequence =>
6371 Make_Handled_Sequence_Of_Statements (Loc,
6372 Statements => Astats),
6373 Has_Created_Identifier => True,
6374 Is_Asynchronous_Call_Block => True);
6376 -- Append call to if Enqueue (When, DB'Unchecked_Access) then
6379 Make_Implicit_If_Statement (N,
6380 Condition => Make_Function_Call (Loc,
6381 Name => Enqueue_Call,
6382 Parameter_Associations => Parameter_Associations (Ecall)),
6384 New_List (Make_Block_Statement (Loc,
6385 Handled_Statement_Sequence =>
6386 Make_Handled_Sequence_Of_Statements (Loc,
6387 Statements => New_List (
6388 Make_Implicit_Label_Declaration (Loc,
6389 Defining_Identifier => Blk_Ent,
6390 Label_Construct => Abortable_Block),
6392 Exception_Handlers => Hdle)))));
6394 Stmts := New_List (Ecall);
6396 -- Construct statement sequence for new block
6399 Make_Implicit_If_Statement (N,
6400 Condition => Make_Function_Call (Loc,
6401 Name => New_Reference_To (
6402 RTE (RE_Timed_Out), Loc),
6403 Parameter_Associations => New_List (
6404 Make_Attribute_Reference (Loc,
6405 Prefix => New_Reference_To (Dblock_Ent, Loc),
6406 Attribute_Name => Name_Unchecked_Access))),
6407 Then_Statements => Tstats));
6409 -- The result is the new block
6411 Set_Entry_Cancel_Parameter (Blk_Ent, Dblock_Ent);
6414 Make_Block_Statement (Loc,
6415 Declarations => New_List (
6416 Make_Object_Declaration (Loc,
6417 Defining_Identifier => Dblock_Ent,
6418 Aliased_Present => True,
6419 Object_Definition => New_Reference_To (
6420 RTE (RE_Delay_Block), Loc))),
6422 Handled_Statement_Sequence =>
6423 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
6433 Extract_Entry (Ecall, Concval, Ename, Index);
6434 Build_Simple_Entry_Call (Ecall, Concval, Ename, Index);
6436 Stmts := Statements (Handled_Statement_Sequence (Ecall));
6437 Decls := Declarations (Ecall);
6439 if Is_Protected_Type (Etype (Concval)) then
6441 -- Get the declarations of the block expanded from the entry call
6443 Decl := First (Decls);
6444 while Present (Decl)
6446 (Nkind (Decl) /= N_Object_Declaration
6447 or else not Is_RTE (Etype (Object_Definition (Decl)),
6448 RE_Communication_Block))
6453 pragma Assert (Present (Decl));
6454 Cancel_Param := Defining_Identifier (Decl);
6456 -- Change the mode of the Protected_Entry_Call call
6458 -- Protected_Entry_Call (
6459 -- Object => po._object'Access,
6460 -- E => <entry index>;
6461 -- Uninterpreted_Data => P'Address;
6462 -- Mode => Asynchronous_Call;
6465 Stmt := First (Stmts);
6467 -- Skip assignments to temporaries created for in-out parameters
6469 -- This makes unwarranted assumptions about the shape of the expanded
6470 -- tree for the call, and should be cleaned up ???
6472 while Nkind (Stmt) /= N_Procedure_Call_Statement loop
6478 Param := First (Parameter_Associations (Call));
6479 while Present (Param)
6480 and then not Is_RTE (Etype (Param), RE_Call_Modes)
6485 pragma Assert (Present (Param));
6486 Rewrite (Param, New_Reference_To (RTE (RE_Asynchronous_Call), Loc));
6489 -- Append an if statement to execute the abortable part
6492 -- if Enqueued (Bnn) then
6495 Make_Implicit_If_Statement (N,
6496 Condition => Make_Function_Call (Loc,
6497 Name => New_Reference_To (
6498 RTE (RE_Enqueued), Loc),
6499 Parameter_Associations => New_List (
6500 New_Reference_To (Cancel_Param, Loc))),
6501 Then_Statements => Astats));
6504 Make_Block_Statement (Loc,
6505 Identifier => New_Reference_To (Blk_Ent, Loc),
6506 Handled_Statement_Sequence =>
6507 Make_Handled_Sequence_Of_Statements (Loc,
6508 Statements => Stmts),
6509 Has_Created_Identifier => True,
6510 Is_Asynchronous_Call_Block => True);
6512 -- For the VM call Update_Exception instead of Abort_Undefer.
6513 -- See 4jexcept.ads for an explanation.
6515 if VM_Target = No_VM then
6516 Target_Undefer := RE_Abort_Undefer;
6518 Target_Undefer := RE_Update_Exception;
6520 New_List (Make_Function_Call (Loc,
6521 Name => New_Occurrence_Of
6522 (RTE (RE_Current_Target_Exception), Loc)));
6526 Make_Block_Statement (Loc,
6527 Handled_Statement_Sequence =>
6528 Make_Handled_Sequence_Of_Statements (Loc,
6529 Statements => New_List (
6530 Make_Implicit_Label_Declaration (Loc,
6531 Defining_Identifier => Blk_Ent,
6532 Label_Construct => Abortable_Block),
6537 Exception_Handlers => New_List (
6538 Make_Implicit_Exception_Handler (Loc,
6540 -- when Abort_Signal =>
6541 -- Abort_Undefer.all;
6543 Exception_Choices =>
6544 New_List (New_Reference_To (Stand.Abort_Signal, Loc)),
6545 Statements => New_List (
6546 Make_Procedure_Call_Statement (Loc,
6547 Name => New_Reference_To (
6548 RTE (Target_Undefer), Loc),
6549 Parameter_Associations => Undefer_Args)))))),
6551 -- if not Cancelled (Bnn) then
6552 -- triggered statements
6555 Make_Implicit_If_Statement (N,
6556 Condition => Make_Op_Not (Loc,
6558 Make_Function_Call (Loc,
6559 Name => New_Occurrence_Of (RTE (RE_Cancelled), Loc),
6560 Parameter_Associations => New_List (
6561 New_Occurrence_Of (Cancel_Param, Loc)))),
6562 Then_Statements => Tstats));
6564 -- Asynchronous task entry call
6571 B := Make_Defining_Identifier (Loc, Name_uB);
6573 -- Insert declaration of B in declarations of existing block
6576 Make_Object_Declaration (Loc,
6577 Defining_Identifier => B,
6578 Object_Definition => New_Reference_To (Standard_Boolean, Loc)));
6580 Cancel_Param := Make_Defining_Identifier (Loc, Name_uC);
6582 -- Insert declaration of C in declarations of existing block
6585 Make_Object_Declaration (Loc,
6586 Defining_Identifier => Cancel_Param,
6587 Object_Definition => New_Reference_To (Standard_Boolean, Loc)));
6589 -- Remove and save the call to Call_Simple
6591 Stmt := First (Stmts);
6593 -- Skip assignments to temporaries created for in-out parameters.
6594 -- This makes unwarranted assumptions about the shape of the expanded
6595 -- tree for the call, and should be cleaned up ???
6597 while Nkind (Stmt) /= N_Procedure_Call_Statement loop
6603 -- Create the inner block to protect the abortable part
6606 Make_Implicit_Exception_Handler (Loc,
6607 Exception_Choices =>
6608 New_List (New_Reference_To (Stand.Abort_Signal, Loc)),
6611 Make_Procedure_Call_Statement (Loc,
6612 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc)))));
6615 Make_Procedure_Call_Statement (Loc,
6616 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc)));
6619 Make_Block_Statement (Loc,
6620 Identifier => New_Reference_To (Blk_Ent, Loc),
6621 Handled_Statement_Sequence =>
6622 Make_Handled_Sequence_Of_Statements (Loc,
6623 Statements => Astats),
6624 Has_Created_Identifier => True,
6625 Is_Asynchronous_Call_Block => True);
6628 Make_Block_Statement (Loc,
6629 Handled_Statement_Sequence =>
6630 Make_Handled_Sequence_Of_Statements (Loc,
6631 Statements => New_List (
6632 Make_Implicit_Label_Declaration (Loc,
6633 Defining_Identifier =>
6638 Exception_Handlers => Hdle)));
6640 -- Create new call statement
6642 Params := Parameter_Associations (Call);
6645 New_Reference_To (RTE (RE_Asynchronous_Call), Loc));
6647 New_Reference_To (B, Loc));
6650 Make_Procedure_Call_Statement (Loc,
6652 New_Reference_To (RTE (RE_Task_Entry_Call), Loc),
6653 Parameter_Associations => Params));
6655 -- Construct statement sequence for new block
6658 Make_Implicit_If_Statement (N,
6661 New_Reference_To (Cancel_Param, Loc)),
6662 Then_Statements => Tstats));
6664 -- Protected the call against abort
6667 Make_Procedure_Call_Statement (Loc,
6668 Name => New_Reference_To (RTE (RE_Abort_Defer), Loc),
6669 Parameter_Associations => Empty_List));
6672 Set_Entry_Cancel_Parameter (Blk_Ent, Cancel_Param);
6674 -- The result is the new block
6677 Make_Block_Statement (Loc,
6678 Declarations => Decls,
6679 Handled_Statement_Sequence =>
6680 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
6683 end Expand_N_Asynchronous_Select;
6685 -------------------------------------
6686 -- Expand_N_Conditional_Entry_Call --
6687 -------------------------------------
6689 -- The conditional task entry call is converted to a call to
6694 -- P : parms := (parm, parm, parm);
6698 -- (<acceptor-task>, -- Acceptor
6699 -- <entry-index>, -- E
6700 -- P'Address, -- Uninterpreted_Data
6701 -- Conditional_Call, -- Mode
6702 -- B); -- Rendezvous_Successful
6707 -- normal-statements
6713 -- For a description of the use of P and the assignments after the call,
6714 -- see Expand_N_Entry_Call_Statement. Note that the entry call of the
6715 -- conditional entry call has already been expanded (by the Expand_N_Entry
6716 -- _Call_Statement procedure) as follows:
6719 -- P : parms := (parm, parm, parm);
6721 -- ... info for in-out parameters
6722 -- Call_Simple (acceptor-task, entry-index, P'Address);
6728 -- so the task at hand is to convert the latter expansion into the former
6730 -- The conditional protected entry call is converted to a call to
6731 -- Protected_Entry_Call:
6734 -- P : parms := (parm, parm, parm);
6735 -- Bnn : Communications_Block;
6738 -- Protected_Entry_Call
6739 -- (po._object'Access, -- Object
6740 -- <entry index>, -- E
6741 -- P'Address, -- Uninterpreted_Data
6742 -- Conditional_Call, -- Mode
6747 -- if Cancelled (Bnn) then
6750 -- normal-statements
6754 -- Ada 2005 (AI-345): A dispatching conditional entry call is converted
6758 -- B : Boolean := False;
6759 -- C : Ada.Tags.Prim_Op_Kind;
6760 -- K : Ada.Tags.Tagged_Kind :=
6761 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
6762 -- P : Parameters := (Param1 .. ParamN);
6766 -- if K = Ada.Tags.TK_Limited_Tagged then
6767 -- <dispatching-call>;
6768 -- <triggering-statements>
6772 -- Ada.Tags.Get_Offset_Index
6773 -- (Ada.Tags.Tag (<object>), DT_Position (<dispatching-call>));
6775 -- _Disp_Conditional_Select (<object>, S, P'Address, C, B);
6777 -- if C = POK_Protected_Entry
6778 -- or else C = POK_Task_Entry
6780 -- Param1 := P.Param1;
6782 -- ParamN := P.ParamN;
6786 -- if C = POK_Procedure
6787 -- or else C = POK_Protected_Procedure
6788 -- or else C = POK_Task_Procedure
6790 -- <dispatching-call>;
6793 -- <triggering-statements>
6795 -- <else-statements>
6800 procedure Expand_N_Conditional_Entry_Call (N : Node_Id) is
6801 Loc : constant Source_Ptr := Sloc (N);
6802 Alt : constant Node_Id := Entry_Call_Alternative (N);
6803 Blk : Node_Id := Entry_Call_Statement (Alt);
6806 Blk_Typ : Entity_Id;
6808 Call_Ent : Entity_Id;
6809 Conc_Typ_Stmts : List_Id;
6813 Lim_Typ_Stmts : List_Id;
6820 Transient_Blk : Node_Id;
6823 B : Entity_Id; -- Call status flag
6824 C : Entity_Id; -- Call kind
6825 K : Entity_Id; -- Tagged kind
6826 P : Entity_Id; -- Parameter block
6827 S : Entity_Id; -- Primitive operation slot
6830 Process_Statements_For_Controlled_Objects (N);
6832 if Ada_Version >= Ada_2005
6833 and then Nkind (Blk) = N_Procedure_Call_Statement
6835 Extract_Dispatching_Call (Blk, Call_Ent, Obj, Actuals, Formals);
6840 -- Call status flag processing, generate:
6841 -- B : Boolean := False;
6843 B := Build_B (Loc, Decls);
6845 -- Call kind processing, generate:
6846 -- C : Ada.Tags.Prim_Op_Kind;
6848 C := Build_C (Loc, Decls);
6850 -- Tagged kind processing, generate:
6851 -- K : Ada.Tags.Tagged_Kind :=
6852 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
6854 K := Build_K (Loc, Decls, Obj);
6856 -- Parameter block processing
6858 Blk_Typ := Build_Parameter_Block (Loc, Actuals, Formals, Decls);
6859 P := Parameter_Block_Pack
6860 (Loc, Blk_Typ, Actuals, Formals, Decls, Stmts);
6862 -- Dispatch table slot processing, generate:
6865 S := Build_S (Loc, Decls);
6868 -- S := Ada.Tags.Get_Offset_Index
6869 -- (Ada.Tags.Tag (<object>), DT_Position (Call_Ent));
6872 New_List (Build_S_Assignment (Loc, S, Obj, Call_Ent));
6875 -- _Disp_Conditional_Select (<object>, S, P'Address, C, B);
6877 Append_To (Conc_Typ_Stmts,
6878 Make_Procedure_Call_Statement (Loc,
6881 Find_Prim_Op (Etype (Etype (Obj)),
6882 Name_uDisp_Conditional_Select),
6884 Parameter_Associations =>
6886 New_Copy_Tree (Obj), -- <object>
6887 New_Reference_To (S, Loc), -- S
6888 Make_Attribute_Reference (Loc, -- P'Address
6890 New_Reference_To (P, Loc),
6893 New_Reference_To (C, Loc), -- C
6894 New_Reference_To (B, Loc)))); -- B
6897 -- if C = POK_Protected_Entry
6898 -- or else C = POK_Task_Entry
6900 -- Param1 := P.Param1;
6902 -- ParamN := P.ParamN;
6905 Unpack := Parameter_Block_Unpack (Loc, P, Actuals, Formals);
6907 -- Generate the if statement only when the packed parameters need
6908 -- explicit assignments to their corresponding actuals.
6910 if Present (Unpack) then
6911 Append_To (Conc_Typ_Stmts,
6912 Make_If_Statement (Loc,
6919 New_Reference_To (C, Loc),
6921 New_Reference_To (RTE (
6922 RE_POK_Protected_Entry), Loc)),
6926 New_Reference_To (C, Loc),
6928 New_Reference_To (RTE (RE_POK_Task_Entry), Loc))),
6936 -- if C = POK_Procedure
6937 -- or else C = POK_Protected_Procedure
6938 -- or else C = POK_Task_Procedure
6940 -- <dispatching-call>
6942 -- <normal-statements>
6944 -- <else-statements>
6947 N_Stats := New_Copy_List_Tree (Statements (Alt));
6949 Prepend_To (N_Stats,
6950 Make_If_Statement (Loc,
6956 New_Reference_To (C, Loc),
6958 New_Reference_To (RTE (RE_POK_Procedure), Loc)),
6965 New_Reference_To (C, Loc),
6967 New_Reference_To (RTE (
6968 RE_POK_Protected_Procedure), Loc)),
6973 New_Reference_To (C, Loc),
6975 New_Reference_To (RTE (
6976 RE_POK_Task_Procedure), Loc)))),
6981 Append_To (Conc_Typ_Stmts,
6982 Make_If_Statement (Loc,
6983 Condition => New_Reference_To (B, Loc),
6984 Then_Statements => N_Stats,
6985 Else_Statements => Else_Statements (N)));
6988 -- <dispatching-call>;
6989 -- <triggering-statements>
6991 Lim_Typ_Stmts := New_Copy_List_Tree (Statements (Alt));
6992 Prepend_To (Lim_Typ_Stmts, New_Copy_Tree (Blk));
6995 -- if K = Ada.Tags.TK_Limited_Tagged then
7002 Make_If_Statement (Loc,
7006 New_Reference_To (K, Loc),
7008 New_Reference_To (RTE (RE_TK_Limited_Tagged), Loc)),
7017 Make_Block_Statement (Loc,
7020 Handled_Statement_Sequence =>
7021 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
7023 -- As described above, The entry alternative is transformed into a
7024 -- block that contains the gnulli call, and possibly assignment
7025 -- statements for in-out parameters. The gnulli call may itself be
7026 -- rewritten into a transient block if some unconstrained parameters
7027 -- require it. We need to retrieve the call to complete its parameter
7032 First_Real_Statement (Handled_Statement_Sequence (Blk));
7034 if Present (Transient_Blk)
7035 and then Nkind (Transient_Blk) = N_Block_Statement
7037 Blk := Transient_Blk;
7040 Stmts := Statements (Handled_Statement_Sequence (Blk));
7041 Stmt := First (Stmts);
7042 while Nkind (Stmt) /= N_Procedure_Call_Statement loop
7047 Params := Parameter_Associations (Call);
7049 if Is_RTE (Entity (Name (Call)), RE_Protected_Entry_Call) then
7051 -- Substitute Conditional_Entry_Call for Simple_Call parameter
7053 Param := First (Params);
7054 while Present (Param)
7055 and then not Is_RTE (Etype (Param), RE_Call_Modes)
7060 pragma Assert (Present (Param));
7061 Rewrite (Param, New_Reference_To (RTE (RE_Conditional_Call), Loc));
7065 -- Find the Communication_Block parameter for the call to the
7066 -- Cancelled function.
7068 Decl := First (Declarations (Blk));
7069 while Present (Decl)
7070 and then not Is_RTE (Etype (Object_Definition (Decl)),
7071 RE_Communication_Block)
7076 -- Add an if statement to execute the else part if the call
7077 -- does not succeed (as indicated by the Cancelled predicate).
7080 Make_Implicit_If_Statement (N,
7081 Condition => Make_Function_Call (Loc,
7082 Name => New_Reference_To (RTE (RE_Cancelled), Loc),
7083 Parameter_Associations => New_List (
7084 New_Reference_To (Defining_Identifier (Decl), Loc))),
7085 Then_Statements => Else_Statements (N),
7086 Else_Statements => Statements (Alt)));
7089 B := Make_Defining_Identifier (Loc, Name_uB);
7091 -- Insert declaration of B in declarations of existing block
7093 if No (Declarations (Blk)) then
7094 Set_Declarations (Blk, New_List);
7097 Prepend_To (Declarations (Blk),
7098 Make_Object_Declaration (Loc,
7099 Defining_Identifier => B,
7100 Object_Definition =>
7101 New_Reference_To (Standard_Boolean, Loc)));
7103 -- Create new call statement
7106 New_Reference_To (RTE (RE_Conditional_Call), Loc));
7107 Append_To (Params, New_Reference_To (B, Loc));
7110 Make_Procedure_Call_Statement (Loc,
7111 Name => New_Reference_To (RTE (RE_Task_Entry_Call), Loc),
7112 Parameter_Associations => Params));
7114 -- Construct statement sequence for new block
7117 Make_Implicit_If_Statement (N,
7118 Condition => New_Reference_To (B, Loc),
7119 Then_Statements => Statements (Alt),
7120 Else_Statements => Else_Statements (N)));
7123 -- The result is the new block
7126 Make_Block_Statement (Loc,
7127 Declarations => Declarations (Blk),
7128 Handled_Statement_Sequence =>
7129 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
7133 end Expand_N_Conditional_Entry_Call;
7135 ---------------------------------------
7136 -- Expand_N_Delay_Relative_Statement --
7137 ---------------------------------------
7139 -- Delay statement is implemented as a procedure call to Delay_For
7140 -- defined in Ada.Calendar.Delays in order to reduce the overhead of
7141 -- simple delays imposed by the use of Protected Objects.
7143 procedure Expand_N_Delay_Relative_Statement (N : Node_Id) is
7144 Loc : constant Source_Ptr := Sloc (N);
7147 Make_Procedure_Call_Statement (Loc,
7148 Name => New_Reference_To (RTE (RO_CA_Delay_For), Loc),
7149 Parameter_Associations => New_List (Expression (N))));
7151 end Expand_N_Delay_Relative_Statement;
7153 ------------------------------------
7154 -- Expand_N_Delay_Until_Statement --
7155 ------------------------------------
7157 -- Delay Until statement is implemented as a procedure call to
7158 -- Delay_Until defined in Ada.Calendar.Delays and Ada.Real_Time.Delays.
7160 procedure Expand_N_Delay_Until_Statement (N : Node_Id) is
7161 Loc : constant Source_Ptr := Sloc (N);
7165 if Is_RTE (Base_Type (Etype (Expression (N))), RO_CA_Time) then
7166 Typ := RTE (RO_CA_Delay_Until);
7168 Typ := RTE (RO_RT_Delay_Until);
7172 Make_Procedure_Call_Statement (Loc,
7173 Name => New_Reference_To (Typ, Loc),
7174 Parameter_Associations => New_List (Expression (N))));
7177 end Expand_N_Delay_Until_Statement;
7179 -------------------------
7180 -- Expand_N_Entry_Body --
7181 -------------------------
7183 procedure Expand_N_Entry_Body (N : Node_Id) is
7185 -- Associate discriminals with the next protected operation body to be
7188 if Present (Next_Protected_Operation (N)) then
7189 Set_Discriminals (Parent (Current_Scope));
7191 end Expand_N_Entry_Body;
7193 -----------------------------------
7194 -- Expand_N_Entry_Call_Statement --
7195 -----------------------------------
7197 -- An entry call is expanded into GNARLI calls to implement a simple entry
7198 -- call (see Build_Simple_Entry_Call).
7200 procedure Expand_N_Entry_Call_Statement (N : Node_Id) is
7206 if No_Run_Time_Mode then
7207 Error_Msg_CRT ("entry call", N);
7211 -- If this entry call is part of an asynchronous select, don't expand it
7212 -- here; it will be expanded with the select statement. Don't expand
7213 -- timed entry calls either, as they are translated into asynchronous
7216 -- ??? This whole approach is questionable; it may be better to go back
7217 -- to allowing the expansion to take place and then attempting to fix it
7218 -- up in Expand_N_Asynchronous_Select. The tricky part is figuring out
7219 -- whether the expanded call is on a task or protected entry.
7221 if (Nkind (Parent (N)) /= N_Triggering_Alternative
7222 or else N /= Triggering_Statement (Parent (N)))
7223 and then (Nkind (Parent (N)) /= N_Entry_Call_Alternative
7224 or else N /= Entry_Call_Statement (Parent (N))
7225 or else Nkind (Parent (Parent (N))) /= N_Timed_Entry_Call)
7227 Extract_Entry (N, Concval, Ename, Index);
7228 Build_Simple_Entry_Call (N, Concval, Ename, Index);
7230 end Expand_N_Entry_Call_Statement;
7232 --------------------------------
7233 -- Expand_N_Entry_Declaration --
7234 --------------------------------
7236 -- If there are parameters, then first, each of the formals is marked by
7237 -- setting Is_Entry_Formal. Next a record type is built which is used to
7238 -- hold the parameter values. The name of this record type is entryP where
7239 -- entry is the name of the entry, with an additional corresponding access
7240 -- type called entryPA. The record type has matching components for each
7241 -- formal (the component names are the same as the formal names). For
7242 -- elementary types, the component type matches the formal type. For
7243 -- composite types, an access type is declared (with the name formalA)
7244 -- which designates the formal type, and the type of the component is this
7245 -- access type. Finally the Entry_Component of each formal is set to
7246 -- reference the corresponding record component.
7248 procedure Expand_N_Entry_Declaration (N : Node_Id) is
7249 Loc : constant Source_Ptr := Sloc (N);
7250 Entry_Ent : constant Entity_Id := Defining_Identifier (N);
7251 Components : List_Id;
7254 Last_Decl : Node_Id;
7255 Component : Entity_Id;
7258 Rec_Ent : Entity_Id;
7259 Acc_Ent : Entity_Id;
7262 Formal := First_Formal (Entry_Ent);
7265 -- Most processing is done only if parameters are present
7267 if Present (Formal) then
7268 Components := New_List;
7270 -- Loop through formals
7272 while Present (Formal) loop
7273 Set_Is_Entry_Formal (Formal);
7275 Make_Defining_Identifier (Sloc (Formal), Chars (Formal));
7276 Set_Entry_Component (Formal, Component);
7277 Set_Entry_Formal (Component, Formal);
7278 Ftype := Etype (Formal);
7280 -- Declare new access type and then append
7282 Ctype := Make_Temporary (Loc, 'A');
7285 Make_Full_Type_Declaration (Loc,
7286 Defining_Identifier => Ctype,
7288 Make_Access_To_Object_Definition (Loc,
7289 All_Present => True,
7290 Constant_Present => Ekind (Formal) = E_In_Parameter,
7291 Subtype_Indication => New_Reference_To (Ftype, Loc)));
7293 Insert_After (Last_Decl, Decl);
7296 Append_To (Components,
7297 Make_Component_Declaration (Loc,
7298 Defining_Identifier => Component,
7299 Component_Definition =>
7300 Make_Component_Definition (Loc,
7301 Aliased_Present => False,
7302 Subtype_Indication => New_Reference_To (Ctype, Loc))));
7304 Next_Formal_With_Extras (Formal);
7307 -- Create the Entry_Parameter_Record declaration
7309 Rec_Ent := Make_Temporary (Loc, 'P');
7312 Make_Full_Type_Declaration (Loc,
7313 Defining_Identifier => Rec_Ent,
7315 Make_Record_Definition (Loc,
7317 Make_Component_List (Loc,
7318 Component_Items => Components)));
7320 Insert_After (Last_Decl, Decl);
7323 -- Construct and link in the corresponding access type
7325 Acc_Ent := Make_Temporary (Loc, 'A');
7327 Set_Entry_Parameters_Type (Entry_Ent, Acc_Ent);
7330 Make_Full_Type_Declaration (Loc,
7331 Defining_Identifier => Acc_Ent,
7333 Make_Access_To_Object_Definition (Loc,
7334 All_Present => True,
7335 Subtype_Indication => New_Reference_To (Rec_Ent, Loc)));
7337 Insert_After (Last_Decl, Decl);
7339 end Expand_N_Entry_Declaration;
7341 -----------------------------
7342 -- Expand_N_Protected_Body --
7343 -----------------------------
7345 -- Protected bodies are expanded to the completion of the subprograms
7346 -- created for the corresponding protected type. These are a protected and
7347 -- unprotected version of each protected subprogram in the object, a
7348 -- function to calculate each entry barrier, and a procedure to execute the
7349 -- sequence of statements of each protected entry body. For example, for
7350 -- protected type ptype:
7353 -- (O : System.Address;
7354 -- E : Protected_Entry_Index)
7357 -- <discriminant renamings>
7358 -- <private object renamings>
7360 -- return <barrier expression>;
7363 -- procedure pprocN (_object : in out poV;...) is
7364 -- <discriminant renamings>
7365 -- <private object renamings>
7367 -- <sequence of statements>
7370 -- procedure pprocP (_object : in out poV;...) is
7371 -- procedure _clean is
7374 -- ptypeS (_object, Pn);
7375 -- Unlock (_object._object'Access);
7376 -- Abort_Undefer.all;
7381 -- Lock (_object._object'Access);
7382 -- pprocN (_object;...);
7387 -- function pfuncN (_object : poV;...) return Return_Type is
7388 -- <discriminant renamings>
7389 -- <private object renamings>
7391 -- <sequence of statements>
7394 -- function pfuncP (_object : poV) return Return_Type is
7395 -- procedure _clean is
7397 -- Unlock (_object._object'Access);
7398 -- Abort_Undefer.all;
7403 -- Lock (_object._object'Access);
7404 -- return pfuncN (_object);
7411 -- (O : System.Address;
7412 -- P : System.Address;
7413 -- E : Protected_Entry_Index)
7415 -- <discriminant renamings>
7416 -- <private object renamings>
7417 -- type poVP is access poV;
7418 -- _Object : ptVP := ptVP!(O);
7422 -- <statement sequence>
7423 -- Complete_Entry_Body (_Object._Object);
7425 -- when all others =>
7426 -- Exceptional_Complete_Entry_Body (
7427 -- _Object._Object, Get_GNAT_Exception);
7431 -- The type poV is the record created for the protected type to hold
7432 -- the state of the protected object.
7434 procedure Expand_N_Protected_Body (N : Node_Id) is
7435 Loc : constant Source_Ptr := Sloc (N);
7436 Pid : constant Entity_Id := Corresponding_Spec (N);
7438 Current_Node : Node_Id;
7439 Disp_Op_Body : Node_Id;
7440 New_Op_Body : Node_Id;
7441 Num_Entries : Natural := 0;
7445 function Build_Dispatching_Subprogram_Body
7448 Prot_Bod : Node_Id) return Node_Id;
7449 -- Build a dispatching version of the protected subprogram body. The
7450 -- newly generated subprogram contains a call to the original protected
7451 -- body. The following code is generated:
7453 -- function <protected-function-name> (Param1 .. ParamN) return
7456 -- return <protected-function-name>P (Param1 .. ParamN);
7457 -- end <protected-function-name>;
7461 -- procedure <protected-procedure-name> (Param1 .. ParamN) is
7463 -- <protected-procedure-name>P (Param1 .. ParamN);
7464 -- end <protected-procedure-name>
7466 ---------------------------------------
7467 -- Build_Dispatching_Subprogram_Body --
7468 ---------------------------------------
7470 function Build_Dispatching_Subprogram_Body
7473 Prot_Bod : Node_Id) return Node_Id
7475 Loc : constant Source_Ptr := Sloc (N);
7482 -- Generate a specification without a letter suffix in order to
7483 -- override an interface function or procedure.
7485 Spec := Build_Protected_Sub_Specification (N, Pid, Dispatching_Mode);
7487 -- The formal parameters become the actuals of the protected function
7488 -- or procedure call.
7490 Actuals := New_List;
7491 Formal := First (Parameter_Specifications (Spec));
7492 while Present (Formal) loop
7494 Make_Identifier (Loc, Chars (Defining_Identifier (Formal))));
7499 if Nkind (Spec) = N_Procedure_Specification then
7502 Make_Procedure_Call_Statement (Loc,
7504 New_Reference_To (Corresponding_Spec (Prot_Bod), Loc),
7505 Parameter_Associations => Actuals));
7507 pragma Assert (Nkind (Spec) = N_Function_Specification);
7511 Make_Simple_Return_Statement (Loc,
7513 Make_Function_Call (Loc,
7515 New_Reference_To (Corresponding_Spec (Prot_Bod), Loc),
7516 Parameter_Associations => Actuals)));
7520 Make_Subprogram_Body (Loc,
7521 Declarations => Empty_List,
7522 Specification => Spec,
7523 Handled_Statement_Sequence =>
7524 Make_Handled_Sequence_Of_Statements (Loc, Stmts));
7525 end Build_Dispatching_Subprogram_Body;
7527 -- Start of processing for Expand_N_Protected_Body
7530 if No_Run_Time_Mode then
7531 Error_Msg_CRT ("protected body", N);
7535 -- This is the proper body corresponding to a stub. The declarations
7536 -- must be inserted at the point of the stub, which in turn is in the
7537 -- declarative part of the parent unit.
7539 if Nkind (Parent (N)) = N_Subunit then
7540 Current_Node := Corresponding_Stub (Parent (N));
7545 Op_Body := First (Declarations (N));
7547 -- The protected body is replaced with the bodies of its
7548 -- protected operations, and the declarations for internal objects
7549 -- that may have been created for entry family bounds.
7551 Rewrite (N, Make_Null_Statement (Sloc (N)));
7554 while Present (Op_Body) loop
7555 case Nkind (Op_Body) is
7556 when N_Subprogram_Declaration =>
7559 when N_Subprogram_Body =>
7561 -- Do not create bodies for eliminated operations
7563 if not Is_Eliminated (Defining_Entity (Op_Body))
7564 and then not Is_Eliminated (Corresponding_Spec (Op_Body))
7567 Build_Unprotected_Subprogram_Body (Op_Body, Pid);
7569 Insert_After (Current_Node, New_Op_Body);
7570 Current_Node := New_Op_Body;
7571 Analyze (New_Op_Body);
7573 -- Build the corresponding protected operation. It may
7574 -- appear that this is needed only if this is a visible
7575 -- operation of the type, or if it is an interrupt handler,
7576 -- and this was the strategy used previously in GNAT.
7577 -- However, the operation may be exported through a 'Access
7578 -- to an external caller. This is the common idiom in code
7579 -- that uses the Ada 2005 Timing_Events package. As a result
7580 -- we need to produce the protected body for both visible
7581 -- and private operations, as well as operations that only
7582 -- have a body in the source, and for which we create a
7583 -- declaration in the protected body itself.
7585 if Present (Corresponding_Spec (Op_Body)) then
7587 Build_Protected_Subprogram_Body (
7588 Op_Body, Pid, Specification (New_Op_Body));
7590 Insert_After (Current_Node, New_Op_Body);
7591 Analyze (New_Op_Body);
7593 Current_Node := New_Op_Body;
7595 -- Generate an overriding primitive operation body for
7596 -- this subprogram if the protected type implements an
7599 if Ada_Version >= Ada_2005
7601 Present (Interfaces (Corresponding_Record_Type (Pid)))
7604 Build_Dispatching_Subprogram_Body
7605 (Op_Body, Pid, New_Op_Body);
7607 Insert_After (Current_Node, Disp_Op_Body);
7608 Analyze (Disp_Op_Body);
7610 Current_Node := Disp_Op_Body;
7615 when N_Entry_Body =>
7616 Op_Id := Defining_Identifier (Op_Body);
7617 Num_Entries := Num_Entries + 1;
7619 New_Op_Body := Build_Protected_Entry (Op_Body, Op_Id, Pid);
7621 Insert_After (Current_Node, New_Op_Body);
7622 Current_Node := New_Op_Body;
7623 Analyze (New_Op_Body);
7625 when N_Implicit_Label_Declaration =>
7628 when N_Itype_Reference =>
7629 Insert_After (Current_Node, New_Copy (Op_Body));
7631 when N_Freeze_Entity =>
7632 New_Op_Body := New_Copy (Op_Body);
7634 if Present (Entity (Op_Body))
7635 and then Freeze_Node (Entity (Op_Body)) = Op_Body
7637 Set_Freeze_Node (Entity (Op_Body), New_Op_Body);
7640 Insert_After (Current_Node, New_Op_Body);
7641 Current_Node := New_Op_Body;
7642 Analyze (New_Op_Body);
7645 New_Op_Body := New_Copy (Op_Body);
7646 Insert_After (Current_Node, New_Op_Body);
7647 Current_Node := New_Op_Body;
7648 Analyze (New_Op_Body);
7650 when N_Object_Declaration =>
7651 pragma Assert (not Comes_From_Source (Op_Body));
7652 New_Op_Body := New_Copy (Op_Body);
7653 Insert_After (Current_Node, New_Op_Body);
7654 Current_Node := New_Op_Body;
7655 Analyze (New_Op_Body);
7658 raise Program_Error;
7665 -- Finally, create the body of the function that maps an entry index
7666 -- into the corresponding body index, except when there is no entry, or
7667 -- in a Ravenscar-like profile.
7669 if Corresponding_Runtime_Package (Pid) =
7670 System_Tasking_Protected_Objects_Entries
7672 New_Op_Body := Build_Find_Body_Index (Pid);
7673 Insert_After (Current_Node, New_Op_Body);
7674 Current_Node := New_Op_Body;
7675 Analyze (New_Op_Body);
7678 -- Ada 2005 (AI-345): Construct the primitive wrapper bodies after the
7679 -- protected body. At this point all wrapper specs have been created,
7680 -- frozen and included in the dispatch table for the protected type.
7682 if Ada_Version >= Ada_2005 then
7683 Build_Wrapper_Bodies (Loc, Pid, Current_Node);
7685 end Expand_N_Protected_Body;
7687 -----------------------------------------
7688 -- Expand_N_Protected_Type_Declaration --
7689 -----------------------------------------
7691 -- First we create a corresponding record type declaration used to
7692 -- represent values of this protected type.
7693 -- The general form of this type declaration is
7695 -- type poV (discriminants) is record
7696 -- _Object : aliased <kind>Protection
7697 -- [(<entry count> [, <handler count>])];
7698 -- [entry_family : array (bounds) of Void;]
7699 -- <private data fields>
7702 -- The discriminants are present only if the corresponding protected type
7703 -- has discriminants, and they exactly mirror the protected type
7704 -- discriminants. The private data fields similarly mirror the private
7705 -- declarations of the protected type.
7707 -- The Object field is always present. It contains RTS specific data used
7708 -- to control the protected object. It is declared as Aliased so that it
7709 -- can be passed as a pointer to the RTS. This allows the protected record
7710 -- to be referenced within RTS data structures. An appropriate Protection
7711 -- type and discriminant are generated.
7713 -- The Service field is present for protected objects with entries. It
7714 -- contains sufficient information to allow the entry service procedure for
7715 -- this object to be called when the object is not known till runtime.
7717 -- One entry_family component is present for each entry family in the
7718 -- task definition (see Expand_N_Task_Type_Declaration).
7720 -- When a protected object is declared, an instance of the protected type
7721 -- value record is created. The elaboration of this declaration creates the
7722 -- correct bounds for the entry families, and also evaluates the priority
7723 -- expression if needed. The initialization routine for the protected type
7724 -- itself then calls Initialize_Protection with appropriate parameters to
7725 -- initialize the value of the Task_Id field. Install_Handlers may be also
7726 -- called if a pragma Attach_Handler applies.
7728 -- Note: this record is passed to the subprograms created by the expansion
7729 -- of protected subprograms and entries. It is an in parameter to protected
7730 -- functions and an in out parameter to procedures and entry bodies. The
7731 -- Entity_Id for this created record type is placed in the
7732 -- Corresponding_Record_Type field of the associated protected type entity.
7734 -- Next we create a procedure specifications for protected subprograms and
7735 -- entry bodies. For each protected subprograms two subprograms are
7736 -- created, an unprotected and a protected version. The unprotected version
7737 -- is called from within other operations of the same protected object.
7739 -- We also build the call to register the procedure if a pragma
7740 -- Interrupt_Handler applies.
7742 -- A single subprogram is created to service all entry bodies; it has an
7743 -- additional boolean out parameter indicating that the previous entry call
7744 -- made by the current task was serviced immediately, i.e. not by proxy.
7745 -- The O parameter contains a pointer to a record object of the type
7746 -- described above. An untyped interface is used here to allow this
7747 -- procedure to be called in places where the type of the object to be
7748 -- serviced is not known. This must be done, for example, when a call that
7749 -- may have been requeued is cancelled; the corresponding object must be
7750 -- serviced, but which object that is not known till runtime.
7753 -- (O : System.Address; P : out Boolean);
7754 -- procedure pprocN (_object : in out poV);
7755 -- procedure pproc (_object : in out poV);
7756 -- function pfuncN (_object : poV);
7757 -- function pfunc (_object : poV);
7760 -- Note that this must come after the record type declaration, since
7761 -- the specs refer to this type.
7763 procedure Expand_N_Protected_Type_Declaration (N : Node_Id) is
7764 Loc : constant Source_Ptr := Sloc (N);
7765 Prot_Typ : constant Entity_Id := Defining_Identifier (N);
7767 Pdef : constant Node_Id := Protected_Definition (N);
7768 -- This contains two lists; one for visible and one for private decls
7772 Discr_Map : constant Elist_Id := New_Elmt_List;
7776 Comp_Id : Entity_Id;
7778 Current_Node : Node_Id := N;
7779 Bdef : Entity_Id := Empty; -- avoid uninit warning
7780 Edef : Entity_Id := Empty; -- avoid uninit warning
7781 Entries_Aggr : Node_Id;
7782 Body_Id : Entity_Id;
7785 Object_Comp : Node_Id;
7787 procedure Check_Inlining (Subp : Entity_Id);
7788 -- If the original operation has a pragma Inline, propagate the flag
7789 -- to the internal body, for possible inlining later on. The source
7790 -- operation is invisible to the back-end and is never actually called.
7792 function Static_Component_Size (Comp : Entity_Id) return Boolean;
7793 -- When compiling under the Ravenscar profile, private components must
7794 -- have a static size, or else a protected object will require heap
7795 -- allocation, violating the corresponding restriction. It is preferable
7796 -- to make this check here, because it provides a better error message
7797 -- than the back-end, which refers to the object as a whole.
7799 procedure Register_Handler;
7800 -- For a protected operation that is an interrupt handler, add the
7801 -- freeze action that will register it as such.
7803 --------------------
7804 -- Check_Inlining --
7805 --------------------
7807 procedure Check_Inlining (Subp : Entity_Id) is
7809 if Is_Inlined (Subp) then
7810 Set_Is_Inlined (Protected_Body_Subprogram (Subp));
7811 Set_Is_Inlined (Subp, False);
7815 ---------------------------------
7816 -- Check_Static_Component_Size --
7817 ---------------------------------
7819 function Static_Component_Size (Comp : Entity_Id) return Boolean is
7820 Typ : constant Entity_Id := Etype (Comp);
7824 if Is_Scalar_Type (Typ) then
7827 elsif Is_Array_Type (Typ) then
7828 return Compile_Time_Known_Bounds (Typ);
7830 elsif Is_Record_Type (Typ) then
7831 C := First_Component (Typ);
7832 while Present (C) loop
7833 if not Static_Component_Size (C) then
7842 -- Any other types will be checked by the back-end
7847 end Static_Component_Size;
7849 ----------------------
7850 -- Register_Handler --
7851 ----------------------
7853 procedure Register_Handler is
7855 -- All semantic checks already done in Sem_Prag
7857 Prot_Proc : constant Entity_Id :=
7859 (Specification (Current_Node));
7861 Proc_Address : constant Node_Id :=
7862 Make_Attribute_Reference (Loc,
7863 Prefix => New_Reference_To (Prot_Proc, Loc),
7864 Attribute_Name => Name_Address);
7866 RTS_Call : constant Entity_Id :=
7867 Make_Procedure_Call_Statement (Loc,
7870 RTE (RE_Register_Interrupt_Handler), Loc),
7871 Parameter_Associations =>
7872 New_List (Proc_Address));
7874 Append_Freeze_Action (Prot_Proc, RTS_Call);
7875 end Register_Handler;
7877 -- Start of processing for Expand_N_Protected_Type_Declaration
7880 if Present (Corresponding_Record_Type (Prot_Typ)) then
7883 Rec_Decl := Build_Corresponding_Record (N, Prot_Typ, Loc);
7886 Cdecls := Component_Items (Component_List (Type_Definition (Rec_Decl)));
7888 Qualify_Entity_Names (N);
7890 -- If the type has discriminants, their occurrences in the declaration
7891 -- have been replaced by the corresponding discriminals. For components
7892 -- that are constrained by discriminants, their homologues in the
7893 -- corresponding record type must refer to the discriminants of that
7894 -- record, so we must apply a new renaming to subtypes_indications:
7896 -- protected discriminant => discriminal => record discriminant
7898 -- This replacement is not applied to default expressions, for which
7899 -- the discriminal is correct.
7901 if Has_Discriminants (Prot_Typ) then
7907 Disc := First_Discriminant (Prot_Typ);
7908 Decl := First (Discriminant_Specifications (Rec_Decl));
7909 while Present (Disc) loop
7910 Append_Elmt (Discriminal (Disc), Discr_Map);
7911 Append_Elmt (Defining_Identifier (Decl), Discr_Map);
7912 Next_Discriminant (Disc);
7918 -- Fill in the component declarations
7920 -- Add components for entry families. For each entry family, create an
7921 -- anonymous type declaration with the same size, and analyze the type.
7923 Collect_Entry_Families (Loc, Cdecls, Current_Node, Prot_Typ);
7925 -- Prepend the _Object field with the right type to the component list.
7926 -- We need to compute the number of entries, and in some cases the
7927 -- number of Attach_Handler pragmas.
7931 Num_Attach_Handler : Int := 0;
7932 Protection_Subtype : Node_Id;
7933 Entry_Count_Expr : constant Node_Id :=
7934 Build_Entry_Count_Expression
7935 (Prot_Typ, Cdecls, Loc);
7938 -- Could this be simplified using Corresponding_Runtime_Package???
7940 if Has_Attach_Handler (Prot_Typ) then
7941 Ritem := First_Rep_Item (Prot_Typ);
7942 while Present (Ritem) loop
7943 if Nkind (Ritem) = N_Pragma
7944 and then Pragma_Name (Ritem) = Name_Attach_Handler
7946 Num_Attach_Handler := Num_Attach_Handler + 1;
7949 Next_Rep_Item (Ritem);
7952 if Restricted_Profile then
7953 if Has_Entries (Prot_Typ) then
7954 Protection_Subtype :=
7955 New_Reference_To (RTE (RE_Protection_Entry), Loc);
7957 Protection_Subtype :=
7958 New_Reference_To (RTE (RE_Protection), Loc);
7961 Protection_Subtype :=
7962 Make_Subtype_Indication
7966 (RTE (RE_Static_Interrupt_Protection), Loc),
7968 Make_Index_Or_Discriminant_Constraint (
7970 Constraints => New_List (
7972 Make_Integer_Literal (Loc, Num_Attach_Handler))));
7975 elsif Has_Interrupt_Handler (Prot_Typ) then
7976 Protection_Subtype :=
7977 Make_Subtype_Indication (
7979 Subtype_Mark => New_Reference_To
7980 (RTE (RE_Dynamic_Interrupt_Protection), Loc),
7982 Make_Index_Or_Discriminant_Constraint (
7984 Constraints => New_List (Entry_Count_Expr)));
7986 -- Type has explicit entries or generated primitive entry wrappers
7988 elsif Has_Entries (Prot_Typ)
7989 or else (Ada_Version >= Ada_2005
7990 and then Present (Interface_List (N)))
7992 case Corresponding_Runtime_Package (Prot_Typ) is
7993 when System_Tasking_Protected_Objects_Entries =>
7994 Protection_Subtype :=
7995 Make_Subtype_Indication (Loc,
7997 New_Reference_To (RTE (RE_Protection_Entries), Loc),
7999 Make_Index_Or_Discriminant_Constraint (
8001 Constraints => New_List (Entry_Count_Expr)));
8003 when System_Tasking_Protected_Objects_Single_Entry =>
8004 Protection_Subtype :=
8005 New_Reference_To (RTE (RE_Protection_Entry), Loc);
8008 raise Program_Error;
8012 Protection_Subtype := New_Reference_To (RTE (RE_Protection), Loc);
8016 Make_Component_Declaration (Loc,
8017 Defining_Identifier =>
8018 Make_Defining_Identifier (Loc, Name_uObject),
8019 Component_Definition =>
8020 Make_Component_Definition (Loc,
8021 Aliased_Present => True,
8022 Subtype_Indication => Protection_Subtype));
8025 pragma Assert (Present (Pdef));
8027 -- Add private field components
8029 if Present (Private_Declarations (Pdef)) then
8030 Priv := First (Private_Declarations (Pdef));
8032 while Present (Priv) loop
8034 if Nkind (Priv) = N_Component_Declaration then
8035 if not Static_Component_Size (Defining_Identifier (Priv)) then
8037 -- When compiling for a restricted profile, the private
8038 -- components must have a static size. If not, this is an
8039 -- error for a single protected declaration, and rates a
8040 -- warning on a protected type declaration.
8042 if not Comes_From_Source (Prot_Typ) then
8043 Check_Restriction (No_Implicit_Heap_Allocations, Priv);
8045 elsif Restriction_Active (No_Implicit_Heap_Allocations) then
8046 Error_Msg_N ("component has non-static size?", Priv);
8048 ("\creation of protected object of type& will violate"
8049 & " restriction No_Implicit_Heap_Allocations?",
8054 -- The component definition consists of a subtype indication,
8055 -- or (in Ada 2005) an access definition. Make a copy of the
8056 -- proper definition.
8059 Old_Comp : constant Node_Id := Component_Definition (Priv);
8060 Oent : constant Entity_Id := Defining_Identifier (Priv);
8062 Nent : constant Entity_Id :=
8063 Make_Defining_Identifier (Sloc (Oent),
8064 Chars => Chars (Oent));
8067 if Present (Subtype_Indication (Old_Comp)) then
8069 Make_Component_Definition (Sloc (Oent),
8070 Aliased_Present => False,
8071 Subtype_Indication =>
8072 New_Copy_Tree (Subtype_Indication (Old_Comp),
8076 Make_Component_Definition (Sloc (Oent),
8077 Aliased_Present => False,
8078 Access_Definition =>
8079 New_Copy_Tree (Access_Definition (Old_Comp),
8084 Make_Component_Declaration (Loc,
8085 Defining_Identifier => Nent,
8086 Component_Definition => New_Comp,
8087 Expression => Expression (Priv));
8089 Set_Has_Per_Object_Constraint (Nent,
8090 Has_Per_Object_Constraint (Oent));
8092 Append_To (Cdecls, New_Priv);
8095 elsif Nkind (Priv) = N_Subprogram_Declaration then
8097 -- Make the unprotected version of the subprogram available
8098 -- for expansion of intra object calls. There is need for
8099 -- a protected version only if the subprogram is an interrupt
8100 -- handler, otherwise this operation can only be called from
8104 Make_Subprogram_Declaration (Loc,
8106 Build_Protected_Sub_Specification
8107 (Priv, Prot_Typ, Unprotected_Mode));
8109 Insert_After (Current_Node, Sub);
8112 Set_Protected_Body_Subprogram
8113 (Defining_Unit_Name (Specification (Priv)),
8114 Defining_Unit_Name (Specification (Sub)));
8115 Check_Inlining (Defining_Unit_Name (Specification (Priv)));
8116 Current_Node := Sub;
8119 Make_Subprogram_Declaration (Loc,
8121 Build_Protected_Sub_Specification
8122 (Priv, Prot_Typ, Protected_Mode));
8124 Insert_After (Current_Node, Sub);
8126 Current_Node := Sub;
8128 if Is_Interrupt_Handler
8129 (Defining_Unit_Name (Specification (Priv)))
8131 if not Restricted_Profile then
8141 -- Put the _Object component after the private component so that it
8142 -- be finalized early as required by 9.4 (20)
8144 Append_To (Cdecls, Object_Comp);
8146 Insert_After (Current_Node, Rec_Decl);
8147 Current_Node := Rec_Decl;
8149 -- Analyze the record declaration immediately after construction,
8150 -- because the initialization procedure is needed for single object
8151 -- declarations before the next entity is analyzed (the freeze call
8152 -- that generates this initialization procedure is found below).
8154 Analyze (Rec_Decl, Suppress => All_Checks);
8156 -- Ada 2005 (AI-345): Construct the primitive entry wrappers before
8157 -- the corresponding record is frozen. If any wrappers are generated,
8158 -- Current_Node is updated accordingly.
8160 if Ada_Version >= Ada_2005 then
8161 Build_Wrapper_Specs (Loc, Prot_Typ, Current_Node);
8164 -- Collect pointers to entry bodies and their barriers, to be placed
8165 -- in the Entry_Bodies_Array for the type. For each entry/family we
8166 -- add an expression to the aggregate which is the initial value of
8167 -- this array. The array is declared after all protected subprograms.
8169 if Has_Entries (Prot_Typ) then
8170 Entries_Aggr := Make_Aggregate (Loc, Expressions => New_List);
8172 Entries_Aggr := Empty;
8175 -- Build two new procedure specifications for each protected subprogram;
8176 -- one to call from outside the object and one to call from inside.
8177 -- Build a barrier function and an entry body action procedure
8178 -- specification for each protected entry. Initialize the entry body
8179 -- array. If subprogram is flagged as eliminated, do not generate any
8180 -- internal operations.
8184 Comp := First (Visible_Declarations (Pdef));
8186 while Present (Comp) loop
8187 if Nkind (Comp) = N_Subprogram_Declaration then
8189 Make_Subprogram_Declaration (Loc,
8191 Build_Protected_Sub_Specification
8192 (Comp, Prot_Typ, Unprotected_Mode));
8194 Insert_After (Current_Node, Sub);
8197 Set_Protected_Body_Subprogram
8198 (Defining_Unit_Name (Specification (Comp)),
8199 Defining_Unit_Name (Specification (Sub)));
8200 Check_Inlining (Defining_Unit_Name (Specification (Comp)));
8202 -- Make the protected version of the subprogram available for
8203 -- expansion of external calls.
8205 Current_Node := Sub;
8208 Make_Subprogram_Declaration (Loc,
8210 Build_Protected_Sub_Specification
8211 (Comp, Prot_Typ, Protected_Mode));
8213 Insert_After (Current_Node, Sub);
8216 Current_Node := Sub;
8218 -- Generate an overriding primitive operation specification for
8219 -- this subprogram if the protected type implements an interface.
8221 if Ada_Version >= Ada_2005
8223 Present (Interfaces (Corresponding_Record_Type (Prot_Typ)))
8226 Make_Subprogram_Declaration (Loc,
8228 Build_Protected_Sub_Specification
8229 (Comp, Prot_Typ, Dispatching_Mode));
8231 Insert_After (Current_Node, Sub);
8234 Current_Node := Sub;
8237 -- If a pragma Interrupt_Handler applies, build and add a call to
8238 -- Register_Interrupt_Handler to the freezing actions of the
8239 -- protected version (Current_Node) of the subprogram:
8241 -- system.interrupts.register_interrupt_handler
8242 -- (prot_procP'address);
8244 if not Restricted_Profile
8245 and then Is_Interrupt_Handler
8246 (Defining_Unit_Name (Specification (Comp)))
8251 elsif Nkind (Comp) = N_Entry_Declaration then
8252 E_Count := E_Count + 1;
8253 Comp_Id := Defining_Identifier (Comp);
8256 Make_Defining_Identifier (Loc,
8257 Build_Selected_Name (Prot_Typ, Comp_Id, 'E'));
8259 Make_Subprogram_Declaration (Loc,
8261 Build_Protected_Entry_Specification (Loc, Edef, Comp_Id));
8263 Insert_After (Current_Node, Sub);
8266 -- build wrapper procedure for pre/postconditions.
8268 Build_PPC_Wrapper (Comp_Id, N);
8270 Set_Protected_Body_Subprogram
8271 (Defining_Identifier (Comp),
8272 Defining_Unit_Name (Specification (Sub)));
8274 Current_Node := Sub;
8277 Make_Defining_Identifier (Loc,
8278 Chars => Build_Selected_Name (Prot_Typ, Comp_Id, 'B'));
8280 Make_Subprogram_Declaration (Loc,
8282 Build_Barrier_Function_Specification (Loc, Bdef));
8284 Insert_After (Current_Node, Sub);
8286 Set_Protected_Body_Subprogram (Bdef, Bdef);
8287 Set_Barrier_Function (Comp_Id, Bdef);
8288 Set_Scope (Bdef, Scope (Comp_Id));
8289 Current_Node := Sub;
8291 -- Collect pointers to the protected subprogram and the barrier
8292 -- of the current entry, for insertion into Entry_Bodies_Array.
8295 Make_Aggregate (Loc,
8296 Expressions => New_List (
8297 Make_Attribute_Reference (Loc,
8298 Prefix => New_Reference_To (Bdef, Loc),
8299 Attribute_Name => Name_Unrestricted_Access),
8300 Make_Attribute_Reference (Loc,
8301 Prefix => New_Reference_To (Edef, Loc),
8302 Attribute_Name => Name_Unrestricted_Access))),
8303 Expressions (Entries_Aggr));
8310 -- If there are some private entry declarations, expand it as if they
8311 -- were visible entries.
8313 if Present (Private_Declarations (Pdef)) then
8314 Comp := First (Private_Declarations (Pdef));
8315 while Present (Comp) loop
8316 if Nkind (Comp) = N_Entry_Declaration then
8317 E_Count := E_Count + 1;
8318 Comp_Id := Defining_Identifier (Comp);
8321 Make_Defining_Identifier (Loc,
8322 Build_Selected_Name (Prot_Typ, Comp_Id, 'E'));
8324 Make_Subprogram_Declaration (Loc,
8326 Build_Protected_Entry_Specification (Loc, Edef, Comp_Id));
8328 Insert_After (Current_Node, Sub);
8331 Set_Protected_Body_Subprogram
8332 (Defining_Identifier (Comp),
8333 Defining_Unit_Name (Specification (Sub)));
8335 Current_Node := Sub;
8338 Make_Defining_Identifier (Loc,
8339 Chars => Build_Selected_Name (Prot_Typ, Comp_Id, 'E'));
8342 Make_Subprogram_Declaration (Loc,
8344 Build_Barrier_Function_Specification (Loc, Bdef));
8346 Insert_After (Current_Node, Sub);
8348 Set_Protected_Body_Subprogram (Bdef, Bdef);
8349 Set_Barrier_Function (Comp_Id, Bdef);
8350 Set_Scope (Bdef, Scope (Comp_Id));
8351 Current_Node := Sub;
8353 -- Collect pointers to the protected subprogram and the barrier
8354 -- of the current entry, for insertion into Entry_Bodies_Array.
8356 Append_To (Expressions (Entries_Aggr),
8357 Make_Aggregate (Loc,
8358 Expressions => New_List (
8359 Make_Attribute_Reference (Loc,
8360 Prefix => New_Reference_To (Bdef, Loc),
8361 Attribute_Name => Name_Unrestricted_Access),
8362 Make_Attribute_Reference (Loc,
8363 Prefix => New_Reference_To (Edef, Loc),
8364 Attribute_Name => Name_Unrestricted_Access))));
8371 -- Emit declaration for Entry_Bodies_Array, now that the addresses of
8372 -- all protected subprograms have been collected.
8374 if Has_Entries (Prot_Typ) then
8376 Make_Defining_Identifier (Sloc (Prot_Typ),
8377 Chars => New_External_Name (Chars (Prot_Typ), 'A'));
8379 case Corresponding_Runtime_Package (Prot_Typ) is
8380 when System_Tasking_Protected_Objects_Entries =>
8381 Body_Arr := Make_Object_Declaration (Loc,
8382 Defining_Identifier => Body_Id,
8383 Aliased_Present => True,
8384 Object_Definition =>
8385 Make_Subtype_Indication (Loc,
8386 Subtype_Mark => New_Reference_To (
8387 RTE (RE_Protected_Entry_Body_Array), Loc),
8389 Make_Index_Or_Discriminant_Constraint (Loc,
8390 Constraints => New_List (
8392 Make_Integer_Literal (Loc, 1),
8393 Make_Integer_Literal (Loc, E_Count))))),
8394 Expression => Entries_Aggr);
8396 when System_Tasking_Protected_Objects_Single_Entry =>
8397 Body_Arr := Make_Object_Declaration (Loc,
8398 Defining_Identifier => Body_Id,
8399 Aliased_Present => True,
8400 Object_Definition => New_Reference_To
8401 (RTE (RE_Entry_Body), Loc),
8403 Make_Aggregate (Loc,
8404 Expressions => New_List (
8405 Make_Attribute_Reference (Loc,
8406 Prefix => New_Reference_To (Bdef, Loc),
8407 Attribute_Name => Name_Unrestricted_Access),
8408 Make_Attribute_Reference (Loc,
8409 Prefix => New_Reference_To (Edef, Loc),
8410 Attribute_Name => Name_Unrestricted_Access))));
8413 raise Program_Error;
8416 -- A pointer to this array will be placed in the corresponding record
8417 -- by its initialization procedure so this needs to be analyzed here.
8419 Insert_After (Current_Node, Body_Arr);
8420 Current_Node := Body_Arr;
8423 Set_Entry_Bodies_Array (Prot_Typ, Body_Id);
8425 -- Finally, build the function that maps an entry index into the
8426 -- corresponding body. A pointer to this function is placed in each
8427 -- object of the type. Except for a ravenscar-like profile (no abort,
8428 -- no entry queue, 1 entry)
8430 if Corresponding_Runtime_Package (Prot_Typ) =
8431 System_Tasking_Protected_Objects_Entries
8434 Make_Subprogram_Declaration (Loc,
8435 Specification => Build_Find_Body_Index_Spec (Prot_Typ));
8436 Insert_After (Current_Node, Sub);
8440 end Expand_N_Protected_Type_Declaration;
8442 --------------------------------
8443 -- Expand_N_Requeue_Statement --
8444 --------------------------------
8446 -- A non-dispatching requeue statement is expanded into one of four GNARLI
8447 -- operations, depending on the source and destination (task or protected
8448 -- object). A dispatching requeue statement is expanded into a call to the
8449 -- predefined primitive _Disp_Requeue. In addition, code is generated to
8450 -- jump around the remainder of processing for the original entry and, if
8451 -- the destination is (different) protected object, to attempt to service
8452 -- it. The following illustrates the various cases:
8455 -- (O : System.Address;
8456 -- P : System.Address;
8457 -- E : Protected_Entry_Index)
8459 -- <discriminant renamings>
8460 -- <private object renamings>
8461 -- type poVP is access poV;
8462 -- _object : ptVP := ptVP!(O);
8466 -- <start of statement sequence for entry>
8468 -- -- Requeue from one protected entry body to another protected
8471 -- Requeue_Protected_Entry (
8472 -- _object._object'Access,
8473 -- new._object'Access,
8478 -- <some more of the statement sequence for entry>
8480 -- -- Requeue from an entry body to a task entry
8482 -- Requeue_Protected_To_Task_Entry (
8488 -- <rest of statement sequence for entry>
8489 -- Complete_Entry_Body (_object._object);
8492 -- when all others =>
8493 -- Exceptional_Complete_Entry_Body (
8494 -- _object._object, Get_GNAT_Exception);
8498 -- Requeue of a task entry call to a task entry
8500 -- Accept_Call (E, Ann);
8501 -- <start of statement sequence for accept statement>
8502 -- Requeue_Task_Entry (New._task_id, E, Abort_Present);
8504 -- <rest of statement sequence for accept statement>
8506 -- Complete_Rendezvous;
8509 -- when all others =>
8510 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
8512 -- Requeue of a task entry call to a protected entry
8514 -- Accept_Call (E, Ann);
8515 -- <start of statement sequence for accept statement>
8516 -- Requeue_Task_To_Protected_Entry (
8517 -- new._object'Access,
8522 -- <rest of statement sequence for accept statement>
8524 -- Complete_Rendezvous;
8527 -- when all others =>
8528 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
8530 -- Ada 2012 (AI05-0030): Dispatching requeue to an interface primitive
8531 -- marked by pragma Implemented (XXX, By_Entry).
8533 -- The requeue is inside a protected entry:
8536 -- (O : System.Address;
8537 -- P : System.Address;
8538 -- E : Protected_Entry_Index)
8540 -- <discriminant renamings>
8541 -- <private object renamings>
8542 -- type poVP is access poV;
8543 -- _object : ptVP := ptVP!(O);
8547 -- <start of statement sequence for entry>
8550 -- (<interface class-wide object>,
8553 -- Ada.Tags.Get_Offset_Index
8555 -- <interface dispatch table index of target entry>),
8559 -- <rest of statement sequence for entry>
8560 -- Complete_Entry_Body (_object._object);
8563 -- when all others =>
8564 -- Exceptional_Complete_Entry_Body (
8565 -- _object._object, Get_GNAT_Exception);
8569 -- The requeue is inside a task entry:
8571 -- Accept_Call (E, Ann);
8572 -- <start of statement sequence for accept statement>
8574 -- (<interface class-wide object>,
8577 -- Ada.Tags.Get_Offset_Index
8579 -- <interface dispatch table index of target entrt>),
8583 -- <rest of statement sequence for accept statement>
8585 -- Complete_Rendezvous;
8588 -- when all others =>
8589 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
8591 -- Ada 2012 (AI05-0030): Dispatching requeue to an interface primitive
8592 -- marked by pragma Implemented (XXX, By_Protected_Procedure). The requeue
8593 -- statement is replaced by a dispatching call with actual parameters taken
8594 -- from the inner-most accept statement or entry body.
8596 -- Target.Primitive (Param1, ..., ParamN);
8598 -- Ada 2012 (AI05-0030): Dispatching requeue to an interface primitive
8599 -- marked by pragma Implemented (XXX, By_Any) or not marked at all.
8602 -- S : constant Offset_Index :=
8603 -- Get_Offset_Index (Tag (Concval), DT_Position (Ename));
8604 -- C : constant Prim_Op_Kind := Get_Prim_Op_Kind (Tag (Concval), S);
8607 -- if C = POK_Protected_Entry
8608 -- or else C = POK_Task_Entry
8610 -- <statements for dispatching requeue>
8612 -- elsif C = POK_Protected_Procedure then
8613 -- <dispatching call equivalent>
8616 -- raise Program_Error;
8620 procedure Expand_N_Requeue_Statement (N : Node_Id) is
8621 Loc : constant Source_Ptr := Sloc (N);
8622 Conc_Typ : Entity_Id;
8626 Old_Typ : Entity_Id;
8628 function Build_Dispatching_Call_Equivalent return Node_Id;
8629 -- Ada 2012 (AI05-0030): N denotes a dispatching requeue statement of
8630 -- the form Concval.Ename. It is statically known that Ename is allowed
8631 -- to be implemented by a protected procedure. Create a dispatching call
8632 -- equivalent of Concval.Ename taking the actual parameters from the
8633 -- inner-most accept statement or entry body.
8635 function Build_Dispatching_Requeue return Node_Id;
8636 -- Ada 2012 (AI05-0030): N denotes a dispatching requeue statement of
8637 -- the form Concval.Ename. It is statically known that Ename is allowed
8638 -- to be implemented by a protected or a task entry. Create a call to
8639 -- primitive _Disp_Requeue which handles the low-level actions.
8641 function Build_Dispatching_Requeue_To_Any return Node_Id;
8642 -- Ada 2012 (AI05-0030): N denotes a dispatching requeue statement of
8643 -- the form Concval.Ename. Ename is either marked by pragma Implemented
8644 -- (XXX, By_Any) or not marked at all. Create a block which determines
8645 -- at runtime whether Ename denotes an entry or a procedure and perform
8646 -- the appropriate kind of dispatching select.
8648 function Build_Normal_Requeue return Node_Id;
8649 -- N denotes a non-dispatching requeue statement to either a task or a
8650 -- protected entry. Build the appropriate runtime call to perform the
8653 function Build_Skip_Statement (Search : Node_Id) return Node_Id;
8654 -- For a protected entry, create a return statement to skip the rest of
8655 -- the entry body. Otherwise, create a goto statement to skip the rest
8656 -- of a task accept statement. The lookup for the enclosing entry body
8657 -- or accept statement starts from Search.
8659 ---------------------------------------
8660 -- Build_Dispatching_Call_Equivalent --
8661 ---------------------------------------
8663 function Build_Dispatching_Call_Equivalent return Node_Id is
8664 Call_Ent : constant Entity_Id := Entity (Ename);
8665 Obj : constant Node_Id := Original_Node (Concval);
8672 -- Climb the parent chain looking for the inner-most entry body or
8673 -- accept statement.
8676 while Present (Acc_Ent)
8677 and then not Nkind_In (Acc_Ent, N_Accept_Statement,
8680 Acc_Ent := Parent (Acc_Ent);
8683 -- A requeue statement should be housed inside an entry body or an
8684 -- accept statement at some level. If this is not the case, then the
8685 -- tree is malformed.
8687 pragma Assert (Present (Acc_Ent));
8689 -- Recover the list of formal parameters
8691 if Nkind (Acc_Ent) = N_Entry_Body then
8692 Acc_Ent := Entry_Body_Formal_Part (Acc_Ent);
8695 Formals := Parameter_Specifications (Acc_Ent);
8697 -- Create the actual parameters for the dispatching call. These are
8698 -- simply copies of the entry body or accept statement formals in the
8699 -- same order as they appear.
8703 if Present (Formals) then
8704 Actuals := New_List;
8705 Formal := First (Formals);
8706 while Present (Formal) loop
8708 Make_Identifier (Loc, Chars (Defining_Identifier (Formal))));
8714 -- Obj.Call_Ent (Actuals);
8717 Make_Procedure_Call_Statement (Loc,
8719 Make_Selected_Component (Loc,
8720 Prefix => Make_Identifier (Loc, Chars (Obj)),
8721 Selector_Name => Make_Identifier (Loc, Chars (Call_Ent))),
8723 Parameter_Associations => Actuals);
8724 end Build_Dispatching_Call_Equivalent;
8726 -------------------------------
8727 -- Build_Dispatching_Requeue --
8728 -------------------------------
8730 function Build_Dispatching_Requeue return Node_Id is
8731 Params : constant List_Id := New_List;
8734 -- Process the "with abort" parameter
8737 New_Reference_To (Boolean_Literals (Abort_Present (N)), Loc));
8739 -- Process the entry wrapper's position in the primary dispatch
8740 -- table parameter. Generate:
8742 -- Ada.Tags.Get_Offset_Index
8743 -- (Ada.Tags.Tag (Concval),
8744 -- <interface dispatch table position of Ename>)
8746 if Tagged_Type_Expansion then
8748 Make_Function_Call (Loc,
8749 Name => New_Reference_To (RTE (RE_Get_Offset_Index), Loc),
8750 Parameter_Associations => New_List (
8751 Unchecked_Convert_To (RTE (RE_Tag), Concval),
8752 Make_Integer_Literal (Loc, DT_Position (Entity (Ename))))));
8758 Make_Function_Call (Loc,
8759 Name => New_Reference_To (RTE (RE_Get_Offset_Index), Loc),
8761 Parameter_Associations => New_List (
8765 Make_Attribute_Reference (Loc,
8767 Attribute_Name => Name_Tag),
8771 Make_Attribute_Reference (Loc,
8772 Prefix => New_Reference_To (Etype (Concval), Loc),
8773 Attribute_Name => Name_Tag),
8777 Make_Integer_Literal (Loc, DT_Position (Entity (Ename))))));
8780 -- Specific actuals for protected to XXX requeue
8782 if Is_Protected_Type (Old_Typ) then
8784 Make_Attribute_Reference (Loc, -- _object'Address
8786 Concurrent_Ref (New_Occurrence_Of (Old_Typ, Loc)),
8787 Attribute_Name => Name_Address));
8789 Prepend_To (Params, -- True
8790 New_Reference_To (Standard_True, Loc));
8792 -- Specific actuals for task to XXX requeue
8795 pragma Assert (Is_Task_Type (Old_Typ));
8797 Prepend_To (Params, -- null
8798 New_Reference_To (RTE (RE_Null_Address), Loc));
8800 Prepend_To (Params, -- False
8801 New_Reference_To (Standard_False, Loc));
8804 -- Add the object parameter
8806 Prepend_To (Params, New_Copy_Tree (Concval));
8809 -- _Disp_Requeue (<Params>);
8812 Make_Procedure_Call_Statement (Loc,
8813 Name => Make_Identifier (Loc, Name_uDisp_Requeue),
8814 Parameter_Associations => Params);
8815 end Build_Dispatching_Requeue;
8817 --------------------------------------
8818 -- Build_Dispatching_Requeue_To_Any --
8819 --------------------------------------
8821 function Build_Dispatching_Requeue_To_Any return Node_Id is
8822 Call_Ent : constant Entity_Id := Entity (Ename);
8823 Obj : constant Node_Id := Original_Node (Concval);
8824 Skip : constant Node_Id := Build_Skip_Statement (N);
8834 -- Dispatch table slot processing, generate:
8837 S := Build_S (Loc, Decls);
8839 -- Call kind processing, generate:
8840 -- C : Ada.Tags.Prim_Op_Kind;
8842 C := Build_C (Loc, Decls);
8845 -- S := Ada.Tags.Get_Offset_Index
8846 -- (Ada.Tags.Tag (Obj), DT_Position (Call_Ent));
8848 Append_To (Stmts, Build_S_Assignment (Loc, S, Obj, Call_Ent));
8851 -- _Disp_Get_Prim_Op_Kind (Obj, S, C);
8854 Make_Procedure_Call_Statement (Loc,
8857 Find_Prim_Op (Etype (Etype (Obj)),
8858 Name_uDisp_Get_Prim_Op_Kind),
8860 Parameter_Associations => New_List (
8861 New_Copy_Tree (Obj),
8862 New_Reference_To (S, Loc),
8863 New_Reference_To (C, Loc))));
8867 -- if C = POK_Protected_Entry
8868 -- or else C = POK_Task_Entry
8871 Make_If_Statement (Loc,
8877 New_Reference_To (C, Loc),
8879 New_Reference_To (RTE (RE_POK_Protected_Entry), Loc)),
8884 New_Reference_To (C, Loc),
8886 New_Reference_To (RTE (RE_POK_Task_Entry), Loc))),
8888 -- Dispatching requeue equivalent
8890 Then_Statements => New_List (
8891 Build_Dispatching_Requeue,
8894 -- elsif C = POK_Protected_Procedure then
8896 Elsif_Parts => New_List (
8897 Make_Elsif_Part (Loc,
8901 New_Reference_To (C, Loc),
8904 RTE (RE_POK_Protected_Procedure), Loc)),
8906 -- Dispatching call equivalent
8908 Then_Statements => New_List (
8909 Build_Dispatching_Call_Equivalent))),
8912 -- raise Program_Error;
8915 Else_Statements => New_List (
8916 Make_Raise_Program_Error (Loc,
8917 Reason => PE_Explicit_Raise))));
8919 -- Wrap everything into a block
8922 Make_Block_Statement (Loc,
8923 Declarations => Decls,
8924 Handled_Statement_Sequence =>
8925 Make_Handled_Sequence_Of_Statements (Loc,
8926 Statements => Stmts));
8927 end Build_Dispatching_Requeue_To_Any;
8929 --------------------------
8930 -- Build_Normal_Requeue --
8931 --------------------------
8933 function Build_Normal_Requeue return Node_Id is
8934 Params : constant List_Id := New_List;
8939 -- Process the "with abort" parameter
8942 New_Reference_To (Boolean_Literals (Abort_Present (N)), Loc));
8944 -- Add the index expression to the parameters. It is common among all
8948 Entry_Index_Expression (Loc, Entity (Ename), Index, Conc_Typ));
8950 if Is_Protected_Type (Old_Typ) then
8952 Self_Param : Node_Id;
8956 Make_Attribute_Reference (Loc,
8958 Concurrent_Ref (New_Occurrence_Of (Old_Typ, Loc)),
8960 Name_Unchecked_Access);
8962 -- Protected to protected requeue
8964 if Is_Protected_Type (Conc_Typ) then
8967 RTE (RE_Requeue_Protected_Entry), Loc);
8970 Make_Attribute_Reference (Loc,
8972 Concurrent_Ref (Concval),
8974 Name_Unchecked_Access);
8976 -- Protected to task requeue
8978 else pragma Assert (Is_Task_Type (Conc_Typ));
8981 RTE (RE_Requeue_Protected_To_Task_Entry), Loc);
8983 Param := Concurrent_Ref (Concval);
8986 Prepend_To (Params, Param);
8987 Prepend_To (Params, Self_Param);
8990 else pragma Assert (Is_Task_Type (Old_Typ));
8992 -- Task to protected requeue
8994 if Is_Protected_Type (Conc_Typ) then
8997 RTE (RE_Requeue_Task_To_Protected_Entry), Loc);
9000 Make_Attribute_Reference (Loc,
9002 Concurrent_Ref (Concval),
9004 Name_Unchecked_Access);
9006 -- Task to task requeue
9008 else pragma Assert (Is_Task_Type (Conc_Typ));
9010 New_Reference_To (RTE (RE_Requeue_Task_Entry), Loc);
9012 Param := Concurrent_Ref (Concval);
9015 Prepend_To (Params, Param);
9019 Make_Procedure_Call_Statement (Loc,
9021 Parameter_Associations => Params);
9022 end Build_Normal_Requeue;
9024 --------------------------
9025 -- Build_Skip_Statement --
9026 --------------------------
9028 function Build_Skip_Statement (Search : Node_Id) return Node_Id is
9029 Skip_Stmt : Node_Id;
9032 -- Build a return statement to skip the rest of the entire body
9034 if Is_Protected_Type (Old_Typ) then
9035 Skip_Stmt := Make_Simple_Return_Statement (Loc);
9037 -- If the requeue is within a task, find the end label of the
9038 -- enclosing accept statement and create a goto statement to it.
9046 -- Climb the parent chain looking for the enclosing accept
9049 Acc := Parent (Search);
9051 and then Nkind (Acc) /= N_Accept_Statement
9053 Acc := Parent (Acc);
9056 -- The last statement is the second label used for completing
9057 -- the rendezvous the usual way. The label we are looking for
9058 -- is right before it.
9061 Prev (Last (Statements (Handled_Statement_Sequence (Acc))));
9063 pragma Assert (Nkind (Label) = N_Label);
9065 -- Generate a goto statement to skip the rest of the accept
9068 Make_Goto_Statement (Loc,
9070 New_Occurrence_Of (Entity (Identifier (Label)), Loc));
9074 Set_Analyzed (Skip_Stmt);
9077 end Build_Skip_Statement;
9079 -- Start of processing for Expand_N_Requeue_Statement
9082 -- Extract the components of the entry call
9084 Extract_Entry (N, Concval, Ename, Index);
9085 Conc_Typ := Etype (Concval);
9087 -- Examine the scope stack in order to find nearest enclosing protected
9088 -- or task type. This will constitute our invocation source.
9090 Old_Typ := Current_Scope;
9091 while Present (Old_Typ)
9092 and then not Is_Protected_Type (Old_Typ)
9093 and then not Is_Task_Type (Old_Typ)
9095 Old_Typ := Scope (Old_Typ);
9098 -- Ada 2012 (AI05-0030): We have a dispatching requeue of the form
9099 -- Concval.Ename where the type of Concval is class-wide concurrent
9102 if Ada_Version >= Ada_2012
9103 and then Present (Concval)
9104 and then Is_Class_Wide_Type (Conc_Typ)
9105 and then Is_Concurrent_Interface (Conc_Typ)
9108 Has_Impl : Boolean := False;
9109 Impl_Kind : Name_Id := No_Name;
9112 -- Check whether the Ename is flagged by pragma Implemented
9114 if Has_Rep_Pragma (Entity (Ename), Name_Implemented) then
9116 Impl_Kind := Implementation_Kind (Entity (Ename));
9119 -- The procedure_or_entry_NAME is guaranteed to be overridden by
9120 -- an entry. Create a call to predefined primitive _Disp_Requeue.
9123 and then Impl_Kind = Name_By_Entry
9125 Rewrite (N, Build_Dispatching_Requeue);
9127 Insert_After (N, Build_Skip_Statement (N));
9129 -- The procedure_or_entry_NAME is guaranteed to be overridden by
9130 -- a protected procedure. In this case the requeue is transformed
9131 -- into a dispatching call.
9134 and then Impl_Kind = Name_By_Protected_Procedure
9136 Rewrite (N, Build_Dispatching_Call_Equivalent);
9139 -- The procedure_or_entry_NAME's implementation kind is either
9140 -- By_Any or pragma Implemented was not applied at all. In this
9141 -- case a runtime test determines whether Ename denotes an entry
9142 -- or a protected procedure and performs the appropriate call.
9145 Rewrite (N, Build_Dispatching_Requeue_To_Any);
9150 -- Processing for regular (non-dispatching) requeues
9153 Rewrite (N, Build_Normal_Requeue);
9155 Insert_After (N, Build_Skip_Statement (N));
9157 end Expand_N_Requeue_Statement;
9159 -------------------------------
9160 -- Expand_N_Selective_Accept --
9161 -------------------------------
9163 procedure Expand_N_Selective_Accept (N : Node_Id) is
9164 Loc : constant Source_Ptr := Sloc (N);
9165 Alts : constant List_Id := Select_Alternatives (N);
9167 -- Note: in the below declarations a lot of new lists are allocated
9168 -- unconditionally which may well not end up being used. That's
9169 -- not a good idea since it wastes space gratuitously ???
9171 Accept_Case : List_Id;
9172 Accept_List : constant List_Id := New_List;
9175 Alt_List : constant List_Id := New_List;
9176 Alt_Stats : List_Id;
9177 Ann : Entity_Id := Empty;
9180 Check_Guard : Boolean := True;
9182 Decls : constant List_Id := New_List;
9183 Stats : constant List_Id := New_List;
9184 Body_List : constant List_Id := New_List;
9185 Trailing_List : constant List_Id := New_List;
9188 Else_Present : Boolean := False;
9189 Terminate_Alt : Node_Id := Empty;
9190 Select_Mode : Node_Id;
9192 Delay_Case : List_Id;
9193 Delay_Count : Integer := 0;
9194 Delay_Val : Entity_Id;
9195 Delay_Index : Entity_Id;
9196 Delay_Min : Entity_Id;
9197 Delay_Num : Int := 1;
9198 Delay_Alt_List : List_Id := New_List;
9199 Delay_List : constant List_Id := New_List;
9203 First_Delay : Boolean := True;
9204 Guard_Open : Entity_Id;
9210 Num_Accept : Nat := 0;
9213 Time_Type : Entity_Id;
9215 Select_Call : Node_Id;
9217 Qnam : constant Entity_Id :=
9218 Make_Defining_Identifier (Loc, New_External_Name ('S', 0));
9220 Xnam : constant Entity_Id :=
9221 Make_Defining_Identifier (Loc, New_External_Name ('J', 1));
9223 -----------------------
9224 -- Local subprograms --
9225 -----------------------
9227 function Accept_Or_Raise return List_Id;
9228 -- For the rare case where delay alternatives all have guards, and
9229 -- all of them are closed, it is still possible that there were open
9230 -- accept alternatives with no callers. We must reexamine the
9231 -- Accept_List, and execute a selective wait with no else if some
9232 -- accept is open. If none, we raise program_error.
9234 procedure Add_Accept (Alt : Node_Id);
9235 -- Process a single accept statement in a select alternative. Build
9236 -- procedure for body of accept, and add entry to dispatch table with
9237 -- expression for guard, in preparation for call to run time select.
9239 function Make_And_Declare_Label (Num : Int) return Node_Id;
9240 -- Manufacture a label using Num as a serial number and declare it.
9241 -- The declaration is appended to Decls. The label marks the trailing
9242 -- statements of an accept or delay alternative.
9244 function Make_Select_Call (Select_Mode : Entity_Id) return Node_Id;
9245 -- Build call to Selective_Wait runtime routine
9247 procedure Process_Delay_Alternative (Alt : Node_Id; Index : Int);
9248 -- Add code to compare value of delay with previous values, and
9249 -- generate case entry for trailing statements.
9251 procedure Process_Accept_Alternative
9255 -- Add code to call corresponding procedure, and branch to
9256 -- trailing statements, if any.
9258 ---------------------
9259 -- Accept_Or_Raise --
9260 ---------------------
9262 function Accept_Or_Raise return List_Id is
9265 J : constant Entity_Id := Make_Temporary (Loc, 'J');
9268 -- We generate the following:
9270 -- for J in q'range loop
9271 -- if q(J).S /=null_task_entry then
9272 -- selective_wait (simple_mode,...);
9278 -- if no rendez_vous then
9279 -- raise program_error;
9282 -- Note that the code needs to know that the selector name
9283 -- in an Accept_Alternative is named S.
9285 Cond := Make_Op_Ne (Loc,
9287 Make_Selected_Component (Loc,
9289 Make_Indexed_Component (Loc,
9290 Prefix => New_Reference_To (Qnam, Loc),
9291 Expressions => New_List (New_Reference_To (J, Loc))),
9292 Selector_Name => Make_Identifier (Loc, Name_S)),
9294 New_Reference_To (RTE (RE_Null_Task_Entry), Loc));
9297 Make_Implicit_Loop_Statement (N,
9298 Identifier => Empty,
9300 Make_Iteration_Scheme (Loc,
9301 Loop_Parameter_Specification =>
9302 Make_Loop_Parameter_Specification (Loc,
9303 Defining_Identifier => J,
9304 Discrete_Subtype_Definition =>
9305 Make_Attribute_Reference (Loc,
9306 Prefix => New_Reference_To (Qnam, Loc),
9307 Attribute_Name => Name_Range,
9308 Expressions => New_List (
9309 Make_Integer_Literal (Loc, 1))))),
9311 Statements => New_List (
9312 Make_Implicit_If_Statement (N,
9314 Then_Statements => New_List (
9316 New_Reference_To (RTE (RE_Simple_Mode), Loc)),
9317 Make_Exit_Statement (Loc))))));
9320 Make_Raise_Program_Error (Loc,
9321 Condition => Make_Op_Eq (Loc,
9322 Left_Opnd => New_Reference_To (Xnam, Loc),
9324 New_Reference_To (RTE (RE_No_Rendezvous), Loc)),
9325 Reason => PE_All_Guards_Closed));
9328 end Accept_Or_Raise;
9334 procedure Add_Accept (Alt : Node_Id) is
9335 Acc_Stm : constant Node_Id := Accept_Statement (Alt);
9336 Ename : constant Node_Id := Entry_Direct_Name (Acc_Stm);
9337 Eloc : constant Source_Ptr := Sloc (Ename);
9338 Eent : constant Entity_Id := Entity (Ename);
9339 Index : constant Node_Id := Entry_Index (Acc_Stm);
9340 Null_Body : Node_Id;
9341 Proc_Body : Node_Id;
9348 Ann := Node (Last_Elmt (Accept_Address (Eent)));
9351 if Present (Condition (Alt)) then
9353 Make_Conditional_Expression (Eloc, New_List (
9355 Entry_Index_Expression (Eloc, Eent, Index, Scope (Eent)),
9356 New_Reference_To (RTE (RE_Null_Task_Entry), Eloc)));
9359 Entry_Index_Expression
9360 (Eloc, Eent, Index, Scope (Eent));
9363 if Present (Handled_Statement_Sequence (Accept_Statement (Alt))) then
9364 Null_Body := New_Reference_To (Standard_False, Eloc);
9366 if Abort_Allowed then
9367 Call := Make_Procedure_Call_Statement (Eloc,
9368 Name => New_Reference_To (RTE (RE_Abort_Undefer), Eloc));
9369 Insert_Before (First (Statements (Handled_Statement_Sequence (
9370 Accept_Statement (Alt)))), Call);
9375 Make_Defining_Identifier (Eloc,
9376 New_External_Name (Chars (Ename), 'A', Num_Accept));
9378 if Comes_From_Source (Alt) then
9379 Set_Debug_Info_Needed (PB_Ent);
9383 Make_Subprogram_Body (Eloc,
9385 Make_Procedure_Specification (Eloc,
9386 Defining_Unit_Name => PB_Ent),
9387 Declarations => Declarations (Acc_Stm),
9388 Handled_Statement_Sequence =>
9389 Build_Accept_Body (Accept_Statement (Alt)));
9391 -- During the analysis of the body of the accept statement, any
9392 -- zero cost exception handler records were collected in the
9393 -- Accept_Handler_Records field of the N_Accept_Alternative node.
9394 -- This is where we move them to where they belong, namely the
9395 -- newly created procedure.
9397 Set_Handler_Records (PB_Ent, Accept_Handler_Records (Alt));
9398 Append (Proc_Body, Body_List);
9401 Null_Body := New_Reference_To (Standard_True, Eloc);
9403 -- if accept statement has declarations, insert above, given that
9404 -- we are not creating a body for the accept.
9406 if Present (Declarations (Acc_Stm)) then
9407 Insert_Actions (N, Declarations (Acc_Stm));
9411 Append_To (Accept_List,
9412 Make_Aggregate (Eloc, Expressions => New_List (Null_Body, Expr)));
9414 Num_Accept := Num_Accept + 1;
9417 ----------------------------
9418 -- Make_And_Declare_Label --
9419 ----------------------------
9421 function Make_And_Declare_Label (Num : Int) return Node_Id is
9425 Lab_Id := Make_Identifier (Loc, New_External_Name ('L', Num));
9427 Make_Label (Loc, Lab_Id);
9430 Make_Implicit_Label_Declaration (Loc,
9431 Defining_Identifier =>
9432 Make_Defining_Identifier (Loc, Chars (Lab_Id)),
9433 Label_Construct => Lab));
9436 end Make_And_Declare_Label;
9438 ----------------------
9439 -- Make_Select_Call --
9440 ----------------------
9442 function Make_Select_Call (Select_Mode : Entity_Id) return Node_Id is
9443 Params : constant List_Id := New_List;
9447 Make_Attribute_Reference (Loc,
9448 Prefix => New_Reference_To (Qnam, Loc),
9449 Attribute_Name => Name_Unchecked_Access),
9451 Append (Select_Mode, Params);
9452 Append (New_Reference_To (Ann, Loc), Params);
9453 Append (New_Reference_To (Xnam, Loc), Params);
9456 Make_Procedure_Call_Statement (Loc,
9457 Name => New_Reference_To (RTE (RE_Selective_Wait), Loc),
9458 Parameter_Associations => Params);
9459 end Make_Select_Call;
9461 --------------------------------
9462 -- Process_Accept_Alternative --
9463 --------------------------------
9465 procedure Process_Accept_Alternative
9470 Choices : List_Id := No_List;
9471 Alt_Stats : List_Id;
9474 Adjust_Condition (Condition (Alt));
9475 Alt_Stats := No_List;
9477 if Present (Handled_Statement_Sequence (Accept_Statement (Alt))) then
9478 Choices := New_List (
9479 Make_Integer_Literal (Loc, Index));
9481 Alt_Stats := New_List (
9482 Make_Procedure_Call_Statement (Sloc (Proc),
9483 Name => New_Reference_To (
9484 Defining_Unit_Name (Specification (Proc)), Sloc (Proc))));
9487 if Statements (Alt) /= Empty_List then
9489 if No (Alt_Stats) then
9491 -- Accept with no body, followed by trailing statements
9493 Choices := New_List (
9494 Make_Integer_Literal (Loc, Index));
9496 Alt_Stats := New_List;
9499 -- After the call, if any, branch to trailing statements. We
9500 -- create a label for each, as well as the corresponding label
9503 Lab := Make_And_Declare_Label (Index);
9504 Append_To (Alt_Stats,
9505 Make_Goto_Statement (Loc,
9506 Name => New_Copy (Identifier (Lab))));
9508 Append (Lab, Trailing_List);
9509 Append_List (Statements (Alt), Trailing_List);
9510 Append_To (Trailing_List,
9511 Make_Goto_Statement (Loc,
9512 Name => New_Copy (Identifier (End_Lab))));
9515 if Present (Alt_Stats) then
9517 -- Procedure call. and/or trailing statements
9519 Append_To (Alt_List,
9520 Make_Case_Statement_Alternative (Loc,
9521 Discrete_Choices => Choices,
9522 Statements => Alt_Stats));
9524 end Process_Accept_Alternative;
9526 -------------------------------
9527 -- Process_Delay_Alternative --
9528 -------------------------------
9530 procedure Process_Delay_Alternative (Alt : Node_Id; Index : Int) is
9533 Delay_Alt : List_Id;
9536 -- Deal with C/Fortran boolean as delay condition
9538 Adjust_Condition (Condition (Alt));
9540 -- Determine the smallest specified delay
9542 -- for each delay alternative generate:
9544 -- if guard-expression then
9545 -- Delay_Val := delay-expression;
9546 -- Guard_Open := True;
9547 -- if Delay_Val < Delay_Min then
9548 -- Delay_Min := Delay_Val;
9549 -- Delay_Index := Index;
9553 -- The enclosing if-statement is omitted if there is no guard
9558 First_Delay := False;
9560 Delay_Alt := New_List (
9561 Make_Assignment_Statement (Loc,
9562 Name => New_Reference_To (Delay_Min, Loc),
9563 Expression => Expression (Delay_Statement (Alt))));
9565 if Delay_Count > 1 then
9566 Append_To (Delay_Alt,
9567 Make_Assignment_Statement (Loc,
9568 Name => New_Reference_To (Delay_Index, Loc),
9569 Expression => Make_Integer_Literal (Loc, Index)));
9573 Delay_Alt := New_List (
9574 Make_Assignment_Statement (Loc,
9575 Name => New_Reference_To (Delay_Val, Loc),
9576 Expression => Expression (Delay_Statement (Alt))));
9578 if Time_Type = Standard_Duration then
9581 Left_Opnd => New_Reference_To (Delay_Val, Loc),
9582 Right_Opnd => New_Reference_To (Delay_Min, Loc));
9585 -- The scope of the time type must define a comparison
9586 -- operator. The scope itself may not be visible, so we
9587 -- construct a node with entity information to insure that
9588 -- semantic analysis can find the proper operator.
9591 Make_Function_Call (Loc,
9592 Name => Make_Selected_Component (Loc,
9593 Prefix => New_Reference_To (Scope (Time_Type), Loc),
9595 Make_Operator_Symbol (Loc,
9596 Chars => Name_Op_Lt,
9597 Strval => No_String)),
9598 Parameter_Associations =>
9600 New_Reference_To (Delay_Val, Loc),
9601 New_Reference_To (Delay_Min, Loc)));
9603 Set_Entity (Prefix (Name (Cond)), Scope (Time_Type));
9606 Append_To (Delay_Alt,
9607 Make_Implicit_If_Statement (N,
9609 Then_Statements => New_List (
9610 Make_Assignment_Statement (Loc,
9611 Name => New_Reference_To (Delay_Min, Loc),
9612 Expression => New_Reference_To (Delay_Val, Loc)),
9614 Make_Assignment_Statement (Loc,
9615 Name => New_Reference_To (Delay_Index, Loc),
9616 Expression => Make_Integer_Literal (Loc, Index)))));
9620 Append_To (Delay_Alt,
9621 Make_Assignment_Statement (Loc,
9622 Name => New_Reference_To (Guard_Open, Loc),
9623 Expression => New_Reference_To (Standard_True, Loc)));
9626 if Present (Condition (Alt)) then
9627 Delay_Alt := New_List (
9628 Make_Implicit_If_Statement (N,
9629 Condition => Condition (Alt),
9630 Then_Statements => Delay_Alt));
9633 Append_List (Delay_Alt, Delay_List);
9635 -- If the delay alternative has a statement part, add choice to the
9636 -- case statements for delays.
9638 if Present (Statements (Alt)) then
9640 if Delay_Count = 1 then
9641 Append_List (Statements (Alt), Delay_Alt_List);
9644 Choices := New_List (
9645 Make_Integer_Literal (Loc, Index));
9647 Append_To (Delay_Alt_List,
9648 Make_Case_Statement_Alternative (Loc,
9649 Discrete_Choices => Choices,
9650 Statements => Statements (Alt)));
9653 elsif Delay_Count = 1 then
9655 -- If the single delay has no trailing statements, add a branch
9656 -- to the exit label to the selective wait.
9658 Delay_Alt_List := New_List (
9659 Make_Goto_Statement (Loc,
9660 Name => New_Copy (Identifier (End_Lab))));
9663 end Process_Delay_Alternative;
9665 -- Start of processing for Expand_N_Selective_Accept
9668 Process_Statements_For_Controlled_Objects (N);
9670 -- First insert some declarations before the select. The first is:
9674 -- This variable holds the parameters passed to the accept body. This
9675 -- declaration has already been inserted by the time we get here by
9676 -- a call to Expand_Accept_Declarations made from the semantics when
9677 -- processing the first accept statement contained in the select. We
9678 -- can find this entity as Accept_Address (E), where E is any of the
9679 -- entries references by contained accept statements.
9681 -- The first step is to scan the list of Selective_Accept_Statements
9682 -- to find this entity, and also count the number of accepts, and
9683 -- determine if terminated, delay or else is present:
9687 Alt := First (Alts);
9688 while Present (Alt) loop
9689 Process_Statements_For_Controlled_Objects (Alt);
9691 if Nkind (Alt) = N_Accept_Alternative then
9694 elsif Nkind (Alt) = N_Delay_Alternative then
9695 Delay_Count := Delay_Count + 1;
9697 -- If the delays are relative delays, the delay expressions have
9698 -- type Standard_Duration. Otherwise they must have some time type
9699 -- recognized by GNAT.
9701 if Nkind (Delay_Statement (Alt)) = N_Delay_Relative_Statement then
9702 Time_Type := Standard_Duration;
9704 Time_Type := Etype (Expression (Delay_Statement (Alt)));
9706 if Is_RTE (Base_Type (Etype (Time_Type)), RO_CA_Time)
9707 or else Is_RTE (Base_Type (Etype (Time_Type)), RO_RT_Time)
9712 "& is not a time type (RM 9.6(6))",
9713 Expression (Delay_Statement (Alt)), Time_Type);
9714 Time_Type := Standard_Duration;
9715 Set_Etype (Expression (Delay_Statement (Alt)), Any_Type);
9719 if No (Condition (Alt)) then
9721 -- This guard will always be open
9723 Check_Guard := False;
9726 elsif Nkind (Alt) = N_Terminate_Alternative then
9727 Adjust_Condition (Condition (Alt));
9728 Terminate_Alt := Alt;
9731 Num_Alts := Num_Alts + 1;
9735 Else_Present := Present (Else_Statements (N));
9737 -- At the same time (see procedure Add_Accept) we build the accept list:
9739 -- Qnn : Accept_List (1 .. num-select) := (
9740 -- (null-body, entry-index),
9741 -- (null-body, entry-index),
9743 -- (null_body, entry-index));
9745 -- In the above declaration, null-body is True if the corresponding
9746 -- accept has no body, and false otherwise. The entry is either the
9747 -- entry index expression if there is no guard, or if a guard is
9748 -- present, then a conditional expression of the form:
9750 -- (if guard then entry-index else Null_Task_Entry)
9752 -- If a guard is statically known to be false, the entry can simply
9753 -- be omitted from the accept list.
9756 Make_Object_Declaration (Loc,
9757 Defining_Identifier => Qnam,
9758 Object_Definition =>
9759 New_Reference_To (RTE (RE_Accept_List), Loc),
9760 Aliased_Present => True,
9763 Make_Qualified_Expression (Loc,
9765 New_Reference_To (RTE (RE_Accept_List), Loc),
9767 Make_Aggregate (Loc, Expressions => Accept_List)));
9771 -- Then we declare the variable that holds the index for the accept
9772 -- that will be selected for service:
9774 -- Xnn : Select_Index;
9777 Make_Object_Declaration (Loc,
9778 Defining_Identifier => Xnam,
9779 Object_Definition =>
9780 New_Reference_To (RTE (RE_Select_Index), Loc),
9782 New_Reference_To (RTE (RE_No_Rendezvous), Loc));
9786 -- After this follow procedure declarations for each accept body
9793 -- where the ... are statements from the corresponding procedure body.
9794 -- No parameters are involved, since the parameters are passed via Ann
9795 -- and the parameter references have already been expanded to be direct
9796 -- references to Ann (see Exp_Ch2.Expand_Entry_Parameter). Furthermore,
9797 -- any embedded tasking statements (which would normally be illegal in
9798 -- procedures), have been converted to calls to the tasking runtime so
9799 -- there is no problem in putting them into procedures.
9801 -- The original accept statement has been expanded into a block in
9802 -- the same fashion as for simple accepts (see Build_Accept_Body).
9804 -- Note: we don't really need to build these procedures for the case
9805 -- where no delay statement is present, but it is just as easy to
9806 -- build them unconditionally, and not significantly inefficient,
9807 -- since if they are short they will be inlined anyway.
9809 -- The procedure declarations have been assembled in Body_List
9811 -- If delays are present, we must compute the required delay.
9812 -- We first generate the declarations:
9814 -- Delay_Index : Boolean := 0;
9815 -- Delay_Min : Some_Time_Type.Time;
9816 -- Delay_Val : Some_Time_Type.Time;
9818 -- Delay_Index will be set to the index of the minimum delay, i.e. the
9819 -- active delay that is actually chosen as the basis for the possible
9820 -- delay if an immediate rendez-vous is not possible.
9822 -- In the most common case there is a single delay statement, and this
9823 -- is handled specially.
9825 if Delay_Count > 0 then
9827 -- Generate the required declarations
9830 Make_Defining_Identifier (Loc, New_External_Name ('D', 1));
9832 Make_Defining_Identifier (Loc, New_External_Name ('D', 2));
9834 Make_Defining_Identifier (Loc, New_External_Name ('D', 3));
9837 Make_Object_Declaration (Loc,
9838 Defining_Identifier => Delay_Val,
9839 Object_Definition => New_Reference_To (Time_Type, Loc)));
9842 Make_Object_Declaration (Loc,
9843 Defining_Identifier => Delay_Index,
9844 Object_Definition => New_Reference_To (Standard_Integer, Loc),
9845 Expression => Make_Integer_Literal (Loc, 0)));
9848 Make_Object_Declaration (Loc,
9849 Defining_Identifier => Delay_Min,
9850 Object_Definition => New_Reference_To (Time_Type, Loc),
9852 Unchecked_Convert_To (Time_Type,
9853 Make_Attribute_Reference (Loc,
9855 New_Occurrence_Of (Underlying_Type (Time_Type), Loc),
9856 Attribute_Name => Name_Last))));
9858 -- Create Duration and Delay_Mode objects used for passing a delay
9861 D := Make_Temporary (Loc, 'D');
9862 M := Make_Temporary (Loc, 'M');
9868 -- Note that these values are defined in s-osprim.ads and must
9871 -- Relative : constant := 0;
9872 -- Absolute_Calendar : constant := 1;
9873 -- Absolute_RT : constant := 2;
9875 if Time_Type = Standard_Duration then
9876 Discr := Make_Integer_Literal (Loc, 0);
9878 elsif Is_RTE (Base_Type (Etype (Time_Type)), RO_CA_Time) then
9879 Discr := Make_Integer_Literal (Loc, 1);
9883 (Is_RTE (Base_Type (Etype (Time_Type)), RO_RT_Time));
9884 Discr := Make_Integer_Literal (Loc, 2);
9888 Make_Object_Declaration (Loc,
9889 Defining_Identifier => D,
9890 Object_Definition =>
9891 New_Reference_To (Standard_Duration, Loc)));
9894 Make_Object_Declaration (Loc,
9895 Defining_Identifier => M,
9896 Object_Definition =>
9897 New_Reference_To (Standard_Integer, Loc),
9898 Expression => Discr));
9903 Make_Defining_Identifier (Loc, New_External_Name ('G', 1));
9906 Make_Object_Declaration (Loc,
9907 Defining_Identifier => Guard_Open,
9908 Object_Definition => New_Reference_To (Standard_Boolean, Loc),
9909 Expression => New_Reference_To (Standard_False, Loc)));
9912 -- Delay_Count is zero, don't need M and D set (suppress warning)
9919 if Present (Terminate_Alt) then
9921 -- If the terminate alternative guard is False, use
9922 -- Simple_Mode; otherwise use Terminate_Mode.
9924 if Present (Condition (Terminate_Alt)) then
9925 Select_Mode := Make_Conditional_Expression (Loc,
9926 New_List (Condition (Terminate_Alt),
9927 New_Reference_To (RTE (RE_Terminate_Mode), Loc),
9928 New_Reference_To (RTE (RE_Simple_Mode), Loc)));
9930 Select_Mode := New_Reference_To (RTE (RE_Terminate_Mode), Loc);
9933 elsif Else_Present or Delay_Count > 0 then
9934 Select_Mode := New_Reference_To (RTE (RE_Else_Mode), Loc);
9937 Select_Mode := New_Reference_To (RTE (RE_Simple_Mode), Loc);
9940 Select_Call := Make_Select_Call (Select_Mode);
9941 Append (Select_Call, Stats);
9943 -- Now generate code to act on the result. There is an entry
9944 -- in this case for each accept statement with a non-null body,
9945 -- followed by a branch to the statements that follow the Accept.
9946 -- In the absence of delay alternatives, we generate:
9949 -- when No_Rendezvous => -- omitted if simple mode
9964 -- Lab0: Else_Statements;
9967 -- Lab1: Trailing_Statements1;
9970 -- Lab2: Trailing_Statements2;
9975 -- Generate label for common exit
9977 End_Lab := Make_And_Declare_Label (Num_Alts + 1);
9979 -- First entry is the default case, when no rendezvous is possible
9981 Choices := New_List (New_Reference_To (RTE (RE_No_Rendezvous), Loc));
9983 if Else_Present then
9985 -- If no rendezvous is possible, the else part is executed
9987 Lab := Make_And_Declare_Label (0);
9988 Alt_Stats := New_List (
9989 Make_Goto_Statement (Loc,
9990 Name => New_Copy (Identifier (Lab))));
9992 Append (Lab, Trailing_List);
9993 Append_List (Else_Statements (N), Trailing_List);
9994 Append_To (Trailing_List,
9995 Make_Goto_Statement (Loc,
9996 Name => New_Copy (Identifier (End_Lab))));
9998 Alt_Stats := New_List (
9999 Make_Goto_Statement (Loc,
10000 Name => New_Copy (Identifier (End_Lab))));
10003 Append_To (Alt_List,
10004 Make_Case_Statement_Alternative (Loc,
10005 Discrete_Choices => Choices,
10006 Statements => Alt_Stats));
10008 -- We make use of the fact that Accept_Index is an integer type, and
10009 -- generate successive literals for entries for each accept. Only those
10010 -- for which there is a body or trailing statements get a case entry.
10012 Alt := First (Select_Alternatives (N));
10013 Proc := First (Body_List);
10014 while Present (Alt) loop
10016 if Nkind (Alt) = N_Accept_Alternative then
10017 Process_Accept_Alternative (Alt, Index, Proc);
10018 Index := Index + 1;
10021 (Handled_Statement_Sequence (Accept_Statement (Alt)))
10026 elsif Nkind (Alt) = N_Delay_Alternative then
10027 Process_Delay_Alternative (Alt, Delay_Num);
10028 Delay_Num := Delay_Num + 1;
10034 -- An others choice is always added to the main case, as well
10035 -- as the delay case (to satisfy the compiler).
10037 Append_To (Alt_List,
10038 Make_Case_Statement_Alternative (Loc,
10039 Discrete_Choices =>
10040 New_List (Make_Others_Choice (Loc)),
10042 New_List (Make_Goto_Statement (Loc,
10043 Name => New_Copy (Identifier (End_Lab))))));
10045 Accept_Case := New_List (
10046 Make_Case_Statement (Loc,
10047 Expression => New_Reference_To (Xnam, Loc),
10048 Alternatives => Alt_List));
10050 Append_List (Trailing_List, Accept_Case);
10051 Append (End_Lab, Accept_Case);
10052 Append_List (Body_List, Decls);
10054 -- Construct case statement for trailing statements of delay
10055 -- alternatives, if there are several of them.
10057 if Delay_Count > 1 then
10058 Append_To (Delay_Alt_List,
10059 Make_Case_Statement_Alternative (Loc,
10060 Discrete_Choices =>
10061 New_List (Make_Others_Choice (Loc)),
10063 New_List (Make_Null_Statement (Loc))));
10065 Delay_Case := New_List (
10066 Make_Case_Statement (Loc,
10067 Expression => New_Reference_To (Delay_Index, Loc),
10068 Alternatives => Delay_Alt_List));
10070 Delay_Case := Delay_Alt_List;
10073 -- If there are no delay alternatives, we append the case statement
10074 -- to the statement list.
10076 if Delay_Count = 0 then
10077 Append_List (Accept_Case, Stats);
10079 -- Delay alternatives present
10082 -- If delay alternatives are present we generate:
10084 -- find minimum delay.
10085 -- DX := minimum delay;
10086 -- M := <delay mode>;
10087 -- Timed_Selective_Wait (Q'Unchecked_Access, Delay_Mode, P,
10090 -- if X = No_Rendezvous then
10091 -- case statement for delay statements.
10093 -- case statement for accept alternatives.
10104 -- The type of the delay expression is known to be legal
10106 if Time_Type = Standard_Duration then
10107 Conv := New_Reference_To (Delay_Min, Loc);
10109 elsif Is_RTE (Base_Type (Etype (Time_Type)), RO_CA_Time) then
10110 Conv := Make_Function_Call (Loc,
10111 New_Reference_To (RTE (RO_CA_To_Duration), Loc),
10112 New_List (New_Reference_To (Delay_Min, Loc)));
10116 (Is_RTE (Base_Type (Etype (Time_Type)), RO_RT_Time));
10118 Conv := Make_Function_Call (Loc,
10119 New_Reference_To (RTE (RO_RT_To_Duration), Loc),
10120 New_List (New_Reference_To (Delay_Min, Loc)));
10123 Stmt := Make_Assignment_Statement (Loc,
10124 Name => New_Reference_To (D, Loc),
10125 Expression => Conv);
10127 -- Change the value for Accept_Modes. (Else_Mode -> Delay_Mode)
10129 Parms := Parameter_Associations (Select_Call);
10130 Parm := First (Parms);
10132 while Present (Parm)
10133 and then Parm /= Select_Mode
10138 pragma Assert (Present (Parm));
10139 Rewrite (Parm, New_Reference_To (RTE (RE_Delay_Mode), Loc));
10142 -- Prepare two new parameters of Duration and Delay_Mode type
10143 -- which represent the value and the mode of the minimum delay.
10146 Insert_After (Parm, New_Reference_To (M, Loc));
10147 Insert_After (Parm, New_Reference_To (D, Loc));
10149 -- Create a call to RTS
10151 Rewrite (Select_Call,
10152 Make_Procedure_Call_Statement (Loc,
10153 Name => New_Reference_To (RTE (RE_Timed_Selective_Wait), Loc),
10154 Parameter_Associations => Parms));
10156 -- This new call should follow the calculation of the minimum
10159 Insert_List_Before (Select_Call, Delay_List);
10161 if Check_Guard then
10163 Make_Implicit_If_Statement (N,
10164 Condition => New_Reference_To (Guard_Open, Loc),
10166 New_List (New_Copy_Tree (Stmt),
10167 New_Copy_Tree (Select_Call)),
10168 Else_Statements => Accept_Or_Raise);
10169 Rewrite (Select_Call, Stmt);
10171 Insert_Before (Select_Call, Stmt);
10175 Make_Implicit_If_Statement (N,
10176 Condition => Make_Op_Eq (Loc,
10177 Left_Opnd => New_Reference_To (Xnam, Loc),
10179 New_Reference_To (RTE (RE_No_Rendezvous), Loc)),
10181 Then_Statements => Delay_Case,
10182 Else_Statements => Accept_Case);
10184 Append (Cases, Stats);
10188 -- Replace accept statement with appropriate block
10191 Make_Block_Statement (Loc,
10192 Declarations => Decls,
10193 Handled_Statement_Sequence =>
10194 Make_Handled_Sequence_Of_Statements (Loc,
10195 Statements => Stats));
10197 Rewrite (N, Block);
10200 -- Note: have to worry more about abort deferral in above code ???
10202 -- Final step is to unstack the Accept_Address entries for all accept
10203 -- statements appearing in accept alternatives in the select statement
10205 Alt := First (Alts);
10206 while Present (Alt) loop
10207 if Nkind (Alt) = N_Accept_Alternative then
10208 Remove_Last_Elmt (Accept_Address
10209 (Entity (Entry_Direct_Name (Accept_Statement (Alt)))));
10214 end Expand_N_Selective_Accept;
10216 --------------------------------------
10217 -- Expand_N_Single_Task_Declaration --
10218 --------------------------------------
10220 -- Single task declarations should never be present after semantic
10221 -- analysis, since we expect them to be replaced by a declaration of an
10222 -- anonymous task type, followed by a declaration of the task object. We
10223 -- include this routine to make sure that is happening!
10225 procedure Expand_N_Single_Task_Declaration (N : Node_Id) is
10227 raise Program_Error;
10228 end Expand_N_Single_Task_Declaration;
10230 ------------------------
10231 -- Expand_N_Task_Body --
10232 ------------------------
10234 -- Given a task body
10236 -- task body tname is
10242 -- This expansion routine converts it into a procedure and sets the
10243 -- elaboration flag for the procedure to true, to represent the fact
10244 -- that the task body is now elaborated:
10246 -- procedure tnameB (_Task : access tnameV) is
10247 -- discriminal : dtype renames _Task.discriminant;
10249 -- procedure _clean is
10251 -- Abort_Defer.all;
10253 -- Abort_Undefer.all;
10258 -- Abort_Undefer.all;
10260 -- System.Task_Stages.Complete_Activation;
10268 -- In addition, if the task body is an activator, then a call to activate
10269 -- tasks is added at the start of the statements, before the call to
10270 -- Complete_Activation, and if in addition the task is a master then it
10271 -- must be established as a master. These calls are inserted and analyzed
10272 -- in Expand_Cleanup_Actions, when the Handled_Sequence_Of_Statements is
10275 -- There is one discriminal declaration line generated for each
10276 -- discriminant that is present to provide an easy reference point for
10277 -- discriminant references inside the body (see Exp_Ch2.Expand_Name).
10279 -- Note on relationship to GNARLI definition. In the GNARLI definition,
10280 -- task body procedures have a profile (Arg : System.Address). That is
10281 -- needed because GNARLI has to use the same access-to-subprogram type
10282 -- for all task types. We depend here on knowing that in GNAT, passing
10283 -- an address argument by value is identical to passing a record value
10284 -- by access (in either case a single pointer is passed), so even though
10285 -- this procedure has the wrong profile. In fact it's all OK, since the
10286 -- callings sequence is identical.
10288 procedure Expand_N_Task_Body (N : Node_Id) is
10289 Loc : constant Source_Ptr := Sloc (N);
10290 Ttyp : constant Entity_Id := Corresponding_Spec (N);
10294 Insert_Nod : Node_Id;
10295 -- Used to determine the proper location of wrapper body insertions
10298 -- Add renaming declarations for discriminals and a declaration for the
10299 -- entry family index (if applicable).
10301 Install_Private_Data_Declarations
10302 (Loc, Task_Body_Procedure (Ttyp), Ttyp, N, Declarations (N));
10304 -- Add a call to Abort_Undefer at the very beginning of the task
10305 -- body since this body is called with abort still deferred.
10307 if Abort_Allowed then
10308 Call := Build_Runtime_Call (Loc, RE_Abort_Undefer);
10310 (First (Statements (Handled_Statement_Sequence (N))), Call);
10314 -- The statement part has already been protected with an at_end and
10315 -- cleanup actions. The call to Complete_Activation must be placed
10316 -- at the head of the sequence of statements of that block. The
10317 -- declarations have been merged in this sequence of statements but
10318 -- the first real statement is accessible from the First_Real_Statement
10319 -- field (which was set for exactly this purpose).
10321 if Restricted_Profile then
10322 Call := Build_Runtime_Call (Loc, RE_Complete_Restricted_Activation);
10324 Call := Build_Runtime_Call (Loc, RE_Complete_Activation);
10328 (First_Real_Statement (Handled_Statement_Sequence (N)), Call);
10332 Make_Subprogram_Body (Loc,
10333 Specification => Build_Task_Proc_Specification (Ttyp),
10334 Declarations => Declarations (N),
10335 Handled_Statement_Sequence => Handled_Statement_Sequence (N));
10337 -- If the task contains generic instantiations, cleanup actions are
10338 -- delayed until after instantiation. Transfer the activation chain to
10339 -- the subprogram, to insure that the activation call is properly
10340 -- generated. It the task body contains inner tasks, indicate that the
10341 -- subprogram is a task master.
10343 if Delay_Cleanups (Ttyp) then
10344 Set_Activation_Chain_Entity (New_N, Activation_Chain_Entity (N));
10345 Set_Is_Task_Master (New_N, Is_Task_Master (N));
10348 Rewrite (N, New_N);
10351 -- Set elaboration flag immediately after task body. If the body is a
10352 -- subunit, the flag is set in the declarative part containing the stub.
10354 if Nkind (Parent (N)) /= N_Subunit then
10356 Make_Assignment_Statement (Loc,
10358 Make_Identifier (Loc, New_External_Name (Chars (Ttyp), 'E')),
10359 Expression => New_Reference_To (Standard_True, Loc)));
10362 -- Ada 2005 (AI-345): Construct the primitive entry wrapper bodies after
10363 -- the task body. At this point all wrapper specs have been created,
10364 -- frozen and included in the dispatch table for the task type.
10366 if Ada_Version >= Ada_2005 then
10367 if Nkind (Parent (N)) = N_Subunit then
10368 Insert_Nod := Corresponding_Stub (Parent (N));
10373 Build_Wrapper_Bodies (Loc, Ttyp, Insert_Nod);
10375 end Expand_N_Task_Body;
10377 ------------------------------------
10378 -- Expand_N_Task_Type_Declaration --
10379 ------------------------------------
10381 -- We have several things to do. First we must create a Boolean flag used
10382 -- to mark if the body is elaborated yet. This variable gets set to True
10383 -- when the body of the task is elaborated (we can't rely on the normal
10384 -- ABE mechanism for the task body, since we need to pass an access to
10385 -- this elaboration boolean to the runtime routines).
10387 -- taskE : aliased Boolean := False;
10389 -- Next a variable is declared to hold the task stack size (either the
10390 -- default : Unspecified_Size, or a value that is set by a pragma
10391 -- Storage_Size). If the value of the pragma Storage_Size is static, then
10392 -- the variable is initialized with this value:
10394 -- taskZ : Size_Type := Unspecified_Size;
10396 -- taskZ : Size_Type := Size_Type (size_expression);
10398 -- Note: No variable is needed to hold the task relative deadline since
10399 -- its value would never be static because the parameter is of a private
10400 -- type (Ada.Real_Time.Time_Span).
10402 -- Next we create a corresponding record type declaration used to represent
10403 -- values of this task. The general form of this type declaration is
10405 -- type taskV (discriminants) is record
10406 -- _Task_Id : Task_Id;
10407 -- entry_family : array (bounds) of Void;
10408 -- _Priority : Integer := priority_expression;
10409 -- _Size : Size_Type := Size_Type (size_expression);
10410 -- _Task_Info : Task_Info_Type := task_info_expression;
10411 -- _CPU : Integer := cpu_range_expression;
10414 -- The discriminants are present only if the corresponding task type has
10415 -- discriminants, and they exactly mirror the task type discriminants.
10417 -- The Id field is always present. It contains the Task_Id value, as set by
10418 -- the call to Create_Task. Note that although the task is limited, the
10419 -- task value record type is not limited, so there is no problem in passing
10420 -- this field as an out parameter to Create_Task.
10422 -- One entry_family component is present for each entry family in the task
10423 -- definition. The bounds correspond to the bounds of the entry family
10424 -- (which may depend on discriminants). The element type is void, since we
10425 -- only need the bounds information for determining the entry index. Note
10426 -- that the use of an anonymous array would normally be illegal in this
10427 -- context, but this is a parser check, and the semantics is quite prepared
10428 -- to handle such a case.
10430 -- The _Size field is present only if a Storage_Size pragma appears in the
10431 -- task definition. The expression captures the argument that was present
10432 -- in the pragma, and is used to override the task stack size otherwise
10433 -- associated with the task type.
10435 -- The _Priority field is present only if a Priority or Interrupt_Priority
10436 -- pragma appears in the task definition. The expression captures the
10437 -- argument that was present in the pragma, and is used to provide the Size
10438 -- parameter to the call to Create_Task.
10440 -- The _Task_Info field is present only if a Task_Info pragma appears in
10441 -- the task definition. The expression captures the argument that was
10442 -- present in the pragma, and is used to provide the Task_Image parameter
10443 -- to the call to Create_Task.
10445 -- The _CPU field is present only if a CPU pragma appears in the task
10446 -- definition. The expression captures the argument that was present in
10447 -- the pragma, and is used to provide the CPU parameter to the call to
10450 -- The _Relative_Deadline field is present only if a Relative_Deadline
10451 -- pragma appears in the task definition. The expression captures the
10452 -- argument that was present in the pragma, and is used to provide the
10453 -- Relative_Deadline parameter to the call to Create_Task.
10455 -- When a task is declared, an instance of the task value record is
10456 -- created. The elaboration of this declaration creates the correct bounds
10457 -- for the entry families, and also evaluates the size, priority, and
10458 -- task_Info expressions if needed. The initialization routine for the task
10459 -- type itself then calls Create_Task with appropriate parameters to
10460 -- initialize the value of the Task_Id field.
10462 -- Note: the address of this record is passed as the "Discriminants"
10463 -- parameter for Create_Task. Since Create_Task merely passes this onto the
10464 -- body procedure, it does not matter that it does not quite match the
10465 -- GNARLI model of what is being passed (the record contains more than just
10466 -- the discriminants, but the discriminants can be found from the record
10469 -- The Entity_Id for this created record type is placed in the
10470 -- Corresponding_Record_Type field of the associated task type entity.
10472 -- Next we create a procedure specification for the task body procedure:
10474 -- procedure taskB (_Task : access taskV);
10476 -- Note that this must come after the record type declaration, since
10477 -- the spec refers to this type. It turns out that the initialization
10478 -- procedure for the value type references the task body spec, but that's
10479 -- fine, since it won't be generated till the freeze point for the type,
10480 -- which is certainly after the task body spec declaration.
10482 -- Finally, we set the task index value field of the entry attribute in
10483 -- the case of a simple entry.
10485 procedure Expand_N_Task_Type_Declaration (N : Node_Id) is
10486 Loc : constant Source_Ptr := Sloc (N);
10487 Tasktyp : constant Entity_Id := Etype (Defining_Identifier (N));
10488 Tasknm : constant Name_Id := Chars (Tasktyp);
10489 Taskdef : constant Node_Id := Task_Definition (N);
10491 Proc_Spec : Node_Id;
10492 Rec_Decl : Node_Id;
10493 Rec_Ent : Entity_Id;
10495 Elab_Decl : Node_Id;
10496 Size_Decl : Node_Id;
10497 Body_Decl : Node_Id;
10498 Task_Size : Node_Id;
10499 Ent_Stack : Entity_Id;
10500 Decl_Stack : Node_Id;
10503 -- If already expanded, nothing to do
10505 if Present (Corresponding_Record_Type (Tasktyp)) then
10509 -- Here we will do the expansion
10511 Rec_Decl := Build_Corresponding_Record (N, Tasktyp, Loc);
10513 Rec_Ent := Defining_Identifier (Rec_Decl);
10514 Cdecls := Component_Items (Component_List
10515 (Type_Definition (Rec_Decl)));
10517 Qualify_Entity_Names (N);
10519 -- First create the elaboration variable
10522 Make_Object_Declaration (Loc,
10523 Defining_Identifier =>
10524 Make_Defining_Identifier (Sloc (Tasktyp),
10525 Chars => New_External_Name (Tasknm, 'E')),
10526 Aliased_Present => True,
10527 Object_Definition => New_Reference_To (Standard_Boolean, Loc),
10528 Expression => New_Reference_To (Standard_False, Loc));
10529 Insert_After (N, Elab_Decl);
10531 -- Next create the declaration of the size variable (tasknmZ)
10533 Set_Storage_Size_Variable (Tasktyp,
10534 Make_Defining_Identifier (Sloc (Tasktyp),
10535 Chars => New_External_Name (Tasknm, 'Z')));
10537 if Present (Taskdef) and then Has_Storage_Size_Pragma (Taskdef) and then
10538 Is_Static_Expression (Expression (First (
10539 Pragma_Argument_Associations (Find_Task_Or_Protected_Pragma (
10540 Taskdef, Name_Storage_Size)))))
10543 Make_Object_Declaration (Loc,
10544 Defining_Identifier => Storage_Size_Variable (Tasktyp),
10545 Object_Definition => New_Reference_To (RTE (RE_Size_Type), Loc),
10547 Convert_To (RTE (RE_Size_Type),
10549 Expression (First (
10550 Pragma_Argument_Associations (
10551 Find_Task_Or_Protected_Pragma
10552 (Taskdef, Name_Storage_Size)))))));
10556 Make_Object_Declaration (Loc,
10557 Defining_Identifier => Storage_Size_Variable (Tasktyp),
10558 Object_Definition => New_Reference_To (RTE (RE_Size_Type), Loc),
10559 Expression => New_Reference_To (RTE (RE_Unspecified_Size), Loc));
10562 Insert_After (Elab_Decl, Size_Decl);
10564 -- Next build the rest of the corresponding record declaration. This is
10565 -- done last, since the corresponding record initialization procedure
10566 -- will reference the previously created entities.
10568 -- Fill in the component declarations -- first the _Task_Id field
10571 Make_Component_Declaration (Loc,
10572 Defining_Identifier =>
10573 Make_Defining_Identifier (Loc, Name_uTask_Id),
10574 Component_Definition =>
10575 Make_Component_Definition (Loc,
10576 Aliased_Present => False,
10577 Subtype_Indication => New_Reference_To (RTE (RO_ST_Task_Id),
10580 -- Declare static ATCB (that is, created by the expander) if we are
10581 -- using the Restricted run time.
10583 if Restricted_Profile then
10585 Make_Component_Declaration (Loc,
10586 Defining_Identifier =>
10587 Make_Defining_Identifier (Loc, Name_uATCB),
10589 Component_Definition =>
10590 Make_Component_Definition (Loc,
10591 Aliased_Present => True,
10592 Subtype_Indication => Make_Subtype_Indication (Loc,
10593 Subtype_Mark => New_Occurrence_Of
10594 (RTE (RE_Ada_Task_Control_Block), Loc),
10597 Make_Index_Or_Discriminant_Constraint (Loc,
10599 New_List (Make_Integer_Literal (Loc, 0)))))));
10603 -- Declare static stack (that is, created by the expander) if we are
10604 -- using the Restricted run time on a bare board configuration.
10606 if Restricted_Profile
10607 and then Preallocated_Stacks_On_Target
10609 -- First we need to extract the appropriate stack size
10611 Ent_Stack := Make_Defining_Identifier (Loc, Name_uStack);
10613 if Present (Taskdef) and then Has_Storage_Size_Pragma (Taskdef) then
10615 Expr_N : constant Node_Id :=
10616 Expression (First (
10617 Pragma_Argument_Associations (
10618 Find_Task_Or_Protected_Pragma
10619 (Taskdef, Name_Storage_Size))));
10620 Etyp : constant Entity_Id := Etype (Expr_N);
10621 P : constant Node_Id := Parent (Expr_N);
10624 -- The stack is defined inside the corresponding record.
10625 -- Therefore if the size of the stack is set by means of
10626 -- a discriminant, we must reference the discriminant of the
10627 -- corresponding record type.
10629 if Nkind (Expr_N) in N_Has_Entity
10630 and then Present (Discriminal_Link (Entity (Expr_N)))
10634 (CR_Discriminant (Discriminal_Link (Entity (Expr_N))),
10636 Set_Parent (Task_Size, P);
10637 Set_Etype (Task_Size, Etyp);
10638 Set_Analyzed (Task_Size);
10641 Task_Size := Relocate_Node (Expr_N);
10647 New_Reference_To (RTE (RE_Default_Stack_Size), Loc);
10650 Decl_Stack := Make_Component_Declaration (Loc,
10651 Defining_Identifier => Ent_Stack,
10653 Component_Definition =>
10654 Make_Component_Definition (Loc,
10655 Aliased_Present => True,
10656 Subtype_Indication => Make_Subtype_Indication (Loc,
10658 New_Occurrence_Of (RTE (RE_Storage_Array), Loc),
10661 Make_Index_Or_Discriminant_Constraint (Loc,
10662 Constraints => New_List (Make_Range (Loc,
10663 Low_Bound => Make_Integer_Literal (Loc, 1),
10664 High_Bound => Convert_To (RTE (RE_Storage_Offset),
10667 Append_To (Cdecls, Decl_Stack);
10669 -- The appropriate alignment for the stack is ensured by the run-time
10670 -- code in charge of task creation.
10674 -- Add components for entry families
10676 Collect_Entry_Families (Loc, Cdecls, Size_Decl, Tasktyp);
10678 -- Add the _Priority component if a Priority pragma is present
10680 if Present (Taskdef) and then Has_Pragma_Priority (Taskdef) then
10682 Prag : constant Node_Id :=
10683 Find_Task_Or_Protected_Pragma (Taskdef, Name_Priority);
10687 Expr := First (Pragma_Argument_Associations (Prag));
10689 if Nkind (Expr) = N_Pragma_Argument_Association then
10690 Expr := Expression (Expr);
10693 Expr := New_Copy_Tree (Expr);
10695 -- Add conversion to proper type to do range check if required
10696 -- Note that for runtime units, we allow out of range interrupt
10697 -- priority values to be used in a priority pragma. This is for
10698 -- the benefit of some versions of System.Interrupts which use
10699 -- a special server task with maximum interrupt priority.
10701 if Pragma_Name (Prag) = Name_Priority
10702 and then not GNAT_Mode
10704 Rewrite (Expr, Convert_To (RTE (RE_Priority), Expr));
10706 Rewrite (Expr, Convert_To (RTE (RE_Any_Priority), Expr));
10710 Make_Component_Declaration (Loc,
10711 Defining_Identifier =>
10712 Make_Defining_Identifier (Loc, Name_uPriority),
10713 Component_Definition =>
10714 Make_Component_Definition (Loc,
10715 Aliased_Present => False,
10716 Subtype_Indication => New_Reference_To (Standard_Integer,
10718 Expression => Expr));
10722 -- Add the _Task_Size component if a Storage_Size pragma is present
10724 if Present (Taskdef)
10725 and then Has_Storage_Size_Pragma (Taskdef)
10728 Make_Component_Declaration (Loc,
10729 Defining_Identifier =>
10730 Make_Defining_Identifier (Loc, Name_uSize),
10732 Component_Definition =>
10733 Make_Component_Definition (Loc,
10734 Aliased_Present => False,
10735 Subtype_Indication => New_Reference_To (RTE (RE_Size_Type),
10739 Convert_To (RTE (RE_Size_Type),
10741 Expression (First (
10742 Pragma_Argument_Associations (
10743 Find_Task_Or_Protected_Pragma
10744 (Taskdef, Name_Storage_Size))))))));
10747 -- Add the _Task_Info component if a Task_Info pragma is present
10749 if Present (Taskdef) and then Has_Task_Info_Pragma (Taskdef) then
10751 Make_Component_Declaration (Loc,
10752 Defining_Identifier =>
10753 Make_Defining_Identifier (Loc, Name_uTask_Info),
10755 Component_Definition =>
10756 Make_Component_Definition (Loc,
10757 Aliased_Present => False,
10758 Subtype_Indication =>
10759 New_Reference_To (RTE (RE_Task_Info_Type), Loc)),
10761 Expression => New_Copy (
10762 Expression (First (
10763 Pragma_Argument_Associations (
10764 Find_Task_Or_Protected_Pragma
10765 (Taskdef, Name_Task_Info)))))));
10768 -- Add the _CPU component if a CPU pragma is present
10770 if Present (Taskdef) and then Has_Pragma_CPU (Taskdef) then
10772 Make_Component_Declaration (Loc,
10773 Defining_Identifier =>
10774 Make_Defining_Identifier (Loc, Name_uCPU),
10776 Component_Definition =>
10777 Make_Component_Definition (Loc,
10778 Aliased_Present => False,
10779 Subtype_Indication =>
10780 New_Reference_To (RTE (RE_CPU_Range), Loc)),
10782 Expression => New_Copy (
10783 Expression (First (
10784 Pragma_Argument_Associations (
10785 Find_Task_Or_Protected_Pragma
10786 (Taskdef, Name_CPU)))))));
10789 -- Add the _Relative_Deadline component if a Relative_Deadline pragma is
10790 -- present. If we are using a restricted run time this component will
10791 -- not be added (deadlines are not allowed by the Ravenscar profile).
10793 if not Restricted_Profile
10794 and then Present (Taskdef)
10795 and then Has_Relative_Deadline_Pragma (Taskdef)
10798 Make_Component_Declaration (Loc,
10799 Defining_Identifier =>
10800 Make_Defining_Identifier (Loc, Name_uRelative_Deadline),
10802 Component_Definition =>
10803 Make_Component_Definition (Loc,
10804 Aliased_Present => False,
10805 Subtype_Indication =>
10806 New_Reference_To (RTE (RE_Time_Span), Loc)),
10809 Convert_To (RTE (RE_Time_Span),
10811 Expression (First (
10812 Pragma_Argument_Associations (
10813 Find_Task_Or_Protected_Pragma
10814 (Taskdef, Name_Relative_Deadline))))))));
10817 Insert_After (Size_Decl, Rec_Decl);
10819 -- Analyze the record declaration immediately after construction,
10820 -- because the initialization procedure is needed for single task
10821 -- declarations before the next entity is analyzed.
10823 Analyze (Rec_Decl);
10825 -- Create the declaration of the task body procedure
10827 Proc_Spec := Build_Task_Proc_Specification (Tasktyp);
10829 Make_Subprogram_Declaration (Loc,
10830 Specification => Proc_Spec);
10832 Insert_After (Rec_Decl, Body_Decl);
10834 -- The subprogram does not comes from source, so we have to indicate the
10835 -- need for debugging information explicitly.
10837 if Comes_From_Source (Original_Node (N)) then
10838 Set_Debug_Info_Needed (Defining_Entity (Proc_Spec));
10841 -- Ada 2005 (AI-345): Construct the primitive entry wrapper specs before
10842 -- the corresponding record has been frozen.
10844 if Ada_Version >= Ada_2005 then
10845 Build_Wrapper_Specs (Loc, Tasktyp, Rec_Decl);
10848 -- Ada 2005 (AI-345): We must defer freezing to allow further
10849 -- declaration of primitive subprograms covering task interfaces
10851 if Ada_Version <= Ada_95 then
10853 -- Now we can freeze the corresponding record. This needs manually
10854 -- freezing, since it is really part of the task type, and the task
10855 -- type is frozen at this stage. We of course need the initialization
10856 -- procedure for this corresponding record type and we won't get it
10857 -- in time if we don't freeze now.
10860 L : constant List_Id := Freeze_Entity (Rec_Ent, N);
10862 if Is_Non_Empty_List (L) then
10863 Insert_List_After (Body_Decl, L);
10868 -- Complete the expansion of access types to the current task type, if
10869 -- any were declared.
10871 Expand_Previous_Access_Type (Tasktyp);
10873 -- Create wrappers for entries that have pre/postconditions
10879 Ent := First_Entity (Tasktyp);
10880 while Present (Ent) loop
10881 if Ekind_In (Ent, E_Entry, E_Entry_Family)
10882 and then Present (Spec_PPC_List (Contract (Ent)))
10884 Build_PPC_Wrapper (Ent, N);
10890 end Expand_N_Task_Type_Declaration;
10892 -------------------------------
10893 -- Expand_N_Timed_Entry_Call --
10894 -------------------------------
10896 -- A timed entry call in normal case is not implemented using ATC mechanism
10897 -- anymore for efficiency reason.
10907 -- is expanded as follow:
10909 -- 1) When T.E is a task entry_call;
10913 -- X : Task_Entry_Index := <entry index>;
10914 -- DX : Duration := To_Duration (D);
10915 -- M : Delay_Mode := <discriminant>;
10916 -- P : parms := (parm, parm, parm);
10919 -- Timed_Protected_Entry_Call
10920 -- (<acceptor-task>, X, P'Address, DX, M, B);
10928 -- 2) When T.E is a protected entry_call;
10932 -- X : Protected_Entry_Index := <entry index>;
10933 -- DX : Duration := To_Duration (D);
10934 -- M : Delay_Mode := <discriminant>;
10935 -- P : parms := (parm, parm, parm);
10938 -- Timed_Protected_Entry_Call
10939 -- (<object>'unchecked_access, X, P'Address, DX, M, B);
10947 -- 3) Ada 2005 (AI-345): When T.E is a dispatching procedure call;
10950 -- B : Boolean := False;
10951 -- C : Ada.Tags.Prim_Op_Kind;
10952 -- DX : Duration := To_Duration (D)
10953 -- K : Ada.Tags.Tagged_Kind :=
10954 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
10955 -- M : Integer :=...;
10956 -- P : Parameters := (Param1 .. ParamN);
10960 -- if K = Ada.Tags.TK_Limited_Tagged then
10961 -- <dispatching-call>;
10962 -- <triggering-statements>
10966 -- Ada.Tags.Get_Offset_Index
10967 -- (Ada.Tags.Tag (<object>), DT_Position (<dispatching-call>));
10969 -- _Disp_Timed_Select (<object>, S, P'Address, DX, M, C, B);
10971 -- if C = POK_Protected_Entry
10972 -- or else C = POK_Task_Entry
10974 -- Param1 := P.Param1;
10976 -- ParamN := P.ParamN;
10980 -- if C = POK_Procedure
10981 -- or else C = POK_Protected_Procedure
10982 -- or else C = POK_Task_Procedure
10984 -- <dispatching-call>;
10987 -- <triggering-statements>
10989 -- <timed-statements>
10994 -- The triggering statement and the sequence of timed statements have not
10995 -- been analyzed yet (see Analyzed_Timed_Entry_Call). They may contain
10996 -- local declarations, and therefore the copies that are made during
10997 -- expansion must be disjoint, as for any other inlining.
10999 procedure Expand_N_Timed_Entry_Call (N : Node_Id) is
11000 Loc : constant Source_Ptr := Sloc (N);
11002 E_Call : Node_Id :=
11003 Entry_Call_Statement (Entry_Call_Alternative (N));
11004 E_Stats : constant List_Id :=
11005 Statements (Entry_Call_Alternative (N));
11006 D_Stat : Node_Id :=
11007 Delay_Statement (Delay_Alternative (N));
11008 D_Stats : constant List_Id :=
11009 Statements (Delay_Alternative (N));
11012 Blk_Typ : Entity_Id;
11014 Call_Ent : Entity_Id;
11015 Conc_Typ_Stmts : List_Id;
11019 D_Type : Entity_Id;
11025 Is_Disp_Select : Boolean;
11026 Lim_Typ_Stmts : List_Id;
11035 B : Entity_Id; -- Call status flag
11036 C : Entity_Id; -- Call kind
11037 D : Entity_Id; -- Delay
11038 K : Entity_Id; -- Tagged kind
11039 M : Entity_Id; -- Delay mode
11040 P : Entity_Id; -- Parameter block
11041 S : Entity_Id; -- Primitive operation slot
11044 -- Under the Ravenscar profile, timed entry calls are excluded. An error
11045 -- was already reported on spec, so do not attempt to expand the call.
11047 if Restriction_Active (No_Select_Statements) then
11051 Process_Statements_For_Controlled_Objects (Entry_Call_Alternative (N));
11052 Process_Statements_For_Controlled_Objects (Delay_Alternative (N));
11054 -- The arguments in the call may require dynamic allocation, and the
11055 -- call statement may have been transformed into a block. The block
11056 -- may contain additional declarations for internal entities, and the
11057 -- original call is found by sequential search.
11059 if Nkind (E_Call) = N_Block_Statement then
11060 E_Call := First (Statements (Handled_Statement_Sequence (E_Call)));
11061 while not Nkind_In (E_Call, N_Procedure_Call_Statement,
11062 N_Entry_Call_Statement)
11069 Ada_Version >= Ada_2005
11070 and then Nkind (E_Call) = N_Procedure_Call_Statement;
11072 if Is_Disp_Select then
11073 Extract_Dispatching_Call (E_Call, Call_Ent, Obj, Actuals, Formals);
11079 -- B : Boolean := False;
11081 B := Build_B (Loc, Decls);
11084 -- C : Ada.Tags.Prim_Op_Kind;
11086 C := Build_C (Loc, Decls);
11088 -- Because the analysis of all statements was disabled, manually
11089 -- analyze the delay statement.
11092 D_Stat := Original_Node (D_Stat);
11095 -- Build an entry call using Simple_Entry_Call
11097 Extract_Entry (E_Call, Concval, Ename, Index);
11098 Build_Simple_Entry_Call (E_Call, Concval, Ename, Index);
11100 Decls := Declarations (E_Call);
11101 Stmts := Statements (Handled_Statement_Sequence (E_Call));
11110 B := Make_Defining_Identifier (Loc, Name_uB);
11113 Make_Object_Declaration (Loc,
11114 Defining_Identifier =>
11116 Object_Definition =>
11117 New_Reference_To (Standard_Boolean, Loc)));
11120 -- Duration and mode processing
11122 D_Type := Base_Type (Etype (Expression (D_Stat)));
11124 -- Use the type of the delay expression (Calendar or Real_Time) to
11125 -- generate the appropriate conversion.
11127 if Nkind (D_Stat) = N_Delay_Relative_Statement then
11128 D_Disc := Make_Integer_Literal (Loc, 0);
11129 D_Conv := Relocate_Node (Expression (D_Stat));
11131 elsif Is_RTE (D_Type, RO_CA_Time) then
11132 D_Disc := Make_Integer_Literal (Loc, 1);
11133 D_Conv := Make_Function_Call (Loc,
11134 New_Reference_To (RTE (RO_CA_To_Duration), Loc),
11135 New_List (New_Copy (Expression (D_Stat))));
11137 else pragma Assert (Is_RTE (D_Type, RO_RT_Time));
11138 D_Disc := Make_Integer_Literal (Loc, 2);
11139 D_Conv := Make_Function_Call (Loc,
11140 New_Reference_To (RTE (RO_RT_To_Duration), Loc),
11141 New_List (New_Copy (Expression (D_Stat))));
11144 D := Make_Temporary (Loc, 'D');
11150 Make_Object_Declaration (Loc,
11151 Defining_Identifier =>
11153 Object_Definition =>
11154 New_Reference_To (Standard_Duration, Loc)));
11156 M := Make_Temporary (Loc, 'M');
11159 -- M : Integer := (0 | 1 | 2);
11162 Make_Object_Declaration (Loc,
11163 Defining_Identifier =>
11165 Object_Definition =>
11166 New_Reference_To (Standard_Integer, Loc),
11170 -- Do the assignment at this stage only because the evaluation of the
11171 -- expression must not occur before (see ACVC C97302A).
11174 Make_Assignment_Statement (Loc,
11176 New_Reference_To (D, Loc),
11180 -- Parameter block processing
11182 -- Manually create the parameter block for dispatching calls. In the
11183 -- case of entries, the block has already been created during the call
11184 -- to Build_Simple_Entry_Call.
11186 if Is_Disp_Select then
11188 -- Tagged kind processing, generate:
11189 -- K : Ada.Tags.Tagged_Kind :=
11190 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag <object>));
11192 K := Build_K (Loc, Decls, Obj);
11194 Blk_Typ := Build_Parameter_Block (Loc, Actuals, Formals, Decls);
11195 P := Parameter_Block_Pack
11196 (Loc, Blk_Typ, Actuals, Formals, Decls, Stmts);
11198 -- Dispatch table slot processing, generate:
11201 S := Build_S (Loc, Decls);
11204 -- S := Ada.Tags.Get_Offset_Index
11205 -- (Ada.Tags.Tag (<object>), DT_Position (Call_Ent));
11208 New_List (Build_S_Assignment (Loc, S, Obj, Call_Ent));
11211 -- _Disp_Timed_Select (<object>, S, P'Address, D, M, C, B);
11213 -- where Obj is the controlling formal parameter, S is the dispatch
11214 -- table slot number of the dispatching operation, P is the wrapped
11215 -- parameter block, D is the duration, M is the duration mode, C is
11216 -- the call kind and B is the call status.
11218 Params := New_List;
11220 Append_To (Params, New_Copy_Tree (Obj));
11221 Append_To (Params, New_Reference_To (S, Loc));
11222 Append_To (Params, Make_Attribute_Reference (Loc,
11223 Prefix => New_Reference_To (P, Loc),
11224 Attribute_Name => Name_Address));
11225 Append_To (Params, New_Reference_To (D, Loc));
11226 Append_To (Params, New_Reference_To (M, Loc));
11227 Append_To (Params, New_Reference_To (C, Loc));
11228 Append_To (Params, New_Reference_To (B, Loc));
11230 Append_To (Conc_Typ_Stmts,
11231 Make_Procedure_Call_Statement (Loc,
11234 Find_Prim_Op (Etype (Etype (Obj)),
11235 Name_uDisp_Timed_Select),
11237 Parameter_Associations =>
11241 -- if C = POK_Protected_Entry
11242 -- or else C = POK_Task_Entry
11244 -- Param1 := P.Param1;
11246 -- ParamN := P.ParamN;
11249 Unpack := Parameter_Block_Unpack (Loc, P, Actuals, Formals);
11251 -- Generate the if statement only when the packed parameters need
11252 -- explicit assignments to their corresponding actuals.
11254 if Present (Unpack) then
11255 Append_To (Conc_Typ_Stmts,
11256 Make_If_Statement (Loc,
11263 New_Reference_To (C, Loc),
11265 New_Reference_To (RTE (
11266 RE_POK_Protected_Entry), Loc)),
11270 New_Reference_To (C, Loc),
11272 New_Reference_To (RTE (RE_POK_Task_Entry), Loc))),
11281 -- if C = POK_Procedure
11282 -- or else C = POK_Protected_Procedure
11283 -- or else C = POK_Task_Procedure
11285 -- <dispatching-call>
11287 -- <triggering-statements>
11289 -- <timed-statements>
11292 N_Stats := Copy_Separate_List (E_Stats);
11294 Prepend_To (N_Stats,
11295 Make_If_Statement (Loc,
11302 New_Reference_To (C, Loc),
11304 New_Reference_To (RTE (RE_POK_Procedure), Loc)),
11310 New_Reference_To (C, Loc),
11312 New_Reference_To (RTE (
11313 RE_POK_Protected_Procedure), Loc)),
11317 New_Reference_To (C, Loc),
11319 New_Reference_To (RTE (
11320 RE_POK_Task_Procedure), Loc)))),
11323 New_List (E_Call)));
11325 Append_To (Conc_Typ_Stmts,
11326 Make_If_Statement (Loc,
11327 Condition => New_Reference_To (B, Loc),
11328 Then_Statements => N_Stats,
11329 Else_Statements => D_Stats));
11332 -- <dispatching-call>;
11333 -- <triggering-statements>
11335 Lim_Typ_Stmts := Copy_Separate_List (E_Stats);
11336 Prepend_To (Lim_Typ_Stmts, New_Copy_Tree (E_Call));
11339 -- if K = Ada.Tags.TK_Limited_Tagged then
11346 Make_If_Statement (Loc,
11350 New_Reference_To (K, Loc),
11352 New_Reference_To (RTE (RE_TK_Limited_Tagged), Loc)),
11361 -- Skip assignments to temporaries created for in-out parameters.
11362 -- This makes unwarranted assumptions about the shape of the expanded
11363 -- tree for the call, and should be cleaned up ???
11365 Stmt := First (Stmts);
11366 while Nkind (Stmt) /= N_Procedure_Call_Statement loop
11370 -- Do the assignment at this stage only because the evaluation
11371 -- of the expression must not occur before (see ACVC C97302A).
11373 Insert_Before (Stmt,
11374 Make_Assignment_Statement (Loc,
11375 Name => New_Reference_To (D, Loc),
11376 Expression => D_Conv));
11379 Params := Parameter_Associations (Call);
11381 -- For a protected type, we build a Timed_Protected_Entry_Call
11383 if Is_Protected_Type (Etype (Concval)) then
11385 -- Create a new call statement
11387 Param := First (Params);
11388 while Present (Param)
11389 and then not Is_RTE (Etype (Param), RE_Call_Modes)
11394 Dummy := Remove_Next (Next (Param));
11396 -- Remove garbage is following the Cancel_Param if present
11398 Dummy := Next (Param);
11400 -- Remove the mode of the Protected_Entry_Call call, then remove
11401 -- the Communication_Block of the Protected_Entry_Call call, and
11402 -- finally add Duration and a Delay_Mode parameter
11404 pragma Assert (Present (Param));
11405 Rewrite (Param, New_Reference_To (D, Loc));
11407 Rewrite (Dummy, New_Reference_To (M, Loc));
11409 -- Add a Boolean flag for successful entry call
11411 Append_To (Params, New_Reference_To (B, Loc));
11413 case Corresponding_Runtime_Package (Etype (Concval)) is
11414 when System_Tasking_Protected_Objects_Entries =>
11416 Make_Procedure_Call_Statement (Loc,
11419 (RTE (RE_Timed_Protected_Entry_Call), Loc),
11420 Parameter_Associations => Params));
11422 when System_Tasking_Protected_Objects_Single_Entry =>
11423 Param := First (Params);
11424 while Present (Param)
11426 Is_RTE (Etype (Param), RE_Protected_Entry_Index)
11434 Make_Procedure_Call_Statement (Loc,
11435 Name => New_Reference_To (
11436 RTE (RE_Timed_Protected_Single_Entry_Call), Loc),
11437 Parameter_Associations => Params));
11440 raise Program_Error;
11443 -- For the task case, build a Timed_Task_Entry_Call
11446 -- Create a new call statement
11448 Append_To (Params, New_Reference_To (D, Loc));
11449 Append_To (Params, New_Reference_To (M, Loc));
11450 Append_To (Params, New_Reference_To (B, Loc));
11453 Make_Procedure_Call_Statement (Loc,
11455 New_Reference_To (RTE (RE_Timed_Task_Entry_Call), Loc),
11456 Parameter_Associations => Params));
11460 Make_Implicit_If_Statement (N,
11461 Condition => New_Reference_To (B, Loc),
11462 Then_Statements => E_Stats,
11463 Else_Statements => D_Stats));
11467 Make_Block_Statement (Loc,
11468 Declarations => Decls,
11469 Handled_Statement_Sequence =>
11470 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
11473 end Expand_N_Timed_Entry_Call;
11475 ----------------------------------------
11476 -- Expand_Protected_Body_Declarations --
11477 ----------------------------------------
11479 procedure Expand_Protected_Body_Declarations
11481 Spec_Id : Entity_Id)
11484 if No_Run_Time_Mode then
11485 Error_Msg_CRT ("protected body", N);
11488 elsif Expander_Active then
11490 -- Associate discriminals with the first subprogram or entry body to
11493 if Present (First_Protected_Operation (Declarations (N))) then
11494 Set_Discriminals (Parent (Spec_Id));
11497 end Expand_Protected_Body_Declarations;
11499 -------------------------
11500 -- External_Subprogram --
11501 -------------------------
11503 function External_Subprogram (E : Entity_Id) return Entity_Id is
11504 Subp : constant Entity_Id := Protected_Body_Subprogram (E);
11507 -- The internal and external subprograms follow each other on the entity
11508 -- chain. Note that previously private operations had no separate
11509 -- external subprogram. We now create one in all cases, because a
11510 -- private operation may actually appear in an external call, through
11511 -- a 'Access reference used for a callback.
11513 -- If the operation is a function that returns an anonymous access type,
11514 -- the corresponding itype appears before the operation, and must be
11517 -- This mechanism is fragile, there should be a real link between the
11518 -- two versions of the operation, but there is no place to put it ???
11520 if Is_Access_Type (Next_Entity (Subp)) then
11521 return Next_Entity (Next_Entity (Subp));
11523 return Next_Entity (Subp);
11525 end External_Subprogram;
11527 ------------------------------
11528 -- Extract_Dispatching_Call --
11529 ------------------------------
11531 procedure Extract_Dispatching_Call
11533 Call_Ent : out Entity_Id;
11534 Object : out Entity_Id;
11535 Actuals : out List_Id;
11536 Formals : out List_Id)
11538 Call_Nam : Node_Id;
11541 pragma Assert (Nkind (N) = N_Procedure_Call_Statement);
11543 if Present (Original_Node (N)) then
11544 Call_Nam := Name (Original_Node (N));
11546 Call_Nam := Name (N);
11549 -- Retrieve the name of the dispatching procedure. It contains the
11550 -- dispatch table slot number.
11553 case Nkind (Call_Nam) is
11554 when N_Identifier =>
11557 when N_Selected_Component =>
11558 Call_Nam := Selector_Name (Call_Nam);
11561 raise Program_Error;
11566 Actuals := Parameter_Associations (N);
11567 Call_Ent := Entity (Call_Nam);
11568 Formals := Parameter_Specifications (Parent (Call_Ent));
11569 Object := First (Actuals);
11571 if Present (Original_Node (Object)) then
11572 Object := Original_Node (Object);
11575 -- If the type of the dispatching object is an access type then return
11576 -- an explicit dereference.
11578 if Is_Access_Type (Etype (Object)) then
11579 Object := Make_Explicit_Dereference (Sloc (N), Object);
11582 end Extract_Dispatching_Call;
11584 -------------------
11585 -- Extract_Entry --
11586 -------------------
11588 procedure Extract_Entry
11590 Concval : out Node_Id;
11591 Ename : out Node_Id;
11592 Index : out Node_Id)
11594 Nam : constant Node_Id := Name (N);
11597 -- For a simple entry, the name is a selected component, with the
11598 -- prefix being the task value, and the selector being the entry.
11600 if Nkind (Nam) = N_Selected_Component then
11601 Concval := Prefix (Nam);
11602 Ename := Selector_Name (Nam);
11605 -- For a member of an entry family, the name is an indexed component
11606 -- where the prefix is a selected component, whose prefix in turn is
11607 -- the task value, and whose selector is the entry family. The single
11608 -- expression in the expressions list of the indexed component is the
11609 -- subscript for the family.
11611 else pragma Assert (Nkind (Nam) = N_Indexed_Component);
11612 Concval := Prefix (Prefix (Nam));
11613 Ename := Selector_Name (Prefix (Nam));
11614 Index := First (Expressions (Nam));
11618 -------------------
11619 -- Family_Offset --
11620 -------------------
11622 function Family_Offset
11627 Cap : Boolean) return Node_Id
11633 function Convert_Discriminant_Ref (Bound : Node_Id) return Node_Id;
11634 -- If one of the bounds is a reference to a discriminant, replace with
11635 -- corresponding discriminal of type. Within the body of a task retrieve
11636 -- the renamed discriminant by simple visibility, using its generated
11637 -- name. Within a protected object, find the original discriminant and
11638 -- replace it with the discriminal of the current protected operation.
11640 ------------------------------
11641 -- Convert_Discriminant_Ref --
11642 ------------------------------
11644 function Convert_Discriminant_Ref (Bound : Node_Id) return Node_Id is
11645 Loc : constant Source_Ptr := Sloc (Bound);
11650 if Is_Entity_Name (Bound)
11651 and then Ekind (Entity (Bound)) = E_Discriminant
11653 if Is_Task_Type (Ttyp)
11654 and then Has_Completion (Ttyp)
11656 B := Make_Identifier (Loc, Chars (Entity (Bound)));
11657 Find_Direct_Name (B);
11659 elsif Is_Protected_Type (Ttyp) then
11660 D := First_Discriminant (Ttyp);
11661 while Chars (D) /= Chars (Entity (Bound)) loop
11662 Next_Discriminant (D);
11665 B := New_Reference_To (Discriminal (D), Loc);
11668 B := New_Reference_To (Discriminal (Entity (Bound)), Loc);
11671 elsif Nkind (Bound) = N_Attribute_Reference then
11675 B := New_Copy_Tree (Bound);
11679 Make_Attribute_Reference (Loc,
11680 Attribute_Name => Name_Pos,
11681 Prefix => New_Occurrence_Of (Etype (Bound), Loc),
11682 Expressions => New_List (B));
11683 end Convert_Discriminant_Ref;
11685 -- Start of processing for Family_Offset
11688 Real_Hi := Convert_Discriminant_Ref (Hi);
11689 Real_Lo := Convert_Discriminant_Ref (Lo);
11692 if Is_Task_Type (Ttyp) then
11693 Ityp := RTE (RE_Task_Entry_Index);
11695 Ityp := RTE (RE_Protected_Entry_Index);
11699 Make_Attribute_Reference (Loc,
11700 Prefix => New_Reference_To (Ityp, Loc),
11701 Attribute_Name => Name_Min,
11702 Expressions => New_List (
11704 Make_Integer_Literal (Loc, Entry_Family_Bound - 1)));
11707 Make_Attribute_Reference (Loc,
11708 Prefix => New_Reference_To (Ityp, Loc),
11709 Attribute_Name => Name_Max,
11710 Expressions => New_List (
11712 Make_Integer_Literal (Loc, -Entry_Family_Bound)));
11715 return Make_Op_Subtract (Loc, Real_Hi, Real_Lo);
11722 function Family_Size
11727 Cap : Boolean) return Node_Id
11732 if Is_Task_Type (Ttyp) then
11733 Ityp := RTE (RE_Task_Entry_Index);
11735 Ityp := RTE (RE_Protected_Entry_Index);
11739 Make_Attribute_Reference (Loc,
11740 Prefix => New_Reference_To (Ityp, Loc),
11741 Attribute_Name => Name_Max,
11742 Expressions => New_List (
11745 Family_Offset (Loc, Hi, Lo, Ttyp, Cap),
11747 Make_Integer_Literal (Loc, 1)),
11748 Make_Integer_Literal (Loc, 0)));
11751 -----------------------
11752 -- Find_Master_Scope --
11753 -----------------------
11755 function Find_Master_Scope (E : Entity_Id) return Entity_Id is
11759 -- In Ada2005, the master is the innermost enclosing scope that is not
11760 -- transient. If the enclosing block is the rewriting of a call or the
11761 -- scope is an extended return statement this is valid master. The
11762 -- master in an extended return is only used within the return, and is
11763 -- subsequently overwritten in Move_Activation_Chain, but it must exist
11764 -- now before that overwriting occurs.
11768 if Ada_Version >= Ada_2005 then
11769 while Is_Internal (S) loop
11770 if Nkind (Parent (S)) = N_Block_Statement
11772 Nkind (Original_Node (Parent (S))) = N_Procedure_Call_Statement
11776 elsif Ekind (S) = E_Return_Statement then
11786 end Find_Master_Scope;
11788 -----------------------------------
11789 -- Find_Task_Or_Protected_Pragma --
11790 -----------------------------------
11792 function Find_Task_Or_Protected_Pragma
11794 P : Name_Id) return Node_Id
11799 N := First (Visible_Declarations (T));
11800 while Present (N) loop
11801 if Nkind (N) = N_Pragma then
11802 if Pragma_Name (N) = P then
11805 elsif P = Name_Priority
11806 and then Pragma_Name (N) = Name_Interrupt_Priority
11819 N := First (Private_Declarations (T));
11820 while Present (N) loop
11821 if Nkind (N) = N_Pragma then
11822 if Pragma_Name (N) = P then
11825 elsif P = Name_Priority
11826 and then Pragma_Name (N) = Name_Interrupt_Priority
11839 raise Program_Error;
11840 end Find_Task_Or_Protected_Pragma;
11842 -------------------------------
11843 -- First_Protected_Operation --
11844 -------------------------------
11846 function First_Protected_Operation (D : List_Id) return Node_Id is
11847 First_Op : Node_Id;
11850 First_Op := First (D);
11851 while Present (First_Op)
11852 and then not Nkind_In (First_Op, N_Subprogram_Body, N_Entry_Body)
11858 end First_Protected_Operation;
11860 ---------------------------------------
11861 -- Install_Private_Data_Declarations --
11862 ---------------------------------------
11864 procedure Install_Private_Data_Declarations
11866 Spec_Id : Entity_Id;
11867 Conc_Typ : Entity_Id;
11868 Body_Nod : Node_Id;
11870 Barrier : Boolean := False;
11871 Family : Boolean := False)
11873 Is_Protected : constant Boolean := Is_Protected_Type (Conc_Typ);
11876 Insert_Node : Node_Id := Empty;
11877 Obj_Ent : Entity_Id;
11879 procedure Add (Decl : Node_Id);
11880 -- Add a single declaration after Insert_Node. If this is the first
11881 -- addition, Decl is added to the front of Decls and it becomes the
11884 function Replace_Bound (Bound : Node_Id) return Node_Id;
11885 -- The bounds of an entry index may depend on discriminants, create a
11886 -- reference to the corresponding prival. Otherwise return a duplicate
11887 -- of the original bound.
11893 procedure Add (Decl : Node_Id) is
11895 if No (Insert_Node) then
11896 Prepend_To (Decls, Decl);
11898 Insert_After (Insert_Node, Decl);
11901 Insert_Node := Decl;
11904 --------------------------
11905 -- Replace_Discriminant --
11906 --------------------------
11908 function Replace_Bound (Bound : Node_Id) return Node_Id is
11910 if Nkind (Bound) = N_Identifier
11911 and then Is_Discriminal (Entity (Bound))
11913 return Make_Identifier (Loc, Chars (Entity (Bound)));
11915 return Duplicate_Subexpr (Bound);
11919 -- Start of processing for Install_Private_Data_Declarations
11922 -- Step 1: Retrieve the concurrent object entity. Obj_Ent can denote
11923 -- formal parameter _O, _object or _task depending on the context.
11925 Obj_Ent := Concurrent_Object (Spec_Id, Conc_Typ);
11927 -- Special processing of _O for barrier functions, protected entries
11934 (Ekind (Spec_Id) = E_Entry
11935 or else Ekind (Spec_Id) = E_Entry_Family))
11938 Conc_Rec : constant Entity_Id :=
11939 Corresponding_Record_Type (Conc_Typ);
11940 Typ_Id : constant Entity_Id :=
11941 Make_Defining_Identifier (Loc,
11942 New_External_Name (Chars (Conc_Rec), 'P'));
11945 -- type prot_typVP is access prot_typV;
11948 Make_Full_Type_Declaration (Loc,
11949 Defining_Identifier => Typ_Id,
11951 Make_Access_To_Object_Definition (Loc,
11952 Subtype_Indication =>
11953 New_Reference_To (Conc_Rec, Loc)));
11957 -- _object : prot_typVP := prot_typV (_O);
11960 Make_Object_Declaration (Loc,
11961 Defining_Identifier =>
11962 Make_Defining_Identifier (Loc, Name_uObject),
11963 Object_Definition => New_Reference_To (Typ_Id, Loc),
11965 Unchecked_Convert_To (Typ_Id,
11966 New_Reference_To (Obj_Ent, Loc)));
11969 -- Set the reference to the concurrent object
11971 Obj_Ent := Defining_Identifier (Decl);
11975 -- Step 2: Create the Protection object and build its declaration for
11976 -- any protected entry (family) of subprogram.
11978 if Is_Protected then
11980 Prot_Ent : constant Entity_Id := Make_Temporary (Loc, 'R');
11984 Set_Protection_Object (Spec_Id, Prot_Ent);
11986 -- Determine the proper protection type
11988 if Has_Attach_Handler (Conc_Typ)
11989 and then not Restricted_Profile
11991 Prot_Typ := RE_Static_Interrupt_Protection;
11993 elsif Has_Interrupt_Handler (Conc_Typ) then
11994 Prot_Typ := RE_Dynamic_Interrupt_Protection;
11996 -- The type has explicit entries or generated primitive entry
11999 elsif Has_Entries (Conc_Typ)
12001 (Ada_Version >= Ada_2005
12002 and then Present (Interface_List (Parent (Conc_Typ))))
12004 case Corresponding_Runtime_Package (Conc_Typ) is
12005 when System_Tasking_Protected_Objects_Entries =>
12006 Prot_Typ := RE_Protection_Entries;
12008 when System_Tasking_Protected_Objects_Single_Entry =>
12009 Prot_Typ := RE_Protection_Entry;
12012 raise Program_Error;
12016 Prot_Typ := RE_Protection;
12020 -- conc_typR : protection_typ renames _object._object;
12023 Make_Object_Renaming_Declaration (Loc,
12024 Defining_Identifier => Prot_Ent,
12026 New_Reference_To (RTE (Prot_Typ), Loc),
12028 Make_Selected_Component (Loc,
12029 Prefix => New_Reference_To (Obj_Ent, Loc),
12030 Selector_Name => Make_Identifier (Loc, Name_uObject)));
12035 -- Step 3: Add discriminant renamings (if any)
12037 if Has_Discriminants (Conc_Typ) then
12042 D := First_Discriminant (Conc_Typ);
12043 while Present (D) loop
12045 -- Adjust the source location
12047 Set_Sloc (Discriminal (D), Loc);
12050 -- discr_name : discr_typ renames _object.discr_name;
12052 -- discr_name : discr_typ renames _task.discr_name;
12055 Make_Object_Renaming_Declaration (Loc,
12056 Defining_Identifier => Discriminal (D),
12057 Subtype_Mark => New_Reference_To (Etype (D), Loc),
12059 Make_Selected_Component (Loc,
12060 Prefix => New_Reference_To (Obj_Ent, Loc),
12061 Selector_Name => Make_Identifier (Loc, Chars (D))));
12064 Next_Discriminant (D);
12069 -- Step 4: Add private component renamings (if any)
12071 if Is_Protected then
12072 Def := Protected_Definition (Parent (Conc_Typ));
12074 if Present (Private_Declarations (Def)) then
12077 Comp_Id : Entity_Id;
12078 Decl_Id : Entity_Id;
12081 Comp := First (Private_Declarations (Def));
12082 while Present (Comp) loop
12083 if Nkind (Comp) = N_Component_Declaration then
12084 Comp_Id := Defining_Identifier (Comp);
12086 Make_Defining_Identifier (Loc, Chars (Comp_Id));
12088 -- Minimal decoration
12090 if Ekind (Spec_Id) = E_Function then
12091 Set_Ekind (Decl_Id, E_Constant);
12093 Set_Ekind (Decl_Id, E_Variable);
12096 Set_Prival (Comp_Id, Decl_Id);
12097 Set_Prival_Link (Decl_Id, Comp_Id);
12098 Set_Is_Aliased (Decl_Id, Is_Aliased (Comp_Id));
12101 -- comp_name : comp_typ renames _object.comp_name;
12104 Make_Object_Renaming_Declaration (Loc,
12105 Defining_Identifier => Decl_Id,
12107 New_Reference_To (Etype (Comp_Id), Loc),
12109 Make_Selected_Component (Loc,
12111 New_Reference_To (Obj_Ent, Loc),
12113 Make_Identifier (Loc, Chars (Comp_Id))));
12123 -- Step 5: Add the declaration of the entry index and the associated
12124 -- type for barrier functions and entry families.
12126 if (Barrier and then Family)
12127 or else Ekind (Spec_Id) = E_Entry_Family
12130 E : constant Entity_Id := Index_Object (Spec_Id);
12131 Index : constant Entity_Id :=
12132 Defining_Identifier (
12133 Entry_Index_Specification (
12134 Entry_Body_Formal_Part (Body_Nod)));
12135 Index_Con : constant Entity_Id :=
12136 Make_Defining_Identifier (Loc, Chars (Index));
12138 Index_Typ : Entity_Id;
12142 -- Minimal decoration
12144 Set_Ekind (Index_Con, E_Constant);
12145 Set_Entry_Index_Constant (Index, Index_Con);
12146 Set_Discriminal_Link (Index_Con, Index);
12148 -- Retrieve the bounds of the entry family
12150 High := Type_High_Bound (Etype (Index));
12151 Low := Type_Low_Bound (Etype (Index));
12153 -- In the simple case the entry family is given by a subtype
12154 -- mark and the index constant has the same type.
12156 if Is_Entity_Name (Original_Node (
12157 Discrete_Subtype_Definition (Parent (Index))))
12159 Index_Typ := Etype (Index);
12161 -- Otherwise a new subtype declaration is required
12164 High := Replace_Bound (High);
12165 Low := Replace_Bound (Low);
12167 Index_Typ := Make_Temporary (Loc, 'J');
12170 -- subtype Jnn is <Etype of Index> range Low .. High;
12173 Make_Subtype_Declaration (Loc,
12174 Defining_Identifier => Index_Typ,
12175 Subtype_Indication =>
12176 Make_Subtype_Indication (Loc,
12178 New_Reference_To (Base_Type (Etype (Index)), Loc),
12180 Make_Range_Constraint (Loc,
12181 Range_Expression =>
12182 Make_Range (Loc, Low, High))));
12186 Set_Etype (Index_Con, Index_Typ);
12188 -- Create the object which designates the index:
12189 -- J : constant Jnn :=
12190 -- Jnn'Val (_E - <index expr> + Jnn'Pos (Jnn'First));
12192 -- where Jnn is the subtype created above or the original type of
12193 -- the index, _E is a formal of the protected body subprogram and
12194 -- <index expr> is the index of the first family member.
12197 Make_Object_Declaration (Loc,
12198 Defining_Identifier => Index_Con,
12199 Constant_Present => True,
12200 Object_Definition =>
12201 New_Reference_To (Index_Typ, Loc),
12204 Make_Attribute_Reference (Loc,
12206 New_Reference_To (Index_Typ, Loc),
12207 Attribute_Name => Name_Val,
12209 Expressions => New_List (
12213 Make_Op_Subtract (Loc,
12215 New_Reference_To (E, Loc),
12217 Entry_Index_Expression (Loc,
12218 Defining_Identifier (Body_Nod),
12222 Make_Attribute_Reference (Loc,
12224 New_Reference_To (Index_Typ, Loc),
12225 Attribute_Name => Name_Pos,
12226 Expressions => New_List (
12227 Make_Attribute_Reference (Loc,
12229 New_Reference_To (Index_Typ, Loc),
12230 Attribute_Name => Name_First)))))));
12234 end Install_Private_Data_Declarations;
12236 ---------------------------------
12237 -- Is_Potentially_Large_Family --
12238 ---------------------------------
12240 function Is_Potentially_Large_Family
12241 (Base_Index : Entity_Id;
12242 Conctyp : Entity_Id;
12244 Hi : Node_Id) return Boolean
12247 return Scope (Base_Index) = Standard_Standard
12248 and then Base_Index = Base_Type (Standard_Integer)
12249 and then Has_Discriminants (Conctyp)
12251 (Discriminant_Default_Value (First_Discriminant (Conctyp)))
12253 (Denotes_Discriminant (Lo, True)
12254 or else Denotes_Discriminant (Hi, True));
12255 end Is_Potentially_Large_Family;
12257 -------------------------------------
12258 -- Is_Private_Primitive_Subprogram --
12259 -------------------------------------
12261 function Is_Private_Primitive_Subprogram (Id : Entity_Id) return Boolean is
12264 (Ekind (Id) = E_Function or else Ekind (Id) = E_Procedure)
12265 and then Is_Private_Primitive (Id);
12266 end Is_Private_Primitive_Subprogram;
12272 function Index_Object (Spec_Id : Entity_Id) return Entity_Id is
12273 Bod_Subp : constant Entity_Id := Protected_Body_Subprogram (Spec_Id);
12274 Formal : Entity_Id;
12277 Formal := First_Formal (Bod_Subp);
12278 while Present (Formal) loop
12280 -- Look for formal parameter _E
12282 if Chars (Formal) = Name_uE then
12286 Next_Formal (Formal);
12289 -- A protected body subprogram should always have the parameter in
12292 raise Program_Error;
12295 --------------------------------
12296 -- Make_Initialize_Protection --
12297 --------------------------------
12299 function Make_Initialize_Protection
12300 (Protect_Rec : Entity_Id) return List_Id
12302 Loc : constant Source_Ptr := Sloc (Protect_Rec);
12306 Ptyp : constant Node_Id :=
12307 Corresponding_Concurrent_Type (Protect_Rec);
12309 L : constant List_Id := New_List;
12310 Has_Entry : constant Boolean := Has_Entries (Ptyp);
12311 Restricted : constant Boolean := Restricted_Profile;
12314 -- We may need two calls to properly initialize the object, one to
12315 -- Initialize_Protection, and possibly one to Install_Handlers if we
12316 -- have a pragma Attach_Handler.
12318 -- Get protected declaration. In the case of a task type declaration,
12319 -- this is simply the parent of the protected type entity. In the single
12320 -- protected object declaration, this parent will be the implicit type,
12321 -- and we can find the corresponding single protected object declaration
12322 -- by searching forward in the declaration list in the tree.
12324 -- Is the test for N_Single_Protected_Declaration needed here??? Nodes
12325 -- of this type should have been removed during semantic analysis.
12327 Pdec := Parent (Ptyp);
12328 while not Nkind_In (Pdec, N_Protected_Type_Declaration,
12329 N_Single_Protected_Declaration)
12334 -- Now we can find the object definition from this declaration
12336 Pdef := Protected_Definition (Pdec);
12338 -- Build the parameter list for the call. Note that _Init is the name
12339 -- of the formal for the object to be initialized, which is the task
12340 -- value record itself.
12344 -- Object parameter. This is a pointer to the object of type
12345 -- Protection used by the GNARL to control the protected object.
12348 Make_Attribute_Reference (Loc,
12350 Make_Selected_Component (Loc,
12351 Prefix => Make_Identifier (Loc, Name_uInit),
12352 Selector_Name => Make_Identifier (Loc, Name_uObject)),
12353 Attribute_Name => Name_Unchecked_Access));
12355 -- Priority parameter. Set to Unspecified_Priority unless there is a
12356 -- priority pragma, in which case we take the value from the pragma,
12357 -- or there is an interrupt pragma and no priority pragma, and we
12358 -- set the ceiling to Interrupt_Priority'Last, an implementation-
12359 -- defined value, see D.3(10).
12362 and then Has_Pragma_Priority (Pdef)
12365 Prio : constant Node_Id :=
12368 (Pragma_Argument_Associations
12369 (Find_Task_Or_Protected_Pragma
12370 (Pdef, Name_Priority))));
12374 -- If priority is a static expression, then we can duplicate it
12375 -- with no problem and simply append it to the argument list.
12377 if Is_Static_Expression (Prio) then
12379 Duplicate_Subexpr_No_Checks (Prio));
12381 -- Otherwise, the priority may be a per-object expression, if it
12382 -- depends on a discriminant of the type. In this case, create
12383 -- local variable to capture the expression. Note that it is
12384 -- really necessary to create this variable explicitly. It might
12385 -- be thought that removing side effects would the appropriate
12386 -- approach, but that could generate declarations improperly
12387 -- placed in the enclosing scope.
12389 -- Note: Use System.Any_Priority as the expected type for the
12390 -- non-static priority expression, in case the expression has not
12391 -- been analyzed yet (as occurs for example with pragma
12392 -- Interrupt_Priority).
12395 Temp := Make_Temporary (Loc, 'R', Prio);
12397 Make_Object_Declaration (Loc,
12398 Defining_Identifier => Temp,
12399 Object_Definition =>
12400 New_Occurrence_Of (RTE (RE_Any_Priority), Loc),
12401 Expression => Relocate_Node (Prio)));
12403 Append_To (Args, New_Occurrence_Of (Temp, Loc));
12407 -- When no priority is specified but an xx_Handler pragma is, we default
12408 -- to System.Interrupts.Default_Interrupt_Priority, see D.3(10).
12410 elsif Has_Interrupt_Handler (Ptyp)
12411 or else Has_Attach_Handler (Ptyp)
12414 New_Reference_To (RTE (RE_Default_Interrupt_Priority), Loc));
12416 -- Normal case, no priority or xx_Handler specified, default priority
12420 New_Reference_To (RTE (RE_Unspecified_Priority), Loc));
12423 -- Test for Compiler_Info parameter. This parameter allows entry body
12424 -- procedures and barrier functions to be called from the runtime. It
12425 -- is a pointer to the record generated by the compiler to represent
12426 -- the protected object.
12428 -- A protected type without entries that covers an interface and
12429 -- overrides the abstract routines with protected procedures is
12430 -- considered equivalent to a protected type with entries in the
12431 -- context of dispatching select statements.
12434 or else Has_Interrupt_Handler (Ptyp)
12435 or else Has_Attach_Handler (Ptyp)
12436 or else Has_Interfaces (Protect_Rec)
12439 Pkg_Id : constant RTU_Id :=
12440 Corresponding_Runtime_Package (Ptyp);
12441 Called_Subp : RE_Id;
12445 when System_Tasking_Protected_Objects_Entries =>
12446 Called_Subp := RE_Initialize_Protection_Entries;
12448 when System_Tasking_Protected_Objects =>
12449 Called_Subp := RE_Initialize_Protection;
12451 when System_Tasking_Protected_Objects_Single_Entry =>
12452 Called_Subp := RE_Initialize_Protection_Entry;
12455 raise Program_Error;
12459 or else not Restricted
12460 or else Has_Interfaces (Protect_Rec)
12463 Make_Attribute_Reference (Loc,
12464 Prefix => Make_Identifier (Loc, Name_uInit),
12465 Attribute_Name => Name_Address));
12468 -- Entry_Bodies parameter. This is a pointer to an array of
12469 -- pointers to the entry body procedures and barrier functions of
12470 -- the object. If the protected type has no entries this object
12471 -- will not exist, in this case, pass a null.
12474 P_Arr := Entry_Bodies_Array (Ptyp);
12477 Make_Attribute_Reference (Loc,
12478 Prefix => New_Reference_To (P_Arr, Loc),
12479 Attribute_Name => Name_Unrestricted_Access));
12481 if Pkg_Id = System_Tasking_Protected_Objects_Entries then
12483 -- Find index mapping function (clumsy but ok for now)
12485 while Ekind (P_Arr) /= E_Function loop
12486 Next_Entity (P_Arr);
12490 Make_Attribute_Reference (Loc,
12492 New_Reference_To (P_Arr, Loc),
12493 Attribute_Name => Name_Unrestricted_Access));
12495 -- Build_Entry_Names generation flag. When set to true, the
12496 -- runtime will allocate an array to hold the string names
12497 -- of protected entries.
12499 if not Restricted_Profile then
12500 if Entry_Names_OK then
12502 New_Reference_To (Standard_True, Loc));
12505 New_Reference_To (Standard_False, Loc));
12510 elsif Pkg_Id = System_Tasking_Protected_Objects_Single_Entry then
12511 Append_To (Args, Make_Null (Loc));
12513 elsif Pkg_Id = System_Tasking_Protected_Objects_Entries then
12514 Append_To (Args, Make_Null (Loc));
12515 Append_To (Args, Make_Null (Loc));
12516 Append_To (Args, New_Reference_To (Standard_False, Loc));
12520 Make_Procedure_Call_Statement (Loc,
12521 Name => New_Reference_To (RTE (Called_Subp), Loc),
12522 Parameter_Associations => Args));
12526 Make_Procedure_Call_Statement (Loc,
12527 Name => New_Reference_To (RTE (RE_Initialize_Protection), Loc),
12528 Parameter_Associations => Args));
12531 if Has_Attach_Handler (Ptyp) then
12533 -- We have a list of N Attach_Handler (ProcI, ExprI), and we have to
12534 -- make the following call:
12536 -- Install_Handlers (_object,
12537 -- ((Expr1, Proc1'access), ...., (ExprN, ProcN'access));
12539 -- or, in the case of Ravenscar:
12541 -- Install_Restricted_Handlers
12542 -- ((Expr1, Proc1'access), ...., (ExprN, ProcN'access));
12545 Args : constant List_Id := New_List;
12546 Table : constant List_Id := New_List;
12547 Ritem : Node_Id := First_Rep_Item (Ptyp);
12550 -- Build the Attach_Handler table argument
12552 while Present (Ritem) loop
12553 if Nkind (Ritem) = N_Pragma
12554 and then Pragma_Name (Ritem) = Name_Attach_Handler
12557 Handler : constant Node_Id :=
12558 First (Pragma_Argument_Associations (Ritem));
12560 Interrupt : constant Node_Id := Next (Handler);
12561 Expr : constant Node_Id := Expression (Interrupt);
12565 Make_Aggregate (Loc, Expressions => New_List (
12566 Unchecked_Convert_To
12567 (RTE (RE_System_Interrupt_Id), Expr),
12568 Make_Attribute_Reference (Loc,
12569 Prefix => Make_Selected_Component (Loc,
12570 Make_Identifier (Loc, Name_uInit),
12571 Duplicate_Subexpr_No_Checks
12572 (Expression (Handler))),
12573 Attribute_Name => Name_Access))));
12577 Next_Rep_Item (Ritem);
12580 -- Append the table argument we just built
12582 Append_To (Args, Make_Aggregate (Loc, Table));
12584 -- Append the Install_Handlers (or Install_Restricted_Handlers)
12585 -- call to the statements.
12588 -- Call a simplified version of Install_Handlers to be used
12589 -- when the Ravenscar restrictions are in effect
12590 -- (Install_Restricted_Handlers).
12593 Make_Procedure_Call_Statement (Loc,
12596 (RTE (RE_Install_Restricted_Handlers), Loc),
12597 Parameter_Associations => Args));
12600 -- First, prepends the _object argument
12603 Make_Attribute_Reference (Loc,
12605 Make_Selected_Component (Loc,
12606 Prefix => Make_Identifier (Loc, Name_uInit),
12607 Selector_Name => Make_Identifier (Loc, Name_uObject)),
12608 Attribute_Name => Name_Unchecked_Access));
12610 -- Then, insert call to Install_Handlers
12613 Make_Procedure_Call_Statement (Loc,
12614 Name => New_Reference_To (RTE (RE_Install_Handlers), Loc),
12615 Parameter_Associations => Args));
12621 end Make_Initialize_Protection;
12623 ---------------------------
12624 -- Make_Task_Create_Call --
12625 ---------------------------
12627 function Make_Task_Create_Call (Task_Rec : Entity_Id) return Node_Id is
12628 Loc : constant Source_Ptr := Sloc (Task_Rec);
12638 Ttyp := Corresponding_Concurrent_Type (Task_Rec);
12639 Tnam := Chars (Ttyp);
12641 -- Get task declaration. In the case of a task type declaration, this is
12642 -- simply the parent of the task type entity. In the single task
12643 -- declaration, this parent will be the implicit type, and we can find
12644 -- the corresponding single task declaration by searching forward in the
12645 -- declaration list in the tree.
12647 -- Is the test for N_Single_Task_Declaration needed here??? Nodes of
12648 -- this type should have been removed during semantic analysis.
12650 Tdec := Parent (Ttyp);
12651 while not Nkind_In (Tdec, N_Task_Type_Declaration,
12652 N_Single_Task_Declaration)
12657 -- Now we can find the task definition from this declaration
12659 Tdef := Task_Definition (Tdec);
12661 -- Build the parameter list for the call. Note that _Init is the name
12662 -- of the formal for the object to be initialized, which is the task
12663 -- value record itself.
12667 -- Priority parameter. Set to Unspecified_Priority unless there is a
12668 -- priority pragma, in which case we take the value from the pragma.
12670 if Present (Tdef) and then Has_Pragma_Priority (Tdef) then
12672 Make_Selected_Component (Loc,
12673 Prefix => Make_Identifier (Loc, Name_uInit),
12674 Selector_Name => Make_Identifier (Loc, Name_uPriority)));
12677 New_Reference_To (RTE (RE_Unspecified_Priority), Loc));
12680 -- Optional Stack parameter
12682 if Restricted_Profile then
12684 -- If the stack has been preallocated by the expander then
12685 -- pass its address. Otherwise, pass a null address.
12687 if Preallocated_Stacks_On_Target then
12689 Make_Attribute_Reference (Loc,
12691 Make_Selected_Component (Loc,
12692 Prefix => Make_Identifier (Loc, Name_uInit),
12693 Selector_Name => Make_Identifier (Loc, Name_uStack)),
12694 Attribute_Name => Name_Address));
12698 New_Reference_To (RTE (RE_Null_Address), Loc));
12702 -- Size parameter. If no Storage_Size pragma is present, then
12703 -- the size is taken from the taskZ variable for the type, which
12704 -- is either Unspecified_Size, or has been reset by the use of
12705 -- a Storage_Size attribute definition clause. If a pragma is
12706 -- present, then the size is taken from the _Size field of the
12707 -- task value record, which was set from the pragma value.
12710 and then Has_Storage_Size_Pragma (Tdef)
12713 Make_Selected_Component (Loc,
12714 Prefix => Make_Identifier (Loc, Name_uInit),
12715 Selector_Name => Make_Identifier (Loc, Name_uSize)));
12719 New_Reference_To (Storage_Size_Variable (Ttyp), Loc));
12722 -- Task_Info parameter. Set to Unspecified_Task_Info unless there is a
12723 -- Task_Info pragma, in which case we take the value from the pragma.
12726 and then Has_Task_Info_Pragma (Tdef)
12729 Make_Selected_Component (Loc,
12730 Prefix => Make_Identifier (Loc, Name_uInit),
12731 Selector_Name => Make_Identifier (Loc, Name_uTask_Info)));
12735 New_Reference_To (RTE (RE_Unspecified_Task_Info), Loc));
12738 -- CPU parameter. Set to Unspecified_CPU unless there is a CPU pragma,
12739 -- in which case we take the value from the pragma. The parameter is
12740 -- passed as an Integer because in the case of unspecified CPU the
12741 -- value is not in the range of CPU_Range.
12743 if Present (Tdef) and then Has_Pragma_CPU (Tdef) then
12745 Convert_To (Standard_Integer,
12746 Make_Selected_Component (Loc,
12747 Prefix => Make_Identifier (Loc, Name_uInit),
12748 Selector_Name => Make_Identifier (Loc, Name_uCPU))));
12752 New_Reference_To (RTE (RE_Unspecified_CPU), Loc));
12755 if not Restricted_Profile then
12757 -- Deadline parameter. If no Relative_Deadline pragma is present,
12758 -- then the deadline is Time_Span_Zero. If a pragma is present, then
12759 -- the deadline is taken from the _Relative_Deadline field of the
12760 -- task value record, which was set from the pragma value. Note that
12761 -- this parameter must not be generated for the restricted profiles
12762 -- since Ravenscar does not allow deadlines.
12764 -- Case where pragma Relative_Deadline applies: use given value
12766 if Present (Tdef) and then Has_Relative_Deadline_Pragma (Tdef) then
12768 Make_Selected_Component (Loc,
12770 Make_Identifier (Loc, Name_uInit),
12772 Make_Identifier (Loc, Name_uRelative_Deadline)));
12774 -- No pragma Relative_Deadline apply to the task
12778 New_Reference_To (RTE (RE_Time_Span_Zero), Loc));
12781 -- Number of entries. This is an expression of the form:
12783 -- n + _Init.a'Length + _Init.a'B'Length + ...
12785 -- where a,b... are the entry family names for the task definition
12788 Build_Entry_Count_Expression
12793 (Parent (Corresponding_Record_Type (Ttyp))))),
12795 Append_To (Args, Ecount);
12797 -- Master parameter. This is a reference to the _Master parameter of
12798 -- the initialization procedure, except in the case of the pragma
12799 -- Restrictions (No_Task_Hierarchy) where the value is fixed to
12800 -- System.Tasking.Library_Task_Level.
12802 if Restriction_Active (No_Task_Hierarchy) = False then
12803 Append_To (Args, Make_Identifier (Loc, Name_uMaster));
12806 New_Occurrence_Of (RTE (RE_Library_Task_Level), Loc));
12810 -- State parameter. This is a pointer to the task body procedure. The
12811 -- required value is obtained by taking 'Unrestricted_Access of the task
12812 -- body procedure and converting it (with an unchecked conversion) to
12813 -- the type required by the task kernel. For further details, see the
12814 -- description of Expand_N_Task_Body. We use 'Unrestricted_Access rather
12815 -- than 'Address in order to avoid creating trampolines.
12818 Body_Proc : constant Node_Id := Get_Task_Body_Procedure (Ttyp);
12819 Subp_Ptr_Typ : constant Node_Id :=
12820 Create_Itype (E_Access_Subprogram_Type, Tdec);
12821 Ref : constant Node_Id := Make_Itype_Reference (Loc);
12824 Set_Directly_Designated_Type (Subp_Ptr_Typ, Body_Proc);
12825 Set_Etype (Subp_Ptr_Typ, Subp_Ptr_Typ);
12827 -- Be sure to freeze a reference to the access-to-subprogram type,
12828 -- otherwise gigi will complain that it's in the wrong scope, because
12829 -- it's actually inside the init procedure for the record type that
12830 -- corresponds to the task type.
12832 -- This processing is causing a crash in the .NET/JVM back ends that
12833 -- is not yet understood, so skip it in these cases ???
12835 if VM_Target = No_VM then
12836 Set_Itype (Ref, Subp_Ptr_Typ);
12837 Append_Freeze_Action (Task_Rec, Ref);
12840 Unchecked_Convert_To (RTE (RE_Task_Procedure_Access),
12841 Make_Qualified_Expression (Loc,
12842 Subtype_Mark => New_Reference_To (Subp_Ptr_Typ, Loc),
12844 Make_Attribute_Reference (Loc,
12846 New_Occurrence_Of (Body_Proc, Loc),
12847 Attribute_Name => Name_Unrestricted_Access))));
12849 -- For the .NET/JVM cases revert to the original code below ???
12853 Unchecked_Convert_To (RTE (RE_Task_Procedure_Access),
12854 Make_Attribute_Reference (Loc,
12856 New_Occurrence_Of (Body_Proc, Loc),
12857 Attribute_Name => Name_Address)));
12861 -- Discriminants parameter. This is just the address of the task
12862 -- value record itself (which contains the discriminant values
12865 Make_Attribute_Reference (Loc,
12866 Prefix => Make_Identifier (Loc, Name_uInit),
12867 Attribute_Name => Name_Address));
12869 -- Elaborated parameter. This is an access to the elaboration Boolean
12872 Make_Attribute_Reference (Loc,
12873 Prefix => Make_Identifier (Loc, New_External_Name (Tnam, 'E')),
12874 Attribute_Name => Name_Unchecked_Access));
12876 -- Chain parameter. This is a reference to the _Chain parameter of
12877 -- the initialization procedure.
12879 Append_To (Args, Make_Identifier (Loc, Name_uChain));
12881 -- Task name parameter. Take this from the _Task_Id parameter to the
12882 -- init call unless there is a Task_Name pragma, in which case we take
12883 -- the value from the pragma.
12886 and then Has_Task_Name_Pragma (Tdef)
12888 -- Copy expression in full, because it may be dynamic and have
12894 (Pragma_Argument_Associations
12895 (Find_Task_Or_Protected_Pragma
12896 (Tdef, Name_Task_Name))))));
12899 Append_To (Args, Make_Identifier (Loc, Name_uTask_Name));
12902 -- Created_Task parameter. This is the _Task_Id field of the task
12906 Make_Selected_Component (Loc,
12907 Prefix => Make_Identifier (Loc, Name_uInit),
12908 Selector_Name => Make_Identifier (Loc, Name_uTask_Id)));
12910 -- Build_Entry_Names generation flag. When set to true, the runtime
12911 -- will allocate an array to hold the string names of task entries.
12913 if not Restricted_Profile then
12914 if Has_Entries (Ttyp)
12915 and then Entry_Names_OK
12917 Append_To (Args, New_Reference_To (Standard_True, Loc));
12919 Append_To (Args, New_Reference_To (Standard_False, Loc));
12923 if Restricted_Profile then
12924 Name := New_Reference_To (RTE (RE_Create_Restricted_Task), Loc);
12926 Name := New_Reference_To (RTE (RE_Create_Task), Loc);
12930 Make_Procedure_Call_Statement (Loc,
12932 Parameter_Associations => Args);
12933 end Make_Task_Create_Call;
12935 ------------------------------
12936 -- Next_Protected_Operation --
12937 ------------------------------
12939 function Next_Protected_Operation (N : Node_Id) return Node_Id is
12943 Next_Op := Next (N);
12944 while Present (Next_Op)
12945 and then not Nkind_In (Next_Op, N_Subprogram_Body, N_Entry_Body)
12951 end Next_Protected_Operation;
12953 ---------------------
12954 -- Null_Statements --
12955 ---------------------
12957 function Null_Statements (Stats : List_Id) return Boolean is
12961 Stmt := First (Stats);
12962 while Nkind (Stmt) /= N_Empty
12963 and then (Nkind_In (Stmt, N_Null_Statement, N_Label)
12965 (Nkind (Stmt) = N_Pragma
12966 and then (Pragma_Name (Stmt) = Name_Unreferenced
12968 Pragma_Name (Stmt) = Name_Unmodified
12970 Pragma_Name (Stmt) = Name_Warnings)))
12975 return Nkind (Stmt) = N_Empty;
12976 end Null_Statements;
12978 --------------------------
12979 -- Parameter_Block_Pack --
12980 --------------------------
12982 function Parameter_Block_Pack
12984 Blk_Typ : Entity_Id;
12988 Stmts : List_Id) return Node_Id
12990 Actual : Entity_Id;
12991 Expr : Node_Id := Empty;
12992 Formal : Entity_Id;
12993 Has_Param : Boolean := False;
12996 Temp_Asn : Node_Id;
12997 Temp_Nam : Node_Id;
13000 Actual := First (Actuals);
13001 Formal := Defining_Identifier (First (Formals));
13002 Params := New_List;
13004 while Present (Actual) loop
13005 if Is_By_Copy_Type (Etype (Actual)) then
13007 -- Jnn : aliased <formal-type>
13009 Temp_Nam := Make_Temporary (Loc, 'J');
13012 Make_Object_Declaration (Loc,
13015 Defining_Identifier =>
13017 Object_Definition =>
13018 New_Reference_To (Etype (Formal), Loc)));
13020 if Ekind (Formal) /= E_Out_Parameter then
13026 New_Reference_To (Temp_Nam, Loc);
13028 Set_Assignment_OK (Temp_Asn);
13031 Make_Assignment_Statement (Loc,
13035 New_Copy_Tree (Actual)));
13039 -- Jnn'unchecked_access
13042 Make_Attribute_Reference (Loc,
13044 Name_Unchecked_Access,
13046 New_Reference_To (Temp_Nam, Loc)));
13050 -- The controlling parameter is omitted
13053 if not Is_Controlling_Actual (Actual) then
13055 Make_Reference (Loc, New_Copy_Tree (Actual)));
13061 Next_Actual (Actual);
13062 Next_Formal_With_Extras (Formal);
13066 Expr := Make_Aggregate (Loc, Params);
13071 -- J1'unchecked_access;
13072 -- <actual2>'reference;
13075 P := Make_Temporary (Loc, 'P');
13078 Make_Object_Declaration (Loc,
13079 Defining_Identifier =>
13081 Object_Definition =>
13082 New_Reference_To (Blk_Typ, Loc),
13087 end Parameter_Block_Pack;
13089 ----------------------------
13090 -- Parameter_Block_Unpack --
13091 ----------------------------
13093 function Parameter_Block_Unpack
13097 Formals : List_Id) return List_Id
13099 Actual : Entity_Id;
13101 Formal : Entity_Id;
13102 Has_Asnmt : Boolean := False;
13103 Result : constant List_Id := New_List;
13106 Actual := First (Actuals);
13107 Formal := Defining_Identifier (First (Formals));
13108 while Present (Actual) loop
13109 if Is_By_Copy_Type (Etype (Actual))
13110 and then Ekind (Formal) /= E_In_Parameter
13113 -- <actual> := P.<formal>;
13116 Make_Assignment_Statement (Loc,
13120 Make_Explicit_Dereference (Loc,
13121 Make_Selected_Component (Loc,
13123 New_Reference_To (P, Loc),
13125 Make_Identifier (Loc, Chars (Formal)))));
13127 Set_Assignment_OK (Name (Asnmt));
13128 Append_To (Result, Asnmt);
13133 Next_Actual (Actual);
13134 Next_Formal_With_Extras (Formal);
13140 return New_List (Make_Null_Statement (Loc));
13142 end Parameter_Block_Unpack;
13144 ----------------------
13145 -- Set_Discriminals --
13146 ----------------------
13148 procedure Set_Discriminals (Dec : Node_Id) is
13151 D_Minal : Entity_Id;
13154 pragma Assert (Nkind (Dec) = N_Protected_Type_Declaration);
13155 Pdef := Defining_Identifier (Dec);
13157 if Has_Discriminants (Pdef) then
13158 D := First_Discriminant (Pdef);
13159 while Present (D) loop
13161 Make_Defining_Identifier (Sloc (D),
13162 Chars => New_External_Name (Chars (D), 'D'));
13164 Set_Ekind (D_Minal, E_Constant);
13165 Set_Etype (D_Minal, Etype (D));
13166 Set_Scope (D_Minal, Pdef);
13167 Set_Discriminal (D, D_Minal);
13168 Set_Discriminal_Link (D_Minal, D);
13170 Next_Discriminant (D);
13173 end Set_Discriminals;
13175 -----------------------
13176 -- Trivial_Accept_OK --
13177 -----------------------
13179 function Trivial_Accept_OK return Boolean is
13181 case Opt.Task_Dispatching_Policy is
13183 -- If we have the default task dispatching policy in effect, we can
13184 -- definitely do the optimization (one way of looking at this is to
13185 -- think of the formal definition of the default policy being allowed
13186 -- to run any task it likes after a rendezvous, so even if notionally
13187 -- a full rescheduling occurs, we can say that our dispatching policy
13188 -- (i.e. the default dispatching policy) reorders the queue to be the
13189 -- same as just before the call.
13194 -- FIFO_Within_Priorities certainly does not permit this
13195 -- optimization since the Rendezvous is a scheduling action that may
13196 -- require some other task to be run.
13201 -- For now, disallow the optimization for all other policies. This
13202 -- may be over-conservative, but it is certainly not incorrect.
13208 end Trivial_Accept_OK;