92         for (auto *Pred : MBB->predecessors()) {  in ReachabilityGraph()  local
93           assert(inRegion(Pred));  in ReachabilityGraph()
159         for (auto *Pred : MBB->predecessors()) {  in calculate()  local
160           if (Reachable[Pred].insert(Succ).second) {  in calculate()
161             WorkList.emplace_back(Pred, Succ);  in calculate()
178       for (auto *Pred : Looper->predecessors()) {  in calculate()  local
181         if (!canReach(Looper, Pred)) {  in calculate()
183           LoopEnterers[Looper].insert(Pred);  in calculate()
213     for (auto *Pred : Entry->predecessors()) {  in calculate()  local
214       if (!Enterers.count(Pred)) {  in calculate()
215         WorkList.push_back(Pred);  in calculate()
216         AddedToWorkList.insert(Pred);  in calculate()
224         for (auto *Pred : MBB->predecessors()) {  in calculate()  local
225           if (AddedToWorkList.insert(Pred).second)  in calculate()
226             WorkList.push_back(Pred);  in calculate()
394     for (auto *Pred : Entry->predecessors()) {  in makeSingleEntryLoop()  local
395       if (Pred != Dispatch) {  in makeSingleEntryLoop()
396         AllPreds.push_back(Pred);  in makeSingleEntryLoop()
403   for (auto *Pred : AllPreds) {  in makeSingleEntryLoop()  local
404     for (auto *Entry : Pred->successors()) {  in makeSingleEntryLoop()
407       if (Graph.canReach(Entry, Pred)) {  in makeSingleEntryLoop()
408         InLoop.insert(Pred);  in makeSingleEntryLoop()
418   for (auto *Pred : AllPreds) {  in makeSingleEntryLoop()  local
419     bool PredInLoop = InLoop.count(Pred);  in makeSingleEntryLoop()
420     for (auto *Entry : Pred->successors())  in makeSingleEntryLoop()
421       if (Entries.count(Entry) && Pred->isLayoutSuccessor(Entry))  in makeSingleEntryLoop()
422         EntryToLayoutPred[{Entry, PredInLoop}] = Pred;  in makeSingleEntryLoop()
431   for (auto *Pred : AllPreds) {  in makeSingleEntryLoop()  local
432     bool PredInLoop = InLoop.count(Pred);  in makeSingleEntryLoop()
433     for (auto *Entry : Pred->successors()) {  in makeSingleEntryLoop()
440         if (OtherPred != Pred)  in makeSingleEntryLoop()
445       MF.insert(Pred->isLayoutSuccessor(Entry)  in makeSingleEntryLoop()
461   for (auto *Pred : AllPreds) {  in makeSingleEntryLoop()  local
462     bool PredInLoop = InLoop.count(Pred);  in makeSingleEntryLoop()
464     for (MachineInstr &Term : Pred->terminators())  in makeSingleEntryLoop()
469     for (auto *Succ : Pred->successors()) {  in makeSingleEntryLoop()
473       Pred->replaceSuccessor(Succ, Routing);  in makeSingleEntryLoop()