OLD | NEW |
| (Empty) |
1 // Copyright 2014 The Chromium Authors. All rights reserved. | |
2 // Use of this source code is governed by a BSD-style license that can be | |
3 // found in the LICENSE file. | |
4 | |
5 #include "cc/resources/bitmap_raster_worker_pool.h" | |
6 | |
7 #include <algorithm> | |
8 | |
9 #include "base/debug/trace_event.h" | |
10 #include "base/debug/trace_event_argument.h" | |
11 #include "base/strings/stringprintf.h" | |
12 #include "cc/debug/traced_value.h" | |
13 #include "cc/resources/raster_buffer.h" | |
14 #include "cc/resources/raster_source.h" | |
15 #include "cc/resources/resource.h" | |
16 | |
17 namespace cc { | |
18 namespace { | |
19 | |
20 class RasterBufferImpl : public RasterBuffer { | |
21 public: | |
22 RasterBufferImpl(ResourceProvider* resource_provider, | |
23 const Resource* resource) | |
24 : lock_(resource_provider, resource->id()), resource_(resource) {} | |
25 | |
26 // Overridden from RasterBuffer: | |
27 void Playback(const RasterSource* raster_source, | |
28 const gfx::Rect& rect, | |
29 float scale) override { | |
30 RasterWorkerPool::PlaybackToMemory(lock_.sk_bitmap().getPixels(), | |
31 resource_->format(), resource_->size(), | |
32 0, raster_source, rect, scale); | |
33 } | |
34 | |
35 private: | |
36 ResourceProvider::ScopedWriteLockSoftware lock_; | |
37 const Resource* resource_; | |
38 | |
39 DISALLOW_COPY_AND_ASSIGN(RasterBufferImpl); | |
40 }; | |
41 | |
42 } // namespace | |
43 | |
44 // static | |
45 scoped_ptr<RasterWorkerPool> BitmapRasterWorkerPool::Create( | |
46 base::SequencedTaskRunner* task_runner, | |
47 TaskGraphRunner* task_graph_runner, | |
48 ResourceProvider* resource_provider) { | |
49 return make_scoped_ptr<RasterWorkerPool>(new BitmapRasterWorkerPool( | |
50 task_runner, task_graph_runner, resource_provider)); | |
51 } | |
52 | |
53 BitmapRasterWorkerPool::BitmapRasterWorkerPool( | |
54 base::SequencedTaskRunner* task_runner, | |
55 TaskGraphRunner* task_graph_runner, | |
56 ResourceProvider* resource_provider) | |
57 : task_runner_(task_runner), | |
58 task_graph_runner_(task_graph_runner), | |
59 namespace_token_(task_graph_runner->GetNamespaceToken()), | |
60 resource_provider_(resource_provider), | |
61 raster_finished_weak_ptr_factory_(this) { | |
62 } | |
63 | |
64 BitmapRasterWorkerPool::~BitmapRasterWorkerPool() { | |
65 } | |
66 | |
67 Rasterizer* BitmapRasterWorkerPool::AsRasterizer() { | |
68 return this; | |
69 } | |
70 | |
71 void BitmapRasterWorkerPool::SetClient(RasterizerClient* client) { | |
72 client_ = client; | |
73 } | |
74 | |
75 void BitmapRasterWorkerPool::Shutdown() { | |
76 TRACE_EVENT0("cc", "BitmapRasterWorkerPool::Shutdown"); | |
77 | |
78 TaskGraph empty; | |
79 task_graph_runner_->ScheduleTasks(namespace_token_, &empty); | |
80 task_graph_runner_->WaitForTasksToFinishRunning(namespace_token_); | |
81 } | |
82 | |
83 void BitmapRasterWorkerPool::ScheduleTasks(RasterTaskQueue* queue) { | |
84 TRACE_EVENT0("cc", "BitmapRasterWorkerPool::ScheduleTasks"); | |
85 | |
86 if (raster_pending_.none()) | |
87 TRACE_EVENT_ASYNC_BEGIN0("cc", "ScheduledTasks", this); | |
88 | |
89 // Mark all task sets as pending. | |
90 raster_pending_.set(); | |
91 | |
92 unsigned priority = kRasterTaskPriorityBase; | |
93 | |
94 graph_.Reset(); | |
95 | |
96 // Cancel existing OnRasterFinished callbacks. | |
97 raster_finished_weak_ptr_factory_.InvalidateWeakPtrs(); | |
98 | |
99 scoped_refptr<RasterizerTask> new_raster_finished_tasks[kNumberOfTaskSets]; | |
100 | |
101 size_t task_count[kNumberOfTaskSets] = {0}; | |
102 | |
103 for (TaskSet task_set = 0; task_set < kNumberOfTaskSets; ++task_set) { | |
104 new_raster_finished_tasks[task_set] = CreateRasterFinishedTask( | |
105 task_runner_.get(), | |
106 base::Bind(&BitmapRasterWorkerPool::OnRasterFinished, | |
107 raster_finished_weak_ptr_factory_.GetWeakPtr(), | |
108 task_set)); | |
109 } | |
110 | |
111 for (RasterTaskQueue::Item::Vector::const_iterator it = queue->items.begin(); | |
112 it != queue->items.end(); | |
113 ++it) { | |
114 const RasterTaskQueue::Item& item = *it; | |
115 RasterTask* task = item.task; | |
116 DCHECK(!task->HasCompleted()); | |
117 | |
118 for (TaskSet task_set = 0; task_set < kNumberOfTaskSets; ++task_set) { | |
119 if (!item.task_sets[task_set]) | |
120 continue; | |
121 | |
122 ++task_count[task_set]; | |
123 | |
124 graph_.edges.push_back( | |
125 TaskGraph::Edge(task, new_raster_finished_tasks[task_set].get())); | |
126 } | |
127 | |
128 InsertNodesForRasterTask(&graph_, task, task->dependencies(), priority++); | |
129 } | |
130 | |
131 for (TaskSet task_set = 0; task_set < kNumberOfTaskSets; ++task_set) { | |
132 InsertNodeForTask(&graph_, | |
133 new_raster_finished_tasks[task_set].get(), | |
134 kRasterFinishedTaskPriority, | |
135 task_count[task_set]); | |
136 } | |
137 | |
138 ScheduleTasksOnOriginThread(this, &graph_); | |
139 task_graph_runner_->ScheduleTasks(namespace_token_, &graph_); | |
140 | |
141 std::copy(new_raster_finished_tasks, | |
142 new_raster_finished_tasks + kNumberOfTaskSets, | |
143 raster_finished_tasks_); | |
144 | |
145 TRACE_EVENT_ASYNC_STEP_INTO1( | |
146 "cc", "ScheduledTasks", this, "rasterizing", "state", StateAsValue()); | |
147 } | |
148 | |
149 void BitmapRasterWorkerPool::CheckForCompletedTasks() { | |
150 TRACE_EVENT0("cc", "BitmapRasterWorkerPool::CheckForCompletedTasks"); | |
151 | |
152 task_graph_runner_->CollectCompletedTasks(namespace_token_, | |
153 &completed_tasks_); | |
154 for (Task::Vector::const_iterator it = completed_tasks_.begin(); | |
155 it != completed_tasks_.end(); | |
156 ++it) { | |
157 RasterizerTask* task = static_cast<RasterizerTask*>(it->get()); | |
158 | |
159 task->WillComplete(); | |
160 task->CompleteOnOriginThread(this); | |
161 task->DidComplete(); | |
162 | |
163 task->RunReplyOnOriginThread(); | |
164 } | |
165 completed_tasks_.clear(); | |
166 } | |
167 | |
168 scoped_ptr<RasterBuffer> BitmapRasterWorkerPool::AcquireBufferForRaster( | |
169 const Resource* resource) { | |
170 return make_scoped_ptr<RasterBuffer>( | |
171 new RasterBufferImpl(resource_provider_, resource)); | |
172 } | |
173 | |
174 void BitmapRasterWorkerPool::ReleaseBufferForRaster( | |
175 scoped_ptr<RasterBuffer> buffer) { | |
176 // Nothing to do here. RasterBufferImpl destructor cleans up after itself. | |
177 } | |
178 | |
179 void BitmapRasterWorkerPool::OnRasterFinished(TaskSet task_set) { | |
180 TRACE_EVENT1( | |
181 "cc", "BitmapRasterWorkerPool::OnRasterFinished", "task_set", task_set); | |
182 | |
183 DCHECK(raster_pending_[task_set]); | |
184 raster_pending_[task_set] = false; | |
185 if (raster_pending_.any()) { | |
186 TRACE_EVENT_ASYNC_STEP_INTO1( | |
187 "cc", "ScheduledTasks", this, "rasterizing", "state", StateAsValue()); | |
188 } else { | |
189 TRACE_EVENT_ASYNC_END0("cc", "ScheduledTasks", this); | |
190 } | |
191 client_->DidFinishRunningTasks(task_set); | |
192 } | |
193 | |
194 scoped_refptr<base::debug::ConvertableToTraceFormat> | |
195 BitmapRasterWorkerPool::StateAsValue() const { | |
196 scoped_refptr<base::debug::TracedValue> state = | |
197 new base::debug::TracedValue(); | |
198 | |
199 state->BeginArray("tasks_pending"); | |
200 for (TaskSet task_set = 0; task_set < kNumberOfTaskSets; ++task_set) | |
201 state->AppendBoolean(raster_pending_[task_set]); | |
202 state->EndArray(); | |
203 return state; | |
204 } | |
205 | |
206 } // namespace cc | |
OLD | NEW |