diff options
| -rw-r--r-- | llvm/include/llvm/Analysis/SparsePropagation.h | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/llvm/include/llvm/Analysis/SparsePropagation.h b/llvm/include/llvm/Analysis/SparsePropagation.h index 04e94f7cd52..02a2e64268b 100644 --- a/llvm/include/llvm/Analysis/SparsePropagation.h +++ b/llvm/include/llvm/Analysis/SparsePropagation.h @@ -189,12 +189,12 @@ private: /// getFeasibleSuccessors - Return a vector of booleans to indicate which /// successors are reachable from a given terminator instruction. - void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs, + void getFeasibleSuccessors(Instruction &TI, SmallVectorImpl<bool> &Succs, bool AggressiveUndef); void visitInst(Instruction &I); void visitPHINode(PHINode &I); - void visitTerminatorInst(TerminatorInst &TI); + void visitTerminator(Instruction &TI); }; //===----------------------------------------------------------------------===// @@ -286,7 +286,7 @@ void SparseSolver<LatticeKey, LatticeVal, KeyInfo>::markEdgeExecutable( template <class LatticeKey, class LatticeVal, class KeyInfo> void SparseSolver<LatticeKey, LatticeVal, KeyInfo>::getFeasibleSuccessors( - TerminatorInst &TI, SmallVectorImpl<bool> &Succs, bool AggressiveUndef) { + Instruction &TI, SmallVectorImpl<bool> &Succs, bool AggressiveUndef) { Succs.resize(TI.getNumSuccessors()); if (TI.getNumSuccessors() == 0) return; @@ -374,7 +374,7 @@ template <class LatticeKey, class LatticeVal, class KeyInfo> bool SparseSolver<LatticeKey, LatticeVal, KeyInfo>::isEdgeFeasible( BasicBlock *From, BasicBlock *To, bool AggressiveUndef) { SmallVector<bool, 16> SuccFeasible; - TerminatorInst *TI = From->getTerminator(); + Instruction *TI = From->getTerminator(); getFeasibleSuccessors(*TI, SuccFeasible, AggressiveUndef); for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) @@ -385,8 +385,8 @@ bool SparseSolver<LatticeKey, LatticeVal, KeyInfo>::isEdgeFeasible( } template <class LatticeKey, class LatticeVal, class KeyInfo> -void SparseSolver<LatticeKey, LatticeVal, KeyInfo>::visitTerminatorInst( - TerminatorInst &TI) { +void SparseSolver<LatticeKey, LatticeVal, KeyInfo>::visitTerminator( + Instruction &TI) { SmallVector<bool, 16> SuccFeasible; getFeasibleSuccessors(TI, SuccFeasible, true); @@ -465,8 +465,8 @@ void SparseSolver<LatticeKey, LatticeVal, KeyInfo>::visitInst(Instruction &I) { if (ChangedValue.second != LatticeFunc->getUntrackedVal()) UpdateState(ChangedValue.first, ChangedValue.second); - if (TerminatorInst *TI = dyn_cast<TerminatorInst>(&I)) - visitTerminatorInst(*TI); + if (I.isTerminator()) + visitTerminator(I); } template <class LatticeKey, class LatticeVal, class KeyInfo> |
