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 public BuildLattice(LocationInference infer) {
27 this.mapSharedNodeToTripleItem = new HashMap<HNode, TripleItem>();
28 this.mapHNodeToHighestIndex = new HashMap<HNode, Integer>();
29 this.mapItemToHighestIndex = new HashMap<Pair<HNode, HNode>, Integer>();
30 this.mapDescToIntermediateLocMap = new HashMap<Descriptor, Map<TripleItem, String>>();
33 public SSJavaLattice<String> buildLattice(Descriptor desc) {
35 HierarchyGraph inputGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
36 LocationSummary locSummary = infer.getLocationSummary(desc);
38 HierarchyGraph naiveGraph = infer.getSimpleHierarchyGraph(desc);
40 // I don't think we need to keep the below if statement anymore
41 // because hierarchy graph does not have any composite location
42 Set<HNode> nodeSetWithCompositeLocation = new HashSet<HNode>();
43 if (desc instanceof MethodDescriptor) {
44 FlowGraph flowGraph = infer.getFlowGraph((MethodDescriptor) desc);
46 for (Iterator iterator = inputGraph.getNodeSet().iterator(); iterator.hasNext();) {
47 HNode hnode = (HNode) iterator.next();
48 Descriptor hnodeDesc = hnode.getDescriptor();
49 if (hnodeDesc != null) {
50 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
51 descTuple.add(hnodeDesc);
53 if (flowGraph.contains(descTuple)) {
54 FlowNode flowNode = flowGraph.getFlowNode(descTuple);
55 if (flowNode.getCompositeLocation() != null) {
56 nodeSetWithCompositeLocation.add(hnode);
65 // /////////////////////////////////////////////////////////////////////////////////////
66 // lattice generation for the native approach
68 if (infer.state.SSJAVA_INFER_NAIVE_WRITEDOTS) {
69 BasisSet naiveBasisSet = naiveGraph.computeBasisSet(nodeSetWithCompositeLocation);
71 Family naiveFamily = generateFamily(naiveBasisSet);
72 Map<Set<Integer>, Set<Set<Integer>>> naive_mapImSucc =
73 coveringGraph(naiveBasisSet, naiveFamily);
75 SSJavaLattice<String> naive_lattice =
76 buildLattice(desc, naiveBasisSet, naiveGraph, null, naive_mapImSucc);
77 LocationInference.numLocationsNaive += naive_lattice.getKeySet().size();
78 infer.addNaiveLattice(desc, naive_lattice);
81 // /////////////////////////////////////////////////////////////////////////////////////
83 // lattice generation for the proposed approach
84 BasisSet basisSet = inputGraph.computeBasisSet(nodeSetWithCompositeLocation);
85 // debug_print(inputGraph);
87 Family family = generateFamily(basisSet);
88 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = coveringGraph(basisSet, family);
90 SSJavaLattice<String> lattice = buildLattice(desc, basisSet, inputGraph, locSummary, mapImSucc);
95 public void setIntermediateLocMap(Descriptor desc, Map<TripleItem, String> map) {
96 mapDescToIntermediateLocMap.put(desc, map);
99 public Map<TripleItem, String> getIntermediateLocMap(Descriptor desc) {
100 if (!mapDescToIntermediateLocMap.containsKey(desc)) {
101 mapDescToIntermediateLocMap.put(desc, new HashMap<TripleItem, String>());
103 return mapDescToIntermediateLocMap.get(desc);
106 private Descriptor getParent(Descriptor desc) {
107 if (desc instanceof MethodDescriptor) {
108 MethodDescriptor md = (MethodDescriptor) desc;
109 ClassDescriptor cd = md.getClassDesc();
110 return infer.getParentMethodDesc(cd, md);
112 return ((ClassDescriptor) desc).getSuperDesc();
116 private SSJavaLattice<String> buildLattice(Descriptor desc, BasisSet basisSet,
117 HierarchyGraph inputGraph, LocationSummary locSummary,
118 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
120 System.out.println("\nBuild Lattice:" + inputGraph.getName());
122 SSJavaLattice<String> lattice =
123 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
125 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
127 Set<Set<Integer>> keySet = mapImSucc.keySet();
128 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
129 Set<Integer> higher = (Set<Integer>) iterator.next();
131 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
133 HNode higherNode = inputGraph.getHNode(higherName);
135 if (higherNode == null) {
136 NameDescriptor d = new NameDescriptor(higherName);
137 higherNode = inputGraph.getHNode(d);
138 higherNode.setSkeleton(true);
141 if (higherNode != null && higherNode.isSharedNode()) {
142 lattice.addSharedLoc(higherName);
144 Set<Descriptor> descSet = inputGraph.getDescSetOfNode(higherNode);
145 // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet="
148 if (locSummary != null) {
149 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
150 Descriptor d = (Descriptor) iterator2.next();
151 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName);
155 // locSummary.addMapHNodeNameToLocationName(higherName, higherName);
157 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
158 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
159 Set<Integer> lower = (Set<Integer>) iterator2.next();
161 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
162 HNode lowerNode = inputGraph.getHNode(lowerName);
164 if (lowerNode == null && !lowerName.equals(SSJavaAnalysis.BOTTOM)) {
165 NameDescriptor d = new NameDescriptor(lowerName);
166 lowerNode = inputGraph.getHNode(d);
167 lowerNode.setSkeleton(true);
170 if (lowerNode != null && !inputGraph.isDirectlyConnectedTo(higherNode, lowerNode)) {
171 inputGraph.addEdge(higherNode, lowerNode);
174 if (lowerNode != null && lowerNode.isSharedNode()) {
175 lattice.addSharedLoc(lowerName);
178 Set<Descriptor> lowerDescSet = inputGraph.getDescSetOfNode(lowerNode);
179 // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet="
181 if (locSummary != null) {
182 for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) {
183 Descriptor d = (Descriptor) iterator3.next();
184 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName);
187 // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
189 if (higher.size() == 0) {
191 lattice.put(lowerName);
193 lattice.addRelationHigherToLower(higherName, lowerName);
200 inputGraph.removeRedundantEdges();
204 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
206 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
208 if (nodeFromSimpleGraph.isSkeleton()) {
209 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
212 Set<HNode> combineSkeletonNodeSet =
213 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
214 HNode combinationNodeInSCGraph =
215 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
216 .get(combineSkeletonNodeSet);
218 // Set<HNode> combineSkeletonNodeSet =
219 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
220 // HNode combinationNodeInSCGraph =
221 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
222 return combinationNodeInSCGraph;
225 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
226 SSJavaLattice<String> skeletonLattice) {
228 SSJavaLattice<String> lattice = skeletonLattice.clone();
229 LocationSummary locSummary = infer.getLocationSummary(desc);
231 Descriptor parentDesc = getParent(desc);
232 if (parentDesc != null) {
233 SSJavaLattice<String> parentLattice = infer.getLattice(parentDesc);
235 Map<String, Set<String>> parentMap = parentLattice.getTable();
236 Set<String> parentKeySet = parentMap.keySet();
237 for (Iterator iterator = parentKeySet.iterator(); iterator.hasNext();) {
238 String parentKey = (String) iterator.next();
239 Set<String> parentValueSet = parentMap.get(parentKey);
240 for (Iterator iterator2 = parentValueSet.iterator(); iterator2.hasNext();) {
241 String value = (String) iterator2.next();
242 lattice.put(parentKey, value);
246 Set<String> parentSharedLocSet = parentLattice.getSharedLocSet();
247 for (Iterator iterator = parentSharedLocSet.iterator(); iterator.hasNext();) {
248 String parentSharedLoc = (String) iterator.next();
249 lattice.addSharedLoc(parentSharedLoc);
253 HierarchyGraph hierarchyGraph = infer.getSimpleHierarchyGraph(desc);
254 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
256 Set<HNode> hierarchyGraphNodeSet = hierarchyGraph.getNodeSet();
257 for (Iterator iterator = hierarchyGraphNodeSet.iterator(); iterator.hasNext();) {
258 HNode hNode = (HNode) iterator.next();
259 if (!hNode.isSkeleton()) {
260 // here we need to insert an intermediate node for the hNode
261 System.out.println("\n#local node=" + hNode);
263 // 1) find the lowest node m in the lattice that is above hnode in the lattice
264 // 2) count the number of non-shared nodes d between the hnode and the node m
265 int numNonSharedNodes;
268 if (hNode.isDirectCombinationNode()) {
269 // this node itself is the lowest node m. it is the first node of the chain
270 Set<HNode> combineSet = hierarchyGraph.getCombineSetByCombinationNode(hNode);
272 System.out.println(" # direct combine node::combineSkeletonNodeSet=" + combineSet);
274 SCNode = scGraph.getCombinationNode(combineSet);
275 numNonSharedNodes = -1;
278 Set<HNode> aboveSet = new HashSet<HNode>();
279 if (hNode.isCombinationNode()) {
280 // the current node is a combination node
281 Set<HNode> combineSkeletonNodeSet =
282 hierarchyGraph.getCombineSetByCombinationNode(hNode);
283 System.out.println(" combineSkeletonNodeSet=" + combineSkeletonNodeSet
284 + " combinationNode=" + scGraph.getCombinationNode(combineSkeletonNodeSet));
286 scGraph.getCombinationNode(combineSkeletonNodeSet);
288 System.out.println(" firstnode="
289 + hierarchyGraph.getFirstNodeOfCombinationNodeChainSet(combineSkeletonNodeSet));
290 aboveSet.addAll(hierarchyGraph
291 .getFirstNodeOfCombinationNodeChainSet(combineSkeletonNodeSet));
293 SCNode = scGraph.getCombinationNode(combineSkeletonNodeSet);
296 // the current node is not a combination node
297 // there is only one parent node which should be skeleton node.
299 System.out.println(" hierarchyGraph.getSkeleteNodeSetReachTo(" + hNode + ")="
300 + hierarchyGraph.getSkeleteNodeSetReachTo(hNode));
301 aboveSet.addAll(hierarchyGraph.getSkeleteNodeSetReachTo(hNode));
302 // assert aboveSet.size() == 1;
303 SCNode = aboveSet.iterator().next();
306 // update above set w.r.t the hierarchy graph with SC nodes
307 // because the skeleton nodes in the origianl hierarchy graph may merged to a new node
308 Set<HNode> endSet = new HashSet<HNode>();
309 for (Iterator iterator2 = aboveSet.iterator(); iterator2.hasNext();) {
310 HNode aboveNode = (HNode) iterator2.next();
311 endSet.add(scGraph.getCurrentHNode(aboveNode));
313 numNonSharedNodes = hierarchyGraph.countNonSharedNode(hNode, endSet);
315 System.out.println(" node=" + hNode + " above=" + endSet + " distance="
316 + numNonSharedNodes + " SCNode=" + SCNode);
319 // 3) convert the node m into a chain of nodes with the last node in the chain having m’s
321 Set<HNode> outgoingSCNodeSet = scGraph.getOutgoingNodeSet(SCNode);
322 System.out.println(" SCNODE outgoing hnode set=" + outgoingSCNodeSet);
324 Set<String> outgoingLocNameSet = new HashSet<String>();
325 for (Iterator iterator2 = outgoingSCNodeSet.iterator(); iterator2.hasNext();) {
326 HNode outSCNode = (HNode) iterator2.next();
327 String locName = locSummary.getLocationName(outSCNode.getName());
328 System.out.println(" outSCNode=" + outSCNode + " -> locName="
330 outgoingLocNameSet.add(locName);
333 // 4) If hnode is not a shared location, check if there already exists a local variable
334 // node that has distance d below m along this chain. If such a node
335 // does not exist, insert it.
337 getNewLocation(lattice, SCNode.getName(), outgoingLocNameSet, numNonSharedNodes,
338 hNode.isSharedNode());
339 System.out.println(" locName=" + locName);
340 locSummary.addMapHNodeNameToLocationName(hNode.getName(), locName);
348 public String getNewLocation(SSJavaLattice<String> lattice, String start, Set<String> endSet,
349 int dist, boolean isShared) {
350 System.out.println(" getNewLocation:: start=" + start + " endSet=" + endSet + " dist="
351 + dist + " isShared=" + isShared);
355 return recur_getNewLocation(lattice, start, endSet, dist, isShared);
358 private String recur_getNewLocation(SSJavaLattice<String> lattice, String cur,
359 Set<String> endSet, int dist, boolean isShared) {
360 System.out.println("H");
361 Set<String> connectedSet = lattice.get(cur);
362 if (connectedSet == null) {
363 connectedSet = new HashSet<String>();
366 System.out.println(" recur_getNewLocation cur=" + cur + " dist=" + dist
367 + " connectedSet=" + connectedSet + " endSet=" + endSet);
369 if (dist == 0 && isShared) {
370 // if the node is shared,
371 // check if there already exists a shared node that has distance d + 1 on the chain
372 if ((cur.equals(lattice.getTopItem()) && connectedSet.containsAll(endSet))
373 || connectedSet.equals(endSet)) {
374 // need to insert a new shared location
375 // it is done after this if statement
377 assert connectedSet.size() == 1;
378 String below = connectedSet.iterator().next();
379 if (lattice.isSharedLoc(below)) {
384 // need to insert a new shared location
385 Set<String> newChildSet = new HashSet<String>();
386 newChildSet.addAll(connectedSet);
388 String newLocName = "ILOC" + (LocationInference.locSeed++);
389 for (Iterator iterator = newChildSet.iterator(); iterator.hasNext();) {
390 String outNode = (String) iterator.next();
391 lattice.put(newLocName, outNode);
393 lattice.get(cur).clear();
394 lattice.put(cur, newLocName);
396 System.out.println(" INSERT NEW SHARED NODE=" + newLocName + " above=" + cur
397 + " below=" + lattice.get(newLocName));
399 lattice.addSharedLoc(newLocName);
407 if (cur.equals(lattice.getTopItem()) || connectedSet.equals(endSet) || endSet.isEmpty()) {
409 // if ( (cur.equals(lattice.getTopItem()) && connectedSet.containsAll(endSet))
410 // || connectedSet.equals(endSet)) {
412 // need to insert a new location
413 String newLocName = "ILOC" + (LocationInference.locSeed++);
414 connectedSet.clear();
415 lattice.put(cur, newLocName);
417 System.out.println("#INSERT NEW RELATION cur=" + cur + " newLocName=" + newLocName + "::"
420 for (Iterator iterator = endSet.iterator(); iterator.hasNext();) {
421 String endNode = (String) iterator.next();
422 lattice.put(newLocName, endNode);
425 System.out.println(" INSERT NEW NODE=" + newLocName + " above=" + cur + " below="
428 assert connectedSet.size() == 1;
429 next = connectedSet.iterator().next();
431 System.out.println(" next=" + next);
437 // // if the node is shared,
438 // // check if there already exists a shared node that has distance d + 1 on the chain
440 // connectedSet = lattice.get(next);
442 // if (connectedSet.equals(endSet)) {
443 // // need to insert a new shared location
445 // assert connectedSet.size() != 1;
446 // String below = connectedSet.iterator().next();
447 // if (lattice.isSharedLoc(below)) {
452 // // need to insert a new shared location
453 // String newLocName = "ILOC" + (LocationInference.locSeed++);
454 // for (Iterator iterator = connectedSet.iterator(); iterator.hasNext();) {
455 // String outNode = (String) iterator.next();
456 // lattice.put(newLocName, outNode);
458 // connectedSet.clear();
459 // lattice.put(next, newLocName);
461 // System.out.println(" INSERT NEW SHARED NODE=" + newLocName + " above=" + next
462 // + " below=" + lattice.get(newLocName));
464 // lattice.addSharedLoc(newLocName);
466 // next = newLocName;
477 if (!lattice.isSharedLoc(next)) {
480 return recur_getNewLocation(lattice, next, endSet, dist, isShared);
485 // ///////////////////////////////////////////////
489 // } else if (connectedSet.equals(endSet)) {
490 // // need to insert a new location
491 // String newLocName = "ILOC" + (LocationInference.locSeed++);
492 // connectedSet.clear();
493 // lattice.put(cur, newLocName);
494 // for (Iterator iterator = endSet.iterator(); iterator.hasNext();) {
495 // String endNode = (String) iterator.next();
496 // lattice.put(newLocName, endNode);
498 // return recur_getNewLocation(lattice, newLocName, endSet, --dist, isShared);
500 // assert connectedSet.size() != 1;
501 // String next = connectedSet.iterator().next();
502 // return recur_getNewLocation(lattice, next, endSet, --dist, isShared);
507 public SSJavaLattice<String> insertIntermediateNodesToStraightLine2(Descriptor desc,
508 SSJavaLattice<String> skeletonLattice) {
509 // copy nodes/edges from the parent method/class if possible
510 SSJavaLattice<String> lattice = skeletonLattice.clone();
512 Descriptor parentDesc = getParent(desc);
513 if (parentDesc != null) {
514 SSJavaLattice<String> parentLattice = infer.getLattice(parentDesc);
516 Map<String, Set<String>> parentMap = parentLattice.getTable();
517 Set<String> parentKeySet = parentMap.keySet();
518 for (Iterator iterator = parentKeySet.iterator(); iterator.hasNext();) {
519 String parentKey = (String) iterator.next();
520 Set<String> parentValueSet = parentMap.get(parentKey);
521 for (Iterator iterator2 = parentValueSet.iterator(); iterator2.hasNext();) {
522 String value = (String) iterator2.next();
523 lattice.put(parentKey, value);
527 Set<String> parentSharedLocSet = parentLattice.getSharedLocSet();
528 for (Iterator iterator = parentSharedLocSet.iterator(); iterator.hasNext();) {
529 String parentSharedLoc = (String) iterator.next();
530 lattice.addSharedLoc(parentSharedLoc);
536 // perform DFS that starts from each skeleton/combination node and ends by another
537 // skeleton/combination node
539 mapSharedNodeToTripleItem.clear();
541 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
542 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
543 LocationSummary locSummary = infer.getLocationSummary(desc);
545 Set<HNode> visited = new HashSet<HNode>();
547 Set<HNode> nodeSet = simpleGraph.getNodeSet();
549 Map<TripleItem, String> mapIntermediateLoc = getIntermediateLocMap(desc);
550 // Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
552 // System.out.println("*insert=" + desc);
553 // System.out.println("***nodeSet=" + nodeSet);
554 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
555 HNode node = (HNode) iterator.next();
556 System.out.println("node=" + node);
558 if (node.isSkeleton() && (!visited.contains(node))) {
561 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
562 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
563 HNode outNode = (HNode) iterator2.next();
565 if (!outNode.isSkeleton()) {
566 if (outNode.isCombinationNode()) {
567 if (visited.containsAll(simpleGraph.getIncomingNodeSet(outNode))) {
568 // if (needToExpandCombinationNode(desc, outNode)) {
569 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary,
574 // we have a node that is neither combination or skeleton node
575 // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode);
576 HNode startNode = scGraph.getCurrentHNode(node);
578 // if (node.getDescriptor() != null) {
579 // // node is a skeleton node and it might be merged into another node in the SC
581 // startNode = scGraph.getHNode(node.getDescriptor());
583 // // this node has already been merged before the SC graph.
588 // Set<HNode> endNodeSetFromSimpleGraph =
589 // simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
590 // Set<HNode> endCombNodeSet = new HashSet<HNode>();
591 // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator();
592 // iterator3.hasNext();) {
593 // HNode endNode = (HNode) iterator3.next();
594 // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
597 Set<HNode> endCombNodeSet = scGraph.getOutgoingNodeSet(startNode);
599 // System.out.println("endCombNodeSet=" + endCombNodeSet);
600 visited.add(outNode);
601 if (endCombNodeSet.size() > 0) {
602 // follows the straight line up to another skeleton/combination node
603 endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
604 } else if (endCombNodeSet.size() == 0) {
605 // the outNode is (directly/transitively) connected to the bottom node
606 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
607 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
610 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
611 mapIntermediateLoc, 1, locSummary, outNode);
617 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
618 && !visited.contains(node)) {
620 System.out.println("n=" + node);
622 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
623 if (simpleGraph.getIncomingNodeSet(node).size() == 0) {
625 // this node will be directly connected to the TOP location
626 // start adding the following nodes from this node
628 Set<HNode> endNodeSetFromSimpleGraph =
629 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
631 Set<HNode> endCombNodeSet = new HashSet<HNode>();
632 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
633 HNode endNode = (HNode) iterator3.next();
634 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
637 System.out.println("endCombNodeSet=" + endCombNodeSet);
638 HNode startNode = LocationInference.TOPHNODE;
639 visited.add(startNode);
640 if (endCombNodeSet.size() > 0) {
641 // follows the straight line up to another skeleton/combination node
642 // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet);
643 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
644 mapIntermediateLoc, 1, locSummary, node);
652 // add shared locations
653 Set<HNode> sharedNodeSet = mapSharedNodeToTripleItem.keySet();
654 for (Iterator iterator = sharedNodeSet.iterator(); iterator.hasNext();) {
655 HNode sharedNode = (HNode) iterator.next();
656 TripleItem item = mapSharedNodeToTripleItem.get(sharedNode);
657 String nonSharedLocName = mapIntermediateLoc.get(item);
659 System.out.println("sharedNode=" + sharedNode + " locName=" + nonSharedLocName);
662 if (locSummary.getHNodeNameSetByLatticeLoationName(nonSharedLocName) != null
663 && !lattice.isSharedLoc(nonSharedLocName)) {
664 // need to generate a new shared location in the lattice, which is one level lower than the
665 // 'locName' location
666 newLocName = "ILOC" + (LocationInference.locSeed++);
668 // Set<String> aboveElementSet = getAboveElementSet(lattice, locName);
669 Set<String> belowElementSet = new HashSet<String>();
670 belowElementSet.addAll(lattice.get(nonSharedLocName));
672 System.out.println("nonSharedLocName=" + nonSharedLocName + " belowElementSet="
673 + belowElementSet + " newLocName=" + newLocName);
675 lattice.insertNewLocationBetween(nonSharedLocName, belowElementSet, newLocName);
677 newLocName = nonSharedLocName;
680 lattice.addSharedLoc(newLocName);
681 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
682 Set<Descriptor> descSet = graph.getDescSetOfNode(sharedNode);
683 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
684 Descriptor d = (Descriptor) iterator2.next();
685 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), newLocName);
687 locSummary.addMapHNodeNameToLocationName(sharedNode.getName(), newLocName);
695 private Set<String> getAboveElementSet(SSJavaLattice<String> lattice, String loc) {
697 Set<String> aboveSet = new HashSet<String>();
699 Map<String, Set<String>> latticeMap = lattice.getTable();
700 Set<String> keySet = latticeMap.keySet();
701 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
702 String key = (String) iterator.next();
703 if (latticeMap.get(key).contains(loc)) {
711 private boolean needToExpandCombinationNode(Descriptor desc, HNode cnode) {
713 System.out.println("needToExpandCombinationNode?=" + cnode);
715 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
716 // HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
717 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
718 Set<HNode> combinationNodeSetInSimpleGraph =
719 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
720 System.out.println("---combinationNodeSetInSimpleGraph=" + combinationNodeSetInSimpleGraph);
721 Set<HNode> inNodeSetToCNode = simpleGraph.getIncomingNodeSet(cnode);
722 System.out.println("------inNodeSetToCNode=" + inNodeSetToCNode);
723 for (Iterator iterator = combinationNodeSetInSimpleGraph.iterator(); iterator.hasNext();) {
724 HNode nodeBelongToTheSameCombinationNode = (HNode) iterator.next();
725 if (inNodeSetToCNode.contains(nodeBelongToTheSameCombinationNode)) {
726 // the combination node 'cnode' is not the highest location among the same combination node
734 private void expandCombinationNode(Descriptor desc, SSJavaLattice<String> lattice,
735 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
738 // expand the combination node 'outNode'
739 // here we need to expand the corresponding combination location in the lattice
740 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
742 System.out.println("expandCombinationNode=" + cnode + " cnode in scgraph="
743 + combinationNodeInSCGraph);
745 if (combinationNodeInSCGraph == null) {
749 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
750 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
752 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
754 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
756 Set<HNode> combinationNodeSet =
757 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
759 // System.out.println("combinationNodeSet=" + combinationNodeSet);
762 // Set<HNode> endNodeSetFromSimpleGraph =
763 // simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
764 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
765 // Set<HNode> endCombNodeSet = new HashSet<HNode>();
766 // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
767 // HNode endNode = (HNode) iterator3.next();
768 // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
771 Set<HNode> endCombNodeSet = scGraph.getOutgoingNodeSet(combinationNodeInSCGraph);
774 // follows the straight line up to another skeleton/combination node
775 if (endCombNodeSet.size() > 0) {
776 // System.out.println("---endCombNodeSet=" + endCombNodeSet);
778 removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
780 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
781 mapIntermediateLoc, 1, locSummary, cnode);
783 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
784 // System.out.println("---endCombNodeSet is zero");
785 // System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
786 // System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode));
787 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
788 mapIntermediateLoc, 1, locSummary, cnode);
794 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
795 Set<HNode> endNodeSet) {
797 // if an end node is not directly connected to the start node in the SC graph
798 // replace it with a directly connected one which transitively reaches to it.
800 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
802 Set<HNode> newEndNodeSet = new HashSet<HNode>();
803 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
804 HNode endNode = (HNode) iterator.next();
805 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
806 newEndNodeSet.add(endNode);
809 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
810 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
811 newEndNodeSet.add(newEndNode);
815 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
818 return newEndNodeSet;
822 private HNode getDirectlyReachableSCNodeFromEndNode(HierarchyGraph scGraph, HNode startNode,
823 Set<HNode> endNodeSet) {
825 // System.out.println("getDirectlyReachableSCNodeFromEndNode start=" + startNode +
828 Set<HNode> newStartNodeSet = new HashSet<HNode>();
830 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
831 HNode endNode = (HNode) iterator.next();
832 Set<HNode> connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode);
834 for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) {
835 HNode curNode = (HNode) iterator2.next();
836 if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet<HNode>())) {
837 newStartNodeSet.add(curNode);
842 // System.out.println("newStartNodeSet=" + newStartNodeSet);
844 if (newStartNodeSet.size() == 0) {
845 newStartNodeSet.add(startNode);
848 return newStartNodeSet.iterator().next();
851 private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode,
852 HNode curNode, Set<HNode> visited) {
853 // return true if curNode is transitively connected from the startNode
855 boolean isConnected = false;
856 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
857 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
858 HNode in = (HNode) iterator.next();
859 if (in.equals(startNode)) {
863 isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited);
870 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
871 HNode startNode, HNode endNode) {
872 // System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
873 // + " end=" + endNode);
874 Set<HNode> connected = new HashSet<HNode>();
875 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
876 if (connected.size() == 0) {
877 connected.add(endNode);
879 // System.out.println("connected=" + connected);
881 return connected.iterator().next();
884 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
885 HNode startNode, HNode curNode, Set<HNode> connected) {
887 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
888 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
889 HNode inNode = (HNode) iterator.next();
890 if (inNode.equals(startNode)) {
891 connected.add(curNode);
893 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
899 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
900 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
901 int idx, LocationSummary locSummary, HNode curNode) {
903 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
904 if (!mapIntermediateLoc.containsKey(item)) {
905 // need to create a new intermediate location in the lattice
906 String newLocName = "ILOC" + (LocationInference.locSeed++);
909 above = startNode.getName();
911 int prevIdx = idx - 1;
912 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
913 above = mapIntermediateLoc.get(prevItem);
916 Set<String> belowSet = new HashSet<String>();
917 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
918 HNode endNode = (HNode) iterator.next();
920 if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) {
921 locName = locSummary.getLocationName(endNode.getName());
923 locName = endNode.getName();
925 belowSet.add(locName);
927 lattice.insertNewLocationBetween(above, belowSet, newLocName);
929 mapIntermediateLoc.put(item, newLocName);
932 String locName = mapIntermediateLoc.get(item);
933 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
935 if (curNode.isSharedNode()) {
936 // if the current node is shared location, add a shared location to the lattice later
937 System.out.println("###SHARED ITEM=" + item);
938 mapSharedNodeToTripleItem.put(curNode, item);
940 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
941 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
942 Descriptor d = (Descriptor) iterator.next();
943 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
945 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
948 System.out.println("-TripleItem normal=" + item);
949 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
950 + " locName=" + locName + " isC=" + curNode.isCombinationNode());
952 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
953 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
954 HNode outNode = (HNode) iterator2.next();
956 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
957 System.out.println("outNode=" + outNode);
958 System.out.println("---incomingHNodeSetToOutNode=" + incomingHNodeSetToOutNode);
960 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
961 Pair<HNode, HNode> pair = new Pair(startNode, outNode);
962 if (visited.containsAll(simpleHierarchyGraph.getIncomingNodeSet(outNode))) {
963 visited.add(outNode);
964 int newidx = getCurrentHighestIndex(pair, idx + 1);
965 // int newidx = getCurrentHighestIndex(outNode, idx + 1);
966 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
967 newidx, locSummary, outNode);
968 // recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
969 // idx + 1, locSummary, outNode);
971 updateHighestIndex(pair, idx + 1);
972 // updateHighestIndex(outNode, idx + 1);
973 System.out.println("NOT RECUR");
975 } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) {
976 if (needToExpandCombinationNode(desc, outNode)) {
977 System.out.println("NEED TO");
978 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
980 System.out.println("NOT NEED TO");
988 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
989 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
990 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
992 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
994 if (!mapIntermediateLoc.containsKey(item)) {
995 // need to create a new intermediate location in the lattice
998 String newLocName = combinationNodeInSCGraph.getName();
999 mapIntermediateLoc.put(item, newLocName);
1001 String newLocName = "ILOC" + (LocationInference.locSeed++);
1002 int prevIdx = idx - 1;
1003 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
1004 above = mapIntermediateLoc.get(prevItem);
1006 Set<String> belowSet = new HashSet<String>();
1007 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
1008 HNode endNode = (HNode) iterator.next();
1009 belowSet.add(endNode.getName());
1011 lattice.insertNewLocationBetween(above, belowSet, newLocName);
1012 mapIntermediateLoc.put(item, newLocName);
1018 // Do we need to skip the combination node and assign a shared location to the next node?
1019 // if (idx == 1 && curNode.isSharedNode()) {
1020 // System.out.println("THE FIRST COMBINATION NODE EXPANSION IS SHARED!");
1021 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, mapIntermediateLoc,
1022 // idx + 1, locSummary, curNode);
1026 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
1027 String locName = mapIntermediateLoc.get(item);
1028 if (curNode.isSharedNode()) {
1029 // if the current node is shared location, add a shared location to the lattice later
1030 System.out.println("###SHARED ITEM=" + item);
1031 mapSharedNodeToTripleItem.put(curNode, item);
1033 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
1034 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
1035 Descriptor d = (Descriptor) iterator.next();
1036 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
1038 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
1041 System.out.println("-TripleItem=" + item);
1042 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
1043 + " locName=" + locName);
1045 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
1046 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
1047 HNode outNode = (HNode) iterator2.next();
1048 System.out.println("---recurDFS outNode=" + outNode);
1049 System.out.println("---cur combinationNodeInSCGraph=" + combinationNodeInSCGraph);
1050 System.out.println("---outNode combinationNodeInSCGraph="
1051 + getCombinationNodeInSCGraph(desc, outNode));
1053 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
1054 if (outNode.isCombinationNode()) {
1056 Set<HNode> combineSkeletonNodeSet =
1057 simpleHierarchyGraph.getCombineSetByCombinationNode(outNode);
1058 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
1059 // extract nodes belong to the same combine node
1060 Set<HNode> incomingCombinedHNodeSet = new HashSet<HNode>();
1061 for (Iterator iterator = incomingHNodeSetToOutNode.iterator(); iterator.hasNext();) {
1062 HNode inNode = (HNode) iterator.next();
1063 if (combineSkeletonNodeSet.contains(inNode)) {
1064 incomingCombinedHNodeSet.add(inNode);
1067 System.out.println("-----incomingCombinedHNodeSet=" + incomingCombinedHNodeSet);
1069 // check whether the next combination node is different from the current node
1070 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
1071 Pair<HNode, HNode> pair = new Pair(combinationNodeInSCGraph, outNode);
1072 if (visited.containsAll(incomingCombinedHNodeSet)) {
1073 visited.add(outNode);
1074 System.out.println("-------curIdx=" + (idx + 1));
1076 int newIdx = getCurrentHighestIndex(pair, idx + 1);
1077 // int newIdx = getCurrentHighestIndex(outNode, idx + 1);
1078 System.out.println("-------newIdx=" + newIdx);
1079 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
1080 mapIntermediateLoc, newIdx, locSummary, outNode);
1081 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
1082 // mapIntermediateLoc, idx + 1, locSummary, outNode);
1084 updateHighestIndex(pair, idx + 1);
1085 // updateHighestIndex(outNode, idx + 1);
1086 System.out.println("-----NOT RECUR!");
1089 if (needToExpandCombinationNode(desc, outNode)) {
1090 System.out.println("NEED TO");
1091 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
1093 System.out.println("NOT NEED TO");
1105 private int getCurrentHighestIndex(Pair<HNode, HNode> pair, int curIdx) {
1106 int recordedIdx = getCurrentHighestIndex(pair);
1107 if (recordedIdx > curIdx) {
1114 private int getCurrentHighestIndex(HNode node, int curIdx) {
1115 int recordedIdx = getCurrentHighestIndex(node);
1116 if (recordedIdx > curIdx) {
1123 private int getCurrentHighestIndex(Pair<HNode, HNode> pair) {
1124 if (!mapItemToHighestIndex.containsKey(pair)) {
1125 mapItemToHighestIndex.put(pair, new Integer(-1));
1127 return mapItemToHighestIndex.get(pair).intValue();
1130 private void updateHighestIndex(Pair<HNode, HNode> pair, int idx) {
1131 if (idx > getCurrentHighestIndex(pair)) {
1132 mapItemToHighestIndex.put(pair, new Integer(idx));
1136 private int getCurrentHighestIndex(HNode node) {
1137 if (!mapHNodeToHighestIndex.containsKey(node)) {
1138 mapHNodeToHighestIndex.put(node, new Integer(-1));
1140 return mapHNodeToHighestIndex.get(node).intValue();
1143 private void updateHighestIndex(HNode node, int idx) {
1144 if (idx > getCurrentHighestIndex(node)) {
1145 mapHNodeToHighestIndex.put(node, new Integer(idx));
1149 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
1150 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
1152 if (mapF2LocName.containsKey(F)) {
1153 return mapF2LocName.get(F);
1156 HNode node = basisSet.getHNode(F);
1158 mapF2LocName.put(F, node.getName());
1159 return node.getName();
1161 if (inputGraph.BASISTOPELEMENT.equals(F)) {
1162 return SSJavaAnalysis.BOTTOM;
1164 String str = "LOC" + (LocationInference.locSeed++);
1165 mapF2LocName.put(F, str);
1171 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
1172 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
1173 Set<Integer> F = iter.next();
1174 mapFtoCount.put(F, 0);
1178 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
1180 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
1181 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
1183 // initialize COUNT(F) to 0 for all elements of the family
1184 resetCount(mapFtoCount, family);
1186 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
1187 Set<Integer> F = iter.next();
1188 Set<HNode> gammaF = family.getGamma(F);
1190 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
1191 curHNodeSet.removeAll(gammaF);
1192 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
1194 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
1195 Set<Integer> B = (Set<Integer>) iterator.next();
1197 Set<Integer> Fprime = new HashSet<Integer>();
1202 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
1204 // if |gamma(F')|==COUNT(F') + |gamma(F)|
1205 int numGammaFprime = family.getGamma(Fprime).size();
1206 int countFprime = mapFtoCount.get(Fprime);
1207 int numGammaF = family.getGamma(F).size();
1208 if (numGammaFprime == (countFprime + numGammaF)) {
1209 // ImSucc(F)=IMSucc(F) union F'
1210 addImSucc(mapImSucc, F, Fprime);
1214 resetCount(mapFtoCount, family);
1217 // System.out.println("mapImSucc=" + mapImSucc);
1222 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
1223 if (!mapImSucc.containsKey(F)) {
1224 mapImSucc.put(F, new HashSet<Set<Integer>>());
1226 return mapImSucc.get(F);
1229 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
1230 Set<Integer> Fprime) {
1232 if (!mapImSucc.containsKey(F)) {
1233 mapImSucc.put(F, new HashSet<Set<Integer>>());
1236 mapImSucc.get(F).add(Fprime);
1240 private Family generateFamily(BasisSet basisSet) {
1242 Family family = new Family();
1244 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
1245 Set<Integer> B = iterator.next();
1247 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
1249 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
1250 Set<Integer> F = iterator2.next();
1252 Set<Integer> Fprime = new HashSet<Integer>();
1256 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
1257 gammaFPrimeSet.addAll(family.getGamma(F));
1258 gammaFPrimeSet.add(basisSet.getHNode(B));
1260 if (!family.containsF(Fprime)) {
1261 Pair<Set<Integer>, Set<HNode>> pair =
1262 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
1263 tobeadded.add(pair);
1265 family.updateGammaF(Fprime, gammaFPrimeSet);
1269 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
1271 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
1272 family.addFElement(pair.getFirst());
1273 family.updateGammaF(pair.getFirst(), pair.getSecond());
1280 private void debug_print(HierarchyGraph inputGraph) {
1281 System.out.println("\nBuild Lattice:" + inputGraph.getName());
1282 System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
1283 System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
1292 public Identifier(HNode n, int i) {
1297 public int hashCode() {
1298 return node.hashCode() + idx;
1301 public boolean equals(Object obj) {
1303 if (obj instanceof Identifier) {
1304 Identifier in = (Identifier) obj;
1305 if (node.equals(in.node) && idx == in.idx) {
1316 public HNode higherNode;
1317 public Set<HNode> lowerNodeSet;
1319 public boolean isShared;
1321 public TripleItem(HNode h, Set<HNode> l, int i) {
1328 public void setShared(boolean in) {
1332 public boolean isShared() {
1336 public int hashCode() {
1339 if (higherNode != null) {
1340 h = higherNode.hashCode();
1347 return h + lowerNodeSet.hashCode() + idx;
1350 public boolean equals(Object obj) {
1352 if (obj instanceof TripleItem) {
1353 TripleItem in = (TripleItem) obj;
1354 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
1355 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx && isShared == in.isShared()) {
1363 public String toString() {
1364 String rtr = higherNode + "-" + idx + "->" + lowerNodeSet;