1 package Analysis.OwnershipAnalysis;
3 import Analysis.CallGraph.*;
6 import IR.Tree.Modifiers;
11 public class OwnershipAnalysis {
14 ///////////////////////////////////////////
16 // Public interface to discover possible
17 // aliases in the program under analysis
19 ///////////////////////////////////////////
21 public HashSet<AllocationSite>
22 getFlaggedAllocationSitesReachableFromTask(TaskDescriptor td) {
23 return getFlaggedAllocationSitesReachableFromTaskPRIVATE(td);
26 public AllocationSite getAllocationSiteFromFlatNew(FlatNew fn) {
27 return getAllocationSiteFromFlatNewPRIVATE(fn);
31 public boolean createsPotentialAliases(Descriptor taskOrMethod,
35 OwnershipGraph og = getGraphOfAllContextsFromDescriptor(taskOrMethod);
37 return og.hasPotentialAlias(paramIndex1, paramIndex2);
40 public boolean createsPotentialAliases(Descriptor taskOrMethod,
42 AllocationSite alloc) {
44 OwnershipGraph og = getGraphOfAllContextsFromDescriptor(taskOrMethod);
46 return og.hasPotentialAlias(paramIndex, alloc);
49 public boolean createsPotentialAliases(Descriptor taskOrMethod,
53 OwnershipGraph og = getGraphOfAllContextsFromDescriptor(taskOrMethod);
55 return og.hasPotentialAlias(paramIndex, alloc);
58 public boolean createsPotentialAliases(Descriptor taskOrMethod,
59 AllocationSite alloc1,
60 AllocationSite alloc2) {
62 OwnershipGraph og = getGraphOfAllContextsFromDescriptor(taskOrMethod);
64 return og.hasPotentialAlias(alloc1, alloc2);
68 protected OwnershipGraph getGraphOfAllContextsFromDescriptor(Descriptor d) {
71 OwnershipGraph og = new OwnershipGraph( allocationDepth, typeUtil );
73 assert mapDescriptorToAllMethodContexts.containsKey( d );
74 HashSet<MethodContext> contexts = mapDescriptorToAllMethodContexts.get( d );
75 Iterator<MethodContext> mcItr = contexts.iterator();
76 while( mcItr.hasNext() ) {
77 MethodContext mc = mcItr.next();
79 OwnershipGraph ogContext = mapMethodContextToCompleteOwnershipGraph.get(mc);
80 assert ogContext != null;
82 og.merge( ogContext );
89 // use the methods given above to check every possible alias
90 // between task parameters and flagged allocation sites reachable
92 public void writeAllAliases(String outputFile) throws java.io.IOException {
94 BufferedWriter bw = new BufferedWriter(new FileWriter(outputFile) );
96 bw.write("Conducting ownership analysis with allocation depth = "+allocationDepth);
98 // look through every task for potential aliases
99 Iterator taskItr = state.getTaskSymbolTable().getDescriptorsIterator();
100 while( taskItr.hasNext() ) {
101 TaskDescriptor td = (TaskDescriptor) taskItr.next();
103 bw.write("\n---------"+td+"--------\n");
105 HashSet<AllocationSite> allocSites = getFlaggedAllocationSitesReachableFromTask(td);
107 // for each task parameter, check for aliases with
108 // other task parameters and every allocation site
109 // reachable from this task
110 boolean foundSomeAlias = false;
112 FlatMethod fm = state.getMethodFlat(td);
113 for( int i = 0; i < fm.numParameters(); ++i ) {
115 // for the ith parameter check for aliases to all
116 // higher numbered parameters
117 for( int j = i + 1; j < fm.numParameters(); ++j ) {
118 if( createsPotentialAliases(td, i, j) ) {
119 foundSomeAlias = true;
120 bw.write("Potential alias between parameters "+i+" and "+j+".\n");
124 // for the ith parameter, check for aliases against
125 // the set of allocation sites reachable from this
127 Iterator allocItr = allocSites.iterator();
128 while( allocItr.hasNext() ) {
129 AllocationSite as = (AllocationSite) allocItr.next();
130 if( createsPotentialAliases(td, i, as) ) {
131 foundSomeAlias = true;
132 bw.write("Potential alias between parameter "+i+" and "+as.getFlatNew()+".\n");
137 // for each allocation site check for aliases with
138 // other allocation sites in the context of execution
140 HashSet<AllocationSite> outerChecked = new HashSet<AllocationSite>();
141 Iterator allocItr1 = allocSites.iterator();
142 while( allocItr1.hasNext() ) {
143 AllocationSite as1 = (AllocationSite) allocItr1.next();
145 Iterator allocItr2 = allocSites.iterator();
146 while( allocItr2.hasNext() ) {
147 AllocationSite as2 = (AllocationSite) allocItr2.next();
149 if( !outerChecked.contains(as2) &&
150 createsPotentialAliases(td, as1, as2) ) {
151 foundSomeAlias = true;
152 bw.write("Potential alias between "+as1.getFlatNew()+" and "+as2.getFlatNew()+".\n");
156 outerChecked.add(as1);
159 if( !foundSomeAlias ) {
160 bw.write("No aliases between flagged objects in Task "+td+".\n");
167 ///////////////////////////////////////////
169 // end public interface
171 ///////////////////////////////////////////
180 // data from the compiler
182 private TypeUtil typeUtil;
183 private CallGraph callGraph;
184 private int allocationDepth;
186 // used to identify HeapRegionNode objects
187 // A unique ID equates an object in one
188 // ownership graph with an object in another
189 // graph that logically represents the same
191 // start at 10 and incerement to leave some
192 // reserved IDs for special purposes
193 static private int uniqueIDcount = 10;
196 // Use these data structures to track progress of
197 // processing all methods in the program, and by methods
198 // TaskDescriptor and MethodDescriptor are combined
199 // together, with a common parent class Descriptor
200 private Hashtable<MethodContext, OwnershipGraph> mapMethodContextToInitialParamAllocGraph;
201 private Hashtable<MethodContext, OwnershipGraph> mapMethodContextToCompleteOwnershipGraph;
202 private Hashtable<FlatNew, AllocationSite> mapFlatNewToAllocationSite;
203 private Hashtable<Descriptor, HashSet<AllocationSite> > mapDescriptorToAllocationSiteSet;
204 private Hashtable<MethodContext, Integer> mapMethodContextToNumUpdates;
205 private Hashtable<Descriptor, HashSet<MethodContext> > mapDescriptorToAllMethodContexts;
207 // Use these data structures to track progress of one pass of
208 // processing the FlatNodes of a particular method
209 private HashSet <FlatNode> flatNodesToVisit;
210 private Hashtable<FlatNode, OwnershipGraph> mapFlatNodeToOwnershipGraph;
211 private HashSet <FlatReturnNode> returnNodesToCombineForCompleteOwnershipGraph;
213 // descriptorsToAnalyze identifies the set of tasks and methods
214 // that are reachable from the program tasks, this set is initialized
215 // and then remains static
216 private HashSet<Descriptor> descriptorsToAnalyze;
218 // descriptorsToVisit is initialized to descriptorsToAnalyze and is
219 // reduced by visiting a descriptor during analysis. When dependents
220 // must be scheduled, only those contained in descriptorsToAnalyze
221 // should be re-added to this set
222 private HashSet<MethodContext> methodContextsToVisit;
224 // a special field descriptor for all array elements
225 private static FieldDescriptor fdElement = new FieldDescriptor(new Modifiers(Modifiers.PUBLIC),
226 new TypeDescriptor("Array[]"),
231 // a special temp descriptor for setting more than one parameter label
232 // to the all-aliased-parameters heap region node
233 protected static TempDescriptor tdAliasedParams = new TempDescriptor("_AllAliasedParams___");
236 // for controlling DOT file output
237 private boolean writeDOTs;
238 private boolean writeAllDOTs;
242 // this analysis generates an ownership graph for every task
244 public OwnershipAnalysis(State state,
249 boolean writeAllDOTs,
250 String aliasFile) throws java.io.IOException {
252 double timeStartAnalysis = (double) System.nanoTime();
256 this.callGraph = callGraph;
257 this.allocationDepth = allocationDepth;
258 this.writeDOTs = writeDOTs;
259 this.writeAllDOTs = writeAllDOTs;
261 descriptorsToAnalyze = new HashSet<Descriptor>();
263 mapMethodContextToInitialParamAllocGraph =
264 new Hashtable<MethodContext, OwnershipGraph>();
266 mapMethodContextToCompleteOwnershipGraph =
267 new Hashtable<MethodContext, OwnershipGraph>();
269 mapFlatNewToAllocationSite =
270 new Hashtable<FlatNew, AllocationSite>();
272 mapDescriptorToAllocationSiteSet =
273 new Hashtable<Descriptor, HashSet<AllocationSite> >();
275 mapDescriptorToAllMethodContexts =
276 new Hashtable<Descriptor, HashSet<MethodContext> >();
280 mapMethodContextToNumUpdates = new Hashtable<MethodContext, Integer>();
283 // initialize methods to visit as the set of all tasks in the
284 // program and then any method that could be called starting
286 Iterator taskItr = state.getTaskSymbolTable().getDescriptorsIterator();
287 while( taskItr.hasNext() ) {
288 Descriptor d = (Descriptor) taskItr.next();
289 scheduleAllCallees(d);
292 // before beginning analysis, initialize every scheduled method
293 // with an ownership graph that has populated parameter index tables
294 // by analyzing the first node which is always a FlatMethod node
295 Iterator<Descriptor> dItr = descriptorsToAnalyze.iterator();
296 while( dItr.hasNext() ) {
297 Descriptor d = dItr.next();
298 OwnershipGraph og = new OwnershipGraph(allocationDepth, typeUtil);
301 if( d instanceof MethodDescriptor ) {
302 fm = state.getMethodFlat( (MethodDescriptor) d);
304 assert d instanceof TaskDescriptor;
305 fm = state.getMethodFlat( (TaskDescriptor) d);
308 MethodContext mc = new MethodContext( d );
309 assert !mapDescriptorToAllMethodContexts.containsKey( d );
310 HashSet<MethodContext> s = new HashSet<MethodContext>();
312 mapDescriptorToAllMethodContexts.put( d, s );
314 //System.out.println("Previsiting " + mc);
316 og = analyzeFlatNode(mc, fm, null, og);
317 setGraphForMethodContext(mc, og);
320 //System.out.println("");
322 // as mentioned above, analyze methods one-by-one, possibly revisiting
323 // a method if the methods that it calls are updated
326 //System.out.println("");
328 double timeEndAnalysis = (double) System.nanoTime();
329 double dt = (timeEndAnalysis - timeStartAnalysis)/(Math.pow( 10.0, 9.0 ) );
330 String treport = String.format( "The analysis took %.3f sec.", dt );
331 System.out.println( treport );
333 if( aliasFile != null ) {
334 writeAllAliases(aliasFile);
338 // called from the constructor to help initialize the set
339 // of methods that needs to be analyzed by ownership analysis
340 private void scheduleAllCallees(Descriptor d) {
341 if( descriptorsToAnalyze.contains(d) ) {
344 descriptorsToAnalyze.add(d);
346 // start with all method calls to further schedule
347 Set moreMethodsToCheck = moreMethodsToCheck = callGraph.getMethodCalls(d);
349 if( d instanceof MethodDescriptor ) {
350 // see if this method has virtual dispatch
351 Set virtualMethods = callGraph.getMethods( (MethodDescriptor)d);
352 moreMethodsToCheck.addAll(virtualMethods);
355 // keep following any further methods identified in
357 Iterator methItr = moreMethodsToCheck.iterator();
358 while( methItr.hasNext() ) {
359 Descriptor m = (Descriptor) methItr.next();
360 scheduleAllCallees(m);
365 // manage the set of tasks and methods to be analyzed
366 // and be sure to reschedule tasks/methods when the methods
367 // they call are updated
368 private void analyzeMethods() throws java.io.IOException {
370 methodContextsToVisit = new HashSet<MethodContext>();
371 Iterator<Descriptor> itrd2a = descriptorsToAnalyze.iterator();
372 while( itrd2a.hasNext() ) {
373 HashSet<MethodContext> mcs = mapDescriptorToAllMethodContexts.get( itrd2a.next() );
376 Iterator<MethodContext> itrmc = mcs.iterator();
377 while( itrmc.hasNext() ) {
378 methodContextsToVisit.add( itrmc.next() );
382 while( !methodContextsToVisit.isEmpty() ) {
383 MethodContext mc = methodContextsToVisit.iterator().next();
384 methodContextsToVisit.remove(mc);
387 // because the task or method descriptor just extracted
388 // was in the "to visit" set it either hasn't been analyzed
389 // yet, or some method that it depends on has been
390 // updated. Recompute a complete ownership graph for
391 // this task/method and compare it to any previous result.
392 // If there is a change detected, add any methods/tasks
393 // that depend on this one to the "to visit" set.
395 //System.out.println("Analyzing " + mc);
397 Descriptor d = mc.getDescriptor();
399 if( d instanceof MethodDescriptor ) {
400 fm = state.getMethodFlat( (MethodDescriptor) d);
402 assert d instanceof TaskDescriptor;
403 fm = state.getMethodFlat( (TaskDescriptor) d);
406 OwnershipGraph og = analyzeFlatMethod(mc, fm);
407 OwnershipGraph ogPrev = mapMethodContextToCompleteOwnershipGraph.get(mc);
408 if( !og.equals(ogPrev) ) {
409 setGraphForMethodContext(mc, og);
411 // only methods have dependents, tasks cannot
412 // be invoked by any user program calls
413 if( d instanceof MethodDescriptor ) {
414 MethodDescriptor md = (MethodDescriptor) d;
415 Set dependents = callGraph.getCallerSet(md);
416 if( dependents != null ) {
417 Iterator depItr = dependents.iterator();
418 while( depItr.hasNext() ) {
419 Descriptor dependent = (Descriptor) depItr.next();
420 if( descriptorsToAnalyze.contains(dependent) ) {
422 HashSet<MethodContext> mcs = mapDescriptorToAllMethodContexts.get( dependent );
425 Iterator<MethodContext> itrmc = mcs.iterator();
426 while( itrmc.hasNext() ) {
427 methodContextsToVisit.add( itrmc.next() );
439 // keep passing the Descriptor of the method along for debugging
440 // and dot file writing
441 private OwnershipGraph
442 analyzeFlatMethod(MethodContext mc,
443 FlatMethod flatm) throws java.io.IOException {
445 // initialize flat nodes to visit as the flat method
446 // because it is the entry point
448 flatNodesToVisit = new HashSet<FlatNode>();
449 flatNodesToVisit.add(flatm);
451 // initilize the mapping of flat nodes in this flat method to
452 // ownership graph results to an empty mapping
453 mapFlatNodeToOwnershipGraph = new Hashtable<FlatNode, OwnershipGraph>();
455 // initialize the set of return nodes that will be combined as
456 // the final ownership graph result to return as an empty set
457 returnNodesToCombineForCompleteOwnershipGraph = new HashSet<FlatReturnNode>();
460 while( !flatNodesToVisit.isEmpty() ) {
461 FlatNode fn = (FlatNode) flatNodesToVisit.iterator().next();
462 flatNodesToVisit.remove(fn);
464 //System.out.println( " "+fn );
466 // perform this node's contributions to the ownership
467 // graph on a new copy, then compare it to the old graph
468 // at this node to see if anything was updated.
469 OwnershipGraph og = new OwnershipGraph(allocationDepth, typeUtil);
471 // start by merging all node's parents' graphs
472 for( int i = 0; i < fn.numPrev(); ++i ) {
473 FlatNode pn = fn.getPrev(i);
474 if( mapFlatNodeToOwnershipGraph.containsKey(pn) ) {
475 OwnershipGraph ogParent = mapFlatNodeToOwnershipGraph.get(pn);
480 // apply the analysis of the flat node to the
481 // ownership graph made from the merge of the
483 og = analyzeFlatNode(mc,
485 returnNodesToCombineForCompleteOwnershipGraph,
489 //debugSnapshot(og,fn);
493 // if the results of the new graph are different from
494 // the current graph at this node, replace the graph
495 // with the update and enqueue the children for
497 OwnershipGraph ogPrev = mapFlatNodeToOwnershipGraph.get(fn);
498 if( !og.equals(ogPrev) ) {
499 mapFlatNodeToOwnershipGraph.put(fn, og);
501 for( int i = 0; i < fn.numNext(); i++ ) {
502 FlatNode nn = fn.getNext(i);
503 flatNodesToVisit.add(nn);
508 // end by merging all return nodes into a complete
509 // ownership graph that represents all possible heap
510 // states after the flat method returns
511 OwnershipGraph completeGraph = new OwnershipGraph(allocationDepth, typeUtil);
512 Iterator retItr = returnNodesToCombineForCompleteOwnershipGraph.iterator();
513 while( retItr.hasNext() ) {
514 FlatReturnNode frn = (FlatReturnNode) retItr.next();
515 assert mapFlatNodeToOwnershipGraph.containsKey(frn);
516 OwnershipGraph ogr = mapFlatNodeToOwnershipGraph.get(frn);
517 completeGraph.merge(ogr);
520 return completeGraph;
524 private OwnershipGraph
525 analyzeFlatNode(MethodContext mc,
527 HashSet<FlatReturnNode> setRetNodes,
528 OwnershipGraph og) throws java.io.IOException {
534 // use node type to decide what alterations to make
535 // to the ownership graph
536 switch( fn.kind() ) {
538 case FKind.FlatMethod:
539 FlatMethod fm = (FlatMethod) fn;
541 // there should only be one FlatMethod node as the
542 // parent of all other FlatNode objects, so take
543 // the opportunity to construct the initial graph by
544 // adding parameters labels to new heap regions
545 // AND this should be done once globally so that the
546 // parameter IDs are consistent between analysis
547 // iterations, so if this step has been done already
548 // just merge in the cached version
549 OwnershipGraph ogInitParamAlloc = mapMethodContextToInitialParamAllocGraph.get(mc);
550 if( ogInitParamAlloc == null ) {
552 // if the method context has aliased parameters, make sure
553 // there is a blob region for all those param labels to
555 Set<Integer> aliasedParamIndices = mc.getAliasedParamIndices();
556 if( !aliasedParamIndices.isEmpty() ) {
557 og.makeAliasedParamHeapRegionNode( tdAliasedParams );
560 // set up each parameter
561 for( int i = 0; i < fm.numParameters(); ++i ) {
562 TempDescriptor tdParam = fm.getParameter( i );
563 Integer paramIndex = new Integer( i );
565 if( aliasedParamIndices.contains( paramIndex ) ) {
566 // just point this one to the alias blob
567 og.assignTempEqualToAliasedParam( tdParam,
571 // this parameter is not aliased to others, give it
572 // a fresh parameter heap region
574 og.assignTempEqualToParamAlloc(tdParam,
575 mc.getDescriptor() instanceof TaskDescriptor,
581 OwnershipGraph ogResult = new OwnershipGraph(allocationDepth, typeUtil);
583 mapMethodContextToInitialParamAllocGraph.put(mc, ogResult);
586 // or just leverage the cached copy
587 og.merge(ogInitParamAlloc);
591 case FKind.FlatOpNode:
592 FlatOpNode fon = (FlatOpNode) fn;
593 if( fon.getOp().getOp() == Operation.ASSIGN ) {
596 og.assignTempXEqualToTempY(lhs, rhs);
600 case FKind.FlatFieldNode:
601 FlatFieldNode ffn = (FlatFieldNode) fn;
604 fld = ffn.getField();
605 if( !fld.getType().isImmutable() ) {
606 og.assignTempXEqualToTempYFieldF(lhs, rhs, fld);
610 case FKind.FlatSetFieldNode:
611 FlatSetFieldNode fsfn = (FlatSetFieldNode) fn;
613 fld = fsfn.getField();
615 if( !fld.getType().isImmutable() ) {
616 og.assignTempXFieldFEqualToTempY(lhs, fld, rhs);
620 case FKind.FlatElementNode:
621 FlatElementNode fen = (FlatElementNode) fn;
624 if( !lhs.getType().isImmutable() ) {
625 og.assignTempXEqualToTempYFieldF(lhs, rhs, fdElement);
629 case FKind.FlatSetElementNode:
630 FlatSetElementNode fsen = (FlatSetElementNode) fn;
633 if( !rhs.getType().isImmutable() ) {
634 og.assignTempXFieldFEqualToTempY(lhs, fdElement, rhs);
639 FlatNew fnn = (FlatNew) fn;
641 if( !lhs.getType().isImmutable() ) {
642 AllocationSite as = getAllocationSiteFromFlatNewPRIVATE(fnn);
643 og.assignTempEqualToNewAlloc(lhs, as);
648 FlatCall fc = (FlatCall) fn;
649 MethodDescriptor md = fc.getMethod();
650 FlatMethod flatm = state.getMethodFlat(md);
651 OwnershipGraph ogMergeOfAllPossibleCalleeResults = new OwnershipGraph(allocationDepth, typeUtil);
653 if( md.isStatic() ) {
654 // a static method is simply always the same, makes life easy
655 ogMergeOfAllPossibleCalleeResults = og;
657 Set<Integer> aliasedParamIndices =
658 ogMergeOfAllPossibleCalleeResults.calculateAliasedParamSet(fc, md.isStatic(), flatm);
659 MethodContext mcNew = new MethodContext( md, aliasedParamIndices );
660 OwnershipGraph onlyPossibleCallee = mapMethodContextToCompleteOwnershipGraph.get( mcNew );
662 if( onlyPossibleCallee == null ) {
663 // if this method context has never been analyzed just schedule it for analysis
664 // and skip over this call site for now
665 methodContextsToVisit.add( mcNew );
668 ogMergeOfAllPossibleCalleeResults.resolveMethodCall(fc, md.isStatic(), flatm, onlyPossibleCallee);
672 // if the method descriptor is virtual, then there could be a
673 // set of possible methods that will actually be invoked, so
674 // find all of them and merge all of their results together
675 TypeDescriptor typeDesc = fc.getThis().getType();
676 Set possibleCallees = callGraph.getMethods(md, typeDesc);
678 Iterator i = possibleCallees.iterator();
679 while( i.hasNext() ) {
680 MethodDescriptor possibleMd = (MethodDescriptor) i.next();
681 FlatMethod pflatm = state.getMethodFlat(possibleMd);
683 // don't alter the working graph (og) until we compute a result for every
684 // possible callee, merge them all together, then set og to that
685 OwnershipGraph ogCopy = new OwnershipGraph(allocationDepth, typeUtil);
688 Set<Integer> aliasedParamIndices =
689 ogCopy.calculateAliasedParamSet(fc, possibleMd.isStatic(), pflatm);
690 MethodContext mcNew = new MethodContext( possibleMd, aliasedParamIndices );
691 OwnershipGraph ogPotentialCallee = mapMethodContextToCompleteOwnershipGraph.get( mcNew );
693 if( ogPotentialCallee == null ) {
694 // if this method context has never been analyzed just schedule it for analysis
695 // and skip over this call site for now
696 methodContextsToVisit.add( mcNew );
699 ogCopy.resolveMethodCall(fc, possibleMd.isStatic(), pflatm, ogPotentialCallee);
702 ogMergeOfAllPossibleCalleeResults.merge(ogCopy);
706 og = ogMergeOfAllPossibleCalleeResults;
709 case FKind.FlatReturnNode:
710 FlatReturnNode frn = (FlatReturnNode) fn;
711 rhs = frn.getReturnTemp();
712 if( rhs != null && !rhs.getType().isImmutable() ) {
713 og.assignReturnEqualToTemp(rhs);
715 setRetNodes.add(frn);
723 // insert a call to debugSnapshot() somewhere in the analysis to get
724 // successive captures of the analysis state
725 int debugCounter = 0;
726 int numStartCountReport = 0;
727 int freqCountReport = 1000;
728 int iterStartCapture = 20000;
729 int numIterToCapture = 400;
730 void debugSnapshot(OwnershipGraph og, FlatNode fn) {
732 if( debugCounter > numStartCountReport &&
733 debugCounter % freqCountReport == 0 ) {
734 System.out.println(" @@@ debug counter = "+debugCounter);
736 if( debugCounter > iterStartCapture ) {
737 System.out.println(" @@@ capturing debug "+(debugCounter-iterStartCapture)+" @@@");
738 String graphName = String.format("snap%04d",debugCounter-iterStartCapture);
740 graphName = graphName+fn;
743 og.writeGraph(graphName, true, true, false, false, false);
744 } catch( Exception e ) {
745 System.out.println("Error writing debug capture.");
749 if( debugCounter == iterStartCapture + numIterToCapture ) {
750 System.out.println("Stopping analysis after debug captures.");
757 // this method should generate integers strictly greater than zero!
758 // special "shadow" regions are made from a heap region by negating
760 static public Integer generateUniqueHeapRegionNodeID() {
762 return new Integer(uniqueIDcount);
766 private void setGraphForMethodContext(MethodContext mc, OwnershipGraph og)
769 mapMethodContextToCompleteOwnershipGraph.put(mc, og);
771 // arguments to writeGraph are:
772 // boolean writeLabels,
773 // boolean labelSelect,
774 // boolean pruneGarbage,
775 // boolean writeReferencers
776 // boolean writeParamMappings
780 if( !writeAllDOTs ) {
781 og.writeGraph(mc, true, true, true, false, false);
784 if( !mapMethodContextToNumUpdates.containsKey(mc) ) {
785 mapMethodContextToNumUpdates.put(mc, new Integer(0) );
787 Integer n = mapMethodContextToNumUpdates.get(mc);
788 og.writeGraph(mc, n, true, true, true, false, false);
789 mapMethodContextToNumUpdates.put(mc, n + 1);
795 // return just the allocation site associated with one FlatNew node
796 private AllocationSite getAllocationSiteFromFlatNewPRIVATE(FlatNew fn) {
798 if( !mapFlatNewToAllocationSite.containsKey(fn) ) {
799 AllocationSite as = new AllocationSite(allocationDepth, fn);
801 // the newest nodes are single objects
802 for( int i = 0; i < allocationDepth; ++i ) {
803 Integer id = generateUniqueHeapRegionNodeID();
804 as.setIthOldest(i, id);
807 // the oldest node is a summary node
808 Integer idSummary = generateUniqueHeapRegionNodeID();
809 as.setSummary(idSummary);
811 mapFlatNewToAllocationSite.put(fn, as);
814 return mapFlatNewToAllocationSite.get(fn);
818 // return all allocation sites in the method (there is one allocation
819 // site per FlatNew node in a method)
820 private HashSet<AllocationSite> getAllocationSiteSet(Descriptor d) {
821 if( !mapDescriptorToAllocationSiteSet.containsKey(d) ) {
822 buildAllocationSiteSet(d);
825 return mapDescriptorToAllocationSiteSet.get(d);
829 private void buildAllocationSiteSet(Descriptor d) {
830 HashSet<AllocationSite> s = new HashSet<AllocationSite>();
833 if( d instanceof MethodDescriptor ) {
834 fm = state.getMethodFlat( (MethodDescriptor) d);
836 assert d instanceof TaskDescriptor;
837 fm = state.getMethodFlat( (TaskDescriptor) d);
840 // visit every node in this FlatMethod's IR graph
841 // and make a set of the allocation sites from the
842 // FlatNew node's visited
843 HashSet<FlatNode> visited = new HashSet<FlatNode>();
844 HashSet<FlatNode> toVisit = new HashSet<FlatNode>();
847 while( !toVisit.isEmpty() ) {
848 FlatNode n = toVisit.iterator().next();
850 if( n instanceof FlatNew ) {
851 s.add(getAllocationSiteFromFlatNewPRIVATE( (FlatNew) n) );
857 for( int i = 0; i < n.numNext(); ++i ) {
858 FlatNode child = n.getNext(i);
859 if( !visited.contains(child) ) {
865 mapDescriptorToAllocationSiteSet.put(d, s);
869 private HashSet<AllocationSite>
870 getFlaggedAllocationSitesReachableFromTaskPRIVATE(TaskDescriptor td) {
872 HashSet<AllocationSite> asSetTotal = new HashSet<AllocationSite>();
873 HashSet<Descriptor> toVisit = new HashSet<Descriptor>();
874 HashSet<Descriptor> visited = new HashSet<Descriptor>();
878 // traverse this task and all methods reachable from this task
879 while( !toVisit.isEmpty() ) {
880 Descriptor d = toVisit.iterator().next();
884 HashSet<AllocationSite> asSet = getAllocationSiteSet(d);
885 Iterator asItr = asSet.iterator();
886 while( asItr.hasNext() ) {
887 AllocationSite as = (AllocationSite) asItr.next();
888 TypeDescriptor typed = as.getType();
889 if( typed != null ) {
890 ClassDescriptor cd = typed.getClassDesc();
891 if( cd != null && cd.hasFlags() ) {
897 // enqueue callees of this method to be searched for
898 // allocation sites also
899 Set callees = callGraph.getCalleeSet(d);
900 if( callees != null ) {
901 Iterator methItr = callees.iterator();
902 while( methItr.hasNext() ) {
903 MethodDescriptor md = (MethodDescriptor) methItr.next();
905 if( !visited.contains(md) ) {