llvm/test/Transforms/InstCombine/and-or.ll
Bill Wendling b3833d1eb9 Implement ((A|B)&1)|(B&-2) -> (A&1) | B transformation. This also takes care of
permutations of this pattern.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@60312 91177308-0d34-0410-b5e6-96231b3b80d8
2008-12-01 01:07:11 +00:00

40 lines
1.1 KiB
LLVM

; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep {and i32 %a, 1} | count 4
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep {or i32 %0, %b} | count 4
define i32 @func1(i32 %a, i32 %b) nounwind readnone {
entry:
%0 = or i32 %b, %a ; <i32> [#uses=1]
%1 = and i32 %0, 1 ; <i32> [#uses=1]
%2 = and i32 %b, -2 ; <i32> [#uses=1]
%3 = or i32 %1, %2 ; <i32> [#uses=1]
ret i32 %3
}
define i32 @func2(i32 %a, i32 %b) nounwind readnone {
entry:
%0 = or i32 %a, %b ; <i32> [#uses=1]
%1 = and i32 1, %0 ; <i32> [#uses=1]
%2 = and i32 -2, %b ; <i32> [#uses=1]
%3 = or i32 %1, %2 ; <i32> [#uses=1]
ret i32 %3
}
define i32 @func3(i32 %a, i32 %b) nounwind readnone {
entry:
%0 = or i32 %b, %a ; <i32> [#uses=1]
%1 = and i32 %0, 1 ; <i32> [#uses=1]
%2 = and i32 %b, -2 ; <i32> [#uses=1]
%3 = or i32 %2, %1 ; <i32> [#uses=1]
ret i32 %3
}
define i32 @func4(i32 %a, i32 %b) nounwind readnone {
entry:
%0 = or i32 %a, %b ; <i32> [#uses=1]
%1 = and i32 1, %0 ; <i32> [#uses=1]
%2 = and i32 -2, %b ; <i32> [#uses=1]
%3 = or i32 %2, %1 ; <i32> [#uses=1]
ret i32 %3
}