123 ConvergenceRegion::ConvergenceRegion(DominatorTree &DT, LoopInfo &LI,  in ConvergenceRegion()  argument
125     : DT(DT), LI(LI), Parent(nullptr) {  in ConvergenceRegion()
136     DominatorTree &DT, LoopInfo &LI,  in ConvergenceRegion()  argument
139     : DT(DT), LI(LI), ConvergenceToken(ConvergenceToken), Entry(Entry),  in ConvergenceRegion()
201   ConvergenceRegionAnalyzer(Function &F, DominatorTree &DT, LoopInfo &LI)  in ConvergenceRegionAnalyzer()  argument
202       : DT(DT), LI(LI), F(F) {}  in ConvergenceRegionAnalyzer()
212     if (!LI.isLoopHeader(To))  in isBackEdge()
215     auto *L = LI.getLoopFor(To);  in isBackEdge()
223   findPathsToMatch(LoopInfo &LI, BasicBlock *From,  in findPathsToMatch()  argument
236       auto ChildSet = findPathsToMatch(LI, To, isMatch);  in findPathsToMatch()
242       if (LI.isLoopHeader(From)) {  in findPathsToMatch()
243         auto *L = LI.getLoopFor(From);  in findPathsToMatch()
271     ConvergenceRegion *TopLevelRegion = new ConvergenceRegion(DT, LI, F);  in analyze()
273     for (auto *L : LI.getLoopsInPreorder())  in analyze()
288           auto N = findPathsToMatch(LI, Exit, [&CT](const BasicBlock *block) {  in analyze()
300           DT, LI, CT, L->getHeader(), std::move(RegionBlocks),  in analyze()
312   LoopInfo &LI;  member in llvm::SPIRV::ConvergenceRegionAnalyzer
317                                             LoopInfo &LI) {  in getConvergenceRegions()  argument
318   ConvergenceRegionAnalyzer Analyzer(F, DT, LI);  in getConvergenceRegions()
332   LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();  in runOnFunction()  local
334   CRI = SPIRV::getConvergenceRegions(F, DT, LI);  in runOnFunction()
343   auto &LI = AM.getResult<LoopAnalysis>(F);  in run()  local
344   CRI = SPIRV::getConvergenceRegions(F, DT, LI);  in run()