private Map<MethodInvokeNode, NTuple<Descriptor>> mapMethodInvokeNodeToBaseTuple;
+ private Map<MethodInvokeNode, Set<NTuple<Location>>> mapMethodInvokeNodeToPCLocTupleSet;
+
private Map<MethodDescriptor, MethodLocationInfo> mapMethodDescToMethodLocationInfo;
private Map<ClassDescriptor, LocationInfo> mapClassToLocationInfo;
private Map<Descriptor, LocationSummary> mapDescToLocationSummary;
+ private Map<MethodDescriptor, Set<MethodInvokeNode>> mapMethodDescToMethodInvokeNodeSet;
+
// maps a method descriptor to a sub global flow graph that captures all value flows caused by the
// set of callees reachable from the method
private Map<MethodDescriptor, GlobalFlowGraph> mapMethodDescriptorToSubGlobalFlowGraph;
private Map<MethodInvokeNode, Map<NTuple<Descriptor>, NTuple<Descriptor>>> mapMethodInvokeNodeToMapCallerArgToCalleeArg;
- public static final String GLOBALLOC = "GLOBALLOC";
+ private Map<MethodDescriptor, Boolean> mapMethodDescriptorToCompositeReturnCase;
- public static final String TOPLOC = "TOPLOC";
+ public static final String GLOBALLOC = "GLOBALLOC";
public static final String INTERLOC = "INTERLOC";
- public static final String PCLOC = "PCLOC";
+ public static final String PCLOC = "_PCLOC_";
- public static final String RLOC = "RLOC";
+ public static final String RLOC = "_RLOC_";
public static final Descriptor GLOBALDESC = new NameDescriptor(GLOBALLOC);
- public static final Descriptor TOPDESC = new NameDescriptor(TOPLOC);
+ public static final Descriptor TOPDESC = new NameDescriptor(SSJavaAnalysis.TOP);
+
+ public static final Descriptor BOTTOMDESC = new NameDescriptor(SSJavaAnalysis.BOTTOM);
public static final Descriptor RETURNLOC = new NameDescriptor(RLOC);
+ public static final Descriptor LITERALDESC = new NameDescriptor("LITERAL");
+
+ public static final HNode TOPHNODE = new HNode(TOPDESC);
+
+ public static final HNode BOTTOMHNODE = new HNode(BOTTOMDESC);
+
public static String newline = System.getProperty("line.separator");
LocationInfo curMethodInfo;
+ private boolean hasChanges = false;
+
boolean debug = true;
- private static int locSeed = 0;
+ public static int locSeed = 0;
+
+ private Stack<String> arrayAccessNodeStack;
public LocationInference(SSJavaAnalysis ssjava, State state) {
this.ssjava = ssjava;
this.mapMethodInvokeNodeToMapCallerArgToCalleeArg =
new HashMap<MethodInvokeNode, Map<NTuple<Descriptor>, NTuple<Descriptor>>>();
+ this.mapMethodInvokeNodeToPCLocTupleSet =
+ new HashMap<MethodInvokeNode, Set<NTuple<Location>>>();
+
+ this.arrayAccessNodeStack = new Stack<String>();
+
+ this.mapMethodDescToMethodInvokeNodeSet =
+ new HashMap<MethodDescriptor, Set<MethodInvokeNode>>();
+
+ this.mapMethodDescriptorToCompositeReturnCase = new HashMap<MethodDescriptor, Boolean>();
+
}
public void setupToAnalyze() {
public void inference() {
+ ssjava.init();
+
// construct value flow graph
constructFlowGraph();
+ constructGlobalFlowGraph();
+
+ checkReturnNodes();
+
assignCompositeLocation();
+ updateFlowGraph();
+ calculateExtraLocations();
+ addAdditionalOrderingConstraints();
+
+ _debug_writeFlowGraph();
// System.exit(0);
debug_writeHierarchyDotFiles();
- // calculate RETURNLOC,PCLOC
- calculateExtraLocations();
+ // System.exit(0);
simplifyHierarchyGraph();
}
+ private void checkReturnNodes() {
+ LinkedList<MethodDescriptor> methodDescList =
+ (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
+
+ while (!methodDescList.isEmpty()) {
+ MethodDescriptor md = methodDescList.removeLast();
+
+ if (md.getReturnType() != null && !md.getReturnType().isVoid()) {
+ checkFlowNodeReturnThisField(md);
+ }
+ // // in this case, this method will return the composite location that starts with 'this'
+ // FlowGraph flowGraph = getFlowGraph(md);
+ // Set<FlowNode> returnNodeSet = flowGraph.getReturnNodeSet();
+ // }
+
+ }
+
+ }
+
+ private void updateFlowGraph() {
+
+ LinkedList<MethodDescriptor> methodDescList =
+ (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
+
+ while (!methodDescList.isEmpty()) {
+ MethodDescriptor md = methodDescList.removeLast();
+ if (state.SSJAVADEBUG) {
+ System.out.println();
+ System.out.println("SSJAVA: Updating a flow graph: " + md);
+ propagateFlowsFromCalleesWithNoCompositeLocation(md);
+ }
+ }
+ }
+
public Map<NTuple<Descriptor>, NTuple<Descriptor>> getMapCallerArgToCalleeParam(
MethodInvokeNode min) {
}
private void translateCompositeLocationAssignmentToFlowGraph() {
+ System.out.println("\nSSJAVA: Translate composite location assignments to flow graphs:");
+ MethodDescriptor methodEventLoopDesc = ssjava.getMethodContainingSSJavaLoop();
+ translateCompositeLocationAssignmentToFlowGraph(methodEventLoopDesc);
+ }
+
+ private void translateCompositeLocationAssignmentToFlowGraph2() {
+ System.out.println("\nSSJAVA: Translate composite location assignments to flow graphs:");
MethodDescriptor methodEventLoopDesc = ssjava.getMethodContainingSSJavaLoop();
translateCompositeLocationAssignmentToFlowGraph(methodEventLoopDesc);
- _debug_printGraph();
+ }
+
+ private void addAdditionalOrderingConstraints() {
+ System.out.println("\nSSJAVA: Add addtional ordering constriants:");
+ MethodDescriptor methodEventLoopDesc = ssjava.getMethodContainingSSJavaLoop();
+ addAddtionalOrderingConstraints(methodEventLoopDesc);
+ // calculateReturnHolderLocation();
+ }
+
+ private void calculateReturnHolderLocation() {
+ LinkedList<MethodDescriptor> methodDescList =
+ (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
+
+ while (!methodDescList.isEmpty()) {
+ MethodDescriptor md = methodDescList.removeLast();
+
+ FlowGraph fg = getFlowGraph(md);
+ Set<FlowNode> nodeSet = fg.getNodeSet();
+ for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
+ FlowNode flowNode = (FlowNode) iterator.next();
+ if (flowNode.isFromHolder()) {
+ calculateCompositeLocationFromFlowGraph(md, flowNode);
+ }
+ }
+
+ }
}
private void updateCompositeLocationAssignments() {
System.out.println("---updatedCompLoc1=" + updatedCompLoc);
} else {
NTuple<Descriptor> descTuple = node.getDescTuple();
+ System.out.println("update desc=" + descTuple);
CompositeLocation compLoc = convertToCompositeLocation(md, descTuple);
compLoc = updateCompositeLocation(compLoc);
node.setCompositeLocation(compLoc);
if (node.isDeclaratonNode()) {
Descriptor localVarDesc = node.getDescTuple().get(0);
- methodSummary.addMapVarNameToInferCompLoc(localVarDesc, node.getCompositeLocation());
+ CompositeLocation compLoc = updateCompositeLocation(node.getCompositeLocation());
+ methodSummary.addMapVarNameToInferCompLoc(localVarDesc, compLoc);
}
}
String locName;
if (!enclosingDesc.equals(GLOBALDESC)) {
LocationSummary locSummary = getLocationSummary(enclosingDesc);
+ HierarchyGraph scGraph = getSkeletonCombinationHierarchyGraph(enclosingDesc);
+ if (scGraph != null) {
+ HNode curNode = scGraph.getCurrentHNode(nodeIdentifier);
+ if (curNode != null) {
+ nodeIdentifier = curNode.getName();
+ }
+ }
locName = locSummary.getLocationName(nodeIdentifier);
} else {
locName = nodeIdentifier;
private void translateCompositeLocationAssignmentToFlowGraph(MethodDescriptor mdCaller) {
- System.out.println("\n#translateCompositeLocationAssignmentToFlowGraph=" + mdCaller);
+ System.out.println("\n\n###translateCompositeLocationAssignmentToFlowGraph mdCaller="
+ + mdCaller);
// First, assign a composite location to a node in the flow graph
GlobalFlowGraph callerGlobalFlowGraph = getSubGlobalFlowGraph(mdCaller);
FlowGraph callerFlowGraph = getFlowGraph(mdCaller);
Map<Location, CompositeLocation> callerMapLocToCompLoc =
callerGlobalFlowGraph.getMapLocationToInferCompositeLocation();
- System.out.println("---callerMapLocToCompLoc=" + callerMapLocToCompLoc);
+
Set<Location> methodLocSet = callerMapLocToCompLoc.keySet();
for (Iterator iterator = methodLocSet.iterator(); iterator.hasNext();) {
Location methodLoc = (Location) iterator.next();
// need to translate a composite location that is started with the base
// tuple of 'min'.
translateMapLocationToInferCompositeLocationToCalleeGraph(callerGlobalFlowGraph, min);
- calleeSet.add(min.getMethod());
+ MethodDescriptor mdCallee = min.getMethod();
+ calleeSet.add(mdCallee);
+
}
for (Iterator iterator = calleeSet.iterator(); iterator.hasNext();) {
}
+ private CompositeLocation translateArgCompLocToParamCompLoc(MethodInvokeNode min,
+ CompositeLocation argCompLoc) {
+
+ System.out.println("--------translateArgCompLocToParamCompLoc argCompLoc=" + argCompLoc);
+ MethodDescriptor mdCallee = min.getMethod();
+ FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
+
+ NTuple<Location> argLocTuple = argCompLoc.getTuple();
+ Location argLocalLoc = argLocTuple.get(0);
+
+ Map<Integer, NTuple<Descriptor>> mapIdxToArgTuple = mapMethodInvokeNodeToArgIdxMap.get(min);
+ Set<Integer> idxSet = mapIdxToArgTuple.keySet();
+ for (Iterator iterator2 = idxSet.iterator(); iterator2.hasNext();) {
+ Integer idx = (Integer) iterator2.next();
+
+ if (idx == 0 && !min.getMethod().isStatic()) {
+ continue;
+ }
+
+ NTuple<Descriptor> argTuple = mapIdxToArgTuple.get(idx);
+ if (argTuple.size() > 0 && argTuple.get(0).equals(argLocalLoc.getLocDescriptor())) {
+ // it matches with the current argument composite location
+ // so what is the corresponding parameter local descriptor?
+ FlowNode paramNode = calleeFlowGraph.getParamFlowNode(idx);
+ System.out.println("----------found paramNode=" + paramNode);
+ NTuple<Descriptor> paramDescTuple = paramNode.getCurrentDescTuple();
+
+ NTuple<Location> newParamTupleFromArgTuple = translateToLocTuple(mdCallee, paramDescTuple);
+ for (int i = 1; i < argLocTuple.size(); i++) {
+ newParamTupleFromArgTuple.add(argLocTuple.get(i));
+ }
+
+ System.out.println("-----------newParamTuple=" + newParamTupleFromArgTuple);
+ return new CompositeLocation(newParamTupleFromArgTuple);
+
+ }
+ }
+ return null;
+ }
+
+ private void addAddtionalOrderingConstraints(MethodDescriptor mdCaller) {
+
+ // First, assign a composite location to a node in the flow graph
+ GlobalFlowGraph callerGlobalFlowGraph = getSubGlobalFlowGraph(mdCaller);
+
+ FlowGraph callerFlowGraph = getFlowGraph(mdCaller);
+ Map<Location, CompositeLocation> callerMapLocToCompLoc =
+ callerGlobalFlowGraph.getMapLocationToInferCompositeLocation();
+ Set<Location> methodLocSet = callerMapLocToCompLoc.keySet();
+
+ Set<MethodInvokeNode> minSet = mapMethodDescriptorToMethodInvokeNodeSet.get(mdCaller);
+
+ Set<MethodDescriptor> calleeSet = new HashSet<MethodDescriptor>();
+ for (Iterator iterator = minSet.iterator(); iterator.hasNext();) {
+ MethodInvokeNode min = (MethodInvokeNode) iterator.next();
+ MethodDescriptor mdCallee = min.getMethod();
+ calleeSet.add(mdCallee);
+
+ //
+ // add an additional ordering constraint
+ // if the first element of a parameter composite location matches 'this' reference,
+ // the corresponding argument in the caller is required to be higher than the translated
+ // parameter location in the caller lattice
+ // TODO
+ // addOrderingConstraintFromCompLocParamToArg(mdCaller, min);
+
+ //
+ // update return flow nodes in the caller
+ CompositeLocation returnLoc = getMethodSummary(mdCallee).getRETURNLoc();
+ System.out.println("### min=" + min.printNode(0) + " returnLoc=" + returnLoc);
+ if (returnLoc != null && returnLoc.get(0).getLocDescriptor().equals(mdCallee.getThis())
+ && returnLoc.getSize() > 1) {
+ System.out.println("###RETURN COMP LOC=" + returnLoc);
+ NTuple<Location> returnLocTuple = returnLoc.getTuple();
+ NTuple<Descriptor> baseTuple = mapMethodInvokeNodeToBaseTuple.get(min);
+ NTuple<Descriptor> newReturnTuple = baseTuple.clone();
+ for (int i = 1; i < returnLocTuple.size(); i++) {
+ newReturnTuple.add(returnLocTuple.get(i).getLocDescriptor());
+ }
+ System.out.println("###NEW RETURN TUPLE FOR CALLER=" + newReturnTuple);
+ callerFlowGraph.getFlowReturnNode(min).setNewTuple(newReturnTuple);
+ } else {
+ // if the return loc set was empty and later pcloc was connected to the return loc
+ // need to make sure that return loc reflects to this changes.
+ FlowReturnNode flowReturnNode = callerFlowGraph.getFlowReturnNode(min);
+ if (flowReturnNode != null && flowReturnNode.getReturnTupleSet().isEmpty()) {
+
+ if (needToUpdateReturnLocHolder(min.getMethod(), flowReturnNode)) {
+ NTuple<Descriptor> baseTuple = mapMethodInvokeNodeToBaseTuple.get(min);
+ NTuple<Descriptor> newReturnTuple = baseTuple.clone();
+ flowReturnNode.addTuple(newReturnTuple);
+ }
+
+ }
+
+ }
+
+ }
+
+ for (Iterator iterator = calleeSet.iterator(); iterator.hasNext();) {
+ MethodDescriptor callee = (MethodDescriptor) iterator.next();
+ addAddtionalOrderingConstraints(callee);
+ }
+
+ }
+
+ private boolean needToUpdateReturnLocHolder(MethodDescriptor mdCallee,
+ FlowReturnNode flowReturnNode) {
+ FlowGraph fg = getFlowGraph(mdCallee);
+ MethodSummary summary = getMethodSummary(mdCallee);
+ CompositeLocation returnCompLoc = summary.getRETURNLoc();
+ NTuple<Descriptor> returnDescTuple = translateToDescTuple(returnCompLoc.getTuple());
+ Set<FlowNode> incomingNodeToReturnNode =
+ fg.getIncomingFlowNodeSet(fg.getFlowNode(returnDescTuple));
+ for (Iterator iterator = incomingNodeToReturnNode.iterator(); iterator.hasNext();) {
+ FlowNode inNode = (FlowNode) iterator.next();
+ if (inNode.getDescTuple().get(0).equals(mdCallee.getThis())) {
+ return true;
+ }
+ }
+ return false;
+ }
+
+ private void addMapMethodDescToMethodInvokeNodeSet(MethodInvokeNode min) {
+ MethodDescriptor md = min.getMethod();
+ if (!mapMethodDescToMethodInvokeNodeSet.containsKey(md)) {
+ mapMethodDescToMethodInvokeNodeSet.put(md, new HashSet<MethodInvokeNode>());
+ }
+ mapMethodDescToMethodInvokeNodeSet.get(md).add(min);
+ }
+
+ private Set<MethodInvokeNode> getMethodInvokeNodeSetByMethodDesc(MethodDescriptor md) {
+ if (!mapMethodDescToMethodInvokeNodeSet.containsKey(md)) {
+ mapMethodDescToMethodInvokeNodeSet.put(md, new HashSet<MethodInvokeNode>());
+ }
+ return mapMethodDescToMethodInvokeNodeSet.get(md);
+ }
+
+ private void addOrderingConstraintFromCompLocParamToArg(MethodDescriptor mdCaller,
+ MethodInvokeNode min) {
+ System.out.println("-addOrderingConstraintFromCompLocParamToArg=" + min.printNode(0));
+
+ GlobalFlowGraph globalGraph = getSubGlobalFlowGraph(ssjava.getMethodContainingSSJavaLoop());
+
+ Set<NTuple<Location>> pcLocTupleSet = getPCLocTupleSet(min);
+
+ MethodDescriptor mdCallee = min.getMethod();
+
+ FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
+ for (int idx = 0; idx < calleeFlowGraph.getNumParameters(); idx++) {
+ FlowNode paramNode = calleeFlowGraph.getParamFlowNode(idx);
+ NTuple<Location> globalParamLocTuple =
+ translateToLocTuple(mdCallee, paramNode.getDescTuple());
+ translateToLocTuple(mdCallee, paramNode.getDescTuple());
+ CompositeLocation compLoc = paramNode.getCompositeLocation();
+ System.out.println("---paramNode=" + paramNode + " compLoc=" + compLoc);
+ if (compLoc != null) {
+ NTuple<Descriptor> argTuple = getNodeTupleByArgIdx(min, idx);
+ NTuple<Location> globalArgLocTuple = translateToLocTuple(mdCaller, argTuple);
+
+ if (!isLiteralValueLocTuple(globalArgLocTuple)
+ && !isLiteralValueLocTuple(globalParamLocTuple)) {
+ if (!globalGraph.hasValueFlowEdge(globalArgLocTuple, globalParamLocTuple)) {
+ System.out.println("----- add global flow globalArgLocTuple=" + globalArgLocTuple
+ + "-> globalParamLocTuple=" + globalParamLocTuple);
+ hasChanges = true;
+ globalGraph.addValueFlowEdge(globalArgLocTuple, globalParamLocTuple);
+ }
+ }
+
+ for (Iterator iterator = pcLocTupleSet.iterator(); iterator.hasNext();) {
+ NTuple<Location> pcLocTuple = (NTuple<Location>) iterator.next();
+
+ if (!isLiteralValueLocTuple(pcLocTuple) && !isLiteralValueLocTuple(globalParamLocTuple)) {
+ if (!globalGraph.hasValueFlowEdge(pcLocTuple, globalParamLocTuple)) {
+ System.out
+ .println("----- add global flow PCLOC="
+ + pcLocTuple
+ + "-> globalParamLocTu!globalArgLocTuple.get(0).getLocDescriptor().equals(LITERALDESC)ple="
+ + globalParamLocTuple);
+ hasChanges = true;
+ globalGraph.addValueFlowEdge(pcLocTuple, globalParamLocTuple);
+ }
+ }
+
+ }
+ }
+ }
+ }
+
+ private boolean isLiteralValueLocTuple(NTuple<Location> locTuple) {
+ return locTuple.get(0).getLocDescriptor().equals(LITERALDESC);
+ }
+
public void assignCompositeLocationToFlowGraph(FlowGraph flowGraph, Location loc,
CompositeLocation inferCompLoc) {
Descriptor localDesc = loc.getLocDescriptor();
Set<FlowNode> nodeSet = flowGraph.getNodeSet();
for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
FlowNode node = (FlowNode) iterator.next();
- if (node.getDescTuple().startsWith(localDesc)) {
+ if (node.getDescTuple().startsWith(localDesc)
+ && !node.getDescTuple().get(0).equals(LITERALDESC)) {
// need to assign the inferred composite location to this node
CompositeLocation newCompLoc = generateCompositeLocation(node.getDescTuple(), inferCompLoc);
node.setCompositeLocation(newCompLoc);
System.out.println("generateCompositeLocation=" + nodeDescTuple + " with inferCompLoc="
+ inferCompLoc);
+ MethodDescriptor md = (MethodDescriptor) inferCompLoc.get(0).getDescriptor();
+
CompositeLocation newCompLoc = new CompositeLocation();
for (int i = 0; i < inferCompLoc.getSize(); i++) {
newCompLoc.addLocation(inferCompLoc.get(i));
Descriptor lastDescOfPrefix = nodeDescTuple.get(0);
Descriptor enclosingDescriptor;
if (lastDescOfPrefix instanceof InterDescriptor) {
- enclosingDescriptor = null;
+ enclosingDescriptor = getFlowGraph(md).getEnclosingDescriptor(lastDescOfPrefix);
} else {
enclosingDescriptor = ((VarDescriptor) lastDescOfPrefix).getType().getClassDesc();
}
Map<Location, CompositeLocation> callerMapLocToCompLoc =
callerGraph.getMapLocationToInferCompositeLocation();
+ Map<Integer, NTuple<Descriptor>> mapIdxToArgTuple = mapMethodInvokeNodeToArgIdxMap.get(min);
+
FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
GlobalFlowGraph calleeGlobalGraph = getSubGlobalFlowGraph(mdCallee);
baseLocTuple = translateToLocTuple(mdCaller, mapMethodInvokeNodeToBaseTuple.get(min));
}
- // System.out.println("\n-translate caller infer composite loc to callee=" + mdCallee
- // + " baseLocTuple=" + baseLocTuple);
+ System.out.println("\n-#translate caller=" + mdCaller + " infer composite loc to callee="
+ + mdCallee + " baseLocTuple=" + baseLocTuple);
+ // System.out.println("-mapIdxToArgTuple=" + mapIdxToArgTuple);
+ // System.out.println("-callerMapLocToCompLoc=" + callerMapLocToCompLoc);
+
Set<Location> keySet = callerMapLocToCompLoc.keySet();
for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
Location key = (Location) iterator.next();
CompositeLocation newCalleeCompLoc;
if (baseLocTuple != null && callerCompLoc.getTuple().startsWith(baseLocTuple)) {
- // System.out.println("---need to translate callerCompLoc=" + callerCompLoc
+ // System.out.println("-----need to translate callerCompLoc=" + callerCompLoc
// + " with baseTuple=" + baseLocTuple);
newCalleeCompLoc =
translateCompositeLocationToCallee(callerCompLoc, baseLocTuple, mdCallee);
calleeGlobalGraph.addMapLocationToInferCompositeLocation(key, newCalleeCompLoc);
- // System.out.println("---callee loc=" + key + " newCalleeCompLoc=" + newCalleeCompLoc);
+ System.out.println("1---key=" + key + " callerCompLoc=" + callerCompLoc
+ + " newCalleeCompLoc=" + newCalleeCompLoc);
+ System.out.println("-----caller=" + mdCaller + " callee=" + mdCallee);
+ if (!newCalleeCompLoc.get(0).getDescriptor().equals(mdCallee)) {
+ System.exit(0);
+ }
+
+ // System.out.println("-----baseLoctuple=" + baseLocTuple);
} else {
// check if it is the global access
Location compLocFirstElement = callerCompLoc.getTuple().get(0);
newCalleeCompLoc.addLocation(callerCompLoc.get(i));
}
calleeGlobalGraph.addMapLocationToInferCompositeLocation(key, newCalleeCompLoc);
+ System.out.println("2---key=" + key + " callerCompLoc=" + callerCompLoc
+ + " newCalleeCompLoc=" + newCalleeCompLoc);
+ System.out.println("-----caller=" + mdCaller + " callee=" + mdCallee);
+
+ } else {
+ int paramIdx = getParamIdx(callerCompLoc, mapIdxToArgTuple);
+ if (paramIdx == -1) {
+ // here, the first element of the current composite location comes from the current
+ // callee
+ // so transfer the same composite location to the callee
+ if (!calleeGlobalGraph.contrainsInferCompositeLocationMapKey(key)) {
+ if (callerCompLoc.get(0).getDescriptor().equals(mdCallee)) {
+ System.out.println("3---key=" + key + " callerCompLoc=" + callerCompLoc
+ + " newCalleeCompLoc=" + callerCompLoc);
+ System.out.println("-----caller=" + mdCaller + " callee=" + mdCallee);
+ calleeGlobalGraph.addMapLocationToInferCompositeLocation(key, callerCompLoc);
+ } else {
+ System.out.println("3---SKIP key=" + key + " callerCompLoc=" + callerCompLoc);
+ }
+ }
+ continue;
+ }
+
+ // It is the case where two parameters have relative orderings between them by having
+ // composite locations
+ // if we found the param idx, it means that the first part of the caller composite
+ // location corresponds to the one of arguments.
+ // for example, if the caller argument is <<caller.this>,<Decoder.br>>
+ // and the current caller composite location mapping
+ // <<caller.this>,<Decoder.br>,<Br.value>>
+ // and the parameter which matches with the caller argument is 'Br brParam'
+ // then, the translated callee composite location will be <<callee.brParam>,<Br.value>>
+ NTuple<Descriptor> argTuple = mapIdxToArgTuple.get(paramIdx);
+
+ FlowNode paramFlowNode = calleeFlowGraph.getParamFlowNode(paramIdx);
+ NTuple<Location> paramLocTuple =
+ translateToLocTuple(mdCallee, paramFlowNode.getDescTuple());
+ newCalleeCompLoc = new CompositeLocation();
+ for (int i = 0; i < paramLocTuple.size(); i++) {
+ newCalleeCompLoc.addLocation(paramLocTuple.get(i));
+ }
+ for (int i = argTuple.size(); i < callerCompLoc.getSize(); i++) {
+ newCalleeCompLoc.addLocation(callerCompLoc.get(i));
+ }
+ calleeGlobalGraph.addMapLocationToInferCompositeLocation(key, newCalleeCompLoc);
+ System.out.println("4---key=" + key + " callerCompLoc=" + callerCompLoc
+ + " newCalleeCompLoc=" + newCalleeCompLoc);
+ System.out.println("-----caller=" + mdCaller + " callee=" + mdCallee);
+
+ // System.out.println("-----argTuple=" + argTuple + " caller=" + mdCaller +
+ // " callee="
+ // + mdCallee);
+ // System.out.println("-----paramIdx=" + paramIdx + " paramFlowNode=" + paramFlowNode);
}
}
}
+ // System.out.println("-----*AFTER TRANSLATING COMP LOC MAPPING, CALLEE MAPPING="
+ // + calleeGlobalGraph.getMapLocationToInferCompositeLocation());
+
+ System.out.println("#ASSIGN COMP LOC TO CALLEE PARAMS: callee=" + mdCallee + " caller="
+ + mdCaller);
// If the location of an argument has a composite location
// need to assign a proper composite location to the corresponding callee parameter
- System.out.println("\n-translate arg composite location to callee param. min="
- + min.printNode(0));
- Map<Integer, NTuple<Descriptor>> mapIdxToArgTuple = mapMethodInvokeNodeToArgIdxMap.get(min);
Set<Integer> idxSet = mapIdxToArgTuple.keySet();
for (Iterator iterator = idxSet.iterator(); iterator.hasNext();) {
Integer idx = (Integer) iterator.next();
}
NTuple<Descriptor> argTuple = mapIdxToArgTuple.get(idx);
+ System.out.println("-argTuple=" + argTuple + " idx=" + idx);
if (argTuple.size() > 0) {
// check if an arg tuple has been already assigned to a composite location
NTuple<Location> argLocTuple = translateToLocTuple(mdCaller, argTuple);
callerCompLoc.addLocation(argLocTuple.get(i));
}
- if (baseLocTuple != null && callerCompLoc.getTuple().startsWith(baseLocTuple)) {
+ System.out.println("---callerCompLoc=" + callerCompLoc);
+
+ // if (baseLocTuple != null && callerCompLoc.getTuple().startsWith(baseLocTuple)) {
+
+ FlowNode calleeParamFlowNode = calleeFlowGraph.getParamFlowNode(idx);
+
+ NTuple<Descriptor> calleeParamDescTuple = calleeParamFlowNode.getDescTuple();
+ NTuple<Location> calleeParamLocTuple =
+ translateToLocTuple(mdCallee, calleeParamDescTuple);
- FlowNode calleeParamFlowNode = calleeFlowGraph.getParamFlowNode(idx);
- NTuple<Descriptor> calleeParamDescTuple = calleeParamFlowNode.getDescTuple();
- NTuple<Location> calleeParamLocTuple =
- translateToLocTuple(mdCallee, calleeParamDescTuple);
+ int refParamIdx = getParamIdx(callerCompLoc, mapIdxToArgTuple);
+ System.out.println("-----paramIdx=" + refParamIdx);
+ if (refParamIdx == 0 && !mdCallee.isStatic()) {
- System.out.println("---need to translate callerCompLoc=" + callerCompLoc
+ System.out.println("-------need to translate callerCompLoc=" + callerCompLoc
+ " with baseTuple=" + baseLocTuple + " calleeParamLocTuple="
+ calleeParamLocTuple);
calleeGlobalGraph.addMapLocationToInferCompositeLocation(calleeParamLocTuple.get(0),
newCalleeCompLoc);
- System.out.println("---callee loc=" + calleeParamLocTuple.get(0)
- + " newCalleeCompLoc=" + newCalleeCompLoc);
+ System.out.println("---------key=" + calleeParamLocTuple.get(0) + " callerCompLoc="
+ + callerCompLoc + " newCalleeCompLoc=" + newCalleeCompLoc);
+
+ } else if (refParamIdx != -1) {
+ // the first element of an argument composite location matches with one of paramtere
+ // composite locations
+
+ System.out.println("-------param match case=");
+
+ NTuple<Descriptor> argTupleRef = mapIdxToArgTuple.get(refParamIdx);
+ FlowNode refParamFlowNode = calleeFlowGraph.getParamFlowNode(refParamIdx);
+ NTuple<Location> refParamLocTuple =
+ translateToLocTuple(mdCallee, refParamFlowNode.getDescTuple());
+
+ System.out.println("---------refParamLocTuple=" + refParamLocTuple
+ + " from argTupleRef=" + argTupleRef);
+
+ CompositeLocation newCalleeCompLoc = new CompositeLocation();
+ for (int i = 0; i < refParamLocTuple.size(); i++) {
+ newCalleeCompLoc.addLocation(refParamLocTuple.get(i));
+ }
+ for (int i = argTupleRef.size(); i < callerCompLoc.getSize(); i++) {
+ newCalleeCompLoc.addLocation(callerCompLoc.get(i));
+ }
+
+ calleeGlobalGraph.addMapLocationToInferCompositeLocation(calleeParamLocTuple.get(0),
+ newCalleeCompLoc);
+
+ calleeParamFlowNode.setCompositeLocation(newCalleeCompLoc);
+ System.out.println("-----------key=" + calleeParamLocTuple.get(0) + " callerCompLoc="
+ + callerCompLoc + " newCalleeCompLoc=" + newCalleeCompLoc);
- // System.out.println("###need to assign composite location to=" + calleeParamDescTuple
- // + " with baseTuple=" + baseLocTuple);
+ } else {
+ CompositeLocation newCalleeCompLoc =
+ calculateCompositeLocationFromSubGlobalGraph(mdCallee, calleeParamFlowNode);
+ if (newCalleeCompLoc != null) {
+ calleeGlobalGraph.addMapLocationToInferCompositeLocation(calleeParamLocTuple.get(0),
+ newCalleeCompLoc);
+ calleeParamFlowNode.setCompositeLocation(newCalleeCompLoc);
+ }
}
+ System.out.println("-----------------calleeParamFlowNode="
+ + calleeParamFlowNode.getCompositeLocation());
+
+ // }
+
}
}
}
+ private CompositeLocation calculateCompositeLocationFromSubGlobalGraph(MethodDescriptor md,
+ FlowNode paramNode) {
+
+ System.out.println("#############################################################");
+ System.out.println("calculateCompositeLocationFromSubGlobalGraph=" + paramNode);
+
+ GlobalFlowGraph subGlobalFlowGraph = getSubGlobalFlowGraph(md);
+ NTuple<Location> paramLocTuple = translateToLocTuple(md, paramNode.getDescTuple());
+ GlobalFlowNode paramGlobalNode = subGlobalFlowGraph.getFlowNode(paramLocTuple);
+
+ List<NTuple<Location>> prefixList = calculatePrefixList(subGlobalFlowGraph, paramGlobalNode);
+
+ Location prefixLoc = paramLocTuple.get(0);
+
+ Set<GlobalFlowNode> reachableNodeSet =
+ subGlobalFlowGraph.getReachableNodeSetByPrefix(paramGlobalNode.getLocTuple().get(0));
+ // Set<GlobalFlowNode> reachNodeSet = globalFlowGraph.getReachableNodeSetFrom(node);
+
+ // System.out.println("node=" + node + " prefixList=" + prefixList);
+
+ 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();) {
+ GlobalFlowNode reachNode = (GlobalFlowNode) iterator2.next();
+ if (reachNode.getLocTuple().startsWith(curPrefix)) {
+ reachableCommonPrefixSet.add(reachNode.getLocTuple());
+ }
+ }
+ // System.out.println("reachableCommonPrefixSet=" + reachableCommonPrefixSet);
+
+ if (!reachableCommonPrefixSet.isEmpty()) {
+
+ MethodDescriptor curPrefixFirstElementMethodDesc =
+ (MethodDescriptor) curPrefix.get(0).getDescriptor();
+
+ MethodDescriptor nodePrefixLocFirstElementMethodDesc =
+ (MethodDescriptor) prefixLoc.getDescriptor();
+
+ // System.out.println("curPrefixFirstElementMethodDesc=" +
+ // curPrefixFirstElementMethodDesc);
+ // System.out.println("nodePrefixLocFirstElementMethodDesc="
+ // + nodePrefixLocFirstElementMethodDesc);
+
+ if (curPrefixFirstElementMethodDesc.equals(nodePrefixLocFirstElementMethodDesc)
+ || isTransitivelyCalledFrom(nodePrefixLocFirstElementMethodDesc,
+ curPrefixFirstElementMethodDesc)) {
+
+ // TODO
+ // if (!node.getLocTuple().startsWith(curPrefix.get(0))) {
+
+ Location curPrefixLocalLoc = curPrefix.get(0);
+ if (subGlobalFlowGraph.mapLocationToInferCompositeLocation.containsKey(curPrefixLocalLoc)) {
+ // in this case, the local variable of the current prefix has already got a composite
+ // location
+ // so we just ignore the current composite location.
+
+ // System.out.println("HERE WE DO NOT ASSIGN A COMPOSITE LOCATION TO =" + node
+ // + " DUE TO " + curPrefix);
+ return null;
+ }
+
+ if (!needToGenerateCompositeLocation(paramGlobalNode, curPrefix)) {
+ System.out.println("NO NEED TO GENERATE COMP LOC to " + paramGlobalNode
+ + " with prefix=" + curPrefix);
+ // System.out.println("prefixList=" + prefixList);
+ // System.out.println("reachableNodeSet=" + reachableNodeSet);
+ return null;
+ }
+
+ Location targetLocalLoc = paramGlobalNode.getLocTuple().get(0);
+ CompositeLocation newCompLoc = generateCompositeLocation(curPrefix);
+ System.out.println("NEED TO ASSIGN COMP LOC TO " + paramGlobalNode + " with prefix="
+ + curPrefix);
+ System.out.println("-targetLocalLoc=" + targetLocalLoc + " - newCompLoc=" + newCompLoc);
+
+ // makes sure that a newly generated location appears in the hierarchy graph
+ for (int compIdx = 0; compIdx < newCompLoc.getSize(); compIdx++) {
+ Location curLoc = newCompLoc.get(compIdx);
+ getHierarchyGraph(curLoc.getDescriptor()).getHNode(curLoc.getLocDescriptor());
+ }
+
+ subGlobalFlowGraph.addMapLocationToInferCompositeLocation(targetLocalLoc, newCompLoc);
+
+ return newCompLoc;
+
+ }
+
+ }
+
+ }
+ return null;
+ }
+
+ private int getParamIdx(CompositeLocation compLoc,
+ Map<Integer, NTuple<Descriptor>> mapIdxToArgTuple) {
+
+ // if the composite location is started with the argument descriptor
+ // return the argument's index. o.t. return -1
+
+ Set<Integer> keySet = mapIdxToArgTuple.keySet();
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ Integer key = (Integer) iterator.next();
+ NTuple<Descriptor> argTuple = mapIdxToArgTuple.get(key);
+ if (argTuple.size() > 0 && translateToDescTuple(compLoc.getTuple()).startsWith(argTuple)) {
+ System.out.println("compLoc.getTuple=" + compLoc + " is started with " + argTuple);
+ return key.intValue();
+ }
+ }
+
+ return -1;
+ }
+
private boolean isPrimitiveType(NTuple<Descriptor> argTuple) {
Descriptor lastDesc = argTuple.get(argTuple.size() - 1);
return ((FieldDescriptor) lastDesc).getType().isPrimitive();
} else if (lastDesc instanceof VarDescriptor) {
return ((VarDescriptor) lastDesc).getType().isPrimitive();
+ } else if (lastDesc instanceof InterDescriptor) {
+ return true;
}
- return true;
+ return false;
}
private CompositeLocation translateCompositeLocationToCallee(CompositeLocation callerCompLoc,
next: for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
GlobalFlowNode node = (GlobalFlowNode) iterator.next();
- System.out.println("-GlobalFlowNode=" + node);
Location prefixLoc = node.getLocTuple().get(0);
if (calculatedPrefixSet.contains(prefixLoc)) {
globalFlowGraph.getReachableNodeSetByPrefix(node.getLocTuple().get(0));
// Set<GlobalFlowNode> reachNodeSet = globalFlowGraph.getReachableNodeSetFrom(node);
- // System.out.println("node=" + node + " prefixList=" + prefixList + " reachableNodeSet="
- // + reachableNodeSet);
+ // System.out.println("node=" + node + " prefixList=" + prefixList);
+ System.out.println("---prefixList=" + prefixList);
- for (int i = 0; i < prefixList.size(); i++) {
+ nextprefix: for (int i = 0; i < prefixList.size(); i++) {
NTuple<Location> curPrefix = prefixList.get(i);
+ System.out.println("---curPrefix=" + curPrefix);
Set<NTuple<Location>> reachableCommonPrefixSet = new HashSet<NTuple<Location>>();
for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
reachableCommonPrefixSet.add(reachNode.getLocTuple());
}
}
+ // System.out.println("reachableCommonPrefixSet=" + reachableCommonPrefixSet);
if (!reachableCommonPrefixSet.isEmpty()) {
MethodDescriptor nodePrefixLocFirstElementMethodDesc =
(MethodDescriptor) prefixLoc.getDescriptor();
+ // System.out.println("curPrefixFirstElementMethodDesc=" +
+ // curPrefixFirstElementMethodDesc);
+ // System.out.println("nodePrefixLocFirstElementMethodDesc="
+ // + nodePrefixLocFirstElementMethodDesc);
+
if (curPrefixFirstElementMethodDesc.equals(nodePrefixLocFirstElementMethodDesc)
|| isTransitivelyCalledFrom(nodePrefixLocFirstElementMethodDesc,
curPrefixFirstElementMethodDesc)) {
continue next;
}
- Location targetLocalLoc = node.getLocTuple().get(0);
- // CompositeLocation curCompLoc = globalFlowGraph.getCompositeLocation(targetLocalLoc);
- // if ((curPrefix.size() + 1) > curCompLoc.getSize()) {
+ if (!needToGenerateCompositeLocation(node, curPrefix)) {
+ System.out.println("NO NEED TO GENERATE COMP LOC to " + node + " with prefix="
+ + curPrefix);
+ // System.out.println("prefixList=" + prefixList);
+ // System.out.println("reachableNodeSet=" + reachableNodeSet);
+ continue nextprefix;
+ }
+ Location targetLocalLoc = node.getLocTuple().get(0);
CompositeLocation newCompLoc = generateCompositeLocation(curPrefix);
System.out.println("NEED TO ASSIGN COMP LOC TO " + node + " with prefix=" + curPrefix);
- System.out.println("- newCompLoc=" + newCompLoc);
+ System.out.println("-targetLocalLoc=" + targetLocalLoc + " - newCompLoc="
+ + newCompLoc);
globalFlowGraph.addMapLocationToInferCompositeLocation(targetLocalLoc, newCompLoc);
// }
}
}
- // Set<GlobalFlowNode> inNodeSet =
- // graph.getIncomingNodeSetWithPrefix(prefix);
- // System.out.println("inNodeSet=" + inNodeSet + " from=" + node);
+ }
+
+ private boolean checkFlowNodeReturnThisField(MethodDescriptor md) {
+
+ MethodDescriptor methodDescEventLoop = ssjava.getMethodContainingSSJavaLoop();
+ GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(methodDescEventLoop);
+
+ FlowGraph flowGraph = getFlowGraph(md);
+
+ ClassDescriptor enclosingDesc = getClassTypeDescriptor(md.getThis());
+ if (enclosingDesc == null) {
+ return false;
+ }
+
+ int count = 0;
+ Set<FlowNode> returnNodeSet = flowGraph.getReturnNodeSet();
+ Set<GlobalFlowNode> globalReturnNodeSet = new HashSet<GlobalFlowNode>();
+ for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
+ FlowNode flowNode = (FlowNode) iterator.next();
+ NTuple<Location> locTuple = translateToLocTuple(md, flowNode.getDescTuple());
+ GlobalFlowNode globalReturnNode = globalFlowGraph.getFlowNode(locTuple);
+ globalReturnNodeSet.add(globalReturnNode);
+
+ List<NTuple<Location>> prefixList = calculatePrefixList(globalFlowGraph, globalReturnNode);
+ for (int i = 0; i < prefixList.size(); i++) {
+ NTuple<Location> curPrefix = prefixList.get(i);
+ ClassDescriptor cd =
+ getClassTypeDescriptor(curPrefix.get(curPrefix.size() - 1).getLocDescriptor());
+ if (cd != null && cd.equals(enclosingDesc)) {
+ count++;
+ break;
+ }
+ }
+
+ }
+
+ if (count == returnNodeSet.size()) {
+ // in this case, all return nodes in the method returns values coming from a location that
+ // starts with "this"
+
+ System.out.println("$$$SET RETURN LOC TRUE=" + md);
+ mapMethodDescriptorToCompositeReturnCase.put(md, Boolean.TRUE);
+
+ // NameDescriptor returnLocDesc = new NameDescriptor("RLOC" + (locSeed++));
+ // NTuple<Descriptor> rDescTuple = new NTuple<Descriptor>();
+ // rDescTuple.add(md.getThis());
+ // rDescTuple.add(returnLocDesc);
+ //
+ // for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
+ // FlowNode rnode = (FlowNode) iterator.next();
+ // flowGraph.addValueFlowEdge(rnode.getDescTuple(), rDescTuple);
+ // }
+ //
+ // getMethodSummary(md).setRETURNLoc(new CompositeLocation(translateToLocTuple(md,
+ // rDescTuple)));
+
+ } else {
+ mapMethodDescriptorToCompositeReturnCase.put(md, Boolean.FALSE);
+ }
+
+ return mapMethodDescriptorToCompositeReturnCase.get(md).booleanValue();
+
+ }
+
+ private boolean needToGenerateCompositeLocation(GlobalFlowNode node, NTuple<Location> curPrefix) {
+ // return true if there is a path between a node to which we want to give a composite location
+ // and nodes which start with curPrefix
+
+ System.out.println("---needToGenerateCompositeLocation curPrefix=" + curPrefix);
+
+ Location targetLocalLoc = node.getLocTuple().get(0);
+
+ MethodDescriptor md = (MethodDescriptor) targetLocalLoc.getDescriptor();
+ FlowGraph flowGraph = getFlowGraph(md);
+ FlowNode flowNode = flowGraph.getFlowNode(node.getDescTuple());
+ Set<FlowNode> reachableSet = flowGraph.getReachFlowNodeSetFrom(flowNode);
+
+ Set<FlowNode> paramNodeSet = flowGraph.getParamFlowNodeSet();
+ for (Iterator iterator = paramNodeSet.iterator(); iterator.hasNext();) {
+ FlowNode paramFlowNode = (FlowNode) iterator.next();
+ if (curPrefix.startsWith(translateToLocTuple(md, paramFlowNode.getDescTuple()))) {
+ System.out.println("here1?!");
+ return true;
+ }
+ }
+
+ if (targetLocalLoc.getLocDescriptor() instanceof InterDescriptor) {
+ Pair<MethodInvokeNode, Integer> pair =
+ ((InterDescriptor) targetLocalLoc.getLocDescriptor()).getMethodArgIdxPair();
+
+ if (pair != null) {
+ System.out.println("$$$TARGETLOCALLOC HOLDER=" + targetLocalLoc);
+
+ MethodInvokeNode min = pair.getFirst();
+ Integer paramIdx = pair.getSecond();
+ MethodDescriptor mdCallee = min.getMethod();
+
+ FlowNode paramNode = getFlowGraph(mdCallee).getParamFlowNode(paramIdx);
+ if (checkNodeReachToReturnNode(mdCallee, paramNode)) {
+ System.out.println("here2?!");
+ return true;
+ }
+
+ }
+
+ }
+
+ GlobalFlowGraph subGlobalFlowGraph = getSubGlobalFlowGraph(md);
+ Set<GlobalFlowNode> subGlobalReachableSet = subGlobalFlowGraph.getReachableNodeSetFrom(node);
+
+ if (!md.isStatic()) {
+ ClassDescriptor currentMethodThisType = getClassTypeDescriptor(md.getThis());
+ for (int i = 0; i < curPrefix.size(); i++) {
+ ClassDescriptor prefixType = getClassTypeDescriptor(curPrefix.get(i).getLocDescriptor());
+ if (prefixType != null && prefixType.equals(currentMethodThisType)) {
+ System.out.println("PREFIX TYPE MATCHES WITH=" + currentMethodThisType);
+
+ if (mapMethodDescriptorToCompositeReturnCase.containsKey(md)) {
+ boolean hasCompReturnLocWithThis =
+ mapMethodDescriptorToCompositeReturnCase.get(md).booleanValue();
+ if (hasCompReturnLocWithThis) {
+ if (checkNodeReachToReturnNode(md, flowNode)) {
+ System.out.println("here3?!");
+ return true;
+ }
+ }
+ }
+
+ for (Iterator iterator3 = subGlobalReachableSet.iterator(); iterator3.hasNext();) {
+ GlobalFlowNode subGlobalReachalbeNode = (GlobalFlowNode) iterator3.next();
+ if (subGlobalReachalbeNode.getLocTuple().get(0).getLocDescriptor().equals(md.getThis())) {
+ System.out.println("PREFIX FOUND=" + subGlobalReachalbeNode);
+ System.out.println("here4?!");
+ return true;
+ }
+ }
+ }
+ }
+ }
+
+ // System.out.println("flowGraph.getReturnNodeSet()=" + flowGraph.getReturnNodeSet());
+ // System.out.println("flowGraph.contains(node.getDescTuple())="
+ // + flowGraph.contains(node.getDescTuple()) + " flowGraph.getFlowNode(node.getDescTuple())="
+ // + flowGraph.getFlowNode(node.getDescTuple()));reachableSet
+
+ // if (flowGraph.contains(node.getDescTuple())
+ // && flowGraph.getReturnNodeSet().contains(flowGraph.getFlowNode(node.getDescTuple()))) {
+ // // return checkFlowNodeReturnThisField(flowGraph);
+ // }
+
+ Location lastLocationOfPrefix = curPrefix.get(curPrefix.size() - 1);
+ // check whether prefix appears in the list of parameters
+ Set<MethodInvokeNode> minSet = mapMethodDescToMethodInvokeNodeSet.get(md);
+ found: for (Iterator iterator = minSet.iterator(); iterator.hasNext();) {
+ MethodInvokeNode min = (MethodInvokeNode) iterator.next();
+ Map<Integer, NTuple<Descriptor>> map = mapMethodInvokeNodeToArgIdxMap.get(min);
+ Set<Integer> keySet = map.keySet();
+ // System.out.println("min=" + min.printNode(0));
+
+ for (Iterator iterator2 = keySet.iterator(); iterator2.hasNext();) {
+ Integer argIdx = (Integer) iterator2.next();
+ NTuple<Descriptor> argTuple = map.get(argIdx);
+
+ if (!(!md.isStatic() && argIdx == 0)) {
+ // if the argTuple is empty, we don't need to do with anything(LITERAL CASE).
+ if (argTuple.size() > 0
+ && argTuple.get(argTuple.size() - 1).equals(lastLocationOfPrefix.getLocDescriptor())) {
+ NTuple<Location> locTuple =
+ translateToLocTuple(md, flowGraph.getParamFlowNode(argIdx).getDescTuple());
+ lastLocationOfPrefix = locTuple.get(0);
+ System.out.println("ARG CASE=" + locTuple);
+ for (Iterator iterator3 = subGlobalReachableSet.iterator(); iterator3.hasNext();) {
+ GlobalFlowNode subGlobalReachalbeNode = (GlobalFlowNode) iterator3.next();
+ // NTuple<Location> locTuple = translateToLocTuple(md, reachalbeNode.getDescTuple());
+ NTuple<Location> globalReachlocTuple = subGlobalReachalbeNode.getLocTuple();
+ for (int i = 0; i < globalReachlocTuple.size(); i++) {
+ if (globalReachlocTuple.get(i).equals(lastLocationOfPrefix)) {
+ System.out.println("ARG " + argTuple + " IS MATCHED WITH="
+ + lastLocationOfPrefix);
+ System.out.println("here5?!");
+
+ return true;
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+
+ // ClassDescriptor cd;
+ // if (lastLocationOfPrefix.getLocDescriptor() instanceof VarDescriptor) {
+ // cd = ((VarDescriptor) lastLocationOfPrefix.getLocDescriptor()).getType().getClassDesc();
+ // } else {
+ // // it is a field descriptor
+ // cd = ((FieldDescriptor) lastLocationOfPrefix.getLocDescriptor()).getType().getClassDesc();
+ // }
+ //
+ // GlobalFlowGraph subGlobalFlowGraph = getSubGlobalFlowGraph(md);
+ // Set<GlobalFlowNode> subGlobalReachableSet = subGlobalFlowGraph.getReachableNodeSetFrom(node);
+ //
+ // System.out.println("TRY TO FIND lastLocationOfPrefix=" + lastLocationOfPrefix);
+ // for (Iterator iterator2 = subGlobalReachableSet.iterator(); iterator2.hasNext();) {
+ // GlobalFlowNode subGlobalReachalbeNode = (GlobalFlowNode) iterator2.next();
+ // // NTuple<Location> locTuple = translateToLocTuple(md, reachalbeNode.getDescTuple());
+ // NTuple<Location> locTuple = subGlobalReachalbeNode.getLocTuple();
+ //
+ // for (int i = 0; i < locTuple.size(); i++) {
+ // if (locTuple.get(i).equals(lastLocationOfPrefix)) {
+ // return true;
+ // }
+ // }
+ //
+ // Location lastLoc = locTuple.get(locTuple.size() - 1);
+ // Descriptor enclosingDescriptor = lastLoc.getDescriptor();
+ //
+ // if (enclosingDescriptor != null && enclosingDescriptor.equals(cd)) {
+ // System.out.println("# WHY HERE?");
+ // System.out.println("subGlobalReachalbeNode=" + subGlobalReachalbeNode);
+ // return true;
+ // }
+ // }
+
+ return false;
+ }
+
+ private boolean checkNodeReachToReturnNode(MethodDescriptor md, FlowNode node) {
+
+ FlowGraph flowGraph = getFlowGraph(md);
+ Set<FlowNode> reachableSet = flowGraph.getReachFlowNodeSetFrom(node);
+ if (mapMethodDescriptorToCompositeReturnCase.containsKey(md)) {
+ boolean hasCompReturnLocWithThis =
+ mapMethodDescriptorToCompositeReturnCase.get(md).booleanValue();
+
+ if (hasCompReturnLocWithThis) {
+ for (Iterator iterator = flowGraph.getReturnNodeSet().iterator(); iterator.hasNext();) {
+ FlowNode returnFlowNode = (FlowNode) iterator.next();
+ if (reachableSet.contains(returnFlowNode)) {
+ return true;
+ }
+ }
+ }
+ }
+ return false;
}
private void assignCompositeLocation(CompositeLocation compLocPrefix, GlobalFlowNode node) {
System.out.println("\n##### calculatePrefixList node=" + node);
- MethodDescriptor md = graph.getMethodDescriptor();
-
Set<GlobalFlowNode> incomingNodeSetPrefix =
graph.getIncomingNodeSetByPrefix(node.getLocTuple().get(0));
- // System.out.println("incomingNodeSetPrefix=" + incomingNodeSetPrefix);
- //
- // Set<GlobalFlowNode> reachableNodeSetPrefix =
- // graph.getReachableNodeSetByPrefix(node.getLocTuple().get(0));
- // System.out.println("reachableNodeSetPrefix=" + reachableNodeSetPrefix);
+ // System.out.println("---incomingNodeSetPrefix=" + incomingNodeSetPrefix);
+
+ Set<GlobalFlowNode> reachableNodeSetPrefix =
+ graph.getReachableNodeSetByPrefix(node.getLocTuple().get(0));
+ // System.out.println("---reachableNodeSetPrefix=" + reachableNodeSetPrefix);
List<NTuple<Location>> prefixList = new ArrayList<NTuple<Location>>();
GlobalFlowNode inNode = (GlobalFlowNode) iterator.next();
NTuple<Location> inNodeTuple = inNode.getLocTuple();
+ if (inNodeTuple.get(0).getLocDescriptor() instanceof InterDescriptor
+ || inNodeTuple.get(0).getLocDescriptor().equals(GLOBALDESC)) {
+ continue;
+ }
+
for (int i = 1; i < inNodeTuple.size(); i++) {
NTuple<Location> prefix = inNodeTuple.subList(0, i);
if (!prefixList.contains(prefix)) {
}
}
});
- return prefixList;
- // List<NTuple<Location>> prefixList = new ArrayList<NTuple<Location>>();
- //
- // for (Iterator iterator = incomingNodeSet.iterator(); iterator.hasNext();) {
- // GlobalFlowNode inNode = (GlobalFlowNode) iterator.next();
- // NTuple<Location> inNodeTuple = inNode.getLocTuple();
- //
- // for (int i = 1; i < inNodeTuple.size(); i++) {
- // NTuple<Location> prefix = inNodeTuple.subList(0, i);
- // if (!prefixList.contains(prefix)) {
- // prefixList.add(prefix);
- // }
+ // remove a prefix which is not suitable for generating composite location
+ Location localVarLoc = node.getLocTuple().get(0);
+ MethodDescriptor md = (MethodDescriptor) localVarLoc.getDescriptor();
+ ClassDescriptor cd = md.getClassDesc();
+
+ int idx = 0;
+ Set<NTuple<Location>> toberemoved = new HashSet<NTuple<Location>>();
+ // for (int i = 0; i < prefixList.size(); i++) {
+ // NTuple<Location> prefixLocTuple = prefixList.get(i);
+ // if (!containsClassDesc(cd, prefixLocTuple)) {
+ // toberemoved.add(prefixLocTuple);
// }
// }
+
+ // System.out.println("method class=" + cd + " toberemoved=" + toberemoved);
+
+ prefixList.removeAll(toberemoved);
+
+ return prefixList;
+
+ }
+
+ private CompositeLocation calculateCompositeLocationFromFlowGraph(MethodDescriptor md,
+ FlowNode node) {
+
+ System.out.println("#############################################################");
+ System.out.println("calculateCompositeLocationFromFlowGraph=" + node);
+
+ FlowGraph flowGraph = getFlowGraph(md);
+ // NTuple<Location> paramLocTuple = translateToLocTuple(md, paramNode.getDescTuple());
+ // GlobalFlowNode paramGlobalNode = subGlobalFlowGraph.getFlowNode(paramLocTuple);
+
+ List<NTuple<Location>> prefixList = calculatePrefixListFlowGraph(flowGraph, node);
+
+ // Set<GlobalFlowNode> reachableNodeSet =
+ // subGlobalFlowGraph.getReachableNodeSetByPrefix(paramGlobalNode.getLocTuple().get(0));
//
- // 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;
- // }
- // }
- // });
- // return prefixList;
+ Set<FlowNode> reachableNodeSet =
+ flowGraph.getReachableSetFrom(node.getDescTuple().subList(0, 1));
+
+ // Set<GlobalFlowNode> reachNodeSet = globalFlowGraph.getReachableNodeSetFrom(node);
+
+ // System.out.println("node=" + node + " prefixList=" + prefixList);
+
+ 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 reachNode = (FlowNode) iterator2.next();
+ NTuple<Location> reachLocTuple = translateToLocTuple(md, reachNode.getCurrentDescTuple());
+ if (reachLocTuple.startsWith(curPrefix)) {
+ reachableCommonPrefixSet.add(reachLocTuple);
+ }
+ }
+ // System.out.println("reachableCommonPrefixSet=" + reachableCommonPrefixSet);
+
+ if (!reachableCommonPrefixSet.isEmpty()) {
+
+ MethodDescriptor curPrefixFirstElementMethodDesc =
+ (MethodDescriptor) curPrefix.get(0).getDescriptor();
+
+ // MethodDescriptor nodePrefixLocFirstElementMethodDesc =
+ // (MethodDescriptor) prefixLoc.getDescriptor();
+
+ // System.out.println("curPrefixFirstElementMethodDesc=" +
+ // curPrefixFirstElementMethodDesc);
+ // System.out.println("nodePrefixLocFirstElementMethodDesc="
+ // + nodePrefixLocFirstElementMethodDesc);
+
+ // TODO
+ // if (!node.getLocTuple().startsWith(curPrefix.get(0))) {
+
+ Location curPrefixLocalLoc = curPrefix.get(0);
+
+ Location targetLocalLoc = new Location(md, node.getDescTuple().get(0));
+ // Location targetLocalLoc = paramGlobalNode.getLocTuple().get(0);
+
+ CompositeLocation newCompLoc = generateCompositeLocation(curPrefix);
+ System.out.println("NEED2ASSIGN COMP LOC TO " + node + " with prefix=" + curPrefix);
+ System.out.println("-targetLocalLoc=" + targetLocalLoc + " - newCompLoc=" + newCompLoc);
+
+ // // makes sure that a newly generated location appears in the hierarchy graph
+ // for (int compIdx = 0; compIdx < newCompLoc.getSize(); compIdx++) {
+ // Location curLoc = newCompLoc.get(compIdx);
+ // getHierarchyGraph(curLoc.getDescriptor()).getHNode(curLoc.getLocDescriptor());
+ // }
+ // subGlobalFlowGraph.addMapLocationToInferCompositeLocation(targetLocalLoc, newCompLoc);
+ node.setCompositeLocation(newCompLoc);
+
+ return newCompLoc;
+
+ }
+
+ }
+ return null;
+ }
+
+ private List<NTuple<Location>> calculatePrefixListFlowGraph(FlowGraph graph, FlowNode node) {
+
+ System.out.println("\n##### calculatePrefixList node=" + node);
+
+ MethodDescriptor md = graph.getMethodDescriptor();
+ Set<FlowNode> incomingNodeSetPrefix =
+ graph.getIncomingNodeSetByPrefix(node.getDescTuple().get(0));
+ // System.out.println("---incomingNodeSetPrefix=" + incomingNodeSetPrefix);
+
+ Set<FlowNode> reachableNodeSetPrefix =
+ graph.getReachableSetFrom(node.getDescTuple().subList(0, 1));
+ // System.out.println("---reachableNodeSetPrefix=" + reachableNodeSetPrefix);
+
+ List<NTuple<Location>> prefixList = new ArrayList<NTuple<Location>>();
+
+ for (Iterator iterator = incomingNodeSetPrefix.iterator(); iterator.hasNext();) {
+ FlowNode inNode = (FlowNode) iterator.next();
+ NTuple<Location> inNodeTuple = translateToLocTuple(md, inNode.getCurrentDescTuple());
+
+ // if (inNodeTuple.get(0).getLocDescriptor() instanceof InterDescriptor
+ // || inNodeTuple.get(0).getLocDescriptor().equals(GLOBALDESC)) {
+ // continue;
+ // }
+
+ for (int i = 1; i < inNodeTuple.size(); i++) {
+ NTuple<Location> prefix = inNodeTuple.subList(0, i);
+ if (!prefixList.contains(prefix)) {
+ prefixList.add(prefix);
+ }
+ }
+ }
+
+ 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;
+ }
+ }
+ });
+
+ return prefixList;
+
+ }
+
+ private boolean containsClassDesc(ClassDescriptor cd, NTuple<Location> prefixLocTuple) {
+ for (int i = 0; i < prefixLocTuple.size(); i++) {
+ Location loc = prefixLocTuple.get(i);
+ Descriptor locDesc = loc.getLocDescriptor();
+ if (locDesc != null) {
+ ClassDescriptor type = getClassTypeDescriptor(locDesc);
+ if (type != null && type.equals(cd)) {
+ return true;
+ }
+ }
+ }
+ return false;
}
private GlobalFlowGraph constructSubGlobalFlowGraph(FlowGraph flowGraph) {
MethodDescriptor md = flowGraph.getMethodDescriptor();
- GlobalFlowGraph globalGraph = new GlobalFlowGraph(md);
+ GlobalFlowGraph globalGraph = getSubGlobalFlowGraph(md);
// Set<FlowNode> nodeSet = flowGraph.getNodeSet();
Set<FlowEdge> edgeSet = flowGraph.getEdgeSet();
NTuple<Descriptor> srcDescTuple = edge.getInitTuple();
NTuple<Descriptor> dstDescTuple = edge.getEndTuple();
+ if (flowGraph.getFlowNode(srcDescTuple) instanceof FlowReturnNode
+ || flowGraph.getFlowNode(dstDescTuple) instanceof FlowReturnNode) {
+ continue;
+ }
+
// here only keep the first element(method location) of the descriptor
// tuple
NTuple<Location> srcLocTuple = translateToLocTuple(md, srcDescTuple);
NTuple<Location> locTuple = new NTuple<Location>();
Descriptor enclosingDesc = md;
- // System.out.println("md=" + md + " descTuple=" + descTuple);
for (int i = 0; i < descTuple.size(); i++) {
Descriptor desc = descTuple.get(i);
}
- private void addValueFlowsFromCalleeSubGlobalFlowGraph(MethodDescriptor mdCaller,
- GlobalFlowGraph subGlobalFlowGraph) {
+ private void addValueFlowsFromCalleeSubGlobalFlowGraph(MethodDescriptor mdCaller) {
// the transformation for a call site propagates flows through parameters
// if the method is virtual, it also grab all relations from any possible
private void propagateValueFlowsToCallerFromSubGlobalFlowGraph(MethodInvokeNode min,
MethodDescriptor mdCaller, MethodDescriptor possibleMdCallee) {
- System.out.println("propagateValueFlowsToCallerFromSubGlobalFlowGraph=" + min.printNode(0)
- + " by caller=" + mdCaller);
+ System.out.println("---propagate from " + min.printNode(0) + " to caller=" + mdCaller);
FlowGraph calleeFlowGraph = getFlowGraph(possibleMdCallee);
Map<Integer, NTuple<Descriptor>> mapIdxToArg = mapMethodInvokeNodeToArgIdxMap.get(min);
- System.out.println("mapMethodInvokeNodeToArgIdxMap.get(min)="
+ System.out.println("-----mapMethodInvokeNodeToArgIdxMap.get(min)="
+ mapMethodInvokeNodeToArgIdxMap.get(min));
+
Set<Integer> keySet = mapIdxToArg.keySet();
for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
Integer idx = (Integer) iterator.next();
NTuple<Location> argLocTuple = translateToLocTuple(mdCaller, argDescTuple);
NTuple<Descriptor> paramDescTuple = calleeFlowGraph.getParamFlowNode(idx).getDescTuple();
NTuple<Location> paramLocTuple = translateToLocTuple(possibleMdCallee, paramDescTuple);
+ System.out.println("-------paramDescTuple=" + paramDescTuple + "->argDescTuple="
+ + argDescTuple);
addMapCallerArgToCalleeParam(min, argDescTuple, paramDescTuple);
}
-
}
+ // addValueFlowBetweenParametersToCaller(min, mdCaller, possibleMdCallee);
+
NTuple<Descriptor> baseTuple = mapMethodInvokeNodeToBaseTuple.get(min);
GlobalFlowGraph calleeSubGlobalGraph = getSubGlobalFlowGraph(possibleMdCallee);
Set<GlobalFlowNode> calleeNodeSet = calleeSubGlobalGraph.getNodeSet();
- System.out.println("#calleeNodeSet=" + calleeNodeSet);
for (Iterator iterator = calleeNodeSet.iterator(); iterator.hasNext();) {
GlobalFlowNode calleeNode = (GlobalFlowNode) iterator.next();
addValueFlowFromCalleeNode(min, mdCaller, possibleMdCallee, calleeNode);
}
- // int numParam = calleeFlowGraph.getNumParameters();
- // for (int idx = 0; idx < numParam; idx++) {
- //
- // FlowNode paramNode = calleeFlowGraph.getParamFlowNode(idx);
- //
- // NTuple<Location> paramLocTuple =
- // translateToLocTuple(possibleMdCallee, paramNode.getCurrentDescTuple());
- //
- // GlobalFlowNode globalParamNode =
- // calleeSubGlobalGraph.getFlowNode(paramLocTuple);
- //
- // NTuple<Descriptor> argTuple =
- // mapMethodInvokeNodeToArgIdxMap.get(min).get(idx);
- //
- // NTuple<Location> argLocTuple = translateToLocTuple(mdCaller, argTuple);
- //
- // System.out.println("argTupleSet=" + argLocTuple + " param=" +
- // paramLocTuple);
- // // here, it adds all value flows reachable from the paramNode in the
- // callee's flow graph
- //
- // addValueFlowsFromCalleeParam(mdCaller, argLocTuple, baseLocTuple,
- // possibleMdCallee,
- // globalParamNode);
- // }
- //
- // // TODO
- // // FlowGraph callerSubGlobalGraph = getSubGlobalFlowGraph(mdCaller);
- // // FlowGraph calleeSubGlobalGraph =
- // getSubGlobalFlowGraph(possibleMdCallee);
- // //
- // // int numParam = calleeSubGlobalGraph.getNumParameters();
- // // for (int idx = 0; idx < numParam; idx++) {
- // // FlowNode paramNode = calleeSubGlobalGraph.getParamFlowNode(idx);
- // // NTuple<Descriptor> argTuple =
- // mapMethodInvokeNodeToArgIdxMap.get(min).get(idx);
- // // System.out.println("argTupleSet=" + argTuple + " param=" +
- // paramNode);
- // // // here, it adds all value flows reachable from the paramNode in the
- // callee's flow graph
- // // addValueFlowsFromCalleeParam(min, calleeSubGlobalGraph, paramNode,
- // callerSubGlobalGraph,
- // // argTuple, baseTuple);
- // // }
+ System.out.println("$$$GLOBAL PC LOC ADD=" + mdCaller);
+ Set<NTuple<Location>> pcLocTupleSet = mapMethodInvokeNodeToPCLocTupleSet.get(min);
+ System.out.println("---pcLocTupleSet=" + pcLocTupleSet);
+ GlobalFlowGraph callerSubGlobalGraph = getSubGlobalFlowGraph(mdCaller);
+ for (Iterator iterator = calleeNodeSet.iterator(); iterator.hasNext();) {
+ GlobalFlowNode calleeNode = (GlobalFlowNode) iterator.next();
+ if (calleeNode.isParamNodeWithIncomingFlows()) {
+ System.out.println("calleeNode.getLocTuple()" + calleeNode.getLocTuple());
+ NTuple<Location> callerSrcNodeLocTuple =
+ translateToCallerLocTuple(min, possibleMdCallee, mdCaller, calleeNode.getLocTuple());
+ System.out.println("---callerSrcNodeLocTuple=" + callerSrcNodeLocTuple);
+ if (callerSrcNodeLocTuple != null && callerSrcNodeLocTuple.size() > 0) {
+ for (Iterator iterator2 = pcLocTupleSet.iterator(); iterator2.hasNext();) {
+ NTuple<Location> pcLocTuple = (NTuple<Location>) iterator2.next();
+ callerSubGlobalGraph.addValueFlowEdge(pcLocTuple, callerSrcNodeLocTuple);
+ }
+ }
+ }
+
+ }
}
GlobalFlowGraph calleeSubGlobalGraph = getSubGlobalFlowGraph(mdCallee);
GlobalFlowGraph callerSubGlobalGraph = getSubGlobalFlowGraph(mdCaller);
+ // System.out.println("$addValueFlowFromCalleeNode calleeSrcNode=" + calleeSrcNode);
+
NTuple<Location> callerSrcNodeLocTuple =
translateToCallerLocTuple(min, mdCallee, mdCaller, calleeSrcNode.getLocTuple());
+ // System.out.println("---callerSrcNodeLocTuple=" + callerSrcNodeLocTuple);
+
+ if (callerSrcNodeLocTuple != null && callerSrcNodeLocTuple.size() > 0) {
- if (callerSrcNodeLocTuple != null) {
Set<GlobalFlowNode> outNodeSet = calleeSubGlobalGraph.getOutNodeSet(calleeSrcNode);
for (Iterator iterator = outNodeSet.iterator(); iterator.hasNext();) {
GlobalFlowNode outNode = (GlobalFlowNode) iterator.next();
NTuple<Location> callerDstNodeLocTuple =
translateToCallerLocTuple(min, mdCallee, mdCaller, outNode.getLocTuple());
+ // System.out.println("outNode=" + outNode + " callerDstNodeLocTuple="
+ // + callerDstNodeLocTuple);
if (callerDstNodeLocTuple != null) {
callerSubGlobalGraph.addValueFlowEdge(callerSrcNodeLocTuple, callerDstNodeLocTuple);
}
// this method will return the same nodeLocTuple if the corresponding argument is literal
// value.
- FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
+ // System.out.println("translateToCallerLocTuple=" + nodeLocTuple);
+ FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
NTuple<Descriptor> nodeDescTuple = translateToDescTuple(nodeLocTuple);
if (calleeFlowGraph.isParameter(nodeDescTuple)) {
int paramIdx = calleeFlowGraph.getParamIdx(nodeDescTuple);
NTuple<Descriptor> argDescTuple = mapMethodInvokeNodeToArgIdxMap.get(min).get(paramIdx);
- if (argDescTuple.size() == 0) {
- // argument is literal
- return nodeLocTuple.clone();
- }
+ // if (isPrimitive(nodeLocTuple.get(0).getLocDescriptor())) {
+ // // the type of argument is primitive.
+ // return nodeLocTuple.clone();
+ // }
+ // System.out.println("paramIdx=" + paramIdx + " argDescTuple=" + argDescTuple + " from min="
+ // + min.printNode(0));
NTuple<Location> argLocTuple = translateToLocTuple(mdCaller, argDescTuple);
NTuple<Location> callerLocTuple = new NTuple<Location>();
}
- private NTuple<Descriptor> translateToDescTuple(NTuple<Location> locTuple) {
-
- NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
- for (int i = 0; i < locTuple.size(); i++) {
- descTuple.add(locTuple.get(i).getLocDescriptor());
- }
- return descTuple;
-
- }
-
- private void addValueFlowsFromCalleeParam(MethodDescriptor mdCaller,
- NTuple<Location> argLocTuple, NTuple<Location> baseLocTuple, MethodDescriptor mdCallee,
- GlobalFlowNode globalParamNode) {
-
- Set<GlobalFlowNode> visited = new HashSet<GlobalFlowNode>();
- visited.add(globalParamNode);
- recurAddValueFlowsFromCalleeParam(mdCaller, argLocTuple, baseLocTuple, mdCallee,
- globalParamNode);
-
- }
-
- private void recurAddValueFlowsFromCalleeParam(MethodDescriptor mdCaller,
- NTuple<Location> argLocTuple, NTuple<Location> baseLocTuple, MethodDescriptor mdCallee,
- GlobalFlowNode calleeCurNode) {
-
- // FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
- // GlobalFlowGraph calleeSubGlobalGraph = getSubGlobalFlowGraph(mdCallee);
- //
- // NTuple<Location> curNodeLocTuple = calleeCurNode.getLocTuple();
- // NTuple<Descriptor> curNodeDescTuple = calleeCurNode.getDescTuple();
- // if (calleeFlowGraph.isParameter(curNodeDescTuple)) {
- // curNodeLocTuple = translateToCaller(argLocTuple, curNodeLocTuple);
- // }
- //
- // Set<GlobalFlowNode> outNodeSet =
- // calleeSubGlobalGraph.getOutNodeSet(calleeCurNode);
- // for (Iterator iterator = outNodeSet.iterator(); iterator.hasNext();) {
- // GlobalFlowNode outNode = (GlobalFlowNode) iterator.next();
- //
- // NTuple<Location> curNodeLocTuple = calleeCurNode.getLocTuple();
- // NTuple<Descriptor> curNodeDescTuple = calleeCurNode.getDescTuple();
- // if (calleeFlowGraph.isParameter(curNodeDescTuple)) {
- // curNodeLocTuple = translateToCaller(argLocTuple, curNodeLocTuple);
- // }
- //
- // outNode.getDescTuple();
- //
- // if (calleeFlowGraph.is)
- //
- // if (calleeSubGlobalGraph.isParameter(srcDescTuple)) {
- // // destination node is started with 'parameter'
- // // need to translate it in terms of the caller's a node
- // srcDescTuple =
- // translateToCaller(min, calleeSubGlobalGraph.getParamIdx(srcDescTuple),
- // srcDescTuple);
- // }
- //
- // }
- //
- // Set<FlowEdge> edgeSet =
- // calleeSubGlobalGraph.getOutEdgeSetStartingFrom(calleeSrcNode);
- // for (Iterator iterator = edgeSet.iterator(); iterator.hasNext();) {
- // FlowEdge flowEdge = (FlowEdge) iterator.next();
- //
- // NTuple<Descriptor> srcDescTuple = flowEdge.getInitTuple();
- // NTuple<Descriptor> dstDescTuple = flowEdge.getEndTuple();
- //
- // FlowNode dstNode = calleeSubGlobalGraph.getFlowNode(dstDescTuple);
- //
- // if (calleeSubGlobalGraph.isParameter(srcDescTuple)) {
- // // destination node is started with 'parameter'
- // // need to translate it in terms of the caller's a node
- // srcDescTuple =
- // translateToCaller(min, calleeSubGlobalGraph.getParamIdx(srcDescTuple),
- // srcDescTuple);
- // }
- //
- // if (calleeSubGlobalGraph.isParameter(dstDescTuple)) {
- // // destination node is started with 'parameter'
- // // need to translate it in terms of the caller's a node
- // dstDescTuple =
- // translateToCaller(min, calleeSubGlobalGraph.getParamIdx(dstDescTuple),
- // dstDescTuple);
- // }
- //
- // callerSubGlobalGraph.addValueFlowEdge(srcDescTuple, dstDescTuple);
- //
- // if (!visited.contains(dstNode)) {
- // visited.add(dstNode);
- // recurAddValueFlowsFromCalleeParam(min, calleeSubGlobalGraph, dstNode,
- // callerSubGlobalGraph,
- // dstDescTuple, visited, baseTuple);
- // }
- //
- // }
-
- }
-
- private NTuple<Location> translateToCaller(NTuple<Location> argLocTuple,
- NTuple<Location> curNodeLocTuple) {
-
- NTuple<Location> callerLocTuple = new NTuple<Location>();
+ public static boolean isPrimitive(Descriptor desc) {
- callerLocTuple.addAll(argLocTuple);
- for (int i = 1; i < curNodeLocTuple.size(); i++) {
- callerLocTuple.add(curNodeLocTuple.get(i));
+ if (desc instanceof FieldDescriptor) {
+ return ((FieldDescriptor) desc).getType().isPrimitive();
+ } else if (desc instanceof VarDescriptor) {
+ return ((VarDescriptor) desc).getType().isPrimitive();
+ } else if (desc instanceof InterDescriptor) {
+ return true;
}
- return callerLocTuple;
+ return false;
}
- private void recurAddValueFlowsFromCalleeParam(MethodInvokeNode min,
- FlowGraph calleeSubGlobalGraph, FlowNode calleeSrcNode, FlowGraph callerSubGlobalGraph,
- NTuple<Descriptor> callerSrcTuple, Set<FlowNode> visited, NTuple<Descriptor> baseTuple) {
+ public static boolean isReference(Descriptor desc) {
- MethodDescriptor mdCallee = calleeSubGlobalGraph.getMethodDescriptor();
+ if (desc instanceof FieldDescriptor) {
- // Set<FlowEdge> edgeSet =
- // calleeSubGlobalGraph.getOutEdgeSet(calleeSrcNode);
- Set<FlowEdge> edgeSet = calleeSubGlobalGraph.getOutEdgeSetStartingFrom(calleeSrcNode);
- for (Iterator iterator = edgeSet.iterator(); iterator.hasNext();) {
- FlowEdge flowEdge = (FlowEdge) iterator.next();
-
- NTuple<Descriptor> srcDescTuple = flowEdge.getInitTuple();
- NTuple<Descriptor> dstDescTuple = flowEdge.getEndTuple();
-
- FlowNode dstNode = calleeSubGlobalGraph.getFlowNode(dstDescTuple);
-
- if (calleeSubGlobalGraph.isParameter(srcDescTuple)) {
- // destination node is started with 'parameter'
- // need to translate it in terms of the caller's a node
- srcDescTuple =
- translateToCaller(min, calleeSubGlobalGraph.getParamIdx(srcDescTuple), srcDescTuple);
- }
-
- if (calleeSubGlobalGraph.isParameter(dstDescTuple)) {
- // destination node is started with 'parameter'
- // need to translate it in terms of the caller's a node
- dstDescTuple =
- translateToCaller(min, calleeSubGlobalGraph.getParamIdx(dstDescTuple), dstDescTuple);
+ TypeDescriptor type = ((FieldDescriptor) desc).getType();
+ if (type.isArray()) {
+ return false;
+ } else {
+ return type.isPtr();
}
- callerSubGlobalGraph.addValueFlowEdge(srcDescTuple, dstDescTuple);
-
- if (!visited.contains(dstNode)) {
- visited.add(dstNode);
- recurAddValueFlowsFromCalleeParam(min, calleeSubGlobalGraph, dstNode, callerSubGlobalGraph,
- dstDescTuple, visited, baseTuple);
+ } else if (desc instanceof VarDescriptor) {
+ TypeDescriptor type = ((VarDescriptor) desc).getType();
+ if (type.isArray()) {
+ return false;
+ } else {
+ return type.isPtr();
}
-
- }
-
- }
-
- private NTuple<Descriptor> translateToCaller(MethodInvokeNode min, int paramIdx,
- NTuple<Descriptor> srcDescTuple) {
-
- NTuple<Descriptor> callerTuple = new NTuple<Descriptor>();
-
- NTuple<Descriptor> argTuple = mapMethodInvokeNodeToArgIdxMap.get(min).get(paramIdx);
-
- for (int i = 0; i < argTuple.size(); i++) {
- callerTuple.add(argTuple.get(i));
- }
-
- for (int i = 1; i < srcDescTuple.size(); i++) {
- callerTuple.add(srcDescTuple.get(i));
}
- return callerTuple;
+ return false;
}
- private NTuple<Descriptor> traslateToCalleeParamTupleToCallerArgTuple(
- NTuple<Descriptor> calleeInitTuple, NTuple<Descriptor> callerSrcTuple) {
-
- NTuple<Descriptor> callerInitTuple = new NTuple<Descriptor>();
-
- for (int i = 0; i < callerSrcTuple.size(); i++) {
- callerInitTuple.add(callerSrcTuple.get(i));
- }
+ private NTuple<Descriptor> translateToDescTuple(NTuple<Location> locTuple) {
- for (int i = 1; i < calleeInitTuple.size(); i++) {
- callerInitTuple.add(calleeInitTuple.get(i));
+ NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
+ for (int i = 0; i < locTuple.size(); i++) {
+ descTuple.add(locTuple.get(i).getLocDescriptor());
}
+ return descTuple;
- return callerInitTuple;
}
public LocationSummary getLocationSummary(Descriptor d) {
// inferred composite location
for (int paramIdx = 0; paramIdx < flowGraph.getNumParameters(); paramIdx++) {
FlowNode flowNode = flowGraph.getParamFlowNode(paramIdx);
- CompositeLocation inferredCompLoc = flowNode.getCompositeLocation();
+ CompositeLocation inferredCompLoc =
+ updateCompositeLocation(flowNode.getCompositeLocation());
// NTuple<Descriptor> descTuple = flowNode.getDescTuple();
//
// CompositeLocation assignedCompLoc = flowNode.getCompositeLocation();
// loc.setLocDescriptor(locDesc);
// inferredCompLoc = new CompositeLocation(loc);
// }
- System.out.println("-paramIdx=" + paramIdx + " infer=" + inferredCompLoc);
- System.out.println("-flowNode inferLoc=" + flowNode.getCompositeLocation());
+ System.out.println("-paramIdx=" + paramIdx + " infer=" + inferredCompLoc + " original="
+ + flowNode.getCompositeLocation());
Descriptor localVarDesc = flowNode.getDescTuple().get(0);
methodSummary.addMapVarNameToInferCompLoc(localVarDesc, inferredCompLoc);
Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
Descriptor desc = (Descriptor) iterator.next();
+ // System.out.println("SSJAVA: remove redundant edges: " + desc);
HierarchyGraph simpleHierarchyGraph = getHierarchyGraph(desc).clone();
simpleHierarchyGraph.setName(desc + "_SIMPLE");
simpleHierarchyGraph.removeRedundantEdges();
- // simpleHierarchyGraph.simplifyHierarchyGraph();
mapDescriptorToSimpleHierarchyGraph.put(desc, simpleHierarchyGraph);
}
}
Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
Descriptor desc = (Descriptor) iterator.next();
+ System.out.println("SSJAVA: Constructing Skeleton Hierarchy Graph: " + desc);
HierarchyGraph simpleGraph = getSimpleHierarchyGraph(desc);
HierarchyGraph skeletonGraph = simpleGraph.generateSkeletonGraph();
skeletonGraph.setMapDescToHNode(simpleGraph.getMapDescToHNode());
// do fixed-point analysis
- ssjava.init();
LinkedList<MethodDescriptor> descriptorListToAnalyze = ssjava.getSortedDescriptors();
// Collections.sort(descriptorListToAnalyze, new
}
}
+ Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ Descriptor key = (Descriptor) iterator.next();
+ HierarchyGraph graph = getHierarchyGraph(key);
+
+ Set<HNode> nodeToBeConnected = new HashSet<HNode>();
+ for (Iterator iterator2 = graph.getNodeSet().iterator(); iterator2.hasNext();) {
+ HNode node = (HNode) iterator2.next();
+ if (!node.isSkeleton() && !node.isCombinationNode()) {
+ if (graph.getIncomingNodeSet(node).size() == 0) {
+ nodeToBeConnected.add(node);
+ }
+ }
+ }
+
+ for (Iterator iterator2 = nodeToBeConnected.iterator(); iterator2.hasNext();) {
+ HNode node = (HNode) iterator2.next();
+ System.out.println("NEED TO BE CONNECTED TO TOP=" + node);
+ graph.addEdge(graph.getHNode(TOPDESC), node);
+ }
+
+ }
+
}
private HierarchyGraph getHierarchyGraph(Descriptor d) {
// visit each node of method flow graph
FlowGraph fg = getFlowGraph(md);
- Set<FlowNode> nodeSet = fg.getNodeSet();
+ // Set<FlowNode> nodeSet = fg.getNodeSet();
+
+ Set<FlowEdge> edgeSet = fg.getEdgeSet();
Set<Descriptor> paramDescSet = fg.getMapParamDescToIdx().keySet();
for (Iterator iterator = paramDescSet.iterator(); iterator.hasNext();) {
// for the method lattice, we need to look at the first element of
// NTuple<Descriptor>
boolean hasGlobalAccess = false;
- for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
- FlowNode srcNode = (FlowNode) iterator.next();
+ // for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
+ // FlowNode originalSrcNode = (FlowNode) iterator.next();
+ for (Iterator iterator = edgeSet.iterator(); iterator.hasNext();) {
+ FlowEdge edge = (FlowEdge) iterator.next();
- // if the srcNode is started with the global descriptor
- // need to set as a skeleton node
- if (!hasGlobalAccess && srcNode.getDescTuple().startsWith(GLOBALDESC)) {
- hasGlobalAccess = true;
+ FlowNode originalSrcNode = fg.getFlowNode(edge.getInitTuple());
+ Set<FlowNode> sourceNodeSet = new HashSet<FlowNode>();
+ if (originalSrcNode instanceof FlowReturnNode) {
+ FlowReturnNode rnode = (FlowReturnNode) originalSrcNode;
+ System.out.println("rnode=" + rnode);
+ Set<NTuple<Descriptor>> tupleSet = rnode.getReturnTupleSet();
+ for (Iterator iterator2 = tupleSet.iterator(); iterator2.hasNext();) {
+ NTuple<Descriptor> nTuple = (NTuple<Descriptor>) iterator2.next();
+ sourceNodeSet.add(fg.getFlowNode(nTuple));
+ System.out.println("&&&SOURCE fg.getFlowNode(nTuple)=" + fg.getFlowNode(nTuple));
+ }
+ } else {
+ sourceNodeSet.add(originalSrcNode);
}
- Set<FlowEdge> outEdgeSet = fg.getOutEdgeSet(srcNode);
- for (Iterator iterator2 = outEdgeSet.iterator(); iterator2.hasNext();) {
- FlowEdge outEdge = (FlowEdge) iterator2.next();
- FlowNode dstNode = outEdge.getDst();
+ // System.out.println("---sourceNodeSet=" + sourceNodeSet + " from originalSrcNode="
+ // + originalSrcNode);
+
+ for (Iterator iterator3 = sourceNodeSet.iterator(); iterator3.hasNext();) {
+ FlowNode srcNode = (FlowNode) iterator3.next();
NTuple<Descriptor> srcNodeTuple = srcNode.getDescTuple();
- NTuple<Descriptor> dstNodeTuple = dstNode.getDescTuple();
+ Descriptor srcLocalDesc = srcNodeTuple.get(0);
+
+ if (srcLocalDesc instanceof InterDescriptor
+ && ((InterDescriptor) srcLocalDesc).getMethodArgIdxPair() != null) {
+
+ if (srcNode.getCompositeLocation() == null) {
+ continue;
+ }
+ }
+
+ // if the srcNode is started with the global descriptor
+ // need to set as a skeleton node
+ if (!hasGlobalAccess && srcNode.getDescTuple().startsWith(GLOBALDESC)) {
+ hasGlobalAccess = true;
+ }
- if (outEdge.getInitTuple().equals(srcNodeTuple)
- && outEdge.getEndTuple().equals(dstNodeTuple)) {
+ // Set<FlowEdge> outEdgeSet = fg.getOutEdgeSet(originalSrcNode);
+ // for (Iterator iterator2 = outEdgeSet.iterator(); iterator2.hasNext();) {
+ // FlowEdge outEdge = (FlowEdge) iterator2.next();
+ // FlowNode originalDstNode = outEdge.getDst();
+ FlowNode originalDstNode = fg.getFlowNode(edge.getEndTuple());
+
+ Set<FlowNode> dstNodeSet = new HashSet<FlowNode>();
+ if (originalDstNode instanceof FlowReturnNode) {
+ FlowReturnNode rnode = (FlowReturnNode) originalDstNode;
+ // System.out.println("\n-returnNode=" + rnode);
+ Set<NTuple<Descriptor>> tupleSet = rnode.getReturnTupleSet();
+ for (Iterator iterator4 = tupleSet.iterator(); iterator4.hasNext();) {
+ NTuple<Descriptor> nTuple = (NTuple<Descriptor>) iterator4.next();
+ dstNodeSet.add(fg.getFlowNode(nTuple));
+ System.out.println("&&&DST fg.getFlowNode(nTuple)=" + fg.getFlowNode(nTuple));
+ }
+ } else {
+ dstNodeSet.add(originalDstNode);
+ }
+ // System.out.println("---dstNodeSet=" + dstNodeSet);
+ for (Iterator iterator4 = dstNodeSet.iterator(); iterator4.hasNext();) {
+ FlowNode dstNode = (FlowNode) iterator4.next();
+
+ NTuple<Descriptor> dstNodeTuple = dstNode.getDescTuple();
+ Descriptor dstLocalDesc = dstNodeTuple.get(0);
+
+ if (dstLocalDesc instanceof InterDescriptor
+ && ((InterDescriptor) dstLocalDesc).getMethodArgIdxPair() != null) {
+ if (dstNode.getCompositeLocation() == null) {
+ System.out.println("%%%%%%%%%%%%%SKIP=" + dstNode);
+ continue;
+ }
+ }
+
+ // if (outEdge.getInitTuple().equals(srcNodeTuple)
+ // && outEdge.getEndTuple().equals(dstNodeTuple)) {
NTuple<Descriptor> srcCurTuple = srcNode.getCurrentDescTuple();
NTuple<Descriptor> dstCurTuple = dstNode.getCurrentDescTuple();
+ System.out.println("-srcCurTuple=" + srcCurTuple + " dstCurTuple=" + dstCurTuple
+ + " srcNode=" + srcNode + " dstNode=" + dstNode);
+
if ((srcCurTuple.size() > 1 && dstCurTuple.size() > 1)
&& srcCurTuple.get(0).equals(dstCurTuple.get(0))) {
}
extractFlowsBetweenFields(classDesc, srcNode, dstNode, 1);
- } else {
- // value flow between local var - local var or local var - field
+ } else if ((srcCurTuple.size() == 1 && dstCurTuple.size() == 1)
+ || ((srcCurTuple.size() > 1 || dstCurTuple.size() > 1) && !srcCurTuple.get(0).equals(
+ dstCurTuple.get(0)))) {
+
+ // value flow between a primitive local var - a primitive local var or local var -
+ // field
Descriptor srcDesc = srcCurTuple.get(0);
Descriptor dstDesc = dstCurTuple.get(0);
}
+ // }
+ // }
+
}
+
}
+
}
// If the method accesses static fields
}
methodGraph.getHNode(GLOBALDESC).setSkeleton(true);
+ if (ssjava.getMethodContainingSSJavaLoop().equals(md)) {
+ // if the current method contains the event loop
+ // we need to set all nodes of the hierarchy graph as a skeleton node
+ Set<HNode> hnodeSet = methodGraph.getNodeSet();
+ for (Iterator iterator = hnodeSet.iterator(); iterator.hasNext();) {
+ HNode hnode = (HNode) iterator.next();
+ hnode.setSkeleton(true);
+ }
+ }
+
}
private MethodSummary getMethodSummary(MethodDescriptor md) {
}
}
- rtr += "\")";
-
if (desc instanceof MethodDescriptor) {
System.out.println("#EXTRA LOC DECLARATION GEN=" + desc);
- MethodSummary methodSummary = getMethodSummary((MethodDescriptor) desc);
+ MethodDescriptor md = (MethodDescriptor) desc;
+ MethodSummary methodSummary = getMethodSummary(md);
+
+ TypeDescriptor returnType = ((MethodDescriptor) desc).getReturnType();
+ if (!ssjava.getMethodContainingSSJavaLoop().equals(desc) && returnType != null
+ && (!returnType.isVoid())) {
+ CompositeLocation returnLoc = methodSummary.getRETURNLoc();
+ if (returnLoc.getSize() == 1) {
+ String returnLocStr = generateLocationAnnoatation(methodSummary.getRETURNLoc());
+ if (rtr.indexOf(returnLocStr) == -1) {
+ rtr += "," + returnLocStr;
+ }
+ }
+ }
+ rtr += "\")";
if (!ssjava.getMethodContainingSSJavaLoop().equals(desc)) {
- TypeDescriptor returnType = ((MethodDescriptor) desc).getReturnType();
if (returnType != null && (!returnType.isVoid())) {
rtr +=
"\n@RETURNLOC(\"" + generateLocationAnnoatation(methodSummary.getRETURNLoc()) + "\")";
}
+
CompositeLocation pcLoc = methodSummary.getPCLoc();
if ((pcLoc != null) && (!pcLoc.get(0).isTop())) {
rtr += "\n@PCLOC(\"" + generateLocationAnnoatation(pcLoc) + "\")";
}
}
- rtr += "\n@THISLOC(\"" + methodSummary.getThisLocName() + "\")";
+ if (!md.isStatic()) {
+ rtr += "\n@THISLOC(\"" + methodSummary.getThisLocName() + "\")";
+ }
rtr += "\n@GLOBALLOC(\"" + methodSummary.getGlobalLocName() + "\")";
+ } else {
+ rtr += "\")";
}
return rtr;
if (mapDescToDefinitionLine.containsKey(localVarDesc)) {
int varLineNum = mapDescToDefinitionLine.get(localVarDesc);
String orgSourceLine = sourceVec.get(varLineNum);
+ System.out.println("varLineNum=" + varLineNum + " org src=" + orgSourceLine);
int idx =
orgSourceLine.indexOf(generateVarDeclaration((VarDescriptor) localVarDesc));
+ System.out.println("idx=" + idx
+ + " generateVarDeclaration((VarDescriptor) localVarDesc)="
+ + generateVarDeclaration((VarDescriptor) localVarDesc));
assert (idx != -1);
String annoatedStr =
orgSourceLine.substring(0, idx) + locAnnotationStr + " "
int idx =
getParamLocation(methodDefStr,
generateVarDeclaration((VarDescriptor) localVarDesc));
-
+ System.out.println("methodDefStr=" + methodDefStr + " localVarDesc=" + localVarDesc
+ + " idx=" + idx);
assert (idx != -1);
String annoatedStr =
}
private String generateLocationAnnoatation(CompositeLocation loc) {
- System.out.println("loc=" + loc);
String rtr = "";
// method location
Location methodLoc = loc.get(0);
}
- private void inferLattices() {
- }
-
private void calculateExtraLocations() {
- LinkedList<MethodDescriptor> descriptorListToAnalyze = ssjava.getSortedDescriptors();
- for (Iterator iterator = descriptorListToAnalyze.iterator(); iterator.hasNext();) {
+
+ LinkedList<MethodDescriptor> methodDescList = ssjava.getSortedDescriptors();
+ for (Iterator iterator = methodDescList.iterator(); iterator.hasNext();) {
MethodDescriptor md = (MethodDescriptor) iterator.next();
if (!ssjava.getMethodContainingSSJavaLoop().equals(md)) {
calculateExtraLocations(md);
}
}
+
}
private void checkLatticesOfVirtualMethods(MethodDescriptor md) {
private void calculatePCLOC(MethodDescriptor md) {
- System.out.println("#calcualtePCLOC");
+ System.out.println("#CalculatePCLOC");
MethodSummary methodSummary = getMethodSummary(md);
FlowGraph fg = getFlowGraph(md);
Map<Integer, CompositeLocation> mapParamToLoc = methodSummary.getMapParamIdxToInferLoc();
// PC location is higher than location types of parameters which has incoming flows.
Set<NTuple<Location>> paramLocTupleHavingInFlowSet = new HashSet<NTuple<Location>>();
+ Set<Descriptor> paramDescNOTHavingInFlowSet = new HashSet<Descriptor>();
+ // Set<FlowNode> paramNodeNOThavingInFlowSet = new HashSet<FlowNode>();
int numParams = fg.getNumParameters();
for (int i = 0; i < numParams; i++) {
FlowNode paramFlowNode = fg.getParamFlowNode(i);
Descriptor prefix = paramFlowNode.getDescTuple().get(0);
+ NTuple<Descriptor> paramDescTuple = paramFlowNode.getCurrentDescTuple();
+ NTuple<Location> paramLocTuple = translateToLocTuple(md, paramDescTuple);
- if (fg.getIncomingNodeSetByPrefix(prefix).size() > 0) {
+ Set<FlowNode> inNodeToParamSet = fg.getIncomingNodeSetByPrefix(prefix);
+ if (inNodeToParamSet.size() > 0) {
// parameter has in-value flows
- NTuple<Descriptor> paramDescTuple = paramFlowNode.getCurrentDescTuple();
- NTuple<Location> paramLocTuple = translateToLocTuple(md, paramDescTuple);
- paramLocTupleHavingInFlowSet.add(paramLocTuple);
+
+ for (Iterator iterator = inNodeToParamSet.iterator(); iterator.hasNext();) {
+ FlowNode inNode = (FlowNode) iterator.next();
+ Set<FlowEdge> outEdgeSet = fg.getOutEdgeSet(inNode);
+ for (Iterator iterator2 = outEdgeSet.iterator(); iterator2.hasNext();) {
+ FlowEdge flowEdge = (FlowEdge) iterator2.next();
+ if (flowEdge.getEndTuple().startsWith(prefix)) {
+ NTuple<Location> paramLocTupleWithIncomingFlow =
+ translateToLocTuple(md, flowEdge.getEndTuple());
+ paramLocTupleHavingInFlowSet.add(paramLocTupleWithIncomingFlow);
+ }
+ }
+ }
+
+ // paramLocTupleHavingInFlowSet.add(paramLocTuple);
+ } else {
+ // paramNodeNOThavingInFlowSet.add(fg.getFlowNode(paramDescTuple));
+ paramDescNOTHavingInFlowSet.add(prefix);
}
}
NTuple<Location> pcLocTuple =
generateLocTupleRelativeTo(md, paramLocTupleHavingInFlowSet, PCLOC);
- int pcLocTupleIdx = pcLocTuple.size() - 1;
- Location pcLoc = pcLocTuple.get(pcLocTupleIdx);
- Descriptor pcDesc = pcLoc.getLocDescriptor();
- Descriptor enclosingDesc = pcLocTuple.get(pcLocTupleIdx).getDescriptor();
+ NTuple<Descriptor> pcDescTuple = translateToDescTuple(pcLocTuple);
+
+ // System.out.println("pcLoc=" + pcLocTuple);
- HierarchyGraph hierarchyGraph = getHierarchyGraph(enclosingDesc);
- HNode pcNode = hierarchyGraph.getHNode(pcDesc);
- pcNode.setSkeleton(true);
+ CompositeLocation curPCLoc = methodSummary.getPCLoc();
+ if (curPCLoc.get(0).isTop() || pcLocTuple.size() > curPCLoc.getSize()) {
+ methodSummary.setPCLoc(new CompositeLocation(pcLocTuple));
+
+ Set<FlowNode> flowNodeLowerthanPCLocSet = new HashSet<FlowNode>();
+ GlobalFlowGraph subGlobalFlowGraph = getSubGlobalFlowGraph(md);
+ // add ordering relations s.t. PCLOC is higher than all flow nodes except the set of
+ // parameters that do not have incoming flows
+ for (Iterator iterator = fg.getNodeSet().iterator(); iterator.hasNext();) {
+ FlowNode node = (FlowNode) iterator.next();
+
+ if (!(node instanceof FlowReturnNode)) {
+ if (!paramDescNOTHavingInFlowSet.contains(node.getCurrentDescTuple().get(0))) {
+ flowNodeLowerthanPCLocSet.add(node);
+ fg.addValueFlowEdge(pcDescTuple, node.getDescTuple());
+ subGlobalFlowGraph.addValueFlowEdge(pcLocTuple,
+ translateToLocTuple(md, node.getDescTuple()));
+ }
+ } else {
+ System.out.println("***SKIP PCLOC -> RETURNLOC=" + node);
+ }
- for (Iterator iterator = paramLocTupleHavingInFlowSet.iterator(); iterator.hasNext();) {
- NTuple<Location> paramLocTuple = (NTuple<Location>) iterator.next();
- if (paramLocTuple.size() > pcLocTupleIdx) {
- Descriptor lowerDesc = paramLocTuple.get(pcLocTupleIdx).getLocDescriptor();
- hierarchyGraph.addEdge(pcDesc, lowerDesc);
}
- }
+ fg.getFlowNode(translateToDescTuple(pcLocTuple)).setSkeleton(true);
+
+ if (pcLocTuple.get(0).getLocDescriptor().equals(md.getThis())) {
+ System.out.println("#########################################");
+ for (Iterator iterator = flowNodeLowerthanPCLocSet.iterator(); iterator.hasNext();) {
+ FlowNode lowerNode = (FlowNode) iterator.next();
+ if (lowerNode.getCompositeLocation() == null) {
+ NTuple<Location> lowerLocTuple = translateToLocTuple(md, lowerNode.getDescTuple());
+ CompositeLocation newComp =
+ calculateCompositeLocationFromSubGlobalGraph(md, lowerNode);
+ if (newComp != null) {
+ subGlobalFlowGraph.addMapLocationToInferCompositeLocation(lowerLocTuple.get(0),
+ newComp);
+ lowerNode.setCompositeLocation(newComp);
+ System.out.println("NEW COMP LOC=" + newComp + " to lowerNode=" + lowerNode);
+ }
+
+ }
+
+ }
+ }
- System.out.println("pcLoc=" + pcLoc);
+ }
- methodSummary.setPCLoc(new CompositeLocation(pcLocTuple));
}
}
private void calculateRETURNLOC(MethodDescriptor md) {
System.out.println("#calculateRETURNLOC= " + md);
+
// calculate a return location:
// the return location type is lower than all parameters and the location of return values
-
MethodSummary methodSummary = getMethodSummary(md);
+ // if (methodSummary.getRETURNLoc() != null) {
+ // System.out.println("$HERE?");
+ // return;
+ // }
FlowGraph fg = getFlowGraph(md);
-
Map<Integer, CompositeLocation> mapParamToLoc = methodSummary.getMapParamIdxToInferLoc();
Set<Integer> paramIdxSet = mapParamToLoc.keySet();
- if (!md.getReturnType().isVoid()) {
+ if (md.getReturnType() != null && !md.getReturnType().isVoid()) {
// first, generate the set of return value location types that starts
// with 'this' reference
- Set<NTuple<Location>> inferFieldReturnLocSet = new HashSet<NTuple<Location>>();
-
Set<FlowNode> paramFlowNodeFlowingToReturnValueSet = getParamNodeFlowingToReturnValue(md);
- System.out.println("paramFlowNodeFlowingToReturnValueSet="
- + paramFlowNodeFlowingToReturnValueSet);
+ // System.out.println("paramFlowNodeFlowingToReturnValueSet="
+ // + paramFlowNodeFlowingToReturnValueSet);
- Set<NTuple<Location>> locFlowingToReturnValueSet = new HashSet<NTuple<Location>>();
+ Set<NTuple<Location>> tupleToBeHigherThanReturnLocSet = new HashSet<NTuple<Location>>();
for (Iterator iterator = paramFlowNodeFlowingToReturnValueSet.iterator(); iterator.hasNext();) {
FlowNode fn = (FlowNode) iterator.next();
-
NTuple<Descriptor> paramDescTuple = fn.getCurrentDescTuple();
- NTuple<Location> paramLocTuple = translateToLocTuple(md, paramDescTuple);
-
- locFlowingToReturnValueSet.add(paramLocTuple);
+ tupleToBeHigherThanReturnLocSet.add(translateToLocTuple(md, paramDescTuple));
}
Set<FlowNode> returnNodeSet = fg.getReturnNodeSet();
for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
FlowNode returnNode = (FlowNode) iterator.next();
NTuple<Descriptor> returnDescTuple = returnNode.getCurrentDescTuple();
- NTuple<Location> returnLocTuple = translateToLocTuple(md, returnDescTuple);
- locFlowingToReturnValueSet.add(returnLocTuple);
+ tupleToBeHigherThanReturnLocSet.add(translateToLocTuple(md, returnDescTuple));
}
- System.out.println("locFlowingToReturnValueSet=" + locFlowingToReturnValueSet);
+ System.out.println("-flow graph's returnNodeSet=" + returnNodeSet);
+ System.out.println("tupleSetToBeHigherThanReturnLoc=" + tupleToBeHigherThanReturnLocSet);
// Here, generates a return location in the method lattice that is lower than the
// locFlowingToReturnValueSet
NTuple<Location> returnLocTuple =
- generateLocTupleRelativeTo(md, locFlowingToReturnValueSet, RLOC);
+ generateLocTupleRelativeTo(md, tupleToBeHigherThanReturnLocSet, RLOC);
- System.out.println("returnLocTuple=" + returnLocTuple);
+ // System.out.println("returnLocTuple=" + returnLocTuple);
+ NTuple<Descriptor> returnDescTuple = translateToDescTuple(returnLocTuple);
+ CompositeLocation curReturnLoc = methodSummary.getRETURNLoc();
+ if (curReturnLoc == null || returnDescTuple.size() > curReturnLoc.getSize()) {
+ methodSummary.setRETURNLoc(new CompositeLocation(returnLocTuple));
- int returnLocTupleIdx = returnLocTuple.size() - 1;
- Location returnLoc = returnLocTuple.get(returnLocTupleIdx);
- Descriptor returnDesc = returnLoc.getLocDescriptor();
- Descriptor enclosingDesc = returnLocTuple.get(returnLocTupleIdx).getDescriptor();
-
- HierarchyGraph hierarchyGraph = getHierarchyGraph(enclosingDesc);
- HNode returnNode = hierarchyGraph.getHNode(returnDesc);
- returnNode.setSkeleton(true);
+ for (Iterator iterator = tupleToBeHigherThanReturnLocSet.iterator(); iterator.hasNext();) {
+ NTuple<Location> higherTuple = (NTuple<Location>) iterator.next();
+ fg.addValueFlowEdge(translateToDescTuple(higherTuple), returnDescTuple);
+ }
+ fg.getFlowNode(returnDescTuple).setSkeleton(true);
- for (Iterator iterator = locFlowingToReturnValueSet.iterator(); iterator.hasNext();) {
- NTuple<Location> locTuple = (NTuple<Location>) iterator.next();
- Descriptor higherDesc = locTuple.get(returnLocTupleIdx).getLocDescriptor();
- hierarchyGraph.addEdge(higherDesc, returnDesc);
}
- methodSummary.setRETURNLoc(new CompositeLocation(returnLocTuple));
-
- // skip: for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
- // FlowNode returnNode = (FlowNode) iterator.next();
- //
- // NTuple<Descriptor> returnDescTuple = returnNode.getCurrentDescTuple();
- // NTuple<Location> returnLocTuple = translateToLocTuple(md, returnDescTuple);
- //
- // if (returnLocTuple.get(0).getLocDescriptor().equals(md.getThis())) {
- // // if the location type of the return value matches "this" reference
- // // then, check whether this return value is equal to/lower than all
- // // of parameters that possibly flow into the return values
- // for (Iterator iterator2 = inferParamLocSet.iterator(); iterator2.hasNext();) {
- // CompositeLocation paramInferLoc = (CompositeLocation) iterator2.next();
- //
- // if ((!paramInferLoc.equals(returnLocTuple))
- // && !isGreaterThan(methodLattice, paramInferLoc, inferReturnLoc)) {
- // continue skip;
- // }
- // }
- // inferFieldReturnLocSet.add(returnLocTuple);
- //
- // }
- // }
-
- // if (inferFieldReturnLocSet.size() > 0) {
- //
- // // CompositeLocation returnLoc = getLowest(methodLattice, inferFieldReturnLocSet);
- // CompositeLocation returnLoc = null;
- // if (returnLoc == null) {
- // // in this case, assign <'this',bottom> to the RETURNLOC
- // returnLoc = new CompositeLocation(new Location(md, md.getThis().getSymbol()));
- // returnLoc.addLocation(new Location(md.getClassDesc(), getLattice(md.getClassDesc())
- // .getBottomItem()));
- // }
- // methodInfo.setReturnLoc(returnLoc);
- //
- // } else {
- // String returnLocSymbol = "RETURNLOC";
- // CompositeLocation returnLocInferLoc =
- // new CompositeLocation(new Location(md, returnLocSymbol));
- // methodInfo.setReturnLoc(returnLocInferLoc);
- //
- // for (Iterator iterator = paramIdxSet.iterator(); iterator.hasNext();) {
- // Integer paramIdx = (Integer) iterator.next();
- // CompositeLocation inferLoc = mapParamToLoc.get(paramIdx);
- // String paramLocLocalSymbol = inferLoc.get(0).getLocIdentifier();
- // if (!methodLattice.isGreaterThan(paramLocLocalSymbol, returnLocSymbol)) {
- // // TODO
- // // addRelationHigherToLower(methodLattice, methodInfo,
- // // paramLocLocalSymbol,
- // // returnLocSymbol);
- // }
- // }
- //
- // for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
- // FlowNode returnNode = (FlowNode) iterator.next();
- // CompositeLocation inferLoc =
- // generateInferredCompositeLocation(methodInfo, fg.getLocationTuple(returnNode));
- // if (!isGreaterThan(methodLattice, inferLoc, returnLocInferLoc)) {
- // // TODO
- // // addRelation(methodLattice, methodInfo, inferLoc,
- // // returnLocInferLoc);
- // }
- // }
- //
- // }
+ // makes sure that PCLOC is higher than RETURNLOC
+ CompositeLocation pcLoc = methodSummary.getPCLoc();
+ if (!pcLoc.get(0).isTop()) {
+ NTuple<Descriptor> pcLocDescTuple = translateToDescTuple(pcLoc.getTuple());
+ fg.addValueFlowEdge(pcLocDescTuple, returnDescTuple);
+ }
}
+
}
private void calculateExtraLocations(MethodDescriptor md) {
private NTuple<Location> generateLocTupleRelativeTo(MethodDescriptor md,
Set<NTuple<Location>> paramLocTupleHavingInFlowSet, String locNamePrefix) {
- System.out.println("-generateLocTupleRelativeTo=" + paramLocTupleHavingInFlowSet);
+ // System.out.println("-generateLocTupleRelativeTo=" + paramLocTupleHavingInFlowSet);
NTuple<Location> higherLocTuple = new NTuple<Location>();
Set<NTuple<Location>> paramLocTupleStartedWithThis = new HashSet<NTuple<Location>>();
- for (Iterator iterator = paramLocTupleHavingInFlowSet.iterator(); iterator.hasNext();) {
+ next: for (Iterator iterator = paramLocTupleHavingInFlowSet.iterator(); iterator.hasNext();) {
NTuple<Location> paramLocTuple = (NTuple<Location>) iterator.next();
- if (!paramLocTuple.get(0).getLocDescriptor().equals(thisVarDesc)) {
+ Descriptor paramLocalDesc = paramLocTuple.get(0).getLocDescriptor();
+ if (!paramLocalDesc.equals(thisVarDesc)) {
+
+ Set<FlowNode> inNodeSet = getFlowGraph(md).getIncomingNodeSetByPrefix(paramLocalDesc);
+ for (Iterator iterator2 = inNodeSet.iterator(); iterator2.hasNext();) {
+ FlowNode flowNode = (FlowNode) iterator2.next();
+ if (flowNode.getDescTuple().startsWith(thisVarDesc)) {
+ // System.out.println("paramLocTuple=" + paramLocTuple + " is lower than THIS");
+ continue next;
+ }
+ }
hasParamNotStartedWithThisRef = true;
+
} else if (paramLocTuple.size() > 1) {
paramLocTupleStartedWithThis.add(paramLocTuple);
if (minSize == 0 || minSize > paramLocTuple.size()) {
}
}
- System.out.println("---paramLocTupleStartedWithThis=" + paramLocTupleStartedWithThis);
+ // System.out.println("---paramLocTupleStartedWithThis=" + paramLocTupleStartedWithThis);
Descriptor enclosingDesc = md;
if (hasParamNotStartedWithThisRef) {
// in this case, PCLOC will be the local location
} else {
// all parameter is started with 'this', so PCLOC will be set relative to the composite
// location started with 'this'.
- for (int idx = 0; idx < minSize - 1; idx++) {
+ // for (int idx = 0; idx < minSize - 1; idx++) {
+ for (int idx = 0; idx < 1; idx++) {
Set<Descriptor> locDescSet = new HashSet<Descriptor>();
Location curLoc = null;
NTuple<Location> paramLocTuple = null;
for (Iterator iterator = paramLocTupleStartedWithThis.iterator(); iterator.hasNext();) {
paramLocTuple = (NTuple<Location>) iterator.next();
- System.out.println("-----paramLocTuple=" + paramLocTuple + " idx=" + idx);
+ // System.out.println("-----paramLocTuple=" + paramLocTuple + " idx=" + idx);
curLoc = paramLocTuple.get(idx);
Descriptor locDesc = curLoc.getLocDescriptor();
locDescSet.add(locDesc);
}
- System.out.println("-----locDescSet=" + locDescSet + " idx=" + idx);
+ // System.out.println("-----locDescSet=" + locDescSet + " idx=" + idx);
if (locDescSet.size() != 1) {
break;
}
Location newLocElement = new Location(curLoc.getDescriptor(), curLoc.getLocDescriptor());
+ System.out.println("newLocElement" + newLocElement);
higherLocTuple.add(newLocElement);
enclosingDesc = getClassTypeDescriptor(curLoc.getLocDescriptor());
}
}
- String pcLocIdentifier = locNamePrefix + (locSeed++);
- NameDescriptor pcLocDesc = new NameDescriptor(pcLocIdentifier);
- Location newLoc = new Location(enclosingDesc, pcLocDesc);
+ String locIdentifier = locNamePrefix + (locSeed++);
+ NameDescriptor locDesc = new NameDescriptor(locIdentifier);
+ Location newLoc = new Location(enclosingDesc, locDesc);
higherLocTuple.add(newLoc);
-
System.out.println("---new loc tuple=" + higherLocTuple);
return higherLocTuple;
Set<NTuple<Location>> highestSet = new HashSet<NTuple<Location>>();
- Iterator<NTuple<Location>> iterator = paramLocTupleHavingInFlowSet.iterator();
- NTuple<Location> highest = iterator.next();
-
- for (; iterator.hasNext();) {
- NTuple<Location> curLocTuple = (NTuple<Location>) iterator.next();
- if (isHigherThan(curLocTuple, highest)) {
- System.out.println(curLocTuple + " is greater than " + highest);
- highest = curLocTuple;
- }
- }
-
- highestSet.add(highest);
-
- MethodDescriptor md = (MethodDescriptor) highest.get(0).getDescriptor();
- VarDescriptor thisVarDesc = md.getThis();
-
- System.out.println("highest=" + highest);
-
- for (Iterator<NTuple<Location>> iter = paramLocTupleHavingInFlowSet.iterator(); iter.hasNext();) {
- NTuple<Location> curLocTuple = iter.next();
-
- if (!curLocTuple.equals(highest) && !hasOrderingRelation(highest, curLocTuple)) {
-
- System.out.println("add it to the highest set=" + curLocTuple);
- highestSet.add(curLocTuple);
-
- }
- }
-
- return highestSet;
-
- }
-
- private void calculateExtraLocations2(MethodDescriptor md) {
- // calcualte pcloc, returnloc,...
-
- SSJavaLattice<String> methodLattice = getMethodLattice(md);
- MethodLocationInfo methodInfo = getMethodLocationInfo(md);
- FlowGraph fg = getFlowGraph(md);
- Set<FlowNode> nodeSet = fg.getNodeSet();
-
- for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
- FlowNode flowNode = (FlowNode) iterator.next();
- if (flowNode.isDeclaratonNode()) {
- CompositeLocation inferLoc = methodInfo.getInferLocation(flowNode.getDescTuple().get(0));
- String locIdentifier = inferLoc.get(0).getLocIdentifier();
- if (!methodLattice.containsKey(locIdentifier)) {
- methodLattice.put(locIdentifier);
- }
-
- }
- }
-
- Map<Integer, CompositeLocation> mapParamToLoc = methodInfo.getMapParamIdxToInferLoc();
- Set<Integer> paramIdxSet = mapParamToLoc.keySet();
-
- if (!ssjava.getMethodContainingSSJavaLoop().equals(md)) {
- // calculate the initial program counter location
- // PC location is higher than location types of all parameters
- String pcLocSymbol = "PCLOC";
-
- Set<CompositeLocation> paramInFlowSet = new HashSet<CompositeLocation>();
-
- for (Iterator iterator = paramIdxSet.iterator(); iterator.hasNext();) {
- Integer paramIdx = (Integer) iterator.next();
-
- FlowNode paramFlowNode = fg.getParamFlowNode(paramIdx);
-
- if (fg.getIncomingFlowNodeSet(paramFlowNode).size() > 0) {
- // parameter has in-value flows
- CompositeLocation inferLoc = mapParamToLoc.get(paramIdx);
- paramInFlowSet.add(inferLoc);
- }
- }
-
- if (paramInFlowSet.size() > 0) {
- CompositeLocation lowestLoc = getLowest(methodLattice, paramInFlowSet);
- assert (lowestLoc != null);
- methodInfo.setPCLoc(lowestLoc);
- }
-
- }
+ Iterator<NTuple<Location>> iterator = paramLocTupleHavingInFlowSet.iterator();
+ NTuple<Location> highest = iterator.next();
- // calculate a return location
- // the return location type is lower than all parameters and location
- // types
- // of return values
- if (!md.getReturnType().isVoid()) {
- // first, generate the set of return value location types that starts
- // with
- // 'this' reference
-
- Set<CompositeLocation> inferFieldReturnLocSet = new HashSet<CompositeLocation>();
-
- Set<FlowNode> paramFlowNode = getParamNodeFlowingToReturnValue(md);
- Set<CompositeLocation> inferParamLocSet = new HashSet<CompositeLocation>();
- if (paramFlowNode != null) {
- for (Iterator iterator = paramFlowNode.iterator(); iterator.hasNext();) {
- FlowNode fn = (FlowNode) iterator.next();
- CompositeLocation inferLoc =
- generateInferredCompositeLocation(methodInfo, getFlowGraph(md).getLocationTuple(fn));
- inferParamLocSet.add(inferLoc);
- }
+ for (; iterator.hasNext();) {
+ NTuple<Location> curLocTuple = (NTuple<Location>) iterator.next();
+ if (isHigherThan(curLocTuple, highest)) {
+ // System.out.println(curLocTuple + " is greater than " + highest);
+ highest = curLocTuple;
}
+ }
- Set<FlowNode> returnNodeSet = fg.getReturnNodeSet();
-
- skip: for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
- FlowNode returnNode = (FlowNode) iterator.next();
- CompositeLocation inferReturnLoc =
- generateInferredCompositeLocation(methodInfo, fg.getLocationTuple(returnNode));
- if (inferReturnLoc.get(0).getLocIdentifier().equals("this")) {
- // if the location type of the return value matches "this" reference
- // then, check whether this return value is equal to/lower than all
- // of
- // parameters that possibly flow into the return values
- for (Iterator iterator2 = inferParamLocSet.iterator(); iterator2.hasNext();) {
- CompositeLocation paramInferLoc = (CompositeLocation) iterator2.next();
-
- if ((!paramInferLoc.equals(inferReturnLoc))
- && !isGreaterThan(methodLattice, paramInferLoc, inferReturnLoc)) {
- continue skip;
- }
- }
- inferFieldReturnLocSet.add(inferReturnLoc);
+ highestSet.add(highest);
- }
- }
+ MethodDescriptor md = (MethodDescriptor) highest.get(0).getDescriptor();
+ VarDescriptor thisVarDesc = md.getThis();
- if (inferFieldReturnLocSet.size() > 0) {
+ // System.out.println("highest=" + highest);
- CompositeLocation returnLoc = getLowest(methodLattice, inferFieldReturnLocSet);
- if (returnLoc == null) {
- // in this case, assign <'this',bottom> to the RETURNLOC
- returnLoc = new CompositeLocation(new Location(md, md.getThis().getSymbol()));
- returnLoc.addLocation(new Location(md.getClassDesc(), getLattice(md.getClassDesc())
- .getBottomItem()));
- }
- methodInfo.setReturnLoc(returnLoc);
+ for (Iterator<NTuple<Location>> iter = paramLocTupleHavingInFlowSet.iterator(); iter.hasNext();) {
+ NTuple<Location> curLocTuple = iter.next();
- } else {
- String returnLocSymbol = "RETURNLOC";
- CompositeLocation returnLocInferLoc =
- new CompositeLocation(new Location(md, returnLocSymbol));
- methodInfo.setReturnLoc(returnLocInferLoc);
-
- for (Iterator iterator = paramIdxSet.iterator(); iterator.hasNext();) {
- Integer paramIdx = (Integer) iterator.next();
- CompositeLocation inferLoc = mapParamToLoc.get(paramIdx);
- String paramLocLocalSymbol = inferLoc.get(0).getLocIdentifier();
- if (!methodLattice.isGreaterThan(paramLocLocalSymbol, returnLocSymbol)) {
- // TODO
- // addRelationHigherToLower(methodLattice, methodInfo,
- // paramLocLocalSymbol,
- // returnLocSymbol);
- }
- }
+ if (!curLocTuple.equals(highest) && !hasOrderingRelation(highest, curLocTuple)) {
- for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
- FlowNode returnNode = (FlowNode) iterator.next();
- CompositeLocation inferLoc =
- generateInferredCompositeLocation(methodInfo, fg.getLocationTuple(returnNode));
- if (!isGreaterThan(methodLattice, inferLoc, returnLocInferLoc)) {
- // TODO
- // addRelation(methodLattice, methodInfo, inferLoc,
- // returnLocInferLoc);
- }
- }
+ // System.out.println("add it to the highest set=" + curLocTuple);
+ highestSet.add(curLocTuple);
}
-
}
+
+ return highestSet;
+
}
private Set<String> getHigherLocSymbolThan(SSJavaLattice<String> lattice, String loc) {
return false;
}
- private void contributeCalleeFlows(MethodInvokeNode min, MethodDescriptor mdCaller,
- MethodDescriptor mdCallee) {
-
- System.out.println("\n##contributeCalleeFlows callee=" + mdCallee + "TO caller=" + mdCaller);
-
- getSubGlobalFlowGraph(mdCallee);
-
- }
-
private GlobalFlowGraph getSubGlobalFlowGraph(MethodDescriptor md) {
+
+ if (!mapMethodDescriptorToSubGlobalFlowGraph.containsKey(md)) {
+ mapMethodDescriptorToSubGlobalFlowGraph.put(md, new GlobalFlowGraph(md));
+ }
return mapMethodDescriptorToSubGlobalFlowGraph.get(md);
}
private void propagateFlowsToCallerWithNoCompositeLocation(MethodInvokeNode min,
MethodDescriptor mdCaller, MethodDescriptor mdCallee) {
- System.out.println("\n##PROPAGATE callee=" + mdCallee + "TO caller=" + mdCaller);
-
+ System.out.println("-propagateFlowsToCallerWithNoCompositeLocation=" + min.printNode(0));
// if the parameter A reaches to the parameter B
// then, add an edge the argument A -> the argument B to the caller's flow
// graph
// check if the callee propagates an ordering constraints through
// parameters
- Set<FlowNode> localReachSet = calleeFlowGraph.getLocalReachFlowNodeSetFrom(paramNode1);
- System.out.println("-param1=" + paramNode1 + " is higher than param2=" + paramNode2);
- System.out.println("-- localReachSet from param1=" + localReachSet);
+ // Set<FlowNode> localReachSet = calleeFlowGraph.getLocalReachFlowNodeSetFrom(paramNode1);
+ Set<FlowNode> localReachSet =
+ calleeFlowGraph.getReachableSetFrom(paramNode1.getDescTuple());
+
+ NTuple<Descriptor> paramDescTuple1 = paramNode1.getCurrentDescTuple();
+ NTuple<Descriptor> paramDescTuple2 = paramNode2.getCurrentDescTuple();
+
+ // System.out.println("-param1CurTuple=" + paramDescTuple1 + " param2CurTuple="
+ // + paramDescTuple2);
+ // System.out.println("-- localReachSet from param1=" + localReachSet);
+
+ if (paramDescTuple1.get(0).equals(paramDescTuple2.get(0))) {
+ // if two parameters share the same prefix
+ // it already has been assigned to a composite location
+ // so we don't need to add an additional ordering relation caused by these two
+ // paramters.
+ continue;
+ }
- if (arg1Tuple.size() > 0 && arg2Tuple.size() > 0 && localReachSet.contains(paramNode2)) {
+ if (arg1Tuple.size() > 0 && arg2Tuple.size() > 0
+ && containsPrefix(paramNode2.getDescTuple().get(0), localReachSet)) {
// need to propagate an ordering relation s.t. arg1 is higher
// than arg2
+ // System.out.println("-param1=" + paramNode1 + " is higher than param2=" + paramNode2);
- System.out
- .println("-arg1Tuple=" + arg1Tuple + " is higher than arg2Tuple=" + arg2Tuple);
-
- // otherwise, flows between method/field locations...
+ // add a new flow between the corresponding arguments.
callerFlowGraph.addValueFlowEdge(arg1Tuple, arg2Tuple);
- System.out.println("arg1=" + arg1Tuple + " arg2=" + arg2Tuple);
+ // System.out.println("arg1=" + arg1Tuple + " arg2=" + arg2Tuple);
+
+ // System.out
+ // .println("-arg1Tuple=" + arg1Tuple + " is higher than arg2Tuple=" + arg2Tuple);
}
- System.out.println();
+ // System.out.println();
}
}
}
- System.out.println("##\n");
-
- }
-
- private void propagateFlowsToCaller(MethodInvokeNode min, MethodDescriptor mdCaller,
- MethodDescriptor mdCallee) {
-
- System.out.println("\n##PROPAGATE callee=" + mdCallee + "TO caller=" + mdCaller);
-
- // if the parameter A reaches to the parameter B
- // then, add an edge the argument A -> the argument B to the caller's flow
- // graph
-
- // TODO
- // also if a parameter is a composite location and is started with "this"
- // reference,
- // need to make sure that the corresponding argument is higher than the
- // translated location of
- // the parameter.
-
- FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
- FlowGraph callerFlowGraph = getFlowGraph(mdCaller);
- int numParam = calleeFlowGraph.getNumParameters();
-
- for (int i = 0; i < numParam; i++) {
- for (int k = 0; k < numParam; k++) {
-
- if (i != k) {
-
- FlowNode paramNode1 = calleeFlowGraph.getParamFlowNode(i);
- FlowNode paramNode2 = calleeFlowGraph.getParamFlowNode(k);
-
- System.out.println("param1=" + paramNode1 + " curDescTuple="
- + paramNode1.getCurrentDescTuple());
- System.out.println("param2=" + paramNode2 + " curDescTuple="
- + paramNode2.getCurrentDescTuple());
-
- // TODO: deprecated method
- // NodeTupleSet tupleSetArg1 = getNodeTupleSetByArgIdx(min, i);
- // NodeTupleSet tupleSetArg2 = getNodeTupleSetByArgIdx(min, k);
- NodeTupleSet tupleSetArg1 = null;
- NodeTupleSet tupleSetArg2 = null;
-
- for (Iterator<NTuple<Descriptor>> iter1 = tupleSetArg1.iterator(); iter1.hasNext();) {
- NTuple<Descriptor> arg1Tuple = iter1.next();
-
- for (Iterator<NTuple<Descriptor>> iter2 = tupleSetArg2.iterator(); iter2.hasNext();) {
- NTuple<Descriptor> arg2Tuple = iter2.next();
-
- // check if the callee propagates an ordering constraints through
- // parameters
-
- Set<FlowNode> localReachSet =
- calleeFlowGraph.getLocalReachFlowNodeSetFrom(paramNode1);
-
- if (localReachSet.contains(paramNode2)) {
- // need to propagate an ordering relation s.t. arg1 is higher
- // than arg2
-
- System.out
- .println("-param1=" + paramNode1 + " is higher than param2=" + paramNode2);
- System.out.println("-arg1Tuple=" + arg1Tuple + " is higher than arg2Tuple="
- + arg2Tuple);
-
- if (!min.getMethod().isStatic()) {
- // check if this is the case that values flow to/from the
- // current object reference 'this'
-
- NTuple<Descriptor> baseTuple = mapMethodInvokeNodeToBaseTuple.get(min);
- Descriptor baseRef = baseTuple.get(baseTuple.size() - 1);
-
- System.out.println("paramNode1.getCurrentDescTuple()="
- + paramNode1.getCurrentDescTuple());
- // calculate the prefix of the argument
-
- if (arg2Tuple.size() == 1 && arg2Tuple.get(0).equals(baseRef)) {
- // in this case, the callee flow causes a caller flow to the
- // object whose method
- // is invoked.
-
- if (!paramNode1.getCurrentDescTuple().startsWith(mdCallee.getThis())) {
- // check whether ???
-
- NTuple<Descriptor> param1Prefix =
- calculatePrefixForParam(callerFlowGraph, calleeFlowGraph, min, arg1Tuple,
- paramNode1);
-
- if (param1Prefix != null && param1Prefix.startsWith(mdCallee.getThis())) {
- // in this case, we need to create a new edge
- // 'this.FIELD'->'this'
- // but we couldn't... instead we assign a new composite
- // location started
- // with 'this' reference to the corresponding parameter
-
- CompositeLocation compLocForParam1 =
- generateCompositeLocation(mdCallee, param1Prefix);
-
- System.out
- .println("set comp loc=" + compLocForParam1 + " to " + paramNode1);
- paramNode1.setCompositeLocation(compLocForParam1);
-
- // then, we need to make sure that the corresponding
- // argument in the caller
- // is required to be higher than or equal to the
- // translated parameter
- // location
-
- NTuple<Descriptor> translatedParamTuple =
- translateCompositeLocationToCaller(min, compLocForParam1);
-
- // TODO : check if the arg >= the tranlated parameter
-
- System.out.println("add a flow edge= " + arg1Tuple + "->"
- + translatedParamTuple);
- callerFlowGraph.addValueFlowEdge(arg1Tuple, translatedParamTuple);
-
- continue;
-
- }
-
- } else {
- // param1 has already been assigned a composite location
-
- System.out.println("--param1 has already been assigned a composite location");
- CompositeLocation compLocForParam1 = paramNode1.getCompositeLocation();
- NTuple<Descriptor> translatedParamTuple =
- translateCompositeLocationToCaller(min, compLocForParam1);
- // TODO : check if the arg >= the tranlated parameter
+ // if a parameter has a composite location and the first element of the parameter location
+ // matches the callee's 'this'
+ // we have a more specific constraint: the caller's corresponding argument is higher than the
+ // parameter location which is translated into the caller
- System.out.println("add a flow edge= " + arg1Tuple + "->"
- + translatedParamTuple);
- callerFlowGraph.addValueFlowEdge(arg1Tuple, translatedParamTuple);
-
- continue;
-
- }
-
- } else if (arg1Tuple.size() == 1 && arg1Tuple.get(0).equals(baseRef)) {
- // in this case, the callee flow causes a caller flow
- // originated from the object
- // whose
- // method is invoked.
-
- System.out.println("###FROM CASE");
-
- if (!paramNode2.getCurrentDescTuple().startsWith(mdCallee.getThis())) {
-
- NTuple<Descriptor> param2Prefix =
- calculatePrefixForParam(callerFlowGraph, calleeFlowGraph, min, arg2Tuple,
- paramNode2);
-
- if (param2Prefix != null && param2Prefix.startsWith(mdCallee.getThis())) {
- // in this case, we need to create a new edge 'this' ->
- // 'this.FIELD' but we couldn't... instead we assign the
- // corresponding
- // parameter a new composite location started with
- // 'this' reference
-
- CompositeLocation compLocForParam2 =
- generateCompositeLocation(mdCallee, param2Prefix);
-
- // System.out.println("set comp loc=" + compLocForParam2
- // +
- // " to " + paramNode2);
- paramNode1.setCompositeLocation(compLocForParam2);
- continue;
- }
- }
-
- }
- }
+ for (int idx = 0; idx < numParam; idx++) {
+ FlowNode paramNode = calleeFlowGraph.getParamFlowNode(idx);
+ CompositeLocation compLoc = paramNode.getCompositeLocation();
+ System.out.println("paramNode=" + paramNode + " compLoc=" + compLoc);
+ if (compLoc != null && compLoc.get(0).getLocDescriptor().equals(min.getMethod().getThis())) {
+ System.out.println("$$$COMPLOC CASE=" + compLoc + " idx=" + idx);
+
+ NTuple<Descriptor> argTuple = getNodeTupleByArgIdx(min, idx);
+ System.out.println("--- argTuple=" + argTuple + " current compLoc="
+ + callerFlowGraph.getFlowNode(argTuple).getCompositeLocation());
+
+ NTuple<Descriptor> translatedParamTuple =
+ translateCompositeLocationToCaller(idx, min, compLoc);
+ System.out.println("add a flow edge= " + argTuple + "->" + translatedParamTuple);
+ callerFlowGraph.addValueFlowEdge(argTuple, translatedParamTuple);
+
+ Set<NTuple<Location>> pcLocTupleSet = getPCLocTupleSet(min);
+ for (Iterator iterator = pcLocTupleSet.iterator(); iterator.hasNext();) {
+ NTuple<Location> pcLocTuple = (NTuple<Location>) iterator.next();
+ callerFlowGraph.addValueFlowEdge(translateToDescTuple(pcLocTuple), translatedParamTuple);
+ }
- // otherwise, flows between method/field locations...
- callerFlowGraph.addValueFlowEdge(arg1Tuple, arg2Tuple);
- System.out.println("arg1=" + arg1Tuple + " arg2=" + arg2Tuple);
+ }
+ }
- }
+ }
- }
+ private boolean containsPrefix(Descriptor prefixDesc, Set<FlowNode> set) {
- }
- System.out.println();
- }
+ for (Iterator iterator = set.iterator(); iterator.hasNext();) {
+ FlowNode flowNode = (FlowNode) iterator.next();
+ if (flowNode.getDescTuple().startsWith(prefixDesc)) {
+ System.out.println("FOUND=" + flowNode);
+ return true;
}
}
- System.out.println("##\n");
+ return false;
}
- private NTuple<Descriptor> translateCompositeLocationToCaller(MethodInvokeNode min,
+ private NTuple<Descriptor> translateCompositeLocationToCaller(int idx, MethodInvokeNode min,
CompositeLocation compLocForParam1) {
+
NTuple<Descriptor> baseTuple = mapMethodInvokeNodeToBaseTuple.get(min);
NTuple<Descriptor> tuple = new NTuple<Descriptor>();
-
for (int i = 0; i < baseTuple.size(); i++) {
tuple.add(baseTuple.get(i));
}
return newCompLoc;
}
- private NTuple<Descriptor> calculatePrefixForParam(FlowGraph callerFlowGraph,
- FlowGraph calleeFlowGraph, MethodInvokeNode min, NTuple<Descriptor> arg1Tuple,
- FlowNode paramNode1) {
-
- NTuple<Descriptor> baseTuple = mapMethodInvokeNodeToBaseTuple.get(min);
- Descriptor baseRef = baseTuple.get(baseTuple.size() - 1);
- System.out.println("baseRef=" + baseRef);
-
- FlowNode flowNodeArg1 = callerFlowGraph.getFlowNode(arg1Tuple);
- List<NTuple<Descriptor>> callerPrefixList = calculatePrefixList(callerFlowGraph, flowNodeArg1);
- System.out.println("callerPrefixList=" + callerPrefixList);
-
- List<NTuple<Descriptor>> prefixList = calculatePrefixList(calleeFlowGraph, paramNode1);
- System.out.println("###prefixList from node=" + paramNode1 + " =" + prefixList);
-
- List<NTuple<Descriptor>> calleePrefixList =
- translatePrefixListToCallee(baseRef, min.getMethod(), callerPrefixList);
-
- System.out.println("calleePrefixList=" + calleePrefixList);
-
- Set<FlowNode> reachNodeSetFromParam1 = calleeFlowGraph.getReachFlowNodeSetFrom(paramNode1);
- System.out.println("reachNodeSetFromParam1=" + reachNodeSetFromParam1);
-
- for (int i = 0; i < calleePrefixList.size(); i++) {
- NTuple<Descriptor> curPrefix = calleePrefixList.get(i);
- Set<NTuple<Descriptor>> reachableCommonPrefixSet = new HashSet<NTuple<Descriptor>>();
-
- for (Iterator iterator2 = reachNodeSetFromParam1.iterator(); iterator2.hasNext();) {
- FlowNode reachNode = (FlowNode) iterator2.next();
- if (reachNode.getCurrentDescTuple().startsWith(curPrefix)) {
- reachableCommonPrefixSet.add(reachNode.getCurrentDescTuple());
- }
- }
-
- if (!reachableCommonPrefixSet.isEmpty()) {
- System.out.println("###REACHABLECOMONPREFIX=" + reachableCommonPrefixSet
- + " with curPreFix=" + curPrefix);
- return curPrefix;
- }
-
- }
-
- return null;
- }
-
private List<NTuple<Descriptor>> translatePrefixListToCallee(Descriptor baseRef,
MethodDescriptor mdCallee, List<NTuple<Descriptor>> callerPrefixList) {
}
- private List<NTuple<Descriptor>> calculatePrefixList(FlowGraph flowGraph, FlowNode flowNode) {
-
- System.out.println("\n##### calculatePrefixList=" + flowNode);
-
- Set<FlowNode> inNodeSet = flowGraph.getIncomingFlowNodeSet(flowNode);
- inNodeSet.add(flowNode);
-
- System.out.println("inNodeSet=" + inNodeSet);
-
- List<NTuple<Descriptor>> prefixList = new ArrayList<NTuple<Descriptor>>();
-
- for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
- FlowNode inNode = (FlowNode) iterator.next();
-
- NTuple<Descriptor> inNodeTuple = inNode.getCurrentDescTuple();
-
- // CompositeLocation inNodeInferredLoc =
- // generateInferredCompositeLocation(methodInfo, inNodeTuple);
- // NTuple<Location> inNodeInferredLocTuple = inNodeInferredLoc.getTuple();
-
- for (int i = 1; i < inNodeTuple.size(); i++) {
- NTuple<Descriptor> prefix = inNodeTuple.subList(0, i);
- if (!prefixList.contains(prefix)) {
- prefixList.add(prefix);
- }
- }
- }
-
- Collections.sort(prefixList, new Comparator<NTuple<Descriptor>>() {
- public int compare(NTuple<Descriptor> arg0, NTuple<Descriptor> arg1) {
- int s0 = arg0.size();
- int s1 = arg1.size();
- if (s0 > s1) {
- return -1;
- } else if (s0 == s1) {
- return 0;
- } else {
- return 1;
- }
- }
- });
-
- return prefixList;
-
- }
-
public CompositeLocation convertToCompositeLocation(MethodDescriptor md, NTuple<Descriptor> tuple) {
CompositeLocation compLoc = new CompositeLocation();
if (curDescriptor instanceof VarDescriptor) {
enclosingDescriptor = md.getClassDesc();
+ } else if (curDescriptor instanceof FieldDescriptor) {
+ enclosingDescriptor = ((FieldDescriptor) curDescriptor).getClassDescriptor();
} else if (curDescriptor instanceof NameDescriptor) {
// it is "GLOBAL LOC" case!
enclosingDescriptor = GLOBALDESC;
} else if (curDescriptor instanceof InterDescriptor) {
- enclosingDescriptor = null;
+ enclosingDescriptor = getFlowGraph(md).getEnclosingDescriptor(curDescriptor);
} else {
- enclosingDescriptor = ((FieldDescriptor) curDescriptor).getClassDescriptor();
+ enclosingDescriptor = null;
}
}
Descriptor srcFieldDesc = srcCurTuple.get(idx);
Descriptor dstFieldDesc = dstCurTuple.get(idx);
- // add a new edge
- getHierarchyGraph(cd).addEdge(srcFieldDesc, dstFieldDesc);
+ System.out.println("srcFieldDesc=" + srcFieldDesc + " dstFieldDesc=" + dstFieldDesc
+ + " idx=" + idx);
+ if (!srcFieldDesc.equals(dstFieldDesc)) {
+ // add a new edge
+ System.out.println("-ADD EDGE");
+ getHierarchyGraph(cd).addEdge(srcFieldDesc, dstFieldDesc);
+ } else if (!isReference(srcFieldDesc) && !isReference(dstFieldDesc)) {
+ System.out.println("-ADD EDGE");
+ getHierarchyGraph(cd).addEdge(srcFieldDesc, dstFieldDesc);
+ }
}
for (Iterator iterator = calleeSet.iterator(); iterator.hasNext();) {
MethodDescriptor calleemd = (MethodDescriptor) iterator.next();
if ((!ssjava.isTrustMethod(calleemd))
- && (!ssjava.isSSJavaUtil(calleemd.getClassDesc()))) {
+ && (!ssjava.isSSJavaUtil(calleemd.getClassDesc()))
+ && (!calleemd.getModifiers().isNative())) {
if (!visited.contains(calleemd)) {
temp_toanalyzeMethodList.add(calleemd);
}
System.out.println("");
toanalyze_methodDescList = computeMethodList();
+ // hack... it seems that there is a problem with topological sorting.
+ // so String.toString(Object o) is appeared too higher in the call chain.
+ MethodDescriptor mdToString = null;
+ for (Iterator iterator = toanalyze_methodDescList.iterator(); iterator.hasNext();) {
+ MethodDescriptor md = (MethodDescriptor) iterator.next();
+ if (md.toString().equals("public static String String.valueOf(Object o)")) {
+ mdToString = md;
+ break;
+ }
+ }
+ if (mdToString != null) {
+ toanalyze_methodDescList.remove(mdToString);
+ toanalyze_methodDescList.addLast(mdToString);
+ }
+
LinkedList<MethodDescriptor> methodDescList =
(LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
// subGlobalFlowGraph.writeGraph("_SUBGLOBAL");
//
// propagateFlowsFromCalleesWithNoCompositeLocation(md);
-
}
}
// _debug_printGraph();
- methodDescList = (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
+ }
+
+ private void constructGlobalFlowGraph() {
+ LinkedList<MethodDescriptor> methodDescList =
+ (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
while (!methodDescList.isEmpty()) {
MethodDescriptor md = methodDescList.removeLast();
if (state.SSJAVADEBUG) {
System.out.println();
- System.out.println("SSJAVA: Constructing a flow graph2: " + md);
+ System.out.println("SSJAVA: Constructing a sub global flow graph: " + md);
- System.out.println("##constructSubGlobalFlowGraph");
- GlobalFlowGraph subGlobalFlowGraph = constructSubGlobalFlowGraph(getFlowGraph(md));
- mapMethodDescriptorToSubGlobalFlowGraph.put(md, subGlobalFlowGraph);
+ constructSubGlobalFlowGraph(getFlowGraph(md));
// TODO
- System.out.println("##addValueFlowsFromCalleeSubGlobalFlowGraph");
- addValueFlowsFromCalleeSubGlobalFlowGraph(md, subGlobalFlowGraph);
- subGlobalFlowGraph.writeGraph("_SUBGLOBAL");
-
- propagateFlowsFromCalleesWithNoCompositeLocation(md);
-
- }
- }
-
- }
-
- private Set<MethodInvokeNode> getMethodInvokeNodeSet(MethodDescriptor md) {
- if (!mapMethodDescriptorToMethodInvokeNodeSet.containsKey(md)) {
- mapMethodDescriptorToMethodInvokeNodeSet.put(md, new HashSet<MethodInvokeNode>());
- }
- return mapMethodDescriptorToMethodInvokeNodeSet.get(md);
- }
-
- private void constructSubGlobalFlowGraph(MethodDescriptor md) {
-
- FlowGraph flowGraph = getFlowGraph(md);
-
- Set<MethodInvokeNode> setMethodInvokeNode = getMethodInvokeNodeSet(md);
-
- for (Iterator<MethodInvokeNode> iter = setMethodInvokeNode.iterator(); iter.hasNext();) {
- MethodInvokeNode min = iter.next();
- propagateFlowsFromMethodInvokeNode(md, min);
- }
-
- }
-
- private void propagateFlowsFromMethodInvokeNode(MethodDescriptor mdCaller, MethodInvokeNode min) {
- // the transformation for a call site propagates flows through parameters
- // if the method is virtual, it also grab all relations from any possible
- // callees
-
- MethodDescriptor mdCallee = min.getMethod();
- Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
- if (mdCallee.isStatic()) {
- setPossibleCallees.add(mdCallee);
- } else {
- Set<MethodDescriptor> calleeSet = ssjava.getCallGraph().getMethods(mdCallee);
- // removes method descriptors that are not invoked by the caller
- calleeSet.retainAll(mapMethodToCalleeSet.get(mdCaller));
- setPossibleCallees.addAll(calleeSet);
- }
-
- for (Iterator iterator2 = setPossibleCallees.iterator(); iterator2.hasNext();) {
- MethodDescriptor possibleMdCallee = (MethodDescriptor) iterator2.next();
- contributeCalleeFlows(min, mdCaller, possibleMdCallee);
- }
-
- }
-
- private void assignCompositeLocation(MethodDescriptor md) {
-
- FlowGraph flowGraph = getFlowGraph(md);
-
- Set<FlowNode> nodeSet = flowGraph.getNodeSet();
-
- next: for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
- FlowNode flowNode = (FlowNode) iterator.next();
-
- // assign a composite location only to the local variable
- if (flowNode.getCurrentDescTuple().size() == 1) {
-
- List<NTuple<Descriptor>> prefixList = calculatePrefixList(flowGraph, flowNode);
- Set<FlowNode> reachSet = flowGraph.getReachFlowNodeSetFrom(flowNode);
-
- for (int i = 0; i < prefixList.size(); i++) {
- NTuple<Descriptor> curPrefix = prefixList.get(i);
- Set<NTuple<Descriptor>> reachableCommonPrefixSet = new HashSet<NTuple<Descriptor>>();
-
- for (Iterator iterator2 = reachSet.iterator(); iterator2.hasNext();) {
- FlowNode reachNode = (FlowNode) iterator2.next();
- if (reachNode.getCurrentDescTuple().startsWith(curPrefix)) {
- reachableCommonPrefixSet.add(reachNode.getCurrentDescTuple());
- }
- }
-
- if (!reachableCommonPrefixSet.isEmpty()) {
- System.out.println("NEED TO ASSIGN COMP LOC TO " + flowNode + " with prefix="
- + curPrefix);
- CompositeLocation newCompLoc = generateCompositeLocation(md, curPrefix);
- flowNode.setCompositeLocation(newCompLoc);
- continue next;
- }
-
- }
- }
-
- }
-
- }
+ System.out.println("-add Value Flows From CalleeSubGlobalFlowGraph");
+ addValueFlowsFromCalleeSubGlobalFlowGraph(md);
+ // subGlobalFlowGraph.writeGraph("_SUBGLOBAL");
- private void propagateFlowsFromCalleesWithNoCompositeLocation(MethodDescriptor mdCaller) {
+ // System.out.println("-propagate Flows From Callees With No CompositeLocation");
+ // propagateFlowsFromCalleesWithNoCompositeLocation(md);
- // the transformation for a call site propagates flows through parameters
- // if the method is virtual, it also grab all relations from any possible
- // callees
+ // mark if a parameter has incoming flows
+ checkParamNodesInSubGlobalFlowGraph(md);
- Set<MethodInvokeNode> setMethodInvokeNode =
- mapMethodDescriptorToMethodInvokeNodeSet.get(mdCaller);
+ }
+ }
+ }
- if (setMethodInvokeNode != null) {
+ private void checkParamNodesInSubGlobalFlowGraph(MethodDescriptor md) {
+ GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
+ FlowGraph flowGraph = getFlowGraph(md);
- 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 {
- Set<MethodDescriptor> calleeSet = ssjava.getCallGraph().getMethods(mdCallee);
- // removes method descriptors that are not invoked by the caller
- calleeSet.retainAll(mapMethodToCalleeSet.get(mdCaller));
- setPossibleCallees.addAll(calleeSet);
- }
+ Set<FlowNode> paramFlowNodeSet = flowGraph.getParamFlowNodeSet();
+ for (Iterator iterator = paramFlowNodeSet.iterator(); iterator.hasNext();) {
+ FlowNode paramFlowNode = (FlowNode) iterator.next();
+ System.out.println("paramFlowNode=" + paramFlowNode);
+ NTuple<Descriptor> paramDescTuple = paramFlowNode.getDescTuple();
+ NTuple<Location> paramLocTuple = translateToLocTuple(md, paramDescTuple);
+ GlobalFlowNode paramGlobalNode = globalFlowGraph.getFlowNode(paramLocTuple);
- for (Iterator iterator2 = setPossibleCallees.iterator(); iterator2.hasNext();) {
- MethodDescriptor possibleMdCallee = (MethodDescriptor) iterator2.next();
- propagateFlowsToCallerWithNoCompositeLocation(min, mdCaller, possibleMdCallee);
- }
+ Set<GlobalFlowNode> incomingNodeSet =
+ globalFlowGraph.getIncomingNodeSetByPrefix(paramLocTuple.get(0));
+ if (incomingNodeSet.size() > 0) {
+ paramGlobalNode.setParamNodeWithIncomingFlows(true);
}
+
}
+ }
+ private Set<MethodInvokeNode> getMethodInvokeNodeSet(MethodDescriptor md) {
+ if (!mapMethodDescriptorToMethodInvokeNodeSet.containsKey(md)) {
+ mapMethodDescriptorToMethodInvokeNodeSet.put(md, new HashSet<MethodInvokeNode>());
+ }
+ return mapMethodDescriptorToMethodInvokeNodeSet.get(md);
}
- private void propagateFlowsFromCallees(MethodDescriptor mdCaller) {
+ private void propagateFlowsFromCalleesWithNoCompositeLocation(MethodDescriptor mdCaller) {
// the transformation for a call site propagates flows through parameters
// if the method is virtual, it also grab all relations from any possible
for (Iterator iterator2 = setPossibleCallees.iterator(); iterator2.hasNext();) {
MethodDescriptor possibleMdCallee = (MethodDescriptor) iterator2.next();
- propagateFlowsToCaller(min, mdCaller, possibleMdCallee);
+ propagateFlowsToCallerWithNoCompositeLocation(min, mdCaller, possibleMdCallee);
}
}
newImplicitTupleSet.addTupleSet(implicitFlowTupleSet);
newImplicitTupleSet.addTupleSet(condTupleNode);
- if (newImplicitTupleSet.size() > 1) {
+ if (needToGenerateInterLoc(newImplicitTupleSet)) {
// need to create an intermediate node for the GLB of conditional
// locations & implicit flows
+ System.out.println("10");
+
NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
for (Iterator<NTuple<Descriptor>> idxIter = newImplicitTupleSet.iterator(); idxIter.hasNext();) {
NTuple<Descriptor> tuple = idxIter.next();
private void analyzeFlowReturnNode(MethodDescriptor md, SymbolTable nametable, ReturnNode rn,
NodeTupleSet implicitFlowTupleSet) {
+ // System.out.println("-analyzeFlowReturnNode=" + rn.printNode(0));
ExpressionNode returnExp = rn.getReturnExpression();
if (returnExp != null) {
// add tuples corresponding to the current implicit flows
currentFlowTupleSet.addTupleSet(implicitFlowTupleSet);
- if (currentFlowTupleSet.size() > 1) {
+ // System.out.println("---currentFlowTupleSet=" + currentFlowTupleSet);
+
+ if (needToGenerateInterLoc(currentFlowTupleSet)) {
+ System.out.println("9");
+
FlowNode meetNode = fg.createIntermediateNode();
for (Iterator iterator = currentFlowTupleSet.iterator(); iterator.hasNext();) {
NTuple<Descriptor> currentFlowTuple = (NTuple<Descriptor>) iterator.next();
fg.addValueFlowEdge(currentFlowTuple, meetNode.getDescTuple());
}
fg.addReturnFlowNode(meetNode.getDescTuple());
- } else if (currentFlowTupleSet.size() == 1) {
- NTuple<Descriptor> tuple = currentFlowTupleSet.iterator().next();
- fg.addReturnFlowNode(tuple);
+ } else {
+ // currentFlowTupleSet = removeLiteralTuple(currentFlowTupleSet);
+ for (Iterator iterator = currentFlowTupleSet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> currentFlowTuple = (NTuple<Descriptor>) iterator.next();
+ fg.addReturnFlowNode(currentFlowTuple);
+ }
}
}
}
+ private NodeTupleSet removeLiteralTuple(NodeTupleSet inSet) {
+ NodeTupleSet tupleSet = new NodeTupleSet();
+ for (Iterator<NTuple<Descriptor>> iter = inSet.iterator(); iter.hasNext();) {
+ NTuple<Descriptor> tuple = iter.next();
+ if (!tuple.get(0).equals(LITERALDESC)) {
+ tupleSet.addTuple(tuple);
+ }
+ }
+ return tupleSet;
+ }
+
+ private boolean needToGenerateInterLoc(NodeTupleSet tupleSet) {
+ int size = 0;
+ for (Iterator<NTuple<Descriptor>> iter = tupleSet.iterator(); iter.hasNext();) {
+ NTuple<Descriptor> descTuple = iter.next();
+ if (!descTuple.get(0).equals(LITERALDESC)) {
+ size++;
+ }
+ }
+ if (size > 1) {
+ System.out.println("needToGenerateInterLoc=" + tupleSet + " size=" + size);
+ return true;
+ } else {
+ return false;
+ }
+ }
+
private void analyzeFlowLoopNode(MethodDescriptor md, SymbolTable nametable, LoopNode ln,
NodeTupleSet implicitFlowTupleSet) {
newImplicitTupleSet.addTupleSet(implicitFlowTupleSet);
newImplicitTupleSet.addTupleSet(condTupleNode);
- if (newImplicitTupleSet.size() > 1) {
+ System.out.println("A5");
+ newImplicitTupleSet.addGlobalFlowTupleSet(implicitFlowTupleSet.getGlobalLocTupleSet());
+ newImplicitTupleSet.addGlobalFlowTupleSet(condTupleNode.getGlobalLocTupleSet());
+
+ if (needToGenerateInterLoc(newImplicitTupleSet)) {
// need to create an intermediate node for the GLB of conditional
// locations & implicit flows
+ System.out.println("6");
+
NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
for (Iterator<NTuple<Descriptor>> idxIter = newImplicitTupleSet.iterator(); idxIter
.hasNext();) {
analyzeFlowExpressionNode(md, bn.getVarTable(), ln.getCondition(), condTupleNode, null,
implicitFlowTupleSet, false);
- // ///////////
- NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
+ NodeTupleSet newImplicitTupleSet = new NodeTupleSet();
+ newImplicitTupleSet.addTupleSet(implicitFlowTupleSet);
+ newImplicitTupleSet.addTupleSet(condTupleNode);
- for (Iterator<NTuple<Descriptor>> idxIter = condTupleNode.iterator(); idxIter.hasNext();) {
- NTuple<Descriptor> tuple = idxIter.next();
- addFlowGraphEdge(md, tuple, interTuple);
- }
+ if (needToGenerateInterLoc(newImplicitTupleSet)) {
+ // need to create an intermediate node for the GLB of conditional
+ // locations & implicit flows
+ System.out.println("7");
+
+ NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
+ for (Iterator<NTuple<Descriptor>> idxIter = newImplicitTupleSet.iterator(); idxIter
+ .hasNext();) {
+ NTuple<Descriptor> tuple = idxIter.next();
+ addFlowGraphEdge(md, tuple, interTuple);
+ }
+ newImplicitTupleSet.clear();
+ newImplicitTupleSet.addTuple(interTuple);
- for (Iterator<NTuple<Descriptor>> idxIter = implicitFlowTupleSet.iterator(); idxIter
- .hasNext();) {
- NTuple<Descriptor> tuple = idxIter.next();
- addFlowGraphEdge(md, tuple, interTuple);
}
- NodeTupleSet newImplicitSet = new NodeTupleSet();
- newImplicitSet.addTuple(interTuple);
- analyzeFlowBlockNode(md, bn.getVarTable(), ln.getUpdate(), newImplicitSet);
- analyzeFlowBlockNode(md, bn.getVarTable(), ln.getBody(), newImplicitSet);
+ // ///////////
+ // NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
+ //
+ // for (Iterator<NTuple<Descriptor>> idxIter = condTupleNode.iterator(); idxIter.hasNext();) {
+ // NTuple<Descriptor> tuple = idxIter.next();
+ // addFlowGraphEdge(md, tuple, interTuple);
+ // }
+ //
+ // for (Iterator<NTuple<Descriptor>> idxIter = implicitFlowTupleSet.iterator(); idxIter
+ // .hasNext();) {
+ // NTuple<Descriptor> tuple = idxIter.next();
+ // addFlowGraphEdge(md, tuple, interTuple);
+ // }
+ //
+ // NodeTupleSet newImplicitSet = new NodeTupleSet();
+ // newImplicitSet.addTuple(interTuple);
+ analyzeFlowBlockNode(md, bn.getVarTable(), ln.getUpdate(), newImplicitTupleSet);
+ analyzeFlowBlockNode(md, bn.getVarTable(), ln.getBody(), newImplicitTupleSet);
// ///////////
// condTupleNode.addTupleSet(implicitFlowTupleSet);
newImplicitTupleSet.addTupleSet(implicitFlowTupleSet);
newImplicitTupleSet.addTupleSet(condTupleNode);
- System.out.println("condTupleNode=" + condTupleNode);
- System.out.println("implicitFlowTupleSet=" + implicitFlowTupleSet);
- System.out.println("newImplicitTupleSet=" + newImplicitTupleSet);
+ // System.out.println("$$$GGGcondTupleNode=" + condTupleNode.getGlobalLocTupleSet());
+ // System.out.println("-condTupleNode=" + condTupleNode);
+ // System.out.println("-implicitFlowTupleSet=" + implicitFlowTupleSet);
+ // System.out.println("-newImplicitTupleSet=" + newImplicitTupleSet);
- if (newImplicitTupleSet.size() > 1) {
+ if (needToGenerateInterLoc(newImplicitTupleSet)) {
+ System.out.println("5");
// need to create an intermediate node for the GLB of conditional locations & implicit flows
NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
newImplicitTupleSet.addTuple(interTuple);
}
+ // GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
+ // for (Iterator<NTuple<Location>> iterator = condTupleNode.globalIterator();
+ // iterator.hasNext();) {
+ // NTuple<Location> calleeReturnLocTuple = iterator.next();
+ // for (Iterator<NTuple<Descriptor>> iter2 = newImplicitTupleSet.iterator(); iter2.hasNext();) {
+ // NTuple<Descriptor> callerImplicitTuple = iter2.next();
+ // globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple,
+ // translateToLocTuple(md, callerImplicitTuple));
+ // }
+ // }
+ System.out.println("A4");
+ newImplicitTupleSet.addGlobalFlowTupleSet(condTupleNode.getGlobalLocTupleSet());
+
analyzeFlowBlockNode(md, nametable, isn.getTrueBlock(), newImplicitTupleSet);
if (isn.getFalseBlock() != null) {
// creates edges from RHS to LHS
NTuple<Descriptor> interTuple = null;
- if (nodeSetRHS.size() > 1) {
+ if (needToGenerateInterLoc(nodeSetRHS)) {
+ System.out.println("3");
interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
}
for (Iterator<NTuple<Descriptor>> iter = nodeSetRHS.iterator(); iter.hasNext();) {
NTuple<Descriptor> fromTuple = iter.next();
+ System.out.println("fromTuple=" + fromTuple + " interTuple=" + interTuple + " tupleLSH="
+ + tupleLHS);
addFlowGraphEdge(md, fromTuple, interTuple, tupleLHS);
}
addFlowGraphEdge(md, implicitTuple, tupleLHS);
}
+ GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
+ for (Iterator<NTuple<Location>> iterator = nodeSetRHS.globalIterator(); iterator.hasNext();) {
+ NTuple<Location> calleeReturnLocTuple = iterator.next();
+ globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple, translateToLocTuple(md, tupleLHS));
+ }
+
}
}
ExpressionNode en, NodeTupleSet nodeSet, NTuple<Descriptor> base,
NodeTupleSet implicitFlowTupleSet, boolean isLHS) {
+ // System.out.println("en=" + en.printNode(0) + " class=" + en.getClass());
+
// note that expression node can create more than one flow node
// nodeSet contains of flow nodes
// base is always assigned to null except the case of a name node!
-
NTuple<Descriptor> flowTuple;
-
switch (en.kind()) {
-
case Kind.AssignmentNode:
analyzeFlowAssignmentNode(md, nametable, (AssignmentNode) en, nodeSet, base,
implicitFlowTupleSet);
break;
case Kind.LiteralNode:
- analyzeLiteralNode(md, nametable, (LiteralNode) en);
+ analyzeFlowLiteralNode(md, nametable, (LiteralNode) en, nodeSet);
break;
case Kind.MethodInvokeNode:
// return null;
}
+
return null;
}
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);
+ NodeTupleSet newImplicitTupleSet = new NodeTupleSet();
+ newImplicitTupleSet.addTupleSet(implicitFlowTupleSet);
+ newImplicitTupleSet.addTupleSet(tertiaryTupleNode);
+
+ // System.out.println("$$$GGGcondTupleNode=" + tertiaryTupleNode.getGlobalLocTupleSet());
+ // System.out.println("-tertiaryTupleNode=" + tertiaryTupleNode);
+ // System.out.println("-implicitFlowTupleSet=" + implicitFlowTupleSet);
+ // System.out.println("-newImplicitTupleSet=" + newImplicitTupleSet);
+
+ if (needToGenerateInterLoc(newImplicitTupleSet)) {
+ System.out.println("15");
+ // need to create an intermediate node for the GLB of conditional locations & implicit flows
+ NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
+ for (Iterator<NTuple<Descriptor>> idxIter = newImplicitTupleSet.iterator(); idxIter.hasNext();) {
+ NTuple<Descriptor> tuple = idxIter.next();
+ addFlowGraphEdge(md, tuple, interTuple);
+ }
+ newImplicitTupleSet.clear();
+ newImplicitTupleSet.addTuple(interTuple);
+ }
+
+ System.out.println("A7");
+ newImplicitTupleSet.addGlobalFlowTupleSet(tertiaryTupleNode.getGlobalLocTupleSet());
+
+ System.out.println("---------newImplicitTupleSet=" + newImplicitTupleSet);
// add edges from tertiaryTupleNode to all nodes of conditional nodes
- tertiaryTupleNode.addTupleSet(implicitFlowTupleSet);
+ // tertiaryTupleNode.addTupleSet(implicitFlowTupleSet);
analyzeFlowExpressionNode(md, nametable, tn.getTrueExpr(), tertiaryTupleNode, null,
- implicitFlowTupleSet, false);
+ newImplicitTupleSet, false);
analyzeFlowExpressionNode(md, nametable, tn.getFalseExpr(), tertiaryTupleNode, null,
- implicitFlowTupleSet, false);
+ newImplicitTupleSet, false);
+ System.out.println("A8");
+ nodeSet.addGlobalFlowTupleSet(tertiaryTupleNode.getGlobalLocTupleSet());
nodeSet.addTupleSet(tertiaryTupleNode);
+ System.out.println("#tertiary node set=" + nodeSet);
}
private void addMapCallerMethodDescToMethodInvokeNodeSet(MethodDescriptor caller,
return mapMethodDescToParamNodeFlowsToReturnValue.get(md);
}
- private void analyzeFlowMethodInvokeNode(MethodDescriptor md, SymbolTable nametable,
+ private Set<NTuple<Location>> getPCLocTupleSet(MethodInvokeNode min) {
+ if (!mapMethodInvokeNodeToPCLocTupleSet.containsKey(min)) {
+ mapMethodInvokeNodeToPCLocTupleSet.put(min, new HashSet<NTuple<Location>>());
+ }
+ return mapMethodInvokeNodeToPCLocTupleSet.get(min);
+ }
+
+ private void analyzeFlowMethodInvokeNode(MethodDescriptor mdCaller, SymbolTable nametable,
MethodInvokeNode min, NodeTupleSet nodeSet, NodeTupleSet implicitFlowTupleSet) {
System.out.println("analyzeFlowMethodInvokeNode=" + min.printNode(0));
+ if (!toanalyze_methodDescList.contains(min.getMethod())) {
+ return;
+ }
+
+ addMapMethodDescToMethodInvokeNodeSet(min);
+
+ Set<NTuple<Location>> pcLocTupleSet = getPCLocTupleSet(min);
+ for (Iterator iterator = implicitFlowTupleSet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> pcDescTuple = (NTuple<Descriptor>) iterator.next();
+ if (!pcDescTuple.get(0).equals(LITERALDESC)) {
+ // here we don't need to add the literal value as a PC location
+ pcLocTupleSet.add(translateToLocTuple(mdCaller, pcDescTuple));
+ }
+ }
+
mapMethodInvokeNodeToArgIdxMap.put(min, new HashMap<Integer, NTuple<Descriptor>>());
if (nodeSet == null) {
nodeSet = new NodeTupleSet();
}
- MethodDescriptor calleeMethodDesc = min.getMethod();
+ MethodDescriptor mdCallee = min.getMethod();
NameDescriptor baseName = min.getBaseName();
boolean isSystemout = false;
isSystemout = baseName.getSymbol().equals("System.out");
}
- if (!ssjava.isSSJavaUtil(calleeMethodDesc.getClassDesc())
- && !ssjava.isTrustMethod(calleeMethodDesc) && !isSystemout) {
+ if (!ssjava.isSSJavaUtil(mdCallee.getClassDesc()) && !ssjava.isTrustMethod(mdCallee)
+ && !isSystemout) {
- addMapCallerMethodDescToMethodInvokeNodeSet(md, min);
+ addMapCallerMethodDescToMethodInvokeNodeSet(mdCaller, min);
- FlowGraph calleeFlowGraph = getFlowGraph(calleeMethodDesc);
+ FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
+ System.out.println("mdCallee=" + mdCallee + " calleeFlowGraph=" + calleeFlowGraph);
Set<FlowNode> calleeReturnSet = calleeFlowGraph.getReturnNodeSet();
- System.out.println("-calleeReturnSet=" + calleeReturnSet);
+ System.out.println("---calleeReturnSet=" + calleeReturnSet);
+
+ NodeTupleSet tupleSet = new NodeTupleSet();
if (min.getExpression() != null) {
NodeTupleSet baseNodeSet = new NodeTupleSet();
- analyzeFlowExpressionNode(md, nametable, min.getExpression(), baseNodeSet, null,
+ analyzeFlowExpressionNode(mdCaller, nametable, min.getExpression(), baseNodeSet, null,
implicitFlowTupleSet, false);
+ System.out.println("baseNodeSet=" + baseNodeSet);
assert (baseNodeSet.size() == 1);
NTuple<Descriptor> baseTuple = baseNodeSet.iterator().next();
for (Iterator iterator = calleeReturnSet.iterator(); iterator.hasNext();) {
FlowNode returnNode = (FlowNode) iterator.next();
NTuple<Descriptor> returnDescTuple = returnNode.getDescTuple();
- if (returnDescTuple.startsWith(calleeMethodDesc.getThis())) {
+ if (returnDescTuple.startsWith(mdCallee.getThis())) {
// the location type of the return value is started with 'this'
// reference
NTuple<Descriptor> inFlowTuple = new NTuple<Descriptor>(baseTuple.getList());
+
+ if (inFlowTuple.get(0) instanceof InterDescriptor) {
+ // min.getExpression()
+ } else {
+
+ }
+
inFlowTuple.addAll(returnDescTuple.subList(1, returnDescTuple.size()));
- nodeSet.addTuple(inFlowTuple);
+ // nodeSet.addTuple(inFlowTuple);
+ System.out.println("1CREATE A NEW TUPLE=" + inFlowTuple + " from="
+ + mdCallee.getThis());
+ tupleSet.addTuple(inFlowTuple);
} else {
// TODO
+ System.out.println("returnNode=" + returnNode);
Set<FlowNode> inFlowSet = calleeFlowGraph.getIncomingFlowNodeSet(returnNode);
- System.out.println("inFlowSet=" + inFlowSet + " from retrunNode=" + returnNode);
+ // System.out.println("inFlowSet=" + inFlowSet + " from retrunNode=" + returnNode);
for (Iterator iterator2 = inFlowSet.iterator(); iterator2.hasNext();) {
FlowNode inFlowNode = (FlowNode) iterator2.next();
- if (inFlowNode.getDescTuple().startsWith(calleeMethodDesc.getThis())) {
- nodeSet.addTupleSet(baseNodeSet);
+ if (inFlowNode.getDescTuple().startsWith(mdCallee.getThis())) {
+ // nodeSet.addTupleSet(baseNodeSet);
+ System.out.println("2CREATE A NEW TUPLE=" + baseNodeSet + " from="
+ + mdCallee.getThis());
+ tupleSet.addTupleSet(baseNodeSet);
}
}
}
}
}
-
// analyze parameter flows
if (min.numArgs() > 0) {
ExpressionNode en = min.getArg(i);
int idx = i + offset;
NodeTupleSet argTupleSet = new NodeTupleSet();
- analyzeFlowExpressionNode(md, nametable, en, argTupleSet, false);
+ analyzeFlowExpressionNode(mdCaller, nametable, en, argTupleSet, false);
// if argument is liternal node, argTuple is set to NULL
-
- NTuple<Descriptor> argTuple = new NTuple<Descriptor>();
- System.out.println("-argTupleSet=" + argTupleSet + " from en=" + en.printNode(0));
- if (argTupleSet.size() > 1) {
- NTuple<Descriptor> interTuple =
- getFlowGraph(md).createIntermediateNode().getDescTuple();
- for (Iterator<NTuple<Descriptor>> idxIter = argTupleSet.iterator(); idxIter.hasNext();) {
- NTuple<Descriptor> tuple = idxIter.next();
- addFlowGraphEdge(md, tuple, interTuple);
- }
- argTuple = interTuple;
- } else if (argTupleSet.size() == 1) {
- argTuple = argTupleSet.iterator().next();
- } else {
+ System.out.println("---arg idx=" + idx + " argTupleSet=" + argTupleSet);
+ NTuple<Descriptor> argTuple = generateArgTuple(mdCaller, argTupleSet);
+
+ // if an argument is literal value,
+ // we need to create an itermediate node so that we could assign a composite location to
+ // that node if needed
+ if (argTuple.size() > 0
+ && (argTuple.get(0).equals(GLOBALDESC) || argTuple.get(0).equals(LITERALDESC))) {
+ /*
+ * System.out.println("***GLOBAL ARG TUPLE CASE=" + argTuple); System.out.println("8");
+ *
+ * NTuple<Descriptor> interTuple =
+ * getFlowGraph(mdCaller).createIntermediateNode().getDescTuple(); ((InterDescriptor)
+ * interTuple.get(0)).setMethodArgIdxPair(min, idx); addFlowGraphEdge(mdCaller,
+ * argTuple, interTuple); argTuple = interTuple; addArgIdxMap(min, idx, argTuple);
+ * System.out.println("new min mapping i=" + idx + " ->" + argTuple);
+ */
argTuple = new NTuple<Descriptor>();
}
addArgIdxMap(min, idx, argTuple);
FlowNode paramNode = calleeFlowGraph.getParamFlowNode(idx);
- System.out.println("-paramNode=" + paramNode + " hasInFlowTo="
- + hasInFlowTo(calleeFlowGraph, paramNode, calleeReturnSet));
+ // check whether a param node in the callee graph has incoming flows
+ // if it has incoming flows, the corresponding arg should be lower than the current PC
+ // Descriptor prefix = paramNode.getDescTuple().get(0);
+ // if (calleeFlowGraph.getIncomingNodeSetByPrefix(prefix).size() > 0) {
+ // for (Iterator<NTuple<Descriptor>> iterator = implicitFlowTupleSet.iterator(); iterator
+ // .hasNext();) {
+ // NTuple<Descriptor> pcTuple = iterator.next();
+ // System.out.println("add edge pcTuple =" + pcTuple + " -> " + argTuple);
+ // addFlowGraphEdge(md, pcTuple, argTuple);
+ // }
+ // }
+
+ System.out.println("paramNode=" + paramNode + " calleeReturnSet=" + calleeReturnSet);
if (hasInFlowTo(calleeFlowGraph, paramNode, calleeReturnSet)
- || calleeMethodDesc.getModifiers().isNative()) {
- addParamNodeFlowingToReturnValue(calleeMethodDesc, paramNode);
- nodeSet.addTupleSet(argTupleSet);
+ || mdCallee.getModifiers().isNative()) {
+ addParamNodeFlowingToReturnValue(mdCallee, paramNode);
+ // nodeSet.addTupleSet(argTupleSet);
+ System.out.println("3CREATE A NEW TUPLE=" + argTupleSet + " from=" + paramNode);
+ tupleSet.addTupleSet(argTupleSet);
+ }
+ }
+
+ }
+
+ if (mdCallee.getReturnType() != null && !mdCallee.getReturnType().isVoid()) {
+ FlowReturnNode setNode = getFlowGraph(mdCaller).createReturnNode(min);
+
+ if (needToGenerateInterLoc(tupleSet)) {
+ System.out.println("20");
+ FlowGraph fg = getFlowGraph(mdCaller);
+ FlowNode interNode = fg.createIntermediateNode();
+ interNode.setFormHolder(true);
+
+ NTuple<Descriptor> interTuple = interNode.getDescTuple();
+
+ for (Iterator iterator = tupleSet.iterator(); iterator.hasNext();) {
+ NTuple<Descriptor> tuple = (NTuple<Descriptor>) iterator.next();
+
+ Set<NTuple<Descriptor>> addSet = new HashSet<NTuple<Descriptor>>();
+ FlowNode node = fg.getFlowNode(tuple);
+ if (node instanceof FlowReturnNode) {
+ addSet.addAll(fg.getReturnTupleSet(((FlowReturnNode) node).getReturnTupleSet()));
+ } else {
+ addSet.add(tuple);
+ }
+ for (Iterator iterator2 = addSet.iterator(); iterator2.hasNext();) {
+ NTuple<Descriptor> higher = (NTuple<Descriptor>) iterator2.next();
+ addFlowGraphEdge(mdCaller, higher, interTuple);
+ }
}
+
+ setNode.addTuple(interTuple);
+ System.out.println("ADD TUPLESET=" + interTuple + " to returnnode=" + setNode);
+
+ } else {
+ setNode.addTupleSet(tupleSet);
+ System.out.println("ADD TUPLESET=" + tupleSet + " to returnnode=" + setNode);
+
}
+ // setNode.addTupleSet(tupleSet);
+ nodeSet.addTuple(setNode.getDescTuple());
}
// propagateFlowsFromCallee(min, md, min.getMethod());
+ // when generating the global flow graph,
+ // we need to add ordering relations from the set of callee return loc tuple to LHS of the
+ // caller assignment
+ for (Iterator iterator = calleeReturnSet.iterator(); iterator.hasNext();) {
+ FlowNode calleeReturnNode = (FlowNode) iterator.next();
+ NTuple<Location> calleeReturnLocTuple =
+ translateToLocTuple(mdCallee, calleeReturnNode.getDescTuple());
+ System.out.println("calleeReturnLocTuple=" + calleeReturnLocTuple);
+ NTuple<Location> transaltedToCaller =
+ translateToCallerLocTuple(min, mdCallee, mdCaller, calleeReturnLocTuple);
+ // System.out.println("translateToCallerLocTuple="
+ // + translateToCallerLocTuple(min, mdCallee, mdCaller, calleeReturnLocTuple));
+ if (transaltedToCaller.size() > 0) {
+ nodeSet.addGlobalFlowTuple(translateToCallerLocTuple(min, mdCallee, mdCaller,
+ calleeReturnLocTuple));
+ }
+ }
+
System.out.println("min nodeSet=" + nodeSet);
+
+ }
+
+ }
+
+ private NTuple<Descriptor> generateArgTuple(MethodDescriptor mdCaller, NodeTupleSet argTupleSet) {
+
+ int size = 0;
+
+ // if argTupleSet is empty, it comes from the top location
+ if (argTupleSet.size() == 0) {
+ NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
+ descTuple.add(LITERALDESC);
+ return descTuple;
+ }
+
+ Set<NTuple<Descriptor>> argTupleSetNonLiteral = new HashSet<NTuple<Descriptor>>();
+
+ for (Iterator<NTuple<Descriptor>> iter = argTupleSet.iterator(); iter.hasNext();) {
+ NTuple<Descriptor> descTuple = iter.next();
+ if (!descTuple.get(0).equals(LITERALDESC)) {
+ argTupleSetNonLiteral.add(descTuple);
+ }
+ }
+
+ if (argTupleSetNonLiteral.size() > 1) {
+ System.out.println("11");
+
+ NTuple<Descriptor> interTuple =
+ getFlowGraph(mdCaller).createIntermediateNode().getDescTuple();
+ for (Iterator<NTuple<Descriptor>> idxIter = argTupleSet.iterator(); idxIter.hasNext();) {
+ NTuple<Descriptor> tuple = idxIter.next();
+ addFlowGraphEdge(mdCaller, tuple, interTuple);
+ }
+ return interTuple;
+ } else if (argTupleSetNonLiteral.size() == 1) {
+ return argTupleSetNonLiteral.iterator().next();
+ } else {
+ return argTupleSet.iterator().next();
}
}
private boolean hasInFlowTo(FlowGraph fg, FlowNode inNode, Set<FlowNode> nodeSet) {
// return true if inNode has in-flows to nodeSet
+ if (nodeSet.contains(inNode)) {
+ // in this case, the method directly returns a parameter variable.
+ return true;
+ }
// Set<FlowNode> reachableSet = fg.getReachFlowNodeSetFrom(inNode);
Set<FlowNode> reachableSet = fg.getReachableSetFrom(inNode.getDescTuple());
System.out.println("inNode=" + inNode + " reachalbeSet=" + reachableSet);
mapIdxToTuple.put(new Integer(idx), argTuple);
}
- private void analyzeLiteralNode(MethodDescriptor md, SymbolTable nametable, LiteralNode en) {
-
+ private void analyzeFlowLiteralNode(MethodDescriptor md, SymbolTable nametable, LiteralNode en,
+ NodeTupleSet nodeSet) {
+ NTuple<Descriptor> tuple = new NTuple<Descriptor>();
+ tuple.add(LITERALDESC);
+ nodeSet.addTuple(tuple);
}
private void analyzeFlowArrayAccessNode(MethodDescriptor md, SymbolTable nametable,
ArrayAccessNode aan, NodeTupleSet nodeSet, boolean isLHS) {
+ System.out.println("analyzeFlowArrayAccessNode aan=" + aan.printNode(0));
+ String currentArrayAccessNodeExpStr = aan.printNode(0);
+ arrayAccessNodeStack.push(aan.printNode(0));
+
NodeTupleSet expNodeTupleSet = new NodeTupleSet();
NTuple<Descriptor> base =
analyzeFlowExpressionNode(md, nametable, aan.getExpression(), expNodeTupleSet, isLHS);
+ System.out.println("-base=" + base);
+ nodeSet.setMethodInvokeBaseDescTuple(base);
NodeTupleSet idxNodeTupleSet = new NodeTupleSet();
analyzeFlowExpressionNode(md, nametable, aan.getIndex(), idxNodeTupleSet, isLHS);
+ arrayAccessNodeStack.pop();
+
if (isLHS) {
// need to create an edge from idx to array
for (Iterator<NTuple<Descriptor>> idxIter = idxNodeTupleSet.iterator(); idxIter.hasNext();) {
}
}
+ GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
+ for (Iterator<NTuple<Location>> iterator = idxNodeTupleSet.globalIterator(); iterator
+ .hasNext();) {
+ NTuple<Location> calleeReturnLocTuple = iterator.next();
+ for (Iterator<NTuple<Descriptor>> arrIter = expNodeTupleSet.iterator(); arrIter.hasNext();) {
+ NTuple<Descriptor> arrTuple = arrIter.next();
+ globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple, translateToLocTuple(md, arrTuple));
+ }
+ }
+
nodeSet.addTupleSet(expNodeTupleSet);
} else {
- nodeSet.addTupleSet(expNodeTupleSet);
- nodeSet.addTupleSet(idxNodeTupleSet);
+
+ NodeTupleSet nodeSetArrayAccessExp = new NodeTupleSet();
+
+ nodeSetArrayAccessExp.addTupleSet(expNodeTupleSet);
+ nodeSetArrayAccessExp.addTupleSet(idxNodeTupleSet);
+
+ if (arrayAccessNodeStack.isEmpty()
+ || !arrayAccessNodeStack.peek().startsWith(currentArrayAccessNodeExpStr)) {
+
+ if (needToGenerateInterLoc(nodeSetArrayAccessExp)) {
+ System.out.println("1");
+ NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
+
+ for (Iterator<NTuple<Descriptor>> iter = nodeSetArrayAccessExp.iterator(); iter.hasNext();) {
+ NTuple<Descriptor> higherTuple = iter.next();
+ addFlowGraphEdge(md, higherTuple, interTuple);
+ }
+ nodeSetArrayAccessExp.clear();
+ nodeSetArrayAccessExp.addTuple(interTuple);
+ FlowGraph fg = getFlowGraph(md);
+
+ System.out.println("base=" + base);
+ if (base != null) {
+ fg.addMapInterLocNodeToEnclosingDescriptor(interTuple.get(0),
+ getClassTypeDescriptor(base.get(base.size() - 1)));
+ }
+ }
+ }
+
+ System.out.println("A1");
+ nodeSet.addGlobalFlowTupleSet(idxNodeTupleSet.getGlobalLocTupleSet());
+ nodeSet.addTupleSet(nodeSetArrayAccessExp);
+
}
+
}
private void analyzeCreateObjectNode(MethodDescriptor md, SymbolTable nametable,
NodeTupleSet leftOpSet = new NodeTupleSet();
NodeTupleSet rightOpSet = new NodeTupleSet();
+ System.out.println("analyzeFlowOpNode=" + on.printNode(0));
+
// left operand
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();
// there are two operands
nodeSet.addTupleSet(leftOpSet);
nodeSet.addTupleSet(rightOpSet);
+
+ System.out.println("A6");
+ nodeSet.addGlobalFlowTupleSet(leftOpSet.getGlobalLocTupleSet());
+ nodeSet.addGlobalFlowTupleSet(rightOpSet.getGlobalLocTupleSet());
+
break;
default:
private NTuple<Descriptor> analyzeFlowNameNode(MethodDescriptor md, SymbolTable nametable,
NameNode nn, NodeTupleSet nodeSet, NTuple<Descriptor> base, NodeTupleSet implicitFlowTupleSet) {
- // System.out.println("analyzeFlowNameNode=" + nn.printNode(0));
-
if (base == null) {
base = new NTuple<Descriptor>();
}
private NTuple<Descriptor> analyzeFlowFieldAccessNode(MethodDescriptor md, SymbolTable nametable,
FieldAccessNode fan, NodeTupleSet nodeSet, NTuple<Descriptor> base,
NodeTupleSet implicitFlowTupleSet, boolean isLHS) {
+ // System.out.println("analyzeFlowFieldAccessNode=" + fan.printNode(0));
+ String currentArrayAccessNodeExpStr = null;
ExpressionNode left = fan.getExpression();
TypeDescriptor ltd = left.getType();
FieldDescriptor fd = fan.getField();
+ ArrayAccessNode aan = null;
String varName = null;
if (left.kind() == Kind.NameNode) {
NodeTupleSet idxNodeTupleSet = new NodeTupleSet();
+ boolean isArrayCase = false;
if (left instanceof ArrayAccessNode) {
- ArrayAccessNode aan = (ArrayAccessNode) left;
+ isArrayCase = true;
+ aan = (ArrayAccessNode) left;
+
+ currentArrayAccessNodeExpStr = aan.printNode(0);
+ arrayAccessNodeStack.push(currentArrayAccessNodeExpStr);
+
left = aan.getExpression();
analyzeFlowExpressionNode(md, nametable, aan.getIndex(), idxNodeTupleSet, base,
implicitFlowTupleSet, isLHS);
- nodeSet.addTupleSet(idxNodeTupleSet);
}
base =
analyzeFlowExpressionNode(md, nametable, left, nodeSet, base, implicitFlowTupleSet, isLHS);
NTuple<Descriptor> flowFieldTuple = new NTuple<Descriptor>(base.toList());
if (!left.getType().isPrimitive()) {
-
if (!fd.getSymbol().equals("length")) {
// array.length access, just have the location of the array
flowFieldTuple.add(fd);
nodeSet.removeTuple(base);
}
-
}
getFlowGraph(md).createNewFlowNode(flowFieldTuple);
NTuple<Descriptor> idxTuple = idxIter.next();
getFlowGraph(md).addValueFlowEdge(idxTuple, flowFieldTuple);
}
+
+ GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
+ for (Iterator<NTuple<Location>> iterator = idxNodeTupleSet.globalIterator(); iterator
+ .hasNext();) {
+ NTuple<Location> calleeReturnLocTuple = iterator.next();
+ globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple,
+ translateToLocTuple(md, flowFieldTuple));
+ }
+
+ } else {
+ nodeSet.addTupleSet(idxNodeTupleSet);
+
+ // if it is the array case and not the LHS case
+ if (isArrayCase) {
+ arrayAccessNodeStack.pop();
+
+ if (arrayAccessNodeStack.isEmpty()
+ || !arrayAccessNodeStack.peek().startsWith(currentArrayAccessNodeExpStr)) {
+ NodeTupleSet nodeSetArrayAccessExp = new NodeTupleSet();
+
+ nodeSetArrayAccessExp.addTuple(flowFieldTuple);
+ nodeSetArrayAccessExp.addTupleSet(idxNodeTupleSet);
+ nodeSetArrayAccessExp.addTupleSet(nodeSet);
+
+ if (needToGenerateInterLoc(nodeSetArrayAccessExp)) {
+ System.out.println("4");
+ System.out.println("nodeSetArrayAccessExp=" + nodeSetArrayAccessExp);
+ // System.out.println("idxNodeTupleSet.getGlobalLocTupleSet()="
+ // + idxNodeTupleSet.getGlobalLocTupleSet());
+
+ NTuple<Descriptor> interTuple =
+ getFlowGraph(md).createIntermediateNode().getDescTuple();
+
+ for (Iterator<NTuple<Descriptor>> iter = nodeSetArrayAccessExp.iterator(); iter
+ .hasNext();) {
+ NTuple<Descriptor> higherTuple = iter.next();
+ addFlowGraphEdge(md, higherTuple, interTuple);
+ }
+
+ FlowGraph fg = getFlowGraph(md);
+ fg.addMapInterLocNodeToEnclosingDescriptor(interTuple.get(0),
+ getClassTypeDescriptor(base.get(base.size() - 1)));
+
+ nodeSet.clear();
+ flowFieldTuple = interTuple;
+ }
+ System.out.println("A3");
+ nodeSet.addGlobalFlowTupleSet(idxNodeTupleSet.getGlobalLocTupleSet());
+ }
+
+ }
+
}
return flowFieldTuple;
-
}
}
analyzeFlowExpressionNode(md, nametable, an.getSrc(), nodeSetRHS, null, implicitFlowTupleSet,
false);
- // System.out.println("-analyzeFlowAssignmentNode=" + an.printNode(0));
- // System.out.println("-nodeSetLHS=" + nodeSetLHS);
- // System.out.println("-nodeSetRHS=" + nodeSetRHS);
- // System.out.println("-implicitFlowTupleSet=" + implicitFlowTupleSet);
+ System.out.println("-analyzeFlowAssignmentNode=" + an.printNode(0));
+ System.out.println("-nodeSetLHS=" + nodeSetLHS);
+ System.out.println("-nodeSetRHS=" + nodeSetRHS);
+ System.out.println("-implicitFlowTupleSet=" + implicitFlowTupleSet);
// System.out.println("-");
if (an.getOperation().getOp() >= 2 && an.getOperation().getOp() <= 12) {
// creates edges from RHS to LHS
NTuple<Descriptor> interTuple = null;
- if (nodeSetRHS.size() > 1) {
+ if (needToGenerateInterLoc(nodeSetRHS)) {
+ System.out.println("2");
interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
}
}
}
+ // create global flow edges if the callee gives return value flows to the caller
+ GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
+ for (Iterator<NTuple<Location>> iterator = nodeSetRHS.globalIterator(); iterator.hasNext();) {
+ NTuple<Location> calleeReturnLocTuple = iterator.next();
+ for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
+ NTuple<Descriptor> callerLHSTuple = iter2.next();
+ System.out.println("$$$ GLOBAL FLOW ADD=" + calleeReturnLocTuple + " -> "
+ + translateToLocTuple(md, callerLHSTuple));
+ globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple,
+ translateToLocTuple(md, callerLHSTuple));
+ }
+ }
+
+ for (Iterator<NTuple<Location>> iterator = implicitFlowTupleSet.globalIterator(); iterator
+ .hasNext();) {
+ NTuple<Location> calleeReturnLocTuple = iterator.next();
+ for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
+ NTuple<Descriptor> callerLHSTuple = iter2.next();
+ globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple,
+ translateToLocTuple(md, callerLHSTuple));
+ System.out.println("$$$ GLOBAL FLOW PCLOC ADD=" + calleeReturnLocTuple + " -> "
+ + translateToLocTuple(md, callerLHSTuple));
+ }
+ }
+
} else {
// postinc case
}
}
+ GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
+ for (Iterator<NTuple<Location>> iterator = implicitFlowTupleSet.globalIterator(); iterator
+ .hasNext();) {
+ NTuple<Location> calleeReturnLocTuple = iterator.next();
+ for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
+ NTuple<Descriptor> callerLHSTuple = iter2.next();
+ globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple,
+ translateToLocTuple(md, callerLHSTuple));
+ System.out.println("$$$ GLOBAL FLOW PC ADD=" + calleeReturnLocTuple + " -> "
+ + translateToLocTuple(md, callerLHSTuple));
+ }
+ }
+
}
if (nodeSet != null) {
nodeSet.addTupleSet(nodeSetLHS);
+ System.out.println("A2");
+ nodeSet.addGlobalFlowTupleSet(nodeSetLHS.getGlobalLocTupleSet());
}
}
public void writeInferredLatticeDotFile(ClassDescriptor cd, HierarchyGraph simpleHierarchyGraph,
SSJavaLattice<String> locOrder, String nameSuffix) {
+ System.out.println("@cd=" + cd);
+ System.out.println("@sharedLoc=" + locOrder.getSharedLocSet());
writeInferredLatticeDotFile(cd, null, simpleHierarchyGraph, locOrder, nameSuffix);
}
String fileName = "lattice_";
if (md != null) {
fileName +=
- cd.getSymbol().replaceAll("[\\W_]", "") + "_" + md.toString().replaceAll("[\\W_]", "");
+ /* cd.getSymbol().replaceAll("[\\W_]", "") + "_" + */md.toString().replaceAll("[\\W_]", "");
} else {
fileName += cd.getSymbol().replaceAll("[\\W_]", "");
}
String highLocId = pair.getFirst();
String lowLocId = pair.getSecond();
-
if (!addedLocSet.contains(highLocId)) {
addedLocSet.add(highLocId);
drawNode(bw, locOrder, simpleHierarchyGraph, highLocId);
private void drawNode(BufferedWriter bw, SSJavaLattice<String> lattice, HierarchyGraph graph,
String locName) throws IOException {
- HNode node = graph.getHNode(locName);
-
- if (node == null) {
- return;
- }
-
String prettyStr;
if (lattice.isSharedLoc(locName)) {
prettyStr = locName + "*";
} else {
prettyStr = locName;
}
-
- if (node.isMergeNode()) {
- Set<HNode> mergeSet = graph.getMapHNodetoMergeSet().get(node);
- prettyStr += ":" + convertMergeSetToString(graph, mergeSet);
- }
+ // HNode node = graph.getHNode(locName);
+ // if (node != null && node.isMergeNode()) {
+ // Set<HNode> mergeSet = graph.getMapHNodetoMergeSet().get(node);
+ // prettyStr += ":" + convertMergeSetToString(graph, mergeSet);
+ // }
bw.write(locName + " [label=\"" + prettyStr + "\"]" + ";\n");
}
- public void _debug_printGraph() {
+ public void _debug_writeFlowGraph() {
Set<MethodDescriptor> keySet = mapMethodDescriptorToFlowGraph.keySet();
for (Iterator<MethodDescriptor> iterator = keySet.iterator(); iterator.hasNext();) {
MethodDescriptor md = (MethodDescriptor) iterator.next();
FlowGraph fg = mapMethodDescriptorToFlowGraph.get(md);
+ GlobalFlowGraph subGlobalFlowGraph = getSubGlobalFlowGraph(md);
try {
fg.writeGraph();
+ subGlobalFlowGraph.writeGraph("_SUBGLOBAL");
} catch (IOException e) {
e.printStackTrace();
}
class InterDescriptor extends Descriptor {
+ Pair<MethodInvokeNode, Integer> minArgIdxPair;
+
public InterDescriptor(String name) {
super(name);
}
+ public void setMethodArgIdxPair(MethodInvokeNode min, int idx) {
+ minArgIdxPair = new Pair<MethodInvokeNode, Integer>(min, new Integer(idx));
+ }
+
+ public Pair<MethodInvokeNode, Integer> getMethodArgIdxPair() {
+ return minArgIdxPair;
+ }
+
}
projects / IRC.git / blobdiff