X-Git-Url: http://plrg.eecs.uci.edu/git/?p=IRC.git;a=blobdiff_plain;f=Robust%2Fsrc%2FAnalysis%2FSSJava%2FBuildLattice.java;h=adce54e507835d538961940090168271e27847a0;hp=b3cdd8ae29bfb01f5560f334673beabbce6e1af4;hb=d06acf1c0be1fa63f5505cbcc7943676c4c0f008;hpb=aec24fc101dec2a1ece71783932d11eb46704ebe diff --git a/Robust/src/Analysis/SSJava/BuildLattice.java b/Robust/src/Analysis/SSJava/BuildLattice.java index b3cdd8ae..adce54e5 100644 --- a/Robust/src/Analysis/SSJava/BuildLattice.java +++ b/Robust/src/Analysis/SSJava/BuildLattice.java @@ -3,25 +3,42 @@ package Analysis.SSJava; import java.util.HashMap; import java.util.HashSet; import java.util.Iterator; +import java.util.LinkedList; import java.util.Map; import java.util.Set; +import java.util.Stack; +import IR.ClassDescriptor; import IR.Descriptor; import IR.MethodDescriptor; +import IR.NameDescriptor; import Util.Pair; public class BuildLattice { - public static int seed = 0; private LocationInference infer; + private Map mapSharedNodeToTripleItem; + private Map mapHNodeToHighestIndex; - private final HNode topNode; - private final HNode bottomNode; + private Map> mapDescToIntermediateLocMap; + + private Map> mapDescToInterLocMap; + + private Map, Integer> mapItemToHighestIndex; + + private Map, Set> mapLatticeToLocalLocSet; + + private Map>> mapDescToLineListMap; public BuildLattice(LocationInference infer) { this.infer = infer; - topNode = new HNode(infer.ssjava.TOP); - bottomNode = new HNode(infer.ssjava.BOTTOM); + this.mapSharedNodeToTripleItem = new HashMap(); + this.mapHNodeToHighestIndex = new HashMap(); + this.mapItemToHighestIndex = new HashMap, Integer>(); + this.mapDescToIntermediateLocMap = new HashMap>(); + this.mapLatticeToLocalLocSet = new HashMap, Set>(); + this.mapDescToInterLocMap = new HashMap>(); + this.mapDescToLineListMap = new HashMap>>(); } public SSJavaLattice buildLattice(Descriptor desc) { @@ -29,6 +46,11 @@ public class BuildLattice { HierarchyGraph inputGraph = infer.getSkeletonCombinationHierarchyGraph(desc); LocationSummary locSummary = infer.getLocationSummary(desc); + HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc); + HierarchyGraph naiveGraph = simpleGraph.clone(); + + // I don't think we need to keep the below if statement anymore + // because hierarchy graph does not have any composite location Set nodeSetWithCompositeLocation = new HashSet(); if (desc instanceof MethodDescriptor) { FlowGraph flowGraph = infer.getFlowGraph((MethodDescriptor) desc); @@ -52,19 +74,71 @@ public class BuildLattice { } + // ///////////////////////////////////////////////////////////////////////////////////// + // lattice generation for the native approach + + if (infer.state.SSJAVA_INFER_NAIVE_WRITEDOTS) { + BasisSet naiveBasisSet = naiveGraph.computeBasisSet(nodeSetWithCompositeLocation); + + Family naiveFamily = generateFamily(naiveBasisSet); + Map, Set>> naive_mapImSucc = + coveringGraph(naiveBasisSet, naiveFamily); + + SSJavaLattice naive_lattice = + buildLattice(desc, naiveBasisSet, naiveGraph, null, naive_mapImSucc); + int numLocs = naive_lattice.getKeySet().size(); + LocationInference.numLocationsNaive += numLocs; + infer.mapNumLocsMapNaive.put(desc, new Integer(numLocs)); + + int numPaths = naive_lattice.countPaths(); + infer.mapNumPathsMapNaive.put(desc, new Integer(numPaths)); + + System.out.println(desc + " numPaths=" + numPaths + " numLocs=" + + naive_lattice.getKeySet().size()); + + infer.addNaiveLattice(desc, naive_lattice); + } + + // ///////////////////////////////////////////////////////////////////////////////////// + + // lattice generation for the proposed approach BasisSet basisSet = inputGraph.computeBasisSet(nodeSetWithCompositeLocation); - debug_print(inputGraph); + // debug_print(inputGraph); Family family = generateFamily(basisSet); Map, Set>> mapImSucc = coveringGraph(basisSet, family); - SSJavaLattice lattice = buildLattice(basisSet, inputGraph, locSummary, mapImSucc); + SSJavaLattice lattice = buildLattice(desc, basisSet, inputGraph, locSummary, mapImSucc); return lattice; } - private SSJavaLattice buildLattice(BasisSet basisSet, HierarchyGraph inputGraph, - LocationSummary locSummary, Map, Set>> mapImSucc) { + public void setIntermediateLocMap(Descriptor desc, Map map) { + mapDescToIntermediateLocMap.put(desc, map); + } + + public Map getIntermediateLocMap(Descriptor desc) { + if (!mapDescToIntermediateLocMap.containsKey(desc)) { + mapDescToIntermediateLocMap.put(desc, new HashMap()); + } + return mapDescToIntermediateLocMap.get(desc); + } + + private Descriptor getParent(Descriptor desc) { + if (desc instanceof MethodDescriptor) { + MethodDescriptor md = (MethodDescriptor) desc; + ClassDescriptor cd = md.getClassDesc(); + return infer.getParentMethodDesc(cd, md); + } else { + return ((ClassDescriptor) desc).getSuperDesc(); + } + } + + private SSJavaLattice buildLattice(Descriptor desc, BasisSet basisSet, + HierarchyGraph inputGraph, LocationSummary locSummary, + Map, Set>> mapImSucc) { + + System.out.println("\nBuild Lattice:" + inputGraph.getName()); SSJavaLattice lattice = new SSJavaLattice(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM); @@ -78,16 +152,27 @@ public class BuildLattice { String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher); HNode higherNode = inputGraph.getHNode(higherName); + + if (higherNode == null) { + NameDescriptor d = new NameDescriptor(higherName); + higherNode = inputGraph.getHNode(d); + higherNode.setSkeleton(true); + } + if (higherNode != null && higherNode.isSharedNode()) { lattice.addSharedLoc(higherName); } Set descSet = inputGraph.getDescSetOfNode(higherNode); // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet=" // + descSet); - for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) { - Descriptor d = (Descriptor) iterator2.next(); - locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName); + + if (locSummary != null) { + for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) { + Descriptor d = (Descriptor) iterator2.next(); + locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName); + } } + // locSummary.addMapHNodeNameToLocationName(higherName, higherName); Set> lowerSet = mapImSucc.get(higher); @@ -96,6 +181,17 @@ public class BuildLattice { String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower); HNode lowerNode = inputGraph.getHNode(lowerName); + + if (lowerNode == null && !lowerName.equals(SSJavaAnalysis.BOTTOM)) { + NameDescriptor d = new NameDescriptor(lowerName); + lowerNode = inputGraph.getHNode(d); + lowerNode.setSkeleton(true); + } + + if (lowerNode != null && !inputGraph.isDirectlyConnectedTo(higherNode, lowerNode)) { + inputGraph.addEdge(higherNode, lowerNode); + } + if (lowerNode != null && lowerNode.isSharedNode()) { lattice.addSharedLoc(lowerName); } @@ -103,9 +199,11 @@ public class BuildLattice { Set lowerDescSet = inputGraph.getDescSetOfNode(lowerNode); // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet=" // + lowerDescSet); - for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) { - Descriptor d = (Descriptor) iterator3.next(); - locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName); + if (locSummary != null) { + for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) { + Descriptor d = (Descriptor) iterator3.next(); + locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName); + } } // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName); @@ -120,6 +218,7 @@ public class BuildLattice { } + inputGraph.removeRedundantEdges(); return lattice; } @@ -147,141 +246,408 @@ public class BuildLattice { public SSJavaLattice insertIntermediateNodesToStraightLine(Descriptor desc, SSJavaLattice skeletonLattice) { - // perform DFS that starts from each skeleton/combination node and ends by another - // skeleton/combination node - - HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc); - HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc); + SSJavaLattice lattice = skeletonLattice.clone(); LocationSummary locSummary = infer.getLocationSummary(desc); - SSJavaLattice lattice = skeletonLattice.clone(); + Descriptor parentDesc = getParent(desc); + if (parentDesc != null) { + SSJavaLattice parentLattice = infer.getLattice(parentDesc); + + Map> parentMap = parentLattice.getTable(); + Set parentKeySet = parentMap.keySet(); + for (Iterator iterator = parentKeySet.iterator(); iterator.hasNext();) { + String parentKey = (String) iterator.next(); + Set parentValueSet = parentMap.get(parentKey); + for (Iterator iterator2 = parentValueSet.iterator(); iterator2.hasNext();) { + String value = (String) iterator2.next(); + lattice.put(parentKey, value); + } + } - Set visited = new HashSet(); + Set parentSharedLocSet = parentLattice.getSharedLocSet(); + for (Iterator iterator = parentSharedLocSet.iterator(); iterator.hasNext();) { + String parentSharedLoc = (String) iterator.next(); + lattice.addSharedLoc(parentSharedLoc); + } + } + + HierarchyGraph hierarchyGraph = infer.getSimpleHierarchyGraph(desc); + HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc); - Set nodeSet = simpleGraph.getNodeSet(); + Set hierarchyGraphNodeSet = hierarchyGraph.getNodeSet(); + for (Iterator iterator = hierarchyGraphNodeSet.iterator(); iterator.hasNext();) { + HNode hNode = (HNode) iterator.next(); + if (!hNode.isSkeleton()) { + // here we need to insert an intermediate node for the hNode + System.out.println("\n#local node=" + hNode); + + // 1) find the lowest node m in the lattice that is above hnode in the lattice + // 2) count the number of non-shared nodes d between the hnode and the node m + // int numNonSharedNodes; + int dist = 0; + + HNode SCNode; + Set combineSkeletonNodeSet = null; + Stack trace = new Stack(); + if (hNode.isDirectCombinationNode()) { + // this node itself is the lowest node m. it is the first node of the chain + Set combineSet = hierarchyGraph.getCombineSetByCombinationNode(hNode); + + System.out.println(" # direct combine node::combineSkeletonNodeSet=" + combineSet); + + SCNode = scGraph.getCombinationNode(combineSet); + // numNonSharedNodes = -1; + dist = 0; + if (hNode.isSharedNode()) { + trace.add("S"); + } else { + trace.add("N"); + } + } else { - Map mapIntermediateLoc = new HashMap(); + Set aboveSet = new HashSet(); + if (hNode.isCombinationNode()) { + // the current node is a combination node + combineSkeletonNodeSet = hierarchyGraph.getCombineSetByCombinationNode(hNode); + System.out.println(" combineSkeletonNodeSet=" + combineSkeletonNodeSet + + " combinationNode=" + scGraph.getCombinationNode(combineSkeletonNodeSet)); - for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) { - HNode node = (HNode) iterator.next(); - // System.out.println("node=" + node); - if (node.isSkeleton() && (!visited.contains(node))) { - visited.add(node); + scGraph.getCombinationNode(combineSkeletonNodeSet); - Set outSet = simpleGraph.getOutgoingNodeSet(node); - for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) { - HNode outNode = (HNode) iterator2.next(); + System.out.println(" firstnodeOfSimpleGraph=" + + hierarchyGraph.getFirstNodeOfCombinationNodeChainSet(combineSkeletonNodeSet)); + aboveSet.addAll(hierarchyGraph + .getFirstNodeOfCombinationNodeChainSet(combineSkeletonNodeSet)); - if (!outNode.isSkeleton()) { - if (outNode.isCombinationNode()) { - // expand the combination node 'outNode' - // here we need to expand the corresponding combination location in the lattice - HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, outNode); + SCNode = scGraph.getCombinationNode(combineSkeletonNodeSet); - Set combineSkeletonNodeSet = - simpleGraph.getCombineSetByCombinationNode(outNode); + } else { + // the current node is not a combination node + // there is only one parent node which should be skeleton node. - // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet); + // System.out.println(" hierarchyGraph.getSkeleteNodeSetReachTo(" + hNode + ")=" + // + hierarchyGraph.getSkeleteNodeSetReachTo(hNode)); - Set combinationNodeSet = - simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet); + Set reachToSet = hierarchyGraph.getSkeleteNodeSetReachTo(hNode); + for (Iterator iterator2 = reachToSet.iterator(); iterator2.hasNext();) { + HNode reachToNode = (HNode) iterator2.next(); + aboveSet.add(scGraph.getCurrentHNode(reachToNode)); + } - // System.out.println("combinationNodeSet=" + combinationNodeSet); + SCNode = aboveSet.iterator().next(); + } - Set endNodeSetFromSimpleGraph = - simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, - combinationNodeSet); - // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph); - Set endCombNodeSet = new HashSet(); - for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) { - HNode endNode = (HNode) iterator3.next(); - endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode)); - } - visited.add(outNode); + // update above set w.r.t the hierarchy graph with SC nodes + // because the skeleton nodes in the original hierarchy graph may be merged to a new node + Set endSet = new HashSet(); + for (Iterator iterator2 = aboveSet.iterator(); iterator2.hasNext();) { + HNode aboveNode = (HNode) iterator2.next(); + endSet.add(hierarchyGraph.getCurrentHNode(aboveNode)); + } - // follows the straight line up to another skeleton/combination node - if (endCombNodeSet.size() > 0) { - endCombNodeSet = - removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet); - recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited, - mapIntermediateLoc, 1, locSummary, outNode); - } + trace = hierarchyGraph.computeDistance(hNode, endSet, combineSkeletonNodeSet); - } else { - // we have a node that is neither combination or skeleton node - // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode); - HNode startNode = scGraph.getCurrentHNode(node); - - // if (node.getDescriptor() != null) { - // // node is a skeleton node and it might be merged into another node in the SC - // graph. - // startNode = scGraph.getHNode(node.getDescriptor()); - // } else { - // // this node has already been merged before the SC graph. - // startNode = node; - // } - - Set endNodeSetFromSimpleGraph = - simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null); - - // System.out.println("endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph - // + " from=" + outNode); - Set endCombNodeSet = new HashSet(); - for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) { - HNode endNode = (HNode) iterator3.next(); - endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode)); - } - // System.out.println("endCombNodeSet=" + endCombNodeSet); - visited.add(outNode); - if (endCombNodeSet.size() > 0) { - // follows the straight line up to another skeleton/combination node - endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet); - } else if (endCombNodeSet.size() == 0) { - // the outNode is (directly/transitively) connected to the bottom node - // therefore, we just add a dummy bottom HNode to the endCombNodeSet. - endCombNodeSet.add(bottomNode); - } - recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited, - mapIntermediateLoc, 1, locSummary, outNode); - } + System.out.println(" COUNT-RESULT::start=" + hNode + " end=" + endSet + " trace=" + + trace); + } + // 3) convert the node m into a chain of nodes with the last node in the chain having m's + // outgoing edges. + Set outgoingSCNodeSet = scGraph.getOutgoingNodeSet(SCNode); + System.out.println(" outgoing scnode set from " + SCNode + "=" + outgoingSCNodeSet); + + // convert hnodes to location names + String startLocName = locSummary.getLocationName(SCNode.getName()); + Set outgoingLocNameSet = new HashSet(); + for (Iterator iterator2 = outgoingSCNodeSet.iterator(); iterator2.hasNext();) { + HNode outSCNode = (HNode) iterator2.next(); + String locName = locSummary.getLocationName(outSCNode.getName()); + if (!locName.equals(outSCNode.getName())) { + System.out.println(" outSCNode=" + outSCNode + " -> locName=" + + locName); } + outgoingLocNameSet.add(locName); + } + if (outgoingLocNameSet.isEmpty()) { + outgoingLocNameSet.add(lattice.getBottomItem()); } - } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode() - && !visited.contains(node)) { - // an intermediate node 'node' may be located between "TOP" location and a skeleton node - int sizeIncomingNode = simpleGraph.getIncomingNodeSet(node).size(); + if (hNode.isCombinationNode()) { + System.out.println("make sure that the first node corresponds to the COMB node=" + + startLocName); + LineIdentifier lineId = new LineIdentifier(startLocName, outgoingLocNameSet); + LinkedList list = getLineList(desc, lineId); + // make sure that the first node corresponds to the COMB node + if (list.size() <= 0) { + list.add(new LocPair()); + } + LocPair firstPair = list.get(0); + firstPair.nonShared = startLocName; + } + + // 4) If hnode is not a shared location, check if there already exists a local variable + // node that has distance d below m along this chain. If such a node + // does not exist, insert it. + String locName = + getNewLocation(desc, startLocName, outgoingLocNameSet, trace, hNode.isSharedNode()); + + System.out.println(" ###hNode=" + hNode + "---->locName=" + locName); + locSummary.addMapHNodeNameToLocationName(hNode.getName(), locName); + + } + } + + insertLocalLocations(desc, lattice); + + return lattice; + } + + private void insertLocalLocations(Descriptor desc, SSJavaLattice lattice) { + + Map> map = getLineListMap(desc); + System.out.println("####MAP=" + map); + + Set lineIdSet = map.keySet(); + for (Iterator iterator = lineIdSet.iterator(); iterator.hasNext();) { + LineIdentifier lineId = (LineIdentifier) iterator.next(); - if (sizeIncomingNode == 0) { - // this node will be directly connected to the TOP location - // start adding the following nodes from this node + LinkedList list = map.get(lineId); - Set endNodeSetFromSimpleGraph = - simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null); + String higherLocName = lineId.startLoc; + Set endLocNameSet = lineId.lowerLocSet; - Set endCombNodeSet = new HashSet(); - for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) { - HNode endNode = (HNode) iterator3.next(); - endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode)); + for (int i = 0; i < list.size(); i++) { + LocPair pair = list.get(i); + + if (pair.nonShared != null) { + + if (!lattice.getKeySet().contains(pair.nonShared)) { + lattice.insertNewLocationBetween(higherLocName, endLocNameSet, pair.nonShared); } + higherLocName = pair.nonShared; + } - HNode startNode = topNode; - visited.add(startNode); - if (endCombNodeSet.size() > 0) { - // follows the straight line up to another skeleton/combination node - // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet); - recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited, - mapIntermediateLoc, 1, locSummary, node); + if (pair.shared != null) { + if (!lattice.getKeySet().contains(pair.shared)) { + lattice.insertNewLocationBetween(higherLocName, endLocNameSet, pair.shared); + lattice.addSharedLoc(pair.shared); } + higherLocName = pair.shared; + } + + } + + } + + } + + private void addLocalLocation(SSJavaLattice lattice, String localLoc) { + if (!mapLatticeToLocalLocSet.containsKey(lattice)) { + mapLatticeToLocalLocSet.put(lattice, new HashSet()); + } + mapLatticeToLocalLocSet.get(lattice).add(localLoc); + } + + private boolean isLocalLocation(SSJavaLattice lattice, String localLoc) { + if (mapLatticeToLocalLocSet.containsKey(lattice)) { + return mapLatticeToLocalLocSet.get(lattice).contains(localLoc); + } + return false; + } + + public Map getInterLocMap(Descriptor desc) { + if (!mapDescToInterLocMap.containsKey(desc)) { + mapDescToInterLocMap.put(desc, new HashMap()); + } + return mapDescToInterLocMap.get(desc); + } + + public Map> getLineListMap(Descriptor desc) { + if (!mapDescToLineListMap.containsKey(desc)) { + mapDescToLineListMap.put(desc, new HashMap>()); + } + return mapDescToLineListMap.get(desc); + } + + public LinkedList getLineList(Descriptor desc, LineIdentifier lineId) { + Map> map = getLineListMap(desc); + if (!map.containsKey(lineId)) { + map.put(lineId, new LinkedList()); + } + return map.get(lineId); + } + + private String generateNewLocName() { + String newLocName = "ILOC" + (LocationInference.locSeed++); + System.out.println("newLocName=" + newLocName); + return newLocName; + } + + public String getNewLocation(Descriptor desc, String start, Set endSet, + Stack trace, boolean isShared) { + + System.out.println(" #GetNewLocation start=" + start + " endSet=" + endSet + " trace=" + + trace); + LineIdentifier lineId = new LineIdentifier(start, endSet); + LinkedList list = getLineList(desc, lineId); + + int locPairIdx = trace.size() - 1; + + LocPair pair; + if (list.size() > locPairIdx) { + // there already exsits a list of nodes up to the current one + pair = list.get(locPairIdx); + // check if we need to add a new shared or non-shred node to the pair + if (isShared) { + if (pair.shared == null) { + pair.shared = generateNewLocName(); } + return pair.shared; + } else { + if (pair.nonShared == null) { + pair.nonShared = generateNewLocName(); + } + return pair.nonShared; + } + + } else { + // we need to set up a chain of intermediate nodes to the current one. + return recur_getNewLocation(0, list, trace); + } + + } + + private String recur_getNewLocation(int idx, LinkedList list, Stack trace) { + + String curType = trace.pop(); + boolean isCurShared = false; + if (curType.equals("S")) { + isCurShared = true; + } + + if (list.size() <= idx) { + // need to insert a new pair for the idx + list.add(new LocPair()); + } + // here, the list already has a pair for the idx + LocPair pair = list.get(idx); + if (isCurShared && pair.shared == null) { + pair.shared = generateNewLocName(); + } else if (!isCurShared && pair.nonShared == null) { + pair.nonShared = generateNewLocName(); + } + + if (trace.isEmpty()) { + if (isCurShared) { + return pair.shared; + } else { + return pair.nonShared; } } - return lattice; + idx++; + return recur_getNewLocation(idx, list, trace); + } + + private Set getAboveElementSet(SSJavaLattice lattice, String loc) { + + Set aboveSet = new HashSet(); + + Map> latticeMap = lattice.getTable(); + Set keySet = latticeMap.keySet(); + for (Iterator iterator = keySet.iterator(); iterator.hasNext();) { + String key = (String) iterator.next(); + if (latticeMap.get(key).contains(loc)) { + aboveSet.add(key); + } + } + + return aboveSet; + } + + private boolean needToExpandCombinationNode(Descriptor desc, HNode cnode) { + + System.out.println("needToExpandCombinationNode?=" + cnode); + + HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc); + // HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode); + Set combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode); + Set combinationNodeSetInSimpleGraph = + simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet); + System.out.println("---combinationNodeSetInSimpleGraph=" + combinationNodeSetInSimpleGraph); + Set inNodeSetToCNode = simpleGraph.getIncomingNodeSet(cnode); + System.out.println("------inNodeSetToCNode=" + inNodeSetToCNode); + for (Iterator iterator = combinationNodeSetInSimpleGraph.iterator(); iterator.hasNext();) { + HNode nodeBelongToTheSameCombinationNode = (HNode) iterator.next(); + if (inNodeSetToCNode.contains(nodeBelongToTheSameCombinationNode)) { + // the combination node 'cnode' is not the highest location among the same combination node + return false; + } + } + + return true; + } + + private void expandCombinationNode(Descriptor desc, SSJavaLattice lattice, + Set visited, Map mapIntermediateLoc, LocationSummary locSummary, + HNode cnode) { + + // expand the combination node 'outNode' + // here we need to expand the corresponding combination location in the lattice + HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode); + + System.out.println("expandCombinationNode=" + cnode + " cnode in scgraph=" + + combinationNodeInSCGraph); + + if (combinationNodeInSCGraph == null) { + return; + } + + HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc); + HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc); + + Set combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode); + + // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet); + + Set combinationNodeSet = + simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet); + + // System.out.println("combinationNodeSet=" + combinationNodeSet); + + // TODO + // Set endNodeSetFromSimpleGraph = + // simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet); + // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph); + // Set endCombNodeSet = new HashSet(); + // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) { + // HNode endNode = (HNode) iterator3.next(); + // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode)); + // } + + Set endCombNodeSet = scGraph.getOutgoingNodeSet(combinationNodeInSCGraph); + visited.add(cnode); + + // follows the straight line up to another skeleton/combination node + if (endCombNodeSet.size() > 0) { + // System.out.println("---endCombNodeSet=" + endCombNodeSet); + endCombNodeSet = + removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet); + + recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited, + mapIntermediateLoc, 1, locSummary, cnode); + } else { + endCombNodeSet.add(LocationInference.BOTTOMHNODE); + // System.out.println("---endCombNodeSet is zero"); + // System.out.println("---endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph); + // System.out.println("---incoming=" + simpleGraph.getIncomingNodeSet(cnode)); + recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited, + mapIntermediateLoc, 1, locSummary, cnode); + + } } @@ -292,8 +658,8 @@ public class BuildLattice { // replace it with a directly connected one which transitively reaches to it. HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc); - Set newEndNodeSet = new HashSet(); + Set newEndNodeSet = new HashSet(); for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) { HNode endNode = (HNode) iterator.next(); if (scGraph.isDirectlyConnectedTo(startNode, endNode)) { @@ -313,10 +679,65 @@ public class BuildLattice { } + private HNode getDirectlyReachableSCNodeFromEndNode(HierarchyGraph scGraph, HNode startNode, + Set endNodeSet) { + + // System.out.println("getDirectlyReachableSCNodeFromEndNode start=" + startNode + + // " endNodeSet=" + // + endNodeSet); + Set newStartNodeSet = new HashSet(); + + for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) { + HNode endNode = (HNode) iterator.next(); + Set connectedToEndNodeSet = scGraph.getIncomingNodeSet(endNode); + + for (Iterator iterator2 = connectedToEndNodeSet.iterator(); iterator2.hasNext();) { + HNode curNode = (HNode) iterator2.next(); + if (recurConnectedFromStartNode(scGraph, startNode, curNode, new HashSet())) { + newStartNodeSet.add(curNode); + } + } + } + + // System.out.println("newStartNodeSet=" + newStartNodeSet); + + if (newStartNodeSet.size() == 0) { + newStartNodeSet.add(startNode); + } + + return newStartNodeSet.iterator().next(); + } + + private boolean recurConnectedFromStartNode(HierarchyGraph scGraph, HNode startNode, + HNode curNode, Set visited) { + // return true if curNode is transitively connected from the startNode + + boolean isConnected = false; + Set inNodeSet = scGraph.getIncomingNodeSet(curNode); + for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) { + HNode in = (HNode) iterator.next(); + if (in.equals(startNode)) { + return true; + } else { + visited.add(in); + isConnected |= recurConnectedFromStartNode(scGraph, startNode, in, visited); + } + } + + return isConnected; + } + private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph, HNode startNode, HNode endNode) { + // System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode + // + " end=" + endNode); Set connected = new HashSet(); recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected); + if (connected.size() == 0) { + connected.add(endNode); + } + // System.out.println("connected=" + connected); + return connected.iterator().next(); } @@ -329,7 +750,6 @@ public class BuildLattice { if (inNode.equals(startNode)) { connected.add(curNode); } else { - // System.out.println("inNode=" + inNode); recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected); } } @@ -341,10 +761,9 @@ public class BuildLattice { int idx, LocationSummary locSummary, HNode curNode) { TripleItem item = new TripleItem(startNode, endNodeSet, idx); - // System.out.println("item=" + item); if (!mapIntermediateLoc.containsKey(item)) { // need to create a new intermediate location in the lattice - String newLocName = "ILOC" + (seed++); + String newLocName = "ILOC" + (LocationInference.locSeed++); String above; if (idx == 1) { above = startNode.getName(); @@ -357,32 +776,71 @@ public class BuildLattice { Set belowSet = new HashSet(); for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) { HNode endNode = (HNode) iterator.next(); - belowSet.add(endNode.getName()); + String locName; + if (locSummary.getMapHNodeNameToLocationName().containsKey(endNode.getName())) { + locName = locSummary.getLocationName(endNode.getName()); + } else { + locName = endNode.getName(); + } + belowSet.add(locName); } - lattice.insertNewLocationBetween(above, belowSet, newLocName); mapIntermediateLoc.put(item, newLocName); } String locName = mapIntermediateLoc.get(item); - HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc); + HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc); - Set descSet = graph.getDescSetOfNode(curNode); - for (Iterator iterator = descSet.iterator(); iterator.hasNext();) { - Descriptor d = (Descriptor) iterator.next(); - locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName); + if (curNode.isSharedNode()) { + // if the current node is shared location, add a shared location to the lattice later + System.out.println("###SHARED ITEM=" + item); + mapSharedNodeToTripleItem.put(curNode, item); + } else { + Set descSet = simpleHierarchyGraph.getDescSetOfNode(curNode); + for (Iterator iterator = descSet.iterator(); iterator.hasNext();) { + Descriptor d = (Descriptor) iterator.next(); + locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName); + } + locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName); } - // locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName); - Set outSet = graph.getOutgoingNodeSet(curNode); + System.out.println("-TripleItem normal=" + item); + System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode() + + " locName=" + locName + " isC=" + curNode.isCombinationNode()); + + Set outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode); for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) { HNode outNode = (HNode) iterator2.next(); + + Set incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode); + System.out.println("outNode=" + outNode); + System.out.println("---incomingHNodeSetToOutNode=" + incomingHNodeSetToOutNode); + if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) { - visited.add(outNode); - recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc, - idx + 1, locSummary, outNode); + Pair pair = new Pair(startNode, outNode); + if (visited.containsAll(simpleHierarchyGraph.getIncomingNodeSet(outNode))) { + visited.add(outNode); + int newidx = getCurrentHighestIndex(pair, idx + 1); + // int newidx = getCurrentHighestIndex(outNode, idx + 1); + recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc, + newidx, locSummary, outNode); + // recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc, + // idx + 1, locSummary, outNode); + } else { + updateHighestIndex(pair, idx + 1); + // updateHighestIndex(outNode, idx + 1); + System.out.println("NOT RECUR"); + } + } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) { + if (needToExpandCombinationNode(desc, outNode)) { + System.out.println("NEED TO"); + expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode); + } else { + System.out.println("NOT NEED TO"); + } } + } } @@ -400,7 +858,7 @@ public class BuildLattice { String newLocName = combinationNodeInSCGraph.getName(); mapIntermediateLoc.put(item, newLocName); } else { - String newLocName = "ILOC" + (seed++); + String newLocName = "ILOC" + (LocationInference.locSeed++); int prevIdx = idx - 1; TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx); above = mapIntermediateLoc.get(prevItem); @@ -412,36 +870,142 @@ public class BuildLattice { } lattice.insertNewLocationBetween(above, belowSet, newLocName); mapIntermediateLoc.put(item, newLocName); - } } - HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc); + // TODO + // Do we need to skip the combination node and assign a shared location to the next node? + // if (idx == 1 && curNode.isSharedNode()) { + // System.out.println("THE FIRST COMBINATION NODE EXPANSION IS SHARED!"); + // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, mapIntermediateLoc, + // idx + 1, locSummary, curNode); + // return; + // } + + HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc); String locName = mapIntermediateLoc.get(item); - Set descSet = graph.getDescSetOfNode(curNode); - for (Iterator iterator = descSet.iterator(); iterator.hasNext();) { - Descriptor d = (Descriptor) iterator.next(); - locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName); + if (curNode.isSharedNode()) { + // if the current node is shared location, add a shared location to the lattice later + System.out.println("###SHARED ITEM=" + item); + mapSharedNodeToTripleItem.put(curNode, item); + } else { + Set descSet = simpleHierarchyGraph.getDescSetOfNode(curNode); + for (Iterator iterator = descSet.iterator(); iterator.hasNext();) { + Descriptor d = (Descriptor) iterator.next(); + locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName); + } + locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName); } - // System.out.println("-TripleItem=" + item); - // System.out.println("-curNode=" + curNode.getName() + " locName=" + locName); + System.out.println("-TripleItem=" + item); + System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode() + + " locName=" + locName); - Set outSet = graph.getOutgoingNodeSet(curNode); + Set outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode); for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) { HNode outNode = (HNode) iterator2.next(); + System.out.println("---recurDFS outNode=" + outNode); + System.out.println("---cur combinationNodeInSCGraph=" + combinationNodeInSCGraph); + System.out.println("---outNode combinationNodeInSCGraph=" + + getCombinationNodeInSCGraph(desc, outNode)); + if (!outNode.isSkeleton() && !visited.contains(outNode)) { - if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) { - visited.add(outNode); - recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, - mapIntermediateLoc, idx + 1, locSummary, outNode); + if (outNode.isCombinationNode()) { + + Set combineSkeletonNodeSet = + simpleHierarchyGraph.getCombineSetByCombinationNode(outNode); + Set incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode); + // extract nodes belong to the same combine node + Set incomingCombinedHNodeSet = new HashSet(); + for (Iterator iterator = incomingHNodeSetToOutNode.iterator(); iterator.hasNext();) { + HNode inNode = (HNode) iterator.next(); + if (combineSkeletonNodeSet.contains(inNode)) { + incomingCombinedHNodeSet.add(inNode); + } + } + System.out.println("-----incomingCombinedHNodeSet=" + incomingCombinedHNodeSet); + + // check whether the next combination node is different from the current node + if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) { + Pair pair = new Pair(combinationNodeInSCGraph, outNode); + if (visited.containsAll(incomingCombinedHNodeSet)) { + visited.add(outNode); + System.out.println("-------curIdx=" + (idx + 1)); + + int newIdx = getCurrentHighestIndex(pair, idx + 1); + // int newIdx = getCurrentHighestIndex(outNode, idx + 1); + System.out.println("-------newIdx=" + newIdx); + recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, + mapIntermediateLoc, newIdx, locSummary, outNode); + // recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited, + // mapIntermediateLoc, idx + 1, locSummary, outNode); + } else { + updateHighestIndex(pair, idx + 1); + // updateHighestIndex(outNode, idx + 1); + System.out.println("-----NOT RECUR!"); + } + } else { + if (needToExpandCombinationNode(desc, outNode)) { + System.out.println("NEED TO"); + expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode); + } else { + System.out.println("NOT NEED TO"); + } + + } } } + // } + } } + private int getCurrentHighestIndex(Pair pair, int curIdx) { + int recordedIdx = getCurrentHighestIndex(pair); + if (recordedIdx > curIdx) { + return recordedIdx; + } else { + return curIdx; + } + } + + private int getCurrentHighestIndex(HNode node, int curIdx) { + int recordedIdx = getCurrentHighestIndex(node); + if (recordedIdx > curIdx) { + return recordedIdx; + } else { + return curIdx; + } + } + + private int getCurrentHighestIndex(Pair pair) { + if (!mapItemToHighestIndex.containsKey(pair)) { + mapItemToHighestIndex.put(pair, new Integer(-1)); + } + return mapItemToHighestIndex.get(pair).intValue(); + } + + private void updateHighestIndex(Pair pair, int idx) { + if (idx > getCurrentHighestIndex(pair)) { + mapItemToHighestIndex.put(pair, new Integer(idx)); + } + } + + private int getCurrentHighestIndex(HNode node) { + if (!mapHNodeToHighestIndex.containsKey(node)) { + mapHNodeToHighestIndex.put(node, new Integer(-1)); + } + return mapHNodeToHighestIndex.get(node).intValue(); + } + + private void updateHighestIndex(HNode node, int idx) { + if (idx > getCurrentHighestIndex(node)) { + mapHNodeToHighestIndex.put(node, new Integer(idx)); + } + } + private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph, Map, String> mapF2LocName, Set F) { @@ -457,7 +1021,7 @@ public class BuildLattice { if (inputGraph.BASISTOPELEMENT.equals(F)) { return SSJavaAnalysis.BOTTOM; } else { - String str = "LOC" + (seed++); + String str = "LOC" + (LocationInference.locSeed++); mapF2LocName.put(F, str); return str; } @@ -575,8 +1139,8 @@ public class BuildLattice { private void debug_print(HierarchyGraph inputGraph) { System.out.println("\nBuild Lattice:" + inputGraph.getName()); - // System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex()); - // System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis()); + System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex()); + System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis()); } } @@ -608,15 +1172,142 @@ class Identifier { } +class LocPair { + public String nonShared; + public String shared; + + public int hashCode() { + int h = 0; + if (nonShared != null) { + h = nonShared.hashCode(); + } + if (shared != null) { + h = shared.hashCode(); + } + return h; + } + + public boolean equals(Object obj) { + + if (obj instanceof LocPair) { + LocPair in = (LocPair) obj; + + if ((nonShared == null && in.nonShared == null) + || (nonShared != null && nonShared.equals(in.nonShared))) { + + if ((shared == null && in.shared == null) || (shared != null && shared.equals(in.shared))) { + return true; + } + + } + + } + + return false; + } + + public String toString() { + String rtr = "<" + nonShared + "," + shared + ">"; + return rtr; + } +} + +class LineIdentifier { + public String startLoc; + public Set lowerLocSet; + + public LineIdentifier(String s, Set lSet) { + startLoc = s; + lowerLocSet = lSet; + } + + public int hashCode() { + int h = 0; + h = startLoc.hashCode(); + return h + lowerLocSet.hashCode(); + } + + public boolean equals(Object obj) { + + if (obj instanceof LineIdentifier) { + LineIdentifier in = (LineIdentifier) obj; + if (startLoc.equals(in.startLoc) && lowerLocSet.equals(in.lowerLocSet)) { + return true; + } + } + + return false; + } + + public String toString() { + String rtr = startLoc + "->" + lowerLocSet; + return rtr; + } + +} + +class InterLocItem { + public String startLoc; + public Set lowerLocSet; + public int idx; + + public InterLocItem(String h, Set l, int i) { + startLoc = h; + lowerLocSet = l; + idx = i; + } + + public int hashCode() { + + int h = 0; + if (startLoc != null) { + h = startLoc.hashCode(); + } + + return h + lowerLocSet.hashCode() + idx; + } + + public boolean equals(Object obj) { + + if (obj instanceof InterLocItem) { + InterLocItem in = (InterLocItem) obj; + if ((startLoc == null || (startLoc != null && startLoc.equals(in.startLoc))) + && lowerLocSet.equals(in.lowerLocSet) && idx == in.idx) { + return true; + } + } + + return false; + } + + public String toString() { + String rtr = startLoc + "-" + idx + "->" + lowerLocSet; + if (idx % 2 != 0) { + rtr += " S"; + } + return rtr; + } +} + class TripleItem { public HNode higherNode; public Set lowerNodeSet; public int idx; + public boolean isShared; public TripleItem(HNode h, Set l, int i) { higherNode = h; lowerNodeSet = l; idx = i; + isShared = false; + } + + public void setShared(boolean in) { + this.isShared = in; + } + + public boolean isShared() { + return isShared; } public int hashCode() { @@ -626,6 +1317,10 @@ class TripleItem { h = higherNode.hashCode(); } + if (isShared) { + h++; + } + return h + lowerNodeSet.hashCode() + idx; } @@ -634,7 +1329,7 @@ class TripleItem { if (obj instanceof TripleItem) { TripleItem in = (TripleItem) obj; if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode))) - && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx) { + && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx && isShared == in.isShared()) { return true; } } @@ -643,6 +1338,11 @@ class TripleItem { } public String toString() { - return higherNode + "-" + idx + "->" + lowerNodeSet; + String rtr = higherNode + "-" + idx + "->" + lowerNodeSet; + if (isShared) { + rtr += " S"; + } + return rtr; } + }