Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp

74   ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks)
75       : Entry(Entry), Blocks(Blocks) {
79       if (MBB != Entry) {
113   MachineBasicBlock *Entry;
133         if (Succ != Entry && inRegion(Succ)) {
143       assert(inRegion(MBB) && Succ != Entry && inRegion(Succ));
144       if (MBB != Entry) {
161     assert(!Loopers.count(Entry));
182   LoopBlocks(MachineBasicBlock *Entry, const BlockSet &Enterers)
183       : Entry(Entry), Enterers(Enterers) {
190   MachineBasicBlock *Entry;
200     Blocks.insert(Entry);
201     for (auto *Pred : Entry->predecessors()) {
230   bool processRegion(MachineBasicBlock *Entry, BlockSet &Blocks,
242     MachineBasicBlock *Entry, BlockSet &Blocks, MachineFunction &MF) {
248     ReachabilityGraph Graph(Entry, Blocks);
368   for (auto *Entry : SortedEntries) {
369     auto Pair = Indices.insert(std::make_pair(Entry, 0));
375     MIB.addMBB(Entry);
376     Dispatch->addSuccessor(Entry);
384   for (auto *Entry : SortedEntries) {
385     for (auto *Pred : Entry->predecessors()) {
395     for (auto *Entry : Pred->successors()) {
396       if (!Entries.count(Entry))
398       if (Graph.canReach(Entry, Pred)) {
410     for (auto *Entry : Pred->successors())
411       if (Entries.count(Entry) && Pred->isLayoutSuccessor(Entry))
412         EntryToLayoutPred[std::make_pair(InLoop.count(Pred), Entry)] = Pred;
421     for (auto *Entry : Pred->successors()) {
422       if (!Entries.count(Entry) ||
423           Map.count(std::make_pair(InLoop.count(Pred), Entry)))
428       if (EntryToLayoutPred.count(std::make_pair(PredInLoop, Entry)) &&
429           EntryToLayoutPred[std::make_pair(PredInLoop, Entry)] != Pred)
434       MF.insert(Pred->isLayoutSuccessor(Entry)
435                     ? MachineFunction::iterator(Entry)
443           .addImm(Indices[Entry]);
446       Map[std::make_pair(PredInLoop, Entry)] = Routing;