2009-10-11 22:52:15 +00:00
|
|
|
; RUN: opt < %s -instcombine -S | FileCheck %s
|
2006-04-10 22:45:37 +00:00
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
define <4 x float> @test1(<4 x float> %v1) {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test1(
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
; CHECK: ret <4 x float> %v1
|
|
|
|
|
%v2 = shufflevector <4 x float> %v1, <4 x float> undef, <4 x i32> <i32 0, i32 1, i32 2, i32 3>
|
|
|
|
|
ret <4 x float> %v2
|
2006-04-10 22:45:37 +00:00
|
|
|
}
|
|
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
define <4 x float> @test2(<4 x float> %v1) {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test2(
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
; CHECK: ret <4 x float> %v1
|
|
|
|
|
%v2 = shufflevector <4 x float> %v1, <4 x float> %v1, <4 x i32> <i32 0, i32 5, i32 2, i32 7>
|
|
|
|
|
ret <4 x float> %v2
|
2006-04-10 22:45:37 +00:00
|
|
|
}
|
|
|
|
|
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
define float @test3(<4 x float> %A, <4 x float> %B, float %f) {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test3(
|
2009-10-11 22:52:15 +00:00
|
|
|
; CHECK: ret float %f
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
%C = insertelement <4 x float> %A, float %f, i32 0
|
|
|
|
|
%D = shufflevector <4 x float> %C, <4 x float> %B, <4 x i32> <i32 5, i32 0, i32 2, i32 7>
|
|
|
|
|
%E = extractelement <4 x float> %D, i32 1
|
2006-04-10 23:06:18 +00:00
|
|
|
ret float %E
|
|
|
|
|
}
|
|
|
|
|
|
2007-01-26 08:25:06 +00:00
|
|
|
define i32 @test4(<4 x i32> %X) {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test4(
|
2009-10-11 22:52:15 +00:00
|
|
|
; CHECK-NEXT: extractelement
|
|
|
|
|
; CHECK-NEXT: ret
|
2007-01-05 07:34:41 +00:00
|
|
|
%tmp152.i53899.i = shufflevector <4 x i32> %X, <4 x i32> undef, <4 x i32> zeroinitializer
|
|
|
|
|
%tmp34 = extractelement <4 x i32> %tmp152.i53899.i, i32 0
|
|
|
|
|
ret i32 %tmp34
|
2006-05-25 22:52:49 +00:00
|
|
|
}
|
|
|
|
|
|
2007-01-26 08:25:06 +00:00
|
|
|
define i32 @test5(<4 x i32> %X) {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test5(
|
2009-10-11 22:52:15 +00:00
|
|
|
; CHECK-NEXT: extractelement
|
|
|
|
|
; CHECK-NEXT: ret
|
2007-01-05 07:34:41 +00:00
|
|
|
%tmp152.i53899.i = shufflevector <4 x i32> %X, <4 x i32> undef, <4 x i32> <i32 3, i32 2, i32 undef, i32 undef>
|
|
|
|
|
%tmp34 = extractelement <4 x i32> %tmp152.i53899.i, i32 0
|
|
|
|
|
ret i32 %tmp34
|
2006-05-25 22:52:49 +00:00
|
|
|
}
|
|
|
|
|
|
2007-01-26 08:25:06 +00:00
|
|
|
define float @test6(<4 x float> %X) {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test6(
|
2009-10-11 22:52:15 +00:00
|
|
|
; CHECK-NEXT: extractelement
|
|
|
|
|
; CHECK-NEXT: ret
|
2007-01-30 16:16:01 +00:00
|
|
|
%X1 = bitcast <4 x float> %X to <4 x i32>
|
|
|
|
|
%tmp152.i53899.i = shufflevector <4 x i32> %X1, <4 x i32> undef, <4 x i32> zeroinitializer
|
2007-01-05 07:34:41 +00:00
|
|
|
%tmp152.i53900.i = bitcast <4 x i32> %tmp152.i53899.i to <4 x float>
|
|
|
|
|
%tmp34 = extractelement <4 x float> %tmp152.i53900.i, i32 0
|
2006-05-25 23:23:22 +00:00
|
|
|
ret float %tmp34
|
|
|
|
|
}
|
|
|
|
|
|
2007-01-26 08:25:06 +00:00
|
|
|
define <4 x float> @test7(<4 x float> %tmp45.i) {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test7(
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@134829 91177308-0d34-0410-b5e6-96231b3b80d8
2011-07-09 17:41:24 +00:00
|
|
|
; CHECK-NEXT: ret <4 x float> %tmp45.i
|
2007-01-05 07:35:24 +00:00
|
|
|
%tmp1642.i = shufflevector <4 x float> %tmp45.i, <4 x float> undef, <4 x i32> < i32 0, i32 1, i32 6, i32 7 >
|
|
|
|
|
ret <4 x float> %tmp1642.i
|
|
|
|
|
}
|
2009-10-11 22:52:15 +00:00
|
|
|
|
|
|
|
|
; This should turn into a single shuffle.
|
|
|
|
|
define <4 x float> @test8(<4 x float> %tmp, <4 x float> %tmp1) {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test8(
|
2009-10-11 22:52:15 +00:00
|
|
|
; CHECK-NEXT: shufflevector
|
|
|
|
|
; CHECK-NEXT: ret
|
|
|
|
|
%tmp4 = extractelement <4 x float> %tmp, i32 1
|
|
|
|
|
%tmp2 = extractelement <4 x float> %tmp, i32 3
|
|
|
|
|
%tmp1.upgrd.1 = extractelement <4 x float> %tmp1, i32 0
|
|
|
|
|
%tmp128 = insertelement <4 x float> undef, float %tmp4, i32 0
|
|
|
|
|
%tmp130 = insertelement <4 x float> %tmp128, float undef, i32 1
|
|
|
|
|
%tmp132 = insertelement <4 x float> %tmp130, float %tmp2, i32 2
|
|
|
|
|
%tmp134 = insertelement <4 x float> %tmp132, float %tmp1.upgrd.1, i32 3
|
|
|
|
|
ret <4 x float> %tmp134
|
|
|
|
|
}
|
|
|
|
|
|
2009-10-11 22:54:48 +00:00
|
|
|
; Test fold of two shuffles where the first shuffle vectors inputs are a
|
|
|
|
|
; different length then the second.
|
|
|
|
|
define <4 x i8> @test9(<16 x i8> %tmp6) nounwind {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test9(
|
2009-10-11 22:54:48 +00:00
|
|
|
; CHECK-NEXT: shufflevector
|
|
|
|
|
; CHECK-NEXT: ret
|
|
|
|
|
%tmp7 = shufflevector <16 x i8> %tmp6, <16 x i8> undef, <4 x i32> < i32 13, i32 9, i32 4, i32 13 > ; <<4 x i8>> [#uses=1]
|
|
|
|
|
%tmp9 = shufflevector <4 x i8> %tmp7, <4 x i8> undef, <4 x i32> < i32 3, i32 1, i32 2, i32 0 > ; <<4 x i8>> [#uses=1]
|
|
|
|
|
ret <4 x i8> %tmp9
|
2010-04-07 22:53:17 +00:00
|
|
|
}
|
2010-10-29 22:02:50 +00:00
|
|
|
|
2010-10-29 22:03:05 +00:00
|
|
|
; Same as test9, but make sure that "undef" mask values are not confused with
|
2013-05-01 00:25:27 +00:00
|
|
|
; mask values of 2*N, where N is the mask length. These shuffles should not
|
|
|
|
|
; be folded (because [8,9,4,8] may not be a mask supported by the target).
|
|
|
|
|
define <4 x i8> @test9a(<16 x i8> %tmp6) nounwind {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test9a(
|
2013-05-01 00:25:27 +00:00
|
|
|
; CHECK-NEXT: shufflevector
|
|
|
|
|
; CHECK-NEXT: shufflevector
|
2010-10-29 22:03:05 +00:00
|
|
|
; CHECK-NEXT: ret
|
2013-05-01 00:25:27 +00:00
|
|
|
%tmp7 = shufflevector <16 x i8> %tmp6, <16 x i8> undef, <4 x i32> < i32 undef, i32 9, i32 4, i32 8 > ; <<4 x i8>> [#uses=1]
|
2010-10-29 22:03:05 +00:00
|
|
|
%tmp9 = shufflevector <4 x i8> %tmp7, <4 x i8> undef, <4 x i32> < i32 3, i32 1, i32 2, i32 0 > ; <<4 x i8>> [#uses=1]
|
|
|
|
|
ret <4 x i8> %tmp9
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-21 19:06:29 +00:00
|
|
|
; Test fold of two shuffles where the first shuffle vectors inputs are a
|
|
|
|
|
; different length then the second.
|
|
|
|
|
define <4 x i8> @test9b(<4 x i8> %tmp6, <4 x i8> %tmp7) nounwind {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test9b(
|
2011-10-21 19:06:29 +00:00
|
|
|
; CHECK-NEXT: shufflevector
|
|
|
|
|
; CHECK-NEXT: ret
|
|
|
|
|
%tmp1 = shufflevector <4 x i8> %tmp6, <4 x i8> %tmp7, <8 x i32> <i32 0, i32 1, i32 4, i32 5, i32 4, i32 5, i32 2, i32 3> ; <<4 x i8>> [#uses=1]
|
|
|
|
|
%tmp9 = shufflevector <8 x i8> %tmp1, <8 x i8> undef, <4 x i32> <i32 0, i32 1, i32 4, i32 5> ; <<4 x i8>> [#uses=1]
|
|
|
|
|
ret <4 x i8> %tmp9
|
|
|
|
|
}
|
|
|
|
|
|
2010-10-29 22:02:50 +00:00
|
|
|
; Redundant vector splats should be removed. Radar 8597790.
|
|
|
|
|
define <4 x i32> @test10(<4 x i32> %tmp5) nounwind {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test10(
|
2010-10-29 22:02:50 +00:00
|
|
|
; CHECK-NEXT: shufflevector
|
|
|
|
|
; CHECK-NEXT: ret
|
|
|
|
|
%tmp6 = shufflevector <4 x i32> %tmp5, <4 x i32> undef, <4 x i32> <i32 1, i32 undef, i32 undef, i32 undef>
|
|
|
|
|
%tmp7 = shufflevector <4 x i32> %tmp6, <4 x i32> undef, <4 x i32> zeroinitializer
|
|
|
|
|
ret <4 x i32> %tmp7
|
|
|
|
|
}
|
2011-10-21 19:06:29 +00:00
|
|
|
|
|
|
|
|
; Test fold of two shuffles where the two shufflevector inputs's op1 are
|
|
|
|
|
; the same
|
|
|
|
|
define <8 x i8> @test11(<16 x i8> %tmp6) nounwind {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test11(
|
2011-10-21 19:06:29 +00:00
|
|
|
; CHECK-NEXT: shufflevector <16 x i8> %tmp6, <16 x i8> undef, <8 x i32> <i32 0, i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7>
|
|
|
|
|
; CHECK-NEXT: ret
|
|
|
|
|
%tmp1 = shufflevector <16 x i8> %tmp6, <16 x i8> undef, <4 x i32> <i32 0, i32 1, i32 2, i32 3> ; <<4 x i8>> [#uses=1]
|
|
|
|
|
%tmp2 = shufflevector <16 x i8> %tmp6, <16 x i8> undef, <4 x i32> <i32 4, i32 5, i32 6, i32 7> ; <<4 x i8>> [#uses=1]
|
|
|
|
|
%tmp3 = shufflevector <4 x i8> %tmp1, <4 x i8> %tmp2, <8 x i32> <i32 0, i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7> ; <<8 x i8>> [#uses=1]
|
|
|
|
|
ret <8 x i8> %tmp3
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Test fold of two shuffles where the first shufflevector's inputs are
|
|
|
|
|
; the same as the second
|
|
|
|
|
define <8 x i8> @test12(<8 x i8> %tmp6, <8 x i8> %tmp2) nounwind {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test12(
|
2011-10-21 19:06:29 +00:00
|
|
|
; CHECK-NEXT: shufflevector <8 x i8> %tmp6, <8 x i8> %tmp2, <8 x i32> <i32 0, i32 1, i32 2, i32 3, i32 9, i32 8, i32 11, i32 12>
|
|
|
|
|
; CHECK-NEXT: ret
|
|
|
|
|
%tmp1 = shufflevector <8 x i8> %tmp6, <8 x i8> undef, <8 x i32> <i32 0, i32 1, i32 2, i32 3, i32 5, i32 4, i32 undef, i32 7> ; <<8 x i8>> [#uses=1]
|
|
|
|
|
%tmp3 = shufflevector <8 x i8> %tmp1, <8 x i8> %tmp2, <8 x i32> <i32 0, i32 1, i32 2, i32 3, i32 9, i32 8, i32 11, i32 12> ; <<8 x i8>> [#uses=1]
|
|
|
|
|
ret <8 x i8> %tmp3
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Test fold of two shuffles where the first shufflevector's inputs are
|
|
|
|
|
; the same as the second
|
|
|
|
|
define <8 x i8> @test12a(<8 x i8> %tmp6, <8 x i8> %tmp2) nounwind {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test12a(
|
2011-10-21 19:06:29 +00:00
|
|
|
; CHECK-NEXT: shufflevector <8 x i8> %tmp2, <8 x i8> %tmp6, <8 x i32> <i32 0, i32 3, i32 1, i32 4, i32 8, i32 9, i32 10, i32 11>
|
|
|
|
|
; CHECK-NEXT: ret
|
|
|
|
|
%tmp1 = shufflevector <8 x i8> %tmp6, <8 x i8> undef, <8 x i32> <i32 0, i32 1, i32 2, i32 3, i32 5, i32 4, i32 undef, i32 7> ; <<8 x i8>> [#uses=1]
|
|
|
|
|
%tmp3 = shufflevector <8 x i8> %tmp2, <8 x i8> %tmp1, <8 x i32> <i32 0, i32 3, i32 1, i32 4, i32 8, i32 9, i32 10, i32 11> ; <<8 x i8>> [#uses=1]
|
|
|
|
|
ret <8 x i8> %tmp3
|
|
|
|
|
}
|
|
|
|
|
|
2013-05-31 00:59:42 +00:00
|
|
|
define <2 x i8> @test13a(i8 %x1, i8 %x2) {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test13a(
|
2013-05-31 00:59:42 +00:00
|
|
|
; CHECK-NEXT: insertelement {{.*}} undef, i8 %x1, i32 1
|
|
|
|
|
; CHECK-NEXT: insertelement {{.*}} i8 %x2, i32 0
|
|
|
|
|
; CHECK-NEXT: add {{.*}} <i8 7, i8 5>
|
|
|
|
|
; CHECK-NEXT: ret
|
|
|
|
|
%A = insertelement <2 x i8> undef, i8 %x1, i32 0
|
|
|
|
|
%B = insertelement <2 x i8> %A, i8 %x2, i32 1
|
|
|
|
|
%C = add <2 x i8> %B, <i8 5, i8 7>
|
|
|
|
|
%D = shufflevector <2 x i8> %C, <2 x i8> undef, <2 x i32> <i32 1, i32 0>
|
|
|
|
|
ret <2 x i8> %D
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define <2 x i8> @test13b(i8 %x) {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test13b(
|
2013-05-31 00:59:42 +00:00
|
|
|
; CHECK-NEXT: insertelement <2 x i8> undef, i8 %x, i32 1
|
|
|
|
|
; CHECK-NEXT: ret
|
|
|
|
|
%A = insertelement <2 x i8> undef, i8 %x, i32 0
|
|
|
|
|
%B = shufflevector <2 x i8> %A, <2 x i8> undef, <2 x i32> <i32 undef, i32 0>
|
|
|
|
|
ret <2 x i8> %B
|
|
|
|
|
}
|
2013-06-01 20:51:31 +00:00
|
|
|
|
|
|
|
|
define <2 x i8> @test13c(i8 %x1, i8 %x2) {
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test13c(
|
2013-06-01 20:51:31 +00:00
|
|
|
; CHECK-NEXT: insertelement <2 x i8> {{.*}}, i32 0
|
|
|
|
|
; CHECK-NEXT: insertelement <2 x i8> {{.*}}, i32 1
|
|
|
|
|
; CHECK-NEXT: ret
|
|
|
|
|
%A = insertelement <4 x i8> undef, i8 %x1, i32 0
|
|
|
|
|
%B = insertelement <4 x i8> %A, i8 %x2, i32 2
|
|
|
|
|
%C = shufflevector <4 x i8> %B, <4 x i8> undef, <2 x i32> <i32 0, i32 2>
|
|
|
|
|
ret <2 x i8> %C
|
|
|
|
|
}
|
2013-07-12 23:08:06 +00:00
|
|
|
|
|
|
|
|
define void @test14(i16 %conv10) {
|
|
|
|
|
%tmp = alloca <4 x i16>, align 8
|
|
|
|
|
%vecinit6 = insertelement <4 x i16> undef, i16 23, i32 3
|
|
|
|
|
store <4 x i16> %vecinit6, <4 x i16>* undef
|
|
|
|
|
%tmp1 = load <4 x i16>* undef
|
|
|
|
|
%vecinit11 = insertelement <4 x i16> undef, i16 %conv10, i32 3
|
|
|
|
|
%div = udiv <4 x i16> %tmp1, %vecinit11
|
|
|
|
|
store <4 x i16> %div, <4 x i16>* %tmp
|
|
|
|
|
%tmp4 = load <4 x i16>* %tmp
|
|
|
|
|
%tmp5 = shufflevector <4 x i16> %tmp4, <4 x i16> undef, <2 x i32> <i32 2, i32 0>
|
|
|
|
|
%cmp = icmp ule <2 x i16> %tmp5, undef
|
|
|
|
|
%sext = sext <2 x i1> %cmp to <2 x i16>
|
|
|
|
|
ret void
|
|
|
|
|
}
|
2013-09-18 12:06:59 +00:00
|
|
|
|
|
|
|
|
; Check that sequences of insert/extract element are
|
|
|
|
|
; collapsed into valid shuffle instruction with correct shuffle indexes.
|
|
|
|
|
|
|
|
|
|
define <4 x float> @test15a(<4 x float> %LHS, <4 x float> %RHS) {
|
|
|
|
|
; CHECK-LABEL: @test15a
|
|
|
|
|
; CHECK-NEXT: shufflevector <4 x float> %LHS, <4 x float> %RHS, <4 x i32> <i32 4, i32 0, i32 6, i32 6>
|
|
|
|
|
; CHECK-NEXT: ret <4 x float> %tmp4
|
|
|
|
|
%tmp1 = extractelement <4 x float> %LHS, i32 0
|
|
|
|
|
%tmp2 = insertelement <4 x float> %RHS, float %tmp1, i32 1
|
|
|
|
|
%tmp3 = extractelement <4 x float> %RHS, i32 2
|
|
|
|
|
%tmp4 = insertelement <4 x float> %tmp2, float %tmp3, i32 3
|
|
|
|
|
ret <4 x float> %tmp4
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define <4 x float> @test15b(<4 x float> %LHS, <4 x float> %RHS) {
|
|
|
|
|
; CHECK-LABEL: @test15b
|
|
|
|
|
; CHECK-NEXT: shufflevector <4 x float> %LHS, <4 x float> %RHS, <4 x i32> <i32 4, i32 3, i32 6, i32 6>
|
|
|
|
|
; CHECK-NEXT: ret <4 x float> %tmp5
|
|
|
|
|
%tmp0 = extractelement <4 x float> %LHS, i32 3
|
|
|
|
|
%tmp1 = insertelement <4 x float> %RHS, float %tmp0, i32 0
|
|
|
|
|
%tmp2 = extractelement <4 x float> %tmp1, i32 0
|
|
|
|
|
%tmp3 = insertelement <4 x float> %RHS, float %tmp2, i32 1
|
|
|
|
|
%tmp4 = extractelement <4 x float> %RHS, i32 2
|
|
|
|
|
%tmp5 = insertelement <4 x float> %tmp3, float %tmp4, i32 3
|
|
|
|
|
ret <4 x float> %tmp5
|
|
|
|
|
}
|
|
|
|
|
|
2014-01-08 03:06:15 +00:00
|
|
|
define <1 x i32> @test16a(i32 %ele) {
|
|
|
|
|
; CHECK-LABEL: @test16a(
|
|
|
|
|
; CHECK-NEXT: ret <1 x i32> <i32 2>
|
|
|
|
|
%tmp0 = insertelement <2 x i32> <i32 1, i32 undef>, i32 %ele, i32 1
|
|
|
|
|
%tmp1 = shl <2 x i32> %tmp0, <i32 1, i32 1>
|
|
|
|
|
%tmp2 = shufflevector <2 x i32> %tmp1, <2 x i32> undef, <1 x i32> <i32 0>
|
|
|
|
|
ret <1 x i32> %tmp2
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define <4 x i8> @test16b(i8 %ele) {
|
|
|
|
|
; CHECK-LABEL: @test16b(
|
|
|
|
|
; CHECK-NEXT: ret <4 x i8> <i8 2, i8 2, i8 2, i8 2>
|
|
|
|
|
%tmp0 = insertelement <8 x i8> <i8 1, i8 1, i8 1, i8 1, i8 1, i8 1, i8 undef, i8 1>, i8 %ele, i32 6
|
|
|
|
|
%tmp1 = shl <8 x i8> %tmp0, <i8 1, i8 1, i8 1, i8 1, i8 1, i8 1, i8 1, i8 1>
|
|
|
|
|
%tmp2 = shufflevector <8 x i8> %tmp1, <8 x i8> undef, <4 x i32> <i32 1, i32 2, i32 3, i32 4>
|
|
|
|
|
ret <4 x i8> %tmp2
|
2014-05-11 08:46:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; If composition of two shuffles is identity, shuffles can be removed.
|
|
|
|
|
define <4 x i32> @shuffle_17ident(<4 x i32> %v) nounwind uwtable {
|
|
|
|
|
; CHECK-LABEL: @shuffle_17ident(
|
|
|
|
|
; CHECK-NOT: shufflevector
|
|
|
|
|
%shuffle = shufflevector <4 x i32> %v, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
%shuffle2 = shufflevector <4 x i32> %shuffle, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 3, i32 0, i32 1, i32 2>
|
|
|
|
|
ret <4 x i32> %shuffle2
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; swizzle can be put after operation
|
|
|
|
|
define <4 x i32> @shuffle_17and(<4 x i32> %v1, <4 x i32> %v2) nounwind uwtable {
|
|
|
|
|
; CHECK-LABEL: @shuffle_17and(
|
|
|
|
|
; CHECK-NOT: shufflevector
|
|
|
|
|
; CHECK: and <4 x i32> %v1, %v2
|
|
|
|
|
; CHECK: shufflevector
|
|
|
|
|
%t1 = shufflevector <4 x i32> %v1, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
%t2 = shufflevector <4 x i32> %v2, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
%r = and <4 x i32> %t1, %t2
|
|
|
|
|
ret <4 x i32> %r
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define <4 x i32> @shuffle_17add(<4 x i32> %v1, <4 x i32> %v2) nounwind uwtable {
|
|
|
|
|
; CHECK-LABEL: @shuffle_17add(
|
|
|
|
|
; CHECK-NOT: shufflevector
|
|
|
|
|
; CHECK: add <4 x i32> %v1, %v2
|
|
|
|
|
; CHECK: shufflevector
|
|
|
|
|
%t1 = shufflevector <4 x i32> %v1, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
%t2 = shufflevector <4 x i32> %v2, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
%r = add <4 x i32> %t1, %t2
|
|
|
|
|
ret <4 x i32> %r
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define <4 x i32> @shuffle_17addnsw(<4 x i32> %v1, <4 x i32> %v2) nounwind uwtable {
|
|
|
|
|
; CHECK-LABEL: @shuffle_17addnsw(
|
|
|
|
|
; CHECK-NOT: shufflevector
|
|
|
|
|
; CHECK: add nsw <4 x i32> %v1, %v2
|
|
|
|
|
; CHECK: shufflevector
|
|
|
|
|
%t1 = shufflevector <4 x i32> %v1, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
%t2 = shufflevector <4 x i32> %v2, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
%r = add nsw <4 x i32> %t1, %t2
|
|
|
|
|
ret <4 x i32> %r
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define <4 x i32> @shuffle_17addnuw(<4 x i32> %v1, <4 x i32> %v2) nounwind uwtable {
|
|
|
|
|
; CHECK-LABEL: @shuffle_17addnuw(
|
|
|
|
|
; CHECK-NOT: shufflevector
|
|
|
|
|
; CHECK: add nuw <4 x i32> %v1, %v2
|
|
|
|
|
; CHECK: shufflevector
|
|
|
|
|
%t1 = shufflevector <4 x i32> %v1, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
%t2 = shufflevector <4 x i32> %v2, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
%r = add nuw <4 x i32> %t1, %t2
|
|
|
|
|
ret <4 x i32> %r
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define <4 x float> @shuffle_17fsub(<4 x float> %v1, <4 x float> %v2) nounwind uwtable {
|
|
|
|
|
; CHECK-LABEL: @shuffle_17fsub(
|
|
|
|
|
; CHECK-NOT: shufflevector
|
|
|
|
|
; CHECK: fsub <4 x float> %v1, %v2
|
|
|
|
|
; CHECK: shufflevector
|
|
|
|
|
%t1 = shufflevector <4 x float> %v1, <4 x float> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
%t2 = shufflevector <4 x float> %v2, <4 x float> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
%r = fsub <4 x float> %t1, %t2
|
|
|
|
|
ret <4 x float> %r
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define <4 x i32> @shuffle_17addconst(<4 x i32> %v1, <4 x i32> %v2) {
|
|
|
|
|
; CHECK-LABEL: @shuffle_17addconst(
|
|
|
|
|
; CHECK-NOT: shufflevector
|
|
|
|
|
; CHECK: [[VAR1:%[a-zA-Z0-9.]+]] = add <4 x i32> %v1, <i32 4, i32 1, i32 2, i32 3>
|
|
|
|
|
; CHECK: [[VAR2:%[a-zA-Z0-9.]+]] = shufflevector <4 x i32> [[VAR1]], <4 x i32> undef, <4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
; CHECK: ret <4 x i32> [[VAR2]]
|
|
|
|
|
%t1 = shufflevector <4 x i32> %v1, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 2, i32 3, i32 0>
|
|
|
|
|
%r = add <4 x i32> %t1, <i32 1, i32 2, i32 3, i32 4>
|
|
|
|
|
ret <4 x i32> %r
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define <4 x i32> @shuffle_17add2(<4 x i32> %v) {
|
|
|
|
|
; CHECK-LABEL: @shuffle_17add2(
|
|
|
|
|
; CHECK-NOT: shufflevector
|
|
|
|
|
; CHECK: [[VAR:%[a-zA-Z0-9.]+]] = shl <4 x i32> %v, <i32 1, i32 1, i32 1, i32 1>
|
|
|
|
|
; CHECK: ret <4 x i32> [[VAR]]
|
|
|
|
|
%t1 = shufflevector <4 x i32> %v, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 3, i32 2, i32 1, i32 0>
|
|
|
|
|
%t2 = add <4 x i32> %t1, %t1
|
|
|
|
|
%r = shufflevector <4 x i32> %t2, <4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 3, i32 2, i32 1, i32 0>
|
|
|
|
|
ret <4 x i32> %r
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define <4 x i32> @shuffle_17mulsplat(<4 x i32> %v) {
|
|
|
|
|
; CHECK-LABEL: @shuffle_17mulsplat(
|
|
|
|
|
; CHECK-NOT: shufflevector
|
|
|
|
|
; CHECK: [[VAR1:%[a-zA-Z0-9.]+]] = mul <4 x i32> %v, %v
|
|
|
|
|
; CHECK: [[VAR2:%[a-zA-Z0-9.]+]] = shufflevector <4 x i32> [[VAR1]], <4 x i32> undef, <4 x i32> zeroinitializer
|
|
|
|
|
; CHECK: ret <4 x i32> [[VAR2]]
|
|
|
|
|
%s1 = shufflevector <4 x i32> %v,
|
|
|
|
|
<4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> zeroinitializer
|
|
|
|
|
%m1 = mul <4 x i32> %s1, %s1
|
|
|
|
|
%s2 = shufflevector <4 x i32> %m1,
|
|
|
|
|
<4 x i32> zeroinitializer,
|
|
|
|
|
<4 x i32> <i32 1, i32 1, i32 1, i32 1>
|
|
|
|
|
ret <4 x i32> %s2
|
|
|
|
|
}
|
2014-05-12 05:44:53 +00:00
|
|
|
|
|
|
|
|
; Do not reorder shuffle and binop if LHS of shuffles are of different size
|
|
|
|
|
define <2 x i32> @pr19717(<4 x i32> %in0, <2 x i32> %in1) {
|
|
|
|
|
; CHECK-LABEL: @pr19717(
|
|
|
|
|
; CHECK: shufflevector
|
|
|
|
|
; CHECK: shufflevector
|
|
|
|
|
; CHECK: mul
|
|
|
|
|
%shuffle = shufflevector <4 x i32> %in0, <4 x i32> %in0, <2 x i32> zeroinitializer
|
|
|
|
|
%shuffle4 = shufflevector <2 x i32> %in1, <2 x i32> %in1, <2 x i32> zeroinitializer
|
|
|
|
|
%mul = mul <2 x i32> %shuffle, %shuffle4
|
|
|
|
|
ret <2 x i32> %mul
|
|
|
|
|
}
|
