6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-08-02 09:29:24 +00:00
Code Issues Projects Releases Wiki Activity

Improve style.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@73258 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Owen Anderson 2009-06-12 22:07:19 +00:00
parent 5b6139a4d1
commit a21f31bca5
1 changed files with 16 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
lib/CodeGen/LazyLiveness.cpp
View File

@ -66,21 +66,21 @@ bool LazyLiveness::runOnMachineFunction(MachineFunction &mf) {
// Step 0: Compute preorder numbering for all MBBs. // Step 0: Compute preorder numbering for all MBBs.
unsigned num = 0; unsigned num = 0;
for (df_iterator<MachineDomTreeNode*> DI = df_begin(MDT.getRootNode()); for (df_iterator<MachineDomTreeNode*> DI = df_begin(MDT.getRootNode()),
DI != df_end(MDT.getRootNode()); ++DI) { DE = df_end(MDT.getRootNode()); DI != DE; ++DI) {
preorder[(*DI)->getBlock()] = num++; preorder[(*DI)->getBlock()] = num++;
rev_preorder.push_back((*DI)->getBlock()); rev_preorder.push_back((*DI)->getBlock());
} }
// Step 1: Compute the transitive closure of the CFG, ignoring backedges. // Step 1: Compute the transitive closure of the CFG, ignoring backedges.
for (po_iterator<MachineBasicBlock*> POI = po_begin(&*mf.begin()); for (po_iterator<MachineBasicBlock*> POI = po_begin(&*mf.begin()),
POI != po_end(&*mf.begin()); ++POI) { POE = po_end(&*mf.begin()); POI != POE; ++POI) {
MachineBasicBlock* MBB = *POI; MachineBasicBlock* MBB = *POI;
SparseBitVector<128>& entry = rv[MBB]; SparseBitVector<128>& entry = rv[MBB];
entry.set(preorder[MBB]); entry.set(preorder[MBB]);
for (MachineBasicBlock::succ_iterator SI = MBB->succ_begin(); for (MachineBasicBlock::succ_iterator SI = MBB->succ_begin(),
SI != MBB->succ_end(); ++SI) { SE = MBB->succ_end(); SI != SE; ++SI) {
DenseMap<MachineBasicBlock*, SparseBitVector<128> >::iterator SII = DenseMap<MachineBasicBlock*, SparseBitVector<128> >::iterator SII =
rv.find(*SI); rv.find(*SI);
@ -103,8 +103,8 @@ bool LazyLiveness::runOnMachineFunction(MachineFunction &mf) {
for (po_iterator<MachineBasicBlock*> POI = po_begin(&*mf.begin()), for (po_iterator<MachineBasicBlock*> POI = po_begin(&*mf.begin()),
POE = po_end(&*mf.begin()); POI != POE; ++POI) POE = po_end(&*mf.begin()); POI != POE; ++POI)
if (!backedge_target.test(preorder[*POI])) if (!backedge_target.test(preorder[*POI]))
for (MachineBasicBlock::succ_iterator SI = (*POI)->succ_begin(); for (MachineBasicBlock::succ_iterator SI = (*POI)->succ_begin(),
SI != (*POI)->succ_end(); ++SI) SE = (*POI)->succ_end(); SI != SE; ++SI)
if (!backedges.count(std::make_pair(*POI, *SI)) && tv.count(*SI)) { if (!backedges.count(std::make_pair(*POI, *SI)) && tv.count(*SI)) {
SparseBitVector<128>& PBV = tv[*POI]; SparseBitVector<128>& PBV = tv[*POI];
PBV = tv[*SI]; PBV = tv[*SI];
@ -123,11 +123,12 @@ bool LazyLiveness::vregLiveIntoMBB(unsigned vreg, MachineBasicBlock* MBB) {
MachineBasicBlock* DefMBB = MRI->def_begin(vreg)->getParent(); MachineBasicBlock* DefMBB = MRI->def_begin(vreg)->getParent();
unsigned def = preorder[DefMBB]; unsigned def = preorder[DefMBB];
unsigned max_dom = 0; unsigned max_dom = 0;
for (df_iterator<MachineDomTreeNode*> DI = df_begin(MDT[DefMBB]); for (df_iterator<MachineDomTreeNode*> DI = df_begin(MDT[DefMBB]),
DI != df_end(MDT[DefMBB]); ++DI) DE = df_end(MDT[DefMBB]); DI != DE; ++DI) {
if (preorder[DI->getBlock()] > max_dom) { if (preorder[DI->getBlock()] > max_dom) {
max_dom = preorder[(*DI)->getBlock()]; max_dom = preorder[(*DI)->getBlock()];
} }
}
if (preorder[MBB] <= def || max_dom < preorder[MBB]) if (preorder[MBB] <= def || max_dom < preorder[MBB])
return false; return false;
@ -135,16 +136,16 @@ bool LazyLiveness::vregLiveIntoMBB(unsigned vreg, MachineBasicBlock* MBB) {
SparseBitVector<128>::iterator I = tv[MBB].begin(); SparseBitVector<128>::iterator I = tv[MBB].begin();
while (I != tv[MBB].end() && *I <= def) ++I; while (I != tv[MBB].end() && *I <= def) ++I;
while (I != tv[MBB].end() && *I < max_dom) { while (I != tv[MBB].end() && *I < max_dom) {
for (MachineRegisterInfo::use_iterator UI = MRI->use_begin(vreg); for (MachineRegisterInfo::use_iterator UI = MRI->use_begin(vreg),
UI != MachineRegisterInfo::use_end(); ++UI) { UE = MachineRegisterInfo::use_end(); UI != UE; ++UI) {
MachineBasicBlock* UseMBB = UI->getParent(); MachineBasicBlock* UseMBB = UI->getParent();
if (rv[rev_preorder[*I]].test(preorder[UseMBB])) if (rv[rev_preorder[*I]].test(preorder[UseMBB]))
return true; return true;
unsigned t_dom = 0; unsigned t_dom = 0;
for (df_iterator<MachineDomTreeNode*> DI = for (df_iterator<MachineDomTreeNode*> DI =
df_begin(MDT[rev_preorder[*I]]); df_begin(MDT[rev_preorder[*I]]), DE = df_end(MDT[rev_preorder[*I]]);
DI != df_end(MDT[rev_preorder[*I]]); ++DI) DI != DE; ++DI)
if (preorder[DI->getBlock()] > t_dom) { if (preorder[DI->getBlock()] > t_dom) {
max_dom = preorder[(*DI)->getBlock()]; max_dom = preorder[(*DI)->getBlock()];
} }
@ -155,4 +156,3 @@ bool LazyLiveness::vregLiveIntoMBB(unsigned vreg, MachineBasicBlock* MBB) {
return false; return false;
} }