From 3186d275f73fb0ce2ee0fea6c688daafc82ffac2 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Sun, 31 Aug 2003 21:17:44 +0000 Subject: [PATCH] Fix bug: TailDuplicate/2003-08-31-UnreachableBlocks.ll git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8276 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Transforms/Scalar/TailDuplication.cpp | 7 +++++-- 1 file changed, 5 insertions(+), 2 deletions(-) diff --git a/lib/Transforms/Scalar/TailDuplication.cpp b/lib/Transforms/Scalar/TailDuplication.cpp index 9427fc664ad..688119805ac 100644 --- a/lib/Transforms/Scalar/TailDuplication.cpp +++ b/lib/Transforms/Scalar/TailDuplication.cpp @@ -12,6 +12,7 @@ //===----------------------------------------------------------------------===// #include "llvm/Transforms/Scalar.h" +#include "llvm/Constant.h" #include "llvm/Function.h" #include "llvm/iPHINode.h" #include "llvm/iTerminators.h" @@ -268,8 +269,10 @@ Value *TailDup::GetValueInBlock(BasicBlock *BB, Value *OrigVal, ValueHolder &BBVal = ValueMap[BB]; if (BBVal) return BBVal; // Value already computed for this block? - assert(pred_begin(BB) != pred_end(BB) && - "Propagating PHI nodes to unreachable blocks?"); + // If this block has no predecessors, then it must be unreachable, thus, it + // doesn't matter which value we use. + if (pred_begin(BB) == pred_end(BB)) + return BBVal = Constant::getNullValue(OrigVal->getType()); // If there is no value already available in this basic block, we need to // either reuse a value from an incoming, dominating, basic block, or we need