mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 19:52:54 +01:00
133 lines
4.3 KiB
C++
133 lines
4.3 KiB
C++
//===-- llvm/CodeGen/MachineBasicBlock.cpp ----------------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file was developed by the LLVM research group and is distributed under
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Collect the sequence of machine instructions for a basic block.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/CodeGen/MachineBasicBlock.h"
|
|
#include "llvm/BasicBlock.h"
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
|
#include "llvm/CodeGen/MachineInstr.h"
|
|
#include "llvm/Target/TargetInstrInfo.h"
|
|
#include "llvm/Target/TargetMachine.h"
|
|
#include "llvm/Support/LeakDetector.h"
|
|
#include <iostream>
|
|
#include <algorithm>
|
|
using namespace llvm;
|
|
|
|
MachineBasicBlock::~MachineBasicBlock() {
|
|
LeakDetector::removeGarbageObject(this);
|
|
}
|
|
|
|
|
|
// 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.
|
|
void ilist_traits<MachineBasicBlock>::addNodeToList(MachineBasicBlock* N) {
|
|
assert(N->Parent == 0 && "machine instruction already in a basic block");
|
|
N->Parent = Parent;
|
|
N->Number = Parent->addToMBBNumbering(N);
|
|
LeakDetector::removeGarbageObject(N);
|
|
}
|
|
|
|
void ilist_traits<MachineBasicBlock>::removeNodeFromList(MachineBasicBlock* N) {
|
|
assert(N->Parent != 0 && "machine instruction not in a basic block");
|
|
N->Parent->removeFromMBBNumbering(N->Number);
|
|
N->Number = -1;
|
|
N->Parent = 0;
|
|
LeakDetector::addGarbageObject(N);
|
|
}
|
|
|
|
|
|
MachineInstr* ilist_traits<MachineInstr>::createNode() {
|
|
MachineInstr* dummy = new MachineInstr(0, 0);
|
|
LeakDetector::removeGarbageObject(dummy);
|
|
return dummy;
|
|
}
|
|
|
|
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) {
|
|
assert(N->parent != 0 && "machine instruction not in a basic block");
|
|
N->parent = 0;
|
|
LeakDetector::addGarbageObject(N);
|
|
}
|
|
|
|
void ilist_traits<MachineInstr>::transferNodesFromList(
|
|
iplist<MachineInstr, ilist_traits<MachineInstr> >& toList,
|
|
ilist_iterator<MachineInstr> first,
|
|
ilist_iterator<MachineInstr> last) {
|
|
if (parent != toList.parent)
|
|
for (; first != last; ++first)
|
|
first->parent = toList.parent;
|
|
}
|
|
|
|
MachineBasicBlock::iterator MachineBasicBlock::getFirstTerminator() {
|
|
const TargetInstrInfo& TII = *getParent()->getTarget().getInstrInfo();
|
|
iterator I = end();
|
|
while (I != begin() && TII.isTerminatorInstr((--I)->getOpcode()));
|
|
if (I != end() && !TII.isTerminatorInstr(I->getOpcode())) ++I;
|
|
return I;
|
|
}
|
|
|
|
void MachineBasicBlock::dump() const {
|
|
print(std::cerr);
|
|
}
|
|
|
|
void MachineBasicBlock::print(std::ostream &OS) const {
|
|
if(!getParent()) {
|
|
OS << "Can't print out MachineBasicBlock because parent MachineFunction"
|
|
<< " is null\n";
|
|
return;
|
|
}
|
|
|
|
const BasicBlock *LBB = getBasicBlock();
|
|
if (LBB)
|
|
OS << "\n" << LBB->getName() << " (" << (const void*)this
|
|
<< ", LLVM BB @" << (const void*) LBB << "):\n";
|
|
for (const_iterator I = begin(); I != end(); ++I) {
|
|
OS << "\t";
|
|
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);
|
|
}
|