diff options
| author | Chris Lattner <sabre@nondot.org> | 2003-06-28 21:58:28 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2003-06-28 21:58:28 +0000 |
| commit | 72d50a090fd315f7107005712353bb9c940e92bd (patch) | |
| tree | fe4d090f1e5d5d62c754f95e0364e7b2499d7d62 /lib/Analysis/DataStructure | |
| parent | 35de11f3b1b8847fa3e3e3c8eef21cfe816ad740 (diff) | |
| download | external_llvm-72d50a090fd315f7107005712353bb9c940e92bd.zip external_llvm-72d50a090fd315f7107005712353bb9c940e92bd.tar.gz external_llvm-72d50a090fd315f7107005712353bb9c940e92bd.tar.bz2 | |
Avoid double negatives
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@6945 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/DataStructure')
| -rw-r--r-- | lib/Analysis/DataStructure/DataStructure.cpp | 4 | ||||
| -rw-r--r-- | lib/Analysis/DataStructure/DataStructureAA.cpp | 2 |
2 files changed, 3 insertions, 3 deletions
diff --git a/lib/Analysis/DataStructure/DataStructure.cpp b/lib/Analysis/DataStructure/DataStructure.cpp index 2f64eb0..33c36c3 100644 --- a/lib/Analysis/DataStructure/DataStructure.cpp +++ b/lib/Analysis/DataStructure/DataStructure.cpp @@ -751,7 +751,7 @@ void DSGraph::mergeInGraph(DSCallSite &CS, const DSGraph &Graph, // 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 @@ void DSGraph::removeTriviallyDeadNodes() { 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 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 @@ AliasAnalysis::AliasResult DSAA::alias(const Value *V1, unsigned V1Size, 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. |