if (FAM)
updateNewSCCFunctionAnalyses(*C, G, AM, *FAM);
- for (SCC &NewC : llvm::reverse(make_range(std::next(NewSCCRange.begin()),
- NewSCCRange.end()))) {
+ for (SCC &NewC : llvm::reverse(llvm::drop_begin(NewSCCRange))) {
assert(C != &NewC && "No need to re-visit the current SCC!");
assert(OldC != &NewC && "Already handled the original SCC!");
UR.CWorklist.insert(&NewC);
// "bottom" we will continue processing in the bottom-up walk.
assert(NewRefSCCs.front() == RC &&
"New current RefSCC not first in the returned list!");
- for (RefSCC *NewRC : llvm::reverse(make_range(std::next(NewRefSCCs.begin()),
- NewRefSCCs.end()))) {
+ for (RefSCC *NewRC : llvm::reverse(llvm::drop_begin(NewRefSCCs))) {
assert(NewRC != RC && "Should not encounter the current RefSCC further "
"in the postorder list of new RefSCCs.");
UR.RCWorklist.insert(NewRC);
"JITDylibList entries must not be null");
OS << " (\"" << SearchOrder.front().first->getName() << "\", "
<< SearchOrder.begin()->second << ")";
- for (auto &KV :
- make_range(std::next(SearchOrder.begin(), 1), SearchOrder.end())) {
+ for (auto &KV : llvm::drop_begin(SearchOrder)) {
assert(KV.first && "JITDylibList entries must not be null");
OS << ", (\"" << KV.first->getName() << "\", " << KV.second << ")";
}
unsigned RetOpcode = MI->getOperand(0).getImm();
MCInst RetInst;
RetInst.setOpcode(RetOpcode);
- for (const auto &MO :
- make_range(std::next(MI->operands_begin()), MI->operands_end())) {
+ for (const auto &MO : llvm::drop_begin(MI->operands())) {
MCOperand MCOp;
if (LowerPPCMachineOperandToMCOperand(MO, MCOp, *this))
RetInst.addOperand(MCOp);
Offset1 *= -1;
// Create iterator ranges that skip the constant-factor.
- auto VariablesA = make_range(std::next(ADec.begin()), ADec.end());
- auto VariablesB = make_range(std::next(BDec.begin()), BDec.end());
+ auto VariablesA = llvm::drop_begin(ADec);
+ auto VariablesB = llvm::drop_begin(BDec);
// Make sure all variables have entries in Value2Index or NewIndices.
for (const auto &KV :