MachineBasicBlock.cpp revision c0f64ffab93d11fb27a3b8a0707b77400918a20e 
1//===-- llvm/CodeGen/MachineBasicBlock.cpp ----------------------*- C++ -*-===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// Collect the sequence of machine instructions for a basic block.
11//
12//===----------------------------------------------------------------------===//
13
14#include "llvm/CodeGen/MachineBasicBlock.h"
15#include "llvm/BasicBlock.h"
16#include "llvm/CodeGen/MachineFunction.h"
17#include "llvm/CodeGen/MachineInstr.h"
18#include "llvm/Target/TargetData.h"
19#include "llvm/Target/TargetInstrInfo.h"
20#include "llvm/Target/TargetMachine.h"
21#include "llvm/Support/LeakDetector.h"
22#include <iostream>
23#include <algorithm>
24using namespace llvm;
25
26MachineBasicBlock::~MachineBasicBlock() {
27  LeakDetector::removeGarbageObject(this);
28}
29
30std::ostream& llvm::operator<<(std::ostream &OS, const MachineBasicBlock &MBB) {
31  MBB.print(OS);
32  return OS;
33}
34
35// MBBs start out as #-1. When a MBB is added to a MachineFunction, it
36// gets the next available unique MBB number. If it is removed from a
37// MachineFunction, it goes back to being #-1.
38void ilist_traits<MachineBasicBlock>::addNodeToList(MachineBasicBlock* N) {
39  assert(N->Parent == 0 && "machine instruction already in a basic block");
40  N->Parent = Parent;
41  N->Number = Parent->addToMBBNumbering(N);
42  LeakDetector::removeGarbageObject(N);
43}
44
45void ilist_traits<MachineBasicBlock>::removeNodeFromList(MachineBasicBlock* N) {
46  assert(N->Parent != 0 && "machine instruction not in a basic block");
47  N->Parent->removeFromMBBNumbering(N->Number);
48  N->Number = -1;
49  N->Parent = 0;
50  LeakDetector::addGarbageObject(N);
51}
52
53
54MachineInstr* ilist_traits<MachineInstr>::createSentinel() {
55  MachineInstr* dummy = new MachineInstr();
56  LeakDetector::removeGarbageObject(dummy);
57  return dummy;
58}
59
60void ilist_traits<MachineInstr>::addNodeToList(MachineInstr* N) {
61  assert(N->parent == 0 && "machine instruction already in a basic block");
62  N->parent = parent;
63  LeakDetector::removeGarbageObject(N);
64}
65
66void ilist_traits<MachineInstr>::removeNodeFromList(MachineInstr* N) {
67  assert(N->parent != 0 && "machine instruction not in a basic block");
68  N->parent = 0;
69  LeakDetector::addGarbageObject(N);
70}
71
72void ilist_traits<MachineInstr>::transferNodesFromList(
73  iplist<MachineInstr, ilist_traits<MachineInstr> >& fromList,
74  ilist_iterator<MachineInstr> first,
75  ilist_iterator<MachineInstr> last) {
76  if (parent != fromList.parent)
77    for (; first != last; ++first)
78      first->parent = parent;
79}
80
81MachineBasicBlock::iterator MachineBasicBlock::getFirstTerminator() {
82  const TargetInstrInfo& TII = *getParent()->getTarget().getInstrInfo();
83  iterator I = end();
84  while (I != begin() && TII.isTerminatorInstr((--I)->getOpcode()));
85  if (I != end() && !TII.isTerminatorInstr(I->getOpcode())) ++I;
86  return I;
87}
88
89void MachineBasicBlock::dump() const {
90  print(std::cerr);
91}
92
93void MachineBasicBlock::print(std::ostream &OS) const {
94  if(!getParent()) {
95    OS << "Can't print out MachineBasicBlock because parent MachineFunction"
96       << " is null\n";
97    return;
98  }
99
100  const BasicBlock *LBB = getBasicBlock();
101  OS << "\n";
102  if (LBB) OS << LBB->getName();
103  OS << " (" << (const void*)this
104     << ", LLVM BB @" << (const void*) LBB << ", ID#" << getNumber()<< "):\n";
105  // Print the preds of this block according to the CFG.
106  if (!pred_empty()) {
107    OS << "    Predecessors according to CFG:";
108    for (const_pred_iterator PI = pred_begin(), E = pred_end(); PI != E; ++PI)
109      OS << " " << *PI;
110    OS << "\n";
111  }
112
113  for (const_iterator I = begin(); I != end(); ++I) {
114    OS << "\t";
115    I->print(OS, &getParent()->getTarget());
116  }
117
118  // Print the successors of this block according to the CFG.
119  if (!succ_empty()) {
120    OS << "    Successors according to CFG:";
121    for (const_succ_iterator SI = succ_begin(), E = succ_end(); SI != E; ++SI)
122      OS << " " << *SI;
123    OS << "\n";
124  }
125}
126
127void MachineBasicBlock::moveBefore(MachineBasicBlock *NewAfter) {
128  MachineFunction::BasicBlockListType &BBList =getParent()->getBasicBlockList();
129  getParent()->getBasicBlockList().splice(NewAfter, BBList, this);
130}
131
132void MachineBasicBlock::moveAfter(MachineBasicBlock *NewBefore) {
133  MachineFunction::BasicBlockListType &BBList =getParent()->getBasicBlockList();
134  MachineFunction::iterator BBI = NewBefore;
135  getParent()->getBasicBlockList().splice(++BBI, BBList, this);
136}
137
138
139void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ) {
140  Successors.push_back(succ);
141  succ->addPredecessor(this);
142}
143
144void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) {
145  succ->removePredecessor(this);
146  succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
147  assert(I != Successors.end() && "Not a current successor!");
148  Successors.erase(I);
149}
150
151void MachineBasicBlock::removeSuccessor(succ_iterator I) {
152  assert(I != Successors.end() && "Not a current successor!");
153  (*I)->removePredecessor(this);
154  Successors.erase(I);
155}
156
157void MachineBasicBlock::addPredecessor(MachineBasicBlock *pred) {
158  Predecessors.push_back(pred);
159}
160
161void MachineBasicBlock::removePredecessor(MachineBasicBlock *pred) {
162  std::vector<MachineBasicBlock *>::iterator I =
163    std::find(Predecessors.begin(), Predecessors.end(), pred);
164  assert(I != Predecessors.end() && "Pred is not a predecessor of this block!");
165  Predecessors.erase(I);
166}
167