Lines Matching refs:Loop

1 //===- LoopCacheAnalysis.cpp - Loop Cache Analysis -------------------------==//
62 static Loop *getInnerMostLoop(const LoopVectorTy &Loops) {
65   Loop *LastLoop = Loops.back();
66   Loop *ParentLoop = LastLoop->getParentLoop();
74                           [](const Loop *L1, const Loop *L2) {
82                                   const Loop &L, ScalarEvolution &SE) {
109 static const SCEV *computeTripCount(const Loop &L, const SCEV &ElemSize,
216                                    unsigned MaxDistance, const Loop &L,
272 CacheCostTy IndexedReference::computeRefCost(const Loop &L,
380   if (Loop *L = LI.getLoopFor(BB)) {
398       LLVM_DEBUG(dbgs().indent(2) << "In Loop '" << L->getName()
406       LLVM_DEBUG(dbgs().indent(2) << "In Loop '" << L->getName()
450 bool IndexedReference::isLoopInvariant(const Loop &L) const {
467 bool IndexedReference::isConsecutive(const Loop &L, const SCEV *&Stride,
501 int IndexedReference::getSubscriptIndex(const Loop &L) const {
518                                                      const Loop &L) const {
525                                              const Loop &L) const {
556     const Loop *L = LC.first;
557     OS << "Loop '" << L->getName() << "' has cost = " << LC.second << "\n";
570   for (const Loop *L : Loops) {
580 CacheCost::getCacheCost(Loop &Root, LoopStandardAnalysisResults &AR,
606   for (const Loop *L : Loops) {
623   Loop *InnerMostLoop = getInnerMostLoop(Loops);
696 CacheCost::computeLoopCacheCost(const Loop &L,
718   LLVM_DEBUG(dbgs().indent(2) << "Loop '" << L.getName()
725                                                 const Loop &L) const {
735 PreservedAnalyses LoopCachePrinterPass::run(Loop &L, LoopAnalysisManager &AM,