Lines Matching refs:Loop

62 static Loop *getInnerMostLoop(const LoopVectorTy &Loops) {  in getInnerMostLoop()
65   Loop *LastLoop = Loops.back();  in getInnerMostLoop()
66   Loop *ParentLoop = LastLoop->getParentLoop();  in getInnerMostLoop()
74                           [](const Loop *L1, const Loop *L2) {  in getInnerMostLoop()
82                                   const Loop &L, ScalarEvolution &SE) {  in isOneDimensionalArray()
109 static const SCEV *computeTripCount(const Loop &L, const SCEV &ElemSize,  in computeTripCount()
216                                    unsigned MaxDistance, const Loop &L,  in hasTemporalReuse()
272 CacheCostTy IndexedReference::computeRefCost(const Loop &L,  in computeRefCost()
380   if (Loop *L = LI.getLoopFor(BB)) {  in delinearize()
450 bool IndexedReference::isLoopInvariant(const Loop &L) const {  in isLoopInvariant()
467 bool IndexedReference::isConsecutive(const Loop &L, const SCEV *&Stride,  in isConsecutive()
501 int IndexedReference::getSubscriptIndex(const Loop &L) const {  in getSubscriptIndex()
518                                                      const Loop &L) const {  in isCoeffForLoopZeroOrInvariant()
525                                              const Loop &L) const {  in isSimpleAddRecurrence()
556     const Loop *L = LC.first;  in operator <<()
570   for (const Loop *L : Loops) {  in CacheCost()
580 CacheCost::getCacheCost(Loop &Root, LoopStandardAnalysisResults &AR,  in getCacheCost()
606   for (const Loop *L : Loops) {  in calculateCacheFootprint()
623   Loop *InnerMostLoop = getInnerMostLoop(Loops);  in populateReferenceGroups()
696 CacheCost::computeLoopCacheCost(const Loop &L,  in computeLoopCacheCost()
725                                                 const Loop &L) const {  in computeRefGroupCacheCost()
735 PreservedAnalyses LoopCachePrinterPass::run(Loop &L, LoopAnalysisManager &AM,  in run()