Ada Conformity Assessment Authority      Home Conformity Assessment   Test Suite ARGAda Standard
 
Ada Reference ManualLegal Information
Contents   Index   References   Search   Previous   Next 

D.5.1 Dynamic Priorities for Tasks

1/3
This subclause describes how the base priority of a task can be modified or queried at run time. 

Static Semantics

2
The following language-defined library package exists: 
3/2
with System;
with Ada.Task_Identification; -- See C.7.1
package Ada.Dynamic_Priorities is
    pragma Preelaborate(Dynamic_Priorities);
4
    procedure Set_Priority(Priority : in System.Any_Priority;
                           T : in Ada.Task_Identification.Task_Id :=
                           Ada.Task_Identification.Current_Task);
5
    function Get_Priority (T : Ada.Task_Identification.Task_Id :=
                           Ada.Task_Identification.Current_Task)
                           return System.Any_Priority;
6
end Ada.Dynamic_Priorities;

Dynamic Semantics

7
The procedure Set_Priority sets the base priority of the specified task to the specified Priority value. Set_Priority has no effect if the task is terminated.
8
The function Get_Priority returns T's current base priority. Tasking_Error is raised if the task is terminated. 
9
Program_Error is raised by Set_Priority and Get_Priority if T is equal to Null_Task_Id.
10/2
 On a system with a single processor, the setting of the base priority of a task T to the new value occurs immediately at the first point when T is outside the execution of a protected action.
Paragraph 11 was deleted. 

Erroneous Execution

12
If any subprogram 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. 

Documentation Requirements

12.1/2
   On a multiprocessor, the implementation shall document any conditions that cause the completion of the setting of the priority of a task to be delayed later than what is specified for a single processor. 

Metrics

13
The implementation shall document the following metric: 
14
The execution time of a call to Set_Priority, for the nonpreempting case, in processor clock cycles. This is measured for a call that modifies the priority of a ready task that is not running (which cannot be the calling one), where the new base priority of the affected task is lower than the active priority of the calling task, and the affected task is not on any entry queue and is not executing a protected operation. 
NOTES
15/2
26  Setting a task's base priority affects task dispatching. First, it can change the task's active priority. Second, under the FIFO_Within_Priorities policy it always causes the task to move to the tail of the ready queue corresponding to its active priority, even if the new base priority is unchanged.
16
27  Under the priority queuing policy, setting a task's base priority has an effect on a queued entry call if the task is blocked waiting for the call. That is, setting the base priority of a task causes the priority of a queued entry call from that task to be updated and the call to be removed and then reinserted in the entry queue at the new priority (see D.4), unless the call originated from the triggering_statement of an asynchronous_select.
17
28  The effect of two or more Set_Priority calls executed in parallel on the same task is defined as executing these calls in some serial order.
18/3
29  The rule for when Tasking_Error is raised for Set_Priority or Get_Priority is different from the rule for when Tasking_Error is raised on an entry call (see 9.5.3). In particular, querying the priority of a completed or an abnormal task is allowed, so long as the task is not yet terminated, and setting the priority of a task is allowed for any task state (including for terminated tasks).
19
30  Changing the priorities of a set of tasks can be performed by a series of calls to Set_Priority for each task separately. For this to work reliably, it should be done within a protected operation that has high enough ceiling priority to guarantee that the operation completes without being preempted by any of the affected tasks.

Contents   Index   References   Search   Previous   Next 
Ada-Europe Ada 2005 and 2012 Editions sponsored in part by Ada-Europe