From b155c23f98e45bf5a1f5e6329b46e8138dfef9ce Mon Sep 17 00:00:00 2001 From: Rafael Espindola Date: Sat, 18 Feb 2012 19:46:02 +0000 Subject: White space fixes. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@150886 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/VMCore/Dominators.cpp | 14 +++++++------- 1 file changed, 7 insertions(+), 7 deletions(-) (limited to 'lib/VMCore/Dominators.cpp') diff --git a/lib/VMCore/Dominators.cpp b/lib/VMCore/Dominators.cpp index 08b845ef9d..d052f2455d 100644 --- a/lib/VMCore/Dominators.cpp +++ b/lib/VMCore/Dominators.cpp @@ -84,23 +84,23 @@ void DominatorTree::print(raw_ostream &OS, const Module *) const { // special checks necessary if A and B are in the same basic block. bool DominatorTree::dominates(const Instruction *A, const Instruction *B) const{ const BasicBlock *BBA = A->getParent(), *BBB = B->getParent(); - + // If A is an invoke instruction, its value is only available in this normal // successor block. if (const InvokeInst *II = dyn_cast(A)) BBA = II->getNormalDest(); - + if (BBA != BBB) return dominates(BBA, BBB); - - // It is not possible to determine dominance between two PHI nodes + + // It is not possible to determine dominance between two PHI nodes // based on their ordering. - if (isa(A) && isa(B)) + if (isa(A) && isa(B)) return false; - + // Loop through the basic block until we find A or B. BasicBlock::const_iterator I = BBA->begin(); for (; &*I != A && &*I != B; ++I) /*empty*/; - + return &*I == A; } -- cgit v1.2.3-18-g5258