RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-16 08:29:43 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fix bug: TailDuplicate/2003-08-31-UnreachableBlocks.ll

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8276 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-08-31 21:17:44 +00:00
parent 84991f332e
commit 3186d275f7
1 changed files with 5 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
lib/Transforms/Scalar/TailDuplication.cpp
View File

@ -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