diff options
author | Bill Wendling <isanbard@gmail.com> | 2013-05-16 00:27:57 +0000 |
---|---|---|
committer | Bill Wendling <isanbard@gmail.com> | 2013-05-16 00:27:57 +0000 |
commit | d9b720d279cc0627b10adf9f7516bf355a0a2174 (patch) | |
tree | 285d1c5dbf2c3557719a2aff01e598eaa6a75ad8 /test/CodeGen | |
parent | 91310e4a3021431fe84805ec2eeeaa938526c9e3 (diff) | |
download | llvm-d9b720d279cc0627b10adf9f7516bf355a0a2174.tar.gz llvm-d9b720d279cc0627b10adf9f7516bf355a0a2174.tar.bz2 llvm-d9b720d279cc0627b10adf9f7516bf355a0a2174.tar.xz |
Merging r181580:
------------------------------------------------------------------------
r181580 | tstellar | 2013-05-09 19:09:45 -0700 (Thu, 09 May 2013) | 10 lines
R600: Remove AMDILPeeopholeOptimizer and replace optimizations with tablegen patterns
The BFE optimization was the only one we were actually using, and it was
emitting an intrinsic that we don't support.
https://bugs.freedesktop.org/show_bug.cgi?id=64201
Reviewed-by: Christian König <christian.koenig@amd.com>
NOTE: This is a candidate for the 3.3 branch.
------------------------------------------------------------------------
git-svn-id: https://llvm.org/svn/llvm-project/llvm/branches/release_33@181954 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'test/CodeGen')
-rw-r--r-- | test/CodeGen/R600/bfe_uint.ll | 26 |
1 files changed, 26 insertions, 0 deletions
diff --git a/test/CodeGen/R600/bfe_uint.ll b/test/CodeGen/R600/bfe_uint.ll new file mode 100644 index 0000000000..92570c3152 --- /dev/null +++ b/test/CodeGen/R600/bfe_uint.ll @@ -0,0 +1,26 @@ +; RUN: llc < %s -march=r600 -mcpu=redwood | FileCheck %s + +; CHECK: @bfe_def +; CHECK: BFE_UINT +define void @bfe_def(i32 addrspace(1)* %out, i32 %x) { +entry: + %0 = lshr i32 %x, 5 + %1 = and i32 %0, 15 ; 0xf + store i32 %1, i32 addrspace(1)* %out + ret void +} + +; This program could be implemented using a BFE_UINT instruction, however +; since the lshr constant + number of bits in the mask is >= 32, it can also be +; implmented with a LSHR instruction, which is better, because LSHR has less +; operands and requires less constants. + +; CHECK: @bfe_shift +; CHECK-NOT: BFE_UINT +define void @bfe_shift(i32 addrspace(1)* %out, i32 %x) { +entry: + %0 = lshr i32 %x, 16 + %1 = and i32 %0, 65535 ; 0xffff + store i32 %1, i32 addrspace(1)* %out + ret void +} |