1 package Analysis.SSJava;
3 import java.util.HashMap;
4 import java.util.HashSet;
5 import java.util.Iterator;
10 import IR.MethodDescriptor;
11 import IR.NameDescriptor;
14 public class BuildLattice {
16 private LocationInference infer;
17 private Map<HNode, TripleItem> mapSharedNodeToTripleItem;
18 private Map<HNode, Integer> mapHNodeToHighestIndex;
20 private Map<Pair<HNode, HNode>, Integer> mapItemToHighestIndex;
22 public BuildLattice(LocationInference infer) {
24 this.mapSharedNodeToTripleItem = new HashMap<HNode, TripleItem>();
25 this.mapHNodeToHighestIndex = new HashMap<HNode, Integer>();
26 this.mapItemToHighestIndex = new HashMap<Pair<HNode, HNode>, Integer>();
30 public SSJavaLattice<String> buildLattice(Descriptor desc) {
32 HierarchyGraph inputGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
33 LocationSummary locSummary = infer.getLocationSummary(desc);
35 Set<HNode> nodeSetWithCompositeLocation = new HashSet<HNode>();
36 if (desc instanceof MethodDescriptor) {
37 FlowGraph flowGraph = infer.getFlowGraph((MethodDescriptor) desc);
39 for (Iterator iterator = inputGraph.getNodeSet().iterator(); iterator.hasNext();) {
40 HNode hnode = (HNode) iterator.next();
41 Descriptor hnodeDesc = hnode.getDescriptor();
42 if (hnodeDesc != null) {
43 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
44 descTuple.add(hnodeDesc);
46 if (flowGraph.contains(descTuple)) {
47 FlowNode flowNode = flowGraph.getFlowNode(descTuple);
48 if (flowNode.getCompositeLocation() != null) {
49 nodeSetWithCompositeLocation.add(hnode);
58 BasisSet basisSet = inputGraph.computeBasisSet(nodeSetWithCompositeLocation);
59 debug_print(inputGraph);
61 Family family = generateFamily(basisSet);
62 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = coveringGraph(basisSet, family);
64 SSJavaLattice<String> lattice = buildLattice(desc, basisSet, inputGraph, locSummary, mapImSucc);
69 private SSJavaLattice<String> buildLattice(Descriptor desc, BasisSet basisSet,
70 HierarchyGraph inputGraph, LocationSummary locSummary,
71 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
73 SSJavaLattice<String> lattice =
74 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
76 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
78 Set<Set<Integer>> keySet = mapImSucc.keySet();
79 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
80 Set<Integer> higher = (Set<Integer>) iterator.next();
82 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
84 HNode higherNode = inputGraph.getHNode(higherName);
86 if (higherNode == null) {
87 NameDescriptor d = new NameDescriptor(higherName);
88 higherNode = inputGraph.getHNode(d);
89 higherNode.setSkeleton(true);
92 if (higherNode != null && higherNode.isSharedNode()) {
93 lattice.addSharedLoc(higherName);
95 Set<Descriptor> descSet = inputGraph.getDescSetOfNode(higherNode);
96 // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet="
98 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
99 Descriptor d = (Descriptor) iterator2.next();
100 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName);
102 // locSummary.addMapHNodeNameToLocationName(higherName, higherName);
104 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
105 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
106 Set<Integer> lower = (Set<Integer>) iterator2.next();
108 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
109 HNode lowerNode = inputGraph.getHNode(lowerName);
111 if (lowerNode == null && !lowerName.equals(SSJavaAnalysis.BOTTOM)) {
112 NameDescriptor d = new NameDescriptor(lowerName);
113 lowerNode = inputGraph.getHNode(d);
114 lowerNode.setSkeleton(true);
117 if (lowerNode != null && !inputGraph.isDirectlyConnectedTo(higherNode, lowerNode)) {
118 inputGraph.addEdge(higherNode, lowerNode);
121 if (lowerNode != null && lowerNode.isSharedNode()) {
122 lattice.addSharedLoc(lowerName);
125 Set<Descriptor> lowerDescSet = inputGraph.getDescSetOfNode(lowerNode);
126 // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet="
128 for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) {
129 Descriptor d = (Descriptor) iterator3.next();
130 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName);
132 // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
134 if (higher.size() == 0) {
136 lattice.put(lowerName);
138 lattice.addRelationHigherToLower(higherName, lowerName);
145 inputGraph.removeRedundantEdges();
149 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
151 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
153 if (nodeFromSimpleGraph.isSkeleton()) {
154 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
157 Set<HNode> combineSkeletonNodeSet =
158 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
159 HNode combinationNodeInSCGraph =
160 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
161 .get(combineSkeletonNodeSet);
163 // Set<HNode> combineSkeletonNodeSet =
164 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
165 // HNode combinationNodeInSCGraph =
166 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
167 return combinationNodeInSCGraph;
170 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
171 SSJavaLattice<String> skeletonLattice) {
173 // perform DFS that starts from each skeleton/combination node and ends by another
174 // skeleton/combination node
176 mapSharedNodeToTripleItem.clear();
178 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
179 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
180 LocationSummary locSummary = infer.getLocationSummary(desc);
182 SSJavaLattice<String> lattice = skeletonLattice.clone();
184 Set<HNode> visited = new HashSet<HNode>();
186 Set<HNode> nodeSet = simpleGraph.getNodeSet();
188 Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
190 // System.out.println("*insert=" + desc);
191 // System.out.println("***nodeSet=" + nodeSet);
192 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
193 HNode node = (HNode) iterator.next();
194 System.out.println("node=" + node);
196 if (node.isSkeleton() && (!visited.contains(node))) {
199 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
200 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
201 HNode outNode = (HNode) iterator2.next();
203 if (!outNode.isSkeleton()) {
204 if (outNode.isCombinationNode()) {
205 if (visited.containsAll(simpleGraph.getIncomingNodeSet(outNode))) {
206 // if (needToExpandCombinationNode(desc, outNode)) {
207 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary,
212 // we have a node that is neither combination or skeleton node
213 // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode);
214 HNode startNode = scGraph.getCurrentHNode(node);
216 // if (node.getDescriptor() != null) {
217 // // node is a skeleton node and it might be merged into another node in the SC
219 // startNode = scGraph.getHNode(node.getDescriptor());
221 // // this node has already been merged before the SC graph.
226 // Set<HNode> endNodeSetFromSimpleGraph =
227 // simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
228 // Set<HNode> endCombNodeSet = new HashSet<HNode>();
229 // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator();
230 // iterator3.hasNext();) {
231 // HNode endNode = (HNode) iterator3.next();
232 // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
235 Set<HNode> endCombNodeSet = scGraph.getOutgoingNodeSet(startNode);
237 // System.out.println("endCombNodeSet=" + endCombNodeSet);
238 visited.add(outNode);
239 if (endCombNodeSet.size() > 0) {
240 // follows the straight line up to another skeleton/combination node
241 endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
242 } else if (endCombNodeSet.size() == 0) {
243 // the outNode is (directly/transitively) connected to the bottom node
244 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
245 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
248 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
249 mapIntermediateLoc, 1, locSummary, outNode);
255 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
256 && !visited.contains(node)) {
258 System.out.println("n=" + node);
260 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
261 if (simpleGraph.getIncomingNodeSet(node).size() == 0) {
263 // this node will be directly connected to the TOP location
264 // start adding the following nodes from this node
266 Set<HNode> endNodeSetFromSimpleGraph =
267 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
269 Set<HNode> endCombNodeSet = new HashSet<HNode>();
270 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
271 HNode endNode = (HNode) iterator3.next();
272 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
275 System.out.println("endCombNodeSet=" + endCombNodeSet);
276 HNode startNode = LocationInference.TOPHNODE;
277 visited.add(startNode);
278 if (endCombNodeSet.size() > 0) {
279 // follows the straight line up to another skeleton/combination node
280 // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet);
281 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
282 mapIntermediateLoc, 1, locSummary, node);
290 // add shared locations
291 Set<HNode> sharedNodeSet = mapSharedNodeToTripleItem.keySet();
292 for (Iterator iterator = sharedNodeSet.iterator(); iterator.hasNext();) {
293 HNode sharedNode = (HNode) iterator.next();
294 TripleItem item = mapSharedNodeToTripleItem.get(sharedNode);
295 String nonSharedLocName = mapIntermediateLoc.get(item);
297 System.out.println("sharedNode=" + sharedNode + " locName=" + nonSharedLocName);
300 if (locSummary.getHNodeNameSetByLatticeLoationName(nonSharedLocName) != null
301 && !lattice.isSharedLoc(nonSharedLocName)) {
302 // need to generate a new shared location in the lattice, which is one level lower than the
303 // 'locName' location
304 newLocName = "ILOC" + (LocationInference.locSeed++);
306 // Set<String> aboveElementSet = getAboveElementSet(lattice, locName);
307 Set<String> belowElementSet = new HashSet<String>();
308 belowElementSet.addAll(lattice.get(nonSharedLocName));
310 System.out.println("nonSharedLocName=" + nonSharedLocName + " belowElementSet="
311 + belowElementSet + " newLocName=" + newLocName);
313 lattice.insertNewLocationBetween(nonSharedLocName, belowElementSet, newLocName);
315 newLocName = nonSharedLocName;
318 lattice.addSharedLoc(newLocName);
319 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
320 Set<Descriptor> descSet = graph.getDescSetOfNode(sharedNode);
321 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
322 Descriptor d = (Descriptor) iterator2.next();
323 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), newLocName);
325 locSummary.addMapHNodeNameToLocationName(sharedNode.getName(), newLocName);
333 private Set<String> getAboveElementSet(SSJavaLattice<String> lattice, String loc) {
335 Set<String> aboveSet = new HashSet<String>();
337 Map<String, Set<String>> latticeMap = lattice.getTable();
338 Set<String> keySet = latticeMap.keySet();
339 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
340 String key = (String) iterator.next();
341 if (latticeMap.get(key).contains(loc)) {
349 private boolean needToExpandCombinationNode(Descriptor desc, HNode cnode) {
351 System.out.println("needToExpandCombinationNode?=" + cnode);
353 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
354 // HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
355 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
356 Set<HNode> combinationNodeSetInSimpleGraph =
357 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
358 System.out.println("---combinationNodeSetInSimpleGraph=" + combinationNodeSetInSimpleGraph);
359 Set<HNode> inNodeSetToCNode = simpleGraph.getIncomingNodeSet(cnode);
360 System.out.println("------inNodeSetToCNode=" + inNodeSetToCNode);
361 for (Iterator iterator = combinationNodeSetInSimpleGraph.iterator(); iterator.hasNext();) {
362 HNode nodeBelongToTheSameCombinationNode = (HNode) iterator.next();
363 if (inNodeSetToCNode.contains(nodeBelongToTheSameCombinationNode)) {
364 // the combination node 'cnode' is not the highest location among the same combination node
372 private void expandCombinationNode(Descriptor desc, SSJavaLattice<String> lattice,
373 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
376 // expand the combination node 'outNode'
377 // here we need to expand the corresponding combination location in the lattice
378 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
380 System.out.println("expandCombinationNode=" + cnode + " cnode in scgraph="
381 + combinationNodeInSCGraph);
383 if (combinationNodeInSCGraph == null) {
387 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
388 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
390 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
392 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
394 Set<HNode> combinationNodeSet =
395 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
397 // System.out.println("combinationNodeSet=" + combinationNodeSet);
400 // Set<HNode> endNodeSetFromSimpleGraph =
401 // simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
402 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
403 // Set<HNode> endCombNodeSet = new HashSet<HNode>();
404 // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
405 // HNode endNode = (HNode) iterator3.next();
406 // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
409 Set<HNode> endCombNodeSet = scGraph.getOutgoingNodeSet(combinationNodeInSCGraph);
412 // follows the straight line up to another skeleton/combination node
413 if (endCombNodeSet.size() > 0) {
414 // System.out.println("---endCombNodeSet=" + endCombNodeSet);
416 removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
418 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
419 mapIntermediateLoc, 1, locSummary, cnode);
421 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
422 // System.out.println("---endCombNodeSet is zero");
423 // System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
424 // System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode));
425 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
426 mapIntermediateLoc, 1, locSummary, cnode);
432 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
433 Set<HNode> endNodeSet) {
435 // if an end node is not directly connected to the start node in the SC graph
436 // replace it with a directly connected one which transitively reaches to it.
438 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
440 Set<HNode> newEndNodeSet = new HashSet<HNode>();
441 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
442 HNode endNode = (HNode) iterator.next();
443 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
444 newEndNodeSet.add(endNode);
447 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
448 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
449 newEndNodeSet.add(newEndNode);
453 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
456 return newEndNodeSet;
460 private HNode getDirectlyReachableSCNodeFromEndNode(HierarchyGraph scGraph, HNode startNode,
461 Set<HNode> endNodeSet) {
463 // System.out.println("getDirectlyReachableSCNodeFromEndNode start=" + startNode +
466 Set<HNode> newStartNodeSet = new HashSet<HNode>();
468 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
469 HNode endNode = (HNode) iterator.next();
470 Set<HNode> connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode);
472 for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) {
473 HNode curNode = (HNode) iterator2.next();
474 if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet<HNode>())) {
475 newStartNodeSet.add(curNode);
480 // System.out.println("newStartNodeSet=" + newStartNodeSet);
482 if (newStartNodeSet.size() == 0) {
483 newStartNodeSet.add(startNode);
486 return newStartNodeSet.iterator().next();
489 private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode,
490 HNode curNode, Set<HNode> visited) {
491 // return true if curNode is transitively connected from the startNode
493 boolean isConnected = false;
494 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
495 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
496 HNode in = (HNode) iterator.next();
497 if (in.equals(startNode)) {
501 isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited);
508 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
509 HNode startNode, HNode endNode) {
510 // System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
511 // + " end=" + endNode);
512 Set<HNode> connected = new HashSet<HNode>();
513 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
514 if (connected.size() == 0) {
515 connected.add(endNode);
517 // System.out.println("connected=" + connected);
519 return connected.iterator().next();
522 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
523 HNode startNode, HNode curNode, Set<HNode> connected) {
525 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
526 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
527 HNode inNode = (HNode) iterator.next();
528 if (inNode.equals(startNode)) {
529 connected.add(curNode);
531 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
537 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
538 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
539 int idx, LocationSummary locSummary, HNode curNode) {
541 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
542 if (!mapIntermediateLoc.containsKey(item)) {
543 // need to create a new intermediate location in the lattice
544 String newLocName = "ILOC" + (LocationInference.locSeed++);
547 above = startNode.getName();
549 int prevIdx = idx - 1;
550 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
551 above = mapIntermediateLoc.get(prevItem);
554 Set<String> belowSet = new HashSet<String>();
555 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
556 HNode endNode = (HNode) iterator.next();
558 if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) {
559 locName = locSummary.getLocationName(endNode.getName());
561 locName = endNode.getName();
563 belowSet.add(locName);
565 lattice.insertNewLocationBetween(above, belowSet, newLocName);
567 mapIntermediateLoc.put(item, newLocName);
570 String locName = mapIntermediateLoc.get(item);
571 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
573 if (curNode.isSharedNode()) {
574 // if the current node is shared location, add a shared location to the lattice later
575 mapSharedNodeToTripleItem.put(curNode, item);
577 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
578 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
579 Descriptor d = (Descriptor) iterator.next();
580 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
582 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
585 System.out.println("-TripleItem normal=" + item);
586 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
587 + " locName=" + locName + " isC=" + curNode.isCombinationNode());
589 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
590 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
591 HNode outNode = (HNode) iterator2.next();
593 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
594 System.out.println("outNode=" + outNode);
595 System.out.println("---incomingHNodeSetToOutNode=" + incomingHNodeSetToOutNode);
597 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
598 Pair<HNode, HNode> pair = new Pair(startNode, outNode);
599 if (visited.containsAll(simpleHierarchyGraph.getIncomingNodeSet(outNode))) {
600 visited.add(outNode);
601 int newidx = getCurrentHighestIndex(pair, idx + 1);
602 // int newidx = getCurrentHighestIndex(outNode, idx + 1);
603 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
604 newidx, locSummary, outNode);
605 // recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
606 // idx + 1, locSummary, outNode);
608 updateHighestIndex(pair, idx + 1);
609 // updateHighestIndex(outNode, idx + 1);
610 System.out.println("NOT RECUR");
612 } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) {
613 if (needToExpandCombinationNode(desc, outNode)) {
614 System.out.println("NEED TO");
615 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
617 System.out.println("NOT NEED TO");
625 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
626 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
627 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
629 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
631 if (!mapIntermediateLoc.containsKey(item)) {
632 // need to create a new intermediate location in the lattice
635 String newLocName = combinationNodeInSCGraph.getName();
636 mapIntermediateLoc.put(item, newLocName);
638 String newLocName = "ILOC" + (LocationInference.locSeed++);
639 int prevIdx = idx - 1;
640 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
641 above = mapIntermediateLoc.get(prevItem);
643 Set<String> belowSet = new HashSet<String>();
644 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
645 HNode endNode = (HNode) iterator.next();
646 belowSet.add(endNode.getName());
648 lattice.insertNewLocationBetween(above, belowSet, newLocName);
649 mapIntermediateLoc.put(item, newLocName);
655 // Do we need to skip the combination node and assign a shared location to the next node?
656 // if (idx == 1 && curNode.isSharedNode()) {
657 // System.out.println("THE FIRST COMBINATION NODE EXPANSION IS SHARED!");
658 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, mapIntermediateLoc,
659 // idx + 1, locSummary, curNode);
663 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
664 String locName = mapIntermediateLoc.get(item);
665 if (curNode.isSharedNode()) {
666 // if the current node is shared location, add a shared location to the lattice later
667 mapSharedNodeToTripleItem.put(curNode, item);
669 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
670 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
671 Descriptor d = (Descriptor) iterator.next();
672 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
674 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
677 System.out.println("-TripleItem=" + item);
678 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
679 + " locName=" + locName);
681 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
682 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
683 HNode outNode = (HNode) iterator2.next();
684 System.out.println("---recurDFS outNode=" + outNode);
685 System.out.println("---cur combinationNodeInSCGraph=" + combinationNodeInSCGraph);
686 System.out.println("---outNode combinationNodeInSCGraph="
687 + getCombinationNodeInSCGraph(desc, outNode));
689 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
690 if (outNode.isCombinationNode()) {
692 Set<HNode> combineSkeletonNodeSet =
693 simpleHierarchyGraph.getCombineSetByCombinationNode(outNode);
694 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
695 // extract nodes belong to the same combine node
696 Set<HNode> incomingCombinedHNodeSet = new HashSet<HNode>();
697 for (Iterator iterator = incomingHNodeSetToOutNode.iterator(); iterator.hasNext();) {
698 HNode inNode = (HNode) iterator.next();
699 if (combineSkeletonNodeSet.contains(inNode)) {
700 incomingCombinedHNodeSet.add(inNode);
703 System.out.println("-----incomingCombinedHNodeSet=" + incomingCombinedHNodeSet);
705 // check whether the next combination node is different from the current node
706 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
707 Pair<HNode, HNode> pair = new Pair(combinationNodeInSCGraph, outNode);
708 if (visited.containsAll(incomingCombinedHNodeSet)) {
709 visited.add(outNode);
710 System.out.println("-------curIdx=" + (idx + 1));
712 int newIdx = getCurrentHighestIndex(pair, idx + 1);
713 // int newIdx = getCurrentHighestIndex(outNode, idx + 1);
714 System.out.println("-------newIdx=" + newIdx);
715 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
716 mapIntermediateLoc, newIdx, locSummary, outNode);
717 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
718 // mapIntermediateLoc, idx + 1, locSummary, outNode);
720 updateHighestIndex(pair, idx + 1);
721 // updateHighestIndex(outNode, idx + 1);
722 System.out.println("-----NOT RECUR!");
725 if (needToExpandCombinationNode(desc, outNode)) {
726 System.out.println("NEED TO");
727 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
729 System.out.println("NOT NEED TO");
741 private int getCurrentHighestIndex(Pair<HNode, HNode> pair, int curIdx) {
742 int recordedIdx = getCurrentHighestIndex(pair);
743 if (recordedIdx > curIdx) {
750 private int getCurrentHighestIndex(HNode node, int curIdx) {
751 int recordedIdx = getCurrentHighestIndex(node);
752 if (recordedIdx > curIdx) {
759 private int getCurrentHighestIndex(Pair<HNode, HNode> pair) {
760 if (!mapItemToHighestIndex.containsKey(pair)) {
761 mapItemToHighestIndex.put(pair, new Integer(-1));
763 return mapItemToHighestIndex.get(pair).intValue();
766 private void updateHighestIndex(Pair<HNode, HNode> pair, int idx) {
767 if (idx > getCurrentHighestIndex(pair)) {
768 mapItemToHighestIndex.put(pair, new Integer(idx));
772 private int getCurrentHighestIndex(HNode node) {
773 if (!mapHNodeToHighestIndex.containsKey(node)) {
774 mapHNodeToHighestIndex.put(node, new Integer(-1));
776 return mapHNodeToHighestIndex.get(node).intValue();
779 private void updateHighestIndex(HNode node, int idx) {
780 if (idx > getCurrentHighestIndex(node)) {
781 mapHNodeToHighestIndex.put(node, new Integer(idx));
785 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
786 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
788 if (mapF2LocName.containsKey(F)) {
789 return mapF2LocName.get(F);
792 HNode node = basisSet.getHNode(F);
794 mapF2LocName.put(F, node.getName());
795 return node.getName();
797 if (inputGraph.BASISTOPELEMENT.equals(F)) {
798 return SSJavaAnalysis.BOTTOM;
800 String str = "LOC" + (LocationInference.locSeed++);
801 mapF2LocName.put(F, str);
807 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
808 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
809 Set<Integer> F = iter.next();
810 mapFtoCount.put(F, 0);
814 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
816 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
817 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
819 // initialize COUNT(F) to 0 for all elements of the family
820 resetCount(mapFtoCount, family);
822 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
823 Set<Integer> F = iter.next();
824 Set<HNode> gammaF = family.getGamma(F);
826 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
827 curHNodeSet.removeAll(gammaF);
828 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
830 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
831 Set<Integer> B = (Set<Integer>) iterator.next();
833 Set<Integer> Fprime = new HashSet<Integer>();
838 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
840 // if |gamma(F')|==COUNT(F') + |gamma(F)|
841 int numGammaFprime = family.getGamma(Fprime).size();
842 int countFprime = mapFtoCount.get(Fprime);
843 int numGammaF = family.getGamma(F).size();
844 if (numGammaFprime == (countFprime + numGammaF)) {
845 // ImSucc(F)=IMSucc(F) union F'
846 addImSucc(mapImSucc, F, Fprime);
850 resetCount(mapFtoCount, family);
853 // System.out.println("mapImSucc=" + mapImSucc);
858 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
859 if (!mapImSucc.containsKey(F)) {
860 mapImSucc.put(F, new HashSet<Set<Integer>>());
862 return mapImSucc.get(F);
865 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
866 Set<Integer> Fprime) {
868 if (!mapImSucc.containsKey(F)) {
869 mapImSucc.put(F, new HashSet<Set<Integer>>());
872 mapImSucc.get(F).add(Fprime);
876 private Family generateFamily(BasisSet basisSet) {
878 Family family = new Family();
880 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
881 Set<Integer> B = iterator.next();
883 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
885 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
886 Set<Integer> F = iterator2.next();
888 Set<Integer> Fprime = new HashSet<Integer>();
892 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
893 gammaFPrimeSet.addAll(family.getGamma(F));
894 gammaFPrimeSet.add(basisSet.getHNode(B));
896 if (!family.containsF(Fprime)) {
897 Pair<Set<Integer>, Set<HNode>> pair =
898 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
901 family.updateGammaF(Fprime, gammaFPrimeSet);
905 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
907 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
908 family.addFElement(pair.getFirst());
909 family.updateGammaF(pair.getFirst(), pair.getSecond());
916 private void debug_print(HierarchyGraph inputGraph) {
917 System.out.println("\nBuild Lattice:" + inputGraph.getName());
918 // System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
919 // System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
928 public Identifier(HNode n, int i) {
933 public int hashCode() {
934 return node.hashCode() + idx;
937 public boolean equals(Object obj) {
939 if (obj instanceof Identifier) {
940 Identifier in = (Identifier) obj;
941 if (node.equals(in.node) && idx == in.idx) {
952 public HNode higherNode;
953 public Set<HNode> lowerNodeSet;
955 public boolean isShared;
957 public TripleItem(HNode h, Set<HNode> l, int i) {
964 public void setShared(boolean in) {
968 public boolean isShared() {
972 public int hashCode() {
975 if (higherNode != null) {
976 h = higherNode.hashCode();
983 return h + lowerNodeSet.hashCode() + idx;
986 public boolean equals(Object obj) {
988 if (obj instanceof TripleItem) {
989 TripleItem in = (TripleItem) obj;
990 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
991 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx && isShared == in.isShared()) {
999 public String toString() {
1000 String rtr = higherNode + "-" + idx + "->" + lowerNodeSet;