From: Devang Patel <dpatel@apple.com>
Date: Tue, 12 Jun 2007 17:35:20 +0000 (+0000)
Subject: Remove redundant check.
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=de6e1320550bf3a6eb249155fcd14e9a0d84488e;p=oota-llvm.git

Remove redundant check.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37561 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/lib/VMCore/Dominators.cpp b/lib/VMCore/Dominators.cpp
index 35b2bbfc224..74c585fd6a4 100644
--- a/lib/VMCore/Dominators.cpp
+++ b/lib/VMCore/Dominators.cpp
@@ -380,13 +380,6 @@ BasicBlock *DominatorTreeBase::findNearestCommonDominator(BasicBlock *A,
   if (A == &Entry || B == &Entry)
     return &Entry;
 
-  // If A and B are same then A is nearest common dominator.
-  DomTreeNode *NodeA = getNode(A);
-  if (A != 0 && A == B)
-    return A;
-
-  DomTreeNode *NodeB = getNode(B);
-
   // If B dominates A then B is nearest common dominator.
   if (dominates(B,A))
     return B;
@@ -395,6 +388,9 @@ BasicBlock *DominatorTreeBase::findNearestCommonDominator(BasicBlock *A,
   if (dominates(A,B))
     return A;
 
+  DomTreeNode *NodeA = getNode(A);
+  DomTreeNode *NodeB = getNode(B);
+
   // Collect NodeA dominators set.
   SmallPtrSet<DomTreeNode*, 16> NodeADoms;
   NodeADoms.insert(NodeA);