-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathDataflowVisitor.java
More file actions
674 lines (575 loc) · 23.3 KB
/
DataflowVisitor.java
File metadata and controls
674 lines (575 loc) · 23.3 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
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
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
/*
* Copyright 2024-2025, Seqera Labs
*
* 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.
*/
package nextflow.lsp.services.script.dag;
import java.util.List;
import java.util.ArrayList;
import java.util.Map;
import java.util.LinkedHashMap;
import java.util.Arrays;
import java.util.Collection;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Optional;
import java.util.Set;
import java.util.Stack;
import java.util.stream.Collectors;
import groovy.lang.Tuple3;
import nextflow.lsp.services.script.ScriptAstCache;
import nextflow.script.ast.ASTNodeMarker;
import nextflow.script.ast.AssignmentExpression;
import nextflow.script.ast.ProcessNode;
import nextflow.script.ast.ProcessNodeV1;
import nextflow.script.ast.ProcessNodeV2;
import nextflow.script.ast.ScriptNode;
import nextflow.script.ast.ScriptVisitorSupport;
import nextflow.script.ast.WorkflowNode;
import org.codehaus.groovy.ast.ASTNode;
import org.codehaus.groovy.ast.MethodNode;
import org.codehaus.groovy.ast.expr.BinaryExpression;
import org.codehaus.groovy.ast.expr.ClosureExpression;
import org.codehaus.groovy.ast.expr.DeclarationExpression;
import org.codehaus.groovy.ast.expr.Expression;
import org.codehaus.groovy.ast.expr.MethodCallExpression;
import org.codehaus.groovy.ast.expr.PropertyExpression;
import org.codehaus.groovy.ast.expr.TernaryExpression;
import org.codehaus.groovy.ast.expr.TupleExpression;
import org.codehaus.groovy.ast.expr.VariableExpression;
import org.codehaus.groovy.ast.stmt.ExpressionStatement;
import org.codehaus.groovy.ast.stmt.IfStatement;
import org.codehaus.groovy.ast.stmt.Statement;
import org.codehaus.groovy.control.SourceUnit;
import org.codehaus.groovy.syntax.Types;
import static nextflow.script.ast.ASTUtils.*;
import static org.codehaus.groovy.ast.tools.GeneralUtils.*;
/**
*
* @author Ben Sherman <bentshermann@gmail.com>
* @author Erik Danielsson <danielsson.erik.0@gmail.com>
*/
public class DataflowVisitor extends ScriptVisitorSupport {
private SourceUnit sourceUnit;
private ScriptAstCache ast;
private boolean verbose;
private boolean addTakesEmits;
private Map<String,Graph> graphs = new HashMap<>();
private Stack<Set<Node>> stackPreds = new Stack<>();
private VariableContext vc = new VariableContext();
private final Map<Integer, String> controlConditions = new LinkedHashMap<>();
private final Map<String, Node> globalNodes = new LinkedHashMap<>();
public DataflowVisitor(SourceUnit sourceUnit, ScriptAstCache ast, boolean verbose, boolean addTakesEmits) {
this.sourceUnit = sourceUnit;
this.ast = ast;
this.verbose = verbose;
this.addTakesEmits = addTakesEmits;
stackPreds.push(new HashSet<>());
}
@Override
protected SourceUnit getSourceUnit() {
return sourceUnit;
}
public void visit() {
var moduleNode = sourceUnit.getAST();
if( !(moduleNode instanceof ScriptNode) )
return;
var scriptNode = (ScriptNode) moduleNode;
for( var wn : scriptNode.getWorkflows() )
visitWorkflow(wn);
}
public Graph getGraph(String name) {
return graphs.get(name);
}
// script declarations
private Graph current;
private boolean inEntry;
@Override
public void visitWorkflow(WorkflowNode node) {
current = new Graph();
inEntry = node.isEntry();
var name = node.isEntry() ? "<entry>" : node.getName();
visitWorkflowTakes(node, current.inputs);
visit(node.main);
var outputs = node.isEntry() ? node.publishers : node.emits;
visitWorkflowOutputs(outputs, current.outputs);
graphs.put(name, current);
inEntry = false;
current = null;
}
private void visitWorkflowTakes(WorkflowNode node, Map<String,Node> result) {
for( var take : node.getParameters() ) {
var name = take.getName();
var dn = addNode(name, Node.Type.NAME, take);
dn.verbose = false;
vc.putSymbol(name, dn);
result.put(name, dn);
}
}
private void visitWorkflowOutputs(Statement outputs, Map<String,Node> result) {
for( var stmt : asBlockStatements(outputs) ) {
var emit = ((ExpressionStatement) stmt).getExpression();
String name;
if( emit instanceof VariableExpression ve ) {
name = ve.getName();
}
else if( emit instanceof AssignmentExpression assign ) {
var target = (VariableExpression) assign.getLeftExpression();
name = target.getName();
visit(emit);
}
else {
name = "$out";
visit(new AssignmentExpression(varX(name), emit));
}
var dn = getSymbol(name);
if( dn != null )
dn.verbose = false;
else
System.err.println("missing output: " + name);
result.put(name, dn);
}
}
private String extractSourceText(ASTNode expr) {
if (expr == null) return null;
try {
java.nio.file.Path path = java.nio.file.Paths.get(
getSourceUnit().getSource().getURI()
);
String source = java.nio.file.Files.readString(path);
String[] lines = source.split("\n", -1);
int startLine = expr.getLineNumber() - 1;
int endLine = expr.getLastLineNumber() - 1;
int startCol = expr.getColumnNumber();
int endCol = expr.getLastColumnNumber() - 2;
if (startLine < 0 || endLine >= lines.length)
return null;
if (startLine == endLine) {
return lines[startLine].substring(
Math.min(startCol, lines[startLine].length()),
Math.min(endCol, lines[startLine].length())
).trim();
}
StringBuilder sb = new StringBuilder();
sb.append(lines[startLine].substring(startCol)).append("\n");
for (int i = startLine + 1; i < endLine; i++) {
sb.append(lines[i]).append("\n");
}
sb.append(lines[endLine].substring(0,
Math.min(endCol, lines[endLine].length())));
return sb.toString().trim();
}
catch (Exception e) {
return null;
}
}
// statements
@Override
public void visitIfElse(IfStatement node) {
// visit the conditional expression
String conditionText = extractSourceText(node.getBooleanExpression());
var controlPreds = visitWithPreds(node.getBooleanExpression());
var controlDn = current.addNode("", Node.Type.CONTROL, null, controlPreds);
controlConditions.put(controlDn.id, conditionText);
// visit the if branch
vc.pushScope();
current.pushSubgraph(controlDn);
visitWithPreds(node.getIfBlock());
var ifSubgraph = current.popSubgraph();
var ifScope = vc.popScope();
// visit the else branch
Subgraph elseSubgraph;
Map<String,Variable> elseScope;
if( !node.getElseBlock().isEmpty() ) {
vc.pushScope();
current.pushSubgraph(controlDn);
visitWithPreds(node.getElseBlock());
elseSubgraph = current.popSubgraph();
elseScope = vc.popScope();
}
else {
// if there is no else branch, then the set of active symbols
// after the if statement is the union of the active symbols
// from before the if and the active symbols in the if
elseSubgraph = null;
elseScope = vc.peekScope();
}
// apply variables from if and else scopes to current scope
var outputs = vc.mergeConditionalScopes(ifScope, elseScope);
for( var name : outputs ) {
var preds = vc.getSymbolPreds(name);
if( preds.size() > 1 ) {
var dn = current.addNode(name, Node.Type.NAME, null, preds);
vc.putSymbol(name, dn);
}
}
// hide if-else statement if both subgraphs are empty
if( !verbose && ifSubgraph.isVerbose() && (elseSubgraph == null || elseSubgraph.isVerbose()) ) {
controlDn.verbose = true;
for( var name : outputs )
getSymbol(name).preds.addAll(controlPreds);
}
}
private void visitSubWorkflowCall(WorkflowNode subworkflow, List<ASTNode> callArgs) {
var params = subworkflow.getParameters();
int n = Math.min(params.length, callArgs.size());
Map<String, Node> subInputs = new LinkedHashMap<>();
List<Node> inputNodes = new ArrayList<>();
//Create input nodes and connect the corresponding argument nodes
for (int i = 0; i < n; i++) {
var param = params[i];
var arg = callArgs.get(i);
// Get predecessor nodes from this argument
var argPreds = visitWithPreds(arg);
Node inNode = addNode("take:"+param.getName(), Node.Type.INPUT, param, argPreds);
subInputs.put(param.getName(), inNode);
inputNodes.add(inNode);
}
//Create subworkflow operator node which depends on its input nodes
Node subNode = addNode(subworkflow.getName(), Node.Type.OPERATOR, subworkflow, new HashSet<>(inputNodes));
vc.putSymbol(subworkflow.getName(), subNode);
//Create output nodes and connect subworkflow operator -> outputs (then output -> other nodes (if possible) is done later on)
for (var stmt : asBlockStatements(subworkflow.emits)) {
Expression emit = ((ExpressionStatement) stmt).getExpression();
String name = typedOutputName(emit);
Node outNode = addNode("emit:"+name, Node.Type.OUTPUT, emit);
outNode.preds.add(subNode);
vc.putSymbol(name, outNode);
}
}
// expressions
@Override
public void visitMethodCallExpression(MethodCallExpression node) {
var name = node.getMethodAsString();
if( "set".equals(name) && !node.isImplicitThis() ) {
var code = asDslBlock(node, 1);
if( code != null && !code.getStatements().isEmpty() ) {
var target = asVarX(code.getStatements().get(0));
if( target != null ) {
visit(new AssignmentExpression(target, node.getObjectExpression()));
return;
}
}
}
var defNode = (MethodNode) node.getNodeMetaData(ASTNodeMarker.METHOD_TARGET);
if(!addTakesEmits){
if( defNode instanceof WorkflowNode || defNode instanceof ProcessNode ) {
var preds = visitWithPreds(node.getArguments());
var dn = addNode(name, Node.Type.OPERATOR, defNode, preds);
vc.putSymbol(name, dn);
return;
}
} else {
if( defNode instanceof ProcessNode ) {
var preds = visitWithPreds(node.getArguments());
var dn = addNode(name, Node.Type.OPERATOR, defNode, preds);
vc.putSymbol(name, dn);
return;
}
else if (defNode instanceof WorkflowNode wn) {
// Get the argument expressions as a list
var args = new ArrayList<ASTNode>();
if (node.getArguments() instanceof TupleExpression te)
args.addAll(te.getExpressions());
else
args.add(node.getArguments());
visitSubWorkflowCall(wn, args);
return;
}
}
super.visitMethodCallExpression(node);
}
@Override
public void visitBinaryExpression(BinaryExpression node) {
if( node instanceof AssignmentExpression ) {
visitAssignment(node, false);
return;
}
if( node.getOperation().getType() == Types.PIPE ) {
visitPipeline(node);
return;
}
super.visitBinaryExpression(node);
}
private void visitAssignment(BinaryExpression node, boolean isLocal) {
var preds = visitWithPreds(node.getRightExpression());
var targets = getAssignmentTargets(node.getLeftExpression());
for( var name : targets ) {
var dn = addNode(name, Node.Type.NAME, null, preds);
vc.putSymbol(name, dn, isLocal);
}
}
private Set<String> getAssignmentTargets(Expression node) {
// e.g. (x, y, z) = xyz
if( node instanceof TupleExpression te ) {
return te.getExpressions().stream()
.map(el -> getAssignmentTarget(el).getName())
.collect(Collectors.toSet());
}
else {
return Set.of(getAssignmentTarget(node).getName());
}
}
private VariableExpression getAssignmentTarget(Expression node) {
// e.g. v = 123
if( node instanceof VariableExpression ve )
return ve;
// e.g. obj.prop = 123
if( node instanceof PropertyExpression pe )
return getAssignmentTarget(pe.getObjectExpression());
// e.g. list[1] = 123 OR map['a'] = 123
if( node instanceof BinaryExpression be && be.getOperation().getType() == Types.LEFT_SQUARE_BRACKET )
return getAssignmentTarget(be.getLeftExpression());
return null;
}
private void visitPipeline(BinaryExpression node) {
var lhs = node.getLeftExpression();
var rhs = node.getRightExpression();
// x | f => f(x)
if( rhs instanceof VariableExpression ve ) {
var defNode = asMethodVariable(ve.getAccessedVariable());
if( defNode instanceof WorkflowNode || defNode instanceof ProcessNode ) {
var label = defNode.getName();
var preds = visitWithPreds(lhs);
var dn = addNode(label, Node.Type.OPERATOR, defNode, preds);
vc.putSymbol(label, dn);
return;
}
}
super.visitBinaryExpression(node);
}
@Override
public void visitDeclarationExpression(DeclarationExpression node) {
visitAssignment(node, true);
}
@Override
public void visitTernaryExpression(TernaryExpression node) {
String conditionText = extractSourceText(node.getBooleanExpression());
var controlPreds = visitWithPreds(node.getBooleanExpression());
var controlDn = current.addNode("", Node.Type.CONTROL, null, controlPreds);
controlConditions.put(controlDn.id, conditionText);
current.pushSubgraph(controlDn);
var truePreds = visitWithPreds(node.getTrueExpression());
var trueSubgraph = current.popSubgraph();
currentPreds().addAll(truePreds);
current.pushSubgraph(controlDn);
var falsePreds = visitWithPreds(node.getFalseExpression());
var falseSubgraph = current.popSubgraph();
currentPreds().addAll(falsePreds);
// hide ternary expression if both subgraphs are empty
if( trueSubgraph.isVerbose() && falseSubgraph.isVerbose() ) {
controlDn.verbose = true;
currentPreds().addAll(controlPreds);
}
}
@Override
public void visitClosureExpression(ClosureExpression node) {
// skip closures since they can't contain dataflow logic
}
@Override
public void visitPropertyExpression(PropertyExpression node) {
if( isEntryParam(node) ) {
var name = node.getPropertyAsString();
if( !current.inputs.containsKey(name) )
current.inputs.put(name, addNode(name, Node.Type.NAME, null));
var dn = current.inputs.get(name);
dn.verbose = false;
currentPreds().add(dn);
return;
}
var result = asMethodOutput(node);
if( result != null ) {
var mn = result.getV1();
var label = result.getV2();
var propName = result.getV3();
if( mn instanceof ProcessNodeV2 pn ) {
visitProcessOut(pn, label, propName);
return;
}
if( mn instanceof ProcessNodeV1 pn ) {
visitProcessOut(pn, label, propName);
return;
}
if( mn instanceof WorkflowNode wn ) {
visitWorkflowOut(wn, label, propName);
return;
}
}
super.visitPropertyExpression(node);
}
private boolean isEntryParam(PropertyExpression node) {
return inEntry && node.getObjectExpression() instanceof VariableExpression ve && "params".equals(ve.getName());
}
private Tuple3<MethodNode,String,String> asMethodOutput(PropertyExpression node) {
// named output e.g. PROC.out.foo
if( node.getObjectExpression() instanceof PropertyExpression pe ) {
if( pe.getObjectExpression() instanceof VariableExpression ve && "out".equals(pe.getPropertyAsString()) ) {
var mn = asMethodVariable(ve.getAccessedVariable());
if( mn != null )
return new Tuple3(mn, ve.getName(), node.getPropertyAsString());
}
}
// single output e.g. PROC.out
else if( node.getObjectExpression() instanceof VariableExpression ve && "out".equals(node.getPropertyAsString()) ) {
var mn = asMethodVariable(ve.getAccessedVariable());
if( mn != null )
return new Tuple3(mn, ve.getName(), null);
}
return null;
}
private void visitProcessOut(ProcessNodeV2 process, String label, String propName) {
if( propName == null ) {
addOperatorPred(label, process);
return;
}
asBlockStatements(process.outputs).stream()
.map(stmt -> ((ExpressionStatement) stmt).getExpression())
.filter((output) -> {
var outputName = typedOutputName(output);
return propName.equals(outputName);
})
.findFirst()
.ifPresent((call) -> {
addOperatorPred(label, process);
});
}
private void visitProcessOut(ProcessNodeV1 process, String label, String propName) {
if( propName == null ) {
addOperatorPred(label, process);
return;
}
asDirectives(process.outputs)
.filter((call) -> {
var emitName = processEmitName(call);
return propName.equals(emitName);
})
.findFirst()
.ifPresent((call) -> {
addOperatorPred(label, process);
});
}
private String processEmitName(MethodCallExpression output) {
return Optional.of(output)
.flatMap(call -> Optional.ofNullable(asNamedArgs(call)))
.flatMap(namedArgs ->
namedArgs.stream()
.filter(entry -> "emit".equals(entry.getKeyExpression().getText()))
.findFirst()
)
.flatMap(entry -> Optional.ofNullable(
entry.getValueExpression() instanceof VariableExpression ve ? ve.getName() : null
))
.orElse(null);
}
private void visitWorkflowOut(WorkflowNode workflow, String label, String propName) {
if( propName == null ) {
addOperatorPred(label, workflow);
return;
}
if(!addTakesEmits){
asBlockStatements(workflow.emits).stream()
.map(stmt -> ((ExpressionStatement) stmt).getExpression())
.filter((emit) -> {
var emitName = typedOutputName(emit);
return propName.equals(emitName);
})
.findFirst()
.ifPresent((call) -> {
addOperatorPred(label, workflow);
});
} else {
//Here we connect where possible the emited nodes with its correct successor
asBlockStatements(workflow.emits).stream()
.map(stmt -> ((ExpressionStatement) stmt).getExpression())
.filter(emit -> propName.equals(typedOutputName(emit)))
.findFirst()
.ifPresent(emit -> {
//Find the emit:propName node
Node emitNode = globalNodes.get("emit:" + propName);
//Fallback
if (emitNode == null) {
var preds = vc.getSymbolPreds(propName);
if (!preds.isEmpty())
emitNode = preds.iterator().next();
}
//ONLY add emitNode as predecessor
currentPreds().add(emitNode);
});
}
}
private String typedOutputName(Expression emit) {
if( emit instanceof VariableExpression ve ) {
return ve.getName();
}
else if( emit instanceof AssignmentExpression assign ) {
var target = (VariableExpression) assign.getLeftExpression();
return target.getName();
}
return null;
}
private void addOperatorPred(String label, ASTNode an) {
var dn = getSymbol(label);
if( dn != null )
currentPreds().add(dn);
else
vc.putSymbol(label, addNode(label, Node.Type.OPERATOR, an));
}
@Override
public void visitVariableExpression(VariableExpression node) {
var name = node.getName();
var dn = getSymbol(name);
if( dn != null )
currentPreds().add(dn);
}
// helpers
private Node getSymbol(String name) {
var preds = vc.getSymbolPreds(name);
if( preds.isEmpty() )
return null;
if( preds.size() > 1 )
System.err.println("unmerged symbol " + name + " " + preds);
return preds.iterator().next();
}
private Set<Node> currentPreds() {
return stackPreds.peek();
}
private Set<Node> visitWithPreds(ASTNode... nodes) {
return visitWithPreds(Arrays.asList(nodes));
}
private Set<Node> visitWithPreds(Collection<? extends ASTNode> nodes) {
// traverse a set of nodes and extract predecessor nodes
stackPreds.push(new HashSet<>());
for( var node : nodes ) {
if( node != null )
node.visit(this);
}
return stackPreds.pop();
}
public Map<String, Node> getGlobalNodes() {
return globalNodes;
}
private Node addNode(String label, Node.Type type, ASTNode an, Set<Node> preds) {
var uri = ast.getURI(an);
var dn = current.addNode(label, type, uri, preds);
globalNodes.put(dn.label, dn);
currentPreds().add(dn);
return dn;
}
private Node addNode(String label, Node.Type type, ASTNode an) {
return addNode(label, type, an, new HashSet<>());
}
public Map<Integer, String> getControlConditions() {
return controlConditions;
}
}