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 <iomanip> |
8 #include <utility> | 9 #include <utility> |
9 | 10 |
10 #include "base/atomic_sequence_num.h" | 11 #include "base/atomic_sequence_num.h" |
11 #include "base/threading/thread_restrictions.h" | 12 #include "base/threading/thread_restrictions.h" |
12 #include "base/trace_event/trace_event.h" | 13 #include "base/trace_event/trace_event.h" |
13 | 14 |
14 namespace cc { | 15 namespace cc { |
15 | 16 |
16 Task::Task() : will_run_(false), did_run_(false) {} | 17 Task::Task() : will_run_(false), did_run_(false), runner_(nullptr) {} |
17 | 18 |
18 Task::~Task() { | 19 Task::~Task() { |
19 DCHECK(!will_run_); | 20 DCHECK(!will_run_); |
20 } | 21 } |
21 | 22 |
22 void Task::WillRun() { | 23 void Task::WillRun() { |
23 DCHECK(!will_run_); | 24 DCHECK(!will_run_); |
24 DCHECK(!did_run_); | 25 DCHECK(!did_run_); |
25 will_run_ = true; | 26 will_run_ = true; |
26 } | 27 } |
(...skipping 18 matching lines...) Expand all Loading... |
45 nodes.swap(other->nodes); | 46 nodes.swap(other->nodes); |
46 edges.swap(other->edges); | 47 edges.swap(other->edges); |
47 } | 48 } |
48 | 49 |
49 void TaskGraph::Reset() { | 50 void TaskGraph::Reset() { |
50 nodes.clear(); | 51 nodes.clear(); |
51 edges.clear(); | 52 edges.clear(); |
52 } | 53 } |
53 | 54 |
54 } // namespace cc | 55 } // namespace cc |
OLD | NEW |