RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-09 13:21:30 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

This is supposed to be a preorder numbering of the dominator tree, not the CFG.

Browse Source 
llvm-svn: 73257
This commit is contained in:
Owen Anderson 2009-06-12 21:50:22 +00:00
parent 8c879bba61
commit 247bdbde16
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
lib/CodeGen/LazyLiveness.cpp
View File

@ -62,13 +62,14 @@ bool LazyLiveness::runOnMachineFunction(MachineFunction &mf) {
preorder.clear();
MRI = &mf.getRegInfo();
MachineDominatorTree& MDT = getAnalysis<MachineDominatorTree>();
// Step 0: Compute preorder numbering for all MBBs.
unsigned num = 0;
for (df_iterator<MachineBasicBlock*> DI = df_begin(&*mf.begin());
DI != df_end(&*mf.begin()); ++DI) {
preorder[*DI] = num++;
rev_preorder.push_back(*DI);
for (df_iterator<MachineDomTreeNode*> DI = df_begin(MDT.getRootNode());
DI != df_end(MDT.getRootNode()); ++DI) {
preorder[(*DI)->getBlock()] = num++;
rev_preorder.push_back((*DI)->getBlock());
}
// Step 1: Compute the transitive closure of the CFG, ignoring backedges.