OLD | NEW |
| (Empty) |
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 | |
3 // found in the LICENSE file. | |
4 | |
5 #include "cc/resources/image_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/resource.h" | |
15 #include "third_party/skia/include/utils/SkNullCanvas.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 : resource_provider_(resource_provider), | |
25 resource_(resource), | |
26 stride_(0), | |
27 buffer_(resource_provider->MapImage(resource->id(), &stride_)) {} | |
28 | |
29 virtual ~RasterBufferImpl() { | |
30 resource_provider_->UnmapImage(resource_->id()); | |
31 | |
32 // This RasterBuffer implementation provides direct access to the memory | |
33 // used by the GPU. Read lock fences are required to ensure that we're not | |
34 // trying to map a resource that is currently in-use by the GPU. | |
35 resource_provider_->EnableReadLockFences(resource_->id()); | |
36 } | |
37 | |
38 // Overridden from RasterBuffer: | |
39 virtual skia::RefPtr<SkCanvas> AcquireSkCanvas() OVERRIDE { | |
40 if (!buffer_) | |
41 return skia::AdoptRef(SkCreateNullCanvas()); | |
42 | |
43 RasterWorkerPool::AcquireBitmapForBuffer( | |
44 &bitmap_, buffer_, resource_->format(), resource_->size(), stride_); | |
45 return skia::AdoptRef(new SkCanvas(bitmap_)); | |
46 } | |
47 virtual void ReleaseSkCanvas(const skia::RefPtr<SkCanvas>& canvas) OVERRIDE { | |
48 if (!buffer_) | |
49 return; | |
50 | |
51 RasterWorkerPool::ReleaseBitmapForBuffer( | |
52 &bitmap_, buffer_, resource_->format()); | |
53 } | |
54 | |
55 private: | |
56 ResourceProvider* resource_provider_; | |
57 const Resource* resource_; | |
58 int stride_; | |
59 uint8_t* buffer_; | |
60 SkBitmap bitmap_; | |
61 | |
62 DISALLOW_COPY_AND_ASSIGN(RasterBufferImpl); | |
63 }; | |
64 | |
65 } // namespace | |
66 | |
67 // static | |
68 scoped_ptr<RasterWorkerPool> ImageRasterWorkerPool::Create( | |
69 base::SequencedTaskRunner* task_runner, | |
70 TaskGraphRunner* task_graph_runner, | |
71 ResourceProvider* resource_provider) { | |
72 return make_scoped_ptr<RasterWorkerPool>(new ImageRasterWorkerPool( | |
73 task_runner, task_graph_runner, resource_provider)); | |
74 } | |
75 | |
76 ImageRasterWorkerPool::ImageRasterWorkerPool( | |
77 base::SequencedTaskRunner* task_runner, | |
78 TaskGraphRunner* task_graph_runner, | |
79 ResourceProvider* resource_provider) | |
80 : task_runner_(task_runner), | |
81 task_graph_runner_(task_graph_runner), | |
82 namespace_token_(task_graph_runner->GetNamespaceToken()), | |
83 resource_provider_(resource_provider), | |
84 raster_finished_weak_ptr_factory_(this) {} | |
85 | |
86 ImageRasterWorkerPool::~ImageRasterWorkerPool() {} | |
87 | |
88 Rasterizer* ImageRasterWorkerPool::AsRasterizer() { return this; } | |
89 | |
90 void ImageRasterWorkerPool::SetClient(RasterizerClient* client) { | |
91 client_ = client; | |
92 } | |
93 | |
94 void ImageRasterWorkerPool::Shutdown() { | |
95 TRACE_EVENT0("cc", "ImageRasterWorkerPool::Shutdown"); | |
96 | |
97 TaskGraph empty; | |
98 task_graph_runner_->ScheduleTasks(namespace_token_, &empty); | |
99 task_graph_runner_->WaitForTasksToFinishRunning(namespace_token_); | |
100 } | |
101 | |
102 void ImageRasterWorkerPool::ScheduleTasks(RasterTaskQueue* queue) { | |
103 TRACE_EVENT0("cc", "ImageRasterWorkerPool::ScheduleTasks"); | |
104 | |
105 if (raster_pending_.none()) | |
106 TRACE_EVENT_ASYNC_BEGIN0("cc", "ScheduledTasks", this); | |
107 | |
108 // Mark all task sets as pending. | |
109 raster_pending_.set(); | |
110 | |
111 unsigned priority = kRasterTaskPriorityBase; | |
112 | |
113 graph_.Reset(); | |
114 | |
115 // Cancel existing OnRasterFinished callbacks. | |
116 raster_finished_weak_ptr_factory_.InvalidateWeakPtrs(); | |
117 | |
118 scoped_refptr<RasterizerTask> new_raster_finished_tasks[kNumberOfTaskSets]; | |
119 | |
120 size_t task_count[kNumberOfTaskSets] = {0}; | |
121 | |
122 for (TaskSet task_set = 0; task_set < kNumberOfTaskSets; ++task_set) { | |
123 new_raster_finished_tasks[task_set] = CreateRasterFinishedTask( | |
124 task_runner_.get(), | |
125 base::Bind(&ImageRasterWorkerPool::OnRasterFinished, | |
126 raster_finished_weak_ptr_factory_.GetWeakPtr(), | |
127 task_set)); | |
128 } | |
129 | |
130 for (RasterTaskQueue::Item::Vector::const_iterator it = queue->items.begin(); | |
131 it != queue->items.end(); | |
132 ++it) { | |
133 const RasterTaskQueue::Item& item = *it; | |
134 RasterTask* task = item.task; | |
135 DCHECK(!task->HasCompleted()); | |
136 | |
137 for (TaskSet task_set = 0; task_set < kNumberOfTaskSets; ++task_set) { | |
138 if (!item.task_sets[task_set]) | |
139 continue; | |
140 | |
141 ++task_count[task_set]; | |
142 | |
143 graph_.edges.push_back( | |
144 TaskGraph::Edge(task, new_raster_finished_tasks[task_set].get())); | |
145 } | |
146 | |
147 InsertNodesForRasterTask(&graph_, task, task->dependencies(), priority++); | |
148 } | |
149 | |
150 for (TaskSet task_set = 0; task_set < kNumberOfTaskSets; ++task_set) { | |
151 InsertNodeForTask(&graph_, | |
152 new_raster_finished_tasks[task_set].get(), | |
153 kRasterFinishedTaskPriority, | |
154 task_count[task_set]); | |
155 } | |
156 | |
157 ScheduleTasksOnOriginThread(this, &graph_); | |
158 task_graph_runner_->ScheduleTasks(namespace_token_, &graph_); | |
159 | |
160 std::copy(new_raster_finished_tasks, | |
161 new_raster_finished_tasks + kNumberOfTaskSets, | |
162 raster_finished_tasks_); | |
163 | |
164 TRACE_EVENT_ASYNC_STEP_INTO1( | |
165 "cc", "ScheduledTasks", this, "rasterizing", "state", StateAsValue()); | |
166 } | |
167 | |
168 void ImageRasterWorkerPool::CheckForCompletedTasks() { | |
169 TRACE_EVENT0("cc", "ImageRasterWorkerPool::CheckForCompletedTasks"); | |
170 | |
171 task_graph_runner_->CollectCompletedTasks(namespace_token_, | |
172 &completed_tasks_); | |
173 for (Task::Vector::const_iterator it = completed_tasks_.begin(); | |
174 it != completed_tasks_.end(); | |
175 ++it) { | |
176 RasterizerTask* task = static_cast<RasterizerTask*>(it->get()); | |
177 | |
178 task->WillComplete(); | |
179 task->CompleteOnOriginThread(this); | |
180 task->DidComplete(); | |
181 | |
182 task->RunReplyOnOriginThread(); | |
183 } | |
184 completed_tasks_.clear(); | |
185 } | |
186 | |
187 scoped_ptr<RasterBuffer> ImageRasterWorkerPool::AcquireBufferForRaster( | |
188 const Resource* resource) { | |
189 // RasterBuffer implementation depends on an image having been acquired for | |
190 // the resource. | |
191 resource_provider_->AcquireImage(resource->id()); | |
192 | |
193 return make_scoped_ptr<RasterBuffer>( | |
194 new RasterBufferImpl(resource_provider_, resource)); | |
195 } | |
196 | |
197 void ImageRasterWorkerPool::ReleaseBufferForRaster( | |
198 scoped_ptr<RasterBuffer> buffer) { | |
199 // Nothing to do here. RasterBufferImpl destructor cleans up after itself. | |
200 } | |
201 | |
202 void ImageRasterWorkerPool::OnRasterFinished(TaskSet task_set) { | |
203 TRACE_EVENT1( | |
204 "cc", "ImageRasterWorkerPool::OnRasterFinished", "task_set", task_set); | |
205 | |
206 DCHECK(raster_pending_[task_set]); | |
207 raster_pending_[task_set] = false; | |
208 if (raster_pending_.any()) { | |
209 TRACE_EVENT_ASYNC_STEP_INTO1( | |
210 "cc", "ScheduledTasks", this, "rasterizing", "state", StateAsValue()); | |
211 } else { | |
212 TRACE_EVENT_ASYNC_END0("cc", "ScheduledTasks", this); | |
213 } | |
214 client_->DidFinishRunningTasks(task_set); | |
215 } | |
216 | |
217 scoped_refptr<base::debug::ConvertableToTraceFormat> | |
218 ImageRasterWorkerPool::StateAsValue() const { | |
219 scoped_refptr<base::debug::TracedValue> state = | |
220 new base::debug::TracedValue(); | |
221 | |
222 state->BeginArray("tasks_pending"); | |
223 for (TaskSet task_set = 0; task_set < kNumberOfTaskSets; ++task_set) | |
224 state->AppendBoolean(raster_pending_[task_set]); | |
225 state->EndArray(); | |
226 return state; | |
227 } | |
228 | |
229 } // namespace cc | |
OLD | NEW |