mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-03 01:12:53 +00:00
CodeGen: Remove more ilist iterator implicit conversions, NFC
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@249879 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
d578a48c6d
commit
3f2c43f3c5
@ -462,11 +462,11 @@ bool IfConverter::ReverseBranchCondition(BBInfo &BBI) {
|
||||
/// getNextBlock - Returns the next block in the function blocks ordering. If
|
||||
/// it is the end, returns NULL.
|
||||
static inline MachineBasicBlock *getNextBlock(MachineBasicBlock *BB) {
|
||||
MachineFunction::iterator I = BB;
|
||||
MachineFunction::iterator I = BB->getIterator();
|
||||
MachineFunction::iterator E = BB->getParent()->end();
|
||||
if (++I == E)
|
||||
return nullptr;
|
||||
return I;
|
||||
return &*I;
|
||||
}
|
||||
|
||||
/// ValidSimple - Returns true if the 'true' block (along with its
|
||||
@ -530,10 +530,10 @@ bool IfConverter::ValidTriangle(BBInfo &TrueBBI, BBInfo &FalseBBI,
|
||||
|
||||
MachineBasicBlock *TExit = FalseBranch ? TrueBBI.FalseBB : TrueBBI.TrueBB;
|
||||
if (!TExit && blockAlwaysFallThrough(TrueBBI)) {
|
||||
MachineFunction::iterator I = TrueBBI.BB;
|
||||
MachineFunction::iterator I = TrueBBI.BB->getIterator();
|
||||
if (++I == TrueBBI.BB->getParent()->end())
|
||||
return false;
|
||||
TExit = I;
|
||||
TExit = &*I;
|
||||
}
|
||||
return TExit && TExit == FalseBBI.BB;
|
||||
}
|
||||
@ -948,10 +948,8 @@ void IfConverter::AnalyzeBlock(MachineBasicBlock *MBB,
|
||||
/// candidates.
|
||||
void IfConverter::AnalyzeBlocks(MachineFunction &MF,
|
||||
std::vector<IfcvtToken*> &Tokens) {
|
||||
for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I) {
|
||||
MachineBasicBlock *BB = I;
|
||||
AnalyzeBlock(BB, Tokens);
|
||||
}
|
||||
for (auto &BB : MF)
|
||||
AnalyzeBlock(&BB, Tokens);
|
||||
|
||||
// Sort to favor more complex ifcvt scheme.
|
||||
std::stable_sort(Tokens.begin(), Tokens.end(), IfcvtTokenCmp);
|
||||
@ -961,14 +959,14 @@ void IfConverter::AnalyzeBlocks(MachineFunction &MF,
|
||||
/// that all the intervening blocks are empty (given BB can fall through to its
|
||||
/// next block).
|
||||
static bool canFallThroughTo(MachineBasicBlock *BB, MachineBasicBlock *ToBB) {
|
||||
MachineFunction::iterator PI = BB;
|
||||
MachineFunction::iterator PI = BB->getIterator();
|
||||
MachineFunction::iterator I = std::next(PI);
|
||||
MachineFunction::iterator TI = ToBB;
|
||||
MachineFunction::iterator TI = ToBB->getIterator();
|
||||
MachineFunction::iterator E = BB->getParent()->end();
|
||||
while (I != TI) {
|
||||
// Check isSuccessor to avoid case where the next block is empty, but
|
||||
// it's not a successor.
|
||||
if (I == E || !I->empty() || !PI->isSuccessor(I))
|
||||
if (I == E || !I->empty() || !PI->isSuccessor(&*I))
|
||||
return false;
|
||||
PI = I++;
|
||||
}
|
||||
|
@ -144,7 +144,8 @@ void InterferenceCache::Entry::update(unsigned MBBNum) {
|
||||
PrevPos = Start;
|
||||
}
|
||||
|
||||
MachineFunction::const_iterator MFI = MF->getBlockNumbered(MBBNum);
|
||||
MachineFunction::const_iterator MFI =
|
||||
MF->getBlockNumbered(MBBNum)->getIterator();
|
||||
BlockInterference *BI = &Blocks[MBBNum];
|
||||
ArrayRef<SlotIndex> RegMaskSlots;
|
||||
ArrayRef<const uint32_t*> RegMaskBits;
|
||||
|
@ -75,7 +75,7 @@ static CallInst *ReplaceCallWith(const char *NewFn, CallInst *CI,
|
||||
Constant* FCache = M->getOrInsertFunction(NewFn,
|
||||
FunctionType::get(RetTy, ParamTys, false));
|
||||
|
||||
IRBuilder<> Builder(CI->getParent(), CI);
|
||||
IRBuilder<> Builder(CI->getParent(), CI->getIterator());
|
||||
SmallVector<Value *, 8> Args(ArgBegin, ArgEnd);
|
||||
CallInst *NewCI = Builder.CreateCall(FCache, Args);
|
||||
NewCI->setName(CI->getName());
|
||||
@ -167,8 +167,8 @@ static Value *LowerBSWAP(LLVMContext &Context, Value *V, Instruction *IP) {
|
||||
assert(V->getType()->isIntegerTy() && "Can't bswap a non-integer type!");
|
||||
|
||||
unsigned BitSize = V->getType()->getPrimitiveSizeInBits();
|
||||
|
||||
IRBuilder<> Builder(IP->getParent(), IP);
|
||||
|
||||
IRBuilder<> Builder(IP);
|
||||
|
||||
switch(BitSize) {
|
||||
default: llvm_unreachable("Unhandled type size of value to byteswap!");
|
||||
@ -268,7 +268,7 @@ static Value *LowerCTPOP(LLVMContext &Context, Value *V, Instruction *IP) {
|
||||
0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL
|
||||
};
|
||||
|
||||
IRBuilder<> Builder(IP->getParent(), IP);
|
||||
IRBuilder<> Builder(IP);
|
||||
|
||||
unsigned BitSize = V->getType()->getPrimitiveSizeInBits();
|
||||
unsigned WordSize = (BitSize + 63) / 64;
|
||||
@ -301,7 +301,7 @@ static Value *LowerCTPOP(LLVMContext &Context, Value *V, Instruction *IP) {
|
||||
/// instruction IP.
|
||||
static Value *LowerCTLZ(LLVMContext &Context, Value *V, Instruction *IP) {
|
||||
|
||||
IRBuilder<> Builder(IP->getParent(), IP);
|
||||
IRBuilder<> Builder(IP);
|
||||
|
||||
unsigned BitSize = V->getType()->getPrimitiveSizeInBits();
|
||||
for (unsigned i = 1; i < BitSize; i <<= 1) {
|
||||
@ -338,7 +338,7 @@ static void ReplaceFPIntrinsicWithCall(CallInst *CI, const char *Fname,
|
||||
}
|
||||
|
||||
void IntrinsicLowering::LowerIntrinsicCall(CallInst *CI) {
|
||||
IRBuilder<> Builder(CI->getParent(), CI);
|
||||
IRBuilder<> Builder(CI);
|
||||
LLVMContext &Context = CI->getContext();
|
||||
|
||||
const Function *Callee = CI->getCalledFunction();
|
||||
|
@ -512,7 +512,7 @@ bool LDVImpl::collectDebugValues(MachineFunction &mf) {
|
||||
bool Changed = false;
|
||||
for (MachineFunction::iterator MFI = mf.begin(), MFE = mf.end(); MFI != MFE;
|
||||
++MFI) {
|
||||
MachineBasicBlock *MBB = MFI;
|
||||
MachineBasicBlock *MBB = &*MFI;
|
||||
for (MachineBasicBlock::iterator MBBI = MBB->begin(), MBBE = MBB->end();
|
||||
MBBI != MBBE;) {
|
||||
if (!MBBI->isDebugValue()) {
|
||||
@ -1004,11 +1004,11 @@ void UserValue::emitDebugValues(VirtRegMap *VRM, LiveIntervals &LIS,
|
||||
SlotIndex Stop = I.stop();
|
||||
unsigned LocNo = I.value();
|
||||
DEBUG(dbgs() << "\t[" << Start << ';' << Stop << "):" << LocNo);
|
||||
MachineFunction::iterator MBB = LIS.getMBBFromIndex(Start);
|
||||
SlotIndex MBBEnd = LIS.getMBBEndIdx(MBB);
|
||||
MachineFunction::iterator MBB = LIS.getMBBFromIndex(Start)->getIterator();
|
||||
SlotIndex MBBEnd = LIS.getMBBEndIdx(&*MBB);
|
||||
|
||||
DEBUG(dbgs() << " BB#" << MBB->getNumber() << '-' << MBBEnd);
|
||||
insertDebugValue(MBB, Start, LocNo, LIS, TII);
|
||||
insertDebugValue(&*MBB, Start, LocNo, LIS, TII);
|
||||
// This interval may span multiple basic blocks.
|
||||
// Insert a DBG_VALUE into each one.
|
||||
while(Stop > MBBEnd) {
|
||||
@ -1016,9 +1016,9 @@ void UserValue::emitDebugValues(VirtRegMap *VRM, LiveIntervals &LIS,
|
||||
Start = MBBEnd;
|
||||
if (++MBB == MFEnd)
|
||||
break;
|
||||
MBBEnd = LIS.getMBBEndIdx(MBB);
|
||||
MBBEnd = LIS.getMBBEndIdx(&*MBB);
|
||||
DEBUG(dbgs() << " BB#" << MBB->getNumber() << '-' << MBBEnd);
|
||||
insertDebugValue(MBB, Start, LocNo, LIS, TII);
|
||||
insertDebugValue(&*MBB, Start, LocNo, LIS, TII);
|
||||
}
|
||||
DEBUG(dbgs() << '\n');
|
||||
if (MBB == MFEnd)
|
||||
|
@ -224,7 +224,7 @@ void LiveIntervals::computeRegMasks() {
|
||||
// Find all instructions with regmask operands.
|
||||
for (MachineFunction::iterator MBBI = MF->begin(), E = MF->end();
|
||||
MBBI != E; ++MBBI) {
|
||||
MachineBasicBlock *MBB = MBBI;
|
||||
MachineBasicBlock *MBB = &*MBBI;
|
||||
std::pair<unsigned, unsigned> &RMB = RegMaskBlocks[MBB->getNumber()];
|
||||
RMB.first = RegMaskSlots.size();
|
||||
for (MachineBasicBlock::iterator MI = MBB->begin(), ME = MBB->end();
|
||||
@ -302,7 +302,7 @@ void LiveIntervals::computeLiveInRegUnits() {
|
||||
// Check all basic blocks for live-ins.
|
||||
for (MachineFunction::const_iterator MFI = MF->begin(), MFE = MF->end();
|
||||
MFI != MFE; ++MFI) {
|
||||
const MachineBasicBlock *MBB = MFI;
|
||||
const MachineBasicBlock *MBB = &*MFI;
|
||||
|
||||
// We only care about ABI blocks: Entry + landing pads.
|
||||
if ((MFI != MF->begin() && !MBB->isEHPad()) || MBB->livein_empty())
|
||||
|
@ -637,7 +637,7 @@ bool LiveVariables::runOnMachineFunction(MachineFunction &mf) {
|
||||
// function. This guarantees that we will see the definition of a virtual
|
||||
// register before its uses due to dominance properties of SSA (except for PHI
|
||||
// nodes, which are treated as a special case).
|
||||
MachineBasicBlock *Entry = MF->begin();
|
||||
MachineBasicBlock *Entry = &MF->front();
|
||||
SmallPtrSet<MachineBasicBlock*,16> Visited;
|
||||
|
||||
for (MachineBasicBlock *MBB : depth_first_ext(Entry, Visited)) {
|
||||
|
@ -325,7 +325,7 @@ bool LocalStackSlotPass::insertFrameReferenceRegisters(MachineFunction &Fn) {
|
||||
// Sort the frame references by local offset
|
||||
array_pod_sort(FrameReferenceInsns.begin(), FrameReferenceInsns.end());
|
||||
|
||||
MachineBasicBlock *Entry = Fn.begin();
|
||||
MachineBasicBlock *Entry = &Fn.front();
|
||||
|
||||
unsigned BaseReg = 0;
|
||||
int64_t BaseOffset = 0;
|
||||
|
Loading…
Reference in New Issue
Block a user