RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-12-12 14:17:59 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Avoid double negatives

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@6945 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-06-28 21:58:28 +00:00
parent 35de11f3b1
commit 72d50a090f
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
lib/Analysis/DataStructure/DataStructure.cpp
View File

@ -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

2
lib/Analysis/DataStructure/DataStructureAA.cpp
View File

@ -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.