import java.util.Set;
import java.util.Stack;
-import Analysis.SSJava.FlowDownCheck.ComparisonResult;
-import Analysis.SSJava.FlowDownCheck.CompositeLattice;
import IR.ClassDescriptor;
import IR.Descriptor;
import IR.FieldDescriptor;
import IR.SymbolTable;
import IR.TypeDescriptor;
import IR.VarDescriptor;
-import IR.Flat.FlatMethod;
import IR.Tree.ArrayAccessNode;
import IR.Tree.AssignmentNode;
import IR.Tree.BlockExpressionNode;
import IR.Tree.SubBlockNode;
import IR.Tree.SwitchStatementNode;
import IR.Tree.TertiaryNode;
+import IR.Tree.TreeNode;
public class LocationInference {
// map a method descriptor to a method lattice
private Map<MethodDescriptor, SSJavaLattice<String>> md2lattice;
- // map a method descriptor to a lattice mapping
- private Map<MethodDescriptor, Map<VarDescriptor, String>> md2LatticeMapping;
-
- // map a method descriptor to a lattice mapping
- private Map<MethodDescriptor, Map<FieldDescriptor, String>> cd2LatticeMapping;
-
- // map a method descriptor to the set of hierarchy relations that are
- // contributed from the callee
- private Map<MethodDescriptor, Set<ParamIndexRelation>> mapMethodDescriptorToCalleeParamRelationSet;
-
// map a method descriptor to the set of method invocation nodes which are
// invoked by the method descriptor
private Map<MethodDescriptor, Set<MethodInvokeNode>> mapMethodDescriptorToMethodInvokeNodeSet;
private Map<MethodInvokeNode, Map<Integer, NTuple<Descriptor>>> mapMethodInvokeNodeToArgIdxMap;
+ private Map<MethodDescriptor, MethodLocationInfo> mapMethodDescToMethodLocationInfo;
+
+ private Map<ClassDescriptor, LocationInfo> mapClassToLocationInfo;
+
+ private Map<MethodDescriptor, Set<MethodDescriptor>> mapMethodDescToPossibleMethodDescSet;
+
+ public static final String GLOBALLOC = "GLOBALLOC";
+
+ public static final String TOPLOC = "TOPLOC";
+
+ public static final Descriptor GLOBALDESC = new NameDescriptor(GLOBALLOC);
+
+ public static final Descriptor TOPDESC = new NameDescriptor(TOPLOC);
+
boolean debug = true;
public LocationInference(SSJavaAnalysis ssjava, State state) {
this.cd2lattice = new HashMap<ClassDescriptor, SSJavaLattice<String>>();
this.md2lattice = new HashMap<MethodDescriptor, SSJavaLattice<String>>();
this.methodDescriptorsToVisitStack = new Stack<MethodDescriptor>();
- this.md2LatticeMapping = new HashMap<MethodDescriptor, Map<VarDescriptor, String>>();
- this.cd2LatticeMapping = new HashMap<MethodDescriptor, Map<FieldDescriptor, String>>();
- this.mapMethodDescriptorToCalleeParamRelationSet =
- new HashMap<MethodDescriptor, Set<ParamIndexRelation>>();
this.mapMethodDescriptorToMethodInvokeNodeSet =
new HashMap<MethodDescriptor, Set<MethodInvokeNode>>();
this.mapMethodInvokeNodeToArgIdxMap =
new HashMap<MethodInvokeNode, Map<Integer, NTuple<Descriptor>>>();
-
+ this.mapMethodDescToMethodLocationInfo = new HashMap<MethodDescriptor, MethodLocationInfo>();
+ this.mapMethodDescToPossibleMethodDescSet =
+ new HashMap<MethodDescriptor, Set<MethodDescriptor>>();
+ this.mapClassToLocationInfo = new HashMap<ClassDescriptor, LocationInfo>();
}
public void setupToAnalyze() {
// 2) construct lattices
inferLattices();
+ simplifyLattices();
+
debug_writeLatticeDotFile();
+ // 3) check properties
+ checkLattices();
+
+ }
+
+ private void simplifyLattices() {
+
+ // generate lattice dot file
+ setupToAnalyze();
+
+ while (!toAnalyzeIsEmpty()) {
+ ClassDescriptor cd = toAnalyzeNext();
+
+ setupToAnalazeMethod(cd);
+
+ SSJavaLattice<String> classLattice = cd2lattice.get(cd);
+ if (classLattice != null) {
+ classLattice.removeRedundantEdges();
+ }
+
+ while (!toAnalyzeMethodIsEmpty()) {
+ MethodDescriptor md = toAnalyzeMethodNext();
+ if (ssjava.needTobeAnnotated(md)) {
+ SSJavaLattice<String> methodLattice = md2lattice.get(md);
+ if (methodLattice != null) {
+ methodLattice.removeRedundantEdges();
+ }
+ }
+ }
+ }
+
+ }
+
+ private void checkLattices() {
+
+ LinkedList<MethodDescriptor> descriptorListToAnalyze = ssjava.getSortedDescriptors();
+
+ // current descriptors to visit in fixed-point interprocedural analysis,
+ // prioritized by
+ // dependency in the call graph
+ methodDescriptorsToVisitStack.clear();
+
+ descriptorListToAnalyze.removeFirst();
+
+ Set<MethodDescriptor> methodDescriptorToVistSet = new HashSet<MethodDescriptor>();
+ methodDescriptorToVistSet.addAll(descriptorListToAnalyze);
+
+ while (!descriptorListToAnalyze.isEmpty()) {
+ MethodDescriptor md = descriptorListToAnalyze.removeFirst();
+ checkLatticesOfVirtualMethods(md);
+ }
+
}
private void debug_writeLatticeDotFile() {
SSJavaLattice<String> classLattice = cd2lattice.get(cd);
if (classLattice != null) {
ssjava.writeLatticeDotFile(cd, null, classLattice);
+ debug_printDescriptorToLocNameMapping(cd);
}
while (!toAnalyzeMethodIsEmpty()) {
SSJavaLattice<String> methodLattice = md2lattice.get(md);
if (methodLattice != null) {
ssjava.writeLatticeDotFile(cd, md, methodLattice);
+ debug_printDescriptorToLocNameMapping(md);
}
}
}
}
+ private void debug_printDescriptorToLocNameMapping(Descriptor desc) {
+
+ LocationInfo info = getLocationInfo(desc);
+ System.out.println("## " + desc + " ##");
+ System.out.println(info.getMapDescToInferLocation());
+ LocationInfo locInfo = getLocationInfo(desc);
+ System.out.println("mapping=" + locInfo.getMapLocSymbolToDescSet());
+ System.out.println("###################");
+
+ }
+
private void inferLattices() {
// do fixed-point analysis
- // perform method READ/OVERWRITE analysis
LinkedList<MethodDescriptor> descriptorListToAnalyze = ssjava.getSortedDescriptors();
// current descriptors to visit in fixed-point interprocedural analysis,
MethodDescriptor md = methodDescriptorsToVisitStack.pop();
SSJavaLattice<String> methodLattice =
- new SSJavaLattice<String>(SSJavaLattice.TOP, SSJavaLattice.BOTTOM);
+ new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
+
+ MethodLocationInfo methodInfo = new MethodLocationInfo(md);
System.out.println();
System.out.println("SSJAVA: Inferencing the lattice from " + md);
- analyzeMethodLattice(md, methodLattice);
+ analyzeMethodLattice(md, methodLattice, methodInfo);
SSJavaLattice<String> prevMethodLattice = getMethodLattice(md);
+ MethodLocationInfo prevMethodInfo = getMethodLocationInfo(md);
+
+ if ((!methodLattice.equals(prevMethodLattice)) || (!methodInfo.equals(prevMethodInfo))) {
- if (!methodLattice.equals(prevMethodLattice)) {
- md2lattice.put(md, methodLattice);
+ setMethodLattice(md, methodLattice);
+ setMethodLocInfo(md, methodInfo);
// results for callee changed, so enqueue dependents caller for
// further analysis
}
+ private void setMethodLocInfo(MethodDescriptor md, MethodLocationInfo methodInfo) {
+ mapMethodDescToMethodLocationInfo.put(md, methodInfo);
+ }
+
+ private void checkLatticesOfVirtualMethods(MethodDescriptor md) {
+
+ if (!md.isStatic()) {
+ Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
+ setPossibleCallees.addAll(ssjava.getCallGraph().getMethods(md));
+
+ for (Iterator iterator = setPossibleCallees.iterator(); iterator.hasNext();) {
+ MethodDescriptor mdCallee = (MethodDescriptor) iterator.next();
+ if (!md.equals(mdCallee)) {
+ checkConsistency(md, mdCallee);
+ }
+ }
+
+ }
+
+ }
+
+ private void checkConsistency(MethodDescriptor md1, MethodDescriptor md2) {
+
+ // check that two lattice have the same relations between parameters(+PC
+ // LOC, RETURN LOC)
+
+ MethodLocationInfo methodInfo1 = getMethodLocationInfo(md1);
+
+ SSJavaLattice<String> lattice1 = getMethodLattice(md1);
+ SSJavaLattice<String> lattice2 = getMethodLattice(md2);
+
+ Set<String> paramLocNameSet1 = methodInfo1.getParameterLocNameSet();
+
+ for (Iterator iterator = paramLocNameSet1.iterator(); iterator.hasNext();) {
+ String locName1 = (String) iterator.next();
+ for (Iterator iterator2 = paramLocNameSet1.iterator(); iterator2.hasNext();) {
+ String locName2 = (String) iterator2.next();
+
+ if (!locName1.equals(locName2)) {
+
+ boolean r1 = lattice1.isGreaterThan(locName1, locName2);
+ boolean r2 = lattice2.isGreaterThan(locName1, locName2);
+
+ if (r1 != r2) {
+ throw new Error("The method " + md1 + " is not consistent with the method " + md2
+ + ".:: They have a different ordering relation between parameters " + locName1
+ + " and " + locName2 + ".");
+ }
+ }
+
+ }
+ }
+
+ }
+
private String getSymbol(int idx, FlowNode node) {
Descriptor desc = node.getDescTuple().get(idx);
return desc.getSymbol();
}
- private void analyzeMethodLattice(MethodDescriptor md, SSJavaLattice<String> methodLattice) {
+ private Descriptor getDescriptor(int idx, FlowNode node) {
+ Descriptor desc = node.getDescTuple().get(idx);
+ return desc;
+ }
+
+ private void analyzeMethodLattice(MethodDescriptor md, SSJavaLattice<String> methodLattice,
+ MethodLocationInfo methodInfo) {
// first take a look at method invocation nodes to newly added relations
// from the callee
analyzeLatticeMethodInvocationNode(md);
- // visit each node of method flow graph
+ // set the this location
+ String thisLocSymbol = md.getThis().getSymbol();
+ methodInfo.setThisLocName(thisLocSymbol);
+
+ // set the global location
+ methodInfo.setGlobalLocName(LocationInference.GLOBALLOC);
+ // visit each node of method flow graph
FlowGraph fg = getFlowGraph(md);
Set<FlowNode> nodeSet = fg.getNodeSet();
for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
FlowNode srcNode = (FlowNode) iterator.next();
- // first, take a look at directly connected nodes
Set<FlowEdge> outEdgeSet = srcNode.getOutEdgeSet();
for (Iterator iterator2 = outEdgeSet.iterator(); iterator2.hasNext();) {
FlowEdge outEdge = (FlowEdge) iterator2.next();
FlowNode dstNode = outEdge.getDst();
- addRelationToLattice(md, methodLattice, srcNode, dstNode);
+ NTuple<Descriptor> srcNodeTuple = srcNode.getDescTuple();
+ NTuple<Descriptor> dstNodeTuple = dstNode.getDescTuple();
+
+ if (outEdge.getInitTuple().equals(srcNodeTuple)
+ && outEdge.getEndTuple().equals(dstNodeTuple)) {
+
+ if ((srcNodeTuple.size() > 1 && dstNodeTuple.size() > 1)
+ && srcNodeTuple.get(0).equals(dstNodeTuple.get(0))) {
+
+ // value flows between fields
+ VarDescriptor varDesc = (VarDescriptor) srcNodeTuple.get(0);
+ ClassDescriptor varClassDesc = varDesc.getType().getClassDesc();
+ extractRelationFromFieldFlows(varClassDesc, srcNode, dstNode, 1);
+
+ } else if (srcNodeTuple.size() == 1 || dstNodeTuple.size() == 1) {
+ // for the method lattice, we need to look at the first element of
+ // NTuple<Descriptor>
+ // in this case, take a look at connected nodes at the local level
+ addRelationToLattice(md, methodLattice, methodInfo, srcNode, dstNode);
+ } else {
+
+ if (!srcNode.getDescTuple().get(0).equals(dstNode.getDescTuple().get(0))) {
+ // in this case, take a look at connected nodes at the local level
+ addRelationToLattice(md, methodLattice, methodInfo, srcNode, dstNode);
+ } else {
+ Descriptor srcDesc = srcNode.getDescTuple().get(0);
+ Descriptor dstDesc = dstNode.getDescTuple().get(0);
+ recursivelyAddCompositeRelation(md, fg, methodInfo, srcNode, dstNode, srcDesc,
+ dstDesc);
+ // recursiveAddRelationToLattice(1, md, srcNode, dstNode);
+ }
+ }
+
+ }
+ }
+ }
+
+ // calculate a return location
+ if (!md.getReturnType().isVoid()) {
+ Set<FlowNode> returnNodeSet = fg.getReturnNodeSet();
+ Set<String> returnVarSymbolSet = new HashSet<String>();
+ for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
+ FlowNode rtrNode = (FlowNode) iterator.next();
+ String localSymbol =
+ methodInfo.getInferLocation(rtrNode.getDescTuple().get(0)).get(0).getLocIdentifier();
+ returnVarSymbolSet.add(localSymbol);
}
+ String returnGLB = methodLattice.getGLB(returnVarSymbolSet);
+ if (returnGLB.equals(SSJavaAnalysis.BOTTOM)) {
+ // need to insert a new location in-between the bottom and all locations
+ // that is directly connected to the bottom
+ String returnNewLocationSymbol = "Loc" + (SSJavaLattice.seed++);
+ methodLattice.insertNewLocationAtOneLevelHigher(returnGLB, returnNewLocationSymbol);
+ methodInfo.setReturnLocName(returnNewLocationSymbol);
+ } else {
+ methodInfo.setReturnLocName(returnGLB);
+ }
+ }
+
+ }
+
+ private void recursiveAddRelationToLattice(int idx, MethodDescriptor md,
+ CompositeLocation srcInferLoc, CompositeLocation dstInferLoc) {
+
+ String srcLocSymbol = srcInferLoc.get(idx).getLocIdentifier();
+ String dstLocSymbol = dstInferLoc.get(idx).getLocIdentifier();
+
+ if (srcLocSymbol.equals(dstLocSymbol)) {
+ recursiveAddRelationToLattice(idx + 1, md, srcInferLoc, dstInferLoc);
+ } else {
+
+ Descriptor parentDesc = srcInferLoc.get(idx).getDescriptor();
+ LocationInfo locInfo = getLocationInfo(parentDesc);
+
+ addRelationHigherToLower(getLattice(parentDesc), getLocationInfo(parentDesc), srcLocSymbol,
+ dstLocSymbol);
}
}
String paramSymbol1 = getSymbol(0, paramFlowNode1);
String paramSymbol2 = getSymbol(0, paramFlowNode2);
- // if two parameters have relation, we need to propagate this relation
+ // if two parameters have a relation, we need to propagate this relation
// to the caller
- if (calleeLattice.isComparable(paramSymbol1, paramSymbol2)) {
+ if (!(paramSymbol1.equals(paramSymbol2))
+ && calleeLattice.isComparable(paramSymbol1, paramSymbol2)) {
int higherLocIdxCallee;
int lowerLocIdxCallee;
if (calleeLattice.isGreaterThan(paramSymbol1, paramSymbol2)) {
}
- private void addRelationToLattice(MethodDescriptor md, SSJavaLattice<String> methodLattice,
- FlowNode srcNode, FlowNode dstNode) {
- if ((srcNode.getDescTuple().size() > 1 && dstNode.getDescTuple().size() > 1)
- && srcNode.getDescTuple().get(0).equals(dstNode.getDescTuple().get(0))) {
- // value flow between fields: we don't need to add a binary relation
- // for this case
+ private LocationInfo getLocationInfo(Descriptor d) {
+ if (d instanceof MethodDescriptor) {
+ return getMethodLocationInfo((MethodDescriptor) d);
+ } else {
+ return getFieldLocationInfo((ClassDescriptor) d);
+ }
+ }
+
+ private MethodLocationInfo getMethodLocationInfo(MethodDescriptor md) {
+
+ if (!mapMethodDescToMethodLocationInfo.containsKey(md)) {
+ mapMethodDescToMethodLocationInfo.put(md, new MethodLocationInfo(md));
+ }
+
+ return mapMethodDescToMethodLocationInfo.get(md);
- VarDescriptor varDesc = (VarDescriptor) srcNode.getDescTuple().get(0);
- ClassDescriptor varClassDesc = varDesc.getType().getClassDesc();
+ }
+
+ private LocationInfo getFieldLocationInfo(ClassDescriptor cd) {
- extractRelationFromFieldFlows(varClassDesc, srcNode, dstNode, 1);
- return;
+ if (!mapClassToLocationInfo.containsKey(cd)) {
+ mapClassToLocationInfo.put(cd, new LocationInfo(cd));
}
+ return mapClassToLocationInfo.get(cd);
+
+ }
+
+ private void addRelationToLattice(MethodDescriptor md, SSJavaLattice<String> methodLattice,
+ MethodLocationInfo methodInfo, FlowNode srcNode, FlowNode dstNode) {
+
+ System.out.println();
+ System.out.println("### addRelationToLattice src=" + srcNode + " dst=" + dstNode);
+
// add a new binary relation of dstNode < srcNode
+ FlowGraph flowGraph = getFlowGraph(md);
+ // MethodLocationInfo methodInfo = getMethodLocationInfo(md);
+
+ // String srcOriginSymbol = getSymbol(0, srcNode);
+ // String dstOriginSymbol = getSymbol(0, dstNode);
+
+ Descriptor srcDesc = getDescriptor(0, srcNode);
+ Descriptor dstDesc = getDescriptor(0, dstNode);
+
+ // consider a composite location case
+ boolean isSrcLocalVar = false;
+ boolean isDstLocalVar = false;
+ if (srcNode.getDescTuple().size() == 1) {
+ isSrcLocalVar = true;
+ }
+
+ if (dstNode.getDescTuple().size() == 1) {
+ isDstLocalVar = true;
+ }
- String srcSymbol = getSymbol(0, srcNode);
- String dstSymbol = getSymbol(0, dstNode);
+ boolean isAssignedCompositeLocation = false;
+ if (!methodInfo.getInferLocation(srcDesc).get(0).getLocIdentifier()
+ .equals(methodInfo.getThisLocName())) {
+ isAssignedCompositeLocation =
+ calculateCompositeLocation(flowGraph, methodLattice, methodInfo, srcNode);
+ }
- methodLattice.addRelationHigherToLower(srcSymbol, dstSymbol);
+ String srcSymbol = methodInfo.getInferLocation(srcDesc).get(0).getLocIdentifier();
+ String dstSymbol = methodInfo.getInferLocation(dstDesc).get(0).getLocIdentifier();
+
+ if (srcNode.isParameter()) {
+ int paramIdx = flowGraph.getParamIdx(srcNode.getDescTuple());
+ methodInfo.addParameter(srcSymbol, srcDesc, paramIdx);
+ } else {
+ // methodInfo.addMappingOfLocNameToDescriptor(srcSymbol, srcDesc);
+ }
+
+ if (dstNode.isParameter()) {
+ int paramIdx = flowGraph.getParamIdx(dstNode.getDescTuple());
+ methodInfo.addParameter(dstSymbol, dstDesc, paramIdx);
+ } else {
+ // methodInfo.addMappingOfLocNameToDescriptor(dstSymbol, dstDesc);
+ }
+
+ if (!isAssignedCompositeLocation) {
+ // source does not have a composite location
+ if (!srcSymbol.equals(dstSymbol)) {
+ // add a local relation
+ if (!methodLattice.isGreaterThan(srcSymbol, dstSymbol)) {
+ // if the lattice does not have this relation, add it
+ addRelationHigherToLower(methodLattice, methodInfo, srcSymbol, dstSymbol);
+ // methodLattice.addRelationHigherToLower(srcSymbol, dstSymbol);
+ }
+ } else {
+ // if src and dst have the same local location...
+
+ recursivelyAddCompositeRelation(md, flowGraph, methodInfo, srcNode, dstNode, srcDesc,
+ dstDesc);
+
+ }
+
+ } else {
+ // source variable has a composite location
+ if (methodInfo.getInferLocation(dstDesc).getSize() == 1) {
+ if (!srcSymbol.equals(dstSymbol)) {
+ addRelationHigherToLower(methodLattice, methodInfo, srcSymbol, dstSymbol);
+ }
+ }
+
+ }
}
- private SSJavaLattice<String> getMethodLattice(MethodDescriptor md) {
+ private void recursivelyAddCompositeRelation(MethodDescriptor md, FlowGraph flowGraph,
+ MethodLocationInfo methodInfo, FlowNode srcNode, FlowNode dstNode, Descriptor srcDesc,
+ Descriptor dstDesc) {
+
+ CompositeLocation inferSrcLoc;
+ CompositeLocation inferDstLoc = methodInfo.getInferLocation(dstDesc);
+
+ if (srcNode.getDescTuple().size() > 1) {
+ // field access
+ inferSrcLoc = new CompositeLocation();
+
+ NTuple<Location> locTuple = flowGraph.getLocationTuple(srcNode);
+ for (int i = 0; i < locTuple.size(); i++) {
+ inferSrcLoc.addLocation(locTuple.get(i));
+ }
+
+ } else {
+ inferSrcLoc = methodInfo.getInferLocation(srcDesc);
+ }
+
+ if (dstNode.getDescTuple().size() > 1) {
+ // field access
+ inferDstLoc = new CompositeLocation();
+
+ NTuple<Location> locTuple = flowGraph.getLocationTuple(dstNode);
+ for (int i = 0; i < locTuple.size(); i++) {
+ inferDstLoc.addLocation(locTuple.get(i));
+ }
+
+ } else {
+ inferDstLoc = methodInfo.getInferLocation(dstDesc);
+ }
+
+ recursiveAddRelationToLattice(1, md, inferSrcLoc, inferDstLoc);
+ }
+
+ private void addPrefixMapping(Map<NTuple<Location>, Set<NTuple<Location>>> map,
+ NTuple<Location> prefix, NTuple<Location> element) {
+
+ if (!map.containsKey(prefix)) {
+ map.put(prefix, new HashSet<NTuple<Location>>());
+ }
+ map.get(prefix).add(element);
+ }
+
+ private boolean calculateCompositeLocation(FlowGraph flowGraph,
+ SSJavaLattice<String> methodLattice, MethodLocationInfo methodInfo, FlowNode flowNode) {
+
+ Descriptor localVarDesc = flowNode.getDescTuple().get(0);
+
+ Set<FlowNode> inNodeSet = flowGraph.getIncomingFlowNodeSet(flowNode);
+ Set<FlowNode> reachableNodeSet = flowGraph.getReachableFlowNodeSet(flowNode);
+
+ Map<NTuple<Location>, Set<NTuple<Location>>> mapPrefixToIncomingLocTupleSet =
+ new HashMap<NTuple<Location>, Set<NTuple<Location>>>();
+
+ Set<FlowNode> localInNodeSet = new HashSet<FlowNode>();
+ Set<FlowNode> localOutNodeSet = new HashSet<FlowNode>();
+
+ List<NTuple<Location>> prefixList = new ArrayList<NTuple<Location>>();
+
+ for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
+ FlowNode inNode = (FlowNode) iterator.next();
+ NTuple<Location> inTuple = flowGraph.getLocationTuple(inNode);
+
+ if (inTuple.size() > 1) {
+ for (int i = 1; i < inTuple.size(); i++) {
+ NTuple<Location> prefix = inTuple.subList(0, i);
+ if (!prefixList.contains(prefix)) {
+ prefixList.add(prefix);
+ }
+ addPrefixMapping(mapPrefixToIncomingLocTupleSet, prefix, inTuple);
+ }
+ } else {
+ localInNodeSet.add(inNode);
+ }
+ }
+
+ Collections.sort(prefixList, new Comparator<NTuple<Location>>() {
+ public int compare(NTuple<Location> arg0, NTuple<Location> arg1) {
+ int s0 = arg0.size();
+ int s1 = arg1.size();
+ if (s0 > s1) {
+ return -1;
+ } else if (s0 == s1) {
+ return 0;
+ } else {
+ return 1;
+ }
+ }
+ });
+
+ for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
+ FlowNode reachableNode = (FlowNode) iterator2.next();
+ if (reachableNode.getDescTuple().size() == 1) {
+ localOutNodeSet.add(reachableNode);
+ }
+ }
+
+ // find out reachable nodes that have the longest common prefix
+ for (int i = 0; i < prefixList.size(); i++) {
+ NTuple<Location> curPrefix = prefixList.get(i);
+ Set<NTuple<Location>> reachableCommonPrefixSet = new HashSet<NTuple<Location>>();
+
+ for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
+ FlowNode reachableNode = (FlowNode) iterator2.next();
+ NTuple<Location> reachLocTuple = flowGraph.getLocationTuple(reachableNode);
+ if (reachLocTuple.startsWith(curPrefix)) {
+ reachableCommonPrefixSet.add(reachLocTuple);
+ }
+
+ }
+
+ if (!reachableCommonPrefixSet.isEmpty()) {
+ // found reachable nodes that start with the prefix curPrefix
+ // need to assign a composite location
+
+ // first, check if there are more than one the set of locations that has
+ // the same length of the longest reachable prefix, no way to assign
+ // a composite location to the input local var
+ prefixSanityCheck(prefixList, i, flowGraph, reachableNodeSet);
+
+ Set<NTuple<Location>> incomingCommonPrefixSet =
+ mapPrefixToIncomingLocTupleSet.get(curPrefix);
+
+ int idx = curPrefix.size();
+ NTuple<Location> element = incomingCommonPrefixSet.iterator().next();
+ Descriptor desc = element.get(idx).getDescriptor();
+
+ SSJavaLattice<String> lattice = getLattice(desc);
+ LocationInfo locInfo = getLocationInfo(desc);
+
+ // CompositeLocation inferLocation =
+ // methodInfo.getInferLocation(flowNode);
+ CompositeLocation inferLocation = methodInfo.getInferLocation(localVarDesc);
+
+ String newlyInsertedLocName;
+ if (inferLocation.getSize() == 1) {
+ // need to replace the old local location with a new composite
+ // location
+
+ String oldMethodLocationSymbol = inferLocation.get(0).getLocIdentifier();
+
+ String newLocSymbol = "Loc" + (SSJavaLattice.seed++);
+ inferLocation = new CompositeLocation();
+ for (int locIdx = 0; locIdx < curPrefix.size(); locIdx++) {
+ inferLocation.addLocation(curPrefix.get(locIdx));
+ }
+ Location fieldLoc = new Location(desc, newLocSymbol);
+ inferLocation.addLocation(fieldLoc);
+
+ methodInfo.mapDescriptorToLocation(localVarDesc, inferLocation);
+ methodInfo.removeMaplocalVarToLocSet(localVarDesc);
+
+ String newMethodLocationSymbol = curPrefix.get(0).getLocIdentifier();
+
+ replaceOldLocWithNewLoc(methodLattice, oldMethodLocationSymbol, newMethodLocationSymbol);
+
+ } else {
+
+ String localLocName = methodInfo.getInferLocation(localVarDesc).get(0).getLocIdentifier();
+ return true;
+
+ }
+
+ newlyInsertedLocName = inferLocation.get(inferLocation.getSize() - 1).getLocIdentifier();
+
+ for (Iterator iterator = incomingCommonPrefixSet.iterator(); iterator.hasNext();) {
+ NTuple<Location> tuple = (NTuple<Location>) iterator.next();
+
+ Location loc = tuple.get(idx);
+ String higher = locInfo.getFieldInferLocation(loc.getLocDescriptor()).getLocIdentifier();
+ System.out.println("--");
+ System.out.println("add in-flow relation:");
+ addRelationHigherToLower(lattice, locInfo, higher, newlyInsertedLocName);
+ }
+ System.out.println("end of add-inflow relation");
+
+ for (Iterator iterator = localInNodeSet.iterator(); iterator.hasNext();) {
+ FlowNode localNode = (FlowNode) iterator.next();
+ Descriptor localInVarDesc = localNode.getDescTuple().get(0);
+ CompositeLocation inNodeInferLoc = methodInfo.getInferLocation(localInVarDesc);
+
+ if (isCompositeLocation(inNodeInferLoc)) {
+ // need to make sure that newLocSymbol is lower than the infernode
+ // location in the field lattice
+
+ if (inNodeInferLoc.getTuple().startsWith(curPrefix)
+ && inNodeInferLoc.getSize() == (curPrefix.size() + 1)) {
+ String higher = inNodeInferLoc.get(inNodeInferLoc.getSize() - 1).getLocIdentifier();
+ if (!higher.equals(newlyInsertedLocName)) {
+ System.out.println("add localInNodeSet relation:");
+ addRelationHigherToLower(lattice, locInfo, higher, newlyInsertedLocName);
+ }
+ } else {
+ throw new Error("Failed to generate a composite location.");
+ }
+
+ }
+ }
+
+ for (Iterator iterator = reachableCommonPrefixSet.iterator(); iterator.hasNext();) {
+ NTuple<Location> tuple = (NTuple<Location>) iterator.next();
+ Location loc = tuple.get(idx);
+ String lower = locInfo.getFieldInferLocation(loc.getLocDescriptor()).getLocIdentifier();
+ // lattice.addRelationHigherToLower(newlyInsertedLocName, lower);
+ System.out.println("add out-flow relation:");
+ addRelationHigherToLower(lattice, locInfo, newlyInsertedLocName, lower);
+ }
+ System.out.println("end of add out-flow relation");
+
+ for (Iterator iterator = localOutNodeSet.iterator(); iterator.hasNext();) {
+ FlowNode localOutNode = (FlowNode) iterator.next();
+
+ Descriptor localOutDesc = localOutNode.getDescTuple().get(0);
+ // String localOutNodeSymbol =
+ // localOutNode.getDescTuple().get(0).getSymbol();
+ CompositeLocation outNodeInferLoc = methodInfo.getInferLocation(localOutDesc);
+
+ // System.out
+ // .println("localOutNode=" + localOutNode + " outNodeInferLoc=" +
+ // outNodeInferLoc);
+ if (isCompositeLocation(outNodeInferLoc)) {
+ // need to make sure that newLocSymbol is higher than the infernode
+ // location
+
+ if (outNodeInferLoc.getTuple().startsWith(curPrefix)
+ && outNodeInferLoc.getSize() == (curPrefix.size() + 1)) {
+
+ String lower = outNodeInferLoc.get(outNodeInferLoc.getSize() - 1).getLocIdentifier();
+ System.out.println("add outNodeInferLoc relation:");
+
+ addRelationHigherToLower(lattice, locInfo, newlyInsertedLocName, lower);
+
+ } else {
+ throw new Error("Failed to generate a composite location.");
+ }
+ }
+ }
+
+ return true;
+ }
+
+ }
+
+ return false;
+
+ }
+
+ private boolean isCompositeLocation(CompositeLocation cl) {
+ return cl.getSize() > 1;
+ }
+
+ private boolean containsNonPrimitiveElement(Set<Descriptor> descSet) {
+ for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
+ Descriptor desc = (Descriptor) iterator.next();
+
+ if (desc.equals(LocationInference.GLOBALDESC)) {
+ return true;
+ } else if (desc instanceof VarDescriptor) {
+ if (!((VarDescriptor) desc).getType().isPrimitive()) {
+ return true;
+ }
+ } else if (desc instanceof FieldDescriptor) {
+ if (!((FieldDescriptor) desc).getType().isPrimitive()) {
+ return true;
+ }
+ }
+
+ }
+ return false;
+ }
+
+ private void addRelationHigherToLower(SSJavaLattice<String> lattice, LocationInfo locInfo,
+ String higher, String lower) {
+
+ // if (higher.equals(lower) && lattice.isSharedLoc(higher)) {
+ // return;
+ // }
+
+ Set<String> cycleElementSet = lattice.getPossibleCycleElements(higher, lower);
+ System.out.println("#Check cycle=" + lower + " < " + higher);
+ System.out.println("#cycleElementSet=" + cycleElementSet);
+
+ boolean hasNonPrimitiveElement = false;
+ for (Iterator iterator = cycleElementSet.iterator(); iterator.hasNext();) {
+ String cycleElementLocSymbol = (String) iterator.next();
+
+ Set<Descriptor> descSet = locInfo.getDescSet(cycleElementLocSymbol);
+ if (containsNonPrimitiveElement(descSet)) {
+ hasNonPrimitiveElement = true;
+ break;
+ }
+ }
+
+ if (hasNonPrimitiveElement) {
+ // if there is non-primitive element in the cycle, no way to merge cyclic
+ // elements into the shared location
+ throw new Error("Failed to merge cyclic value flows into a shared location.");
+ }
+
+ if (cycleElementSet.size() > 0) {
+ String newSharedLoc = "SharedLoc" + (SSJavaLattice.seed++);
+
+ lattice.mergeIntoSharedLocation(cycleElementSet, newSharedLoc);
+
+ for (Iterator iterator = cycleElementSet.iterator(); iterator.hasNext();) {
+ String oldLocSymbol = (String) iterator.next();
+ locInfo.mergeMapping(oldLocSymbol, newSharedLoc);
+ }
+
+ lattice.addSharedLoc(newSharedLoc);
+
+ } else if (!lattice.isGreaterThan(higher, lower)) {
+ lattice.addRelationHigherToLower(higher, lower);
+ }
+ }
+
+ private void replaceOldLocWithNewLoc(SSJavaLattice<String> methodLattice, String oldLocSymbol,
+ String newLocSymbol) {
+
+ if (methodLattice.containsKey(oldLocSymbol)) {
+ methodLattice.substituteLocation(oldLocSymbol, newLocSymbol);
+ }
+
+ }
+
+ private void prefixSanityCheck(List<NTuple<Location>> prefixList, int curIdx,
+ FlowGraph flowGraph, Set<FlowNode> reachableNodeSet) {
+
+ NTuple<Location> curPrefix = prefixList.get(curIdx);
+
+ for (int i = curIdx + 1; i < prefixList.size(); i++) {
+ NTuple<Location> prefixTuple = prefixList.get(i);
+
+ if (curPrefix.startsWith(prefixTuple)) {
+ continue;
+ }
+
+ for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
+ FlowNode reachableNode = (FlowNode) iterator2.next();
+ NTuple<Location> reachLocTuple = flowGraph.getLocationTuple(reachableNode);
+ if (reachLocTuple.startsWith(prefixTuple)) {
+ // TODO
+ throw new Error("Failed to generate a composite location");
+ }
+ }
+ }
+ }
+
+ public boolean isPrimitiveLocalVariable(FlowNode node) {
+ VarDescriptor varDesc = (VarDescriptor) node.getDescTuple().get(0);
+ return varDesc.getType().isPrimitive();
+ }
+
+ private SSJavaLattice<String> getLattice(Descriptor d) {
+ if (d instanceof MethodDescriptor) {
+ return getMethodLattice((MethodDescriptor) d);
+ } else {
+ return getFieldLattice((ClassDescriptor) d);
+ }
+ }
+ private SSJavaLattice<String> getMethodLattice(MethodDescriptor md) {
if (!md2lattice.containsKey(md)) {
- md2lattice.put(md, new SSJavaLattice<String>(SSJavaLattice.TOP, SSJavaLattice.BOTTOM));
+ md2lattice.put(md, new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM));
}
return md2lattice.get(md);
}
+ private void setMethodLattice(MethodDescriptor md, SSJavaLattice<String> lattice) {
+ md2lattice.put(md, lattice);
+ }
+
private void extractRelationFromFieldFlows(ClassDescriptor cd, FlowNode srcNode,
FlowNode dstNode, int idx) {
- if (srcNode.getDescTuple().get(idx).equals(dstNode.getDescTuple().get(idx))) {
+ if (srcNode.getDescTuple().get(idx).equals(dstNode.getDescTuple().get(idx))
+ && srcNode.getDescTuple().size() > (idx + 1) && dstNode.getDescTuple().size() > (idx + 1)) {
// value flow between fields: we don't need to add a binary relation
// for this case
- VarDescriptor varDesc = (VarDescriptor) srcNode.getDescTuple().get(idx);
- ClassDescriptor varClassDesc = varDesc.getType().getClassDesc();
- extractRelationFromFieldFlows(varClassDesc, srcNode, dstNode, idx + 1);
+
+ Descriptor desc = srcNode.getDescTuple().get(idx);
+ ClassDescriptor classDesc;
+
+ if (idx == 0) {
+ classDesc = ((VarDescriptor) desc).getType().getClassDesc();
+ } else {
+ classDesc = ((FieldDescriptor) desc).getType().getClassDesc();
+ }
+
+ extractRelationFromFieldFlows(classDesc, srcNode, dstNode, idx + 1);
+
} else {
Descriptor srcFieldDesc = srcNode.getDescTuple().get(idx);
Descriptor dstFieldDesc = dstNode.getDescTuple().get(idx);
// add a new binary relation of dstNode < srcNode
-
SSJavaLattice<String> fieldLattice = getFieldLattice(cd);
- fieldLattice.addRelationHigherToLower(srcFieldDesc.getSymbol(), dstFieldDesc.getSymbol());
+ LocationInfo fieldInfo = getFieldLocationInfo(cd);
+
+ String srcSymbol = fieldInfo.getFieldInferLocation(srcFieldDesc).getLocIdentifier();
+ String dstSymbol = fieldInfo.getFieldInferLocation(dstFieldDesc).getLocIdentifier();
+
+ addRelationHigherToLower(fieldLattice, fieldInfo, srcSymbol, dstSymbol);
}
public SSJavaLattice<String> getFieldLattice(ClassDescriptor cd) {
if (!cd2lattice.containsKey(cd)) {
- cd2lattice.put(cd, new SSJavaLattice<String>(SSJavaLattice.TOP, SSJavaLattice.BOTTOM));
+ cd2lattice.put(cd, new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM));
}
return cd2lattice.get(cd);
}
MethodDescriptor md = toAnalyzeMethodNext();
if (ssjava.needTobeAnnotated(md)) {
if (state.SSJAVADEBUG) {
+ System.out.println();
System.out.println("SSJAVA: Constructing a flow graph: " + md);
}
- // creates a mapping from a parameter descriptor to its index
+ // creates a mapping from a method descriptor to virtual methods
+ Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
+ if (md.isStatic()) {
+ setPossibleCallees.add(md);
+ } else {
+ setPossibleCallees.addAll(ssjava.getCallGraph().getMethods(md));
+ }
+ mapMethodDescToPossibleMethodDescSet.put(md, setPossibleCallees);
+ // creates a mapping from a parameter descriptor to its index
Map<Descriptor, Integer> mapParamDescToIdx = new HashMap<Descriptor, Integer>();
int offset = md.isStatic() ? 0 : 1;
for (int i = 0; i < md.numParameters(); i++) {
break;
case Kind.ReturnNode:
- analyzeReturnNode(md, nametable, (ReturnNode) bsn);
+ analyzeFlowReturnNode(md, nametable, (ReturnNode) bsn, implicitFlowTupleSet);
break;
case Kind.SubBlockNode:
analyzeFlowBlockNode(md, nametable, sbn.getBlockNode(), implicitFlowTupleSet);
}
- private void analyzeReturnNode(MethodDescriptor md, SymbolTable nametable, ReturnNode bsn) {
- // TODO Auto-generated method stub
+ private void analyzeFlowReturnNode(MethodDescriptor md, SymbolTable nametable, ReturnNode rn,
+ NodeTupleSet implicitFlowTupleSet) {
+
+ ExpressionNode returnExp = rn.getReturnExpression();
+
+ if (returnExp != null) {
+ NodeTupleSet nodeSet = new NodeTupleSet();
+ analyzeFlowExpressionNode(md, nametable, returnExp, nodeSet, false);
+
+ FlowGraph fg = getFlowGraph(md);
+
+ // annotate the elements of the node set as the return location
+ for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> returnDescTuple = (NTuple<Descriptor>) iterator.next();
+ fg.setReturnFlowNode(returnDescTuple);
+ for (Iterator iterator2 = implicitFlowTupleSet.iterator(); iterator2.hasNext();) {
+ NTuple<Descriptor> implicitFlowDescTuple = (NTuple<Descriptor>) iterator2.next();
+ fg.addValueFlowEdge(implicitFlowDescTuple, returnDescTuple);
+ }
+ }
+ }
}
} else {
// check 'for loop' case
BlockNode bn = ln.getInitializer();
- analyzeFlowBlockNode(md, bn.getVarTable(), bn, implicitFlowTupleSet);
bn.getVarTable().setParent(nametable);
+ for (int i = 0; i < bn.size(); i++) {
+ BlockStatementNode bsn = bn.get(i);
+ analyzeBlockStatementNode(md, bn.getVarTable(), bsn, implicitFlowTupleSet);
+ }
NodeTupleSet condTupleNode = new NodeTupleSet();
analyzeFlowExpressionNode(md, bn.getVarTable(), ln.getCondition(), condTupleNode, null,
// note that expression node can create more than one flow node
// nodeSet contains of flow nodes
- // base is always assigned to null except name node case!
+ // base is always assigned to null except the case of a name node!
NTuple<Descriptor> flowTuple;
private void analyzeFlowTertiaryNode(MethodDescriptor md, SymbolTable nametable, TertiaryNode tn,
NodeTupleSet nodeSet, NodeTupleSet implicitFlowTupleSet) {
- System.out.println("### analyzeFlowTertiaryNode=" + tn.printNode(0));
-
NodeTupleSet tertiaryTupleNode = new NodeTupleSet();
analyzeFlowExpressionNode(md, nametable, tn.getCond(), tertiaryTupleNode, null,
implicitFlowTupleSet, false);
// add edges from tertiaryTupleNode to all nodes of conditional nodes
tertiaryTupleNode.addTupleSet(implicitFlowTupleSet);
- System.out.println("### TertiarayNode's condition=" + tertiaryTupleNode);
analyzeFlowExpressionNode(md, nametable, tn.getTrueExpr(), tertiaryTupleNode, null,
implicitFlowTupleSet, false);
if (min.getExpression() != null) {
NodeTupleSet baseNodeSet = new NodeTupleSet();
- System.out.println("Analyzing base of method=" + min.getExpression());
- analyzeFlowExpressionNode(calleeMD, nametable, min.getExpression(), baseNodeSet, null,
+ analyzeFlowExpressionNode(md, nametable, min.getExpression(), baseNodeSet, null,
implicitFlowTupleSet, false);
} else {
NodeTupleSet rightOpSet = new NodeTupleSet();
// left operand
- System.out.println("Analyzing left op=" + on.getLeft().printNode(0) + "::"
- + on.getLeft().getClass());
analyzeFlowExpressionNode(md, nametable, on.getLeft(), leftOpSet, null, implicitFlowTupleSet,
false);
- System.out.println("leftOpSet=" + leftOpSet);
if (on.getRight() != null) {
// right operand
analyzeFlowExpressionNode(md, nametable, on.getRight(), rightOpSet, null,
implicitFlowTupleSet, false);
- System.out.println("rightOpSet=" + rightOpSet);
}
Operation op = on.getOp();
FieldDescriptor fd = (FieldDescriptor) d;
if (fd.isStatic()) {
if (fd.isFinal()) {
- // if it is 'static final', the location has TOP since no one can
- // change its value
- // loc.addLocation(Location.createTopLocation(md));
- // return loc;
+ // if it is 'static final', assign the default TOP LOCATION
+ // DESCRIPTOR
+ base.add(TOPDESC);
+ return base;
} else {
- // if 'static', the location has pre-assigned global loc
- // MethodLattice<String> localLattice = ssjava.getMethodLattice(md);
- // String globalLocId = localLattice.getGlobalLoc();
- // if (globalLocId == null) {
- // throw new
- // Error("Global location element is not defined in the method " +
- // md);
- // }
- // Location globalLoc = new Location(md, globalLocId);
- //
- // loc.addLocation(globalLoc);
+ // if 'static', assign the default GLOBAL LOCATION to the first
+ // element of the tuple
+ base.add(GLOBALDESC);
}
} else {
// the location of field access starts from this, followed by field
base.add(fd);
} else if (d == null) {
// access static field
+ base.add(GLOBALDESC);
+ // base.add(nn.getField());
+ return base;
+
// FieldDescriptor fd = nn.getField();addFlowGraphEdge
//
// MethodLattice<String> localLattice = ssjava.getMethodLattice(md);
}
}
- // if (left instanceof ArrayAccessNode) {
- // ArrayAccessNode aan = (ArrayAccessNode) left;
- // left = aan.getExpression();
- // }
+ if (left instanceof ArrayAccessNode) {
+ ArrayAccessNode aan = (ArrayAccessNode) left;
+ left = aan.getExpression();
+ }
// fanNodeSet
base =
analyzeFlowExpressionNode(md, nametable, left, nodeSet, base, implicitFlowTupleSet, false);
if (!left.getType().isPrimitive()) {
if (fd.getSymbol().equals("length")) {
- // TODO
- // array.length access, return the location of the array
- // return loc;
+ // array.length access, just have the location of the array
+ } else {
+ base.add(fd);
}
- base.add(fd);
}
+ getFlowGraph(md).createNewFlowNode(base);
return base;
}
+ private void debug_printTreeNode(TreeNode tn) {
+
+ System.out.println("DEBUG: " + tn.printNode(0) + " line#=" + tn.getNumLine());
+
+ }
+
private void analyzeFlowAssignmentNode(MethodDescriptor md, SymbolTable nametable,
AssignmentNode an, NTuple<Descriptor> base, NodeTupleSet implicitFlowTupleSet) {
- System.out.println("analyzeFlowAssignmentNode=" + an);
-
NodeTupleSet nodeSetRHS = new NodeTupleSet();
NodeTupleSet nodeSetLHS = new NodeTupleSet();
.getBaseOp().getOp() != Operation.POSTDEC)) {
postinc = false;
}
-
// if LHS is array access node, need to capture value flows between an array
// and its index value
analyzeFlowExpressionNode(md, nametable, an.getDest(), nodeSetLHS, null, implicitFlowTupleSet,
true);
- System.out.println("ASSIGNMENT NODE nodeSetLHS=" + nodeSetLHS);
if (!postinc) {
// analyze value flows of rhs expression
analyzeFlowExpressionNode(md, nametable, an.getSrc(), nodeSetRHS, null, implicitFlowTupleSet,
false);
- System.out.println("ASSIGNMENT NODE nodeSetRHS=" + nodeSetRHS);
// creates edges from RHS to LHS
for (Iterator<NTuple<Descriptor>> iter = nodeSetRHS.iterator(); iter.hasNext();) {
return mapMethodDescriptorToFlowGraph.get(md);
}
- public boolean addFlowGraphEdge(MethodDescriptor md, NTuple<Descriptor> from,
+ private boolean addFlowGraphEdge(MethodDescriptor md, NTuple<Descriptor> from,
NTuple<Descriptor> to) {
// TODO
// return true if it adds a new edge
}
}
-
-class ParamIndexRelation {
- private Integer higherIdx;
- private Integer lowerIdx;
-}
projects / IRC.git / blobdiff