summaryrefslogtreecommitdiffstats
path: root/cpukit/score/src/threadrotatequeue.c
blob: f7ee9c12f51534a1fa0a247d067681cbc4756cb0 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/*
 *  Thread Handler
 *
 *
 *  COPYRIGHT (c) 1989-1998.
 *  On-Line Applications Research Corporation (OAR).
 *  Copyright assigned to U.S. Government, 1994.
 *
 *  The license and distribution terms for this file may be
 *  found in found in the file LICENSE in this distribution or at
 *  http://www.OARcorp.com/rtems/license.html.
 *
 *  $Id$
 */

#include <rtems/system.h>
#include <rtems/score/apiext.h>
#include <rtems/score/context.h>
#include <rtems/score/interr.h>
#include <rtems/score/isr.h>
#include <rtems/score/object.h>
#include <rtems/score/priority.h>
#include <rtems/score/states.h>
#include <rtems/score/sysstate.h>
#include <rtems/score/thread.h>
#include <rtems/score/threadq.h>
#include <rtems/score/userext.h>
#include <rtems/score/wkspace.h>

/*PAGE
 *
 *  _Thread_Rotate_Ready_Queue
 *
 *  This kernel routine will rotate the ready queue.
 *  remove the running THREAD from the ready chain
 *  and place it immediatly at the rear of this chain.  Reset timeslice
 *  and yield the processor functions both use this routine, therefore if
 *  reset is TRUE and this is the only thread on the chain then the
 *  timeslice counter is reset.  The heir THREAD will be updated if the
 *  running is also the currently the heir.
 *
 *  Input parameters:  
 *      Priority of the queue we wish to modify.
 *
 *  Output parameters:  NONE
 *
 *  INTERRUPT LATENCY:
 *    ready chain
 *    select heir
 */

void _Thread_Rotate_Ready_Queue( 
  Priority_Control  priority
)
{
  ISR_Level       level;
  Thread_Control *executing;
  Chain_Control  *ready;
  Chain_Node     *node;

  ready     = &_Thread_Ready_chain[ priority ];
  executing = _Thread_Executing;

  if ( ready == executing->ready ) {
    _Thread_Yield_processor();
    return;
  }

  _ISR_Disable( level );

  if ( !_Chain_Is_empty( ready ) ) {
    if (!_Chain_Has_only_one_node( ready ) ) {
      node = _Chain_Get_first_unprotected( ready );
      _Chain_Append_unprotected( ready, node );
    }
  }

  _ISR_Flash( level );

  if ( _Thread_Heir->ready == ready )
    _Thread_Heir = (Thread_Control *) ready->first;

  if ( executing != _Thread_Heir )
    _Context_Switch_necessary = TRUE;

  _ISR_Enable( level );
}