diff options
author | Geoff Berry <gberry@codeaurora.org> | 2016-06-06 19:10:46 +0000 |
---|---|---|
committer | Geoff Berry <gberry@codeaurora.org> | 2016-06-06 19:10:46 +0000 |
commit | 43e5160d0ef1313136a053dc77128be80ea204cb (patch) | |
tree | fa17b3451e64f48e9196605f6a7a28e3e6002420 /llvm/test/Transforms/LoopStrengthReduce/scev-insertpt-bug.ll | |
parent | ba8dbbe86f3d21221783f29b96585e3fa25e9a28 (diff) | |
download | bcm5719-llvm-43e5160d0ef1313136a053dc77128be80ea204cb.tar.gz bcm5719-llvm-43e5160d0ef1313136a053dc77128be80ea204cb.zip |
Reapply [LSR] Create fewer redundant instructions.
Summary:
Fix LSRInstance::HoistInsertPosition() to check the original insert
position block first for a canonical insertion point that is dominated
by all inputs. This leads to SCEV being able to reuse more instructions
since it currently tracks the instructions it creates for reuse by
keeping a table of <Value, insert point> pairs.
Originally reviewed in http://reviews.llvm.org/D18001
Reviewers: atrick
Subscribers: llvm-commits, mzolotukhin, mcrosier
Differential Revision: http://reviews.llvm.org/D18480
llvm-svn: 271929
Diffstat (limited to 'llvm/test/Transforms/LoopStrengthReduce/scev-insertpt-bug.ll')
-rw-r--r-- | llvm/test/Transforms/LoopStrengthReduce/scev-insertpt-bug.ll | 47 |
1 files changed, 47 insertions, 0 deletions
diff --git a/llvm/test/Transforms/LoopStrengthReduce/scev-insertpt-bug.ll b/llvm/test/Transforms/LoopStrengthReduce/scev-insertpt-bug.ll new file mode 100644 index 00000000000..81a6b07fe95 --- /dev/null +++ b/llvm/test/Transforms/LoopStrengthReduce/scev-insertpt-bug.ll @@ -0,0 +1,47 @@ +; RUN: opt < %s -loop-reduce -S + +; Test that SCEV insertpoint's don't get corrupted and cause an +; invalid instruction to be inserted in a block other than its parent. +; See http://reviews.llvm.org/D20703 for context. +define void @test() { +entry: + %bf.load = load i32, i32* null, align 4 + %bf.clear = lshr i32 %bf.load, 1 + %div = and i32 %bf.clear, 134217727 + %sub = add nsw i32 %div, -1 + %0 = zext i32 %sub to i64 + br label %while.cond + +while.cond: ; preds = %cond.end, %entry + %indvars.iv = phi i64 [ %indvars.iv.next, %cond.end ], [ 0, %entry ] + %cmp = icmp eq i64 %indvars.iv, %0 + br i1 %cmp, label %cleanup16, label %while.body + +while.body: ; preds = %while.cond + %1 = trunc i64 %indvars.iv to i32 + %mul = shl i32 %1, 1 + %add = add nuw i32 %mul, 2 + %cmp3 = icmp ult i32 %add, 0 + br i1 %cmp3, label %if.end, label %if.then + +if.then: ; preds = %while.body + unreachable + +if.end: ; preds = %while.body + br i1 false, label %cond.end, label %cond.true + +cond.true: ; preds = %if.end + br label %cond.end + +cond.end: ; preds = %cond.true, %if.end + %add7 = add i32 %1, 1 + %cmp12 = icmp ugt i32 %add7, %sub + %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 + br i1 %cmp12, label %if.then13, label %while.cond + +if.then13: ; preds = %cond.end + unreachable + +cleanup16: ; preds = %while.cond + ret void +} |