Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DParallel.h116 const Comparator &Comp) { in medianOf3() argument
118 return Comp(*Start, *(End - 1)) in medianOf3()
119 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start) in medianOf3()
121 : (Comp(*Mid, *Start) ? (Comp(*(End - 1), *Mid) ? Mid : End - 1) in medianOf3()
127 const Comparator &Comp, TaskGroup &TG, size_t Depth) { in parallel_quick_sort() argument
130 llvm::sort(Start, End, Comp); in parallel_quick_sort()
135 auto Pivot = medianOf3(Start, End, Comp); in parallel_quick_sort()
138 Pivot = std::partition(Start, End - 1, [&Comp, End](decltype(*Start) V) { in parallel_quick_sort()
139 return Comp(V, *(End - 1)); in parallel_quick_sort()
145 TG.spawn([=, &Comp, &TG] { in parallel_quick_sort()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
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/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.h84 template <typename T> void setCompleter(T Comp) { in setCompleter() argument
85 Completer.reset(new CompleterModel<T>(Comp)); in setCompleter()
92 template <typename T> void setListCompleter(T Comp) { in setListCompleter() argument
93 Completer.reset(new ListCompleterModel<T>(Comp)); in setListCompleter()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp164 ICmpInst *Comp = nullptr; in NewLeafBlock() local
167 Comp = in NewLeafBlock()
173 Comp = new ICmpInst(NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, in NewLeafBlock()
177 Comp = new ICmpInst(NewLeaf, ICmpInst::ICMP_SGE, Val, Leaf.Low, in NewLeafBlock()
181 Comp = new ICmpInst(NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High, in NewLeafBlock()
189 Comp = new ICmpInst(NewLeaf, ICmpInst::ICMP_ULE, Add, UpperBound, in NewLeafBlock()
196 BranchInst::Create(Succ, Default, Comp, NewLeaf); in NewLeafBlock()
290 ICmpInst *Comp = new ICmpInst(ICmpInst::ICMP_SLT, Val, Pivot.Low, "Pivot"); in SwitchConvert() local
300 Comp->insertInto(NewNode, NewNode->end()); in SwitchConvert()
302 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/Frontend/OpenMP/
H A DOMP.cpp108 Directive Comp = in getLeafOrCompositeConstructs() local
110 assert(Comp != OMPD_unknown); in getLeafOrCompositeConstructs()
111 Output.push_back(Comp); in getLeafOrCompositeConstructs()
/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()
34 Comp); in isF128SoftLibCall()
/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.h193 virtual void printSymbols(std::optional<SymbolComparator> Comp) {} in printSymbols() argument
195 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.cpp290 Compare Comp) { in checkAttributeNumArgsImpl() argument
291 if (Comp(getNumAttributeArgs(AL), Num)) { in checkAttributeNumArgsImpl()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenRegisters.cpp327 for (auto Comp : Comps) { in computeSubRegs() local
328 SubRegMap::const_iterator SRI = Map.find(Comp.first); in computeSubRegs()
333 if (SubRegs.count(Comp.second) || !Orphans.erase(SRI->second)) in computeSubRegs()
336 SubRegs.insert(std::pair(Comp.second, SRI->second)); in computeSubRegs()
337 Indices.push_back(Comp.second); in computeSubRegs()
1391 CodeGenSubRegIndex *Comp = A->compose(B); in getCompositeSubRegIndex() local
1392 if (Comp) in getCompositeSubRegIndex()
1393 return Comp; in getCompositeSubRegIndex()
1397 Comp = createSubRegIndex(Name, A->getNamespace()); in getCompositeSubRegIndex()
1398 A->addComposite(B, Comp, getHwModes()); in getCompositeSubRegIndex()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/LineEditor/
H A DLineEditor.cpp71 for (const Completion &Comp : Comps) in complete() local
72 Action.Completions.push_back(Comp.DisplayText); in complete()
/freebsd/contrib/llvm-project/llvm/lib/TargetParser/
H A DTriple.cpp1152 StringRef Comp = Components[Idx]; in normalize() local
1156 Arch = parseArch(Comp); in normalize()
1160 Vendor = parseVendor(Comp); in normalize()
1164 OS = parseOS(Comp); in normalize()
1165 IsCygwin = Comp.starts_with("cygwin"); in normalize()
1166 IsMinGW32 = Comp.starts_with("mingw"); in normalize()
1170 Environment = parseEnvironment(Comp); in normalize()
1173 ObjectFormat = parseFormat(Comp); in normalize()
1228 assert(Pos < Components.size() && Components[Pos] == Comp && in normalize()
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DExpr.cpp4315 StringRef Comp = Accessor->getName(); in containsDuplicateElements() local
4318 if (Comp == "hi" || Comp == "lo" || Comp == "even" || Comp == "odd") in containsDuplicateElements()
4322 if (Comp[0] == 's' || Comp[0] == 'S') in containsDuplicateElements()
4323 Comp = Comp.substr(1); in containsDuplicateElements()
4325 for (unsigned i = 0, e = Comp.size(); i != e; ++i) in containsDuplicateElements()
4326 if (Comp.substr(i + 1).contains(Comp[i])) in containsDuplicateElements()
4335 StringRef Comp = Accessor->getName(); in getEncodedElementAccess() local
4337 if (Comp[0] == 's' || Comp[0] == 'S') { in getEncodedElementAccess()
4338 Comp = Comp.substr(1); in getEncodedElementAccess()
4342 bool isHi = Comp == "hi"; in getEncodedElementAccess()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64InstrInfo.cpp9635 MachineInstr *Comp; member in __anon56a76da32311::AArch64PipelinerLoopInfo
9652 MachineInstr *Comp, unsigned CompCounterOprNum, in AArch64PipelinerLoopInfo() argument
9656 : MF(Comp->getParent()->getParent()), in AArch64PipelinerLoopInfo()
9659 LoopBB(LoopBB), CondBranch(CondBranch), Comp(Comp), in AArch64PipelinerLoopInfo()
9667 return MI == Comp; in shouldIgnoreForPipelining()
9751 BuildMI(MBB, MBB.end(), Comp->getDebugLoc(), TII->get(AArch64::CSINCXr)) in createRemainingIterationsGreaterCondition()
9759 if (!LastStage0Insts.empty() && LastStage0Insts[Comp]->getParent() == &MBB) { in createRemainingIterationsGreaterCondition()
9767 cloneInstr(Comp, CompCounterOprNum, Counter, MBB, MBB.end()); in createRemainingIterationsGreaterCondition()
9773 if (Update != Comp && IsUpdatePriorComp) { in createRemainingIterationsGreaterCondition()
9775 LastStage0Insts[Comp]->getOperand(CompCounterOprNum).getReg(); in createRemainingIterationsGreaterCondition()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineFunction.h958 template <typename Comp>
959 void sort(Comp comp) {

12