1 package Analysis.SSJava;
3 import java.io.BufferedReader;
4 import java.io.BufferedWriter;
5 import java.io.FileReader;
6 import java.io.FileWriter;
7 import java.io.IOException;
8 import java.util.ArrayList;
9 import java.util.Collections;
10 import java.util.Comparator;
11 import java.util.HashMap;
12 import java.util.HashSet;
13 import java.util.Iterator;
14 import java.util.LinkedList;
15 import java.util.List;
18 import java.util.Stack;
19 import java.util.Vector;
21 import IR.ClassDescriptor;
23 import IR.FieldDescriptor;
24 import IR.MethodDescriptor;
25 import IR.NameDescriptor;
28 import IR.SymbolTable;
29 import IR.TypeDescriptor;
31 import IR.VarDescriptor;
32 import IR.Tree.ArrayAccessNode;
33 import IR.Tree.AssignmentNode;
34 import IR.Tree.BlockExpressionNode;
35 import IR.Tree.BlockNode;
36 import IR.Tree.BlockStatementNode;
37 import IR.Tree.CastNode;
38 import IR.Tree.CreateObjectNode;
39 import IR.Tree.DeclarationNode;
40 import IR.Tree.ExpressionNode;
41 import IR.Tree.FieldAccessNode;
42 import IR.Tree.IfStatementNode;
44 import IR.Tree.LiteralNode;
45 import IR.Tree.LoopNode;
46 import IR.Tree.MethodInvokeNode;
47 import IR.Tree.NameNode;
48 import IR.Tree.OpNode;
49 import IR.Tree.ReturnNode;
50 import IR.Tree.SubBlockNode;
51 import IR.Tree.SwitchBlockNode;
52 import IR.Tree.SwitchStatementNode;
53 import IR.Tree.TertiaryNode;
54 import IR.Tree.TreeNode;
57 public class LocationInference {
62 SSJavaAnalysis ssjava;
65 List<ClassDescriptor> temp_toanalyzeList;
66 List<MethodDescriptor> temp_toanalyzeMethodList;
67 Map<MethodDescriptor, FlowGraph> mapMethodDescriptorToFlowGraph;
69 LinkedList<MethodDescriptor> toanalyze_methodDescList;
70 Set<ClassDescriptor> toanalyze_classDescSet;
72 // InheritanceTree<ClassDescriptor> inheritanceTree;
74 // map a method descriptor to its set of parameter descriptors
75 Map<MethodDescriptor, Set<Descriptor>> mapMethodDescriptorToParamDescSet;
77 // keep current descriptors to visit in fixed-point interprocedural analysis,
78 private Stack<MethodDescriptor> methodDescriptorsToVisitStack;
80 // map a descriptor to a naive lattice
81 private Map<Descriptor, SSJavaLattice<String>> desc2naiveLattice;
83 // map a class descriptor to a field lattice
84 private Map<ClassDescriptor, SSJavaLattice<String>> cd2lattice;
86 // map a method descriptor to a method lattice
87 private Map<MethodDescriptor, SSJavaLattice<String>> md2lattice;
89 // map a method/class descriptor to a hierarchy graph
90 private Map<Descriptor, HierarchyGraph> mapDescriptorToHierarchyGraph;
92 // map a method/class descriptor to a skeleton hierarchy graph
93 private Map<Descriptor, HierarchyGraph> mapDescriptorToSkeletonHierarchyGraph;
95 private Map<Descriptor, HierarchyGraph> mapDescriptorToSimpleHierarchyGraph;
97 // map a method/class descriptor to a skeleton hierarchy graph with combination nodes
98 private Map<Descriptor, HierarchyGraph> mapDescriptorToCombineSkeletonHierarchyGraph;
100 // map a descriptor to a simple lattice
101 private Map<Descriptor, SSJavaLattice<String>> mapDescriptorToSimpleLattice;
103 // map a method descriptor to the set of method invocation nodes which are
104 // invoked by the method descriptor
105 private Map<MethodDescriptor, Set<MethodInvokeNode>> mapMethodDescriptorToMethodInvokeNodeSet;
107 private Map<MethodInvokeNode, Map<Integer, NTuple<Descriptor>>> mapMethodInvokeNodeToArgIdxMap;
109 private Map<MethodInvokeNode, NTuple<Descriptor>> mapMethodInvokeNodeToBaseTuple;
111 private Map<MethodInvokeNode, Set<NTuple<Location>>> mapMethodInvokeNodeToPCLocTupleSet;
113 private Map<MethodDescriptor, MethodLocationInfo> mapMethodDescToMethodLocationInfo;
115 private Map<ClassDescriptor, LocationInfo> mapClassToLocationInfo;
117 private Map<MethodDescriptor, Set<MethodDescriptor>> mapMethodToCalleeSet;
119 private Map<MethodDescriptor, Set<FlowNode>> mapMethodDescToParamNodeFlowsToReturnValue;
121 private Map<String, Vector<String>> mapFileNameToLineVector;
123 private Map<Descriptor, Integer> mapDescToDefinitionLine;
125 private Map<Descriptor, LocationSummary> mapDescToLocationSummary;
127 private Map<MethodDescriptor, Set<MethodInvokeNode>> mapMethodDescToMethodInvokeNodeSet;
129 // maps a method descriptor to a sub global flow graph that captures all value flows caused by the
130 // set of callees reachable from the method
131 private Map<MethodDescriptor, GlobalFlowGraph> mapMethodDescriptorToSubGlobalFlowGraph;
133 private Map<MethodInvokeNode, Map<NTuple<Descriptor>, NTuple<Descriptor>>> mapMethodInvokeNodeToMapCallerArgToCalleeArg;
135 private Map<MethodDescriptor, Boolean> mapMethodDescriptorToCompositeReturnCase;
137 private Map<MethodDescriptor, MethodDescriptor> mapMethodDescToHighestOverriddenMethodDesc;
139 private Map<MethodDescriptor, Set<MethodDescriptor>> mapHighestOverriddenMethodDescToMethodDescSet;
141 private Map<MethodDescriptor, NTuple<Descriptor>> mapHighestOverriddenMethodDescToReturnLocTuple;
143 private Map<MethodDescriptor, NTuple<Descriptor>> mapHighestOverriddenMethodDescToPCLocTuple;
145 private Map<MethodDescriptor, Set<NTuple<Descriptor>>> mapHighestOverriddenMethodDescToSetLowerThanPCLoc;
147 private Map<MethodDescriptor, Set<NTuple<Descriptor>>> mapHighestOverriddenMethodDescToSetHigherThanRETURNLoc;
149 public static final String GLOBALLOC = "GLOBALLOC";
151 public static final String INTERLOC = "INTERLOC";
153 public static final String PCLOC = "_PCLOC_";
155 public static final String RLOC = "_RLOC_";
157 public static final Descriptor GLOBALDESC = new NameDescriptor(GLOBALLOC);
159 public static final Descriptor TOPDESC = new NameDescriptor(SSJavaAnalysis.TOP);
161 public static final Descriptor BOTTOMDESC = new NameDescriptor(SSJavaAnalysis.BOTTOM);
163 public static final Descriptor RETURNLOC = new NameDescriptor(RLOC);
165 public static final Descriptor LITERALDESC = new NameDescriptor("LITERAL");
167 public static final HNode TOPHNODE = new HNode(TOPDESC);
169 public static final HNode BOTTOMHNODE = new HNode(BOTTOMDESC);
171 public static String newline = System.getProperty("line.separator");
173 LocationInfo curMethodInfo;
175 private boolean hasChanges = false;
177 boolean debug = true;
179 public static int locSeed = 0;
181 private Stack<String> arrayAccessNodeStack;
183 private ClassDescriptor rootClassDescriptor;
185 private BuildLattice buildLattice;
187 public static int numLocationsSInfer = 0;
188 public static int numLocationsNaive = 0;
190 public LocationInference(SSJavaAnalysis ssjava, State state, TypeUtil tu) {
191 this.ssjava = ssjava;
194 this.toanalyze_classDescSet = new HashSet<ClassDescriptor>();
195 this.temp_toanalyzeList = new ArrayList<ClassDescriptor>();
196 this.temp_toanalyzeMethodList = new ArrayList<MethodDescriptor>();
197 this.mapMethodDescriptorToFlowGraph = new HashMap<MethodDescriptor, FlowGraph>();
198 this.cd2lattice = new HashMap<ClassDescriptor, SSJavaLattice<String>>();
199 this.md2lattice = new HashMap<MethodDescriptor, SSJavaLattice<String>>();
200 this.desc2naiveLattice = new HashMap<Descriptor, SSJavaLattice<String>>();
202 this.methodDescriptorsToVisitStack = new Stack<MethodDescriptor>();
203 this.mapMethodDescriptorToMethodInvokeNodeSet =
204 new HashMap<MethodDescriptor, Set<MethodInvokeNode>>();
205 this.mapMethodInvokeNodeToArgIdxMap =
206 new HashMap<MethodInvokeNode, Map<Integer, NTuple<Descriptor>>>();
207 this.mapMethodDescToMethodLocationInfo = new HashMap<MethodDescriptor, MethodLocationInfo>();
208 this.mapMethodToCalleeSet = new HashMap<MethodDescriptor, Set<MethodDescriptor>>();
209 this.mapClassToLocationInfo = new HashMap<ClassDescriptor, LocationInfo>();
211 this.mapFileNameToLineVector = new HashMap<String, Vector<String>>();
212 this.mapDescToDefinitionLine = new HashMap<Descriptor, Integer>();
213 this.mapMethodDescToParamNodeFlowsToReturnValue =
214 new HashMap<MethodDescriptor, Set<FlowNode>>();
216 this.mapDescriptorToHierarchyGraph = new HashMap<Descriptor, HierarchyGraph>();
217 this.mapMethodInvokeNodeToBaseTuple = new HashMap<MethodInvokeNode, NTuple<Descriptor>>();
219 this.mapDescriptorToSkeletonHierarchyGraph = new HashMap<Descriptor, HierarchyGraph>();
220 this.mapDescriptorToCombineSkeletonHierarchyGraph = new HashMap<Descriptor, HierarchyGraph>();
221 this.mapDescriptorToSimpleHierarchyGraph = new HashMap<Descriptor, HierarchyGraph>();
223 this.mapDescriptorToSimpleLattice = new HashMap<Descriptor, SSJavaLattice<String>>();
225 this.mapDescToLocationSummary = new HashMap<Descriptor, LocationSummary>();
227 this.mapMethodDescriptorToSubGlobalFlowGraph = new HashMap<MethodDescriptor, GlobalFlowGraph>();
229 this.mapMethodInvokeNodeToMapCallerArgToCalleeArg =
230 new HashMap<MethodInvokeNode, Map<NTuple<Descriptor>, NTuple<Descriptor>>>();
232 this.mapMethodInvokeNodeToPCLocTupleSet =
233 new HashMap<MethodInvokeNode, Set<NTuple<Location>>>();
235 this.arrayAccessNodeStack = new Stack<String>();
237 this.mapMethodDescToMethodInvokeNodeSet =
238 new HashMap<MethodDescriptor, Set<MethodInvokeNode>>();
240 this.mapMethodDescriptorToCompositeReturnCase = new HashMap<MethodDescriptor, Boolean>();
242 mapMethodDescToHighestOverriddenMethodDesc = new HashMap<MethodDescriptor, MethodDescriptor>();
244 mapHighestOverriddenMethodDescToSetLowerThanPCLoc =
245 new HashMap<MethodDescriptor, Set<NTuple<Descriptor>>>();
247 mapHighestOverriddenMethodDescToMethodDescSet =
248 new HashMap<MethodDescriptor, Set<MethodDescriptor>>();
250 mapHighestOverriddenMethodDescToReturnLocTuple =
251 new HashMap<MethodDescriptor, NTuple<Descriptor>>();
253 mapHighestOverriddenMethodDescToPCLocTuple =
254 new HashMap<MethodDescriptor, NTuple<Descriptor>>();
256 mapHighestOverriddenMethodDescToSetHigherThanRETURNLoc =
257 new HashMap<MethodDescriptor, Set<NTuple<Descriptor>>>();
259 this.buildLattice = new BuildLattice(this);
263 public void setupToAnalyze() {
264 SymbolTable classtable = state.getClassSymbolTable();
265 temp_toanalyzeList.clear();
266 temp_toanalyzeList.addAll(classtable.getValueSet());
267 // Collections.sort(toanalyzeList, new Comparator<ClassDescriptor>() {
268 // public int compare(ClassDescriptor o1, ClassDescriptor o2) {
269 // return o1.getClassName().compareToIgnoreCase(o2.getClassName());
274 public void setupToAnalazeMethod(ClassDescriptor cd) {
276 SymbolTable methodtable = cd.getMethodTable();
277 temp_toanalyzeMethodList.clear();
278 temp_toanalyzeMethodList.addAll(methodtable.getValueSet());
279 Collections.sort(temp_toanalyzeMethodList, new Comparator<MethodDescriptor>() {
280 public int compare(MethodDescriptor o1, MethodDescriptor o2) {
281 return o1.getSymbol().compareToIgnoreCase(o2.getSymbol());
286 public boolean toAnalyzeMethodIsEmpty() {
287 return temp_toanalyzeMethodList.isEmpty();
290 public boolean toAnalyzeIsEmpty() {
291 return temp_toanalyzeList.isEmpty();
294 public ClassDescriptor toAnalyzeNext() {
295 return temp_toanalyzeList.remove(0);
298 public MethodDescriptor toAnalyzeMethodNext() {
299 return temp_toanalyzeMethodList.remove(0);
302 public void inference() {
306 // construct value flow graph
307 constructFlowGraph();
309 constructGlobalFlowGraph();
313 assignCompositeLocation();
315 calculateExtraLocations();
316 addAdditionalOrderingConstraints();
318 _debug_writeFlowGraph();
320 buildInheritanceTree();
321 calculateReturnPCLocInheritance();
323 constructHierarchyGraph();
325 addInheritanceConstraintsToHierarchyGraph();
327 debug_writeHierarchyDotFiles();
329 simplifyHierarchyGraph();
331 debug_writeSimpleHierarchyDotFiles();
333 constructSkeletonHierarchyGraph();
335 debug_writeSkeletonHierarchyDotFiles();
337 insertCombinationNodes();
339 debug_writeSkeletonCombinationHierarchyDotFiles();
341 buildLatticeInheritanceTree();
344 debug_writeLattices();
346 updateCompositeLocationAssignments();
348 generateMethodSummary();
350 generateAnnoatedCode();
352 for (Iterator iterator = cd2lattice.keySet().iterator(); iterator.hasNext();) {
353 ClassDescriptor cd = (ClassDescriptor) iterator.next();
354 SSJavaLattice<String> lattice = getLattice(cd);
355 HierarchyGraph hg = mapDescriptorToHierarchyGraph.get(cd);
356 // System.out.println("~~~\t" + cd + "\t" + lattice.getKeySet().size() + "\t"
357 // + hg.getNodeSet().size());
360 for (Iterator iterator = md2lattice.keySet().iterator(); iterator.hasNext();) {
361 MethodDescriptor md = (MethodDescriptor) iterator.next();
362 SSJavaLattice<String> locOrder = getLattice(md);
363 // writeLatticeDotFile(md.getClassDesc(), md, getMethodLattice(md));
364 HierarchyGraph hg = mapDescriptorToHierarchyGraph.get(md);
365 // System.out.println("~~~\t" + md.getClassDesc() + "_" + md + "\t"
366 // + locOrder.getKeySet().size() + "\t" + hg.getNodeSet().size());
369 if (state.SSJAVA_INFER_NAIVE_WRITEDOTS) {
370 System.out.println("The number of elements: Naive=" + numLocationsNaive);
372 System.out.println("The number of elements: SInfer=" + numLocationsSInfer);
378 private void calculateReturnPCLocInheritance() {
379 calculateHighestPCLocInheritance();
380 calculateLowestReturnLocInheritance();
381 updateFlowGraphPCReturnLocInheritance();
384 private void updateFlowGraphPCReturnLocInheritance() {
386 Set<MethodDescriptor> keySet = mapHighestOverriddenMethodDescToMethodDescSet.keySet();
387 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
388 MethodDescriptor highestMethodDesc = (MethodDescriptor) iterator.next();
390 if (mapHighestOverriddenMethodDescToMethodDescSet.get(highestMethodDesc).size() == 1) {
394 Set<MethodDescriptor> methodDescSet =
395 mapHighestOverriddenMethodDescToMethodDescSet.get(highestMethodDesc);
397 NTuple<Descriptor> highestPCLocDescTuple =
398 mapHighestOverriddenMethodDescToPCLocTuple.get(highestMethodDesc);
400 NTuple<Descriptor> highestRETURNLocDescTuple =
401 mapHighestOverriddenMethodDescToReturnLocTuple.get(highestMethodDesc);
403 // System.out.println("\n$$$$$$$$$$$$$$$$updateFlowGraphPCReturnLocInheritance="
404 // + highestMethodDesc);
405 // System.out.println("-----highestPCLoc=" + highestPCLocDescTuple);
406 // System.out.println("-----highestRETURNLoc=" + highestRETURNLocDescTuple);
408 for (Iterator iterator2 = methodDescSet.iterator(); iterator2.hasNext();) {
409 MethodDescriptor md = (MethodDescriptor) iterator2.next();
410 // System.out.println("\n --------MD=" + md);
411 FlowGraph flowGraph = getFlowGraph(md);
413 MethodSummary summary = getMethodSummary(md);
414 CompositeLocation curPCLoc = summary.getPCLoc();
415 NTuple<Descriptor> curPCDescTuple = translateToDescTuple(curPCLoc.getTuple());
416 // System.out.println("md=" + md + " curPCLoc=" + curPCLoc);
417 // System.out.println("highestPCLoc=" + highestPCLocDescTuple);
419 if (highestPCLocDescTuple == null) {
420 // this case: PCLOC is top
421 // System.out.println("###SET PCLOC AS TOP");
422 if (curPCDescTuple != null && !curPCLoc.get(0).isTop()) {
423 FlowNode pcFlowNode = flowGraph.getFlowNode(curPCDescTuple);
424 flowGraph.removeNode(pcFlowNode);
426 summary.setPCLoc(new CompositeLocation(new Location(md, Location.TOP)));
428 NTuple<Descriptor> newPCDescTuple = new NTuple<Descriptor>();
429 if (highestPCLocDescTuple.size() == 1) {
430 newPCDescTuple.add(highestPCLocDescTuple.get(0));
432 newPCDescTuple.add(md.getThis());
433 newPCDescTuple.add(highestPCLocDescTuple.get(1));
435 if (!curPCDescTuple.equals(newPCDescTuple)) {
436 FlowNode pcFlowNode = flowGraph.getFlowNode(curPCDescTuple);
437 flowGraph.updateTuple(pcFlowNode, newPCDescTuple);
438 // flowGraph.removeNode(pcFlowNode);
439 Set<NTuple<Descriptor>> descSetLowerThanPCLoc =
440 mapHighestOverriddenMethodDescToSetLowerThanPCLoc.get(highestMethodDesc);
441 for (Iterator iterator3 = descSetLowerThanPCLoc.iterator(); iterator3.hasNext();) {
442 NTuple<Descriptor> lowerNTuple = (NTuple<Descriptor>) iterator3.next();
443 flowGraph.addValueFlowEdge(newPCDescTuple, lowerNTuple);
445 CompositeLocation newPCCompLoc =
446 new CompositeLocation(translateToLocTuple(md, newPCDescTuple));
447 summary.setPCLoc(newPCCompLoc);
453 if (highestRETURNLocDescTuple != null) {
454 CompositeLocation curRETURNLoc = summary.getRETURNLoc();
455 NTuple<Descriptor> curReturnDescTuple = translateToDescTuple(curRETURNLoc.getTuple());
457 if (!curReturnDescTuple.equals(highestRETURNLocDescTuple)) {
458 // handle the case that RETURNLOC is started with 'this'...
459 NTuple<Descriptor> newRETURNLocDescTuple = new NTuple<Descriptor>();
460 if (highestRETURNLocDescTuple.size() == 1) {
461 newRETURNLocDescTuple.add(highestRETURNLocDescTuple.get(0));
463 newRETURNLocDescTuple.add(md.getThis());
464 newRETURNLocDescTuple.add(highestRETURNLocDescTuple.get(1));
467 FlowNode returnFlowNode = flowGraph.getFlowNode(curReturnDescTuple);
468 flowGraph.updateTuple(returnFlowNode, newRETURNLocDescTuple);
470 Set<NTuple<Descriptor>> descSetHigherThanRETURNLoc =
471 mapHighestOverriddenMethodDescToSetHigherThanRETURNLoc.get(highestMethodDesc);
472 for (Iterator iterator3 = descSetHigherThanRETURNLoc.iterator(); iterator3.hasNext();) {
473 NTuple<Descriptor> higherNTuple = (NTuple<Descriptor>) iterator3.next();
474 flowGraph.addValueFlowEdge(higherNTuple, newRETURNLocDescTuple);
477 CompositeLocation newRETURNLocCompLoc =
478 new CompositeLocation(translateToLocTuple(md, newRETURNLocDescTuple));
479 summary.setRETURNLoc(newRETURNLocCompLoc);
486 private void calculateHighestPCLocInheritance() {
488 Set<MethodDescriptor> keySet = mapHighestOverriddenMethodDescToMethodDescSet.keySet();
490 Map<MethodDescriptor, Integer> mapMethodDescToParamCount =
491 new HashMap<MethodDescriptor, Integer>();
493 next: for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
494 MethodDescriptor highestMethodDesc = (MethodDescriptor) iterator.next();
496 NTuple<Descriptor> tempTuple = null;
498 if (getMethodSummary(highestMethodDesc).getPCLoc() != null) {
500 Set<MethodDescriptor> methodDescSet =
501 mapHighestOverriddenMethodDescToMethodDescSet.get(highestMethodDesc);
503 if (methodDescSet.size() > 1) {
504 // System.out.println("---method desc set=" + methodDescSet + " from=" +
505 // highestMethodDesc);
510 for (Iterator iterator2 = methodDescSet.iterator(); iterator2.hasNext();) {
511 MethodDescriptor md = (MethodDescriptor) iterator2.next();
513 FlowGraph flowGraph = getFlowGraph(md);
514 if (flowGraph == null) {
517 Set<FlowNode> paramNodeSet = flowGraph.getParamFlowNodeSet();
518 // System.out.println("###md=" + md + " paramNodeSet=" + paramNodeSet);
520 CompositeLocation pcLOC = getMethodSummary(md).getPCLoc();
521 // System.out.println("---pcLOC=" + pcLOC);
523 if (md.equals(highestMethodDesc)) {
524 mapHighestOverriddenMethodDescToPCLocTuple.put(highestMethodDesc,
525 translateToDescTuple(pcLOC.getTuple()));
528 if (!pcLOC.get(0).isTop()) {
530 FlowNode pcFlowNode = flowGraph.getFlowNode(translateToDescTuple(pcLOC.getTuple()));
533 for (Iterator iterator3 = paramNodeSet.iterator(); iterator3.hasNext();) {
534 FlowNode paramNode = (FlowNode) iterator3.next();
535 if (flowGraph.getReachableSetFrom(pcFlowNode.getCurrentDescTuple().subList(0, 1))
536 .contains(paramNode)) {
540 mapMethodDescToParamCount.put(md, count);
544 // the PC location is top
545 // if one of pcloc among the method inheritance chain has the TOP,
546 // all methods in the same chain should have the TOP.
547 mapHighestOverriddenMethodDescToPCLocTuple.remove(highestMethodDesc);
548 // System.out.println("highest=" + highestMethodDesc + " HIGHEST PCLOC="
549 // + mapHighestOverriddenMethodDescToPCLocTuple.get(highestMethodDesc));
551 Set<NTuple<Descriptor>> descTupleSetLowerThanPC = new HashSet<NTuple<Descriptor>>();
552 for (Iterator iterator3 = paramNodeSet.iterator(); iterator3.hasNext();) {
553 FlowNode flowNode = (FlowNode) iterator3.next();
554 descTupleSetLowerThanPC.add(flowNode.getCurrentDescTuple());
556 mapHighestOverriddenMethodDescToSetLowerThanPCLoc.put(highestMethodDesc,
557 descTupleSetLowerThanPC);
563 // identify which method in the inheritance chain has the highest PCLOC
564 // basically, finds a method that has the highest count or TOP location
565 int highestCount = -1;
566 MethodDescriptor methodDescHighestCount = null;
567 for (Iterator iterator2 = methodDescSet.iterator(); iterator2.hasNext();) {
568 MethodDescriptor methodDesc = (MethodDescriptor) iterator2.next();
569 if (mapMethodDescToParamCount.containsKey(methodDesc)) {
570 int curCount = mapMethodDescToParamCount.get(methodDesc).intValue();
571 if (highestCount < curCount) {
572 highestCount = curCount;
573 methodDescHighestCount = methodDesc;
578 if (methodDescHighestCount != null) {
579 FlowGraph flowGraph = getFlowGraph(methodDescHighestCount);
580 CompositeLocation pcLOC = getMethodSummary(methodDescHighestCount).getPCLoc();
581 FlowNode pcFlowNode = flowGraph.getFlowNode(translateToDescTuple(pcLOC.getTuple()));
582 Set<FlowNode> reachableSet =
583 flowGraph.getReachableSetFrom(pcFlowNode.getCurrentDescTuple().subList(0, 1));
585 Set<FlowNode> reachableParamNodeSet = new HashSet<FlowNode>();
586 for (Iterator iterator3 = reachableSet.iterator(); iterator3.hasNext();) {
587 FlowNode flowNode = (FlowNode) iterator3.next();
588 if (flowGraph.isParameter(flowNode.getCurrentDescTuple())) {
589 reachableParamNodeSet.add(flowNode);
594 Set<NTuple<Descriptor>> descTupleSetLowerThanPC = new HashSet<NTuple<Descriptor>>();
595 for (Iterator iterator2 = reachableParamNodeSet.iterator(); iterator2.hasNext();) {
596 FlowNode flowNode = (FlowNode) iterator2.next();
597 descTupleSetLowerThanPC.add(flowNode.getCurrentDescTuple());
600 // mapHighestOverriddenMethodDescToPCLocTuple.remove(highestMethodDesc);
601 mapHighestOverriddenMethodDescToSetLowerThanPCLoc.put(highestMethodDesc,
602 descTupleSetLowerThanPC);
607 // System.out.println("####################################");
608 // System.out.println(" highest=" + highestMethodDesc + " HIGHEST PCLOC="
609 // + mapHighestOverriddenMethodDescToPCLocTuple.get(highestMethodDesc));
610 // System.out.println(" setLowerThanPCLoc="
611 // + mapHighestOverriddenMethodDescToSetLowerThanPCLoc.get(highestMethodDesc));
616 private void calculateLowestReturnLocInheritance() {
618 Set<MethodDescriptor> keySet = mapHighestOverriddenMethodDescToMethodDescSet.keySet();
620 Map<MethodDescriptor, Integer> mapMethodDescToParamCount =
621 new HashMap<MethodDescriptor, Integer>();
623 next: for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
624 MethodDescriptor highestMethodDesc = (MethodDescriptor) iterator.next();
626 Set<MethodDescriptor> methodDescSet =
627 mapHighestOverriddenMethodDescToMethodDescSet.get(highestMethodDesc);
629 if (methodDescSet.size() > 1 && getMethodSummary(highestMethodDesc).getRETURNLoc() != null) {
634 for (Iterator iterator2 = methodDescSet.iterator(); iterator2.hasNext();) {
635 MethodDescriptor md = (MethodDescriptor) iterator2.next();
637 FlowGraph flowGraph = getFlowGraph(md);
638 Set<FlowNode> paramNodeSet = flowGraph.getParamFlowNodeSet();
640 CompositeLocation returnLoc = getMethodSummary(md).getRETURNLoc();
642 FlowNode returnFlowNode = flowGraph.getFlowNode(translateToDescTuple(returnLoc.getTuple()));
645 for (Iterator iterator3 = paramNodeSet.iterator(); iterator3.hasNext();) {
646 FlowNode paramNode = (FlowNode) iterator3.next();
647 if (flowGraph.getReachableSetFrom(paramNode.getCurrentDescTuple().subList(0, 1))
648 .contains(returnFlowNode)) {
652 mapMethodDescToParamCount.put(md, count);
653 // System.out.println("###returnLoc=" + returnLoc + " count higher=" + count);
656 // identify which method in the inheritance chain has the highest PCLOC
657 // basically, finds a method that has the highest count or TOP location
658 int highestCount = -1;
659 MethodDescriptor methodDescHighestCount = null;
660 for (Iterator iterator2 = methodDescSet.iterator(); iterator2.hasNext();) {
661 MethodDescriptor methodDesc = (MethodDescriptor) iterator2.next();
662 int curCount = mapMethodDescToParamCount.get(methodDesc).intValue();
663 if (highestCount < curCount) {
664 highestCount = curCount;
665 methodDescHighestCount = methodDesc;
669 if (methodDescHighestCount != null) {
670 FlowGraph flowGraph = getFlowGraph(methodDescHighestCount);
671 CompositeLocation returnLOC = getMethodSummary(methodDescHighestCount).getRETURNLoc();
672 NTuple<Descriptor> returnLocTuple = translateToDescTuple(returnLOC.getTuple());
673 FlowNode returnFlowNode = flowGraph.getFlowNode(returnLocTuple);
675 Set<FlowNode> curMethodParamNodeSet = flowGraph.getParamFlowNodeSet();
676 Set<NTuple<Descriptor>> descTupleSetHigherThanPC = new HashSet<NTuple<Descriptor>>();
677 for (Iterator iterator3 = curMethodParamNodeSet.iterator(); iterator3.hasNext();) {
678 FlowNode paramNode = (FlowNode) iterator3.next();
679 if (flowGraph.getReachableSetFrom(paramNode.getCurrentDescTuple().subList(0, 1))
680 .contains(returnFlowNode)) {
681 descTupleSetHigherThanPC.add(paramNode.getCurrentDescTuple());
685 mapHighestOverriddenMethodDescToReturnLocTuple.put(highestMethodDesc, returnLocTuple);
686 mapHighestOverriddenMethodDescToSetHigherThanRETURNLoc.put(highestMethodDesc,
687 descTupleSetHigherThanPC);
691 // System.out.println("####################################");
692 // System.out.println(" highest=" + highestMethodDesc + " LOWEST RETURNLOC="
693 // + mapHighestOverriddenMethodDescToReturnLocTuple.get(highestMethodDesc));
694 // System.out.println(" setHigherThanReturnLoc="
695 // + mapHighestOverriddenMethodDescToSetHigherThanRETURNLoc.get(highestMethodDesc));
701 private void addMapHighestMethodDescToMethodDesc(MethodDescriptor highest, MethodDescriptor md) {
702 if (!mapHighestOverriddenMethodDescToMethodDescSet.containsKey(highest)) {
703 mapHighestOverriddenMethodDescToMethodDescSet.put(highest, new HashSet<MethodDescriptor>());
705 mapHighestOverriddenMethodDescToMethodDescSet.get(highest).add(md);
708 private void DFSInheritanceTreeCalculatingHighestOverriddenMethod(ClassDescriptor cd) {
710 // ClassDescriptor cd = node.getData();
712 for (Iterator iterator = cd.getMethods(); iterator.hasNext();) {
713 MethodDescriptor md = (MethodDescriptor) iterator.next();
714 MethodDescriptor highestMethodDesc = getHighestOverriddenMethod(md.getClassDesc(), md);
715 mapMethodDescToHighestOverriddenMethodDesc.put(md, highestMethodDesc);
716 addMapHighestMethodDescToMethodDesc(highestMethodDesc, md);
721 Set<ClassDescriptor> children = getDirectSubClasses(cd);
722 for (Iterator iterator = children.iterator(); iterator.hasNext();) {
723 ClassDescriptor child = (ClassDescriptor) iterator.next();
724 DFSInheritanceTreeCalculatingHighestOverriddenMethod(child);
729 private MethodDescriptor getHighestOverriddenMethod(ClassDescriptor curClassDesc,
730 MethodDescriptor curMethodDesc) {
732 // Node<ClassDescriptor> curNode = inheritanceTree.getTreeNode(curClassDesc);
733 // Node<ClassDescriptor> parentNode = curNode.getParent();
734 ClassDescriptor parentClassDesc = curClassDesc.getSuperDesc();
736 if (parentClassDesc != null) {
737 if (parentClassDesc.getMethodTable().contains(curMethodDesc.getSymbol())) {
738 Set<MethodDescriptor> methodDescSet =
739 parentClassDesc.getMethodTable().getSet(curMethodDesc.getSymbol());
740 for (Iterator iterator = methodDescSet.iterator(); iterator.hasNext();) {
741 MethodDescriptor md = (MethodDescriptor) iterator.next();
742 if (md.matches(curMethodDesc)) {
743 return getHighestOverriddenMethod(parentClassDesc, md);
747 // traverse to the parent!
748 return getHighestOverriddenMethod(parentClassDesc, curMethodDesc);
750 return curMethodDesc;
753 private void buildInheritanceTree() {
755 DFSInheritanceTreeCalculatingHighestOverriddenMethod(rootClassDescriptor);
759 private void addInheritanceConstraintsToHierarchyGraph() {
761 // DFS the inheritance tree and propagates nodes/edges of parent to child
763 // Node<ClassDescriptor> rootNode = inheritanceTree.getRootNode();
764 DFSInheritanceTree(rootClassDescriptor);
768 private void DFSInheritanceTree(ClassDescriptor parentClassDescriptor) {
770 // ClassDescriptor parentClassDescriptor = parentNode.getData();
772 Set<ClassDescriptor> children = getDirectSubClasses(parentClassDescriptor);
773 for (Iterator iterator = children.iterator(); iterator.hasNext();) {
774 ClassDescriptor childClassDescriptor = (ClassDescriptor) iterator.next();
776 HierarchyGraph parentGraph = getHierarchyGraph(parentClassDescriptor);
777 HierarchyGraph childGraph = getHierarchyGraph(childClassDescriptor);
779 Set<HNode> parentNodeSet = parentGraph.getNodeSet();
780 for (Iterator iterator2 = parentNodeSet.iterator(); iterator2.hasNext();) {
781 HNode hNode = (HNode) iterator2.next();
782 childGraph.addNode(hNode);
785 // copies extra information from the parent hierarchy graph
786 Map<HNode, Set<HNode>> parentMergeNodeMap = parentGraph.getMapHNodetoMergeSet();
787 Map<HNode, Set<HNode>> childMergeNodeMap = childGraph.getMapHNodetoMergeSet();
789 Set<HNode> keySet = parentMergeNodeMap.keySet();
790 for (Iterator iterator2 = keySet.iterator(); iterator2.hasNext();) {
791 HNode parentKey = (HNode) iterator2.next();
792 if (!childMergeNodeMap.containsKey(parentKey)) {
793 childMergeNodeMap.put(parentKey, new HashSet<HNode>());
795 childMergeNodeMap.get(parentKey).addAll(parentMergeNodeMap.get(parentKey));
798 // copies nodes/edges from the parent class...
799 for (Iterator iterator2 = parentNodeSet.iterator(); iterator2.hasNext();) {
800 HNode parentHNode = (HNode) iterator2.next();
802 Set<HNode> parentIncomingHNode = parentGraph.getIncomingNodeSet(parentHNode);
803 Set<HNode> parentOutgoingHNode = parentGraph.getOutgoingNodeSet(parentHNode);
805 for (Iterator iterator3 = parentIncomingHNode.iterator(); iterator3.hasNext();) {
806 HNode inHNode = (HNode) iterator3.next();
807 childGraph.addEdge(inHNode.getDescriptor(), parentHNode.getDescriptor());
810 for (Iterator iterator3 = parentOutgoingHNode.iterator(); iterator3.hasNext();) {
811 HNode outHNode = (HNode) iterator3.next();
812 childGraph.addEdge(parentHNode.getDescriptor(), outHNode.getDescriptor());
817 // copies nodes/edges from parent methods to overridden methods
819 for (Iterator iterator3 = childClassDescriptor.getMethods(); iterator3.hasNext();) {
820 MethodDescriptor childMethodDescriptor = (MethodDescriptor) iterator3.next();
822 MethodDescriptor parentMethodDesc =
823 getParentMethodDesc(childMethodDescriptor.getClassDesc(), childMethodDescriptor);
825 if (parentMethodDesc != null) {
827 HierarchyGraph parentMethodGraph = getHierarchyGraph(parentMethodDesc);
828 HierarchyGraph childMethodGraph = getHierarchyGraph(childMethodDescriptor);
830 Set<HNode> parentMethodNodeSet = parentMethodGraph.getNodeSet();
831 for (Iterator iterator2 = parentMethodNodeSet.iterator(); iterator2.hasNext();) {
832 HNode hNode = (HNode) iterator2.next();
833 childMethodGraph.addNode(hNode);
836 // copies extra information from the parent hierarchy graph
837 Map<HNode, Set<HNode>> parentMethodMergeNodeMap =
838 parentMethodGraph.getMapHNodetoMergeSet();
839 Map<HNode, Set<HNode>> childMethodMergeNodeMap = childMethodGraph.getMapHNodetoMergeSet();
841 Set<HNode> methodKeySet = parentMethodMergeNodeMap.keySet();
842 for (Iterator iterator2 = methodKeySet.iterator(); iterator2.hasNext();) {
843 HNode parentKey = (HNode) iterator2.next();
844 if (!childMethodMergeNodeMap.containsKey(parentKey)) {
845 childMethodMergeNodeMap.put(parentKey, new HashSet<HNode>());
847 childMethodMergeNodeMap.get(parentKey).addAll(parentMethodMergeNodeMap.get(parentKey));
850 // copies nodes/edges from the parent method...
851 for (Iterator iterator2 = parentMethodGraph.getNodeSet().iterator(); iterator2.hasNext();) {
852 HNode parentHNode = (HNode) iterator2.next();
854 Set<HNode> parentIncomingHNode = parentMethodGraph.getIncomingNodeSet(parentHNode);
855 Set<HNode> parentOutgoingHNode = parentMethodGraph.getOutgoingNodeSet(parentHNode);
857 for (Iterator iterator4 = parentIncomingHNode.iterator(); iterator4.hasNext();) {
858 HNode inHNode = (HNode) iterator4.next();
859 childMethodGraph.addEdge(inHNode, parentHNode);
862 for (Iterator iterator4 = parentOutgoingHNode.iterator(); iterator4.hasNext();) {
863 HNode outHNode = (HNode) iterator4.next();
864 childMethodGraph.addEdge(parentHNode, outHNode);
873 DFSInheritanceTree(childClassDescriptor);
878 public MethodDescriptor getParentMethodDesc(ClassDescriptor classDesc, MethodDescriptor methodDesc) {
880 // Node<ClassDescriptor> childNode = inheritanceTree.getTreeNode(classDesc);
881 ClassDescriptor parentClassDesc = classDesc.getSuperDesc();
882 // Node<ClassDescriptor> parentNode = childNode.getParent();
884 if (parentClassDesc != null) {
885 // ClassDescriptor parentClassDesc = parentNode.getData();
886 if (parentClassDesc.getMethodTable().contains(methodDesc.getSymbol())) {
887 Set<MethodDescriptor> methodDescSet =
888 parentClassDesc.getMethodTable().getSet(methodDesc.getSymbol());
889 for (Iterator iterator = methodDescSet.iterator(); iterator.hasNext();) {
890 MethodDescriptor md = (MethodDescriptor) iterator.next();
891 if (md.matches(methodDesc)) {
897 // traverse to the parent!
898 getParentMethodDesc(parentClassDesc, methodDesc);
905 private void checkReturnNodes() {
906 LinkedList<MethodDescriptor> methodDescList =
907 (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
909 while (!methodDescList.isEmpty()) {
910 MethodDescriptor md = methodDescList.removeLast();
912 if (md.getReturnType() != null && !md.getReturnType().isVoid()) {
913 checkFlowNodeReturnThisField(md);
915 // // in this case, this method will return the composite location that starts with 'this'
916 // FlowGraph flowGraph = getFlowGraph(md);
917 // Set<FlowNode> returnNodeSet = flowGraph.getReturnNodeSet();
924 private void addSuperClasses(ClassDescriptor cd) {
925 ClassDescriptor parentClassDesc = cd.getSuperDesc();
926 if (parentClassDesc != null) {
927 toanalyze_classDescSet.add(parentClassDesc);
928 addSuperClasses(parentClassDesc);
932 private void updateFlowGraph() {
934 LinkedList<MethodDescriptor> methodDescList =
935 (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
937 while (!methodDescList.isEmpty()) {
938 MethodDescriptor md = methodDescList.removeLast();
939 if (state.SSJAVADEBUG) {
940 System.out.println();
941 System.out.println("SSJAVA: Updating a flow graph: " + md);
942 propagateFlowsFromCalleesWithNoCompositeLocation(md);
945 Set<FlowNode> nodeSet = getFlowGraph(md).getNodeSet();
946 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
947 FlowNode flowNode = (FlowNode) iterator.next();
948 NTuple<Descriptor> descTuple = flowNode.getCurrentDescTuple();
949 NTuple<Location> locTuple = translateToLocTuple(md, descTuple);
950 for (int i = 0; i < locTuple.size(); i++) {
951 Location loc = locTuple.get(i);
952 if (loc.getDescriptor() instanceof ClassDescriptor) {
953 ClassDescriptor classDesc = (ClassDescriptor) loc.getDescriptor();
954 toanalyze_classDescSet.add(classDesc);
955 addSuperClasses(classDesc);
956 } else if (loc.getDescriptor() instanceof MethodDescriptor) {
957 toanalyze_classDescSet.add(((MethodDescriptor) loc.getDescriptor()).getClassDesc());
966 public Map<NTuple<Descriptor>, NTuple<Descriptor>> getMapCallerArgToCalleeParam(
967 MethodInvokeNode min) {
969 if (!mapMethodInvokeNodeToMapCallerArgToCalleeArg.containsKey(min)) {
970 mapMethodInvokeNodeToMapCallerArgToCalleeArg.put(min,
971 new HashMap<NTuple<Descriptor>, NTuple<Descriptor>>());
974 return mapMethodInvokeNodeToMapCallerArgToCalleeArg.get(min);
977 public void addMapCallerArgToCalleeParam(MethodInvokeNode min, NTuple<Descriptor> callerArg,
978 NTuple<Descriptor> calleeParam) {
979 getMapCallerArgToCalleeParam(min).put(callerArg, calleeParam);
982 private void assignCompositeLocation() {
983 calculateGlobalValueFlowCompositeLocation();
984 translateCompositeLocationAssignmentToFlowGraph();
987 private void translateCompositeLocationAssignmentToFlowGraph() {
988 System.out.println("\nSSJAVA: Translate composite location assignments to flow graphs:");
989 MethodDescriptor methodEventLoopDesc = ssjava.getMethodContainingSSJavaLoop();
990 translateCompositeLocationAssignmentToFlowGraph(methodEventLoopDesc);
993 private void translateCompositeLocationAssignmentToFlowGraph2() {
994 System.out.println("\nSSJAVA: Translate composite location assignments to flow graphs:");
995 MethodDescriptor methodEventLoopDesc = ssjava.getMethodContainingSSJavaLoop();
996 translateCompositeLocationAssignmentToFlowGraph(methodEventLoopDesc);
999 private void addAdditionalOrderingConstraints() {
1000 System.out.println("\nSSJAVA: Add addtional ordering constriants:");
1001 MethodDescriptor methodEventLoopDesc = ssjava.getMethodContainingSSJavaLoop();
1002 addAddtionalOrderingConstraints(methodEventLoopDesc);
1003 // calculateReturnHolderLocation();
1006 private void calculateReturnHolderLocation() {
1007 LinkedList<MethodDescriptor> methodDescList =
1008 (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
1010 while (!methodDescList.isEmpty()) {
1011 MethodDescriptor md = methodDescList.removeLast();
1013 FlowGraph fg = getFlowGraph(md);
1014 Set<FlowNode> nodeSet = fg.getNodeSet();
1015 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
1016 FlowNode flowNode = (FlowNode) iterator.next();
1017 if (flowNode.isFromHolder()) {
1018 calculateCompositeLocationFromFlowGraph(md, flowNode);
1025 private void updateCompositeLocationAssignments() {
1027 LinkedList<MethodDescriptor> methodDescList =
1028 (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
1030 while (!methodDescList.isEmpty()) {
1031 MethodDescriptor md = methodDescList.removeLast();
1033 // System.out.println("\n#updateCompositeLocationAssignments=" + md);
1035 FlowGraph flowGraph = getFlowGraph(md);
1037 MethodSummary methodSummary = getMethodSummary(md);
1039 Set<FlowNode> nodeSet = flowGraph.getNodeSet();
1040 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
1041 FlowNode node = (FlowNode) iterator.next();
1042 // System.out.println("-node=" + node + " node.getDescTuple=" + node.getDescTuple());
1043 if (node.getCompositeLocation() != null) {
1044 CompositeLocation compLoc = node.getCompositeLocation();
1045 CompositeLocation updatedCompLoc = updateCompositeLocation(compLoc);
1046 node.setCompositeLocation(updatedCompLoc);
1047 // System.out.println("---updatedCompLoc1=" + updatedCompLoc);
1049 NTuple<Descriptor> descTuple = node.getDescTuple();
1050 // System.out.println("update desc=" + descTuple);
1051 CompositeLocation compLoc = convertToCompositeLocation(md, descTuple);
1052 compLoc = updateCompositeLocation(compLoc);
1053 node.setCompositeLocation(compLoc);
1054 // System.out.println("---updatedCompLoc2=" + compLoc);
1057 if (node.isDeclaratonNode()) {
1058 Descriptor localVarDesc = node.getDescTuple().get(0);
1059 CompositeLocation compLoc = updateCompositeLocation(node.getCompositeLocation());
1060 methodSummary.addMapVarNameToInferCompLoc(localVarDesc, compLoc);
1064 // update PCLOC and RETURNLOC if they have a composite location assignment
1065 if (methodSummary.getRETURNLoc() != null) {
1066 methodSummary.setRETURNLoc(updateCompositeLocation(methodSummary.getRETURNLoc()));
1068 if (methodSummary.getPCLoc() != null) {
1069 methodSummary.setPCLoc(updateCompositeLocation(methodSummary.getPCLoc()));
1076 private CompositeLocation updateCompositeLocation(CompositeLocation compLoc) {
1077 CompositeLocation updatedCompLoc = new CompositeLocation();
1078 for (int i = 0; i < compLoc.getSize(); i++) {
1079 Location loc = compLoc.get(i);
1080 String nodeIdentifier = loc.getLocIdentifier();
1081 Descriptor enclosingDesc = loc.getDescriptor();
1083 if (!enclosingDesc.equals(GLOBALDESC)) {
1084 LocationSummary locSummary = getLocationSummary(enclosingDesc);
1085 // HierarchyGraph scGraph = getSkeletonCombinationHierarchyGraph(enclosingDesc);
1086 HierarchyGraph scGraph = getSimpleHierarchyGraph(enclosingDesc);
1087 if (scGraph != null) {
1088 HNode curNode = scGraph.getCurrentHNode(nodeIdentifier);
1089 // System.out.println("nodeID=" + nodeIdentifier + " curNode=" + curNode
1090 // + " enclosingDesc=" + enclosingDesc);
1091 if (curNode != null) {
1092 nodeIdentifier = curNode.getName();
1095 locName = locSummary.getLocationName(nodeIdentifier);
1097 locName = nodeIdentifier;
1099 Location updatedLoc = new Location(enclosingDesc, locName);
1100 updatedCompLoc.addLocation(updatedLoc);
1103 return updatedCompLoc;
1106 private void translateCompositeLocationAssignmentToFlowGraph(MethodDescriptor mdCaller) {
1108 // System.out.println("\n\n###translateCompositeLocationAssignmentToFlowGraph mdCaller="
1111 // First, assign a composite location to a node in the flow graph
1112 GlobalFlowGraph callerGlobalFlowGraph = getSubGlobalFlowGraph(mdCaller);
1114 FlowGraph callerFlowGraph = getFlowGraph(mdCaller);
1115 Map<Location, CompositeLocation> callerMapLocToCompLoc =
1116 callerGlobalFlowGraph.getMapLocationToInferCompositeLocation();
1118 Set<Location> methodLocSet = callerMapLocToCompLoc.keySet();
1119 for (Iterator iterator = methodLocSet.iterator(); iterator.hasNext();) {
1120 Location methodLoc = (Location) iterator.next();
1121 if (methodLoc.getDescriptor().equals(mdCaller)) {
1122 CompositeLocation inferCompLoc = callerMapLocToCompLoc.get(methodLoc);
1123 assignCompositeLocationToFlowGraph(callerFlowGraph, methodLoc, inferCompLoc);
1127 Set<MethodInvokeNode> minSet = mapMethodDescriptorToMethodInvokeNodeSet.get(mdCaller);
1129 Set<MethodDescriptor> calleeSet = new HashSet<MethodDescriptor>();
1130 for (Iterator iterator = minSet.iterator(); iterator.hasNext();) {
1131 MethodInvokeNode min = (MethodInvokeNode) iterator.next();
1132 // need to translate a composite location that is started with the base
1134 translateMapLocationToInferCompositeLocationToCalleeGraph(callerGlobalFlowGraph, min);
1135 MethodDescriptor mdCallee = min.getMethod();
1136 calleeSet.add(mdCallee);
1140 for (Iterator iterator = calleeSet.iterator(); iterator.hasNext();) {
1141 MethodDescriptor callee = (MethodDescriptor) iterator.next();
1142 translateCompositeLocationAssignmentToFlowGraph(callee);
1147 private void addAddtionalOrderingConstraints(MethodDescriptor mdCaller) {
1149 // First, assign a composite location to a node in the flow graph
1150 GlobalFlowGraph callerGlobalFlowGraph = getSubGlobalFlowGraph(mdCaller);
1152 FlowGraph callerFlowGraph = getFlowGraph(mdCaller);
1153 Map<Location, CompositeLocation> callerMapLocToCompLoc =
1154 callerGlobalFlowGraph.getMapLocationToInferCompositeLocation();
1155 Set<Location> methodLocSet = callerMapLocToCompLoc.keySet();
1157 Set<MethodInvokeNode> minSet = mapMethodDescriptorToMethodInvokeNodeSet.get(mdCaller);
1159 Set<MethodDescriptor> calleeSet = new HashSet<MethodDescriptor>();
1160 for (Iterator iterator = minSet.iterator(); iterator.hasNext();) {
1161 MethodInvokeNode min = (MethodInvokeNode) iterator.next();
1162 MethodDescriptor mdCallee = min.getMethod();
1163 calleeSet.add(mdCallee);
1166 // add an additional ordering constraint
1167 // if the first element of a parameter composite location matches 'this' reference,
1168 // the corresponding argument in the caller is required to be higher than the translated
1169 // parameter location in the caller lattice
1171 // addOrderingConstraintFromCompLocParamToArg(mdCaller, min);
1174 // update return flow nodes in the caller
1175 CompositeLocation returnLoc = getMethodSummary(mdCallee).getRETURNLoc();
1176 // System.out.println("### min=" + min.printNode(0) + " returnLoc=" + returnLoc);
1177 if (returnLoc != null && returnLoc.get(0).getLocDescriptor().equals(mdCallee.getThis())
1178 && returnLoc.getSize() > 1) {
1179 // System.out.println("###RETURN COMP LOC=" + returnLoc);
1180 NTuple<Location> returnLocTuple = returnLoc.getTuple();
1181 NTuple<Descriptor> baseTuple = mapMethodInvokeNodeToBaseTuple.get(min);
1182 // System.out.println("###basetuple=" + baseTuple);
1183 NTuple<Descriptor> newReturnTuple = baseTuple.clone();
1184 for (int i = 1; i < returnLocTuple.size(); i++) {
1185 newReturnTuple.add(returnLocTuple.get(i).getLocDescriptor());
1187 // System.out.println("###NEW RETURN TUPLE FOR CALLER=" + newReturnTuple);
1189 FlowReturnNode holderNode = callerFlowGraph.getFlowReturnNode(min);
1190 NodeTupleSet holderTupleSet =
1191 getNodeTupleSetFromReturnNode(getFlowGraph(mdCaller), holderNode);
1193 callerFlowGraph.getFlowReturnNode(min).setNewTuple(newReturnTuple);
1195 // then need to remove old constraints
1197 // System.out.println("###REMOVE OLD CONSTRAINTS=" + holderNode);
1198 for (Iterator<NTuple<Descriptor>> iter = holderTupleSet.iterator(); iter.hasNext();) {
1199 NTuple<Descriptor> tupleFromHolder = iter.next();
1200 Set<FlowEdge> holderOutEdge = callerFlowGraph.getOutEdgeSet(holderNode);
1201 for (Iterator iterator2 = holderOutEdge.iterator(); iterator2.hasNext();) {
1202 FlowEdge outEdge = (FlowEdge) iterator2.next();
1203 NTuple<Descriptor> toberemovedTuple = outEdge.getEndTuple();
1204 // System.out.println("---remove " + tupleFromHolder + " -> " + toberemovedTuple);
1205 callerFlowGraph.removeEdge(tupleFromHolder, toberemovedTuple);
1210 // if the return loc set was empty and later pcloc was connected to the return loc
1211 // need to make sure that return loc reflects to this changes.
1212 FlowReturnNode flowReturnNode = callerFlowGraph.getFlowReturnNode(min);
1213 if (flowReturnNode != null && flowReturnNode.getReturnTupleSet().isEmpty()) {
1215 if (needToUpdateReturnLocHolder(min.getMethod(), flowReturnNode)) {
1216 NTuple<Descriptor> baseTuple = mapMethodInvokeNodeToBaseTuple.get(min);
1217 NTuple<Descriptor> newReturnTuple = baseTuple.clone();
1218 flowReturnNode.addTuple(newReturnTuple);
1227 for (Iterator iterator = calleeSet.iterator(); iterator.hasNext();) {
1228 MethodDescriptor callee = (MethodDescriptor) iterator.next();
1229 addAddtionalOrderingConstraints(callee);
1234 private boolean needToUpdateReturnLocHolder(MethodDescriptor mdCallee,
1235 FlowReturnNode flowReturnNode) {
1236 FlowGraph fg = getFlowGraph(mdCallee);
1237 MethodSummary summary = getMethodSummary(mdCallee);
1238 CompositeLocation returnCompLoc = summary.getRETURNLoc();
1239 NTuple<Descriptor> returnDescTuple = translateToDescTuple(returnCompLoc.getTuple());
1240 Set<FlowNode> incomingNodeToReturnNode =
1241 fg.getIncomingFlowNodeSet(fg.getFlowNode(returnDescTuple));
1242 for (Iterator iterator = incomingNodeToReturnNode.iterator(); iterator.hasNext();) {
1243 FlowNode inNode = (FlowNode) iterator.next();
1244 if (inNode.getDescTuple().get(0).equals(mdCallee.getThis())) {
1251 private void addMapMethodDescToMethodInvokeNodeSet(MethodInvokeNode min) {
1252 MethodDescriptor md = min.getMethod();
1253 if (!mapMethodDescToMethodInvokeNodeSet.containsKey(md)) {
1254 mapMethodDescToMethodInvokeNodeSet.put(md, new HashSet<MethodInvokeNode>());
1256 mapMethodDescToMethodInvokeNodeSet.get(md).add(min);
1259 private Set<MethodInvokeNode> getMethodInvokeNodeSetByMethodDesc(MethodDescriptor md) {
1260 if (!mapMethodDescToMethodInvokeNodeSet.containsKey(md)) {
1261 mapMethodDescToMethodInvokeNodeSet.put(md, new HashSet<MethodInvokeNode>());
1263 return mapMethodDescToMethodInvokeNodeSet.get(md);
1266 public void assignCompositeLocationToFlowGraph(FlowGraph flowGraph, Location loc,
1267 CompositeLocation inferCompLoc) {
1268 Descriptor localDesc = loc.getLocDescriptor();
1270 Set<FlowNode> nodeSet = flowGraph.getNodeSet();
1271 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
1272 FlowNode node = (FlowNode) iterator.next();
1273 if (node.getDescTuple().startsWith(localDesc)
1274 && !node.getDescTuple().get(0).equals(LITERALDESC)) {
1275 // need to assign the inferred composite location to this node
1276 CompositeLocation newCompLoc = generateCompositeLocation(node.getDescTuple(), inferCompLoc);
1277 node.setCompositeLocation(newCompLoc);
1278 // System.out.println("SET Node=" + node + " inferCompLoc=" + newCompLoc);
1283 private CompositeLocation generateCompositeLocation(NTuple<Descriptor> nodeDescTuple,
1284 CompositeLocation inferCompLoc) {
1286 // System.out.println("generateCompositeLocation=" + nodeDescTuple + " with inferCompLoc="
1289 MethodDescriptor md = (MethodDescriptor) inferCompLoc.get(0).getDescriptor();
1291 CompositeLocation newCompLoc = new CompositeLocation();
1292 for (int i = 0; i < inferCompLoc.getSize(); i++) {
1293 newCompLoc.addLocation(inferCompLoc.get(i));
1296 Descriptor lastDescOfPrefix = nodeDescTuple.get(0);
1297 Descriptor enclosingDescriptor;
1298 if (lastDescOfPrefix instanceof InterDescriptor) {
1299 enclosingDescriptor = getFlowGraph(md).getEnclosingDescriptor(lastDescOfPrefix);
1301 enclosingDescriptor = ((VarDescriptor) lastDescOfPrefix).getType().getClassDesc();
1304 for (int i = 1; i < nodeDescTuple.size(); i++) {
1305 Descriptor desc = nodeDescTuple.get(i);
1306 Location locElement = new Location(enclosingDescriptor, desc);
1307 newCompLoc.addLocation(locElement);
1309 enclosingDescriptor = ((FieldDescriptor) desc).getClassDescriptor();
1315 private void translateMapLocationToInferCompositeLocationToCalleeGraph(
1316 GlobalFlowGraph callerGraph, MethodInvokeNode min) {
1318 MethodDescriptor mdCallee = min.getMethod();
1319 MethodDescriptor mdCaller = callerGraph.getMethodDescriptor();
1320 Map<Location, CompositeLocation> callerMapLocToCompLoc =
1321 callerGraph.getMapLocationToInferCompositeLocation();
1323 Map<Integer, NTuple<Descriptor>> mapIdxToArgTuple = mapMethodInvokeNodeToArgIdxMap.get(min);
1325 FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
1326 GlobalFlowGraph calleeGlobalGraph = getSubGlobalFlowGraph(mdCallee);
1328 NTuple<Location> baseLocTuple = null;
1329 if (mapMethodInvokeNodeToBaseTuple.containsKey(min)) {
1330 baseLocTuple = translateToLocTuple(mdCaller, mapMethodInvokeNodeToBaseTuple.get(min));
1333 // System.out.println("\n-#translate caller=" + mdCaller + " infer composite loc to callee="
1334 // + mdCallee + " baseLocTuple=" + baseLocTuple);
1336 Set<Location> keySet = callerMapLocToCompLoc.keySet();
1337 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
1338 Location key = (Location) iterator.next();
1339 CompositeLocation callerCompLoc = callerMapLocToCompLoc.get(key);
1341 if (!key.getDescriptor().equals(mdCaller)) {
1343 CompositeLocation newCalleeCompLoc;
1344 if (baseLocTuple != null && callerCompLoc.getTuple().startsWith(baseLocTuple)) {
1345 // System.out.println("-----need to translate callerCompLoc=" + callerCompLoc
1346 // + " with baseTuple=" + baseLocTuple);
1348 translateCompositeLocationToCallee(callerCompLoc, baseLocTuple, mdCallee);
1350 calleeGlobalGraph.addMapLocationToInferCompositeLocation(key, newCalleeCompLoc);
1351 // System.out.println("1---key=" + key + " callerCompLoc=" + callerCompLoc
1352 // + " newCalleeCompLoc=" + newCalleeCompLoc);
1353 // System.out.println("-----caller=" + mdCaller + " callee=" + mdCallee);
1354 if (!newCalleeCompLoc.get(0).getDescriptor().equals(mdCallee)) {
1358 // System.out.println("-----baseLoctuple=" + baseLocTuple);
1360 // check if it is the global access
1361 Location compLocFirstElement = callerCompLoc.getTuple().get(0);
1362 if (compLocFirstElement.getDescriptor().equals(mdCallee)
1363 && compLocFirstElement.getLocDescriptor().equals(GLOBALDESC)) {
1365 newCalleeCompLoc = new CompositeLocation();
1366 Location newMethodLoc = new Location(mdCallee, GLOBALDESC);
1368 newCalleeCompLoc.addLocation(newMethodLoc);
1369 for (int i = 1; i < callerCompLoc.getSize(); i++) {
1370 newCalleeCompLoc.addLocation(callerCompLoc.get(i));
1372 calleeGlobalGraph.addMapLocationToInferCompositeLocation(key, newCalleeCompLoc);
1373 // System.out.println("2---key=" + key + " callerCompLoc=" + callerCompLoc
1374 // + " newCalleeCompLoc=" + newCalleeCompLoc);
1375 // System.out.println("-----caller=" + mdCaller + " callee=" + mdCallee);
1378 int paramIdx = getParamIdx(callerCompLoc, mapIdxToArgTuple);
1379 if (paramIdx == -1) {
1380 // here, the first element of the current composite location comes from the current
1382 // so transfer the same composite location to the callee
1383 if (!calleeGlobalGraph.contrainsInferCompositeLocationMapKey(key)) {
1384 if (callerCompLoc.get(0).getDescriptor().equals(mdCallee)) {
1385 // System.out.println("3---key=" + key + " callerCompLoc=" + callerCompLoc
1386 // + " newCalleeCompLoc=" + callerCompLoc);
1387 // System.out.println("-----caller=" + mdCaller + " callee=" + mdCallee);
1388 calleeGlobalGraph.addMapLocationToInferCompositeLocation(key, callerCompLoc);
1390 // System.out.println("3---SKIP key=" + key + " callerCompLoc=" + callerCompLoc);
1396 // It is the case where two parameters have relative orderings between them by having
1397 // composite locations
1398 // if we found the param idx, it means that the first part of the caller composite
1399 // location corresponds to the one of arguments.
1400 // for example, if the caller argument is <<caller.this>,<Decoder.br>>
1401 // and the current caller composite location mapping
1402 // <<caller.this>,<Decoder.br>,<Br.value>>
1403 // and the parameter which matches with the caller argument is 'Br brParam'
1404 // then, the translated callee composite location will be <<callee.brParam>,<Br.value>>
1405 NTuple<Descriptor> argTuple = mapIdxToArgTuple.get(paramIdx);
1407 FlowNode paramFlowNode = calleeFlowGraph.getParamFlowNode(paramIdx);
1408 NTuple<Location> paramLocTuple =
1409 translateToLocTuple(mdCallee, paramFlowNode.getDescTuple());
1410 newCalleeCompLoc = new CompositeLocation();
1411 for (int i = 0; i < paramLocTuple.size(); i++) {
1412 newCalleeCompLoc.addLocation(paramLocTuple.get(i));
1414 for (int i = argTuple.size(); i < callerCompLoc.getSize(); i++) {
1415 newCalleeCompLoc.addLocation(callerCompLoc.get(i));
1417 calleeGlobalGraph.addMapLocationToInferCompositeLocation(key, newCalleeCompLoc);
1418 // System.out.println("4---key=" + key + " callerCompLoc=" + callerCompLoc
1419 // + " newCalleeCompLoc=" + newCalleeCompLoc);
1420 // System.out.println("-----caller=" + mdCaller + " callee=" + mdCallee);
1429 // System.out.println("#ASSIGN COMP LOC TO CALLEE PARAMS: callee=" + mdCallee + " caller="
1431 // If the location of an argument has a composite location
1432 // need to assign a proper composite location to the corresponding callee parameter
1433 Set<Integer> idxSet = mapIdxToArgTuple.keySet();
1434 for (Iterator iterator = idxSet.iterator(); iterator.hasNext();) {
1435 Integer idx = (Integer) iterator.next();
1437 if (idx == 0 && !min.getMethod().isStatic()) {
1441 NTuple<Descriptor> argTuple = mapIdxToArgTuple.get(idx);
1442 // System.out.println("-argTuple=" + argTuple + " idx=" + idx);
1443 if (argTuple.size() > 0) {
1444 // check if an arg tuple has been already assigned to a composite location
1445 NTuple<Location> argLocTuple = translateToLocTuple(mdCaller, argTuple);
1446 Location argLocalLoc = argLocTuple.get(0);
1448 // if (!isPrimitiveType(argTuple)) {
1449 if (callerMapLocToCompLoc.containsKey(argLocalLoc)) {
1451 CompositeLocation callerCompLoc = callerMapLocToCompLoc.get(argLocalLoc);
1452 for (int i = 1; i < argLocTuple.size(); i++) {
1453 callerCompLoc.addLocation(argLocTuple.get(i));
1456 // System.out.println("---callerCompLoc=" + callerCompLoc);
1458 // if (baseLocTuple != null && callerCompLoc.getTuple().startsWith(baseLocTuple)) {
1460 FlowNode calleeParamFlowNode = calleeFlowGraph.getParamFlowNode(idx);
1462 NTuple<Descriptor> calleeParamDescTuple = calleeParamFlowNode.getDescTuple();
1463 NTuple<Location> calleeParamLocTuple =
1464 translateToLocTuple(mdCallee, calleeParamDescTuple);
1466 int refParamIdx = getParamIdx(callerCompLoc, mapIdxToArgTuple);
1467 // System.out.println("-----paramIdx=" + refParamIdx);
1468 if (refParamIdx == 0 && !mdCallee.isStatic()) {
1470 // System.out.println("-------need to translate callerCompLoc=" + callerCompLoc
1471 // + " with baseTuple=" + baseLocTuple + " calleeParamLocTuple="
1472 // + calleeParamLocTuple);
1474 CompositeLocation newCalleeCompLoc =
1475 translateCompositeLocationToCallee(callerCompLoc, baseLocTuple, mdCallee);
1477 calleeGlobalGraph.addMapLocationToInferCompositeLocation(calleeParamLocTuple.get(0),
1480 // System.out.println("---------key=" + calleeParamLocTuple.get(0) + " callerCompLoc="
1481 // + callerCompLoc + " newCalleeCompLoc=" + newCalleeCompLoc);
1483 } else if (refParamIdx != -1) {
1484 // the first element of an argument composite location matches with one of paramtere
1485 // composite locations
1487 // System.out.println("-------param match case=");
1489 NTuple<Descriptor> argTupleRef = mapIdxToArgTuple.get(refParamIdx);
1490 FlowNode refParamFlowNode = calleeFlowGraph.getParamFlowNode(refParamIdx);
1491 NTuple<Location> refParamLocTuple =
1492 translateToLocTuple(mdCallee, refParamFlowNode.getDescTuple());
1494 // System.out.println("---------refParamLocTuple=" + refParamLocTuple
1495 // + " from argTupleRef=" + argTupleRef);
1497 CompositeLocation newCalleeCompLoc = new CompositeLocation();
1498 for (int i = 0; i < refParamLocTuple.size(); i++) {
1499 newCalleeCompLoc.addLocation(refParamLocTuple.get(i));
1501 for (int i = argTupleRef.size(); i < callerCompLoc.getSize(); i++) {
1502 newCalleeCompLoc.addLocation(callerCompLoc.get(i));
1505 calleeGlobalGraph.addMapLocationToInferCompositeLocation(calleeParamLocTuple.get(0),
1508 calleeParamFlowNode.setCompositeLocation(newCalleeCompLoc);
1509 // System.out.println("-----------key=" + calleeParamLocTuple.get(0) +
1510 // " callerCompLoc="
1511 // + callerCompLoc + " newCalleeCompLoc=" + newCalleeCompLoc);
1514 CompositeLocation newCalleeCompLoc =
1515 calculateCompositeLocationFromSubGlobalGraph(mdCallee, calleeParamFlowNode);
1516 if (newCalleeCompLoc != null) {
1517 calleeGlobalGraph.addMapLocationToInferCompositeLocation(calleeParamLocTuple.get(0),
1519 calleeParamFlowNode.setCompositeLocation(newCalleeCompLoc);
1523 // System.out.println("-----------------calleeParamFlowNode="
1524 // + calleeParamFlowNode.getCompositeLocation());
1535 private CompositeLocation calculateCompositeLocationFromSubGlobalGraph(MethodDescriptor md,
1536 FlowNode paramNode) {
1538 // System.out.println("#############################################################");
1539 // System.out.println("calculateCompositeLocationFromSubGlobalGraph=" + paramNode);
1541 GlobalFlowGraph subGlobalFlowGraph = getSubGlobalFlowGraph(md);
1542 NTuple<Location> paramLocTuple = translateToLocTuple(md, paramNode.getDescTuple());
1543 GlobalFlowNode paramGlobalNode = subGlobalFlowGraph.getFlowNode(paramLocTuple);
1545 List<NTuple<Location>> prefixList = calculatePrefixList(subGlobalFlowGraph, paramGlobalNode);
1547 Location prefixLoc = paramLocTuple.get(0);
1549 Set<GlobalFlowNode> reachableNodeSet =
1550 subGlobalFlowGraph.getReachableNodeSetByPrefix(paramGlobalNode.getLocTuple().get(0));
1551 // Set<GlobalFlowNode> reachNodeSet = globalFlowGraph.getReachableNodeSetFrom(node);
1553 // System.out.println("node=" + node + " prefixList=" + prefixList);
1555 for (int i = 0; i < prefixList.size(); i++) {
1556 NTuple<Location> curPrefix = prefixList.get(i);
1557 Set<NTuple<Location>> reachableCommonPrefixSet = new HashSet<NTuple<Location>>();
1559 for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
1560 GlobalFlowNode reachNode = (GlobalFlowNode) iterator2.next();
1561 if (reachNode.getLocTuple().startsWith(curPrefix)) {
1562 reachableCommonPrefixSet.add(reachNode.getLocTuple());
1565 // System.out.println("reachableCommonPrefixSet=" + reachableCommonPrefixSet);
1567 if (!reachableCommonPrefixSet.isEmpty()) {
1569 MethodDescriptor curPrefixFirstElementMethodDesc =
1570 (MethodDescriptor) curPrefix.get(0).getDescriptor();
1572 MethodDescriptor nodePrefixLocFirstElementMethodDesc =
1573 (MethodDescriptor) prefixLoc.getDescriptor();
1575 // System.out.println("curPrefixFirstElementMethodDesc=" +
1576 // curPrefixFirstElementMethodDesc);
1577 // System.out.println("nodePrefixLocFirstElementMethodDesc="
1578 // + nodePrefixLocFirstElementMethodDesc);
1580 if (curPrefixFirstElementMethodDesc.equals(nodePrefixLocFirstElementMethodDesc)
1581 || isTransitivelyCalledFrom(nodePrefixLocFirstElementMethodDesc,
1582 curPrefixFirstElementMethodDesc)) {
1585 // if (!node.getLocTuple().startsWith(curPrefix.get(0))) {
1587 Location curPrefixLocalLoc = curPrefix.get(0);
1588 if (subGlobalFlowGraph.mapLocationToInferCompositeLocation.containsKey(curPrefixLocalLoc)) {
1589 // in this case, the local variable of the current prefix has already got a composite
1591 // so we just ignore the current composite location.
1593 // System.out.println("HERE WE DO NOT ASSIGN A COMPOSITE LOCATION TO =" + node
1594 // + " DUE TO " + curPrefix);
1598 if (!needToGenerateCompositeLocation(paramGlobalNode, curPrefix)) {
1599 // System.out.println("NO NEED TO GENERATE COMP LOC to " + paramGlobalNode
1600 // + " with prefix=" + curPrefix);
1604 Location targetLocalLoc = paramGlobalNode.getLocTuple().get(0);
1605 CompositeLocation newCompLoc = generateCompositeLocation(curPrefix);
1606 // System.out.println("NEED TO ASSIGN COMP LOC TO " + paramGlobalNode + " with prefix="
1608 // System.out.println("-targetLocalLoc=" + targetLocalLoc + " - newCompLoc=" +
1611 // makes sure that a newly generated location appears in the hierarchy graph
1612 for (int compIdx = 0; compIdx < newCompLoc.getSize(); compIdx++) {
1613 Location curLoc = newCompLoc.get(compIdx);
1614 getHierarchyGraph(curLoc.getDescriptor()).getHNode(curLoc.getLocDescriptor());
1617 subGlobalFlowGraph.addMapLocationToInferCompositeLocation(targetLocalLoc, newCompLoc);
1629 private int getParamIdx(CompositeLocation compLoc,
1630 Map<Integer, NTuple<Descriptor>> mapIdxToArgTuple) {
1632 // if the composite location is started with the argument descriptor
1633 // return the argument's index. o.t. return -1
1635 Set<Integer> keySet = mapIdxToArgTuple.keySet();
1636 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
1637 Integer key = (Integer) iterator.next();
1638 NTuple<Descriptor> argTuple = mapIdxToArgTuple.get(key);
1639 if (argTuple.size() > 0 && translateToDescTuple(compLoc.getTuple()).startsWith(argTuple)) {
1640 // System.out.println("compLoc.getTuple=" + compLoc + " is started with " + argTuple);
1641 return key.intValue();
1648 private boolean isPrimitiveType(NTuple<Descriptor> argTuple) {
1650 Descriptor lastDesc = argTuple.get(argTuple.size() - 1);
1652 if (lastDesc instanceof FieldDescriptor) {
1653 return ((FieldDescriptor) lastDesc).getType().isPrimitive();
1654 } else if (lastDesc instanceof VarDescriptor) {
1655 return ((VarDescriptor) lastDesc).getType().isPrimitive();
1656 } else if (lastDesc instanceof InterDescriptor) {
1663 private CompositeLocation translateCompositeLocationToCallee(CompositeLocation callerCompLoc,
1664 NTuple<Location> baseLocTuple, MethodDescriptor mdCallee) {
1666 CompositeLocation newCalleeCompLoc = new CompositeLocation();
1668 Location calleeThisLoc = new Location(mdCallee, mdCallee.getThis());
1669 newCalleeCompLoc.addLocation(calleeThisLoc);
1671 // remove the base tuple from the caller
1672 // ex; In the method invoation foo.bar.methodA(), the callee will have the composite location
1673 // ,which is relative to the 'this' variable, <THIS,...>
1674 for (int i = baseLocTuple.size(); i < callerCompLoc.getSize(); i++) {
1675 newCalleeCompLoc.addLocation(callerCompLoc.get(i));
1678 return newCalleeCompLoc;
1682 private void calculateGlobalValueFlowCompositeLocation() {
1684 System.out.println("SSJAVA: Calculate composite locations in the global value flow graph");
1685 MethodDescriptor methodDescEventLoop = ssjava.getMethodContainingSSJavaLoop();
1686 GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(methodDescEventLoop);
1688 Set<Location> calculatedPrefixSet = new HashSet<Location>();
1690 Set<GlobalFlowNode> nodeSet = globalFlowGraph.getNodeSet();
1692 next: for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
1693 GlobalFlowNode node = (GlobalFlowNode) iterator.next();
1695 Location prefixLoc = node.getLocTuple().get(0);
1697 if (calculatedPrefixSet.contains(prefixLoc)) {
1698 // the prefix loc has been already assigned to a composite location
1702 calculatedPrefixSet.add(prefixLoc);
1704 // Set<GlobalFlowNode> incomingNodeSet = globalFlowGraph.getIncomingNodeSet(node);
1705 List<NTuple<Location>> prefixList = calculatePrefixList(globalFlowGraph, node);
1707 Set<GlobalFlowNode> reachableNodeSet =
1708 globalFlowGraph.getReachableNodeSetByPrefix(node.getLocTuple().get(0));
1709 // Set<GlobalFlowNode> reachNodeSet = globalFlowGraph.getReachableNodeSetFrom(node);
1711 // System.out.println("node=" + node + " prefixList=" + prefixList);
1712 // System.out.println("---prefixList=" + prefixList);
1714 nextprefix: for (int i = 0; i < prefixList.size(); i++) {
1715 NTuple<Location> curPrefix = prefixList.get(i);
1716 // System.out.println("---curPrefix=" + curPrefix);
1717 Set<NTuple<Location>> reachableCommonPrefixSet = new HashSet<NTuple<Location>>();
1719 for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
1720 GlobalFlowNode reachNode = (GlobalFlowNode) iterator2.next();
1721 if (reachNode.getLocTuple().startsWith(curPrefix)) {
1722 reachableCommonPrefixSet.add(reachNode.getLocTuple());
1725 // System.out.println("reachableCommonPrefixSet=" + reachableCommonPrefixSet);
1727 if (!reachableCommonPrefixSet.isEmpty()) {
1729 MethodDescriptor curPrefixFirstElementMethodDesc =
1730 (MethodDescriptor) curPrefix.get(0).getDescriptor();
1732 MethodDescriptor nodePrefixLocFirstElementMethodDesc =
1733 (MethodDescriptor) prefixLoc.getDescriptor();
1735 // System.out.println("curPrefixFirstElementMethodDesc=" +
1736 // curPrefixFirstElementMethodDesc);
1737 // System.out.println("nodePrefixLocFirstElementMethodDesc="
1738 // + nodePrefixLocFirstElementMethodDesc);
1740 if (curPrefixFirstElementMethodDesc.equals(nodePrefixLocFirstElementMethodDesc)
1741 || isTransitivelyCalledFrom(nodePrefixLocFirstElementMethodDesc,
1742 curPrefixFirstElementMethodDesc)) {
1745 // if (!node.getLocTuple().startsWith(curPrefix.get(0))) {
1747 Location curPrefixLocalLoc = curPrefix.get(0);
1748 if (globalFlowGraph.mapLocationToInferCompositeLocation.containsKey(curPrefixLocalLoc)) {
1749 // in this case, the local variable of the current prefix has already got a composite
1751 // so we just ignore the current composite location.
1753 // System.out.println("HERE WE DO NOT ASSIGN A COMPOSITE LOCATION TO =" + node
1754 // + " DUE TO " + curPrefix);
1759 if (!needToGenerateCompositeLocation(node, curPrefix)) {
1760 // System.out.println("NO NEED TO GENERATE COMP LOC to " + node + " with prefix="
1762 // System.out.println("prefixList=" + prefixList);
1763 // System.out.println("reachableNodeSet=" + reachableNodeSet);
1764 continue nextprefix;
1767 Location targetLocalLoc = node.getLocTuple().get(0);
1768 CompositeLocation newCompLoc = generateCompositeLocation(curPrefix);
1769 // System.out.println("NEED TO ASSIGN COMP LOC TO " + node + " with prefix=" +
1771 // System.out.println("-targetLocalLoc=" + targetLocalLoc + " - newCompLoc="
1773 globalFlowGraph.addMapLocationToInferCompositeLocation(targetLocalLoc, newCompLoc);
1788 private boolean checkFlowNodeReturnThisField(MethodDescriptor md) {
1790 MethodDescriptor methodDescEventLoop = ssjava.getMethodContainingSSJavaLoop();
1791 GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(methodDescEventLoop);
1793 FlowGraph flowGraph = getFlowGraph(md);
1795 ClassDescriptor enclosingDesc = getClassTypeDescriptor(md.getThis());
1796 if (enclosingDesc == null) {
1801 Set<FlowNode> returnNodeSet = flowGraph.getReturnNodeSet();
1802 Set<GlobalFlowNode> globalReturnNodeSet = new HashSet<GlobalFlowNode>();
1803 for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
1804 FlowNode flowNode = (FlowNode) iterator.next();
1805 NTuple<Location> locTuple = translateToLocTuple(md, flowNode.getDescTuple());
1806 GlobalFlowNode globalReturnNode = globalFlowGraph.getFlowNode(locTuple);
1807 globalReturnNodeSet.add(globalReturnNode);
1809 List<NTuple<Location>> prefixList = calculatePrefixList(globalFlowGraph, globalReturnNode);
1810 for (int i = 0; i < prefixList.size(); i++) {
1811 NTuple<Location> curPrefix = prefixList.get(i);
1812 ClassDescriptor cd =
1813 getClassTypeDescriptor(curPrefix.get(curPrefix.size() - 1).getLocDescriptor());
1814 if (cd != null && cd.equals(enclosingDesc)) {
1822 if (count == returnNodeSet.size()) {
1823 // in this case, all return nodes in the method returns values coming from a location that
1824 // starts with "this"
1826 // System.out.println("$$$SET RETURN LOC TRUE=" + md);
1827 mapMethodDescriptorToCompositeReturnCase.put(md, Boolean.TRUE);
1829 // NameDescriptor returnLocDesc = new NameDescriptor("RLOC" + (locSeed++));
1830 // NTuple<Descriptor> rDescTuple = new NTuple<Descriptor>();
1831 // rDescTuple.add(md.getThis());
1832 // rDescTuple.add(returnLocDesc);
1834 // for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
1835 // FlowNode rnode = (FlowNode) iterator.next();
1836 // flowGraph.addValueFlowEdge(rnode.getDescTuple(), rDescTuple);
1839 // getMethodSummary(md).setRETURNLoc(new CompositeLocation(translateToLocTuple(md,
1843 mapMethodDescriptorToCompositeReturnCase.put(md, Boolean.FALSE);
1846 return mapMethodDescriptorToCompositeReturnCase.get(md).booleanValue();
1850 private boolean needToGenerateCompositeLocation(GlobalFlowNode node, NTuple<Location> curPrefix) {
1851 // return true if there is a path between a node to which we want to give a composite location
1852 // and nodes which start with curPrefix
1854 // System.out.println("---needToGenerateCompositeLocation curPrefix=" + curPrefix);
1856 Location targetLocalLoc = node.getLocTuple().get(0);
1858 MethodDescriptor md = (MethodDescriptor) targetLocalLoc.getDescriptor();
1859 FlowGraph flowGraph = getFlowGraph(md);
1861 FlowNode flowNode = flowGraph.getFlowNode(node.getDescTuple());
1862 Set<FlowNode> reachableSet = flowGraph.getReachFlowNodeSetFrom(flowNode);
1864 Set<FlowNode> paramNodeSet = flowGraph.getParamFlowNodeSet();
1865 for (Iterator iterator = paramNodeSet.iterator(); iterator.hasNext();) {
1866 FlowNode paramFlowNode = (FlowNode) iterator.next();
1867 if (curPrefix.startsWith(translateToLocTuple(md, paramFlowNode.getDescTuple()))) {
1872 if (targetLocalLoc.getLocDescriptor() instanceof InterDescriptor) {
1873 Pair<MethodInvokeNode, Integer> pair =
1874 ((InterDescriptor) targetLocalLoc.getLocDescriptor()).getMethodArgIdxPair();
1877 // System.out.println("$$$TARGETLOCALLOC HOLDER=" + targetLocalLoc);
1879 MethodInvokeNode min = pair.getFirst();
1880 Integer paramIdx = pair.getSecond();
1881 MethodDescriptor mdCallee = min.getMethod();
1883 FlowNode paramNode = getFlowGraph(mdCallee).getParamFlowNode(paramIdx);
1884 if (checkNodeReachToReturnNode(mdCallee, paramNode)) {
1892 GlobalFlowGraph subGlobalFlowGraph = getSubGlobalFlowGraph(md);
1893 Set<GlobalFlowNode> subGlobalReachableSet = subGlobalFlowGraph.getReachableNodeSetFrom(node);
1895 if (!md.isStatic()) {
1896 ClassDescriptor currentMethodThisType = getClassTypeDescriptor(md.getThis());
1897 for (int i = 0; i < curPrefix.size(); i++) {
1898 ClassDescriptor prefixType = getClassTypeDescriptor(curPrefix.get(i).getLocDescriptor());
1899 if (prefixType != null && prefixType.equals(currentMethodThisType)) {
1900 // System.out.println("PREFIX TYPE MATCHES WITH=" + currentMethodThisType);
1902 if (mapMethodDescriptorToCompositeReturnCase.containsKey(md)) {
1903 boolean hasCompReturnLocWithThis =
1904 mapMethodDescriptorToCompositeReturnCase.get(md).booleanValue();
1905 if (hasCompReturnLocWithThis) {
1906 if (checkNodeReachToReturnNode(md, flowNode)) {
1912 for (Iterator iterator3 = subGlobalReachableSet.iterator(); iterator3.hasNext();) {
1913 GlobalFlowNode subGlobalReachalbeNode = (GlobalFlowNode) iterator3.next();
1914 if (subGlobalReachalbeNode.getLocTuple().get(0).getLocDescriptor().equals(md.getThis())) {
1915 // System.out.println("PREFIX FOUND=" + subGlobalReachalbeNode);
1923 Location lastLocationOfPrefix = curPrefix.get(curPrefix.size() - 1);
1924 // check whether prefix appears in the list of parameters
1925 Set<MethodInvokeNode> minSet = mapMethodDescToMethodInvokeNodeSet.get(md);
1926 // System.out.println("$$$md=" + md + " minSet=" + minSet);
1927 if (minSet == null) {
1930 found: for (Iterator iterator = minSet.iterator(); iterator.hasNext();) {
1931 MethodInvokeNode min = (MethodInvokeNode) iterator.next();
1932 Map<Integer, NTuple<Descriptor>> map = mapMethodInvokeNodeToArgIdxMap.get(min);
1933 Set<Integer> keySet = map.keySet();
1934 // System.out.println("min=" + min.printNode(0));
1936 for (Iterator iterator2 = keySet.iterator(); iterator2.hasNext();) {
1937 Integer argIdx = (Integer) iterator2.next();
1938 NTuple<Descriptor> argTuple = map.get(argIdx);
1940 if (!(!md.isStatic() && argIdx == 0)) {
1941 // if the argTuple is empty, we don't need to do with anything(LITERAL CASE).
1942 if (argTuple.size() > 0
1943 && argTuple.get(argTuple.size() - 1).equals(lastLocationOfPrefix.getLocDescriptor())) {
1944 NTuple<Location> locTuple =
1945 translateToLocTuple(md, flowGraph.getParamFlowNode(argIdx).getDescTuple());
1946 lastLocationOfPrefix = locTuple.get(0);
1947 // System.out.println("ARG CASE=" + locTuple);
1948 for (Iterator iterator3 = subGlobalReachableSet.iterator(); iterator3.hasNext();) {
1949 GlobalFlowNode subGlobalReachalbeNode = (GlobalFlowNode) iterator3.next();
1950 // NTuple<Location> locTuple = translateToLocTuple(md, reachalbeNode.getDescTuple());
1951 NTuple<Location> globalReachlocTuple = subGlobalReachalbeNode.getLocTuple();
1952 for (int i = 0; i < globalReachlocTuple.size(); i++) {
1953 if (globalReachlocTuple.get(i).equals(lastLocationOfPrefix)) {
1954 // System.out.println("ARG " + argTuple + " IS MATCHED WITH="
1955 // + lastLocationOfPrefix);
1968 private boolean checkNodeReachToReturnNode(MethodDescriptor md, FlowNode node) {
1970 FlowGraph flowGraph = getFlowGraph(md);
1971 Set<FlowNode> reachableSet = flowGraph.getReachFlowNodeSetFrom(node);
1972 if (mapMethodDescriptorToCompositeReturnCase.containsKey(md)) {
1973 boolean hasCompReturnLocWithThis =
1974 mapMethodDescriptorToCompositeReturnCase.get(md).booleanValue();
1976 if (hasCompReturnLocWithThis) {
1977 for (Iterator iterator = flowGraph.getReturnNodeSet().iterator(); iterator.hasNext();) {
1978 FlowNode returnFlowNode = (FlowNode) iterator.next();
1979 if (reachableSet.contains(returnFlowNode)) {
1988 private void assignCompositeLocation(CompositeLocation compLocPrefix, GlobalFlowNode node) {
1989 CompositeLocation newCompLoc = compLocPrefix.clone();
1990 NTuple<Location> locTuple = node.getLocTuple();
1991 for (int i = 1; i < locTuple.size(); i++) {
1992 newCompLoc.addLocation(locTuple.get(i));
1994 node.setInferCompositeLocation(newCompLoc);
1997 private List<NTuple<Location>> calculatePrefixList(GlobalFlowGraph graph, GlobalFlowNode node) {
1999 // System.out.println("\n##### calculatePrefixList node=" + node);
2001 Set<GlobalFlowNode> incomingNodeSetPrefix =
2002 graph.getIncomingNodeSetByPrefix(node.getLocTuple().get(0));
2003 // System.out.println("---incomingNodeSetPrefix=" + incomingNodeSetPrefix);
2005 Set<GlobalFlowNode> reachableNodeSetPrefix =
2006 graph.getReachableNodeSetByPrefix(node.getLocTuple().get(0));
2007 // System.out.println("---reachableNodeSetPrefix=" + reachableNodeSetPrefix);
2009 List<NTuple<Location>> prefixList = new ArrayList<NTuple<Location>>();
2011 for (Iterator iterator = incomingNodeSetPrefix.iterator(); iterator.hasNext();) {
2012 GlobalFlowNode inNode = (GlobalFlowNode) iterator.next();
2013 NTuple<Location> inNodeTuple = inNode.getLocTuple();
2015 if (inNodeTuple.get(0).getLocDescriptor() instanceof InterDescriptor
2016 || inNodeTuple.get(0).getLocDescriptor().equals(GLOBALDESC)) {
2020 for (int i = 1; i < inNodeTuple.size(); i++) {
2021 NTuple<Location> prefix = inNodeTuple.subList(0, i);
2022 if (!prefixList.contains(prefix)) {
2023 prefixList.add(prefix);
2028 Collections.sort(prefixList, new Comparator<NTuple<Location>>() {
2029 public int compare(NTuple<Location> arg0, NTuple<Location> arg1) {
2030 int s0 = arg0.size();
2031 int s1 = arg1.size();
2034 } else if (s0 == s1) {
2046 private CompositeLocation calculateCompositeLocationFromFlowGraph(MethodDescriptor md,
2049 // System.out.println("#############################################################");
2050 // System.out.println("calculateCompositeLocationFromFlowGraph=" + node);
2052 FlowGraph flowGraph = getFlowGraph(md);
2053 // NTuple<Location> paramLocTuple = translateToLocTuple(md, paramNode.getDescTuple());
2054 // GlobalFlowNode paramGlobalNode = subGlobalFlowGraph.getFlowNode(paramLocTuple);
2056 List<NTuple<Location>> prefixList = calculatePrefixListFlowGraph(flowGraph, node);
2058 // Set<GlobalFlowNode> reachableNodeSet =
2059 // subGlobalFlowGraph.getReachableNodeSetByPrefix(paramGlobalNode.getLocTuple().get(0));
2061 Set<FlowNode> reachableNodeSet =
2062 flowGraph.getReachableSetFrom(node.getDescTuple().subList(0, 1));
2064 // Set<GlobalFlowNode> reachNodeSet = globalFlowGraph.getReachableNodeSetFrom(node);
2066 // System.out.println("node=" + node + " prefixList=" + prefixList);
2068 for (int i = 0; i < prefixList.size(); i++) {
2069 NTuple<Location> curPrefix = prefixList.get(i);
2070 Set<NTuple<Location>> reachableCommonPrefixSet = new HashSet<NTuple<Location>>();
2072 for (Iterator iterator2 = reachableNodeSet.iterator(); iterator2.hasNext();) {
2073 FlowNode reachNode = (FlowNode) iterator2.next();
2074 NTuple<Location> reachLocTuple = translateToLocTuple(md, reachNode.getCurrentDescTuple());
2075 if (reachLocTuple.startsWith(curPrefix)) {
2076 reachableCommonPrefixSet.add(reachLocTuple);
2079 // System.out.println("reachableCommonPrefixSet=" + reachableCommonPrefixSet);
2081 if (!reachableCommonPrefixSet.isEmpty()) {
2083 MethodDescriptor curPrefixFirstElementMethodDesc =
2084 (MethodDescriptor) curPrefix.get(0).getDescriptor();
2086 Location curPrefixLocalLoc = curPrefix.get(0);
2088 Location targetLocalLoc = new Location(md, node.getDescTuple().get(0));
2089 // Location targetLocalLoc = paramGlobalNode.getLocTuple().get(0);
2091 CompositeLocation newCompLoc = generateCompositeLocation(curPrefix);
2092 // System.out.println("NEED2ASSIGN COMP LOC TO " + node + " with prefix=" + curPrefix);
2093 // System.out.println("-targetLocalLoc=" + targetLocalLoc + " - newCompLoc=" +
2096 node.setCompositeLocation(newCompLoc);
2106 private List<NTuple<Location>> calculatePrefixListFlowGraph(FlowGraph graph, FlowNode node) {
2108 // System.out.println("\n##### calculatePrefixList node=" + node);
2110 MethodDescriptor md = graph.getMethodDescriptor();
2111 Set<FlowNode> incomingNodeSetPrefix =
2112 graph.getIncomingNodeSetByPrefix(node.getDescTuple().get(0));
2113 // System.out.println("---incomingNodeSetPrefix=" + incomingNodeSetPrefix);
2115 Set<FlowNode> reachableNodeSetPrefix =
2116 graph.getReachableSetFrom(node.getDescTuple().subList(0, 1));
2117 // System.out.println("---reachableNodeSetPrefix=" + reachableNodeSetPrefix);
2119 List<NTuple<Location>> prefixList = new ArrayList<NTuple<Location>>();
2121 for (Iterator iterator = incomingNodeSetPrefix.iterator(); iterator.hasNext();) {
2122 FlowNode inNode = (FlowNode) iterator.next();
2123 NTuple<Location> inNodeTuple = translateToLocTuple(md, inNode.getCurrentDescTuple());
2125 // if (inNodeTuple.get(0).getLocDescriptor() instanceof InterDescriptor
2126 // || inNodeTuple.get(0).getLocDescriptor().equals(GLOBALDESC)) {
2130 for (int i = 1; i < inNodeTuple.size(); i++) {
2131 NTuple<Location> prefix = inNodeTuple.subList(0, i);
2132 if (!prefixList.contains(prefix)) {
2133 prefixList.add(prefix);
2138 Collections.sort(prefixList, new Comparator<NTuple<Location>>() {
2139 public int compare(NTuple<Location> arg0, NTuple<Location> arg1) {
2140 int s0 = arg0.size();
2141 int s1 = arg1.size();
2144 } else if (s0 == s1) {
2156 private GlobalFlowGraph constructSubGlobalFlowGraph(FlowGraph flowGraph) {
2158 MethodDescriptor md = flowGraph.getMethodDescriptor();
2160 GlobalFlowGraph globalGraph = getSubGlobalFlowGraph(md);
2162 // Set<FlowNode> nodeSet = flowGraph.getNodeSet();
2163 Set<FlowEdge> edgeSet = flowGraph.getEdgeSet();
2165 for (Iterator iterator = edgeSet.iterator(); iterator.hasNext();) {
2167 FlowEdge edge = (FlowEdge) iterator.next();
2168 NTuple<Descriptor> srcDescTuple = edge.getInitTuple();
2169 NTuple<Descriptor> dstDescTuple = edge.getEndTuple();
2171 if (flowGraph.getFlowNode(srcDescTuple) instanceof FlowReturnNode
2172 || flowGraph.getFlowNode(dstDescTuple) instanceof FlowReturnNode) {
2176 // here only keep the first element(method location) of the descriptor
2178 NTuple<Location> srcLocTuple = translateToLocTuple(md, srcDescTuple);
2179 NTuple<Location> dstLocTuple = translateToLocTuple(md, dstDescTuple);
2181 globalGraph.addValueFlowEdge(srcLocTuple, dstLocTuple);
2188 private NTuple<Location> translateToLocTuple(MethodDescriptor md, NTuple<Descriptor> descTuple) {
2190 NTuple<Location> locTuple = new NTuple<Location>();
2192 Descriptor enclosingDesc = md;
2193 for (int i = 0; i < descTuple.size(); i++) {
2194 Descriptor desc = descTuple.get(i);
2196 Location loc = new Location(enclosingDesc, desc);
2199 if (desc instanceof VarDescriptor) {
2200 enclosingDesc = ((VarDescriptor) desc).getType().getClassDesc();
2201 } else if (desc instanceof FieldDescriptor) {
2202 enclosingDesc = ((FieldDescriptor) desc).getType().getClassDesc();
2204 enclosingDesc = desc;
2213 private void addValueFlowsFromCalleeSubGlobalFlowGraph(MethodDescriptor mdCaller) {
2215 // the transformation for a call site propagates flows through parameters
2216 // if the method is virtual, it also grab all relations from any possible
2219 Set<MethodInvokeNode> setMethodInvokeNode = getMethodInvokeNodeSet(mdCaller);
2221 for (Iterator iterator = setMethodInvokeNode.iterator(); iterator.hasNext();) {
2222 MethodInvokeNode min = (MethodInvokeNode) iterator.next();
2223 MethodDescriptor mdCallee = min.getMethod();
2224 Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
2225 if (mdCallee.isStatic()) {
2226 setPossibleCallees.add(mdCallee);
2228 Set<MethodDescriptor> calleeSet = ssjava.getCallGraph().getMethods(mdCallee);
2229 // removes method descriptors that are not invoked by the caller
2230 calleeSet.retainAll(mapMethodToCalleeSet.get(mdCaller));
2231 setPossibleCallees.addAll(calleeSet);
2234 for (Iterator iterator2 = setPossibleCallees.iterator(); iterator2.hasNext();) {
2235 MethodDescriptor possibleMdCallee = (MethodDescriptor) iterator2.next();
2236 propagateValueFlowsToCallerFromSubGlobalFlowGraph(min, mdCaller, possibleMdCallee);
2243 private void propagateValueFlowsToCallerFromSubGlobalFlowGraph(MethodInvokeNode min,
2244 MethodDescriptor mdCaller, MethodDescriptor possibleMdCallee) {
2246 // System.out.println("---propagate from " + min.printNode(0) + " to caller=" + mdCaller);
2247 FlowGraph calleeFlowGraph = getFlowGraph(possibleMdCallee);
2248 Map<Integer, NTuple<Descriptor>> mapIdxToArg = mapMethodInvokeNodeToArgIdxMap.get(min);
2250 // System.out.println("-----mapMethodInvokeNodeToArgIdxMap.get(min)="
2251 // + mapMethodInvokeNodeToArgIdxMap.get(min));
2253 Set<Integer> keySet = mapIdxToArg.keySet();
2254 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
2255 Integer idx = (Integer) iterator.next();
2256 NTuple<Descriptor> argDescTuple = mapIdxToArg.get(idx);
2257 if (argDescTuple.size() > 0) {
2258 NTuple<Location> argLocTuple = translateToLocTuple(mdCaller, argDescTuple);
2259 NTuple<Descriptor> paramDescTuple = calleeFlowGraph.getParamFlowNode(idx).getDescTuple();
2260 NTuple<Location> paramLocTuple = translateToLocTuple(possibleMdCallee, paramDescTuple);
2261 // System.out.println("-------paramDescTuple=" + paramDescTuple + "->argDescTuple="
2263 addMapCallerArgToCalleeParam(min, argDescTuple, paramDescTuple);
2267 // addValueFlowBetweenParametersToCaller(min, mdCaller, possibleMdCallee);
2269 NTuple<Descriptor> baseTuple = mapMethodInvokeNodeToBaseTuple.get(min);
2270 GlobalFlowGraph calleeSubGlobalGraph = getSubGlobalFlowGraph(possibleMdCallee);
2271 Set<GlobalFlowNode> calleeNodeSet = calleeSubGlobalGraph.getNodeSet();
2272 for (Iterator iterator = calleeNodeSet.iterator(); iterator.hasNext();) {
2273 GlobalFlowNode calleeNode = (GlobalFlowNode) iterator.next();
2274 addValueFlowFromCalleeNode(min, mdCaller, possibleMdCallee, calleeNode);
2277 // System.out.println("$$$GLOBAL PC LOC ADD=" + mdCaller);
2278 Set<NTuple<Location>> pcLocTupleSet = mapMethodInvokeNodeToPCLocTupleSet.get(min);
2279 // System.out.println("---pcLocTupleSet=" + pcLocTupleSet);
2280 GlobalFlowGraph callerSubGlobalGraph = getSubGlobalFlowGraph(mdCaller);
2281 for (Iterator iterator = calleeNodeSet.iterator(); iterator.hasNext();) {
2282 GlobalFlowNode calleeNode = (GlobalFlowNode) iterator.next();
2283 if (calleeNode.isParamNodeWithIncomingFlows()) {
2284 // System.out.println("calleeNode.getLocTuple()" + calleeNode.getLocTuple());
2285 NTuple<Location> callerSrcNodeLocTuple =
2286 translateToCallerLocTuple(min, possibleMdCallee, mdCaller, calleeNode.getLocTuple());
2287 // System.out.println("---callerSrcNodeLocTuple=" + callerSrcNodeLocTuple);
2288 if (callerSrcNodeLocTuple != null && callerSrcNodeLocTuple.size() > 0) {
2289 for (Iterator iterator2 = pcLocTupleSet.iterator(); iterator2.hasNext();) {
2290 NTuple<Location> pcLocTuple = (NTuple<Location>) iterator2.next();
2292 callerSubGlobalGraph.addValueFlowEdge(pcLocTuple, callerSrcNodeLocTuple);
2301 private void addValueFlowFromCalleeNode(MethodInvokeNode min, MethodDescriptor mdCaller,
2302 MethodDescriptor mdCallee, GlobalFlowNode calleeSrcNode) {
2304 GlobalFlowGraph calleeSubGlobalGraph = getSubGlobalFlowGraph(mdCallee);
2305 GlobalFlowGraph callerSubGlobalGraph = getSubGlobalFlowGraph(mdCaller);
2307 // System.out.println("$addValueFlowFromCalleeNode calleeSrcNode=" + calleeSrcNode);
2309 NTuple<Location> callerSrcNodeLocTuple =
2310 translateToCallerLocTuple(min, mdCallee, mdCaller, calleeSrcNode.getLocTuple());
2311 // System.out.println("---callerSrcNodeLocTuple=" + callerSrcNodeLocTuple);
2313 if (callerSrcNodeLocTuple != null && callerSrcNodeLocTuple.size() > 0) {
2315 Set<GlobalFlowNode> outNodeSet = calleeSubGlobalGraph.getOutNodeSet(calleeSrcNode);
2317 for (Iterator iterator = outNodeSet.iterator(); iterator.hasNext();) {
2318 GlobalFlowNode outNode = (GlobalFlowNode) iterator.next();
2319 NTuple<Location> callerDstNodeLocTuple =
2320 translateToCallerLocTuple(min, mdCallee, mdCaller, outNode.getLocTuple());
2321 // System.out.println("outNode=" + outNode + " callerDstNodeLocTuple="
2322 // + callerDstNodeLocTuple);
2323 if (callerSrcNodeLocTuple != null && callerDstNodeLocTuple != null
2324 && callerSrcNodeLocTuple.size() > 0 && callerDstNodeLocTuple.size() > 0) {
2325 callerSubGlobalGraph.addValueFlowEdge(callerSrcNodeLocTuple, callerDstNodeLocTuple);
2332 private NTuple<Location> translateToCallerLocTuple(MethodInvokeNode min,
2333 MethodDescriptor mdCallee, MethodDescriptor mdCaller, NTuple<Location> nodeLocTuple) {
2334 // this method will return the same nodeLocTuple if the corresponding argument is literal
2337 // System.out.println("translateToCallerLocTuple=" + nodeLocTuple);
2339 FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
2340 NTuple<Descriptor> nodeDescTuple = translateToDescTuple(nodeLocTuple);
2341 if (calleeFlowGraph.isParameter(nodeDescTuple)) {
2342 int paramIdx = calleeFlowGraph.getParamIdx(nodeDescTuple);
2343 NTuple<Descriptor> argDescTuple = mapMethodInvokeNodeToArgIdxMap.get(min).get(paramIdx);
2345 // if (isPrimitive(nodeLocTuple.get(0).getLocDescriptor())) {
2346 // // the type of argument is primitive.
2347 // return nodeLocTuple.clone();
2349 // System.out.println("paramIdx=" + paramIdx + " argDescTuple=" + argDescTuple + " from min="
2350 // + min.printNode(0));
2351 NTuple<Location> argLocTuple = translateToLocTuple(mdCaller, argDescTuple);
2353 NTuple<Location> callerLocTuple = new NTuple<Location>();
2355 callerLocTuple.addAll(argLocTuple);
2356 for (int i = 1; i < nodeLocTuple.size(); i++) {
2357 callerLocTuple.add(nodeLocTuple.get(i));
2359 return callerLocTuple;
2361 return nodeLocTuple.clone();
2366 public static boolean isPrimitive(Descriptor desc) {
2368 if (desc instanceof FieldDescriptor) {
2369 return ((FieldDescriptor) desc).getType().isPrimitive();
2370 } else if (desc instanceof VarDescriptor) {
2371 return ((VarDescriptor) desc).getType().isPrimitive();
2372 } else if (desc instanceof InterDescriptor) {
2379 public static boolean isReference(Descriptor desc) {
2381 if (desc instanceof FieldDescriptor) {
2383 TypeDescriptor type = ((FieldDescriptor) desc).getType();
2384 if (type.isArray()) {
2385 return !type.isPrimitive();
2387 return type.isPtr();
2390 } else if (desc instanceof VarDescriptor) {
2391 TypeDescriptor type = ((VarDescriptor) desc).getType();
2392 if (type.isArray()) {
2393 return !type.isPrimitive();
2395 return type.isPtr();
2402 private NTuple<Descriptor> translateToDescTuple(NTuple<Location> locTuple) {
2404 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
2405 for (int i = 0; i < locTuple.size(); i++) {
2406 descTuple.add(locTuple.get(i).getLocDescriptor());
2412 public LocationSummary getLocationSummary(Descriptor d) {
2413 if (!mapDescToLocationSummary.containsKey(d)) {
2414 if (d instanceof MethodDescriptor) {
2415 mapDescToLocationSummary.put(d, new MethodSummary((MethodDescriptor) d));
2416 } else if (d instanceof ClassDescriptor) {
2417 mapDescToLocationSummary.put(d, new FieldSummary());
2420 return mapDescToLocationSummary.get(d);
2423 private void generateMethodSummary() {
2425 Set<MethodDescriptor> keySet = md2lattice.keySet();
2426 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
2427 MethodDescriptor md = (MethodDescriptor) iterator.next();
2429 System.out.println("\nSSJAVA: generate method summary: " + md);
2431 FlowGraph flowGraph = getFlowGraph(md);
2432 if (flowGraph == null) {
2435 MethodSummary methodSummary = getMethodSummary(md);
2437 HierarchyGraph scGraph = getSkeletonCombinationHierarchyGraph(md);
2439 // set the 'this' reference location
2440 if (!md.isStatic()) {
2441 // System.out.println("setThisLocName=" + scGraph.getHNode(md.getThis()).getName());
2442 methodSummary.setThisLocName(scGraph.getHNode(md.getThis()).getName());
2445 // set the 'global' reference location if needed
2446 if (methodSummary.hasGlobalAccess()) {
2447 methodSummary.setGlobalLocName(scGraph.getHNode(GLOBALDESC).getName());
2450 // construct a parameter mapping that maps a parameter descriptor to an
2451 // inferred composite location
2452 for (int paramIdx = 0; paramIdx < flowGraph.getNumParameters(); paramIdx++) {
2453 FlowNode flowNode = flowGraph.getParamFlowNode(paramIdx);
2454 CompositeLocation inferredCompLoc =
2455 updateCompositeLocation(flowNode.getCompositeLocation());
2456 // System.out.println("-paramIdx=" + paramIdx + " infer=" + inferredCompLoc + " original="
2457 // + flowNode.getCompositeLocation());
2459 Descriptor localVarDesc = flowNode.getDescTuple().get(0);
2460 methodSummary.addMapVarNameToInferCompLoc(localVarDesc, inferredCompLoc);
2461 methodSummary.addMapParamIdxToInferLoc(paramIdx, inferredCompLoc);
2468 private boolean hasOrderingRelation(NTuple<Location> locTuple1, NTuple<Location> locTuple2) {
2470 int size = locTuple1.size() >= locTuple2.size() ? locTuple2.size() : locTuple1.size();
2472 for (int idx = 0; idx < size; idx++) {
2473 Location loc1 = locTuple1.get(idx);
2474 Location loc2 = locTuple2.get(idx);
2476 Descriptor desc1 = loc1.getDescriptor();
2477 Descriptor desc2 = loc2.getDescriptor();
2479 if (!desc1.equals(desc2)) {
2480 throw new Error("Fail to compare " + locTuple1 + " and " + locTuple2);
2483 Descriptor locDesc1 = loc1.getLocDescriptor();
2484 Descriptor locDesc2 = loc2.getLocDescriptor();
2486 HierarchyGraph hierarchyGraph = getHierarchyGraph(desc1);
2488 HNode node1 = hierarchyGraph.getHNode(locDesc1);
2489 HNode node2 = hierarchyGraph.getHNode(locDesc2);
2491 // System.out.println("---node1=" + node1 + " node2=" + node2);
2492 // System.out.println("---hierarchyGraph.getIncomingNodeSet(node2)="
2493 // + hierarchyGraph.getIncomingNodeSet(node2));
2495 if (locDesc1.equals(locDesc2)) {
2497 } else if (!hierarchyGraph.getIncomingNodeSet(node2).contains(node1)
2498 && !hierarchyGraph.getIncomingNodeSet(node1).contains(node2)) {
2510 private boolean isHigherThan(NTuple<Location> locTuple1, NTuple<Location> locTuple2) {
2512 int size = locTuple1.size() >= locTuple2.size() ? locTuple2.size() : locTuple1.size();
2514 for (int idx = 0; idx < size; idx++) {
2515 Location loc1 = locTuple1.get(idx);
2516 Location loc2 = locTuple2.get(idx);
2518 Descriptor desc1 = loc1.getDescriptor();
2519 Descriptor desc2 = loc2.getDescriptor();
2521 if (!desc1.equals(desc2)) {
2522 throw new Error("Fail to compare " + locTuple1 + " and " + locTuple2);
2525 Descriptor locDesc1 = loc1.getLocDescriptor();
2526 Descriptor locDesc2 = loc2.getLocDescriptor();
2528 HierarchyGraph hierarchyGraph = getHierarchyGraph(desc1);
2530 HNode node1 = hierarchyGraph.getHNode(locDesc1);
2531 HNode node2 = hierarchyGraph.getHNode(locDesc2);
2533 // System.out.println("---node1=" + node1 + " node2=" + node2);
2534 // System.out.println("---hierarchyGraph.getIncomingNodeSet(node2)="
2535 // + hierarchyGraph.getIncomingNodeSet(node2));
2537 if (locDesc1.equals(locDesc2)) {
2539 } else if (hierarchyGraph.getIncomingNodeSet(node2).contains(node1)) {
2550 private void debug_writeLattices() {
2552 Set<Descriptor> keySet = mapDescriptorToSimpleLattice.keySet();
2553 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
2554 Descriptor key = (Descriptor) iterator.next();
2555 SSJavaLattice<String> simpleLattice = mapDescriptorToSimpleLattice.get(key);
2556 // HierarchyGraph simpleHierarchyGraph = getSimpleHierarchyGraph(key);
2557 HierarchyGraph scHierarchyGraph = getSkeletonCombinationHierarchyGraph(key);
2558 if (key instanceof ClassDescriptor) {
2559 writeInferredLatticeDotFile((ClassDescriptor) key, simpleLattice, "_SIMPLE");
2560 } else if (key instanceof MethodDescriptor) {
2561 MethodDescriptor md = (MethodDescriptor) key;
2562 writeInferredLatticeDotFile(md.getClassDesc(), md, simpleLattice, "_SIMPLE");
2565 LocationSummary ls = getLocationSummary(key);
2566 // System.out.println("####LOC SUMMARY=" + key + "\n" + ls.getMapHNodeNameToLocationName());
2569 Set<ClassDescriptor> cdKeySet = cd2lattice.keySet();
2570 for (Iterator iterator = cdKeySet.iterator(); iterator.hasNext();) {
2571 ClassDescriptor cd = (ClassDescriptor) iterator.next();
2572 // System.out.println("########cd=" + cd);
2573 writeInferredLatticeDotFile((ClassDescriptor) cd, cd2lattice.get(cd), "");
2574 COUNT += cd2lattice.get(cd).getKeySet().size();
2577 Set<MethodDescriptor> mdKeySet = md2lattice.keySet();
2578 for (Iterator iterator = mdKeySet.iterator(); iterator.hasNext();) {
2579 MethodDescriptor md = (MethodDescriptor) iterator.next();
2580 writeInferredLatticeDotFile(md.getClassDesc(), md, md2lattice.get(md), "");
2581 COUNT += md2lattice.get(md).getKeySet().size();
2583 System.out.println("###COUNT=" + COUNT);
2585 Set<Descriptor> descKeySet = desc2naiveLattice.keySet();
2586 for (Iterator iterator = descKeySet.iterator(); iterator.hasNext();) {
2587 Descriptor desc = (Descriptor) iterator.next();
2588 // System.out.println("########cd=" + cd);
2590 ClassDescriptor cd_naive;
2591 MethodDescriptor md_naive;
2592 if (desc instanceof ClassDescriptor) {
2593 cd_naive = (ClassDescriptor) desc;
2596 md_naive = (MethodDescriptor) desc;
2597 cd_naive = md_naive.getClassDesc();
2600 writeInferredLatticeDotFile(cd_naive, md_naive, desc2naiveLattice.get(desc), "_naive");
2604 private void buildLattice(Descriptor desc) {
2605 // System.out.println("buildLattice=" + desc);
2606 SSJavaLattice<String> simpleLattice = buildLattice.buildLattice(desc);
2608 addMapDescToSimpleLattice(desc, simpleLattice);
2610 if (desc instanceof ClassDescriptor) {
2611 writeInferredLatticeDotFile((ClassDescriptor) desc, null, simpleLattice, "_SC");
2613 MethodDescriptor md = (MethodDescriptor) desc;
2614 writeInferredLatticeDotFile(md.getClassDesc(), md, simpleLattice, "_SC");
2617 HierarchyGraph simpleHierarchyGraph = getSimpleHierarchyGraph(desc);
2619 // System.out.println("\n## insertIntermediateNodesToStraightLine:"
2620 // + simpleHierarchyGraph.getName());
2621 SSJavaLattice<String> lattice =
2622 buildLattice.insertIntermediateNodesToStraightLine(desc, simpleLattice);
2624 if (lattice == null) {
2627 lattice.removeRedundantEdges();
2629 LocationInference.numLocationsSInfer += lattice.getKeySet().size();
2631 if (desc instanceof ClassDescriptor) {
2633 cd2lattice.put((ClassDescriptor) desc, lattice);
2634 // ssjava.writeLatticeDotFile((ClassDescriptor) desc, null, lattice);
2635 } else if (desc instanceof MethodDescriptor) {
2637 md2lattice.put((MethodDescriptor) desc, lattice);
2638 MethodDescriptor md = (MethodDescriptor) desc;
2639 ClassDescriptor cd = md.getClassDesc();
2640 // ssjava.writeLatticeDotFile(cd, md, lattice);
2645 // deprecated: it builds method/class lattices without considering class inheritance
2646 private void buildLattice() {
2648 Set<Descriptor> keySet = mapDescriptorToCombineSkeletonHierarchyGraph.keySet();
2649 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
2650 Descriptor desc = (Descriptor) iterator.next();
2652 SSJavaLattice<String> simpleLattice = buildLattice.buildLattice(desc);
2654 addMapDescToSimpleLattice(desc, simpleLattice);
2656 HierarchyGraph simpleHierarchyGraph = getSimpleHierarchyGraph(desc);
2657 System.out.println("\n## insertIntermediateNodesToStraightLine:"
2658 + simpleHierarchyGraph.getName());
2659 SSJavaLattice<String> lattice =
2660 buildLattice.insertIntermediateNodesToStraightLine(desc, simpleLattice);
2661 lattice.removeRedundantEdges();
2663 LocationInference.numLocationsSInfer += lattice.getKeySet().size();
2665 if (desc instanceof ClassDescriptor) {
2667 cd2lattice.put((ClassDescriptor) desc, lattice);
2668 // ssjava.writeLatticeDotFile((ClassDescriptor) desc, null, lattice);
2669 } else if (desc instanceof MethodDescriptor) {
2671 md2lattice.put((MethodDescriptor) desc, lattice);
2672 MethodDescriptor md = (MethodDescriptor) desc;
2673 ClassDescriptor cd = md.getClassDesc();
2674 // ssjava.writeLatticeDotFile(cd, md, lattice);
2681 private void buildLatticeInheritanceTree() {
2682 // DFS the inheritance tree and propagates lattice nodes/edges from the parent to children
2683 // Node<ClassDescriptor> rootNode = inheritanceTree.getRootNode();
2684 DFSBuildLatticeInheritanceTree(rootClassDescriptor);
2687 public Set<ClassDescriptor> getDirectSubClasses(ClassDescriptor parent) {
2689 Set<ClassDescriptor> result = new HashSet<ClassDescriptor>();
2691 Set<ClassDescriptor> children = tu.getDirectSubClasses(parent);
2692 if (children == null) {
2693 children = new HashSet<ClassDescriptor>();
2696 for (Iterator iterator = children.iterator(); iterator.hasNext();) {
2697 ClassDescriptor child = (ClassDescriptor) iterator.next();
2698 if (toanalyze_classDescSet.contains(child)) {
2706 private void DFSBuildLatticeInheritanceTree(ClassDescriptor cd) {
2707 // ClassDescriptor cd = node.getData();
2709 ClassDescriptor parentClassDesc = cd.getSuperDesc();
2710 if (parentClassDesc != null) {
2711 Map<TripleItem, String> parentMap = buildLattice.getIntermediateLocMap(parentClassDesc);
2712 buildLattice.setIntermediateLocMap(cd, parentMap);
2717 for (Iterator iterator = cd.getMethods(); iterator.hasNext();) {
2718 MethodDescriptor md = (MethodDescriptor) iterator.next();
2719 if (toanalyze_methodDescList.contains(md)) {
2720 MethodDescriptor parentMethodDesc = getParentMethodDesc(md.getClassDesc(), md);
2721 if (parentMethodDesc != null) {
2722 Map<TripleItem, String> parentMap = buildLattice.getIntermediateLocMap(parentMethodDesc);
2723 Map<TripleItem, String> childMap = new HashMap<TripleItem, String>();
2724 Set<TripleItem> keySet = parentMap.keySet();
2725 for (Iterator iterator2 = keySet.iterator(); iterator2.hasNext();) {
2726 TripleItem key = (TripleItem) iterator2.next();
2727 childMap.put(key, parentMap.get(key));
2729 buildLattice.setIntermediateLocMap(md, childMap);
2735 // traverse children
2736 Set<ClassDescriptor> children = tu.getDirectSubClasses(cd);
2737 if (children != null) {
2738 for (Iterator iterator = children.iterator(); iterator.hasNext();) {
2739 ClassDescriptor classDescriptor = (ClassDescriptor) iterator.next();
2740 if (toanalyze_classDescSet.contains(classDescriptor)) {
2741 DFSBuildLatticeInheritanceTree(classDescriptor);
2743 if (classDescriptor.isAbstract()) {
2744 DFSBuildLatticeInheritanceTree(classDescriptor);
2752 public void addMapDescToSimpleLattice(Descriptor desc, SSJavaLattice<String> lattice) {
2753 mapDescriptorToSimpleLattice.put(desc, lattice);
2756 public SSJavaLattice<String> getSimpleLattice(Descriptor desc) {
2757 return mapDescriptorToSimpleLattice.get(desc);
2760 private void simplifyHierarchyGraph() {
2761 Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
2762 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
2763 Descriptor desc = (Descriptor) iterator.next();
2764 // System.out.println("SSJAVA: remove redundant edges: " + desc);
2765 HierarchyGraph simpleHierarchyGraph = getHierarchyGraph(desc).clone();
2766 simpleHierarchyGraph.setName(desc + "_SIMPLE");
2767 simpleHierarchyGraph.removeRedundantEdges();
2768 mapDescriptorToSimpleHierarchyGraph.put(desc, simpleHierarchyGraph);
2772 private void insertCombinationNodes() {
2773 Set<Descriptor> keySet = mapDescriptorToSkeletonHierarchyGraph.keySet();
2774 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
2775 Descriptor desc = (Descriptor) iterator.next();
2776 System.out.println("\nSSJAVA: Inserting Combination Nodes:" + desc);
2777 HierarchyGraph skeletonGraph = getSkeletonHierarchyGraph(desc);
2778 HierarchyGraph skeletonGraphWithCombinationNode = skeletonGraph.clone();
2779 skeletonGraphWithCombinationNode.setName(desc + "_SC");
2781 HierarchyGraph simpleHierarchyGraph = getSimpleHierarchyGraph(desc);
2782 skeletonGraphWithCombinationNode.insertCombinationNodesToGraph(simpleHierarchyGraph);
2783 // skeletonGraphWithCombinationNode.insertCombinationNodesToGraph(simpleHierarchyGraph,
2785 // skeletonGraphWithCombinationNode.simplifySkeletonCombinationHierarchyGraph();
2786 skeletonGraphWithCombinationNode.removeRedundantEdges();
2787 mapDescriptorToCombineSkeletonHierarchyGraph.put(desc, skeletonGraphWithCombinationNode);
2791 private void constructSkeletonHierarchyGraph() {
2792 Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
2793 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
2794 Descriptor desc = (Descriptor) iterator.next();
2795 System.out.println("SSJAVA: Constructing Skeleton Hierarchy Graph: " + desc);
2796 HierarchyGraph simpleGraph = getSimpleHierarchyGraph(desc);
2797 HierarchyGraph skeletonGraph = simpleGraph.generateSkeletonGraph();
2798 skeletonGraph.setMapDescToHNode(simpleGraph.getMapDescToHNode());
2799 skeletonGraph.setMapHNodeToDescSet(simpleGraph.getMapHNodeToDescSet());
2800 skeletonGraph.simplifyHierarchyGraph(this);
2801 mapDescriptorToSkeletonHierarchyGraph.put(desc, skeletonGraph);
2805 private void recurUpAccumulateInheritanceDesc(Descriptor curDesc, Set<Descriptor> set) {
2807 if (curDesc instanceof ClassDescriptor) {
2808 ClassDescriptor cd = (ClassDescriptor) curDesc;
2809 ClassDescriptor parentClassDesc = cd.getSuperDesc();
2810 if (parentClassDesc != null && !parentClassDesc.equals(rootClassDescriptor)) {
2811 set.add(parentClassDesc);
2812 recurUpAccumulateInheritanceDesc(parentClassDesc, set);
2815 MethodDescriptor md = (MethodDescriptor) curDesc;
2816 ClassDescriptor cd = md.getClassDesc();
2819 ClassDescriptor parentClassDesc = cd.getSuperDesc();
2820 if (parentClassDesc != null && !parentClassDesc.equals(rootClassDescriptor)) {
2822 Set<MethodDescriptor> methodDescSet =
2823 parentClassDesc.getMethodTable().getSet(md.getSymbol());
2824 for (Iterator iterator = methodDescSet.iterator(); iterator.hasNext();) {
2825 MethodDescriptor parentMethodDesc = (MethodDescriptor) iterator.next();
2826 if (parentMethodDesc.matches(md)) {
2827 set.add(parentMethodDesc);
2828 recurUpAccumulateInheritanceDesc(parentMethodDesc, set);
2837 private void recurDownAccumulateInheritanceDesc(Descriptor curDesc, Set<Descriptor> set) {
2839 if (curDesc instanceof ClassDescriptor) {
2840 ClassDescriptor cd = (ClassDescriptor) curDesc;
2841 ClassDescriptor parentClassDesc = cd.getSuperDesc();
2842 Set<ClassDescriptor> directSubClasses = tu.getDirectSubClasses(cd);
2843 for (Iterator iterator = directSubClasses.iterator(); iterator.hasNext();) {
2844 ClassDescriptor child = (ClassDescriptor) iterator.next();
2845 recurDownAccumulateInheritanceDesc(child, set);
2848 MethodDescriptor md = (MethodDescriptor) curDesc;
2849 ClassDescriptor cd = md.getClassDesc();
2852 Set<ClassDescriptor> directSubClasses = tu.getDirectSubClasses(cd);
2853 for (Iterator iterator = directSubClasses.iterator(); iterator.hasNext();) {
2854 ClassDescriptor child = (ClassDescriptor) iterator.next();
2856 Set<MethodDescriptor> methodDescSet = child.getMethodTable().getSet(md.getSymbol());
2857 for (Iterator iterator2 = methodDescSet.iterator(); iterator2.hasNext();) {
2858 MethodDescriptor childMethodDesc = (MethodDescriptor) iterator2.next();
2859 if (childMethodDesc.matches(md)) {
2860 set.add(childMethodDesc);
2861 recurDownAccumulateInheritanceDesc(childMethodDesc, set);
2870 private void accumulateInheritanceDesc(Descriptor curDesc, Set<Descriptor> set) {
2872 recurUpAccumulateInheritanceDesc(curDesc, set);
2873 recurDownAccumulateInheritanceDesc(curDesc, set);
2877 public boolean isValidMergeInheritanceCheck(Descriptor desc, Set<HNode> mergeSet) {
2879 // set up inheritance chain set...
2880 Set<Descriptor> inheritanceDescSet = new HashSet<Descriptor>();
2881 recurUpAccumulateInheritanceDesc(desc, inheritanceDescSet);
2883 nextgraph: for (Iterator iterator = inheritanceDescSet.iterator(); iterator.hasNext();) {
2884 Descriptor inheritDesc = (Descriptor) iterator.next();
2886 if (!desc.equals(inheritDesc)) {
2887 HierarchyGraph graph = getSkeletonCombinationHierarchyGraph(inheritDesc);
2889 // first check whether this graph includes all elements of the merge set
2890 for (Iterator iterator2 = mergeSet.iterator(); iterator2.hasNext();) {
2891 HNode node = (HNode) iterator2.next();
2892 if (!graph.contains(node)) {
2897 HNode firstNode = mergeSet.iterator().next();
2899 Set<HNode> incomingNode = graph.getIncomingNodeSet(firstNode);
2900 Set<HNode> outgoingNode = graph.getOutgoingNodeSet(firstNode);
2902 for (Iterator iterator2 = mergeSet.iterator(); iterator2.hasNext();) {
2903 HNode node = (HNode) iterator2.next();
2905 if (!graph.getIncomingNodeSet(node).equals(incomingNode)
2906 || !graph.getOutgoingNodeSet(node).equals(outgoingNode)) {
2918 private void debug_writeHierarchyDotFiles() {
2920 Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
2921 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
2922 Descriptor desc = (Descriptor) iterator.next();
2923 getHierarchyGraph(desc).writeGraph();
2928 private void debug_writeSimpleHierarchyDotFiles() {
2930 Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
2931 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
2932 Descriptor desc = (Descriptor) iterator.next();
2933 getHierarchyGraph(desc).writeGraph();
2934 getSimpleHierarchyGraph(desc).writeGraph();
2935 getSimpleHierarchyGraph(desc).writeGraph(true);
2940 private void debug_writeSkeletonHierarchyDotFiles() {
2942 Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
2943 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
2944 Descriptor desc = (Descriptor) iterator.next();
2945 getSkeletonHierarchyGraph(desc).writeGraph();
2950 private void debug_writeSkeletonCombinationHierarchyDotFiles() {
2952 Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
2953 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
2954 Descriptor desc = (Descriptor) iterator.next();
2955 getSkeletonCombinationHierarchyGraph(desc).writeGraph();
2960 public HierarchyGraph getSimpleHierarchyGraph(Descriptor d) {
2961 return mapDescriptorToSimpleHierarchyGraph.get(d);
2964 private HierarchyGraph getSkeletonHierarchyGraph(Descriptor d) {
2965 if (!mapDescriptorToSkeletonHierarchyGraph.containsKey(d)) {
2966 mapDescriptorToSkeletonHierarchyGraph.put(d, new HierarchyGraph(d));
2968 return mapDescriptorToSkeletonHierarchyGraph.get(d);
2971 public HierarchyGraph getSkeletonCombinationHierarchyGraph(Descriptor d) {
2972 if (!mapDescriptorToCombineSkeletonHierarchyGraph.containsKey(d)) {
2973 mapDescriptorToCombineSkeletonHierarchyGraph.put(d, new HierarchyGraph(d));
2975 return mapDescriptorToCombineSkeletonHierarchyGraph.get(d);
2978 private void constructHierarchyGraph() {
2980 LinkedList<MethodDescriptor> methodDescList =
2981 (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
2983 while (!methodDescList.isEmpty()) {
2984 MethodDescriptor md = methodDescList.removeLast();
2985 if (state.SSJAVADEBUG) {
2986 HierarchyGraph hierarchyGraph = new HierarchyGraph(md);
2987 System.out.println();
2988 System.out.println("SSJAVA: Construcing the hierarchy graph from " + md);
2989 constructHierarchyGraph(md, hierarchyGraph);
2990 mapDescriptorToHierarchyGraph.put(md, hierarchyGraph);
2996 while (!toAnalyzeIsEmpty()) {
2997 ClassDescriptor cd = toAnalyzeNext();
2998 HierarchyGraph graph = getHierarchyGraph(cd);
2999 for (Iterator iter = cd.getFields(); iter.hasNext();) {
3000 FieldDescriptor fieldDesc = (FieldDescriptor) iter.next();
3001 if (!(fieldDesc.isStatic() && fieldDesc.isFinal())) {
3002 graph.getHNode(fieldDesc);
3007 Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
3008 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
3009 Descriptor key = (Descriptor) iterator.next();
3010 HierarchyGraph graph = getHierarchyGraph(key);
3012 Set<HNode> nodeToBeConnected = new HashSet<HNode>();
3013 for (Iterator iterator2 = graph.getNodeSet().iterator(); iterator2.hasNext();) {
3014 HNode node = (HNode) iterator2.next();
3015 if (!node.isSkeleton() && !node.isCombinationNode()) {
3016 if (graph.getIncomingNodeSet(node).size() == 0) {
3017 nodeToBeConnected.add(node);
3022 for (Iterator iterator2 = nodeToBeConnected.iterator(); iterator2.hasNext();) {
3023 HNode node = (HNode) iterator2.next();
3024 // System.out.println("NEED TO BE CONNECTED TO TOP=" + node);
3025 graph.addEdge(graph.getHNode(TOPDESC), node);
3032 private void constructHierarchyGraph2() {
3034 // do fixed-point analysis
3036 LinkedList<MethodDescriptor> descriptorListToAnalyze = ssjava.getSortedDescriptors();
3038 // Collections.sort(descriptorListToAnalyze, new
3039 // Comparator<MethodDescriptor>() {
3040 // public int compare(MethodDescriptor o1, MethodDescriptor o2) {
3041 // return o1.getSymbol().compareToIgnoreCase(o2.getSymbol());
3045 // current descriptors to visit in fixed-point interprocedural analysis,
3046 // prioritized by dependency in the call graph
3047 methodDescriptorsToVisitStack.clear();
3049 Set<MethodDescriptor> methodDescriptorToVistSet = new HashSet<MethodDescriptor>();
3050 methodDescriptorToVistSet.addAll(descriptorListToAnalyze);
3052 while (!descriptorListToAnalyze.isEmpty()) {
3053 MethodDescriptor md = descriptorListToAnalyze.removeFirst();
3054 methodDescriptorsToVisitStack.add(md);
3057 // analyze scheduled methods until there are no more to visit
3058 while (!methodDescriptorsToVisitStack.isEmpty()) {
3059 // start to analyze leaf node
3060 MethodDescriptor md = methodDescriptorsToVisitStack.pop();
3062 HierarchyGraph hierarchyGraph = new HierarchyGraph(md);
3063 // MethodSummary methodSummary = new MethodSummary(md);
3065 // MethodLocationInfo methodInfo = new MethodLocationInfo(md);
3066 // curMethodInfo = methodInfo;
3068 System.out.println();
3069 System.out.println("SSJAVA: Construcing the hierarchy graph from " + md);
3071 constructHierarchyGraph(md, hierarchyGraph);
3073 HierarchyGraph prevHierarchyGraph = getHierarchyGraph(md);
3074 // MethodSummary prevMethodSummary = getMethodSummary(md);
3076 if (!hierarchyGraph.equals(prevHierarchyGraph)) {
3078 mapDescriptorToHierarchyGraph.put(md, hierarchyGraph);
3079 // mapDescToLocationSummary.put(md, methodSummary);
3081 // results for callee changed, so enqueue dependents caller for
3083 Iterator<MethodDescriptor> depsItr = ssjava.getDependents(md).iterator();
3084 while (depsItr.hasNext()) {
3085 MethodDescriptor methodNext = depsItr.next();
3086 if (!methodDescriptorsToVisitStack.contains(methodNext)
3087 && methodDescriptorToVistSet.contains(methodNext)) {
3088 methodDescriptorsToVisitStack.add(methodNext);
3097 while (!toAnalyzeIsEmpty()) {
3098 ClassDescriptor cd = toAnalyzeNext();
3099 HierarchyGraph graph = getHierarchyGraph(cd);
3100 for (Iterator iter = cd.getFields(); iter.hasNext();) {
3101 FieldDescriptor fieldDesc = (FieldDescriptor) iter.next();
3102 if (!(fieldDesc.isStatic() && fieldDesc.isFinal())) {
3103 graph.getHNode(fieldDesc);
3108 Set<Descriptor> keySet = mapDescriptorToHierarchyGraph.keySet();
3109 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
3110 Descriptor key = (Descriptor) iterator.next();
3111 HierarchyGraph graph = getHierarchyGraph(key);
3113 Set<HNode> nodeToBeConnected = new HashSet<HNode>();
3114 for (Iterator iterator2 = graph.getNodeSet().iterator(); iterator2.hasNext();) {
3115 HNode node = (HNode) iterator2.next();
3116 if (!node.isSkeleton() && !node.isCombinationNode()) {
3117 if (graph.getIncomingNodeSet(node).size() == 0) {
3118 nodeToBeConnected.add(node);
3123 for (Iterator iterator2 = nodeToBeConnected.iterator(); iterator2.hasNext();) {
3124 HNode node = (HNode) iterator2.next();
3125 // System.out.println("NEED TO BE CONNECTED TO TOP=" + node);
3126 graph.addEdge(graph.getHNode(TOPDESC), node);
3133 private HierarchyGraph getHierarchyGraph(Descriptor d) {
3134 if (!mapDescriptorToHierarchyGraph.containsKey(d)) {
3135 mapDescriptorToHierarchyGraph.put(d, new HierarchyGraph(d));
3137 return mapDescriptorToHierarchyGraph.get(d);
3140 private void constructHierarchyGraph(MethodDescriptor md, HierarchyGraph methodGraph) {
3142 // visit each node of method flow graph
3143 FlowGraph fg = getFlowGraph(md);
3144 // Set<FlowNode> nodeSet = fg.getNodeSet();
3146 Set<FlowEdge> edgeSet = fg.getEdgeSet();
3148 Set<Descriptor> paramDescSet = fg.getMapParamDescToIdx().keySet();
3149 for (Iterator iterator = paramDescSet.iterator(); iterator.hasNext();) {
3150 Descriptor desc = (Descriptor) iterator.next();
3151 methodGraph.getHNode(desc).setSkeleton(true);
3154 // for the method lattice, we need to look at the first element of
3155 // NTuple<Descriptor>
3156 boolean hasGlobalAccess = false;
3157 // for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
3158 // FlowNode originalSrcNode = (FlowNode) iterator.next();
3159 for (Iterator iterator = edgeSet.iterator(); iterator.hasNext();) {
3160 FlowEdge edge = (FlowEdge) iterator.next();
3162 FlowNode originalSrcNode = fg.getFlowNode(edge.getInitTuple());
3163 Set<FlowNode> sourceNodeSet = new HashSet<FlowNode>();
3164 if (originalSrcNode instanceof FlowReturnNode) {
3165 FlowReturnNode rnode = (FlowReturnNode) originalSrcNode;
3166 // System.out.println("rnode=" + rnode);
3167 Set<NTuple<Descriptor>> tupleSet = rnode.getReturnTupleSet();
3168 for (Iterator iterator2 = tupleSet.iterator(); iterator2.hasNext();) {
3169 NTuple<Descriptor> nTuple = (NTuple<Descriptor>) iterator2.next();
3170 sourceNodeSet.add(fg.getFlowNode(nTuple));
3171 // System.out.println("&&&SOURCE fg.getFlowNode(nTuple)=" + fg.getFlowNode(nTuple));
3174 sourceNodeSet.add(originalSrcNode);
3177 // System.out.println("---sourceNodeSet=" + sourceNodeSet + " from originalSrcNode="
3178 // + originalSrcNode);
3180 for (Iterator iterator3 = sourceNodeSet.iterator(); iterator3.hasNext();) {
3181 FlowNode srcNode = (FlowNode) iterator3.next();
3183 NTuple<Descriptor> srcNodeTuple = srcNode.getDescTuple();
3184 Descriptor srcLocalDesc = srcNodeTuple.get(0);
3186 if (srcLocalDesc instanceof InterDescriptor
3187 && ((InterDescriptor) srcLocalDesc).getMethodArgIdxPair() != null) {
3189 if (srcNode.getCompositeLocation() == null) {
3194 // if the srcNode is started with the global descriptor
3195 // need to set as a skeleton node
3196 if (!hasGlobalAccess && srcNode.getDescTuple().startsWith(GLOBALDESC)) {
3197 hasGlobalAccess = true;
3200 // Set<FlowEdge> outEdgeSet = fg.getOutEdgeSet(originalSrcNode);
3201 // for (Iterator iterator2 = outEdgeSet.iterator(); iterator2.hasNext();) {
3202 // FlowEdge outEdge = (FlowEdge) iterator2.next();
3203 // FlowNode originalDstNode = outEdge.getDst();
3204 FlowNode originalDstNode = fg.getFlowNode(edge.getEndTuple());
3206 Set<FlowNode> dstNodeSet = new HashSet<FlowNode>();
3207 if (originalDstNode instanceof FlowReturnNode) {
3208 FlowReturnNode rnode = (FlowReturnNode) originalDstNode;
3209 // System.out.println("\n-returnNode=" + rnode);
3210 Set<NTuple<Descriptor>> tupleSet = rnode.getReturnTupleSet();
3211 for (Iterator iterator4 = tupleSet.iterator(); iterator4.hasNext();) {
3212 NTuple<Descriptor> nTuple = (NTuple<Descriptor>) iterator4.next();
3213 dstNodeSet.add(fg.getFlowNode(nTuple));
3214 // System.out.println("&&&DST fg.getFlowNode(nTuple)=" + fg.getFlowNode(nTuple));
3217 dstNodeSet.add(originalDstNode);
3219 // System.out.println("---dstNodeSet=" + dstNodeSet);
3220 for (Iterator iterator4 = dstNodeSet.iterator(); iterator4.hasNext();) {
3221 FlowNode dstNode = (FlowNode) iterator4.next();
3223 NTuple<Descriptor> dstNodeTuple = dstNode.getDescTuple();
3224 Descriptor dstLocalDesc = dstNodeTuple.get(0);
3226 if (dstLocalDesc instanceof InterDescriptor
3227 && ((InterDescriptor) dstLocalDesc).getMethodArgIdxPair() != null) {
3228 if (dstNode.getCompositeLocation() == null) {
3229 // System.out.println("%%%%%%%%%%%%%SKIP=" + dstNode);
3234 // if (outEdge.getInitTuple().equals(srcNodeTuple)
3235 // && outEdge.getEndTuple().equals(dstNodeTuple)) {
3237 NTuple<Descriptor> srcCurTuple = srcNode.getCurrentDescTuple();
3238 NTuple<Descriptor> dstCurTuple = dstNode.getCurrentDescTuple();
3240 // //////////////////////////
3241 // inheritance check
3242 if (mapMethodDescToHighestOverriddenMethodDesc.containsKey(md)) {
3244 MethodDescriptor highestOverriddenMethodDesc =
3245 mapMethodDescToHighestOverriddenMethodDesc.get(md);
3247 if (srcCurTuple.get(srcCurTuple.size() - 1).getSymbol().startsWith(PCLOC)) {
3251 // //////////////////////////
3253 // System.out.println("-srcCurTuple=" + srcCurTuple + " dstCurTuple=" + dstCurTuple
3254 // + " srcNode=" + srcNode + " dstNode=" + dstNode);
3256 // srcCurTuple = translateBaseTuple(srcNode, srcCurTuple);
3257 // dstCurTuple = translateBaseTuple(dstNode, dstCurTuple);
3259 if ((srcCurTuple.size() > 1 && dstCurTuple.size() > 1)
3260 && srcCurTuple.get(0).equals(dstCurTuple.get(0))) {
3262 // value flows between fields
3263 Descriptor desc = srcCurTuple.get(0);
3264 ClassDescriptor classDesc;
3266 if (desc.equals(GLOBALDESC)) {
3267 classDesc = md.getClassDesc();
3269 VarDescriptor varDesc = (VarDescriptor) srcCurTuple.get(0);
3270 classDesc = varDesc.getType().getClassDesc();
3272 extractFlowsBetweenFields(classDesc, srcNode, dstNode, 1);
3274 } else if ((srcCurTuple.size() == 1 && dstCurTuple.size() == 1)
3275 || ((srcCurTuple.size() > 1 || dstCurTuple.size() > 1) && !srcCurTuple.get(0).equals(
3276 dstCurTuple.get(0)))) {
3278 // value flow between a primitive local var - a primitive local var or local var -
3281 Descriptor srcDesc = srcCurTuple.get(0);
3282 Descriptor dstDesc = dstCurTuple.get(0);
3284 methodGraph.addEdge(srcDesc, dstDesc);
3286 if (fg.isParamDesc(srcDesc)) {
3287 methodGraph.setParamHNode(srcDesc);
3289 if (fg.isParamDesc(dstDesc)) {
3290 methodGraph.setParamHNode(dstDesc);
3304 // If the method accesses static fields
3305 // set hasGloabalAccess true in the method summary.
3306 if (hasGlobalAccess) {
3307 getMethodSummary(md).setHasGlobalAccess();
3309 methodGraph.getHNode(GLOBALDESC).setSkeleton(true);
3311 if (ssjava.getMethodContainingSSJavaLoop().equals(md)) {
3312 // if the current method contains the event loop
3313 // we need to set all nodes of the hierarchy graph as a skeleton node
3314 Set<HNode> hnodeSet = methodGraph.getNodeSet();
3315 for (Iterator iterator = hnodeSet.iterator(); iterator.hasNext();) {
3316 HNode hnode = (HNode) iterator.next();
3317 hnode.setSkeleton(true);
3323 private NTuple<Descriptor> translateBaseTuple(FlowNode flowNode, NTuple<Descriptor> inTuple) {
3325 if (flowNode.getBaseTuple() != null) {
3327 NTuple<Descriptor> translatedTuple = new NTuple<Descriptor>();
3329 NTuple<Descriptor> baseTuple = flowNode.getBaseTuple();
3331 for (int i = 0; i < baseTuple.size(); i++) {
3332 translatedTuple.add(baseTuple.get(i));
3335 for (int i = 1; i < inTuple.size(); i++) {
3336 translatedTuple.add(inTuple.get(i));
3339 // System.out.println("------TRANSLATED " + inTuple + " -> " + translatedTuple);
3340 return translatedTuple;
3348 private MethodSummary getMethodSummary(MethodDescriptor md) {
3349 if (!mapDescToLocationSummary.containsKey(md)) {
3350 mapDescToLocationSummary.put(md, new MethodSummary(md));
3352 return (MethodSummary) mapDescToLocationSummary.get(md);
3355 private void addMapClassDefinitionToLineNum(ClassDescriptor cd, String strLine, int lineNum) {
3357 String classSymbol = cd.getSymbol();
3358 int idx = classSymbol.lastIndexOf("$");
3360 classSymbol = classSymbol.substring(idx + 1);
3363 String pattern = "class " + classSymbol + " ";
3364 if (strLine.indexOf(pattern) != -1) {
3365 mapDescToDefinitionLine.put(cd, lineNum);
3369 private void addMapMethodDefinitionToLineNum(Set<MethodDescriptor> methodSet, String strLine,
3371 for (Iterator iterator = methodSet.iterator(); iterator.hasNext();) {
3372 MethodDescriptor md = (MethodDescriptor) iterator.next();
3373 String pattern = md.getMethodDeclaration();
3374 if (strLine.indexOf(pattern) != -1) {
3375 mapDescToDefinitionLine.put(md, lineNum);
3376 methodSet.remove(md);
3383 private void readOriginalSourceFiles() {
3385 SymbolTable classtable = state.getClassSymbolTable();
3387 Set<ClassDescriptor> classDescSet = new HashSet<ClassDescriptor>();
3388 classDescSet.addAll(classtable.getValueSet());
3391 // inefficient implement. it may re-visit the same file if the file
3392 // contains more than one class definitions.
3393 for (Iterator iterator = classDescSet.iterator(); iterator.hasNext();) {
3394 ClassDescriptor cd = (ClassDescriptor) iterator.next();
3396 Set<MethodDescriptor> methodSet = new HashSet<MethodDescriptor>();
3397 methodSet.addAll(cd.getMethodTable().getValueSet());
3399 String sourceFileName = cd.getSourceFileName();
3400 Vector<String> lineVec = new Vector<String>();
3402 mapFileNameToLineVector.put(sourceFileName, lineVec);
3404 BufferedReader in = new BufferedReader(new FileReader(sourceFileName));
3407 lineVec.add(""); // the index is started from 1.
3408 while ((strLine = in.readLine()) != null) {
3409 lineVec.add(lineNum, strLine);
3410 addMapClassDefinitionToLineNum(cd, strLine, lineNum);
3411 addMapMethodDefinitionToLineNum(methodSet, strLine, lineNum);
3417 } catch (IOException e) {
3418 e.printStackTrace();
3423 private String generateLatticeDefinition(Descriptor desc) {
3425 Set<String> sharedLocSet = new HashSet<String>();
3427 SSJavaLattice<String> lattice = getLattice(desc);
3428 String rtr = "@LATTICE(\"";
3430 Map<String, Set<String>> map = lattice.getTable();
3431 Set<String> keySet = map.keySet();
3433 // System.out.println("@generateLatticeDefinition=" + desc + " map=" + map);
3435 boolean first = true;
3436 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
3437 String key = (String) iterator.next();
3438 if (!key.equals(lattice.getTopItem())) {
3439 Set<String> connectedSet = map.get(key);
3441 if (connectedSet.size() == 1) {
3442 if (connectedSet.iterator().next().equals(lattice.getBottomItem())) {
3450 if (lattice.isSharedLoc(key)) {
3451 rtr += "," + key + "*";
3456 for (Iterator iterator2 = connectedSet.iterator(); iterator2.hasNext();) {
3457 String loc = (String) iterator2.next();
3458 if (!loc.equals(lattice.getBottomItem())) {
3465 rtr += loc + "<" + key;
3466 if (lattice.isSharedLoc(key) && (!sharedLocSet.contains(key))) {
3467 rtr += "," + key + "*";
3468 sharedLocSet.add(key);
3470 if (lattice.isSharedLoc(loc) && (!sharedLocSet.contains(loc))) {
3471 rtr += "," + loc + "*";
3472 sharedLocSet.add(loc);
3480 if (desc instanceof MethodDescriptor) {
3481 // System.out.println("#EXTRA LOC DECLARATION GEN=" + desc);
3483 MethodDescriptor md = (MethodDescriptor) desc;
3484 MethodSummary methodSummary = getMethodSummary(md);
3486 TypeDescriptor returnType = ((MethodDescriptor) desc).getReturnType();
3487 if (!ssjava.getMethodContainingSSJavaLoop().equals(desc) && returnType != null
3488 && (!returnType.isVoid())) {
3489 CompositeLocation returnLoc = methodSummary.getRETURNLoc();
3490 if (returnLoc.getSize() == 1) {
3491 String returnLocStr = generateLocationAnnoatation(methodSummary.getRETURNLoc());
3492 if (rtr.indexOf(returnLocStr) == -1) {
3493 rtr += "," + returnLocStr;
3499 if (!ssjava.getMethodContainingSSJavaLoop().equals(desc)) {
3500 if (returnType != null && (!returnType.isVoid())) {
3502 "\n@RETURNLOC(\"" + generateLocationAnnoatation(methodSummary.getRETURNLoc()) + "\")";
3505 CompositeLocation pcLoc = methodSummary.getPCLoc();
3506 if ((pcLoc != null) && (!pcLoc.get(0).isTop())) {
3507 rtr += "\n@PCLOC(\"" + generateLocationAnnoatation(pcLoc) + "\")";
3511 if (!md.isStatic()) {
3512 rtr += "\n@THISLOC(\"" + methodSummary.getThisLocName() + "\")";
3514 rtr += "\n@GLOBALLOC(\"" + methodSummary.getGlobalLocName() + "\")";
3523 private void generateAnnoatedCode() {
3525 readOriginalSourceFiles();
3528 while (!toAnalyzeIsEmpty()) {
3529 ClassDescriptor cd = toAnalyzeNext();
3531 setupToAnalazeMethod(cd);
3533 String sourceFileName = cd.getSourceFileName();
3535 if (cd.isInterface()) {
3539 int classDefLine = mapDescToDefinitionLine.get(cd);
3540 Vector<String> sourceVec = mapFileNameToLineVector.get(sourceFileName);
3542 LocationSummary fieldLocSummary = getLocationSummary(cd);
3544 String fieldLatticeDefStr = generateLatticeDefinition(cd);
3545 String annoatedSrc = fieldLatticeDefStr + newline + sourceVec.get(classDefLine);
3546 sourceVec.set(classDefLine, annoatedSrc);
3548 // generate annotations for field declarations
3549 // Map<Descriptor, CompositeLocation> inferLocMap = fieldLocInfo.getMapDescToInferLocation();
3550 Map<String, String> mapFieldNameToLocName = fieldLocSummary.getMapHNodeNameToLocationName();
3552 for (Iterator iter = cd.getFields(); iter.hasNext();) {
3553 FieldDescriptor fd = (FieldDescriptor) iter.next();
3555 String locAnnotationStr;
3556 // CompositeLocation inferLoc = inferLocMap.get(fd);
3557 String locName = mapFieldNameToLocName.get(fd.getSymbol());
3559 if (locName != null) {
3560 // infer loc is null if the corresponding field is static and final
3561 // locAnnotationStr = "@LOC(\"" + generateLocationAnnoatation(inferLoc) + "\")";
3562 locAnnotationStr = "@LOC(\"" + locName + "\")";
3563 int fdLineNum = fd.getLineNum();
3564 String orgFieldDeclarationStr = sourceVec.get(fdLineNum);
3565 String fieldDeclaration = fd.toString();
3566 fieldDeclaration = fieldDeclaration.substring(0, fieldDeclaration.length() - 1);
3567 String annoatedStr = locAnnotationStr + " " + orgFieldDeclarationStr;
3568 sourceVec.set(fdLineNum, annoatedStr);
3573 while (!toAnalyzeMethodIsEmpty()) {
3574 MethodDescriptor md = toAnalyzeMethodNext();
3576 if (!ssjava.needTobeAnnotated(md)) {
3580 SSJavaLattice<String> methodLattice = md2lattice.get(md);
3581 // System.out.println("md=" + md + " methodLattice=" + methodLattice);
3582 if (methodLattice != null) {
3584 int methodDefLine = md.getLineNum();
3586 // MethodLocationInfo methodLocInfo = getMethodLocationInfo(md);
3587 // Map<Descriptor, CompositeLocation> methodInferLocMap =
3588 // methodLocInfo.getMapDescToInferLocation();
3590 MethodSummary methodSummary = getMethodSummary(md);
3592 Map<Descriptor, CompositeLocation> mapVarDescToInferLoc =
3593 methodSummary.getMapVarDescToInferCompositeLocation();
3594 // System.out.println("-----md=" + md + " methodDefLine=" + methodDefLine);
3595 // System.out.println("-----mapVarDescToInferLoc=" + mapVarDescToInferLoc);
3597 Set<Descriptor> localVarDescSet = mapVarDescToInferLoc.keySet();
3599 Set<String> localLocElementSet = methodLattice.getElementSet();
3601 for (Iterator iterator = localVarDescSet.iterator(); iterator.hasNext();) {
3602 Descriptor localVarDesc = (Descriptor) iterator.next();
3603 // System.out.println("-------localVarDesc=" + localVarDesc);
3604 CompositeLocation inferLoc = mapVarDescToInferLoc.get(localVarDesc);
3606 String localLocIdentifier = inferLoc.get(0).getLocIdentifier();
3607 if (!localLocElementSet.contains(localLocIdentifier)) {
3608 methodLattice.put(localLocIdentifier);
3611 String locAnnotationStr = "@LOC(\"" + generateLocationAnnoatation(inferLoc) + "\")";
3613 if (!isParameter(md, localVarDesc)) {
3614 if (mapDescToDefinitionLine.containsKey(localVarDesc)) {
3615 int varLineNum = mapDescToDefinitionLine.get(localVarDesc);
3616 String orgSourceLine = sourceVec.get(varLineNum);
3617 // System.out.println("varLineNum=" + varLineNum + " org src=" + orgSourceLine);
3619 orgSourceLine.indexOf(generateVarDeclaration((VarDescriptor) localVarDesc));
3620 // System.out.println("idx=" + idx
3621 // + " generateVarDeclaration((VarDescriptor) localVarDesc)="
3622 // + generateVarDeclaration((VarDescriptor) localVarDesc));
3624 String annoatedStr =
3625 orgSourceLine.substring(0, idx) + locAnnotationStr + " "
3626 + orgSourceLine.substring(idx);
3627 sourceVec.set(varLineNum, annoatedStr);
3630 String methodDefStr = sourceVec.get(methodDefLine);
3633 getParamLocation(methodDefStr,
3634 generateVarDeclaration((VarDescriptor) localVarDesc));
3635 // System.out.println("methodDefStr=" + methodDefStr + " localVarDesc=" + localVarDesc
3636 // + " idx=" + idx);
3639 String annoatedStr =
3640 methodDefStr.substring(0, idx) + locAnnotationStr + " "
3641 + methodDefStr.substring(idx);
3642 sourceVec.set(methodDefLine, annoatedStr);
3647 // check if the lattice has to have the location type for the this
3650 // boolean needToAddthisRef = hasThisReference(md);
3651 // if (localLocElementSet.contains("this")) {
3652 // methodLattice.put("this");
3655 String methodLatticeDefStr = generateLatticeDefinition(md);
3656 String annoatedStr = methodLatticeDefStr + newline + sourceVec.get(methodDefLine);
3657 sourceVec.set(methodDefLine, annoatedStr);
3667 private boolean hasThisReference(MethodDescriptor md) {
3669 FlowGraph fg = getFlowGraph(md);
3670 Set<FlowNode> nodeSet = fg.getNodeSet();
3671 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
3672 FlowNode flowNode = (FlowNode) iterator.next();
3673 if (flowNode.getDescTuple().get(0).equals(md.getThis())) {
3681 private int getParamLocation(String methodStr, String paramStr) {
3683 String pattern = paramStr + ",";
3685 int idx = methodStr.indexOf(pattern);
3689 pattern = paramStr + ")";
3690 return methodStr.indexOf(pattern);
3695 private String generateVarDeclaration(VarDescriptor varDesc) {
3697 TypeDescriptor td = varDesc.getType();
3698 String rtr = td.toString();
3700 for (int i = 0; i < td.getArrayCount(); i++) {
3704 rtr += " " + varDesc.getName();
3709 private String generateLocationAnnoatation(CompositeLocation loc) {
3712 Location methodLoc = loc.get(0);
3713 rtr += methodLoc.getLocIdentifier();
3715 for (int i = 1; i < loc.getSize(); i++) {
3716 Location element = loc.get(i);
3717 rtr += "," + element.getDescriptor().getSymbol() + "." + element.getLocIdentifier();
3723 private boolean isParameter(MethodDescriptor md, Descriptor localVarDesc) {
3724 return getFlowGraph(md).isParamDesc(localVarDesc);
3727 private String extractFileName(String fileName) {
3728 int idx = fileName.lastIndexOf("/");
3732 return fileName.substring(idx + 1);
3737 private void codeGen() {
3739 Set<String> originalFileNameSet = mapFileNameToLineVector.keySet();
3740 for (Iterator iterator = originalFileNameSet.iterator(); iterator.hasNext();) {
3741 String orgFileName = (String) iterator.next();
3742 String outputFileName = extractFileName(orgFileName);
3744 Vector<String> sourceVec = mapFileNameToLineVector.get(orgFileName);
3748 FileWriter fileWriter = new FileWriter("./infer/" + outputFileName);
3749 BufferedWriter out = new BufferedWriter(fileWriter);
3751 for (int i = 0; i < sourceVec.size(); i++) {
3752 out.write(sourceVec.get(i));
3756 } catch (IOException e) {
3757 e.printStackTrace();
3764 private void checkLattices() {
3766 LinkedList<MethodDescriptor> descriptorListToAnalyze = ssjava.getSortedDescriptors();
3768 // current descriptors to visit in fixed-point interprocedural analysis,
3770 // dependency in the call graph
3771 methodDescriptorsToVisitStack.clear();
3773 // descriptorListToAnalyze.removeFirst();
3775 Set<MethodDescriptor> methodDescriptorToVistSet = new HashSet<MethodDescriptor>();
3776 methodDescriptorToVistSet.addAll(descriptorListToAnalyze);
3778 while (!descriptorListToAnalyze.isEmpty()) {
3779 MethodDescriptor md = descriptorListToAnalyze.removeFirst();
3780 checkLatticesOfVirtualMethods(md);
3785 private void debug_writeLatticeDotFile() {
3786 // generate lattice dot file
3790 while (!toAnalyzeIsEmpty()) {
3791 ClassDescriptor cd = toAnalyzeNext();
3793 setupToAnalazeMethod(cd);
3795 SSJavaLattice<String> classLattice = cd2lattice.get(cd);
3796 if (classLattice != null) {
3797 ssjava.writeLatticeDotFile(cd, null, classLattice);
3798 // debug_printDescriptorToLocNameMapping(cd);
3801 while (!toAnalyzeMethodIsEmpty()) {
3802 MethodDescriptor md = toAnalyzeMethodNext();
3803 SSJavaLattice<String> methodLattice = md2lattice.get(md);
3804 if (methodLattice != null) {
3805 ssjava.writeLatticeDotFile(cd, md, methodLattice);
3806 // debug_printDescriptorToLocNameMapping(md);
3813 private void debug_printDescriptorToLocNameMapping(Descriptor desc) {
3815 LocationInfo info = getLocationInfo(desc);
3816 System.out.println("## " + desc + " ##");
3817 System.out.println(info.getMapDescToInferLocation());
3818 LocationInfo locInfo = getLocationInfo(desc);
3819 System.out.println("mapping=" + locInfo.getMapLocSymbolToDescSet());
3820 System.out.println("###################");
3824 private void calculateExtraLocations() {
3826 // LinkedList<MethodDescriptor> methodDescList = ssjava.getSortedDescriptors();
3827 LinkedList<MethodDescriptor> methodDescList =
3828 (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
3829 for (Iterator iterator = methodDescList.iterator(); iterator.hasNext();) {
3830 MethodDescriptor md = (MethodDescriptor) iterator.next();
3831 if (!ssjava.getMethodContainingSSJavaLoop().equals(md)) {
3832 calculateExtraLocations(md);
3838 private void checkLatticesOfVirtualMethods(MethodDescriptor md) {
3840 if (!md.isStatic()) {
3841 Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
3842 setPossibleCallees.addAll(ssjava.getCallGraph().getMethods(md));
3844 for (Iterator iterator = setPossibleCallees.iterator(); iterator.hasNext();) {
3845 MethodDescriptor mdCallee = (MethodDescriptor) iterator.next();
3846 if (!md.equals(mdCallee)) {
3847 checkConsistency(md, mdCallee);
3855 private void checkConsistency(MethodDescriptor md1, MethodDescriptor md2) {
3857 // check that two lattice have the same relations between parameters(+PC
3858 // LOC, GLOBAL_LOC RETURN LOC)
3860 List<CompositeLocation> list1 = new ArrayList<CompositeLocation>();
3861 List<CompositeLocation> list2 = new ArrayList<CompositeLocation>();
3863 MethodLocationInfo locInfo1 = getMethodLocationInfo(md1);
3864 MethodLocationInfo locInfo2 = getMethodLocationInfo(md2);
3866 Map<Integer, CompositeLocation> paramMap1 = locInfo1.getMapParamIdxToInferLoc();
3867 Map<Integer, CompositeLocation> paramMap2 = locInfo2.getMapParamIdxToInferLoc();
3869 int numParam = locInfo1.getMapParamIdxToInferLoc().keySet().size();
3871 // add location types of paramters
3872 for (int idx = 0; idx < numParam; idx++) {
3873 list1.add(paramMap1.get(Integer.valueOf(idx)));
3874 list2.add(paramMap2.get(Integer.valueOf(idx)));
3877 // add program counter location
3878 list1.add(locInfo1.getPCLoc());
3879 list2.add(locInfo2.getPCLoc());
3881 if (!md1.getReturnType().isVoid()) {
3882 // add return value location
3883 CompositeLocation rtrLoc1 = getMethodLocationInfo(md1).getReturnLoc();
3884 CompositeLocation rtrLoc2 = getMethodLocationInfo(md2).getReturnLoc();
3889 // add global location type
3890 if (md1.isStatic()) {
3891 CompositeLocation globalLoc1 =
3892 new CompositeLocation(new Location(md1, locInfo1.getGlobalLocName()));
3893 CompositeLocation globalLoc2 =
3894 new CompositeLocation(new Location(md2, locInfo2.getGlobalLocName()));
3895 list1.add(globalLoc1);
3896 list2.add(globalLoc2);
3899 for (int i = 0; i < list1.size(); i++) {
3900 CompositeLocation locA1 = list1.get(i);
3901 CompositeLocation locA2 = list2.get(i);
3902 for (int k = 0; k < list1.size(); k++) {
3904 CompositeLocation locB1 = list1.get(k);
3905 CompositeLocation locB2 = list2.get(k);
3906 boolean r1 = isGreaterThan(getLattice(md1), locA1, locB1);
3908 boolean r2 = isGreaterThan(getLattice(md1), locA2, locB2);
3911 throw new Error("The method " + md1 + " is not consistent with the method " + md2
3912 + ".:: They have a different ordering relation between locations (" + locA1 + ","
3913 + locB1 + ") and (" + locA2 + "," + locB2 + ").");
3921 private String getSymbol(int idx, FlowNode node) {
3922 Descriptor desc = node.getDescTuple().get(idx);
3923 return desc.getSymbol();
3926 private Descriptor getDescriptor(int idx, FlowNode node) {
3927 Descriptor desc = node.getDescTuple().get(idx);
3931 private void calculatePCLOC(MethodDescriptor md) {
3933 // System.out.println("#CalculatePCLOC");
3934 MethodSummary methodSummary = getMethodSummary(md);
3935 FlowGraph fg = getFlowGraph(md);
3936 Map<Integer, CompositeLocation> mapParamToLoc = methodSummary.getMapParamIdxToInferLoc();
3938 // calculate the initial program counter location
3939 // PC location is higher than location types of parameters which has incoming flows.
3941 Set<NTuple<Location>> paramLocTupleHavingInFlowSet = new HashSet<NTuple<Location>>();
3942 Set<Descriptor> paramDescNOTHavingInFlowSet = new HashSet<Descriptor>();
3943 // Set<FlowNode> paramNodeNOThavingInFlowSet = new HashSet<FlowNode>();
3945 int numParams = fg.getNumParameters();
3946 for (int i = 0; i < numParams; i++) {
3947 FlowNode paramFlowNode = fg.getParamFlowNode(i);
3948 Descriptor prefix = paramFlowNode.getDescTuple().get(0);
3949 NTuple<Descriptor> paramDescTuple = paramFlowNode.getCurrentDescTuple();
3950 NTuple<Location> paramLocTuple = translateToLocTuple(md, paramDescTuple);
3952 Set<FlowNode> inNodeToParamSet = fg.getIncomingNodeSetByPrefix(prefix);
3953 if (inNodeToParamSet.size() > 0) {
3954 // parameter has in-value flows
3956 for (Iterator iterator = inNodeToParamSet.iterator(); iterator.hasNext();) {
3957 FlowNode inNode = (FlowNode) iterator.next();
3958 Set<FlowEdge> outEdgeSet = fg.getOutEdgeSet(inNode);
3959 for (Iterator iterator2 = outEdgeSet.iterator(); iterator2.hasNext();) {
3960 FlowEdge flowEdge = (FlowEdge) iterator2.next();
3961 if (flowEdge.getEndTuple().startsWith(prefix)) {
3962 NTuple<Location> paramLocTupleWithIncomingFlow =
3963 translateToLocTuple(md, flowEdge.getEndTuple());
3964 paramLocTupleHavingInFlowSet.add(paramLocTupleWithIncomingFlow);
3969 // paramLocTupleHavingInFlowSet.add(paramLocTuple);
3971 // paramNodeNOThavingInFlowSet.add(fg.getFlowNode(paramDescTuple));
3972 paramDescNOTHavingInFlowSet.add(prefix);
3976 // System.out.println("paramLocTupleHavingInFlowSet=" + paramLocTupleHavingInFlowSet);
3978 if (paramLocTupleHavingInFlowSet.size() > 0
3979 && !coversAllParamters(md, fg, paramLocTupleHavingInFlowSet)) {
3981 // Here, generates a location in the method lattice that is higher than the
3982 // paramLocTupleHavingInFlowSet
3983 NTuple<Location> pcLocTuple =
3984 generateLocTupleRelativeTo(md, paramLocTupleHavingInFlowSet, PCLOC);
3986 NTuple<Descriptor> pcDescTuple = translateToDescTuple(pcLocTuple);
3988 // System.out.println("pcLoc=" + pcLocTuple);
3990 CompositeLocation curPCLoc = methodSummary.getPCLoc();
3991 if (curPCLoc.get(0).isTop() || pcLocTuple.size() > curPCLoc.getSize()) {
3992 methodSummary.setPCLoc(new CompositeLocation(pcLocTuple));
3994 Set<FlowNode> flowNodeLowerthanPCLocSet = new HashSet<FlowNode>();
3995 GlobalFlowGraph subGlobalFlowGraph = getSubGlobalFlowGraph(md);
3996 // add ordering relations s.t. PCLOC is higher than all flow nodes except the set of
3997 // parameters that do not have incoming flows
3998 for (Iterator iterator = fg.getNodeSet().iterator(); iterator.hasNext();) {
3999 FlowNode node = (FlowNode) iterator.next();
4001 if (!(node instanceof FlowReturnNode)) {
4002 if (!paramDescNOTHavingInFlowSet.contains(node.getCurrentDescTuple().get(0))) {
4003 flowNodeLowerthanPCLocSet.add(node);
4004 fg.addValueFlowEdge(pcDescTuple, node.getDescTuple());
4006 subGlobalFlowGraph.addValueFlowEdge(pcLocTuple,
4007 translateToLocTuple(md, node.getDescTuple()));
4010 // System.out.println("***SKIP PCLOC -> RETURNLOC=" + node);
4014 fg.getFlowNode(translateToDescTuple(pcLocTuple)).setSkeleton(true);
4016 if (pcLocTuple.get(0).getLocDescriptor().equals(md.getThis())) {
4017 for (Iterator iterator = flowNodeLowerthanPCLocSet.iterator(); iterator.hasNext();) {
4018 FlowNode lowerNode = (FlowNode) iterator.next();
4019 if (lowerNode.getDescTuple().size() == 1 && lowerNode.getCompositeLocation() == null) {
4020 NTuple<Location> lowerLocTuple = translateToLocTuple(md, lowerNode.getDescTuple());
4021 CompositeLocation newComp =
4022 calculateCompositeLocationFromSubGlobalGraph(md, lowerNode);
4023 if (newComp != null) {
4024 subGlobalFlowGraph.addMapLocationToInferCompositeLocation(lowerLocTuple.get(0),
4026 lowerNode.setCompositeLocation(newComp);
4027 // System.out.println("NEW COMP LOC=" + newComp + " to lowerNode=" + lowerNode);
4040 private int countFirstDescriptorSetSize(Set<NTuple<Location>> set) {
4042 Set<Descriptor> descSet = new HashSet<Descriptor>();
4044 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
4045 NTuple<Location> locTuple = (NTuple<Location>) iterator.next();
4046 descSet.add(locTuple.get(0).getLocDescriptor());
4049 return descSet.size();
4052 private boolean coversAllParamters(MethodDescriptor md, FlowGraph fg,
4053 Set<NTuple<Location>> paramLocTupleHavingInFlowSet) {
4055 int numParam = fg.getNumParameters();
4056 // int size = paramLocTupleHavingInFlowSet.size();
4057 int size = countFirstDescriptorSetSize(paramLocTupleHavingInFlowSet);
4059 // System.out.println("numParam=" + numParam + " size=" + size);
4061 // if (!md.isStatic()) {
4063 // // if the method is not static && there is a parameter composite location &&
4064 // // it is started with 'this',
4065 // // paramLocTupleHavingInFlowSet need to have 'this' parameter.
4067 // FlowNode thisParamNode = fg.getParamFlowNode(0);
4068 // NTuple<Location> thisParamLocTuple =
4069 // translateToLocTuple(md, thisParamNode.getCurrentDescTuple());
4071 // if (!paramLocTupleHavingInFlowSet.contains(thisParamLocTuple)) {
4073 // for (Iterator iterator = paramLocTupleHavingInFlowSet.iterator(); iterator.hasNext();) {
4074 // NTuple<Location> paramTuple = (NTuple<Location>) iterator.next();
4075 // if (paramTuple.size() > 1 && paramTuple.get(0).getLocDescriptor().equals(md.getThis())) {
4076 // // paramLocTupleHavingInFlowSet.add(thisParamLocTuple);
4085 if (size == numParam) {
4093 private void calculateRETURNLOC(MethodDescriptor md) {
4095 // System.out.println("#calculateRETURNLOC= " + md);
4097 // calculate a return location:
4098 // the return location type is lower than all parameters and the location of return values
4099 MethodSummary methodSummary = getMethodSummary(md);
4100 // if (methodSummary.getRETURNLoc() != null) {
4101 // System.out.println("$HERE?");
4105 FlowGraph fg = getFlowGraph(md);
4106 Map<Integer, CompositeLocation> mapParamToLoc = methodSummary.getMapParamIdxToInferLoc();
4107 Set<Integer> paramIdxSet = mapParamToLoc.keySet();
4109 if (md.getReturnType() != null && !md.getReturnType().isVoid()) {
4110 // first, generate the set of return value location types that starts
4111 // with 'this' reference
4113 Set<FlowNode> paramFlowNodeFlowingToReturnValueSet = getParamNodeFlowingToReturnValue(md);
4114 // System.out.println("paramFlowNodeFlowingToReturnValueSet="
4115 // + paramFlowNodeFlowingToReturnValueSet);
4117 Set<NTuple<Location>> tupleToBeHigherThanReturnLocSet = new HashSet<NTuple<Location>>();
4118 for (Iterator iterator = paramFlowNodeFlowingToReturnValueSet.iterator(); iterator.hasNext();) {
4119 FlowNode fn = (FlowNode) iterator.next();
4120 NTuple<Descriptor> paramDescTuple = fn.getCurrentDescTuple();
4121 tupleToBeHigherThanReturnLocSet.add(translateToLocTuple(md, paramDescTuple));
4124 Set<FlowNode> returnNodeSet = fg.getReturnNodeSet();
4125 for (Iterator iterator = returnNodeSet.iterator(); iterator.hasNext();) {
4126 FlowNode returnNode = (FlowNode) iterator.next();
4127 NTuple<Descriptor> returnDescTuple = returnNode.getCurrentDescTuple();
4128 tupleToBeHigherThanReturnLocSet.add(translateToLocTuple(md, returnDescTuple));
4130 // System.out.println("-flow graph's returnNodeSet=" + returnNodeSet);
4131 // System.out.println("tupleSetToBeHigherThanReturnLoc=" + tupleToBeHigherThanReturnLocSet);
4133 // Here, generates a return location in the method lattice that is lower than the
4134 // locFlowingToReturnValueSet
4135 NTuple<Location> returnLocTuple =
4136 generateLocTupleRelativeTo(md, tupleToBeHigherThanReturnLocSet, RLOC);
4138 // System.out.println("returnLocTuple=" + returnLocTuple);
4139 NTuple<Descriptor> returnDescTuple = translateToDescTuple(returnLocTuple);
4140 CompositeLocation curReturnLoc = methodSummary.getRETURNLoc();
4141 if (curReturnLoc == null || returnDescTuple.size() > curReturnLoc.getSize()) {
4142 methodSummary.setRETURNLoc(new CompositeLocation(returnLocTuple));
4144 for (Iterator iterator = tupleToBeHigherThanReturnLocSet.iterator(); iterator.hasNext();) {
4145 NTuple<Location> higherTuple = (NTuple<Location>) iterator.next();
4146 fg.addValueFlowEdge(translateToDescTuple(higherTuple), returnDescTuple);
4148 fg.getFlowNode(returnDescTuple).setSkeleton(true);
4152 // makes sure that PCLOC is higher than RETURNLOC
4153 CompositeLocation pcLoc = methodSummary.getPCLoc();
4154 if (!pcLoc.get(0).isTop()) {
4155 NTuple<Descriptor> pcLocDescTuple = translateToDescTuple(pcLoc.getTuple());
4156 fg.addValueFlowEdge(pcLocDescTuple, returnDescTuple);
4163 private void calculateExtraLocations(MethodDescriptor md) {
4164 // calcualte pcloc, returnloc,...
4166 System.out.println("\nSSJAVA:Calculate PCLOC/RETURNLOC locations: " + md);
4169 calculateRETURNLOC(md);
4173 private NTuple<Location> generateLocTupleRelativeTo(MethodDescriptor md,
4174 Set<NTuple<Location>> paramLocTupleHavingInFlowSet, String locNamePrefix) {
4176 // System.out.println("-generateLocTupleRelativeTo=" + paramLocTupleHavingInFlowSet);
4178 NTuple<Location> higherLocTuple = new NTuple<Location>();
4180 VarDescriptor thisVarDesc = md.getThis();
4181 // check if all paramter loc tuple is started with 'this' reference
4182 boolean hasParamNotStartedWithThisRef = false;
4186 Set<NTuple<Location>> paramLocTupleStartedWithThis = new HashSet<NTuple<Location>>();
4188 next: for (Iterator iterator = paramLocTupleHavingInFlowSet.iterator(); iterator.hasNext();) {
4189 NTuple<Location> paramLocTuple = (NTuple<Location>) iterator.next();
4190 Descriptor paramLocalDesc = paramLocTuple.get(0).getLocDescriptor();
4191 if (!paramLocalDesc.equals(thisVarDesc)) {
4193 Set<FlowNode> inNodeSet = getFlowGraph(md).getIncomingNodeSetByPrefix(paramLocalDesc);
4194 for (Iterator iterator2 = inNodeSet.iterator(); iterator2.hasNext();) {
4195 FlowNode flowNode = (FlowNode) iterator2.next();
4196 if (flowNode.getDescTuple().startsWith(thisVarDesc)) {
4197 // System.out.println("paramLocTuple=" + paramLocTuple + " is lower than THIS");
4201 hasParamNotStartedWithThisRef = true;
4203 } else if (paramLocTuple.size() > 1) {
4204 paramLocTupleStartedWithThis.add(paramLocTuple);
4205 if (minSize == 0 || minSize > paramLocTuple.size()) {
4206 minSize = paramLocTuple.size();
4211 // System.out.println("---paramLocTupleStartedWithThis=" + paramLocTupleStartedWithThis);
4212 Descriptor enclosingDesc = md;
4213 if (hasParamNotStartedWithThisRef) {
4214 // in this case, PCLOC will be the local location
4216 // all parameter is started with 'this', so PCLOC will be set relative to the composite
4217 // location started with 'this'.
4218 // for (int idx = 0; idx < minSize - 1; idx++) {
4219 for (int idx = 0; idx < 1; idx++) {
4220 Set<Descriptor> locDescSet = new HashSet<Descriptor>();
4221 Location curLoc = null;
4222 NTuple<Location> paramLocTuple = null;
4223 for (Iterator iterator = paramLocTupleStartedWithThis.iterator(); iterator.hasNext();) {
4224 paramLocTuple = (NTuple<Location>) iterator.next();
4225 // System.out.println("-----paramLocTuple=" + paramLocTuple + " idx=" + idx);
4226 curLoc = paramLocTuple.get(idx);
4227 Descriptor locDesc = curLoc.getLocDescriptor();
4228 locDescSet.add(locDesc);
4230 // System.out.println("-----locDescSet=" + locDescSet + " idx=" + idx);
4231 if (locDescSet.size() != 1) {
4234 Location newLocElement = new Location(curLoc.getDescriptor(), curLoc.getLocDescriptor());
4235 // System.out.println("newLocElement" + newLocElement);
4236 higherLocTuple.add(newLocElement);
4237 enclosingDesc = getClassTypeDescriptor(curLoc.getLocDescriptor());
4242 String locIdentifier = locNamePrefix + (locSeed++);
4243 NameDescriptor locDesc = new NameDescriptor(locIdentifier);
4244 Location newLoc = new Location(enclosingDesc, locDesc);
4245 higherLocTuple.add(newLoc);
4246 // System.out.println("---new loc tuple=" + higherLocTuple);
4248 return higherLocTuple;
4252 public ClassDescriptor getClassTypeDescriptor(Descriptor in) {
4254 if (in instanceof VarDescriptor) {
4255 return ((VarDescriptor) in).getType().getClassDesc();
4256 } else if (in instanceof FieldDescriptor) {
4257 return ((FieldDescriptor) in).getType().getClassDesc();
4259 // else if (in instanceof LocationDescriptor) {
4260 // // here is the case that the descriptor 'in' is the last element of the assigned composite
4262 // return ((VarDescriptor) locTuple.get(0).getLocDescriptor()).getType().getClassDesc();
4270 private Set<NTuple<Location>> calculateHighestLocTupleSet(
4271 Set<NTuple<Location>> paramLocTupleHavingInFlowSet) {
4273 Set<NTuple<Location>> highestSet = new HashSet<NTuple<Location>>();
4275 Iterator<NTuple<Location>> iterator = paramLocTupleHavingInFlowSet.iterator();
4276 NTuple<Location> highest = iterator.next();
4278 for (; iterator.hasNext();) {
4279 NTuple<Location> curLocTuple = (NTuple<Location>) iterator.next();
4280 if (isHigherThan(curLocTuple, highest)) {
4281 // System.out.println(curLocTuple + " is greater than " + highest);
4282 highest = curLocTuple;
4286 highestSet.add(highest);
4288 MethodDescriptor md = (MethodDescriptor) highest.get(0).getDescriptor();
4289 VarDescriptor thisVarDesc = md.getThis();
4291 // System.out.println("highest=" + highest);
4293 for (Iterator<NTuple<Location>> iter = paramLocTupleHavingInFlowSet.iterator(); iter.hasNext();) {
4294 NTuple<Location> curLocTuple = iter.next();
4296 if (!curLocTuple.equals(highest) && !hasOrderingRelation(highest, curLocTuple)) {
4298 // System.out.println("add it to the highest set=" + curLocTuple);
4299 highestSet.add(curLocTuple);
4308 private Set<String> getHigherLocSymbolThan(SSJavaLattice<String> lattice, String loc) {
4309 Set<String> higherLocSet = new HashSet<String>();
4311 Set<String> locSet = lattice.getTable().keySet();
4312 for (Iterator iterator = locSet.iterator(); iterator.hasNext();) {
4313 String element = (String) iterator.next();
4314 if (lattice.isGreaterThan(element, loc) && (!element.equals(lattice.getTopItem()))) {
4315 higherLocSet.add(element);
4318 return higherLocSet;
4321 private CompositeLocation getLowest(SSJavaLattice<String> methodLattice,
4322 Set<CompositeLocation> set) {
4324 CompositeLocation lowest = set.iterator().next();
4326 if (set.size() == 1) {
4330 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
4331 CompositeLocation loc = (CompositeLocation) iterator.next();
4333 if ((!loc.equals(lowest)) && (!isComparable(methodLattice, lowest, loc))) {
4334 // if there is a case where composite locations are incomparable, just
4339 if ((!loc.equals(lowest)) && isGreaterThan(methodLattice, lowest, loc)) {
4346 private boolean isComparable(SSJavaLattice<String> methodLattice, CompositeLocation comp1,
4347 CompositeLocation comp2) {
4349 int size = comp1.getSize() >= comp2.getSize() ? comp2.getSize() : comp1.getSize();
4351 for (int idx = 0; idx < size; idx++) {
4352 Location loc1 = comp1.get(idx);
4353 Location loc2 = comp2.get(idx);
4355 Descriptor desc1 = loc1.getDescriptor();
4356 Descriptor desc2 = loc2.getDescriptor();
4358 if (!desc1.equals(desc2)) {
4359 throw new Error("Fail to compare " + comp1 + " and " + comp2);
4362 String symbol1 = loc1.getLocIdentifier();
4363 String symbol2 = loc2.getLocIdentifier();
4365 SSJavaLattice<String> lattice;
4367 lattice = methodLattice;
4369 lattice = getLattice(desc1);
4372 if (symbol1.equals(symbol2)) {
4374 } else if (!lattice.isComparable(symbol1, symbol2)) {
4383 private boolean isGreaterThan(SSJavaLattice<String> methodLattice, CompositeLocation comp1,
4384 CompositeLocation comp2) {
4386 int size = comp1.getSize() >= comp2.getSize() ? comp2.getSize() : comp1.getSize();
4388 for (int idx = 0; idx < size; idx++) {
4389 Location loc1 = comp1.get(idx);
4390 Location loc2 = comp2.get(idx);
4392 Descriptor desc1 = loc1.getDescriptor();
4393 Descriptor desc2 = loc2.getDescriptor();
4395 if (!desc1.equals(desc2)) {
4396 throw new Error("Fail to compare " + comp1 + " and " + comp2);
4399 String symbol1 = loc1.getLocIdentifier();
4400 String symbol2 = loc2.getLocIdentifier();
4402 SSJavaLattice<String> lattice;
4404 lattice = methodLattice;
4406 lattice = getLattice(desc1);
4409 if (symbol1.equals(symbol2)) {
4411 } else if (lattice.isGreaterThan(symbol1, symbol2)) {
4422 private GlobalFlowGraph getSubGlobalFlowGraph(MethodDescriptor md) {
4424 if (!mapMethodDescriptorToSubGlobalFlowGraph.containsKey(md)) {
4425 mapMethodDescriptorToSubGlobalFlowGraph.put(md, new GlobalFlowGraph(md));
4427 return mapMethodDescriptorToSubGlobalFlowGraph.get(md);
4430 private void propagateFlowsToCallerWithNoCompositeLocation(MethodInvokeNode min,
4431 MethodDescriptor mdCaller, MethodDescriptor mdCallee) {
4433 // System.out.println("-propagateFlowsToCallerWithNoCompositeLocation=" + min.printNode(0));
4434 // if the parameter A reaches to the parameter B
4435 // then, add an edge the argument A -> the argument B to the caller's flow
4438 FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
4439 FlowGraph callerFlowGraph = getFlowGraph(mdCaller);
4440 int numParam = calleeFlowGraph.getNumParameters();
4442 for (int i = 0; i < numParam; i++) {
4443 for (int k = 0; k < numParam; k++) {
4447 FlowNode paramNode1 = calleeFlowGraph.getParamFlowNode(i);
4448 FlowNode paramNode2 = calleeFlowGraph.getParamFlowNode(k);
4450 NTuple<Descriptor> arg1Tuple = getNodeTupleByArgIdx(min, i);
4451 NTuple<Descriptor> arg2Tuple = getNodeTupleByArgIdx(min, k);
4453 // check if the callee propagates an ordering constraints through
4456 // Set<FlowNode> localReachSet = calleeFlowGraph.getLocalReachFlowNodeSetFrom(paramNode1);
4457 Set<FlowNode> localReachSet =
4458 calleeFlowGraph.getReachableSetFrom(paramNode1.getDescTuple());
4460 NTuple<Descriptor> paramDescTuple1 = paramNode1.getCurrentDescTuple();
4461 NTuple<Descriptor> paramDescTuple2 = paramNode2.getCurrentDescTuple();
4463 // System.out.println("-param1CurTuple=" + paramDescTuple1 + " param2CurTuple="
4464 // + paramDescTuple2);
4465 // System.out.println("-- localReachSet from param1=" + localReachSet);
4467 if (paramDescTuple1.get(0).equals(paramDescTuple2.get(0))) {
4468 // if two parameters share the same prefix
4469 // it already has been assigned to a composite location
4470 // so we don't need to add an additional ordering relation caused by these two
4475 if (arg1Tuple.size() > 0 && arg2Tuple.size() > 0
4476 && containsPrefix(paramNode2.getDescTuple().get(0), localReachSet)) {
4477 // need to propagate an ordering relation s.t. arg1 is higher
4479 // System.out.println("-param1=" + paramNode1 + " is higher than param2=" + paramNode2);
4481 // add a new flow between the corresponding arguments.
4482 callerFlowGraph.addValueFlowEdge(arg1Tuple, arg2Tuple);
4483 // System.out.println("arg1=" + arg1Tuple + " arg2=" + arg2Tuple);
4486 // .println("-arg1Tuple=" + arg1Tuple + " is higher than arg2Tuple=" + arg2Tuple);
4490 // System.out.println();
4495 // if a parameter has a composite location and the first element of the parameter location
4496 // matches the callee's 'this'
4497 // we have a more specific constraint: the caller's corresponding argument is higher than the
4498 // parameter location which is translated into the caller
4500 for (int idx = 0; idx < numParam; idx++) {
4501 FlowNode paramNode = calleeFlowGraph.getParamFlowNode(idx);
4502 CompositeLocation compLoc = paramNode.getCompositeLocation();
4503 // System.out.println("paramNode=" + paramNode + " compLoc=" + compLoc);
4504 if (compLoc != null && compLoc.get(0).getLocDescriptor().equals(min.getMethod().getThis())) {
4505 // System.out.println("$$$COMPLOC CASE=" + compLoc + " idx=" + idx);
4507 NTuple<Descriptor> argTuple = getNodeTupleByArgIdx(min, idx);
4508 // System.out.println("--- argTuple=" + argTuple + " current compLoc="
4509 // + callerFlowGraph.getFlowNode(argTuple).getCompositeLocation());
4511 NTuple<Descriptor> translatedParamTuple =
4512 translateCompositeLocationToCaller(idx, min, compLoc);
4513 // System.out.println("add a flow edge= " + argTuple + "->" + translatedParamTuple);
4514 callerFlowGraph.addValueFlowEdge(argTuple, translatedParamTuple);
4516 Set<NTuple<Location>> pcLocTupleSet = getPCLocTupleSet(min);
4517 for (Iterator iterator = pcLocTupleSet.iterator(); iterator.hasNext();) {
4518 NTuple<Location> pcLocTuple = (NTuple<Location>) iterator.next();
4519 callerFlowGraph.addValueFlowEdge(translateToDescTuple(pcLocTuple), translatedParamTuple);
4527 private boolean containsPrefix(Descriptor prefixDesc, Set<FlowNode> set) {
4529 for (Iterator iterator = set.iterator(); iterator.hasNext();) {
4530 FlowNode flowNode = (FlowNode) iterator.next();
4531 if (flowNode.getDescTuple().startsWith(prefixDesc)) {
4532 // System.out.println("FOUND=" + flowNode);
4539 private NTuple<Descriptor> translateCompositeLocationToCaller(int idx, MethodInvokeNode min,
4540 CompositeLocation compLocForParam1) {
4542 NTuple<Descriptor> baseTuple = mapMethodInvokeNodeToBaseTuple.get(min);
4544 NTuple<Descriptor> tuple = new NTuple<Descriptor>();
4545 for (int i = 0; i < baseTuple.size(); i++) {
4546 tuple.add(baseTuple.get(i));
4549 for (int i = 1; i < compLocForParam1.getSize(); i++) {
4550 Location loc = compLocForParam1.get(i);
4551 tuple.add(loc.getLocDescriptor());
4557 private CompositeLocation generateCompositeLocation(NTuple<Location> prefixLocTuple) {
4559 // System.out.println("generateCompositeLocation=" + prefixLocTuple);
4561 CompositeLocation newCompLoc = new CompositeLocation();
4562 for (int i = 0; i < prefixLocTuple.size(); i++) {
4563 newCompLoc.addLocation(prefixLocTuple.get(i));
4566 Descriptor lastDescOfPrefix = prefixLocTuple.get(prefixLocTuple.size() - 1).getLocDescriptor();
4568 ClassDescriptor enclosingDescriptor;
4569 if (lastDescOfPrefix instanceof FieldDescriptor) {
4570 enclosingDescriptor = ((FieldDescriptor) lastDescOfPrefix).getType().getClassDesc();
4571 // System.out.println("enclosingDescriptor0=" + enclosingDescriptor);
4572 } else if (lastDescOfPrefix.equals(GLOBALDESC)) {
4573 MethodDescriptor currentMethodDesc = (MethodDescriptor) prefixLocTuple.get(0).getDescriptor();
4574 enclosingDescriptor = currentMethodDesc.getClassDesc();
4576 // var descriptor case
4577 enclosingDescriptor = ((VarDescriptor) lastDescOfPrefix).getType().getClassDesc();
4579 // System.out.println("enclosingDescriptor=" + enclosingDescriptor);
4581 LocationDescriptor newLocDescriptor = generateNewLocationDescriptor();
4582 newLocDescriptor.setEnclosingClassDesc(enclosingDescriptor);
4584 Location newLoc = new Location(enclosingDescriptor, newLocDescriptor.getSymbol());
4585 newLoc.setLocDescriptor(newLocDescriptor);
4586 newCompLoc.addLocation(newLoc);
4588 // System.out.println("--newCompLoc=" + newCompLoc);
4592 private CompositeLocation generateCompositeLocation(MethodDescriptor md,
4593 NTuple<Descriptor> paramPrefix) {
4595 // System.out.println("generateCompositeLocation=" + paramPrefix);
4597 CompositeLocation newCompLoc = convertToCompositeLocation(md, paramPrefix);
4599 Descriptor lastDescOfPrefix = paramPrefix.get(paramPrefix.size() - 1);
4600 // System.out.println("lastDescOfPrefix=" + lastDescOfPrefix + " kind="
4601 // + lastDescOfPrefix.getClass());
4602 ClassDescriptor enclosingDescriptor;
4603 if (lastDescOfPrefix instanceof FieldDescriptor) {
4604 enclosingDescriptor = ((FieldDescriptor) lastDescOfPrefix).getType().getClassDesc();
4605 // System.out.println("enclosingDescriptor0=" + enclosingDescriptor);
4607 // var descriptor case
4608 enclosingDescriptor = ((VarDescriptor) lastDescOfPrefix).getType().getClassDesc();
4610 // System.out.println("enclosingDescriptor=" + enclosingDescriptor);
4612 LocationDescriptor newLocDescriptor = generateNewLocationDescriptor();
4613 newLocDescriptor.setEnclosingClassDesc(enclosingDescriptor);
4615 Location newLoc = new Location(enclosingDescriptor, newLocDescriptor.getSymbol());
4616 newLoc.setLocDescriptor(newLocDescriptor);
4617 newCompLoc.addLocation(newLoc);
4619 // System.out.println("--newCompLoc=" + newCompLoc);
4623 private List<NTuple<Descriptor>> translatePrefixListToCallee(Descriptor baseRef,
4624 MethodDescriptor mdCallee, List<NTuple<Descriptor>> callerPrefixList) {
4626 List<NTuple<Descriptor>> calleePrefixList = new ArrayList<NTuple<Descriptor>>();
4628 for (int i = 0; i < callerPrefixList.size(); i++) {
4629 NTuple<Descriptor> prefix = callerPrefixList.get(i);
4630 if (prefix.startsWith(baseRef)) {
4631 NTuple<Descriptor> calleePrefix = new NTuple<Descriptor>();
4632 calleePrefix.add(mdCallee.getThis());
4633 for (int k = 1; k < prefix.size(); k++) {
4634 calleePrefix.add(prefix.get(k));
4636 calleePrefixList.add(calleePrefix);
4640 return calleePrefixList;
4644 public CompositeLocation convertToCompositeLocation(MethodDescriptor md, NTuple<Descriptor> tuple) {
4646 CompositeLocation compLoc = new CompositeLocation();
4648 Descriptor enclosingDescriptor = md;
4650 for (int i = 0; i < tuple.size(); i++) {
4651 Descriptor curDescriptor = tuple.get(i);
4652 Location locElement = new Location(enclosingDescriptor, curDescriptor.getSymbol());
4653 locElement.setLocDescriptor(curDescriptor);
4654 compLoc.addLocation(locElement);
4656 if (curDescriptor instanceof VarDescriptor) {
4657 enclosingDescriptor = md.getClassDesc();
4658 } else if (curDescriptor instanceof FieldDescriptor) {
4659 enclosingDescriptor = ((FieldDescriptor) curDescriptor).getClassDescriptor();
4660 } else if (curDescriptor instanceof NameDescriptor) {
4661 // it is "GLOBAL LOC" case!
4662 enclosingDescriptor = GLOBALDESC;
4663 } else if (curDescriptor instanceof InterDescriptor) {
4664 enclosingDescriptor = getFlowGraph(md).getEnclosingDescriptor(curDescriptor);
4666 enclosingDescriptor = null;
4674 private LocationDescriptor generateNewLocationDescriptor() {
4675 return new LocationDescriptor("Loc" + (locSeed++));
4678 private int getPrefixIndex(NTuple<Descriptor> tuple1, NTuple<Descriptor> tuple2) {
4680 // return the index where the prefix shared by tuple1 and tuple2 is ended
4681 // if there is no prefix shared by both of them, return -1
4683 int minSize = tuple1.size();
4684 if (minSize > tuple2.size()) {
4685 minSize = tuple2.size();
4689 for (int i = 0; i < minSize; i++) {
4690 if (!tuple1.get(i).equals(tuple2.get(i))) {
4700 private CompositeLocation generateInferredCompositeLocation(MethodLocationInfo methodInfo,
4701 NTuple<Location> tuple) {
4703 // first, retrieve inferred location by the local var descriptor
4704 CompositeLocation inferLoc = new CompositeLocation();
4706 CompositeLocation localVarInferLoc =
4707 methodInfo.getInferLocation(tuple.get(0).getLocDescriptor());
4709 localVarInferLoc.get(0).setLocDescriptor(tuple.get(0).getLocDescriptor());
4711 for (int i = 0; i < localVarInferLoc.getSize(); i++) {
4712 inferLoc.addLocation(localVarInferLoc.get(i));
4715 for (int i = 1; i < tuple.size(); i++) {
4716 Location cur = tuple.get(i);
4717 Descriptor enclosingDesc = cur.getDescriptor();
4718 Descriptor curDesc = cur.getLocDescriptor();
4720 Location inferLocElement;
4721 if (curDesc == null) {
4722 // in this case, we have a newly generated location.
4723 inferLocElement = new Location(enclosingDesc, cur.getLocIdentifier());
4725 String fieldLocSymbol =
4726 getLocationInfo(enclosingDesc).getInferLocation(curDesc).get(0).getLocIdentifier();
4727 inferLocElement = new Location(enclosingDesc, fieldLocSymbol);
4728 inferLocElement.setLocDescriptor(curDesc);
4731 inferLoc.addLocation(inferLocElement);
4735 assert (inferLoc.get(0).getLocDescriptor().getSymbol() == inferLoc.get(0).getLocIdentifier());
4739 public LocationInfo getLocationInfo(Descriptor d) {
4740 if (d instanceof MethodDescriptor) {
4741 return getMethodLocationInfo((MethodDescriptor) d);
4743 return getFieldLocationInfo((ClassDescriptor) d);
4747 private MethodLocationInfo getMethodLocationInfo(MethodDescriptor md) {
4749 if (!mapMethodDescToMethodLocationInfo.containsKey(md)) {
4750 mapMethodDescToMethodLocationInfo.put(md, new MethodLocationInfo(md));
4753 return mapMethodDescToMethodLocationInfo.get(md);
4757 private LocationInfo getFieldLocationInfo(ClassDescriptor cd) {
4759 if (!mapClassToLocationInfo.containsKey(cd)) {
4760 mapClassToLocationInfo.put(cd, new LocationInfo(cd));
4763 return mapClassToLocationInfo.get(cd);
4767 private void addPrefixMapping(Map<NTuple<Location>, Set<NTuple<Location>>> map,
4768 NTuple<Location> prefix, NTuple<Location> element) {
4770 if (!map.containsKey(prefix)) {
4771 map.put(prefix, new HashSet<NTuple<Location>>());
4773 map.get(prefix).add(element);
4776 private boolean containsNonPrimitiveElement(Set<Descriptor> descSet) {
4777 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
4778 Descriptor desc = (Descriptor) iterator.next();
4780 if (desc.equals(LocationInference.GLOBALDESC)) {
4782 } else if (desc instanceof VarDescriptor) {
4783 if (!((VarDescriptor) desc).getType().isPrimitive()) {
4786 } else if (desc instanceof FieldDescriptor) {
4787 if (!((FieldDescriptor) desc).getType().isPrimitive()) {
4796 public SSJavaLattice<String> getLattice(Descriptor d) {
4797 if (d instanceof MethodDescriptor) {
4798 return getMethodLattice((MethodDescriptor) d);
4800 return getFieldLattice((ClassDescriptor) d);
4804 private SSJavaLattice<String> getMethodLattice(MethodDescriptor md) {
4805 if (!md2lattice.containsKey(md)) {
4806 md2lattice.put(md, new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM));
4808 return md2lattice.get(md);
4811 private void setMethodLattice(MethodDescriptor md, SSJavaLattice<String> lattice) {
4812 md2lattice.put(md, lattice);
4815 private void extractFlowsBetweenFields(ClassDescriptor cd, FlowNode srcNode, FlowNode dstNode,
4818 NTuple<Descriptor> srcCurTuple = srcNode.getCurrentDescTuple();
4819 NTuple<Descriptor> dstCurTuple = dstNode.getCurrentDescTuple();
4821 if (srcCurTuple.get(idx).equals(dstCurTuple.get(idx)) && srcCurTuple.size() > (idx + 1)
4822 && dstCurTuple.size() > (idx + 1)) {
4823 // value flow between fields: we don't need to add a binary relation
4826 Descriptor desc = srcCurTuple.get(idx);
4827 ClassDescriptor classDesc;
4830 classDesc = ((VarDescriptor) desc).getType().getClassDesc();
4832 if (desc instanceof FieldDescriptor) {
4833 classDesc = ((FieldDescriptor) desc).getType().getClassDesc();
4835 // this case is that the local variable has a composite location assignment
4836 // the following element after the composite location to the local variable
4837 // has the enclosing descriptor of the local variable
4838 Descriptor localDesc = srcNode.getDescTuple().get(0);
4839 classDesc = ((VarDescriptor) localDesc).getType().getClassDesc();
4842 extractFlowsBetweenFields(classDesc, srcNode, dstNode, idx + 1);
4846 Descriptor srcFieldDesc = srcCurTuple.get(idx);
4847 Descriptor dstFieldDesc = dstCurTuple.get(idx);
4849 // System.out.println("srcFieldDesc=" + srcFieldDesc + " dstFieldDesc=" + dstFieldDesc
4850 // + " idx=" + idx);
4851 if (!srcFieldDesc.equals(dstFieldDesc)) {
4853 // System.out.println("-ADD EDGE");
4854 getHierarchyGraph(cd).addEdge(srcFieldDesc, dstFieldDesc);
4855 } else if (!isReference(srcFieldDesc) && !isReference(dstFieldDesc)) {
4856 // System.out.println("-ADD EDGE");
4857 getHierarchyGraph(cd).addEdge(srcFieldDesc, dstFieldDesc);
4864 public SSJavaLattice<String> getFieldLattice(ClassDescriptor cd) {
4865 if (!cd2lattice.containsKey(cd)) {
4866 cd2lattice.put(cd, new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM));
4868 return cd2lattice.get(cd);
4871 public LinkedList<MethodDescriptor> computeMethodList() {
4873 Set<MethodDescriptor> toSort = new HashSet<MethodDescriptor>();
4877 Set<MethodDescriptor> visited = new HashSet<MethodDescriptor>();
4878 Set<MethodDescriptor> reachableCallee = new HashSet<MethodDescriptor>();
4880 while (!toAnalyzeIsEmpty()) {
4881 ClassDescriptor cd = toAnalyzeNext();
4883 if (cd.getClassName().equals("Object")) {
4884 rootClassDescriptor = cd;
4885 // inheritanceTree = new InheritanceTree<ClassDescriptor>(cd);
4888 setupToAnalazeMethod(cd);
4889 temp_toanalyzeMethodList.removeAll(visited);
4891 while (!toAnalyzeMethodIsEmpty()) {
4892 MethodDescriptor md = toAnalyzeMethodNext();
4893 if ((!visited.contains(md))
4894 && (ssjava.needTobeAnnotated(md) || reachableCallee.contains(md))) {
4896 // creates a mapping from a method descriptor to virtual methods
4897 Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
4898 if (md.isStatic()) {
4899 setPossibleCallees.add(md);
4901 setPossibleCallees.addAll(ssjava.getCallGraph().getMethods(md));
4904 Set<MethodDescriptor> calleeSet = ssjava.getCallGraph().getCalleeSet(md);
4905 Set<MethodDescriptor> needToAnalyzeCalleeSet = new HashSet<MethodDescriptor>();
4907 for (Iterator iterator = calleeSet.iterator(); iterator.hasNext();) {
4908 MethodDescriptor calleemd = (MethodDescriptor) iterator.next();
4909 if ((!ssjava.isTrustMethod(calleemd))
4910 && (!ssjava.isSSJavaUtil(calleemd.getClassDesc()))
4911 && (!calleemd.getModifiers().isNative())) {
4912 if (!visited.contains(calleemd)) {
4913 temp_toanalyzeMethodList.add(calleemd);
4915 reachableCallee.add(calleemd);
4916 needToAnalyzeCalleeSet.add(calleemd);
4920 mapMethodToCalleeSet.put(md, needToAnalyzeCalleeSet);
4929 return ssjava.topologicalSort(toSort);
4933 public boolean isTransitivelyCalledFrom(MethodDescriptor callee, MethodDescriptor caller) {
4934 // if the callee is transitively invoked from the caller
4937 int callerIdx = toanalyze_methodDescList.indexOf(caller);
4938 int calleeIdx = toanalyze_methodDescList.indexOf(callee);
4940 if (callerIdx < calleeIdx) {
4948 public void constructFlowGraph() {
4950 System.out.println("");
4951 toanalyze_methodDescList = computeMethodList();
4953 // hack... it seems that there is a problem with topological sorting.
4954 // so String.toString(Object o) is appeared too higher in the call chain.
4955 MethodDescriptor mdToString1 = null;
4956 MethodDescriptor mdToString2 = null;
4957 for (Iterator iterator = toanalyze_methodDescList.iterator(); iterator.hasNext();) {
4958 MethodDescriptor md = (MethodDescriptor) iterator.next();
4959 if (md.toString().equals("public static String String.valueOf(Object o)")) {
4962 if (md.toString().equals("public String Object.toString()")) {
4967 if (mdToString1 != null) {
4968 toanalyze_methodDescList.remove(mdToString1);
4969 toanalyze_methodDescList.addLast(mdToString1);
4971 if (mdToString2 != null) {
4972 toanalyze_methodDescList.remove(mdToString2);
4973 toanalyze_methodDescList.addLast(mdToString2);
4976 LinkedList<MethodDescriptor> methodDescList =
4977 (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
4979 // System.out.println("@@@methodDescList=" + methodDescList);
4982 while (!methodDescList.isEmpty()) {
4983 MethodDescriptor md = methodDescList.removeLast();
4984 if (state.SSJAVADEBUG) {
4985 System.out.println();
4986 System.out.println("SSJAVA: Constructing a flow graph: " + md);
4988 // creates a mapping from a parameter descriptor to its index
4989 Map<Descriptor, Integer> mapParamDescToIdx = new HashMap<Descriptor, Integer>();
4991 if (!md.isStatic()) {
4993 mapParamDescToIdx.put(md.getThis(), 0);
4996 for (int i = 0; i < md.numParameters(); i++) {
4997 Descriptor paramDesc = (Descriptor) md.getParameter(i);
4998 mapParamDescToIdx.put(paramDesc, new Integer(i + offset));
5001 FlowGraph fg = new FlowGraph(md, mapParamDescToIdx);
5002 mapMethodDescriptorToFlowGraph.put(md, fg);
5004 analyzeMethodBody(md.getClassDesc(), md);
5006 // System.out.println("##constructSubGlobalFlowGraph");
5007 // GlobalFlowGraph subGlobalFlowGraph = constructSubGlobalFlowGraph(fg);
5008 // mapMethodDescriptorToSubGlobalFlowGraph.put(md, subGlobalFlowGraph);
5011 // System.out.println("##addValueFlowsFromCalleeSubGlobalFlowGraph");
5012 // addValueFlowsFromCalleeSubGlobalFlowGraph(md, subGlobalFlowGraph);
5013 // subGlobalFlowGraph.writeGraph("_SUBGLOBAL");
5015 // propagateFlowsFromCalleesWithNoCompositeLocation(md);
5018 // _debug_printGraph();
5022 private void constructGlobalFlowGraph() {
5023 LinkedList<MethodDescriptor> methodDescList =
5024 (LinkedList<MethodDescriptor>) toanalyze_methodDescList.clone();
5026 while (!methodDescList.isEmpty()) {
5027 MethodDescriptor md = methodDescList.removeLast();
5028 if (state.SSJAVADEBUG) {
5029 System.out.println();
5030 System.out.println("SSJAVA: Constructing a sub global flow graph: " + md);
5032 constructSubGlobalFlowGraph(getFlowGraph(md));
5035 // System.out.println("-add Value Flows From CalleeSubGlobalFlowGraph");
5036 addValueFlowsFromCalleeSubGlobalFlowGraph(md);
5037 // subGlobalFlowGraph.writeGraph("_SUBGLOBAL");
5039 // System.out.println("-propagate Flows From Callees With No CompositeLocation");
5040 // propagateFlowsFromCalleesWithNoCompositeLocation(md);
5042 // mark if a parameter has incoming flows
5043 checkParamNodesInSubGlobalFlowGraph(md);
5049 private void checkParamNodesInSubGlobalFlowGraph(MethodDescriptor md) {
5050 GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
5051 FlowGraph flowGraph = getFlowGraph(md);
5053 Set<FlowNode> paramFlowNodeSet = flowGraph.getParamFlowNodeSet();
5054 for (Iterator iterator = paramFlowNodeSet.iterator(); iterator.hasNext();) {
5055 FlowNode paramFlowNode = (FlowNode) iterator.next();
5056 // System.out.println("paramFlowNode=" + paramFlowNode);
5057 NTuple<Descriptor> paramDescTuple = paramFlowNode.getDescTuple();
5058 NTuple<Location> paramLocTuple = translateToLocTuple(md, paramDescTuple);
5059 GlobalFlowNode paramGlobalNode = globalFlowGraph.getFlowNode(paramLocTuple);
5061 Set<GlobalFlowNode> incomingNodeSet =
5062 globalFlowGraph.getIncomingNodeSetByPrefix(paramLocTuple.get(0));
5064 if (incomingNodeSet.size() > 0) {
5065 paramGlobalNode.setParamNodeWithIncomingFlows(true);
5071 private Set<MethodInvokeNode> getMethodInvokeNodeSet(MethodDescriptor md) {
5072 if (!mapMethodDescriptorToMethodInvokeNodeSet.containsKey(md)) {
5073 mapMethodDescriptorToMethodInvokeNodeSet.put(md, new HashSet<MethodInvokeNode>());
5075 return mapMethodDescriptorToMethodInvokeNodeSet.get(md);
5078 private void propagateFlowsFromCalleesWithNoCompositeLocation(MethodDescriptor mdCaller) {
5080 // the transformation for a call site propagates flows through parameters
5081 // if the method is virtual, it also grab all relations from any possible
5084 Set<MethodInvokeNode> setMethodInvokeNode =
5085 mapMethodDescriptorToMethodInvokeNodeSet.get(mdCaller);
5087 if (setMethodInvokeNode != null) {
5089 for (Iterator iterator = setMethodInvokeNode.iterator(); iterator.hasNext();) {
5090 MethodInvokeNode min = (MethodInvokeNode) iterator.next();
5091 MethodDescriptor mdCallee = min.getMethod();
5092 Set<MethodDescriptor> setPossibleCallees = new HashSet<MethodDescriptor>();
5093 if (mdCallee.isStatic()) {
5094 setPossibleCallees.add(mdCallee);
5096 Set<MethodDescriptor> calleeSet = ssjava.getCallGraph().getMethods(mdCallee);
5097 // removes method descriptors that are not invoked by the caller
5098 calleeSet.retainAll(mapMethodToCalleeSet.get(mdCaller));
5099 setPossibleCallees.addAll(calleeSet);
5102 for (Iterator iterator2 = setPossibleCallees.iterator(); iterator2.hasNext();) {
5103 MethodDescriptor possibleMdCallee = (MethodDescriptor) iterator2.next();
5104 propagateFlowsToCallerWithNoCompositeLocation(min, mdCaller, possibleMdCallee);
5112 private void analyzeMethodBody(ClassDescriptor cd, MethodDescriptor md) {
5113 BlockNode bn = state.getMethodBody(md);
5114 NodeTupleSet implicitFlowTupleSet = new NodeTupleSet();
5115 analyzeFlowBlockNode(md, md.getParameterTable(), bn, implicitFlowTupleSet);
5118 private void analyzeFlowBlockNode(MethodDescriptor md, SymbolTable nametable, BlockNode bn,
5119 NodeTupleSet implicitFlowTupleSet) {
5121 bn.getVarTable().setParent(nametable);
5122 for (int i = 0; i < bn.size(); i++) {
5123 BlockStatementNode bsn = bn.get(i);
5124 analyzeBlockStatementNode(md, bn.getVarTable(), bsn, implicitFlowTupleSet);
5129 private void analyzeBlockStatementNode(MethodDescriptor md, SymbolTable nametable,
5130 BlockStatementNode bsn, NodeTupleSet implicitFlowTupleSet) {
5132 switch (bsn.kind()) {
5133 case Kind.BlockExpressionNode:
5134 analyzeBlockExpressionNode(md, nametable, (BlockExpressionNode) bsn, implicitFlowTupleSet);
5137 case Kind.DeclarationNode:
5138 analyzeFlowDeclarationNode(md, nametable, (DeclarationNode) bsn, implicitFlowTupleSet);
5141 case Kind.IfStatementNode:
5142 analyzeFlowIfStatementNode(md, nametable, (IfStatementNode) bsn, implicitFlowTupleSet);
5146 analyzeFlowLoopNode(md, nametable, (LoopNode) bsn, implicitFlowTupleSet);
5149 case Kind.ReturnNode:
5150 analyzeFlowReturnNode(md, nametable, (ReturnNode) bsn, implicitFlowTupleSet);
5153 case Kind.SubBlockNode:
5154 analyzeFlowSubBlockNode(md, nametable, (SubBlockNode) bsn, implicitFlowTupleSet);
5157 case Kind.ContinueBreakNode:
5160 case Kind.SwitchStatementNode:
5161 analyzeSwitchStatementNode(md, nametable, (SwitchStatementNode) bsn, implicitFlowTupleSet);
5168 private void analyzeSwitchBlockNode(MethodDescriptor md, SymbolTable nametable,
5169 SwitchBlockNode sbn, NodeTupleSet implicitFlowTupleSet) {
5171 analyzeFlowBlockNode(md, nametable, sbn.getSwitchBlockStatement(), implicitFlowTupleSet);
5175 private void analyzeSwitchStatementNode(MethodDescriptor md, SymbolTable nametable,
5176 SwitchStatementNode ssn, NodeTupleSet implicitFlowTupleSet) {
5178 NodeTupleSet condTupleNode = new NodeTupleSet();
5179 analyzeFlowExpressionNode(md, nametable, ssn.getCondition(), condTupleNode, null,
5180 implicitFlowTupleSet, false);
5182 NodeTupleSet newImplicitTupleSet = new NodeTupleSet();
5184 newImplicitTupleSet.addTupleSet(implicitFlowTupleSet);
5185 newImplicitTupleSet.addTupleSet(condTupleNode);
5187 if (needToGenerateInterLoc(newImplicitTupleSet)) {
5188 // need to create an intermediate node for the GLB of conditional
5189 // locations & implicit flows
5191 NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
5192 for (Iterator<NTuple<Descriptor>> idxIter = newImplicitTupleSet.iterator(); idxIter.hasNext();) {
5193 NTuple<Descriptor> tuple = idxIter.next();
5194 addFlowGraphEdge(md, tuple, interTuple);
5196 newImplicitTupleSet.clear();
5197 newImplicitTupleSet.addTuple(interTuple);
5200 BlockNode sbn = ssn.getSwitchBody();
5201 for (int i = 0; i < sbn.size(); i++) {
5202 analyzeSwitchBlockNode(md, nametable, (SwitchBlockNode) sbn.get(i), newImplicitTupleSet);
5207 private void analyzeFlowSubBlockNode(MethodDescriptor md, SymbolTable nametable,
5208 SubBlockNode sbn, NodeTupleSet implicitFlowTupleSet) {
5209 analyzeFlowBlockNode(md, nametable, sbn.getBlockNode(), implicitFlowTupleSet);
5212 private void analyzeFlowReturnNode(MethodDescriptor md, SymbolTable nametable, ReturnNode rn,
5213 NodeTupleSet implicitFlowTupleSet) {
5215 // System.out.println("-analyzeFlowReturnNode=" + rn.printNode(0));
5216 ExpressionNode returnExp = rn.getReturnExpression();
5218 if (returnExp != null) {
5219 NodeTupleSet nodeSet = new NodeTupleSet();
5220 // if a return expression returns a literal value, nodeSet is empty
5221 analyzeFlowExpressionNode(md, nametable, returnExp, nodeSet, false);
5222 FlowGraph fg = getFlowGraph(md);
5224 // if (implicitFlowTupleSet.size() == 1
5226 // fg.getFlowNode(implicitFlowTupleSet.iterator().next()).isIntermediate())
5229 // // since there is already an intermediate node for the GLB of implicit
5231 // // we don't need to create another intermediate node.
5232 // // just re-use the intermediate node for implicit flows.
5234 // FlowNode meetNode =
5235 // fg.getFlowNode(implicitFlowTupleSet.iterator().next());
5237 // for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
5238 // NTuple<Descriptor> returnNodeTuple = (NTuple<Descriptor>)
5240 // fg.addValueFlowEdge(returnNodeTuple, meetNode.getDescTuple());
5245 NodeTupleSet currentFlowTupleSet = new NodeTupleSet();
5247 // add tuples from return node
5248 currentFlowTupleSet.addTupleSet(nodeSet);
5250 // add tuples corresponding to the current implicit flows
5251 currentFlowTupleSet.addTupleSet(implicitFlowTupleSet);
5253 // System.out.println("---currentFlowTupleSet=" + currentFlowTupleSet);
5255 if (needToGenerateInterLoc(currentFlowTupleSet)) {
5257 FlowNode meetNode = fg.createIntermediateNode();
5258 for (Iterator iterator = currentFlowTupleSet.iterator(); iterator.hasNext();) {
5259 NTuple<Descriptor> currentFlowTuple = (NTuple<Descriptor>) iterator.next();
5260 fg.addValueFlowEdge(currentFlowTuple, meetNode.getDescTuple());
5262 fg.addReturnFlowNode(meetNode.getDescTuple());
5264 // currentFlowTupleSet = removeLiteralTuple(currentFlowTupleSet);
5265 for (Iterator iterator = currentFlowTupleSet.iterator(); iterator.hasNext();) {
5266 NTuple<Descriptor> currentFlowTuple = (NTuple<Descriptor>) iterator.next();
5267 fg.addReturnFlowNode(currentFlowTuple);
5275 private NodeTupleSet removeLiteralTuple(NodeTupleSet inSet) {
5276 NodeTupleSet tupleSet = new NodeTupleSet();
5277 for (Iterator<NTuple<Descriptor>> iter = inSet.iterator(); iter.hasNext();) {
5278 NTuple<Descriptor> tuple = iter.next();
5279 if (!tuple.get(0).equals(LITERALDESC)) {
5280 tupleSet.addTuple(tuple);
5286 private boolean needToGenerateInterLoc(NodeTupleSet tupleSet) {
5288 for (Iterator<NTuple<Descriptor>> iter = tupleSet.iterator(); iter.hasNext();) {
5289 NTuple<Descriptor> descTuple = iter.next();
5290 if (!descTuple.get(0).equals(LITERALDESC)) {
5295 // System.out.println("needToGenerateInterLoc=" + tupleSet + " size=" + size);
5302 private void analyzeFlowLoopNode(MethodDescriptor md, SymbolTable nametable, LoopNode ln,
5303 NodeTupleSet implicitFlowTupleSet) {
5305 if (ln.getType() == LoopNode.WHILELOOP || ln.getType() == LoopNode.DOWHILELOOP) {
5307 NodeTupleSet condTupleNode = new NodeTupleSet();
5308 analyzeFlowExpressionNode(md, nametable, ln.getCondition(), condTupleNode, null,
5309 implicitFlowTupleSet, false);
5311 NodeTupleSet newImplicitTupleSet = new NodeTupleSet();
5313 newImplicitTupleSet.addTupleSet(implicitFlowTupleSet);
5314 newImplicitTupleSet.addTupleSet(condTupleNode);
5316 newImplicitTupleSet.addGlobalFlowTupleSet(implicitFlowTupleSet.getGlobalLocTupleSet());
5317 newImplicitTupleSet.addGlobalFlowTupleSet(condTupleNode.getGlobalLocTupleSet());
5319 if (needToGenerateInterLoc(newImplicitTupleSet)) {
5320 // need to create an intermediate node for the GLB of conditional
5321 // locations & implicit flows
5323 NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
5324 for (Iterator<NTuple<Descriptor>> idxIter = newImplicitTupleSet.iterator(); idxIter
5326 NTuple<Descriptor> tuple = idxIter.next();
5327 addFlowGraphEdge(md, tuple, interTuple);
5329 newImplicitTupleSet.clear();
5330 newImplicitTupleSet.addTuple(interTuple);
5335 // System.out.println("condTupleNode="+condTupleNode);
5336 // NTuple<Descriptor> interTuple =
5337 // getFlowGraph(md).createIntermediateNode().getDescTuple();
5339 // for (Iterator<NTuple<Descriptor>> idxIter = condTupleNode.iterator();
5340 // idxIter.hasNext();) {
5341 // NTuple<Descriptor> tuple = idxIter.next();
5342 // addFlowGraphEdge(md, tuple, interTuple);
5345 // for (Iterator<NTuple<Descriptor>> idxIter =
5346 // implicitFlowTupleSet.iterator(); idxIter
5348 // NTuple<Descriptor> tuple = idxIter.next();
5349 // addFlowGraphEdge(md, tuple, interTuple);
5352 // NodeTupleSet newImplicitSet = new NodeTupleSet();
5353 // newImplicitSet.addTuple(interTuple);
5354 analyzeFlowBlockNode(md, nametable, ln.getBody(), newImplicitTupleSet);
5357 // condTupleNode.addTupleSet(implicitFlowTupleSet);
5359 // add edges from condNodeTupleSet to all nodes of conditional nodes
5360 // analyzeFlowBlockNode(md, nametable, ln.getBody(), condTupleNode);
5363 // check 'for loop' case
5364 BlockNode bn = ln.getInitializer();
5365 bn.getVarTable().setParent(nametable);
5366 for (int i = 0; i < bn.size(); i++) {
5367 BlockStatementNode bsn = bn.get(i);
5368 analyzeBlockStatementNode(md, bn.getVarTable(), bsn, implicitFlowTupleSet);
5371 NodeTupleSet condTupleNode = new NodeTupleSet();
5372 analyzeFlowExpressionNode(md, bn.getVarTable(), ln.getCondition(), condTupleNode, null,
5373 implicitFlowTupleSet, false);
5375 NodeTupleSet newImplicitTupleSet = new NodeTupleSet();
5376 newImplicitTupleSet.addTupleSet(implicitFlowTupleSet);
5377 newImplicitTupleSet.addTupleSet(condTupleNode);
5379 if (needToGenerateInterLoc(newImplicitTupleSet)) {
5380 // need to create an intermediate node for the GLB of conditional
5381 // locations & implicit flows
5383 NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
5384 for (Iterator<NTuple<Descriptor>> idxIter = newImplicitTupleSet.iterator(); idxIter
5386 NTuple<Descriptor> tuple = idxIter.next();
5387 addFlowGraphEdge(md, tuple, interTuple);
5389 newImplicitTupleSet.clear();
5390 newImplicitTupleSet.addTuple(interTuple);
5395 // NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
5397 // for (Iterator<NTuple<Descriptor>> idxIter = condTupleNode.iterator(); idxIter.hasNext();) {
5398 // NTuple<Descriptor> tuple = idxIter.next();
5399 // addFlowGraphEdge(md, tuple, interTuple);
5402 // for (Iterator<NTuple<Descriptor>> idxIter = implicitFlowTupleSet.iterator(); idxIter
5404 // NTuple<Descriptor> tuple = idxIter.next();
5405 // addFlowGraphEdge(md, tuple, interTuple);
5408 // NodeTupleSet newImplicitSet = new NodeTupleSet();
5409 // newImplicitSet.addTuple(interTuple);
5410 analyzeFlowBlockNode(md, bn.getVarTable(), ln.getUpdate(), newImplicitTupleSet);
5411 analyzeFlowBlockNode(md, bn.getVarTable(), ln.getBody(), newImplicitTupleSet);
5414 // condTupleNode.addTupleSet(implicitFlowTupleSet);
5416 // analyzeFlowBlockNode(md, bn.getVarTable(), ln.getUpdate(),
5418 // analyzeFlowBlockNode(md, bn.getVarTable(), ln.getBody(),
5425 private void analyzeFlowIfStatementNode(MethodDescriptor md, SymbolTable nametable,
5426 IfStatementNode isn, NodeTupleSet implicitFlowTupleSet) {
5428 // System.out.println("analyzeFlowIfStatementNode=" + isn.printNode(0));
5430 NodeTupleSet condTupleNode = new NodeTupleSet();
5431 analyzeFlowExpressionNode(md, nametable, isn.getCondition(), condTupleNode, null,
5432 implicitFlowTupleSet, false);
5434 NodeTupleSet newImplicitTupleSet = new NodeTupleSet();
5436 newImplicitTupleSet.addTupleSet(implicitFlowTupleSet);
5437 newImplicitTupleSet.addTupleSet(condTupleNode);
5439 // System.out.println("$$$GGGcondTupleNode=" + condTupleNode.getGlobalLocTupleSet());
5440 // System.out.println("-condTupleNode=" + condTupleNode);
5441 // System.out.println("-implicitFlowTupleSet=" + implicitFlowTupleSet);
5442 // System.out.println("-newImplicitTupleSet=" + newImplicitTupleSet);
5444 if (needToGenerateInterLoc(newImplicitTupleSet)) {
5446 // need to create an intermediate node for the GLB of conditional locations & implicit flows
5447 NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
5448 for (Iterator<NTuple<Descriptor>> idxIter = newImplicitTupleSet.iterator(); idxIter.hasNext();) {
5449 NTuple<Descriptor> tuple = idxIter.next();
5450 addFlowGraphEdge(md, tuple, interTuple);
5452 newImplicitTupleSet.clear();
5453 newImplicitTupleSet.addTuple(interTuple);
5456 // GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
5457 // for (Iterator<NTuple<Location>> iterator = condTupleNode.globalIterator();
5458 // iterator.hasNext();) {
5459 // NTuple<Location> calleeReturnLocTuple = iterator.next();
5460 // for (Iterator<NTuple<Descriptor>> iter2 = newImplicitTupleSet.iterator(); iter2.hasNext();) {
5461 // NTuple<Descriptor> callerImplicitTuple = iter2.next();
5462 // globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple,
5463 // translateToLocTuple(md, callerImplicitTuple));
5466 newImplicitTupleSet.addGlobalFlowTupleSet(condTupleNode.getGlobalLocTupleSet());
5468 analyzeFlowBlockNode(md, nametable, isn.getTrueBlock(), newImplicitTupleSet);
5470 if (isn.getFalseBlock() != null) {
5471 analyzeFlowBlockNode(md, nametable, isn.getFalseBlock(), newImplicitTupleSet);
5476 private void analyzeFlowDeclarationNode(MethodDescriptor md, SymbolTable nametable,
5477 DeclarationNode dn, NodeTupleSet implicitFlowTupleSet) {
5479 VarDescriptor vd = dn.getVarDescriptor();
5480 mapDescToDefinitionLine.put(vd, dn.getNumLine());
5481 NTuple<Descriptor> tupleLHS = new NTuple<Descriptor>();
5483 FlowNode fn = getFlowGraph(md).createNewFlowNode(tupleLHS);
5484 fn.setDeclarationNode();
5486 if (dn.getExpression() != null) {
5487 // System.out.println("-analyzeFlowDeclarationNode=" + dn.printNode(0));
5489 NodeTupleSet nodeSetRHS = new NodeTupleSet();
5490 analyzeFlowExpressionNode(md, nametable, dn.getExpression(), nodeSetRHS, null,
5491 implicitFlowTupleSet, false);
5493 // creates edges from RHS to LHS
5494 NTuple<Descriptor> interTuple = null;
5495 if (needToGenerateInterLoc(nodeSetRHS)) {
5496 interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
5499 for (Iterator<NTuple<Descriptor>> iter = nodeSetRHS.iterator(); iter.hasNext();) {
5500 NTuple<Descriptor> fromTuple = iter.next();
5501 // System.out.println("fromTuple=" + fromTuple + " interTuple=" + interTuple + " tupleLSH="
5503 addFlowGraphEdge(md, fromTuple, interTuple, tupleLHS);
5506 // creates edges from implicitFlowTupleSet to LHS
5507 for (Iterator<NTuple<Descriptor>> iter = implicitFlowTupleSet.iterator(); iter.hasNext();) {
5508 NTuple<Descriptor> implicitTuple = iter.next();
5509 addFlowGraphEdge(md, implicitTuple, tupleLHS);
5512 GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
5513 for (Iterator<NTuple<Location>> iterator = nodeSetRHS.globalIterator(); iterator.hasNext();) {
5514 NTuple<Location> calleeReturnLocTuple = iterator.next();
5516 globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple, translateToLocTuple(md, tupleLHS));
5519 for (Iterator<NTuple<Location>> iterator = implicitFlowTupleSet.globalIterator(); iterator
5521 NTuple<Location> implicitGlobalTuple = iterator.next();
5523 globalFlowGraph.addValueFlowEdge(implicitGlobalTuple, translateToLocTuple(md, tupleLHS));
5526 // System.out.println("-nodeSetRHS=" + nodeSetRHS);
5527 // System.out.println("-implicitFlowTupleSet=" + implicitFlowTupleSet);
5533 private void analyzeBlockExpressionNode(MethodDescriptor md, SymbolTable nametable,
5534 BlockExpressionNode ben, NodeTupleSet implicitFlowTupleSet) {
5535 analyzeFlowExpressionNode(md, nametable, ben.getExpression(), null, null, implicitFlowTupleSet,
5539 private NTuple<Descriptor> analyzeFlowExpressionNode(MethodDescriptor md, SymbolTable nametable,
5540 ExpressionNode en, NodeTupleSet nodeSet, boolean isLHS) {
5541 return analyzeFlowExpressionNode(md, nametable, en, nodeSet, null, new NodeTupleSet(), isLHS);
5544 private NTuple<Descriptor> analyzeFlowExpressionNode(MethodDescriptor md, SymbolTable nametable,
5545 ExpressionNode en, NodeTupleSet nodeSet, NTuple<Descriptor> base,
5546 NodeTupleSet implicitFlowTupleSet, boolean isLHS) {
5548 // System.out.println("en=" + en.printNode(0) + " class=" + en.getClass());
5550 // note that expression node can create more than one flow node
5551 // nodeSet contains of flow nodes
5552 // base is always assigned to null except the case of a name node!
5553 NTuple<Descriptor> flowTuple;
5554 switch (en.kind()) {
5555 case Kind.AssignmentNode:
5556 analyzeFlowAssignmentNode(md, nametable, (AssignmentNode) en, nodeSet, base,
5557 implicitFlowTupleSet);
5560 case Kind.FieldAccessNode:
5562 analyzeFlowFieldAccessNode(md, nametable, (FieldAccessNode) en, nodeSet, base,
5563 implicitFlowTupleSet, isLHS);
5564 if (flowTuple != null) {
5565 nodeSet.addTuple(flowTuple);
5570 NodeTupleSet nameNodeSet = new NodeTupleSet();
5572 analyzeFlowNameNode(md, nametable, (NameNode) en, nameNodeSet, base, implicitFlowTupleSet);
5573 if (flowTuple != null) {
5574 nodeSet.addTuple(flowTuple);
5579 analyzeFlowOpNode(md, nametable, (OpNode) en, nodeSet, implicitFlowTupleSet);
5582 case Kind.CreateObjectNode:
5583 analyzeCreateObjectNode(md, nametable, (CreateObjectNode) en, nodeSet, implicitFlowTupleSet);
5586 case Kind.ArrayAccessNode:
5587 analyzeFlowArrayAccessNode(md, nametable, (ArrayAccessNode) en, nodeSet, isLHS);
5590 case Kind.LiteralNode:
5591 analyzeFlowLiteralNode(md, nametable, (LiteralNode) en, nodeSet);
5594 case Kind.MethodInvokeNode:
5595 analyzeFlowMethodInvokeNode(md, nametable, (MethodInvokeNode) en, nodeSet,
5596 implicitFlowTupleSet);
5599 case Kind.TertiaryNode:
5600 analyzeFlowTertiaryNode(md, nametable, (TertiaryNode) en, nodeSet, implicitFlowTupleSet);
5604 analyzeFlowCastNode(md, nametable, (CastNode) en, nodeSet, base, implicitFlowTupleSet);
5606 // case Kind.InstanceOfNode:
5607 // checkInstanceOfNode(md, nametable, (InstanceOfNode) en, td);
5610 // case Kind.ArrayInitializerNode:
5611 // checkArrayInitializerNode(md, nametable, (ArrayInitializerNode) en,
5615 // case Kind.ClassTypeNode:
5616 // checkClassTypeNode(md, nametable, (ClassTypeNode) en, td);
5619 // case Kind.OffsetNode:
5620 // checkOffsetNode(md, nametable, (OffsetNode)en, td);
5629 private void analyzeFlowCastNode(MethodDescriptor md, SymbolTable nametable, CastNode cn,
5630 NodeTupleSet nodeSet, NTuple<Descriptor> base, NodeTupleSet implicitFlowTupleSet) {
5632 analyzeFlowExpressionNode(md, nametable, cn.getExpression(), nodeSet, base,
5633 implicitFlowTupleSet, false);
5637 private void analyzeFlowTertiaryNode(MethodDescriptor md, SymbolTable nametable, TertiaryNode tn,
5638 NodeTupleSet nodeSet, NodeTupleSet implicitFlowTupleSet) {
5640 // System.out.println("analyzeFlowTertiaryNode=" + tn.printNode(0));
5642 NodeTupleSet tertiaryTupleNode = new NodeTupleSet();
5643 analyzeFlowExpressionNode(md, nametable, tn.getCond(), tertiaryTupleNode, null,
5644 implicitFlowTupleSet, false);
5646 NodeTupleSet newImplicitTupleSet = new NodeTupleSet();
5647 newImplicitTupleSet.addTupleSet(implicitFlowTupleSet);
5648 newImplicitTupleSet.addTupleSet(tertiaryTupleNode);
5650 // System.out.println("$$$GGGcondTupleNode=" + tertiaryTupleNode.getGlobalLocTupleSet());
5651 // System.out.println("-tertiaryTupleNode=" + tertiaryTupleNode);
5652 // System.out.println("-implicitFlowTupleSet=" + implicitFlowTupleSet);
5653 // System.out.println("-newImplicitTupleSet=" + newImplicitTupleSet);
5655 if (needToGenerateInterLoc(newImplicitTupleSet)) {
5656 // need to create an intermediate node for the GLB of conditional locations & implicit flows
5657 NTuple<Descriptor> interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
5658 for (Iterator<NTuple<Descriptor>> idxIter = newImplicitTupleSet.iterator(); idxIter.hasNext();) {
5659 NTuple<Descriptor> tuple = idxIter.next();
5660 addFlowGraphEdge(md, tuple, interTuple);
5662 newImplicitTupleSet.clear();
5663 newImplicitTupleSet.addTuple(interTuple);
5666 newImplicitTupleSet.addGlobalFlowTupleSet(tertiaryTupleNode.getGlobalLocTupleSet());
5668 // System.out.println("---------newImplicitTupleSet=" + newImplicitTupleSet);
5670 // add edges from tertiaryTupleNode to all nodes of conditional nodes
5671 // tertiaryTupleNode.addTupleSet(implicitFlowTupleSet);
5672 analyzeFlowExpressionNode(md, nametable, tn.getTrueExpr(), tertiaryTupleNode, null,
5673 newImplicitTupleSet, false);
5675 analyzeFlowExpressionNode(md, nametable, tn.getFalseExpr(), tertiaryTupleNode, null,
5676 newImplicitTupleSet, false);
5678 nodeSet.addGlobalFlowTupleSet(tertiaryTupleNode.getGlobalLocTupleSet());
5679 nodeSet.addTupleSet(tertiaryTupleNode);
5681 // System.out.println("#tertiary node set=" + nodeSet);
5684 private void addMapCallerMethodDescToMethodInvokeNodeSet(MethodDescriptor caller,
5685 MethodInvokeNode min) {
5686 Set<MethodInvokeNode> set = mapMethodDescriptorToMethodInvokeNodeSet.get(caller);
5688 set = new HashSet<MethodInvokeNode>();
5689 mapMethodDescriptorToMethodInvokeNodeSet.put(caller, set);
5694 private void addParamNodeFlowingToReturnValue(MethodDescriptor md, FlowNode fn) {
5696 if (!mapMethodDescToParamNodeFlowsToReturnValue.containsKey(md)) {
5697 mapMethodDescToParamNodeFlowsToReturnValue.put(md, new HashSet<FlowNode>());
5699 mapMethodDescToParamNodeFlowsToReturnValue.get(md).add(fn);
5702 private Set<FlowNode> getParamNodeFlowingToReturnValue(MethodDescriptor md) {
5704 if (!mapMethodDescToParamNodeFlowsToReturnValue.containsKey(md)) {
5705 mapMethodDescToParamNodeFlowsToReturnValue.put(md, new HashSet<FlowNode>());
5708 return mapMethodDescToParamNodeFlowsToReturnValue.get(md);
5711 private Set<NTuple<Location>> getPCLocTupleSet(MethodInvokeNode min) {
5712 if (!mapMethodInvokeNodeToPCLocTupleSet.containsKey(min)) {
5713 mapMethodInvokeNodeToPCLocTupleSet.put(min, new HashSet<NTuple<Location>>());
5715 return mapMethodInvokeNodeToPCLocTupleSet.get(min);
5718 private void analyzeFlowMethodInvokeNode(MethodDescriptor mdCaller, SymbolTable nametable,
5719 MethodInvokeNode min, NodeTupleSet nodeSet, NodeTupleSet implicitFlowTupleSet) {
5721 // System.out.println("analyzeFlowMethodInvokeNode=" + min.printNode(0));
5723 if (!toanalyze_methodDescList.contains(min.getMethod())) {
5727 addMapMethodDescToMethodInvokeNodeSet(min);
5729 Set<NTuple<Location>> pcLocTupleSet = getPCLocTupleSet(min);
5730 for (Iterator iterator = implicitFlowTupleSet.iterator(); iterator.hasNext();) {
5731 NTuple<Descriptor> pcDescTuple = (NTuple<Descriptor>) iterator.next();
5732 if (!pcDescTuple.get(0).equals(LITERALDESC)) {
5733 // here we don't need to add the literal value as a PC location
5734 pcLocTupleSet.add(translateToLocTuple(mdCaller, pcDescTuple));
5738 mapMethodInvokeNodeToArgIdxMap.put(min, new HashMap<Integer, NTuple<Descriptor>>());
5740 if (nodeSet == null) {
5741 nodeSet = new NodeTupleSet();
5744 MethodDescriptor mdCallee = min.getMethod();
5746 NameDescriptor baseName = min.getBaseName();
5747 boolean isSystemout = false;
5748 if (baseName != null) {
5749 isSystemout = baseName.getSymbol().equals("System.out");
5752 if (!ssjava.isSSJavaUtil(mdCallee.getClassDesc()) && !ssjava.isTrustMethod(mdCallee)
5755 addMapCallerMethodDescToMethodInvokeNodeSet(mdCaller, min);
5757 FlowGraph calleeFlowGraph = getFlowGraph(mdCallee);
5758 // System.out.println("mdCallee=" + mdCallee + " calleeFlowGraph=" + calleeFlowGraph);
5759 Set<FlowNode> calleeReturnSet = calleeFlowGraph.getReturnNodeSet();
5761 // System.out.println("---calleeReturnSet=" + calleeReturnSet);
5763 NodeTupleSet tupleSet = new NodeTupleSet();
5765 if (min.getExpression() != null) {
5767 NodeTupleSet baseNodeSet = new NodeTupleSet();
5768 analyzeFlowExpressionNode(mdCaller, nametable, min.getExpression(), baseNodeSet, null,
5769 implicitFlowTupleSet, false);
5770 // System.out.println("baseNodeSet=" + baseNodeSet);
5772 assert (baseNodeSet.size() == 1);
5773 NTuple<Descriptor> baseTuple = baseNodeSet.iterator().next();
5774 if (baseTuple.get(0) instanceof InterDescriptor) {
5775 if (baseTuple.size() > 1) {
5778 FlowNode interNode = getFlowGraph(mdCaller).getFlowNode(baseTuple);
5779 baseTuple = translateBaseTuple(interNode, baseTuple);
5781 mapMethodInvokeNodeToBaseTuple.put(min, baseTuple);
5783 if (!min.getMethod().isStatic()) {
5784 addArgIdxMap(min, 0, baseTuple);
5786 for (Iterator iterator = calleeReturnSet.iterator(); iterator.hasNext();) {
5787 FlowNode returnNode = (FlowNode) iterator.next();
5788 NTuple<Descriptor> returnDescTuple = returnNode.getDescTuple();
5789 if (returnDescTuple.startsWith(mdCallee.getThis())) {
5790 // the location type of the return value is started with 'this'
5792 NTuple<Descriptor> inFlowTuple = new NTuple<Descriptor>(baseTuple.getList());
5794 if (inFlowTuple.get(0) instanceof InterDescriptor) {
5795 // min.getExpression()
5800 inFlowTuple.addAll(returnDescTuple.subList(1, returnDescTuple.size()));
5801 // nodeSet.addTuple(inFlowTuple);
5802 // System.out.println("1CREATE A NEW TUPLE=" + inFlowTuple + " from="
5803 // + mdCallee.getThis());
5804 // tupleSet.addTuple(inFlowTuple);
5805 tupleSet.addTuple(baseTuple);
5808 // System.out.println("returnNode=" + returnNode);
5809 Set<FlowNode> inFlowSet = calleeFlowGraph.getIncomingFlowNodeSet(returnNode);
5810 // System.out.println("inFlowSet=" + inFlowSet + " from retrunNode=" + returnNode);
5811 for (Iterator iterator2 = inFlowSet.iterator(); iterator2.hasNext();) {
5812 FlowNode inFlowNode = (FlowNode) iterator2.next();
5813 if (inFlowNode.getDescTuple().startsWith(mdCallee.getThis())) {
5814 // nodeSet.addTupleSet(baseNodeSet);
5815 // System.out.println("2CREATE A NEW TUPLE=" + baseNodeSet + " from="
5816 // + mdCallee.getThis());
5817 tupleSet.addTupleSet(baseNodeSet);
5825 // analyze parameter flows
5827 if (min.numArgs() > 0) {
5830 if (min.getMethod().isStatic()) {
5836 for (int i = 0; i < min.numArgs(); i++) {
5837 ExpressionNode en = min.getArg(i);
5838 int idx = i + offset;
5839 NodeTupleSet argTupleSet = new NodeTupleSet();
5840 analyzeFlowExpressionNode(mdCaller, nametable, en, argTupleSet, false);
5841 // if argument is liternal node, argTuple is set to NULL
5842 // System.out.println("---arg idx=" + idx + " argTupleSet=" + argTupleSet);
5843 NTuple<Descriptor> argTuple = generateArgTuple(mdCaller, argTupleSet);
5845 // if an argument is literal value,
5846 // we need to create an itermediate node so that we could assign a composite location to
5847 // that node if needed
5848 if (argTuple.size() > 0
5849 && (argTuple.get(0).equals(GLOBALDESC) || argTuple.get(0).equals(LITERALDESC))) {
5851 * System.out.println("***GLOBAL ARG TUPLE CASE=" + argTuple); System.out.println("8");
5853 * NTuple<Descriptor> interTuple =
5854 * getFlowGraph(mdCaller).createIntermediateNode().getDescTuple(); ((InterDescriptor)
5855 * interTuple.get(0)).setMethodArgIdxPair(min, idx); addFlowGraphEdge(mdCaller,
5856 * argTuple, interTuple); argTuple = interTuple; addArgIdxMap(min, idx, argTuple);
5857 * System.out.println("new min mapping i=" + idx + " ->" + argTuple);
5859 argTuple = new NTuple<Descriptor>();
5862 addArgIdxMap(min, idx, argTuple);
5864 FlowNode paramNode = calleeFlowGraph.getParamFlowNode(idx);
5866 // check whether a param node in the callee graph has incoming flows
5867 // if it has incoming flows, the corresponding arg should be lower than the current PC
5868 // Descriptor prefix = paramNode.getDescTuple().get(0);
5869 // if (calleeFlowGraph.getIncomingNodeSetByPrefix(prefix).size() > 0) {
5870 // for (Iterator<NTuple<Descriptor>> iterator = implicitFlowTupleSet.iterator(); iterator
5872 // NTuple<Descriptor> pcTuple = iterator.next();
5873 // System.out.println("add edge pcTuple =" + pcTuple + " -> " + argTuple);
5874 // addFlowGraphEdge(md, pcTuple, argTuple);
5878 // System.out.println("paramNode=" + paramNode + " calleeReturnSet=" + calleeReturnSet);
5879 if (hasInFlowTo(calleeFlowGraph, paramNode, calleeReturnSet)
5880 || mdCallee.getModifiers().isNative()) {
5881 addParamNodeFlowingToReturnValue(mdCallee, paramNode);
5882 // nodeSet.addTupleSet(argTupleSet);
5883 // System.out.println("3CREATE A NEW TUPLE=" + argTupleSet + " from=" + paramNode);
5884 tupleSet.addTupleSet(argTupleSet);
5890 if (mdCallee.getReturnType() != null && !mdCallee.getReturnType().isVoid()) {
5891 FlowReturnNode returnHolderNode = getFlowGraph(mdCaller).createReturnNode(min);
5893 if (needToGenerateInterLoc(tupleSet)) {
5894 FlowGraph fg = getFlowGraph(mdCaller);
5895 FlowNode interNode = fg.createIntermediateNode();
5896 interNode.setFormHolder(true);
5898 NTuple<Descriptor> interTuple = interNode.getDescTuple();
5900 for (Iterator iterator = tupleSet.iterator(); iterator.hasNext();) {
5901 NTuple<Descriptor> tuple = (NTuple<Descriptor>) iterator.next();
5903 Set<NTuple<Descriptor>> addSet = new HashSet<NTuple<Descriptor>>();
5904 FlowNode node = fg.getFlowNode(tuple);
5905 if (node instanceof FlowReturnNode) {
5906 addSet.addAll(fg.getReturnTupleSet(((FlowReturnNode) node).getReturnTupleSet()));
5910 for (Iterator iterator2 = addSet.iterator(); iterator2.hasNext();) {
5911 NTuple<Descriptor> higher = (NTuple<Descriptor>) iterator2.next();
5912 addFlowGraphEdge(mdCaller, higher, interTuple);
5916 returnHolderNode.addTuple(interTuple);
5918 nodeSet.addTuple(interTuple);
5919 // System.out.println("ADD TUPLESET=" + interTuple + " to returnnode=" +
5920 // returnHolderNode);
5923 returnHolderNode.addTupleSet(tupleSet);
5924 // System.out.println("ADD TUPLESET=" + tupleSet + " to returnnode=" + returnHolderNode);
5926 // setNode.addTupleSet(tupleSet);
5927 // NodeTupleSet setFromReturnNode=new NodeTupleSet();
5928 // setFromReturnNode.addTuple(tuple);
5930 NodeTupleSet holderTupleSet =
5931 getNodeTupleSetFromReturnNode(getFlowGraph(mdCaller), returnHolderNode);
5933 // System.out.println("HOLDER TUPLE SET=" + holderTupleSet);
5934 nodeSet.addTupleSet(holderTupleSet);
5936 nodeSet.addTuple(returnHolderNode.getDescTuple());
5939 // propagateFlowsFromCallee(min, md, min.getMethod());
5941 // when generating the global flow graph,
5942 // we need to add ordering relations from the set of callee return loc tuple to LHS of the
5943 // caller assignment
5944 for (Iterator iterator = calleeReturnSet.iterator(); iterator.hasNext();) {
5945 FlowNode calleeReturnNode = (FlowNode) iterator.next();
5946 NTuple<Location> calleeReturnLocTuple =
5947 translateToLocTuple(mdCallee, calleeReturnNode.getDescTuple());
5948 // System.out.println("calleeReturnLocTuple=" + calleeReturnLocTuple);
5949 NTuple<Location> transaltedToCaller =
5950 translateToCallerLocTuple(min, mdCallee, mdCaller, calleeReturnLocTuple);
5951 // System.out.println("translateToCallerLocTuple="
5952 // + translateToCallerLocTuple(min, mdCallee, mdCaller, calleeReturnLocTuple));
5953 if (transaltedToCaller.size() > 0) {
5954 nodeSet.addGlobalFlowTuple(translateToCallerLocTuple(min, mdCallee, mdCaller,
5955 calleeReturnLocTuple));
5959 // System.out.println("min nodeSet=" + nodeSet);
5965 private NodeTupleSet getNodeTupleSetFromReturnNode(FlowGraph fg, FlowReturnNode node) {
5966 NodeTupleSet nts = new NodeTupleSet();
5968 Set<NTuple<Descriptor>> returnSet = node.getReturnTupleSet();
5970 for (Iterator iterator = returnSet.iterator(); iterator.hasNext();) {
5971 NTuple<Descriptor> tuple = (NTuple<Descriptor>) iterator.next();
5972 FlowNode flowNode = fg.getFlowNode(tuple);
5973 if (flowNode instanceof FlowReturnNode) {
5974 returnSet.addAll(recurGetNode(fg, (FlowReturnNode) flowNode));
5976 returnSet.add(tuple);
5980 for (Iterator iterator = returnSet.iterator(); iterator.hasNext();) {
5981 NTuple<Descriptor> nTuple = (NTuple<Descriptor>) iterator.next();
5982 nts.addTuple(nTuple);
5989 private Set<NTuple<Descriptor>> recurGetNode(FlowGraph fg, FlowReturnNode rnode) {
5991 Set<NTuple<Descriptor>> tupleSet = new HashSet<NTuple<Descriptor>>();
5993 Set<NTuple<Descriptor>> returnSet = rnode.getReturnTupleSet();
5994 for (Iterator iterator = returnSet.iterator(); iterator.hasNext();) {
5995 NTuple<Descriptor> tuple = (NTuple<Descriptor>) iterator.next();
5996 FlowNode flowNode = fg.getFlowNode(tuple);
5997 if (flowNode instanceof FlowReturnNode) {
5998 tupleSet.addAll(recurGetNode(fg, (FlowReturnNode) flowNode));
6000 tupleSet.add(tuple);
6006 private NTuple<Descriptor> generateArgTuple(MethodDescriptor mdCaller, NodeTupleSet argTupleSet) {
6010 // if argTupleSet is empty, it comes from the top location
6011 if (argTupleSet.size() == 0) {
6012 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
6013 descTuple.add(LITERALDESC);
6017 Set<NTuple<Descriptor>> argTupleSetNonLiteral = new HashSet<NTuple<Descriptor>>();
6019 for (Iterator<NTuple<Descriptor>> iter = argTupleSet.iterator(); iter.hasNext();) {
6020 NTuple<Descriptor> descTuple = iter.next();
6021 if (!descTuple.get(0).equals(LITERALDESC)) {
6022 argTupleSetNonLiteral.add(descTuple);
6026 if (argTupleSetNonLiteral.size() > 1) {
6028 NTuple<Descriptor> interTuple =
6029 getFlowGraph(mdCaller).createIntermediateNode().getDescTuple();
6030 for (Iterator<NTuple<Descriptor>> idxIter = argTupleSet.iterator(); idxIter.hasNext();) {
6031 NTuple<Descriptor> tuple = idxIter.next();
6032 addFlowGraphEdge(mdCaller, tuple, interTuple);
6035 } else if (argTupleSetNonLiteral.size() == 1) {
6036 return argTupleSetNonLiteral.iterator().next();
6038 return argTupleSet.iterator().next();
6043 private boolean hasInFlowTo(FlowGraph fg, FlowNode inNode, Set<FlowNode> nodeSet) {
6044 // return true if inNode has in-flows to nodeSet
6046 if (nodeSet.contains(inNode)) {
6047 // in this case, the method directly returns a parameter variable.
6050 // Set<FlowNode> reachableSet = fg.getReachFlowNodeSetFrom(inNode);
6051 Set<FlowNode> reachableSet = fg.getReachableSetFrom(inNode.getDescTuple());
6052 // System.out.println("inNode=" + inNode + " reachalbeSet=" + reachableSet);
6054 for (Iterator iterator = reachableSet.iterator(); iterator.hasNext();) {
6055 FlowNode fn = (FlowNode) iterator.next();
6056 if (nodeSet.contains(fn)) {
6063 private NTuple<Descriptor> getNodeTupleByArgIdx(MethodInvokeNode min, int idx) {
6064 return mapMethodInvokeNodeToArgIdxMap.get(min).get(new Integer(idx));
6067 private void addArgIdxMap(MethodInvokeNode min, int idx, NTuple<Descriptor> argTuple /*
6071 Map<Integer, NTuple<Descriptor>> mapIdxToTuple = mapMethodInvokeNodeToArgIdxMap.get(min);
6072 if (mapIdxToTuple == null) {
6073 mapIdxToTuple = new HashMap<Integer, NTuple<Descriptor>>();
6074 mapMethodInvokeNodeToArgIdxMap.put(min, mapIdxToTuple);
6076 mapIdxToTuple.put(new Integer(idx), argTuple);
6079 private void analyzeFlowLiteralNode(MethodDescriptor md, SymbolTable nametable, LiteralNode en,
6080 NodeTupleSet nodeSet) {
6081 NTuple<Descriptor> tuple = new NTuple<Descriptor>();
6082 tuple.add(LITERALDESC);
6083 nodeSet.addTuple(tuple);
6086 private void analyzeFlowArrayAccessNode(MethodDescriptor md, SymbolTable nametable,
6087 ArrayAccessNode aan, NodeTupleSet nodeSet, boolean isLHS) {
6089 // System.out.println("analyzeFlowArrayAccessNode aan=" + aan.printNode(0));
6090 String currentArrayAccessNodeExpStr = aan.printNode(0);
6091 arrayAccessNodeStack.push(aan.printNode(0));
6093 NodeTupleSet expNodeTupleSet = new NodeTupleSet();
6094 NTuple<Descriptor> base =
6095 analyzeFlowExpressionNode(md, nametable, aan.getExpression(), expNodeTupleSet, isLHS);
6096 // System.out.println("-base=" + base);
6098 nodeSet.setMethodInvokeBaseDescTuple(base);
6099 NodeTupleSet idxNodeTupleSet = new NodeTupleSet();
6100 analyzeFlowExpressionNode(md, nametable, aan.getIndex(), idxNodeTupleSet, isLHS);
6102 arrayAccessNodeStack.pop();
6105 // need to create an edge from idx to array
6106 for (Iterator<NTuple<Descriptor>> idxIter = idxNodeTupleSet.iterator(); idxIter.hasNext();) {
6107 NTuple<Descriptor> idxTuple = idxIter.next();
6108 for (Iterator<NTuple<Descriptor>> arrIter = expNodeTupleSet.iterator(); arrIter.hasNext();) {
6109 NTuple<Descriptor> arrTuple = arrIter.next();
6110 getFlowGraph(md).addValueFlowEdge(idxTuple, arrTuple);
6114 GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
6115 for (Iterator<NTuple<Location>> iterator = idxNodeTupleSet.globalIterator(); iterator
6117 NTuple<Location> calleeReturnLocTuple = iterator.next();
6118 for (Iterator<NTuple<Descriptor>> arrIter = expNodeTupleSet.iterator(); arrIter.hasNext();) {
6119 NTuple<Descriptor> arrTuple = arrIter.next();
6121 globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple, translateToLocTuple(md, arrTuple));
6125 nodeSet.addTupleSet(expNodeTupleSet);
6128 NodeTupleSet nodeSetArrayAccessExp = new NodeTupleSet();
6130 nodeSetArrayAccessExp.addTupleSet(expNodeTupleSet);
6131 nodeSetArrayAccessExp.addTupleSet(idxNodeTupleSet);
6133 if (arrayAccessNodeStack.isEmpty()
6134 || !arrayAccessNodeStack.peek().startsWith(currentArrayAccessNodeExpStr)) {
6136 if (needToGenerateInterLoc(nodeSetArrayAccessExp)) {
6137 FlowNode interNode = getFlowGraph(md).createIntermediateNode();
6138 NTuple<Descriptor> interTuple = interNode.getDescTuple();
6140 for (Iterator<NTuple<Descriptor>> iter = nodeSetArrayAccessExp.iterator(); iter.hasNext();) {
6141 NTuple<Descriptor> higherTuple = iter.next();
6142 addFlowGraphEdge(md, higherTuple, interTuple);
6144 nodeSetArrayAccessExp.clear();
6145 nodeSetArrayAccessExp.addTuple(interTuple);
6146 FlowGraph fg = getFlowGraph(md);
6148 // System.out.println("base=" + base);
6150 fg.addMapInterLocNodeToEnclosingDescriptor(interTuple.get(0),
6151 getClassTypeDescriptor(base.get(base.size() - 1)));
6152 interNode.setBaseTuple(base);
6157 nodeSet.addGlobalFlowTupleSet(idxNodeTupleSet.getGlobalLocTupleSet());
6158 nodeSet.addTupleSet(nodeSetArrayAccessExp);
6164 private void analyzeCreateObjectNode(MethodDescriptor md, SymbolTable nametable,
6165 CreateObjectNode en, NodeTupleSet nodeSet, NodeTupleSet implicitFlowTupleSet) {
6166 // System.out.println("#analyzeCreateObjectNode=" + en.printNode(0));
6167 int numArgs = en.numArgs();
6168 NodeTupleSet argSet = new NodeTupleSet();
6170 for (int i = 0; i < numArgs; i++) {
6171 analyzeFlowExpressionNode(md, nametable, en.getArg(i), argSet, null, implicitFlowTupleSet,
6175 // System.out.println("###argSet=" + argSet);
6176 nodeSet.addTupleSet(argSet);
6180 private void analyzeFlowOpNode(MethodDescriptor md, SymbolTable nametable, OpNode on,
6181 NodeTupleSet nodeSet, NodeTupleSet implicitFlowTupleSet) {
6183 NodeTupleSet leftOpSet = new NodeTupleSet();
6184 NodeTupleSet rightOpSet = new NodeTupleSet();
6186 // System.out.println("analyzeFlowOpNode=" + on.printNode(0));
6189 analyzeFlowExpressionNode(md, nametable, on.getLeft(), leftOpSet, null, implicitFlowTupleSet,
6192 if (on.getRight() != null) {
6194 analyzeFlowExpressionNode(md, nametable, on.getRight(), rightOpSet, null,
6195 implicitFlowTupleSet, false);
6198 Operation op = on.getOp();
6200 switch (op.getOp()) {
6202 case Operation.UNARYPLUS:
6203 case Operation.UNARYMINUS:
6204 case Operation.LOGIC_NOT:
6206 nodeSet.addTupleSet(leftOpSet);
6209 case Operation.LOGIC_OR:
6210 case Operation.LOGIC_AND:
6211 case Operation.COMP:
6212 case Operation.BIT_OR:
6213 case Operation.BIT_XOR:
6214 case Operation.BIT_AND:
6215 case Operation.ISAVAILABLE:
6216 case Operation.EQUAL:
6217 case Operation.NOTEQUAL:
6224 case Operation.MULT:
6227 case Operation.LEFTSHIFT:
6228 case Operation.RIGHTSHIFT:
6229 case Operation.URIGHTSHIFT:
6231 // there are two operands
6232 nodeSet.addTupleSet(leftOpSet);
6233 nodeSet.addTupleSet(rightOpSet);
6235 nodeSet.addGlobalFlowTupleSet(leftOpSet.getGlobalLocTupleSet());
6236 nodeSet.addGlobalFlowTupleSet(rightOpSet.getGlobalLocTupleSet());
6241 throw new Error(op.toString());
6246 private NTuple<Descriptor> analyzeFlowNameNode(MethodDescriptor md, SymbolTable nametable,
6247 NameNode nn, NodeTupleSet nodeSet, NTuple<Descriptor> base, NodeTupleSet implicitFlowTupleSet) {
6250 base = new NTuple<Descriptor>();
6253 NameDescriptor nd = nn.getName();
6255 if (nd.getBase() != null) {
6257 analyzeFlowExpressionNode(md, nametable, nn.getExpression(), nodeSet, base,
6258 implicitFlowTupleSet, false);
6260 // base node has the top location
6264 String varname = nd.toString();
6265 if (varname.equals("this")) {
6267 base.add(md.getThis());
6271 Descriptor d = (Descriptor) nametable.get(varname);
6273 if (d instanceof VarDescriptor) {
6274 VarDescriptor vd = (VarDescriptor) d;
6276 } else if (d instanceof FieldDescriptor) {
6277 // the type of field descriptor has a location!
6278 FieldDescriptor fd = (FieldDescriptor) d;
6279 if (fd.isStatic()) {
6281 // if it is 'static final', no need to have flow node for the TOP
6285 // if 'static', assign the default GLOBAL LOCATION to the first
6286 // element of the tuple
6287 base.add(GLOBALDESC);
6290 // the location of field access starts from this, followed by field
6292 base.add(md.getThis());
6296 } else if (d == null) {
6297 // access static field
6298 base.add(GLOBALDESC);
6299 base.add(nn.getField());
6302 // FieldDescriptor fd = nn.getField();addFlowGraphEdge
6304 // MethodLattice<String> localLattice = ssjava.getMethodLattice(md);
6305 // String globalLocId = localLattice.getGlobalLoc();
6306 // if (globalLocId == null) {
6308 // Error("Method lattice does not define global variable location at "
6309 // + generateErrorMessage(md.getClassDesc(), nn));
6311 // loc.addLocation(new Location(md, globalLocId));
6313 // Location fieldLoc = (Location) fd.getType().getExtension();
6314 // loc.addLocation(fieldLoc);
6320 getFlowGraph(md).createNewFlowNode(base);
6326 private NTuple<Descriptor> analyzeFlowFieldAccessNode(MethodDescriptor md, SymbolTable nametable,
6327 FieldAccessNode fan, NodeTupleSet nodeSet, NTuple<Descriptor> base,
6328 NodeTupleSet implicitFlowTupleSet, boolean isLHS) {
6329 // System.out.println("analyzeFlowFieldAccessNode=" + fan.printNode(0));
6331 String currentArrayAccessNodeExpStr = null;
6332 ExpressionNode left = fan.getExpression();
6333 TypeDescriptor ltd = left.getType();
6334 FieldDescriptor fd = fan.getField();
6335 ArrayAccessNode aan = null;
6337 String varName = null;
6338 if (left.kind() == Kind.NameNode) {
6339 NameDescriptor nd = ((NameNode) left).getName();
6340 varName = nd.toString();
6343 if (ltd.isClassNameRef() || (varName != null && varName.equals("this"))) {
6344 // using a class name directly or access using this
6345 if (fd.isStatic() && fd.isFinal()) {
6350 NodeTupleSet idxNodeTupleSet = new NodeTupleSet();
6352 boolean isArrayCase = false;
6353 if (left instanceof ArrayAccessNode) {
6356 aan = (ArrayAccessNode) left;
6358 currentArrayAccessNodeExpStr = aan.printNode(0);
6359 arrayAccessNodeStack.push(currentArrayAccessNodeExpStr);
6361 left = aan.getExpression();
6362 analyzeFlowExpressionNode(md, nametable, aan.getIndex(), idxNodeTupleSet, base,
6363 implicitFlowTupleSet, isLHS);
6367 analyzeFlowExpressionNode(md, nametable, left, nodeSet, base, implicitFlowTupleSet, isLHS);
6370 // in this case, field is TOP location
6374 NTuple<Descriptor> flowFieldTuple = new NTuple<Descriptor>(base.toList());
6376 if (!left.getType().isPrimitive()) {
6377 if (!fd.getSymbol().equals("length")) {
6378 // array.length access, just have the location of the array
6379 flowFieldTuple.add(fd);
6380 nodeSet.removeTuple(base);
6383 getFlowGraph(md).createNewFlowNode(flowFieldTuple);
6386 for (Iterator<NTuple<Descriptor>> idxIter = idxNodeTupleSet.iterator(); idxIter.hasNext();) {
6387 NTuple<Descriptor> idxTuple = idxIter.next();
6388 getFlowGraph(md).addValueFlowEdge(idxTuple, flowFieldTuple);
6391 GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
6392 for (Iterator<NTuple<Location>> iterator = idxNodeTupleSet.globalIterator(); iterator
6394 NTuple<Location> calleeReturnLocTuple = iterator.next();
6396 globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple,
6397 translateToLocTuple(md, flowFieldTuple));
6401 nodeSet.addTupleSet(idxNodeTupleSet);
6403 // if it is the array case and not the LHS case
6405 arrayAccessNodeStack.pop();
6407 if (arrayAccessNodeStack.isEmpty()
6408 || !arrayAccessNodeStack.peek().startsWith(currentArrayAccessNodeExpStr)) {
6409 NodeTupleSet nodeSetArrayAccessExp = new NodeTupleSet();
6411 nodeSetArrayAccessExp.addTuple(flowFieldTuple);
6412 nodeSetArrayAccessExp.addTupleSet(idxNodeTupleSet);
6413 nodeSetArrayAccessExp.addTupleSet(nodeSet);
6415 if (needToGenerateInterLoc(nodeSetArrayAccessExp)) {
6416 // System.out.println("nodeSetArrayAccessExp=" + nodeSetArrayAccessExp);
6417 // System.out.println("idxNodeTupleSet.getGlobalLocTupleSet()="
6418 // + idxNodeTupleSet.getGlobalLocTupleSet());
6420 NTuple<Descriptor> interTuple =
6421 getFlowGraph(md).createIntermediateNode().getDescTuple();
6423 for (Iterator<NTuple<Descriptor>> iter = nodeSetArrayAccessExp.iterator(); iter
6425 NTuple<Descriptor> higherTuple = iter.next();
6426 addFlowGraphEdge(md, higherTuple, interTuple);
6429 FlowGraph fg = getFlowGraph(md);
6430 fg.addMapInterLocNodeToEnclosingDescriptor(interTuple.get(0),
6431 getClassTypeDescriptor(base.get(base.size() - 1)));
6434 flowFieldTuple = interTuple;
6436 nodeSet.addGlobalFlowTupleSet(idxNodeTupleSet.getGlobalLocTupleSet());
6442 return flowFieldTuple;
6447 private void debug_printTreeNode(TreeNode tn) {
6449 System.out.println("DEBUG: " + tn.printNode(0) + " line#=" + tn.getNumLine());
6453 private void analyzeFlowAssignmentNode(MethodDescriptor md, SymbolTable nametable,
6454 AssignmentNode an, NodeTupleSet nodeSet, NTuple<Descriptor> base,
6455 NodeTupleSet implicitFlowTupleSet) {
6457 NodeTupleSet nodeSetRHS = new NodeTupleSet();
6458 NodeTupleSet nodeSetLHS = new NodeTupleSet();
6460 boolean postinc = true;
6461 if (an.getOperation().getBaseOp() == null
6462 || (an.getOperation().getBaseOp().getOp() != Operation.POSTINC && an.getOperation()
6463 .getBaseOp().getOp() != Operation.POSTDEC)) {
6466 // if LHS is array access node, need to capture value flows between an array
6467 // and its index value
6468 analyzeFlowExpressionNode(md, nametable, an.getDest(), nodeSetLHS, null, implicitFlowTupleSet,
6472 // analyze value flows of rhs expression
6473 analyzeFlowExpressionNode(md, nametable, an.getSrc(), nodeSetRHS, null, implicitFlowTupleSet,
6476 // System.out.println("-analyzeFlowAssignmentNode=" + an.printNode(0));
6477 // System.out.println("-nodeSetLHS=" + nodeSetLHS);
6478 // System.out.println("-nodeSetRHS=" + nodeSetRHS);
6479 // System.out.println("-implicitFlowTupleSet=" + implicitFlowTupleSet);
6480 // System.out.println("-");
6482 if (an.getOperation().getOp() >= 2 && an.getOperation().getOp() <= 12) {
6483 // if assignment contains OP+EQ operator, creates edges from LHS to LHS
6485 for (Iterator<NTuple<Descriptor>> iter = nodeSetLHS.iterator(); iter.hasNext();) {
6486 NTuple<Descriptor> fromTuple = iter.next();
6487 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
6488 NTuple<Descriptor> toTuple = iter2.next();
6489 addFlowGraphEdge(md, fromTuple, toTuple);
6494 // creates edges from RHS to LHS
6495 NTuple<Descriptor> interTuple = null;
6496 if (needToGenerateInterLoc(nodeSetRHS)) {
6497 interTuple = getFlowGraph(md).createIntermediateNode().getDescTuple();
6500 for (Iterator<NTuple<Descriptor>> iter = nodeSetRHS.iterator(); iter.hasNext();) {
6501 NTuple<Descriptor> fromTuple = iter.next();
6502 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
6503 NTuple<Descriptor> toTuple = iter2.next();
6504 addFlowGraphEdge(md, fromTuple, interTuple, toTuple);
6508 // creates edges from implicitFlowTupleSet to LHS
6509 for (Iterator<NTuple<Descriptor>> iter = implicitFlowTupleSet.iterator(); iter.hasNext();) {
6510 NTuple<Descriptor> fromTuple = iter.next();
6511 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
6512 NTuple<Descriptor> toTuple = iter2.next();
6513 addFlowGraphEdge(md, fromTuple, toTuple);
6517 // create global flow edges if the callee gives return value flows to the caller
6518 GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
6519 for (Iterator<NTuple<Location>> iterator = nodeSetRHS.globalIterator(); iterator.hasNext();) {
6520 NTuple<Location> calleeReturnLocTuple = iterator.next();
6521 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
6522 NTuple<Descriptor> callerLHSTuple = iter2.next();
6523 // System.out.println("$$$ GLOBAL FLOW ADD=" + calleeReturnLocTuple + " -> "
6524 // + translateToLocTuple(md, callerLHSTuple));
6526 globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple,
6527 translateToLocTuple(md, callerLHSTuple));
6531 for (Iterator<NTuple<Location>> iterator = implicitFlowTupleSet.globalIterator(); iterator
6533 NTuple<Location> calleeReturnLocTuple = iterator.next();
6534 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
6535 NTuple<Descriptor> callerLHSTuple = iter2.next();
6537 globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple,
6538 translateToLocTuple(md, callerLHSTuple));
6539 // System.out.println("$$$ GLOBAL FLOW PCLOC ADD=" + calleeReturnLocTuple + " -> "
6540 // + translateToLocTuple(md, callerLHSTuple));
6547 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
6548 NTuple<Descriptor> tuple = iter2.next();
6549 addFlowGraphEdge(md, tuple, tuple);
6552 // creates edges from implicitFlowTupleSet to LHS
6553 for (Iterator<NTuple<Descriptor>> iter = implicitFlowTupleSet.iterator(); iter.hasNext();) {
6554 NTuple<Descriptor> fromTuple = iter.next();
6555 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
6556 NTuple<Descriptor> toTuple = iter2.next();
6557 addFlowGraphEdge(md, fromTuple, toTuple);
6561 GlobalFlowGraph globalFlowGraph = getSubGlobalFlowGraph(md);
6562 for (Iterator<NTuple<Location>> iterator = implicitFlowTupleSet.globalIterator(); iterator
6564 NTuple<Location> calleeReturnLocTuple = iterator.next();
6565 for (Iterator<NTuple<Descriptor>> iter2 = nodeSetLHS.iterator(); iter2.hasNext();) {
6566 NTuple<Descriptor> callerLHSTuple = iter2.next();
6567 globalFlowGraph.addValueFlowEdge(calleeReturnLocTuple,
6568 translateToLocTuple(md, callerLHSTuple));
6569 // System.out.println("$$$ GLOBAL FLOW PC ADD=" + calleeReturnLocTuple + " -> "
6570 // + translateToLocTuple(md, callerLHSTuple));
6576 if (nodeSet != null) {
6577 nodeSet.addTupleSet(nodeSetLHS);
6578 nodeSet.addGlobalFlowTupleSet(nodeSetLHS.getGlobalLocTupleSet());
6582 public FlowGraph getFlowGraph(MethodDescriptor md) {
6583 return mapMethodDescriptorToFlowGraph.get(md);
6586 private boolean addFlowGraphEdge(MethodDescriptor md, NTuple<Descriptor> from,
6587 NTuple<Descriptor> to) {
6588 FlowGraph graph = getFlowGraph(md);
6589 graph.addValueFlowEdge(from, to);
6593 private void addFlowGraphEdge(MethodDescriptor md, NTuple<Descriptor> from,
6594 NTuple<Descriptor> inter, NTuple<Descriptor> to) {
6596 FlowGraph graph = getFlowGraph(md);
6598 if (inter != null) {
6599 graph.addValueFlowEdge(from, inter);
6600 graph.addValueFlowEdge(inter, to);
6602 graph.addValueFlowEdge(from, to);
6607 public void writeInferredLatticeDotFile(ClassDescriptor cd, SSJavaLattice<String> locOrder,
6608 String nameSuffix) {
6609 // System.out.println("@cd=" + cd);
6610 // System.out.println("@sharedLoc=" + locOrder.getSharedLocSet());
6611 writeInferredLatticeDotFile(cd, null, locOrder, nameSuffix);
6614 public void writeInferredLatticeDotFile(ClassDescriptor cd, MethodDescriptor md,
6615 SSJavaLattice<String> locOrder, String nameSuffix) {
6617 String fileName = "lattice_";
6620 cd.getSymbol().replaceAll("[\\W_]", "") + "_" + md.toString().replaceAll("[\\W_]", "");
6622 fileName += cd.getSymbol().replaceAll("[\\W_]", "");
6625 fileName += nameSuffix;
6627 System.out.println("***lattice=" + fileName + " setsize=" + locOrder.getKeySet().size());
6629 Set<Pair<String, String>> pairSet = locOrder.getOrderingPairSet();
6631 Set<String> addedLocSet = new HashSet<String>();
6633 if (pairSet.size() > 0) {
6635 BufferedWriter bw = new BufferedWriter(new FileWriter(fileName + ".dot"));
6637 bw.write("digraph " + fileName + " {\n");
6639 for (Iterator iterator = pairSet.iterator(); iterator.hasNext();) {
6640 // pair is in the form of <higher, lower>
6641 Pair<String, String> pair = (Pair<String, String>) iterator.next();
6643 String highLocId = pair.getFirst();
6644 String lowLocId = pair.getSecond();
6645 if (!addedLocSet.contains(highLocId)) {
6646 addedLocSet.add(highLocId);
6647 drawNode(bw, locOrder, highLocId);
6650 if (!addedLocSet.contains(lowLocId)) {
6651 addedLocSet.add(lowLocId);
6652 drawNode(bw, locOrder, lowLocId);
6655 bw.write(highLocId + " -> " + lowLocId + ";\n");
6660 } catch (IOException e) {
6661 e.printStackTrace();
6668 private String convertMergeSetToString(HierarchyGraph graph, Set<HNode> mergeSet) {
6670 for (Iterator iterator = mergeSet.iterator(); iterator.hasNext();) {
6671 HNode merged = (HNode) iterator.next();
6672 if (merged.isMergeNode()) {
6673 str += convertMergeSetToString(graph, graph.getMapHNodetoMergeSet().get(merged));
6675 str += " " + merged.getName();
6681 public void addNaiveLattice(Descriptor desc, SSJavaLattice<String> lattice) {
6682 desc2naiveLattice.put(desc, lattice);
6685 private void drawNode(BufferedWriter bw, SSJavaLattice<String> lattice, String locName)
6686 throws IOException {
6689 if (lattice.isSharedLoc(locName)) {
6690 prettyStr = locName + "*";
6692 prettyStr = locName;
6694 // HNode node = graph.getHNode(locName);
6695 // if (node != null && node.isMergeNode()) {
6696 // Set<HNode> mergeSet = graph.getMapHNodetoMergeSet().get(node);
6697 // prettyStr += ":" + convertMergeSetToString(graph, mergeSet);
6699 bw.write(locName + " [label=\"" + prettyStr + "\"]" + ";\n");
6702 public void _debug_writeFlowGraph() {
6703 Set<MethodDescriptor> keySet = mapMethodDescriptorToFlowGraph.keySet();
6705 for (Iterator<MethodDescriptor> iterator = keySet.iterator(); iterator.hasNext();) {
6706 MethodDescriptor md = (MethodDescriptor) iterator.next();
6707 FlowGraph fg = mapMethodDescriptorToFlowGraph.get(md);
6708 GlobalFlowGraph subGlobalFlowGraph = getSubGlobalFlowGraph(md);
6711 subGlobalFlowGraph.writeGraph("_SUBGLOBAL");
6712 } catch (IOException e) {
6713 e.printStackTrace();
6721 class CyclicFlowException extends Exception {
6725 class InterDescriptor extends Descriptor {
6727 Pair<MethodInvokeNode, Integer> minArgIdxPair;
6729 public InterDescriptor(String name) {
6733 public void setMethodArgIdxPair(MethodInvokeNode min, int idx) {
6734 minArgIdxPair = new Pair<MethodInvokeNode, Integer>(min, new Integer(idx));
6737 public Pair<MethodInvokeNode, Integer> getMethodArgIdxPair() {
6738 return minArgIdxPair;