summaryrefslogtreecommitdiff
path: root/lib/CodeGen/MachineTraceMetrics.cpp
diff options
context:
space:
mode:
authorJakob Stoklund Olesen <stoklund@2pi.dk>2012-07-30 21:10:27 +0000
committerJakob Stoklund Olesen <stoklund@2pi.dk>2012-07-30 21:10:27 +0000
commit8e54ab5c7618bf3813c337ad181a741f30eb36cc (patch)
tree436f98e0dfee977f8ba8405d48f694fe53ea3a57 /lib/CodeGen/MachineTraceMetrics.cpp
parentef6c76c984f821ea866902a7f9e695b16e971468 (diff)
downloadllvm-8e54ab5c7618bf3813c337ad181a741f30eb36cc.tar.gz
llvm-8e54ab5c7618bf3813c337ad181a741f30eb36cc.tar.bz2
llvm-8e54ab5c7618bf3813c337ad181a741f30eb36cc.tar.xz
Assert that all trace candidate blocks have been visited by the PO.
When computing a trace, all the candidates for pred/succ must have been visited. Filter out back-edges first, though. The PO traversal ignores them. Thanks to Andy for spotting this in review. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@160995 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/CodeGen/MachineTraceMetrics.cpp')
-rw-r--r--lib/CodeGen/MachineTraceMetrics.cpp17
1 files changed, 6 insertions, 11 deletions
diff --git a/lib/CodeGen/MachineTraceMetrics.cpp b/lib/CodeGen/MachineTraceMetrics.cpp
index c31e6bd92a..64f4a9561f 100644
--- a/lib/CodeGen/MachineTraceMetrics.cpp
+++ b/lib/CodeGen/MachineTraceMetrics.cpp
@@ -214,15 +214,12 @@ MinInstrCountEnsemble::pickTracePred(const MachineBasicBlock *MBB) {
for (MachineBasicBlock::const_pred_iterator
I = MBB->pred_begin(), E = MBB->pred_end(); I != E; ++I) {
const MachineBasicBlock *Pred = *I;
- const MachineTraceMetrics::TraceBlockInfo *PredTBI =
- getDepthResources(Pred);
- // Ignore invalidated predecessors. This never happens on the first scan,
- // but if we rejected this predecessor earlier, it won't be revalidated.
- if (!PredTBI)
- continue;
// Don't consider predecessors in other loops.
if (getLoopFor(Pred) != CurLoop)
continue;
+ const MachineTraceMetrics::TraceBlockInfo *PredTBI =
+ getDepthResources(Pred);
+ assert(PredTBI && "Predecessor must be visited first");
// Pick the predecessor that would give this block the smallest InstrDepth.
unsigned Depth = PredTBI->InstrDepth + CurCount;
if (!Best || Depth < BestDepth)
@@ -242,17 +239,15 @@ MinInstrCountEnsemble::pickTraceSucc(const MachineBasicBlock *MBB) {
for (MachineBasicBlock::const_succ_iterator
I = MBB->succ_begin(), E = MBB->succ_end(); I != E; ++I) {
const MachineBasicBlock *Succ = *I;
- const MachineTraceMetrics::TraceBlockInfo *SuccTBI =
- getHeightResources(Succ);
- // Ignore invalidated successors.
- if (!SuccTBI)
- continue;
// Don't consider back-edges.
if (CurLoop && Succ == CurLoop->getHeader())
continue;
// Don't consider successors in other loops.
if (getLoopFor(Succ) != CurLoop)
continue;
+ const MachineTraceMetrics::TraceBlockInfo *SuccTBI =
+ getHeightResources(Succ);
+ assert(SuccTBI && "Successor must be visited first");
// Pick the successor that would give this block the smallest InstrHeight.
unsigned Height = SuccTBI->InstrHeight;
if (!Best || Height < BestHeight)