545     const IFListType &LL = I->second;  in dump_map()  local
546     for (unsigned i = 0, n = LL.size(); i < n; ++i)  in dump_map()
547       dbgs() << "    " << PrintIFR(LL[i].first, HRI) << ", "  in dump_map()
548              << PrintRegSet(LL[i].second, HRI) << '\n';  in dump_map()
829       const RSListType &LL = I->second;  in findRecordInsertForms()  local
830       for (unsigned i = 0, n = LL.size(); i < n; ++i)  in findRecordInsertForms()
831         dbgs() << " (" << PrintReg(LL[i].first, HRI) << ",@"  in findRecordInsertForms()
832                << LL[i].second << ')';  in findRecordInsertForms()
862       RSListType &LL = F->second;  in findRecordInsertForms()  local
863       for (unsigned i = 0, n = LL.size(); i < n; ++i) {  in findRecordInsertForms()
864         uint16_t S = LL[i].second;  in findRecordInsertForms()
875         unsigned InsR = LL[i].first;  in findRecordInsertForms()
1009     IFListType &LL = I->second;  in computeRemovableRegisters()  local
1010     for (unsigned i = 0, n = LL.size(); i < n; ++i)  in computeRemovableRegisters()
1011       findRemovableRegisters(I->first, LL[i].first, LL[i].second);  in computeRemovableRegisters()
1033   IFListType &LL = F->second;  in pruneCoveredSets()  local
1045   for (unsigned i = 0, n = LL.size(); i < n; ++i) {  in pruneCoveredSets()
1046     if (LL[i].second.empty())  in pruneCoveredSets()
1057     auto End = std::remove_if(LL.begin(), LL.end(), IsEmpty);  in pruneCoveredSets()
1058     if (End != LL.end())  in pruneCoveredSets()
1059       LL.erase(End, LL.end());  in pruneCoveredSets()
1066     IFRecord MaxIF = LL[0].first;  in pruneCoveredSets()
1067     for (unsigned i = 1, n = LL.size(); i < n; ++i) {  in pruneCoveredSets()
1069       const IFRecord &IF = LL[i].first;  in pruneCoveredSets()
1089     LL.clear();  in pruneCoveredSets()
1090     LL.push_back(std::make_pair(MaxIF, RegisterSet()));  in pruneCoveredSets()
1100   for (unsigned i = 0, n = LL.size(); i < n; ) {  in pruneCoveredSets()
1101     const RegisterSet &RMi = LL[i].second;  in pruneCoveredSets()
1104       if (j != i && LL[j].second.includes(RMi))  in pruneCoveredSets()
1112     LL.erase(LL.begin()+i);  in pruneCoveredSets()
1113     n = LL.size();  in pruneCoveredSets()
1122   IFListType &LL = F->second;  in pruneUsesTooFar()  local
1126   for (unsigned i = LL.size(); i > 0; --i) {  in pruneUsesTooFar()
1127     unsigned SR = LL[i-1].first.SrcR, IR = LL[i-1].first.InsR;  in pruneUsesTooFar()
1136     LL.erase(LL.begin()+(i-1));  in pruneUsesTooFar()
1144   IFListType &LL = F->second;  in pruneRegCopies()  local
1149   auto End = std::remove_if(LL.begin(), LL.end(), IsCopy);  in pruneRegCopies()
1150   if (End != LL.end())  in pruneRegCopies()
1151     LL.erase(End, LL.end());  in pruneRegCopies()
1260     const IFListType &LL = I->second;  in selectCandidates()  local
1262     for (unsigned i = 0, n = LL.size(); i < n; ++i)  in selectCandidates()
1263       TT.insert(LL[i].second);  in selectCandidates()
1297     IFListType &LL = I->second;  in selectCandidates()  local
1298     if (LL.empty())  in selectCandidates()
1304     IFListType::iterator MinI = std::min_element(LL.begin(), LL.end(), IFO);  in selectCandidates()
1305     assert(MinI != LL.end());  in selectCandidates()
1307     LL.clear();  in selectCandidates()
1340       LL.push_back(M);  in selectCandidates()
1349     const IFListType &LL = I->second;  in selectCandidates()  local
1350     if (LL.size() > 0)  in selectCandidates()
1351       AllRMs.insert(LL[0].second);  in selectCandidates()
1354     IFListType &LL = I->second;  in selectCandidates()  local
1355     if (LL.size() == 0)  in selectCandidates()
1357     unsigned SR = LL[0].first.SrcR, IR = LL[0].first.InsR;  in selectCandidates()
1359       LL.clear();  in selectCandidates()