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 private final HNode topNode;
18 private final HNode bottomNode;
20 public BuildLattice(LocationInference infer) {
22 topNode = new HNode(infer.ssjava.TOP);
23 bottomNode = new HNode(infer.ssjava.BOTTOM);
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(basisSet, inputGraph, locSummary, mapImSucc);
65 private SSJavaLattice<String> buildLattice(BasisSet basisSet, HierarchyGraph inputGraph,
66 LocationSummary locSummary, Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
68 SSJavaLattice<String> lattice =
69 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
71 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
73 Set<Set<Integer>> keySet = mapImSucc.keySet();
74 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
75 Set<Integer> higher = (Set<Integer>) iterator.next();
77 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
79 HNode higherNode = inputGraph.getHNode(higherName);
80 if (higherNode != null && higherNode.isSharedNode()) {
81 lattice.addSharedLoc(higherName);
83 Set<Descriptor> descSet = inputGraph.getDescSetOfNode(higherNode);
84 // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet="
86 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
87 Descriptor d = (Descriptor) iterator2.next();
88 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName);
90 // locSummary.addMapHNodeNameToLocationName(higherName, higherName);
92 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
93 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
94 Set<Integer> lower = (Set<Integer>) iterator2.next();
96 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
97 HNode lowerNode = inputGraph.getHNode(lowerName);
98 if (lowerNode != null && lowerNode.isSharedNode()) {
99 lattice.addSharedLoc(lowerName);
102 Set<Descriptor> lowerDescSet = inputGraph.getDescSetOfNode(lowerNode);
103 // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet="
105 for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) {
106 Descriptor d = (Descriptor) iterator3.next();
107 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName);
109 // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
111 if (higher.size() == 0) {
113 lattice.put(lowerName);
115 lattice.addRelationHigherToLower(higherName, lowerName);
125 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
127 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
129 if (nodeFromSimpleGraph.isSkeleton()) {
130 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
133 Set<HNode> combineSkeletonNodeSet =
134 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
135 HNode combinationNodeInSCGraph =
136 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
137 .get(combineSkeletonNodeSet);
139 // Set<HNode> combineSkeletonNodeSet =
140 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
141 // HNode combinationNodeInSCGraph =
142 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
143 return combinationNodeInSCGraph;
146 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
147 SSJavaLattice<String> skeletonLattice) {
149 // perform DFS that starts from each skeleton/combination node and ends by another
150 // skeleton/combination node
152 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
153 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
154 LocationSummary locSummary = infer.getLocationSummary(desc);
156 SSJavaLattice<String> lattice = skeletonLattice.clone();
158 Set<HNode> visited = new HashSet<HNode>();
160 Set<HNode> nodeSet = simpleGraph.getNodeSet();
162 Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
164 System.out.println("*insert=" + desc);
165 System.out.println("***nodeSet=" + nodeSet);
166 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
167 HNode node = (HNode) iterator.next();
168 System.out.println("node=" + node);
169 if (node.isSkeleton() && (!visited.contains(node))) {
172 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
173 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
174 HNode outNode = (HNode) iterator2.next();
176 if (!outNode.isSkeleton()) {
177 if (outNode.isCombinationNode()) {
178 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
180 // we have a node that is neither combination or skeleton node
181 // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode);
182 HNode startNode = scGraph.getCurrentHNode(node);
184 // if (node.getDescriptor() != null) {
185 // // node is a skeleton node and it might be merged into another node in the SC
187 // startNode = scGraph.getHNode(node.getDescriptor());
189 // // this node has already been merged before the SC graph.
193 Set<HNode> endNodeSetFromSimpleGraph =
194 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
196 // System.out.println("endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph
197 // + " from=" + outNode);
198 Set<HNode> endCombNodeSet = new HashSet<HNode>();
199 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
200 HNode endNode = (HNode) iterator3.next();
201 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
203 // System.out.println("endCombNodeSet=" + endCombNodeSet);
204 visited.add(outNode);
205 if (endCombNodeSet.size() > 0) {
206 // follows the straight line up to another skeleton/combination node
207 // endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
208 } else if (endCombNodeSet.size() == 0) {
209 // the outNode is (directly/transitively) connected to the bottom node
210 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
211 endCombNodeSet.add(bottomNode);
214 startNode = refineStartNode(desc, startNode, endCombNodeSet);
216 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
217 mapIntermediateLoc, 1, locSummary, outNode);
223 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
224 && !visited.contains(node)) {
226 System.out.println("n=" + node);
228 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
229 int sizeIncomingNode = simpleGraph.getIncomingNodeSet(node).size();
231 if (sizeIncomingNode == 0) {
232 // this node will be directly connected to the TOP location
233 // start adding the following nodes from this node
235 Set<HNode> endNodeSetFromSimpleGraph =
236 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
238 Set<HNode> endCombNodeSet = new HashSet<HNode>();
239 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
240 HNode endNode = (HNode) iterator3.next();
241 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
244 HNode startNode = topNode;
245 visited.add(startNode);
246 if (endCombNodeSet.size() > 0) {
247 // follows the straight line up to another skeleton/combination node
248 // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet);
249 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
250 mapIntermediateLoc, 1, locSummary, node);
262 private void expandCombinationNode(Descriptor desc, SSJavaLattice<String> lattice,
263 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
266 // expand the combination node 'outNode'
267 // here we need to expand the corresponding combination location in the lattice
268 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
270 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
272 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
274 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
276 Set<HNode> combinationNodeSet =
277 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
279 // System.out.println("combinationNodeSet=" + combinationNodeSet);
281 Set<HNode> endNodeSetFromSimpleGraph =
282 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
283 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
284 Set<HNode> endCombNodeSet = new HashSet<HNode>();
285 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
286 HNode endNode = (HNode) iterator3.next();
287 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
291 // follows the straight line up to another skeleton/combination node
292 if (endCombNodeSet.size() > 0) {
293 System.out.println("---endCombNodeSet=" + endCombNodeSet);
295 // removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
297 combinationNodeInSCGraph = refineStartNode(desc, combinationNodeInSCGraph, endCombNodeSet);
299 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
300 mapIntermediateLoc, 1, locSummary, cnode);
302 endCombNodeSet.add(bottomNode);
303 System.out.println("---endCombNodeSet is zero");
304 System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
305 System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode));
306 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
307 mapIntermediateLoc, 1, locSummary, cnode);
313 private HNode refineStartNode(Descriptor desc, HNode startNode, Set<HNode> endNodeSet) {
315 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
317 HNode newStartNode = getDirectlyReachableSCNodeFromEndNode(scGraph, startNode, endNodeSet);
319 System.out.println("---removeTransitivelyReachToNode2 startNode=" + startNode + " old="
320 + endNodeSet + " newStartNode=" + newStartNode);
326 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
327 Set<HNode> endNodeSet) {
329 // if an end node is not directly connected to the start node in the SC graph
330 // replace it with a directly connected one which transitively reaches to it.
332 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
334 Set<HNode> newEndNodeSet = new HashSet<HNode>();
335 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
336 HNode endNode = (HNode) iterator.next();
337 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
338 newEndNodeSet.add(endNode);
341 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
342 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
343 newEndNodeSet.add(newEndNode);
347 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
350 return newEndNodeSet;
354 private HNode getDirectlyReachableSCNodeFromEndNode(HierarchyGraph scGraph, HNode startNode,
355 Set<HNode> endNodeSet) {
357 System.out.println("getDirectlyReachableSCNodeFromEndNode start=" + startNode + " endNodeSet="
359 Set<HNode> newStartNodeSet = new HashSet<HNode>();
361 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
362 HNode endNode = (HNode) iterator.next();
363 Set<HNode> connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode);
365 for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) {
366 HNode curNode = (HNode) iterator2.next();
367 if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet<HNode>())) {
368 newStartNodeSet.add(curNode);
373 System.out.println("newStartNodeSet=" + newStartNodeSet);
375 if (newStartNodeSet.size() == 0) {
376 newStartNodeSet.add(startNode);
379 return newStartNodeSet.iterator().next();
382 private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode,
383 HNode curNode, Set<HNode> visited) {
384 // return true if curNode is transitively connected from the startNode
386 boolean isConnected = false;
387 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
388 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
389 HNode in = (HNode) iterator.next();
390 if (in.equals(startNode)) {
394 isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited);
401 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
402 HNode startNode, HNode endNode) {
403 System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
404 + " end=" + endNode);
405 Set<HNode> connected = new HashSet<HNode>();
406 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
407 if (connected.size() == 0) {
408 connected.add(endNode);
410 System.out.println("connected=" + connected);
412 return connected.iterator().next();
415 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
416 HNode startNode, HNode curNode, Set<HNode> connected) {
418 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
419 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
420 HNode inNode = (HNode) iterator.next();
421 if (inNode.equals(startNode)) {
422 connected.add(curNode);
424 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
430 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
431 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
432 int idx, LocationSummary locSummary, HNode curNode) {
434 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
435 // System.out.println("item=" + item);
436 if (!mapIntermediateLoc.containsKey(item)) {
437 // need to create a new intermediate location in the lattice
438 String newLocName = "ILOC" + (LocationInference.locSeed++);
441 above = startNode.getName();
443 int prevIdx = idx - 1;
444 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
445 above = mapIntermediateLoc.get(prevItem);
448 Set<String> belowSet = new HashSet<String>();
449 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
450 HNode endNode = (HNode) iterator.next();
451 belowSet.add(endNode.getName());
454 lattice.insertNewLocationBetween(above, belowSet, newLocName);
456 mapIntermediateLoc.put(item, newLocName);
459 String locName = mapIntermediateLoc.get(item);
461 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
463 Set<Descriptor> descSet = graph.getDescSetOfNode(curNode);
464 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
465 Descriptor d = (Descriptor) iterator.next();
466 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
468 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
470 if (curNode.isSharedNode()) {
471 lattice.addSharedLoc(locName);
474 System.out.println("-TripleItem=" + item);
475 System.out.println("-curNode=" + curNode.getName() + " locName=" + locName);
477 Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
478 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
479 HNode outNode = (HNode) iterator2.next();
480 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
481 visited.add(outNode);
482 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
483 idx + 1, locSummary, outNode);
484 } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) {
485 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
491 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
492 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
493 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
495 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
497 if (!mapIntermediateLoc.containsKey(item)) {
498 // need to create a new intermediate location in the lattice
501 String newLocName = combinationNodeInSCGraph.getName();
502 mapIntermediateLoc.put(item, newLocName);
504 String newLocName = "ILOC" + (LocationInference.locSeed++);
505 int prevIdx = idx - 1;
506 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
507 above = mapIntermediateLoc.get(prevItem);
509 Set<String> belowSet = new HashSet<String>();
510 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
511 HNode endNode = (HNode) iterator.next();
512 belowSet.add(endNode.getName());
514 lattice.insertNewLocationBetween(above, belowSet, newLocName);
515 mapIntermediateLoc.put(item, newLocName);
521 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
522 String locName = mapIntermediateLoc.get(item);
523 Set<Descriptor> descSet = graph.getDescSetOfNode(curNode);
524 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
525 Descriptor d = (Descriptor) iterator.next();
526 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
528 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
530 // System.out.println("-TripleItem=" + item);
531 // System.out.println("-curNode=" + curNode.getName() + " locName=" + locName);
533 Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
534 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
535 HNode outNode = (HNode) iterator2.next();
536 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
537 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
538 visited.add(outNode);
539 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
540 mapIntermediateLoc, idx + 1, locSummary, outNode);
547 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
548 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
550 if (mapF2LocName.containsKey(F)) {
551 return mapF2LocName.get(F);
554 HNode node = basisSet.getHNode(F);
556 mapF2LocName.put(F, node.getName());
557 return node.getName();
559 if (inputGraph.BASISTOPELEMENT.equals(F)) {
560 return SSJavaAnalysis.BOTTOM;
562 String str = "LOC" + (LocationInference.locSeed++);
563 mapF2LocName.put(F, str);
569 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
570 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
571 Set<Integer> F = iter.next();
572 mapFtoCount.put(F, 0);
576 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
578 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
579 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
581 // initialize COUNT(F) to 0 for all elements of the family
582 resetCount(mapFtoCount, family);
584 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
585 Set<Integer> F = iter.next();
586 Set<HNode> gammaF = family.getGamma(F);
588 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
589 curHNodeSet.removeAll(gammaF);
590 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
592 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
593 Set<Integer> B = (Set<Integer>) iterator.next();
595 Set<Integer> Fprime = new HashSet<Integer>();
600 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
602 // if |gamma(F')|==COUNT(F') + |gamma(F)|
603 int numGammaFprime = family.getGamma(Fprime).size();
604 int countFprime = mapFtoCount.get(Fprime);
605 int numGammaF = family.getGamma(F).size();
606 if (numGammaFprime == (countFprime + numGammaF)) {
607 // ImSucc(F)=IMSucc(F) union F'
608 addImSucc(mapImSucc, F, Fprime);
612 resetCount(mapFtoCount, family);
615 // System.out.println("mapImSucc=" + mapImSucc);
620 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
621 if (!mapImSucc.containsKey(F)) {
622 mapImSucc.put(F, new HashSet<Set<Integer>>());
624 return mapImSucc.get(F);
627 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
628 Set<Integer> Fprime) {
630 if (!mapImSucc.containsKey(F)) {
631 mapImSucc.put(F, new HashSet<Set<Integer>>());
634 mapImSucc.get(F).add(Fprime);
638 private Family generateFamily(BasisSet basisSet) {
640 Family family = new Family();
642 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
643 Set<Integer> B = iterator.next();
645 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
647 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
648 Set<Integer> F = iterator2.next();
650 Set<Integer> Fprime = new HashSet<Integer>();
654 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
655 gammaFPrimeSet.addAll(family.getGamma(F));
656 gammaFPrimeSet.add(basisSet.getHNode(B));
658 if (!family.containsF(Fprime)) {
659 Pair<Set<Integer>, Set<HNode>> pair =
660 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
663 family.updateGammaF(Fprime, gammaFPrimeSet);
667 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
669 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
670 family.addFElement(pair.getFirst());
671 family.updateGammaF(pair.getFirst(), pair.getSecond());
678 private void debug_print(HierarchyGraph inputGraph) {
679 System.out.println("\nBuild Lattice:" + inputGraph.getName());
680 // System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
681 // System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
690 public Identifier(HNode n, int i) {
695 public int hashCode() {
696 return node.hashCode() + idx;
699 public boolean equals(Object obj) {
701 if (obj instanceof Identifier) {
702 Identifier in = (Identifier) obj;
703 if (node.equals(in.node) && idx == in.idx) {
714 public HNode higherNode;
715 public Set<HNode> lowerNodeSet;
718 public TripleItem(HNode h, Set<HNode> l, int i) {
724 public int hashCode() {
727 if (higherNode != null) {
728 h = higherNode.hashCode();
731 return h + lowerNodeSet.hashCode() + idx;
734 public boolean equals(Object obj) {
736 if (obj instanceof TripleItem) {
737 TripleItem in = (TripleItem) obj;
738 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
739 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx) {
747 public String toString() {
748 return higherNode + "-" + idx + "->" + lowerNodeSet;