forked from linkedin/parseq
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathparse.js
More file actions
110 lines (98 loc) · 3.25 KB
/
Copy pathparse.js
File metadata and controls
110 lines (98 loc) · 3.25 KB
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
/*
* Copyright 2013 LinkedIn, Inc
*
* Licensed under the Apache License, Version 2.0 (the 'License'); you may not
* use this file except in compliance with the License. You may obtain a copy of
* the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an 'AS IS' BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
* License for the specific language governing permissions and limitations under
* the License.
*/
var CDigraph = require('graphlib').CDigraph;
module.exports = parse;
/*
* Parses `json` and returns a directed graph representation.
*/
function parse(json) {
var g = new CDigraph(),
snapshotNanos = json.snapshotNanos;
// If the trace does not have snapshotNanos, fall back to determining snapshot time based
// on the last even recorded.
if (snapshotNanos === undefined) {
snapshotNanos = 0;
json.traces.forEach(function(trace) {
if (trace.endNanos !== undefined) {
snapshotNanos = Math.max(snapshotNanos, trace.endNanos);
} else if (trace.pendingNanos !== undefined) {
snapshotNanos = Math.max(snapshotNanos, trace.pendingNanos);
} else if (trace.startNanos !== undefined) {
snapshotNanos = Math.max(snapshotNanos, trace.startNanos);
}
});
}
json.traces.forEach(function(trace) {
// If the task was not even started, then don't display it...
if (trace.startNanos !== undefined) {
trace = shallowCopy(trace);
var id = trace.id;
delete trace.id;
if (trace.endNanos === undefined)
trace.endNanos = snapshotNanos;
if (trace.pendingNanos === undefined)
trace.pendingNanos = trace.endNanos;
g.addNode(id, trace);
}
});
if (json.relationships) {
json.relationships.forEach(function(rel) {
if (g.hasNode(rel.to) && g.hasNode(rel.from)) {
switch(rel.relationship) {
case 'PARENT_OF':
g.parent(rel.to, rel.from);
break;
case 'SUCCESSOR_OF':
g.addEdge(null, rel.to, rel.from, { relationship: 'SUCCESSOR' });
break;
case 'POSSIBLE_SUCCESSOR_OF':
// Note that the change of name from POSSIBLE_SUCCESSOR_OF to
// POTENTIAL_SUCCESSOR is intentional. The trace format is
// inconsistent but we'll at least keep the visualization code
// consistent.
g.addEdge(null, rel.to, rel.from, { relationship: 'POTENTIAL_SUCCESSOR' });
break;
case 'POTENTIAL_PARENT_OF':
g.addEdge(null, rel.to, rel.from, { relationship: 'POTENTIAL_PARENT' });
break;
}
}
});
}
precomputeSortOrder(g);
return g;
}
function shallowCopy(obj) {
var copy = {};
Object.keys(obj).forEach(function(k) {
if (obj.hasOwnProperty(k)) {
copy[k] = obj[k];
}
});
return copy;
}
function precomputeSortOrder(g) {
var counter = 0;
function dfs(u) {
var children = g.children(u);
children.sort(function(v, w) { return g.node(v).startNanos - g.node(w).startNanos; });
children.forEach(function(v) {
g.node(v).order = counter++;
dfs(v);
});
}
dfs(null);
}