6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-02-12 03:32:10 +00:00
Code Issues Projects Releases Wiki Activity

Tidy up. Space before ':' in range-based for loops.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@205585 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Jim Grosbach 2014-04-03 23:43:26 +00:00
parent e1703660c4
commit 91ba0a9f61
5 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
lib/Target/ARM64/ARM64AddressTypePromotion.cpp
View File

@ -380,7 +380,7 @@ void ARM64AddressTypePromotion::mergeSExts(ValueToInsts &ValToSExtendedUses,
SetOfInstructions &ToRemove) {
DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
for (auto &Entry: ValToSExtendedUses) {
for (auto &Entry : ValToSExtendedUses) {
Instructions &Insts = Entry.second;
Instructions CurPts;
for (Instruction *Inst : Insts) {
@ -421,7 +421,7 @@ void ARM64AddressTypePromotion::analyzeSExtension(Instructions &SExtInsts) {
DenseMap<Value *, Instruction *> SeenChains;
for (auto &BB : *Func) {
for (auto &II: BB) {
for (auto &II : BB) {
Instruction *SExt = &II;
// Collect all sext operation per type.

2
lib/Target/ARM64/ARM64BranchRelaxation.cpp
View File

@ -120,7 +120,7 @@ void ARM64BranchRelaxation::verify() {
/// print block size and offset information - debugging
void ARM64BranchRelaxation::dumpBBs() {
for (auto &MBB: *MF) {
for (auto &MBB : *MF) {
const BasicBlockInfo &BBI = BlockInfo[MBB.getNumber()];
dbgs() << format("BB#%u\toffset=%08x\t", MBB.getNumber(), BBI.Offset)
<< format("size=%#x\n", BBI.Size);

4
lib/Target/ARM64/ARM64CollectLOH.cpp
View File

@ -650,7 +650,7 @@ static void computeADRP(const InstrToInstrs &UseToDefs,
ARM64FunctionInfo &ARM64FI,
const MachineDominatorTree *MDT) {
DEBUG(dbgs() << "*** Compute LOH for ADRP\n");
for (const auto &Entry: UseToDefs) {
for (const auto &Entry : UseToDefs) {
unsigned Size = Entry.second.size();
if (Size == 0)
continue;
@ -923,7 +923,7 @@ static void computeOthers(const InstrToInstrs &UseToDefs,
}
}
bool Found = false;
for (auto &Use: *Users) {
for (auto &Use : *Users) {
if (!DefsOfPotentialCandidates.count(Use)) {
++NumTooCplxLvl1;
Found = true;

4
lib/Target/ARM64/ARM64PromoteConstant.cpp
View File

@ -93,7 +93,7 @@ public:
bool runOnModule(Module &M) {
DEBUG(dbgs() << getPassName() << '\n');
bool Changed = false;
for (auto &MF: M) {
for (auto &MF : M) {
Changed |= runOnFunction(MF);
}
return Changed;
@ -566,7 +566,7 @@ bool ARM64PromoteConstant::runOnFunction(Function &F) {
SmallSet<Constant *, 8> AlreadyChecked;
for (auto &MBB : F) {
for (auto &MI: MBB) {
for (auto &MI : MBB) {
// Traverse the operand, looking for constant vectors
// Replace them by a load of a global variable of type constant vector
for (unsigned OpIdx = 0, EndOpIdx = MI.getNumOperands();

4
lib/Target/ARM64/ARM64StorePairSuppress.cpp
View File

@ -138,10 +138,10 @@ bool ARM64StorePairSuppress::runOnMachineFunction(MachineFunction &mf) {
// precisely determine whether a store pair can be formed. But we do want to
// filter out most situations where we can't form store pairs to avoid
// computing trace metrics in those cases.
for (auto &MBB: *MF) {
for (auto &MBB : *MF) {
bool SuppressSTP = false;
unsigned PrevBaseReg = 0;
for (auto &MI: MBB) {
for (auto &MI : MBB) {
if (!isNarrowFPStore(MI))
continue;
unsigned BaseReg;