Searched refs:Sorted (Results 1 – 12 of 12) sorted by relevance
| /openbsd/src/gnu/llvm/llvm/lib/Target/Mips/MCTargetDesc/ |
| D | MipsELFObjectWriter.cpp | 448 std::list<MipsRelocationEntry> Sorted; in sortRelocs() local
457 std::back_inserter(Sorted), [](const ELFRelocationEntry &Reloc) { in sortRelocs()
472 find_best(Sorted.begin(), Sorted.end(), in sortRelocs()
492 if (InsertionPoint != Sorted.end()) in sortRelocs()
494 Sorted.insert(InsertionPoint, R)->Matched = true; in sortRelocs()
497 LLVM_DEBUG(dumpRelocs("S: ", Sorted)); in sortRelocs()
499 assert(Relocs.size() == Sorted.size() && "Some relocs were not consumed"); in sortRelocs()
504 for (const auto &R : reverse(Sorted)) in sortRelocs()
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/ProfileData/ |
| D | InstrProf.h | 463 bool Sorted = false; variable
515 Sorted = false; in addFuncName()
587 if (Sorted) in finalizeSymtab()
594 Sorted = true; in finalizeSymtab()
|
| /openbsd/src/gnu/usr.bin/perl/cpan/OpenBSD-Pledge/t/ |
| D | OpenBSD-Pledge.t | 81 "Sorted and unique promises, plus stdio";
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/AMDGPU/ |
| D | AMDGPULowerModuleLDSPass.cpp | 1020 std::vector<GlobalVariable *> Sorted(LDSVarsToTransform.begin(), in createLDSVariableReplacement() local
1022 llvm::sort(Sorted.begin(), Sorted.end(), in createLDSVariableReplacement()
1026 for (GlobalVariable *GV : Sorted) { in createLDSVariableReplacement()
|
| /openbsd/src/gnu/llvm/clang/lib/Driver/ |
| D | OffloadBundler.cpp | 1027 std::set<StringRef> Sorted; in UnbundleFiles() local
1029 Sorted.insert(E.first()); in UnbundleFiles()
1031 unsigned Last = Sorted.size() - 1; in UnbundleFiles()
1032 for (auto &E : Sorted) { in UnbundleFiles()
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/Hexagon/ |
| D | HexagonISelDAGToDAGHVX.cpp | 1964 SmallVector<uint32_t, 8> Sorted(Worklist); in getPerfectCompletions() local
1965 llvm::sort(Sorted.begin(), Sorted.end()); in getPerfectCompletions()
1967 for (unsigned I = 0, E = Sorted.size(); I != E;) { in getPerfectCompletions()
1968 unsigned P = Sorted[I], Count = 1; in getPerfectCompletions()
1969 while (++I != E && P == Sorted[I]) in getPerfectCompletions()
|
| /openbsd/src/gnu/llvm/llvm/lib/DWARFLinker/ |
| D | DWARFLinker.cpp | 2729 std::vector<std::pair<StringRef, DebugInfoSize>> Sorted; in link() local
2731 Sorted.emplace_back(E.first(), E.second); in link()
2732 llvm::sort(Sorted, [](auto &LHS, auto &RHS) { in link()
2758 for (auto &E : Sorted) { in link()
|
| /openbsd/src/gnu/llvm/libcxx/benchmarks/ |
| D | map.bench.cpp | 45 enum class Order { Sorted, Random }; enumerator
|
| /openbsd/src/gnu/llvm/llvm/lib/ProfileData/ |
| D | InstrProf.cpp | 419 Sorted = false; in create()
|
| /openbsd/src/gnu/usr.bin/binutils/gdb/ |
| D | ChangeLog-1998 | 6501 then compare on names. Sorted list should have symbols with
|
| /openbsd/src/gnu/usr.bin/binutils-2.17/bfd/ |
| D | ChangeLog-0203 | 10114 * syms.c (stt[]): Sorted. Added .init/.fini -> "t" mapping.
|
| /openbsd/src/gnu/usr.bin/binutils/bfd/ |
| D | ChangeLog-0203 | 10114 * syms.c (stt[]): Sorted. Added .init/.fini -> "t" mapping.
|