1 package Analysis.SSJava;
3 import java.io.BufferedWriter;
5 import java.io.FileWriter;
6 import java.io.IOException;
7 import java.util.HashMap;
8 import java.util.HashSet;
9 import java.util.Iterator;
12 import java.util.Map.Entry;
14 import Analysis.OoOJava.ConflictEdge;
15 import Analysis.OoOJava.ConflictNode;
17 import IR.FieldDescriptor;
18 import IR.MethodDescriptor;
19 import IR.VarDescriptor;
21 public class FlowGraph {
25 Set<FlowNode> nodeSet;
28 // maps the composite representation of field/var descriptors to infer nodes
29 Map<NTuple<Descriptor>, FlowNode> mapDescTupleToInferNode;
31 // maps an infer node to the set of neighbors which is pointed by the node
32 Map<NTuple<Descriptor>, Set<FlowNode>> mapNodeToNeighborSet;
34 // maps a paramter descriptor to its index
35 Map<Descriptor, Integer> mapParamDescToIdx;
38 public FlowGraph(MethodDescriptor md, Map<Descriptor, Integer> mapParamDescToIdx) {
40 nodeSet = new HashSet<FlowNode>();
41 mapDescTupleToInferNode = new HashMap<NTuple<Descriptor>, FlowNode>();
42 mapNodeToNeighborSet = new HashMap<NTuple<Descriptor>, Set<FlowNode>>();
43 this.mapParamDescToIdx = new HashMap<Descriptor, Integer>();
44 this.mapParamDescToIdx.putAll(mapParamDescToIdx);
46 // create a node for 'this' varialbe
47 NTuple<Descriptor> thisDescTuple = new NTuple<Descriptor>();
48 thisDescTuple.add(md.getThis());
49 FlowNode thisNode = new FlowNode(thisDescTuple, true);
50 NTuple<Descriptor> thisVarTuple = new NTuple<Descriptor>();
51 thisVarTuple.add(md.getThis());
52 createNewFlowNode(thisVarTuple);
53 thisVarNode = thisNode;
57 public Set<FlowNode> getNodeSet() {
61 public Set<FlowNode> getParameterNodeSet() {
62 Set<FlowNode> paramNodeSet = new HashSet<FlowNode>();
63 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
64 FlowNode fn = (FlowNode) iterator.next();
65 if (fn.isParameter()) {
72 public void addNeighbor(FlowNode node, FlowNode neighbor) {
73 Set<FlowNode> set = mapNodeToNeighborSet.get(node);
75 set = new HashSet<FlowNode>();
79 System.out.println("add a new neighbor " + neighbor + " to " + node);
82 public boolean hasEdge(NTuple<Descriptor> fromDescTuple, NTuple<Descriptor> toDescTuple) {
84 FlowNode fromNode = mapDescTupleToInferNode.get(fromDescTuple);
85 FlowNode toNode = mapDescTupleToInferNode.get(toDescTuple);
87 Set<FlowEdge> fromNodeOutEdgeSet = fromNode.getOutEdgeSet();
88 for (Iterator iterator = fromNodeOutEdgeSet.iterator(); iterator.hasNext();) {
89 FlowEdge flowEdge = (FlowEdge) iterator.next();
90 if (flowEdge.getDst().equals(toNode)) {
93 if (hasEdge(flowEdge.getDst().getDescTuple(), toDescTuple)) {
102 public void addValueFlowEdge(NTuple<Descriptor> fromDescTuple, NTuple<Descriptor> toDescTuple) {
104 FlowNode fromNode = mapDescTupleToInferNode.get(fromDescTuple);
105 FlowNode toNode = mapDescTupleToInferNode.get(toDescTuple);
107 System.out.println("create an edge from " + fromNode + " to " + toNode);
109 int fromTupleSize = fromDescTuple.size();
110 NTuple<Descriptor> curTuple = new NTuple<Descriptor>();
111 for (int i = 0; i < fromTupleSize; i++) {
112 Descriptor desc = fromDescTuple.get(i);
114 addFlowEdge(getFlowNode(curTuple), toNode, fromDescTuple, toDescTuple);
117 int toTupleSize = toDescTuple.size();
118 curTuple = new NTuple<Descriptor>();
119 for (int i = 0; i < toTupleSize; i++) {
120 Descriptor desc = toDescTuple.get(i);
122 addFlowEdge(fromNode, getFlowNode(curTuple), fromDescTuple, toDescTuple);
127 private void addFlowEdge(FlowNode fromNode, FlowNode toNode, NTuple<Descriptor> initTuple,
128 NTuple<Descriptor> endTuple) {
130 FlowEdge edge = new FlowEdge(fromNode, toNode, initTuple, endTuple);
131 fromNode.addOutEdge(edge);
133 System.out.println("add a new edge=" + edge);
137 public FlowNode getFlowNode(NTuple<Descriptor> descTuple) {
138 if (mapDescTupleToInferNode.containsKey(descTuple)) {
139 return mapDescTupleToInferNode.get(descTuple);
141 FlowNode node = createNewFlowNode(descTuple);
146 public FlowNode getThisVarNode() {
150 public FlowNode createNewFlowNode(NTuple<Descriptor> tuple) {
152 if (!mapDescTupleToInferNode.containsKey(tuple)) {
154 FlowNode node = new FlowNode(tuple, isParamter(tuple));
155 mapDescTupleToInferNode.put(tuple, node);
158 if (tuple.size() > 1) {
159 NTuple<Descriptor> baseTuple = tuple.subList(0, tuple.size() - 1);
160 getFlowNode(baseTuple).addFieldNode(node);
163 System.out.println("Creating new node=" + node);
166 return mapDescTupleToInferNode.get(tuple);
171 public boolean isParamter(NTuple<Descriptor> tuple) {
172 // return true if a descriptor tuple is started with a parameter descriptor
173 Descriptor firstIdxDesc = tuple.get(0);
174 return mapParamDescToIdx.containsKey(firstIdxDesc);
177 public int getParamIdx(NTuple<Descriptor> tuple) {
178 Descriptor firstDesc = tuple.get(0);
179 return mapParamDescToIdx.get(firstDesc).intValue();
182 private void drawEdges(FlowNode node, BufferedWriter bw, Set<FlowNode> addedNodeSet,
183 Set<FlowEdge> addedEdgeSet) throws IOException {
185 Set<FlowEdge> edgeSet = node.getOutEdgeSet();
187 for (Iterator<FlowEdge> iterator = edgeSet.iterator(); iterator.hasNext();) {
188 FlowEdge flowEdge = iterator.next();
190 FlowNode u = flowEdge.getSrc();
191 FlowNode v = flowEdge.getDst();
193 if (u.getDescTuple().equals(flowEdge.getInitTuple())
194 && v.getDescTuple().equals(flowEdge.getEndTuple())) {
195 // only draw an edge of the actual value flow
197 if (!addedEdgeSet.contains(flowEdge)) {
199 if (!addedNodeSet.contains(u)) {
203 if (!addedNodeSet.contains(v)) {
208 bw.write("" + u.getID() + " -> " + v.getID() + ";\n");
209 addedEdgeSet.add(flowEdge);
217 private void drawNode(FlowNode node, BufferedWriter bw) throws IOException {
218 bw.write(node.getID() + " [label=\"" + node.getPrettyID() + "\"]" + ";\n");
221 public void writeGraph() throws java.io.IOException {
223 String graphName = md.toString();
224 graphName = graphName.replaceAll("[\\W]", "");
226 BufferedWriter bw = new BufferedWriter(new FileWriter(graphName + ".dot"));
227 bw.write("digraph " + graphName + " {\n");
228 bw.write("compound=true;\n");
230 // then visit every flow node
232 Iterator<FlowNode> iter = nodeSet.iterator();
234 Set<FlowEdge> addedEdgeSet = new HashSet<FlowEdge>();
235 Set<FlowNode> addedNodeSet = new HashSet<FlowNode>();
237 while (iter.hasNext()) {
238 FlowNode node = iter.next();
240 if (node.getDescTuple().size() == 1) {
241 // here, we just care about the local variable
242 if (node.getFieldNodeSet().size() > 0) {
243 drawSubgraph(node, bw, addedEdgeSet);
246 drawEdges(node, bw, addedNodeSet, addedEdgeSet);
255 public boolean constainsNode(FlowNode node) {
256 return nodeSet.contains(node);
259 private void drawSubgraph(FlowNode node, BufferedWriter bw, Set<FlowEdge> addedSet)
262 bw.write("subgraph cluster_" + node.getID() + "{\n");
263 bw.write("label=\"" + node.getPrettyID() + "\";\n");
265 Set<FlowNode> fieldNodeSet = node.getFieldNodeSet();
266 for (Iterator iterator = fieldNodeSet.iterator(); iterator.hasNext();) {
267 FlowNode fieldNode = (FlowNode) iterator.next();
268 if (fieldNode.getFieldNodeSet().size() > 0) {
269 drawSubgraph(fieldNode, bw, addedSet);
271 Descriptor desc = fieldNode.getDescTuple().getLastElement();
272 if (desc instanceof VarDescriptor) {
273 VarDescriptor varDesc = (VarDescriptor) desc;
274 if (varDesc.getType().isPrimitive()) {
275 bw.write(fieldNode.getID() + " [label=\"" + fieldNode.getPrettyID() + "\"];\n");
277 } else if (desc instanceof FieldDescriptor) {
278 FieldDescriptor fieldDesc = (FieldDescriptor) desc;
279 if (fieldDesc.getType().isPrimitive()) {
280 bw.write(fieldNode.getID() + " [label=\"" + fieldNode.getPrettyID() + "\"];\n");