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 | 856a6cbb8081b9a99443cd51a65050b90906590a (patch) | |
| tree | 3777d63a32278c7dac573304e33d822effb33eab /llvm/lib/Analysis/DataStructure/DataStructure.cpp | |
| parent | fb9e684f5c3172e08074b7b107d7b037d920a233 (diff) | |
| download | bcm5719-llvm-856a6cbb8081b9a99443cd51a65050b90906590a.tar.gz bcm5719-llvm-856a6cbb8081b9a99443cd51a65050b90906590a.zip | |
Avoid double negatives
llvm-svn: 6945
Diffstat (limited to 'llvm/lib/Analysis/DataStructure/DataStructure.cpp')
| -rw-r--r-- | llvm/lib/Analysis/DataStructure/DataStructure.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/llvm/lib/Analysis/DataStructure/DataStructure.cpp b/llvm/lib/Analysis/DataStructure/DataStructure.cpp index 2f64eb074ce..33c36c38e70 100644 --- a/llvm/lib/Analysis/DataStructure/DataStructure.cpp +++ b/llvm/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 |
