Home
last modified time | relevance | path

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

123

/openbsd/src/gnu/llvm/llvm/lib/Target/AMDGPU/
DSIMachineScheduler.h181 void setBest(SISchedCandidate &Best) { in setBest()
182 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest()
183 SU = Best.SU; in setBest()
184 Reason = Best.Reason; in setBest()
185 SGPRUsage = Best.SGPRUsage; in setBest()
186 VGPRUsage = Best.VGPRUsage; in setBest()
187 IsLowLatency = Best.IsLowLatency; in setBest()
188 LowLatencyOffset = Best.LowLatencyOffset; in setBest()
189 HasLowLatencyNonWaitedParent = Best.HasLowLatencyNonWaitedParent; in setBest()
373 void setBest(SIBlockSchedCandidate &Best) { in setBest()
[all …]
DGCNILPSched.cpp243 auto Best = AvailQueue.begin(); in pickCandidate() local
245 auto NewBestSU = pickBest(Best->SU, I->SU); in pickCandidate()
246 if (NewBestSU != Best->SU) { in pickCandidate()
248 Best = I; in pickCandidate()
251 return &*Best; in pickCandidate()
DSIMachineScheduler.cpp1575 std::vector<SIScheduleBlock*>::iterator Best; in pickBlock() local
1627 Best = I; in pickBlock()
1642 ReadyBlocks.erase(Best); in pickBlock()
1882 SIScheduleBlockResult Best, Temp; in schedule() local
1929 Best = Scheduler.scheduleVariant(SISchedulerBlockCreatorVariant::LatenciesAlone, in schedule()
1934 if (Best.MaxVGPRUsage > 180) { in schedule()
1949 if (Temp.MaxVGPRUsage < Best.MaxVGPRUsage) in schedule()
1950 Best = Temp; in schedule()
1955 if (Best.MaxVGPRUsage > 200) { in schedule()
1970 if (Temp.MaxVGPRUsage < Best.MaxVGPRUsage) in schedule()
[all …]
/openbsd/src/gnu/llvm/clang/lib/Tooling/
DInterpolatingCompilationDatabase.cpp352 std::pair<size_t, int> Best = in chooseProxy() local
357 llvm::dbgs() << "interpolate: chose " << OriginalPaths[Best.first] in chooseProxy()
362 << " score=" << Best.second << "\n"); in chooseProxy()
363 return OriginalPaths[Best.first]; in chooseProxy()
424 ScoredCandidate Best = {size_t(-1), false, 0, 0}; in pickWinner() local
431 if (!S.Preferred && Best.Preferred) in pickWinner()
433 if (S.Preferred == Best.Preferred) { in pickWinner()
434 if (S.Points < Best.Points) in pickWinner()
436 if (S.Points == Best.Points) { in pickWinner()
438 if (S.PrefixLength < Best.PrefixLength) in pickWinner()
[all …]
/openbsd/src/gnu/llvm/llvm/lib/CodeGen/
DLatencyPriorityQueue.cpp117 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local
120 if (Picker(*Best, *I)) in pop()
121 Best = I; in pop()
122 SUnit *V = *Best; in pop()
123 if (Best != std::prev(Queue.end())) in pop()
124 std::swap(*Best, Queue.back()); in pop()
DMachineTraceMetrics.cpp333 const MachineBasicBlock *Best = nullptr; in pickTracePred() local
343 if (!Best || Depth < BestDepth) { in pickTracePred()
344 Best = Pred; in pickTracePred()
348 return Best; in pickTracePred()
357 const MachineBasicBlock *Best = nullptr; in pickTraceSucc() local
373 if (!Best || Height < BestHeight) { in pickTraceSucc()
374 Best = Succ; in pickTraceSucc()
378 return Best; in pickTraceSucc()
/openbsd/src/gnu/llvm/llvm/lib/Target/SystemZ/
DSystemZMachineScheduler.cpp175 Candidate Best; in pickNode() local
182 if (Best.SU == nullptr || c < Best) { in pickNode()
183 Best = c; in pickNode()
192 if (!SU->isScheduleHigh && Best.noCost()) in pickNode()
196 assert (Best.SU != nullptr); in pickNode()
197 return Best.SU; in pickNode()
/openbsd/src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
DResourcePriorityQueue.cpp589 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local
591 int BestCost = SUSchedulingCost(*Best); in pop()
596 Best = I; in pop()
603 if (Picker(*Best, *I)) in pop()
604 Best = I; in pop()
607 SUnit *V = *Best; in pop()
608 if (Best != std::prev(Queue.end())) in pop()
609 std::swap(*Best, Queue.back()); in pop()
/openbsd/src/gnu/llvm/clang/lib/Sema/
DSemaOverload.cpp1489 if (Cand->Best) in TryUserDefinedConversion()
3491 OverloadCandidateSet::iterator Best; in IsInitializerListConstructorConversion() local
3493 CandidateSet.BestViableFunction(S, From->getBeginLoc(), Best)) { in IsInitializerListConstructorConversion()
3497 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function); in IsInitializerListConstructorConversion()
3503 User.FoundConversionFunction = Best->FoundDecl; in IsInitializerListConstructorConversion()
3671 OverloadCandidateSet::iterator Best; in IsUserDefinedConversion() local
3673 CandidateSet.BestViableFunction(S, From->getBeginLoc(), Best)) { in IsUserDefinedConversion()
3678 = dyn_cast<CXXConstructorDecl>(Best->Function)) { in IsUserDefinedConversion()
3690 if (Best->Conversions[0].isEllipsis()) in IsUserDefinedConversion()
3693 User.Before = Best->Conversions[0].Standard; in IsUserDefinedConversion()
[all …]
DSemaInit.cpp546 OverloadCandidateSet::iterator Best; in PerformEmptyInit() local
549 .BestViableFunction(SemaRef, Kind.getLocation(), Best); in PerformEmptyInit()
552 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function); in PerformEmptyInit()
3985 OverloadCandidateSet::iterator &Best, in ResolveConstructorOverload() argument
4083 return CandidateSet.BestViableFunction(S, DeclLoc, Best); in ResolveConstructorOverload()
4162 OverloadCandidateSet::iterator Best; in TryConstructorInitialization() local
4181 CandidateSet, DestType, Ctors, Best, in TryConstructorInitialization()
4195 CandidateSet, DestType, Ctors, Best, in TryConstructorInitialization()
4214 if (auto *CD = dyn_cast<CXXConversionDecl>(Best->Function)) { in TryConstructorInitialization()
4219 Sequence.AddUserConversionStep(CD, Best->FoundDecl, ConvType, in TryConstructorInitialization()
[all …]
DSemaExprCXX.cpp1762 UsualDeallocFnInfo Best; in resolveDeallocationOverload() local
1770 if (!Best) { in resolveDeallocationOverload()
1771 Best = Info; in resolveDeallocationOverload()
1777 if (Best.isBetterThan(Info, WantSize, WantAlign)) in resolveDeallocationOverload()
1782 if (BestFns && Info.isBetterThan(Best, WantSize, WantAlign)) in resolveDeallocationOverload()
1785 Best = Info; in resolveDeallocationOverload()
1790 return Best; in resolveDeallocationOverload()
1823 auto Best = resolveDeallocationOverload( in doesUsualArrayDeleteWantSize() local
1826 return Best && Best.HasSizeT; in doesUsualArrayDeleteWantSize()
2510 OverloadCandidateSet::iterator Best; in resolveAllocationOverload() local
[all …]
/openbsd/src/gnu/llvm/llvm/include/llvm/CodeGen/
DMachineScheduler.h923 void setBest(SchedCandidate &Best) { in setBest()
924 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest()
925 SU = Best.SU; in setBest()
926 Reason = Best.Reason; in setBest()
927 AtTop = Best.AtTop; in setBest()
928 RPDelta = Best.RPDelta; in setBest()
929 ResDelta = Best.ResDelta; in setBest()
/openbsd/src/gnu/llvm/compiler-rt/lib/ubsan/
Dubsan_diag.cpp234 Range *Best = 0; in upperBound() local
237 (!Best || in upperBound()
238 Best->getStart().getMemoryLocation() > in upperBound()
240 Best = &Ranges[I]; in upperBound()
241 return Best; in upperBound()
/openbsd/src/gnu/llvm/llvm/lib/Transforms/Vectorize/
DVPlanSLP.cpp265 VPValue *Best = nullptr; in getBest() local
282 Best = Candidate; in getBest()
289 << *cast<VPInstruction>(Best)->getUnderlyingInstr() in getBest()
291 Candidates.erase(Best); in getBest()
293 return {Mode, Best}; in getBest()
/openbsd/src/gnu/llvm/llvm/lib/Target/Mips/MCTargetDesc/
DMipsELFObjectWriter.cpp113 InputIt Best = Last; in find_best() local
120 if (Best == Last || BetterThan(*I, *Best)) { in find_best()
122 Best = I; in find_best()
131 return Best; in find_best()
/openbsd/src/gnu/llvm/llvm/lib/Transforms/Scalar/
DSimpleLoopUnswitch.cpp3001 std::optional<NonTrivialUnswitchCandidate> Best; in findBestNonTrivialUnswitchCandidate() local
3027 if (!Best || CandidateCost < Best->Cost) { in findBestNonTrivialUnswitchCandidate()
3028 Best = Candidate; in findBestNonTrivialUnswitchCandidate()
3029 Best->Cost = CandidateCost; in findBestNonTrivialUnswitchCandidate()
3032 assert(Best && "Must be!"); in findBestNonTrivialUnswitchCandidate()
3033 return *Best; in findBestNonTrivialUnswitchCandidate()
3056 NonTrivialUnswitchCandidate Best = findBestNonTrivialUnswitchCandidate( in unswitchBestCondition() local
3059 assert(Best.TI && "Failed to find loop unswitch candidate"); in unswitchBestCondition()
3060 assert(Best.Cost && "Failed to compute cost"); in unswitchBestCondition()
3062 if (*Best.Cost >= UnswitchThreshold) { in unswitchBestCondition()
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Target/Mips/
DMipsScheduleP5600.td242 // Best/Common/Worst case = 7 / 23 / 27
247 // Best/Common/Worst case = 7 / 23 / 27
252 // Best/Common/Worst case = 7 / 31 / 35
257 // Best/Common/Worst case = 7 / 19 / 23
262 // Best/Common/Worst case = 7 / 27 / 31
267 // Best/Common/Worst case = 7 / 27 / 27
272 // Best/Common/Worst case = 7 / 27 / 31
277 // Best/Common/Worst case = 7 / 27 / 31
282 // Best/Common/Worst case = 7 / 35 / 39
/openbsd/src/gnu/llvm/clang/lib/Basic/
DDiagnosticIDs.cpp722 StringRef Best; in getNearestOption() local
740 Best = ""; in getNearestOption()
743 Best = O.getName(); in getNearestOption()
748 return Best; in getNearestOption()
/openbsd/src/gnu/llvm/llvm/utils/TableGen/
DDecoderEmitter.cpp517 const Filter &Best) const;
1481 const Filter &Best) const { in emitSingletonTableEntry()
1482 EncodingIDAndOpcode Opc = Best.getSingletonOpc(); in emitSingletonTableEntry()
1494 Best.getVariableFC().emitTableEntries(TableInfo); in emitSingletonTableEntry()
1788 const Filter &Best = Filters[BestIndex]; in emitTableEntries() local
1789 if (Best.getNumFiltered() == 1) in emitTableEntries()
1790 emitSingletonTableEntry(TableInfo, Best); in emitTableEntries()
1792 Best.emitTableEntry(TableInfo); in emitTableEntries()
/openbsd/src/usr.sbin/nsd/
DREADME.md5 [![CII Best Practices](https://bestpractices.coreinfrastructure.org/projects/1462/badge)](https://b…
/openbsd/src/gnu/llvm/llvm/lib/Target/Hexagon/
DHexagonSubtarget.cpp658 SUnit *Best = nullptr; in isBestZeroLatency() local
665 Best = Dst; in isBestZeroLatency()
667 if (Best != Dst) in isBestZeroLatency()
/openbsd/src/gnu/llvm/clang/lib/Frontend/
DCompilerInstance.cpp2046 SmallVector<StringRef, 2> Best; in loadModule() local
2055 Best.clear(); in loadModule()
2059 Best.push_back(SubModule->Name); in loadModule()
2064 if (Best.size() == 1) { in loadModule()
2066 << Path[I].first << Module->getFullModuleName() << Best[0] in loadModule()
2069 Best[0]); in loadModule()
2071 Sub = Module->findSubmodule(Best[0]); in loadModule()
/openbsd/src/gnu/llvm/clang/lib/Format/
DUnwrappedLineFormatter.cpp1259 void reconstructPath(LineState &State, StateNode *Best) { in reconstructPath() argument
1262 while (Best->Previous) { in reconstructPath()
1263 Path.push_back(Best); in reconstructPath()
1264 Best = Best->Previous; in reconstructPath()
/openbsd/src/gnu/llvm/clang/include/clang/Sema/
DOverload.h858 bool Best : 1; member
1164 OverloadCandidateSet::iterator& Best);
/openbsd/src/gnu/llvm/llvm/lib/Analysis/
DMemoryDependenceAnalysis.cpp301 auto GetClosestDependency = [this](Instruction *Best, Instruction *Other) { in getInvariantGroupPointerDependency() argument
303 if (Best == nullptr || DT.dominates(Best, Other)) in getInvariantGroupPointerDependency()
305 return Best; in getInvariantGroupPointerDependency()

123