Update PPC readme. Remove things that are done or aren't ppc specific

[oota-llvm.git] / lib / CodeGen / MachineBasicBlock.cpp

diff --git a/lib/CodeGen/MachineBasicBlock.cpp b/lib/CodeGen/MachineBasicBlock.cpp
index e16be05ae9e0505b05e6bcfb09473ce56c038b72..695ba13a49ddf58bc7880ebf9c76696380880e4f 100644 (file)
--- a/lib/CodeGen/MachineBasicBlock.cpp
+++ b/lib/CodeGen/MachineBasicBlock.cpp
@@ -19,6 +19,7 @@
 #include "llvm/Target/TargetMachine.h"
 #include "llvm/Support/LeakDetector.h"
 #include <iostream>
+#include <algorithm>
 using namespace llvm;
 
 MachineBasicBlock::~MachineBasicBlock() {
@@ -26,7 +27,6 @@ MachineBasicBlock::~MachineBasicBlock() {
 }
 
 
-
 // MBBs start out as #-1. When a MBB is added to a MachineFunction, it
 // gets the next available unique MBB number. If it is removed from a
 // MachineFunction, it goes back to being #-1.
@@ -46,21 +46,19 @@ void ilist_traits<MachineBasicBlock>::removeNodeFromList(MachineBasicBlock* N) {
 }
 
 
-MachineInstr* ilist_traits<MachineInstr>::createNode() {
+MachineInstr* ilist_traits<MachineInstr>::createSentinel() {
   MachineInstr* dummy = new MachineInstr(0, 0);
   LeakDetector::removeGarbageObject(dummy);
   return dummy;
 }
 
-void ilist_traits<MachineInstr>::addNodeToList(MachineInstr* N)
-{
+void ilist_traits<MachineInstr>::addNodeToList(MachineInstr* N) {
   assert(N->parent == 0 && "machine instruction already in a basic block");
   N->parent = parent;
   LeakDetector::removeGarbageObject(N);
 }
 
-void ilist_traits<MachineInstr>::removeNodeFromList(MachineInstr* N)
-{
+void ilist_traits<MachineInstr>::removeNodeFromList(MachineInstr* N) {
   assert(N->parent != 0 && "machine instruction not in a basic block");
   N->parent = 0;
   LeakDetector::addGarbageObject(N);
@@ -69,15 +67,13 @@ void ilist_traits<MachineInstr>::removeNodeFromList(MachineInstr* N)
 void ilist_traits<MachineInstr>::transferNodesFromList(
   iplist<MachineInstr, ilist_traits<MachineInstr> >& toList,
   ilist_iterator<MachineInstr> first,
-  ilist_iterator<MachineInstr> last)
-{
+  ilist_iterator<MachineInstr> last) {
   if (parent != toList.parent)
     for (; first != last; ++first)
       first->parent = toList.parent;
 }
 
-MachineBasicBlock::iterator MachineBasicBlock::getFirstTerminator()
-{
+MachineBasicBlock::iterator MachineBasicBlock::getFirstTerminator() {
   const TargetInstrInfo& TII = *getParent()->getTarget().getInstrInfo();
   iterator I = end();
   while (I != begin() && TII.isTerminatorInstr((--I)->getOpcode()));
@@ -85,15 +81,14 @@ MachineBasicBlock::iterator MachineBasicBlock::getFirstTerminator()
   return I;
 }
 
-void MachineBasicBlock::dump() const
-{
+void MachineBasicBlock::dump() const {
   print(std::cerr);
 }
 
-void MachineBasicBlock::print(std::ostream &OS) const
-{
+void MachineBasicBlock::print(std::ostream &OS) const {
   if(!getParent()) {
-    OS << "Can't print out MachineBasicBlock because parent MachineFunction is null\n";
+    OS << "Can't print out MachineBasicBlock because parent MachineFunction"
+       << " is null\n";
     return;
   }
 
@@ -105,4 +100,41 @@ void MachineBasicBlock::print(std::ostream &OS) const
     OS << "\t";
     I->print(OS, &getParent()->getTarget());
   }
+
+  // Print the successors of this block according to the CFG.
+  if (!succ_empty()) {
+    OS << "    Successors according to CFG:";
+    for (const_succ_iterator SI = succ_begin(), E = succ_end(); SI != E; ++SI)
+      OS << " " << *SI;
+    OS << "\n";
+  }
+}
+
+void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ) {
+  Successors.push_back(succ);
+  succ->addPredecessor(this);
+}
+
+void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) {
+  succ->removePredecessor(this);
+  succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
+  assert(I != Successors.end() && "Not a current successor!");
+  Successors.erase(I);
+}
+
+void MachineBasicBlock::removeSuccessor(succ_iterator I) {
+  assert(I != Successors.end() && "Not a current successor!");
+  (*I)->removePredecessor(this);
+  Successors.erase(I);
+}
+
+void MachineBasicBlock::addPredecessor(MachineBasicBlock *pred) {
+  Predecessors.push_back(pred);
+}
+
+void MachineBasicBlock::removePredecessor(MachineBasicBlock *pred) {
+  std::vector<MachineBasicBlock *>::iterator I = 
+    std::find(Predecessors.begin(), Predecessors.end(), pred);
+  assert(I != Predecessors.end() && "Pred is not a predecessor of this block!");
+  Predecessors.erase(I);
 }