Index: llvm/trunk/lib/Transforms/Scalar/PlaceSafepoints.cpp =================================================================== --- llvm/trunk/lib/Transforms/Scalar/PlaceSafepoints.cpp +++ llvm/trunk/lib/Transforms/Scalar/PlaceSafepoints.cpp @@ -130,6 +130,7 @@ bool runOnLoop(Loop *, LPPassManager &LPM) override; void getAnalysisUsage(AnalysisUsage &AU) const override { + AU.addRequired(); AU.addRequired(); // We no longer modify the IR at all in this pass. Thus all // analysis are preserved. @@ -312,6 +313,7 @@ bool PlaceBackedgeSafepointsImpl::runOnLoop(Loop *L, LPPassManager &LPM) { ScalarEvolution *SE = &getAnalysis(); + DominatorTree *DT = &getAnalysis().getDomTree(); // Loop through all loop latches (branches controlling backedges). We need // to place a safepoint on every backedge (potentially). @@ -320,11 +322,6 @@ // w.r.t. loops with multiple backedges. BasicBlock *header = L->getHeader(); - // TODO: Use the analysis pass infrastructure for this. There is no reason - // to recalculate this here. - DominatorTree DT; - DT.recalculate(*header->getParent()); - SmallVector LoopLatches; L->getLoopLatches(LoopLatches); for (BasicBlock *pred : LoopLatches) { @@ -341,7 +338,7 @@ continue; } if (CallSafepointsEnabled && - containsUnconditionalCallSafepoint(L, header, pred, DT)) { + containsUnconditionalCallSafepoint(L, header, pred, *DT)) { // Note: This is only semantically legal since we won't do any further // IPO or inlining before the actual call insertion.. If we hadn't, we // might latter loose this call safepoint. @@ -746,6 +743,7 @@ "place-backedge-safepoints-impl", "Place Backedge Safepoints", false, false) INITIALIZE_PASS_DEPENDENCY(ScalarEvolution) +INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass) INITIALIZE_PASS_END(PlaceBackedgeSafepointsImpl, "place-backedge-safepoints-impl", "Place Backedge Safepoints", false, false)