blob: edf24836d79f8ec467dafe9ca7eacbb3786acc84 (
plain)
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
|
/**
* \file
* \brief ThreadList class header
*
* \author Copyright (C) 2014-2015 Kamil Szczygiel http://www.distortec.com http://www.freddiechopin.info
*
* \par License
* This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not
* distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#ifndef INCLUDE_DISTORTOS_INTERNAL_SCHEDULER_THREADLIST_HPP_
#define INCLUDE_DISTORTOS_INTERNAL_SCHEDULER_THREADLIST_HPP_
#include "distortos/internal/scheduler/ThreadListNode.hpp"
#include "estd/SortedIntrusiveList.hpp"
namespace distortos
{
namespace internal
{
class ThreadControlBlock;
/// functor which gives descending effective priority order of elements on the list
struct ThreadDescendingEffectivePriority
{
/**
* \brief ThreadDescendingEffectivePriority's constructor
*/
constexpr ThreadDescendingEffectivePriority()
{
}
/**
* \brief ThreadDescendingEffectivePriority's function call operator
*
* \param [in] left is the object on the left-hand side of comparison
* \param [in] right is the object on the right-hand side of comparison
*
* \return true if left's effective priority is less than right's effective priority
*/
bool operator()(const ThreadListNode& left, const ThreadListNode& right) const
{
return left.getEffectivePriority() < right.getEffectivePriority();
}
};
/// sorted intrusive list of threads (thread control blocks)
class ThreadList : public estd::SortedIntrusiveList<ThreadDescendingEffectivePriority, ThreadListNode,
&ThreadListNode::threadListNode, ThreadControlBlock>
{
};
} // namespace internal
} // namespace distortos
#endif // INCLUDE_DISTORTOS_INTERNAL_SCHEDULER_THREADLIST_HPP_
|
