Lines Matching defs:Walker
120 MemorySSAWalker *Walker;
125 : MSSA(M), Walker(M->getWalker()), BAA(M->getAA()) {}
136 MemoryAccess *Clobber = Walker->getClobberingMemoryAccess(MA, BAA);
695 template <typename T, typename Walker>
697 : public iterator_facade_base<generic_def_path_iterator<T, Walker>,
700 generic_def_path_iterator(Walker *W, ListIndex N) : W(W), N(N) {}
718 Walker *W = nullptr;
989 ClobberWalker Walker;
993 ClobberWalkerBase(MemorySSA *M, DominatorTree *D) : Walker(*M, *D), MSSA(M) {}
1003 // Walker instantiations will decide how to set the SkipSelf bool.
1013 ClobberWalkerBase *Walker;
1017 : MemorySSAWalker(M), Walker(W) {}
1024 return Walker->getClobberingMemoryAccessBase(MA, BAA, UWL, false);
1029 return Walker->getClobberingMemoryAccessBase(MA, Loc, BAA, UWL);
1034 return Walker->getClobberingMemoryAccessBase(MA, BAA, UWL, false, false);
1056 ClobberWalkerBase *Walker;
1060 : MemorySSAWalker(M), Walker(W) {}
1067 return Walker->getClobberingMemoryAccessBase(MA, BAA, UWL, true);
1072 return Walker->getClobberingMemoryAccessBase(MA, Loc, BAA, UWL);
1234 : DT(DT), F(&Func), LiveOnEntryDef(nullptr), Walker(nullptr),
1252 : DT(DT), L(&L), LiveOnEntryDef(nullptr), Walker(nullptr),
1306 OptimizeUses(MemorySSA *MSSA, CachingWalker *Walker, BatchAAResults *BAA,
1308 : MSSA(MSSA), Walker(Walker), AA(BAA), DT(DT) {}
1335 CachingWalker *Walker;
1457 Walker->getClobberingMemoryAccessWithoutInvariantGroup(
1593 if (Walker)
1594 return Walker.get();
1599 Walker = std::make_unique<CachingWalker>(this, WalkerBase.get());
1600 return Walker.get();
2483 Walker.findClobber(BAA, StartingAccess, Q, UpwardWalkLimit);
2589 Walker.findClobber(BAA, DefiningAccess, Q, UpwardWalkLimit);
2604 Result = Walker.findClobber(BAA, OptimizedAccess, Q, UpwardWalkLimit);