Owen Anderson | 30767b1 | 2007-11-27 22:47:08 +0000 | [diff] [blame] | 1 | //===- MachineLoopInfo.cpp - Natural Loop Calculator ----------------------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | f3ebc3f | 2007-12-29 20:36:04 +0000 | [diff] [blame] | 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
Owen Anderson | 30767b1 | 2007-11-27 22:47:08 +0000 | [diff] [blame] | 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This file defines the MachineLoopInfo class that is used to identify natural |
| 11 | // loops and determine the loop depth of various nodes of the CFG. Note that |
Andrew Trick | cda51d4 | 2012-06-20 03:42:09 +0000 | [diff] [blame] | 12 | // the loops identified may actually be several natural loops that share the |
Owen Anderson | 30767b1 | 2007-11-27 22:47:08 +0000 | [diff] [blame] | 13 | // same header node... not just a single natural loop. |
| 14 | // |
| 15 | //===----------------------------------------------------------------------===// |
| 16 | |
| 17 | #include "llvm/CodeGen/MachineLoopInfo.h" |
Chandler Carruth | ed0881b | 2012-12-03 16:50:05 +0000 | [diff] [blame] | 18 | #include "llvm/Analysis/LoopInfoImpl.h" |
Owen Anderson | 30767b1 | 2007-11-27 22:47:08 +0000 | [diff] [blame] | 19 | #include "llvm/CodeGen/MachineDominators.h" |
Bill Wendling | 0c20943 | 2008-01-04 20:54:55 +0000 | [diff] [blame] | 20 | #include "llvm/CodeGen/Passes.h" |
Dan Gohman | c3f2137 | 2010-01-05 21:08:02 +0000 | [diff] [blame] | 21 | #include "llvm/Support/Debug.h" |
Benjamin Kramer | 799003b | 2015-03-23 19:32:43 +0000 | [diff] [blame] | 22 | #include "llvm/Support/raw_ostream.h" |
Owen Anderson | 30767b1 | 2007-11-27 22:47:08 +0000 | [diff] [blame] | 23 | using namespace llvm; |
| 24 | |
Andrew Trick | cda51d4 | 2012-06-20 03:42:09 +0000 | [diff] [blame] | 25 | // Explicitly instantiate methods in LoopInfoImpl.h for MI-level Loops. |
| 26 | template class llvm::LoopBase<MachineBasicBlock, MachineLoop>; |
| 27 | template class llvm::LoopInfoBase<MachineBasicBlock, MachineLoop>; |
Owen Anderson | 30767b1 | 2007-11-27 22:47:08 +0000 | [diff] [blame] | 28 | |
Chris Lattner | 7eac714 | 2008-01-05 23:29:51 +0000 | [diff] [blame] | 29 | char MachineLoopInfo::ID = 0; |
Owen Anderson | 8ac477f | 2010-10-12 19:48:12 +0000 | [diff] [blame] | 30 | INITIALIZE_PASS_BEGIN(MachineLoopInfo, "machine-loops", |
| 31 | "Machine Natural Loop Construction", true, true) |
| 32 | INITIALIZE_PASS_DEPENDENCY(MachineDominatorTree) |
| 33 | INITIALIZE_PASS_END(MachineLoopInfo, "machine-loops", |
Owen Anderson | df7a4f2 | 2010-10-07 22:25:06 +0000 | [diff] [blame] | 34 | "Machine Natural Loop Construction", true, true) |
Bill Wendling | 0c20943 | 2008-01-04 20:54:55 +0000 | [diff] [blame] | 35 | |
Owen Anderson | a7aed18 | 2010-08-06 18:33:48 +0000 | [diff] [blame] | 36 | char &llvm::MachineLoopInfoID = MachineLoopInfo::ID; |
Owen Anderson | 30767b1 | 2007-11-27 22:47:08 +0000 | [diff] [blame] | 37 | |
| 38 | bool MachineLoopInfo::runOnMachineFunction(MachineFunction &) { |
| 39 | releaseMemory(); |
Cong Hou | d2c1d91 | 2015-07-16 18:23:57 +0000 | [diff] [blame] | 40 | LI.analyze(getAnalysis<MachineDominatorTree>().getBase()); |
Owen Anderson | 30767b1 | 2007-11-27 22:47:08 +0000 | [diff] [blame] | 41 | return false; |
| 42 | } |
| 43 | |
| 44 | void MachineLoopInfo::getAnalysisUsage(AnalysisUsage &AU) const { |
| 45 | AU.setPreservesAll(); |
| 46 | AU.addRequired<MachineDominatorTree>(); |
Dan Gohman | 5ea74d5 | 2009-07-31 18:16:33 +0000 | [diff] [blame] | 47 | MachineFunctionPass::getAnalysisUsage(AU); |
Owen Anderson | 30767b1 | 2007-11-27 22:47:08 +0000 | [diff] [blame] | 48 | } |
Dan Gohman | d383c2f | 2009-10-20 04:16:37 +0000 | [diff] [blame] | 49 | |
| 50 | MachineBasicBlock *MachineLoop::getTopBlock() { |
| 51 | MachineBasicBlock *TopMBB = getHeader(); |
| 52 | MachineFunction::iterator Begin = TopMBB->getParent()->begin(); |
Duncan P. N. Exon Smith | e9bc579 | 2016-02-21 20:39:50 +0000 | [diff] [blame] | 53 | if (TopMBB->getIterator() != Begin) { |
Duncan P. N. Exon Smith | 5ec1568 | 2015-10-09 19:40:45 +0000 | [diff] [blame] | 54 | MachineBasicBlock *PriorMBB = &*std::prev(TopMBB->getIterator()); |
Dan Gohman | d383c2f | 2009-10-20 04:16:37 +0000 | [diff] [blame] | 55 | while (contains(PriorMBB)) { |
| 56 | TopMBB = PriorMBB; |
Duncan P. N. Exon Smith | e9bc579 | 2016-02-21 20:39:50 +0000 | [diff] [blame] | 57 | if (TopMBB->getIterator() == Begin) |
| 58 | break; |
Duncan P. N. Exon Smith | 5ec1568 | 2015-10-09 19:40:45 +0000 | [diff] [blame] | 59 | PriorMBB = &*std::prev(TopMBB->getIterator()); |
Dan Gohman | d383c2f | 2009-10-20 04:16:37 +0000 | [diff] [blame] | 60 | } |
| 61 | } |
| 62 | return TopMBB; |
| 63 | } |
| 64 | |
| 65 | MachineBasicBlock *MachineLoop::getBottomBlock() { |
| 66 | MachineBasicBlock *BotMBB = getHeader(); |
| 67 | MachineFunction::iterator End = BotMBB->getParent()->end(); |
Duncan P. N. Exon Smith | e9bc579 | 2016-02-21 20:39:50 +0000 | [diff] [blame] | 68 | if (BotMBB->getIterator() != std::prev(End)) { |
Duncan P. N. Exon Smith | 5ec1568 | 2015-10-09 19:40:45 +0000 | [diff] [blame] | 69 | MachineBasicBlock *NextMBB = &*std::next(BotMBB->getIterator()); |
Dan Gohman | d383c2f | 2009-10-20 04:16:37 +0000 | [diff] [blame] | 70 | while (contains(NextMBB)) { |
| 71 | BotMBB = NextMBB; |
Duncan P. N. Exon Smith | 5ec1568 | 2015-10-09 19:40:45 +0000 | [diff] [blame] | 72 | if (BotMBB == &*std::next(BotMBB->getIterator())) |
| 73 | break; |
| 74 | NextMBB = &*std::next(BotMBB->getIterator()); |
Dan Gohman | d383c2f | 2009-10-20 04:16:37 +0000 | [diff] [blame] | 75 | } |
| 76 | } |
| 77 | return BotMBB; |
| 78 | } |
Dan Gohman | c3f2137 | 2010-01-05 21:08:02 +0000 | [diff] [blame] | 79 | |
Sjoerd Meijer | 5815671 | 2016-08-15 08:22:42 +0000 | [diff] [blame] | 80 | MachineBasicBlock *MachineLoop::findLoopControlBlock() { |
| 81 | if (MachineBasicBlock *Latch = getLoopLatch()) { |
| 82 | if (isLoopExiting(Latch)) |
| 83 | return Latch; |
| 84 | else |
| 85 | return getExitingBlock(); |
| 86 | } |
| 87 | return nullptr; |
| 88 | } |
| 89 | |
| 90 | MachineBasicBlock * |
| 91 | MachineLoopInfo::findLoopPreheader(MachineLoop *L, |
| 92 | bool SpeculativePreheader) const { |
| 93 | if (MachineBasicBlock *PB = L->getLoopPreheader()) |
| 94 | return PB; |
| 95 | |
| 96 | if (!SpeculativePreheader) |
| 97 | return nullptr; |
| 98 | |
| 99 | MachineBasicBlock *HB = L->getHeader(), *LB = L->getLoopLatch(); |
| 100 | if (HB->pred_size() != 2 || HB->hasAddressTaken()) |
| 101 | return nullptr; |
| 102 | // Find the predecessor of the header that is not the latch block. |
| 103 | MachineBasicBlock *Preheader = nullptr; |
| 104 | for (MachineBasicBlock *P : HB->predecessors()) { |
| 105 | if (P == LB) |
| 106 | continue; |
| 107 | // Sanity. |
| 108 | if (Preheader) |
| 109 | return nullptr; |
| 110 | Preheader = P; |
| 111 | } |
| 112 | |
| 113 | // Check if the preheader candidate is a successor of any other loop |
| 114 | // headers. We want to avoid having two loop setups in the same block. |
| 115 | for (MachineBasicBlock *S : Preheader->successors()) { |
| 116 | if (S == HB) |
| 117 | continue; |
| 118 | MachineLoop *T = getLoopFor(S); |
| 119 | if (T && T->getHeader() == S) |
| 120 | return nullptr; |
| 121 | } |
| 122 | return Preheader; |
| 123 | } |
| 124 | |
Manman Ren | 19f49ac | 2012-09-11 22:23:19 +0000 | [diff] [blame] | 125 | #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP) |
Yaron Keren | eb2a254 | 2016-01-29 20:50:44 +0000 | [diff] [blame] | 126 | LLVM_DUMP_METHOD void MachineLoop::dump() const { |
Dan Gohman | c3f2137 | 2010-01-05 21:08:02 +0000 | [diff] [blame] | 127 | print(dbgs()); |
| 128 | } |
Manman Ren | 742534c | 2012-09-06 19:06:06 +0000 | [diff] [blame] | 129 | #endif |