1 package Analysis.SSJava;
3 import java.util.HashMap;
4 import java.util.HashSet;
5 import java.util.Iterator;
9 import IR.ClassDescriptor;
11 import IR.MethodDescriptor;
12 import IR.NameDescriptor;
15 public class BuildLattice {
17 private LocationInference infer;
18 private Map<HNode, TripleItem> mapSharedNodeToTripleItem;
19 private Map<HNode, Integer> mapHNodeToHighestIndex;
21 private Map<Descriptor, Map<TripleItem, String>> mapDescToIntermediateLocMap;
23 private Map<Pair<HNode, HNode>, Integer> mapItemToHighestIndex;
25 public BuildLattice(LocationInference infer) {
27 this.mapSharedNodeToTripleItem = new HashMap<HNode, TripleItem>();
28 this.mapHNodeToHighestIndex = new HashMap<HNode, Integer>();
29 this.mapItemToHighestIndex = new HashMap<Pair<HNode, HNode>, Integer>();
30 this.mapDescToIntermediateLocMap = new HashMap<Descriptor, Map<TripleItem, String>>();
33 public SSJavaLattice<String> buildLattice(Descriptor desc) {
35 HierarchyGraph inputGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
36 LocationSummary locSummary = infer.getLocationSummary(desc);
38 HierarchyGraph naiveGraph = infer.getSimpleHierarchyGraph(desc);
40 // I don't think we need to keep the below if statement anymore
41 // because hierarchy graph does not have any composite location
42 Set<HNode> nodeSetWithCompositeLocation = new HashSet<HNode>();
43 if (desc instanceof MethodDescriptor) {
44 FlowGraph flowGraph = infer.getFlowGraph((MethodDescriptor) desc);
46 for (Iterator iterator = inputGraph.getNodeSet().iterator(); iterator.hasNext();) {
47 HNode hnode = (HNode) iterator.next();
48 Descriptor hnodeDesc = hnode.getDescriptor();
49 if (hnodeDesc != null) {
50 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
51 descTuple.add(hnodeDesc);
53 if (flowGraph.contains(descTuple)) {
54 FlowNode flowNode = flowGraph.getFlowNode(descTuple);
55 if (flowNode.getCompositeLocation() != null) {
56 nodeSetWithCompositeLocation.add(hnode);
65 // /////////////////////////////////////////////////////////////////////////////////////
66 // lattice generation for the native approach
67 BasisSet naiveBasisSet = naiveGraph.computeBasisSet(nodeSetWithCompositeLocation);
68 // debug_print(inputGraph);
70 Family naiveFamily = generateFamily(naiveBasisSet);
71 Map<Set<Integer>, Set<Set<Integer>>> naive_mapImSucc =
72 coveringGraph(naiveBasisSet, naiveFamily);
74 SSJavaLattice<String> naive_lattice =
75 buildLattice(desc, naiveBasisSet, naiveGraph, null, naive_mapImSucc);
76 LocationInference.numLocationsNaive += naive_lattice.getKeySet().size();
77 infer.addNaiveLattice(desc, naive_lattice);
78 // /////////////////////////////////////////////////////////////////////////////////////
80 // lattice generation for the proposed approach
81 BasisSet basisSet = inputGraph.computeBasisSet(nodeSetWithCompositeLocation);
82 // debug_print(inputGraph);
84 Family family = generateFamily(basisSet);
85 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = coveringGraph(basisSet, family);
87 SSJavaLattice<String> lattice = buildLattice(desc, basisSet, inputGraph, locSummary, mapImSucc);
92 public void setIntermediateLocMap(Descriptor desc, Map<TripleItem, String> map) {
93 mapDescToIntermediateLocMap.put(desc, map);
96 public Map<TripleItem, String> getIntermediateLocMap(Descriptor desc) {
97 if (!mapDescToIntermediateLocMap.containsKey(desc)) {
98 mapDescToIntermediateLocMap.put(desc, new HashMap<TripleItem, String>());
100 return mapDescToIntermediateLocMap.get(desc);
103 private Descriptor getParent(Descriptor desc) {
104 if (desc instanceof MethodDescriptor) {
105 MethodDescriptor md = (MethodDescriptor) desc;
106 ClassDescriptor cd = md.getClassDesc();
107 return infer.getParentMethodDesc(cd, md);
109 return ((ClassDescriptor) desc).getSuperDesc();
113 private SSJavaLattice<String> buildLattice(Descriptor desc, BasisSet basisSet,
114 HierarchyGraph inputGraph, LocationSummary locSummary,
115 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
117 System.out.println("\nBuild Lattice:" + inputGraph.getName());
119 SSJavaLattice<String> lattice =
120 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
122 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
124 Set<Set<Integer>> keySet = mapImSucc.keySet();
125 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
126 Set<Integer> higher = (Set<Integer>) iterator.next();
128 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
130 HNode higherNode = inputGraph.getHNode(higherName);
132 if (higherNode == null) {
133 NameDescriptor d = new NameDescriptor(higherName);
134 higherNode = inputGraph.getHNode(d);
135 higherNode.setSkeleton(true);
138 if (higherNode != null && higherNode.isSharedNode()) {
139 lattice.addSharedLoc(higherName);
141 Set<Descriptor> descSet = inputGraph.getDescSetOfNode(higherNode);
142 // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet="
145 if (locSummary != null) {
146 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
147 Descriptor d = (Descriptor) iterator2.next();
148 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName);
152 // locSummary.addMapHNodeNameToLocationName(higherName, higherName);
154 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
155 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
156 Set<Integer> lower = (Set<Integer>) iterator2.next();
158 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
159 HNode lowerNode = inputGraph.getHNode(lowerName);
161 if (lowerNode == null && !lowerName.equals(SSJavaAnalysis.BOTTOM)) {
162 NameDescriptor d = new NameDescriptor(lowerName);
163 lowerNode = inputGraph.getHNode(d);
164 lowerNode.setSkeleton(true);
167 if (lowerNode != null && !inputGraph.isDirectlyConnectedTo(higherNode, lowerNode)) {
168 inputGraph.addEdge(higherNode, lowerNode);
171 if (lowerNode != null && lowerNode.isSharedNode()) {
172 lattice.addSharedLoc(lowerName);
175 Set<Descriptor> lowerDescSet = inputGraph.getDescSetOfNode(lowerNode);
176 // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet="
178 if (locSummary != null) {
179 for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) {
180 Descriptor d = (Descriptor) iterator3.next();
181 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName);
184 // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
186 if (higher.size() == 0) {
188 lattice.put(lowerName);
190 lattice.addRelationHigherToLower(higherName, lowerName);
197 inputGraph.removeRedundantEdges();
201 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
203 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
205 if (nodeFromSimpleGraph.isSkeleton()) {
206 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
209 Set<HNode> combineSkeletonNodeSet =
210 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
211 HNode combinationNodeInSCGraph =
212 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
213 .get(combineSkeletonNodeSet);
215 // Set<HNode> combineSkeletonNodeSet =
216 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
217 // HNode combinationNodeInSCGraph =
218 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
219 return combinationNodeInSCGraph;
222 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
223 SSJavaLattice<String> skeletonLattice) {
224 // copy nodes/edges from the parent method/class if possible
225 SSJavaLattice<String> lattice = skeletonLattice.clone();
227 Descriptor parentDesc = getParent(desc);
228 if (parentDesc != null) {
229 SSJavaLattice<String> parentLattice = infer.getLattice(parentDesc);
231 Map<String, Set<String>> parentMap = parentLattice.getTable();
232 Set<String> parentKeySet = parentMap.keySet();
233 for (Iterator iterator = parentKeySet.iterator(); iterator.hasNext();) {
234 String parentKey = (String) iterator.next();
235 Set<String> parentValueSet = parentMap.get(parentKey);
236 for (Iterator iterator2 = parentValueSet.iterator(); iterator2.hasNext();) {
237 String value = (String) iterator2.next();
238 lattice.put(parentKey, value);
242 Set<String> parentSharedLocSet = parentLattice.getSharedLocSet();
243 for (Iterator iterator = parentSharedLocSet.iterator(); iterator.hasNext();) {
244 String parentSharedLoc = (String) iterator.next();
245 lattice.addSharedLoc(parentSharedLoc);
251 // perform DFS that starts from each skeleton/combination node and ends by another
252 // skeleton/combination node
254 mapSharedNodeToTripleItem.clear();
256 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
257 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
258 LocationSummary locSummary = infer.getLocationSummary(desc);
260 Set<HNode> visited = new HashSet<HNode>();
262 Set<HNode> nodeSet = simpleGraph.getNodeSet();
264 Map<TripleItem, String> mapIntermediateLoc = getIntermediateLocMap(desc);
265 // Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
267 // System.out.println("*insert=" + desc);
268 // System.out.println("***nodeSet=" + nodeSet);
269 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
270 HNode node = (HNode) iterator.next();
271 System.out.println("node=" + node);
273 if (node.isSkeleton() && (!visited.contains(node))) {
276 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
277 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
278 HNode outNode = (HNode) iterator2.next();
280 if (!outNode.isSkeleton()) {
281 if (outNode.isCombinationNode()) {
282 if (visited.containsAll(simpleGraph.getIncomingNodeSet(outNode))) {
283 // if (needToExpandCombinationNode(desc, outNode)) {
284 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary,
289 // we have a node that is neither combination or skeleton node
290 // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode);
291 HNode startNode = scGraph.getCurrentHNode(node);
293 // if (node.getDescriptor() != null) {
294 // // node is a skeleton node and it might be merged into another node in the SC
296 // startNode = scGraph.getHNode(node.getDescriptor());
298 // // this node has already been merged before the SC graph.
303 // Set<HNode> endNodeSetFromSimpleGraph =
304 // simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
305 // Set<HNode> endCombNodeSet = new HashSet<HNode>();
306 // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator();
307 // iterator3.hasNext();) {
308 // HNode endNode = (HNode) iterator3.next();
309 // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
312 Set<HNode> endCombNodeSet = scGraph.getOutgoingNodeSet(startNode);
314 // System.out.println("endCombNodeSet=" + endCombNodeSet);
315 visited.add(outNode);
316 if (endCombNodeSet.size() > 0) {
317 // follows the straight line up to another skeleton/combination node
318 endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
319 } else if (endCombNodeSet.size() == 0) {
320 // the outNode is (directly/transitively) connected to the bottom node
321 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
322 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
325 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
326 mapIntermediateLoc, 1, locSummary, outNode);
332 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
333 && !visited.contains(node)) {
335 System.out.println("n=" + node);
337 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
338 if (simpleGraph.getIncomingNodeSet(node).size() == 0) {
340 // this node will be directly connected to the TOP location
341 // start adding the following nodes from this node
343 Set<HNode> endNodeSetFromSimpleGraph =
344 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
346 Set<HNode> endCombNodeSet = new HashSet<HNode>();
347 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
348 HNode endNode = (HNode) iterator3.next();
349 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
352 System.out.println("endCombNodeSet=" + endCombNodeSet);
353 HNode startNode = LocationInference.TOPHNODE;
354 visited.add(startNode);
355 if (endCombNodeSet.size() > 0) {
356 // follows the straight line up to another skeleton/combination node
357 // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet);
358 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
359 mapIntermediateLoc, 1, locSummary, node);
367 // add shared locations
368 Set<HNode> sharedNodeSet = mapSharedNodeToTripleItem.keySet();
369 for (Iterator iterator = sharedNodeSet.iterator(); iterator.hasNext();) {
370 HNode sharedNode = (HNode) iterator.next();
371 TripleItem item = mapSharedNodeToTripleItem.get(sharedNode);
372 String nonSharedLocName = mapIntermediateLoc.get(item);
374 System.out.println("sharedNode=" + sharedNode + " locName=" + nonSharedLocName);
377 if (locSummary.getHNodeNameSetByLatticeLoationName(nonSharedLocName) != null
378 && !lattice.isSharedLoc(nonSharedLocName)) {
379 // need to generate a new shared location in the lattice, which is one level lower than the
380 // 'locName' location
381 newLocName = "ILOC" + (LocationInference.locSeed++);
383 // Set<String> aboveElementSet = getAboveElementSet(lattice, locName);
384 Set<String> belowElementSet = new HashSet<String>();
385 belowElementSet.addAll(lattice.get(nonSharedLocName));
387 System.out.println("nonSharedLocName=" + nonSharedLocName + " belowElementSet="
388 + belowElementSet + " newLocName=" + newLocName);
390 lattice.insertNewLocationBetween(nonSharedLocName, belowElementSet, newLocName);
392 newLocName = nonSharedLocName;
395 lattice.addSharedLoc(newLocName);
396 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
397 Set<Descriptor> descSet = graph.getDescSetOfNode(sharedNode);
398 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
399 Descriptor d = (Descriptor) iterator2.next();
400 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), newLocName);
402 locSummary.addMapHNodeNameToLocationName(sharedNode.getName(), newLocName);
410 private Set<String> getAboveElementSet(SSJavaLattice<String> lattice, String loc) {
412 Set<String> aboveSet = new HashSet<String>();
414 Map<String, Set<String>> latticeMap = lattice.getTable();
415 Set<String> keySet = latticeMap.keySet();
416 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
417 String key = (String) iterator.next();
418 if (latticeMap.get(key).contains(loc)) {
426 private boolean needToExpandCombinationNode(Descriptor desc, HNode cnode) {
428 System.out.println("needToExpandCombinationNode?=" + cnode);
430 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
431 // HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
432 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
433 Set<HNode> combinationNodeSetInSimpleGraph =
434 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
435 System.out.println("---combinationNodeSetInSimpleGraph=" + combinationNodeSetInSimpleGraph);
436 Set<HNode> inNodeSetToCNode = simpleGraph.getIncomingNodeSet(cnode);
437 System.out.println("------inNodeSetToCNode=" + inNodeSetToCNode);
438 for (Iterator iterator = combinationNodeSetInSimpleGraph.iterator(); iterator.hasNext();) {
439 HNode nodeBelongToTheSameCombinationNode = (HNode) iterator.next();
440 if (inNodeSetToCNode.contains(nodeBelongToTheSameCombinationNode)) {
441 // the combination node 'cnode' is not the highest location among the same combination node
449 private void expandCombinationNode(Descriptor desc, SSJavaLattice<String> lattice,
450 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
453 // expand the combination node 'outNode'
454 // here we need to expand the corresponding combination location in the lattice
455 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
457 System.out.println("expandCombinationNode=" + cnode + " cnode in scgraph="
458 + combinationNodeInSCGraph);
460 if (combinationNodeInSCGraph == null) {
464 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
465 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
467 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
469 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
471 Set<HNode> combinationNodeSet =
472 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
474 // System.out.println("combinationNodeSet=" + combinationNodeSet);
477 // Set<HNode> endNodeSetFromSimpleGraph =
478 // simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
479 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
480 // Set<HNode> endCombNodeSet = new HashSet<HNode>();
481 // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
482 // HNode endNode = (HNode) iterator3.next();
483 // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
486 Set<HNode> endCombNodeSet = scGraph.getOutgoingNodeSet(combinationNodeInSCGraph);
489 // follows the straight line up to another skeleton/combination node
490 if (endCombNodeSet.size() > 0) {
491 // System.out.println("---endCombNodeSet=" + endCombNodeSet);
493 removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
495 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
496 mapIntermediateLoc, 1, locSummary, cnode);
498 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
499 // System.out.println("---endCombNodeSet is zero");
500 // System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
501 // System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode));
502 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
503 mapIntermediateLoc, 1, locSummary, cnode);
509 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
510 Set<HNode> endNodeSet) {
512 // if an end node is not directly connected to the start node in the SC graph
513 // replace it with a directly connected one which transitively reaches to it.
515 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
517 Set<HNode> newEndNodeSet = new HashSet<HNode>();
518 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
519 HNode endNode = (HNode) iterator.next();
520 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
521 newEndNodeSet.add(endNode);
524 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
525 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
526 newEndNodeSet.add(newEndNode);
530 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
533 return newEndNodeSet;
537 private HNode getDirectlyReachableSCNodeFromEndNode(HierarchyGraph scGraph, HNode startNode,
538 Set<HNode> endNodeSet) {
540 // System.out.println("getDirectlyReachableSCNodeFromEndNode start=" + startNode +
543 Set<HNode> newStartNodeSet = new HashSet<HNode>();
545 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
546 HNode endNode = (HNode) iterator.next();
547 Set<HNode> connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode);
549 for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) {
550 HNode curNode = (HNode) iterator2.next();
551 if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet<HNode>())) {
552 newStartNodeSet.add(curNode);
557 // System.out.println("newStartNodeSet=" + newStartNodeSet);
559 if (newStartNodeSet.size() == 0) {
560 newStartNodeSet.add(startNode);
563 return newStartNodeSet.iterator().next();
566 private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode,
567 HNode curNode, Set<HNode> visited) {
568 // return true if curNode is transitively connected from the startNode
570 boolean isConnected = false;
571 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
572 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
573 HNode in = (HNode) iterator.next();
574 if (in.equals(startNode)) {
578 isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited);
585 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
586 HNode startNode, HNode endNode) {
587 // System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
588 // + " end=" + endNode);
589 Set<HNode> connected = new HashSet<HNode>();
590 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
591 if (connected.size() == 0) {
592 connected.add(endNode);
594 // System.out.println("connected=" + connected);
596 return connected.iterator().next();
599 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
600 HNode startNode, HNode curNode, Set<HNode> connected) {
602 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
603 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
604 HNode inNode = (HNode) iterator.next();
605 if (inNode.equals(startNode)) {
606 connected.add(curNode);
608 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
614 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
615 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
616 int idx, LocationSummary locSummary, HNode curNode) {
618 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
619 if (!mapIntermediateLoc.containsKey(item)) {
620 // need to create a new intermediate location in the lattice
621 String newLocName = "ILOC" + (LocationInference.locSeed++);
624 above = startNode.getName();
626 int prevIdx = idx - 1;
627 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
628 above = mapIntermediateLoc.get(prevItem);
631 Set<String> belowSet = new HashSet<String>();
632 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
633 HNode endNode = (HNode) iterator.next();
635 if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) {
636 locName = locSummary.getLocationName(endNode.getName());
638 locName = endNode.getName();
640 belowSet.add(locName);
642 lattice.insertNewLocationBetween(above, belowSet, newLocName);
644 mapIntermediateLoc.put(item, newLocName);
647 String locName = mapIntermediateLoc.get(item);
648 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
650 if (curNode.isSharedNode()) {
651 // if the current node is shared location, add a shared location to the lattice later
652 System.out.println("###SHARED ITEM=" + item);
653 mapSharedNodeToTripleItem.put(curNode, item);
655 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
656 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
657 Descriptor d = (Descriptor) iterator.next();
658 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
660 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
663 System.out.println("-TripleItem normal=" + item);
664 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
665 + " locName=" + locName + " isC=" + curNode.isCombinationNode());
667 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
668 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
669 HNode outNode = (HNode) iterator2.next();
671 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
672 System.out.println("outNode=" + outNode);
673 System.out.println("---incomingHNodeSetToOutNode=" + incomingHNodeSetToOutNode);
675 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
676 Pair<HNode, HNode> pair = new Pair(startNode, outNode);
677 if (visited.containsAll(simpleHierarchyGraph.getIncomingNodeSet(outNode))) {
678 visited.add(outNode);
679 int newidx = getCurrentHighestIndex(pair, idx + 1);
680 // int newidx = getCurrentHighestIndex(outNode, idx + 1);
681 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
682 newidx, locSummary, outNode);
683 // recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
684 // idx + 1, locSummary, outNode);
686 updateHighestIndex(pair, idx + 1);
687 // updateHighestIndex(outNode, idx + 1);
688 System.out.println("NOT RECUR");
690 } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) {
691 if (needToExpandCombinationNode(desc, outNode)) {
692 System.out.println("NEED TO");
693 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
695 System.out.println("NOT NEED TO");
703 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
704 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
705 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
707 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
709 if (!mapIntermediateLoc.containsKey(item)) {
710 // need to create a new intermediate location in the lattice
713 String newLocName = combinationNodeInSCGraph.getName();
714 mapIntermediateLoc.put(item, newLocName);
716 String newLocName = "ILOC" + (LocationInference.locSeed++);
717 int prevIdx = idx - 1;
718 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
719 above = mapIntermediateLoc.get(prevItem);
721 Set<String> belowSet = new HashSet<String>();
722 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
723 HNode endNode = (HNode) iterator.next();
724 belowSet.add(endNode.getName());
726 lattice.insertNewLocationBetween(above, belowSet, newLocName);
727 mapIntermediateLoc.put(item, newLocName);
733 // Do we need to skip the combination node and assign a shared location to the next node?
734 // if (idx == 1 && curNode.isSharedNode()) {
735 // System.out.println("THE FIRST COMBINATION NODE EXPANSION IS SHARED!");
736 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, mapIntermediateLoc,
737 // idx + 1, locSummary, curNode);
741 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
742 String locName = mapIntermediateLoc.get(item);
743 if (curNode.isSharedNode()) {
744 // if the current node is shared location, add a shared location to the lattice later
745 System.out.println("###SHARED ITEM=" + item);
746 mapSharedNodeToTripleItem.put(curNode, item);
748 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
749 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
750 Descriptor d = (Descriptor) iterator.next();
751 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
753 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
756 System.out.println("-TripleItem=" + item);
757 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
758 + " locName=" + locName);
760 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
761 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
762 HNode outNode = (HNode) iterator2.next();
763 System.out.println("---recurDFS outNode=" + outNode);
764 System.out.println("---cur combinationNodeInSCGraph=" + combinationNodeInSCGraph);
765 System.out.println("---outNode combinationNodeInSCGraph="
766 + getCombinationNodeInSCGraph(desc, outNode));
768 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
769 if (outNode.isCombinationNode()) {
771 Set<HNode> combineSkeletonNodeSet =
772 simpleHierarchyGraph.getCombineSetByCombinationNode(outNode);
773 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
774 // extract nodes belong to the same combine node
775 Set<HNode> incomingCombinedHNodeSet = new HashSet<HNode>();
776 for (Iterator iterator = incomingHNodeSetToOutNode.iterator(); iterator.hasNext();) {
777 HNode inNode = (HNode) iterator.next();
778 if (combineSkeletonNodeSet.contains(inNode)) {
779 incomingCombinedHNodeSet.add(inNode);
782 System.out.println("-----incomingCombinedHNodeSet=" + incomingCombinedHNodeSet);
784 // check whether the next combination node is different from the current node
785 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
786 Pair<HNode, HNode> pair = new Pair(combinationNodeInSCGraph, outNode);
787 if (visited.containsAll(incomingCombinedHNodeSet)) {
788 visited.add(outNode);
789 System.out.println("-------curIdx=" + (idx + 1));
791 int newIdx = getCurrentHighestIndex(pair, idx + 1);
792 // int newIdx = getCurrentHighestIndex(outNode, idx + 1);
793 System.out.println("-------newIdx=" + newIdx);
794 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
795 mapIntermediateLoc, newIdx, locSummary, outNode);
796 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
797 // mapIntermediateLoc, idx + 1, locSummary, outNode);
799 updateHighestIndex(pair, idx + 1);
800 // updateHighestIndex(outNode, idx + 1);
801 System.out.println("-----NOT RECUR!");
804 if (needToExpandCombinationNode(desc, outNode)) {
805 System.out.println("NEED TO");
806 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
808 System.out.println("NOT NEED TO");
820 private int getCurrentHighestIndex(Pair<HNode, HNode> pair, int curIdx) {
821 int recordedIdx = getCurrentHighestIndex(pair);
822 if (recordedIdx > curIdx) {
829 private int getCurrentHighestIndex(HNode node, int curIdx) {
830 int recordedIdx = getCurrentHighestIndex(node);
831 if (recordedIdx > curIdx) {
838 private int getCurrentHighestIndex(Pair<HNode, HNode> pair) {
839 if (!mapItemToHighestIndex.containsKey(pair)) {
840 mapItemToHighestIndex.put(pair, new Integer(-1));
842 return mapItemToHighestIndex.get(pair).intValue();
845 private void updateHighestIndex(Pair<HNode, HNode> pair, int idx) {
846 if (idx > getCurrentHighestIndex(pair)) {
847 mapItemToHighestIndex.put(pair, new Integer(idx));
851 private int getCurrentHighestIndex(HNode node) {
852 if (!mapHNodeToHighestIndex.containsKey(node)) {
853 mapHNodeToHighestIndex.put(node, new Integer(-1));
855 return mapHNodeToHighestIndex.get(node).intValue();
858 private void updateHighestIndex(HNode node, int idx) {
859 if (idx > getCurrentHighestIndex(node)) {
860 mapHNodeToHighestIndex.put(node, new Integer(idx));
864 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
865 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
867 if (mapF2LocName.containsKey(F)) {
868 return mapF2LocName.get(F);
871 HNode node = basisSet.getHNode(F);
873 mapF2LocName.put(F, node.getName());
874 return node.getName();
876 if (inputGraph.BASISTOPELEMENT.equals(F)) {
877 return SSJavaAnalysis.BOTTOM;
879 String str = "LOC" + (LocationInference.locSeed++);
880 mapF2LocName.put(F, str);
886 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
887 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
888 Set<Integer> F = iter.next();
889 mapFtoCount.put(F, 0);
893 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
895 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
896 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
898 // initialize COUNT(F) to 0 for all elements of the family
899 resetCount(mapFtoCount, family);
901 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
902 Set<Integer> F = iter.next();
903 Set<HNode> gammaF = family.getGamma(F);
905 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
906 curHNodeSet.removeAll(gammaF);
907 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
909 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
910 Set<Integer> B = (Set<Integer>) iterator.next();
912 Set<Integer> Fprime = new HashSet<Integer>();
917 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
919 // if |gamma(F')|==COUNT(F') + |gamma(F)|
920 int numGammaFprime = family.getGamma(Fprime).size();
921 int countFprime = mapFtoCount.get(Fprime);
922 int numGammaF = family.getGamma(F).size();
923 if (numGammaFprime == (countFprime + numGammaF)) {
924 // ImSucc(F)=IMSucc(F) union F'
925 addImSucc(mapImSucc, F, Fprime);
929 resetCount(mapFtoCount, family);
932 // System.out.println("mapImSucc=" + mapImSucc);
937 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
938 if (!mapImSucc.containsKey(F)) {
939 mapImSucc.put(F, new HashSet<Set<Integer>>());
941 return mapImSucc.get(F);
944 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
945 Set<Integer> Fprime) {
947 if (!mapImSucc.containsKey(F)) {
948 mapImSucc.put(F, new HashSet<Set<Integer>>());
951 mapImSucc.get(F).add(Fprime);
955 private Family generateFamily(BasisSet basisSet) {
957 Family family = new Family();
959 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
960 Set<Integer> B = iterator.next();
962 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
964 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
965 Set<Integer> F = iterator2.next();
967 Set<Integer> Fprime = new HashSet<Integer>();
971 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
972 gammaFPrimeSet.addAll(family.getGamma(F));
973 gammaFPrimeSet.add(basisSet.getHNode(B));
975 if (!family.containsF(Fprime)) {
976 Pair<Set<Integer>, Set<HNode>> pair =
977 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
980 family.updateGammaF(Fprime, gammaFPrimeSet);
984 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
986 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
987 family.addFElement(pair.getFirst());
988 family.updateGammaF(pair.getFirst(), pair.getSecond());
995 private void debug_print(HierarchyGraph inputGraph) {
996 System.out.println("\nBuild Lattice:" + inputGraph.getName());
997 System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
998 System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
1007 public Identifier(HNode n, int i) {
1012 public int hashCode() {
1013 return node.hashCode() + idx;
1016 public boolean equals(Object obj) {
1018 if (obj instanceof Identifier) {
1019 Identifier in = (Identifier) obj;
1020 if (node.equals(in.node) && idx == in.idx) {
1031 public HNode higherNode;
1032 public Set<HNode> lowerNodeSet;
1034 public boolean isShared;
1036 public TripleItem(HNode h, Set<HNode> l, int i) {
1043 public void setShared(boolean in) {
1047 public boolean isShared() {
1051 public int hashCode() {
1054 if (higherNode != null) {
1055 h = higherNode.hashCode();
1062 return h + lowerNodeSet.hashCode() + idx;
1065 public boolean equals(Object obj) {
1067 if (obj instanceof TripleItem) {
1068 TripleItem in = (TripleItem) obj;
1069 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
1070 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx && isShared == in.isShared()) {
1078 public String toString() {
1079 String rtr = higherNode + "-" + idx + "->" + lowerNodeSet;