use of org.eclipse.n4js.flowgraphs.model.ComplexNode in project n4js by eclipse.
the class WhileFactory method buildComplexNode.
static ComplexNode buildComplexNode(ReentrantASTIterator astpp, WhileStatement whileStmt) {
ComplexNode cNode = new ComplexNode(astpp.container(), whileStmt);
Node entryNode = new HelperNode(NodeNames.ENTRY, astpp.pos(), whileStmt);
Node conditionNode = DelegatingNodeFactory.createOrHelper(astpp, NodeNames.CONDITION, whileStmt, whileStmt.getExpression());
Node conditionForkNode = new HelperNode(NodeNames.CONDITION_FORK, astpp.pos(), whileStmt);
Node bodyNode = DelegatingNodeFactory.createOrHelper(astpp, NodeNames.BODY, whileStmt, whileStmt.getStatement());
Node continueCatchNode = new HelperNode(NodeNames.CONTINUE_CATCH, astpp.pos(), whileStmt);
Node exitNode = new HelperNode(NodeNames.EXIT, astpp.pos(), whileStmt);
cNode.addNode(entryNode);
cNode.addNode(conditionNode);
cNode.addNode(conditionForkNode);
cNode.addNode(bodyNode);
cNode.addNode(continueCatchNode);
cNode.addNode(exitNode);
cNode.connectInternalSucc(entryNode, conditionNode, conditionForkNode);
cNode.connectInternalSucc(ControlFlowType.LoopEnter, conditionForkNode, bodyNode);
cNode.connectInternalSucc(ControlFlowType.LoopExit, conditionForkNode, exitNode);
cNode.connectInternalSucc(bodyNode, continueCatchNode);
cNode.connectInternalSucc(ControlFlowType.LoopRepeat, continueCatchNode, conditionNode);
cNode.setEntryNode(entryNode);
cNode.setExitNode(exitNode);
// catch for short-circuits
conditionForkNode.addCatchToken(new CatchToken(ControlFlowType.IfTrue));
exitNode.addCatchToken(new CatchToken(ControlFlowType.IfFalse, ControlFlowType.LoopExit));
LabelledStatement lblStmt = ASTUtils.getLabelledStatement(whileStmt);
exitNode.addCatchToken(new CatchToken(ControlFlowType.Break, lblStmt));
continueCatchNode.addCatchToken(new CatchToken(ControlFlowType.Continue, lblStmt));
return cNode;
}
use of org.eclipse.n4js.flowgraphs.model.ComplexNode in project n4js by eclipse.
the class EdgeGuideWorklist method getAllVisitedNodes.
/**
* @return a set of all visited nodes
*/
Set<Node> getAllVisitedNodes(ComplexNode cn, NextEdgesProvider edgeProvider) {
Set<Node> allVisitedNodes = new HashSet<>();
for (ControlFlowEdge edge : allVisitedEdges) {
allVisitedNodes.add(edge.start);
allVisitedNodes.add(edge.end);
}
allVisitedNodes.add(edgeProvider.getStartNode(cn));
return allVisitedNodes;
}
use of org.eclipse.n4js.flowgraphs.model.ComplexNode in project n4js by eclipse.
the class GraphVisitorGuideInternal method walkthrough.
private void walkthrough(ComplexNode cn, NextEdgesProvider edgeProvider) {
List<BranchWalkerInternal> activatedPaths = initVisit();
guideWorklist.initialize(cn, edgeProvider, activatedPaths);
Node lastVisitNode = null;
for (EdgeGuide currEdgeGuide : guideWorklist.getCurrentEdgeGuides()) {
Node visitNode = currEdgeGuide.getPrevNode();
visitNode(lastVisitNode, currEdgeGuide, visitNode);
lastVisitNode = visitNode;
}
while (guideWorklist.hasNext()) {
flowAnalyzer.checkCancelled();
EdgeGuide currEdgeGuide = guideWorklist.next();
Node visitNode = currEdgeGuide.getNextNode();
visitNode(lastVisitNode, currEdgeGuide, visitNode);
lastVisitNode = visitNode;
mergeEdgeGuides();
}
}
use of org.eclipse.n4js.flowgraphs.model.ComplexNode in project n4js by eclipse.
the class BinaryLogicalExpressionFactory method buildComplexNode.
static ComplexNode buildComplexNode(ReentrantASTIterator astpp, BinaryLogicalExpression lbExpr) {
ComplexNode cNode = new ComplexNode(astpp.container(), lbExpr);
HelperNode entryNode = new HelperNode(NodeNames.ENTRY, astpp.pos(), lbExpr);
Node lhsNode = DelegatingNodeFactory.createOrHelper(astpp, NodeNames.LHS, lbExpr, lbExpr.getLhs());
Node scJumpNode = new HelperNode(NodeNames.SHORT_CIRCUIT_JUMP, astpp.pos(), lbExpr);
Node rhsNode = DelegatingNodeFactory.createOrHelper(astpp, NodeNames.RHS, lbExpr, lbExpr.getRhs());
Node exitNode = new RepresentingNode(NodeNames.EXIT, astpp.pos(), lbExpr);
cNode.addNode(entryNode);
cNode.addNode(lhsNode);
cNode.addNode(scJumpNode);
cNode.addNode(rhsNode);
cNode.addNode(exitNode);
ControlFlowType thenCFT = null;
ControlFlowType elseCFT = null;
switch(lbExpr.getOp()) {
case OR:
thenCFT = ControlFlowType.IfFalse;
elseCFT = ControlFlowType.IfTrue;
break;
case AND:
thenCFT = ControlFlowType.IfTrue;
elseCFT = ControlFlowType.IfFalse;
break;
}
cNode.connectInternalSucc(entryNode, lhsNode, scJumpNode);
cNode.connectInternalSucc(thenCFT, scJumpNode, rhsNode);
cNode.connectInternalSucc(rhsNode, exitNode);
// short-circuit evaluation
scJumpNode.addJumpToken(new JumpToken(elseCFT));
cNode.setJumpNode(scJumpNode);
cNode.setEntryNode(entryNode);
cNode.setExitNode(exitNode);
rhsNode.addCatchToken(new CatchToken(thenCFT));
boolean isCatchingLhs = isTopJumpCatcher(lbExpr);
if (isCatchingLhs) {
exitNode.addCatchToken(new CatchToken(elseCFT));
exitNode.addCatchToken(new CatchToken(thenCFT));
} else {
// TODO: minor improvement: add the following jump node
// exitNode.addJumpToken(new JumpToken(thenCFT)); // short-circuit evaluation
// cNode.setJumpNode(scJumpNode);
}
return cNode;
}
use of org.eclipse.n4js.flowgraphs.model.ComplexNode in project n4js by eclipse.
the class AbstractCaseClauseFactory method buildComplexNode.
static ComplexNode buildComplexNode(ReentrantASTIterator astpp, AbstractCaseClause abstrCaseClause) {
ComplexNode cNode = new ComplexNode(astpp.container(), abstrCaseClause);
Node entryNode = new HelperNode(NodeNames.ENTRY, astpp.pos(), abstrCaseClause);
List<Node> stmtNodes = new LinkedList<>();
Node caseConditionNode = null;
if (abstrCaseClause instanceof CaseClause) {
CaseClause caseClause = (CaseClause) abstrCaseClause;
caseConditionNode = DelegatingNodeFactory.create(astpp, NodeNames.CONDITION, caseClause, caseClause.getExpression());
}
EList<Statement> stmts = abstrCaseClause.getStatements();
for (int i = 0; i < stmts.size(); i++) {
Statement stmt = stmts.get(i);
Node blockNode = new DelegatingNode("stmt_" + i, astpp.pos(), abstrCaseClause, stmt);
stmtNodes.add(blockNode);
astpp.visitUtil(blockNode.getDelegatedControlFlowElement());
}
Node exitNode = new HelperNode(NodeNames.EXIT, astpp.pos(), abstrCaseClause);
cNode.addNode(entryNode);
cNode.addNode(caseConditionNode);
for (Node blockNode : stmtNodes) cNode.addNode(blockNode);
cNode.addNode(exitNode);
List<Node> nodes = new LinkedList<>();
nodes.add(entryNode);
nodes.add(caseConditionNode);
nodes.addAll(stmtNodes);
nodes.add(exitNode);
cNode.connectInternalSucc(nodes);
cNode.setEntryNode(entryNode);
cNode.setExitNode(exitNode);
return cNode;
}
Aggregations