1 package Analysis.SSJava;
3 import java.util.HashMap;
4 import java.util.HashSet;
5 import java.util.Iterator;
10 import IR.MethodDescriptor;
13 public class BuildLattice {
15 private LocationInference infer;
17 public BuildLattice(LocationInference infer) {
21 public SSJavaLattice<String> buildLattice(Descriptor desc) {
23 HierarchyGraph inputGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
24 LocationSummary locSummary = infer.getLocationSummary(desc);
26 Set<HNode> nodeSetWithCompositeLocation = new HashSet<HNode>();
27 if (desc instanceof MethodDescriptor) {
28 FlowGraph flowGraph = infer.getFlowGraph((MethodDescriptor) desc);
30 for (Iterator iterator = inputGraph.getNodeSet().iterator(); iterator.hasNext();) {
31 HNode hnode = (HNode) iterator.next();
32 Descriptor hnodeDesc = hnode.getDescriptor();
33 if (hnodeDesc != null) {
34 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
35 descTuple.add(hnodeDesc);
37 if (flowGraph.contains(descTuple)) {
38 FlowNode flowNode = flowGraph.getFlowNode(descTuple);
39 if (flowNode.getCompositeLocation() != null) {
40 nodeSetWithCompositeLocation.add(hnode);
49 BasisSet basisSet = inputGraph.computeBasisSet(nodeSetWithCompositeLocation);
50 debug_print(inputGraph);
52 Family family = generateFamily(basisSet);
53 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = coveringGraph(basisSet, family);
55 SSJavaLattice<String> lattice = buildLattice(basisSet, inputGraph, locSummary, mapImSucc);
60 private SSJavaLattice<String> buildLattice(BasisSet basisSet, HierarchyGraph inputGraph,
61 LocationSummary locSummary, Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
63 SSJavaLattice<String> lattice =
64 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
66 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
68 Set<Set<Integer>> keySet = mapImSucc.keySet();
69 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
70 Set<Integer> higher = (Set<Integer>) iterator.next();
72 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
74 HNode higherNode = inputGraph.getHNode(higherName);
75 if (higherNode != null && higherNode.isSharedNode()) {
76 lattice.addSharedLoc(higherName);
78 Set<Descriptor> descSet = inputGraph.getDescSetOfNode(higherNode);
79 // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet="
81 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
82 Descriptor d = (Descriptor) iterator2.next();
83 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName);
85 // locSummary.addMapHNodeNameToLocationName(higherName, higherName);
87 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
88 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
89 Set<Integer> lower = (Set<Integer>) iterator2.next();
91 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
92 HNode lowerNode = inputGraph.getHNode(lowerName);
93 if (lowerNode != null && lowerNode.isSharedNode()) {
94 lattice.addSharedLoc(lowerName);
97 Set<Descriptor> lowerDescSet = inputGraph.getDescSetOfNode(lowerNode);
98 // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet="
100 for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) {
101 Descriptor d = (Descriptor) iterator3.next();
102 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName);
104 // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
106 if (higher.size() == 0) {
108 lattice.put(lowerName);
110 lattice.addRelationHigherToLower(higherName, lowerName);
120 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
122 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
124 if (nodeFromSimpleGraph.isSkeleton()) {
125 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
128 Set<HNode> combineSkeletonNodeSet =
129 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
130 HNode combinationNodeInSCGraph =
131 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
132 .get(combineSkeletonNodeSet);
134 // Set<HNode> combineSkeletonNodeSet =
135 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
136 // HNode combinationNodeInSCGraph =
137 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
138 return combinationNodeInSCGraph;
141 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
142 SSJavaLattice<String> skeletonLattice) {
144 // perform DFS that starts from each skeleton/combination node and ends by another
145 // skeleton/combination node
147 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
148 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
149 LocationSummary locSummary = infer.getLocationSummary(desc);
151 SSJavaLattice<String> lattice = skeletonLattice.clone();
153 Set<HNode> visited = new HashSet<HNode>();
155 Set<HNode> nodeSet = simpleGraph.getNodeSet();
157 Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
159 System.out.println("*insert=" + desc);
160 System.out.println("***nodeSet=" + nodeSet);
161 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
162 HNode node = (HNode) iterator.next();
163 System.out.println("node=" + node);
165 if (node.isSkeleton() && (!visited.contains(node))) {
168 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
169 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
170 HNode outNode = (HNode) iterator2.next();
172 if (!outNode.isSkeleton()) {
173 if (outNode.isCombinationNode()) {
174 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
176 // we have a node that is neither combination or skeleton node
177 // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode);
178 HNode startNode = scGraph.getCurrentHNode(node);
180 // if (node.getDescriptor() != null) {
181 // // node is a skeleton node and it might be merged into another node in the SC
183 // startNode = scGraph.getHNode(node.getDescriptor());
185 // // this node has already been merged before the SC graph.
189 Set<HNode> endNodeSetFromSimpleGraph =
190 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
192 // System.out.println("endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph
193 // + " from=" + outNode);
194 Set<HNode> endCombNodeSet = new HashSet<HNode>();
195 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
196 HNode endNode = (HNode) iterator3.next();
197 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
199 // System.out.println("endCombNodeSet=" + endCombNodeSet);
200 visited.add(outNode);
201 if (endCombNodeSet.size() > 0) {
202 // follows the straight line up to another skeleton/combination node
203 endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
204 } else if (endCombNodeSet.size() == 0) {
205 // the outNode is (directly/transitively) connected to the bottom node
206 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
207 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
210 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
211 mapIntermediateLoc, 1, locSummary, outNode);
217 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
218 && !visited.contains(node)) {
220 System.out.println("n=" + node);
222 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
223 if (simpleGraph.getIncomingNodeSet(node).size() == 0) {
225 // this node will be directly connected to the TOP location
226 // start adding the following nodes from this node
228 Set<HNode> endNodeSetFromSimpleGraph =
229 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
231 Set<HNode> endCombNodeSet = new HashSet<HNode>();
232 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
233 HNode endNode = (HNode) iterator3.next();
234 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
237 System.out.println("endCombNodeSet=" + endCombNodeSet);
238 HNode startNode = LocationInference.TOPHNODE;
239 visited.add(startNode);
240 if (endCombNodeSet.size() > 0) {
241 // follows the straight line up to another skeleton/combination node
242 // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet);
243 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
244 mapIntermediateLoc, 1, locSummary, node);
256 private void expandCombinationNode(Descriptor desc, SSJavaLattice<String> lattice,
257 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
260 System.out.println("expandCombinationNode=" + cnode);
261 // expand the combination node 'outNode'
262 // here we need to expand the corresponding combination location in the lattice
263 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
265 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
267 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
269 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
271 Set<HNode> combinationNodeSet =
272 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
274 // System.out.println("combinationNodeSet=" + combinationNodeSet);
276 Set<HNode> endNodeSetFromSimpleGraph =
277 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
278 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
279 Set<HNode> endCombNodeSet = new HashSet<HNode>();
280 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
281 HNode endNode = (HNode) iterator3.next();
282 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
286 // follows the straight line up to another skeleton/combination node
287 if (endCombNodeSet.size() > 0) {
288 System.out.println("---endCombNodeSet=" + endCombNodeSet);
290 removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
292 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
293 mapIntermediateLoc, 1, locSummary, cnode);
295 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
296 // System.out.println("---endCombNodeSet is zero");
297 // System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
298 // System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode));
299 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
300 mapIntermediateLoc, 1, locSummary, cnode);
306 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
307 Set<HNode> endNodeSet) {
309 // if an end node is not directly connected to the start node in the SC graph
310 // replace it with a directly connected one which transitively reaches to it.
312 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
314 Set<HNode> newEndNodeSet = new HashSet<HNode>();
315 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
316 HNode endNode = (HNode) iterator.next();
317 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
318 newEndNodeSet.add(endNode);
321 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
322 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
323 newEndNodeSet.add(newEndNode);
327 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
330 return newEndNodeSet;
334 private HNode getDirectlyReachableSCNodeFromEndNode(HierarchyGraph scGraph, HNode startNode,
335 Set<HNode> endNodeSet) {
337 System.out.println("getDirectlyReachableSCNodeFromEndNode start=" + startNode + " endNodeSet="
339 Set<HNode> newStartNodeSet = new HashSet<HNode>();
341 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
342 HNode endNode = (HNode) iterator.next();
343 Set<HNode> connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode);
345 for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) {
346 HNode curNode = (HNode) iterator2.next();
347 if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet<HNode>())) {
348 newStartNodeSet.add(curNode);
353 System.out.println("newStartNodeSet=" + newStartNodeSet);
355 if (newStartNodeSet.size() == 0) {
356 newStartNodeSet.add(startNode);
359 return newStartNodeSet.iterator().next();
362 private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode,
363 HNode curNode, Set<HNode> visited) {
364 // return true if curNode is transitively connected from the startNode
366 boolean isConnected = false;
367 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
368 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
369 HNode in = (HNode) iterator.next();
370 if (in.equals(startNode)) {
374 isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited);
381 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
382 HNode startNode, HNode endNode) {
383 System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
384 + " end=" + endNode);
385 Set<HNode> connected = new HashSet<HNode>();
386 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
387 if (connected.size() == 0) {
388 connected.add(endNode);
390 System.out.println("connected=" + connected);
392 return connected.iterator().next();
395 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
396 HNode startNode, HNode curNode, Set<HNode> connected) {
398 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
399 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
400 HNode inNode = (HNode) iterator.next();
401 if (inNode.equals(startNode)) {
402 connected.add(curNode);
404 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
410 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
411 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
412 int idx, LocationSummary locSummary, HNode curNode) {
414 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
415 // System.out.println("item=" + item);
416 if (!mapIntermediateLoc.containsKey(item)) {
417 // need to create a new intermediate location in the lattice
418 String newLocName = "ILOC" + (LocationInference.locSeed++);
421 above = startNode.getName();
423 int prevIdx = idx - 1;
424 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
425 above = mapIntermediateLoc.get(prevItem);
428 Set<String> belowSet = new HashSet<String>();
429 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
430 HNode endNode = (HNode) iterator.next();
432 if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) {
433 locName = locSummary.getLocationName(endNode.getName());
435 locName = endNode.getName();
437 belowSet.add(locName);
439 lattice.insertNewLocationBetween(above, belowSet, newLocName);
441 mapIntermediateLoc.put(item, newLocName);
444 String locName = mapIntermediateLoc.get(item);
446 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
448 Set<Descriptor> descSet = graph.getDescSetOfNode(curNode);
449 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
450 Descriptor d = (Descriptor) iterator.next();
451 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
453 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
455 if (curNode.isSharedNode()) {
456 lattice.addSharedLoc(locName);
459 System.out.println("-TripleItem=" + item);
460 System.out.println("-curNode=" + curNode.getName() + " locName=" + locName);
462 Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
463 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
464 HNode outNode = (HNode) iterator2.next();
465 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
466 visited.add(outNode);
467 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
468 idx + 1, locSummary, outNode);
469 } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) {
470 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
476 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
477 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
478 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
480 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
482 if (!mapIntermediateLoc.containsKey(item)) {
483 // need to create a new intermediate location in the lattice
486 String newLocName = combinationNodeInSCGraph.getName();
487 mapIntermediateLoc.put(item, newLocName);
489 String newLocName = "ILOC" + (LocationInference.locSeed++);
490 int prevIdx = idx - 1;
491 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
492 above = mapIntermediateLoc.get(prevItem);
494 Set<String> belowSet = new HashSet<String>();
495 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
496 HNode endNode = (HNode) iterator.next();
497 belowSet.add(endNode.getName());
499 lattice.insertNewLocationBetween(above, belowSet, newLocName);
500 mapIntermediateLoc.put(item, newLocName);
506 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
507 String locName = mapIntermediateLoc.get(item);
508 Set<Descriptor> descSet = graph.getDescSetOfNode(curNode);
509 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
510 Descriptor d = (Descriptor) iterator.next();
511 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
513 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
515 if (curNode.isSharedNode()) {
516 lattice.addSharedLoc(locName);
518 System.out.println("-TripleItem=" + item);
519 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
520 + " locName=" + locName);
522 Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
523 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
524 HNode outNode = (HNode) iterator2.next();
525 // System.out.println("recurDFS outNode=" + outNode);
526 // System.out.println("---cur combinationNodeInSCGraph=" + combinationNodeInSCGraph);
527 // System.out.println("---outNode combinationNodeInSCGraph="
528 // + getCombinationNodeInSCGraph(desc, outNode));
529 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
530 if (outNode.isCombinationNode()) {
531 // check whether the next combination node is different from the current node
532 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
533 visited.add(outNode);
534 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
535 mapIntermediateLoc, idx + 1, locSummary, outNode);
537 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
546 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
547 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
549 if (mapF2LocName.containsKey(F)) {
550 return mapF2LocName.get(F);
553 HNode node = basisSet.getHNode(F);
555 mapF2LocName.put(F, node.getName());
556 return node.getName();
558 if (inputGraph.BASISTOPELEMENT.equals(F)) {
559 return SSJavaAnalysis.BOTTOM;
561 String str = "LOC" + (LocationInference.locSeed++);
562 mapF2LocName.put(F, str);
568 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
569 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
570 Set<Integer> F = iter.next();
571 mapFtoCount.put(F, 0);
575 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
577 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
578 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
580 // initialize COUNT(F) to 0 for all elements of the family
581 resetCount(mapFtoCount, family);
583 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
584 Set<Integer> F = iter.next();
585 Set<HNode> gammaF = family.getGamma(F);
587 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
588 curHNodeSet.removeAll(gammaF);
589 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
591 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
592 Set<Integer> B = (Set<Integer>) iterator.next();
594 Set<Integer> Fprime = new HashSet<Integer>();
599 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
601 // if |gamma(F')|==COUNT(F') + |gamma(F)|
602 int numGammaFprime = family.getGamma(Fprime).size();
603 int countFprime = mapFtoCount.get(Fprime);
604 int numGammaF = family.getGamma(F).size();
605 if (numGammaFprime == (countFprime + numGammaF)) {
606 // ImSucc(F)=IMSucc(F) union F'
607 addImSucc(mapImSucc, F, Fprime);
611 resetCount(mapFtoCount, family);
614 // System.out.println("mapImSucc=" + mapImSucc);
619 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
620 if (!mapImSucc.containsKey(F)) {
621 mapImSucc.put(F, new HashSet<Set<Integer>>());
623 return mapImSucc.get(F);
626 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
627 Set<Integer> Fprime) {
629 if (!mapImSucc.containsKey(F)) {
630 mapImSucc.put(F, new HashSet<Set<Integer>>());
633 mapImSucc.get(F).add(Fprime);
637 private Family generateFamily(BasisSet basisSet) {
639 Family family = new Family();
641 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
642 Set<Integer> B = iterator.next();
644 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
646 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
647 Set<Integer> F = iterator2.next();
649 Set<Integer> Fprime = new HashSet<Integer>();
653 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
654 gammaFPrimeSet.addAll(family.getGamma(F));
655 gammaFPrimeSet.add(basisSet.getHNode(B));
657 if (!family.containsF(Fprime)) {
658 Pair<Set<Integer>, Set<HNode>> pair =
659 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
662 family.updateGammaF(Fprime, gammaFPrimeSet);
666 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
668 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
669 family.addFElement(pair.getFirst());
670 family.updateGammaF(pair.getFirst(), pair.getSecond());
677 private void debug_print(HierarchyGraph inputGraph) {
678 System.out.println("\nBuild Lattice:" + inputGraph.getName());
679 // System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
680 // System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
689 public Identifier(HNode n, int i) {
694 public int hashCode() {
695 return node.hashCode() + idx;
698 public boolean equals(Object obj) {
700 if (obj instanceof Identifier) {
701 Identifier in = (Identifier) obj;
702 if (node.equals(in.node) && idx == in.idx) {
713 public HNode higherNode;
714 public Set<HNode> lowerNodeSet;
717 public TripleItem(HNode h, Set<HNode> l, int i) {
723 public int hashCode() {
726 if (higherNode != null) {
727 h = higherNode.hashCode();
730 return h + lowerNodeSet.hashCode() + idx;
733 public boolean equals(Object obj) {
735 if (obj instanceof TripleItem) {
736 TripleItem in = (TripleItem) obj;
737 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
738 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx) {
746 public String toString() {
747 return higherNode + "-" + idx + "->" + lowerNodeSet;