[llvm-commits] [llvm] r146053 - /llvm/trunk/lib/CodeGen/MachineBlockPlacement.cpp

Jakub Staszak kubastaszak at gmail.com
Wed Dec 7 11:46:10 PST 2011


Author: kuba
Date: Wed Dec  7 13:46:10 2011
New Revision: 146053

URL: http://llvm.org/viewvc/llvm-project?rev=146053&view=rev
Log:
Remove unneeded semicolon.
Skip two looking up at BlockChain.

Modified:
    llvm/trunk/lib/CodeGen/MachineBlockPlacement.cpp

Modified: llvm/trunk/lib/CodeGen/MachineBlockPlacement.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/CodeGen/MachineBlockPlacement.cpp?rev=146053&r1=146052&r2=146053&view=diff
==============================================================================
--- llvm/trunk/lib/CodeGen/MachineBlockPlacement.cpp (original)
+++ llvm/trunk/lib/CodeGen/MachineBlockPlacement.cpp Wed Dec  7 13:46:10 2011
@@ -530,7 +530,7 @@
     markChainSuccessors(SuccChain, LoopHeaderBB, BlockWorkList, BlockFilter);
     Chain.merge(BestSucc, &SuccChain);
     BB = *llvm::prior(Chain.end());
-  };
+  }
 
   DEBUG(dbgs() << "Finished forming chain for header block "
                << getBlockNum(*Chain.begin()) << "\n");
@@ -681,8 +681,8 @@
   // walk the blocks, and use a set to prevent visiting a particular chain
   // twice.
   SmallPtrSet<BlockChain *, 4> UpdatedPreds;
-  assert(BlockToChain[LayoutTop]->LoopPredecessors == 0);
-  UpdatedPreds.insert(BlockToChain[LayoutTop]);
+  assert(LoopChain.LoopPredecessors == 0);
+  UpdatedPreds.insert(&LoopChain);
   for (MachineLoop::block_iterator BI = L.block_begin(),
                                    BE = L.block_end();
        BI != BE; ++BI) {





More information about the llvm-commits mailing list