HomeSort by relevance Sort by last modified time
    Searched refs:BECount (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/Transforms/Scalar/
LoopIdiomRecognize.cpp 148 bool runOnLoopBlock(BasicBlock *BB, const SCEV *BECount,
151 bool processLoopStore(StoreInst *SI, const SCEV *BECount);
152 bool processLoopMemSet(MemSetInst *MSI, const SCEV *BECount);
158 const SCEV *BECount);
162 const SCEV *BECount);
613 const SCEV *BECount = SE->getBackedgeTakenCount(CurLoop);
614 if (isa<SCEVCouldNotCompute>(BECount)) return false;
618 if (const SCEVConstant *BECst = dyn_cast<SCEVConstant>(BECount))
646 MadeChange |= runOnLoopBlock(*BI, BECount, ExitBlocks);
684 bool LoopIdiomRecognize::runOnLoopBlock(BasicBlock *BB, const SCEV *BECount,
    [all...]
IndVarSimplify.cpp     [all...]
  /external/llvm/lib/Transforms/Utils/
LoopUnrollRuntime.cpp 62 static void ConnectProlog(Loop *L, Value *BECount, unsigned Count,
119 // If BECount <u (Count - 1) then (BECount + 1) & (Count - 1) == (BECount + 1)
120 // (since Count is a power of 2). This means %xtraiter is (BECount + 1) and
122 // that if BECount <u (Count - 1) then (BECount + 1) cannot unsigned-overflow.
124 new ICmpInst(InsertPt, ICmpInst::ICMP_ULT, BECount,
125 ConstantInt::get(BECount->getType(), Count - 1));
353 Value *BECount = Expander.expandCodeFor(BECountSC, BECountSC->getType()
    [all...]
  /external/llvm/lib/Analysis/
ScalarEvolution.cpp     [all...]

Completed in 789 milliseconds