mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 11:02:59 +02:00
2aa1295ade
Particularly, it addresses cases where Reassociate breaks Subtracts but then fails to optimize combinations like I1 + -I2 where I1 and I2 have the same rank and are identical. Patch by Dmitri Shtilman. llvm-svn: 219092
16 lines
310 B
LLVM
16 lines
310 B
LLVM
; RUN: opt < %s -reassociate -instcombine -S | FileCheck %s
|
|
|
|
; Test that we can turn things like A*B + X - A*B -> X.
|
|
|
|
define i32 @test1(i32 %a, i32 %b, i32 %x) {
|
|
; CHECK-LABEL: test1
|
|
; CHECK: ret i32 %x
|
|
|
|
%c = mul i32 %a, %b
|
|
%d = add i32 %c, %x
|
|
%c1 = mul i32 %a, %b
|
|
%f = sub i32 %d, %c1
|
|
ret i32 %f
|
|
}
|
|
|