// should be within Probs.size / BranchProbability::getDenominator.
assert(TotalNumerator <= BranchProbability::getDenominator() + Probs.size());
assert(TotalNumerator >= BranchProbability::getDenominator() - Probs.size());
+ (void)TotalNumerator;
}
void BranchProbabilityInfo::copyEdgeProbabilities(BasicBlock *Src,
return true;
CallsNum += ParamAccess.Calls.size();
assert(VContexts.size() == CallsNum);
+ (void)CallsNum;
Params.emplace_back(std::move(ParamAccess));
} while (EatIfPresent(lltok::comma));
bool RV = X86FastEmitLoad(VT, SrcAM, nullptr, Reg);
RV &= X86FastEmitStore(VT, Reg, DestAM);
assert(RV && "Failed to emit load or store??");
+ (void)RV;
unsigned Size = VT.getSizeInBits()/8;
Len -= Size;
for (uint32_t I = 0; I < NumCandidates; I++) {
uint64_t Count = ValueDataRef[I].Count;
assert(Count <= TotalCount);
+ (void)TotalCount;
uint64_t Target = ValueDataRef[I].Value;
LLVM_DEBUG(dbgs() << " Candidate " << I << " Count=" << Count
<< " Target_func: " << Target << "\n");
}
assert(SplitLatchEdge &&
"Despite splitting all preds, failed to split latch exit?");
+ (void)SplitLatchEdge;
} else {
// We can fold the conditional branch in the preheader, this makes things
// simpler. The first step is to remove the extra edge to the Exit block.
// We assume that the index can fit into uint16_t.
assert(sEntryNumber < 65536U &&
"Index into ModRMDecision is too large for uint16_t!");
+ (void)sEntryNumber;
++sTableNumber;
}