Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* ControlFlowGraph.java
*
* Copyright (c) 2013 Mike Strobel
*
* This source code is based on Mono.Cecil from Jb Evain, Copyright (c) Jb Evain;
* and ILSpy/ICSharpCode from SharpDevelop, Copyright (c) AlphaSierraPapa.
*
* This source code is subject to terms and conditions of the Apache License, Version 2.0.
* A copy of the license can be found in the License.html file at the root of this distribution.
* By using this source code in any fashion, you are agreeing to be bound by the terms of the
* Apache License, Version 2.0.
*
* You must not remove this notice, or any other, from this software.
*/
package com.strobel.assembler.flowanalysis;
import com.strobel.core.ArrayUtilities;
import com.strobel.core.BooleanBox;
import com.strobel.core.ExceptionUtilities;
import com.strobel.core.VerifyArgument;
import com.strobel.decompiler.PlainTextOutput;
import com.strobel.functions.Block;
import com.strobel.functions.Function;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Set;
import java.util.concurrent.CancellationException;
import java.util.regex.Pattern;
public final class ControlFlowGraph {
private final List _nodes;
public final ControlFlowNode getEntryPoint() {
return _nodes.get(0);
}
public final ControlFlowNode getRegularExit() {
return _nodes.get(1);
}
public final ControlFlowNode getExceptionalExit() {
return _nodes.get(2);
}
public final List getNodes() {
return _nodes;
}
public ControlFlowGraph(final ControlFlowNode... nodes) {
_nodes = ArrayUtilities.asUnmodifiableList(VerifyArgument.noNullElements(nodes, "nodes"));
assert nodes.length >= 3;
assert getEntryPoint().getNodeType() == ControlFlowNodeType.EntryPoint;
assert getRegularExit().getNodeType() == ControlFlowNodeType.RegularExit;
assert getExceptionalExit().getNodeType() == ControlFlowNodeType.ExceptionalExit;
}
public final void resetVisited() {
for (final ControlFlowNode node : _nodes) {
node.setVisited(false);
}
}
public final void computeDominance() {
computeDominance(new BooleanBox());
}
public final void computeDominance(final BooleanBox cancelled) {
final ControlFlowNode entryPoint = getEntryPoint();
entryPoint.setImmediateDominator(entryPoint);
final BooleanBox changed = new BooleanBox(true);
while (changed.get()) {
changed.set(false);
resetVisited();
if (cancelled.get()) {
throw new CancellationException();
}
entryPoint.traversePreOrder(
new Function>() {
@Override
public final Iterable apply(final ControlFlowNode input) {
return input.getSuccessors();
}
},
new Block() {
@Override
public final void accept(final ControlFlowNode b) {
if (b == entryPoint) {
return;
}
ControlFlowNode newImmediateDominator = null;
for (final ControlFlowNode p : b.getPredecessors()) {
if (p.isVisited() && p != b) {
newImmediateDominator = p;
break;
}
}
if (newImmediateDominator == null) {
throw new IllegalStateException("Could not compute new immediate dominator!");
}
for (final ControlFlowNode p : b.getPredecessors()) {
if (p != b && p.getImmediateDominator() != null) {
newImmediateDominator = findCommonDominator(p, newImmediateDominator);
}
}
if (b.getImmediateDominator() != newImmediateDominator) {
b.setImmediateDominator(newImmediateDominator);
changed.set(true);
}
}
}
);
}
entryPoint.setImmediateDominator(null);
for (final ControlFlowNode node : _nodes) {
final ControlFlowNode immediateDominator = node.getImmediateDominator();
if (immediateDominator != null) {
immediateDominator.getDominatorTreeChildren().add(node);
}
}
}
public final void computeDominanceFrontier() {
resetVisited();
getEntryPoint().traversePostOrder(
new Function>() {
@Override
public final Iterable apply(final ControlFlowNode input) {
return input.getDominatorTreeChildren();
}
},
new Block() {
@Override
public void accept(final ControlFlowNode n) {
final Set dominanceFrontier = n.getDominanceFrontier();
dominanceFrontier.clear();
for (final ControlFlowNode s : n.getSuccessors()) {
if (s.getImmediateDominator() != n) {
dominanceFrontier.add(s);
}
}
for (final ControlFlowNode child : n.getDominatorTreeChildren()) {
for (final ControlFlowNode p : child.getDominanceFrontier()) {
if (p.getImmediateDominator() != n) {
dominanceFrontier.add(p);
}
}
}
}
}
);
}
public static ControlFlowNode findCommonDominator(final ControlFlowNode a, final ControlFlowNode b) {
final Set path1 = new LinkedHashSet<>();
ControlFlowNode node1 = a;
ControlFlowNode node2 = b;
while (node1 != null && path1.add(node1)) {
node1 = node1.getImmediateDominator();
}
while (node2 != null) {
if (path1.contains(node2)) {
return node2;
}
node2 = node2.getImmediateDominator();
}
throw new IllegalStateException("No common dominator found!");
}
public final void export(final File path) {
final PlainTextOutput output = new PlainTextOutput();
output.writeLine("digraph g {");
output.indent();
final Set edges = new LinkedHashSet<>();
for (final ControlFlowNode node : _nodes) {
output.writeLine("\"%s\" [", nodeName(node));
output.indent();
output.writeLine(
"label = \"%s\\l\"",
escapeGraphViz(node.toString())
);
output.writeLine(", shape = \"box\"");
output.unindent();
output.writeLine("];");
edges.addAll(node.getIncoming());
edges.addAll(node.getOutgoing());
final ControlFlowNode endFinallyNode = node.getEndFinallyNode();
if (endFinallyNode != null) {
output.writeLine("\"%s\" [", nodeName(endFinallyNode));
output.indent();
output.writeLine(
"label = \"%s\"",
escapeGraphViz(endFinallyNode.toString())
);
output.writeLine("shape = \"box\"");
output.unindent();
output.writeLine("];");
edges.addAll(endFinallyNode.getIncoming());
edges.addAll(endFinallyNode.getOutgoing());
// edges.add(new ControlFlowEdge(node, endFinallyNode, JumpType.EndFinally));
}
}
for (final ControlFlowEdge edge : edges) {
final ControlFlowNode from = edge.getSource();
final ControlFlowNode to = edge.getTarget();
output.writeLine("\"%s\" -> \"%s\" [", nodeName(from), nodeName(to));
output.indent();
switch (edge.getType()) {
case Normal:
break;
case LeaveTry:
output.writeLine("color = \"blue\"");
break;
case EndFinally:
output.writeLine("color = \"red\"");
break;
case JumpToExceptionHandler:
output.writeLine("color = \"gray\"");
break;
default:
output.writeLine("label = \"%s\"", edge.getType());
break;
}
output.unindent();
output.writeLine("];");
}
output.unindent();
output.writeLine("}");
try (final OutputStreamWriter out = new FileWriter(path)) {
out.write(output.toString());
}
catch (IOException e) {
throw ExceptionUtilities.asRuntimeException(e);
}
}
private static String nodeName(final ControlFlowNode node) {
String name = "node" + node.getBlockIndex();
if (node.getNodeType() == ControlFlowNodeType.EndFinally) {
name += "_ef";
}
return name;
}
private final static Pattern SAFE_PATTERN = Pattern.compile("^[\\w\\d]+$");
private static String escapeGraphViz(final String text) {
return escapeGraphViz(text, false);
}
private static String escapeGraphViz(final String text, final boolean quote) {
if (SAFE_PATTERN.matcher(text).matches()) {
return quote ? "\"" + text + "\""
: text;
}
else {
return (quote ? "\"" : "") +
text.replace("\\", "\\\\")
.replace("\r", "")
.replace("\n", "\\l")
.replace("|", "\\|")
.replace("{", "\\{")
.replace("}", "\\}")
.replace("<", "\\<")
.replace(">", "\\>")
.replace("\"", "\\\"") +
(quote ? "\"" : "");
}
}
}
