diff options
| author | Andrea Di Biagio <Andrea_DiBiagio@sn.scee.net> | 2013-10-17 11:02:58 +0000 |
|---|---|---|
| committer | Andrea Di Biagio <Andrea_DiBiagio@sn.scee.net> | 2013-10-17 11:02:58 +0000 |
| commit | 888cbad774acdff580611f6b07daaf96e825b7e7 (patch) | |
| tree | 22f43761786a3b5d5a9d69ae13c789ae3a7d2e0d /test | |
| parent | f5e3811607dd54fded0bb6b6ab97345446e086b9 (diff) | |
| download | llvm-888cbad774acdff580611f6b07daaf96e825b7e7.tar.gz llvm-888cbad774acdff580611f6b07daaf96e825b7e7.tar.bz2 llvm-888cbad774acdff580611f6b07daaf96e825b7e7.tar.xz | |
Fix edge condition in DAGCombiner to improve codegen of shift sequences.
When canonicalizing dags according to the rule
(shl (zext (shr X, c1) ), c1) ==> (zext (shl (shr X, c1), c1))
remember to add the new shl dag to the DAGCombiner worklist of nodes.
If we don't explicitly add it to the worklist of nodes to visit, we
may not trigger later on the rule that folds the shift left + logical
shift right into a AND instruction with bitmask.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@192883 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'test')
| -rw-r--r-- | test/CodeGen/X86/dagcombine-shifts.ll | 8 |
1 files changed, 8 insertions, 0 deletions
diff --git a/test/CodeGen/X86/dagcombine-shifts.ll b/test/CodeGen/X86/dagcombine-shifts.ll index e5a67d7efc..905cf052c3 100644 --- a/test/CodeGen/X86/dagcombine-shifts.ll +++ b/test/CodeGen/X86/dagcombine-shifts.ll @@ -187,6 +187,8 @@ entry: ; Once the add is removed, the number of uses becomes one and therefore the ; dags are canonicalized. After Legalization, we need to make sure that the ; valuetype for the shift count is legal. +; Verify also that we correctly fold the shl-shr sequence into an +; AND with bitmask. define void @g(i32 %a) { %b = lshr i32 %a, 2 @@ -197,5 +199,11 @@ define void @g(i32 %a) { ret void } +; CHECK-LABEL: @g +; CHECK-NOT: shr +; CHECK-NOT: shl +; CHECK: and +; CHECK-NEXT: jmp + declare void @f(i64) |