[msan] Remove unreachable blocks before instrumenting a function.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@170883 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Evgeniy Stepanov 2012-12-21 11:18:49 +00:00
parent 042a9a2666
commit 3333e66822
4 changed files with 77 additions and 0 deletions

View File

@ -257,6 +257,11 @@ DbgDeclareInst *FindAllocaDbgDeclare(Value *V);
bool replaceDbgDeclareForAlloca(AllocaInst *AI, Value *NewAllocaAddress,
DIBuilder &Builder);
/// \brief Remove all blocks that can not be reached from the function's entry.
///
/// Returns true if any basic block was removed.
bool removeUnreachableBlocks(Function &F);
} // End llvm namespace
#endif

View File

@ -67,6 +67,7 @@
#include "llvm/Support/Debug.h"
#include "llvm/Support/raw_ostream.h"
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
#include "llvm/Transforms/Utils/Local.h"
#include "llvm/Transforms/Utils/ModuleUtils.h"
#include "llvm/Type.h"
@ -485,6 +486,13 @@ struct MemorySanitizerVisitor : public InstVisitor<MemorySanitizerVisitor> {
bool runOnFunction() {
MS.initializeCallbacks(*F.getParent());
if (!MS.TD) return false;
// In the presence of unreachable blocks, we may see Phi nodes with
// incoming nodes from such blocks. Since InstVisitor skips unreachable
// blocks, such nodes will not have any shadow value associated with them.
// It's easier to remove unreachable blocks than deal with missing shadow.
removeUnreachableBlocks(F);
// Iterate all BBs in depth-first order and create shadow instructions
// for all instructions (where applicable).
// For PHI nodes we create dummy shadow PHIs which will be finalized later.

View File

@ -15,6 +15,7 @@
#include "llvm/Transforms/Utils/Local.h"
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/Analysis/Dominators.h"
#include "llvm/Analysis/InstructionSimplify.h"
#include "llvm/Analysis/MemoryBuiltins.h"
@ -963,3 +964,43 @@ bool llvm::replaceDbgDeclareForAlloca(AllocaInst *AI, Value *NewAllocaAddress,
DDI->eraseFromParent();
return true;
}
bool llvm::removeUnreachableBlocks(Function &F) {
SmallPtrSet<BasicBlock*, 16> Reachable;
SmallVector<BasicBlock*, 128> Worklist;
Worklist.push_back(&F.getEntryBlock());
Reachable.insert(&F.getEntryBlock());
do {
BasicBlock *BB = Worklist.pop_back_val();
for (succ_iterator SI = succ_begin(BB), SE = succ_end(BB); SI != SE; ++SI)
if (Reachable.insert(*SI))
Worklist.push_back(*SI);
} while (!Worklist.empty());
if (Reachable.size() == F.size())
return false;
assert(Reachable.size() < F.size());
for (Function::iterator I = llvm::next(F.begin()), E = F.end(); I != E; ++I) {
if (Reachable.count(I))
continue;
// Remove the block as predecessor of all its reachable successors.
// Unreachable successors don't matter as they'll soon be removed, too.
for (succ_iterator SI = succ_begin(I), SE = succ_end(I); SI != SE; ++SI)
if (Reachable.count(*SI))
(*SI)->removePredecessor(I);
// Zap all instructions in this basic block.
while (!I->empty()) {
Instruction &Inst = I->back();
if (!Inst.use_empty())
Inst.replaceAllUsesWith(UndefValue::get(Inst.getType()));
I->getInstList().pop_back();
}
--I;
llvm::next(I)->eraseFromParent();
}
return true;
}

View File

@ -0,0 +1,23 @@
; RUN: opt < %s -msan -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-S128"
target triple = "x86_64-unknown-linux-gnu"
; Test that MemorySanitizer correctly handles unreachable blocks.
define i32 @Func(i32* %p) nounwind uwtable {
entry:
br label %exit
unreachable:
%x = load i32* %p
br label %exit
exit:
%z = phi i32 [ 42, %entry ], [ %x, %unreachable ]
ret i32 %z
}
; CHECK: @Func
; CHECK: store i32 0, {{.*}} @__msan_retval_tls
; CHECK: ret i32 42