106                  const DominatorTree *DT, bool IncludeI, const LoopInfo *LI)  in CapturesBefore()
107       : BeforeHere(I), DT(DT), ReturnCaptures(ReturnCaptures),  in CapturesBefore()
118     if (!DT->isReachableFromEntry(I->getParent()))  in isSafeToPrune()
122     return !isPotentiallyReachable(I, BeforeHere, nullptr, DT, LI);  in isSafeToPrune()
141   const DominatorTree *DT;  member
161   EarliestCaptures(bool ReturnCaptures, Function &F, const DominatorTree &DT)  in EarliestCaptures()
162       : DT(DT), ReturnCaptures(ReturnCaptures), F(F) {}  in EarliestCaptures()
177       EarliestCapture = DT.findNearestCommonDominator(EarliestCapture, I);  in captured()
187   const DominatorTree &DT;  member
239                                       const DominatorTree *DT, bool IncludeI,  in PointerMayBeCapturedBefore()  argument
245   if (!DT)  in PointerMayBeCapturedBefore()
252   CapturesBefore CB(ReturnCaptures, I, DT, IncludeI, LI);  in PointerMayBeCapturedBefore()
263                                        const DominatorTree &DT,  in FindEarliestCapture()  argument
268   EarliestCaptures CB(ReturnCaptures, F, DT);  in FindEarliestCapture()