import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
+import java.util.LinkedList;
import java.util.List;
import java.util.Map;
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;
List<MethodDescriptor> toanalyzeMethodList;
Map<MethodDescriptor, FlowGraph> mapMethodDescriptorToFlowGraph;
+ // map a method descriptor to its set of parameter descriptors
+ Map<MethodDescriptor, Set<Descriptor>> mapMethodDescriptorToParamDescSet;
+
+ // keep current descriptors to visit in fixed-point interprocedural analysis,
+ private Stack<MethodDescriptor> methodDescriptorsToVisitStack;
+
+ // map a class descriptor to a field lattice
+ private Map<ClassDescriptor, SSJavaLattice<String>> cd2lattice;
+
+ // map a method descriptor to a method lattice
+ private Map<MethodDescriptor, SSJavaLattice<String>> md2lattice;
+
+ // 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> mapLatticeToMethodLocationInfo;
+
+ private Map<MethodDescriptor, Set<MethodDescriptor>> mapMethodDescToPossibleMethodDescSet;
+
boolean debug = true;
public LocationInference(SSJavaAnalysis ssjava, State state) {
this.toanalyzeList = new ArrayList<ClassDescriptor>();
this.toanalyzeMethodList = new ArrayList<MethodDescriptor>();
this.mapMethodDescriptorToFlowGraph = new HashMap<MethodDescriptor, FlowGraph>();
+ this.cd2lattice = new HashMap<ClassDescriptor, SSJavaLattice<String>>();
+ this.md2lattice = new HashMap<MethodDescriptor, SSJavaLattice<String>>();
+ this.methodDescriptorsToVisitStack = new Stack<MethodDescriptor>();
+ this.mapMethodDescriptorToMethodInvokeNodeSet =
+ new HashMap<MethodDescriptor, Set<MethodInvokeNode>>();
+ this.mapMethodInvokeNodeToArgIdxMap =
+ new HashMap<MethodInvokeNode, Map<Integer, NTuple<Descriptor>>>();
+ this.mapLatticeToMethodLocationInfo = new HashMap<MethodDescriptor, MethodLocationInfo>();
+ this.mapMethodDescToPossibleMethodDescSet =
+ new HashMap<MethodDescriptor, Set<MethodDescriptor>>();
}
public void setupToAnalyze() {
public void inference() {
- // 2) construct value flow graph
+ // 1) construct value flow graph
+ constructFlowGraph();
+
+ // 2) construct lattices
+ inferLattices();
+
+ debug_writeLatticeDotFile();
+
+ // 3) check properties
+ checkLattices();
+
+ }
+
+ 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() {
+ // generate lattice dot file
+
+ setupToAnalyze();
+
+ while (!toAnalyzeIsEmpty()) {
+ ClassDescriptor cd = toAnalyzeNext();
+
+ setupToAnalazeMethod(cd);
+
+ SSJavaLattice<String> classLattice = cd2lattice.get(cd);
+ if (classLattice != null) {
+ ssjava.writeLatticeDotFile(cd, null, classLattice);
+ }
+
+ while (!toAnalyzeMethodIsEmpty()) {
+ MethodDescriptor md = toAnalyzeMethodNext();
+ if (ssjava.needTobeAnnotated(md)) {
+ SSJavaLattice<String> methodLattice = md2lattice.get(md);
+ if (methodLattice != null) {
+ ssjava.writeLatticeDotFile(cd, md, methodLattice);
+ }
+ }
+ }
+ }
+
+ }
+
+ private void inferLattices() {
+
+ // do fixed-point analysis
+
+ 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();
+ methodDescriptorsToVisitStack.add(md);
+ }
+
+ // analyze scheduled methods until there are no more to visit
+ while (!methodDescriptorsToVisitStack.isEmpty()) {
+ // start to analyze leaf node
+ MethodDescriptor md = methodDescriptorsToVisitStack.pop();
+
+ SSJavaLattice<String> methodLattice =
+ new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
+
+ System.out.println();
+ System.out.println("SSJAVA: Inferencing the lattice from " + md);
+
+ analyzeMethodLattice(md, methodLattice);
+
+ SSJavaLattice<String> prevMethodLattice = getMethodLattice(md);
+
+ if (!methodLattice.equals(prevMethodLattice)) {
+
+ setMethodLattice(md, methodLattice);
+
+ // results for callee changed, so enqueue dependents caller for
+ // further analysis
+ Iterator<MethodDescriptor> depsItr = ssjava.getDependents(md).iterator();
+ while (depsItr.hasNext()) {
+ MethodDescriptor methodNext = depsItr.next();
+ if (!methodDescriptorsToVisitStack.contains(methodNext)
+ && methodDescriptorToVistSet.contains(methodNext)) {
+ methodDescriptorsToVisitStack.add(methodNext);
+ }
+ }
+
+ }
+
+ }
+
+ }
+
+ 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();
+
+ // System.out.println("COMPARE " + locName1 + " - " + locName2 + " "
+ // + lattice1.isGreaterThan(locName1, locName2) + "-"
+ // + lattice2.isGreaterThan(locName1, locName2));
+
+ 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) {
+
+ MethodLocationInfo methodInfo = getMethodLocationInfo(md);
+
+ // first take a look at method invocation nodes to newly added relations
+ // from the callee
+ analyzeLatticeMethodInvocationNode(md);
+
+ // visit each node of method flow graph
+ FlowGraph fg = getFlowGraph(md);
+ Set<FlowNode> nodeSet = fg.getNodeSet();
+
+ // for the method lattice, we need to look at the first element of
+ // NTuple<Descriptor>
+ for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
+ FlowNode srcNode = (FlowNode) iterator.next();
+
+ Set<FlowEdge> outEdgeSet = srcNode.getOutEdgeSet();
+ for (Iterator iterator2 = outEdgeSet.iterator(); iterator2.hasNext();) {
+ FlowEdge outEdge = (FlowEdge) iterator2.next();
+ FlowNode dstNode = outEdge.getDst();
+
+ 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 {
+ // in this case, take a look at connected nodes at the local level
+ addRelationToLattice(md, methodLattice, srcNode, dstNode);
+ }
+
+ }
+
+ }
+
+ }
+
+ // grab the this location if the method use the 'this' reference
+ String thisLocSymbol = md.getThis().getSymbol();
+ if (methodLattice.getKeySet().contains(thisLocSymbol)) {
+ methodInfo.setThisLocName(thisLocSymbol);
+ }
+
+ // 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 = rtrNode.getDescTuple().get(0).getSymbol();
+ 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 analyzeLatticeMethodInvocationNode(MethodDescriptor mdCaller) {
+
+ // the transformation for a call site propagates all relations between
+ // parameters from the callee
+ // if the method is virtual, it also grab all relations from any possible
+ // callees
+
+ Set<MethodInvokeNode> setMethodInvokeNode =
+ mapMethodDescriptorToMethodInvokeNodeSet.get(mdCaller);
+ if (setMethodInvokeNode != null) {
+
+ for (Iterator iterator = setMethodInvokeNode.iterator(); iterator.hasNext();) {
+ MethodInvokeNode min = (MethodInvokeNode) iterator.next();
+ MethodDescriptor mdCallee = min.getMethod();
+ Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
+ if (mdCallee.isStatic()) {
+ setPossibleCallees.add(mdCallee);
+ } else {
+ setPossibleCallees.addAll(ssjava.getCallGraph().getMethods(mdCallee));
+ }
+
+ for (Iterator iterator2 = setPossibleCallees.iterator(); iterator2.hasNext();) {
+ MethodDescriptor possibleMdCallee = (MethodDescriptor) iterator2.next();
+ propagateRelationToCaller(min, mdCaller, possibleMdCallee);
+ }
+
+ }
+ }
+
+ }
+
+ private void propagateRelationToCaller(MethodInvokeNode min, MethodDescriptor mdCaller,
+ MethodDescriptor possibleMdCallee) {
+
+ SSJavaLattice<String> calleeLattice = getMethodLattice(possibleMdCallee);
+
+ FlowGraph calleeFlowGraph = getFlowGraph(possibleMdCallee);
+
+ // find parameter node
+ Set<FlowNode> paramNodeSet = calleeFlowGraph.getParameterNodeSet();
+
+ for (Iterator iterator = paramNodeSet.iterator(); iterator.hasNext();) {
+ FlowNode paramFlowNode1 = (FlowNode) iterator.next();
+
+ for (Iterator iterator2 = paramNodeSet.iterator(); iterator2.hasNext();) {
+ FlowNode paramFlowNode2 = (FlowNode) iterator2.next();
+
+ String paramSymbol1 = getSymbol(0, paramFlowNode1);
+ String paramSymbol2 = getSymbol(0, paramFlowNode2);
+ // if two parameters have a relation, we need to propagate this relation
+ // to the caller
+ if (!(paramSymbol1.equals(paramSymbol2))
+ && calleeLattice.isComparable(paramSymbol1, paramSymbol2)) {
+ int higherLocIdxCallee;
+ int lowerLocIdxCallee;
+ if (calleeLattice.isGreaterThan(paramSymbol1, paramSymbol2)) {
+ higherLocIdxCallee = calleeFlowGraph.getParamIdx(paramFlowNode1.getDescTuple());
+ lowerLocIdxCallee = calleeFlowGraph.getParamIdx(paramFlowNode2.getDescTuple());
+ } else {
+ higherLocIdxCallee = calleeFlowGraph.getParamIdx(paramFlowNode2.getDescTuple());
+ lowerLocIdxCallee = calleeFlowGraph.getParamIdx(paramFlowNode1.getDescTuple());
+ }
+
+ NTuple<Descriptor> higherArg = getArgTupleByArgIdx(min, higherLocIdxCallee);
+ NTuple<Descriptor> lowerArg = getArgTupleByArgIdx(min, lowerLocIdxCallee);
+
+ addFlowGraphEdge(mdCaller, higherArg, lowerArg);
+
+ }
+
+ }
+
+ }
+
+ }
+
+ private MethodLocationInfo getMethodLocationInfo(MethodDescriptor md) {
+
+ if (!mapLatticeToMethodLocationInfo.containsKey(md)) {
+ mapLatticeToMethodLocationInfo.put(md, new MethodLocationInfo(md));
+ }
+
+ return mapLatticeToMethodLocationInfo.get(md);
+
+ }
+
+ private void addRelationToLattice(MethodDescriptor md, SSJavaLattice<String> methodLattice,
+ FlowNode srcNode, FlowNode dstNode) {
+
+ // add a new binary relation of dstNode < srcNode
+ String srcSymbol = getSymbol(0, srcNode);
+ String dstSymbol = getSymbol(0, dstNode);
+
+ FlowGraph flowGraph = getFlowGraph(md);
+ MethodLocationInfo methodInfo = getMethodLocationInfo(md);
+
+ if (srcNode.isParameter()) {
+ int paramIdx = flowGraph.getParamIdx(srcNode.getDescTuple());
+ methodInfo.addParameter(srcSymbol, srcNode, paramIdx);
+ }
+ if (dstNode.isParameter()) {
+ int paramIdx = flowGraph.getParamIdx(dstNode.getDescTuple());
+ methodInfo.addParameter(dstSymbol, dstNode, paramIdx);
+ }
+
+ if (!methodLattice.isGreaterThan(srcSymbol, dstSymbol)) {
+ // if the lattice does not have this relation, add it
+ methodLattice.addRelationHigherToLower(srcSymbol, dstSymbol);
+ }
+
+ }
+
+ private SSJavaLattice<String> getMethodLattice(MethodDescriptor md) {
+ if (!md2lattice.containsKey(md)) {
+ 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))
+ && 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
+
+ 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);
+
+ String srcSymbol = srcFieldDesc.getSymbol();
+ String dstSymbol = dstFieldDesc.getSymbol();
+
+ if (!fieldLattice.isGreaterThan(srcSymbol, dstSymbol)) {
+ fieldLattice.addRelationHigherToLower(srcSymbol, dstSymbol);
+ }
+
+ }
+
+ }
+
+ public SSJavaLattice<String> getFieldLattice(ClassDescriptor cd) {
+ if (!cd2lattice.containsKey(cd)) {
+ cd2lattice.put(cd, new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM));
+ }
+ return cd2lattice.get(cd);
+ }
+
+ public void constructFlowGraph() {
setupToAnalyze();
MethodDescriptor md = toAnalyzeMethodNext();
if (ssjava.needTobeAnnotated(md)) {
if (state.SSJAVADEBUG) {
+ System.out.println();
System.out.println("SSJAVA: Constructing a flow graph: " + md);
}
- FlowGraph fg = new FlowGraph(md);
+
+ // 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++) {
+ Descriptor paramDesc = (Descriptor) md.getParameter(i);
+ mapParamDescToIdx.put(paramDesc, new Integer(i + offset));
+ }
+
+ FlowGraph fg = new FlowGraph(md, mapParamDescToIdx);
mapMethodDescriptorToFlowGraph.put(md, fg);
+
analyzeMethodBody(cd, md);
}
}
}
_debug_printGraph();
-
}
private void analyzeMethodBody(ClassDescriptor cd, MethodDescriptor md) {
BlockNode bn = state.getMethodBody(md);
- analyzeFlowBlockNode(md, md.getParameterTable(), bn, null);
+ NodeTupleSet implicitFlowTupleSet = new NodeTupleSet();
+ analyzeFlowBlockNode(md, md.getParameterTable(), bn, implicitFlowTupleSet);
}
private void analyzeFlowBlockNode(MethodDescriptor md, SymbolTable nametable, BlockNode bn,
break;
case Kind.ReturnNode:
- analyzeReturnNode(md, nametable, (ReturnNode) bsn);
+ analyzeFlowReturnNode(md, nametable, (ReturnNode) bsn, implicitFlowTupleSet);
break;
case Kind.SubBlockNode:
private void analyzeSwitchStatementNode(MethodDescriptor md, SymbolTable nametable,
SwitchStatementNode bsn) {
// TODO Auto-generated method stub
-
}
private void analyzeFlowSubBlockNode(MethodDescriptor md, SymbolTable nametable,
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();
+
+ 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);
+ }
+ }
}
NodeTupleSet condTupleNode = new NodeTupleSet();
analyzeFlowExpressionNode(md, nametable, ln.getCondition(), condTupleNode, null,
- implicitFlowTupleSet);
+ implicitFlowTupleSet, false);
condTupleNode.addTupleSet(implicitFlowTupleSet);
- System.out.println("condTupleNode=" + condTupleNode);
// add edges from condNodeTupleSet to all nodes of conditional nodes
analyzeFlowBlockNode(md, nametable, ln.getBody(), condTupleNode);
} else {
// check 'for loop' case
BlockNode bn = ln.getInitializer();
- analyzeFlowBlockNode(md, nametable, bn, implicitFlowTupleSet);
+ analyzeFlowBlockNode(md, bn.getVarTable(), bn, implicitFlowTupleSet);
bn.getVarTable().setParent(nametable);
NodeTupleSet condTupleNode = new NodeTupleSet();
- analyzeFlowExpressionNode(md, nametable, ln.getCondition(), condTupleNode, null,
- implicitFlowTupleSet);
+ analyzeFlowExpressionNode(md, bn.getVarTable(), ln.getCondition(), condTupleNode, null,
+ implicitFlowTupleSet, false);
condTupleNode.addTupleSet(implicitFlowTupleSet);
- System.out.println("condTupleNode=" + condTupleNode);
analyzeFlowBlockNode(md, bn.getVarTable(), ln.getUpdate(), condTupleNode);
analyzeFlowBlockNode(md, bn.getVarTable(), ln.getBody(), condTupleNode);
NodeTupleSet condTupleNode = new NodeTupleSet();
analyzeFlowExpressionNode(md, nametable, isn.getCondition(), condTupleNode, null,
- implicitFlowTupleSet);
+ implicitFlowTupleSet, false);
// add edges from condNodeTupleSet to all nodes of conditional nodes
condTupleNode.addTupleSet(implicitFlowTupleSet);
NodeTupleSet tupleSetRHS = new NodeTupleSet();
analyzeFlowExpressionNode(md, nametable, dn.getExpression(), tupleSetRHS, null,
- implicitFlowTupleSet);
+ implicitFlowTupleSet, false);
// add a new flow edge from rhs to lhs
for (Iterator<NTuple<Descriptor>> iter = tupleSetRHS.iterator(); iter.hasNext();) {
private void analyzeBlockExpressionNode(MethodDescriptor md, SymbolTable nametable,
BlockExpressionNode ben, NodeTupleSet implicitFlowTupleSet) {
- analyzeFlowExpressionNode(md, nametable, ben.getExpression(), null, null, implicitFlowTupleSet);
+ analyzeFlowExpressionNode(md, nametable, ben.getExpression(), null, null, implicitFlowTupleSet,
+ false);
+ }
+
+ private NTuple<Descriptor> analyzeFlowExpressionNode(MethodDescriptor md, SymbolTable nametable,
+ ExpressionNode en, NodeTupleSet nodeSet, boolean isLHS) {
+ return analyzeFlowExpressionNode(md, nametable, en, nodeSet, null, new NodeTupleSet(), isLHS);
}
private NTuple<Descriptor> analyzeFlowExpressionNode(MethodDescriptor md, SymbolTable nametable,
ExpressionNode en, NodeTupleSet nodeSet, NTuple<Descriptor> base,
- NodeTupleSet implicitFlowTupleSet) {
+ NodeTupleSet implicitFlowTupleSet, boolean isLHS) {
// 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;
break;
case Kind.ArrayAccessNode:
- analyzeArrayAccessNode(md, nametable, (ArrayAccessNode) en);
+ analyzeFlowArrayAccessNode(md, nametable, (ArrayAccessNode) en, nodeSet, isLHS);
break;
case Kind.LiteralNode:
break;
case Kind.MethodInvokeNode:
- analyzeMethodInvokeNode(md, nametable, (MethodInvokeNode) en);
+ analyzeFlowMethodInvokeNode(md, nametable, (MethodInvokeNode) en, implicitFlowTupleSet);
break;
case Kind.TertiaryNode:
- analyzeTertiaryNode(md, nametable, (TertiaryNode) en);
+ analyzeFlowTertiaryNode(md, nametable, (TertiaryNode) en, nodeSet, implicitFlowTupleSet);
break;
case Kind.CastNode:
- analyzeCastNode(md, nametable, (CastNode) en);
+ analyzeFlowCastNode(md, nametable, (CastNode) en, implicitFlowTupleSet);
break;
// case Kind.InstanceOfNode:
}
- private void analyzeCastNode(MethodDescriptor md, SymbolTable nametable, CastNode en) {
- // TODO Auto-generated method stub
+ private void analyzeFlowCastNode(MethodDescriptor md, SymbolTable nametable, CastNode cn,
+ NodeTupleSet implicitFlowTupleSet) {
+
+ NodeTupleSet nodeTupleSet = new NodeTupleSet();
+ analyzeFlowExpressionNode(md, nametable, cn.getExpression(), nodeTupleSet, false);
}
- private void analyzeTertiaryNode(MethodDescriptor md, SymbolTable nametable, TertiaryNode en) {
- // TODO Auto-generated method stub
+ private void analyzeFlowTertiaryNode(MethodDescriptor md, SymbolTable nametable, TertiaryNode tn,
+ NodeTupleSet nodeSet, NodeTupleSet implicitFlowTupleSet) {
+
+ 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);
+ analyzeFlowExpressionNode(md, nametable, tn.getTrueExpr(), tertiaryTupleNode, null,
+ implicitFlowTupleSet, false);
+
+ analyzeFlowExpressionNode(md, nametable, tn.getFalseExpr(), tertiaryTupleNode, null,
+ implicitFlowTupleSet, false);
+
+ nodeSet.addTupleSet(tertiaryTupleNode);
}
- private void analyzeMethodInvokeNode(MethodDescriptor md, SymbolTable nametable,
- MethodInvokeNode en) {
- // TODO Auto-generated method stub
+ private void addMapCallerMethodDescToMethodInvokeNodeSet(MethodDescriptor caller,
+ MethodInvokeNode min) {
+ Set<MethodInvokeNode> set = mapMethodDescriptorToMethodInvokeNodeSet.get(caller);
+ if (set == null) {
+ set = new HashSet<MethodInvokeNode>();
+ mapMethodDescriptorToMethodInvokeNodeSet.put(caller, set);
+ }
+ set.add(min);
+ }
+
+ private void analyzeFlowMethodInvokeNode(MethodDescriptor md, SymbolTable nametable,
+ MethodInvokeNode min, NodeTupleSet implicitFlowTupleSet) {
+
+ addMapCallerMethodDescToMethodInvokeNodeSet(md, min);
+
+ MethodDescriptor calleeMD = min.getMethod();
+
+ NameDescriptor baseName = min.getBaseName();
+ boolean isSystemout = false;
+ if (baseName != null) {
+ isSystemout = baseName.getSymbol().equals("System.out");
+ }
+
+ if (!ssjava.isSSJavaUtil(calleeMD.getClassDesc()) && !ssjava.isTrustMethod(calleeMD)
+ && !calleeMD.getModifiers().isNative() && !isSystemout) {
+
+ // CompositeLocation baseLocation = null;
+ if (min.getExpression() != null) {
+
+ NodeTupleSet baseNodeSet = new NodeTupleSet();
+ analyzeFlowExpressionNode(calleeMD, nametable, min.getExpression(), baseNodeSet, null,
+ implicitFlowTupleSet, false);
+
+ } else {
+ if (min.getMethod().isStatic()) {
+ // String globalLocId = ssjava.getMethodLattice(md).getGlobalLoc();
+ // if (globalLocId == null) {
+ // throw new
+ // Error("Method lattice does not define global variable location at "
+ // + generateErrorMessage(md.getClassDesc(), min));
+ // }
+ // baseLocation = new CompositeLocation(new Location(md,
+ // globalLocId));
+ } else {
+ // 'this' var case
+ // String thisLocId = ssjava.getMethodLattice(md).getThisLoc();
+ // baseLocation = new CompositeLocation(new Location(md, thisLocId));
+ }
+ }
+
+ // constraint case:
+ // if (constraint != null) {
+ // int compareResult =
+ // CompositeLattice.compare(constraint, baseLocation, true,
+ // generateErrorMessage(cd, min));
+ // if (compareResult != ComparisonResult.GREATER) {
+ // // if the current constraint is higher than method's THIS location
+ // // no need to check constraints!
+ // CompositeLocation calleeConstraint =
+ // translateCallerLocToCalleeLoc(calleeMD, baseLocation, constraint);
+ // // System.out.println("check method body for constraint:" + calleeMD +
+ // // " calleeConstraint="
+ // // + calleeConstraint);
+ // checkMethodBody(calleeMD.getClassDesc(), calleeMD, calleeConstraint);
+ // }
+ // }
+
+ analyzeFlowMethodParameters(md, nametable, min);
+
+ // checkCalleeConstraints(md, nametable, min, baseLocation, constraint);
+
+ // checkCallerArgumentLocationConstraints(md, nametable, min,
+ // baseLocation, constraint);
+
+ if (!min.getMethod().getReturnType().isVoid()) {
+ // If method has a return value, compute the highest possible return
+ // location in the caller's perspective
+ // CompositeLocation ceilingLoc =
+ // computeCeilingLocationForCaller(md, nametable, min, baseLocation,
+ // constraint);
+ // return ceilingLoc;
+ }
+ }
+
+ // return new CompositeLocation(Location.createTopLocation(md));
+
+ }
+
+ private NTuple<Descriptor> getArgTupleByArgIdx(MethodInvokeNode min, int idx) {
+ return mapMethodInvokeNodeToArgIdxMap.get(min).get(new Integer(idx));
+ }
+
+ private void addArgIdxMap(MethodInvokeNode min, int idx, NTuple<Descriptor> argTuple) {
+ Map<Integer, NTuple<Descriptor>> mapIdxToArgTuple = mapMethodInvokeNodeToArgIdxMap.get(min);
+ if (mapIdxToArgTuple == null) {
+ mapIdxToArgTuple = new HashMap<Integer, NTuple<Descriptor>>();
+ mapMethodInvokeNodeToArgIdxMap.put(min, mapIdxToArgTuple);
+ }
+ mapIdxToArgTuple.put(new Integer(idx), argTuple);
+ }
+
+ private void analyzeFlowMethodParameters(MethodDescriptor callermd, SymbolTable nametable,
+ MethodInvokeNode min) {
+
+ if (min.numArgs() > 0) {
+
+ int offset = min.getMethod().isStatic() ? 0 : 1;
+
+ for (int i = 0; i < min.numArgs(); i++) {
+ ExpressionNode en = min.getArg(i);
+ NTuple<Descriptor> argTuple =
+ analyzeFlowExpressionNode(callermd, nametable, en, new NodeTupleSet(), false);
+
+ addArgIdxMap(min, i + offset, argTuple);
+ }
+
+ }
}
}
- private void analyzeArrayAccessNode(MethodDescriptor md, SymbolTable nametable, ArrayAccessNode en) {
- // TODO Auto-generated method stub
+ private void analyzeFlowArrayAccessNode(MethodDescriptor md, SymbolTable nametable,
+ ArrayAccessNode aan, NodeTupleSet nodeSet, boolean isLHS) {
+
+ NodeTupleSet expNodeTupleSet = new NodeTupleSet();
+ analyzeFlowExpressionNode(md, nametable, aan.getExpression(), expNodeTupleSet, isLHS);
+
+ NodeTupleSet idxNodeTupleSet = new NodeTupleSet();
+ analyzeFlowExpressionNode(md, nametable, aan.getIndex(), idxNodeTupleSet, isLHS);
+
+ if (isLHS) {
+ // need to create an edge from idx to array
+
+ for (Iterator<NTuple<Descriptor>> idxIter = idxNodeTupleSet.iterator(); idxIter.hasNext();) {
+ NTuple<Descriptor> idxTuple = idxIter.next();
+ for (Iterator<NTuple<Descriptor>> arrIter = expNodeTupleSet.iterator(); arrIter.hasNext();) {
+ NTuple<Descriptor> arrTuple = arrIter.next();
+ getFlowGraph(md).addValueFlowEdge(idxTuple, arrTuple);
+ }
+ }
+
+ nodeSet.addTupleSet(expNodeTupleSet);
+ } else {
+ nodeSet.addTupleSet(expNodeTupleSet);
+ nodeSet.addTupleSet(idxNodeTupleSet);
+ }
}
NodeTupleSet rightOpSet = new NodeTupleSet();
// left operand
- analyzeFlowExpressionNode(md, nametable, on.getLeft(), leftOpSet, null, implicitFlowTupleSet);
- System.out.println("leftOpSet=" + leftOpSet);
+ analyzeFlowExpressionNode(md, nametable, on.getLeft(), leftOpSet, null, implicitFlowTupleSet,
+ false);
if (on.getRight() != null) {
// right operand
analyzeFlowExpressionNode(md, nametable, on.getRight(), rightOpSet, null,
- implicitFlowTupleSet);
- System.out.println("rightOpSet=" + rightOpSet);
+ implicitFlowTupleSet, false);
}
Operation op = on.getOp();
}
NameDescriptor nd = nn.getName();
+
if (nd.getBase() != null) {
analyzeFlowExpressionNode(md, nametable, nn.getExpression(), nodeSet, base,
- implicitFlowTupleSet);
+ implicitFlowTupleSet, false);
} else {
String varname = nd.toString();
if (varname.equals("this")) {
Descriptor d = (Descriptor) nametable.get(varname);
- // CompositeLocation localLoc = null;
if (d instanceof VarDescriptor) {
VarDescriptor vd = (VarDescriptor) d;
- // localLoc = d2loc.get(vd);
- // the type of var descriptor has a composite location!
- // loc = ((SSJavaType)
- // vd.getType().getExtension()).getCompLoc().clone();
base.add(vd);
} else if (d instanceof FieldDescriptor) {
// the type of field descriptor has a location!
// left = aan.getExpression();
// }
// fanNodeSet
- base = analyzeFlowExpressionNode(md, nametable, left, nodeSet, base, implicitFlowTupleSet);
+ base =
+ analyzeFlowExpressionNode(md, nametable, left, nodeSet, base, implicitFlowTupleSet, false);
if (!left.getType().isPrimitive()) {
base.add(fd);
}
+ getFlowGraph(md).createNewFlowNode(base);
return base;
}
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();
// 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);
- System.out.println("ASSIGNMENT NODE nodeSetLHS=" + nodeSetLHS);
- // NTuple<Descriptor> lhsDescTuple = analyzeFlowExpressionNode(md,
- // nametable, an.getDest(), base);
+ analyzeFlowExpressionNode(md, nametable, an.getDest(), nodeSetLHS, null, implicitFlowTupleSet,
+ true);
if (!postinc) {
// analyze value flows of rhs expression
- analyzeFlowExpressionNode(md, nametable, an.getSrc(), nodeSetRHS, null, implicitFlowTupleSet);
- System.out.println("ASSIGNMENT NODE nodeSetRHS=" + nodeSetRHS);
+ analyzeFlowExpressionNode(md, nametable, an.getSrc(), nodeSetRHS, null, implicitFlowTupleSet,
+ false);
// creates edges from RHS to LHS
for (Iterator<NTuple<Descriptor>> iter = nodeSetRHS.iterator(); iter.hasNext();) {
return mapMethodDescriptorToFlowGraph.get(md);
}
- public void addFlowGraphEdge(MethodDescriptor md, NTuple<Descriptor> from, NTuple<Descriptor> to) {
+ private boolean addFlowGraphEdge(MethodDescriptor md, NTuple<Descriptor> from,
+ NTuple<Descriptor> to) {
+ // TODO
+ // return true if it adds a new edge
FlowGraph graph = getFlowGraph(md);
graph.addValueFlowEdge(from, to);
+ return true;
}
public void _debug_printGraph() {
projects / IRC.git / blobdiff