2011-03-16 Jennifer Averett <jennifer.averett@OARcorp.com>

	PR 1743/cpu
	* sapi/include/confdefs.h, score/Makefile.am, score/preinstall.am: Add
	Simple Priority Scheduler as complement to existing Deterministic
	Priority Scheduler. This scheduler serves both as an example and as a
	lighter weight implementation for smaller systems.
	* score/include/rtems/score/schedulersimple.h,
	score/inline/rtems/score/schedulersimple.inl,
	score/src/schedulersimple.c, score/src/schedulersimpleblock.c,
	score/src/schedulersimpleenqueue.c,
	score/src/schedulersimpleenqueuefirst.c,
	score/src/schedulersimpleextract.c,
	score/src/schedulersimplereadyqueueenqueue.c,
	score/src/schedulersimplereadyqueueenqueuefirst.c,
	score/src/schedulersimpleschedule.c,
	score/src/schedulersimpleunblock.c, score/src/schedulersimpleyield.c:
	New files.

1 files changed, 48 insertions, 0 deletions

diff --git a/cpukit/score/src/schedulersimplereadyqueueenqueue.c b/cpukit/score/src/schedulersimplereadyqueueenqueue.c
new file mode 100644
index 0000000000..788f94b20b
--- /dev/null
+++ b/cpukit/score/src/schedulersimplereadyqueueenqueue.c
@@ -0,0 +1,48 @@
+/*
+ *  Schedule Simple Handler / Ready Queue Enqueue
+ *
+ *  COPYRIGHT (c) 2011.
+ *  On-Line Applications Research Corporation (OAR).
+ *
+ *  The license and distribution terms for this file may be
+ *  found in the file LICENSE in this distribution or at
+ *  http://www.rtems.com/license/LICENSE.
+ *
+ *  $Id$
+ */
+
+#if HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include <rtems/system.h>
+#include <rtems/score/chain.h>
+#include <rtems/score/isr.h>
+#include <rtems/score/thread.h>
+#include <rtems/score/schedulersimple.h>
+
+void _Scheduler_simple_Ready_queue_Enqueue(
+  Thread_Control    *the_thread
+)
+{
+  Chain_Control    *ready;
+  Chain_Node       *the_node;
+  Thread_Control   *current;
+
+  ready    = (Chain_Control *)_Scheduler.information;
+  the_node = _Chain_First( ready );
+  current  = (Thread_Control *)ready;
+
+  for ( ; !_Chain_Is_tail( ready, the_node ) ; the_node = the_node->next ) {
+    current = (Thread_Control *) the_node;
+
+    /* break when AT END OR PAST our priority */
+    if ( the_thread->current_priority < current->current_priority ) {
+      current = (Thread_Control *)current->Object.Node.previous;
+      break;
+    }
+  }
+
+  /* enqueue */
+  _Chain_Insert_unprotected( (Chain_Node *)current, &the_thread->Object.Node );
+}