/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | Parallel.h | 120 return Comp(*Start, *(End - 1)) in medianOf3() 121 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start) in medianOf3() 123 : (Comp(*Mid, *Start) ? (Comp(*(End - 1), *Mid) ? Mid : End - 1) in medianOf3() 132 llvm::sort(Start, End, Comp); in parallel_quick_sort() 137 auto Pivot = medianOf3(Start, End, Comp); in parallel_quick_sort() 141 return Comp(V, *(End - 1)); in parallel_quick_sort() 147 TG.spawn([=, &Comp, &TG] { in parallel_quick_sort() 155 const Comparator &Comp) { in parallel_sort() argument 157 parallel_quick_sort(Start, End, Comp, TG, in parallel_sort() 227 llvm::sort(Start, End, Comp); [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/ |
H A D | algorithm | 303 requires sortable<I, Comp, Proj> 314 requires sortable<I, Comp, Proj> 325 requires sortable<I, Comp, Proj> 336 requires sortable<I, Comp, Proj> 372 requires sortable<I, Comp, Proj> 383 requires sortable<I, Comp, Proj> 393 requires sortable<I, Comp, Proj> 535 requires sortable<I, Comp, Proj> 983 requires sortable<I, Comp, Proj> 1093 requires sortable<I, Comp, Proj> [all …]
|
/freebsd/share/doc/psd/15.yacc/ |
H A D | ref.bib | 12 %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 D | LineEditor.h | 84 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/clang/include/clang/Analysis/FlowSensitive/ |
H A D | DataflowWorklist.h | 23 template <typename Comp, unsigned QueueSize> class DataflowWorklistBase { 26 SmallVector<const CFGBlock *, QueueSize>, Comp> 30 DataflowWorklistBase(const CFG &Cfg, Comp C) in DataflowWorklistBase()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LowerSwitch.cpp | 164 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 D | ref.bib | 5 %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 D | algorithm.cpp | 14 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 D | PPConditionalDirectiveRecord.cpp | 29 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/clang/lib/Tooling/DumpTool/ |
H A D | ClangSrcLocDump.cpp | 118 std::unique_ptr<clang::driver::Compilation> Comp( in main() local 120 if (!Comp) in main() 123 const auto &Jobs = Comp->getJobs(); in main()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | MipsCCState.cpp | 31 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 D | PPConditionalDirectiveRecord.h | 41 class Comp { 44 explicit Comp(SourceManager &SM) : SM(SM) {} in Comp() function
|
/freebsd/contrib/netbsd-tests/ipf/input/ |
H A D | ni14 | 128 …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 D | ni15 | 128 …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 D | ni13 | 124 …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 D | ni16 | 128 …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 D | PrettyTypeDumper.cpp | 96 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 D | ObjDumper.h | 191 virtual void printSymbols(std::optional<SymbolComparator> Comp) {} in printSymbols() argument 193 virtual void printDynamicSymbols(std::optional<SymbolComparator> Comp) {} in printDynamicSymbols() argument
|
/freebsd/contrib/llvm-project/clang/lib/Format/ |
H A D | UsingDeclarationsSorter.cpp | 154 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 D | ParsedAttr.cpp | 284 Compare Comp) { in checkAttributeNumArgsImpl() argument 285 if (Comp(getNumAttributeArgs(AL), Num)) { in checkAttributeNumArgsImpl()
|
/freebsd/contrib/llvm-project/llvm/lib/LineEditor/ |
H A D | LineEditor.cpp | 71 for (const Completion &Comp : Comps) in complete() local 72 Action.Completions.push_back(Comp.DisplayText); in complete()
|
/freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | CodeGenRegisters.cpp | 317 for (auto Comp : Comps) { in computeSubRegs() local 318 SubRegMap::const_iterator SRI = Map.find(Comp.first); in computeSubRegs() 323 if (SubRegs.count(Comp.second) || !Orphans.erase(SRI->second)) in computeSubRegs() 326 SubRegs.insert(std::make_pair(Comp.second, SRI->second)); in computeSubRegs() 327 Indices.push_back(Comp.second); in computeSubRegs() 1369 CodeGenSubRegIndex *Comp = A->compose(B); in getCompositeSubRegIndex() local 1370 if (Comp) in getCompositeSubRegIndex() 1371 return Comp; in getCompositeSubRegIndex() 1375 Comp = createSubRegIndex(Name, A->getNamespace()); in getCompositeSubRegIndex() 1376 A->addComposite(B, Comp); in getCompositeSubRegIndex() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/TargetParser/ |
H A D | Triple.cpp | 1048 StringRef Comp = Components[Idx]; in normalize() local 1052 Arch = parseArch(Comp); in normalize() 1056 Vendor = parseVendor(Comp); in normalize() 1060 OS = parseOS(Comp); in normalize() 1061 IsCygwin = Comp.starts_with("cygwin"); in normalize() 1062 IsMinGW32 = Comp.starts_with("mingw"); in normalize() 1066 Environment = parseEnvironment(Comp); in normalize() 1069 ObjectFormat = parseFormat(Comp); in normalize() 1124 assert(Pos < Components.size() && Components[Pos] == Comp && in normalize()
|
/freebsd/contrib/llvm-project/clang/lib/AST/ |
H A D | Expr.cpp | 4233 StringRef Comp = Accessor->getName(); in containsDuplicateElements() local 4236 if (Comp == "hi" || Comp == "lo" || Comp == "even" || Comp == "odd") in containsDuplicateElements() 4240 if (Comp[0] == 's' || Comp[0] == 'S') in containsDuplicateElements() 4241 Comp = Comp.substr(1); in containsDuplicateElements() 4244 if (Comp.substr(i + 1).contains(Comp[i])) in containsDuplicateElements() 4255 if (Comp[0] == 's' || Comp[0] == 'S') { in getEncodedElementAccess() 4256 Comp = Comp.substr(1); in getEncodedElementAccess() 4260 bool isHi = Comp == "hi"; in getEncodedElementAccess() 4261 bool isLo = Comp == "lo"; in getEncodedElementAccess() 4262 bool isEven = Comp == "even"; in getEncodedElementAccess() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineFunction.h | 957 template <typename Comp> 958 void sort(Comp comp) {
|