aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Transforms/Utils/LoopUnroll.cpp
diff options
context:
space:
mode:
authorPhilip Reames <listmail@philipreames.com>2021-05-14 10:41:25 -0700
committerPhilip Reames <listmail@philipreames.com>2021-05-14 10:42:36 -0700
commit653fa0b46ae34c06495b542414b704b30381cd02 (patch)
treeafd75d8849a2cffb6509533147447410b90184b8 /llvm/lib/Transforms/Utils/LoopUnroll.cpp
parentc17ac8432e62efcbbcaa5519739b403275c553ff (diff)
downloadllvm-653fa0b46ae34c06495b542414b704b30381cd02.zip
llvm-653fa0b46ae34c06495b542414b704b30381cd02.tar.gz
llvm-653fa0b46ae34c06495b542414b704b30381cd02.tar.bz2
Do actual DCE in LoopUnroll (try 2)
Recommitting after addressing a missed review comment, and updating an aarch64 test I'd missed. LoopUnroll does a limited DCE pass after unrolling, but if you have a chain of dead instructions, it only deletes the last one. Improve the code to recursively delete all trivially dead instructions. Differential Revision: https://reviews.llvm.org/D102511
Diffstat (limited to 'llvm/lib/Transforms/Utils/LoopUnroll.cpp')
-rw-r--r--llvm/lib/Transforms/Utils/LoopUnroll.cpp18
1 files changed, 4 insertions, 14 deletions
diff --git a/llvm/lib/Transforms/Utils/LoopUnroll.cpp b/llvm/lib/Transforms/Utils/LoopUnroll.cpp
index 893b918..1837fb6 100644
--- a/llvm/lib/Transforms/Utils/LoopUnroll.cpp
+++ b/llvm/lib/Transforms/Utils/LoopUnroll.cpp
@@ -213,16 +213,11 @@ void llvm::simplifyLoopAfterUnroll(Loop *L, bool SimplifyIVs, LoopInfo *LI,
// Aggressively clean up dead instructions that simplifyLoopIVs already
// identified. Any remaining should be cleaned up below.
- while (!DeadInsts.empty()) {
- Value *V = DeadInsts.pop_back_val();
- if (Instruction *Inst = dyn_cast_or_null<Instruction>(V))
- RecursivelyDeleteTriviallyDeadInstructions(Inst);
- }
+ RecursivelyDeleteTriviallyDeadInstructions(DeadInsts);
}
- // At this point, the code is well formed. We now do a quick sweep over the
- // inserted code, doing constant propagation and dead code elimination as we
- // go.
+ // At this point, the code is well formed. Perform constprop, instsimplify,
+ // and dce.
const DataLayout &DL = L->getHeader()->getModule()->getDataLayout();
for (BasicBlock *BB : L->getBlocks()) {
for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E;) {
@@ -232,14 +227,9 @@ void llvm::simplifyLoopAfterUnroll(Loop *L, bool SimplifyIVs, LoopInfo *LI,
if (LI->replacementPreservesLCSSAForm(Inst, V))
Inst->replaceAllUsesWith(V);
if (isInstructionTriviallyDead(Inst))
- BB->getInstList().erase(Inst);
+ RecursivelyDeleteTriviallyDeadInstructions(Inst);
}
}
-
- // TODO: after peeling or unrolling, previously loop variant conditions are
- // likely to fold to constants, eagerly propagating those here will require
- // fewer cleanup passes to be run. Alternatively, a LoopEarlyCSE might be
- // appropriate.
}
/// Unroll the given loop by Count. The loop must be in LCSSA form. Unrolling