mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-25 13:35:10 +00:00
4658ce9c1f
When both constants are positive or both constants are negative, InstCombine already simplifies comparisons like this, but when it's exactly zero and -1, the operand sorting ends up reversed and the pattern fails to match. Handle that special case. Follow up for rdar://14689217 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@188512 91177308-0d34-0410-b5e6-96231b3b80d8
57 lines
1.3 KiB
LLVM
57 lines
1.3 KiB
LLVM
; RUN: opt < %s -instcombine -S | FileCheck %s
|
|
|
|
; PR1738
|
|
define i1 @test1(double %X, double %Y) {
|
|
%tmp9 = fcmp ord double %X, 0.000000e+00
|
|
%tmp13 = fcmp ord double %Y, 0.000000e+00
|
|
%bothcond = and i1 %tmp13, %tmp9
|
|
ret i1 %bothcond
|
|
; CHECK: fcmp ord double %Y, %X
|
|
}
|
|
|
|
define i1 @test2(i1 %X, i1 %Y) {
|
|
%a = and i1 %X, %Y
|
|
%b = and i1 %a, %X
|
|
ret i1 %b
|
|
; CHECK-LABEL: @test2(
|
|
; CHECK-NEXT: and i1 %X, %Y
|
|
; CHECK-NEXT: ret
|
|
}
|
|
|
|
define i32 @test3(i32 %X, i32 %Y) {
|
|
%a = and i32 %X, %Y
|
|
%b = and i32 %Y, %a
|
|
ret i32 %b
|
|
; CHECK-LABEL: @test3(
|
|
; CHECK-NEXT: and i32 %X, %Y
|
|
; CHECK-NEXT: ret
|
|
}
|
|
|
|
define i1 @test4(i32 %X) {
|
|
%a = icmp ult i32 %X, 31
|
|
%b = icmp slt i32 %X, 0
|
|
%c = and i1 %a, %b
|
|
ret i1 %c
|
|
; CHECK-LABEL: @test4(
|
|
; CHECK-NEXT: ret i1 false
|
|
}
|
|
|
|
; Make sure we don't go into an infinite loop with this test
|
|
define <4 x i32> @test5(<4 x i32> %A) {
|
|
%1 = xor <4 x i32> %A, <i32 1, i32 2, i32 3, i32 4>
|
|
%2 = and <4 x i32> <i32 1, i32 2, i32 3, i32 4>, %1
|
|
ret <4 x i32> %2
|
|
}
|
|
|
|
; Check that we combine "if x!=0 && x!=-1" into "if x+1u>1"
|
|
define i32 @test6(i64 %x) nounwind {
|
|
; CHECK: @test6
|
|
; CHECK-NEXT: add i64 %x, 1
|
|
; CHECK-NEXT: icmp ugt i64 %x.off, 1
|
|
%cmp1 = icmp ne i64 %x, -1
|
|
%not.cmp = icmp ne i64 %x, 0
|
|
%.cmp1 = and i1 %cmp1, %not.cmp
|
|
%land.ext = zext i1 %.cmp1 to i32
|
|
ret i32 %land.ext
|
|
}
|