From: Alina Sbirlea <asbirlea@google.com>
Date: Wed, 4 Sep 2019 00:44:54 +0000 (+0000)
Subject: [MemorySSA] Move two verify calls under expensive checks.
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=cfef9f7696e610f60dfc9b4d22b2eba24e841b6b;p=llvm

[MemorySSA] Move two verify calls under expensive checks.

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

diff --git a/lib/Analysis/MemorySSA.cpp b/lib/Analysis/MemorySSA.cpp
index ac95017af17..d41fe15fa07 100644
--- a/lib/Analysis/MemorySSA.cpp
+++ b/lib/Analysis/MemorySSA.cpp
@@ -1872,7 +1872,7 @@ void MemorySSA::verifyMemorySSA() const {
 }
 
 void MemorySSA::verifyPrevDefInPhis(Function &F) const {
-#ifndef NDEBUG
+#if !defined(NDEBUG) && defined(EXPENSIVE_CHECKS)
   for (const BasicBlock &BB : F) {
     if (MemoryPhi *Phi = getMemoryAccess(&BB)) {
       for (unsigned I = 0, E = Phi->getNumIncomingValues(); I != E; ++I) {
@@ -2048,7 +2048,7 @@ void MemorySSA::verifyUseInDefs(MemoryAccess *Def, MemoryAccess *Use) const {
 /// accesses and verifying that, for each use, it appears in the
 /// appropriate def's use list
 void MemorySSA::verifyDefUses(Function &F) const {
-#ifndef NDEBUG
+#if !defined(NDEBUG) && defined(EXPENSIVE_CHECKS)
   for (BasicBlock &B : F) {
     // Phi nodes are attached to basic blocks
     if (MemoryPhi *Phi = getMemoryAccess(&B)) {