6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-09-27 15:57:13 +00:00
Code Issues Projects Releases Wiki Activity

Move method bodies that depend on <algorithm> from MBB.h to MBB.cpp

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@17253 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2004-10-26 15:43:42 +00:00
parent 3dfbb558b5
commit 52c09d7656
1 changed files with 38 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

52
lib/CodeGen/MachineBasicBlock.cpp
View File

@ -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.
@ -52,15 +52,13 @@ MachineInstr* ilist_traits<MachineInstr>::createNode() {
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;
}
@ -106,3 +101,32 @@ void MachineBasicBlock::print(std::ostream &OS) const
I->print(OS, &getParent()->getTarget());
}
}
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);
}