1 package Analysis.SSJava;
3 import java.io.IOException;
4 import java.util.ArrayList;
5 import java.util.Collection;
6 import java.util.Collections;
7 import java.util.Comparator;
8 import java.util.HashMap;
9 import java.util.HashSet;
10 import java.util.Iterator;
11 import java.util.LinkedList;
12 import java.util.List;
15 import java.util.Stack;
17 import IR.ClassDescriptor;
19 import IR.FieldDescriptor;
20 import IR.MethodDescriptor;
21 import IR.NameDescriptor;
24 import IR.SymbolTable;
25 import IR.TypeDescriptor;
26 import IR.VarDescriptor;
27 import IR.Tree.ArrayAccessNode;
28 import IR.Tree.AssignmentNode;
29 import IR.Tree.BlockExpressionNode;
30 import IR.Tree.BlockNode;
31 import IR.Tree.BlockStatementNode;
32 import IR.Tree.CastNode;
33 import IR.Tree.CreateObjectNode;
34 import IR.Tree.DeclarationNode;
35 import IR.Tree.ExpressionNode;
36 import IR.Tree.FieldAccessNode;
37 import IR.Tree.IfStatementNode;
39 import IR.Tree.LiteralNode;
40 import IR.Tree.LoopNode;
41 import IR.Tree.MethodInvokeNode;
42 import IR.Tree.NameNode;
43 import IR.Tree.OpNode;
44 import IR.Tree.ReturnNode;
45 import IR.Tree.SubBlockNode;
46 import IR.Tree.SwitchStatementNode;
47 import IR.Tree.TertiaryNode;
48 import IR.Tree.TreeNode;
51 public class LocationInference {
54 SSJavaAnalysis ssjava;
56 List<ClassDescriptor> toanalyzeList;
57 List<MethodDescriptor> toanalyzeMethodList;
58 Map<MethodDescriptor, FlowGraph> mapMethodDescriptorToFlowGraph;
60 // map a method descriptor to its set of parameter descriptors
61 Map<MethodDescriptor, Set<Descriptor>> mapMethodDescriptorToParamDescSet;
63 // keep current descriptors to visit in fixed-point interprocedural analysis,
64 private Stack<MethodDescriptor> methodDescriptorsToVisitStack;
66 // map a class descriptor to a field lattice
67 private Map<ClassDescriptor, SSJavaLattice<String>> cd2lattice;
69 // map a method descriptor to a method lattice
70 private Map<MethodDescriptor, SSJavaLattice<String>> md2lattice;
72 // map a method descriptor to the set of method invocation nodes which are
73 // invoked by the method descriptor
74 private Map<MethodDescriptor, Set<MethodInvokeNode>> mapMethodDescriptorToMethodInvokeNodeSet;
76 private Map<MethodInvokeNode, Map<Integer, NodeTupleSet>> mapMethodInvokeNodeToArgIdxMap;
78 private Map<MethodDescriptor, MethodLocationInfo> mapMethodDescToMethodLocationInfo;
80 private Map<ClassDescriptor, LocationInfo> mapClassToLocationInfo;
82 private Map<MethodDescriptor, Set<MethodDescriptor>> mapMethodToCalleeSet;
84 public static final String GLOBALLOC = "GLOBALLOC";
86 public static final String TOPLOC = "TOPLOC";
88 public static final Descriptor GLOBALDESC = new NameDescriptor(GLOBALLOC);
90 public static final Descriptor TOPDESC = new NameDescriptor(TOPLOC);
92 LocationInfo curMethodInfo;
96 public LocationInference(SSJavaAnalysis ssjava, State state) {
99 this.toanalyzeList = new ArrayList<ClassDescriptor>();
100 this.toanalyzeMethodList = new ArrayList<MethodDescriptor>();
101 this.mapMethodDescriptorToFlowGraph = new HashMap<MethodDescriptor, FlowGraph>();
102 this.cd2lattice = new HashMap<ClassDescriptor, SSJavaLattice<String>>();
103 this.md2lattice = new HashMap<MethodDescriptor, SSJavaLattice<String>>();
104 this.methodDescriptorsToVisitStack = new Stack<MethodDescriptor>();
105 this.mapMethodDescriptorToMethodInvokeNodeSet =
106 new HashMap<MethodDescriptor, Set<MethodInvokeNode>>();
107 this.mapMethodInvokeNodeToArgIdxMap =
108 new HashMap<MethodInvokeNode, Map<Integer, NodeTupleSet>>();
109 this.mapMethodDescToMethodLocationInfo = new HashMap<MethodDescriptor, MethodLocationInfo>();
110 this.mapMethodToCalleeSet = new HashMap<MethodDescriptor, Set<MethodDescriptor>>();
111 this.mapClassToLocationInfo = new HashMap<ClassDescriptor, LocationInfo>();
114 public void setupToAnalyze() {
115 SymbolTable classtable = state.getClassSymbolTable();
116 toanalyzeList.clear();
117 toanalyzeList.addAll(classtable.getValueSet());
118 Collections.sort(toanalyzeList, new Comparator<ClassDescriptor>() {
119 public int compare(ClassDescriptor o1, ClassDescriptor o2) {
120 return o1.getClassName().compareToIgnoreCase(o2.getClassName());
125 public void setupToAnalazeMethod(ClassDescriptor cd) {
127 SymbolTable methodtable = cd.getMethodTable();
128 toanalyzeMethodList.clear();
129 toanalyzeMethodList.addAll(methodtable.getValueSet());
130 Collections.sort(toanalyzeMethodList, new Comparator<MethodDescriptor>() {
131 public int compare(MethodDescriptor o1, MethodDescriptor o2) {
132 return o1.getSymbol().compareToIgnoreCase(o2.getSymbol());
137 public boolean toAnalyzeMethodIsEmpty() {
138 return toanalyzeMethodList.isEmpty();
141 public boolean toAnalyzeIsEmpty() {
142 return toanalyzeList.isEmpty();
145 public ClassDescriptor toAnalyzeNext() {
146 return toanalyzeList.remove(0);
149 public MethodDescriptor toAnalyzeMethodNext() {
150 return toanalyzeMethodList.remove(0);
153 public void inference() {
155 // 1) construct value flow graph
156 constructFlowGraph();
158 // 2) construct lattices
163 debug_writeLatticeDotFile();
165 // 3) check properties
170 private void simplifyLattices() {
172 // generate lattice dot file
175 while (!toAnalyzeIsEmpty()) {
176 ClassDescriptor cd = toAnalyzeNext();
178 setupToAnalazeMethod(cd);
180 SSJavaLattice<String> classLattice = cd2lattice.get(cd);
181 if (classLattice != null) {
182 classLattice.removeRedundantEdges();
185 while (!toAnalyzeMethodIsEmpty()) {
186 MethodDescriptor md = toAnalyzeMethodNext();
187 if (ssjava.needTobeAnnotated(md)) {
188 SSJavaLattice<String> methodLattice = md2lattice.get(md);
189 if (methodLattice != null) {
190 methodLattice.removeRedundantEdges();
198 private void checkLattices() {
200 LinkedList<MethodDescriptor> descriptorListToAnalyze = ssjava.getSortedDescriptors();
202 // current descriptors to visit in fixed-point interprocedural analysis,
204 // dependency in the call graph
205 methodDescriptorsToVisitStack.clear();
207 descriptorListToAnalyze.removeFirst();
209 Set<MethodDescriptor> methodDescriptorToVistSet = new HashSet<MethodDescriptor>();
210 methodDescriptorToVistSet.addAll(descriptorListToAnalyze);
212 while (!descriptorListToAnalyze.isEmpty()) {
213 MethodDescriptor md = descriptorListToAnalyze.removeFirst();
214 checkLatticesOfVirtualMethods(md);
219 private void debug_writeLatticeDotFile() {
220 // generate lattice dot file
224 while (!toAnalyzeIsEmpty()) {
225 ClassDescriptor cd = toAnalyzeNext();
227 setupToAnalazeMethod(cd);
229 SSJavaLattice<String> classLattice = cd2lattice.get(cd);
230 if (classLattice != null) {
231 ssjava.writeLatticeDotFile(cd, null, classLattice);
232 debug_printDescriptorToLocNameMapping(cd);
235 while (!toAnalyzeMethodIsEmpty()) {
236 MethodDescriptor md = toAnalyzeMethodNext();
237 if (ssjava.needTobeAnnotated(md)) {
238 SSJavaLattice<String> methodLattice = md2lattice.get(md);
239 if (methodLattice != null) {
240 ssjava.writeLatticeDotFile(cd, md, methodLattice);
241 debug_printDescriptorToLocNameMapping(md);
249 private void debug_printDescriptorToLocNameMapping(Descriptor desc) {
251 LocationInfo info = getLocationInfo(desc);
252 System.out.println("## " + desc + " ##");
253 System.out.println(info.getMapDescToInferLocation());
254 LocationInfo locInfo = getLocationInfo(desc);
255 System.out.println("mapping=" + locInfo.getMapLocSymbolToDescSet());
256 System.out.println("###################");
260 private void inferLattices() {
262 // do fixed-point analysis
264 LinkedList<MethodDescriptor> descriptorListToAnalyze = ssjava.getSortedDescriptors();
266 Collections.sort(descriptorListToAnalyze, new Comparator<MethodDescriptor>() {
267 public int compare(MethodDescriptor o1, MethodDescriptor o2) {
268 return o1.getSymbol().compareToIgnoreCase(o2.getSymbol());
272 // current descriptors to visit in fixed-point interprocedural analysis,
274 // dependency in the call graph
275 methodDescriptorsToVisitStack.clear();
277 descriptorListToAnalyze.removeFirst();
279 Set<MethodDescriptor> methodDescriptorToVistSet = new HashSet<MethodDescriptor>();
280 methodDescriptorToVistSet.addAll(descriptorListToAnalyze);
282 while (!descriptorListToAnalyze.isEmpty()) {
283 MethodDescriptor md = descriptorListToAnalyze.removeFirst();
284 methodDescriptorsToVisitStack.add(md);
287 // analyze scheduled methods until there are no more to visit
288 while (!methodDescriptorsToVisitStack.isEmpty()) {
289 // start to analyze leaf node
290 MethodDescriptor md = methodDescriptorsToVisitStack.pop();
292 SSJavaLattice<String> methodLattice =
293 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
295 MethodLocationInfo methodInfo = new MethodLocationInfo(md);
296 curMethodInfo = methodInfo;
298 System.out.println();
299 System.out.println("SSJAVA: Inferencing the lattice from " + md);
302 analyzeMethodLattice(md, methodLattice, methodInfo);
303 } catch (CyclicFlowException e) {
304 throw new Error("Fail to generate the method lattice for " + md);
307 SSJavaLattice<String> prevMethodLattice = getMethodLattice(md);
308 MethodLocationInfo prevMethodInfo = getMethodLocationInfo(md);
310 if ((!methodLattice.equals(prevMethodLattice)) || (!methodInfo.equals(prevMethodInfo))) {
312 setMethodLattice(md, methodLattice);
313 setMethodLocInfo(md, methodInfo);
315 // results for callee changed, so enqueue dependents caller for
317 Iterator<MethodDescriptor> depsItr = ssjava.getDependents(md).iterator();
318 while (depsItr.hasNext()) {
319 MethodDescriptor methodNext = depsItr.next();
320 if (!methodDescriptorsToVisitStack.contains(methodNext)
321 && methodDescriptorToVistSet.contains(methodNext)) {
322 methodDescriptorsToVisitStack.add(methodNext);
331 private void setMethodLocInfo(MethodDescriptor md, MethodLocationInfo methodInfo) {
332 mapMethodDescToMethodLocationInfo.put(md, methodInfo);
335 private void checkLatticesOfVirtualMethods(MethodDescriptor md) {
337 if (!md.isStatic()) {
338 Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
339 setPossibleCallees.addAll(ssjava.getCallGraph().getMethods(md));
341 for (Iterator iterator = setPossibleCallees.iterator(); iterator.hasNext();) {
342 MethodDescriptor mdCallee = (MethodDescriptor) iterator.next();
343 if (!md.equals(mdCallee)) {
344 checkConsistency(md, mdCallee);
352 private void checkConsistency(MethodDescriptor md1, MethodDescriptor md2) {
354 // check that two lattice have the same relations between parameters(+PC
355 // LOC, GLOBAL_LOC RETURN LOC)
357 List<CompositeLocation> list1 = new ArrayList<CompositeLocation>();
358 List<CompositeLocation> list2 = new ArrayList<CompositeLocation>();
360 MethodLocationInfo locInfo1 = getMethodLocationInfo(md1);
361 MethodLocationInfo locInfo2 = getMethodLocationInfo(md2);
363 Map<Integer, CompositeLocation> paramMap1 = locInfo1.getMapParamIdxToInferLoc();
364 Map<Integer, CompositeLocation> paramMap2 = locInfo2.getMapParamIdxToInferLoc();
366 int numParam = locInfo1.getMapParamIdxToInferLoc().keySet().size();
368 // add location types of paramters
369 for (int idx = 0; idx < numParam; idx++) {
370 list1.add(paramMap1.get(Integer.valueOf(idx)));
371 list2.add(paramMap2.get(Integer.valueOf(idx)));
374 // add program counter location
375 list1.add(locInfo1.getPCLoc());
376 list2.add(locInfo2.getPCLoc());
378 if (!md1.getReturnType().isVoid()) {
379 // add return value location
380 CompositeLocation rtrLoc1 =
381 new CompositeLocation(new Location(md1, locInfo1.getReturnLocName()));
382 CompositeLocation rtrLoc2 =
383 new CompositeLocation(new Location(md2, locInfo2.getReturnLocName()));
388 // add global location type
389 if (md1.isStatic()) {
390 CompositeLocation globalLoc1 =
391 new CompositeLocation(new Location(md1, locInfo1.getGlobalLocName()));
392 CompositeLocation globalLoc2 =
393 new CompositeLocation(new Location(md2, locInfo2.getGlobalLocName()));
394 list1.add(globalLoc1);
395 list2.add(globalLoc2);
398 for (int i = 0; i < list1.size(); i++) {
399 CompositeLocation locA1 = list1.get(i);
400 CompositeLocation locA2 = list2.get(i);
401 for (int k = 0; k < list1.size(); k++) {
403 CompositeLocation locB1 = list1.get(k);
404 CompositeLocation locB2 = list2.get(k);
405 boolean r1 = isGreaterThan(getLattice(md1), locA1, locB1);
407 boolean r2 = isGreaterThan(getLattice(md1), locA2, locB2);
410 throw new Error("The method " + md1 + " is not consistent with the method " + md2
411 + ".:: They have a different ordering relation between locations (" + locA1 + ","
412 + locB1 + ") and (" + locA2 + "," + locB2 + ").");
420 private String getSymbol(int idx, FlowNode node) {
421 Descriptor desc = node.getDescTuple().get(idx);
422 return desc.getSymbol();
425 private Descriptor getDescriptor(int idx, FlowNode node) {
426 Descriptor desc = node.getDescTuple().get(idx);
430 private void analyzeMethodLattice(MethodDescriptor md, SSJavaLattice<String> methodLattice,
431 MethodLocationInfo methodInfo) throws CyclicFlowException {
433 // first take a look at method invocation nodes to newly added relations
435 analyzeLatticeMethodInvocationNode(md, methodLattice, methodInfo);
437 if (!md.isStatic()) {
438 // set the this location
439 String thisLocSymbol = md.getThis().getSymbol();
440 methodInfo.setThisLocName(thisLocSymbol);
443 // set the global location
444 methodInfo.setGlobalLocName(LocationInference.GLOBALLOC);
445 methodInfo.mapDescriptorToLocation(GLOBALDESC, new CompositeLocation(
446 new Location(md, GLOBALLOC)));
448 // visit each node of method flow graph
449 FlowGraph fg = getFlowGraph(md);
450 Set<FlowNode> nodeSet = fg.getNodeSet();
452 // for the method lattice, we need to look at the first element of
453 // NTuple<Descriptor>
454 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
455 FlowNode srcNode = (FlowNode) iterator.next();
457 Set<FlowEdge> outEdgeSet = srcNode.getOutEdgeSet();
458 for (Iterator iterator2 = outEdgeSet.iterator(); iterator2.hasNext();) {
459 FlowEdge outEdge = (FlowEdge) iterator2.next();
460 FlowNode dstNode = outEdge.getDst();
462 NTuple<Descriptor> srcNodeTuple = srcNode.getDescTuple();
463 NTuple<Descriptor> dstNodeTuple = dstNode.getDescTuple();
465 if (outEdge.getInitTuple().equals(srcNodeTuple)
466 && outEdge.getEndTuple().equals(dstNodeTuple)) {
468 if ((srcNodeTuple.size() > 1 && dstNodeTuple.size() > 1)
469 && srcNodeTuple.get(0).equals(dstNodeTuple.get(0))) {
471 // value flows between fields
472 Descriptor desc = srcNodeTuple.get(0);
473 ClassDescriptor classDesc;
475 if (desc.equals(GLOBALDESC)) {
476 classDesc = md.getClassDesc();
478 VarDescriptor varDesc = (VarDescriptor) srcNodeTuple.get(0);
479 classDesc = varDesc.getType().getClassDesc();
482 extractRelationFromFieldFlows(classDesc, srcNode, dstNode, 1);
484 } else if (srcNodeTuple.size() == 1 || dstNodeTuple.size() == 1) {
485 // for the method lattice, we need to look at the first element of
486 // NTuple<Descriptor>
487 // in this case, take a look at connected nodes at the local level
488 addRelationToLattice(md, methodLattice, methodInfo, srcNode, dstNode);
491 if (!srcNode.getDescTuple().get(0).equals(dstNode.getDescTuple().get(0))) {
492 // in this case, take a look at connected nodes at the local level
493 addRelationToLattice(md, methodLattice, methodInfo, srcNode, dstNode);
495 Descriptor srcDesc = srcNode.getDescTuple().get(0);
496 Descriptor dstDesc = dstNode.getDescTuple().get(0);
497 recursivelyAddCompositeRelation(md, fg, methodInfo, srcNode, dstNode, srcDesc,
499 // recursiveAddRelationToLattice(1, md, srcNode, dstNode);
507 // create mapping from param idx to inferred composite location
510 if (!md.isStatic()) {
511 // add 'this' reference location
513 methodInfo.addMapParamIdxToInferLoc(0, methodInfo.getInferLocation(md.getThis()));
518 for (int idx = 0; idx < md.numParameters(); idx++) {
519 Descriptor paramDesc = md.getParameter(idx);
520 CompositeLocation inferParamLoc = methodInfo.getInferLocation(paramDesc);
521 methodInfo.addMapParamIdxToInferLoc(idx + offset, inferParamLoc);
524 // calculate the initial program counter location
525 // PC location is higher than location types of all parameters
526 String pcLocSymbol = "PCLOC";
527 Map<Integer, CompositeLocation> mapParamToLoc = methodInfo.getMapParamIdxToInferLoc();
528 Set<Integer> keySet = mapParamToLoc.keySet();
529 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
530 Integer paramIdx = (Integer) iterator.next();
531 CompositeLocation inferLoc = mapParamToLoc.get(paramIdx);
532 String paramLocLocalSymbol = inferLoc.get(0).getLocIdentifier();
533 if (!methodLattice.isGreaterThan(pcLocSymbol, paramLocLocalSymbol)) {
534 addRelationHigherToLower(methodLattice, methodInfo, pcLocSymbol, paramLocLocalSymbol);
538 // calculate a return location
539 // the return location type is lower than all parameters
540 if (!md.getReturnType().isVoid()) {
542 String returnLocSymbol = "RETURNLOC";
544 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
545 Integer paramIdx = (Integer) iterator.next();
546 CompositeLocation inferLoc = mapParamToLoc.get(paramIdx);
547 String paramLocLocalSymbol = inferLoc.get(0).getLocIdentifier();
548 if (!methodLattice.isGreaterThan(paramLocLocalSymbol, returnLocSymbol)) {
549 addRelationHigherToLower(methodLattice, methodInfo, paramLocLocalSymbol, returnLocSymbol);
556 private boolean isGreaterThan(SSJavaLattice<String> methodLattice, CompositeLocation comp1,
557 CompositeLocation comp2) {
559 int size = comp1.getSize() >= comp2.getSize() ? comp2.getSize() : comp1.getSize();
561 for (int idx = 0; idx < size; idx++) {
562 Location loc1 = comp1.get(idx);
563 Location loc2 = comp2.get(idx);
565 Descriptor desc1 = loc1.getDescriptor();
566 Descriptor desc2 = loc2.getDescriptor();
568 if (!desc1.equals(desc2)) {
569 throw new Error("Fail to compare " + comp1 + " and " + comp2);
572 String symbol1 = loc1.getLocIdentifier();
573 String symbol2 = loc2.getLocIdentifier();
575 SSJavaLattice<String> lattice;
577 lattice = methodLattice;
579 lattice = getLattice(desc1);
581 if (symbol1.equals(symbol2)) {
583 } else if (lattice.isGreaterThan(symbol1, symbol2)) {
594 private void recursiveAddRelationToLattice(int idx, MethodDescriptor md,
595 CompositeLocation srcInferLoc, CompositeLocation dstInferLoc) throws CyclicFlowException {
597 String srcLocSymbol = srcInferLoc.get(idx).getLocIdentifier();
598 String dstLocSymbol = dstInferLoc.get(idx).getLocIdentifier();
600 if (srcLocSymbol.equals(dstLocSymbol)) {
601 recursiveAddRelationToLattice(idx + 1, md, srcInferLoc, dstInferLoc);
604 Descriptor parentDesc = srcInferLoc.get(idx).getDescriptor();
605 LocationInfo locInfo = getLocationInfo(parentDesc);
607 addRelationHigherToLower(getLattice(parentDesc), getLocationInfo(parentDesc), srcLocSymbol,
613 private void analyzeLatticeMethodInvocationNode(MethodDescriptor mdCaller,
614 SSJavaLattice<String> methodLattice, MethodLocationInfo methodInfo)
615 throws CyclicFlowException {
617 // the transformation for a call site propagates all relations between
618 // parameters from the callee
619 // if the method is virtual, it also grab all relations from any possible
622 Set<MethodInvokeNode> setMethodInvokeNode =
623 mapMethodDescriptorToMethodInvokeNodeSet.get(mdCaller);
625 if (setMethodInvokeNode != null) {
627 for (Iterator iterator = setMethodInvokeNode.iterator(); iterator.hasNext();) {
628 MethodInvokeNode min = (MethodInvokeNode) iterator.next();
629 MethodDescriptor mdCallee = min.getMethod();
630 Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
631 if (mdCallee.isStatic()) {
632 setPossibleCallees.add(mdCallee);
634 Set<MethodDescriptor> calleeSet = ssjava.getCallGraph().getMethods(mdCallee);
635 // removes method descriptors that are not invoked by the caller
636 calleeSet.retainAll(mapMethodToCalleeSet.get(mdCaller));
637 setPossibleCallees.addAll(calleeSet);
640 for (Iterator iterator2 = setPossibleCallees.iterator(); iterator2.hasNext();) {
641 MethodDescriptor possibleMdCallee = (MethodDescriptor) iterator2.next();
642 propagateRelationToCaller(min, mdCaller, possibleMdCallee, methodLattice, methodInfo);
650 private void propagateRelationToCaller(MethodInvokeNode min, MethodDescriptor mdCaller,
651 MethodDescriptor possibleMdCallee, SSJavaLattice<String> methodLattice,
652 MethodLocationInfo methodInfo) throws CyclicFlowException {
654 SSJavaLattice<String> calleeLattice = getMethodLattice(possibleMdCallee);
655 MethodLocationInfo calleeLocInfo = getMethodLocationInfo(possibleMdCallee);
656 FlowGraph calleeFlowGraph = getFlowGraph(possibleMdCallee);
658 int numParam = calleeLocInfo.getNumParam();
659 for (int i = 0; i < numParam; i++) {
660 CompositeLocation param1 = calleeLocInfo.getParamCompositeLocation(i);
661 for (int k = 0; k < numParam; k++) {
663 CompositeLocation param2 = calleeLocInfo.getParamCompositeLocation(k);
664 if (isGreaterThan(getLattice(possibleMdCallee), param1, param2)) {
665 NodeTupleSet argDescTupleSet1 = getNodeTupleSetByArgIdx(min, i);
666 NodeTupleSet argDescTupleSet2 = getNodeTupleSetByArgIdx(min, k);
668 // the callee has the relation in which param1 is higher than param2
669 // therefore, the caller has to have the relation in which arg1 is
672 for (Iterator<NTuple<Descriptor>> iterator = argDescTupleSet1.iterator(); iterator
674 NTuple<Descriptor> argDescTuple1 = iterator.next();
676 for (Iterator<NTuple<Descriptor>> iterator2 = argDescTupleSet2.iterator(); iterator2
678 NTuple<Descriptor> argDescTuple2 = iterator2.next();
680 // retreive inferred location by the local var descriptor
682 NTuple<Location> tuple1 = getFlowGraph(mdCaller).getLocationTuple(argDescTuple1);
683 NTuple<Location> tuple2 = getFlowGraph(mdCaller).getLocationTuple(argDescTuple2);
685 // CompositeLocation higherInferLoc =
686 // methodInfo.getInferLocation(argTuple1.get(0));
687 // CompositeLocation lowerInferLoc =
688 // methodInfo.getInferLocation(argTuple2.get(0));
690 CompositeLocation inferLoc1 = generateInferredCompositeLocation(methodInfo, tuple1);
691 CompositeLocation inferLoc2 = generateInferredCompositeLocation(methodInfo, tuple2);
693 addRelation(methodLattice, methodInfo, inferLoc1, inferLoc2);
706 private CompositeLocation generateInferredCompositeLocation(MethodLocationInfo methodInfo,
707 NTuple<Location> tuple) {
709 // first, retrieve inferred location by the local var descriptor
710 CompositeLocation inferLoc = new CompositeLocation();
712 CompositeLocation localVarInferLoc =
713 methodInfo.getInferLocation(tuple.get(0).getLocDescriptor());
715 for (int i = 0; i < localVarInferLoc.getSize(); i++) {
716 inferLoc.addLocation(localVarInferLoc.get(i));
719 for (int i = 1; i < tuple.size(); i++) {
720 Location cur = tuple.get(i);
721 Descriptor enclosingDesc = cur.getDescriptor();
722 Descriptor curDesc = cur.getLocDescriptor();
724 String fieldLocSymbol =
725 getLocationInfo(enclosingDesc).getInferLocation(curDesc).get(0).getLocIdentifier();
726 Location inferLocElement = new Location(enclosingDesc, fieldLocSymbol);
728 inferLoc.addLocation(inferLocElement);
735 private void addRelation(SSJavaLattice<String> methodLattice, MethodLocationInfo methodInfo,
736 CompositeLocation srcInferLoc, CompositeLocation dstInferLoc) throws CyclicFlowException {
738 System.out.println("--- srcInferLoc=" + srcInferLoc + " dstInferLoc=" + dstInferLoc);
739 String srcLocalLocSymbol = srcInferLoc.get(0).getLocIdentifier();
740 String dstLocalLocSymbol = dstInferLoc.get(0).getLocIdentifier();
742 if (srcInferLoc.getSize() == 1 && dstInferLoc.getSize() == 1) {
743 // add a new relation to the local lattice
744 addRelationHigherToLower(methodLattice, methodInfo, srcLocalLocSymbol, dstLocalLocSymbol);
745 } else if (srcInferLoc.getSize() > 1 && dstInferLoc.getSize() > 1) {
746 // both src and dst have assigned to a composite location
748 if (!srcLocalLocSymbol.equals(dstLocalLocSymbol)) {
749 addRelationHigherToLower(methodLattice, methodInfo, srcLocalLocSymbol, dstLocalLocSymbol);
751 recursivelyAddRelation(1, srcInferLoc, dstInferLoc);
754 // either src or dst has assigned to a composite location
755 if (!srcLocalLocSymbol.equals(dstLocalLocSymbol)) {
756 addRelationHigherToLower(methodLattice, methodInfo, srcLocalLocSymbol, dstLocalLocSymbol);
760 System.out.println();
764 public LocationInfo getLocationInfo(Descriptor d) {
765 if (d instanceof MethodDescriptor) {
766 return getMethodLocationInfo((MethodDescriptor) d);
768 return getFieldLocationInfo((ClassDescriptor) d);
772 private MethodLocationInfo getMethodLocationInfo(MethodDescriptor md) {
774 if (!mapMethodDescToMethodLocationInfo.containsKey(md)) {
775 mapMethodDescToMethodLocationInfo.put(md, new MethodLocationInfo(md));
778 return mapMethodDescToMethodLocationInfo.get(md);
782 private LocationInfo getFieldLocationInfo(ClassDescriptor cd) {
784 if (!mapClassToLocationInfo.containsKey(cd)) {
785 mapClassToLocationInfo.put(cd, new LocationInfo(cd));
788 return mapClassToLocationInfo.get(cd);
792 private void addRelationToLattice(MethodDescriptor md, SSJavaLattice<String> methodLattice,
793 MethodLocationInfo methodInfo, FlowNode srcNode, FlowNode dstNode) throws CyclicFlowException {
795 System.out.println();
796 System.out.println("### addRelationToLattice src=" + srcNode + " dst=" + dstNode);
798 // add a new binary relation of dstNode < srcNode
799 FlowGraph flowGraph = getFlowGraph(md);
801 calculateCompositeLocation(flowGraph, methodLattice, methodInfo, srcNode);
803 CompositeLocation srcInferLoc =
804 generateInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(srcNode));
805 CompositeLocation dstInferLoc =
806 generateInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(dstNode));
809 addRelation(methodLattice, methodInfo, srcInferLoc, dstInferLoc);
810 } catch (CyclicFlowException e) {
811 // there is a cyclic value flow... try to calculate a composite location
812 // for the destination node
813 calculateCompositeLocation(flowGraph, methodLattice, methodInfo, dstNode);
815 generateInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(dstNode));
817 addRelation(methodLattice, methodInfo, srcInferLoc, dstInferLoc);
818 } catch (CyclicFlowException e1) {
819 throw new Error("Failed to merge cyclic value flows into a shared location.");
825 private void recursivelyAddRelation(int idx, CompositeLocation srcInferLoc,
826 CompositeLocation dstInferLoc) throws CyclicFlowException {
828 String srcLocSymbol = srcInferLoc.get(idx).getLocIdentifier();
829 String dstLocSymbol = dstInferLoc.get(idx).getLocIdentifier();
831 Descriptor parentDesc = srcInferLoc.get(idx).getDescriptor();
833 if (srcLocSymbol.equals(dstLocSymbol)) {
834 // check if it is the case of shared location
835 if (srcInferLoc.getSize() == (idx + 1) && dstInferLoc.getSize() == (idx + 1)) {
836 Location inferLocElement = srcInferLoc.get(idx);
837 getLattice(inferLocElement.getDescriptor())
838 .addSharedLoc(inferLocElement.getLocIdentifier());
839 } else if (srcInferLoc.getSize() > (idx + 1) && dstInferLoc.getSize() > (idx + 1)) {
840 recursivelyAddRelation(idx + 1, srcInferLoc, dstInferLoc);
843 addRelationHigherToLower(getLattice(parentDesc), getLocationInfo(parentDesc), srcLocSymbol,
848 private void recursivelyAddCompositeRelation(MethodDescriptor md, FlowGraph flowGraph,
849 MethodLocationInfo methodInfo, FlowNode srcNode, FlowNode dstNode, Descriptor srcDesc,
850 Descriptor dstDesc) throws CyclicFlowException {
852 CompositeLocation inferSrcLoc;
853 CompositeLocation inferDstLoc = methodInfo.getInferLocation(dstDesc);
855 if (srcNode.getDescTuple().size() > 1) {
857 inferSrcLoc = new CompositeLocation();
859 NTuple<Location> locTuple = flowGraph.getLocationTuple(srcNode);
860 for (int i = 0; i < locTuple.size(); i++) {
861 inferSrcLoc.addLocation(locTuple.get(i));
865 inferSrcLoc = methodInfo.getInferLocation(srcDesc);
868 if (dstNode.getDescTuple().size() > 1) {
870 inferDstLoc = new CompositeLocation();
872 NTuple<Location> locTuple = flowGraph.getLocationTuple(dstNode);
873 for (int i = 0; i < locTuple.size(); i++) {
874 inferDstLoc.addLocation(locTuple.get(i));
878 inferDstLoc = methodInfo.getInferLocation(dstDesc);
881 recursiveAddRelationToLattice(1, md, inferSrcLoc, inferDstLoc);
884 private void addPrefixMapping(Map<NTuple<Location>, Set<NTuple<Location>>> map,
885 NTuple<Location> prefix, NTuple<Location> element) {
887 if (!map.containsKey(prefix)) {
888 map.put(prefix, new HashSet<NTuple<Location>>());
890 map.get(prefix).add(element);
893 private boolean calculateCompositeLocation(FlowGraph flowGraph,
894 SSJavaLattice<String> methodLattice, MethodLocationInfo methodInfo, FlowNode flowNode)
895 throws CyclicFlowException {
897 Descriptor localVarDesc = flowNode.getDescTuple().get(0);
899 Set<FlowNode> inNodeSet = flowGraph.getIncomingFlowNodeSet(flowNode);
900 Set<FlowNode> reachableNodeSet = flowGraph.getReachableFlowNodeSet(flowNode);
902 Map<NTuple<Location>, Set<NTuple<Location>>> mapPrefixToIncomingLocTupleSet =
903 new HashMap<NTuple<Location>, Set<NTuple<Location>>>();
905 Set<FlowNode> localInNodeSet = new HashSet<FlowNode>();
906 Set<FlowNode> localOutNodeSet = new HashSet<FlowNode>();
908 CompositeLocation flowNodeInferLoc =
909 generateInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(flowNode));
911 List<NTuple<Location>> prefixList = new ArrayList<NTuple<Location>>();
913 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
914 FlowNode inNode = (FlowNode) iterator.next();
915 NTuple<Location> inTuple = flowGraph.getLocationTuple(inNode);
917 if (inTuple.size() > 1) {
918 for (int i = 1; i < inTuple.size(); i++) {
919 NTuple<Location> prefix = inTuple.subList(0, i);
920 if (!prefixList.contains(prefix)) {
921 prefixList.add(prefix);
923 addPrefixMapping(mapPrefixToIncomingLocTupleSet, prefix, inTuple);
926 localInNodeSet.add(inNode);
930 Collections.sort(prefixList, new Comparator<NTuple<Location>>() {
931 public int compare(NTuple<Location> arg0, NTuple<Location> arg1) {
932 int s0 = arg0.size();
933 int s1 = arg1.size();
936 } else if (s0 == s1) {
944 for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
945 FlowNode reachableNode = (FlowNode) iterator2.next();
946 if (reachableNode.getDescTuple().size() == 1) {
947 localOutNodeSet.add(reachableNode);
951 // find out reachable nodes that have the longest common prefix
952 for (int i = 0; i < prefixList.size(); i++) {
953 NTuple<Location> curPrefix = prefixList.get(i);
954 Set<NTuple<Location>> reachableCommonPrefixSet = new HashSet<NTuple<Location>>();
956 for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
957 FlowNode reachableNode = (FlowNode) iterator2.next();
958 NTuple<Location> reachLocTuple = flowGraph.getLocationTuple(reachableNode);
959 if (reachLocTuple.startsWith(curPrefix)) {
960 reachableCommonPrefixSet.add(reachLocTuple);
964 // check if the lattice has the relation in which higher prefix is
965 // actually lower than the current node
966 CompositeLocation prefixInferLoc = generateInferredCompositeLocation(methodInfo, curPrefix);
967 if (isGreaterThan(methodLattice, flowNodeInferLoc, prefixInferLoc)) {
968 reachableCommonPrefixSet.add(curPrefix);
971 if (!reachableCommonPrefixSet.isEmpty()) {
972 // found reachable nodes that start with the prefix curPrefix
973 // need to assign a composite location
975 // first, check if there are more than one the set of locations that has
976 // the same length of the longest reachable prefix, no way to assign
977 // a composite location to the input local var
978 prefixSanityCheck(prefixList, i, flowGraph, reachableNodeSet);
980 Set<NTuple<Location>> incomingCommonPrefixSet =
981 mapPrefixToIncomingLocTupleSet.get(curPrefix);
983 int idx = curPrefix.size();
984 NTuple<Location> element = incomingCommonPrefixSet.iterator().next();
985 Descriptor desc = element.get(idx).getDescriptor();
987 SSJavaLattice<String> lattice = getLattice(desc);
988 LocationInfo locInfo = getLocationInfo(desc);
990 // CompositeLocation inferLocation =
991 // methodInfo.getInferLocation(flowNode);
992 CompositeLocation inferLocation = methodInfo.getInferLocation(localVarDesc);
994 String newlyInsertedLocName;
995 if (inferLocation.getSize() == 1) {
996 // need to replace the old local location with a new composite
999 String oldMethodLocationSymbol = inferLocation.get(0).getLocIdentifier();
1001 String newLocSymbol = "Loc" + (SSJavaLattice.seed++);
1002 inferLocation = new CompositeLocation();
1003 for (int locIdx = 0; locIdx < curPrefix.size(); locIdx++) {
1004 inferLocation.addLocation(curPrefix.get(locIdx));
1006 Location fieldLoc = new Location(desc, newLocSymbol);
1007 inferLocation.addLocation(fieldLoc);
1009 methodInfo.mapDescriptorToLocation(localVarDesc, inferLocation);
1010 addMapLocSymbolToInferredLocation(methodInfo.md, localVarDesc, inferLocation);
1011 methodInfo.removeMaplocalVarToLocSet(localVarDesc);
1013 String newMethodLocationSymbol = curPrefix.get(0).getLocIdentifier();
1015 replaceOldLocWithNewLoc(methodLattice, oldMethodLocationSymbol, newMethodLocationSymbol);
1019 String localLocName = methodInfo.getInferLocation(localVarDesc).get(0).getLocIdentifier();
1024 newlyInsertedLocName = inferLocation.get(inferLocation.getSize() - 1).getLocIdentifier();
1026 for (Iterator iterator = incomingCommonPrefixSet.iterator(); iterator.hasNext();) {
1027 NTuple<Location> tuple = (NTuple<Location>) iterator.next();
1029 Location loc = tuple.get(idx);
1030 String higher = locInfo.getFieldInferLocation(loc.getLocDescriptor()).getLocIdentifier();
1031 System.out.println("--");
1032 System.out.println("add in-flow relation:");
1033 addRelationHigherToLower(lattice, locInfo, higher, newlyInsertedLocName);
1035 System.out.println("end of add-inflow relation");
1037 for (Iterator iterator = localInNodeSet.iterator(); iterator.hasNext();) {
1038 FlowNode localNode = (FlowNode) iterator.next();
1040 if (localNode.equals(flowNode)) {
1044 CompositeLocation inNodeInferLoc =
1045 generateInferredCompositeLocation(methodInfo, flowGraph.getLocationTuple(localNode));
1047 if (isCompositeLocation(inNodeInferLoc)) {
1048 // need to make sure that newLocSymbol is lower than the infernode
1049 // location in the field lattice
1050 System.out.println("--- srcNode=" + localNode + " dstNode=" + flowNode);
1051 addRelation(methodLattice, methodInfo, inNodeInferLoc, inferLocation);
1057 for (Iterator iterator = reachableCommonPrefixSet.iterator(); iterator.hasNext();) {
1058 NTuple<Location> tuple = (NTuple<Location>) iterator.next();
1059 if (tuple.size() > idx) {
1060 Location loc = tuple.get(idx);
1061 String lower = locInfo.getFieldInferLocation(loc.getLocDescriptor()).getLocIdentifier();
1062 // lattice.addRelationHigherToLower(newlyInsertedLocName, lower);
1063 System.out.println("add out-flow relation:");
1064 addRelationHigherToLower(lattice, locInfo, newlyInsertedLocName, lower);
1067 System.out.println("end of add out-flow relation");
1069 for (Iterator iterator = localOutNodeSet.iterator(); iterator.hasNext();) {
1070 FlowNode localOutNode = (FlowNode) iterator.next();
1072 if (localOutNode.equals(flowNode)) {
1076 CompositeLocation outNodeInferLoc =
1077 generateInferredCompositeLocation(methodInfo,
1078 flowGraph.getLocationTuple(localOutNode));
1080 if (isCompositeLocation(outNodeInferLoc)) {
1081 // need to make sure that newLocSymbol is higher than the infernode
1083 System.out.println("--- srcNode=" + flowNode + " dstNode=" + localOutNode);
1085 addRelation(methodLattice, methodInfo, inferLocation, outNodeInferLoc);
1099 private void addMapLocSymbolToInferredLocation(MethodDescriptor md, Descriptor localVar,
1100 CompositeLocation inferLoc) {
1102 Location locElement = inferLoc.get((inferLoc.getSize() - 1));
1103 Descriptor enclosingDesc = locElement.getDescriptor();
1104 LocationInfo locInfo = getLocationInfo(enclosingDesc);
1105 locInfo.addMapLocSymbolToRelatedInferLoc(locElement.getLocIdentifier(), md, localVar);
1108 private boolean isCompositeLocation(CompositeLocation cl) {
1109 return cl.getSize() > 1;
1112 private boolean containsNonPrimitiveElement(Set<Descriptor> descSet) {
1113 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
1114 Descriptor desc = (Descriptor) iterator.next();
1116 if (desc.equals(LocationInference.GLOBALDESC)) {
1118 } else if (desc instanceof VarDescriptor) {
1119 if (!((VarDescriptor) desc).getType().isPrimitive()) {
1122 } else if (desc instanceof FieldDescriptor) {
1123 if (!((FieldDescriptor) desc).getType().isPrimitive()) {
1132 private void addRelationHigherToLower(SSJavaLattice<String> lattice, LocationInfo locInfo,
1133 String higher, String lower) throws CyclicFlowException {
1135 // if (higher.equals(lower) && lattice.isSharedLoc(higher)) {
1138 Set<String> cycleElementSet = lattice.getPossibleCycleElements(higher, lower);
1140 boolean hasNonPrimitiveElement = false;
1141 for (Iterator iterator = cycleElementSet.iterator(); iterator.hasNext();) {
1142 String cycleElementLocSymbol = (String) iterator.next();
1144 Set<Descriptor> descSet = locInfo.getDescSet(cycleElementLocSymbol);
1145 if (containsNonPrimitiveElement(descSet)) {
1146 hasNonPrimitiveElement = true;
1151 if (hasNonPrimitiveElement) {
1152 System.out.println("#Check cycle= " + lower + " < " + higher + " cycleElementSet="
1154 // if there is non-primitive element in the cycle, no way to merge cyclic
1155 // elements into the shared location
1156 throw new CyclicFlowException();
1159 if (cycleElementSet.size() > 0) {
1161 String newSharedLoc = "SharedLoc" + (SSJavaLattice.seed++);
1163 lattice.mergeIntoSharedLocation(cycleElementSet, newSharedLoc);
1165 for (Iterator iterator = cycleElementSet.iterator(); iterator.hasNext();) {
1166 String oldLocSymbol = (String) iterator.next();
1168 Set<Pair<Descriptor, Descriptor>> inferLocSet = locInfo.getRelatedInferLocSet(oldLocSymbol);
1169 for (Iterator iterator2 = inferLocSet.iterator(); iterator2.hasNext();) {
1170 Pair<Descriptor, Descriptor> pair = (Pair<Descriptor, Descriptor>) iterator2.next();
1171 Descriptor enclosingDesc = pair.getFirst();
1172 Descriptor desc = pair.getSecond();
1174 CompositeLocation inferLoc;
1175 if (curMethodInfo.md.equals(enclosingDesc)) {
1176 inferLoc = curMethodInfo.getInferLocation(desc);
1178 inferLoc = getLocationInfo(enclosingDesc).getInferLocation(desc);
1181 Location locElement = inferLoc.get(inferLoc.getSize() - 1);
1183 locElement.setLocIdentifier(newSharedLoc);
1184 locInfo.addMapLocSymbolToRelatedInferLoc(newSharedLoc, enclosingDesc, desc);
1187 locInfo.removeRelatedInferLocSet(oldLocSymbol, newSharedLoc);
1191 lattice.addSharedLoc(newSharedLoc);
1193 } else if (!lattice.isGreaterThan(higher, lower)) {
1194 lattice.addRelationHigherToLower(higher, lower);
1198 private void replaceOldLocWithNewLoc(SSJavaLattice<String> methodLattice, String oldLocSymbol,
1199 String newLocSymbol) {
1201 if (methodLattice.containsKey(oldLocSymbol)) {
1202 methodLattice.substituteLocation(oldLocSymbol, newLocSymbol);
1207 private void prefixSanityCheck(List<NTuple<Location>> prefixList, int curIdx,
1208 FlowGraph flowGraph, Set<FlowNode> reachableNodeSet) {
1210 NTuple<Location> curPrefix = prefixList.get(curIdx);
1212 for (int i = curIdx + 1; i < prefixList.size(); i++) {
1213 NTuple<Location> prefixTuple = prefixList.get(i);
1215 if (curPrefix.startsWith(prefixTuple)) {
1219 for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
1220 FlowNode reachableNode = (FlowNode) iterator2.next();
1221 NTuple<Location> reachLocTuple = flowGraph.getLocationTuple(reachableNode);
1222 if (reachLocTuple.startsWith(prefixTuple)) {
1224 throw new Error("Failed to generate a composite location");
1230 public boolean isPrimitiveLocalVariable(FlowNode node) {
1231 VarDescriptor varDesc = (VarDescriptor) node.getDescTuple().get(0);
1232 return varDesc.getType().isPrimitive();
1235 private SSJavaLattice<String> getLattice(Descriptor d) {
1236 if (d instanceof MethodDescriptor) {
1237 return getMethodLattice((MethodDescriptor) d);
1239 return getFieldLattice((ClassDescriptor) d);
1243 private SSJavaLattice<String> getMethodLattice(MethodDescriptor md) {
1244 if (!md2lattice.containsKey(md)) {
1245 md2lattice.put(md, new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM));
1247 return md2lattice.get(md);
1250 private void setMethodLattice(MethodDescriptor md, SSJavaLattice<String> lattice) {
1251 md2lattice.put(md, lattice);
1254 private void extractRelationFromFieldFlows(ClassDescriptor cd, FlowNode srcNode,
1255 FlowNode dstNode, int idx) throws CyclicFlowException {
1257 if (srcNode.getDescTuple().get(idx).equals(dstNode.getDescTuple().get(idx))
1258 && srcNode.getDescTuple().size() > (idx + 1) && dstNode.getDescTuple().size() > (idx + 1)) {
1259 // value flow between fields: we don't need to add a binary relation
1262 Descriptor desc = srcNode.getDescTuple().get(idx);
1263 ClassDescriptor classDesc;
1266 classDesc = ((VarDescriptor) desc).getType().getClassDesc();
1268 classDesc = ((FieldDescriptor) desc).getType().getClassDesc();
1271 extractRelationFromFieldFlows(classDesc, srcNode, dstNode, idx + 1);
1275 Descriptor srcFieldDesc = srcNode.getDescTuple().get(idx);
1276 Descriptor dstFieldDesc = dstNode.getDescTuple().get(idx);
1278 // add a new binary relation of dstNode < srcNode
1279 SSJavaLattice<String> fieldLattice = getFieldLattice(cd);
1280 LocationInfo fieldInfo = getFieldLocationInfo(cd);
1282 String srcSymbol = fieldInfo.getFieldInferLocation(srcFieldDesc).getLocIdentifier();
1283 String dstSymbol = fieldInfo.getFieldInferLocation(dstFieldDesc).getLocIdentifier();
1285 addRelationHigherToLower(fieldLattice, fieldInfo, srcSymbol, dstSymbol);
1291 public SSJavaLattice<String> getFieldLattice(ClassDescriptor cd) {
1292 if (!cd2lattice.containsKey(cd)) {
1293 cd2lattice.put(cd, new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM));
1295 return cd2lattice.get(cd);
1298 public void constructFlowGraph() {
1302 Set<MethodDescriptor> visited = new HashSet<MethodDescriptor>();
1303 Set<MethodDescriptor> reachableCallee = new HashSet<MethodDescriptor>();
1305 while (!toAnalyzeIsEmpty()) {
1306 ClassDescriptor cd = toAnalyzeNext();
1308 setupToAnalazeMethod(cd);
1309 toanalyzeMethodList.removeAll(visited);
1311 while (!toAnalyzeMethodIsEmpty()) {
1312 MethodDescriptor md = toAnalyzeMethodNext();
1313 if ((!visited.contains(md))
1314 && (ssjava.needTobeAnnotated(md) || reachableCallee.contains(md))) {
1315 if (state.SSJAVADEBUG) {
1316 System.out.println();
1317 System.out.println("SSJAVA: Constructing a flow graph: " + md);
1320 // creates a mapping from a method descriptor to virtual methods
1321 Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
1322 if (md.isStatic()) {
1323 setPossibleCallees.add(md);
1325 setPossibleCallees.addAll(ssjava.getCallGraph().getMethods(md));
1328 Set<MethodDescriptor> calleeSet = ssjava.getCallGraph().getCalleeSet(md);
1329 Set<MethodDescriptor> needToAnalyzeCalleeSet = new HashSet<MethodDescriptor>();
1331 for (Iterator iterator = calleeSet.iterator(); iterator.hasNext();) {
1332 MethodDescriptor calleemd = (MethodDescriptor) iterator.next();
1333 if ((!ssjava.isTrustMethod(calleemd))
1334 && (!ssjava.isSSJavaUtil(calleemd.getClassDesc()))) {
1335 if (!visited.contains(calleemd)) {
1336 toanalyzeMethodList.add(calleemd);
1338 reachableCallee.add(calleemd);
1339 needToAnalyzeCalleeSet.add(calleemd);
1343 mapMethodToCalleeSet.put(md, needToAnalyzeCalleeSet);
1345 // creates a mapping from a parameter descriptor to its index
1346 Map<Descriptor, Integer> mapParamDescToIdx = new HashMap<Descriptor, Integer>();
1347 int offset = md.isStatic() ? 0 : 1;
1348 for (int i = 0; i < md.numParameters(); i++) {
1349 Descriptor paramDesc = (Descriptor) md.getParameter(i);
1350 mapParamDescToIdx.put(paramDesc, new Integer(i + offset));
1353 FlowGraph fg = new FlowGraph(md, mapParamDescToIdx);
1354 mapMethodDescriptorToFlowGraph.put(md, fg);
1357 analyzeMethodBody(cd, md);
1363 _debug_printGraph();
1366 private void analyzeMethodBody(ClassDescriptor cd, MethodDescriptor md) {
1367 BlockNode bn = state.getMethodBody(md);
1368 NodeTupleSet implicitFlowTupleSet = new NodeTupleSet();
1369 analyzeFlowBlockNode(md, md.getParameterTable(), bn, implicitFlowTupleSet);
1372 private void analyzeFlowBlockNode(MethodDescriptor md, SymbolTable nametable, BlockNode bn,
1373 NodeTupleSet implicitFlowTupleSet) {
1375 bn.getVarTable().setParent(nametable);
1376 for (int i = 0; i < bn.size(); i++) {
1377 BlockStatementNode bsn = bn.get(i);
1378 analyzeBlockStatementNode(md, bn.getVarTable(), bsn, implicitFlowTupleSet);
1383 private void analyzeBlockStatementNode(MethodDescriptor md, SymbolTable nametable,
1384 BlockStatementNode bsn, NodeTupleSet implicitFlowTupleSet) {
1386 switch (bsn.kind()) {
1387 case Kind.BlockExpressionNode:
1388 analyzeBlockExpressionNode(md, nametable, (BlockExpressionNode) bsn, implicitFlowTupleSet);
1391 case Kind.DeclarationNode:
1392 analyzeFlowDeclarationNode(md, nametable, (DeclarationNode) bsn, implicitFlowTupleSet);
1395 case Kind.IfStatementNode:
1396 analyzeFlowIfStatementNode(md, nametable, (IfStatementNode) bsn, implicitFlowTupleSet);
1400 analyzeFlowLoopNode(md, nametable, (LoopNode) bsn, implicitFlowTupleSet);
1403 case Kind.ReturnNode:
1404 analyzeFlowReturnNode(md, nametable, (ReturnNode) bsn, implicitFlowTupleSet);
1407 case Kind.SubBlockNode:
1408 analyzeFlowSubBlockNode(md, nametable, (SubBlockNode) bsn, implicitFlowTupleSet);
1411 case Kind.ContinueBreakNode:
1414 case Kind.SwitchStatementNode:
1415 analyzeSwitchStatementNode(md, nametable, (SwitchStatementNode) bsn);
1422 private void analyzeSwitchStatementNode(MethodDescriptor md, SymbolTable nametable,
1423 SwitchStatementNode bsn) {
1424 // TODO Auto-generated method stub
1427 private void analyzeFlowSubBlockNode(MethodDescriptor md, SymbolTable nametable,
1428 SubBlockNode sbn, NodeTupleSet implicitFlowTupleSet) {
1429 analyzeFlowBlockNode(md, nametable, sbn.getBlockNode(), implicitFlowTupleSet);
1432 private void analyzeFlowReturnNode(MethodDescriptor md, SymbolTable nametable, ReturnNode rn,
1433 NodeTupleSet implicitFlowTupleSet) {
1435 ExpressionNode returnExp = rn.getReturnExpression();
1437 if (returnExp != null) {
1438 NodeTupleSet nodeSet = new NodeTupleSet();
1439 analyzeFlowExpressionNode(md, nametable, returnExp, nodeSet, false);
1441 FlowGraph fg = getFlowGraph(md);
1443 // annotate the elements of the node set as the return location
1444 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
1445 NTuple<Descriptor> returnDescTuple = (NTuple<Descriptor>) iterator.next();
1446 fg.setReturnFlowNode(returnDescTuple);
1447 for (Iterator iterator2 = implicitFlowTupleSet.iterator(); iterator2.hasNext();) {
1448 NTuple<Descriptor> implicitFlowDescTuple = (NTuple<Descriptor>) iterator2.next();
1449 fg.addValueFlowEdge(implicitFlowDescTuple, returnDescTuple);
1456 private void analyzeFlowLoopNode(MethodDescriptor md, SymbolTable nametable, LoopNode ln,
1457 NodeTupleSet implicitFlowTupleSet) {
1459 if (ln.getType() == LoopNode.WHILELOOP || ln.getType() == LoopNode.DOWHILELOOP) {
1461 NodeTupleSet condTupleNode = new NodeTupleSet();
1462 analyzeFlowExpressionNode(md, nametable, ln.getCondition(), condTupleNode, null,
1463 implicitFlowTupleSet, false);
1464 condTupleNode.addTupleSet(implicitFlowTupleSet);
1466 // add edges from condNodeTupleSet to all nodes of conditional nodes
1467 analyzeFlowBlockNode(md, nametable, ln.getBody(), condTupleNode);
1470 // check 'for loop' case
1471 BlockNode bn = ln.getInitializer();
1472 bn.getVarTable().setParent(nametable);
1473 for (int i = 0; i < bn.size(); i++) {
1474 BlockStatementNode bsn = bn.get(i);
1475 analyzeBlockStatementNode(md, bn.getVarTable(), bsn, implicitFlowTupleSet);
1478 NodeTupleSet condTupleNode = new NodeTupleSet();
1479 analyzeFlowExpressionNode(md, bn.getVarTable(), ln.getCondition(), condTupleNode, null,
1480 implicitFlowTupleSet, false);
1481 condTupleNode.addTupleSet(implicitFlowTupleSet);
1483 analyzeFlowBlockNode(md, bn.getVarTable(), ln.getUpdate(), condTupleNode);
1484 analyzeFlowBlockNode(md, bn.getVarTable(), ln.getBody(), condTupleNode);
1490 private void analyzeFlowIfStatementNode(MethodDescriptor md, SymbolTable nametable,
1491 IfStatementNode isn, NodeTupleSet implicitFlowTupleSet) {
1493 NodeTupleSet condTupleNode = new NodeTupleSet();
1494 analyzeFlowExpressionNode(md, nametable, isn.getCondition(), condTupleNode, null,
1495 implicitFlowTupleSet, false);
1497 // add edges from condNodeTupleSet to all nodes of conditional nodes
1498 condTupleNode.addTupleSet(implicitFlowTupleSet);
1499 analyzeFlowBlockNode(md, nametable, isn.getTrueBlock(), condTupleNode);
1501 if (isn.getFalseBlock() != null) {
1502 analyzeFlowBlockNode(md, nametable, isn.getFalseBlock(), condTupleNode);
1507 private void analyzeFlowDeclarationNode(MethodDescriptor md, SymbolTable nametable,
1508 DeclarationNode dn, NodeTupleSet implicitFlowTupleSet) {
1510 VarDescriptor vd = dn.getVarDescriptor();
1511 NTuple<Descriptor> tupleLHS = new NTuple<Descriptor>();
1513 getFlowGraph(md).createNewFlowNode(tupleLHS);
1515 if (dn.getExpression() != null) {
1517 NodeTupleSet tupleSetRHS = new NodeTupleSet();
1518 analyzeFlowExpressionNode(md, nametable, dn.getExpression(), tupleSetRHS, null,
1519 implicitFlowTupleSet, false);
1521 // add a new flow edge from rhs to lhs
1522 for (Iterator<NTuple<Descriptor>> iter = tupleSetRHS.iterator(); iter.hasNext();) {
1523 NTuple<Descriptor> from = iter.next();
1524 addFlowGraphEdge(md, from, tupleLHS);
1531 private void analyzeBlockExpressionNode(MethodDescriptor md, SymbolTable nametable,
1532 BlockExpressionNode ben, NodeTupleSet implicitFlowTupleSet) {
1533 analyzeFlowExpressionNode(md, nametable, ben.getExpression(), null, null, implicitFlowTupleSet,
1537 private NTuple<Descriptor> analyzeFlowExpressionNode(MethodDescriptor md, SymbolTable nametable,
1538 ExpressionNode en, NodeTupleSet nodeSet, boolean isLHS) {
1539 return analyzeFlowExpressionNode(md, nametable, en, nodeSet, null, new NodeTupleSet(), isLHS);
1542 private NTuple<Descriptor> analyzeFlowExpressionNode(MethodDescriptor md, SymbolTable nametable,
1543 ExpressionNode en, NodeTupleSet nodeSet, NTuple<Descriptor> base,
1544 NodeTupleSet implicitFlowTupleSet, boolean isLHS) {
1546 // note that expression node can create more than one flow node
1547 // nodeSet contains of flow nodes
1548 // base is always assigned to null except the case of a name node!
1550 NTuple<Descriptor> flowTuple;
1552 switch (en.kind()) {
1554 case Kind.AssignmentNode:
1555 analyzeFlowAssignmentNode(md, nametable, (AssignmentNode) en, base, implicitFlowTupleSet);
1558 case Kind.FieldAccessNode:
1560 analyzeFlowFieldAccessNode(md, nametable, (FieldAccessNode) en, nodeSet, base,
1561 implicitFlowTupleSet, isLHS);
1562 if (flowTuple != null) {
1563 nodeSet.addTuple(flowTuple);
1568 NodeTupleSet nameNodeSet = new NodeTupleSet();
1570 analyzeFlowNameNode(md, nametable, (NameNode) en, nameNodeSet, base, implicitFlowTupleSet);
1571 if (flowTuple != null) {
1572 nodeSet.addTuple(flowTuple);
1577 analyzeFlowOpNode(md, nametable, (OpNode) en, nodeSet, implicitFlowTupleSet);
1580 case Kind.CreateObjectNode:
1581 analyzeCreateObjectNode(md, nametable, (CreateObjectNode) en);
1584 case Kind.ArrayAccessNode:
1585 analyzeFlowArrayAccessNode(md, nametable, (ArrayAccessNode) en, nodeSet, isLHS);
1588 case Kind.LiteralNode:
1589 analyzeLiteralNode(md, nametable, (LiteralNode) en);
1592 case Kind.MethodInvokeNode:
1593 analyzeFlowMethodInvokeNode(md, nametable, (MethodInvokeNode) en, implicitFlowTupleSet);
1596 case Kind.TertiaryNode:
1597 analyzeFlowTertiaryNode(md, nametable, (TertiaryNode) en, nodeSet, implicitFlowTupleSet);
1601 analyzeFlowCastNode(md, nametable, (CastNode) en, nodeSet, base, implicitFlowTupleSet);
1603 // case Kind.InstanceOfNode:
1604 // checkInstanceOfNode(md, nametable, (InstanceOfNode) en, td);
1607 // case Kind.ArrayInitializerNode:
1608 // checkArrayInitializerNode(md, nametable, (ArrayInitializerNode) en,
1612 // case Kind.ClassTypeNode:
1613 // checkClassTypeNode(md, nametable, (ClassTypeNode) en, td);
1616 // case Kind.OffsetNode:
1617 // checkOffsetNode(md, nametable, (OffsetNode)en, td);
1625 private void analyzeFlowCastNode(MethodDescriptor md, SymbolTable nametable, CastNode cn,
1626 NodeTupleSet nodeSet, NTuple<Descriptor> base, NodeTupleSet implicitFlowTupleSet) {
1628 analyzeFlowExpressionNode(md, nametable, cn.getExpression(), nodeSet, base,
1629 implicitFlowTupleSet, false);
1633 private void analyzeFlowTertiaryNode(MethodDescriptor md, SymbolTable nametable, TertiaryNode tn,
1634 NodeTupleSet nodeSet, NodeTupleSet implicitFlowTupleSet) {
1636 NodeTupleSet tertiaryTupleNode = new NodeTupleSet();
1637 analyzeFlowExpressionNode(md, nametable, tn.getCond(), tertiaryTupleNode, null,
1638 implicitFlowTupleSet, false);
1640 // add edges from tertiaryTupleNode to all nodes of conditional nodes
1641 tertiaryTupleNode.addTupleSet(implicitFlowTupleSet);
1642 analyzeFlowExpressionNode(md, nametable, tn.getTrueExpr(), tertiaryTupleNode, null,
1643 implicitFlowTupleSet, false);
1645 analyzeFlowExpressionNode(md, nametable, tn.getFalseExpr(), tertiaryTupleNode, null,
1646 implicitFlowTupleSet, false);
1648 nodeSet.addTupleSet(tertiaryTupleNode);
1652 private void addMapCallerMethodDescToMethodInvokeNodeSet(MethodDescriptor caller,
1653 MethodInvokeNode min) {
1654 Set<MethodInvokeNode> set = mapMethodDescriptorToMethodInvokeNodeSet.get(caller);
1656 set = new HashSet<MethodInvokeNode>();
1657 mapMethodDescriptorToMethodInvokeNodeSet.put(caller, set);
1662 private void analyzeFlowMethodInvokeNode(MethodDescriptor md, SymbolTable nametable,
1663 MethodInvokeNode min, NodeTupleSet implicitFlowTupleSet) {
1665 addMapCallerMethodDescToMethodInvokeNodeSet(md, min);
1667 MethodDescriptor calleeMD = min.getMethod();
1669 NameDescriptor baseName = min.getBaseName();
1670 boolean isSystemout = false;
1671 if (baseName != null) {
1672 isSystemout = baseName.getSymbol().equals("System.out");
1675 if (!ssjava.isSSJavaUtil(calleeMD.getClassDesc()) && !ssjava.isTrustMethod(calleeMD)
1676 && !calleeMD.getModifiers().isNative() && !isSystemout) {
1678 // CompositeLocation baseLocation = null;
1679 if (min.getExpression() != null) {
1681 NodeTupleSet baseNodeSet = new NodeTupleSet();
1682 analyzeFlowExpressionNode(md, nametable, min.getExpression(), baseNodeSet, null,
1683 implicitFlowTupleSet, false);
1686 if (min.getMethod().isStatic()) {
1687 // String globalLocId = ssjava.getMethodLattice(md).getGlobalLoc();
1688 // if (globalLocId == null) {
1690 // Error("Method lattice does not define global variable location at "
1691 // + generateErrorMessage(md.getClassDesc(), min));
1693 // baseLocation = new CompositeLocation(new Location(md,
1697 // String thisLocId = ssjava.getMethodLattice(md).getThisLoc();
1698 // baseLocation = new CompositeLocation(new Location(md, thisLocId));
1703 // if (constraint != null) {
1704 // int compareResult =
1705 // CompositeLattice.compare(constraint, baseLocation, true,
1706 // generateErrorMessage(cd, min));
1707 // if (compareResult != ComparisonResult.GREATER) {
1708 // // if the current constraint is higher than method's THIS location
1709 // // no need to check constraints!
1710 // CompositeLocation calleeConstraint =
1711 // translateCallerLocToCalleeLoc(calleeMD, baseLocation, constraint);
1712 // // System.out.println("check method body for constraint:" + calleeMD +
1713 // // " calleeConstraint="
1714 // // + calleeConstraint);
1715 // checkMethodBody(calleeMD.getClassDesc(), calleeMD, calleeConstraint);
1719 analyzeFlowMethodParameters(md, nametable, min);
1721 // checkCalleeConstraints(md, nametable, min, baseLocation, constraint);
1723 // checkCallerArgumentLocationConstraints(md, nametable, min,
1724 // baseLocation, constraint);
1726 if (min.getMethod().getReturnType() != null && !min.getMethod().getReturnType().isVoid()) {
1727 // If method has a return value, compute the highest possible return
1728 // location in the caller's perspective
1729 // CompositeLocation ceilingLoc =
1730 // computeCeilingLocationForCaller(md, nametable, min, baseLocation,
1732 // return ceilingLoc;
1736 // return new CompositeLocation(Location.createTopLocation(md));
1740 private NodeTupleSet getNodeTupleSetByArgIdx(MethodInvokeNode min, int idx) {
1741 return mapMethodInvokeNodeToArgIdxMap.get(min).get(new Integer(idx));
1744 private void addArgIdxMap(MethodInvokeNode min, int idx, NodeTupleSet tupleSet) {
1745 Map<Integer, NodeTupleSet> mapIdxToTupleSet = mapMethodInvokeNodeToArgIdxMap.get(min);
1746 if (mapIdxToTupleSet == null) {
1747 mapIdxToTupleSet = new HashMap<Integer, NodeTupleSet>();
1748 mapMethodInvokeNodeToArgIdxMap.put(min, mapIdxToTupleSet);
1750 mapIdxToTupleSet.put(new Integer(idx), tupleSet);
1753 private void analyzeFlowMethodParameters(MethodDescriptor callermd, SymbolTable nametable,
1754 MethodInvokeNode min) {
1756 if (min.numArgs() > 0) {
1759 if (min.getMethod().isStatic()) {
1763 NTuple<Descriptor> thisArgTuple = new NTuple<Descriptor>();
1764 thisArgTuple.add(callermd.getThis());
1765 NodeTupleSet argTupleSet = new NodeTupleSet();
1766 argTupleSet.addTuple(thisArgTuple);
1767 addArgIdxMap(min, 0, argTupleSet);
1770 for (int i = 0; i < min.numArgs(); i++) {
1771 ExpressionNode en = min.getArg(i);
1772 NodeTupleSet argTupleSet = new NodeTupleSet();
1773 analyzeFlowExpressionNode(callermd, nametable, en, argTupleSet, false);
1774 // if argument is liternal node, argTuple is set to NULL.
1775 addArgIdxMap(min, i + offset, argTupleSet);
1782 private void analyzeLiteralNode(MethodDescriptor md, SymbolTable nametable, LiteralNode en) {
1786 private void analyzeFlowArrayAccessNode(MethodDescriptor md, SymbolTable nametable,
1787 ArrayAccessNode aan, NodeTupleSet nodeSet, boolean isLHS) {
1789 NodeTupleSet expNodeTupleSet = new NodeTupleSet();
1790 analyzeFlowExpressionNode(md, nametable, aan.getExpression(), expNodeTupleSet, isLHS);
1792 NodeTupleSet idxNodeTupleSet = new NodeTupleSet();
1793 analyzeFlowExpressionNode(md, nametable, aan.getIndex(), idxNodeTupleSet, isLHS);
1796 // need to create an edge from idx to array
1798 for (Iterator<NTuple<Descriptor>> idxIter = idxNodeTupleSet.iterator(); idxIter.hasNext();) {
1799 NTuple<Descriptor> idxTuple = idxIter.next();
1800 for (Iterator<NTuple<Descriptor>> arrIter = expNodeTupleSet.iterator(); arrIter.hasNext();) {
1801 NTuple<Descriptor> arrTuple = arrIter.next();
1802 getFlowGraph(md).addValueFlowEdge(idxTuple, arrTuple);
1806 nodeSet.addTupleSet(expNodeTupleSet);
1808 nodeSet.addTupleSet(expNodeTupleSet);
1809 nodeSet.addTupleSet(idxNodeTupleSet);
1813 private void analyzeCreateObjectNode(MethodDescriptor md, SymbolTable nametable,
1814 CreateObjectNode en) {
1815 // TODO Auto-generated method stub
1819 private void analyzeFlowOpNode(MethodDescriptor md, SymbolTable nametable, OpNode on,
1820 NodeTupleSet nodeSet, NodeTupleSet implicitFlowTupleSet) {
1822 NodeTupleSet leftOpSet = new NodeTupleSet();
1823 NodeTupleSet rightOpSet = new NodeTupleSet();
1826 analyzeFlowExpressionNode(md, nametable, on.getLeft(), leftOpSet, null, implicitFlowTupleSet,
1829 if (on.getRight() != null) {
1831 analyzeFlowExpressionNode(md, nametable, on.getRight(), rightOpSet, null,
1832 implicitFlowTupleSet, false);
1835 Operation op = on.getOp();
1837 switch (op.getOp()) {
1839 case Operation.UNARYPLUS:
1840 case Operation.UNARYMINUS:
1841 case Operation.LOGIC_NOT:
1843 nodeSet.addTupleSet(leftOpSet);
1846 case Operation.LOGIC_OR:
1847 case Operation.LOGIC_AND:
1848 case Operation.COMP:
1849 case Operation.BIT_OR:
1850 case Operation.BIT_XOR:
1851 case Operation.BIT_AND:
1852 case Operation.ISAVAILABLE:
1853 case Operation.EQUAL:
1854 case Operation.NOTEQUAL:
1861 case Operation.MULT:
1864 case Operation.LEFTSHIFT:
1865 case Operation.RIGHTSHIFT:
1866 case Operation.URIGHTSHIFT:
1868 // there are two operands
1869 nodeSet.addTupleSet(leftOpSet);
1870 nodeSet.addTupleSet(rightOpSet);
1874 throw new Error(op.toString());
1879 private NTuple<Descriptor> analyzeFlowNameNode(MethodDescriptor md, SymbolTable nametable,
1880 NameNode nn, NodeTupleSet nodeSet, NTuple<Descriptor> base, NodeTupleSet implicitFlowTupleSet) {
1883 base = new NTuple<Descriptor>();
1886 NameDescriptor nd = nn.getName();
1888 if (nd.getBase() != null) {
1890 analyzeFlowExpressionNode(md, nametable, nn.getExpression(), nodeSet, base,
1891 implicitFlowTupleSet, false);
1893 // base node has the top location
1897 String varname = nd.toString();
1898 if (varname.equals("this")) {
1900 base.add(md.getThis());
1904 Descriptor d = (Descriptor) nametable.get(varname);
1906 if (d instanceof VarDescriptor) {
1907 VarDescriptor vd = (VarDescriptor) d;
1909 } else if (d instanceof FieldDescriptor) {
1910 // the type of field descriptor has a location!
1911 FieldDescriptor fd = (FieldDescriptor) d;
1912 if (fd.isStatic()) {
1914 // if it is 'static final', no need to have flow node for the TOP
1918 // if 'static', assign the default GLOBAL LOCATION to the first
1919 // element of the tuple
1920 base.add(GLOBALDESC);
1923 // the location of field access starts from this, followed by field
1925 base.add(md.getThis());
1929 } else if (d == null) {
1930 // access static field
1931 base.add(GLOBALDESC);
1932 // base.add(nn.getField());
1935 // FieldDescriptor fd = nn.getField();addFlowGraphEdge
1937 // MethodLattice<String> localLattice = ssjava.getMethodLattice(md);
1938 // String globalLocId = localLattice.getGlobalLoc();
1939 // if (globalLocId == null) {
1941 // Error("Method lattice does not define global variable location at "
1942 // + generateErrorMessage(md.getClassDesc(), nn));
1944 // loc.addLocation(new Location(md, globalLocId));
1946 // Location fieldLoc = (Location) fd.getType().getExtension();
1947 // loc.addLocation(fieldLoc);
1954 getFlowGraph(md).createNewFlowNode(base);
1960 private NTuple<Descriptor> analyzeFlowFieldAccessNode(MethodDescriptor md, SymbolTable nametable,
1961 FieldAccessNode fan, NodeTupleSet nodeSet, NTuple<Descriptor> base,
1962 NodeTupleSet implicitFlowTupleSet, boolean isLHS) {
1964 ExpressionNode left = fan.getExpression();
1965 TypeDescriptor ltd = left.getType();
1966 FieldDescriptor fd = fan.getField();
1968 String varName = null;
1969 if (left.kind() == Kind.NameNode) {
1970 NameDescriptor nd = ((NameNode) left).getName();
1971 varName = nd.toString();
1974 if (ltd.isClassNameRef() || (varName != null && varName.equals("this"))) {
1975 // using a class name directly or access using this
1976 if (fd.isStatic() && fd.isFinal()) {
1981 if (left instanceof ArrayAccessNode) {
1983 ArrayAccessNode aan = (ArrayAccessNode) left;
1984 left = aan.getExpression();
1985 analyzeFlowExpressionNode(md, nametable, aan.getIndex(), nodeSet, base, implicitFlowTupleSet,
1990 analyzeFlowExpressionNode(md, nametable, left, nodeSet, base, implicitFlowTupleSet, isLHS);
1992 // in this case, field is TOP location
1996 if (!left.getType().isPrimitive()) {
1998 if (!fd.getSymbol().equals("length")) {
1999 // array.length access, just have the location of the array
2005 getFlowGraph(md).createNewFlowNode(base);
2012 private void debug_printTreeNode(TreeNode tn) {
2014 System.out.println("DEBUG: " + tn.printNode(0) + " line#=" + tn.getNumLine());
2018 private void analyzeFlowAssignmentNode(MethodDescriptor md, SymbolTable nametable,
2019 AssignmentNode an, NTuple<Descriptor> base, NodeTupleSet implicitFlowTupleSet) {
2021 NodeTupleSet nodeSetRHS = new NodeTupleSet();
2022 NodeTupleSet nodeSetLHS = new NodeTupleSet();
2024 boolean postinc = true;
2025 if (an.getOperation().getBaseOp() == null
2026 || (an.getOperation().getBaseOp().getOp() != Operation.POSTINC && an.getOperation()
2027 .getBaseOp().getOp() != Operation.POSTDEC)) {
2030 // if LHS is array access node, need to capture value flows between an array
2031 // and its index value
2032 analyzeFlowExpressionNode(md, nametable, an.getDest(), nodeSetLHS, null, implicitFlowTupleSet,
2036 // analyze value flows of rhs expression
2037 analyzeFlowExpressionNode(md, nametable, an.getSrc(), nodeSetRHS, null, implicitFlowTupleSet,
2040 // System.out.println("-analyzeFlowAssignmentNode=" + an.printNode(0));
2041 // System.out.println("-nodeSetLHS=" + nodeSetLHS);
2042 // System.out.println("-nodeSetRHS=" + nodeSetRHS);
2043 // System.out.println("-implicitFlowTupleSet=" + implicitFlowTupleSet);
2044 // System.out.println("-");
2046 if (an.getOperation().getOp() >= 2 && an.getOperation().getOp() <= 12) {
2047 // if assignment contains OP+EQ operator, creates edges from LHS to LHS
2048 for (Iterator<NTuple<Descriptor>> iter = nodeSetLHS.iterator(); iter.hasNext();) {
2049 NTuple<Descriptor> fromTuple = iter.next();
2050 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
2051 NTuple<Descriptor> toTuple = iter2.next();
2052 addFlowGraphEdge(md, fromTuple, toTuple);
2057 // creates edges from RHS to LHS
2058 for (Iterator<NTuple<Descriptor>> iter = nodeSetRHS.iterator(); iter.hasNext();) {
2059 NTuple<Descriptor> fromTuple = iter.next();
2060 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
2061 NTuple<Descriptor> toTuple = iter2.next();
2062 addFlowGraphEdge(md, fromTuple, toTuple);
2066 // creates edges from implicitFlowTupleSet to LHS
2067 for (Iterator<NTuple<Descriptor>> iter = implicitFlowTupleSet.iterator(); iter.hasNext();) {
2068 NTuple<Descriptor> fromTuple = iter.next();
2069 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
2070 NTuple<Descriptor> toTuple = iter2.next();
2071 addFlowGraphEdge(md, fromTuple, toTuple);
2077 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
2078 NTuple<Descriptor> tuple = iter2.next();
2079 addFlowGraphEdge(md, tuple, tuple);
2082 // creates edges from implicitFlowTupleSet to LHS
2083 for (Iterator<NTuple<Descriptor>> iter = implicitFlowTupleSet.iterator(); iter.hasNext();) {
2084 NTuple<Descriptor> fromTuple = iter.next();
2085 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
2086 NTuple<Descriptor> toTuple = iter2.next();
2087 addFlowGraphEdge(md, fromTuple, toTuple);
2095 public FlowGraph getFlowGraph(MethodDescriptor md) {
2096 return mapMethodDescriptorToFlowGraph.get(md);
2099 private boolean addFlowGraphEdge(MethodDescriptor md, NTuple<Descriptor> from,
2100 NTuple<Descriptor> to) {
2102 // return true if it adds a new edge
2103 FlowGraph graph = getFlowGraph(md);
2104 graph.addValueFlowEdge(from, to);
2108 public void _debug_printGraph() {
2109 Set<MethodDescriptor> keySet = mapMethodDescriptorToFlowGraph.keySet();
2111 for (Iterator<MethodDescriptor> iterator = keySet.iterator(); iterator.hasNext();) {
2112 MethodDescriptor md = (MethodDescriptor) iterator.next();
2113 FlowGraph fg = mapMethodDescriptorToFlowGraph.get(md);
2116 } catch (IOException e) {
2117 e.printStackTrace();
2125 class CyclicFlowException extends Exception {