520   AccessAnalysis(Loop *TheLoop, AAResults *AA, LoopInfo *LI,  in AccessAnalysis()  argument
523       : TheLoop(TheLoop), AST(*AA), LI(LI), DepCands(DA),  in AccessAnalysis()
553                             Loop *TheLoop, unsigned &RunningDepId,
563                        Loop *TheLoop, const ValueToValueMap &Strides,
598   const Loop *TheLoop;  member in __anon511544270111::AccessAnalysis
673                                           Loop *TheLoop, unsigned &RunningDepId,  in createCheckForAccess()  argument
678   if (!hasComputableBounds(PSE, StridesMap, Ptr, TheLoop, Assume))  in createCheckForAccess()
683   if (ShouldCheckWrap && !isNoWrap(PSE, StridesMap, Ptr, TheLoop)) {  in createCheckForAccess()
704   RtCheck.insert(TheLoop, Ptr, IsWrite, DepId, ASId, StridesMap, PSE);  in createCheckForAccess()
711                                      ScalarEvolution *SE, Loop *TheLoop,  in canCheckPtrAtRT()  argument
769       if (!createCheckForAccess(RtCheck, Access, StridesMap, DepSetId, TheLoop,  in canCheckPtrAtRT()
798                                   TheLoop, RunningDepId, ASId,  in canCheckPtrAtRT()
956                     TheLoop->getHeader()->getParent(),  in processMemAccesses()
1769                     << TheLoop->getHeader()->getParent()->getName() << ": "  in canAnalyzeLoop()
1770                     << TheLoop->getHeader()->getName() << '\n');  in canAnalyzeLoop()
1773   if (!TheLoop->isInnermost()) {  in canAnalyzeLoop()
1780   if (TheLoop->getNumBackEdges() != 1) {  in canAnalyzeLoop()
1821   const bool IsAnnotatedParallel = TheLoop->isAnnotatedParallel();  in analyzeLoop()
1825       !TheLoop->getHeader()->getParent()->hasOptSize();  in analyzeLoop()
1828   for (BasicBlock *BB : TheLoop->blocks()) {  in analyzeLoop()
1929   AccessAnalysis Accesses(TheLoop, AA, LI, DependentAccesses, *PSE);  in analyzeLoop()
1958       if (blockNeedsPredication(ST->getParent(), TheLoop, DT))  in analyzeLoop()
1985         !getPtrStride(*PSE, Ptr, TheLoop, SymbolicStrides)) {  in analyzeLoop()
2002     if (blockNeedsPredication(LD->getParent(), TheLoop, DT))  in analyzeLoop()
2023                                                   TheLoop, SymbolicStrides);  in analyzeLoop()
2052       CanDoRTIfNeeded = Accesses.canCheckPtrAtRT(*PtrRtChecking, SE, TheLoop,  in analyzeLoop()
2092 bool LoopAccessInfo::blockNeedsPredication(BasicBlock *BB, Loop *TheLoop,  in blockNeedsPredication()  argument
2094   assert(TheLoop->contains(BB) && "Unknown block used");  in blockNeedsPredication()
2097   BasicBlock* Latch = TheLoop->getLoopLatch();  in blockNeedsPredication()
2105   Value *CodeRegion = TheLoop->getHeader();  in recordAnalysis()
2106   DebugLoc DL = TheLoop->getStartLoc();  in recordAnalysis()
2129   return (SE->isLoopInvariant(SE->getSCEV(V), TheLoop));  in isUniform()
2137   Value *Stride = getStrideFromPointer(Ptr, PSE->getSE(), TheLoop);  in collectStridedAccess()
2164   const DataLayout &DL = TheLoop->getHeader()->getModule()->getDataLayout();  in collectStridedAccess()
2196       DepChecker(std::make_unique<MemoryDepChecker>(*PSE, L)), TheLoop(L),  in LoopAccessInfo()