HomeSort by: relevance | last modified time | path
    Searched defs:BECount (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LoopUnrollRuntime.cpp 70 static void ConnectProlog(Loop *L, Value *BECount, unsigned Count,
157 // If BECount <u (Count - 1) then (BECount + 1) % Count == (BECount + 1)
158 // This means %xtraiter is (BECount + 1) and all of the iterations of this
159 // loop were executed by the prologue. Note that if BECount <u (Count - 1)
160 // then (BECount + 1) cannot unsigned-overflow.
162 B.CreateICmpULT(BECount, ConstantInt::get(BECount->getType(), Count - 1));
751 Value *BECount = Expander.expandCodeFor(BECountSC, BECountSC->getType()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonLoopIdiomRecognition.cpp 135 bool processCopyingStore(Loop *CurLoop, StoreInst *SI, const SCEV *BECount);
137 bool runOnLoopBlock(Loop *CurLoop, BasicBlock *BB, const SCEV *BECount,
1988 const SCEV *BECount, unsigned StoreSize,
1997 // size to be exactly the size of the memset, which is (BECount+1)*StoreSize
1998 if (const SCEVConstant *BECst = dyn_cast<SCEVConstant>(BECount))
2028 StoreInst *SI, const SCEV *BECount) {
2068 Type *BECountTy = BECount->getType();
2091 if (mayLoopAccessLocation(StoreBasePtr, ModRefInfo::ModRef, CurLoop, BECount,
2096 BECount, StoreSize, *AA, Ignore1)) {
2138 if (mayLoopAccessLocation(LoadBasePtr, ModRefInfo::Mod, CurLoop, BECount,
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopIdiomRecognize.cpp 202 bool runOnLoopBlock(BasicBlock *BB, const SCEV *BECount,
208 bool processLoopStores(SmallVectorImpl<StoreInst *> &SL, const SCEV *BECount,
215 const SCEV *BECount);
216 bool processLoopMemCpy(MemCpyInst *MCI, const SCEV *BECount);
217 bool processLoopMemSet(MemSetInst *MSI, const SCEV *BECount);
223 const SCEVAddRecExpr *Ev, const SCEV *BECount,
225 bool processLoopStoreOfLoopLoad(StoreInst *SI, const SCEV *BECount);
232 const SCEV *BECount);
386 const SCEV *BECount = SE->getBackedgeTakenCount(CurLoop);
387 assert(!isa<SCEVCouldNotCompute>(BECount) &
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DependenceAnalysis.cpp 1028 const SCEV *BECount = SE->getBackedgeTakenCount(AddRec->getLoop());
1029 if (!isa<SCEVCouldNotCompute>(BECount)) {
1030 const SCEV *Limit = AddRec->evaluateAtIteration(BECount, *SE);

Completed in 74 milliseconds