1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-26 12:43:36 +01:00
llvm-mirror/test/Transforms/Reassociate/inverses.ll
Arthur Eubanks c01a5baad9 [DIE] Remove DeadInstEliminationPass
This pass is like DeadCodeEliminationPass, but only does one pass
through a function instead of iterating on users of eliminated
instructions.

DeadCodeEliminationPass should be used in all cases.

Reviewed By: asbirlea

Differential Revision: https://reviews.llvm.org/D87933
2020-09-21 12:12:25 -07:00

63 lines
1.4 KiB
LLVM

; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -reassociate -dce -S | FileCheck %s
; (A&B)&~A == 0
define i32 @test1(i32 %a, i32 %b) {
; CHECK-LABEL: @test1(
; CHECK-NEXT: ret i32 0
;
%t2 = and i32 %b, %a
%t4 = xor i32 %a, -1
%t5 = and i32 %t2, %t4
ret i32 %t5
}
define <2 x i32> @not_op_vec_undef(<2 x i32> %a, <2 x i32> %b) {
; CHECK-LABEL: @not_op_vec_undef(
; CHECK-NEXT: ret <2 x i32> zeroinitializer
;
%t2 = and <2 x i32> %b, %a
%t4 = xor <2 x i32> %a, <i32 -1, i32 undef>
%t5 = and <2 x i32> %t2, %t4
ret <2 x i32> %t5
}
; A&~A == 0
define i32 @test2(i32 %a, i32 %b) {
; CHECK-LABEL: @test2(
; CHECK-NEXT: ret i32 0
;
%t1 = and i32 %a, 1234
%t2 = and i32 %b, %t1
%t4 = xor i32 %a, -1
%t5 = and i32 %t2, %t4
ret i32 %t5
}
; (b+(a+1234))+-a -> b+1234
define i32 @test3(i32 %b, i32 %a) {
; CHECK-LABEL: @test3(
; CHECK-NEXT: [[T5:%.*]] = add i32 [[B:%.*]], 1234
; CHECK-NEXT: ret i32 [[T5]]
;
%t1 = add i32 %a, 1234
%t2 = add i32 %b, %t1
%t4 = sub i32 0, %a
%t5 = add i32 %t2, %t4
ret i32 %t5
}
; (b+(a+1234))+~a -> b+1233
define i32 @test4(i32 %b, i32 %a) {
; CHECK-LABEL: @test4(
; CHECK-NEXT: [[T5:%.*]] = add i32 [[B:%.*]], 1233
; CHECK-NEXT: ret i32 [[T5]]
;
%t1 = add i32 %a, 1234
%t2 = add i32 %b, %t1
%t4 = xor i32 %a, -1
%t5 = add i32 %t2, %t4
ret i32 %t5
}