RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-02-04 01:26:41 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Clean up previous code.

Browse Source 
Add new combination to turn seteq X, 0 -> not(cast X to bool)


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@6604 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-06-04 05:10:11 +00:00
parent 9dad6d7411
commit 40f5d70db4
1 changed files with 20 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
lib/Transforms/Scalar/InstructionCombining.cpp
View File

@ -683,8 +683,16 @@ Instruction *InstCombiner::visitSetCondInst(BinaryOperator &I) {
// integers at the end of their ranges...
//
if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
if (CI->isNullValue() && I.getOpcode() == Instruction::SetNE)
return new CastInst(Op0, Type::BoolTy, I.getName());
if (CI->isNullValue()) {
if (I.getOpcode() == Instruction::SetNE)
return new CastInst(Op0, Type::BoolTy, I.getName());
else if (I.getOpcode() == Instruction::SetEQ) {
// seteq X, 0 -> not (cast X to bool)
Instruction *Val = new CastInst(Op0, Type::BoolTy, I.getName()+".not");
InsertNewInstBefore(Val, I);
return BinaryOperator::createNot(Val, I.getName());
}
}
// Check to see if we are comparing against the minimum or maximum value...
if (CI->isMinValue()) {
@ -1064,15 +1072,16 @@ Instruction *InstCombiner::visitAllocationInst(AllocationInst &AI) {
Instruction *InstCombiner::visitBranchInst(BranchInst &BI) {
// Change br (not X), label True, label False to: br X, label False, True
if (BI.isConditional() && BinaryOperator::isNot(BI.getCondition())) {
BasicBlock *TrueDest = BI.getSuccessor(0);
BasicBlock *FalseDest = BI.getSuccessor(1);
// Swap Destinations and condition...
BI.setCondition(BinaryOperator::getNotArgument(cast<BinaryOperator>(BI.getCondition())));
BI.setSuccessor(0, FalseDest);
BI.setSuccessor(1, TrueDest);
return &BI;
}
if (BI.isConditional())
if (Value *V = dyn_castNotVal(BI.getCondition())) {
BasicBlock *TrueDest = BI.getSuccessor(0);
BasicBlock *FalseDest = BI.getSuccessor(1);
// Swap Destinations and condition...
BI.setCondition(V);
BI.setSuccessor(0, FalseDest);
BI.setSuccessor(1, TrueDest);
return &BI;
}
return 0;
}