1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
// Copyright 2016 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "cc/raster/task.h"
#include <ostream>
#include <utility>
#include "base/check.h"
#include "base/notreached.h"
#include "base/trace_event/trace_id_helper.h"
namespace cc {
TaskState::TaskState() : value_(Value::kNew) {}
TaskState::~TaskState() {
DCHECK(value_ != Value::kRunning)
<< "Running task should never get destroyed.";
DCHECK(value_ == Value::kFinished || value_ == Value::kCanceled)
<< "Task, if scheduled, should get concluded either in FINISHED or "
"CANCELED state.";
}
bool TaskState::IsNew() const {
return value_ == Value::kNew;
}
bool TaskState::IsScheduled() const {
return value_ == Value::kScheduled;
}
bool TaskState::IsRunning() const {
return value_ == Value::kRunning;
}
bool TaskState::IsFinished() const {
return value_ == Value::kFinished;
}
bool TaskState::IsCanceled() const {
return value_ == Value::kCanceled;
}
void TaskState::Reset() {
value_ = Value::kNew;
}
std::string TaskState::ToString() const {
switch (value_) {
case Value::kNew:
return "NEW";
case Value::kScheduled:
return "SCHEDULED";
case Value::kRunning:
return "RUNNING";
case Value::kFinished:
return "FINISHED";
case Value::kCanceled:
return "CANCELED";
}
NOTREACHED();
}
void TaskState::DidSchedule() {
DCHECK(value_ == Value::kNew)
<< "Task should be in NEW state to get scheduled.";
value_ = Value::kScheduled;
}
void TaskState::DidStart() {
DCHECK(value_ == Value::kScheduled)
<< "Task should be only in SCHEDULED state to start, that is it should "
"not be started or finished.";
value_ = Value::kRunning;
}
void TaskState::DidFinish() {
DCHECK(value_ == Value::kRunning)
<< "Task should be running and not finished earlier.";
value_ = Value::kFinished;
}
void TaskState::DidCancel() {
DCHECK(value_ == Value::kNew || value_ == Value::kScheduled)
<< "Task should be either new or scheduled to get canceled.";
value_ = Value::kCanceled;
}
Task::Task() = default;
Task::~Task() = default;
TaskGraph::TaskGraph() = default;
TaskGraph::TaskGraph(TaskGraph&& other) = default;
TaskGraph::~TaskGraph() = default;
TaskGraph::Node::Node(scoped_refptr<Task> new_task,
uint16_t category,
uint16_t priority,
uint32_t dependencies,
bool has_external_dependency)
: task(std::move(new_task)),
category(category),
priority(priority),
dependencies(dependencies),
has_external_dependency(has_external_dependency) {
// Set a trace task id to use for connecting from where the task was posted.
if (task) {
task->set_trace_task_id(base::trace_event::GetNextGlobalTraceId());
}
}
TaskGraph::Node::Node(Node&& other) = default;
TaskGraph::Node::~Node() = default;
void TaskGraph::Swap(TaskGraph* other) {
nodes.swap(other->nodes);
edges.swap(other->edges);
}
void TaskGraph::Reset() {
nodes.clear();
edges.clear();
}
} // namespace cc
|
