Code cleanup [NFC]

The assertion here was more expensive then it needed to be.  We're only inserting allocas in the entry block, so we only need to consider ones in the entry block.



git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@233362 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Philip Reames 2015-03-27 05:53:16 +00:00
parent 1f768e83c0
commit 22660481b5

View File

@ -1391,14 +1391,13 @@ static void relocationViaAlloca(
Function &F, DominatorTree &DT, ArrayRef<Value *> live,
ArrayRef<struct PartiallyConstructedSafepointRecord> records) {
#ifndef NDEBUG
int initialAllocaNum = 0;
// record initial number of allocas
for (inst_iterator itr = inst_begin(F), end = inst_end(F); itr != end;
itr++) {
if (isa<AllocaInst>(*itr))
initialAllocaNum++;
}
// record initial number of (static) allocas; we'll check we have the same
// number when we get done.
int InitialAllocaNum = 0;
for (auto I = F.getEntryBlock().begin(), E = F.getEntryBlock().end();
I != E; I++)
if (isa<AllocaInst>(*I))
InitialAllocaNum++;
#endif
// TODO-PERF: change data structures, reserve
@ -1554,12 +1553,11 @@ static void relocationViaAlloca(
}
#ifndef NDEBUG
for (inst_iterator itr = inst_begin(F), end = inst_end(F); itr != end;
itr++) {
if (isa<AllocaInst>(*itr))
initialAllocaNum--;
}
assert(initialAllocaNum == 0 && "We must not introduce any extra allocas");
for (auto I = F.getEntryBlock().begin(), E = F.getEntryBlock().end();
I != E; I++)
if (isa<AllocaInst>(*I))
InitialAllocaNum--;
assert(InitialAllocaNum == 0 && "We must not introduce any extra allocas");
#endif
}