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;
13 import IR.FieldDescriptor;
14 import IR.VarDescriptor;
16 public class HierarchyGraph {
23 Map<HNode, Set<HNode>> mapHNodeToIncomingSet;
24 Map<HNode, Set<HNode>> mapHNodeToOutgoingSet;
26 Map<Descriptor, HNode> mapDescToHNode;
27 Map<HNode, Set<Descriptor>> mapHNodeToDescSet;
28 Map<HNode, HNode> mapHNodeToCurrentHNode; // tracking which node corresponds to the initial node
29 Map<String, HNode> mapHNodeNameToCurrentHNode; // tracking which node corresponds to the initial
31 Map<HNode, Set<HNode>> mapMergeNodetoMergingSet;
33 // data structures for a combination node
34 Map<Set<HNode>, HNode> mapSkeletonNodeSetToCombinationNode;
35 Map<HNode, Set<HNode>> mapCombinationNodeToCombineNodeSet;
36 Map<Set<HNode>, HNode> mapCombineNodeSetToCombinationNode;
37 Map<Set<HNode>, Set<HNode>> mapCombineNodeSetToOutgoingNodeSet;
39 Map<HNode, Set<HNode>> mapNormalNodeToSCNodeReachToSet;
43 // for the lattice generation
44 Map<HNode, Integer> mapHNodeToUniqueIndex;
45 Map<HNode, Set<Integer>> mapHNodeToBasis;
46 Set<Integer> BASISTOPELEMENT;
48 public HierarchyGraph() {
49 mapHNodeToIncomingSet = new HashMap<HNode, Set<HNode>>();
50 mapHNodeToOutgoingSet = new HashMap<HNode, Set<HNode>>();
51 mapHNodeToDescSet = new HashMap<HNode, Set<Descriptor>>();
52 mapDescToHNode = new HashMap<Descriptor, HNode>();
53 mapSkeletonNodeSetToCombinationNode = new HashMap<Set<HNode>, HNode>();
54 mapCombinationNodeToCombineNodeSet = new HashMap<HNode, Set<HNode>>();
55 mapCombineNodeSetToOutgoingNodeSet = new HashMap<Set<HNode>, Set<HNode>>();
56 mapCombineNodeSetToCombinationNode = new HashMap<Set<HNode>, HNode>();
57 nodeSet = new HashSet<HNode>();
59 mapHNodeToUniqueIndex = new HashMap<HNode, Integer>();
60 mapHNodeToBasis = new HashMap<HNode, Set<Integer>>();
62 mapMergeNodetoMergingSet = new HashMap<HNode, Set<HNode>>();
64 mapHNodeToCurrentHNode = new HashMap<HNode, HNode>();
66 mapHNodeNameToCurrentHNode = new HashMap<String, HNode>();
68 mapNormalNodeToSCNodeReachToSet = new HashMap<HNode, Set<HNode>>();
71 public Descriptor getDesc() {
75 public void setDesc(Descriptor desc) {
79 public String getName() {
83 public void setName(String name) {
87 public HierarchyGraph(Descriptor d) {
93 public Map<HNode, Set<Descriptor>> getMapHNodeToDescSet() {
94 return mapHNodeToDescSet;
97 public void setMapHNodeToDescSet(Map<HNode, Set<Descriptor>> map) {
98 mapHNodeToDescSet.putAll(map);
101 public Map<HNode, HNode> getMapHNodeToCurrentHNode() {
102 return mapHNodeToCurrentHNode;
105 public Map<String, HNode> getMapHNodeNameToCurrentHNode() {
106 return mapHNodeNameToCurrentHNode;
109 public void setMapHNodeToCurrentHNode(Map<HNode, HNode> mapHNodeToCurrentHNode) {
110 this.mapHNodeToCurrentHNode = mapHNodeToCurrentHNode;
113 public void setMapHNodeNameToCurrentHNode(Map<String, HNode> mapHNodeNameToCurrentHNode) {
114 this.mapHNodeNameToCurrentHNode = mapHNodeNameToCurrentHNode;
117 public Map<Descriptor, HNode> getMapDescToHNode() {
118 return mapDescToHNode;
121 public void setMapDescToHNode(Map<Descriptor, HNode> map) {
122 mapDescToHNode.putAll(map);
125 public Set<HNode> getNodeSet() {
129 public void addEdge(HNode srcHNode, HNode dstHNode) {
131 if (!nodeSet.contains(srcHNode)) {
132 nodeSet.add(srcHNode);
135 if (!nodeSet.contains(dstHNode)) {
136 nodeSet.add(dstHNode);
139 Set<HNode> possibleCycleSet = getPossibleCycleNodes(srcHNode, dstHNode);
141 if (possibleCycleSet.size() > 0) {
143 if (possibleCycleSet.size() == 1) {
144 System.out.println("possibleCycleSet=" + possibleCycleSet + " from src=" + srcHNode
145 + " dstHNode=" + dstHNode);
146 if (dstHNode.isSharedNode()) {
147 // it has already been assigned shared node.
149 dstHNode.setSharedNode(true);
150 System.out.println("$$$setShared=" + dstHNode);
155 System.out.println("--- CYCLIC VALUE FLOW: " + srcHNode + " -> " + dstHNode);
156 HNode newMergeNode = mergeNodes(possibleCycleSet, false);
157 newMergeNode.setSharedNode(true);
160 getIncomingNodeSet(dstHNode).add(srcHNode);
161 getOutgoingNodeSet(srcHNode).add(dstHNode);
162 // System.out.println("add an edge " + srcHNode + " -> " + dstHNode);
167 public void addNode(HNode node) {
171 public void addEdge(Descriptor src, Descriptor dst) {
173 if (src.equals(LocationInference.LITERALDESC)) {
174 // in this case, we do not need to add a source hnode
175 // just add a destination hnode
178 HNode srcHNode = getHNode(src);
179 HNode dstHNode = getHNode(dst);
180 addEdge(srcHNode, dstHNode);
185 public void setParamHNode(Descriptor d) {
186 getHNode(d).setSkeleton(true);
189 public HNode getHNode(Descriptor d) {
190 if (!mapDescToHNode.containsKey(d)) {
191 HNode newNode = new HNode(d);
193 if (d instanceof FieldDescriptor) {
194 newNode.setSkeleton(true);
197 if (d.equals(LocationInference.TOPDESC)) {
198 newNode.setSkeleton(true);
201 String symbol = d.getSymbol();
202 if (symbol.startsWith(LocationInference.PCLOC) || symbol.startsWith(LocationInference.RLOC)) {
203 newNode.setSkeleton(true);
206 mappingDescriptorToHNode(d, newNode);
207 nodeSet.add(newNode);
209 return mapDescToHNode.get(d);
212 public HNode getHNode(String name) {
213 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
214 HNode node = (HNode) iterator.next();
215 if (node.getName().equals(name)) {
222 private void mappingDescriptorToHNode(Descriptor desc, HNode node) {
223 mapDescToHNode.put(desc, node);
224 if (!mapHNodeToDescSet.containsKey(node)) {
225 mapHNodeToDescSet.put(node, new HashSet<Descriptor>());
227 mapHNodeToDescSet.get(node).add(desc);
230 public HierarchyGraph generateSkeletonGraph() {
232 // compose a skeleton graph that only consists of fields or parameters
233 HierarchyGraph skeletonGraph = new HierarchyGraph(desc);
234 skeletonGraph.setName(desc + "_SKELETON");
236 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
237 HNode src = (HNode) iterator.next();
238 if (src.isSkeleton()) {
239 Set<HNode> reachSet = getDirectlyReachSkeletonSet(src);
240 if (reachSet.size() > 0) {
241 for (Iterator iterator2 = reachSet.iterator(); iterator2.hasNext();) {
242 HNode dst = (HNode) iterator2.next();
243 skeletonGraph.addEdge(src, dst);
246 skeletonGraph.addNode(src);
251 skeletonGraph.setMapDescToHNode(getMapDescToHNode());
252 skeletonGraph.setMapHNodeToDescSet(getMapHNodeToDescSet());
253 skeletonGraph.setMapHNodetoMergeSet(getMapHNodetoMergeSet());
254 skeletonGraph.setMapHNodeToCurrentHNode(getMapHNodeToCurrentHNode());
255 skeletonGraph.setMapHNodeNameToCurrentHNode(getMapHNodeNameToCurrentHNode());
257 return skeletonGraph;
261 private Set<HNode> getDirectlyReachSkeletonSet(HNode node) {
263 Set<HNode> visited = new HashSet<HNode>();
264 Set<HNode> connected = new HashSet<HNode>();
265 recurReachSkeletonSet(node, connected, visited);
270 public void removeRedundantEdges() {
272 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
273 HNode src = (HNode) iterator.next();
274 Set<HNode> connectedSet = getOutgoingNodeSet(src);
275 Set<HNode> toberemovedSet = new HashSet<HNode>();
276 for (Iterator iterator2 = connectedSet.iterator(); iterator2.hasNext();) {
277 HNode dst = (HNode) iterator2.next();
278 Set<HNode> otherNeighborSet = new HashSet<HNode>();
279 otherNeighborSet.addAll(connectedSet);
280 otherNeighborSet.remove(dst);
281 for (Iterator iterator3 = otherNeighborSet.iterator(); iterator3.hasNext();) {
282 HNode neighbor = (HNode) iterator3.next();
283 if (reachTo(neighbor, dst, new HashSet<HNode>())) {
284 toberemovedSet.add(dst);
288 if (toberemovedSet.size() > 0) {
289 connectedSet.removeAll(toberemovedSet);
291 for (Iterator iterator2 = toberemovedSet.iterator(); iterator2.hasNext();) {
292 HNode node = (HNode) iterator2.next();
293 getIncomingNodeSet(node).remove(src);
301 public void simplifyHierarchyGraph() {
302 removeRedundantEdges();
303 combineRedundantNodes(false);
306 public void simplifySkeletonCombinationHierarchyGraph() {
307 removeRedundantEdges();
308 combineRedundantNodes(true);
311 public void combineRedundantNodes(boolean onlyCombinationNodes) {
312 // Combine field/parameter nodes who have the same set of incoming/outgoing edges.
313 boolean isUpdated = false;
315 isUpdated = combineTwoRedundatnNodes(onlyCombinationNodes);
319 public Set<HNode> getIncomingNodeSet(HNode node) {
320 if (!mapHNodeToIncomingSet.containsKey(node)) {
321 mapHNodeToIncomingSet.put(node, new HashSet<HNode>());
323 return mapHNodeToIncomingSet.get(node);
326 public Set<HNode> getOutgoingNodeSet(HNode node) {
327 if (!mapHNodeToOutgoingSet.containsKey(node)) {
328 mapHNodeToOutgoingSet.put(node, new HashSet<HNode>());
330 return mapHNodeToOutgoingSet.get(node);
333 private boolean combineTwoRedundatnNodes(boolean onlyCombinationNodes) {
334 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
335 HNode node1 = (HNode) iterator.next();
337 if ((onlyCombinationNodes && (!node1.isCombinationNode()))
338 || (!onlyCombinationNodes && (!node1.isSkeleton()))) {
342 Set<HNode> incomingNodeSet1 = getIncomingNodeSet(node1);
343 Set<HNode> outgoingNodeSet1 = getOutgoingNodeSet(node1);
345 for (Iterator iterator2 = nodeSet.iterator(); iterator2.hasNext();) {
346 HNode node2 = (HNode) iterator2.next();
348 if ((onlyCombinationNodes && (!node2.isCombinationNode()))
349 || (!onlyCombinationNodes && (!node2.isSkeleton()))) {
353 if (!isEligibleForMerging(node1, node2)) {
357 if (!node1.equals(node2)) {
359 Set<HNode> incomingNodeSet2 = getIncomingNodeSet(node2);
360 Set<HNode> outgoingNodeSet2 = getOutgoingNodeSet(node2);
362 if (incomingNodeSet1.equals(incomingNodeSet2)
363 && outgoingNodeSet1.equals(outgoingNodeSet2)) {
364 // need to merge node1 and node2
366 Set<HNode> mergeSet = new HashSet<HNode>();
369 mergeNodes(mergeSet, onlyCombinationNodes);
380 private boolean isEligibleForMerging(HNode node1, HNode node2) {
382 if (node1.isSharedNode() || node2.isSharedNode()) {
384 // if either of nodes is a shared node,
385 // all descriptors of node1 & node2 should have a primitive type
387 Set<Descriptor> descSet = new HashSet<Descriptor>();
388 descSet.addAll(getDescSetOfNode(node1));
389 descSet.addAll(getDescSetOfNode(node2));
391 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
392 Descriptor desc = (Descriptor) iterator.next();
393 if (!LocationInference.isPrimitive(desc)) {
402 private void addEdgeWithNoCycleCheck(HNode srcHNode, HNode dstHNode) {
403 getIncomingNodeSet(dstHNode).add(srcHNode);
404 getOutgoingNodeSet(srcHNode).add(dstHNode);
405 // System.out.println("addEdgeWithNoCycleCheck src=" + srcHNode + " -> " + dstHNode);
408 private HNode mergeNodes(Set<HNode> set, boolean onlyCombinationNodes) {
410 Set<HNode> incomingNodeSet = new HashSet<HNode>();
411 Set<HNode> outgoingNodeSet = new HashSet<HNode>();
413 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
414 HNode node = (HNode) iterator.next();
415 incomingNodeSet.addAll(getIncomingNodeSet(node));
416 outgoingNodeSet.addAll(getOutgoingNodeSet(node));
420 boolean isMergeNode = false;
421 if (onlyCombinationNodes) {
422 nodeName = "Comb" + (LocationInference.locSeed++);
424 nodeName = "Node" + (LocationInference.locSeed++);
427 HNode newMergeNode = new HNode(nodeName);
428 newMergeNode.setMergeNode(isMergeNode);
430 nodeSet.add(newMergeNode);
431 nodeSet.removeAll(set);
433 // if the input set contains a skeleton node, need to set a new merge node as skeleton also
434 boolean hasSkeleton = false;
435 boolean hasShared = false;
436 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
437 HNode inNode = (HNode) iterator.next();
438 if (inNode.isSkeleton()) {
441 if (inNode.isSharedNode()) {
445 // System.out.println("-----Set merging node=" + newMergeNode + " as a skeleton=" + set
446 // + " hasSkeleton=" + hasSkeleton + " CUR DESC=" + desc);
447 newMergeNode.setSkeleton(hasSkeleton);
448 newMergeNode.setSharedNode(hasShared);
450 System.out.println("-----MERGING NODE=" + set + " new node=" + newMergeNode);
452 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
453 HNode node = (HNode) iterator.next();
454 Set<Descriptor> descSetOfNode = getDescSetOfNode(node);
455 for (Iterator iterator2 = descSetOfNode.iterator(); iterator2.hasNext();) {
456 Descriptor desc = (Descriptor) iterator2.next();
457 mappingDescriptorToHNode(desc, newMergeNode);
461 for (Iterator iterator = incomingNodeSet.iterator(); iterator.hasNext();) {
462 HNode inNode = (HNode) iterator.next();
463 Set<HNode> outSet = getOutgoingNodeSet(inNode);
464 outSet.removeAll(set);
465 if (!set.contains(inNode)) {
466 addEdgeWithNoCycleCheck(inNode, newMergeNode);
470 for (Iterator iterator = outgoingNodeSet.iterator(); iterator.hasNext();) {
471 HNode outNode = (HNode) iterator.next();
472 Set<HNode> inSet = getIncomingNodeSet(outNode);
473 inSet.removeAll(set);
474 if (!set.contains(outNode)) {
475 addEdgeWithNoCycleCheck(newMergeNode, outNode);
479 Set<HNode> mergedSkeletonNode = new HashSet<HNode>();
480 for (Iterator<HNode> iter = set.iterator(); iter.hasNext();) {
481 HNode merged = iter.next();
482 if (merged.isSkeleton()) {
483 mergedSkeletonNode.add(merged);
487 // mapMergeNodetoMergingSet.put(newMergeNode, mergedSkeletonNode);
488 // for (Iterator iterator = set.iterator(); iterator.hasNext();) {
489 mapMergeNodetoMergingSet.put(newMergeNode, set);
490 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
491 HNode mergedNode = (HNode) iterator.next();
492 addMapHNodeToCurrentHNode(mergedNode, newMergeNode);
495 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
496 HNode hNode = (HNode) iterator.next();
497 System.out.println("old=" + hNode + "----->newNode=" + getCurrentHNode(hNode));
500 System.out.println();
505 private void addMapHNodeToCurrentHNode(HNode curNode, HNode newNode) {
507 if (curNode.isMergeNode()) {
508 Set<HNode> mergingSet = getMergingSet(curNode);
509 mergingSet.add(curNode);
510 System.out.println("-------addMapHNodeToCurrentHNode curNode=" + curNode + " meringSet="
511 + mergingSet + " newNode=" + newNode);
512 for (Iterator iterator = mergingSet.iterator(); iterator.hasNext();) {
513 HNode mergingNode = (HNode) iterator.next();
514 mapHNodeToCurrentHNode.put(mergingNode, newNode);
515 mapHNodeNameToCurrentHNode.put(mergingNode.getName(), newNode);
518 mapHNodeToCurrentHNode.put(curNode, newNode);
519 mapHNodeNameToCurrentHNode.put(curNode.getName(), newNode);
524 public HNode getCurrentHNode(HNode node) {
525 if (!mapHNodeToCurrentHNode.containsKey(node)) {
526 mapHNodeToCurrentHNode.put(node, node);
528 return mapHNodeToCurrentHNode.get(node);
531 public HNode getCurrentHNode(String nodeName) {
532 return mapHNodeNameToCurrentHNode.get(nodeName);
535 private Set<HNode> getMergingSet(HNode mergeNode) {
536 Set<HNode> mergingSet = new HashSet<HNode>();
537 Set<HNode> mergedNode = mapMergeNodetoMergingSet.get(mergeNode);
538 for (Iterator iterator = mergedNode.iterator(); iterator.hasNext();) {
539 HNode node = (HNode) iterator.next();
540 if (node.isMergeNode()) {
541 mergingSet.add(node);
542 mergingSet.addAll(getMergingSet(node));
544 mergingSet.add(node);
550 public Set<Descriptor> getDescSetOfNode(HNode node) {
551 if (!mapHNodeToDescSet.containsKey(node)) {
552 mapHNodeToDescSet.put(node, new HashSet<Descriptor>());
554 return mapHNodeToDescSet.get(node);
557 private boolean reachTo(HNode src, HNode dst, Set<HNode> visited) {
558 Set<HNode> connectedSet = getOutgoingNodeSet(src);
559 for (Iterator<HNode> iterator = connectedSet.iterator(); iterator.hasNext();) {
560 HNode n = iterator.next();
564 if (!visited.contains(n)) {
566 if (reachTo(n, dst, visited)) {
574 private void recurReachSkeletonSet(HNode node, Set<HNode> connected, Set<HNode> visited) {
576 Set<HNode> outSet = getOutgoingNodeSet(node);
577 for (Iterator iterator = outSet.iterator(); iterator.hasNext();) {
578 HNode outNode = (HNode) iterator.next();
580 if (outNode.isSkeleton()) {
581 connected.add(outNode);
582 } else if (!visited.contains(outNode)) {
583 visited.add(outNode);
584 recurReachSkeletonSet(outNode, connected, visited);
590 public Set<HNode> getReachableSCNodeSet(HNode startNode) {
591 // returns the set of hnodes which is reachable from the startNode and is either SC node or a
592 // node which is directly connected to the SC nodes
593 Set<HNode> reachable = new HashSet<HNode>();
594 Set<HNode> visited = new HashSet<HNode>();
595 visited.add(startNode);
596 recurReachableNodeSet(startNode, visited, reachable);
600 public Set<HNode> getSCNodeReachToSet(HNode node) {
601 if (!mapNormalNodeToSCNodeReachToSet.containsKey(node)) {
602 mapNormalNodeToSCNodeReachToSet.put(node, new HashSet<HNode>());
604 return mapNormalNodeToSCNodeReachToSet.get(node);
607 private void recurReachableNodeSet(HNode node, Set<HNode> visited, Set<HNode> reachable) {
609 Set<HNode> outSet = getOutgoingNodeSet(node);
610 for (Iterator iterator = outSet.iterator(); iterator.hasNext();) {
611 HNode out = (HNode) iterator.next();
613 if (!visited.contains(out)) {
615 Set<HNode> reachableFromSCNodeSet = reachableFromSCNode(out);
616 mapNormalNodeToSCNodeReachToSet.put(out, reachableFromSCNodeSet);
617 if (out.isSkeleton() || out.isCombinationNode() || reachableFromSCNodeSet.size() > 0) {
621 recurReachableNodeSet(out, visited, reachable);
630 private Set<HNode> reachableFromSCNode(HNode node) {
631 Set<HNode> visited = new HashSet<HNode>();
633 Set<HNode> reachable = new HashSet<HNode>();
634 recurReachableFromSCNode(node, reachable, visited);
638 private void recurReachableFromSCNode(HNode node, Set<HNode> reachable, Set<HNode> visited) {
639 Set<HNode> inNodeSet = getIncomingNodeSet(node);
640 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
641 HNode inNode = (HNode) iterator.next();
642 if (inNode.isSkeleton() || inNode.isCombinationNode()) {
644 reachable.add(inNode);
645 } else if (!visited.contains(inNode)) {
647 recurReachableFromSCNode(inNode, reachable, visited);
652 public Set<HNode> getDirectlyReachableSkeletonCombinationNodeFrom(HNode node,
653 Set<HNode> combinationNodeSet) {
654 Set<HNode> reachable = new HashSet<HNode>();
655 Set<HNode> visited = new HashSet<HNode>();
657 recurDirectlyReachableSkeletonCombinationNodeFrom(node, visited, reachable, combinationNodeSet);
661 public void recurDirectlyReachableSkeletonCombinationNodeFrom(HNode node, Set<HNode> visited,
662 Set<HNode> reachable, Set<HNode> combinationNodeSet) {
664 Set<HNode> outSet = getOutgoingNodeSet(node);
665 for (Iterator iterator = outSet.iterator(); iterator.hasNext();) {
666 HNode out = (HNode) iterator.next();
668 if (!visited.contains(out)) {
670 if (out.isSkeleton()) {
672 } else if (out.isCombinationNode()) {
673 if (combinationNodeSet == null) {
675 } else if (!combinationNodeSet.contains(out)) {
678 recurDirectlyReachableSkeletonCombinationNodeFrom(out, visited, reachable,
682 recurDirectlyReachableSkeletonCombinationNodeFrom(out, visited, reachable,
692 public HNode getDirectlyReachableSkeletonCombinationNodeFrom(HNode node) {
693 Set<HNode> visited = new HashSet<HNode>();
694 return recurDirectlyReachableSkeletonCombinationNodeFrom(node, visited);
697 public HNode recurDirectlyReachableSkeletonCombinationNodeFrom(HNode node, Set<HNode> visited) {
699 Set<HNode> outSet = getOutgoingNodeSet(node);
700 for (Iterator iterator = outSet.iterator(); iterator.hasNext();) {
701 HNode out = (HNode) iterator.next();
702 // if (!visited.contains(out)) {
703 if (out.isCombinationNode() || out.isSkeleton()) {
707 return getDirectlyReachableSkeletonCombinationNodeFrom(out);
715 public Set<HNode> getPossibleCycleNodes(HNode src, HNode dst) {
716 // if an edge from src to dst introduces a new cycle flow,
717 // the method returns the set of elements consisting of the cycle
718 Set<HNode> cycleNodeSet = new HashSet<HNode>();
719 // if the dst node reaches to the src node, the new relation
720 // introduces a cycle to the lattice
721 if (dst.equals(src)) {
722 cycleNodeSet.add(dst);
723 cycleNodeSet.add(src);
724 } else if (reachTo(dst, src)) {
725 cycleNodeSet.add(dst);
726 cycleNodeSet.add(src);
727 getInBetweenElements(dst, src, cycleNodeSet);
732 private void getInBetweenElements(HNode start, HNode end, Set<HNode> nodeSet) {
733 Set<HNode> connectedSet = getOutgoingNodeSet(start);
734 for (Iterator iterator = connectedSet.iterator(); iterator.hasNext();) {
735 HNode cur = (HNode) iterator.next();
736 if ((!start.equals(cur)) && (!cur.equals(end)) && reachTo(cur, end)) {
738 getInBetweenElements(cur, end, nodeSet);
743 public boolean reachTo(HNode node1, HNode node2) {
744 return reachTo(node1, node2, new HashSet<HNode>());
747 public Set<HNode> getCombineSetByCombinationNode(HNode node) {
748 if (!mapCombinationNodeToCombineNodeSet.containsKey(node)) {
749 mapCombinationNodeToCombineNodeSet.put(node, new HashSet<HNode>());
751 return mapCombinationNodeToCombineNodeSet.get(node);
754 public HNode getCombinationNode(Set<HNode> combineSet) {
755 if (!mapCombineNodeSetToCombinationNode.containsKey(combineSet)) {
756 String name = "COMB" + (LocationInference.locSeed++);
757 HNode node = new HNode(name);
758 node.setCombinationNode(true);
760 mapCombineNodeSetToCombinationNode.put(combineSet, node);
761 mapCombinationNodeToCombineNodeSet.put(node, combineSet);
764 return mapCombineNodeSetToCombinationNode.get(combineSet);
767 public Map<Set<HNode>, HNode> getMapCombineNodeSetToCombinationNode() {
768 return mapCombineNodeSetToCombinationNode;
771 public Set<Set<HNode>> getCombineNodeSet() {
772 return mapCombineNodeSetToOutgoingNodeSet.keySet();
775 public void insertCombinationNodesToGraph(HierarchyGraph simpleHierarchyGraph) {
776 // add a new combination node where parameter/field flows are actually combined.
778 simpleHierarchyGraph.identifyCombinationNodes();
780 Set<Set<HNode>> keySet = simpleHierarchyGraph.getCombineNodeSet();
781 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
782 Set<HNode> combineSet = (Set<HNode>) iterator.next();
783 // System.out.println("--combineSet=" + combineSet);
784 HNode combinationNode = getCombinationNode(combineSet);
785 System.out.println("--combinationNode=" + combinationNode + " combineSet=" + combineSet);
787 System.out.println("--hierarchynodes="
788 + simpleHierarchyGraph.getCombinationNodeSetByCombineNodeSet(combineSet));
789 // add an edge from a skeleton node to a combination node
790 for (Iterator iterator2 = combineSet.iterator(); iterator2.hasNext();) {
791 HNode inSkeletonNode = (HNode) iterator2.next();
792 // System.out.println("--inSkeletonNode=" + inSkeletonNode + " desc="
793 // + inSkeletonNode.getDescriptor());
795 if (inSkeletonNode.getDescriptor() == null) {
796 // the node is merging one...
797 srcNode = inSkeletonNode;
799 srcNode = getHNode(inSkeletonNode.getDescriptor());
801 // System.out.println("--srcNode=" + srcNode);
802 addEdgeWithNoCycleCheck(srcNode, combinationNode);
805 // add an edge from the combination node to outgoing nodes
806 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSetByCombineSet(combineSet);
807 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
808 HNode curNode = (HNode) iterator2.next();
809 if (curNode.isCombinationNode()) {
810 Set<HNode> combineNode = simpleHierarchyGraph.getCombineSetByCombinationNode(curNode);
811 HNode outNode = getCombinationNode(combineNode);
812 addEdgeWithNoCycleCheck(combinationNode, outNode);
813 } else if (curNode.isSkeleton()) {
814 // HNode dstNode2 = getHNode(curNode.getDescriptor());
815 HNode dstNode = getCurrentHNode(curNode);
816 // System.out.println("-----curNode=" + curNode + "------->" + dstNode + " dstNode2="
818 addEdgeWithNoCycleCheck(combinationNode, dstNode);
822 System.out.println("--");
828 private void addCombinationNode(HNode curNode, Set<HNode> reachToSet, Set<HNode> reachableSet) {
829 if (!mapSkeletonNodeSetToCombinationNode.containsKey(reachToSet)) {
830 // need to create a new combination node
831 String nodeName = "Comb" + (LocationInference.locSeed++);
832 HNode newCombinationNode = new HNode(nodeName);
833 newCombinationNode.setCombinationNode(true);
835 nodeSet.add(newCombinationNode);
836 mapSkeletonNodeSetToCombinationNode.put(reachToSet, newCombinationNode);
838 for (Iterator iterator = reachToSet.iterator(); iterator.hasNext();) {
839 HNode reachToNode = (HNode) iterator.next();
840 addEdge(reachToNode, newCombinationNode);
845 HNode combinationNode = mapSkeletonNodeSetToCombinationNode.get(reachToSet);
846 for (Iterator iterator = reachableSet.iterator(); iterator.hasNext();) {
847 HNode reachableNode = (HNode) iterator.next();
848 addEdge(combinationNode, reachableNode);
853 private Set<HNode> getSkeleteNodeSetReachTo(HNode node) {
855 Set<HNode> reachToSet = new HashSet<HNode>();
856 Set<HNode> visited = new HashSet<HNode>();
857 // visited.add(node);
858 recurSkeletonReachTo(node, reachToSet, visited);
861 // if a node reaches to one of elements in the reachToSet, we do not need to keep it
862 // because the node is not directly connected to the combination node
863 // removeRedundantReachToNodes(reachToSet);
868 private void removeRedundantReachToNodes(Set<HNode> reachToSet) {
870 Set<HNode> toberemoved = new HashSet<HNode>();
871 for (Iterator iterator = reachToSet.iterator(); iterator.hasNext();) {
872 HNode cur = (HNode) iterator.next();
874 for (Iterator iterator2 = reachToSet.iterator(); iterator2.hasNext();) {
875 HNode dst = (HNode) iterator2.next();
876 if (!cur.equals(dst) && reachTo(cur, dst)) {
878 toberemoved.add(cur);
882 reachToSet.removeAll(toberemoved);
885 private void recurSkeletonReachTo(HNode node, Set<HNode> reachToSet, Set<HNode> visited) {
887 Set<HNode> inSet = getIncomingNodeSet(node);
888 for (Iterator iterator = inSet.iterator(); iterator.hasNext();) {
889 HNode inNode = (HNode) iterator.next();
891 if (inNode.isSkeleton()) {
893 reachToSet.add(inNode);
894 } else if (!visited.contains(inNode)) {
896 recurSkeletonReachTo(inNode, reachToSet, visited);
902 public Map<HNode, Set<HNode>> getMapHNodeToOutgoingSet() {
903 return mapHNodeToOutgoingSet;
906 public Map<HNode, Set<HNode>> getMapHNodeToIncomingSet() {
907 return mapHNodeToIncomingSet;
910 public void setMapHNodeToOutgoingSet(Map<HNode, Set<HNode>> in) {
911 mapHNodeToOutgoingSet.clear();
912 Set<HNode> keySet = in.keySet();
913 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
914 HNode key = (HNode) iterator.next();
915 Set<HNode> inSet = in.get(key);
916 Set<HNode> newSet = new HashSet<HNode>();
917 newSet.addAll(inSet);
918 mapHNodeToOutgoingSet.put(key, newSet);
922 public void setMapHNodeToIncomingSet(Map<HNode, Set<HNode>> in) {
923 mapHNodeToIncomingSet.clear();
924 Set<HNode> keySet = in.keySet();
925 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
926 HNode key = (HNode) iterator.next();
927 Set<HNode> inSet = in.get(key);
928 Set<HNode> newSet = new HashSet<HNode>();
929 newSet.addAll(inSet);
930 mapHNodeToIncomingSet.put(key, newSet);
934 public void setNodeSet(Set<HNode> inSet) {
936 nodeSet.addAll(inSet);
939 public HierarchyGraph clone() {
940 HierarchyGraph clone = new HierarchyGraph();
941 clone.setDesc(getDesc());
942 clone.setName(getName());
943 clone.setNodeSet(getNodeSet());
944 clone.setMapHNodeToIncomingSet(getMapHNodeToIncomingSet());
945 clone.setMapHNodeToOutgoingSet(getMapHNodeToOutgoingSet());
946 clone.setMapDescToHNode(getMapDescToHNode());
947 clone.setMapHNodeToDescSet(getMapHNodeToDescSet());
948 clone.setMapHNodetoMergeSet(getMapHNodetoMergeSet());
949 clone.setMapHNodeToCurrentHNode(getMapHNodeToCurrentHNode());
950 clone.setMapHNodeNameToCurrentHNode(getMapHNodeNameToCurrentHNode());
955 public Map<HNode, Set<HNode>> getMapHNodetoMergeSet() {
956 return mapMergeNodetoMergingSet;
959 public void setMapHNodetoMergeSet(Map<HNode, Set<HNode>> mapHNodetoMergeSet) {
960 this.mapMergeNodetoMergingSet = mapHNodetoMergeSet;
963 public Set<HNode> getOutgoingNodeSetByCombineSet(Set<HNode> combineSet) {
965 if (!mapCombineNodeSetToOutgoingNodeSet.containsKey(combineSet)) {
966 mapCombineNodeSetToOutgoingNodeSet.put(combineSet, new HashSet<HNode>());
968 return mapCombineNodeSetToOutgoingNodeSet.get(combineSet);
971 public void identifyCombinationNodes() {
973 // 1) set combination node flag if a node combines more than one skeleton node.
974 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
975 HNode node = (HNode) iterator.next();
976 if (!node.isSkeleton()) {
977 Set<HNode> reachToSet = getSkeleteNodeSetReachTo(node);
978 // Set<HNode> tempSet = removeTransitivelyReachToSet(reachToSet);
979 // reachToSet = removeTransitivelyReachToSet(reachToSet);
980 Set<HNode> tempSet = reachToSet;
981 System.out.println("$node=" + node + " reachToNodeSet=" + reachToSet + " tempSet="
983 if (reachToSet.size() > 1) {
984 // if (countSkeletonNodes(reachToSet) > 1) {
985 System.out.println("-node=" + node + " reachToSet=" + reachToSet);
986 System.out.println("-set combinationnode=" + node);
987 node.setCombinationNode(true);
988 mapCombinationNodeToCombineNodeSet.put(node, reachToSet);
993 // 2) compute the outgoing set that needs to be directly connected from the combination node
994 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
995 HNode node = (HNode) iterator.next();
996 if (node.isCombinationNode()) {
997 Set<HNode> combineSet = mapCombinationNodeToCombineNodeSet.get(node);
998 Set<HNode> outSet = getDirectlyReachableNodeSetFromCombinationNode(node);
999 addMapCombineSetToOutgoingSet(combineSet, outSet);
1005 private Set<HNode> removeTransitivelyReachToSet(Set<HNode> reachToSet) {
1007 Set<HNode> toberemoved = new HashSet<HNode>();
1008 Set<HNode> visited = new HashSet<HNode>();
1009 for (Iterator iterator = reachToSet.iterator(); iterator.hasNext();) {
1010 HNode node = (HNode) iterator.next();
1012 recurIsReachingTo(node, reachToSet, toberemoved, visited);
1015 Set<HNode> rSet = new HashSet<HNode>();
1016 rSet.addAll(reachToSet);
1017 rSet.removeAll(toberemoved);
1021 private void recurIsReachingTo(HNode curNode, Set<HNode> reachToSet, Set<HNode> toberemoved,
1022 Set<HNode> visited) {
1023 Set<HNode> inNodeSet = getIncomingNodeSet(curNode);
1025 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
1026 HNode inNode = (HNode) iterator.next();
1027 if (reachToSet.contains(inNode)) {
1028 toberemoved.add(inNode);
1029 } else if (!visited.contains(inNode)) {
1030 visited.add(inNode);
1031 recurIsReachingTo(inNode, reachToSet, toberemoved, visited);
1037 public Map<HNode, Set<HNode>> getMapCombinationNodeToCombineNodeSet() {
1038 return mapCombinationNodeToCombineNodeSet;
1041 public int countSkeletonNodes(Set<HNode> set) {
1044 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
1045 HNode node = (HNode) iterator.next();
1046 Set<Descriptor> descSet = getDescSetOfNode(node);
1047 count += descSet.size();
1053 private void addMapCombineSetToOutgoingSet(Set<HNode> combineSet, Set<HNode> outSet) {
1054 if (!mapCombineNodeSetToOutgoingNodeSet.containsKey(combineSet)) {
1055 mapCombineNodeSetToOutgoingNodeSet.put(combineSet, new HashSet<HNode>());
1057 mapCombineNodeSetToOutgoingNodeSet.get(combineSet).addAll(outSet);
1060 private Set<HNode> getDirectlyReachableNodeSetFromCombinationNode(HNode node) {
1061 // the method returns the set of nodes that are reachable from the current node
1062 // and do not combine the same set of skeleton nodes...
1064 Set<HNode> visited = new HashSet<HNode>();
1065 Set<HNode> reachableSet = new HashSet<HNode>();
1066 Set<HNode> combineSet = mapCombinationNodeToCombineNodeSet.get(node);
1068 recurDirectlyReachableNodeSetFromCombinationNode(node, combineSet, reachableSet, visited);
1070 return reachableSet;
1073 private void recurDirectlyReachableNodeSetFromCombinationNode(HNode node, Set<HNode> combineSet,
1074 Set<HNode> reachableSet, Set<HNode> visited) {
1076 Set<HNode> outSet = getOutgoingNodeSet(node);
1077 for (Iterator iterator = outSet.iterator(); iterator.hasNext();) {
1078 HNode outNode = (HNode) iterator.next();
1080 if (outNode.isCombinationNode()) {
1081 Set<HNode> combineSetOfOutNode = mapCombinationNodeToCombineNodeSet.get(outNode);
1082 if (combineSetOfOutNode.equals(combineSet)) {
1083 recurDirectlyReachableNodeSetFromCombinationNode(outNode, combineSet, reachableSet,
1086 reachableSet.add(outNode);
1088 } else if (outNode.isSkeleton()) {
1089 reachableSet.add(outNode);
1096 private Set<HNode> getReachableNodeSetFrom(HNode node) {
1098 Set<HNode> reachableSet = new HashSet<HNode>();
1099 Set<HNode> visited = new HashSet<HNode>();
1101 recurReachableNodeSetFrom(node, reachableSet, visited);
1103 return reachableSet;
1106 private void recurReachableNodeSetFrom(HNode node, Set<HNode> reachableSet, Set<HNode> visited) {
1108 Set<HNode> outgoingNodeSet = getOutgoingNodeSet(node);
1109 for (Iterator iterator = outgoingNodeSet.iterator(); iterator.hasNext();) {
1110 HNode outNode = (HNode) iterator.next();
1111 reachableSet.add(outNode);
1112 if (!visited.contains(outNode)) {
1113 visited.add(outNode);
1114 recurReachableNodeSetFrom(outNode, reachableSet, visited);
1120 public void assignUniqueIndexToNode() {
1122 // System.out.println("nodeSet=" + nodeSet);
1123 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
1124 HNode node = (HNode) iterator.next();
1125 mapHNodeToUniqueIndex.put(node, idx);
1129 BASISTOPELEMENT = new HashSet<Integer>();
1130 for (int i = 1; i < idx + 1; i++) {
1131 BASISTOPELEMENT.add(i);
1135 public BasisSet computeBasisSet(Set<HNode> notGenerateSet) {
1137 // assign a unique index to a node
1138 assignUniqueIndexToNode();
1140 // compute basis for each node
1141 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
1142 HNode node = (HNode) iterator.next();
1144 if (notGenerateSet.contains(node)) {
1145 System.out.println("%%%SKIP =" + node);
1148 Set<Integer> basis = new HashSet<Integer>();
1149 basis.addAll(BASISTOPELEMENT);
1151 Set<HNode> reachableNodeSet = getReachableNodeSetFrom(node);
1152 // System.out.println("node=" + node + " reachableNodeSet=" + reachableNodeSet);
1153 // System.out.println("mapHNodeToUniqueIndex.get(node)=" + mapHNodeToUniqueIndex.get(node));
1154 // if a node is reachable from the current node
1155 // need to remove the index of the reachable node from the basis
1157 basis.remove(getHNodeIndex(node));
1158 for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
1159 HNode reachableNode = (HNode) iterator2.next();
1160 // System.out.println("reachableNode=" + reachableNode);
1161 // System.out.println("getHNodeIndex(reachableNode))="
1162 // + mapHNodeToUniqueIndex.get(reachableNode));
1163 int idx = getHNodeIndex(reachableNode);
1167 mapHNodeToBasis.put(node, basis);
1170 // construct the basis set
1172 BasisSet basisSet = new BasisSet();
1174 Set<HNode> keySet = mapHNodeToBasis.keySet();
1175 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
1176 HNode node = (HNode) iterator.next();
1177 Set<Integer> basis = mapHNodeToBasis.get(node);
1178 basisSet.addElement(basis, node);
1185 public int getHNodeIndex(HNode node) {
1186 return mapHNodeToUniqueIndex.get(node).intValue();
1189 public Map<HNode, Integer> getMapHNodeToUniqueIndex() {
1190 return mapHNodeToUniqueIndex;
1193 public Map<HNode, Set<Integer>> getMapHNodeToBasis() {
1194 return mapHNodeToBasis;
1197 public Set<HNode> getCombinationNodeSetByCombineNodeSet(Set<HNode> combineSkeletonNodeSet) {
1199 Set<HNode> combinationNodeSet = new HashSet<HNode>();
1200 Set<HNode> keySet = mapCombinationNodeToCombineNodeSet.keySet();
1201 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
1202 HNode key = (HNode) iterator.next();
1204 if (mapCombinationNodeToCombineNodeSet.get(key).equals(combineSkeletonNodeSet)) {
1205 combinationNodeSet.add(key);
1209 return combinationNodeSet;
1212 public void writeGraph() {
1216 public void writeGraph(boolean isSimple) {
1218 String graphName = "hierarchy" + name;
1219 System.out.println("#GRAPHNAME=" + graphName);
1220 graphName = graphName.replaceAll("[\\W]", "");
1223 graphName += "_PAPER";
1226 // System.out.println("***graphName=" + graphName + " node siz=" + nodeSet.size());
1229 BufferedWriter bw = new BufferedWriter(new FileWriter(graphName + ".dot"));
1231 bw.write("digraph " + graphName + " {\n");
1233 Iterator<HNode> iter = nodeSet.iterator();
1235 Set<HNode> addedNodeSet = new HashSet<HNode>();
1237 while (iter.hasNext()) {
1238 HNode u = iter.next();
1240 Set<HNode> outSet = getOutgoingNodeSet(u);
1242 if (outSet.size() == 0) {
1243 if (!addedNodeSet.contains(u)) {
1247 drawNodeName(bw, u);
1249 addedNodeSet.add(u);
1252 for (Iterator iterator = outSet.iterator(); iterator.hasNext();) {
1253 HNode v = (HNode) iterator.next();
1254 if (!addedNodeSet.contains(u)) {
1258 drawNodeName(bw, u);
1260 addedNodeSet.add(u);
1262 if (!addedNodeSet.contains(v)) {
1266 drawNodeName(bw, v);
1268 addedNodeSet.add(v);
1270 bw.write("" + u.getName() + " -> " + v.getName() + ";\n");
1279 } catch (IOException e) {
1280 e.printStackTrace();
1284 public boolean contains(HNode node) {
1285 return nodeSet.contains(node);
1288 public boolean isDirectlyConnectedTo(HNode src, HNode dst) {
1289 return getOutgoingNodeSet(src).contains(dst);
1292 private String convertMergeSetToString(Set<HNode> mergeSet) {
1294 for (Iterator iterator = mergeSet.iterator(); iterator.hasNext();) {
1295 HNode merged = (HNode) iterator.next();
1296 if (merged.isMergeNode()) {
1297 str += " " + convertMergeSetToString(mapMergeNodetoMergingSet.get(merged));
1299 str += " " + merged.getName();
1305 private void drawNodeName(BufferedWriter bw, HNode node) throws IOException {
1306 String nodeName = node.getNamePropertyString();
1307 bw.write(node.getName() + " [label=\"" + nodeName + "\"]" + ";\n");
1310 private void drawNode(BufferedWriter bw, HNode node) throws IOException {
1312 if (node.isMergeNode()) {
1313 nodeName = node.getNamePropertyString();
1314 Set<HNode> mergeSet = mapMergeNodetoMergingSet.get(node);
1315 System.out.println("node=" + node + " mergeSet=" + mergeSet);
1316 nodeName += ":" + convertMergeSetToString(mergeSet);
1318 nodeName = node.getNamePropertyString();
1320 bw.write(node.getName() + " [label=\"" + nodeName + "\"]" + ";\n");
1323 public int countHopFromTopLocation(HNode node) {
1325 Set<HNode> inNodeSet = getIncomingNodeSet(node);
1327 if (inNodeSet.size() > 0) {
1328 count = recurCountHopFromTopLocation(inNodeSet, 1);
1334 private int recurCountHopFromTopLocation(Set<HNode> nodeSet, int curCount) {
1337 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
1338 HNode node = (HNode) iterator.next();
1339 Set<HNode> inNodeSet = getIncomingNodeSet(node);
1340 if (inNodeSet.size() > 0) {
1341 int recurCount = recurCountHopFromTopLocation(inNodeSet, curCount + 1);
1342 if (max < recurCount) {