mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-02-21 06:30:16 +00:00
whitespace
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@127589 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Andrew Trick
parent
ae3ce17bac
commit
d99b39e43b
@ -81,7 +81,7 @@ namespace {
|
||||
|
||||
bool processLoopStore(StoreInst *SI, const SCEV *BECount);
|
||||
bool processLoopMemSet(MemSetInst *MSI, const SCEV *BECount);
|
||||
|
||||
|
||||
bool processLoopStridedStore(Value *DestPtr, unsigned StoreSize,
|
||||
unsigned StoreAlignment,
|
||||
Value *SplatValue, Instruction *TheStore,
|
||||
@ -91,7 +91,7 @@ namespace {
|
||||
const SCEVAddRecExpr *StoreEv,
|
||||
const SCEVAddRecExpr *LoadEv,
|
||||
const SCEV *BECount);
|
||||
|
||||
|
||||
/// This transformation requires natural loop information & requires that
|
||||
/// loop preheaders be inserted into the CFG.
|
||||
///
|
||||
@ -134,50 +134,50 @@ Pass *llvm::createLoopIdiomPass() { return new LoopIdiomRecognize(); }
|
||||
///
|
||||
static void DeleteDeadInstruction(Instruction *I, ScalarEvolution &SE) {
|
||||
SmallVector<Instruction*, 32> NowDeadInsts;
|
||||
|
||||
|
||||
NowDeadInsts.push_back(I);
|
||||
|
||||
|
||||
// Before we touch this instruction, remove it from SE!
|
||||
do {
|
||||
Instruction *DeadInst = NowDeadInsts.pop_back_val();
|
||||
|
||||
|
||||
// This instruction is dead, zap it, in stages. Start by removing it from
|
||||
// SCEV.
|
||||
SE.forgetValue(DeadInst);
|
||||
|
||||
|
||||
for (unsigned op = 0, e = DeadInst->getNumOperands(); op != e; ++op) {
|
||||
Value *Op = DeadInst->getOperand(op);
|
||||
DeadInst->setOperand(op, 0);
|
||||
|
||||
|
||||
// If this operand just became dead, add it to the NowDeadInsts list.
|
||||
if (!Op->use_empty()) continue;
|
||||
|
||||
|
||||
if (Instruction *OpI = dyn_cast<Instruction>(Op))
|
||||
if (isInstructionTriviallyDead(OpI))
|
||||
NowDeadInsts.push_back(OpI);
|
||||
}
|
||||
|
||||
|
||||
DeadInst->eraseFromParent();
|
||||
|
||||
|
||||
} while (!NowDeadInsts.empty());
|
||||
}
|
||||
|
||||
bool LoopIdiomRecognize::runOnLoop(Loop *L, LPPassManager &LPM) {
|
||||
CurLoop = L;
|
||||
|
||||
|
||||
// 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;
|
||||
|
||||
|
||||
// If this loop executes exactly one time, then it should be peeled, not
|
||||
// optimized by this pass.
|
||||
if (const SCEVConstant *BECst = dyn_cast<SCEVConstant>(BECount))
|
||||
if (BECst->getValue()->getValue() == 0)
|
||||
return false;
|
||||
|
||||
|
||||
// We require target data for now.
|
||||
TD = getAnalysisIfAvailable<TargetData>();
|
||||
if (TD == 0) return false;
|
||||
@ -185,14 +185,14 @@ bool LoopIdiomRecognize::runOnLoop(Loop *L, LPPassManager &LPM) {
|
||||
DT = &getAnalysis<DominatorTree>();
|
||||
LoopInfo &LI = getAnalysis<LoopInfo>();
|
||||
TLI = &getAnalysis<TargetLibraryInfo>();
|
||||
|
||||
|
||||
SmallVector<BasicBlock*, 8> ExitBlocks;
|
||||
CurLoop->getUniqueExitBlocks(ExitBlocks);
|
||||
|
||||
DEBUG(dbgs() << "loop-idiom Scanning: F["
|
||||
<< L->getHeader()->getParent()->getName()
|
||||
<< "] Loop %" << L->getHeader()->getName() << "\n");
|
||||
|
||||
|
||||
bool MadeChange = false;
|
||||
// Scan all the blocks in the loop that are not in subloops.
|
||||
for (Loop::block_iterator BI = L->block_begin(), E = L->block_end(); BI != E;
|
||||
@ -200,7 +200,7 @@ bool LoopIdiomRecognize::runOnLoop(Loop *L, LPPassManager &LPM) {
|
||||
// Ignore blocks in subloops.
|
||||
if (LI.getLoopFor(*BI) != CurLoop)
|
||||
continue;
|
||||
|
||||
|
||||
MadeChange |= runOnLoopBlock(*BI, BECount, ExitBlocks);
|
||||
}
|
||||
return MadeChange;
|
||||
@ -217,7 +217,7 @@ bool LoopIdiomRecognize::runOnLoopBlock(BasicBlock *BB, const SCEV *BECount,
|
||||
for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i)
|
||||
if (!DT->dominates(BB, ExitBlocks[i]))
|
||||
return false;
|
||||
|
||||
|
||||
bool MadeChange = false;
|
||||
for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
|
||||
Instruction *Inst = I++;
|
||||
@ -226,20 +226,20 @@ bool LoopIdiomRecognize::runOnLoopBlock(BasicBlock *BB, const SCEV *BECount,
|
||||
WeakVH InstPtr(I);
|
||||
if (!processLoopStore(SI, BECount)) continue;
|
||||
MadeChange = true;
|
||||
|
||||
|
||||
// If processing the store invalidated our iterator, start over from the
|
||||
// top of the block.
|
||||
if (InstPtr == 0)
|
||||
I = BB->begin();
|
||||
continue;
|
||||
}
|
||||
|
||||
|
||||
// Look for memset instructions, which may be optimized to a larger memset.
|
||||
if (MemSetInst *MSI = dyn_cast<MemSetInst>(Inst)) {
|
||||
WeakVH InstPtr(I);
|
||||
if (!processLoopMemSet(MSI, BECount)) continue;
|
||||
MadeChange = true;
|
||||
|
||||
|
||||
// If processing the memset invalidated our iterator, start over from the
|
||||
// top of the block.
|
||||
if (InstPtr == 0)
|
||||
@ -247,7 +247,7 @@ bool LoopIdiomRecognize::runOnLoopBlock(BasicBlock *BB, const SCEV *BECount,
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
return MadeChange;
|
||||
}
|
||||
|
||||
@ -258,12 +258,12 @@ bool LoopIdiomRecognize::processLoopStore(StoreInst *SI, const SCEV *BECount) {
|
||||
|
||||
Value *StoredVal = SI->getValueOperand();
|
||||
Value *StorePtr = SI->getPointerOperand();
|
||||
|
||||
|
||||
// Reject stores that are so large that they overflow an unsigned.
|
||||
uint64_t SizeInBits = TD->getTypeSizeInBits(StoredVal->getType());
|
||||
if ((SizeInBits & 7) || (SizeInBits >> 32) != 0)
|
||||
return false;
|
||||
|
||||
|
||||
// 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
|
||||
// random store we can't handle.
|
||||
@ -274,9 +274,9 @@ bool LoopIdiomRecognize::processLoopStore(StoreInst *SI, const SCEV *BECount) {
|
||||
|
||||
// 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;
|
||||
unsigned StoreSize = (unsigned)SizeInBits >> 3;
|
||||
const SCEVConstant *Stride = dyn_cast<SCEVConstant>(StoreEv->getOperand(1));
|
||||
|
||||
|
||||
if (Stride == 0 || StoreSize != Stride->getValue()->getValue()) {
|
||||
// TODO: Could also handle negative stride here someday, that will require
|
||||
// the validity check in mayLoopAccessLocation to be updated though.
|
||||
@ -285,7 +285,7 @@ bool LoopIdiomRecognize::processLoopStore(StoreInst *SI, const SCEV *BECount) {
|
||||
dbgs() << "NEGATIVE STRIDE: " << *SI << "\n";
|
||||
dbgs() << "BB: " << *SI->getParent();
|
||||
}
|
||||
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
@ -319,9 +319,9 @@ processLoopMemSet(MemSetInst *MSI, const SCEV *BECount) {
|
||||
// If we're not allowed to hack on memset, we fail.
|
||||
if (!TLI->has(LibFunc::memset))
|
||||
return false;
|
||||
|
||||
|
||||
Value *Pointer = MSI->getDest();
|
||||
|
||||
|
||||
// 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
|
||||
// random store we can't handle.
|
||||
@ -333,16 +333,16 @@ processLoopMemSet(MemSetInst *MSI, const SCEV *BECount) {
|
||||
uint64_t SizeInBytes = cast<ConstantInt>(MSI->getLength())->getZExtValue();
|
||||
if ((SizeInBytes >> 32) != 0)
|
||||
return false;
|
||||
|
||||
|
||||
// Check to see if the stride matches the size of the memset. If so, then we
|
||||
// know that every byte is touched in the loop.
|
||||
const SCEVConstant *Stride = dyn_cast<SCEVConstant>(Ev->getOperand(1));
|
||||
|
||||
|
||||
// TODO: Could also handle negative stride here someday, that will require the
|
||||
// validity check in mayLoopAccessLocation to be updated though.
|
||||
if (Stride == 0 || MSI->getLength() != Stride->getValue())
|
||||
return false;
|
||||
|
||||
|
||||
return processLoopStridedStore(Pointer, (unsigned)SizeInBytes,
|
||||
MSI->getAlignment(), MSI->getValue(),
|
||||
MSI, Ev, BECount);
|
||||
@ -365,7 +365,7 @@ static bool mayLoopAccessLocation(Value *Ptr,AliasAnalysis::ModRefResult Access,
|
||||
// to be exactly the size of the memset, which is (BECount+1)*StoreSize
|
||||
if (const SCEVConstant *BECst = dyn_cast<SCEVConstant>(BECount))
|
||||
AccessSize = (BECst->getValue()->getZExtValue()+1)*StoreSize;
|
||||
|
||||
|
||||
// TODO: For this to be really effective, we have to dive into the pointer
|
||||
// operand in the store. Store to &A[i] of 100 will always return may alias
|
||||
// with store of &A[100], we need to StoreLoc to be "A" with size of 100,
|
||||
@ -394,12 +394,12 @@ static Constant *getMemSetPatternValue(Value *V, const TargetData &TD) {
|
||||
// that doesn't seem worthwhile.
|
||||
Constant *C = dyn_cast<Constant>(V);
|
||||
if (C == 0) return 0;
|
||||
|
||||
|
||||
// Only handle simple values that are a power of two bytes in size.
|
||||
uint64_t Size = TD.getTypeSizeInBits(V->getType());
|
||||
if (Size == 0 || (Size & 7) || (Size & (Size-1)))
|
||||
return 0;
|
||||
|
||||
|
||||
// Don't care enough about darwin/ppc to implement this.
|
||||
if (TD.isBigEndian())
|
||||
return 0;
|
||||
@ -410,7 +410,7 @@ static Constant *getMemSetPatternValue(Value *V, const TargetData &TD) {
|
||||
// TODO: If CI is larger than 16-bytes, we can try slicing it in half to see
|
||||
// if the top and bottom are the same (e.g. for vectors and large integers).
|
||||
if (Size > 16) return 0;
|
||||
|
||||
|
||||
// If the constant is exactly 16 bytes, just use it.
|
||||
if (Size == 16) return C;
|
||||
|
||||
@ -428,14 +428,14 @@ processLoopStridedStore(Value *DestPtr, unsigned StoreSize,
|
||||
unsigned StoreAlignment, Value *StoredVal,
|
||||
Instruction *TheStore, const SCEVAddRecExpr *Ev,
|
||||
const SCEV *BECount) {
|
||||
|
||||
|
||||
// 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 consecutive bytes
|
||||
// are stored. A store of i32 0x01020304 can never be turned into a memset,
|
||||
// but it can be turned into memset_pattern if the target supports it.
|
||||
Value *SplatValue = isBytewiseValue(StoredVal);
|
||||
Constant *PatternValue = 0;
|
||||
|
||||
|
||||
// If we're allowed to form a memset, and the stored value would be acceptable
|
||||
// for memset, use it.
|
||||
if (SplatValue && TLI->has(LibFunc::memset) &&
|
||||
@ -453,8 +453,8 @@ processLoopStridedStore(Value *DestPtr, unsigned StoreSize,
|
||||
// do anything with a 3-byte store, for example.
|
||||
return false;
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
// Okay, we have a strided store "p[i]" of a splattable value. We can turn
|
||||
// this into a memset in the loop preheader now if we want. However, this
|
||||
// would be unsafe to do if there is anything else in the loop that may read
|
||||
@ -463,36 +463,36 @@ processLoopStridedStore(Value *DestPtr, unsigned StoreSize,
|
||||
CurLoop, BECount,
|
||||
StoreSize, getAnalysis<AliasAnalysis>(), TheStore))
|
||||
return false;
|
||||
|
||||
|
||||
// Okay, everything looks good, insert the memset.
|
||||
BasicBlock *Preheader = CurLoop->getLoopPreheader();
|
||||
|
||||
|
||||
IRBuilder<> Builder(Preheader->getTerminator());
|
||||
|
||||
|
||||
// The trip count of the loop and the base pointer of the addrec SCEV is
|
||||
// guaranteed to be loop invariant, which means that it should dominate the
|
||||
// header. Just insert code for it in the preheader.
|
||||
SCEVExpander Expander(*SE);
|
||||
|
||||
|
||||
unsigned AddrSpace = cast<PointerType>(DestPtr->getType())->getAddressSpace();
|
||||
Value *BasePtr =
|
||||
Value *BasePtr =
|
||||
Expander.expandCodeFor(Ev->getStart(), Builder.getInt8PtrTy(AddrSpace),
|
||||
Preheader->getTerminator());
|
||||
|
||||
|
||||
// The # stored bytes is (BECount+1)*Size. Expand the trip count out to
|
||||
// pointer size if it isn't already.
|
||||
const Type *IntPtr = TD->getIntPtrType(DestPtr->getContext());
|
||||
BECount = SE->getTruncateOrZeroExtend(BECount, IntPtr);
|
||||
|
||||
|
||||
const SCEV *NumBytesS = SE->getAddExpr(BECount, SE->getConstant(IntPtr, 1),
|
||||
true /*no unsigned overflow*/);
|
||||
if (StoreSize != 1)
|
||||
NumBytesS = SE->getMulExpr(NumBytesS, SE->getConstant(IntPtr, StoreSize),
|
||||
true /*no unsigned overflow*/);
|
||||
|
||||
Value *NumBytes =
|
||||
|
||||
Value *NumBytes =
|
||||
Expander.expandCodeFor(NumBytesS, IntPtr, Preheader->getTerminator());
|
||||
|
||||
|
||||
CallInst *NewCall;
|
||||
if (SplatValue)
|
||||
NewCall = Builder.CreateMemSet(BasePtr, SplatValue,NumBytes,StoreAlignment);
|
||||
@ -500,10 +500,10 @@ processLoopStridedStore(Value *DestPtr, unsigned StoreSize,
|
||||
Module *M = TheStore->getParent()->getParent()->getParent();
|
||||
Value *MSP = M->getOrInsertFunction("memset_pattern16",
|
||||
Builder.getVoidTy(),
|
||||
Builder.getInt8PtrTy(),
|
||||
Builder.getInt8PtrTy(),
|
||||
Builder.getInt8PtrTy(), IntPtr,
|
||||
(void*)0);
|
||||
|
||||
|
||||
// Otherwise we should form a memset_pattern16. PatternValue is known to be
|
||||
// an constant array of 16-bytes. Plop the value into a mergable global.
|
||||
GlobalVariable *GV = new GlobalVariable(*M, PatternValue->getType(), true,
|
||||
@ -514,11 +514,11 @@ processLoopStridedStore(Value *DestPtr, unsigned StoreSize,
|
||||
Value *PatternPtr = ConstantExpr::getBitCast(GV, Builder.getInt8PtrTy());
|
||||
NewCall = Builder.CreateCall3(MSP, BasePtr, PatternPtr, NumBytes);
|
||||
}
|
||||
|
||||
|
||||
DEBUG(dbgs() << " Formed memset: " << *NewCall << "\n"
|
||||
<< " from store to: " << *Ev << " at: " << *TheStore << "\n");
|
||||
NewCall->setDebugLoc(TheStore->getDebugLoc());
|
||||
|
||||
|
||||
// Okay, the memset has been formed. Zap the original store and anything that
|
||||
// feeds into it.
|
||||
DeleteDeadInstruction(TheStore, *SE);
|
||||
@ -536,9 +536,9 @@ processLoopStoreOfLoopLoad(StoreInst *SI, unsigned StoreSize,
|
||||
// If we're not allowed to form memcpy, we fail.
|
||||
if (!TLI->has(LibFunc::memcpy))
|
||||
return false;
|
||||
|
||||
|
||||
LoadInst *LI = cast<LoadInst>(SI->getValueOperand());
|
||||
|
||||
|
||||
// Okay, we have a strided store "p[i]" of a loaded value. We can turn
|
||||
// this into a memcpy in the loop preheader now if we want. However, this
|
||||
// would be unsafe to do if there is anything else in the loop that may read
|
||||
@ -555,49 +555,49 @@ processLoopStoreOfLoopLoad(StoreInst *SI, unsigned StoreSize,
|
||||
CurLoop, BECount, StoreSize,
|
||||
getAnalysis<AliasAnalysis>(), SI))
|
||||
return false;
|
||||
|
||||
|
||||
// Okay, everything looks good, insert the memcpy.
|
||||
BasicBlock *Preheader = CurLoop->getLoopPreheader();
|
||||
|
||||
|
||||
IRBuilder<> Builder(Preheader->getTerminator());
|
||||
|
||||
|
||||
// The trip count of the loop and the base pointer of the addrec SCEV is
|
||||
// guaranteed to be loop invariant, which means that it should dominate the
|
||||
// header. Just insert code for it in the preheader.
|
||||
SCEVExpander Expander(*SE);
|
||||
|
||||
Value *LoadBasePtr =
|
||||
Value *LoadBasePtr =
|
||||
Expander.expandCodeFor(LoadEv->getStart(),
|
||||
Builder.getInt8PtrTy(LI->getPointerAddressSpace()),
|
||||
Preheader->getTerminator());
|
||||
Value *StoreBasePtr =
|
||||
Value *StoreBasePtr =
|
||||
Expander.expandCodeFor(StoreEv->getStart(),
|
||||
Builder.getInt8PtrTy(SI->getPointerAddressSpace()),
|
||||
Preheader->getTerminator());
|
||||
|
||||
|
||||
// The # stored bytes is (BECount+1)*Size. Expand the trip count out to
|
||||
// pointer size if it isn't already.
|
||||
const Type *IntPtr = TD->getIntPtrType(SI->getContext());
|
||||
BECount = SE->getTruncateOrZeroExtend(BECount, IntPtr);
|
||||
|
||||
|
||||
const SCEV *NumBytesS = SE->getAddExpr(BECount, SE->getConstant(IntPtr, 1),
|
||||
true /*no unsigned overflow*/);
|
||||
if (StoreSize != 1)
|
||||
NumBytesS = SE->getMulExpr(NumBytesS, SE->getConstant(IntPtr, StoreSize),
|
||||
true /*no unsigned overflow*/);
|
||||
|
||||
|
||||
Value *NumBytes =
|
||||
Expander.expandCodeFor(NumBytesS, IntPtr, Preheader->getTerminator());
|
||||
|
||||
|
||||
Value *NewCall =
|
||||
Builder.CreateMemCpy(StoreBasePtr, LoadBasePtr, NumBytes,
|
||||
std::min(SI->getAlignment(), LI->getAlignment()));
|
||||
|
||||
|
||||
DEBUG(dbgs() << " Formed memcpy: " << *NewCall << "\n"
|
||||
<< " from load ptr=" << *LoadEv << " at: " << *LI << "\n"
|
||||
<< " from store ptr=" << *StoreEv << " at: " << *SI << "\n");
|
||||
(void)NewCall;
|
||||
|
||||
|
||||
// Okay, the memset has been formed. Zap the original store and anything that
|
||||
// feeds into it.
|
||||
DeleteDeadInstruction(SI, *SE);
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user