521   SmallVector<DefPath, 32> Paths;  member in __anon72856b230511::ClobberWalker
596     auto UpwardDefsBegin = upward_defs_begin({Phi, Paths[PriorNode].Loc}, DT);  in addSearches()
599       PausedSearches.push_back(Paths.size());  in addSearches()
600       Paths.emplace_back(P.second, P.first, PriorNode);  in addSearches()
632       DefPath &Node = Paths[PathIndex];  in getBlockingAccess()
716     T &curNode() const { return W->Paths[*N]; }  in curNode()
746     assert(!Paths.empty() && NP >= &Paths.front() && NP <= &Paths.back() &&  in defPathIndex()
748     return NP - &Paths.front();  in defPathIndex()
766     assert(Paths.empty() && VisitedPhis.empty() &&  in tryOptimizePhi()
769     Paths.emplace_back(Loc, Start, Phi, std::nullopt);  in tryOptimizePhi()
772     auto PriorPathsSize = Paths.size();  in tryOptimizePhi()
782     auto MoveDominatedPathToEnd = [&](SmallVectorImpl<TerminatedPath> &Paths) {  in tryOptimizePhi()  argument
783       assert(!Paths.empty() && "Need a path to move");  in tryOptimizePhi()
784       auto Dom = Paths.begin();  in tryOptimizePhi()
785       for (auto I = std::next(Dom), E = Paths.end(); I != E; ++I)  in tryOptimizePhi()
788       auto Last = Paths.end() - 1;  in tryOptimizePhi()
862         UpwardsWalkResult WR = walkToPhiOrClobber(Paths[Paused]);  in tryOptimizePhi()
898                     [&](ListIndex I) { return Paths[I].Last == DefChainEnd; }));  in tryOptimizePhi()
903       PriorPathsSize = Paths.size();  in tryOptimizePhi()
920     Paths.clear();  in resetPhiOptznState()