mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-01-05 12:31:33 +00:00
Use getNumPreds(BB) instead of computing them manually. This is a very small but
measurable speedup. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@40823 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
1e76af3011
commit
127ed3c929
@ -496,14 +496,14 @@ void PromoteMem2Reg::run() {
|
||||
if (&BB->front() != SomePHI)
|
||||
continue;
|
||||
|
||||
// Count the number of preds for BB.
|
||||
SmallVector<BasicBlock*, 16> Preds(pred_begin(BB), pred_end(BB));
|
||||
|
||||
// Only do work here if there the PHI nodes are missing incoming values. We
|
||||
// know that all PHI nodes that were inserted in a block will have the same
|
||||
// number of incoming values, so we can just check any of them.
|
||||
if (SomePHI->getNumIncomingValues() == Preds.size())
|
||||
if (SomePHI->getNumIncomingValues() == getNumPreds(BB))
|
||||
continue;
|
||||
|
||||
// Get the preds for BB.
|
||||
SmallVector<BasicBlock*, 16> Preds(pred_begin(BB), pred_end(BB));
|
||||
|
||||
// Ok, now we know that all of the PHI nodes are missing entries for some
|
||||
// basic blocks. Start by sorting the incoming predecessors for efficient
|
||||
|
Loading…
Reference in New Issue
Block a user