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 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 | 2 2 2 2 2 44 44 44 44 44 44 44 44 44 2 44 44 44 8 8 8 8 44 2 129 129 44 129 129 41 129 50 79 2 44 36 36 36 3 33 36 2 2 229 50 50 50 50 50 50 50 50 2 2 50 3 2 1 3 177 52 2 44 44 129 129 77 77 53 24 1 77 52 47 5 25 2 77 77 23 4 77 8 8 8 7 6 1 8 6 44 50 1 1 2 44 229 50 50 50 177 50 2 110 226 226 142 49 61 2 109 207 207 144 49 60 2 77 77 227 150 150 29 29 77 2 44 44 129 44 8 8 44 2 110 110 110 2 13 13 13 2 8 8 8 5 2 129 44 8 8 44 2 2 79 2 129 14 2 5 108 2 118 64 64 | /* * 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. */ /* jshint -W079 */ var Set = require('cp-data').Set; /* jshint +W079 */ var util = require('./util'); var dijkstraAll = require('graphlib').alg.dijkstraAll; module.exports = dotify; function dotify(graph) { graph = graph.copy(); var pp = extractPotentialParents(graph), parents = createParentSet(graph, pp), copy = graph.copy(); copy.graph({}); rewriteNodes(copy, parents); rewriteEdges(copy); expandClusters(copy, parents); addSourceSinkEdges(copy, pp, parents, graph); renameClusters(copy); return copy; } /* * Removes 'POTENTIAL_PARENT' edges and saves them in a map of child -> * [potential parent ids]. */ function extractPotentialParents(graph) { var pp = {}; graph.eachEdge(function(e, child, parent, value) { if (value && value.relationship === 'POTENTIAL_PARENT') { Eif (!(child in pp)) { pp[child] = []; } pp[child].push(parent); graph.delEdge(e); } }); return pp; } function rewriteNodes(g, parents) { g.eachNode(function(u, value) { if (value === undefined) { g.node(u, {}); } }); var minStartNanos = Math.min.apply(Math, g.nodes().map(function(u) { return g.node(u).startNanos; })); g.eachNode(function(u, value) { var start = '@' + util.alignMillis((value.startNanos - minStartNanos) / (1000 * 1000)), run = '?', total = '+' + util.alignMillis((value.endNanos - value.startNanos) / (1000 * 1000)); if ('pendingNanos' in value) { run = util.alignMillis((value.pendingNanos - value.startNanos) / (1000 * 1000)); } if (parents.has(u)) { g.node(u, { label: value.name + ' (' + start + ', ' + run + ', ' + total + ')', labeljust: 'l', style: 'dashed', color: '#aaaaaa', fillcolor: fillcolor(value.resultType), resultType: value.resultType }); } else { g.node(u, { label: escapeLabel(value.name) + '\\l|{' + start + '\\r|' + run + '\\r|' + total + '\\r}', shape: 'Mrecord', style: 'filled', fillcolor: fillcolor(value.resultType), resultType: value.resultType }); } }); } function rewriteEdges(g) { g.eachEdge(function(e, u, v, value) { value = value || {}; var newValue = {}; if (value.relationship === 'POTENTIAL_SUCCESSOR') { newValue.style = 'dashed'; } else { newValue.style = 'solid'; } g.edge(e, newValue); }); } function expandClusters(g, parents) { function dfs(u) { if (!parents.has(u)) return u; var value = g.node(u); var source = value.source = 'source_' + u; var sink = value.sink = 'sink_' + u; g.addNode(source, { shape: 'circle', style: 'filled', label: ' ' }); g.parent(source, u); g.addNode(sink, { shape: 'doublecircle', style: 'filled', fillcolor: g.node(u).fillcolor, label: ' ' }); g.parent(sink, u); // Anything pointing at u should point to u's source node g.inEdges(u).forEach(function(e) { addSolidEdge(g, g.source(e), source); g.delEdge(e); }); // Anything that u points at should be pointed at by u's sink node g.outEdges(u).forEach(function(e) { if (wasFinished(value)) { addSolidEdge(g, sink, g.target(e)); } else { addDashedEdge(g, sink, g.target(e)); } g.delEdge(e); }); g.children(u).forEach(function(v) { dfs(v); }); } g.children(null).forEach(function(u) { dfs(u); }); } function addSourceSinkEdges(g, potentialParents, parents, originalG) { var paths = dijkstraAll(originalG), allKids = allChildren(originalG, potentialParents); originalG.eachNode(function(u, uValue) { var parent = g.parent(u); if (parent !== null) { var parentValue = g.node(parent), parentSource = parentValue.source, parentSink = parentValue.sink, sibs = originalG.children(parent); if (!hasPathFromSet(allKids[parent], u, paths)) { addSolidEdge(g, parentSource, u); } else if (!hasPathFromSet(sibs, u, paths)) { addInvisEdge(g, parentSource, u); } if (!hasPathToSet(u, allKids[parent], paths)) { if (wasFinished(uValue) && wasFinished(parentValue)) { addSolidEdge(g, u, parentSink); } else { addDashedEdge(g, u, parentSink); } } else if (!hasPathToSet(u, sibs, paths)) { addInvisEdge(g, u, parentSink); } var closestPred = closestPredecessorInSet(u, sibs, paths); if (closestPred) { // If the closest predecessor is not directedly connected if (!g.outEdges(closestPred, u).length) { addInvisEdge(g, closestPred, u); } } if (u in potentialParents) { potentialParents[u].forEach(function(potentialParent) { var ppValue = g.node(potentialParent), ppSource = ppValue.source, ppSink = ppValue.sink, ppChildren = originalG.children(potentialParent); if (!hasPathToSet(u, ppChildren, paths)) { if (wasFinished(uValue) && wasFinished(ppValue)) { addSolidEdge(g, u, ppSink); } else { addDashedEdge(g, u, ppSink); } } if (!hasPathFromSet(ppChildren, u, paths)) { addDashedEdge(g, ppSource, u); } }); } } }); // One more pass through parents to create an invisible edge from source to // sink only if there are no other nodes in the cluster. This can happen for // potential parents. parents.keys().forEach(function(parent) { if (g.children(parent).length === 2) { var parentValue = g.node(parent); addInvisEdge(g, parentValue.source, parentValue.sink); } }); } /* * Renames compound nodes so that they start with the prefix 'cluster_'. This * tells the graphviz engine to treat the subgraph as a cluster. */ function renameClusters(g) { g.eachNode(function(u, value) { if (g.children(u).length) { var cluster = g.addNode('cluster_' + u, value); g.parent(cluster, g.parent(u)); g.children(u).forEach(function(v) { g.parent(v, cluster); }); g.delNode(u); } }); } function hasPathToSet(u, set, paths) { for (var i = 0, il = set.length; i < il; ++i) { var v = set[i]; if (u !== v) { if (paths[u][v].distance !== Number.POSITIVE_INFINITY) { return true; } } } return false; } function hasPathFromSet(set, v, paths) { for (var i = 0, il = set.length; i < il; ++i) { var u = set[i]; if (u !== v) { if (paths[u][v].distance !== Number.POSITIVE_INFINITY) { return true; } } } return false; } function closestPredecessorInSet(u, set, paths) { var minNode, minDistance = Number.POSITIVE_INFINITY; set.forEach(function(v) { if (u !== v) { var entry = paths[v][u]; if (entry.distance < minDistance) { minNode = v; minDistance = entry.distance; } } }); return minNode; } /* * Given a graph and a map of tasks to an array of potential parents for the * task, this function returns a new mapping of parent tasks to all children * reachable via a parent or potential parent relationship. */ function allChildren(g, pp) { var children = {}; g.eachNode(function(u) { children[u] = g.children(u); }); Object.keys(pp).forEach(function(u) { pp[u].forEach(function(parent) { children[parent].push(u); }); }); return children; } function addSolidEdge(g, u, v) { if (g.node(u).sink !== undefined) { u = g.node(u).sink; } if (g.node(v).source !== undefined) { v = g.node(v).source; } g.addEdge(null, u, v, { style: 'solid' }); } function addDashedEdge(g, u, v) { Iif (g.node(u).sink !== undefined) { u = g.node(u).sink; } Iif (g.node(v).source !== undefined) { v = g.node(v).source; } g.addEdge(null, u, v, { style: 'dashed' }); } function addInvisEdge(g, u, v) { if (g.node(u).sink !== undefined) { u = g.node(u).sink; } if (g.node(v).source !== undefined) { v = g.node(v).source; } // Only add an invisible edge if it would not produce a multi-edge if (!g.outEdges(u, v).length) { g.addEdge(null, u, v, { style: 'invis' }); } } function createParentSet(g, pp) { var parents = new Set(g.nodes().filter(function(u) { return g.children(u).length; })); Object.keys(pp).forEach(function(child) { pp[child].forEach(function(parent) { parents.add(parent); }); }); return parents; } var ESCAPE_CHARS = /([<>|{}])/g; function escapeLabel(label) { return label ? label.replace(ESCAPE_CHARS, '\\$1') : label; } function fillcolor(resultType) { switch (resultType) { case 'SUCCESS': return '#e0ffe0'; case 'ERROR': return '#ffe0e0'; case 'EARLY_FINISH': return '#fffacd'; default: return '#aaaaaa'; } } /* * Helper that returns true only if the task was completed without an early * finish state. */ function wasFinished(taskValue) { if (!taskValue) return true; var resultType = taskValue.resultType; return !resultType || resultType === 'SUCCESS' || resultType === 'ERROR'; } |