1 package Analysis.SSJava;
3 import java.util.HashMap;
4 import java.util.HashSet;
5 import java.util.Iterator;
12 public class BuildLattice {
14 public static int seed = 0;
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 BasisSet basisSet = inputGraph.computeBasisSet();
27 debug_print(inputGraph);
29 Family family = generateFamily(basisSet);
30 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = coveringGraph(basisSet, family);
32 SSJavaLattice<String> lattice = buildLattice(basisSet, inputGraph, locSummary, mapImSucc);
37 private SSJavaLattice<String> buildLattice(BasisSet basisSet, HierarchyGraph inputGraph,
38 LocationSummary locSummary, Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
40 SSJavaLattice<String> lattice =
41 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
43 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
45 Set<Set<Integer>> keySet = mapImSucc.keySet();
46 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
47 Set<Integer> higher = (Set<Integer>) iterator.next();
49 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
50 locSummary.addMapHNodeNameToLocationName(higherName, higherName);
52 HNode higherNode = inputGraph.getHNode(higherName);
53 if (higherNode != null && higherNode.isSharedNode()) {
54 lattice.addSharedLoc(higherName);
57 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
58 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
59 Set<Integer> lower = (Set<Integer>) iterator2.next();
61 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
62 locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
64 HNode lowerNode = inputGraph.getHNode(higherName);
65 if (lowerNode != null && lowerNode.isSharedNode()) {
66 lattice.addSharedLoc(lowerName);
69 if (higher.size() == 0) {
71 lattice.put(lowerName);
73 lattice.addRelationHigherToLower(higherName, lowerName);
83 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
85 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
87 if (nodeFromSimpleGraph.isSkeleton()) {
88 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
91 Set<HNode> combineSkeletonNodeSet =
92 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
93 HNode combinationNodeInSCGraph =
94 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
95 .get(combineSkeletonNodeSet);
97 // Set<HNode> combineSkeletonNodeSet =
98 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
99 // HNode combinationNodeInSCGraph =
100 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
101 return combinationNodeInSCGraph;
104 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
105 SSJavaLattice<String> skeletonLattice) {
107 // perform DFS that starts from each skeleton/combination node and ends by another
108 // skeleton/combination node
110 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
111 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
112 LocationSummary locSummary = infer.getLocationSummary(desc);
114 SSJavaLattice<String> lattice = skeletonLattice.clone();
116 Set<HNode> visited = new HashSet<HNode>();
118 Set<HNode> nodeSet = simpleGraph.getNodeSet();
120 Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
122 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
123 HNode node = (HNode) iterator.next();
124 System.out.println("-node=" + node);
126 if (node.isSkeleton() && (!visited.contains(node))) {
129 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
130 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
131 HNode outNode = (HNode) iterator2.next();
133 if (!outNode.isSkeleton()) {
134 if (outNode.isCombinationNode()) {
135 // expand the combination node 'outNode'
136 // here we need to expand the corresponding combination location in the lattice
137 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, outNode);
139 Set<HNode> combineSkeletonNodeSet =
140 simpleGraph.getCombineSetByCombinationNode(outNode);
142 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
144 Set<HNode> combinationNodeSet =
145 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
147 // System.out.println("combinationNodeSet=" + combinationNodeSet);
149 Set<HNode> endNodeSetFromSimpleGraph =
150 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode,
152 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
153 Set<HNode> endCombNodeSet = new HashSet<HNode>();
154 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
155 HNode endNode = (HNode) iterator3.next();
156 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
158 // System.out.println("-endCombNodeSet=" + endCombNodeSet);
159 visited.add(outNode);
161 // follows the straight line up to another skeleton/combination node
162 if (endCombNodeSet.size() > 0) {
164 removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
165 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
166 mapIntermediateLoc, 1, locSummary, outNode);
167 // recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
168 // mapIntermediateLoc, 1, locSummary, outNode);
172 // we have a node that is neither combination or skeleton node
173 // System.out.println("skeleton node=" + node + " outNode=" + outNode);
174 HNode startNode = scGraph.getCurrentHNode(node);
176 // if (node.getDescriptor() != null) {
177 // // node is a skeleton node and it might be merged into another node in the SC
179 // startNode = scGraph.getHNode(node.getDescriptor());
181 // // this node has already been merged before the SC graph.
185 Set<HNode> endNodeSetFromSimpleGraph =
186 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
188 // System.out.println("endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph
189 // + " from=" + outNode);
190 Set<HNode> endCombNodeSet = new HashSet<HNode>();
191 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
192 HNode endNode = (HNode) iterator3.next();
193 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
196 visited.add(outNode);
197 if (endCombNodeSet.size() > 0) {
198 // follows the straight line up to another skeleton/combination node
199 endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
200 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
201 mapIntermediateLoc, 1, locSummary, outNode);
208 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
209 && !visited.contains(node)) {
211 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
213 Set<HNode> outNodeSet =
214 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
215 // Set<HNode> outNodeSet = simpleGraph.getOutgoingNodeSet(node);
216 System.out.println("this case? node=" + node + " outNodeSet=" + outNodeSet);
218 Set<String> belowSkeletonLocNameSet = new HashSet<String>();
219 Set<HNode> belowSCNodeSet = new HashSet<HNode>();
221 for (Iterator iterator2 = outNodeSet.iterator(); iterator2.hasNext();) {
222 HNode outNode = (HNode) iterator2.next();
223 if (outNode.isSkeleton()) {
224 belowSCNodeSet.add(scGraph.getCurrentHNode(outNode));
225 belowSkeletonLocNameSet.add(scGraph.getCurrentHNode(outNode).getName());
228 System.out.println("-belowSkeletonLocNameSet=" + belowSkeletonLocNameSet);
229 if (belowSkeletonLocNameSet.size() > 0) {
231 int count = simpleGraph.countHopFromTopLocation(node);
232 System.out.println("---count=" + count);
234 TripleItem item = new TripleItem(null, belowSCNodeSet, count);
235 if (!mapIntermediateLoc.containsKey(item)) {
236 String newLocName = "ILOC" + (seed++);
237 mapIntermediateLoc.put(item, newLocName);
238 lattice.insertNewLocationBetween(lattice.getTopItem(), belowSkeletonLocNameSet,
240 locSummary.addMapHNodeNameToLocationName(node.getName(), newLocName);
242 String locName = mapIntermediateLoc.get(item);
243 locSummary.addMapHNodeNameToLocationName(node.getName(), locName);
246 // if (!mapBelowNameSetToILOCName.containsKey(belowSkeletonLocNameSet)) {
247 // String newLocName = "ILOC" + (seed++);
248 // mapBelowNameSetToILOCName.put(belowSkeletonLocNameSet, newLocName);
249 // lattice.insertNewLocationBetween(lattice.getTopItem(), belowSkeletonLocNameSet,
251 // locSummary.addMapHNodeNameToLocationName(node.getName(), newLocName);
253 // String ilocName = mapBelowNameSetToILOCName.get(belowSkeletonLocNameSet);
254 // locSummary.addMapHNodeNameToLocationName(node.getName(), ilocName);
259 // System.out.println("---LocName=" + newLocName);
260 // lattice.put(newLocName);
270 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
271 Set<HNode> endNodeSet) {
273 // if an end node is not directly connected to the start node in the SC graph
274 // replace it with a directly connected one which transitively reaches to it.
276 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
277 Set<HNode> newEndNodeSet = new HashSet<HNode>();
279 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
280 HNode endNode = (HNode) iterator.next();
281 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
282 newEndNodeSet.add(endNode);
285 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
286 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
287 newEndNodeSet.add(newEndNode);
291 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
294 return newEndNodeSet;
298 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
299 HNode startNode, HNode endNode) {
300 Set<HNode> connected = new HashSet<HNode>();
301 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
302 return connected.iterator().next();
305 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
306 HNode startNode, HNode curNode, Set<HNode> connected) {
308 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
309 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
310 HNode inNode = (HNode) iterator.next();
311 if (inNode.equals(startNode)) {
312 connected.add(curNode);
314 // System.out.println("inNode=" + inNode);
315 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
321 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
322 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
323 int idx, LocationSummary locSummary, HNode curNode) {
325 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
326 // System.out.println("item=" + item);
327 if (!mapIntermediateLoc.containsKey(item)) {
328 // need to create a new intermediate location in the lattice
329 String newLocName = "ILOC" + (seed++);
332 above = startNode.getName();
334 int prevIdx = idx - 1;
335 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
336 above = mapIntermediateLoc.get(prevItem);
339 Set<String> belowSet = new HashSet<String>();
340 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
341 HNode endNode = (HNode) iterator.next();
342 belowSet.add(endNode.getName());
345 lattice.insertNewLocationBetween(above, belowSet, newLocName);
347 mapIntermediateLoc.put(item, newLocName);
350 String locName = mapIntermediateLoc.get(item);
351 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
353 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
354 Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
355 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
356 HNode outNode = (HNode) iterator2.next();
357 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
358 visited.add(outNode);
359 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
360 idx + 1, locSummary, outNode);
366 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
367 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
368 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
370 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
372 if (!mapIntermediateLoc.containsKey(item)) {
373 // need to create a new intermediate location in the lattice
376 String newLocName = combinationNodeInSCGraph.getName();
377 mapIntermediateLoc.put(item, newLocName);
379 String newLocName = "ILOC" + (seed++);
380 int prevIdx = idx - 1;
381 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
382 above = mapIntermediateLoc.get(prevItem);
384 Set<String> belowSet = new HashSet<String>();
385 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
386 HNode endNode = (HNode) iterator.next();
387 belowSet.add(endNode.getName());
389 lattice.insertNewLocationBetween(above, belowSet, newLocName);
390 mapIntermediateLoc.put(item, newLocName);
396 String locName = mapIntermediateLoc.get(item);
397 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
399 // System.out.println("-TripleItem=" + item);
400 // System.out.println("-curNode=" + curNode.getName() + " locName=" + locName);
402 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
403 Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
404 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
405 HNode outNode = (HNode) iterator2.next();
406 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
407 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
408 visited.add(outNode);
409 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
410 mapIntermediateLoc, idx + 1, locSummary, outNode);
417 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
418 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
420 if (mapF2LocName.containsKey(F)) {
421 return mapF2LocName.get(F);
424 HNode node = basisSet.getHNode(F);
426 mapF2LocName.put(F, node.getName());
427 return node.getName();
429 if (inputGraph.BASISTOPELEMENT.equals(F)) {
430 return SSJavaAnalysis.BOTTOM;
432 String str = "LOC" + (seed++);
433 mapF2LocName.put(F, str);
439 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
440 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
441 Set<Integer> F = iter.next();
442 mapFtoCount.put(F, 0);
446 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
448 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
449 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
451 // initialize COUNT(F) to 0 for all elements of the family
452 resetCount(mapFtoCount, family);
454 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
455 Set<Integer> F = iter.next();
456 Set<HNode> gammaF = family.getGamma(F);
458 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
459 curHNodeSet.removeAll(gammaF);
460 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
462 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
463 Set<Integer> B = (Set<Integer>) iterator.next();
465 Set<Integer> Fprime = new HashSet<Integer>();
470 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
472 // if |gamma(F')|==COUNT(F') + |gamma(F)|
473 int numGammaFprime = family.getGamma(Fprime).size();
474 int countFprime = mapFtoCount.get(Fprime);
475 int numGammaF = family.getGamma(F).size();
476 if (numGammaFprime == (countFprime + numGammaF)) {
477 // ImSucc(F)=IMSucc(F) union F'
478 addImSucc(mapImSucc, F, Fprime);
482 resetCount(mapFtoCount, family);
485 // System.out.println("mapImSucc=" + mapImSucc);
490 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
491 if (!mapImSucc.containsKey(F)) {
492 mapImSucc.put(F, new HashSet<Set<Integer>>());
494 return mapImSucc.get(F);
497 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
498 Set<Integer> Fprime) {
500 if (!mapImSucc.containsKey(F)) {
501 mapImSucc.put(F, new HashSet<Set<Integer>>());
504 mapImSucc.get(F).add(Fprime);
508 private Family generateFamily(BasisSet basisSet) {
510 Family family = new Family();
512 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
513 Set<Integer> B = iterator.next();
515 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
517 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
518 Set<Integer> F = iterator2.next();
520 Set<Integer> Fprime = new HashSet<Integer>();
524 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
525 gammaFPrimeSet.addAll(family.getGamma(F));
526 gammaFPrimeSet.add(basisSet.getHNode(B));
528 if (!family.containsF(Fprime)) {
529 Pair<Set<Integer>, Set<HNode>> pair =
530 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
533 family.updateGammaF(Fprime, gammaFPrimeSet);
537 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
539 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
540 family.addFElement(pair.getFirst());
541 family.updateGammaF(pair.getFirst(), pair.getSecond());
548 private void debug_print(HierarchyGraph inputGraph) {
549 System.out.println("\nBuild Lattice:" + inputGraph.getName());
550 // System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
551 // System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
560 public Identifier(HNode n, int i) {
565 public int hashCode() {
566 return node.hashCode() + idx;
569 public boolean equals(Object obj) {
571 if (obj instanceof Identifier) {
572 Identifier in = (Identifier) obj;
573 if (node.equals(in.node) && idx == in.idx) {
584 public HNode higherNode;
585 public Set<HNode> lowerNodeSet;
588 public TripleItem(HNode h, Set<HNode> l, int i) {
594 public int hashCode() {
597 if (higherNode != null) {
598 h = higherNode.hashCode();
601 return h + lowerNodeSet.hashCode() + idx;
604 public boolean equals(Object obj) {
606 if (obj instanceof TripleItem) {
607 TripleItem in = (TripleItem) obj;
608 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
609 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx) {
617 public String toString() {
618 return higherNode + "-" + idx + "->" + lowerNodeSet;