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.
5 #include "cc/raster/tile_task_worker_pool.h"
9 #include "base/trace_event/trace_event.h"
10 #include "cc/playback/raster_source.h"
11 #include "skia/ext/refptr.h"
12 #include "third_party/skia/include/core/SkCanvas.h"
13 #include "third_party/skia/include/core/SkSurface.h"
18 class TaskSetFinishedTaskImpl
: public TileTask
{
20 explicit TaskSetFinishedTaskImpl(
21 base::SequencedTaskRunner
* task_runner
,
22 const base::Closure
& on_task_set_finished_callback
)
23 : task_runner_(task_runner
),
24 on_task_set_finished_callback_(on_task_set_finished_callback
) {}
26 // Overridden from Task:
27 void RunOnWorkerThread() override
{
28 TRACE_EVENT0("cc", "TaskSetFinishedTaskImpl::RunOnWorkerThread");
32 // Overridden from TileTask:
33 void ScheduleOnOriginThread(TileTaskClient
* client
) override
{}
34 void CompleteOnOriginThread(TileTaskClient
* client
) override
{}
35 void RunReplyOnOriginThread() override
{}
38 ~TaskSetFinishedTaskImpl() override
{}
40 void TaskSetFinished() {
41 task_runner_
->PostTask(FROM_HERE
, on_task_set_finished_callback_
);
45 scoped_refptr
<base::SequencedTaskRunner
> task_runner_
;
46 const base::Closure on_task_set_finished_callback_
;
48 DISALLOW_COPY_AND_ASSIGN(TaskSetFinishedTaskImpl
);
53 // This allows a micro benchmark system to run tasks with highest priority,
54 // since it should finish as quickly as possible.
55 unsigned TileTaskWorkerPool::kBenchmarkTaskPriority
= 0u;
56 // Task priorities that make sure task set finished tasks run before any
57 // other remaining tasks. This is combined with the task set type to ensure
58 // proper prioritization ordering between task set types.
59 unsigned TileTaskWorkerPool::kTaskSetFinishedTaskPriorityBase
= 1u;
60 // For correctness, |kTileTaskPriorityBase| must be greater than
61 // |kTaskSetFinishedTaskPriorityBase + kNumberOfTaskSets|.
62 unsigned TileTaskWorkerPool::kTileTaskPriorityBase
= 10u;
64 TileTaskWorkerPool::TileTaskWorkerPool() {
67 TileTaskWorkerPool::~TileTaskWorkerPool() {
71 scoped_refptr
<TileTask
> TileTaskWorkerPool::CreateTaskSetFinishedTask(
72 base::SequencedTaskRunner
* task_runner
,
73 const base::Closure
& on_task_set_finished_callback
) {
74 return make_scoped_refptr(
75 new TaskSetFinishedTaskImpl(task_runner
, on_task_set_finished_callback
));
79 void TileTaskWorkerPool::ScheduleTasksOnOriginThread(TileTaskClient
* client
,
81 TRACE_EVENT0("cc", "TileTaskWorkerPool::ScheduleTasksOnOriginThread");
83 for (TaskGraph::Node::Vector::iterator it
= graph
->nodes
.begin();
84 it
!= graph
->nodes
.end(); ++it
) {
85 TaskGraph::Node
& node
= *it
;
86 TileTask
* task
= static_cast<TileTask
*>(node
.task
);
88 if (!task
->HasBeenScheduled()) {
90 task
->ScheduleOnOriginThread(client
);
97 void TileTaskWorkerPool::InsertNodeForTask(TaskGraph
* graph
,
100 size_t dependencies
) {
101 DCHECK(std::find_if(graph
->nodes
.begin(), graph
->nodes
.end(),
102 TaskGraph::Node::TaskComparator(task
)) ==
104 graph
->nodes
.push_back(TaskGraph::Node(task
, priority
, dependencies
));
108 void TileTaskWorkerPool::InsertNodesForRasterTask(
110 RasterTask
* raster_task
,
111 const ImageDecodeTask::Vector
& decode_tasks
,
113 size_t dependencies
= 0u;
115 // Insert image decode tasks.
116 for (ImageDecodeTask::Vector::const_iterator it
= decode_tasks
.begin();
117 it
!= decode_tasks
.end(); ++it
) {
118 ImageDecodeTask
* decode_task
= it
->get();
120 // Skip if already decoded.
121 if (decode_task
->HasCompleted())
126 // Add decode task if it doesn't already exists in graph.
127 TaskGraph::Node::Vector::iterator decode_it
=
128 std::find_if(graph
->nodes
.begin(), graph
->nodes
.end(),
129 TaskGraph::Node::TaskComparator(decode_task
));
130 if (decode_it
== graph
->nodes
.end())
131 InsertNodeForTask(graph
, decode_task
, priority
, 0u);
133 graph
->edges
.push_back(TaskGraph::Edge(decode_task
, raster_task
));
136 InsertNodeForTask(graph
, raster_task
, priority
, dependencies
);
139 static bool IsSupportedPlaybackToMemoryFormat(ResourceFormat format
) {
157 void TileTaskWorkerPool::PlaybackToMemory(void* memory
,
158 ResourceFormat format
,
159 const gfx::Size
& size
,
161 const RasterSource
* raster_source
,
162 const gfx::Rect
& rect
,
164 DCHECK(IsSupportedPlaybackToMemoryFormat(format
)) << format
;
166 // Uses kPremul_SkAlphaType since the result is not known to be opaque.
168 SkImageInfo::MakeN32(size
.width(), size
.height(), kPremul_SkAlphaType
);
169 SkColorType buffer_color_type
= ResourceFormatToSkColorType(format
);
170 bool needs_copy
= buffer_color_type
!= info
.colorType();
172 // Use unknown pixel geometry to disable LCD text.
173 SkSurfaceProps
surface_props(0, kUnknown_SkPixelGeometry
);
174 if (raster_source
->CanUseLCDText()) {
175 // LegacyFontHost will get LCD text and skia figures out what type to use.
176 surface_props
= SkSurfaceProps(SkSurfaceProps::kLegacyFontHost_InitType
);
180 stride
= info
.minRowBytes();
181 DCHECK_GT(stride
, 0);
184 skia::RefPtr
<SkSurface
> surface
= skia::AdoptRef(
185 SkSurface::NewRasterDirect(info
, memory
, stride
, &surface_props
));
186 skia::RefPtr
<SkCanvas
> canvas
= skia::SharePtr(surface
->getCanvas());
187 raster_source
->PlaybackToCanvas(canvas
.get(), rect
, scale
);
191 skia::RefPtr
<SkSurface
> surface
=
192 skia::AdoptRef(SkSurface::NewRaster(info
, &surface_props
));
193 skia::RefPtr
<SkCanvas
> canvas
= skia::SharePtr(surface
->getCanvas());
194 raster_source
->PlaybackToCanvas(canvas
.get(), rect
, scale
);
196 SkImageInfo dst_info
=
197 SkImageInfo::Make(info
.width(), info
.height(), buffer_color_type
,
198 info
.alphaType(), info
.profileType());
199 // TODO(kaanb): The GL pipeline assumes a 4-byte alignment for the
200 // bitmap data. There will be no need to call SkAlign4 once crbug.com/293728
202 const size_t dst_row_bytes
= SkAlign4(dst_info
.minRowBytes());
203 DCHECK_EQ(0u, dst_row_bytes
% 4);
204 bool success
= canvas
->readPixels(dst_info
, memory
, dst_row_bytes
, 0, 0);
205 DCHECK_EQ(true, success
);