diff options
author | Sebastian Huber <sebastian.huber@embedded-brains.de> | 2014-05-14 13:50:48 +0200 |
---|---|---|
committer | Sebastian Huber <sebastian.huber@embedded-brains.de> | 2014-05-15 12:18:44 +0200 |
commit | f39f667a69cf5c4bc0dd4555537615022767f0f9 (patch) | |
tree | f8a48b3c7bf443001b036ddcab6ed104210e6134 /cpukit/score/include/rtems/score/schedulersmp.h | |
parent | score: Add and use _Scheduler_Get_context() (diff) | |
download | rtems-f39f667a69cf5c4bc0dd4555537615022767f0f9.tar.bz2 |
score: Simplify _Thread_Change_priority()
The function to change a thread priority was too complex. Simplify it
with a new scheduler operation. This increases the average case
performance due to the simplified logic. The interrupt disabled
critical section is a bit prolonged since now the extract, update and
enqueue steps are executed atomically. This should however not impact
the worst-case interrupt latency since at least for the Deterministic
Priority Scheduler this sequence can be carried out with a wee bit of
instructions and no loops.
Add _Scheduler_Change_priority() to replace the sequence of
- _Thread_Set_transient(),
- _Scheduler_Extract(),
- _Scheduler_Enqueue(), and
- _Scheduler_Enqueue_first().
Delete STATES_TRANSIENT, _States_Is_transient() and
_Thread_Set_transient() since this state is now superfluous.
With this change it is possible to get rid of the
SCHEDULER_SMP_NODE_IN_THE_AIR state. This considerably simplifies the
implementation of the new SMP locking protocols.
Diffstat (limited to 'cpukit/score/include/rtems/score/schedulersmp.h')
-rw-r--r-- | cpukit/score/include/rtems/score/schedulersmp.h | 21 |
1 files changed, 3 insertions, 18 deletions
diff --git a/cpukit/score/include/rtems/score/schedulersmp.h b/cpukit/score/include/rtems/score/schedulersmp.h index ee1b087ff8..db8798dcd0 100644 --- a/cpukit/score/include/rtems/score/schedulersmp.h +++ b/cpukit/score/include/rtems/score/schedulersmp.h @@ -69,8 +69,8 @@ typedef enum { * * A scheduler node is scheduled if the corresponding thread is ready and the * scheduler allocated a processor for it. A scheduled node is assigned to - * exactly one processor. The sum of scheduled and in the air nodes equals - * the processor count owned by a scheduler instance. + * exactly one processor. The count of scheduled nodes in this scheduler + * instance equals the processor count owned by the scheduler instance. */ SCHEDULER_SMP_NODE_SCHEDULED, @@ -80,22 +80,7 @@ typedef enum { * A scheduler node is ready if the corresponding thread is ready and the * scheduler did not allocate a processor for it. */ - SCHEDULER_SMP_NODE_READY, - - /** - * @brief This scheduler node is in the air. - * - * A scheduled node is in the air if it has an allocated processor and the - * corresponding thread is in a transient state. Such a node is not an - * element of the set of scheduled nodes. The extract operation on a - * scheduled node will produce a scheduler node in the air (see also - * _Thread_Set_transient()). The next enqueue or schedule operation will - * decide what to do based on this state indication. It can either place the - * scheduler node back on the set of scheduled nodes and the thread can keep - * its allocated processor, or it can take the processor away from the thread - * and give the processor to another thread of higher priority. - */ - SCHEDULER_SMP_NODE_IN_THE_AIR + SCHEDULER_SMP_NODE_READY } Scheduler_SMP_Node_state; /** |