Part one of switching to using a more sane heuristic for determining if-conversion profitability.

Rather than having arbitrary cutoffs, actually try to cost model the conversion.

For now, the constants are tuned to more or less match our existing behavior, but these will be
changed to reflect realistic values as this work proceeds.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@114973 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Owen Anderson
2010-09-28 18:32:13 +00:00
parent f2d7b7c879
commit b20b85168c
7 changed files with 46 additions and 55 deletions

View File

@ -304,27 +304,33 @@ public:
} }
/// isProfitableToIfCvt - Return true if it's profitable to first "NumInstrs" /// isProfitableToIfCvt - Return true if it's profitable to first "NumInstrs"
/// of the specified basic block. /// of the specified basic block, where the probability of the instructions
/// being executed is given by Probability.
virtual virtual
bool isProfitableToIfCvt(MachineBasicBlock &MBB, unsigned NumInstrs) const { bool isProfitableToIfCvt(MachineBasicBlock &MBB, unsigned NumInstrs,
float Probability) const {
return false; return false;
} }
/// isProfitableToIfCvt - Second variant of isProfitableToIfCvt, this one /// isProfitableToIfCvt - Second variant of isProfitableToIfCvt, this one
/// checks for the case where two basic blocks from true and false path /// checks for the case where two basic blocks from true and false path
/// of a if-then-else (diamond) are predicated on mutally exclusive /// of a if-then-else (diamond) are predicated on mutally exclusive
/// predicates. /// predicates, where the probability of the true path being taken is given
/// by Probability.
virtual bool virtual bool
isProfitableToIfCvt(MachineBasicBlock &TMBB, unsigned NumTInstrs, isProfitableToIfCvt(MachineBasicBlock &TMBB, unsigned NumTInstrs,
MachineBasicBlock &FMBB, unsigned NumFInstrs) const { MachineBasicBlock &FMBB, unsigned NumFInstrs,
float Probability) const {
return false; return false;
} }
/// isProfitableToDupForIfCvt - Return true if it's profitable for /// isProfitableToDupForIfCvt - Return true if it's profitable for
/// if-converter to duplicate a specific number of instructions in the /// if-converter to duplicate a specific number of instructions in the
/// specified MBB to enable if-conversion. /// specified MBB to enable if-conversion, where the probability of the
/// instructions being executed is given by Probability.
virtual bool virtual bool
isProfitableToDupForIfCvt(MachineBasicBlock &MBB,unsigned NumInstrs) const { isProfitableToDupForIfCvt(MachineBasicBlock &MBB, unsigned NumInstrs,
float Probability) const {
return false; return false;
} }

View File

@ -191,13 +191,13 @@ namespace {
void MergeBlocks(BBInfo &ToBBI, BBInfo &FromBBI, bool AddEdges = true); void MergeBlocks(BBInfo &ToBBI, BBInfo &FromBBI, bool AddEdges = true);
bool MeetIfcvtSizeLimit(MachineBasicBlock &BB, unsigned Size) const { bool MeetIfcvtSizeLimit(MachineBasicBlock &BB, unsigned Size) const {
return Size > 0 && TII->isProfitableToIfCvt(BB, Size); return Size > 0 && TII->isProfitableToIfCvt(BB, Size, 0.5);
} }
bool MeetIfcvtSizeLimit(MachineBasicBlock &TBB, unsigned TSize, bool MeetIfcvtSizeLimit(MachineBasicBlock &TBB, unsigned TSize,
MachineBasicBlock &FBB, unsigned FSize) const { MachineBasicBlock &FBB, unsigned FSize) const {
return TSize > 0 && FSize > 0 && return TSize > 0 && FSize > 0 &&
TII->isProfitableToIfCvt(TBB, TSize, FBB, FSize); TII->isProfitableToIfCvt(TBB, TSize, FBB, FSize, 0.5);
} }
// blockAlwaysFallThrough - Block ends without a terminator. // blockAlwaysFallThrough - Block ends without a terminator.
@ -444,7 +444,7 @@ bool IfConverter::ValidSimple(BBInfo &TrueBBI, unsigned &Dups) const {
if (TrueBBI.BB->pred_size() > 1) { if (TrueBBI.BB->pred_size() > 1) {
if (TrueBBI.CannotBeCopied || if (TrueBBI.CannotBeCopied ||
!TII->isProfitableToDupForIfCvt(*TrueBBI.BB, TrueBBI.NonPredSize)) !TII->isProfitableToDupForIfCvt(*TrueBBI.BB, TrueBBI.NonPredSize, 0.5))
return false; return false;
Dups = TrueBBI.NonPredSize; Dups = TrueBBI.NonPredSize;
} }
@ -481,7 +481,7 @@ bool IfConverter::ValidTriangle(BBInfo &TrueBBI, BBInfo &FalseBBI,
++Size; ++Size;
} }
} }
if (!TII->isProfitableToDupForIfCvt(*TrueBBI.BB, Size)) if (!TII->isProfitableToDupForIfCvt(*TrueBBI.BB, Size, 0.5))
return false; return false;
Dups = Size; Dups = Size;
} }

View File

@ -1195,22 +1195,36 @@ bool ARMBaseInstrInfo::isSchedulingBoundary(const MachineInstr *MI,
return false; return false;
} }
bool ARMBaseInstrInfo:: bool ARMBaseInstrInfo::isProfitableToIfCvt(MachineBasicBlock &MBB,
isProfitableToIfCvt(MachineBasicBlock &MBB, unsigned NumInstrs) const { unsigned NumInstrs,
float Probability) const {
if (!NumInstrs) if (!NumInstrs)
return false; return false;
if (Subtarget.getCPUString() == "generic")
// Generic (and overly aggressive) if-conversion limits for testing. // Attempt to estimate the relative costs of predication versus branching.
return NumInstrs <= 10; float UnpredCost = Probability * NumInstrs;
else if (Subtarget.hasV7Ops()) UnpredCost += 2.0; // FIXME: Should model a misprediction cost.
return NumInstrs <= 3;
return NumInstrs <= 2; float PredCost = NumInstrs;
return PredCost < UnpredCost;
} }
bool ARMBaseInstrInfo:: bool ARMBaseInstrInfo::
isProfitableToIfCvt(MachineBasicBlock &TMBB, unsigned NumT, isProfitableToIfCvt(MachineBasicBlock &TMBB, unsigned NumT,
MachineBasicBlock &FMBB, unsigned NumF) const { MachineBasicBlock &FMBB, unsigned NumF,
return NumT && NumF && NumT <= 2 && NumF <= 2; float Probability) const {
if (!NumT || !NumF)
return false;
// Attempt to estimate the relative costs of predication versus branching.
float UnpredCost = Probability * NumT + (1.0 - Probability) * NumF;
UnpredCost += 2.0; // FIXME: Should model a misprediction cost.
float PredCost = NumT + NumF;
return PredCost < UnpredCost;
} }
/// getInstrPredicate - If instruction is predicated, returns its predicate /// getInstrPredicate - If instruction is predicated, returns its predicate

View File

@ -312,13 +312,15 @@ public:
const MachineFunction &MF) const; const MachineFunction &MF) const;
virtual bool isProfitableToIfCvt(MachineBasicBlock &MBB, virtual bool isProfitableToIfCvt(MachineBasicBlock &MBB,
unsigned NumInstrs) const; unsigned NumInstrs, float Prob) const;
virtual bool isProfitableToIfCvt(MachineBasicBlock &TMBB,unsigned NumT, virtual bool isProfitableToIfCvt(MachineBasicBlock &TMBB,unsigned NumT,
MachineBasicBlock &FMBB,unsigned NumF) const; MachineBasicBlock &FMBB,unsigned NumF,
float Probability) const;
virtual bool isProfitableToDupForIfCvt(MachineBasicBlock &MBB, virtual bool isProfitableToDupForIfCvt(MachineBasicBlock &MBB,
unsigned NumInstrs) const { unsigned NumInstrs,
float Probability) const {
return NumInstrs && NumInstrs == 1; return NumInstrs && NumInstrs == 1;
} }

View File

@ -28,16 +28,6 @@
using namespace llvm; using namespace llvm;
static cl::opt<unsigned>
IfCvtLimit("thumb2-ifcvt-limit", cl::Hidden,
cl::desc("Thumb2 if-conversion limit (default 3)"),
cl::init(3));
static cl::opt<unsigned>
IfCvtDiamondLimit("thumb2-ifcvt-diamond-limit", cl::Hidden,
cl::desc("Thumb2 diamond if-conversion limit (default 3)"),
cl::init(3));
Thumb2InstrInfo::Thumb2InstrInfo(const ARMSubtarget &STI) Thumb2InstrInfo::Thumb2InstrInfo(const ARMSubtarget &STI)
: ARMBaseInstrInfo(STI), RI(*this, STI) { : ARMBaseInstrInfo(STI), RI(*this, STI) {
} }
@ -105,21 +95,6 @@ Thumb2InstrInfo::isLegalToSplitMBBAt(MachineBasicBlock &MBB,
return llvm::getITInstrPredicate(MBBI, PredReg) == ARMCC::AL; return llvm::getITInstrPredicate(MBBI, PredReg) == ARMCC::AL;
} }
bool Thumb2InstrInfo::isProfitableToIfCvt(MachineBasicBlock &MBB,
unsigned NumInstrs) const {
return NumInstrs && NumInstrs <= IfCvtLimit;
}
bool Thumb2InstrInfo::
isProfitableToIfCvt(MachineBasicBlock &TMBB, unsigned NumT,
MachineBasicBlock &FMBB, unsigned NumF) const {
// FIXME: Catch optimization such as:
// r0 = movne
// r0 = moveq
return NumT && NumF &&
NumT <= (IfCvtDiamondLimit) && NumF <= (IfCvtDiamondLimit);
}
void Thumb2InstrInfo::copyPhysReg(MachineBasicBlock &MBB, void Thumb2InstrInfo::copyPhysReg(MachineBasicBlock &MBB,
MachineBasicBlock::iterator I, DebugLoc DL, MachineBasicBlock::iterator I, DebugLoc DL,
unsigned DestReg, unsigned SrcReg, unsigned DestReg, unsigned SrcReg,

View File

@ -38,11 +38,6 @@ public:
bool isLegalToSplitMBBAt(MachineBasicBlock &MBB, bool isLegalToSplitMBBAt(MachineBasicBlock &MBB,
MachineBasicBlock::iterator MBBI) const; MachineBasicBlock::iterator MBBI) const;
bool isProfitableToIfCvt(MachineBasicBlock &MBB, unsigned NumInstrs) const;
bool isProfitableToIfCvt(MachineBasicBlock &TMBB, unsigned NumTInstrs,
MachineBasicBlock &FMBB, unsigned NumFInstrs) const;
void copyPhysReg(MachineBasicBlock &MBB, void copyPhysReg(MachineBasicBlock &MBB,
MachineBasicBlock::iterator I, DebugLoc DL, MachineBasicBlock::iterator I, DebugLoc DL,
unsigned DestReg, unsigned SrcReg, unsigned DestReg, unsigned SrcReg,

View File

@ -627,8 +627,7 @@ bb24: ; preds = %bb23
; in a register, and it shouldn't require any reloads here. ; in a register, and it shouldn't require any reloads here.
; CHECK: @ %bb24 ; CHECK: @ %bb24
; CHECK-NEXT: @ in Loop: Header=BB1_1 Depth=1 ; CHECK: subs{{.*}} [[REGISTER:(r[0-9]+)|(lr)]], #1
; CHECK-NEXT: sub{{.*}} [[REGISTER:(r[0-9]+)|(lr)]], #1
; CHECK-NEXT: bne.w ; CHECK-NEXT: bne.w
%92 = icmp eq i32 %tmp81, %indvar78 ; <i1> [#uses=1] %92 = icmp eq i32 %tmp81, %indvar78 ; <i1> [#uses=1]