State state;
SSJavaAnalysis ssjava;
- List<ClassDescriptor> toanalyzeList;
- List<MethodDescriptor> toanalyzeMethodList;
+ List<ClassDescriptor> temp_toanalyzeList;
+ List<MethodDescriptor> temp_toanalyzeMethodList;
Map<MethodDescriptor, FlowGraph> mapMethodDescriptorToFlowGraph;
+ LinkedList<MethodDescriptor> toanalyze_methodDescList;
+
// map a method descriptor to its set of parameter descriptors
Map<MethodDescriptor, Set<Descriptor>> mapMethodDescriptorToParamDescSet;
- // keep current descriptors to visit in fixed-point interprocedural analysis,
- private Stack<MethodDescriptor> methodDescriptorsToVisitStack;
+ // keep current descriptors to visit in fixed-point interprocedural analysis,
+ private Stack<MethodDescriptor> methodDescriptorsToVisitStack;
+
+ // map a class descriptor to a field lattice
+ private Map<ClassDescriptor, SSJavaLattice<String>> cd2lattice;
+
+ // map a method descriptor to a method lattice
+ private Map<MethodDescriptor, SSJavaLattice<String>> md2lattice;
+
+ // map a method/class descriptor to a hierarchy graph
+ private Map<Descriptor, HierarchyGraph> mapDescriptorToHierarchyGraph;
+
+ // map a method/class descriptor to a skeleton hierarchy graph
+ private Map<Descriptor, HierarchyGraph> mapDescriptorToSkeletonHierarchyGraph;
+
+ private Map<Descriptor, HierarchyGraph> mapDescriptorToSimpleHierarchyGraph;
+
+ // map a method/class descriptor to a skeleton hierarchy graph with combination nodes
+ private Map<Descriptor, HierarchyGraph> mapDescriptorToCombineSkeletonHierarchyGraph;
+
+ // map a descriptor to a simple lattice
+ private Map<Descriptor, SSJavaLattice<String>> mapDescriptorToSimpleLattice;
+
+ // map a method descriptor to the set of method invocation nodes which are
+ // invoked by the method descriptor
+ private Map<MethodDescriptor, Set<MethodInvokeNode>> mapMethodDescriptorToMethodInvokeNodeSet;
+
+ private Map<MethodInvokeNode, Map<Integer, NTuple<Descriptor>>> mapMethodInvokeNodeToArgIdxMap;
+
+ private Map<MethodInvokeNode, NTuple<Descriptor>> mapMethodInvokeNodeToBaseTuple;
+
+ private Map<MethodDescriptor, MethodLocationInfo> mapMethodDescToMethodLocationInfo;
+
+ private Map<ClassDescriptor, LocationInfo> mapClassToLocationInfo;
+
+ private Map<MethodDescriptor, Set<MethodDescriptor>> mapMethodToCalleeSet;
+
+ private Map<MethodDescriptor, Set<FlowNode>> mapMethodDescToParamNodeFlowsToReturnValue;
+
+ private Map<String, Vector<String>> mapFileNameToLineVector;
+
+ private Map<Descriptor, Integer> mapDescToDefinitionLine;
+
+ private Map<Descriptor, LocationSummary> mapDescToLocationSummary;
+
+ // 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";
+
+ public static final String TOPLOC = "TOPLOC";
+
+ public static final String INTERLOC = "INTERLOC";
+
+ public static final String PCLOC = "PCLOC";
+
+ public static final Descriptor GLOBALDESC = new NameDescriptor(GLOBALLOC);
+
+ public static final Descriptor TOPDESC = new NameDescriptor(TOPLOC);
+
+ public static String newline = System.getProperty("line.separator");
+
+ LocationInfo curMethodInfo;
+
+ boolean debug = true;
+
+ private static int locSeed = 0;
+
+ public LocationInference(SSJavaAnalysis ssjava, State state) {
+ this.ssjava = ssjava;
+ this.state = state;
+ this.temp_toanalyzeList = new ArrayList<ClassDescriptor>();
+ this.temp_toanalyzeMethodList = new ArrayList<MethodDescriptor>();
+ this.mapMethodDescriptorToFlowGraph = new HashMap<MethodDescriptor, FlowGraph>();
+ this.cd2lattice = new HashMap<ClassDescriptor, SSJavaLattice<String>>();
+ this.md2lattice = new HashMap<MethodDescriptor, SSJavaLattice<String>>();
+ this.methodDescriptorsToVisitStack = new Stack<MethodDescriptor>();
+ this.mapMethodDescriptorToMethodInvokeNodeSet =
+ new HashMap<MethodDescriptor, Set<MethodInvokeNode>>();
+ this.mapMethodInvokeNodeToArgIdxMap =
+ new HashMap<MethodInvokeNode, Map<Integer, NTuple<Descriptor>>>();
+ this.mapMethodDescToMethodLocationInfo = new HashMap<MethodDescriptor, MethodLocationInfo>();
+ this.mapMethodToCalleeSet = new HashMap<MethodDescriptor, Set<MethodDescriptor>>();
+ this.mapClassToLocationInfo = new HashMap<ClassDescriptor, LocationInfo>();
+
+ this.mapFileNameToLineVector = new HashMap<String, Vector<String>>();
+ this.mapDescToDefinitionLine = new HashMap<Descriptor, Integer>();
+ this.mapMethodDescToParamNodeFlowsToReturnValue =
+ new HashMap<MethodDescriptor, Set<FlowNode>>();
+
+ this.mapDescriptorToHierarchyGraph = new HashMap<Descriptor, HierarchyGraph>();
+ this.mapMethodInvokeNodeToBaseTuple = new HashMap<MethodInvokeNode, NTuple<Descriptor>>();
+
+ this.mapDescriptorToSkeletonHierarchyGraph = new HashMap<Descriptor, HierarchyGraph>();
+ this.mapDescriptorToCombineSkeletonHierarchyGraph = new HashMap<Descriptor, HierarchyGraph>();
+ this.mapDescriptorToSimpleHierarchyGraph = new HashMap<Descriptor, HierarchyGraph>();
+
+ this.mapDescriptorToSimpleLattice = new HashMap<Descriptor, SSJavaLattice<String>>();
+
+ this.mapDescToLocationSummary = new HashMap<Descriptor, LocationSummary>();
+
+ this.mapMethodDescriptorToSubGlobalFlowGraph = new HashMap<MethodDescriptor, GlobalFlowGraph>();
+
+ this.mapMethodInvokeNodeToMapCallerArgToCalleeArg =
+ new HashMap<MethodInvokeNode, Map<NTuple<Descriptor>, NTuple<Descriptor>>>();
+
+ }
+
+ public void setupToAnalyze() {
+ SymbolTable classtable = state.getClassSymbolTable();
+ temp_toanalyzeList.clear();
+ temp_toanalyzeList.addAll(classtable.getValueSet());
+ // Collections.sort(toanalyzeList, new Comparator<ClassDescriptor>() {
+ // public int compare(ClassDescriptor o1, ClassDescriptor o2) {
+ // return o1.getClassName().compareToIgnoreCase(o2.getClassName());
+ // }
+ // });
+ }
+
+ public void setupToAnalazeMethod(ClassDescriptor cd) {
+
+ SymbolTable methodtable = cd.getMethodTable();
+ temp_toanalyzeMethodList.clear();
+ temp_toanalyzeMethodList.addAll(methodtable.getValueSet());
+ Collections.sort(temp_toanalyzeMethodList, new Comparator<MethodDescriptor>() {
+ public int compare(MethodDescriptor o1, MethodDescriptor o2) {
+ return o1.getSymbol().compareToIgnoreCase(o2.getSymbol());
+ }
+ });
+ }
+
+ public boolean toAnalyzeMethodIsEmpty() {
+ return temp_toanalyzeMethodList.isEmpty();
+ }
+
+ public boolean toAnalyzeIsEmpty() {
+ return temp_toanalyzeList.isEmpty();
+ }
+
+ public ClassDescriptor toAnalyzeNext() {
+ return temp_toanalyzeList.remove(0);
+ }
+
+ public MethodDescriptor toAnalyzeMethodNext() {
+ return temp_toanalyzeMethodList.remove(0);
+ }
+
+ public void inference() {
+
+ // 1) construct value flow graph
+ constructFlowGraph();
+
+ assignCompositeLocation();
+
+ // constructGlobalFlowGraph();
+
+ constructHierarchyGraph();
+
+ debug_writeHierarchyDotFiles();
+
+ // calculate RETURNLOC,PCLOC
+ calculateExtraLocations();
+
+ simplifyHierarchyGraph();
+
+ debug_writeSimpleHierarchyDotFiles();
+
+ constructSkeletonHierarchyGraph();
+
+ debug_writeSkeletonHierarchyDotFiles();
+
+ insertCombinationNodes();
+
+ debug_writeSkeletonCombinationHierarchyDotFiles();
+
+ // System.exit(0);
+
+ buildLattice();
+
+ debug_writeLattices();
+
+ updateCompositeLocationAssignments();
+
+ generateMethodSummary();
+
+ System.exit(0);
+
+ // 2) construct lattices
+ // inferLattices();
+ // simplifyLattices();
+ // 3) check properties
+ // checkLattices();
+
+ // calculate RETURNLOC,PCLOC
+ calculateExtraLocations();
+
+ debug_writeLatticeDotFile();
+
+ // 4) generate annotated source codes
+ generateAnnoatedCode();
+
+ }
+
+ public Map<NTuple<Descriptor>, NTuple<Descriptor>> getMapCallerArgToCalleeParam(
+ MethodInvokeNode min) {
+
+ if (!mapMethodInvokeNodeToMapCallerArgToCalleeArg.containsKey(min)) {
+ mapMethodInvokeNodeToMapCallerArgToCalleeArg.put(min,
+ new HashMap<NTuple<Descriptor>, NTuple<Descriptor>>());
+ }
+
+ return mapMethodInvokeNodeToMapCallerArgToCalleeArg.get(min);
+ }
+
+ public void addMapCallerArgToCalleeParam(MethodInvokeNode min, NTuple<Descriptor> callerArg,
+ NTuple<Descriptor> calleeParam) {
+ getMapCallerArgToCalleeParam(min).put(callerArg, calleeParam);
+ }
+
+ private void assignCompositeLocation() {
+ calculateGlobalValueFlowCompositeLocation();
+ translateCompositeLocationAssignmentToFlowGraph();
+ }
+
+ private void translateCompositeLocationAssignmentToFlowGraph() {
+ MethodDescriptor methodEventLoopDesc = ssjava.getMethodContainingSSJavaLoop();
+ translateCompositeLocationAssignmentToFlowGraph(methodEventLoopDesc);
+ _debug_printGraph();
+ }
+
+ private void updateCompositeLocationAssignments() {
+
+ LinkedList<MethodDescriptor> methodDescList =
+ (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
+
+ while (!methodDescList.isEmpty()) {
+ MethodDescriptor md = methodDescList.removeLast();
+ GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
+ FlowGraph flowGraph = getFlowGraph(md);
+
+ Set<FlowNode> nodeSet = flowGraph.getNodeSet();
+ for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
+ FlowNode node = (FlowNode) iterator.next();
+ if (node.getCompositeLocation() != null) {
+ CompositeLocation compLoc = node.getCompositeLocation();
+ CompositeLocation updatedCompLoc = updateCompositeLocation(compLoc);
+ node.setCompositeLocation(updatedCompLoc);
+ } else {
+ NTuple<Descriptor> descTuple = node.getDescTuple();
+ CompositeLocation compLoc = convertToCompositeLocation(md, descTuple);
+ node.setCompositeLocation(compLoc);
+ }
+ }
+
+ }
+
+ }
+
+ private CompositeLocation updateCompositeLocation(CompositeLocation compLoc) {
+ CompositeLocation updatedCompLoc = new CompositeLocation();
+ for (int i = 0; i < compLoc.getSize(); i++) {
+ Location loc = compLoc.get(i);
+ String nodeIdentifier = loc.getLocIdentifier();
+ Descriptor enclosingDesc = loc.getDescriptor();
+ LocationSummary locSummary = getLocationSummary(enclosingDesc);
+ String locName = locSummary.getLocationName(nodeIdentifier);
+ Location updatedLoc = new Location(enclosingDesc, locName);
+ updatedCompLoc.addLocation(updatedLoc);
+ }
+
+ return updatedCompLoc;
+ }
+
+ private void translateCompositeLocationAssignmentToFlowGraph(MethodDescriptor mdCaller) {
+
+ System.out.println("\n#translateCompositeLocationAssignmentToFlowGraph=" + 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();
+ if (methodLoc.getDescriptor().equals(mdCaller)) {
+ CompositeLocation inferCompLoc = callerMapLocToCompLoc.get(methodLoc);
+ assignCompositeLocationToFlowGraph(callerFlowGraph, methodLoc, inferCompLoc);
+ }
+ }
+
+ Set<MethodInvokeNode> minSet = mapMethodDescriptorToMethodInvokeNodeSet.get(mdCaller);
+
+ Set<MethodDescriptor> calleeSet = new HashSet<MethodDescriptor>();
+ for (Iterator iterator = minSet.iterator(); iterator.hasNext();) {
+ MethodInvokeNode min = (MethodInvokeNode) iterator.next();
+ // need to translate a composite location that is started with the base
+ // tuple of 'min'.
+ if (mapMethodInvokeNodeToBaseTuple.get(min) != null) {
+ // if mapMethodInvokeNodeToBaseTuple doesn't have a mapping
+ // it means that the corresponding callee method does not cause any
+ // flows
+ translateMapLocationToInferCompositeLocationToCalleeGraph(callerGlobalFlowGraph, min);
+ }
+ calleeSet.add(min.getMethod());
+ }
+
+ for (Iterator iterator = calleeSet.iterator(); iterator.hasNext();) {
+ MethodDescriptor callee = (MethodDescriptor) iterator.next();
+ translateCompositeLocationAssignmentToFlowGraph(callee);
+ }
+
+ }
+
+ 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)) {
+ // need to assign the inferred composite location to this node
+ CompositeLocation newCompLoc = generateCompositeLocation(node.getDescTuple(), inferCompLoc);
+ node.setCompositeLocation(newCompLoc);
+ System.out.println("SET Node=" + node + " inferCompLoc=" + newCompLoc);
+ }
+ }
+ }
+
+ private CompositeLocation generateCompositeLocation(NTuple<Descriptor> nodeDescTuple,
+ CompositeLocation inferCompLoc) {
+
+ System.out.println("generateCompositeLocation=" + nodeDescTuple + " with inferCompLoc="
+ + inferCompLoc);
+
+ 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;
+ } else {
+ enclosingDescriptor = ((VarDescriptor) lastDescOfPrefix).getType().getClassDesc();
+ }
+
+ for (int i = 1; i < nodeDescTuple.size(); i++) {
+ Descriptor desc = nodeDescTuple.get(i);
+ Location locElement = new Location(enclosingDescriptor, desc);
+ newCompLoc.addLocation(locElement);
+
+ enclosingDescriptor = ((FieldDescriptor) desc).getClassDescriptor();
+ }
+
+ return newCompLoc;
+ }
+
+ private void translateMapLocationToInferCompositeLocationToCalleeGraph(
+ GlobalFlowGraph callerGraph, MethodInvokeNode min) {
+
+ MethodDescriptor mdCallee = min.getMethod();
+ MethodDescriptor mdCaller = callerGraph.getMethodDescriptor();
+ Map<Location, CompositeLocation> callerMapLocToCompLoc =
+ callerGraph.getMapLocationToInferCompositeLocation();
+
+ FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
+ GlobalFlowGraph calleeGlobalGraph = getSubGlobalFlowGraph(mdCallee);
+
+ NTuple<Location> baseLocTuple =
+ translateToLocTuple(mdCaller, mapMethodInvokeNodeToBaseTuple.get(min));
+
+ System.out.println("\n-translate caller infer composite loc to callee=" + mdCallee
+ + " baseLocTuple=" + baseLocTuple);
+ Set<Location> keySet = callerMapLocToCompLoc.keySet();
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ Location key = (Location) iterator.next();
+ CompositeLocation callerCompLoc = callerMapLocToCompLoc.get(key);
+
+ if (!key.getDescriptor().equals(mdCaller)) {
+ System.out.println("--- caller key=" + key + " callerCompLoc=" + callerCompLoc);
+
+ // && callerCompLoc.getTuple().startsWith(baseLocTuple)) {
+ // need to translate to the callee side
+
+ // TODO
+ CompositeLocation newCalleeCompLoc;
+ if (callerCompLoc.getTuple().startsWith(baseLocTuple)) {
+ 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);
+ } else {
+ // newCalleeCompLoc = callerCompLoc.clone();
+ }
+
+ }
+ }
+
+ // 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();
+
+ if (idx == 0 && !min.getMethod().isStatic()) {
+ continue;
+ }
+
+ NTuple<Descriptor> argTuple = mapIdxToArgTuple.get(idx);
+ if (argTuple.size() > 0) {
+ // check if an arg tuple has been already assigned to a composite location
+ NTuple<Location> argLocTuple = translateToLocTuple(mdCaller, argTuple);
+ Location argLocalLoc = argLocTuple.get(0);
+
+ // if (!isPrimitiveType(argTuple)) {
+ if (callerMapLocToCompLoc.containsKey(argLocalLoc)) {
+
+ CompositeLocation callerCompLoc = callerMapLocToCompLoc.get(argLocalLoc);
+ for (int i = 1; i < argLocTuple.size(); i++) {
+ callerCompLoc.addLocation(argLocTuple.get(i));
+ }
+
+ if (callerCompLoc.getTuple().startsWith(baseLocTuple)) {
+
+ FlowNode calleeParamFlowNode = calleeFlowGraph.getParamFlowNode(idx);
+ NTuple<Descriptor> calleeParamDescTuple = calleeParamFlowNode.getDescTuple();
+ NTuple<Location> calleeParamLocTuple =
+ translateToLocTuple(mdCallee, calleeParamDescTuple);
+
+ System.out.println("---need to translate callerCompLoc=" + callerCompLoc
+ + " with baseTuple=" + baseLocTuple + " calleeParamLocTuple="
+ + calleeParamLocTuple);
+
+ CompositeLocation newCalleeCompLoc =
+ translateCompositeLocationToCallee(callerCompLoc, baseLocTuple, mdCallee);
+
+ calleeGlobalGraph.addMapLocationToInferCompositeLocation(calleeParamLocTuple.get(0),
+ newCalleeCompLoc);
+
+ System.out.println("---callee loc=" + calleeParamLocTuple.get(0)
+ + " newCalleeCompLoc=" + newCalleeCompLoc);
+
+ // System.out.println("###need to assign composite location to=" + calleeParamDescTuple
+ // + " with baseTuple=" + baseLocTuple);
+ }
+
+ }
+ }
+
+ }
+
+ }
+
+ private boolean isPrimitiveType(NTuple<Descriptor> argTuple) {
+
+ Descriptor lastDesc = argTuple.get(argTuple.size() - 1);
+
+ if (lastDesc instanceof FieldDescriptor) {
+ return ((FieldDescriptor) lastDesc).getType().isPrimitive();
+ } else if (lastDesc instanceof VarDescriptor) {
+ return ((VarDescriptor) lastDesc).getType().isPrimitive();
+ }
+
+ return true;
+ }
+
+ private CompositeLocation translateCompositeLocationToCallee(CompositeLocation callerCompLoc,
+ NTuple<Location> baseLocTuple, MethodDescriptor mdCallee) {
+
+ CompositeLocation newCalleeCompLoc = new CompositeLocation();
+
+ Location calleeThisLoc = new Location(mdCallee, mdCallee.getThis());
+ newCalleeCompLoc.addLocation(calleeThisLoc);
+
+ // remove the base tuple from the caller
+ // ex; In the method invoation foo.bar.methodA(), the callee will have the composite location
+ // ,which is relative to the 'this' variable, <THIS,...>
+ for (int i = baseLocTuple.size(); i < callerCompLoc.getSize(); i++) {
+ newCalleeCompLoc.addLocation(callerCompLoc.get(i));
+ }
+
+ return newCalleeCompLoc;
+
+ }
+
+ private void constructGlobalFlowGraph() {
+
+ System.out.println("");
+ LinkedList<MethodDescriptor> methodDescList =
+ (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
+
+ System.out.println("@@@methodDescList=" + methodDescList);
+ // System.exit(0);
+
+ while (!methodDescList.isEmpty()) {
+ MethodDescriptor md = methodDescList.removeLast();
+ if (state.SSJAVADEBUG) {
+ System.out.println();
+ System.out.println("SSJAVA: Constructing a global flow graph: " + md);
+
+ FlowGraph flowGraph = getFlowGraph(md);
+ FlowGraph subGlobalFlowGraph = flowGraph.clone();
+
+ // mapMethodDescriptorToSubGlobalFlowGraph.put(md, subGlobalFlowGraph);
+
+ // addValueFlowsFromCalleeSubGlobalFlowGraph(md, subGlobalFlowGraph);
+
+ // try {
+ // subGlobalFlowGraph.writeGraph("_SUBGLOBAL");
+ // } catch (IOException e) {
+ // e.printStackTrace();
+ // }
+ // FlowGraph fg = new FlowGraph(md, mapParamDescToIdx);
+ // mapMethodDescriptorToFlowGraph.put(md, fg);
+ // analyzeMethodBody(md.getClassDesc(), md);
+ }
+
+ }
+
+ // DEBUG: write a global flow graph
+ MethodDescriptor mdContainingSSJavaLoop = ssjava.getMethodContainingSSJavaLoop();
+ // FlowGraph globalFlowGraph =
+ // getSubGlobalFlowGraph(mdContainingSSJavaLoop);
+ // System.out.println("GLOBAL NODE SET=" + globalFlowGraph.getNodeSet());
+ // assignCompositeLocation(globalFlowGraph);
+ // try {
+ // globalFlowGraph.writeGraph("_GLOBAL");
+ // } catch (IOException e) {
+ // e.printStackTrace();
+ // }
+ // _debug_printGraph();
+
+ }
+
+ private void calculateGlobalValueFlowCompositeLocation() {
+
+ System.out.println("SSJAVA: Calculate composite locations in the global value flow graph");
+ MethodDescriptor methodDescEventLoop = ssjava.getMethodContainingSSJavaLoop();
+ GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(methodDescEventLoop);
+
+ Set<Location> calculatedPrefixSet = new HashSet<Location>();
+
+ Set<GlobalFlowNode> nodeSet = globalFlowGraph.getNodeSet();
+
+ next: for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
+ GlobalFlowNode node = (GlobalFlowNode) iterator.next();
+
+ Location prefixLoc = node.getLocTuple().get(0);
+
+ if (calculatedPrefixSet.contains(prefixLoc)) {
+ // the prefix loc has been already assigned to a composite location
+ continue;
+ }
+
+ calculatedPrefixSet.add(prefixLoc);
+
+ // Set<GlobalFlowNode> incomingNodeSet = globalFlowGraph.getIncomingNodeSet(node);
+ List<NTuple<Location>> prefixList = calculatePrefixList(globalFlowGraph, node);
+
+ Set<GlobalFlowNode> reachableNodeSet =
+ globalFlowGraph.getReachableNodeSetByPrefix(node.getLocTuple().get(0));
+ // Set<GlobalFlowNode> reachNodeSet = globalFlowGraph.getReachableNodeSetFrom(node);
+
+ // System.out.println("node=" + node + " prefixList=" + prefixList + " reachableNodeSet="
+ // + reachableNodeSet);
+
+ 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());
+ }
+ }
+
+ if (!reachableCommonPrefixSet.isEmpty()) {
+
+ MethodDescriptor curPrefixFirstElementMethodDesc =
+ (MethodDescriptor) curPrefix.get(0).getDescriptor();
+
+ MethodDescriptor nodePrefixLocFirstElementMethodDesc =
+ (MethodDescriptor) prefixLoc.getDescriptor();
+
+ if (curPrefixFirstElementMethodDesc.equals(nodePrefixLocFirstElementMethodDesc)
+ || isTransitivelyCalledFrom(nodePrefixLocFirstElementMethodDesc,
+ curPrefixFirstElementMethodDesc)) {
+
+ // TODO
+ // if (!node.getLocTuple().startsWith(curPrefix.get(0))) {
+
+ Location curPrefixLocalLoc = curPrefix.get(0);
+ if (globalFlowGraph.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);
+
+ continue next;
+ }
+
+ Location targetLocalLoc = node.getLocTuple().get(0);
+ // CompositeLocation curCompLoc = globalFlowGraph.getCompositeLocation(targetLocalLoc);
+ // if ((curPrefix.size() + 1) > curCompLoc.getSize()) {
+
+ CompositeLocation newCompLoc = generateCompositeLocation(curPrefix);
+ System.out.println("NEED TO ASSIGN COMP LOC TO " + node + " with prefix=" + curPrefix);
+ System.out.println("- newCompLoc=" + newCompLoc);
+ globalFlowGraph.addMapLocationToInferCompositeLocation(targetLocalLoc, newCompLoc);
+ // }
+
+ continue next;
+ // }
+
+ }
+
+ }
+
+ }
+
+ }
+ // Set<GlobalFlowNode> inNodeSet =
+ // graph.getIncomingNodeSetWithPrefix(prefix);
+ // System.out.println("inNodeSet=" + inNodeSet + " from=" + node);
+ }
+
+ private void assignCompositeLocation(CompositeLocation compLocPrefix, GlobalFlowNode node) {
+ CompositeLocation newCompLoc = compLocPrefix.clone();
+ NTuple<Location> locTuple = node.getLocTuple();
+ for (int i = 1; i < locTuple.size(); i++) {
+ newCompLoc.addLocation(locTuple.get(i));
+ }
+ node.setInferCompositeLocation(newCompLoc);
+ }
+
+ private List<NTuple<Location>> calculatePrefixList(GlobalFlowGraph graph, 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);
+
+ List<NTuple<Location>> prefixList = new ArrayList<NTuple<Location>>();
+
+ for (Iterator iterator = incomingNodeSetPrefix.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);
+ }
+ }
+ }
+
+ 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;
+
+ // 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);
+ // }
+ // }
+ // }
+ //
+ // 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 GlobalFlowGraph constructSubGlobalFlowGraph(FlowGraph flowGraph) {
+
+ MethodDescriptor md = flowGraph.getMethodDescriptor();
+
+ GlobalFlowGraph globalGraph = new GlobalFlowGraph(md);
+
+ // Set<FlowNode> nodeSet = flowGraph.getNodeSet();
+ Set<FlowEdge> edgeSet = flowGraph.getEdgeSet();
+
+ for (Iterator iterator = edgeSet.iterator(); iterator.hasNext();) {
+
+ FlowEdge edge = (FlowEdge) iterator.next();
+ NTuple<Descriptor> srcDescTuple = edge.getInitTuple();
+ NTuple<Descriptor> dstDescTuple = edge.getEndTuple();
+
+ // here only keep the first element(method location) of the descriptor
+ // tuple
+ NTuple<Location> srcLocTuple = translateToLocTuple(md, srcDescTuple);
+ // Location srcMethodLoc = srcLocTuple.get(0);
+ // Descriptor srcVarDesc = srcMethodLoc.getLocDescriptor();
+ // // if (flowGraph.isParamDesc(srcVarDesc) &&
+ // (!srcVarDesc.equals(md.getThis()))) {
+ // if (!srcVarDesc.equals(md.getThis())) {
+ // srcLocTuple = new NTuple<Location>();
+ // Location loc = new Location(md, srcVarDesc);
+ // srcLocTuple.add(loc);
+ // }
+ //
+ NTuple<Location> dstLocTuple = translateToLocTuple(md, dstDescTuple);
+ // Location dstMethodLoc = dstLocTuple.get(0);
+ // Descriptor dstVarDesc = dstMethodLoc.getLocDescriptor();
+ // if (!dstVarDesc.equals(md.getThis())) {
+ // dstLocTuple = new NTuple<Location>();
+ // Location loc = new Location(md, dstVarDesc);
+ // dstLocTuple.add(loc);
+ // }
+
+ globalGraph.addValueFlowEdge(srcLocTuple, dstLocTuple);
+
+ }
+
+ return globalGraph;
+ }
+
+ private NTuple<Location> translateToLocTuple(MethodDescriptor md, NTuple<Descriptor> descTuple) {
+
+ 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);
+
+ Location loc = new Location(enclosingDesc, desc);
+ locTuple.add(loc);
+
+ if (desc instanceof VarDescriptor) {
+ enclosingDesc = ((VarDescriptor) desc).getType().getClassDesc();
+ } else if (desc instanceof FieldDescriptor) {
+ enclosingDesc = ((FieldDescriptor) desc).getType().getClassDesc();
+ } else {
+ // TODO: inter descriptor case
+ enclosingDesc = desc;
+ }
+
+ }
+
+ return locTuple;
+
+ }
+
+ private void addValueFlowsFromCalleeSubGlobalFlowGraph(MethodDescriptor mdCaller,
+ GlobalFlowGraph subGlobalFlowGraph) {
+
+ // the transformation for a call site propagates flows through parameters
+ // if the method is virtual, it also grab all relations from any possible
+ // callees
+
+ Set<MethodInvokeNode> setMethodInvokeNode = getMethodInvokeNodeSet(mdCaller);
+
+ 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);
+ }
+
+ for (Iterator iterator2 = setPossibleCallees.iterator(); iterator2.hasNext();) {
+ MethodDescriptor possibleMdCallee = (MethodDescriptor) iterator2.next();
+ propagateValueFlowsToCallerFromSubGlobalFlowGraph(min, mdCaller, possibleMdCallee);
+ }
+
+ }
+
+ }
+
+ private void propagateValueFlowsToCallerFromSubGlobalFlowGraph(MethodInvokeNode min,
+ MethodDescriptor mdCaller, MethodDescriptor possibleMdCallee) {
+
+ System.out.println("propagateValueFlowsToCallerFromSubGlobalFlowGraph=" + min.printNode(0)
+ + " by caller=" + mdCaller);
+ FlowGraph calleeFlowGraph = getFlowGraph(possibleMdCallee);
+ Map<Integer, NTuple<Descriptor>> mapIdxToArg = 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<Descriptor> argDescTuple = mapIdxToArg.get(idx);
+ if (argDescTuple.size() > 0) {
+ NTuple<Location> argLocTuple = translateToLocTuple(mdCaller, argDescTuple);
+ NTuple<Descriptor> paramDescTuple = calleeFlowGraph.getParamFlowNode(idx).getDescTuple();
+ NTuple<Location> paramLocTuple = translateToLocTuple(possibleMdCallee, paramDescTuple);
+ addMapCallerArgToCalleeParam(min, argDescTuple, paramDescTuple);
+ }
+
+ }
+
+ 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);
+ // // }
+
+ }
+
+ private void addValueFlowFromCalleeNode(MethodInvokeNode min, MethodDescriptor mdCaller,
+ MethodDescriptor mdCallee, GlobalFlowNode calleeSrcNode) {
+
+ GlobalFlowGraph calleeSubGlobalGraph = getSubGlobalFlowGraph(mdCallee);
+ GlobalFlowGraph callerSubGlobalGraph = getSubGlobalFlowGraph(mdCaller);
+
+ NTuple<Location> callerSrcNodeLocTuple =
+ translateToCallerLocTuple(min, mdCallee, mdCaller, calleeSrcNode.getLocTuple());
+
+ 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());
+ if (callerDstNodeLocTuple != null) {
+ callerSubGlobalGraph.addValueFlowEdge(callerSrcNodeLocTuple, callerDstNodeLocTuple);
+ }
+ }
+ }
+
+ }
+
+ private NTuple<Location> translateToCallerLocTuple(MethodInvokeNode min,
+ MethodDescriptor mdCallee, MethodDescriptor mdCaller, NTuple<Location> nodeLocTuple) {
+ // this method will return NULL if the corresponding argument is literal
+ // value.
+ // assumes that we don't need to propagate callee flows to the argument
+ // which is literal.
+
+ System.out.println("---translateToCallerLocTuple=" + min.printNode(0)
+ + " callee nodeLocTuple=" + 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);
+ // System.out.println(" mapMethodInvokeNodeToArgIdxMap.get(min)="
+ // + mapMethodInvokeNodeToArgIdxMap.get(min));
+
+ if (argDescTuple.size() == 0) {
+ // argument is literal
+ return null;
+ }
+ NTuple<Location> argLocTuple = translateToLocTuple(mdCaller, argDescTuple);
+
+ NTuple<Location> callerLocTuple = new NTuple<Location>();
+
+ callerLocTuple.addAll(argLocTuple);
+ for (int i = 1; i < nodeLocTuple.size(); i++) {
+ callerLocTuple.add(nodeLocTuple.get(i));
+ }
+ return callerLocTuple;
+ } else {
+ return nodeLocTuple.clone();
+ }
+
+ }
+
+ 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>();
+
+ callerLocTuple.addAll(argLocTuple);
+ for (int i = 1; i < curNodeLocTuple.size(); i++) {
+ callerLocTuple.add(curNodeLocTuple.get(i));
+ }
+
+ return callerLocTuple;
+ }
+
+ private void recurAddValueFlowsFromCalleeParam(MethodInvokeNode min,
+ FlowGraph calleeSubGlobalGraph, FlowNode calleeSrcNode, FlowGraph callerSubGlobalGraph,
+ NTuple<Descriptor> callerSrcTuple, Set<FlowNode> visited, NTuple<Descriptor> baseTuple) {
+
+ MethodDescriptor mdCallee = calleeSubGlobalGraph.getMethodDescriptor();
+
+ // 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);
+ }
+
+ callerSubGlobalGraph.addValueFlowEdge(srcDescTuple, dstDescTuple);
- // map a class descriptor to a field lattice
- private Map<ClassDescriptor, SSJavaLattice<String>> cd2lattice;
+ if (!visited.contains(dstNode)) {
+ visited.add(dstNode);
+ recurAddValueFlowsFromCalleeParam(min, calleeSubGlobalGraph, dstNode, callerSubGlobalGraph,
+ dstDescTuple, visited, baseTuple);
+ }
- // map a method descriptor to a method lattice
- private Map<MethodDescriptor, SSJavaLattice<String>> md2lattice;
+ }
- // map a method/class descriptor to a hierarchy graph
- private Map<Descriptor, HierarchyGraph> mapDescriptorToHierarchyGraph;
+ }
- // map a method/class descriptor to a skeleton hierarchy graph
- private Map<Descriptor, HierarchyGraph> mapDescriptorToSkeletonHierarchyGraph;
+ private NTuple<Descriptor> translateToCaller(MethodInvokeNode min, int paramIdx,
+ NTuple<Descriptor> srcDescTuple) {
- private Map<Descriptor, HierarchyGraph> mapDescriptorToSimpleHierarchyGraph;
+ NTuple<Descriptor> callerTuple = new NTuple<Descriptor>();
- // map a method/class descriptor to a skeleton hierarchy graph with combination nodes
- private Map<Descriptor, HierarchyGraph> mapDescriptorToCombineSkeletonHierarchyGraph;
+ NTuple<Descriptor> argTuple = mapMethodInvokeNodeToArgIdxMap.get(min).get(paramIdx);
- // map a method descriptor to a method summary
- private Map<MethodDescriptor, MethodSummary> mapMethodDescToMethodSummary;
+ for (int i = 0; i < argTuple.size(); i++) {
+ callerTuple.add(argTuple.get(i));
+ }
- // map a method descriptor to the set of method invocation nodes which are
- // invoked by the method descriptor
- private Map<MethodDescriptor, Set<MethodInvokeNode>> mapMethodDescriptorToMethodInvokeNodeSet;
+ for (int i = 1; i < srcDescTuple.size(); i++) {
+ callerTuple.add(srcDescTuple.get(i));
+ }
- private Map<MethodInvokeNode, Map<Integer, NodeTupleSet>> mapMethodInvokeNodeToArgIdxMap;
+ return callerTuple;
+ }
- private Map<MethodInvokeNode, NTuple<Descriptor>> mapMethodInvokeNodeToBaseTuple;
+ private NTuple<Descriptor> traslateToCalleeParamTupleToCallerArgTuple(
+ NTuple<Descriptor> calleeInitTuple, NTuple<Descriptor> callerSrcTuple) {
- private Map<MethodDescriptor, MethodLocationInfo> mapMethodDescToMethodLocationInfo;
+ NTuple<Descriptor> callerInitTuple = new NTuple<Descriptor>();
- private Map<ClassDescriptor, LocationInfo> mapClassToLocationInfo;
+ for (int i = 0; i < callerSrcTuple.size(); i++) {
+ callerInitTuple.add(callerSrcTuple.get(i));
+ }
- private Map<MethodDescriptor, Set<MethodDescriptor>> mapMethodToCalleeSet;
+ for (int i = 1; i < calleeInitTuple.size(); i++) {
+ callerInitTuple.add(calleeInitTuple.get(i));
+ }
- private Map<MethodDescriptor, Set<FlowNode>> mapMethodDescToParamNodeFlowsToReturnValue;
+ return callerInitTuple;
+ }
- private Map<String, Vector<String>> mapFileNameToLineVector;
+ public LocationSummary getLocationSummary(Descriptor d) {
+ if (!mapDescToLocationSummary.containsKey(d)) {
+ if (d instanceof MethodDescriptor) {
+ mapDescToLocationSummary.put(d, new MethodSummary((MethodDescriptor) d));
+ } else if (d instanceof ClassDescriptor) {
+ mapDescToLocationSummary.put(d, new FieldSummary());
+ }
+ }
+ return mapDescToLocationSummary.get(d);
+ }
- private Map<Descriptor, Integer> mapDescToDefinitionLine;
+ private void generateMethodSummary() {
- public static final String GLOBALLOC = "GLOBALLOC";
+ Set<MethodDescriptor> keySet = md2lattice.keySet();
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ MethodDescriptor md = (MethodDescriptor) iterator.next();
- public static final String TOPLOC = "TOPLOC";
+ System.out.println("\nSSJAVA: generate method summary: " + md);
- public static final String INTERLOC = "INTERLOC";
+ FlowGraph flowGraph = getFlowGraph(md);
+ MethodSummary methodSummary = getMethodSummary(md);
- public static final Descriptor GLOBALDESC = new NameDescriptor(GLOBALLOC);
+ // construct a parameter mapping that maps a parameter descriptor to an
+ // inferred composite
+ // location
- public static final Descriptor TOPDESC = new NameDescriptor(TOPLOC);
+ for (int paramIdx = 0; paramIdx < flowGraph.getNumParameters(); paramIdx++) {
+ FlowNode flowNode = flowGraph.getParamFlowNode(paramIdx);
+ CompositeLocation inferredCompLoc = flowNode.getCompositeLocation();
+ // NTuple<Descriptor> descTuple = flowNode.getDescTuple();
+ //
+ // CompositeLocation assignedCompLoc = flowNode.getCompositeLocation();
+ // CompositeLocation inferredCompLoc;
+ // if (assignedCompLoc != null) {
+ // inferredCompLoc = translateCompositeLocation(assignedCompLoc);
+ // } else {
+ // Descriptor locDesc = descTuple.get(0);
+ // Location loc = new Location(md, locDesc.getSymbol());
+ // loc.setLocDescriptor(locDesc);
+ // inferredCompLoc = new CompositeLocation(loc);
+ // }
+ System.out.println("-paramIdx=" + paramIdx + " infer=" + inferredCompLoc);
+ System.out.println("-flowNode inferLoc=" + flowNode.getCompositeLocation());
+ methodSummary.addMapParamIdxToInferLoc(paramIdx, inferredCompLoc);
+ }
- public static String newline = System.getProperty("line.separator");
+ }
- LocationInfo curMethodInfo;
+ }
- boolean debug = true;
+ private boolean hasOrderingRelation(NTuple<Location> locTuple1, NTuple<Location> locTuple2) {
- private static int locSeed = 0;
+ int size = locTuple1.size() >= locTuple2.size() ? locTuple2.size() : locTuple1.size();
- public LocationInference(SSJavaAnalysis ssjava, State state) {
- this.ssjava = ssjava;
- this.state = state;
- this.toanalyzeList = new ArrayList<ClassDescriptor>();
- this.toanalyzeMethodList = new ArrayList<MethodDescriptor>();
- this.mapMethodDescriptorToFlowGraph = new HashMap<MethodDescriptor, FlowGraph>();
- this.cd2lattice = new HashMap<ClassDescriptor, SSJavaLattice<String>>();
- this.md2lattice = new HashMap<MethodDescriptor, SSJavaLattice<String>>();
- this.methodDescriptorsToVisitStack = new Stack<MethodDescriptor>();
- this.mapMethodDescriptorToMethodInvokeNodeSet =
- new HashMap<MethodDescriptor, Set<MethodInvokeNode>>();
- this.mapMethodInvokeNodeToArgIdxMap =
- new HashMap<MethodInvokeNode, Map<Integer, NodeTupleSet>>();
- this.mapMethodDescToMethodLocationInfo = new HashMap<MethodDescriptor, MethodLocationInfo>();
- this.mapMethodToCalleeSet = new HashMap<MethodDescriptor, Set<MethodDescriptor>>();
- this.mapClassToLocationInfo = new HashMap<ClassDescriptor, LocationInfo>();
+ for (int idx = 0; idx < size; idx++) {
+ Location loc1 = locTuple1.get(idx);
+ Location loc2 = locTuple2.get(idx);
- this.mapFileNameToLineVector = new HashMap<String, Vector<String>>();
- this.mapDescToDefinitionLine = new HashMap<Descriptor, Integer>();
- this.mapMethodDescToParamNodeFlowsToReturnValue =
- new HashMap<MethodDescriptor, Set<FlowNode>>();
+ Descriptor desc1 = loc1.getDescriptor();
+ Descriptor desc2 = loc2.getDescriptor();
- this.mapDescriptorToHierarchyGraph = new HashMap<Descriptor, HierarchyGraph>();
- this.mapMethodDescToMethodSummary = new HashMap<MethodDescriptor, MethodSummary>();
- this.mapMethodInvokeNodeToBaseTuple = new HashMap<MethodInvokeNode, NTuple<Descriptor>>();
+ if (!desc1.equals(desc2)) {
+ throw new Error("Fail to compare " + locTuple1 + " and " + locTuple2);
+ }
- this.mapDescriptorToSkeletonHierarchyGraph = new HashMap<Descriptor, HierarchyGraph>();
- this.mapDescriptorToCombineSkeletonHierarchyGraph = new HashMap<Descriptor, HierarchyGraph>();
- this.mapDescriptorToSimpleHierarchyGraph = new HashMap<Descriptor, HierarchyGraph>();
+ Descriptor locDesc1 = loc1.getLocDescriptor();
+ Descriptor locDesc2 = loc2.getLocDescriptor();
- }
+ HierarchyGraph hierarchyGraph = getHierarchyGraph(desc1);
- public void setupToAnalyze() {
- SymbolTable classtable = state.getClassSymbolTable();
- toanalyzeList.clear();
- toanalyzeList.addAll(classtable.getValueSet());
- // Collections.sort(toanalyzeList, new Comparator<ClassDescriptor>() {
- // public int compare(ClassDescriptor o1, ClassDescriptor o2) {
- // return o1.getClassName().compareToIgnoreCase(o2.getClassName());
- // }
- // });
- }
+ HNode node1 = hierarchyGraph.getHNode(locDesc1);
+ HNode node2 = hierarchyGraph.getHNode(locDesc2);
- public void setupToAnalazeMethod(ClassDescriptor cd) {
+ System.out.println("---node1=" + node1 + " node2=" + node2);
+ System.out.println("---hierarchyGraph.getIncomingNodeSet(node2)="
+ + hierarchyGraph.getIncomingNodeSet(node2));
- SymbolTable methodtable = cd.getMethodTable();
- toanalyzeMethodList.clear();
- toanalyzeMethodList.addAll(methodtable.getValueSet());
- Collections.sort(toanalyzeMethodList, new Comparator<MethodDescriptor>() {
- public int compare(MethodDescriptor o1, MethodDescriptor o2) {
- return o1.getSymbol().compareToIgnoreCase(o2.getSymbol());
+ if (locDesc1.equals(locDesc2)) {
+ continue;
+ } else if (!hierarchyGraph.getIncomingNodeSet(node2).contains(node1)
+ && !hierarchyGraph.getIncomingNodeSet(node1).contains(node2)) {
+ return false;
+ } else {
+ return true;
}
- });
- }
- public boolean toAnalyzeMethodIsEmpty() {
- return toanalyzeMethodList.isEmpty();
- }
+ }
- public boolean toAnalyzeIsEmpty() {
- return toanalyzeList.isEmpty();
- }
+ return false;
- public ClassDescriptor toAnalyzeNext() {
- return toanalyzeList.remove(0);
}
- public MethodDescriptor toAnalyzeMethodNext() {
- return toanalyzeMethodList.remove(0);
+ private boolean isHigherThan(NTuple<Location> locTuple1, NTuple<Location> locTuple2) {
+
+ int size = locTuple1.size() >= locTuple2.size() ? locTuple2.size() : locTuple1.size();
+
+ for (int idx = 0; idx < size; idx++) {
+ Location loc1 = locTuple1.get(idx);
+ Location loc2 = locTuple2.get(idx);
+
+ Descriptor desc1 = loc1.getDescriptor();
+ Descriptor desc2 = loc2.getDescriptor();
+
+ if (!desc1.equals(desc2)) {
+ throw new Error("Fail to compare " + locTuple1 + " and " + locTuple2);
+ }
+
+ Descriptor locDesc1 = loc1.getLocDescriptor();
+ Descriptor locDesc2 = loc2.getLocDescriptor();
+
+ HierarchyGraph hierarchyGraph = getHierarchyGraph(desc1);
+
+ HNode node1 = hierarchyGraph.getHNode(locDesc1);
+ HNode node2 = hierarchyGraph.getHNode(locDesc2);
+
+ System.out.println("---node1=" + node1 + " node2=" + node2);
+ System.out.println("---hierarchyGraph.getIncomingNodeSet(node2)="
+ + hierarchyGraph.getIncomingNodeSet(node2));
+
+ if (locDesc1.equals(locDesc2)) {
+ continue;
+ } else if (hierarchyGraph.getIncomingNodeSet(node2).contains(node1)) {
+ return true;
+ } else {
+ return false;
+ }
+
+ }
+
+ return false;
}
- public void inference() {
+ private CompositeLocation translateCompositeLocation(CompositeLocation compLoc) {
+ CompositeLocation newCompLoc = new CompositeLocation();
+
+ // System.out.println("compLoc=" + compLoc);
+ for (int i = 0; i < compLoc.getSize(); i++) {
+ Location loc = compLoc.get(i);
+ Descriptor enclosingDescriptor = loc.getDescriptor();
+ Descriptor locDescriptor = loc.getLocDescriptor();
+
+ HNode hnode = getHierarchyGraph(enclosingDescriptor).getHNode(locDescriptor);
+ // System.out.println("-hnode=" + hnode + " from=" + locDescriptor +
+ // " enclosingDescriptor="
+ // + enclosingDescriptor);
+ // System.out.println("-getLocationSummary(enclosingDescriptor)="
+ // + getLocationSummary(enclosingDescriptor));
+ String locName = getLocationSummary(enclosingDescriptor).getLocationName(hnode.getName());
+ // System.out.println("-locName=" + locName);
+ Location newLoc = new Location(enclosingDescriptor, locName);
+ newLoc.setLocDescriptor(locDescriptor);
+ newCompLoc.addLocation(newLoc);
+ }
- // 1) construct value flow graph
- constructFlowGraph();
+ return newCompLoc;
+ }
- constructHierarchyGraph();
+ private void debug_writeLattices() {
- simplifyHierarchyGraph();
+ Set<Descriptor> keySet = mapDescriptorToSimpleLattice.keySet();
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ Descriptor key = (Descriptor) iterator.next();
+ SSJavaLattice<String> simpleLattice = mapDescriptorToSimpleLattice.get(key);
+ // HierarchyGraph simpleHierarchyGraph = getSimpleHierarchyGraph(key);
+ HierarchyGraph scHierarchyGraph = getSkeletonCombinationHierarchyGraph(key);
+ if (key instanceof ClassDescriptor) {
+ writeInferredLatticeDotFile((ClassDescriptor) key, scHierarchyGraph, simpleLattice,
+ "_SIMPLE");
+ } else if (key instanceof MethodDescriptor) {
+ MethodDescriptor md = (MethodDescriptor) key;
+ writeInferredLatticeDotFile(md.getClassDesc(), md, scHierarchyGraph, simpleLattice,
+ "_SIMPLE");
+ }
- constructSkeletonHierarchyGraph();
+ LocationSummary ls = getLocationSummary(key);
+ System.out.println("####LOC SUMMARY=" + key + "\n" + ls.getMapHNodeNameToLocationName());
+ }
- insertCombinationNodes();
+ Set<ClassDescriptor> cdKeySet = cd2lattice.keySet();
+ for (Iterator iterator = cdKeySet.iterator(); iterator.hasNext();) {
+ ClassDescriptor cd = (ClassDescriptor) iterator.next();
+ writeInferredLatticeDotFile((ClassDescriptor) cd, getSkeletonCombinationHierarchyGraph(cd),
+ cd2lattice.get(cd), "");
+ }
- debug_writeHierarchyDotFile();
+ Set<MethodDescriptor> mdKeySet = md2lattice.keySet();
+ for (Iterator iterator = mdKeySet.iterator(); iterator.hasNext();) {
+ MethodDescriptor md = (MethodDescriptor) iterator.next();
+ writeInferredLatticeDotFile(md.getClassDesc(), md, getSkeletonCombinationHierarchyGraph(md),
+ md2lattice.get(md), "");
+ }
- System.exit(0);
+ }
- // 2) construct lattices
- inferLattices();
+ private void buildLattice() {
- simplifyLattices();
+ BuildLattice buildLattice = new BuildLattice(this);
- // 3) check properties
- checkLattices();
+ Set<Descriptor> keySet = mapDescriptorToCombineSkeletonHierarchyGraph.keySet();
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ Descriptor desc = (Descriptor) iterator.next();
- // calculate RETURNLOC,PCLOC
- calculateExtraLocations();
+ SSJavaLattice<String> simpleLattice = buildLattice.buildLattice(desc);
+
+ addMapDescToSimpleLattice(desc, simpleLattice);
+
+ HierarchyGraph simpleHierarchyGraph = getSimpleHierarchyGraph(desc);
+ System.out.println("\n## insertIntermediateNodesToStraightLine:"
+ + simpleHierarchyGraph.getName());
+ SSJavaLattice<String> lattice =
+ buildLattice.insertIntermediateNodesToStraightLine(desc, simpleLattice);
+ lattice.removeRedundantEdges();
+
+ if (desc instanceof ClassDescriptor) {
+ // field lattice
+ cd2lattice.put((ClassDescriptor) desc, lattice);
+ // ssjava.writeLatticeDotFile((ClassDescriptor) desc, null, lattice);
+ } else if (desc instanceof MethodDescriptor) {
+ // method lattice
+ md2lattice.put((MethodDescriptor) desc, lattice);
+ MethodDescriptor md = (MethodDescriptor) desc;
+ ClassDescriptor cd = md.getClassDesc();
+ // ssjava.writeLatticeDotFile(cd, md, lattice);
+ }
- debug_writeLatticeDotFile();
+ // System.out.println("\nSSJAVA: Insering Combination Nodes:" + desc);
+ // HierarchyGraph skeletonGraph = getSkeletonHierarchyGraph(desc);
+ // HierarchyGraph skeletonGraphWithCombinationNode =
+ // skeletonGraph.clone();
+ // skeletonGraphWithCombinationNode.setName(desc + "_SC");
+ //
+ // HierarchyGraph simpleHierarchyGraph = getSimpleHierarchyGraph(desc);
+ // System.out.println("Identifying Combination Nodes:");
+ // skeletonGraphWithCombinationNode.insertCombinationNodesToGraph(simpleHierarchyGraph);
+ // skeletonGraphWithCombinationNode.simplifySkeletonCombinationHierarchyGraph();
+ // mapDescriptorToCombineSkeletonHierarchyGraph.put(desc,
+ // skeletonGraphWithCombinationNode);
+ }
- // 4) generate annotated source codes
- generateAnnoatedCode();
+ }
+ public void addMapDescToSimpleLattice(Descriptor desc, SSJavaLattice<String> lattice) {
+ mapDescriptorToSimpleLattice.put(desc, lattice);
+ }
+
+ public SSJavaLattice<String> getSimpleLattice(Descriptor desc) {
+ return mapDescriptorToSimpleLattice.get(desc);
}
private void simplifyHierarchyGraph() {
Descriptor desc = (Descriptor) iterator.next();
HierarchyGraph simpleHierarchyGraph = getHierarchyGraph(desc).clone();
simpleHierarchyGraph.setName(desc + "_SIMPLE");
- simpleHierarchyGraph.simplifyHierarchyGraph();
+ simpleHierarchyGraph.removeRedundantEdges();
+ // simpleHierarchyGraph.simplifyHierarchyGraph();
mapDescriptorToSimpleHierarchyGraph.put(desc, simpleHierarchyGraph);
}
}
HierarchyGraph skeletonGraphWithCombinationNode = skeletonGraph.clone();
skeletonGraphWithCombinationNode.setName(desc + "_SC");
- HierarchyGraph hierarchyGraph = getHierarchyGraph(desc);
- skeletonGraphWithCombinationNode.insertCombinationNodesToGraph(hierarchyGraph);
+ HierarchyGraph simpleHierarchyGraph = getSimpleHierarchyGraph(desc);
+ System.out.println("Identifying Combination Nodes:");
+ skeletonGraphWithCombinationNode.insertCombinationNodesToGraph(simpleHierarchyGraph);
skeletonGraphWithCombinationNode.simplifySkeletonCombinationHierarchyGraph();
mapDescriptorToCombineSkeletonHierarchyGraph.put(desc, skeletonGraphWithCombinationNode);
}
HierarchyGraph skeletonGraph = simpleGraph.generateSkeletonGraph();
skeletonGraph.setMapDescToHNode(simpleGraph.getMapDescToHNode());
skeletonGraph.setMapHNodeToDescSet(simpleGraph.getMapHNodeToDescSet());
+ skeletonGraph.simplifyHierarchyGraph();
+ // skeletonGraph.combineRedundantNodes(false);
+ // skeletonGraph.removeRedundantEdges();
mapDescriptorToSkeletonHierarchyGraph.put(desc, skeletonGraph);
}
}
- private void debug_writeHierarchyDotFile() {
+ private void debug_writeHierarchyDotFiles() {
+
+ Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ Descriptor desc = (Descriptor) iterator.next();
+ getHierarchyGraph(desc).writeGraph();
+ }
+
+ }
+
+ private void debug_writeSimpleHierarchyDotFiles() {
Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
Descriptor desc = (Descriptor) iterator.next();
getHierarchyGraph(desc).writeGraph();
getSimpleHierarchyGraph(desc).writeGraph();
+ }
+
+ }
+
+ private void debug_writeSkeletonHierarchyDotFiles() {
+
+ Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ Descriptor desc = (Descriptor) iterator.next();
getSkeletonHierarchyGraph(desc).writeGraph();
+ }
+
+ }
+
+ private void debug_writeSkeletonCombinationHierarchyDotFiles() {
+
+ Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
+ for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
+ Descriptor desc = (Descriptor) iterator.next();
getSkeletonCombinationHierarchyGraph(desc).writeGraph();
}
return mapDescriptorToSkeletonHierarchyGraph.get(d);
}
- private HierarchyGraph getSkeletonCombinationHierarchyGraph(Descriptor d) {
+ public HierarchyGraph getSkeletonCombinationHierarchyGraph(Descriptor d) {
if (!mapDescriptorToCombineSkeletonHierarchyGraph.containsKey(d)) {
mapDescriptorToCombineSkeletonHierarchyGraph.put(d, new HierarchyGraph(d));
}
// start to analyze leaf node
MethodDescriptor md = methodDescriptorsToVisitStack.pop();
- HierarchyGraph methodGraph = new HierarchyGraph(md);
- MethodSummary methodSummary = new MethodSummary();
+ HierarchyGraph hierarchyGraph = new HierarchyGraph(md);
+ // MethodSummary methodSummary = new MethodSummary(md);
- MethodLocationInfo methodInfo = new MethodLocationInfo(md);
- curMethodInfo = methodInfo;
+ // MethodLocationInfo methodInfo = new MethodLocationInfo(md);
+ // curMethodInfo = methodInfo;
System.out.println();
System.out.println("SSJAVA: Construcing the hierarchy graph from " + md);
- constructHierarchyGraph(md, methodGraph, methodSummary);
+ constructHierarchyGraph(md, hierarchyGraph);
- HierarchyGraph prevMethodGraph = getHierarchyGraph(md);
- MethodSummary prevMethodSummary = getMethodSummary(md);
+ HierarchyGraph prevHierarchyGraph = getHierarchyGraph(md);
+ // MethodSummary prevMethodSummary = getMethodSummary(md);
- if ((!methodGraph.equals(prevMethodGraph)) || (!methodSummary.equals(prevMethodSummary))) {
+ if (!hierarchyGraph.equals(prevHierarchyGraph)) {
- mapDescriptorToHierarchyGraph.put(md, methodGraph);
- mapMethodDescToMethodSummary.put(md, methodSummary);
+ mapDescriptorToHierarchyGraph.put(md, hierarchyGraph);
+ // mapDescToLocationSummary.put(md, methodSummary);
// results for callee changed, so enqueue dependents caller for
// further analysis
return mapDescriptorToHierarchyGraph.get(d);
}
- private void constructHierarchyGraph(MethodDescriptor md, HierarchyGraph methodGraph,
- MethodSummary methodSummary) {
+ private void constructHierarchyGraph(MethodDescriptor md, HierarchyGraph methodGraph) {
// visit each node of method flow graph
FlowGraph fg = getFlowGraph(md);
for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
FlowNode srcNode = (FlowNode) iterator.next();
- Set<FlowEdge> outEdgeSet = srcNode.getOutEdgeSet();
+ Set<FlowEdge> outEdgeSet = fg.getOutEdgeSet(srcNode);
for (Iterator iterator2 = outEdgeSet.iterator(); iterator2.hasNext();) {
FlowEdge outEdge = (FlowEdge) iterator2.next();
FlowNode dstNode = outEdge.getDst();
}
private MethodSummary getMethodSummary(MethodDescriptor md) {
- if (!mapMethodDescToMethodSummary.containsKey(md)) {
- mapMethodDescToMethodSummary.put(md, new MethodSummary());
+ if (!mapDescToLocationSummary.containsKey(md)) {
+ mapDescToLocationSummary.put(md, new MethodSummary(md));
}
- return mapMethodDescToMethodSummary.get(md);
+ return (MethodSummary) mapDescToLocationSummary.get(md);
}
private void addMapClassDefinitionToLineNum(ClassDescriptor cd, String strLine, int lineNum) {
Vector<String> sourceVec = mapFileNameToLineVector.get(orgFileName);
- try {
-
- FileWriter fileWriter = new FileWriter("./infer/" + outputFileName);
- BufferedWriter out = new BufferedWriter(fileWriter);
-
- for (int i = 0; i < sourceVec.size(); i++) {
- out.write(sourceVec.get(i));
- out.newLine();
- }
- out.close();
- } catch (IOException e) {
- e.printStackTrace();
- }
-
- }
-
- }
-
- private void simplifyLattices() {
-
- setupToAnalyze();
-
- while (!toAnalyzeIsEmpty()) {
- ClassDescriptor cd = toAnalyzeNext();
- setupToAnalazeMethod(cd);
-
- SSJavaLattice<String> classLattice = cd2lattice.get(cd);
- if (classLattice != null) {
- System.out.println("@@@check lattice=" + cd);
- checkLatticeProperty(cd, classLattice);
- }
-
- while (!toAnalyzeMethodIsEmpty()) {
- MethodDescriptor md = toAnalyzeMethodNext();
- SSJavaLattice<String> methodLattice = md2lattice.get(md);
- if (methodLattice != null) {
- System.out.println("@@@check lattice=" + md);
- checkLatticeProperty(md, methodLattice);
- }
- }
- }
-
- setupToAnalyze();
-
- while (!toAnalyzeIsEmpty()) {
- ClassDescriptor cd = toAnalyzeNext();
-
- setupToAnalazeMethod(cd);
-
- SSJavaLattice<String> classLattice = cd2lattice.get(cd);
- if (classLattice != null) {
- classLattice.removeRedundantEdges();
- }
-
- while (!toAnalyzeMethodIsEmpty()) {
- MethodDescriptor md = toAnalyzeMethodNext();
- SSJavaLattice<String> methodLattice = md2lattice.get(md);
- if (methodLattice != null) {
- methodLattice.removeRedundantEdges();
- }
- }
- }
-
- }
-
- private boolean checkLatticeProperty(Descriptor d, SSJavaLattice<String> lattice) {
- // if two elements has the same incoming node set,
- // we need to merge two elements ...
-
- boolean isUpdated;
- boolean isModified = false;
- do {
- isUpdated = removeNodeSharingSameIncomingNodes(d, lattice);
- if (!isModified && isUpdated) {
- isModified = true;
- }
- } while (isUpdated);
-
- return isModified;
- }
-
- private boolean removeNodeSharingSameIncomingNodes(Descriptor d, SSJavaLattice<String> lattice) {
- LocationInfo locInfo = getLocationInfo(d);
- Map<String, Set<String>> map = lattice.getIncomingElementMap();
- Set<String> keySet = map.keySet();
- for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
- String key = (String) iterator.next();
- Set<String> incomingSetKey = map.get(key);
-
- // System.out.println("key=" + key + " incomingSetKey=" +
- // incomingSetKey);
- if (incomingSetKey.size() > 0) {
- for (Iterator iterator2 = keySet.iterator(); iterator2.hasNext();) {
- String cur = (String) iterator2.next();
- if (!cur.equals(key)) {
- Set<String> incomingSetCur = map.get(cur);
- if (incomingSetCur.equals(incomingSetKey)) {
- if (!(incomingSetCur.size() == 1 && incomingSetCur.contains(lattice.getTopItem()))) {
- // NEED TO MERGE HERE!!!!
- System.out.println("@@@Try merge=" + cur + " " + key);
-
- Set<String> mergeSet = new HashSet<String>();
- mergeSet.add(cur);
- mergeSet.add(key);
-
- String newMergeLoc = "MLoc" + (SSJavaLattice.seed++);
-
- System.out.println("---ASSIGN NEW MERGE LOC=" + newMergeLoc + " to " + mergeSet);
- lattice.mergeIntoNewLocation(mergeSet, newMergeLoc);
-
- for (Iterator miterator = mergeSet.iterator(); miterator.hasNext();) {
- String oldLocSymbol = (String) miterator.next();
-
- Set<Pair<Descriptor, Descriptor>> inferLocSet =
- locInfo.getRelatedInferLocSet(oldLocSymbol);
- System.out.println("---update related locations=" + inferLocSet
- + " oldLocSymbol=" + oldLocSymbol);
-
- for (Iterator miterator2 = inferLocSet.iterator(); miterator2.hasNext();) {
- Pair<Descriptor, Descriptor> pair =
- (Pair<Descriptor, Descriptor>) miterator2.next();
- Descriptor enclosingDesc = pair.getFirst();
- Descriptor desc = pair.getSecond();
-
- System.out.println("---inferLoc pair=" + pair);
-
- CompositeLocation inferLoc =
- getLocationInfo(enclosingDesc).getInferLocation(desc);
- System.out.println("oldLoc=" + inferLoc);
- // if (curMethodInfo.md.equals(enclosingDesc)) {
- // inferLoc = curMethodInfo.getInferLocation(desc);
- // } else {
- // inferLoc =
- // getLocationInfo(enclosingDesc).getInferLocation(desc);
- // }
-
- Location locElement = inferLoc.get(inferLoc.getSize() - 1);
-
- locElement.setLocIdentifier(newMergeLoc);
- locInfo.addMapLocSymbolToRelatedInferLoc(newMergeLoc, enclosingDesc, desc);
-
- // if (curMethodInfo.md.equals(enclosingDesc)) {
- // inferLoc = curMethodInfo.getInferLocation(desc);
- // } else {
- // inferLoc =
- // getLocationInfo(enclosingDesc).getInferLocation(desc);
- // }
-
- inferLoc = getLocationInfo(enclosingDesc).getInferLocation(desc);
- System.out.println("---New Infer Loc=" + inferLoc);
-
- }
-
- locInfo.removeRelatedInferLocSet(oldLocSymbol, newMergeLoc);
+ try {
- }
+ FileWriter fileWriter = new FileWriter("./infer/" + outputFileName);
+ BufferedWriter out = new BufferedWriter(fileWriter);
- for (Iterator iterator3 = mergeSet.iterator(); iterator3.hasNext();) {
- String oldLoc = (String) iterator3.next();
- lattice.remove(oldLoc);
- }
- return true;
- }
- }
- }
+ for (int i = 0; i < sourceVec.size(); i++) {
+ out.write(sourceVec.get(i));
+ out.newLine();
}
+ out.close();
+ } catch (IOException e) {
+ e.printStackTrace();
}
}
- return false;
+
}
private void checkLattices() {
}
private void inferLattices() {
+ }
- // do fixed-point analysis
-
- ssjava.init();
+ private void calculateExtraLocations() {
LinkedList<MethodDescriptor> descriptorListToAnalyze = ssjava.getSortedDescriptors();
-
- // Collections.sort(descriptorListToAnalyze, new
- // Comparator<MethodDescriptor>() {
- // public int compare(MethodDescriptor o1, MethodDescriptor o2) {
- // return o1.getSymbol().compareToIgnoreCase(o2.getSymbol());
- // }
- // });
-
- // current descriptors to visit in fixed-point interprocedural analysis,
- // prioritized by
- // dependency in the call graph
- methodDescriptorsToVisitStack.clear();
-
- // descriptorListToAnalyze.removeFirst();
-
- Set<MethodDescriptor> methodDescriptorToVistSet = new HashSet<MethodDescriptor>();
- methodDescriptorToVistSet.addAll(descriptorListToAnalyze);
-
- while (!descriptorListToAnalyze.isEmpty()) {
- MethodDescriptor md = descriptorListToAnalyze.removeFirst();
- methodDescriptorsToVisitStack.add(md);
- }
-
- // analyze scheduled methods until there are no more to visit
- while (!methodDescriptorsToVisitStack.isEmpty()) {
- // start to analyze leaf node
- MethodDescriptor md = methodDescriptorsToVisitStack.pop();
-
- SSJavaLattice<String> methodLattice =
- new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
-
- MethodLocationInfo methodInfo = new MethodLocationInfo(md);
- curMethodInfo = methodInfo;
-
- System.out.println();
- System.out.println("SSJAVA: Inferencing the lattice from " + md);
-
- try {
- analyzeMethodLattice(md, methodLattice, methodInfo);
- } catch (CyclicFlowException e) {
- throw new Error("Fail to generate the method lattice for " + md);
- }
-
- SSJavaLattice<String> prevMethodLattice = getMethodLattice(md);
- MethodLocationInfo prevMethodInfo = getMethodLocationInfo(md);
-
- if ((!methodLattice.equals(prevMethodLattice)) || (!methodInfo.equals(prevMethodInfo))) {
-
- setMethodLattice(md, methodLattice);
- setMethodLocInfo(md, methodInfo);
-
- // results for callee changed, so enqueue dependents caller for
- // further analysis
- Iterator<MethodDescriptor> depsItr = ssjava.getDependents(md).iterator();
- while (depsItr.hasNext()) {
- MethodDescriptor methodNext = depsItr.next();
- if (!methodDescriptorsToVisitStack.contains(methodNext)
- && methodDescriptorToVistSet.contains(methodNext)) {
- methodDescriptorsToVisitStack.add(methodNext);
- }
- }
-
- }
-
+ for (Iterator iterator = descriptorListToAnalyze.iterator(); iterator.hasNext();) {
+ MethodDescriptor md = (MethodDescriptor) iterator.next();
+ calculateExtraLocations(md);
}
-
}
- private void calculateExtraLocations() {
+ private void calculateExtraLocations2() {
LinkedList<MethodDescriptor> descriptorListToAnalyze = ssjava.getSortedDescriptors();
for (Iterator iterator = descriptorListToAnalyze.iterator(); iterator.hasNext();) {
MethodDescriptor md = (MethodDescriptor) iterator.next();
return desc;
}
- private void analyzeMethodLattice(MethodDescriptor md, SSJavaLattice<String> methodLattice,
- MethodLocationInfo methodInfo) throws CyclicFlowException {
+ private void calculateExtraLocations(MethodDescriptor md) {
+ // calcualte pcloc, returnloc,...
- // first take a look at method invocation nodes to newly added relations
- // from the callee
- analyzeLatticeMethodInvocationNode(md, methodLattice, methodInfo);
+ System.out.println("\nSSJAVA:Calculate extra locations: " + md);
- if (!md.isStatic()) {
- // set the this location
- String thisLocSymbol = md.getThis().getSymbol();
- methodInfo.setThisLocName(thisLocSymbol);
- }
+ SSJavaLattice<String> methodLattice = getMethodLattice(md);
- // set the global location
- methodInfo.setGlobalLocName(LocationInference.GLOBALLOC);
- methodInfo.mapDescriptorToLocation(GLOBALDESC, new CompositeLocation(
- new Location(md, GLOBALLOC)));
+ MethodSummary methodSummary = getMethodSummary(md);
- // visit each node of method flow graph
FlowGraph fg = getFlowGraph(md);
Set<FlowNode> nodeSet = fg.getNodeSet();
- // for the method lattice, we need to look at the first element of
- // NTuple<Descriptor>
- for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
- FlowNode srcNode = (FlowNode) iterator.next();
+ // 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);
+ // }
+ // }
+ // }
+ MethodLocationInfo methodInfo = getMethodLocationInfo(md);
- Set<FlowEdge> outEdgeSet = srcNode.getOutEdgeSet();
- for (Iterator iterator2 = outEdgeSet.iterator(); iterator2.hasNext();) {
- FlowEdge outEdge = (FlowEdge) iterator2.next();
- FlowNode dstNode = outEdge.getDst();
+ Map<Integer, CompositeLocation> mapParamToLoc = methodSummary.getMapParamIdxToInferLoc();
+ Set<Integer> paramIdxSet = mapParamToLoc.keySet();
- NTuple<Descriptor> srcNodeTuple = srcNode.getDescTuple();
- NTuple<Descriptor> dstNodeTuple = dstNode.getDescTuple();
+ if (!ssjava.getMethodContainingSSJavaLoop().equals(md)) {
+ // calculate the initial program counter location
+ // PC location is higher than location types of parameters which has incoming flows.
+ String pcLocSymbol = "PCLOC";
- if (outEdge.getInitTuple().equals(srcNodeTuple)
- && outEdge.getEndTuple().equals(dstNodeTuple)) {
+ Set<NTuple<Location>> paramLocTupleHavingInFlowSet = new HashSet<NTuple<Location>>();
- if ((srcNodeTuple.size() > 1 && dstNodeTuple.size() > 1)
- && srcNodeTuple.get(0).equals(dstNodeTuple.get(0))) {
+ int numParams = fg.getNumParameters();
+ for (int i = 0; i < numParams; i++) {
+ FlowNode paramFlowNode = fg.getParamFlowNode(i);
- // value flows between fields
- Descriptor desc = srcNodeTuple.get(0);
- ClassDescriptor classDesc;
+ Descriptor prefix = paramFlowNode.getDescTuple().get(0);
- if (desc.equals(GLOBALDESC)) {
- classDesc = md.getClassDesc();
- } else {
- VarDescriptor varDesc = (VarDescriptor) srcNodeTuple.get(0);
- classDesc = varDesc.getType().getClassDesc();
+ // if (fg.getIncomingFlowNodeSet(paramFlowNode).size() > 0) {
+ if (fg.getIncomingNodeSetByPrefix(prefix).size() > 0) {
+ // parameter has in-value flows
+ NTuple<Descriptor> paramDescTuple = paramFlowNode.getCurrentDescTuple();
+ NTuple<Location> paramLocTuple = translateToLocTuple(md, paramDescTuple);
+
+ paramLocTupleHavingInFlowSet.add(paramLocTuple);
+ // CompositeLocation inferLoc = mapParamToLoc.get(paramIdx);
+ // paramInFlowSet.add(inferLoc);
+ }
+ }
+
+ System.out.println("paramLocTupleHavingInFlowSet=" + paramLocTupleHavingInFlowSet);
+
+ int numParamsWithIncomingValue = paramLocTupleHavingInFlowSet.size();
+
+ if (paramLocTupleHavingInFlowSet.size() > 0
+ && numParamsWithIncomingValue == fg.getNumParameters()) {
+ // If the PC loc is going to be higher than all paramters, we dont' need to do anything
+
+ // Generates a location in the method lattice that is higher than the
+ // paramLocTupleHavingInFlowSet
+ NTuple<Location> pcLocTuple = generateLocTupleHigherThan(md, paramLocTupleHavingInFlowSet);
+
+ int pcLocTupleIdx = pcLocTuple.size() - 1;
+ Location pcLoc = pcLocTuple.get(pcLocTupleIdx);
+ Descriptor pcDesc = pcLoc.getLocDescriptor();
+ Descriptor enclosingDesc = pcLocTuple.get(pcLocTupleIdx).getDescriptor();
+
+ HierarchyGraph hierarchyGraph = getHierarchyGraph(enclosingDesc);
+ HNode pcNode = hierarchyGraph.getHNode(pcDesc);
+ pcNode.setSkeleton(true);
+
+ for (Iterator iterator = paramLocTupleHavingInFlowSet.iterator(); iterator.hasNext();) {
+ NTuple<Location> paramLocTuple = (NTuple<Location>) iterator.next();
+ Descriptor lowerDesc = paramLocTuple.get(pcLocTupleIdx).getLocDescriptor();
+ hierarchyGraph.addEdge(pcDesc, lowerDesc);
+ }
+
+ }
+
+ }
+
+ // 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> paramFlowNodeFlowingToReturnValueSet = getParamNodeFlowingToReturnValue(md);
+ Set<CompositeLocation> inferParamLocSet = new HashSet<CompositeLocation>();
+ for (Iterator iterator = paramFlowNodeFlowingToReturnValueSet.iterator(); iterator.hasNext();) {
+ FlowNode fn = (FlowNode) iterator.next();
+ CompositeLocation inferLoc =
+ generateInferredCompositeLocation(methodInfo, getFlowGraph(md).getLocationTuple(fn));
+ inferParamLocSet.add(inferLoc);
+ }
+
+ 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;
}
- extractRelationFromFieldFlows(classDesc, srcNode, dstNode, 1);
+ }
+ inferFieldReturnLocSet.add(inferReturnLoc);
- } else {
- // value flow between local var - local var or local var - field
- addRelationToLattice(md, methodLattice, methodInfo, srcNode, dstNode);
+ }
+ }
+
+ if (inferFieldReturnLocSet.size() > 0) {
+
+ 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);
+
+ } 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);
+ }
+ }
+
}
+
}
+ }
- // create mapping from param idx to inferred composite location
+ private NTuple<Location> generateLocTupleHigherThan(MethodDescriptor md,
+ Set<NTuple<Location>> paramLocTupleHavingInFlowSet) {
- int offset;
- if (!md.isStatic()) {
- // add 'this' reference location
- offset = 1;
- methodInfo.addMapParamIdxToInferLoc(0, methodInfo.getInferLocation(md.getThis()));
+ System.out.println("-generateLocTupleHigherThan=" + paramLocTupleHavingInFlowSet);
+
+ NTuple<Location> higherLocTuple = new NTuple<Location>();
+
+ VarDescriptor thisVarDesc = md.getThis();
+ // check if all paramter loc tuple is started with 'this' reference
+ boolean hasParamNotStartedWithThisRef = false;
+
+ int maxSize = 0;
+
+ Set<NTuple<Location>> paramLocTupleStartedWithThis = new HashSet<NTuple<Location>>();
+
+ for (Iterator iterator = paramLocTupleHavingInFlowSet.iterator(); iterator.hasNext();) {
+ NTuple<Location> paramLocTuple = (NTuple<Location>) iterator.next();
+ if (!paramLocTuple.get(0).getLocDescriptor().equals(thisVarDesc)) {
+ hasParamNotStartedWithThisRef = true;
+ } else if (paramLocTuple.size() > 1) {
+ paramLocTupleStartedWithThis.add(paramLocTuple);
+ if (maxSize < paramLocTuple.size()) {
+ maxSize = paramLocTuple.size();
+ }
+ }
+ }
+
+ Descriptor enclosingDesc = md;
+ if (hasParamNotStartedWithThisRef) {
+ // in this case, PCLOC will be the local location
} else {
- offset = 0;
+ // all parameter is started with 'this', so PCLOC will be set relative to the composite
+ // location started with 'this'.
+ for (int idx = 0; idx < maxSize - 1; idx++) {
+ Set<Descriptor> locDescSet = new HashSet<Descriptor>();
+ Location curLoc = null;
+ for (Iterator iterator = paramLocTupleHavingInFlowSet.iterator(); iterator.hasNext();) {
+ NTuple<Location> paramLocTuple = (NTuple<Location>) iterator.next();
+ curLoc = paramLocTuple.get(idx);
+ Descriptor locDesc = curLoc.getLocDescriptor();
+ locDescSet.add(locDesc);
+ }
+ System.out.println("locDescSet=" + locDescSet + " idx=" + idx);
+ if (locDescSet.size() != 1) {
+ break;
+ }
+ Location newLocElement = new Location(curLoc.getDescriptor(), curLoc.getLocDescriptor());
+ higherLocTuple.add(newLocElement);
+ enclosingDesc = getClassTypeDescriptor(curLoc.getLocDescriptor());
+ }
+
+ }
+
+ String pcLocIdentifier = PCLOC + (locSeed++);
+ NameDescriptor pcLocDesc = new NameDescriptor(pcLocIdentifier);
+ Location newLoc = new Location(enclosingDesc, pcLocDesc);
+ higherLocTuple.add(newLoc);
+
+ System.out.println("---higherLocTuple=" + higherLocTuple);
+
+ return higherLocTuple;
+
+ }
+
+ public ClassDescriptor getClassTypeDescriptor(Descriptor in) {
+
+ if (in instanceof VarDescriptor) {
+ return ((VarDescriptor) in).getType().getClassDesc();
+ } else {/* if (desc instanceof FieldDescriptor) { */
+ return ((FieldDescriptor) in).getType().getClassDesc();
+ }
+
+ }
+
+ private Set<NTuple<Location>> calculateHighestLocTupleSet(
+ Set<NTuple<Location>> paramLocTupleHavingInFlowSet) {
+
+ 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;
+ }
}
- for (int idx = 0; idx < md.numParameters(); idx++) {
- Descriptor paramDesc = md.getParameter(idx);
- CompositeLocation inferParamLoc = methodInfo.getInferLocation(paramDesc);
- methodInfo.addMapParamIdxToInferLoc(idx + offset, inferParamLoc);
+ 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 calculateExtraLocations(MethodDescriptor md) {
+ private void calculateExtraLocations2(MethodDescriptor md) {
// calcualte pcloc, returnloc,...
SSJavaLattice<String> methodLattice = getMethodLattice(md);
Map<Integer, CompositeLocation> mapParamToLoc = methodInfo.getMapParamIdxToInferLoc();
Set<Integer> paramIdxSet = mapParamToLoc.keySet();
- try {
- 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>();
+ if (!ssjava.getMethodContainingSSJavaLoop().equals(md)) {
+ // calculate the initial program counter location
+ // PC location is higher than location types of all parameters
+ String pcLocSymbol = "PCLOC";
- for (Iterator iterator = paramIdxSet.iterator(); iterator.hasNext();) {
- Integer paramIdx = (Integer) iterator.next();
+ Set<CompositeLocation> paramInFlowSet = new HashSet<CompositeLocation>();
- FlowNode paramFlowNode = fg.getParamFlowNode(paramIdx);
+ for (Iterator iterator = paramIdxSet.iterator(); iterator.hasNext();) {
+ Integer paramIdx = (Integer) iterator.next();
- if (fg.getIncomingFlowNodeSet(paramFlowNode).size() > 0) {
- // parameter has in-value flows
- CompositeLocation inferLoc = mapParamToLoc.get(paramIdx);
- paramInFlowSet.add(inferLoc);
- }
- }
+ FlowNode paramFlowNode = fg.getParamFlowNode(paramIdx);
- if (paramInFlowSet.size() > 0) {
- CompositeLocation lowestLoc = getLowest(methodLattice, paramInFlowSet);
- assert (lowestLoc != null);
- methodInfo.setPCLoc(lowestLoc);
+ if (fg.getIncomingFlowNodeSet(paramFlowNode).size() > 0) {
+ // parameter has in-value flows
+ CompositeLocation inferLoc = mapParamToLoc.get(paramIdx);
+ paramInFlowSet.add(inferLoc);
}
-
}
- // 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
+ if (paramInFlowSet.size() > 0) {
+ CompositeLocation lowestLoc = getLowest(methodLattice, paramInFlowSet);
+ assert (lowestLoc != null);
+ methodInfo.setPCLoc(lowestLoc);
+ }
- 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);
- }
+ // 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);
}
+ }
- 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;
- }
+ 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);
-
}
+ inferFieldReturnLocSet.add(inferReturnLoc);
+
}
+ }
- if (inferFieldReturnLocSet.size() > 0) {
+ if (inferFieldReturnLocSet.size() > 0) {
- 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);
+ 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);
- } 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)) {
- addRelationHigherToLower(methodLattice, methodInfo, paramLocLocalSymbol,
- returnLocSymbol);
- }
- }
+ } else {
+ String returnLocSymbol = "RETURNLOC";
+ CompositeLocation returnLocInferLoc =
+ new CompositeLocation(new Location(md, returnLocSymbol));
+ methodInfo.setReturnLoc(returnLocInferLoc);
- for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
- FlowNode returnNode = (FlowNode) iterator.next();
- CompositeLocation inferLoc =
- generateInferredCompositeLocation(methodInfo, fg.getLocationTuple(returnNode));
- if (!isGreaterThan(methodLattice, inferLoc, returnLocInferLoc)) {
- addRelation(methodLattice, methodInfo, inferLoc, 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);
+ }
}
}
- } catch (CyclicFlowException e) {
- e.printStackTrace();
- }
+ }
}
private Set<String> getHigherLocSymbolThan(SSJavaLattice<String> lattice, String loc) {
return false;
}
- private void recursiveAddRelationToLattice(int idx, MethodDescriptor md,
- CompositeLocation srcInferLoc, CompositeLocation dstInferLoc) throws CyclicFlowException {
-
- String srcLocSymbol = srcInferLoc.get(idx).getLocIdentifier();
- String dstLocSymbol = dstInferLoc.get(idx).getLocIdentifier();
+ private void contributeCalleeFlows(MethodInvokeNode min, MethodDescriptor mdCaller,
+ MethodDescriptor mdCallee) {
- if (srcLocSymbol.equals(dstLocSymbol)) {
- recursiveAddRelationToLattice(idx + 1, md, srcInferLoc, dstInferLoc);
- } else {
+ System.out.println("\n##contributeCalleeFlows callee=" + mdCallee + "TO caller=" + mdCaller);
- Descriptor parentDesc = srcInferLoc.get(idx).getDescriptor();
- LocationInfo locInfo = getLocationInfo(parentDesc);
+ getSubGlobalFlowGraph(mdCallee);
- addRelationHigherToLower(getLattice(parentDesc), getLocationInfo(parentDesc), srcLocSymbol,
- dstLocSymbol);
- }
+ }
+ private GlobalFlowGraph getSubGlobalFlowGraph(MethodDescriptor md) {
+ return mapMethodDescriptorToSubGlobalFlowGraph.get(md);
}
- private void propagateFlowsFromCallee(MethodInvokeNode min, MethodDescriptor mdCaller,
- MethodDescriptor mdCallee) {
+ private void propagateFlowsToCallerWithNoCompositeLocation(MethodInvokeNode min,
+ MethodDescriptor mdCaller, MethodDescriptor mdCallee) {
- // the transformation for a call site propagates all relations between
- // parameters from the callee
- // if the method is virtual, it also grab all relations from any possible
- // callees
+ System.out.println("\n##PROPAGATE callee=" + mdCallee + "TO caller=" + mdCaller);
- 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);
- }
+ // 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
+
+ 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);
+
+ NTuple<Descriptor> arg1Tuple = getNodeTupleByArgIdx(min, i);
+ NTuple<Descriptor> arg2Tuple = getNodeTupleByArgIdx(min, k);
+
+ // 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);
+
+ if (arg1Tuple.size() > 0 && arg2Tuple.size() > 0 && localReachSet.contains(paramNode2)) {
+ // need to propagate an ordering relation s.t. arg1 is higher
+ // than arg2
+
+ System.out
+ .println("-arg1Tuple=" + arg1Tuple + " is higher than arg2Tuple=" + arg2Tuple);
+
+ // otherwise, flows between method/field locations...
+ callerFlowGraph.addValueFlowEdge(arg1Tuple, arg2Tuple);
+ System.out.println("arg1=" + arg1Tuple + " arg2=" + arg2Tuple);
- for (Iterator iterator2 = setPossibleCallees.iterator(); iterator2.hasNext();) {
- MethodDescriptor possibleMdCallee = (MethodDescriptor) iterator2.next();
- propagateFlowsToCaller(min, mdCaller, possibleMdCallee);
+ }
+
+ 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();
FlowNode paramNode1 = calleeFlowGraph.getParamFlowNode(i);
FlowNode paramNode2 = calleeFlowGraph.getParamFlowNode(k);
- NodeTupleSet tupleSetArg1 = getNodeTupleSetByArgIdx(min, i);
- NodeTupleSet tupleSetArg2 = getNodeTupleSetByArgIdx(min, 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();
// 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,
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 the
- // corresponding
- // parameter a new composite location started with
- // 'this'
- // reference
+ // 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);
+ 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
+
+ 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, arg1Tuple,
- paramNode1);
+ 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
+ // 'this.FIELD' but we couldn't... instead we assign the
// corresponding
// parameter a new composite location started with
- // 'this'
- // reference
+ // 'this' reference
CompositeLocation compLocForParam2 =
generateCompositeLocation(mdCallee, param2Prefix);
// otherwise, flows between method/field locations...
callerFlowGraph.addValueFlowEdge(arg1Tuple, arg2Tuple);
- // System.out.println("arg1=" + arg1Tuple + " arg2=" +
- // arg2Tuple);
+ System.out.println("arg1=" + arg1Tuple + " arg2=" + arg2Tuple);
}
}
}
+ System.out.println();
}
}
}
+ System.out.println("##\n");
+ }
+
+ private NTuple<Descriptor> translateCompositeLocationToCaller(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));
+ }
+
+ for (int i = 1; i < compLocForParam1.getSize(); i++) {
+ Location loc = compLocForParam1.get(i);
+ tuple.add(loc.getLocDescriptor());
+ }
+
+ return tuple;
+ }
+
+ private CompositeLocation generateCompositeLocation(NTuple<Location> prefixLocTuple) {
+
+ System.out.println("generateCompositeLocation=" + prefixLocTuple);
+
+ CompositeLocation newCompLoc = new CompositeLocation();
+ for (int i = 0; i < prefixLocTuple.size(); i++) {
+ newCompLoc.addLocation(prefixLocTuple.get(i));
+ }
+
+ Descriptor lastDescOfPrefix = prefixLocTuple.get(prefixLocTuple.size() - 1).getLocDescriptor();
+
+ ClassDescriptor enclosingDescriptor;
+ if (lastDescOfPrefix instanceof FieldDescriptor) {
+ enclosingDescriptor = ((FieldDescriptor) lastDescOfPrefix).getType().getClassDesc();
+ // System.out.println("enclosingDescriptor0=" + enclosingDescriptor);
+ } else {
+ // var descriptor case
+ enclosingDescriptor = ((VarDescriptor) lastDescOfPrefix).getType().getClassDesc();
+ }
+ // System.out.println("enclosingDescriptor=" + enclosingDescriptor);
+
+ LocationDescriptor newLocDescriptor = generateNewLocationDescriptor();
+ newLocDescriptor.setEnclosingClassDesc(enclosingDescriptor);
+
+ Location newLoc = new Location(enclosingDescriptor, newLocDescriptor.getSymbol());
+ newLoc.setLocDescriptor(newLocDescriptor);
+ newCompLoc.addLocation(newLoc);
+ // System.out.println("--newCompLoc=" + newCompLoc);
+ return newCompLoc;
}
private CompositeLocation generateCompositeLocation(MethodDescriptor md,
- NTuple<Descriptor> param1Prefix) {
+ NTuple<Descriptor> paramPrefix) {
+
+ System.out.println("generateCompositeLocation=" + paramPrefix);
+
+ CompositeLocation newCompLoc = convertToCompositeLocation(md, paramPrefix);
- CompositeLocation newCompLoc = convertToCompositeLocation(md, param1Prefix);
+ Descriptor lastDescOfPrefix = paramPrefix.get(paramPrefix.size() - 1);
+ // System.out.println("lastDescOfPrefix=" + lastDescOfPrefix + " kind="
+ // + lastDescOfPrefix.getClass());
+ ClassDescriptor enclosingDescriptor;
+ if (lastDescOfPrefix instanceof FieldDescriptor) {
+ enclosingDescriptor = ((FieldDescriptor) lastDescOfPrefix).getType().getClassDesc();
+ // System.out.println("enclosingDescriptor0=" + enclosingDescriptor);
+ } else {
+ // var descriptor case
+ enclosingDescriptor = ((VarDescriptor) lastDescOfPrefix).getType().getClassDesc();
+ }
+ // System.out.println("enclosingDescriptor=" + enclosingDescriptor);
LocationDescriptor newLocDescriptor = generateNewLocationDescriptor();
+ newLocDescriptor.setEnclosingClassDesc(enclosingDescriptor);
- Descriptor enclosingDescriptor = param1Prefix.get(param1Prefix.size() - 1);
Location newLoc = new Location(enclosingDescriptor, newLocDescriptor.getSymbol());
newLoc.setLocDescriptor(newLocDescriptor);
newCompLoc.addLocation(newLoc);
- System.out.println("newCompLoc=" + newCompLoc);
+ // System.out.println("--newCompLoc=" + newCompLoc);
return newCompLoc;
}
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);
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();) {
} else if (curDescriptor instanceof NameDescriptor) {
// it is "GLOBAL LOC" case!
enclosingDescriptor = GLOBALDESC;
+ } else if (curDescriptor instanceof InterDescriptor) {
+ enclosingDescriptor = null;
} else {
enclosingDescriptor = ((FieldDescriptor) curDescriptor).getClassDescriptor();
}
}
- System.out.println("convertToCompositeLocation from=" + tuple + " to " + compLoc);
-
return compLoc;
}
return idx;
}
- private void analyzeLatticeMethodInvocationNode(MethodDescriptor mdCaller,
- SSJavaLattice<String> methodLattice, MethodLocationInfo methodInfo)
- throws CyclicFlowException {
-
- // the transformation for a call site propagates all relations between
- // parameters from the callee
- // if the method is virtual, it also grab all relations from any possible
- // callees
-
- Set<MethodInvokeNode> setMethodInvokeNode =
- mapMethodDescriptorToMethodInvokeNodeSet.get(mdCaller);
-
- if (setMethodInvokeNode != null) {
-
- for (Iterator iterator = setMethodInvokeNode.iterator(); iterator.hasNext();) {
- MethodInvokeNode min = (MethodInvokeNode) iterator.next();
- MethodDescriptor mdCallee = min.getMethod();
- Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
- if (mdCallee.isStatic()) {
- setPossibleCallees.add(mdCallee);
- } else {
- 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();
- propagateRelationToCaller(min, mdCaller, possibleMdCallee, methodLattice, methodInfo);
- }
-
- }
- }
-
- }
-
- private void propagateRelationToCaller(MethodInvokeNode min, MethodDescriptor mdCaller,
- MethodDescriptor possibleMdCallee, SSJavaLattice<String> methodLattice,
- MethodLocationInfo methodInfo) throws CyclicFlowException {
-
- SSJavaLattice<String> calleeLattice = getMethodLattice(possibleMdCallee);
- MethodLocationInfo calleeLocInfo = getMethodLocationInfo(possibleMdCallee);
- FlowGraph calleeFlowGraph = getFlowGraph(possibleMdCallee);
-
- int numParam = calleeLocInfo.getNumParam();
- for (int i = 0; i < numParam; i++) {
- CompositeLocation param1 = calleeLocInfo.getParamCompositeLocation(i);
- for (int k = 0; k < numParam; k++) {
- if (i != k) {
- CompositeLocation param2 = calleeLocInfo.getParamCompositeLocation(k);
-
- if (isGreaterThan(getLattice(possibleMdCallee), param1, param2)) {
- NodeTupleSet argDescTupleSet1 = getNodeTupleSetByArgIdx(min, i);
- NodeTupleSet argDescTupleSet2 = getNodeTupleSetByArgIdx(min, k);
-
- // the callee has the relation in which param1 is higher than param2
- // therefore, the caller has to have the relation in which arg1 is
- // higher than arg2
-
- for (Iterator<NTuple<Descriptor>> iterator = argDescTupleSet1.iterator(); iterator
- .hasNext();) {
- NTuple<Descriptor> argDescTuple1 = iterator.next();
-
- for (Iterator<NTuple<Descriptor>> iterator2 = argDescTupleSet2.iterator(); iterator2
- .hasNext();) {
- NTuple<Descriptor> argDescTuple2 = iterator2.next();
-
- // retreive inferred location by the local var descriptor
-
- NTuple<Location> tuple1 = getFlowGraph(mdCaller).getLocationTuple(argDescTuple1);
- NTuple<Location> tuple2 = getFlowGraph(mdCaller).getLocationTuple(argDescTuple2);
-
- // CompositeLocation higherInferLoc =
- // methodInfo.getInferLocation(argTuple1.get(0));
- // CompositeLocation lowerInferLoc =
- // methodInfo.getInferLocation(argTuple2.get(0));
-
- CompositeLocation inferLoc1 = generateInferredCompositeLocation(methodInfo, tuple1);
- CompositeLocation inferLoc2 = generateInferredCompositeLocation(methodInfo, tuple2);
-
- // addRelation(methodLattice, methodInfo, inferLoc1, inferLoc2);
-
- addFlowGraphEdge(mdCaller, argDescTuple1, argDescTuple2);
-
- }
-
- }
-
- }
- }
- }
- }
-
- }
-
private CompositeLocation generateInferredCompositeLocation(MethodLocationInfo methodInfo,
NTuple<Location> tuple) {
return inferLoc;
}
- private void addRelation(SSJavaLattice<String> methodLattice, MethodLocationInfo methodInfo,
- CompositeLocation srcInferLoc, CompositeLocation dstInferLoc) throws CyclicFlowException {
-
- System.out.println("addRelation --- srcInferLoc=" + srcInferLoc + " dstInferLoc="
- + dstInferLoc);
- String srcLocalLocSymbol = srcInferLoc.get(0).getLocIdentifier();
- String dstLocalLocSymbol = dstInferLoc.get(0).getLocIdentifier();
-
- if (srcInferLoc.getSize() == 1 && dstInferLoc.getSize() == 1) {
- // add a new relation to the local lattice
- addRelationHigherToLower(methodLattice, methodInfo, srcLocalLocSymbol, dstLocalLocSymbol);
- } else if (srcInferLoc.getSize() > 1 && dstInferLoc.getSize() > 1) {
- // both src and dst have assigned to a composite location
-
- if (!srcLocalLocSymbol.equals(dstLocalLocSymbol)) {
- addRelationHigherToLower(methodLattice, methodInfo, srcLocalLocSymbol, dstLocalLocSymbol);
- } else {
- recursivelyAddRelation(1, srcInferLoc, dstInferLoc);
- }
- } else {
- // either src or dst has assigned to a composite location
- if (!srcLocalLocSymbol.equals(dstLocalLocSymbol)) {
- addRelationHigherToLower(methodLattice, methodInfo, srcLocalLocSymbol, dstLocalLocSymbol);
- }
- }
-
- System.out.println();
-
- }
-
public LocationInfo getLocationInfo(Descriptor d) {
if (d instanceof MethodDescriptor) {
return getMethodLocationInfo((MethodDescriptor) d);
} else {
return getFieldLocationInfo((ClassDescriptor) d);
- }
- }
-
- private MethodLocationInfo getMethodLocationInfo(MethodDescriptor md) {
-
- if (!mapMethodDescToMethodLocationInfo.containsKey(md)) {
- mapMethodDescToMethodLocationInfo.put(md, new MethodLocationInfo(md));
- }
-
- return mapMethodDescToMethodLocationInfo.get(md);
-
- }
-
- private LocationInfo getFieldLocationInfo(ClassDescriptor cd) {
-
- if (!mapClassToLocationInfo.containsKey(cd)) {
- mapClassToLocationInfo.put(cd, new LocationInfo(cd));
- }
-
- return mapClassToLocationInfo.get(cd);
-
- }
-
- private void addRelationToLattice(MethodDescriptor md, SSJavaLattice<String> methodLattice,
- MethodLocationInfo methodInfo, FlowNode srcNode, FlowNode dstNode) throws CyclicFlowException {
-
- System.out.println();
- System.out.println("### addRelationToLattice src=" + srcNode + " dst=" + dstNode);
-
- // add a new binary relation of dstNode < srcNode
- FlowGraph flowGraph = getFlowGraph(md);
- try {
- System.out.println("***** src composite case::");
- calculateCompositeLocation(flowGraph, methodLattice, methodInfo, srcNode, null);
-
- CompositeLocation srcInferLoc =
- generateInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(srcNode));
- CompositeLocation dstInferLoc =
- generateInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(dstNode));
- addRelation(methodLattice, methodInfo, srcInferLoc, dstInferLoc);
- } catch (CyclicFlowException e) {
- // there is a cyclic value flow... try to calculate a composite location
- // for the destination node
- System.out.println("***** dst composite case::");
- calculateCompositeLocation(flowGraph, methodLattice, methodInfo, dstNode, srcNode);
- CompositeLocation srcInferLoc =
- generateInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(srcNode));
- CompositeLocation dstInferLoc =
- generateInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(dstNode));
- try {
- addRelation(methodLattice, methodInfo, srcInferLoc, dstInferLoc);
- } catch (CyclicFlowException e1) {
- throw new Error("Failed to merge cyclic value flows into a shared location.");
- }
- }
-
- }
-
- private void recursivelyAddRelation(int idx, CompositeLocation srcInferLoc,
- CompositeLocation dstInferLoc) throws CyclicFlowException {
-
- String srcLocSymbol = srcInferLoc.get(idx).getLocIdentifier();
- String dstLocSymbol = dstInferLoc.get(idx).getLocIdentifier();
-
- Descriptor parentDesc = srcInferLoc.get(idx).getDescriptor();
-
- if (srcLocSymbol.equals(dstLocSymbol)) {
- // check if it is the case of shared location
- if (srcInferLoc.getSize() == (idx + 1) && dstInferLoc.getSize() == (idx + 1)) {
- Location inferLocElement = srcInferLoc.get(idx);
- System.out.println("SET SHARED LOCATION=" + inferLocElement);
- getLattice(inferLocElement.getDescriptor())
- .addSharedLoc(inferLocElement.getLocIdentifier());
- } else if (srcInferLoc.getSize() > (idx + 1) && dstInferLoc.getSize() > (idx + 1)) {
- recursivelyAddRelation(idx + 1, srcInferLoc, dstInferLoc);
- }
- } else {
- addRelationHigherToLower(getLattice(parentDesc), getLocationInfo(parentDesc), srcLocSymbol,
- dstLocSymbol);
- }
- }
-
- private void recursivelyAddCompositeRelation(MethodDescriptor md, FlowGraph flowGraph,
- MethodLocationInfo methodInfo, FlowNode srcNode, FlowNode dstNode, Descriptor srcDesc,
- Descriptor dstDesc) throws CyclicFlowException {
-
- CompositeLocation inferSrcLoc;
- CompositeLocation inferDstLoc = methodInfo.getInferLocation(dstDesc);
-
- if (srcNode.getDescTuple().size() > 1) {
- // field access
- inferSrcLoc = new CompositeLocation();
-
- NTuple<Location> locTuple = flowGraph.getLocationTuple(srcNode);
- for (int i = 0; i < locTuple.size(); i++) {
- inferSrcLoc.addLocation(locTuple.get(i));
- }
-
- } else {
- inferSrcLoc = methodInfo.getInferLocation(srcDesc);
- }
-
- if (dstNode.getDescTuple().size() > 1) {
- // field access
- inferDstLoc = new CompositeLocation();
-
- NTuple<Location> locTuple = flowGraph.getLocationTuple(dstNode);
- for (int i = 0; i < locTuple.size(); i++) {
- inferDstLoc.addLocation(locTuple.get(i));
- }
-
- } else {
- inferDstLoc = methodInfo.getInferLocation(dstDesc);
- }
-
- recursiveAddRelationToLattice(1, md, inferSrcLoc, inferDstLoc);
- }
-
- private void addPrefixMapping(Map<NTuple<Location>, Set<NTuple<Location>>> map,
- NTuple<Location> prefix, NTuple<Location> element) {
-
- if (!map.containsKey(prefix)) {
- map.put(prefix, new HashSet<NTuple<Location>>());
- }
- map.get(prefix).add(element);
- }
-
- private boolean calculateCompositeLocation(FlowGraph flowGraph,
- SSJavaLattice<String> methodLattice, MethodLocationInfo methodInfo, FlowNode flowNode,
- FlowNode srcNode) throws CyclicFlowException {
-
- Descriptor localVarDesc = flowNode.getDescTuple().get(0);
- NTuple<Location> flowNodelocTuple = flowGraph.getLocationTuple(flowNode);
-
- if (localVarDesc.equals(methodInfo.getMethodDesc())) {
- return false;
- }
-
- Set<FlowNode> inNodeSet = flowGraph.getIncomingFlowNodeSet(flowNode);
- Set<FlowNode> reachableNodeSet = flowGraph.getReachFlowNodeSetFrom(flowNode);
-
- Map<NTuple<Location>, Set<NTuple<Location>>> mapPrefixToIncomingLocTupleSet =
- new HashMap<NTuple<Location>, Set<NTuple<Location>>>();
-
- List<NTuple<Location>> prefixList = new ArrayList<NTuple<Location>>();
-
- for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
- FlowNode inNode = (FlowNode) iterator.next();
- NTuple<Location> inNodeTuple = flowGraph.getLocationTuple(inNode);
-
- CompositeLocation inNodeInferredLoc =
- generateInferredCompositeLocation(methodInfo, inNodeTuple);
-
- NTuple<Location> inNodeInferredLocTuple = inNodeInferredLoc.getTuple();
-
- for (int i = 1; i < inNodeInferredLocTuple.size(); i++) {
- NTuple<Location> prefix = inNodeInferredLocTuple.subList(0, i);
- if (!prefixList.contains(prefix)) {
- prefixList.add(prefix);
- }
- addPrefixMapping(mapPrefixToIncomingLocTupleSet, prefix, inNodeInferredLocTuple);
- }
- }
-
- 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;
- }
- }
- });
-
- // System.out.println("prefixList=" + prefixList);
- // System.out.println("reachableNodeSet=" + reachableNodeSet);
-
- // find out reachable nodes that have the longest common prefix
- for (int i = 0; i < prefixList.size(); i++) {
- NTuple<Location> curPrefix = prefixList.get(i);
- Set<NTuple<Location>> reachableCommonPrefixSet = new HashSet<NTuple<Location>>();
-
- for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
- FlowNode reachableNode = (FlowNode) iterator2.next();
- NTuple<Location> reachLocTuple = flowGraph.getLocationTuple(reachableNode);
- CompositeLocation reachLocInferLoc =
- generateInferredCompositeLocation(methodInfo, reachLocTuple);
- if (reachLocInferLoc.getTuple().startsWith(curPrefix)) {
- reachableCommonPrefixSet.add(reachLocTuple);
- }
- }
-
- if (!reachableCommonPrefixSet.isEmpty()) {
- // found reachable nodes that start with the prefix curPrefix
- // need to assign a composite location
-
- // first, check if there are more than one the set of locations that has
- // the same length of the longest reachable prefix, no way to assign
- // a composite location to the input local var
- prefixSanityCheck(prefixList, i, flowGraph, reachableNodeSet);
-
- Set<NTuple<Location>> incomingCommonPrefixSet =
- mapPrefixToIncomingLocTupleSet.get(curPrefix);
-
- int idx = curPrefix.size();
- NTuple<Location> element = incomingCommonPrefixSet.iterator().next();
- Descriptor desc = element.get(idx).getDescriptor();
-
- SSJavaLattice<String> lattice = getLattice(desc);
- LocationInfo locInfo = getLocationInfo(desc);
-
- CompositeLocation inferLocation =
- generateInferredCompositeLocation(methodInfo, flowNodelocTuple);
-
- // methodInfo.getInferLocation(localVarDesc);
- CompositeLocation newInferLocation = new CompositeLocation();
-
- if (inferLocation.getTuple().startsWith(curPrefix)) {
- // the same infer location is already existed. no need to do
- // anything
- System.out.println("NO ATTEMPT TO MAKE A COMPOSITE LOCATION curPrefix=" + curPrefix);
-
- // TODO: refactoring!
- if (srcNode != null) {
- CompositeLocation newLoc = new CompositeLocation();
- String newLocSymbol = "Loc" + (SSJavaLattice.seed++);
- for (int locIdx = 0; locIdx < curPrefix.size(); locIdx++) {
- newLoc.addLocation(curPrefix.get(locIdx));
- }
- Location newLocationElement = new Location(desc, newLocSymbol);
- newLoc.addLocation(newLocationElement);
-
- Descriptor srcLocalVar = srcNode.getDescTuple().get(0);
- methodInfo.mapDescriptorToLocation(srcLocalVar, newLoc.clone());
- addMapLocSymbolToInferredLocation(methodInfo.getMethodDesc(), srcLocalVar, newLoc);
- methodInfo.removeMaplocalVarToLocSet(srcLocalVar);
-
- // add the field/var descriptor to the set of the location symbol
- int lastIdx = srcNode.getDescTuple().size() - 1;
- Descriptor lastFlowNodeDesc = srcNode.getDescTuple().get(lastIdx);
- NTuple<Location> srcNodelocTuple = flowGraph.getLocationTuple(srcNode);
- Descriptor enclosinglastLastFlowNodeDesc = srcNodelocTuple.get(lastIdx).getDescriptor();
-
- CompositeLocation newlyInferredLocForFlowNode =
- generateInferredCompositeLocation(methodInfo, srcNodelocTuple);
- Location lastInferLocElement =
- newlyInferredLocForFlowNode.get(newlyInferredLocForFlowNode.getSize() - 1);
- Descriptor enclosingLastInferLocElement = lastInferLocElement.getDescriptor();
-
- // getLocationInfo(enclosingLastInferLocElement).addMapLocSymbolToDescSet(
- // lastInferLocElement.getLocIdentifier(), lastFlowNodeDesc);
- getLocationInfo(enclosingLastInferLocElement).addMapLocSymbolToRelatedInferLoc(
- lastInferLocElement.getLocIdentifier(), enclosinglastLastFlowNodeDesc,
- lastFlowNodeDesc);
-
- System.out.println("@@@@@@@ ASSIGN " + newLoc + " to SRC=" + srcNode);
- }
-
- return true;
- } else {
- // assign a new composite location
-
- // String oldMethodLocationSymbol =
- // inferLocation.get(0).getLocIdentifier();
- String newLocSymbol = "Loc" + (SSJavaLattice.seed++);
- for (int locIdx = 0; locIdx < curPrefix.size(); locIdx++) {
- newInferLocation.addLocation(curPrefix.get(locIdx));
- }
- Location newLocationElement = new Location(desc, newLocSymbol);
- newInferLocation.addLocation(newLocationElement);
-
- // maps local variable to location types of the common prefix
- methodInfo.mapDescriptorToLocation(localVarDesc, newInferLocation.clone());
-
- // methodInfo.mapDescriptorToLocation(localVarDesc, newInferLocation);
- addMapLocSymbolToInferredLocation(methodInfo.getMethodDesc(), localVarDesc,
- newInferLocation);
- methodInfo.removeMaplocalVarToLocSet(localVarDesc);
-
- // add the field/var descriptor to the set of the location symbol
- int lastIdx = flowNode.getDescTuple().size() - 1;
- Descriptor lastFlowNodeDesc = flowNode.getDescTuple().get(lastIdx);
- Descriptor enclosinglastLastFlowNodeDesc = flowNodelocTuple.get(lastIdx).getDescriptor();
-
- CompositeLocation newlyInferredLocForFlowNode =
- generateInferredCompositeLocation(methodInfo, flowNodelocTuple);
- Location lastInferLocElement =
- newlyInferredLocForFlowNode.get(newlyInferredLocForFlowNode.getSize() - 1);
- Descriptor enclosingLastInferLocElement = lastInferLocElement.getDescriptor();
-
- // getLocationInfo(enclosingLastInferLocElement).addMapLocSymbolToDescSet(
- // lastInferLocElement.getLocIdentifier(), lastFlowNodeDesc);
- getLocationInfo(enclosingLastInferLocElement).addMapLocSymbolToRelatedInferLoc(
- lastInferLocElement.getLocIdentifier(), enclosinglastLastFlowNodeDesc,
- lastFlowNodeDesc);
-
- // clean up the previous location
- // Location prevInferLocElement =
- // inferLocation.get(inferLocation.getSize() - 1);
- // Descriptor prevEnclosingDesc = prevInferLocElement.getDescriptor();
- //
- // SSJavaLattice<String> targetLattice;
- // LocationInfo targetInfo;
- // if (prevEnclosingDesc.equals(methodInfo.getMethodDesc())) {
- // targetLattice = methodLattice;
- // targetInfo = methodInfo;
- // } else {
- // targetLattice = getLattice(prevInferLocElement.getDescriptor());
- // targetInfo = getLocationInfo(prevInferLocElement.getDescriptor());
- // }
- //
- // Set<Pair<Descriptor, Descriptor>> associstedDescSet =
- // targetInfo.getRelatedInferLocSet(prevInferLocElement.getLocIdentifier());
- //
- // if (associstedDescSet.size() == 1) {
- // targetLattice.remove(prevInferLocElement.getLocIdentifier());
- // } else {
- // associstedDescSet.remove(lastFlowNodeDesc);
- // }
-
- }
-
- System.out.println("curPrefix=" + curPrefix);
- System.out.println("ASSIGN NEW COMPOSITE LOCATION =" + newInferLocation + " to "
- + flowNode);
-
- String newlyInsertedLocName =
- newInferLocation.get(newInferLocation.getSize() - 1).getLocIdentifier();
-
- System.out.println("-- add in-flow");
- for (Iterator iterator = incomingCommonPrefixSet.iterator(); iterator.hasNext();) {
- NTuple<Location> tuple = (NTuple<Location>) iterator.next();
- Location loc = tuple.get(idx);
- String higher = loc.getLocIdentifier();
- addRelationHigherToLower(lattice, locInfo, higher, newlyInsertedLocName);
- }
-
- System.out.println("-- add out flow");
- for (Iterator iterator = reachableCommonPrefixSet.iterator(); iterator.hasNext();) {
- NTuple<Location> tuple = (NTuple<Location>) iterator.next();
- if (tuple.size() > idx) {
- Location loc = tuple.get(idx);
- String lower = loc.getLocIdentifier();
- // String lower =
- // locInfo.getFieldInferLocation(loc.getLocDescriptor()).getLocIdentifier();
- addRelationHigherToLower(lattice, locInfo, newlyInsertedLocName, lower);
- }
- }
+ }
+ }
- return true;
- }
+ private MethodLocationInfo getMethodLocationInfo(MethodDescriptor md) {
+ if (!mapMethodDescToMethodLocationInfo.containsKey(md)) {
+ mapMethodDescToMethodLocationInfo.put(md, new MethodLocationInfo(md));
}
- return false;
+ return mapMethodDescToMethodLocationInfo.get(md);
}
- private void addMapLocSymbolToInferredLocation(MethodDescriptor md, Descriptor localVar,
- CompositeLocation inferLoc) {
+ private LocationInfo getFieldLocationInfo(ClassDescriptor cd) {
+
+ if (!mapClassToLocationInfo.containsKey(cd)) {
+ mapClassToLocationInfo.put(cd, new LocationInfo(cd));
+ }
+
+ return mapClassToLocationInfo.get(cd);
- Location locElement = inferLoc.get((inferLoc.getSize() - 1));
- Descriptor enclosingDesc = locElement.getDescriptor();
- LocationInfo locInfo = getLocationInfo(enclosingDesc);
- locInfo.addMapLocSymbolToRelatedInferLoc(locElement.getLocIdentifier(), md, localVar);
}
- private boolean isCompositeLocation(CompositeLocation cl) {
- return cl.getSize() > 1;
+ private void addPrefixMapping(Map<NTuple<Location>, Set<NTuple<Location>>> map,
+ NTuple<Location> prefix, NTuple<Location> element) {
+
+ if (!map.containsKey(prefix)) {
+ map.put(prefix, new HashSet<NTuple<Location>>());
+ }
+ map.get(prefix).add(element);
}
private boolean containsNonPrimitiveElement(Set<Descriptor> descSet) {
return false;
}
- private void addRelationHigherToLower(SSJavaLattice<String> lattice, LocationInfo locInfo,
- String higher, String lower) throws CyclicFlowException {
-
- System.out.println("---addRelationHigherToLower " + higher + " -> " + lower
- + " to the lattice of " + locInfo.getDescIdentifier());
- // if (higher.equals(lower) && lattice.isSharedLoc(higher)) {
- // return;
- // }
- Set<String> cycleElementSet = lattice.getPossibleCycleElements(higher, lower);
-
- boolean hasNonPrimitiveElement = false;
- for (Iterator iterator = cycleElementSet.iterator(); iterator.hasNext();) {
- String cycleElementLocSymbol = (String) iterator.next();
-
- Set<Descriptor> descSet = locInfo.getDescSet(cycleElementLocSymbol);
- if (containsNonPrimitiveElement(descSet)) {
- hasNonPrimitiveElement = true;
- break;
- }
- }
-
- if (hasNonPrimitiveElement) {
- System.out.println("#Check cycle= " + lower + " < " + higher + " cycleElementSet="
- + cycleElementSet);
- // if there is non-primitive element in the cycle, no way to merge cyclic
- // elements into the shared location
- throw new CyclicFlowException();
- }
-
- if (cycleElementSet.size() > 0) {
-
- String newSharedLoc = "SharedLoc" + (SSJavaLattice.seed++);
-
- System.out.println("---ASSIGN NEW SHARED LOC=" + newSharedLoc + " to " + cycleElementSet);
- lattice.mergeIntoNewLocation(cycleElementSet, newSharedLoc);
- lattice.addSharedLoc(newSharedLoc);
-
- for (Iterator iterator = cycleElementSet.iterator(); iterator.hasNext();) {
- String oldLocSymbol = (String) iterator.next();
-
- Set<Pair<Descriptor, Descriptor>> inferLocSet = locInfo.getRelatedInferLocSet(oldLocSymbol);
- System.out.println("---update related locations=" + inferLocSet);
- for (Iterator iterator2 = inferLocSet.iterator(); iterator2.hasNext();) {
- Pair<Descriptor, Descriptor> pair = (Pair<Descriptor, Descriptor>) iterator2.next();
- Descriptor enclosingDesc = pair.getFirst();
- Descriptor desc = pair.getSecond();
-
- CompositeLocation inferLoc;
- if (curMethodInfo.md.equals(enclosingDesc)) {
- inferLoc = curMethodInfo.getInferLocation(desc);
- } else {
- inferLoc = getLocationInfo(enclosingDesc).getInferLocation(desc);
- }
-
- Location locElement = inferLoc.get(inferLoc.getSize() - 1);
-
- locElement.setLocIdentifier(newSharedLoc);
- locInfo.addMapLocSymbolToRelatedInferLoc(newSharedLoc, enclosingDesc, desc);
-
- if (curMethodInfo.md.equals(enclosingDesc)) {
- inferLoc = curMethodInfo.getInferLocation(desc);
- } else {
- inferLoc = getLocationInfo(enclosingDesc).getInferLocation(desc);
- }
- System.out.println("---New Infer Loc=" + inferLoc);
-
- }
- locInfo.removeRelatedInferLocSet(oldLocSymbol, newSharedLoc);
-
- }
-
- lattice.addSharedLoc(newSharedLoc);
-
- } else if (!lattice.isGreaterThan(higher, lower)) {
- lattice.addRelationHigherToLower(higher, lower);
- }
- }
-
- private void replaceOldLocWithNewLoc(SSJavaLattice<String> methodLattice, String oldLocSymbol,
- String newLocSymbol) {
-
- if (methodLattice.containsKey(oldLocSymbol)) {
- methodLattice.substituteLocation(oldLocSymbol, newLocSymbol);
- }
-
- }
-
- private void prefixSanityCheck(List<NTuple<Location>> prefixList, int curIdx,
- FlowGraph flowGraph, Set<FlowNode> reachableNodeSet) {
-
- NTuple<Location> curPrefix = prefixList.get(curIdx);
-
- for (int i = curIdx + 1; i < prefixList.size(); i++) {
- NTuple<Location> prefixTuple = prefixList.get(i);
-
- if (curPrefix.startsWith(prefixTuple)) {
- continue;
- }
-
- for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
- FlowNode reachableNode = (FlowNode) iterator2.next();
- NTuple<Location> reachLocTuple = flowGraph.getLocationTuple(reachableNode);
- if (reachLocTuple.startsWith(prefixTuple)) {
- // TODO
- throw new Error("Failed to generate a composite location");
- }
- }
- }
- }
-
- public boolean isPrimitiveLocalVariable(FlowNode node) {
- VarDescriptor varDesc = (VarDescriptor) node.getDescTuple().get(0);
- return varDesc.getType().isPrimitive();
- }
-
private SSJavaLattice<String> getLattice(Descriptor d) {
if (d instanceof MethodDescriptor) {
return getMethodLattice((MethodDescriptor) d);
if (idx == 0) {
classDesc = ((VarDescriptor) desc).getType().getClassDesc();
} else {
- classDesc = ((FieldDescriptor) desc).getType().getClassDesc();
+ if (desc instanceof FieldDescriptor) {
+ classDesc = ((FieldDescriptor) desc).getType().getClassDesc();
+ } else {
+ // this case is that the local variable has a composite location assignment
+ // the following element after the composite location to the local variable
+ // has the enclosing descriptor of the local variable
+ Descriptor localDesc = srcNode.getDescTuple().get(0);
+ classDesc = ((VarDescriptor) localDesc).getType().getClassDesc();
+ }
}
-
extractFlowsBetweenFields(classDesc, srcNode, dstNode, idx + 1);
} else {
}
- private void extractRelationFromFieldFlows(ClassDescriptor cd, FlowNode srcNode,
- FlowNode dstNode, int idx) throws CyclicFlowException {
-
- if (srcNode.getDescTuple().get(idx).equals(dstNode.getDescTuple().get(idx))
- && srcNode.getDescTuple().size() > (idx + 1) && dstNode.getDescTuple().size() > (idx + 1)) {
- // value flow between fields: we don't need to add a binary relation
- // for this case
-
- Descriptor desc = srcNode.getDescTuple().get(idx);
- ClassDescriptor classDesc;
-
- if (idx == 0) {
- classDesc = ((VarDescriptor) desc).getType().getClassDesc();
- } else {
- classDesc = ((FieldDescriptor) desc).getType().getClassDesc();
- }
-
- extractRelationFromFieldFlows(classDesc, srcNode, dstNode, idx + 1);
-
- } else {
-
- Descriptor srcFieldDesc = srcNode.getDescTuple().get(idx);
- Descriptor dstFieldDesc = dstNode.getDescTuple().get(idx);
-
- // add a new binary relation of dstNode < srcNode
- SSJavaLattice<String> fieldLattice = getFieldLattice(cd);
- LocationInfo fieldInfo = getFieldLocationInfo(cd);
-
- String srcSymbol = fieldInfo.getFieldInferLocation(srcFieldDesc).getLocIdentifier();
- String dstSymbol = fieldInfo.getFieldInferLocation(dstFieldDesc).getLocIdentifier();
-
- addRelationHigherToLower(fieldLattice, fieldInfo, srcSymbol, dstSymbol);
-
- }
-
- }
-
public SSJavaLattice<String> getFieldLattice(ClassDescriptor cd) {
if (!cd2lattice.containsKey(cd)) {
cd2lattice.put(cd, new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM));
ClassDescriptor cd = toAnalyzeNext();
setupToAnalazeMethod(cd);
- toanalyzeMethodList.removeAll(visited);
+ temp_toanalyzeMethodList.removeAll(visited);
while (!toAnalyzeMethodIsEmpty()) {
MethodDescriptor md = toAnalyzeMethodNext();
if ((!ssjava.isTrustMethod(calleemd))
&& (!ssjava.isSSJavaUtil(calleemd.getClassDesc()))) {
if (!visited.contains(calleemd)) {
- toanalyzeMethodList.add(calleemd);
+ temp_toanalyzeMethodList.add(calleemd);
}
reachableCallee.add(calleemd);
needToAnalyzeCalleeSet.add(calleemd);
}
+ public boolean isTransitivelyCalledFrom(MethodDescriptor callee, MethodDescriptor caller) {
+ // if the callee is transitively invoked from the caller
+ // return true;
+
+ int callerIdx = toanalyze_methodDescList.indexOf(caller);
+ int calleeIdx = toanalyze_methodDescList.indexOf(callee);
+
+ if (callerIdx < calleeIdx) {
+ return true;
+ }
+
+ return false;
+
+ }
+
public void constructFlowGraph() {
System.out.println("");
- LinkedList<MethodDescriptor> methodDescList = computeMethodList();
+ toanalyze_methodDescList = computeMethodList();
+
+ LinkedList<MethodDescriptor> methodDescList =
+ (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
System.out.println("@@@methodDescList=" + methodDescList);
// System.exit(0);
mapMethodDescriptorToFlowGraph.put(md, fg);
analyzeMethodBody(md.getClassDesc(), md);
- propagateFlowsFromCallees(md);
- assignCompositeLocation(md);
+
+ // System.out.println("##constructSubGlobalFlowGraph");
+ // GlobalFlowGraph subGlobalFlowGraph = constructSubGlobalFlowGraph(fg);
+ // mapMethodDescriptorToSubGlobalFlowGraph.put(md, subGlobalFlowGraph);
+ //
+ // // TODO
+ // System.out.println("##addValueFlowsFromCalleeSubGlobalFlowGraph");
+ // addValueFlowsFromCalleeSubGlobalFlowGraph(md, subGlobalFlowGraph);
+ // subGlobalFlowGraph.writeGraph("_SUBGLOBAL");
+ //
+ // propagateFlowsFromCalleesWithNoCompositeLocation(md);
}
}
- _debug_printGraph();
+ // _debug_printGraph();
+
+ 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("##constructSubGlobalFlowGraph");
+ GlobalFlowGraph subGlobalFlowGraph = constructSubGlobalFlowGraph(getFlowGraph(md));
+ mapMethodDescriptorToSubGlobalFlowGraph.put(md, subGlobalFlowGraph);
+
+ // 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 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
+ // callees
+
+ Set<MethodInvokeNode> setMethodInvokeNode =
+ mapMethodDescriptorToMethodInvokeNodeSet.get(mdCaller);
+
+ if (setMethodInvokeNode != null) {
+
+ for (Iterator iterator = setMethodInvokeNode.iterator(); iterator.hasNext();) {
+ MethodInvokeNode min = (MethodInvokeNode) iterator.next();
+ MethodDescriptor mdCallee = min.getMethod();
+ Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
+ if (mdCallee.isStatic()) {
+ setPossibleCallees.add(mdCallee);
+ } else {
+ 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();
+ propagateFlowsToCallerWithNoCompositeLocation(min, mdCaller, possibleMdCallee);
+ }
+
+ }
+ }
+
+ }
+
private void propagateFlowsFromCallees(MethodDescriptor mdCaller) {
// the transformation for a call site propagates flows through parameters
newImplicitTupleSet.addTupleSet(condTupleNode);
if (newImplicitTupleSet.size() > 1) {
- // need to create an intermediate node for the GLB of conditional locations & implicit flows
+ // 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();
FlowGraph fg = getFlowGraph(md);
// if (implicitFlowTupleSet.size() == 1
- // && fg.getFlowNode(implicitFlowTupleSet.iterator().next()).isIntermediate()) {
+ // &&
+ // fg.getFlowNode(implicitFlowTupleSet.iterator().next()).isIntermediate())
+ // {
//
- // // since there is already an intermediate node for the GLB of implicit flows
+ // // since there is already an intermediate node for the GLB of implicit
+ // flows
// // we don't need to create another intermediate node.
// // just re-use the intermediate node for implicit flows.
//
- // FlowNode meetNode = fg.getFlowNode(implicitFlowTupleSet.iterator().next());
+ // FlowNode meetNode =
+ // fg.getFlowNode(implicitFlowTupleSet.iterator().next());
//
// for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
- // NTuple<Descriptor> returnNodeTuple = (NTuple<Descriptor>) iterator.next();
+ // NTuple<Descriptor> returnNodeTuple = (NTuple<Descriptor>)
+ // iterator.next();
// fg.addValueFlowEdge(returnNodeTuple, meetNode.getDescTuple());
// }
//
newImplicitTupleSet.addTupleSet(condTupleNode);
if (newImplicitTupleSet.size() > 1) {
- // need to create an intermediate node for the GLB of conditional locations & implicit flows
+ // 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();) {
// ///////////
// System.out.println("condTupleNode="+condTupleNode);
- // NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
+ // NTuple<Descriptor> interTuple =
+ // getFlowGraph(md).createIntermediateNode().getDescTuple();
//
- // for (Iterator<NTuple<Descriptor>> idxIter = condTupleNode.iterator(); idxIter.hasNext();) {
+ // 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
+ // for (Iterator<NTuple<Descriptor>> idxIter =
+ // implicitFlowTupleSet.iterator(); idxIter
// .hasNext();) {
// NTuple<Descriptor> tuple = idxIter.next();
// addFlowGraphEdge(md, tuple, interTuple);
}
private Set<FlowNode> getParamNodeFlowingToReturnValue(MethodDescriptor md) {
+
+ if (!mapMethodDescToParamNodeFlowsToReturnValue.containsKey(md)) {
+ mapMethodDescToParamNodeFlowsToReturnValue.put(md, new HashSet<FlowNode>());
+ }
+
return mapMethodDescToParamNodeFlowsToReturnValue.get(md);
}
private void analyzeFlowMethodInvokeNode(MethodDescriptor md, SymbolTable nametable,
MethodInvokeNode min, NodeTupleSet nodeSet, NodeTupleSet implicitFlowTupleSet) {
+ System.out.println("analyzeFlowMethodInvokeNode=" + min.printNode(0));
+
+ mapMethodInvokeNodeToArgIdxMap.put(min, new HashMap<Integer, NTuple<Descriptor>>());
+
if (nodeSet == null) {
nodeSet = new NodeTupleSet();
}
FlowGraph calleeFlowGraph = getFlowGraph(calleeMethodDesc);
Set<FlowNode> calleeReturnSet = calleeFlowGraph.getReturnNodeSet();
- System.out.println("#calleeReturnSet=" + calleeReturnSet);
-
if (min.getExpression() != null) {
NodeTupleSet baseNodeSet = new NodeTupleSet();
implicitFlowTupleSet, false);
assert (baseNodeSet.size() == 1);
- mapMethodInvokeNodeToBaseTuple.put(min, baseNodeSet.iterator().next());
+ NTuple<Descriptor> baseTuple = baseNodeSet.iterator().next();
+ mapMethodInvokeNodeToBaseTuple.put(min, baseTuple);
if (!min.getMethod().isStatic()) {
- addArgIdxMap(min, 0, baseNodeSet);
+ addArgIdxMap(min, 0, baseTuple);
for (Iterator iterator = calleeReturnSet.iterator(); iterator.hasNext();) {
FlowNode returnNode = (FlowNode) iterator.next();
if (returnDescTuple.startsWith(calleeMethodDesc.getThis())) {
// the location type of the return value is started with 'this'
// reference
- for (Iterator<NTuple<Descriptor>> baseIter = baseNodeSet.iterator(); baseIter
- .hasNext();) {
- NTuple<Descriptor> baseTuple = baseIter.next();
- NTuple<Descriptor> inFlowTuple = new NTuple<Descriptor>(baseTuple.getList());
- inFlowTuple.addAll(returnDescTuple.subList(1, returnDescTuple.size()));
- nodeSet.addTuple(inFlowTuple);
- }
+ NTuple<Descriptor> inFlowTuple = new NTuple<Descriptor>(baseTuple.getList());
+ inFlowTuple.addAll(returnDescTuple.subList(1, returnDescTuple.size()));
+ nodeSet.addTuple(inFlowTuple);
} else {
+ // TODO
Set<FlowNode> inFlowSet = calleeFlowGraph.getIncomingFlowNodeSet(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())) {
int idx = i + offset;
NodeTupleSet argTupleSet = new NodeTupleSet();
analyzeFlowExpressionNode(md, nametable, en, argTupleSet, false);
- // if argument is liternal node, argTuple is set to NULL.
- addArgIdxMap(min, idx, argTupleSet);
+ // 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 {
+ argTuple = new NTuple<Descriptor>();
+ }
+
+ addArgIdxMap(min, idx, argTuple);
+
FlowNode paramNode = calleeFlowGraph.getParamFlowNode(idx);
if (hasInFlowTo(calleeFlowGraph, paramNode, calleeReturnSet)
|| calleeMethodDesc.getModifiers().isNative()) {
// propagateFlowsFromCallee(min, md, min.getMethod());
+ System.out.println("min nodeSet=" + nodeSet);
}
}
private boolean hasInFlowTo(FlowGraph fg, FlowNode inNode, Set<FlowNode> nodeSet) {
// return true if inNode has in-flows to nodeSet
- Set<FlowNode> reachableSet = fg.getReachFlowNodeSetFrom(inNode);
+
+ // Set<FlowNode> reachableSet = fg.getReachFlowNodeSetFrom(inNode);
+ Set<FlowNode> reachableSet = fg.getReachableSetFrom(inNode.getDescTuple());
+ System.out.println("inNode=" + inNode + " reachalbeSet=" + reachableSet);
+
for (Iterator iterator = reachableSet.iterator(); iterator.hasNext();) {
FlowNode fn = (FlowNode) iterator.next();
if (nodeSet.contains(fn)) {
return false;
}
- private NodeTupleSet getNodeTupleSetByArgIdx(MethodInvokeNode min, int idx) {
+ private NTuple<Descriptor> getNodeTupleByArgIdx(MethodInvokeNode min, int idx) {
return mapMethodInvokeNodeToArgIdxMap.get(min).get(new Integer(idx));
}
- private void addArgIdxMap(MethodInvokeNode min, int idx, NodeTupleSet tupleSet) {
- Map<Integer, NodeTupleSet> mapIdxToTupleSet = mapMethodInvokeNodeToArgIdxMap.get(min);
- if (mapIdxToTupleSet == null) {
- mapIdxToTupleSet = new HashMap<Integer, NodeTupleSet>();
- mapMethodInvokeNodeToArgIdxMap.put(min, mapIdxToTupleSet);
- }
- mapIdxToTupleSet.put(new Integer(idx), tupleSet);
- }
-
- private void analyzeFlowMethodParameters(MethodDescriptor callermd, SymbolTable nametable,
- MethodInvokeNode min, NodeTupleSet nodeSet) {
-
- if (min.numArgs() > 0) {
-
- int offset;
- if (min.getMethod().isStatic()) {
- offset = 0;
- } else {
- offset = 1;
- // NTuple<Descriptor> thisArgTuple = new NTuple<Descriptor>();
- // thisArgTuple.add(callermd.getThis());
- // NodeTupleSet argTupleSet = new NodeTupleSet();
- // argTupleSet.addTuple(thisArgTuple);
- // addArgIdxMap(min, 0, argTupleSet);
- // nodeSet.addTuple(thisArgTuple);
- }
-
- for (int i = 0; i < min.numArgs(); i++) {
- ExpressionNode en = min.getArg(i);
- NodeTupleSet argTupleSet = new NodeTupleSet();
- analyzeFlowExpressionNode(callermd, nametable, en, argTupleSet, false);
- // if argument is liternal node, argTuple is set to NULL.
- addArgIdxMap(min, i + offset, argTupleSet);
- nodeSet.addTupleSet(argTupleSet);
- }
-
+ private void addArgIdxMap(MethodInvokeNode min, int idx, NTuple<Descriptor> argTuple /*
+ * NodeTupleSet
+ * tupleSet
+ */) {
+ Map<Integer, NTuple<Descriptor>> mapIdxToTuple = mapMethodInvokeNodeToArgIdxMap.get(min);
+ if (mapIdxToTuple == null) {
+ mapIdxToTuple = new HashMap<Integer, NTuple<Descriptor>>();
+ mapMethodInvokeNodeToArgIdxMap.put(min, mapIdxToTuple);
}
-
+ mapIdxToTuple.put(new Integer(idx), argTuple);
}
private void analyzeLiteralNode(MethodDescriptor md, SymbolTable nametable, LiteralNode en) {
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("-");
+ // 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) {
// if assignment contains OP+EQ operator, creates edges from LHS to LHS
}
+ public void writeInferredLatticeDotFile(ClassDescriptor cd, HierarchyGraph simpleHierarchyGraph,
+ SSJavaLattice<String> locOrder, String nameSuffix) {
+ writeInferredLatticeDotFile(cd, null, simpleHierarchyGraph, locOrder, nameSuffix);
+ }
+
+ public void writeInferredLatticeDotFile(ClassDescriptor cd, MethodDescriptor md,
+ HierarchyGraph simpleHierarchyGraph, SSJavaLattice<String> locOrder, String nameSuffix) {
+
+ String fileName = "lattice_";
+ if (md != null) {
+ fileName +=
+ cd.getSymbol().replaceAll("[\\W_]", "") + "_" + md.toString().replaceAll("[\\W_]", "");
+ } else {
+ fileName += cd.getSymbol().replaceAll("[\\W_]", "");
+ }
+
+ fileName += nameSuffix;
+
+ Set<Pair<String, String>> pairSet = locOrder.getOrderingPairSet();
+
+ Set<String> addedLocSet = new HashSet<String>();
+
+ if (pairSet.size() > 0) {
+ try {
+ BufferedWriter bw = new BufferedWriter(new FileWriter(fileName + ".dot"));
+
+ bw.write("digraph " + fileName + " {\n");
+
+ for (Iterator iterator = pairSet.iterator(); iterator.hasNext();) {
+ // pair is in the form of <higher, lower>
+ Pair<String, String> pair = (Pair<String, String>) iterator.next();
+
+ String highLocId = pair.getFirst();
+ String lowLocId = pair.getSecond();
+
+ if (!addedLocSet.contains(highLocId)) {
+ addedLocSet.add(highLocId);
+ drawNode(bw, locOrder, simpleHierarchyGraph, highLocId);
+ }
+
+ if (!addedLocSet.contains(lowLocId)) {
+ addedLocSet.add(lowLocId);
+ drawNode(bw, locOrder, simpleHierarchyGraph, lowLocId);
+ }
+
+ bw.write(highLocId + " -> " + lowLocId + ";\n");
+ }
+ bw.write("}\n");
+ bw.close();
+
+ } catch (IOException e) {
+ e.printStackTrace();
+ }
+
+ }
+
+ }
+
+ private String convertMergeSetToString(HierarchyGraph graph, Set<HNode> mergeSet) {
+ String str = "";
+ for (Iterator iterator = mergeSet.iterator(); iterator.hasNext();) {
+ HNode merged = (HNode) iterator.next();
+ if (merged.isMergeNode()) {
+ str += convertMergeSetToString(graph, graph.getMapHNodetoMergeSet().get(merged));
+ } else {
+ str += " " + merged.getName();
+ }
+ }
+ return str;
+ }
+
+ 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);
+ }
+ bw.write(locName + " [label=\"" + prettyStr + "\"]" + ";\n");
+ }
+
public void _debug_printGraph() {
Set<MethodDescriptor> keySet = mapMethodDescriptorToFlowGraph.keySet();