* config/bfin/bfin.c (effective_address_32bit_p): Return true for
[official-gcc/alias-decl.git] / gcc / ada / s-taskin.ads
bloba9b1812b7dccd31fdab9c582bc5380fc86869eaa
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
4 -- --
5 -- S Y S T E M . T A S K I N G --
6 -- --
7 -- S p e c --
8 -- --
9 -- Copyright (C) 1992-2006, Free Software Foundation, Inc. --
10 -- --
11 -- GNARL is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 2, or (at your option) any later ver- --
14 -- sion. GNARL 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 GNARL; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
21 -- --
22 -- As a special exception, if other files instantiate generics from this --
23 -- unit, or you link this unit with other files to produce an executable, --
24 -- this unit does not by itself cause the resulting executable to be --
25 -- covered by the GNU General Public License. This exception does not --
26 -- however invalidate any other reasons why the executable file might be --
27 -- covered by the GNU Public License. --
28 -- --
29 -- GNARL was developed by the GNARL team at Florida State University. --
30 -- Extensive contributions were provided by Ada Core Technologies, Inc. --
31 -- --
32 ------------------------------------------------------------------------------
34 -- This package provides necessary type definitions for compiler interface
36 -- Note: the compiler generates direct calls to this interface, via Rtsfind.
37 -- Any changes to this interface may require corresponding compiler changes.
39 with Ada.Exceptions;
40 -- Used for Exception_Id
41 -- Exception_Occurrence
43 with System.Parameters;
44 -- used for Size_Type
46 with System.Task_Info;
47 -- used for Task_Info_Type
49 with System.Soft_Links;
50 -- used for TSD
52 with System.Task_Primitives;
53 -- used for Private_Data
55 with System.Stack_Usage;
56 -- used for Stack_Analyzer
58 with Unchecked_Conversion;
60 package System.Tasking is
61 pragma Preelaborate;
63 -------------------
64 -- Locking Rules --
65 -------------------
67 -- The following rules must be followed at all times, to prevent
68 -- deadlock and generally ensure correct operation of locking.
70 -- Never lock a lock unless abort is deferred
72 -- Never undefer abort while holding a lock
74 -- Overlapping critical sections must be properly nested, and locks must
75 -- be released in LIFO order. e.g., the following is not allowed:
77 -- Lock (X);
78 -- ...
79 -- Lock (Y);
80 -- ...
81 -- Unlock (X);
82 -- ...
83 -- Unlock (Y);
85 -- Locks with lower (smaller) level number cannot be locked
86 -- while holding a lock with a higher level number. (The level
88 -- 1. System.Tasking.PO_Simple.Protection.L (any PO lock)
89 -- 2. System.Tasking.Initialization.Global_Task_Lock (in body)
90 -- 3. System.Task_Primitives.Operations.Single_RTS_Lock
91 -- 4. System.Tasking.Ada_Task_Control_Block.LL.L (any TCB lock)
93 -- Clearly, there can be no circular chain of hold-and-wait
94 -- relationships involving locks in different ordering levels.
96 -- We used to have Global_Task_Lock before Protection.L but this was
97 -- clearly wrong since there can be calls to "new" inside protected
98 -- operations. The new ordering prevents these failures.
100 -- Sometimes we need to hold two ATCB locks at the same time. To allow us
101 -- to order the locking, each ATCB is given a unique serial number. If one
102 -- needs to hold locks on several ATCBs at once, the locks with lower
103 -- serial numbers must be locked first.
105 -- We don't always need to check the serial numbers, since the serial
106 -- numbers are assigned sequentially, and so:
108 -- . The parent of a task always has a lower serial number.
109 -- . The activator of a task always has a lower serial number.
110 -- . The environment task has a lower serial number than any other task.
111 -- . If the activator of a task is different from the task's parent,
112 -- the parent always has a lower serial number than the activator.
114 ---------------------------------
115 -- Task_Id related definitions --
116 ---------------------------------
118 type Ada_Task_Control_Block;
120 type Task_Id is access all Ada_Task_Control_Block;
122 Null_Task : constant Task_Id;
124 type Task_List is array (Positive range <>) of Task_Id;
126 function Self return Task_Id;
127 pragma Inline (Self);
128 -- This is the compiler interface version of this function. Do not call
129 -- from the run-time system.
131 function To_Task_Id is new Unchecked_Conversion (System.Address, Task_Id);
132 function To_Address is new Unchecked_Conversion (Task_Id, System.Address);
134 -----------------------
135 -- Enumeration types --
136 -----------------------
138 type Task_States is
139 (Unactivated,
140 -- Task has been created but has not been activated.
141 -- It cannot be executing.
143 -- Active states
144 -- For all states from here down, the task has been activated.
145 -- For all states from here down, except for Terminated, the task
146 -- may be executing.
147 -- Activator = null iff it has not yet completed activating.
149 -- For all states from here down,
150 -- the task has been activated, and may be executing.
152 Runnable,
153 -- Task is not blocked for any reason known to Ada.
154 -- (It may be waiting for a mutex, though.)
155 -- It is conceptually "executing" in normal mode.
157 Terminated,
158 -- The task is terminated, in the sense of ARM 9.3 (5).
159 -- Any dependents that were waiting on terminate
160 -- alternatives have been awakened and have terminated themselves.
162 Activator_Sleep,
163 -- Task is waiting for created tasks to complete activation
165 Acceptor_Sleep,
166 -- Task is waiting on an accept or selective wait statement
168 Entry_Caller_Sleep,
169 -- Task is waiting on an entry call
171 Async_Select_Sleep,
172 -- Task is waiting to start the abortable part of an
173 -- asynchronous select statement.
175 Delay_Sleep,
176 -- Task is waiting on a select statement with only a delay
177 -- alternative open.
179 Master_Completion_Sleep,
180 -- Master completion has two phases.
181 -- In Phase 1 the task is sleeping in Complete_Master
182 -- having completed a master within itself,
183 -- and is waiting for the tasks dependent on that master to become
184 -- terminated or waiting on a terminate Phase.
186 Master_Phase_2_Sleep,
187 -- In Phase 2 the task is sleeping in Complete_Master
188 -- waiting for tasks on terminate alternatives to finish
189 -- terminating.
191 -- The following are special uses of sleep, for server tasks
192 -- within the run-time system.
194 Interrupt_Server_Idle_Sleep,
195 Interrupt_Server_Blocked_Interrupt_Sleep,
196 Timer_Server_Sleep,
197 AST_Server_Sleep,
199 Asynchronous_Hold,
200 -- The task has been held by Asynchronous_Task_Control.Hold_Task
202 Interrupt_Server_Blocked_On_Event_Flag
203 -- The task has been blocked on a system call waiting for the
204 -- completion event.
207 type Call_Modes is
208 (Simple_Call, Conditional_Call, Asynchronous_Call, Timed_Call);
210 type Select_Modes is (Simple_Mode, Else_Mode, Terminate_Mode, Delay_Mode);
212 subtype Delay_Modes is Integer;
214 -------------------------------
215 -- Entry related definitions --
216 -------------------------------
218 Null_Entry : constant := 0;
220 Max_Entry : constant := Integer'Last;
222 Interrupt_Entry : constant := -2;
224 Cancelled_Entry : constant := -1;
226 type Entry_Index is range Interrupt_Entry .. Max_Entry;
228 Null_Task_Entry : constant := Null_Entry;
230 Max_Task_Entry : constant := Max_Entry;
232 type Task_Entry_Index is new Entry_Index
233 range Null_Task_Entry .. Max_Task_Entry;
235 type Entry_Call_Record;
237 type Entry_Call_Link is access all Entry_Call_Record;
239 type Entry_Queue is record
240 Head : Entry_Call_Link;
241 Tail : Entry_Call_Link;
242 end record;
244 type Task_Entry_Queue_Array is
245 array (Task_Entry_Index range <>) of Entry_Queue;
247 ----------------------------------
248 -- Entry_Call_Record definition --
249 ----------------------------------
251 type Entry_Call_State is
252 (Never_Abortable,
253 -- the call is not abortable, and never can be
255 Not_Yet_Abortable,
256 -- the call is not abortable, but may become so
258 Was_Abortable,
259 -- the call is not abortable, but once was
261 Now_Abortable,
262 -- the call is abortable
264 Done,
265 -- the call has been completed
267 Cancelled
268 -- the call was asynchronous, and was cancelled
271 -- Never_Abortable is used for calls that are made in a abort
272 -- deferred region (see ARM 9.8(5-11), 9.8 (20)).
273 -- Such a call is never abortable.
275 -- The Was_ vs. Not_Yet_ distinction is needed to decide whether it
276 -- is OK to advance into the abortable part of an async. select stmt.
277 -- That is allowed iff the mode is Now_ or Was_.
279 -- Done indicates the call has been completed, without cancellation,
280 -- or no call has been made yet at this ATC nesting level,
281 -- and so aborting the call is no longer an issue.
282 -- Completion of the call does not necessarily indicate "success";
283 -- the call may be returning an exception if Exception_To_Raise is
284 -- non-null.
286 -- Cancelled indicates the call was cancelled,
287 -- and so aborting the call is no longer an issue.
289 -- The call is on an entry queue unless
290 -- State >= Done, in which case it may or may not be still Onqueue.
292 -- Please do not modify the order of the values, without checking
293 -- all uses of this type. We rely on partial "monotonicity" of
294 -- Entry_Call_Record.State to avoid locking when we access this
295 -- value for certain tests. In particular:
297 -- 1) Once State >= Done, we can rely that the call has been
298 -- completed. If State >= Done, it will not
299 -- change until the task does another entry call at this level.
301 -- 2) Once State >= Was_Abortable, we can rely that the call has
302 -- been queued abortably at least once, and so the check for
303 -- whether it is OK to advance to the abortable part of an
304 -- async. select statement does not need to lock anything.
306 type Restricted_Entry_Call_Record is record
307 Self : Task_Id;
308 -- ID of the caller
310 Mode : Call_Modes;
312 State : Entry_Call_State;
313 pragma Atomic (State);
314 -- Indicates part of the state of the call.
316 -- Protection: If the call is not on a queue, it should only be
317 -- accessed by Self, and Self does not need any lock to modify this
318 -- field.
320 -- Once the call is on a queue, the value should be something other
321 -- than Done unless it is cancelled, and access is controller by the
322 -- "server" of the queue -- i.e., the lock of Checked_To_Protection
323 -- (Call_Target) if the call record is on the queue of a PO, or the
324 -- lock of Called_Target if the call is on the queue of a task. See
325 -- comments on type declaration for more details.
327 Uninterpreted_Data : System.Address;
328 -- Data passed by the compiler
330 Exception_To_Raise : Ada.Exceptions.Exception_Id;
331 -- The exception to raise once this call has been completed without
332 -- being aborted.
333 end record;
334 pragma Suppress_Initialization (Restricted_Entry_Call_Record);
336 -------------------------------------------
337 -- Task termination procedure definition --
338 -------------------------------------------
340 -- We need to redefine here these types (already defined in
341 -- Ada.Task_Termination) for avoiding circular dependencies.
343 type Cause_Of_Termination is (Normal, Abnormal, Unhandled_Exception);
344 -- Possible causes for task termination:
346 -- Normal means that the task terminates due to completing the
347 -- last sentence of its body, or as a result of waiting on a
348 -- terminate alternative.
350 -- Abnormal means that the task terminates because it is being aborted
352 -- handled_Exception means that the task terminates because of exception
353 -- raised by by the execution of its task_body.
355 type Termination_Handler is access protected procedure
356 (Cause : Cause_Of_Termination;
357 T : Task_Id;
358 X : Ada.Exceptions.Exception_Occurrence);
359 -- Used to represent protected procedures to be executed when task
360 -- terminates.
362 ------------------------------------
363 -- Task related other definitions --
364 ------------------------------------
366 type Activation_Chain is limited private;
367 -- Comment required ???
369 type Activation_Chain_Access is access all Activation_Chain;
370 -- Comment required ???
372 type Task_Procedure_Access is access procedure (Arg : System.Address);
374 type Access_Boolean is access all Boolean;
376 function Detect_Blocking return Boolean;
377 pragma Inline (Detect_Blocking);
378 -- Return whether the Detect_Blocking pragma is enabled
380 function Storage_Size (T : Task_Id) return System.Parameters.Size_Type;
381 -- Retrieve from the TCB of the task the allocated size of its stack,
382 -- either the system default or the size specified by a pragma. This
383 -- is in general a non-static value that can depend on discriminants
384 -- of the task.
386 ----------------------------------------------
387 -- Ada_Task_Control_Block (ATCB) definition --
388 ----------------------------------------------
390 -- Notes on protection (synchronization) of TRTS data structures
392 -- Any field of the TCB can be written by the activator of a task when the
393 -- task is created, since no other task can access the new task's
394 -- state until creation is complete.
396 -- The protection for each field is described in a comment starting with
397 -- "Protection:".
399 -- When a lock is used to protect an ATCB field, this lock is simply named
401 -- Some protection is described in terms of tasks related to the
402 -- ATCB being protected. These are:
404 -- Self: The task which is controlled by this ATCB
405 -- Acceptor: A task accepting a call from Self
406 -- Caller: A task calling an entry of Self
407 -- Parent: The task executing the master on which Self depends
408 -- Dependent: A task dependent on Self
409 -- Activator: The task that created Self and initiated its activation
410 -- Created: A task created and activated by Self
412 -- Note: The order of the fields is important to implement efficiently
413 -- tasking support under gdb.
414 -- Currently gdb relies on the order of the State, Parent, Base_Priority,
415 -- Task_Image, Task_Image_Len, Call and LL fields.
417 -------------------------
418 -- Common ATCB section --
419 -------------------------
421 -- Section used by all GNARL implementations (regular and restricted)
423 type Common_ATCB is record
424 State : Task_States;
425 pragma Atomic (State);
426 -- Encodes some basic information about the state of a task,
427 -- including whether it has been activated, whether it is sleeping,
428 -- and whether it is terminated.
430 -- Protection: Self.L
432 Parent : Task_Id;
433 -- The task on which this task depends.
434 -- See also Master_Level and Master_Within.
436 Base_Priority : System.Any_Priority;
437 -- Base priority, not changed during entry calls, only changed
438 -- via dynamic priorities package.
440 -- Protection: Only written by Self, accessed by anyone
442 Current_Priority : System.Any_Priority;
443 -- Active priority, except that the effects of protected object
444 -- priority ceilings are not reflected. This only reflects explicit
445 -- priority changes and priority inherited through task activation
446 -- and rendezvous.
448 -- Ada 95 notes: In Ada 95, this field will be transferred to the
449 -- Priority field of an Entry_Calls component when an entry call
450 -- is initiated. The Priority of the Entry_Calls component will not
451 -- change for the duration of the call. The accepting task can
452 -- use it to boost its own priority without fear of its changing in
453 -- the meantime.
455 -- This can safely be used in the priority ordering
456 -- of entry queues. Once a call is queued, its priority does not
457 -- change.
459 -- Since an entry call cannot be made while executing
460 -- a protected action, the priority of a task will never reflect a
461 -- priority ceiling change at the point of an entry call.
463 -- Protection: Only written by Self, and only accessed when Acceptor
464 -- accepts an entry or when Created activates, at which points Self is
465 -- suspended.
467 Protected_Action_Nesting : Natural;
468 pragma Atomic (Protected_Action_Nesting);
469 -- The dynamic level of protected action nesting for this task. This
470 -- field is needed for checking whether potentially blocking operations
471 -- are invoked from protected actions. pragma Atomic is used because it
472 -- can be read/written from protected interrupt handlers.
474 Task_Image : String (1 .. 32);
475 -- Hold a string that provides a readable id for task,
476 -- built from the variable of which it is a value or component.
478 Task_Image_Len : Natural;
479 -- Actual length of Task_Image
481 Call : Entry_Call_Link;
482 -- The entry call that has been accepted by this task.
484 -- Protection: Self.L. Self will modify this field when Self.Accepting
485 -- is False, and will not need the mutex to do so. Once a task sets
486 -- Pending_ATC_Level = 0, no other task can access this field.
488 LL : aliased Task_Primitives.Private_Data;
489 -- Control block used by the underlying low-level tasking service
490 -- (GNULLI).
492 -- Protection: This is used only by the GNULLI implementation, which
493 -- takes care of all of its synchronization.
495 Task_Arg : System.Address;
496 -- The argument to task procedure. Provide a handle for discriminant
497 -- information
499 -- Protection: Part of the synchronization between Self and Activator.
500 -- Activator writes it, once, before Self starts executing. Thereafter,
501 -- Self only reads it.
503 Task_Entry_Point : Task_Procedure_Access;
504 -- Information needed to call the procedure containing the code for
505 -- the body of this task.
507 -- Protection: Part of the synchronization between Self and Activator.
508 -- Activator writes it, once, before Self starts executing. Self reads
509 -- it, once, as part of its execution.
511 Compiler_Data : System.Soft_Links.TSD;
512 -- Task-specific data needed by the compiler to store per-task
513 -- structures.
515 -- Protection: Only accessed by Self
517 All_Tasks_Link : Task_Id;
518 -- Used to link this task to the list of all tasks in the system
520 -- Protection: RTS_Lock
522 Activation_Link : Task_Id;
523 -- Used to link this task to a list of tasks to be activated
525 -- Protection: Only used by Activator
527 Activator : Task_Id;
528 -- The task that created this task, either by declaring it as a task
529 -- object or by executing a task allocator. The value is null iff Self
530 -- has completed activation.
532 -- Protection: Set by Activator before Self is activated, and only read
533 -- and modified by Self after that.
535 Wait_Count : Integer;
536 -- This count is used by a task that is waiting for other tasks. At all
537 -- other times, the value should be zero. It is used differently in
538 -- several different states. Since a task cannot be in more than one of
539 -- these states at the same time, a single counter suffices.
541 -- Protection: Self.L
543 -- Activator_Sleep
545 -- This is the number of tasks that this task is activating, i.e. the
546 -- children that have started activation but have not completed it.
548 -- Protection: Self.L and Created.L. Both mutexes must be locked, since
549 -- Self.Activation_Count and Created.State must be synchronized.
551 -- Master_Completion_Sleep (phase 1)
553 -- This is the number dependent tasks of a master being completed by
554 -- Self that are not activated, not terminated, and not waiting on a
555 -- terminate alternative.
557 -- Master_Completion_2_Sleep (phase 2)
559 -- This is the count of tasks dependent on a master being completed by
560 -- Self which are waiting on a terminate alternative.
562 Elaborated : Access_Boolean;
563 -- Pointer to a flag indicating that this task's body has been
564 -- elaborated. The flag is created and managed by the
565 -- compiler-generated code.
567 -- Protection: The field itself is only accessed by Activator. The flag
568 -- that it points to is updated by Master and read by Activator; access
569 -- is assumed to be atomic.
571 Activation_Failed : Boolean;
572 -- Set to True if activation of a chain of tasks fails,
573 -- so that the activator should raise Tasking_Error.
575 Task_Info : System.Task_Info.Task_Info_Type;
576 -- System-specific attributes of the task as specified by the
577 -- Task_Info pragma.
579 Analyzer : System.Stack_Usage.Stack_Analyzer;
580 -- For storing informations used to measure the stack usage
582 Global_Task_Lock_Nesting : Natural;
583 -- This is the current nesting level of calls to
584 -- System.Tasking.Initialization.Lock_Task. This allows a task to call
585 -- Lock_Task multiple times without deadlocking. A task only locks
586 -- Global_Task_Lock when its Global_Task_Lock_Nesting goes from 0 to 1,
587 -- and only unlocked when it goes from 1 to 0.
589 -- Protection: Only accessed by Self
591 Fall_Back_Handler : Termination_Handler;
592 -- This is the fall-back handler that applies to the dependent tasks of
593 -- the task.
595 -- Protection: Self.L
597 Specific_Handler : Termination_Handler;
598 -- This is the specific handler that applies only to this task, and not
599 -- any of its dependent tasks.
601 -- Protection: Self.L
602 end record;
604 ---------------------------------------
605 -- Restricted_Ada_Task_Control_Block --
606 ---------------------------------------
608 -- This type should only be used by the restricted GNARLI and by
609 -- restricted GNULL implementations to allocate an ATCB (see
610 -- System.Task_Primitives.Operations.New_ATCB) that will take
611 -- significantly less memory.
613 -- Note that the restricted GNARLI should only access fields that are
614 -- present in the Restricted_Ada_Task_Control_Block structure.
616 type Restricted_Ada_Task_Control_Block (Entry_Num : Task_Entry_Index) is
617 record
618 Common : Common_ATCB;
619 -- The common part between various tasking implementations
621 Entry_Call : aliased Restricted_Entry_Call_Record;
622 -- Protection: This field is used on entry call "queues" associated
623 -- with protected objects, and is protected by the protected object
624 -- lock.
625 end record;
626 pragma Suppress_Initialization (Restricted_Ada_Task_Control_Block);
628 Interrupt_Manager_ID : Task_Id;
629 -- This task ID is declared here to break circular dependencies.
630 -- Also declare Interrupt_Manager_ID after Task_Id is known, to avoid
631 -- generating unneeded finalization code.
633 -----------------------
634 -- List of all Tasks --
635 -----------------------
637 All_Tasks_List : Task_Id;
638 -- Global linked list of all tasks
640 ------------------------------------------
641 -- Regular (non restricted) definitions --
642 ------------------------------------------
644 --------------------------------
645 -- Master Related Definitions --
646 --------------------------------
648 subtype Master_Level is Integer;
649 subtype Master_ID is Master_Level;
651 -- Normally, a task starts out with internal master nesting level one
652 -- larger than external master nesting level. It is incremented to one by
653 -- Enter_Master, which is called in the task body only if the compiler
654 -- thinks the task may have dependent tasks. It is set to for the
655 -- environment task, the level 2 is reserved for server tasks of the
656 -- run-time system (the so called "independent tasks"), and the level 3 is
657 -- for the library level tasks.
659 Environment_Task_Level : constant Master_Level := 1;
660 Independent_Task_Level : constant Master_Level := 2;
661 Library_Task_Level : constant Master_Level := 3;
663 ------------------------------
664 -- Task size, priority info --
665 ------------------------------
667 Unspecified_Priority : constant Integer := System.Priority'First - 1;
669 Priority_Not_Boosted : constant Integer := System.Priority'First - 1;
670 -- Definition of Priority actually has to come from the RTS configuration
672 subtype Rendezvous_Priority is Integer
673 range Priority_Not_Boosted .. System.Any_Priority'Last;
675 ------------------------------------
676 -- Rendezvous related definitions --
677 ------------------------------------
679 No_Rendezvous : constant := 0;
681 Max_Select : constant Integer := Integer'Last;
682 -- RTS-defined
684 subtype Select_Index is Integer range No_Rendezvous .. Max_Select;
685 -- type Select_Index is range No_Rendezvous .. Max_Select;
687 subtype Positive_Select_Index is
688 Select_Index range 1 .. Select_Index'Last;
690 type Accept_Alternative is record
691 Null_Body : Boolean;
692 S : Task_Entry_Index;
693 end record;
695 type Accept_List is
696 array (Positive_Select_Index range <>) of Accept_Alternative;
698 type Accept_List_Access is access constant Accept_List;
700 -----------------------------------
701 -- ATC_Level related definitions --
702 -----------------------------------
704 Max_ATC_Nesting : constant Natural := 20;
706 subtype ATC_Level_Base is Integer range 0 .. Max_ATC_Nesting;
708 ATC_Level_Infinity : constant ATC_Level_Base := ATC_Level_Base'Last;
710 subtype ATC_Level is ATC_Level_Base range 0 .. ATC_Level_Base'Last - 1;
712 subtype ATC_Level_Index is ATC_Level range 1 .. ATC_Level'Last;
714 ----------------------------------
715 -- Entry_Call_Record definition --
716 ----------------------------------
718 type Entry_Call_Record is record
719 Self : Task_Id;
720 -- ID of the caller
722 Mode : Call_Modes;
724 State : Entry_Call_State;
725 pragma Atomic (State);
726 -- Indicates part of the state of the call
728 -- Protection: If the call is not on a queue, it should only be
729 -- accessed by Self, and Self does not need any lock to modify this
730 -- field. Once the call is on a queue, the value should be something
731 -- other than Done unless it is cancelled, and access is controller by
732 -- the "server" of the queue -- i.e., the lock of Checked_To_Protection
733 -- (Call_Target) if the call record is on the queue of a PO, or the
734 -- lock of Called_Target if the call is on the queue of a task. See
735 -- comments on type declaration for more details.
737 Uninterpreted_Data : System.Address;
738 -- Data passed by the compiler
740 Exception_To_Raise : Ada.Exceptions.Exception_Id;
741 -- The exception to raise once this call has been completed without
742 -- being aborted.
744 Prev : Entry_Call_Link;
746 Next : Entry_Call_Link;
748 Level : ATC_Level;
749 -- One of Self and Level are redundant in this implementation, since
750 -- each Entry_Call_Record is at Self.Entry_Calls (Level). Since we must
751 -- have access to the entry call record to be reading this, we could
752 -- get Self from Level, or Level from Self. However, this requires
753 -- non-portable address arithmetic.
755 E : Entry_Index;
757 Prio : System.Any_Priority;
759 -- The above fields are those that there may be some hope of packing.
760 -- They are gathered together to allow for compilers that lay records
761 -- out contiguously, to allow for such packing.
763 Called_Task : Task_Id;
764 pragma Atomic (Called_Task);
765 -- Use for task entry calls. The value is null if the call record is
766 -- not in use. Conversely, unless State is Done and Onqueue is false,
767 -- Called_Task points to an ATCB.
769 -- Protection: Called_Task.L
771 Called_PO : System.Address;
772 pragma Atomic (Called_PO);
773 -- Similar to Called_Task but for protected objects
775 -- Note that the previous implementation tried to merge both
776 -- Called_Task and Called_PO but this ended up in many unexpected
777 -- complications (e.g having to add a magic number in the ATCB, which
778 -- caused gdb lots of confusion) with no real gain since the
779 -- Lock_Server implementation still need to loop around chasing for
780 -- pointer changes even with a single pointer.
782 Acceptor_Prev_Call : Entry_Call_Link;
783 -- For task entry calls only
785 Acceptor_Prev_Priority : Rendezvous_Priority := Priority_Not_Boosted;
786 -- For task entry calls only. The priority of the most recent prior
787 -- call being serviced. For protected entry calls, this function should
788 -- be performed by GNULLI ceiling locking.
790 Cancellation_Attempted : Boolean := False;
791 pragma Atomic (Cancellation_Attempted);
792 -- Cancellation of the call has been attempted.
793 -- Consider merging this into State???
795 Requeue_With_Abort : Boolean := False;
796 -- Temporary to tell caller whether requeue is with abort.
797 -- Find a better way of doing this ???
799 Needs_Requeue : Boolean := False;
800 -- Temporary to tell acceptor of task entry call that
801 -- Exceptional_Complete_Rendezvous needs to do requeue.
802 end record;
804 ------------------------------------
805 -- Task related other definitions --
806 ------------------------------------
808 type Access_Address is access all System.Address;
809 -- Comment on what this is used for ???
811 pragma No_Strict_Aliasing (Access_Address);
812 -- This type is used in contexts where aliasing may be an issue (see
813 -- for example s-tataat.adb), so we avoid any incorrect aliasing
814 -- assumptions.
816 ----------------------------------------------
817 -- Ada_Task_Control_Block (ATCB) definition --
818 ----------------------------------------------
820 type Entry_Call_Array is array (ATC_Level_Index) of
821 aliased Entry_Call_Record;
823 type Direct_Index is range 0 .. Parameters.Default_Attribute_Count;
824 subtype Direct_Index_Range is Direct_Index range 1 .. Direct_Index'Last;
825 -- Attributes with indices in this range are stored directly in the task
826 -- control block. Such attributes must be Address-sized. Other attributes
827 -- will be held in dynamically allocated records chained off of the task
828 -- control block.
830 type Direct_Attribute_Element is mod Memory_Size;
831 pragma Atomic (Direct_Attribute_Element);
833 type Direct_Attribute_Array is
834 array (Direct_Index_Range) of aliased Direct_Attribute_Element;
836 type Direct_Index_Vector is mod 2 ** Parameters.Default_Attribute_Count;
837 -- This is a bit-vector type, used to store information about
838 -- the usage of the direct attribute fields.
840 type Task_Serial_Number is mod 2 ** 64;
841 -- Used to give each task a unique serial number
843 type Ada_Task_Control_Block (Entry_Num : Task_Entry_Index) is record
844 Common : Common_ATCB;
845 -- The common part between various tasking implementations
847 Entry_Calls : Entry_Call_Array;
848 -- An array of entry calls
850 -- Protection: The elements of this array are on entry call queues
851 -- associated with protected objects or task entries, and are protected
852 -- by the protected object lock or Acceptor.L, respectively.
854 New_Base_Priority : System.Any_Priority;
855 -- New value for Base_Priority (for dynamic priorities package)
857 -- Protection: Self.L
859 Open_Accepts : Accept_List_Access;
860 -- This points to the Open_Accepts array of accept alternatives passed
861 -- to the RTS by the compiler-generated code to Selective_Wait. It is
862 -- non-null iff this task is ready to accept an entry call.
864 -- Protection: Self.L
866 Chosen_Index : Select_Index;
867 -- The index in Open_Accepts of the entry call accepted by a selective
868 -- wait executed by this task.
870 -- Protection: Written by both Self and Caller. Usually protected by
871 -- Self.L. However, once the selection is known to have been written it
872 -- can be accessed without protection. This happens after Self has
873 -- updated it itself using information from a suspended Caller, or
874 -- after Caller has updated it and awakened Self.
876 Master_of_Task : Master_Level;
877 -- The task executing the master of this task, and the ID of this task's
878 -- master (unique only among masters currently active within Parent).
880 -- Protection: Set by Activator before Self is activated, and read
881 -- after Self is activated.
883 Master_Within : Master_Level;
884 -- The ID of the master currently executing within this task; that is,
885 -- the most deeply nested currently active master.
887 -- Protection: Only written by Self, and only read by Self or by
888 -- dependents when Self is attempting to exit a master. Since Self will
889 -- not write this field until the master is complete, the
890 -- synchronization should be adequate to prevent races.
892 Alive_Count : Integer := 0;
893 -- Number of tasks directly dependent on this task (including itself)
894 -- that are still "alive", i.e. not terminated.
896 -- Protection: Self.L
898 Awake_Count : Integer := 0;
899 -- Number of tasks directly dependent on this task (including itself)
900 -- still "awake", i.e., are not terminated and not waiting on a
901 -- terminate alternative.
903 -- Invariant: Awake_Count <= Alive_Count
905 -- Protection: Self.L
907 -- Beginning of flags
909 Aborting : Boolean := False;
910 pragma Atomic (Aborting);
911 -- Self is in the process of aborting. While set, prevents multiple
912 -- abort signals from being sent by different aborter while abort
913 -- is acted upon. This is essential since an aborter which calls
914 -- Abort_To_Level could set the Pending_ATC_Level to yet a lower level
915 -- (than the current level), may be preempted and would send the
916 -- abort signal when resuming execution. At this point, the abortee
917 -- may have completed abort to the proper level such that the
918 -- signal (and resulting abort exception) are not handled any more.
919 -- In other words, the flag prevents a race between multiple aborters
921 -- Protection: protected by atomic access.
923 ATC_Hack : Boolean := False;
924 pragma Atomic (ATC_Hack);
925 -- ?????
926 -- Temporary fix, to allow Undefer_Abort to reset Aborting in the
927 -- handler for Abort_Signal that encloses an async. entry call.
928 -- For the longer term, this should be done via code in the
929 -- handler itself.
931 Callable : Boolean := True;
932 -- It is OK to call entries of this task
934 Dependents_Aborted : Boolean := False;
935 -- This is set to True by whichever task takes responsibility for
936 -- aborting the dependents of this task.
938 -- Protection: Self.L
940 Interrupt_Entry : Boolean := False;
941 -- Indicates if one or more Interrupt Entries are attached to the task.
942 -- This flag is needed for cleaning up the Interrupt Entry bindings.
944 Pending_Action : Boolean := False;
945 -- Unified flag indicating some action needs to be take when abort
946 -- next becomes undeferred. Currently set if:
947 -- . Pending_Priority_Change is set
948 -- . Pending_ATC_Level is changed
949 -- . Requeue involving POs
950 -- (Abortable field may have changed and the Wait_Until_Abortable
951 -- has to recheck the abortable status of the call.)
952 -- . Exception_To_Raise is non-null
954 -- Protection: Self.L
956 -- This should never be reset back to False outside of the procedure
957 -- Do_Pending_Action, which is called by Undefer_Abort. It should only
958 -- be set to True by Set_Priority and Abort_To_Level.
960 Pending_Priority_Change : Boolean := False;
961 -- Flag to indicate pending priority change (for dynamic priorities
962 -- package). The base priority is updated on the next abort
963 -- completion point (aka. synchronization point).
965 -- Protection: Self.L
967 Terminate_Alternative : Boolean := False;
968 -- Task is accepting Select with Terminate Alternative
970 -- Protection: Self.L
972 -- End of flags
974 -- Beginning of counts
976 ATC_Nesting_Level : ATC_Level := 1;
977 -- The dynamic level of ATC nesting (currently executing nested
978 -- asynchronous select statements) in this task.
980 -- Protection: Self_ID.L. Only Self reads or updates this field.
981 -- Decrementing it deallocates an Entry_Calls component, and care must
982 -- be taken that all references to that component are eliminated before
983 -- doing the decrement. This in turn will require locking a protected
984 -- object (for a protected entry call) or the Acceptor's lock (for a
985 -- task entry call). No other task should attempt to read or modify
986 -- this value.
988 Deferral_Level : Natural := 1;
989 -- This is the number of times that Defer_Abortion has been called by
990 -- this task without a matching Undefer_Abortion call. Abortion is only
991 -- allowed when this zero. It is initially 1, to protect the task at
992 -- startup.
994 -- Protection: Only updated by Self; access assumed to be atomic
996 Pending_ATC_Level : ATC_Level_Base := ATC_Level_Infinity;
997 -- The ATC level to which this task is currently being aborted. If the
998 -- value is zero, the entire task has "completed". That may be via
999 -- abort, exception propagation, or normal exit. If the value is
1000 -- ATC_Level_Infinity, the task is not being aborted to any level. If
1001 -- the value is positive, the task has not completed. This should ONLY
1002 -- be modified by Abort_To_Level and Exit_One_ATC_Level.
1004 -- Protection: Self.L
1006 Serial_Number : Task_Serial_Number;
1007 -- A growing number to provide some way to check locking rules/ordering
1009 Known_Tasks_Index : Integer := -1;
1010 -- Index in the System.Tasking.Debug.Known_Tasks array
1012 User_State : Long_Integer := 0;
1013 -- User-writeable location, for use in debugging tasks; also provides a
1014 -- simple task specific data.
1016 Direct_Attributes : Direct_Attribute_Array;
1017 -- For task attributes that have same size as Address
1019 Is_Defined : Direct_Index_Vector := 0;
1020 -- Bit I is 1 iff Direct_Attributes (I) is defined
1022 Indirect_Attributes : Access_Address;
1023 -- A pointer to chain of records for other attributes that are not
1024 -- address-sized, including all tagged types.
1026 Entry_Queues : Task_Entry_Queue_Array (1 .. Entry_Num);
1027 -- An array of task entry queues
1029 -- Protection: Self.L. Once a task has set Self.Stage to Completing, it
1030 -- has exclusive access to this field.
1031 end record;
1033 --------------------
1034 -- Initialization --
1035 --------------------
1037 procedure Initialize;
1038 -- This procedure constitutes the first part of the initialization of the
1039 -- GNARL. This includes creating data structures to make the initial thread
1040 -- into the environment task. The last part of the initialization is done
1041 -- in System.Tasking.Initialization or System.Tasking.Restricted.Stages.
1042 -- All the initializations used to be in Tasking.Initialization, but this
1043 -- is no longer possible with the run time simplification (including
1044 -- optimized PO and the restricted run time) since one cannot rely on
1045 -- System.Tasking.Initialization being present, as was done before.
1047 procedure Initialize_ATCB
1048 (Self_ID : Task_Id;
1049 Task_Entry_Point : Task_Procedure_Access;
1050 Task_Arg : System.Address;
1051 Parent : Task_Id;
1052 Elaborated : Access_Boolean;
1053 Base_Priority : System.Any_Priority;
1054 Task_Info : System.Task_Info.Task_Info_Type;
1055 Stack_Size : System.Parameters.Size_Type;
1056 T : Task_Id;
1057 Success : out Boolean);
1058 -- Initialize fields of a TCB and link into global TCB structures Call
1059 -- this only with abort deferred and holding RTS_Lock. Need more
1060 -- documentation, mention T, and describe Success ???
1062 private
1063 Null_Task : constant Task_Id := null;
1065 type Activation_Chain is record
1066 T_ID : Task_Id;
1067 end record;
1068 pragma Volatile (Activation_Chain);
1070 -- Activation_chain is an in-out parameter of initialization procedures
1071 -- and it must be passed by reference because the init proc may terminate
1072 -- abnormally after creating task components, and these must be properly
1073 -- registered for removal (Expunge_Unactivated_Tasks).
1075 end System.Tasking;