Fix a tiny bug that caused an incorrect assertion failure poolallocating
authorChris Lattner <sabre@nondot.org>
Sat, 13 Mar 2004 01:14:23 +0000 (01:14 +0000)
committerChris Lattner <sabre@nondot.org>
Sat, 13 Mar 2004 01:14:23 +0000 (01:14 +0000)
boxed-sim.

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

lib/Analysis/DataStructure/DataStructure.cpp

index 34c8089710ca141b93df7713c0e17e91f051acca..eff432ead113171ed7eee31b49706039b1998024 100644 (file)
@@ -1970,10 +1970,12 @@ void DSGraph::computeNodeMapping(const DSNodeHandle &NH1,
   DSNodeHandle &Entry = NodeMap[N1];
   if (Entry.getNode()) {
     // Termination of recursion!
-    assert(!StrictChecking ||
-           (Entry.getNode() == N2 &&
-            Entry.getOffset() == (NH2.getOffset()-NH1.getOffset())) &&
-           "Inconsistent mapping detected!");
+    if (StrictChecking) {
+      assert(Entry.getNode() == N2 && "Inconsistent mapping detected!");
+      assert((Entry.getOffset() == (NH2.getOffset()-NH1.getOffset()) ||
+              Entry.getNode()->isNodeCompletelyFolded()) &&
+             "Inconsistent mapping detected!");
+    }
     return;
   }