HomeSort by: relevance | last modified time | path
    Searched refs:Sorted (Results 1 - 6 of 6) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/MCTargetDesc/
MipsELFObjectWriter.cpp 446 std::list<MipsRelocationEntry> Sorted;
455 std::back_inserter(Sorted), [](const ELFRelocationEntry &Reloc) {
470 find_best(Sorted.begin(), Sorted.end(),
490 if (InsertionPoint != Sorted.end())
492 Sorted.insert(InsertionPoint, R)->Matched = true;
495 LLVM_DEBUG(dumpRelocs("S: ", Sorted));
497 assert(Relocs.size() == Sorted.size() && "Some relocs were not consumed");
499 // Overwrite the original vector with the sorted elements. The caller expects
502 for (const auto &R : reverse(Sorted))
    [all...]
  /src/external/apache2/llvm/dist/clang/tools/clang-offload-bundler/
ClangOffloadBundler.cpp 961 std::set<StringRef> Sorted;
963 Sorted.insert(E.first());
965 unsigned Last = Sorted.size() - 1;
966 for (auto &E : Sorted) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/ProfileData/
InstrProf.h 431 bool Sorted = false;
440 // efficiency) which needs to be sorted.
482 Sorted = false;
548 if (Sorted)
555 Sorted = true;
  /src/external/apache2/llvm/dist/llvm/lib/DWARFLinker/
DWARFLinker.cpp 1684 // together in the sorted output. There are a few corner cases that
2580 // Create a vector sorted in descending order by output size.
2581 std::vector<std::pair<StringRef, DebugInfoSize>> Sorted;
2583 Sorted.emplace_back(E.first(), E.second);
2584 llvm::sort(Sorted, [](auto &LHS, auto &RHS) {
2610 for (auto &E : Sorted) {
  /src/external/apache2/llvm/dist/libcxx/benchmarks/
map.bench.cpp 45 enum class Order { Sorted, Random };
47 static constexpr const char* Names[] = {"Sorted", "Random"};
  /src/external/apache2/llvm/dist/llvm/lib/ProfileData/
InstrProf.cpp 381 Sorted = false;

Completed in 75 milliseconds