OLD | NEW |
1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2016 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/raster/task_graph_runner.h" | 5 #include "cc/raster/task.h" |
6 | 6 |
7 #include <algorithm> | 7 #include "base/logging.h" |
8 #include <utility> | |
9 | |
10 #include "base/atomic_sequence_num.h" | |
11 #include "base/threading/thread_restrictions.h" | |
12 #include "base/trace_event/trace_event.h" | |
13 | 8 |
14 namespace cc { | 9 namespace cc { |
15 | 10 |
16 Task::Task() : will_run_(false), did_run_(false) {} | 11 Task::Task() : will_run_(false), did_run_(false) {} |
17 | 12 |
18 Task::~Task() { | 13 Task::~Task() { |
19 DCHECK(!will_run_); | 14 DCHECK(!will_run_); |
20 } | 15 } |
21 | 16 |
22 void Task::WillRun() { | 17 void Task::WillRun() { |
(...skipping 22 matching lines...) Expand all Loading... |
45 nodes.swap(other->nodes); | 40 nodes.swap(other->nodes); |
46 edges.swap(other->edges); | 41 edges.swap(other->edges); |
47 } | 42 } |
48 | 43 |
49 void TaskGraph::Reset() { | 44 void TaskGraph::Reset() { |
50 nodes.clear(); | 45 nodes.clear(); |
51 edges.clear(); | 46 edges.clear(); |
52 } | 47 } |
53 | 48 |
54 } // namespace cc | 49 } // namespace cc |
OLD | NEW |