1 package Analysis.SSJava;
3 import java.io.BufferedWriter;
4 import java.io.FileWriter;
5 import java.io.IOException;
6 import java.util.HashMap;
7 import java.util.HashSet;
8 import java.util.Iterator;
12 import IR.ClassDescriptor;
14 import IR.FieldDescriptor;
15 import IR.MethodDescriptor;
16 import IR.VarDescriptor;
18 public class FlowGraph {
22 Set<FlowNode> nodeSet;
23 Set<FlowNode> returnNodeSet;
26 Map<NTuple<Location>, FlowNode> mapLocTupleToFlowNode;
27 Map<FlowNode, NTuple<Location>> mapFlowNodeToLocTuple;
29 // maps the composite representation of field/var descriptors to infer nodes
30 Map<NTuple<Descriptor>, FlowNode> mapDescTupleToInferNode;
32 // maps an infer node to the set of neighbors which is pointed by the node
33 Map<NTuple<Descriptor>, Set<FlowNode>> mapNodeToNeighborSet;
35 // maps a paramter descriptor to its index
36 Map<Descriptor, Integer> mapParamDescToIdx;
39 public FlowGraph(MethodDescriptor md, Map<Descriptor, Integer> mapParamDescToIdx) {
41 this.mapFlowNodeToLocTuple = new HashMap<FlowNode, NTuple<Location>>();
42 this.mapLocTupleToFlowNode = new HashMap<NTuple<Location>, FlowNode>();
43 this.nodeSet = new HashSet<FlowNode>();
44 this.mapDescTupleToInferNode = new HashMap<NTuple<Descriptor>, FlowNode>();
45 this.mapNodeToNeighborSet = new HashMap<NTuple<Descriptor>, Set<FlowNode>>();
46 this.mapParamDescToIdx = new HashMap<Descriptor, Integer>();
47 this.mapParamDescToIdx.putAll(mapParamDescToIdx);
48 this.returnNodeSet = new HashSet<FlowNode>();
51 // create a node for 'this' varialbe
52 NTuple<Descriptor> thisDescTuple = new NTuple<Descriptor>();
53 thisDescTuple.add(md.getThis());
54 FlowNode thisNode = new FlowNode(thisDescTuple, true);
55 NTuple<Descriptor> thisVarTuple = new NTuple<Descriptor>();
56 thisVarTuple.add(md.getThis());
57 createNewFlowNode(thisVarTuple);
58 thisVarNode = thisNode;
63 public Set<FlowNode> getNodeSet() {
67 public MethodDescriptor getMethodDescriptor() {
71 public Set<FlowNode> getParameterNodeSet() {
72 Set<FlowNode> paramNodeSet = new HashSet<FlowNode>();
73 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
74 FlowNode fn = (FlowNode) iterator.next();
75 if (fn.isParameter()) {
82 public void addNeighbor(FlowNode node, FlowNode neighbor) {
83 Set<FlowNode> set = mapNodeToNeighborSet.get(node);
85 set = new HashSet<FlowNode>();
89 System.out.println("add a new neighbor " + neighbor + " to " + node);
92 public boolean hasEdge(NTuple<Descriptor> fromDescTuple, NTuple<Descriptor> toDescTuple) {
94 FlowNode fromNode = mapDescTupleToInferNode.get(fromDescTuple);
95 FlowNode toNode = mapDescTupleToInferNode.get(toDescTuple);
97 Set<FlowEdge> fromNodeOutEdgeSet = fromNode.getOutEdgeSet();
98 for (Iterator iterator = fromNodeOutEdgeSet.iterator(); iterator.hasNext();) {
99 FlowEdge flowEdge = (FlowEdge) iterator.next();
100 if (flowEdge.getDst().equals(toNode)) {
103 if (hasEdge(flowEdge.getDst().getDescTuple(), toDescTuple)) {
112 public void addValueFlowEdge(NTuple<Descriptor> fromDescTuple, NTuple<Descriptor> toDescTuple) {
114 FlowNode fromNode = mapDescTupleToInferNode.get(fromDescTuple);
115 FlowNode toNode = mapDescTupleToInferNode.get(toDescTuple);
117 System.out.println("create an edge from " + fromNode + " to " + toNode);
119 int fromTupleSize = fromDescTuple.size();
120 NTuple<Descriptor> curTuple = new NTuple<Descriptor>();
121 for (int i = 0; i < fromTupleSize; i++) {
122 Descriptor desc = fromDescTuple.get(i);
124 addFlowEdge(getFlowNode(curTuple), toNode, fromDescTuple, toDescTuple);
127 int toTupleSize = toDescTuple.size();
128 curTuple = new NTuple<Descriptor>();
129 for (int i = 0; i < toTupleSize; i++) {
130 Descriptor desc = toDescTuple.get(i);
132 addFlowEdge(fromNode, getFlowNode(curTuple), fromDescTuple, toDescTuple);
137 private void addFlowEdge(FlowNode fromNode, FlowNode toNode, NTuple<Descriptor> initTuple,
138 NTuple<Descriptor> endTuple) {
140 FlowEdge edge = new FlowEdge(fromNode, toNode, initTuple, endTuple);
141 fromNode.addOutEdge(edge);
143 System.out.println("add a new edge=" + edge);
147 public FlowNode getFlowNode(NTuple<Descriptor> descTuple) {
148 if (mapDescTupleToInferNode.containsKey(descTuple)) {
149 return mapDescTupleToInferNode.get(descTuple);
151 FlowNode node = createNewFlowNode(descTuple);
156 public FlowNode getThisVarNode() {
160 public FlowNode createNewFlowNode(NTuple<Descriptor> tuple) {
162 if (!mapDescTupleToInferNode.containsKey(tuple)) {
164 FlowNode node = new FlowNode(tuple, isParamter(tuple));
165 mapDescTupleToInferNode.put(tuple, node);
168 mapLocTupleToFlowNode.put(getLocationTuple(node), node);
170 if (tuple.size() > 1) {
171 NTuple<Descriptor> baseTuple = tuple.subList(0, tuple.size() - 1);
172 getFlowNode(baseTuple).addFieldNode(node);
175 System.out.println("Creating new node=" + node);
178 return mapDescTupleToInferNode.get(tuple);
183 public void setReturnFlowNode(NTuple<Descriptor> tuple) {
185 if (!mapDescTupleToInferNode.containsKey(tuple)) {
186 createNewFlowNode(tuple);
189 FlowNode node = mapDescTupleToInferNode.get(tuple);
190 node.setReturn(true);
192 returnNodeSet.add(node);
195 public Set<FlowNode> getReturnNodeSet() {
196 return returnNodeSet;
199 public Set<FlowNode> getReachableFlowNodeSet(FlowNode fn) {
200 Set<FlowNode> set = new HashSet<FlowNode>();
201 getReachableFlowNodeSet(fn, set);
205 private void getReachableFlowNodeSet(FlowNode fn, Set<FlowNode> visited) {
207 for (Iterator iterator = fn.getOutEdgeSet().iterator(); iterator.hasNext();) {
208 FlowEdge edge = (FlowEdge) iterator.next();
210 if (fn.equals(getFlowNode(edge.getInitTuple()))) {
212 FlowNode dstNode = getFlowNode(edge.getEndTuple());
214 if (!visited.contains(dstNode)) {
215 visited.add(dstNode);
216 getReachableFlowNodeSet(dstNode, visited);
223 public Set<NTuple<Location>> getReachableFlowTupleSet(Set<NTuple<Location>> visited, FlowNode fn) {
224 for (Iterator iterator = fn.getOutEdgeSet().iterator(); iterator.hasNext();) {
225 FlowEdge edge = (FlowEdge) iterator.next();
227 if (fn.getDescTuple().equals(edge.getInitTuple())) {
228 FlowNode dstNode = getFlowNode(edge.getEndTuple());
229 NTuple<Location> dstTuple = getLocationTuple(dstNode);
231 if (!visited.contains(dstTuple)) {
232 visited.add(dstTuple);
233 visited.addAll(getReachableFlowTupleSet(visited, dstNode));
241 public NTuple<Location> getLocationTuple(FlowNode fn) {
243 if (!mapFlowNodeToLocTuple.containsKey(fn)) {
244 NTuple<Descriptor> descTuple = fn.getDescTuple();
245 NTuple<Location> locTuple = new NTuple<Location>();
246 ClassDescriptor cd = null;
248 for (int i = 0; i < descTuple.size(); i++) {
249 Descriptor curDesc = descTuple.get(i);
252 loc = new Location(md, curDesc.getSymbol());
253 loc.setLocDescriptor(md);
254 cd = ((VarDescriptor) curDesc).getType().getClassDesc();
256 loc = new Location(cd, curDesc.getSymbol());
257 loc.setLocDescriptor(curDesc);
258 cd = ((FieldDescriptor) curDesc).getType().getClassDesc();
262 mapFlowNodeToLocTuple.put(fn, locTuple);
264 return mapFlowNodeToLocTuple.get(fn);
267 public Set<FlowNode> getIncomingFlowNodeSet(FlowNode node) {
268 Set<FlowNode> set = new HashSet<FlowNode>();
269 getIncomingFlowNodeSet(node, set);
273 public void getIncomingFlowNodeSet(FlowNode node, Set<FlowNode> visited) {
275 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
276 FlowNode curNode = (FlowNode) iterator.next();
277 Set<FlowEdge> edgeSet = curNode.getOutEdgeSet();
279 for (Iterator iterator2 = edgeSet.iterator(); iterator2.hasNext();) {
280 FlowEdge flowEdge = (FlowEdge) iterator2.next();
282 if (node.equals(getFlowNode(flowEdge.getEndTuple()))) {
283 FlowNode incomingNode = getFlowNode(flowEdge.getInitTuple());
285 if (!visited.contains(incomingNode)) {
286 visited.add(incomingNode);
287 getIncomingFlowNodeSet(incomingNode, visited);
295 public Set<NTuple<Location>> getIncomingFlowTupleSet(FlowNode fn) {
297 NTuple<Descriptor> dstTuple = fn.getDescTuple();
299 Set<NTuple<Location>> set = new HashSet<NTuple<Location>>();
301 ClassDescriptor cd = null;
303 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
304 FlowNode node = (FlowNode) iterator.next();
305 Set<FlowEdge> edgeSet = node.getOutEdgeSet();
306 for (Iterator iterator2 = edgeSet.iterator(); iterator2.hasNext();) {
307 FlowEdge flowEdge = (FlowEdge) iterator2.next();
308 if (dstTuple.equals(flowEdge.getEndTuple())) {
309 NTuple<Descriptor> initTuple = flowEdge.getInitTuple();
310 NTuple<Location> locTuple = new NTuple<Location>();
311 for (int i = 0; i < initTuple.size(); i++) {
312 Descriptor d = initTuple.get(i);
315 loc = new Location(md, d.getSymbol());
316 cd = ((VarDescriptor) d).getType().getClassDesc();
318 loc = new Location(cd, d.getSymbol());
319 cd = ((FieldDescriptor) d).getType().getClassDesc();
330 public boolean isParamter(NTuple<Descriptor> tuple) {
331 // return true if a descriptor tuple is started with a parameter descriptor
332 Descriptor firstIdxDesc = tuple.get(0);
333 return mapParamDescToIdx.containsKey(firstIdxDesc);
336 public int getParamIdx(NTuple<Descriptor> tuple) {
337 Descriptor firstDesc = tuple.get(0);
338 return mapParamDescToIdx.get(firstDesc).intValue();
341 private void drawEdges(FlowNode node, BufferedWriter bw, Set<FlowNode> addedNodeSet,
342 Set<FlowEdge> addedEdgeSet) throws IOException {
344 Set<FlowEdge> edgeSet = node.getOutEdgeSet();
346 for (Iterator<FlowEdge> iterator = edgeSet.iterator(); iterator.hasNext();) {
347 FlowEdge flowEdge = iterator.next();
349 FlowNode u = flowEdge.getSrc();
350 FlowNode v = flowEdge.getDst();
352 if (u.getDescTuple().equals(flowEdge.getInitTuple())
353 && v.getDescTuple().equals(flowEdge.getEndTuple())) {
354 // only draw an edge of the actual value flow
356 if (!addedEdgeSet.contains(flowEdge)) {
358 if (!addedNodeSet.contains(u)) {
362 if (!addedNodeSet.contains(v)) {
367 bw.write("" + u.getID() + " -> " + v.getID() + ";\n");
368 addedEdgeSet.add(flowEdge);
376 private void drawNode(FlowNode node, BufferedWriter bw) throws IOException {
377 bw.write(node.getID() + " [label=\"" + node.getPrettyID() + "\"]" + ";\n");
380 public void writeGraph() throws java.io.IOException {
382 String graphName = "flowgraph_" + md.toString();
383 graphName = graphName.replaceAll("[\\W]", "");
385 BufferedWriter bw = new BufferedWriter(new FileWriter(graphName + ".dot"));
386 bw.write("digraph " + graphName + " {\n");
387 bw.write("compound=true;\n");
389 // then visit every flow node
391 Iterator<FlowNode> iter = nodeSet.iterator();
393 Set<FlowEdge> addedEdgeSet = new HashSet<FlowEdge>();
394 Set<FlowNode> addedNodeSet = new HashSet<FlowNode>();
396 while (iter.hasNext()) {
397 FlowNode node = iter.next();
399 if (node.getDescTuple().size() == 1) {
400 // here, we just care about the local variable
401 if (node.getFieldNodeSet().size() > 0) {
402 drawSubgraph(node, bw, addedEdgeSet);
405 drawEdges(node, bw, addedNodeSet, addedEdgeSet);
414 public boolean constainsNode(FlowNode node) {
415 return nodeSet.contains(node);
418 private void drawSubgraph(FlowNode node, BufferedWriter bw, Set<FlowEdge> addedSet)
421 bw.write("subgraph cluster_" + node.getID() + "{\n");
422 bw.write("label=\"" + node.getPrettyID() + "\";\n");
424 Set<FlowNode> fieldNodeSet = node.getFieldNodeSet();
425 for (Iterator iterator = fieldNodeSet.iterator(); iterator.hasNext();) {
426 FlowNode fieldNode = (FlowNode) iterator.next();
427 if (fieldNode.getFieldNodeSet().size() > 0) {
428 drawSubgraph(fieldNode, bw, addedSet);
430 Descriptor desc = fieldNode.getDescTuple().getLastElement();
431 if (desc instanceof VarDescriptor) {
432 VarDescriptor varDesc = (VarDescriptor) desc;
433 if (varDesc.getType().isPrimitive()) {
434 bw.write(fieldNode.getID() + " [label=\"" + fieldNode.getPrettyID() + "\"];\n");
436 } else if (desc instanceof FieldDescriptor) {
437 FieldDescriptor fieldDesc = (FieldDescriptor) desc;
438 if (fieldDesc.getType().isPrimitive()) {
439 bw.write(fieldNode.getID() + " [label=\"" + fieldNode.getPrettyID() + "\"];\n");