maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Fix for PR2479: correctly optimize expressions like (a > 13) & (a == 

15).

See also PR1800, which is about the signed case.

llvm-svn: 52608
This commit is contained in:
Eli Friedman 2008-06-21 23:36:13 +00:00
parent 7fa2758b45
commit d3449df326
2 changed files with 12 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
llvm/lib/Transforms/Scalar/InstructionCombining.cpp
View File

@ -3691,8 +3691,7 @@ Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
case ICmpInst::ICMP_UGT:
switch (RHSCC) {
default: assert(0 && "Unknown integer condition code!");
case ICmpInst::ICMP_EQ: // (X u> 13 & X == 15) -> X > 13
return ReplaceInstUsesWith(I, LHS);
case ICmpInst::ICMP_EQ: // (X u> 13 & X == 15) -> X == 15
case ICmpInst::ICMP_UGT: // (X u> 13 & X u> 15) -> X u> 15
return ReplaceInstUsesWith(I, RHS);
case ICmpInst::ICMP_SGT: // (X u> 13 & X s> 15) -> no change

11
llvm/test/Transforms/InstCombine/2008-06-21-CompareMiscomp.ll Normal file
View File

@ -0,0 +1,11 @@
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep {icmp eq i32 %In, 15}
; PR2479
; (See also PR1800.)
define i1 @test(i32 %In) {
%c1 = icmp ugt i32 %In, 13
%c2 = icmp eq i32 %In, 15
%V = and i1 %c1, %c2
ret i1 %V
}