OLD | NEW |
1 // Copyright 2014 The Chromium Authors. All rights reserved. | 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 | 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/bitmap_tile_task_worker_pool.h" | 5 #include "cc/raster/bitmap_tile_task_worker_pool.h" |
6 | 6 |
7 #include <algorithm> | 7 #include <algorithm> |
8 | 8 |
9 #include "base/strings/stringprintf.h" | 9 #include "base/strings/stringprintf.h" |
10 #include "base/trace_event/trace_event.h" | 10 #include "base/trace_event/trace_event.h" |
11 #include "base/trace_event/trace_event_argument.h" | 11 #include "base/trace_event/trace_event_argument.h" |
12 #include "cc/debug/traced_value.h" | 12 #include "cc/debug/traced_value.h" |
13 #include "cc/resources/raster_buffer.h" | 13 #include "cc/playback/raster_source.h" |
14 #include "cc/resources/raster_source.h" | 14 #include "cc/raster/raster_buffer.h" |
15 #include "cc/resources/resource.h" | 15 #include "cc/resources/resource.h" |
16 | 16 |
17 namespace cc { | 17 namespace cc { |
18 namespace { | 18 namespace { |
19 | 19 |
20 class RasterBufferImpl : public RasterBuffer { | 20 class RasterBufferImpl : public RasterBuffer { |
21 public: | 21 public: |
22 RasterBufferImpl(ResourceProvider* resource_provider, | 22 RasterBufferImpl(ResourceProvider* resource_provider, |
23 const Resource* resource) | 23 const Resource* resource) |
24 : lock_(resource_provider, resource->id()), resource_(resource) {} | 24 : lock_(resource_provider, resource->id()), resource_(resource) {} |
(...skipping 172 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
197 new base::trace_event::TracedValue(); | 197 new base::trace_event::TracedValue(); |
198 | 198 |
199 state->BeginArray("tasks_pending"); | 199 state->BeginArray("tasks_pending"); |
200 for (TaskSet task_set = 0; task_set < kNumberOfTaskSets; ++task_set) | 200 for (TaskSet task_set = 0; task_set < kNumberOfTaskSets; ++task_set) |
201 state->AppendBoolean(tasks_pending_[task_set]); | 201 state->AppendBoolean(tasks_pending_[task_set]); |
202 state->EndArray(); | 202 state->EndArray(); |
203 return state; | 203 return state; |
204 } | 204 } |
205 | 205 |
206 } // namespace cc | 206 } // namespace cc |
OLD | NEW |