543     const IFListType &LL = I->second;  in dump_map()  local
544     for (unsigned i = 0, n = LL.size(); i < n; ++i)  in dump_map()
545       dbgs() << "    " << PrintIFR(LL[i].first, HRI) << ", "  in dump_map()
546              << PrintRegSet(LL[i].second, HRI) << '\n';  in dump_map()
827       const RSListType &LL = I->second;  in findRecordInsertForms()  local
828       for (unsigned i = 0, n = LL.size(); i < n; ++i)  in findRecordInsertForms()
829         dbgs() << " (" << PrintReg(LL[i].first, HRI) << ",@"  in findRecordInsertForms()
830                << LL[i].second << ')';  in findRecordInsertForms()
860       RSListType &LL = F->second;  in findRecordInsertForms()  local
861       for (unsigned i = 0, n = LL.size(); i < n; ++i) {  in findRecordInsertForms()
862         uint16_t S = LL[i].second;  in findRecordInsertForms()
873         unsigned InsR = LL[i].first;  in findRecordInsertForms()
1007     IFListType &LL = I->second;  in computeRemovableRegisters()  local
1008     for (unsigned i = 0, n = LL.size(); i < n; ++i)  in computeRemovableRegisters()
1009       findRemovableRegisters(I->first, LL[i].first, LL[i].second);  in computeRemovableRegisters()
1031   IFListType &LL = F->second;  in pruneCoveredSets()  local
1043   for (unsigned i = 0, n = LL.size(); i < n; ++i) {  in pruneCoveredSets()
1044     if (LL[i].second.empty())  in pruneCoveredSets()
1055     auto End = std::remove_if(LL.begin(), LL.end(), IsEmpty);  in pruneCoveredSets()
1056     if (End != LL.end())  in pruneCoveredSets()
1057       LL.erase(End, LL.end());  in pruneCoveredSets()
1064     IFRecord MaxIF = LL[0].first;  in pruneCoveredSets()
1065     for (unsigned i = 1, n = LL.size(); i < n; ++i) {  in pruneCoveredSets()
1067       const IFRecord &IF = LL[i].first;  in pruneCoveredSets()
1087     LL.clear();  in pruneCoveredSets()
1088     LL.push_back(std::make_pair(MaxIF, RegisterSet()));  in pruneCoveredSets()
1098   for (unsigned i = 0, n = LL.size(); i < n; ) {  in pruneCoveredSets()
1099     const RegisterSet &RMi = LL[i].second;  in pruneCoveredSets()
1102       if (j != i && LL[j].second.includes(RMi))  in pruneCoveredSets()
1110     LL.erase(LL.begin()+i);  in pruneCoveredSets()
1111     n = LL.size();  in pruneCoveredSets()
1120   IFListType &LL = F->second;  in pruneUsesTooFar()  local
1124   for (unsigned i = LL.size(); i > 0; --i) {  in pruneUsesTooFar()
1125     unsigned SR = LL[i-1].first.SrcR, IR = LL[i-1].first.InsR;  in pruneUsesTooFar()
1134     LL.erase(LL.begin()+(i-1));  in pruneUsesTooFar()
1142   IFListType &LL = F->second;  in pruneRegCopies()  local
1147   auto End = std::remove_if(LL.begin(), LL.end(), IsCopy);  in pruneRegCopies()
1148   if (End != LL.end())  in pruneRegCopies()
1149     LL.erase(End, LL.end());  in pruneRegCopies()
1258     const IFListType &LL = I->second;  in selectCandidates()  local
1260     for (unsigned i = 0, n = LL.size(); i < n; ++i)  in selectCandidates()
1261       TT.insert(LL[i].second);  in selectCandidates()
1295     IFListType &LL = I->second;  in selectCandidates()  local
1296     if (LL.empty())  in selectCandidates()
1302     IFListType::iterator MinI = std::min_element(LL.begin(), LL.end(), IFO);  in selectCandidates()
1303     assert(MinI != LL.end());  in selectCandidates()
1305     LL.clear();  in selectCandidates()
1338       LL.push_back(M);  in selectCandidates()
1347     const IFListType &LL = I->second;  in selectCandidates()  local
1348     if (LL.size() > 0)  in selectCandidates()
1349       AllRMs.insert(LL[0].second);  in selectCandidates()
1352     IFListType &LL = I->second;  in selectCandidates()  local
1353     if (LL.size() == 0)  in selectCandidates()
1355     unsigned SR = LL[0].first.SrcR, IR = LL[0].first.InsR;  in selectCandidates()
1357       LL.clear();  in selectCandidates()