mirror of
https://github.com/RPCSX/llvm.git
synced 2024-12-03 01:12:59 +00:00
Pass BranchProbability/BlockMass by value instead of const& as they are small. NFC.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@247357 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
337cd218ef
commit
e5457136e7
@ -84,7 +84,7 @@ public:
|
||||
/// \brief Add another mass.
|
||||
///
|
||||
/// Adds another mass, saturating at \a isFull() rather than overflowing.
|
||||
BlockMass &operator+=(const BlockMass &X) {
|
||||
BlockMass &operator+=(BlockMass X) {
|
||||
uint64_t Sum = Mass + X.Mass;
|
||||
Mass = Sum < Mass ? UINT64_MAX : Sum;
|
||||
return *this;
|
||||
@ -94,23 +94,23 @@ public:
|
||||
///
|
||||
/// Subtracts another mass, saturating at \a isEmpty() rather than
|
||||
/// undeflowing.
|
||||
BlockMass &operator-=(const BlockMass &X) {
|
||||
BlockMass &operator-=(BlockMass X) {
|
||||
uint64_t Diff = Mass - X.Mass;
|
||||
Mass = Diff > Mass ? 0 : Diff;
|
||||
return *this;
|
||||
}
|
||||
|
||||
BlockMass &operator*=(const BranchProbability &P) {
|
||||
BlockMass &operator*=(BranchProbability P) {
|
||||
Mass = P.scale(Mass);
|
||||
return *this;
|
||||
}
|
||||
|
||||
bool operator==(const BlockMass &X) const { return Mass == X.Mass; }
|
||||
bool operator!=(const BlockMass &X) const { return Mass != X.Mass; }
|
||||
bool operator<=(const BlockMass &X) const { return Mass <= X.Mass; }
|
||||
bool operator>=(const BlockMass &X) const { return Mass >= X.Mass; }
|
||||
bool operator<(const BlockMass &X) const { return Mass < X.Mass; }
|
||||
bool operator>(const BlockMass &X) const { return Mass > X.Mass; }
|
||||
bool operator==(BlockMass X) const { return Mass == X.Mass; }
|
||||
bool operator!=(BlockMass X) const { return Mass != X.Mass; }
|
||||
bool operator<=(BlockMass X) const { return Mass <= X.Mass; }
|
||||
bool operator>=(BlockMass X) const { return Mass >= X.Mass; }
|
||||
bool operator<(BlockMass X) const { return Mass < X.Mass; }
|
||||
bool operator>(BlockMass X) const { return Mass > X.Mass; }
|
||||
|
||||
/// \brief Convert to scaled number.
|
||||
///
|
||||
@ -122,20 +122,20 @@ public:
|
||||
raw_ostream &print(raw_ostream &OS) const;
|
||||
};
|
||||
|
||||
inline BlockMass operator+(const BlockMass &L, const BlockMass &R) {
|
||||
inline BlockMass operator+(BlockMass L, BlockMass R) {
|
||||
return BlockMass(L) += R;
|
||||
}
|
||||
inline BlockMass operator-(const BlockMass &L, const BlockMass &R) {
|
||||
inline BlockMass operator-(BlockMass L, BlockMass R) {
|
||||
return BlockMass(L) -= R;
|
||||
}
|
||||
inline BlockMass operator*(const BlockMass &L, const BranchProbability &R) {
|
||||
inline BlockMass operator*(BlockMass L, BranchProbability R) {
|
||||
return BlockMass(L) *= R;
|
||||
}
|
||||
inline BlockMass operator*(const BranchProbability &L, const BlockMass &R) {
|
||||
inline BlockMass operator*(BranchProbability L, BlockMass R) {
|
||||
return BlockMass(R) *= L;
|
||||
}
|
||||
|
||||
inline raw_ostream &operator<<(raw_ostream &OS, const BlockMass &X) {
|
||||
inline raw_ostream &operator<<(raw_ostream &OS, BlockMass X) {
|
||||
return X.print(OS);
|
||||
}
|
||||
|
||||
|
@ -37,13 +37,13 @@ public:
|
||||
|
||||
/// \brief Multiplies with a branch probability. The computation will never
|
||||
/// overflow.
|
||||
BlockFrequency &operator*=(const BranchProbability &Prob);
|
||||
const BlockFrequency operator*(const BranchProbability &Prob) const;
|
||||
BlockFrequency &operator*=(BranchProbability Prob);
|
||||
const BlockFrequency operator*(BranchProbability Prob) const;
|
||||
|
||||
/// \brief Divide by a non-zero branch probability using saturating
|
||||
/// arithmetic.
|
||||
BlockFrequency &operator/=(const BranchProbability &Prob);
|
||||
BlockFrequency operator/(const BranchProbability &Prob) const;
|
||||
BlockFrequency &operator/=(BranchProbability Prob);
|
||||
BlockFrequency operator/(BranchProbability Prob) const;
|
||||
|
||||
/// \brief Adds another block frequency using saturating arithmetic.
|
||||
BlockFrequency &operator+=(const BlockFrequency &Freq);
|
||||
|
@ -30,9 +30,10 @@ class BranchProbability {
|
||||
uint32_t D;
|
||||
|
||||
public:
|
||||
BranchProbability(uint32_t n, uint32_t d) : N(n), D(d) {
|
||||
assert(d > 0 && "Denominator cannot be 0!");
|
||||
assert(n <= d && "Probability cannot be bigger than 1!");
|
||||
BranchProbability(uint32_t Numerator, uint32_t Denominator)
|
||||
: N(Numerator), D(Denominator) {
|
||||
assert(D > 0 && "Denominator cannot be 0!");
|
||||
assert(N <= D && "Probability cannot be bigger than 1!");
|
||||
}
|
||||
|
||||
static BranchProbability getZero() { return BranchProbability(0, 1); }
|
||||
@ -80,7 +81,7 @@ public:
|
||||
bool operator>=(BranchProbability RHS) const { return !(*this < RHS); }
|
||||
};
|
||||
|
||||
inline raw_ostream &operator<<(raw_ostream &OS, const BranchProbability &Prob) {
|
||||
inline raw_ostream &operator<<(raw_ostream &OS, BranchProbability Prob) {
|
||||
return Prob.print(OS);
|
||||
}
|
||||
|
||||
|
@ -19,6 +19,7 @@
|
||||
#include "llvm/CodeGen/MachineCombinerPattern.h"
|
||||
#include "llvm/CodeGen/MachineFunction.h"
|
||||
#include "llvm/MC/MCInstrInfo.h"
|
||||
#include "llvm/Support/BranchProbability.h"
|
||||
#include "llvm/Target/TargetRegisterInfo.h"
|
||||
|
||||
namespace llvm {
|
||||
@ -38,7 +39,6 @@ class SelectionDAG;
|
||||
class ScheduleDAG;
|
||||
class TargetRegisterClass;
|
||||
class TargetRegisterInfo;
|
||||
class BranchProbability;
|
||||
class TargetSubtargetInfo;
|
||||
class TargetSchedModel;
|
||||
class DFAPacketizer;
|
||||
@ -511,7 +511,7 @@ public:
|
||||
virtual
|
||||
bool isProfitableToIfCvt(MachineBasicBlock &MBB, unsigned NumCycles,
|
||||
unsigned ExtraPredCycles,
|
||||
const BranchProbability &Probability) const {
|
||||
BranchProbability Probability) const {
|
||||
return false;
|
||||
}
|
||||
|
||||
@ -526,7 +526,7 @@ public:
|
||||
unsigned NumTCycles, unsigned ExtraTCycles,
|
||||
MachineBasicBlock &FMBB,
|
||||
unsigned NumFCycles, unsigned ExtraFCycles,
|
||||
const BranchProbability &Probability) const {
|
||||
BranchProbability Probability) const {
|
||||
return false;
|
||||
}
|
||||
|
||||
@ -538,7 +538,7 @@ public:
|
||||
/// will be properly predicted.
|
||||
virtual bool
|
||||
isProfitableToDupForIfCvt(MachineBasicBlock &MBB, unsigned NumCycles,
|
||||
const BranchProbability &Probability) const {
|
||||
BranchProbability Probability) const {
|
||||
return false;
|
||||
}
|
||||
|
||||
|
@ -190,10 +190,10 @@ namespace {
|
||||
private:
|
||||
bool ReverseBranchCondition(BBInfo &BBI);
|
||||
bool ValidSimple(BBInfo &TrueBBI, unsigned &Dups,
|
||||
const BranchProbability &Prediction) const;
|
||||
BranchProbability Prediction) const;
|
||||
bool ValidTriangle(BBInfo &TrueBBI, BBInfo &FalseBBI,
|
||||
bool FalseBranch, unsigned &Dups,
|
||||
const BranchProbability &Prediction) const;
|
||||
BranchProbability Prediction) const;
|
||||
bool ValidDiamond(BBInfo &TrueBBI, BBInfo &FalseBBI,
|
||||
unsigned &Dups1, unsigned &Dups2) const;
|
||||
void ScanInstructions(BBInfo &BBI);
|
||||
@ -218,7 +218,7 @@ namespace {
|
||||
|
||||
bool MeetIfcvtSizeLimit(MachineBasicBlock &BB,
|
||||
unsigned Cycle, unsigned Extra,
|
||||
const BranchProbability &Prediction) const {
|
||||
BranchProbability Prediction) const {
|
||||
return Cycle > 0 && TII->isProfitableToIfCvt(BB, Cycle, Extra,
|
||||
Prediction);
|
||||
}
|
||||
@ -227,7 +227,7 @@ namespace {
|
||||
unsigned TCycle, unsigned TExtra,
|
||||
MachineBasicBlock &FBB,
|
||||
unsigned FCycle, unsigned FExtra,
|
||||
const BranchProbability &Prediction) const {
|
||||
BranchProbability Prediction) const {
|
||||
return TCycle > 0 && FCycle > 0 &&
|
||||
TII->isProfitableToIfCvt(TBB, TCycle, TExtra, FBB, FCycle, FExtra,
|
||||
Prediction);
|
||||
@ -474,7 +474,7 @@ static inline MachineBasicBlock *getNextBlock(MachineBasicBlock *BB) {
|
||||
/// number of instructions that the ifcvt would need to duplicate if performed
|
||||
/// in Dups.
|
||||
bool IfConverter::ValidSimple(BBInfo &TrueBBI, unsigned &Dups,
|
||||
const BranchProbability &Prediction) const {
|
||||
BranchProbability Prediction) const {
|
||||
Dups = 0;
|
||||
if (TrueBBI.IsBeingAnalyzed || TrueBBI.IsDone)
|
||||
return false;
|
||||
@ -501,7 +501,7 @@ bool IfConverter::ValidSimple(BBInfo &TrueBBI, unsigned &Dups,
|
||||
/// if performed in 'Dups'.
|
||||
bool IfConverter::ValidTriangle(BBInfo &TrueBBI, BBInfo &FalseBBI,
|
||||
bool FalseBranch, unsigned &Dups,
|
||||
const BranchProbability &Prediction) const {
|
||||
BranchProbability Prediction) const {
|
||||
Dups = 0;
|
||||
if (TrueBBI.IsBeingAnalyzed || TrueBBI.IsDone)
|
||||
return false;
|
||||
|
@ -18,24 +18,24 @@
|
||||
|
||||
using namespace llvm;
|
||||
|
||||
BlockFrequency &BlockFrequency::operator*=(const BranchProbability &Prob) {
|
||||
BlockFrequency &BlockFrequency::operator*=(BranchProbability Prob) {
|
||||
Frequency = Prob.scale(Frequency);
|
||||
return *this;
|
||||
}
|
||||
|
||||
const BlockFrequency
|
||||
BlockFrequency::operator*(const BranchProbability &Prob) const {
|
||||
BlockFrequency::operator*(BranchProbability Prob) const {
|
||||
BlockFrequency Freq(Frequency);
|
||||
Freq *= Prob;
|
||||
return Freq;
|
||||
}
|
||||
|
||||
BlockFrequency &BlockFrequency::operator/=(const BranchProbability &Prob) {
|
||||
BlockFrequency &BlockFrequency::operator/=(BranchProbability Prob) {
|
||||
Frequency = Prob.scaleByInverse(Frequency);
|
||||
return *this;
|
||||
}
|
||||
|
||||
BlockFrequency BlockFrequency::operator/(const BranchProbability &Prob) const {
|
||||
BlockFrequency BlockFrequency::operator/(BranchProbability Prob) const {
|
||||
BlockFrequency Freq(Frequency);
|
||||
Freq /= Prob;
|
||||
return Freq;
|
||||
|
@ -922,7 +922,7 @@ bool
|
||||
R600InstrInfo::isProfitableToIfCvt(MachineBasicBlock &MBB,
|
||||
unsigned NumCyles,
|
||||
unsigned ExtraPredCycles,
|
||||
const BranchProbability &Probability) const{
|
||||
BranchProbability Probability) const{
|
||||
return true;
|
||||
}
|
||||
|
||||
@ -933,14 +933,14 @@ R600InstrInfo::isProfitableToIfCvt(MachineBasicBlock &TMBB,
|
||||
MachineBasicBlock &FMBB,
|
||||
unsigned NumFCycles,
|
||||
unsigned ExtraFCycles,
|
||||
const BranchProbability &Probability) const {
|
||||
BranchProbability Probability) const {
|
||||
return true;
|
||||
}
|
||||
|
||||
bool
|
||||
R600InstrInfo::isProfitableToDupForIfCvt(MachineBasicBlock &MBB,
|
||||
unsigned NumCyles,
|
||||
const BranchProbability &Probability)
|
||||
BranchProbability Probability)
|
||||
const {
|
||||
return true;
|
||||
}
|
||||
|
@ -174,18 +174,18 @@ namespace llvm {
|
||||
|
||||
bool
|
||||
isProfitableToDupForIfCvt(MachineBasicBlock &MBB, unsigned NumCyles,
|
||||
const BranchProbability &Probability) const override;
|
||||
BranchProbability Probability) const override;
|
||||
|
||||
bool isProfitableToIfCvt(MachineBasicBlock &MBB, unsigned NumCyles,
|
||||
unsigned ExtraPredCycles,
|
||||
const BranchProbability &Probability) const override ;
|
||||
BranchProbability Probability) const override ;
|
||||
|
||||
bool
|
||||
isProfitableToIfCvt(MachineBasicBlock &TMBB,
|
||||
unsigned NumTCycles, unsigned ExtraTCycles,
|
||||
MachineBasicBlock &FMBB,
|
||||
unsigned NumFCycles, unsigned ExtraFCycles,
|
||||
const BranchProbability &Probability) const override;
|
||||
BranchProbability Probability) const override;
|
||||
|
||||
bool DefinesPredicate(MachineInstr *MI,
|
||||
std::vector<MachineOperand> &Pred) const override;
|
||||
|
@ -1640,7 +1640,7 @@ bool ARMBaseInstrInfo::isSchedulingBoundary(const MachineInstr *MI,
|
||||
bool ARMBaseInstrInfo::
|
||||
isProfitableToIfCvt(MachineBasicBlock &MBB,
|
||||
unsigned NumCycles, unsigned ExtraPredCycles,
|
||||
const BranchProbability &Probability) const {
|
||||
BranchProbability Probability) const {
|
||||
if (!NumCycles)
|
||||
return false;
|
||||
|
||||
@ -1682,7 +1682,7 @@ isProfitableToIfCvt(MachineBasicBlock &TMBB,
|
||||
unsigned TCycles, unsigned TExtra,
|
||||
MachineBasicBlock &FMBB,
|
||||
unsigned FCycles, unsigned FExtra,
|
||||
const BranchProbability &Probability) const {
|
||||
BranchProbability Probability) const {
|
||||
if (!TCycles || !FCycles)
|
||||
return false;
|
||||
|
||||
|
@ -224,15 +224,15 @@ public:
|
||||
|
||||
bool isProfitableToIfCvt(MachineBasicBlock &MBB,
|
||||
unsigned NumCycles, unsigned ExtraPredCycles,
|
||||
const BranchProbability &Probability) const override;
|
||||
BranchProbability Probability) const override;
|
||||
|
||||
bool isProfitableToIfCvt(MachineBasicBlock &TMBB, unsigned NumT,
|
||||
unsigned ExtraT, MachineBasicBlock &FMBB,
|
||||
unsigned NumF, unsigned ExtraF,
|
||||
const BranchProbability &Probability) const override;
|
||||
BranchProbability Probability) const override;
|
||||
|
||||
bool isProfitableToDupForIfCvt(MachineBasicBlock &MBB, unsigned NumCycles,
|
||||
const BranchProbability &Probability) const override {
|
||||
BranchProbability Probability) const override {
|
||||
return NumCycles == 1;
|
||||
}
|
||||
|
||||
|
@ -1063,7 +1063,7 @@ HexagonInstrInfo::
|
||||
isProfitableToIfCvt(MachineBasicBlock &MBB,
|
||||
unsigned NumCycles,
|
||||
unsigned ExtraPredCycles,
|
||||
const BranchProbability &Probability) const {
|
||||
BranchProbability Probability) const {
|
||||
return true;
|
||||
}
|
||||
|
||||
@ -1076,7 +1076,7 @@ isProfitableToIfCvt(MachineBasicBlock &TMBB,
|
||||
MachineBasicBlock &FMBB,
|
||||
unsigned NumFCycles,
|
||||
unsigned ExtraFCycles,
|
||||
const BranchProbability &Probability) const {
|
||||
BranchProbability Probability) const {
|
||||
return true;
|
||||
}
|
||||
|
||||
@ -1185,7 +1185,7 @@ bool HexagonInstrInfo::ReverseBranchCondition(
|
||||
|
||||
bool HexagonInstrInfo::
|
||||
isProfitableToDupForIfCvt(MachineBasicBlock &MBB,unsigned NumInstrs,
|
||||
const BranchProbability &Probability) const {
|
||||
BranchProbability Probability) const {
|
||||
return (NumInstrs <= 4);
|
||||
}
|
||||
|
||||
|
@ -132,13 +132,13 @@ public:
|
||||
|
||||
bool isProfitableToIfCvt(MachineBasicBlock &MBB, unsigned NumCycles,
|
||||
unsigned ExtraPredCycles,
|
||||
const BranchProbability &Probability) const override;
|
||||
BranchProbability Probability) const override;
|
||||
|
||||
bool isProfitableToIfCvt(MachineBasicBlock &TMBB,
|
||||
unsigned NumTCycles, unsigned ExtraTCycles,
|
||||
MachineBasicBlock &FMBB,
|
||||
unsigned NumFCycles, unsigned ExtraFCycles,
|
||||
const BranchProbability &Probability) const override;
|
||||
BranchProbability Probability) const override;
|
||||
|
||||
bool isPredicated(const MachineInstr *MI) const override;
|
||||
bool isPredicated(unsigned Opcode) const;
|
||||
@ -155,7 +155,7 @@ public:
|
||||
ReverseBranchCondition(SmallVectorImpl<MachineOperand> &Cond) const override;
|
||||
|
||||
bool isProfitableToDupForIfCvt(MachineBasicBlock &MBB, unsigned NumCycles,
|
||||
const BranchProbability &Probability) const override;
|
||||
BranchProbability Probability) const override;
|
||||
|
||||
DFAPacketizer *
|
||||
CreateTargetScheduleState(const TargetSubtargetInfo &STI) const override;
|
||||
|
@ -1474,7 +1474,7 @@ bool PPCInstrInfo::isProfitableToIfCvt(MachineBasicBlock &TMBB,
|
||||
unsigned NumT, unsigned ExtraT,
|
||||
MachineBasicBlock &FMBB,
|
||||
unsigned NumF, unsigned ExtraF,
|
||||
const BranchProbability &Probability) const {
|
||||
BranchProbability Probability) const {
|
||||
return !(MBBDefinesCTR(TMBB) && MBBDefinesCTR(FMBB));
|
||||
}
|
||||
|
||||
|
@ -215,7 +215,7 @@ public:
|
||||
// profitable to use the predicated branches.
|
||||
bool isProfitableToIfCvt(MachineBasicBlock &MBB,
|
||||
unsigned NumCycles, unsigned ExtraPredCycles,
|
||||
const BranchProbability &Probability) const override {
|
||||
BranchProbability Probability) const override {
|
||||
return true;
|
||||
}
|
||||
|
||||
@ -223,12 +223,10 @@ public:
|
||||
unsigned NumT, unsigned ExtraT,
|
||||
MachineBasicBlock &FMBB,
|
||||
unsigned NumF, unsigned ExtraF,
|
||||
const BranchProbability &Probability) const override;
|
||||
BranchProbability Probability) const override;
|
||||
|
||||
bool isProfitableToDupForIfCvt(MachineBasicBlock &MBB,
|
||||
unsigned NumCycles,
|
||||
const BranchProbability
|
||||
&Probability) const override {
|
||||
bool isProfitableToDupForIfCvt(MachineBasicBlock &MBB, unsigned NumCycles,
|
||||
BranchProbability Probability) const override {
|
||||
return true;
|
||||
}
|
||||
|
||||
|
@ -514,7 +514,7 @@ bool SystemZInstrInfo::isPredicable(MachineInstr *MI) const {
|
||||
bool SystemZInstrInfo::
|
||||
isProfitableToIfCvt(MachineBasicBlock &MBB,
|
||||
unsigned NumCycles, unsigned ExtraPredCycles,
|
||||
const BranchProbability &Probability) const {
|
||||
BranchProbability Probability) const {
|
||||
// For now only convert single instructions.
|
||||
return NumCycles == 1;
|
||||
}
|
||||
@ -524,7 +524,7 @@ isProfitableToIfCvt(MachineBasicBlock &TMBB,
|
||||
unsigned NumCyclesT, unsigned ExtraPredCyclesT,
|
||||
MachineBasicBlock &FMBB,
|
||||
unsigned NumCyclesF, unsigned ExtraPredCyclesF,
|
||||
const BranchProbability &Probability) const {
|
||||
BranchProbability Probability) const {
|
||||
// For now avoid converting mutually-exclusive cases.
|
||||
return false;
|
||||
}
|
||||
|
@ -159,12 +159,12 @@ public:
|
||||
bool isPredicable(MachineInstr *MI) const override;
|
||||
bool isProfitableToIfCvt(MachineBasicBlock &MBB, unsigned NumCycles,
|
||||
unsigned ExtraPredCycles,
|
||||
const BranchProbability &Probability) const override;
|
||||
BranchProbability Probability) const override;
|
||||
bool isProfitableToIfCvt(MachineBasicBlock &TMBB,
|
||||
unsigned NumCyclesT, unsigned ExtraPredCyclesT,
|
||||
MachineBasicBlock &FMBB,
|
||||
unsigned NumCyclesF, unsigned ExtraPredCyclesF,
|
||||
const BranchProbability &Probability) const override;
|
||||
BranchProbability Probability) const override;
|
||||
bool PredicateInstruction(MachineInstr *MI,
|
||||
ArrayRef<MachineOperand> Pred) const override;
|
||||
void copyPhysReg(MachineBasicBlock &MBB, MachineBasicBlock::iterator MBBI,
|
||||
|
@ -14,7 +14,7 @@
|
||||
using namespace llvm;
|
||||
|
||||
namespace llvm {
|
||||
void PrintTo(const BranchProbability &P, ::std::ostream *os) {
|
||||
void PrintTo(BranchProbability P, ::std::ostream *os) {
|
||||
*os << P.getNumerator() << "/" << P.getDenominator();
|
||||
}
|
||||
}
|
||||
|
Loading…
Reference in New Issue
Block a user