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());
256 return skeletonGraph;
260 private Set<HNode> getDirectlyReachSkeletonSet(HNode node) {
262 Set<HNode> visited = new HashSet<HNode>();
263 Set<HNode> connected = new HashSet<HNode>();
264 recurReachSkeletonSet(node, connected, visited);
269 public void removeRedundantEdges() {
271 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
272 HNode src = (HNode) iterator.next();
273 Set<HNode> connectedSet = getOutgoingNodeSet(src);
274 Set<HNode> toberemovedSet = new HashSet<HNode>();
275 for (Iterator iterator2 = connectedSet.iterator(); iterator2.hasNext();) {
276 HNode dst = (HNode) iterator2.next();
277 Set<HNode> otherNeighborSet = new HashSet<HNode>();
278 otherNeighborSet.addAll(connectedSet);
279 otherNeighborSet.remove(dst);
280 for (Iterator iterator3 = otherNeighborSet.iterator(); iterator3.hasNext();) {
281 HNode neighbor = (HNode) iterator3.next();
282 if (reachTo(neighbor, dst, new HashSet<HNode>())) {
283 toberemovedSet.add(dst);
287 if (toberemovedSet.size() > 0) {
288 connectedSet.removeAll(toberemovedSet);
290 for (Iterator iterator2 = toberemovedSet.iterator(); iterator2.hasNext();) {
291 HNode node = (HNode) iterator2.next();
292 getIncomingNodeSet(node).remove(src);
300 public void simplifyHierarchyGraph() {
301 removeRedundantEdges();
302 combineRedundantNodes(false);
305 public void simplifySkeletonCombinationHierarchyGraph() {
306 removeRedundantEdges();
307 combineRedundantNodes(true);
310 public void combineRedundantNodes(boolean onlyCombinationNodes) {
311 // Combine field/parameter nodes who have the same set of incoming/outgoing edges.
312 boolean isUpdated = false;
314 isUpdated = combineTwoRedundatnNodes(onlyCombinationNodes);
318 public Set<HNode> getIncomingNodeSet(HNode node) {
319 if (!mapHNodeToIncomingSet.containsKey(node)) {
320 mapHNodeToIncomingSet.put(node, new HashSet<HNode>());
322 return mapHNodeToIncomingSet.get(node);
325 public Set<HNode> getOutgoingNodeSet(HNode node) {
326 if (!mapHNodeToOutgoingSet.containsKey(node)) {
327 mapHNodeToOutgoingSet.put(node, new HashSet<HNode>());
329 return mapHNodeToOutgoingSet.get(node);
332 private boolean combineTwoRedundatnNodes(boolean onlyCombinationNodes) {
333 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
334 HNode node1 = (HNode) iterator.next();
336 if ((onlyCombinationNodes && (!node1.isCombinationNode()))
337 || (!onlyCombinationNodes && (!node1.isSkeleton()))) {
341 Set<HNode> incomingNodeSet1 = getIncomingNodeSet(node1);
342 Set<HNode> outgoingNodeSet1 = getOutgoingNodeSet(node1);
344 for (Iterator iterator2 = nodeSet.iterator(); iterator2.hasNext();) {
345 HNode node2 = (HNode) iterator2.next();
347 if ((onlyCombinationNodes && (!node2.isCombinationNode()))
348 || (!onlyCombinationNodes && (!node2.isSkeleton()))) {
352 if (!isEligibleForMerging(node1, node2)) {
356 if (!node1.equals(node2)) {
358 Set<HNode> incomingNodeSet2 = getIncomingNodeSet(node2);
359 Set<HNode> outgoingNodeSet2 = getOutgoingNodeSet(node2);
361 if (incomingNodeSet1.equals(incomingNodeSet2)
362 && outgoingNodeSet1.equals(outgoingNodeSet2)) {
363 // need to merge node1 and node2
365 Set<HNode> mergeSet = new HashSet<HNode>();
368 mergeNodes(mergeSet, onlyCombinationNodes);
379 private boolean isEligibleForMerging(HNode node1, HNode node2) {
381 if (node1.isSharedNode() || node2.isSharedNode()) {
383 // if either of nodes is a shared node,
384 // all descriptors of node1 & node2 should have a primitive type
386 Set<Descriptor> descSet = new HashSet<Descriptor>();
387 descSet.addAll(getDescSetOfNode(node1));
388 descSet.addAll(getDescSetOfNode(node2));
390 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
391 Descriptor desc = (Descriptor) iterator.next();
392 if (!LocationInference.isPrimitive(desc)) {
401 private void addEdgeWithNoCycleCheck(HNode srcHNode, HNode dstHNode) {
402 getIncomingNodeSet(dstHNode).add(srcHNode);
403 getOutgoingNodeSet(srcHNode).add(dstHNode);
404 // System.out.println("addEdgeWithNoCycleCheck src=" + srcHNode + " -> " + dstHNode);
407 private HNode mergeNodes(Set<HNode> set, boolean onlyCombinationNodes) {
409 Set<HNode> incomingNodeSet = new HashSet<HNode>();
410 Set<HNode> outgoingNodeSet = new HashSet<HNode>();
412 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
413 HNode node = (HNode) iterator.next();
414 incomingNodeSet.addAll(getIncomingNodeSet(node));
415 outgoingNodeSet.addAll(getOutgoingNodeSet(node));
419 boolean isMergeNode = false;
420 if (onlyCombinationNodes) {
421 nodeName = "Comb" + (LocationInference.locSeed++);
423 nodeName = "Node" + (LocationInference.locSeed++);
426 HNode newMergeNode = new HNode(nodeName);
427 newMergeNode.setMergeNode(isMergeNode);
429 nodeSet.add(newMergeNode);
430 nodeSet.removeAll(set);
432 // if the input set contains a skeleton node, need to set a new merge node as skeleton also
433 boolean hasSkeleton = false;
434 boolean hasShared = false;
435 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
436 HNode inNode = (HNode) iterator.next();
437 if (inNode.isSkeleton()) {
440 if (inNode.isSharedNode()) {
444 // System.out.println("-----Set merging node=" + newMergeNode + " as a skeleton=" + set
445 // + " hasSkeleton=" + hasSkeleton + " CUR DESC=" + desc);
446 newMergeNode.setSkeleton(hasSkeleton);
447 newMergeNode.setSharedNode(hasShared);
449 System.out.println("-----MERGING NODE=" + set + " new node=" + newMergeNode);
451 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
452 HNode node = (HNode) iterator.next();
453 Set<Descriptor> descSetOfNode = getDescSetOfNode(node);
454 for (Iterator iterator2 = descSetOfNode.iterator(); iterator2.hasNext();) {
455 Descriptor desc = (Descriptor) iterator2.next();
456 mappingDescriptorToHNode(desc, newMergeNode);
460 for (Iterator iterator = incomingNodeSet.iterator(); iterator.hasNext();) {
461 HNode inNode = (HNode) iterator.next();
462 Set<HNode> outSet = getOutgoingNodeSet(inNode);
463 outSet.removeAll(set);
464 if (!set.contains(inNode)) {
465 addEdgeWithNoCycleCheck(inNode, newMergeNode);
469 for (Iterator iterator = outgoingNodeSet.iterator(); iterator.hasNext();) {
470 HNode outNode = (HNode) iterator.next();
471 Set<HNode> inSet = getIncomingNodeSet(outNode);
472 inSet.removeAll(set);
473 if (!set.contains(outNode)) {
474 addEdgeWithNoCycleCheck(newMergeNode, outNode);
478 Set<HNode> mergedSkeletonNode = new HashSet<HNode>();
479 for (Iterator<HNode> iter = set.iterator(); iter.hasNext();) {
480 HNode merged = iter.next();
481 if (merged.isSkeleton()) {
482 mergedSkeletonNode.add(merged);
486 // mapMergeNodetoMergingSet.put(newMergeNode, mergedSkeletonNode);
487 // for (Iterator iterator = set.iterator(); iterator.hasNext();) {
488 mapMergeNodetoMergingSet.put(newMergeNode, set);
489 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
490 HNode mergedNode = (HNode) iterator.next();
491 addMapHNodeToCurrentHNode(mergedNode, newMergeNode);
494 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
495 HNode hNode = (HNode) iterator.next();
496 System.out.println("old=" + hNode + "----->newNode=" + getCurrentHNode(hNode));
499 System.out.println();
504 private void addMapHNodeToCurrentHNode(HNode curNode, HNode newNode) {
505 if (curNode.isMergeNode()) {
506 Set<HNode> mergingSet = getMergingSet(curNode);
507 mergingSet.add(curNode);
508 System.out.println("-------addMapHNodeToCurrentHNode curNode=" + curNode + " meringSet="
509 + mergingSet + " newNode=" + newNode);
510 for (Iterator iterator = mergingSet.iterator(); iterator.hasNext();) {
511 HNode mergingNode = (HNode) iterator.next();
512 mapHNodeToCurrentHNode.put(mergingNode, newNode);
513 mapHNodeNameToCurrentHNode.put(mergingNode.getName(), newNode);
516 mapHNodeToCurrentHNode.put(curNode, newNode);
517 mapHNodeNameToCurrentHNode.put(curNode.getName(), newNode);
521 public HNode getCurrentHNode(HNode node) {
522 if (!mapHNodeToCurrentHNode.containsKey(node)) {
523 mapHNodeToCurrentHNode.put(node, node);
525 return mapHNodeToCurrentHNode.get(node);
528 public HNode getCurrentHNode(String nodeName) {
529 return mapHNodeNameToCurrentHNode.get(nodeName);
532 private Set<HNode> getMergingSet(HNode mergeNode) {
533 Set<HNode> mergingSet = new HashSet<HNode>();
534 Set<HNode> mergedNode = mapMergeNodetoMergingSet.get(mergeNode);
535 for (Iterator iterator = mergedNode.iterator(); iterator.hasNext();) {
536 HNode node = (HNode) iterator.next();
537 if (node.isMergeNode()) {
538 mergingSet.add(node);
539 mergingSet.addAll(getMergingSet(node));
541 mergingSet.add(node);
547 public Set<Descriptor> getDescSetOfNode(HNode node) {
548 if (!mapHNodeToDescSet.containsKey(node)) {
549 mapHNodeToDescSet.put(node, new HashSet<Descriptor>());
551 return mapHNodeToDescSet.get(node);
554 private boolean reachTo(HNode src, HNode dst, Set<HNode> visited) {
555 Set<HNode> connectedSet = getOutgoingNodeSet(src);
556 for (Iterator<HNode> iterator = connectedSet.iterator(); iterator.hasNext();) {
557 HNode n = iterator.next();
561 if (!visited.contains(n)) {
563 if (reachTo(n, dst, visited)) {
571 private void recurReachSkeletonSet(HNode node, Set<HNode> connected, Set<HNode> visited) {
573 Set<HNode> outSet = getOutgoingNodeSet(node);
574 for (Iterator iterator = outSet.iterator(); iterator.hasNext();) {
575 HNode outNode = (HNode) iterator.next();
577 if (outNode.isSkeleton()) {
578 connected.add(outNode);
579 } else if (!visited.contains(outNode)) {
580 visited.add(outNode);
581 recurReachSkeletonSet(outNode, connected, visited);
587 public Set<HNode> getReachableSCNodeSet(HNode startNode) {
588 // returns the set of hnodes which is reachable from the startNode and is either SC node or a
589 // node which is directly connected to the SC nodes
590 Set<HNode> reachable = new HashSet<HNode>();
591 Set<HNode> visited = new HashSet<HNode>();
592 visited.add(startNode);
593 recurReachableNodeSet(startNode, visited, reachable);
597 public Set<HNode> getSCNodeReachToSet(HNode node) {
598 if (!mapNormalNodeToSCNodeReachToSet.containsKey(node)) {
599 mapNormalNodeToSCNodeReachToSet.put(node, new HashSet<HNode>());
601 return mapNormalNodeToSCNodeReachToSet.get(node);
604 private void recurReachableNodeSet(HNode node, Set<HNode> visited, Set<HNode> reachable) {
606 Set<HNode> outSet = getOutgoingNodeSet(node);
607 for (Iterator iterator = outSet.iterator(); iterator.hasNext();) {
608 HNode out = (HNode) iterator.next();
610 if (!visited.contains(out)) {
612 Set<HNode> reachableFromSCNodeSet = reachableFromSCNode(out);
613 mapNormalNodeToSCNodeReachToSet.put(out, reachableFromSCNodeSet);
614 if (out.isSkeleton() || out.isCombinationNode() || reachableFromSCNodeSet.size() > 0) {
618 recurReachableNodeSet(out, visited, reachable);
627 private Set<HNode> reachableFromSCNode(HNode node) {
628 Set<HNode> visited = new HashSet<HNode>();
630 Set<HNode> reachable = new HashSet<HNode>();
631 recurReachableFromSCNode(node, reachable, visited);
635 private void recurReachableFromSCNode(HNode node, Set<HNode> reachable, Set<HNode> visited) {
636 Set<HNode> inNodeSet = getIncomingNodeSet(node);
637 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
638 HNode inNode = (HNode) iterator.next();
639 if (inNode.isSkeleton() || inNode.isCombinationNode()) {
641 reachable.add(inNode);
642 } else if (!visited.contains(inNode)) {
644 recurReachableFromSCNode(inNode, reachable, visited);
649 public Set<HNode> getDirectlyReachableSkeletonCombinationNodeFrom(HNode node,
650 Set<HNode> combinationNodeSet) {
651 Set<HNode> reachable = new HashSet<HNode>();
652 Set<HNode> visited = new HashSet<HNode>();
654 recurDirectlyReachableSkeletonCombinationNodeFrom(node, visited, reachable, combinationNodeSet);
658 public void recurDirectlyReachableSkeletonCombinationNodeFrom(HNode node, Set<HNode> visited,
659 Set<HNode> reachable, Set<HNode> combinationNodeSet) {
661 Set<HNode> outSet = getOutgoingNodeSet(node);
662 for (Iterator iterator = outSet.iterator(); iterator.hasNext();) {
663 HNode out = (HNode) iterator.next();
665 if (!visited.contains(out)) {
667 if (out.isSkeleton()) {
669 } else if (out.isCombinationNode()) {
670 if (combinationNodeSet == null) {
672 } else if (!combinationNodeSet.contains(out)) {
675 recurDirectlyReachableSkeletonCombinationNodeFrom(out, visited, reachable,
679 recurDirectlyReachableSkeletonCombinationNodeFrom(out, visited, reachable,
689 public HNode getDirectlyReachableSkeletonCombinationNodeFrom(HNode node) {
690 Set<HNode> visited = new HashSet<HNode>();
691 return recurDirectlyReachableSkeletonCombinationNodeFrom(node, visited);
694 public HNode recurDirectlyReachableSkeletonCombinationNodeFrom(HNode node, Set<HNode> visited) {
696 Set<HNode> outSet = getOutgoingNodeSet(node);
697 for (Iterator iterator = outSet.iterator(); iterator.hasNext();) {
698 HNode out = (HNode) iterator.next();
699 // if (!visited.contains(out)) {
700 if (out.isCombinationNode() || out.isSkeleton()) {
704 return getDirectlyReachableSkeletonCombinationNodeFrom(out);
712 public Set<HNode> getPossibleCycleNodes(HNode src, HNode dst) {
713 // if an edge from src to dst introduces a new cycle flow,
714 // the method returns the set of elements consisting of the cycle
715 Set<HNode> cycleNodeSet = new HashSet<HNode>();
716 // if the dst node reaches to the src node, the new relation
717 // introduces a cycle to the lattice
718 if (dst.equals(src)) {
719 cycleNodeSet.add(dst);
720 cycleNodeSet.add(src);
721 } else if (reachTo(dst, src)) {
722 cycleNodeSet.add(dst);
723 cycleNodeSet.add(src);
724 getInBetweenElements(dst, src, cycleNodeSet);
729 private void getInBetweenElements(HNode start, HNode end, Set<HNode> nodeSet) {
730 Set<HNode> connectedSet = getOutgoingNodeSet(start);
731 for (Iterator iterator = connectedSet.iterator(); iterator.hasNext();) {
732 HNode cur = (HNode) iterator.next();
733 if ((!start.equals(cur)) && (!cur.equals(end)) && reachTo(cur, end)) {
735 getInBetweenElements(cur, end, nodeSet);
740 public boolean reachTo(HNode node1, HNode node2) {
741 return reachTo(node1, node2, new HashSet<HNode>());
744 public Set<HNode> getCombineSetByCombinationNode(HNode node) {
745 if (!mapCombinationNodeToCombineNodeSet.containsKey(node)) {
746 mapCombinationNodeToCombineNodeSet.put(node, new HashSet<HNode>());
748 return mapCombinationNodeToCombineNodeSet.get(node);
751 public HNode getCombinationNode(Set<HNode> combineSet) {
752 if (!mapCombineNodeSetToCombinationNode.containsKey(combineSet)) {
753 String name = "COMB" + (LocationInference.locSeed++);
754 HNode node = new HNode(name);
755 node.setCombinationNode(true);
757 mapCombineNodeSetToCombinationNode.put(combineSet, node);
758 mapCombinationNodeToCombineNodeSet.put(node, combineSet);
761 return mapCombineNodeSetToCombinationNode.get(combineSet);
764 public Map<Set<HNode>, HNode> getMapCombineNodeSetToCombinationNode() {
765 return mapCombineNodeSetToCombinationNode;
768 public Set<Set<HNode>> getCombineNodeSet() {
769 return mapCombineNodeSetToOutgoingNodeSet.keySet();
772 public void insertCombinationNodesToGraph(HierarchyGraph simpleHierarchyGraph) {
773 // add a new combination node where parameter/field flows are actually combined.
775 simpleHierarchyGraph.identifyCombinationNodes();
777 Set<Set<HNode>> keySet = simpleHierarchyGraph.getCombineNodeSet();
778 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
779 Set<HNode> combineSet = (Set<HNode>) iterator.next();
780 // System.out.println("--combineSet=" + combineSet);
781 HNode combinationNode = getCombinationNode(combineSet);
782 // System.out.println("--combinationNode=" + combinationNode);
783 // add an edge from a skeleton node to a combination node
784 for (Iterator iterator2 = combineSet.iterator(); iterator2.hasNext();) {
785 HNode inSkeletonNode = (HNode) iterator2.next();
786 // System.out.println("--inSkeletonNode=" + inSkeletonNode + " desc="
787 // + inSkeletonNode.getDescriptor());
789 if (inSkeletonNode.getDescriptor() == null) {
790 // the node is merging one...
791 srcNode = inSkeletonNode;
793 srcNode = getHNode(inSkeletonNode.getDescriptor());
795 // System.out.println("--srcNode=" + srcNode);
796 addEdgeWithNoCycleCheck(srcNode, combinationNode);
799 // add an edge from the combination node to outgoing nodes
800 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSetByCombineSet(combineSet);
801 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
802 HNode curNode = (HNode) iterator2.next();
803 if (curNode.isCombinationNode()) {
804 Set<HNode> combineNode = simpleHierarchyGraph.getCombineSetByCombinationNode(curNode);
805 HNode outNode = getCombinationNode(combineNode);
806 addEdgeWithNoCycleCheck(combinationNode, outNode);
807 } else if (curNode.isSkeleton()) {
808 // HNode dstNode2 = getHNode(curNode.getDescriptor());
809 HNode dstNode = getCurrentHNode(curNode);
810 // System.out.println("-----curNode=" + curNode + "------->" + dstNode + " dstNode2="
812 addEdgeWithNoCycleCheck(combinationNode, dstNode);
816 System.out.println("--");
822 private void addCombinationNode(HNode curNode, Set<HNode> reachToSet, Set<HNode> reachableSet) {
823 if (!mapSkeletonNodeSetToCombinationNode.containsKey(reachToSet)) {
824 // need to create a new combination node
825 String nodeName = "Comb" + (LocationInference.locSeed++);
826 HNode newCombinationNode = new HNode(nodeName);
827 newCombinationNode.setCombinationNode(true);
829 nodeSet.add(newCombinationNode);
830 mapSkeletonNodeSetToCombinationNode.put(reachToSet, newCombinationNode);
832 for (Iterator iterator = reachToSet.iterator(); iterator.hasNext();) {
833 HNode reachToNode = (HNode) iterator.next();
834 addEdge(reachToNode, newCombinationNode);
839 HNode combinationNode = mapSkeletonNodeSetToCombinationNode.get(reachToSet);
840 for (Iterator iterator = reachableSet.iterator(); iterator.hasNext();) {
841 HNode reachableNode = (HNode) iterator.next();
842 addEdge(combinationNode, reachableNode);
847 private Set<HNode> getSkeleteNodeSetReachTo(HNode node) {
849 Set<HNode> reachToSet = new HashSet<HNode>();
850 Set<HNode> visited = new HashSet<HNode>();
851 recurSkeletonReachTo(node, reachToSet, visited);
854 // if a node reaches to one of elements in the reachToSet, we do not need to keep it
855 // because the node is not directly connected to the combination node
856 // removeRedundantReachToNodes(reachToSet);
861 private void removeRedundantReachToNodes(Set<HNode> reachToSet) {
863 Set<HNode> toberemoved = new HashSet<HNode>();
864 for (Iterator iterator = reachToSet.iterator(); iterator.hasNext();) {
865 HNode cur = (HNode) iterator.next();
867 for (Iterator iterator2 = reachToSet.iterator(); iterator2.hasNext();) {
868 HNode dst = (HNode) iterator2.next();
869 if (!cur.equals(dst) && reachTo(cur, dst)) {
871 toberemoved.add(cur);
875 reachToSet.removeAll(toberemoved);
878 private void recurSkeletonReachTo(HNode node, Set<HNode> reachToSet, Set<HNode> visited) {
880 Set<HNode> inSet = getIncomingNodeSet(node);
881 for (Iterator iterator = inSet.iterator(); iterator.hasNext();) {
882 HNode inNode = (HNode) iterator.next();
884 if (inNode.isSkeleton()) {
885 reachToSet.add(inNode);
886 } else if (!visited.contains(inNode)) {
888 recurSkeletonReachTo(inNode, reachToSet, visited);
894 public Map<HNode, Set<HNode>> getMapHNodeToOutgoingSet() {
895 return mapHNodeToOutgoingSet;
898 public Map<HNode, Set<HNode>> getMapHNodeToIncomingSet() {
899 return mapHNodeToIncomingSet;
902 public void setMapHNodeToOutgoingSet(Map<HNode, Set<HNode>> in) {
903 mapHNodeToOutgoingSet.clear();
904 Set<HNode> keySet = in.keySet();
905 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
906 HNode key = (HNode) iterator.next();
907 Set<HNode> inSet = in.get(key);
908 Set<HNode> newSet = new HashSet<HNode>();
909 newSet.addAll(inSet);
910 mapHNodeToOutgoingSet.put(key, newSet);
914 public void setMapHNodeToIncomingSet(Map<HNode, Set<HNode>> in) {
915 mapHNodeToIncomingSet.clear();
916 Set<HNode> keySet = in.keySet();
917 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
918 HNode key = (HNode) iterator.next();
919 Set<HNode> inSet = in.get(key);
920 Set<HNode> newSet = new HashSet<HNode>();
921 newSet.addAll(inSet);
922 mapHNodeToIncomingSet.put(key, newSet);
926 public void setNodeSet(Set<HNode> inSet) {
928 nodeSet.addAll(inSet);
931 public HierarchyGraph clone() {
932 HierarchyGraph clone = new HierarchyGraph();
933 clone.setDesc(getDesc());
934 clone.setName(getName());
935 clone.setNodeSet(getNodeSet());
936 clone.setMapHNodeToIncomingSet(getMapHNodeToIncomingSet());
937 clone.setMapHNodeToOutgoingSet(getMapHNodeToOutgoingSet());
938 clone.setMapDescToHNode(getMapDescToHNode());
939 clone.setMapHNodeToDescSet(getMapHNodeToDescSet());
940 clone.setMapHNodetoMergeSet(getMapHNodetoMergeSet());
941 clone.setMapHNodeToCurrentHNode(getMapHNodeToCurrentHNode());
942 clone.setMapHNodeNameToCurrentHNode(getMapHNodeNameToCurrentHNode());
947 public Map<HNode, Set<HNode>> getMapHNodetoMergeSet() {
948 return mapMergeNodetoMergingSet;
951 public void setMapHNodetoMergeSet(Map<HNode, Set<HNode>> mapHNodetoMergeSet) {
952 this.mapMergeNodetoMergingSet = mapHNodetoMergeSet;
955 public Set<HNode> getOutgoingNodeSetByCombineSet(Set<HNode> combineSet) {
957 if (!mapCombineNodeSetToOutgoingNodeSet.containsKey(combineSet)) {
958 mapCombineNodeSetToOutgoingNodeSet.put(combineSet, new HashSet<HNode>());
960 return mapCombineNodeSetToOutgoingNodeSet.get(combineSet);
963 public void identifyCombinationNodes() {
965 // 1) set combination node flag if a node combines more than one skeleton node.
966 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
967 HNode node = (HNode) iterator.next();
968 if (!node.isSkeleton()) {
969 Set<HNode> reachToSet = getSkeleteNodeSetReachTo(node);
970 System.out.println("$node=" + node + " reachToNodeSet=" + reachToSet);
971 if (reachToSet.size() > 1) {
972 // if (countSkeletonNodes(reachToSet) > 1) {
973 System.out.println("-node=" + node + " reachToSet=" + reachToSet);
974 System.out.println("-set combinationnode=" + node);
975 node.setCombinationNode(true);
976 mapCombinationNodeToCombineNodeSet.put(node, reachToSet);
981 // 2) compute the outgoing set that needs to be directly connected from the combination node
982 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
983 HNode node = (HNode) iterator.next();
984 if (node.isCombinationNode()) {
985 Set<HNode> combineSet = mapCombinationNodeToCombineNodeSet.get(node);
986 Set<HNode> outSet = getDirectlyReachableNodeSetFromCombinationNode(node);
987 addMapCombineSetToOutgoingSet(combineSet, outSet);
993 public Map<HNode, Set<HNode>> getMapCombinationNodeToCombineNodeSet() {
994 return mapCombinationNodeToCombineNodeSet;
997 public int countSkeletonNodes(Set<HNode> set) {
1000 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
1001 HNode node = (HNode) iterator.next();
1002 Set<Descriptor> descSet = getDescSetOfNode(node);
1003 count += descSet.size();
1009 private void addMapCombineSetToOutgoingSet(Set<HNode> combineSet, Set<HNode> outSet) {
1010 if (!mapCombineNodeSetToOutgoingNodeSet.containsKey(combineSet)) {
1011 mapCombineNodeSetToOutgoingNodeSet.put(combineSet, new HashSet<HNode>());
1013 mapCombineNodeSetToOutgoingNodeSet.get(combineSet).addAll(outSet);
1016 private Set<HNode> getDirectlyReachableNodeSetFromCombinationNode(HNode node) {
1017 // the method returns the set of nodes that are reachable from the current node
1018 // and do not combine the same set of skeleton nodes...
1020 Set<HNode> visited = new HashSet<HNode>();
1021 Set<HNode> reachableSet = new HashSet<HNode>();
1022 Set<HNode> combineSet = mapCombinationNodeToCombineNodeSet.get(node);
1024 recurDirectlyReachableNodeSetFromCombinationNode(node, combineSet, reachableSet, visited);
1026 return reachableSet;
1029 private void recurDirectlyReachableNodeSetFromCombinationNode(HNode node, Set<HNode> combineSet,
1030 Set<HNode> reachableSet, Set<HNode> visited) {
1032 Set<HNode> outSet = getOutgoingNodeSet(node);
1033 for (Iterator iterator = outSet.iterator(); iterator.hasNext();) {
1034 HNode outNode = (HNode) iterator.next();
1036 if (outNode.isCombinationNode()) {
1037 Set<HNode> combineSetOfOutNode = mapCombinationNodeToCombineNodeSet.get(outNode);
1038 if (combineSetOfOutNode.equals(combineSet)) {
1039 recurDirectlyReachableNodeSetFromCombinationNode(outNode, combineSet, reachableSet,
1042 reachableSet.add(outNode);
1044 } else if (outNode.isSkeleton()) {
1045 reachableSet.add(outNode);
1052 private Set<HNode> getReachableNodeSetFrom(HNode node) {
1054 Set<HNode> reachableSet = new HashSet<HNode>();
1055 Set<HNode> visited = new HashSet<HNode>();
1057 recurReachableNodeSetFrom(node, reachableSet, visited);
1059 return reachableSet;
1062 private void recurReachableNodeSetFrom(HNode node, Set<HNode> reachableSet, Set<HNode> visited) {
1064 Set<HNode> outgoingNodeSet = getOutgoingNodeSet(node);
1065 for (Iterator iterator = outgoingNodeSet.iterator(); iterator.hasNext();) {
1066 HNode outNode = (HNode) iterator.next();
1067 reachableSet.add(outNode);
1068 if (!visited.contains(outNode)) {
1069 visited.add(outNode);
1070 recurReachableNodeSetFrom(outNode, reachableSet, visited);
1076 public void assignUniqueIndexToNode() {
1078 // System.out.println("nodeSet=" + nodeSet);
1079 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
1080 HNode node = (HNode) iterator.next();
1081 mapHNodeToUniqueIndex.put(node, idx);
1085 BASISTOPELEMENT = new HashSet<Integer>();
1086 for (int i = 1; i < idx + 1; i++) {
1087 BASISTOPELEMENT.add(i);
1091 public BasisSet computeBasisSet(Set<HNode> notGenerateSet) {
1093 // assign a unique index to a node
1094 assignUniqueIndexToNode();
1096 // compute basis for each node
1097 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
1098 HNode node = (HNode) iterator.next();
1100 if (notGenerateSet.contains(node)) {
1101 System.out.println("%%%SKIP =" + node);
1104 Set<Integer> basis = new HashSet<Integer>();
1105 basis.addAll(BASISTOPELEMENT);
1107 Set<HNode> reachableNodeSet = getReachableNodeSetFrom(node);
1108 // System.out.println("node=" + node + " reachableNodeSet=" + reachableNodeSet);
1109 // System.out.println("mapHNodeToUniqueIndex.get(node)=" + mapHNodeToUniqueIndex.get(node));
1110 // if a node is reachable from the current node
1111 // need to remove the index of the reachable node from the basis
1113 basis.remove(getHNodeIndex(node));
1114 for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
1115 HNode reachableNode = (HNode) iterator2.next();
1116 // System.out.println("reachableNode=" + reachableNode);
1117 // System.out.println("getHNodeIndex(reachableNode))="
1118 // + mapHNodeToUniqueIndex.get(reachableNode));
1119 int idx = getHNodeIndex(reachableNode);
1123 mapHNodeToBasis.put(node, basis);
1126 // construct the basis set
1128 BasisSet basisSet = new BasisSet();
1130 Set<HNode> keySet = mapHNodeToBasis.keySet();
1131 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
1132 HNode node = (HNode) iterator.next();
1133 Set<Integer> basis = mapHNodeToBasis.get(node);
1134 basisSet.addElement(basis, node);
1141 public int getHNodeIndex(HNode node) {
1142 return mapHNodeToUniqueIndex.get(node).intValue();
1145 public Map<HNode, Integer> getMapHNodeToUniqueIndex() {
1146 return mapHNodeToUniqueIndex;
1149 public Map<HNode, Set<Integer>> getMapHNodeToBasis() {
1150 return mapHNodeToBasis;
1153 public Set<HNode> getCombinationNodeSetByCombineNodeSet(Set<HNode> combineSkeletonNodeSet) {
1155 Set<HNode> combinationNodeSet = new HashSet<HNode>();
1156 Set<HNode> keySet = mapCombinationNodeToCombineNodeSet.keySet();
1157 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
1158 HNode key = (HNode) iterator.next();
1160 if (mapCombinationNodeToCombineNodeSet.get(key).equals(combineSkeletonNodeSet)) {
1161 combinationNodeSet.add(key);
1165 return combinationNodeSet;
1168 public void writeGraph() {
1170 String graphName = "hierarchy" + name;
1171 graphName = graphName.replaceAll("[\\W]", "");
1174 BufferedWriter bw = new BufferedWriter(new FileWriter(graphName + ".dot"));
1176 bw.write("digraph " + graphName + " {\n");
1178 Iterator<HNode> iter = nodeSet.iterator();
1180 Set<HNode> addedNodeSet = new HashSet<HNode>();
1182 while (iter.hasNext()) {
1183 HNode u = iter.next();
1185 Set<HNode> outSet = getOutgoingNodeSet(u);
1187 if (outSet.size() == 0) {
1188 if (!addedNodeSet.contains(u)) {
1190 addedNodeSet.add(u);
1193 for (Iterator iterator = outSet.iterator(); iterator.hasNext();) {
1194 HNode v = (HNode) iterator.next();
1195 if (!addedNodeSet.contains(u)) {
1197 addedNodeSet.add(u);
1199 if (!addedNodeSet.contains(v)) {
1201 addedNodeSet.add(v);
1203 bw.write("" + u.getName() + " -> " + v.getName() + ";\n");
1212 } catch (IOException e) {
1213 e.printStackTrace();
1217 public boolean contains(HNode node) {
1218 return nodeSet.contains(node);
1221 public boolean isDirectlyConnectedTo(HNode src, HNode dst) {
1222 return getOutgoingNodeSet(src).contains(dst);
1225 private String convertMergeSetToString(Set<HNode> mergeSet) {
1227 for (Iterator iterator = mergeSet.iterator(); iterator.hasNext();) {
1228 HNode merged = (HNode) iterator.next();
1229 if (merged.isMergeNode()) {
1230 str += " " + convertMergeSetToString(mapMergeNodetoMergingSet.get(merged));
1232 str += " " + merged.getName();
1238 private void drawNode(BufferedWriter bw, HNode node) throws IOException {
1240 if (node.isMergeNode()) {
1241 nodeName = node.getNamePropertyString();
1242 Set<HNode> mergeSet = mapMergeNodetoMergingSet.get(node);
1243 nodeName += ":" + convertMergeSetToString(mergeSet);
1245 nodeName = node.getNamePropertyString();
1247 bw.write(node.getName() + " [label=\"" + nodeName + "\"]" + ";\n");
1250 public int countHopFromTopLocation(HNode node) {
1252 Set<HNode> inNodeSet = getIncomingNodeSet(node);
1254 if (inNodeSet.size() > 0) {
1255 count = recurCountHopFromTopLocation(inNodeSet, 1);
1261 private int recurCountHopFromTopLocation(Set<HNode> nodeSet, int curCount) {
1264 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
1265 HNode node = (HNode) iterator.next();
1266 Set<HNode> inNodeSet = getIncomingNodeSet(node);
1267 if (inNodeSet.size() > 0) {
1268 int recurCount = recurCountHopFromTopLocation(inNodeSet, curCount + 1);
1269 if (max < recurCount) {