blob: 189895c705a6463f0db5342b5753353a98787cf8 (
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
115
116
117
118
119
120
121
122
123
124
|
/*
* Copyright (C) 2013 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 <sys/sysinfo.h>
#include "Task.h"
#include "TaskProcessor.h"
#include "TaskManager.h"
namespace android {
namespace uirenderer {
///////////////////////////////////////////////////////////////////////////////
// Manager
///////////////////////////////////////////////////////////////////////////////
TaskManager::TaskManager() {
// Get the number of available CPUs. This value does not change over time.
int cpuCount = sysconf(_SC_NPROCESSORS_CONF);
for (int i = 0; i < cpuCount / 2; i++) {
String8 name;
name.appendFormat("hwuiTask%d", i + 1);
mThreads.add(new WorkerThread(name));
}
}
TaskManager::~TaskManager() {
for (size_t i = 0; i < mThreads.size(); i++) {
mThreads[i]->exit();
}
}
bool TaskManager::canRunTasks() const {
return mThreads.size() > 0;
}
void TaskManager::stop() {
for (size_t i = 0; i < mThreads.size(); i++) {
mThreads[i]->exit();
}
}
bool TaskManager::addTaskBase(const sp<TaskBase>& task, const sp<TaskProcessorBase>& processor) {
if (mThreads.size() > 0) {
TaskWrapper wrapper(task, processor);
size_t minQueueSize = INT_MAX;
sp<WorkerThread> thread;
for (size_t i = 0; i < mThreads.size(); i++) {
if (mThreads[i]->getTaskCount() < minQueueSize) {
thread = mThreads[i];
minQueueSize = mThreads[i]->getTaskCount();
}
}
return thread->addTask(wrapper);
}
return false;
}
///////////////////////////////////////////////////////////////////////////////
// Thread
///////////////////////////////////////////////////////////////////////////////
bool TaskManager::WorkerThread::threadLoop() {
mSignal.wait();
Vector<TaskWrapper> tasks;
{
Mutex::Autolock l(mLock);
tasks = mTasks;
mTasks.clear();
}
for (size_t i = 0; i < tasks.size(); i++) {
const TaskWrapper& task = tasks.itemAt(i);
task.mProcessor->process(task.mTask);
}
return true;
}
bool TaskManager::WorkerThread::addTask(TaskWrapper task) {
if (!isRunning()) {
run(mName.string(), PRIORITY_DEFAULT);
}
Mutex::Autolock l(mLock);
ssize_t index = mTasks.add(task);
mSignal.signal();
return index >= 0;
}
size_t TaskManager::WorkerThread::getTaskCount() const {
Mutex::Autolock l(mLock);
return mTasks.size();
}
void TaskManager::WorkerThread::exit() {
{
Mutex::Autolock l(mLock);
mTasks.clear();
}
requestExit();
mSignal.signal();
}
}; // namespace uirenderer
}; // namespace android
|
