freebsd-dev/lib/CodeGen/BranchFolding.cpp

1342 lines
51 KiB
C++
Raw Normal View History

2009-06-02 17:52:33 +00:00
//===-- BranchFolding.cpp - Fold machine code branch instructions ---------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This pass forwards branches to unconditional branches to make them branch
// directly to the target block. This pass often results in dead MBB's, which
// it then removes.
//
// Note that this pass must be run after register allocation, it cannot handle
// SSA form.
//
//===----------------------------------------------------------------------===//
#define DEBUG_TYPE "branchfolding"
2009-10-14 17:57:32 +00:00
#include "BranchFolding.h"
2009-11-04 14:58:56 +00:00
#include "llvm/Function.h"
2009-06-02 17:52:33 +00:00
#include "llvm/CodeGen/Passes.h"
#include "llvm/CodeGen/MachineModuleInfo.h"
#include "llvm/CodeGen/MachineFunctionPass.h"
#include "llvm/CodeGen/MachineJumpTableInfo.h"
#include "llvm/CodeGen/RegisterScavenging.h"
#include "llvm/Target/TargetInstrInfo.h"
#include "llvm/Target/TargetMachine.h"
#include "llvm/Target/TargetRegisterInfo.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/Debug.h"
2009-10-14 17:57:32 +00:00
#include "llvm/Support/ErrorHandling.h"
#include "llvm/Support/raw_ostream.h"
2009-06-02 17:52:33 +00:00
#include "llvm/ADT/SmallSet.h"
2009-11-18 14:58:34 +00:00
#include "llvm/ADT/SetVector.h"
2009-06-02 17:52:33 +00:00
#include "llvm/ADT/Statistic.h"
#include "llvm/ADT/STLExtras.h"
#include <algorithm>
using namespace llvm;
STATISTIC(NumDeadBlocks, "Number of dead blocks removed");
STATISTIC(NumBranchOpts, "Number of branches optimized");
STATISTIC(NumTailMerge , "Number of block tails merged");
2009-11-19 08:59:28 +00:00
2009-11-18 14:58:34 +00:00
static cl::opt<cl::boolOrDefault> FlagEnableTailMerge("enable-tail-merge",
2009-06-02 17:52:33 +00:00
cl::init(cl::BOU_UNSET), cl::Hidden);
2009-11-19 08:59:28 +00:00
2009-06-02 17:52:33 +00:00
// Throttle for huge numbers of predecessors (compile speed problems)
static cl::opt<unsigned>
2009-11-18 14:58:34 +00:00
TailMergeThreshold("tail-merge-threshold",
2009-06-02 17:52:33 +00:00
cl::desc("Max number of predecessors to consider tail merging"),
cl::init(150), cl::Hidden);
2009-11-18 14:58:34 +00:00
// Heuristic for tail merging (and, inversely, tail duplication).
// TODO: This should be replaced with a target query.
static cl::opt<unsigned>
TailMergeSize("tail-merge-size",
cl::desc("Min number of instructions to consider tail merging"),
cl::init(3), cl::Hidden);
namespace {
/// BranchFolderPass - Wrap branch folder in a machine function pass.
class BranchFolderPass : public MachineFunctionPass,
public BranchFolder {
public:
static char ID;
explicit BranchFolderPass(bool defaultEnableTailMerge)
: MachineFunctionPass(ID), BranchFolder(defaultEnableTailMerge) {}
2009-11-18 14:58:34 +00:00
virtual bool runOnMachineFunction(MachineFunction &MF);
virtual const char *getPassName() const { return "Control Flow Optimizer"; }
};
}
2009-06-02 17:52:33 +00:00
2009-10-14 17:57:32 +00:00
char BranchFolderPass::ID = 0;
2009-06-02 17:52:33 +00:00
2009-11-18 14:58:34 +00:00
FunctionPass *llvm::createBranchFoldingPass(bool DefaultEnableTailMerge) {
2009-10-14 17:57:32 +00:00
return new BranchFolderPass(DefaultEnableTailMerge);
}
bool BranchFolderPass::runOnMachineFunction(MachineFunction &MF) {
return OptimizeFunction(MF,
MF.getTarget().getInstrInfo(),
MF.getTarget().getRegisterInfo(),
getAnalysisIfAvailable<MachineModuleInfo>());
}
BranchFolder::BranchFolder(bool defaultEnableTailMerge) {
switch (FlagEnableTailMerge) {
case cl::BOU_UNSET: EnableTailMerge = defaultEnableTailMerge; break;
case cl::BOU_TRUE: EnableTailMerge = true; break;
case cl::BOU_FALSE: EnableTailMerge = false; break;
}
}
2009-06-02 17:52:33 +00:00
/// RemoveDeadBlock - Remove the specified dead machine basic block from the
/// function, updating the CFG.
void BranchFolder::RemoveDeadBlock(MachineBasicBlock *MBB) {
assert(MBB->pred_empty() && "MBB must be dead!");
2010-01-01 10:31:22 +00:00
DEBUG(dbgs() << "\nRemoving MBB: " << *MBB);
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
MachineFunction *MF = MBB->getParent();
// drop all successors.
while (!MBB->succ_empty())
MBB->removeSuccessor(MBB->succ_end()-1);
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// Remove the block.
MF->erase(MBB);
}
/// OptimizeImpDefsBlock - If a basic block is just a bunch of implicit_def
/// followed by terminators, and if the implicitly defined registers are not
/// used by the terminators, remove those implicit_def's. e.g.
/// BB1:
/// r0 = implicit_def
/// r1 = implicit_def
/// br
/// This block can be optimized away later if the implicit instructions are
/// removed.
bool BranchFolder::OptimizeImpDefsBlock(MachineBasicBlock *MBB) {
SmallSet<unsigned, 4> ImpDefRegs;
MachineBasicBlock::iterator I = MBB->begin();
while (I != MBB->end()) {
2010-02-16 09:30:23 +00:00
if (!I->isImplicitDef())
2009-06-02 17:52:33 +00:00
break;
unsigned Reg = I->getOperand(0).getReg();
ImpDefRegs.insert(Reg);
2009-10-14 17:57:32 +00:00
for (const unsigned *SubRegs = TRI->getSubRegisters(Reg);
2009-06-02 17:52:33 +00:00
unsigned SubReg = *SubRegs; ++SubRegs)
ImpDefRegs.insert(SubReg);
++I;
}
if (ImpDefRegs.empty())
return false;
MachineBasicBlock::iterator FirstTerm = I;
while (I != MBB->end()) {
if (!TII->isUnpredicatedTerminator(I))
return false;
// See if it uses any of the implicitly defined registers.
for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) {
MachineOperand &MO = I->getOperand(i);
if (!MO.isReg() || !MO.isUse())
continue;
unsigned Reg = MO.getReg();
if (ImpDefRegs.count(Reg))
return false;
}
++I;
}
I = MBB->begin();
while (I != FirstTerm) {
MachineInstr *ImpDefMI = &*I;
++I;
MBB->erase(ImpDefMI);
}
return true;
}
2009-10-14 17:57:32 +00:00
/// OptimizeFunction - Perhaps branch folding, tail merging and other
/// CFG optimizations on the given function.
bool BranchFolder::OptimizeFunction(MachineFunction &MF,
const TargetInstrInfo *tii,
const TargetRegisterInfo *tri,
MachineModuleInfo *mmi) {
if (!tii) return false;
TII = tii;
TRI = tri;
MMI = mmi;
2009-06-02 17:52:33 +00:00
2009-10-14 17:57:32 +00:00
RS = TRI->requiresRegisterScavenging(MF) ? new RegScavenger() : NULL;
2009-06-02 17:52:33 +00:00
// Fix CFG. The later algorithms expect it to be right.
2009-10-14 17:57:32 +00:00
bool MadeChange = false;
2009-06-02 17:52:33 +00:00
for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; I++) {
MachineBasicBlock *MBB = I, *TBB = 0, *FBB = 0;
SmallVector<MachineOperand, 4> Cond;
if (!TII->AnalyzeBranch(*MBB, TBB, FBB, Cond, true))
2009-10-14 17:57:32 +00:00
MadeChange |= MBB->CorrectExtraCFGEdges(TBB, FBB, !Cond.empty());
MadeChange |= OptimizeImpDefsBlock(MBB);
2009-06-02 17:52:33 +00:00
}
bool MadeChangeThisIteration = true;
while (MadeChangeThisIteration) {
MadeChangeThisIteration = false;
MadeChangeThisIteration |= TailMergeBlocks(MF);
MadeChangeThisIteration |= OptimizeBranches(MF);
2009-10-14 17:57:32 +00:00
MadeChange |= MadeChangeThisIteration;
2009-06-02 17:52:33 +00:00
}
2010-03-21 10:49:05 +00:00
// See if any jump tables have become dead as the code generator
2009-06-02 17:52:33 +00:00
// did its thing.
MachineJumpTableInfo *JTI = MF.getJumpTableInfo();
2010-02-16 09:30:23 +00:00
if (JTI == 0) {
delete RS;
return MadeChange;
}
2010-03-21 10:49:05 +00:00
// Walk the function to find jump tables that are live.
BitVector JTIsLive(JTI->getJumpTables().size());
2010-02-16 09:30:23 +00:00
for (MachineFunction::iterator BB = MF.begin(), E = MF.end();
BB != E; ++BB) {
for (MachineBasicBlock::iterator I = BB->begin(), E = BB->end();
I != E; ++I)
for (unsigned op = 0, e = I->getNumOperands(); op != e; ++op) {
MachineOperand &Op = I->getOperand(op);
if (!Op.isJTI()) continue;
// Remember that this JT is live.
2010-03-21 10:49:05 +00:00
JTIsLive.set(Op.getIndex());
2009-06-02 17:52:33 +00:00
}
}
2009-10-14 17:57:32 +00:00
2010-03-21 10:49:05 +00:00
// Finally, remove dead jump tables. This happens when the
// indirect jump was unreachable (and thus deleted).
2010-02-16 09:30:23 +00:00
for (unsigned i = 0, e = JTIsLive.size(); i != e; ++i)
if (!JTIsLive.test(i)) {
JTI->RemoveJumpTable(i);
MadeChange = true;
}
2009-06-02 17:52:33 +00:00
delete RS;
2009-10-14 17:57:32 +00:00
return MadeChange;
2009-06-02 17:52:33 +00:00
}
//===----------------------------------------------------------------------===//
// Tail Merging of Blocks
//===----------------------------------------------------------------------===//
/// HashMachineInstr - Compute a hash value for MI and its operands.
static unsigned HashMachineInstr(const MachineInstr *MI) {
unsigned Hash = MI->getOpcode();
for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i) {
const MachineOperand &Op = MI->getOperand(i);
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// Merge in bits from the operand if easy.
unsigned OperandHash = 0;
switch (Op.getType()) {
case MachineOperand::MO_Register: OperandHash = Op.getReg(); break;
case MachineOperand::MO_Immediate: OperandHash = Op.getImm(); break;
case MachineOperand::MO_MachineBasicBlock:
OperandHash = Op.getMBB()->getNumber();
break;
case MachineOperand::MO_FrameIndex:
case MachineOperand::MO_ConstantPoolIndex:
case MachineOperand::MO_JumpTableIndex:
OperandHash = Op.getIndex();
break;
case MachineOperand::MO_GlobalAddress:
case MachineOperand::MO_ExternalSymbol:
// Global address / external symbol are too hard, don't bother, but do
// pull in the offset.
OperandHash = Op.getOffset();
break;
default: break;
}
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
Hash += ((OperandHash << 3) | Op.getType()) << (i&31);
}
return Hash;
}
2010-05-04 16:11:02 +00:00
/// HashEndOfMBB - Hash the last instruction in the MBB.
static unsigned HashEndOfMBB(const MachineBasicBlock *MBB) {
2009-06-02 17:52:33 +00:00
MachineBasicBlock::const_iterator I = MBB->end();
if (I == MBB->begin())
return 0; // Empty MBB.
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
--I;
2010-03-10 17:45:15 +00:00
// Skip debug info so it will not affect codegen.
while (I->isDebugValue()) {
if (I==MBB->begin())
return 0; // MBB empty except for debug info.
--I;
}
2009-11-18 14:58:34 +00:00
2010-05-04 16:11:02 +00:00
return HashMachineInstr(I);
2009-06-02 17:52:33 +00:00
}
/// ComputeCommonTailLength - Given two machine basic blocks, compute the number
/// of instructions they actually have in common together at their end. Return
/// iterators for the first shared instruction in each block.
static unsigned ComputeCommonTailLength(MachineBasicBlock *MBB1,
MachineBasicBlock *MBB2,
MachineBasicBlock::iterator &I1,
MachineBasicBlock::iterator &I2) {
I1 = MBB1->end();
I2 = MBB2->end();
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
unsigned TailLen = 0;
while (I1 != MBB1->begin() && I2 != MBB2->begin()) {
--I1; --I2;
2010-03-10 17:45:15 +00:00
// Skip debugging pseudos; necessary to avoid changing the code.
while (I1->isDebugValue()) {
if (I1==MBB1->begin()) {
while (I2->isDebugValue()) {
if (I2==MBB2->begin())
// I1==DBG at begin; I2==DBG at begin
return TailLen;
--I2;
}
++I2;
// I1==DBG at begin; I2==non-DBG, or first of DBGs not at begin
return TailLen;
}
--I1;
}
// I1==first (untested) non-DBG preceding known match
while (I2->isDebugValue()) {
if (I2==MBB2->begin()) {
++I1;
// I1==non-DBG, or first of DBGs not at begin; I2==DBG at begin
return TailLen;
}
--I2;
}
// I1, I2==first (untested) non-DBGs preceding known match
if (!I1->isIdenticalTo(I2) ||
2009-06-02 17:52:33 +00:00
// FIXME: This check is dubious. It's used to get around a problem where
// people incorrectly expect inline asm directives to remain in the same
// relative order. This is untenable because normal compiler
// optimizations (like this one) may reorder and/or merge these
// directives.
2010-02-16 09:30:23 +00:00
I1->isInlineAsm()) {
2009-06-02 17:52:33 +00:00
++I1; ++I2;
break;
}
++TailLen;
}
2010-03-10 17:45:15 +00:00
// Back past possible debugging pseudos at beginning of block. This matters
// when one block differs from the other only by whether debugging pseudos
// are present at the beginning. (This way, the various checks later for
// I1==MBB1->begin() work as expected.)
if (I1 == MBB1->begin() && I2 != MBB2->begin()) {
--I2;
while (I2->isDebugValue()) {
if (I2 == MBB2->begin()) {
return TailLen;
}
--I2;
}
++I2;
}
if (I2 == MBB2->begin() && I1 != MBB1->begin()) {
--I1;
while (I1->isDebugValue()) {
if (I1 == MBB1->begin())
return TailLen;
--I1;
}
++I1;
}
2009-06-02 17:52:33 +00:00
return TailLen;
}
/// ReplaceTailWithBranchTo - Delete the instruction OldInst and everything
2010-07-13 17:19:57 +00:00
/// after it, replacing it with an unconditional branch to NewDest.
2009-06-02 17:52:33 +00:00
void BranchFolder::ReplaceTailWithBranchTo(MachineBasicBlock::iterator OldInst,
MachineBasicBlock *NewDest) {
2010-07-13 17:19:57 +00:00
TII->ReplaceTailWithBranchTo(OldInst, NewDest);
2009-06-02 17:52:33 +00:00
++NumTailMerge;
}
/// SplitMBBAt - Given a machine basic block and an iterator into it, split the
/// MBB so that the part before the iterator falls into the part starting at the
/// iterator. This returns the new MBB.
MachineBasicBlock *BranchFolder::SplitMBBAt(MachineBasicBlock &CurMBB,
MachineBasicBlock::iterator BBI1) {
2010-07-13 17:19:57 +00:00
if (!TII->isLegalToSplitMBBAt(CurMBB, BBI1))
return 0;
2009-06-02 17:52:33 +00:00
MachineFunction &MF = *CurMBB.getParent();
// Create the fall-through block.
MachineFunction::iterator MBBI = &CurMBB;
MachineBasicBlock *NewMBB =MF.CreateMachineBasicBlock(CurMBB.getBasicBlock());
CurMBB.getParent()->insert(++MBBI, NewMBB);
// Move all the successors of this block to the specified block.
NewMBB->transferSuccessors(&CurMBB);
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// Add an edge from CurMBB to NewMBB for the fall-through.
CurMBB.addSuccessor(NewMBB);
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// Splice the code over.
NewMBB->splice(NewMBB->end(), &CurMBB, BBI1, CurMBB.end());
// For targets that use the register scavenger, we must maintain LiveIns.
if (RS) {
RS->enterBasicBlock(&CurMBB);
if (!CurMBB.empty())
RS->forward(prior(CurMBB.end()));
2009-10-14 17:57:32 +00:00
BitVector RegsLiveAtExit(TRI->getNumRegs());
2009-06-02 17:52:33 +00:00
RS->getRegsUsed(RegsLiveAtExit, false);
2009-11-18 14:58:34 +00:00
for (unsigned int i = 0, e = TRI->getNumRegs(); i != e; i++)
2009-06-02 17:52:33 +00:00
if (RegsLiveAtExit[i])
NewMBB->addLiveIn(i);
}
return NewMBB;
}
/// EstimateRuntime - Make a rough estimate for how long it will take to run
/// the specified code.
static unsigned EstimateRuntime(MachineBasicBlock::iterator I,
MachineBasicBlock::iterator E) {
unsigned Time = 0;
for (; I != E; ++I) {
2010-03-06 09:22:29 +00:00
if (I->isDebugValue())
continue;
2009-06-02 17:52:33 +00:00
const TargetInstrDesc &TID = I->getDesc();
if (TID.isCall())
Time += 10;
else if (TID.mayLoad() || TID.mayStore())
Time += 2;
else
++Time;
}
return Time;
}
// CurMBB needs to add an unconditional branch to SuccMBB (we removed these
// branches temporarily for tail merging). In the case where CurMBB ends
// with a conditional branch to the next block, optimize by reversing the
// test and conditionally branching to SuccMBB instead.
2009-11-18 14:58:34 +00:00
static void FixTail(MachineBasicBlock *CurMBB, MachineBasicBlock *SuccBB,
2009-06-02 17:52:33 +00:00
const TargetInstrInfo *TII) {
MachineFunction *MF = CurMBB->getParent();
2009-12-15 18:09:07 +00:00
MachineFunction::iterator I = llvm::next(MachineFunction::iterator(CurMBB));
2009-06-02 17:52:33 +00:00
MachineBasicBlock *TBB = 0, *FBB = 0;
SmallVector<MachineOperand, 4> Cond;
2010-07-13 17:19:57 +00:00
DebugLoc dl; // FIXME: this is nowhere
2009-06-02 17:52:33 +00:00
if (I != MF->end() &&
!TII->AnalyzeBranch(*CurMBB, TBB, FBB, Cond, true)) {
MachineBasicBlock *NextBB = I;
if (TBB == NextBB && !Cond.empty() && !FBB) {
if (!TII->ReverseBranchCondition(Cond)) {
TII->RemoveBranch(*CurMBB);
2010-07-13 17:19:57 +00:00
TII->InsertBranch(*CurMBB, SuccBB, NULL, Cond, dl);
2009-06-02 17:52:33 +00:00
return;
}
}
}
2010-07-13 17:19:57 +00:00
TII->InsertBranch(*CurMBB, SuccBB, NULL,
SmallVector<MachineOperand, 0>(), dl);
2009-06-02 17:52:33 +00:00
}
2009-11-18 14:58:34 +00:00
bool
BranchFolder::MergePotentialsElt::operator<(const MergePotentialsElt &o) const {
if (getHash() < o.getHash())
return true;
else if (getHash() > o.getHash())
return false;
else if (getBlock()->getNumber() < o.getBlock()->getNumber())
return true;
else if (getBlock()->getNumber() > o.getBlock()->getNumber())
return false;
else {
// _GLIBCXX_DEBUG checks strict weak ordering, which involves comparing
// an object with itself.
2009-06-02 17:52:33 +00:00
#ifndef _GLIBCXX_DEBUG
2009-11-18 14:58:34 +00:00
llvm_unreachable("Predecessor appears twice");
2009-06-02 17:52:33 +00:00
#endif
2009-11-18 14:58:34 +00:00
return false;
}
}
/// CountTerminators - Count the number of terminators in the given
/// block and set I to the position of the first non-terminator, if there
/// is one, or MBB->end() otherwise.
static unsigned CountTerminators(MachineBasicBlock *MBB,
MachineBasicBlock::iterator &I) {
I = MBB->end();
unsigned NumTerms = 0;
for (;;) {
if (I == MBB->begin()) {
I = MBB->end();
break;
2009-06-02 17:52:33 +00:00
}
2009-11-18 14:58:34 +00:00
--I;
if (!I->getDesc().isTerminator()) break;
++NumTerms;
}
return NumTerms;
2009-06-02 17:52:33 +00:00
}
2009-11-04 14:58:56 +00:00
/// ProfitableToMerge - Check if two machine basic blocks have a common tail
/// and decide if it would be profitable to merge those tails. Return the
/// length of the common tail and iterators to the first common instruction
/// in each block.
static bool ProfitableToMerge(MachineBasicBlock *MBB1,
MachineBasicBlock *MBB2,
unsigned minCommonTailLength,
unsigned &CommonTailLen,
MachineBasicBlock::iterator &I1,
2009-11-18 14:58:34 +00:00
MachineBasicBlock::iterator &I2,
MachineBasicBlock *SuccBB,
MachineBasicBlock *PredBB) {
2009-11-04 14:58:56 +00:00
CommonTailLen = ComputeCommonTailLength(MBB1, MBB2, I1, I2);
if (CommonTailLen == 0)
return false;
DEBUG(dbgs() << "Common tail length of BB#" << MBB1->getNumber()
<< " and BB#" << MBB2->getNumber() << " is " << CommonTailLen
<< '\n');
2009-11-04 14:58:56 +00:00
2009-11-18 14:58:34 +00:00
// It's almost always profitable to merge any number of non-terminator
// instructions with the block that falls through into the common successor.
if (MBB1 == PredBB || MBB2 == PredBB) {
MachineBasicBlock::iterator I;
unsigned NumTerms = CountTerminators(MBB1 == PredBB ? MBB2 : MBB1, I);
if (CommonTailLen > NumTerms)
return true;
}
// If one of the blocks can be completely merged and happens to be in
// a position where the other could fall through into it, merge any number
// of instructions, because it can be done without a branch.
// TODO: If the blocks are not adjacent, move one of them so that they are?
if (MBB1->isLayoutSuccessor(MBB2) && I2 == MBB2->begin())
return true;
if (MBB2->isLayoutSuccessor(MBB1) && I1 == MBB1->begin())
return true;
// If both blocks have an unconditional branch temporarily stripped out,
// count that as an additional common instruction for the following
// heuristics.
unsigned EffectiveTailLen = CommonTailLen;
if (SuccBB && MBB1 != PredBB && MBB2 != PredBB &&
!MBB1->back().getDesc().isBarrier() &&
!MBB2->back().getDesc().isBarrier())
++EffectiveTailLen;
// Check if the common tail is long enough to be worthwhile.
if (EffectiveTailLen >= minCommonTailLength)
return true;
// If we are optimizing for code size, 2 instructions in common is enough if
// we don't have to split a block. At worst we will be introducing 1 new
// branch instruction, which is likely to be smaller than the 2
// instructions that would be deleted in the merge.
MachineFunction *MF = MBB1->getParent();
2009-11-18 14:58:34 +00:00
if (EffectiveTailLen >= 2 &&
MF->getFunction()->hasFnAttr(Attribute::OptimizeForSize) &&
2009-11-04 14:58:56 +00:00
(I1 == MBB1->begin() || I2 == MBB2->begin()))
return true;
return false;
}
2009-06-02 17:52:33 +00:00
/// ComputeSameTails - Look through all the blocks in MergePotentials that have
2009-11-18 14:58:34 +00:00
/// hash CurHash (guaranteed to match the last element). Build the vector
2009-06-02 17:52:33 +00:00
/// SameTails of all those that have the (same) largest number of instructions
/// in common of any pair of these blocks. SameTails entries contain an
2009-11-18 14:58:34 +00:00
/// iterator into MergePotentials (from which the MachineBasicBlock can be
/// found) and a MachineBasicBlock::iterator into that MBB indicating the
2009-06-02 17:52:33 +00:00
/// instruction where the matching code sequence begins.
/// Order of elements in SameTails is the reverse of the order in which
/// those blocks appear in MergePotentials (where they are not necessarily
/// consecutive).
2009-11-18 14:58:34 +00:00
unsigned BranchFolder::ComputeSameTails(unsigned CurHash,
unsigned minCommonTailLength,
MachineBasicBlock *SuccBB,
MachineBasicBlock *PredBB) {
2009-06-02 17:52:33 +00:00
unsigned maxCommonTailLength = 0U;
SameTails.clear();
MachineBasicBlock::iterator TrialBBI1, TrialBBI2;
MPIterator HighestMPIter = prior(MergePotentials.end());
for (MPIterator CurMPIter = prior(MergePotentials.end()),
2009-11-18 14:58:34 +00:00
B = MergePotentials.begin();
CurMPIter != B && CurMPIter->getHash() == CurHash;
2009-06-02 17:52:33 +00:00
--CurMPIter) {
2009-11-18 14:58:34 +00:00
for (MPIterator I = prior(CurMPIter); I->getHash() == CurHash ; --I) {
2009-11-04 14:58:56 +00:00
unsigned CommonTailLen;
2009-11-18 14:58:34 +00:00
if (ProfitableToMerge(CurMPIter->getBlock(), I->getBlock(),
minCommonTailLength,
CommonTailLen, TrialBBI1, TrialBBI2,
SuccBB, PredBB)) {
2009-06-02 17:52:33 +00:00
if (CommonTailLen > maxCommonTailLength) {
SameTails.clear();
maxCommonTailLength = CommonTailLen;
HighestMPIter = CurMPIter;
2009-11-18 14:58:34 +00:00
SameTails.push_back(SameTailElt(CurMPIter, TrialBBI1));
2009-06-02 17:52:33 +00:00
}
if (HighestMPIter == CurMPIter &&
CommonTailLen == maxCommonTailLength)
2009-11-18 14:58:34 +00:00
SameTails.push_back(SameTailElt(I, TrialBBI2));
2009-06-02 17:52:33 +00:00
}
2009-11-18 14:58:34 +00:00
if (I == B)
2009-06-02 17:52:33 +00:00
break;
}
}
return maxCommonTailLength;
}
/// RemoveBlocksWithHash - Remove all blocks with hash CurHash from
/// MergePotentials, restoring branches at ends of blocks as appropriate.
2009-11-18 14:58:34 +00:00
void BranchFolder::RemoveBlocksWithHash(unsigned CurHash,
MachineBasicBlock *SuccBB,
MachineBasicBlock *PredBB) {
2009-06-02 17:52:33 +00:00
MPIterator CurMPIter, B;
2009-11-18 14:58:34 +00:00
for (CurMPIter = prior(MergePotentials.end()), B = MergePotentials.begin();
CurMPIter->getHash() == CurHash;
2009-06-02 17:52:33 +00:00
--CurMPIter) {
// Put the unconditional branch back, if we need one.
2009-11-18 14:58:34 +00:00
MachineBasicBlock *CurMBB = CurMPIter->getBlock();
2009-06-02 17:52:33 +00:00
if (SuccBB && CurMBB != PredBB)
FixTail(CurMBB, SuccBB, TII);
2009-11-18 14:58:34 +00:00
if (CurMPIter == B)
2009-06-02 17:52:33 +00:00
break;
}
2009-11-18 14:58:34 +00:00
if (CurMPIter->getHash() != CurHash)
2009-06-02 17:52:33 +00:00
CurMPIter++;
MergePotentials.erase(CurMPIter, MergePotentials.end());
}
/// CreateCommonTailOnlyBlock - None of the blocks to be tail-merged consist
/// only of the common tail. Create a block that does by splitting one.
2010-07-13 17:19:57 +00:00
bool BranchFolder::CreateCommonTailOnlyBlock(MachineBasicBlock *&PredBB,
unsigned maxCommonTailLength,
unsigned &commonTailIndex) {
commonTailIndex = 0;
2009-06-02 17:52:33 +00:00
unsigned TimeEstimate = ~0U;
2009-11-18 14:58:34 +00:00
for (unsigned i = 0, e = SameTails.size(); i != e; ++i) {
2009-06-02 17:52:33 +00:00
// Use PredBB if possible; that doesn't require a new branch.
2009-11-18 14:58:34 +00:00
if (SameTails[i].getBlock() == PredBB) {
2009-06-02 17:52:33 +00:00
commonTailIndex = i;
break;
}
// Otherwise, make a (fairly bogus) choice based on estimate of
// how long it will take the various blocks to execute.
2009-11-18 14:58:34 +00:00
unsigned t = EstimateRuntime(SameTails[i].getBlock()->begin(),
SameTails[i].getTailStartPos());
if (t <= TimeEstimate) {
2009-06-02 17:52:33 +00:00
TimeEstimate = t;
commonTailIndex = i;
}
}
2009-11-18 14:58:34 +00:00
MachineBasicBlock::iterator BBI =
SameTails[commonTailIndex].getTailStartPos();
MachineBasicBlock *MBB = SameTails[commonTailIndex].getBlock();
2009-06-02 17:52:33 +00:00
2010-03-10 17:45:15 +00:00
// If the common tail includes any debug info we will take it pretty
// randomly from one of the inputs. Might be better to remove it?
2010-01-01 10:31:22 +00:00
DEBUG(dbgs() << "\nSplitting BB#" << MBB->getNumber() << ", size "
2009-10-14 17:57:32 +00:00
<< maxCommonTailLength);
2009-06-02 17:52:33 +00:00
MachineBasicBlock *newMBB = SplitMBBAt(*MBB, BBI);
2010-07-13 17:19:57 +00:00
if (!newMBB) {
DEBUG(dbgs() << "... failed!");
return false;
}
2009-11-18 14:58:34 +00:00
SameTails[commonTailIndex].setBlock(newMBB);
SameTails[commonTailIndex].setTailStartPos(newMBB->begin());
2009-06-02 17:52:33 +00:00
// If we split PredBB, newMBB is the new predecessor.
2009-11-18 14:58:34 +00:00
if (PredBB == MBB)
2009-06-02 17:52:33 +00:00
PredBB = newMBB;
2010-07-13 17:19:57 +00:00
return true;
2009-06-02 17:52:33 +00:00
}
// See if any of the blocks in MergePotentials (which all have a common single
// successor, or all have no successor) can be tail-merged. If there is a
// successor, any blocks in MergePotentials that are not tail-merged and
// are not immediately before Succ must have an unconditional branch to
2009-11-18 14:58:34 +00:00
// Succ added (but the predecessor/successor lists need no adjustment).
2009-06-02 17:52:33 +00:00
// The lone predecessor of Succ that falls through into Succ,
// if any, is given in PredBB.
2009-11-18 14:58:34 +00:00
bool BranchFolder::TryTailMergeBlocks(MachineBasicBlock *SuccBB,
MachineBasicBlock *PredBB) {
2009-10-14 17:57:32 +00:00
bool MadeChange = false;
2009-11-18 14:58:34 +00:00
// Except for the special cases below, tail-merge if there are at least
// this many instructions in common.
unsigned minCommonTailLength = TailMergeSize;
2010-01-01 10:31:22 +00:00
DEBUG(dbgs() << "\nTryTailMergeBlocks: ";
2009-11-18 14:58:34 +00:00
for (unsigned i = 0, e = MergePotentials.size(); i != e; ++i)
2010-01-01 10:31:22 +00:00
dbgs() << "BB#" << MergePotentials[i].getBlock()->getNumber()
2009-11-18 14:58:34 +00:00
<< (i == e-1 ? "" : ", ");
2010-01-01 10:31:22 +00:00
dbgs() << "\n";
2009-11-18 14:58:34 +00:00
if (SuccBB) {
2010-01-01 10:31:22 +00:00
dbgs() << " with successor BB#" << SuccBB->getNumber() << '\n';
2009-11-18 14:58:34 +00:00
if (PredBB)
2010-01-01 10:31:22 +00:00
dbgs() << " which has fall-through from BB#"
2009-11-18 14:58:34 +00:00
<< PredBB->getNumber() << "\n";
}
2010-01-01 10:31:22 +00:00
dbgs() << "Looking for common tails of at least "
2009-11-18 14:58:34 +00:00
<< minCommonTailLength << " instruction"
<< (minCommonTailLength == 1 ? "" : "s") << '\n';
);
2009-06-02 17:52:33 +00:00
// Sort by hash value so that blocks with identical end sequences sort
// together.
2009-11-18 14:58:34 +00:00
std::stable_sort(MergePotentials.begin(), MergePotentials.end());
2009-06-02 17:52:33 +00:00
// Walk through equivalence sets looking for actual exact matches.
while (MergePotentials.size() > 1) {
2009-11-18 14:58:34 +00:00
unsigned CurHash = MergePotentials.back().getHash();
2009-06-02 17:52:33 +00:00
// Build SameTails, identifying the set of blocks with this hash code
// and with the maximum number of instructions in common.
2009-11-18 14:58:34 +00:00
unsigned maxCommonTailLength = ComputeSameTails(CurHash,
minCommonTailLength,
SuccBB, PredBB);
2009-06-02 17:52:33 +00:00
2009-11-18 14:58:34 +00:00
// If we didn't find any pair that has at least minCommonTailLength
2009-06-02 17:52:33 +00:00
// instructions in common, remove all blocks with this hash code and retry.
if (SameTails.empty()) {
RemoveBlocksWithHash(CurHash, SuccBB, PredBB);
continue;
}
// If one of the blocks is the entire common tail (and not the entry
// block, which we can't jump to), we can treat all blocks with this same
// tail at once. Use PredBB if that is one of the possibilities, as that
// will not introduce any extra branches.
2009-11-18 14:58:34 +00:00
MachineBasicBlock *EntryBB = MergePotentials.begin()->getBlock()->
getParent()->begin();
unsigned commonTailIndex = SameTails.size();
// If there are two blocks, check to see if one can be made to fall through
// into the other.
if (SameTails.size() == 2 &&
SameTails[0].getBlock()->isLayoutSuccessor(SameTails[1].getBlock()) &&
SameTails[1].tailIsWholeBlock())
commonTailIndex = 1;
else if (SameTails.size() == 2 &&
SameTails[1].getBlock()->isLayoutSuccessor(
SameTails[0].getBlock()) &&
SameTails[0].tailIsWholeBlock())
commonTailIndex = 0;
else {
// Otherwise just pick one, favoring the fall-through predecessor if
// there is one.
for (unsigned i = 0, e = SameTails.size(); i != e; ++i) {
MachineBasicBlock *MBB = SameTails[i].getBlock();
if (MBB == EntryBB && SameTails[i].tailIsWholeBlock())
continue;
if (MBB == PredBB) {
commonTailIndex = i;
2009-06-02 17:52:33 +00:00
break;
2009-11-18 14:58:34 +00:00
}
if (SameTails[i].tailIsWholeBlock())
commonTailIndex = i;
2009-06-02 17:52:33 +00:00
}
}
2009-11-18 14:58:34 +00:00
if (commonTailIndex == SameTails.size() ||
(SameTails[commonTailIndex].getBlock() == PredBB &&
!SameTails[commonTailIndex].tailIsWholeBlock())) {
2009-06-02 17:52:33 +00:00
// None of the blocks consist entirely of the common tail.
// Split a block so that one does.
2010-07-13 17:19:57 +00:00
if (!CreateCommonTailOnlyBlock(PredBB,
maxCommonTailLength, commonTailIndex)) {
RemoveBlocksWithHash(CurHash, SuccBB, PredBB);
continue;
}
2009-06-02 17:52:33 +00:00
}
2009-11-18 14:58:34 +00:00
MachineBasicBlock *MBB = SameTails[commonTailIndex].getBlock();
2009-06-02 17:52:33 +00:00
// MBB is common tail. Adjust all other BB's to jump to this one.
// Traversal must be forwards so erases work.
2010-01-01 10:31:22 +00:00
DEBUG(dbgs() << "\nUsing common tail in BB#" << MBB->getNumber()
2009-11-18 14:58:34 +00:00
<< " for ");
for (unsigned int i=0, e = SameTails.size(); i != e; ++i) {
if (commonTailIndex == i)
2009-06-02 17:52:33 +00:00
continue;
2010-01-01 10:31:22 +00:00
DEBUG(dbgs() << "BB#" << SameTails[i].getBlock()->getNumber()
2009-11-18 14:58:34 +00:00
<< (i == e-1 ? "" : ", "));
2009-06-02 17:52:33 +00:00
// Hack the end off BB i, making it jump to BB commonTailIndex instead.
2009-11-18 14:58:34 +00:00
ReplaceTailWithBranchTo(SameTails[i].getTailStartPos(), MBB);
2009-06-02 17:52:33 +00:00
// BB i is no longer a predecessor of SuccBB; remove it from the worklist.
2009-11-18 14:58:34 +00:00
MergePotentials.erase(SameTails[i].getMPIter());
2009-06-02 17:52:33 +00:00
}
2010-01-01 10:31:22 +00:00
DEBUG(dbgs() << "\n");
2009-06-02 17:52:33 +00:00
// We leave commonTailIndex in the worklist in case there are other blocks
// that match it with a smaller number of instructions.
MadeChange = true;
}
return MadeChange;
}
bool BranchFolder::TailMergeBlocks(MachineFunction &MF) {
if (!EnableTailMerge) return false;
2009-11-18 14:58:34 +00:00
2009-10-14 17:57:32 +00:00
bool MadeChange = false;
2009-06-02 17:52:33 +00:00
// First find blocks with no successors.
MergePotentials.clear();
for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I) {
if (I->succ_empty())
2010-05-04 16:11:02 +00:00
MergePotentials.push_back(MergePotentialsElt(HashEndOfMBB(I), I));
2009-06-02 17:52:33 +00:00
}
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// See if we can do any tail merging on those.
if (MergePotentials.size() < TailMergeThreshold &&
MergePotentials.size() >= 2)
2009-11-18 14:58:34 +00:00
MadeChange |= TryTailMergeBlocks(NULL, NULL);
2009-06-02 17:52:33 +00:00
// Look at blocks (IBB) with multiple predecessors (PBB).
// We change each predecessor to a canonical form, by
// (1) temporarily removing any unconditional branch from the predecessor
// to IBB, and
// (2) alter conditional branches so they branch to the other block
2009-11-18 14:58:34 +00:00
// not IBB; this may require adding back an unconditional branch to IBB
2009-06-02 17:52:33 +00:00
// later, where there wasn't one coming in. E.g.
// Bcc IBB
// fallthrough to QBB
// here becomes
// Bncc QBB
// with a conceptual B to IBB after that, which never actually exists.
// With those changes, we see whether the predecessors' tails match,
// and merge them if so. We change things out of canonical form and
// back to the way they were later in the process. (OptimizeBranches
// would undo some of this, but we can't use it, because we'd get into
// a compile-time infinite loop repeatedly doing and undoing the same
// transformations.)
2009-12-15 18:09:07 +00:00
for (MachineFunction::iterator I = llvm::next(MF.begin()), E = MF.end();
2009-11-18 14:58:34 +00:00
I != E; ++I) {
2009-06-02 17:52:33 +00:00
if (I->pred_size() >= 2 && I->pred_size() < TailMergeThreshold) {
2009-10-14 17:57:32 +00:00
SmallPtrSet<MachineBasicBlock *, 8> UniquePreds;
2009-06-02 17:52:33 +00:00
MachineBasicBlock *IBB = I;
MachineBasicBlock *PredBB = prior(I);
MergePotentials.clear();
2009-11-18 14:58:34 +00:00
for (MachineBasicBlock::pred_iterator P = I->pred_begin(),
2009-06-02 17:52:33 +00:00
E2 = I->pred_end();
P != E2; ++P) {
2009-11-18 14:58:34 +00:00
MachineBasicBlock *PBB = *P;
2009-06-02 17:52:33 +00:00
// Skip blocks that loop to themselves, can't tail merge these.
2009-11-18 14:58:34 +00:00
if (PBB == IBB)
2009-06-02 17:52:33 +00:00
continue;
2009-10-14 17:57:32 +00:00
// Visit each predecessor only once.
if (!UniquePreds.insert(PBB))
continue;
2009-06-02 17:52:33 +00:00
MachineBasicBlock *TBB = 0, *FBB = 0;
SmallVector<MachineOperand, 4> Cond;
if (!TII->AnalyzeBranch(*PBB, TBB, FBB, Cond, true)) {
// Failing case: IBB is the target of a cbr, and
// we cannot reverse the branch.
SmallVector<MachineOperand, 4> NewCond(Cond);
2009-11-18 14:58:34 +00:00
if (!Cond.empty() && TBB == IBB) {
2009-06-02 17:52:33 +00:00
if (TII->ReverseBranchCondition(NewCond))
continue;
// This is the QBB case described above
if (!FBB)
2009-12-15 18:09:07 +00:00
FBB = llvm::next(MachineFunction::iterator(PBB));
2009-06-02 17:52:33 +00:00
}
// Failing case: the only way IBB can be reached from PBB is via
// exception handling. Happens for landing pads. Would be nice
// to have a bit in the edge so we didn't have to do all this.
if (IBB->isLandingPad()) {
MachineFunction::iterator IP = PBB; IP++;
2009-11-18 14:58:34 +00:00
MachineBasicBlock *PredNextBB = NULL;
if (IP != MF.end())
2009-06-02 17:52:33 +00:00
PredNextBB = IP;
2009-11-18 14:58:34 +00:00
if (TBB == NULL) {
if (IBB != PredNextBB) // fallthrough
2009-06-02 17:52:33 +00:00
continue;
} else if (FBB) {
2009-11-18 14:58:34 +00:00
if (TBB != IBB && FBB != IBB) // cbr then ubr
2009-06-02 17:52:33 +00:00
continue;
} else if (Cond.empty()) {
2009-11-18 14:58:34 +00:00
if (TBB != IBB) // ubr
2009-06-02 17:52:33 +00:00
continue;
} else {
2009-11-18 14:58:34 +00:00
if (TBB != IBB && IBB != PredNextBB) // cbr
2009-06-02 17:52:33 +00:00
continue;
}
}
// Remove the unconditional branch at the end, if any.
if (TBB && (Cond.empty() || FBB)) {
2010-07-13 17:19:57 +00:00
DebugLoc dl; // FIXME: this is nowhere
2009-06-02 17:52:33 +00:00
TII->RemoveBranch(*PBB);
if (!Cond.empty())
// reinsert conditional branch only, for now
2010-07-13 17:19:57 +00:00
TII->InsertBranch(*PBB, (TBB == IBB) ? FBB : TBB, 0, NewCond, dl);
2009-06-02 17:52:33 +00:00
}
2010-05-04 16:11:02 +00:00
MergePotentials.push_back(MergePotentialsElt(HashEndOfMBB(PBB), *P));
2009-06-02 17:52:33 +00:00
}
}
2009-11-18 14:58:34 +00:00
if (MergePotentials.size() >= 2)
MadeChange |= TryTailMergeBlocks(IBB, PredBB);
// Reinsert an unconditional branch if needed.
// The 1 below can occur as a result of removing blocks in TryTailMergeBlocks.
PredBB = prior(I); // this may have been changed in TryTailMergeBlocks
if (MergePotentials.size() == 1 &&
MergePotentials.begin()->getBlock() != PredBB)
FixTail(MergePotentials.begin()->getBlock(), IBB, TII);
2009-06-02 17:52:33 +00:00
}
}
return MadeChange;
}
//===----------------------------------------------------------------------===//
// Branch Optimization
//===----------------------------------------------------------------------===//
bool BranchFolder::OptimizeBranches(MachineFunction &MF) {
2009-10-14 17:57:32 +00:00
bool MadeChange = false;
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// Make sure blocks are numbered in order
MF.RenumberBlocks();
for (MachineFunction::iterator I = ++MF.begin(), E = MF.end(); I != E; ) {
MachineBasicBlock *MBB = I++;
2009-10-14 17:57:32 +00:00
MadeChange |= OptimizeBlock(MBB);
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// If it is dead, remove it.
if (MBB->pred_empty()) {
RemoveDeadBlock(MBB);
MadeChange = true;
++NumDeadBlocks;
}
}
return MadeChange;
}
2010-03-10 17:45:15 +00:00
// Blocks should be considered empty if they contain only debug info;
// else the debug info would affect codegen.
static bool IsEmptyBlock(MachineBasicBlock *MBB) {
if (MBB->empty())
return true;
for (MachineBasicBlock::iterator MBBI = MBB->begin(), MBBE = MBB->end();
MBBI!=MBBE; ++MBBI) {
if (!MBBI->isDebugValue())
return false;
}
return true;
}
2009-06-02 17:52:33 +00:00
2010-03-16 16:51:38 +00:00
// Blocks with only debug info and branches should be considered the same
// as blocks with only branches.
static bool IsBranchOnlyBlock(MachineBasicBlock *MBB) {
MachineBasicBlock::iterator MBBI, MBBE;
for (MBBI = MBB->begin(), MBBE = MBB->end(); MBBI!=MBBE; ++MBBI) {
if (!MBBI->isDebugValue())
break;
}
return (MBBI->getDesc().isBranch());
}
2009-06-02 17:52:33 +00:00
/// IsBetterFallthrough - Return true if it would be clearly better to
/// fall-through to MBB1 than to fall through into MBB2. This has to return
/// a strict ordering, returning true for both (MBB1,MBB2) and (MBB2,MBB1) will
/// result in infinite loops.
2009-11-18 14:58:34 +00:00
static bool IsBetterFallthrough(MachineBasicBlock *MBB1,
2009-06-02 17:52:33 +00:00
MachineBasicBlock *MBB2) {
// Right now, we use a simple heuristic. If MBB2 ends with a call, and
// MBB1 doesn't, we prefer to fall through into MBB1. This allows us to
// optimize branches that branch to either a return block or an assert block
// into a fallthrough to the return.
2010-04-02 08:54:30 +00:00
if (IsEmptyBlock(MBB1) || IsEmptyBlock(MBB2)) return false;
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// If there is a clear successor ordering we make sure that one block
// will fall through to the next
if (MBB1->isSuccessor(MBB2)) return true;
if (MBB2->isSuccessor(MBB1)) return false;
2010-04-02 08:54:30 +00:00
// Neither block consists entirely of debug info (per IsEmptyBlock check),
// so we needn't test for falling off the beginning here.
MachineBasicBlock::iterator MBB1I = --MBB1->end();
while (MBB1I->isDebugValue())
--MBB1I;
MachineBasicBlock::iterator MBB2I = --MBB2->end();
while (MBB2I->isDebugValue())
--MBB2I;
2009-06-02 17:52:33 +00:00
return MBB2I->getDesc().isCall() && !MBB1I->getDesc().isCall();
}
/// OptimizeBlock - Analyze and optimize control flow related to the specified
/// block. This is never called on the entry block.
2009-10-14 17:57:32 +00:00
bool BranchFolder::OptimizeBlock(MachineBasicBlock *MBB) {
bool MadeChange = false;
2009-11-18 14:58:34 +00:00
MachineFunction &MF = *MBB->getParent();
2010-07-13 17:19:57 +00:00
DebugLoc dl; // FIXME: this is nowhere
2009-11-18 14:58:34 +00:00
ReoptimizeBlock:
2009-10-14 17:57:32 +00:00
2009-06-02 17:52:33 +00:00
MachineFunction::iterator FallThrough = MBB;
++FallThrough;
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// If this block is empty, make everyone use its fall-through, not the block
// explicitly. Landing pads should not do this since the landing-pad table
2009-11-04 14:58:56 +00:00
// points to this block. Blocks with their addresses taken shouldn't be
// optimized away.
2010-03-10 17:45:15 +00:00
if (IsEmptyBlock(MBB) && !MBB->isLandingPad() && !MBB->hasAddressTaken()) {
2009-06-02 17:52:33 +00:00
// Dead block? Leave for cleanup later.
2009-10-14 17:57:32 +00:00
if (MBB->pred_empty()) return MadeChange;
2009-11-18 14:58:34 +00:00
if (FallThrough == MF.end()) {
2009-06-02 17:52:33 +00:00
// TODO: Simplify preds to not branch here if possible!
} else {
// Rewrite all predecessors of the old block to go to the fallthrough
// instead.
while (!MBB->pred_empty()) {
MachineBasicBlock *Pred = *(MBB->pred_end()-1);
Pred->ReplaceUsesOfBlockWith(MBB, FallThrough);
}
// If MBB was the target of a jump table, update jump tables to go to the
// fallthrough instead.
2010-02-16 09:30:23 +00:00
if (MachineJumpTableInfo *MJTI = MF.getJumpTableInfo())
MJTI->ReplaceMBBInJumpTables(MBB, FallThrough);
2009-06-02 17:52:33 +00:00
MadeChange = true;
}
2009-10-14 17:57:32 +00:00
return MadeChange;
2009-06-02 17:52:33 +00:00
}
// Check to see if we can simplify the terminator of the block before this
// one.
MachineBasicBlock &PrevBB = *prior(MachineFunction::iterator(MBB));
MachineBasicBlock *PriorTBB = 0, *PriorFBB = 0;
SmallVector<MachineOperand, 4> PriorCond;
bool PriorUnAnalyzable =
TII->AnalyzeBranch(PrevBB, PriorTBB, PriorFBB, PriorCond, true);
if (!PriorUnAnalyzable) {
// If the CFG for the prior block has extra edges, remove them.
MadeChange |= PrevBB.CorrectExtraCFGEdges(PriorTBB, PriorFBB,
!PriorCond.empty());
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// If the previous branch is conditional and both conditions go to the same
// destination, remove the branch, replacing it with an unconditional one or
// a fall-through.
if (PriorTBB && PriorTBB == PriorFBB) {
TII->RemoveBranch(PrevBB);
2009-11-18 14:58:34 +00:00
PriorCond.clear();
2009-06-02 17:52:33 +00:00
if (PriorTBB != MBB)
2010-07-13 17:19:57 +00:00
TII->InsertBranch(PrevBB, PriorTBB, 0, PriorCond, dl);
2009-06-02 17:52:33 +00:00
MadeChange = true;
++NumBranchOpts;
2009-11-18 14:58:34 +00:00
goto ReoptimizeBlock;
2009-06-02 17:52:33 +00:00
}
2009-11-18 14:58:34 +00:00
// If the previous block unconditionally falls through to this block and
// this block has no other predecessors, move the contents of this block
// into the prior block. This doesn't usually happen when SimplifyCFG
// has been used, but it can happen if tail merging splits a fall-through
// predecessor of a block.
// This has to check PrevBB->succ_size() because EH edges are ignored by
// AnalyzeBranch.
if (PriorCond.empty() && !PriorTBB && MBB->pred_size() == 1 &&
PrevBB.succ_size() == 1 &&
!MBB->hasAddressTaken() && !MBB->isLandingPad()) {
2010-01-01 10:31:22 +00:00
DEBUG(dbgs() << "\nMerging into block: " << PrevBB
2009-11-18 14:58:34 +00:00
<< "From MBB: " << *MBB);
PrevBB.splice(PrevBB.end(), MBB, MBB->begin(), MBB->end());
PrevBB.removeSuccessor(PrevBB.succ_begin());;
assert(PrevBB.succ_empty());
PrevBB.transferSuccessors(MBB);
MadeChange = true;
return MadeChange;
}
2009-06-02 17:52:33 +00:00
// If the previous branch *only* branches to *this* block (conditional or
// not) remove the branch.
if (PriorTBB == MBB && PriorFBB == 0) {
TII->RemoveBranch(PrevBB);
MadeChange = true;
++NumBranchOpts;
2009-11-18 14:58:34 +00:00
goto ReoptimizeBlock;
2009-06-02 17:52:33 +00:00
}
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// If the prior block branches somewhere else on the condition and here if
// the condition is false, remove the uncond second branch.
if (PriorFBB == MBB) {
TII->RemoveBranch(PrevBB);
2010-07-13 17:19:57 +00:00
TII->InsertBranch(PrevBB, PriorTBB, 0, PriorCond, dl);
2009-06-02 17:52:33 +00:00
MadeChange = true;
++NumBranchOpts;
2009-11-18 14:58:34 +00:00
goto ReoptimizeBlock;
2009-06-02 17:52:33 +00:00
}
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// If the prior block branches here on true and somewhere else on false, and
// if the branch condition is reversible, reverse the branch to create a
// fall-through.
if (PriorTBB == MBB) {
SmallVector<MachineOperand, 4> NewPriorCond(PriorCond);
if (!TII->ReverseBranchCondition(NewPriorCond)) {
TII->RemoveBranch(PrevBB);
2010-07-13 17:19:57 +00:00
TII->InsertBranch(PrevBB, PriorFBB, 0, NewPriorCond, dl);
2009-06-02 17:52:33 +00:00
MadeChange = true;
++NumBranchOpts;
2009-11-18 14:58:34 +00:00
goto ReoptimizeBlock;
2009-06-02 17:52:33 +00:00
}
}
2009-11-18 14:58:34 +00:00
2009-10-23 14:19:52 +00:00
// If this block has no successors (e.g. it is a return block or ends with
// a call to a no-return function like abort or __cxa_throw) and if the pred
// falls through into this block, and if it would otherwise fall through
// into the block after this, move this block to the end of the function.
2009-06-02 17:52:33 +00:00
//
// We consider it more likely that execution will stay in the function (e.g.
// due to loops) than it is to exit it. This asserts in loops etc, moving
// the assert condition out of the loop body.
2009-10-23 14:19:52 +00:00
if (MBB->succ_empty() && !PriorCond.empty() && PriorFBB == 0 &&
2009-06-02 17:52:33 +00:00
MachineFunction::iterator(PriorTBB) == FallThrough &&
2009-12-01 11:07:05 +00:00
!MBB->canFallThrough()) {
2009-06-02 17:52:33 +00:00
bool DoTransform = true;
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// We have to be careful that the succs of PredBB aren't both no-successor
// blocks. If neither have successors and if PredBB is the second from
// last block in the function, we'd just keep swapping the two blocks for
// last. Only do the swap if one is clearly better to fall through than
// the other.
2009-11-18 14:58:34 +00:00
if (FallThrough == --MF.end() &&
2009-06-02 17:52:33 +00:00
!IsBetterFallthrough(PriorTBB, MBB))
DoTransform = false;
if (DoTransform) {
// Reverse the branch so we will fall through on the previous true cond.
SmallVector<MachineOperand, 4> NewPriorCond(PriorCond);
if (!TII->ReverseBranchCondition(NewPriorCond)) {
2010-01-01 10:31:22 +00:00
DEBUG(dbgs() << "\nMoving MBB: " << *MBB
2009-10-14 17:57:32 +00:00
<< "To make fallthrough to: " << *PriorTBB << "\n");
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
TII->RemoveBranch(PrevBB);
2010-07-13 17:19:57 +00:00
TII->InsertBranch(PrevBB, MBB, 0, NewPriorCond, dl);
2009-06-02 17:52:33 +00:00
// Move this block to the end of the function.
2009-11-18 14:58:34 +00:00
MBB->moveAfter(--MF.end());
2009-06-02 17:52:33 +00:00
MadeChange = true;
++NumBranchOpts;
2009-10-14 17:57:32 +00:00
return MadeChange;
2009-06-02 17:52:33 +00:00
}
}
}
}
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// Analyze the branch in the current block.
MachineBasicBlock *CurTBB = 0, *CurFBB = 0;
SmallVector<MachineOperand, 4> CurCond;
bool CurUnAnalyzable= TII->AnalyzeBranch(*MBB, CurTBB, CurFBB, CurCond, true);
if (!CurUnAnalyzable) {
// If the CFG for the prior block has extra edges, remove them.
MadeChange |= MBB->CorrectExtraCFGEdges(CurTBB, CurFBB, !CurCond.empty());
2009-11-18 14:58:34 +00:00
// If this is a two-way branch, and the FBB branches to this block, reverse
2009-06-02 17:52:33 +00:00
// the condition so the single-basic-block loop is faster. Instead of:
// Loop: xxx; jcc Out; jmp Loop
// we want:
// Loop: xxx; jncc Loop; jmp Out
if (CurTBB && CurFBB && CurFBB == MBB && CurTBB != MBB) {
SmallVector<MachineOperand, 4> NewCond(CurCond);
if (!TII->ReverseBranchCondition(NewCond)) {
TII->RemoveBranch(*MBB);
2010-07-13 17:19:57 +00:00
TII->InsertBranch(*MBB, CurFBB, CurTBB, NewCond, dl);
2009-06-02 17:52:33 +00:00
MadeChange = true;
++NumBranchOpts;
2009-11-18 14:58:34 +00:00
goto ReoptimizeBlock;
2009-06-02 17:52:33 +00:00
}
}
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// If this branch is the only thing in its block, see if we can forward
// other blocks across it.
2009-11-18 14:58:34 +00:00
if (CurTBB && CurCond.empty() && CurFBB == 0 &&
2010-03-16 16:51:38 +00:00
IsBranchOnlyBlock(MBB) && CurTBB != MBB &&
2009-11-04 14:58:56 +00:00
!MBB->hasAddressTaken()) {
2009-06-02 17:52:33 +00:00
// This block may contain just an unconditional branch. Because there can
// be 'non-branch terminators' in the block, try removing the branch and
// then seeing if the block is empty.
TII->RemoveBranch(*MBB);
2010-03-10 17:45:15 +00:00
// If the only things remaining in the block are debug info, remove these
// as well, so this will behave the same as an empty block in non-debug
// mode.
if (!MBB->empty()) {
bool NonDebugInfoFound = false;
for (MachineBasicBlock::iterator I = MBB->begin(), E = MBB->end();
I != E; ++I) {
if (!I->isDebugValue()) {
NonDebugInfoFound = true;
break;
}
}
if (!NonDebugInfoFound)
// Make the block empty, losing the debug info (we could probably
// improve this in some cases.)
MBB->erase(MBB->begin(), MBB->end());
}
2009-06-02 17:52:33 +00:00
// If this block is just an unconditional branch to CurTBB, we can
// usually completely eliminate the block. The only case we cannot
// completely eliminate the block is when the block before this one
// falls through into MBB and we can't understand the prior block's branch
// condition.
if (MBB->empty()) {
2009-12-15 18:09:07 +00:00
bool PredHasNoFallThrough = !PrevBB.canFallThrough();
2009-06-02 17:52:33 +00:00
if (PredHasNoFallThrough || !PriorUnAnalyzable ||
!PrevBB.isSuccessor(MBB)) {
// If the prior block falls through into us, turn it into an
// explicit branch to us to make updates simpler.
2009-11-18 14:58:34 +00:00
if (!PredHasNoFallThrough && PrevBB.isSuccessor(MBB) &&
2009-06-02 17:52:33 +00:00
PriorTBB != MBB && PriorFBB != MBB) {
if (PriorTBB == 0) {
assert(PriorCond.empty() && PriorFBB == 0 &&
"Bad branch analysis");
PriorTBB = MBB;
} else {
assert(PriorFBB == 0 && "Machine CFG out of date!");
PriorFBB = MBB;
}
TII->RemoveBranch(PrevBB);
2010-07-13 17:19:57 +00:00
TII->InsertBranch(PrevBB, PriorTBB, PriorFBB, PriorCond, dl);
2009-06-02 17:52:33 +00:00
}
// Iterate through all the predecessors, revectoring each in-turn.
size_t PI = 0;
bool DidChange = false;
bool HasBranchToSelf = false;
while(PI != MBB->pred_size()) {
MachineBasicBlock *PMBB = *(MBB->pred_begin() + PI);
if (PMBB == MBB) {
// If this block has an uncond branch to itself, leave it.
++PI;
HasBranchToSelf = true;
} else {
DidChange = true;
PMBB->ReplaceUsesOfBlockWith(MBB, CurTBB);
// If this change resulted in PMBB ending in a conditional
// branch where both conditions go to the same destination,
// change this to an unconditional branch (and fix the CFG).
MachineBasicBlock *NewCurTBB = 0, *NewCurFBB = 0;
SmallVector<MachineOperand, 4> NewCurCond;
bool NewCurUnAnalyzable = TII->AnalyzeBranch(*PMBB, NewCurTBB,
NewCurFBB, NewCurCond, true);
if (!NewCurUnAnalyzable && NewCurTBB && NewCurTBB == NewCurFBB) {
TII->RemoveBranch(*PMBB);
2009-11-18 14:58:34 +00:00
NewCurCond.clear();
2010-07-13 17:19:57 +00:00
TII->InsertBranch(*PMBB, NewCurTBB, 0, NewCurCond, dl);
2009-06-02 17:52:33 +00:00
MadeChange = true;
++NumBranchOpts;
2009-11-18 14:58:34 +00:00
PMBB->CorrectExtraCFGEdges(NewCurTBB, 0, false);
2009-06-02 17:52:33 +00:00
}
}
}
// Change any jumptables to go to the new MBB.
2010-02-16 09:30:23 +00:00
if (MachineJumpTableInfo *MJTI = MF.getJumpTableInfo())
MJTI->ReplaceMBBInJumpTables(MBB, CurTBB);
2009-06-02 17:52:33 +00:00
if (DidChange) {
++NumBranchOpts;
MadeChange = true;
2009-10-14 17:57:32 +00:00
if (!HasBranchToSelf) return MadeChange;
2009-06-02 17:52:33 +00:00
}
}
}
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// Add the branch back if the block is more than just an uncond branch.
2010-07-13 17:19:57 +00:00
TII->InsertBranch(*MBB, CurTBB, 0, CurCond, dl);
2009-06-02 17:52:33 +00:00
}
}
// If the prior block doesn't fall through into this block, and if this
// block doesn't fall through into some other block, see if we can find a
// place to move this block where a fall-through will happen.
2009-12-01 11:07:05 +00:00
if (!PrevBB.canFallThrough()) {
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// Now we know that there was no fall-through into this block, check to
// see if it has a fall-through into its successor.
2009-12-01 11:07:05 +00:00
bool CurFallsThru = MBB->canFallThrough();
2009-06-02 17:52:33 +00:00
if (!MBB->isLandingPad()) {
// Check all the predecessors of this block. If one of them has no fall
// throughs, move this block right after it.
for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(),
E = MBB->pred_end(); PI != E; ++PI) {
// Analyze the branch at the end of the pred.
MachineBasicBlock *PredBB = *PI;
MachineFunction::iterator PredFallthrough = PredBB; ++PredFallthrough;
2010-01-01 10:31:22 +00:00
MachineBasicBlock *PredTBB = 0, *PredFBB = 0;
2009-11-18 14:58:34 +00:00
SmallVector<MachineOperand, 4> PredCond;
2009-12-01 11:07:05 +00:00
if (PredBB != MBB && !PredBB->canFallThrough() &&
2009-11-18 14:58:34 +00:00
!TII->AnalyzeBranch(*PredBB, PredTBB, PredFBB, PredCond, true)
2009-06-02 17:52:33 +00:00
&& (!CurFallsThru || !CurTBB || !CurFBB)
&& (!CurFallsThru || MBB->getNumber() >= PredBB->getNumber())) {
// If the current block doesn't fall through, just move it.
// If the current block can fall through and does not end with a
2009-11-18 14:58:34 +00:00
// conditional branch, we need to append an unconditional jump to
2009-06-02 17:52:33 +00:00
// the (current) next block. To avoid a possible compile-time
// infinite loop, move blocks only backward in this case.
// Also, if there are already 2 branches here, we cannot add a third;
// this means we have the case
// Bcc next
// B elsewhere
// next:
if (CurFallsThru) {
2009-12-15 18:09:07 +00:00
MachineBasicBlock *NextBB = llvm::next(MachineFunction::iterator(MBB));
2009-06-02 17:52:33 +00:00
CurCond.clear();
2010-07-13 17:19:57 +00:00
TII->InsertBranch(*MBB, NextBB, 0, CurCond, dl);
2009-06-02 17:52:33 +00:00
}
MBB->moveAfter(PredBB);
MadeChange = true;
2009-11-18 14:58:34 +00:00
goto ReoptimizeBlock;
2009-06-02 17:52:33 +00:00
}
}
}
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
if (!CurFallsThru) {
// Check all successors to see if we can move this block before it.
for (MachineBasicBlock::succ_iterator SI = MBB->succ_begin(),
E = MBB->succ_end(); SI != E; ++SI) {
// Analyze the branch at the end of the block before the succ.
MachineBasicBlock *SuccBB = *SI;
MachineFunction::iterator SuccPrev = SuccBB; --SuccPrev;
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// If this block doesn't already fall-through to that successor, and if
// the succ doesn't already have a block that can fall through into it,
// and if the successor isn't an EH destination, we can arrange for the
// fallthrough to happen.
2009-11-18 14:58:34 +00:00
if (SuccBB != MBB && &*SuccPrev != MBB &&
2009-12-01 11:07:05 +00:00
!SuccPrev->canFallThrough() && !CurUnAnalyzable &&
2009-06-02 17:52:33 +00:00
!SuccBB->isLandingPad()) {
MBB->moveBefore(SuccBB);
MadeChange = true;
2009-11-18 14:58:34 +00:00
goto ReoptimizeBlock;
2009-06-02 17:52:33 +00:00
}
}
2009-11-18 14:58:34 +00:00
2009-06-02 17:52:33 +00:00
// Okay, there is no really great place to put this block. If, however,
// the block before this one would be a fall-through if this block were
// removed, move this block to the end of the function.
2010-01-01 10:31:22 +00:00
MachineBasicBlock *PrevTBB = 0, *PrevFBB = 0;
2009-11-18 14:58:34 +00:00
SmallVector<MachineOperand, 4> PrevCond;
if (FallThrough != MF.end() &&
!TII->AnalyzeBranch(PrevBB, PrevTBB, PrevFBB, PrevCond, true) &&
2009-06-02 17:52:33 +00:00
PrevBB.isSuccessor(FallThrough)) {
2009-11-18 14:58:34 +00:00
MBB->moveAfter(--MF.end());
2009-06-02 17:52:33 +00:00
MadeChange = true;
2009-10-14 17:57:32 +00:00
return MadeChange;
2009-06-02 17:52:33 +00:00
}
}
}
2009-10-14 17:57:32 +00:00
return MadeChange;
2009-06-02 17:52:33 +00:00
}