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 public BuildLattice(LocationInference infer) {
22 this.mapSharedNodeToTripleItem = new HashMap<HNode, TripleItem>();
23 this.mapHNodeToHighestIndex = new HashMap<HNode, Integer>();
26 public SSJavaLattice<String> buildLattice(Descriptor desc) {
28 HierarchyGraph inputGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
29 LocationSummary locSummary = infer.getLocationSummary(desc);
31 Set<HNode> nodeSetWithCompositeLocation = new HashSet<HNode>();
32 if (desc instanceof MethodDescriptor) {
33 FlowGraph flowGraph = infer.getFlowGraph((MethodDescriptor) desc);
35 for (Iterator iterator = inputGraph.getNodeSet().iterator(); iterator.hasNext();) {
36 HNode hnode = (HNode) iterator.next();
37 Descriptor hnodeDesc = hnode.getDescriptor();
38 if (hnodeDesc != null) {
39 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
40 descTuple.add(hnodeDesc);
42 if (flowGraph.contains(descTuple)) {
43 FlowNode flowNode = flowGraph.getFlowNode(descTuple);
44 if (flowNode.getCompositeLocation() != null) {
45 nodeSetWithCompositeLocation.add(hnode);
54 BasisSet basisSet = inputGraph.computeBasisSet(nodeSetWithCompositeLocation);
55 debug_print(inputGraph);
57 Family family = generateFamily(basisSet);
58 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = coveringGraph(basisSet, family);
60 SSJavaLattice<String> lattice = buildLattice(desc, basisSet, inputGraph, locSummary, mapImSucc);
65 private SSJavaLattice<String> buildLattice(Descriptor desc, BasisSet basisSet,
66 HierarchyGraph inputGraph, LocationSummary locSummary,
67 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
69 SSJavaLattice<String> lattice =
70 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
72 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
74 Set<Set<Integer>> keySet = mapImSucc.keySet();
75 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
76 Set<Integer> higher = (Set<Integer>) iterator.next();
78 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
80 HNode higherNode = inputGraph.getHNode(higherName);
82 if (higherNode == null) {
83 NameDescriptor d = new NameDescriptor(higherName);
84 higherNode = inputGraph.getHNode(d);
85 higherNode.setSkeleton(true);
88 if (higherNode != null && higherNode.isSharedNode()) {
89 lattice.addSharedLoc(higherName);
91 Set<Descriptor> descSet = inputGraph.getDescSetOfNode(higherNode);
92 // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet="
94 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
95 Descriptor d = (Descriptor) iterator2.next();
96 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName);
98 // locSummary.addMapHNodeNameToLocationName(higherName, higherName);
100 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
101 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
102 Set<Integer> lower = (Set<Integer>) iterator2.next();
104 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
105 HNode lowerNode = inputGraph.getHNode(lowerName);
107 if (lowerNode == null && !lowerName.equals(SSJavaAnalysis.BOTTOM)) {
108 NameDescriptor d = new NameDescriptor(lowerName);
109 lowerNode = inputGraph.getHNode(d);
110 lowerNode.setSkeleton(true);
113 if (lowerNode != null && !inputGraph.isDirectlyConnectedTo(higherNode, lowerNode)) {
114 inputGraph.addEdge(higherNode, lowerNode);
117 if (lowerNode != null && lowerNode.isSharedNode()) {
118 lattice.addSharedLoc(lowerName);
121 Set<Descriptor> lowerDescSet = inputGraph.getDescSetOfNode(lowerNode);
122 // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet="
124 for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) {
125 Descriptor d = (Descriptor) iterator3.next();
126 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName);
128 // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
130 if (higher.size() == 0) {
132 lattice.put(lowerName);
134 lattice.addRelationHigherToLower(higherName, lowerName);
141 inputGraph.removeRedundantEdges();
145 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
147 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
149 if (nodeFromSimpleGraph.isSkeleton()) {
150 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
153 Set<HNode> combineSkeletonNodeSet =
154 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
155 HNode combinationNodeInSCGraph =
156 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
157 .get(combineSkeletonNodeSet);
159 // Set<HNode> combineSkeletonNodeSet =
160 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
161 // HNode combinationNodeInSCGraph =
162 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
163 return combinationNodeInSCGraph;
166 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
167 SSJavaLattice<String> skeletonLattice) {
169 // perform DFS that starts from each skeleton/combination node and ends by another
170 // skeleton/combination node
172 mapSharedNodeToTripleItem.clear();
174 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
175 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
176 LocationSummary locSummary = infer.getLocationSummary(desc);
178 SSJavaLattice<String> lattice = skeletonLattice.clone();
180 Set<HNode> visited = new HashSet<HNode>();
182 Set<HNode> nodeSet = simpleGraph.getNodeSet();
184 Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
186 // System.out.println("*insert=" + desc);
187 // System.out.println("***nodeSet=" + nodeSet);
188 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
189 HNode node = (HNode) iterator.next();
190 System.out.println("node=" + node);
192 if (node.isSkeleton() && (!visited.contains(node))) {
195 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
196 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
197 HNode outNode = (HNode) iterator2.next();
199 if (!outNode.isSkeleton()) {
200 if (outNode.isCombinationNode()) {
201 if (visited.containsAll(simpleGraph.getIncomingNodeSet(outNode))) {
202 // if (needToExpandCombinationNode(desc, outNode)) {
203 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary,
208 // we have a node that is neither combination or skeleton node
209 // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode);
210 HNode startNode = scGraph.getCurrentHNode(node);
212 // if (node.getDescriptor() != null) {
213 // // node is a skeleton node and it might be merged into another node in the SC
215 // startNode = scGraph.getHNode(node.getDescriptor());
217 // // this node has already been merged before the SC graph.
221 Set<HNode> endNodeSetFromSimpleGraph =
222 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
224 // System.out.println("endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph
225 // + " from=" + outNode);
226 Set<HNode> endCombNodeSet = new HashSet<HNode>();
227 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
228 HNode endNode = (HNode) iterator3.next();
229 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
231 // System.out.println("endCombNodeSet=" + endCombNodeSet);
232 visited.add(outNode);
233 if (endCombNodeSet.size() > 0) {
234 // follows the straight line up to another skeleton/combination node
235 endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
236 } else if (endCombNodeSet.size() == 0) {
237 // the outNode is (directly/transitively) connected to the bottom node
238 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
239 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
242 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
243 mapIntermediateLoc, 1, locSummary, outNode);
249 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
250 && !visited.contains(node)) {
252 System.out.println("n=" + node);
254 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
255 if (simpleGraph.getIncomingNodeSet(node).size() == 0) {
257 // this node will be directly connected to the TOP location
258 // start adding the following nodes from this node
260 Set<HNode> endNodeSetFromSimpleGraph =
261 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
263 Set<HNode> endCombNodeSet = new HashSet<HNode>();
264 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
265 HNode endNode = (HNode) iterator3.next();
266 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
269 System.out.println("endCombNodeSet=" + endCombNodeSet);
270 HNode startNode = LocationInference.TOPHNODE;
271 visited.add(startNode);
272 if (endCombNodeSet.size() > 0) {
273 // follows the straight line up to another skeleton/combination node
274 // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet);
275 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
276 mapIntermediateLoc, 1, locSummary, node);
284 // add shared locations
285 Set<HNode> sharedNodeSet = mapSharedNodeToTripleItem.keySet();
286 for (Iterator iterator = sharedNodeSet.iterator(); iterator.hasNext();) {
287 HNode sharedNode = (HNode) iterator.next();
288 TripleItem item = mapSharedNodeToTripleItem.get(sharedNode);
289 String nonSharedLocName = mapIntermediateLoc.get(item);
290 // System.out.println("sharedNode=" + sharedNode + " locName=" + nonSharedLocName);
293 if (locSummary.getHNodeNameSetByLatticeLoationName(nonSharedLocName) != null
294 && !lattice.isSharedLoc(nonSharedLocName)) {
295 // need to generate a new shared location in the lattice, which is one level lower than the
296 // 'locName' location
297 newLocName = "ILOC" + (LocationInference.locSeed++);
299 // Set<String> aboveElementSet = getAboveElementSet(lattice, locName);
300 Set<String> belowElementSet = new HashSet<String>();
301 belowElementSet.addAll(lattice.get(nonSharedLocName));
303 // System.out.println("nonSharedLocName=" + nonSharedLocName + " belowElementSet="
304 // + belowElementSet + " newLocName=" + newLocName);
306 lattice.insertNewLocationBetween(nonSharedLocName, belowElementSet, newLocName);
308 newLocName = nonSharedLocName;
311 lattice.addSharedLoc(newLocName);
312 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
313 Set<Descriptor> descSet = graph.getDescSetOfNode(sharedNode);
314 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
315 Descriptor d = (Descriptor) iterator2.next();
316 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), newLocName);
318 locSummary.addMapHNodeNameToLocationName(sharedNode.getName(), newLocName);
326 private Set<String> getAboveElementSet(SSJavaLattice<String> lattice, String loc) {
328 Set<String> aboveSet = new HashSet<String>();
330 Map<String, Set<String>> latticeMap = lattice.getTable();
331 Set<String> keySet = latticeMap.keySet();
332 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
333 String key = (String) iterator.next();
334 if (latticeMap.get(key).contains(loc)) {
342 private boolean needToExpandCombinationNode(Descriptor desc, HNode cnode) {
344 System.out.println("needToExpandCombinationNode?=" + cnode);
346 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
347 // HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
348 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
349 Set<HNode> combinationNodeSetInSimpleGraph =
350 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
351 System.out.println("---combinationNodeSetInSimpleGraph=" + combinationNodeSetInSimpleGraph);
352 Set<HNode> inNodeSetToCNode = simpleGraph.getIncomingNodeSet(cnode);
353 System.out.println("------inNodeSetToCNode=" + inNodeSetToCNode);
354 for (Iterator iterator = combinationNodeSetInSimpleGraph.iterator(); iterator.hasNext();) {
355 HNode nodeBelongToTheSameCombinationNode = (HNode) iterator.next();
356 if (inNodeSetToCNode.contains(nodeBelongToTheSameCombinationNode)) {
357 // the combination node 'cnode' is not the highest location among the same combination node
365 private void expandCombinationNode(Descriptor desc, SSJavaLattice<String> lattice,
366 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
369 // expand the combination node 'outNode'
370 // here we need to expand the corresponding combination location in the lattice
371 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
373 System.out.println("expandCombinationNode=" + cnode + " cnode in scgraph="
374 + combinationNodeInSCGraph);
376 if (combinationNodeInSCGraph == null) {
380 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
382 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
384 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
386 Set<HNode> combinationNodeSet =
387 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
389 // System.out.println("combinationNodeSet=" + combinationNodeSet);
391 Set<HNode> endNodeSetFromSimpleGraph =
392 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
393 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
394 Set<HNode> endCombNodeSet = new HashSet<HNode>();
395 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
396 HNode endNode = (HNode) iterator3.next();
397 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
401 // follows the straight line up to another skeleton/combination node
402 if (endCombNodeSet.size() > 0) {
403 // System.out.println("---endCombNodeSet=" + endCombNodeSet);
405 removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
407 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
408 mapIntermediateLoc, 1, locSummary, cnode);
410 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
411 // System.out.println("---endCombNodeSet is zero");
412 // System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
413 // System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode));
414 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
415 mapIntermediateLoc, 1, locSummary, cnode);
421 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
422 Set<HNode> endNodeSet) {
424 // if an end node is not directly connected to the start node in the SC graph
425 // replace it with a directly connected one which transitively reaches to it.
427 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
429 Set<HNode> newEndNodeSet = new HashSet<HNode>();
430 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
431 HNode endNode = (HNode) iterator.next();
432 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
433 newEndNodeSet.add(endNode);
436 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
437 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
438 newEndNodeSet.add(newEndNode);
442 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
445 return newEndNodeSet;
449 private HNode getDirectlyReachableSCNodeFromEndNode(HierarchyGraph scGraph, HNode startNode,
450 Set<HNode> endNodeSet) {
452 // System.out.println("getDirectlyReachableSCNodeFromEndNode start=" + startNode +
455 Set<HNode> newStartNodeSet = new HashSet<HNode>();
457 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
458 HNode endNode = (HNode) iterator.next();
459 Set<HNode> connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode);
461 for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) {
462 HNode curNode = (HNode) iterator2.next();
463 if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet<HNode>())) {
464 newStartNodeSet.add(curNode);
469 // System.out.println("newStartNodeSet=" + newStartNodeSet);
471 if (newStartNodeSet.size() == 0) {
472 newStartNodeSet.add(startNode);
475 return newStartNodeSet.iterator().next();
478 private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode,
479 HNode curNode, Set<HNode> visited) {
480 // return true if curNode is transitively connected from the startNode
482 boolean isConnected = false;
483 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
484 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
485 HNode in = (HNode) iterator.next();
486 if (in.equals(startNode)) {
490 isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited);
497 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
498 HNode startNode, HNode endNode) {
499 // System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
500 // + " end=" + endNode);
501 Set<HNode> connected = new HashSet<HNode>();
502 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
503 if (connected.size() == 0) {
504 connected.add(endNode);
506 // System.out.println("connected=" + connected);
508 return connected.iterator().next();
511 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
512 HNode startNode, HNode curNode, Set<HNode> connected) {
514 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
515 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
516 HNode inNode = (HNode) iterator.next();
517 if (inNode.equals(startNode)) {
518 connected.add(curNode);
520 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
526 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
527 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
528 int idx, LocationSummary locSummary, HNode curNode) {
530 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
531 // System.out.println("item=" + item);
532 if (!mapIntermediateLoc.containsKey(item)) {
533 // need to create a new intermediate location in the lattice
534 String newLocName = "ILOC" + (LocationInference.locSeed++);
537 above = startNode.getName();
539 int prevIdx = idx - 1;
540 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
541 above = mapIntermediateLoc.get(prevItem);
544 Set<String> belowSet = new HashSet<String>();
545 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
546 HNode endNode = (HNode) iterator.next();
548 if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) {
549 locName = locSummary.getLocationName(endNode.getName());
551 locName = endNode.getName();
553 belowSet.add(locName);
555 lattice.insertNewLocationBetween(above, belowSet, newLocName);
557 mapIntermediateLoc.put(item, newLocName);
560 String locName = mapIntermediateLoc.get(item);
561 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
563 if (curNode.isSharedNode()) {
564 // if the current node is shared location, add a shared location to the lattice later
565 mapSharedNodeToTripleItem.put(curNode, item);
567 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
568 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
569 Descriptor d = (Descriptor) iterator.next();
570 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
572 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
575 System.out.println("-TripleItem normal=" + item);
576 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
577 + " locName=" + locName + " isC=" + curNode.isCombinationNode());
579 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
580 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
581 HNode outNode = (HNode) iterator2.next();
583 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
584 System.out.println("outNode=" + outNode);
585 System.out.println("---incomingHNodeSetToOutNode=" + incomingHNodeSetToOutNode);
587 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
588 if (visited.containsAll(simpleHierarchyGraph.getIncomingNodeSet(outNode))) {
589 visited.add(outNode);
590 int newidx = getCurrentHighestIndex(outNode, idx + 1);
591 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
592 newidx, locSummary, outNode);
593 // recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
594 // idx + 1, locSummary, outNode);
596 updateHighestIndex(outNode, idx + 1);
597 System.out.println("NOT RECUR");
599 } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) {
600 if (needToExpandCombinationNode(desc, outNode)) {
601 System.out.println("NEED TO");
602 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
604 System.out.println("NOT NEED TO");
612 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
613 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
614 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
616 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
618 if (!mapIntermediateLoc.containsKey(item)) {
619 // need to create a new intermediate location in the lattice
622 String newLocName = combinationNodeInSCGraph.getName();
623 mapIntermediateLoc.put(item, newLocName);
625 String newLocName = "ILOC" + (LocationInference.locSeed++);
626 int prevIdx = idx - 1;
627 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
628 above = mapIntermediateLoc.get(prevItem);
630 Set<String> belowSet = new HashSet<String>();
631 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
632 HNode endNode = (HNode) iterator.next();
633 belowSet.add(endNode.getName());
635 lattice.insertNewLocationBetween(above, belowSet, newLocName);
636 mapIntermediateLoc.put(item, newLocName);
642 // Do we need to skip the combination node and assign a shared location to the next node?
643 // if (idx == 1 && curNode.isSharedNode()) {
644 // System.out.println("THE FIRST COMBINATION NODE EXPANSION IS SHARED!");
645 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, mapIntermediateLoc,
646 // idx + 1, locSummary, curNode);
650 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
651 String locName = mapIntermediateLoc.get(item);
652 if (curNode.isSharedNode()) {
653 // if the current node is shared location, add a shared location to the lattice later
654 mapSharedNodeToTripleItem.put(curNode, item);
656 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
657 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
658 Descriptor d = (Descriptor) iterator.next();
659 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
661 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
664 System.out.println("-TripleItem=" + item);
665 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
666 + " locName=" + locName);
668 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
669 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
670 HNode outNode = (HNode) iterator2.next();
671 System.out.println("---recurDFS outNode=" + outNode);
672 System.out.println("---cur combinationNodeInSCGraph=" + combinationNodeInSCGraph);
673 System.out.println("---outNode combinationNodeInSCGraph="
674 + getCombinationNodeInSCGraph(desc, outNode));
676 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
677 if (outNode.isCombinationNode()) {
679 Set<HNode> combineSkeletonNodeSet =
680 simpleHierarchyGraph.getCombineSetByCombinationNode(outNode);
681 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
682 // extract nodes belong to the same combine node
683 Set<HNode> incomingCombinedHNodeSet = new HashSet<HNode>();
684 for (Iterator iterator = incomingHNodeSetToOutNode.iterator(); iterator.hasNext();) {
685 HNode inNode = (HNode) iterator.next();
686 if (combineSkeletonNodeSet.contains(inNode)) {
687 incomingCombinedHNodeSet.add(inNode);
690 System.out.println("-----incomingCombinedHNodeSet=" + incomingCombinedHNodeSet);
692 // check whether the next combination node is different from the current node
693 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
694 if (visited.containsAll(incomingCombinedHNodeSet)) {
695 visited.add(outNode);
696 System.out.println("-------curIdx=" + (idx + 1));
697 int newIdx = getCurrentHighestIndex(outNode, idx + 1);
698 System.out.println("-------newIdx=" + newIdx);
699 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
700 mapIntermediateLoc, newIdx, locSummary, outNode);
701 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
702 // mapIntermediateLoc, idx + 1, locSummary, outNode);
704 updateHighestIndex(outNode, idx + 1);
705 System.out.println("-----NOT RECUR!");
708 if (needToExpandCombinationNode(desc, outNode)) {
709 System.out.println("NEED TO");
710 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
712 System.out.println("NOT NEED TO");
724 private int getCurrentHighestIndex(HNode node, int curIdx) {
725 int recordedIdx = getCurrentHighestIndex(node);
726 if (recordedIdx > curIdx) {
733 private int getCurrentHighestIndex(HNode node) {
734 if (!mapHNodeToHighestIndex.containsKey(node)) {
735 mapHNodeToHighestIndex.put(node, new Integer(-1));
737 return mapHNodeToHighestIndex.get(node).intValue();
740 private void updateHighestIndex(HNode node, int idx) {
741 if (idx > getCurrentHighestIndex(node)) {
742 mapHNodeToHighestIndex.put(node, new Integer(idx));
746 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
747 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
749 if (mapF2LocName.containsKey(F)) {
750 return mapF2LocName.get(F);
753 HNode node = basisSet.getHNode(F);
755 mapF2LocName.put(F, node.getName());
756 return node.getName();
758 if (inputGraph.BASISTOPELEMENT.equals(F)) {
759 return SSJavaAnalysis.BOTTOM;
761 String str = "LOC" + (LocationInference.locSeed++);
762 mapF2LocName.put(F, str);
768 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
769 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
770 Set<Integer> F = iter.next();
771 mapFtoCount.put(F, 0);
775 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
777 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
778 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
780 // initialize COUNT(F) to 0 for all elements of the family
781 resetCount(mapFtoCount, family);
783 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
784 Set<Integer> F = iter.next();
785 Set<HNode> gammaF = family.getGamma(F);
787 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
788 curHNodeSet.removeAll(gammaF);
789 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
791 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
792 Set<Integer> B = (Set<Integer>) iterator.next();
794 Set<Integer> Fprime = new HashSet<Integer>();
799 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
801 // if |gamma(F')|==COUNT(F') + |gamma(F)|
802 int numGammaFprime = family.getGamma(Fprime).size();
803 int countFprime = mapFtoCount.get(Fprime);
804 int numGammaF = family.getGamma(F).size();
805 if (numGammaFprime == (countFprime + numGammaF)) {
806 // ImSucc(F)=IMSucc(F) union F'
807 addImSucc(mapImSucc, F, Fprime);
811 resetCount(mapFtoCount, family);
814 // System.out.println("mapImSucc=" + mapImSucc);
819 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
820 if (!mapImSucc.containsKey(F)) {
821 mapImSucc.put(F, new HashSet<Set<Integer>>());
823 return mapImSucc.get(F);
826 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
827 Set<Integer> Fprime) {
829 if (!mapImSucc.containsKey(F)) {
830 mapImSucc.put(F, new HashSet<Set<Integer>>());
833 mapImSucc.get(F).add(Fprime);
837 private Family generateFamily(BasisSet basisSet) {
839 Family family = new Family();
841 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
842 Set<Integer> B = iterator.next();
844 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
846 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
847 Set<Integer> F = iterator2.next();
849 Set<Integer> Fprime = new HashSet<Integer>();
853 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
854 gammaFPrimeSet.addAll(family.getGamma(F));
855 gammaFPrimeSet.add(basisSet.getHNode(B));
857 if (!family.containsF(Fprime)) {
858 Pair<Set<Integer>, Set<HNode>> pair =
859 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
862 family.updateGammaF(Fprime, gammaFPrimeSet);
866 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
868 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
869 family.addFElement(pair.getFirst());
870 family.updateGammaF(pair.getFirst(), pair.getSecond());
877 private void debug_print(HierarchyGraph inputGraph) {
878 System.out.println("\nBuild Lattice:" + inputGraph.getName());
879 // System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
880 // System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
889 public Identifier(HNode n, int i) {
894 public int hashCode() {
895 return node.hashCode() + idx;
898 public boolean equals(Object obj) {
900 if (obj instanceof Identifier) {
901 Identifier in = (Identifier) obj;
902 if (node.equals(in.node) && idx == in.idx) {
913 public HNode higherNode;
914 public Set<HNode> lowerNodeSet;
916 public boolean isShared;
918 public TripleItem(HNode h, Set<HNode> l, int i) {
925 public void setShared(boolean in) {
929 public boolean isShared() {
933 public int hashCode() {
936 if (higherNode != null) {
937 h = higherNode.hashCode();
944 return h + lowerNodeSet.hashCode() + idx;
947 public boolean equals(Object obj) {
949 if (obj instanceof TripleItem) {
950 TripleItem in = (TripleItem) obj;
951 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
952 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx && isShared == in.isShared()) {
960 public String toString() {
961 String rtr = higherNode + "-" + idx + "->" + lowerNodeSet;