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 +
398 Set<HNode> newStartNodeSet = new HashSet<HNode>();
400 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
401 HNode endNode = (HNode) iterator.next();
402 Set<HNode> connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode);
404 for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) {
405 HNode curNode = (HNode) iterator2.next();
406 if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet<HNode>())) {
407 newStartNodeSet.add(curNode);
412 // System.out.println("newStartNodeSet=" + newStartNodeSet);
414 if (newStartNodeSet.size() == 0) {
415 newStartNodeSet.add(startNode);
418 return newStartNodeSet.iterator().next();
421 private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode,
422 HNode curNode, Set<HNode> visited) {
423 // return true if curNode is transitively connected from the startNode
425 boolean isConnected = false;
426 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
427 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
428 HNode in = (HNode) iterator.next();
429 if (in.equals(startNode)) {
433 isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited);
440 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
441 HNode startNode, HNode endNode) {
442 // System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
443 // + " end=" + endNode);
444 Set<HNode> connected = new HashSet<HNode>();
445 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
446 if (connected.size() == 0) {
447 connected.add(endNode);
449 // System.out.println("connected=" + connected);
451 return connected.iterator().next();
454 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
455 HNode startNode, HNode curNode, Set<HNode> connected) {
457 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
458 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
459 HNode inNode = (HNode) iterator.next();
460 if (inNode.equals(startNode)) {
461 connected.add(curNode);
463 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
469 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
470 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
471 int idx, LocationSummary locSummary, HNode curNode) {
473 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
474 // System.out.println("item=" + item);
475 if (!mapIntermediateLoc.containsKey(item)) {
476 // need to create a new intermediate location in the lattice
477 String newLocName = "ILOC" + (LocationInference.locSeed++);
480 above = startNode.getName();
482 int prevIdx = idx - 1;
483 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
484 above = mapIntermediateLoc.get(prevItem);
487 Set<String> belowSet = new HashSet<String>();
488 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
489 HNode endNode = (HNode) iterator.next();
491 if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) {
492 locName = locSummary.getLocationName(endNode.getName());
494 locName = endNode.getName();
496 belowSet.add(locName);
498 lattice.insertNewLocationBetween(above, belowSet, newLocName);
500 mapIntermediateLoc.put(item, newLocName);
503 String locName = mapIntermediateLoc.get(item);
504 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
506 if (curNode.isSharedNode()) {
507 // if the current node is shared location, add a shared location to the lattice later
508 mapSharedNodeToTripleItem.put(curNode, item);
510 Set<Descriptor> descSet = graph.getDescSetOfNode(curNode);
511 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
512 Descriptor d = (Descriptor) iterator.next();
513 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
515 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
518 // System.out.println("-TripleItem=" + item);
519 // System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
520 // + " locName=" + locName);
522 Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
523 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
524 HNode outNode = (HNode) iterator2.next();
526 Set<HNode> inNodeSetToOutNode = graph.getIncomingNodeSet(outNode);
528 if (visited.containsAll(inNodeSetToOutNode)) {
529 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
530 visited.add(outNode);
531 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
532 idx + 1, locSummary, outNode);
533 } else if (!outNode.isSkeleton() && outNode.isCombinationNode()
534 && !visited.contains(outNode)) {
535 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
543 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
544 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
545 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
547 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
549 if (!mapIntermediateLoc.containsKey(item)) {
550 // need to create a new intermediate location in the lattice
553 String newLocName = combinationNodeInSCGraph.getName();
554 mapIntermediateLoc.put(item, newLocName);
556 String newLocName = "ILOC" + (LocationInference.locSeed++);
557 int prevIdx = idx - 1;
558 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
559 above = mapIntermediateLoc.get(prevItem);
561 Set<String> belowSet = new HashSet<String>();
562 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
563 HNode endNode = (HNode) iterator.next();
564 belowSet.add(endNode.getName());
566 lattice.insertNewLocationBetween(above, belowSet, newLocName);
567 mapIntermediateLoc.put(item, newLocName);
573 // Do we need to skip the combination node and assign a shared location to the next node?
574 // if (idx == 1 && curNode.isSharedNode()) {
575 // System.out.println("THE FIRST COMBINATION NODE EXPANSION IS SHARED!");
576 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, mapIntermediateLoc,
577 // idx + 1, locSummary, curNode);
581 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
582 String locName = mapIntermediateLoc.get(item);
583 if (curNode.isSharedNode()) {
584 // if the current node is shared location, add a shared location to the lattice later
585 mapSharedNodeToTripleItem.put(curNode, item);
587 Set<Descriptor> descSet = graph.getDescSetOfNode(curNode);
588 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
589 Descriptor d = (Descriptor) iterator.next();
590 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
592 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
595 // System.out.println("-TripleItem=" + item);
596 // System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
597 // + " locName=" + locName);
599 Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
600 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
601 HNode outNode = (HNode) iterator2.next();
602 // System.out.println("recurDFS outNode=" + outNode);
603 // System.out.println("---cur combinationNodeInSCGraph=" + combinationNodeInSCGraph);
604 // System.out.println("---outNode combinationNodeInSCGraph="
605 // + getCombinationNodeInSCGraph(desc, outNode));
607 Set<HNode> inNodeSetToOutNode = graph.getIncomingNodeSet(outNode);
609 if (visited.containsAll(inNodeSetToOutNode)) {
610 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
611 if (outNode.isCombinationNode()) {
612 // check whether the next combination node is different from the current node
613 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
614 visited.add(outNode);
615 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
616 mapIntermediateLoc, idx + 1, locSummary, outNode);
618 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
629 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
630 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
632 if (mapF2LocName.containsKey(F)) {
633 return mapF2LocName.get(F);
636 HNode node = basisSet.getHNode(F);
638 mapF2LocName.put(F, node.getName());
639 return node.getName();
641 if (inputGraph.BASISTOPELEMENT.equals(F)) {
642 return SSJavaAnalysis.BOTTOM;
644 String str = "LOC" + (LocationInference.locSeed++);
645 mapF2LocName.put(F, str);
651 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
652 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
653 Set<Integer> F = iter.next();
654 mapFtoCount.put(F, 0);
658 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
660 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
661 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
663 // initialize COUNT(F) to 0 for all elements of the family
664 resetCount(mapFtoCount, family);
666 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
667 Set<Integer> F = iter.next();
668 Set<HNode> gammaF = family.getGamma(F);
670 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
671 curHNodeSet.removeAll(gammaF);
672 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
674 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
675 Set<Integer> B = (Set<Integer>) iterator.next();
677 Set<Integer> Fprime = new HashSet<Integer>();
682 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
684 // if |gamma(F')|==COUNT(F') + |gamma(F)|
685 int numGammaFprime = family.getGamma(Fprime).size();
686 int countFprime = mapFtoCount.get(Fprime);
687 int numGammaF = family.getGamma(F).size();
688 if (numGammaFprime == (countFprime + numGammaF)) {
689 // ImSucc(F)=IMSucc(F) union F'
690 addImSucc(mapImSucc, F, Fprime);
694 resetCount(mapFtoCount, family);
697 // System.out.println("mapImSucc=" + mapImSucc);
702 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
703 if (!mapImSucc.containsKey(F)) {
704 mapImSucc.put(F, new HashSet<Set<Integer>>());
706 return mapImSucc.get(F);
709 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
710 Set<Integer> Fprime) {
712 if (!mapImSucc.containsKey(F)) {
713 mapImSucc.put(F, new HashSet<Set<Integer>>());
716 mapImSucc.get(F).add(Fprime);
720 private Family generateFamily(BasisSet basisSet) {
722 Family family = new Family();
724 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
725 Set<Integer> B = iterator.next();
727 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
729 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
730 Set<Integer> F = iterator2.next();
732 Set<Integer> Fprime = new HashSet<Integer>();
736 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
737 gammaFPrimeSet.addAll(family.getGamma(F));
738 gammaFPrimeSet.add(basisSet.getHNode(B));
740 if (!family.containsF(Fprime)) {
741 Pair<Set<Integer>, Set<HNode>> pair =
742 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
745 family.updateGammaF(Fprime, gammaFPrimeSet);
749 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
751 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
752 family.addFElement(pair.getFirst());
753 family.updateGammaF(pair.getFirst(), pair.getSecond());
760 private void debug_print(HierarchyGraph inputGraph) {
761 System.out.println("\nBuild Lattice:" + inputGraph.getName());
762 // System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
763 // System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
772 public Identifier(HNode n, int i) {
777 public int hashCode() {
778 return node.hashCode() + idx;
781 public boolean equals(Object obj) {
783 if (obj instanceof Identifier) {
784 Identifier in = (Identifier) obj;
785 if (node.equals(in.node) && idx == in.idx) {
796 public HNode higherNode;
797 public Set<HNode> lowerNodeSet;
799 public boolean isShared;
801 public TripleItem(HNode h, Set<HNode> l, int i) {
808 public void setShared(boolean in) {
812 public boolean isShared() {
816 public int hashCode() {
819 if (higherNode != null) {
820 h = higherNode.hashCode();
827 return h + lowerNodeSet.hashCode() + idx;
830 public boolean equals(Object obj) {
832 if (obj instanceof TripleItem) {
833 TripleItem in = (TripleItem) obj;
834 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
835 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx && isShared == in.isShared()) {
843 public String toString() {
844 String rtr = higherNode + "-" + idx + "->" + lowerNodeSet;