2007-08-02 18:11:11 +00:00
|
|
|
//===- DeadStoreElimination.cpp - Fast Dead Store Elimination -------------===//
|
2007-07-11 00:46:18 +00:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2007-07-11 00:46:18 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements a trivial dead store elimination that only considers
|
|
|
|
// basic-block local redundant stores.
|
|
|
|
//
|
|
|
|
// FIXME: This should eventually be extended to be a post-dominator tree
|
|
|
|
// traversal. Doing so would be pretty trivial.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2007-08-01 06:36:51 +00:00
|
|
|
#define DEBUG_TYPE "dse"
|
2007-07-11 00:46:18 +00:00
|
|
|
#include "llvm/Transforms/Scalar.h"
|
2007-07-12 21:41:30 +00:00
|
|
|
#include "llvm/Constants.h"
|
2007-07-11 00:46:18 +00:00
|
|
|
#include "llvm/Function.h"
|
2010-11-30 23:43:23 +00:00
|
|
|
#include "llvm/GlobalVariable.h"
|
2007-07-11 00:46:18 +00:00
|
|
|
#include "llvm/Instructions.h"
|
2008-01-29 06:18:36 +00:00
|
|
|
#include "llvm/IntrinsicInst.h"
|
2007-07-11 00:46:18 +00:00
|
|
|
#include "llvm/Pass.h"
|
2007-07-11 23:19:17 +00:00
|
|
|
#include "llvm/Analysis/AliasAnalysis.h"
|
2011-10-22 21:59:35 +00:00
|
|
|
#include "llvm/Analysis/CaptureTracking.h"
|
2008-07-28 16:14:26 +00:00
|
|
|
#include "llvm/Analysis/Dominators.h"
|
2009-10-27 20:05:49 +00:00
|
|
|
#include "llvm/Analysis/MemoryBuiltins.h"
|
2007-07-11 00:46:18 +00:00
|
|
|
#include "llvm/Analysis/MemoryDependenceAnalysis.h"
|
2010-11-30 23:05:20 +00:00
|
|
|
#include "llvm/Analysis/ValueTracking.h"
|
2007-07-11 23:19:17 +00:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2007-07-11 00:46:18 +00:00
|
|
|
#include "llvm/Transforms/Utils/Local.h"
|
2010-12-06 21:13:51 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/ADT/SmallPtrSet.h"
|
|
|
|
#include "llvm/ADT/Statistic.h"
|
2011-11-05 10:48:42 +00:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2007-07-11 00:46:18 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
|
|
|
STATISTIC(NumFastStores, "Number of stores deleted");
|
|
|
|
STATISTIC(NumFastOther , "Number of other instrs removed");
|
|
|
|
|
|
|
|
namespace {
|
2009-09-02 06:11:42 +00:00
|
|
|
struct DSE : public FunctionPass {
|
2010-11-30 19:34:42 +00:00
|
|
|
AliasAnalysis *AA;
|
|
|
|
MemoryDependenceAnalysis *MD;
|
2011-11-05 10:48:42 +00:00
|
|
|
DominatorTree *DT;
|
2010-11-30 19:34:42 +00:00
|
|
|
|
2007-07-11 00:46:18 +00:00
|
|
|
static char ID; // Pass identification, replacement for typeid
|
2011-11-05 10:48:42 +00:00
|
|
|
DSE() : FunctionPass(ID), AA(0), MD(0), DT(0) {
|
2010-10-19 17:21:58 +00:00
|
|
|
initializeDSEPass(*PassRegistry::getPassRegistry());
|
|
|
|
}
|
2007-07-11 00:46:18 +00:00
|
|
|
|
|
|
|
virtual bool runOnFunction(Function &F) {
|
2010-11-30 19:34:42 +00:00
|
|
|
AA = &getAnalysis<AliasAnalysis>();
|
|
|
|
MD = &getAnalysis<MemoryDependenceAnalysis>();
|
2011-11-05 10:48:42 +00:00
|
|
|
DT = &getAnalysis<DominatorTree>();
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 19:34:42 +00:00
|
|
|
bool Changed = false;
|
2007-07-11 00:46:18 +00:00
|
|
|
for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)
|
2010-02-11 05:11:54 +00:00
|
|
|
// Only check non-dead blocks. Dead blocks may have strange pointer
|
|
|
|
// cycles that will confuse alias analysis.
|
2011-11-05 10:48:42 +00:00
|
|
|
if (DT->isReachableFromEntry(I))
|
2010-02-11 05:11:54 +00:00
|
|
|
Changed |= runOnBasicBlock(*I);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2011-11-05 10:48:42 +00:00
|
|
|
AA = 0; MD = 0; DT = 0;
|
2007-07-11 00:46:18 +00:00
|
|
|
return Changed;
|
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2007-07-11 00:46:18 +00:00
|
|
|
bool runOnBasicBlock(BasicBlock &BB);
|
2010-11-30 01:28:33 +00:00
|
|
|
bool HandleFree(CallInst *F);
|
2008-11-28 00:27:14 +00:00
|
|
|
bool handleEndBlock(BasicBlock &BB);
|
2010-11-30 21:47:58 +00:00
|
|
|
void RemoveAccessedObjects(const AliasAnalysis::Location &LoadedLoc,
|
|
|
|
SmallPtrSet<Value*, 16> &DeadStackObjects);
|
2007-07-11 00:46:18 +00:00
|
|
|
|
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.setPreservesCFG();
|
2008-07-28 16:14:26 +00:00
|
|
|
AU.addRequired<DominatorTree>();
|
2007-07-11 23:19:17 +00:00
|
|
|
AU.addRequired<AliasAnalysis>();
|
2007-07-11 00:46:18 +00:00
|
|
|
AU.addRequired<MemoryDependenceAnalysis>();
|
2010-11-30 19:34:42 +00:00
|
|
|
AU.addPreserved<AliasAnalysis>();
|
2008-07-28 16:14:26 +00:00
|
|
|
AU.addPreserved<DominatorTree>();
|
2007-07-11 00:46:18 +00:00
|
|
|
AU.addPreserved<MemoryDependenceAnalysis>();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2008-05-13 00:00:25 +00:00
|
|
|
char DSE::ID = 0;
|
2010-10-12 19:48:12 +00:00
|
|
|
INITIALIZE_PASS_BEGIN(DSE, "dse", "Dead Store Elimination", false, false)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(DominatorTree)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(MemoryDependenceAnalysis)
|
|
|
|
INITIALIZE_AG_DEPENDENCY(AliasAnalysis)
|
|
|
|
INITIALIZE_PASS_END(DSE, "dse", "Dead Store Elimination", false, false)
|
2008-05-13 00:00:25 +00:00
|
|
|
|
2007-08-01 06:36:51 +00:00
|
|
|
FunctionPass *llvm::createDeadStoreEliminationPass() { return new DSE(); }
|
2007-07-11 00:46:18 +00:00
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Helper functions
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
/// DeleteDeadInstruction - Delete this instruction. Before we do, go through
|
|
|
|
/// and zero out all the operands of this instruction. If any of them become
|
|
|
|
/// dead, delete them and the computation tree that feeds them.
|
|
|
|
///
|
|
|
|
/// If ValueSet is non-null, remove any deleted instructions from it as well.
|
|
|
|
///
|
|
|
|
static void DeleteDeadInstruction(Instruction *I,
|
|
|
|
MemoryDependenceAnalysis &MD,
|
|
|
|
SmallPtrSet<Value*, 16> *ValueSet = 0) {
|
|
|
|
SmallVector<Instruction*, 32> NowDeadInsts;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
NowDeadInsts.push_back(I);
|
|
|
|
--NumFastOther;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
// Before we touch this instruction, remove it from memdep!
|
|
|
|
do {
|
|
|
|
Instruction *DeadInst = NowDeadInsts.pop_back_val();
|
|
|
|
++NumFastOther;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
// This instruction is dead, zap it, in stages. Start by removing it from
|
|
|
|
// MemDep, which needs to know the operands and needs it to be in the
|
|
|
|
// function.
|
|
|
|
MD.removeInstruction(DeadInst);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
for (unsigned op = 0, e = DeadInst->getNumOperands(); op != e; ++op) {
|
|
|
|
Value *Op = DeadInst->getOperand(op);
|
|
|
|
DeadInst->setOperand(op, 0);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
// If this operand just became dead, add it to the NowDeadInsts list.
|
|
|
|
if (!Op->use_empty()) continue;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
if (Instruction *OpI = dyn_cast<Instruction>(Op))
|
|
|
|
if (isInstructionTriviallyDead(OpI))
|
|
|
|
NowDeadInsts.push_back(OpI);
|
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
DeadInst->eraseFromParent();
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
if (ValueSet) ValueSet->erase(DeadInst);
|
|
|
|
} while (!NowDeadInsts.empty());
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-11-30 01:37:52 +00:00
|
|
|
/// hasMemoryWrite - Does this instruction write some memory? This only returns
|
|
|
|
/// true for things that we can analyze with other helpers below.
|
|
|
|
static bool hasMemoryWrite(Instruction *I) {
|
2009-11-10 06:46:40 +00:00
|
|
|
if (isa<StoreInst>(I))
|
|
|
|
return true;
|
|
|
|
if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
|
|
|
|
switch (II->getIntrinsicID()) {
|
2009-12-02 06:35:55 +00:00
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
case Intrinsic::memset:
|
|
|
|
case Intrinsic::memmove:
|
|
|
|
case Intrinsic::memcpy:
|
|
|
|
case Intrinsic::init_trampoline:
|
|
|
|
case Intrinsic::lifetime_end:
|
|
|
|
return true;
|
2009-11-10 06:46:40 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2010-11-30 07:23:21 +00:00
|
|
|
/// getLocForWrite - Return a Location stored to by the specified instruction.
|
2011-09-13 01:28:59 +00:00
|
|
|
/// If isRemovable returns true, this function and getLocForRead completely
|
|
|
|
/// describe the memory operations for this instruction.
|
2010-11-30 07:23:21 +00:00
|
|
|
static AliasAnalysis::Location
|
|
|
|
getLocForWrite(Instruction *Inst, AliasAnalysis &AA) {
|
|
|
|
if (StoreInst *SI = dyn_cast<StoreInst>(Inst))
|
|
|
|
return AA.getLocation(SI);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 07:23:21 +00:00
|
|
|
if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(Inst)) {
|
|
|
|
// memcpy/memmove/memset.
|
|
|
|
AliasAnalysis::Location Loc = AA.getLocationForDest(MI);
|
|
|
|
// If we don't have target data around, an unknown size in Location means
|
|
|
|
// that we should use the size of the pointee type. This isn't valid for
|
|
|
|
// memset/memcpy, which writes more than an i8.
|
|
|
|
if (Loc.Size == AliasAnalysis::UnknownSize && AA.getTargetData() == 0)
|
|
|
|
return AliasAnalysis::Location();
|
|
|
|
return Loc;
|
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 07:23:21 +00:00
|
|
|
IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst);
|
|
|
|
if (II == 0) return AliasAnalysis::Location();
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 07:23:21 +00:00
|
|
|
switch (II->getIntrinsicID()) {
|
|
|
|
default: return AliasAnalysis::Location(); // Unhandled intrinsic.
|
|
|
|
case Intrinsic::init_trampoline:
|
|
|
|
// If we don't have target data around, an unknown size in Location means
|
|
|
|
// that we should use the size of the pointee type. This isn't valid for
|
|
|
|
// init.trampoline, which writes more than an i8.
|
|
|
|
if (AA.getTargetData() == 0) return AliasAnalysis::Location();
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 07:23:21 +00:00
|
|
|
// FIXME: We don't know the size of the trampoline, so we can't really
|
|
|
|
// handle it here.
|
|
|
|
return AliasAnalysis::Location(II->getArgOperand(0));
|
|
|
|
case Intrinsic::lifetime_end: {
|
|
|
|
uint64_t Len = cast<ConstantInt>(II->getArgOperand(0))->getZExtValue();
|
|
|
|
return AliasAnalysis::Location(II->getArgOperand(1), Len);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-12-06 01:48:06 +00:00
|
|
|
/// getLocForRead - Return the location read by the specified "hasMemoryWrite"
|
|
|
|
/// instruction if any.
|
2011-09-06 18:14:09 +00:00
|
|
|
static AliasAnalysis::Location
|
2010-12-06 01:48:06 +00:00
|
|
|
getLocForRead(Instruction *Inst, AliasAnalysis &AA) {
|
|
|
|
assert(hasMemoryWrite(Inst) && "Unknown instruction case");
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-12-06 01:48:06 +00:00
|
|
|
// The only instructions that both read and write are the mem transfer
|
|
|
|
// instructions (memcpy/memmove).
|
|
|
|
if (MemTransferInst *MTI = dyn_cast<MemTransferInst>(Inst))
|
|
|
|
return AA.getLocationForSource(MTI);
|
|
|
|
return AliasAnalysis::Location();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-11-30 05:30:45 +00:00
|
|
|
/// isRemovable - If the value of this instruction and the memory it writes to
|
|
|
|
/// is unused, may we delete this instruction?
|
|
|
|
static bool isRemovable(Instruction *I) {
|
2011-08-17 22:22:24 +00:00
|
|
|
// Don't remove volatile/atomic stores.
|
2009-11-10 06:46:40 +00:00
|
|
|
if (StoreInst *SI = dyn_cast<StoreInst>(I))
|
2011-08-17 22:22:24 +00:00
|
|
|
return SI->isUnordered();
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 19:12:10 +00:00
|
|
|
IntrinsicInst *II = cast<IntrinsicInst>(I);
|
|
|
|
switch (II->getIntrinsicID()) {
|
|
|
|
default: assert(0 && "doesn't pass 'hasMemoryWrite' predicate");
|
|
|
|
case Intrinsic::lifetime_end:
|
|
|
|
// Never remove dead lifetime_end's, e.g. because it is followed by a
|
|
|
|
// free.
|
|
|
|
return false;
|
|
|
|
case Intrinsic::init_trampoline:
|
|
|
|
// Always safe to remove init_trampoline.
|
|
|
|
return true;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 19:12:10 +00:00
|
|
|
case Intrinsic::memset:
|
|
|
|
case Intrinsic::memmove:
|
|
|
|
case Intrinsic::memcpy:
|
|
|
|
// Don't remove volatile memory intrinsics.
|
|
|
|
return !cast<MemIntrinsic>(II)->isVolatile();
|
|
|
|
}
|
2009-11-10 06:46:40 +00:00
|
|
|
}
|
|
|
|
|
2011-11-09 23:07:35 +00:00
|
|
|
|
|
|
|
/// isShortenable - Returns true if this instruction can be safely shortened in
|
|
|
|
/// length.
|
|
|
|
static bool isShortenable(Instruction *I) {
|
|
|
|
// Don't shorten stores for now
|
|
|
|
if (isa<StoreInst>(I))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
IntrinsicInst *II = cast<IntrinsicInst>(I);
|
|
|
|
switch (II->getIntrinsicID()) {
|
|
|
|
default: return false;
|
|
|
|
case Intrinsic::memset:
|
|
|
|
case Intrinsic::memcpy:
|
|
|
|
// Do shorten memory intrinsics.
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
/// getStoredPointerOperand - Return the pointer that is being written to.
|
|
|
|
static Value *getStoredPointerOperand(Instruction *I) {
|
2009-11-10 06:46:40 +00:00
|
|
|
if (StoreInst *SI = dyn_cast<StoreInst>(I))
|
|
|
|
return SI->getPointerOperand();
|
|
|
|
if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(I))
|
2010-11-30 21:58:14 +00:00
|
|
|
return MI->getDest();
|
2010-06-24 12:03:56 +00:00
|
|
|
|
|
|
|
IntrinsicInst *II = cast<IntrinsicInst>(I);
|
|
|
|
switch (II->getIntrinsicID()) {
|
2009-12-02 06:35:55 +00:00
|
|
|
default: assert(false && "Unexpected intrinsic!");
|
|
|
|
case Intrinsic::init_trampoline:
|
2010-06-24 12:03:56 +00:00
|
|
|
return II->getArgOperand(0);
|
2009-11-10 13:49:50 +00:00
|
|
|
}
|
2009-11-10 06:46:40 +00:00
|
|
|
}
|
|
|
|
|
2011-11-16 03:49:48 +00:00
|
|
|
static uint64_t getPointerSize(const Value *V, AliasAnalysis &AA) {
|
2010-11-30 19:34:42 +00:00
|
|
|
const TargetData *TD = AA.getTargetData();
|
2011-10-22 21:59:35 +00:00
|
|
|
|
2011-11-16 03:49:48 +00:00
|
|
|
if (const CallInst *CI = extractMallocCall(V)) {
|
|
|
|
if (const ConstantInt *C = dyn_cast<ConstantInt>(CI->getArgOperand(0)))
|
2011-10-22 21:59:35 +00:00
|
|
|
return C->getZExtValue();
|
|
|
|
}
|
|
|
|
|
2010-11-30 19:34:42 +00:00
|
|
|
if (TD == 0)
|
|
|
|
return AliasAnalysis::UnknownSize;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2011-11-16 03:49:48 +00:00
|
|
|
if (const AllocaInst *A = dyn_cast<AllocaInst>(V)) {
|
2010-11-30 19:34:42 +00:00
|
|
|
// Get size information for the alloca
|
2011-11-16 03:49:48 +00:00
|
|
|
if (const ConstantInt *C = dyn_cast<ConstantInt>(A->getArraySize()))
|
2010-11-30 19:34:42 +00:00
|
|
|
return C->getZExtValue() * TD->getTypeAllocSize(A->getAllocatedType());
|
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2011-11-16 03:49:48 +00:00
|
|
|
if (const Argument *A = dyn_cast<Argument>(V)) {
|
|
|
|
if (A->hasByValAttr())
|
|
|
|
if (PointerType *PT = dyn_cast<PointerType>(A->getType()))
|
|
|
|
return TD->getTypeAllocSize(PT->getElementType());
|
|
|
|
}
|
2010-11-30 19:34:42 +00:00
|
|
|
|
2011-11-16 03:49:48 +00:00
|
|
|
if (const GlobalVariable *GV = dyn_cast<GlobalVariable>(V)) {
|
|
|
|
if (!GV->mayBeOverridden())
|
|
|
|
return TD->getTypeAllocSize(GV->getType()->getElementType());
|
|
|
|
}
|
|
|
|
|
|
|
|
return AliasAnalysis::UnknownSize;
|
2010-11-30 23:43:23 +00:00
|
|
|
}
|
2010-11-30 19:34:42 +00:00
|
|
|
|
2011-11-09 23:07:35 +00:00
|
|
|
namespace {
|
|
|
|
enum OverwriteResult
|
|
|
|
{
|
|
|
|
OverwriteComplete,
|
|
|
|
OverwriteEnd,
|
|
|
|
OverwriteUnknown
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isOverwrite - Return 'OverwriteComplete' if a store to the 'Later' location
|
2010-11-30 07:23:21 +00:00
|
|
|
/// completely overwrites a store to the 'Earlier' location.
|
2011-11-09 23:07:35 +00:00
|
|
|
/// 'OverwriteEnd' if the end of the 'Earlier' location is completely
|
|
|
|
/// overwritten by 'Later', or 'OverwriteUnknown' if nothing can be determined
|
|
|
|
static OverwriteResult isOverwrite(const AliasAnalysis::Location &Later,
|
|
|
|
const AliasAnalysis::Location &Earlier,
|
|
|
|
AliasAnalysis &AA,
|
2011-11-16 03:49:48 +00:00
|
|
|
int64_t &EarlierOff,
|
|
|
|
int64_t &LaterOff) {
|
2010-11-30 23:05:20 +00:00
|
|
|
const Value *P1 = Earlier.Ptr->stripPointerCasts();
|
|
|
|
const Value *P2 = Later.Ptr->stripPointerCasts();
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 23:05:20 +00:00
|
|
|
// If the start pointers are the same, we just have to compare sizes to see if
|
|
|
|
// the later store was larger than the earlier store.
|
|
|
|
if (P1 == P2) {
|
|
|
|
// If we don't know the sizes of either access, then we can't do a
|
|
|
|
// comparison.
|
|
|
|
if (Later.Size == AliasAnalysis::UnknownSize ||
|
|
|
|
Earlier.Size == AliasAnalysis::UnknownSize) {
|
|
|
|
// If we have no TargetData information around, then the size of the store
|
|
|
|
// is inferrable from the pointee type. If they are the same type, then
|
|
|
|
// we know that the store is safe.
|
2011-11-09 23:07:35 +00:00
|
|
|
if (AA.getTargetData() == 0 &&
|
|
|
|
Later.Ptr->getType() == Earlier.Ptr->getType())
|
|
|
|
return OverwriteComplete;
|
|
|
|
|
|
|
|
return OverwriteUnknown;
|
2010-11-30 23:05:20 +00:00
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 23:05:20 +00:00
|
|
|
// Make sure that the Later size is >= the Earlier size.
|
2011-11-09 23:07:35 +00:00
|
|
|
if (Later.Size >= Earlier.Size)
|
|
|
|
return OverwriteComplete;
|
2010-11-30 23:05:20 +00:00
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 23:05:20 +00:00
|
|
|
// Otherwise, we have to have size information, and the later store has to be
|
|
|
|
// larger than the earlier one.
|
2010-11-30 19:28:23 +00:00
|
|
|
if (Later.Size == AliasAnalysis::UnknownSize ||
|
2010-11-30 23:05:20 +00:00
|
|
|
Earlier.Size == AliasAnalysis::UnknownSize ||
|
2011-11-09 23:07:35 +00:00
|
|
|
AA.getTargetData() == 0)
|
|
|
|
return OverwriteUnknown;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 23:43:23 +00:00
|
|
|
// Check to see if the later store is to the entire object (either a global,
|
|
|
|
// an alloca, or a byval argument). If so, then it clearly overwrites any
|
|
|
|
// other store to the same object.
|
2010-11-30 23:05:20 +00:00
|
|
|
const TargetData &TD = *AA.getTargetData();
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2011-01-24 18:53:32 +00:00
|
|
|
const Value *UO1 = GetUnderlyingObject(P1, &TD),
|
|
|
|
*UO2 = GetUnderlyingObject(P2, &TD);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 23:43:23 +00:00
|
|
|
// If we can't resolve the same pointers to the same object, then we can't
|
|
|
|
// analyze them at all.
|
|
|
|
if (UO1 != UO2)
|
2011-11-09 23:07:35 +00:00
|
|
|
return OverwriteUnknown;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 23:43:23 +00:00
|
|
|
// If the "Later" store is to a recognizable object, get its size.
|
2011-11-16 03:49:48 +00:00
|
|
|
uint64_t ObjectSize = getPointerSize(UO2, AA);
|
|
|
|
if (ObjectSize != AliasAnalysis::UnknownSize)
|
2011-11-10 20:22:08 +00:00
|
|
|
if (ObjectSize == Later.Size && ObjectSize >= Earlier.Size)
|
2011-11-09 23:07:35 +00:00
|
|
|
return OverwriteComplete;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 23:05:20 +00:00
|
|
|
// Okay, we have stores to two completely different pointers. Try to
|
|
|
|
// decompose the pointer into a "base + constant_offset" form. If the base
|
|
|
|
// pointers are equal, then we can reason about the two stores.
|
2011-11-09 23:07:35 +00:00
|
|
|
EarlierOff = 0;
|
|
|
|
LaterOff = 0;
|
2011-03-26 08:02:59 +00:00
|
|
|
const Value *BP1 = GetPointerBaseWithConstantOffset(P1, EarlierOff, TD);
|
|
|
|
const Value *BP2 = GetPointerBaseWithConstantOffset(P2, LaterOff, TD);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 23:05:20 +00:00
|
|
|
// If the base pointers still differ, we have two completely different stores.
|
|
|
|
if (BP1 != BP2)
|
2011-11-09 23:07:35 +00:00
|
|
|
return OverwriteUnknown;
|
2011-03-26 01:20:37 +00:00
|
|
|
|
2011-03-26 08:02:59 +00:00
|
|
|
// The later store completely overlaps the earlier store if:
|
2011-09-06 18:14:09 +00:00
|
|
|
//
|
2011-03-26 08:02:59 +00:00
|
|
|
// 1. Both start at the same offset and the later one's size is greater than
|
|
|
|
// or equal to the earlier one's, or
|
|
|
|
//
|
|
|
|
// |--earlier--|
|
|
|
|
// |-- later --|
|
2011-09-06 18:14:09 +00:00
|
|
|
//
|
2011-03-26 08:02:59 +00:00
|
|
|
// 2. The earlier store has an offset greater than the later offset, but which
|
|
|
|
// still lies completely within the later store.
|
|
|
|
//
|
|
|
|
// |--earlier--|
|
|
|
|
// |----- later ------|
|
2011-03-30 21:37:19 +00:00
|
|
|
//
|
|
|
|
// We have to be careful here as *Off is signed while *.Size is unsigned.
|
2011-03-26 09:32:07 +00:00
|
|
|
if (EarlierOff >= LaterOff &&
|
2011-11-09 23:07:35 +00:00
|
|
|
Later.Size > Earlier.Size &&
|
2011-03-30 21:37:19 +00:00
|
|
|
uint64_t(EarlierOff - LaterOff) + Earlier.Size <= Later.Size)
|
2011-11-09 23:07:35 +00:00
|
|
|
return OverwriteComplete;
|
|
|
|
|
|
|
|
// The other interesting case is if the later store overwrites the end of
|
|
|
|
// the earlier store
|
|
|
|
//
|
|
|
|
// |--earlier--|
|
|
|
|
// |-- later --|
|
|
|
|
//
|
|
|
|
// In this case we may want to trim the size of earlier to avoid generating
|
|
|
|
// writes to addresses which will definitely be overwritten later
|
|
|
|
if (LaterOff > EarlierOff &&
|
|
|
|
LaterOff < int64_t(EarlierOff + Earlier.Size) &&
|
2011-12-03 00:04:30 +00:00
|
|
|
int64_t(LaterOff + Later.Size) >= int64_t(EarlierOff + Earlier.Size))
|
2011-11-09 23:07:35 +00:00
|
|
|
return OverwriteEnd;
|
2011-03-26 08:02:59 +00:00
|
|
|
|
|
|
|
// Otherwise, they don't completely overlap.
|
2011-11-09 23:07:35 +00:00
|
|
|
return OverwriteUnknown;
|
2009-11-04 23:20:12 +00:00
|
|
|
}
|
|
|
|
|
2010-12-06 01:48:06 +00:00
|
|
|
/// isPossibleSelfRead - If 'Inst' might be a self read (i.e. a noop copy of a
|
|
|
|
/// memory region into an identical pointer) then it doesn't actually make its
|
2011-09-06 18:14:09 +00:00
|
|
|
/// input dead in the traditional sense. Consider this case:
|
2010-12-06 01:48:06 +00:00
|
|
|
///
|
|
|
|
/// memcpy(A <- B)
|
|
|
|
/// memcpy(A <- A)
|
|
|
|
///
|
|
|
|
/// In this case, the second store to A does not make the first store to A dead.
|
|
|
|
/// The usual situation isn't an explicit A<-A store like this (which can be
|
|
|
|
/// trivially removed) but a case where two pointers may alias.
|
|
|
|
///
|
|
|
|
/// This function detects when it is unsafe to remove a dependent instruction
|
|
|
|
/// because the DSE inducing instruction may be a self-read.
|
|
|
|
static bool isPossibleSelfRead(Instruction *Inst,
|
|
|
|
const AliasAnalysis::Location &InstStoreLoc,
|
|
|
|
Instruction *DepWrite, AliasAnalysis &AA) {
|
|
|
|
// Self reads can only happen for instructions that read memory. Get the
|
|
|
|
// location read.
|
|
|
|
AliasAnalysis::Location InstReadLoc = getLocForRead(Inst, AA);
|
|
|
|
if (InstReadLoc.Ptr == 0) return false; // Not a reading instruction.
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-12-06 01:48:06 +00:00
|
|
|
// If the read and written loc obviously don't alias, it isn't a read.
|
|
|
|
if (AA.isNoAlias(InstReadLoc, InstStoreLoc)) return false;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-12-06 01:48:06 +00:00
|
|
|
// Okay, 'Inst' may copy over itself. However, we can still remove a the
|
|
|
|
// DepWrite instruction if we can prove that it reads from the same location
|
|
|
|
// as Inst. This handles useful cases like:
|
|
|
|
// memcpy(A <- B)
|
|
|
|
// memcpy(A <- B)
|
|
|
|
// Here we don't know if A/B may alias, but we do know that B/B are must
|
|
|
|
// aliases, so removing the first memcpy is safe (assuming it writes <= #
|
|
|
|
// bytes as the second one.
|
|
|
|
AliasAnalysis::Location DepReadLoc = getLocForRead(DepWrite, AA);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-12-06 01:48:06 +00:00
|
|
|
if (DepReadLoc.Ptr && AA.isMustAlias(InstReadLoc.Ptr, DepReadLoc.Ptr))
|
|
|
|
return false;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-12-06 01:48:06 +00:00
|
|
|
// If DepWrite doesn't read memory or if we can't prove it is a must alias,
|
|
|
|
// then it can't be considered dead.
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// DSE Pass
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2007-08-01 06:36:51 +00:00
|
|
|
bool DSE::runOnBasicBlock(BasicBlock &BB) {
|
2007-07-11 00:46:18 +00:00
|
|
|
bool MadeChange = false;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2009-09-02 06:31:02 +00:00
|
|
|
// Do a top-down walk on the BB.
|
2008-11-28 21:29:52 +00:00
|
|
|
for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) {
|
|
|
|
Instruction *Inst = BBI++;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 01:28:33 +00:00
|
|
|
// Handle 'free' calls specially.
|
|
|
|
if (CallInst *F = isFreeCall(Inst)) {
|
|
|
|
MadeChange |= HandleFree(F);
|
|
|
|
continue;
|
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 01:37:52 +00:00
|
|
|
// If we find something that writes memory, get its memory dependence.
|
|
|
|
if (!hasMemoryWrite(Inst))
|
2007-08-08 04:52:29 +00:00
|
|
|
continue;
|
2010-11-30 00:01:19 +00:00
|
|
|
|
2010-11-30 19:34:42 +00:00
|
|
|
MemDepResult InstDep = MD->getDependency(Inst);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2011-06-15 00:47:34 +00:00
|
|
|
// Ignore any store where we can't find a local dependence.
|
2008-12-06 00:53:22 +00:00
|
|
|
// FIXME: cross-block DSE would be fun. :)
|
2011-10-13 22:14:57 +00:00
|
|
|
if (!InstDep.isDef() && !InstDep.isClobber())
|
2010-11-30 07:23:21 +00:00
|
|
|
continue;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 00:01:19 +00:00
|
|
|
// If we're storing the same value back to a pointer that we just
|
|
|
|
// loaded from, then the store can be removed.
|
|
|
|
if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) {
|
|
|
|
if (LoadInst *DepLoad = dyn_cast<LoadInst>(InstDep.getInst())) {
|
|
|
|
if (SI->getPointerOperand() == DepLoad->getPointerOperand() &&
|
2011-08-17 22:22:24 +00:00
|
|
|
SI->getOperand(0) == DepLoad && isRemovable(SI)) {
|
2010-12-06 21:13:51 +00:00
|
|
|
DEBUG(dbgs() << "DSE: Remove Store Of Load from same pointer:\n "
|
|
|
|
<< "LOAD: " << *DepLoad << "\n STORE: " << *SI << '\n');
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 00:01:19 +00:00
|
|
|
// DeleteDeadInstruction can delete the current instruction. Save BBI
|
|
|
|
// in case we need it.
|
|
|
|
WeakVH NextInst(BBI);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
DeleteDeadInstruction(SI, *MD);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 00:01:19 +00:00
|
|
|
if (NextInst == 0) // Next instruction deleted.
|
|
|
|
BBI = BB.begin();
|
|
|
|
else if (BBI != BB.begin()) // Revisit this instruction if possible.
|
|
|
|
--BBI;
|
|
|
|
++NumFastStores;
|
|
|
|
MadeChange = true;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 07:23:21 +00:00
|
|
|
// Figure out what location is being stored to.
|
2010-11-30 19:34:42 +00:00
|
|
|
AliasAnalysis::Location Loc = getLocForWrite(Inst, *AA);
|
2010-11-30 07:23:21 +00:00
|
|
|
|
|
|
|
// If we didn't get a useful location, fail.
|
|
|
|
if (Loc.Ptr == 0)
|
|
|
|
continue;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2011-10-13 22:14:57 +00:00
|
|
|
while (InstDep.isDef() || InstDep.isClobber()) {
|
2010-11-30 07:23:21 +00:00
|
|
|
// Get the memory clobbered by the instruction we depend on. MemDep will
|
|
|
|
// skip any instructions that 'Loc' clearly doesn't interact with. If we
|
|
|
|
// end up depending on a may- or must-aliased load, then we can't optimize
|
|
|
|
// away the store and we bail out. However, if we depend on on something
|
|
|
|
// that overwrites the memory location we *can* potentially optimize it.
|
|
|
|
//
|
2011-04-15 05:18:47 +00:00
|
|
|
// Find out what memory location the dependent instruction stores.
|
2010-11-30 07:23:21 +00:00
|
|
|
Instruction *DepWrite = InstDep.getInst();
|
2010-11-30 19:34:42 +00:00
|
|
|
AliasAnalysis::Location DepLoc = getLocForWrite(DepWrite, *AA);
|
2010-11-30 07:23:21 +00:00
|
|
|
// If we didn't get a useful location, or if it isn't a size, bail out.
|
|
|
|
if (DepLoc.Ptr == 0)
|
|
|
|
break;
|
|
|
|
|
2010-12-06 01:48:06 +00:00
|
|
|
// If we find a write that is a) removable (i.e., non-volatile), b) is
|
|
|
|
// completely obliterated by the store to 'Loc', and c) which we know that
|
|
|
|
// 'Inst' doesn't load from, then we can remove it.
|
2011-11-09 23:07:35 +00:00
|
|
|
if (isRemovable(DepWrite) &&
|
2010-12-06 01:48:06 +00:00
|
|
|
!isPossibleSelfRead(Inst, Loc, DepWrite, *AA)) {
|
2011-11-09 23:07:35 +00:00
|
|
|
int64_t InstWriteOffset, DepWriteOffset;
|
|
|
|
OverwriteResult OR = isOverwrite(Loc, DepLoc, *AA,
|
|
|
|
DepWriteOffset, InstWriteOffset);
|
|
|
|
if (OR == OverwriteComplete) {
|
|
|
|
DEBUG(dbgs() << "DSE: Remove Dead Store:\n DEAD: "
|
|
|
|
<< *DepWrite << "\n KILLER: " << *Inst << '\n');
|
|
|
|
|
|
|
|
// Delete the store and now-dead instructions that feed it.
|
|
|
|
DeleteDeadInstruction(DepWrite, *MD);
|
|
|
|
++NumFastStores;
|
|
|
|
MadeChange = true;
|
|
|
|
|
|
|
|
// DeleteDeadInstruction can delete the current instruction in loop
|
|
|
|
// cases, reset BBI.
|
|
|
|
BBI = Inst;
|
|
|
|
if (BBI != BB.begin())
|
|
|
|
--BBI;
|
|
|
|
break;
|
|
|
|
} else if (OR == OverwriteEnd && isShortenable(DepWrite)) {
|
|
|
|
// TODO: base this on the target vector size so that if the earlier
|
|
|
|
// store was too small to get vector writes anyway then its likely
|
|
|
|
// a good idea to shorten it
|
|
|
|
// Power of 2 vector writes are probably always a bad idea to optimize
|
|
|
|
// as any store/memset/memcpy is likely using vector instructions so
|
|
|
|
// shortening it to not vector size is likely to be slower
|
|
|
|
MemIntrinsic* DepIntrinsic = cast<MemIntrinsic>(DepWrite);
|
|
|
|
unsigned DepWriteAlign = DepIntrinsic->getAlignment();
|
|
|
|
if (llvm::isPowerOf2_64(InstWriteOffset) ||
|
|
|
|
((DepWriteAlign != 0) && InstWriteOffset % DepWriteAlign == 0)) {
|
|
|
|
|
|
|
|
DEBUG(dbgs() << "DSE: Remove Dead Store:\n OW END: "
|
|
|
|
<< *DepWrite << "\n KILLER (offset "
|
|
|
|
<< InstWriteOffset << ", "
|
|
|
|
<< DepLoc.Size << ")"
|
|
|
|
<< *Inst << '\n');
|
|
|
|
|
|
|
|
Value* DepWriteLength = DepIntrinsic->getLength();
|
|
|
|
Value* TrimmedLength = ConstantInt::get(DepWriteLength->getType(),
|
|
|
|
InstWriteOffset -
|
|
|
|
DepWriteOffset);
|
|
|
|
DepIntrinsic->setLength(TrimmedLength);
|
|
|
|
MadeChange = true;
|
|
|
|
}
|
|
|
|
}
|
2010-11-30 07:23:21 +00:00
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-21 07:34:32 +00:00
|
|
|
// If this is a may-aliased store that is clobbering the store value, we
|
|
|
|
// can keep searching past it for another must-aliased pointer that stores
|
|
|
|
// to the same location. For example, in:
|
|
|
|
// store -> P
|
|
|
|
// store -> Q
|
|
|
|
// store -> P
|
|
|
|
// we can remove the first store to P even though we don't know if P and Q
|
|
|
|
// alias.
|
2010-11-30 07:23:21 +00:00
|
|
|
if (DepWrite == &BB.front()) break;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 07:23:21 +00:00
|
|
|
// Can't look past this instruction if it might read 'Loc'.
|
2010-11-30 19:34:42 +00:00
|
|
|
if (AA->getModRefInfo(DepWrite, Loc) & AliasAnalysis::Ref)
|
2010-11-30 07:23:21 +00:00
|
|
|
break;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 19:34:42 +00:00
|
|
|
InstDep = MD->getPointerDependencyFrom(Loc, false, DepWrite, &BB);
|
2009-11-10 06:46:40 +00:00
|
|
|
}
|
2007-07-11 00:46:18 +00:00
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2008-11-28 21:29:52 +00:00
|
|
|
// If this block ends in a return, unwind, or unreachable, all allocas are
|
|
|
|
// dead at its end, which means stores to them are also dead.
|
2007-07-12 21:41:30 +00:00
|
|
|
if (BB.getTerminator()->getNumSuccessors() == 0)
|
2008-11-28 00:27:14 +00:00
|
|
|
MadeChange |= handleEndBlock(BB);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2007-07-11 00:46:18 +00:00
|
|
|
return MadeChange;
|
|
|
|
}
|
|
|
|
|
2011-11-05 10:48:42 +00:00
|
|
|
/// Find all blocks that will unconditionally lead to the block BB and append
|
|
|
|
/// them to F.
|
|
|
|
static void FindUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks,
|
|
|
|
BasicBlock *BB, DominatorTree *DT) {
|
|
|
|
for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) {
|
|
|
|
BasicBlock *Pred = *I;
|
2011-12-08 22:36:35 +00:00
|
|
|
if (Pred == BB) continue;
|
2011-11-05 10:48:42 +00:00
|
|
|
TerminatorInst *PredTI = Pred->getTerminator();
|
|
|
|
if (PredTI->getNumSuccessors() != 1)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (DT->isReachableFromEntry(Pred))
|
|
|
|
Blocks.push_back(Pred);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-11-30 01:28:33 +00:00
|
|
|
/// HandleFree - Handle frees of entire structures whose dependency is a store
|
|
|
|
/// to a field of that structure.
|
|
|
|
bool DSE::HandleFree(CallInst *F) {
|
2011-06-15 00:47:34 +00:00
|
|
|
bool MadeChange = false;
|
|
|
|
|
2011-11-05 10:48:42 +00:00
|
|
|
AliasAnalysis::Location Loc = AliasAnalysis::Location(F->getOperand(0));
|
|
|
|
SmallVector<BasicBlock *, 16> Blocks;
|
|
|
|
Blocks.push_back(F->getParent());
|
2011-06-15 00:47:34 +00:00
|
|
|
|
2011-11-05 10:48:42 +00:00
|
|
|
while (!Blocks.empty()) {
|
|
|
|
BasicBlock *BB = Blocks.pop_back_val();
|
|
|
|
Instruction *InstPt = BB->getTerminator();
|
|
|
|
if (BB == F->getParent()) InstPt = F;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2011-11-05 10:48:42 +00:00
|
|
|
MemDepResult Dep = MD->getPointerDependencyFrom(Loc, false, InstPt, BB);
|
|
|
|
while (Dep.isDef() || Dep.isClobber()) {
|
|
|
|
Instruction *Dependency = Dep.getInst();
|
|
|
|
if (!hasMemoryWrite(Dependency) || !isRemovable(Dependency))
|
|
|
|
break;
|
2008-01-20 10:49:23 +00:00
|
|
|
|
2011-11-05 10:48:42 +00:00
|
|
|
Value *DepPointer =
|
|
|
|
GetUnderlyingObject(getStoredPointerOperand(Dependency));
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2011-11-05 10:48:42 +00:00
|
|
|
// Check for aliasing.
|
|
|
|
if (!AA->isMustAlias(F->getArgOperand(0), DepPointer))
|
|
|
|
break;
|
2010-11-12 02:19:17 +00:00
|
|
|
|
2011-11-05 10:48:42 +00:00
|
|
|
Instruction *Next = llvm::next(BasicBlock::iterator(Dependency));
|
|
|
|
|
|
|
|
// DCE instructions only used to calculate that store
|
|
|
|
DeleteDeadInstruction(Dependency, *MD);
|
|
|
|
++NumFastStores;
|
|
|
|
MadeChange = true;
|
|
|
|
|
|
|
|
// Inst's old Dependency is now deleted. Compute the next dependency,
|
|
|
|
// which may also be dead, as in
|
|
|
|
// s[0] = 0;
|
|
|
|
// s[1] = 0; // This has just been deleted.
|
|
|
|
// free(s);
|
|
|
|
Dep = MD->getPointerDependencyFrom(Loc, false, Next, BB);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (Dep.isNonLocal())
|
|
|
|
FindUnconditionalPreds(Blocks, BB, DT);
|
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2011-06-15 00:47:34 +00:00
|
|
|
return MadeChange;
|
2007-07-11 23:19:17 +00:00
|
|
|
}
|
|
|
|
|
2007-08-02 18:11:11 +00:00
|
|
|
/// handleEndBlock - Remove dead stores to stack-allocated locations in the
|
2007-08-08 17:50:09 +00:00
|
|
|
/// function end block. Ex:
|
|
|
|
/// %A = alloca i32
|
|
|
|
/// ...
|
|
|
|
/// store i32 1, i32* %A
|
|
|
|
/// ret void
|
2008-11-28 00:27:14 +00:00
|
|
|
bool DSE::handleEndBlock(BasicBlock &BB) {
|
2007-07-12 21:41:30 +00:00
|
|
|
bool MadeChange = false;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:32:12 +00:00
|
|
|
// Keep track of all of the stack objects that are dead at the end of the
|
|
|
|
// function.
|
|
|
|
SmallPtrSet<Value*, 16> DeadStackObjects;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2008-11-28 00:27:14 +00:00
|
|
|
// Find all of the alloca'd pointers in the entry block.
|
2007-07-12 21:41:30 +00:00
|
|
|
BasicBlock *Entry = BB.getParent()->begin();
|
2011-10-22 21:59:35 +00:00
|
|
|
for (BasicBlock::iterator I = Entry->begin(), E = Entry->end(); I != E; ++I) {
|
2007-07-12 21:41:30 +00:00
|
|
|
if (AllocaInst *AI = dyn_cast<AllocaInst>(I))
|
2010-11-30 21:32:12 +00:00
|
|
|
DeadStackObjects.insert(AI);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2011-10-22 21:59:35 +00:00
|
|
|
// Okay, so these are dead heap objects, but if the pointer never escapes
|
|
|
|
// then it's leaked by this function anyways.
|
|
|
|
if (CallInst *CI = extractMallocCall(I))
|
|
|
|
if (!PointerMayBeCaptured(CI, true, true))
|
|
|
|
DeadStackObjects.insert(CI);
|
|
|
|
}
|
|
|
|
|
2008-11-28 00:27:14 +00:00
|
|
|
// Treat byval arguments the same, stores to them are dead at the end of the
|
|
|
|
// function.
|
2008-01-29 06:18:36 +00:00
|
|
|
for (Function::arg_iterator AI = BB.getParent()->arg_begin(),
|
|
|
|
AE = BB.getParent()->arg_end(); AI != AE; ++AI)
|
|
|
|
if (AI->hasByValAttr())
|
2010-11-30 21:32:12 +00:00
|
|
|
DeadStackObjects.insert(AI);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2007-07-12 21:41:30 +00:00
|
|
|
// Scan the basic block backwards
|
|
|
|
for (BasicBlock::iterator BBI = BB.end(); BBI != BB.begin(); ){
|
|
|
|
--BBI;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 19:48:15 +00:00
|
|
|
// If we find a store, check to see if it points into a dead stack value.
|
|
|
|
if (hasMemoryWrite(BBI) && isRemovable(BBI)) {
|
|
|
|
// See through pointer-to-pointer bitcasts
|
2010-12-15 20:02:24 +00:00
|
|
|
Value *Pointer = GetUnderlyingObject(getStoredPointerOperand(BBI));
|
2010-11-30 19:48:15 +00:00
|
|
|
|
2010-11-30 21:58:14 +00:00
|
|
|
// Stores to stack values are valid candidates for removal.
|
2010-11-30 21:32:12 +00:00
|
|
|
if (DeadStackObjects.count(Pointer)) {
|
2010-11-30 19:48:15 +00:00
|
|
|
Instruction *Dead = BBI++;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-12-06 21:13:51 +00:00
|
|
|
DEBUG(dbgs() << "DSE: Dead Store at End of Block:\n DEAD: "
|
|
|
|
<< *Dead << "\n Object: " << *Pointer << '\n');
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-12-06 21:13:51 +00:00
|
|
|
// DCE instructions only used to calculate that store.
|
2010-11-30 21:58:14 +00:00
|
|
|
DeleteDeadInstruction(Dead, *MD, &DeadStackObjects);
|
2010-11-30 19:48:15 +00:00
|
|
|
++NumFastStores;
|
|
|
|
MadeChange = true;
|
2011-08-30 21:11:06 +00:00
|
|
|
continue;
|
2010-11-30 19:48:15 +00:00
|
|
|
}
|
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 19:48:15 +00:00
|
|
|
// Remove any dead non-memory-mutating instructions.
|
|
|
|
if (isInstructionTriviallyDead(BBI)) {
|
|
|
|
Instruction *Inst = BBI++;
|
2010-11-30 21:58:14 +00:00
|
|
|
DeleteDeadInstruction(Inst, *MD, &DeadStackObjects);
|
2010-11-30 19:48:15 +00:00
|
|
|
++NumFastOther;
|
|
|
|
MadeChange = true;
|
|
|
|
continue;
|
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 19:48:15 +00:00
|
|
|
if (AllocaInst *A = dyn_cast<AllocaInst>(BBI)) {
|
2010-11-30 21:32:12 +00:00
|
|
|
DeadStackObjects.erase(A);
|
2010-11-30 19:48:15 +00:00
|
|
|
continue;
|
2007-08-08 17:50:09 +00:00
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2011-10-22 21:59:35 +00:00
|
|
|
if (CallInst *CI = extractMallocCall(BBI)) {
|
|
|
|
DeadStackObjects.erase(CI);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2010-11-30 21:18:46 +00:00
|
|
|
if (CallSite CS = cast<Value>(BBI)) {
|
2010-11-30 19:48:15 +00:00
|
|
|
// If this call does not access memory, it can't be loading any of our
|
|
|
|
// pointers.
|
2010-11-30 19:34:42 +00:00
|
|
|
if (AA->doesNotAccessMemory(CS))
|
2007-08-08 17:58:56 +00:00
|
|
|
continue;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:18:46 +00:00
|
|
|
// If the call might load from any of our allocas, then any store above
|
|
|
|
// the call is live.
|
|
|
|
SmallVector<Value*, 8> LiveAllocas;
|
2010-11-30 21:32:12 +00:00
|
|
|
for (SmallPtrSet<Value*, 16>::iterator I = DeadStackObjects.begin(),
|
|
|
|
E = DeadStackObjects.end(); I != E; ++I) {
|
2010-11-30 21:18:46 +00:00
|
|
|
// See if the call site touches it.
|
2011-09-06 18:14:09 +00:00
|
|
|
AliasAnalysis::ModRefResult A =
|
2010-11-30 19:34:42 +00:00
|
|
|
AA->getModRefInfo(CS, *I, getPointerSize(*I, *AA));
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2007-07-13 18:26:26 +00:00
|
|
|
if (A == AliasAnalysis::ModRef || A == AliasAnalysis::Ref)
|
2010-11-30 21:18:46 +00:00
|
|
|
LiveAllocas.push_back(*I);
|
2007-07-12 21:41:30 +00:00
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:18:46 +00:00
|
|
|
for (SmallVector<Value*, 8>::iterator I = LiveAllocas.begin(),
|
|
|
|
E = LiveAllocas.end(); I != E; ++I)
|
2010-11-30 21:32:12 +00:00
|
|
|
DeadStackObjects.erase(*I);
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:18:46 +00:00
|
|
|
// If all of the allocas were clobbered by the call then we're not going
|
|
|
|
// to find anything else to process.
|
2010-11-30 21:32:12 +00:00
|
|
|
if (DeadStackObjects.empty())
|
2010-11-30 21:18:46 +00:00
|
|
|
return MadeChange;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2007-07-12 21:41:30 +00:00
|
|
|
continue;
|
2010-11-30 21:18:46 +00:00
|
|
|
}
|
2011-07-27 01:08:30 +00:00
|
|
|
|
2010-11-30 21:47:58 +00:00
|
|
|
AliasAnalysis::Location LoadedLoc;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:18:46 +00:00
|
|
|
// If we encounter a use of the pointer, it is no longer considered dead
|
|
|
|
if (LoadInst *L = dyn_cast<LoadInst>(BBI)) {
|
2011-08-17 22:22:24 +00:00
|
|
|
if (!L->isUnordered()) // Be conservative with atomic/volatile load
|
|
|
|
break;
|
2010-11-30 21:47:58 +00:00
|
|
|
LoadedLoc = AA->getLocation(L);
|
2010-11-30 21:18:46 +00:00
|
|
|
} else if (VAArgInst *V = dyn_cast<VAArgInst>(BBI)) {
|
2010-11-30 21:47:58 +00:00
|
|
|
LoadedLoc = AA->getLocation(V);
|
2010-11-30 21:18:46 +00:00
|
|
|
} else if (MemTransferInst *MTI = dyn_cast<MemTransferInst>(BBI)) {
|
2010-11-30 21:47:58 +00:00
|
|
|
LoadedLoc = AA->getLocationForSource(MTI);
|
2011-09-06 18:14:09 +00:00
|
|
|
} else if (!BBI->mayReadFromMemory()) {
|
|
|
|
// Instruction doesn't read memory. Note that stores that weren't removed
|
|
|
|
// above will hit this case.
|
2008-11-28 00:27:14 +00:00
|
|
|
continue;
|
2011-07-27 01:08:30 +00:00
|
|
|
} else {
|
|
|
|
// Unknown inst; assume it clobbers everything.
|
|
|
|
break;
|
2007-07-12 21:41:30 +00:00
|
|
|
}
|
2008-10-01 15:25:41 +00:00
|
|
|
|
2010-11-30 21:32:12 +00:00
|
|
|
// Remove any allocas from the DeadPointer set that are loaded, as this
|
|
|
|
// makes any stores above the access live.
|
2010-11-30 21:47:58 +00:00
|
|
|
RemoveAccessedObjects(LoadedLoc, DeadStackObjects);
|
2008-10-01 15:25:41 +00:00
|
|
|
|
2010-11-30 21:32:12 +00:00
|
|
|
// If all of the allocas were clobbered by the access then we're not going
|
|
|
|
// to find anything else to process.
|
|
|
|
if (DeadStackObjects.empty())
|
|
|
|
break;
|
2007-07-12 21:41:30 +00:00
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2007-07-12 21:41:30 +00:00
|
|
|
return MadeChange;
|
|
|
|
}
|
|
|
|
|
2010-11-30 21:32:12 +00:00
|
|
|
/// RemoveAccessedObjects - Check to see if the specified location may alias any
|
|
|
|
/// of the stack objects in the DeadStackObjects set. If so, they become live
|
|
|
|
/// because the location is being loaded.
|
2010-11-30 21:47:58 +00:00
|
|
|
void DSE::RemoveAccessedObjects(const AliasAnalysis::Location &LoadedLoc,
|
2010-11-30 21:32:12 +00:00
|
|
|
SmallPtrSet<Value*, 16> &DeadStackObjects) {
|
2010-12-15 20:02:24 +00:00
|
|
|
const Value *UnderlyingPointer = GetUnderlyingObject(LoadedLoc.Ptr);
|
2010-11-30 21:32:12 +00:00
|
|
|
|
|
|
|
// A constant can't be in the dead pointer set.
|
|
|
|
if (isa<Constant>(UnderlyingPointer))
|
2010-11-30 21:38:30 +00:00
|
|
|
return;
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:32:12 +00:00
|
|
|
// If the kill pointer can be easily reduced to an alloca, don't bother doing
|
|
|
|
// extraneous AA queries.
|
2010-11-30 21:38:30 +00:00
|
|
|
if (isa<AllocaInst>(UnderlyingPointer) || isa<Argument>(UnderlyingPointer)) {
|
2010-11-30 21:47:58 +00:00
|
|
|
DeadStackObjects.erase(const_cast<Value*>(UnderlyingPointer));
|
2010-11-30 21:38:30 +00:00
|
|
|
return;
|
2010-11-30 21:32:12 +00:00
|
|
|
}
|
2011-09-06 18:14:09 +00:00
|
|
|
|
2010-11-30 21:32:12 +00:00
|
|
|
SmallVector<Value*, 16> NowLive;
|
|
|
|
for (SmallPtrSet<Value*, 16>::iterator I = DeadStackObjects.begin(),
|
|
|
|
E = DeadStackObjects.end(); I != E; ++I) {
|
2010-11-30 21:47:58 +00:00
|
|
|
// See if the loaded location could alias the stack location.
|
|
|
|
AliasAnalysis::Location StackLoc(*I, getPointerSize(*I, *AA));
|
|
|
|
if (!AA->isNoAlias(StackLoc, LoadedLoc))
|
2010-11-30 21:32:12 +00:00
|
|
|
NowLive.push_back(*I);
|
2007-07-12 21:41:30 +00:00
|
|
|
}
|
|
|
|
|
2010-11-30 21:32:12 +00:00
|
|
|
for (SmallVector<Value*, 16>::iterator I = NowLive.begin(), E = NowLive.end();
|
2007-07-12 21:41:30 +00:00
|
|
|
I != E; ++I)
|
2010-11-30 21:32:12 +00:00
|
|
|
DeadStackObjects.erase(*I);
|
2007-07-12 21:41:30 +00:00
|
|
|
}
|