1 //===- lib/CodeGen/MachineTraceMetrics.cpp ----------------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #define DEBUG_TYPE "early-ifcvt"
11 #include "MachineTraceMetrics.h"
12 #include "llvm/CodeGen/MachineBasicBlock.h"
13 #include "llvm/CodeGen/MachineBranchProbabilityInfo.h"
14 #include "llvm/CodeGen/MachineLoopInfo.h"
15 #include "llvm/CodeGen/MachineRegisterInfo.h"
16 #include "llvm/CodeGen/Passes.h"
17 #include "llvm/Target/TargetInstrInfo.h"
18 #include "llvm/Target/TargetRegisterInfo.h"
19 #include "llvm/Support/Debug.h"
20 #include "llvm/Support/raw_ostream.h"
21 #include "llvm/ADT/PostOrderIterator.h"
22 #include "llvm/ADT/SparseSet.h"
26 char MachineTraceMetrics::ID = 0;
27 char &llvm::MachineTraceMetricsID = MachineTraceMetrics::ID;
29 INITIALIZE_PASS_BEGIN(MachineTraceMetrics,
30 "machine-trace-metrics", "Machine Trace Metrics", false, true)
31 INITIALIZE_PASS_DEPENDENCY(MachineBranchProbabilityInfo)
32 INITIALIZE_PASS_DEPENDENCY(MachineLoopInfo)
33 INITIALIZE_PASS_END(MachineTraceMetrics,
34 "machine-trace-metrics", "Machine Trace Metrics", false, true)
36 MachineTraceMetrics::MachineTraceMetrics()
37 : MachineFunctionPass(ID), MF(0), TII(0), TRI(0), MRI(0), Loops(0) {
38 std::fill(Ensembles, array_endof(Ensembles), (Ensemble*)0);
41 void MachineTraceMetrics::getAnalysisUsage(AnalysisUsage &AU) const {
43 AU.addRequired<MachineBranchProbabilityInfo>();
44 AU.addRequired<MachineLoopInfo>();
45 MachineFunctionPass::getAnalysisUsage(AU);
48 bool MachineTraceMetrics::runOnMachineFunction(MachineFunction &Func) {
50 TII = MF->getTarget().getInstrInfo();
51 TRI = MF->getTarget().getRegisterInfo();
52 ItinData = MF->getTarget().getInstrItineraryData();
53 MRI = &MF->getRegInfo();
54 Loops = &getAnalysis<MachineLoopInfo>();
55 BlockInfo.resize(MF->getNumBlockIDs());
59 void MachineTraceMetrics::releaseMemory() {
62 for (unsigned i = 0; i != TS_NumStrategies; ++i) {
68 //===----------------------------------------------------------------------===//
69 // Fixed block information
70 //===----------------------------------------------------------------------===//
72 // The number of instructions in a basic block and the CPU resources used by
73 // those instructions don't depend on any given trace strategy.
75 /// Compute the resource usage in basic block MBB.
76 const MachineTraceMetrics::FixedBlockInfo*
77 MachineTraceMetrics::getResources(const MachineBasicBlock *MBB) {
78 assert(MBB && "No basic block");
79 FixedBlockInfo *FBI = &BlockInfo[MBB->getNumber()];
80 if (FBI->hasResources())
83 // Compute resource usage in the block.
84 // FIXME: Compute per-functional unit counts.
85 FBI->HasCalls = false;
86 unsigned InstrCount = 0;
87 for (MachineBasicBlock::const_iterator I = MBB->begin(), E = MBB->end();
89 const MachineInstr *MI = I;
90 if (MI->isTransient())
96 FBI->InstrCount = InstrCount;
100 //===----------------------------------------------------------------------===//
101 // Ensemble utility functions
102 //===----------------------------------------------------------------------===//
104 MachineTraceMetrics::Ensemble::Ensemble(MachineTraceMetrics *ct)
106 BlockInfo.resize(MTM.BlockInfo.size());
109 // Virtual destructor serves as an anchor.
110 MachineTraceMetrics::Ensemble::~Ensemble() {}
113 MachineTraceMetrics::Ensemble::getLoopFor(const MachineBasicBlock *MBB) const {
114 return MTM.Loops->getLoopFor(MBB);
117 // Update resource-related information in the TraceBlockInfo for MBB.
118 // Only update resources related to the trace above MBB.
119 void MachineTraceMetrics::Ensemble::
120 computeDepthResources(const MachineBasicBlock *MBB) {
121 TraceBlockInfo *TBI = &BlockInfo[MBB->getNumber()];
123 // Compute resources from trace above. The top block is simple.
126 TBI->Head = MBB->getNumber();
130 // Compute from the block above. A post-order traversal ensures the
131 // predecessor is always computed first.
132 TraceBlockInfo *PredTBI = &BlockInfo[TBI->Pred->getNumber()];
133 assert(PredTBI->hasValidDepth() && "Trace above has not been computed yet");
134 const FixedBlockInfo *PredFBI = MTM.getResources(TBI->Pred);
135 TBI->InstrDepth = PredTBI->InstrDepth + PredFBI->InstrCount;
136 TBI->Head = PredTBI->Head;
139 // Update resource-related information in the TraceBlockInfo for MBB.
140 // Only update resources related to the trace below MBB.
141 void MachineTraceMetrics::Ensemble::
142 computeHeightResources(const MachineBasicBlock *MBB) {
143 TraceBlockInfo *TBI = &BlockInfo[MBB->getNumber()];
145 // Compute resources for the current block.
146 TBI->InstrHeight = MTM.getResources(MBB)->InstrCount;
148 // The trace tail is done.
150 TBI->Tail = MBB->getNumber();
154 // Compute from the block below. A post-order traversal ensures the
155 // predecessor is always computed first.
156 TraceBlockInfo *SuccTBI = &BlockInfo[TBI->Succ->getNumber()];
157 assert(SuccTBI->hasValidHeight() && "Trace below has not been computed yet");
158 TBI->InstrHeight += SuccTBI->InstrHeight;
159 TBI->Tail = SuccTBI->Tail;
162 // Check if depth resources for MBB are valid and return the TBI.
163 // Return NULL if the resources have been invalidated.
164 const MachineTraceMetrics::TraceBlockInfo*
165 MachineTraceMetrics::Ensemble::
166 getDepthResources(const MachineBasicBlock *MBB) const {
167 const TraceBlockInfo *TBI = &BlockInfo[MBB->getNumber()];
168 return TBI->hasValidDepth() ? TBI : 0;
171 // Check if height resources for MBB are valid and return the TBI.
172 // Return NULL if the resources have been invalidated.
173 const MachineTraceMetrics::TraceBlockInfo*
174 MachineTraceMetrics::Ensemble::
175 getHeightResources(const MachineBasicBlock *MBB) const {
176 const TraceBlockInfo *TBI = &BlockInfo[MBB->getNumber()];
177 return TBI->hasValidHeight() ? TBI : 0;
180 //===----------------------------------------------------------------------===//
181 // Trace Selection Strategies
182 //===----------------------------------------------------------------------===//
184 // A trace selection strategy is implemented as a sub-class of Ensemble. The
185 // trace through a block B is computed by two DFS traversals of the CFG
186 // starting from B. One upwards, and one downwards. During the upwards DFS,
187 // pickTracePred() is called on the post-ordered blocks. During the downwards
188 // DFS, pickTraceSucc() is called in a post-order.
191 // We never allow traces that leave loops, but we do allow traces to enter
192 // nested loops. We also never allow traces to contain back-edges.
194 // This means that a loop header can never appear above the center block of a
195 // trace, except as the trace head. Below the center block, loop exiting edges
198 // Return true if an edge from the From loop to the To loop is leaving a loop.
199 // Either of To and From can be null.
200 static bool isExitingLoop(const MachineLoop *From, const MachineLoop *To) {
201 return From && !From->contains(To);
204 // MinInstrCountEnsemble - Pick the trace that executes the least number of
207 class MinInstrCountEnsemble : public MachineTraceMetrics::Ensemble {
208 const char *getName() const { return "MinInstr"; }
209 const MachineBasicBlock *pickTracePred(const MachineBasicBlock*);
210 const MachineBasicBlock *pickTraceSucc(const MachineBasicBlock*);
213 MinInstrCountEnsemble(MachineTraceMetrics *mtm)
214 : MachineTraceMetrics::Ensemble(mtm) {}
218 // Select the preferred predecessor for MBB.
219 const MachineBasicBlock*
220 MinInstrCountEnsemble::pickTracePred(const MachineBasicBlock *MBB) {
221 if (MBB->pred_empty())
223 const MachineLoop *CurLoop = getLoopFor(MBB);
224 // Don't leave loops, and never follow back-edges.
225 if (CurLoop && MBB == CurLoop->getHeader())
227 unsigned CurCount = MTM.getResources(MBB)->InstrCount;
228 const MachineBasicBlock *Best = 0;
229 unsigned BestDepth = 0;
230 for (MachineBasicBlock::const_pred_iterator
231 I = MBB->pred_begin(), E = MBB->pred_end(); I != E; ++I) {
232 const MachineBasicBlock *Pred = *I;
233 const MachineTraceMetrics::TraceBlockInfo *PredTBI =
234 getDepthResources(Pred);
235 assert(PredTBI && "Predecessor must be visited first");
236 // Pick the predecessor that would give this block the smallest InstrDepth.
237 unsigned Depth = PredTBI->InstrDepth + CurCount;
238 if (!Best || Depth < BestDepth)
239 Best = Pred, BestDepth = Depth;
244 // Select the preferred successor for MBB.
245 const MachineBasicBlock*
246 MinInstrCountEnsemble::pickTraceSucc(const MachineBasicBlock *MBB) {
247 if (MBB->pred_empty())
249 const MachineLoop *CurLoop = getLoopFor(MBB);
250 const MachineBasicBlock *Best = 0;
251 unsigned BestHeight = 0;
252 for (MachineBasicBlock::const_succ_iterator
253 I = MBB->succ_begin(), E = MBB->succ_end(); I != E; ++I) {
254 const MachineBasicBlock *Succ = *I;
255 // Don't consider back-edges.
256 if (CurLoop && Succ == CurLoop->getHeader())
258 // Don't consider successors exiting CurLoop.
259 if (isExitingLoop(CurLoop, getLoopFor(Succ)))
261 const MachineTraceMetrics::TraceBlockInfo *SuccTBI =
262 getHeightResources(Succ);
263 assert(SuccTBI && "Successor must be visited first");
264 // Pick the successor that would give this block the smallest InstrHeight.
265 unsigned Height = SuccTBI->InstrHeight;
266 if (!Best || Height < BestHeight)
267 Best = Succ, BestHeight = Height;
272 // Get an Ensemble sub-class for the requested trace strategy.
273 MachineTraceMetrics::Ensemble *
274 MachineTraceMetrics::getEnsemble(MachineTraceMetrics::Strategy strategy) {
275 assert(strategy < TS_NumStrategies && "Invalid trace strategy enum");
276 Ensemble *&E = Ensembles[strategy];
280 // Allocate new Ensemble on demand.
282 case TS_MinInstrCount: return (E = new MinInstrCountEnsemble(this));
283 default: llvm_unreachable("Invalid trace strategy enum");
287 void MachineTraceMetrics::invalidate(const MachineBasicBlock *MBB) {
288 DEBUG(dbgs() << "Invalidate traces through BB#" << MBB->getNumber() << '\n');
289 BlockInfo[MBB->getNumber()].invalidate();
290 for (unsigned i = 0; i != TS_NumStrategies; ++i)
292 Ensembles[i]->invalidate(MBB);
295 void MachineTraceMetrics::verifyAnalysis() const {
299 assert(BlockInfo.size() == MF->getNumBlockIDs() && "Outdated BlockInfo size");
300 for (unsigned i = 0; i != TS_NumStrategies; ++i)
302 Ensembles[i]->verify();
306 //===----------------------------------------------------------------------===//
308 //===----------------------------------------------------------------------===//
310 // Traces are built by two CFG traversals. To avoid recomputing too much, use a
311 // set abstraction that confines the search to the current loop, and doesn't
316 MutableArrayRef<MachineTraceMetrics::TraceBlockInfo> Blocks;
317 const MachineLoopInfo *Loops;
319 LoopBounds(MutableArrayRef<MachineTraceMetrics::TraceBlockInfo> blocks,
320 const MachineLoopInfo *loops)
321 : Blocks(blocks), Loops(loops), Downward(false) {}
325 // Specialize po_iterator_storage in order to prune the post-order traversal so
326 // it is limited to the current loop and doesn't traverse the loop back edges.
329 class po_iterator_storage<LoopBounds, true> {
332 po_iterator_storage(LoopBounds &lb) : LB(lb) {}
333 void finishPostorder(const MachineBasicBlock*) {}
335 bool insertEdge(const MachineBasicBlock *From, const MachineBasicBlock *To) {
336 // Skip already visited To blocks.
337 MachineTraceMetrics::TraceBlockInfo &TBI = LB.Blocks[To->getNumber()];
338 if (LB.Downward ? TBI.hasValidHeight() : TBI.hasValidDepth())
340 // From is null once when To is the trace center block.
343 const MachineLoop *FromLoop = LB.Loops->getLoopFor(From);
346 // Don't follow backedges, don't leave FromLoop when going upwards.
347 if ((LB.Downward ? To : From) == FromLoop->getHeader())
349 // Don't leave FromLoop.
350 if (isExitingLoop(FromLoop, LB.Loops->getLoopFor(To)))
352 // This is a new block. The PO traversal will compute height/depth
353 // resources, causing us to reject new edges to To. This only works because
354 // we reject back-edges, so the CFG is cycle-free.
360 /// Compute the trace through MBB.
361 void MachineTraceMetrics::Ensemble::computeTrace(const MachineBasicBlock *MBB) {
362 DEBUG(dbgs() << "Computing " << getName() << " trace through BB#"
363 << MBB->getNumber() << '\n');
364 // Set up loop bounds for the backwards post-order traversal.
365 LoopBounds Bounds(BlockInfo, MTM.Loops);
367 // Run an upwards post-order search for the trace start.
368 Bounds.Downward = false;
369 typedef ipo_ext_iterator<const MachineBasicBlock*, LoopBounds> UpwardPO;
370 for (UpwardPO I = ipo_ext_begin(MBB, Bounds), E = ipo_ext_end(MBB, Bounds);
372 DEBUG(dbgs() << " pred for BB#" << I->getNumber() << ": ");
373 TraceBlockInfo &TBI = BlockInfo[I->getNumber()];
374 // All the predecessors have been visited, pick the preferred one.
375 TBI.Pred = pickTracePred(*I);
378 dbgs() << "BB#" << TBI.Pred->getNumber() << '\n';
382 // The trace leading to I is now known, compute the depth resources.
383 computeDepthResources(*I);
386 // Run a downwards post-order search for the trace end.
387 Bounds.Downward = true;
388 typedef po_ext_iterator<const MachineBasicBlock*, LoopBounds> DownwardPO;
389 for (DownwardPO I = po_ext_begin(MBB, Bounds), E = po_ext_end(MBB, Bounds);
391 DEBUG(dbgs() << " succ for BB#" << I->getNumber() << ": ");
392 TraceBlockInfo &TBI = BlockInfo[I->getNumber()];
393 // All the successors have been visited, pick the preferred one.
394 TBI.Succ = pickTraceSucc(*I);
397 dbgs() << "BB#" << TBI.Succ->getNumber() << '\n';
401 // The trace leaving I is now known, compute the height resources.
402 computeHeightResources(*I);
406 /// Invalidate traces through BadMBB.
408 MachineTraceMetrics::Ensemble::invalidate(const MachineBasicBlock *BadMBB) {
409 SmallVector<const MachineBasicBlock*, 16> WorkList;
410 TraceBlockInfo &BadTBI = BlockInfo[BadMBB->getNumber()];
412 // Invalidate height resources of blocks above MBB.
413 if (BadTBI.hasValidHeight()) {
414 BadTBI.invalidateHeight();
415 WorkList.push_back(BadMBB);
417 const MachineBasicBlock *MBB = WorkList.pop_back_val();
418 DEBUG(dbgs() << "Invalidate BB#" << MBB->getNumber() << ' ' << getName()
420 // Find any MBB predecessors that have MBB as their preferred successor.
421 // They are the only ones that need to be invalidated.
422 for (MachineBasicBlock::const_pred_iterator
423 I = MBB->pred_begin(), E = MBB->pred_end(); I != E; ++I) {
424 TraceBlockInfo &TBI = BlockInfo[(*I)->getNumber()];
425 if (!TBI.hasValidHeight())
427 if (TBI.Succ == MBB) {
428 TBI.invalidateHeight();
429 WorkList.push_back(*I);
432 // Verify that TBI.Succ is actually a *I successor.
433 assert((!TBI.Succ || (*I)->isSuccessor(TBI.Succ)) && "CFG changed");
435 } while (!WorkList.empty());
438 // Invalidate depth resources of blocks below MBB.
439 if (BadTBI.hasValidDepth()) {
440 BadTBI.invalidateDepth();
441 WorkList.push_back(BadMBB);
443 const MachineBasicBlock *MBB = WorkList.pop_back_val();
444 DEBUG(dbgs() << "Invalidate BB#" << MBB->getNumber() << ' ' << getName()
446 // Find any MBB successors that have MBB as their preferred predecessor.
447 // They are the only ones that need to be invalidated.
448 for (MachineBasicBlock::const_succ_iterator
449 I = MBB->succ_begin(), E = MBB->succ_end(); I != E; ++I) {
450 TraceBlockInfo &TBI = BlockInfo[(*I)->getNumber()];
451 if (!TBI.hasValidDepth())
453 if (TBI.Pred == MBB) {
454 TBI.invalidateDepth();
455 WorkList.push_back(*I);
458 // Verify that TBI.Pred is actually a *I predecessor.
459 assert((!TBI.Pred || (*I)->isPredecessor(TBI.Pred)) && "CFG changed");
461 } while (!WorkList.empty());
464 // Clear any per-instruction data. We only have to do this for BadMBB itself
465 // because the instructions in that block may change. Other blocks may be
466 // invalidated, but their instructions will stay the same, so there is no
467 // need to erase the Cycle entries. They will be overwritten when we
469 for (MachineBasicBlock::const_iterator I = BadMBB->begin(), E = BadMBB->end();
474 void MachineTraceMetrics::Ensemble::verify() const {
476 assert(BlockInfo.size() == MTM.MF->getNumBlockIDs() &&
477 "Outdated BlockInfo size");
478 for (unsigned Num = 0, e = BlockInfo.size(); Num != e; ++Num) {
479 const TraceBlockInfo &TBI = BlockInfo[Num];
480 if (TBI.hasValidDepth() && TBI.Pred) {
481 const MachineBasicBlock *MBB = MTM.MF->getBlockNumbered(Num);
482 assert(MBB->isPredecessor(TBI.Pred) && "CFG doesn't match trace");
483 assert(BlockInfo[TBI.Pred->getNumber()].hasValidDepth() &&
484 "Trace is broken, depth should have been invalidated.");
485 const MachineLoop *Loop = getLoopFor(MBB);
486 assert(!(Loop && MBB == Loop->getHeader()) && "Trace contains backedge");
488 if (TBI.hasValidHeight() && TBI.Succ) {
489 const MachineBasicBlock *MBB = MTM.MF->getBlockNumbered(Num);
490 assert(MBB->isSuccessor(TBI.Succ) && "CFG doesn't match trace");
491 assert(BlockInfo[TBI.Succ->getNumber()].hasValidHeight() &&
492 "Trace is broken, height should have been invalidated.");
493 const MachineLoop *Loop = getLoopFor(MBB);
494 const MachineLoop *SuccLoop = getLoopFor(TBI.Succ);
495 assert(!(Loop && Loop == SuccLoop && TBI.Succ == Loop->getHeader()) &&
496 "Trace contains backedge");
502 //===----------------------------------------------------------------------===//
504 //===----------------------------------------------------------------------===//
506 // Compute the depth and height of each instruction based on data dependencies
507 // and instruction latencies. These cycle numbers assume that the CPU can issue
508 // an infinite number of instructions per cycle as long as their dependencies
511 // A data dependency is represented as a defining MI and operand numbers on the
512 // defining and using MI.
515 const MachineInstr *DefMI;
519 DataDep(const MachineInstr *DefMI, unsigned DefOp, unsigned UseOp)
520 : DefMI(DefMI), DefOp(DefOp), UseOp(UseOp) {}
522 /// Create a DataDep from an SSA form virtual register.
523 DataDep(const MachineRegisterInfo *MRI, unsigned VirtReg, unsigned UseOp)
525 assert(TargetRegisterInfo::isVirtualRegister(VirtReg));
526 MachineRegisterInfo::def_iterator DefI = MRI->def_begin(VirtReg);
527 assert(!DefI.atEnd() && "Register has no defs");
529 DefOp = DefI.getOperandNo();
530 assert((++DefI).atEnd() && "Register has multiple defs");
535 // Get the input data dependencies that must be ready before UseMI can issue.
536 // Return true if UseMI has any physreg operands.
537 static bool getDataDeps(const MachineInstr *UseMI,
538 SmallVectorImpl<DataDep> &Deps,
539 const MachineRegisterInfo *MRI) {
540 bool HasPhysRegs = false;
541 for (ConstMIOperands MO(UseMI); MO.isValid(); ++MO) {
544 unsigned Reg = MO->getReg();
547 if (TargetRegisterInfo::isPhysicalRegister(Reg)) {
551 // Collect virtual register reads.
553 Deps.push_back(DataDep(MRI, Reg, MO.getOperandNo()));
558 // Get the input data dependencies of a PHI instruction, using Pred as the
559 // preferred predecessor.
560 // This will add at most one dependency to Deps.
561 static void getPHIDeps(const MachineInstr *UseMI,
562 SmallVectorImpl<DataDep> &Deps,
563 const MachineBasicBlock *Pred,
564 const MachineRegisterInfo *MRI) {
565 // No predecessor at the beginning of a trace. Ignore dependencies.
568 assert(UseMI->isPHI() && UseMI->getNumOperands() % 2 && "Bad PHI");
569 for (unsigned i = 1; i != UseMI->getNumOperands(); i += 2) {
570 if (UseMI->getOperand(i + 1).getMBB() == Pred) {
571 unsigned Reg = UseMI->getOperand(i).getReg();
572 Deps.push_back(DataDep(MRI, Reg, i));
578 // Keep track of physreg data dependencies by recording each live register unit.
583 const MachineInstr *DefMI;
585 unsigned getSparseSetIndex() const { return RegUnit; }
587 LiveRegUnit(unsigned RU, const MachineInstr *MI = 0, unsigned OpNo = 0)
588 : RegUnit(RU), DefOp(OpNo), DefMI(MI) {}
592 // Identify physreg dependencies for UseMI, and update the live regunit
593 // tracking set when scanning instructions downwards.
594 static void updatePhysDepsDownwards(const MachineInstr *UseMI,
595 SmallVectorImpl<DataDep> &Deps,
596 SparseSet<LiveRegUnit> &RegUnits,
597 const TargetRegisterInfo *TRI) {
598 SmallVector<unsigned, 8> Kills;
599 SmallVector<unsigned, 8> LiveDefOps;
601 for (ConstMIOperands MO(UseMI); MO.isValid(); ++MO) {
604 unsigned Reg = MO->getReg();
605 if (!TargetRegisterInfo::isPhysicalRegister(Reg))
607 // Track live defs and kills for updating RegUnits.
610 Kills.push_back(Reg);
612 LiveDefOps.push_back(MO.getOperandNo());
613 } else if (MO->isKill())
614 Kills.push_back(Reg);
615 // Identify dependencies.
618 for (MCRegUnitIterator Units(Reg, TRI); Units.isValid(); ++Units) {
619 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units);
620 if (I == RegUnits.end())
622 Deps.push_back(DataDep(I->DefMI, I->DefOp, MO.getOperandNo()));
627 // Update RegUnits to reflect live registers after UseMI.
629 for (unsigned i = 0, e = Kills.size(); i != e; ++i)
630 for (MCRegUnitIterator Units(Kills[i], TRI); Units.isValid(); ++Units)
631 RegUnits.erase(*Units);
633 // Second, live defs.
634 for (unsigned i = 0, e = LiveDefOps.size(); i != e; ++i) {
635 unsigned DefOp = LiveDefOps[i];
636 for (MCRegUnitIterator Units(UseMI->getOperand(DefOp).getReg(), TRI);
637 Units.isValid(); ++Units) {
638 LiveRegUnit &LRU = RegUnits[*Units];
648 /// Compute instruction depths for all instructions above or in MBB in its
649 /// trace. This assumes that the trace through MBB has already been computed.
650 void MachineTraceMetrics::Ensemble::
651 computeInstrDepths(const MachineBasicBlock *MBB) {
652 // The top of the trace may already be computed, and HasValidInstrDepths
653 // implies Head->HasValidInstrDepths, so we only need to start from the first
654 // block in the trace that needs to be recomputed.
655 SmallVector<const MachineBasicBlock*, 8> Stack;
657 TraceBlockInfo &TBI = BlockInfo[MBB->getNumber()];
658 assert(TBI.hasValidDepth() && "Incomplete trace");
659 if (TBI.HasValidInstrDepths)
661 Stack.push_back(MBB);
665 // FIXME: If MBB is non-null at this point, it is the last pre-computed block
666 // in the trace. We should track any live-out physregs that were defined in
667 // the trace. This is quite rare in SSA form, typically created by CSE
668 // hoisting a compare.
669 SparseSet<LiveRegUnit> RegUnits;
670 RegUnits.setUniverse(MTM.TRI->getNumRegUnits());
672 // Go through trace blocks in top-down order, stopping after the center block.
673 SmallVector<DataDep, 8> Deps;
674 while (!Stack.empty()) {
675 MBB = Stack.pop_back_val();
676 DEBUG(dbgs() << "Depths for BB#" << MBB->getNumber() << ":\n");
677 TraceBlockInfo &TBI = BlockInfo[MBB->getNumber()];
678 TBI.HasValidInstrDepths = true;
679 for (MachineBasicBlock::const_iterator I = MBB->begin(), E = MBB->end();
681 const MachineInstr *UseMI = I;
683 // Collect all data dependencies.
686 getPHIDeps(UseMI, Deps, TBI.Pred, MTM.MRI);
687 else if (getDataDeps(UseMI, Deps, MTM.MRI))
688 updatePhysDepsDownwards(UseMI, Deps, RegUnits, MTM.TRI);
690 // Filter and process dependencies, computing the earliest issue cycle.
692 for (unsigned i = 0, e = Deps.size(); i != e; ++i) {
693 const DataDep &Dep = Deps[i];
694 const TraceBlockInfo&DepTBI =
695 BlockInfo[Dep.DefMI->getParent()->getNumber()];
696 // Ignore dependencies from outside the current trace.
697 if (!DepTBI.hasValidDepth() || DepTBI.Head != TBI.Head)
699 assert(DepTBI.HasValidInstrDepths && "Inconsistent dependency");
700 unsigned DepCycle = Cycles.lookup(Dep.DefMI).Depth;
701 // Add latency if DefMI is a real instruction. Transients get latency 0.
702 if (!Dep.DefMI->isTransient())
703 DepCycle += MTM.TII->computeOperandLatency(MTM.ItinData,
704 Dep.DefMI, Dep.DefOp,
706 /* FindMin = */ false);
707 Cycle = std::max(Cycle, DepCycle);
709 // Remember the instruction depth.
710 Cycles[UseMI].Depth = Cycle;
711 DEBUG(dbgs() << Cycle << '\t' << *UseMI);
716 MachineTraceMetrics::Trace
717 MachineTraceMetrics::Ensemble::getTrace(const MachineBasicBlock *MBB) {
718 // FIXME: Check cache tags, recompute as needed.
720 computeInstrDepths(MBB);
721 return Trace(*this, BlockInfo[MBB->getNumber()]);
724 void MachineTraceMetrics::Ensemble::print(raw_ostream &OS) const {
725 OS << getName() << " ensemble:\n";
726 for (unsigned i = 0, e = BlockInfo.size(); i != e; ++i) {
727 OS << " BB#" << i << '\t';
728 BlockInfo[i].print(OS);
733 void MachineTraceMetrics::TraceBlockInfo::print(raw_ostream &OS) const {
734 if (hasValidDepth()) {
735 OS << "depth=" << InstrDepth;
737 OS << " pred=BB#" << Pred->getNumber();
740 OS << " head=BB#" << Head;
741 if (HasValidInstrDepths)
744 OS << "depth invalid";
746 if (hasValidHeight()) {
747 OS << "height=" << InstrHeight;
749 OS << " succ=BB#" << Succ->getNumber();
752 OS << " tail=BB#" << Tail;
753 if (HasValidInstrHeights)
756 OS << "height invalid";
759 void MachineTraceMetrics::Trace::print(raw_ostream &OS) const {
760 unsigned MBBNum = &TBI - &TE.BlockInfo[0];
762 OS << TE.getName() << " trace BB#" << TBI.Head << " --> BB#" << MBBNum
763 << " --> BB#" << TBI.Tail << ':';
764 if (TBI.hasValidHeight() && TBI.hasValidDepth())
765 OS << ' ' << getInstrCount() << " instrs.";
767 const MachineTraceMetrics::TraceBlockInfo *Block = &TBI;
768 OS << "\nBB#" << MBBNum;
769 while (Block->hasValidDepth() && Block->Pred) {
770 unsigned Num = Block->Pred->getNumber();
771 OS << " <- BB#" << Num;
772 Block = &TE.BlockInfo[Num];
777 while (Block->hasValidHeight() && Block->Succ) {
778 unsigned Num = Block->Succ->getNumber();
779 OS << " -> BB#" << Num;
780 Block = &TE.BlockInfo[Num];