1 package Analysis.Disjoint;
3 import Analysis.CallGraph.*;
4 import Analysis.Liveness;
5 import Analysis.ArrayReferencees;
6 import Analysis.OoOJava.RBlockRelationAnalysis;
7 import Analysis.OoOJava.RBlockStatusAnalysis;
10 import IR.Tree.Modifiers;
15 public class DisjointAnalysis {
17 ///////////////////////////////////////////
19 // Public interface to discover possible
20 // aliases in the program under analysis
22 ///////////////////////////////////////////
24 public HashSet<AllocSite>
25 getFlaggedAllocationSitesReachableFromTask(TaskDescriptor td) {
26 checkAnalysisComplete();
27 return getFlaggedAllocationSitesReachableFromTaskPRIVATE(td);
30 public AllocSite getAllocationSiteFromFlatNew(FlatNew fn) {
31 checkAnalysisComplete();
32 return getAllocSiteFromFlatNewPRIVATE(fn);
35 public AllocSite getAllocationSiteFromHeapRegionNodeID(Integer id) {
36 checkAnalysisComplete();
37 return mapHrnIdToAllocSite.get(id);
40 public Set<HeapRegionNode> hasPotentialSharing(Descriptor taskOrMethod,
43 checkAnalysisComplete();
44 ReachGraph rg=mapDescriptorToCompleteReachGraph.get(taskOrMethod);
45 FlatMethod fm=state.getMethodFlat(taskOrMethod);
47 return rg.mayReachSharedObjects(fm, paramIndex1, paramIndex2);
50 public Set<HeapRegionNode> hasPotentialSharing(Descriptor taskOrMethod,
51 int paramIndex, AllocSite alloc) {
52 checkAnalysisComplete();
53 ReachGraph rg = mapDescriptorToCompleteReachGraph.get(taskOrMethod);
54 FlatMethod fm=state.getMethodFlat(taskOrMethod);
56 return rg.mayReachSharedObjects(fm, paramIndex, alloc);
59 public Set<HeapRegionNode> hasPotentialSharing(Descriptor taskOrMethod,
60 AllocSite alloc, int paramIndex) {
61 checkAnalysisComplete();
62 ReachGraph rg = mapDescriptorToCompleteReachGraph.get(taskOrMethod);
63 FlatMethod fm=state.getMethodFlat(taskOrMethod);
65 return rg.mayReachSharedObjects(fm, paramIndex, alloc);
68 public Set<HeapRegionNode> hasPotentialSharing(Descriptor taskOrMethod,
69 AllocSite alloc1, AllocSite alloc2) {
70 checkAnalysisComplete();
71 ReachGraph rg = mapDescriptorToCompleteReachGraph.get(taskOrMethod);
73 return rg.mayReachSharedObjects(alloc1, alloc2);
76 public String prettyPrintNodeSet(Set<HeapRegionNode> s) {
77 checkAnalysisComplete();
81 Iterator<HeapRegionNode> i = s.iterator();
83 HeapRegionNode n = i.next();
85 AllocSite as = n.getAllocSite();
87 out += " " + n.toString() + ",\n";
89 out += " " + n.toString() + ": " + as.toStringVerbose()
98 // use the methods given above to check every possible sharing class
99 // between task parameters and flagged allocation sites reachable
101 public void writeAllSharing(String outputFile,
104 boolean tabularOutput,
107 throws java.io.IOException {
108 checkAnalysisComplete();
110 BufferedWriter bw = new BufferedWriter(new FileWriter(outputFile));
112 if (!tabularOutput) {
113 bw.write("Conducting ownership analysis with allocation depth = "
114 + allocationDepth + "\n");
115 bw.write(timeReport + "\n");
120 // look through every task for potential sharing
121 Iterator taskItr = state.getTaskSymbolTable().getDescriptorsIterator();
122 while (taskItr.hasNext()) {
123 TaskDescriptor td = (TaskDescriptor) taskItr.next();
125 if (!tabularOutput) {
126 bw.write("\n---------" + td + "--------\n");
129 HashSet<AllocSite> allocSites = getFlaggedAllocationSitesReachableFromTask(td);
131 Set<HeapRegionNode> common;
133 // for each task parameter, check for sharing classes with
134 // other task parameters and every allocation site
135 // reachable from this task
136 boolean foundSomeSharing = false;
138 FlatMethod fm = state.getMethodFlat(td);
139 for (int i = 0; i < fm.numParameters(); ++i) {
141 // skip parameters with types that cannot reference
143 if( !shouldAnalysisTrack( fm.getParameter( i ).getType() ) ) {
147 // for the ith parameter check for sharing classes to all
148 // higher numbered parameters
149 for (int j = i + 1; j < fm.numParameters(); ++j) {
151 // skip parameters with types that cannot reference
153 if( !shouldAnalysisTrack( fm.getParameter( j ).getType() ) ) {
158 common = hasPotentialSharing(td, i, j);
159 if (!common.isEmpty()) {
160 foundSomeSharing = true;
162 if (!tabularOutput) {
163 bw.write("Potential sharing between parameters " + i
164 + " and " + j + ".\n");
165 bw.write(prettyPrintNodeSet(common) + "\n");
170 // for the ith parameter, check for sharing classes against
171 // the set of allocation sites reachable from this
173 Iterator allocItr = allocSites.iterator();
174 while (allocItr.hasNext()) {
175 AllocSite as = (AllocSite) allocItr.next();
176 common = hasPotentialSharing(td, i, as);
177 if (!common.isEmpty()) {
178 foundSomeSharing = true;
180 if (!tabularOutput) {
181 bw.write("Potential sharing between parameter " + i
182 + " and " + as.getFlatNew() + ".\n");
183 bw.write(prettyPrintNodeSet(common) + "\n");
189 // for each allocation site check for sharing classes with
190 // other allocation sites in the context of execution
192 HashSet<AllocSite> outerChecked = new HashSet<AllocSite>();
193 Iterator allocItr1 = allocSites.iterator();
194 while (allocItr1.hasNext()) {
195 AllocSite as1 = (AllocSite) allocItr1.next();
197 Iterator allocItr2 = allocSites.iterator();
198 while (allocItr2.hasNext()) {
199 AllocSite as2 = (AllocSite) allocItr2.next();
201 if (!outerChecked.contains(as2)) {
202 common = hasPotentialSharing(td, as1, as2);
204 if (!common.isEmpty()) {
205 foundSomeSharing = true;
207 if (!tabularOutput) {
208 bw.write("Potential sharing between "
209 + as1.getFlatNew() + " and "
210 + as2.getFlatNew() + ".\n");
211 bw.write(prettyPrintNodeSet(common) + "\n");
217 outerChecked.add(as1);
220 if (!foundSomeSharing) {
221 if (!tabularOutput) {
222 bw.write("No sharing between flagged objects in Task " + td
230 bw.write(" & " + numSharing + " & " + justTime + " & " + numLines
231 + " & " + numMethodsAnalyzed() + " \\\\\n");
233 bw.write("\nNumber sharing classes: "+numSharing);
239 // this version of writeAllSharing is for Java programs that have no tasks
240 public void writeAllSharingJava(String outputFile,
243 boolean tabularOutput,
246 throws java.io.IOException {
247 checkAnalysisComplete();
253 BufferedWriter bw = new BufferedWriter(new FileWriter(outputFile));
255 bw.write("Conducting disjoint reachability analysis with allocation depth = "
256 + allocationDepth + "\n");
257 bw.write(timeReport + "\n\n");
259 boolean foundSomeSharing = false;
261 Descriptor d = typeUtil.getMain();
262 HashSet<AllocSite> allocSites = getFlaggedAllocationSites(d);
264 // for each allocation site check for sharing classes with
265 // other allocation sites in the context of execution
267 HashSet<AllocSite> outerChecked = new HashSet<AllocSite>();
268 Iterator allocItr1 = allocSites.iterator();
269 while (allocItr1.hasNext()) {
270 AllocSite as1 = (AllocSite) allocItr1.next();
272 Iterator allocItr2 = allocSites.iterator();
273 while (allocItr2.hasNext()) {
274 AllocSite as2 = (AllocSite) allocItr2.next();
276 if (!outerChecked.contains(as2)) {
277 Set<HeapRegionNode> common = hasPotentialSharing(d,
280 if (!common.isEmpty()) {
281 foundSomeSharing = true;
282 bw.write("Potential sharing between "
283 + as1.getDisjointAnalysisId() + " and "
284 + as2.getDisjointAnalysisId() + ".\n");
285 bw.write(prettyPrintNodeSet(common) + "\n");
291 outerChecked.add(as1);
294 if (!foundSomeSharing) {
295 bw.write("No sharing classes between flagged objects found.\n");
297 bw.write("\nNumber sharing classes: "+numSharing);
300 bw.write("Number of methods analyzed: "+numMethodsAnalyzed()+"\n");
305 ///////////////////////////////////////////
307 // end public interface
309 ///////////////////////////////////////////
311 protected void checkAnalysisComplete() {
312 if( !analysisComplete ) {
313 throw new Error("Warning: public interface method called while analysis is running.");
318 // run in faster mode, only when bugs wrung out!
319 public static boolean releaseMode;
321 // use command line option to set this, analysis
322 // should attempt to be deterministic
323 public static boolean determinismDesired;
325 // when we want to enforce determinism in the
326 // analysis we need to sort descriptors rather
327 // than toss them in efficient sets, use this
328 public static DescriptorComparator dComp =
329 new DescriptorComparator();
332 // data from the compiler
334 public CallGraph callGraph;
335 public Liveness liveness;
336 public ArrayReferencees arrayReferencees;
337 public RBlockRelationAnalysis rblockRel;
338 public RBlockStatusAnalysis rblockStatus;
339 public TypeUtil typeUtil;
340 public int allocationDepth;
342 protected boolean doEffectsAnalysis = false;
343 protected EffectsAnalysis effectsAnalysis;
345 // data structure for public interface
346 private Hashtable< Descriptor, HashSet<AllocSite> >
347 mapDescriptorToAllocSiteSet;
350 // for public interface methods to warn that they
351 // are grabbing results during analysis
352 private boolean analysisComplete;
355 // used to identify HeapRegionNode objects
356 // A unique ID equates an object in one
357 // ownership graph with an object in another
358 // graph that logically represents the same
360 // start at 10 and increment to reserve some
361 // IDs for special purposes
362 static protected int uniqueIDcount = 10;
365 // An out-of-scope method created by the
366 // analysis that has no parameters, and
367 // appears to allocate the command line
368 // arguments, then invoke the source code's
369 // main method. The purpose of this is to
370 // provide the analysis with an explicit
371 // top-level context with no parameters
372 protected MethodDescriptor mdAnalysisEntry;
373 protected FlatMethod fmAnalysisEntry;
375 // main method defined by source program
376 protected MethodDescriptor mdSourceEntry;
378 // the set of task and/or method descriptors
379 // reachable in call graph
380 protected Set<Descriptor>
381 descriptorsToAnalyze;
383 // current descriptors to visit in fixed-point
384 // interprocedural analysis, prioritized by
385 // dependency in the call graph
386 protected Stack<Descriptor>
387 descriptorsToVisitStack;
388 protected PriorityQueue<DescriptorQWrapper>
391 // a duplication of the above structure, but
392 // for efficient testing of inclusion
393 protected HashSet<Descriptor>
394 descriptorsToVisitSet;
396 // storage for priorities (doesn't make sense)
397 // to add it to the Descriptor class, just in
399 protected Hashtable<Descriptor, Integer>
400 mapDescriptorToPriority;
402 // when analyzing a method and scheduling more:
403 // remember set of callee's enqueued for analysis
404 // so they can be put on top of the callers in
405 // the stack-visit mode
406 protected Set<Descriptor>
409 // maps a descriptor to its current partial result
410 // from the intraprocedural fixed-point analysis--
411 // then the interprocedural analysis settles, this
412 // mapping will have the final results for each
414 protected Hashtable<Descriptor, ReachGraph>
415 mapDescriptorToCompleteReachGraph;
417 // maps a descriptor to its known dependents: namely
418 // methods or tasks that call the descriptor's method
419 // AND are part of this analysis (reachable from main)
420 protected Hashtable< Descriptor, Set<Descriptor> >
421 mapDescriptorToSetDependents;
423 // maps each flat new to one analysis abstraction
424 // allocate site object, these exist outside reach graphs
425 protected Hashtable<FlatNew, AllocSite>
426 mapFlatNewToAllocSite;
428 // maps intergraph heap region IDs to intergraph
429 // allocation sites that created them, a redundant
430 // structure for efficiency in some operations
431 protected Hashtable<Integer, AllocSite>
434 // maps a method to its initial heap model (IHM) that
435 // is the set of reachability graphs from every caller
436 // site, all merged together. The reason that we keep
437 // them separate is that any one call site's contribution
438 // to the IHM may changed along the path to the fixed point
439 protected Hashtable< Descriptor, Hashtable< FlatCall, ReachGraph > >
440 mapDescriptorToIHMcontributions;
442 // additionally, keep a mapping from descriptors to the
443 // merged in-coming initial context, because we want this
444 // initial context to be STRICTLY MONOTONIC
445 protected Hashtable<Descriptor, ReachGraph>
446 mapDescriptorToInitialContext;
448 // make the result for back edges analysis-wide STRICTLY
449 // MONOTONIC as well, but notice we use FlatNode as the
450 // key for this map: in case we want to consider other
451 // nodes as back edge's in future implementations
452 protected Hashtable<FlatNode, ReachGraph>
453 mapBackEdgeToMonotone;
456 public static final String arrayElementFieldName = "___element_";
457 static protected Hashtable<TypeDescriptor, FieldDescriptor>
460 // for controlling DOT file output
461 protected boolean writeFinalDOTs;
462 protected boolean writeAllIncrementalDOTs;
464 // supporting DOT output--when we want to write every
465 // partial method result, keep a tally for generating
467 protected Hashtable<Descriptor, Integer>
468 mapDescriptorToNumUpdates;
470 //map task descriptor to initial task parameter
471 protected Hashtable<Descriptor, ReachGraph>
472 mapDescriptorToReachGraph;
474 protected PointerMethod pm;
476 static protected Hashtable<FlatNode, ReachGraph> fn2rg =
477 new Hashtable<FlatNode, ReachGraph>();
479 private Hashtable<FlatCall, Descriptor> fc2enclosing;
482 // allocate various structures that are not local
483 // to a single class method--should be done once
484 protected void allocateStructures() {
486 if( determinismDesired ) {
487 // use an ordered set
488 descriptorsToAnalyze = new TreeSet<Descriptor>( dComp );
490 // otherwise use a speedy hashset
491 descriptorsToAnalyze = new HashSet<Descriptor>();
494 mapDescriptorToCompleteReachGraph =
495 new Hashtable<Descriptor, ReachGraph>();
497 mapDescriptorToNumUpdates =
498 new Hashtable<Descriptor, Integer>();
500 mapDescriptorToSetDependents =
501 new Hashtable< Descriptor, Set<Descriptor> >();
503 mapFlatNewToAllocSite =
504 new Hashtable<FlatNew, AllocSite>();
506 mapDescriptorToIHMcontributions =
507 new Hashtable< Descriptor, Hashtable< FlatCall, ReachGraph > >();
509 mapDescriptorToInitialContext =
510 new Hashtable<Descriptor, ReachGraph>();
512 mapBackEdgeToMonotone =
513 new Hashtable<FlatNode, ReachGraph>();
515 mapHrnIdToAllocSite =
516 new Hashtable<Integer, AllocSite>();
518 mapTypeToArrayField =
519 new Hashtable <TypeDescriptor, FieldDescriptor>();
521 if( state.DISJOINTDVISITSTACK ||
522 state.DISJOINTDVISITSTACKEESONTOP
524 descriptorsToVisitStack =
525 new Stack<Descriptor>();
528 if( state.DISJOINTDVISITPQUE ) {
529 descriptorsToVisitQ =
530 new PriorityQueue<DescriptorQWrapper>();
533 descriptorsToVisitSet =
534 new HashSet<Descriptor>();
536 mapDescriptorToPriority =
537 new Hashtable<Descriptor, Integer>();
540 new HashSet<Descriptor>();
542 mapDescriptorToAllocSiteSet =
543 new Hashtable<Descriptor, HashSet<AllocSite> >();
545 mapDescriptorToReachGraph =
546 new Hashtable<Descriptor, ReachGraph>();
548 pm = new PointerMethod();
550 fc2enclosing = new Hashtable<FlatCall, Descriptor>();
555 // this analysis generates a disjoint reachability
556 // graph for every reachable method in the program
557 public DisjointAnalysis( State s,
562 RBlockRelationAnalysis rra,
563 RBlockStatusAnalysis rsa
565 init( s, tu, cg, l, ar, rra, rsa );
568 protected void init( State state,
572 ArrayReferencees arrayReferencees,
573 RBlockRelationAnalysis rra,
574 RBlockStatusAnalysis rsa
577 analysisComplete = false;
580 this.typeUtil = typeUtil;
581 this.callGraph = callGraph;
582 this.liveness = liveness;
583 this.arrayReferencees = arrayReferencees;
584 this.rblockRel = rra;
585 this.rblockStatus = rsa;
587 if( rblockRel != null ) {
588 doEffectsAnalysis = true;
589 effectsAnalysis = new EffectsAnalysis();
592 this.allocationDepth = state.DISJOINTALLOCDEPTH;
593 this.releaseMode = state.DISJOINTRELEASEMODE;
594 this.determinismDesired = state.DISJOINTDETERMINISM;
596 this.writeFinalDOTs = state.DISJOINTWRITEDOTS && !state.DISJOINTWRITEALL;
597 this.writeAllIncrementalDOTs = state.DISJOINTWRITEDOTS && state.DISJOINTWRITEALL;
599 this.takeDebugSnapshots = state.DISJOINTSNAPSYMBOL != null;
600 this.descSymbolDebug = state.DISJOINTSNAPSYMBOL;
601 this.visitStartCapture = state.DISJOINTSNAPVISITTOSTART;
602 this.numVisitsToCapture = state.DISJOINTSNAPNUMVISITS;
603 this.stopAfterCapture = state.DISJOINTSNAPSTOPAFTER;
604 this.snapVisitCounter = 1; // count visits from 1 (user will write 1, means 1st visit)
605 this.snapNodeCounter = 0; // count nodes from 0
608 state.DISJOINTDVISITSTACK ||
609 state.DISJOINTDVISITPQUE ||
610 state.DISJOINTDVISITSTACKEESONTOP;
611 assert !(state.DISJOINTDVISITSTACK && state.DISJOINTDVISITPQUE);
612 assert !(state.DISJOINTDVISITSTACK && state.DISJOINTDVISITSTACKEESONTOP);
613 assert !(state.DISJOINTDVISITPQUE && state.DISJOINTDVISITSTACKEESONTOP);
615 // set some static configuration for ReachGraphs
616 ReachGraph.allocationDepth = allocationDepth;
617 ReachGraph.typeUtil = typeUtil;
619 ReachGraph.debugCallSiteVisitStartCapture
620 = state.DISJOINTDEBUGCALLVISITTOSTART;
622 ReachGraph.debugCallSiteNumVisitsToCapture
623 = state.DISJOINTDEBUGCALLNUMVISITS;
625 ReachGraph.debugCallSiteStopAfter
626 = state.DISJOINTDEBUGCALLSTOPAFTER;
628 ReachGraph.debugCallSiteVisitCounter
629 = 0; // count visits from 1, is incremented before first visit
633 allocateStructures();
635 double timeStartAnalysis = (double) System.nanoTime();
637 // start interprocedural fixed-point computation
640 } catch( IOException e ) {
641 throw new Error( "IO Exception while writing disjointness analysis output." );
644 analysisComplete=true;
646 double timeEndAnalysis = (double) System.nanoTime();
647 double dt = (timeEndAnalysis - timeStartAnalysis)/(Math.pow( 10.0, 9.0 ) );
648 String treport = String.format( "The reachability analysis took %.3f sec.", dt );
649 String justtime = String.format( "%.2f", dt );
650 System.out.println( treport );
653 if( writeFinalDOTs && !writeAllIncrementalDOTs ) {
657 if( state.DISJOINTWRITEIHMS ) {
661 if( state.DISJOINTWRITEINITCONTEXTS ) {
662 writeInitialContexts();
665 if( state.DISJOINTALIASFILE != null ) {
667 writeAllSharing(state.DISJOINTALIASFILE, treport, justtime, state.DISJOINTALIASTAB, state.lines);
669 writeAllSharingJava(state.DISJOINTALIASFILE,
672 state.DISJOINTALIASTAB,
677 } catch( IOException e ) {
678 throw new Error( "IO Exception while writing disjointness analysis output." );
681 if( doEffectsAnalysis ) {
682 effectsAnalysis.writeEffects( "effects.txt" );
687 protected boolean moreDescriptorsToVisit() {
688 if( state.DISJOINTDVISITSTACK ||
689 state.DISJOINTDVISITSTACKEESONTOP
691 return !descriptorsToVisitStack.isEmpty();
693 } else if( state.DISJOINTDVISITPQUE ) {
694 return !descriptorsToVisitQ.isEmpty();
697 throw new Error( "Neither descriptor visiting mode set" );
701 // fixed-point computation over the call graph--when a
702 // method's callees are updated, it must be reanalyzed
703 protected void analyzeMethods() throws java.io.IOException {
705 // task or non-task (java) mode determines what the roots
706 // of the call chain are, and establishes the set of methods
707 // reachable from the roots that will be analyzed
710 System.out.println( "Bamboo mode..." );
712 Iterator taskItr = state.getTaskSymbolTable().getDescriptorsIterator();
713 while( taskItr.hasNext() ) {
714 TaskDescriptor td = (TaskDescriptor) taskItr.next();
715 if( !descriptorsToAnalyze.contains( td ) ) {
716 // add all methods transitively reachable from the
718 descriptorsToAnalyze.add( td );
719 descriptorsToAnalyze.addAll( callGraph.getAllMethods( td ) );
724 System.out.println( "Java mode..." );
726 // add all methods transitively reachable from the
727 // source's main to set for analysis
728 mdSourceEntry = typeUtil.getMain();
729 descriptorsToAnalyze.add( mdSourceEntry );
730 descriptorsToAnalyze.addAll( callGraph.getAllMethods( mdSourceEntry ) );
732 // fabricate an empty calling context that will call
733 // the source's main, but call graph doesn't know
734 // about it, so explicitly add it
735 makeAnalysisEntryMethod( mdSourceEntry );
736 descriptorsToAnalyze.add( mdAnalysisEntry );
740 // now, depending on the interprocedural mode for visiting
741 // methods, set up the needed data structures
743 if( state.DISJOINTDVISITPQUE ) {
745 // topologically sort according to the call graph so
746 // leaf calls are last, helps build contexts up first
747 LinkedList<Descriptor> sortedDescriptors =
748 topologicalSort( descriptorsToAnalyze );
750 // add sorted descriptors to priority queue, and duplicate
751 // the queue as a set for efficiently testing whether some
752 // method is marked for analysis
754 Iterator<Descriptor> dItr;
756 // for the priority queue, give items at the head
757 // of the sorted list a low number (highest priority)
758 while( !sortedDescriptors.isEmpty() ) {
759 Descriptor d = sortedDescriptors.removeFirst();
760 mapDescriptorToPriority.put( d, new Integer( p ) );
761 descriptorsToVisitQ.add( new DescriptorQWrapper( p, d ) );
762 descriptorsToVisitSet.add( d );
766 } else if( state.DISJOINTDVISITSTACK ||
767 state.DISJOINTDVISITSTACKEESONTOP
769 // if we're doing the stack scheme, just throw the root
770 // method or tasks on the stack
772 Iterator taskItr = state.getTaskSymbolTable().getDescriptorsIterator();
773 while( taskItr.hasNext() ) {
774 TaskDescriptor td = (TaskDescriptor) taskItr.next();
775 descriptorsToVisitStack.add( td );
776 descriptorsToVisitSet.add( td );
780 descriptorsToVisitStack.add( mdAnalysisEntry );
781 descriptorsToVisitSet.add( mdAnalysisEntry );
785 throw new Error( "Unknown method scheduling mode" );
789 // analyze scheduled methods until there are no more to visit
790 while( moreDescriptorsToVisit() ) {
793 if( state.DISJOINTDVISITSTACK ||
794 state.DISJOINTDVISITSTACKEESONTOP
796 d = descriptorsToVisitStack.pop();
798 } else if( state.DISJOINTDVISITPQUE ) {
799 d = descriptorsToVisitQ.poll().getDescriptor();
802 assert descriptorsToVisitSet.contains( d );
803 descriptorsToVisitSet.remove( d );
805 // because the task or method descriptor just extracted
806 // was in the "to visit" set it either hasn't been analyzed
807 // yet, or some method that it depends on has been
808 // updated. Recompute a complete reachability graph for
809 // this task/method and compare it to any previous result.
810 // If there is a change detected, add any methods/tasks
811 // that depend on this one to the "to visit" set.
813 System.out.println( "Analyzing " + d );
815 if( state.DISJOINTDVISITSTACKEESONTOP ) {
816 assert calleesToEnqueue.isEmpty();
819 ReachGraph rg = analyzeMethod( d );
820 ReachGraph rgPrev = getPartial( d );
822 if( !rg.equals( rgPrev ) ) {
825 if( state.DISJOINTDEBUGSCHEDULING ) {
826 System.out.println( " complete graph changed, scheduling callers for analysis:" );
829 // results for d changed, so enqueue dependents
830 // of d for further analysis
831 Iterator<Descriptor> depsItr = getDependents( d ).iterator();
832 while( depsItr.hasNext() ) {
833 Descriptor dNext = depsItr.next();
836 if( state.DISJOINTDEBUGSCHEDULING ) {
837 System.out.println( " "+dNext );
842 // whether or not the method under analysis changed,
843 // we may have some callees that are scheduled for
844 // more analysis, and they should go on the top of
845 // the stack now (in other method-visiting modes they
846 // are already enqueued at this point
847 if( state.DISJOINTDVISITSTACKEESONTOP ) {
848 Iterator<Descriptor> depsItr = calleesToEnqueue.iterator();
849 while( depsItr.hasNext() ) {
850 Descriptor dNext = depsItr.next();
853 calleesToEnqueue.clear();
859 protected ReachGraph analyzeMethod( Descriptor d )
860 throws java.io.IOException {
862 // get the flat code for this descriptor
864 if( d == mdAnalysisEntry ) {
865 fm = fmAnalysisEntry;
867 fm = state.getMethodFlat( d );
869 pm.analyzeMethod( fm );
871 // intraprocedural work set
872 Set<FlatNode> flatNodesToVisit = new HashSet<FlatNode>();
873 flatNodesToVisit.add( fm );
875 // if determinism is desired by client, shadow the
876 // set with a queue to make visit order deterministic
877 Queue<FlatNode> flatNodesToVisitQ = null;
878 if( determinismDesired ) {
879 flatNodesToVisitQ = new LinkedList<FlatNode>();
880 flatNodesToVisitQ.add( fm );
883 // mapping of current partial results
884 Hashtable<FlatNode, ReachGraph> mapFlatNodeToReachGraph =
885 new Hashtable<FlatNode, ReachGraph>();
887 // the set of return nodes partial results that will be combined as
888 // the final, conservative approximation of the entire method
889 HashSet<FlatReturnNode> setReturns = new HashSet<FlatReturnNode>();
891 while( !flatNodesToVisit.isEmpty() ) {
894 if( determinismDesired ) {
895 assert !flatNodesToVisitQ.isEmpty();
896 fn = flatNodesToVisitQ.remove();
898 fn = flatNodesToVisit.iterator().next();
900 flatNodesToVisit.remove( fn );
902 // effect transfer function defined by this node,
903 // then compare it to the old graph at this node
904 // to see if anything was updated.
906 ReachGraph rg = new ReachGraph();
907 TaskDescriptor taskDesc;
908 if(fn instanceof FlatMethod && (taskDesc=((FlatMethod)fn).getTask())!=null){
909 if(mapDescriptorToReachGraph.containsKey(taskDesc)){
910 // retrieve existing reach graph if it is not first time
911 rg=mapDescriptorToReachGraph.get(taskDesc);
913 // create initial reach graph for a task
914 rg=createInitialTaskReachGraph((FlatMethod)fn);
916 mapDescriptorToReachGraph.put(taskDesc, rg);
920 // start by merging all node's parents' graphs
921 for( int i = 0; i < pm.numPrev(fn); ++i ) {
922 FlatNode pn = pm.getPrev(fn,i);
923 if( mapFlatNodeToReachGraph.containsKey( pn ) ) {
924 ReachGraph rgParent = mapFlatNodeToReachGraph.get( pn );
925 rg.merge( rgParent );
930 if( takeDebugSnapshots &&
931 d.getSymbol().equals( descSymbolDebug )
933 debugSnapshot( rg, fn, true );
937 // modify rg with appropriate transfer function
938 rg = analyzeFlatNode( d, fm, fn, setReturns, rg );
941 if( takeDebugSnapshots &&
942 d.getSymbol().equals( descSymbolDebug )
944 debugSnapshot( rg, fn, false );
949 // if the results of the new graph are different from
950 // the current graph at this node, replace the graph
951 // with the update and enqueue the children
952 ReachGraph rgPrev = mapFlatNodeToReachGraph.get( fn );
953 if( !rg.equals( rgPrev ) ) {
954 mapFlatNodeToReachGraph.put( fn, rg );
956 for( int i = 0; i < pm.numNext( fn ); i++ ) {
957 FlatNode nn = pm.getNext( fn, i );
959 flatNodesToVisit.add( nn );
960 if( determinismDesired ) {
961 flatNodesToVisitQ.add( nn );
968 // end by merging all return nodes into a complete
969 // reach graph that represents all possible heap
970 // states after the flat method returns
971 ReachGraph completeGraph = new ReachGraph();
973 assert !setReturns.isEmpty();
974 Iterator retItr = setReturns.iterator();
975 while( retItr.hasNext() ) {
976 FlatReturnNode frn = (FlatReturnNode) retItr.next();
978 assert mapFlatNodeToReachGraph.containsKey( frn );
979 ReachGraph rgRet = mapFlatNodeToReachGraph.get( frn );
981 completeGraph.merge( rgRet );
985 if( takeDebugSnapshots &&
986 d.getSymbol().equals( descSymbolDebug )
988 // increment that we've visited the debug snap
989 // method, and reset the node counter
990 System.out.println( " @@@ debug snap at visit "+snapVisitCounter );
994 if( snapVisitCounter == visitStartCapture + numVisitsToCapture &&
997 System.out.println( "!!! Stopping analysis after debug snap captures. !!!" );
1003 return completeGraph;
1007 protected ReachGraph
1008 analyzeFlatNode( Descriptor d,
1009 FlatMethod fmContaining,
1011 HashSet<FlatReturnNode> setRetNodes,
1013 ) throws java.io.IOException {
1016 // any variables that are no longer live should be
1017 // nullified in the graph to reduce edges
1018 //rg.nullifyDeadVars( liveness.getLiveInTemps( fmContaining, fn ) );
1021 if( doEffectsAnalysis && && fmContaining != fmAnalysisEntry
1022 rra.isEndOfRegion(fn)){
1023 rg.clearAccessibleVarSet();
1024 also need to clear stall mapping
1030 FieldDescriptor fld;
1032 // use node type to decide what transfer function
1033 // to apply to the reachability graph
1034 switch( fn.kind() ) {
1036 case FKind.FlatMethod: {
1037 // construct this method's initial heap model (IHM)
1038 // since we're working on the FlatMethod, we know
1039 // the incoming ReachGraph 'rg' is empty
1041 Hashtable<FlatCall, ReachGraph> heapsFromCallers =
1042 getIHMcontributions( d );
1044 Set entrySet = heapsFromCallers.entrySet();
1045 Iterator itr = entrySet.iterator();
1046 while( itr.hasNext() ) {
1047 Map.Entry me = (Map.Entry) itr.next();
1048 FlatCall fc = (FlatCall) me.getKey();
1049 ReachGraph rgContrib = (ReachGraph) me.getValue();
1051 assert fc.getMethod().equals( d );
1053 rg.merge( rgContrib );
1056 // additionally, we are enforcing STRICT MONOTONICITY for the
1057 // method's initial context, so grow the context by whatever
1058 // the previously computed context was, and put the most
1059 // up-to-date context back in the map
1060 ReachGraph rgPrevContext = mapDescriptorToInitialContext.get( d );
1061 rg.merge( rgPrevContext );
1062 mapDescriptorToInitialContext.put( d, rg );
1066 case FKind.FlatOpNode:
1067 FlatOpNode fon = (FlatOpNode) fn;
1068 if( fon.getOp().getOp() == Operation.ASSIGN ) {
1069 lhs = fon.getDest();
1070 rhs = fon.getLeft();
1071 rg.assignTempXEqualToTempY( lhs, rhs );
1073 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1074 if(rblockStatus.isInCriticalRegion(fmContaining, fn)){
1075 // x gets status of y
1076 if(rg.getAccessibleVar().contains(rhs)){
1077 rg.addAccessibleVar(lhs);
1085 case FKind.FlatCastNode:
1086 FlatCastNode fcn = (FlatCastNode) fn;
1090 TypeDescriptor td = fcn.getType();
1093 rg.assignTempXEqualToCastedTempY( lhs, rhs, td );
1096 case FKind.FlatFieldNode:
1097 FlatFieldNode ffn = (FlatFieldNode) fn;
1100 fld = ffn.getField();
1102 if( shouldAnalysisTrack( fld.getType() ) ) {
1104 // before graph transform, possible inject
1105 // a stall-site taint
1106 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1108 if(rblockStatus.isInCriticalRegion(fmContaining, fn)){
1109 // x=y.f, stall y if not accessible
1110 // contributes read effects on stall site of y
1111 if(!rg.isAccessible(rhs)) {
1112 rg.taintStallSite(fn, rhs);
1115 // after this, x and y are accessbile.
1116 rg.addAccessibleVar(lhs);
1117 rg.addAccessibleVar(rhs);
1122 rg.assignTempXEqualToTempYFieldF( lhs, rhs, fld );
1124 // after transfer, use updated graph to
1125 // do effects analysis
1126 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1127 effectsAnalysis.analyzeFlatFieldNode( rg, rhs, fld );
1132 case FKind.FlatSetFieldNode:
1133 FlatSetFieldNode fsfn = (FlatSetFieldNode) fn;
1134 lhs = fsfn.getDst();
1135 fld = fsfn.getField();
1136 rhs = fsfn.getSrc();
1138 if( shouldAnalysisTrack( fld.getType() ) ) {
1140 // before transfer func, possibly inject
1141 // stall-site taints
1142 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1144 if(rblockStatus.isInCriticalRegion(fmContaining, fn)){
1145 // x.y=f , stall x and y if they are not accessible
1146 // also contribute write effects on stall site of x
1147 if(!rg.isAccessible(lhs)) {
1148 rg.taintStallSite(fn, lhs);
1151 if(!rg.isAccessible(rhs)) {
1152 rg.taintStallSite(fn, rhs);
1155 // accessible status update
1156 rg.addAccessibleVar(lhs);
1157 rg.addAccessibleVar(rhs);
1162 boolean strongUpdate = rg.assignTempXFieldFEqualToTempY( lhs, fld, rhs );
1164 // use transformed graph to do effects analysis
1165 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1166 effectsAnalysis.analyzeFlatSetFieldNode( rg, lhs, fld, strongUpdate );
1171 case FKind.FlatElementNode:
1172 FlatElementNode fen = (FlatElementNode) fn;
1175 if( shouldAnalysisTrack( lhs.getType() ) ) {
1177 assert rhs.getType() != null;
1178 assert rhs.getType().isArray();
1180 TypeDescriptor tdElement = rhs.getType().dereference();
1181 FieldDescriptor fdElement = getArrayField( tdElement );
1183 // before transfer func, possibly inject
1185 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1187 if(rblockStatus.isInCriticalRegion(fmContaining, fn)){
1188 // x=y.f, stall y if not accessible
1189 // contributes read effects on stall site of y
1190 // after this, x and y are accessbile.
1191 if(!rg.isAccessible(rhs)) {
1192 rg.taintStallSite(fn, rhs);
1195 rg.addAccessibleVar(lhs);
1196 rg.addAccessibleVar(rhs);
1201 rg.assignTempXEqualToTempYFieldF( lhs, rhs, fdElement );
1203 // use transformed graph to do effects analysis
1204 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1205 effectsAnalysis.analyzeFlatFieldNode( rg, rhs, fdElement );
1210 case FKind.FlatSetElementNode:
1211 FlatSetElementNode fsen = (FlatSetElementNode) fn;
1213 if( arrayReferencees.doesNotCreateNewReaching( fsen ) ) {
1214 // skip this node if it cannot create new reachability paths
1218 lhs = fsen.getDst();
1219 rhs = fsen.getSrc();
1220 if( shouldAnalysisTrack( rhs.getType() ) ) {
1222 assert lhs.getType() != null;
1223 assert lhs.getType().isArray();
1225 TypeDescriptor tdElement = lhs.getType().dereference();
1226 FieldDescriptor fdElement = getArrayField( tdElement );
1228 // before transfer func, possibly inject
1229 // stall-site taints
1230 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1232 if(rblockStatus.isInCriticalRegion(fmContaining, fn)){
1233 // x.y=f , stall x and y if they are not accessible
1234 // also contribute write effects on stall site of x
1235 if(!rg.isAccessible(lhs)) {
1236 rg.taintStallSite(fn, lhs);
1239 if(!rg.isAccessible(rhs)) {
1240 rg.taintStallSite(fn, rhs);
1243 // accessible status update
1244 rg.addAccessibleVar(lhs);
1245 rg.addAccessibleVar(rhs);
1250 rg.assignTempXFieldFEqualToTempY( lhs, fdElement, rhs );
1252 // use transformed graph to do effects analysis
1253 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1254 effectsAnalysis.analyzeFlatSetFieldNode( rg, lhs, fdElement,
1261 FlatNew fnn = (FlatNew) fn;
1263 if( shouldAnalysisTrack( lhs.getType() ) ) {
1264 AllocSite as = getAllocSiteFromFlatNewPRIVATE( fnn );
1265 rg.assignTempEqualToNewAlloc( lhs, as );
1267 if (doEffectsAnalysis && fmContaining != fmAnalysisEntry) {
1268 if (rblockStatus.isInCriticalRegion(fmContaining, fn)) {
1269 // after creating new object, lhs is accessible
1270 rg.addAccessibleVar(lhs);
1277 case FKind.FlatSESEEnterNode:
1278 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1280 // always remove ALL stall site taints at enter
1281 rg.removeAllStallSiteTaints();
1283 // inject taints for in-set vars
1284 FlatSESEEnterNode sese = (FlatSESEEnterNode) fn;
1285 rg.taintInSetVars( sese );
1289 case FKind.FlatSESEExitNode:
1290 if( doEffectsAnalysis && fmContaining != fmAnalysisEntry ) {
1292 // always remove ALL stall site taints at exit
1293 rg.removeAllStallSiteTaints();
1295 // remove in-set vars for the exiting rblock
1296 FlatSESEExitNode fsexn = (FlatSESEExitNode) fn;
1297 rg.removeInContextTaints( fsexn.getFlatEnter() );
1299 // sese exit clears all mappings of accessible vars and stall sites
1300 // need to wipe out stall site taints
1301 rg.clearAccessibleVarSet();
1306 case FKind.FlatCall: {
1307 Descriptor mdCaller;
1308 if( fmContaining.getMethod() != null ){
1309 mdCaller = fmContaining.getMethod();
1311 mdCaller = fmContaining.getTask();
1313 FlatCall fc = (FlatCall) fn;
1314 MethodDescriptor mdCallee = fc.getMethod();
1315 FlatMethod fmCallee = state.getMethodFlat( mdCallee );
1318 boolean debugCallSite =
1319 mdCaller.getSymbol().equals( state.DISJOINTDEBUGCALLER ) &&
1320 mdCallee.getSymbol().equals( state.DISJOINTDEBUGCALLEE );
1322 boolean writeDebugDOTs = false;
1323 boolean stopAfter = false;
1324 if( debugCallSite ) {
1325 ++ReachGraph.debugCallSiteVisitCounter;
1326 System.out.println( " $$$ Debug call site visit "+
1327 ReachGraph.debugCallSiteVisitCounter+
1331 (ReachGraph.debugCallSiteVisitCounter >=
1332 ReachGraph.debugCallSiteVisitStartCapture) &&
1334 (ReachGraph.debugCallSiteVisitCounter <
1335 ReachGraph.debugCallSiteVisitStartCapture +
1336 ReachGraph.debugCallSiteNumVisitsToCapture)
1338 writeDebugDOTs = true;
1339 System.out.println( " $$$ Capturing this call site visit $$$" );
1340 if( ReachGraph.debugCallSiteStopAfter &&
1341 (ReachGraph.debugCallSiteVisitCounter ==
1342 ReachGraph.debugCallSiteVisitStartCapture +
1343 ReachGraph.debugCallSiteNumVisitsToCapture - 1)
1351 // calculate the heap this call site can reach--note this is
1352 // not used for the current call site transform, we are
1353 // grabbing this heap model for future analysis of the callees,
1354 // so if different results emerge we will return to this site
1355 ReachGraph heapForThisCall_old =
1356 getIHMcontribution( mdCallee, fc );
1358 // the computation of the callee-reachable heap
1359 // is useful for making the callee starting point
1360 // and for applying the call site transfer function
1361 Set<Integer> callerNodeIDsCopiedToCallee =
1362 new HashSet<Integer>();
1364 ReachGraph heapForThisCall_cur =
1365 rg.makeCalleeView( fc,
1367 callerNodeIDsCopiedToCallee,
1371 if( !heapForThisCall_cur.equals( heapForThisCall_old ) ) {
1372 // if heap at call site changed, update the contribution,
1373 // and reschedule the callee for analysis
1374 addIHMcontribution( mdCallee, fc, heapForThisCall_cur );
1376 // map a FlatCall to its enclosing method/task descriptor
1377 // so we can write that info out later
1378 fc2enclosing.put( fc, mdCaller );
1380 if( state.DISJOINTDEBUGSCHEDULING ) {
1381 System.out.println( " context changed, scheduling callee: "+mdCallee );
1384 if( state.DISJOINTDVISITSTACKEESONTOP ) {
1385 calleesToEnqueue.add( mdCallee );
1387 enqueue( mdCallee );
1392 // the transformation for a call site should update the
1393 // current heap abstraction with any effects from the callee,
1394 // or if the method is virtual, the effects from any possible
1395 // callees, so find the set of callees...
1396 Set<MethodDescriptor> setPossibleCallees;
1397 if( determinismDesired ) {
1398 // use an ordered set
1399 setPossibleCallees = new TreeSet<MethodDescriptor>( dComp );
1401 // otherwise use a speedy hashset
1402 setPossibleCallees = new HashSet<MethodDescriptor>();
1405 if( mdCallee.isStatic() ) {
1406 setPossibleCallees.add( mdCallee );
1408 TypeDescriptor typeDesc = fc.getThis().getType();
1409 setPossibleCallees.addAll( callGraph.getMethods( mdCallee,
1414 ReachGraph rgMergeOfEffects = new ReachGraph();
1416 Iterator<MethodDescriptor> mdItr = setPossibleCallees.iterator();
1417 while( mdItr.hasNext() ) {
1418 MethodDescriptor mdPossible = mdItr.next();
1419 FlatMethod fmPossible = state.getMethodFlat( mdPossible );
1421 addDependent( mdPossible, // callee
1424 // don't alter the working graph (rg) until we compute a
1425 // result for every possible callee, merge them all together,
1426 // then set rg to that
1427 ReachGraph rgCopy = new ReachGraph();
1430 ReachGraph rgEffect = getPartial( mdPossible );
1432 if( rgEffect == null ) {
1433 // if this method has never been analyzed just schedule it
1434 // for analysis and skip over this call site for now
1435 if( state.DISJOINTDVISITSTACKEESONTOP ) {
1436 calleesToEnqueue.add( mdPossible );
1438 enqueue( mdPossible );
1441 if( state.DISJOINTDEBUGSCHEDULING ) {
1442 System.out.println( " callee hasn't been analyzed, scheduling: "+mdPossible );
1447 // calculate the method call transform
1448 rgCopy.resolveMethodCall( fc,
1451 callerNodeIDsCopiedToCallee,
1456 rgMergeOfEffects.merge( rgCopy );
1461 System.out.println( "$$$ Exiting after requested captures of call site. $$$" );
1466 // now that we've taken care of building heap models for
1467 // callee analysis, finish this transformation
1468 rg = rgMergeOfEffects;
1472 case FKind.FlatReturnNode:
1473 FlatReturnNode frn = (FlatReturnNode) fn;
1474 rhs = frn.getReturnTemp();
1475 if( rhs != null && shouldAnalysisTrack( rhs.getType() ) ) {
1476 rg.assignReturnEqualToTemp( rhs );
1478 setRetNodes.add( frn );
1484 // dead variables were removed before the above transfer function
1485 // was applied, so eliminate heap regions and edges that are no
1486 // longer part of the abstractly-live heap graph, and sweep up
1487 // and reachability effects that are altered by the reduction
1488 //rg.abstractGarbageCollect();
1492 // back edges are strictly monotonic
1493 if( pm.isBackEdge( fn ) ) {
1494 ReachGraph rgPrevResult = mapBackEdgeToMonotone.get( fn );
1495 rg.merge( rgPrevResult );
1496 mapBackEdgeToMonotone.put( fn, rg );
1499 // at this point rg should be the correct update
1500 // by an above transfer function, or untouched if
1501 // the flat node type doesn't affect the heap
1507 // this method should generate integers strictly greater than zero!
1508 // special "shadow" regions are made from a heap region by negating
1510 static public Integer generateUniqueHeapRegionNodeID() {
1512 return new Integer( uniqueIDcount );
1517 static public FieldDescriptor getArrayField( TypeDescriptor tdElement ) {
1518 FieldDescriptor fdElement = mapTypeToArrayField.get( tdElement );
1519 if( fdElement == null ) {
1520 fdElement = new FieldDescriptor( new Modifiers( Modifiers.PUBLIC ),
1522 arrayElementFieldName,
1525 mapTypeToArrayField.put( tdElement, fdElement );
1532 private void writeFinalGraphs() {
1533 Set entrySet = mapDescriptorToCompleteReachGraph.entrySet();
1534 Iterator itr = entrySet.iterator();
1535 while( itr.hasNext() ) {
1536 Map.Entry me = (Map.Entry) itr.next();
1537 Descriptor d = (Descriptor) me.getKey();
1538 ReachGraph rg = (ReachGraph) me.getValue();
1540 rg.writeGraph( "COMPLETE"+d,
1541 true, // write labels (variables)
1542 true, // selectively hide intermediate temp vars
1543 true, // prune unreachable heap regions
1544 false, // hide reachability altogether
1545 true, // hide subset reachability states
1546 true, // hide predicates
1547 false ); // hide edge taints
1551 private void writeFinalIHMs() {
1552 Iterator d2IHMsItr = mapDescriptorToIHMcontributions.entrySet().iterator();
1553 while( d2IHMsItr.hasNext() ) {
1554 Map.Entry me1 = (Map.Entry) d2IHMsItr.next();
1555 Descriptor d = (Descriptor) me1.getKey();
1556 Hashtable<FlatCall, ReachGraph> IHMs = (Hashtable<FlatCall, ReachGraph>) me1.getValue();
1558 Iterator fc2rgItr = IHMs.entrySet().iterator();
1559 while( fc2rgItr.hasNext() ) {
1560 Map.Entry me2 = (Map.Entry) fc2rgItr.next();
1561 FlatCall fc = (FlatCall) me2.getKey();
1562 ReachGraph rg = (ReachGraph) me2.getValue();
1564 rg.writeGraph( "IHMPARTFOR"+d+"FROM"+fc2enclosing.get( fc )+fc,
1565 true, // write labels (variables)
1566 true, // selectively hide intermediate temp vars
1567 true, // hide reachability altogether
1568 true, // prune unreachable heap regions
1569 true, // hide subset reachability states
1570 false, // hide predicates
1571 true ); // hide edge taints
1576 private void writeInitialContexts() {
1577 Set entrySet = mapDescriptorToInitialContext.entrySet();
1578 Iterator itr = entrySet.iterator();
1579 while( itr.hasNext() ) {
1580 Map.Entry me = (Map.Entry) itr.next();
1581 Descriptor d = (Descriptor) me.getKey();
1582 ReachGraph rg = (ReachGraph) me.getValue();
1584 rg.writeGraph( "INITIAL"+d,
1585 true, // write labels (variables)
1586 true, // selectively hide intermediate temp vars
1587 true, // prune unreachable heap regions
1588 false, // hide all reachability
1589 true, // hide subset reachability states
1590 true, // hide predicates
1591 false );// hide edge taints
1596 protected ReachGraph getPartial( Descriptor d ) {
1597 return mapDescriptorToCompleteReachGraph.get( d );
1600 protected void setPartial( Descriptor d, ReachGraph rg ) {
1601 mapDescriptorToCompleteReachGraph.put( d, rg );
1603 // when the flag for writing out every partial
1604 // result is set, we should spit out the graph,
1605 // but in order to give it a unique name we need
1606 // to track how many partial results for this
1607 // descriptor we've already written out
1608 if( writeAllIncrementalDOTs ) {
1609 if( !mapDescriptorToNumUpdates.containsKey( d ) ) {
1610 mapDescriptorToNumUpdates.put( d, new Integer( 0 ) );
1612 Integer n = mapDescriptorToNumUpdates.get( d );
1614 rg.writeGraph( d+"COMPLETE"+String.format( "%05d", n ),
1615 true, // write labels (variables)
1616 true, // selectively hide intermediate temp vars
1617 true, // prune unreachable heap regions
1618 false, // hide all reachability
1619 true, // hide subset reachability states
1620 false, // hide predicates
1621 false); // hide edge taints
1623 mapDescriptorToNumUpdates.put( d, n + 1 );
1629 // return just the allocation site associated with one FlatNew node
1630 protected AllocSite getAllocSiteFromFlatNewPRIVATE( FlatNew fnew ) {
1632 if( !mapFlatNewToAllocSite.containsKey( fnew ) ) {
1633 AllocSite as = AllocSite.factory( allocationDepth,
1635 fnew.getDisjointId(),
1639 // the newest nodes are single objects
1640 for( int i = 0; i < allocationDepth; ++i ) {
1641 Integer id = generateUniqueHeapRegionNodeID();
1642 as.setIthOldest( i, id );
1643 mapHrnIdToAllocSite.put( id, as );
1646 // the oldest node is a summary node
1647 as.setSummary( generateUniqueHeapRegionNodeID() );
1649 mapFlatNewToAllocSite.put( fnew, as );
1652 return mapFlatNewToAllocSite.get( fnew );
1656 public static boolean shouldAnalysisTrack( TypeDescriptor type ) {
1657 // don't track primitive types, but an array
1658 // of primitives is heap memory
1659 if( type.isImmutable() ) {
1660 return type.isArray();
1663 // everything else is an object
1667 protected int numMethodsAnalyzed() {
1668 return descriptorsToAnalyze.size();
1675 // Take in source entry which is the program's compiled entry and
1676 // create a new analysis entry, a method that takes no parameters
1677 // and appears to allocate the command line arguments and call the
1678 // source entry with them. The purpose of this analysis entry is
1679 // to provide a top-level method context with no parameters left.
1680 protected void makeAnalysisEntryMethod( MethodDescriptor mdSourceEntry ) {
1682 Modifiers mods = new Modifiers();
1683 mods.addModifier( Modifiers.PUBLIC );
1684 mods.addModifier( Modifiers.STATIC );
1686 TypeDescriptor returnType =
1687 new TypeDescriptor( TypeDescriptor.VOID );
1689 this.mdAnalysisEntry =
1690 new MethodDescriptor( mods,
1692 "analysisEntryMethod"
1695 TempDescriptor cmdLineArgs =
1696 new TempDescriptor( "args",
1697 mdSourceEntry.getParamType( 0 )
1701 new FlatNew( mdSourceEntry.getParamType( 0 ),
1706 TempDescriptor[] sourceEntryArgs = new TempDescriptor[1];
1707 sourceEntryArgs[0] = cmdLineArgs;
1710 new FlatCall( mdSourceEntry,
1716 FlatReturnNode frn = new FlatReturnNode( null );
1718 FlatExit fe = new FlatExit();
1720 this.fmAnalysisEntry =
1721 new FlatMethod( mdAnalysisEntry,
1725 this.fmAnalysisEntry.addNext( fn );
1732 protected LinkedList<Descriptor> topologicalSort( Set<Descriptor> toSort ) {
1734 Set<Descriptor> discovered;
1736 if( determinismDesired ) {
1737 // use an ordered set
1738 discovered = new TreeSet<Descriptor>( dComp );
1740 // otherwise use a speedy hashset
1741 discovered = new HashSet<Descriptor>();
1744 LinkedList<Descriptor> sorted = new LinkedList<Descriptor>();
1746 Iterator<Descriptor> itr = toSort.iterator();
1747 while( itr.hasNext() ) {
1748 Descriptor d = itr.next();
1750 if( !discovered.contains( d ) ) {
1751 dfsVisit( d, toSort, sorted, discovered );
1758 // While we're doing DFS on call graph, remember
1759 // dependencies for efficient queuing of methods
1760 // during interprocedural analysis:
1762 // a dependent of a method decriptor d for this analysis is:
1763 // 1) a method or task that invokes d
1764 // 2) in the descriptorsToAnalyze set
1765 protected void dfsVisit( Descriptor d,
1766 Set <Descriptor> toSort,
1767 LinkedList<Descriptor> sorted,
1768 Set <Descriptor> discovered ) {
1769 discovered.add( d );
1771 // only methods have callers, tasks never do
1772 if( d instanceof MethodDescriptor ) {
1774 MethodDescriptor md = (MethodDescriptor) d;
1776 // the call graph is not aware that we have a fabricated
1777 // analysis entry that calls the program source's entry
1778 if( md == mdSourceEntry ) {
1779 if( !discovered.contains( mdAnalysisEntry ) ) {
1780 addDependent( mdSourceEntry, // callee
1781 mdAnalysisEntry // caller
1783 dfsVisit( mdAnalysisEntry, toSort, sorted, discovered );
1787 // otherwise call graph guides DFS
1788 Iterator itr = callGraph.getCallerSet( md ).iterator();
1789 while( itr.hasNext() ) {
1790 Descriptor dCaller = (Descriptor) itr.next();
1792 // only consider callers in the original set to analyze
1793 if( !toSort.contains( dCaller ) ) {
1797 if( !discovered.contains( dCaller ) ) {
1798 addDependent( md, // callee
1802 dfsVisit( dCaller, toSort, sorted, discovered );
1807 // for leaf-nodes last now!
1808 sorted.addLast( d );
1812 protected void enqueue( Descriptor d ) {
1814 if( !descriptorsToVisitSet.contains( d ) ) {
1816 if( state.DISJOINTDVISITSTACK ||
1817 state.DISJOINTDVISITSTACKEESONTOP
1819 descriptorsToVisitStack.add( d );
1821 } else if( state.DISJOINTDVISITPQUE ) {
1822 Integer priority = mapDescriptorToPriority.get( d );
1823 descriptorsToVisitQ.add( new DescriptorQWrapper( priority,
1828 descriptorsToVisitSet.add( d );
1833 // a dependent of a method decriptor d for this analysis is:
1834 // 1) a method or task that invokes d
1835 // 2) in the descriptorsToAnalyze set
1836 protected void addDependent( Descriptor callee, Descriptor caller ) {
1837 Set<Descriptor> deps = mapDescriptorToSetDependents.get( callee );
1838 if( deps == null ) {
1839 deps = new HashSet<Descriptor>();
1842 mapDescriptorToSetDependents.put( callee, deps );
1845 protected Set<Descriptor> getDependents( Descriptor callee ) {
1846 Set<Descriptor> deps = mapDescriptorToSetDependents.get( callee );
1847 if( deps == null ) {
1848 deps = new HashSet<Descriptor>();
1849 mapDescriptorToSetDependents.put( callee, deps );
1855 public Hashtable<FlatCall, ReachGraph> getIHMcontributions( Descriptor d ) {
1857 Hashtable<FlatCall, ReachGraph> heapsFromCallers =
1858 mapDescriptorToIHMcontributions.get( d );
1860 if( heapsFromCallers == null ) {
1861 heapsFromCallers = new Hashtable<FlatCall, ReachGraph>();
1862 mapDescriptorToIHMcontributions.put( d, heapsFromCallers );
1865 return heapsFromCallers;
1868 public ReachGraph getIHMcontribution( Descriptor d,
1871 Hashtable<FlatCall, ReachGraph> heapsFromCallers =
1872 getIHMcontributions( d );
1874 if( !heapsFromCallers.containsKey( fc ) ) {
1878 return heapsFromCallers.get( fc );
1882 public void addIHMcontribution( Descriptor d,
1886 Hashtable<FlatCall, ReachGraph> heapsFromCallers =
1887 getIHMcontributions( d );
1889 heapsFromCallers.put( fc, rg );
1893 private AllocSite createParameterAllocSite( ReachGraph rg,
1894 TempDescriptor tempDesc,
1900 flatNew = new FlatNew( tempDesc.getType(), // type
1901 tempDesc, // param temp
1902 false, // global alloc?
1903 "param"+tempDesc // disjoint site ID string
1906 flatNew = new FlatNew( tempDesc.getType(), // type
1907 tempDesc, // param temp
1908 false, // global alloc?
1909 null // disjoint site ID string
1913 // create allocation site
1914 AllocSite as = AllocSite.factory( allocationDepth,
1916 flatNew.getDisjointId(),
1919 for (int i = 0; i < allocationDepth; ++i) {
1920 Integer id = generateUniqueHeapRegionNodeID();
1921 as.setIthOldest(i, id);
1922 mapHrnIdToAllocSite.put(id, as);
1924 // the oldest node is a summary node
1925 as.setSummary( generateUniqueHeapRegionNodeID() );
1933 private Set<FieldDescriptor> getFieldSetTobeAnalyzed(TypeDescriptor typeDesc){
1935 Set<FieldDescriptor> fieldSet=new HashSet<FieldDescriptor>();
1936 if(!typeDesc.isImmutable()){
1937 ClassDescriptor classDesc = typeDesc.getClassDesc();
1938 for (Iterator it = classDesc.getFields(); it.hasNext();) {
1939 FieldDescriptor field = (FieldDescriptor) it.next();
1940 TypeDescriptor fieldType = field.getType();
1941 if (shouldAnalysisTrack( fieldType )) {
1942 fieldSet.add(field);
1950 private HeapRegionNode createMultiDeimensionalArrayHRN(ReachGraph rg, AllocSite alloc, HeapRegionNode srcHRN, FieldDescriptor fd, Hashtable<HeapRegionNode, HeapRegionNode> map, Hashtable<TypeDescriptor, HeapRegionNode> mapToExistingNode, ReachSet alpha ){
1952 int dimCount=fd.getType().getArrayCount();
1953 HeapRegionNode prevNode=null;
1954 HeapRegionNode arrayEntryNode=null;
1955 for(int i=dimCount;i>0;i--){
1956 TypeDescriptor typeDesc=fd.getType().dereference();//hack to get instance of type desc
1957 typeDesc.setArrayCount(i);
1958 TempDescriptor tempDesc=new TempDescriptor(typeDesc.getSymbol(),typeDesc);
1959 HeapRegionNode hrnSummary ;
1960 if(!mapToExistingNode.containsKey(typeDesc)){
1965 as = createParameterAllocSite(rg, tempDesc, false);
1967 // make a new reference to allocated node
1969 rg.createNewHeapRegionNode(as.getSummary(), // id or null to generate a new one
1970 false, // single object?
1972 false, // out-of-context?
1973 as.getType(), // type
1974 as, // allocation site
1975 alpha, // inherent reach
1976 alpha, // current reach
1977 ExistPredSet.factory(rg.predTrue), // predicates
1978 tempDesc.toString() // description
1980 rg.id2hrn.put(as.getSummary(),hrnSummary);
1982 mapToExistingNode.put(typeDesc, hrnSummary);
1984 hrnSummary=mapToExistingNode.get(typeDesc);
1988 // make a new reference between new summary node and source
1989 RefEdge edgeToSummary = new RefEdge(srcHRN, // source
1992 fd.getSymbol(), // field name
1994 ExistPredSet.factory(rg.predTrue), // predicates
1998 rg.addRefEdge(srcHRN, hrnSummary, edgeToSummary);
1999 prevNode=hrnSummary;
2000 arrayEntryNode=hrnSummary;
2002 // make a new reference between summary nodes of array
2003 RefEdge edgeToSummary = new RefEdge(prevNode, // source
2006 arrayElementFieldName, // field name
2008 ExistPredSet.factory(rg.predTrue), // predicates
2012 rg.addRefEdge(prevNode, hrnSummary, edgeToSummary);
2013 prevNode=hrnSummary;
2018 // create a new obj node if obj has at least one non-primitive field
2019 TypeDescriptor type=fd.getType();
2020 if(getFieldSetTobeAnalyzed(type).size()>0){
2021 TypeDescriptor typeDesc=type.dereference();
2022 typeDesc.setArrayCount(0);
2023 if(!mapToExistingNode.containsKey(typeDesc)){
2024 TempDescriptor tempDesc=new TempDescriptor(type.getSymbol(),typeDesc);
2025 AllocSite as = createParameterAllocSite(rg, tempDesc, false);
2026 // make a new reference to allocated node
2027 HeapRegionNode hrnSummary =
2028 rg.createNewHeapRegionNode(as.getSummary(), // id or null to generate a new one
2029 false, // single object?
2031 false, // out-of-context?
2033 as, // allocation site
2034 alpha, // inherent reach
2035 alpha, // current reach
2036 ExistPredSet.factory(rg.predTrue), // predicates
2037 tempDesc.toString() // description
2039 rg.id2hrn.put(as.getSummary(),hrnSummary);
2040 mapToExistingNode.put(typeDesc, hrnSummary);
2041 RefEdge edgeToSummary = new RefEdge(prevNode, // source
2044 arrayElementFieldName, // field name
2046 ExistPredSet.factory(rg.predTrue), // predicates
2049 rg.addRefEdge(prevNode, hrnSummary, edgeToSummary);
2050 prevNode=hrnSummary;
2052 HeapRegionNode hrnSummary=mapToExistingNode.get(typeDesc);
2053 if(prevNode.getReferenceTo(hrnSummary, typeDesc, arrayElementFieldName)==null){
2054 RefEdge edgeToSummary = new RefEdge(prevNode, // source
2057 arrayElementFieldName, // field name
2059 ExistPredSet.factory(rg.predTrue), // predicates
2062 rg.addRefEdge(prevNode, hrnSummary, edgeToSummary);
2064 prevNode=hrnSummary;
2068 map.put(arrayEntryNode, prevNode);
2069 return arrayEntryNode;
2072 private ReachGraph createInitialTaskReachGraph(FlatMethod fm) {
2073 ReachGraph rg = new ReachGraph();
2074 TaskDescriptor taskDesc = fm.getTask();
2076 for (int idx = 0; idx < taskDesc.numParameters(); idx++) {
2077 Descriptor paramDesc = taskDesc.getParameter(idx);
2078 TypeDescriptor paramTypeDesc = taskDesc.getParamType(idx);
2080 // setup data structure
2081 Set<HashMap<HeapRegionNode, FieldDescriptor>> workSet =
2082 new HashSet<HashMap<HeapRegionNode, FieldDescriptor>>();
2083 Hashtable<TypeDescriptor, HeapRegionNode> mapTypeToExistingSummaryNode =
2084 new Hashtable<TypeDescriptor, HeapRegionNode>();
2085 Hashtable<HeapRegionNode, HeapRegionNode> mapToFirstDimensionArrayNode =
2086 new Hashtable<HeapRegionNode, HeapRegionNode>();
2087 Set<String> doneSet = new HashSet<String>();
2089 TempDescriptor tempDesc = fm.getParameter(idx);
2091 AllocSite as = createParameterAllocSite(rg, tempDesc, true);
2092 VariableNode lnX = rg.getVariableNodeFromTemp(tempDesc);
2093 Integer idNewest = as.getIthOldest(0);
2094 HeapRegionNode hrnNewest = rg.id2hrn.get(idNewest);
2096 // make a new reference to allocated node
2097 RefEdge edgeNew = new RefEdge(lnX, // source
2099 taskDesc.getParamType(idx), // type
2101 hrnNewest.getAlpha(), // beta
2102 ExistPredSet.factory(rg.predTrue), // predicates
2105 rg.addRefEdge(lnX, hrnNewest, edgeNew);
2107 // set-up a work set for class field
2108 ClassDescriptor classDesc = paramTypeDesc.getClassDesc();
2109 for (Iterator it = classDesc.getFields(); it.hasNext();) {
2110 FieldDescriptor fd = (FieldDescriptor) it.next();
2111 TypeDescriptor fieldType = fd.getType();
2112 if (shouldAnalysisTrack( fieldType )) {
2113 HashMap<HeapRegionNode, FieldDescriptor> newMap = new HashMap<HeapRegionNode, FieldDescriptor>();
2114 newMap.put(hrnNewest, fd);
2115 workSet.add(newMap);
2119 int uniqueIdentifier = 0;
2120 while (!workSet.isEmpty()) {
2121 HashMap<HeapRegionNode, FieldDescriptor> map = workSet
2123 workSet.remove(map);
2125 Set<HeapRegionNode> key = map.keySet();
2126 HeapRegionNode srcHRN = key.iterator().next();
2127 FieldDescriptor fd = map.get(srcHRN);
2128 TypeDescriptor type = fd.getType();
2129 String doneSetIdentifier = srcHRN.getIDString() + "_" + fd;
2131 if (!doneSet.contains(doneSetIdentifier)) {
2132 doneSet.add(doneSetIdentifier);
2133 if (!mapTypeToExistingSummaryNode.containsKey(type)) {
2134 // create new summary Node
2135 TempDescriptor td = new TempDescriptor("temp"
2136 + uniqueIdentifier, type);
2138 AllocSite allocSite;
2139 if(type.equals(paramTypeDesc)){
2140 //corresponding allocsite has already been created for a parameter variable.
2143 allocSite = createParameterAllocSite(rg, td, false);
2145 String strDesc = allocSite.toStringForDOT()
2147 TypeDescriptor allocType=allocSite.getType();
2149 HeapRegionNode hrnSummary;
2150 if(allocType.isArray() && allocType.getArrayCount()>0){
2151 hrnSummary=createMultiDeimensionalArrayHRN(rg,allocSite,srcHRN,fd,mapToFirstDimensionArrayNode,mapTypeToExistingSummaryNode,hrnNewest.getAlpha());
2154 rg.createNewHeapRegionNode(allocSite.getSummary(), // id or null to generate a new one
2155 false, // single object?
2157 false, // out-of-context?
2158 allocSite.getType(), // type
2159 allocSite, // allocation site
2160 hrnNewest.getAlpha(), // inherent reach
2161 hrnNewest.getAlpha(), // current reach
2162 ExistPredSet.factory(rg.predTrue), // predicates
2163 strDesc // description
2165 rg.id2hrn.put(allocSite.getSummary(),hrnSummary);
2167 // make a new reference to summary node
2168 RefEdge edgeToSummary = new RefEdge(srcHRN, // source
2171 fd.getSymbol(), // field name
2172 hrnNewest.getAlpha(), // beta
2173 ExistPredSet.factory(rg.predTrue), // predicates
2177 rg.addRefEdge(srcHRN, hrnSummary, edgeToSummary);
2181 mapTypeToExistingSummaryNode.put(type, hrnSummary);
2183 // set-up a work set for fields of the class
2184 Set<FieldDescriptor> fieldTobeAnalyzed=getFieldSetTobeAnalyzed(type);
2185 for (Iterator iterator = fieldTobeAnalyzed.iterator(); iterator
2187 FieldDescriptor fieldDescriptor = (FieldDescriptor) iterator
2189 HeapRegionNode newDstHRN;
2190 if(mapToFirstDimensionArrayNode.containsKey(hrnSummary)){
2191 //related heap region node is already exsited.
2192 newDstHRN=mapToFirstDimensionArrayNode.get(hrnSummary);
2194 newDstHRN=hrnSummary;
2196 doneSetIdentifier = newDstHRN.getIDString() + "_" + fieldDescriptor;
2197 if(!doneSet.contains(doneSetIdentifier)){
2198 // add new work item
2199 HashMap<HeapRegionNode, FieldDescriptor> newMap =
2200 new HashMap<HeapRegionNode, FieldDescriptor>();
2201 newMap.put(newDstHRN, fieldDescriptor);
2202 workSet.add(newMap);
2207 // if there exists corresponding summary node
2208 HeapRegionNode hrnDst=mapTypeToExistingSummaryNode.get(type);
2210 RefEdge edgeToSummary = new RefEdge(srcHRN, // source
2212 fd.getType(), // type
2213 fd.getSymbol(), // field name
2214 srcHRN.getAlpha(), // beta
2215 ExistPredSet.factory(rg.predTrue), // predicates
2218 rg.addRefEdge(srcHRN, hrnDst, edgeToSummary);
2224 // debugSnapshot(rg, fm, true);
2228 // return all allocation sites in the method (there is one allocation
2229 // site per FlatNew node in a method)
2230 private HashSet<AllocSite> getAllocationSiteSet(Descriptor d) {
2231 if( !mapDescriptorToAllocSiteSet.containsKey(d) ) {
2232 buildAllocationSiteSet(d);
2235 return mapDescriptorToAllocSiteSet.get(d);
2239 private void buildAllocationSiteSet(Descriptor d) {
2240 HashSet<AllocSite> s = new HashSet<AllocSite>();
2243 if( d instanceof MethodDescriptor ) {
2244 fm = state.getMethodFlat( (MethodDescriptor) d);
2246 assert d instanceof TaskDescriptor;
2247 fm = state.getMethodFlat( (TaskDescriptor) d);
2249 pm.analyzeMethod(fm);
2251 // visit every node in this FlatMethod's IR graph
2252 // and make a set of the allocation sites from the
2253 // FlatNew node's visited
2254 HashSet<FlatNode> visited = new HashSet<FlatNode>();
2255 HashSet<FlatNode> toVisit = new HashSet<FlatNode>();
2258 while( !toVisit.isEmpty() ) {
2259 FlatNode n = toVisit.iterator().next();
2261 if( n instanceof FlatNew ) {
2262 s.add(getAllocSiteFromFlatNewPRIVATE( (FlatNew) n) );
2268 for( int i = 0; i < pm.numNext(n); ++i ) {
2269 FlatNode child = pm.getNext(n, i);
2270 if( !visited.contains(child) ) {
2276 mapDescriptorToAllocSiteSet.put(d, s);
2279 private HashSet<AllocSite> getFlaggedAllocationSites(Descriptor dIn) {
2281 HashSet<AllocSite> out = new HashSet<AllocSite>();
2282 HashSet<Descriptor> toVisit = new HashSet<Descriptor>();
2283 HashSet<Descriptor> visited = new HashSet<Descriptor>();
2287 while (!toVisit.isEmpty()) {
2288 Descriptor d = toVisit.iterator().next();
2292 HashSet<AllocSite> asSet = getAllocationSiteSet(d);
2293 Iterator asItr = asSet.iterator();
2294 while (asItr.hasNext()) {
2295 AllocSite as = (AllocSite) asItr.next();
2296 if (as.getDisjointAnalysisId() != null) {
2301 // enqueue callees of this method to be searched for
2302 // allocation sites also
2303 Set callees = callGraph.getCalleeSet(d);
2304 if (callees != null) {
2305 Iterator methItr = callees.iterator();
2306 while (methItr.hasNext()) {
2307 MethodDescriptor md = (MethodDescriptor) methItr.next();
2309 if (!visited.contains(md)) {
2320 private HashSet<AllocSite>
2321 getFlaggedAllocationSitesReachableFromTaskPRIVATE(TaskDescriptor td) {
2323 HashSet<AllocSite> asSetTotal = new HashSet<AllocSite>();
2324 HashSet<Descriptor> toVisit = new HashSet<Descriptor>();
2325 HashSet<Descriptor> visited = new HashSet<Descriptor>();
2329 // traverse this task and all methods reachable from this task
2330 while( !toVisit.isEmpty() ) {
2331 Descriptor d = toVisit.iterator().next();
2335 HashSet<AllocSite> asSet = getAllocationSiteSet(d);
2336 Iterator asItr = asSet.iterator();
2337 while( asItr.hasNext() ) {
2338 AllocSite as = (AllocSite) asItr.next();
2339 TypeDescriptor typed = as.getType();
2340 if( typed != null ) {
2341 ClassDescriptor cd = typed.getClassDesc();
2342 if( cd != null && cd.hasFlags() ) {
2348 // enqueue callees of this method to be searched for
2349 // allocation sites also
2350 Set callees = callGraph.getCalleeSet(d);
2351 if( callees != null ) {
2352 Iterator methItr = callees.iterator();
2353 while( methItr.hasNext() ) {
2354 MethodDescriptor md = (MethodDescriptor) methItr.next();
2356 if( !visited.contains(md) ) {
2366 public Set<Descriptor> getDescriptorsToAnalyze() {
2367 return descriptorsToAnalyze;
2370 public EffectsAnalysis getEffectsAnalysis(){
2371 return effectsAnalysis;
2375 // get successive captures of the analysis state, use compiler
2377 boolean takeDebugSnapshots = false;
2378 String descSymbolDebug = null;
2379 boolean stopAfterCapture = false;
2380 int snapVisitCounter = 0;
2381 int snapNodeCounter = 0;
2382 int visitStartCapture = 0;
2383 int numVisitsToCapture = 0;
2386 void debugSnapshot( ReachGraph rg, FlatNode fn, boolean in ) {
2387 if( snapVisitCounter > visitStartCapture + numVisitsToCapture ) {
2395 if( snapVisitCounter >= visitStartCapture ) {
2396 System.out.println( " @@@ snapping visit="+snapVisitCounter+
2397 ", node="+snapNodeCounter+
2401 graphName = String.format( "snap%03d_%04din",
2405 graphName = String.format( "snap%03d_%04dout",
2410 graphName = graphName + fn;
2412 rg.writeGraph( graphName,
2413 true, // write labels (variables)
2414 true, // selectively hide intermediate temp vars
2415 true, // prune unreachable heap regions
2416 false, // hide reachability
2417 true, // hide subset reachability states
2418 true, // hide predicates
2419 false );// hide edge taints