1 package Analysis.SSJava;
3 import java.util.HashMap;
4 import java.util.HashSet;
5 import java.util.Iterator;
10 import IR.MethodDescriptor;
13 public class BuildLattice {
15 private LocationInference infer;
16 private Map<HNode, TripleItem> mapSharedNodeToTripleItem;
18 public BuildLattice(LocationInference infer) {
20 this.mapSharedNodeToTripleItem = new HashMap<HNode, TripleItem>();
23 public SSJavaLattice<String> buildLattice(Descriptor desc) {
25 HierarchyGraph inputGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
26 LocationSummary locSummary = infer.getLocationSummary(desc);
28 Set<HNode> nodeSetWithCompositeLocation = new HashSet<HNode>();
29 if (desc instanceof MethodDescriptor) {
30 FlowGraph flowGraph = infer.getFlowGraph((MethodDescriptor) desc);
32 for (Iterator iterator = inputGraph.getNodeSet().iterator(); iterator.hasNext();) {
33 HNode hnode = (HNode) iterator.next();
34 Descriptor hnodeDesc = hnode.getDescriptor();
35 if (hnodeDesc != null) {
36 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
37 descTuple.add(hnodeDesc);
39 if (flowGraph.contains(descTuple)) {
40 FlowNode flowNode = flowGraph.getFlowNode(descTuple);
41 if (flowNode.getCompositeLocation() != null) {
42 nodeSetWithCompositeLocation.add(hnode);
51 BasisSet basisSet = inputGraph.computeBasisSet(nodeSetWithCompositeLocation);
52 debug_print(inputGraph);
54 Family family = generateFamily(basisSet);
55 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = coveringGraph(basisSet, family);
57 SSJavaLattice<String> lattice = buildLattice(basisSet, inputGraph, locSummary, mapImSucc);
62 private SSJavaLattice<String> buildLattice(BasisSet basisSet, HierarchyGraph inputGraph,
63 LocationSummary locSummary, Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
65 SSJavaLattice<String> lattice =
66 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
68 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
70 Set<Set<Integer>> keySet = mapImSucc.keySet();
71 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
72 Set<Integer> higher = (Set<Integer>) iterator.next();
74 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
76 HNode higherNode = inputGraph.getHNode(higherName);
77 if (higherNode != null && higherNode.isSharedNode()) {
78 lattice.addSharedLoc(higherName);
80 Set<Descriptor> descSet = inputGraph.getDescSetOfNode(higherNode);
81 // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet="
83 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
84 Descriptor d = (Descriptor) iterator2.next();
85 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName);
87 // locSummary.addMapHNodeNameToLocationName(higherName, higherName);
89 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
90 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
91 Set<Integer> lower = (Set<Integer>) iterator2.next();
93 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
94 HNode lowerNode = inputGraph.getHNode(lowerName);
95 if (lowerNode != null && lowerNode.isSharedNode()) {
96 lattice.addSharedLoc(lowerName);
99 Set<Descriptor> lowerDescSet = inputGraph.getDescSetOfNode(lowerNode);
100 // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet="
102 for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) {
103 Descriptor d = (Descriptor) iterator3.next();
104 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName);
106 // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
108 if (higher.size() == 0) {
110 lattice.put(lowerName);
112 lattice.addRelationHigherToLower(higherName, lowerName);
122 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
124 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
126 if (nodeFromSimpleGraph.isSkeleton()) {
127 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
130 Set<HNode> combineSkeletonNodeSet =
131 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
132 HNode combinationNodeInSCGraph =
133 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
134 .get(combineSkeletonNodeSet);
136 // Set<HNode> combineSkeletonNodeSet =
137 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
138 // HNode combinationNodeInSCGraph =
139 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
140 return combinationNodeInSCGraph;
143 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
144 SSJavaLattice<String> skeletonLattice) {
146 // perform DFS that starts from each skeleton/combination node and ends by another
147 // skeleton/combination node
149 mapSharedNodeToTripleItem.clear();
151 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
152 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
153 LocationSummary locSummary = infer.getLocationSummary(desc);
155 SSJavaLattice<String> lattice = skeletonLattice.clone();
157 Set<HNode> visited = new HashSet<HNode>();
159 Set<HNode> nodeSet = simpleGraph.getNodeSet();
161 Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
163 System.out.println("*insert=" + desc);
164 System.out.println("***nodeSet=" + nodeSet);
165 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
166 HNode node = (HNode) iterator.next();
167 System.out.println("node=" + node);
169 if (node.isSkeleton() && (!visited.contains(node))) {
172 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
173 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
174 HNode outNode = (HNode) iterator2.next();
176 if (!outNode.isSkeleton()) {
177 if (outNode.isCombinationNode()) {
178 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
180 // we have a node that is neither combination or skeleton node
181 // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode);
182 HNode startNode = scGraph.getCurrentHNode(node);
184 // if (node.getDescriptor() != null) {
185 // // node is a skeleton node and it might be merged into another node in the SC
187 // startNode = scGraph.getHNode(node.getDescriptor());
189 // // this node has already been merged before the SC graph.
193 Set<HNode> endNodeSetFromSimpleGraph =
194 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
196 // System.out.println("endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph
197 // + " from=" + outNode);
198 Set<HNode> endCombNodeSet = new HashSet<HNode>();
199 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
200 HNode endNode = (HNode) iterator3.next();
201 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
203 // System.out.println("endCombNodeSet=" + endCombNodeSet);
204 visited.add(outNode);
205 if (endCombNodeSet.size() > 0) {
206 // follows the straight line up to another skeleton/combination node
207 endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
208 } else if (endCombNodeSet.size() == 0) {
209 // the outNode is (directly/transitively) connected to the bottom node
210 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
211 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
214 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
215 mapIntermediateLoc, 1, locSummary, outNode);
221 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
222 && !visited.contains(node)) {
224 System.out.println("n=" + node);
226 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
227 if (simpleGraph.getIncomingNodeSet(node).size() == 0) {
229 // this node will be directly connected to the TOP location
230 // start adding the following nodes from this node
232 Set<HNode> endNodeSetFromSimpleGraph =
233 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
235 Set<HNode> endCombNodeSet = new HashSet<HNode>();
236 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
237 HNode endNode = (HNode) iterator3.next();
238 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
241 System.out.println("endCombNodeSet=" + endCombNodeSet);
242 HNode startNode = LocationInference.TOPHNODE;
243 visited.add(startNode);
244 if (endCombNodeSet.size() > 0) {
245 // follows the straight line up to another skeleton/combination node
246 // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet);
247 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
248 mapIntermediateLoc, 1, locSummary, node);
256 // add shared locations
257 Set<HNode> sharedNodeSet = mapSharedNodeToTripleItem.keySet();
258 for (Iterator iterator = sharedNodeSet.iterator(); iterator.hasNext();) {
259 HNode sharedNode = (HNode) iterator.next();
260 TripleItem item = mapSharedNodeToTripleItem.get(sharedNode);
261 String nonSharedLocName = mapIntermediateLoc.get(item);
262 System.out.println("sharedNode=" + sharedNode + " locName=" + nonSharedLocName);
265 if (locSummary.getHNodeNameSetByLatticeLoationName(nonSharedLocName) != null
266 && !lattice.isSharedLoc(nonSharedLocName)) {
267 // need to generate a new shared location in the lattice, which is one level lower than the
268 // 'locName' location
269 newLocName = "ILOC" + (LocationInference.locSeed++);
271 // Set<String> aboveElementSet = getAboveElementSet(lattice, locName);
272 Set<String> belowElementSet = new HashSet<String>();
273 belowElementSet.addAll(lattice.get(nonSharedLocName));
275 System.out.println("nonSharedLocName=" + nonSharedLocName + " belowElementSet="
276 + belowElementSet + " newLocName=" + newLocName);
278 lattice.insertNewLocationBetween(nonSharedLocName, belowElementSet, newLocName);
280 newLocName = nonSharedLocName;
283 lattice.addSharedLoc(newLocName);
284 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
285 Set<Descriptor> descSet = graph.getDescSetOfNode(sharedNode);
286 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
287 Descriptor d = (Descriptor) iterator2.next();
288 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), newLocName);
290 locSummary.addMapHNodeNameToLocationName(sharedNode.getName(), newLocName);
298 private Set<String> getAboveElementSet(SSJavaLattice<String> lattice, String loc) {
300 Set<String> aboveSet = new HashSet<String>();
302 Map<String, Set<String>> latticeMap = lattice.getTable();
303 Set<String> keySet = latticeMap.keySet();
304 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
305 String key = (String) iterator.next();
306 if (latticeMap.get(key).contains(loc)) {
314 private void expandCombinationNode(Descriptor desc, SSJavaLattice<String> lattice,
315 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
318 System.out.println("expandCombinationNode=" + cnode);
319 // expand the combination node 'outNode'
320 // here we need to expand the corresponding combination location in the lattice
321 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
323 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
325 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
327 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
329 Set<HNode> combinationNodeSet =
330 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
332 // System.out.println("combinationNodeSet=" + combinationNodeSet);
334 Set<HNode> endNodeSetFromSimpleGraph =
335 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
336 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
337 Set<HNode> endCombNodeSet = new HashSet<HNode>();
338 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
339 HNode endNode = (HNode) iterator3.next();
340 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
344 // follows the straight line up to another skeleton/combination node
345 if (endCombNodeSet.size() > 0) {
346 System.out.println("---endCombNodeSet=" + endCombNodeSet);
348 removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
350 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
351 mapIntermediateLoc, 1, locSummary, cnode);
353 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
354 // System.out.println("---endCombNodeSet is zero");
355 // System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
356 // System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode));
357 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
358 mapIntermediateLoc, 1, locSummary, cnode);
364 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
365 Set<HNode> endNodeSet) {
367 // if an end node is not directly connected to the start node in the SC graph
368 // replace it with a directly connected one which transitively reaches to it.
370 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
372 Set<HNode> newEndNodeSet = new HashSet<HNode>();
373 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
374 HNode endNode = (HNode) iterator.next();
375 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
376 newEndNodeSet.add(endNode);
379 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
380 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
381 newEndNodeSet.add(newEndNode);
385 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
388 return newEndNodeSet;
392 private HNode getDirectlyReachableSCNodeFromEndNode(HierarchyGraph scGraph, HNode startNode,
393 Set<HNode> endNodeSet) {
395 System.out.println("getDirectlyReachableSCNodeFromEndNode start=" + startNode + " endNodeSet="
397 Set<HNode> newStartNodeSet = new HashSet<HNode>();
399 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
400 HNode endNode = (HNode) iterator.next();
401 Set<HNode> connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode);
403 for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) {
404 HNode curNode = (HNode) iterator2.next();
405 if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet<HNode>())) {
406 newStartNodeSet.add(curNode);
411 System.out.println("newStartNodeSet=" + newStartNodeSet);
413 if (newStartNodeSet.size() == 0) {
414 newStartNodeSet.add(startNode);
417 return newStartNodeSet.iterator().next();
420 private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode,
421 HNode curNode, Set<HNode> visited) {
422 // return true if curNode is transitively connected from the startNode
424 boolean isConnected = false;
425 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
426 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
427 HNode in = (HNode) iterator.next();
428 if (in.equals(startNode)) {
432 isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited);
439 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
440 HNode startNode, HNode endNode) {
441 System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
442 + " end=" + endNode);
443 Set<HNode> connected = new HashSet<HNode>();
444 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
445 if (connected.size() == 0) {
446 connected.add(endNode);
448 System.out.println("connected=" + connected);
450 return connected.iterator().next();
453 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
454 HNode startNode, HNode curNode, Set<HNode> connected) {
456 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
457 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
458 HNode inNode = (HNode) iterator.next();
459 if (inNode.equals(startNode)) {
460 connected.add(curNode);
462 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
468 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
469 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
470 int idx, LocationSummary locSummary, HNode curNode) {
472 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
473 // System.out.println("item=" + item);
474 if (!mapIntermediateLoc.containsKey(item)) {
475 // need to create a new intermediate location in the lattice
476 String newLocName = "ILOC" + (LocationInference.locSeed++);
479 above = startNode.getName();
481 int prevIdx = idx - 1;
482 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
483 above = mapIntermediateLoc.get(prevItem);
486 Set<String> belowSet = new HashSet<String>();
487 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
488 HNode endNode = (HNode) iterator.next();
490 if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) {
491 locName = locSummary.getLocationName(endNode.getName());
493 locName = endNode.getName();
495 belowSet.add(locName);
497 lattice.insertNewLocationBetween(above, belowSet, newLocName);
499 mapIntermediateLoc.put(item, newLocName);
502 String locName = mapIntermediateLoc.get(item);
503 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
505 if (curNode.isSharedNode()) {
506 // if the current node is shared location, add a shared location to the lattice later
507 mapSharedNodeToTripleItem.put(curNode, item);
509 Set<Descriptor> descSet = graph.getDescSetOfNode(curNode);
510 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
511 Descriptor d = (Descriptor) iterator.next();
512 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
514 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
517 System.out.println("-TripleItem=" + item);
518 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
519 + " locName=" + locName);
521 Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
522 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
523 HNode outNode = (HNode) iterator2.next();
524 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
525 visited.add(outNode);
526 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
527 idx + 1, locSummary, outNode);
528 } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) {
529 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
535 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
536 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
537 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
539 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
541 if (!mapIntermediateLoc.containsKey(item)) {
542 // need to create a new intermediate location in the lattice
545 String newLocName = combinationNodeInSCGraph.getName();
546 mapIntermediateLoc.put(item, newLocName);
548 String newLocName = "ILOC" + (LocationInference.locSeed++);
549 int prevIdx = idx - 1;
550 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
551 above = mapIntermediateLoc.get(prevItem);
553 Set<String> belowSet = new HashSet<String>();
554 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
555 HNode endNode = (HNode) iterator.next();
556 belowSet.add(endNode.getName());
558 lattice.insertNewLocationBetween(above, belowSet, newLocName);
559 mapIntermediateLoc.put(item, newLocName);
565 // Do we need to skip the combination node and assign a shared location to the next node?
566 // if (idx == 1 && curNode.isSharedNode()) {
567 // System.out.println("THE FIRST COMBINATION NODE EXPANSION IS SHARED!");
568 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, mapIntermediateLoc,
569 // idx + 1, locSummary, curNode);
573 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
574 String locName = mapIntermediateLoc.get(item);
575 if (curNode.isSharedNode()) {
576 // if the current node is shared location, add a shared location to the lattice later
577 mapSharedNodeToTripleItem.put(curNode, item);
579 Set<Descriptor> descSet = graph.getDescSetOfNode(curNode);
580 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
581 Descriptor d = (Descriptor) iterator.next();
582 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
584 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
587 System.out.println("-TripleItem=" + item);
588 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
589 + " locName=" + locName);
591 Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
592 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
593 HNode outNode = (HNode) iterator2.next();
594 // System.out.println("recurDFS outNode=" + outNode);
595 // System.out.println("---cur combinationNodeInSCGraph=" + combinationNodeInSCGraph);
596 // System.out.println("---outNode combinationNodeInSCGraph="
597 // + getCombinationNodeInSCGraph(desc, outNode));
598 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
599 if (outNode.isCombinationNode()) {
600 // check whether the next combination node is different from the current node
601 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
602 visited.add(outNode);
603 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
604 mapIntermediateLoc, idx + 1, locSummary, outNode);
606 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
615 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
616 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
618 if (mapF2LocName.containsKey(F)) {
619 return mapF2LocName.get(F);
622 HNode node = basisSet.getHNode(F);
624 mapF2LocName.put(F, node.getName());
625 return node.getName();
627 if (inputGraph.BASISTOPELEMENT.equals(F)) {
628 return SSJavaAnalysis.BOTTOM;
630 String str = "LOC" + (LocationInference.locSeed++);
631 mapF2LocName.put(F, str);
637 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
638 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
639 Set<Integer> F = iter.next();
640 mapFtoCount.put(F, 0);
644 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
646 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
647 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
649 // initialize COUNT(F) to 0 for all elements of the family
650 resetCount(mapFtoCount, family);
652 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
653 Set<Integer> F = iter.next();
654 Set<HNode> gammaF = family.getGamma(F);
656 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
657 curHNodeSet.removeAll(gammaF);
658 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
660 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
661 Set<Integer> B = (Set<Integer>) iterator.next();
663 Set<Integer> Fprime = new HashSet<Integer>();
668 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
670 // if |gamma(F')|==COUNT(F') + |gamma(F)|
671 int numGammaFprime = family.getGamma(Fprime).size();
672 int countFprime = mapFtoCount.get(Fprime);
673 int numGammaF = family.getGamma(F).size();
674 if (numGammaFprime == (countFprime + numGammaF)) {
675 // ImSucc(F)=IMSucc(F) union F'
676 addImSucc(mapImSucc, F, Fprime);
680 resetCount(mapFtoCount, family);
683 // System.out.println("mapImSucc=" + mapImSucc);
688 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
689 if (!mapImSucc.containsKey(F)) {
690 mapImSucc.put(F, new HashSet<Set<Integer>>());
692 return mapImSucc.get(F);
695 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
696 Set<Integer> Fprime) {
698 if (!mapImSucc.containsKey(F)) {
699 mapImSucc.put(F, new HashSet<Set<Integer>>());
702 mapImSucc.get(F).add(Fprime);
706 private Family generateFamily(BasisSet basisSet) {
708 Family family = new Family();
710 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
711 Set<Integer> B = iterator.next();
713 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
715 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
716 Set<Integer> F = iterator2.next();
718 Set<Integer> Fprime = new HashSet<Integer>();
722 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
723 gammaFPrimeSet.addAll(family.getGamma(F));
724 gammaFPrimeSet.add(basisSet.getHNode(B));
726 if (!family.containsF(Fprime)) {
727 Pair<Set<Integer>, Set<HNode>> pair =
728 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
731 family.updateGammaF(Fprime, gammaFPrimeSet);
735 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
737 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
738 family.addFElement(pair.getFirst());
739 family.updateGammaF(pair.getFirst(), pair.getSecond());
746 private void debug_print(HierarchyGraph inputGraph) {
747 System.out.println("\nBuild Lattice:" + inputGraph.getName());
748 // System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
749 // System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
758 public Identifier(HNode n, int i) {
763 public int hashCode() {
764 return node.hashCode() + idx;
767 public boolean equals(Object obj) {
769 if (obj instanceof Identifier) {
770 Identifier in = (Identifier) obj;
771 if (node.equals(in.node) && idx == in.idx) {
782 public HNode higherNode;
783 public Set<HNode> lowerNodeSet;
785 public boolean isShared;
787 public TripleItem(HNode h, Set<HNode> l, int i) {
794 public void setShared(boolean in) {
798 public boolean isShared() {
802 public int hashCode() {
805 if (higherNode != null) {
806 h = higherNode.hashCode();
813 return h + lowerNodeSet.hashCode() + idx;
816 public boolean equals(Object obj) {
818 if (obj instanceof TripleItem) {
819 TripleItem in = (TripleItem) obj;
820 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
821 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx && isShared == in.isShared()) {
829 public String toString() {
830 String rtr = higherNode + "-" + idx + "->" + lowerNodeSet;