}
}
}
+
+ // For a comparison where the LHS is outside this block, it's possible
+ // that we've branch on it before. Used LVI to see if we can simplify
+ // the branch based on that.
+ BranchInst *CondBr = dyn_cast<BranchInst>(BB->getTerminator());
+ Constant *CondConst = dyn_cast<Constant>(CondCmp->getOperand(1));
+ if (LVI && CondBr && CondConst && CondBr->isConditional() &&
+ (!isa<Instruction>(CondCmp->getOperand(0)) ||
+ cast<Instruction>(CondCmp->getOperand(0))->getParent() != BB)) {
+ // For predecessor edge, determine if the comparison is true or false
+ // on that edge. If they're all true or all false, we can simplify the
+ // branch.
+ // FIXME: We could handle mixed true/false by duplicating code.
+ unsigned Trues = 0, Falses = 0, predcount = 0;
+ for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB);PI != PE; ++PI){
+ ++predcount;
+ LazyValueInfo::Tristate Ret =
+ LVI->getPredicateOnEdge(CondCmp->getPredicate(),
+ CondCmp->getOperand(0), CondConst, *PI, BB);
+ if (Ret == LazyValueInfo::True)
+ ++Trues;
+ else if (Ret == LazyValueInfo::False)
+ ++Falses;
+ }
+
+ // If we can determine the branch direction statically, converted
+ // the conditional branch to an unconditional one.
+ if (Trues && Trues == predcount) {
+ RemovePredecessorAndSimplify(CondBr->getSuccessor(1), BB, TD);
+ BranchInst::Create(CondBr->getSuccessor(0), CondBr);
+ CondBr->eraseFromParent();
+ return true;
+ } else if (Falses && Falses == predcount) {
+ RemovePredecessorAndSimplify(CondBr->getSuccessor(0), BB, TD);
+ BranchInst::Create(CondBr->getSuccessor(1), CondBr);
+ CondBr->eraseFromParent();
+ return true;
+ }
+ }
}
// Check for some cases that are worth simplifying. Right now we want to look
-; RUN: opt -S -jump-threading -enable-jump-threading-lvi < %s | FileCheck %s
+; RUN: opt -S -jump-threading -enable-jump-threading-lvi -dce < %s | FileCheck %s
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64"
target triple = "x86_64-apple-darwin10.4"
%toBoolnot.i.i = icmp ult i8 %1, 21 ; <i1> [#uses=1]
br i1 %toBoolnot.i.i, label %bb6.i.i, label %_ZN4llvm8dyn_castINS_11InstructionEPNS_5ValueEEENS_10cast_rettyIT_T0_E8ret_typeERKS6_.exit
+; CHECK-NOT: assert
bb6.i.i: ; preds = %bb.i
tail call void @__assert_rtn(i8* getelementptr inbounds ([5 x i8]* @_ZZN4llvm4castINS_11InstructionEPNS_5ValueEEENS_10cast_rettyIT_T0_E8ret_typeERKS6_E8__func__, i64 0, i64 0), i8* getelementptr inbounds ([31 x i8]* @.str, i64 0, i64 0), i32 202, i8* getelementptr inbounds ([59 x i8]* @.str1, i64 0, i64 0)) noreturn
unreachable