a2a0089ac3
If we're loading a constant value, print the constant (and the zero upper elements) instead of just the shuffle mask. This did require me to move the shuffle mask handling into addConstantComments as we can't handle this in the MC layer.
98 lines
3.3 KiB
LLVM
98 lines
3.3 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
|
|
; RUN: llc < %s -mtriple=i686-- -mattr=+sse4.1 | FileCheck %s
|
|
|
|
; Test that when we don't -enable-unsafe-fp-math, we don't do the optimization
|
|
; -0 - (A - B) to (B - A) because A==B, -0 != 0
|
|
|
|
define float @negfp(float %a, float %b) nounwind {
|
|
; CHECK-LABEL: negfp:
|
|
; CHECK: # %bb.0: # %entry
|
|
; CHECK-NEXT: pushl %eax
|
|
; CHECK-NEXT: movss {{.*#+}} xmm0 = mem[0],zero,zero,zero
|
|
; CHECK-NEXT: subss {{[0-9]+}}(%esp), %xmm0
|
|
; CHECK-NEXT: xorps {{\.?LCPI[0-9]+_[0-9]+}}, %xmm0
|
|
; CHECK-NEXT: movss %xmm0, (%esp)
|
|
; CHECK-NEXT: flds (%esp)
|
|
; CHECK-NEXT: popl %eax
|
|
; CHECK-NEXT: retl
|
|
entry:
|
|
%sub = fsub float %a, %b ; <float> [#uses=1]
|
|
%neg = fsub float -0.000000e+00, %sub ; <float> [#uses=1]
|
|
ret float %neg
|
|
}
|
|
|
|
; This may infinite loop if isNegatibleForFree and getNegatedExpression are conflicted.
|
|
|
|
define double @negation_propagation(ptr %arg, double %arg1, double %arg2) nounwind {
|
|
; CHECK-LABEL: negation_propagation:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: pushl %ebp
|
|
; CHECK-NEXT: movl %esp, %ebp
|
|
; CHECK-NEXT: andl $-8, %esp
|
|
; CHECK-NEXT: subl $8, %esp
|
|
; CHECK-NEXT: movsd {{.*#+}} xmm0 = [1.0E+0,0.0E+0]
|
|
; CHECK-NEXT: divsd 12(%ebp), %xmm0
|
|
; CHECK-NEXT: movsd {{.*#+}} xmm1 = mem[0],zero
|
|
; CHECK-NEXT: mulsd %xmm0, %xmm1
|
|
; CHECK-NEXT: movapd %xmm0, %xmm2
|
|
; CHECK-NEXT: mulsd %xmm0, %xmm2
|
|
; CHECK-NEXT: mulsd %xmm0, %xmm2
|
|
; CHECK-NEXT: subsd %xmm2, %xmm1
|
|
; CHECK-NEXT: movsd %xmm1, (%esp)
|
|
; CHECK-NEXT: fldl (%esp)
|
|
; CHECK-NEXT: movl %ebp, %esp
|
|
; CHECK-NEXT: popl %ebp
|
|
; CHECK-NEXT: retl
|
|
%t = fdiv double 1.0, %arg1
|
|
%t7 = fmul double %t, %arg2
|
|
%t10 = fneg double %t7
|
|
%t11 = fmul double %t, %t
|
|
%t13 = fsub double %t11, %t
|
|
%t14 = fneg double %t
|
|
%t15 = fmul double %t, %t14
|
|
%t16 = fmul double %t, %t15
|
|
%t18 = fadd double %t16, %t7
|
|
ret double %t18
|
|
}
|
|
|
|
; This would crash because the negated expression for %sub4
|
|
; creates a new use of %sub1 and that alters the negated cost
|
|
|
|
define float @fdiv_extra_use_changes_cost(float %a0, float %a1, float %a2) nounwind {
|
|
; CHECK-LABEL: fdiv_extra_use_changes_cost:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: pushl %eax
|
|
; CHECK-NEXT: movss {{.*#+}} xmm0 = mem[0],zero,zero,zero
|
|
; CHECK-NEXT: movss {{.*#+}} xmm1 = mem[0],zero,zero,zero
|
|
; CHECK-NEXT: subss {{[0-9]+}}(%esp), %xmm1
|
|
; CHECK-NEXT: movaps %xmm1, %xmm2
|
|
; CHECK-NEXT: mulss %xmm0, %xmm2
|
|
; CHECK-NEXT: subss %xmm1, %xmm0
|
|
; CHECK-NEXT: divss %xmm2, %xmm0
|
|
; CHECK-NEXT: movss %xmm0, (%esp)
|
|
; CHECK-NEXT: flds (%esp)
|
|
; CHECK-NEXT: popl %eax
|
|
; CHECK-NEXT: retl
|
|
%sub1 = fsub fast float %a0, %a1
|
|
%mul2 = fmul fast float %sub1, %a2
|
|
%neg = fneg fast float %a0
|
|
%add3 = fadd fast float %a1, %neg
|
|
%sub4 = fadd fast float %add3, %a2
|
|
%div5 = fdiv fast float %sub4, %mul2
|
|
ret float %div5
|
|
}
|
|
|
|
; PR55758 - this is not -(-X)
|
|
|
|
define <2 x i64> @fneg_mismatched_sizes(<4 x float> %x) {
|
|
; CHECK-LABEL: fneg_mismatched_sizes:
|
|
; CHECK: # %bb.0:
|
|
; CHECK-NEXT: xorps {{\.?LCPI[0-9]+_[0-9]+}}, %xmm0
|
|
; CHECK-NEXT: xorps {{\.?LCPI[0-9]+_[0-9]+}}, %xmm0
|
|
; CHECK-NEXT: retl
|
|
%n = fneg <4 x float> %x
|
|
%b = bitcast <4 x float> %n to <2 x i64>
|
|
%r = xor <2 x i64> %b, <i64 -9223372036854775808, i64 -9223372036854775808>
|
|
ret <2 x i64> %r
|
|
}
|