Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A 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 …]
H A DGCNILPSched.cpp241 auto Best = AvailQueue.begin(); in pickCandidate() local
243 const auto *NewBestSU = pickBest(Best->SU, I->SU); in pickCandidate()
244 if (NewBestSU != Best->SU) { in pickCandidate()
246 Best = I; in pickCandidate()
249 return &*Best; in pickCandidate()
H A DSIMachineScheduler.cpp1557 std::vector<SIScheduleBlock*>::iterator Best; in pickBlock() local
1607 Best = I; in pickBlock()
1622 ReadyBlocks.erase(Best); in pickBlock()
1862 SIScheduleBlockResult Best, Temp; in schedule() local
1909 Best = Scheduler.scheduleVariant(SISchedulerBlockCreatorVariant::LatenciesAlone, in schedule()
1914 if (Best.MaxVGPRUsage > 180) { in schedule()
1929 if (Temp.MaxVGPRUsage < Best.MaxVGPRUsage) in schedule()
1930 Best = Temp; in schedule()
1935 if (Best.MaxVGPRUsage > 200) { in schedule()
1950 if (Temp.MaxVGPRUsage < Best.MaxVGPRUsage) in schedule()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/
H A DMipsELFObjectWriter.cpp100 InputIt Best = Last; in find_best() local
105 if (Best == Last || BetterThan(*I, *Best)) in find_best()
106 Best = I; in find_best()
112 return Best; in find_best()
418 auto Best = Sorted.end(); in sortRelocs() local
423 (Best == Sorted.end() || R1.Addend < Best->R.Addend || in sortRelocs()
424 (!Best->Matched && R1.Addend == Best->R.Addend))) in sortRelocs()
425 Best = J; in sortRelocs()
427 if (Best != Sorted.end() && R.Addend == Best->R.Addend) in sortRelocs()
428 Best->Matched = true; in sortRelocs()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A 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()
H A DMachineTraceMetrics.cpp362 const MachineBasicBlock *Best = nullptr; in pickTracePred() local
372 if (!Best || Depth < BestDepth) { in pickTracePred()
373 Best = Pred; in pickTracePred()
377 return Best; in pickTracePred()
386 const MachineBasicBlock *Best = nullptr; in pickTraceSucc() local
402 if (!Best || Height < BestHeight) { in pickTraceSucc()
403 Best = Succ; in pickTraceSucc()
407 return Best; in pickTraceSucc()
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZMachineScheduler.cpp177 Candidate Best; in pickNode() local
184 if (Best.SU == nullptr || c < Best) { in pickNode()
185 Best = c; in pickNode()
194 if (!SU->isScheduleHigh && Best.noCost()) in pickNode()
198 assert (Best.SU != nullptr); in pickNode()
199 return Best.SU; in pickNode()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A 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()
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaOverload.cpp1737 if (Cand->Best) in TryUserDefinedConversion()
3913 OverloadCandidateSet::iterator Best; in IsInitializerListConstructorConversion() local
3915 CandidateSet.BestViableFunction(S, From->getBeginLoc(), Best)) { in IsInitializerListConstructorConversion()
3919 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function); in IsInitializerListConstructorConversion()
3925 User.FoundConversionFunction = Best->FoundDecl; in IsInitializerListConstructorConversion()
4093 OverloadCandidateSet::iterator Best; in IsUserDefinedConversion() local
4095 CandidateSet.BestViableFunction(S, From->getBeginLoc(), Best)) { in IsUserDefinedConversion()
4100 = dyn_cast<CXXConstructorDecl>(Best->Function)) { in IsUserDefinedConversion()
4112 if (Best->Conversions[0].isEllipsis()) in IsUserDefinedConversion()
4115 User.Before = Best->Conversions[0].Standard; in IsUserDefinedConversion()
[all …]
H A DSemaInit.cpp657 OverloadCandidateSet::iterator Best; in PerformEmptyInit() local
660 .BestViableFunction(SemaRef, Kind.getLocation(), Best); in PerformEmptyInit()
663 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function); in PerformEmptyInit()
4349 DeclContext::lookup_result Ctors, OverloadCandidateSet::iterator &Best, in ResolveConstructorOverload() argument
4447 return CandidateSet.BestViableFunction(S, DeclLoc, Best); in ResolveConstructorOverload()
4558 OverloadCandidateSet::iterator Best; in TryConstructorInitialization() local
4577 S, Kind.getLocation(), Args, CandidateSet, DestType, Ctors, Best, in TryConstructorInitialization()
4597 Best, CopyInitialization, AllowExplicit, in TryConstructorInitialization()
4614 if (auto *CD = dyn_cast<CXXConversionDecl>(Best->Function)) { in TryConstructorInitialization()
4619 Sequence.AddUserConversionStep(CD, Best->FoundDecl, ConvType, in TryConstructorInitialization()
[all …]
H A DSemaExprCXX.cpp1863 if (FunctionTemplateDecl *Best = S.getMoreSpecializedTemplate( in Compare() local
1869 return Best == PrimaryTemplate ? 1 : -1; in Compare()
1934 UsualDeallocFnInfo Best; in resolveDeallocationOverload() local
1944 if (!Best) { in resolveDeallocationOverload()
1945 Best = Info; in resolveDeallocationOverload()
1950 int ComparisonResult = Best.Compare(S, Info, IDP); in resolveDeallocationOverload()
1959 Best = Info; in resolveDeallocationOverload()
1964 return Best; in resolveDeallocationOverload()
2002 auto Best = resolveDeallocationOverload(S, ops, IDP, loc); in doesUsualArrayDeleteWantSize() local
2003 return Best && isSizedDeallocation(Best.IDP.PassSize); in doesUsualArrayDeleteWantSize()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/ubsan/
H A Dubsan_diag.cpp242 Range *Best = 0; in upperBound() local
245 (!Best || in upperBound()
246 Best->getStart().getMemoryLocation() > in upperBound()
248 Best = &Ranges[I]; in upperBound()
249 return Best; in upperBound()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimpleLoopUnswitch.cpp3438 std::optional<NonTrivialUnswitchCandidate> Best; in findBestNonTrivialUnswitchCandidate() local
3465 if (!Best || CandidateCost < Best->Cost) { in findBestNonTrivialUnswitchCandidate()
3466 Best = Candidate; in findBestNonTrivialUnswitchCandidate()
3467 Best->Cost = CandidateCost; in findBestNonTrivialUnswitchCandidate()
3470 assert(Best && "Must be!"); in findBestNonTrivialUnswitchCandidate()
3471 return *Best; in findBestNonTrivialUnswitchCandidate()
3524 NonTrivialUnswitchCandidate Best = findBestNonTrivialUnswitchCandidate( in unswitchBestCondition() local
3527 assert(Best.TI && "Failed to find loop unswitch candidate"); in unswitchBestCondition()
3528 assert(Best.Cost && "Failed to compute cost"); in unswitchBestCondition()
3530 if (*Best.Cost >= UnswitchThreshold) { in unswitchBestCondition()
[all …]
H A DLoopStrengthReduce.cpp4786 Formula &Best = LU.Formulae[P.first->second]; in FilterOutUndesirableDedicatedRegisters() local
4790 CostBest.RateFormula(Best, Regs, VisitedRegs, LU, in FilterOutUndesirableDedicatedRegisters()
4793 std::swap(F, Best); in FilterOutUndesirableDedicatedRegisters()
4797 Best.print(dbgs()); dbgs() << '\n'); in FilterOutUndesirableDedicatedRegisters()
5065 Formula &Best = LU.Formulae[P.first->second]; in NarrowSearchSpaceByFilterFormulaWithSameScaledReg() local
5066 if (IsBetterThan(F, Best)) in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5067 std::swap(F, Best); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5071 Best.print(dbgs()); dbgs() << '\n'); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5282 ScalarEvolution &SE, const SCEV *Best, in IsSimplerBaseSCEVForTarget() argument
5285 if (Best->getType() != Reg->getType() || in IsSimplerBaseSCEVForTarget()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanSLP.cpp321 VPValue *Best = nullptr; in getBest() local
338 Best = Candidate; in getBest()
345 << *cast<VPInstruction>(Best)->getUnderlyingInstr() in getBest()
347 Candidates.erase(Best); in getBest()
349 return {Mode, Best}; in getBest()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h1174 void setBest(SchedCandidate &Best) { in setBest()
1175 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest()
1176 SU = Best.SU; in setBest()
1177 Reason = Best.Reason; in setBest()
1178 AtTop = Best.AtTop; in setBest()
1179 RPDelta = Best.RPDelta; in setBest()
1180 ResDelta = Best.ResDelta; in setBest()
/freebsd/contrib/llvm-project/clang/include/clang/Sema/
H A DOverload.h966 unsigned Best : 1;
1457 OverloadCandidateSet::iterator& Best);
1488 OverloadingResult ResultForBestCandidate(const iterator &Best);
1493 OverloadCandidateSet::iterator &Best);
1495 OverloadCandidateSet::iterator &Best);
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/
H A 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
/freebsd/libexec/atrun/
H A DLEGAL15 Best regards
/freebsd/usr.bin/at/
H A DLEGAL14 Best regards
/freebsd/contrib/llvm-project/clang/lib/Basic/
H A DDiagnosticIDs.cpp752 StringRef Best; in getNearestOption() local
770 Best = ""; in getNearestOption()
773 Best = O.getName(); in getNearestOption()
778 return Best; in getNearestOption()
/freebsd/crypto/openssl/demos/sslecho/
H A DREADME.md26 Best to create the 'pem' files using an actual hostname.
/freebsd/contrib/dialog/po/
H A Dnb.po76 msgstr "Bestått"
/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DDecoderEmitter.cpp607 const Filter &Best) const;
1522 const Filter &Best) const { in emitSingletonTableEntry()
1523 EncodingIDAndOpcode Opc = Best.getSingletonOpc(); in emitSingletonTableEntry()
1535 Best.getVariableFC().emitTableEntries(TableInfo); in emitSingletonTableEntry()
1824 const Filter &Best = Filters[BestIndex]; in emitTableEntries() local
1825 if (Best.getNumFiltered() == 1) in emitTableEntries()
1826 emitSingletonTableEntry(TableInfo, Best); in emitTableEntries()
1828 Best.emitTableEntry(TableInfo); in emitTableEntries()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonSubtarget.cpp657 SUnit *Best = nullptr; in isBestZeroLatency() local
664 Best = Dst; in isBestZeroLatency()
666 if (Best != Dst) in isBestZeroLatency()

123