Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(19)

Side by Side Diff: cc/resources/tile_task_worker_pool.cc

Issue 786583002: cc: Renaming Rasterizer and RasterWorkerPool interfaces (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: Fix test. Update include files alphabetic orders. Created 6 years ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
1 // Copyright 2013 The Chromium Authors. All rights reserved. 1 // Copyright 2013 The Chromium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be 2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file. 3 // found in the LICENSE file.
4 4
5 #include "cc/resources/raster_worker_pool.h" 5 #include "cc/resources/tile_task_worker_pool.h"
6 6
7 #include <algorithm> 7 #include <algorithm>
8 8
9 #include "base/debug/trace_event.h" 9 #include "base/debug/trace_event.h"
10 #include "base/lazy_instance.h" 10 #include "base/lazy_instance.h"
11 #include "base/strings/stringprintf.h" 11 #include "base/strings/stringprintf.h"
12 #include "base/threading/simple_thread.h" 12 #include "base/threading/simple_thread.h"
13 #include "cc/base/scoped_ptr_deque.h" 13 #include "cc/base/scoped_ptr_deque.h"
14 #include "cc/resources/raster_source.h" 14 #include "cc/resources/raster_source.h"
15 #include "skia/ext/refptr.h" 15 #include "skia/ext/refptr.h"
16 #include "third_party/skia/include/core/SkCanvas.h" 16 #include "third_party/skia/include/core/SkCanvas.h"
17 #include "third_party/skia/include/core/SkSurface.h" 17 #include "third_party/skia/include/core/SkSurface.h"
18 18
19 namespace cc { 19 namespace cc {
20 namespace { 20 namespace {
21 21
22 class RasterTaskGraphRunner : public TaskGraphRunner, 22 class TileTaskGraphRunner : public TaskGraphRunner,
23 public base::DelegateSimpleThread::Delegate { 23 public base::DelegateSimpleThread::Delegate {
24 public: 24 public:
25 RasterTaskGraphRunner() { 25 TileTaskGraphRunner() {
26 size_t num_threads = RasterWorkerPool::GetNumRasterThreads(); 26 size_t num_threads = TileTaskWorkerPool::GetNumWorkerThreads();
27 while (workers_.size() < num_threads) { 27 while (workers_.size() < num_threads) {
28 scoped_ptr<base::DelegateSimpleThread> worker = 28 scoped_ptr<base::DelegateSimpleThread> worker =
29 make_scoped_ptr(new base::DelegateSimpleThread( 29 make_scoped_ptr(new base::DelegateSimpleThread(
30 this, 30 this, base::StringPrintf(
31 base::StringPrintf("CompositorRasterWorker%u", 31 "CompositorTileWorker%u",
32 static_cast<unsigned>(workers_.size() + 1)) 32 static_cast<unsigned>(workers_.size() + 1)).c_str()));
33 .c_str()));
34 worker->Start(); 33 worker->Start();
35 #if defined(OS_ANDROID) || defined(OS_LINUX) 34 #if defined(OS_ANDROID) || defined(OS_LINUX)
36 worker->SetThreadPriority(base::kThreadPriority_Background); 35 worker->SetThreadPriority(base::kThreadPriority_Background);
37 #endif 36 #endif
38 workers_.push_back(worker.Pass()); 37 workers_.push_back(worker.Pass());
39 } 38 }
40 } 39 }
41 40
42 ~RasterTaskGraphRunner() override { NOTREACHED(); } 41 ~TileTaskGraphRunner() override { NOTREACHED(); }
43 42
44 private: 43 private:
45 // Overridden from base::DelegateSimpleThread::Delegate: 44 // Overridden from base::DelegateSimpleThread::Delegate:
46 void Run() override { TaskGraphRunner::Run(); } 45 void Run() override { TaskGraphRunner::Run(); }
47 46
48 ScopedPtrDeque<base::DelegateSimpleThread> workers_; 47 ScopedPtrDeque<base::DelegateSimpleThread> workers_;
49 }; 48 };
50 49
51 base::LazyInstance<RasterTaskGraphRunner>::Leaky g_task_graph_runner = 50 base::LazyInstance<TileTaskGraphRunner>::Leaky g_task_graph_runner =
52 LAZY_INSTANCE_INITIALIZER; 51 LAZY_INSTANCE_INITIALIZER;
53 52
54 const int kDefaultNumRasterThreads = 1; 53 const int kDefaultNumWorkerThreads = 1;
55 54
56 int g_num_raster_threads = 0; 55 int g_num_worker_threads = 0;
57 56
58 class RasterFinishedTaskImpl : public RasterizerTask { 57 class TaskSetFinishedTaskImpl : public TileTask {
59 public: 58 public:
60 explicit RasterFinishedTaskImpl( 59 explicit TaskSetFinishedTaskImpl(
61 base::SequencedTaskRunner* task_runner, 60 base::SequencedTaskRunner* task_runner,
62 const base::Closure& on_raster_finished_callback) 61 const base::Closure& on_task_set_finished_callback)
63 : task_runner_(task_runner), 62 : task_runner_(task_runner),
64 on_raster_finished_callback_(on_raster_finished_callback) {} 63 on_task_set_finished_callback_(on_task_set_finished_callback) {}
65 64
66 // Overridden from Task: 65 // Overridden from Task:
67 void RunOnWorkerThread() override { 66 void RunOnWorkerThread() override {
68 TRACE_EVENT0("cc", "RasterFinishedTaskImpl::RunOnWorkerThread"); 67 TRACE_EVENT0("cc", "TaskSetFinishedTaskImpl::RunOnWorkerThread");
69 RasterFinished(); 68 TaskSetFinished();
70 } 69 }
71 70
72 // Overridden from RasterizerTask: 71 // Overridden from TileTask:
73 void ScheduleOnOriginThread(RasterizerTaskClient* client) override {} 72 void ScheduleOnOriginThread(TileTaskClient* client) override {}
74 void CompleteOnOriginThread(RasterizerTaskClient* client) override {} 73 void CompleteOnOriginThread(TileTaskClient* client) override {}
75 void RunReplyOnOriginThread() override {} 74 void RunReplyOnOriginThread() override {}
76 75
77 protected: 76 protected:
78 ~RasterFinishedTaskImpl() override {} 77 ~TaskSetFinishedTaskImpl() override {}
79 78
80 void RasterFinished() { 79 void TaskSetFinished() {
81 task_runner_->PostTask(FROM_HERE, on_raster_finished_callback_); 80 task_runner_->PostTask(FROM_HERE, on_task_set_finished_callback_);
82 } 81 }
83 82
84 private: 83 private:
85 scoped_refptr<base::SequencedTaskRunner> task_runner_; 84 scoped_refptr<base::SequencedTaskRunner> task_runner_;
86 const base::Closure on_raster_finished_callback_; 85 const base::Closure on_task_set_finished_callback_;
87 86
88 DISALLOW_COPY_AND_ASSIGN(RasterFinishedTaskImpl); 87 DISALLOW_COPY_AND_ASSIGN(TaskSetFinishedTaskImpl);
89 }; 88 };
90 89
91 } // namespace 90 } // namespace
92 91
93 // This allows a micro benchmark system to run tasks with highest priority, 92 // This allows a micro benchmark system to run tasks with highest priority,
94 // since it should finish as quickly as possible. 93 // since it should finish as quickly as possible.
95 unsigned RasterWorkerPool::kBenchmarkRasterTaskPriority = 0u; 94 unsigned TileTaskWorkerPool::kBenchmarkTaskPriority = 0u;
96 // Task priorities that make sure raster finished tasks run before any 95 // Task priorities that make sure task set finished tasks run before any
97 // remaining raster tasks. 96 // other remaining tasks.
98 unsigned RasterWorkerPool::kRasterFinishedTaskPriority = 1u; 97 unsigned TileTaskWorkerPool::kTaskSetFinishedTaskPriority = 1u;
99 unsigned RasterWorkerPool::kRasterTaskPriorityBase = 2u; 98 unsigned TileTaskWorkerPool::kTileTaskPriorityBase = 2u;
100 99
101 RasterWorkerPool::RasterWorkerPool() {} 100 TileTaskWorkerPool::TileTaskWorkerPool() {
101 }
102 102
103 RasterWorkerPool::~RasterWorkerPool() {} 103 TileTaskWorkerPool::~TileTaskWorkerPool() {
104
105 // static
106 void RasterWorkerPool::SetNumRasterThreads(int num_threads) {
107 DCHECK_LT(0, num_threads);
108 DCHECK_EQ(0, g_num_raster_threads);
109
110 g_num_raster_threads = num_threads;
111 } 104 }
112 105
113 // static 106 // static
114 int RasterWorkerPool::GetNumRasterThreads() { 107 void TileTaskWorkerPool::SetNumWorkerThreads(int num_threads) {
115 if (!g_num_raster_threads) 108 DCHECK_LT(0, num_threads);
116 g_num_raster_threads = kDefaultNumRasterThreads; 109 DCHECK_EQ(0, g_num_worker_threads);
117 110
118 return g_num_raster_threads; 111 g_num_worker_threads = num_threads;
119 } 112 }
120 113
121 // static 114 // static
122 TaskGraphRunner* RasterWorkerPool::GetTaskGraphRunner() { 115 int TileTaskWorkerPool::GetNumWorkerThreads() {
116 if (!g_num_worker_threads)
117 g_num_worker_threads = kDefaultNumWorkerThreads;
118
119 return g_num_worker_threads;
120 }
121
122 // static
123 TaskGraphRunner* TileTaskWorkerPool::GetTaskGraphRunner() {
123 return g_task_graph_runner.Pointer(); 124 return g_task_graph_runner.Pointer();
124 } 125 }
125 126
126 // static 127 // static
127 scoped_refptr<RasterizerTask> RasterWorkerPool::CreateRasterFinishedTask( 128 scoped_refptr<TileTask> TileTaskWorkerPool::CreateTaskSetFinishedTask(
128 base::SequencedTaskRunner* task_runner, 129 base::SequencedTaskRunner* task_runner,
129 const base::Closure& on_raster_finished_callback) { 130 const base::Closure& on_task_set_finished_callback) {
130 return make_scoped_refptr( 131 return make_scoped_refptr(
131 new RasterFinishedTaskImpl(task_runner, on_raster_finished_callback)); 132 new TaskSetFinishedTaskImpl(task_runner, on_task_set_finished_callback));
132 } 133 }
133 134
134 // static 135 // static
135 void RasterWorkerPool::ScheduleTasksOnOriginThread(RasterizerTaskClient* client, 136 void TileTaskWorkerPool::ScheduleTasksOnOriginThread(TileTaskClient* client,
136 TaskGraph* graph) { 137 TaskGraph* graph) {
137 TRACE_EVENT0("cc", "Rasterizer::ScheduleTasksOnOriginThread"); 138 TRACE_EVENT0("cc", "TileTaskWorkerPool::ScheduleTasksOnOriginThread");
138 139
139 for (TaskGraph::Node::Vector::iterator it = graph->nodes.begin(); 140 for (TaskGraph::Node::Vector::iterator it = graph->nodes.begin();
140 it != graph->nodes.end(); 141 it != graph->nodes.end(); ++it) {
141 ++it) {
142 TaskGraph::Node& node = *it; 142 TaskGraph::Node& node = *it;
143 RasterizerTask* task = static_cast<RasterizerTask*>(node.task); 143 TileTask* task = static_cast<TileTask*>(node.task);
144 144
145 if (!task->HasBeenScheduled()) { 145 if (!task->HasBeenScheduled()) {
146 task->WillSchedule(); 146 task->WillSchedule();
147 task->ScheduleOnOriginThread(client); 147 task->ScheduleOnOriginThread(client);
148 task->DidSchedule(); 148 task->DidSchedule();
149 } 149 }
150 } 150 }
151 } 151 }
152 152
153 // static 153 // static
154 void RasterWorkerPool::InsertNodeForTask(TaskGraph* graph, 154 void TileTaskWorkerPool::InsertNodeForTask(TaskGraph* graph,
155 RasterizerTask* task, 155 TileTask* task,
156 unsigned priority, 156 unsigned priority,
157 size_t dependencies) { 157 size_t dependencies) {
158 DCHECK(std::find_if(graph->nodes.begin(), 158 DCHECK(std::find_if(graph->nodes.begin(), graph->nodes.end(),
159 graph->nodes.end(),
160 TaskGraph::Node::TaskComparator(task)) == 159 TaskGraph::Node::TaskComparator(task)) ==
161 graph->nodes.end()); 160 graph->nodes.end());
162 graph->nodes.push_back(TaskGraph::Node(task, priority, dependencies)); 161 graph->nodes.push_back(TaskGraph::Node(task, priority, dependencies));
163 } 162 }
164 163
165 // static 164 // static
166 void RasterWorkerPool::InsertNodesForRasterTask( 165 void TileTaskWorkerPool::InsertNodesForRasterTask(
167 TaskGraph* graph, 166 TaskGraph* graph,
168 RasterTask* raster_task, 167 RasterTask* raster_task,
169 const ImageDecodeTask::Vector& decode_tasks, 168 const ImageDecodeTask::Vector& decode_tasks,
170 unsigned priority) { 169 unsigned priority) {
171 size_t dependencies = 0u; 170 size_t dependencies = 0u;
172 171
173 // Insert image decode tasks. 172 // Insert image decode tasks.
174 for (ImageDecodeTask::Vector::const_iterator it = decode_tasks.begin(); 173 for (ImageDecodeTask::Vector::const_iterator it = decode_tasks.begin();
175 it != decode_tasks.end(); 174 it != decode_tasks.end(); ++it) {
176 ++it) {
177 ImageDecodeTask* decode_task = it->get(); 175 ImageDecodeTask* decode_task = it->get();
178 176
179 // Skip if already decoded. 177 // Skip if already decoded.
180 if (decode_task->HasCompleted()) 178 if (decode_task->HasCompleted())
181 continue; 179 continue;
182 180
183 dependencies++; 181 dependencies++;
184 182
185 // Add decode task if it doesn't already exists in graph. 183 // Add decode task if it doesn't already exists in graph.
186 TaskGraph::Node::Vector::iterator decode_it = 184 TaskGraph::Node::Vector::iterator decode_it =
187 std::find_if(graph->nodes.begin(), 185 std::find_if(graph->nodes.begin(), graph->nodes.end(),
188 graph->nodes.end(),
189 TaskGraph::Node::TaskComparator(decode_task)); 186 TaskGraph::Node::TaskComparator(decode_task));
190 if (decode_it == graph->nodes.end()) 187 if (decode_it == graph->nodes.end())
191 InsertNodeForTask(graph, decode_task, priority, 0u); 188 InsertNodeForTask(graph, decode_task, priority, 0u);
192 189
193 graph->edges.push_back(TaskGraph::Edge(decode_task, raster_task)); 190 graph->edges.push_back(TaskGraph::Edge(decode_task, raster_task));
194 } 191 }
195 192
196 InsertNodeForTask(graph, raster_task, priority, dependencies); 193 InsertNodeForTask(graph, raster_task, priority, dependencies);
197 } 194 }
198 195
199 static bool IsSupportedPlaybackToMemoryFormat(ResourceFormat format) { 196 static bool IsSupportedPlaybackToMemoryFormat(ResourceFormat format) {
200 switch (format) { 197 switch (format) {
201 case RGBA_4444: 198 case RGBA_4444:
202 case RGBA_8888: 199 case RGBA_8888:
203 case BGRA_8888: 200 case BGRA_8888:
204 return true; 201 return true;
205 case ALPHA_8: 202 case ALPHA_8:
206 case LUMINANCE_8: 203 case LUMINANCE_8:
207 case RGB_565: 204 case RGB_565:
208 case ETC1: 205 case ETC1:
209 case RED_8: 206 case RED_8:
210 return false; 207 return false;
211 } 208 }
212 NOTREACHED(); 209 NOTREACHED();
213 return false; 210 return false;
214 } 211 }
215 212
216 // static 213 // static
217 void RasterWorkerPool::PlaybackToMemory(void* memory, 214 void TileTaskWorkerPool::PlaybackToMemory(void* memory,
218 ResourceFormat format, 215 ResourceFormat format,
219 const gfx::Size& size, 216 const gfx::Size& size,
220 int stride, 217 int stride,
221 const RasterSource* raster_source, 218 const RasterSource* raster_source,
222 const gfx::Rect& rect, 219 const gfx::Rect& rect,
223 float scale) { 220 float scale) {
224 DCHECK(IsSupportedPlaybackToMemoryFormat(format)) << format; 221 DCHECK(IsSupportedPlaybackToMemoryFormat(format)) << format;
225 222
226 // Uses kPremul_SkAlphaType since the result is not known to be opaque. 223 // Uses kPremul_SkAlphaType since the result is not known to be opaque.
227 SkImageInfo info = 224 SkImageInfo info =
228 SkImageInfo::MakeN32(size.width(), size.height(), kPremul_SkAlphaType); 225 SkImageInfo::MakeN32(size.width(), size.height(), kPremul_SkAlphaType);
229 SkColorType buffer_color_type = ResourceFormatToSkColorType(format); 226 SkColorType buffer_color_type = ResourceFormatToSkColorType(format);
230 bool needs_copy = buffer_color_type != info.colorType(); 227 bool needs_copy = buffer_color_type != info.colorType();
231 228
232 // Use unknown pixel geometry to disable LCD text. 229 // Use unknown pixel geometry to disable LCD text.
233 SkSurfaceProps surface_props(0, kUnknown_SkPixelGeometry); 230 SkSurfaceProps surface_props(0, kUnknown_SkPixelGeometry);
(...skipping 23 matching lines...) Expand all
257 // TODO(kaanb): The GL pipeline assumes a 4-byte alignment for the 254 // TODO(kaanb): The GL pipeline assumes a 4-byte alignment for the
258 // bitmap data. There will be no need to call SkAlign4 once crbug.com/293728 255 // bitmap data. There will be no need to call SkAlign4 once crbug.com/293728
259 // is fixed. 256 // is fixed.
260 const size_t dst_row_bytes = SkAlign4(dst_info.minRowBytes()); 257 const size_t dst_row_bytes = SkAlign4(dst_info.minRowBytes());
261 DCHECK_EQ(0u, dst_row_bytes % 4); 258 DCHECK_EQ(0u, dst_row_bytes % 4);
262 bool success = canvas->readPixels(dst_info, memory, dst_row_bytes, 0, 0); 259 bool success = canvas->readPixels(dst_info, memory, dst_row_bytes, 0, 0);
263 DCHECK_EQ(true, success); 260 DCHECK_EQ(true, success);
264 } 261 }
265 262
266 } // namespace cc 263 } // namespace cc
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698