#include "llvm/CodeGen/MachineLoopInfo.h"
#include "llvm/CodeGen/MachineRegisterInfo.h"
#include "llvm/CodeGen/Passes.h"
+#include "llvm/MC/MCInstrItineraries.h"
#include "llvm/Target/TargetInstrInfo.h"
#include "llvm/Target/TargetRegisterInfo.h"
#include "llvm/Support/CommandLine.h"
class EarlyIfConverter : public MachineFunctionPass {
const TargetInstrInfo *TII;
const TargetRegisterInfo *TRI;
+ const MCSchedModel *SchedModel;
MachineRegisterInfo *MRI;
MachineDominatorTree *DomTree;
MachineLoopInfo *Loops;
if (!MinInstr)
MinInstr = Traces->getEnsemble(MachineTraceMetrics::TS_MinInstrCount);
- // MCSchedModel doesn't yet provide a misprediction penalty.
- unsigned MispredictPenalty = 10;
-
// Compare the critical path through TBB and FBB. If the difference is
// greater than the branch misprediction penalty, it would never pay to
// if-convert. The triangle/diamond topology guarantees that these traces
unsigned TBBCrit = TBBTrace.getCriticalPath();
unsigned FBBCrit = FBBTrace.getCriticalPath();
unsigned ExtraCrit = TBBCrit > FBBCrit ? TBBCrit-FBBCrit : FBBCrit-TBBCrit;
- if (ExtraCrit >= MispredictPenalty) {
- DEBUG(dbgs() << "Critical path difference too large.\n");
+ if (ExtraCrit >= SchedModel->MispredictPenalty) {
+ DEBUG(dbgs() << "Critical path difference larger than "
+ << SchedModel->MispredictPenalty << ".\n");
return false;
}
return true;
<< ((Value*)MF.getFunction())->getName() << '\n');
TII = MF.getTarget().getInstrInfo();
TRI = MF.getTarget().getRegisterInfo();
+ SchedModel = MF.getTarget().getInstrItineraryData()->SchedModel;
MRI = &MF.getRegInfo();
DomTree = &getAnalysis<MachineDominatorTree>();
Loops = getAnalysisIfAvailable<MachineLoopInfo>();