119 static const Loop *getOutermostLoop(LoopInfo *LI, const BasicBlock *BB) {  in getOutermostLoop()  argument
120   const Loop *L = LI->getLoopFor(BB);  in getOutermostLoop()
129 static bool loopContainsBoth(LoopInfo *LI,  in loopContainsBoth()  argument
131   const Loop *L1 = getOutermostLoop(LI, BB1);  in loopContainsBoth()
132   const Loop *L2 = getOutermostLoop(LI, BB2);  in loopContainsBoth()
138                                             LoopInfo *LI) {  in isPotentiallyReachableSameBlock()  argument
154   if (LI && HasLoop) {  in isPotentiallyReachableSameBlock()
155     HasLoop = LI->getLoopFor(BB) != 0;  in isPotentiallyReachableSameBlock()
169                                   DominatorTree *DT, LoopInfo *LI) {  in isPotentiallyReachable()  argument
176     return isPotentiallyReachableSameBlock(A, B, LI);  in isPotentiallyReachable()
204     if (LI && loopContainsBoth(LI, BB, StopBB))  in isPotentiallyReachable()
213     if (const Loop *Outer = LI ? getOutermostLoop(LI, BB) : 0) {  in isPotentiallyReachable()