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 {
private LocationInference infer;
private Map<HNode, TripleItem> mapSharedNodeToTripleItem;
+ private Map<HNode, Integer> mapHNodeToHighestIndex;
+
+ private Map<Descriptor, Map<TripleItem, String>> mapDescToIntermediateLocMap;
+
+ private Map<Descriptor, Map<InterLocItem, String>> mapDescToInterLocMap;
+
+ private Map<Pair<HNode, HNode>, Integer> mapItemToHighestIndex;
+
+ private Map<SSJavaLattice<String>, Set<String>> mapLatticeToLocalLocSet;
+
+ private Map<Descriptor, Map<LineIdentifier, LinkedList<LocPair>>> mapDescToLineListMap;
public BuildLattice(LocationInference infer) {
this.infer = infer;
this.mapSharedNodeToTripleItem = new HashMap<HNode, TripleItem>();
+ this.mapHNodeToHighestIndex = new HashMap<HNode, Integer>();
+ this.mapItemToHighestIndex = new HashMap<Pair<HNode, HNode>, Integer>();
+ this.mapDescToIntermediateLocMap = new HashMap<Descriptor, Map<TripleItem, String>>();
+ this.mapLatticeToLocalLocSet = new HashMap<SSJavaLattice<String>, Set<String>>();
+ this.mapDescToInterLocMap = new HashMap<Descriptor, Map<InterLocItem, String>>();
+ this.mapDescToLineListMap = new HashMap<Descriptor, Map<LineIdentifier, LinkedList<LocPair>>>();
}
public SSJavaLattice<String> buildLattice(Descriptor desc) {
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<HNode> nodeSetWithCompositeLocation = new HashSet<HNode>();
if (desc instanceof MethodDescriptor) {
FlowGraph flowGraph = infer.getFlowGraph((MethodDescriptor) desc);
}
+ // /////////////////////////////////////////////////////////////////////////////////////
+ // lattice generation for the native approach
+
+ if (infer.state.SSJAVA_INFER_NAIVE_WRITEDOTS) {
+ BasisSet naiveBasisSet = naiveGraph.computeBasisSet(nodeSetWithCompositeLocation);
+
+ Family naiveFamily = generateFamily(naiveBasisSet);
+ Map<Set<Integer>, Set<Set<Integer>>> naive_mapImSucc =
+ coveringGraph(naiveBasisSet, naiveFamily);
+
+ SSJavaLattice<String> 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<Integer>, Set<Set<Integer>>> mapImSucc = coveringGraph(basisSet, family);
- SSJavaLattice<String> lattice = buildLattice(basisSet, inputGraph, locSummary, mapImSucc);
+ SSJavaLattice<String> lattice = buildLattice(desc, basisSet, inputGraph, locSummary, mapImSucc);
return lattice;
}
- private SSJavaLattice<String> buildLattice(BasisSet basisSet, HierarchyGraph inputGraph,
- LocationSummary locSummary, Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
+ public void setIntermediateLocMap(Descriptor desc, Map<TripleItem, String> map) {
+ mapDescToIntermediateLocMap.put(desc, map);
+ }
+
+ public Map<TripleItem, String> getIntermediateLocMap(Descriptor desc) {
+ if (!mapDescToIntermediateLocMap.containsKey(desc)) {
+ mapDescToIntermediateLocMap.put(desc, new HashMap<TripleItem, String>());
+ }
+ 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<String> buildLattice(Descriptor desc, BasisSet basisSet,
+ HierarchyGraph inputGraph, LocationSummary locSummary,
+ Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
+
+ System.out.println("\nBuild Lattice:" + inputGraph.getName());
SSJavaLattice<String> lattice =
new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
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<Descriptor> 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<Set<Integer>> lowerSet = mapImSucc.get(higher);
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);
}
Set<Descriptor> 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);
}
+ inputGraph.removeRedundantEdges();
return lattice;
}
public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
SSJavaLattice<String> skeletonLattice) {
- // perform DFS that starts from each skeleton/combination node and ends by another
- // skeleton/combination node
+ SSJavaLattice<String> lattice = skeletonLattice.clone();
+ LocationSummary locSummary = infer.getLocationSummary(desc);
+
+ Descriptor parentDesc = getParent(desc);
+ if (parentDesc != null) {
+ SSJavaLattice<String> parentLattice = infer.getLattice(parentDesc);
+
+ Map<String, Set<String>> parentMap = parentLattice.getTable();
+ Set<String> parentKeySet = parentMap.keySet();
+ for (Iterator iterator = parentKeySet.iterator(); iterator.hasNext();) {
+ String parentKey = (String) iterator.next();
+ Set<String> parentValueSet = parentMap.get(parentKey);
+ for (Iterator iterator2 = parentValueSet.iterator(); iterator2.hasNext();) {
+ String value = (String) iterator2.next();
+ lattice.put(parentKey, value);
+ }
+ }
- mapSharedNodeToTripleItem.clear();
+ Set<String> parentSharedLocSet = parentLattice.getSharedLocSet();
+ for (Iterator iterator = parentSharedLocSet.iterator(); iterator.hasNext();) {
+ String parentSharedLoc = (String) iterator.next();
+ lattice.addSharedLoc(parentSharedLoc);
+ }
+ }
- HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
+ HierarchyGraph hierarchyGraph = infer.getSimpleHierarchyGraph(desc);
HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
- LocationSummary locSummary = infer.getLocationSummary(desc);
- SSJavaLattice<String> lattice = skeletonLattice.clone();
+ Set<HNode> 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<HNode> combineSkeletonNodeSet = null;
+ Stack<String> trace = new Stack<String>();
+ if (hNode.isDirectCombinationNode()) {
+ // this node itself is the lowest node m. it is the first node of the chain
+ Set<HNode> 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 {
- Set<HNode> visited = new HashSet<HNode>();
+ Set<HNode> aboveSet = new HashSet<HNode>();
+ if (hNode.isCombinationNode()) {
+ // the current node is a combination node
+ combineSkeletonNodeSet = hierarchyGraph.getCombineSetByCombinationNode(hNode);
+ System.out.println(" combineSkeletonNodeSet=" + combineSkeletonNodeSet
+ + " combinationNode=" + scGraph.getCombinationNode(combineSkeletonNodeSet));
- Set<HNode> nodeSet = simpleGraph.getNodeSet();
+ scGraph.getCombinationNode(combineSkeletonNodeSet);
- Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
+ System.out.println(" firstnodeOfSimpleGraph="
+ + hierarchyGraph.getFirstNodeOfCombinationNodeChainSet(combineSkeletonNodeSet));
+ aboveSet.addAll(hierarchyGraph
+ .getFirstNodeOfCombinationNodeChainSet(combineSkeletonNodeSet));
- // System.out.println("*insert=" + desc);
- // System.out.println("***nodeSet=" + nodeSet);
- for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
- HNode node = (HNode) iterator.next();
- // System.out.println("node=" + node);
+ SCNode = scGraph.getCombinationNode(combineSkeletonNodeSet);
- if (node.isSkeleton() && (!visited.contains(node))) {
- visited.add(node);
+ } else {
+ // the current node is not a combination node
+ // there is only one parent node which should be skeleton node.
- Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
- for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
- HNode outNode = (HNode) iterator2.next();
+ // System.out.println(" hierarchyGraph.getSkeleteNodeSetReachTo(" + hNode + ")="
+ // + hierarchyGraph.getSkeleteNodeSetReachTo(hNode));
- if (!outNode.isSkeleton()) {
- if (outNode.isCombinationNode()) {
- expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
- } 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<HNode> endNodeSetFromSimpleGraph =
- simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
-
- // System.out.println("endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph
- // + " from=" + outNode);
- Set<HNode> endCombNodeSet = new HashSet<HNode>();
- 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(LocationInference.BOTTOMHNODE);
- }
-
- recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
- mapIntermediateLoc, 1, locSummary, outNode);
+ Set<HNode> reachToSet = hierarchyGraph.getSkeleteNodeSetReachTo(hNode);
+ for (Iterator iterator2 = reachToSet.iterator(); iterator2.hasNext();) {
+ HNode reachToNode = (HNode) iterator2.next();
+ aboveSet.add(scGraph.getCurrentHNode(reachToNode));
}
+ SCNode = aboveSet.iterator().next();
}
- }
- } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
- && !visited.contains(node)) {
+ // 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<HNode> endSet = new HashSet<HNode>();
+ for (Iterator iterator2 = aboveSet.iterator(); iterator2.hasNext();) {
+ HNode aboveNode = (HNode) iterator2.next();
+ endSet.add(hierarchyGraph.getCurrentHNode(aboveNode));
+ }
- System.out.println("n=" + node);
+ trace = hierarchyGraph.computeDistance(hNode, endSet, combineSkeletonNodeSet);
- // an intermediate node 'node' may be located between "TOP" location and a skeleton node
- if (simpleGraph.getIncomingNodeSet(node).size() == 0) {
+ System.out.println(" COUNT-RESULT::start=" + hNode + " end=" + endSet + " trace="
+ + trace);
+ }
- // this node will be directly connected to the TOP location
- // start adding the following nodes from this node
+ // 3) convert the node m into a chain of nodes with the last node in the chain having m's
+ // outgoing edges.
+ Set<HNode> 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<String> outgoingLocNameSet = new HashSet<String>();
+ 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);
+ }
- Set<HNode> endNodeSetFromSimpleGraph =
- simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
+ if (outgoingLocNameSet.isEmpty()) {
+ outgoingLocNameSet.add(lattice.getBottomItem());
+ }
- Set<HNode> endCombNodeSet = new HashSet<HNode>();
- for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
- HNode endNode = (HNode) iterator3.next();
- endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
+ 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<LocPair> 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;
+ }
- System.out.println("endCombNodeSet=" + endCombNodeSet);
- HNode startNode = LocationInference.TOPHNODE;
- 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);
+ // 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<String> lattice) {
+
+ Map<LineIdentifier, LinkedList<LocPair>> map = getLineListMap(desc);
+ System.out.println("####MAP=" + map);
+
+ Set<LineIdentifier> lineIdSet = map.keySet();
+ for (Iterator iterator = lineIdSet.iterator(); iterator.hasNext();) {
+ LineIdentifier lineId = (LineIdentifier) iterator.next();
+
+ LinkedList<LocPair> list = map.get(lineId);
+
+ String higherLocName = lineId.startLoc;
+ Set<String> endLocNameSet = lineId.lowerLocSet;
+
+ 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;
+ }
+ if (pair.shared != null) {
+ if (!lattice.getKeySet().contains(pair.shared)) {
+ lattice.insertNewLocationBetween(higherLocName, endLocNameSet, pair.shared);
+ lattice.addSharedLoc(pair.shared);
+ }
+ higherLocName = pair.shared;
}
}
+
}
- // add shared locations
- Set<HNode> sharedNodeSet = mapSharedNodeToTripleItem.keySet();
- for (Iterator iterator = sharedNodeSet.iterator(); iterator.hasNext();) {
- HNode sharedNode = (HNode) iterator.next();
- TripleItem item = mapSharedNodeToTripleItem.get(sharedNode);
- String nonSharedLocName = mapIntermediateLoc.get(item);
- // System.out.println("sharedNode=" + sharedNode + " locName=" + nonSharedLocName);
+ }
+
+ private void addLocalLocation(SSJavaLattice<String> lattice, String localLoc) {
+ if (!mapLatticeToLocalLocSet.containsKey(lattice)) {
+ mapLatticeToLocalLocSet.put(lattice, new HashSet<String>());
+ }
+ mapLatticeToLocalLocSet.get(lattice).add(localLoc);
+ }
- String newLocName;
- if (locSummary.getHNodeNameSetByLatticeLoationName(nonSharedLocName) != null
- && !lattice.isSharedLoc(nonSharedLocName)) {
- // need to generate a new shared location in the lattice, which is one level lower than the
- // 'locName' location
- newLocName = "ILOC" + (LocationInference.locSeed++);
+ private boolean isLocalLocation(SSJavaLattice<String> lattice, String localLoc) {
+ if (mapLatticeToLocalLocSet.containsKey(lattice)) {
+ return mapLatticeToLocalLocSet.get(lattice).contains(localLoc);
+ }
+ return false;
+ }
- // Set<String> aboveElementSet = getAboveElementSet(lattice, locName);
- Set<String> belowElementSet = new HashSet<String>();
- belowElementSet.addAll(lattice.get(nonSharedLocName));
+ public Map<InterLocItem, String> getInterLocMap(Descriptor desc) {
+ if (!mapDescToInterLocMap.containsKey(desc)) {
+ mapDescToInterLocMap.put(desc, new HashMap<InterLocItem, String>());
+ }
+ return mapDescToInterLocMap.get(desc);
+ }
- // System.out.println("nonSharedLocName=" + nonSharedLocName + " belowElementSet="
- // + belowElementSet + " newLocName=" + newLocName);
+ public Map<LineIdentifier, LinkedList<LocPair>> getLineListMap(Descriptor desc) {
+ if (!mapDescToLineListMap.containsKey(desc)) {
+ mapDescToLineListMap.put(desc, new HashMap<LineIdentifier, LinkedList<LocPair>>());
+ }
+ return mapDescToLineListMap.get(desc);
+ }
- lattice.insertNewLocationBetween(nonSharedLocName, belowElementSet, newLocName);
+ public LinkedList<LocPair> getLineList(Descriptor desc, LineIdentifier lineId) {
+ Map<LineIdentifier, LinkedList<LocPair>> map = getLineListMap(desc);
+ if (!map.containsKey(lineId)) {
+ map.put(lineId, new LinkedList<LocPair>());
+ }
+ 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<String> endSet,
+ Stack<String> trace, boolean isShared) {
+
+ System.out.println(" #GetNewLocation start=" + start + " endSet=" + endSet + " trace="
+ + trace);
+
+ LineIdentifier lineId = new LineIdentifier(start, endSet);
+ LinkedList<LocPair> 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 {
- newLocName = nonSharedLocName;
+ if (pair.nonShared == null) {
+ pair.nonShared = generateNewLocName();
+ }
+ return pair.nonShared;
}
- lattice.addSharedLoc(newLocName);
- HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
- Set<Descriptor> descSet = graph.getDescSetOfNode(sharedNode);
- for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
- Descriptor d = (Descriptor) iterator2.next();
- locSummary.addMapHNodeNameToLocationName(d.getSymbol(), newLocName);
- }
- locSummary.addMapHNodeNameToLocationName(sharedNode.getName(), newLocName);
+ } 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<LocPair> list, Stack<String> trace) {
+
+ String curType = trace.pop();
+ boolean isCurShared = false;
+ if (curType.equals("S")) {
+ isCurShared = true;
}
- return lattice;
+ 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;
+ }
+ }
+ idx++;
+ return recur_getNewLocation(idx, list, trace);
}
private Set<String> getAboveElementSet(SSJavaLattice<String> lattice, String loc) {
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<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
+ Set<HNode> combinationNodeSetInSimpleGraph =
+ simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
+ System.out.println("---combinationNodeSetInSimpleGraph=" + combinationNodeSetInSimpleGraph);
+ Set<HNode> 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<String> lattice,
Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
HNode cnode) {
- // System.out.println("expandCombinationNode=" + 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<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
// System.out.println("combinationNodeSet=" + combinationNodeSet);
- Set<HNode> endNodeSetFromSimpleGraph =
- simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
+ // TODO
+ // Set<HNode> endNodeSetFromSimpleGraph =
+ // simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
// System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
- Set<HNode> endCombNodeSet = new HashSet<HNode>();
- for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
- HNode endNode = (HNode) iterator3.next();
- endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
- }
+ // Set<HNode> endCombNodeSet = new HashSet<HNode>();
+ // for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
+ // HNode endNode = (HNode) iterator3.next();
+ // endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
+ // }
+
+ Set<HNode> endCombNodeSet = scGraph.getOutgoingNodeSet(combinationNodeInSCGraph);
visited.add(cnode);
// follows the straight line up to another skeleton/combination node
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" + (LocationInference.locSeed++);
}
String locName = mapIntermediateLoc.get(item);
- HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
+ HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
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<Descriptor> descSet = graph.getDescSetOfNode(curNode);
+ Set<Descriptor> 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() + " S=" + curNode.isSharedNode()
- // + " locName=" + locName);
+ System.out.println("-TripleItem normal=" + item);
+ System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
+ + " locName=" + locName + " isC=" + curNode.isCombinationNode());
- Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
+ Set<HNode> outSet = simpleHierarchyGraph.getOutgoingNodeSet(curNode);
for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
HNode outNode = (HNode) iterator2.next();
+
+ Set<HNode> 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<HNode, HNode> 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)) {
- expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
+ if (needToExpandCombinationNode(desc, outNode)) {
+ System.out.println("NEED TO");
+ expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
+ } else {
+ System.out.println("NOT NEED TO");
+ }
}
+
}
}
// return;
// }
- HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
+ HierarchyGraph simpleHierarchyGraph = infer.getSimpleHierarchyGraph(desc);
String locName = mapIntermediateLoc.get(item);
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<Descriptor> descSet = graph.getDescSetOfNode(curNode);
+ Set<Descriptor> 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() + " S=" + curNode.isSharedNode()
- // + " locName=" + locName);
+ System.out.println("-TripleItem=" + item);
+ System.out.println("-curNode=" + curNode.getName() + " S=" + curNode.isSharedNode()
+ + " locName=" + locName);
- Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
+ Set<HNode> 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));
+ 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 (outNode.isCombinationNode()) {
+
+ Set<HNode> combineSkeletonNodeSet =
+ simpleHierarchyGraph.getCombineSetByCombinationNode(outNode);
+ Set<HNode> incomingHNodeSetToOutNode = simpleHierarchyGraph.getIncomingNodeSet(outNode);
+ // extract nodes belong to the same combine node
+ Set<HNode> incomingCombinedHNodeSet = new HashSet<HNode>();
+ 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))) {
- visited.add(outNode);
- recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
- mapIntermediateLoc, idx + 1, locSummary, outNode);
+ Pair<HNode, HNode> 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 {
- expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
+ 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<HNode, HNode> 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<HNode, HNode> pair) {
+ if (!mapItemToHighestIndex.containsKey(pair)) {
+ mapItemToHighestIndex.put(pair, new Integer(-1));
+ }
+ return mapItemToHighestIndex.get(pair).intValue();
+ }
+
+ private void updateHighestIndex(Pair<HNode, HNode> 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,
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());
}
}
}
+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<String> lowerLocSet;
+
+ public LineIdentifier(String s, Set<String> 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<String> lowerLocSet;
+ public int idx;
+
+ public InterLocItem(String h, Set<String> 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<HNode> lowerNodeSet;
}
return rtr;
}
+
}
projects / IRC.git / blobdiff