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/rasterizer.h" | 5 #include "cc/resources/rasterizer.h" |
6 | 6 |
7 #include <algorithm> | 7 #include <algorithm> |
8 | 8 |
9 namespace cc { | 9 namespace cc { |
10 | 10 |
(...skipping 43 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
54 | 54 |
55 RasterTask::~RasterTask() {} | 55 RasterTask::~RasterTask() {} |
56 | 56 |
57 RasterTask* RasterTask::AsRasterTask() { return this; } | 57 RasterTask* RasterTask::AsRasterTask() { return this; } |
58 | 58 |
59 RasterTaskQueue::Item::Item(RasterTask* task, bool required_for_activation) | 59 RasterTaskQueue::Item::Item(RasterTask* task, bool required_for_activation) |
60 : task(task), required_for_activation(required_for_activation) {} | 60 : task(task), required_for_activation(required_for_activation) {} |
61 | 61 |
62 RasterTaskQueue::Item::~Item() {} | 62 RasterTaskQueue::Item::~Item() {} |
63 | 63 |
64 RasterTaskQueue::RasterTaskQueue() : required_for_activation_count(0u) {} | 64 RasterTaskQueue::RasterTaskQueue() { |
| 65 } |
65 | 66 |
66 RasterTaskQueue::~RasterTaskQueue() {} | 67 RasterTaskQueue::~RasterTaskQueue() {} |
67 | 68 |
68 void RasterTaskQueue::Swap(RasterTaskQueue* other) { | 69 void RasterTaskQueue::Swap(RasterTaskQueue* other) { |
69 items.swap(other->items); | 70 items.swap(other->items); |
70 std::swap(required_for_activation_count, | |
71 other->required_for_activation_count); | |
72 } | 71 } |
73 | 72 |
74 void RasterTaskQueue::Reset() { | 73 void RasterTaskQueue::Reset() { |
75 required_for_activation_count = 0u; | |
76 items.clear(); | 74 items.clear(); |
77 } | 75 } |
78 | 76 |
79 } // namespace cc | 77 } // namespace cc |
OLD | NEW |