mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-31 16:02:52 +01:00
94c7d4af34
This patch prevents the following combine when the input vector is used more than once. insert_vector_elt (build_vector elt0, ..., eltN), NewEltIdx, idx => build_vector elt0, ..., NewEltIdx, ..., eltN The reasons are: - Building a vector may be expensive, so try to reuse the existing part of a vector instead of creating a new one (think big vectors). - elt0 to eltN now have two users instead of one. This may prevent some other optimizations. llvm-svn: 187396
86 lines
2.7 KiB
LLVM
86 lines
2.7 KiB
LLVM
; RUN: llc < %s -march=x86 -mattr=+sse2 | FileCheck %s
|
|
|
|
; test vector shifts converted to proper SSE2 vector shifts when the shift
|
|
; amounts are the same when using a shuffle splat.
|
|
|
|
define void @shift1a(<2 x i64> %val, <2 x i64>* %dst, <2 x i64> %sh) nounwind {
|
|
entry:
|
|
; CHECK-LABEL: shift1a:
|
|
; CHECK: psllq
|
|
%shamt = shufflevector <2 x i64> %sh, <2 x i64> undef, <2 x i32> <i32 0, i32 0>
|
|
%shl = shl <2 x i64> %val, %shamt
|
|
store <2 x i64> %shl, <2 x i64>* %dst
|
|
ret void
|
|
}
|
|
|
|
; shift1b can't use a packed shift
|
|
define void @shift1b(<2 x i64> %val, <2 x i64>* %dst, <2 x i64> %sh) nounwind {
|
|
entry:
|
|
; CHECK-LABEL: shift1b:
|
|
; CHECK: shll
|
|
%shamt = shufflevector <2 x i64> %sh, <2 x i64> undef, <2 x i32> <i32 0, i32 1>
|
|
%shl = shl <2 x i64> %val, %shamt
|
|
store <2 x i64> %shl, <2 x i64>* %dst
|
|
ret void
|
|
}
|
|
|
|
define void @shift2a(<4 x i32> %val, <4 x i32>* %dst, <2 x i32> %amt) nounwind {
|
|
entry:
|
|
; CHECK-LABEL: shift2a:
|
|
; CHECK: pslld
|
|
%shamt = shufflevector <2 x i32> %amt, <2 x i32> undef, <4 x i32> <i32 1, i32 1, i32 1, i32 1>
|
|
%shl = shl <4 x i32> %val, %shamt
|
|
store <4 x i32> %shl, <4 x i32>* %dst
|
|
ret void
|
|
}
|
|
|
|
define void @shift2b(<4 x i32> %val, <4 x i32>* %dst, <2 x i32> %amt) nounwind {
|
|
entry:
|
|
; CHECK-LABEL: shift2b:
|
|
; CHECK: pslld
|
|
%shamt = shufflevector <2 x i32> %amt, <2 x i32> undef, <4 x i32> <i32 1, i32 undef, i32 1, i32 1>
|
|
%shl = shl <4 x i32> %val, %shamt
|
|
store <4 x i32> %shl, <4 x i32>* %dst
|
|
ret void
|
|
}
|
|
|
|
define void @shift2c(<4 x i32> %val, <4 x i32>* %dst, <2 x i32> %amt) nounwind {
|
|
entry:
|
|
; CHECK-LABEL: shift2c:
|
|
; CHECK: pslld
|
|
%shamt = shufflevector <2 x i32> %amt, <2 x i32> undef, <4 x i32> <i32 1, i32 1, i32 1, i32 1>
|
|
%shl = shl <4 x i32> %val, %shamt
|
|
store <4 x i32> %shl, <4 x i32>* %dst
|
|
ret void
|
|
}
|
|
|
|
define void @shift3a(<8 x i16> %val, <8 x i16>* %dst, <8 x i16> %amt) nounwind {
|
|
entry:
|
|
; CHECK-LABEL: shift3a:
|
|
; CHECK: movzwl
|
|
; CHECK: psllw
|
|
%shamt = shufflevector <8 x i16> %amt, <8 x i16> undef, <8 x i32> <i32 6, i32 6, i32 6, i32 6, i32 6, i32 6, i32 6, i32 6>
|
|
%shl = shl <8 x i16> %val, %shamt
|
|
store <8 x i16> %shl, <8 x i16>* %dst
|
|
ret void
|
|
}
|
|
|
|
define void @shift3b(<8 x i16> %val, <8 x i16>* %dst, i16 %amt) nounwind {
|
|
entry:
|
|
; CHECK-LABEL: shift3b:
|
|
; CHECK: movzwl
|
|
; CHECK: psllw
|
|
%0 = insertelement <8 x i16> undef, i16 %amt, i32 0
|
|
%1 = insertelement <8 x i16> %0, i16 %amt, i32 1
|
|
%2 = insertelement <8 x i16> %1, i16 %amt, i32 2
|
|
%3 = insertelement <8 x i16> %2, i16 %amt, i32 3
|
|
%4 = insertelement <8 x i16> %3, i16 %amt, i32 4
|
|
%5 = insertelement <8 x i16> %4, i16 %amt, i32 5
|
|
%6 = insertelement <8 x i16> %5, i16 %amt, i32 6
|
|
%7 = insertelement <8 x i16> %6, i16 %amt, i32 7
|
|
%shl = shl <8 x i16> %val, %7
|
|
store <8 x i16> %shl, <8 x i16>* %dst
|
|
ret void
|
|
}
|
|
|