61 static Loop *getInnerMostLoop(const LoopVectorTy &Loops) {  in getInnerMostLoop()  argument
62   assert(!Loops.empty() && "Expecting a non-empy loop vector");  in getInnerMostLoop()
64   Loop *LastLoop = Loops.back();  in getInnerMostLoop()
68     assert(Loops.size() == 1 && "Expecting a single loop");  in getInnerMostLoop()
72   return (llvm::is_sorted(Loops,  in getInnerMostLoop()
479 CacheCost::CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI,  in CacheCost()  argument
483     : Loops(Loops), TripCounts(), LoopCosts(),  in CacheCost()
486   assert(!Loops.empty() && "Expecting a non-empty loop vector.");  in CacheCost()
488   for (const Loop *L : Loops) {  in CacheCost()
505   LoopVectorTy Loops;  in getCacheCost()  local
506   append_range(Loops, breadth_first(&Root));  in getCacheCost()
508   if (!getInnerMostLoop(Loops)) {  in getCacheCost()
514   return std::make_unique<CacheCost>(Loops, AR.LI, AR.SE, AR.TTI, AR.AA, DI, TRT);  in getCacheCost()
524   for (const Loop *L : Loops) {  in calculateCacheFootprint()
542   Loop *InnerMostLoop = getInnerMostLoop(Loops);  in populateReferenceGroups()