/netbsd-src/external/apache2/llvm/dist/clang/lib/Tooling/ |
H A D | 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()
|
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
H A D | Parallel.h | 78 template <class RandomAccessIterator, class Comparator> 81 const Comparator &Comp) { in medianOf3() 90 template <class RandomAccessIterator, class Comparator> 92 const Comparator &Comp, TaskGroup &TG, size_t Depth) { in parallel_quick_sort() 116 template <class RandomAccessIterator, class Comparator> 118 const Comparator &Comp) { in parallel_sort() 238 class Comparator = std::less< 241 const Comparator &Comp = Comparator()) { 292 class Comparator = std::less<decltype(*std::begin(RangeTy()))>> 293 void parallelSort(RangeTy &&R, const Comparator &Comp = Comparator()) {
|
/netbsd-src/external/gpl3/gcc/dist/gcc/ |
H A D | splay-tree-utils.h | 185 template<typename Comparator> 186 bool insert (node_type new_node, Comparator compare); 293 template<typename Comparator> 294 auto lookup (Comparator compare) -> decltype (compare (m_root));
|
H A D | splay-tree-utils.tcc | 328 template<typename Comparator> 330 rooted_splay_tree<Accessors>::insert (node_type new_node, Comparator compare) in insert() 483 template<typename Comparator> 485 rooted_splay_tree<Accessors>::lookup (Comparator compare) in lookup()
|
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Tooling/ |
H A D | FileMatchTrie.h | 63 FileMatchTrie(PathComparator* Comparator); 82 std::unique_ptr<PathComparator> Comparator; variable
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
H A D | MachineFunctionSplitter.cpp | 148 auto Comparator = [](const MachineBasicBlock &X, const MachineBasicBlock &Y) { in runOnMachineFunction() local 151 llvm::sortBasicBlocksAndUpdateBranches(MF, Comparator); in runOnMachineFunction()
|
H A D | BasicBlockSections.cpp | 399 auto Comparator = [&](const MachineBasicBlock &X, in runOnMachineFunction() local 413 sortBasicBlocksAndUpdateBranches(MF, Comparator); in runOnMachineFunction()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
H A D | CFLAndersAliasAnalysis.cpp | 551 auto Comparator = [](OffsetValue LHS, OffsetValue RHS) { in mayAlias() local 555 assert(llvm::is_sorted(Itr->second, Comparator)); in mayAlias() 558 OffsetValue{RHS, 0}, Comparator); in mayAlias()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Mips/MCTargetDesc/ |
H A D | MipsELFObjectWriter.cpp | 110 template <class InputIt, class UnaryPredicate, class Comparator> 112 Comparator BetterThan) { in find_best()
|
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyTraverse.h | 310 class Comparator { 327 class EqualsComparator : public Comparator<EqualsComparator> { 361 class MatchComparator : public Comparator<MatchComparator> {
|
/netbsd-src/external/apache2/llvm/dist/llvm/utils/unittest/googlemock/include/gmock/ |
H A D | gmock-matchers.h | 2169 template <typename Comparator, typename ContainerMatcher> 2172 WhenSortedByMatcher(const Comparator& comparator, 2193 Impl(const Comparator& comparator, const ContainerMatcher& matcher) 2232 const Comparator comparator_; 2239 const Comparator comparator_; 4071 template <typename Comparator, typename ContainerMatcher> 4072 inline internal::WhenSortedByMatcher<Comparator, ContainerMatcher> 4073 WhenSortedBy(const Comparator& comparator, 4075 return internal::WhenSortedByMatcher<Comparator, ContainerMatcher>(
|
/netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
H A D | GlobalISelEmitter.cpp | 1981 AOComparator Comparator; member in __anon332dbd1e0111::AtomicOrderingMMOPredicateMatcher 1985 AOComparator Comparator = AO_Exactly) in AtomicOrderingMMOPredicateMatcher() argument 1987 Order(Order), Comparator(Comparator) {} in AtomicOrderingMMOPredicateMatcher() 1997 return Order == R.Order && Comparator == R.Comparator; in isIdentical() 2004 if (Comparator == AO_OrStronger) in emitPredicateOpcodes() 2006 if (Comparator == AO_WeakerThan) in emitPredicateOpcodes()
|
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-nm/ |
H A D | llvm-nm.cpp | 756 using Comparator = bool (*)(const NMSymbol &, const NMSymbol &); in sortAndPrintSymbolList() typedef 757 Comparator Cmp; in sortAndPrintSymbolList()
|
/netbsd-src/external/apache2/llvm/dist/clang/lib/Sema/ |
H A D | SemaLookup.cpp | 75 struct Comparator { struct in __anon8d9d45fa0111::UnqualUsingEntry 191 void done() { llvm::sort(list, UnqualUsingEntry::Comparator()); } in done() 202 UnqualUsingEntry::Comparator())); in getNamespacesFor()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
H A D | AArch64ISelLowering.cpp | 13730 SDValue Comparator = N->getOperand(3); in tryConvertSVEWideCompare() local 13731 if (Comparator.getOpcode() == AArch64ISD::DUP || in tryConvertSVEWideCompare() 13732 Comparator.getOpcode() == ISD::SPLAT_VECTOR) { in tryConvertSVEWideCompare() 13752 if (auto *CN = dyn_cast<ConstantSDNode>(Comparator.getOperand(0))) { in tryConvertSVEWideCompare() 13766 if (auto *CN = dyn_cast<ConstantSDNode>(Comparator.getOperand(0))) { in tryConvertSVEWideCompare()
|
/netbsd-src/external/apache2/llvm/dist/libcxx/include/ |
H A D | __tree | 1788 "Comparator must be copy-constructible.");
|
H A D | algorithm | 824 "Comparator does not induce a strict weak ordering");
|