aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Transforms/Scalar/BasicBlockPlacement.cpp
diff options
context:
space:
mode:
authorMisha Brukman <brukman+llvm@gmail.com>2005-04-21 23:48:37 +0000
committerMisha Brukman <brukman+llvm@gmail.com>2005-04-21 23:48:37 +0000
commitb1c9317bb416944ff2b491b20ca28e2241a5f51f (patch)
treecf2fc5d20be5053bf0ca3ac2f4432d612701ef47 /llvm/lib/Transforms/Scalar/BasicBlockPlacement.cpp
parentc88330ad137fc6e1210a6533e0686d5afd77c3fd (diff)
downloadllvm-b1c9317bb416944ff2b491b20ca28e2241a5f51f.zip
llvm-b1c9317bb416944ff2b491b20ca28e2241a5f51f.tar.gz
llvm-b1c9317bb416944ff2b491b20ca28e2241a5f51f.tar.bz2
Remove trailing whitespace
llvm-svn: 21427
Diffstat (limited to 'llvm/lib/Transforms/Scalar/BasicBlockPlacement.cpp')
-rw-r--r--llvm/lib/Transforms/Scalar/BasicBlockPlacement.cpp14
1 files changed, 7 insertions, 7 deletions
diff --git a/llvm/lib/Transforms/Scalar/BasicBlockPlacement.cpp b/llvm/lib/Transforms/Scalar/BasicBlockPlacement.cpp
index ec31bbf..c926c56 100644
--- a/llvm/lib/Transforms/Scalar/BasicBlockPlacement.cpp
+++ b/llvm/lib/Transforms/Scalar/BasicBlockPlacement.cpp
@@ -1,10 +1,10 @@
//===-- BasicBlockPlacement.cpp - Basic Block Code Layout optimization ----===//
-//
+//
// The LLVM Compiler Infrastructure
//
// This file was developed by the LLVM research group and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
-//
+//
//===----------------------------------------------------------------------===//
//
// This file implements a very simple profile guided basic block placement
@@ -37,7 +37,7 @@ using namespace llvm;
namespace {
Statistic<> NumMoved("block-placement", "Number of basic blocks moved");
-
+
struct BlockPlacement : public FunctionPass {
virtual bool runOnFunction(Function &F);
@@ -78,11 +78,11 @@ bool BlockPlacement::runOnFunction(Function &F) {
PI = &getAnalysis<ProfileInfo>();
NumMovedBlocks = 0;
- InsertPos = F.begin();
+ InsertPos = F.begin();
// Recursively place all blocks.
PlaceBlocks(F.begin());
-
+
PlacedBlocks.clear();
NumMoved += NumMovedBlocks;
return NumMovedBlocks != 0;
@@ -115,12 +115,12 @@ void BlockPlacement::PlaceBlocks(BasicBlock *BB) {
while (1) {
// Okay, now place any unplaced successors.
succ_iterator SI = succ_begin(BB), E = succ_end(BB);
-
+
// Scan for the first unplaced successor.
for (; SI != E && PlacedBlocks.count(*SI); ++SI)
/*empty*/;
if (SI == E) return; // No more successors to place.
-
+
unsigned MaxExecutionCount = PI->getExecutionCount(*SI);
BasicBlock *MaxSuccessor = *SI;