forked from mozart/mozart2
-
Notifications
You must be signed in to change notification settings - Fork 0
/
threadpool-decl.hh
112 lines (92 loc) · 2.99 KB
/
threadpool-decl.hh
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
101
102
103
104
105
106
107
108
109
110
111
112
// Copyright © 2011, Université catholique de Louvain
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
#ifndef __THREADPOOL_DECL_H
#define __THREADPOOL_DECL_H
#include <queue>
#include "core-forward-decl.hh"
#include "runnable-decl.hh"
namespace mozart {
/////////////////
// ThreadQueue //
/////////////////
class ThreadQueue : public std::queue<Runnable*> {
public:
void remove(Runnable* item) {
for (auto iterator = c.begin(); iterator != c.end(); iterator++) {
if (*iterator == item) {
c.erase(iterator);
return;
}
}
}
// Implemented in gcollect.hh
inline
void gCollect(GC gc);
};
////////////////
// ThreadPool //
////////////////
const int HiToMiddlePriorityRatio = 10;
const int MiddleToLowPriorityRatio = 10;
class ThreadPool {
public:
ThreadPool() {
remainings[tpLow] = 0;
remainings[tpMiddle] = 0;
remainings[tpHi] = 0;
}
bool empty() {
// ordered from most probably non-empty too most probably empty
return empty(tpMiddle) && empty(tpHi) && empty(tpLow);
}
void schedule(Runnable* thread) {
queues[thread->getPriority()].push(thread);
}
void unschedule(Runnable* thread) {
queues[tpLow].remove(thread);
queues[tpMiddle].remove(thread);
queues[tpHi].remove(thread);
}
void reschedule(Runnable* thread) {
unschedule(thread);
schedule(thread);
}
void gCollect(GC gc) {
queues[tpLow].gCollect(gc);
queues[tpMiddle].gCollect(gc);
queues[tpHi].gCollect(gc);
}
inline
Runnable* popNext();
private:
bool empty(ThreadPriority priority) {
return queues[priority].empty();
}
inline
Runnable* popNext(ThreadPriority priority);
ThreadQueue queues[tpCount];
int remainings[tpCount];
};
}
#endif // __THREADPOOL_DECL_H