86   ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks)  in ReachabilityGraph()  argument
87       : Entry(Entry), Blocks(Blocks) {  in ReachabilityGraph()
91       if (MBB != Entry) {  in ReachabilityGraph()
125   MachineBasicBlock *Entry;  member in __anon00d7e6300111::ReachabilityGraph
145         if (Succ != Entry && inRegion(Succ)) {  in calculate()
155       assert(inRegion(MBB) && Succ != Entry && inRegion(Succ));  in calculate()
156       if (MBB != Entry) {  in calculate()
173     assert(!Loopers.count(Entry));  in calculate()
194   LoopBlocks(MachineBasicBlock *Entry, const BlockSet &Enterers)  in LoopBlocks()  argument
195       : Entry(Entry), Enterers(Enterers) {  in LoopBlocks()
202   MachineBasicBlock *Entry;  member in __anon00d7e6300111::LoopBlocks
212     Blocks.insert(Entry);  in calculate()
213     for (auto *Pred : Entry->predecessors()) {  in calculate()
240   bool processRegion(MachineBasicBlock *Entry, BlockSet &Blocks,
252     MachineBasicBlock *Entry, BlockSet &Blocks, MachineFunction &MF) {  in processRegion()  argument
257     ReachabilityGraph Graph(Entry, Blocks);  in processRegion()
377   for (auto *Entry : SortedEntries) {  in makeSingleEntryLoop()  local
378     auto Pair = Indices.insert(std::make_pair(Entry, 0));  in makeSingleEntryLoop()
384     MIB.addMBB(Entry);  in makeSingleEntryLoop()
385     Dispatch->addSuccessor(Entry);  in makeSingleEntryLoop()
393   for (auto *Entry : SortedEntries) {  in makeSingleEntryLoop()  local
394     for (auto *Pred : Entry->predecessors()) {  in makeSingleEntryLoop()
404     for (auto *Entry : Pred->successors()) {  in makeSingleEntryLoop()  local
405       if (!Entries.count(Entry))  in makeSingleEntryLoop()
407       if (Graph.canReach(Entry, Pred)) {  in makeSingleEntryLoop()
420     for (auto *Entry : Pred->successors())  in makeSingleEntryLoop()  local
421       if (Entries.count(Entry) && Pred->isLayoutSuccessor(Entry))  in makeSingleEntryLoop()
422         EntryToLayoutPred[{Entry, PredInLoop}] = Pred;  in makeSingleEntryLoop()
433     for (auto *Entry : Pred->successors()) {  in makeSingleEntryLoop()  local
434       if (!Entries.count(Entry) || Map.count({Entry, PredInLoop}))  in makeSingleEntryLoop()
439       if (auto *OtherPred = EntryToLayoutPred.lookup({Entry, PredInLoop}))  in makeSingleEntryLoop()
445       MF.insert(Pred->isLayoutSuccessor(Entry)  in makeSingleEntryLoop()
446                     ? MachineFunction::iterator(Entry)  in makeSingleEntryLoop()
454           .addImm(Indices[Entry]);  in makeSingleEntryLoop()
457       Map[{Entry, PredInLoop}] = Routing;  in makeSingleEntryLoop()
507   MachineBasicBlock &Entry = *MF.begin();  in addImplicitDefs()  local
519     BuildMI(Entry, Entry.begin(), DebugLoc(),  in addImplicitDefs()
525   for (MachineInstr &MI : llvm::make_early_inc_range(Entry)) {  in addImplicitDefs()
528       Entry.insert(Entry.begin(), &MI);  in addImplicitDefs()