blob: 8b2480ea0aca8f473dfdd646e8d55ea74d8d8113 (
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
94
95
96
97
98
99
100
|
/**
* @file
*
* @brief Inlined Routines Associated with the Manipulation of the
* Priority-Based Scheduling Structures
*
* This inline file contains all of the inlined routines associated with
* the manipulation of the priority-based scheduling structures.
*/
/*
* 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.
*/
#ifndef _RTEMS_SCORE_SCHEDULERSIMPLE_H
# error "Never use <rtems/score/schedulersimple.inl> directly; include <rtems/score/schedulersimple.h> instead."
#endif
#ifndef _RTEMS_SCORE_SCHEDULERSIMPLE_INL
#define _RTEMS_SCORE_SCHEDULERSIMPLE_INL
#include <rtems/score/thread.h>
/**
* @addtogroup ScoreScheduler
*/
/**@{**/
/**
* This routine puts @a the_thread on to the ready queue.
*
* @param[in] the_ready_queue is a pointer to the ready queue head
* @param[in] the_thread is the thread to be blocked
*/
RTEMS_INLINE_ROUTINE void _Scheduler_simple_Ready_queue_requeue(
Scheduler_Control *the_ready_queue,
Thread_Control *the_thread
)
{
/* extract */
_Chain_Extract_unprotected( &the_thread->Object.Node );
/* enqueue */
_Scheduler_simple_Ready_queue_enqueue( the_thread );
}
RTEMS_INLINE_ROUTINE bool _Scheduler_simple_Insert_priority_lifo_order(
const Chain_Node *to_insert,
const Chain_Node *next
)
{
const Thread_Control *thread_to_insert = (const Thread_Control *) to_insert;
const Thread_Control *thread_next = (const Thread_Control *) next;
return thread_to_insert->current_priority <= thread_next->current_priority;
}
RTEMS_INLINE_ROUTINE bool _Scheduler_simple_Insert_priority_fifo_order(
const Chain_Node *to_insert,
const Chain_Node *next
)
{
const Thread_Control *thread_to_insert = (const Thread_Control *) to_insert;
const Thread_Control *thread_next = (const Thread_Control *) next;
return thread_to_insert->current_priority < thread_next->current_priority;
}
RTEMS_INLINE_ROUTINE void _Scheduler_simple_Insert_priority_lifo(
Chain_Control *chain,
Thread_Control *to_insert
)
{
_Chain_Insert_ordered_unprotected(
chain,
&to_insert->Object.Node,
_Scheduler_simple_Insert_priority_lifo_order
);
}
RTEMS_INLINE_ROUTINE void _Scheduler_simple_Insert_priority_fifo(
Chain_Control *chain,
Thread_Control *to_insert
)
{
_Chain_Insert_ordered_unprotected(
chain,
&to_insert->Object.Node,
_Scheduler_simple_Insert_priority_fifo_order
);
}
/** @} */
#endif
/* end of include file */
|
