85   ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks)  in ReachabilityGraph()  argument
86       : Entry(Entry), Blocks(Blocks) {  in ReachabilityGraph()
90       if (MBB != Entry) {  in ReachabilityGraph()
124   MachineBasicBlock *Entry;  member in __anonf457146f0111::ReachabilityGraph
144         if (Succ != Entry && inRegion(Succ)) {  in calculate()
154       assert(inRegion(MBB) && Succ != Entry && inRegion(Succ));  in calculate()
155       if (MBB != Entry) {  in calculate()
172     assert(!Loopers.count(Entry));  in calculate()
193   LoopBlocks(MachineBasicBlock *Entry, const BlockSet &Enterers)  in LoopBlocks()  argument
194       : Entry(Entry), Enterers(Enterers) {  in LoopBlocks()
201   MachineBasicBlock *Entry;  member in __anonf457146f0111::LoopBlocks
211     Blocks.insert(Entry);  in calculate()
212     for (auto *Pred : Entry->predecessors()) {  in calculate()
241   bool processRegion(MachineBasicBlock *Entry, BlockSet &Blocks,
253     MachineBasicBlock *Entry, BlockSet &Blocks, MachineFunction &MF) {  in processRegion()  argument
258     ReachabilityGraph Graph(Entry, Blocks);  in processRegion()
378   for (auto *Entry : SortedEntries) {  in makeSingleEntryLoop()  local
379     auto Pair = Indices.insert(std::make_pair(Entry, 0));  in makeSingleEntryLoop()
385     MIB.addMBB(Entry);  in makeSingleEntryLoop()
386     Dispatch->addSuccessor(Entry);  in makeSingleEntryLoop()
394   for (auto *Entry : SortedEntries) {  in makeSingleEntryLoop()  local
395     for (auto *Pred : Entry->predecessors()) {  in makeSingleEntryLoop()
405     for (auto *Entry : Pred->successors()) {  in makeSingleEntryLoop()  local
406       if (!Entries.count(Entry))  in makeSingleEntryLoop()
408       if (Graph.canReach(Entry, Pred)) {  in makeSingleEntryLoop()
421     for (auto *Entry : Pred->successors())  in makeSingleEntryLoop()  local
422       if (Entries.count(Entry) && Pred->isLayoutSuccessor(Entry))  in makeSingleEntryLoop()
423         EntryToLayoutPred[{Entry, PredInLoop}] = Pred;  in makeSingleEntryLoop()
434     for (auto *Entry : Pred->successors()) {  in makeSingleEntryLoop()  local
435       if (!Entries.count(Entry) || Map.count({Entry, PredInLoop}))  in makeSingleEntryLoop()
440       if (auto *OtherPred = EntryToLayoutPred.lookup({Entry, PredInLoop}))  in makeSingleEntryLoop()
446       MF.insert(Pred->isLayoutSuccessor(Entry)  in makeSingleEntryLoop()
447                     ? MachineFunction::iterator(Entry)  in makeSingleEntryLoop()
455           .addImm(Indices[Entry]);  in makeSingleEntryLoop()
458       Map[{Entry, PredInLoop}] = Routing;  in makeSingleEntryLoop()