1 package Analysis.SSJava;
3 import java.util.HashMap;
4 import java.util.HashSet;
5 import java.util.Iterator;
10 import IR.MethodDescriptor;
11 import IR.NameDescriptor;
14 public class BuildLattice {
16 private LocationInference infer;
17 private Map<HNode, TripleItem> mapSharedNodeToTripleItem;
18 private Map<HNode, Integer> mapHNodeToHighestIndex;
20 public BuildLattice(LocationInference infer) {
22 this.mapSharedNodeToTripleItem = new HashMap<HNode, TripleItem>();
23 this.mapHNodeToHighestIndex = new HashMap<HNode, Integer>();
26 public SSJavaLattice<String> buildLattice(Descriptor desc) {
28 HierarchyGraph inputGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
29 LocationSummary locSummary = infer.getLocationSummary(desc);
31 Set<HNode> nodeSetWithCompositeLocation = new HashSet<HNode>();
32 if (desc instanceof MethodDescriptor) {
33 FlowGraph flowGraph = infer.getFlowGraph((MethodDescriptor) desc);
35 for (Iterator iterator = inputGraph.getNodeSet().iterator(); iterator.hasNext();) {
36 HNode hnode = (HNode) iterator.next();
37 Descriptor hnodeDesc = hnode.getDescriptor();
38 if (hnodeDesc != null) {
39 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
40 descTuple.add(hnodeDesc);
42 if (flowGraph.contains(descTuple)) {
43 FlowNode flowNode = flowGraph.getFlowNode(descTuple);
44 if (flowNode.getCompositeLocation() != null) {
45 nodeSetWithCompositeLocation.add(hnode);
54 BasisSet basisSet = inputGraph.computeBasisSet(nodeSetWithCompositeLocation);
55 debug_print(inputGraph);
57 Family family = generateFamily(basisSet);
58 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = coveringGraph(basisSet, family);
60 SSJavaLattice<String> lattice = buildLattice(desc, basisSet, inputGraph, locSummary, mapImSucc);
65 private SSJavaLattice<String> buildLattice(Descriptor desc, BasisSet basisSet,
66 HierarchyGraph inputGraph, LocationSummary locSummary,
67 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
69 SSJavaLattice<String> lattice =
70 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
72 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
74 Set<Set<Integer>> keySet = mapImSucc.keySet();
75 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
76 Set<Integer> higher = (Set<Integer>) iterator.next();
78 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
80 HNode higherNode = inputGraph.getHNode(higherName);
82 if (higherNode == null) {
83 NameDescriptor d = new NameDescriptor(higherName);
84 higherNode = inputGraph.getHNode(d);
85 higherNode.setSkeleton(true);
88 if (higherNode != null && higherNode.isSharedNode()) {
89 lattice.addSharedLoc(higherName);
91 Set<Descriptor> descSet = inputGraph.getDescSetOfNode(higherNode);
92 // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet="
94 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
95 Descriptor d = (Descriptor) iterator2.next();
96 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName);
98 // locSummary.addMapHNodeNameToLocationName(higherName, higherName);
100 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
101 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
102 Set<Integer> lower = (Set<Integer>) iterator2.next();
104 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
105 HNode lowerNode = inputGraph.getHNode(lowerName);
107 if (lowerNode == null && !lowerName.equals(SSJavaAnalysis.BOTTOM)) {
108 NameDescriptor d = new NameDescriptor(lowerName);
109 lowerNode = inputGraph.getHNode(d);
110 lowerNode.setSkeleton(true);
113 if (lowerNode != null && !inputGraph.isDirectlyConnectedTo(higherNode, lowerNode)) {
114 inputGraph.addEdge(higherNode, lowerNode);
117 if (lowerNode != null && lowerNode.isSharedNode()) {
118 lattice.addSharedLoc(lowerName);
121 Set<Descriptor> lowerDescSet = inputGraph.getDescSetOfNode(lowerNode);
122 // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet="
124 for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) {
125 Descriptor d = (Descriptor) iterator3.next();
126 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName);
128 // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
130 if (higher.size() == 0) {
132 lattice.put(lowerName);
134 lattice.addRelationHigherToLower(higherName, lowerName);
141 inputGraph.removeRedundantEdges();
145 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
147 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
149 if (nodeFromSimpleGraph.isSkeleton()) {
150 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
153 Set<HNode> combineSkeletonNodeSet =
154 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
155 HNode combinationNodeInSCGraph =
156 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
157 .get(combineSkeletonNodeSet);
159 // Set<HNode> combineSkeletonNodeSet =
160 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
161 // HNode combinationNodeInSCGraph =
162 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
163 return combinationNodeInSCGraph;
166 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
167 SSJavaLattice<String> skeletonLattice) {
169 mapSharedNodeToTripleItem.clear();
171 HierarchyGraph hierarchyGraph = infer.getSimpleHierarchyGraph(desc);
172 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
173 LocationSummary locSummary = infer.getLocationSummary(desc);
174 SSJavaLattice<String> lattice = skeletonLattice.clone();
175 Set<HNode> visited = new HashSet<HNode>();
176 Set<HNode> scNodeSet = scGraph.getNodeSet();
178 Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
180 for (Iterator iterator = scNodeSet.iterator(); iterator.hasNext();) {
181 HNode scNode = (HNode) iterator.next();
182 Set<HNode> outHierarchyNodeSet = hierarchyGraph.getOutgoingNodeSet(scNode);
183 for (Iterator iterator2 = outHierarchyNodeSet.iterator(); iterator2.hasNext();) {
184 HNode outHierarchyNode = (HNode) iterator2.next();
186 if (!visited.contains(outHierarchyNode)) {
188 if (!outHierarchyNode.isCombinationNode() && !outHierarchyNode.isSkeleton()) {
189 visited.add(outHierarchyNode);
190 Set<HNode> outSCNodeSet = scGraph.getOutgoingNodeSet(scNode);
192 if (outSCNodeSet.size() > 0) {
193 // follows the straight line up to another skeleton/combination node
194 outSCNodeSet = removeTransitivelyReachToNode(desc, scNode, outSCNodeSet);
195 } else if (outSCNodeSet.size() == 0) {
196 // the outNode is (directly/transitively) connected to the bottom node
197 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
198 outSCNodeSet.add(LocationInference.BOTTOMHNODE);
201 recurDFVisitNormalNode(scNode, outSCNodeSet, outHierarchyNode, 1, desc, lattice,
202 visited, locSummary, mapIntermediateLoc);
203 } else if (outHierarchyNode.isCombinationNode()) {
204 visited.add(outHierarchyNode);
205 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary,
215 // add shared locations
216 Set<HNode> sharedNodeSet = mapSharedNodeToTripleItem.keySet();
217 for (Iterator iterator = sharedNodeSet.iterator(); iterator.hasNext();) {
218 HNode sharedNode = (HNode) iterator.next();
219 TripleItem item = mapSharedNodeToTripleItem.get(sharedNode);
220 String nonSharedLocName = mapIntermediateLoc.get(item);
221 // System.out.println("sharedNode=" + sharedNode + " locName=" + nonSharedLocName);
224 if (locSummary.getHNodeNameSetByLatticeLoationName(nonSharedLocName) != null
225 && !lattice.isSharedLoc(nonSharedLocName)) {
226 // need to generate a new shared location in the lattice, which is one level lower than the
227 // 'locName' location
228 newLocName = "ILOC" + (LocationInference.locSeed++);
230 // Set<String> aboveElementSet = getAboveElementSet(lattice, locName);
231 Set<String> belowElementSet = new HashSet<String>();
232 belowElementSet.addAll(lattice.get(nonSharedLocName));
234 // System.out.println("nonSharedLocName=" + nonSharedLocName + " belowElementSet="
235 // + belowElementSet + " newLocName=" + newLocName);
237 lattice.insertNewLocationBetween(nonSharedLocName, belowElementSet, newLocName);
239 newLocName = nonSharedLocName;
242 lattice.addSharedLoc(newLocName);
243 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
244 Set<Descriptor> descSet = graph.getDescSetOfNode(sharedNode);
245 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
246 Descriptor d = (Descriptor) iterator2.next();
247 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), newLocName);
249 locSummary.addMapHNodeNameToLocationName(sharedNode.getName(), newLocName);
256 private void recurDFVisitNormalNode(HNode scStartNode, Set<HNode> scEndNodeSet,
257 HNode curHierarchyNode, int idx, Descriptor desc, SSJavaLattice<String> lattice,
258 Set<HNode> visited, LocationSummary locSummary, Map<TripleItem, String> mapIntermediateLoc) {
260 TripleItem item = new TripleItem(scStartNode, scEndNodeSet, idx);
261 // System.out.println("item=" + item);
262 if (!mapIntermediateLoc.containsKey(item)) {
263 // need to create a new intermediate location in the lattice
264 String newLocName = "ILOC" + (LocationInference.locSeed++);
267 above = scStartNode.getName();
269 int prevIdx = idx - 1;
270 TripleItem prevItem = new TripleItem(scStartNode, scEndNodeSet, prevIdx);
271 above = mapIntermediateLoc.get(prevItem);
274 Set<String> belowSet = new HashSet<String>();
275 for (Iterator iterator = scEndNodeSet.iterator(); iterator.hasNext();) {
276 HNode endNode = (HNode) iterator.next();
278 if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) {
279 locName = locSummary.getLocationName(endNode.getName());
281 locName = endNode.getName();
283 belowSet.add(locName);
285 lattice.insertNewLocationBetween(above, belowSet, newLocName);
287 mapIntermediateLoc.put(item, newLocName);
290 String curLocName = mapIntermediateLoc.get(item);
291 HierarchyGraph hierarchyGraph = infer.getSimpleHierarchyGraph(desc);
293 if (curHierarchyNode.isSharedNode()) {
294 // if the current node is shared location, add a shared location to the lattice later
295 mapSharedNodeToTripleItem.put(curHierarchyNode, item);
297 Set<Descriptor> descSet = hierarchyGraph.getDescSetOfNode(curHierarchyNode);
298 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
299 Descriptor d = (Descriptor) iterator.next();
300 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), curLocName);
302 locSummary.addMapHNodeNameToLocationName(curHierarchyNode.getName(), curLocName);
305 System.out.println("-TripleItem normal=" + item);
306 System.out.println("-curNode=" + curHierarchyNode.getName() + " S="
307 + curHierarchyNode.isSharedNode() + " locName=" + curLocName + " isC="
308 + curHierarchyNode.isCombinationNode());
310 Set<HNode> outSet = hierarchyGraph.getOutgoingNodeSet(curHierarchyNode);
311 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
312 HNode outHierarchyNodeFromCurNode = (HNode) iterator2.next();
314 // Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
315 System.out.println("outHierarchyNodeFromCurNode=" + outHierarchyNodeFromCurNode);
316 // System.out.println("---incomingHNodeSetToOutNode=" + incomingHNodeSetToOutNode);
318 if (outHierarchyNodeFromCurNode.isSkeleton()
319 || outHierarchyNodeFromCurNode.isCombinationNode()) {
320 String lowerLocName = locSummary.getLocationName(outHierarchyNodeFromCurNode.getName());
321 lattice.addRelationHigherToLower(curLocName, lowerLocName);
323 if (visited.containsAll(hierarchyGraph.getIncomingNodeSet(outHierarchyNodeFromCurNode))) {
324 visited.add(outHierarchyNodeFromCurNode);
325 int newidx = getCurrentHighestIndex(outHierarchyNodeFromCurNode, idx + 1);
326 recurDFVisitNormalNode(scStartNode, scEndNodeSet, outHierarchyNodeFromCurNode, newidx,
327 desc, lattice, visited, locSummary, mapIntermediateLoc);
329 System.out.println("NOT RECUR");
330 updateHighestIndex(outHierarchyNodeFromCurNode, idx + 1);
334 // if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
335 // if (visited.containsAll(simpleHierarchyGraph.getIncomingNodeSet(outNode))) {
336 // visited.add(outNode);
337 // int newidx = getCurrentHighestIndex(outNode, idx + 1);
338 // recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
339 // newidx, locSummary, outNode);
340 // // recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
341 // // idx + 1, locSummary, outNode);
343 // updateHighestIndex(outNode, idx + 1);
344 // System.out.println("NOT RECUR");
346 // } else if (!outNode.isSkeleton() && outNode.isCombinationNode() &&
347 // !visited.contains(outNode)) {
348 // if (needToExpandCombinationNode(desc, outNode)) {
349 // System.out.println("NEED TO");
350 // expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
352 // System.out.println("NOT NEED TO");
360 private void recurDFVisitCombinationNode(HNode scCombNode, Set<HNode> scEndNodeSet,
361 HNode curHierarchyCombNode, int idx, Descriptor desc, SSJavaLattice<String> lattice,
362 Set<HNode> visited, LocationSummary locSummary, Map<TripleItem, String> mapIntermediateLoc) {
364 // Descriptor desc, SSJavaLattice<String> lattice,
365 // HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
366 // Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode
369 TripleItem item = new TripleItem(scCombNode, scEndNodeSet, idx);
371 if (!mapIntermediateLoc.containsKey(item)) {
372 // need to create a new intermediate location in the lattice
375 String newLocName = scCombNode.getName();
376 mapIntermediateLoc.put(item, newLocName);
378 String newLocName = "ILOC" + (LocationInference.locSeed++);
379 int prevIdx = idx - 1;
380 TripleItem prevItem = new TripleItem(scCombNode, scEndNodeSet, prevIdx);
381 above = mapIntermediateLoc.get(prevItem);
383 Set<String> belowSet = new HashSet<String>();
384 for (Iterator iterator = scEndNodeSet.iterator(); iterator.hasNext();) {
385 HNode endNode = (HNode) iterator.next();
386 belowSet.add(endNode.getName());
388 lattice.insertNewLocationBetween(above, belowSet, newLocName);
389 mapIntermediateLoc.put(item, newLocName);
394 HierarchyGraph hierarchyNode = infer.getSimpleHierarchyGraph(desc);
395 String locName = mapIntermediateLoc.get(item);
396 if (curHierarchyCombNode.isSharedNode()) {
397 // if the current node is shared location, add a shared location to the lattice later
398 mapSharedNodeToTripleItem.put(curHierarchyCombNode, item);
400 Set<Descriptor> descSet = hierarchyNode.getDescSetOfNode(curHierarchyCombNode);
401 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
402 Descriptor d = (Descriptor) iterator.next();
403 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
405 locSummary.addMapHNodeNameToLocationName(curHierarchyCombNode.getName(), locName);
408 System.out.println("-TripleItem=" + item);
409 System.out.println("-curNode=" + curHierarchyCombNode.getName() + " S="
410 + curHierarchyCombNode.isSharedNode() + " locName=" + locName);
412 Set<HNode> outSet = hierarchyNode.getOutgoingNodeSet(curHierarchyCombNode);
413 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
414 HNode outHierarchyNode = (HNode) iterator2.next();
416 System.out.println("---recurDFS outNode=" + outHierarchyNode);
417 System.out.println("---outNode combinationNodeInSCGraph="
418 + getCombinationNodeInSCGraph(desc, outHierarchyNode));
420 if (outHierarchyNode.isCombinationNode()) {
421 HNode outCombinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, outHierarchyNode);
422 if (outCombinationNodeInSCGraph.equals(scCombNode)) {
424 Set<HNode> combineSkeletonNodeSet =
425 hierarchyNode.getCombineSetByCombinationNode(outHierarchyNode);
426 Set<HNode> incomingHNodeSetToOutNode = hierarchyNode.getIncomingNodeSet(outHierarchyNode);
427 // extract nodes belong to the same combine node
428 Set<HNode> incomingCombinedHNodeSet = new HashSet<HNode>();
429 for (Iterator iterator = incomingHNodeSetToOutNode.iterator(); iterator.hasNext();) {
430 HNode inNode = (HNode) iterator.next();
431 if (combineSkeletonNodeSet.contains(inNode)) {
432 incomingCombinedHNodeSet.add(inNode);
435 System.out.println("incomingCombinedHNodeSet=" + incomingCombinedHNodeSet);
436 if (visited.containsAll(incomingCombinedHNodeSet)) {
437 visited.add(outHierarchyNode);
438 System.out.println("-------curIdx=" + (idx + 1));
439 int newIdx = getCurrentHighestIndex(outHierarchyNode, idx + 1);
440 System.out.println("-------newIdx=" + newIdx);
441 recurDFVisitCombinationNode(scCombNode, scEndNodeSet, outHierarchyNode, newIdx, desc,
442 lattice, visited, locSummary, mapIntermediateLoc);
444 updateHighestIndex(outHierarchyNode, idx + 1);
445 System.out.println("-----NOT RECUR!");
455 private void expandCombinationNode(Descriptor desc, SSJavaLattice<String> lattice,
456 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
459 // expand the combination node 'outNode'
460 // here we need to expand the corresponding combination location in the lattice
461 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
462 Set<HNode> endNodeSet =
463 infer.getSkeletonCombinationHierarchyGraph(desc).getOutgoingNodeSet(
464 combinationNodeInSCGraph);
466 System.out.println("expandCombinationNode=" + cnode + " cnode in scgraph="
467 + combinationNodeInSCGraph);
468 System.out.println("endnodeset=" + endNodeSet);
470 if (combinationNodeInSCGraph == null) {
474 // HierarchyGraph hierarchyGraph = infer.getSimpleHierarchyGraph(desc);
476 // Set<HNode> combineSkeletonNodeSet = hierarchyGraph.getCombineSetByCombinationNode(cnode);
478 // // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
480 // Set<HNode> combinationNodeSet =
481 // hierarchyGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
483 // // System.out.println("combinationNodeSet=" + combinationNodeSet);
485 // Set<HNode> endNodeSetFromSimpleGraph =
486 // hierarchyGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
487 // // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
488 // Set<HNode> endCombNodeSet = new HashSet<HNode>();
489 // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
490 // HNode endNode = (HNode) iterator3.next();
491 // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
496 // follows the straight line up to another skeleton/combination node
497 if (endNodeSet.size() > 0) {
498 // System.out.println("---endCombNodeSet=" + endCombNodeSet);
499 endNodeSet = removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endNodeSet);
501 recurDFVisitCombinationNode(combinationNodeInSCGraph, endNodeSet, cnode, 1, desc, lattice,
502 visited, locSummary, mapIntermediateLoc);
505 endNodeSet.add(LocationInference.BOTTOMHNODE);
506 // System.out.println("---endCombNodeSet is zero");
507 // System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
508 // System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode));
509 recurDFVisitCombinationNode(combinationNodeInSCGraph, endNodeSet, cnode, 1, desc, lattice,
510 visited, locSummary, mapIntermediateLoc);
515 public SSJavaLattice<String> insertIntermediateNodesToStraightLine2(Descriptor desc,
516 SSJavaLattice<String> skeletonLattice) {
518 // perform DFS that starts from each skeleton/combination node and ends by another
519 // skeleton/combination node
521 mapSharedNodeToTripleItem.clear();
523 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
524 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
525 LocationSummary locSummary = infer.getLocationSummary(desc);
527 SSJavaLattice<String> lattice = skeletonLattice.clone();
529 Set<HNode> visited = new HashSet<HNode>();
531 Set<HNode> nodeSet = simpleGraph.getNodeSet();
533 Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
535 // System.out.println("*insert=" + desc);
536 // System.out.println("***nodeSet=" + nodeSet);
537 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
538 HNode node = (HNode) iterator.next();
539 System.out.println("node=" + node);
541 if (node.isSkeleton() && (!visited.contains(node))) {
544 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
545 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
546 HNode outNode = (HNode) iterator2.next();
548 if (!outNode.isSkeleton()) {
549 if (outNode.isCombinationNode()) {
550 if (visited.containsAll(simpleGraph.getIncomingNodeSet(outNode))) {
551 // if (needToExpandCombinationNode(desc, outNode)) {
552 expandCombinationNode3(desc, lattice, visited, mapIntermediateLoc, locSummary,
557 // we have a node that is neither combination or skeleton node
558 // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode);
559 HNode startNode = scGraph.getCurrentHNode(node);
561 // if (node.getDescriptor() != null) {
562 // // node is a skeleton node and it might be merged into another node in the SC
564 // startNode = scGraph.getHNode(node.getDescriptor());
566 // // this node has already been merged before the SC graph.
570 Set<HNode> endNodeSetFromSimpleGraph =
571 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
573 // System.out.println("endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph
574 // + " from=" + outNode);
575 Set<HNode> endCombNodeSet = new HashSet<HNode>();
576 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
577 HNode endNode = (HNode) iterator3.next();
578 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
580 // System.out.println("endCombNodeSet=" + endCombNodeSet);
581 visited.add(outNode);
582 if (endCombNodeSet.size() > 0) {
583 // follows the straight line up to another skeleton/combination node
584 endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
585 } else if (endCombNodeSet.size() == 0) {
586 // the outNode is (directly/transitively) connected to the bottom node
587 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
588 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
591 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
592 mapIntermediateLoc, 1, locSummary, outNode);
598 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
599 && !visited.contains(node)) {
601 System.out.println("n=" + node);
603 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
604 if (simpleGraph.getIncomingNodeSet(node).size() == 0) {
606 // this node will be directly connected to the TOP location
607 // start adding the following nodes from this node
609 Set<HNode> endNodeSetFromSimpleGraph =
610 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
612 Set<HNode> endCombNodeSet = new HashSet<HNode>();
613 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
614 HNode endNode = (HNode) iterator3.next();
615 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
618 System.out.println("endCombNodeSet=" + endCombNodeSet);
619 HNode startNode = LocationInference.TOPHNODE;
620 visited.add(startNode);
621 if (endCombNodeSet.size() > 0) {
622 // follows the straight line up to another skeleton/combination node
623 // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet);
624 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
625 mapIntermediateLoc, 1, locSummary, node);
633 // add shared locations
634 Set<HNode> sharedNodeSet = mapSharedNodeToTripleItem.keySet();
635 for (Iterator iterator = sharedNodeSet.iterator(); iterator.hasNext();) {
636 HNode sharedNode = (HNode) iterator.next();
637 TripleItem item = mapSharedNodeToTripleItem.get(sharedNode);
638 String nonSharedLocName = mapIntermediateLoc.get(item);
639 // System.out.println("sharedNode=" + sharedNode + " locName=" + nonSharedLocName);
642 if (locSummary.getHNodeNameSetByLatticeLoationName(nonSharedLocName) != null
643 && !lattice.isSharedLoc(nonSharedLocName)) {
644 // need to generate a new shared location in the lattice, which is one level lower than the
645 // 'locName' location
646 newLocName = "ILOC" + (LocationInference.locSeed++);
648 // Set<String> aboveElementSet = getAboveElementSet(lattice, locName);
649 Set<String> belowElementSet = new HashSet<String>();
650 belowElementSet.addAll(lattice.get(nonSharedLocName));
652 // System.out.println("nonSharedLocName=" + nonSharedLocName + " belowElementSet="
653 // + belowElementSet + " newLocName=" + newLocName);
655 lattice.insertNewLocationBetween(nonSharedLocName, belowElementSet, newLocName);
657 newLocName = nonSharedLocName;
660 lattice.addSharedLoc(newLocName);
661 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
662 Set<Descriptor> descSet = graph.getDescSetOfNode(sharedNode);
663 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
664 Descriptor d = (Descriptor) iterator2.next();
665 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), newLocName);
667 locSummary.addMapHNodeNameToLocationName(sharedNode.getName(), newLocName);
675 private Set<String> getAboveElementSet(SSJavaLattice<String> lattice, String loc) {
677 Set<String> aboveSet = new HashSet<String>();
679 Map<String, Set<String>> latticeMap = lattice.getTable();
680 Set<String> keySet = latticeMap.keySet();
681 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
682 String key = (String) iterator.next();
683 if (latticeMap.get(key).contains(loc)) {
691 private boolean needToExpandCombinationNode(Descriptor desc, HNode cnode) {
693 System.out.println("needToExpandCombinationNode?=" + cnode);
695 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
696 // HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
697 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
698 Set<HNode> combinationNodeSetInSimpleGraph =
699 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
700 System.out.println("---combinationNodeSetInSimpleGraph=" + combinationNodeSetInSimpleGraph);
701 Set<HNode> inNodeSetToCNode = simpleGraph.getIncomingNodeSet(cnode);
702 System.out.println("------inNodeSetToCNode=" + inNodeSetToCNode);
703 for (Iterator iterator = combinationNodeSetInSimpleGraph.iterator(); iterator.hasNext();) {
704 HNode nodeBelongToTheSameCombinationNode = (HNode) iterator.next();
705 if (inNodeSetToCNode.contains(nodeBelongToTheSameCombinationNode)) {
706 // the combination node 'cnode' is not the highest location among the same combination node
714 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
715 Set<HNode> endNodeSet) {
717 // if an end node is not directly connected to the start node in the SC graph
718 // replace it with a directly connected one which transitively reaches to it.
720 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
722 Set<HNode> newEndNodeSet = new HashSet<HNode>();
723 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
724 HNode endNode = (HNode) iterator.next();
725 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
726 newEndNodeSet.add(endNode);
729 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
730 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
731 newEndNodeSet.add(newEndNode);
735 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
738 return newEndNodeSet;
742 private HNode getDirectlyReachableSCNodeFromEndNode(HierarchyGraph scGraph, HNode startNode,
743 Set<HNode> endNodeSet) {
745 // System.out.println("getDirectlyReachableSCNodeFromEndNode start=" + startNode +
748 Set<HNode> newStartNodeSet = new HashSet<HNode>();
750 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
751 HNode endNode = (HNode) iterator.next();
752 Set<HNode> connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode);
754 for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) {
755 HNode curNode = (HNode) iterator2.next();
756 if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet<HNode>())) {
757 newStartNodeSet.add(curNode);
762 // System.out.println("newStartNodeSet=" + newStartNodeSet);
764 if (newStartNodeSet.size() == 0) {
765 newStartNodeSet.add(startNode);
768 return newStartNodeSet.iterator().next();
771 private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode,
772 HNode curNode, Set<HNode> visited) {
773 // return true if curNode is transitively connected from the startNode
775 boolean isConnected = false;
776 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
777 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
778 HNode in = (HNode) iterator.next();
779 if (in.equals(startNode)) {
783 isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited);
790 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
791 HNode startNode, HNode endNode) {
792 // System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
793 // + " end=" + endNode);
794 Set<HNode> connected = new HashSet<HNode>();
795 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
796 if (connected.size() == 0) {
797 connected.add(endNode);
799 // System.out.println("connected=" + connected);
801 return connected.iterator().next();
804 private void expandCombinationNode3(Descriptor desc, SSJavaLattice<String> lattice,
805 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
808 // expand the combination node 'outNode'
809 // here we need to expand the corresponding combination location in the lattice
810 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
812 System.out.println("expandCombinationNode=" + cnode + " cnode in scgraph="
813 + combinationNodeInSCGraph);
815 if (combinationNodeInSCGraph == null) {
819 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
821 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
823 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
825 Set<HNode> combinationNodeSet =
826 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
828 // System.out.println("combinationNodeSet=" + combinationNodeSet);
830 Set<HNode> endNodeSetFromSimpleGraph =
831 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
832 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
833 Set<HNode> endCombNodeSet = new HashSet<HNode>();
834 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
835 HNode endNode = (HNode) iterator3.next();
836 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
840 // follows the straight line up to another skeleton/combination node
841 if (endCombNodeSet.size() > 0) {
842 // System.out.println("---endCombNodeSet=" + endCombNodeSet);
844 removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
846 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
847 mapIntermediateLoc, 1, locSummary, cnode);
849 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
850 // System.out.println("---endCombNodeSet is zero");
851 // System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
852 // System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode));
853 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
854 mapIntermediateLoc, 1, locSummary, cnode);
860 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
861 HNode startNode, HNode curNode, Set<HNode> connected) {
863 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
864 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
865 HNode inNode = (HNode) iterator.next();
866 if (inNode.equals(startNode)) {
867 connected.add(curNode);
869 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
875 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
876 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
877 int idx, LocationSummary locSummary, HNode curNode) {
879 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
880 // System.out.println("item=" + item);
881 if (!mapIntermediateLoc.containsKey(item)) {
882 // need to create a new intermediate location in the lattice
883 String newLocName = "ILOC" + (LocationInference.locSeed++);
886 above = startNode.getName();
888 int prevIdx = idx - 1;
889 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
890 above = mapIntermediateLoc.get(prevItem);
893 Set<String> belowSet = new HashSet<String>();
894 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
895 HNode endNode = (HNode) iterator.next();
897 if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) {
898 locName = locSummary.getLocationName(endNode.getName());
900 locName = endNode.getName();
902 belowSet.add(locName);
904 lattice.insertNewLocationBetween(above, belowSet, newLocName);
906 mapIntermediateLoc.put(item, newLocName);
909 String locName = mapIntermediateLoc.get(item);
910 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
912 if (curNode.isSharedNode()) {
913 // if the current node is shared location, add a shared location to the lattice later
914 mapSharedNodeToTripleItem.put(curNode, item);
916 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
917 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
918 Descriptor d = (Descriptor) iterator.next();
919 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
921 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
924 System.out.println("-TripleItem normal=" + item);
925 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
926 + " locName=" + locName + " isC=" + curNode.isCombinationNode());
928 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
929 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
930 HNode outNode = (HNode) iterator2.next();
932 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
933 System.out.println("outNode=" + outNode);
934 System.out.println("---incomingHNodeSetToOutNode=" + incomingHNodeSetToOutNode);
936 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
937 if (visited.containsAll(simpleHierarchyGraph.getIncomingNodeSet(outNode))) {
938 visited.add(outNode);
939 int newidx = getCurrentHighestIndex(outNode, idx + 1);
940 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
941 newidx, locSummary, outNode);
942 // recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
943 // idx + 1, locSummary, outNode);
945 updateHighestIndex(outNode, idx + 1);
946 System.out.println("NOT RECUR");
948 } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) {
949 if (needToExpandCombinationNode(desc, outNode)) {
950 System.out.println("NEED TO");
951 expandCombinationNode3(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
953 System.out.println("NOT NEED TO");
961 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
962 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
963 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
965 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
967 if (!mapIntermediateLoc.containsKey(item)) {
968 // need to create a new intermediate location in the lattice
971 String newLocName = combinationNodeInSCGraph.getName();
972 mapIntermediateLoc.put(item, newLocName);
974 String newLocName = "ILOC" + (LocationInference.locSeed++);
975 int prevIdx = idx - 1;
976 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
977 above = mapIntermediateLoc.get(prevItem);
979 Set<String> belowSet = new HashSet<String>();
980 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
981 HNode endNode = (HNode) iterator.next();
982 belowSet.add(endNode.getName());
984 lattice.insertNewLocationBetween(above, belowSet, newLocName);
985 mapIntermediateLoc.put(item, newLocName);
991 // Do we need to skip the combination node and assign a shared location to the next node?
992 // if (idx == 1 && curNode.isSharedNode()) {
993 // System.out.println("THE FIRST COMBINATION NODE EXPANSION IS SHARED!");
994 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, mapIntermediateLoc,
995 // idx + 1, locSummary, curNode);
999 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
1000 String locName = mapIntermediateLoc.get(item);
1001 if (curNode.isSharedNode()) {
1002 // if the current node is shared location, add a shared location to the lattice later
1003 mapSharedNodeToTripleItem.put(curNode, item);
1005 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
1006 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
1007 Descriptor d = (Descriptor) iterator.next();
1008 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
1010 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
1013 System.out.println("-TripleItem=" + item);
1014 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
1015 + " locName=" + locName);
1017 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
1018 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
1019 HNode outNode = (HNode) iterator2.next();
1020 System.out.println("---recurDFS outNode=" + outNode);
1021 System.out.println("---cur combinationNodeInSCGraph=" + combinationNodeInSCGraph);
1022 System.out.println("---outNode combinationNodeInSCGraph="
1023 + getCombinationNodeInSCGraph(desc, outNode));
1025 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
1026 if (outNode.isCombinationNode()) {
1028 Set<HNode> combineSkeletonNodeSet =
1029 simpleHierarchyGraph.getCombineSetByCombinationNode(outNode);
1030 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
1031 // extract nodes belong to the same combine node
1032 Set<HNode> incomingCombinedHNodeSet = new HashSet<HNode>();
1033 for (Iterator iterator = incomingHNodeSetToOutNode.iterator(); iterator.hasNext();) {
1034 HNode inNode = (HNode) iterator.next();
1035 if (combineSkeletonNodeSet.contains(inNode)) {
1036 incomingCombinedHNodeSet.add(inNode);
1039 System.out.println("-----incomingCombinedHNodeSet=" + incomingCombinedHNodeSet);
1041 // check whether the next combination node is different from the current node
1042 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
1043 if (visited.containsAll(incomingCombinedHNodeSet)) {
1044 visited.add(outNode);
1045 System.out.println("-------curIdx=" + (idx + 1));
1046 int newIdx = getCurrentHighestIndex(outNode, idx + 1);
1047 System.out.println("-------newIdx=" + newIdx);
1048 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
1049 mapIntermediateLoc, newIdx, locSummary, outNode);
1050 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
1051 // mapIntermediateLoc, idx + 1, locSummary, outNode);
1053 updateHighestIndex(outNode, idx + 1);
1054 System.out.println("-----NOT RECUR!");
1057 if (needToExpandCombinationNode(desc, outNode)) {
1058 System.out.println("NEED TO");
1059 expandCombinationNode3(desc, lattice, visited, mapIntermediateLoc, locSummary,
1062 System.out.println("NOT NEED TO");
1074 private int getCurrentHighestIndex(HNode node, int curIdx) {
1075 int recordedIdx = getCurrentHighestIndex(node);
1076 if (recordedIdx > curIdx) {
1083 private int getCurrentHighestIndex(HNode node) {
1084 if (!mapHNodeToHighestIndex.containsKey(node)) {
1085 mapHNodeToHighestIndex.put(node, new Integer(-1));
1087 return mapHNodeToHighestIndex.get(node).intValue();
1090 private void updateHighestIndex(HNode node, int idx) {
1091 if (idx > getCurrentHighestIndex(node)) {
1092 mapHNodeToHighestIndex.put(node, new Integer(idx));
1096 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
1097 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
1099 if (mapF2LocName.containsKey(F)) {
1100 return mapF2LocName.get(F);
1103 HNode node = basisSet.getHNode(F);
1105 mapF2LocName.put(F, node.getName());
1106 return node.getName();
1108 if (inputGraph.BASISTOPELEMENT.equals(F)) {
1109 return SSJavaAnalysis.BOTTOM;
1111 String str = "LOC" + (LocationInference.locSeed++);
1112 mapF2LocName.put(F, str);
1118 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
1119 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
1120 Set<Integer> F = iter.next();
1121 mapFtoCount.put(F, 0);
1125 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
1127 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
1128 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
1130 // initialize COUNT(F) to 0 for all elements of the family
1131 resetCount(mapFtoCount, family);
1133 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
1134 Set<Integer> F = iter.next();
1135 Set<HNode> gammaF = family.getGamma(F);
1137 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
1138 curHNodeSet.removeAll(gammaF);
1139 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
1141 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
1142 Set<Integer> B = (Set<Integer>) iterator.next();
1144 Set<Integer> Fprime = new HashSet<Integer>();
1149 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
1151 // if |gamma(F')|==COUNT(F') + |gamma(F)|
1152 int numGammaFprime = family.getGamma(Fprime).size();
1153 int countFprime = mapFtoCount.get(Fprime);
1154 int numGammaF = family.getGamma(F).size();
1155 if (numGammaFprime == (countFprime + numGammaF)) {
1156 // ImSucc(F)=IMSucc(F) union F'
1157 addImSucc(mapImSucc, F, Fprime);
1161 resetCount(mapFtoCount, family);
1164 // System.out.println("mapImSucc=" + mapImSucc);
1169 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
1170 if (!mapImSucc.containsKey(F)) {
1171 mapImSucc.put(F, new HashSet<Set<Integer>>());
1173 return mapImSucc.get(F);
1176 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
1177 Set<Integer> Fprime) {
1179 if (!mapImSucc.containsKey(F)) {
1180 mapImSucc.put(F, new HashSet<Set<Integer>>());
1183 mapImSucc.get(F).add(Fprime);
1187 private Family generateFamily(BasisSet basisSet) {
1189 Family family = new Family();
1191 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
1192 Set<Integer> B = iterator.next();
1194 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
1196 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
1197 Set<Integer> F = iterator2.next();
1199 Set<Integer> Fprime = new HashSet<Integer>();
1203 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
1204 gammaFPrimeSet.addAll(family.getGamma(F));
1205 gammaFPrimeSet.add(basisSet.getHNode(B));
1207 if (!family.containsF(Fprime)) {
1208 Pair<Set<Integer>, Set<HNode>> pair =
1209 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
1210 tobeadded.add(pair);
1212 family.updateGammaF(Fprime, gammaFPrimeSet);
1216 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
1218 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
1219 family.addFElement(pair.getFirst());
1220 family.updateGammaF(pair.getFirst(), pair.getSecond());
1227 private void debug_print(HierarchyGraph inputGraph) {
1228 System.out.println("\nBuild Lattice:" + inputGraph.getName());
1229 // System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
1230 // System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
1239 public Identifier(HNode n, int i) {
1244 public int hashCode() {
1245 return node.hashCode() + idx;
1248 public boolean equals(Object obj) {
1250 if (obj instanceof Identifier) {
1251 Identifier in = (Identifier) obj;
1252 if (node.equals(in.node) && idx == in.idx) {
1263 public HNode higherNode;
1264 public Set<HNode> lowerNodeSet;
1266 public boolean isShared;
1268 public TripleItem(HNode h, Set<HNode> l, int i) {
1275 public void setShared(boolean in) {
1279 public boolean isShared() {
1283 public int hashCode() {
1286 if (higherNode != null) {
1287 h = higherNode.hashCode();
1294 return h + lowerNodeSet.hashCode() + idx;
1297 public boolean equals(Object obj) {
1299 if (obj instanceof TripleItem) {
1300 TripleItem in = (TripleItem) obj;
1301 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
1302 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx && isShared == in.isShared()) {
1310 public String toString() {
1311 String rtr = higherNode + "-" + idx + "->" + lowerNodeSet;