mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-26 22:26:16 +00:00
a5526a9bff
The adc/sbb optimization is to able to convert following expression into a single adc/sbb instruction: (ult) ... = x + 1 // where the ult is unsigned-less-than comparison (ult) ... = x - 1 This change is to flip the "x >u y" (i.e. ugt comparison) in order to expose the adc/sbb opportunity. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167180 91177308-0d34-0410-b5e6-96231b3b80d8
47 lines
1.1 KiB
LLVM
47 lines
1.1 KiB
LLVM
; RUN: llc < %s -march=x86 | FileCheck %s
|
|
; <rdar://problem/8449754>
|
|
|
|
define i32 @test1(i32 %sum, i32 %x) nounwind readnone ssp {
|
|
entry:
|
|
; CHECK: test1:
|
|
; CHECK: cmpl %ecx, %eax
|
|
; CHECK-NOT: addl
|
|
; CHECK: adcl $0, %eax
|
|
%add4 = add i32 %x, %sum
|
|
%cmp = icmp ult i32 %add4, %x
|
|
%inc = zext i1 %cmp to i32
|
|
%z.0 = add i32 %add4, %inc
|
|
ret i32 %z.0
|
|
}
|
|
|
|
; Instcombine transforms test1 into test2:
|
|
; CHECK: test2:
|
|
; CHECK: movl
|
|
; CHECK-NEXT: addl
|
|
; CHECK-NEXT: adcl $0
|
|
; CHECK-NEXT: ret
|
|
define i32 @test2(i32 %sum, i32 %x) nounwind readnone ssp {
|
|
entry:
|
|
%uadd = call { i32, i1 } @llvm.uadd.with.overflow.i32(i32 %x, i32 %sum)
|
|
%0 = extractvalue { i32, i1 } %uadd, 0
|
|
%cmp = extractvalue { i32, i1 } %uadd, 1
|
|
%inc = zext i1 %cmp to i32
|
|
%z.0 = add i32 %0, %inc
|
|
ret i32 %z.0
|
|
}
|
|
|
|
; <rdar://problem/12579915>
|
|
define i32 @test3(i32 %x, i32 %y, i32 %res) nounwind uwtable readnone ssp {
|
|
entry:
|
|
%cmp = icmp ugt i32 %x, %y
|
|
%dec = sext i1 %cmp to i32
|
|
%dec.res = add nsw i32 %dec, %res
|
|
ret i32 %dec.res
|
|
; CHECK: test3:
|
|
; CHECK: cmpl
|
|
; CHECK: sbbl
|
|
; CHECK: ret
|
|
}
|
|
|
|
declare { i32, i1 } @llvm.uadd.with.overflow.i32(i32, i32) nounwind readnone
|