2004-02-16 07:17:43 +00:00
|
|
|
//===-- llvm/CodeGen/MachineBasicBlock.cpp ----------------------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2004-02-16 07:17:43 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// Collect the sequence of machine instructions for a basic block.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/CodeGen/MachineBasicBlock.h"
|
|
|
|
#include "llvm/BasicBlock.h"
|
|
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
2008-02-10 18:45:23 +00:00
|
|
|
#include "llvm/Target/TargetRegisterInfo.h"
|
2006-05-12 06:33:49 +00:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2008-01-07 07:42:25 +00:00
|
|
|
#include "llvm/Target/TargetInstrDesc.h"
|
2004-02-23 18:14:48 +00:00
|
|
|
#include "llvm/Target/TargetMachine.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/Support/LeakDetector.h"
|
2004-10-26 15:43:42 +00:00
|
|
|
#include <algorithm>
|
2004-02-16 07:17:43 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2004-05-24 07:14:35 +00:00
|
|
|
MachineBasicBlock::~MachineBasicBlock() {
|
|
|
|
LeakDetector::removeGarbageObject(this);
|
|
|
|
}
|
|
|
|
|
2006-11-18 21:47:36 +00:00
|
|
|
std::ostream& llvm::operator<<(std::ostream &OS, const MachineBasicBlock &MBB) {
|
|
|
|
MBB.print(OS);
|
|
|
|
return OS;
|
|
|
|
}
|
2004-05-24 07:14:35 +00:00
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
/// addNodeToList (MBB) - When an MBB is added to an MF, we need to update the
|
|
|
|
/// parent pointer of the MBB, the MBB numbering, and any instructions in the
|
|
|
|
/// MBB to be on the right operand list for registers.
|
|
|
|
///
|
|
|
|
/// 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.
|
2004-07-01 06:02:27 +00:00
|
|
|
void ilist_traits<MachineBasicBlock>::addNodeToList(MachineBasicBlock* N) {
|
2007-12-31 04:56:33 +00:00
|
|
|
assert(N->getParent() == 0 && "machine instruction already in a basic block");
|
|
|
|
N->setParent(Parent);
|
2004-07-01 06:02:27 +00:00
|
|
|
N->Number = Parent->addToMBBNumbering(N);
|
2008-01-01 01:12:31 +00:00
|
|
|
|
|
|
|
// Make sure the instructions have their operands in the reginfo lists.
|
|
|
|
MachineRegisterInfo &RegInfo = Parent->getRegInfo();
|
|
|
|
for (MachineBasicBlock::iterator I = N->begin(), E = N->end(); I != E; ++I)
|
|
|
|
I->AddRegOperandsToUseLists(RegInfo);
|
|
|
|
|
2004-05-24 06:11:51 +00:00
|
|
|
LeakDetector::removeGarbageObject(N);
|
2004-05-12 21:35:22 +00:00
|
|
|
}
|
|
|
|
|
2004-07-01 06:02:27 +00:00
|
|
|
void ilist_traits<MachineBasicBlock>::removeNodeFromList(MachineBasicBlock* N) {
|
2007-12-31 04:56:33 +00:00
|
|
|
assert(N->getParent() != 0 && "machine instruction not in a basic block");
|
|
|
|
N->getParent()->removeFromMBBNumbering(N->Number);
|
2004-05-12 21:35:22 +00:00
|
|
|
N->Number = -1;
|
2007-12-31 04:56:33 +00:00
|
|
|
N->setParent(0);
|
2008-01-01 01:12:31 +00:00
|
|
|
|
|
|
|
// Make sure the instructions have their operands removed from the reginfo
|
|
|
|
// lists.
|
|
|
|
for (MachineBasicBlock::iterator I = N->begin(), E = N->end(); I != E; ++I)
|
|
|
|
I->RemoveRegOperandsFromUseLists();
|
|
|
|
|
2004-05-24 06:11:51 +00:00
|
|
|
LeakDetector::addGarbageObject(N);
|
2004-05-12 21:35:22 +00:00
|
|
|
}
|
|
|
|
|
2004-02-19 16:13:54 +00:00
|
|
|
|
2005-01-30 00:09:23 +00:00
|
|
|
MachineInstr* ilist_traits<MachineInstr>::createSentinel() {
|
2006-11-27 23:37:22 +00:00
|
|
|
MachineInstr* dummy = new MachineInstr();
|
2004-09-05 18:39:20 +00:00
|
|
|
LeakDetector::removeGarbageObject(dummy);
|
|
|
|
return dummy;
|
2004-02-16 07:17:43 +00:00
|
|
|
}
|
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
/// addNodeToList (MI) - When we add an instruction to a basic block
|
|
|
|
/// list, we update its parent pointer and add its operands from reg use/def
|
|
|
|
/// lists if appropriate.
|
2004-10-26 15:43:42 +00:00
|
|
|
void ilist_traits<MachineInstr>::addNodeToList(MachineInstr* N) {
|
2007-12-31 04:56:33 +00:00
|
|
|
assert(N->getParent() == 0 && "machine instruction already in a basic block");
|
|
|
|
N->setParent(parent);
|
2004-09-05 18:39:20 +00:00
|
|
|
LeakDetector::removeGarbageObject(N);
|
2008-01-01 01:12:31 +00:00
|
|
|
|
|
|
|
// If the block is in a function, add the instruction's register operands to
|
|
|
|
// their corresponding use/def lists.
|
|
|
|
if (MachineFunction *MF = parent->getParent())
|
|
|
|
N->AddRegOperandsToUseLists(MF->getRegInfo());
|
2004-02-16 07:17:43 +00:00
|
|
|
}
|
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
/// removeNodeFromList (MI) - When we remove an instruction from a basic block
|
|
|
|
/// list, we update its parent pointer and remove its operands from reg use/def
|
|
|
|
/// lists if appropriate.
|
2004-10-26 15:43:42 +00:00
|
|
|
void ilist_traits<MachineInstr>::removeNodeFromList(MachineInstr* N) {
|
2007-12-31 04:56:33 +00:00
|
|
|
assert(N->getParent() != 0 && "machine instruction not in a basic block");
|
2008-01-01 01:12:31 +00:00
|
|
|
// If this block is in a function, remove from the use/def lists.
|
|
|
|
if (parent->getParent() != 0)
|
|
|
|
N->RemoveRegOperandsFromUseLists();
|
|
|
|
|
2007-12-31 04:56:33 +00:00
|
|
|
N->setParent(0);
|
2004-09-05 18:39:20 +00:00
|
|
|
LeakDetector::addGarbageObject(N);
|
2004-02-16 07:17:43 +00:00
|
|
|
}
|
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
/// transferNodesFromList (MI) - When moving a range of instructions from one
|
|
|
|
/// MBB list to another, we need to update the parent pointers and the use/def
|
|
|
|
/// lists.
|
2004-02-16 07:17:43 +00:00
|
|
|
void ilist_traits<MachineInstr>::transferNodesFromList(
|
2007-12-31 04:56:33 +00:00
|
|
|
iplist<MachineInstr, ilist_traits<MachineInstr> >& fromList,
|
|
|
|
ilist_iterator<MachineInstr> first,
|
|
|
|
ilist_iterator<MachineInstr> last) {
|
|
|
|
// Splice within the same MBB -> no change.
|
|
|
|
if (parent == fromList.parent) return;
|
2008-01-01 01:12:31 +00:00
|
|
|
|
|
|
|
// If splicing between two blocks within the same function, just update the
|
|
|
|
// parent pointers.
|
|
|
|
if (parent->getParent() == fromList.parent->getParent()) {
|
|
|
|
for (; first != last; ++first)
|
|
|
|
first->setParent(parent);
|
|
|
|
return;
|
|
|
|
}
|
2007-12-31 04:56:33 +00:00
|
|
|
|
2008-01-01 01:12:31 +00:00
|
|
|
// Otherwise, we have to update the parent and the use/def lists. The common
|
|
|
|
// case when this occurs is if we're splicing from a block in a MF to a block
|
|
|
|
// that is not in an MF.
|
|
|
|
bool HasOldMF = fromList.parent->getParent() != 0;
|
|
|
|
MachineFunction *NewMF = parent->getParent();
|
|
|
|
|
|
|
|
for (; first != last; ++first) {
|
|
|
|
if (HasOldMF) first->RemoveRegOperandsFromUseLists();
|
2007-12-31 04:56:33 +00:00
|
|
|
first->setParent(parent);
|
2008-01-01 01:12:31 +00:00
|
|
|
if (NewMF) first->AddRegOperandsToUseLists(NewMF->getRegInfo());
|
|
|
|
}
|
2004-02-16 07:17:43 +00:00
|
|
|
}
|
|
|
|
|
2004-10-26 15:43:42 +00:00
|
|
|
MachineBasicBlock::iterator MachineBasicBlock::getFirstTerminator() {
|
2004-02-23 18:14:48 +00:00
|
|
|
iterator I = end();
|
2008-01-07 07:27:27 +00:00
|
|
|
while (I != begin() && (--I)->getDesc().isTerminator())
|
2007-09-02 22:11:14 +00:00
|
|
|
; /*noop */
|
2008-01-07 07:27:27 +00:00
|
|
|
if (I != end() && !I->getDesc().isTerminator()) ++I;
|
2004-02-23 18:14:48 +00:00
|
|
|
return I;
|
|
|
|
}
|
|
|
|
|
2004-10-26 15:43:42 +00:00
|
|
|
void MachineBasicBlock::dump() const {
|
2006-12-07 20:28:15 +00:00
|
|
|
print(*cerr.stream());
|
2004-02-16 07:17:43 +00:00
|
|
|
}
|
|
|
|
|
2007-02-10 02:38:19 +00:00
|
|
|
static inline void OutputReg(std::ostream &os, unsigned RegNo,
|
2008-02-10 18:45:23 +00:00
|
|
|
const TargetRegisterInfo *TRI = 0) {
|
|
|
|
if (!RegNo || TargetRegisterInfo::isPhysicalRegister(RegNo)) {
|
|
|
|
if (TRI)
|
2008-02-26 21:47:57 +00:00
|
|
|
os << " %" << TRI->get(RegNo).Name;
|
2007-02-10 02:38:19 +00:00
|
|
|
else
|
|
|
|
os << " %mreg(" << RegNo << ")";
|
|
|
|
} else
|
|
|
|
os << " %reg" << RegNo;
|
|
|
|
}
|
|
|
|
|
2004-10-26 15:43:42 +00:00
|
|
|
void MachineBasicBlock::print(std::ostream &OS) const {
|
2007-02-10 02:38:19 +00:00
|
|
|
const MachineFunction *MF = getParent();
|
|
|
|
if(!MF) {
|
2004-10-26 15:43:42 +00:00
|
|
|
OS << "Can't print out MachineBasicBlock because parent MachineFunction"
|
|
|
|
<< " is null\n";
|
2004-05-24 06:11:51 +00:00
|
|
|
return;
|
|
|
|
}
|
2004-09-05 18:39:20 +00:00
|
|
|
|
|
|
|
const BasicBlock *LBB = getBasicBlock();
|
2006-10-06 21:28:17 +00:00
|
|
|
OS << "\n";
|
2007-04-30 23:12:53 +00:00
|
|
|
if (LBB) OS << LBB->getName() << ": ";
|
|
|
|
OS << (const void*)this
|
|
|
|
<< ", LLVM BB @" << (const void*) LBB << ", ID#" << getNumber();
|
2008-02-28 00:43:03 +00:00
|
|
|
if (Alignment) OS << ", Alignment " << Alignment;
|
2007-04-30 23:12:53 +00:00
|
|
|
if (isLandingPad()) OS << ", EH LANDING PAD";
|
|
|
|
OS << ":\n";
|
2007-02-10 02:38:19 +00:00
|
|
|
|
2008-02-10 18:45:23 +00:00
|
|
|
const TargetRegisterInfo *TRI = MF->getTarget().getRegisterInfo();
|
2007-10-03 19:26:29 +00:00
|
|
|
if (!livein_empty()) {
|
2007-02-10 02:38:19 +00:00
|
|
|
OS << "Live Ins:";
|
2007-02-19 21:49:54 +00:00
|
|
|
for (const_livein_iterator I = livein_begin(),E = livein_end(); I != E; ++I)
|
2008-02-10 18:45:23 +00:00
|
|
|
OutputReg(OS, *I, TRI);
|
2007-02-10 02:38:19 +00:00
|
|
|
OS << "\n";
|
|
|
|
}
|
2006-09-26 03:41:59 +00:00
|
|
|
// Print the preds of this block according to the CFG.
|
|
|
|
if (!pred_empty()) {
|
|
|
|
OS << " Predecessors according to CFG:";
|
|
|
|
for (const_pred_iterator PI = pred_begin(), E = pred_end(); PI != E; ++PI)
|
2007-03-09 08:29:08 +00:00
|
|
|
OS << " " << *PI << " (#" << (*PI)->getNumber() << ")";
|
2006-09-26 03:41:59 +00:00
|
|
|
OS << "\n";
|
|
|
|
}
|
|
|
|
|
2004-09-05 18:39:20 +00:00
|
|
|
for (const_iterator I = begin(); I != end(); ++I) {
|
|
|
|
OS << "\t";
|
|
|
|
I->print(OS, &getParent()->getTarget());
|
|
|
|
}
|
2005-04-01 06:48:38 +00:00
|
|
|
|
|
|
|
// 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)
|
2007-03-09 08:29:08 +00:00
|
|
|
OS << " " << *SI << " (#" << (*SI)->getNumber() << ")";
|
2005-04-01 06:48:38 +00:00
|
|
|
OS << "\n";
|
|
|
|
}
|
2004-02-16 07:17:43 +00:00
|
|
|
}
|
2004-10-26 15:43:42 +00:00
|
|
|
|
2007-02-19 21:49:54 +00:00
|
|
|
void MachineBasicBlock::removeLiveIn(unsigned Reg) {
|
|
|
|
livein_iterator I = std::find(livein_begin(), livein_end(), Reg);
|
|
|
|
assert(I != livein_end() && "Not a live in!");
|
|
|
|
LiveIns.erase(I);
|
|
|
|
}
|
|
|
|
|
2008-04-24 09:06:33 +00:00
|
|
|
bool MachineBasicBlock::isLiveIn(unsigned Reg) const {
|
|
|
|
const_livein_iterator I = std::find(livein_begin(), livein_end(), Reg);
|
|
|
|
return I != livein_end();
|
|
|
|
}
|
|
|
|
|
2006-10-24 00:02:26 +00:00
|
|
|
void MachineBasicBlock::moveBefore(MachineBasicBlock *NewAfter) {
|
|
|
|
MachineFunction::BasicBlockListType &BBList =getParent()->getBasicBlockList();
|
|
|
|
getParent()->getBasicBlockList().splice(NewAfter, BBList, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void MachineBasicBlock::moveAfter(MachineBasicBlock *NewBefore) {
|
|
|
|
MachineFunction::BasicBlockListType &BBList =getParent()->getBasicBlockList();
|
|
|
|
MachineFunction::iterator BBI = NewBefore;
|
|
|
|
getParent()->getBasicBlockList().splice(++BBI, BBList, this);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-10-26 15:43:42 +00:00
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
2007-12-31 04:56:33 +00:00
|
|
|
MachineBasicBlock::succ_iterator
|
|
|
|
MachineBasicBlock::removeSuccessor(succ_iterator I) {
|
2004-10-26 15:43:42 +00:00
|
|
|
assert(I != Successors.end() && "Not a current successor!");
|
|
|
|
(*I)->removePredecessor(this);
|
2007-06-29 02:45:24 +00:00
|
|
|
return(Successors.erase(I));
|
2004-10-26 15:43:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void MachineBasicBlock::addPredecessor(MachineBasicBlock *pred) {
|
|
|
|
Predecessors.push_back(pred);
|
|
|
|
}
|
|
|
|
|
|
|
|
void MachineBasicBlock::removePredecessor(MachineBasicBlock *pred) {
|
2005-04-21 22:36:52 +00:00
|
|
|
std::vector<MachineBasicBlock *>::iterator I =
|
2004-10-26 15:43:42 +00:00
|
|
|
std::find(Predecessors.begin(), Predecessors.end(), pred);
|
|
|
|
assert(I != Predecessors.end() && "Pred is not a predecessor of this block!");
|
|
|
|
Predecessors.erase(I);
|
|
|
|
}
|
2007-05-17 23:58:53 +00:00
|
|
|
|
|
|
|
bool MachineBasicBlock::isSuccessor(MachineBasicBlock *MBB) const {
|
|
|
|
std::vector<MachineBasicBlock *>::const_iterator I =
|
|
|
|
std::find(Successors.begin(), Successors.end(), MBB);
|
|
|
|
return I != Successors.end();
|
|
|
|
}
|
2007-06-04 06:44:01 +00:00
|
|
|
|
|
|
|
/// ReplaceUsesOfBlockWith - Given a machine basic block that branched to
|
|
|
|
/// 'Old', change the code and CFG so that it branches to 'New' instead.
|
|
|
|
void MachineBasicBlock::ReplaceUsesOfBlockWith(MachineBasicBlock *Old,
|
|
|
|
MachineBasicBlock *New) {
|
|
|
|
assert(Old != New && "Cannot replace self with self!");
|
|
|
|
|
|
|
|
MachineBasicBlock::iterator I = end();
|
|
|
|
while (I != begin()) {
|
|
|
|
--I;
|
2008-01-07 07:27:27 +00:00
|
|
|
if (!I->getDesc().isTerminator()) break;
|
2007-06-04 06:44:01 +00:00
|
|
|
|
|
|
|
// Scan the operands of this machine instruction, replacing any uses of Old
|
|
|
|
// with New.
|
|
|
|
for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
|
2007-12-30 23:10:15 +00:00
|
|
|
if (I->getOperand(i).isMBB() && I->getOperand(i).getMBB() == Old)
|
|
|
|
I->getOperand(i).setMBB(New);
|
2007-06-04 06:44:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Update the successor information. If New was already a successor, just
|
|
|
|
// remove the link to Old instead of creating another one. PR 1444.
|
|
|
|
removeSuccessor(Old);
|
|
|
|
if (!isSuccessor(New))
|
|
|
|
addSuccessor(New);
|
|
|
|
}
|
|
|
|
|
2007-06-18 22:43:58 +00:00
|
|
|
/// CorrectExtraCFGEdges - Various pieces of code can cause excess edges in the
|
|
|
|
/// CFG to be inserted. If we have proven that MBB can only branch to DestA and
|
|
|
|
/// DestB, remove any other MBB successors from the CFG. DestA and DestB can
|
|
|
|
/// be null.
|
2007-12-31 04:56:33 +00:00
|
|
|
/// Besides DestA and DestB, retain other edges leading to LandingPads
|
|
|
|
/// (currently there can be only one; we don't check or require that here).
|
2007-06-18 22:43:58 +00:00
|
|
|
/// Note it is possible that DestA and/or DestB are LandingPads.
|
|
|
|
bool MachineBasicBlock::CorrectExtraCFGEdges(MachineBasicBlock *DestA,
|
|
|
|
MachineBasicBlock *DestB,
|
|
|
|
bool isCond) {
|
|
|
|
bool MadeChange = false;
|
|
|
|
bool AddedFallThrough = false;
|
|
|
|
|
|
|
|
MachineBasicBlock *FallThru = getNext();
|
|
|
|
|
|
|
|
// If this block ends with a conditional branch that falls through to its
|
|
|
|
// successor, set DestB as the successor.
|
|
|
|
if (isCond) {
|
|
|
|
if (DestB == 0 && FallThru != getParent()->end()) {
|
|
|
|
DestB = FallThru;
|
|
|
|
AddedFallThrough = true;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// If this is an unconditional branch with no explicit dest, it must just be
|
|
|
|
// a fallthrough into DestB.
|
|
|
|
if (DestA == 0 && FallThru != getParent()->end()) {
|
|
|
|
DestA = FallThru;
|
|
|
|
AddedFallThrough = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
MachineBasicBlock::succ_iterator SI = succ_begin();
|
|
|
|
MachineBasicBlock *OrigDestA = DestA, *OrigDestB = DestB;
|
|
|
|
while (SI != succ_end()) {
|
|
|
|
if (*SI == DestA && DestA == DestB) {
|
|
|
|
DestA = DestB = 0;
|
|
|
|
++SI;
|
|
|
|
} else if (*SI == DestA) {
|
|
|
|
DestA = 0;
|
|
|
|
++SI;
|
|
|
|
} else if (*SI == DestB) {
|
|
|
|
DestB = 0;
|
|
|
|
++SI;
|
|
|
|
} else if ((*SI)->isLandingPad() &&
|
|
|
|
*SI!=OrigDestA && *SI!=OrigDestB) {
|
|
|
|
++SI;
|
|
|
|
} else {
|
|
|
|
// Otherwise, this is a superfluous edge, remove it.
|
2007-06-29 02:45:24 +00:00
|
|
|
SI = removeSuccessor(SI);
|
2007-06-18 22:43:58 +00:00
|
|
|
MadeChange = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!AddedFallThrough) {
|
|
|
|
assert(DestA == 0 && DestB == 0 &&
|
|
|
|
"MachineCFG is missing edges!");
|
|
|
|
} else if (isCond) {
|
|
|
|
assert(DestA == 0 && "MachineCFG is missing edges!");
|
|
|
|
}
|
|
|
|
return MadeChange;
|
|
|
|
}
|