sketch more of this out.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@122567 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2010-12-26 20:45:45 +00:00
parent d7c8ccae8e
commit 22920b5986

View File

@ -17,6 +17,8 @@
#include "llvm/Transforms/Scalar.h" #include "llvm/Transforms/Scalar.h"
#include "llvm/Analysis/LoopPass.h" #include "llvm/Analysis/LoopPass.h"
#include "llvm/Analysis/ScalarEvolutionExpressions.h" #include "llvm/Analysis/ScalarEvolutionExpressions.h"
#include "llvm/Analysis/ValueTracking.h"
#include "llvm/Target/TargetData.h"
#include "llvm/Support/Debug.h" #include "llvm/Support/Debug.h"
#include "llvm/Support/raw_ostream.h" #include "llvm/Support/raw_ostream.h"
using namespace llvm; using namespace llvm;
@ -26,6 +28,9 @@ using namespace llvm;
namespace { namespace {
class LoopIdiomRecognize : public LoopPass { class LoopIdiomRecognize : public LoopPass {
Loop *CurLoop;
const TargetData *TD;
ScalarEvolution *SE;
public: public:
static char ID; static char ID;
explicit LoopIdiomRecognize() : LoopPass(ID) { explicit LoopIdiomRecognize() : LoopPass(ID) {
@ -34,7 +39,7 @@ namespace {
bool runOnLoop(Loop *L, LPPassManager &LPM); bool runOnLoop(Loop *L, LPPassManager &LPM);
bool scanBlock(BasicBlock *BB, Loop *L); bool processLoopStore(StoreInst *SI, const SCEV *BECount);
/// This transformation requires natural loop information & requires that /// This transformation requires natural loop information & requires that
/// loop preheaders be inserted into the CFG. /// loop preheaders be inserted into the CFG.
@ -66,37 +71,76 @@ INITIALIZE_PASS_END(LoopIdiomRecognize, "loop-idiom", "Recognize loop idioms",
Pass *llvm::createLoopIdiomPass() { return new LoopIdiomRecognize(); } Pass *llvm::createLoopIdiomPass() { return new LoopIdiomRecognize(); }
bool LoopIdiomRecognize::runOnLoop(Loop *L, LPPassManager &LPM) { bool LoopIdiomRecognize::runOnLoop(Loop *L, LPPassManager &LPM) {
CurLoop = L;
// We only look at trivial single basic block loops. // We only look at trivial single basic block loops.
// TODO: eventually support more complex loops, scanning the header. // TODO: eventually support more complex loops, scanning the header.
if (L->getBlocks().size() != 1) if (L->getBlocks().size() != 1)
return false; return false;
// The trip count of the loop must be analyzable.
SE = &getAnalysis<ScalarEvolution>();
if (!SE->hasLoopInvariantBackedgeTakenCount(L))
return false;
const SCEV *BECount = SE->getBackedgeTakenCount(L);
if (isa<SCEVCouldNotCompute>(BECount)) return false;
// We require target data for now.
TD = getAnalysisIfAvailable<TargetData>();
if (TD == 0) return false;
BasicBlock *BB = L->getHeader(); BasicBlock *BB = L->getHeader();
DEBUG(dbgs() << "Loop Idiom Recognize: F[" << BB->getParent()->getName() DEBUG(dbgs() << "loop-idiom Scanning: F[" << BB->getParent()->getName()
<< "] Loop %" << BB->getName() << "\n"); << "] Loop %" << BB->getName() << "\n");
return scanBlock(BB, L); bool MadeChange = false;
for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
// Look for store instructions, which may be memsets.
if (StoreInst *SI = dyn_cast<StoreInst>(I++))
MadeChange |= processLoopStore(SI, BECount);
}
return MadeChange;
} }
/// scanBlock - Look over a block to see if we can promote anything out of it. /// scanBlock - Look over a block to see if we can promote anything out of it.
bool LoopIdiomRecognize::scanBlock(BasicBlock *BB, Loop *L) { bool LoopIdiomRecognize::processLoopStore(StoreInst *SI, const SCEV *BECount) {
ScalarEvolution &SE = getAnalysis<ScalarEvolution>(); Value *StoredVal = SI->getValueOperand();
for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) { // Check to see if the store updates all bits in memory. We don't want to
// Look for store instructions, which may be memsets. // process things like a store of i3. We also require that the store be a
StoreInst *SI = dyn_cast<StoreInst>(I++); // multiple of a byte.
if (SI == 0) continue; uint64_t SizeInBits = TD->getTypeSizeInBits(StoredVal->getType());
if ((SizeInBits & 7) || (SizeInBits >> 32) != 0 ||
SizeInBits != TD->getTypeStoreSizeInBits(StoredVal->getType()))
return false;
// See if the pointer expression is an AddRec like {base,+,1} on the current // See if the pointer expression is an AddRec like {base,+,1} on the current
// loop, which indicates a strided store. If we have something else, it's a // loop, which indicates a strided store. If we have something else, it's a
// random store we can't handle. // random store we can't handle.
const SCEVAddRecExpr *Ev = const SCEVAddRecExpr *Ev =
dyn_cast<SCEVAddRecExpr>(SE.getSCEV(SI->getPointerOperand())); dyn_cast<SCEVAddRecExpr>(SE->getSCEV(SI->getPointerOperand()));
if (Ev == 0 || Ev->getLoop() != L) if (Ev == 0 || Ev->getLoop() != CurLoop || !Ev->isAffine())
continue; return false;
// Check to see if the stride matches the size of the store. If so, then we
// know that every byte is touched in the loop.
unsigned StoreSize = (unsigned)SizeInBits >> 3;
const SCEVConstant *Stride = dyn_cast<SCEVConstant>(Ev->getOperand(1));
if (Stride == 0 || StoreSize != Stride->getValue()->getValue())
return false;
errs() << "Found strided store: " << *Ev << "\n"; errs() << "Found strided store: " << *Ev << "\n";
}
// Check for memcpy here.
// If the stored value is a byte-wise value (like i32 -1), then it may be
// turned into a memset of i8 -1, assuming that all the consequtive bytes
// are stored. A store of i32 0x01020304 can never be turned into a memset.
Value *SplatValue = isBytewiseValue(StoredVal);
if (SplatValue == 0) return false;
return false; return false;
} }