[llvm] r253730 - Move free-zext.ll to llvm/test/Transforms/CodeGenPrepare/AArch64/

NAKAMURA Takumi via llvm-commits llvm-commits at lists.llvm.org
Fri Nov 20 14:55:34 PST 2015


Author: chapuni
Date: Fri Nov 20 16:55:34 2015
New Revision: 253730

URL: http://llvm.org/viewvc/llvm-project?rev=253730&view=rev
Log:
Move free-zext.ll to llvm/test/Transforms/CodeGenPrepare/AArch64/

Added:
    llvm/trunk/test/Transforms/CodeGenPrepare/AArch64/free-zext.ll
      - copied, changed from r253729, llvm/trunk/test/Transforms/CodeGenPrepare/free-zext.ll
Removed:
    llvm/trunk/test/Transforms/CodeGenPrepare/free-zext.ll

Copied: llvm/trunk/test/Transforms/CodeGenPrepare/AArch64/free-zext.ll (from r253729, llvm/trunk/test/Transforms/CodeGenPrepare/free-zext.ll)
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/CodeGenPrepare/AArch64/free-zext.ll?p2=llvm/trunk/test/Transforms/CodeGenPrepare/AArch64/free-zext.ll&p1=llvm/trunk/test/Transforms/CodeGenPrepare/free-zext.ll&r1=253729&r2=253730&rev=253730&view=diff
==============================================================================
    (empty)

Removed: llvm/trunk/test/Transforms/CodeGenPrepare/free-zext.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/CodeGenPrepare/free-zext.ll?rev=253729&view=auto
==============================================================================
--- llvm/trunk/test/Transforms/CodeGenPrepare/free-zext.ll (original)
+++ llvm/trunk/test/Transforms/CodeGenPrepare/free-zext.ll (removed)
@@ -1,82 +0,0 @@
-; 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
-}




More information about the llvm-commits mailing list