lib/Analysis/MemorySSA.cpp

489   using ListIndex = unsigned;
499     std::optional<ListIndex> Previous;
502             std::optional<ListIndex> Previous)
506             std::optional<ListIndex> Previous)
591   void addSearches(MemoryPhi *Phi, SmallVectorImpl<ListIndex> &PausedSearches,
592                    ListIndex PriorNode) {
606     ListIndex LastNode;
620                     SmallVectorImpl<ListIndex> &PausedSearches,
621                     SmallVectorImpl<ListIndex> &NewPaused,
628       ListIndex PathIndex = PausedSearches.pop_back_val();
697     generic_def_path_iterator(Walker *W, ListIndex N) : W(W), N(N) {}
716     std::optional<ListIndex> N;
723   iterator_range<def_path_iterator> def_path(ListIndex From) {
727   iterator_range<const_def_path_iterator> const_def_path(ListIndex From) const {
740   ListIndex defPathIndex(const DefPath &N) const {
771     SmallVector<ListIndex, 16> PausedSearches;
772     SmallVector<ListIndex, 8> NewPaused;
858       for (ListIndex Paused : NewPaused) {
895                     [&](ListIndex I) { return Paths[I].Last == DefChainEnd; }));
902       for (ListIndex I : NewPaused)