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