1 package Analysis.SSJava;
3 import java.util.HashMap;
4 import java.util.HashSet;
5 import java.util.Iterator;
9 import IR.ClassDescriptor;
11 import IR.MethodDescriptor;
12 import IR.NameDescriptor;
15 public class BuildLattice {
17 private LocationInference infer;
18 private Map<HNode, TripleItem> mapSharedNodeToTripleItem;
19 private Map<HNode, Integer> mapHNodeToHighestIndex;
21 private Map<Descriptor, Map<TripleItem, String>> mapDescToIntermediateLocMap;
23 private Map<Pair<HNode, HNode>, Integer> mapItemToHighestIndex;
25 private Map<SSJavaLattice<String>, Set<String>> mapLatticeToLocalLocSet;
27 public BuildLattice(LocationInference infer) {
29 this.mapSharedNodeToTripleItem = new HashMap<HNode, TripleItem>();
30 this.mapHNodeToHighestIndex = new HashMap<HNode, Integer>();
31 this.mapItemToHighestIndex = new HashMap<Pair<HNode, HNode>, Integer>();
32 this.mapDescToIntermediateLocMap = new HashMap<Descriptor, Map<TripleItem, String>>();
33 this.mapLatticeToLocalLocSet = new HashMap<SSJavaLattice<String>, Set<String>>();
36 public SSJavaLattice<String> buildLattice(Descriptor desc) {
38 HierarchyGraph inputGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
39 LocationSummary locSummary = infer.getLocationSummary(desc);
41 HierarchyGraph naiveGraph = infer.getSimpleHierarchyGraph(desc);
43 // I don't think we need to keep the below if statement anymore
44 // because hierarchy graph does not have any composite location
45 Set<HNode> nodeSetWithCompositeLocation = new HashSet<HNode>();
46 if (desc instanceof MethodDescriptor) {
47 FlowGraph flowGraph = infer.getFlowGraph((MethodDescriptor) desc);
49 for (Iterator iterator = inputGraph.getNodeSet().iterator(); iterator.hasNext();) {
50 HNode hnode = (HNode) iterator.next();
51 Descriptor hnodeDesc = hnode.getDescriptor();
52 if (hnodeDesc != null) {
53 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
54 descTuple.add(hnodeDesc);
56 if (flowGraph.contains(descTuple)) {
57 FlowNode flowNode = flowGraph.getFlowNode(descTuple);
58 if (flowNode.getCompositeLocation() != null) {
59 nodeSetWithCompositeLocation.add(hnode);
68 // /////////////////////////////////////////////////////////////////////////////////////
69 // lattice generation for the native approach
71 if (infer.state.SSJAVA_INFER_NAIVE_WRITEDOTS) {
72 BasisSet naiveBasisSet = naiveGraph.computeBasisSet(nodeSetWithCompositeLocation);
74 Family naiveFamily = generateFamily(naiveBasisSet);
75 Map<Set<Integer>, Set<Set<Integer>>> naive_mapImSucc =
76 coveringGraph(naiveBasisSet, naiveFamily);
78 SSJavaLattice<String> naive_lattice =
79 buildLattice(desc, naiveBasisSet, naiveGraph, null, naive_mapImSucc);
80 LocationInference.numLocationsNaive += naive_lattice.getKeySet().size();
81 infer.addNaiveLattice(desc, naive_lattice);
84 // /////////////////////////////////////////////////////////////////////////////////////
86 // lattice generation for the proposed approach
87 BasisSet basisSet = inputGraph.computeBasisSet(nodeSetWithCompositeLocation);
88 // debug_print(inputGraph);
90 Family family = generateFamily(basisSet);
91 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = coveringGraph(basisSet, family);
93 SSJavaLattice<String> lattice = buildLattice(desc, basisSet, inputGraph, locSummary, mapImSucc);
98 public void setIntermediateLocMap(Descriptor desc, Map<TripleItem, String> map) {
99 mapDescToIntermediateLocMap.put(desc, map);
102 public Map<TripleItem, String> getIntermediateLocMap(Descriptor desc) {
103 if (!mapDescToIntermediateLocMap.containsKey(desc)) {
104 mapDescToIntermediateLocMap.put(desc, new HashMap<TripleItem, String>());
106 return mapDescToIntermediateLocMap.get(desc);
109 private Descriptor getParent(Descriptor desc) {
110 if (desc instanceof MethodDescriptor) {
111 MethodDescriptor md = (MethodDescriptor) desc;
112 ClassDescriptor cd = md.getClassDesc();
113 return infer.getParentMethodDesc(cd, md);
115 return ((ClassDescriptor) desc).getSuperDesc();
119 private SSJavaLattice<String> buildLattice(Descriptor desc, BasisSet basisSet,
120 HierarchyGraph inputGraph, LocationSummary locSummary,
121 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
123 System.out.println("\nBuild Lattice:" + inputGraph.getName());
125 SSJavaLattice<String> lattice =
126 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
128 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
130 Set<Set<Integer>> keySet = mapImSucc.keySet();
131 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
132 Set<Integer> higher = (Set<Integer>) iterator.next();
134 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
136 HNode higherNode = inputGraph.getHNode(higherName);
138 if (higherNode == null) {
139 NameDescriptor d = new NameDescriptor(higherName);
140 higherNode = inputGraph.getHNode(d);
141 higherNode.setSkeleton(true);
144 if (higherNode != null && higherNode.isSharedNode()) {
145 lattice.addSharedLoc(higherName);
147 Set<Descriptor> descSet = inputGraph.getDescSetOfNode(higherNode);
148 // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet="
151 if (locSummary != null) {
152 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
153 Descriptor d = (Descriptor) iterator2.next();
154 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName);
158 // locSummary.addMapHNodeNameToLocationName(higherName, higherName);
160 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
161 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
162 Set<Integer> lower = (Set<Integer>) iterator2.next();
164 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
165 HNode lowerNode = inputGraph.getHNode(lowerName);
167 if (lowerNode == null && !lowerName.equals(SSJavaAnalysis.BOTTOM)) {
168 NameDescriptor d = new NameDescriptor(lowerName);
169 lowerNode = inputGraph.getHNode(d);
170 lowerNode.setSkeleton(true);
173 if (lowerNode != null && !inputGraph.isDirectlyConnectedTo(higherNode, lowerNode)) {
174 inputGraph.addEdge(higherNode, lowerNode);
177 if (lowerNode != null && lowerNode.isSharedNode()) {
178 lattice.addSharedLoc(lowerName);
181 Set<Descriptor> lowerDescSet = inputGraph.getDescSetOfNode(lowerNode);
182 // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet="
184 if (locSummary != null) {
185 for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) {
186 Descriptor d = (Descriptor) iterator3.next();
187 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName);
190 // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
192 if (higher.size() == 0) {
194 lattice.put(lowerName);
196 lattice.addRelationHigherToLower(higherName, lowerName);
203 inputGraph.removeRedundantEdges();
207 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
209 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
211 if (nodeFromSimpleGraph.isSkeleton()) {
212 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
215 Set<HNode> combineSkeletonNodeSet =
216 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
217 HNode combinationNodeInSCGraph =
218 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
219 .get(combineSkeletonNodeSet);
221 // Set<HNode> combineSkeletonNodeSet =
222 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
223 // HNode combinationNodeInSCGraph =
224 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
225 return combinationNodeInSCGraph;
228 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
229 SSJavaLattice<String> skeletonLattice) {
231 SSJavaLattice<String> lattice = skeletonLattice.clone();
232 LocationSummary locSummary = infer.getLocationSummary(desc);
234 Descriptor parentDesc = getParent(desc);
235 if (parentDesc != null) {
236 SSJavaLattice<String> parentLattice = infer.getLattice(parentDesc);
238 Map<String, Set<String>> parentMap = parentLattice.getTable();
239 Set<String> parentKeySet = parentMap.keySet();
240 for (Iterator iterator = parentKeySet.iterator(); iterator.hasNext();) {
241 String parentKey = (String) iterator.next();
242 Set<String> parentValueSet = parentMap.get(parentKey);
243 for (Iterator iterator2 = parentValueSet.iterator(); iterator2.hasNext();) {
244 String value = (String) iterator2.next();
245 lattice.put(parentKey, value);
249 Set<String> parentSharedLocSet = parentLattice.getSharedLocSet();
250 for (Iterator iterator = parentSharedLocSet.iterator(); iterator.hasNext();) {
251 String parentSharedLoc = (String) iterator.next();
252 lattice.addSharedLoc(parentSharedLoc);
256 HierarchyGraph hierarchyGraph = infer.getSimpleHierarchyGraph(desc);
257 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
259 Set<HNode> hierarchyGraphNodeSet = hierarchyGraph.getNodeSet();
260 for (Iterator iterator = hierarchyGraphNodeSet.iterator(); iterator.hasNext();) {
261 HNode hNode = (HNode) iterator.next();
262 if (!hNode.isSkeleton()) {
263 // here we need to insert an intermediate node for the hNode
264 System.out.println("\n#local node=" + hNode);
266 // 1) find the lowest node m in the lattice that is above hnode in the lattice
267 // 2) count the number of non-shared nodes d between the hnode and the node m
268 // int numNonSharedNodes;
272 if (hNode.isDirectCombinationNode()) {
273 // this node itself is the lowest node m. it is the first node of the chain
274 Set<HNode> combineSet = hierarchyGraph.getCombineSetByCombinationNode(hNode);
276 System.out.println(" # direct combine node::combineSkeletonNodeSet=" + combineSet);
278 SCNode = scGraph.getCombinationNode(combineSet);
279 // numNonSharedNodes = -1;
283 Set<HNode> aboveSet = new HashSet<HNode>();
284 if (hNode.isCombinationNode()) {
285 // the current node is a combination node
286 Set<HNode> combineSkeletonNodeSet =
287 hierarchyGraph.getCombineSetByCombinationNode(hNode);
288 System.out.println(" combineSkeletonNodeSet=" + combineSkeletonNodeSet
289 + " combinationNode=" + scGraph.getCombinationNode(combineSkeletonNodeSet));
291 scGraph.getCombinationNode(combineSkeletonNodeSet);
293 System.out.println(" firstnodeOfSimpleGraph="
294 + hierarchyGraph.getFirstNodeOfCombinationNodeChainSet(combineSkeletonNodeSet));
295 aboveSet.addAll(hierarchyGraph
296 .getFirstNodeOfCombinationNodeChainSet(combineSkeletonNodeSet));
298 SCNode = scGraph.getCombinationNode(combineSkeletonNodeSet);
301 // the current node is not a combination node
302 // there is only one parent node which should be skeleton node.
304 System.out.println(" hierarchyGraph.getSkeleteNodeSetReachTo(" + hNode + ")="
305 + hierarchyGraph.getSkeleteNodeSetReachTo(hNode));
306 aboveSet.addAll(hierarchyGraph.getSkeleteNodeSetReachTo(hNode));
307 System.out.println(" aboveset of " + hNode + "=" + aboveSet);
308 // assert aboveSet.size() == 1;
309 SCNode = aboveSet.iterator().next();
312 // update above set w.r.t the hierarchy graph with SC nodes
313 // because the skeleton nodes in the origianl hierarchy graph may merged to a new node
314 Set<HNode> endSet = new HashSet<HNode>();
315 for (Iterator iterator2 = aboveSet.iterator(); iterator2.hasNext();) {
316 HNode aboveNode = (HNode) iterator2.next();
317 endSet.add(scGraph.getCurrentHNode(aboveNode));
319 dist = hierarchyGraph.computeDistance(hNode, endSet);
320 System.out.println("##### " + hNode + "::dist=" + dist);
322 // numNonSharedNodes = hierarchyGraph.countNonSharedNode(hNode, endSet);
324 System.out.println(" COUNT-RESULT::node=" + hNode + " above=" + endSet + " distance="
325 + dist + " SCNode=" + SCNode);
328 // 3) convert the node m into a chain of nodes with the last node in the chain having m’s
330 Set<HNode> outgoingSCNodeSet = scGraph.getOutgoingNodeSet(SCNode);
331 System.out.println(" outgoing scnode set from " + SCNode + "=" + outgoingSCNodeSet);
333 // convert hnodes to location names
334 String startLocName = locSummary.getLocationName(SCNode.getName());
335 Set<String> outgoingLocNameSet = new HashSet<String>();
336 for (Iterator iterator2 = outgoingSCNodeSet.iterator(); iterator2.hasNext();) {
337 HNode outSCNode = (HNode) iterator2.next();
338 String locName = locSummary.getLocationName(outSCNode.getName());
339 if (!locName.equals(outSCNode.getName())) {
340 System.out.println(" outSCNode=" + outSCNode + " -> locName="
343 outgoingLocNameSet.add(locName);
346 if (outgoingLocNameSet.isEmpty()) {
347 outgoingLocNameSet.add(lattice.getBottomItem());
350 // 4) If hnode is not a shared location, check if there already exists a local variable
351 // node that has distance d below m along this chain. If such a node
352 // does not exist, insert it.
354 getNewLocation(lattice, startLocName, outgoingLocNameSet, dist, hNode.isSharedNode());
355 System.out.println(" ###hNode=" + hNode + "---->locName=" + locName);
356 locSummary.addMapHNodeNameToLocationName(hNode.getName(), locName);
364 private void addLocalLocation(SSJavaLattice<String> lattice, String localLoc) {
365 if (!mapLatticeToLocalLocSet.containsKey(lattice)) {
366 mapLatticeToLocalLocSet.put(lattice, new HashSet<String>());
368 mapLatticeToLocalLocSet.get(lattice).add(localLoc);
371 private boolean isLocalLocation(SSJavaLattice<String> lattice, String localLoc) {
372 if (mapLatticeToLocalLocSet.containsKey(lattice)) {
373 return mapLatticeToLocalLocSet.get(lattice).contains(localLoc);
378 public String getNewLocation(SSJavaLattice<String> lattice, String start, Set<String> endSet,
379 int dist, boolean isShared) {
380 System.out.println(" #GETNEWLOCATION:: start=" + start + " endSet=" + endSet + " dist="
381 + dist + " isShared=" + isShared);
384 // // if the node is a shared one, check if the next node is shared
385 // // if not, need to insert a new shared node
386 // return recur_getNewLocation(lattice, start, endSet, dist + 1, isShared);
392 return recur_getNewLocation(lattice, start, start, endSet, dist, isShared);
395 private String recur_getNewLocation(SSJavaLattice<String> lattice, String start, String cur,
396 Set<String> endSet, int dist, boolean isShared) {
398 System.out.println(" recur_getNewLocation cur=" + cur + " dist=" + dist);
402 // first check if there already exists a non-shared node at distance d
403 if (!isLocalLocation(lattice, cur) && !start.equals(cur)) {
404 // if not, need to insert a new local location at this point
405 System.out.println("if not, need to insert a new local location at this point");
406 String newLocName = "ILOC" + (LocationInference.locSeed++);
407 Set<String> lowerSet = new HashSet<String>();
408 lowerSet.addAll(lattice.get(cur));
409 lattice.insertNewLocationBetween(cur, lowerSet, newLocName);
410 addLocalLocation(lattice, newLocName);
412 // assign the new local location to cur
416 Set<String> connectedSet = lattice.get(cur);
417 if (connectedSet == null) {
418 connectedSet = new HashSet<String>();
420 System.out.println("cur=" + cur + " connectedSet=" + connectedSet);
422 // check if there already exists a shared node that has distance d + 1 on the chain
423 boolean needToInsertSharedNode = false;
424 if (connectedSet.equals(endSet)) {
425 needToInsertSharedNode = true;
427 // in this case, the current node is in the middle of the chain
428 assert connectedSet.size() == 1;
429 String below = connectedSet.iterator().next();
430 if (lattice.isSharedLoc(below)) {
433 needToInsertSharedNode = true;
437 if (needToInsertSharedNode) {
438 // no shared local location at d+1, need to insert it!
439 String newSharedLocName = "ILOC" + (LocationInference.locSeed++);
440 Set<String> lowerSet = new HashSet<String>();
441 lowerSet.addAll(connectedSet);
442 lattice.insertNewLocationBetween(cur, lowerSet, newSharedLocName);
443 lattice.addSharedLoc(newSharedLocName);
444 addLocalLocation(lattice, newSharedLocName);
445 System.out.println(" INSERT NEW SHARED LOC=" + newSharedLocName);
446 cur = newSharedLocName;
454 // if the node is not shared, check if a node at distance d is a local or combination node
455 // Set<String> connectedSet = lattice.get(cur);
456 // if (connectedSet == null) {
457 // connectedSet = new HashSet<String>();
460 // .println("if the node is not shared, check if a node at distance d is a local or combination node connectedSet="
462 // // if (!start.equals(cur) && (cur.equals(lattice.getTopItem()) ||
463 // connectedSet.equals(endSet))) {
464 // // if not, need to insert a new local location at this point
465 // System.out.println("NEED TO INSERT A NEW LOCAL LOC connectedSet=" + connectedSet);
466 // String newLocName = "ILOC" + (LocationInference.locSeed++);
467 // Set<String> lowerSet = new HashSet<String>();
468 // lowerSet.addAll(connectedSet);
469 // lattice.insertNewLocationBetween(cur, lowerSet, newLocName);
470 // addLocalLocation(lattice, newLocName);
471 // return newLocName;
478 Set<String> connectedSet = lattice.get(cur);
479 if (connectedSet == null) {
480 connectedSet = new HashSet<String>();
483 System.out.println("cur=" + cur + " connected set=" + connectedSet);
484 if (cur.equals(lattice.getTopItem()) || connectedSet.equals(endSet)) {
485 // if not, need to insert a new local location at this point
486 System.out.println("NEED TO INSERT A NEW LOCAL LOC FOR NEXT connectedSet=" + connectedSet);
487 String newLocName = "ILOC" + (LocationInference.locSeed++);
488 Set<String> lowerSet = new HashSet<String>();
489 lowerSet.addAll(connectedSet);
490 lattice.insertNewLocationBetween(cur, lowerSet, newLocName);
491 addLocalLocation(lattice, newLocName);
494 // in this case, the current node is in the middle of the chain
495 assert connectedSet.size() == 1;
496 cur = connectedSet.iterator().next();
499 if (!lattice.isSharedLoc(cur)) {
502 return recur_getNewLocation(lattice, start, cur, endSet, dist, isShared);
506 public String getNewLocation2(SSJavaLattice<String> lattice, String start, Set<String> endSet,
507 int dist, boolean isShared) {
508 System.out.println(" #GETNEWLOCATION:: start=" + start + " endSet=" + endSet + " dist="
509 + dist + " isShared=" + isShared);
512 // if the node is a shared one, check if the next node is shared
513 // if not, need to insert a new shared node
514 return recur_getNewLocation2(lattice, start, endSet, dist + 1, isShared);
520 return recur_getNewLocation2(lattice, start, endSet, dist, isShared);
523 private String recur_getNewLocation2(SSJavaLattice<String> lattice, String cur,
524 Set<String> endSet, int dist, boolean isShared) {
525 Set<String> connectedSet = lattice.get(cur);
526 if (connectedSet == null) {
527 connectedSet = new HashSet<String>();
530 System.out.println(" recur_getNewLocation::cur=" + cur + " dist=" + dist
531 + " connectedSet=" + connectedSet + " endSet=" + endSet);
533 if (dist == 0 && isShared) {
534 // if the node is shared,
535 // check if there already exists a shared node that has distance d + 1 on the chain
536 if ((cur.equals(lattice.getTopItem()) && connectedSet.containsAll(endSet))
537 || connectedSet.equals(endSet)) {
538 // need to insert a new shared location
539 // it is done after this if statement
541 assert connectedSet.size() == 1;
542 String below = connectedSet.iterator().next();
543 if (lattice.isSharedLoc(below)) {
548 // need to insert a new shared location
549 Set<String> newChildSet = new HashSet<String>();
550 newChildSet.addAll(connectedSet);
552 String newLocName = "ILOC" + (LocationInference.locSeed++);
553 for (Iterator iterator = newChildSet.iterator(); iterator.hasNext();) {
554 String outNode = (String) iterator.next();
555 lattice.put(newLocName, outNode);
557 lattice.get(cur).clear();
558 lattice.put(cur, newLocName);
560 System.out.println(" INSERT NEW SHARED NODE=" + newLocName + " above=" + cur
561 + " below=" + lattice.get(newLocName));
563 lattice.addSharedLoc(newLocName);
571 if (cur.equals(lattice.getTopItem()) || connectedSet.equals(endSet) /* || endSet.isEmpty() */) {
573 // if ( (cur.equals(lattice.getTopItem()) && connectedSet.containsAll(endSet))
574 // || connectedSet.equals(endSet)) {
576 // need to insert a new location
577 String newLocName = "ILOC" + (LocationInference.locSeed++);
578 connectedSet.clear();
579 lattice.put(cur, newLocName);
581 System.out.println("#INSERT NEW RELATION cur=" + cur + " newLocName=" + newLocName + "::"
584 for (Iterator iterator = endSet.iterator(); iterator.hasNext();) {
585 String endNode = (String) iterator.next();
586 lattice.put(newLocName, endNode);
590 System.out.println(" INSERT NEW NODE=" + newLocName + " above=" + cur + " below="
593 assert connectedSet.size() == 1;
594 next = connectedSet.iterator().next();
595 if (lattice.isSharedLoc(next)) {
596 return recur_getNewLocation2(lattice, next, endSet, dist, isShared);
599 System.out.println(" next=" + next);
604 if (!lattice.isSharedLoc(next)) {
607 return recur_getNewLocation2(lattice, next, endSet, dist, isShared);
612 public SSJavaLattice<String> insertIntermediateNodesToStraightLine2(Descriptor desc,
613 SSJavaLattice<String> skeletonLattice) {
614 // copy nodes/edges from the parent method/class if possible
615 SSJavaLattice<String> lattice = skeletonLattice.clone();
617 Descriptor parentDesc = getParent(desc);
618 if (parentDesc != null) {
619 SSJavaLattice<String> parentLattice = infer.getLattice(parentDesc);
621 Map<String, Set<String>> parentMap = parentLattice.getTable();
622 Set<String> parentKeySet = parentMap.keySet();
623 for (Iterator iterator = parentKeySet.iterator(); iterator.hasNext();) {
624 String parentKey = (String) iterator.next();
625 Set<String> parentValueSet = parentMap.get(parentKey);
626 for (Iterator iterator2 = parentValueSet.iterator(); iterator2.hasNext();) {
627 String value = (String) iterator2.next();
628 lattice.put(parentKey, value);
632 Set<String> parentSharedLocSet = parentLattice.getSharedLocSet();
633 for (Iterator iterator = parentSharedLocSet.iterator(); iterator.hasNext();) {
634 String parentSharedLoc = (String) iterator.next();
635 lattice.addSharedLoc(parentSharedLoc);
641 // perform DFS that starts from each skeleton/combination node and ends by another
642 // skeleton/combination node
644 mapSharedNodeToTripleItem.clear();
646 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
647 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
648 LocationSummary locSummary = infer.getLocationSummary(desc);
650 Set<HNode> visited = new HashSet<HNode>();
652 Set<HNode> nodeSet = simpleGraph.getNodeSet();
654 Map<TripleItem, String> mapIntermediateLoc = getIntermediateLocMap(desc);
655 // Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
657 // System.out.println("*insert=" + desc);
658 // System.out.println("***nodeSet=" + nodeSet);
659 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
660 HNode node = (HNode) iterator.next();
661 System.out.println("node=" + node);
663 if (node.isSkeleton() && (!visited.contains(node))) {
666 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
667 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
668 HNode outNode = (HNode) iterator2.next();
670 if (!outNode.isSkeleton()) {
671 if (outNode.isCombinationNode()) {
672 if (visited.containsAll(simpleGraph.getIncomingNodeSet(outNode))) {
673 // if (needToExpandCombinationNode(desc, outNode)) {
674 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary,
679 // we have a node that is neither combination or skeleton node
680 // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode);
681 HNode startNode = scGraph.getCurrentHNode(node);
683 // if (node.getDescriptor() != null) {
684 // // node is a skeleton node and it might be merged into another node in the SC
686 // startNode = scGraph.getHNode(node.getDescriptor());
688 // // this node has already been merged before the SC graph.
693 // Set<HNode> endNodeSetFromSimpleGraph =
694 // simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
695 // Set<HNode> endCombNodeSet = new HashSet<HNode>();
696 // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator();
697 // iterator3.hasNext();) {
698 // HNode endNode = (HNode) iterator3.next();
699 // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
702 Set<HNode> endCombNodeSet = scGraph.getOutgoingNodeSet(startNode);
704 // System.out.println("endCombNodeSet=" + endCombNodeSet);
705 visited.add(outNode);
706 if (endCombNodeSet.size() > 0) {
707 // follows the straight line up to another skeleton/combination node
708 endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
709 } else if (endCombNodeSet.size() == 0) {
710 // the outNode is (directly/transitively) connected to the bottom node
711 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
712 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
715 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
716 mapIntermediateLoc, 1, locSummary, outNode);
722 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
723 && !visited.contains(node)) {
725 System.out.println("n=" + node);
727 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
728 if (simpleGraph.getIncomingNodeSet(node).size() == 0) {
730 // this node will be directly connected to the TOP location
731 // start adding the following nodes from this node
733 Set<HNode> endNodeSetFromSimpleGraph =
734 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
736 Set<HNode> endCombNodeSet = new HashSet<HNode>();
737 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
738 HNode endNode = (HNode) iterator3.next();
739 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
742 System.out.println("endCombNodeSet=" + endCombNodeSet);
743 HNode startNode = LocationInference.TOPHNODE;
744 visited.add(startNode);
745 if (endCombNodeSet.size() > 0) {
746 // follows the straight line up to another skeleton/combination node
747 // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet);
748 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
749 mapIntermediateLoc, 1, locSummary, node);
757 // add shared locations
758 Set<HNode> sharedNodeSet = mapSharedNodeToTripleItem.keySet();
759 for (Iterator iterator = sharedNodeSet.iterator(); iterator.hasNext();) {
760 HNode sharedNode = (HNode) iterator.next();
761 TripleItem item = mapSharedNodeToTripleItem.get(sharedNode);
762 String nonSharedLocName = mapIntermediateLoc.get(item);
764 System.out.println("sharedNode=" + sharedNode + " locName=" + nonSharedLocName);
767 if (locSummary.getHNodeNameSetByLatticeLoationName(nonSharedLocName) != null
768 && !lattice.isSharedLoc(nonSharedLocName)) {
769 // need to generate a new shared location in the lattice, which is one level lower than the
770 // 'locName' location
771 newLocName = "ILOC" + (LocationInference.locSeed++);
773 // Set<String> aboveElementSet = getAboveElementSet(lattice, locName);
774 Set<String> belowElementSet = new HashSet<String>();
775 belowElementSet.addAll(lattice.get(nonSharedLocName));
777 System.out.println("nonSharedLocName=" + nonSharedLocName + " belowElementSet="
778 + belowElementSet + " newLocName=" + newLocName);
780 lattice.insertNewLocationBetween(nonSharedLocName, belowElementSet, newLocName);
782 newLocName = nonSharedLocName;
785 lattice.addSharedLoc(newLocName);
786 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
787 Set<Descriptor> descSet = graph.getDescSetOfNode(sharedNode);
788 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
789 Descriptor d = (Descriptor) iterator2.next();
790 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), newLocName);
792 locSummary.addMapHNodeNameToLocationName(sharedNode.getName(), newLocName);
800 private Set<String> getAboveElementSet(SSJavaLattice<String> lattice, String loc) {
802 Set<String> aboveSet = new HashSet<String>();
804 Map<String, Set<String>> latticeMap = lattice.getTable();
805 Set<String> keySet = latticeMap.keySet();
806 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
807 String key = (String) iterator.next();
808 if (latticeMap.get(key).contains(loc)) {
816 private boolean needToExpandCombinationNode(Descriptor desc, HNode cnode) {
818 System.out.println("needToExpandCombinationNode?=" + cnode);
820 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
821 // HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
822 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
823 Set<HNode> combinationNodeSetInSimpleGraph =
824 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
825 System.out.println("---combinationNodeSetInSimpleGraph=" + combinationNodeSetInSimpleGraph);
826 Set<HNode> inNodeSetToCNode = simpleGraph.getIncomingNodeSet(cnode);
827 System.out.println("------inNodeSetToCNode=" + inNodeSetToCNode);
828 for (Iterator iterator = combinationNodeSetInSimpleGraph.iterator(); iterator.hasNext();) {
829 HNode nodeBelongToTheSameCombinationNode = (HNode) iterator.next();
830 if (inNodeSetToCNode.contains(nodeBelongToTheSameCombinationNode)) {
831 // the combination node 'cnode' is not the highest location among the same combination node
839 private void expandCombinationNode(Descriptor desc, SSJavaLattice<String> lattice,
840 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
843 // expand the combination node 'outNode'
844 // here we need to expand the corresponding combination location in the lattice
845 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
847 System.out.println("expandCombinationNode=" + cnode + " cnode in scgraph="
848 + combinationNodeInSCGraph);
850 if (combinationNodeInSCGraph == null) {
854 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
855 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
857 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
859 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
861 Set<HNode> combinationNodeSet =
862 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
864 // System.out.println("combinationNodeSet=" + combinationNodeSet);
867 // Set<HNode> endNodeSetFromSimpleGraph =
868 // simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
869 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
870 // Set<HNode> endCombNodeSet = new HashSet<HNode>();
871 // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
872 // HNode endNode = (HNode) iterator3.next();
873 // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
876 Set<HNode> endCombNodeSet = scGraph.getOutgoingNodeSet(combinationNodeInSCGraph);
879 // follows the straight line up to another skeleton/combination node
880 if (endCombNodeSet.size() > 0) {
881 // System.out.println("---endCombNodeSet=" + endCombNodeSet);
883 removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
885 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
886 mapIntermediateLoc, 1, locSummary, cnode);
888 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
889 // System.out.println("---endCombNodeSet is zero");
890 // System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
891 // System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode));
892 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
893 mapIntermediateLoc, 1, locSummary, cnode);
899 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
900 Set<HNode> endNodeSet) {
902 // if an end node is not directly connected to the start node in the SC graph
903 // replace it with a directly connected one which transitively reaches to it.
905 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
907 Set<HNode> newEndNodeSet = new HashSet<HNode>();
908 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
909 HNode endNode = (HNode) iterator.next();
910 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
911 newEndNodeSet.add(endNode);
914 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
915 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
916 newEndNodeSet.add(newEndNode);
920 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
923 return newEndNodeSet;
927 private HNode getDirectlyReachableSCNodeFromEndNode(HierarchyGraph scGraph, HNode startNode,
928 Set<HNode> endNodeSet) {
930 // System.out.println("getDirectlyReachableSCNodeFromEndNode start=" + startNode +
933 Set<HNode> newStartNodeSet = new HashSet<HNode>();
935 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
936 HNode endNode = (HNode) iterator.next();
937 Set<HNode> connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode);
939 for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) {
940 HNode curNode = (HNode) iterator2.next();
941 if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet<HNode>())) {
942 newStartNodeSet.add(curNode);
947 // System.out.println("newStartNodeSet=" + newStartNodeSet);
949 if (newStartNodeSet.size() == 0) {
950 newStartNodeSet.add(startNode);
953 return newStartNodeSet.iterator().next();
956 private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode,
957 HNode curNode, Set<HNode> visited) {
958 // return true if curNode is transitively connected from the startNode
960 boolean isConnected = false;
961 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
962 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
963 HNode in = (HNode) iterator.next();
964 if (in.equals(startNode)) {
968 isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited);
975 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
976 HNode startNode, HNode endNode) {
977 // System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
978 // + " end=" + endNode);
979 Set<HNode> connected = new HashSet<HNode>();
980 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
981 if (connected.size() == 0) {
982 connected.add(endNode);
984 // System.out.println("connected=" + connected);
986 return connected.iterator().next();
989 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
990 HNode startNode, HNode curNode, Set<HNode> connected) {
992 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
993 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
994 HNode inNode = (HNode) iterator.next();
995 if (inNode.equals(startNode)) {
996 connected.add(curNode);
998 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
1004 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
1005 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
1006 int idx, LocationSummary locSummary, HNode curNode) {
1008 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
1009 if (!mapIntermediateLoc.containsKey(item)) {
1010 // need to create a new intermediate location in the lattice
1011 String newLocName = "ILOC" + (LocationInference.locSeed++);
1014 above = startNode.getName();
1016 int prevIdx = idx - 1;
1017 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
1018 above = mapIntermediateLoc.get(prevItem);
1021 Set<String> belowSet = new HashSet<String>();
1022 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
1023 HNode endNode = (HNode) iterator.next();
1025 if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) {
1026 locName = locSummary.getLocationName(endNode.getName());
1028 locName = endNode.getName();
1030 belowSet.add(locName);
1032 lattice.insertNewLocationBetween(above, belowSet, newLocName);
1034 mapIntermediateLoc.put(item, newLocName);
1037 String locName = mapIntermediateLoc.get(item);
1038 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
1040 if (curNode.isSharedNode()) {
1041 // if the current node is shared location, add a shared location to the lattice later
1042 System.out.println("###SHARED ITEM=" + item);
1043 mapSharedNodeToTripleItem.put(curNode, item);
1045 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
1046 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
1047 Descriptor d = (Descriptor) iterator.next();
1048 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
1050 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
1053 System.out.println("-TripleItem normal=" + item);
1054 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
1055 + " locName=" + locName + " isC=" + curNode.isCombinationNode());
1057 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
1058 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
1059 HNode outNode = (HNode) iterator2.next();
1061 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
1062 System.out.println("outNode=" + outNode);
1063 System.out.println("---incomingHNodeSetToOutNode=" + incomingHNodeSetToOutNode);
1065 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
1066 Pair<HNode, HNode> pair = new Pair(startNode, outNode);
1067 if (visited.containsAll(simpleHierarchyGraph.getIncomingNodeSet(outNode))) {
1068 visited.add(outNode);
1069 int newidx = getCurrentHighestIndex(pair, idx + 1);
1070 // int newidx = getCurrentHighestIndex(outNode, idx + 1);
1071 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
1072 newidx, locSummary, outNode);
1073 // recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
1074 // idx + 1, locSummary, outNode);
1076 updateHighestIndex(pair, idx + 1);
1077 // updateHighestIndex(outNode, idx + 1);
1078 System.out.println("NOT RECUR");
1080 } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) {
1081 if (needToExpandCombinationNode(desc, outNode)) {
1082 System.out.println("NEED TO");
1083 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
1085 System.out.println("NOT NEED TO");
1093 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
1094 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
1095 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
1097 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
1099 if (!mapIntermediateLoc.containsKey(item)) {
1100 // need to create a new intermediate location in the lattice
1103 String newLocName = combinationNodeInSCGraph.getName();
1104 mapIntermediateLoc.put(item, newLocName);
1106 String newLocName = "ILOC" + (LocationInference.locSeed++);
1107 int prevIdx = idx - 1;
1108 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
1109 above = mapIntermediateLoc.get(prevItem);
1111 Set<String> belowSet = new HashSet<String>();
1112 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
1113 HNode endNode = (HNode) iterator.next();
1114 belowSet.add(endNode.getName());
1116 lattice.insertNewLocationBetween(above, belowSet, newLocName);
1117 mapIntermediateLoc.put(item, newLocName);
1123 // Do we need to skip the combination node and assign a shared location to the next node?
1124 // if (idx == 1 && curNode.isSharedNode()) {
1125 // System.out.println("THE FIRST COMBINATION NODE EXPANSION IS SHARED!");
1126 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, mapIntermediateLoc,
1127 // idx + 1, locSummary, curNode);
1131 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
1132 String locName = mapIntermediateLoc.get(item);
1133 if (curNode.isSharedNode()) {
1134 // if the current node is shared location, add a shared location to the lattice later
1135 System.out.println("###SHARED ITEM=" + item);
1136 mapSharedNodeToTripleItem.put(curNode, item);
1138 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
1139 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
1140 Descriptor d = (Descriptor) iterator.next();
1141 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
1143 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
1146 System.out.println("-TripleItem=" + item);
1147 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
1148 + " locName=" + locName);
1150 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
1151 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
1152 HNode outNode = (HNode) iterator2.next();
1153 System.out.println("---recurDFS outNode=" + outNode);
1154 System.out.println("---cur combinationNodeInSCGraph=" + combinationNodeInSCGraph);
1155 System.out.println("---outNode combinationNodeInSCGraph="
1156 + getCombinationNodeInSCGraph(desc, outNode));
1158 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
1159 if (outNode.isCombinationNode()) {
1161 Set<HNode> combineSkeletonNodeSet =
1162 simpleHierarchyGraph.getCombineSetByCombinationNode(outNode);
1163 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
1164 // extract nodes belong to the same combine node
1165 Set<HNode> incomingCombinedHNodeSet = new HashSet<HNode>();
1166 for (Iterator iterator = incomingHNodeSetToOutNode.iterator(); iterator.hasNext();) {
1167 HNode inNode = (HNode) iterator.next();
1168 if (combineSkeletonNodeSet.contains(inNode)) {
1169 incomingCombinedHNodeSet.add(inNode);
1172 System.out.println("-----incomingCombinedHNodeSet=" + incomingCombinedHNodeSet);
1174 // check whether the next combination node is different from the current node
1175 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
1176 Pair<HNode, HNode> pair = new Pair(combinationNodeInSCGraph, outNode);
1177 if (visited.containsAll(incomingCombinedHNodeSet)) {
1178 visited.add(outNode);
1179 System.out.println("-------curIdx=" + (idx + 1));
1181 int newIdx = getCurrentHighestIndex(pair, idx + 1);
1182 // int newIdx = getCurrentHighestIndex(outNode, idx + 1);
1183 System.out.println("-------newIdx=" + newIdx);
1184 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
1185 mapIntermediateLoc, newIdx, locSummary, outNode);
1186 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
1187 // mapIntermediateLoc, idx + 1, locSummary, outNode);
1189 updateHighestIndex(pair, idx + 1);
1190 // updateHighestIndex(outNode, idx + 1);
1191 System.out.println("-----NOT RECUR!");
1194 if (needToExpandCombinationNode(desc, outNode)) {
1195 System.out.println("NEED TO");
1196 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
1198 System.out.println("NOT NEED TO");
1210 private int getCurrentHighestIndex(Pair<HNode, HNode> pair, int curIdx) {
1211 int recordedIdx = getCurrentHighestIndex(pair);
1212 if (recordedIdx > curIdx) {
1219 private int getCurrentHighestIndex(HNode node, int curIdx) {
1220 int recordedIdx = getCurrentHighestIndex(node);
1221 if (recordedIdx > curIdx) {
1228 private int getCurrentHighestIndex(Pair<HNode, HNode> pair) {
1229 if (!mapItemToHighestIndex.containsKey(pair)) {
1230 mapItemToHighestIndex.put(pair, new Integer(-1));
1232 return mapItemToHighestIndex.get(pair).intValue();
1235 private void updateHighestIndex(Pair<HNode, HNode> pair, int idx) {
1236 if (idx > getCurrentHighestIndex(pair)) {
1237 mapItemToHighestIndex.put(pair, new Integer(idx));
1241 private int getCurrentHighestIndex(HNode node) {
1242 if (!mapHNodeToHighestIndex.containsKey(node)) {
1243 mapHNodeToHighestIndex.put(node, new Integer(-1));
1245 return mapHNodeToHighestIndex.get(node).intValue();
1248 private void updateHighestIndex(HNode node, int idx) {
1249 if (idx > getCurrentHighestIndex(node)) {
1250 mapHNodeToHighestIndex.put(node, new Integer(idx));
1254 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
1255 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
1257 if (mapF2LocName.containsKey(F)) {
1258 return mapF2LocName.get(F);
1261 HNode node = basisSet.getHNode(F);
1263 mapF2LocName.put(F, node.getName());
1264 return node.getName();
1266 if (inputGraph.BASISTOPELEMENT.equals(F)) {
1267 return SSJavaAnalysis.BOTTOM;
1269 String str = "LOC" + (LocationInference.locSeed++);
1270 mapF2LocName.put(F, str);
1276 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
1277 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
1278 Set<Integer> F = iter.next();
1279 mapFtoCount.put(F, 0);
1283 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
1285 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
1286 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
1288 // initialize COUNT(F) to 0 for all elements of the family
1289 resetCount(mapFtoCount, family);
1291 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
1292 Set<Integer> F = iter.next();
1293 Set<HNode> gammaF = family.getGamma(F);
1295 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
1296 curHNodeSet.removeAll(gammaF);
1297 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
1299 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
1300 Set<Integer> B = (Set<Integer>) iterator.next();
1302 Set<Integer> Fprime = new HashSet<Integer>();
1307 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
1309 // if |gamma(F')|==COUNT(F') + |gamma(F)|
1310 int numGammaFprime = family.getGamma(Fprime).size();
1311 int countFprime = mapFtoCount.get(Fprime);
1312 int numGammaF = family.getGamma(F).size();
1313 if (numGammaFprime == (countFprime + numGammaF)) {
1314 // ImSucc(F)=IMSucc(F) union F'
1315 addImSucc(mapImSucc, F, Fprime);
1319 resetCount(mapFtoCount, family);
1322 // System.out.println("mapImSucc=" + mapImSucc);
1327 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
1328 if (!mapImSucc.containsKey(F)) {
1329 mapImSucc.put(F, new HashSet<Set<Integer>>());
1331 return mapImSucc.get(F);
1334 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
1335 Set<Integer> Fprime) {
1337 if (!mapImSucc.containsKey(F)) {
1338 mapImSucc.put(F, new HashSet<Set<Integer>>());
1341 mapImSucc.get(F).add(Fprime);
1345 private Family generateFamily(BasisSet basisSet) {
1347 Family family = new Family();
1349 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
1350 Set<Integer> B = iterator.next();
1352 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
1354 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
1355 Set<Integer> F = iterator2.next();
1357 Set<Integer> Fprime = new HashSet<Integer>();
1361 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
1362 gammaFPrimeSet.addAll(family.getGamma(F));
1363 gammaFPrimeSet.add(basisSet.getHNode(B));
1365 if (!family.containsF(Fprime)) {
1366 Pair<Set<Integer>, Set<HNode>> pair =
1367 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
1368 tobeadded.add(pair);
1370 family.updateGammaF(Fprime, gammaFPrimeSet);
1374 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
1376 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
1377 family.addFElement(pair.getFirst());
1378 family.updateGammaF(pair.getFirst(), pair.getSecond());
1385 private void debug_print(HierarchyGraph inputGraph) {
1386 System.out.println("\nBuild Lattice:" + inputGraph.getName());
1387 System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
1388 System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
1397 public Identifier(HNode n, int i) {
1402 public int hashCode() {
1403 return node.hashCode() + idx;
1406 public boolean equals(Object obj) {
1408 if (obj instanceof Identifier) {
1409 Identifier in = (Identifier) obj;
1410 if (node.equals(in.node) && idx == in.idx) {
1421 public HNode higherNode;
1422 public Set<HNode> lowerNodeSet;
1424 public boolean isShared;
1426 public TripleItem(HNode h, Set<HNode> l, int i) {
1433 public void setShared(boolean in) {
1437 public boolean isShared() {
1441 public int hashCode() {
1444 if (higherNode != null) {
1445 h = higherNode.hashCode();
1452 return h + lowerNodeSet.hashCode() + idx;
1455 public boolean equals(Object obj) {
1457 if (obj instanceof TripleItem) {
1458 TripleItem in = (TripleItem) obj;
1459 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
1460 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx && isShared == in.isShared()) {
1468 public String toString() {
1469 String rtr = higherNode + "-" + idx + "->" + lowerNodeSet;