1 package Analysis.Disjoint;
3 import Analysis.CallGraph.*;
4 import Analysis.Liveness;
5 import Analysis.ArrayReferencees;
6 import Analysis.OoOJava.Accessible;
7 import Analysis.OoOJava.RBlockRelationAnalysis;
8 import Analysis.FlatIRGraph.*;
11 import IR.Tree.Modifiers;
16 public class DisjointAnalysis implements HeapAnalysis {
19 ///////////////////////////////////////////
21 // Public interface to discover possible
22 // sharing in the program under analysis
24 ///////////////////////////////////////////
26 // if an object allocated at the target site may be
27 // reachable from both an object from root1 and an
28 // object allocated at root2, return TRUE
29 public boolean mayBothReachTarget(FlatMethod fm,
34 AllocSite asr1 = getAllocationSiteFromFlatNew(fnRoot1);
35 AllocSite asr2 = getAllocationSiteFromFlatNew(fnRoot2);
36 assert asr1.isFlagged();
37 assert asr2.isFlagged();
39 AllocSite ast = getAllocationSiteFromFlatNew(fnTarget);
40 ReachGraph rg = getPartial(fm.getMethod() );
42 return rg.mayBothReachTarget(asr1, asr2, ast);
45 // similar to the method above, return TRUE if ever
46 // more than one object from the root allocation site
47 // may reach an object from the target site
48 public boolean mayManyReachTarget(FlatMethod fm,
52 AllocSite asr = getAllocationSiteFromFlatNew(fnRoot);
53 assert asr.isFlagged();
55 AllocSite ast = getAllocationSiteFromFlatNew(fnTarget);
56 ReachGraph rg = getPartial(fm.getMethod() );
58 return rg.mayManyReachTarget(asr, ast);
64 public HashSet<AllocSite>
65 getFlaggedAllocationSitesReachableFromTask(TaskDescriptor td) {
66 checkAnalysisComplete();
67 return getFlaggedAllocationSitesReachableFromTaskPRIVATE(td);
70 public AllocSite getAllocationSiteFromFlatNew(FlatNew fn) {
71 checkAnalysisComplete();
72 return getAllocSiteFromFlatNewPRIVATE(fn);
75 public AllocSite getAllocationSiteFromHeapRegionNodeID(Integer id) {
76 checkAnalysisComplete();
77 return mapHrnIdToAllocSite.get(id);
80 public Set<HeapRegionNode> hasPotentialSharing(Descriptor taskOrMethod,
83 checkAnalysisComplete();
84 ReachGraph rg=mapDescriptorToCompleteReachGraph.get(taskOrMethod);
85 FlatMethod fm=state.getMethodFlat(taskOrMethod);
87 return rg.mayReachSharedObjects(fm, paramIndex1, paramIndex2);
90 public Set<HeapRegionNode> hasPotentialSharing(Descriptor taskOrMethod,
91 int paramIndex, AllocSite alloc) {
92 checkAnalysisComplete();
93 ReachGraph rg = mapDescriptorToCompleteReachGraph.get(taskOrMethod);
94 FlatMethod fm=state.getMethodFlat(taskOrMethod);
96 return rg.mayReachSharedObjects(fm, paramIndex, alloc);
99 public Set<HeapRegionNode> hasPotentialSharing(Descriptor taskOrMethod,
100 AllocSite alloc, int paramIndex) {
101 checkAnalysisComplete();
102 ReachGraph rg = mapDescriptorToCompleteReachGraph.get(taskOrMethod);
103 FlatMethod fm=state.getMethodFlat(taskOrMethod);
105 return rg.mayReachSharedObjects(fm, paramIndex, alloc);
108 public Set<HeapRegionNode> hasPotentialSharing(Descriptor taskOrMethod,
109 AllocSite alloc1, AllocSite alloc2) {
110 checkAnalysisComplete();
111 ReachGraph rg = mapDescriptorToCompleteReachGraph.get(taskOrMethod);
113 return rg.mayReachSharedObjects(alloc1, alloc2);
116 public String prettyPrintNodeSet(Set<HeapRegionNode> s) {
117 checkAnalysisComplete();
121 Iterator<HeapRegionNode> i = s.iterator();
122 while (i.hasNext()) {
123 HeapRegionNode n = i.next();
125 AllocSite as = n.getAllocSite();
127 out += " " + n.toString() + ",\n";
129 out += " " + n.toString() + ": " + as.toStringVerbose()
138 // use the methods given above to check every possible sharing class
139 // between task parameters and flagged allocation sites reachable
141 public void writeAllSharing(String outputFile,
144 boolean tabularOutput,
147 throws java.io.IOException {
148 checkAnalysisComplete();
150 BufferedWriter bw = new BufferedWriter(new FileWriter(outputFile));
152 if (!tabularOutput) {
153 bw.write("Conducting ownership analysis with allocation depth = "
154 + allocationDepth + "\n");
155 bw.write(timeReport + "\n");
160 // look through every task for potential sharing
161 Iterator taskItr = state.getTaskSymbolTable().getDescriptorsIterator();
162 while (taskItr.hasNext()) {
163 TaskDescriptor td = (TaskDescriptor) taskItr.next();
165 if (!tabularOutput) {
166 bw.write("\n---------" + td + "--------\n");
169 HashSet<AllocSite> allocSites = getFlaggedAllocationSitesReachableFromTask(td);
171 Set<HeapRegionNode> common;
173 // for each task parameter, check for sharing classes with
174 // other task parameters and every allocation site
175 // reachable from this task
176 boolean foundSomeSharing = false;
178 FlatMethod fm = state.getMethodFlat(td);
179 for (int i = 0; i < fm.numParameters(); ++i) {
181 // skip parameters with types that cannot reference
183 if( !shouldAnalysisTrack(fm.getParameter(i).getType() ) ) {
187 // for the ith parameter check for sharing classes to all
188 // higher numbered parameters
189 for (int j = i + 1; j < fm.numParameters(); ++j) {
191 // skip parameters with types that cannot reference
193 if( !shouldAnalysisTrack(fm.getParameter(j).getType() ) ) {
198 common = hasPotentialSharing(td, i, j);
199 if (!common.isEmpty()) {
200 foundSomeSharing = true;
202 if (!tabularOutput) {
203 bw.write("Potential sharing between parameters " + i
204 + " and " + j + ".\n");
205 bw.write(prettyPrintNodeSet(common) + "\n");
210 // for the ith parameter, check for sharing classes against
211 // the set of allocation sites reachable from this
213 Iterator allocItr = allocSites.iterator();
214 while (allocItr.hasNext()) {
215 AllocSite as = (AllocSite) allocItr.next();
216 common = hasPotentialSharing(td, i, as);
217 if (!common.isEmpty()) {
218 foundSomeSharing = true;
220 if (!tabularOutput) {
221 bw.write("Potential sharing between parameter " + i
222 + " and " + as.getFlatNew() + ".\n");
223 bw.write(prettyPrintNodeSet(common) + "\n");
229 // for each allocation site check for sharing classes with
230 // other allocation sites in the context of execution
232 HashSet<AllocSite> outerChecked = new HashSet<AllocSite>();
233 Iterator allocItr1 = allocSites.iterator();
234 while (allocItr1.hasNext()) {
235 AllocSite as1 = (AllocSite) allocItr1.next();
237 Iterator allocItr2 = allocSites.iterator();
238 while (allocItr2.hasNext()) {
239 AllocSite as2 = (AllocSite) allocItr2.next();
241 if (!outerChecked.contains(as2)) {
242 common = hasPotentialSharing(td, as1, as2);
244 if (!common.isEmpty()) {
245 foundSomeSharing = true;
247 if (!tabularOutput) {
248 bw.write("Potential sharing between "
249 + as1.getFlatNew() + " and "
250 + as2.getFlatNew() + ".\n");
251 bw.write(prettyPrintNodeSet(common) + "\n");
257 outerChecked.add(as1);
260 if (!foundSomeSharing) {
261 if (!tabularOutput) {
262 bw.write("No sharing between flagged objects in Task " + td
270 bw.write(" & " + numSharing + " & " + justTime + " & " + numLines
271 + " & " + numMethodsAnalyzed() + " \\\\\n");
273 bw.write("\nNumber sharing classes: "+numSharing);
281 // this version of writeAllSharing is for Java programs that have no tasks
282 // ***********************************
283 // WARNING: THIS DOES NOT DO THE RIGHT THING, REPORTS 0 ALWAYS!
284 // It should use mayBothReachTarget and mayManyReachTarget like
285 // OoOJava does to query analysis results
286 // ***********************************
287 public void writeAllSharingJava(String outputFile,
290 boolean tabularOutput,
293 throws java.io.IOException {
294 checkAnalysisComplete();
300 BufferedWriter bw = new BufferedWriter(new FileWriter(outputFile));
302 bw.write("Conducting disjoint reachability analysis with allocation depth = "
303 + allocationDepth + "\n");
304 bw.write(timeReport + "\n\n");
306 boolean foundSomeSharing = false;
308 Descriptor d = typeUtil.getMain();
309 HashSet<AllocSite> allocSites = getFlaggedAllocationSites(d);
311 // for each allocation site check for sharing classes with
312 // other allocation sites in the context of execution
314 HashSet<AllocSite> outerChecked = new HashSet<AllocSite>();
315 Iterator allocItr1 = allocSites.iterator();
316 while (allocItr1.hasNext()) {
317 AllocSite as1 = (AllocSite) allocItr1.next();
319 Iterator allocItr2 = allocSites.iterator();
320 while (allocItr2.hasNext()) {
321 AllocSite as2 = (AllocSite) allocItr2.next();
323 if (!outerChecked.contains(as2)) {
324 Set<HeapRegionNode> common = hasPotentialSharing(d,
327 if (!common.isEmpty()) {
328 foundSomeSharing = true;
329 bw.write("Potential sharing between "
330 + as1.getDisjointAnalysisId() + " and "
331 + as2.getDisjointAnalysisId() + ".\n");
332 bw.write(prettyPrintNodeSet(common) + "\n");
338 outerChecked.add(as1);
341 if (!foundSomeSharing) {
342 bw.write("No sharing classes between flagged objects found.\n");
344 bw.write("\nNumber sharing classes: "+numSharing);
347 bw.write("Number of methods analyzed: "+numMethodsAnalyzed()+"\n");
354 public Alloc getCmdLineArgsAlloc() {
355 return getAllocationSiteFromFlatNew( constructedCmdLineArgsNew );
357 public Alloc getCmdLineArgAlloc() {
358 return getAllocationSiteFromFlatNew( constructedCmdLineArgNew );
360 public Alloc getCmdLineArgBytesAlloc() {
361 return getAllocationSiteFromFlatNew( constructedCmdLineArgBytesNew );
363 public Alloc getNewStringLiteralAlloc() {
364 return newStringLiteralAlloc;
366 public Alloc getNewStringLiteralBytesAlloc() {
367 return newStringLiteralBytesAlloc;
370 ///////////////////////////////////////////
372 // end public interface
374 ///////////////////////////////////////////
378 protected void checkAnalysisComplete() {
379 if( !analysisComplete ) {
380 throw new Error("Warning: public interface method called while analysis is running.");
389 // run in faster mode, only when bugs wrung out!
390 public static boolean releaseMode;
392 // use command line option to set this, analysis
393 // should attempt to be deterministic
394 public static boolean determinismDesired;
396 // when we want to enforce determinism in the
397 // analysis we need to sort descriptors rather
398 // than toss them in efficient sets, use this
399 public static DescriptorComparator dComp =
400 new DescriptorComparator();
403 // data from the compiler
405 public CallGraph callGraph;
406 public Liveness liveness;
407 public ArrayReferencees arrayReferencees;
408 public RBlockRelationAnalysis rblockRel;
409 public TypeUtil typeUtil;
410 public int allocationDepth;
412 protected boolean doEffectsAnalysis = false;
413 protected EffectsAnalysis effectsAnalysis;
414 protected BuildStateMachines buildStateMachines;
416 protected boolean doDefiniteReachAnalysis = false;
417 protected DefiniteReachAnalysis definiteReachAnalysis;
419 protected boolean summarizePerClass = false;
422 // data structure for public interface
423 private Hashtable< Descriptor, HashSet<AllocSite> >
424 mapDescriptorToAllocSiteSet;
427 // for public interface methods to warn that they
428 // are grabbing results during analysis
429 private boolean analysisComplete;
432 // used to identify HeapRegionNode objects
433 // A unique ID equates an object in one
434 // ownership graph with an object in another
435 // graph that logically represents the same
437 // start at 10 and increment to reserve some
438 // IDs for special purposes
439 static protected int uniqueIDcount = 10;
442 // An out-of-scope method created by the
443 // analysis that has no parameters, and
444 // appears to allocate the command line
445 // arguments, then invoke the source code's
446 // main method. The purpose of this is to
447 // provide the analysis with an explicit
448 // top-level context with no parameters
449 protected MethodDescriptor mdAnalysisEntry;
450 protected FlatMethod fmAnalysisEntry;
452 // main method defined by source program
453 protected MethodDescriptor mdSourceEntry;
455 // the set of task and/or method descriptors
456 // reachable in call graph
457 protected Set<Descriptor>
458 descriptorsToAnalyze;
460 // current descriptors to visit in fixed-point
461 // interprocedural analysis, prioritized by
462 // dependency in the call graph
463 protected Stack<Descriptor>
464 descriptorsToVisitStack;
465 protected PriorityQueue<DescriptorQWrapper>
468 // a duplication of the above structure, but
469 // for efficient testing of inclusion
470 protected HashSet<Descriptor>
471 descriptorsToVisitSet;
473 // storage for priorities (doesn't make sense)
474 // to add it to the Descriptor class, just in
476 protected Hashtable<Descriptor, Integer>
477 mapDescriptorToPriority;
479 // when analyzing a method and scheduling more:
480 // remember set of callee's enqueued for analysis
481 // so they can be put on top of the callers in
482 // the stack-visit mode
483 protected Set<Descriptor>
486 // maps a descriptor to its current partial result
487 // from the intraprocedural fixed-point analysis--
488 // then the interprocedural analysis settles, this
489 // mapping will have the final results for each
491 protected Hashtable<Descriptor, ReachGraph>
492 mapDescriptorToCompleteReachGraph;
494 // maps a descriptor to its known dependents: namely
495 // methods or tasks that call the descriptor's method
496 // AND are part of this analysis (reachable from main)
497 protected Hashtable< Descriptor, Set<Descriptor> >
498 mapDescriptorToSetDependents;
500 // if the analysis client wants to flag allocation sites
501 // programmatically, it should provide a set of FlatNew
502 // statements--this may be null if unneeded
503 protected Set<FlatNew> sitesToFlag;
505 // maps each flat new to one analysis abstraction
506 // allocate site object, these exist outside reach graphs
507 protected Hashtable<FlatNew, AllocSite>
508 mapFlatNewToAllocSite;
510 // if using summarize-per-class then use this to keep
511 // one alloc site per Type (picks up primitives too)
512 protected Hashtable<TypeDescriptor, AllocSite> mapTypeToAllocSite;
513 protected HashSet<TypeDescriptor> typesToFlag;
515 // maps intergraph heap region IDs to intergraph
516 // allocation sites that created them, a redundant
517 // structure for efficiency in some operations
518 protected Hashtable<Integer, AllocSite>
521 // maps a method to its initial heap model (IHM) that
522 // is the set of reachability graphs from every caller
523 // site, all merged together. The reason that we keep
524 // them separate is that any one call site's contribution
525 // to the IHM may changed along the path to the fixed point
526 protected Hashtable< Descriptor, Hashtable< FlatCall, ReachGraph > >
527 mapDescriptorToIHMcontributions;
529 // additionally, keep a mapping from descriptors to the
530 // merged in-coming initial context, because we want this
531 // initial context to be STRICTLY MONOTONIC
532 protected Hashtable<Descriptor, ReachGraph>
533 mapDescriptorToInitialContext;
535 // mapping of current partial results for a given node. Note that
536 // to reanalyze a method we discard all partial results because a
537 // null reach graph indicates the node needs to be visited on the
538 // way to the fixed point.
539 // The reason for a persistent mapping is so after the analysis we
540 // can ask for the graph of any node at the fixed point, but this
541 // option is only enabled with a compiler flag.
542 protected Hashtable<FlatNode, ReachGraph> mapFlatNodeToReachGraphPersist;
543 protected Hashtable<FlatNode, ReachGraph> mapFlatNodeToReachGraph;
546 // make the result for back edges analysis-wide STRICTLY
547 // MONOTONIC as well, but notice we use FlatNode as the
548 // key for this map: in case we want to consider other
549 // nodes as back edge's in future implementations
550 protected Hashtable<FlatNode, ReachGraph>
551 mapBackEdgeToMonotone;
554 public static final String arrayElementFieldName = "___element_";
555 static protected Hashtable<TypeDescriptor, FieldDescriptor>
559 protected boolean suppressOutput;
561 // for controlling DOT file output
562 protected boolean writeFinalDOTs;
563 protected boolean writeAllIncrementalDOTs;
565 // supporting DOT output--when we want to write every
566 // partial method result, keep a tally for generating
568 protected Hashtable<Descriptor, Integer>
569 mapDescriptorToNumUpdates;
571 //map task descriptor to initial task parameter
572 protected Hashtable<Descriptor, ReachGraph>
573 mapDescriptorToReachGraph;
575 protected PointerMethod pm;
577 //Keeps track of all the reach graphs at every program point
578 //DO NOT USE UNLESS YOU REALLY NEED IT
579 static protected Hashtable<FlatNode, ReachGraph> fn2rgAtEnter =
580 new Hashtable<FlatNode, ReachGraph>();
582 static protected Hashtable<FlatNode, ReachGraph> fn2rgAtExit =
583 new Hashtable<FlatNode, ReachGraph>();
586 private Hashtable<FlatCall, Descriptor> fc2enclosing;
588 Accessible accessible;
591 // we construct an entry method of flat nodes complete
592 // with a new allocation site to model the command line
593 // args creation just for the analysis, so remember that
594 // allocation site. Later in code gen we might want to
595 // know if something is pointing-to to the cmd line args
596 // and we can verify by checking the allocation site field.
597 protected FlatNew constructedCmdLineArgsNew;
598 protected FlatNew constructedCmdLineArgNew;
599 protected FlatNew constructedCmdLineArgBytesNew;
601 // similar to above, the runtime allocates new strings
602 // for literal nodes, so make up an alloc to model that
603 protected AllocSite newStringLiteralAlloc;
604 protected AllocSite newStringLiteralBytesAlloc;
606 // both of the above need the descriptor of the field
607 // for the String's value field to reference by the
608 // byte array from the string object
609 protected TypeDescriptor stringType;
610 protected TypeDescriptor stringBytesType;
611 protected FieldDescriptor stringBytesField;
614 protected void initImplicitStringsModel() {
616 ClassDescriptor cdString = typeUtil.getClass( typeUtil.StringClass );
617 assert cdString != null;
621 new TypeDescriptor( cdString );
624 new TypeDescriptor(TypeDescriptor.CHAR).makeArray( state );
627 stringBytesField = null;
628 Iterator sFieldsItr = cdString.getFields();
629 while( sFieldsItr.hasNext() ) {
630 FieldDescriptor fd = (FieldDescriptor) sFieldsItr.next();
631 if( fd.getSymbol().equals( typeUtil.StringClassValueField ) ) {
632 stringBytesField = fd;
636 assert stringBytesField != null;
639 TempDescriptor throwAway1 =
640 new TempDescriptor("stringLiteralTemp_dummy1",
643 FlatNew fnStringLiteral =
644 new FlatNew(stringType,
648 newStringLiteralAlloc
649 = getAllocSiteFromFlatNewPRIVATE( fnStringLiteral );
652 TempDescriptor throwAway2 =
653 new TempDescriptor("stringLiteralTemp_dummy2",
656 FlatNew fnStringLiteralBytes =
657 new FlatNew(stringBytesType,
661 newStringLiteralBytesAlloc
662 = getAllocSiteFromFlatNewPRIVATE( fnStringLiteralBytes );
668 // allocate various structures that are not local
669 // to a single class method--should be done once
670 protected void allocateStructures() {
672 if( determinismDesired ) {
673 // use an ordered set
674 descriptorsToAnalyze = new TreeSet<Descriptor>(dComp);
676 // otherwise use a speedy hashset
677 descriptorsToAnalyze = new HashSet<Descriptor>();
680 mapDescriptorToCompleteReachGraph =
681 new Hashtable<Descriptor, ReachGraph>();
683 mapDescriptorToNumUpdates =
684 new Hashtable<Descriptor, Integer>();
686 mapDescriptorToSetDependents =
687 new Hashtable< Descriptor, Set<Descriptor> >();
689 mapFlatNewToAllocSite =
690 new Hashtable<FlatNew, AllocSite>();
692 mapDescriptorToIHMcontributions =
693 new Hashtable< Descriptor, Hashtable< FlatCall, ReachGraph > >();
695 mapDescriptorToInitialContext =
696 new Hashtable<Descriptor, ReachGraph>();
698 mapFlatNodeToReachGraphPersist =
699 new Hashtable<FlatNode, ReachGraph>();
701 mapBackEdgeToMonotone =
702 new Hashtable<FlatNode, ReachGraph>();
704 mapHrnIdToAllocSite =
705 new Hashtable<Integer, AllocSite>();
707 mapTypeToArrayField =
708 new Hashtable <TypeDescriptor, FieldDescriptor>();
710 if( state.DISJOINTDVISITSTACK ||
711 state.DISJOINTDVISITSTACKEESONTOP
713 descriptorsToVisitStack =
714 new Stack<Descriptor>();
717 if( state.DISJOINTDVISITPQUE ) {
718 descriptorsToVisitQ =
719 new PriorityQueue<DescriptorQWrapper>();
722 descriptorsToVisitSet =
723 new HashSet<Descriptor>();
725 mapDescriptorToPriority =
726 new Hashtable<Descriptor, Integer>();
729 new HashSet<Descriptor>();
731 mapDescriptorToAllocSiteSet =
732 new Hashtable<Descriptor, HashSet<AllocSite> >();
734 mapDescriptorToReachGraph =
735 new Hashtable<Descriptor, ReachGraph>();
737 fc2enclosing = new Hashtable<FlatCall, Descriptor>();
739 if( summarizePerClass ) {
740 mapTypeToAllocSite = new Hashtable<TypeDescriptor, AllocSite>();
741 typesToFlag = new HashSet<TypeDescriptor>();
747 // this analysis generates a disjoint reachability
748 // graph for every reachable method in the program
749 public DisjointAnalysis(State s,
754 Set<FlatNew> sitesToFlag,
755 RBlockRelationAnalysis rra
757 init(s, tu, cg, l, ar, sitesToFlag, rra, null, false);
760 public DisjointAnalysis(State s,
765 Set<FlatNew> sitesToFlag,
766 RBlockRelationAnalysis rra,
767 boolean suppressOutput
769 init(s, tu, cg, l, ar, sitesToFlag, rra, null, suppressOutput);
772 public DisjointAnalysis(State s,
777 Set<FlatNew> sitesToFlag,
778 RBlockRelationAnalysis rra,
779 BuildStateMachines bsm,
780 boolean suppressOutput
782 init(s, tu, cg, l, ar, sitesToFlag, rra, bsm, suppressOutput);
785 protected void init(State state,
789 ArrayReferencees arrayReferencees,
790 Set<FlatNew> sitesToFlag,
791 RBlockRelationAnalysis rra,
792 BuildStateMachines bsm,
793 boolean suppressOutput
796 analysisComplete = false;
799 this.typeUtil = typeUtil;
800 this.callGraph = callGraph;
801 this.liveness = liveness;
802 this.arrayReferencees = arrayReferencees;
803 this.sitesToFlag = sitesToFlag;
804 this.rblockRel = rra;
805 this.suppressOutput = suppressOutput;
806 this.buildStateMachines = bsm;
808 if( rblockRel != null ) {
809 doEffectsAnalysis = true;
810 effectsAnalysis = new EffectsAnalysis();
812 EffectsAnalysis.state = state;
813 EffectsAnalysis.buildStateMachines = buildStateMachines;
815 //note: instead of reachgraph's isAccessible, using the result of accessible analysis
816 //since accessible gives us more accurate results
817 accessible=new Accessible(state, callGraph, rra, liveness);
818 accessible.doAnalysis();
821 this.allocationDepth = state.DISJOINTALLOCDEPTH;
822 this.releaseMode = state.DISJOINTRELEASEMODE;
823 this.determinismDesired = state.DISJOINTDETERMINISM;
825 this.writeFinalDOTs = state.DISJOINTWRITEDOTS && !state.DISJOINTWRITEALL;
826 this.writeAllIncrementalDOTs = state.DISJOINTWRITEDOTS && state.DISJOINTWRITEALL;
828 this.takeDebugSnapshots = state.DISJOINTSNAPSYMBOL != null;
829 this.descSymbolDebug = state.DISJOINTSNAPSYMBOL;
830 this.visitStartCapture = state.DISJOINTSNAPVISITTOSTART;
831 this.numVisitsToCapture = state.DISJOINTSNAPNUMVISITS;
832 this.stopAfterCapture = state.DISJOINTSNAPSTOPAFTER;
833 this.snapVisitCounter = 1; // count visits from 1 (user will write 1, means 1st visit)
834 this.snapNodeCounter = 0; // count nodes from 0
837 state.DISJOINTDVISITSTACK ||
838 state.DISJOINTDVISITPQUE ||
839 state.DISJOINTDVISITSTACKEESONTOP;
840 assert !(state.DISJOINTDVISITSTACK && state.DISJOINTDVISITPQUE);
841 assert !(state.DISJOINTDVISITSTACK && state.DISJOINTDVISITSTACKEESONTOP);
842 assert !(state.DISJOINTDVISITPQUE && state.DISJOINTDVISITSTACKEESONTOP);
844 // set some static configuration for ReachGraphs
845 ReachGraph.allocationDepth = allocationDepth;
846 ReachGraph.typeUtil = typeUtil;
847 ReachGraph.state = state;
849 ReachGraph.initOutOfScopeTemps();
851 ReachGraph.debugCallSiteVisitStartCapture
852 = state.DISJOINTDEBUGCALLVISITTOSTART;
854 ReachGraph.debugCallSiteNumVisitsToCapture
855 = state.DISJOINTDEBUGCALLNUMVISITS;
857 ReachGraph.debugCallSiteStopAfter
858 = state.DISJOINTDEBUGCALLSTOPAFTER;
860 ReachGraph.debugCallSiteVisitCounter
861 = 0; // count visits from 1, is incremented before first visit
863 pm = new PointerMethod();
865 if( state.DO_DEFINITE_REACH_ANALYSIS ) {
866 doDefiniteReachAnalysis = true;
867 definiteReachAnalysis = new DefiniteReachAnalysis( pm );
870 if( !state.DISJOINT_USE_GLOBAL_SWEEP ) {
871 ReachGraph.DISABLE_GLOBAL_SWEEP = true;
874 if( !state.DISJOINT_USE_STRONG_UPDATE ) {
875 ReachGraph.DISABLE_STRONG_UPDATES = true;
878 if( !state.DISJOINT_USE_PREDICATES ) {
879 ReachGraph.DISABLE_PREDICATES = true;
880 ExistPredSet.DISABLE_PREDICATES = true;
883 if( state.DISJOINT_SUMMARIZE_PER_CLASS ) {
884 summarizePerClass = true;
887 if( suppressOutput ) {
888 System.out.println("* Running disjoint reachability analysis with output suppressed! *");
892 allocateStructures();
895 if( summarizePerClass && sitesToFlag != null ) {
896 for( FlatNew fnew : sitesToFlag ) {
897 typesToFlag.add( fnew.getType() );
902 initImplicitStringsModel();
906 double timeStartAnalysis = (double) System.nanoTime();
908 // start interprocedural fixed-point computation
911 } catch( IOException e ) {
912 throw new Error("IO Exception while writing disjointness analysis output.");
915 analysisComplete=true;
917 double timeEndAnalysis = (double) System.nanoTime();
918 double dt = (timeEndAnalysis - timeStartAnalysis)/(Math.pow(10.0, 9.0) );
921 if( sitesToFlag != null ) {
922 treport = String.format("Disjoint reachability analysis flagged %d sites and took %.3f sec.", sitesToFlag.size(), dt);
923 if(sitesToFlag.size()>0) {
924 treport+="\nFlagged sites:"+"\n"+sitesToFlag.toString();
927 treport = String.format("Disjoint reachability analysis took %.3f sec.", dt);
929 if( state.DISJOINT_COUNT_VISITS ) {
930 treport += "\nFixed point algorithm visited "+totalMethodVisits+
931 " methods and "+totalNodeVisits+" nodes.";
933 String justtime = String.format("%.2f", dt);
934 System.out.println(treport);
938 if( writeFinalDOTs && !writeAllIncrementalDOTs ) {
942 if( state.DISJOINTWRITEIHMS ) {
946 if( state.DISJOINTWRITEINITCONTEXTS ) {
947 writeInitialContexts();
950 if( state.DISJOINT_WRITE_ALL_NODE_FINAL_GRAPHS ) {
951 writeFinalGraphsForEveryNode();
954 if( state.DISJOINTALIASFILE != null && !suppressOutput ) {
956 writeAllSharing(state.DISJOINTALIASFILE, treport, justtime, state.DISJOINTALIASTAB, state.lines);
958 writeAllSharingJava(state.DISJOINTALIASFILE,
961 state.DISJOINTALIASTAB,
968 buildStateMachines.writeStateMachines();
971 } catch( IOException e ) {
972 throw new Error("IO Exception while writing disjointness analysis output.");
977 protected boolean moreDescriptorsToVisit() {
978 if( state.DISJOINTDVISITSTACK ||
979 state.DISJOINTDVISITSTACKEESONTOP
981 return !descriptorsToVisitStack.isEmpty();
983 } else if( state.DISJOINTDVISITPQUE ) {
984 return !descriptorsToVisitQ.isEmpty();
987 throw new Error("Neither descriptor visiting mode set");
991 // fixed-point computation over the call graph--when a
992 // method's callees are updated, it must be reanalyzed
993 protected void analyzeMethods() throws java.io.IOException {
995 // task or non-task (java) mode determines what the roots
996 // of the call chain are, and establishes the set of methods
997 // reachable from the roots that will be analyzed
1000 if( !suppressOutput ) {
1001 System.out.println("Bamboo mode...");
1004 Iterator taskItr = state.getTaskSymbolTable().getDescriptorsIterator();
1005 while( taskItr.hasNext() ) {
1006 TaskDescriptor td = (TaskDescriptor) taskItr.next();
1007 if( !descriptorsToAnalyze.contains(td) ) {
1008 // add all methods transitively reachable from the
1010 descriptorsToAnalyze.add(td);
1011 descriptorsToAnalyze.addAll(callGraph.getAllMethods(td) );
1016 if( !suppressOutput ) {
1017 System.out.println("Java mode...");
1020 // add all methods transitively reachable from the
1021 // source's main to set for analysis
1022 mdSourceEntry = typeUtil.getMain();
1023 descriptorsToAnalyze.add(mdSourceEntry);
1024 descriptorsToAnalyze.addAll(callGraph.getAllMethods(mdSourceEntry) );
1026 // fabricate an empty calling context that will call
1027 // the source's main, but call graph doesn't know
1028 // about it, so explicitly add it
1029 makeAnalysisEntryMethod(mdSourceEntry);
1030 descriptorsToAnalyze.add(mdAnalysisEntry);
1035 // now, depending on the interprocedural mode for visiting
1036 // methods, set up the needed data structures
1038 if( state.DISJOINTDVISITPQUE ) {
1040 // topologically sort according to the call graph so
1041 // leaf calls are last, helps build contexts up first
1042 LinkedList<Descriptor> sortedDescriptors =
1043 topologicalSort(descriptorsToAnalyze);
1045 // add sorted descriptors to priority queue, and duplicate
1046 // the queue as a set for efficiently testing whether some
1047 // method is marked for analysis
1049 Iterator<Descriptor> dItr;
1051 // for the priority queue, give items at the head
1052 // of the sorted list a low number (highest priority)
1053 while( !sortedDescriptors.isEmpty() ) {
1054 Descriptor d = sortedDescriptors.removeFirst();
1055 mapDescriptorToPriority.put(d, new Integer(p) );
1056 descriptorsToVisitQ.add(new DescriptorQWrapper(p, d) );
1057 descriptorsToVisitSet.add(d);
1061 } else if( state.DISJOINTDVISITSTACK ||
1062 state.DISJOINTDVISITSTACKEESONTOP
1064 // if we're doing the stack scheme, just throw the root
1065 // method or tasks on the stack
1067 Iterator taskItr = state.getTaskSymbolTable().getDescriptorsIterator();
1068 while( taskItr.hasNext() ) {
1069 TaskDescriptor td = (TaskDescriptor) taskItr.next();
1070 descriptorsToVisitStack.add(td);
1071 descriptorsToVisitSet.add(td);
1075 descriptorsToVisitStack.add(mdAnalysisEntry);
1076 descriptorsToVisitSet.add(mdAnalysisEntry);
1080 throw new Error("Unknown method scheduling mode");
1084 // analyze scheduled methods until there are no more to visit
1085 while( moreDescriptorsToVisit() ) {
1086 Descriptor d = null;
1088 if( state.DISJOINTDVISITSTACK ||
1089 state.DISJOINTDVISITSTACKEESONTOP
1091 d = descriptorsToVisitStack.pop();
1093 } else if( state.DISJOINTDVISITPQUE ) {
1094 d = descriptorsToVisitQ.poll().getDescriptor();
1097 assert descriptorsToVisitSet.contains(d);
1098 descriptorsToVisitSet.remove(d);
1100 // because the task or method descriptor just extracted
1101 // was in the "to visit" set it either hasn't been analyzed
1102 // yet, or some method that it depends on has been
1103 // updated. Recompute a complete reachability graph for
1104 // this task/method and compare it to any previous result.
1105 // If there is a change detected, add any methods/tasks
1106 // that depend on this one to the "to visit" set.
1108 if( !suppressOutput ) {
1109 System.out.println("Analyzing " + d);
1112 if( state.DISJOINTDVISITSTACKEESONTOP ) {
1113 assert calleesToEnqueue.isEmpty();
1116 ReachGraph rg = analyzeMethod(d);
1117 ReachGraph rgPrev = getPartial(d);
1119 if( !rg.equals(rgPrev) ) {
1122 if( state.DISJOINTDEBUGSCHEDULING ) {
1123 System.out.println(" complete graph changed, scheduling callers for analysis:");
1126 // results for d changed, so enqueue dependents
1127 // of d for further analysis
1128 Iterator<Descriptor> depsItr = getDependents(d).iterator();
1129 while( depsItr.hasNext() ) {
1130 Descriptor dNext = depsItr.next();
1133 if( state.DISJOINTDEBUGSCHEDULING ) {
1134 System.out.println(" "+dNext);
1139 // whether or not the method under analysis changed,
1140 // we may have some callees that are scheduled for
1141 // more analysis, and they should go on the top of
1142 // the stack now (in other method-visiting modes they
1143 // are already enqueued at this point
1144 if( state.DISJOINTDVISITSTACKEESONTOP ) {
1145 Iterator<Descriptor> depsItr = calleesToEnqueue.iterator();
1146 while( depsItr.hasNext() ) {
1147 Descriptor dNext = depsItr.next();
1150 calleesToEnqueue.clear();
1156 protected ReachGraph analyzeMethod(Descriptor d)
1157 throws java.io.IOException {
1159 if( state.DISJOINT_COUNT_VISITS ) {
1160 ++totalMethodVisits;
1163 // get the flat code for this descriptor
1165 if( d == mdAnalysisEntry ) {
1166 fm = fmAnalysisEntry;
1168 fm = state.getMethodFlat(d);
1170 pm.analyzeMethod(fm);
1172 // intraprocedural work set
1173 Set<FlatNode> flatNodesToVisit = new HashSet<FlatNode>();
1174 flatNodesToVisit.add(fm);
1176 // if determinism is desired by client, shadow the
1177 // set with a queue to make visit order deterministic
1178 Queue<FlatNode> flatNodesToVisitQ = null;
1179 if( determinismDesired ) {
1180 flatNodesToVisitQ = new LinkedList<FlatNode>();
1181 flatNodesToVisitQ.add(fm);
1184 // start a new mapping of partial results
1185 mapFlatNodeToReachGraph =
1186 new Hashtable<FlatNode, ReachGraph>();
1188 // the set of return nodes partial results that will be combined as
1189 // the final, conservative approximation of the entire method
1190 HashSet<FlatReturnNode> setReturns = new HashSet<FlatReturnNode>();
1194 boolean snapThisMethod = false;
1195 if( takeDebugSnapshots && d instanceof MethodDescriptor ) {
1196 MethodDescriptor mdThisMethod = (MethodDescriptor)d;
1197 ClassDescriptor cdThisMethod = mdThisMethod.getClassDesc();
1198 if( cdThisMethod != null ) {
1200 descSymbolDebug.equals( cdThisMethod.getSymbol()+
1202 mdThisMethod.getSymbol()
1209 while( !flatNodesToVisit.isEmpty() ) {
1212 if( determinismDesired ) {
1213 assert !flatNodesToVisitQ.isEmpty();
1214 fn = flatNodesToVisitQ.remove();
1216 fn = flatNodesToVisit.iterator().next();
1218 flatNodesToVisit.remove(fn);
1220 // effect transfer function defined by this node,
1221 // then compare it to the old graph at this node
1222 // to see if anything was updated.
1224 ReachGraph rg = new ReachGraph();
1225 TaskDescriptor taskDesc;
1226 if(fn instanceof FlatMethod && (taskDesc=((FlatMethod)fn).getTask())!=null) {
1227 if(mapDescriptorToReachGraph.containsKey(taskDesc)) {
1228 // retrieve existing reach graph if it is not first time
1229 rg=mapDescriptorToReachGraph.get(taskDesc);
1231 // create initial reach graph for a task
1232 rg=createInitialTaskReachGraph((FlatMethod)fn);
1234 mapDescriptorToReachGraph.put(taskDesc, rg);
1238 // start by merging all node's parents' graphs
1239 for( int i = 0; i < pm.numPrev(fn); ++i ) {
1240 FlatNode pn = pm.getPrev(fn,i);
1241 if( mapFlatNodeToReachGraph.containsKey(pn) ) {
1242 ReachGraph rgParent = mapFlatNodeToReachGraph.get(pn);
1248 if( snapThisMethod ) {
1249 debugSnapshot(rg, fn, true);
1253 // modify rg with appropriate transfer function
1254 rg = analyzeFlatNode(d, fm, fn, setReturns, rg);
1257 if( snapThisMethod ) {
1258 debugSnapshot(rg, fn, false);
1263 // if the results of the new graph are different from
1264 // the current graph at this node, replace the graph
1265 // with the update and enqueue the children
1266 ReachGraph rgPrev = mapFlatNodeToReachGraph.get(fn);
1267 if( !rg.equals(rgPrev) ) {
1268 mapFlatNodeToReachGraph.put(fn, rg);
1270 // we don't necessarily want to keep the reach graph for every
1271 // node in the program unless a client or the user wants it
1272 if( state.DISJOINT_WRITE_ALL_NODE_FINAL_GRAPHS ) {
1273 mapFlatNodeToReachGraphPersist.put(fn, rg);
1276 for( int i = 0; i < pm.numNext(fn); i++ ) {
1277 FlatNode nn = pm.getNext(fn, i);
1279 flatNodesToVisit.add(nn);
1280 if( determinismDesired ) {
1281 flatNodesToVisitQ.add(nn);
1288 // end by merging all return nodes into a complete
1289 // reach graph that represents all possible heap
1290 // states after the flat method returns
1291 ReachGraph completeGraph = new ReachGraph();
1293 if( setReturns.isEmpty() ) {
1294 System.out.println( "d = "+d );
1297 assert !setReturns.isEmpty();
1298 Iterator retItr = setReturns.iterator();
1299 while( retItr.hasNext() ) {
1300 FlatReturnNode frn = (FlatReturnNode) retItr.next();
1302 assert mapFlatNodeToReachGraph.containsKey(frn);
1303 ReachGraph rgRet = mapFlatNodeToReachGraph.get(frn);
1305 completeGraph.merge(rgRet);
1309 if( snapThisMethod ) {
1310 // increment that we've visited the debug snap
1311 // method, and reset the node counter
1312 System.out.println(" @@@ debug snap at visit "+snapVisitCounter);
1314 snapNodeCounter = 0;
1316 if( snapVisitCounter == visitStartCapture + numVisitsToCapture &&
1319 System.out.println("!!! Stopping analysis after debug snap captures. !!!");
1325 return completeGraph;
1329 protected ReachGraph
1330 analyzeFlatNode(Descriptor d,
1331 FlatMethod fmContaining,
1333 HashSet<FlatReturnNode> setRetNodes,
1335 ) throws java.io.IOException {
1338 if( state.DISJOINT_COUNT_VISITS ) {
1343 // any variables that are no longer live should be
1344 // nullified in the graph to reduce edges
1345 //rg.nullifyDeadVars( liveness.getLiveInTemps( fmContaining, fn ) );
1349 FieldDescriptor fld;
1350 TypeDescriptor tdElement;
1351 FieldDescriptor fdElement;
1352 FlatSESEEnterNode sese;
1353 FlatSESEExitNode fsexn;
1355 boolean alreadyReachable;
1356 Set<EdgeKey> edgeKeysForLoad;
1357 Set<EdgeKey> edgeKeysRemoved;
1358 Set<EdgeKey> edgeKeysAdded;
1359 Set<DefiniteReachState.FdEntry> edgesToElideFromProp;
1361 //Stores the flatnode's reach graph at enter
1362 ReachGraph rgOnEnter = new ReachGraph();
1363 rgOnEnter.merge(rg);
1364 fn2rgAtEnter.put(fn, rgOnEnter);
1368 boolean didDefReachTransfer = false;
1372 // use node type to decide what transfer function
1373 // to apply to the reachability graph
1374 switch( fn.kind() ) {
1376 case FKind.FlatGenReachNode: {
1377 FlatGenReachNode fgrn = (FlatGenReachNode) fn;
1379 System.out.println(" Generating reach graph for program point: "+fgrn.getGraphName() );
1382 rg.writeGraph("genReach"+fgrn.getGraphName(),
1383 true, // write labels (variables)
1384 true, // selectively hide intermediate temp vars
1385 true, // prune unreachable heap regions
1386 false, // hide reachability altogether
1387 true, // hide subset reachability states
1388 true, // hide predicates
1389 true); //false); // hide edge taints
1393 case FKind.FlatGenDefReachNode: {
1394 FlatGenDefReachNode fgdrn = (FlatGenDefReachNode) fn;
1395 if( doDefiniteReachAnalysis ) {
1396 definiteReachAnalysis.writeState( fn, fgdrn.getOutputName() );
1401 case FKind.FlatMethod: {
1402 // construct this method's initial heap model (IHM)
1403 // since we're working on the FlatMethod, we know
1404 // the incoming ReachGraph 'rg' is empty
1406 Hashtable<FlatCall, ReachGraph> heapsFromCallers =
1407 getIHMcontributions(d);
1409 Set entrySet = heapsFromCallers.entrySet();
1410 Iterator itr = entrySet.iterator();
1411 while( itr.hasNext() ) {
1412 Map.Entry me = (Map.Entry)itr.next();
1413 FlatCall fc = (FlatCall) me.getKey();
1414 ReachGraph rgContrib = (ReachGraph) me.getValue();
1416 // note that "fc.getMethod()" like (Object.toString)
1417 // might not be equal to "d" like (String.toString)
1418 // because the mapping gets set up when we resolve
1420 rg.merge(rgContrib);
1423 // additionally, we are enforcing STRICT MONOTONICITY for the
1424 // method's initial context, so grow the context by whatever
1425 // the previously computed context was, and put the most
1426 // up-to-date context back in the map
1427 ReachGraph rgPrevContext = mapDescriptorToInitialContext.get(d);
1428 rg.merge(rgPrevContext);
1429 mapDescriptorToInitialContext.put(d, rg);
1431 if( doDefiniteReachAnalysis ) {
1432 FlatMethod fm = (FlatMethod) fn;
1433 Set<TempDescriptor> params = new HashSet<TempDescriptor>();
1434 for( int i = 0; i < fm.numParameters(); ++i ) {
1435 params.add( fm.getParameter( i ) );
1437 definiteReachAnalysis.methodEntry( fn, params );
1438 didDefReachTransfer = true;
1442 case FKind.FlatOpNode:
1443 FlatOpNode fon = (FlatOpNode) fn;
1444 if( fon.getOp().getOp() == Operation.ASSIGN ) {
1445 lhs = fon.getDest();
1446 rhs = fon.getLeft();
1448 // before transfer, do effects analysis support
1449 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1450 if(rblockRel.isPotentialStallSite(fn)) {
1451 // x gets status of y
1452 if(!accessible.isAccessible(fn, rhs)) {
1453 rg.makeInaccessible(lhs);
1459 rg.assignTempXEqualToTempY(lhs, rhs);
1461 if( doDefiniteReachAnalysis ) {
1462 definiteReachAnalysis.copy( fn, lhs, rhs );
1463 didDefReachTransfer = true;
1468 case FKind.FlatCastNode:
1469 FlatCastNode fcn = (FlatCastNode) fn;
1473 TypeDescriptor td = fcn.getType();
1476 // before transfer, do effects analysis support
1477 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1478 if(rblockRel.isPotentialStallSite(fn)) {
1479 // x gets status of y
1480 if(!accessible.isAccessible(fn,rhs)) {
1481 rg.makeInaccessible(lhs);
1487 rg.assignTempXEqualToCastedTempY(lhs, rhs, td);
1489 if( doDefiniteReachAnalysis ) {
1490 definiteReachAnalysis.copy( fn, lhs, rhs );
1491 didDefReachTransfer = true;
1495 case FKind.FlatFieldNode:
1496 FlatFieldNode ffn = (FlatFieldNode) fn;
1500 fld = ffn.getField();
1502 // before graph transform, possible inject
1503 // a stall-site taint
1504 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1506 if(rblockRel.isPotentialStallSite(fn)) {
1507 // x=y.f, stall y if not accessible
1508 // contributes read effects on stall site of y
1509 if(!accessible.isAccessible(fn,rhs)) {
1510 rg.taintStallSite(fn, rhs);
1513 // after this, x and y are accessbile.
1514 rg.makeAccessible(lhs);
1515 rg.makeAccessible(rhs);
1519 edgeKeysForLoad = null;
1520 if( doDefiniteReachAnalysis ) {
1521 edgeKeysForLoad = new HashSet<EdgeKey>();
1524 if( shouldAnalysisTrack(fld.getType() ) ) {
1526 rg.assignTempXEqualToTempYFieldF( lhs, rhs, fld, fn, edgeKeysForLoad );
1528 if( doDefiniteReachAnalysis ) {
1529 definiteReachAnalysis.load( fn, lhs, rhs, fld, edgeKeysForLoad );
1530 didDefReachTransfer = true;
1534 // after transfer, use updated graph to
1535 // do effects analysis
1536 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1537 effectsAnalysis.analyzeFlatFieldNode(rg, rhs, fld, fn);
1541 case FKind.FlatSetFieldNode:
1542 FlatSetFieldNode fsfn = (FlatSetFieldNode) fn;
1544 lhs = fsfn.getDst();
1545 fld = fsfn.getField();
1546 rhs = fsfn.getSrc();
1548 boolean strongUpdate = false;
1550 alreadyReachable = false;
1551 edgeKeysRemoved = null;
1552 edgeKeysAdded = null;
1553 edgesToElideFromProp = null;
1554 if( doDefiniteReachAnalysis ) {
1555 alreadyReachable = definiteReachAnalysis.isAlreadyReachable( rhs, lhs, fn );
1556 edgeKeysRemoved = new HashSet<EdgeKey>();
1557 edgeKeysAdded = new HashSet<EdgeKey>();
1558 edgesToElideFromProp = definiteReachAnalysis.edgesToElidePropagation( lhs, rhs, fn );
1561 // before transfer func, possibly inject
1562 // stall-site taints
1563 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1565 if(rblockRel.isPotentialStallSite(fn)) {
1566 // x.y=f , stall x and y if they are not accessible
1567 // also contribute write effects on stall site of x
1568 if(!accessible.isAccessible(fn,lhs)) {
1569 rg.taintStallSite(fn, lhs);
1572 if(!accessible.isAccessible(fn,rhs)) {
1573 rg.taintStallSite(fn, rhs);
1576 // accessible status update
1577 rg.makeAccessible(lhs);
1578 rg.makeAccessible(rhs);
1582 if( shouldAnalysisTrack(fld.getType() ) ) {
1584 strongUpdate = rg.assignTempXFieldFEqualToTempY( lhs,
1591 edgesToElideFromProp );
1592 if( doDefiniteReachAnalysis ) {
1593 definiteReachAnalysis.store( fn,
1599 didDefReachTransfer = true;
1603 // use transformed graph to do effects analysis
1604 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1605 effectsAnalysis.analyzeFlatSetFieldNode(rg, lhs, fld, fn, strongUpdate);
1609 case FKind.FlatElementNode:
1610 FlatElementNode fen = (FlatElementNode) fn;
1615 assert rhs.getType() != null;
1616 assert rhs.getType().isArray();
1618 tdElement = rhs.getType().dereference();
1619 fdElement = getArrayField(tdElement);
1621 // before transfer func, possibly inject
1623 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1624 if(rblockRel.isPotentialStallSite(fn)) {
1625 // x=y.f, stall y if not accessible
1626 // contributes read effects on stall site of y
1627 // after this, x and y are accessbile.
1628 if(!accessible.isAccessible(fn,rhs)) {
1629 rg.taintStallSite(fn, rhs);
1632 rg.makeAccessible(lhs);
1633 rg.makeAccessible(rhs);
1637 edgeKeysForLoad = null;
1638 if( doDefiniteReachAnalysis ) {
1639 edgeKeysForLoad = new HashSet<EdgeKey>();
1642 if( shouldAnalysisTrack(lhs.getType() ) ) {
1644 rg.assignTempXEqualToTempYFieldF( lhs, rhs, fdElement, fn, edgeKeysForLoad );
1646 if( doDefiniteReachAnalysis ) {
1647 definiteReachAnalysis.load( fn, lhs, rhs, fdElement, edgeKeysForLoad );
1648 didDefReachTransfer = true;
1652 // use transformed graph to do effects analysis
1653 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1654 effectsAnalysis.analyzeFlatFieldNode(rg, rhs, fdElement, fn);
1658 case FKind.FlatSetElementNode:
1659 FlatSetElementNode fsen = (FlatSetElementNode) fn;
1661 lhs = fsen.getDst();
1662 rhs = fsen.getSrc();
1664 assert lhs.getType() != null;
1665 assert lhs.getType().isArray();
1667 tdElement = lhs.getType().dereference();
1668 fdElement = getArrayField(tdElement);
1670 alreadyReachable = false;
1671 edgeKeysRemoved = null;
1672 edgeKeysAdded = null;
1673 edgesToElideFromProp = null;
1674 if( doDefiniteReachAnalysis ) {
1675 alreadyReachable = definiteReachAnalysis.isAlreadyReachable( rhs, lhs, fn );
1676 edgeKeysRemoved = new HashSet<EdgeKey>();
1677 edgeKeysAdded = new HashSet<EdgeKey>();
1678 edgesToElideFromProp = definiteReachAnalysis.edgesToElidePropagation( lhs, rhs, fn );
1681 // before transfer func, possibly inject
1682 // stall-site taints
1683 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1685 if(rblockRel.isPotentialStallSite(fn)) {
1686 // x.y=f , stall x and y if they are not accessible
1687 // also contribute write effects on stall site of x
1688 if(!accessible.isAccessible(fn,lhs)) {
1689 rg.taintStallSite(fn, lhs);
1692 if(!accessible.isAccessible(fn,rhs)) {
1693 rg.taintStallSite(fn, rhs);
1696 // accessible status update
1697 rg.makeAccessible(lhs);
1698 rg.makeAccessible(rhs);
1702 if( shouldAnalysisTrack(rhs.getType() ) ) {
1703 // transfer func, BUT
1704 // skip this node if it cannot create new reachability paths
1705 if( !arrayReferencees.doesNotCreateNewReaching(fsen) ) {
1706 rg.assignTempXFieldFEqualToTempY( lhs,
1713 edgesToElideFromProp );
1716 if( doDefiniteReachAnalysis ) {
1717 definiteReachAnalysis.store( fn,
1723 didDefReachTransfer = true;
1727 // use transformed graph to do effects analysis
1728 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1729 effectsAnalysis.analyzeFlatSetFieldNode(rg, lhs, fdElement, fn,
1735 FlatNew fnn = (FlatNew) fn;
1737 if( shouldAnalysisTrack(lhs.getType() ) ) {
1738 AllocSite as = getAllocSiteFromFlatNewPRIVATE(fnn);
1740 // before transform, support effects analysis
1741 if (doEffectsAnalysis && fmContaining != fmAnalysisEntry) {
1742 if (rblockRel.isPotentialStallSite(fn)) {
1743 // after creating new object, lhs is accessible
1744 rg.makeAccessible(lhs);
1749 rg.assignTempEqualToNewAlloc(lhs, as);
1751 if( doDefiniteReachAnalysis ) {
1752 definiteReachAnalysis.newObject( fn, lhs );
1753 didDefReachTransfer = true;
1759 case FKind.FlatLiteralNode:
1760 // BIG NOTE: this transfer function is only here for
1761 // points-to information for String literals. That's it.
1762 // Effects and disjoint reachability and all of that don't
1763 // care about references to literals.
1764 FlatLiteralNode fln = (FlatLiteralNode) fn;
1766 if( fln.getType().equals( stringType ) ) {
1767 rg.assignTempEqualToStringLiteral( fln.getDst(),
1768 newStringLiteralAlloc,
1769 newStringLiteralBytesAlloc,
1775 case FKind.FlatSESEEnterNode:
1776 sese = (FlatSESEEnterNode) fn;
1778 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1780 // always remove ALL stall site taints at enter
1781 rg.removeAllStallSiteTaints();
1783 // inject taints for in-set vars
1784 rg.taintInSetVars(sese);
1789 case FKind.FlatSESEExitNode:
1790 fsexn = (FlatSESEExitNode) fn;
1791 sese = fsexn.getFlatEnter();
1793 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1795 // @ sese exit make all live variables
1796 // inaccessible to later parent statements
1797 rg.makeInaccessible(liveness.getLiveInTemps(fmContaining, fn) );
1799 // always remove ALL stall site taints at exit
1800 rg.removeAllStallSiteTaints();
1802 // remove in-set var taints for the exiting rblock
1803 rg.removeInContextTaints(sese);
1808 case FKind.FlatCall: {
1809 Descriptor mdCaller;
1810 if( fmContaining.getMethod() != null ) {
1811 mdCaller = fmContaining.getMethod();
1813 mdCaller = fmContaining.getTask();
1815 FlatCall fc = (FlatCall) fn;
1816 MethodDescriptor mdCallee = fc.getMethod();
1817 FlatMethod fmCallee = state.getMethodFlat(mdCallee);
1820 if( doDefiniteReachAnalysis ) {
1821 definiteReachAnalysis.methodCall( fn, fc.getReturnTemp() );
1822 didDefReachTransfer = true;
1826 // the transformation for a call site should update the
1827 // current heap abstraction with any effects from the callee,
1828 // or if the method is virtual, the effects from any possible
1829 // callees, so find the set of callees...
1830 Set<MethodDescriptor> setPossibleCallees;
1831 if( determinismDesired ) {
1832 // use an ordered set
1833 setPossibleCallees = new TreeSet<MethodDescriptor>(dComp);
1835 // otherwise use a speedy hashset
1836 setPossibleCallees = new HashSet<MethodDescriptor>();
1839 if( mdCallee.isStatic() ) {
1840 setPossibleCallees.add(mdCallee);
1842 TypeDescriptor typeDesc = fc.getThis().getType();
1843 setPossibleCallees.addAll(callGraph.getMethods(mdCallee,
1849 DebugCallSiteData dcsd = new DebugCallSiteData();
1851 ReachGraph rgMergeOfPossibleCallers = new ReachGraph();
1854 Iterator<MethodDescriptor> mdItr = setPossibleCallees.iterator();
1855 while( mdItr.hasNext() ) {
1856 MethodDescriptor mdPossible = mdItr.next();
1857 FlatMethod fmPossible = state.getMethodFlat(mdPossible);
1859 addDependent(mdPossible, // callee
1863 // decide for each possible resolution of the method whether we
1864 // want to debug this call site
1865 decideDebugCallSite( dcsd, mdCaller, mdPossible );
1869 // calculate the heap this call site can reach--note this is
1870 // not used for the current call site transform, we are
1871 // grabbing this heap model for future analysis of the callees,
1872 // so if different results emerge we will return to this site
1873 ReachGraph heapForThisCall_old =
1874 getIHMcontribution(mdPossible, fc);
1876 // the computation of the callee-reachable heap
1877 // is useful for making the callee starting point
1878 // and for applying the call site transfer function
1879 Set<Integer> callerNodeIDsCopiedToCallee =
1880 new HashSet<Integer>();
1883 ReachGraph heapForThisCall_cur =
1884 rg.makeCalleeView(fc,
1886 callerNodeIDsCopiedToCallee,
1891 // enforce that a call site contribution can only
1892 // monotonically increase
1893 heapForThisCall_cur.merge(heapForThisCall_old);
1895 if( !heapForThisCall_cur.equals(heapForThisCall_old) ) {
1896 // if heap at call site changed, update the contribution,
1897 // and reschedule the callee for analysis
1898 addIHMcontribution(mdPossible, fc, heapForThisCall_cur);
1900 // map a FlatCall to its enclosing method/task descriptor
1901 // so we can write that info out later
1902 fc2enclosing.put(fc, mdCaller);
1904 if( state.DISJOINTDEBUGSCHEDULING ) {
1905 System.out.println(" context changed at callsite: "+fc+", scheduling callee: "+mdPossible);
1908 if( state.DISJOINTDVISITSTACKEESONTOP ) {
1909 calleesToEnqueue.add(mdPossible);
1911 enqueue(mdPossible);
1918 // don't alter the working graph (rg) until we compute a
1919 // result for every possible callee, merge them all together,
1920 // then set rg to that
1921 ReachGraph rgPossibleCaller = new ReachGraph();
1922 rgPossibleCaller.merge(rg);
1924 ReachGraph rgPossibleCallee = getPartial(mdPossible);
1926 if( rgPossibleCallee == null ) {
1927 // if this method has never been analyzed just schedule it
1928 // for analysis and skip over this call site for now
1929 if( state.DISJOINTDVISITSTACKEESONTOP ) {
1930 calleesToEnqueue.add(mdPossible);
1932 enqueue(mdPossible);
1935 if( state.DISJOINTDEBUGSCHEDULING ) {
1936 System.out.println(" callee hasn't been analyzed, scheduling: "+mdPossible);
1942 // calculate the method call transform
1943 rgPossibleCaller.resolveMethodCall(fc,
1946 callerNodeIDsCopiedToCallee,
1951 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1952 if( !accessible.isAccessible(fn, ReachGraph.tdReturn) ) {
1953 rgPossibleCaller.makeInaccessible(fc.getReturnTemp() );
1959 rgMergeOfPossibleCallers.merge(rgPossibleCaller);
1964 statusDebugCallSite( dcsd );
1968 // now that we've taken care of building heap models for
1969 // callee analysis, finish this transformation
1970 rg = rgMergeOfPossibleCallers;
1973 // jjenista: what is this? It breaks compilation
1974 // of programs with no tasks/SESEs/rblocks...
1975 //XXXXXXXXXXXXXXXXXXXXXXXXX
1976 //need to consider more
1977 if( state.OOOJAVA ) {
1978 FlatNode nextFN=fmCallee.getNext(0);
1979 if( nextFN instanceof FlatSESEEnterNode ) {
1980 FlatSESEEnterNode calleeSESE=(FlatSESEEnterNode)nextFN;
1981 if(!calleeSESE.getIsLeafSESE()) {
1982 rg.makeInaccessible(liveness.getLiveInTemps(fmContaining, fn) );
1990 case FKind.FlatReturnNode:
1991 FlatReturnNode frn = (FlatReturnNode) fn;
1992 rhs = frn.getReturnTemp();
1994 // before transfer, do effects analysis support
1995 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1996 if(!accessible.isAccessible(fn,rhs)) {
1997 rg.makeInaccessible(ReachGraph.tdReturn);
2001 if( rhs != null && shouldAnalysisTrack(rhs.getType() ) ) {
2002 rg.assignReturnEqualToTemp(rhs);
2005 setRetNodes.add(frn);
2012 if( doDefiniteReachAnalysis && !didDefReachTransfer ) {
2013 definiteReachAnalysis.otherStatement( fn );
2018 // dead variables were removed before the above transfer function
2019 // was applied, so eliminate heap regions and edges that are no
2020 // longer part of the abstractly-live heap graph, and sweep up
2021 // and reachability effects that are altered by the reduction
2022 //rg.abstractGarbageCollect();
2026 // back edges are strictly monotonic
2027 if( pm.isBackEdge(fn) ) {
2028 ReachGraph rgPrevResult = mapBackEdgeToMonotone.get(fn);
2029 rg.merge(rgPrevResult);
2030 mapBackEdgeToMonotone.put(fn, rg);
2034 ReachGraph rgOnExit = new ReachGraph();
2036 fn2rgAtExit.put(fn, rgOnExit);
2040 // at this point rg should be the correct update
2041 // by an above transfer function, or untouched if
2042 // the flat node type doesn't affect the heap
2048 // this method should generate integers strictly greater than zero!
2049 // special "shadow" regions are made from a heap region by negating
2051 static public Integer generateUniqueHeapRegionNodeID() {
2053 return new Integer(uniqueIDcount);
2058 static public FieldDescriptor getArrayField(TypeDescriptor tdElement) {
2059 FieldDescriptor fdElement = mapTypeToArrayField.get(tdElement);
2060 if( fdElement == null ) {
2061 fdElement = new FieldDescriptor(new Modifiers(Modifiers.PUBLIC),
2063 arrayElementFieldName,
2066 mapTypeToArrayField.put(tdElement, fdElement);
2073 private void writeFinalGraphs() {
2074 Set entrySet = mapDescriptorToCompleteReachGraph.entrySet();
2075 Iterator itr = entrySet.iterator();
2076 while( itr.hasNext() ) {
2077 Map.Entry me = (Map.Entry)itr.next();
2078 Descriptor d = (Descriptor) me.getKey();
2079 ReachGraph rg = (ReachGraph) me.getValue();
2082 if( d instanceof TaskDescriptor ) {
2083 graphName = "COMPLETEtask"+d;
2085 graphName = "COMPLETE"+d;
2088 rg.writeGraph(graphName,
2089 true, // write labels (variables)
2090 true, // selectively hide intermediate temp vars
2091 true, // prune unreachable heap regions
2092 false, // hide reachability altogether
2093 true, // hide subset reachability states
2094 true, // hide predicates
2095 true); // hide edge taints
2099 private void writeFinalIHMs() {
2100 Iterator d2IHMsItr = mapDescriptorToIHMcontributions.entrySet().iterator();
2101 while( d2IHMsItr.hasNext() ) {
2102 Map.Entry me1 = (Map.Entry)d2IHMsItr.next();
2103 Descriptor d = (Descriptor) me1.getKey();
2104 Hashtable<FlatCall, ReachGraph> IHMs = (Hashtable<FlatCall, ReachGraph>)me1.getValue();
2106 Iterator fc2rgItr = IHMs.entrySet().iterator();
2107 while( fc2rgItr.hasNext() ) {
2108 Map.Entry me2 = (Map.Entry)fc2rgItr.next();
2109 FlatCall fc = (FlatCall) me2.getKey();
2110 ReachGraph rg = (ReachGraph) me2.getValue();
2112 rg.writeGraph("IHMPARTFOR"+d+"FROM"+fc2enclosing.get(fc)+fc,
2113 true, // write labels (variables)
2114 true, // selectively hide intermediate temp vars
2115 true, // hide reachability altogether
2116 true, // prune unreachable heap regions
2117 true, // hide subset reachability states
2118 false, // hide predicates
2119 true); // hide edge taints
2124 private void writeInitialContexts() {
2125 Set entrySet = mapDescriptorToInitialContext.entrySet();
2126 Iterator itr = entrySet.iterator();
2127 while( itr.hasNext() ) {
2128 Map.Entry me = (Map.Entry)itr.next();
2129 Descriptor d = (Descriptor) me.getKey();
2130 ReachGraph rg = (ReachGraph) me.getValue();
2132 rg.writeGraph("INITIAL"+d,
2133 true, // write labels (variables)
2134 true, // selectively hide intermediate temp vars
2135 true, // prune unreachable heap regions
2136 false, // hide all reachability
2137 true, // hide subset reachability states
2138 true, // hide predicates
2139 false); // hide edge taints
2143 private void writeFinalGraphsForEveryNode() {
2144 Set entrySet = mapFlatNodeToReachGraphPersist.entrySet();
2145 Iterator itr = entrySet.iterator();
2146 while( itr.hasNext() ) {
2147 Map.Entry me = (Map.Entry) itr.next();
2148 FlatNode fn = (FlatNode) me.getKey();
2149 ReachGraph rg = (ReachGraph) me.getValue();
2151 rg.writeGraph("NODEFINAL"+fn,
2152 true, // write labels (variables)
2153 false, // selectively hide intermediate temp vars
2154 true, // prune unreachable heap regions
2155 true, // hide all reachability
2156 true, // hide subset reachability states
2157 true, // hide predicates
2158 true); // hide edge taints
2163 protected ReachGraph getPartial(Descriptor d) {
2164 return mapDescriptorToCompleteReachGraph.get(d);
2167 protected void setPartial(Descriptor d, ReachGraph rg) {
2168 mapDescriptorToCompleteReachGraph.put(d, rg);
2170 // when the flag for writing out every partial
2171 // result is set, we should spit out the graph,
2172 // but in order to give it a unique name we need
2173 // to track how many partial results for this
2174 // descriptor we've already written out
2175 if( writeAllIncrementalDOTs ) {
2176 if( !mapDescriptorToNumUpdates.containsKey(d) ) {
2177 mapDescriptorToNumUpdates.put(d, new Integer(0) );
2179 Integer n = mapDescriptorToNumUpdates.get(d);
2182 if( d instanceof TaskDescriptor ) {
2183 graphName = d+"COMPLETEtask"+String.format("%05d", n);
2185 graphName = d+"COMPLETE"+String.format("%05d", n);
2188 rg.writeGraph(graphName,
2189 true, // write labels (variables)
2190 true, // selectively hide intermediate temp vars
2191 true, // prune unreachable heap regions
2192 false, // hide all reachability
2193 true, // hide subset reachability states
2194 false, // hide predicates
2195 false); // hide edge taints
2197 mapDescriptorToNumUpdates.put(d, n + 1);
2203 // return just the allocation site associated with one FlatNew node
2204 protected AllocSite getAllocSiteFromFlatNewPRIVATE(FlatNew fnew) {
2205 return summarizePerClass ?
2206 getAllocSiteFromFlatNewPRIVATEperClass( fnew ) :
2207 getAllocSiteFromFlatNewPRIVATEperSite( fnew );
2210 protected AllocSite getAllocSiteFromFlatNewPRIVATEperSite(FlatNew fnew) {
2211 boolean flagProgrammatically = false;
2212 if( sitesToFlag != null && sitesToFlag.contains(fnew) ) {
2213 flagProgrammatically = true;
2216 if( !mapFlatNewToAllocSite.containsKey(fnew) ) {
2217 AllocSite as = AllocSite.factory(allocationDepth,
2219 fnew.getDisjointId(),
2220 flagProgrammatically
2223 // the newest nodes are single objects
2224 for( int i = 0; i < allocationDepth; ++i ) {
2225 Integer id = generateUniqueHeapRegionNodeID();
2226 as.setIthOldest(i, id);
2227 mapHrnIdToAllocSite.put(id, as);
2230 // the oldest node is a summary node
2231 as.setSummary(generateUniqueHeapRegionNodeID() );
2233 mapFlatNewToAllocSite.put(fnew, as);
2236 return mapFlatNewToAllocSite.get(fnew);
2239 protected AllocSite getAllocSiteFromFlatNewPRIVATEperClass(FlatNew fnew) {
2240 TypeDescriptor type = fnew.getType();
2242 boolean flagProgrammatically = typesToFlag.contains( type );
2244 if( !mapTypeToAllocSite.containsKey( type ) ) {
2245 AllocSite as = AllocSite.factory(allocationDepth,
2247 fnew.getDisjointId(),
2248 flagProgrammatically
2251 // the newest nodes are single objects
2252 for( int i = 0; i < allocationDepth; ++i ) {
2253 Integer id = generateUniqueHeapRegionNodeID();
2254 as.setIthOldest(i, id);
2255 mapHrnIdToAllocSite.put(id, as);
2258 // the oldest node is a summary node
2259 as.setSummary(generateUniqueHeapRegionNodeID() );
2261 mapTypeToAllocSite.put( type, as );
2264 if( !mapFlatNewToAllocSite.containsKey( fnew ) ) {
2265 AllocSite as = mapTypeToAllocSite.get( type );
2266 mapFlatNewToAllocSite.put( fnew, as );
2269 return mapFlatNewToAllocSite.get(fnew);
2273 public static boolean shouldAnalysisTrack(TypeDescriptor type) {
2274 // don't track primitive types, but an array
2275 // of primitives is heap memory
2276 if( type.isImmutable() ) {
2277 return type.isArray();
2280 // everything else is an object
2284 protected int numMethodsAnalyzed() {
2285 return descriptorsToAnalyze.size();
2291 // Take in source entry which is the program's compiled entry and
2292 // create a new analysis entry, a method that takes no parameters
2293 // and appears to allocate the command line arguments and call the
2294 // source entry with them. The purpose of this analysis entry is
2295 // to provide a top-level method context with no parameters left.
2296 protected void makeAnalysisEntryMethod(MethodDescriptor mdSourceEntry) {
2298 Modifiers mods = new Modifiers();
2299 mods.addModifier(Modifiers.PUBLIC);
2300 mods.addModifier(Modifiers.STATIC);
2302 TypeDescriptor returnType = new TypeDescriptor(TypeDescriptor.VOID);
2304 this.mdAnalysisEntry =
2305 new MethodDescriptor(mods,
2307 "analysisEntryMethod"
2310 TypeDescriptor argsType = mdSourceEntry.getParamType(0);
2311 TempDescriptor cmdLineArgs =
2312 new TempDescriptor("analysisEntryTemp_args",
2316 new FlatNew(argsType,
2320 this.constructedCmdLineArgsNew = fnArgs;
2322 TypeDescriptor argType = argsType.dereference();
2323 TempDescriptor anArg =
2324 new TempDescriptor("analysisEntryTemp_arg",
2328 new FlatNew(argType,
2332 this.constructedCmdLineArgNew = fnArg;
2334 TypeDescriptor typeIndex = new TypeDescriptor(TypeDescriptor.INT);
2335 TempDescriptor index =
2336 new TempDescriptor("analysisEntryTemp_index",
2339 FlatLiteralNode fli =
2340 new FlatLiteralNode(typeIndex,
2345 FlatSetElementNode fse =
2346 new FlatSetElementNode(cmdLineArgs,
2351 TypeDescriptor typeSize = new TypeDescriptor(TypeDescriptor.INT);
2352 TempDescriptor sizeBytes =
2353 new TempDescriptor("analysisEntryTemp_size",
2356 FlatLiteralNode fls =
2357 new FlatLiteralNode(typeSize,
2362 TempDescriptor strBytes =
2363 new TempDescriptor("analysisEntryTemp_strBytes",
2367 new FlatNew(stringBytesType,
2372 this.constructedCmdLineArgBytesNew = fnBytes;
2374 FlatSetFieldNode fsf =
2375 new FlatSetFieldNode(anArg,
2380 // throw this in so you can always see what the initial heap context
2381 // looks like if you want to, its cheap
2382 FlatGenReachNode fgen = new FlatGenReachNode( "argContext" );
2384 TempDescriptor[] sourceEntryArgs = new TempDescriptor[1];
2385 sourceEntryArgs[0] = cmdLineArgs;
2387 new FlatCall(mdSourceEntry,
2393 FlatReturnNode frn = new FlatReturnNode(null);
2395 FlatExit fe = new FlatExit();
2397 this.fmAnalysisEntry =
2398 new FlatMethod(mdAnalysisEntry,
2402 List<FlatNode> nodes = new LinkedList<FlatNode>();
2403 nodes.add( fnArgs );
2408 nodes.add( fnBytes );
2415 FlatNode current = this.fmAnalysisEntry;
2416 for( FlatNode next: nodes ) {
2417 current.addNext( next );
2422 // jjenista - this is useful for looking at the FlatIRGraph of the
2423 // analysis entry method constructed above if you have to modify it.
2424 // The usual method of writing FlatIRGraphs out doesn't work because
2425 // this flat method is private to the model of this analysis only.
2427 // FlatIRGraph flatMethodWriter =
2428 // new FlatIRGraph( state, false, false, false );
2429 // flatMethodWriter.writeFlatIRGraph( fmAnalysisEntry, "analysisEntry" );
2430 //} catch( IOException e ) {}
2434 protected LinkedList<Descriptor> topologicalSort(Set<Descriptor> toSort) {
2436 Set<Descriptor> discovered;
2438 if( determinismDesired ) {
2439 // use an ordered set
2440 discovered = new TreeSet<Descriptor>(dComp);
2442 // otherwise use a speedy hashset
2443 discovered = new HashSet<Descriptor>();
2446 LinkedList<Descriptor> sorted = new LinkedList<Descriptor>();
2448 Iterator<Descriptor> itr = toSort.iterator();
2449 while( itr.hasNext() ) {
2450 Descriptor d = itr.next();
2452 if( !discovered.contains(d) ) {
2453 dfsVisit(d, toSort, sorted, discovered);
2460 // While we're doing DFS on call graph, remember
2461 // dependencies for efficient queuing of methods
2462 // during interprocedural analysis:
2464 // a dependent of a method decriptor d for this analysis is:
2465 // 1) a method or task that invokes d
2466 // 2) in the descriptorsToAnalyze set
2467 protected void dfsVisit(Descriptor d,
2468 Set <Descriptor> toSort,
2469 LinkedList<Descriptor> sorted,
2470 Set <Descriptor> discovered) {
2473 // only methods have callers, tasks never do
2474 if( d instanceof MethodDescriptor ) {
2476 MethodDescriptor md = (MethodDescriptor) d;
2478 // the call graph is not aware that we have a fabricated
2479 // analysis entry that calls the program source's entry
2480 if( md == mdSourceEntry ) {
2481 if( !discovered.contains(mdAnalysisEntry) ) {
2482 addDependent(mdSourceEntry, // callee
2483 mdAnalysisEntry // caller
2485 dfsVisit(mdAnalysisEntry, toSort, sorted, discovered);
2489 // otherwise call graph guides DFS
2490 Iterator itr = callGraph.getCallerSet(md).iterator();
2491 while( itr.hasNext() ) {
2492 Descriptor dCaller = (Descriptor) itr.next();
2494 // only consider callers in the original set to analyze
2495 if( !toSort.contains(dCaller) ) {
2499 if( !discovered.contains(dCaller) ) {
2500 addDependent(md, // callee
2504 dfsVisit(dCaller, toSort, sorted, discovered);
2509 // for leaf-nodes last now!
2514 protected void enqueue(Descriptor d) {
2516 if( !descriptorsToVisitSet.contains(d) ) {
2518 if( state.DISJOINTDVISITSTACK ||
2519 state.DISJOINTDVISITSTACKEESONTOP
2521 descriptorsToVisitStack.add(d);
2523 } else if( state.DISJOINTDVISITPQUE ) {
2524 Integer priority = mapDescriptorToPriority.get(d);
2525 descriptorsToVisitQ.add(new DescriptorQWrapper(priority,
2530 descriptorsToVisitSet.add(d);
2535 // a dependent of a method decriptor d for this analysis is:
2536 // 1) a method or task that invokes d
2537 // 2) in the descriptorsToAnalyze set
2538 protected void addDependent(Descriptor callee, Descriptor caller) {
2539 Set<Descriptor> deps = mapDescriptorToSetDependents.get(callee);
2540 if( deps == null ) {
2541 deps = new HashSet<Descriptor>();
2544 mapDescriptorToSetDependents.put(callee, deps);
2547 protected Set<Descriptor> getDependents(Descriptor callee) {
2548 Set<Descriptor> deps = mapDescriptorToSetDependents.get(callee);
2549 if( deps == null ) {
2550 deps = new HashSet<Descriptor>();
2551 mapDescriptorToSetDependents.put(callee, deps);
2557 public Hashtable<FlatCall, ReachGraph> getIHMcontributions(Descriptor d) {
2559 Hashtable<FlatCall, ReachGraph> heapsFromCallers =
2560 mapDescriptorToIHMcontributions.get(d);
2562 if( heapsFromCallers == null ) {
2563 heapsFromCallers = new Hashtable<FlatCall, ReachGraph>();
2564 mapDescriptorToIHMcontributions.put(d, heapsFromCallers);
2567 return heapsFromCallers;
2570 public ReachGraph getIHMcontribution(Descriptor d,
2573 Hashtable<FlatCall, ReachGraph> heapsFromCallers =
2574 getIHMcontributions(d);
2576 if( !heapsFromCallers.containsKey(fc) ) {
2580 return heapsFromCallers.get(fc);
2584 public void addIHMcontribution(Descriptor d,
2588 Hashtable<FlatCall, ReachGraph> heapsFromCallers =
2589 getIHMcontributions(d);
2591 // ensure inputs to initial contexts increase monotonically
2592 ReachGraph merged = new ReachGraph();
2594 merged.merge( heapsFromCallers.get( fc ) );
2596 heapsFromCallers.put( fc, merged );
2601 private AllocSite createParameterAllocSite(ReachGraph rg,
2602 TempDescriptor tempDesc,
2608 flatNew = new FlatNew(tempDesc.getType(), // type
2609 tempDesc, // param temp
2610 false, // global alloc?
2611 "param"+tempDesc // disjoint site ID string
2614 flatNew = new FlatNew(tempDesc.getType(), // type
2615 tempDesc, // param temp
2616 false, // global alloc?
2617 null // disjoint site ID string
2621 // create allocation site
2622 AllocSite as = AllocSite.factory(allocationDepth,
2624 flatNew.getDisjointId(),
2627 for (int i = 0; i < allocationDepth; ++i) {
2628 Integer id = generateUniqueHeapRegionNodeID();
2629 as.setIthOldest(i, id);
2630 mapHrnIdToAllocSite.put(id, as);
2632 // the oldest node is a summary node
2633 as.setSummary(generateUniqueHeapRegionNodeID() );
2641 private Set<FieldDescriptor> getFieldSetTobeAnalyzed(TypeDescriptor typeDesc) {
2643 Set<FieldDescriptor> fieldSet=new HashSet<FieldDescriptor>();
2644 if(!typeDesc.isImmutable()) {
2645 ClassDescriptor classDesc = typeDesc.getClassDesc();
2646 for (Iterator it = classDesc.getFields(); it.hasNext(); ) {
2647 FieldDescriptor field = (FieldDescriptor) it.next();
2648 TypeDescriptor fieldType = field.getType();
2649 if (shouldAnalysisTrack(fieldType)) {
2650 fieldSet.add(field);
2658 private HeapRegionNode createMultiDeimensionalArrayHRN(ReachGraph rg, AllocSite alloc, HeapRegionNode srcHRN, FieldDescriptor fd, Hashtable<HeapRegionNode, HeapRegionNode> map, Hashtable<TypeDescriptor, HeapRegionNode> mapToExistingNode, ReachSet alpha) {
2660 int dimCount=fd.getType().getArrayCount();
2661 HeapRegionNode prevNode=null;
2662 HeapRegionNode arrayEntryNode=null;
2663 for(int i=dimCount; i>0; i--) {
2664 TypeDescriptor typeDesc=fd.getType().dereference(); //hack to get instance of type desc
2665 typeDesc.setArrayCount(i);
2666 TempDescriptor tempDesc=new TempDescriptor(typeDesc.getSymbol(),typeDesc);
2667 HeapRegionNode hrnSummary;
2668 if(!mapToExistingNode.containsKey(typeDesc)) {
2673 as = createParameterAllocSite(rg, tempDesc, false);
2675 // make a new reference to allocated node
2677 rg.createNewHeapRegionNode(as.getSummary(), // id or null to generate a new one
2678 false, // single object?
2680 false, // out-of-context?
2681 as.getType(), // type
2682 as, // allocation site
2683 alpha, // inherent reach
2684 alpha, // current reach
2685 ExistPredSet.factory(rg.predTrue), // predicates
2686 tempDesc.toString() // description
2688 rg.id2hrn.put(as.getSummary(),hrnSummary);
2690 mapToExistingNode.put(typeDesc, hrnSummary);
2692 hrnSummary=mapToExistingNode.get(typeDesc);
2695 if(prevNode==null) {
2696 // make a new reference between new summary node and source
2697 RefEdge edgeToSummary = new RefEdge(srcHRN, // source
2700 fd.getSymbol(), // field name
2702 ExistPredSet.factory(rg.predTrue), // predicates
2706 rg.addRefEdge(srcHRN, hrnSummary, edgeToSummary);
2707 prevNode=hrnSummary;
2708 arrayEntryNode=hrnSummary;
2710 // make a new reference between summary nodes of array
2711 RefEdge edgeToSummary = new RefEdge(prevNode, // source
2714 arrayElementFieldName, // field name
2716 ExistPredSet.factory(rg.predTrue), // predicates
2720 rg.addRefEdge(prevNode, hrnSummary, edgeToSummary);
2721 prevNode=hrnSummary;
2726 // create a new obj node if obj has at least one non-primitive field
2727 TypeDescriptor type=fd.getType();
2728 if(getFieldSetTobeAnalyzed(type).size()>0) {
2729 TypeDescriptor typeDesc=type.dereference();
2730 typeDesc.setArrayCount(0);
2731 if(!mapToExistingNode.containsKey(typeDesc)) {
2732 TempDescriptor tempDesc=new TempDescriptor(type.getSymbol(),typeDesc);
2733 AllocSite as = createParameterAllocSite(rg, tempDesc, false);
2734 // make a new reference to allocated node
2735 HeapRegionNode hrnSummary =
2736 rg.createNewHeapRegionNode(as.getSummary(), // id or null to generate a new one
2737 false, // single object?
2739 false, // out-of-context?
2741 as, // allocation site
2742 alpha, // inherent reach
2743 alpha, // current reach
2744 ExistPredSet.factory(rg.predTrue), // predicates
2745 tempDesc.toString() // description
2747 rg.id2hrn.put(as.getSummary(),hrnSummary);
2748 mapToExistingNode.put(typeDesc, hrnSummary);
2749 RefEdge edgeToSummary = new RefEdge(prevNode, // source
2752 arrayElementFieldName, // field name
2754 ExistPredSet.factory(rg.predTrue), // predicates
2757 rg.addRefEdge(prevNode, hrnSummary, edgeToSummary);
2758 prevNode=hrnSummary;
2760 HeapRegionNode hrnSummary=mapToExistingNode.get(typeDesc);
2761 if(prevNode.getReferenceTo(hrnSummary, typeDesc, arrayElementFieldName)==null) {
2762 RefEdge edgeToSummary = new RefEdge(prevNode, // source
2765 arrayElementFieldName, // field name
2767 ExistPredSet.factory(rg.predTrue), // predicates
2770 rg.addRefEdge(prevNode, hrnSummary, edgeToSummary);
2772 prevNode=hrnSummary;
2776 map.put(arrayEntryNode, prevNode);
2777 return arrayEntryNode;
2780 private ReachGraph createInitialTaskReachGraph(FlatMethod fm) {
2781 ReachGraph rg = new ReachGraph();
2782 TaskDescriptor taskDesc = fm.getTask();
2784 for (int idx = 0; idx < taskDesc.numParameters(); idx++) {
2785 Descriptor paramDesc = taskDesc.getParameter(idx);
2786 TypeDescriptor paramTypeDesc = taskDesc.getParamType(idx);
2788 // setup data structure
2789 Set<HashMap<HeapRegionNode, FieldDescriptor>> workSet =
2790 new HashSet<HashMap<HeapRegionNode, FieldDescriptor>>();
2791 Hashtable<TypeDescriptor, HeapRegionNode> mapTypeToExistingSummaryNode =
2792 new Hashtable<TypeDescriptor, HeapRegionNode>();
2793 Hashtable<HeapRegionNode, HeapRegionNode> mapToFirstDimensionArrayNode =
2794 new Hashtable<HeapRegionNode, HeapRegionNode>();
2795 Set<String> doneSet = new HashSet<String>();
2797 TempDescriptor tempDesc = fm.getParameter(idx);
2799 AllocSite as = createParameterAllocSite(rg, tempDesc, true);
2800 VariableNode lnX = rg.getVariableNodeFromTemp(tempDesc);
2801 Integer idNewest = as.getIthOldest(0);
2802 HeapRegionNode hrnNewest = rg.id2hrn.get(idNewest);
2804 // make a new reference to allocated node
2805 RefEdge edgeNew = new RefEdge(lnX, // source
2807 taskDesc.getParamType(idx), // type
2809 hrnNewest.getAlpha(), // beta
2810 ExistPredSet.factory(rg.predTrue), // predicates
2813 rg.addRefEdge(lnX, hrnNewest, edgeNew);
2815 // set-up a work set for class field
2816 ClassDescriptor classDesc = paramTypeDesc.getClassDesc();
2817 for (Iterator it = classDesc.getFields(); it.hasNext(); ) {
2818 FieldDescriptor fd = (FieldDescriptor) it.next();
2819 TypeDescriptor fieldType = fd.getType();
2820 if (shouldAnalysisTrack(fieldType)) {
2821 HashMap<HeapRegionNode, FieldDescriptor> newMap = new HashMap<HeapRegionNode, FieldDescriptor>();
2822 newMap.put(hrnNewest, fd);
2823 workSet.add(newMap);
2827 int uniqueIdentifier = 0;
2828 while (!workSet.isEmpty()) {
2829 HashMap<HeapRegionNode, FieldDescriptor> map = workSet
2831 workSet.remove(map);
2833 Set<HeapRegionNode> key = map.keySet();
2834 HeapRegionNode srcHRN = key.iterator().next();
2835 FieldDescriptor fd = map.get(srcHRN);
2836 TypeDescriptor type = fd.getType();
2837 String doneSetIdentifier = srcHRN.getIDString() + "_" + fd;
2839 if (!doneSet.contains(doneSetIdentifier)) {
2840 doneSet.add(doneSetIdentifier);
2841 if (!mapTypeToExistingSummaryNode.containsKey(type)) {
2842 // create new summary Node
2843 TempDescriptor td = new TempDescriptor("temp"
2844 + uniqueIdentifier, type);
2846 AllocSite allocSite;
2847 if(type.equals(paramTypeDesc)) {
2848 //corresponding allocsite has already been created for a parameter variable.
2851 allocSite = createParameterAllocSite(rg, td, false);
2853 String strDesc = allocSite.toStringForDOT()
2855 TypeDescriptor allocType=allocSite.getType();
2857 HeapRegionNode hrnSummary;
2858 if(allocType.isArray() && allocType.getArrayCount()>0) {
2859 hrnSummary=createMultiDeimensionalArrayHRN(rg,allocSite,srcHRN,fd,mapToFirstDimensionArrayNode,mapTypeToExistingSummaryNode,hrnNewest.getAlpha());
2862 rg.createNewHeapRegionNode(allocSite.getSummary(), // id or null to generate a new one
2863 false, // single object?
2865 false, // out-of-context?
2866 allocSite.getType(), // type
2867 allocSite, // allocation site
2868 hrnNewest.getAlpha(), // inherent reach
2869 hrnNewest.getAlpha(), // current reach
2870 ExistPredSet.factory(rg.predTrue), // predicates
2871 strDesc // description
2873 rg.id2hrn.put(allocSite.getSummary(),hrnSummary);
2875 // make a new reference to summary node
2876 RefEdge edgeToSummary = new RefEdge(srcHRN, // source
2879 fd.getSymbol(), // field name
2880 hrnNewest.getAlpha(), // beta
2881 ExistPredSet.factory(rg.predTrue), // predicates
2885 rg.addRefEdge(srcHRN, hrnSummary, edgeToSummary);
2889 mapTypeToExistingSummaryNode.put(type, hrnSummary);
2891 // set-up a work set for fields of the class
2892 Set<FieldDescriptor> fieldTobeAnalyzed=getFieldSetTobeAnalyzed(type);
2893 for (Iterator iterator = fieldTobeAnalyzed.iterator(); iterator
2895 FieldDescriptor fieldDescriptor = (FieldDescriptor) iterator
2897 HeapRegionNode newDstHRN;
2898 if(mapToFirstDimensionArrayNode.containsKey(hrnSummary)) {
2899 //related heap region node is already exsited.
2900 newDstHRN=mapToFirstDimensionArrayNode.get(hrnSummary);
2902 newDstHRN=hrnSummary;
2904 doneSetIdentifier = newDstHRN.getIDString() + "_" + fieldDescriptor;
2905 if(!doneSet.contains(doneSetIdentifier)) {
2906 // add new work item
2907 HashMap<HeapRegionNode, FieldDescriptor> newMap =
2908 new HashMap<HeapRegionNode, FieldDescriptor>();
2909 newMap.put(newDstHRN, fieldDescriptor);
2910 workSet.add(newMap);
2915 // if there exists corresponding summary node
2916 HeapRegionNode hrnDst=mapTypeToExistingSummaryNode.get(type);
2918 RefEdge edgeToSummary = new RefEdge(srcHRN, // source
2920 fd.getType(), // type
2921 fd.getSymbol(), // field name
2922 srcHRN.getAlpha(), // beta
2923 ExistPredSet.factory(rg.predTrue), // predicates
2926 rg.addRefEdge(srcHRN, hrnDst, edgeToSummary);
2936 // return all allocation sites in the method (there is one allocation
2937 // site per FlatNew node in a method)
2938 private HashSet<AllocSite> getAllocationSiteSet(Descriptor d) {
2939 if( !mapDescriptorToAllocSiteSet.containsKey(d) ) {
2940 buildAllocationSiteSet(d);
2943 return mapDescriptorToAllocSiteSet.get(d);
2947 private void buildAllocationSiteSet(Descriptor d) {
2948 HashSet<AllocSite> s = new HashSet<AllocSite>();
2951 if( d instanceof MethodDescriptor ) {
2952 fm = state.getMethodFlat( (MethodDescriptor) d);
2954 assert d instanceof TaskDescriptor;
2955 fm = state.getMethodFlat( (TaskDescriptor) d);
2957 pm.analyzeMethod(fm);
2959 // visit every node in this FlatMethod's IR graph
2960 // and make a set of the allocation sites from the
2961 // FlatNew node's visited
2962 HashSet<FlatNode> visited = new HashSet<FlatNode>();
2963 HashSet<FlatNode> toVisit = new HashSet<FlatNode>();
2966 while( !toVisit.isEmpty() ) {
2967 FlatNode n = toVisit.iterator().next();
2969 if( n instanceof FlatNew ) {
2970 s.add(getAllocSiteFromFlatNewPRIVATE( (FlatNew) n) );
2976 for( int i = 0; i < pm.numNext(n); ++i ) {
2977 FlatNode child = pm.getNext(n, i);
2978 if( !visited.contains(child) ) {
2984 mapDescriptorToAllocSiteSet.put(d, s);
2987 private HashSet<AllocSite> getFlaggedAllocationSites(Descriptor dIn) {
2989 HashSet<AllocSite> out = new HashSet<AllocSite>();
2990 HashSet<Descriptor> toVisit = new HashSet<Descriptor>();
2991 HashSet<Descriptor> visited = new HashSet<Descriptor>();
2995 while (!toVisit.isEmpty()) {
2996 Descriptor d = toVisit.iterator().next();
3000 HashSet<AllocSite> asSet = getAllocationSiteSet(d);
3001 Iterator asItr = asSet.iterator();
3002 while (asItr.hasNext()) {
3003 AllocSite as = (AllocSite) asItr.next();
3004 if (as.getDisjointAnalysisId() != null) {
3009 // enqueue callees of this method to be searched for
3010 // allocation sites also
3011 Set callees = callGraph.getCalleeSet(d);
3012 if (callees != null) {
3013 Iterator methItr = callees.iterator();
3014 while (methItr.hasNext()) {
3015 MethodDescriptor md = (MethodDescriptor) methItr.next();
3017 if (!visited.contains(md)) {
3028 private HashSet<AllocSite>
3029 getFlaggedAllocationSitesReachableFromTaskPRIVATE(TaskDescriptor td) {
3031 HashSet<AllocSite> asSetTotal = new HashSet<AllocSite>();
3032 HashSet<Descriptor> toVisit = new HashSet<Descriptor>();
3033 HashSet<Descriptor> visited = new HashSet<Descriptor>();
3037 // traverse this task and all methods reachable from this task
3038 while( !toVisit.isEmpty() ) {
3039 Descriptor d = toVisit.iterator().next();
3043 HashSet<AllocSite> asSet = getAllocationSiteSet(d);
3044 Iterator asItr = asSet.iterator();
3045 while( asItr.hasNext() ) {
3046 AllocSite as = (AllocSite) asItr.next();
3047 TypeDescriptor typed = as.getType();
3048 if( typed != null ) {
3049 ClassDescriptor cd = typed.getClassDesc();
3050 if( cd != null && cd.hasFlags() ) {
3056 // enqueue callees of this method to be searched for
3057 // allocation sites also
3058 Set callees = callGraph.getCalleeSet(d);
3059 if( callees != null ) {
3060 Iterator methItr = callees.iterator();
3061 while( methItr.hasNext() ) {
3062 MethodDescriptor md = (MethodDescriptor) methItr.next();
3064 if( !visited.contains(md) ) {
3074 public Set<Descriptor> getDescriptorsToAnalyze() {
3075 return descriptorsToAnalyze;
3078 public EffectsAnalysis getEffectsAnalysis() {
3079 return effectsAnalysis;
3082 public ReachGraph getReachGraph(Descriptor d) {
3083 return mapDescriptorToCompleteReachGraph.get(d);
3086 public ReachGraph getEnterReachGraph(FlatNode fn) {
3087 return fn2rgAtEnter.get(fn);
3092 protected class DebugCallSiteData {
3093 public boolean debugCallSite;
3094 public boolean didOneDebug;
3095 public boolean writeDebugDOTs;
3096 public boolean stopAfter;
3098 public DebugCallSiteData() {
3099 debugCallSite = false;
3100 didOneDebug = false;
3101 writeDebugDOTs = false;
3106 protected void decideDebugCallSite( DebugCallSiteData dcsd,
3107 Descriptor taskOrMethodCaller,
3108 MethodDescriptor mdCallee ) {
3110 // all this jimma jamma to debug call sites is WELL WORTH the
3111 // effort, so so so many bugs or buggy info appears through call
3114 if( state.DISJOINTDEBUGCALLEE == null ||
3115 state.DISJOINTDEBUGCALLER == null ) {
3120 boolean debugCalleeMatches = false;
3121 boolean debugCallerMatches = false;
3123 ClassDescriptor cdCallee = mdCallee.getClassDesc();
3124 if( cdCallee != null ) {
3125 debugCalleeMatches =
3126 state.DISJOINTDEBUGCALLEE.equals( cdCallee.getSymbol()+
3128 mdCallee.getSymbol()
3133 if( taskOrMethodCaller instanceof MethodDescriptor ) {
3134 ClassDescriptor cdCaller = ((MethodDescriptor)taskOrMethodCaller).getClassDesc();
3135 if( cdCaller != null ) {
3136 debugCallerMatches =
3137 state.DISJOINTDEBUGCALLER.equals( cdCaller.getSymbol()+
3139 taskOrMethodCaller.getSymbol()
3143 // for bristlecone style tasks
3144 debugCallerMatches =
3145 state.DISJOINTDEBUGCALLER.equals( taskOrMethodCaller.getSymbol() );
3149 dcsd.debugCallSite = debugCalleeMatches && debugCallerMatches;
3152 dcsd.writeDebugDOTs =
3154 dcsd.debugCallSite &&
3156 (ReachGraph.debugCallSiteVisitCounter >=
3157 ReachGraph.debugCallSiteVisitStartCapture) &&
3159 (ReachGraph.debugCallSiteVisitCounter <
3160 ReachGraph.debugCallSiteVisitStartCapture +
3161 ReachGraph.debugCallSiteNumVisitsToCapture);
3165 if( dcsd.debugCallSite ) {
3166 dcsd.didOneDebug = true;
3170 protected void statusDebugCallSite( DebugCallSiteData dcsd ) {
3172 dcsd.writeDebugDOTs = false;
3173 dcsd.stopAfter = false;
3175 if( dcsd.didOneDebug ) {
3176 System.out.println(" $$$ Debug call site visit "+
3177 ReachGraph.debugCallSiteVisitCounter+
3181 (ReachGraph.debugCallSiteVisitCounter >=
3182 ReachGraph.debugCallSiteVisitStartCapture) &&
3184 (ReachGraph.debugCallSiteVisitCounter <
3185 ReachGraph.debugCallSiteVisitStartCapture +
3186 ReachGraph.debugCallSiteNumVisitsToCapture)
3188 dcsd.writeDebugDOTs = true;
3189 System.out.println(" $$$ Capturing this call site visit $$$");
3190 if( ReachGraph.debugCallSiteStopAfter &&
3191 (ReachGraph.debugCallSiteVisitCounter ==
3192 ReachGraph.debugCallSiteVisitStartCapture +
3193 ReachGraph.debugCallSiteNumVisitsToCapture - 1)
3195 dcsd.stopAfter = true;
3199 ++ReachGraph.debugCallSiteVisitCounter;
3202 if( dcsd.stopAfter ) {
3203 System.out.println("$$$ Exiting after requested captures of call site. $$$");
3212 // get successive captures of the analysis state, use compiler
3214 boolean takeDebugSnapshots = false;
3215 String descSymbolDebug = null;
3216 boolean stopAfterCapture = false;
3217 int snapVisitCounter = 0;
3218 int snapNodeCounter = 0;
3219 int visitStartCapture = 0;
3220 int numVisitsToCapture = 0;
3223 void debugSnapshot(ReachGraph rg, FlatNode fn, boolean in) {
3224 if( snapVisitCounter > visitStartCapture + numVisitsToCapture ) {
3232 if( snapVisitCounter >= visitStartCapture ) {
3233 System.out.println(" @@@ snapping visit="+snapVisitCounter+
3234 ", node="+snapNodeCounter+
3238 graphName = String.format("snap%03d_%04din",
3242 graphName = String.format("snap%03d_%04dout",
3247 graphName = graphName + fn;
3249 rg.writeGraph(graphName,
3250 true, // write labels (variables)
3251 true, // selectively hide intermediate temp vars
3252 true, // prune unreachable heap regions
3253 false, // hide reachability
3254 true, // hide subset reachability states
3255 true, // hide predicates
3256 true); // hide edge taints
3263 public Set<Alloc> canPointToAt( TempDescriptor x,
3264 FlatNode programPoint ) {
3266 ReachGraph rgAtEnter = fn2rgAtEnter.get( programPoint );
3267 if( rgAtEnter == null ) {
3271 return rgAtEnter.canPointTo( x );
3275 public Hashtable< Alloc, Set<Alloc> > canPointToAt( TempDescriptor x,
3277 FlatNode programPoint ) {
3279 ReachGraph rgAtEnter = fn2rgAtEnter.get( programPoint );
3280 if( rgAtEnter == null ) {
3284 return rgAtEnter.canPointTo( x, f.getSymbol(), f.getType() );
3288 public Hashtable< Alloc, Set<Alloc> > canPointToAtElement( TempDescriptor x,
3289 FlatNode programPoint ) {
3291 ReachGraph rgAtEnter = fn2rgAtEnter.get( programPoint );
3292 if( rgAtEnter == null ) {
3296 assert x.getType() != null;
3297 assert x.getType().isArray();
3299 return rgAtEnter.canPointTo( x, arrayElementFieldName, x.getType().dereference() );
3303 public Set<Alloc> canPointToAfter( TempDescriptor x,
3304 FlatNode programPoint ) {
3306 ReachGraph rgAtExit = fn2rgAtExit.get( programPoint );
3308 if( rgAtExit == null ) {
3312 return rgAtExit.canPointTo( x );
3316 public Hashtable< Alloc, Set<Alloc> > canPointToAfter( TempDescriptor x,
3318 FlatNode programPoint ) {
3320 ReachGraph rgAtExit = fn2rgAtExit.get( programPoint );
3321 if( rgAtExit == null ) {
3325 return rgAtExit.canPointTo( x, f.getSymbol(), f.getType() );
3329 public Hashtable< Alloc, Set<Alloc> > canPointToAfterElement( TempDescriptor x,
3330 FlatNode programPoint ) {
3332 ReachGraph rgAtExit = fn2rgAtExit.get( programPoint );
3333 if( rgAtExit == null ) {
3337 assert x.getType() != null;
3338 assert x.getType().isArray();
3340 return rgAtExit.canPointTo( x, arrayElementFieldName, x.getType().dereference() );
3344 // to evaluate convergence behavior
3345 private static long totalMethodVisits = 0;
3346 private static long totalNodeVisits = 0;