CVS difference for ais/ai-00321.txt

Differences between 1.5 and version 1.6
Log of other versions for file ais/ai-00321.txt

--- ais/ai-00321.txt	2003/07/03 04:37:47	1.5
+++ ais/ai-00321.txt	2003/12/07 05:00:33	1.6
@@ -1,4 +1,4 @@
-!standard D.02    (01)                                 03-07-02  AI95-00321/04
+!standard D.02    (01)                                 03-12-03  AI95-00321/05
 !standard D.02.01 (01)
 !standard D.02.01 (02)
 !standard D.02.01 (04)
@@ -29,7 +29,7 @@
 !standard D.02.03 (01)
 !class amendment 03-01-07
 !status Amendment 200Y 03-07-02
-!status ARG Approved 13-0-0  03-07-02
+!status ARG Approved 13-0-0  03-06-23
 !status work item 03-01-07
 !status received 03-01-07
 !priority Medium
@@ -58,11 +58,11 @@
 
 !proposal
 
-The solution is to restructure the entire clause into a number of clauses:
-the basic task dispatching model; the pragma Task_Dispatching_Policy; and
-the specific policy FIFO_Within_Priorities. In so doing, we separate rules
-which are common to all task dispatching policies from rules for a specific
-policy.
+The solution is to restructure clauses D.2.1 and D.2.2 into a
+number of clauses: the basic task dispatching model; the pragma
+Task_Dispatching_Policy; and the specific policy FIFO_Within_Priorities. In so
+doing, we separate rules which are common to all task dispatching policies from
+rules for a specific policy.
 
 For the detailed changes, see the !wording section.
 
@@ -95,6 +95,8 @@
 execution on a processor. This selection is done at certain points during the
 execution of a task called task dispatching points. A task reaches a task
 dispatching point whenever it becomes blocked, and when it terminates.
+Other task dispatching points are defined throughout this Annex for specific
+policies.
 
      Task dispatching policies are specified in terms of conceptual ready
 queues and task states. A ready queue is an ordered list of
@@ -122,13 +124,13 @@
 
      An implementation is allowed to define additional resources as execution
 resources, and to define the corresponding allocation policies for them. Such
-resources may have an implementation defined effect on task dispatching.
+resources may have an implementation-defined effect on task dispatching.
 
      An implementation may place implementation-defined restrictions on tasks
 whose active priority is in the Interrupt_Priority range.
 
     For optimization purposes, an implementation may alter the points at
-which task dispatching occurs, in an implementation defined manner. However, a
+which task dispatching occurs, in an implementation-defined manner. However, a
 delay_statement always corresponds to at least one task dispatching point.
 
       NOTES
@@ -158,10 +160,10 @@
       queue, as well as those with separate dispatching domains.
 
       12  The priority of a task is determined by rules specified in this
-      subclause, and under D.1, ``Task Priorities'', D.3, ``
-      Priority Ceiling Locking'', and D.5, ``Dynamic Priorities''.
+      subclause, and under D.1, ``Task Priorities'', D.3, ``Priority Ceiling
+      Locking'', and D.5, ``Dynamic Priorities''.
 
-      14  The setting of a task's base priority as a result of a call to
+      13  The setting of a task's base priority as a result of a call to
       Set_Priority does not always take effect immediately when Set_Priority
       is called. The effect of setting the task's base priority is deferred
       while the affected task performs a protected action.
@@ -266,7 +268,7 @@
 
       NOTES
 
-      13  If the active priority of a running task is lowered due to loss of
+      14  If the active priority of a running task is lowered due to loss of
       inherited priority (as it is on completion of a protected operation) and
       there is a ready task of the same active priority that is not running,
       the running task continues to run (provided that there is no higher
@@ -287,10 +289,7 @@
 
 !discussion
 
-The above rearrangements have moved all references to preemption to
-D.2.3 (as requested at the last meeting). Also a separate section
-for the pragma is defined (again as requested). No other intended
-changes.
+This AI does not intend to make any change to the semantics of Ada 95 features.
 
 The inclusion of 'completion of an accept_statement (see 9.5.2),' in D.2.1(4)
 was redundant for preemptive policies, and ruled out nonpreemptive policies. It
@@ -354,6 +353,8 @@
 execution on a processor. This selection is done at certain points during the
 execution of a task called @i<task dispatching points>. A task reaches a task
 dispatching point whenever it becomes blocked, and when it terminates.
+Other task dispatching points are defined throughout this Annex for specific
+policies.
 
 !corrigendum D.2.1(05)
 
@@ -385,13 +386,13 @@
 !corrigendum D.2.1(06)
 
 @drepl
-Each processor also has one running task, which is the task currently being
+Each processor also has one @i<running task>, which is the task currently being
 executed by that processor. Whenever a task running on a processor reaches a
 task dispatching point, one task is selected to run on that processor. The task
 selected is the one at the head of the highest priority nonempty ready queue;
 this task is then removed from all ready queues to which it belongs.
 @dby
-Each processor also has one running task, which is the task currently being
+Each processor also has one @i<running task>, which is the task currently being
 executed by that processor. Whenever a task running on a processor reaches a
 task dispatching point it goes back to one or more ready queues; a task
 (possibly the same task) is then selected to run on that processor. The task
@@ -426,7 +427,7 @@
 @dby
 An implementation is allowed to define additional resources as execution
 resources, and to define the corresponding allocation policies for them. Such
-resources may have an implementation defined effect on task dispatching.
+resources may have an implementation-defined effect on task dispatching.
 
 !corrigendum D.2.1(10)
 
@@ -435,7 +436,7 @@
 active priority is in the Interrupt_Priority range.
 @dinst
 For optimization purposes, an implementation may alter the points at
-which task dispatching occurs, in an implementation defined manner. However, a
+which task dispatching occurs, in an implementation-defined manner. However, a
 @fa<delay_statement> always corresponds to at least one task dispatching point.
 
 !corrigendum D.2.1(16)

Questions? Ask the ACAA Technical Agent