mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-22 10:42:39 +01:00
Fix some -Wunused-but-set-variable in -DLLVM_ENABLE_ASSERTIONS=off build
This commit is contained in:
parent
c39b2d8e2d
commit
0d92547dcb
@ -1191,6 +1191,7 @@ void BranchProbabilityInfo::setEdgeProbability(
|
|||||||
// should be within Probs.size / BranchProbability::getDenominator.
|
// should be within Probs.size / BranchProbability::getDenominator.
|
||||||
assert(TotalNumerator <= BranchProbability::getDenominator() + Probs.size());
|
assert(TotalNumerator <= BranchProbability::getDenominator() + Probs.size());
|
||||||
assert(TotalNumerator >= BranchProbability::getDenominator() - Probs.size());
|
assert(TotalNumerator >= BranchProbability::getDenominator() - Probs.size());
|
||||||
|
(void)TotalNumerator;
|
||||||
}
|
}
|
||||||
|
|
||||||
void BranchProbabilityInfo::copyEdgeProbabilities(BasicBlock *Src,
|
void BranchProbabilityInfo::copyEdgeProbabilities(BasicBlock *Src,
|
||||||
|
@ -9177,6 +9177,7 @@ bool LLParser::parseOptionalParamAccesses(
|
|||||||
return true;
|
return true;
|
||||||
CallsNum += ParamAccess.Calls.size();
|
CallsNum += ParamAccess.Calls.size();
|
||||||
assert(VContexts.size() == CallsNum);
|
assert(VContexts.size() == CallsNum);
|
||||||
|
(void)CallsNum;
|
||||||
Params.emplace_back(std::move(ParamAccess));
|
Params.emplace_back(std::move(ParamAccess));
|
||||||
} while (EatIfPresent(lltok::comma));
|
} while (EatIfPresent(lltok::comma));
|
||||||
|
|
||||||
|
@ -2577,6 +2577,7 @@ bool X86FastISel::TryEmitSmallMemcpy(X86AddressMode DestAM,
|
|||||||
bool RV = X86FastEmitLoad(VT, SrcAM, nullptr, Reg);
|
bool RV = X86FastEmitLoad(VT, SrcAM, nullptr, Reg);
|
||||||
RV &= X86FastEmitStore(VT, Reg, DestAM);
|
RV &= X86FastEmitStore(VT, Reg, DestAM);
|
||||||
assert(RV && "Failed to emit load or store??");
|
assert(RV && "Failed to emit load or store??");
|
||||||
|
(void)RV;
|
||||||
|
|
||||||
unsigned Size = VT.getSizeInBits()/8;
|
unsigned Size = VT.getSizeInBits()/8;
|
||||||
Len -= Size;
|
Len -= Size;
|
||||||
|
@ -234,6 +234,7 @@ ICallPromotionFunc::getPromotionCandidatesForCallSite(
|
|||||||
for (uint32_t I = 0; I < NumCandidates; I++) {
|
for (uint32_t I = 0; I < NumCandidates; I++) {
|
||||||
uint64_t Count = ValueDataRef[I].Count;
|
uint64_t Count = ValueDataRef[I].Count;
|
||||||
assert(Count <= TotalCount);
|
assert(Count <= TotalCount);
|
||||||
|
(void)TotalCount;
|
||||||
uint64_t Target = ValueDataRef[I].Value;
|
uint64_t Target = ValueDataRef[I].Value;
|
||||||
LLVM_DEBUG(dbgs() << " Candidate " << I << " Count=" << Count
|
LLVM_DEBUG(dbgs() << " Candidate " << I << " Count=" << Count
|
||||||
<< " Target_func: " << Target << "\n");
|
<< " Target_func: " << Target << "\n");
|
||||||
|
@ -637,6 +637,7 @@ bool LoopRotate::rotateLoop(Loop *L, bool SimplifiedLatch) {
|
|||||||
}
|
}
|
||||||
assert(SplitLatchEdge &&
|
assert(SplitLatchEdge &&
|
||||||
"Despite splitting all preds, failed to split latch exit?");
|
"Despite splitting all preds, failed to split latch exit?");
|
||||||
|
(void)SplitLatchEdge;
|
||||||
} else {
|
} else {
|
||||||
// We can fold the conditional branch in the preheader, this makes things
|
// 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.
|
// simpler. The first step is to remove the extra edge to the Exit block.
|
||||||
|
@ -742,6 +742,7 @@ void DisassemblerTables::emitModRMDecision(raw_ostream &o1, raw_ostream &o2,
|
|||||||
// We assume that the index can fit into uint16_t.
|
// We assume that the index can fit into uint16_t.
|
||||||
assert(sEntryNumber < 65536U &&
|
assert(sEntryNumber < 65536U &&
|
||||||
"Index into ModRMDecision is too large for uint16_t!");
|
"Index into ModRMDecision is too large for uint16_t!");
|
||||||
|
(void)sEntryNumber;
|
||||||
|
|
||||||
++sTableNumber;
|
++sTableNumber;
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user