blob: db77d192ccb395536bf6e5d0f7b1658d0bdee699 [file] [log] [blame]
Owen Andersone4ad9c72007-11-27 22:47:08 +00001//===- MachineLoopInfo.cpp - Natural Loop Calculator ----------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
Chris Lattner4ee451d2007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Owen Andersone4ad9c72007-11-27 22:47:08 +00007//
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
12// the loops identified may actually be several natural loops that share the
13// same header node... not just a single natural loop.
14//
15//===----------------------------------------------------------------------===//
16
17#include "llvm/CodeGen/MachineLoopInfo.h"
18#include "llvm/CodeGen/MachineDominators.h"
Bill Wendling67d65bb2008-01-04 20:54:55 +000019#include "llvm/CodeGen/Passes.h"
Owen Andersone4ad9c72007-11-27 22:47:08 +000020using namespace llvm;
21
Dan Gohmanc8d76d52009-07-13 21:51:15 +000022#define MLB class LoopBase<MachineBasicBlock, MachineLoop>
23TEMPLATE_INSTANTIATION(MLB);
24#undef MLB
25#define MLIB class LoopInfoBase<MachineBasicBlock, MachineLoop>
26TEMPLATE_INSTANTIATION(MLIB);
27#undef MLIB
Owen Andersone4ad9c72007-11-27 22:47:08 +000028
Chris Lattner19033bf2008-01-05 23:29:51 +000029char MachineLoopInfo::ID = 0;
Dan Gohman844731a2008-05-13 00:00:25 +000030static RegisterPass<MachineLoopInfo>
31X("machine-loops", "Machine Natural Loop Construction", true);
Bill Wendling67d65bb2008-01-04 20:54:55 +000032
Dan Gohman6ddba2b2008-05-13 02:05:11 +000033const PassInfo *const llvm::MachineLoopInfoID = &X;
Owen Andersone4ad9c72007-11-27 22:47:08 +000034
35bool MachineLoopInfo::runOnMachineFunction(MachineFunction &) {
36 releaseMemory();
Dan Gohman9d59d9f2009-06-27 21:22:48 +000037 LI.Calculate(getAnalysis<MachineDominatorTree>().getBase()); // Update
Owen Andersone4ad9c72007-11-27 22:47:08 +000038 return false;
39}
40
41void MachineLoopInfo::getAnalysisUsage(AnalysisUsage &AU) const {
42 AU.setPreservesAll();
43 AU.addRequired<MachineDominatorTree>();
Dan Gohmanad2afc22009-07-31 18:16:33 +000044 MachineFunctionPass::getAnalysisUsage(AU);
Owen Andersone4ad9c72007-11-27 22:47:08 +000045}
Dan Gohman81b16a32009-10-20 04:16:37 +000046
47MachineBasicBlock *MachineLoop::getTopBlock() {
48 MachineBasicBlock *TopMBB = getHeader();
49 MachineFunction::iterator Begin = TopMBB->getParent()->begin();
50 if (TopMBB != Begin) {
51 MachineBasicBlock *PriorMBB = prior(MachineFunction::iterator(TopMBB));
52 while (contains(PriorMBB)) {
53 TopMBB = PriorMBB;
54 if (TopMBB == Begin) break;
55 PriorMBB = prior(MachineFunction::iterator(TopMBB));
56 }
57 }
58 return TopMBB;
59}
60
61MachineBasicBlock *MachineLoop::getBottomBlock() {
62 MachineBasicBlock *BotMBB = getHeader();
63 MachineFunction::iterator End = BotMBB->getParent()->end();
64 if (BotMBB != prior(End)) {
65 MachineBasicBlock *NextMBB = next(MachineFunction::iterator(BotMBB));
66 while (contains(NextMBB)) {
67 BotMBB = NextMBB;
68 if (BotMBB == next(MachineFunction::iterator(BotMBB))) break;
69 NextMBB = next(MachineFunction::iterator(BotMBB));
70 }
71 }
72 return BotMBB;
73}