| /freebsd-head/contrib/llvm-project/clang/lib/Tooling/ |
| HD | FileMatchTrie.cpp | 104 StringRef findEquivalent(const PathComparator& Comparator, in findEquivalent() argument
114 Comparator.equivalent(StringRef(Path), FileName)) in findEquivalent()
124 Comparator, FileName, IsAmbiguous, in findEquivalent()
140 if (Comparator.equivalent(Child, FileName)) { in findEquivalent()
183 : Root(new FileMatchTrieNode), Comparator(new DefaultPathComparator()) {} in FileMatchTrie()
185 FileMatchTrie::FileMatchTrie(PathComparator *Comparator) in FileMatchTrie() argument
186 : Root(new FileMatchTrieNode), Comparator(Comparator) {} in FileMatchTrie()
203 StringRef Result = Root->findEquivalent(*Comparator, FileName, IsAmbiguous); in findEquivalent()
|
| /freebsd-head/contrib/llvm-project/llvm/include/llvm/Support/ |
| HD | Parallel.h | 113 template <class RandomAccessIterator, class Comparator>
116 const Comparator &Comp) { in medianOf3()
125 template <class RandomAccessIterator, class Comparator>
127 const Comparator &Comp, TaskGroup &TG, size_t Depth) { in parallel_quick_sort()
151 template <class RandomAccessIterator, class Comparator>
153 const Comparator &Comp) { in parallel_sort()
215 class Comparator = std::less<
218 const Comparator &Comp = Comparator()) {
253 class Comparator = std::less<decltype(*std::begin(RangeTy()))>>
254 void parallelSort(RangeTy &&R, const Comparator &Comp = Comparator()) {
|
| /freebsd-head/contrib/llvm-project/clang/include/clang/Tooling/ |
| HD | FileMatchTrie.h | 63 FileMatchTrie(PathComparator* Comparator);
82 std::unique_ptr<PathComparator> Comparator; variable
|
| /freebsd-head/contrib/llvm-project/llvm/lib/DWARFLinker/Parallel/ |
| HD | ArrayList.h | 80 void sort(function_ref<bool(const T &LHS, const T &RHS)> Comparator) { in sort() argument
85 std::sort(SortedItems.begin(), SortedItems.end(), Comparator); in sort()
|
| /freebsd-head/contrib/llvm-project/llvm/lib/CodeGen/ |
| HD | MachineFunctionSplitter.cpp | 101 auto Comparator = [](const MachineBasicBlock &X, const MachineBasicBlock &Y) { in finishAdjustingBasicBlocksAndLandingPads() local
104 llvm::sortBasicBlocksAndUpdateBranches(MF, Comparator); in finishAdjustingBasicBlocksAndLandingPads()
|
| HD | BasicBlockSections.cpp | 356 auto Comparator = [&](const MachineBasicBlock &X, in handleBBSections() local
373 sortBasicBlocksAndUpdateBranches(MF, Comparator); in handleBBSections()
|
| /freebsd-head/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/ |
| HD | LVCompare.cpp | 106 void LVCompare::setInstance(LVCompare *Comparator) { in setInstance() argument
107 CurrentComparator = Comparator; in setInstance()
|
| /freebsd-head/contrib/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/ |
| HD | MipsELFObjectWriter.cpp | 110 template <class InputIt, class UnaryPredicate, class Comparator>
112 Comparator BetterThan) { in find_best()
|
| /freebsd-head/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
| HD | ThreadSafetyTraverse.h | 310 class Comparator {
327 class EqualsComparator : public Comparator<EqualsComparator> {
361 class MatchComparator : public Comparator<MatchComparator> {
|
| /freebsd-head/contrib/llvm-project/llvm/utils/TableGen/Common/GlobalISel/ |
| HD | GlobalISelMatchTable.h | 1487 AOComparator Comparator; variable
1491 AOComparator Comparator = AO_Exactly)
1493 Order(Order), Comparator(Comparator) {} in InstructionPredicateMatcher()
|
| HD | GlobalISelMatchTable.cpp | 1541 return Order == R.Order && Comparator == R.Comparator; in isIdentical()
1548 if (Comparator == AO_OrStronger) in emitPredicateOpcodes()
1550 if (Comparator == AO_WeakerThan) in emitPredicateOpcodes()
|
| /freebsd-head/contrib/googletest/googlemock/include/gmock/ |
| HD | gmock-matchers.h | 2496 template <typename Comparator, typename ContainerMatcher>
2499 WhenSortedByMatcher(const Comparator& comparator,
2522 Impl(const Comparator& comparator, const ContainerMatcher& matcher)
2561 const Comparator comparator_;
2569 const Comparator comparator_;
4712 template <typename Comparator, typename ContainerMatcher>
4713 inline internal::WhenSortedByMatcher<Comparator, ContainerMatcher> WhenSortedBy(
4714 const Comparator& comparator, const ContainerMatcher& container_matcher) {
4715 return internal::WhenSortedByMatcher<Comparator, ContainerMatcher>(
|
| /freebsd-head/contrib/llvm-project/lldb/source/Plugins/SymbolFile/NativePDB/ |
| HD | PdbUtil.cpp | 73 struct Comparator { struct
83 MemberLocations::Comparator>
|
| /freebsd-head/contrib/llvm-project/clang/lib/Sema/ |
| HD | SemaLookup.cpp | 80 struct Comparator { struct in __anon9768172e0111::UnqualUsingEntry
196 void done() { llvm::sort(list, UnqualUsingEntry::Comparator()); } in done()
207 UnqualUsingEntry::Comparator())); in getNamespacesFor()
|
| /freebsd-head/contrib/llvm-project/libcxx/include/ |
| HD | __tree | 1531 …static_assert(is_copy_constructible<value_compare>::value, "Comparator must be copy-constructible.…
|
| /freebsd-head/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| HD | AArch64ISelLowering.cpp | 20999 SDValue Comparator = N->getOperand(3); in tryConvertSVEWideCompare() local
21000 if (Comparator.getOpcode() == AArch64ISD::DUP || in tryConvertSVEWideCompare()
21001 Comparator.getOpcode() == ISD::SPLAT_VECTOR) { in tryConvertSVEWideCompare()
21021 if (auto *CN = dyn_cast<ConstantSDNode>(Comparator.getOperand(0))) { in tryConvertSVEWideCompare()
21035 if (auto *CN = dyn_cast<ConstantSDNode>(Comparator.getOperand(0))) { in tryConvertSVEWideCompare()
|
| /freebsd-head/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| HD | SLPVectorizer.cpp | 18404 SmallVectorImpl<T *> &Incoming, function_ref<bool(T *, T *)> Comparator, in tryToVectorizeSequence() argument
18410 stable_sort(Incoming, Comparator); in tryToVectorizeSequence()
|