diff options
| author | Geoff Berry <gberry@codeaurora.org> | 2015-11-20 22:34:39 +0000 |
|---|---|---|
| committer | Geoff Berry <gberry@codeaurora.org> | 2015-11-20 22:34:39 +0000 |
| commit | 5256fcada0ae3021b30bd1edc064beeffd0e41fc (patch) | |
| tree | 377fe6c37e5f791b40718c3171e6dd2addaad694 /llvm/test | |
| parent | 8638714dc72976c5d4f5afa6eaeccad2a06dce7f (diff) | |
| download | bcm5719-llvm-5256fcada0ae3021b30bd1edc064beeffd0e41fc.tar.gz bcm5719-llvm-5256fcada0ae3021b30bd1edc064beeffd0e41fc.zip | |
[CodeGenPrepare] Create more extloads and fewer ands
Summary:
Add and instructions immediately after loads that only have their low
bits used, assuming that the (and (load x) c) will be matched as a
extload and the ands/truncs fed by the extload will be removed by isel.
Reviewers: mcrosier, qcolombet, ab
Subscribers: llvm-commits
Differential Revision: http://reviews.llvm.org/D14584
llvm-svn: 253722
Diffstat (limited to 'llvm/test')
| -rw-r--r-- | llvm/test/CodeGen/AArch64/free-zext.ll | 43 | ||||
| -rw-r--r-- | llvm/test/Transforms/CodeGenPrepare/free-zext.ll | 82 |
2 files changed, 125 insertions, 0 deletions
diff --git a/llvm/test/CodeGen/AArch64/free-zext.ll b/llvm/test/CodeGen/AArch64/free-zext.ll index c995339bc1c..ea4f1f4e10f 100644 --- a/llvm/test/CodeGen/AArch64/free-zext.ll +++ b/llvm/test/CodeGen/AArch64/free-zext.ll @@ -26,3 +26,46 @@ define void @test_free_zext2(i32* %ptr, i32* %dst1, i64* %dst2) { store i64 %load64, i64* %dst2, align 8 ret void } + +; Test for CodeGenPrepare::optimizeLoadExt(): simple case: two loads +; feeding a phi that zext's each loaded value. +define i32 @test_free_zext3(i32* %ptr, i32* %ptr2, i32* %dst, i32 %c) { +; CHECK-LABEL: test_free_zext3: +bb1: +; CHECK: ldrh [[REG:w[0-9]+]] +; CHECK-NOT: and {{w[0-9]+}}, [[REG]], #0xffff + %tmp1 = load i32, i32* %ptr, align 4 + %cmp = icmp ne i32 %c, 0 + br i1 %cmp, label %bb2, label %bb3 +bb2: +; CHECK: ldrh [[REG2:w[0-9]+]] +; CHECK-NOT: and {{w[0-9]+}}, [[REG2]], #0xffff + %tmp2 = load i32, i32* %ptr2, align 4 + br label %bb3 +bb3: + %tmp3 = phi i32 [ %tmp1, %bb1 ], [ %tmp2, %bb2 ] +; CHECK-NOT: and {{w[0-9]+}}, {{w[0-9]+}}, #0xffff + %tmpand = and i32 %tmp3, 65535 + ret i32 %tmpand +} + +; Test for CodeGenPrepare::optimizeLoadExt(): check case of zext-able +; load feeding a phi in the same block. +define void @test_free_zext4(i32* %ptr, i32* %ptr2, i32* %dst) { +; CHECK-LABEL: test_free_zext4: +; CHECK: ldrh [[REG:w[0-9]+]] +; TODO: fix isel to remove final and XCHECK-NOT: and {{w[0-9]+}}, {{w[0-9]+}}, #0xffff +; CHECK: ldrh [[REG:w[0-9]+]] +bb1: + %load1 = load i32, i32* %ptr, align 4 + br label %loop +loop: + %phi = phi i32 [ %load1, %bb1 ], [ %load2, %loop ] + %and = and i32 %phi, 65535 + store i32 %and, i32* %dst, align 4 + %load2 = load i32, i32* %ptr2, align 4 + %cmp = icmp ne i32 %and, 0 + br i1 %cmp, label %loop, label %end +end: + ret void +} diff --git a/llvm/test/Transforms/CodeGenPrepare/free-zext.ll b/llvm/test/Transforms/CodeGenPrepare/free-zext.ll new file mode 100644 index 00000000000..c3c11a1c494 --- /dev/null +++ b/llvm/test/Transforms/CodeGenPrepare/free-zext.ll @@ -0,0 +1,82 @@ +; RUN: opt -S -codegenprepare -mtriple=aarch64-linux %s | FileCheck %s + +; Test for CodeGenPrepare::optimizeLoadExt(): simple case: two loads +; feeding a phi that zext's each loaded value. +define i32 @test_free_zext(i32* %ptr, i32* %ptr2, i32 %c) { +; CHECK-LABEL: @test_free_zext( +bb1: +; CHECK-LABEL: bb1: +; CHECK: %[[T1:.*]] = load +; CHECK: %[[A1:.*]] = and i32 %[[T1]], 65535 + %load1 = load i32, i32* %ptr, align 4 + %cmp = icmp ne i32 %c, 0 + br i1 %cmp, label %bb2, label %bb3 +bb2: +; CHECK-LABEL: bb2: +; CHECK: %[[T2:.*]] = load +; CHECK: %[[A2:.*]] = and i32 %[[T2]], 65535 + %load2 = load i32, i32* %ptr2, align 4 + br label %bb3 +bb3: +; CHECK-LABEL: bb3: +; CHECK: phi i32 [ %[[A1]], %bb1 ], [ %[[A2]], %bb2 ] + %phi = phi i32 [ %load1, %bb1 ], [ %load2, %bb2 ] + %and = and i32 %phi, 65535 + ret i32 %and +} + +; Test for CodeGenPrepare::optimizeLoadExt(): exercise all opcode +; cases of active bit calculation. +define i32 @test_free_zext2(i32* %ptr, i16* %dst16, i32* %dst32, i32 %c) { +; CHECK-LABEL: @test_free_zext2( +bb1: +; CHECK-LABEL: bb1: +; CHECK: %[[T1:.*]] = load +; CHECK: %[[A1:.*]] = and i32 %[[T1]], 65535 + %load1 = load i32, i32* %ptr, align 4 + %cmp = icmp ne i32 %c, 0 + br i1 %cmp, label %bb2, label %bb4 +bb2: +; CHECK-LABEL: bb2: + %trunc = trunc i32 %load1 to i16 + store i16 %trunc, i16* %dst16, align 2 + br i1 %cmp, label %bb3, label %bb4 +bb3: +; CHECK-LABEL: bb3: + %shl = shl i32 %load1, 16 + store i32 %shl, i32* %dst32, align 4 + br label %bb4 +bb4: +; CHECK-LABEL: bb4: +; CHECK-NOT: and +; CHECK: ret i32 %[[A1]] + %and = and i32 %load1, 65535 + ret i32 %and +} + +; Test for CodeGenPrepare::optimizeLoadExt(): check case of zext-able +; load feeding a phi in the same block. +define void @test_free_zext3(i32* %ptr, i32* %ptr2, i32* %dst, i64* %c) { +; CHECK-LABEL: @test_free_zext3( +bb1: +; CHECK-LABEL: bb1: +; CHECK: %[[T1:.*]] = load +; CHECK: %[[A1:.*]] = and i32 %[[T1]], 65535 + %load1 = load i32, i32* %ptr, align 4 + br label %loop +loop: +; CHECK-LABEL: loop: +; CHECK: phi i32 [ %[[A1]], %bb1 ], [ %[[A2]], %loop ] + %phi = phi i32 [ %load1, %bb1 ], [ %load2, %loop ] + %and = and i32 %phi, 65535 + store i32 %and, i32* %dst, align 4 + %idx = load volatile i64, i64* %c, align 4 + %addr = getelementptr inbounds i32, i32* %ptr2, i64 %idx +; CHECK: %[[T2:.*]] = load i32 +; CHECK: %[[A2:.*]] = and i32 %[[T2]], 65535 + %load2 = load i32, i32* %addr, align 4 + %cmp = icmp ne i64 %idx, 0 + br i1 %cmp, label %loop, label %end +end: + ret void +} |

