package Analysis.SSJava;
import java.io.BufferedWriter;
-import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
-import java.util.Map.Entry;
-import Analysis.OoOJava.ConflictEdge;
-import Analysis.OoOJava.ConflictNode;
+import IR.ClassDescriptor;
import IR.Descriptor;
import IR.FieldDescriptor;
import IR.MethodDescriptor;
+import IR.NameDescriptor;
import IR.VarDescriptor;
public class FlowGraph {
Set<FlowNode> returnNodeSet;
FlowNode thisVarNode;
+ Map<NTuple<Location>, FlowNode> mapLocTupleToFlowNode;
+ Map<FlowNode, NTuple<Location>> mapFlowNodeToLocTuple;
+
// maps the composite representation of field/var descriptors to infer nodes
Map<NTuple<Descriptor>, FlowNode> mapDescTupleToInferNode;
// maps a paramter descriptor to its index
Map<Descriptor, Integer> mapParamDescToIdx;
+
+ Map<Integer, FlowNode> mapIdxToFlowNode;
+
+ public static int interseed = 0;
+
boolean debug = true;
public FlowGraph(MethodDescriptor md, Map<Descriptor, Integer> mapParamDescToIdx) {
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.mapNodeToNeighborSet = new HashMap<NTuple<Descriptor>, Set<FlowNode>>();
this.mapParamDescToIdx = new HashMap<Descriptor, Integer>();
this.mapParamDescToIdx.putAll(mapParamDescToIdx);
this.returnNodeSet = new HashSet<FlowNode>();
+ this.mapIdxToFlowNode = new HashMap<Integer, FlowNode>();
+
+ if (!md.isStatic()) {
+ // create a node for 'this' varialbe
+ // NTuple<Descriptor> thisDescTuple = new NTuple<Descriptor>();
+ // thisDescTuple.add(md.getThis());
+
+ NTuple<Descriptor> thisVarTuple = new NTuple<Descriptor>();
+ thisVarTuple.add(md.getThis());
+ FlowNode thisNode = createNewFlowNode(thisVarTuple);
+ thisNode.setSkeleton(true);
+ thisVarNode = thisNode;
+ }
+
+ setupMapIdxToDesc();
+
+ }
+
+ public Map<Descriptor, Integer> getMapParamDescToIdx() {
+ return mapParamDescToIdx;
+ }
+
+ public FlowNode createIntermediateNode() {
+ NTuple<Descriptor> tuple = new NTuple<Descriptor>();
+ Descriptor interDesc = new InterDescriptor(LocationInference.INTERLOC + interseed);
+ tuple.add(interDesc);
+ interseed++;
+
+ FlowNode newNode = new FlowNode(tuple);
+ newNode.setIntermediate(true);
+
+ mapDescTupleToInferNode.put(tuple, newNode);
+ nodeSet.add(newNode);
- // create a node for 'this' varialbe
- NTuple<Descriptor> thisDescTuple = new NTuple<Descriptor>();
- thisDescTuple.add(md.getThis());
- FlowNode thisNode = new FlowNode(thisDescTuple, true);
- NTuple<Descriptor> thisVarTuple = new NTuple<Descriptor>();
- thisVarTuple.add(md.getThis());
- createNewFlowNode(thisVarTuple);
- thisVarNode = thisNode;
+ System.out.println("create new intermediate node= " + newNode);
+ return newNode;
+ }
+
+ private void setupMapIdxToDesc() {
+
+ Set<Descriptor> descSet = mapParamDescToIdx.keySet();
+ for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
+ Descriptor paramDesc = (Descriptor) iterator.next();
+ int idx = mapParamDescToIdx.get(paramDesc);
+ NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
+ descTuple.add(paramDesc);
+ FlowNode paramNode = getFlowNode(descTuple);
+ mapIdxToFlowNode.put(idx, paramNode);
+ paramNode.setSkeleton(true);
+ }
+
+ }
+
+ public int getNumParameters() {
+ return mapIdxToFlowNode.keySet().size();
+ }
+
+ public FlowNode getParamFlowNode(int idx) {
+ return mapIdxToFlowNode.get(idx);
}
public Set<FlowNode> getNodeSet() {
return nodeSet;
}
- public Set<FlowNode> getParameterNodeSet() {
- Set<FlowNode> paramNodeSet = new HashSet<FlowNode>();
- for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
- FlowNode fn = (FlowNode) iterator.next();
- if (fn.isParameter()) {
- paramNodeSet.add(fn);
- }
- }
- return paramNodeSet;
+ public MethodDescriptor getMethodDescriptor() {
+ return md;
}
public void addNeighbor(FlowNode node, FlowNode neighbor) {
}
set.add(neighbor);
- System.out.println("add a new neighbor " + neighbor + " to " + node);
+ // System.out.println("add a new neighbor " + neighbor + " to " + node);
+ }
+
+ public boolean isParamDesc(Descriptor desc) {
+
+ if (mapParamDescToIdx.containsKey(desc)) {
+ int idx = mapParamDescToIdx.get(desc);
+ if (!md.isStatic() && idx == 0) {
+ return false;
+ }
+ return true;
+ }
+
+ return false;
}
public boolean hasEdge(NTuple<Descriptor> fromDescTuple, NTuple<Descriptor> toDescTuple) {
public void addValueFlowEdge(NTuple<Descriptor> fromDescTuple, NTuple<Descriptor> toDescTuple) {
- FlowNode fromNode = mapDescTupleToInferNode.get(fromDescTuple);
- FlowNode toNode = mapDescTupleToInferNode.get(toDescTuple);
+ FlowNode fromNode = getFlowNode(fromDescTuple);
+ FlowNode toNode = getFlowNode(toDescTuple);
System.out.println("create an edge from " + fromNode + " to " + toNode);
int fromTupleSize = fromDescTuple.size();
- NTuple<Descriptor> curTuple = new NTuple<Descriptor>();
+ NTuple<Descriptor> curFromTuple = new NTuple<Descriptor>();
for (int i = 0; i < fromTupleSize; i++) {
Descriptor desc = fromDescTuple.get(i);
- curTuple.add(desc);
- addFlowEdge(getFlowNode(curTuple), toNode, fromDescTuple, toDescTuple);
+ curFromTuple.add(desc);
+ int toTupleSize = toDescTuple.size();
+ NTuple<Descriptor> curToTuple = new NTuple<Descriptor>();
+ for (int k = 0; k < toTupleSize; k++) {
+ Descriptor toDesc = toDescTuple.get(k);
+ curToTuple.add(toDesc);
+ addFlowEdge(getFlowNode(curFromTuple), getFlowNode(curToTuple), fromDescTuple, toDescTuple);
+ }
}
- int toTupleSize = toDescTuple.size();
- curTuple = new NTuple<Descriptor>();
- for (int i = 0; i < toTupleSize; i++) {
- Descriptor desc = toDescTuple.get(i);
- curTuple.add(desc);
- addFlowEdge(fromNode, getFlowNode(curTuple), fromDescTuple, toDescTuple);
- }
+ // int fromTupleSize = fromDescTuple.size();
+ // NTuple<Descriptor> curTuple = new NTuple<Descriptor>();
+ // for (int i = 0; i < fromTupleSize; i++) {
+ // Descriptor desc = fromDescTuple.get(i);
+ // curTuple.add(desc);
+ // addFlowEdge(getFlowNode(curTuple), toNode, fromDescTuple, toDescTuple);
+ // }
+ //
+ // int toTupleSize = toDescTuple.size();
+ // curTuple = new NTuple<Descriptor>();
+ // for (int i = 0; i < toTupleSize; i++) {
+ // Descriptor desc = toDescTuple.get(i);
+ // curTuple.add(desc);
+ // addFlowEdge(fromNode, getFlowNode(curTuple), fromDescTuple, toDescTuple);
+ // }
}
fromNode.addOutEdge(edge);
System.out.println("add a new edge=" + edge);
-
}
public FlowNode getFlowNode(NTuple<Descriptor> descTuple) {
- if (mapDescTupleToInferNode.containsKey(descTuple)) {
- return mapDescTupleToInferNode.get(descTuple);
- } else {
+ if (!mapDescTupleToInferNode.containsKey(descTuple)) {
FlowNode node = createNewFlowNode(descTuple);
- return node;
+ mapDescTupleToInferNode.put(descTuple, node);
}
+ return mapDescTupleToInferNode.get(descTuple);
}
public FlowNode getThisVarNode() {
public FlowNode createNewFlowNode(NTuple<Descriptor> tuple) {
if (!mapDescTupleToInferNode.containsKey(tuple)) {
-
- FlowNode node = new FlowNode(tuple, isParamter(tuple));
+ FlowNode node = new FlowNode(tuple);
mapDescTupleToInferNode.put(tuple, node);
nodeSet.add(node);
+ mapLocTupleToFlowNode.put(getLocationTuple(node), node);
+
if (tuple.size() > 1) {
NTuple<Descriptor> baseTuple = tuple.subList(0, tuple.size() - 1);
getFlowNode(baseTuple).addFieldNode(node);
}
- System.out.println("Creating new node=" + node);
+ // System.out.println("Creating new node=" + node);
return node;
} else {
return mapDescTupleToInferNode.get(tuple);
}
- public void setReturnFlowNode(NTuple<Descriptor> tuple) {
+ public void addReturnFlowNode(NTuple<Descriptor> tuple) {
if (!mapDescTupleToInferNode.containsKey(tuple)) {
createNewFlowNode(tuple);
return returnNodeSet;
}
- public boolean isParamter(NTuple<Descriptor> tuple) {
+ public Set<FlowNode> getLocalReachFlowNodeSetFrom(FlowNode fn) {
+ Set<FlowNode> set = new HashSet<FlowNode>();
+ recurLocalReachFlowNodeSet(fn, set);
+ return set;
+ }
+
+ private void recurLocalReachFlowNodeSet(FlowNode fn, Set<FlowNode> visited) {
+
+ for (Iterator iterator = fn.getOutEdgeSet().iterator(); iterator.hasNext();) {
+ FlowEdge edge = (FlowEdge) iterator.next();
+ FlowNode dstNode = edge.getDst();
+
+ if (!visited.contains(dstNode)) {
+ visited.add(dstNode);
+ recurLocalReachFlowNodeSet(dstNode, visited);
+ }
+ }
+
+ }
+
+ private void getReachFlowNodeSetFrom(FlowNode fn, Set<FlowNode> visited) {
+
+ for (Iterator iterator = fn.getOutEdgeSet().iterator(); iterator.hasNext();) {
+ FlowEdge edge = (FlowEdge) iterator.next();
+
+ if (fn.equals(getFlowNode(edge.getInitTuple()))) {
+ FlowNode dstNode = getFlowNode(edge.getEndTuple());
+ if (!visited.contains(dstNode)) {
+ visited.add(dstNode);
+ getReachFlowNodeSetFrom(dstNode, visited);
+ }
+ }
+ }
+
+ }
+
+ public Set<FlowNode> getReachFlowNodeSetFrom(FlowNode fn) {
+ Set<FlowNode> set = new HashSet<FlowNode>();
+ getReachFlowNodeSetFrom(fn, set);
+ return set;
+ }
+
+ // private void getReachFlowNodeSetFrom(FlowNode fn, Set<FlowNode> visited) {
+ //
+ // for (Iterator iterator = fn.getOutEdgeSet().iterator();
+ // iterator.hasNext();) {
+ // FlowEdge edge = (FlowEdge) iterator.next();
+ //
+ // if (fn.equals(getFlowNode(edge.getInitTuple()))) {
+ //
+ // FlowNode dstNode = getFlowNode(edge.getEndTuple());
+ //
+ // if (!visited.contains(dstNode)) {
+ // visited.add(dstNode);
+ // getReachFlowNodeSetFrom(dstNode, visited);
+ // }
+ // }
+ // }
+ //
+ // }
+
+ public Set<NTuple<Location>> getReachableFlowTupleSet(Set<NTuple<Location>> visited, FlowNode fn) {
+ for (Iterator iterator = fn.getOutEdgeSet().iterator(); iterator.hasNext();) {
+ FlowEdge edge = (FlowEdge) iterator.next();
+
+ if (fn.getDescTuple().equals(edge.getInitTuple())) {
+ FlowNode dstNode = getFlowNode(edge.getEndTuple());
+ NTuple<Location> dstTuple = getLocationTuple(dstNode);
+
+ if (!visited.contains(dstTuple)) {
+ visited.add(dstTuple);
+ visited.addAll(getReachableFlowTupleSet(visited, dstNode));
+ }
+
+ }
+ }
+ return visited;
+ }
+
+ public NTuple<Location> getLocationTuple(NTuple<Descriptor> descTuple) {
+ return getLocationTuple(getFlowNode(descTuple));
+ }
+
+ public NTuple<Location> getLocationTuple(FlowNode fn) {
+
+ if (!mapFlowNodeToLocTuple.containsKey(fn)) {
+ NTuple<Descriptor> descTuple = fn.getDescTuple();
+ NTuple<Location> locTuple = new NTuple<Location>();
+ ClassDescriptor cd = null;
+
+ Descriptor localDesc = fn.getDescTuple().get(0);
+
+ if (fn.isIntermediate()) {
+ Location interLoc = new Location(md, localDesc.getSymbol());
+ interLoc.setLocDescriptor(localDesc);
+ locTuple.add(interLoc);
+ } else if (localDesc.getSymbol().equals(LocationInference.TOPLOC)) {
+ Location topLoc = new Location(md, Location.TOP);
+ topLoc.setLocDescriptor(LocationInference.TOPDESC);
+ locTuple.add(topLoc);
+ } else if (localDesc.getSymbol().equals(LocationInference.GLOBALLOC)) {
+ Location globalLoc = new Location(md, LocationInference.GLOBALLOC);
+ globalLoc.setLocDescriptor(LocationInference.GLOBALDESC);
+ locTuple.add(globalLoc);
+ } else {
+ // normal case
+ for (int i = 0; i < descTuple.size(); i++) {
+ Descriptor curDesc = descTuple.get(i);
+ Location loc;
+ if (i == 0) {
+ loc = new Location(md, curDesc.getSymbol());
+ loc.setLocDescriptor(curDesc);
+ cd = ((VarDescriptor) curDesc).getType().getClassDesc();
+ } else {
+ loc = new Location(cd, curDesc.getSymbol());
+ loc.setLocDescriptor(curDesc);
+ cd = ((FieldDescriptor) curDesc).getType().getClassDesc();
+ }
+ locTuple.add(loc);
+ }
+ }
+
+ mapFlowNodeToLocTuple.put(fn, locTuple);
+ }
+ return mapFlowNodeToLocTuple.get(fn);
+ }
+
+ public Set<FlowNode> getIncomingFlowNodeSet(FlowNode node) {
+ Set<FlowNode> set = new HashSet<FlowNode>();
+ getIncomingFlowNodeSet(node, set);
+ return set;
+ }
+
+ public void getIncomingFlowNodeSet(FlowNode node, Set<FlowNode> visited) {
+
+ for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
+ FlowNode curNode = (FlowNode) iterator.next();
+ Set<FlowEdge> edgeSet = curNode.getOutEdgeSet();
+
+ for (Iterator iterator2 = edgeSet.iterator(); iterator2.hasNext();) {
+ FlowEdge flowEdge = (FlowEdge) iterator2.next();
+
+ 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 = node.getOutEdgeSet();
+ 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();
+ }
+ locTuple.add(loc);
+ }
+ set.add(locTuple);
+ }
+ }
+ }
+ return set;
+ }
+
+ public boolean isParameter(NTuple<Descriptor> tuple) {
// return true if a descriptor tuple is started with a parameter descriptor
Descriptor firstIdxDesc = tuple.get(0);
return mapParamDescToIdx.containsKey(firstIdxDesc);
}
- public int getParamIdx(NTuple<Descriptor> tuple) {
- Descriptor firstDesc = tuple.get(0);
- return mapParamDescToIdx.get(firstDesc).intValue();
- }
-
private void drawEdges(FlowNode node, BufferedWriter bw, Set<FlowNode> addedNodeSet,
Set<FlowEdge> addedEdgeSet) throws IOException {
projects / IRC.git / blobdiff