import IR.MethodDescriptor;
import IR.NameDescriptor;
import IR.VarDescriptor;
+import IR.Tree.MethodInvokeNode;
public class FlowGraph {
MethodDescriptor md;
- Set<FlowNode> nodeSet;
-
Set<FlowNode> returnNodeSet;
FlowNode thisVarNode;
+ Map<FlowNode, Set<FlowEdge>> mapFlowNodeToInEdgeSet;
Map<FlowNode, Set<FlowEdge>> mapFlowNodeToOutEdgeSet;
Map<NTuple<Location>, FlowNode> mapLocTupleToFlowNode;
// DS for the lattice generation
Map<Integer, FlowNode> mapIdxToFlowNode;
+ Map<MethodInvokeNode, FlowReturnNode> mapMethodInvokeNodeToFlowReturnNode;
+
public static int interseed = 0;
boolean debug = true;
this.md = md;
this.mapFlowNodeToLocTuple = new HashMap<FlowNode, NTuple<Location>>();
this.mapLocTupleToFlowNode = new HashMap<NTuple<Location>, FlowNode>();
- this.nodeSet = new HashSet<FlowNode>();
this.mapDescTupleToInferNode = new HashMap<NTuple<Descriptor>, FlowNode>();
this.mapParamDescToIdx = new HashMap<Descriptor, Integer>();
this.mapParamDescToIdx.putAll(mapParamDescToIdx);
this.returnNodeSet = new HashSet<FlowNode>();
this.mapIdxToFlowNode = new HashMap<Integer, FlowNode>();
this.mapFlowNodeToOutEdgeSet = new HashMap<FlowNode, Set<FlowEdge>>();
+ this.mapFlowNodeToInEdgeSet = new HashMap<FlowNode, Set<FlowEdge>>();
+ this.mapMethodInvokeNodeToFlowReturnNode = new HashMap<MethodInvokeNode, FlowReturnNode>();
if (!md.isStatic()) {
// create a node for 'this' varialbe
this.mapLocTupleToFlowNode.putAll(in);
}
- public void setNodeSet(Set<FlowNode> in) {
- this.nodeSet.addAll(in);
- }
-
public void setReturnNodeSet(Set<FlowNode> in) {
this.returnNodeSet.addAll(in);
}
newNode.setIntermediate(true);
mapDescTupleToInferNode.put(tuple, newNode);
- nodeSet.add(newNode);
+ // nodeSet.add(newNode);
System.out.println("create new intermediate node= " + newNode);
return newNode;
}
+ public FlowReturnNode getFlowReturnNode(MethodInvokeNode min) {
+ return mapMethodInvokeNodeToFlowReturnNode.get(min);
+ }
+
+ public FlowReturnNode createReturnNode(MethodInvokeNode min) {
+ NTuple<Descriptor> tuple = new NTuple<Descriptor>();
+ NameDescriptor n = new NameDescriptor("RETURNLOC" + (LocationInference.locSeed++));
+ tuple.add(n);
+
+ FlowReturnNode newNode = new FlowReturnNode(tuple, min);
+ mapDescTupleToInferNode.put(tuple, newNode);
+ mapMethodInvokeNodeToFlowReturnNode.put(min, newNode);
+ // nodeSet.add(newNode);
+
+ System.out.println("create new set node= " + newNode);
+
+ return newNode;
+ }
+
private void setupMapIdxToDesc() {
Set<Descriptor> descSet = mapParamDescToIdx.keySet();
return mapIdxToFlowNode.get(idx);
}
+ public Set<FlowEdge> getEdgeSet() {
+ Set<FlowEdge> edgeSet = new HashSet<FlowEdge>();
+
+ Set<FlowNode> nodeSet = getNodeSet();
+ for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
+ FlowNode flowNode = (FlowNode) iterator.next();
+ edgeSet.addAll(getOutEdgeSet(flowNode));
+ }
+
+ return edgeSet;
+ }
+
public Set<FlowNode> getNodeSet() {
- return nodeSet;
+ Set<FlowNode> set = new HashSet<FlowNode>();
+ set.addAll(mapDescTupleToInferNode.values());
+ return set;
}
public MethodDescriptor getMethodDescriptor() {
return false;
}
+ public Set<FlowEdge> getOutEdgeSetStartingFrom(FlowNode startNode) {
+
+ Descriptor prefixDesc = startNode.getCurrentDescTuple().get(0);
+
+ // returns the set of edges that share the same prefix of startNode
+ Set<FlowEdge> edgeSet = new HashSet<FlowEdge>();
+
+ for (Iterator<Set<FlowEdge>> iter = mapFlowNodeToOutEdgeSet.values().iterator(); iter.hasNext();) {
+ Set<FlowEdge> nodeEdgeSet = iter.next();
+ for (Iterator<FlowEdge> iter2 = nodeEdgeSet.iterator(); iter2.hasNext();) {
+ FlowEdge edge = iter2.next();
+ if (edge.getInitTuple().get(0).equals(prefixDesc)) {
+ edgeSet.add(edge);
+ }
+ }
+ }
+
+ return edgeSet;
+ }
+
public Set<FlowEdge> getOutEdgeSet(FlowNode node) {
if (!mapFlowNodeToOutEdgeSet.containsKey(node)) {
mapFlowNodeToOutEdgeSet.put(node, new HashSet<FlowEdge>());
return mapFlowNodeToOutEdgeSet.get(node);
}
+ public Set<FlowEdge> getInEdgeSet(FlowNode node) {
+ if (!mapFlowNodeToInEdgeSet.containsKey(node)) {
+ mapFlowNodeToInEdgeSet.put(node, new HashSet<FlowEdge>());
+ }
+ return mapFlowNodeToInEdgeSet.get(node);
+ }
+
public void addValueFlowEdge(NTuple<Descriptor> fromDescTuple, NTuple<Descriptor> toDescTuple) {
FlowNode fromNode = getFlowNode(fromDescTuple);
FlowNode toNode = getFlowNode(toDescTuple);
- System.out.println("create an edge from " + fromNode + " to " + toNode);
+ if (toNode.getDescTuple().get(0).equals(LocationInference.LITERALDESC)) {
+ return;
+ }
+
+ // System.out.println("create an edge from " + fromNode + " to " + toNode);
int fromTupleSize = fromDescTuple.size();
NTuple<Descriptor> curFromTuple = new NTuple<Descriptor>();
FlowEdge edge = new FlowEdge(fromNode, toNode, initTuple, endTuple);
addOutEdge(fromNode, edge);
+ addInEdge(toNode, edge);
// System.out.println("add a new edge=" + edge);
}
+ private void addInEdge(FlowNode toNode, FlowEdge edge) {
+ getInEdgeSet(toNode).add(edge);
+ }
+
private void addOutEdge(FlowNode fromNode, FlowEdge edge) {
if (!mapFlowNodeToOutEdgeSet.containsKey(fromNode)) {
mapFlowNodeToOutEdgeSet.put(fromNode, new HashSet<FlowEdge>());
mapFlowNodeToOutEdgeSet.get(fromNode).add(edge);
}
+ public boolean contains(NTuple<Descriptor> descTuple) {
+ return mapDescTupleToInferNode.containsKey(descTuple);
+ }
+
public FlowNode getFlowNode(NTuple<Descriptor> descTuple) {
if (!mapDescTupleToInferNode.containsKey(descTuple)) {
FlowNode node = createNewFlowNode(descTuple);
if (!mapDescTupleToInferNode.containsKey(tuple)) {
FlowNode node = new FlowNode(tuple);
mapDescTupleToInferNode.put(tuple, node);
- nodeSet.add(node);
+ // nodeSet.add(node);
mapLocTupleToFlowNode.put(getLocationTuple(node), node);
}
FlowNode node = mapDescTupleToInferNode.get(tuple);
- node.setReturn(true);
-
returnNodeSet.add(node);
}
return set;
}
+ public Set<FlowNode> getReachableSetFrom(NTuple<Descriptor> prefix) {
+ Set<FlowNode> reachableSet = new HashSet<FlowNode>();
+
+ Set<FlowNode> nodeSet = getNodeSet();
+ for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
+ FlowNode flowNode = (FlowNode) iterator.next();
+ if (flowNode.getCurrentDescTuple().startsWith(prefix)) {
+ recurReachableSetFrom(flowNode, reachableSet);
+ }
+ }
+
+ return reachableSet;
+ }
+
// private void getReachFlowNodeSetFrom(FlowNode fn, Set<FlowNode> visited) {
//
// for (Iterator iterator = fn.getOutEdgeSet().iterator();
//
// }
+ private void recurReachableSetFrom(FlowNode curNode, Set<FlowNode> reachableSet) {
+
+ Set<FlowEdge> edgeSet = getOutEdgeSet(curNode);
+ for (Iterator iterator = edgeSet.iterator(); iterator.hasNext();) {
+ FlowEdge edge = (FlowEdge) iterator.next();
+ FlowNode dstNode = getFlowNode(edge.getEndTuple());
+ if (!reachableSet.contains(dstNode)) {
+ reachableSet.add(dstNode);
+ recurReachableSetFrom(dstNode, reachableSet);
+ }
+ }
+
+ }
+
public Set<NTuple<Location>> getReachableFlowTupleSet(Set<NTuple<Location>> visited, FlowNode fn) {
Set<FlowEdge> outEdgeSet = getOutEdgeSet(fn);
Location interLoc = new Location(md, localDesc.getSymbol());
interLoc.setLocDescriptor(localDesc);
locTuple.add(interLoc);
- } else if (localDesc.getSymbol().equals(LocationInference.TOPLOC)) {
+ } else if (localDesc.getSymbol().equals(SSJavaAnalysis.TOP)) {
Location topLoc = new Location(md, Location.TOP);
topLoc.setLocDescriptor(LocationInference.TOPDESC);
locTuple.add(topLoc);
if (i == 0) {
loc = new Location(md, curDesc.getSymbol());
loc.setLocDescriptor(curDesc);
- cd = ((VarDescriptor) curDesc).getType().getClassDesc();
+ if (curDesc instanceof VarDescriptor) {
+ cd = ((VarDescriptor) curDesc).getType().getClassDesc();
+ } else {
+ // otherwise it should be the last element
+ cd = null;
+ }
} else {
loc = new Location(cd, curDesc.getSymbol());
loc.setLocDescriptor(curDesc);
if (curDesc instanceof FieldDescriptor) {
cd = ((FieldDescriptor) curDesc).getType().getClassDesc();
- } else {
+ } else if (curDesc instanceof LocationDescriptor) {
cd = ((LocationDescriptor) curDesc).getEnclosingClassDesc();
+ } else {
+ // otherwise it should be the last element of the tuple
+ cd = null;
}
}
public void getIncomingFlowNodeSet(FlowNode node, Set<FlowNode> visited) {
- for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
+ for (Iterator iterator = getNodeSet().iterator(); iterator.hasNext();) {
FlowNode curNode = (FlowNode) iterator.next();
Set<FlowEdge> edgeSet = getOutEdgeSet(curNode);
if (node.equals(getFlowNode(flowEdge.getEndTuple()))) {
FlowNode incomingNode = getFlowNode(flowEdge.getInitTuple());
- if (!visited.contains(incomingNode)) {
- visited.add(incomingNode);
- getIncomingFlowNodeSet(incomingNode, visited);
- }
- }
- }
- }
-
- }
-
- public Set<NTuple<Location>> getIncomingFlowTupleSet(FlowNode fn) {
-
- NTuple<Descriptor> dstTuple = fn.getDescTuple();
-
- Set<NTuple<Location>> set = new HashSet<NTuple<Location>>();
-
- ClassDescriptor cd = null;
-
- for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
- FlowNode node = (FlowNode) iterator.next();
-
- Set<FlowEdge> edgeSet = getOutEdgeSet(node);
- for (Iterator iterator2 = edgeSet.iterator(); iterator2.hasNext();) {
- FlowEdge flowEdge = (FlowEdge) iterator2.next();
- if (dstTuple.equals(flowEdge.getEndTuple())) {
- NTuple<Descriptor> initTuple = flowEdge.getInitTuple();
- NTuple<Location> locTuple = new NTuple<Location>();
- for (int i = 0; i < initTuple.size(); i++) {
- Descriptor d = initTuple.get(i);
- Location loc;
- if (i == 0) {
- loc = new Location(md, d.getSymbol());
- cd = ((VarDescriptor) d).getType().getClassDesc();
- } else {
- loc = new Location(cd, d.getSymbol());
- cd = ((FieldDescriptor) d).getType().getClassDesc();
+ if (incomingNode instanceof FlowReturnNode) {
+ FlowReturnNode rnode = (FlowReturnNode) incomingNode;
+ Set<NTuple<Descriptor>> nodeTupleSet = rnode.getTupleSet();
+ for (Iterator iterator3 = nodeTupleSet.iterator(); iterator3.hasNext();) {
+ NTuple<Descriptor> nodeTuple = (NTuple<Descriptor>) iterator3.next();
+ FlowNode fn = getFlowNode(nodeTuple);
+ if (!visited.contains(fn)) {
+ visited.add(fn);
+ getIncomingFlowNodeSet(fn, visited);
+ }
+ }
+ } else {
+ if (!visited.contains(incomingNode)) {
+ visited.add(incomingNode);
+ getIncomingFlowNodeSet(incomingNode, visited);
}
- locTuple.add(loc);
}
- set.add(locTuple);
+
}
}
}
- return set;
+
}
public boolean isParameter(NTuple<Descriptor> tuple) {
return mapParamDescToIdx.containsKey(firstIdxDesc);
}
+ public int getParamIdx(NTuple<Descriptor> tuple) {
+ Descriptor firstIdxDesc = tuple.get(0);
+ return mapParamDescToIdx.get(firstIdxDesc);
+ }
+
public FlowGraph clone() {
FlowGraph clone = new FlowGraph(md, mapParamDescToIdx);
- clone.setNodeSet(getNodeSet());
+ // clone.setNodeSet(getNodeSet());
clone.setMapLocTupleToFlowNode(getMapLocTupleToFlowNode());
clone.setMapFlowNodeToLocTuple(getMapFlowNodeToLocTuple());
clone.setMapDescTupleToInferNode(getMapDescTupleToInferNode());
return mapFlowNodeToOutEdgeSet;
}
+ public Set<FlowNode> getIncomingNodeSetByPrefix(Descriptor prefix) {
+
+ Set<FlowNode> incomingNodeSet = new HashSet<FlowNode>();
+
+ for (Iterator iterator = getNodeSet().iterator(); iterator.hasNext();) {
+ FlowNode curNode = (FlowNode) iterator.next();
+ Set<FlowEdge> outEdgeSet = getOutEdgeSet(curNode);
+
+ for (Iterator iterator2 = outEdgeSet.iterator(); iterator2.hasNext();) {
+ FlowEdge outEdge = (FlowEdge) iterator2.next();
+
+ if (outEdge.getEndTuple().startsWith(prefix)) {
+ incomingNodeSet.add(curNode);
+ recurIncomingNodeSetByPrefix(prefix, curNode, incomingNodeSet);
+
+ }
+
+ }
+ }
+
+ return incomingNodeSet;
+
+ }
+
+ private void recurIncomingNodeSetByPrefix(Descriptor prefix, FlowNode node, Set<FlowNode> visited) {
+
+ Set<FlowEdge> inEdgeSet = getInEdgeSet(node);
+
+ for (Iterator iterator = inEdgeSet.iterator(); iterator.hasNext();) {
+ FlowEdge inEdge = (FlowEdge) iterator.next();
+
+ FlowNode inNode = getFlowNode(inEdge.getInitTuple());
+ if (!inEdge.getInitTuple().startsWith(prefix) && !visited.contains(inNode)) {
+ visited.add(inNode);
+ recurIncomingNodeSetByPrefix(prefix, inNode, visited);
+ }
+ }
+
+ }
+
public void setMapFlowNodeToOutEdgeSet(Map<FlowNode, Set<FlowEdge>> inMap) {
Set<FlowNode> keySet = inMap.keySet();
for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
}
private void drawNode(FlowNode node, BufferedWriter bw) throws IOException {
- bw.write(node.getID() + " [label=\"" + node.getPrettyID() + "\"]" + ";\n");
+ if (node instanceof FlowReturnNode) {
+ FlowReturnNode rnode = (FlowReturnNode) node;
+ bw.write(node.getID() + " [label=\"" + node.getPrettyID() + "\"]" + ";\n");
+ } else {
+ bw.write(node.getID() + " [label=\"" + node.getPrettyID() + "\"]" + ";\n");
+ }
+
}
public void writeGraph() throws java.io.IOException {
// then visit every flow node
- Iterator<FlowNode> iter = nodeSet.iterator();
+ // Iterator<FlowNode> iter = nodeSet.iterator();
+ Iterator<FlowNode> iter = getNodeSet().iterator();
Set<FlowEdge> addedEdgeSet = new HashSet<FlowEdge>();
Set<FlowNode> addedNodeSet = new HashSet<FlowNode>();
}
public boolean constainsNode(FlowNode node) {
- return nodeSet.contains(node);
+ return getNodeSet().contains(node);
}
private void drawSubgraph(FlowNode node, BufferedWriter bw, Set<FlowEdge> addedSet)
bw.write("}\n");
}
+
}
\ No newline at end of file
projects / IRC.git / blobdiff