Lines Matching refs:Paths
506 SmallVector<DefPath, 32> Paths; member in __anonb08d52880511::ClobberWalker
565 auto UpwardDefs = make_range(upward_defs_begin({Phi, Paths[PriorNode].Loc}), in addSearches()
568 PausedSearches.push_back(Paths.size()); in addSearches()
569 Paths.emplace_back(P.second, P.first, PriorNode); in addSearches()
600 DefPath &Node = Paths[PathIndex]; in getBlockingAccess()
682 T &curNode() const { return W->Paths[*N]; } in curNode()
712 assert(!Paths.empty() && NP >= &Paths.front() && NP <= &Paths.back() && in defPathIndex()
714 return NP - &Paths.front(); in defPathIndex()
732 assert(Paths.empty() && VisitedPhis.empty() && in tryOptimizePhi()
735 Paths.emplace_back(Loc, Start, Phi, None); in tryOptimizePhi()
738 auto PriorPathsSize = Paths.size(); in tryOptimizePhi()
748 auto MoveDominatedPathToEnd = [&](SmallVectorImpl<TerminatedPath> &Paths) { in tryOptimizePhi() argument
749 assert(!Paths.empty() && "Need a path to move"); in tryOptimizePhi()
750 auto Dom = Paths.begin(); in tryOptimizePhi()
751 for (auto I = std::next(Dom), E = Paths.end(); I != E; ++I) in tryOptimizePhi()
754 auto Last = Paths.end() - 1; in tryOptimizePhi()
828 UpwardsWalkResult WR = walkToPhiOrClobber(Paths[Paused]); in tryOptimizePhi()
863 [&](ListIndex I) { return Paths[I].Last == DefChainEnd; })); in tryOptimizePhi()
868 PriorPathsSize = Paths.size(); in tryOptimizePhi()
885 Paths.clear(); in resetPhiOptznState()