[llvm-commits] CVS: llvm/lib/Analysis/DataStructure/DataStructure.cpp DataStructureAA.cpp

[Chris Lattner]

Changes in directory llvm/lib/Analysis/DataStructure:

DataStructure.cpp updated: 1.101 -> 1.102
DataStructureAA.cpp updated: 1.5 -> 1.6

---
Log message:

Avoid double negatives


---
Diffs of the changes:

Index: llvm/lib/Analysis/DataStructure/DataStructure.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.101 llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.102
--- llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.101	Sat Jun 21 22:03:52 2003
+++ llvm/lib/Analysis/DataStructure/DataStructure.cpp	Sat Jun 28 16:58:28 2003
@@ -751,7 +751,7 @@
 //
 static void markIncompleteNode(DSNode *N) {
   // Stop recursion if no node, or if node already marked...
-  if (N == 0 || (N->isIncomplete())) return;
+  if (N == 0 || N->isIncomplete()) return;
 
   // Actually mark the node
   N->setIncompleteMarker();
@@ -917,7 +917,7 @@
 
   for (unsigned i = 0; i != Nodes.size(); ++i) {
     DSNode *Node = Nodes[i];
-    if (!Node->isIncomplete() && !Node->isModified() && !Node->isRead()) {
+    if (Node->isComplete() && !Node->isModified() && !Node->isRead()) {
       // This is a useless node if it has no mod/ref info (checked above),
       // outgoing edges (which it cannot, as it is not modified in this
       // context), and it has no incoming edges.  If it is a global node it may


Index: llvm/lib/Analysis/DataStructure/DataStructureAA.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructureAA.cpp:1.5 llvm/lib/Analysis/DataStructure/DataStructureAA.cpp:1.6
--- llvm/lib/Analysis/DataStructure/DataStructureAA.cpp:1.5	Sat Jun 21 22:03:52 2003
+++ llvm/lib/Analysis/DataStructure/DataStructureAA.cpp	Sat Jun 28 16:58:28 2003
@@ -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.