1 package Analysis.SSJava;
3 import java.util.HashMap;
4 import java.util.HashSet;
5 import java.util.Iterator;
9 import IR.ClassDescriptor;
11 import IR.MethodDescriptor;
12 import IR.NameDescriptor;
15 public class BuildLattice {
17 private LocationInference infer;
18 private Map<HNode, TripleItem> mapSharedNodeToTripleItem;
19 private Map<HNode, Integer> mapHNodeToHighestIndex;
21 private Map<Descriptor, Map<TripleItem, String>> mapDescToIntermediateLocMap;
23 private Map<Pair<HNode, HNode>, Integer> mapItemToHighestIndex;
25 public BuildLattice(LocationInference infer) {
27 this.mapSharedNodeToTripleItem = new HashMap<HNode, TripleItem>();
28 this.mapHNodeToHighestIndex = new HashMap<HNode, Integer>();
29 this.mapItemToHighestIndex = new HashMap<Pair<HNode, HNode>, Integer>();
30 this.mapDescToIntermediateLocMap = new HashMap<Descriptor, Map<TripleItem, String>>();
33 public SSJavaLattice<String> buildLattice(Descriptor desc) {
35 HierarchyGraph inputGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
36 LocationSummary locSummary = infer.getLocationSummary(desc);
38 HierarchyGraph naiveGraph = infer.getSimpleHierarchyGraph(desc);
40 // I don't think we need to keep the below if statement anymore
41 // because hierarchy graph does not have any composite location
42 Set<HNode> nodeSetWithCompositeLocation = new HashSet<HNode>();
43 if (desc instanceof MethodDescriptor) {
44 FlowGraph flowGraph = infer.getFlowGraph((MethodDescriptor) desc);
46 for (Iterator iterator = inputGraph.getNodeSet().iterator(); iterator.hasNext();) {
47 HNode hnode = (HNode) iterator.next();
48 Descriptor hnodeDesc = hnode.getDescriptor();
49 if (hnodeDesc != null) {
50 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
51 descTuple.add(hnodeDesc);
53 if (flowGraph.contains(descTuple)) {
54 FlowNode flowNode = flowGraph.getFlowNode(descTuple);
55 if (flowNode.getCompositeLocation() != null) {
56 nodeSetWithCompositeLocation.add(hnode);
65 // /////////////////////////////////////////////////////////////////////////////////////
66 // lattice generation for the native approach
68 if (infer.state.SSJAVA_INFER_NAIVE_WRITEDOTS) {
69 BasisSet naiveBasisSet = naiveGraph.computeBasisSet(nodeSetWithCompositeLocation);
71 Family naiveFamily = generateFamily(naiveBasisSet);
72 Map<Set<Integer>, Set<Set<Integer>>> naive_mapImSucc =
73 coveringGraph(naiveBasisSet, naiveFamily);
75 SSJavaLattice<String> naive_lattice =
76 buildLattice(desc, naiveBasisSet, naiveGraph, null, naive_mapImSucc);
77 LocationInference.numLocationsNaive += naive_lattice.getKeySet().size();
78 infer.addNaiveLattice(desc, naive_lattice);
81 // /////////////////////////////////////////////////////////////////////////////////////
83 // lattice generation for the proposed approach
84 BasisSet basisSet = inputGraph.computeBasisSet(nodeSetWithCompositeLocation);
85 // debug_print(inputGraph);
87 Family family = generateFamily(basisSet);
88 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = coveringGraph(basisSet, family);
90 SSJavaLattice<String> lattice = buildLattice(desc, basisSet, inputGraph, locSummary, mapImSucc);
95 public void setIntermediateLocMap(Descriptor desc, Map<TripleItem, String> map) {
96 mapDescToIntermediateLocMap.put(desc, map);
99 public Map<TripleItem, String> getIntermediateLocMap(Descriptor desc) {
100 if (!mapDescToIntermediateLocMap.containsKey(desc)) {
101 mapDescToIntermediateLocMap.put(desc, new HashMap<TripleItem, String>());
103 return mapDescToIntermediateLocMap.get(desc);
106 private Descriptor getParent(Descriptor desc) {
107 if (desc instanceof MethodDescriptor) {
108 MethodDescriptor md = (MethodDescriptor) desc;
109 ClassDescriptor cd = md.getClassDesc();
110 return infer.getParentMethodDesc(cd, md);
112 return ((ClassDescriptor) desc).getSuperDesc();
116 private SSJavaLattice<String> buildLattice(Descriptor desc, BasisSet basisSet,
117 HierarchyGraph inputGraph, LocationSummary locSummary,
118 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
120 System.out.println("\nBuild Lattice:" + inputGraph.getName());
122 SSJavaLattice<String> lattice =
123 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
125 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
127 Set<Set<Integer>> keySet = mapImSucc.keySet();
128 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
129 Set<Integer> higher = (Set<Integer>) iterator.next();
131 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
133 HNode higherNode = inputGraph.getHNode(higherName);
135 if (higherNode == null) {
136 NameDescriptor d = new NameDescriptor(higherName);
137 higherNode = inputGraph.getHNode(d);
138 higherNode.setSkeleton(true);
141 if (higherNode != null && higherNode.isSharedNode()) {
142 lattice.addSharedLoc(higherName);
144 Set<Descriptor> descSet = inputGraph.getDescSetOfNode(higherNode);
145 // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet="
148 if (locSummary != null) {
149 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
150 Descriptor d = (Descriptor) iterator2.next();
151 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName);
155 // locSummary.addMapHNodeNameToLocationName(higherName, higherName);
157 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
158 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
159 Set<Integer> lower = (Set<Integer>) iterator2.next();
161 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
162 HNode lowerNode = inputGraph.getHNode(lowerName);
164 if (lowerNode == null && !lowerName.equals(SSJavaAnalysis.BOTTOM)) {
165 NameDescriptor d = new NameDescriptor(lowerName);
166 lowerNode = inputGraph.getHNode(d);
167 lowerNode.setSkeleton(true);
170 if (lowerNode != null && !inputGraph.isDirectlyConnectedTo(higherNode, lowerNode)) {
171 inputGraph.addEdge(higherNode, lowerNode);
174 if (lowerNode != null && lowerNode.isSharedNode()) {
175 lattice.addSharedLoc(lowerName);
178 Set<Descriptor> lowerDescSet = inputGraph.getDescSetOfNode(lowerNode);
179 // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet="
181 if (locSummary != null) {
182 for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) {
183 Descriptor d = (Descriptor) iterator3.next();
184 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName);
187 // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
189 if (higher.size() == 0) {
191 lattice.put(lowerName);
193 lattice.addRelationHigherToLower(higherName, lowerName);
200 inputGraph.removeRedundantEdges();
204 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
206 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
208 if (nodeFromSimpleGraph.isSkeleton()) {
209 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
212 Set<HNode> combineSkeletonNodeSet =
213 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
214 HNode combinationNodeInSCGraph =
215 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
216 .get(combineSkeletonNodeSet);
218 // Set<HNode> combineSkeletonNodeSet =
219 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
220 // HNode combinationNodeInSCGraph =
221 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
222 return combinationNodeInSCGraph;
225 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
226 SSJavaLattice<String> skeletonLattice) {
228 SSJavaLattice<String> lattice = skeletonLattice.clone();
229 LocationSummary locSummary = infer.getLocationSummary(desc);
231 Descriptor parentDesc = getParent(desc);
232 if (parentDesc != null) {
233 SSJavaLattice<String> parentLattice = infer.getLattice(parentDesc);
235 Map<String, Set<String>> parentMap = parentLattice.getTable();
236 Set<String> parentKeySet = parentMap.keySet();
237 for (Iterator iterator = parentKeySet.iterator(); iterator.hasNext();) {
238 String parentKey = (String) iterator.next();
239 Set<String> parentValueSet = parentMap.get(parentKey);
240 for (Iterator iterator2 = parentValueSet.iterator(); iterator2.hasNext();) {
241 String value = (String) iterator2.next();
242 lattice.put(parentKey, value);
246 Set<String> parentSharedLocSet = parentLattice.getSharedLocSet();
247 for (Iterator iterator = parentSharedLocSet.iterator(); iterator.hasNext();) {
248 String parentSharedLoc = (String) iterator.next();
249 lattice.addSharedLoc(parentSharedLoc);
253 HierarchyGraph hierarchyGraph = infer.getSimpleHierarchyGraph(desc);
254 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
256 Set<HNode> hierarchyGraphNodeSet = hierarchyGraph.getNodeSet();
257 for (Iterator iterator = hierarchyGraphNodeSet.iterator(); iterator.hasNext();) {
258 HNode hNode = (HNode) iterator.next();
259 if (!hNode.isSkeleton()) {
260 // here we need to insert an intermediate node for the hNode
261 System.out.println("local node=" + hNode);
263 // 1) find the lowest node m in the lattice that is above hnode in the lattice
264 // 2) count the number of non-shared nodes d between the hnode and the node m
265 int numNonSharedNodes;
268 if (hNode.isDirectCombinationNode()) {
269 // this node itself is the lowest node m. it is the first node of the chain
270 Set<HNode> combineSet = hierarchyGraph.getCombineSetByCombinationNode(hNode);
271 SCNode = scGraph.getCombinationNode(combineSet);
272 numNonSharedNodes = -1;
275 Set<HNode> aboveSet = new HashSet<HNode>();
276 if (hNode.isCombinationNode()) {
277 Set<HNode> combineSkeletonNodeSet =
278 hierarchyGraph.getCombineSetByCombinationNode(hNode);
279 aboveSet.addAll(hierarchyGraph
280 .getFirstNodeOfCombinationNodeChainSet(combineSkeletonNodeSet));
281 SCNode = scGraph.getCombinationNode(combineSkeletonNodeSet);
283 System.out.println(" #######hierarchyGraph.getSkeleteNodeSetReachTo(" + hNode + ")="
284 + hierarchyGraph.getSkeleteNodeSetReachTo(hNode));
286 aboveSet.addAll(hierarchyGraph.getSkeleteNodeSetReachTo(hNode));
287 // assert aboveSet.size() == 1;
288 SCNode = aboveSet.iterator().next();
291 numNonSharedNodes = hierarchyGraph.countNonSharedNode(hNode, aboveSet);
293 System.out.println(" node=" + hNode + " above=" + aboveSet + " distance="
294 + numNonSharedNodes + " SCNode=" + SCNode);
297 // 3) convert the node m into a chain of nodes with the last node in the chain having m’s
299 Set<String> outgoingElements = skeletonLattice.get(SCNode.getName());
300 System.out.println(" SCNODE outgoing=" + outgoingElements);
302 // 4) If hnode is not a shared location, check if there already exists a local variable
303 // node that has distance d below m along this chain. If such a node
304 // does not exist, insert it.
306 getNewLocation(lattice, SCNode.getName(), outgoingElements, numNonSharedNodes,
307 hNode.isSharedNode());
308 System.out.println(" locName=" + locName);
309 locSummary.addMapHNodeNameToLocationName(hNode.getName(), locName);
317 public String getNewLocation(SSJavaLattice<String> lattice, String start, Set<String> endSet,
318 int dist, boolean isShared) {
319 System.out.println(" getNewLocation:: start=" + start + " endSet=" + endSet + " dist="
320 + dist + " isShared=" + isShared);
324 return recur_getNewLocation(lattice, start, endSet, dist, isShared);
327 private String recur_getNewLocation(SSJavaLattice<String> lattice, String cur,
328 Set<String> endSet, int dist, boolean isShared) {
329 Set<String> connectedSet = lattice.get(cur);
330 if (connectedSet == null) {
331 connectedSet = new HashSet<String>();
334 System.out.println(" recur_getNewLocation cur=" + cur + " dist=" + dist
335 + " connectedSet=" + connectedSet + " endSet=" + endSet);
337 if (dist == 0 && isShared) {
338 // if the node is shared,
339 // check if there already exists a shared node that has distance d + 1 on the chain
340 connectedSet = lattice.get(cur);
341 if (connectedSet.equals(endSet)) {
342 // need to insert a new shared location
344 assert connectedSet.size() == 1;
345 String below = connectedSet.iterator().next();
346 if (lattice.isSharedLoc(below)) {
351 // need to insert a new shared location
352 String newLocName = "ILOC" + (LocationInference.locSeed++);
353 for (Iterator iterator = connectedSet.iterator(); iterator.hasNext();) {
354 String outNode = (String) iterator.next();
355 lattice.put(newLocName, outNode);
357 connectedSet.clear();
358 lattice.put(cur, newLocName);
360 System.out.println(" INSERT NEW SHARED NODE=" + newLocName + " above=" + cur
361 + " below=" + lattice.get(newLocName));
363 lattice.addSharedLoc(newLocName);
370 if (connectedSet.equals(endSet)) {
371 // need to insert a new location
372 String newLocName = "ILOC" + (LocationInference.locSeed++);
373 connectedSet.clear();
374 lattice.put(cur, newLocName);
375 System.out.println("NEW RELATION=" + lattice.get(cur));
376 for (Iterator iterator = endSet.iterator(); iterator.hasNext();) {
377 String endNode = (String) iterator.next();
378 lattice.put(newLocName, endNode);
381 System.out.println(" INSERT NEW NODE=" + newLocName + " above=" + cur + " below="
384 assert connectedSet.size() == 1;
385 next = connectedSet.iterator().next();
387 System.out.println(" next=" + next);
393 // // if the node is shared,
394 // // check if there already exists a shared node that has distance d + 1 on the chain
396 // connectedSet = lattice.get(next);
398 // if (connectedSet.equals(endSet)) {
399 // // need to insert a new shared location
401 // assert connectedSet.size() != 1;
402 // String below = connectedSet.iterator().next();
403 // if (lattice.isSharedLoc(below)) {
408 // // need to insert a new shared location
409 // String newLocName = "ILOC" + (LocationInference.locSeed++);
410 // for (Iterator iterator = connectedSet.iterator(); iterator.hasNext();) {
411 // String outNode = (String) iterator.next();
412 // lattice.put(newLocName, outNode);
414 // connectedSet.clear();
415 // lattice.put(next, newLocName);
417 // System.out.println(" INSERT NEW SHARED NODE=" + newLocName + " above=" + next
418 // + " below=" + lattice.get(newLocName));
420 // lattice.addSharedLoc(newLocName);
422 // next = newLocName;
433 if (!lattice.isSharedLoc(next)) {
436 return recur_getNewLocation(lattice, next, endSet, dist, isShared);
441 // ///////////////////////////////////////////////
445 // } else if (connectedSet.equals(endSet)) {
446 // // need to insert a new location
447 // String newLocName = "ILOC" + (LocationInference.locSeed++);
448 // connectedSet.clear();
449 // lattice.put(cur, newLocName);
450 // for (Iterator iterator = endSet.iterator(); iterator.hasNext();) {
451 // String endNode = (String) iterator.next();
452 // lattice.put(newLocName, endNode);
454 // return recur_getNewLocation(lattice, newLocName, endSet, --dist, isShared);
456 // assert connectedSet.size() != 1;
457 // String next = connectedSet.iterator().next();
458 // return recur_getNewLocation(lattice, next, endSet, --dist, isShared);
463 public SSJavaLattice<String> insertIntermediateNodesToStraightLine2(Descriptor desc,
464 SSJavaLattice<String> skeletonLattice) {
465 // copy nodes/edges from the parent method/class if possible
466 SSJavaLattice<String> lattice = skeletonLattice.clone();
468 Descriptor parentDesc = getParent(desc);
469 if (parentDesc != null) {
470 SSJavaLattice<String> parentLattice = infer.getLattice(parentDesc);
472 Map<String, Set<String>> parentMap = parentLattice.getTable();
473 Set<String> parentKeySet = parentMap.keySet();
474 for (Iterator iterator = parentKeySet.iterator(); iterator.hasNext();) {
475 String parentKey = (String) iterator.next();
476 Set<String> parentValueSet = parentMap.get(parentKey);
477 for (Iterator iterator2 = parentValueSet.iterator(); iterator2.hasNext();) {
478 String value = (String) iterator2.next();
479 lattice.put(parentKey, value);
483 Set<String> parentSharedLocSet = parentLattice.getSharedLocSet();
484 for (Iterator iterator = parentSharedLocSet.iterator(); iterator.hasNext();) {
485 String parentSharedLoc = (String) iterator.next();
486 lattice.addSharedLoc(parentSharedLoc);
492 // perform DFS that starts from each skeleton/combination node and ends by another
493 // skeleton/combination node
495 mapSharedNodeToTripleItem.clear();
497 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
498 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
499 LocationSummary locSummary = infer.getLocationSummary(desc);
501 Set<HNode> visited = new HashSet<HNode>();
503 Set<HNode> nodeSet = simpleGraph.getNodeSet();
505 Map<TripleItem, String> mapIntermediateLoc = getIntermediateLocMap(desc);
506 // Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
508 // System.out.println("*insert=" + desc);
509 // System.out.println("***nodeSet=" + nodeSet);
510 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
511 HNode node = (HNode) iterator.next();
512 System.out.println("node=" + node);
514 if (node.isSkeleton() && (!visited.contains(node))) {
517 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
518 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
519 HNode outNode = (HNode) iterator2.next();
521 if (!outNode.isSkeleton()) {
522 if (outNode.isCombinationNode()) {
523 if (visited.containsAll(simpleGraph.getIncomingNodeSet(outNode))) {
524 // if (needToExpandCombinationNode(desc, outNode)) {
525 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary,
530 // we have a node that is neither combination or skeleton node
531 // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode);
532 HNode startNode = scGraph.getCurrentHNode(node);
534 // if (node.getDescriptor() != null) {
535 // // node is a skeleton node and it might be merged into another node in the SC
537 // startNode = scGraph.getHNode(node.getDescriptor());
539 // // this node has already been merged before the SC graph.
544 // Set<HNode> endNodeSetFromSimpleGraph =
545 // simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
546 // Set<HNode> endCombNodeSet = new HashSet<HNode>();
547 // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator();
548 // iterator3.hasNext();) {
549 // HNode endNode = (HNode) iterator3.next();
550 // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
553 Set<HNode> endCombNodeSet = scGraph.getOutgoingNodeSet(startNode);
555 // System.out.println("endCombNodeSet=" + endCombNodeSet);
556 visited.add(outNode);
557 if (endCombNodeSet.size() > 0) {
558 // follows the straight line up to another skeleton/combination node
559 endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
560 } else if (endCombNodeSet.size() == 0) {
561 // the outNode is (directly/transitively) connected to the bottom node
562 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
563 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
566 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
567 mapIntermediateLoc, 1, locSummary, outNode);
573 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
574 && !visited.contains(node)) {
576 System.out.println("n=" + node);
578 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
579 if (simpleGraph.getIncomingNodeSet(node).size() == 0) {
581 // this node will be directly connected to the TOP location
582 // start adding the following nodes from this node
584 Set<HNode> endNodeSetFromSimpleGraph =
585 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
587 Set<HNode> endCombNodeSet = new HashSet<HNode>();
588 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
589 HNode endNode = (HNode) iterator3.next();
590 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
593 System.out.println("endCombNodeSet=" + endCombNodeSet);
594 HNode startNode = LocationInference.TOPHNODE;
595 visited.add(startNode);
596 if (endCombNodeSet.size() > 0) {
597 // follows the straight line up to another skeleton/combination node
598 // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet);
599 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
600 mapIntermediateLoc, 1, locSummary, node);
608 // add shared locations
609 Set<HNode> sharedNodeSet = mapSharedNodeToTripleItem.keySet();
610 for (Iterator iterator = sharedNodeSet.iterator(); iterator.hasNext();) {
611 HNode sharedNode = (HNode) iterator.next();
612 TripleItem item = mapSharedNodeToTripleItem.get(sharedNode);
613 String nonSharedLocName = mapIntermediateLoc.get(item);
615 System.out.println("sharedNode=" + sharedNode + " locName=" + nonSharedLocName);
618 if (locSummary.getHNodeNameSetByLatticeLoationName(nonSharedLocName) != null
619 && !lattice.isSharedLoc(nonSharedLocName)) {
620 // need to generate a new shared location in the lattice, which is one level lower than the
621 // 'locName' location
622 newLocName = "ILOC" + (LocationInference.locSeed++);
624 // Set<String> aboveElementSet = getAboveElementSet(lattice, locName);
625 Set<String> belowElementSet = new HashSet<String>();
626 belowElementSet.addAll(lattice.get(nonSharedLocName));
628 System.out.println("nonSharedLocName=" + nonSharedLocName + " belowElementSet="
629 + belowElementSet + " newLocName=" + newLocName);
631 lattice.insertNewLocationBetween(nonSharedLocName, belowElementSet, newLocName);
633 newLocName = nonSharedLocName;
636 lattice.addSharedLoc(newLocName);
637 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
638 Set<Descriptor> descSet = graph.getDescSetOfNode(sharedNode);
639 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
640 Descriptor d = (Descriptor) iterator2.next();
641 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), newLocName);
643 locSummary.addMapHNodeNameToLocationName(sharedNode.getName(), newLocName);
651 private Set<String> getAboveElementSet(SSJavaLattice<String> lattice, String loc) {
653 Set<String> aboveSet = new HashSet<String>();
655 Map<String, Set<String>> latticeMap = lattice.getTable();
656 Set<String> keySet = latticeMap.keySet();
657 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
658 String key = (String) iterator.next();
659 if (latticeMap.get(key).contains(loc)) {
667 private boolean needToExpandCombinationNode(Descriptor desc, HNode cnode) {
669 System.out.println("needToExpandCombinationNode?=" + cnode);
671 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
672 // HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
673 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
674 Set<HNode> combinationNodeSetInSimpleGraph =
675 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
676 System.out.println("---combinationNodeSetInSimpleGraph=" + combinationNodeSetInSimpleGraph);
677 Set<HNode> inNodeSetToCNode = simpleGraph.getIncomingNodeSet(cnode);
678 System.out.println("------inNodeSetToCNode=" + inNodeSetToCNode);
679 for (Iterator iterator = combinationNodeSetInSimpleGraph.iterator(); iterator.hasNext();) {
680 HNode nodeBelongToTheSameCombinationNode = (HNode) iterator.next();
681 if (inNodeSetToCNode.contains(nodeBelongToTheSameCombinationNode)) {
682 // the combination node 'cnode' is not the highest location among the same combination node
690 private void expandCombinationNode(Descriptor desc, SSJavaLattice<String> lattice,
691 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
694 // expand the combination node 'outNode'
695 // here we need to expand the corresponding combination location in the lattice
696 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
698 System.out.println("expandCombinationNode=" + cnode + " cnode in scgraph="
699 + combinationNodeInSCGraph);
701 if (combinationNodeInSCGraph == null) {
705 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
706 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
708 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
710 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
712 Set<HNode> combinationNodeSet =
713 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
715 // System.out.println("combinationNodeSet=" + combinationNodeSet);
718 // Set<HNode> endNodeSetFromSimpleGraph =
719 // simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
720 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
721 // Set<HNode> endCombNodeSet = new HashSet<HNode>();
722 // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
723 // HNode endNode = (HNode) iterator3.next();
724 // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
727 Set<HNode> endCombNodeSet = scGraph.getOutgoingNodeSet(combinationNodeInSCGraph);
730 // follows the straight line up to another skeleton/combination node
731 if (endCombNodeSet.size() > 0) {
732 // System.out.println("---endCombNodeSet=" + endCombNodeSet);
734 removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
736 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
737 mapIntermediateLoc, 1, locSummary, cnode);
739 endCombNodeSet.add(LocationInference.BOTTOMHNODE);
740 // System.out.println("---endCombNodeSet is zero");
741 // System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
742 // System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode));
743 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
744 mapIntermediateLoc, 1, locSummary, cnode);
750 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
751 Set<HNode> endNodeSet) {
753 // if an end node is not directly connected to the start node in the SC graph
754 // replace it with a directly connected one which transitively reaches to it.
756 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
758 Set<HNode> newEndNodeSet = new HashSet<HNode>();
759 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
760 HNode endNode = (HNode) iterator.next();
761 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
762 newEndNodeSet.add(endNode);
765 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
766 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
767 newEndNodeSet.add(newEndNode);
771 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
774 return newEndNodeSet;
778 private HNode getDirectlyReachableSCNodeFromEndNode(HierarchyGraph scGraph, HNode startNode,
779 Set<HNode> endNodeSet) {
781 // System.out.println("getDirectlyReachableSCNodeFromEndNode start=" + startNode +
784 Set<HNode> newStartNodeSet = new HashSet<HNode>();
786 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
787 HNode endNode = (HNode) iterator.next();
788 Set<HNode> connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode);
790 for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) {
791 HNode curNode = (HNode) iterator2.next();
792 if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet<HNode>())) {
793 newStartNodeSet.add(curNode);
798 // System.out.println("newStartNodeSet=" + newStartNodeSet);
800 if (newStartNodeSet.size() == 0) {
801 newStartNodeSet.add(startNode);
804 return newStartNodeSet.iterator().next();
807 private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode,
808 HNode curNode, Set<HNode> visited) {
809 // return true if curNode is transitively connected from the startNode
811 boolean isConnected = false;
812 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
813 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
814 HNode in = (HNode) iterator.next();
815 if (in.equals(startNode)) {
819 isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited);
826 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
827 HNode startNode, HNode endNode) {
828 // System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
829 // + " end=" + endNode);
830 Set<HNode> connected = new HashSet<HNode>();
831 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
832 if (connected.size() == 0) {
833 connected.add(endNode);
835 // System.out.println("connected=" + connected);
837 return connected.iterator().next();
840 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
841 HNode startNode, HNode curNode, Set<HNode> connected) {
843 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
844 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
845 HNode inNode = (HNode) iterator.next();
846 if (inNode.equals(startNode)) {
847 connected.add(curNode);
849 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
855 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
856 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
857 int idx, LocationSummary locSummary, HNode curNode) {
859 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
860 if (!mapIntermediateLoc.containsKey(item)) {
861 // need to create a new intermediate location in the lattice
862 String newLocName = "ILOC" + (LocationInference.locSeed++);
865 above = startNode.getName();
867 int prevIdx = idx - 1;
868 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
869 above = mapIntermediateLoc.get(prevItem);
872 Set<String> belowSet = new HashSet<String>();
873 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
874 HNode endNode = (HNode) iterator.next();
876 if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) {
877 locName = locSummary.getLocationName(endNode.getName());
879 locName = endNode.getName();
881 belowSet.add(locName);
883 lattice.insertNewLocationBetween(above, belowSet, newLocName);
885 mapIntermediateLoc.put(item, newLocName);
888 String locName = mapIntermediateLoc.get(item);
889 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
891 if (curNode.isSharedNode()) {
892 // if the current node is shared location, add a shared location to the lattice later
893 System.out.println("###SHARED ITEM=" + item);
894 mapSharedNodeToTripleItem.put(curNode, item);
896 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
897 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
898 Descriptor d = (Descriptor) iterator.next();
899 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
901 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
904 System.out.println("-TripleItem normal=" + item);
905 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
906 + " locName=" + locName + " isC=" + curNode.isCombinationNode());
908 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
909 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
910 HNode outNode = (HNode) iterator2.next();
912 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
913 System.out.println("outNode=" + outNode);
914 System.out.println("---incomingHNodeSetToOutNode=" + incomingHNodeSetToOutNode);
916 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
917 Pair<HNode, HNode> pair = new Pair(startNode, outNode);
918 if (visited.containsAll(simpleHierarchyGraph.getIncomingNodeSet(outNode))) {
919 visited.add(outNode);
920 int newidx = getCurrentHighestIndex(pair, idx + 1);
921 // int newidx = getCurrentHighestIndex(outNode, idx + 1);
922 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
923 newidx, locSummary, outNode);
924 // recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
925 // idx + 1, locSummary, outNode);
927 updateHighestIndex(pair, idx + 1);
928 // updateHighestIndex(outNode, idx + 1);
929 System.out.println("NOT RECUR");
931 } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) {
932 if (needToExpandCombinationNode(desc, outNode)) {
933 System.out.println("NEED TO");
934 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
936 System.out.println("NOT NEED TO");
944 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
945 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
946 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
948 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
950 if (!mapIntermediateLoc.containsKey(item)) {
951 // need to create a new intermediate location in the lattice
954 String newLocName = combinationNodeInSCGraph.getName();
955 mapIntermediateLoc.put(item, newLocName);
957 String newLocName = "ILOC" + (LocationInference.locSeed++);
958 int prevIdx = idx - 1;
959 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
960 above = mapIntermediateLoc.get(prevItem);
962 Set<String> belowSet = new HashSet<String>();
963 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
964 HNode endNode = (HNode) iterator.next();
965 belowSet.add(endNode.getName());
967 lattice.insertNewLocationBetween(above, belowSet, newLocName);
968 mapIntermediateLoc.put(item, newLocName);
974 // Do we need to skip the combination node and assign a shared location to the next node?
975 // if (idx == 1 && curNode.isSharedNode()) {
976 // System.out.println("THE FIRST COMBINATION NODE EXPANSION IS SHARED!");
977 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, mapIntermediateLoc,
978 // idx + 1, locSummary, curNode);
982 HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
983 String locName = mapIntermediateLoc.get(item);
984 if (curNode.isSharedNode()) {
985 // if the current node is shared location, add a shared location to the lattice later
986 System.out.println("###SHARED ITEM=" + item);
987 mapSharedNodeToTripleItem.put(curNode, item);
989 Set<Descriptor> descSet = simpleHierarchyGraph.getDescSetOfNode(curNode);
990 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
991 Descriptor d = (Descriptor) iterator.next();
992 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
994 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
997 System.out.println("-TripleItem=" + item);
998 System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
999 + " locName=" + locName);
1001 Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
1002 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
1003 HNode outNode = (HNode) iterator2.next();
1004 System.out.println("---recurDFS outNode=" + outNode);
1005 System.out.println("---cur combinationNodeInSCGraph=" + combinationNodeInSCGraph);
1006 System.out.println("---outNode combinationNodeInSCGraph="
1007 + getCombinationNodeInSCGraph(desc, outNode));
1009 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
1010 if (outNode.isCombinationNode()) {
1012 Set<HNode> combineSkeletonNodeSet =
1013 simpleHierarchyGraph.getCombineSetByCombinationNode(outNode);
1014 Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
1015 // extract nodes belong to the same combine node
1016 Set<HNode> incomingCombinedHNodeSet = new HashSet<HNode>();
1017 for (Iterator iterator = incomingHNodeSetToOutNode.iterator(); iterator.hasNext();) {
1018 HNode inNode = (HNode) iterator.next();
1019 if (combineSkeletonNodeSet.contains(inNode)) {
1020 incomingCombinedHNodeSet.add(inNode);
1023 System.out.println("-----incomingCombinedHNodeSet=" + incomingCombinedHNodeSet);
1025 // check whether the next combination node is different from the current node
1026 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
1027 Pair<HNode, HNode> pair = new Pair(combinationNodeInSCGraph, outNode);
1028 if (visited.containsAll(incomingCombinedHNodeSet)) {
1029 visited.add(outNode);
1030 System.out.println("-------curIdx=" + (idx + 1));
1032 int newIdx = getCurrentHighestIndex(pair, idx + 1);
1033 // int newIdx = getCurrentHighestIndex(outNode, idx + 1);
1034 System.out.println("-------newIdx=" + newIdx);
1035 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
1036 mapIntermediateLoc, newIdx, locSummary, outNode);
1037 // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
1038 // mapIntermediateLoc, idx + 1, locSummary, outNode);
1040 updateHighestIndex(pair, idx + 1);
1041 // updateHighestIndex(outNode, idx + 1);
1042 System.out.println("-----NOT RECUR!");
1045 if (needToExpandCombinationNode(desc, outNode)) {
1046 System.out.println("NEED TO");
1047 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
1049 System.out.println("NOT NEED TO");
1061 private int getCurrentHighestIndex(Pair<HNode, HNode> pair, int curIdx) {
1062 int recordedIdx = getCurrentHighestIndex(pair);
1063 if (recordedIdx > curIdx) {
1070 private int getCurrentHighestIndex(HNode node, int curIdx) {
1071 int recordedIdx = getCurrentHighestIndex(node);
1072 if (recordedIdx > curIdx) {
1079 private int getCurrentHighestIndex(Pair<HNode, HNode> pair) {
1080 if (!mapItemToHighestIndex.containsKey(pair)) {
1081 mapItemToHighestIndex.put(pair, new Integer(-1));
1083 return mapItemToHighestIndex.get(pair).intValue();
1086 private void updateHighestIndex(Pair<HNode, HNode> pair, int idx) {
1087 if (idx > getCurrentHighestIndex(pair)) {
1088 mapItemToHighestIndex.put(pair, new Integer(idx));
1092 private int getCurrentHighestIndex(HNode node) {
1093 if (!mapHNodeToHighestIndex.containsKey(node)) {
1094 mapHNodeToHighestIndex.put(node, new Integer(-1));
1096 return mapHNodeToHighestIndex.get(node).intValue();
1099 private void updateHighestIndex(HNode node, int idx) {
1100 if (idx > getCurrentHighestIndex(node)) {
1101 mapHNodeToHighestIndex.put(node, new Integer(idx));
1105 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
1106 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
1108 if (mapF2LocName.containsKey(F)) {
1109 return mapF2LocName.get(F);
1112 HNode node = basisSet.getHNode(F);
1114 mapF2LocName.put(F, node.getName());
1115 return node.getName();
1117 if (inputGraph.BASISTOPELEMENT.equals(F)) {
1118 return SSJavaAnalysis.BOTTOM;
1120 String str = "LOC" + (LocationInference.locSeed++);
1121 mapF2LocName.put(F, str);
1127 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
1128 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
1129 Set<Integer> F = iter.next();
1130 mapFtoCount.put(F, 0);
1134 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
1136 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
1137 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
1139 // initialize COUNT(F) to 0 for all elements of the family
1140 resetCount(mapFtoCount, family);
1142 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
1143 Set<Integer> F = iter.next();
1144 Set<HNode> gammaF = family.getGamma(F);
1146 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
1147 curHNodeSet.removeAll(gammaF);
1148 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
1150 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
1151 Set<Integer> B = (Set<Integer>) iterator.next();
1153 Set<Integer> Fprime = new HashSet<Integer>();
1158 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
1160 // if |gamma(F')|==COUNT(F') + |gamma(F)|
1161 int numGammaFprime = family.getGamma(Fprime).size();
1162 int countFprime = mapFtoCount.get(Fprime);
1163 int numGammaF = family.getGamma(F).size();
1164 if (numGammaFprime == (countFprime + numGammaF)) {
1165 // ImSucc(F)=IMSucc(F) union F'
1166 addImSucc(mapImSucc, F, Fprime);
1170 resetCount(mapFtoCount, family);
1173 // System.out.println("mapImSucc=" + mapImSucc);
1178 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
1179 if (!mapImSucc.containsKey(F)) {
1180 mapImSucc.put(F, new HashSet<Set<Integer>>());
1182 return mapImSucc.get(F);
1185 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
1186 Set<Integer> Fprime) {
1188 if (!mapImSucc.containsKey(F)) {
1189 mapImSucc.put(F, new HashSet<Set<Integer>>());
1192 mapImSucc.get(F).add(Fprime);
1196 private Family generateFamily(BasisSet basisSet) {
1198 Family family = new Family();
1200 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
1201 Set<Integer> B = iterator.next();
1203 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
1205 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
1206 Set<Integer> F = iterator2.next();
1208 Set<Integer> Fprime = new HashSet<Integer>();
1212 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
1213 gammaFPrimeSet.addAll(family.getGamma(F));
1214 gammaFPrimeSet.add(basisSet.getHNode(B));
1216 if (!family.containsF(Fprime)) {
1217 Pair<Set<Integer>, Set<HNode>> pair =
1218 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
1219 tobeadded.add(pair);
1221 family.updateGammaF(Fprime, gammaFPrimeSet);
1225 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
1227 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
1228 family.addFElement(pair.getFirst());
1229 family.updateGammaF(pair.getFirst(), pair.getSecond());
1236 private void debug_print(HierarchyGraph inputGraph) {
1237 System.out.println("\nBuild Lattice:" + inputGraph.getName());
1238 System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
1239 System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
1248 public Identifier(HNode n, int i) {
1253 public int hashCode() {
1254 return node.hashCode() + idx;
1257 public boolean equals(Object obj) {
1259 if (obj instanceof Identifier) {
1260 Identifier in = (Identifier) obj;
1261 if (node.equals(in.node) && idx == in.idx) {
1272 public HNode higherNode;
1273 public Set<HNode> lowerNodeSet;
1275 public boolean isShared;
1277 public TripleItem(HNode h, Set<HNode> l, int i) {
1284 public void setShared(boolean in) {
1288 public boolean isShared() {
1292 public int hashCode() {
1295 if (higherNode != null) {
1296 h = higherNode.hashCode();
1303 return h + lowerNodeSet.hashCode() + idx;
1306 public boolean equals(Object obj) {
1308 if (obj instanceof TripleItem) {
1309 TripleItem in = (TripleItem) obj;
1310 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
1311 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx && isShared == in.isShared()) {
1319 public String toString() {
1320 String rtr = higherNode + "-" + idx + "->" + lowerNodeSet;