1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2008, 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_Ch11; use Exp_Ch11;
33 with Exp_Ch6; use Exp_Ch6;
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_Res; use Sem_Res;
57 with Sem_Util; use Sem_Util;
58 with Sinfo; use Sinfo;
59 with Snames; use Snames;
60 with Stand; use Stand;
61 with Stringt; use Stringt;
62 with Targparm; use Targparm;
63 with Tbuild; use Tbuild;
64 with Uintp; use Uintp;
66 package body Exp_Ch9 is
68 -- The following constant establishes the upper bound for the index of
69 -- an entry family. It is used to limit the allocated size of protected
70 -- types with defaulted discriminant of an integer type, when the bound
71 -- of some entry family depends on a discriminant. The limitation to
72 -- entry families of 128K should be reasonable in all cases, and is a
73 -- documented implementation restriction. It will be lifted when protected
74 -- entry families are re-implemented as a single ordered queue.
76 Entry_Family_Bound : constant Int := 2**16;
78 -----------------------
79 -- Local Subprograms --
80 -----------------------
82 function Actual_Index_Expression
86 Tsk : Entity_Id) return Node_Id;
87 -- Compute the index position for an entry call. Tsk is the target task. If
88 -- the bounds of some entry family depend on discriminants, the expression
89 -- computed by this function uses the discriminants of the target task.
91 procedure Add_Object_Pointer
95 -- Prepend an object pointer declaration to the declaration list Decls.
96 -- This object pointer is initialized to a type conversion of the System.
97 -- Address pointer passed to entry barrier functions and entry body
100 procedure Add_Formal_Renamings
105 -- Create renaming declarations for the formals, inside the procedure that
106 -- implements an entry body. The renamings make the original names of the
107 -- formals accessible to gdb, and serve no other purpose.
108 -- Spec is the specification of the procedure being built.
109 -- Decls is the list of declarations to be enhanced.
110 -- Ent is the entity for the original entry body.
112 function Build_Accept_Body (Astat : Node_Id) return Node_Id;
113 -- Transform accept statement into a block with added exception handler.
114 -- Used both for simple accept statements and for accept alternatives in
115 -- select statements. Astat is the accept statement.
117 function Build_Barrier_Function
120 Pid : Node_Id) return Node_Id;
121 -- Build the function body returning the value of the barrier expression
122 -- for the specified entry body.
124 function Build_Barrier_Function_Specification
126 Def_Id : Entity_Id) return Node_Id;
127 -- Build a specification for a function implementing the protected entry
128 -- barrier of the specified entry body.
130 function Build_Entry_Count_Expression
131 (Concurrent_Type : Node_Id;
132 Component_List : List_Id;
133 Loc : Source_Ptr) return Node_Id;
134 -- Compute number of entries for concurrent object. This is a count of
135 -- simple entries, followed by an expression that computes the length
136 -- of the range of each entry family. A single array with that size is
137 -- allocated for each concurrent object of the type.
139 function Build_Parameter_Block
143 Decls : List_Id) return Entity_Id;
144 -- Generate an access type for each actual parameter in the list Actuals.
145 -- Create an encapsulating record that contains all the actuals and return
146 -- its type. Generate:
147 -- type Ann1 is access all <actual1-type>
149 -- type AnnN is access all <actualN-type>
150 -- type Pnn is record
156 procedure Build_Wrapper_Bodies
160 -- Ada 2005 (AI-345): Typ is either a concurrent type or the corresponding
161 -- record of a concurrent type. N is the insertion node where all bodies
162 -- will be placed. This routine builds the bodies of the subprograms which
163 -- serve as an indirection mechanism to overriding primitives of concurrent
164 -- types, entries and protected procedures. Any new body is analyzed.
166 procedure Build_Wrapper_Specs
170 -- Ada 2005 (AI-345): Typ is either a concurrent type or the corresponding
171 -- record of a concurrent type. N is the insertion node where all specs
172 -- will be placed. This routine builds the specs of the subprograms which
173 -- serve as an indirection mechanism to overriding primitives of concurrent
174 -- types, entries and protected procedures. Any new spec is analyzed.
176 function Build_Find_Body_Index (Typ : Entity_Id) return Node_Id;
177 -- Build the function that translates the entry index in the call
178 -- (which depends on the size of entry families) into an index into the
179 -- Entry_Bodies_Array, to determine the body and barrier function used
180 -- in a protected entry call. A pointer to this function appears in every
183 function Build_Find_Body_Index_Spec (Typ : Entity_Id) return Node_Id;
184 -- Build subprogram declaration for previous one
186 function Build_Protected_Entry
189 Pid : Node_Id) return Node_Id;
190 -- Build the procedure implementing the statement sequence of the specified
193 function Build_Protected_Entry_Specification
196 Ent_Id : Entity_Id) return Node_Id;
197 -- Build a specification for the procedure implementing the statements of
198 -- the specified entry body. Add attributes associating it with the entry
199 -- defining identifier Ent_Id.
201 function Build_Protected_Spec
203 Obj_Type : Entity_Id;
205 Unprotected : Boolean := False) return List_Id;
206 -- Utility shared by Build_Protected_Sub_Spec and Expand_Access_Protected_
207 -- Subprogram_Type. Builds signature of protected subprogram, adding the
208 -- formal that corresponds to the object itself. For an access to protected
209 -- subprogram, there is no object type to specify, so the parameter has
210 -- type Address and mode In. An indirect call through such a pointer will
211 -- convert the address to a reference to the actual object. The object is
212 -- a limited record and therefore a by_reference type.
214 function Build_Protected_Subprogram_Body
217 N_Op_Spec : Node_Id) return Node_Id;
218 -- This function is used to construct the protected version of a protected
219 -- subprogram. Its statement sequence first defers abort, then locks
220 -- the associated protected object, and then enters a block that contains
221 -- a call to the unprotected version of the subprogram (for details, see
222 -- Build_Unprotected_Subprogram_Body). This block statement requires
223 -- a cleanup handler that unlocks the object in all cases.
224 -- (see Exp_Ch7.Expand_Cleanup_Actions).
226 function Build_Selected_Name
228 Selector : Entity_Id;
229 Append_Char : Character := ' ') return Name_Id;
230 -- Build a name in the form of Prefix__Selector, with an optional
231 -- character appended. This is used for internal subprograms generated
232 -- for operations of protected types, including barrier functions.
233 -- For the subprograms generated for entry bodies and entry barriers,
234 -- the generated name includes a sequence number that makes names
235 -- unique in the presence of entry overloading. This is necessary
236 -- because entry body procedures and barrier functions all have the
239 procedure Build_Simple_Entry_Call
244 -- Some comments here would be useful ???
246 function Build_Task_Proc_Specification (T : Entity_Id) return Node_Id;
247 -- This routine constructs a specification for the procedure that we will
248 -- build for the task body for task type T. The spec has the form:
250 -- procedure tnameB (_Task : access tnameV);
252 -- where name is the character name taken from the task type entity that
253 -- is passed as the argument to the procedure, and tnameV is the task
254 -- value type that is associated with the task type.
256 function Build_Unprotected_Subprogram_Body
258 Pid : Node_Id) return Node_Id;
259 -- This routine constructs the unprotected version of a protected
260 -- subprogram body, which is contains all of the code in the
261 -- original, unexpanded body. This is the version of the protected
262 -- subprogram that is called from all protected operations on the same
263 -- object, including the protected version of the same subprogram.
265 procedure Collect_Entry_Families
268 Current_Node : in out Node_Id;
269 Conctyp : Entity_Id);
270 -- For each entry family in a concurrent type, create an anonymous array
271 -- type of the right size, and add a component to the corresponding_record.
273 function Concurrent_Object
274 (Spec_Id : Entity_Id;
275 Conc_Typ : Entity_Id) return Entity_Id;
276 -- Given a subprogram entity Spec_Id and concurrent type Conc_Typ, return
277 -- the entity associated with the concurrent object in the Protected_Body_
278 -- Subprogram or the Task_Body_Procedure of Spec_Id. The returned entity
279 -- denotes formal parameter _O, _object or _task.
281 function Copy_Result_Type (Res : Node_Id) return Node_Id;
282 -- Copy the result type of a function specification, when building the
283 -- internal operation corresponding to a protected function, or when
284 -- expanding an access to protected function. If the result is an anonymous
285 -- access to subprogram itself, we need to create a new signature with the
286 -- same parameter names and the same resolved types, but with new entities
289 procedure Debug_Private_Data_Declarations (Decls : List_Id);
290 -- Decls is a list which may contain the declarations created by Install_
291 -- Private_Data_Declarations. All generated entities are marked as needing
292 -- debug info and debug nodes are manually generation where necessary. This
293 -- step of the expansion must to be done after private data has been moved
294 -- to its final resting scope to ensure proper visibility of debug objects.
296 function Family_Offset
301 Cap : Boolean) return Node_Id;
302 -- Compute (Hi - Lo) for two entry family indices. Hi is the index in
303 -- an accept statement, or the upper bound in the discrete subtype of
304 -- an entry declaration. Lo is the corresponding lower bound. Ttyp is
305 -- the concurrent type of the entry. If Cap is true, the result is
306 -- capped according to Entry_Family_Bound.
313 Cap : Boolean) return Node_Id;
314 -- Compute (Hi - Lo) + 1 Max 0, to determine the number of entries in
315 -- a family, and handle properly the superflat case. This is equivalent
316 -- to the use of 'Length on the index type, but must use Family_Offset
317 -- to handle properly the case of bounds that depend on discriminants.
318 -- If Cap is true, the result is capped according to Entry_Family_Bound.
320 procedure Extract_Dispatching_Call
322 Call_Ent : out Entity_Id;
323 Object : out Entity_Id;
324 Actuals : out List_Id;
325 Formals : out List_Id);
326 -- Given a dispatching call, extract the entity of the name of the call,
327 -- its object parameter, its actual parameters and the formal parameters
328 -- of the overridden interface-level version.
330 procedure Extract_Entry
332 Concval : out Node_Id;
334 Index : out Node_Id);
335 -- Given an entry call, returns the associated concurrent object,
336 -- the entry name, and the entry family index.
338 function Find_Task_Or_Protected_Pragma
340 P : Name_Id) return Node_Id;
341 -- Searches the task or protected definition T for the first occurrence
342 -- of the pragma whose name is given by P. The caller has ensured that
343 -- the pragma is present in the task definition. A special case is that
344 -- when P is Name_uPriority, the call will also find Interrupt_Priority.
345 -- ??? Should be implemented with the rep item chain mechanism.
347 function Index_Object (Spec_Id : Entity_Id) return Entity_Id;
348 -- Given a subprogram identifier, return the entity which is associated
349 -- with the protection entry index in the Protected_Body_Subprogram or the
350 -- Task_Body_Procedure of Spec_Id. The returned entity denotes formal
353 function Is_Potentially_Large_Family
354 (Base_Index : Entity_Id;
357 Hi : Node_Id) return Boolean;
359 function Is_Private_Primitive_Subprogram (Id : Entity_Id) return Boolean;
360 -- Determine whether Id is a function or a procedure and is marked as a
361 -- private primitive.
363 function Null_Statements (Stats : List_Id) return Boolean;
364 -- Used to check DO-END sequence. Checks for equivalent of DO NULL; END.
365 -- Allows labels, and pragma Warnings/Unreferenced in the sequence as
366 -- well to still count as null. Returns True for a null sequence. The
367 -- argument is the list of statements from the DO-END sequence.
369 function Parameter_Block_Pack
375 Stmts : List_Id) return Entity_Id;
376 -- Set the components of the generated parameter block with the values of
377 -- the actual parameters. Generate aliased temporaries to capture the
378 -- values for types that are passed by copy. Otherwise generate a reference
379 -- to the actual's value. Return the address of the aggregate block.
381 -- Jnn1 : alias <formal-type1>;
382 -- Jnn1 := <actual1>;
385 -- Jnn1'unchecked_access;
386 -- <actual2>'reference;
389 function Parameter_Block_Unpack
393 Formals : List_Id) return List_Id;
394 -- Retrieve the values of the components from the parameter block and
395 -- assign then to the original actual parameters. Generate:
396 -- <actual1> := P.<formal1>;
398 -- <actualN> := P.<formalN>;
400 function Trivial_Accept_OK return Boolean;
401 -- If there is no DO-END block for an accept, or if the DO-END block has
402 -- only null statements, then it is possible to do the Rendezvous with much
403 -- less overhead using the Accept_Trivial routine in the run-time library.
404 -- However, this is not always a valid optimization. Whether it is valid or
405 -- not depends on the Task_Dispatching_Policy. The issue is whether a full
406 -- rescheduling action is required or not. In FIFO_Within_Priorities, such
407 -- a rescheduling is required, so this optimization is not allowed. This
408 -- function returns True if the optimization is permitted.
410 -----------------------------
411 -- Actual_Index_Expression --
412 -----------------------------
414 function Actual_Index_Expression
418 Tsk : Entity_Id) return Node_Id
420 Ttyp : constant Entity_Id := Etype (Tsk);
428 function Actual_Family_Offset (Hi, Lo : Node_Id) return Node_Id;
429 -- Compute difference between bounds of entry family
431 --------------------------
432 -- Actual_Family_Offset --
433 --------------------------
435 function Actual_Family_Offset (Hi, Lo : Node_Id) return Node_Id is
437 function Actual_Discriminant_Ref (Bound : Node_Id) return Node_Id;
438 -- Replace a reference to a discriminant with a selected component
439 -- denoting the discriminant of the target task.
441 -----------------------------
442 -- Actual_Discriminant_Ref --
443 -----------------------------
445 function Actual_Discriminant_Ref (Bound : Node_Id) return Node_Id is
446 Typ : constant Entity_Id := Etype (Bound);
450 if not Is_Entity_Name (Bound)
451 or else Ekind (Entity (Bound)) /= E_Discriminant
453 if Nkind (Bound) = N_Attribute_Reference then
456 B := New_Copy_Tree (Bound);
461 Make_Selected_Component (Sloc,
462 Prefix => New_Copy_Tree (Tsk),
463 Selector_Name => New_Occurrence_Of (Entity (Bound), Sloc));
465 Analyze_And_Resolve (B, Typ);
469 Make_Attribute_Reference (Sloc,
470 Attribute_Name => Name_Pos,
471 Prefix => New_Occurrence_Of (Etype (Bound), Sloc),
472 Expressions => New_List (B));
473 end Actual_Discriminant_Ref;
475 -- Start of processing for Actual_Family_Offset
479 Make_Op_Subtract (Sloc,
480 Left_Opnd => Actual_Discriminant_Ref (Hi),
481 Right_Opnd => Actual_Discriminant_Ref (Lo));
482 end Actual_Family_Offset;
484 -- Start of processing for Actual_Index_Expression
487 -- The queues of entries and entry families appear in textual order in
488 -- the associated record. The entry index is computed as the sum of the
489 -- number of queues for all entries that precede the designated one, to
490 -- which is added the index expression, if this expression denotes a
491 -- member of a family.
493 -- The following is a place holder for the count of simple entries
495 Num := Make_Integer_Literal (Sloc, 1);
497 -- We construct an expression which is a series of addition operations.
498 -- See comments in Entry_Index_Expression, which is identical in
501 if Present (Index) then
502 S := Etype (Discrete_Subtype_Definition (Declaration_Node (Ent)));
509 Actual_Family_Offset (
510 Make_Attribute_Reference (Sloc,
511 Attribute_Name => Name_Pos,
512 Prefix => New_Reference_To (Base_Type (S), Sloc),
513 Expressions => New_List (Relocate_Node (Index))),
514 Type_Low_Bound (S)));
519 -- Now add lengths of preceding entries and entry families
521 Prev := First_Entity (Ttyp);
523 while Chars (Prev) /= Chars (Ent)
524 or else (Ekind (Prev) /= Ekind (Ent))
525 or else not Sem_Ch6.Type_Conformant (Ent, Prev)
527 if Ekind (Prev) = E_Entry then
528 Set_Intval (Num, Intval (Num) + 1);
530 elsif Ekind (Prev) = E_Entry_Family then
532 Etype (Discrete_Subtype_Definition (Declaration_Node (Prev)));
534 -- The need for the following full view retrieval stems from
535 -- this complex case of nested generics and tasking:
538 -- type Formal_Index is range <>;
541 -- type Index is private;
548 -- type Index is new Formal_Index range 1 .. 10;
551 -- package body Outer is
553 -- entry Fam (Index); -- (2)
556 -- package body Inner is -- (3)
564 -- We are currently building the index expression for the entry
565 -- call "T.E" (1). Part of the expansion must mention the range
566 -- of the discrete type "Index" (2) of entry family "Fam".
567 -- However only the private view of type "Index" is available to
568 -- the inner generic (3) because there was no prior mention of
569 -- the type inside "Inner". This visibility requirement is
570 -- implicit and cannot be detected during the construction of
571 -- the generic trees and needs special handling.
574 and then Is_Private_Type (S)
575 and then Present (Full_View (S))
580 Lo := Type_Low_Bound (S);
581 Hi := Type_High_Bound (S);
589 Actual_Family_Offset (Hi, Lo),
591 Make_Integer_Literal (Sloc, 1)));
593 -- Other components are anonymous types to be ignored
603 end Actual_Index_Expression;
605 --------------------------
606 -- Add_Formal_Renamings --
607 --------------------------
609 procedure Add_Formal_Renamings
615 Ptr : constant Entity_Id :=
617 (Next (First (Parameter_Specifications (Spec))));
618 -- The name of the formal that holds the address of the parameter block
627 Formal := First_Formal (Ent);
628 while Present (Formal) loop
629 Comp := Entry_Component (Formal);
631 Make_Defining_Identifier (Sloc (Formal),
632 Chars => Chars (Formal));
633 Set_Etype (New_F, Etype (Formal));
634 Set_Scope (New_F, Ent);
636 -- Now we set debug info needed on New_F even though it does not
637 -- come from source, so that the debugger will get the right
638 -- information for these generated names.
640 Set_Debug_Info_Needed (New_F);
642 if Ekind (Formal) = E_In_Parameter then
643 Set_Ekind (New_F, E_Constant);
645 Set_Ekind (New_F, E_Variable);
646 Set_Extra_Constrained (New_F, Extra_Constrained (Formal));
649 Set_Actual_Subtype (New_F, Actual_Subtype (Formal));
652 Make_Object_Renaming_Declaration (Loc,
653 Defining_Identifier => New_F,
655 New_Reference_To (Etype (Formal), Loc),
657 Make_Explicit_Dereference (Loc,
658 Make_Selected_Component (Loc,
660 Unchecked_Convert_To (Entry_Parameters_Type (Ent),
661 Make_Identifier (Loc, Chars (Ptr))),
663 New_Reference_To (Comp, Loc))));
665 Append (Decl, Decls);
666 Set_Renamed_Object (Formal, New_F);
667 Next_Formal (Formal);
669 end Add_Formal_Renamings;
671 ------------------------
672 -- Add_Object_Pointer --
673 ------------------------
675 procedure Add_Object_Pointer
677 Conc_Typ : Entity_Id;
680 Rec_Typ : constant Entity_Id := Corresponding_Record_Type (Conc_Typ);
685 -- Create the renaming declaration for the Protection object of a
686 -- protected type. _Object is used by Complete_Entry_Body.
687 -- ??? An attempt to make this a renaming was unsuccessful.
689 -- Build the entity for the access type
692 Make_Defining_Identifier (Loc,
693 New_External_Name (Chars (Rec_Typ), 'P'));
696 -- _object : poVP := poVP!O;
699 Make_Object_Declaration (Loc,
700 Defining_Identifier =>
701 Make_Defining_Identifier (Loc, Name_uObject),
703 New_Reference_To (Obj_Ptr, Loc),
705 Unchecked_Convert_To (Obj_Ptr,
706 Make_Identifier (Loc, Name_uO)));
707 Set_Debug_Info_Needed (Defining_Identifier (Decl));
708 Prepend_To (Decls, Decl);
711 -- type poVP is access poV;
714 Make_Full_Type_Declaration (Loc,
715 Defining_Identifier =>
718 Make_Access_To_Object_Definition (Loc,
719 Subtype_Indication =>
720 New_Reference_To (Rec_Typ, Loc)));
721 Set_Debug_Info_Needed (Defining_Identifier (Decl));
722 Prepend_To (Decls, Decl);
723 end Add_Object_Pointer;
725 -----------------------
726 -- Build_Accept_Body --
727 -----------------------
729 function Build_Accept_Body (Astat : Node_Id) return Node_Id is
730 Loc : constant Source_Ptr := Sloc (Astat);
731 Stats : constant Node_Id := Handled_Statement_Sequence (Astat);
738 -- At the end of the statement sequence, Complete_Rendezvous is called.
739 -- A label skipping the Complete_Rendezvous, and all other accept
740 -- processing, has already been added for the expansion of requeue
743 Call := Build_Runtime_Call (No_Location, RE_Complete_Rendezvous);
744 Insert_Before (Last (Statements (Stats)), Call);
747 -- If exception handlers are present, then append Complete_Rendezvous
748 -- calls to the handlers, and construct the required outer block.
750 if Present (Exception_Handlers (Stats)) then
751 Hand := First (Exception_Handlers (Stats));
753 while Present (Hand) loop
754 Call := Build_Runtime_Call (No_Location, RE_Complete_Rendezvous);
755 Append (Call, Statements (Hand));
761 Make_Handled_Sequence_Of_Statements (Loc,
762 Statements => New_List (
763 Make_Block_Statement (Loc,
764 Handled_Statement_Sequence => Stats)));
770 -- At this stage we know that the new statement sequence does not
771 -- have an exception handler part, so we supply one to call
772 -- Exceptional_Complete_Rendezvous. This handler is
774 -- when all others =>
775 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
777 -- We handle Abort_Signal to make sure that we properly catch the abort
778 -- case and wake up the caller.
780 Ohandle := Make_Others_Choice (Loc);
781 Set_All_Others (Ohandle);
783 Set_Exception_Handlers (New_S,
785 Make_Implicit_Exception_Handler (Loc,
786 Exception_Choices => New_List (Ohandle),
788 Statements => New_List (
789 Make_Procedure_Call_Statement (No_Location,
790 Name => New_Reference_To (
791 RTE (RE_Exceptional_Complete_Rendezvous), No_Location),
792 Parameter_Associations => New_List (
793 Make_Function_Call (No_Location,
794 Name => New_Reference_To (
795 RTE (RE_Get_GNAT_Exception), No_Location))))))));
797 Set_Parent (New_S, Astat); -- temp parent for Analyze call
798 Analyze_Exception_Handlers (Exception_Handlers (New_S));
799 Expand_Exception_Handlers (New_S);
801 -- Exceptional_Complete_Rendezvous must be called with abort
802 -- still deferred, which is the case for a "when all others" handler.
805 end Build_Accept_Body;
807 -----------------------------------
808 -- Build_Activation_Chain_Entity --
809 -----------------------------------
811 procedure Build_Activation_Chain_Entity (N : Node_Id) is
817 -- Loop to find enclosing construct containing activation chain variable
821 while not Nkind_In (P, N_Subprogram_Body,
822 N_Package_Declaration,
826 N_Extended_Return_Statement)
831 -- If we are in a package body, the activation chain variable is
832 -- declared in the body, but the Activation_Chain_Entity is attached to
835 if Nkind (P) = N_Package_Body then
836 Decls := Declarations (P);
837 P := Unit_Declaration_Node (Corresponding_Spec (P));
839 elsif Nkind (P) = N_Package_Declaration then
840 Decls := Visible_Declarations (Specification (P));
842 elsif Nkind (P) = N_Extended_Return_Statement then
843 Decls := Return_Object_Declarations (P);
846 Decls := Declarations (P);
849 -- If activation chain entity not already declared, declare it
851 if Nkind (P) = N_Extended_Return_Statement
852 or else No (Activation_Chain_Entity (P))
854 Chain := Make_Defining_Identifier (Sloc (N), Name_uChain);
856 -- Note: An extended return statement is not really a task activator,
857 -- but it does have an activation chain on which to store the tasks
858 -- temporarily. On successful return, the tasks on this chain are
859 -- moved to the chain passed in by the caller. We do not build an
860 -- Activation_Chain_Entity for an N_Extended_Return_Statement,
861 -- because we do not want to build a call to Activate_Tasks. Task
862 -- activation is the responsibility of the caller.
864 if Nkind (P) /= N_Extended_Return_Statement then
865 Set_Activation_Chain_Entity (P, Chain);
869 Make_Object_Declaration (Sloc (P),
870 Defining_Identifier => Chain,
871 Aliased_Present => True,
873 New_Reference_To (RTE (RE_Activation_Chain), Sloc (P))));
875 Analyze (First (Decls));
877 end Build_Activation_Chain_Entity;
879 ----------------------------
880 -- Build_Barrier_Function --
881 ----------------------------
883 function Build_Barrier_Function
886 Pid : Node_Id) return Node_Id
888 Loc : constant Source_Ptr := Sloc (N);
889 Func_Id : constant Entity_Id := Barrier_Function (Ent);
890 Ent_Formals : constant Node_Id := Entry_Body_Formal_Part (N);
891 Op_Decls : constant List_Id := New_List;
895 -- Add a declaration for the Protection object, renaming declarations
896 -- for the discriminals and privals and finally a declaration for the
897 -- entry family index (if applicable).
899 Install_Private_Data_Declarations
900 (Loc, Func_Id, Pid, N, Op_Decls, True, Ekind (Ent) = E_Entry_Family);
902 -- Note: the condition in the barrier function needs to be properly
903 -- processed for the C/Fortran boolean possibility, but this happens
904 -- automatically since the return statement does this normalization.
907 Make_Subprogram_Body (Loc,
909 Build_Barrier_Function_Specification (Loc,
910 Make_Defining_Identifier (Loc, Chars (Func_Id))),
911 Declarations => Op_Decls,
912 Handled_Statement_Sequence =>
913 Make_Handled_Sequence_Of_Statements (Loc,
914 Statements => New_List (
915 Make_Simple_Return_Statement (Loc,
916 Expression => Condition (Ent_Formals)))));
917 Set_Is_Entry_Barrier_Function (Func_Body);
920 end Build_Barrier_Function;
922 ------------------------------------------
923 -- Build_Barrier_Function_Specification --
924 ------------------------------------------
926 function Build_Barrier_Function_Specification
928 Def_Id : Entity_Id) return Node_Id
931 Set_Debug_Info_Needed (Def_Id);
933 return Make_Function_Specification (Loc,
934 Defining_Unit_Name => Def_Id,
935 Parameter_Specifications => New_List (
936 Make_Parameter_Specification (Loc,
937 Defining_Identifier =>
938 Make_Defining_Identifier (Loc, Name_uO),
940 New_Reference_To (RTE (RE_Address), Loc)),
942 Make_Parameter_Specification (Loc,
943 Defining_Identifier =>
944 Make_Defining_Identifier (Loc, Name_uE),
946 New_Reference_To (RTE (RE_Protected_Entry_Index), Loc))),
949 New_Reference_To (Standard_Boolean, Loc));
950 end Build_Barrier_Function_Specification;
952 --------------------------
953 -- Build_Call_With_Task --
954 --------------------------
956 function Build_Call_With_Task
958 E : Entity_Id) return Node_Id
960 Loc : constant Source_Ptr := Sloc (N);
963 Make_Function_Call (Loc,
964 Name => New_Reference_To (E, Loc),
965 Parameter_Associations => New_List (Concurrent_Ref (N)));
966 end Build_Call_With_Task;
968 --------------------------------
969 -- Build_Corresponding_Record --
970 --------------------------------
972 function Build_Corresponding_Record
975 Loc : Source_Ptr) return Node_Id
977 Rec_Ent : constant Entity_Id :=
978 Make_Defining_Identifier
979 (Loc, New_External_Name (Chars (Ctyp), 'V'));
982 New_Disc : Entity_Id;
986 Set_Corresponding_Record_Type (Ctyp, Rec_Ent);
987 Set_Ekind (Rec_Ent, E_Record_Type);
988 Set_Has_Delayed_Freeze (Rec_Ent, Has_Delayed_Freeze (Ctyp));
989 Set_Is_Concurrent_Record_Type (Rec_Ent, True);
990 Set_Corresponding_Concurrent_Type (Rec_Ent, Ctyp);
991 Set_Stored_Constraint (Rec_Ent, No_Elist);
994 -- Use discriminals to create list of discriminants for record, and
995 -- create new discriminals for use in default expressions, etc. It is
996 -- worth noting that a task discriminant gives rise to 5 entities;
998 -- a) The original discriminant.
999 -- b) The discriminal for use in the task.
1000 -- c) The discriminant of the corresponding record.
1001 -- d) The discriminal for the init proc of the corresponding record.
1002 -- e) The local variable that renames the discriminant in the procedure
1003 -- for the task body.
1005 -- In fact the discriminals b) are used in the renaming declarations
1006 -- for e). See details in einfo (Handling of Discriminants).
1008 if Present (Discriminant_Specifications (N)) then
1010 Disc := First_Discriminant (Ctyp);
1012 while Present (Disc) loop
1013 New_Disc := CR_Discriminant (Disc);
1016 Make_Discriminant_Specification (Loc,
1017 Defining_Identifier => New_Disc,
1018 Discriminant_Type =>
1019 New_Occurrence_Of (Etype (Disc), Loc),
1021 New_Copy (Discriminant_Default_Value (Disc))));
1023 Next_Discriminant (Disc);
1030 -- Now we can construct the record type declaration. Note that this
1031 -- record is "limited tagged". It is "limited" to reflect the underlying
1032 -- limitedness of the task or protected object that it represents, and
1033 -- ensuring for example that it is properly passed by reference. It is
1034 -- "tagged" to give support to dispatching calls through interfaces (Ada
1038 Make_Full_Type_Declaration (Loc,
1039 Defining_Identifier => Rec_Ent,
1040 Discriminant_Specifications => Dlist,
1042 Make_Record_Definition (Loc,
1044 Make_Component_List (Loc,
1045 Component_Items => Cdecls),
1047 Ada_Version >= Ada_05 and then Is_Tagged_Type (Ctyp),
1048 Limited_Present => True));
1049 end Build_Corresponding_Record;
1051 ----------------------------------
1052 -- Build_Entry_Count_Expression --
1053 ----------------------------------
1055 function Build_Entry_Count_Expression
1056 (Concurrent_Type : Node_Id;
1057 Component_List : List_Id;
1058 Loc : Source_Ptr) return Node_Id
1070 -- Count number of non-family entries
1073 Ent := First_Entity (Concurrent_Type);
1074 while Present (Ent) loop
1075 if Ekind (Ent) = E_Entry then
1082 Ecount := Make_Integer_Literal (Loc, Eindx);
1084 -- Loop through entry families building the addition nodes
1086 Ent := First_Entity (Concurrent_Type);
1087 Comp := First (Component_List);
1088 while Present (Ent) loop
1089 if Ekind (Ent) = E_Entry_Family then
1090 while Chars (Ent) /= Chars (Defining_Identifier (Comp)) loop
1094 Typ := Etype (Discrete_Subtype_Definition (Parent (Ent)));
1095 Hi := Type_High_Bound (Typ);
1096 Lo := Type_Low_Bound (Typ);
1097 Large := Is_Potentially_Large_Family
1098 (Base_Type (Typ), Concurrent_Type, Lo, Hi);
1101 Left_Opnd => Ecount,
1102 Right_Opnd => Family_Size
1103 (Loc, Hi, Lo, Concurrent_Type, Large));
1110 end Build_Entry_Count_Expression;
1112 -----------------------
1113 -- Build_Entry_Names --
1114 -----------------------
1116 function Build_Entry_Names (Conc_Typ : Entity_Id) return Node_Id is
1117 Loc : constant Source_Ptr := Sloc (Conc_Typ);
1123 Typ : Entity_Id := Conc_Typ;
1125 procedure Build_Entry_Family_Name (Id : Entity_Id);
1127 -- for Lnn in Family_Low .. Family_High loop
1130 -- (_init._object, Inn, new String ("<Entry name> " & Lnn'Img));
1133 -- Note that the bounds of the range may reference discriminants. The
1134 -- above construct is added directly to the statements of the block.
1136 procedure Build_Entry_Name (Id : Entity_Id);
1139 -- Set_Entry_Name (_init._task_id, Inn, new String ("<Entry name>");
1141 -- The above construct is added directly to the statements of the block.
1143 function Build_Set_Entry_Name_Call (Arg3 : Node_Id) return Node_Id;
1144 -- Generate the call to the runtime routine Set_Entry_Name with actuals
1145 -- _init._task_id or _init._object, Inn and Arg3.
1147 function Find_Protection_Type (Conc_Typ : Entity_Id) return Entity_Id;
1148 -- Given a protected type or its corresponding record, find the type of
1151 procedure Increment_Index (Stmts : List_Id);
1152 -- Generate the following and add it to Stmts
1155 -----------------------------
1156 -- Build_Entry_Family_Name --
1157 -----------------------------
1159 procedure Build_Entry_Family_Name (Id : Entity_Id) is
1160 Def : constant Node_Id :=
1161 Discrete_Subtype_Definition (Parent (Id));
1162 L_Id : constant Entity_Id :=
1163 Make_Defining_Identifier (Loc, New_Internal_Name ('L'));
1164 L_Stmts : constant List_Id := New_List;
1167 function Build_Range (Def : Node_Id) return Node_Id;
1168 -- Given a discrete subtype definition of an entry family, generate a
1169 -- range node which covers the range of Def's type.
1175 function Build_Range (Def : Node_Id) return Node_Id is
1176 High : Node_Id := Type_High_Bound (Etype (Def));
1177 Low : Node_Id := Type_Low_Bound (Etype (Def));
1180 -- If a bound references a discriminant, generate an identifier
1181 -- with the same name. Resolution will map it to the formals of
1184 if Is_Entity_Name (Low)
1185 and then Ekind (Entity (Low)) = E_Discriminant
1187 Low := Make_Identifier (Loc, Chars (Low));
1189 Low := New_Copy_Tree (Low);
1192 if Is_Entity_Name (High)
1193 and then Ekind (Entity (High)) = E_Discriminant
1195 High := Make_Identifier (Loc, Chars (High));
1197 High := New_Copy_Tree (High);
1203 High_Bound => High);
1206 -- Start of processing for Build_Entry_Family_Name
1209 Get_Name_String (Chars (Id));
1211 if Is_Enumeration_Type (Etype (Def)) then
1212 Name_Len := Name_Len + 1;
1213 Name_Buffer (Name_Len) := ' ';
1217 -- new String'("<Entry name>" & Lnn'Img);
1220 Make_Allocator (Loc,
1221 Make_Qualified_Expression (Loc,
1223 New_Reference_To (Standard_String, Loc),
1225 Make_Op_Concat (Loc,
1227 Make_String_Literal (Loc,
1228 String_From_Name_Buffer),
1230 Make_Attribute_Reference (Loc,
1232 New_Reference_To (L_Id, Loc),
1233 Attribute_Name => Name_Img))));
1235 Increment_Index (L_Stmts);
1236 Append_To (L_Stmts, Build_Set_Entry_Name_Call (Val));
1239 -- for Lnn in Family_Low .. Family_High loop
1241 -- Set_Entry_Name (_init._task_id, Inn, <Val>);
1245 Make_Loop_Statement (Loc,
1247 Make_Iteration_Scheme (Loc,
1248 Loop_Parameter_Specification =>
1249 Make_Loop_Parameter_Specification (Loc,
1250 Defining_Identifier => L_Id,
1251 Discrete_Subtype_Definition =>
1252 Build_Range (Def))),
1253 Statements => L_Stmts,
1254 End_Label => Empty));
1255 end Build_Entry_Family_Name;
1257 ----------------------
1258 -- Build_Entry_Name --
1259 ----------------------
1261 procedure Build_Entry_Name (Id : Entity_Id) is
1265 Get_Name_String (Chars (Id));
1267 Make_Allocator (Loc,
1268 Make_Qualified_Expression (Loc,
1270 New_Reference_To (Standard_String, Loc),
1272 Make_String_Literal (Loc,
1273 String_From_Name_Buffer)));
1275 Increment_Index (B_Stmts);
1276 Append_To (B_Stmts, Build_Set_Entry_Name_Call (Val));
1277 end Build_Entry_Name;
1279 -------------------------------
1280 -- Build_Set_Entry_Name_Call --
1281 -------------------------------
1283 function Build_Set_Entry_Name_Call (Arg3 : Node_Id) return Node_Id is
1288 -- Determine the proper name for the first argument and the RTS
1291 if Is_Protected_Type (Typ) then
1292 Arg1 := Name_uObject;
1293 Proc := RO_PE_Set_Entry_Name;
1295 else pragma Assert (Is_Task_Type (Typ));
1296 Arg1 := Name_uTask_Id;
1297 Proc := RO_TS_Set_Entry_Name;
1301 -- Set_Entry_Name (_init.Arg1, Inn, Arg3);
1304 Make_Procedure_Call_Statement (Loc,
1306 New_Reference_To (RTE (Proc), Loc),
1307 Parameter_Associations => New_List (
1308 Make_Selected_Component (Loc, -- _init._object
1309 Prefix => -- _init._task_id
1310 Make_Identifier (Loc, Name_uInit),
1312 Make_Identifier (Loc, Arg1)),
1313 New_Reference_To (Index, Loc), -- Inn
1315 end Build_Set_Entry_Name_Call;
1317 --------------------------
1318 -- Find_Protection_Type --
1319 --------------------------
1321 function Find_Protection_Type (Conc_Typ : Entity_Id) return Entity_Id is
1323 Typ : Entity_Id := Conc_Typ;
1326 if Is_Concurrent_Type (Typ) then
1327 Typ := Corresponding_Record_Type (Typ);
1330 Comp := First_Component (Typ);
1331 while Present (Comp) loop
1332 if Chars (Comp) = Name_uObject then
1333 return Base_Type (Etype (Comp));
1336 Next_Component (Comp);
1339 -- The corresponding record of a protected type should always have an
1342 raise Program_Error;
1343 end Find_Protection_Type;
1345 ---------------------
1346 -- Increment_Index --
1347 ---------------------
1349 procedure Increment_Index (Stmts : List_Id) is
1355 Make_Assignment_Statement (Loc,
1357 New_Reference_To (Index, Loc),
1361 New_Reference_To (Index, Loc),
1363 Make_Integer_Literal (Loc, 1))));
1364 end Increment_Index;
1366 -- Start of processing for Build_Entry_Names
1369 -- Retrieve the original concurrent type
1371 if Is_Concurrent_Record_Type (Typ) then
1372 Typ := Corresponding_Concurrent_Type (Typ);
1375 pragma Assert (Is_Protected_Type (Typ) or else Is_Task_Type (Typ));
1377 -- Nothing to do if the type has no entries
1379 if not Has_Entries (Typ) then
1383 -- Avoid generating entry names for a protected type with only one entry
1385 if Is_Protected_Type (Typ)
1386 and then Find_Protection_Type (Typ) /= RTE (RE_Protection_Entries)
1391 Index := Make_Defining_Identifier (Loc, New_Internal_Name ('I'));
1393 -- Step 1: Generate the declaration of the index variable:
1394 -- Inn : Protected_Entry_Index := 0;
1396 -- Inn : Task_Entry_Index := 0;
1398 if Is_Protected_Type (Typ) then
1399 Index_Typ := RE_Protected_Entry_Index;
1401 Index_Typ := RE_Task_Entry_Index;
1404 B_Decls := New_List;
1406 Make_Object_Declaration (Loc,
1407 Defining_Identifier => Index,
1408 Object_Definition =>
1409 New_Reference_To (RTE (Index_Typ), Loc),
1411 Make_Integer_Literal (Loc, 0)));
1413 B_Stmts := New_List;
1415 -- Step 2: Generate a call to Set_Entry_Name for each entry and entry
1418 Comp := First_Entity (Typ);
1419 while Present (Comp) loop
1420 if Ekind (Comp) = E_Entry then
1421 Build_Entry_Name (Comp);
1423 elsif Ekind (Comp) = E_Entry_Family then
1424 Build_Entry_Family_Name (Comp);
1430 -- Step 3: Wrap the statements in a block
1433 Make_Block_Statement (Loc,
1434 Declarations => B_Decls,
1435 Handled_Statement_Sequence =>
1436 Make_Handled_Sequence_Of_Statements (Loc,
1437 Statements => B_Stmts));
1438 end Build_Entry_Names;
1440 ---------------------------
1441 -- Build_Parameter_Block --
1442 ---------------------------
1444 function Build_Parameter_Block
1448 Decls : List_Id) return Entity_Id
1454 Has_Comp : Boolean := False;
1458 Actual := First (Actuals);
1460 Formal := Defining_Identifier (First (Formals));
1462 while Present (Actual) loop
1463 if not Is_Controlling_Actual (Actual) then
1466 -- type Ann is access all <actual-type>
1469 Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
1472 Make_Full_Type_Declaration (Loc,
1473 Defining_Identifier =>
1476 Make_Access_To_Object_Definition (Loc,
1480 Ekind (Formal) = E_In_Parameter,
1481 Subtype_Indication =>
1482 New_Reference_To (Etype (Actual), Loc))));
1488 Make_Component_Declaration (Loc,
1489 Defining_Identifier =>
1490 Make_Defining_Identifier (Loc, Chars (Formal)),
1491 Component_Definition =>
1492 Make_Component_Definition (Loc,
1495 Subtype_Indication =>
1496 New_Reference_To (Comp_Nam, Loc))));
1501 Next_Actual (Actual);
1502 Next_Formal_With_Extras (Formal);
1506 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
1511 -- type Pnn is record
1516 -- where Pnn is a parameter wrapping record, Param1 .. ParamN are
1517 -- the original parameter names and Ann1 .. AnnN are the access to
1521 Make_Full_Type_Declaration (Loc,
1522 Defining_Identifier =>
1525 Make_Record_Definition (Loc,
1527 Make_Component_List (Loc, Comps))));
1530 -- type Pnn is null record;
1533 Make_Full_Type_Declaration (Loc,
1534 Defining_Identifier =>
1537 Make_Record_Definition (Loc,
1538 Null_Present => True,
1539 Component_List => Empty)));
1543 end Build_Parameter_Block;
1545 --------------------------
1546 -- Build_Wrapper_Bodies --
1547 --------------------------
1549 procedure Build_Wrapper_Bodies
1554 Rec_Typ : Entity_Id;
1556 function Build_Wrapper_Body
1558 Subp_Id : Entity_Id;
1559 Obj_Typ : Entity_Id;
1560 Formals : List_Id) return Node_Id;
1561 -- Ada 2005 (AI-345): Build the body that wraps a primitive operation
1562 -- associated with a protected or task type. Subp_Id is the subprogram
1563 -- name which will be wrapped. Obj_Typ is the type of the new formal
1564 -- parameter which handles dispatching and object notation. Formals are
1565 -- the original formals of Subp_Id which will be explicitly replicated.
1567 ------------------------
1568 -- Build_Wrapper_Body --
1569 ------------------------
1571 function Build_Wrapper_Body
1573 Subp_Id : Entity_Id;
1574 Obj_Typ : Entity_Id;
1575 Formals : List_Id) return Node_Id
1577 Body_Spec : Node_Id;
1580 Body_Spec := Build_Wrapper_Spec (Loc, Subp_Id, Obj_Typ, Formals);
1582 -- The subprogram is not overriding or is not a primitive declared
1583 -- between two views.
1585 if No (Body_Spec) then
1590 Actuals : List_Id := No_List;
1592 First_Formal : Node_Id;
1597 -- Map formals to actuals. Use the list built for the wrapper
1598 -- spec, skipping the object notation parameter.
1600 First_Formal := First (Parameter_Specifications (Body_Spec));
1602 Formal := First_Formal;
1605 if Present (Formal) then
1606 Actuals := New_List;
1608 while Present (Formal) loop
1610 Make_Identifier (Loc, Chars =>
1611 Chars (Defining_Identifier (Formal))));
1617 -- Special processing for primitives declared between a private
1618 -- type and its completion.
1620 if Is_Private_Primitive_Subprogram (Subp_Id) then
1621 if No (Actuals) then
1622 Actuals := New_List;
1625 Prepend_To (Actuals,
1626 Unchecked_Convert_To (
1627 Corresponding_Concurrent_Type (Obj_Typ),
1628 Make_Identifier (Loc, Name_uO)));
1630 Nam := New_Reference_To (Subp_Id, Loc);
1633 -- An access-to-variable object parameter requires an explicit
1634 -- dereference in the unchecked conversion. This case occurs
1635 -- when a protected entry wrapper must override an interface
1636 -- level procedure with interface access as first parameter.
1638 -- O.all.Subp_Id (Formal_1, ..., Formal_N)
1640 if Nkind (Parameter_Type (First_Formal)) =
1644 Make_Explicit_Dereference (Loc,
1645 Prefix => Make_Identifier (Loc, Name_uO));
1647 Conv_Id := Make_Identifier (Loc, Name_uO);
1651 Make_Selected_Component (Loc,
1653 Unchecked_Convert_To (
1654 Corresponding_Concurrent_Type (Obj_Typ),
1657 New_Reference_To (Subp_Id, Loc));
1660 -- Create the subprogram body
1662 if Ekind (Subp_Id) = E_Function then
1664 Make_Subprogram_Body (Loc,
1665 Specification => Body_Spec,
1666 Declarations => Empty_List,
1667 Handled_Statement_Sequence =>
1668 Make_Handled_Sequence_Of_Statements (Loc,
1669 Statements => New_List (
1670 Make_Simple_Return_Statement (Loc,
1671 Make_Function_Call (Loc,
1673 Parameter_Associations => Actuals)))));
1677 Make_Subprogram_Body (Loc,
1678 Specification => Body_Spec,
1679 Declarations => Empty_List,
1680 Handled_Statement_Sequence =>
1681 Make_Handled_Sequence_Of_Statements (Loc,
1682 Statements => New_List (
1683 Make_Procedure_Call_Statement (Loc,
1685 Parameter_Associations => Actuals))));
1688 end Build_Wrapper_Body;
1690 -- Start of processing for Build_Wrapper_Bodies
1693 if Is_Concurrent_Type (Typ) then
1694 Rec_Typ := Corresponding_Record_Type (Typ);
1699 -- Generate wrapper bodies for a concurrent type which implements an
1702 if Present (Interfaces (Rec_Typ)) then
1704 Insert_Nod : Node_Id;
1706 Prim_Elmt : Elmt_Id;
1707 Prim_Decl : Node_Id;
1709 Wrap_Body : Node_Id;
1710 Wrap_Id : Entity_Id;
1715 -- Examine all primitive operations of the corresponding record
1716 -- type, looking for wrapper specs. Generate bodies in order to
1719 Prim_Elmt := First_Elmt (Primitive_Operations (Rec_Typ));
1720 while Present (Prim_Elmt) loop
1721 Prim := Node (Prim_Elmt);
1723 if (Ekind (Prim) = E_Function
1724 or else Ekind (Prim) = E_Procedure)
1725 and then Is_Primitive_Wrapper (Prim)
1727 Subp := Wrapped_Entity (Prim);
1728 Prim_Decl := Parent (Parent (Prim));
1731 Build_Wrapper_Body (Loc,
1734 Formals => Parameter_Specifications (Parent (Subp)));
1735 Wrap_Id := Defining_Unit_Name (Specification (Wrap_Body));
1737 Set_Corresponding_Spec (Wrap_Body, Prim);
1738 Set_Corresponding_Body (Prim_Decl, Wrap_Id);
1740 Insert_After (Insert_Nod, Wrap_Body);
1741 Insert_Nod := Wrap_Body;
1743 Analyze (Wrap_Body);
1746 Next_Elmt (Prim_Elmt);
1750 end Build_Wrapper_Bodies;
1752 ------------------------
1753 -- Build_Wrapper_Spec --
1754 ------------------------
1756 function Build_Wrapper_Spec
1758 Subp_Id : Entity_Id;
1759 Obj_Typ : Entity_Id;
1760 Formals : List_Id) return Node_Id
1762 First_Param : Node_Id;
1764 Iface_Elmt : Elmt_Id;
1765 Iface_Op : Entity_Id;
1766 Iface_Op_Elmt : Elmt_Id;
1768 function Overriding_Possible
1769 (Iface_Op : Entity_Id;
1770 Wrapper : Entity_Id) return Boolean;
1771 -- Determine whether a primitive operation can be overridden by Wrapper.
1772 -- Iface_Op is the candidate primitive operation of an interface type,
1773 -- Wrapper is the generated entry wrapper.
1775 function Replicate_Formals
1777 Formals : List_Id) return List_Id;
1778 -- An explicit parameter replication is required due to the Is_Entry_
1779 -- Formal flag being set for all the formals of an entry. The explicit
1780 -- replication removes the flag that would otherwise cause a different
1781 -- path of analysis.
1783 -------------------------
1784 -- Overriding_Possible --
1785 -------------------------
1787 function Overriding_Possible
1788 (Iface_Op : Entity_Id;
1789 Wrapper : Entity_Id) return Boolean
1791 Iface_Op_Spec : constant Node_Id := Parent (Iface_Op);
1792 Wrapper_Spec : constant Node_Id := Parent (Wrapper);
1794 function Type_Conformant_Parameters
1795 (Iface_Op_Params : List_Id;
1796 Wrapper_Params : List_Id) return Boolean;
1797 -- Determine whether the parameters of the generated entry wrapper
1798 -- and those of a primitive operation are type conformant. During
1799 -- this check, the first parameter of the primitive operation is
1802 --------------------------------
1803 -- Type_Conformant_Parameters --
1804 --------------------------------
1806 function Type_Conformant_Parameters
1807 (Iface_Op_Params : List_Id;
1808 Wrapper_Params : List_Id) return Boolean
1810 Iface_Op_Param : Node_Id;
1811 Iface_Op_Typ : Entity_Id;
1812 Wrapper_Param : Node_Id;
1813 Wrapper_Typ : Entity_Id;
1816 -- Skip the first parameter of the primitive operation
1818 Iface_Op_Param := Next (First (Iface_Op_Params));
1819 Wrapper_Param := First (Wrapper_Params);
1820 while Present (Iface_Op_Param)
1821 and then Present (Wrapper_Param)
1823 Iface_Op_Typ := Find_Parameter_Type (Iface_Op_Param);
1824 Wrapper_Typ := Find_Parameter_Type (Wrapper_Param);
1826 -- The two parameters must be mode conformant
1828 if not Conforming_Types
1829 (Iface_Op_Typ, Wrapper_Typ, Mode_Conformant)
1834 Next (Iface_Op_Param);
1835 Next (Wrapper_Param);
1838 -- One of the lists is longer than the other
1840 if Present (Iface_Op_Param) or else Present (Wrapper_Param) then
1845 end Type_Conformant_Parameters;
1847 -- Start of processing for Overriding_Possible
1850 if Chars (Iface_Op) /= Chars (Wrapper) then
1854 -- If an inherited subprogram is implemented by a protected procedure
1855 -- or an entry, then the first parameter of the inherited subprogram
1856 -- shall be of mode OUT or IN OUT, or access-to-variable parameter.
1858 if Ekind (Iface_Op) = E_Procedure
1859 and then Present (Parameter_Specifications (Iface_Op_Spec))
1862 Obj_Param : constant Node_Id :=
1863 First (Parameter_Specifications (Iface_Op_Spec));
1865 if not Out_Present (Obj_Param)
1866 and then Nkind (Parameter_Type (Obj_Param)) /=
1875 Type_Conformant_Parameters (
1876 Parameter_Specifications (Iface_Op_Spec),
1877 Parameter_Specifications (Wrapper_Spec));
1878 end Overriding_Possible;
1880 -----------------------
1881 -- Replicate_Formals --
1882 -----------------------
1884 function Replicate_Formals
1886 Formals : List_Id) return List_Id
1888 New_Formals : constant List_Id := New_List;
1890 Param_Type : Node_Id;
1893 Formal := First (Formals);
1895 -- Skip the object parameter when dealing with primitives declared
1896 -- between two views.
1898 if Is_Private_Primitive_Subprogram (Subp_Id) then
1899 Formal := Next (Formal);
1902 while Present (Formal) loop
1904 -- Create an explicit copy of the entry parameter
1906 -- When creating the wrapper subprogram for a primitive operation
1907 -- of a protected interface we must construct an equivalent
1908 -- signature to that of the overriding operation. For regular
1909 -- parameters we can just use the type of the formal, but for
1910 -- access to subprogram parameters we need to reanalyze the
1911 -- parameter type to create local entities for the signature of
1912 -- the subprogram type. Using the entities of the overriding
1913 -- subprogram will result in out-of-scope errors in the back-end.
1915 if Nkind (Parameter_Type (Formal)) = N_Access_Definition then
1916 Param_Type := Copy_Separate_Tree (Parameter_Type (Formal));
1919 New_Reference_To (Etype (Parameter_Type (Formal)), Loc);
1922 Append_To (New_Formals,
1923 Make_Parameter_Specification (Loc,
1924 Defining_Identifier =>
1925 Make_Defining_Identifier (Loc,
1926 Chars => Chars (Defining_Identifier (Formal))),
1927 In_Present => In_Present (Formal),
1928 Out_Present => Out_Present (Formal),
1929 Parameter_Type => Param_Type));
1935 end Replicate_Formals;
1937 -- Start of processing for Build_Wrapper_Spec
1940 -- There is no point in building wrappers for non-tagged concurrent
1943 pragma Assert (Is_Tagged_Type (Obj_Typ));
1945 -- An entry or a protected procedure can override a routine where the
1946 -- controlling formal is either IN OUT, OUT or is of access-to-variable
1947 -- type. Since the wrapper must have the exact same signature as that of
1948 -- the overridden subprogram, we try to find the overriding candidate
1949 -- and use its controlling formal.
1951 First_Param := Empty;
1953 -- Check every implemented interface
1955 if Present (Interfaces (Obj_Typ)) then
1956 Iface_Elmt := First_Elmt (Interfaces (Obj_Typ));
1957 Search : while Present (Iface_Elmt) loop
1958 Iface := Node (Iface_Elmt);
1960 -- Check every interface primitive
1962 if Present (Primitive_Operations (Iface)) then
1963 Iface_Op_Elmt := First_Elmt (Primitive_Operations (Iface));
1964 while Present (Iface_Op_Elmt) loop
1965 Iface_Op := Node (Iface_Op_Elmt);
1967 -- Ignore predefined primitives
1969 if not Is_Predefined_Dispatching_Operation (Iface_Op) then
1970 Iface_Op := Ultimate_Alias (Iface_Op);
1972 -- The current primitive operation can be overridden by
1973 -- the generated entry wrapper.
1975 if Overriding_Possible (Iface_Op, Subp_Id) then
1977 First (Parameter_Specifications (Parent (Iface_Op)));
1983 Next_Elmt (Iface_Op_Elmt);
1987 Next_Elmt (Iface_Elmt);
1991 -- If the subprogram to be wrapped is not overriding anything or is not
1992 -- a primitive declared between two views, do not produce anything. This
1993 -- avoids spurious errors involving overriding.
1996 and then not Is_Private_Primitive_Subprogram (Subp_Id)
2002 Wrapper_Id : constant Entity_Id :=
2003 Make_Defining_Identifier (Loc, Chars (Subp_Id));
2004 New_Formals : List_Id;
2005 Obj_Param : Node_Id;
2006 Obj_Param_Typ : Entity_Id;
2009 -- Minimum decoration is needed to catch the entity in
2010 -- Sem_Ch6.Override_Dispatching_Operation.
2012 if Ekind (Subp_Id) = E_Function then
2013 Set_Ekind (Wrapper_Id, E_Function);
2015 Set_Ekind (Wrapper_Id, E_Procedure);
2018 Set_Is_Primitive_Wrapper (Wrapper_Id);
2019 Set_Wrapped_Entity (Wrapper_Id, Subp_Id);
2020 Set_Is_Private_Primitive (Wrapper_Id,
2021 Is_Private_Primitive_Subprogram (Subp_Id));
2023 -- Process the formals
2025 New_Formals := Replicate_Formals (Loc, Formals);
2027 -- Routine Subp_Id has been found to override an interface primitive.
2028 -- If the interface operation has an access parameter, create a copy
2029 -- of it, with the same null exclusion indicator if present.
2031 if Present (First_Param) then
2032 if Nkind (Parameter_Type (First_Param)) = N_Access_Definition then
2034 Make_Access_Definition (Loc,
2036 New_Reference_To (Obj_Typ, Loc));
2037 Set_Null_Exclusion_Present (Obj_Param_Typ,
2038 Null_Exclusion_Present (Parameter_Type (First_Param)));
2041 Obj_Param_Typ := New_Reference_To (Obj_Typ, Loc);
2045 Make_Parameter_Specification (Loc,
2046 Defining_Identifier =>
2047 Make_Defining_Identifier (Loc,
2049 In_Present => In_Present (First_Param),
2050 Out_Present => Out_Present (First_Param),
2051 Parameter_Type => Obj_Param_Typ);
2053 -- If we are dealing with a primitive declared between two views,
2054 -- create a default parameter.
2056 else pragma Assert (Is_Private_Primitive_Subprogram (Subp_Id));
2058 Make_Parameter_Specification (Loc,
2059 Defining_Identifier =>
2060 Make_Defining_Identifier (Loc, Name_uO),
2062 Out_Present => Ekind (Subp_Id) /= E_Function,
2063 Parameter_Type => New_Reference_To (Obj_Typ, Loc));
2066 Prepend_To (New_Formals, Obj_Param);
2068 -- Build the final spec
2070 if Ekind (Subp_Id) = E_Function then
2072 Make_Function_Specification (Loc,
2073 Defining_Unit_Name => Wrapper_Id,
2074 Parameter_Specifications => New_Formals,
2075 Result_Definition =>
2076 New_Copy (Result_Definition (Parent (Subp_Id))));
2079 Make_Procedure_Specification (Loc,
2080 Defining_Unit_Name => Wrapper_Id,
2081 Parameter_Specifications => New_Formals);
2084 end Build_Wrapper_Spec;
2086 -------------------------
2087 -- Build_Wrapper_Specs --
2088 -------------------------
2090 procedure Build_Wrapper_Specs
2096 Rec_Typ : Entity_Id;
2099 if Is_Protected_Type (Typ) then
2100 Def := Protected_Definition (Parent (Typ));
2101 else pragma Assert (Is_Task_Type (Typ));
2102 Def := Task_Definition (Parent (Typ));
2105 Rec_Typ := Corresponding_Record_Type (Typ);
2107 -- Generate wrapper specs for a concurrent type which implements an
2108 -- interface and has visible entries and/or protected procedures.
2110 if Present (Interfaces (Rec_Typ))
2111 and then Present (Def)
2112 and then Present (Visible_Declarations (Def))
2116 Wrap_Decl : Node_Id;
2117 Wrap_Spec : Node_Id;
2120 Decl := First (Visible_Declarations (Def));
2121 while Present (Decl) loop
2124 if Nkind (Decl) = N_Entry_Declaration
2125 and then Ekind (Defining_Identifier (Decl)) = E_Entry
2128 Build_Wrapper_Spec (Loc,
2129 Subp_Id => Defining_Identifier (Decl),
2131 Formals => Parameter_Specifications (Decl));
2133 elsif Nkind (Decl) = N_Subprogram_Declaration then
2135 Build_Wrapper_Spec (Loc,
2136 Subp_Id => Defining_Unit_Name (Specification (Decl)),
2139 Parameter_Specifications (Specification (Decl)));
2142 if Present (Wrap_Spec) then
2144 Make_Subprogram_Declaration (Loc,
2145 Specification => Wrap_Spec);
2147 Insert_After (N, Wrap_Decl);
2150 Analyze (Wrap_Decl);
2157 end Build_Wrapper_Specs;
2159 ---------------------------
2160 -- Build_Find_Body_Index --
2161 ---------------------------
2163 function Build_Find_Body_Index (Typ : Entity_Id) return Node_Id is
2164 Loc : constant Source_Ptr := Sloc (Typ);
2167 Has_F : Boolean := False;
2169 If_St : Node_Id := Empty;
2172 Decls : List_Id := New_List;
2175 Siz : Node_Id := Empty;
2177 procedure Add_If_Clause (Expr : Node_Id);
2178 -- Add test for range of current entry
2180 function Convert_Discriminant_Ref (Bound : Node_Id) return Node_Id;
2181 -- If a bound of an entry is given by a discriminant, retrieve the
2182 -- actual value of the discriminant from the enclosing object.
2188 procedure Add_If_Clause (Expr : Node_Id) is
2190 Stats : constant List_Id :=
2192 Make_Simple_Return_Statement (Loc,
2193 Expression => Make_Integer_Literal (Loc, Index + 1)));
2196 -- Index for current entry body
2200 -- Compute total length of entry queues so far
2208 Right_Opnd => Expr);
2213 Left_Opnd => Make_Identifier (Loc, Name_uE),
2216 -- Map entry queue indices in the range of the current family
2217 -- into the current index, that designates the entry body.
2221 Make_Implicit_If_Statement (Typ,
2223 Then_Statements => Stats,
2224 Elsif_Parts => New_List);
2230 Make_Elsif_Part (Loc,
2232 Then_Statements => Stats),
2233 Elsif_Parts (If_St));
2237 ------------------------------
2238 -- Convert_Discriminant_Ref --
2239 ------------------------------
2241 function Convert_Discriminant_Ref (Bound : Node_Id) return Node_Id is
2245 if Is_Entity_Name (Bound)
2246 and then Ekind (Entity (Bound)) = E_Discriminant
2249 Make_Selected_Component (Loc,
2251 Unchecked_Convert_To (Corresponding_Record_Type (Typ),
2252 Make_Explicit_Dereference (Loc,
2253 Make_Identifier (Loc, Name_uObject))),
2254 Selector_Name => Make_Identifier (Loc, Chars (Bound)));
2255 Set_Etype (B, Etype (Entity (Bound)));
2257 B := New_Copy_Tree (Bound);
2261 end Convert_Discriminant_Ref;
2263 -- Start of processing for Build_Find_Body_Index
2266 Spec := Build_Find_Body_Index_Spec (Typ);
2268 Ent := First_Entity (Typ);
2269 while Present (Ent) loop
2270 if Ekind (Ent) = E_Entry_Family then
2280 -- If the protected type has no entry families, there is a one-one
2281 -- correspondence between entry queue and entry body.
2284 Make_Simple_Return_Statement (Loc,
2285 Expression => Make_Identifier (Loc, Name_uE));
2288 -- Suppose entries e1, e2, ... have size l1, l2, ... we generate
2291 -- if E <= l1 then return 1;
2292 -- elsif E <= l1 + l2 then return 2;
2297 Ent := First_Entity (Typ);
2299 Add_Object_Pointer (Loc, Typ, Decls);
2301 while Present (Ent) loop
2303 if Ekind (Ent) = E_Entry then
2304 Add_If_Clause (Make_Integer_Literal (Loc, 1));
2306 elsif Ekind (Ent) = E_Entry_Family then
2308 E_Typ := Etype (Discrete_Subtype_Definition (Parent (Ent)));
2309 Hi := Convert_Discriminant_Ref (Type_High_Bound (E_Typ));
2310 Lo := Convert_Discriminant_Ref (Type_Low_Bound (E_Typ));
2311 Add_If_Clause (Family_Size (Loc, Hi, Lo, Typ, False));
2320 Make_Simple_Return_Statement (Loc,
2321 Expression => Make_Integer_Literal (Loc, 1));
2323 elsif Nkind (Ret) = N_If_Statement then
2325 -- Ranges are in increasing order, so last one doesn't need guard
2328 Nod : constant Node_Id := Last (Elsif_Parts (Ret));
2331 Set_Else_Statements (Ret, Then_Statements (Nod));
2337 Make_Subprogram_Body (Loc,
2338 Specification => Spec,
2339 Declarations => Decls,
2340 Handled_Statement_Sequence =>
2341 Make_Handled_Sequence_Of_Statements (Loc,
2342 Statements => New_List (Ret)));
2343 end Build_Find_Body_Index;
2345 --------------------------------
2346 -- Build_Find_Body_Index_Spec --
2347 --------------------------------
2349 function Build_Find_Body_Index_Spec (Typ : Entity_Id) return Node_Id is
2350 Loc : constant Source_Ptr := Sloc (Typ);
2351 Id : constant Entity_Id :=
2352 Make_Defining_Identifier (Loc,
2353 Chars => New_External_Name (Chars (Typ), 'F'));
2354 Parm1 : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uO);
2355 Parm2 : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uE);
2359 Make_Function_Specification (Loc,
2360 Defining_Unit_Name => Id,
2361 Parameter_Specifications => New_List (
2362 Make_Parameter_Specification (Loc,
2363 Defining_Identifier => Parm1,
2365 New_Reference_To (RTE (RE_Address), Loc)),
2367 Make_Parameter_Specification (Loc,
2368 Defining_Identifier => Parm2,
2370 New_Reference_To (RTE (RE_Protected_Entry_Index), Loc))),
2371 Result_Definition => New_Occurrence_Of (
2372 RTE (RE_Protected_Entry_Index), Loc));
2373 end Build_Find_Body_Index_Spec;
2375 -------------------------
2376 -- Build_Master_Entity --
2377 -------------------------
2379 procedure Build_Master_Entity (E : Entity_Id) is
2380 Loc : constant Source_Ptr := Sloc (E);
2388 -- Ada 2005 (AI-287): Do not set/get the has_master_entity reminder
2389 -- in internal scopes, unless present already.. Required for nested
2390 -- limited aggregates, where the expansion of task components may
2391 -- generate inner blocks. If the block is the rewriting of a call
2392 -- this is valid master.
2394 if Ada_Version >= Ada_05 then
2395 while Is_Internal (S) loop
2396 if Nkind (Parent (S)) = N_Block_Statement
2398 Nkind (Original_Node (Parent (S))) = N_Procedure_Call_Statement
2407 -- Nothing to do if we already built a master entity for this scope
2408 -- or if there is no task hierarchy.
2410 if Has_Master_Entity (S)
2411 or else Restriction_Active (No_Task_Hierarchy)
2416 -- Otherwise first build the master entity
2417 -- _Master : constant Master_Id := Current_Master.all;
2418 -- and insert it just before the current declaration
2421 Make_Object_Declaration (Loc,
2422 Defining_Identifier =>
2423 Make_Defining_Identifier (Loc, Name_uMaster),
2424 Constant_Present => True,
2425 Object_Definition => New_Reference_To (RTE (RE_Master_Id), Loc),
2427 Make_Explicit_Dereference (Loc,
2428 New_Reference_To (RTE (RE_Current_Master), Loc)));
2431 Insert_Before (P, Decl);
2434 -- Ada 2005 (AI-287): Set the has_master_entity reminder in the
2435 -- non-internal scope selected above.
2437 if Ada_Version >= Ada_05 then
2438 Set_Has_Master_Entity (S);
2440 Set_Has_Master_Entity (Scope (E));
2443 -- Now mark the containing scope as a task master
2445 while Nkind (P) /= N_Compilation_Unit loop
2448 -- If we fall off the top, we are at the outer level, and the
2449 -- environment task is our effective master, so nothing to mark.
2452 (P, N_Task_Body, N_Block_Statement, N_Subprogram_Body)
2454 Set_Is_Task_Master (P, True);
2457 elsif Nkind (Parent (P)) = N_Subunit then
2458 P := Corresponding_Stub (Parent (P));
2461 end Build_Master_Entity;
2463 ---------------------------
2464 -- Build_Protected_Entry --
2465 ---------------------------
2467 function Build_Protected_Entry
2470 Pid : Node_Id) return Node_Id
2472 Loc : constant Source_Ptr := Sloc (N);
2474 Decls : constant List_Id := Declarations (N);
2475 End_Lab : constant Node_Id :=
2476 End_Label (Handled_Statement_Sequence (N));
2477 End_Loc : constant Source_Ptr :=
2478 Sloc (Last (Statements (Handled_Statement_Sequence (N))));
2479 -- Used for the generated call to Complete_Entry_Body
2481 Han_Loc : Source_Ptr;
2482 -- Used for the exception handler, inserted at end of the body
2484 Op_Decls : constant List_Id := New_List;
2492 -- Set the source location on the exception handler only when debugging
2493 -- the expanded code (see Make_Implicit_Exception_Handler).
2495 if Debug_Generated_Code then
2498 -- Otherwise the inserted code should not be visible to the debugger
2501 Han_Loc := No_Location;
2505 Make_Defining_Identifier (Loc,
2506 Chars => Chars (Protected_Body_Subprogram (Ent)));
2508 Build_Protected_Entry_Specification (Loc, Edef, Empty);
2510 -- Add the following declarations:
2511 -- type poVP is access poV;
2512 -- _object : poVP := poVP (_O);
2514 -- where _O is the formal parameter associated with the concurrent
2515 -- object. These declarations are needed for Complete_Entry_Body.
2517 Add_Object_Pointer (Loc, Pid, Op_Decls);
2519 -- Add renamings for all formals, the Protection object, discriminals,
2520 -- privals and the entry index constant for use by debugger.
2522 Add_Formal_Renamings (Espec, Op_Decls, Ent, Loc);
2523 Debug_Private_Data_Declarations (Decls);
2525 case Corresponding_Runtime_Package (Pid) is
2526 when System_Tasking_Protected_Objects_Entries =>
2528 New_Reference_To (RTE (RE_Complete_Entry_Body), Loc);
2530 when System_Tasking_Protected_Objects_Single_Entry =>
2532 New_Reference_To (RTE (RE_Complete_Single_Entry_Body), Loc);
2535 raise Program_Error;
2538 Op_Stats := New_List (
2539 Make_Block_Statement (Loc,
2540 Declarations => Decls,
2541 Handled_Statement_Sequence =>
2542 Handled_Statement_Sequence (N)),
2544 Make_Procedure_Call_Statement (End_Loc,
2546 Parameter_Associations => New_List (
2547 Make_Attribute_Reference (End_Loc,
2549 Make_Selected_Component (End_Loc,
2551 Make_Identifier (End_Loc, Name_uObject),
2553 Make_Identifier (End_Loc, Name_uObject)),
2554 Attribute_Name => Name_Unchecked_Access))));
2556 -- When exceptions can not be propagated, we never need to call
2557 -- Exception_Complete_Entry_Body
2559 if No_Exception_Handlers_Set then
2561 Make_Subprogram_Body (Loc,
2562 Specification => Espec,
2563 Declarations => Op_Decls,
2564 Handled_Statement_Sequence =>
2565 Make_Handled_Sequence_Of_Statements (Loc,
2566 Statements => Op_Stats,
2567 End_Label => End_Lab));
2570 Ohandle := Make_Others_Choice (Loc);
2571 Set_All_Others (Ohandle);
2573 case Corresponding_Runtime_Package (Pid) is
2574 when System_Tasking_Protected_Objects_Entries =>
2577 (RTE (RE_Exceptional_Complete_Entry_Body), Loc);
2579 when System_Tasking_Protected_Objects_Single_Entry =>
2582 (RTE (RE_Exceptional_Complete_Single_Entry_Body), Loc);
2585 raise Program_Error;
2588 -- Create body of entry procedure. The renaming declarations are
2589 -- placed ahead of the block that contains the actual entry body.
2592 Make_Subprogram_Body (Loc,
2593 Specification => Espec,
2594 Declarations => Op_Decls,
2595 Handled_Statement_Sequence =>
2596 Make_Handled_Sequence_Of_Statements (Loc,
2597 Statements => Op_Stats,
2598 End_Label => End_Lab,
2599 Exception_Handlers => New_List (
2600 Make_Implicit_Exception_Handler (Han_Loc,
2601 Exception_Choices => New_List (Ohandle),
2603 Statements => New_List (
2604 Make_Procedure_Call_Statement (Han_Loc,
2606 Parameter_Associations => New_List (
2607 Make_Attribute_Reference (Han_Loc,
2609 Make_Selected_Component (Han_Loc,
2611 Make_Identifier (Han_Loc, Name_uObject),
2613 Make_Identifier (Han_Loc, Name_uObject)),
2614 Attribute_Name => Name_Unchecked_Access),
2616 Make_Function_Call (Han_Loc,
2617 Name => New_Reference_To (
2618 RTE (RE_Get_GNAT_Exception), Loc)))))))));
2620 end Build_Protected_Entry;
2622 -----------------------------------------
2623 -- Build_Protected_Entry_Specification --
2624 -----------------------------------------
2626 function Build_Protected_Entry_Specification
2629 Ent_Id : Entity_Id) return Node_Id
2631 P : constant Entity_Id := Make_Defining_Identifier (Loc, Name_uP);
2634 Set_Debug_Info_Needed (Def_Id);
2636 if Present (Ent_Id) then
2637 Append_Elmt (P, Accept_Address (Ent_Id));
2641 Make_Procedure_Specification (Loc,
2642 Defining_Unit_Name => Def_Id,
2643 Parameter_Specifications => New_List (
2644 Make_Parameter_Specification (Loc,
2645 Defining_Identifier =>
2646 Make_Defining_Identifier (Loc, Name_uO),
2648 New_Reference_To (RTE (RE_Address), Loc)),
2650 Make_Parameter_Specification (Loc,
2651 Defining_Identifier => P,
2653 New_Reference_To (RTE (RE_Address), Loc)),
2655 Make_Parameter_Specification (Loc,
2656 Defining_Identifier =>
2657 Make_Defining_Identifier (Loc, Name_uE),
2659 New_Reference_To (RTE (RE_Protected_Entry_Index), Loc))));
2660 end Build_Protected_Entry_Specification;
2662 --------------------------
2663 -- Build_Protected_Spec --
2664 --------------------------
2666 function Build_Protected_Spec
2668 Obj_Type : Entity_Id;
2670 Unprotected : Boolean := False) return List_Id
2672 Loc : constant Source_Ptr := Sloc (N);
2675 New_Plist : List_Id;
2676 New_Param : Node_Id;
2679 New_Plist := New_List;
2681 Formal := First_Formal (Ident);
2682 while Present (Formal) loop
2684 Make_Parameter_Specification (Loc,
2685 Defining_Identifier =>
2686 Make_Defining_Identifier (Sloc (Formal), Chars (Formal)),
2687 In_Present => In_Present (Parent (Formal)),
2688 Out_Present => Out_Present (Parent (Formal)),
2689 Parameter_Type => New_Reference_To (Etype (Formal), Loc));
2692 Set_Protected_Formal (Formal, Defining_Identifier (New_Param));
2695 Append (New_Param, New_Plist);
2696 Next_Formal (Formal);
2699 -- If the subprogram is a procedure and the context is not an access
2700 -- to protected subprogram, the parameter is in-out. Otherwise it is
2704 Make_Parameter_Specification (Loc,
2705 Defining_Identifier =>
2706 Make_Defining_Identifier (Loc, Name_uObject),
2709 (Etype (Ident) = Standard_Void_Type
2710 and then not Is_RTE (Obj_Type, RE_Address)),
2712 New_Reference_To (Obj_Type, Loc));
2713 Set_Debug_Info_Needed (Defining_Identifier (Decl));
2714 Prepend_To (New_Plist, Decl);
2717 end Build_Protected_Spec;
2719 ---------------------------------------
2720 -- Build_Protected_Sub_Specification --
2721 ---------------------------------------
2723 function Build_Protected_Sub_Specification
2725 Prot_Typ : Entity_Id;
2726 Mode : Subprogram_Protection_Mode) return Node_Id
2728 Loc : constant Source_Ptr := Sloc (N);
2732 New_Plist : List_Id;
2735 Append_Chr : constant array (Subprogram_Protection_Mode) of Character :=
2736 (Dispatching_Mode => ' ',
2737 Protected_Mode => 'P',
2738 Unprotected_Mode => 'N');
2741 if Ekind (Defining_Unit_Name (Specification (N))) =
2744 Decl := Unit_Declaration_Node (Corresponding_Spec (N));
2749 Def_Id := Defining_Unit_Name (Specification (Decl));
2752 Build_Protected_Spec
2753 (Decl, Corresponding_Record_Type (Prot_Typ), Def_Id,
2754 Mode = Unprotected_Mode);
2756 Make_Defining_Identifier (Loc,
2757 Chars => Build_Selected_Name (Prot_Typ, Def_Id, Append_Chr (Mode)));
2759 -- The unprotected operation carries the user code, and debugging
2760 -- information must be generated for it, even though this spec does
2761 -- not come from source. It is also convenient to allow gdb to step
2762 -- into the protected operation, even though it only contains lock/
2765 Set_Debug_Info_Needed (New_Id);
2767 if Nkind (Specification (Decl)) = N_Procedure_Specification then
2769 Make_Procedure_Specification (Loc,
2770 Defining_Unit_Name => New_Id,
2771 Parameter_Specifications => New_Plist);
2773 -- Create a new specification for the anonymous subprogram type
2777 Make_Function_Specification (Loc,
2778 Defining_Unit_Name => New_Id,
2779 Parameter_Specifications => New_Plist,
2780 Result_Definition =>
2781 Copy_Result_Type (Result_Definition (Specification (Decl))));
2783 Set_Return_Present (Defining_Unit_Name (New_Spec));
2787 end Build_Protected_Sub_Specification;
2789 -------------------------------------
2790 -- Build_Protected_Subprogram_Body --
2791 -------------------------------------
2793 function Build_Protected_Subprogram_Body
2796 N_Op_Spec : Node_Id) return Node_Id
2798 Loc : constant Source_Ptr := Sloc (N);
2800 P_Op_Spec : Node_Id;
2803 Unprot_Call : Node_Id;
2805 Lock_Name : Node_Id;
2806 Lock_Stmt : Node_Id;
2807 Service_Name : Node_Id;
2809 Return_Stmt : Node_Id := Empty; -- init to avoid gcc 3 warning
2810 Pre_Stmts : List_Id := No_List; -- init to avoid gcc 3 warning
2812 Object_Parm : Node_Id;
2815 function Is_Exception_Safe (Subprogram : Node_Id) return Boolean;
2816 -- Tell whether a given subprogram cannot raise an exception
2818 -----------------------
2819 -- Is_Exception_Safe --
2820 -----------------------
2822 function Is_Exception_Safe (Subprogram : Node_Id) return Boolean is
2824 function Has_Side_Effect (N : Node_Id) return Boolean;
2825 -- Return True whenever encountering a subprogram call or raise
2826 -- statement of any kind in the sequence of statements
2828 ---------------------
2829 -- Has_Side_Effect --
2830 ---------------------
2832 -- What is this doing buried two levels down in exp_ch9. It seems
2833 -- like a generally useful function, and indeed there may be code
2834 -- duplication going on here ???
2836 function Has_Side_Effect (N : Node_Id) return Boolean is
2840 function Is_Call_Or_Raise (N : Node_Id) return Boolean;
2841 -- Indicate whether N is a subprogram call or a raise statement
2843 ----------------------
2844 -- Is_Call_Or_Raise --
2845 ----------------------
2847 function Is_Call_Or_Raise (N : Node_Id) return Boolean is
2849 return Nkind_In (N, N_Procedure_Call_Statement,
2852 N_Raise_Constraint_Error,
2853 N_Raise_Program_Error,
2854 N_Raise_Storage_Error);
2855 end Is_Call_Or_Raise;
2857 -- Start of processing for Has_Side_Effect
2861 while Present (Stmt) loop
2862 if Is_Call_Or_Raise (Stmt) then
2866 -- An object declaration can also contain a function call
2867 -- or a raise statement
2869 if Nkind (Stmt) = N_Object_Declaration then
2870 Expr := Expression (Stmt);
2872 if Present (Expr) and then Is_Call_Or_Raise (Expr) then
2881 end Has_Side_Effect;
2883 -- Start of processing for Is_Exception_Safe
2886 -- If the checks handled by the back end are not disabled, we cannot
2887 -- ensure that no exception will be raised.
2889 if not Access_Checks_Suppressed (Empty)
2890 or else not Discriminant_Checks_Suppressed (Empty)
2891 or else not Range_Checks_Suppressed (Empty)
2892 or else not Index_Checks_Suppressed (Empty)
2893 or else Opt.Stack_Checking_Enabled
2898 if Has_Side_Effect (First (Declarations (Subprogram)))
2901 First (Statements (Handled_Statement_Sequence (Subprogram))))
2907 end Is_Exception_Safe;
2909 -- Start of processing for Build_Protected_Subprogram_Body
2912 Op_Spec := Specification (N);
2913 Exc_Safe := Is_Exception_Safe (N);
2916 Build_Protected_Sub_Specification (N, Pid, Protected_Mode);
2918 -- Build a list of the formal parameters of the protected version of
2919 -- the subprogram to use as the actual parameters of the unprotected
2922 Uactuals := New_List;
2923 Pformal := First (Parameter_Specifications (P_Op_Spec));
2924 while Present (Pformal) loop
2926 Make_Identifier (Loc, Chars (Defining_Identifier (Pformal))),
2931 -- Make a call to the unprotected version of the subprogram built above
2932 -- for use by the protected version built below.
2934 if Nkind (Op_Spec) = N_Function_Specification then
2936 R := Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
2938 Make_Object_Declaration (Loc,
2939 Defining_Identifier => R,
2940 Constant_Present => True,
2941 Object_Definition => New_Copy (Result_Definition (N_Op_Spec)),
2943 Make_Function_Call (Loc,
2944 Name => Make_Identifier (Loc,
2945 Chars (Defining_Unit_Name (N_Op_Spec))),
2946 Parameter_Associations => Uactuals));
2947 Return_Stmt := Make_Simple_Return_Statement (Loc,
2948 Expression => New_Reference_To (R, Loc));
2951 Unprot_Call := Make_Simple_Return_Statement (Loc,
2952 Expression => Make_Function_Call (Loc,
2954 Make_Identifier (Loc,
2955 Chars (Defining_Unit_Name (N_Op_Spec))),
2956 Parameter_Associations => Uactuals));
2961 Make_Procedure_Call_Statement (Loc,
2963 Make_Identifier (Loc,
2964 Chars (Defining_Unit_Name (N_Op_Spec))),
2965 Parameter_Associations => Uactuals);
2968 -- Wrap call in block that will be covered by an at_end handler
2970 if not Exc_Safe then
2971 Unprot_Call := Make_Block_Statement (Loc,
2972 Handled_Statement_Sequence =>
2973 Make_Handled_Sequence_Of_Statements (Loc,
2974 Statements => New_List (Unprot_Call)));
2977 -- Make the protected subprogram body. This locks the protected
2978 -- object and calls the unprotected version of the subprogram.
2980 case Corresponding_Runtime_Package (Pid) is
2981 when System_Tasking_Protected_Objects_Entries =>
2982 Lock_Name := New_Reference_To (RTE (RE_Lock_Entries), Loc);
2983 Service_Name := New_Reference_To (RTE (RE_Service_Entries), Loc);
2985 when System_Tasking_Protected_Objects_Single_Entry =>
2986 Lock_Name := New_Reference_To (RTE (RE_Lock_Entry), Loc);
2987 Service_Name := New_Reference_To (RTE (RE_Service_Entry), Loc);
2989 when System_Tasking_Protected_Objects =>
2990 Lock_Name := New_Reference_To (RTE (RE_Lock), Loc);
2991 Service_Name := New_Reference_To (RTE (RE_Unlock), Loc);
2994 raise Program_Error;
2998 Make_Attribute_Reference (Loc,
3000 Make_Selected_Component (Loc,
3002 Make_Identifier (Loc, Name_uObject),
3004 Make_Identifier (Loc, Name_uObject)),
3005 Attribute_Name => Name_Unchecked_Access);
3007 Lock_Stmt := Make_Procedure_Call_Statement (Loc,
3009 Parameter_Associations => New_List (Object_Parm));
3011 if Abort_Allowed then
3013 Make_Procedure_Call_Statement (Loc,
3014 Name => New_Reference_To (RTE (RE_Abort_Defer), Loc),
3015 Parameter_Associations => Empty_List),
3019 Stmts := New_List (Lock_Stmt);
3022 if not Exc_Safe then
3023 Append (Unprot_Call, Stmts);
3025 if Nkind (Op_Spec) = N_Function_Specification then
3027 Stmts := Empty_List;
3029 Append (Unprot_Call, Stmts);
3033 Make_Procedure_Call_Statement (Loc,
3034 Name => Service_Name,
3035 Parameter_Associations =>
3036 New_List (New_Copy_Tree (Object_Parm))),
3039 if Abort_Allowed then
3041 Make_Procedure_Call_Statement (Loc,
3042 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc),
3043 Parameter_Associations => Empty_List),
3047 if Nkind (Op_Spec) = N_Function_Specification then
3048 Append (Return_Stmt, Stmts);
3049 Append (Make_Block_Statement (Loc,
3050 Declarations => New_List (Unprot_Call),
3051 Handled_Statement_Sequence =>
3052 Make_Handled_Sequence_Of_Statements (Loc,
3053 Statements => Stmts)), Pre_Stmts);
3059 Make_Subprogram_Body (Loc,
3060 Declarations => Empty_List,
3061 Specification => P_Op_Spec,
3062 Handled_Statement_Sequence =>
3063 Make_Handled_Sequence_Of_Statements (Loc, Statements => Stmts));
3065 if not Exc_Safe then
3066 Set_Is_Protected_Subprogram_Body (Sub_Body);
3070 end Build_Protected_Subprogram_Body;
3072 -------------------------------------
3073 -- Build_Protected_Subprogram_Call --
3074 -------------------------------------
3076 procedure Build_Protected_Subprogram_Call
3080 External : Boolean := True)
3082 Loc : constant Source_Ptr := Sloc (N);
3083 Sub : constant Entity_Id := Entity (Name);
3089 New_Sub := New_Occurrence_Of (External_Subprogram (Sub), Loc);
3092 New_Occurrence_Of (Protected_Body_Subprogram (Sub), Loc);
3095 if Present (Parameter_Associations (N)) then
3096 Params := New_Copy_List_Tree (Parameter_Associations (N));
3101 Prepend (Rec, Params);
3103 if Ekind (Sub) = E_Procedure then
3105 Make_Procedure_Call_Statement (Loc,
3107 Parameter_Associations => Params));
3110 pragma Assert (Ekind (Sub) = E_Function);
3112 Make_Function_Call (Loc,
3114 Parameter_Associations => Params));
3118 and then Nkind (Rec) = N_Unchecked_Type_Conversion
3119 and then Is_Entity_Name (Expression (Rec))
3120 and then Is_Shared_Passive (Entity (Expression (Rec)))
3122 Add_Shared_Var_Lock_Procs (N);
3124 end Build_Protected_Subprogram_Call;
3126 -------------------------
3127 -- Build_Selected_Name --
3128 -------------------------
3130 function Build_Selected_Name
3131 (Prefix : Entity_Id;
3132 Selector : Entity_Id;
3133 Append_Char : Character := ' ') return Name_Id
3135 Select_Buffer : String (1 .. Hostparm.Max_Name_Length);
3136 Select_Len : Natural;
3139 Get_Name_String (Chars (Selector));
3140 Select_Len := Name_Len;
3141 Select_Buffer (1 .. Select_Len) := Name_Buffer (1 .. Name_Len);
3142 Get_Name_String (Chars (Prefix));
3144 -- If scope is anonymous type, discard suffix to recover name of
3145 -- single protected object. Otherwise use protected type name.
3147 if Name_Buffer (Name_Len) = 'T' then
3148 Name_Len := Name_Len - 1;
3151 Name_Buffer (Name_Len + 1) := '_';
3152 Name_Buffer (Name_Len + 2) := '_';
3154 Name_Len := Name_Len + 2;
3155 for J in 1 .. Select_Len loop
3156 Name_Len := Name_Len + 1;
3157 Name_Buffer (Name_Len) := Select_Buffer (J);
3160 -- Now add the Append_Char if specified. The encoding to follow
3161 -- depends on the type of entity. If Append_Char is either 'N' or 'P',
3162 -- then the entity is associated to a protected type subprogram.
3163 -- Otherwise, it is a protected type entry. For each case, the
3164 -- encoding to follow for the suffix is documented in exp_dbug.ads.
3166 -- It would be better to encapsulate this as a routine in Exp_Dbug ???
3168 if Append_Char /= ' ' then
3169 if Append_Char = 'P' or Append_Char = 'N' then
3170 Name_Len := Name_Len + 1;
3171 Name_Buffer (Name_Len) := Append_Char;
3174 Name_Buffer (Name_Len + 1) := '_';
3175 Name_Buffer (Name_Len + 2) := Append_Char;
3176 Name_Len := Name_Len + 2;
3177 return New_External_Name (Name_Find, ' ', -1);
3182 end Build_Selected_Name;
3184 -----------------------------
3185 -- Build_Simple_Entry_Call --
3186 -----------------------------
3188 -- A task entry call is converted to a call to Call_Simple
3191 -- P : parms := (parm, parm, parm);
3193 -- Call_Simple (acceptor-task, entry-index, P'Address);
3199 -- Here Pnn is an aggregate of the type constructed for the entry to hold
3200 -- the parameters, and the constructed aggregate value contains either the
3201 -- parameters or, in the case of non-elementary types, references to these
3202 -- parameters. Then the address of this aggregate is passed to the runtime
3203 -- routine, along with the task id value and the task entry index value.
3204 -- Pnn is only required if parameters are present.
3206 -- The assignments after the call are present only in the case of in-out
3207 -- or out parameters for elementary types, and are used to assign back the
3208 -- resulting values of such parameters.
3210 -- Note: the reason that we insert a block here is that in the context
3211 -- of selects, conditional entry calls etc. the entry call statement
3212 -- appears on its own, not as an element of a list.
3214 -- A protected entry call is converted to a Protected_Entry_Call:
3217 -- P : E1_Params := (param, param, param);
3219 -- Bnn : Communications_Block;
3222 -- P : E1_Params := (param, param, param);
3223 -- Bnn : Communications_Block;
3226 -- Protected_Entry_Call (
3227 -- Object => po._object'Access,
3228 -- E => <entry index>;
3229 -- Uninterpreted_Data => P'Address;
3230 -- Mode => Simple_Call;
3237 procedure Build_Simple_Entry_Call
3246 -- If call has been inlined, nothing left to do
3248 if Nkind (N) = N_Block_Statement then
3252 -- Convert entry call to Call_Simple call
3255 Loc : constant Source_Ptr := Sloc (N);
3256 Parms : constant List_Id := Parameter_Associations (N);
3257 Stats : constant List_Id := New_List;
3260 Comm_Name : Entity_Id;
3264 Ent_Acc : Entity_Id;
3266 Iface_Tag : Entity_Id;
3267 Iface_Typ : Entity_Id;
3280 -- Simple entry and entry family cases merge here
3282 Ent := Entity (Ename);
3283 Ent_Acc := Entry_Parameters_Type (Ent);
3284 Conctyp := Etype (Concval);
3286 -- If prefix is an access type, dereference to obtain the task type
3288 if Is_Access_Type (Conctyp) then
3289 Conctyp := Designated_Type (Conctyp);
3292 -- Special case for protected subprogram calls
3294 if Is_Protected_Type (Conctyp)
3295 and then Is_Subprogram (Entity (Ename))
3297 if not Is_Eliminated (Entity (Ename)) then
3298 Build_Protected_Subprogram_Call
3299 (N, Ename, Convert_Concurrent (Concval, Conctyp));
3306 -- First parameter is the Task_Id value from the task value or the
3307 -- Object from the protected object value, obtained by selecting
3308 -- the _Task_Id or _Object from the result of doing an unchecked
3309 -- conversion to convert the value to the corresponding record type.
3311 if Nkind (Concval) = N_Function_Call
3312 and then Is_Task_Type (Conctyp)
3313 and then Ada_Version >= Ada_05
3316 Obj : constant Entity_Id :=
3317 Make_Defining_Identifier (Loc, New_Internal_Name ('F'));
3322 Make_Object_Declaration (Loc,
3323 Defining_Identifier => Obj,
3324 Object_Definition => New_Occurrence_Of (Conctyp, Loc),
3325 Expression => Relocate_Node (Concval));
3326 Set_Etype (Obj, Conctyp);
3327 Decls := New_List (Decl);
3328 Rewrite (Concval, New_Occurrence_Of (Obj, Loc));
3335 Parm1 := Concurrent_Ref (Concval);
3337 -- Second parameter is the entry index, computed by the routine
3338 -- provided for this purpose. The value of this expression is
3339 -- assigned to an intermediate variable to assure that any entry
3340 -- family index expressions are evaluated before the entry
3344 or else Restriction_Active (No_Entry_Queue) = False
3345 or else not Is_Protected_Type (Conctyp)
3346 or else Number_Entries (Conctyp) > 1
3347 or else (Has_Attach_Handler (Conctyp)
3348 and then not Restricted_Profile)
3350 X := Make_Defining_Identifier (Loc, Name_uX);
3353 Make_Object_Declaration (Loc,
3354 Defining_Identifier => X,
3355 Object_Definition =>
3356 New_Reference_To (RTE (RE_Task_Entry_Index), Loc),
3357 Expression => Actual_Index_Expression (
3358 Loc, Entity (Ename), Index, Concval));
3360 Append_To (Decls, Xdecl);
3361 Parm2 := New_Reference_To (X, Loc);
3368 -- The third parameter is the packaged parameters. If there are
3369 -- none, then it is just the null address, since nothing is passed.
3372 Parm3 := New_Reference_To (RTE (RE_Null_Address), Loc);
3375 -- Case of parameters present, where third argument is the address
3376 -- of a packaged record containing the required parameter values.
3379 -- First build a list of parameter values, which are references to
3380 -- objects of the parameter types.
3384 Actual := First_Actual (N);
3385 Formal := First_Formal (Ent);
3387 while Present (Actual) loop
3389 -- If it is a by_copy_type, copy it to a new variable. The
3390 -- packaged record has a field that points to this variable.
3392 if Is_By_Copy_Type (Etype (Actual)) then
3394 Make_Object_Declaration (Loc,
3395 Defining_Identifier =>
3396 Make_Defining_Identifier (Loc,
3397 Chars => New_Internal_Name ('J')),
3398 Aliased_Present => True,
3399 Object_Definition =>
3400 New_Reference_To (Etype (Formal), Loc));
3402 -- Mark the object as not needing initialization since the
3403 -- initialization is performed separately, avoiding errors
3404 -- on cases such as formals of null-excluding access types.
3406 Set_No_Initialization (N_Node);
3408 -- We must make an assignment statement separate for the
3409 -- case of limited type. We cannot assign it unless the
3410 -- Assignment_OK flag is set first. An out formal of an
3411 -- access type must also be initialized from the actual,
3412 -- as stated in RM 6.4.1 (13).
3414 if Ekind (Formal) /= E_Out_Parameter
3415 or else Is_Access_Type (Etype (Formal))
3418 New_Reference_To (Defining_Identifier (N_Node), Loc);
3419 Set_Assignment_OK (N_Var);
3421 Make_Assignment_Statement (Loc,
3423 Expression => Relocate_Node (Actual)));
3426 Append (N_Node, Decls);
3429 Make_Attribute_Reference (Loc,
3430 Attribute_Name => Name_Unchecked_Access,
3432 New_Reference_To (Defining_Identifier (N_Node), Loc)));
3434 -- Interface class-wide formal
3436 if Ada_Version >= Ada_05
3437 and then Ekind (Etype (Formal)) = E_Class_Wide_Type
3438 and then Is_Interface (Etype (Formal))
3440 Iface_Typ := Etype (Etype (Formal));
3443 -- formal_iface_type! (actual.iface_tag)'reference
3446 Find_Interface_Tag (Etype (Actual), Iface_Typ);
3447 pragma Assert (Present (Iface_Tag));
3450 Make_Reference (Loc,
3451 Unchecked_Convert_To (Iface_Typ,
3452 Make_Selected_Component (Loc,
3454 Relocate_Node (Actual),
3456 New_Reference_To (Iface_Tag, Loc)))));
3462 Make_Reference (Loc, Relocate_Node (Actual)));
3466 Next_Actual (Actual);
3467 Next_Formal_With_Extras (Formal);
3470 -- Now build the declaration of parameters initialized with the
3471 -- aggregate containing this constructed parameter list.
3473 P := Make_Defining_Identifier (Loc, Name_uP);
3476 Make_Object_Declaration (Loc,
3477 Defining_Identifier => P,
3478 Object_Definition =>
3479 New_Reference_To (Designated_Type (Ent_Acc), Loc),
3481 Make_Aggregate (Loc, Expressions => Plist));
3484 Make_Attribute_Reference (Loc,
3485 Prefix => New_Reference_To (P, Loc),
3486 Attribute_Name => Name_Address);
3488 Append (Pdecl, Decls);
3491 -- Now we can create the call, case of protected type
3493 if Is_Protected_Type (Conctyp) then
3494 case Corresponding_Runtime_Package (Conctyp) is
3495 when System_Tasking_Protected_Objects_Entries =>
3497 -- Change the type of the index declaration
3499 Set_Object_Definition (Xdecl,
3500 New_Reference_To (RTE (RE_Protected_Entry_Index), Loc));
3502 -- Some additional declarations for protected entry calls
3508 -- Bnn : Communications_Block;
3511 Make_Defining_Identifier (Loc, New_Internal_Name ('B'));
3514 Make_Object_Declaration (Loc,
3515 Defining_Identifier => Comm_Name,
3516 Object_Definition =>
3517 New_Reference_To (RTE (RE_Communication_Block), Loc)));
3519 -- Some additional statements for protected entry calls
3521 -- Protected_Entry_Call (
3522 -- Object => po._object'Access,
3523 -- E => <entry index>;
3524 -- Uninterpreted_Data => P'Address;
3525 -- Mode => Simple_Call;
3529 Make_Procedure_Call_Statement (Loc,
3531 New_Reference_To (RTE (RE_Protected_Entry_Call), Loc),
3533 Parameter_Associations => New_List (
3534 Make_Attribute_Reference (Loc,
3535 Attribute_Name => Name_Unchecked_Access,
3539 New_Reference_To (RTE (RE_Simple_Call), Loc),
3540 New_Occurrence_Of (Comm_Name, Loc)));
3542 when System_Tasking_Protected_Objects_Single_Entry =>
3543 -- Protected_Single_Entry_Call (
3544 -- Object => po._object'Access,
3545 -- Uninterpreted_Data => P'Address;
3546 -- Mode => Simple_Call);
3549 Make_Procedure_Call_Statement (Loc,
3550 Name => New_Reference_To (
3551 RTE (RE_Protected_Single_Entry_Call), Loc),
3553 Parameter_Associations => New_List (
3554 Make_Attribute_Reference (Loc,
3555 Attribute_Name => Name_Unchecked_Access,
3558 New_Reference_To (RTE (RE_Simple_Call), Loc)));
3561 raise Program_Error;
3564 -- Case of task type
3568 Make_Procedure_Call_Statement (Loc,
3569 Name => New_Reference_To (RTE (RE_Call_Simple), Loc),
3570 Parameter_Associations => New_List (Parm1, Parm2, Parm3));
3574 Append_To (Stats, Call);
3576 -- If there are out or in/out parameters by copy add assignment
3577 -- statements for the result values.
3579 if Present (Parms) then
3580 Actual := First_Actual (N);
3581 Formal := First_Formal (Ent);
3583 Set_Assignment_OK (Actual);
3584 while Present (Actual) loop
3585 if Is_By_Copy_Type (Etype (Actual))
3586 and then Ekind (Formal) /= E_In_Parameter
3589 Make_Assignment_Statement (Loc,
3590 Name => New_Copy (Actual),
3592 Make_Explicit_Dereference (Loc,
3593 Make_Selected_Component (Loc,
3594 Prefix => New_Reference_To (P, Loc),
3596 Make_Identifier (Loc, Chars (Formal)))));
3598 -- In all cases (including limited private types) we want
3599 -- the assignment to be valid.
3601 Set_Assignment_OK (Name (N_Node));
3603 -- If the call is the triggering alternative in an
3604 -- asynchronous select, or the entry_call alternative of a
3605 -- conditional entry call, the assignments for in-out
3606 -- parameters are incorporated into the statement list that
3607 -- follows, so that there are executed only if the entry
3610 if (Nkind (Parent (N)) = N_Triggering_Alternative
3611 and then N = Triggering_Statement (Parent (N)))
3613 (Nkind (Parent (N)) = N_Entry_Call_Alternative
3614 and then N = Entry_Call_Statement (Parent (N)))
3616 if No (Statements (Parent (N))) then
3617 Set_Statements (Parent (N), New_List);
3620 Prepend (N_Node, Statements (Parent (N)));
3623 Insert_After (Call, N_Node);
3627 Next_Actual (Actual);
3628 Next_Formal_With_Extras (Formal);
3632 -- Finally, create block and analyze it
3635 Make_Block_Statement (Loc,
3636 Declarations => Decls,
3637 Handled_Statement_Sequence =>
3638 Make_Handled_Sequence_Of_Statements (Loc,
3639 Statements => Stats)));
3643 end Build_Simple_Entry_Call;
3645 --------------------------------
3646 -- Build_Task_Activation_Call --
3647 --------------------------------
3649 procedure Build_Task_Activation_Call (N : Node_Id) is
3650 Loc : constant Source_Ptr := Sloc (N);
3657 -- Get the activation chain entity. Except in the case of a package
3658 -- body, this is in the node that was passed. For a package body, we
3659 -- have to find the corresponding package declaration node.
3661 if Nkind (N) = N_Package_Body then
3662 P := Corresponding_Spec (N);
3665 exit when Nkind (P) = N_Package_Declaration;
3668 Chain := Activation_Chain_Entity (P);
3671 Chain := Activation_Chain_Entity (N);
3674 if Present (Chain) then
3675 if Restricted_Profile then
3676 Name := New_Reference_To (RTE (RE_Activate_Restricted_Tasks), Loc);
3678 Name := New_Reference_To (RTE (RE_Activate_Tasks), Loc);
3682 Make_Procedure_Call_Statement (Loc,
3684 Parameter_Associations =>
3685 New_List (Make_Attribute_Reference (Loc,
3686 Prefix => New_Occurrence_Of (Chain, Loc),
3687 Attribute_Name => Name_Unchecked_Access)));
3689 if Nkind (N) = N_Package_Declaration then
3690 if Present (Corresponding_Body (N)) then
3693 elsif Present (Private_Declarations (Specification (N))) then
3694 Append (Call, Private_Declarations (Specification (N)));
3697 Append (Call, Visible_Declarations (Specification (N)));
3701 if Present (Handled_Statement_Sequence (N)) then
3703 -- The call goes at the start of the statement sequence
3704 -- after the start of exception range label if one is present.
3710 Stm := First (Statements (Handled_Statement_Sequence (N)));
3712 -- A special case, skip exception range label if one is
3713 -- present (from front end zcx processing).
3715 if Nkind (Stm) = N_Label and then Exception_Junk (Stm) then
3719 -- Another special case, if the first statement is a block
3720 -- from optimization of a local raise to a goto, then the
3721 -- call goes inside this block.
3723 if Nkind (Stm) = N_Block_Statement
3724 and then Exception_Junk (Stm)
3727 First (Statements (Handled_Statement_Sequence (Stm)));
3730 -- Insertion point is after any exception label pushes,
3731 -- since we want it covered by any local handlers.
3733 while Nkind (Stm) in N_Push_xxx_Label loop
3737 -- Now we have the proper insertion point
3739 Insert_Before (Stm, Call);
3743 Set_Handled_Statement_Sequence (N,
3744 Make_Handled_Sequence_Of_Statements (Loc,
3745 Statements => New_List (Call)));
3750 Check_Task_Activation (N);
3752 end Build_Task_Activation_Call;
3754 -------------------------------
3755 -- Build_Task_Allocate_Block --
3756 -------------------------------
3758 procedure Build_Task_Allocate_Block
3763 T : constant Entity_Id := Entity (Expression (N));
3764 Init : constant Entity_Id := Base_Init_Proc (T);
3765 Loc : constant Source_Ptr := Sloc (N);
3766 Chain : constant Entity_Id :=
3767 Make_Defining_Identifier (Loc, Name_uChain);
3773 Blkent := Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
3776 Make_Block_Statement (Loc,
3777 Identifier => New_Reference_To (Blkent, Loc),
3778 Declarations => New_List (
3780 -- _Chain : Activation_Chain;
3782 Make_Object_Declaration (Loc,
3783 Defining_Identifier => Chain,
3784 Aliased_Present => True,
3785 Object_Definition =>
3786 New_Reference_To (RTE (RE_Activation_Chain), Loc))),
3788 Handled_Statement_Sequence =>
3789 Make_Handled_Sequence_Of_Statements (Loc,
3791 Statements => New_List (
3795 Make_Procedure_Call_Statement (Loc,
3796 Name => New_Reference_To (Init, Loc),
3797 Parameter_Associations => Args),
3799 -- Activate_Tasks (_Chain);
3801 Make_Procedure_Call_Statement (Loc,
3802 Name => New_Reference_To (RTE (RE_Activate_Tasks), Loc),
3803 Parameter_Associations => New_List (
3804 Make_Attribute_Reference (Loc,
3805 Prefix => New_Reference_To (Chain, Loc),
3806 Attribute_Name => Name_Unchecked_Access))))),
3808 Has_Created_Identifier => True,
3809 Is_Task_Allocation_Block => True);
3812 Make_Implicit_Label_Declaration (Loc,
3813 Defining_Identifier => Blkent,
3814 Label_Construct => Block));
3816 Append_To (Actions, Block);
3818 Set_Activation_Chain_Entity (Block, Chain);
3819 end Build_Task_Allocate_Block;
3821 -----------------------------------------------
3822 -- Build_Task_Allocate_Block_With_Init_Stmts --
3823 -----------------------------------------------
3825 procedure Build_Task_Allocate_Block_With_Init_Stmts
3828 Init_Stmts : List_Id)
3830 Loc : constant Source_Ptr := Sloc (N);
3831 Chain : constant Entity_Id :=
3832 Make_Defining_Identifier (Loc, Name_uChain);
3837 Blkent := Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
3839 Append_To (Init_Stmts,
3840 Make_Procedure_Call_Statement (Loc,
3841 Name => New_Reference_To (RTE (RE_Activate_Tasks), Loc),
3842 Parameter_Associations => New_List (
3843 Make_Attribute_Reference (Loc,
3844 Prefix => New_Reference_To (Chain, Loc),
3845 Attribute_Name => Name_Unchecked_Access))));
3848 Make_Block_Statement (Loc,
3849 Identifier => New_Reference_To (Blkent, Loc),
3850 Declarations => New_List (
3852 -- _Chain : Activation_Chain;
3854 Make_Object_Declaration (Loc,
3855 Defining_Identifier => Chain,
3856 Aliased_Present => True,
3857 Object_Definition =>
3858 New_Reference_To (RTE (RE_Activation_Chain), Loc))),
3860 Handled_Statement_Sequence =>
3861 Make_Handled_Sequence_Of_Statements (Loc, Init_Stmts),
3863 Has_Created_Identifier => True,
3864 Is_Task_Allocation_Block => True);
3867 Make_Implicit_Label_Declaration (Loc,
3868 Defining_Identifier => Blkent,
3869 Label_Construct => Block));
3871 Append_To (Actions, Block);
3873 Set_Activation_Chain_Entity (Block, Chain);
3874 end Build_Task_Allocate_Block_With_Init_Stmts;
3876 -----------------------------------
3877 -- Build_Task_Proc_Specification --
3878 -----------------------------------
3880 function Build_Task_Proc_Specification (T : Entity_Id) return Node_Id is
3881 Loc : constant Source_Ptr := Sloc (T);
3882 Spec_Id : Entity_Id;
3886 Make_Defining_Identifier (Loc,
3887 Chars => New_External_Name (Chars (T), 'B'));
3888 Set_Is_Internal (Spec_Id);
3890 -- Associate the procedure with the task, if this is the declaration
3891 -- (and not the body) of the procedure.
3893 if No (Task_Body_Procedure (T)) then
3894 Set_Task_Body_Procedure (T, Spec_Id);
3898 Make_Procedure_Specification (Loc,
3899 Defining_Unit_Name => Spec_Id,
3900 Parameter_Specifications => New_List (
3901 Make_Parameter_Specification (Loc,
3902 Defining_Identifier =>
3903 Make_Defining_Identifier (Loc, Name_uTask),
3905 Make_Access_Definition (Loc,
3907 New_Reference_To (Corresponding_Record_Type (T), Loc)))));
3908 end Build_Task_Proc_Specification;
3910 ---------------------------------------
3911 -- Build_Unprotected_Subprogram_Body --
3912 ---------------------------------------
3914 function Build_Unprotected_Subprogram_Body
3916 Pid : Node_Id) return Node_Id
3918 Decls : constant List_Id := Declarations (N);
3921 -- Add renamings for the Protection object, discriminals, privals and
3922 -- the entry index constant for use by debugger.
3924 Debug_Private_Data_Declarations (Decls);
3926 -- Make an unprotected version of the subprogram for use within the same
3927 -- object, with a new name and an additional parameter representing the
3931 Make_Subprogram_Body (Sloc (N),
3933 Build_Protected_Sub_Specification (N, Pid, Unprotected_Mode),
3934 Declarations => Decls,
3935 Handled_Statement_Sequence => Handled_Statement_Sequence (N));
3936 end Build_Unprotected_Subprogram_Body;
3938 ----------------------------
3939 -- Collect_Entry_Families --
3940 ----------------------------
3942 procedure Collect_Entry_Families
3945 Current_Node : in out Node_Id;
3946 Conctyp : Entity_Id)
3949 Efam_Decl : Node_Id;
3950 Efam_Type : Entity_Id;
3953 Efam := First_Entity (Conctyp);
3954 while Present (Efam) loop
3955 if Ekind (Efam) = E_Entry_Family then
3957 Make_Defining_Identifier (Loc,
3958 Chars => New_Internal_Name ('F'));
3963 (Etype (Discrete_Subtype_Definition (Parent (Efam))));
3965 Bas_Decl : Node_Id := Empty;
3970 (Discrete_Subtype_Definition (Parent (Efam)), Lo, Hi);
3972 if Is_Potentially_Large_Family (Bas, Conctyp, Lo, Hi) then
3974 Make_Defining_Identifier (Loc,
3975 Chars => New_Internal_Name ('B'));
3978 Make_Subtype_Declaration (Loc,
3979 Defining_Identifier => Bas,
3980 Subtype_Indication =>
3981 Make_Subtype_Indication (Loc,
3983 New_Occurrence_Of (Standard_Integer, Loc),
3985 Make_Range_Constraint (Loc,
3986 Range_Expression => Make_Range (Loc,
3987 Make_Integer_Literal
3988 (Loc, -Entry_Family_Bound),
3989 Make_Integer_Literal
3990 (Loc, Entry_Family_Bound - 1)))));
3992 Insert_After (Current_Node, Bas_Decl);
3993 Current_Node := Bas_Decl;
3998 Make_Full_Type_Declaration (Loc,
3999 Defining_Identifier => Efam_Type,
4001 Make_Unconstrained_Array_Definition (Loc,
4003 (New_List (New_Occurrence_Of (Bas, Loc))),
4005 Component_Definition =>
4006 Make_Component_Definition (Loc,
4007 Aliased_Present => False,
4008 Subtype_Indication =>
4009 New_Reference_To (Standard_Character, Loc))));
4012 Insert_After (Current_Node, Efam_Decl);
4013 Current_Node := Efam_Decl;
4014 Analyze (Efam_Decl);
4017 Make_Component_Declaration (Loc,
4018 Defining_Identifier =>
4019 Make_Defining_Identifier (Loc, Chars (Efam)),
4021 Component_Definition =>
4022 Make_Component_Definition (Loc,
4023 Aliased_Present => False,
4024 Subtype_Indication =>
4025 Make_Subtype_Indication (Loc,
4027 New_Occurrence_Of (Efam_Type, Loc),
4030 Make_Index_Or_Discriminant_Constraint (Loc,
4031 Constraints => New_List (
4033 (Etype (Discrete_Subtype_Definition
4034 (Parent (Efam))), Loc)))))));
4040 end Collect_Entry_Families;
4042 -----------------------
4043 -- Concurrent_Object --
4044 -----------------------
4046 function Concurrent_Object
4047 (Spec_Id : Entity_Id;
4048 Conc_Typ : Entity_Id) return Entity_Id
4051 -- Parameter _O or _object
4053 if Is_Protected_Type (Conc_Typ) then
4054 return First_Formal (Protected_Body_Subprogram (Spec_Id));
4059 pragma Assert (Is_Task_Type (Conc_Typ));
4060 return First_Formal (Task_Body_Procedure (Conc_Typ));
4062 end Concurrent_Object;
4064 ----------------------
4065 -- Copy_Result_Type --
4066 ----------------------
4068 function Copy_Result_Type (Res : Node_Id) return Node_Id is
4069 New_Res : constant Node_Id := New_Copy_Tree (Res);
4074 -- If the result type is an access_to_subprogram, we must create
4075 -- new entities for its spec.
4077 if Nkind (New_Res) = N_Access_Definition
4078 and then Present (Access_To_Subprogram_Definition (New_Res))
4080 -- Provide new entities for the formals
4082 Par_Spec := First (Parameter_Specifications
4083 (Access_To_Subprogram_Definition (New_Res)));
4084 while Present (Par_Spec) loop
4085 Formal := Defining_Identifier (Par_Spec);
4086 Set_Defining_Identifier (Par_Spec,
4087 Make_Defining_Identifier (Sloc (Formal), Chars (Formal)));
4093 end Copy_Result_Type;
4095 --------------------
4096 -- Concurrent_Ref --
4097 --------------------
4099 -- The expression returned for a reference to a concurrent object has the
4102 -- taskV!(name)._Task_Id
4106 -- objectV!(name)._Object
4108 -- for a protected object. For the case of an access to a concurrent
4109 -- object, there is an extra explicit dereference:
4111 -- taskV!(name.all)._Task_Id
4112 -- objectV!(name.all)._Object
4114 -- here taskV and objectV are the types for the associated records, which
4115 -- contain the required _Task_Id and _Object fields for tasks and protected
4116 -- objects, respectively.
4118 -- For the case of a task type name, the expression is
4122 -- i.e. a call to the Self function which returns precisely this Task_Id
4124 -- For the case of a protected type name, the expression is
4128 -- which is a renaming of the _object field of the current object
4129 -- record, passed into protected operations as a parameter.
4131 function Concurrent_Ref (N : Node_Id) return Node_Id is
4132 Loc : constant Source_Ptr := Sloc (N);
4133 Ntyp : constant Entity_Id := Etype (N);
4137 function Is_Current_Task (T : Entity_Id) return Boolean;
4138 -- Check whether the reference is to the immediately enclosing task
4139 -- type, or to an outer one (rare but legal).
4141 ---------------------
4142 -- Is_Current_Task --
4143 ---------------------
4145 function Is_Current_Task (T : Entity_Id) return Boolean is
4149 Scop := Current_Scope;
4150 while Present (Scop)
4151 and then Scop /= Standard_Standard
4157 elsif Is_Task_Type (Scop) then
4160 -- If this is a procedure nested within the task type, we must
4161 -- assume that it can be called from an inner task, and therefore
4162 -- cannot treat it as a local reference.
4164 elsif Is_Overloadable (Scop)
4165 and then In_Open_Scopes (T)
4170 Scop := Scope (Scop);
4174 -- We know that we are within the task body, so should have found it
4177 raise Program_Error;
4178 end Is_Current_Task;
4180 -- Start of processing for Concurrent_Ref
4183 if Is_Access_Type (Ntyp) then
4184 Dtyp := Designated_Type (Ntyp);
4186 if Is_Protected_Type (Dtyp) then
4187 Sel := Name_uObject;
4189 Sel := Name_uTask_Id;
4193 Make_Selected_Component (Loc,
4195 Unchecked_Convert_To (Corresponding_Record_Type (Dtyp),
4196 Make_Explicit_Dereference (Loc, N)),
4197 Selector_Name => Make_Identifier (Loc, Sel));
4199 elsif Is_Entity_Name (N)
4200 and then Is_Concurrent_Type (Entity (N))
4202 if Is_Task_Type (Entity (N)) then
4204 if Is_Current_Task (Entity (N)) then
4206 Make_Function_Call (Loc,
4207 Name => New_Reference_To (RTE (RE_Self), Loc));
4212 T_Self : constant Entity_Id :=
4213 Make_Defining_Identifier (Loc,
4214 Chars => New_Internal_Name ('T'));
4215 T_Body : constant Node_Id :=
4216 Parent (Corresponding_Body (Parent (Entity (N))));
4219 Decl := Make_Object_Declaration (Loc,
4220 Defining_Identifier => T_Self,
4221 Object_Definition =>
4222 New_Occurrence_Of (RTE (RO_ST_Task_Id), Loc),
4224 Make_Function_Call (Loc,
4225 Name => New_Reference_To (RTE (RE_Self), Loc)));
4226 Prepend (Decl, Declarations (T_Body));
4228 Set_Scope (T_Self, Entity (N));
4229 return New_Occurrence_Of (T_Self, Loc);
4234 pragma Assert (Is_Protected_Type (Entity (N)));
4237 New_Reference_To (Find_Protection_Object (Current_Scope), Loc);
4241 if Is_Protected_Type (Ntyp) then
4242 Sel := Name_uObject;
4244 elsif Is_Task_Type (Ntyp) then
4245 Sel := Name_uTask_Id;
4248 raise Program_Error;
4252 Make_Selected_Component (Loc,
4254 Unchecked_Convert_To (Corresponding_Record_Type (Ntyp),
4256 Selector_Name => Make_Identifier (Loc, Sel));
4260 ------------------------
4261 -- Convert_Concurrent --
4262 ------------------------
4264 function Convert_Concurrent
4266 Typ : Entity_Id) return Node_Id
4269 if not Is_Concurrent_Type (Typ) then
4273 Unchecked_Convert_To (Corresponding_Record_Type (Typ),
4276 end Convert_Concurrent;
4278 -------------------------------------
4279 -- Debug_Private_Data_Declarations --
4280 -------------------------------------
4282 procedure Debug_Private_Data_Declarations (Decls : List_Id) is
4283 Debug_Nod : Node_Id;
4287 Decl := First (Decls);
4288 while Present (Decl)
4289 and then not Comes_From_Source (Decl)
4291 -- Declaration for concurrent entity _object and its access type,
4292 -- along with the entry index subtype:
4293 -- type prot_typVP is access prot_typV;
4294 -- _object : prot_typVP := prot_typV (_O);
4295 -- subtype Jnn is <Type of Index> range Low .. High;
4297 if Nkind_In (Decl, N_Full_Type_Declaration, N_Object_Declaration) then
4298 Set_Debug_Info_Needed (Defining_Identifier (Decl));
4300 -- Declaration for the Protection object, discriminals, privals and
4301 -- entry index constant:
4302 -- conc_typR : protection_typ renames _object._object;
4303 -- discr_nameD : discr_typ renames _object.discr_name;
4304 -- discr_nameD : discr_typ renames _task.discr_name;
4305 -- prival_name : comp_typ renames _object.comp_name;
4306 -- J : constant Jnn :=
4307 -- Jnn'Val (_E - <Index expression> + Jnn'Pos (Jnn'First));
4309 elsif Nkind (Decl) = N_Object_Renaming_Declaration then
4310 Set_Debug_Info_Needed (Defining_Identifier (Decl));
4311 Debug_Nod := Debug_Renaming_Declaration (Decl);
4313 if Present (Debug_Nod) then
4314 Insert_After (Decl, Debug_Nod);
4320 end Debug_Private_Data_Declarations;
4322 ----------------------------
4323 -- Entry_Index_Expression --
4324 ----------------------------
4326 function Entry_Index_Expression
4330 Ttyp : Entity_Id) return Node_Id
4340 -- The queues of entries and entry families appear in textual order in
4341 -- the associated record. The entry index is computed as the sum of the
4342 -- number of queues for all entries that precede the designated one, to
4343 -- which is added the index expression, if this expression denotes a
4344 -- member of a family.
4346 -- The following is a place holder for the count of simple entries
4348 Num := Make_Integer_Literal (Sloc, 1);
4350 -- We construct an expression which is a series of addition operations.
4351 -- The first operand is the number of single entries that precede this
4352 -- one, the second operand is the index value relative to the start of
4353 -- the referenced family, and the remaining operands are the lengths of
4354 -- the entry families that precede this entry, i.e. the constructed
4357 -- number_simple_entries +
4358 -- (s'pos (index-value) - s'pos (family'first)) + 1 +
4359 -- family'length + ...
4361 -- where index-value is the given index value, and s is the index
4362 -- subtype (we have to use pos because the subtype might be an
4363 -- enumeration type preventing direct subtraction). Note that the task
4364 -- entry array is one-indexed.
4366 -- The upper bound of the entry family may be a discriminant, so we
4367 -- retrieve the lower bound explicitly to compute offset, rather than
4368 -- using the index subtype which may mention a discriminant.
4370 if Present (Index) then
4371 S := Etype (Discrete_Subtype_Definition (Declaration_Node (Ent)));
4380 Make_Attribute_Reference (Sloc,
4381 Attribute_Name => Name_Pos,
4382 Prefix => New_Reference_To (Base_Type (S), Sloc),
4383 Expressions => New_List (Relocate_Node (Index))),
4391 -- Now add lengths of preceding entries and entry families
4393 Prev := First_Entity (Ttyp);
4395 while Chars (Prev) /= Chars (Ent)
4396 or else (Ekind (Prev) /= Ekind (Ent))
4397 or else not Sem_Ch6.Type_Conformant (Ent, Prev)
4399 if Ekind (Prev) = E_Entry then
4400 Set_Intval (Num, Intval (Num) + 1);
4402 elsif Ekind (Prev) = E_Entry_Family then
4404 Etype (Discrete_Subtype_Definition (Declaration_Node (Prev)));
4405 Lo := Type_Low_Bound (S);
4406 Hi := Type_High_Bound (S);
4411 Right_Opnd => Family_Size (Sloc, Hi, Lo, Ttyp, False));
4413 -- Other components are anonymous types to be ignored
4423 end Entry_Index_Expression;
4425 ---------------------------
4426 -- Establish_Task_Master --
4427 ---------------------------
4429 procedure Establish_Task_Master (N : Node_Id) is
4432 if Restriction_Active (No_Task_Hierarchy) = False then
4433 Call := Build_Runtime_Call (Sloc (N), RE_Enter_Master);
4434 Prepend_To (Declarations (N), Call);
4437 end Establish_Task_Master;
4439 --------------------------------
4440 -- Expand_Accept_Declarations --
4441 --------------------------------
4443 -- Part of the expansion of an accept statement involves the creation of
4444 -- a declaration that can be referenced from the statement sequence of
4449 -- This declaration is inserted immediately before the accept statement
4450 -- and it is important that it be inserted before the statements of the
4451 -- statement sequence are analyzed. Thus it would be too late to create
4452 -- this declaration in the Expand_N_Accept_Statement routine, which is
4453 -- why there is a separate procedure to be called directly from Sem_Ch9.
4455 -- Ann is used to hold the address of the record containing the parameters
4456 -- (see Expand_N_Entry_Call for more details on how this record is built).
4457 -- References to the parameters do an unchecked conversion of this address
4458 -- to a pointer to the required record type, and then access the field that
4459 -- holds the value of the required parameter. The entity for the address
4460 -- variable is held as the top stack element (i.e. the last element) of the
4461 -- Accept_Address stack in the corresponding entry entity, and this element
4462 -- must be set in place before the statements are processed.
4464 -- The above description applies to the case of a stand alone accept
4465 -- statement, i.e. one not appearing as part of a select alternative.
4467 -- For the case of an accept that appears as part of a select alternative
4468 -- of a selective accept, we must still create the declaration right away,
4469 -- since Ann is needed immediately, but there is an important difference:
4471 -- The declaration is inserted before the selective accept, not before
4472 -- the accept statement (which is not part of a list anyway, and so would
4473 -- not accommodate inserted declarations)
4475 -- We only need one address variable for the entire selective accept. So
4476 -- the Ann declaration is created only for the first accept alternative,
4477 -- and subsequent accept alternatives reference the same Ann variable.
4479 -- We can distinguish the two cases by seeing whether the accept statement
4480 -- is part of a list. If not, then it must be in an accept alternative.
4482 -- To expand the requeue statement, a label is provided at the end of the
4483 -- accept statement or alternative of which it is a part, so that the
4484 -- statement can be skipped after the requeue is complete. This label is
4485 -- created here rather than during the expansion of the accept statement,
4486 -- because it will be needed by any requeue statements within the accept,
4487 -- which are expanded before the accept.
4489 procedure Expand_Accept_Declarations (N : Node_Id; Ent : Entity_Id) is
4490 Loc : constant Source_Ptr := Sloc (N);
4491 Stats : constant Node_Id := Handled_Statement_Sequence (N);
4492 Ann : Entity_Id := Empty;
4500 if Expander_Active then
4502 -- If we have no handled statement sequence, we may need to build
4503 -- a dummy sequence consisting of a null statement. This can be
4504 -- skipped if the trivial accept optimization is permitted.
4506 if not Trivial_Accept_OK
4508 (No (Stats) or else Null_Statements (Statements (Stats)))
4510 Set_Handled_Statement_Sequence (N,
4511 Make_Handled_Sequence_Of_Statements (Loc,
4512 New_List (Make_Null_Statement (Loc))));
4515 -- Create and declare two labels to be placed at the end of the
4516 -- accept statement. The first label is used to allow requeues to
4517 -- skip the remainder of entry processing. The second label is used
4518 -- to skip the remainder of entry processing if the rendezvous
4519 -- completes in the middle of the accept body.
4521 if Present (Handled_Statement_Sequence (N)) then
4522 Lab_Id := Make_Identifier (Loc, New_Internal_Name ('L'));
4524 Make_Defining_Identifier (Loc, Chars (Lab_Id)));
4525 Lab := Make_Label (Loc, Lab_Id);
4527 Make_Implicit_Label_Declaration (Loc,
4528 Defining_Identifier => Entity (Lab_Id),
4529 Label_Construct => Lab);
4530 Append (Lab, Statements (Handled_Statement_Sequence (N)));
4532 Lab_Id := Make_Identifier (Loc, New_Internal_Name ('L'));
4534 Make_Defining_Identifier (Loc, Chars (Lab_Id)));
4535 Lab := Make_Label (Loc, Lab_Id);
4537 Make_Implicit_Label_Declaration (Loc,
4538 Defining_Identifier => Entity (Lab_Id),
4539 Label_Construct => Lab);
4540 Append (Lab, Statements (Handled_Statement_Sequence (N)));
4547 -- Case of stand alone accept statement
4549 if Is_List_Member (N) then
4551 if Present (Handled_Statement_Sequence (N)) then
4553 Make_Defining_Identifier (Loc,
4554 Chars => New_Internal_Name ('A'));
4557 Make_Object_Declaration (Loc,
4558 Defining_Identifier => Ann,
4559 Object_Definition =>
4560 New_Reference_To (RTE (RE_Address), Loc));
4562 Insert_Before (N, Adecl);
4565 Insert_Before (N, Ldecl);
4568 Insert_Before (N, Ldecl2);
4572 -- Case of accept statement which is in an accept alternative
4576 Acc_Alt : constant Node_Id := Parent (N);
4577 Sel_Acc : constant Node_Id := Parent (Acc_Alt);
4581 pragma Assert (Nkind (Acc_Alt) = N_Accept_Alternative);
4582 pragma Assert (Nkind (Sel_Acc) = N_Selective_Accept);
4584 -- ??? Consider a single label for select statements
4586 if Present (Handled_Statement_Sequence (N)) then
4588 Statements (Handled_Statement_Sequence (N)));
4592 Statements (Handled_Statement_Sequence (N)));
4596 -- Find first accept alternative of the selective accept. A
4597 -- valid selective accept must have at least one accept in it.
4599 Alt := First (Select_Alternatives (Sel_Acc));
4601 while Nkind (Alt) /= N_Accept_Alternative loop
4605 -- If we are the first accept statement, then we have to create
4606 -- the Ann variable, as for the stand alone case, except that
4607 -- it is inserted before the selective accept. Similarly, a
4608 -- label for requeue expansion must be declared.
4610 if N = Accept_Statement (Alt) then
4612 Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
4615 Make_Object_Declaration (Loc,
4616 Defining_Identifier => Ann,
4617 Object_Definition =>
4618 New_Reference_To (RTE (RE_Address), Loc));
4620 Insert_Before (Sel_Acc, Adecl);
4623 -- If we are not the first accept statement, then find the Ann
4624 -- variable allocated by the first accept and use it.
4628 Node (Last_Elmt (Accept_Address
4629 (Entity (Entry_Direct_Name (Accept_Statement (Alt))))));
4634 -- Merge here with Ann either created or referenced, and Adecl
4635 -- pointing to the corresponding declaration. Remaining processing
4636 -- is the same for the two cases.
4638 if Present (Ann) then
4639 Append_Elmt (Ann, Accept_Address (Ent));
4640 Set_Debug_Info_Needed (Ann);
4643 -- Create renaming declarations for the entry formals. Each reference
4644 -- to a formal becomes a dereference of a component of the parameter
4645 -- block, whose address is held in Ann. These declarations are
4646 -- eventually inserted into the accept block, and analyzed there so
4647 -- that they have the proper scope for gdb and do not conflict with
4648 -- other declarations.
4650 if Present (Parameter_Specifications (N))
4651 and then Present (Handled_Statement_Sequence (N))
4661 Formal := First_Formal (Ent);
4663 while Present (Formal) loop
4664 Comp := Entry_Component (Formal);
4666 Make_Defining_Identifier (Loc, Chars (Formal));
4668 Set_Etype (New_F, Etype (Formal));
4669 Set_Scope (New_F, Ent);
4671 -- Now we set debug info needed on New_F even though it does
4672 -- not come from source, so that the debugger will get the
4673 -- right information for these generated names.
4675 Set_Debug_Info_Needed (New_F);
4677 if Ekind (Formal) = E_In_Parameter then
4678 Set_Ekind (New_F, E_Constant);
4680 Set_Ekind (New_F, E_Variable);
4681 Set_Extra_Constrained (New_F, Extra_Constrained (Formal));
4684 Set_Actual_Subtype (New_F, Actual_Subtype (Formal));
4687 Make_Object_Renaming_Declaration (Loc,
4688 Defining_Identifier =>
4691 New_Reference_To (Etype (Formal), Loc),
4693 Make_Explicit_Dereference (Loc,
4694 Make_Selected_Component (Loc,
4696 Unchecked_Convert_To (
4697 Entry_Parameters_Type (Ent),
4698 New_Reference_To (Ann, Loc)),
4700 New_Reference_To (Comp, Loc))));
4702 if No (Declarations (N)) then
4703 Set_Declarations (N, New_List);
4706 Append (Decl, Declarations (N));
4707 Set_Renamed_Object (Formal, New_F);
4708 Next_Formal (Formal);
4715 end Expand_Accept_Declarations;
4717 ---------------------------------------------
4718 -- Expand_Access_Protected_Subprogram_Type --
4719 ---------------------------------------------
4721 procedure Expand_Access_Protected_Subprogram_Type (N : Node_Id) is
4722 Loc : constant Source_Ptr := Sloc (N);
4724 T : constant Entity_Id := Defining_Identifier (N);
4725 D_T : constant Entity_Id := Designated_Type (T);
4726 D_T2 : constant Entity_Id := Make_Defining_Identifier (Loc,
4727 Chars => New_Internal_Name ('D'));
4728 E_T : constant Entity_Id := Make_Defining_Identifier (Loc,
4729 Chars => New_Internal_Name ('E'));
4730 P_List : constant List_Id := Build_Protected_Spec
4731 (N, RTE (RE_Address), D_T, False);
4737 -- Create access to subprogram with full signature
4739 if Etype (D_T) /= Standard_Void_Type then
4741 Make_Access_Function_Definition (Loc,
4742 Parameter_Specifications => P_List,
4743 Result_Definition =>
4744 Copy_Result_Type (Result_Definition (Type_Definition (N))));
4748 Make_Access_Procedure_Definition (Loc,
4749 Parameter_Specifications => P_List);
4753 Make_Full_Type_Declaration (Loc,
4754 Defining_Identifier => D_T2,
4755 Type_Definition => Def1);
4757 Insert_After (N, Decl1);
4760 -- Create Equivalent_Type, a record with two components for an access to
4761 -- object and an access to subprogram.
4764 Make_Component_Declaration (Loc,
4765 Defining_Identifier =>
4766 Make_Defining_Identifier (Loc, New_Internal_Name ('P')),
4767 Component_Definition =>
4768 Make_Component_Definition (Loc,
4769 Aliased_Present => False,
4770 Subtype_Indication =>
4771 New_Occurrence_Of (RTE (RE_Address), Loc))),
4773 Make_Component_Declaration (Loc,
4774 Defining_Identifier =>
4775 Make_Defining_Identifier (Loc, New_Internal_Name ('S')),
4776 Component_Definition =>
4777 Make_Component_Definition (Loc,
4778 Aliased_Present => False,
4779 Subtype_Indication => New_Occurrence_Of (D_T2, Loc))));
4782 Make_Full_Type_Declaration (Loc,
4783 Defining_Identifier => E_T,
4785 Make_Record_Definition (Loc,
4787 Make_Component_List (Loc,
4788 Component_Items => Comps)));
4790 Insert_After (Decl1, Decl2);
4792 Set_Equivalent_Type (T, E_T);
4793 end Expand_Access_Protected_Subprogram_Type;
4795 --------------------------
4796 -- Expand_Entry_Barrier --
4797 --------------------------
4799 procedure Expand_Entry_Barrier (N : Node_Id; Ent : Entity_Id) is
4800 Cond : constant Node_Id :=
4801 Condition (Entry_Body_Formal_Part (N));
4802 Prot : constant Entity_Id := Scope (Ent);
4803 Spec_Decl : constant Node_Id := Parent (Prot);
4806 Body_Decl : Node_Id;
4809 if No_Run_Time_Mode then
4810 Error_Msg_CRT ("entry barrier", N);
4814 -- The body of the entry barrier must be analyzed in the context of the
4815 -- protected object, but its scope is external to it, just as any other
4816 -- unprotected version of a protected operation. The specification has
4817 -- been produced when the protected type declaration was elaborated. We
4818 -- build the body, insert it in the enclosing scope, but analyze it in
4819 -- the current context. A more uniform approach would be to treat the
4820 -- barrier just as a protected function, and discard the protected
4821 -- version of it because it is never called.
4823 if Expander_Active then
4824 B_F := Build_Barrier_Function (N, Ent, Prot);
4825 Func := Barrier_Function (Ent);
4826 Set_Corresponding_Spec (B_F, Func);
4828 Body_Decl := Parent (Corresponding_Body (Spec_Decl));
4830 if Nkind (Parent (Body_Decl)) = N_Subunit then
4831 Body_Decl := Corresponding_Stub (Parent (Body_Decl));
4834 Insert_Before_And_Analyze (Body_Decl, B_F);
4836 Set_Discriminals (Spec_Decl);
4837 Set_Scope (Func, Scope (Prot));
4840 Analyze_And_Resolve (Cond, Any_Boolean);
4843 -- The Ravenscar profile restricts barriers to simple variables declared
4844 -- within the protected object. We also allow Boolean constants, since
4845 -- these appear in several published examples and are also allowed by
4846 -- the Aonix compiler.
4848 -- Note that after analysis variables in this context will be replaced
4849 -- by the corresponding prival, that is to say a renaming of a selected
4850 -- component of the form _Object.Var. If expansion is disabled, as
4851 -- within a generic, we check that the entity appears in the current
4854 if Is_Entity_Name (Cond) then
4856 -- A small optimization of useless renamings. If the scope of the
4857 -- entity of the condition is not the barrier function, then the
4858 -- condition does not reference any of the generated renamings
4859 -- within the function.
4862 and then Scope (Entity (Cond)) /= Func
4864 Set_Declarations (B_F, Empty_List);
4867 if Entity (Cond) = Standard_False
4869 Entity (Cond) = Standard_True
4873 elsif not Expander_Active
4874 and then Scope (Entity (Cond)) = Current_Scope
4878 -- Check for case of _object.all.field (note that the explicit
4879 -- dereference gets inserted by analyze/expand of _object.field)
4881 elsif Present (Renamed_Object (Entity (Cond)))
4883 Nkind (Renamed_Object (Entity (Cond))) = N_Selected_Component
4887 (Prefix (Renamed_Object (Entity (Cond))))) = Name_uObject
4893 -- It is not a boolean variable or literal, so check the restriction
4895 Check_Restriction (Simple_Barriers, Cond);
4896 end Expand_Entry_Barrier;
4898 ------------------------------
4899 -- Expand_N_Abort_Statement --
4900 ------------------------------
4902 -- Expand abort T1, T2, .. Tn; into:
4903 -- Abort_Tasks (Task_List'(1 => T1.Task_Id, 2 => T2.Task_Id ...))
4905 procedure Expand_N_Abort_Statement (N : Node_Id) is
4906 Loc : constant Source_Ptr := Sloc (N);
4907 Tlist : constant List_Id := Names (N);
4913 Aggr := Make_Aggregate (Loc, Component_Associations => New_List);
4916 Tasknm := First (Tlist);
4918 while Present (Tasknm) loop
4921 -- A task interface class-wide type object is being aborted.
4922 -- Retrieve its _task_id by calling a dispatching routine.
4924 if Ada_Version >= Ada_05
4925 and then Ekind (Etype (Tasknm)) = E_Class_Wide_Type
4926 and then Is_Interface (Etype (Tasknm))
4927 and then Is_Task_Interface (Etype (Tasknm))
4929 Append_To (Component_Associations (Aggr),
4930 Make_Component_Association (Loc,
4931 Choices => New_List (
4932 Make_Integer_Literal (Loc, Count)),
4935 -- Task_Id (Tasknm._disp_get_task_id)
4937 Make_Unchecked_Type_Conversion (Loc,
4939 New_Reference_To (RTE (RO_ST_Task_Id), Loc),
4941 Make_Selected_Component (Loc,
4943 New_Copy_Tree (Tasknm),
4945 Make_Identifier (Loc, Name_uDisp_Get_Task_Id)))));
4948 Append_To (Component_Associations (Aggr),
4949 Make_Component_Association (Loc,
4950 Choices => New_List (
4951 Make_Integer_Literal (Loc, Count)),
4952 Expression => Concurrent_Ref (Tasknm)));
4959 Make_Procedure_Call_Statement (Loc,
4960 Name => New_Reference_To (RTE (RE_Abort_Tasks), Loc),
4961 Parameter_Associations => New_List (
4962 Make_Qualified_Expression (Loc,
4963 Subtype_Mark => New_Reference_To (RTE (RE_Task_List), Loc),
4964 Expression => Aggr))));
4967 end Expand_N_Abort_Statement;
4969 -------------------------------
4970 -- Expand_N_Accept_Statement --
4971 -------------------------------
4973 -- This procedure handles expansion of accept statements that stand
4974 -- alone, i.e. they are not part of an accept alternative. The expansion
4975 -- of accept statement in accept alternatives is handled by the routines
4976 -- Expand_N_Accept_Alternative and Expand_N_Selective_Accept. The
4977 -- following description applies only to stand alone accept statements.
4979 -- If there is no handled statement sequence, or only null statements,
4980 -- then this is called a trivial accept, and the expansion is:
4982 -- Accept_Trivial (entry-index)
4984 -- If there is a handled statement sequence, then the expansion is:
4991 -- Accept_Call (entry-index, Ann);
4992 -- Renaming_Declarations for formals
4993 -- <statement sequence from N_Accept_Statement node>
4994 -- Complete_Rendezvous;
4999 -- <exception handler from N_Accept_Statement node>
5000 -- Complete_Rendezvous;
5002 -- <exception handler from N_Accept_Statement node>
5003 -- Complete_Rendezvous;
5008 -- when all others =>
5009 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
5012 -- The first three declarations were already inserted ahead of the accept
5013 -- statement by the Expand_Accept_Declarations procedure, which was called
5014 -- directly from the semantics during analysis of the accept statement,
5015 -- before analyzing its contained statements.
5017 -- The declarations from the N_Accept_Statement, as noted in Sinfo, come
5018 -- from possible expansion activity (the original source of course does
5019 -- not have any declarations associated with the accept statement, since
5020 -- an accept statement has no declarative part). In particular, if the
5021 -- expander is active, the first such declaration is the declaration of
5022 -- the Accept_Params_Ptr entity (see Sem_Ch9.Analyze_Accept_Statement).
5024 -- The two blocks are merged into a single block if the inner block has
5025 -- no exception handlers, but otherwise two blocks are required, since
5026 -- exceptions might be raised in the exception handlers of the inner
5027 -- block, and Exceptional_Complete_Rendezvous must be called.
5029 procedure Expand_N_Accept_Statement (N : Node_Id) is
5030 Loc : constant Source_Ptr := Sloc (N);
5031 Stats : constant Node_Id := Handled_Statement_Sequence (N);
5032 Ename : constant Node_Id := Entry_Direct_Name (N);
5033 Eindx : constant Node_Id := Entry_Index (N);
5034 Eent : constant Entity_Id := Entity (Ename);
5035 Acstack : constant Elist_Id := Accept_Address (Eent);
5036 Ann : constant Entity_Id := Node (Last_Elmt (Acstack));
5037 Ttyp : constant Entity_Id := Etype (Scope (Eent));
5042 -- Start of processing for Expand_N_Accept_Statement
5045 -- If accept statement is not part of a list, then its parent must be
5046 -- an accept alternative, and, as described above, we do not do any
5047 -- expansion for such accept statements at this level.
5049 if not Is_List_Member (N) then
5050 pragma Assert (Nkind (Parent (N)) = N_Accept_Alternative);
5053 -- Trivial accept case (no statement sequence, or null statements).
5054 -- If the accept statement has declarations, then just insert them
5055 -- before the procedure call.
5057 elsif Trivial_Accept_OK
5058 and then (No (Stats) or else Null_Statements (Statements (Stats)))
5060 -- Remove declarations for renamings, because the parameter block
5061 -- will not be assigned.
5068 D := First (Declarations (N));
5070 while Present (D) loop
5072 if Nkind (D) = N_Object_Renaming_Declaration then
5080 if Present (Declarations (N)) then
5081 Insert_Actions (N, Declarations (N));
5085 Make_Procedure_Call_Statement (Loc,
5086 Name => New_Reference_To (RTE (RE_Accept_Trivial), Loc),
5087 Parameter_Associations => New_List (
5088 Entry_Index_Expression (Loc, Entity (Ename), Eindx, Ttyp))));
5092 -- Discard Entry_Address that was created for it, so it will not be
5093 -- emitted if this accept statement is in the statement part of a
5094 -- delay alternative.
5096 if Present (Stats) then
5097 Remove_Last_Elmt (Acstack);
5100 -- Case of statement sequence present
5103 -- Construct the block, using the declarations from the accept
5104 -- statement if any to initialize the declarations of the block.
5106 Blkent := Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
5107 Set_Ekind (Blkent, E_Block);
5108 Set_Etype (Blkent, Standard_Void_Type);
5109 Set_Scope (Blkent, Current_Scope);
5112 Make_Block_Statement (Loc,
5113 Identifier => New_Reference_To (Blkent, Loc),
5114 Declarations => Declarations (N),
5115 Handled_Statement_Sequence => Build_Accept_Body (N));
5117 -- Prepend call to Accept_Call to main statement sequence If the
5118 -- accept has exception handlers, the statement sequence is wrapped
5119 -- in a block. Insert call and renaming declarations in the
5120 -- declarations of the block, so they are elaborated before the
5124 Make_Procedure_Call_Statement (Loc,
5125 Name => New_Reference_To (RTE (RE_Accept_Call), Loc),
5126 Parameter_Associations => New_List (
5127 Entry_Index_Expression (Loc, Entity (Ename), Eindx, Ttyp),
5128 New_Reference_To (Ann, Loc)));
5130 if Parent (Stats) = N then
5131 Prepend (Call, Statements (Stats));
5140 Push_Scope (Blkent);
5148 D := First (Declarations (N));
5149 while Present (D) loop
5152 if Nkind (D) = N_Object_Renaming_Declaration then
5154 -- The renaming declarations for the formals were created
5155 -- during analysis of the accept statement, and attached to
5156 -- the list of declarations. Place them now in the context
5157 -- of the accept block or subprogram.
5160 Typ := Entity (Subtype_Mark (D));
5161 Insert_After (Call, D);
5164 -- If the formal is class_wide, it does not have an actual
5165 -- subtype. The analysis of the renaming declaration creates
5166 -- one, but we need to retain the class-wide nature of the
5169 if Is_Class_Wide_Type (Typ) then
5170 Set_Etype (Defining_Identifier (D), Typ);
5181 -- Replace the accept statement by the new block
5186 -- Last step is to unstack the Accept_Address value
5188 Remove_Last_Elmt (Acstack);
5190 end Expand_N_Accept_Statement;
5192 ----------------------------------
5193 -- Expand_N_Asynchronous_Select --
5194 ----------------------------------
5196 -- This procedure assumes that the trigger statement is an entry call or
5197 -- a dispatching procedure call. A delay alternative should already have
5198 -- been expanded into an entry call to the appropriate delay object Wait
5201 -- If the trigger is a task entry call, the select is implemented with
5202 -- a Task_Entry_Call:
5207 -- P : parms := (parm, parm, parm);
5209 -- -- Clean is added by Exp_Ch7.Expand_Cleanup_Actions
5211 -- procedure _clean is
5214 -- Cancel_Task_Entry_Call (C);
5221 -- (<acceptor-task>, -- Acceptor
5222 -- <entry-index>, -- E
5223 -- P'Address, -- Uninterpreted_Data
5224 -- Asynchronous_Call, -- Mode
5225 -- B); -- Rendezvous_Successful
5232 -- _clean; -- Added by Exp_Ch7.Expand_Cleanup_Actions
5235 -- when Abort_Signal => Abort_Undefer;
5242 -- <triggered-statements>
5246 -- Note that Build_Simple_Entry_Call is used to expand the entry of the
5247 -- asynchronous entry call (by Expand_N_Entry_Call_Statement procedure)
5251 -- P : parms := (parm, parm, parm);
5253 -- Call_Simple (acceptor-task, entry-index, P'Address);
5259 -- so the task at hand is to convert the latter expansion into the former
5261 -- If the trigger is a protected entry call, the select is implemented
5262 -- with Protected_Entry_Call:
5265 -- P : E1_Params := (param, param, param);
5266 -- Bnn : Communications_Block;
5271 -- -- Clean is added by Exp_Ch7.Expand_Cleanup_Actions
5273 -- procedure _clean is
5276 -- if Enqueued (Bnn) then
5277 -- Cancel_Protected_Entry_Call (Bnn);
5284 -- Protected_Entry_Call
5285 -- (po._object'Access, -- Object
5286 -- <entry index>, -- E
5287 -- P'Address, -- Uninterpreted_Data
5288 -- Asynchronous_Call, -- Mode
5291 -- if Enqueued (Bnn) then
5295 -- _clean; -- Added by Exp_Ch7.Expand_Cleanup_Actions
5298 -- when Abort_Signal => Abort_Undefer;
5301 -- if not Cancelled (Bnn) then
5302 -- <triggered-statements>
5306 -- Build_Simple_Entry_Call is used to expand the all to a simple protected
5310 -- P : E1_Params := (param, param, param);
5311 -- Bnn : Communications_Block;
5314 -- Protected_Entry_Call
5315 -- (po._object'Access, -- Object
5316 -- <entry index>, -- E
5317 -- P'Address, -- Uninterpreted_Data
5318 -- Simple_Call, -- Mode
5325 -- Ada 2005 (AI-345): If the trigger is a dispatching call, the select is
5329 -- B : Boolean := False;
5330 -- Bnn : Communication_Block;
5331 -- C : Ada.Tags.Prim_Op_Kind;
5332 -- D : System.Storage_Elements.Dummy_Communication_Block;
5333 -- K : Ada.Tags.Tagged_Kind :=
5334 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
5335 -- P : Parameters := (Param1 .. ParamN);
5340 -- if K = Ada.Tags.TK_Limited_Tagged then
5341 -- <dispatching-call>;
5342 -- <triggering-statements>;
5346 -- Ada.Tags.Get_Offset_Index
5347 -- (Ada.Tags.Tag (<object>), DT_Position (<dispatching-call>));
5349 -- _Disp_Get_Prim_Op_Kind (<object>, S, C);
5351 -- if C = POK_Protected_Entry then
5353 -- procedure _clean is
5355 -- if Enqueued (Bnn) then
5356 -- Cancel_Protected_Entry_Call (Bnn);
5362 -- _Disp_Asynchronous_Select
5363 -- (<object>, S, P'Address, D, B);
5364 -- Bnn := Communication_Block (D);
5366 -- Param1 := P.Param1;
5368 -- ParamN := P.ParamN;
5370 -- if Enqueued (Bnn) then
5371 -- <abortable-statements>
5374 -- _clean; -- Added by Exp_Ch7.Expand_Cleanup_Actions
5377 -- when Abort_Signal => Abort_Undefer;
5380 -- if not Cancelled (Bnn) then
5381 -- <triggering-statements>
5384 -- elsif C = POK_Task_Entry then
5386 -- procedure _clean is
5388 -- Cancel_Task_Entry_Call (U);
5394 -- _Disp_Asynchronous_Select
5395 -- (<object>, S, P'Address, D, B);
5396 -- Bnn := Communication_Bloc (D);
5398 -- Param1 := P.Param1;
5400 -- ParamN := P.ParamN;
5405 -- <abortable-statements>
5407 -- _clean; -- Added by Exp_Ch7.Expand_Cleanup_Actions
5410 -- when Abort_Signal => Abort_Undefer;
5414 -- <triggering-statements>
5419 -- <dispatching-call>;
5420 -- <triggering-statements>
5425 -- The job is to convert this to the asynchronous form
5427 -- If the trigger is a delay statement, it will have been expanded into a
5428 -- call to one of the GNARL delay procedures. This routine will convert
5429 -- this into a protected entry call on a delay object and then continue
5430 -- processing as for a protected entry call trigger. This requires
5431 -- declaring a Delay_Block object and adding a pointer to this object to
5432 -- the parameter list of the delay procedure to form the parameter list of
5433 -- the entry call. This object is used by the runtime to queue the delay
5436 -- For a description of the use of P and the assignments after the call,
5437 -- see Expand_N_Entry_Call_Statement.
5439 procedure Expand_N_Asynchronous_Select (N : Node_Id) is
5440 Loc : constant Source_Ptr := Sloc (N);
5441 Abrt : constant Node_Id := Abortable_Part (N);
5442 Astats : constant List_Id := Statements (Abrt);
5443 Trig : constant Node_Id := Triggering_Alternative (N);
5444 Tstats : constant List_Id := Statements (Trig);
5446 Abort_Block_Ent : Entity_Id;
5447 Abortable_Block : Node_Id;
5449 Blk_Ent : Entity_Id;
5450 Blk_Typ : Entity_Id;
5452 Call_Ent : Entity_Id;
5453 Cancel_Param : Entity_Id;
5454 Cleanup_Block : Node_Id;
5455 Cleanup_Block_Ent : Entity_Id;
5456 Cleanup_Stmts : List_Id;
5457 Conc_Typ_Stmts : List_Id;
5459 Dblock_Ent : Entity_Id;
5464 Enqueue_Call : Node_Id;
5468 Lim_Typ_Stmts : List_Id;
5474 ProtE_Stmts : List_Id;
5475 ProtP_Stmts : List_Id;
5478 Target_Undefer : RE_Id;
5479 TaskE_Stmts : List_Id;
5480 Undefer_Args : List_Id := No_List;
5482 B : Entity_Id; -- Call status flag
5483 Bnn : Entity_Id; -- Communication block
5484 C : Entity_Id; -- Call kind
5485 K : Entity_Id; -- Tagged kind
5486 P : Entity_Id; -- Parameter block
5487 S : Entity_Id; -- Primitive operation slot
5488 T : Entity_Id; -- Additional status flag
5491 Blk_Ent := Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
5492 Ecall := Triggering_Statement (Trig);
5494 -- The arguments in the call may require dynamic allocation, and the
5495 -- call statement may have been transformed into a block. The block
5496 -- may contain additional declarations for internal entities, and the
5497 -- original call is found by sequential search.
5499 if Nkind (Ecall) = N_Block_Statement then
5500 Ecall := First (Statements (Handled_Statement_Sequence (Ecall)));
5501 while not Nkind_In (Ecall, N_Procedure_Call_Statement,
5502 N_Entry_Call_Statement)
5508 -- This is either a dispatching call or a delay statement used as a
5509 -- trigger which was expanded into a procedure call.
5511 if Nkind (Ecall) = N_Procedure_Call_Statement then
5512 if Ada_Version >= Ada_05
5514 (No (Original_Node (Ecall))
5515 or else not Nkind_In (Original_Node (Ecall),
5516 N_Delay_Relative_Statement,
5517 N_Delay_Until_Statement))
5519 Extract_Dispatching_Call (Ecall, Call_Ent, Obj, Actuals, Formals);
5524 -- Call status flag processing, generate:
5525 -- B : Boolean := False;
5527 B := Build_B (Loc, Decls);
5529 -- Communication block processing, generate:
5530 -- Bnn : Communication_Block;
5532 Bnn := Make_Defining_Identifier (Loc, New_Internal_Name ('B'));
5535 Make_Object_Declaration (Loc,
5536 Defining_Identifier =>
5538 Object_Definition =>
5539 New_Reference_To (RTE (RE_Communication_Block), Loc)));
5541 -- Call kind processing, generate:
5542 -- C : Ada.Tags.Prim_Op_Kind;
5544 C := Build_C (Loc, Decls);
5546 -- Tagged kind processing, generate:
5547 -- K : Ada.Tags.Tagged_Kind :=
5548 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
5550 -- Dummy communication block, generate:
5551 -- D : Dummy_Communication_Block;
5554 Make_Object_Declaration (Loc,
5555 Defining_Identifier =>
5556 Make_Defining_Identifier (Loc, Name_uD),
5557 Object_Definition =>
5559 RTE (RE_Dummy_Communication_Block), Loc)));
5561 K := Build_K (Loc, Decls, Obj);
5563 -- Parameter block processing
5565 Blk_Typ := Build_Parameter_Block
5566 (Loc, Actuals, Formals, Decls);
5567 P := Parameter_Block_Pack
5568 (Loc, Blk_Typ, Actuals, Formals, Decls, Stmts);
5570 -- Dispatch table slot processing, generate:
5573 S := Build_S (Loc, Decls);
5575 -- Additional status flag processing, generate:
5577 T := Make_Defining_Identifier (Loc, New_Internal_Name ('T'));
5580 Make_Object_Declaration (Loc,
5581 Defining_Identifier =>
5583 Object_Definition =>
5584 New_Reference_To (Standard_Boolean, Loc)));
5586 ------------------------------
5587 -- Protected entry handling --
5588 ------------------------------
5591 -- Param1 := P.Param1;
5593 -- ParamN := P.ParamN;
5595 Cleanup_Stmts := Parameter_Block_Unpack (Loc, P, Actuals, Formals);
5598 -- Bnn := Communication_Block (D);
5600 Prepend_To (Cleanup_Stmts,
5601 Make_Assignment_Statement (Loc,
5603 New_Reference_To (Bnn, Loc),
5605 Make_Unchecked_Type_Conversion (Loc,
5607 New_Reference_To (RTE (RE_Communication_Block), Loc),
5609 Make_Identifier (Loc, Name_uD))));
5612 -- _Disp_Asynchronous_Select (<object>, S, P'Address, D, B);
5614 Prepend_To (Cleanup_Stmts,
5615 Make_Procedure_Call_Statement (Loc,
5618 Find_Prim_Op (Etype (Etype (Obj)),
5619 Name_uDisp_Asynchronous_Select),
5621 Parameter_Associations =>
5623 New_Copy_Tree (Obj), -- <object>
5624 New_Reference_To (S, Loc), -- S
5625 Make_Attribute_Reference (Loc, -- P'Address
5627 New_Reference_To (P, Loc),
5630 Make_Identifier (Loc, Name_uD), -- D
5631 New_Reference_To (B, Loc)))); -- B
5634 -- if Enqueued (Bnn) then
5635 -- <abortable-statements>
5638 Append_To (Cleanup_Stmts,
5639 Make_If_Statement (Loc,
5641 Make_Function_Call (Loc,
5643 New_Reference_To (RTE (RE_Enqueued), Loc),
5644 Parameter_Associations =>
5646 New_Reference_To (Bnn, Loc))),
5649 New_Copy_List_Tree (Astats)));
5651 -- Wrap the statements in a block. Exp_Ch7.Expand_Cleanup_Actions
5652 -- will then generate a _clean for the communication block Bnn.
5656 -- procedure _clean is
5658 -- if Enqueued (Bnn) then
5659 -- Cancel_Protected_Entry_Call (Bnn);
5668 Cleanup_Block_Ent :=
5669 Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
5672 Build_Cleanup_Block (Loc, Cleanup_Block_Ent, Cleanup_Stmts, Bnn);
5674 -- Wrap the cleanup block in an exception handling block
5680 -- when Abort_Signal => Abort_Undefer;
5684 Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
5688 Make_Implicit_Label_Declaration (Loc,
5689 Defining_Identifier =>
5693 (Loc, Abort_Block_Ent, Cleanup_Block_Ent, Cleanup_Block));
5696 -- if not Cancelled (Bnn) then
5697 -- <triggering-statements>
5700 Append_To (ProtE_Stmts,
5701 Make_If_Statement (Loc,
5705 Make_Function_Call (Loc,
5707 New_Reference_To (RTE (RE_Cancelled), Loc),
5708 Parameter_Associations =>
5710 New_Reference_To (Bnn, Loc)))),
5713 New_Copy_List_Tree (Tstats)));
5715 -------------------------
5716 -- Task entry handling --
5717 -------------------------
5720 -- Param1 := P.Param1;
5722 -- ParamN := P.ParamN;
5724 TaskE_Stmts := Parameter_Block_Unpack (Loc, P, Actuals, Formals);
5727 -- Bnn := Communication_Block (D);
5729 Append_To (TaskE_Stmts,
5730 Make_Assignment_Statement (Loc,
5732 New_Reference_To (Bnn, Loc),
5734 Make_Unchecked_Type_Conversion (Loc,
5736 New_Reference_To (RTE (RE_Communication_Block), Loc),
5738 Make_Identifier (Loc, Name_uD))));
5741 -- _Disp_Asynchronous_Select (<object>, S, P'Address, D, B);
5743 Prepend_To (TaskE_Stmts,
5744 Make_Procedure_Call_Statement (Loc,
5747 Find_Prim_Op (Etype (Etype (Obj)),
5748 Name_uDisp_Asynchronous_Select),
5750 Parameter_Associations =>
5752 New_Copy_Tree (Obj), -- <object>
5753 New_Reference_To (S, Loc), -- S
5754 Make_Attribute_Reference (Loc, -- P'Address
5756 New_Reference_To (P, Loc),
5759 Make_Identifier (Loc, Name_uD), -- D
5760 New_Reference_To (B, Loc)))); -- B
5765 Prepend_To (TaskE_Stmts,
5766 Make_Procedure_Call_Statement (Loc,
5768 New_Reference_To (RTE (RE_Abort_Defer), Loc),
5769 Parameter_Associations =>
5774 -- <abortable-statements>
5776 Cleanup_Stmts := New_Copy_List_Tree (Astats);
5778 Prepend_To (Cleanup_Stmts,
5779 Make_Procedure_Call_Statement (Loc,
5781 New_Reference_To (RTE (RE_Abort_Undefer), Loc),
5782 Parameter_Associations =>
5785 -- Wrap the statements in a block. Exp_Ch7.Expand_Cleanup_Actions
5786 -- will generate a _clean for the additional status flag.
5790 -- procedure _clean is
5792 -- Cancel_Task_Entry_Call (U);
5800 Cleanup_Block_Ent :=
5801 Make_Defining_Identifier (Loc, New_Internal_Name ('C'));
5804 Build_Cleanup_Block (Loc, Cleanup_Block_Ent, Cleanup_Stmts, T);
5806 -- Wrap the cleanup block in an exception handling block
5812 -- when Abort_Signal => Abort_Undefer;
5816 Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
5818 Append_To (TaskE_Stmts,
5819 Make_Implicit_Label_Declaration (Loc,
5820 Defining_Identifier =>
5823 Append_To (TaskE_Stmts,
5825 (Loc, Abort_Block_Ent, Cleanup_Block_Ent, Cleanup_Block));
5829 -- <triggering-statements>
5832 Append_To (TaskE_Stmts,
5833 Make_If_Statement (Loc,
5837 New_Reference_To (T, Loc)),
5840 New_Copy_List_Tree (Tstats)));
5842 ----------------------------------
5843 -- Protected procedure handling --
5844 ----------------------------------
5847 -- <dispatching-call>;
5848 -- <triggering-statements>
5850 ProtP_Stmts := New_Copy_List_Tree (Tstats);
5851 Prepend_To (ProtP_Stmts, New_Copy_Tree (Ecall));
5854 -- S := Ada.Tags.Get_Offset_Index
5855 -- (Ada.Tags.Tag (<object>), DT_Position (Call_Ent));
5858 New_List (Build_S_Assignment (Loc, S, Obj, Call_Ent));
5861 -- _Disp_Get_Prim_Op_Kind (<object>, S, C);
5863 Append_To (Conc_Typ_Stmts,
5864 Make_Procedure_Call_Statement (Loc,
5867 Find_Prim_Op (Etype (Etype (Obj)),
5868 Name_uDisp_Get_Prim_Op_Kind),
5870 Parameter_Associations =>
5872 New_Copy_Tree (Obj),
5873 New_Reference_To (S, Loc),
5874 New_Reference_To (C, Loc))));
5877 -- if C = POK_Procedure_Entry then
5879 -- elsif C = POK_Task_Entry then
5885 Append_To (Conc_Typ_Stmts,
5886 Make_If_Statement (Loc,
5890 New_Reference_To (C, Loc),
5892 New_Reference_To (RTE (RE_POK_Protected_Entry), Loc)),
5899 Make_Elsif_Part (Loc,
5903 New_Reference_To (C, Loc),
5905 New_Reference_To (RTE (RE_POK_Task_Entry), Loc)),
5914 -- <dispatching-call>;
5915 -- <triggering-statements>
5917 Lim_Typ_Stmts := New_Copy_List_Tree (Tstats);
5918 Prepend_To (Lim_Typ_Stmts, New_Copy_Tree (Ecall));
5921 -- if K = Ada.Tags.TK_Limited_Tagged then
5928 Make_If_Statement (Loc,
5932 New_Reference_To (K, Loc),
5934 New_Reference_To (RTE (RE_TK_Limited_Tagged), Loc)),
5943 Make_Block_Statement (Loc,
5946 Handled_Statement_Sequence =>
5947 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
5952 -- Delay triggering statement processing
5955 -- Add a Delay_Block object to the parameter list of the delay
5956 -- procedure to form the parameter list of the Wait entry call.
5959 Make_Defining_Identifier (Loc, New_Internal_Name ('D'));
5961 Pdef := Entity (Name (Ecall));
5963 if Is_RTE (Pdef, RO_CA_Delay_For) then
5965 New_Reference_To (RTE (RE_Enqueue_Duration), Loc);
5967 elsif Is_RTE (Pdef, RO_CA_Delay_Until) then
5969 New_Reference_To (RTE (RE_Enqueue_Calendar), Loc);
5971 else pragma Assert (Is_RTE (Pdef, RO_RT_Delay_Until));
5972 Enqueue_Call := New_Reference_To (RTE (RE_Enqueue_RT), Loc);
5975 Append_To (Parameter_Associations (Ecall),
5976 Make_Attribute_Reference (Loc,
5977 Prefix => New_Reference_To (Dblock_Ent, Loc),
5978 Attribute_Name => Name_Unchecked_Access));
5980 -- Create the inner block to protect the abortable part
5983 Make_Implicit_Exception_Handler (Loc,
5984 Exception_Choices =>
5985 New_List (New_Reference_To (Stand.Abort_Signal, Loc)),
5986 Statements => New_List (
5987 Make_Procedure_Call_Statement (Loc,
5988 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc)))));
5991 Make_Procedure_Call_Statement (Loc,
5992 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc)));
5995 Make_Block_Statement (Loc,
5996 Identifier => New_Reference_To (Blk_Ent, Loc),
5997 Handled_Statement_Sequence =>
5998 Make_Handled_Sequence_Of_Statements (Loc,
5999 Statements => Astats),
6000 Has_Created_Identifier => True,
6001 Is_Asynchronous_Call_Block => True);
6003 -- Append call to if Enqueue (When, DB'Unchecked_Access) then
6006 Make_Implicit_If_Statement (N,
6007 Condition => Make_Function_Call (Loc,
6008 Name => Enqueue_Call,
6009 Parameter_Associations => Parameter_Associations (Ecall)),
6011 New_List (Make_Block_Statement (Loc,
6012 Handled_Statement_Sequence =>
6013 Make_Handled_Sequence_Of_Statements (Loc,
6014 Statements => New_List (
6015 Make_Implicit_Label_Declaration (Loc,
6016 Defining_Identifier => Blk_Ent,
6017 Label_Construct => Abortable_Block),
6019 Exception_Handlers => Hdle)))));
6021 Stmts := New_List (Ecall);
6023 -- Construct statement sequence for new block
6026 Make_Implicit_If_Statement (N,
6027 Condition => Make_Function_Call (Loc,
6028 Name => New_Reference_To (
6029 RTE (RE_Timed_Out), Loc),
6030 Parameter_Associations => New_List (
6031 Make_Attribute_Reference (Loc,
6032 Prefix => New_Reference_To (Dblock_Ent, Loc),
6033 Attribute_Name => Name_Unchecked_Access))),
6034 Then_Statements => Tstats));
6036 -- The result is the new block
6038 Set_Entry_Cancel_Parameter (Blk_Ent, Dblock_Ent);
6041 Make_Block_Statement (Loc,
6042 Declarations => New_List (
6043 Make_Object_Declaration (Loc,
6044 Defining_Identifier => Dblock_Ent,
6045 Aliased_Present => True,
6046 Object_Definition => New_Reference_To (
6047 RTE (RE_Delay_Block), Loc))),
6049 Handled_Statement_Sequence =>
6050 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
6060 Extract_Entry (Ecall, Concval, Ename, Index);
6061 Build_Simple_Entry_Call (Ecall, Concval, Ename, Index);
6063 Stmts := Statements (Handled_Statement_Sequence (Ecall));
6064 Decls := Declarations (Ecall);
6066 if Is_Protected_Type (Etype (Concval)) then
6068 -- Get the declarations of the block expanded from the entry call
6070 Decl := First (Decls);
6071 while Present (Decl)
6073 (Nkind (Decl) /= N_Object_Declaration
6074 or else not Is_RTE (Etype (Object_Definition (Decl)),
6075 RE_Communication_Block))
6080 pragma Assert (Present (Decl));
6081 Cancel_Param := Defining_Identifier (Decl);
6083 -- Change the mode of the Protected_Entry_Call call
6085 -- Protected_Entry_Call (
6086 -- Object => po._object'Access,
6087 -- E => <entry index>;
6088 -- Uninterpreted_Data => P'Address;
6089 -- Mode => Asynchronous_Call;
6092 Stmt := First (Stmts);
6094 -- Skip assignments to temporaries created for in-out parameters
6096 -- This makes unwarranted assumptions about the shape of the expanded
6097 -- tree for the call, and should be cleaned up ???
6099 while Nkind (Stmt) /= N_Procedure_Call_Statement loop
6105 Param := First (Parameter_Associations (Call));
6106 while Present (Param)
6107 and then not Is_RTE (Etype (Param), RE_Call_Modes)
6112 pragma Assert (Present (Param));
6113 Rewrite (Param, New_Reference_To (RTE (RE_Asynchronous_Call), Loc));
6116 -- Append an if statement to execute the abortable part
6119 -- if Enqueued (Bnn) then
6122 Make_Implicit_If_Statement (N,
6123 Condition => Make_Function_Call (Loc,
6124 Name => New_Reference_To (
6125 RTE (RE_Enqueued), Loc),
6126 Parameter_Associations => New_List (
6127 New_Reference_To (Cancel_Param, Loc))),
6128 Then_Statements => Astats));
6131 Make_Block_Statement (Loc,
6132 Identifier => New_Reference_To (Blk_Ent, Loc),
6133 Handled_Statement_Sequence =>
6134 Make_Handled_Sequence_Of_Statements (Loc,
6135 Statements => Stmts),
6136 Has_Created_Identifier => True,
6137 Is_Asynchronous_Call_Block => True);
6139 -- For the VM call Update_Exception instead of Abort_Undefer.
6140 -- See 4jexcept.ads for an explanation.
6142 if VM_Target = No_VM then
6143 Target_Undefer := RE_Abort_Undefer;
6145 Target_Undefer := RE_Update_Exception;
6147 New_List (Make_Function_Call (Loc,
6148 Name => New_Occurrence_Of
6149 (RTE (RE_Current_Target_Exception), Loc)));
6153 Make_Block_Statement (Loc,
6154 Handled_Statement_Sequence =>
6155 Make_Handled_Sequence_Of_Statements (Loc,
6156 Statements => New_List (
6157 Make_Implicit_Label_Declaration (Loc,
6158 Defining_Identifier => Blk_Ent,
6159 Label_Construct => Abortable_Block),
6164 Exception_Handlers => New_List (
6165 Make_Implicit_Exception_Handler (Loc,
6167 -- when Abort_Signal =>
6168 -- Abort_Undefer.all;
6170 Exception_Choices =>
6171 New_List (New_Reference_To (Stand.Abort_Signal, Loc)),
6172 Statements => New_List (
6173 Make_Procedure_Call_Statement (Loc,
6174 Name => New_Reference_To (
6175 RTE (Target_Undefer), Loc),
6176 Parameter_Associations => Undefer_Args)))))),
6178 -- if not Cancelled (Bnn) then
6179 -- triggered statements
6182 Make_Implicit_If_Statement (N,
6183 Condition => Make_Op_Not (Loc,
6185 Make_Function_Call (Loc,
6186 Name => New_Occurrence_Of (RTE (RE_Cancelled), Loc),
6187 Parameter_Associations => New_List (
6188 New_Occurrence_Of (Cancel_Param, Loc)))),
6189 Then_Statements => Tstats));
6191 -- Asynchronous task entry call
6198 B := Make_Defining_Identifier (Loc, Name_uB);
6200 -- Insert declaration of B in declarations of existing block
6203 Make_Object_Declaration (Loc,
6204 Defining_Identifier => B,
6205 Object_Definition => New_Reference_To (Standard_Boolean, Loc)));
6207 Cancel_Param := Make_Defining_Identifier (Loc, Name_uC);
6209 -- Insert declaration of C in declarations of existing block
6212 Make_Object_Declaration (Loc,
6213 Defining_Identifier => Cancel_Param,
6214 Object_Definition => New_Reference_To (Standard_Boolean, Loc)));
6216 -- Remove and save the call to Call_Simple
6218 Stmt := First (Stmts);
6220 -- Skip assignments to temporaries created for in-out parameters.
6221 -- This makes unwarranted assumptions about the shape of the expanded
6222 -- tree for the call, and should be cleaned up ???
6224 while Nkind (Stmt) /= N_Procedure_Call_Statement loop
6230 -- Create the inner block to protect the abortable part
6233 Make_Implicit_Exception_Handler (Loc,
6234 Exception_Choices =>
6235 New_List (New_Reference_To (Stand.Abort_Signal, Loc)),
6238 Make_Procedure_Call_Statement (Loc,
6239 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc)))));
6242 Make_Procedure_Call_Statement (Loc,
6243 Name => New_Reference_To (RTE (RE_Abort_Undefer), Loc)));
6246 Make_Block_Statement (Loc,
6247 Identifier => New_Reference_To (Blk_Ent, Loc),
6248 Handled_Statement_Sequence =>
6249 Make_Handled_Sequence_Of_Statements (Loc,
6250 Statements => Astats),
6251 Has_Created_Identifier => True,
6252 Is_Asynchronous_Call_Block => True);
6255 Make_Block_Statement (Loc,
6256 Handled_Statement_Sequence =>
6257 Make_Handled_Sequence_Of_Statements (Loc,
6258 Statements => New_List (
6259 Make_Implicit_Label_Declaration (Loc,
6260 Defining_Identifier =>
6265 Exception_Handlers => Hdle)));
6267 -- Create new call statement
6269 Params := Parameter_Associations (Call);
6272 New_Reference_To (RTE (RE_Asynchronous_Call), Loc));
6274 New_Reference_To (B, Loc));
6277 Make_Procedure_Call_Statement (Loc,
6279 New_Reference_To (RTE (RE_Task_Entry_Call), Loc),
6280 Parameter_Associations => Params));
6282 -- Construct statement sequence for new block
6285 Make_Implicit_If_Statement (N,
6288 New_Reference_To (Cancel_Param, Loc)),
6289 Then_Statements => Tstats));
6291 -- Protected the call against abort
6294 Make_Procedure_Call_Statement (Loc,
6295 Name => New_Reference_To (RTE (RE_Abort_Defer), Loc),
6296 Parameter_Associations => Empty_List));
6299 Set_Entry_Cancel_Parameter (Blk_Ent, Cancel_Param);
6301 -- The result is the new block
6304 Make_Block_Statement (Loc,
6305 Declarations => Decls,
6306 Handled_Statement_Sequence =>
6307 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
6310 end Expand_N_Asynchronous_Select;
6312 -------------------------------------
6313 -- Expand_N_Conditional_Entry_Call --
6314 -------------------------------------
6316 -- The conditional task entry call is converted to a call to
6321 -- P : parms := (parm, parm, parm);
6325 -- (<acceptor-task>, -- Acceptor
6326 -- <entry-index>, -- E
6327 -- P'Address, -- Uninterpreted_Data
6328 -- Conditional_Call, -- Mode
6329 -- B); -- Rendezvous_Successful
6334 -- normal-statements
6340 -- For a description of the use of P and the assignments after the call,
6341 -- see Expand_N_Entry_Call_Statement. Note that the entry call of the
6342 -- conditional entry call has already been expanded (by the Expand_N_Entry
6343 -- _Call_Statement procedure) as follows:
6346 -- P : parms := (parm, parm, parm);
6348 -- ... info for in-out parameters
6349 -- Call_Simple (acceptor-task, entry-index, P'Address);
6355 -- so the task at hand is to convert the latter expansion into the former
6357 -- The conditional protected entry call is converted to a call to
6358 -- Protected_Entry_Call:
6361 -- P : parms := (parm, parm, parm);
6362 -- Bnn : Communications_Block;
6365 -- Protected_Entry_Call
6366 -- (po._object'Access, -- Object
6367 -- <entry index>, -- E
6368 -- P'Address, -- Uninterpreted_Data
6369 -- Conditional_Call, -- Mode
6374 -- if Cancelled (Bnn) then
6377 -- normal-statements
6381 -- Ada 2005 (AI-345): A dispatching conditional entry call is converted
6385 -- B : Boolean := False;
6386 -- C : Ada.Tags.Prim_Op_Kind;
6387 -- K : Ada.Tags.Tagged_Kind :=
6388 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
6389 -- P : Parameters := (Param1 .. ParamN);
6393 -- if K = Ada.Tags.TK_Limited_Tagged then
6394 -- <dispatching-call>;
6395 -- <triggering-statements>
6399 -- Ada.Tags.Get_Offset_Index
6400 -- (Ada.Tags.Tag (<object>), DT_Position (<dispatching-call>));
6402 -- _Disp_Conditional_Select (<object>, S, P'Address, C, B);
6404 -- if C = POK_Protected_Entry
6405 -- or else C = POK_Task_Entry
6407 -- Param1 := P.Param1;
6409 -- ParamN := P.ParamN;
6413 -- if C = POK_Procedure
6414 -- or else C = POK_Protected_Procedure
6415 -- or else C = POK_Task_Procedure
6417 -- <dispatching-call>;
6420 -- <triggering-statements>
6422 -- <else-statements>
6427 procedure Expand_N_Conditional_Entry_Call (N : Node_Id) is
6428 Loc : constant Source_Ptr := Sloc (N);
6429 Alt : constant Node_Id := Entry_Call_Alternative (N);
6430 Blk : Node_Id := Entry_Call_Statement (Alt);
6433 Blk_Typ : Entity_Id;
6435 Call_Ent : Entity_Id;
6436 Conc_Typ_Stmts : List_Id;
6440 Lim_Typ_Stmts : List_Id;
6447 Transient_Blk : Node_Id;
6450 B : Entity_Id; -- Call status flag
6451 C : Entity_Id; -- Call kind
6452 K : Entity_Id; -- Tagged kind
6453 P : Entity_Id; -- Parameter block
6454 S : Entity_Id; -- Primitive operation slot
6457 if Ada_Version >= Ada_05
6458 and then Nkind (Blk) = N_Procedure_Call_Statement
6460 Extract_Dispatching_Call (Blk, Call_Ent, Obj, Actuals, Formals);
6465 -- Call status flag processing, generate:
6466 -- B : Boolean := False;
6468 B := Build_B (Loc, Decls);
6470 -- Call kind processing, generate:
6471 -- C : Ada.Tags.Prim_Op_Kind;
6473 C := Build_C (Loc, Decls);
6475 -- Tagged kind processing, generate:
6476 -- K : Ada.Tags.Tagged_Kind :=
6477 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
6479 K := Build_K (Loc, Decls, Obj);
6481 -- Parameter block processing
6483 Blk_Typ := Build_Parameter_Block (Loc, Actuals, Formals, Decls);
6484 P := Parameter_Block_Pack
6485 (Loc, Blk_Typ, Actuals, Formals, Decls, Stmts);
6487 -- Dispatch table slot processing, generate:
6490 S := Build_S (Loc, Decls);
6493 -- S := Ada.Tags.Get_Offset_Index
6494 -- (Ada.Tags.Tag (<object>), DT_Position (Call_Ent));
6497 New_List (Build_S_Assignment (Loc, S, Obj, Call_Ent));
6500 -- _Disp_Conditional_Select (<object>, S, P'Address, C, B);
6502 Append_To (Conc_Typ_Stmts,
6503 Make_Procedure_Call_Statement (Loc,
6506 Find_Prim_Op (Etype (Etype (Obj)),
6507 Name_uDisp_Conditional_Select),
6509 Parameter_Associations =>
6511 New_Copy_Tree (Obj), -- <object>
6512 New_Reference_To (S, Loc), -- S
6513 Make_Attribute_Reference (Loc, -- P'Address
6515 New_Reference_To (P, Loc),
6518 New_Reference_To (C, Loc), -- C
6519 New_Reference_To (B, Loc)))); -- B
6522 -- if C = POK_Protected_Entry
6523 -- or else C = POK_Task_Entry
6525 -- Param1 := P.Param1;
6527 -- ParamN := P.ParamN;
6530 Unpack := Parameter_Block_Unpack (Loc, P, Actuals, Formals);
6532 -- Generate the if statement only when the packed parameters need
6533 -- explicit assignments to their corresponding actuals.
6535 if Present (Unpack) then
6536 Append_To (Conc_Typ_Stmts,
6537 Make_If_Statement (Loc,
6544 New_Reference_To (C, Loc),
6546 New_Reference_To (RTE (
6547 RE_POK_Protected_Entry), Loc)),
6551 New_Reference_To (C, Loc),
6553 New_Reference_To (RTE (RE_POK_Task_Entry), Loc))),
6561 -- if C = POK_Procedure
6562 -- or else C = POK_Protected_Procedure
6563 -- or else C = POK_Task_Procedure
6565 -- <dispatching-call>
6567 -- <normal-statements>
6569 -- <else-statements>
6572 N_Stats := New_Copy_List_Tree (Statements (Alt));
6574 Prepend_To (N_Stats,
6575 Make_If_Statement (Loc,
6581 New_Reference_To (C, Loc),
6583 New_Reference_To (RTE (RE_POK_Procedure), Loc)),
6590 New_Reference_To (C, Loc),
6592 New_Reference_To (RTE (
6593 RE_POK_Protected_Procedure), Loc)),
6598 New_Reference_To (C, Loc),
6600 New_Reference_To (RTE (
6601 RE_POK_Task_Procedure), Loc)))),
6606 Append_To (Conc_Typ_Stmts,
6607 Make_If_Statement (Loc,
6608 Condition => New_Reference_To (B, Loc),
6609 Then_Statements => N_Stats,
6610 Else_Statements => Else_Statements (N)));
6613 -- <dispatching-call>;
6614 -- <triggering-statements>
6616 Lim_Typ_Stmts := New_Copy_List_Tree (Statements (Alt));
6617 Prepend_To (Lim_Typ_Stmts, New_Copy_Tree (Blk));
6620 -- if K = Ada.Tags.TK_Limited_Tagged then
6627 Make_If_Statement (Loc,
6631 New_Reference_To (K, Loc),
6633 New_Reference_To (RTE (RE_TK_Limited_Tagged), Loc)),
6642 Make_Block_Statement (Loc,
6645 Handled_Statement_Sequence =>
6646 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
6648 -- As described above, The entry alternative is transformed into a
6649 -- block that contains the gnulli call, and possibly assignment
6650 -- statements for in-out parameters. The gnulli call may itself be
6651 -- rewritten into a transient block if some unconstrained parameters
6652 -- require it. We need to retrieve the call to complete its parameter
6657 First_Real_Statement (Handled_Statement_Sequence (Blk));
6659 if Present (Transient_Blk)
6660 and then Nkind (Transient_Blk) = N_Block_Statement
6662 Blk := Transient_Blk;
6665 Stmts := Statements (Handled_Statement_Sequence (Blk));
6666 Stmt := First (Stmts);
6667 while Nkind (Stmt) /= N_Procedure_Call_Statement loop
6672 Params := Parameter_Associations (Call);
6674 if Is_RTE (Entity (Name (Call)), RE_Protected_Entry_Call) then
6676 -- Substitute Conditional_Entry_Call for Simple_Call parameter
6678 Param := First (Params);
6679 while Present (Param)
6680 and then not Is_RTE (Etype (Param), RE_Call_Modes)
6685 pragma Assert (Present (Param));
6686 Rewrite (Param, New_Reference_To (RTE (RE_Conditional_Call), Loc));
6690 -- Find the Communication_Block parameter for the call to the
6691 -- Cancelled function.
6693 Decl := First (Declarations (Blk));
6694 while Present (Decl)
6695 and then not Is_RTE (Etype (Object_Definition (Decl)),
6696 RE_Communication_Block)
6701 -- Add an if statement to execute the else part if the call
6702 -- does not succeed (as indicated by the Cancelled predicate).
6705 Make_Implicit_If_Statement (N,
6706 Condition => Make_Function_Call (Loc,
6707 Name => New_Reference_To (RTE (RE_Cancelled), Loc),
6708 Parameter_Associations => New_List (
6709 New_Reference_To (Defining_Identifier (Decl), Loc))),
6710 Then_Statements => Else_Statements (N),
6711 Else_Statements => Statements (Alt)));
6714 B := Make_Defining_Identifier (Loc, Name_uB);
6716 -- Insert declaration of B in declarations of existing block
6718 if No (Declarations (Blk)) then
6719 Set_Declarations (Blk, New_List);
6722 Prepend_To (Declarations (Blk),
6723 Make_Object_Declaration (Loc,
6724 Defining_Identifier => B,
6725 Object_Definition =>
6726 New_Reference_To (Standard_Boolean, Loc)));
6728 -- Create new call statement
6731 New_Reference_To (RTE (RE_Conditional_Call), Loc));
6732 Append_To (Params, New_Reference_To (B, Loc));
6735 Make_Procedure_Call_Statement (Loc,
6736 Name => New_Reference_To (RTE (RE_Task_Entry_Call), Loc),
6737 Parameter_Associations => Params));
6739 -- Construct statement sequence for new block
6742 Make_Implicit_If_Statement (N,
6743 Condition => New_Reference_To (B, Loc),
6744 Then_Statements => Statements (Alt),
6745 Else_Statements => Else_Statements (N)));
6748 -- The result is the new block
6751 Make_Block_Statement (Loc,
6752 Declarations => Declarations (Blk),
6753 Handled_Statement_Sequence =>
6754 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
6758 end Expand_N_Conditional_Entry_Call;
6760 ---------------------------------------
6761 -- Expand_N_Delay_Relative_Statement --
6762 ---------------------------------------
6764 -- Delay statement is implemented as a procedure call to Delay_For
6765 -- defined in Ada.Calendar.Delays in order to reduce the overhead of
6766 -- simple delays imposed by the use of Protected Objects.
6768 procedure Expand_N_Delay_Relative_Statement (N : Node_Id) is
6769 Loc : constant Source_Ptr := Sloc (N);
6772 Make_Procedure_Call_Statement (Loc,
6773 Name => New_Reference_To (RTE (RO_CA_Delay_For), Loc),
6774 Parameter_Associations => New_List (Expression (N))));
6776 end Expand_N_Delay_Relative_Statement;
6778 ------------------------------------
6779 -- Expand_N_Delay_Until_Statement --
6780 ------------------------------------
6782 -- Delay Until statement is implemented as a procedure call to
6783 -- Delay_Until defined in Ada.Calendar.Delays and Ada.Real_Time.Delays.
6785 procedure Expand_N_Delay_Until_Statement (N : Node_Id) is
6786 Loc : constant Source_Ptr := Sloc (N);
6790 if Is_RTE (Base_Type (Etype (Expression (N))), RO_CA_Time) then
6791 Typ := RTE (RO_CA_Delay_Until);
6793 Typ := RTE (RO_RT_Delay_Until);
6797 Make_Procedure_Call_Statement (Loc,
6798 Name => New_Reference_To (Typ, Loc),
6799 Parameter_Associations => New_List (Expression (N))));
6802 end Expand_N_Delay_Until_Statement;
6804 -------------------------
6805 -- Expand_N_Entry_Body --
6806 -------------------------
6808 procedure Expand_N_Entry_Body (N : Node_Id) is
6810 -- Associate discriminals with the next protected operation body to be
6813 if Present (Next_Protected_Operation (N)) then
6814 Set_Discriminals (Parent (Current_Scope));
6816 end Expand_N_Entry_Body;
6818 -----------------------------------
6819 -- Expand_N_Entry_Call_Statement --
6820 -----------------------------------
6822 -- An entry call is expanded into GNARLI calls to implement a simple entry
6823 -- call (see Build_Simple_Entry_Call).
6825 procedure Expand_N_Entry_Call_Statement (N : Node_Id) is
6831 if No_Run_Time_Mode then
6832 Error_Msg_CRT ("entry call", N);
6836 -- If this entry call is part of an asynchronous select, don't expand it
6837 -- here; it will be expanded with the select statement. Don't expand
6838 -- timed entry calls either, as they are translated into asynchronous
6841 -- ??? This whole approach is questionable; it may be better to go back
6842 -- to allowing the expansion to take place and then attempting to fix it
6843 -- up in Expand_N_Asynchronous_Select. The tricky part is figuring out
6844 -- whether the expanded call is on a task or protected entry.
6846 if (Nkind (Parent (N)) /= N_Triggering_Alternative
6847 or else N /= Triggering_Statement (Parent (N)))
6848 and then (Nkind (Parent (N)) /= N_Entry_Call_Alternative
6849 or else N /= Entry_Call_Statement (Parent (N))
6850 or else Nkind (Parent (Parent (N))) /= N_Timed_Entry_Call)
6852 Extract_Entry (N, Concval, Ename, Index);
6853 Build_Simple_Entry_Call (N, Concval, Ename, Index);
6855 end Expand_N_Entry_Call_Statement;
6857 --------------------------------
6858 -- Expand_N_Entry_Declaration --
6859 --------------------------------
6861 -- If there are parameters, then first, each of the formals is marked by
6862 -- setting Is_Entry_Formal. Next a record type is built which is used to
6863 -- hold the parameter values. The name of this record type is entryP where
6864 -- entry is the name of the entry, with an additional corresponding access
6865 -- type called entryPA. The record type has matching components for each
6866 -- formal (the component names are the same as the formal names). For
6867 -- elementary types, the component type matches the formal type. For
6868 -- composite types, an access type is declared (with the name formalA)
6869 -- which designates the formal type, and the type of the component is this
6870 -- access type. Finally the Entry_Component of each formal is set to
6871 -- reference the corresponding record component.
6873 procedure Expand_N_Entry_Declaration (N : Node_Id) is
6874 Loc : constant Source_Ptr := Sloc (N);
6875 Entry_Ent : constant Entity_Id := Defining_Identifier (N);
6876 Components : List_Id;
6879 Last_Decl : Node_Id;
6880 Component : Entity_Id;
6883 Rec_Ent : Entity_Id;
6884 Acc_Ent : Entity_Id;
6887 Formal := First_Formal (Entry_Ent);
6890 -- Most processing is done only if parameters are present
6892 if Present (Formal) then
6893 Components := New_List;
6895 -- Loop through formals
6897 while Present (Formal) loop
6898 Set_Is_Entry_Formal (Formal);
6900 Make_Defining_Identifier (Sloc (Formal), Chars (Formal));
6901 Set_Entry_Component (Formal, Component);
6902 Set_Entry_Formal (Component, Formal);
6903 Ftype := Etype (Formal);
6905 -- Declare new access type and then append
6908 Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
6911 Make_Full_Type_Declaration (Loc,
6912 Defining_Identifier => Ctype,
6914 Make_Access_To_Object_Definition (Loc,
6915 All_Present => True,
6916 Constant_Present => Ekind (Formal) = E_In_Parameter,
6917 Subtype_Indication => New_Reference_To (Ftype, Loc)));
6919 Insert_After (Last_Decl, Decl);
6922 Append_To (Components,
6923 Make_Component_Declaration (Loc,
6924 Defining_Identifier => Component,
6925 Component_Definition =>
6926 Make_Component_Definition (Loc,
6927 Aliased_Present => False,
6928 Subtype_Indication => New_Reference_To (Ctype, Loc))));
6930 Next_Formal_With_Extras (Formal);
6933 -- Create the Entry_Parameter_Record declaration
6936 Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
6939 Make_Full_Type_Declaration (Loc,
6940 Defining_Identifier => Rec_Ent,
6942 Make_Record_Definition (Loc,
6944 Make_Component_List (Loc,
6945 Component_Items => Components)));
6947 Insert_After (Last_Decl, Decl);
6950 -- Construct and link in the corresponding access type
6953 Make_Defining_Identifier (Loc, New_Internal_Name ('A'));
6955 Set_Entry_Parameters_Type (Entry_Ent, Acc_Ent);
6958 Make_Full_Type_Declaration (Loc,
6959 Defining_Identifier => Acc_Ent,
6961 Make_Access_To_Object_Definition (Loc,
6962 All_Present => True,
6963 Subtype_Indication => New_Reference_To (Rec_Ent, Loc)));
6965 Insert_After (Last_Decl, Decl);
6968 end Expand_N_Entry_Declaration;
6970 -----------------------------
6971 -- Expand_N_Protected_Body --
6972 -----------------------------
6974 -- Protected bodies are expanded to the completion of the subprograms
6975 -- created for the corresponding protected type. These are a protected and
6976 -- unprotected version of each protected subprogram in the object, a
6977 -- function to calculate each entry barrier, and a procedure to execute the
6978 -- sequence of statements of each protected entry body. For example, for
6979 -- protected type ptype:
6982 -- (O : System.Address;
6983 -- E : Protected_Entry_Index)
6986 -- <discriminant renamings>
6987 -- <private object renamings>
6989 -- return <barrier expression>;
6992 -- procedure pprocN (_object : in out poV;...) is
6993 -- <discriminant renamings>
6994 -- <private object renamings>
6996 -- <sequence of statements>
6999 -- procedure pprocP (_object : in out poV;...) is
7000 -- procedure _clean is
7003 -- ptypeS (_object, Pn);
7004 -- Unlock (_object._object'Access);
7005 -- Abort_Undefer.all;
7010 -- Lock (_object._object'Access);
7011 -- pprocN (_object;...);
7016 -- function pfuncN (_object : poV;...) return Return_Type is
7017 -- <discriminant renamings>
7018 -- <private object renamings>
7020 -- <sequence of statements>
7023 -- function pfuncP (_object : poV) return Return_Type is
7024 -- procedure _clean is
7026 -- Unlock (_object._object'Access);
7027 -- Abort_Undefer.all;
7032 -- Lock (_object._object'Access);
7033 -- return pfuncN (_object);
7040 -- (O : System.Address;
7041 -- P : System.Address;
7042 -- E : Protected_Entry_Index)
7044 -- <discriminant renamings>
7045 -- <private object renamings>
7046 -- type poVP is access poV;
7047 -- _Object : ptVP := ptVP!(O);
7051 -- <statement sequence>
7052 -- Complete_Entry_Body (_Object._Object);
7054 -- when all others =>
7055 -- Exceptional_Complete_Entry_Body (
7056 -- _Object._Object, Get_GNAT_Exception);
7060 -- The type poV is the record created for the protected type to hold
7061 -- the state of the protected object.
7063 procedure Expand_N_Protected_Body (N : Node_Id) is
7064 Loc : constant Source_Ptr := Sloc (N);
7065 Pid : constant Entity_Id := Corresponding_Spec (N);
7067 Current_Node : Node_Id;
7068 Disp_Op_Body : Node_Id;
7069 New_Op_Body : Node_Id;
7070 Num_Entries : Natural := 0;
7075 Chain : Entity_Id := Empty;
7076 -- Finalization chain that may be attached to new body
7078 function Build_Dispatching_Subprogram_Body
7081 Prot_Bod : Node_Id) return Node_Id;
7082 -- Build a dispatching version of the protected subprogram body. The
7083 -- newly generated subprogram contains a call to the original protected
7084 -- body. The following code is generated:
7086 -- function <protected-function-name> (Param1 .. ParamN) return
7089 -- return <protected-function-name>P (Param1 .. ParamN);
7090 -- end <protected-function-name>;
7094 -- procedure <protected-procedure-name> (Param1 .. ParamN) is
7096 -- <protected-procedure-name>P (Param1 .. ParamN);
7097 -- end <protected-procedure-name>
7099 ---------------------------------------
7100 -- Build_Dispatching_Subprogram_Body --
7101 ---------------------------------------
7103 function Build_Dispatching_Subprogram_Body
7106 Prot_Bod : Node_Id) return Node_Id
7108 Loc : constant Source_Ptr := Sloc (N);
7115 -- Generate a specification without a letter suffix in order to
7116 -- override an interface function or procedure.
7119 Build_Protected_Sub_Specification (N, Pid, Dispatching_Mode);
7121 -- The formal parameters become the actuals of the protected
7122 -- function or procedure call.
7124 Actuals := New_List;
7125 Formal := First (Parameter_Specifications (Spec));
7126 while Present (Formal) loop
7128 Make_Identifier (Loc, Chars (Defining_Identifier (Formal))));
7133 if Nkind (Spec) = N_Procedure_Specification then
7136 Make_Procedure_Call_Statement (Loc,
7138 New_Reference_To (Corresponding_Spec (Prot_Bod), Loc),
7139 Parameter_Associations => Actuals));
7141 pragma Assert (Nkind (Spec) = N_Function_Specification);
7145 Make_Simple_Return_Statement (Loc,
7147 Make_Function_Call (Loc,
7149 New_Reference_To (Corresponding_Spec (Prot_Bod), Loc),
7150 Parameter_Associations => Actuals)));
7154 Make_Subprogram_Body (Loc,
7155 Declarations => Empty_List,
7156 Specification => Spec,
7157 Handled_Statement_Sequence =>
7158 Make_Handled_Sequence_Of_Statements (Loc, Stmts));
7159 end Build_Dispatching_Subprogram_Body;
7161 -- Start of processing for Expand_N_Protected_Body
7164 if No_Run_Time_Mode then
7165 Error_Msg_CRT ("protected body", N);
7169 -- This is the proper body corresponding to a stub. The declarations
7170 -- must be inserted at the point of the stub, which in turn is in the
7171 -- declarative part of the parent unit.
7173 if Nkind (Parent (N)) = N_Subunit then
7174 Current_Node := Corresponding_Stub (Parent (N));
7179 Op_Body := First (Declarations (N));
7181 -- The protected body is replaced with the bodies of its
7182 -- protected operations, and the declarations for internal objects
7183 -- that may have been created for entry family bounds.
7185 Rewrite (N, Make_Null_Statement (Sloc (N)));
7188 while Present (Op_Body) loop
7189 case Nkind (Op_Body) is
7190 when N_Subprogram_Declaration =>
7193 when N_Subprogram_Body =>
7195 -- Exclude functions created to analyze defaults
7197 if not Is_Eliminated (Defining_Entity (Op_Body))
7198 and then not Is_Eliminated (Corresponding_Spec (Op_Body))
7201 Build_Unprotected_Subprogram_Body (Op_Body, Pid);
7203 -- Propagate the finalization chain to the new body.
7204 -- In the unlikely event that the subprogram contains a
7205 -- declaration or allocator for an object that requires
7206 -- finalization, the corresponding chain is created when
7207 -- analyzing the body, and attached to its entity. This
7208 -- entity is not further elaborated, and so the chain
7209 -- properly belongs to the newly created subprogram body.
7212 Finalization_Chain_Entity (Defining_Entity (Op_Body));
7214 if Present (Chain) then
7215 Set_Finalization_Chain_Entity
7216 (Protected_Body_Subprogram
7217 (Corresponding_Spec (Op_Body)), Chain);
7219 (Handled_Statement_Sequence (New_Op_Body), False);
7222 Insert_After (Current_Node, New_Op_Body);
7223 Current_Node := New_Op_Body;
7224 Analyze (New_Op_Body);
7226 -- Build the corresponding protected operation. It may
7227 -- appear that this is needed only if this is a visible
7228 -- operation of the type, or if it is an interrupt handler,
7229 -- and this was the strategy used previously in GNAT.
7230 -- However, the operation may be exported through a
7231 -- 'Access to an external caller. This is the common idiom
7232 -- in code that uses the Ada 2005 Timing_Events package
7233 -- As a result we need to produce the protected body for
7234 -- both visible and private operations.
7236 if Present (Corresponding_Spec (Op_Body)) then
7238 Unit_Declaration_Node (Corresponding_Spec (Op_Body));
7240 if Nkind (Parent (Op_Decl)) =
7241 N_Protected_Definition
7244 Build_Protected_Subprogram_Body (
7245 Op_Body, Pid, Specification (New_Op_Body));
7247 Insert_After (Current_Node, New_Op_Body);
7248 Analyze (New_Op_Body);
7250 Current_Node := New_Op_Body;
7252 -- Generate an overriding primitive operation body for
7253 -- this subprogram if the protected type implements
7256 if Ada_Version >= Ada_05
7257 and then Present (Interfaces (
7258 Corresponding_Record_Type (Pid)))
7261 Build_Dispatching_Subprogram_Body (
7262 Op_Body, Pid, New_Op_Body);
7264 Insert_After (Current_Node, Disp_Op_Body);
7265 Analyze (Disp_Op_Body);
7267 Current_Node := Disp_Op_Body;
7273 when N_Entry_Body =>
7274 Op_Id := Defining_Identifier (Op_Body);
7275 Num_Entries := Num_Entries + 1;
7277 New_Op_Body := Build_Protected_Entry (Op_Body, Op_Id, Pid);
7279 Insert_After (Current_Node, New_Op_Body);
7280 Current_Node := New_Op_Body;
7281 Analyze (New_Op_Body);
7283 when N_Implicit_Label_Declaration =>
7286 when N_Itype_Reference =>
7287 Insert_After (Current_Node, New_Copy (Op_Body));
7289 when N_Freeze_Entity =>
7290 New_Op_Body := New_Copy (Op_Body);
7292 if Present (Entity (Op_Body))
7293 and then Freeze_Node (Entity (Op_Body)) = Op_Body
7295 Set_Freeze_Node (Entity (Op_Body), New_Op_Body);
7298 Insert_After (Current_Node, New_Op_Body);
7299 Current_Node := New_Op_Body;
7300 Analyze (New_Op_Body);
7303 New_Op_Body := New_Copy (Op_Body);
7304 Insert_After (Current_Node, New_Op_Body);
7305 Current_Node := New_Op_Body;
7306 Analyze (New_Op_Body);
7308 when N_Object_Declaration =>
7309 pragma Assert (not Comes_From_Source (Op_Body));
7310 New_Op_Body := New_Copy (Op_Body);
7311 Insert_After (Current_Node, New_Op_Body);
7312 Current_Node := New_Op_Body;
7313 Analyze (New_Op_Body);
7316 raise Program_Error;
7323 -- Finally, create the body of the function that maps an entry index
7324 -- into the corresponding body index, except when there is no entry,
7325 -- or in a ravenscar-like profile.
7327 if Corresponding_Runtime_Package (Pid) =
7328 System_Tasking_Protected_Objects_Entries
7330 New_Op_Body := Build_Find_Body_Index (Pid);
7331 Insert_After (Current_Node, New_Op_Body);
7332 Current_Node := New_Op_Body;
7333 Analyze (New_Op_Body);
7336 -- Ada 2005 (AI-345): Construct the primitive wrapper bodies after the
7337 -- protected body. At this point all wrapper specs have been created,
7338 -- frozen and included in the dispatch table for the protected type.
7340 if Ada_Version >= Ada_05 then
7341 Build_Wrapper_Bodies (Loc, Pid, Current_Node);
7343 end Expand_N_Protected_Body;
7345 -----------------------------------------
7346 -- Expand_N_Protected_Type_Declaration --
7347 -----------------------------------------
7349 -- First we create a corresponding record type declaration used to
7350 -- represent values of this protected type.
7351 -- The general form of this type declaration is
7353 -- type poV (discriminants) is record
7354 -- _Object : aliased <kind>Protection
7355 -- [(<entry count> [, <handler count>])];
7356 -- [entry_family : array (bounds) of Void;]
7357 -- <private data fields>
7360 -- The discriminants are present only if the corresponding protected type
7361 -- has discriminants, and they exactly mirror the protected type
7362 -- discriminants. The private data fields similarly mirror the private
7363 -- declarations of the protected type.
7365 -- The Object field is always present. It contains RTS specific data used
7366 -- to control the protected object. It is declared as Aliased so that it
7367 -- can be passed as a pointer to the RTS. This allows the protected record
7368 -- to be referenced within RTS data structures. An appropriate Protection
7369 -- type and discriminant are generated.
7371 -- The Service field is present for protected objects with entries. It
7372 -- contains sufficient information to allow the entry service procedure for
7373 -- this object to be called when the object is not known till runtime.
7375 -- One entry_family component is present for each entry family in the
7376 -- task definition (see Expand_N_Task_Type_Declaration).
7378 -- When a protected object is declared, an instance of the protected type
7379 -- value record is created. The elaboration of this declaration creates the
7380 -- correct bounds for the entry families, and also evaluates the priority
7381 -- expression if needed. The initialization routine for the protected type
7382 -- itself then calls Initialize_Protection with appropriate parameters to
7383 -- initialize the value of the Task_Id field. Install_Handlers may be also
7384 -- called if a pragma Attach_Handler applies.
7386 -- Note: this record is passed to the subprograms created by the expansion
7387 -- of protected subprograms and entries. It is an in parameter to protected
7388 -- functions and an in out parameter to procedures and entry bodies. The
7389 -- Entity_Id for this created record type is placed in the
7390 -- Corresponding_Record_Type field of the associated protected type entity.
7392 -- Next we create a procedure specifications for protected subprograms and
7393 -- entry bodies. For each protected subprograms two subprograms are
7394 -- created, an unprotected and a protected version. The unprotected version
7395 -- is called from within other operations of the same protected object.
7397 -- We also build the call to register the procedure if a pragma
7398 -- Interrupt_Handler applies.
7400 -- A single subprogram is created to service all entry bodies; it has an
7401 -- additional boolean out parameter indicating that the previous entry call
7402 -- made by the current task was serviced immediately, i.e. not by proxy.
7403 -- The O parameter contains a pointer to a record object of the type
7404 -- described above. An untyped interface is used here to allow this
7405 -- procedure to be called in places where the type of the object to be
7406 -- serviced is not known. This must be done, for example, when a call that
7407 -- may have been requeued is cancelled; the corresponding object must be
7408 -- serviced, but which object that is not known till runtime.
7411 -- (O : System.Address; P : out Boolean);
7412 -- procedure pprocN (_object : in out poV);
7413 -- procedure pproc (_object : in out poV);
7414 -- function pfuncN (_object : poV);
7415 -- function pfunc (_object : poV);
7418 -- Note that this must come after the record type declaration, since
7419 -- the specs refer to this type.
7421 procedure Expand_N_Protected_Type_Declaration (N : Node_Id) is
7422 Loc : constant Source_Ptr := Sloc (N);
7423 Prot_Typ : constant Entity_Id := Defining_Identifier (N);
7425 Pdef : constant Node_Id := Protected_Definition (N);
7426 -- This contains two lists; one for visible and one for private decls
7430 Discr_Map : constant Elist_Id := New_Elmt_List;
7434 Comp_Id : Entity_Id;
7436 Current_Node : Node_Id := N;
7437 Bdef : Entity_Id := Empty; -- avoid uninit warning
7438 Edef : Entity_Id := Empty; -- avoid uninit warning
7439 Entries_Aggr : Node_Id;
7440 Body_Id : Entity_Id;
7443 Object_Comp : Node_Id;
7445 procedure Register_Handler;
7446 -- For a protected operation that is an interrupt handler, add the
7447 -- freeze action that will register it as such.
7449 ----------------------
7450 -- Register_Handler --
7451 ----------------------
7453 procedure Register_Handler is
7455 -- All semantic checks already done in Sem_Prag
7457 Prot_Proc : constant Entity_Id :=
7459 (Specification (Current_Node));
7461 Proc_Address : constant Node_Id :=
7462 Make_Attribute_Reference (Loc,
7463 Prefix => New_Reference_To (Prot_Proc, Loc),
7464 Attribute_Name => Name_Address);
7466 RTS_Call : constant Entity_Id :=
7467 Make_Procedure_Call_Statement (Loc,
7470 RTE (RE_Register_Interrupt_Handler), Loc),
7471 Parameter_Associations =>
7472 New_List (Proc_Address));
7474 Append_Freeze_Action (Prot_Proc, RTS_Call);
7475 end Register_Handler;
7477 -- Start of processing for Expand_N_Protected_Type_Declaration
7480 if Present (Corresponding_Record_Type (Prot_Typ)) then
7483 Rec_Decl := Build_Corresponding_Record (N, Prot_Typ, Loc);
7486 Cdecls := Component_Items (Component_List (Type_Definition (Rec_Decl)));
7488 -- Ada 2005 (AI-345): Propagate the attribute that contains the list
7489 -- of implemented interfaces.
7491 Set_Interface_List (Type_Definition (Rec_Decl), Interface_List (N));
7493 Qualify_Entity_Names (N);
7495 -- If the type has discriminants, their occurrences in the declaration
7496 -- have been replaced by the corresponding discriminals. For components
7497 -- that are constrained by discriminants, their homologues in the
7498 -- corresponding record type must refer to the discriminants of that
7499 -- record, so we must apply a new renaming to subtypes_indications:
7501 -- protected discriminant => discriminal => record discriminant
7503 -- This replacement is not applied to default expressions, for which
7504 -- the discriminal is correct.
7506 if Has_Discriminants (Prot_Typ) then
7512 Disc := First_Discriminant (Prot_Typ);
7513 Decl := First (Discriminant_Specifications (Rec_Decl));
7514 while Present (Disc) loop
7515 Append_Elmt (Discriminal (Disc), Discr_Map);
7516 Append_Elmt (Defining_Identifier (Decl), Discr_Map);
7517 Next_Discriminant (Disc);
7523 -- Fill in the component declarations
7525 -- Add components for entry families. For each entry family, create an
7526 -- anonymous type declaration with the same size, and analyze the type.
7528 Collect_Entry_Families (Loc, Cdecls, Current_Node, Prot_Typ);
7530 -- Prepend the _Object field with the right type to the component list.
7531 -- We need to compute the number of entries, and in some cases the
7532 -- number of Attach_Handler pragmas.
7536 Num_Attach_Handler : Int := 0;
7537 Protection_Subtype : Node_Id;
7538 Entry_Count_Expr : constant Node_Id :=
7539 Build_Entry_Count_Expression
7540 (Prot_Typ, Cdecls, Loc);
7543 -- Could this be simplified using Corresponding_Runtime_Package???
7545 if Has_Attach_Handler (Prot_Typ) then
7546 Ritem := First_Rep_Item (Prot_Typ);
7547 while Present (Ritem) loop
7548 if Nkind (Ritem) = N_Pragma
7549 and then Pragma_Name (Ritem) = Name_Attach_Handler
7551 Num_Attach_Handler := Num_Attach_Handler + 1;
7554 Next_Rep_Item (Ritem);
7557 if Restricted_Profile then
7558 if Has_Entries (Prot_Typ) then
7559 Protection_Subtype :=
7560 New_Reference_To (RTE (RE_Protection_Entry), Loc);
7562 Protection_Subtype :=
7563 New_Reference_To (RTE (RE_Protection), Loc);
7566 Protection_Subtype :=
7567 Make_Subtype_Indication
7571 (RTE (RE_Static_Interrupt_Protection), Loc),
7573 Make_Index_Or_Discriminant_Constraint (
7575 Constraints => New_List (
7577 Make_Integer_Literal (Loc, Num_Attach_Handler))));
7580 elsif Has_Interrupt_Handler (Prot_Typ) then
7581 Protection_Subtype :=
7582 Make_Subtype_Indication (
7584 Subtype_Mark => New_Reference_To
7585 (RTE (RE_Dynamic_Interrupt_Protection), Loc),
7587 Make_Index_Or_Discriminant_Constraint (
7589 Constraints => New_List (Entry_Count_Expr)));
7591 -- Type has explicit entries or generated primitive entry wrappers
7593 elsif Has_Entries (Prot_Typ)
7594 or else (Ada_Version >= Ada_05
7595 and then Present (Interface_List (N)))
7597 case Corresponding_Runtime_Package (Prot_Typ) is
7598 when System_Tasking_Protected_Objects_Entries =>
7599 Protection_Subtype :=
7600 Make_Subtype_Indication (Loc,
7602 New_Reference_To (RTE (RE_Protection_Entries), Loc),
7604 Make_Index_Or_Discriminant_Constraint (
7606 Constraints => New_List (Entry_Count_Expr)));
7608 when System_Tasking_Protected_Objects_Single_Entry =>
7609 Protection_Subtype :=
7610 New_Reference_To (RTE (RE_Protection_Entry), Loc);
7613 raise Program_Error;
7617 Protection_Subtype := New_Reference_To (RTE (RE_Protection), Loc);
7621 Make_Component_Declaration (Loc,
7622 Defining_Identifier =>
7623 Make_Defining_Identifier (Loc, Name_uObject),
7624 Component_Definition =>
7625 Make_Component_Definition (Loc,
7626 Aliased_Present => True,
7627 Subtype_Indication => Protection_Subtype));
7630 pragma Assert (Present (Pdef));
7632 -- Add private field components
7634 if Present (Private_Declarations (Pdef)) then
7635 Priv := First (Private_Declarations (Pdef));
7637 while Present (Priv) loop
7639 if Nkind (Priv) = N_Component_Declaration then
7641 -- The component definition consists of a subtype indication,
7642 -- or (in Ada 2005) an access definition. Make a copy of the
7643 -- proper definition.
7646 Old_Comp : constant Node_Id := Component_Definition (Priv);
7647 Pent : constant Entity_Id := Defining_Identifier (Priv);
7651 if Present (Subtype_Indication (Old_Comp)) then
7653 Make_Component_Definition (Sloc (Pent),
7654 Aliased_Present => False,
7655 Subtype_Indication =>
7656 New_Copy_Tree (Subtype_Indication (Old_Comp),
7660 Make_Component_Definition (Sloc (Pent),
7661 Aliased_Present => False,
7662 Access_Definition =>
7663 New_Copy_Tree (Access_Definition (Old_Comp),
7668 Make_Component_Declaration (Loc,
7669 Defining_Identifier =>
7670 Make_Defining_Identifier (Sloc (Pent), Chars (Pent)),
7671 Component_Definition => New_Comp,
7672 Expression => Expression (Priv));
7674 Append_To (Cdecls, New_Priv);
7677 elsif Nkind (Priv) = N_Subprogram_Declaration then
7679 -- Make the unprotected version of the subprogram available
7680 -- for expansion of intra object calls. There is need for
7681 -- a protected version only if the subprogram is an interrupt
7682 -- handler, otherwise this operation can only be called from
7686 Make_Subprogram_Declaration (Loc,
7688 Build_Protected_Sub_Specification
7689 (Priv, Prot_Typ, Unprotected_Mode));
7691 Insert_After (Current_Node, Sub);
7694 Set_Protected_Body_Subprogram
7695 (Defining_Unit_Name (Specification (Priv)),
7696 Defining_Unit_Name (Specification (Sub)));
7698 Current_Node := Sub;
7701 Make_Subprogram_Declaration (Loc,
7703 Build_Protected_Sub_Specification
7704 (Priv, Prot_Typ, Protected_Mode));
7706 Insert_After (Current_Node, Sub);
7708 Current_Node := Sub;
7710 if Is_Interrupt_Handler
7711 (Defining_Unit_Name (Specification (Priv)))
7713 if not Restricted_Profile then
7723 -- Put the _Object component after the private component so that it
7724 -- be finalized early as required by 9.4 (20)
7726 Append_To (Cdecls, Object_Comp);
7728 Insert_After (Current_Node, Rec_Decl);
7729 Current_Node := Rec_Decl;
7731 -- Analyze the record declaration immediately after construction,
7732 -- because the initialization procedure is needed for single object
7733 -- declarations before the next entity is analyzed (the freeze call
7734 -- that generates this initialization procedure is found below).
7736 Analyze (Rec_Decl, Suppress => All_Checks);
7738 -- Ada 2005 (AI-345): Construct the primitive entry wrappers before
7739 -- the corresponding record is frozen. If any wrappers are generated,
7740 -- Current_Node is updated accordingly.
7742 if Ada_Version >= Ada_05 then
7743 Build_Wrapper_Specs (Loc, Prot_Typ, Current_Node);
7746 -- Collect pointers to entry bodies and their barriers, to be placed
7747 -- in the Entry_Bodies_Array for the type. For each entry/family we
7748 -- add an expression to the aggregate which is the initial value of
7749 -- this array. The array is declared after all protected subprograms.
7751 if Has_Entries (Prot_Typ) then
7752 Entries_Aggr := Make_Aggregate (Loc, Expressions => New_List);
7754 Entries_Aggr := Empty;
7757 -- Build two new procedure specifications for each protected subprogram;
7758 -- one to call from outside the object and one to call from inside.
7759 -- Build a barrier function and an entry body action procedure
7760 -- specification for each protected entry. Initialize the entry body
7761 -- array. If subprogram is flagged as eliminated, do not generate any
7762 -- internal operations.
7766 Comp := First (Visible_Declarations (Pdef));
7768 while Present (Comp) loop
7769 if Nkind (Comp) = N_Subprogram_Declaration
7770 and then not Is_Eliminated (Defining_Entity (Comp))
7773 Make_Subprogram_Declaration (Loc,
7775 Build_Protected_Sub_Specification
7776 (Comp, Prot_Typ, Unprotected_Mode));
7778 Insert_After (Current_Node, Sub);
7781 Set_Protected_Body_Subprogram
7782 (Defining_Unit_Name (Specification (Comp)),
7783 Defining_Unit_Name (Specification (Sub)));
7785 -- Make the protected version of the subprogram available for
7786 -- expansion of external calls.
7788 Current_Node := Sub;
7791 Make_Subprogram_Declaration (Loc,
7793 Build_Protected_Sub_Specification
7794 (Comp, Prot_Typ, Protected_Mode));
7796 Insert_After (Current_Node, Sub);
7799 Current_Node := Sub;
7801 -- Generate an overriding primitive operation specification for
7802 -- this subprogram if the protected type implements an interface.
7804 if Ada_Version >= Ada_05
7806 Present (Interfaces (Corresponding_Record_Type (Prot_Typ)))
7809 Make_Subprogram_Declaration (Loc,
7811 Build_Protected_Sub_Specification
7812 (Comp, Prot_Typ, Dispatching_Mode));
7814 Insert_After (Current_Node, Sub);
7817 Current_Node := Sub;
7820 -- If a pragma Interrupt_Handler applies, build and add a call to
7821 -- Register_Interrupt_Handler to the freezing actions of the
7822 -- protected version (Current_Node) of the subprogram:
7824 -- system.interrupts.register_interrupt_handler
7825 -- (prot_procP'address);
7827 if not Restricted_Profile
7828 and then Is_Interrupt_Handler
7829 (Defining_Unit_Name (Specification (Comp)))
7834 elsif Nkind (Comp) = N_Entry_Declaration then
7835 E_Count := E_Count + 1;
7836 Comp_Id := Defining_Identifier (Comp);
7839 Make_Defining_Identifier (Loc,
7840 Build_Selected_Name (Prot_Typ, Comp_Id, 'E'));
7842 Make_Subprogram_Declaration (Loc,
7844 Build_Protected_Entry_Specification (Loc, Edef, Comp_Id));
7846 Insert_After (Current_Node, Sub);
7849 Set_Protected_Body_Subprogram
7850 (Defining_Identifier (Comp),
7851 Defining_Unit_Name (Specification (Sub)));
7853 Current_Node := Sub;
7856 Make_Defining_Identifier (Loc,
7857 Chars => Build_Selected_Name (Prot_Typ, Comp_Id, 'B'));
7859 Make_Subprogram_Declaration (Loc,
7861 Build_Barrier_Function_Specification (Loc, Bdef));
7863 Insert_After (Current_Node, Sub);
7865 Set_Protected_Body_Subprogram (Bdef, Bdef);
7866 Set_Barrier_Function (Comp_Id, Bdef);
7867 Set_Scope (Bdef, Scope (Comp_Id));
7868 Current_Node := Sub;
7870 -- Collect pointers to the protected subprogram and the barrier
7871 -- of the current entry, for insertion into Entry_Bodies_Array.
7874 Make_Aggregate (Loc,
7875 Expressions => New_List (
7876 Make_Attribute_Reference (Loc,
7877 Prefix => New_Reference_To (Bdef, Loc),
7878 Attribute_Name => Name_Unrestricted_Access),
7879 Make_Attribute_Reference (Loc,
7880 Prefix => New_Reference_To (Edef, Loc),
7881 Attribute_Name => Name_Unrestricted_Access))),
7882 Expressions (Entries_Aggr));
7889 -- If there are some private entry declarations, expand it as if they
7890 -- were visible entries.
7892 if Present (Private_Declarations (Pdef)) then
7893 Comp := First (Private_Declarations (Pdef));
7894 while Present (Comp) loop
7895 if Nkind (Comp) = N_Entry_Declaration then
7896 E_Count := E_Count + 1;
7897 Comp_Id := Defining_Identifier (Comp);
7900 Make_Defining_Identifier (Loc,
7901 Build_Selected_Name (Prot_Typ, Comp_Id, 'E'));
7903 Make_Subprogram_Declaration (Loc,
7905 Build_Protected_Entry_Specification (Loc, Edef, Comp_Id));
7907 Insert_After (Current_Node, Sub);
7910 Set_Protected_Body_Subprogram
7911 (Defining_Identifier (Comp),
7912 Defining_Unit_Name (Specification (Sub)));
7914 Current_Node := Sub;
7917 Make_Defining_Identifier (Loc,
7918 Chars => Build_Selected_Name (Prot_Typ, Comp_Id, 'E'));
7921 Make_Subprogram_Declaration (Loc,
7923 Build_Barrier_Function_Specification (Loc, Bdef));
7925 Insert_After (Current_Node, Sub);
7927 Set_Protected_Body_Subprogram (Bdef, Bdef);
7928 Set_Barrier_Function (Comp_Id, Bdef);
7929 Set_Scope (Bdef, Scope (Comp_Id));
7930 Current_Node := Sub;
7932 -- Collect pointers to the protected subprogram and the barrier
7933 -- of the current entry, for insertion into Entry_Bodies_Array.
7935 Append_To (Expressions (Entries_Aggr),
7936 Make_Aggregate (Loc,
7937 Expressions => New_List (
7938 Make_Attribute_Reference (Loc,
7939 Prefix => New_Reference_To (Bdef, Loc),
7940 Attribute_Name => Name_Unrestricted_Access),
7941 Make_Attribute_Reference (Loc,
7942 Prefix => New_Reference_To (Edef, Loc),
7943 Attribute_Name => Name_Unrestricted_Access))));
7950 -- Emit declaration for Entry_Bodies_Array, now that the addresses of
7951 -- all protected subprograms have been collected.
7953 if Has_Entries (Prot_Typ) then
7955 Make_Defining_Identifier (Sloc (Prot_Typ),
7956 Chars => New_External_Name (Chars (Prot_Typ), 'A'));
7958 case Corresponding_Runtime_Package (Prot_Typ) is
7959 when System_Tasking_Protected_Objects_Entries =>
7960 Body_Arr := Make_Object_Declaration (Loc,
7961 Defining_Identifier => Body_Id,
7962 Aliased_Present => True,
7963 Object_Definition =>
7964 Make_Subtype_Indication (Loc,
7965 Subtype_Mark => New_Reference_To (
7966 RTE (RE_Protected_Entry_Body_Array), Loc),
7968 Make_Index_Or_Discriminant_Constraint (Loc,
7969 Constraints => New_List (
7971 Make_Integer_Literal (Loc, 1),
7972 Make_Integer_Literal (Loc, E_Count))))),
7973 Expression => Entries_Aggr);
7975 when System_Tasking_Protected_Objects_Single_Entry =>
7976 Body_Arr := Make_Object_Declaration (Loc,
7977 Defining_Identifier => Body_Id,
7978 Aliased_Present => True,
7979 Object_Definition => New_Reference_To
7980 (RTE (RE_Entry_Body), Loc),
7982 Make_Aggregate (Loc,
7983 Expressions => New_List (
7984 Make_Attribute_Reference (Loc,
7985 Prefix => New_Reference_To (Bdef, Loc),
7986 Attribute_Name => Name_Unrestricted_Access),
7987 Make_Attribute_Reference (Loc,
7988 Prefix => New_Reference_To (Edef, Loc),
7989 Attribute_Name => Name_Unrestricted_Access))));
7992 raise Program_Error;
7995 -- A pointer to this array will be placed in the corresponding record
7996 -- by its initialization procedure so this needs to be analyzed here.
7998 Insert_After (Current_Node, Body_Arr);
7999 Current_Node := Body_Arr;
8002 Set_Entry_Bodies_Array (Prot_Typ, Body_Id);
8004 -- Finally, build the function that maps an entry index into the
8005 -- corresponding body. A pointer to this function is placed in each
8006 -- object of the type. Except for a ravenscar-like profile (no abort,
8007 -- no entry queue, 1 entry)
8009 if Corresponding_Runtime_Package (Prot_Typ) =
8010 System_Tasking_Protected_Objects_Entries
8013 Make_Subprogram_Declaration (Loc,
8014 Specification => Build_Find_Body_Index_Spec (Prot_Typ));
8015 Insert_After (Current_Node, Sub);
8019 end Expand_N_Protected_Type_Declaration;
8021 --------------------------------
8022 -- Expand_N_Requeue_Statement --
8023 --------------------------------
8025 -- A non-dispatching requeue statement is expanded into one of four GNARLI
8026 -- operations, depending on the source and destination (task or protected
8027 -- object). A dispatching requeue statement is expanded into a call to the
8028 -- predefined primitive _Disp_Requeue. In addition, code is generated to
8029 -- jump around the remainder of processing for the original entry and, if
8030 -- the destination is (different) protected object, to attempt to service
8031 -- it. The following illustrates the various cases:
8034 -- (O : System.Address;
8035 -- P : System.Address;
8036 -- E : Protected_Entry_Index)
8038 -- <discriminant renamings>
8039 -- <private object renamings>
8040 -- type poVP is access poV;
8041 -- _object : ptVP := ptVP!(O);
8045 -- <start of statement sequence for entry>
8047 -- -- Requeue from one protected entry body to another protected
8050 -- Requeue_Protected_Entry (
8051 -- _object._object'Access,
8052 -- new._object'Access,
8057 -- <some more of the statement sequence for entry>
8059 -- -- Requeue from an entry body to a task entry
8061 -- Requeue_Protected_To_Task_Entry (
8067 -- <rest of statement sequence for entry>
8068 -- Complete_Entry_Body (_object._object);
8071 -- when all others =>
8072 -- Exceptional_Complete_Entry_Body (
8073 -- _object._object, Get_GNAT_Exception);
8077 -- Requeue of a task entry call to a task entry
8079 -- Accept_Call (E, Ann);
8080 -- <start of statement sequence for accept statement>
8081 -- Requeue_Task_Entry (New._task_id, E, Abort_Present);
8083 -- <rest of statement sequence for accept statement>
8085 -- Complete_Rendezvous;
8088 -- when all others =>
8089 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
8091 -- Requeue of a task entry call to a protected entry
8093 -- Accept_Call (E, Ann);
8094 -- <start of statement sequence for accept statement>
8095 -- Requeue_Task_To_Protected_Entry (
8096 -- new._object'Access,
8101 -- <rest of statement sequence for accept statement>
8103 -- Complete_Rendezvous;
8106 -- when all others =>
8107 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
8109 -- Ada 2005 (AI05-0030): Dispatching requeue from protected to interface
8113 -- (O : System.Address;
8114 -- P : System.Address;
8115 -- E : Protected_Entry_Index)
8117 -- <discriminant renamings>
8118 -- <private object renamings>
8119 -- type poVP is access poV;
8120 -- _object : ptVP := ptVP!(O);
8124 -- <start of statement sequence for entry>
8127 -- (<interface class-wide object>,
8130 -- Ada.Tags.Get_Offset_Index
8132 -- <interface dispatch table index of target entry>),
8136 -- <rest of statement sequence for entry>
8137 -- Complete_Entry_Body (_object._object);
8140 -- when all others =>
8141 -- Exceptional_Complete_Entry_Body (
8142 -- _object._object, Get_GNAT_Exception);
8146 -- Ada 2005 (AI05-0030): Dispatching requeue from task to interface
8149 -- Accept_Call (E, Ann);
8150 -- <start of statement sequence for accept statement>
8152 -- (<interface class-wide object>,
8155 -- Ada.Tags.Get_Offset_Index
8157 -- <interface dispatch table index of target entrt>),
8161 -- <rest of statement sequence for accept statement>
8163 -- Complete_Rendezvous;
8166 -- when all others =>
8167 -- Exceptional_Complete_Rendezvous (Get_GNAT_Exception);
8169 -- Further details on these expansions can be found in Expand_N_Protected_
8170 -- Body and Expand_N_Accept_Statement.
8172 procedure Expand_N_Requeue_Statement (N : Node_Id) is
8173 Loc : constant Source_Ptr := Sloc (N);
8174 Abortable : Node_Id;
8176 Conc_Typ : Entity_Id;
8181 New_Param : Node_Id;
8182 Old_Typ : Entity_Id;
8185 RTS_Call : Entity_Id;
8186 Self_Param : Node_Id;
8187 Skip_Stat : Node_Id;
8191 New_Occurrence_Of (Boolean_Literals (Abort_Present (N)), Loc);
8193 -- Extract the components of the entry call
8195 Extract_Entry (N, Concval, Ename, Index);
8196 Conc_Typ := Etype (Concval);
8198 -- Examine the scope stack in order to find nearest enclosing protected
8199 -- or task type. This will constitute our invocation source.
8201 Old_Typ := Current_Scope;
8202 while Present (Old_Typ)
8203 and then not Is_Protected_Type (Old_Typ)
8204 and then not Is_Task_Type (Old_Typ)
8206 Old_Typ := Scope (Old_Typ);
8209 -- Generate the parameter list for all cases. The abortable flag is
8210 -- common among dispatching and regular requeue.
8212 Params := New_List (Abortable);
8214 -- Ada 2005 (AI05-0030): We have a dispatching requeue of the form
8215 -- Concval.Ename where the type of Concval is class-wide concurrent
8218 if Ada_Version >= Ada_05
8219 and then Present (Concval)
8220 and then Is_Class_Wide_Type (Conc_Typ)
8221 and then Is_Concurrent_Interface (Conc_Typ)
8223 RTS_Call := Make_Identifier (Loc, Name_uDisp_Requeue);
8226 -- Ada.Tags.Get_Offset_Index
8227 -- (Ada.Tags.Tag (Concval),
8228 -- <interface dispatch table position of Ename>)
8231 Make_Function_Call (Loc,
8233 New_Reference_To (RTE (RE_Get_Offset_Index), Loc),
8234 Parameter_Associations =>
8236 Unchecked_Convert_To (RTE (RE_Tag), Concval),
8237 Make_Integer_Literal (Loc, DT_Position (Entity (Ename))))));
8239 -- Specific actuals for protected to interface class-wide type
8242 if Is_Protected_Type (Old_Typ) then
8244 Make_Attribute_Reference (Loc, -- _object'Address
8246 Concurrent_Ref (New_Occurrence_Of (Old_Typ, Loc)),
8249 Prepend_To (Params, -- True
8250 New_Reference_To (Standard_True, Loc));
8252 -- Specific actuals for task to interface class-wide type requeue
8255 pragma Assert (Is_Task_Type (Old_Typ));
8257 Prepend_To (Params, -- null
8258 New_Reference_To (RTE (RE_Null_Address), Loc));
8259 Prepend_To (Params, -- False
8260 New_Reference_To (Standard_False, Loc));
8263 -- Finally, add the common object parameter
8265 Prepend_To (Params, New_Copy_Tree (Concval));
8267 -- Regular requeue processing
8270 New_Param := Concurrent_Ref (Concval);
8272 -- The index expression is common among all four cases
8275 Entry_Index_Expression (Loc, Entity (Ename), Index, Conc_Typ));
8277 if Is_Protected_Type (Old_Typ) then
8279 Make_Attribute_Reference (Loc,
8281 Concurrent_Ref (New_Occurrence_Of (Old_Typ, Loc)),
8283 Name_Unchecked_Access);
8285 -- Protected to protected requeue
8287 if Is_Protected_Type (Conc_Typ) then
8289 New_Reference_To (RTE (RE_Requeue_Protected_Entry), Loc);
8292 Make_Attribute_Reference (Loc,
8296 Name_Unchecked_Access);
8298 -- Protected to task requeue
8301 pragma Assert (Is_Task_Type (Conc_Typ));
8304 RTE (RE_Requeue_Protected_To_Task_Entry), Loc);
8307 Prepend (New_Param, Params);
8308 Prepend (Self_Param, Params);
8311 pragma Assert (Is_Task_Type (Old_Typ));
8313 -- Task to protected requeue
8315 if Is_Protected_Type (Conc_Typ) then
8318 RTE (RE_Requeue_Task_To_Protected_Entry), Loc);
8321 Make_Attribute_Reference (Loc,
8325 Name_Unchecked_Access);
8327 -- Task to task requeue
8330 pragma Assert (Is_Task_Type (Conc_Typ));
8332 New_Reference_To (RTE (RE_Requeue_Task_Entry), Loc);
8335 Prepend (New_Param, Params);
8339 -- Create the GNARLI or predefined primitive call
8342 Make_Procedure_Call_Statement (Loc,
8344 Parameter_Associations => Params);
8349 if Is_Protected_Type (Old_Typ) then
8351 -- Build the return statement to skip the rest of the entry body
8353 Skip_Stat := Make_Simple_Return_Statement (Loc);
8356 -- If the requeue is within a task, find the end label of the
8357 -- enclosing accept statement.
8359 Acc_Stat := Parent (N);
8360 while Nkind (Acc_Stat) /= N_Accept_Statement loop
8361 Acc_Stat := Parent (Acc_Stat);
8364 -- The last statement is the second label, used for completing the
8365 -- rendezvous the usual way. The label we are looking for is right
8369 Prev (Last (Statements (Handled_Statement_Sequence (Acc_Stat))));
8371 pragma Assert (Nkind (Lab_Node) = N_Label);
8373 -- Build the goto statement to skip the rest of the accept
8377 Make_Goto_Statement (Loc,
8378 Name => New_Occurrence_Of (Entity (Identifier (Lab_Node)), Loc));
8381 Set_Analyzed (Skip_Stat);
8383 Insert_After (N, Skip_Stat);
8384 end Expand_N_Requeue_Statement;
8386 -------------------------------
8387 -- Expand_N_Selective_Accept --
8388 -------------------------------
8390 procedure Expand_N_Selective_Accept (N : Node_Id) is
8391 Loc : constant Source_Ptr := Sloc (N);
8392 Alts : constant List_Id := Select_Alternatives (N);
8394 -- Note: in the below declarations a lot of new lists are allocated
8395 -- unconditionally which may well not end up being used. That's
8396 -- not a good idea since it wastes space gratuitously ???
8398 Accept_Case : List_Id;
8399 Accept_List : constant List_Id := New_List;
8402 Alt_List : constant List_Id := New_List;
8403 Alt_Stats : List_Id;
8404 Ann : Entity_Id := Empty;
8407 Check_Guard : Boolean := True;
8409 Decls : constant List_Id := New_List;
8410 Stats : constant List_Id := New_List;
8411 Body_List : constant List_Id := New_List;
8412 Trailing_List : constant List_Id := New_List;
8415 Else_Present : Boolean := False;
8416 Terminate_Alt : Node_Id := Empty;
8417 Select_Mode : Node_Id;
8419 Delay_Case : List_Id;
8420 Delay_Count : Integer := 0;
8421 Delay_Val : Entity_Id;
8422 Delay_Index : Entity_Id;
8423 Delay_Min : Entity_Id;
8424 Delay_Num : Int := 1;
8425 Delay_Alt_List : List_Id := New_List;
8426 Delay_List : constant List_Id := New_List;
8430 First_Delay : Boolean := True;
8431 Guard_Open : Entity_Id;
8437 Num_Accept : Nat := 0;
8440 Time_Type : Entity_Id;
8442 Select_Call : Node_Id;
8444 Qnam : constant Entity_Id :=
8445 Make_Defining_Identifier (Loc, New_External_Name ('S', 0));
8447 Xnam : constant Entity_Id :=
8448 Make_Defining_Identifier (Loc, New_External_Name ('J', 1));
8450 -----------------------
8451 -- Local subprograms --
8452 -----------------------
8454 function Accept_Or_Raise return List_Id;
8455 -- For the rare case where delay alternatives all have guards, and
8456 -- all of them are closed, it is still possible that there were open
8457 -- accept alternatives with no callers. We must reexamine the
8458 -- Accept_List, and execute a selective wait with no else if some
8459 -- accept is open. If none, we raise program_error.
8461 procedure Add_Accept (Alt : Node_Id);
8462 -- Process a single accept statement in a select alternative. Build
8463 -- procedure for body of accept, and add entry to dispatch table with
8464 -- expression for guard, in preparation for call to run time select.
8466 function Make_And_Declare_Label (Num : Int) return Node_Id;
8467 -- Manufacture a label using Num as a serial number and declare it.
8468 -- The declaration is appended to Decls. The label marks the trailing
8469 -- statements of an accept or delay alternative.
8471 function Make_Select_Call (Select_Mode : Entity_Id) return Node_Id;
8472 -- Build call to Selective_Wait runtime routine
8474 procedure Process_Delay_Alternative (Alt : Node_Id; Index : Int);
8475 -- Add code to compare value of delay with previous values, and
8476 -- generate case entry for trailing statements.
8478 procedure Process_Accept_Alternative
8482 -- Add code to call corresponding procedure, and branch to
8483 -- trailing statements, if any.
8485 ---------------------
8486 -- Accept_Or_Raise --
8487 ---------------------
8489 function Accept_Or_Raise return List_Id is
8492 J : constant Entity_Id := Make_Defining_Identifier (Loc,
8493 New_Internal_Name ('J'));
8496 -- We generate the following:
8498 -- for J in q'range loop
8499 -- if q(J).S /=null_task_entry then
8500 -- selective_wait (simple_mode,...);
8506 -- if no rendez_vous then
8507 -- raise program_error;
8510 -- Note that the code needs to know that the selector name
8511 -- in an Accept_Alternative is named S.
8513 Cond := Make_Op_Ne (Loc,
8515 Make_Selected_Component (Loc,
8516 Prefix => Make_Indexed_Component (Loc,
8517 Prefix => New_Reference_To (Qnam, Loc),
8518 Expressions => New_List (New_Reference_To (J, Loc))),
8519 Selector_Name => Make_Identifier (Loc, Name_S)),
8521 New_Reference_To (RTE (RE_Null_Task_Entry), Loc));
8524 Make_Implicit_Loop_Statement (N,
8525 Identifier => Empty,
8527 Make_Iteration_Scheme (Loc,
8528 Loop_Parameter_Specification =>
8529 Make_Loop_Parameter_Specification (Loc,
8530 Defining_Identifier => J,
8531 Discrete_Subtype_Definition =>
8532 Make_Attribute_Reference (Loc,
8533 Prefix => New_Reference_To (Qnam, Loc),
8534 Attribute_Name => Name_Range,
8535 Expressions => New_List (
8536 Make_Integer_Literal (Loc, 1))))),
8538 Statements => New_List (
8539 Make_Implicit_If_Statement (N,
8541 Then_Statements => New_List (
8543 New_Reference_To (RTE (RE_Simple_Mode), Loc)),
8544 Make_Exit_Statement (Loc))))));
8547 Make_Raise_Program_Error (Loc,
8548 Condition => Make_Op_Eq (Loc,
8549 Left_Opnd => New_Reference_To (Xnam, Loc),
8551 New_Reference_To (RTE (RE_No_Rendezvous), Loc)),
8552 Reason => PE_All_Guards_Closed));
8555 end Accept_Or_Raise;
8561 procedure Add_Accept (Alt : Node_Id) is
8562 Acc_Stm : constant Node_Id := Accept_Statement (Alt);
8563 Ename : constant Node_Id := Entry_Direct_Name (Acc_Stm);
8564 Eloc : constant Source_Ptr := Sloc (Ename);
8565 Eent : constant Entity_Id := Entity (Ename);
8566 Index : constant Node_Id := Entry_Index (Acc_Stm);
8567 Null_Body : Node_Id;
8568 Proc_Body : Node_Id;
8575 Ann := Node (Last_Elmt (Accept_Address (Eent)));
8578 if Present (Condition (Alt)) then
8580 Make_Conditional_Expression (Eloc, New_List (
8582 Entry_Index_Expression (Eloc, Eent, Index, Scope (Eent)),
8583 New_Reference_To (RTE (RE_Null_Task_Entry), Eloc)));
8586 Entry_Index_Expression
8587 (Eloc, Eent, Index, Scope (Eent));
8590 if Present (Handled_Statement_Sequence (Accept_Statement (Alt))) then
8591 Null_Body := New_Reference_To (Standard_False, Eloc);
8593 if Abort_Allowed then
8594 Call := Make_Procedure_Call_Statement (Eloc,
8595 Name => New_Reference_To (RTE (RE_Abort_Undefer), Eloc));
8596 Insert_Before (First (Statements (Handled_Statement_Sequence (
8597 Accept_Statement (Alt)))), Call);
8602 Make_Defining_Identifier (Eloc,
8603 New_External_Name (Chars (Ename), 'A', Num_Accept));
8605 if Comes_From_Source (Alt) then
8606 Set_Debug_Info_Needed (PB_Ent);
8610 Make_Subprogram_Body (Eloc,
8612 Make_Procedure_Specification (Eloc,
8613 Defining_Unit_Name => PB_Ent),
8614 Declarations => Declarations (Acc_Stm),
8615 Handled_Statement_Sequence =>
8616 Build_Accept_Body (Accept_Statement (Alt)));
8618 -- During the analysis of the body of the accept statement, any
8619 -- zero cost exception handler records were collected in the
8620 -- Accept_Handler_Records field of the N_Accept_Alternative node.
8621 -- This is where we move them to where they belong, namely the
8622 -- newly created procedure.
8624 Set_Handler_Records (PB_Ent, Accept_Handler_Records (Alt));
8625 Append (Proc_Body, Body_List);
8628 Null_Body := New_Reference_To (Standard_True, Eloc);
8630 -- if accept statement has declarations, insert above, given that
8631 -- we are not creating a body for the accept.
8633 if Present (Declarations (Acc_Stm)) then
8634 Insert_Actions (N, Declarations (Acc_Stm));
8638 Append_To (Accept_List,
8639 Make_Aggregate (Eloc, Expressions => New_List (Null_Body, Expr)));
8641 Num_Accept := Num_Accept + 1;
8644 ----------------------------
8645 -- Make_And_Declare_Label --
8646 ----------------------------
8648 function Make_And_Declare_Label (Num : Int) return Node_Id is
8652 Lab_Id := Make_Identifier (Loc, New_External_Name ('L', Num));
8654 Make_Label (Loc, Lab_Id);
8657 Make_Implicit_Label_Declaration (Loc,
8658 Defining_Identifier =>
8659 Make_Defining_Identifier (Loc, Chars (Lab_Id)),
8660 Label_Construct => Lab));
8663 end Make_And_Declare_Label;
8665 ----------------------
8666 -- Make_Select_Call --
8667 ----------------------
8669 function Make_Select_Call (Select_Mode : Entity_Id) return Node_Id is
8670 Params : constant List_Id := New_List;
8674 Make_Attribute_Reference (Loc,
8675 Prefix => New_Reference_To (Qnam, Loc),
8676 Attribute_Name => Name_Unchecked_Access),
8678 Append (Select_Mode, Params);
8679 Append (New_Reference_To (Ann, Loc), Params);
8680 Append (New_Reference_To (Xnam, Loc), Params);
8683 Make_Procedure_Call_Statement (Loc,
8684 Name => New_Reference_To (RTE (RE_Selective_Wait), Loc),
8685 Parameter_Associations => Params);
8686 end Make_Select_Call;
8688 --------------------------------
8689 -- Process_Accept_Alternative --
8690 --------------------------------
8692 procedure Process_Accept_Alternative
8697 Choices : List_Id := No_List;
8698 Alt_Stats : List_Id;
8701 Adjust_Condition (Condition (Alt));
8702 Alt_Stats := No_List;
8704 if Present (Handled_Statement_Sequence (Accept_Statement (Alt))) then
8705 Choices := New_List (
8706 Make_Integer_Literal (Loc, Index));
8708 Alt_Stats := New_List (
8709 Make_Procedure_Call_Statement (Sloc (Proc),
8710 Name => New_Reference_To (
8711 Defining_Unit_Name (Specification (Proc)), Sloc (Proc))));
8714 if Statements (Alt) /= Empty_List then
8716 if No (Alt_Stats) then
8718 -- Accept with no body, followed by trailing statements
8720 Choices := New_List (
8721 Make_Integer_Literal (Loc, Index));
8723 Alt_Stats := New_List;
8726 -- After the call, if any, branch to trailing statements. We
8727 -- create a label for each, as well as the corresponding label
8730 Lab := Make_And_Declare_Label (Index);
8731 Append_To (Alt_Stats,
8732 Make_Goto_Statement (Loc,
8733 Name => New_Copy (Identifier (Lab))));
8735 Append (Lab, Trailing_List);
8736 Append_List (Statements (Alt), Trailing_List);
8737 Append_To (Trailing_List,
8738 Make_Goto_Statement (Loc,
8739 Name => New_Copy (Identifier (End_Lab))));
8742 if Present (Alt_Stats) then
8744 -- Procedure call. and/or trailing statements
8746 Append_To (Alt_List,
8747 Make_Case_Statement_Alternative (Loc,
8748 Discrete_Choices => Choices,
8749 Statements => Alt_Stats));
8751 end Process_Accept_Alternative;
8753 -------------------------------
8754 -- Process_Delay_Alternative --
8755 -------------------------------
8757 procedure Process_Delay_Alternative (Alt : Node_Id; Index : Int) is
8760 Delay_Alt : List_Id;
8763 -- Deal with C/Fortran boolean as delay condition
8765 Adjust_Condition (Condition (Alt));
8767 -- Determine the smallest specified delay
8769 -- for each delay alternative generate:
8771 -- if guard-expression then
8772 -- Delay_Val := delay-expression;
8773 -- Guard_Open := True;
8774 -- if Delay_Val < Delay_Min then
8775 -- Delay_Min := Delay_Val;
8776 -- Delay_Index := Index;
8780 -- The enclosing if-statement is omitted if there is no guard
8785 First_Delay := False;
8787 Delay_Alt := New_List (
8788 Make_Assignment_Statement (Loc,
8789 Name => New_Reference_To (Delay_Min, Loc),
8790 Expression => Expression (Delay_Statement (Alt))));
8792 if Delay_Count > 1 then
8793 Append_To (Delay_Alt,
8794 Make_Assignment_Statement (Loc,
8795 Name => New_Reference_To (Delay_Index, Loc),
8796 Expression => Make_Integer_Literal (Loc, Index)));
8800 Delay_Alt := New_List (
8801 Make_Assignment_Statement (Loc,
8802 Name => New_Reference_To (Delay_Val, Loc),
8803 Expression => Expression (Delay_Statement (Alt))));
8805 if Time_Type = Standard_Duration then
8808 Left_Opnd => New_Reference_To (Delay_Val, Loc),
8809 Right_Opnd => New_Reference_To (Delay_Min, Loc));
8812 -- The scope of the time type must define a comparison
8813 -- operator. The scope itself may not be visible, so we
8814 -- construct a node with entity information to insure that
8815 -- semantic analysis can find the proper operator.
8818 Make_Function_Call (Loc,
8819 Name => Make_Selected_Component (Loc,
8820 Prefix => New_Reference_To (Scope (Time_Type), Loc),
8822 Make_Operator_Symbol (Loc,
8823 Chars => Name_Op_Lt,
8824 Strval => No_String)),
8825 Parameter_Associations =>
8827 New_Reference_To (Delay_Val, Loc),
8828 New_Reference_To (Delay_Min, Loc)));
8830 Set_Entity (Prefix (Name (Cond)), Scope (Time_Type));
8833 Append_To (Delay_Alt,
8834 Make_Implicit_If_Statement (N,
8836 Then_Statements => New_List (
8837 Make_Assignment_Statement (Loc,
8838 Name => New_Reference_To (Delay_Min, Loc),
8839 Expression => New_Reference_To (Delay_Val, Loc)),
8841 Make_Assignment_Statement (Loc,
8842 Name => New_Reference_To (Delay_Index, Loc),
8843 Expression => Make_Integer_Literal (Loc, Index)))));
8847 Append_To (Delay_Alt,
8848 Make_Assignment_Statement (Loc,
8849 Name => New_Reference_To (Guard_Open, Loc),
8850 Expression => New_Reference_To (Standard_True, Loc)));
8853 if Present (Condition (Alt)) then
8854 Delay_Alt := New_List (
8855 Make_Implicit_If_Statement (N,
8856 Condition => Condition (Alt),
8857 Then_Statements => Delay_Alt));
8860 Append_List (Delay_Alt, Delay_List);
8862 -- If the delay alternative has a statement part, add choice to the
8863 -- case statements for delays.
8865 if Present (Statements (Alt)) then
8867 if Delay_Count = 1 then
8868 Append_List (Statements (Alt), Delay_Alt_List);
8871 Choices := New_List (
8872 Make_Integer_Literal (Loc, Index));
8874 Append_To (Delay_Alt_List,
8875 Make_Case_Statement_Alternative (Loc,
8876 Discrete_Choices => Choices,
8877 Statements => Statements (Alt)));
8880 elsif Delay_Count = 1 then
8882 -- If the single delay has no trailing statements, add a branch
8883 -- to the exit label to the selective wait.
8885 Delay_Alt_List := New_List (
8886 Make_Goto_Statement (Loc,
8887 Name => New_Copy (Identifier (End_Lab))));
8890 end Process_Delay_Alternative;
8892 -- Start of processing for Expand_N_Selective_Accept
8895 -- First insert some declarations before the select. The first is:
8899 -- This variable holds the parameters passed to the accept body. This
8900 -- declaration has already been inserted by the time we get here by
8901 -- a call to Expand_Accept_Declarations made from the semantics when
8902 -- processing the first accept statement contained in the select. We
8903 -- can find this entity as Accept_Address (E), where E is any of the
8904 -- entries references by contained accept statements.
8906 -- The first step is to scan the list of Selective_Accept_Statements
8907 -- to find this entity, and also count the number of accepts, and
8908 -- determine if terminated, delay or else is present:
8912 Alt := First (Alts);
8913 while Present (Alt) loop
8915 if Nkind (Alt) = N_Accept_Alternative then
8918 elsif Nkind (Alt) = N_Delay_Alternative then
8919 Delay_Count := Delay_Count + 1;
8921 -- If the delays are relative delays, the delay expressions have
8922 -- type Standard_Duration. Otherwise they must have some time type
8923 -- recognized by GNAT.
8925 if Nkind (Delay_Statement (Alt)) = N_Delay_Relative_Statement then
8926 Time_Type := Standard_Duration;
8928 Time_Type := Etype (Expression (Delay_Statement (Alt)));
8930 if Is_RTE (Base_Type (Etype (Time_Type)), RO_CA_Time)
8931 or else Is_RTE (Base_Type (Etype (Time_Type)), RO_RT_Time)
8936 "& is not a time type (RM 9.6(6))",
8937 Expression (Delay_Statement (Alt)), Time_Type);
8938 Time_Type := Standard_Duration;
8939 Set_Etype (Expression (Delay_Statement (Alt)), Any_Type);
8943 if No (Condition (Alt)) then
8945 -- This guard will always be open
8947 Check_Guard := False;
8950 elsif Nkind (Alt) = N_Terminate_Alternative then
8951 Adjust_Condition (Condition (Alt));
8952 Terminate_Alt := Alt;
8955 Num_Alts := Num_Alts + 1;
8959 Else_Present := Present (Else_Statements (N));
8961 -- At the same time (see procedure Add_Accept) we build the accept list:
8963 -- Qnn : Accept_List (1 .. num-select) := (
8964 -- (null-body, entry-index),
8965 -- (null-body, entry-index),
8967 -- (null_body, entry-index));
8969 -- In the above declaration, null-body is True if the corresponding
8970 -- accept has no body, and false otherwise. The entry is either the
8971 -- entry index expression if there is no guard, or if a guard is
8972 -- present, then a conditional expression of the form:
8974 -- (if guard then entry-index else Null_Task_Entry)
8976 -- If a guard is statically known to be false, the entry can simply
8977 -- be omitted from the accept list.
8980 Make_Object_Declaration (Loc,
8981 Defining_Identifier => Qnam,
8982 Object_Definition =>
8983 New_Reference_To (RTE (RE_Accept_List), Loc),
8984 Aliased_Present => True,
8987 Make_Qualified_Expression (Loc,
8989 New_Reference_To (RTE (RE_Accept_List), Loc),
8991 Make_Aggregate (Loc, Expressions => Accept_List)));
8995 -- Then we declare the variable that holds the index for the accept
8996 -- that will be selected for service:
8998 -- Xnn : Select_Index;
9001 Make_Object_Declaration (Loc,
9002 Defining_Identifier => Xnam,
9003 Object_Definition =>
9004 New_Reference_To (RTE (RE_Select_Index), Loc),
9006 New_Reference_To (RTE (RE_No_Rendezvous), Loc));
9010 -- After this follow procedure declarations for each accept body
9017 -- where the ... are statements from the corresponding procedure body.
9018 -- No parameters are involved, since the parameters are passed via Ann
9019 -- and the parameter references have already been expanded to be direct
9020 -- references to Ann (see Exp_Ch2.Expand_Entry_Parameter). Furthermore,
9021 -- any embedded tasking statements (which would normally be illegal in
9022 -- procedures), have been converted to calls to the tasking runtime so
9023 -- there is no problem in putting them into procedures.
9025 -- The original accept statement has been expanded into a block in
9026 -- the same fashion as for simple accepts (see Build_Accept_Body).
9028 -- Note: we don't really need to build these procedures for the case
9029 -- where no delay statement is present, but it is just as easy to
9030 -- build them unconditionally, and not significantly inefficient,
9031 -- since if they are short they will be inlined anyway.
9033 -- The procedure declarations have been assembled in Body_List
9035 -- If delays are present, we must compute the required delay.
9036 -- We first generate the declarations:
9038 -- Delay_Index : Boolean := 0;
9039 -- Delay_Min : Some_Time_Type.Time;
9040 -- Delay_Val : Some_Time_Type.Time;
9042 -- Delay_Index will be set to the index of the minimum delay, i.e. the
9043 -- active delay that is actually chosen as the basis for the possible
9044 -- delay if an immediate rendez-vous is not possible.
9046 -- In the most common case there is a single delay statement, and this
9047 -- is handled specially.
9049 if Delay_Count > 0 then
9051 -- Generate the required declarations
9054 Make_Defining_Identifier (Loc, New_External_Name ('D', 1));
9056 Make_Defining_Identifier (Loc, New_External_Name ('D', 2));
9058 Make_Defining_Identifier (Loc, New_External_Name ('D', 3));
9061 Make_Object_Declaration (Loc,
9062 Defining_Identifier => Delay_Val,
9063 Object_Definition => New_Reference_To (Time_Type, Loc)));
9066 Make_Object_Declaration (Loc,
9067 Defining_Identifier => Delay_Index,
9068 Object_Definition => New_Reference_To (Standard_Integer, Loc),
9069 Expression => Make_Integer_Literal (Loc, 0)));
9072 Make_Object_Declaration (Loc,
9073 Defining_Identifier => Delay_Min,
9074 Object_Definition => New_Reference_To (Time_Type, Loc),
9076 Unchecked_Convert_To (Time_Type,
9077 Make_Attribute_Reference (Loc,
9079 New_Occurrence_Of (Underlying_Type (Time_Type), Loc),
9080 Attribute_Name => Name_Last))));
9082 -- Create Duration and Delay_Mode objects used for passing a delay
9085 D := Make_Defining_Identifier (Loc, New_Internal_Name ('D'));
9086 M := Make_Defining_Identifier (Loc, New_Internal_Name ('M'));
9092 -- Note that these values are defined in s-osprim.ads and must
9095 -- Relative : constant := 0;
9096 -- Absolute_Calendar : constant := 1;
9097 -- Absolute_RT : constant := 2;
9099 if Time_Type = Standard_Duration then
9100 Discr := Make_Integer_Literal (Loc, 0);
9102 elsif Is_RTE (Base_Type (Etype (Time_Type)), RO_CA_Time) then
9103 Discr := Make_Integer_Literal (Loc, 1);
9107 (Is_RTE (Base_Type (Etype (Time_Type)), RO_RT_Time));
9108 Discr := Make_Integer_Literal (Loc, 2);
9112 Make_Object_Declaration (Loc,
9113 Defining_Identifier => D,
9114 Object_Definition =>
9115 New_Reference_To (Standard_Duration, Loc)));
9118 Make_Object_Declaration (Loc,
9119 Defining_Identifier => M,
9120 Object_Definition =>
9121 New_Reference_To (Standard_Integer, Loc),
9122 Expression => Discr));
9127 Make_Defining_Identifier (Loc, New_External_Name ('G', 1));
9130 Make_Object_Declaration (Loc,
9131 Defining_Identifier => Guard_Open,
9132 Object_Definition => New_Reference_To (Standard_Boolean, Loc),
9133 Expression => New_Reference_To (Standard_False, Loc)));
9136 -- Delay_Count is zero, don't need M and D set (suppress warning)
9143 if Present (Terminate_Alt) then
9145 -- If the terminate alternative guard is False, use
9146 -- Simple_Mode; otherwise use Terminate_Mode.
9148 if Present (Condition (Terminate_Alt)) then
9149 Select_Mode := Make_Conditional_Expression (Loc,
9150 New_List (Condition (Terminate_Alt),
9151 New_Reference_To (RTE (RE_Terminate_Mode), Loc),
9152 New_Reference_To (RTE (RE_Simple_Mode), Loc)));
9154 Select_Mode := New_Reference_To (RTE (RE_Terminate_Mode), Loc);
9157 elsif Else_Present or Delay_Count > 0 then
9158 Select_Mode := New_Reference_To (RTE (RE_Else_Mode), Loc);
9161 Select_Mode := New_Reference_To (RTE (RE_Simple_Mode), Loc);
9164 Select_Call := Make_Select_Call (Select_Mode);
9165 Append (Select_Call, Stats);
9167 -- Now generate code to act on the result. There is an entry
9168 -- in this case for each accept statement with a non-null body,
9169 -- followed by a branch to the statements that follow the Accept.
9170 -- In the absence of delay alternatives, we generate:
9173 -- when No_Rendezvous => -- omitted if simple mode
9188 -- Lab0: Else_Statements;
9191 -- Lab1: Trailing_Statements1;
9194 -- Lab2: Trailing_Statements2;
9199 -- Generate label for common exit
9201 End_Lab := Make_And_Declare_Label (Num_Alts + 1);
9203 -- First entry is the default case, when no rendezvous is possible
9205 Choices := New_List (New_Reference_To (RTE (RE_No_Rendezvous), Loc));
9207 if Else_Present then
9209 -- If no rendezvous is possible, the else part is executed
9211 Lab := Make_And_Declare_Label (0);
9212 Alt_Stats := New_List (
9213 Make_Goto_Statement (Loc,
9214 Name => New_Copy (Identifier (Lab))));
9216 Append (Lab, Trailing_List);
9217 Append_List (Else_Statements (N), Trailing_List);
9218 Append_To (Trailing_List,
9219 Make_Goto_Statement (Loc,
9220 Name => New_Copy (Identifier (End_Lab))));
9222 Alt_Stats := New_List (
9223 Make_Goto_Statement (Loc,
9224 Name => New_Copy (Identifier (End_Lab))));
9227 Append_To (Alt_List,
9228 Make_Case_Statement_Alternative (Loc,
9229 Discrete_Choices => Choices,
9230 Statements => Alt_Stats));
9232 -- We make use of the fact that Accept_Index is an integer type, and
9233 -- generate successive literals for entries for each accept. Only those
9234 -- for which there is a body or trailing statements get a case entry.
9236 Alt := First (Select_Alternatives (N));
9237 Proc := First (Body_List);
9238 while Present (Alt) loop
9240 if Nkind (Alt) = N_Accept_Alternative then
9241 Process_Accept_Alternative (Alt, Index, Proc);
9245 (Handled_Statement_Sequence (Accept_Statement (Alt)))
9250 elsif Nkind (Alt) = N_Delay_Alternative then
9251 Process_Delay_Alternative (Alt, Delay_Num);
9252 Delay_Num := Delay_Num + 1;
9258 -- An others choice is always added to the main case, as well
9259 -- as the delay case (to satisfy the compiler).
9261 Append_To (Alt_List,
9262 Make_Case_Statement_Alternative (Loc,
9264 New_List (Make_Others_Choice (Loc)),
9266 New_List (Make_Goto_Statement (Loc,
9267 Name => New_Copy (Identifier (End_Lab))))));
9269 Accept_Case := New_List (
9270 Make_Case_Statement (Loc,
9271 Expression => New_Reference_To (Xnam, Loc),
9272 Alternatives => Alt_List));
9274 Append_List (Trailing_List, Accept_Case);
9275 Append (End_Lab, Accept_Case);
9276 Append_List (Body_List, Decls);
9278 -- Construct case statement for trailing statements of delay
9279 -- alternatives, if there are several of them.
9281 if Delay_Count > 1 then
9282 Append_To (Delay_Alt_List,
9283 Make_Case_Statement_Alternative (Loc,
9285 New_List (Make_Others_Choice (Loc)),
9287 New_List (Make_Null_Statement (Loc))));
9289 Delay_Case := New_List (
9290 Make_Case_Statement (Loc,
9291 Expression => New_Reference_To (Delay_Index, Loc),
9292 Alternatives => Delay_Alt_List));
9294 Delay_Case := Delay_Alt_List;
9297 -- If there are no delay alternatives, we append the case statement
9298 -- to the statement list.
9300 if Delay_Count = 0 then
9301 Append_List (Accept_Case, Stats);
9303 -- Delay alternatives present
9306 -- If delay alternatives are present we generate:
9308 -- find minimum delay.
9309 -- DX := minimum delay;
9310 -- M := <delay mode>;
9311 -- Timed_Selective_Wait (Q'Unchecked_Access, Delay_Mode, P,
9314 -- if X = No_Rendezvous then
9315 -- case statement for delay statements.
9317 -- case statement for accept alternatives.
9328 -- The type of the delay expression is known to be legal
9330 if Time_Type = Standard_Duration then
9331 Conv := New_Reference_To (Delay_Min, Loc);
9333 elsif Is_RTE (Base_Type (Etype (Time_Type)), RO_CA_Time) then
9334 Conv := Make_Function_Call (Loc,
9335 New_Reference_To (RTE (RO_CA_To_Duration), Loc),
9336 New_List (New_Reference_To (Delay_Min, Loc)));
9340 (Is_RTE (Base_Type (Etype (Time_Type)), RO_RT_Time));
9342 Conv := Make_Function_Call (Loc,
9343 New_Reference_To (RTE (RO_RT_To_Duration), Loc),
9344 New_List (New_Reference_To (Delay_Min, Loc)));
9347 Stmt := Make_Assignment_Statement (Loc,
9348 Name => New_Reference_To (D, Loc),
9349 Expression => Conv);
9351 -- Change the value for Accept_Modes. (Else_Mode -> Delay_Mode)
9353 Parms := Parameter_Associations (Select_Call);
9354 Parm := First (Parms);
9356 while Present (Parm)
9357 and then Parm /= Select_Mode
9362 pragma Assert (Present (Parm));
9363 Rewrite (Parm, New_Reference_To (RTE (RE_Delay_Mode), Loc));
9366 -- Prepare two new parameters of Duration and Delay_Mode type
9367 -- which represent the value and the mode of the minimum delay.
9370 Insert_After (Parm, New_Reference_To (M, Loc));
9371 Insert_After (Parm, New_Reference_To (D, Loc));
9373 -- Create a call to RTS
9375 Rewrite (Select_Call,
9376 Make_Procedure_Call_Statement (Loc,
9377 Name => New_Reference_To (RTE (RE_Timed_Selective_Wait), Loc),
9378 Parameter_Associations => Parms));
9380 -- This new call should follow the calculation of the minimum
9383 Insert_List_Before (Select_Call, Delay_List);
9387 Make_Implicit_If_Statement (N,
9388 Condition => New_Reference_To (Guard_Open, Loc),
9390 New_List (New_Copy_Tree (Stmt),
9391 New_Copy_Tree (Select_Call)),
9392 Else_Statements => Accept_Or_Raise);
9393 Rewrite (Select_Call, Stmt);
9395 Insert_Before (Select_Call, Stmt);
9399 Make_Implicit_If_Statement (N,
9400 Condition => Make_Op_Eq (Loc,
9401 Left_Opnd => New_Reference_To (Xnam, Loc),
9403 New_Reference_To (RTE (RE_No_Rendezvous), Loc)),
9405 Then_Statements => Delay_Case,
9406 Else_Statements => Accept_Case);
9408 Append (Cases, Stats);
9412 -- Replace accept statement with appropriate block
9415 Make_Block_Statement (Loc,
9416 Declarations => Decls,
9417 Handled_Statement_Sequence =>
9418 Make_Handled_Sequence_Of_Statements (Loc,
9419 Statements => Stats));
9424 -- Note: have to worry more about abort deferral in above code ???
9426 -- Final step is to unstack the Accept_Address entries for all accept
9427 -- statements appearing in accept alternatives in the select statement
9429 Alt := First (Alts);
9430 while Present (Alt) loop
9431 if Nkind (Alt) = N_Accept_Alternative then
9432 Remove_Last_Elmt (Accept_Address
9433 (Entity (Entry_Direct_Name (Accept_Statement (Alt)))));
9438 end Expand_N_Selective_Accept;
9440 --------------------------------------
9441 -- Expand_N_Single_Task_Declaration --
9442 --------------------------------------
9444 -- Single task declarations should never be present after semantic
9445 -- analysis, since we expect them to be replaced by a declaration of an
9446 -- anonymous task type, followed by a declaration of the task object. We
9447 -- include this routine to make sure that is happening!
9449 procedure Expand_N_Single_Task_Declaration (N : Node_Id) is
9451 raise Program_Error;
9452 end Expand_N_Single_Task_Declaration;
9454 ------------------------
9455 -- Expand_N_Task_Body --
9456 ------------------------
9458 -- Given a task body
9460 -- task body tname is
9466 -- This expansion routine converts it into a procedure and sets the
9467 -- elaboration flag for the procedure to true, to represent the fact
9468 -- that the task body is now elaborated:
9470 -- procedure tnameB (_Task : access tnameV) is
9471 -- discriminal : dtype renames _Task.discriminant;
9473 -- procedure _clean is
9477 -- Abort_Undefer.all;
9482 -- Abort_Undefer.all;
9484 -- System.Task_Stages.Complete_Activation;
9492 -- In addition, if the task body is an activator, then a call to activate
9493 -- tasks is added at the start of the statements, before the call to
9494 -- Complete_Activation, and if in addition the task is a master then it
9495 -- must be established as a master. These calls are inserted and analyzed
9496 -- in Expand_Cleanup_Actions, when the Handled_Sequence_Of_Statements is
9499 -- There is one discriminal declaration line generated for each
9500 -- discriminant that is present to provide an easy reference point for
9501 -- discriminant references inside the body (see Exp_Ch2.Expand_Name).
9503 -- Note on relationship to GNARLI definition. In the GNARLI definition,
9504 -- task body procedures have a profile (Arg : System.Address). That is
9505 -- needed because GNARLI has to use the same access-to-subprogram type
9506 -- for all task types. We depend here on knowing that in GNAT, passing
9507 -- an address argument by value is identical to passing a record value
9508 -- by access (in either case a single pointer is passed), so even though
9509 -- this procedure has the wrong profile. In fact it's all OK, since the
9510 -- callings sequence is identical.
9512 procedure Expand_N_Task_Body (N : Node_Id) is
9513 Loc : constant Source_Ptr := Sloc (N);
9514 Ttyp : constant Entity_Id := Corresponding_Spec (N);
9518 Insert_Nod : Node_Id;
9519 -- Used to determine the proper location of wrapper body insertions
9522 -- Add renaming declarations for discriminals and a declaration for the
9523 -- entry family index (if applicable).
9525 Install_Private_Data_Declarations
9526 (Loc, Task_Body_Procedure (Ttyp), Ttyp, N, Declarations (N));
9528 -- Add a call to Abort_Undefer at the very beginning of the task
9529 -- body since this body is called with abort still deferred.
9531 if Abort_Allowed then
9532 Call := Build_Runtime_Call (Loc, RE_Abort_Undefer);
9534 (First (Statements (Handled_Statement_Sequence (N))), Call);
9538 -- The statement part has already been protected with an at_end and
9539 -- cleanup actions. The call to Complete_Activation must be placed
9540 -- at the head of the sequence of statements of that block. The
9541 -- declarations have been merged in this sequence of statements but
9542 -- the first real statement is accessible from the First_Real_Statement
9543 -- field (which was set for exactly this purpose).
9545 if Restricted_Profile then
9546 Call := Build_Runtime_Call (Loc, RE_Complete_Restricted_Activation);
9548 Call := Build_Runtime_Call (Loc, RE_Complete_Activation);
9552 (First_Real_Statement (Handled_Statement_Sequence (N)), Call);
9556 Make_Subprogram_Body (Loc,
9557 Specification => Build_Task_Proc_Specification (Ttyp),
9558 Declarations => Declarations (N),
9559 Handled_Statement_Sequence => Handled_Statement_Sequence (N));
9561 -- If the task contains generic instantiations, cleanup actions are
9562 -- delayed until after instantiation. Transfer the activation chain to
9563 -- the subprogram, to insure that the activation call is properly
9564 -- generated. It the task body contains inner tasks, indicate that the
9565 -- subprogram is a task master.
9567 if Delay_Cleanups (Ttyp) then
9568 Set_Activation_Chain_Entity (New_N, Activation_Chain_Entity (N));
9569 Set_Is_Task_Master (New_N, Is_Task_Master (N));
9575 -- Set elaboration flag immediately after task body. If the body is a
9576 -- subunit, the flag is set in the declarative part containing the stub.
9578 if Nkind (Parent (N)) /= N_Subunit then
9580 Make_Assignment_Statement (Loc,
9582 Make_Identifier (Loc, New_External_Name (Chars (Ttyp), 'E')),
9583 Expression => New_Reference_To (Standard_True, Loc)));
9586 -- Ada 2005 (AI-345): Construct the primitive entry wrapper bodies after
9587 -- the task body. At this point all wrapper specs have been created,
9588 -- frozen and included in the dispatch table for the task type.
9590 if Ada_Version >= Ada_05 then
9591 if Nkind (Parent (N)) = N_Subunit then
9592 Insert_Nod := Corresponding_Stub (Parent (N));
9597 Build_Wrapper_Bodies (Loc, Ttyp, Insert_Nod);
9599 end Expand_N_Task_Body;
9601 ------------------------------------
9602 -- Expand_N_Task_Type_Declaration --
9603 ------------------------------------
9605 -- We have several things to do. First we must create a Boolean flag used
9606 -- to mark if the body is elaborated yet. This variable gets set to True
9607 -- when the body of the task is elaborated (we can't rely on the normal
9608 -- ABE mechanism for the task body, since we need to pass an access to
9609 -- this elaboration boolean to the runtime routines).
9611 -- taskE : aliased Boolean := False;
9613 -- Next a variable is declared to hold the task stack size (either the
9614 -- default : Unspecified_Size, or a value that is set by a pragma
9615 -- Storage_Size). If the value of the pragma Storage_Size is static, then
9616 -- the variable is initialized with this value:
9618 -- taskZ : Size_Type := Unspecified_Size;
9620 -- taskZ : Size_Type := Size_Type (size_expression);
9622 -- Note: No variable is needed to hold the task relative deadline since
9623 -- its value would never be static because the parameter is of a private
9624 -- type (Ada.Real_Time.Time_Span).
9626 -- Next we create a corresponding record type declaration used to represent
9627 -- values of this task. The general form of this type declaration is
9629 -- type taskV (discriminants) is record
9630 -- _Task_Id : Task_Id;
9631 -- entry_family : array (bounds) of Void;
9632 -- _Priority : Integer := priority_expression;
9633 -- _Size : Size_Type := Size_Type (size_expression);
9634 -- _Task_Info : Task_Info_Type := task_info_expression;
9637 -- The discriminants are present only if the corresponding task type has
9638 -- discriminants, and they exactly mirror the task type discriminants.
9640 -- The Id field is always present. It contains the Task_Id value, as set by
9641 -- the call to Create_Task. Note that although the task is limited, the
9642 -- task value record type is not limited, so there is no problem in passing
9643 -- this field as an out parameter to Create_Task.
9645 -- One entry_family component is present for each entry family in the task
9646 -- definition. The bounds correspond to the bounds of the entry family
9647 -- (which may depend on discriminants). The element type is void, since we
9648 -- only need the bounds information for determining the entry index. Note
9649 -- that the use of an anonymous array would normally be illegal in this
9650 -- context, but this is a parser check, and the semantics is quite prepared
9651 -- to handle such a case.
9653 -- The _Size field is present only if a Storage_Size pragma appears in the
9654 -- task definition. The expression captures the argument that was present
9655 -- in the pragma, and is used to override the task stack size otherwise
9656 -- associated with the task type.
9658 -- The _Priority field is present only if a Priority or Interrupt_Priority
9659 -- pragma appears in the task definition. The expression captures the
9660 -- argument that was present in the pragma, and is used to provide the Size
9661 -- parameter to the call to Create_Task.
9663 -- The _Task_Info field is present only if a Task_Info pragma appears in
9664 -- the task definition. The expression captures the argument that was
9665 -- present in the pragma, and is used to provide the Task_Image parameter
9666 -- to the call to Create_Task.
9668 -- The _Relative_Deadline field is present only if a Relative_Deadline
9669 -- pragma appears in the task definition. The expression captures the
9670 -- argument that was present in the pragma, and is used to provide the
9671 -- Relative_Deadline parameter to the call to Create_Task.
9673 -- When a task is declared, an instance of the task value record is
9674 -- created. The elaboration of this declaration creates the correct bounds
9675 -- for the entry families, and also evaluates the size, priority, and
9676 -- task_Info expressions if needed. The initialization routine for the task
9677 -- type itself then calls Create_Task with appropriate parameters to
9678 -- initialize the value of the Task_Id field.
9680 -- Note: the address of this record is passed as the "Discriminants"
9681 -- parameter for Create_Task. Since Create_Task merely passes this onto the
9682 -- body procedure, it does not matter that it does not quite match the
9683 -- GNARLI model of what is being passed (the record contains more than just
9684 -- the discriminants, but the discriminants can be found from the record
9687 -- The Entity_Id for this created record type is placed in the
9688 -- Corresponding_Record_Type field of the associated task type entity.
9690 -- Next we create a procedure specification for the task body procedure:
9692 -- procedure taskB (_Task : access taskV);
9694 -- Note that this must come after the record type declaration, since
9695 -- the spec refers to this type. It turns out that the initialization
9696 -- procedure for the value type references the task body spec, but that's
9697 -- fine, since it won't be generated till the freeze point for the type,
9698 -- which is certainly after the task body spec declaration.
9700 -- Finally, we set the task index value field of the entry attribute in
9701 -- the case of a simple entry.
9703 procedure Expand_N_Task_Type_Declaration (N : Node_Id) is
9704 Loc : constant Source_Ptr := Sloc (N);
9705 Tasktyp : constant Entity_Id := Etype (Defining_Identifier (N));
9706 Tasknm : constant Name_Id := Chars (Tasktyp);
9707 Taskdef : constant Node_Id := Task_Definition (N);
9709 Proc_Spec : Node_Id;
9711 Rec_Ent : Entity_Id;
9713 Elab_Decl : Node_Id;
9714 Size_Decl : Node_Id;
9715 Body_Decl : Node_Id;
9716 Task_Size : Node_Id;
9717 Ent_Stack : Entity_Id;
9718 Decl_Stack : Node_Id;
9721 -- If already expanded, nothing to do
9723 if Present (Corresponding_Record_Type (Tasktyp)) then
9727 -- Here we will do the expansion
9729 Rec_Decl := Build_Corresponding_Record (N, Tasktyp, Loc);
9731 -- Ada 2005 (AI-345): Propagate the attribute that contains the list
9732 -- of implemented interfaces.
9734 Set_Interface_List (Type_Definition (Rec_Decl), Interface_List (N));
9736 Rec_Ent := Defining_Identifier (Rec_Decl);
9737 Cdecls := Component_Items (Component_List
9738 (Type_Definition (Rec_Decl)));
9740 Qualify_Entity_Names (N);
9742 -- First create the elaboration variable
9745 Make_Object_Declaration (Loc,
9746 Defining_Identifier =>
9747 Make_Defining_Identifier (Sloc (Tasktyp),
9748 Chars => New_External_Name (Tasknm, 'E')),
9749 Aliased_Present => True,
9750 Object_Definition => New_Reference_To (Standard_Boolean, Loc),
9751 Expression => New_Reference_To (Standard_False, Loc));
9752 Insert_After (N, Elab_Decl);
9754 -- Next create the declaration of the size variable (tasknmZ)
9756 Set_Storage_Size_Variable (Tasktyp,
9757 Make_Defining_Identifier (Sloc (Tasktyp),
9758 Chars => New_External_Name (Tasknm, 'Z')));
9760 if Present (Taskdef) and then Has_Storage_Size_Pragma (Taskdef) and then
9761 Is_Static_Expression (Expression (First (
9762 Pragma_Argument_Associations (Find_Task_Or_Protected_Pragma (
9763 Taskdef, Name_Storage_Size)))))
9766 Make_Object_Declaration (Loc,
9767 Defining_Identifier => Storage_Size_Variable (Tasktyp),
9768 Object_Definition => New_Reference_To (RTE (RE_Size_Type), Loc),
9770 Convert_To (RTE (RE_Size_Type),
9773 Pragma_Argument_Associations (
9774 Find_Task_Or_Protected_Pragma
9775 (Taskdef, Name_Storage_Size)))))));
9779 Make_Object_Declaration (Loc,
9780 Defining_Identifier => Storage_Size_Variable (Tasktyp),
9781 Object_Definition => New_Reference_To (RTE (RE_Size_Type), Loc),
9782 Expression => New_Reference_To (RTE (RE_Unspecified_Size), Loc));
9785 Insert_After (Elab_Decl, Size_Decl);
9787 -- Next build the rest of the corresponding record declaration. This is
9788 -- done last, since the corresponding record initialization procedure
9789 -- will reference the previously created entities.
9791 -- Fill in the component declarations -- first the _Task_Id field
9794 Make_Component_Declaration (Loc,
9795 Defining_Identifier =>
9796 Make_Defining_Identifier (Loc, Name_uTask_Id),
9797 Component_Definition =>
9798 Make_Component_Definition (Loc,
9799 Aliased_Present => False,
9800 Subtype_Indication => New_Reference_To (RTE (RO_ST_Task_Id),
9803 -- Declare static ATCB (that is, created by the expander) if we are
9804 -- using the Restricted run time.
9806 if Restricted_Profile then
9808 Make_Component_Declaration (Loc,
9809 Defining_Identifier =>
9810 Make_Defining_Identifier (Loc, Name_uATCB),
9812 Component_Definition =>
9813 Make_Component_Definition (Loc,
9814 Aliased_Present => True,
9815 Subtype_Indication => Make_Subtype_Indication (Loc,
9816 Subtype_Mark => New_Occurrence_Of
9817 (RTE (RE_Ada_Task_Control_Block), Loc),
9820 Make_Index_Or_Discriminant_Constraint (Loc,
9822 New_List (Make_Integer_Literal (Loc, 0)))))));
9826 -- Declare static stack (that is, created by the expander) if we are
9827 -- using the Restricted run time on a bare board configuration.
9829 if Restricted_Profile
9830 and then Preallocated_Stacks_On_Target
9832 -- First we need to extract the appropriate stack size
9834 Ent_Stack := Make_Defining_Identifier (Loc, Name_uStack);
9836 if Present (Taskdef) and then Has_Storage_Size_Pragma (Taskdef) then
9838 Expr_N : constant Node_Id :=
9840 Pragma_Argument_Associations (
9841 Find_Task_Or_Protected_Pragma
9842 (Taskdef, Name_Storage_Size))));
9843 Etyp : constant Entity_Id := Etype (Expr_N);
9844 P : constant Node_Id := Parent (Expr_N);
9847 -- The stack is defined inside the corresponding record.
9848 -- Therefore if the size of the stack is set by means of
9849 -- a discriminant, we must reference the discriminant of the
9850 -- corresponding record type.
9852 if Nkind (Expr_N) in N_Has_Entity
9853 and then Present (Discriminal_Link (Entity (Expr_N)))
9857 (CR_Discriminant (Discriminal_Link (Entity (Expr_N))),
9859 Set_Parent (Task_Size, P);
9860 Set_Etype (Task_Size, Etyp);
9861 Set_Analyzed (Task_Size);
9864 Task_Size := Relocate_Node (Expr_N);
9870 New_Reference_To (RTE (RE_Default_Stack_Size), Loc);
9873 Decl_Stack := Make_Component_Declaration (Loc,
9874 Defining_Identifier => Ent_Stack,
9876 Component_Definition =>
9877 Make_Component_Definition (Loc,
9878 Aliased_Present => True,
9879 Subtype_Indication => Make_Subtype_Indication (Loc,
9881 New_Occurrence_Of (RTE (RE_Storage_Array), Loc),
9884 Make_Index_Or_Discriminant_Constraint (Loc,
9885 Constraints => New_List (Make_Range (Loc,
9886 Low_Bound => Make_Integer_Literal (Loc, 1),
9887 High_Bound => Convert_To (RTE (RE_Storage_Offset),
9890 Append_To (Cdecls, Decl_Stack);
9892 -- The appropriate alignment for the stack is ensured by the run-time
9893 -- code in charge of task creation.
9897 -- Add components for entry families
9899 Collect_Entry_Families (Loc, Cdecls, Size_Decl, Tasktyp);
9901 -- Add the _Priority component if a Priority pragma is present
9903 if Present (Taskdef) and then Has_Priority_Pragma (Taskdef) then
9905 Prag : constant Node_Id :=
9906 Find_Task_Or_Protected_Pragma (Taskdef, Name_Priority);
9910 Expr := First (Pragma_Argument_Associations (Prag));
9912 if Nkind (Expr) = N_Pragma_Argument_Association then
9913 Expr := Expression (Expr);
9916 Expr := New_Copy_Tree (Expr);
9918 -- Add conversion to proper type to do range check if required
9919 -- Note that for runtime units, we allow out of range interrupt
9920 -- priority values to be used in a priority pragma. This is for
9921 -- the benefit of some versions of System.Interrupts which use
9922 -- a special server task with maximum interrupt priority.
9924 if Pragma_Name (Prag) = Name_Priority
9925 and then not GNAT_Mode
9927 Rewrite (Expr, Convert_To (RTE (RE_Priority), Expr));
9929 Rewrite (Expr, Convert_To (RTE (RE_Any_Priority), Expr));
9933 Make_Component_Declaration (Loc,
9934 Defining_Identifier =>
9935 Make_Defining_Identifier (Loc, Name_uPriority),
9936 Component_Definition =>
9937 Make_Component_Definition (Loc,
9938 Aliased_Present => False,
9939 Subtype_Indication => New_Reference_To (Standard_Integer,
9941 Expression => Expr));
9945 -- Add the _Task_Size component if a Storage_Size pragma is present
9947 if Present (Taskdef)
9948 and then Has_Storage_Size_Pragma (Taskdef)
9951 Make_Component_Declaration (Loc,
9952 Defining_Identifier =>
9953 Make_Defining_Identifier (Loc, Name_uSize),
9955 Component_Definition =>
9956 Make_Component_Definition (Loc,
9957 Aliased_Present => False,
9958 Subtype_Indication => New_Reference_To (RTE (RE_Size_Type),
9962 Convert_To (RTE (RE_Size_Type),
9965 Pragma_Argument_Associations (
9966 Find_Task_Or_Protected_Pragma
9967 (Taskdef, Name_Storage_Size))))))));
9970 -- Add the _Task_Info component if a Task_Info pragma is present
9972 if Present (Taskdef) and then Has_Task_Info_Pragma (Taskdef) then
9974 Make_Component_Declaration (Loc,
9975 Defining_Identifier =>
9976 Make_Defining_Identifier (Loc, Name_uTask_Info),
9978 Component_Definition =>
9979 Make_Component_Definition (Loc,
9980 Aliased_Present => False,
9981 Subtype_Indication =>
9982 New_Reference_To (RTE (RE_Task_Info_Type), Loc)),
9984 Expression => New_Copy (
9986 Pragma_Argument_Associations (
9987 Find_Task_Or_Protected_Pragma
9988 (Taskdef, Name_Task_Info)))))));
9991 -- Add the _Relative_Deadline component if a Relative_Deadline pragma is
9992 -- present. If we are using a restricted run time this component will
9993 -- not be added (deadlines are not allowed by the Ravenscar profile).
9995 if not Restricted_Profile
9996 and then Present (Taskdef)
9997 and then Has_Relative_Deadline_Pragma (Taskdef)
10000 Make_Component_Declaration (Loc,
10001 Defining_Identifier =>
10002 Make_Defining_Identifier (Loc, Name_uRelative_Deadline),
10004 Component_Definition =>
10005 Make_Component_Definition (Loc,
10006 Aliased_Present => False,
10007 Subtype_Indication =>
10008 New_Reference_To (RTE (RE_Time_Span), Loc)),
10011 Convert_To (RTE (RE_Time_Span),
10013 Expression (First (
10014 Pragma_Argument_Associations (
10015 Find_Task_Or_Protected_Pragma
10016 (Taskdef, Name_Relative_Deadline))))))));
10019 Insert_After (Size_Decl, Rec_Decl);
10021 -- Analyze the record declaration immediately after construction,
10022 -- because the initialization procedure is needed for single task
10023 -- declarations before the next entity is analyzed.
10025 Analyze (Rec_Decl);
10027 -- Create the declaration of the task body procedure
10029 Proc_Spec := Build_Task_Proc_Specification (Tasktyp);
10031 Make_Subprogram_Declaration (Loc,
10032 Specification => Proc_Spec);
10034 Insert_After (Rec_Decl, Body_Decl);
10036 -- The subprogram does not comes from source, so we have to indicate the
10037 -- need for debugging information explicitly.
10039 if Comes_From_Source (Original_Node (N)) then
10040 Set_Debug_Info_Needed (Defining_Entity (Proc_Spec));
10043 -- Ada 2005 (AI-345): Construct the primitive entry wrapper specs before
10044 -- the corresponding record has been frozen.
10046 if Ada_Version >= Ada_05 then
10047 Build_Wrapper_Specs (Loc, Tasktyp, Rec_Decl);
10050 -- Ada 2005 (AI-345): We must defer freezing to allow further
10051 -- declaration of primitive subprograms covering task interfaces
10053 if Ada_Version <= Ada_95 then
10055 -- Now we can freeze the corresponding record. This needs manually
10056 -- freezing, since it is really part of the task type, and the task
10057 -- type is frozen at this stage. We of course need the initialization
10058 -- procedure for this corresponding record type and we won't get it
10059 -- in time if we don't freeze now.
10062 L : constant List_Id := Freeze_Entity (Rec_Ent, Loc);
10064 if Is_Non_Empty_List (L) then
10065 Insert_List_After (Body_Decl, L);
10070 -- Complete the expansion of access types to the current task type, if
10071 -- any were declared.
10073 Expand_Previous_Access_Type (Tasktyp);
10074 end Expand_N_Task_Type_Declaration;
10076 -------------------------------
10077 -- Expand_N_Timed_Entry_Call --
10078 -------------------------------
10080 -- A timed entry call in normal case is not implemented using ATC mechanism
10081 -- anymore for efficiency reason.
10091 -- is expanded as follow:
10093 -- 1) When T.E is a task entry_call;
10097 -- X : Task_Entry_Index := <entry index>;
10098 -- DX : Duration := To_Duration (D);
10099 -- M : Delay_Mode := <discriminant>;
10100 -- P : parms := (parm, parm, parm);
10103 -- Timed_Protected_Entry_Call
10104 -- (<acceptor-task>, X, P'Address, DX, M, B);
10112 -- 2) When T.E is a protected entry_call;
10116 -- X : Protected_Entry_Index := <entry index>;
10117 -- DX : Duration := To_Duration (D);
10118 -- M : Delay_Mode := <discriminant>;
10119 -- P : parms := (parm, parm, parm);
10122 -- Timed_Protected_Entry_Call
10123 -- (<object>'unchecked_access, X, P'Address, DX, M, B);
10131 -- 3) Ada 2005 (AI-345): When T.E is a dispatching procedure call;
10134 -- B : Boolean := False;
10135 -- C : Ada.Tags.Prim_Op_Kind;
10136 -- DX : Duration := To_Duration (D)
10137 -- K : Ada.Tags.Tagged_Kind :=
10138 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag (<object>));
10139 -- M : Integer :=...;
10140 -- P : Parameters := (Param1 .. ParamN);
10144 -- if K = Ada.Tags.TK_Limited_Tagged then
10145 -- <dispatching-call>;
10146 -- <triggering-statements>
10150 -- Ada.Tags.Get_Offset_Index
10151 -- (Ada.Tags.Tag (<object>), DT_Position (<dispatching-call>));
10153 -- _Disp_Timed_Select (<object>, S, P'Address, DX, M, C, B);
10155 -- if C = POK_Protected_Entry
10156 -- or else C = POK_Task_Entry
10158 -- Param1 := P.Param1;
10160 -- ParamN := P.ParamN;
10164 -- if C = POK_Procedure
10165 -- or else C = POK_Protected_Procedure
10166 -- or else C = POK_Task_Procedure
10168 -- <dispatching-call>;
10171 -- <triggering-statements>
10173 -- <timed-statements>
10178 procedure Expand_N_Timed_Entry_Call (N : Node_Id) is
10179 Loc : constant Source_Ptr := Sloc (N);
10181 E_Call : Node_Id :=
10182 Entry_Call_Statement (Entry_Call_Alternative (N));
10183 E_Stats : constant List_Id :=
10184 Statements (Entry_Call_Alternative (N));
10185 D_Stat : Node_Id :=
10186 Delay_Statement (Delay_Alternative (N));
10187 D_Stats : constant List_Id :=
10188 Statements (Delay_Alternative (N));
10191 Blk_Typ : Entity_Id;
10193 Call_Ent : Entity_Id;
10194 Conc_Typ_Stmts : List_Id;
10198 D_Type : Entity_Id;
10204 Is_Disp_Select : Boolean;
10205 Lim_Typ_Stmts : List_Id;
10214 B : Entity_Id; -- Call status flag
10215 C : Entity_Id; -- Call kind
10216 D : Entity_Id; -- Delay
10217 K : Entity_Id; -- Tagged kind
10218 M : Entity_Id; -- Delay mode
10219 P : Entity_Id; -- Parameter block
10220 S : Entity_Id; -- Primitive operation slot
10223 -- The arguments in the call may require dynamic allocation, and the
10224 -- call statement may have been transformed into a block. The block
10225 -- may contain additional declarations for internal entities, and the
10226 -- original call is found by sequential search.
10228 if Nkind (E_Call) = N_Block_Statement then
10229 E_Call := First (Statements (Handled_Statement_Sequence (E_Call)));
10230 while not Nkind_In (E_Call, N_Procedure_Call_Statement,
10231 N_Entry_Call_Statement)
10238 Ada_Version >= Ada_05
10239 and then Nkind (E_Call) = N_Procedure_Call_Statement;
10241 if Is_Disp_Select then
10242 Extract_Dispatching_Call (E_Call, Call_Ent, Obj, Actuals, Formals);
10248 -- B : Boolean := False;
10250 B := Build_B (Loc, Decls);
10253 -- C : Ada.Tags.Prim_Op_Kind;
10255 C := Build_C (Loc, Decls);
10257 -- Because the analysis of all statements was disabled, manually
10258 -- analyze the delay statement.
10261 D_Stat := Original_Node (D_Stat);
10264 -- Build an entry call using Simple_Entry_Call
10266 Extract_Entry (E_Call, Concval, Ename, Index);
10267 Build_Simple_Entry_Call (E_Call, Concval, Ename, Index);
10269 Decls := Declarations (E_Call);
10270 Stmts := Statements (Handled_Statement_Sequence (E_Call));
10279 B := Make_Defining_Identifier (Loc, Name_uB);
10282 Make_Object_Declaration (Loc,
10283 Defining_Identifier =>
10285 Object_Definition =>
10286 New_Reference_To (Standard_Boolean, Loc)));
10289 -- Duration and mode processing
10291 D_Type := Base_Type (Etype (Expression (D_Stat)));
10293 -- Use the type of the delay expression (Calendar or Real_Time) to
10294 -- generate the appropriate conversion.
10296 if Nkind (D_Stat) = N_Delay_Relative_Statement then
10297 D_Disc := Make_Integer_Literal (Loc, 0);
10298 D_Conv := Relocate_Node (Expression (D_Stat));
10300 elsif Is_RTE (D_Type, RO_CA_Time) then
10301 D_Disc := Make_Integer_Literal (Loc, 1);
10302 D_Conv := Make_Function_Call (Loc,
10303 New_Reference_To (RTE (RO_CA_To_Duration), Loc),
10304 New_List (New_Copy (Expression (D_Stat))));
10306 else pragma Assert (Is_RTE (D_Type, RO_RT_Time));
10307 D_Disc := Make_Integer_Literal (Loc, 2);
10308 D_Conv := Make_Function_Call (Loc,
10309 New_Reference_To (RTE (RO_RT_To_Duration), Loc),
10310 New_List (New_Copy (Expression (D_Stat))));
10313 D := Make_Defining_Identifier (Loc, New_Internal_Name ('D'));
10319 Make_Object_Declaration (Loc,
10320 Defining_Identifier =>
10322 Object_Definition =>
10323 New_Reference_To (Standard_Duration, Loc)));
10325 M := Make_Defining_Identifier (Loc, New_Internal_Name ('M'));
10328 -- M : Integer := (0 | 1 | 2);
10331 Make_Object_Declaration (Loc,
10332 Defining_Identifier =>
10334 Object_Definition =>
10335 New_Reference_To (Standard_Integer, Loc),
10339 -- Do the assignment at this stage only because the evaluation of the
10340 -- expression must not occur before (see ACVC C97302A).
10343 Make_Assignment_Statement (Loc,
10345 New_Reference_To (D, Loc),
10349 -- Parameter block processing
10351 -- Manually create the parameter block for dispatching calls. In the
10352 -- case of entries, the block has already been created during the call
10353 -- to Build_Simple_Entry_Call.
10355 if Is_Disp_Select then
10357 -- Tagged kind processing, generate:
10358 -- K : Ada.Tags.Tagged_Kind :=
10359 -- Ada.Tags.Get_Tagged_Kind (Ada.Tags.Tag <object>));
10361 K := Build_K (Loc, Decls, Obj);
10363 Blk_Typ := Build_Parameter_Block (Loc, Actuals, Formals, Decls);
10364 P := Parameter_Block_Pack
10365 (Loc, Blk_Typ, Actuals, Formals, Decls, Stmts);
10367 -- Dispatch table slot processing, generate:
10370 S := Build_S (Loc, Decls);
10373 -- S := Ada.Tags.Get_Offset_Index
10374 -- (Ada.Tags.Tag (<object>), DT_Position (Call_Ent));
10377 New_List (Build_S_Assignment (Loc, S, Obj, Call_Ent));
10380 -- _Disp_Timed_Select (<object>, S, P'Address, D, M, C, B);
10382 -- where Obj is the controlling formal parameter, S is the dispatch
10383 -- table slot number of the dispatching operation, P is the wrapped
10384 -- parameter block, D is the duration, M is the duration mode, C is
10385 -- the call kind and B is the call status.
10387 Params := New_List;
10389 Append_To (Params, New_Copy_Tree (Obj));
10390 Append_To (Params, New_Reference_To (S, Loc));
10391 Append_To (Params, Make_Attribute_Reference (Loc,
10392 Prefix => New_Reference_To (P, Loc),
10393 Attribute_Name => Name_Address));
10394 Append_To (Params, New_Reference_To (D, Loc));
10395 Append_To (Params, New_Reference_To (M, Loc));
10396 Append_To (Params, New_Reference_To (C, Loc));
10397 Append_To (Params, New_Reference_To (B, Loc));
10399 Append_To (Conc_Typ_Stmts,
10400 Make_Procedure_Call_Statement (Loc,
10403 Find_Prim_Op (Etype (Etype (Obj)),
10404 Name_uDisp_Timed_Select),
10406 Parameter_Associations =>
10410 -- if C = POK_Protected_Entry
10411 -- or else C = POK_Task_Entry
10413 -- Param1 := P.Param1;
10415 -- ParamN := P.ParamN;
10418 Unpack := Parameter_Block_Unpack (Loc, P, Actuals, Formals);
10420 -- Generate the if statement only when the packed parameters need
10421 -- explicit assignments to their corresponding actuals.
10423 if Present (Unpack) then
10424 Append_To (Conc_Typ_Stmts,
10425 Make_If_Statement (Loc,
10432 New_Reference_To (C, Loc),
10434 New_Reference_To (RTE (
10435 RE_POK_Protected_Entry), Loc)),
10439 New_Reference_To (C, Loc),
10441 New_Reference_To (RTE (RE_POK_Task_Entry), Loc))),
10450 -- if C = POK_Procedure
10451 -- or else C = POK_Protected_Procedure
10452 -- or else C = POK_Task_Procedure
10454 -- <dispatching-call>
10456 -- <triggering-statements>
10458 -- <timed-statements>
10461 N_Stats := New_Copy_List_Tree (E_Stats);
10463 Prepend_To (N_Stats,
10464 Make_If_Statement (Loc,
10471 New_Reference_To (C, Loc),
10473 New_Reference_To (RTE (RE_POK_Procedure), Loc)),
10479 New_Reference_To (C, Loc),
10481 New_Reference_To (RTE (
10482 RE_POK_Protected_Procedure), Loc)),
10486 New_Reference_To (C, Loc),
10488 New_Reference_To (RTE (
10489 RE_POK_Task_Procedure), Loc)))),
10492 New_List (E_Call)));
10494 Append_To (Conc_Typ_Stmts,
10495 Make_If_Statement (Loc,
10496 Condition => New_Reference_To (B, Loc),
10497 Then_Statements => N_Stats,
10498 Else_Statements => D_Stats));
10501 -- <dispatching-call>;
10502 -- <triggering-statements>
10504 Lim_Typ_Stmts := New_Copy_List_Tree (E_Stats);
10505 Prepend_To (Lim_Typ_Stmts, New_Copy_Tree (E_Call));
10508 -- if K = Ada.Tags.TK_Limited_Tagged then
10515 Make_If_Statement (Loc,
10519 New_Reference_To (K, Loc),
10521 New_Reference_To (RTE (RE_TK_Limited_Tagged), Loc)),
10530 -- Skip assignments to temporaries created for in-out parameters.
10531 -- This makes unwarranted assumptions about the shape of the expanded
10532 -- tree for the call, and should be cleaned up ???
10534 Stmt := First (Stmts);
10535 while Nkind (Stmt) /= N_Procedure_Call_Statement loop
10539 -- Do the assignment at this stage only because the evaluation
10540 -- of the expression must not occur before (see ACVC C97302A).
10542 Insert_Before (Stmt,
10543 Make_Assignment_Statement (Loc,
10544 Name => New_Reference_To (D, Loc),
10545 Expression => D_Conv));
10548 Params := Parameter_Associations (Call);
10550 -- For a protected type, we build a Timed_Protected_Entry_Call
10552 if Is_Protected_Type (Etype (Concval)) then
10554 -- Create a new call statement
10556 Param := First (Params);
10557 while Present (Param)
10558 and then not Is_RTE (Etype (Param), RE_Call_Modes)
10563 Dummy := Remove_Next (Next (Param));
10565 -- Remove garbage is following the Cancel_Param if present
10567 Dummy := Next (Param);
10569 -- Remove the mode of the Protected_Entry_Call call, then remove
10570 -- the Communication_Block of the Protected_Entry_Call call, and
10571 -- finally add Duration and a Delay_Mode parameter
10573 pragma Assert (Present (Param));
10574 Rewrite (Param, New_Reference_To (D, Loc));
10576 Rewrite (Dummy, New_Reference_To (M, Loc));
10578 -- Add a Boolean flag for successful entry call
10580 Append_To (Params, New_Reference_To (B, Loc));
10582 case Corresponding_Runtime_Package (Etype (Concval)) is
10583 when System_Tasking_Protected_Objects_Entries =>
10585 Make_Procedure_Call_Statement (Loc,
10588 (RTE (RE_Timed_Protected_Entry_Call), Loc),
10589 Parameter_Associations => Params));
10591 when System_Tasking_Protected_Objects_Single_Entry =>
10592 Param := First (Params);
10593 while Present (Param)
10595 Is_RTE (Etype (Param), RE_Protected_Entry_Index)
10603 Make_Procedure_Call_Statement (Loc,
10604 Name => New_Reference_To (
10605 RTE (RE_Timed_Protected_Single_Entry_Call), Loc),
10606 Parameter_Associations => Params));
10609 raise Program_Error;
10612 -- For the task case, build a Timed_Task_Entry_Call
10615 -- Create a new call statement
10617 Append_To (Params, New_Reference_To (D, Loc));
10618 Append_To (Params, New_Reference_To (M, Loc));
10619 Append_To (Params, New_Reference_To (B, Loc));
10622 Make_Procedure_Call_Statement (Loc,
10624 New_Reference_To (RTE (RE_Timed_Task_Entry_Call), Loc),
10625 Parameter_Associations => Params));
10629 Make_Implicit_If_Statement (N,
10630 Condition => New_Reference_To (B, Loc),
10631 Then_Statements => E_Stats,
10632 Else_Statements => D_Stats));
10636 Make_Block_Statement (Loc,
10637 Declarations => Decls,
10638 Handled_Statement_Sequence =>
10639 Make_Handled_Sequence_Of_Statements (Loc, Stmts)));
10642 end Expand_N_Timed_Entry_Call;
10644 ----------------------------------------
10645 -- Expand_Protected_Body_Declarations --
10646 ----------------------------------------
10648 procedure Expand_Protected_Body_Declarations
10650 Spec_Id : Entity_Id)
10653 if No_Run_Time_Mode then
10654 Error_Msg_CRT ("protected body", N);
10657 elsif Expander_Active then
10659 -- Associate discriminals with the first subprogram or entry body to
10662 if Present (First_Protected_Operation (Declarations (N))) then
10663 Set_Discriminals (Parent (Spec_Id));
10666 end Expand_Protected_Body_Declarations;
10668 -------------------------
10669 -- External_Subprogram --
10670 -------------------------
10672 function External_Subprogram (E : Entity_Id) return Entity_Id is
10673 Subp : constant Entity_Id := Protected_Body_Subprogram (E);
10676 -- The internal and external subprograms follow each other on the entity
10677 -- chain. Note that previously private operations had no separate
10678 -- external subprogram. We now create one in all cases, because a
10679 -- private operation may actually appear in an external call, through
10680 -- a 'Access reference used for a callback.
10682 -- If the operation is a function that returns an anonymous access type,
10683 -- the corresponding itype appears before the operation, and must be
10686 -- This mechanism is fragile, there should be a real link between the
10687 -- two versions of the operation, but there is no place to put it ???
10689 if Is_Access_Type (Next_Entity (Subp)) then
10690 return Next_Entity (Next_Entity (Subp));
10692 return Next_Entity (Subp);
10694 end External_Subprogram;
10696 ------------------------------
10697 -- Extract_Dispatching_Call --
10698 ------------------------------
10700 procedure Extract_Dispatching_Call
10702 Call_Ent : out Entity_Id;
10703 Object : out Entity_Id;
10704 Actuals : out List_Id;
10705 Formals : out List_Id)
10707 Call_Nam : Node_Id;
10710 pragma Assert (Nkind (N) = N_Procedure_Call_Statement);
10712 if Present (Original_Node (N)) then
10713 Call_Nam := Name (Original_Node (N));
10715 Call_Nam := Name (N);
10718 -- Retrieve the name of the dispatching procedure. It contains the
10719 -- dispatch table slot number.
10722 case Nkind (Call_Nam) is
10723 when N_Identifier =>
10726 when N_Selected_Component =>
10727 Call_Nam := Selector_Name (Call_Nam);
10730 raise Program_Error;
10735 Actuals := Parameter_Associations (N);
10736 Call_Ent := Entity (Call_Nam);
10737 Formals := Parameter_Specifications (Parent (Call_Ent));
10738 Object := First (Actuals);
10740 if Present (Original_Node (Object)) then
10741 Object := Original_Node (Object);
10743 end Extract_Dispatching_Call;
10745 -------------------
10746 -- Extract_Entry --
10747 -------------------
10749 procedure Extract_Entry
10751 Concval : out Node_Id;
10752 Ename : out Node_Id;
10753 Index : out Node_Id)
10755 Nam : constant Node_Id := Name (N);
10758 -- For a simple entry, the name is a selected component, with the
10759 -- prefix being the task value, and the selector being the entry.
10761 if Nkind (Nam) = N_Selected_Component then
10762 Concval := Prefix (Nam);
10763 Ename := Selector_Name (Nam);
10766 -- For a member of an entry family, the name is an indexed component
10767 -- where the prefix is a selected component, whose prefix in turn is
10768 -- the task value, and whose selector is the entry family. The single
10769 -- expression in the expressions list of the indexed component is the
10770 -- subscript for the family.
10772 else pragma Assert (Nkind (Nam) = N_Indexed_Component);
10773 Concval := Prefix (Prefix (Nam));
10774 Ename := Selector_Name (Prefix (Nam));
10775 Index := First (Expressions (Nam));
10779 -------------------
10780 -- Family_Offset --
10781 -------------------
10783 function Family_Offset
10788 Cap : Boolean) return Node_Id
10794 function Convert_Discriminant_Ref (Bound : Node_Id) return Node_Id;
10795 -- If one of the bounds is a reference to a discriminant, replace with
10796 -- corresponding discriminal of type. Within the body of a task retrieve
10797 -- the renamed discriminant by simple visibility, using its generated
10798 -- name. Within a protected object, find the original discriminant and
10799 -- replace it with the discriminal of the current protected operation.
10801 ------------------------------
10802 -- Convert_Discriminant_Ref --
10803 ------------------------------
10805 function Convert_Discriminant_Ref (Bound : Node_Id) return Node_Id is
10806 Loc : constant Source_Ptr := Sloc (Bound);
10811 if Is_Entity_Name (Bound)
10812 and then Ekind (Entity (Bound)) = E_Discriminant
10814 if Is_Task_Type (Ttyp)
10815 and then Has_Completion (Ttyp)
10817 B := Make_Identifier (Loc, Chars (Entity (Bound)));
10818 Find_Direct_Name (B);
10820 elsif Is_Protected_Type (Ttyp) then
10821 D := First_Discriminant (Ttyp);
10822 while Chars (D) /= Chars (Entity (Bound)) loop
10823 Next_Discriminant (D);
10826 B := New_Reference_To (Discriminal (D), Loc);
10829 B := New_Reference_To (Discriminal (Entity (Bound)), Loc);
10832 elsif Nkind (Bound) = N_Attribute_Reference then
10836 B := New_Copy_Tree (Bound);
10840 Make_Attribute_Reference (Loc,
10841 Attribute_Name => Name_Pos,
10842 Prefix => New_Occurrence_Of (Etype (Bound), Loc),
10843 Expressions => New_List (B));
10844 end Convert_Discriminant_Ref;
10846 -- Start of processing for Family_Offset
10849 Real_Hi := Convert_Discriminant_Ref (Hi);
10850 Real_Lo := Convert_Discriminant_Ref (Lo);
10853 if Is_Task_Type (Ttyp) then
10854 Ityp := RTE (RE_Task_Entry_Index);
10856 Ityp := RTE (RE_Protected_Entry_Index);
10860 Make_Attribute_Reference (Loc,
10861 Prefix => New_Reference_To (Ityp, Loc),
10862 Attribute_Name => Name_Min,
10863 Expressions => New_List (
10865 Make_Integer_Literal (Loc, Entry_Family_Bound - 1)));
10868 Make_Attribute_Reference (Loc,
10869 Prefix => New_Reference_To (Ityp, Loc),
10870 Attribute_Name => Name_Max,
10871 Expressions => New_List (
10873 Make_Integer_Literal (Loc, -Entry_Family_Bound)));
10876 return Make_Op_Subtract (Loc, Real_Hi, Real_Lo);
10883 function Family_Size
10888 Cap : Boolean) return Node_Id
10893 if Is_Task_Type (Ttyp) then
10894 Ityp := RTE (RE_Task_Entry_Index);
10896 Ityp := RTE (RE_Protected_Entry_Index);
10900 Make_Attribute_Reference (Loc,
10901 Prefix => New_Reference_To (Ityp, Loc),
10902 Attribute_Name => Name_Max,
10903 Expressions => New_List (
10906 Family_Offset (Loc, Hi, Lo, Ttyp, Cap),
10908 Make_Integer_Literal (Loc, 1)),
10909 Make_Integer_Literal (Loc, 0)));
10912 -----------------------------------
10913 -- Find_Task_Or_Protected_Pragma --
10914 -----------------------------------
10916 function Find_Task_Or_Protected_Pragma
10918 P : Name_Id) return Node_Id
10923 N := First (Visible_Declarations (T));
10924 while Present (N) loop
10925 if Nkind (N) = N_Pragma then
10926 if Pragma_Name (N) = P then
10929 elsif P = Name_Priority
10930 and then Pragma_Name (N) = Name_Interrupt_Priority
10943 N := First (Private_Declarations (T));
10944 while Present (N) loop
10945 if Nkind (N) = N_Pragma then
10946 if Pragma_Name (N) = P then
10949 elsif P = Name_Priority
10950 and then Pragma_Name (N) = Name_Interrupt_Priority
10963 raise Program_Error;
10964 end Find_Task_Or_Protected_Pragma;
10966 -------------------------------
10967 -- First_Protected_Operation --
10968 -------------------------------
10970 function First_Protected_Operation (D : List_Id) return Node_Id is
10971 First_Op : Node_Id;
10974 First_Op := First (D);
10975 while Present (First_Op)
10976 and then not Nkind_In (First_Op, N_Subprogram_Body, N_Entry_Body)
10982 end First_Protected_Operation;
10984 ---------------------------------------
10985 -- Install_Private_Data_Declarations --
10986 ---------------------------------------
10988 procedure Install_Private_Data_Declarations
10990 Spec_Id : Entity_Id;
10991 Conc_Typ : Entity_Id;
10992 Body_Nod : Node_Id;
10994 Barrier : Boolean := False;
10995 Family : Boolean := False)
10997 Is_Protected : constant Boolean := Is_Protected_Type (Conc_Typ);
11000 Insert_Node : Node_Id := Empty;
11001 Obj_Ent : Entity_Id;
11003 procedure Add (Decl : Node_Id);
11004 -- Add a single declaration after Insert_Node. If this is the first
11005 -- addition, Decl is added to the front of Decls and it becomes the
11008 function Replace_Bound (Bound : Node_Id) return Node_Id;
11009 -- The bounds of an entry index may depend on discriminants, create a
11010 -- reference to the corresponding prival. Otherwise return a duplicate
11011 -- of the original bound.
11017 procedure Add (Decl : Node_Id) is
11019 if No (Insert_Node) then
11020 Prepend_To (Decls, Decl);
11022 Insert_After (Insert_Node, Decl);
11025 Insert_Node := Decl;
11028 --------------------------
11029 -- Replace_Discriminant --
11030 --------------------------
11032 function Replace_Bound (Bound : Node_Id) return Node_Id is
11034 if Nkind (Bound) = N_Identifier
11035 and then Is_Discriminal (Entity (Bound))
11037 return Make_Identifier (Loc, Chars (Entity (Bound)));
11039 return Duplicate_Subexpr (Bound);
11043 -- Start of processing for Install_Private_Data_Declarations
11046 -- Step 1: Retrieve the concurrent object entity. Obj_Ent can denote
11047 -- formal parameter _O, _object or _task depending on the context.
11049 Obj_Ent := Concurrent_Object (Spec_Id, Conc_Typ);
11051 -- Special processing of _O for barrier functions, protected entries
11058 (Ekind (Spec_Id) = E_Entry
11059 or else Ekind (Spec_Id) = E_Entry_Family))
11062 Conc_Rec : constant Entity_Id :=
11063 Corresponding_Record_Type (Conc_Typ);
11064 Typ_Id : constant Entity_Id :=
11065 Make_Defining_Identifier (Loc,
11066 New_External_Name (Chars (Conc_Rec), 'P'));
11069 -- type prot_typVP is access prot_typV;
11072 Make_Full_Type_Declaration (Loc,
11073 Defining_Identifier => Typ_Id,
11075 Make_Access_To_Object_Definition (Loc,
11076 Subtype_Indication =>
11077 New_Reference_To (Conc_Rec, Loc)));
11081 -- _object : prot_typVP := prot_typV (_O);
11084 Make_Object_Declaration (Loc,
11085 Defining_Identifier =>
11086 Make_Defining_Identifier (Loc, Name_uObject),
11087 Object_Definition => New_Reference_To (Typ_Id, Loc),
11089 Unchecked_Convert_To (Typ_Id,
11090 New_Reference_To (Obj_Ent, Loc)));
11093 -- Set the reference to the concurrent object
11095 Obj_Ent := Defining_Identifier (Decl);
11099 -- Step 2: Create the Protection object and build its declaration for
11100 -- any protected entry (family) of subprogram.
11102 if Is_Protected then
11104 Prot_Ent : constant Entity_Id :=
11105 Make_Defining_Identifier (Loc,
11106 New_Internal_Name ('R'));
11110 Set_Protection_Object (Spec_Id, Prot_Ent);
11112 -- Determine the proper protection type
11114 if Has_Attach_Handler (Conc_Typ)
11115 and then not Restricted_Profile
11117 Prot_Typ := RE_Static_Interrupt_Protection;
11119 elsif Has_Interrupt_Handler (Conc_Typ) then
11120 Prot_Typ := RE_Dynamic_Interrupt_Protection;
11122 -- The type has explicit entries or generated primitive entry
11125 elsif Has_Entries (Conc_Typ)
11127 (Ada_Version >= Ada_05
11128 and then Present (Interface_List (Parent (Conc_Typ))))
11130 case Corresponding_Runtime_Package (Conc_Typ) is
11131 when System_Tasking_Protected_Objects_Entries =>
11132 Prot_Typ := RE_Protection_Entries;
11134 when System_Tasking_Protected_Objects_Single_Entry =>
11135 Prot_Typ := RE_Protection_Entry;
11138 raise Program_Error;
11142 Prot_Typ := RE_Protection;
11146 -- conc_typR : protection_typ renames _object._object;
11149 Make_Object_Renaming_Declaration (Loc,
11150 Defining_Identifier => Prot_Ent,
11152 New_Reference_To (RTE (Prot_Typ), Loc),
11154 Make_Selected_Component (Loc,
11156 New_Reference_To (Obj_Ent, Loc),
11158 Make_Identifier (Loc, Name_uObject)));
11163 -- Step 3: Add discriminant renamings (if any)
11165 if Has_Discriminants (Conc_Typ) then
11170 D := First_Discriminant (Conc_Typ);
11171 while Present (D) loop
11173 -- Adjust the source location
11175 Set_Sloc (Discriminal (D), Loc);
11178 -- discr_name : discr_typ renames _object.discr_name;
11180 -- discr_name : discr_typ renames _task.discr_name;
11183 Make_Object_Renaming_Declaration (Loc,
11184 Defining_Identifier => Discriminal (D),
11185 Subtype_Mark => New_Reference_To (Etype (D), Loc),
11187 Make_Selected_Component (Loc,
11188 Prefix => New_Reference_To (Obj_Ent, Loc),
11189 Selector_Name => Make_Identifier (Loc, Chars (D))));
11192 Next_Discriminant (D);
11197 -- Step 4: Add private component renamings (if any)
11199 if Is_Protected then
11200 Def := Protected_Definition (Parent (Conc_Typ));
11202 if Present (Private_Declarations (Def)) then
11205 Comp_Id : Entity_Id;
11206 Decl_Id : Entity_Id;
11209 Comp := First (Private_Declarations (Def));
11210 while Present (Comp) loop
11211 if Nkind (Comp) = N_Component_Declaration then
11212 Comp_Id := Defining_Identifier (Comp);
11214 Make_Defining_Identifier (Loc, Chars (Comp_Id));
11216 -- Minimal decoration
11218 if Ekind (Spec_Id) = E_Function then
11219 Set_Ekind (Decl_Id, E_Constant);
11221 Set_Ekind (Decl_Id, E_Variable);
11224 Set_Prival (Comp_Id, Decl_Id);
11225 Set_Prival_Link (Decl_Id, Comp_Id);
11226 Set_Is_Aliased (Decl_Id, Is_Aliased (Comp_Id));
11229 -- comp_name : comp_typ renames _object.comp_name;
11232 Make_Object_Renaming_Declaration (Loc,
11233 Defining_Identifier => Decl_Id,
11235 New_Reference_To (Etype (Comp_Id), Loc),
11237 Make_Selected_Component (Loc,
11239 New_Reference_To (Obj_Ent, Loc),
11241 Make_Identifier (Loc, Chars (Comp_Id))));
11251 -- Step 5: Add the declaration of the entry index and the associated
11252 -- type for barrier functions and entry families.
11254 if (Barrier and then Family)
11255 or else Ekind (Spec_Id) = E_Entry_Family
11258 E : constant Entity_Id := Index_Object (Spec_Id);
11259 Index : constant Entity_Id :=
11260 Defining_Identifier (
11261 Entry_Index_Specification (
11262 Entry_Body_Formal_Part (Body_Nod)));
11263 Index_Con : constant Entity_Id :=
11264 Make_Defining_Identifier (Loc, Chars (Index));
11266 Index_Typ : Entity_Id;
11270 -- Minimal decoration
11272 Set_Ekind (Index_Con, E_Constant);
11273 Set_Entry_Index_Constant (Index, Index_Con);
11274 Set_Discriminal_Link (Index_Con, Index);
11276 -- Retrieve the bounds of the entry family
11278 High := Type_High_Bound (Etype (Index));
11279 Low := Type_Low_Bound (Etype (Index));
11281 -- In the simple case the entry family is given by a subtype
11282 -- mark and the index constant has the same type.
11284 if Is_Entity_Name (Original_Node (
11285 Discrete_Subtype_Definition (Parent (Index))))
11287 Index_Typ := Etype (Index);
11289 -- Otherwise a new subtype declaration is required
11292 High := Replace_Bound (High);
11293 Low := Replace_Bound (Low);
11296 Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
11299 -- subtype Jnn is <Etype of Index> range Low .. High;
11302 Make_Subtype_Declaration (Loc,
11303 Defining_Identifier => Index_Typ,
11304 Subtype_Indication =>
11305 Make_Subtype_Indication (Loc,
11307 New_Reference_To (Base_Type (Etype (Index)), Loc),
11309 Make_Range_Constraint (Loc,
11310 Range_Expression =>
11311 Make_Range (Loc, Low, High))));
11315 Set_Etype (Index_Con, Index_Typ);
11317 -- Create the object which designates the index:
11318 -- J : constant Jnn :=
11319 -- Jnn'Val (_E - <index expr> + Jnn'Pos (Jnn'First));
11321 -- where Jnn is the subtype created above or the original type of
11322 -- the index, _E is a formal of the protected body subprogram and
11323 -- <index expr> is the index of the first family member.
11326 Make_Object_Declaration (Loc,
11327 Defining_Identifier => Index_Con,
11328 Constant_Present => True,
11329 Object_Definition =>
11330 New_Reference_To (Index_Typ, Loc),
11333 Make_Attribute_Reference (Loc,
11335 New_Reference_To (Index_Typ, Loc),
11336 Attribute_Name => Name_Val,
11338 Expressions => New_List (
11342 Make_Op_Subtract (Loc,
11344 New_Reference_To (E, Loc),
11346 Entry_Index_Expression (Loc,
11347 Defining_Identifier (Body_Nod),
11351 Make_Attribute_Reference (Loc,
11353 New_Reference_To (Index_Typ, Loc),
11354 Attribute_Name => Name_Pos,
11355 Expressions => New_List (
11356 Make_Attribute_Reference (Loc,
11358 New_Reference_To (Index_Typ, Loc),
11359 Attribute_Name => Name_First)))))));
11363 end Install_Private_Data_Declarations;
11365 ---------------------------------
11366 -- Is_Potentially_Large_Family --
11367 ---------------------------------
11369 function Is_Potentially_Large_Family
11370 (Base_Index : Entity_Id;
11371 Conctyp : Entity_Id;
11373 Hi : Node_Id) return Boolean
11376 return Scope (Base_Index) = Standard_Standard
11377 and then Base_Index = Base_Type (Standard_Integer)
11378 and then Has_Discriminants (Conctyp)
11380 (Discriminant_Default_Value (First_Discriminant (Conctyp)))
11382 (Denotes_Discriminant (Lo, True)
11383 or else Denotes_Discriminant (Hi, True));
11384 end Is_Potentially_Large_Family;
11386 -------------------------------------
11387 -- Is_Private_Primitive_Subprogram --
11388 -------------------------------------
11390 function Is_Private_Primitive_Subprogram (Id : Entity_Id) return Boolean is
11393 (Ekind (Id) = E_Function or else Ekind (Id) = E_Procedure)
11394 and then Is_Private_Primitive (Id);
11395 end Is_Private_Primitive_Subprogram;
11401 function Index_Object (Spec_Id : Entity_Id) return Entity_Id is
11402 Bod_Subp : constant Entity_Id := Protected_Body_Subprogram (Spec_Id);
11403 Formal : Entity_Id;
11406 Formal := First_Formal (Bod_Subp);
11407 while Present (Formal) loop
11409 -- Look for formal parameter _E
11411 if Chars (Formal) = Name_uE then
11415 Next_Formal (Formal);
11418 -- A protected body subprogram should always have the parameter in
11421 raise Program_Error;
11424 --------------------------------
11425 -- Make_Initialize_Protection --
11426 --------------------------------
11428 function Make_Initialize_Protection
11429 (Protect_Rec : Entity_Id) return List_Id
11431 Loc : constant Source_Ptr := Sloc (Protect_Rec);
11435 Ptyp : constant Node_Id :=
11436 Corresponding_Concurrent_Type (Protect_Rec);
11438 L : constant List_Id := New_List;
11439 Has_Entry : constant Boolean := Has_Entries (Ptyp);
11440 Restricted : constant Boolean := Restricted_Profile;
11443 -- We may need two calls to properly initialize the object, one to
11444 -- Initialize_Protection, and possibly one to Install_Handlers if we
11445 -- have a pragma Attach_Handler.
11447 -- Get protected declaration. In the case of a task type declaration,
11448 -- this is simply the parent of the protected type entity. In the single
11449 -- protected object declaration, this parent will be the implicit type,
11450 -- and we can find the corresponding single protected object declaration
11451 -- by searching forward in the declaration list in the tree.
11453 -- Is the test for N_Single_Protected_Declaration needed here??? Nodes
11454 -- of this type should have been removed during semantic analysis.
11456 Pdec := Parent (Ptyp);
11457 while not Nkind_In (Pdec, N_Protected_Type_Declaration,
11458 N_Single_Protected_Declaration)
11463 -- Now we can find the object definition from this declaration
11465 Pdef := Protected_Definition (Pdec);
11467 -- Build the parameter list for the call. Note that _Init is the name
11468 -- of the formal for the object to be initialized, which is the task
11469 -- value record itself.
11473 -- Object parameter. This is a pointer to the object of type
11474 -- Protection used by the GNARL to control the protected object.
11477 Make_Attribute_Reference (Loc,
11479 Make_Selected_Component (Loc,
11480 Prefix => Make_Identifier (Loc, Name_uInit),
11481 Selector_Name => Make_Identifier (Loc, Name_uObject)),
11482 Attribute_Name => Name_Unchecked_Access));
11484 -- Priority parameter. Set to Unspecified_Priority unless there is a
11485 -- priority pragma, in which case we take the value from the pragma,
11486 -- or there is an interrupt pragma and no priority pragma, and we
11487 -- set the ceiling to Interrupt_Priority'Last, an implementation-
11488 -- defined value, see D.3(10).
11491 and then Has_Priority_Pragma (Pdef)
11494 Prio : constant Node_Id :=
11497 (Pragma_Argument_Associations
11498 (Find_Task_Or_Protected_Pragma
11499 (Pdef, Name_Priority))));
11503 -- If priority is a static expression, then we can duplicate it
11504 -- with no problem and simply append it to the argument list.
11506 if Is_Static_Expression (Prio) then
11508 Duplicate_Subexpr_No_Checks (Prio));
11510 -- Otherwise, the priority may be a per-object expression, if it
11511 -- depends on a discriminant of the type. In this case, create
11512 -- local variable to capture the expression. Note that it is
11513 -- really necessary to create this variable explicitly. It might
11514 -- be thought that removing side effects would the appropriate
11515 -- approach, but that could generate declarations improperly
11516 -- placed in the enclosing scope.
11518 -- Note: Use System.Any_Priority as the expected type for the
11519 -- non-static priority expression, in case the expression has not
11520 -- been analyzed yet (as occurs for example with pragma
11521 -- Interrupt_Priority).
11525 Make_Defining_Identifier (Loc, New_Internal_Name ('R'));
11528 Make_Object_Declaration (Loc,
11529 Defining_Identifier => Temp,
11530 Object_Definition =>
11531 New_Occurrence_Of (RTE (RE_Any_Priority), Loc),
11532 Expression => Relocate_Node (Prio)));
11534 Append_To (Args, New_Occurrence_Of (Temp, Loc));
11538 -- When no priority is specified but an xx_Handler pragma is, we default
11539 -- to System.Interrupts.Default_Interrupt_Priority, see D.3(10).
11541 elsif Has_Interrupt_Handler (Ptyp)
11542 or else Has_Attach_Handler (Ptyp)
11545 New_Reference_To (RTE (RE_Default_Interrupt_Priority), Loc));
11547 -- Normal case, no priority or xx_Handler specified, default priority
11551 New_Reference_To (RTE (RE_Unspecified_Priority), Loc));
11554 -- Test for Compiler_Info parameter. This parameter allows entry body
11555 -- procedures and barrier functions to be called from the runtime. It
11556 -- is a pointer to the record generated by the compiler to represent
11557 -- the protected object.
11560 or else Has_Interrupt_Handler (Ptyp)
11561 or else Has_Attach_Handler (Ptyp)
11562 or else Has_Interfaces (Protect_Rec)
11565 Pkg_Id : constant RTU_Id :=
11566 Corresponding_Runtime_Package (Ptyp);
11567 Called_Subp : RE_Id;
11571 when System_Tasking_Protected_Objects_Entries =>
11572 Called_Subp := RE_Initialize_Protection_Entries;
11574 when System_Tasking_Protected_Objects =>
11575 Called_Subp := RE_Initialize_Protection;
11577 when System_Tasking_Protected_Objects_Single_Entry =>
11578 Called_Subp := RE_Initialize_Protection_Entry;
11581 raise Program_Error;
11584 if Has_Entry or else not Restricted then
11586 Make_Attribute_Reference (Loc,
11587 Prefix => Make_Identifier (Loc, Name_uInit),
11588 Attribute_Name => Name_Address));
11591 -- Entry_Bodies parameter. This is a pointer to an array of
11592 -- pointers to the entry body procedures and barrier functions of
11593 -- the object. If the protected type has no entries this object
11594 -- will not exist, in this case, pass a null.
11597 P_Arr := Entry_Bodies_Array (Ptyp);
11600 Make_Attribute_Reference (Loc,
11601 Prefix => New_Reference_To (P_Arr, Loc),
11602 Attribute_Name => Name_Unrestricted_Access));
11604 if Pkg_Id = System_Tasking_Protected_Objects_Entries then
11606 -- Find index mapping function (clumsy but ok for now)
11608 while Ekind (P_Arr) /= E_Function loop
11609 Next_Entity (P_Arr);
11613 Make_Attribute_Reference (Loc,
11615 New_Reference_To (P_Arr, Loc),
11616 Attribute_Name => Name_Unrestricted_Access));
11618 -- Build_Entry_Names generation flag. When set to true, the
11619 -- runtime will allocate an array to hold the string names
11620 -- of protected entries.
11622 if not Restricted_Profile then
11623 if Entry_Names_OK then
11625 New_Reference_To (Standard_True, Loc));
11628 New_Reference_To (Standard_False, Loc));
11633 elsif Pkg_Id = System_Tasking_Protected_Objects_Single_Entry then
11634 Append_To (Args, Make_Null (Loc));
11636 elsif Pkg_Id = System_Tasking_Protected_Objects_Entries then
11637 Append_To (Args, Make_Null (Loc));
11638 Append_To (Args, Make_Null (Loc));
11639 Append_To (Args, New_Reference_To (Standard_False, Loc));
11643 Make_Procedure_Call_Statement (Loc,
11644 Name => New_Reference_To (RTE (Called_Subp), Loc),
11645 Parameter_Associations => Args));
11649 Make_Procedure_Call_Statement (Loc,
11650 Name => New_Reference_To (RTE (RE_Initialize_Protection), Loc),
11651 Parameter_Associations => Args));
11654 if Has_Attach_Handler (Ptyp) then
11656 -- We have a list of N Attach_Handler (ProcI, ExprI), and we have to
11657 -- make the following call:
11659 -- Install_Handlers (_object,
11660 -- ((Expr1, Proc1'access), ...., (ExprN, ProcN'access));
11662 -- or, in the case of Ravenscar:
11664 -- Install_Restricted_Handlers
11665 -- ((Expr1, Proc1'access), ...., (ExprN, ProcN'access));
11668 Args : constant List_Id := New_List;
11669 Table : constant List_Id := New_List;
11670 Ritem : Node_Id := First_Rep_Item (Ptyp);
11673 -- Build the Attach_Handler table argument
11675 while Present (Ritem) loop
11676 if Nkind (Ritem) = N_Pragma
11677 and then Pragma_Name (Ritem) = Name_Attach_Handler
11680 Handler : constant Node_Id :=
11681 First (Pragma_Argument_Associations (Ritem));
11683 Interrupt : constant Node_Id := Next (Handler);
11684 Expr : constant Node_Id := Expression (Interrupt);
11688 Make_Aggregate (Loc, Expressions => New_List (
11689 Unchecked_Convert_To
11690 (RTE (RE_System_Interrupt_Id), Expr),
11691 Make_Attribute_Reference (Loc,
11692 Prefix => Make_Selected_Component (Loc,
11693 Make_Identifier (Loc, Name_uInit),
11694 Duplicate_Subexpr_No_Checks
11695 (Expression (Handler))),
11696 Attribute_Name => Name_Access))));
11700 Next_Rep_Item (Ritem);
11703 -- Append the table argument we just built
11705 Append_To (Args, Make_Aggregate (Loc, Table));
11707 -- Append the Install_Handlers (or Install_Restricted_Handlers)
11708 -- call to the statements.
11711 -- Call a simplified version of Install_Handlers to be used
11712 -- when the Ravenscar restrictions are in effect
11713 -- (Install_Restricted_Handlers).
11716 Make_Procedure_Call_Statement (Loc,
11719 (RTE (RE_Install_Restricted_Handlers), Loc),
11720 Parameter_Associations => Args));
11723 -- First, prepends the _object argument
11726 Make_Attribute_Reference (Loc,
11728 Make_Selected_Component (Loc,
11729 Prefix => Make_Identifier (Loc, Name_uInit),
11730 Selector_Name => Make_Identifier (Loc, Name_uObject)),
11731 Attribute_Name => Name_Unchecked_Access));
11733 -- Then, insert call to Install_Handlers
11736 Make_Procedure_Call_Statement (Loc,
11737 Name => New_Reference_To (RTE (RE_Install_Handlers), Loc),
11738 Parameter_Associations => Args));
11744 end Make_Initialize_Protection;
11746 ---------------------------
11747 -- Make_Task_Create_Call --
11748 ---------------------------
11750 function Make_Task_Create_Call (Task_Rec : Entity_Id) return Node_Id is
11751 Loc : constant Source_Ptr := Sloc (Task_Rec);
11761 Ttyp := Corresponding_Concurrent_Type (Task_Rec);
11762 Tnam := Chars (Ttyp);
11764 -- Get task declaration. In the case of a task type declaration, this is
11765 -- simply the parent of the task type entity. In the single task
11766 -- declaration, this parent will be the implicit type, and we can find
11767 -- the corresponding single task declaration by searching forward in the
11768 -- declaration list in the tree.
11770 -- Is the test for N_Single_Task_Declaration needed here??? Nodes of
11771 -- this type should have been removed during semantic analysis.
11773 Tdec := Parent (Ttyp);
11774 while not Nkind_In (Tdec, N_Task_Type_Declaration,
11775 N_Single_Task_Declaration)
11780 -- Now we can find the task definition from this declaration
11782 Tdef := Task_Definition (Tdec);
11784 -- Build the parameter list for the call. Note that _Init is the name
11785 -- of the formal for the object to be initialized, which is the task
11786 -- value record itself.
11790 -- Priority parameter. Set to Unspecified_Priority unless there is a
11791 -- priority pragma, in which case we take the value from the pragma.
11793 if Present (Tdef) and then Has_Priority_Pragma (Tdef) then
11795 Make_Selected_Component (Loc,
11796 Prefix => Make_Identifier (Loc, Name_uInit),
11797 Selector_Name => Make_Identifier (Loc, Name_uPriority)));
11800 New_Reference_To (RTE (RE_Unspecified_Priority), Loc));
11803 -- Optional Stack parameter
11805 if Restricted_Profile then
11807 -- If the stack has been preallocated by the expander then
11808 -- pass its address. Otherwise, pass a null address.
11810 if Preallocated_Stacks_On_Target then
11812 Make_Attribute_Reference (Loc,
11813 Prefix => Make_Selected_Component (Loc,
11814 Prefix => Make_Identifier (Loc, Name_uInit),
11816 Make_Identifier (Loc, Name_uStack)),
11817 Attribute_Name => Name_Address));
11821 New_Reference_To (RTE (RE_Null_Address), Loc));
11825 -- Size parameter. If no Storage_Size pragma is present, then
11826 -- the size is taken from the taskZ variable for the type, which
11827 -- is either Unspecified_Size, or has been reset by the use of
11828 -- a Storage_Size attribute definition clause. If a pragma is
11829 -- present, then the size is taken from the _Size field of the
11830 -- task value record, which was set from the pragma value.
11833 and then Has_Storage_Size_Pragma (Tdef)
11836 Make_Selected_Component (Loc,
11837 Prefix => Make_Identifier (Loc, Name_uInit),
11838 Selector_Name => Make_Identifier (Loc, Name_uSize)));
11842 New_Reference_To (Storage_Size_Variable (Ttyp), Loc));
11845 -- Task_Info parameter. Set to Unspecified_Task_Info unless there is a
11846 -- Task_Info pragma, in which case we take the value from the pragma.
11849 and then Has_Task_Info_Pragma (Tdef)
11852 Make_Selected_Component (Loc,
11853 Prefix => Make_Identifier (Loc, Name_uInit),
11854 Selector_Name => Make_Identifier (Loc, Name_uTask_Info)));
11858 New_Reference_To (RTE (RE_Unspecified_Task_Info), Loc));
11861 if not Restricted_Profile then
11863 -- Deadline parameter. If no Relative_Deadline pragma is present,
11864 -- then the deadline is Time_Span_Zero. If a pragma is present, then
11865 -- the deadline is taken from the _Relative_Deadline field of the
11866 -- task value record, which was set from the pragma value. Note that
11867 -- this parameter must not be generated for the restricted profiles
11868 -- since Ravenscar does not allow deadlines.
11870 -- Case where pragma Relative_Deadline applies: use given value
11872 if Present (Tdef) and then Has_Relative_Deadline_Pragma (Tdef) then
11874 Make_Selected_Component (Loc,
11875 Prefix => Make_Identifier (Loc, Name_uInit),
11877 Make_Identifier (Loc, Name_uRelative_Deadline)));
11879 -- No pragma Relative_Deadline apply to the task
11883 New_Reference_To (RTE (RE_Time_Span_Zero), Loc));
11886 -- Number of entries. This is an expression of the form:
11888 -- n + _Init.a'Length + _Init.a'B'Length + ...
11890 -- where a,b... are the entry family names for the task definition
11893 Build_Entry_Count_Expression
11898 (Parent (Corresponding_Record_Type (Ttyp))))),
11900 Append_To (Args, Ecount);
11902 -- Master parameter. This is a reference to the _Master parameter of
11903 -- the initialization procedure, except in the case of the pragma
11904 -- Restrictions (No_Task_Hierarchy) where the value is fixed to 3.
11905 -- See comments in System.Tasking.Initialization.Init_RTS for the
11908 if Restriction_Active (No_Task_Hierarchy) = False then
11909 Append_To (Args, Make_Identifier (Loc, Name_uMaster));
11911 Append_To (Args, Make_Integer_Literal (Loc, 3));
11915 -- State parameter. This is a pointer to the task body procedure. The
11916 -- required value is obtained by taking 'Unrestricted_Access of the task
11917 -- body procedure and converting it (with an unchecked conversion) to
11918 -- the type required by the task kernel. For further details, see the
11919 -- description of Expand_N_Task_Body. We use 'Unrestricted_Access rather
11920 -- than 'Address in order to avoid creating trampolines.
11923 Body_Proc : constant Node_Id := Get_Task_Body_Procedure (Ttyp);
11924 Subp_Ptr_Typ : constant Node_Id :=
11925 Create_Itype (E_Access_Subprogram_Type, Tdec);
11926 Ref : constant Node_Id := Make_Itype_Reference (Loc);
11929 Set_Directly_Designated_Type (Subp_Ptr_Typ, Body_Proc);
11930 Set_Etype (Subp_Ptr_Typ, Subp_Ptr_Typ);
11932 -- Be sure to freeze a reference to the access-to-subprogram type,
11933 -- otherwise gigi will complain that it's in the wrong scope, because
11934 -- it's actually inside the init procedure for the record type that
11935 -- corresponds to the task type.
11937 -- This processing is causing a crash in the .NET/JVM back ends that
11938 -- is not yet understood, so skip it in these cases ???
11940 if VM_Target = No_VM then
11941 Set_Itype (Ref, Subp_Ptr_Typ);
11942 Append_Freeze_Action (Task_Rec, Ref);
11945 Unchecked_Convert_To (RTE (RE_Task_Procedure_Access),
11946 Make_Qualified_Expression (Loc,
11947 Subtype_Mark => New_Reference_To (Subp_Ptr_Typ, Loc),
11949 Make_Attribute_Reference (Loc,
11951 New_Occurrence_Of (Body_Proc, Loc),
11952 Attribute_Name => Name_Unrestricted_Access))));
11954 -- For the .NET/JVM cases revert to the original code below ???
11958 Unchecked_Convert_To (RTE (RE_Task_Procedure_Access),
11959 Make_Attribute_Reference (Loc,
11961 New_Occurrence_Of (Body_Proc, Loc),
11962 Attribute_Name => Name_Address)));
11966 -- Discriminants parameter. This is just the address of the task
11967 -- value record itself (which contains the discriminant values
11970 Make_Attribute_Reference (Loc,
11971 Prefix => Make_Identifier (Loc, Name_uInit),
11972 Attribute_Name => Name_Address));
11974 -- Elaborated parameter. This is an access to the elaboration Boolean
11977 Make_Attribute_Reference (Loc,
11978 Prefix => Make_Identifier (Loc, New_External_Name (Tnam, 'E')),
11979 Attribute_Name => Name_Unchecked_Access));
11981 -- Chain parameter. This is a reference to the _Chain parameter of
11982 -- the initialization procedure.
11984 Append_To (Args, Make_Identifier (Loc, Name_uChain));
11986 -- Task name parameter. Take this from the _Task_Id parameter to the
11987 -- init call unless there is a Task_Name pragma, in which case we take
11988 -- the value from the pragma.
11991 and then Has_Task_Name_Pragma (Tdef)
11993 -- Copy expression in full, because it may be dynamic and have
11998 Expression (First (
11999 Pragma_Argument_Associations (
12000 Find_Task_Or_Protected_Pragma
12001 (Tdef, Name_Task_Name))))));
12004 Append_To (Args, Make_Identifier (Loc, Name_uTask_Name));
12007 -- Created_Task parameter. This is the _Task_Id field of the task
12011 Make_Selected_Component (Loc,
12012 Prefix => Make_Identifier (Loc, Name_uInit),
12013 Selector_Name => Make_Identifier (Loc, Name_uTask_Id)));
12015 -- Build_Entry_Names generation flag. When set to true, the runtime
12016 -- will allocate an array to hold the string names of task entries.
12018 if not Restricted_Profile then
12019 if Has_Entries (Ttyp)
12020 and then Entry_Names_OK
12022 Append_To (Args, New_Reference_To (Standard_True, Loc));
12024 Append_To (Args, New_Reference_To (Standard_False, Loc));
12028 if Restricted_Profile then
12029 Name := New_Reference_To (RTE (RE_Create_Restricted_Task), Loc);
12031 Name := New_Reference_To (RTE (RE_Create_Task), Loc);
12035 Make_Procedure_Call_Statement (Loc,
12037 Parameter_Associations => Args);
12038 end Make_Task_Create_Call;
12040 ------------------------------
12041 -- Next_Protected_Operation --
12042 ------------------------------
12044 function Next_Protected_Operation (N : Node_Id) return Node_Id is
12048 Next_Op := Next (N);
12049 while Present (Next_Op)
12050 and then not Nkind_In (Next_Op, N_Subprogram_Body, N_Entry_Body)
12056 end Next_Protected_Operation;
12058 ---------------------
12059 -- Null_Statements --
12060 ---------------------
12062 function Null_Statements (Stats : List_Id) return Boolean is
12066 Stmt := First (Stats);
12067 while Nkind (Stmt) /= N_Empty
12068 and then (Nkind_In (Stmt, N_Null_Statement, N_Label)
12070 (Nkind (Stmt) = N_Pragma
12071 and then (Pragma_Name (Stmt) = Name_Unreferenced
12073 Pragma_Name (Stmt) = Name_Unmodified
12075 Pragma_Name (Stmt) = Name_Warnings)))
12080 return Nkind (Stmt) = N_Empty;
12081 end Null_Statements;
12083 --------------------------
12084 -- Parameter_Block_Pack --
12085 --------------------------
12087 function Parameter_Block_Pack
12089 Blk_Typ : Entity_Id;
12093 Stmts : List_Id) return Node_Id
12095 Actual : Entity_Id;
12096 Expr : Node_Id := Empty;
12097 Formal : Entity_Id;
12098 Has_Param : Boolean := False;
12101 Temp_Asn : Node_Id;
12102 Temp_Nam : Node_Id;
12105 Actual := First (Actuals);
12106 Formal := Defining_Identifier (First (Formals));
12107 Params := New_List;
12109 while Present (Actual) loop
12110 if Is_By_Copy_Type (Etype (Actual)) then
12112 -- Jnn : aliased <formal-type>
12115 Make_Defining_Identifier (Loc, New_Internal_Name ('J'));
12118 Make_Object_Declaration (Loc,
12121 Defining_Identifier =>
12123 Object_Definition =>
12124 New_Reference_To (Etype (Formal), Loc)));
12126 if Ekind (Formal) /= E_Out_Parameter then
12132 New_Reference_To (Temp_Nam, Loc);
12134 Set_Assignment_OK (Temp_Asn);
12137 Make_Assignment_Statement (Loc,
12141 New_Copy_Tree (Actual)));
12145 -- Jnn'unchecked_access
12148 Make_Attribute_Reference (Loc,
12150 Name_Unchecked_Access,
12152 New_Reference_To (Temp_Nam, Loc)));
12156 -- The controlling parameter is omitted
12159 if not Is_Controlling_Actual (Actual) then
12161 Make_Reference (Loc, New_Copy_Tree (Actual)));
12167 Next_Actual (Actual);
12168 Next_Formal_With_Extras (Formal);
12172 Expr := Make_Aggregate (Loc, Params);
12177 -- J1'unchecked_access;
12178 -- <actual2>'reference;
12181 P := Make_Defining_Identifier (Loc, New_Internal_Name ('P'));
12184 Make_Object_Declaration (Loc,
12185 Defining_Identifier =>
12187 Object_Definition =>
12188 New_Reference_To (Blk_Typ, Loc),
12193 end Parameter_Block_Pack;
12195 ----------------------------
12196 -- Parameter_Block_Unpack --
12197 ----------------------------
12199 function Parameter_Block_Unpack
12203 Formals : List_Id) return List_Id
12205 Actual : Entity_Id;
12207 Formal : Entity_Id;
12208 Has_Asnmt : Boolean := False;
12209 Result : constant List_Id := New_List;
12212 Actual := First (Actuals);
12213 Formal := Defining_Identifier (First (Formals));
12214 while Present (Actual) loop
12215 if Is_By_Copy_Type (Etype (Actual))
12216 and then Ekind (Formal) /= E_In_Parameter
12219 -- <actual> := P.<formal>;
12222 Make_Assignment_Statement (Loc,
12226 Make_Explicit_Dereference (Loc,
12227 Make_Selected_Component (Loc,
12229 New_Reference_To (P, Loc),
12231 Make_Identifier (Loc, Chars (Formal)))));
12233 Set_Assignment_OK (Name (Asnmt));
12234 Append_To (Result, Asnmt);
12239 Next_Actual (Actual);
12240 Next_Formal_With_Extras (Formal);
12246 return New_List (Make_Null_Statement (Loc));
12248 end Parameter_Block_Unpack;
12250 ----------------------
12251 -- Set_Discriminals --
12252 ----------------------
12254 procedure Set_Discriminals (Dec : Node_Id) is
12257 D_Minal : Entity_Id;
12260 pragma Assert (Nkind (Dec) = N_Protected_Type_Declaration);
12261 Pdef := Defining_Identifier (Dec);
12263 if Has_Discriminants (Pdef) then
12264 D := First_Discriminant (Pdef);
12265 while Present (D) loop
12267 Make_Defining_Identifier (Sloc (D),
12268 Chars => New_External_Name (Chars (D), 'D'));
12270 Set_Ekind (D_Minal, E_Constant);
12271 Set_Etype (D_Minal, Etype (D));
12272 Set_Scope (D_Minal, Pdef);
12273 Set_Discriminal (D, D_Minal);
12274 Set_Discriminal_Link (D_Minal, D);
12276 Next_Discriminant (D);
12279 end Set_Discriminals;
12281 -----------------------
12282 -- Trivial_Accept_OK --
12283 -----------------------
12285 function Trivial_Accept_OK return Boolean is
12287 case Opt.Task_Dispatching_Policy is
12289 -- If we have the default task dispatching policy in effect, we can
12290 -- definitely do the optimization (one way of looking at this is to
12291 -- think of the formal definition of the default policy being allowed
12292 -- to run any task it likes after a rendezvous, so even if notionally
12293 -- a full rescheduling occurs, we can say that our dispatching policy
12294 -- (i.e. the default dispatching policy) reorders the queue to be the
12295 -- same as just before the call.
12300 -- FIFO_Within_Priorities certainly does not permit this
12301 -- optimization since the Rendezvous is a scheduling action that may
12302 -- require some other task to be run.
12307 -- For now, disallow the optimization for all other policies. This
12308 -- may be over-conservative, but it is certainly not incorrect.
12314 end Trivial_Accept_OK;
OSDN Git Service
