Home
last modified time | relevance | path

Searched refs:Comp (Results 1 – 25 of 50) sorted by relevance

12

/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DParallel.h117 const Comparator &Comp) { in medianOf3() argument
119 return Comp(*Start, *(End - 1)) in medianOf3()
120 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start) in medianOf3()
122 : (Comp(*Mid, *Start) ? (Comp(*(End - 1), *Mid) ? Mid : End - 1) in medianOf3()
128 const Comparator &Comp, TaskGroup &TG, size_t Depth) { in parallel_quick_sort() argument
131 llvm::sort(Start, End, Comp); in parallel_quick_sort()
136 auto Pivot = medianOf3(Start, End, Comp); in parallel_quick_sort()
139 Pivot = std::partition(Start, End - 1, [&Comp, End](decltype(*Start) V) { in parallel_quick_sort()
140 return Comp(V, *(End - 1)); in parallel_quick_sort()
146 TG.spawn([=, &Comp, &TG] { in parallel_quick_sort()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A Dalgorithm49 …indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> …
50 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
53 …indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> …
54 constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
57 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
58 …constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); …
61 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
62 …constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); …
131 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
132 …constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dalgorithm52 …indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> …
53 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
56 …indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> …
57 constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
60 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
61 …constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); …
64 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
65 …constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); …
134 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
135 …constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); …
[all …]
/freebsd/share/doc/psd/15.yacc/
H A Dref.bib12 %J Comp. Surveys
22 %J Comm. Assoc. Comp. Mach.
36 %R Comp. Sci. Tech. Rep. No. 65
51 %R Comp. Sci. Tech. Rep. No. 17
58 %J Comm. Assoc. Comp. Mach.
65 %R Comp. Sci. Tech. Rep. No. 39
/freebsd/contrib/llvm-project/llvm/include/llvm/LineEditor/
H A DLineEditor.h86 template <typename T> void setCompleter(T Comp) { in setCompleter() argument
87 Completer.reset(new CompleterModel<T>(Comp)); in setCompleter()
94 template <typename T> void setListCompleter(T Comp) { in setListCompleter() argument
95 Completer.reset(new ListCompleterModel<T>(Comp)); in setListCompleter()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp162 ICmpInst *Comp = nullptr; in NewLeafBlock() local
165 Comp = in NewLeafBlock()
171 Comp = new ICmpInst(NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, in NewLeafBlock()
175 Comp = new ICmpInst(NewLeaf, ICmpInst::ICMP_SGE, Val, Leaf.Low, in NewLeafBlock()
179 Comp = new ICmpInst(NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High, in NewLeafBlock()
187 Comp = new ICmpInst(NewLeaf, ICmpInst::ICMP_ULE, Add, UpperBound, in NewLeafBlock()
194 BranchInst::Create(Succ, Default, Comp, NewLeaf); in NewLeafBlock()
288 ICmpInst *Comp = new ICmpInst(ICmpInst::ICMP_SLT, Val, Pivot.Low, "Pivot"); in SwitchConvert() local
298 Comp->insertInto(NewNode, NewNode->end()); in SwitchConvert()
300 BranchInst::Create(LBranch, RBranch, Comp, NewNode); in SwitchConvert()
/freebsd/share/doc/psd/01.cacm/
H A Dref.bib5 %J Comm. Assoc. Comp. Mach.
13 %R Comp. Sci. Tech. Rep. No. 17
20 %J Comm. Assoc. Comp. Mach.
107 %J Comm. Assoc. Comp. Mach.
/freebsd/contrib/llvm-project/libcxx/src/
H A Dalgorithm.cpp14 template <class Comp, class RandomAccessIterator>
15 void __sort(RandomAccessIterator first, RandomAccessIterator last, Comp comp) { in __sort()
/freebsd/contrib/llvm-project/clang/lib/Lex/
H A DPPConditionalDirectiveRecord.cpp29 CondDirectiveLocs, Range.getBegin(), CondDirectiveLoc::Comp(SourceMgr)); in rangeIntersectsConditionalDirective()
38 Range.getEnd(), CondDirectiveLoc::Comp(SourceMgr)); in rangeIntersectsConditionalDirective()
58 CondDirectiveLocs, Loc, CondDirectiveLoc::Comp(SourceMgr)); in findConditionalDirectiveRegionLoc()
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsCCState.cpp31 auto Comp = [](const char *S1, const char *S2) { return strcmp(S1, S2) < 0; }; in isF128SoftLibCall() local
32 assert(llvm::is_sorted(LibCalls, Comp)); in isF128SoftLibCall()
33 return llvm::binary_search(LibCalls, CallSym, Comp); in isF128SoftLibCall()
/freebsd/contrib/llvm-project/clang/utils/TableGen/
H A DClangASTNodesEmitter.cpp99 auto Comp = [this](const ASTNode &LHS, const ASTNode &RHS) { in EmitNode() local
105 auto SortedChildren = std::set<ASTNode, decltype(Comp)>(Comp); in EmitNode()
/freebsd/contrib/llvm-project/llvm/lib/Frontend/OpenMP/
H A DOMP.cpp110 Directive Comp = in getLeafOrCompositeConstructs() local
112 assert(Comp != OMPD_unknown); in getLeafOrCompositeConstructs()
113 Output.push_back(Comp); in getLeafOrCompositeConstructs()
/freebsd/contrib/llvm-project/clang/include/clang/Lex/
H A DPPConditionalDirectiveRecord.h41 class Comp {
44 explicit Comp(SourceManager &SM) : SM(SM) {} in Comp() function
/freebsd/contrib/netbsd-tests/ipf/input/
H A Dni13124 …2.168.113.1: gre [KSv1] ID:4000 S:3 ppp: IPCP 18: Conf-Req(1), IP-Addr=192.168.0.1, IP-Comp VJ-Comp
201 …2.168.113.1 > 192.168.113.3: gre [KSAv1] ID:0000 S:7 A:8 ppp: IPCP 12: Conf-Rej(1), IP-Comp VJ-Comp
H A Dni14128 …2.168.113.1: gre [KSv1] ID:4000 S:3 ppp: IPCP 18: Conf-Req(1), IP-Addr=192.168.0.1, IP-Comp VJ-Comp
205 …2.168.113.1 > 192.168.113.3: gre [KSAv1] ID:0000 S:7 A:8 ppp: IPCP 12: Conf-Rej(1), IP-Comp VJ-Comp
H A Dni15128 …2.168.113.1: gre [KSv1] ID:4000 S:3 ppp: IPCP 18: Conf-Req(1), IP-Addr=192.168.0.1, IP-Comp VJ-Comp
205 …2.168.113.1 > 192.168.113.3: gre [KSAv1] ID:0000 S:7 A:8 ppp: IPCP 12: Conf-Rej(1), IP-Comp VJ-Comp
H A Dni16128 …2.168.113.1: gre [KSv1] ID:4000 S:3 ppp: IPCP 18: Conf-Req(1), IP-Addr=192.168.0.1, IP-Comp VJ-Comp
205 …2.168.113.1 > 192.168.113.3: gre [KSAv1] ID:0000 S:7 A:8 ppp: IPCP 12: Conf-Rej(1), IP-Comp VJ-Comp
/freebsd/contrib/llvm-project/llvm/tools/llvm-pdbutil/
H A DPrettyTypeDumper.cpp96 CompareFunc Comp = getComparisonFunc(opts::pretty::ClassOrder); in filterAndSortClassDefs() local
135 if (Comp) in filterAndSortClassDefs()
136 llvm::sort(Filtered, Comp); in filterAndSortClassDefs()
/freebsd/contrib/llvm-project/llvm/tools/llvm-readobj/
H A DObjDumper.h195 virtual void printSymbols(std::optional<SymbolComparator> Comp) {} in printSymbols() argument
197 virtual void printDynamicSymbols(std::optional<SymbolComparator> Comp) {} in printDynamicSymbols() argument
/freebsd/contrib/llvm-project/clang/lib/Format/
H A DUsingDeclarationsSorter.cpp154 auto Comp = [SortUsingDeclarations](const UsingDeclaration &Lhs, in endUsingDeclarationBlock() local
158 llvm::stable_sort(SortedUsingDeclarations, Comp); in endUsingDeclarationBlock()
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DParsedAttr.cpp280 Compare Comp) { in checkAttributeNumArgsImpl() argument
281 if (Comp(getNumAttributeArgs(AL), Num)) { in checkAttributeNumArgsImpl()
/freebsd/contrib/llvm-project/llvm/lib/LineEditor/
H A DLineEditor.cpp72 for (const Completion &Comp : Comps) in complete() local
73 Action.Completions.push_back(Comp.DisplayText); in complete()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DFunctionImport.h248 Comp) in SortedImportList() argument
257 return Comp(Lookup(L), Lookup(R)); in SortedImportList()
/freebsd/contrib/llvm-project/llvm/lib/TargetParser/
H A DTriple.cpp1192 StringRef Comp = Components[Idx]; in normalize() local
1196 Arch = parseArch(Comp); in normalize()
1200 Vendor = parseVendor(Comp); in normalize()
1204 OS = parseOS(Comp); in normalize()
1205 IsCygwin = Comp.starts_with("cygwin") || Comp.starts_with("msys"); in normalize()
1206 IsMinGW32 = Comp.starts_with("mingw"); in normalize()
1210 Environment = parseEnvironment(Comp); in normalize()
1213 ObjectFormat = parseFormat(Comp); in normalize()
1268 assert(Pos < Components.size() && Components[Pos] == Comp && in normalize()
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DExpr.cpp4342 StringRef Comp = Accessor->getName(); in containsDuplicateElements() local
4345 if (Comp == "hi" || Comp == "lo" || Comp == "even" || Comp == "odd") in containsDuplicateElements()
4349 if (Comp[0] == 's' || Comp[0] == 'S') in containsDuplicateElements()
4350 Comp = Comp.substr(1); in containsDuplicateElements()
4352 for (unsigned i = 0, e = Comp.size(); i != e; ++i) in containsDuplicateElements()
4353 if (Comp.substr(i + 1).contains(Comp[i])) in containsDuplicateElements()
4362 StringRef Comp = Accessor->getName(); in getEncodedElementAccess() local
4364 if (Comp[0] == 's' || Comp[0] == 'S') { in getEncodedElementAccess()
4365 Comp = Comp.substr(1); in getEncodedElementAccess()
4369 bool isHi = Comp == "hi"; in getEncodedElementAccess()
[all …]

12