OLD | NEW |
1 // Copyright 2016 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.h" | 5 #include "cc/raster/task.h" |
6 | 6 |
7 #include "base/logging.h" | 7 #include "base/logging.h" |
8 | 8 |
9 namespace cc { | 9 namespace cc { |
10 | 10 |
11 TaskState::TaskState() : value_(Value::NEW) {} | 11 TaskState::TaskState() : value_(Value::NEW) {} |
12 | 12 |
13 TaskState::~TaskState() { | 13 TaskState::~TaskState() { |
14 DCHECK(value_ != Value::RUNNING) | 14 DCHECK(value_ != Value::RUNNING) |
15 << "Running task should never get destroyed."; | 15 << "Running task should never get destroyed."; |
| 16 // TODO(prashant.n): Remove NEW, once all the tests follow the task life |
| 17 // cycle correctly. Few tests still do not take care of task states. |
16 DCHECK(value_ == Value::NEW || value_ == Value::FINISHED || | 18 DCHECK(value_ == Value::NEW || value_ == Value::FINISHED || |
17 value_ == Value::CANCELED) | 19 value_ == Value::CANCELED) |
18 << "Task, if scheduled, should get concluded either in FINISHED or " | 20 << "Task, if scheduled, should get concluded either in FINISHED or " |
19 "CANCELED state."; | 21 "CANCELED state."; |
20 } | 22 } |
21 | 23 |
22 bool TaskState::IsScheduled() const { | 24 bool TaskState::IsScheduled() const { |
23 return value_ == Value::SCHEDULED; | 25 return value_ == Value::SCHEDULED; |
24 } | 26 } |
25 | 27 |
26 bool TaskState::IsRunning() const { | 28 bool TaskState::IsRunning() const { |
27 return value_ == Value::RUNNING; | 29 return value_ == Value::RUNNING; |
28 } | 30 } |
| 31 |
29 bool TaskState::IsFinished() const { | 32 bool TaskState::IsFinished() const { |
30 return value_ == Value::FINISHED; | 33 return value_ == Value::FINISHED; |
31 } | 34 } |
| 35 |
32 bool TaskState::IsCanceled() const { | 36 bool TaskState::IsCanceled() const { |
33 return value_ == Value::CANCELED; | 37 return value_ == Value::CANCELED; |
34 } | 38 } |
35 | 39 |
36 void TaskState::Reset() { | 40 void TaskState::Reset() { |
37 value_ = Value::NEW; | 41 value_ = Value::NEW; |
38 } | 42 } |
39 | 43 |
40 void TaskState::DidSchedule() { | 44 void TaskState::DidSchedule() { |
41 DCHECK(value_ == Value::NEW) | 45 DCHECK(value_ == Value::NEW) |
42 << "Task should be in NEW state to get scheduled."; | 46 << "Task should be in NEW state to get scheduled."; |
43 value_ = Value::SCHEDULED; | 47 value_ = Value::SCHEDULED; |
44 } | 48 } |
45 | 49 |
46 void TaskState::DidStart() { | 50 void TaskState::DidStart() { |
47 DCHECK(value_ == Value::SCHEDULED) | 51 DCHECK(value_ == Value::SCHEDULED) |
48 << "Task should be only in SCHEDULED state to start, that is it should " | 52 << "Task should be only in SCHEDULED state to start, that is it should " |
49 "not be started or finished."; | 53 "not be started or finished."; |
50 value_ = Value::RUNNING; | 54 value_ = Value::RUNNING; |
51 } | 55 } |
52 | 56 |
53 void TaskState::DidFinish() { | 57 void TaskState::DidFinish() { |
54 DCHECK(value_ == Value::RUNNING) | 58 DCHECK(value_ == Value::RUNNING) |
55 << "Task should be running and not finished earlier."; | 59 << "Task should be running and not finished earlier."; |
56 value_ = Value::FINISHED; | 60 value_ = Value::FINISHED; |
57 } | 61 } |
58 | 62 |
59 void TaskState::DidCancel() { | 63 void TaskState::DidCancel() { |
60 DCHECK(value_ == Value::NEW || value_ == Value::SCHEDULED) | 64 DCHECK(value_ == Value::NEW || value_ == Value::SCHEDULED) |
61 << "Task should be scheduled and not running to get canceled."; | 65 << "Task should be either new or scheduled to get canceled."; |
62 value_ = Value::CANCELED; | 66 value_ = Value::CANCELED; |
63 } | 67 } |
64 | 68 |
65 Task::Task() {} | 69 Task::Task() {} |
66 | 70 |
67 Task::~Task() {} | 71 Task::~Task() {} |
68 | 72 |
69 TaskGraph::TaskGraph() {} | 73 TaskGraph::TaskGraph() {} |
70 | 74 |
71 TaskGraph::TaskGraph(const TaskGraph& other) = default; | 75 TaskGraph::TaskGraph(const TaskGraph& other) = default; |
72 | 76 |
73 TaskGraph::~TaskGraph() {} | 77 TaskGraph::~TaskGraph() {} |
74 | 78 |
75 void TaskGraph::Swap(TaskGraph* other) { | 79 void TaskGraph::Swap(TaskGraph* other) { |
76 nodes.swap(other->nodes); | 80 nodes.swap(other->nodes); |
77 edges.swap(other->edges); | 81 edges.swap(other->edges); |
78 } | 82 } |
79 | 83 |
80 void TaskGraph::Reset() { | 84 void TaskGraph::Reset() { |
81 nodes.clear(); | 85 nodes.clear(); |
82 edges.clear(); | 86 edges.clear(); |
83 } | 87 } |
84 | 88 |
85 } // namespace cc | 89 } // namespace cc |
OLD | NEW |