Home
last modified time | relevance | path

Searched refs:Best (Results 1 – 25 of 37) sorted by relevance

12

/NextBSD/contrib/llvm/lib/CodeGen/
HDLatencyPriorityQueue.cpp122 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local
125 if (Picker(*Best, *I)) in pop()
126 Best = I; in pop()
127 SUnit *V = *Best; in pop()
128 if (Best != std::prev(Queue.end())) in pop()
129 std::swap(*Best, Queue.back()); in pop()
HDMachineTraceMetrics.cpp321 const MachineBasicBlock *Best = nullptr; in pickTracePred() local
331 if (!Best || Depth < BestDepth) in pickTracePred()
332 Best = Pred, BestDepth = Depth; in pickTracePred()
334 return Best; in pickTracePred()
343 const MachineBasicBlock *Best = nullptr; in pickTraceSucc() local
359 if (!Best || Height < BestHeight) in pickTraceSucc()
360 Best = Succ, BestHeight = Height; in pickTraceSucc()
362 return Best; in pickTraceSucc()
/NextBSD/contrib/llvm/tools/clang/lib/Sema/
HDSemaOverload.cpp2940 OverloadCandidateSet::iterator Best; in IsInitializerListConstructorConversion() local
2943 Best, true)) { in IsInitializerListConstructorConversion()
2947 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function); in IsInitializerListConstructorConversion()
2953 User.FoundConversionFunction = Best->FoundDecl; in IsInitializerListConstructorConversion()
3127 OverloadCandidateSet::iterator Best; in IsUserDefinedConversion() local
3129 Best, true)) { in IsUserDefinedConversion()
3134 = dyn_cast<CXXConstructorDecl>(Best->Function)) { in IsUserDefinedConversion()
3146 if (Best->Conversions[0].isEllipsis()) in IsUserDefinedConversion()
3149 User.Before = Best->Conversions[0].Standard; in IsUserDefinedConversion()
3155 User.FoundConversionFunction = Best->FoundDecl; in IsUserDefinedConversion()
[all …]
HDSemaInit.cpp410 OverloadCandidateSet::iterator Best; in PerformEmptyInit() local
413 .BestViableFunction(SemaRef, Kind.getLocation(), Best); in PerformEmptyInit()
416 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function); in PerformEmptyInit()
3351 OverloadCandidateSet::iterator &Best, in ResolveConstructorOverload() argument
3415 return CandidateSet.BestViableFunction(S, DeclLoc, Best); in ResolveConstructorOverload()
3461 OverloadCandidateSet::iterator Best; in TryConstructorInitialization() local
3481 CandidateSet, Ctors, Best, in TryConstructorInitialization()
3498 CandidateSet, Ctors, Best, in TryConstructorInitialization()
3517 !cast<CXXConstructorDecl>(Best->Function)->isUserProvided()) { in TryConstructorInitialization()
3526 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function); in TryConstructorInitialization()
[all …]
HDSemaTemplateInstantiate.cpp2328 SmallVectorImpl<MatchResult>::iterator Best = Matched.begin(); in InstantiateClassTemplateSpecialization() local
2341 for (SmallVectorImpl<MatchResult>::iterator P = Best + 1, in InstantiateClassTemplateSpecialization()
2344 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in InstantiateClassTemplateSpecialization()
2347 Best = P; in InstantiateClassTemplateSpecialization()
2356 if (P != Best && in InstantiateClassTemplateSpecialization()
2357 getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in InstantiateClassTemplateSpecialization()
2359 != Best->Partial) { in InstantiateClassTemplateSpecialization()
2385 ClassTemplatePartialSpecializationDecl *OrigPartialSpec = Best->Partial; in InstantiateClassTemplateSpecialization()
2396 ClassTemplateSpec->setInstantiationOf(Best->Partial, Best->Args); in InstantiateClassTemplateSpecialization()
HDSemaExprCXX.cpp1990 OverloadCandidateSet::iterator Best; in FindAllocationOverload() local
1991 switch (Candidates.BestViableFunction(*this, StartLoc, Best)) { in FindAllocationOverload()
1994 FunctionDecl *FnDecl = Best->Function; in FindAllocationOverload()
1996 Best->FoundDecl, Diagnose) == AR_inaccessible) in FindAllocationOverload()
2022 << Best->Function->isDeleted() in FindAllocationOverload()
2024 << getDeletedOrUnavailableSuffix(Best->Function) in FindAllocationOverload()
4693 OverloadCandidateSet::iterator Best; in FindConditionalOverload() local
4694 switch (CandidateSet.BestViableFunction(Self, QuestionLoc, Best)) { in FindConditionalOverload()
4698 Self.PerformImplicitConversion(LHS.get(), Best->BuiltinTypes.ParamTypes[0], in FindConditionalOverload()
4699 Best->Conversions[0], Sema::AA_Converting); in FindConditionalOverload()
[all …]
HDSemaTemplate.cpp2750 SmallVector<MatchResult, 4>::iterator Best = Matched.begin(); in CheckVarTemplateId() local
2763 for (SmallVector<MatchResult, 4>::iterator P = Best + 1, in CheckVarTemplateId()
2766 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in CheckVarTemplateId()
2769 Best = P; in CheckVarTemplateId()
2777 if (P != Best && getMoreSpecializedPartialSpecialization( in CheckVarTemplateId()
2778 P->Partial, Best->Partial, in CheckVarTemplateId()
2779 PointOfInstantiation) != Best->Partial) { in CheckVarTemplateId()
2787 InstantiationPattern = Best->Partial; in CheckVarTemplateId()
2788 InstantiationArgs = Best->Args; in CheckVarTemplateId()
HDSemaTemplateDeduction.cpp4396 UnresolvedSetIterator Best = SpecBegin; in getMostSpecialized() local
4398 = cast<FunctionDecl>(*Best)->getPrimaryTemplate(); in getMostSpecialized()
4407 Best = I; in getMostSpecialized()
4418 if (I != Best && in getMostSpecialized()
4429 return Best; in getMostSpecialized()
/NextBSD/contrib/llvm/lib/CodeGen/SelectionDAG/
HDResourcePriorityQueue.cpp602 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local
604 signed BestCost = SUSchedulingCost(*Best); in pop()
610 Best = I; in pop()
618 if (Picker(*Best, *I)) in pop()
619 Best = I; in pop()
622 SUnit *V = *Best; in pop()
623 if (Best != std::prev(Queue.end())) in pop()
624 std::swap(*Best, Queue.back()); in pop()
HDScheduleDAGRRList.cpp465 SDNode *Best = nullptr; in FindCallSeqStart() local
472 if (!Best || (MyMaxNest > BestMaxNest)) { in FindCallSeqStart()
473 Best = New; in FindCallSeqStart()
477 assert(Best); in FindCallSeqStart()
479 return Best; in FindCallSeqStart()
1748 std::vector<SUnit *>::iterator Best = Q.begin(); in popFromQueueImpl() local
1751 if (Picker(*Best, *I)) in popFromQueueImpl()
1752 Best = I; in popFromQueueImpl()
1753 SUnit *V = *Best; in popFromQueueImpl()
1754 if (Best != std::prev(Q.end())) in popFromQueueImpl()
[all …]
/NextBSD/contrib/compiler-rt/lib/ubsan/
HDubsan_diag.cc212 Range *Best = 0; in upperBound() local
215 (!Best || in upperBound()
216 Best->getStart().getMemoryLocation() > in upperBound()
218 Best = &Ranges[I]; in upperBound()
219 return Best; in upperBound()
/NextBSD/contrib/llvm/include/llvm/CodeGen/
HDMachineScheduler.h809 void setBest(SchedCandidate &Best) { in setBest()
810 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest()
811 SU = Best.SU; in setBest()
812 Reason = Best.Reason; in setBest()
813 RPDelta = Best.RPDelta; in setBest()
814 ResDelta = Best.ResDelta; in setBest()
/NextBSD/contrib/llvm/tools/clang/lib/Basic/
HDDiagnosticIDs.cpp574 StringRef Best; in getNearestOption() local
593 Best = ""; in getNearestOption()
596 Best = i->getName(); in getNearestOption()
601 return Best; in getNearestOption()
/NextBSD/usr.bin/at/
HDLEGAL14 Best regards
/NextBSD/libexec/atrun/
HDLEGAL16 Best regards
/NextBSD/contrib/llvm/tools/clang/lib/Format/
HDUnwrappedLineFormatter.cpp767 void reconstructPath(LineState &State, StateNode *Best) { in reconstructPath() argument
770 while (Best->Previous) { in reconstructPath()
771 Path.push_front(Best); in reconstructPath()
772 Best = Best->Previous; in reconstructPath()
/NextBSD/contrib/llvm/utils/TableGen/
HDFixedLenDecoderEmitter.cpp448 const Filter &Best) const;
1331 const Filter &Best) const { in emitSingletonTableEntry()
1332 unsigned Opc = Best.getSingletonOpc(); in emitSingletonTableEntry()
1344 Best.getVariableFC().emitTableEntries(TableInfo); in emitSingletonTableEntry()
1639 const Filter &Best = Filters[BestIndex]; in emitTableEntries() local
1640 if (Best.getNumFiltered() == 1) in emitTableEntries()
1641 emitSingletonTableEntry(TableInfo, Best); in emitTableEntries()
1643 Best.emitTableEntry(TableInfo); in emitTableEntries()
/NextBSD/contrib/llvm/tools/clang/lib/Frontend/
HDCompilerInstance.cpp1541 SmallVector<StringRef, 2> Best; in loadModule() local
1552 Best.clear(); in loadModule()
1556 Best.push_back((*J)->Name); in loadModule()
1561 if (Best.size() == 1) { in loadModule()
1564 << Path[I].first << Module->getFullModuleName() << Best[0] in loadModule()
1567 Best[0]); in loadModule()
1569 Sub = Module->findSubmodule(Best[0]); in loadModule()
/NextBSD/contrib/dialog/po/
HDnb.po76 msgstr "Bestått"
/NextBSD/contrib/llvm/lib/Transforms/Scalar/
HDLoopStrengthReduce.cpp3922 Formula &Best = LU.Formulae[P.first->second]; in FilterOutUndesirableDedicatedRegisters() local
3926 CostBest.RateFormula(TTI, Best, Regs, VisitedRegs, L, LU.Offsets, SE, in FilterOutUndesirableDedicatedRegisters()
3929 std::swap(F, Best); in FilterOutUndesirableDedicatedRegisters()
3932 " in favor of formula "; Best.print(dbgs()); in FilterOutUndesirableDedicatedRegisters()
4156 const SCEV *Best = nullptr; in NarrowSearchSpaceByPickingWinnerRegs() local
4161 if (!Best) in NarrowSearchSpaceByPickingWinnerRegs()
4162 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs()
4166 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs()
4172 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best in NarrowSearchSpaceByPickingWinnerRegs()
4174 Taken.insert(Best); in NarrowSearchSpaceByPickingWinnerRegs()
[all …]
/NextBSD/contrib/llvm/lib/Support/
HDCommandLine.cpp293 Option *Best = nullptr; in LookupNearestOption() local
310 if (!Best || Distance < BestDistance) { in LookupNearestOption()
311 Best = O; in LookupNearestOption()
321 return Best; in LookupNearestOption()
/NextBSD/contrib/llvm/tools/clang/include/clang/Sema/
HDOverload.h779 OverloadCandidateSet::iterator& Best,
/NextBSD/contrib/subversion/subversion/libsvn_fs_base/notes/
HDTODO104 not clear what cache policy would be effective. Best to record some
/NextBSD/usr.sbin/bsdconfig/share/
HDkeymap.subr185 add_keymap($3, 4, keym) # Best match
/NextBSD/contrib/ntp/ntpd/
HDntpd-opts.def245 .Sx "Starting NTP (Best Current Practice)"
257 .Ss "Starting NTP (Best Current Practice)"

12