19f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen//===- lib/CodeGen/MachineTraceMetrics.cpp ----------------------*- C++ -*-===// 29f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// 39f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// The LLVM Compiler Infrastructure 49f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// 59f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// This file is distributed under the University of Illinois Open Source 69f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// License. See LICENSE.TXT for details. 79f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// 89f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 99f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 105ed625c3cff2511469e9b3c5131c29fd89ddd482Jakob Stoklund Olesen#include "llvm/CodeGen/MachineTraceMetrics.h" 11d04a8d4b33ff316ca4cf961e06c9e312eff8e64fChandler Carruth#include "llvm/ADT/PostOrderIterator.h" 12d04a8d4b33ff316ca4cf961e06c9e312eff8e64fChandler Carruth#include "llvm/ADT/SparseSet.h" 139f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen#include "llvm/CodeGen/MachineBasicBlock.h" 149f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen#include "llvm/CodeGen/MachineBranchProbabilityInfo.h" 159f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen#include "llvm/CodeGen/MachineLoopInfo.h" 169f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen#include "llvm/CodeGen/MachineRegisterInfo.h" 179f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen#include "llvm/CodeGen/Passes.h" 18f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen#include "llvm/MC/MCSubtargetInfo.h" 19d04a8d4b33ff316ca4cf961e06c9e312eff8e64fChandler Carruth#include "llvm/Support/Debug.h" 208396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen#include "llvm/Support/Format.h" 21d04a8d4b33ff316ca4cf961e06c9e312eff8e64fChandler Carruth#include "llvm/Support/raw_ostream.h" 229f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen#include "llvm/Target/TargetInstrInfo.h" 239f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen#include "llvm/Target/TargetRegisterInfo.h" 24f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen#include "llvm/Target/TargetSubtargetInfo.h" 259f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 269f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenusing namespace llvm; 279f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 28dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines#define DEBUG_TYPE "machine-trace-metrics" 29dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 309f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenchar MachineTraceMetrics::ID = 0; 319f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenchar &llvm::MachineTraceMetricsID = MachineTraceMetrics::ID; 329f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 339f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenINITIALIZE_PASS_BEGIN(MachineTraceMetrics, 349f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen "machine-trace-metrics", "Machine Trace Metrics", false, true) 359f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenINITIALIZE_PASS_DEPENDENCY(MachineBranchProbabilityInfo) 369f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenINITIALIZE_PASS_DEPENDENCY(MachineLoopInfo) 379f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenINITIALIZE_PASS_END(MachineTraceMetrics, 389f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen "machine-trace-metrics", "Machine Trace Metrics", false, true) 399f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 409f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMachineTraceMetrics::MachineTraceMetrics() 41dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines : MachineFunctionPass(ID), MF(nullptr), TII(nullptr), TRI(nullptr), 42dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines MRI(nullptr), Loops(nullptr) { 43dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines std::fill(std::begin(Ensembles), std::end(Ensembles), nullptr); 449f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 459f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 469f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenvoid MachineTraceMetrics::getAnalysisUsage(AnalysisUsage &AU) const { 479f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen AU.setPreservesAll(); 489f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen AU.addRequired<MachineBranchProbabilityInfo>(); 499f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen AU.addRequired<MachineLoopInfo>(); 509f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen MachineFunctionPass::getAnalysisUsage(AU); 519f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 529f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 53a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesenbool MachineTraceMetrics::runOnMachineFunction(MachineFunction &Func) { 54a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen MF = &Func; 55ebe69fe11e48d322045d5949c83283927a0d790bStephen Hines const TargetSubtargetInfo &ST = MF->getSubtarget(); 56ebe69fe11e48d322045d5949c83283927a0d790bStephen Hines TII = ST.getInstrInfo(); 57ebe69fe11e48d322045d5949c83283927a0d790bStephen Hines TRI = ST.getRegisterInfo(); 58a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen MRI = &MF->getRegInfo(); 599f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen Loops = &getAnalysis<MachineLoopInfo>(); 6037ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines SchedModel.init(ST.getSchedModel(), &ST, TII); 61a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen BlockInfo.resize(MF->getNumBlockIDs()); 628396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ProcResourceCycles.resize(MF->getNumBlockIDs() * 638396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen SchedModel.getNumProcResourceKinds()); 649f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen return false; 659f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 669f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 679f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenvoid MachineTraceMetrics::releaseMemory() { 68dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines MF = nullptr; 699f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen BlockInfo.clear(); 709f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen for (unsigned i = 0; i != TS_NumStrategies; ++i) { 719f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen delete Ensembles[i]; 72dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines Ensembles[i] = nullptr; 739f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 749f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 759f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 769f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 779f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Fixed block information 789f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 799f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// 809f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// The number of instructions in a basic block and the CPU resources used by 819f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// those instructions don't depend on any given trace strategy. 829f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 839f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen/// Compute the resource usage in basic block MBB. 849f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenconst MachineTraceMetrics::FixedBlockInfo* 859f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMachineTraceMetrics::getResources(const MachineBasicBlock *MBB) { 869f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen assert(MBB && "No basic block"); 879f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen FixedBlockInfo *FBI = &BlockInfo[MBB->getNumber()]; 889f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (FBI->hasResources()) 899f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen return FBI; 909f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 919f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Compute resource usage in the block. 929f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen FBI->HasCalls = false; 939f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen unsigned InstrCount = 0; 948396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 958396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen // Add up per-processor resource cycles as well. 968396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PRKinds = SchedModel.getNumProcResourceKinds(); 978396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen SmallVector<unsigned, 32> PRCycles(PRKinds); 988396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 99dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines for (const auto &MI : *MBB) { 100dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (MI.isTransient()) 1019f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen continue; 1029f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen ++InstrCount; 103dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (MI.isCall()) 1049f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen FBI->HasCalls = true; 1058396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 1068396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen // Count processor resources used. 1072ccdbc6675fd5bafb6da65dfca850b6e2587f9f3Jakob Stoklund Olesen if (!SchedModel.hasInstrSchedModel()) 1082ccdbc6675fd5bafb6da65dfca850b6e2587f9f3Jakob Stoklund Olesen continue; 109dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines const MCSchedClassDesc *SC = SchedModel.resolveSchedClass(&MI); 1108396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen if (!SC->isValid()) 1118396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen continue; 1128396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 1138396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen for (TargetSchedModel::ProcResIter 1148396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen PI = SchedModel.getWriteProcResBegin(SC), 1158396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen PE = SchedModel.getWriteProcResEnd(SC); PI != PE; ++PI) { 1168396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen assert(PI->ProcResourceIdx < PRKinds && "Bad processor resource kind"); 1178396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen PRCycles[PI->ProcResourceIdx] += PI->Cycles; 1188396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen } 1199f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 1209f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen FBI->InstrCount = InstrCount; 1218396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 1228396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen // Scale the resource cycles so they are comparable. 1238396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PROffset = MBB->getNumber() * PRKinds; 1248396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen for (unsigned K = 0; K != PRKinds; ++K) 1258396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ProcResourceCycles[PROffset + K] = 1268396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen PRCycles[K] * SchedModel.getResourceFactor(K); 1278396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 1289f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen return FBI; 1299f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 1309f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 1318396e130427999c57422e52af3913eb8182847e5Jakob Stoklund OlesenArrayRef<unsigned> 1328396e130427999c57422e52af3913eb8182847e5Jakob Stoklund OlesenMachineTraceMetrics::getProcResourceCycles(unsigned MBBNum) const { 1338396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen assert(BlockInfo[MBBNum].hasResources() && 1348396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen "getResources() must be called before getProcResourceCycles()"); 1358396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PRKinds = SchedModel.getNumProcResourceKinds(); 1362ccdbc6675fd5bafb6da65dfca850b6e2587f9f3Jakob Stoklund Olesen assert((MBBNum+1) * PRKinds <= ProcResourceCycles.size()); 13737ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines return makeArrayRef(ProcResourceCycles.data() + MBBNum * PRKinds, PRKinds); 1388396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen} 1398396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 1408396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 1419f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 1429f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Ensemble utility functions 1439f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 1449f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 1459f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMachineTraceMetrics::Ensemble::Ensemble(MachineTraceMetrics *ct) 14664e2973bf78970aedecbb5fda44e19f93f56dd9bJakob Stoklund Olesen : MTM(*ct) { 14764e2973bf78970aedecbb5fda44e19f93f56dd9bJakob Stoklund Olesen BlockInfo.resize(MTM.BlockInfo.size()); 1488396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PRKinds = MTM.SchedModel.getNumProcResourceKinds(); 1498396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ProcResourceDepths.resize(MTM.BlockInfo.size() * PRKinds); 1508396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ProcResourceHeights.resize(MTM.BlockInfo.size() * PRKinds); 1519f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 1529f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 1539f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Virtual destructor serves as an anchor. 1549f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMachineTraceMetrics::Ensemble::~Ensemble() {} 1559f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 156a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesenconst MachineLoop* 157a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund OlesenMachineTraceMetrics::Ensemble::getLoopFor(const MachineBasicBlock *MBB) const { 15864e2973bf78970aedecbb5fda44e19f93f56dd9bJakob Stoklund Olesen return MTM.Loops->getLoopFor(MBB); 1599f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 1609f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 1619f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Update resource-related information in the TraceBlockInfo for MBB. 1629f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Only update resources related to the trace above MBB. 1639f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenvoid MachineTraceMetrics::Ensemble:: 1649f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesencomputeDepthResources(const MachineBasicBlock *MBB) { 1659f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen TraceBlockInfo *TBI = &BlockInfo[MBB->getNumber()]; 1668396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PRKinds = MTM.SchedModel.getNumProcResourceKinds(); 1678396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PROffset = MBB->getNumber() * PRKinds; 1689f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 1699f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Compute resources from trace above. The top block is simple. 1709f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (!TBI->Pred) { 1719f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen TBI->InstrDepth = 0; 1720271a5fa29f73150fad891ca4c43a0a89a64b3bfJakob Stoklund Olesen TBI->Head = MBB->getNumber(); 1738396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen std::fill(ProcResourceDepths.begin() + PROffset, 1748396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ProcResourceDepths.begin() + PROffset + PRKinds, 0); 1759f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen return; 1769f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 1779f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 1789f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Compute from the block above. A post-order traversal ensures the 1799f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // predecessor is always computed first. 1808396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PredNum = TBI->Pred->getNumber(); 1818396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen TraceBlockInfo *PredTBI = &BlockInfo[PredNum]; 1829f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen assert(PredTBI->hasValidDepth() && "Trace above has not been computed yet"); 18364e2973bf78970aedecbb5fda44e19f93f56dd9bJakob Stoklund Olesen const FixedBlockInfo *PredFBI = MTM.getResources(TBI->Pred); 1849f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen TBI->InstrDepth = PredTBI->InstrDepth + PredFBI->InstrCount; 1850271a5fa29f73150fad891ca4c43a0a89a64b3bfJakob Stoklund Olesen TBI->Head = PredTBI->Head; 1868396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 1878396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen // Compute per-resource depths. 1888396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ArrayRef<unsigned> PredPRDepths = getProcResourceDepths(PredNum); 1898396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ArrayRef<unsigned> PredPRCycles = MTM.getProcResourceCycles(PredNum); 1908396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen for (unsigned K = 0; K != PRKinds; ++K) 1918396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ProcResourceDepths[PROffset + K] = PredPRDepths[K] + PredPRCycles[K]; 1929f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 1939f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 1949f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Update resource-related information in the TraceBlockInfo for MBB. 1959f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Only update resources related to the trace below MBB. 1969f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenvoid MachineTraceMetrics::Ensemble:: 1979f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesencomputeHeightResources(const MachineBasicBlock *MBB) { 1989f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen TraceBlockInfo *TBI = &BlockInfo[MBB->getNumber()]; 1998396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PRKinds = MTM.SchedModel.getNumProcResourceKinds(); 2008396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PROffset = MBB->getNumber() * PRKinds; 2019f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 2029f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Compute resources for the current block. 20364e2973bf78970aedecbb5fda44e19f93f56dd9bJakob Stoklund Olesen TBI->InstrHeight = MTM.getResources(MBB)->InstrCount; 2048396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ArrayRef<unsigned> PRCycles = MTM.getProcResourceCycles(MBB->getNumber()); 2059f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 2069f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // The trace tail is done. 2070271a5fa29f73150fad891ca4c43a0a89a64b3bfJakob Stoklund Olesen if (!TBI->Succ) { 2080271a5fa29f73150fad891ca4c43a0a89a64b3bfJakob Stoklund Olesen TBI->Tail = MBB->getNumber(); 2098396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen std::copy(PRCycles.begin(), PRCycles.end(), 2108396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ProcResourceHeights.begin() + PROffset); 2119f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen return; 2120271a5fa29f73150fad891ca4c43a0a89a64b3bfJakob Stoklund Olesen } 2139f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 2149f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Compute from the block below. A post-order traversal ensures the 2159f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // predecessor is always computed first. 2168396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned SuccNum = TBI->Succ->getNumber(); 2178396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen TraceBlockInfo *SuccTBI = &BlockInfo[SuccNum]; 2189f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen assert(SuccTBI->hasValidHeight() && "Trace below has not been computed yet"); 2199f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen TBI->InstrHeight += SuccTBI->InstrHeight; 2200271a5fa29f73150fad891ca4c43a0a89a64b3bfJakob Stoklund Olesen TBI->Tail = SuccTBI->Tail; 2218396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 2228396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen // Compute per-resource heights. 2238396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ArrayRef<unsigned> SuccPRHeights = getProcResourceHeights(SuccNum); 2248396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen for (unsigned K = 0; K != PRKinds; ++K) 2258396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ProcResourceHeights[PROffset + K] = SuccPRHeights[K] + PRCycles[K]; 2269f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 2279f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 2289f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Check if depth resources for MBB are valid and return the TBI. 2299f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Return NULL if the resources have been invalidated. 2309f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenconst MachineTraceMetrics::TraceBlockInfo* 2319f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMachineTraceMetrics::Ensemble:: 2329f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesengetDepthResources(const MachineBasicBlock *MBB) const { 2339f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen const TraceBlockInfo *TBI = &BlockInfo[MBB->getNumber()]; 234dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return TBI->hasValidDepth() ? TBI : nullptr; 2359f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 2369f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 2379f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Check if height resources for MBB are valid and return the TBI. 2389f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Return NULL if the resources have been invalidated. 2399f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenconst MachineTraceMetrics::TraceBlockInfo* 2409f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMachineTraceMetrics::Ensemble:: 2419f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesengetHeightResources(const MachineBasicBlock *MBB) const { 2429f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen const TraceBlockInfo *TBI = &BlockInfo[MBB->getNumber()]; 243dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return TBI->hasValidHeight() ? TBI : nullptr; 2449f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 2459f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 2468396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen/// Get an array of processor resource depths for MBB. Indexed by processor 2478396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen/// resource kind, this array contains the scaled processor resources consumed 2488396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen/// by all blocks preceding MBB in its trace. It does not include instructions 2498396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen/// in MBB. 2508396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen/// 2518396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen/// Compare TraceBlockInfo::InstrDepth. 2528396e130427999c57422e52af3913eb8182847e5Jakob Stoklund OlesenArrayRef<unsigned> 2538396e130427999c57422e52af3913eb8182847e5Jakob Stoklund OlesenMachineTraceMetrics::Ensemble:: 2548396e130427999c57422e52af3913eb8182847e5Jakob Stoklund OlesengetProcResourceDepths(unsigned MBBNum) const { 2558396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PRKinds = MTM.SchedModel.getNumProcResourceKinds(); 2562ccdbc6675fd5bafb6da65dfca850b6e2587f9f3Jakob Stoklund Olesen assert((MBBNum+1) * PRKinds <= ProcResourceDepths.size()); 25737ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines return makeArrayRef(ProcResourceDepths.data() + MBBNum * PRKinds, PRKinds); 2588396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen} 2598396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 2608396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen/// Get an array of processor resource heights for MBB. Indexed by processor 2618396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen/// resource kind, this array contains the scaled processor resources consumed 2628396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen/// by this block and all blocks following it in its trace. 2638396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen/// 2648396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen/// Compare TraceBlockInfo::InstrHeight. 2658396e130427999c57422e52af3913eb8182847e5Jakob Stoklund OlesenArrayRef<unsigned> 2668396e130427999c57422e52af3913eb8182847e5Jakob Stoklund OlesenMachineTraceMetrics::Ensemble:: 2678396e130427999c57422e52af3913eb8182847e5Jakob Stoklund OlesengetProcResourceHeights(unsigned MBBNum) const { 2688396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PRKinds = MTM.SchedModel.getNumProcResourceKinds(); 2692ccdbc6675fd5bafb6da65dfca850b6e2587f9f3Jakob Stoklund Olesen assert((MBBNum+1) * PRKinds <= ProcResourceHeights.size()); 27037ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines return makeArrayRef(ProcResourceHeights.data() + MBBNum * PRKinds, PRKinds); 2718396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen} 2728396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 2739f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 2749f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Trace Selection Strategies 2759f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 2769f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// 2779f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// A trace selection strategy is implemented as a sub-class of Ensemble. The 2789f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// trace through a block B is computed by two DFS traversals of the CFG 2799f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// starting from B. One upwards, and one downwards. During the upwards DFS, 2809f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// pickTracePred() is called on the post-ordered blocks. During the downwards 2819f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// DFS, pickTraceSucc() is called in a post-order. 2829f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// 2839f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 2841c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen// We never allow traces that leave loops, but we do allow traces to enter 2851c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen// nested loops. We also never allow traces to contain back-edges. 2861c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen// 2871c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen// This means that a loop header can never appear above the center block of a 2881c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen// trace, except as the trace head. Below the center block, loop exiting edges 2891c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen// are banned. 2901c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen// 2911c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen// Return true if an edge from the From loop to the To loop is leaving a loop. 2921c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen// Either of To and From can be null. 2931c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesenstatic bool isExitingLoop(const MachineLoop *From, const MachineLoop *To) { 2941c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen return From && !From->contains(To); 2951c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen} 2961c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen 2979f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// MinInstrCountEnsemble - Pick the trace that executes the least number of 2989f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// instructions. 2999f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesennamespace { 3009f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenclass MinInstrCountEnsemble : public MachineTraceMetrics::Ensemble { 30136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines const char *getName() const override { return "MinInstr"; } 30236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines const MachineBasicBlock *pickTracePred(const MachineBasicBlock*) override; 30336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines const MachineBasicBlock *pickTraceSucc(const MachineBasicBlock*) override; 3049f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 3059f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenpublic: 30664e2973bf78970aedecbb5fda44e19f93f56dd9bJakob Stoklund Olesen MinInstrCountEnsemble(MachineTraceMetrics *mtm) 30764e2973bf78970aedecbb5fda44e19f93f56dd9bJakob Stoklund Olesen : MachineTraceMetrics::Ensemble(mtm) {} 3089f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen}; 3099f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 3109f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 3119f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Select the preferred predecessor for MBB. 3129f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenconst MachineBasicBlock* 3139f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMinInstrCountEnsemble::pickTracePred(const MachineBasicBlock *MBB) { 3149f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (MBB->pred_empty()) 315dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return nullptr; 316a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen const MachineLoop *CurLoop = getLoopFor(MBB); 3179f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Don't leave loops, and never follow back-edges. 3189f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (CurLoop && MBB == CurLoop->getHeader()) 319dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return nullptr; 32064e2973bf78970aedecbb5fda44e19f93f56dd9bJakob Stoklund Olesen unsigned CurCount = MTM.getResources(MBB)->InstrCount; 321dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines const MachineBasicBlock *Best = nullptr; 3229f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen unsigned BestDepth = 0; 3239f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen for (MachineBasicBlock::const_pred_iterator 3249f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen I = MBB->pred_begin(), E = MBB->pred_end(); I != E; ++I) { 3259f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen const MachineBasicBlock *Pred = *I; 3268e54ab5c7618bf3813c337ad181a741f30eb36ccJakob Stoklund Olesen const MachineTraceMetrics::TraceBlockInfo *PredTBI = 3278e54ab5c7618bf3813c337ad181a741f30eb36ccJakob Stoklund Olesen getDepthResources(Pred); 328e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen // Ignore cycles that aren't natural loops. 329e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen if (!PredTBI) 330e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen continue; 3319f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Pick the predecessor that would give this block the smallest InstrDepth. 3329f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen unsigned Depth = PredTBI->InstrDepth + CurCount; 3339f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (!Best || Depth < BestDepth) 3349f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen Best = Pred, BestDepth = Depth; 3359f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 3369f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen return Best; 3379f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 3389f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 3399f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Select the preferred successor for MBB. 3409f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenconst MachineBasicBlock* 3419f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMinInstrCountEnsemble::pickTraceSucc(const MachineBasicBlock *MBB) { 3429f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (MBB->pred_empty()) 343dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return nullptr; 344a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen const MachineLoop *CurLoop = getLoopFor(MBB); 345dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines const MachineBasicBlock *Best = nullptr; 3469f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen unsigned BestHeight = 0; 3479f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen for (MachineBasicBlock::const_succ_iterator 3489f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen I = MBB->succ_begin(), E = MBB->succ_end(); I != E; ++I) { 3499f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen const MachineBasicBlock *Succ = *I; 3509f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Don't consider back-edges. 3519f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (CurLoop && Succ == CurLoop->getHeader()) 3529f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen continue; 3531c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen // Don't consider successors exiting CurLoop. 3541c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen if (isExitingLoop(CurLoop, getLoopFor(Succ))) 3559f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen continue; 3568e54ab5c7618bf3813c337ad181a741f30eb36ccJakob Stoklund Olesen const MachineTraceMetrics::TraceBlockInfo *SuccTBI = 3578e54ab5c7618bf3813c337ad181a741f30eb36ccJakob Stoklund Olesen getHeightResources(Succ); 358e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen // Ignore cycles that aren't natural loops. 359e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen if (!SuccTBI) 360e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen continue; 3619f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Pick the successor that would give this block the smallest InstrHeight. 3629f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen unsigned Height = SuccTBI->InstrHeight; 3639f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (!Best || Height < BestHeight) 3649f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen Best = Succ, BestHeight = Height; 3659f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 3669f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen return Best; 3679f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 3689f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 3699f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Get an Ensemble sub-class for the requested trace strategy. 3709f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMachineTraceMetrics::Ensemble * 3719f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMachineTraceMetrics::getEnsemble(MachineTraceMetrics::Strategy strategy) { 3729f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen assert(strategy < TS_NumStrategies && "Invalid trace strategy enum"); 3739f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen Ensemble *&E = Ensembles[strategy]; 3749f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (E) 3759f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen return E; 3769f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 3779f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Allocate new Ensemble on demand. 3789f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen switch (strategy) { 3799f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen case TS_MinInstrCount: return (E = new MinInstrCountEnsemble(this)); 3809f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen default: llvm_unreachable("Invalid trace strategy enum"); 3819f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 3829f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 3839f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 3849f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenvoid MachineTraceMetrics::invalidate(const MachineBasicBlock *MBB) { 3859f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen DEBUG(dbgs() << "Invalidate traces through BB#" << MBB->getNumber() << '\n'); 3869f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen BlockInfo[MBB->getNumber()].invalidate(); 3879f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen for (unsigned i = 0; i != TS_NumStrategies; ++i) 3889f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (Ensembles[i]) 3899f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen Ensembles[i]->invalidate(MBB); 3909f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 3919f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 392ef6c76c984f821ea866902a7f9e695b16e971468Jakob Stoklund Olesenvoid MachineTraceMetrics::verifyAnalysis() const { 3932f6b62b09f07d63b7f3ee2de50735dd8c83c0f0fJakob Stoklund Olesen if (!MF) 3942f6b62b09f07d63b7f3ee2de50735dd8c83c0f0fJakob Stoklund Olesen return; 395a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen#ifndef NDEBUG 396a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen assert(BlockInfo.size() == MF->getNumBlockIDs() && "Outdated BlockInfo size"); 397a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen for (unsigned i = 0; i != TS_NumStrategies; ++i) 398a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen if (Ensembles[i]) 399a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen Ensembles[i]->verify(); 400a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen#endif 401a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen} 402a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen 4039f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 4049f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Trace building 4059f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 4069f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// 4079f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Traces are built by two CFG traversals. To avoid recomputing too much, use a 4089f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// set abstraction that confines the search to the current loop, and doesn't 4099f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// revisit blocks. 4109f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 4119f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesennamespace { 4129f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenstruct LoopBounds { 4139f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen MutableArrayRef<MachineTraceMetrics::TraceBlockInfo> Blocks; 414e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen SmallPtrSet<const MachineBasicBlock*, 8> Visited; 4159f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen const MachineLoopInfo *Loops; 4169f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen bool Downward; 4179f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen LoopBounds(MutableArrayRef<MachineTraceMetrics::TraceBlockInfo> blocks, 4181c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen const MachineLoopInfo *loops) 4191c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen : Blocks(blocks), Loops(loops), Downward(false) {} 4209f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen}; 4219f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 4229f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 4239f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// Specialize po_iterator_storage in order to prune the post-order traversal so 4249f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen// it is limited to the current loop and doesn't traverse the loop back edges. 4259f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesennamespace llvm { 4269f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesentemplate<> 4279f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenclass po_iterator_storage<LoopBounds, true> { 4289f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen LoopBounds &LB; 4299f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenpublic: 4309f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen po_iterator_storage(LoopBounds &lb) : LB(lb) {} 4319f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen void finishPostorder(const MachineBasicBlock*) {} 4329f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 4339f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen bool insertEdge(const MachineBasicBlock *From, const MachineBasicBlock *To) { 4349f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Skip already visited To blocks. 4359f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen MachineTraceMetrics::TraceBlockInfo &TBI = LB.Blocks[To->getNumber()]; 4369f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (LB.Downward ? TBI.hasValidHeight() : TBI.hasValidDepth()) 4379f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen return false; 4381c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen // From is null once when To is the trace center block. 439e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen if (From) { 440e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen if (const MachineLoop *FromLoop = LB.Loops->getLoopFor(From)) { 441e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen // Don't follow backedges, don't leave FromLoop when going upwards. 442e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen if ((LB.Downward ? To : From) == FromLoop->getHeader()) 443e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen return false; 444e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen // Don't leave FromLoop. 445e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen if (isExitingLoop(FromLoop, LB.Loops->getLoopFor(To))) 446e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen return false; 447e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen } 448e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen } 449e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen // To is a new block. Mark the block as visited in case the CFG has cycles 450e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen // that MachineLoopInfo didn't recognize as a natural loop. 45137ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines return LB.Visited.insert(To).second; 4529f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 4539f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen}; 4549f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 4559f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 4569f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen/// Compute the trace through MBB. 4579f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenvoid MachineTraceMetrics::Ensemble::computeTrace(const MachineBasicBlock *MBB) { 4589f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen DEBUG(dbgs() << "Computing " << getName() << " trace through BB#" 4599f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen << MBB->getNumber() << '\n'); 4609f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Set up loop bounds for the backwards post-order traversal. 46164e2973bf78970aedecbb5fda44e19f93f56dd9bJakob Stoklund Olesen LoopBounds Bounds(BlockInfo, MTM.Loops); 4629f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 4639f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Run an upwards post-order search for the trace start. 4649f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen Bounds.Downward = false; 465e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen Bounds.Visited.clear(); 4662c3e0051c31c3f5b2328b447eadf1cf9c4427442Pirama Arumuga Nainar for (auto I : inverse_post_order_ext(MBB, Bounds)) { 4679f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen DEBUG(dbgs() << " pred for BB#" << I->getNumber() << ": "); 4689f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen TraceBlockInfo &TBI = BlockInfo[I->getNumber()]; 4699f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // All the predecessors have been visited, pick the preferred one. 4702c3e0051c31c3f5b2328b447eadf1cf9c4427442Pirama Arumuga Nainar TBI.Pred = pickTracePred(I); 4719f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen DEBUG({ 4729f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (TBI.Pred) 4739f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen dbgs() << "BB#" << TBI.Pred->getNumber() << '\n'; 4749f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen else 4759f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen dbgs() << "null\n"; 4769f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen }); 4779f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // The trace leading to I is now known, compute the depth resources. 4782c3e0051c31c3f5b2328b447eadf1cf9c4427442Pirama Arumuga Nainar computeDepthResources(I); 4799f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 4809f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 4819f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Run a downwards post-order search for the trace end. 4829f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen Bounds.Downward = true; 483e723007ee6911c77bedaa2e914961e86b0b4ce61Jakob Stoklund Olesen Bounds.Visited.clear(); 4842c3e0051c31c3f5b2328b447eadf1cf9c4427442Pirama Arumuga Nainar for (auto I : post_order_ext(MBB, Bounds)) { 4859f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen DEBUG(dbgs() << " succ for BB#" << I->getNumber() << ": "); 4869f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen TraceBlockInfo &TBI = BlockInfo[I->getNumber()]; 4879f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // All the successors have been visited, pick the preferred one. 4882c3e0051c31c3f5b2328b447eadf1cf9c4427442Pirama Arumuga Nainar TBI.Succ = pickTraceSucc(I); 4899f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen DEBUG({ 4901c899cf47c13a107cf0f85ae69fcd36c92b37f14Jakob Stoklund Olesen if (TBI.Succ) 4919f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen dbgs() << "BB#" << TBI.Succ->getNumber() << '\n'; 4929f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen else 4939f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen dbgs() << "null\n"; 4949f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen }); 4959f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // The trace leaving I is now known, compute the height resources. 4962c3e0051c31c3f5b2328b447eadf1cf9c4427442Pirama Arumuga Nainar computeHeightResources(I); 4979f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 4989f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 4999f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 5009f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen/// Invalidate traces through BadMBB. 5019f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenvoid 5029f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMachineTraceMetrics::Ensemble::invalidate(const MachineBasicBlock *BadMBB) { 5039f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen SmallVector<const MachineBasicBlock*, 16> WorkList; 5049f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen TraceBlockInfo &BadTBI = BlockInfo[BadMBB->getNumber()]; 5059f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 5069f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Invalidate height resources of blocks above MBB. 5079f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (BadTBI.hasValidHeight()) { 5089f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen BadTBI.invalidateHeight(); 5099f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen WorkList.push_back(BadMBB); 5109f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen do { 5119f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen const MachineBasicBlock *MBB = WorkList.pop_back_val(); 5129f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen DEBUG(dbgs() << "Invalidate BB#" << MBB->getNumber() << ' ' << getName() 5139f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen << " height.\n"); 5149f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Find any MBB predecessors that have MBB as their preferred successor. 5159f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // They are the only ones that need to be invalidated. 5169f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen for (MachineBasicBlock::const_pred_iterator 5179f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen I = MBB->pred_begin(), E = MBB->pred_end(); I != E; ++I) { 5189f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen TraceBlockInfo &TBI = BlockInfo[(*I)->getNumber()]; 519ee31ae12e8a7b843e97285b321cb1f485cd77248Jakob Stoklund Olesen if (!TBI.hasValidHeight()) 520ee31ae12e8a7b843e97285b321cb1f485cd77248Jakob Stoklund Olesen continue; 521ee31ae12e8a7b843e97285b321cb1f485cd77248Jakob Stoklund Olesen if (TBI.Succ == MBB) { 5229f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen TBI.invalidateHeight(); 5239f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen WorkList.push_back(*I); 524ee31ae12e8a7b843e97285b321cb1f485cd77248Jakob Stoklund Olesen continue; 5259f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 526ee31ae12e8a7b843e97285b321cb1f485cd77248Jakob Stoklund Olesen // Verify that TBI.Succ is actually a *I successor. 527ee31ae12e8a7b843e97285b321cb1f485cd77248Jakob Stoklund Olesen assert((!TBI.Succ || (*I)->isSuccessor(TBI.Succ)) && "CFG changed"); 5289f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 5299f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } while (!WorkList.empty()); 5309f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 5319f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 5329f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Invalidate depth resources of blocks below MBB. 5339f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (BadTBI.hasValidDepth()) { 5349f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen BadTBI.invalidateDepth(); 5359f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen WorkList.push_back(BadMBB); 5369f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen do { 5379f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen const MachineBasicBlock *MBB = WorkList.pop_back_val(); 5389f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen DEBUG(dbgs() << "Invalidate BB#" << MBB->getNumber() << ' ' << getName() 5399f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen << " depth.\n"); 5409f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // Find any MBB successors that have MBB as their preferred predecessor. 5419f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // They are the only ones that need to be invalidated. 5429f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen for (MachineBasicBlock::const_succ_iterator 5439f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen I = MBB->succ_begin(), E = MBB->succ_end(); I != E; ++I) { 5449f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen TraceBlockInfo &TBI = BlockInfo[(*I)->getNumber()]; 545ee31ae12e8a7b843e97285b321cb1f485cd77248Jakob Stoklund Olesen if (!TBI.hasValidDepth()) 546ee31ae12e8a7b843e97285b321cb1f485cd77248Jakob Stoklund Olesen continue; 547ee31ae12e8a7b843e97285b321cb1f485cd77248Jakob Stoklund Olesen if (TBI.Pred == MBB) { 5489f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen TBI.invalidateDepth(); 5499f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen WorkList.push_back(*I); 550ee31ae12e8a7b843e97285b321cb1f485cd77248Jakob Stoklund Olesen continue; 5519f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 552ee31ae12e8a7b843e97285b321cb1f485cd77248Jakob Stoklund Olesen // Verify that TBI.Pred is actually a *I predecessor. 553ee31ae12e8a7b843e97285b321cb1f485cd77248Jakob Stoklund Olesen assert((!TBI.Pred || (*I)->isPredecessor(TBI.Pred)) && "CFG changed"); 5549f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 5559f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } while (!WorkList.empty()); 5569f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 5575f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 5585f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // Clear any per-instruction data. We only have to do this for BadMBB itself 5595f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // because the instructions in that block may change. Other blocks may be 5605f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // invalidated, but their instructions will stay the same, so there is no 5615f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // need to erase the Cycle entries. They will be overwritten when we 5625f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // recompute. 563dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines for (const auto &I : *BadMBB) 564dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines Cycles.erase(&I); 5659f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 5669f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 567a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesenvoid MachineTraceMetrics::Ensemble::verify() const { 568a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen#ifndef NDEBUG 56964e2973bf78970aedecbb5fda44e19f93f56dd9bJakob Stoklund Olesen assert(BlockInfo.size() == MTM.MF->getNumBlockIDs() && 570a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen "Outdated BlockInfo size"); 571a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen for (unsigned Num = 0, e = BlockInfo.size(); Num != e; ++Num) { 572a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen const TraceBlockInfo &TBI = BlockInfo[Num]; 573a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen if (TBI.hasValidDepth() && TBI.Pred) { 57464e2973bf78970aedecbb5fda44e19f93f56dd9bJakob Stoklund Olesen const MachineBasicBlock *MBB = MTM.MF->getBlockNumbered(Num); 575a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen assert(MBB->isPredecessor(TBI.Pred) && "CFG doesn't match trace"); 576a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen assert(BlockInfo[TBI.Pred->getNumber()].hasValidDepth() && 577a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen "Trace is broken, depth should have been invalidated."); 578a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen const MachineLoop *Loop = getLoopFor(MBB); 579a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen assert(!(Loop && MBB == Loop->getHeader()) && "Trace contains backedge"); 580a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen } 581a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen if (TBI.hasValidHeight() && TBI.Succ) { 58264e2973bf78970aedecbb5fda44e19f93f56dd9bJakob Stoklund Olesen const MachineBasicBlock *MBB = MTM.MF->getBlockNumbered(Num); 583a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen assert(MBB->isSuccessor(TBI.Succ) && "CFG doesn't match trace"); 584a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen assert(BlockInfo[TBI.Succ->getNumber()].hasValidHeight() && 585a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen "Trace is broken, height should have been invalidated."); 586a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen const MachineLoop *Loop = getLoopFor(MBB); 587a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen const MachineLoop *SuccLoop = getLoopFor(TBI.Succ); 588a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen assert(!(Loop && Loop == SuccLoop && TBI.Succ == Loop->getHeader()) && 589a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen "Trace contains backedge"); 590a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen } 591a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen } 592a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen#endif 593a1b2bf79796d8c44b1321a69a7236b85c33ef7caJakob Stoklund Olesen} 5949f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 5955f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 5965f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// Data Dependencies 5975f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 5985f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// 5995f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// Compute the depth and height of each instruction based on data dependencies 6005f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// and instruction latencies. These cycle numbers assume that the CPU can issue 6015f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// an infinite number of instructions per cycle as long as their dependencies 6025f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// are ready. 6035f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 6045f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// A data dependency is represented as a defining MI and operand numbers on the 6055f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// defining and using MI. 6065f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesennamespace { 6075f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesenstruct DataDep { 6085f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen const MachineInstr *DefMI; 6095f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen unsigned DefOp; 6105f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen unsigned UseOp; 6119dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen 6129dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen DataDep(const MachineInstr *DefMI, unsigned DefOp, unsigned UseOp) 6139dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen : DefMI(DefMI), DefOp(DefOp), UseOp(UseOp) {} 6149dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen 6159dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen /// Create a DataDep from an SSA form virtual register. 6169dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen DataDep(const MachineRegisterInfo *MRI, unsigned VirtReg, unsigned UseOp) 6179dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen : UseOp(UseOp) { 6189dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen assert(TargetRegisterInfo::isVirtualRegister(VirtReg)); 6199dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen MachineRegisterInfo::def_iterator DefI = MRI->def_begin(VirtReg); 6209dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen assert(!DefI.atEnd() && "Register has no defs"); 62136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines DefMI = DefI->getParent(); 6229dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen DefOp = DefI.getOperandNo(); 6239dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen assert((++DefI).atEnd() && "Register has multiple defs"); 6249dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen } 6255f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen}; 6265f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen} 6275f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 6285f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// Get the input data dependencies that must be ready before UseMI can issue. 6295f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// Return true if UseMI has any physreg operands. 6305f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesenstatic bool getDataDeps(const MachineInstr *UseMI, 6315f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen SmallVectorImpl<DataDep> &Deps, 6325f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen const MachineRegisterInfo *MRI) { 6335f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen bool HasPhysRegs = false; 6345f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen for (ConstMIOperands MO(UseMI); MO.isValid(); ++MO) { 6355f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (!MO->isReg()) 6365f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen continue; 6375f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen unsigned Reg = MO->getReg(); 6385f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (!Reg) 6395f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen continue; 6405f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (TargetRegisterInfo::isPhysicalRegister(Reg)) { 6415f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen HasPhysRegs = true; 6425f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen continue; 6435f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } 6445f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // Collect virtual register reads. 6459dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen if (MO->readsReg()) 6469dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen Deps.push_back(DataDep(MRI, Reg, MO.getOperandNo())); 6475f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } 6485f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen return HasPhysRegs; 6495f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen} 6505f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 6515f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// Get the input data dependencies of a PHI instruction, using Pred as the 6525f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// preferred predecessor. 6535f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// This will add at most one dependency to Deps. 6545f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesenstatic void getPHIDeps(const MachineInstr *UseMI, 6555f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen SmallVectorImpl<DataDep> &Deps, 6565f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen const MachineBasicBlock *Pred, 6575f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen const MachineRegisterInfo *MRI) { 6585f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // No predecessor at the beginning of a trace. Ignore dependencies. 6595f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (!Pred) 6605f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen return; 6615f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen assert(UseMI->isPHI() && UseMI->getNumOperands() % 2 && "Bad PHI"); 6625f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen for (unsigned i = 1; i != UseMI->getNumOperands(); i += 2) { 6635f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (UseMI->getOperand(i + 1).getMBB() == Pred) { 6645f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen unsigned Reg = UseMI->getOperand(i).getReg(); 6659dae457e2b9a9919c3f7d48b229035d2b956a2d4Jakob Stoklund Olesen Deps.push_back(DataDep(MRI, Reg, i)); 6665f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen return; 6675f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } 6685f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } 6695f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen} 6705f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 6715f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// Keep track of physreg data dependencies by recording each live register unit. 672c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen// Associate each regunit with an instruction operand. Depending on the 673c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen// direction instructions are scanned, it could be the operand that defined the 674c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen// regunit, or the highest operand to read the regunit. 6755f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesennamespace { 6765f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesenstruct LiveRegUnit { 6775f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen unsigned RegUnit; 678c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen unsigned Cycle; 679c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen const MachineInstr *MI; 680c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen unsigned Op; 6815f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 6825f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen unsigned getSparseSetIndex() const { return RegUnit; } 6835f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 684dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines LiveRegUnit(unsigned RU) : RegUnit(RU), Cycle(0), MI(nullptr), Op(0) {} 6855f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen}; 6865f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen} 6875f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 6885f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// Identify physreg dependencies for UseMI, and update the live regunit 6895f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen// tracking set when scanning instructions downwards. 6905f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesenstatic void updatePhysDepsDownwards(const MachineInstr *UseMI, 6915f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen SmallVectorImpl<DataDep> &Deps, 6925f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen SparseSet<LiveRegUnit> &RegUnits, 6935f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen const TargetRegisterInfo *TRI) { 6945f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen SmallVector<unsigned, 8> Kills; 6955f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen SmallVector<unsigned, 8> LiveDefOps; 6965f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 6975f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen for (ConstMIOperands MO(UseMI); MO.isValid(); ++MO) { 6985f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (!MO->isReg()) 6995f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen continue; 7005f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen unsigned Reg = MO->getReg(); 7015f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (!TargetRegisterInfo::isPhysicalRegister(Reg)) 7025f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen continue; 7035f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // Track live defs and kills for updating RegUnits. 7045f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (MO->isDef()) { 7055f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (MO->isDead()) 7065f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen Kills.push_back(Reg); 7075f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen else 7085f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen LiveDefOps.push_back(MO.getOperandNo()); 7095f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } else if (MO->isKill()) 7105f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen Kills.push_back(Reg); 7115f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // Identify dependencies. 7125f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (!MO->readsReg()) 7135f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen continue; 7145f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen for (MCRegUnitIterator Units(Reg, TRI); Units.isValid(); ++Units) { 7155f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units); 7165f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (I == RegUnits.end()) 7175f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen continue; 718c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen Deps.push_back(DataDep(I->MI, I->Op, MO.getOperandNo())); 7195f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen break; 7205f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } 7215f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } 7225f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 7235f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // Update RegUnits to reflect live registers after UseMI. 7245f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // First kills. 7255f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen for (unsigned i = 0, e = Kills.size(); i != e; ++i) 7265f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen for (MCRegUnitIterator Units(Kills[i], TRI); Units.isValid(); ++Units) 7275f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen RegUnits.erase(*Units); 7285f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 7295f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // Second, live defs. 7305f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen for (unsigned i = 0, e = LiveDefOps.size(); i != e; ++i) { 7315f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen unsigned DefOp = LiveDefOps[i]; 7325f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen for (MCRegUnitIterator Units(UseMI->getOperand(DefOp).getReg(), TRI); 7335f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen Units.isValid(); ++Units) { 7345f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen LiveRegUnit &LRU = RegUnits[*Units]; 735c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen LRU.MI = UseMI; 736c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen LRU.Op = DefOp; 7375f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } 7385f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } 7395f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen} 7405f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 74179a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen/// The length of the critical path through a trace is the maximum of two path 74279a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen/// lengths: 74379a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen/// 74479a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen/// 1. The maximum height+depth over all instructions in the trace center block. 74579a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen/// 74679a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen/// 2. The longest cross-block dependency chain. For small blocks, it is 74779a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen/// possible that the critical path through the trace doesn't include any 74879a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen/// instructions in the block. 74979a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen/// 75079a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen/// This function computes the second number from the live-in list of the 75179a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen/// center block. 75279a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesenunsigned MachineTraceMetrics::Ensemble:: 75379a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund OlesencomputeCrossBlockCriticalPath(const TraceBlockInfo &TBI) { 75479a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen assert(TBI.HasValidInstrDepths && "Missing depth info"); 75579a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen assert(TBI.HasValidInstrHeights && "Missing height info"); 75679a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen unsigned MaxLen = 0; 75779a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen for (unsigned i = 0, e = TBI.LiveIns.size(); i != e; ++i) { 75879a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen const LiveInReg &LIR = TBI.LiveIns[i]; 75979a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen if (!TargetRegisterInfo::isVirtualRegister(LIR.Reg)) 76079a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen continue; 76179a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen const MachineInstr *DefMI = MTM.MRI->getVRegDef(LIR.Reg); 76279a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen // Ignore dependencies outside the current trace. 76379a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen const TraceBlockInfo &DefTBI = BlockInfo[DefMI->getParent()->getNumber()]; 7646ffcd5efe15156e2a71bd1a33f5f8e27de894ea3Jakob Stoklund Olesen if (!DefTBI.isUsefulDominator(TBI)) 76579a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen continue; 76679a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen unsigned Len = LIR.Height + Cycles[DefMI].Depth; 76779a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen MaxLen = std::max(MaxLen, Len); 76879a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen } 76979a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen return MaxLen; 77079a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen} 77179a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen 7725f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen/// Compute instruction depths for all instructions above or in MBB in its 7735f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen/// trace. This assumes that the trace through MBB has already been computed. 7745f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesenvoid MachineTraceMetrics::Ensemble:: 7755f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund OlesencomputeInstrDepths(const MachineBasicBlock *MBB) { 7765f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // The top of the trace may already be computed, and HasValidInstrDepths 7775f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // implies Head->HasValidInstrDepths, so we only need to start from the first 7785f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // block in the trace that needs to be recomputed. 7795f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen SmallVector<const MachineBasicBlock*, 8> Stack; 7805f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen do { 7815f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen TraceBlockInfo &TBI = BlockInfo[MBB->getNumber()]; 7825f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen assert(TBI.hasValidDepth() && "Incomplete trace"); 7835f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (TBI.HasValidInstrDepths) 7845f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen break; 7855f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen Stack.push_back(MBB); 7865f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen MBB = TBI.Pred; 7875f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } while (MBB); 7885f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 7895f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // FIXME: If MBB is non-null at this point, it is the last pre-computed block 7905f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // in the trace. We should track any live-out physregs that were defined in 7915f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // the trace. This is quite rare in SSA form, typically created by CSE 7925f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // hoisting a compare. 7935f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen SparseSet<LiveRegUnit> RegUnits; 7945f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen RegUnits.setUniverse(MTM.TRI->getNumRegUnits()); 7955f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 7965f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // Go through trace blocks in top-down order, stopping after the center block. 7975f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen SmallVector<DataDep, 8> Deps; 7985f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen while (!Stack.empty()) { 7995f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen MBB = Stack.pop_back_val(); 8008396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen DEBUG(dbgs() << "\nDepths for BB#" << MBB->getNumber() << ":\n"); 8015f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen TraceBlockInfo &TBI = BlockInfo[MBB->getNumber()]; 8025f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen TBI.HasValidInstrDepths = true; 80379a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen TBI.CriticalPath = 0; 80479a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen 8058396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen // Print out resource depths here as well. 8068396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen DEBUG({ 8078396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen dbgs() << format("%7u Instructions\n", TBI.InstrDepth); 8088396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ArrayRef<unsigned> PRDepths = getProcResourceDepths(MBB->getNumber()); 8098396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen for (unsigned K = 0; K != PRDepths.size(); ++K) 8108396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen if (PRDepths[K]) { 8118396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned Factor = MTM.SchedModel.getResourceFactor(K); 8128396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen dbgs() << format("%6uc @ ", MTM.getCycles(PRDepths[K])) 8138396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen << MTM.SchedModel.getProcResource(K)->Name << " (" 8148396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen << PRDepths[K]/Factor << " ops x" << Factor << ")\n"; 8158396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen } 8168396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen }); 8178396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 81879a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen // Also compute the critical path length through MBB when possible. 81979a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen if (TBI.HasValidInstrHeights) 82079a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen TBI.CriticalPath = computeCrossBlockCriticalPath(TBI); 82179a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen 822dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines for (const auto &UseMI : *MBB) { 8235f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // Collect all data dependencies. 8245f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen Deps.clear(); 825dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (UseMI.isPHI()) 826dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines getPHIDeps(&UseMI, Deps, TBI.Pred, MTM.MRI); 827dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines else if (getDataDeps(&UseMI, Deps, MTM.MRI)) 828dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines updatePhysDepsDownwards(&UseMI, Deps, RegUnits, MTM.TRI); 8295f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 8305f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // Filter and process dependencies, computing the earliest issue cycle. 8315f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen unsigned Cycle = 0; 8325f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen for (unsigned i = 0, e = Deps.size(); i != e; ++i) { 8335f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen const DataDep &Dep = Deps[i]; 8345f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen const TraceBlockInfo&DepTBI = 8355f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen BlockInfo[Dep.DefMI->getParent()->getNumber()]; 8365f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // Ignore dependencies from outside the current trace. 8376ffcd5efe15156e2a71bd1a33f5f8e27de894ea3Jakob Stoklund Olesen if (!DepTBI.isUsefulDominator(TBI)) 8385f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen continue; 8395f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen assert(DepTBI.HasValidInstrDepths && "Inconsistent dependency"); 8405f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen unsigned DepCycle = Cycles.lookup(Dep.DefMI).Depth; 8415f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // Add latency if DefMI is a real instruction. Transients get latency 0. 8425f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (!Dep.DefMI->isTransient()) 843f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen DepCycle += MTM.SchedModel 844dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines .computeOperandLatency(Dep.DefMI, Dep.DefOp, &UseMI, Dep.UseOp); 8455f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen Cycle = std::max(Cycle, DepCycle); 8465f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } 8475f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen // Remember the instruction depth. 848dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines InstrCycles &MICycles = Cycles[&UseMI]; 84979a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen MICycles.Depth = Cycle; 85079a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen 85179a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen if (!TBI.HasValidInstrHeights) { 852dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines DEBUG(dbgs() << Cycle << '\t' << UseMI); 85379a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen continue; 85479a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen } 85579a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen // Update critical path length. 85679a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen TBI.CriticalPath = std::max(TBI.CriticalPath, Cycle + MICycles.Height); 857dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines DEBUG(dbgs() << TBI.CriticalPath << '\t' << Cycle << '\t' << UseMI); 8585f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } 8595f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen } 8605f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen} 8615f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen 862c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen// Identify physreg dependencies for MI when scanning instructions upwards. 863c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen// Return the issue height of MI after considering any live regunits. 864c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen// Height is the issue height computed from virtual register dependencies alone. 865c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesenstatic unsigned updatePhysDepsUpwards(const MachineInstr *MI, unsigned Height, 866c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen SparseSet<LiveRegUnit> &RegUnits, 867f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen const TargetSchedModel &SchedModel, 868c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen const TargetInstrInfo *TII, 869c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen const TargetRegisterInfo *TRI) { 870c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen SmallVector<unsigned, 8> ReadOps; 871c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen for (ConstMIOperands MO(MI); MO.isValid(); ++MO) { 872c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (!MO->isReg()) 873c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen continue; 874c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen unsigned Reg = MO->getReg(); 875c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (!TargetRegisterInfo::isPhysicalRegister(Reg)) 876c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen continue; 877c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (MO->readsReg()) 878c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen ReadOps.push_back(MO.getOperandNo()); 879c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (!MO->isDef()) 880c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen continue; 881c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // This is a def of Reg. Remove corresponding entries from RegUnits, and 882c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // update MI Height to consider the physreg dependencies. 883c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen for (MCRegUnitIterator Units(Reg, TRI); Units.isValid(); ++Units) { 884c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units); 885c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (I == RegUnits.end()) 886c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen continue; 887c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen unsigned DepHeight = I->Cycle; 888c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (!MI->isTransient()) { 889c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // We may not know the UseMI of this dependency, if it came from the 890f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen // live-in list. SchedModel can handle a NULL UseMI. 891f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen DepHeight += SchedModel 892b86a0cdb674549d8493043331cecd9cbf53b80daAndrew Trick .computeOperandLatency(MI, MO.getOperandNo(), I->MI, I->Op); 893c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 894c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen Height = std::max(Height, DepHeight); 895c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // This regunit is dead above MI. 896c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen RegUnits.erase(I); 897c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 898c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 899c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 900c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Now we know the height of MI. Update any regunits read. 901c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen for (unsigned i = 0, e = ReadOps.size(); i != e; ++i) { 902c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen unsigned Reg = MI->getOperand(ReadOps[i]).getReg(); 903c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen for (MCRegUnitIterator Units(Reg, TRI); Units.isValid(); ++Units) { 904c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen LiveRegUnit &LRU = RegUnits[*Units]; 905c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Set the height to the highest reader of the unit. 906c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (LRU.Cycle <= Height && LRU.MI != MI) { 907c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen LRU.Cycle = Height; 908c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen LRU.MI = MI; 909c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen LRU.Op = ReadOps[i]; 910c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 911c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 912c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 913c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 914c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen return Height; 915c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen} 916c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 917c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 918c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesentypedef DenseMap<const MachineInstr *, unsigned> MIHeightMap; 919c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 920c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen// Push the height of DefMI upwards if required to match UseMI. 921c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen// Return true if this is the first time DefMI was seen. 922c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesenstatic bool pushDepHeight(const DataDep &Dep, 923c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen const MachineInstr *UseMI, unsigned UseHeight, 924c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen MIHeightMap &Heights, 925f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen const TargetSchedModel &SchedModel, 926c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen const TargetInstrInfo *TII) { 927c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Adjust height by Dep.DefMI latency. 928c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (!Dep.DefMI->isTransient()) 929f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen UseHeight += SchedModel.computeOperandLatency(Dep.DefMI, Dep.DefOp, 930b86a0cdb674549d8493043331cecd9cbf53b80daAndrew Trick UseMI, Dep.UseOp); 931c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 932c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Update Heights[DefMI] to be the maximum height seen. 933c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen MIHeightMap::iterator I; 934c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen bool New; 93536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines std::tie(I, New) = Heights.insert(std::make_pair(Dep.DefMI, UseHeight)); 936c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (New) 937c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen return true; 938c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 939c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // DefMI has been pushed before. Give it the max height. 940c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (I->second < UseHeight) 941c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen I->second = UseHeight; 942c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen return false; 943c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen} 944c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 945ebba49395c189364c9ef77fb4c432856330ceca1Jakob Stoklund Olesen/// Assuming that the virtual register defined by DefMI:DefOp was used by 946ebba49395c189364c9ef77fb4c432856330ceca1Jakob Stoklund Olesen/// Trace.back(), add it to the live-in lists of all the blocks in Trace. Stop 947ebba49395c189364c9ef77fb4c432856330ceca1Jakob Stoklund Olesen/// when reaching the block that contains DefMI. 948c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesenvoid MachineTraceMetrics::Ensemble:: 949ebba49395c189364c9ef77fb4c432856330ceca1Jakob Stoklund OlesenaddLiveIns(const MachineInstr *DefMI, unsigned DefOp, 950c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen ArrayRef<const MachineBasicBlock*> Trace) { 951c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen assert(!Trace.empty() && "Trace should contain at least one block"); 952ebba49395c189364c9ef77fb4c432856330ceca1Jakob Stoklund Olesen unsigned Reg = DefMI->getOperand(DefOp).getReg(); 953c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen assert(TargetRegisterInfo::isVirtualRegister(Reg)); 954c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen const MachineBasicBlock *DefMBB = DefMI->getParent(); 955c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 956c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Reg is live-in to all blocks in Trace that follow DefMBB. 957c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen for (unsigned i = Trace.size(); i; --i) { 958c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen const MachineBasicBlock *MBB = Trace[i-1]; 959c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (MBB == DefMBB) 960c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen return; 961c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen TraceBlockInfo &TBI = BlockInfo[MBB->getNumber()]; 962c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Just add the register. The height will be updated later. 963c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen TBI.LiveIns.push_back(Reg); 964c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 965c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen} 966c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 967c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen/// Compute instruction heights in the trace through MBB. This updates MBB and 968c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen/// the blocks below it in the trace. It is assumed that the trace has already 969c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen/// been computed. 970c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesenvoid MachineTraceMetrics::Ensemble:: 971c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund OlesencomputeInstrHeights(const MachineBasicBlock *MBB) { 972c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // The bottom of the trace may already be computed. 973c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Find the blocks that need updating. 974c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen SmallVector<const MachineBasicBlock*, 8> Stack; 975c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen do { 976c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen TraceBlockInfo &TBI = BlockInfo[MBB->getNumber()]; 977c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen assert(TBI.hasValidHeight() && "Incomplete trace"); 978c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (TBI.HasValidInstrHeights) 979c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen break; 980c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen Stack.push_back(MBB); 981c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen TBI.LiveIns.clear(); 982c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen MBB = TBI.Succ; 983c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } while (MBB); 984c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 985c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // As we move upwards in the trace, keep track of instructions that are 986c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // required by deeper trace instructions. Map MI -> height required so far. 987c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen MIHeightMap Heights; 988c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 989c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // For physregs, the def isn't known when we see the use. 990c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Instead, keep track of the highest use of each regunit. 991c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen SparseSet<LiveRegUnit> RegUnits; 992c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen RegUnits.setUniverse(MTM.TRI->getNumRegUnits()); 993c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 994c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // If the bottom of the trace was already precomputed, initialize heights 995c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // from its live-in list. 996c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // MBB is the highest precomputed block in the trace. 997c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (MBB) { 998c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen TraceBlockInfo &TBI = BlockInfo[MBB->getNumber()]; 999c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen for (unsigned i = 0, e = TBI.LiveIns.size(); i != e; ++i) { 1000c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen LiveInReg LI = TBI.LiveIns[i]; 1001c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (TargetRegisterInfo::isVirtualRegister(LI.Reg)) { 1002c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // For virtual registers, the def latency is included. 1003c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen unsigned &Height = Heights[MTM.MRI->getVRegDef(LI.Reg)]; 1004c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (Height < LI.Height) 1005c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen Height = LI.Height; 1006c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } else { 1007c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // For register units, the def latency is not included because we don't 1008c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // know the def yet. 1009c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen RegUnits[LI.Reg].Cycle = LI.Height; 1010c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 1011c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 1012c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 1013c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 1014c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Go through the trace blocks in bottom-up order. 1015c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen SmallVector<DataDep, 8> Deps; 1016c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen for (;!Stack.empty(); Stack.pop_back()) { 1017c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen MBB = Stack.back(); 1018c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen DEBUG(dbgs() << "Heights for BB#" << MBB->getNumber() << ":\n"); 1019c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen TraceBlockInfo &TBI = BlockInfo[MBB->getNumber()]; 1020c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen TBI.HasValidInstrHeights = true; 102179a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen TBI.CriticalPath = 0; 1022c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 10238396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen DEBUG({ 10248396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen dbgs() << format("%7u Instructions\n", TBI.InstrHeight); 10258396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ArrayRef<unsigned> PRHeights = getProcResourceHeights(MBB->getNumber()); 10268396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen for (unsigned K = 0; K != PRHeights.size(); ++K) 10278396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen if (PRHeights[K]) { 10288396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned Factor = MTM.SchedModel.getResourceFactor(K); 10298396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen dbgs() << format("%6uc @ ", MTM.getCycles(PRHeights[K])) 10308396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen << MTM.SchedModel.getProcResource(K)->Name << " (" 10318396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen << PRHeights[K]/Factor << " ops x" << Factor << ")\n"; 10328396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen } 10338396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen }); 10348396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 1035c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Get dependencies from PHIs in the trace successor. 10368828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen const MachineBasicBlock *Succ = TBI.Succ; 10378828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen // If MBB is the last block in the trace, and it has a back-edge to the 10388828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen // loop header, get loop-carried dependencies from PHIs in the header. For 10398828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen // that purpose, pretend that all the loop header PHIs have height 0. 10408828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen if (!Succ) 10418828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen if (const MachineLoop *Loop = getLoopFor(MBB)) 10428828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen if (MBB->isSuccessor(Loop->getHeader())) 10438828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen Succ = Loop->getHeader(); 10448828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen 10458828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen if (Succ) { 1046dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines for (const auto &PHI : *Succ) { 1047dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (!PHI.isPHI()) 1048dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines break; 1049c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen Deps.clear(); 1050dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines getPHIDeps(&PHI, Deps, MBB, MTM.MRI); 10518828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen if (!Deps.empty()) { 10528828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen // Loop header PHI heights are all 0. 1053dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines unsigned Height = TBI.Succ ? Cycles.lookup(&PHI).Height : 0; 1054dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines DEBUG(dbgs() << "pred\t" << Height << '\t' << PHI); 1055dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (pushDepHeight(Deps.front(), &PHI, Height, 1056f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen Heights, MTM.SchedModel, MTM.TII)) 1057ebba49395c189364c9ef77fb4c432856330ceca1Jakob Stoklund Olesen addLiveIns(Deps.front().DefMI, Deps.front().DefOp, Stack); 10588828c4ccd44cb49d13360cf86fd0b963f211f03fJakob Stoklund Olesen } 1059c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 1060c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 1061c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 1062c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Go through the block backwards. 1063c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen for (MachineBasicBlock::const_iterator BI = MBB->end(), BB = MBB->begin(); 1064c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen BI != BB;) { 1065c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen const MachineInstr *MI = --BI; 1066c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 1067c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Find the MI height as determined by virtual register uses in the 1068c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // trace below. 1069c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen unsigned Cycle = 0; 1070c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen MIHeightMap::iterator HeightI = Heights.find(MI); 1071c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (HeightI != Heights.end()) { 1072c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen Cycle = HeightI->second; 1073c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // We won't be seeing any more MI uses. 1074c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen Heights.erase(HeightI); 1075c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 1076c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 1077c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Don't process PHI deps. They depend on the specific predecessor, and 1078c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // we'll get them when visiting the predecessor. 1079c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen Deps.clear(); 1080c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen bool HasPhysRegs = !MI->isPHI() && getDataDeps(MI, Deps, MTM.MRI); 1081c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 1082c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // There may also be regunit dependencies to include in the height. 1083c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen if (HasPhysRegs) 1084c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen Cycle = updatePhysDepsUpwards(MI, Cycle, RegUnits, 1085f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen MTM.SchedModel, MTM.TII, MTM.TRI); 1086c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 1087c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Update the required height of any virtual registers read by MI. 1088c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen for (unsigned i = 0, e = Deps.size(); i != e; ++i) 1089f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen if (pushDepHeight(Deps[i], MI, Cycle, Heights, MTM.SchedModel, MTM.TII)) 1090ebba49395c189364c9ef77fb4c432856330ceca1Jakob Stoklund Olesen addLiveIns(Deps[i].DefMI, Deps[i].DefOp, Stack); 109179a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen 109279a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen InstrCycles &MICycles = Cycles[MI]; 109379a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen MICycles.Height = Cycle; 109479a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen if (!TBI.HasValidInstrDepths) { 109579a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen DEBUG(dbgs() << Cycle << '\t' << *MI); 109679a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen continue; 109779a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen } 109879a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen // Update critical path length. 109979a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen TBI.CriticalPath = std::max(TBI.CriticalPath, Cycle + MICycles.Depth); 110079a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen DEBUG(dbgs() << TBI.CriticalPath << '\t' << Cycle << '\t' << *MI); 1101c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 1102c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 1103c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Update virtual live-in heights. They were added by addLiveIns() with a 0 1104c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // height because the final height isn't known until now. 1105c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen DEBUG(dbgs() << "BB#" << MBB->getNumber() << " Live-ins:"); 1106c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen for (unsigned i = 0, e = TBI.LiveIns.size(); i != e; ++i) { 1107c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen LiveInReg &LIR = TBI.LiveIns[i]; 1108c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen const MachineInstr *DefMI = MTM.MRI->getVRegDef(LIR.Reg); 1109c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen LIR.Height = Heights.lookup(DefMI); 1110c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen DEBUG(dbgs() << ' ' << PrintReg(LIR.Reg) << '@' << LIR.Height); 1111c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 1112c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 1113c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen // Transfer the live regunits to the live-in list. 1114c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen for (SparseSet<LiveRegUnit>::const_iterator 1115c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen RI = RegUnits.begin(), RE = RegUnits.end(); RI != RE; ++RI) { 1116c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen TBI.LiveIns.push_back(LiveInReg(RI->RegUnit, RI->Cycle)); 1117c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen DEBUG(dbgs() << ' ' << PrintRegUnit(RI->RegUnit, MTM.TRI) 1118c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen << '@' << RI->Cycle); 1119c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 1120c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen DEBUG(dbgs() << '\n'); 112179a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen 112279a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen if (!TBI.HasValidInstrDepths) 112379a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen continue; 112479a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen // Add live-ins to the critical path length. 112579a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen TBI.CriticalPath = std::max(TBI.CriticalPath, 112679a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen computeCrossBlockCriticalPath(TBI)); 112779a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen DEBUG(dbgs() << "Critical path: " << TBI.CriticalPath << '\n'); 1128c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen } 1129c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen} 1130c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen 11319f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMachineTraceMetrics::Trace 11329f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund OlesenMachineTraceMetrics::Ensemble::getTrace(const MachineBasicBlock *MBB) { 11339f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen // FIXME: Check cache tags, recompute as needed. 11349f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen computeTrace(MBB); 11355f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen computeInstrDepths(MBB); 1136c7f44b8b8fca87cdd28ffe420c3b87141d88c099Jakob Stoklund Olesen computeInstrHeights(MBB); 11379f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen return Trace(*this, BlockInfo[MBB->getNumber()]); 11389f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 11399f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 114084ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesenunsigned 114184ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund OlesenMachineTraceMetrics::Trace::getInstrSlack(const MachineInstr *MI) const { 114284ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen assert(MI && "Not an instruction."); 114384ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen assert(getBlockNum() == unsigned(MI->getParent()->getNumber()) && 114484ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen "MI must be in the trace center block"); 114584ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen InstrCycles Cyc = getInstrCycles(MI); 114684ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen return getCriticalPath() - (Cyc.Depth + Cyc.Height); 114784ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen} 114884ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen 11495413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesenunsigned 11505413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund OlesenMachineTraceMetrics::Trace::getPHIDepth(const MachineInstr *PHI) const { 11515413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen const MachineBasicBlock *MBB = TE.MTM.MF->getBlockNumbered(getBlockNum()); 11525413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen SmallVector<DataDep, 1> Deps; 11535413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen getPHIDeps(PHI, Deps, MBB, TE.MTM.MRI); 11545413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen assert(Deps.size() == 1 && "PHI doesn't have MBB as a predecessor"); 11555413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen DataDep &Dep = Deps.front(); 11565413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen unsigned DepCycle = getInstrCycles(Dep.DefMI).Depth; 11575413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen // Add latency if DefMI is a real instruction. Transients get latency 0. 11585413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen if (!Dep.DefMI->isTransient()) 1159f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen DepCycle += TE.MTM.SchedModel 1160b86a0cdb674549d8493043331cecd9cbf53b80daAndrew Trick .computeOperandLatency(Dep.DefMI, Dep.DefOp, PHI, Dep.UseOp); 11615413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen return DepCycle; 11625413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen} 11635413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen 116437ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines/// When bottom is set include instructions in current block in estimate. 116584ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesenunsigned MachineTraceMetrics::Trace::getResourceDepth(bool Bottom) const { 11668396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen // Find the limiting processor resource. 11678396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen // Numbers have been pre-scaled to be comparable. 11688396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PRMax = 0; 11698396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ArrayRef<unsigned> PRDepths = TE.getProcResourceDepths(getBlockNum()); 11708396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen if (Bottom) { 11718396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ArrayRef<unsigned> PRCycles = TE.MTM.getProcResourceCycles(getBlockNum()); 11728396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen for (unsigned K = 0; K != PRDepths.size(); ++K) 11738396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen PRMax = std::max(PRMax, PRDepths[K] + PRCycles[K]); 11748396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen } else { 11758396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen for (unsigned K = 0; K != PRDepths.size(); ++K) 11768396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen PRMax = std::max(PRMax, PRDepths[K]); 11778396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen } 11788396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen // Convert to cycle count. 11798396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen PRMax = TE.MTM.getCycles(PRMax); 11808396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 118137ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines /// All instructions before current block 118284ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen unsigned Instrs = TBI.InstrDepth; 118337ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines // plus instructions in current block 118484ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen if (Bottom) 118584ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen Instrs += TE.MTM.BlockInfo[getBlockNum()].InstrCount; 1186f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen if (unsigned IW = TE.MTM.SchedModel.getIssueWidth()) 1187f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen Instrs /= IW; 11885413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen // Assume issue width 1 without a schedule model. 11898396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen return std::max(Instrs, PRMax); 11905413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen} 11915413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen 119237ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hinesunsigned MachineTraceMetrics::Trace::getResourceLength( 119337ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines ArrayRef<const MachineBasicBlock *> Extrablocks, 119437ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines ArrayRef<const MCSchedClassDesc *> ExtraInstrs, 119537ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines ArrayRef<const MCSchedClassDesc *> RemoveInstrs) const { 11968396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen // Add up resources above and below the center block. 11978396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ArrayRef<unsigned> PRDepths = TE.getProcResourceDepths(getBlockNum()); 11988396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen ArrayRef<unsigned> PRHeights = TE.getProcResourceHeights(getBlockNum()); 11998396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen unsigned PRMax = 0; 120037ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines 120137ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines // Capture computing cycles from extra instructions 120237ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines auto extraCycles = [this](ArrayRef<const MCSchedClassDesc *> Instrs, 120337ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines unsigned ResourceIdx) 120437ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines ->unsigned { 120537ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines unsigned Cycles = 0; 120637ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines for (unsigned I = 0; I != Instrs.size(); ++I) { 120737ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines const MCSchedClassDesc *SC = Instrs[I]; 12083aa5394e5bbf267824e9d789ec8b1c27b85a8671Andrew Trick if (!SC->isValid()) 12093aa5394e5bbf267824e9d789ec8b1c27b85a8671Andrew Trick continue; 12103aa5394e5bbf267824e9d789ec8b1c27b85a8671Andrew Trick for (TargetSchedModel::ProcResIter 121137ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines PI = TE.MTM.SchedModel.getWriteProcResBegin(SC), 121237ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines PE = TE.MTM.SchedModel.getWriteProcResEnd(SC); 121337ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines PI != PE; ++PI) { 121437ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines if (PI->ProcResourceIdx != ResourceIdx) 12153aa5394e5bbf267824e9d789ec8b1c27b85a8671Andrew Trick continue; 121637ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines Cycles += 121737ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines (PI->Cycles * TE.MTM.SchedModel.getResourceFactor(ResourceIdx)); 12183aa5394e5bbf267824e9d789ec8b1c27b85a8671Andrew Trick } 12193aa5394e5bbf267824e9d789ec8b1c27b85a8671Andrew Trick } 122037ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines return Cycles; 122137ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines }; 122237ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines 122337ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines for (unsigned K = 0; K != PRDepths.size(); ++K) { 122437ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines unsigned PRCycles = PRDepths[K] + PRHeights[K]; 122537ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines for (unsigned I = 0; I != Extrablocks.size(); ++I) 122637ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines PRCycles += TE.MTM.getProcResourceCycles(Extrablocks[I]->getNumber())[K]; 122737ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines PRCycles += extraCycles(ExtraInstrs, K); 122837ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines PRCycles -= extraCycles(RemoveInstrs, K); 12298396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen PRMax = std::max(PRMax, PRCycles); 12308396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen } 12318396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen // Convert to cycle count. 12328396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen PRMax = TE.MTM.getCycles(PRMax); 12338396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen 123437ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines // Instrs: #instructions in current trace outside current block. 12355413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen unsigned Instrs = TBI.InstrDepth + TBI.InstrHeight; 123637ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines // Add instruction count from the extra blocks. 12375413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen for (unsigned i = 0, e = Extrablocks.size(); i != e; ++i) 12385413b68b1f59041a821287790dbc1ee2e272cf4eJakob Stoklund Olesen Instrs += TE.MTM.getResources(Extrablocks[i])->InstrCount; 123937ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines Instrs += ExtraInstrs.size(); 124037ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines Instrs -= RemoveInstrs.size(); 1241f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen if (unsigned IW = TE.MTM.SchedModel.getIssueWidth()) 1242f43fe1d163b34e1de5d045773728c571b59d1cddJakob Stoklund Olesen Instrs /= IW; 124384ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen // Assume issue width 1 without a schedule model. 12448396e130427999c57422e52af3913eb8182847e5Jakob Stoklund Olesen return std::max(Instrs, PRMax); 124584ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen} 124684ef6ba44394f983d985b02e328cbb2dd779e4b0Jakob Stoklund Olesen 124737ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hinesbool MachineTraceMetrics::Trace::isDepInTrace(const MachineInstr *DefMI, 124837ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines const MachineInstr *UseMI) const { 124937ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines if (DefMI->getParent() == UseMI->getParent()) 125037ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines return true; 125137ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines 125237ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines const TraceBlockInfo &DepTBI = TE.BlockInfo[DefMI->getParent()->getNumber()]; 125337ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines const TraceBlockInfo &TBI = TE.BlockInfo[UseMI->getParent()->getNumber()]; 125437ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines 125537ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines return DepTBI.isUsefulDominator(TBI); 125637ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines} 125737ed9c199ca639565f6ce88105f9e39e898d82d0Stephen Hines 125808f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesenvoid MachineTraceMetrics::Ensemble::print(raw_ostream &OS) const { 125908f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << getName() << " ensemble:\n"; 126008f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen for (unsigned i = 0, e = BlockInfo.size(); i != e; ++i) { 126108f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << " BB#" << i << '\t'; 126208f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen BlockInfo[i].print(OS); 126308f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << '\n'; 126408f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen } 126508f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen} 126608f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen 126708f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesenvoid MachineTraceMetrics::TraceBlockInfo::print(raw_ostream &OS) const { 126808f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen if (hasValidDepth()) { 126908f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << "depth=" << InstrDepth; 127008f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen if (Pred) 127108f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << " pred=BB#" << Pred->getNumber(); 127208f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen else 127308f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << " pred=null"; 127408f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << " head=BB#" << Head; 12755f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (HasValidInstrDepths) 12765f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen OS << " +instrs"; 127708f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen } else 127808f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << "depth invalid"; 127908f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << ", "; 128008f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen if (hasValidHeight()) { 128108f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << "height=" << InstrHeight; 128208f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen if (Succ) 128308f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << " succ=BB#" << Succ->getNumber(); 128408f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen else 128508f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << " succ=null"; 128608f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << " tail=BB#" << Tail; 12875f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen if (HasValidInstrHeights) 12885f8e8bd656bb174b3e22c0e56ce3d1eb958ac2e2Jakob Stoklund Olesen OS << " +instrs"; 128908f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen } else 129008f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen OS << "height invalid"; 129179a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen if (HasValidInstrDepths && HasValidInstrHeights) 129279a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen OS << ", crit=" << CriticalPath; 129308f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen} 129408f6ef6a7807250d84446661b7a6ec4afa762099Jakob Stoklund Olesen 12959f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesenvoid MachineTraceMetrics::Trace::print(raw_ostream &OS) const { 12960271a5fa29f73150fad891ca4c43a0a89a64b3bfJakob Stoklund Olesen unsigned MBBNum = &TBI - &TE.BlockInfo[0]; 12970271a5fa29f73150fad891ca4c43a0a89a64b3bfJakob Stoklund Olesen 12980271a5fa29f73150fad891ca4c43a0a89a64b3bfJakob Stoklund Olesen OS << TE.getName() << " trace BB#" << TBI.Head << " --> BB#" << MBBNum 12990271a5fa29f73150fad891ca4c43a0a89a64b3bfJakob Stoklund Olesen << " --> BB#" << TBI.Tail << ':'; 13009f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen if (TBI.hasValidHeight() && TBI.hasValidDepth()) 13019f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen OS << ' ' << getInstrCount() << " instrs."; 130279a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen if (TBI.HasValidInstrDepths && TBI.HasValidInstrHeights) 130379a20ce6f0d6c1041a5031aca41b50a1e58b1d4bJakob Stoklund Olesen OS << ' ' << TBI.CriticalPath << " cycles."; 13049f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 13059f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen const MachineTraceMetrics::TraceBlockInfo *Block = &TBI; 13060271a5fa29f73150fad891ca4c43a0a89a64b3bfJakob Stoklund Olesen OS << "\nBB#" << MBBNum; 13079f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen while (Block->hasValidDepth() && Block->Pred) { 13089f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen unsigned Num = Block->Pred->getNumber(); 13099f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen OS << " <- BB#" << Num; 13109f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen Block = &TE.BlockInfo[Num]; 13119f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 13129f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen 13139f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen Block = &TBI; 13140271a5fa29f73150fad891ca4c43a0a89a64b3bfJakob Stoklund Olesen OS << "\n "; 13159f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen while (Block->hasValidHeight() && Block->Succ) { 13169f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen unsigned Num = Block->Succ->getNumber(); 13179f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen OS << " -> BB#" << Num; 13189f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen Block = &TE.BlockInfo[Num]; 13199f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen } 13209f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen OS << '\n'; 13219f63e104271eb91e545fa8cdb16fb9e10a8a9578Jakob Stoklund Olesen} 1322