[TI removal] Switch some newly added code over to use `Instruction`
directly.
llvm-svn: 344768
diff --git a/llvm/lib/Analysis/DivergenceAnalysis.cpp b/llvm/lib/Analysis/DivergenceAnalysis.cpp
index 9453f68..de47445 100644
--- a/llvm/lib/Analysis/DivergenceAnalysis.cpp
+++ b/llvm/lib/Analysis/DivergenceAnalysis.cpp
@@ -108,7 +108,7 @@
UniformOverrides.insert(&UniVal);
}
-bool DivergenceAnalysis::updateTerminator(const TerminatorInst &Term) const {
+bool DivergenceAnalysis::updateTerminator(const Instruction &Term) const {
if (Term.getNumSuccessors() <= 1)
return false;
if (auto *BranchTerm = dyn_cast<BranchInst>(&Term)) {
@@ -297,7 +297,7 @@
return false;
}
-void DivergenceAnalysis::propagateBranchDivergence(const TerminatorInst &Term) {
+void DivergenceAnalysis::propagateBranchDivergence(const Instruction &Term) {
LLVM_DEBUG(dbgs() << "propBranchDiv " << Term.getParent()->getName() << "\n");
markDivergent(Term);
@@ -380,11 +380,10 @@
continue;
// propagate divergence caused by terminator
- if (isa<TerminatorInst>(I)) {
- auto &Term = cast<TerminatorInst>(I);
- if (updateTerminator(Term)) {
+ if (I.isTerminator()) {
+ if (updateTerminator(I)) {
// propagate control divergence to affected instructions
- propagateBranchDivergence(Term);
+ propagateBranchDivergence(I);
continue;
}
}
diff --git a/llvm/lib/Analysis/SyncDependenceAnalysis.cpp b/llvm/lib/Analysis/SyncDependenceAnalysis.cpp
index 9c40ffe..e1a7e44 100644
--- a/llvm/lib/Analysis/SyncDependenceAnalysis.cpp
+++ b/llvm/lib/Analysis/SyncDependenceAnalysis.cpp
@@ -208,7 +208,7 @@
}
// find all blocks reachable by two disjoint paths from @rootTerm.
- // This method works for both divergent TerminatorInsts and loops with
+ // This method works for both divergent terminators and loops with
// divergent exits.
// @rootBlock is either the block containing the branch or the header of the
// divergent loop.
@@ -355,7 +355,7 @@
}
const ConstBlockSet &
-SyncDependenceAnalysis::join_blocks(const TerminatorInst &Term) {
+SyncDependenceAnalysis::join_blocks(const Instruction &Term) {
// trivial case
if (Term.getNumSuccessors() < 1) {
return EmptyBlockSet;