/
TaskGraphController.java
245 lines (223 loc) · 8.97 KB
/
TaskGraphController.java
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
package com.jonanorman.android.taskgraph;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Set;
import java.util.concurrent.TimeUnit;
class TaskGraphController {
private final Set<TaskGraph.TaskGraphListener> listenerSet;
private final Set<TaskController> mainTaskControllerSet;
private final TaskGraph taskGraph;
private TaskController firstTaskController;
private TaskController lastTaskController;
private boolean started;
private boolean ended;
private boolean canceled;
private Object statusSync = new Object();
private DirectedGraph directedGraph;
private long startTime;
private long costTime;
TaskGraphController(TaskGraph taskGraph) {
this.taskGraph = taskGraph;
this.listenerSet = new HashSet<>();
this.listenerSet.addAll(taskGraph.listenerSet);
this.mainTaskControllerSet = new HashSet<>();
if (taskGraph.firstTask != null) {
TaskController taskController = new TaskController(taskGraph.firstTask, this);
if (runInProcess(taskController)) {
firstTaskController = taskController;
}
}
if (taskGraph.lastTask != null) {
TaskController taskController = new TaskController(taskGraph.lastTask, this);
if (runInProcess(taskController)) {
lastTaskController = taskController;
}
}
for (Task task : taskGraph.taskSet) {
TaskController taskController = new TaskController(task, this);
if (runInProcess(taskController)) {
this.mainTaskControllerSet.add(taskController);
}
}
}
private boolean runInProcess(TaskController taskController) {
if (!TaskGraphModule.isMainProcess() && taskController.mainThread) {
return false;
}
return true;
}
void runStart() {
synchronized (statusSync) {
if (isStarted() || isFinished()) {
return;
}
started = true;
}
logStart();
for (TaskGraph.TaskGraphListener taskGraphCallback : listenerSet) {
taskGraphCallback.onTaskGraphStart(taskGraph);
}
}
void runEnd() {
synchronized (statusSync) {
if (isFinished()) {
return;
}
ended = true;
}
logEnd();
for (TaskGraph.TaskGraphListener taskGraphCallback : listenerSet) {
taskGraphCallback.onTaskGraphEnd(taskGraph, costTime, TimeUnit.MILLISECONDS);
}
}
void runCancel(TaskCancelException cancelException) {
synchronized (statusSync) {
if (isFinished()) {
return;
}
canceled = true;
}
for (TaskGraph.TaskGraphListener taskGraphCallback : listenerSet) {
taskGraphCallback.onTaskGraphCancel(taskGraph, cancelException);
}
}
private void logStart() {
startTime = System.currentTimeMillis();
TaskGraphModule.logVerbose("taskGraph start...");
}
private void logEnd() {
costTime = System.currentTimeMillis() - startTime;
TaskGraphModule.logDebug("taskGraph end " + costTime + " ms");
}
public boolean isStarted() {
synchronized (statusSync) {
return started;
}
}
public boolean isEnded() {
synchronized (statusSync) {
return ended;
}
}
public boolean isCanceled() {
synchronized (statusSync) {
return ended;
}
}
public boolean isFinished() {
synchronized (statusSync) {
return ended || canceled;
}
}
public DirectedGraph getDirectedGraph() {
if (directedGraph != null) {
return directedGraph;
}
long startTime = System.currentTimeMillis();
directedGraph = new DirectedGraph();
Map<TaskController, DirectedGraph.Vertex<TaskController>> taskControllerVertexMap = new HashMap<>();
Map<Object, List<TaskController>> dependsFindsMap = new HashMap<>();
Set<TaskController> allSet = new HashSet<>();
if (firstTaskController != null) {
allSet.add(firstTaskController);
}
if (lastTaskController != null) {
allSet.add(lastTaskController);
}
allSet.addAll(mainTaskControllerSet);
for (TaskController task : allSet) {
DirectedGraph.Vertex<TaskController> vertex = new DirectedGraph.Vertex<>(task);
taskControllerVertexMap.put(task, vertex);
List<TaskController> taskList = dependsFindsMap.get(task.name);
if (taskList == null) {
taskList = new ArrayList<>();
dependsFindsMap.put(task.name, taskList);
}
if (!taskList.contains(task)) {
taskList.add(task);
}
taskList = dependsFindsMap.get(task);
if (taskList == null) {
taskList = new ArrayList<>();
dependsFindsMap.put(task, taskList);
}
if (!taskList.contains(task)) {
taskList.add(task);
}
directedGraph.addVertex(vertex);
}
for (TaskController task : allSet) {
DirectedGraph.Vertex<TaskController> to = taskControllerVertexMap.get(task);
Set<Object> dependsSet = task.dependsOnSet;
for (Object depend : dependsSet) {
List<TaskController> dependTaskList = dependsFindsMap.get(depend);
if (dependTaskList != null) {
for (TaskController dependsTask : dependTaskList) {
DirectedGraph.Vertex<TaskController> from = taskControllerVertexMap.get(dependsTask);
if (from != null) {
directedGraph.addEdge(new DirectedGraph.Edge(from, to));
}
}
}
}
}
if (firstTaskController != null) {
Set<TaskController> firstToSet = new HashSet<>(allSet);
DirectedGraph.Vertex<TaskController> firstVertex = taskControllerVertexMap.get(firstTaskController);
Queue<DirectedGraph.Vertex<TaskController>> queue = new LinkedList<>();
queue.offer(firstVertex);
Set<DirectedGraph.Vertex<TaskController>> searchedSet = new HashSet<>();
while (!queue.isEmpty()) {
DirectedGraph.Vertex<TaskController> vertex = queue.poll();
if (searchedSet.contains(vertex)) {
continue;
}
searchedSet.add(vertex);
firstToSet.remove(vertex.getValue());
Set<DirectedGraph.Edge<TaskController>> incomingEdgeSet = directedGraph.getIncomingEdgeSet(vertex);
for (DirectedGraph.Edge<TaskController> taskEdge : incomingEdgeSet) {
DirectedGraph.Vertex from = taskEdge.getFrom();
queue.offer(from);
}
}
for (TaskController task : firstToSet) {
DirectedGraph.Vertex<TaskController> to = taskControllerVertexMap.get(task);
directedGraph.addEdge(new DirectedGraph.Edge(firstVertex, to));
}
}
if (lastTaskController != null) {
Set<TaskController> lastFromSet = new HashSet<>(allSet);
DirectedGraph.Vertex<TaskController> lastVertex = taskControllerVertexMap.get(lastTaskController);
Queue<DirectedGraph.Vertex<TaskController>> queue = new LinkedList<>();
queue.offer(lastVertex);
Set<DirectedGraph.Vertex<TaskController>> searchedSet = new HashSet<>();
while (!queue.isEmpty()) {
DirectedGraph.Vertex<TaskController> vertex = queue.poll();
if (searchedSet.contains(vertex)) {
continue;
}
searchedSet.add(vertex);
lastFromSet.remove(vertex.getValue());
Set<DirectedGraph.Edge<TaskController>> outgoingEdgeSet = directedGraph.getOutgoingEdgeSet(vertex);
for (DirectedGraph.Edge<TaskController> taskEdge : outgoingEdgeSet) {
DirectedGraph.Vertex to = taskEdge.getFrom();
queue.offer(to);
}
}
for (TaskController task : lastFromSet) {
DirectedGraph.Vertex<TaskController> from = taskControllerVertexMap.get(task);
directedGraph.addEdge(new DirectedGraph.Edge(from, lastVertex));
}
}
if (TaskGraphModule.isLogGraphViz()) {
TaskGraphModule.logInfo("graphviz:\n" + directedGraph.getGraphPic());
}
TaskGraphModule.logDebug("taskGraph get directedGraph " + (System.currentTimeMillis() - startTime) + "ms");
return directedGraph;
}
}