mirror of
https://github.com/RPCSX/llvm.git
synced 2024-12-02 08:46:23 +00:00
d62414c654
This is a result of Benjamin's work on ValueTracking. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@147259 91177308-0d34-0410-b5e6-96231b3b80d8
223 lines
6.5 KiB
LLVM
223 lines
6.5 KiB
LLVM
; RUN: opt %s -instcombine -S | FileCheck %s
|
|
|
|
%overflow.result = type {i8, i1}
|
|
|
|
declare %overflow.result @llvm.uadd.with.overflow.i8(i8, i8)
|
|
declare %overflow.result @llvm.umul.with.overflow.i8(i8, i8)
|
|
declare double @llvm.powi.f64(double, i32) nounwind readonly
|
|
declare i32 @llvm.cttz.i32(i32, i1) nounwind readnone
|
|
declare i32 @llvm.ctlz.i32(i32, i1) nounwind readnone
|
|
declare i32 @llvm.ctpop.i32(i32) nounwind readnone
|
|
declare i8 @llvm.ctlz.i8(i8, i1) nounwind readnone
|
|
|
|
define i8 @uaddtest1(i8 %A, i8 %B) {
|
|
%x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %A, i8 %B)
|
|
%y = extractvalue %overflow.result %x, 0
|
|
ret i8 %y
|
|
; CHECK: @uaddtest1
|
|
; CHECK-NEXT: %y = add i8 %A, %B
|
|
; CHECK-NEXT: ret i8 %y
|
|
}
|
|
|
|
define i8 @uaddtest2(i8 %A, i8 %B, i1* %overflowPtr) {
|
|
%and.A = and i8 %A, 127
|
|
%and.B = and i8 %B, 127
|
|
%x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %and.A, i8 %and.B)
|
|
%y = extractvalue %overflow.result %x, 0
|
|
%z = extractvalue %overflow.result %x, 1
|
|
store i1 %z, i1* %overflowPtr
|
|
ret i8 %y
|
|
; CHECK: @uaddtest2
|
|
; CHECK-NEXT: %and.A = and i8 %A, 127
|
|
; CHECK-NEXT: %and.B = and i8 %B, 127
|
|
; CHECK-NEXT: %x = add nuw i8 %and.A, %and.B
|
|
; CHECK-NEXT: store i1 false, i1* %overflowPtr
|
|
; CHECK-NEXT: ret i8 %x
|
|
}
|
|
|
|
define i8 @uaddtest3(i8 %A, i8 %B, i1* %overflowPtr) {
|
|
%or.A = or i8 %A, -128
|
|
%or.B = or i8 %B, -128
|
|
%x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %or.A, i8 %or.B)
|
|
%y = extractvalue %overflow.result %x, 0
|
|
%z = extractvalue %overflow.result %x, 1
|
|
store i1 %z, i1* %overflowPtr
|
|
ret i8 %y
|
|
; CHECK: @uaddtest3
|
|
; CHECK-NEXT: %or.A = or i8 %A, -128
|
|
; CHECK-NEXT: %or.B = or i8 %B, -128
|
|
; CHECK-NEXT: %x = add i8 %or.A, %or.B
|
|
; CHECK-NEXT: store i1 true, i1* %overflowPtr
|
|
; CHECK-NEXT: ret i8 %x
|
|
}
|
|
|
|
define i8 @uaddtest4(i8 %A, i1* %overflowPtr) {
|
|
%x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 undef, i8 %A)
|
|
%y = extractvalue %overflow.result %x, 0
|
|
%z = extractvalue %overflow.result %x, 1
|
|
store i1 %z, i1* %overflowPtr
|
|
ret i8 %y
|
|
; CHECK: @uaddtest4
|
|
; CHECK-NEXT: ret i8 undef
|
|
}
|
|
|
|
define i8 @uaddtest5(i8 %A, i1* %overflowPtr) {
|
|
%x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 0, i8 %A)
|
|
%y = extractvalue %overflow.result %x, 0
|
|
%z = extractvalue %overflow.result %x, 1
|
|
store i1 %z, i1* %overflowPtr
|
|
ret i8 %y
|
|
; CHECK: @uaddtest5
|
|
; CHECK: ret i8 %A
|
|
}
|
|
|
|
define i1 @uaddtest6(i8 %A, i8 %B) {
|
|
%x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %A, i8 -4)
|
|
%z = extractvalue %overflow.result %x, 1
|
|
ret i1 %z
|
|
; CHECK: @uaddtest6
|
|
; CHECK-NEXT: %z = icmp ugt i8 %A, 3
|
|
; CHECK-NEXT: ret i1 %z
|
|
}
|
|
|
|
define i8 @uaddtest7(i8 %A, i8 %B) {
|
|
%x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %A, i8 %B)
|
|
%z = extractvalue %overflow.result %x, 0
|
|
ret i8 %z
|
|
; CHECK: @uaddtest7
|
|
; CHECK-NEXT: %z = add i8 %A, %B
|
|
; CHECK-NEXT: ret i8 %z
|
|
}
|
|
|
|
|
|
define i8 @umultest1(i8 %A, i1* %overflowPtr) {
|
|
%x = call %overflow.result @llvm.umul.with.overflow.i8(i8 0, i8 %A)
|
|
%y = extractvalue %overflow.result %x, 0
|
|
%z = extractvalue %overflow.result %x, 1
|
|
store i1 %z, i1* %overflowPtr
|
|
ret i8 %y
|
|
; CHECK: @umultest1
|
|
; CHECK-NEXT: store i1 false, i1* %overflowPtr
|
|
; CHECK-NEXT: ret i8 0
|
|
}
|
|
|
|
define i8 @umultest2(i8 %A, i1* %overflowPtr) {
|
|
%x = call %overflow.result @llvm.umul.with.overflow.i8(i8 1, i8 %A)
|
|
%y = extractvalue %overflow.result %x, 0
|
|
%z = extractvalue %overflow.result %x, 1
|
|
store i1 %z, i1* %overflowPtr
|
|
ret i8 %y
|
|
; CHECK: @umultest2
|
|
; CHECK-NEXT: store i1 false, i1* %overflowPtr
|
|
; CHECK-NEXT: ret i8 %A
|
|
}
|
|
|
|
%ov.result.32 = type { i32, i1 }
|
|
declare %ov.result.32 @llvm.umul.with.overflow.i32(i32, i32) nounwind readnone
|
|
|
|
define i32 @umultest3(i32 %n) nounwind {
|
|
%shr = lshr i32 %n, 2
|
|
%mul = call %ov.result.32 @llvm.umul.with.overflow.i32(i32 %shr, i32 3)
|
|
%ov = extractvalue %ov.result.32 %mul, 1
|
|
%res = extractvalue %ov.result.32 %mul, 0
|
|
%ret = select i1 %ov, i32 -1, i32 %res
|
|
ret i32 %ret
|
|
; CHECK: @umultest3
|
|
; CHECK-NEXT: shr
|
|
; CHECK-NEXT: mul nuw
|
|
; CHECK-NEXT: ret
|
|
}
|
|
|
|
define i32 @umultest4(i32 %n) nounwind {
|
|
%shr = lshr i32 %n, 1
|
|
%mul = call %ov.result.32 @llvm.umul.with.overflow.i32(i32 %shr, i32 4)
|
|
%ov = extractvalue %ov.result.32 %mul, 1
|
|
%res = extractvalue %ov.result.32 %mul, 0
|
|
%ret = select i1 %ov, i32 -1, i32 %res
|
|
ret i32 %ret
|
|
; CHECK: @umultest4
|
|
; CHECK: umul.with.overflow
|
|
}
|
|
|
|
define void @powi(double %V, double *%P) {
|
|
entry:
|
|
%A = tail call double @llvm.powi.f64(double %V, i32 -1) nounwind
|
|
store volatile double %A, double* %P
|
|
|
|
%B = tail call double @llvm.powi.f64(double %V, i32 0) nounwind
|
|
store volatile double %B, double* %P
|
|
|
|
%C = tail call double @llvm.powi.f64(double %V, i32 1) nounwind
|
|
store volatile double %C, double* %P
|
|
ret void
|
|
; CHECK: @powi
|
|
; CHECK: %A = fdiv double 1.0{{.*}}, %V
|
|
; CHECK: store volatile double %A,
|
|
; CHECK: store volatile double 1.0
|
|
; CHECK: store volatile double %V
|
|
}
|
|
|
|
define i32 @cttz(i32 %a) {
|
|
entry:
|
|
%or = or i32 %a, 8
|
|
%and = and i32 %or, -8
|
|
%count = tail call i32 @llvm.cttz.i32(i32 %and, i1 true) nounwind readnone
|
|
ret i32 %count
|
|
; CHECK: @cttz
|
|
; CHECK-NEXT: entry:
|
|
; CHECK-NEXT: ret i32 3
|
|
}
|
|
|
|
define i8 @ctlz(i8 %a) {
|
|
entry:
|
|
%or = or i8 %a, 32
|
|
%and = and i8 %or, 63
|
|
%count = tail call i8 @llvm.ctlz.i8(i8 %and, i1 true) nounwind readnone
|
|
ret i8 %count
|
|
; CHECK: @ctlz
|
|
; CHECK-NEXT: entry:
|
|
; CHECK-NEXT: ret i8 2
|
|
}
|
|
|
|
define void @cmp.simplify(i32 %a, i32 %b, i1* %c) {
|
|
entry:
|
|
%lz = tail call i32 @llvm.ctlz.i32(i32 %a, i1 false) nounwind readnone
|
|
%lz.cmp = icmp eq i32 %lz, 32
|
|
store volatile i1 %lz.cmp, i1* %c
|
|
%tz = tail call i32 @llvm.cttz.i32(i32 %a, i1 false) nounwind readnone
|
|
%tz.cmp = icmp ne i32 %tz, 32
|
|
store volatile i1 %tz.cmp, i1* %c
|
|
%pop = tail call i32 @llvm.ctpop.i32(i32 %b) nounwind readnone
|
|
%pop.cmp = icmp eq i32 %pop, 0
|
|
store volatile i1 %pop.cmp, i1* %c
|
|
ret void
|
|
; CHECK: @cmp.simplify
|
|
; CHECK-NEXT: entry:
|
|
; CHECK-NEXT: %lz.cmp = icmp eq i32 %a, 0
|
|
; CHECK-NEXT: store volatile i1 %lz.cmp, i1* %c
|
|
; CHECK-NEXT: %tz.cmp = icmp ne i32 %a, 0
|
|
; CHECK-NEXT: store volatile i1 %tz.cmp, i1* %c
|
|
; CHECK-NEXT: %pop.cmp = icmp eq i32 %b, 0
|
|
; CHECK-NEXT: store volatile i1 %pop.cmp, i1* %c
|
|
}
|
|
|
|
define i32 @cttz_simplify1a(i32 %x) nounwind readnone ssp {
|
|
%tmp1 = tail call i32 @llvm.ctlz.i32(i32 %x, i1 false)
|
|
%shr3 = lshr i32 %tmp1, 5
|
|
ret i32 %shr3
|
|
|
|
; CHECK: @cttz_simplify1a
|
|
; CHECK: icmp eq i32 %x, 0
|
|
; CHECK-NEXT: zext i1
|
|
; CHECK-NEXT: ret i32
|
|
}
|
|
|
|
define i32 @cttz_simplify1b(i32 %x) nounwind readnone ssp {
|
|
%tmp1 = tail call i32 @llvm.ctlz.i32(i32 %x, i1 true)
|
|
%shr3 = lshr i32 %tmp1, 5
|
|
ret i32 %shr3
|
|
|
|
; CHECK: @cttz_simplify1b
|
|
; CHECK-NEXT: ret i32 0
|
|
}
|