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 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
71 SSJavaLattice<String> lattice =
72 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
74 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
76 Set<Set<Integer>> keySet = mapImSucc.keySet();
77 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
78 Set<Integer> higher = (Set<Integer>) iterator.next();
80 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
82 HNode higherNode = inputGraph.getHNode(higherName);
84 if (higherNode != null && higherNode.isSharedNode()) {
85 lattice.addSharedLoc(higherName);
87 Set<Descriptor> descSet = inputGraph.getDescSetOfNode(higherNode);
88 // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet="
90 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
91 Descriptor d = (Descriptor) iterator2.next();
92 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName);
94 // locSummary.addMapHNodeNameToLocationName(higherName, higherName);
96 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
97 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
98 Set<Integer> lower = (Set<Integer>) iterator2.next();
100 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
101 HNode lowerNode = inputGraph.getHNode(lowerName);
103 if (lowerNode != null && lowerNode.isSharedNode()) {
104 lattice.addSharedLoc(lowerName);
107 Set<Descriptor> lowerDescSet = inputGraph.getDescSetOfNode(lowerNode);
108 // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet="
110 for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) {
111 Descriptor d = (Descriptor) iterator3.next();
112 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName);
114 // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
116 if (higher.size() == 0) {
118 lattice.put(lowerName);
120 lattice.addRelationHigherToLower(higherName, lowerName);
130 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
132 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
134 if (nodeFromSimpleGraph.isSkeleton()) {
135 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
138 Set<HNode> combineSkeletonNodeSet =
139 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
140 HNode combinationNodeInSCGraph =
141 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
142 .get(combineSkeletonNodeSet);
144 // Set<HNode> combineSkeletonNodeSet =
145 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
146 // HNode combinationNodeInSCGraph =
147 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
148 return combinationNodeInSCGraph;
151 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
152 SSJavaLattice<String> skeletonLattice) {
154 // perform DFS that starts from each skeleton/combination node and ends by another
155 // skeleton/combination node
157 mapSharedNodeToTripleItem.clear();
159 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
160 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
161 LocationSummary locSummary = infer.getLocationSummary(desc);
163 SSJavaLattice<String> lattice = skeletonLattice.clone();
165 Set<HNode> visited = new HashSet<HNode>();
167 Set<HNode> nodeSet = simpleGraph.getNodeSet();
169 Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
171 // System.out.println("*insert=" + desc);
172 // System.out.println("***nodeSet=" + nodeSet);
173 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
174 HNode node = (HNode) iterator.next();
175 System.out.println("node=" + node);
177 if (node.isSkeleton() && (!visited.contains(node))) {
180 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
181 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
182 HNode outNode = (HNode) iterator2.next();
184 if (!outNode.isSkeleton()) {
185 if (outNode.isCombinationNode()) {
186 if (visited.containsAll(simpleGraph.getIncomingNodeSet(outNode))) {
187 // if (needToExpandCombinationNode(desc, outNode)) {
188 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary,
193 // we have a node that is neither combination or skeleton node
194 // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode);
195 HNode startNode = scGraph.getCurrentHNode(node);
197 // if (node.getDescriptor() != null) {
198 // // node is a skeleton node and it might be merged into another node in the SC
200 // startNode = scGraph.getHNode(node.getDescriptor());
202 // // this node has already been merged before the SC graph.
206 Set<HNode> endNodeSetFromSimpleGraph =
207 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
209 // System.out.println("endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph
210 // + " from=" + outNode);
211 Set<HNode> endCombNodeSet = new HashSet<HNode>();
212 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
213 HNode endNode = (HNode) iterator3.next();
214 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
216 // System.out.println("endCombNodeSet=" + endCombNodeSet);
217 visited.add(outNode);
218 if (endCombNodeSet.size() > 0) {
219 // follows the straight line up to another skeleton/combination node
220 endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
221 } else if (endCombNodeSet.size() == 0) {
222 // the outNode is (directly/transitively) connected to the bottom node
223 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
224 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
227 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
228 mapIntermediateLoc, 1, locSummary, outNode);
234 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
235 && !visited.contains(node)) {
237 System.out.println("n=" + node);
239 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
240 if (simpleGraph.getIncomingNodeSet(node).size() == 0) {
242 // this node will be directly connected to the TOP location
243 // start adding the following nodes from this node
245 Set<HNode> endNodeSetFromSimpleGraph =
246 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
248 Set<HNode> endCombNodeSet = new HashSet<HNode>();
249 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
250 HNode endNode = (HNode) iterator3.next();
251 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
254 System.out.println("endCombNodeSet=" + endCombNodeSet);
255 HNode startNode = LocationInference.TOPHNODE;
256 visited.add(startNode);
257 if (endCombNodeSet.size() > 0) {
258 // follows the straight line up to another skeleton/combination node
259 // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet);
260 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
261 mapIntermediateLoc, 1, locSummary, node);
269 // add shared locations
270 Set<HNode> sharedNodeSet = mapSharedNodeToTripleItem.keySet();
271 for (Iterator iterator = sharedNodeSet.iterator(); iterator.hasNext();) {
272 HNode sharedNode = (HNode) iterator.next();
273 TripleItem item = mapSharedNodeToTripleItem.get(sharedNode);
274 String nonSharedLocName = mapIntermediateLoc.get(item);
275 // System.out.println("sharedNode=" + sharedNode + " locName=" + nonSharedLocName);
278 if (locSummary.getHNodeNameSetByLatticeLoationName(nonSharedLocName) != null
279 && !lattice.isSharedLoc(nonSharedLocName)) {
280 // need to generate a new shared location in the lattice, which is one level lower than the
281 // 'locName' location
282 newLocName = "ILOC" + (LocationInference.locSeed++);
284 // Set<String> aboveElementSet = getAboveElementSet(lattice, locName);
285 Set<String> belowElementSet = new HashSet<String>();
286 belowElementSet.addAll(lattice.get(nonSharedLocName));
288 // System.out.println("nonSharedLocName=" + nonSharedLocName + " belowElementSet="
289 // + belowElementSet + " newLocName=" + newLocName);
291 lattice.insertNewLocationBetween(nonSharedLocName, belowElementSet, newLocName);
293 newLocName = nonSharedLocName;
296 lattice.addSharedLoc(newLocName);
297 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
298 Set<Descriptor> descSet = graph.getDescSetOfNode(sharedNode);
299 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
300 Descriptor d = (Descriptor) iterator2.next();
301 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), newLocName);
303 locSummary.addMapHNodeNameToLocationName(sharedNode.getName(), newLocName);
311 private Set<String> getAboveElementSet(SSJavaLattice<String> lattice, String loc) {
313 Set<String> aboveSet = new HashSet<String>();
315 Map<String, Set<String>> latticeMap = lattice.getTable();
316 Set<String> keySet = latticeMap.keySet();
317 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
318 String key = (String) iterator.next();
319 if (latticeMap.get(key).contains(loc)) {
327 private boolean needToExpandCombinationNode(Descriptor desc, HNode cnode) {
329 System.out.println("needToExpandCombinationNode?=" + cnode);
331 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
332 // HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
333 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
334 Set<HNode> combinationNodeSetInSimpleGraph =
335 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
336 System.out.println("---combinationNodeSetInSimpleGraph=" + combinationNodeSetInSimpleGraph);
337 Set<HNode> inNodeSetToCNode = simpleGraph.getIncomingNodeSet(cnode);
338 System.out.println("------inNodeSetToCNode=" + inNodeSetToCNode);
339 for (Iterator iterator = combinationNodeSetInSimpleGraph.iterator(); iterator.hasNext();) {
340 HNode nodeBelongToTheSameCombinationNode = (HNode) iterator.next();
341 if (inNodeSetToCNode.contains(nodeBelongToTheSameCombinationNode)) {
342 // the combination node 'cnode' is not the highest location among the same combination node
350 private void expandCombinationNode(Descriptor desc, SSJavaLattice<String> lattice,
351 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
354 // expand the combination node 'outNode'
355 // here we need to expand the corresponding combination location in the lattice
356 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
358 System.out.println("expandCombinationNode=" + cnode + " cnode in scgraph="
359 + combinationNodeInSCGraph);
361 if (combinationNodeInSCGraph == null) {
365 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
367 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
369 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
371 Set<HNode> combinationNodeSet =
372 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
374 // System.out.println("combinationNodeSet=" + combinationNodeSet);
376 Set<HNode> endNodeSetFromSimpleGraph =
377 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
378 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
379 Set<HNode> endCombNodeSet = new HashSet<HNode>();
380 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
381 HNode endNode = (HNode) iterator3.next();
382 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
386 // follows the straight line up to another skeleton/combination node
387 if (endCombNodeSet.size() > 0) {
388 // System.out.println("---endCombNodeSet=" + endCombNodeSet);
390 removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
392 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
393 mapIntermediateLoc, 1, locSummary, cnode);
395 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
396 // System.out.println("---endCombNodeSet is zero");
397 // System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
398 // System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode));
399 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
400 mapIntermediateLoc, 1, locSummary, cnode);
406 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
407 Set<HNode> endNodeSet) {
409 // if an end node is not directly connected to the start node in the SC graph
410 // replace it with a directly connected one which transitively reaches to it.
412 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
414 Set<HNode> newEndNodeSet = new HashSet<HNode>();
415 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
416 HNode endNode = (HNode) iterator.next();
417 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
418 newEndNodeSet.add(endNode);
421 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
422 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
423 newEndNodeSet.add(newEndNode);
427 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
430 return newEndNodeSet;
434 private HNode getDirectlyReachableSCNodeFromEndNode(HierarchyGraph scGraph, HNode startNode,
435 Set<HNode> endNodeSet) {
437 // System.out.println("getDirectlyReachableSCNodeFromEndNode start=" + startNode +
440 Set<HNode> newStartNodeSet = new HashSet<HNode>();
442 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
443 HNode endNode = (HNode) iterator.next();
444 Set<HNode> connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode);
446 for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) {
447 HNode curNode = (HNode) iterator2.next();
448 if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet<HNode>())) {
449 newStartNodeSet.add(curNode);
454 // System.out.println("newStartNodeSet=" + newStartNodeSet);
456 if (newStartNodeSet.size() == 0) {
457 newStartNodeSet.add(startNode);
460 return newStartNodeSet.iterator().next();
463 private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode,
464 HNode curNode, Set<HNode> visited) {
465 // return true if curNode is transitively connected from the startNode
467 boolean isConnected = false;
468 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
469 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
470 HNode in = (HNode) iterator.next();
471 if (in.equals(startNode)) {
475 isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited);
482 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
483 HNode startNode, HNode endNode) {
484 // System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
485 // + " end=" + endNode);
486 Set<HNode> connected = new HashSet<HNode>();
487 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
488 if (connected.size() == 0) {
489 connected.add(endNode);
491 // System.out.println("connected=" + connected);
493 return connected.iterator().next();
496 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
497 HNode startNode, HNode curNode, Set<HNode> connected) {
499 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
500 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
501 HNode inNode = (HNode) iterator.next();
502 if (inNode.equals(startNode)) {
503 connected.add(curNode);
505 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
511 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
512 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
513 int idx, LocationSummary locSummary, HNode curNode) {
515 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
516 // System.out.println("item=" + item);
517 if (!mapIntermediateLoc.containsKey(item)) {
518 // need to create a new intermediate location in the lattice
519 String newLocName = "ILOC" + (LocationInference.locSeed++);
522 above = startNode.getName();
524 int prevIdx = idx - 1;
525 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
526 above = mapIntermediateLoc.get(prevItem);
529 Set<String> belowSet = new HashSet<String>();
530 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
531 HNode endNode = (HNode) iterator.next();
533 if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) {
534 locName = locSummary.getLocationName(endNode.getName());
536 locName = endNode.getName();
538 belowSet.add(locName);
540 lattice.insertNewLocationBetween(above, belowSet, newLocName);
542 mapIntermediateLoc.put(item, newLocName);
545 String locName = mapIntermediateLoc.get(item);
546 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
548 if (curNode.isSharedNode()) {
549 // if the current node is shared location, add a shared location to the lattice later
550 mapSharedNodeToTripleItem.put(curNode, item);
552 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
553 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
554 Descriptor d = (Descriptor) iterator.next();
555 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
557 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
560 System.out.println("-TripleItem normal=" + item);
561 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
562 + " locName=" + locName + " isC=" + curNode.isCombinationNode());
564 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
565 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
566 HNode outNode = (HNode) iterator2.next();
568 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
569 System.out.println("outNode=" + outNode);
570 System.out.println("---incomingHNodeSetToOutNode=" + incomingHNodeSetToOutNode);
572 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
573 if (visited.containsAll(simpleHierarchyGraph.getIncomingNodeSet(outNode))) {
574 visited.add(outNode);
575 int newidx = getCurrentHighestIndex(outNode, idx + 1);
576 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
577 newidx, locSummary, outNode);
578 // recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
579 // idx + 1, locSummary, outNode);
581 updateHighestIndex(outNode, idx + 1);
582 System.out.println("NOT RECUR");
584 } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) {
585 if (needToExpandCombinationNode(desc, outNode)) {
586 System.out.println("NEED TO");
587 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
589 System.out.println("NOT NEED TO");
597 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
598 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
599 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
601 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
603 if (!mapIntermediateLoc.containsKey(item)) {
604 // need to create a new intermediate location in the lattice
607 String newLocName = combinationNodeInSCGraph.getName();
608 mapIntermediateLoc.put(item, newLocName);
610 String newLocName = "ILOC" + (LocationInference.locSeed++);
611 int prevIdx = idx - 1;
612 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
613 above = mapIntermediateLoc.get(prevItem);
615 Set<String> belowSet = new HashSet<String>();
616 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
617 HNode endNode = (HNode) iterator.next();
618 belowSet.add(endNode.getName());
620 lattice.insertNewLocationBetween(above, belowSet, newLocName);
621 mapIntermediateLoc.put(item, newLocName);
627 // Do we need to skip the combination node and assign a shared location to the next node?
628 // if (idx == 1 && curNode.isSharedNode()) {
629 // System.out.println("THE FIRST COMBINATION NODE EXPANSION IS SHARED!");
630 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, mapIntermediateLoc,
631 // idx + 1, locSummary, curNode);
635 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
636 String locName = mapIntermediateLoc.get(item);
637 if (curNode.isSharedNode()) {
638 // if the current node is shared location, add a shared location to the lattice later
639 mapSharedNodeToTripleItem.put(curNode, item);
641 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
642 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
643 Descriptor d = (Descriptor) iterator.next();
644 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
646 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
649 System.out.println("-TripleItem=" + item);
650 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
651 + " locName=" + locName);
653 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
654 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
655 HNode outNode = (HNode) iterator2.next();
656 System.out.println("---recurDFS outNode=" + outNode);
657 System.out.println("---cur combinationNodeInSCGraph=" + combinationNodeInSCGraph);
658 System.out.println("---outNode combinationNodeInSCGraph="
659 + getCombinationNodeInSCGraph(desc, outNode));
661 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
662 if (outNode.isCombinationNode()) {
664 Set<HNode> combineSkeletonNodeSet =
665 simpleHierarchyGraph.getCombineSetByCombinationNode(outNode);
666 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
667 // extract nodes belong to the same combine node
668 Set<HNode> incomingCombinedHNodeSet = new HashSet<HNode>();
669 for (Iterator iterator = incomingHNodeSetToOutNode.iterator(); iterator.hasNext();) {
670 HNode inNode = (HNode) iterator.next();
671 if (combineSkeletonNodeSet.contains(inNode)) {
672 incomingCombinedHNodeSet.add(inNode);
675 System.out.println("-----incomingCombinedHNodeSet=" + incomingCombinedHNodeSet);
677 // check whether the next combination node is different from the current node
678 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
679 if (visited.containsAll(incomingCombinedHNodeSet)) {
680 visited.add(outNode);
681 System.out.println("-------curIdx=" + (idx + 1));
682 int newIdx = getCurrentHighestIndex(outNode, idx + 1);
683 System.out.println("-------newIdx=" + newIdx);
684 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
685 mapIntermediateLoc, newIdx, locSummary, outNode);
686 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
687 // mapIntermediateLoc, idx + 1, locSummary, outNode);
689 updateHighestIndex(outNode, idx + 1);
690 System.out.println("-----NOT RECUR!");
693 if (needToExpandCombinationNode(desc, outNode)) {
694 System.out.println("NEED TO");
695 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
697 System.out.println("NOT NEED TO");
709 private int getCurrentHighestIndex(HNode node, int curIdx) {
710 int recordedIdx = getCurrentHighestIndex(node);
711 if (recordedIdx > curIdx) {
718 private int getCurrentHighestIndex(HNode node) {
719 if (!mapHNodeToHighestIndex.containsKey(node)) {
720 mapHNodeToHighestIndex.put(node, new Integer(-1));
722 return mapHNodeToHighestIndex.get(node).intValue();
725 private void updateHighestIndex(HNode node, int idx) {
726 if (idx > getCurrentHighestIndex(node)) {
727 mapHNodeToHighestIndex.put(node, new Integer(idx));
731 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
732 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
734 if (mapF2LocName.containsKey(F)) {
735 return mapF2LocName.get(F);
738 HNode node = basisSet.getHNode(F);
740 mapF2LocName.put(F, node.getName());
741 return node.getName();
743 if (inputGraph.BASISTOPELEMENT.equals(F)) {
744 return SSJavaAnalysis.BOTTOM;
746 String str = "LOC" + (LocationInference.locSeed++);
747 mapF2LocName.put(F, str);
753 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
754 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
755 Set<Integer> F = iter.next();
756 mapFtoCount.put(F, 0);
760 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
762 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
763 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
765 // initialize COUNT(F) to 0 for all elements of the family
766 resetCount(mapFtoCount, family);
768 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
769 Set<Integer> F = iter.next();
770 Set<HNode> gammaF = family.getGamma(F);
772 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
773 curHNodeSet.removeAll(gammaF);
774 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
776 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
777 Set<Integer> B = (Set<Integer>) iterator.next();
779 Set<Integer> Fprime = new HashSet<Integer>();
784 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
786 // if |gamma(F')|==COUNT(F') + |gamma(F)|
787 int numGammaFprime = family.getGamma(Fprime).size();
788 int countFprime = mapFtoCount.get(Fprime);
789 int numGammaF = family.getGamma(F).size();
790 if (numGammaFprime == (countFprime + numGammaF)) {
791 // ImSucc(F)=IMSucc(F) union F'
792 addImSucc(mapImSucc, F, Fprime);
796 resetCount(mapFtoCount, family);
799 // System.out.println("mapImSucc=" + mapImSucc);
804 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
805 if (!mapImSucc.containsKey(F)) {
806 mapImSucc.put(F, new HashSet<Set<Integer>>());
808 return mapImSucc.get(F);
811 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
812 Set<Integer> Fprime) {
814 if (!mapImSucc.containsKey(F)) {
815 mapImSucc.put(F, new HashSet<Set<Integer>>());
818 mapImSucc.get(F).add(Fprime);
822 private Family generateFamily(BasisSet basisSet) {
824 Family family = new Family();
826 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
827 Set<Integer> B = iterator.next();
829 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
831 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
832 Set<Integer> F = iterator2.next();
834 Set<Integer> Fprime = new HashSet<Integer>();
838 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
839 gammaFPrimeSet.addAll(family.getGamma(F));
840 gammaFPrimeSet.add(basisSet.getHNode(B));
842 if (!family.containsF(Fprime)) {
843 Pair<Set<Integer>, Set<HNode>> pair =
844 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
847 family.updateGammaF(Fprime, gammaFPrimeSet);
851 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
853 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
854 family.addFElement(pair.getFirst());
855 family.updateGammaF(pair.getFirst(), pair.getSecond());
862 private void debug_print(HierarchyGraph inputGraph) {
863 System.out.println("\nBuild Lattice:" + inputGraph.getName());
864 // System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
865 // System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
874 public Identifier(HNode n, int i) {
879 public int hashCode() {
880 return node.hashCode() + idx;
883 public boolean equals(Object obj) {
885 if (obj instanceof Identifier) {
886 Identifier in = (Identifier) obj;
887 if (node.equals(in.node) && idx == in.idx) {
898 public HNode higherNode;
899 public Set<HNode> lowerNodeSet;
901 public boolean isShared;
903 public TripleItem(HNode h, Set<HNode> l, int i) {
910 public void setShared(boolean in) {
914 public boolean isShared() {
918 public int hashCode() {
921 if (higherNode != null) {
922 h = higherNode.hashCode();
929 return h + lowerNodeSet.hashCode() + idx;
932 public boolean equals(Object obj) {
934 if (obj instanceof TripleItem) {
935 TripleItem in = (TripleItem) obj;
936 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
937 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx && isShared == in.isShared()) {
945 public String toString() {
946 String rtr = higherNode + "-" + idx + "->" + lowerNodeSet;