3 import Analysis.CallGraph.*;
4 import Analysis.OwnershipAnalysis.*;
12 public class MLPAnalysis {
14 // data from the compiler
16 private TypeUtil typeUtil;
17 private CallGraph callGraph;
18 private OwnershipAnalysis ownAnalysis;
21 // an implicit SESE is automatically spliced into
22 // the IR graph around the C main before this analysis--it
23 // is nothing special except that we can make assumptions
24 // about it, such as the whole program ends when it ends
25 private FlatSESEEnterNode mainSESE;
27 // SESEs that are the root of an SESE tree belong to this
28 // set--the main SESE is always a root, statically SESEs
29 // inside methods are a root because we don't know how they
30 // will fit into the runtime tree of SESEs
31 private Set<FlatSESEEnterNode> rootSESEs;
33 // simply a set of every reachable SESE in the program, not
34 // including caller placeholder SESEs
35 private Set<FlatSESEEnterNode> allSESEs;
38 // A mapping of flat nodes to the stack of SESEs for that node, where
39 // an SESE is the child of the SESE directly below it on the stack.
40 // These stacks do not reflect the heirarchy over methods calls--whenever
41 // there is an empty stack it means all variables are available.
42 private Hashtable< FlatNode, Stack<FlatSESEEnterNode> > seseStacks;
44 private Hashtable< FlatNode, Set<TempDescriptor> > livenessRootView;
45 private Hashtable< FlatNode, Set<TempDescriptor> > livenessVirtualReads;
46 private Hashtable< FlatNode, VarSrcTokTable > variableResults;
47 private Hashtable< FlatNode, Set<TempDescriptor> > notAvailableResults;
48 private Hashtable< FlatNode, CodePlan > codePlans;
50 private Hashtable< FlatEdge, FlatWriteDynamicVarNode > wdvNodesToSpliceIn;
52 private Hashtable< MethodContext, HashSet<AllocationSite>> mapMethodContextToLiveInAllocationSiteSet;
54 public static int maxSESEage = -1;
57 // use these methods in BuildCode to have access to analysis results
58 public FlatSESEEnterNode getMainSESE() {
62 public Set<FlatSESEEnterNode> getRootSESEs() {
66 public Set<FlatSESEEnterNode> getAllSESEs() {
70 public int getMaxSESEage() {
75 public CodePlan getCodePlan( FlatNode fn ) {
76 CodePlan cp = codePlans.get( fn );
81 public MLPAnalysis( State state,
84 OwnershipAnalysis ownAnalysis
87 double timeStartAnalysis = (double) System.nanoTime();
91 this.callGraph = callGraph;
92 this.ownAnalysis = ownAnalysis;
93 this.maxSESEage = state.MLP_MAXSESEAGE;
95 rootSESEs = new HashSet<FlatSESEEnterNode>();
96 allSESEs = new HashSet<FlatSESEEnterNode>();
98 seseStacks = new Hashtable< FlatNode, Stack<FlatSESEEnterNode> >();
99 livenessRootView = new Hashtable< FlatNode, Set<TempDescriptor> >();
100 livenessVirtualReads = new Hashtable< FlatNode, Set<TempDescriptor> >();
101 variableResults = new Hashtable< FlatNode, VarSrcTokTable >();
102 notAvailableResults = new Hashtable< FlatNode, Set<TempDescriptor> >();
103 codePlans = new Hashtable< FlatNode, CodePlan >();
104 wdvNodesToSpliceIn = new Hashtable< FlatEdge, FlatWriteDynamicVarNode >();
106 mapMethodContextToLiveInAllocationSiteSet = new Hashtable< MethodContext, HashSet<AllocationSite>>();
109 FlatMethod fmMain = state.getMethodFlat( typeUtil.getMain() );
111 mainSESE = (FlatSESEEnterNode) fmMain.getNext(0);
112 mainSESE.setfmEnclosing( fmMain );
113 mainSESE.setmdEnclosing( fmMain.getMethod() );
114 mainSESE.setcdEnclosing( fmMain.getMethod().getClassDesc() );
118 // run analysis on each method that is actually called
119 // reachability analysis already computed this so reuse
120 Iterator<Descriptor> methItr = ownAnalysis.descriptorsToAnalyze.iterator();
121 while( methItr.hasNext() ) {
122 Descriptor d = methItr.next();
123 FlatMethod fm = state.getMethodFlat( d );
125 // find every SESE from methods that may be called
126 // and organize them into roots and children
127 buildForestForward( fm );
131 // 2nd pass, results are saved in FlatSESEEnterNode, so
132 // intermediate results, for safety, are discarded
133 Iterator<FlatSESEEnterNode> rootItr = rootSESEs.iterator();
134 while( rootItr.hasNext() ) {
135 FlatSESEEnterNode root = rootItr.next();
136 livenessAnalysisBackward( root,
143 methItr = ownAnalysis.descriptorsToAnalyze.iterator();
144 while( methItr.hasNext() ) {
145 Descriptor d = methItr.next();
146 FlatMethod fm = state.getMethodFlat( d );
148 // starting from roots do a forward, fixed-point
149 // variable analysis for refinement and stalls
150 variableAnalysisForward( fm );
153 // 4th pass, compute liveness contribution from
154 // virtual reads discovered in variable pass
155 rootItr = rootSESEs.iterator();
156 while( rootItr.hasNext() ) {
157 FlatSESEEnterNode root = rootItr.next();
158 livenessAnalysisBackward( root,
165 SOMETHING IS WRONG WITH THIS, DON'T USE IT UNTIL IT CAN BE FIXED
168 methItr = ownAnalysis.descriptorsToAnalyze.iterator();
169 while( methItr.hasNext() ) {
170 Descriptor d = methItr.next();
171 FlatMethod fm = state.getMethodFlat( d );
173 // prune variable results in one traversal
174 // by removing reference variables that are not live
175 pruneVariableResultsWithLiveness( fm );
181 methItr = ownAnalysis.descriptorsToAnalyze.iterator();
182 while( methItr.hasNext() ) {
183 Descriptor d = methItr.next();
184 FlatMethod fm = state.getMethodFlat( d );
186 // compute what is not available at every program
187 // point, in a forward fixed-point pass
188 notAvailableForward( fm );
192 methItr = ownAnalysis.descriptorsToAnalyze.iterator();
193 JavaCallGraph javaCallGraph = new JavaCallGraph(state,tu);
194 while( methItr.hasNext() ) {
195 Descriptor d = methItr.next();
196 FlatMethod fm = state.getMethodFlat( d );
197 methodEffects(fm,javaCallGraph);
200 // disjoint analysis with a set of flagged allocation sites of live-in variable
202 OwnershipAnalysis oa2 = new OwnershipAnalysis(state, tu, callGraph,
203 state.OWNERSHIPALLOCDEPTH, false,
204 false, state.OWNERSHIPALIASFILE,
206 mapMethodContextToLiveInAllocationSiteSet);
208 methItr = oa2.descriptorsToAnalyze.iterator();
209 while (methItr.hasNext()) {
210 Descriptor d = methItr.next();
211 FlatMethod fm = state.getMethodFlat(d);
212 debugFunction(oa2, fm);
215 } catch (IOException e) {
216 System.err.println(e);
222 methItr = ownAnalysis.descriptorsToAnalyze.iterator();
223 while( methItr.hasNext() ) {
224 Descriptor d = methItr.next();
225 FlatMethod fm = state.getMethodFlat( d );
227 // compute a plan for code injections
228 codePlansForward( fm );
232 // splice new IR nodes into graph after all
233 // analysis passes are complete
234 Iterator spliceItr = wdvNodesToSpliceIn.entrySet().iterator();
235 while( spliceItr.hasNext() ) {
236 Map.Entry me = (Map.Entry) spliceItr.next();
237 FlatWriteDynamicVarNode fwdvn = (FlatWriteDynamicVarNode) me.getValue();
238 fwdvn.spliceIntoIR();
242 double timeEndAnalysis = (double) System.nanoTime();
243 double dt = (timeEndAnalysis - timeStartAnalysis)/(Math.pow( 10.0, 9.0 ) );
244 String treport = String.format( "The mlp analysis took %.3f sec.", dt );
245 System.out.println( treport );
247 if( state.MLPDEBUG ) {
249 writeReports( treport );
250 } catch( IOException e ) {}
255 private void buildForestForward( FlatMethod fm ) {
257 // start from flat method top, visit every node in
258 // method exactly once, find SESEs and remember
259 // roots and child relationships
260 Set<FlatNode> flatNodesToVisit = new HashSet<FlatNode>();
261 flatNodesToVisit.add( fm );
263 Set<FlatNode> visited = new HashSet<FlatNode>();
265 Stack<FlatSESEEnterNode> seseStackFirst = new Stack<FlatSESEEnterNode>();
266 seseStacks.put( fm, seseStackFirst );
268 while( !flatNodesToVisit.isEmpty() ) {
269 Iterator<FlatNode> fnItr = flatNodesToVisit.iterator();
270 FlatNode fn = fnItr.next();
272 Stack<FlatSESEEnterNode> seseStack = seseStacks.get( fn );
273 assert seseStack != null;
275 flatNodesToVisit.remove( fn );
278 buildForest_nodeActions( fn, seseStack, fm );
280 for( int i = 0; i < fn.numNext(); i++ ) {
281 FlatNode nn = fn.getNext( i );
283 if( !visited.contains( nn ) ) {
284 flatNodesToVisit.add( nn );
286 // clone stack and send along each analysis path
287 seseStacks.put( nn, (Stack<FlatSESEEnterNode>)seseStack.clone() );
293 private void buildForest_nodeActions( FlatNode fn,
294 Stack<FlatSESEEnterNode> seseStack,
296 switch( fn.kind() ) {
298 case FKind.FlatSESEEnterNode: {
299 FlatSESEEnterNode fsen = (FlatSESEEnterNode) fn;
301 if( !fsen.getIsCallerSESEplaceholder() ) {
302 allSESEs.add( fsen );
305 fsen.setfmEnclosing( fm );
306 fsen.setmdEnclosing( fm.getMethod() );
307 fsen.setcdEnclosing( fm.getMethod().getClassDesc() );
309 if( seseStack.empty() ) {
310 rootSESEs.add( fsen );
311 fsen.setParent( null );
313 seseStack.peek().addChild( fsen );
314 fsen.setParent( seseStack.peek() );
317 seseStack.push( fsen );
320 case FKind.FlatSESEExitNode: {
321 FlatSESEExitNode fsexn = (FlatSESEExitNode) fn;
322 assert !seseStack.empty();
323 FlatSESEEnterNode fsen = seseStack.pop();
326 case FKind.FlatReturnNode: {
327 FlatReturnNode frn = (FlatReturnNode) fn;
328 if( !seseStack.empty() &&
329 !seseStack.peek().getIsCallerSESEplaceholder()
331 throw new Error( "Error: return statement enclosed within SESE "+
332 seseStack.peek().getPrettyIdentifier() );
340 private void livenessAnalysisBackward( FlatSESEEnterNode fsen,
342 Hashtable< FlatSESEExitNode, Set<TempDescriptor> > liveout ) {
344 // start from an SESE exit, visit nodes in reverse up to
345 // SESE enter in a fixed-point scheme, where children SESEs
346 // should already be analyzed and therefore can be skipped
347 // because child SESE enter node has all necessary info
348 Set<FlatNode> flatNodesToVisit = new HashSet<FlatNode>();
351 flatNodesToVisit.add( fsen.getfmEnclosing().getFlatExit() );
353 flatNodesToVisit.add( fsen.getFlatExit() );
356 Hashtable<FlatNode, Set<TempDescriptor>> livenessResults =
357 new Hashtable< FlatNode, Set<TempDescriptor> >();
360 liveout = new Hashtable< FlatSESEExitNode, Set<TempDescriptor> >();
363 while( !flatNodesToVisit.isEmpty() ) {
364 FlatNode fn = (FlatNode) flatNodesToVisit.iterator().next();
365 flatNodesToVisit.remove( fn );
367 Set<TempDescriptor> prev = livenessResults.get( fn );
369 // merge sets from control flow joins
370 Set<TempDescriptor> u = new HashSet<TempDescriptor>();
371 for( int i = 0; i < fn.numNext(); i++ ) {
372 FlatNode nn = fn.getNext( i );
373 Set<TempDescriptor> s = livenessResults.get( nn );
379 Set<TempDescriptor> curr = liveness_nodeActions( fn, u, fsen, toplevel, liveout);
381 // if a new result, schedule backward nodes for analysis
382 if( !curr.equals( prev ) ) {
383 livenessResults.put( fn, curr );
385 // don't flow backwards past current SESE enter
386 if( !fn.equals( fsen ) ) {
387 for( int i = 0; i < fn.numPrev(); i++ ) {
388 FlatNode nn = fn.getPrev( i );
389 flatNodesToVisit.add( nn );
395 Set<TempDescriptor> s = livenessResults.get( fsen );
397 fsen.addInVarSet( s );
400 // remember liveness per node from the root view as the
401 // global liveness of variables for later passes to use
403 livenessRootView.putAll( livenessResults );
406 // post-order traversal, so do children first
407 Iterator<FlatSESEEnterNode> childItr = fsen.getChildren().iterator();
408 while( childItr.hasNext() ) {
409 FlatSESEEnterNode fsenChild = childItr.next();
410 livenessAnalysisBackward( fsenChild, false, liveout );
414 private Set<TempDescriptor> liveness_nodeActions( FlatNode fn,
415 Set<TempDescriptor> liveIn,
416 FlatSESEEnterNode currentSESE,
418 Hashtable< FlatSESEExitNode, Set<TempDescriptor> > liveout
420 switch( fn.kind() ) {
422 case FKind.FlatSESEExitNode:
424 FlatSESEExitNode fsexn = (FlatSESEExitNode) fn;
425 if( !liveout.containsKey( fsexn ) ) {
426 liveout.put( fsexn, new HashSet<TempDescriptor>() );
428 liveout.get( fsexn ).addAll( liveIn );
430 // no break, sese exits should also execute default actions
433 // handle effects of statement in reverse, writes then reads
434 TempDescriptor [] writeTemps = fn.writesTemps();
435 for( int i = 0; i < writeTemps.length; ++i ) {
436 liveIn.remove( writeTemps[i] );
439 FlatSESEExitNode fsexn = currentSESE.getFlatExit();
440 Set<TempDescriptor> livetemps = liveout.get( fsexn );
441 if( livetemps != null &&
442 livetemps.contains( writeTemps[i] ) ) {
443 // write to a live out temp...
444 // need to put in SESE liveout set
445 currentSESE.addOutVar( writeTemps[i] );
450 TempDescriptor [] readTemps = fn.readsTemps();
451 for( int i = 0; i < readTemps.length; ++i ) {
452 liveIn.add( readTemps[i] );
455 Set<TempDescriptor> virtualReadTemps = livenessVirtualReads.get( fn );
456 if( virtualReadTemps != null ) {
457 liveIn.addAll( virtualReadTemps );
468 private void variableAnalysisForward( FlatMethod fm ) {
470 Set<FlatNode> flatNodesToVisit = new HashSet<FlatNode>();
471 flatNodesToVisit.add( fm );
473 while( !flatNodesToVisit.isEmpty() ) {
474 FlatNode fn = (FlatNode) flatNodesToVisit.iterator().next();
475 flatNodesToVisit.remove( fn );
477 Stack<FlatSESEEnterNode> seseStack = seseStacks.get( fn );
478 assert seseStack != null;
480 VarSrcTokTable prev = variableResults.get( fn );
482 // merge sets from control flow joins
483 VarSrcTokTable curr = new VarSrcTokTable();
484 for( int i = 0; i < fn.numPrev(); i++ ) {
485 FlatNode nn = fn.getPrev( i );
486 VarSrcTokTable incoming = variableResults.get( nn );
487 curr.merge( incoming );
490 if( !seseStack.empty() ) {
491 variable_nodeActions( fn, curr, seseStack.peek() );
494 // if a new result, schedule forward nodes for analysis
495 if( !curr.equals( prev ) ) {
496 variableResults.put( fn, curr );
498 for( int i = 0; i < fn.numNext(); i++ ) {
499 FlatNode nn = fn.getNext( i );
500 flatNodesToVisit.add( nn );
506 private void variable_nodeActions( FlatNode fn,
507 VarSrcTokTable vstTable,
508 FlatSESEEnterNode currentSESE ) {
509 switch( fn.kind() ) {
511 case FKind.FlatSESEEnterNode: {
512 FlatSESEEnterNode fsen = (FlatSESEEnterNode) fn;
513 assert fsen.equals( currentSESE );
515 vstTable.age( currentSESE );
516 vstTable.assertConsistency();
519 case FKind.FlatSESEExitNode: {
520 FlatSESEExitNode fsexn = (FlatSESEExitNode) fn;
521 FlatSESEEnterNode fsen = fsexn.getFlatEnter();
522 assert currentSESE.getChildren().contains( fsen );
524 vstTable.remapChildTokens( fsen );
526 // liveness virtual reads are things that might be
527 // written by an SESE and should be added to the in-set
528 // anything virtually read by this SESE should be pruned
529 // of parent or sibling sources
530 Set<TempDescriptor> liveVars = livenessRootView.get( fn );
531 Set<TempDescriptor> fsenVirtReads = vstTable.calcVirtReadsAndPruneParentAndSiblingTokens( fsen, liveVars );
532 Set<TempDescriptor> fsenVirtReadsOld = livenessVirtualReads.get( fn );
533 if( fsenVirtReadsOld != null ) {
534 fsenVirtReads.addAll( fsenVirtReadsOld );
536 livenessVirtualReads.put( fn, fsenVirtReads );
539 // then all child out-set tokens are guaranteed
540 // to be filled in, so clobber those entries with
541 // the latest, clean sources
542 Iterator<TempDescriptor> outVarItr = fsen.getOutVarSet().iterator();
543 while( outVarItr.hasNext() ) {
544 TempDescriptor outVar = outVarItr.next();
545 HashSet<TempDescriptor> ts = new HashSet<TempDescriptor>();
547 VariableSourceToken vst =
548 new VariableSourceToken( ts,
553 vstTable.remove( outVar );
556 vstTable.assertConsistency();
560 case FKind.FlatOpNode: {
561 FlatOpNode fon = (FlatOpNode) fn;
563 if( fon.getOp().getOp() == Operation.ASSIGN ) {
564 TempDescriptor lhs = fon.getDest();
565 TempDescriptor rhs = fon.getLeft();
567 vstTable.remove( lhs );
569 Set<VariableSourceToken> forAddition = new HashSet<VariableSourceToken>();
571 Iterator<VariableSourceToken> itr = vstTable.get( rhs ).iterator();
572 while( itr.hasNext() ) {
573 VariableSourceToken vst = itr.next();
575 HashSet<TempDescriptor> ts = new HashSet<TempDescriptor>();
578 if( currentSESE.getChildren().contains( vst.getSESE() ) ) {
579 // if the source comes from a child, copy it over
580 forAddition.add( new VariableSourceToken( ts,
587 // otherwise, stamp it as us as the source
588 forAddition.add( new VariableSourceToken( ts,
597 vstTable.addAll( forAddition );
599 // only break if this is an ASSIGN op node,
600 // otherwise fall through to default case
601 vstTable.assertConsistency();
606 // note that FlatOpNode's that aren't ASSIGN
607 // fall through to this default case
609 TempDescriptor [] writeTemps = fn.writesTemps();
610 if( writeTemps.length > 0 ) {
613 // for now, when writeTemps > 1, make sure
614 // its a call node, programmer enforce only
615 // doing stuff like calling a print routine
616 //assert writeTemps.length == 1;
617 if( writeTemps.length > 1 ) {
618 assert fn.kind() == FKind.FlatCall ||
619 fn.kind() == FKind.FlatMethod;
623 vstTable.remove( writeTemps[0] );
625 HashSet<TempDescriptor> ts = new HashSet<TempDescriptor>();
626 ts.add( writeTemps[0] );
628 vstTable.add( new VariableSourceToken( ts,
636 vstTable.assertConsistency();
643 private void pruneVariableResultsWithLiveness( FlatMethod fm ) {
645 // start from flat method top, visit every node in
646 // method exactly once
647 Set<FlatNode> flatNodesToVisit = new HashSet<FlatNode>();
648 flatNodesToVisit.add( fm );
650 Set<FlatNode> visited = new HashSet<FlatNode>();
652 while( !flatNodesToVisit.isEmpty() ) {
653 Iterator<FlatNode> fnItr = flatNodesToVisit.iterator();
654 FlatNode fn = fnItr.next();
656 flatNodesToVisit.remove( fn );
659 Set<TempDescriptor> rootLiveSet = livenessRootView.get( fn );
660 VarSrcTokTable vstTable = variableResults.get( fn );
662 vstTable.pruneByLiveness( rootLiveSet );
664 for( int i = 0; i < fn.numNext(); i++ ) {
665 FlatNode nn = fn.getNext( i );
667 if( !visited.contains( nn ) ) {
668 flatNodesToVisit.add( nn );
675 private void notAvailableForward( FlatMethod fm ) {
677 Set<FlatNode> flatNodesToVisit = new HashSet<FlatNode>();
678 flatNodesToVisit.add( fm );
680 while( !flatNodesToVisit.isEmpty() ) {
681 FlatNode fn = (FlatNode) flatNodesToVisit.iterator().next();
682 flatNodesToVisit.remove( fn );
684 Stack<FlatSESEEnterNode> seseStack = seseStacks.get( fn );
685 assert seseStack != null;
687 Set<TempDescriptor> prev = notAvailableResults.get( fn );
689 Set<TempDescriptor> curr = new HashSet<TempDescriptor>();
690 for( int i = 0; i < fn.numPrev(); i++ ) {
691 FlatNode nn = fn.getPrev( i );
692 Set<TempDescriptor> notAvailIn = notAvailableResults.get( nn );
693 if( notAvailIn != null ) {
694 curr.addAll( notAvailIn );
698 if( !seseStack.empty() ) {
699 notAvailable_nodeActions( fn, curr, seseStack.peek() );
702 // if a new result, schedule forward nodes for analysis
703 if( !curr.equals( prev ) ) {
704 notAvailableResults.put( fn, curr );
706 for( int i = 0; i < fn.numNext(); i++ ) {
707 FlatNode nn = fn.getNext( i );
708 flatNodesToVisit.add( nn );
714 private void notAvailable_nodeActions( FlatNode fn,
715 Set<TempDescriptor> notAvailSet,
716 FlatSESEEnterNode currentSESE ) {
718 // any temps that are removed from the not available set
719 // at this node should be marked in this node's code plan
720 // as temps to be grabbed at runtime!
722 switch( fn.kind() ) {
724 case FKind.FlatSESEEnterNode: {
725 FlatSESEEnterNode fsen = (FlatSESEEnterNode) fn;
726 assert fsen.equals( currentSESE );
730 case FKind.FlatSESEExitNode: {
731 FlatSESEExitNode fsexn = (FlatSESEExitNode) fn;
732 FlatSESEEnterNode fsen = fsexn.getFlatEnter();
733 assert currentSESE.getChildren().contains( fsen );
734 notAvailSet.addAll( fsen.getOutVarSet() );
737 case FKind.FlatMethod: {
741 case FKind.FlatOpNode: {
742 FlatOpNode fon = (FlatOpNode) fn;
744 if( fon.getOp().getOp() == Operation.ASSIGN ) {
745 TempDescriptor lhs = fon.getDest();
746 TempDescriptor rhs = fon.getLeft();
748 // copy makes lhs same availability as rhs
749 if( notAvailSet.contains( rhs ) ) {
750 notAvailSet.add( lhs );
752 notAvailSet.remove( lhs );
755 // only break if this is an ASSIGN op node,
756 // otherwise fall through to default case
761 // note that FlatOpNode's that aren't ASSIGN
762 // fall through to this default case
764 TempDescriptor [] writeTemps = fn.writesTemps();
765 for( int i = 0; i < writeTemps.length; i++ ) {
766 TempDescriptor wTemp = writeTemps[i];
767 notAvailSet.remove( wTemp );
769 TempDescriptor [] readTemps = fn.readsTemps();
770 for( int i = 0; i < readTemps.length; i++ ) {
771 TempDescriptor rTemp = readTemps[i];
772 notAvailSet.remove( rTemp );
774 // if this variable has exactly one source, potentially
775 // get other things from this source as well
776 VarSrcTokTable vstTable = variableResults.get( fn );
779 vstTable.getRefVarSrcType( rTemp,
781 currentSESE.getParent() );
783 if( srcType.equals( VarSrcTokTable.SrcType_STATIC ) ) {
785 VariableSourceToken vst = vstTable.get( rTemp ).iterator().next();
787 Iterator<VariableSourceToken> availItr = vstTable.get( vst.getSESE(),
791 // look through things that are also available from same source
792 while( availItr.hasNext() ) {
793 VariableSourceToken vstAlsoAvail = availItr.next();
795 Iterator<TempDescriptor> refVarItr = vstAlsoAvail.getRefVars().iterator();
796 while( refVarItr.hasNext() ) {
797 TempDescriptor refVarAlso = refVarItr.next();
799 // if a variable is available from the same source, AND it ALSO
800 // only comes from one statically known source, mark it available
801 Integer srcTypeAlso =
802 vstTable.getRefVarSrcType( refVarAlso,
804 currentSESE.getParent() );
805 if( srcTypeAlso.equals( VarSrcTokTable.SrcType_STATIC ) ) {
806 notAvailSet.remove( refVarAlso );
817 private void debugFunction(OwnershipAnalysis oa2, FlatMethod fm) {
819 String methodName="SomeWork";
821 MethodDescriptor md=fm.getMethod();
822 HashSet<MethodContext> mcSet=oa2.getAllMethodContextSetByDescriptor(md);
823 Iterator<MethodContext> mcIter=mcSet.iterator();
825 while(mcIter.hasNext()){
826 MethodContext mc=mcIter.next();
828 OwnershipGraph og=oa2.getOwnvershipGraphByMethodContext(mc);
830 if(fm.toString().indexOf(methodName)>0){
832 og.writeGraph(fm.toString() + "SECONDGRAPH", true, true, true, true, false);
833 } catch (IOException e) {
834 System.out.println("Error writing debug capture.");
845 private void methodEffects(FlatMethod fm, CallGraph callGraph) {
847 MethodDescriptor md=fm.getMethod();
848 HashSet<MethodContext> mcSet=ownAnalysis.getAllMethodContextSetByDescriptor(md);
849 Iterator<MethodContext> mcIter=mcSet.iterator();
851 while(mcIter.hasNext()){
852 MethodContext mc=mcIter.next();
854 Set<FlatNode> visited = new HashSet<FlatNode>();
856 Set<FlatNode> flatNodesToVisit = new HashSet<FlatNode>();
857 flatNodesToVisit.add(fm);
859 while (!flatNodesToVisit.isEmpty()) {
860 FlatNode fn = (FlatNode) flatNodesToVisit.iterator().next();
861 flatNodesToVisit.remove(fn);
863 Stack<FlatSESEEnterNode> seseStack = seseStacks.get(fn);
864 assert seseStack != null;
866 if (!seseStack.empty()) {
867 effects_nodeActions(mc, fn, seseStack.peek(), callGraph);
870 flatNodesToVisit.remove(fn);
873 for (int i = 0; i < fn.numNext(); i++) {
874 FlatNode nn = fn.getNext(i);
875 if (!visited.contains(nn)) {
876 flatNodesToVisit.add(nn);
887 private void analyzeRelatedAllocationSite(MethodDescriptor callerMD,
888 MethodContext calleeMC, HashSet<Integer> paramIndexSet,
889 HashSet<HeapRegionNode> visitedHRN) {
891 HashSet<MethodContext> mcSet = ownAnalysis
892 .getAllMethodContextSetByDescriptor(callerMD);
896 Iterator<MethodContext> mcIter = mcSet.iterator();
898 FlatMethod callerFM = state.getMethodFlat(callerMD);
900 while (mcIter.hasNext()) {
901 MethodContext mc = mcIter.next();
903 Set<FlatNode> visited = new HashSet<FlatNode>();
904 Set<FlatNode> flatNodesToVisit = new HashSet<FlatNode>();
905 flatNodesToVisit.add(callerFM);
907 while (!flatNodesToVisit.isEmpty()) {
908 FlatNode fn = (FlatNode) flatNodesToVisit.iterator().next();
909 flatNodesToVisit.remove(fn);
911 analyzeRelatedAllocationSite_NodeAction(fn, mc, calleeMC,
912 paramIndexSet,visitedHRN);
914 flatNodesToVisit.remove(fn);
917 for (int i = 0; i < fn.numNext(); i++) {
918 FlatNode nn = fn.getNext(i);
919 if (!visited.contains(nn)) {
920 flatNodesToVisit.add(nn);
929 private void analyzeRelatedAllocationSite_NodeAction(FlatNode fn, MethodContext callerMC,
930 MethodContext calleeMC,
931 HashSet<Integer> paramIndexSet, HashSet<HeapRegionNode> visitedHRN) {
933 OwnershipGraph og = ownAnalysis
934 .getOwnvershipGraphByMethodContext(callerMC);
938 case FKind.FlatCall: {
940 FlatCall fc = (FlatCall) fn;
942 MethodContext calleeMCfromOG = ownAnalysis.getCalleeMethodContext(
945 // disable below condition. currently collect all possible
946 // allocation sites without regarding method context
948 // if (calleeMC.equals(calleeMCfromOG)) { // in this case, this
949 // method context calls corresponding callee.
952 if (((MethodDescriptor) calleeMC.getDescriptor()).isStatic()) {
958 for (Iterator iterator = paramIndexSet.iterator(); iterator
960 Integer integer = (Integer) iterator.next();
962 int paramIdx = integer - base;
964 // if paramIdx is less than 0, assumes that it is
965 // related with wrong method contexts.
966 TempDescriptor arg = fc.getArg(paramIdx);
967 LabelNode argLN = og.td2ln.get(arg);
969 Iterator<ReferenceEdge> iterEdge = argLN
970 .iteratorToReferencees();
971 while (iterEdge.hasNext()) {
972 ReferenceEdge referenceEdge = (ReferenceEdge) iterEdge
975 HeapRegionNode dstHRN = referenceEdge.getDst();
976 if (dstHRN.isParameter()) {
977 if (!visitedHRN.contains(dstHRN)) {
978 setupRelatedAllocSiteAnalysis(og, callerMC,
982 addLiveInAllocationSite(callerMC, dstHRN
983 .getAllocationSite());
997 private void setupRelatedAllocSiteAnalysis(OwnershipGraph og,
998 MethodContext mc, HeapRegionNode dstHRN,
999 HashSet<HeapRegionNode> visitedHRN) {
1001 HashSet<Integer> paramIndexSet = new HashSet<Integer>();
1003 // collect corresponding param index
1004 Set<Integer> pIndexSet = og.idPrimary2paramIndexSet.get(dstHRN.getID());
1005 if (pIndexSet != null) {
1006 for (Iterator iterator = pIndexSet.iterator(); iterator.hasNext();) {
1007 Integer integer = (Integer) iterator.next();
1008 paramIndexSet.add(integer);
1012 Set<Integer> sIndexSet = og.idSecondary2paramIndexSet.get(dstHRN
1014 if (sIndexSet != null) {
1015 for (Iterator iterator = sIndexSet.iterator(); iterator.hasNext();) {
1016 Integer integer = (Integer) iterator.next();
1017 paramIndexSet.add(integer);
1021 if (mc.getDescriptor() instanceof MethodDescriptor) {
1022 Set callerSet = callGraph.getCallerSet((MethodDescriptor) mc
1024 for (Iterator iterator = callerSet.iterator(); iterator.hasNext();) {
1025 Object obj = (Object) iterator.next();
1026 if (obj instanceof MethodDescriptor) {
1027 MethodDescriptor callerMD = (MethodDescriptor) obj;
1029 analyzeRelatedAllocationSite(callerMD, mc, paramIndexSet,visitedHRN);
1036 private void effects_nodeActions(MethodContext mc, FlatNode fn,
1037 FlatSESEEnterNode currentSESE, CallGraph callGraph) {
1039 OwnershipGraph og = ownAnalysis.getOwnvershipGraphByMethodContext(mc);
1041 switch (fn.kind()) {
1043 case FKind.FlatSESEEnterNode: {
1045 FlatSESEEnterNode fsen = (FlatSESEEnterNode) fn;
1046 assert fsen.equals(currentSESE);
1048 // uniquely taint each live-in variable
1049 Set<TempDescriptor> set = fsen.getInVarSet();
1050 Iterator<TempDescriptor> iter = set.iterator();
1052 while (iter.hasNext()) {
1053 TempDescriptor td = iter.next();
1054 LabelNode ln = og.td2ln.get(td);
1056 int taint = (int) Math.pow(2, idx);
1057 taintLabelNode(ln, taint);
1059 // collects related allocation sites
1060 Iterator<ReferenceEdge> referenceeIter = ln
1061 .iteratorToReferencees();
1062 while (referenceeIter.hasNext()) {
1063 ReferenceEdge referenceEdge = (ReferenceEdge) referenceeIter
1065 HeapRegionNode dstHRN = referenceEdge.getDst();
1066 if (dstHRN.isParameter()) {
1068 HashSet<HeapRegionNode> visitedHRN=new HashSet<HeapRegionNode>();
1069 visitedHRN.add(dstHRN);
1070 setupRelatedAllocSiteAnalysis(og,mc,dstHRN,visitedHRN);
1073 addLiveInAllocationSite(mc, dstHRN
1074 .getAllocationSite());
1086 case FKind.FlatSESEExitNode: {
1087 FlatSESEExitNode fsexit = (FlatSESEExitNode) fn;
1089 FlatSESEEnterNode enterNode = fsexit.getFlatEnter();
1090 FlatSESEEnterNode parent = enterNode.getParent();
1091 if (parent != null) {
1093 SESEEffectsSet set = enterNode.getSeseEffectsSet();
1094 Hashtable<TempDescriptor, HashSet<SESEEffectsKey>> readTable = set
1096 Hashtable<TempDescriptor, HashSet<SESEEffectsKey>> parentReadTable = parent
1097 .getSeseEffectsSet().getReadTable();
1098 Set<TempDescriptor> keys = readTable.keySet();
1099 Iterator<TempDescriptor> keyIter = keys.iterator();
1100 while (keyIter.hasNext()) {
1101 TempDescriptor td = (TempDescriptor) keyIter.next();
1102 HashSet<SESEEffectsKey> effectsSet = readTable.get(td);
1103 HashSet<SESEEffectsKey> parentEffectsSet = parentReadTable
1105 if (parentEffectsSet == null) {
1106 parentEffectsSet = new HashSet<SESEEffectsKey>();
1109 for (Iterator iterator = effectsSet.iterator(); iterator
1111 SESEEffectsKey seseKey = (SESEEffectsKey) iterator
1113 parentEffectsSet.add(new SESEEffectsKey(seseKey
1114 .getFieldDescriptor(), seseKey
1115 .getTypeDescriptor(), seseKey.getHRNId()));
1118 parentReadTable.put(td, parentEffectsSet);
1121 Hashtable<TempDescriptor, HashSet<SESEEffectsKey>> writeTable = set
1123 Hashtable<TempDescriptor, HashSet<SESEEffectsKey>> parentWriteTable = parent
1124 .getSeseEffectsSet().getWriteTable();
1125 keys = writeTable.keySet();
1126 keyIter = keys.iterator();
1127 while (keyIter.hasNext()) {
1128 TempDescriptor td = (TempDescriptor) keyIter.next();
1129 HashSet<SESEEffectsKey> effectsSet = writeTable.get(td);
1130 HashSet<SESEEffectsKey> parentEffectsSet = parentWriteTable
1132 if (parentEffectsSet == null) {
1133 parentEffectsSet = new HashSet<SESEEffectsKey>();
1136 for (Iterator iterator = effectsSet.iterator(); iterator
1138 SESEEffectsKey seseKey = (SESEEffectsKey) iterator
1140 parentEffectsSet.add(new SESEEffectsKey(seseKey
1141 .getFieldDescriptor(), seseKey
1142 .getTypeDescriptor(), seseKey.getHRNId()));
1145 parentWriteTable.put(td, parentEffectsSet);
1148 Hashtable<TempDescriptor, HashSet<SESEEffectsKey>> strongUpdateTable = set
1149 .getStrongUpdateTable();
1150 Hashtable<TempDescriptor, HashSet<SESEEffectsKey>> parentstrongUpdateTable = parent
1151 .getSeseEffectsSet().getStrongUpdateTable();
1152 keys = strongUpdateTable.keySet();
1153 keyIter = keys.iterator();
1154 while (keyIter.hasNext()) {
1155 TempDescriptor td = (TempDescriptor) keyIter.next();
1156 HashSet<SESEEffectsKey> effectsSet = strongUpdateTable
1158 HashSet<SESEEffectsKey> parentEffectsSet = parentstrongUpdateTable
1160 if (parentEffectsSet == null) {
1161 parentEffectsSet = new HashSet<SESEEffectsKey>();
1164 for (Iterator iterator = effectsSet.iterator(); iterator
1166 SESEEffectsKey seseKey = (SESEEffectsKey) iterator
1168 parentEffectsSet.add(new SESEEffectsKey(seseKey
1169 .getFieldDescriptor(), seseKey
1170 .getTypeDescriptor(), seseKey.getHRNId()));
1173 parentstrongUpdateTable.put(td, parentEffectsSet);
1181 case FKind.FlatFieldNode: {
1183 FlatFieldNode ffn = (FlatFieldNode) fn;
1184 TempDescriptor src = ffn.getSrc();
1185 FieldDescriptor field = ffn.getField();
1187 LabelNode srcLN = og.td2ln.get(src);
1188 if (srcLN != null) {
1189 HashSet<TempDescriptor> affectedTDSet = getAccessedTaintNodeSet(srcLN);
1190 Iterator<TempDescriptor> affectedIter = affectedTDSet
1192 while (affectedIter.hasNext()) {
1193 TempDescriptor affectedTD = affectedIter.next();
1195 if (currentSESE.getInVarSet().contains(affectedTD)) {
1197 HashSet<HeapRegionNode> hrnSet = getReferenceHeapIDSet(
1199 Iterator<HeapRegionNode> hrnIter = hrnSet.iterator();
1200 while (hrnIter.hasNext()) {
1201 HeapRegionNode hrn = hrnIter.next();
1203 Iterator<ReferenceEdge> referencers = hrn
1204 .iteratorToReferencers();
1205 while (referencers.hasNext()) {
1206 ReferenceEdge referenceEdge = (ReferenceEdge) referencers
1208 if (field.getSymbol().equals(
1209 referenceEdge.getField())) {
1210 currentSESE.readEffects(affectedTD, field
1211 .getSymbol(), src.getType(),
1212 referenceEdge.getDst().getID());
1220 // handle tainted case
1222 Iterator<ReferenceEdge> edgeIter = srcLN
1223 .iteratorToReferencees();
1224 while (edgeIter.hasNext()) {
1225 ReferenceEdge edge = edgeIter.next();
1226 HeapRegionNode accessHRN = edge.getDst();
1227 // / follow the chain of reference to identify possible
1229 Iterator<ReferenceEdge> referIter = accessHRN
1230 .iteratorToReferencers();
1231 while (referIter.hasNext()) {
1232 ReferenceEdge referEdge = (ReferenceEdge) referIter
1235 // if (referEdge.getTaintIdentifier() >0 ||
1236 // referEdge.getSESETaintIdentifier()>0 ) {
1237 HashSet<TempDescriptor> referSet = new HashSet<TempDescriptor>();
1238 followReference(accessHRN, referSet,
1239 new HashSet<HeapRegionNode>(), currentSESE);
1241 Iterator<TempDescriptor> referSetIter = referSet
1243 while (referSetIter.hasNext()) {
1244 TempDescriptor tempDescriptor = (TempDescriptor) referSetIter
1246 currentSESE.readEffects(tempDescriptor, field
1247 .getSymbol(), src.getType(), accessHRN
1253 if (edge.getTaintIdentifier() > 0
1254 || edge.getSESETaintIdentifier() > 0) {
1256 affectedTDSet = getReferenceNodeSet(accessHRN);
1257 affectedIter = affectedTDSet.iterator();
1258 while (affectedIter.hasNext()) {
1259 TempDescriptor affectedTD = affectedIter.next();
1261 if (currentSESE.getInVarSet().contains(affectedTD)) {
1263 HashSet<HeapRegionNode> hrnSet = getReferenceHeapIDSet(
1265 Iterator<HeapRegionNode> hrnIter = hrnSet
1267 while (hrnIter.hasNext()) {
1268 HeapRegionNode hrn = hrnIter.next();
1269 currentSESE.readEffects(affectedTD, field
1270 .getSymbol(), src.getType(), hrn
1284 case FKind.FlatSetFieldNode: {
1286 FlatSetFieldNode fsen = (FlatSetFieldNode) fn;
1287 TempDescriptor dst = fsen.getDst();
1288 FieldDescriptor field = fsen.getField();
1290 LabelNode dstLN = og.td2ln.get(dst);
1291 if (dstLN != null) {
1292 // check possible strong updates
1293 boolean strongUpdate = false;
1295 if (!field.getType().isImmutable() || field.getType().isArray()) {
1296 Iterator<ReferenceEdge> itrXhrn = dstLN
1297 .iteratorToReferencees();
1298 while (itrXhrn.hasNext()) {
1299 ReferenceEdge edgeX = itrXhrn.next();
1300 HeapRegionNode hrnX = edgeX.getDst();
1302 // we can do a strong update here if one of two cases
1305 && field != OwnershipAnalysis
1306 .getArrayField(field.getType())
1307 && ((hrnX.getNumReferencers() == 1) || // case 1
1308 (hrnX.isSingleObject() && dstLN
1309 .getNumReferencees() == 1) // case 2
1311 strongUpdate = true;
1316 HashSet<TempDescriptor> affectedTDSet = getAccessedTaintNodeSet(dstLN);
1318 Iterator<TempDescriptor> affectedIter = affectedTDSet
1321 while (affectedIter.hasNext()) {
1322 TempDescriptor affectedTD = affectedIter.next();
1323 if (currentSESE.getInVarSet().contains(affectedTD)) {
1325 HashSet<HeapRegionNode> hrnSet = getReferenceHeapIDSet(
1327 Iterator<HeapRegionNode> hrnIter = hrnSet.iterator();
1328 while (hrnIter.hasNext()) {
1329 HeapRegionNode hrn = hrnIter.next();
1331 Iterator<ReferenceEdge> referencers = hrn
1332 .iteratorToReferencers();
1333 while (referencers.hasNext()) {
1334 ReferenceEdge referenceEdge = (ReferenceEdge) referencers
1336 if (field.getSymbol().equals(
1337 referenceEdge.getField())) {
1338 currentSESE.writeEffects(affectedTD, field
1339 .getSymbol(), dst.getType(),
1340 referenceEdge.getDst().getID(),
1349 // handle tainted case
1350 Iterator<ReferenceEdge> edgeIter = dstLN
1351 .iteratorToReferencees();
1352 while (edgeIter.hasNext()) {
1353 ReferenceEdge edge = edgeIter.next();
1355 HeapRegionNode accessHRN = edge.getDst();
1356 // / follow the chain of reference to identify possible
1358 Iterator<ReferenceEdge> referIter = accessHRN
1359 .iteratorToReferencers();
1360 while (referIter.hasNext()) {
1361 ReferenceEdge referEdge = (ReferenceEdge) referIter
1364 // if (referEdge.getTaintIdentifier() > 0 ||
1365 // referEdge.getSESETaintIdentifier() > 0 ) {
1366 HashSet<TempDescriptor> referSet = new HashSet<TempDescriptor>();
1367 followReference(accessHRN, referSet,
1368 new HashSet<HeapRegionNode>(), currentSESE);
1369 Iterator<TempDescriptor> referSetIter = referSet
1371 while (referSetIter.hasNext()) {
1372 TempDescriptor tempDescriptor = (TempDescriptor) referSetIter
1374 currentSESE.writeEffects(tempDescriptor, field
1375 .getSymbol(), dst.getType(), accessHRN
1376 .getID(), strongUpdate);
1381 if (edge.getTaintIdentifier() > 0
1382 || edge.getSESETaintIdentifier() > 0) {
1383 affectedTDSet = getReferenceNodeSet(accessHRN);
1384 affectedIter = affectedTDSet.iterator();
1385 while (affectedIter.hasNext()) {
1386 TempDescriptor affectedTD = affectedIter.next();
1387 if (currentSESE.getInVarSet().contains(affectedTD)) {
1389 HashSet<HeapRegionNode> hrnSet = getReferenceHeapIDSet(
1391 Iterator<HeapRegionNode> hrnIter = hrnSet
1393 while (hrnIter.hasNext()) {
1394 HeapRegionNode hrn = hrnIter.next();
1395 currentSESE.writeEffects(affectedTD, field
1396 .getSymbol(), dst.getType(), hrn
1397 .getID(), strongUpdate);
1412 case FKind.FlatCall: {
1413 FlatCall fc = (FlatCall) fn;
1415 MethodContext calleeMC = ownAnalysis.getCalleeMethodContext(mc, fc);
1417 MethodEffects me = ownAnalysis.getMethodEffectsAnalysis()
1418 .getMethodEffectsByMethodContext(calleeMC);
1420 OwnershipGraph calleeOG = ownAnalysis
1421 .getOwnvershipGraphByMethodContext(calleeMC);
1423 FlatMethod fm = state.getMethodFlat(fc.getMethod());
1424 ParameterDecomposition decomp = new ParameterDecomposition(
1425 ownAnalysis, fc, fm, calleeMC, calleeOG, og);
1428 if (((MethodDescriptor) calleeMC.getDescriptor()).isStatic()) {
1434 for (int i = 0; i < fc.numArgs(); i++) {
1436 TempDescriptor arg = fc.getArg(i);
1437 Set<EffectsKey> readSet = me.getEffects().getReadingSet(
1439 Set<EffectsKey> writeSet = me.getEffects().getWritingSet(
1442 Set<EffectsKey> strongUpdateSet = me.getEffects()
1443 .getStrongUpdateSet(i + base);
1445 LabelNode argLN = og.td2ln.get(arg);
1446 if (argLN != null) {
1447 HashSet<TempDescriptor> affectedTDSet = getAccessedTaintNodeSet(argLN);
1448 Iterator<TempDescriptor> affectedIter = affectedTDSet
1451 while (affectedIter.hasNext()) {
1453 TempDescriptor affectedTD = affectedIter.next();
1454 if (currentSESE.getInVarSet().contains(affectedTD)) {
1456 if (readSet != null) {
1457 Iterator<EffectsKey> readIter = readSet
1459 while (readIter.hasNext()) {
1460 EffectsKey key = readIter.next();
1461 Set<Integer> hrnSet = getCallerHRNId(
1462 new Integer(i + base), calleeOG,
1463 key.getHRNId(), decomp);
1464 Iterator<Integer> hrnIter = hrnSet
1466 while (hrnIter.hasNext()) {
1467 Integer hrnID = (Integer) hrnIter
1469 currentSESE.readEffects(affectedTD, key
1470 .getFieldDescriptor(), key
1471 .getTypeDescriptor(), hrnID);
1476 if (writeSet != null) {
1477 Iterator<EffectsKey> writeIter = writeSet
1479 while (writeIter.hasNext()) {
1480 EffectsKey key = writeIter.next();
1482 Set<Integer> hrnSet = getCallerHRNId(
1483 new Integer(i + base), calleeOG,
1484 key.getHRNId(), decomp);
1485 Iterator<Integer> hrnIter = hrnSet
1487 while (hrnIter.hasNext()) {
1488 Integer hrnID = (Integer) hrnIter
1490 currentSESE.writeEffects(affectedTD,
1491 key.getFieldDescriptor(), key
1492 .getTypeDescriptor(),
1499 if (strongUpdateSet != null) {
1500 Iterator<EffectsKey> strongUpdateIter = strongUpdateSet
1502 while (strongUpdateIter.hasNext()) {
1503 EffectsKey key = strongUpdateIter.next();
1505 Set<Integer> hrnSet = getCallerHRNId(
1506 new Integer(i + base), calleeOG,
1507 key.getHRNId(), decomp);
1508 Iterator<Integer> hrnIter = hrnSet
1510 while (hrnIter.hasNext()) {
1511 Integer hrnID = (Integer) hrnIter
1513 currentSESE.writeEffects(affectedTD,
1514 key.getFieldDescriptor(), key
1515 .getTypeDescriptor(),
1536 private void addLiveInAllocationSite(MethodContext mc, AllocationSite ac){
1537 HashSet<AllocationSite> set=mapMethodContextToLiveInAllocationSiteSet.get(mc);
1539 set=new HashSet<AllocationSite>();
1542 mapMethodContextToLiveInAllocationSiteSet.put(mc, set);
1545 private void followReference(HeapRegionNode hrn,HashSet<TempDescriptor> tdSet, HashSet<HeapRegionNode> visited, FlatSESEEnterNode currentSESE){
1547 Iterator<ReferenceEdge> referIter=hrn.iteratorToReferencers();
1548 // check whether hrn is referenced by TD
1549 while (referIter.hasNext()) {
1550 ReferenceEdge referEdge = (ReferenceEdge) referIter.next();
1551 if(referEdge.getSrc() instanceof LabelNode){
1552 LabelNode ln=(LabelNode)referEdge.getSrc();
1553 if(currentSESE.getInVarSet().contains(ln.getTempDescriptor())){
1554 tdSet.add(ln.getTempDescriptor());
1556 }else if(referEdge.getSrc() instanceof HeapRegionNode){
1557 HeapRegionNode nextHRN=(HeapRegionNode)referEdge.getSrc();
1558 if(!visited.contains(nextHRN)){
1559 visited.add(nextHRN);
1560 followReference(nextHRN,tdSet,visited,currentSESE);
1568 private Set<Integer> getCallerHRNId(Integer paramIdx,
1569 OwnershipGraph calleeOG, Integer calleeHRNId,
1570 ParameterDecomposition paramDecom) {
1572 Integer hrnPrimaryID = calleeOG.paramIndex2idPrimary.get(paramIdx);
1573 Integer hrnSecondaryID = calleeOG.paramIndex2idSecondary.get(paramIdx);
1575 if (calleeHRNId.equals(hrnPrimaryID)) {
1576 // it references to primary param heap region
1577 return paramDecom.getParamObject_hrnIDs(paramIdx);
1578 } else if (calleeHRNId.equals(hrnSecondaryID)) {
1579 // it references to secondary param heap region
1580 return paramDecom.getParamReachable_hrnIDs(paramIdx);
1583 return new HashSet<Integer>();
1586 private void taintLabelNode(LabelNode ln, int identifier) {
1588 Iterator<ReferenceEdge> edgeIter = ln.iteratorToReferencees();
1589 while (edgeIter.hasNext()) {
1590 ReferenceEdge edge = edgeIter.next();
1591 HeapRegionNode hrn = edge.getDst();
1593 Iterator<ReferenceEdge> edgeReferencerIter = hrn
1594 .iteratorToReferencers();
1595 while (edgeReferencerIter.hasNext()) {
1596 ReferenceEdge referencerEdge = edgeReferencerIter.next();
1597 OwnershipNode node = referencerEdge.getSrc();
1598 if (node instanceof LabelNode) {
1599 referencerEdge.unionSESETaintIdentifier(identifier);
1600 }else if(node instanceof HeapRegionNode){
1601 referencerEdge.unionSESETaintIdentifier(identifier);
1609 private HashSet<TempDescriptor> getReferenceNodeSet(HeapRegionNode hrn){
1611 HashSet<TempDescriptor> returnSet=new HashSet<TempDescriptor>();
1613 Iterator<ReferenceEdge> edgeIter=hrn.iteratorToReferencers();
1614 while(edgeIter.hasNext()){
1615 ReferenceEdge edge=edgeIter.next();
1616 if(edge.getSrc() instanceof LabelNode){
1617 LabelNode ln=(LabelNode)edge.getSrc();
1618 returnSet.add(ln.getTempDescriptor());
1627 private HashSet<HeapRegionNode> getReferenceHeapIDSet(OwnershipGraph og, TempDescriptor td){
1629 HashSet<HeapRegionNode> returnSet=new HashSet<HeapRegionNode>();
1631 LabelNode ln=og.td2ln.get(td);
1632 Iterator<ReferenceEdge> edgeIter=ln.iteratorToReferencees();
1633 while(edgeIter.hasNext()){
1634 ReferenceEdge edge=edgeIter.next();
1635 HeapRegionNode hrn=edge.getDst();
1642 private HashSet<TempDescriptor> getAccessedTaintNodeSet(LabelNode ln) {
1644 HashSet<TempDescriptor> returnSet = new HashSet<TempDescriptor>();
1646 Iterator<ReferenceEdge> edgeIter = ln.iteratorToReferencees();
1647 while (edgeIter.hasNext()) {
1648 ReferenceEdge edge = edgeIter.next();
1649 HeapRegionNode hrn = edge.getDst();
1651 Iterator<ReferenceEdge> edgeReferencerIter = hrn
1652 .iteratorToReferencers();
1653 while (edgeReferencerIter.hasNext()) {
1654 ReferenceEdge referencerEdge = edgeReferencerIter.next();
1656 if (referencerEdge.getSrc() instanceof LabelNode) {
1657 if (!((LabelNode) referencerEdge.getSrc()).equals(ln)) {
1659 if (referencerEdge.getSESETaintIdentifier() > 0) {
1660 TempDescriptor td = ((LabelNode) referencerEdge
1661 .getSrc()).getTempDescriptor();
1675 private void codePlansForward( FlatMethod fm ) {
1677 // start from flat method top, visit every node in
1678 // method exactly once
1679 Set<FlatNode> flatNodesToVisit = new HashSet<FlatNode>();
1680 flatNodesToVisit.add( fm );
1682 Set<FlatNode> visited = new HashSet<FlatNode>();
1684 while( !flatNodesToVisit.isEmpty() ) {
1685 Iterator<FlatNode> fnItr = flatNodesToVisit.iterator();
1686 FlatNode fn = fnItr.next();
1688 flatNodesToVisit.remove( fn );
1691 Stack<FlatSESEEnterNode> seseStack = seseStacks.get( fn );
1692 assert seseStack != null;
1694 // use incoming results as "dot statement" or just
1695 // before the current statement
1696 VarSrcTokTable dotSTtable = new VarSrcTokTable();
1697 for( int i = 0; i < fn.numPrev(); i++ ) {
1698 FlatNode nn = fn.getPrev( i );
1699 dotSTtable.merge( variableResults.get( nn ) );
1702 // find dt-st notAvailableSet also
1703 Set<TempDescriptor> dotSTnotAvailSet = new HashSet<TempDescriptor>();
1704 for( int i = 0; i < fn.numPrev(); i++ ) {
1705 FlatNode nn = fn.getPrev( i );
1706 Set<TempDescriptor> notAvailIn = notAvailableResults.get( nn );
1707 if( notAvailIn != null ) {
1708 dotSTnotAvailSet.addAll( notAvailIn );
1712 Set<TempDescriptor> dotSTlive = livenessRootView.get( fn );
1714 if( !seseStack.empty() ) {
1715 codePlans_nodeActions( fn,
1723 for( int i = 0; i < fn.numNext(); i++ ) {
1724 FlatNode nn = fn.getNext( i );
1726 if( !visited.contains( nn ) ) {
1727 flatNodesToVisit.add( nn );
1733 private void codePlans_nodeActions( FlatNode fn,
1734 Set<TempDescriptor> liveSetIn,
1735 VarSrcTokTable vstTableIn,
1736 Set<TempDescriptor> notAvailSetIn,
1737 FlatSESEEnterNode currentSESE ) {
1739 CodePlan plan = new CodePlan( currentSESE);
1741 switch( fn.kind() ) {
1743 case FKind.FlatSESEEnterNode: {
1744 FlatSESEEnterNode fsen = (FlatSESEEnterNode) fn;
1746 // track the source types of the in-var set so generated
1747 // code at this SESE issue can compute the number of
1748 // dependencies properly
1749 Iterator<TempDescriptor> inVarItr = fsen.getInVarSet().iterator();
1750 while( inVarItr.hasNext() ) {
1751 TempDescriptor inVar = inVarItr.next();
1753 vstTableIn.getRefVarSrcType( inVar,
1757 // the current SESE needs a local space to track the dynamic
1758 // variable and the child needs space in its SESE record
1759 if( srcType.equals( VarSrcTokTable.SrcType_DYNAMIC ) ) {
1760 fsen.addDynamicInVar( inVar );
1761 fsen.getParent().addDynamicVar( inVar );
1763 } else if( srcType.equals( VarSrcTokTable.SrcType_STATIC ) ) {
1764 fsen.addStaticInVar( inVar );
1765 VariableSourceToken vst = vstTableIn.get( inVar ).iterator().next();
1766 fsen.putStaticInVar2src( inVar, vst );
1767 fsen.addStaticInVarSrc( new SESEandAgePair( vst.getSESE(),
1773 assert srcType.equals( VarSrcTokTable.SrcType_READY );
1774 fsen.addReadyInVar( inVar );
1780 case FKind.FlatSESEExitNode: {
1781 FlatSESEExitNode fsexn = (FlatSESEExitNode) fn;
1784 case FKind.FlatOpNode: {
1785 FlatOpNode fon = (FlatOpNode) fn;
1787 if( fon.getOp().getOp() == Operation.ASSIGN ) {
1788 TempDescriptor lhs = fon.getDest();
1789 TempDescriptor rhs = fon.getLeft();
1791 // if this is an op node, don't stall, copy
1792 // source and delay until we need to use value
1794 // ask whether lhs and rhs sources are dynamic, static, etc.
1796 = vstTableIn.getRefVarSrcType( lhs,
1798 currentSESE.getParent() );
1801 = vstTableIn.getRefVarSrcType( rhs,
1803 currentSESE.getParent() );
1805 if( rhsSrcType.equals( VarSrcTokTable.SrcType_DYNAMIC ) ) {
1806 // if rhs is dynamic going in, lhs will definitely be dynamic
1807 // going out of this node, so track that here
1808 plan.addDynAssign( lhs, rhs );
1809 currentSESE.addDynamicVar( lhs );
1810 currentSESE.addDynamicVar( rhs );
1812 } else if( lhsSrcType.equals( VarSrcTokTable.SrcType_DYNAMIC ) ) {
1813 // otherwise, if the lhs is dynamic, but the rhs is not, we
1814 // need to update the variable's dynamic source as "current SESE"
1815 plan.addDynAssign( lhs );
1818 // only break if this is an ASSIGN op node,
1819 // otherwise fall through to default case
1824 // note that FlatOpNode's that aren't ASSIGN
1825 // fall through to this default case
1828 // a node with no live set has nothing to stall for
1829 if( liveSetIn == null ) {
1833 TempDescriptor[] readarray = fn.readsTemps();
1834 for( int i = 0; i < readarray.length; i++ ) {
1835 TempDescriptor readtmp = readarray[i];
1837 // ignore temps that are definitely available
1838 // when considering to stall on it
1839 if( !notAvailSetIn.contains( readtmp ) ) {
1843 // check the source type of this variable
1845 = vstTableIn.getRefVarSrcType( readtmp,
1847 currentSESE.getParent() );
1849 if( srcType.equals( VarSrcTokTable.SrcType_DYNAMIC ) ) {
1850 // 1) It is not clear statically where this variable will
1851 // come from statically, so dynamically we must keep track
1852 // along various control paths, and therefore when we stall,
1853 // just stall for the exact thing we need and move on
1854 plan.addDynamicStall( readtmp );
1855 currentSESE.addDynamicVar( readtmp );
1857 } else if( srcType.equals( VarSrcTokTable.SrcType_STATIC ) ) {
1858 // 2) Single token/age pair: Stall for token/age pair, and copy
1859 // all live variables with same token/age pair at the same
1860 // time. This is the same stuff that the notavaialable analysis
1861 // marks as now available.
1863 VariableSourceToken vst = vstTableIn.get( readtmp ).iterator().next();
1865 Iterator<VariableSourceToken> availItr =
1866 vstTableIn.get( vst.getSESE(), vst.getAge() ).iterator();
1868 while( availItr.hasNext() ) {
1869 VariableSourceToken vstAlsoAvail = availItr.next();
1871 // only grab additional stuff that is live
1872 Set<TempDescriptor> copySet = new HashSet<TempDescriptor>();
1874 Iterator<TempDescriptor> refVarItr = vstAlsoAvail.getRefVars().iterator();
1875 while( refVarItr.hasNext() ) {
1876 TempDescriptor refVar = refVarItr.next();
1877 if( liveSetIn.contains( refVar ) ) {
1878 copySet.add( refVar );
1882 if( !copySet.isEmpty() ) {
1883 plan.addStall2CopySet( vstAlsoAvail, copySet );
1888 // the other case for srcs is READY, so do nothing
1891 // assert that everything being stalled for is in the
1892 // "not available" set coming into this flat node and
1893 // that every VST identified is in the possible "stall set"
1894 // that represents VST's from children SESE's
1902 // identify sese-age pairs that are statically useful
1903 // and should have an associated SESE variable in code
1904 // JUST GET ALL SESE/AGE NAMES FOR NOW, PRUNE LATER,
1905 // AND ALWAYS GIVE NAMES TO PARENTS
1906 Set<VariableSourceToken> staticSet = vstTableIn.get();
1907 Iterator<VariableSourceToken> vstItr = staticSet.iterator();
1908 while( vstItr.hasNext() ) {
1909 VariableSourceToken vst = vstItr.next();
1911 // placeholder source tokens are useful results, but
1912 // the placeholder static name is never needed
1913 if( vst.getSESE().getIsCallerSESEplaceholder() ) {
1917 FlatSESEEnterNode sese = currentSESE;
1918 while( sese != null ) {
1919 sese.addNeededStaticName(
1920 new SESEandAgePair( vst.getSESE(), vst.getAge() )
1922 sese.mustTrackAtLeastAge( vst.getAge() );
1924 sese = sese.getParent();
1929 codePlans.put( fn, plan );
1932 // if any variables at this-node-*dot* have a static source (exactly one vst)
1933 // but go to a dynamic source at next-node-*dot*, create a new IR graph
1934 // node on that edge to track the sources dynamically
1935 VarSrcTokTable thisVstTable = variableResults.get( fn );
1936 for( int i = 0; i < fn.numNext(); i++ ) {
1937 FlatNode nn = fn.getNext( i );
1938 VarSrcTokTable nextVstTable = variableResults.get( nn );
1939 Set<TempDescriptor> nextLiveIn = livenessRootView.get( nn );
1941 // the table can be null if it is one of the few IR nodes
1942 // completely outside of the root SESE scope
1943 if( nextVstTable != null && nextLiveIn != null ) {
1945 Hashtable<TempDescriptor, VariableSourceToken> static2dynamicSet =
1946 thisVstTable.getStatic2DynamicSet( nextVstTable,
1949 currentSESE.getParent()
1952 if( !static2dynamicSet.isEmpty() ) {
1954 // either add these results to partial fixed-point result
1955 // or make a new one if we haven't made any here yet
1956 FlatEdge fe = new FlatEdge( fn, nn );
1957 FlatWriteDynamicVarNode fwdvn = wdvNodesToSpliceIn.get( fe );
1959 if( fwdvn == null ) {
1960 fwdvn = new FlatWriteDynamicVarNode( fn,
1965 wdvNodesToSpliceIn.put( fe, fwdvn );
1967 fwdvn.addMoreVar2Src( static2dynamicSet );
1975 public void writeReports( String timeReport ) throws java.io.IOException {
1977 BufferedWriter bw = new BufferedWriter( new FileWriter( "mlpReport_summary.txt" ) );
1978 bw.write( "MLP Analysis Results\n\n" );
1979 bw.write( timeReport+"\n\n" );
1980 printSESEHierarchy( bw );
1982 printSESEInfo( bw );
1985 Iterator<Descriptor> methItr = ownAnalysis.descriptorsToAnalyze.iterator();
1986 while( methItr.hasNext() ) {
1987 MethodDescriptor md = (MethodDescriptor) methItr.next();
1988 FlatMethod fm = state.getMethodFlat( md );
1989 bw = new BufferedWriter( new FileWriter( "mlpReport_"+
1990 md.getClassMethodName()+
1991 md.getSafeMethodDescriptor()+
1993 bw.write( "MLP Results for "+md+"\n-------------------\n");
1994 bw.write( "\n\nLive-In, Root View\n------------------\n" +fm.printMethod( livenessRootView ) );
1995 bw.write( "\n\nVariable Results-Out\n----------------\n" +fm.printMethod( variableResults ) );
1996 bw.write( "\n\nNot Available Results-Out\n---------------------\n"+fm.printMethod( notAvailableResults ) );
1997 bw.write( "\n\nCode Plans\n----------\n" +fm.printMethod( codePlans ) );
1998 bw.write("\n\nSESE Effects\n----------------------\n"+printSESEEffects());
2003 private String printSESEEffects() {
2005 StringWriter writer = new StringWriter();
2007 Iterator<FlatSESEEnterNode> keyIter = allSESEs.iterator();
2009 while (keyIter.hasNext()) {
2010 FlatSESEEnterNode seseEnter = keyIter.next();
2011 String result = seseEnter.getSeseEffectsSet().printSet();
2012 if (result.length() > 0) {
2013 writer.write("\nSESE " + seseEnter + "\n");
2014 writer.write(result);
2017 keyIter = rootSESEs.iterator();
2018 while (keyIter.hasNext()) {
2019 FlatSESEEnterNode seseEnter = keyIter.next();
2020 if (seseEnter.getIsCallerSESEplaceholder()) {
2021 if (!seseEnter.getChildren().isEmpty()) {
2022 String result = seseEnter.getSeseEffectsSet().printSet();
2023 if (result.length() > 0) {
2024 writer.write("\nSESE " + seseEnter + "\n");
2025 writer.write(result);
2031 return writer.toString();
2035 private void printSESEHierarchy( BufferedWriter bw ) throws java.io.IOException {
2036 bw.write( "SESE Hierarchy\n--------------\n" );
2037 Iterator<FlatSESEEnterNode> rootItr = rootSESEs.iterator();
2038 while( rootItr.hasNext() ) {
2039 FlatSESEEnterNode root = rootItr.next();
2040 if( root.getIsCallerSESEplaceholder() ) {
2041 if( !root.getChildren().isEmpty() ) {
2042 printSESEHierarchyTree( bw, root, 0 );
2045 printSESEHierarchyTree( bw, root, 0 );
2050 private void printSESEHierarchyTree( BufferedWriter bw,
2051 FlatSESEEnterNode fsen,
2053 ) throws java.io.IOException {
2054 for( int i = 0; i < depth; ++i ) {
2057 bw.write( "- "+fsen.getPrettyIdentifier()+"\n" );
2059 Iterator<FlatSESEEnterNode> childItr = fsen.getChildren().iterator();
2060 while( childItr.hasNext() ) {
2061 FlatSESEEnterNode fsenChild = childItr.next();
2062 printSESEHierarchyTree( bw, fsenChild, depth + 1 );
2067 private void printSESEInfo( BufferedWriter bw ) throws java.io.IOException {
2068 bw.write("\nSESE info\n-------------\n" );
2069 Iterator<FlatSESEEnterNode> rootItr = rootSESEs.iterator();
2070 while( rootItr.hasNext() ) {
2071 FlatSESEEnterNode root = rootItr.next();
2072 if( root.getIsCallerSESEplaceholder() ) {
2073 if( !root.getChildren().isEmpty() ) {
2074 printSESEInfoTree( bw, root );
2077 printSESEInfoTree( bw, root );
2082 private void printSESEInfoTree( BufferedWriter bw,
2083 FlatSESEEnterNode fsen
2084 ) throws java.io.IOException {
2086 if( !fsen.getIsCallerSESEplaceholder() ) {
2087 bw.write( "SESE "+fsen.getPrettyIdentifier()+" {\n" );
2089 bw.write( " in-set: "+fsen.getInVarSet()+"\n" );
2090 Iterator<TempDescriptor> tItr = fsen.getInVarSet().iterator();
2091 while( tItr.hasNext() ) {
2092 TempDescriptor inVar = tItr.next();
2093 if( fsen.getReadyInVarSet().contains( inVar ) ) {
2094 bw.write( " (ready) "+inVar+"\n" );
2096 if( fsen.getStaticInVarSet().contains( inVar ) ) {
2097 bw.write( " (static) "+inVar+"\n" );
2099 if( fsen.getDynamicInVarSet().contains( inVar ) ) {
2100 bw.write( " (dynamic)"+inVar+"\n" );
2104 bw.write( " out-set: "+fsen.getOutVarSet()+"\n" );
2108 Iterator<FlatSESEEnterNode> childItr = fsen.getChildren().iterator();
2109 while( childItr.hasNext() ) {
2110 FlatSESEEnterNode fsenChild = childItr.next();
2111 printSESEInfoTree( bw, fsenChild );