[rtems commit] score: SMP scheduler support documentation

[Sebastian Huber]

Module:    rtems
Branch:    master
Commit:    2d96533299d3c38755947dc99ac24ea80f26e660
Changeset: http://git.rtems.org/rtems/commit/?id=2d96533299d3c38755947dc99ac24ea80f26e660

Author:    Sebastian Huber <sebastian.huber at embedded-brains.de>
Date:      Tue May 20 08:06:43 2014 +0200

score: SMP scheduler support documentation

---

 .../score/include/rtems/score/schedulersmpimpl.h   |    6 +++++-
 1 files changed, 5 insertions(+), 1 deletions(-)

diff --git a/cpukit/score/include/rtems/score/schedulersmpimpl.h b/cpukit/score/include/rtems/score/schedulersmpimpl.h
index 58ad844..f58de75 100644
--- a/cpukit/score/include/rtems/score/schedulersmpimpl.h
+++ b/cpukit/score/include/rtems/score/schedulersmpimpl.h
@@ -82,7 +82,11 @@ extern "C" {
  * During system initialization each processor of the scheduler instance starts
  * with an idle thread assigned to it.  Lets have a look at an example with two
  * idle threads I and J with priority 5.  We also have blocked threads A, B and
- * C with priorities 1, 2 and 3 respectively.
+ * C with priorities 1, 2 and 3 respectively.  The scheduler nodes are ordered
+ * with respect to the thread priority from left to right in the below
+ * diagrams.  The highest priority node (lowest priority number) is the
+ * leftmost node.  Since the processor assignment is independent of the thread
+ * priority the processor indices may move from one state to the other.
  *
  * @dot
  * digraph {