scheduler: Simplify simple scheduler

Add and use _Scheduler_simple_Insert_priority_fifo_order(),
_Scheduler_simple_Insert_priority_lifo_order(),
_Scheduler_simple_Insert_priority_fifo() and
_Scheduler_simple_Insert_priority_lifo().

1 files changed, 2 insertions, 19 deletions

diff --git a/cpukit/score/src/schedulersimplereadyqueueenqueue.c b/cpukit/score/src/schedulersimplereadyqueueenqueue.c
index ea3c2c45ec..b33512f902 100644
--- a/cpukit/score/src/schedulersimplereadyqueueenqueue.c
+++ b/cpukit/score/src/schedulersimplereadyqueueenqueue.c
@@ -28,24 +28,7 @@ void _Scheduler_simple_Ready_queue_enqueue(
   Thread_Control    *the_thread
 )
 {
-  Chain_Control    *ready;
-  Chain_Node       *the_node;
-  Thread_Control   *current;
+  Chain_Control *ready = (Chain_Control *) _Scheduler.information;
 
-  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 );
+  _Scheduler_simple_Insert_priority_fifo( ready, the_thread );
 }