mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-15 20:29:48 +00:00
d24d326705
which have successfully round-tripped through the combine phase, and use this to ensure all operands to DAG nodes are visited by the combiner, even if they are only added during the combine phase. This is critical to have the combiner reach nodes that are *introduced* during combining. Previously these would sometimes be visited and sometimes not be visited based on whether they happened to end up on the worklist or not. Now we always run them through the combiner. This fixes quite a few bad codegen test cases lurking in the suite while also being more principled. Among these, the TLS codegeneration is particularly exciting for programs that have this in the critical path like TSan-instrumented binaries (although I think they engineer to use a different TLS that is faster anyways). I've tried to check for compile-time regressions here by running llc over a merged (but not LTO-ed) clang bitcode file and observed at most a 3% slowdown in llc. Given that this is essentially a worst case (none of opt or clang are running at this phase) I think this is tolerable. The actual LTO case should be even less costly, and the cost in normal compilation should be negligible. With this combining logic, it is possible to re-legalize as we combine which is necessary to implement PSHUFB formation on x86 as a post-legalize DAG combine (my ultimate goal). Differential Revision: http://reviews.llvm.org/D4638 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@213898 91177308-0d34-0410-b5e6-96231b3b80d8
75 lines
2.9 KiB
LLVM
75 lines
2.9 KiB
LLVM
; RUN: llc < %s -mtriple=x86_64-apple-darwin | FileCheck %s
|
|
|
|
define <4 x float> @foo(<4 x float> %val, <4 x float> %test) nounwind {
|
|
; CHECK-LABEL: LCPI0_0:
|
|
; CHECK-NEXT: .long 1065353216 ## 0x3f800000
|
|
; CHECK-NEXT: .long 1065353216 ## 0x3f800000
|
|
; CHECK-NEXT: .long 1065353216 ## 0x3f800000
|
|
; CHECK-NEXT: .long 1065353216 ## 0x3f800000
|
|
; CHECK-LABEL: foo:
|
|
; CHECK: cmpeqps %xmm1, %xmm0
|
|
; CHECK-NEXT: andps LCPI0_0(%rip), %xmm0
|
|
; CHECK-NEXT: retq
|
|
|
|
%cmp = fcmp oeq <4 x float> %val, %test
|
|
%ext = zext <4 x i1> %cmp to <4 x i32>
|
|
%result = sitofp <4 x i32> %ext to <4 x float>
|
|
ret <4 x float> %result
|
|
}
|
|
|
|
; Make sure the operation doesn't try to get folded when the sizes don't match,
|
|
; as that ends up crashing later when trying to form a bitcast operation for
|
|
; the folded nodes.
|
|
define void @foo1(<4 x float> %val, <4 x float> %test, <4 x double>* %p) nounwind {
|
|
; CHECK-LABEL: LCPI1_0:
|
|
; CHECK-NEXT: .long 1 ## 0x1
|
|
; CHECK-NEXT: .long 1 ## 0x1
|
|
; CHECK-NEXT: .long 1 ## 0x1
|
|
; CHECK-NEXT: .long 1 ## 0x1
|
|
; CHECK-LABEL: foo1:
|
|
; FIXME: The operation gets scalarized. If/when the compiler learns to better
|
|
; use [V]CVTDQ2PD, this will need updated.
|
|
; CHECK: cvtsi2sdq
|
|
; CHECK: cvtsi2sdq
|
|
; CHECK: cvtsi2sdq
|
|
; CHECK: cvtsi2sdq
|
|
%cmp = fcmp oeq <4 x float> %val, %test
|
|
%ext = zext <4 x i1> %cmp to <4 x i32>
|
|
%result = sitofp <4 x i32> %ext to <4 x double>
|
|
store <4 x double> %result, <4 x double>* %p
|
|
ret void
|
|
}
|
|
|
|
; Also test the general purpose constant folding of int->fp.
|
|
define void @foo2(<4 x float>* noalias %result) nounwind {
|
|
; CHECK-LABEL: LCPI2_0:
|
|
; CHECK-NEXT: .long 1082130432 ## float 4.000000e+00
|
|
; CHECK-NEXT: .long 1084227584 ## float 5.000000e+00
|
|
; CHECK-NEXT: .long 1086324736 ## float 6.000000e+00
|
|
; CHECK-NEXT: .long 1088421888 ## float 7.000000e+00
|
|
; CHECK-LABEL: foo2:
|
|
; CHECK: movaps LCPI2_0(%rip), %xmm0
|
|
|
|
%val = uitofp <4 x i32> <i32 4, i32 5, i32 6, i32 7> to <4 x float>
|
|
store <4 x float> %val, <4 x float>* %result
|
|
ret void
|
|
}
|
|
|
|
; Fold explicit AND operations when the constant isn't a splat of a single
|
|
; scalar value like what the zext creates.
|
|
define <4 x float> @foo3(<4 x float> %val, <4 x float> %test) nounwind {
|
|
; CHECK-LABEL: LCPI3_0:
|
|
; CHECK-NEXT: .long 1065353216 ## 0x3f800000
|
|
; CHECK-NEXT: .long 0 ## 0x0
|
|
; CHECK-NEXT: .long 1065353216 ## 0x3f800000
|
|
; CHECK-NEXT: .long 0 ## 0x0
|
|
; CHECK-LABEL: foo3:
|
|
; CHECK: cmpeqps %xmm1, %xmm0
|
|
; CHECK-NEXT: andps LCPI3_0(%rip), %xmm0
|
|
%cmp = fcmp oeq <4 x float> %val, %test
|
|
%ext = zext <4 x i1> %cmp to <4 x i32>
|
|
%and = and <4 x i32> %ext, <i32 255, i32 256, i32 257, i32 258>
|
|
%result = sitofp <4 x i32> %and to <4 x float>
|
|
ret <4 x float> %result
|
|
}
|