blob: 6c0c30f959558ac487a91350131a6c0524d882b8 (
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
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
113
114
|
/*
* Copyright (C) 2019 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "CommonPool.h"
#include <utils/Trace.h>
#include <array>
namespace android {
namespace uirenderer {
CommonPool::CommonPool() : CommonPoolBase() {
ATRACE_CALL();
CommonPool* pool = this;
std::mutex mLock;
std::vector<int> tids(THREAD_COUNT);
std::vector<std::condition_variable> tidConditionVars(THREAD_COUNT);
// Create 2 workers
for (int i = 0; i < THREAD_COUNT; i++) {
std::thread worker([pool, i, &mLock, &tids, &tidConditionVars] {
pool->setupThread(i, mLock, tids, tidConditionVars);
pool->workerLoop();
});
worker.detach();
}
{
std::unique_lock lock(mLock);
for (int i = 0; i < THREAD_COUNT; i++) {
while (!tids[i]) {
tidConditionVars[i].wait(lock);
}
}
}
if (pool->supportsTid()) {
mWorkerThreadIds = std::move(tids);
}
}
CommonPool& CommonPool::instance() {
static CommonPool pool;
return pool;
}
void CommonPool::post(Task&& task) {
instance().enqueue(std::move(task));
}
std::vector<int> CommonPool::getThreadIds() {
return instance().mWorkerThreadIds;
}
void CommonPool::enqueue(Task&& task) {
std::unique_lock lock(mLock);
while (!mWorkQueue.hasSpace()) {
lock.unlock();
usleep(100);
lock.lock();
}
mWorkQueue.push(std::move(task));
if (mWaitingThreads == THREAD_COUNT || (mWaitingThreads > 0 && mWorkQueue.size() > 1)) {
mCondition.notify_one();
}
}
void CommonPool::workerLoop() {
std::unique_lock lock(mLock);
while (!mIsStopping) {
if (!mWorkQueue.hasWork()) {
mWaitingThreads++;
mCondition.wait(lock);
mWaitingThreads--;
}
// Need to double-check that work is still available now that we have the lock
// It may have already been grabbed by a different thread
while (mWorkQueue.hasWork()) {
auto work = mWorkQueue.pop();
lock.unlock();
work();
lock.lock();
}
}
}
void CommonPool::waitForIdle() {
instance().doWaitForIdle();
}
void CommonPool::doWaitForIdle() {
std::unique_lock lock(mLock);
while (mWaitingThreads != THREAD_COUNT) {
lock.unlock();
usleep(100);
lock.lock();
}
}
} // namespace uirenderer
} // namespace android
|