Skip to main content

D.11 Asynchronous Task Control

danger

This Reference Manual output has not been verified, and may contain omissions or errors. Report any problems on the tracking issue

1/3

[This subclause introduces a language-defined package to do asynchronous suspend/resume on tasks. It uses a conceptual held priority value to represent the task's held state.]

Static Semantics​

2

The following language-defined library package exists:

3/5
with Ada.Task_Identification;
package Ada.Asynchronous_Task_Control 
  with  Preelaborate, Nonblocking, Global => in out synchronized is 
  procedure Hold(T : in Ada.Task_Identification.Task_Id);
  procedure Continue(T : in Ada.Task_Identification.Task_Id);
  function Is_Held(T : Ada.Task_Identification.Task_Id)
   return Boolean;
end Ada.Asynchronous_Task_Control;

Dynamic Semantics​

4/2

After the Hold operation has been applied to a task, the task becomes held. For each processor there is a conceptual idle task, which is always ready. The base priority of the idle task is below System.Any_Priority'First. The held priority is a constant of the type Integer whose value is below the base priority of the idle task.

4.a
discussion
The held state should not be confused with the blocked state as defined in 9.2; the task is still ready.
4.1/2

For any priority below System.Any_Priority'First, the task dispatching policy is FIFO_Within_Priorities.

4.b/2
note
To be honest: This applies even if a Task_Dispatching_Policy specifies the policy for all of the priorities of the partition.
4.c/2
ramification
A task at the held priority never runs, so it is not necessary to implement FIFO_Within_Priorities for systems that have only one policy (such as EDF_Across_Priorities).
5/2

The Hold operation sets the state of T to held. For a held task, the active priority is reevaluated as if the base priority of the task were the held priority.

5.a
ramification
For example, if T is currently inheriting priorities from other sources (e.g. it is executing in a protected action), its active priority does not change, and it continues to execute until it leaves the protected action.
6/2

The Continue operation resets the state of T to not-held; its active priority is then reevaluated as determined by the task dispatching policy associated with its base priority.

7

The Is_Held function returns True if and only if T is in the held state.

7.a
discussion
Note that the state of T can be changed immediately after Is_Held returns.
8

As part of these operations, a check is made that the task identified by T is not terminated. Tasking_Error is raised if the check fails. Program_Error is raised if the value of T is Null_Task_Id.

Erroneous Execution​

9

If any operation in this package is called with a parameter T that specifies a task object that no longer exists, the execution of the program is erroneous.

Implementation Permissions​

10/5

An implementation may omit support for Asynchronous_Task_Control if it is infeasible to support it in the target environment.

10.a
reason
A direct implementation of the Asynchronous_Task_Control semantics using priorities is not necessarily efficient enough. Thus, we envision implementations that use some other mechanism to set the “held” state. If there is no other such mechanism, support for Asynchronous_Task_Control might be infeasible, because an implementation in terms of priority would require one idle task per processor. On some systems, programs are not supposed to know how many processors are available, so creating enough idle tasks would be problematic.
11
note
NOTE 1 It is a consequence of the priority rules that held tasks cannot be dispatched on any processor in a partition (unless they are inheriting priorities) since their priorities are defined to be below the priority of any idle task.
12
note
NOTE 2 The effect of calling Get_Priority and Set_Priority on a Held task is the same as on any other task.
13
note
NOTE 3 Calling Hold on a held task or Continue on a non-held task has no effect.
14
note
NOTE 4 The rules affecting queuing are derived from the above rules, in addition to the normal priority rules:
15
  • When a held task is on the ready queue, its priority is so low as to never reach the top of the queue as long as there are other tasks on that queue.
    • 16
  • If a task is executing in a protected action, inside a rendezvous, or is inheriting priorities from other sources (e.g. when activated), it continues to execute until it is no longer executing the corresponding construct.
    • 17
  • If a task becomes held while waiting (as a caller) for a rendezvous to complete, the active priority of the accepting task is not affected.
    • 18/1
  • {8652/0077} If a task becomes held while waiting in a selective_accept, and an entry call is issued to one of the open entries, the corresponding accept_alternative executes. When the rendezvous completes, the active priority of the accepting task is lowered to the held priority (unless it is still inheriting from other sources), and the task does not execute until another Continue.
    • 19
  • The same holds if the held task is the only task on a protected entry queue whose barrier becomes open. The corresponding entry body executes.

Extensions to Ada 95​

19.a/2
note
Asynchronous_Task_Control is now Preelaborated, so it can be used in preelaborated units.

Wording Changes from Ada 95​

19.b/2
note
{8652/0077} Corrigendum: Corrected to eliminate the use of the undefined term “accept body”.
19.c/2
note
The description of held tasks was changed to reflect that the calculation of active priorities depends on the dispatching policy of the base priority. Thus, the policy of the held priority was specified in order to avoid surprises (especially when using the EDF policy).