}
BranchProbabilityInfo(BranchProbabilityInfo &&Arg)
- : Probs(std::move(Arg.Probs)), LastF(Arg.LastF),
+ : Probs(std::move(Arg.Probs)), MaxSuccIdx(std::move(Arg.MaxSuccIdx)),
+ LastF(Arg.LastF),
PostDominatedByUnreachable(std::move(Arg.PostDominatedByUnreachable)),
PostDominatedByColdCall(std::move(Arg.PostDominatedByColdCall)) {}
BranchProbabilityInfo &operator=(BranchProbabilityInfo &&RHS) {
releaseMemory();
Probs = std::move(RHS.Probs);
+ MaxSuccIdx = std::move(RHS.MaxSuccIdx);
PostDominatedByColdCall = std::move(RHS.PostDominatedByColdCall);
PostDominatedByUnreachable = std::move(RHS.PostDominatedByUnreachable);
return *this;
DenseMap<Edge, BranchProbability> Probs;
+ // The maximum successor index ever entered for a given basic block.
+ DenseMap<const BasicBlock *, unsigned> MaxSuccIdx;
+
/// Track the last function we run over for printing.
const Function *LastF = nullptr;
void BranchProbabilityInfo::releaseMemory() {
Probs.clear();
+ MaxSuccIdx.clear();
Handles.clear();
}
LLVM_DEBUG(dbgs() << "set edge " << Src->getName() << " -> "
<< IndexInSuccessors << " successor probability to " << Prob
<< "\n");
+
+ if (MaxSuccIdx.find(Src) == MaxSuccIdx.end())
+ MaxSuccIdx[Src] = IndexInSuccessors;
+ else
+ MaxSuccIdx[Src] = std::max(MaxSuccIdx[Src], IndexInSuccessors);
}
/// Set the edge probability for all edges at once.
}
void BranchProbabilityInfo::eraseBlock(const BasicBlock *BB) {
- for (const_succ_iterator I = succ_begin(BB), E = succ_end(BB); I != E; ++I) {
- auto MapI = Probs.find(std::make_pair(BB, I.getSuccessorIndex()));
+ auto It = MaxSuccIdx.find(BB);
+ if (It == MaxSuccIdx.end())
+ return;
+
+ for (unsigned I = 0, E = It->second; I <= E; ++I) {
+ auto MapI = Probs.find(std::make_pair(BB, I));
if (MapI != Probs.end())
Probs.erase(MapI);
}
+ MaxSuccIdx.erase(BB);
}
void BranchProbabilityInfo::calculate(const Function &F, const LoopInfo &LI,