X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FCodeGen%2FMachineBasicBlock.cpp;h=01aaba5282b1568dcebdceca00c190f8cf9b43ab;hb=55e283c71eaa0428b63c901d726c0666f985ce85;hp=c72b247d8a47b47937c65cc692da4cc4945df3a0;hpb=17fb34bf8cd10a798c9206eeef3bff151b4d3688;p=oota-llvm.git diff --git a/lib/CodeGen/MachineBasicBlock.cpp b/lib/CodeGen/MachineBasicBlock.cpp index c72b247d8a4..01aaba5282b 100644 --- a/lib/CodeGen/MachineBasicBlock.cpp +++ b/lib/CodeGen/MachineBasicBlock.cpp @@ -2,8 +2,8 @@ // // 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. +// This file is distributed under the University of Illinois Open Source +// License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // @@ -14,96 +14,345 @@ #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/TargetRegisterInfo.h" +#include "llvm/Target/TargetData.h" +#include "llvm/Target/TargetInstrDesc.h" #include "llvm/Target/TargetMachine.h" -#include "Support/LeakDetector.h" +#include "llvm/Support/LeakDetector.h" +#include using namespace llvm; MachineBasicBlock::~MachineBasicBlock() { LeakDetector::removeGarbageObject(this); } - +std::ostream& llvm::operator<<(std::ostream &OS, const MachineBasicBlock &MBB) { + MBB.print(OS); + return OS; +} -// 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::addNodeToList (MachineBasicBlock* N) -{ - assert(N->Parent == 0 && "machine instruction already in a basic block"); - N->Parent = Parent; - N->Number = Parent->getNextMBBNumber(); - LeakDetector::removeGarbageObject(N); - +/// 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. +void ilist_traits::addNodeToList(MachineBasicBlock* N) { + assert(N->getParent() == 0 && "machine instruction already in a basic block"); + N->setParent(Parent); + N->Number = Parent->addToMBBNumbering(N); + // 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); + + LeakDetector::removeGarbageObject(N); } -void ilist_traits::removeNodeFromList (MachineBasicBlock* N) -{ - assert(N->Parent != 0 && "machine instruction not in a basic block"); - N->Parent = 0; +void ilist_traits::removeNodeFromList(MachineBasicBlock* N) { + assert(N->getParent() != 0 && "machine instruction not in a basic block"); + N->getParent()->removeFromMBBNumbering(N->Number); N->Number = -1; + N->setParent(0); + + // 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(); + LeakDetector::addGarbageObject(N); } -MachineInstr* ilist_traits::createNode() -{ - MachineInstr* dummy = new MachineInstr(0, 0); - LeakDetector::removeGarbageObject(dummy); - return dummy; +MachineInstr* ilist_traits::createSentinel() { + MachineInstr* dummy = new MachineInstr(); + LeakDetector::removeGarbageObject(dummy); + return dummy; } -void ilist_traits::addNodeToList(MachineInstr* N) -{ - assert(N->parent == 0 && "machine instruction already in a basic block"); - N->parent = parent; - LeakDetector::removeGarbageObject(N); +/// 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. +void ilist_traits::addNodeToList(MachineInstr* N) { + assert(N->getParent() == 0 && "machine instruction already in a basic block"); + N->setParent(parent); + LeakDetector::removeGarbageObject(N); + + // 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()); } -void ilist_traits::removeNodeFromList(MachineInstr* N) -{ - assert(N->parent != 0 && "machine instruction not in a basic block"); - N->parent = 0; - LeakDetector::addGarbageObject(N); +/// 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. +void ilist_traits::removeNodeFromList(MachineInstr* N) { + assert(N->getParent() != 0 && "machine instruction not in a basic block"); + // If this block is in a function, remove from the use/def lists. + if (parent->getParent() != 0) + N->RemoveRegOperandsFromUseLists(); + + N->setParent(0); + LeakDetector::addGarbageObject(N); } +/// 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. void ilist_traits::transferNodesFromList( - iplist >& toList, - ilist_iterator first, - ilist_iterator last) -{ - if (parent != toList.parent) - for (; first != last; ++first) - first->parent = toList.parent; + iplist >& fromList, + ilist_iterator first, + ilist_iterator last) { + // Splice within the same MBB -> no change. + if (parent == fromList.parent) return; + + // 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; + } + + // 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(); + first->setParent(parent); + if (NewMF) first->AddRegOperandsToUseLists(NewMF->getRegInfo()); + } } -MachineBasicBlock::iterator MachineBasicBlock::getFirstTerminator() -{ - const TargetInstrInfo& TII = getParent()->getTarget().getInstrInfo(); +MachineBasicBlock::iterator MachineBasicBlock::getFirstTerminator() { iterator I = end(); - while (I != begin() && TII.isTerminatorInstr((--I)->getOpcode())); - if (I != end() && !TII.isTerminatorInstr(I->getOpcode())) ++I; + while (I != begin() && (--I)->getDesc().isTerminator()) + ; /*noop */ + if (I != end() && !I->getDesc().isTerminator()) ++I; return I; } -void MachineBasicBlock::dump() const -{ - print(std::cerr); +void MachineBasicBlock::dump() const { + print(*cerr.stream()); +} + +static inline void OutputReg(std::ostream &os, unsigned RegNo, + const TargetRegisterInfo *TRI = 0) { + if (!RegNo || TargetRegisterInfo::isPhysicalRegister(RegNo)) { + if (TRI) + os << " %" << TRI->get(RegNo).Name; + else + os << " %mreg(" << RegNo << ")"; + } else + os << " %reg" << RegNo; +} + +void MachineBasicBlock::print(std::ostream &OS) const { + const MachineFunction *MF = getParent(); + if(!MF) { + OS << "Can't print out MachineBasicBlock because parent MachineFunction" + << " is null\n"; + return; + } + + const BasicBlock *LBB = getBasicBlock(); + OS << "\n"; + if (LBB) OS << LBB->getName() << ": "; + OS << (const void*)this + << ", LLVM BB @" << (const void*) LBB << ", ID#" << getNumber(); + if (Alignment) OS << ", Alignment " << Alignment; + if (isLandingPad()) OS << ", EH LANDING PAD"; + OS << ":\n"; + + const TargetRegisterInfo *TRI = MF->getTarget().getRegisterInfo(); + if (!livein_empty()) { + OS << "Live Ins:"; + for (const_livein_iterator I = livein_begin(),E = livein_end(); I != E; ++I) + OutputReg(OS, *I, TRI); + OS << "\n"; + } + // 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) + OS << " " << *PI << " (#" << (*PI)->getNumber() << ")"; + OS << "\n"; + } + + for (const_iterator I = begin(); I != end(); ++I) { + 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 << " (#" << (*SI)->getNumber() << ")"; + OS << "\n"; + } } -void MachineBasicBlock::print(std::ostream &OS) const +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); +} + +bool MachineBasicBlock::isLiveIn(unsigned Reg) const { + const_livein_iterator I = std::find(livein_begin(), livein_end(), Reg); + return I != livein_end(); +} + +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); +} + + +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); +} + +MachineBasicBlock::succ_iterator +MachineBasicBlock::removeSuccessor(succ_iterator I) { + assert(I != Successors.end() && "Not a current successor!"); + (*I)->removePredecessor(this); + return(Successors.erase(I)); +} + +void MachineBasicBlock::addPredecessor(MachineBasicBlock *pred) { + Predecessors.push_back(pred); +} + +void MachineBasicBlock::removePredecessor(MachineBasicBlock *pred) { + std::vector::iterator I = + std::find(Predecessors.begin(), Predecessors.end(), pred); + assert(I != Predecessors.end() && "Pred is not a predecessor of this block!"); + Predecessors.erase(I); +} + +void MachineBasicBlock::transferSuccessors(MachineBasicBlock *fromMBB) { - if(!getParent()) { - OS << "Can't print out MachineBasicBlock because parent MachineFunction is null\n"; + if (this == fromMBB) return; + + for(MachineBasicBlock::succ_iterator iter = fromMBB->succ_begin(), + end = fromMBB->succ_end(); iter != end; ++iter) { + addSuccessor(*iter); + } + while(!fromMBB->succ_empty()) + fromMBB->removeSuccessor(fromMBB->succ_begin()); +} + +bool MachineBasicBlock::isSuccessor(MachineBasicBlock *MBB) const { + std::vector::const_iterator I = + std::find(Successors.begin(), Successors.end(), MBB); + return I != Successors.end(); +} + +/// 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; + if (!I->getDesc().isTerminator()) break; + + // Scan the operands of this machine instruction, replacing any uses of Old + // with New. + for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) + if (I->getOperand(i).isMBB() && I->getOperand(i).getMBB() == Old) + I->getOperand(i).setMBB(New); } - const BasicBlock *LBB = getBasicBlock(); - if(LBB) - OS << "\n" << LBB->getName() << " (" << (const void*)LBB << "):\n"; - for (const_iterator I = begin(); I != end(); ++I) { - OS << "\t"; - I->print(OS, getParent()->getTarget()); + + // 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); +} + +/// 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. +/// Besides DestA and DestB, retain other edges leading to LandingPads +/// (currently there can be only one; we don't check or require that here). +/// 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. + SI = removeSuccessor(SI); + 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; }