mirror of
https://github.com/RPCSX/llvm.git
synced 2025-02-02 10:32:56 +00:00
Cache DT[*SI] lookup.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@36239 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
8dcd2f1a5b
commit
5a713cc72f
@ -282,10 +282,12 @@ PostDominanceFrontier::calculate(const PostDominatorTree &DT,
|
||||
|
||||
if (BB)
|
||||
for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB);
|
||||
SI != SE; ++SI)
|
||||
SI != SE; ++SI) {
|
||||
// Does Node immediately dominate this predecessor?
|
||||
if (DT[*SI] && DT[*SI]->getIDom() != Node)
|
||||
DominatorTree::Node *SINode = DT[*SI];
|
||||
if (SINode && SINode->getIDom() != Node)
|
||||
S.insert(*SI);
|
||||
}
|
||||
|
||||
// At this point, S is DFlocal. Now we union in DFup's of our children...
|
||||
// Loop through and visit the nodes that Node immediately dominates (Node's
|
||||
|
Loading…
x
Reference in New Issue
Block a user