61 static Loop *getInnerMostLoop(const LoopVectorTy &Loops) {  in getInnerMostLoop()
64   Loop *LastLoop = Loops.back();  in getInnerMostLoop()
65   Loop *ParentLoop = LastLoop->getParentLoop();  in getInnerMostLoop()
73                           [](const Loop *L1, const Loop *L2) {  in getInnerMostLoop()
81                                   const Loop &L, ScalarEvolution &SE) {  in isOneDimensionalArray()
107 static const SCEV *computeTripCount(const Loop &L, ScalarEvolution &SE) {  in computeTripCount()
205                                                   const Loop &L,  in hasTemporalReuse()
262 CacheCostTy IndexedReference::computeRefCost(const Loop &L,  in computeRefCost()
330   if (Loop *L = LI.getLoopFor(BB)) {  in delinearize()
388 bool IndexedReference::isLoopInvariant(const Loop &L) const {  in isLoopInvariant()
405 bool IndexedReference::isConsecutive(const Loop &L, unsigned CLS) const {  in isConsecutive()
435                                                      const Loop &L) const {  in isCoeffForLoopZeroOrInvariant()
442                                              const Loop &L) const {  in isSimpleAddRecurrence()
473     const Loop *L = LC.first;  in operator <<()
488   for (const Loop *L : Loops) {  in CacheCost()
498 CacheCost::getCacheCost(Loop &Root, LoopStandardAnalysisResults &AR,  in getCacheCost()
524   for (const Loop *L : Loops) {  in calculateCacheFootprint()
542   Loop *InnerMostLoop = getInnerMostLoop(Loops);  in populateReferenceGroups()
615 CacheCost::computeLoopCacheCost(const Loop &L,  in computeLoopCacheCost()
644                                                 const Loop &L) const {  in computeRefGroupCacheCost()
654 PreservedAnalyses LoopCachePrinterPass::run(Loop &L, LoopAnalysisManager &AM,  in run()