@@ -1934,6 +1934,8 @@ void MemorySSA::verifyPrevDefInPhis(Function &F) const {
1934
1934
auto *LastAcc = &*(--DefList->end ());
1935
1935
assert (LastAcc == IncAcc &&
1936
1936
" Incorrect incoming access into phi." );
1937
+ (void )IncAcc;
1938
+ (void )LastAcc;
1937
1939
break ;
1938
1940
}
1939
1941
DTNode = DTNode->getIDom ();
@@ -1979,6 +1981,7 @@ void MemorySSA::verifyDominationNumbers(const Function &F) const {
1979
1981
unsigned long ThisNumber = ThisNumberIter->second ;
1980
1982
assert (ThisNumber > LastNumber &&
1981
1983
" Domination numbers should be strictly increasing!" );
1984
+ (void )LastNumber;
1982
1985
LastNumber = ThisNumber;
1983
1986
}
1984
1987
}
@@ -2009,8 +2012,10 @@ void MemorySSA::verifyOrderingDominationAndDefUses(Function &F,
2009
2012
ActualAccesses.push_back (Phi);
2010
2013
ActualDefs.push_back (Phi);
2011
2014
// Verify domination
2012
- for (const Use &U : Phi->uses ())
2015
+ for (const Use &U : Phi->uses ()) {
2013
2016
assert (dominates (Phi, U) && " Memory PHI does not dominate it's uses" );
2017
+ (void )U;
2018
+ }
2014
2019
// Verify def-uses for full verify.
2015
2020
if (VL == VerificationLevel::Full) {
2016
2021
assert (Phi->getNumOperands () == static_cast <unsigned >(std::distance (
@@ -2037,9 +2042,11 @@ void MemorySSA::verifyOrderingDominationAndDefUses(Function &F,
2037
2042
// Verify ordering.
2038
2043
ActualDefs.push_back (MA);
2039
2044
// Verify domination.
2040
- for (const Use &U : MD->uses ())
2045
+ for (const Use &U : MD->uses ()) {
2041
2046
assert (dominates (MD, U) &&
2042
2047
" Memory Def does not dominate it's uses" );
2048
+ (void )U;
2049
+ }
2043
2050
}
2044
2051
// Verify def-uses for full verify.
2045
2052
if (VL == VerificationLevel::Full)
0 commit comments