diff options
author | Owen Anderson <resistor@mac.com> | 2007-04-15 23:14:18 +0000 |
---|---|---|
committer | Owen Anderson <resistor@mac.com> | 2007-04-15 23:14:18 +0000 |
commit | e934fefd6b6c83816e81bc86389cd593fb930773 (patch) | |
tree | 6445864e32f33f14016a7317227b4734dd2203a7 /lib/VMCore/Dominators.cpp | |
parent | 4575ab2186e5fbc3f572468ee0c9edfe55158ed0 (diff) | |
download | llvm-e934fefd6b6c83816e81bc86389cd593fb930773.tar.gz llvm-e934fefd6b6c83816e81bc86389cd593fb930773.tar.bz2 llvm-e934fefd6b6c83816e81bc86389cd593fb930773.tar.xz |
Tabs -> Spaces
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@36094 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/VMCore/Dominators.cpp')
-rw-r--r-- | lib/VMCore/Dominators.cpp | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/lib/VMCore/Dominators.cpp b/lib/VMCore/Dominators.cpp index 9685ed9efa..71eb3460e6 100644 --- a/lib/VMCore/Dominators.cpp +++ b/lib/VMCore/Dominators.cpp @@ -210,8 +210,8 @@ void DominatorTree::Link(BasicBlock *V, BasicBlock *W, InfoRec &WInfo){ } void DominatorTree::calculate(Function& F) { - BasicBlock* Root = Roots[0]; - + BasicBlock* Root = Roots[0]; + Nodes[Root] = RootNode = new Node(Root, 0); // Add a node for the root... Vertex.push_back(0); @@ -260,7 +260,7 @@ void DominatorTree::calculate(Function& F) { // Loop over all of the reachable blocks in the function... for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) if (BasicBlock *ImmDom = getIDom(I)) { // Reachable block. - Node *&BBNode = Nodes[I]; + Node *&BBNode = Nodes[I]; if (!BBNode) { // Haven't calculated this node yet? // Get or calculate the node for the immediate dominator Node *IDomNode = getNodeForBlock(ImmDom); @@ -273,7 +273,7 @@ void DominatorTree::calculate(Function& F) { // Free temporary memory used to construct idom's Info.clear(); - IDoms.clear(); + IDoms.clear(); std::vector<BasicBlock*>().swap(Vertex); } @@ -283,8 +283,8 @@ void DominatorTreeBase::reset() { for (NodeMapType::iterator I = Nodes.begin(), E = Nodes.end(); I != E; ++I) delete I->second; Nodes.clear(); - IDoms.clear(); - Roots.clear(); + IDoms.clear(); + Roots.clear(); RootNode = 0; } @@ -343,7 +343,7 @@ void DominatorTreeBase::print(std::ostream &o, const Module* ) const { bool DominatorTree::runOnFunction(Function &F) { reset(); // Reset from the last time we were run... - Roots.push_back(&F.getEntryBlock()); + Roots.push_back(&F.getEntryBlock()); calculate(F); return false; } |