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> returnNodeSet;
25 Map<FlowNode, Set<FlowEdge>> mapFlowNodeToInEdgeSet;
26 Map<FlowNode, Set<FlowEdge>> mapFlowNodeToOutEdgeSet;
28 Map<NTuple<Location>, FlowNode> mapLocTupleToFlowNode;
29 Map<FlowNode, NTuple<Location>> mapFlowNodeToLocTuple;
31 // maps the composite representation of field/var descriptors to infer nodes
32 Map<NTuple<Descriptor>, FlowNode> mapDescTupleToInferNode;
34 // maps a paramter descriptor to its index
35 Map<Descriptor, Integer> mapParamDescToIdx;
37 // DS for the lattice generation
38 Map<Integer, FlowNode> mapIdxToFlowNode;
40 public static int interseed = 0;
44 public FlowGraph(MethodDescriptor md, Map<Descriptor, Integer> mapParamDescToIdx) {
46 this.mapFlowNodeToLocTuple = new HashMap<FlowNode, NTuple<Location>>();
47 this.mapLocTupleToFlowNode = new HashMap<NTuple<Location>, FlowNode>();
48 this.mapDescTupleToInferNode = new HashMap<NTuple<Descriptor>, FlowNode>();
49 this.mapParamDescToIdx = new HashMap<Descriptor, Integer>();
50 this.mapParamDescToIdx.putAll(mapParamDescToIdx);
51 this.returnNodeSet = new HashSet<FlowNode>();
52 this.mapIdxToFlowNode = new HashMap<Integer, FlowNode>();
53 this.mapFlowNodeToOutEdgeSet = new HashMap<FlowNode, Set<FlowEdge>>();
54 this.mapFlowNodeToInEdgeSet = new HashMap<FlowNode, Set<FlowEdge>>();
57 // create a node for 'this' varialbe
58 // NTuple<Descriptor> thisDescTuple = new NTuple<Descriptor>();
59 // thisDescTuple.add(md.getThis());
61 NTuple<Descriptor> thisVarTuple = new NTuple<Descriptor>();
62 thisVarTuple.add(md.getThis());
63 FlowNode thisNode = createNewFlowNode(thisVarTuple);
64 thisNode.setSkeleton(true);
65 thisVarNode = thisNode;
72 public Map<NTuple<Descriptor>, FlowNode> getMapDescTupleToInferNode() {
73 return mapDescTupleToInferNode;
76 public void setMapDescTupleToInferNode(Map<NTuple<Descriptor>, FlowNode> in) {
77 this.mapDescTupleToInferNode.putAll(in);
80 public Map<NTuple<Location>, FlowNode> getMapLocTupleToFlowNode() {
81 return mapLocTupleToFlowNode;
84 public void setMapLocTupleToFlowNode(Map<NTuple<Location>, FlowNode> in) {
85 this.mapLocTupleToFlowNode.putAll(in);
88 public void setReturnNodeSet(Set<FlowNode> in) {
89 this.returnNodeSet.addAll(in);
92 public void setThisVarNode(FlowNode thisVarNode) {
93 this.thisVarNode = thisVarNode;
96 public Map<Descriptor, Integer> getMapParamDescToIdx() {
97 return mapParamDescToIdx;
100 public FlowNode createIntermediateNode() {
101 NTuple<Descriptor> tuple = new NTuple<Descriptor>();
102 Descriptor interDesc = new InterDescriptor(LocationInference.INTERLOC + interseed);
103 tuple.add(interDesc);
106 FlowNode newNode = new FlowNode(tuple);
107 newNode.setIntermediate(true);
109 mapDescTupleToInferNode.put(tuple, newNode);
110 // nodeSet.add(newNode);
112 System.out.println("create new intermediate node= " + newNode);
117 private void setupMapIdxToDesc() {
119 Set<Descriptor> descSet = mapParamDescToIdx.keySet();
120 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
121 Descriptor paramDesc = (Descriptor) iterator.next();
122 int idx = mapParamDescToIdx.get(paramDesc);
123 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
124 descTuple.add(paramDesc);
125 FlowNode paramNode = getFlowNode(descTuple);
126 mapIdxToFlowNode.put(idx, paramNode);
127 paramNode.setSkeleton(true);
132 public int getNumParameters() {
133 return mapIdxToFlowNode.keySet().size();
136 public FlowNode getParamFlowNode(int idx) {
137 return mapIdxToFlowNode.get(idx);
140 public Set<FlowEdge> getEdgeSet() {
141 Set<FlowEdge> edgeSet = new HashSet<FlowEdge>();
143 Set<FlowNode> nodeSet = getNodeSet();
144 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
145 FlowNode flowNode = (FlowNode) iterator.next();
146 edgeSet.addAll(getOutEdgeSet(flowNode));
152 public Set<FlowNode> getNodeSet() {
153 Set<FlowNode> set = new HashSet<FlowNode>();
154 set.addAll(mapDescTupleToInferNode.values());
158 public MethodDescriptor getMethodDescriptor() {
162 public boolean isParamDesc(Descriptor desc) {
164 if (mapParamDescToIdx.containsKey(desc)) {
165 int idx = mapParamDescToIdx.get(desc);
166 if (!md.isStatic() && idx == 0) {
175 public boolean hasEdge(NTuple<Descriptor> fromDescTuple, NTuple<Descriptor> toDescTuple) {
177 FlowNode fromNode = mapDescTupleToInferNode.get(fromDescTuple);
178 FlowNode toNode = mapDescTupleToInferNode.get(toDescTuple);
180 Set<FlowEdge> fromNodeOutEdgeSet = getOutEdgeSet(fromNode);
181 for (Iterator iterator = fromNodeOutEdgeSet.iterator(); iterator.hasNext();) {
182 FlowEdge flowEdge = (FlowEdge) iterator.next();
183 if (flowEdge.getDst().equals(toNode)) {
186 if (hasEdge(flowEdge.getDst().getDescTuple(), toDescTuple)) {
195 public Set<FlowEdge> getOutEdgeSetStartingFrom(FlowNode startNode) {
197 Descriptor prefixDesc = startNode.getCurrentDescTuple().get(0);
199 // returns the set of edges that share the same prefix of startNode
200 Set<FlowEdge> edgeSet = new HashSet<FlowEdge>();
202 for (Iterator<Set<FlowEdge>> iter = mapFlowNodeToOutEdgeSet.values().iterator(); iter.hasNext();) {
203 Set<FlowEdge> nodeEdgeSet = iter.next();
204 for (Iterator<FlowEdge> iter2 = nodeEdgeSet.iterator(); iter2.hasNext();) {
205 FlowEdge edge = iter2.next();
206 if (edge.getInitTuple().get(0).equals(prefixDesc)) {
215 public Set<FlowEdge> getOutEdgeSet(FlowNode node) {
216 if (!mapFlowNodeToOutEdgeSet.containsKey(node)) {
217 mapFlowNodeToOutEdgeSet.put(node, new HashSet<FlowEdge>());
219 return mapFlowNodeToOutEdgeSet.get(node);
222 public Set<FlowEdge> getInEdgeSet(FlowNode node) {
223 if (!mapFlowNodeToInEdgeSet.containsKey(node)) {
224 mapFlowNodeToInEdgeSet.put(node, new HashSet<FlowEdge>());
226 return mapFlowNodeToInEdgeSet.get(node);
229 public void addValueFlowEdge(NTuple<Descriptor> fromDescTuple, NTuple<Descriptor> toDescTuple) {
231 FlowNode fromNode = getFlowNode(fromDescTuple);
232 FlowNode toNode = getFlowNode(toDescTuple);
234 if (toNode.getDescTuple().get(0).equals(LocationInference.LITERALDESC)) {
238 // System.out.println("create an edge from " + fromNode + " to " + toNode);
240 int fromTupleSize = fromDescTuple.size();
241 NTuple<Descriptor> curFromTuple = new NTuple<Descriptor>();
242 for (int i = 0; i < fromTupleSize; i++) {
243 Descriptor desc = fromDescTuple.get(i);
244 curFromTuple.add(desc);
245 int toTupleSize = toDescTuple.size();
246 NTuple<Descriptor> curToTuple = new NTuple<Descriptor>();
247 for (int k = 0; k < toTupleSize; k++) {
248 Descriptor toDesc = toDescTuple.get(k);
249 curToTuple.add(toDesc);
250 addFlowEdge(getFlowNode(curFromTuple), getFlowNode(curToTuple), fromDescTuple, toDescTuple);
254 // int fromTupleSize = fromDescTuple.size();
255 // NTuple<Descriptor> curTuple = new NTuple<Descriptor>();
256 // for (int i = 0; i < fromTupleSize; i++) {
257 // Descriptor desc = fromDescTuple.get(i);
258 // curTuple.add(desc);
259 // addFlowEdge(getFlowNode(curTuple), toNode, fromDescTuple, toDescTuple);
262 // int toTupleSize = toDescTuple.size();
263 // curTuple = new NTuple<Descriptor>();
264 // for (int i = 0; i < toTupleSize; i++) {
265 // Descriptor desc = toDescTuple.get(i);
266 // curTuple.add(desc);
267 // addFlowEdge(fromNode, getFlowNode(curTuple), fromDescTuple, toDescTuple);
272 private void addFlowEdge(FlowNode fromNode, FlowNode toNode, NTuple<Descriptor> initTuple,
273 NTuple<Descriptor> endTuple) {
275 FlowEdge edge = new FlowEdge(fromNode, toNode, initTuple, endTuple);
276 addOutEdge(fromNode, edge);
277 addInEdge(toNode, edge);
279 // System.out.println("add a new edge=" + edge);
282 private void addInEdge(FlowNode toNode, FlowEdge edge) {
283 getInEdgeSet(toNode).add(edge);
286 private void addOutEdge(FlowNode fromNode, FlowEdge edge) {
287 if (!mapFlowNodeToOutEdgeSet.containsKey(fromNode)) {
288 mapFlowNodeToOutEdgeSet.put(fromNode, new HashSet<FlowEdge>());
290 mapFlowNodeToOutEdgeSet.get(fromNode).add(edge);
293 public boolean contains(NTuple<Descriptor> descTuple) {
294 return mapDescTupleToInferNode.containsKey(descTuple);
297 public FlowNode getFlowNode(NTuple<Descriptor> descTuple) {
298 if (!mapDescTupleToInferNode.containsKey(descTuple)) {
299 FlowNode node = createNewFlowNode(descTuple);
300 mapDescTupleToInferNode.put(descTuple, node);
302 return mapDescTupleToInferNode.get(descTuple);
305 public FlowNode getThisVarNode() {
309 public FlowNode createNewFlowNode(NTuple<Descriptor> tuple) {
311 if (!mapDescTupleToInferNode.containsKey(tuple)) {
312 FlowNode node = new FlowNode(tuple);
313 mapDescTupleToInferNode.put(tuple, node);
314 // nodeSet.add(node);
316 mapLocTupleToFlowNode.put(getLocationTuple(node), node);
318 if (tuple.size() > 1) {
319 NTuple<Descriptor> baseTuple = tuple.subList(0, tuple.size() - 1);
320 getFlowNode(baseTuple).addFieldNode(node);
323 // System.out.println("Creating new node=" + node);
326 return mapDescTupleToInferNode.get(tuple);
331 public void addReturnFlowNode(NTuple<Descriptor> tuple) {
333 if (!mapDescTupleToInferNode.containsKey(tuple)) {
334 createNewFlowNode(tuple);
337 FlowNode node = mapDescTupleToInferNode.get(tuple);
338 returnNodeSet.add(node);
341 public Set<FlowNode> getReturnNodeSet() {
342 return returnNodeSet;
345 public Set<FlowNode> getLocalReachFlowNodeSetFrom(FlowNode fn) {
346 Set<FlowNode> set = new HashSet<FlowNode>();
347 recurLocalReachFlowNodeSet(fn, set);
351 private void recurLocalReachFlowNodeSet(FlowNode fn, Set<FlowNode> visited) {
353 Set<FlowEdge> outEdgeSet = getOutEdgeSet(fn);
354 for (Iterator iterator = outEdgeSet.iterator(); iterator.hasNext();) {
355 FlowEdge edge = (FlowEdge) iterator.next();
356 FlowNode dstNode = edge.getDst();
358 if (!visited.contains(dstNode)) {
359 visited.add(dstNode);
360 recurLocalReachFlowNodeSet(dstNode, visited);
366 private void getReachFlowNodeSetFrom(FlowNode fn, Set<FlowNode> visited) {
368 Set<FlowEdge> outEdgeSet = getOutEdgeSet(fn);
369 for (Iterator iterator = outEdgeSet.iterator(); iterator.hasNext();) {
370 FlowEdge edge = (FlowEdge) iterator.next();
372 if (fn.equals(getFlowNode(edge.getInitTuple()))) {
373 FlowNode dstNode = getFlowNode(edge.getEndTuple());
374 if (!visited.contains(dstNode)) {
375 visited.add(dstNode);
376 getReachFlowNodeSetFrom(dstNode, visited);
383 public Set<FlowNode> getReachFlowNodeSetFrom(FlowNode fn) {
384 Set<FlowNode> set = new HashSet<FlowNode>();
385 getReachFlowNodeSetFrom(fn, set);
389 public Set<FlowNode> getReachableSetFrom(NTuple<Descriptor> prefix) {
390 Set<FlowNode> reachableSet = new HashSet<FlowNode>();
392 Set<FlowNode> nodeSet = getNodeSet();
393 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
394 FlowNode flowNode = (FlowNode) iterator.next();
395 if (flowNode.getCurrentDescTuple().startsWith(prefix)) {
396 recurReachableSetFrom(flowNode, reachableSet);
403 // private void getReachFlowNodeSetFrom(FlowNode fn, Set<FlowNode> visited) {
405 // for (Iterator iterator = fn.getOutEdgeSet().iterator();
406 // iterator.hasNext();) {
407 // FlowEdge edge = (FlowEdge) iterator.next();
409 // if (fn.equals(getFlowNode(edge.getInitTuple()))) {
411 // FlowNode dstNode = getFlowNode(edge.getEndTuple());
413 // if (!visited.contains(dstNode)) {
414 // visited.add(dstNode);
415 // getReachFlowNodeSetFrom(dstNode, visited);
422 private void recurReachableSetFrom(FlowNode curNode, Set<FlowNode> reachableSet) {
424 Set<FlowEdge> edgeSet = getOutEdgeSet(curNode);
425 for (Iterator iterator = edgeSet.iterator(); iterator.hasNext();) {
426 FlowEdge edge = (FlowEdge) iterator.next();
427 FlowNode dstNode = getFlowNode(edge.getEndTuple());
428 if (!reachableSet.contains(dstNode)) {
429 reachableSet.add(dstNode);
430 recurReachableSetFrom(dstNode, reachableSet);
436 public Set<NTuple<Location>> getReachableFlowTupleSet(Set<NTuple<Location>> visited, FlowNode fn) {
438 Set<FlowEdge> outEdgeSet = getOutEdgeSet(fn);
440 for (Iterator iterator = outEdgeSet.iterator(); iterator.hasNext();) {
441 FlowEdge edge = (FlowEdge) iterator.next();
443 if (fn.getDescTuple().equals(edge.getInitTuple())) {
444 FlowNode dstNode = getFlowNode(edge.getEndTuple());
445 NTuple<Location> dstTuple = getLocationTuple(dstNode);
447 if (!visited.contains(dstTuple)) {
448 visited.add(dstTuple);
449 visited.addAll(getReachableFlowTupleSet(visited, dstNode));
457 public NTuple<Location> getLocationTuple(NTuple<Descriptor> descTuple) {
458 return getLocationTuple(getFlowNode(descTuple));
461 public NTuple<Location> getLocationTuple(FlowNode fn) {
463 if (!mapFlowNodeToLocTuple.containsKey(fn)) {
464 NTuple<Descriptor> descTuple = fn.getDescTuple();
465 NTuple<Location> locTuple = new NTuple<Location>();
466 ClassDescriptor cd = null;
468 Descriptor localDesc = fn.getDescTuple().get(0);
470 System.out.println("descTuple=" + descTuple);
472 if (fn.isIntermediate()) {
473 Location interLoc = new Location(md, localDesc.getSymbol());
474 interLoc.setLocDescriptor(localDesc);
475 locTuple.add(interLoc);
476 } else if (localDesc.getSymbol().equals(SSJavaAnalysis.TOP)) {
477 Location topLoc = new Location(md, Location.TOP);
478 topLoc.setLocDescriptor(LocationInference.TOPDESC);
479 locTuple.add(topLoc);
480 } else if (localDesc.getSymbol().equals(LocationInference.GLOBALLOC)) {
481 Location globalLoc = new Location(md, LocationInference.GLOBALLOC);
482 globalLoc.setLocDescriptor(LocationInference.GLOBALDESC);
483 locTuple.add(globalLoc);
486 for (int i = 0; i < descTuple.size(); i++) {
487 Descriptor curDesc = descTuple.get(i);
490 loc = new Location(md, curDesc.getSymbol());
491 loc.setLocDescriptor(curDesc);
492 if (curDesc instanceof VarDescriptor) {
493 cd = ((VarDescriptor) curDesc).getType().getClassDesc();
495 // otherwise it should be the last element
499 loc = new Location(cd, curDesc.getSymbol());
500 loc.setLocDescriptor(curDesc);
502 if (curDesc instanceof FieldDescriptor) {
503 cd = ((FieldDescriptor) curDesc).getType().getClassDesc();
504 } else if (curDesc instanceof LocationDescriptor) {
505 cd = ((LocationDescriptor) curDesc).getEnclosingClassDesc();
507 // otherwise it should be the last element of the tuple
516 mapFlowNodeToLocTuple.put(fn, locTuple);
518 return mapFlowNodeToLocTuple.get(fn);
521 public Set<FlowNode> getIncomingFlowNodeSet(FlowNode node) {
522 Set<FlowNode> set = new HashSet<FlowNode>();
523 getIncomingFlowNodeSet(node, set);
527 public void getIncomingFlowNodeSet(FlowNode node, Set<FlowNode> visited) {
529 for (Iterator iterator = getNodeSet().iterator(); iterator.hasNext();) {
530 FlowNode curNode = (FlowNode) iterator.next();
531 Set<FlowEdge> edgeSet = getOutEdgeSet(curNode);
533 for (Iterator iterator2 = edgeSet.iterator(); iterator2.hasNext();) {
534 FlowEdge flowEdge = (FlowEdge) iterator2.next();
536 if (node.equals(getFlowNode(flowEdge.getEndTuple()))) {
537 FlowNode incomingNode = getFlowNode(flowEdge.getInitTuple());
539 if (!visited.contains(incomingNode)) {
540 visited.add(incomingNode);
541 getIncomingFlowNodeSet(incomingNode, visited);
549 public Set<NTuple<Location>> getIncomingFlowTupleSet(FlowNode fn) {
551 NTuple<Descriptor> dstTuple = fn.getDescTuple();
553 Set<NTuple<Location>> set = new HashSet<NTuple<Location>>();
555 ClassDescriptor cd = null;
557 for (Iterator iterator = getNodeSet().iterator(); iterator.hasNext();) {
558 FlowNode node = (FlowNode) iterator.next();
560 Set<FlowEdge> edgeSet = getOutEdgeSet(node);
561 for (Iterator iterator2 = edgeSet.iterator(); iterator2.hasNext();) {
562 FlowEdge flowEdge = (FlowEdge) iterator2.next();
563 if (dstTuple.equals(flowEdge.getEndTuple())) {
564 NTuple<Descriptor> initTuple = flowEdge.getInitTuple();
565 NTuple<Location> locTuple = new NTuple<Location>();
566 for (int i = 0; i < initTuple.size(); i++) {
567 Descriptor d = initTuple.get(i);
570 loc = new Location(md, d.getSymbol());
571 cd = ((VarDescriptor) d).getType().getClassDesc();
573 loc = new Location(cd, d.getSymbol());
574 cd = ((FieldDescriptor) d).getType().getClassDesc();
585 public boolean isParameter(NTuple<Descriptor> tuple) {
586 // return true if a descriptor tuple is started with a parameter descriptor
587 Descriptor firstIdxDesc = tuple.get(0);
588 return mapParamDescToIdx.containsKey(firstIdxDesc);
591 public int getParamIdx(NTuple<Descriptor> tuple) {
592 Descriptor firstIdxDesc = tuple.get(0);
593 return mapParamDescToIdx.get(firstIdxDesc);
596 public FlowGraph clone() {
597 FlowGraph clone = new FlowGraph(md, mapParamDescToIdx);
599 // clone.setNodeSet(getNodeSet());
600 clone.setMapLocTupleToFlowNode(getMapLocTupleToFlowNode());
601 clone.setMapFlowNodeToLocTuple(getMapFlowNodeToLocTuple());
602 clone.setMapDescTupleToInferNode(getMapDescTupleToInferNode());
604 clone.setMapFlowNodeToOutEdgeSet(getMapFlowNodeToOutEdgeSet());
605 clone.setReturnNodeSet(getReturnNodeSet());
606 clone.setThisVarNode(getThisVarNode());
611 public Map<FlowNode, NTuple<Location>> getMapFlowNodeToLocTuple() {
612 return mapFlowNodeToLocTuple;
615 public void setMapFlowNodeToLocTuple(Map<FlowNode, NTuple<Location>> in) {
616 this.mapFlowNodeToLocTuple.putAll(in);
619 public Map<FlowNode, Set<FlowEdge>> getMapFlowNodeToOutEdgeSet() {
620 return mapFlowNodeToOutEdgeSet;
623 public Set<FlowNode> getIncomingNodeSetByPrefix(Descriptor prefix) {
625 Set<FlowNode> incomingNodeSet = new HashSet<FlowNode>();
627 for (Iterator iterator = getNodeSet().iterator(); iterator.hasNext();) {
628 FlowNode curNode = (FlowNode) iterator.next();
629 Set<FlowEdge> outEdgeSet = getOutEdgeSet(curNode);
631 for (Iterator iterator2 = outEdgeSet.iterator(); iterator2.hasNext();) {
632 FlowEdge outEdge = (FlowEdge) iterator2.next();
634 if (outEdge.getEndTuple().startsWith(prefix)) {
635 incomingNodeSet.add(curNode);
636 recurIncomingNodeSetByPrefix(prefix, curNode, incomingNodeSet);
643 return incomingNodeSet;
647 private void recurIncomingNodeSetByPrefix(Descriptor prefix, FlowNode node, Set<FlowNode> visited) {
649 Set<FlowEdge> inEdgeSet = getInEdgeSet(node);
651 for (Iterator iterator = inEdgeSet.iterator(); iterator.hasNext();) {
652 FlowEdge inEdge = (FlowEdge) iterator.next();
654 FlowNode inNode = getFlowNode(inEdge.getInitTuple());
655 if (!inEdge.getInitTuple().startsWith(prefix) && !visited.contains(inNode)) {
657 recurIncomingNodeSetByPrefix(prefix, inNode, visited);
663 public void setMapFlowNodeToOutEdgeSet(Map<FlowNode, Set<FlowEdge>> inMap) {
664 Set<FlowNode> keySet = inMap.keySet();
665 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
666 FlowNode key = (FlowNode) iterator.next();
667 Set<FlowEdge> newEdgeSet = new HashSet<FlowEdge>();
668 newEdgeSet.addAll(inMap.get(key));
669 mapFlowNodeToOutEdgeSet.put(key, newEdgeSet);
673 private void drawEdges(FlowNode node, BufferedWriter bw, Set<FlowNode> addedNodeSet,
674 Set<FlowEdge> addedEdgeSet) throws IOException {
676 Set<FlowEdge> edgeSet = getOutEdgeSet(node);
678 for (Iterator<FlowEdge> iterator = edgeSet.iterator(); iterator.hasNext();) {
679 FlowEdge flowEdge = iterator.next();
681 FlowNode u = flowEdge.getSrc();
682 FlowNode v = flowEdge.getDst();
684 if (u.getDescTuple().equals(flowEdge.getInitTuple())
685 && v.getDescTuple().equals(flowEdge.getEndTuple())) {
686 // only draw an edge of the actual value flow
688 if (!addedEdgeSet.contains(flowEdge)) {
690 if (!addedNodeSet.contains(u)) {
694 if (!addedNodeSet.contains(v)) {
699 bw.write("" + u.getID() + " -> " + v.getID() + ";\n");
700 addedEdgeSet.add(flowEdge);
708 private void drawNode(FlowNode node, BufferedWriter bw) throws IOException {
709 bw.write(node.getID() + " [label=\"" + node.getPrettyID() + "\"]" + ";\n");
712 public void writeGraph() throws java.io.IOException {
716 public void writeGraph(String suffix) throws java.io.IOException {
718 String graphName = "flowgraph_" + md.toString() + suffix;
719 graphName = graphName.replaceAll("[\\W]", "");
721 BufferedWriter bw = new BufferedWriter(new FileWriter(graphName + ".dot"));
722 bw.write("digraph " + graphName + " {\n");
723 bw.write("compound=true;\n");
725 // then visit every flow node
727 // Iterator<FlowNode> iter = nodeSet.iterator();
728 Iterator<FlowNode> iter = getNodeSet().iterator();
730 Set<FlowEdge> addedEdgeSet = new HashSet<FlowEdge>();
731 Set<FlowNode> addedNodeSet = new HashSet<FlowNode>();
733 while (iter.hasNext()) {
734 FlowNode node = iter.next();
736 if (node.getDescTuple().size() == 1) {
737 // here, we just care about the local variable
738 if (node.getFieldNodeSet().size() > 0) {
739 drawSubgraph(node, bw, addedEdgeSet);
742 drawEdges(node, bw, addedNodeSet, addedEdgeSet);
751 public boolean constainsNode(FlowNode node) {
752 return getNodeSet().contains(node);
755 private void drawSubgraph(FlowNode node, BufferedWriter bw, Set<FlowEdge> addedSet)
758 bw.write("subgraph cluster_" + node.getID() + "{\n");
759 bw.write("label=\"" + node.getPrettyID() + "\";\n");
761 Set<FlowNode> fieldNodeSet = node.getFieldNodeSet();
762 for (Iterator iterator = fieldNodeSet.iterator(); iterator.hasNext();) {
763 FlowNode fieldNode = (FlowNode) iterator.next();
764 if (fieldNode.getFieldNodeSet().size() > 0) {
765 drawSubgraph(fieldNode, bw, addedSet);
767 Descriptor desc = fieldNode.getDescTuple().getLastElement();
768 if (desc instanceof VarDescriptor) {
769 VarDescriptor varDesc = (VarDescriptor) desc;
770 if (varDesc.getType().isPrimitive()) {
771 bw.write(fieldNode.getID() + " [label=\"" + fieldNode.getPrettyID() + "\"];\n");
773 } else if (desc instanceof FieldDescriptor) {
774 FieldDescriptor fieldDesc = (FieldDescriptor) desc;
775 if (fieldDesc.getType().isPrimitive()) {
776 bw.write(fieldNode.getID() + " [label=\"" + fieldNode.getPrettyID() + "\"];\n");