Searched refs:Best (Results 1 - 23 of 23) sorted by relevance

/freebsd-11.0-release/contrib/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.h178 void setBest(SISchedCandidate &Best) { argument
179 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
180 SU = Best.SU;
181 Reason = Best.Reason;
182 SGPRUsage = Best.SGPRUsage;
183 VGPRUsage = Best.VGPRUsage;
184 IsLowLatency = Best.IsLowLatency;
185 LowLatencyOffset = Best.LowLatencyOffset;
186 HasLowLatencyNonWaitedParent = Best.HasLowLatencyNonWaitedParent;
369 void setBest(SIBlockSchedCandidate &Best) { argument
[all...]
H A DSIMachineScheduler.cpp1463 std::vector<SIScheduleBlock*>::iterator Best; local
1516 Best = I;
1517 DEBUG(dbgs() << "Best Current Choice: " << Cand.Block->getID() << ' '
1533 ReadyBlocks.erase(Best);
1849 SIScheduleBlockResult Best, Temp; local
1892 Best = Scheduler.scheduleVariant(SISchedulerBlockCreatorVariant::LatenciesAlone,
1897 if (Best.MaxVGPRUsage > 180) {
1910 if (Temp.MaxVGPRUsage < Best.MaxVGPRUsage)
1911 Best = Temp;
1916 if (Best
[all...]
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp122 std::vector<SUnit *>::iterator Best = Queue.begin();
125 if (Picker(*Best, *I))
126 Best = I;
127 SUnit *V = *Best;
128 if (Best != std::prev(Queue.end()))
129 std::swap(*Best, Queue.back());
H A DMachineTraceMetrics.cpp321 const MachineBasicBlock *Best = nullptr; local
331 if (!Best || Depth < BestDepth)
332 Best = Pred, BestDepth = Depth;
334 return Best;
343 const MachineBasicBlock *Best = nullptr; local
359 if (!Best || Height < BestHeight)
360 Best = Succ, BestHeight = Height;
362 return Best;
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Sema/
H A DSemaOverload.cpp3056 OverloadCandidateSet::iterator Best; local
3059 Best, true)) {
3063 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function);
3069 User.FoundConversionFunction = Best->FoundDecl;
3239 OverloadCandidateSet::iterator Best; local
3241 Best, true)) {
3246 = dyn_cast<CXXConstructorDecl>(Best->Function)) {
3258 if (Best->Conversions[0].isEllipsis())
3261 User.Before = Best->Conversions[0].Standard;
3267 User.FoundConversionFunction = Best
4218 OverloadCandidateSet::iterator Best; local
5585 OverloadCandidateSet::iterator Best; local
[all...]
H A DSemaInit.cpp410 OverloadCandidateSet::iterator Best; local
413 .BestViableFunction(SemaRef, Kind.getLocation(), Best);
416 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function);
3356 OverloadCandidateSet::iterator &Best,
3420 return CandidateSet.BestViableFunction(S, DeclLoc, Best);
3466 OverloadCandidateSet::iterator Best; local
3486 CandidateSet, Ctors, Best,
3503 CandidateSet, Ctors, Best,
3522 !cast<CXXConstructorDecl>(Best->Function)->isUserProvided()) {
3531 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best
3352 ResolveConstructorOverload(Sema &S, SourceLocation DeclLoc, MultiExprArg Args, OverloadCandidateSet &CandidateSet, DeclContext::lookup_result Ctors, OverloadCandidateSet::iterator &Best, bool CopyInitializing, bool AllowExplicit, bool OnlyListConstructors, bool IsListInit) argument
3926 OverloadCandidateSet::iterator Best; local
4545 OverloadCandidateSet::iterator Best; local
5370 OverloadCandidateSet::iterator Best; local
5478 OverloadCandidateSet::iterator Best; local
6988 OverloadCandidateSet::iterator Best; local
7177 OverloadCandidateSet::iterator Best; local
7249 OverloadCandidateSet::iterator Best; local
[all...]
H A DSemaTemplateInstantiate.cpp2320 SmallVectorImpl<MatchResult>::iterator Best = Matched.begin(); local
2333 for (SmallVectorImpl<MatchResult>::iterator P = Best + 1,
2336 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial,
2339 Best = P;
2348 if (P != Best &&
2349 getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial,
2351 != Best->Partial) {
2377 ClassTemplatePartialSpecializationDecl *OrigPartialSpec = Best->Partial;
2388 ClassTemplateSpec->setInstantiationOf(Best->Partial, Best
[all...]
H A DSemaExprCXX.cpp1999 OverloadCandidateSet::iterator Best; local
2000 switch (Candidates.BestViableFunction(*this, StartLoc, Best)) {
2003 FunctionDecl *FnDecl = Best->Function;
2005 Best->FoundDecl, Diagnose) == AR_inaccessible)
2031 << Best->Function->isDeleted()
2033 << getDeletedOrUnavailableSuffix(Best->Function)
4759 OverloadCandidateSet::iterator Best; local
4760 switch (CandidateSet.BestViableFunction(Self, QuestionLoc, Best)) {
4764 Self.PerformImplicitConversion(LHS.get(), Best->BuiltinTypes.ParamTypes[0],
4765 Best
[all...]
H A DSemaTemplate.cpp2790 SmallVector<MatchResult, 4>::iterator Best = Matched.begin(); local
2803 for (SmallVector<MatchResult, 4>::iterator P = Best + 1,
2806 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial,
2809 Best = P;
2817 if (P != Best && getMoreSpecializedPartialSpecialization(
2818 P->Partial, Best->Partial,
2819 PointOfInstantiation) != Best->Partial) {
2827 InstantiationPattern = Best->Partial;
2828 InstantiationArgs = Best->Args;
H A DSemaTemplateDeduction.cpp4460 UnresolvedSetIterator Best = SpecBegin;
4462 = cast<FunctionDecl>(*Best)->getPrimaryTemplate();
4471 Best = I;
4482 if (I != Best &&
4493 return Best;
H A DSemaLookup.cpp2906 OverloadCandidateSet::iterator Best;
2907 switch (OCS.BestViableFunction(*this, SourceLocation(), Best)) {
2909 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
2914 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
H A DSemaExpr.cpp1913 OverloadCandidateSet::iterator Best; local
1925 switch (OCS.BestViableFunction(*this, R.getNameLoc(), Best)) {
1927 ND = Best->FoundDecl;
4554 OverloadCandidateSet::iterator Best; local
4560 switch (OCS.BestViableFunction(S, NameLoc, Best)) {
4562 ND = Best->FoundDecl;
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp602 std::vector<SUnit *>::iterator Best = Queue.begin();
604 signed BestCost = SUSchedulingCost(*Best);
610 Best = I;
618 if (Picker(*Best, *I))
619 Best = I;
622 SUnit *V = *Best;
623 if (Best != std::prev(Queue.end()))
624 std::swap(*Best, Queue.back());
H A DScheduleDAGRRList.cpp465 SDNode *Best = nullptr; local
472 if (!Best || (MyMaxNest > BestMaxNest)) {
473 Best = New;
477 assert(Best);
479 return Best;
1750 std::vector<SUnit *>::iterator Best = Q.begin(); local
1753 if (Picker(*Best, *I))
1754 Best = I;
1755 SUnit *V = *Best;
1756 if (Best !
[all...]
/freebsd-11.0-release/contrib/compiler-rt/lib/ubsan/
H A Dubsan_diag.cc236 Range *Best = 0; local
239 (!Best ||
240 Best->getStart().getMemoryLocation() >
242 Best = &Ranges[I];
243 return Best;
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h819 void setBest(SchedCandidate &Best) { argument
820 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
821 SU = Best.SU;
822 Reason = Best.Reason;
823 RPDelta = Best.RPDelta;
824 ResDelta = Best.ResDelta;
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Basic/
H A DDiagnosticIDs.cpp567 StringRef Best;
585 Best = "";
588 Best = O.getName();
593 return Best;
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Format/
H A DUnwrappedLineFormatter.cpp766 /// solution space that leads to \c Best.
767 void reconstructPath(LineState &State, StateNode *Best) { argument
770 while (Best->Previous) {
771 Path.push_front(Best);
772 Best = Best->Previous;
/freebsd-11.0-release/contrib/llvm/utils/TableGen/
H A DFixedLenDecoderEmitter.cpp448 const Filter &Best) const;
1383 const Filter &Best) const {
1384 unsigned Opc = Best.getSingletonOpc();
1396 Best.getVariableFC().emitTableEntries(TableInfo);
1691 const Filter &Best = Filters[BestIndex];
1692 if (Best.getNumFiltered() == 1)
1693 emitSingletonTableEntry(TableInfo, Best);
1695 Best.emitTableEntry(TableInfo);
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Frontend/
H A DCompilerInstance.cpp1538 SmallVector<StringRef, 2> Best; local
1549 Best.clear();
1553 Best.push_back((*J)->Name);
1558 if (Best.size() == 1) {
1561 << Path[I].first << Module->getFullModuleName() << Best[0]
1564 Best[0]); local
1566 Sub = Module->findSubmodule(Best[0]);
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp3924 Formula &Best = LU.Formulae[P.first->second]; local
3928 CostBest.RateFormula(TTI, Best, Regs, VisitedRegs, L, LU.Offsets, SE,
3931 std::swap(F, Best);
3934 " in favor of formula "; Best.print(dbgs());
4154 const SCEV *Best = nullptr; local
4159 if (!Best)
4160 Best = Reg;
4164 Best = Reg;
4170 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best
4172 Taken.insert(Best);
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Sema/
H A DOverload.h785 OverloadCandidateSet::iterator& Best,
/freebsd-11.0-release/contrib/llvm/lib/Support/
H A DCommandLine.cpp293 Option *Best = nullptr; local
309 if (!Best || Distance < BestDistance) {
310 Best = O;
320 return Best;

Completed in 300 milliseconds