commit 72d50a090fd315f7107005712353bb9c940e92bd
author Chris Lattner <sabre@nondot.org> Sat Jun 28 21:58:28 2003 +0000
committer Chris Lattner <sabre@nondot.org> Sat Jun 28 21:58:28 2003 +0000
tree fe4d090f1e5d5d62c754f95e0364e7b2499d7d62
parent 35de11f3b1b8847fa3e3e3c8eef21cfe816ad740

Avoid double negatives


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

lib/Analysis/DataStructure/DataStructureAA.cpp

diff --git a/lib/Analysis/DataStructure/DataStructureAA.cpp b/lib/Analysis/DataStructure/DataStructureAA.cpp
index 3c89e6d..f39e2ad 100644
--- a/lib/Analysis/DataStructure/DataStructureAA.cpp
+++ b/lib/Analysis/DataStructure/DataStructureAA.cpp
@@ -90,7 +90,7 @@
         unsigned O1 = I->second.getOffset(), O2 = J->second.getOffset();
         
         // We can only make a judgement of one of the nodes is complete...
-        if (!N1->isIncomplete() || !N2->isIncomplete()) {
+        if (N1->isComplete() || N2->isComplete()) {
           if (N1 != N2)
             return NoAlias;   // Completely different nodes.