mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-25 14:32:53 +00:00
1afcace3a3
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
110 lines
4.2 KiB
LLVM
110 lines
4.2 KiB
LLVM
; RUN: opt < %s -instcombine -S | FileCheck %s
|
|
|
|
define <4 x float> @test1(<4 x float> %v1) {
|
|
; CHECK: @test1
|
|
; 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
|
|
}
|
|
|
|
define <4 x float> @test2(<4 x float> %v1) {
|
|
; CHECK: @test2
|
|
; 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
|
|
}
|
|
|
|
define float @test3(<4 x float> %A, <4 x float> %B, float %f) {
|
|
; CHECK: @test3
|
|
; CHECK: ret float %f
|
|
%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
|
|
ret float %E
|
|
}
|
|
|
|
define i32 @test4(<4 x i32> %X) {
|
|
; CHECK: @test4
|
|
; CHECK-NEXT: extractelement
|
|
; CHECK-NEXT: ret
|
|
%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
|
|
}
|
|
|
|
define i32 @test5(<4 x i32> %X) {
|
|
; CHECK: @test5
|
|
; CHECK-NEXT: extractelement
|
|
; CHECK-NEXT: ret
|
|
%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
|
|
}
|
|
|
|
define float @test6(<4 x float> %X) {
|
|
; CHECK: @test6
|
|
; CHECK-NEXT: extractelement
|
|
; CHECK-NEXT: ret
|
|
%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
|
|
%tmp152.i53900.i = bitcast <4 x i32> %tmp152.i53899.i to <4 x float>
|
|
%tmp34 = extractelement <4 x float> %tmp152.i53900.i, i32 0
|
|
ret float %tmp34
|
|
}
|
|
|
|
define <4 x float> @test7(<4 x float> %tmp45.i) {
|
|
; CHECK: @test7
|
|
; CHECK-NEXT: ret <4 x float> %tmp45.i
|
|
%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
|
|
}
|
|
|
|
; This should turn into a single shuffle.
|
|
define <4 x float> @test8(<4 x float> %tmp, <4 x float> %tmp1) {
|
|
; CHECK: @test8
|
|
; 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
|
|
}
|
|
|
|
; 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 {
|
|
; CHECK: @test9
|
|
; 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
|
|
}
|
|
|
|
; Same as test9, but make sure that "undef" mask values are not confused with
|
|
; 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 {
|
|
; CHECK: @test9a
|
|
; CHECK-NEXT: shufflevector
|
|
; CHECK-NEXT: shufflevector
|
|
; CHECK-NEXT: ret
|
|
%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]
|
|
%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
|
|
}
|
|
|
|
; Redundant vector splats should be removed. Radar 8597790.
|
|
define <4 x i32> @test10(<4 x i32> %tmp5) nounwind {
|
|
; CHECK: @test10
|
|
; 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
|
|
}
|