590     const IFListType &LL = I->second;  in dump_map()  local
591     for (unsigned i = 0, n = LL.size(); i < n; ++i)  in dump_map()
592       dbgs() << "    " << PrintIFR(LL[i].first, HRI) << ", "  in dump_map()
593              << PrintRegSet(LL[i].second, HRI) << '\n';  in dump_map()
870       const RSListType &LL = I->second;  in findRecordInsertForms()  local
871       for (unsigned i = 0, n = LL.size(); i < n; ++i)  in findRecordInsertForms()
872         dbgs() << " (" << printReg(LL[i].first, HRI) << ",@"  in findRecordInsertForms()
873                << LL[i].second << ')';  in findRecordInsertForms()
902       RSListType &LL = F->second;  in findRecordInsertForms()  local
903       for (unsigned i = 0, n = LL.size(); i < n; ++i) {  in findRecordInsertForms()
904         uint16_t S = LL[i].second;  in findRecordInsertForms()
915         unsigned InsR = LL[i].first;  in findRecordInsertForms()
1046     IFListType &LL = I->second;  in computeRemovableRegisters()  local
1047     for (unsigned i = 0, n = LL.size(); i < n; ++i)  in computeRemovableRegisters()
1048       findRemovableRegisters(I->first, LL[i].first, LL[i].second);  in computeRemovableRegisters()
1068   IFListType &LL = F->second;  in pruneCoveredSets()  local
1080   for (unsigned i = 0, n = LL.size(); i < n; ++i) {  in pruneCoveredSets()
1081     if (LL[i].second.empty())  in pruneCoveredSets()
1092     llvm::erase_if(LL, IsEmpty);  in pruneCoveredSets()
1099     IFRecord MaxIF = LL[0].first;  in pruneCoveredSets()
1100     for (unsigned i = 1, n = LL.size(); i < n; ++i) {  in pruneCoveredSets()
1102       const IFRecord &IF = LL[i].first;  in pruneCoveredSets()
1122     LL.clear();  in pruneCoveredSets()
1123     LL.push_back(std::make_pair(MaxIF, RegisterSet()));  in pruneCoveredSets()
1133   for (unsigned i = 0, n = LL.size(); i < n; ) {  in pruneCoveredSets()
1134     const RegisterSet &RMi = LL[i].second;  in pruneCoveredSets()
1137       if (j != i && LL[j].second.includes(RMi))  in pruneCoveredSets()
1145     LL.erase(LL.begin()+i);  in pruneCoveredSets()
1146     n = LL.size();  in pruneCoveredSets()
1154   IFListType &LL = F->second;  in pruneUsesTooFar()  local
1158   for (unsigned i = LL.size(); i > 0; --i) {  in pruneUsesTooFar()
1159     unsigned SR = LL[i-1].first.SrcR, IR = LL[i-1].first.InsR;  in pruneUsesTooFar()
1168     LL.erase(LL.begin()+(i-1));  in pruneUsesTooFar()
1175   IFListType &LL = F->second;  in pruneRegCopies()  local
1180   llvm::erase_if(LL, IsCopy);  in pruneRegCopies()
1291     const IFListType &LL = I->second;  in selectCandidates()  local
1293     for (unsigned i = 0, n = LL.size(); i < n; ++i)  in selectCandidates()
1294       TT.insert(LL[i].second);  in selectCandidates()
1328     IFListType &LL = I->second;  in selectCandidates()  local
1329     if (LL.empty())  in selectCandidates()
1335     IFListType::iterator MinI = std::min_element(LL.begin(), LL.end(), IFO);  in selectCandidates()
1336     assert(MinI != LL.end());  in selectCandidates()
1338     LL.clear();  in selectCandidates()
1371       LL.push_back(M);  in selectCandidates()
1380     const IFListType &LL = I->second;  in selectCandidates()  local
1381     if (!LL.empty())  in selectCandidates()
1382       AllRMs.insert(LL[0].second);  in selectCandidates()
1385     IFListType &LL = I->second;  in selectCandidates()  local
1386     if (LL.empty())  in selectCandidates()
1388     unsigned SR = LL[0].first.SrcR, IR = LL[0].first.InsR;  in selectCandidates()
1390       LL.clear();  in selectCandidates()