Lines Matching defs:Sorted

385   std::list<MipsRelocationEntry> Sorted;
388     Sorted.push_back(R);
390       Hi16.push_back(std::prev(Sorted.end()));
397     if (std::next(I) != Sorted.end() &&
407     auto Best = Sorted.end();
408     for (auto J = Sorted.begin(); J != Sorted.end(); ++J) {
412           (Best == Sorted.end() || R1.Addend < Best->R.Addend ||
416     if (Best != Sorted.end() && R.Addend == Best->R.Addend)
421     Sorted.splice(Best, Sorted, I);
424   assert(Relocs.size() == Sorted.size() && "Some relocs were not consumed");
428   for (const auto &R : Sorted)