Home
last modified time | relevance | path

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

123

/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.h181 void setBest(SISchedCandidate &Best) { 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()
375 Block = Best.Block; in setBest()
376 Reason = Best.Reason; in setBest()
377 IsHighLatency = Best.IsHighLatency; in setBest()
378 VGPRUsageDiff = Best.VGPRUsageDiff; in setBest()
[all …]
H A 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()
H A 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
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()
1971 Best = Temp; in schedule()
[all …]
/freebsd-14.2/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.cpp348 const MachineBasicBlock *Best = nullptr; in pickTracePred() local
358 if (!Best || Depth < BestDepth) { in pickTracePred()
359 Best = Pred; in pickTracePred()
363 return Best; in pickTracePred()
372 const MachineBasicBlock *Best = nullptr; in pickTraceSucc() local
388 if (!Best || Height < BestHeight) { in pickTraceSucc()
389 Best = Succ; in pickTraceSucc()
393 return Best; in pickTraceSucc()
/freebsd-14.2/contrib/llvm-project/clang/lib/Tooling/
H A DInterpolatingCompilationDatabase.cpp351 std::pair<size_t, int> Best = in chooseProxy() local
362 return OriginalPaths[Best.first]; in chooseProxy()
430 if (!S.Preferred && Best.Preferred) in pickWinner()
432 if (S.Preferred == Best.Preferred) { in pickWinner()
433 if (S.Points < Best.Points) in pickWinner()
435 if (S.Points == Best.Points) { in pickWinner()
437 if (S.PrefixLength < Best.PrefixLength) in pickWinner()
441 if (S.Index > Best.Index) in pickWinner()
448 Best = S; in pickWinner()
452 if (Best.Index == size_t(-1)) in pickWinner()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A 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()
/freebsd-14.2/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-14.2/contrib/llvm-project/clang/lib/Sema/
H A DSemaOverload.cpp1599 if (Cand->Best) in TryUserDefinedConversion()
10708 Best = end(); in BestViableFunction()
10714 Best = Cand; in BestViableFunction()
10720 Best = end(); in BestViableFunction()
10726 if (Best == end()) in BestViableFunction()
10733 Best->Best = true; in BestViableFunction()
10755 if (Best == end()) in BestViableFunction()
10759 if (Best->Function && Best->Function->isDeleted()) in BestViableFunction()
12756 Best = I; in eliminiateSuboptimalOverloadCandidates()
13870 if (Best && *Best != CS.end()) in chooseRecoveryType()
[all …]
H A DSemaInit.cpp549 OverloadCandidateSet::iterator Best; in PerformEmptyInit() local
4272 OverloadCandidateSet::iterator Best; in TryConstructorInitialization() local
4852 OverloadCandidateSet::iterator Best; in TryRefInitWithConversionFunction() local
5765 OverloadCandidateSet::iterator Best; in TryUserDefinedConversion() local
5844 if (Best->FinalConversion.First || Best->FinalConversion.Second || in TryUserDefinedConversion()
5845 Best->FinalConversion.Third) { in TryUserDefinedConversion()
6781 OverloadCandidateSet::iterator Best; in CopyObject() local
6924 OverloadCandidateSet::iterator Best; in CheckCXX98CompatAccessibleCopy() local
10012 OverloadCandidateSet::iterator Best; in Diagnose() local
10656 OverloadCandidateSet::iterator Best; in DeduceTemplateSpecializationFromInitializer() local
[all …]
H A DSemaExprCXX.cpp1794 UsualDeallocFnInfo Best; in resolveDeallocationOverload() local
1802 if (!Best) { in resolveDeallocationOverload()
1803 Best = Info; in resolveDeallocationOverload()
1817 Best = Info; in resolveDeallocationOverload()
1822 return Best; in resolveDeallocationOverload()
1858 return Best && Best.HasSizeT; in doesUsualArrayDeleteWantSize()
2551 OverloadCandidateSet::iterator Best; in resolveAllocationOverload() local
3886 OverloadCandidateSet::iterator Best; in resolveBuiltinNewDeleteOverload() local
6317 LHS.get(), Best->BuiltinParamTypes[0], Best->Conversions[0], in FindConditionalOverload()
6324 RHS.get(), Best->BuiltinParamTypes[1], Best->Conversions[1], in FindConditionalOverload()
[all …]
/freebsd-14.2/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-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A 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()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimpleLoopUnswitch.cpp3436 if (!Best || CandidateCost < Best->Cost) { in findBestNonTrivialUnswitchCandidate()
3437 Best = Candidate; in findBestNonTrivialUnswitchCandidate()
3438 Best->Cost = CandidateCost; in findBestNonTrivialUnswitchCandidate()
3441 assert(Best && "Must be!"); in findBestNonTrivialUnswitchCandidate()
3442 return *Best; in findBestNonTrivialUnswitchCandidate()
3508 if (Best.hasPendingInjection()) { in unswitchBestCondition()
3509 Best = injectPendingInvariantConditions(Best, L, DT, LI, AC, MSSAU); in unswitchBestCondition()
3515 if (Best.TI != PartialIVCondBranch) in unswitchBestCondition()
3529 if (isGuard(Best.TI)) in unswitchBestCondition()
3530 Best.TI = in unswitchBestCondition()
[all …]
H A DLoopStrengthReduce.cpp4534 std::swap(F, Best); in FilterOutUndesirableDedicatedRegisters()
4803 if (IsBetterThan(F, Best)) in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4804 std::swap(F, Best); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5055 const SCEV *Best = nullptr; in NarrowSearchSpaceByPickingWinnerRegs() local
5060 if (!Best) { in NarrowSearchSpaceByPickingWinnerRegs()
5061 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs()
5066 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs()
5078 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs()
5088 Taken.insert(Best); in NarrowSearchSpaceByPickingWinnerRegs()
5094 if (!LU.Regs.count(Best)) continue; in NarrowSearchSpaceByPickingWinnerRegs()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h1152 void setBest(SchedCandidate &Best) { in setBest()
1153 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest()
1154 SU = Best.SU; in setBest()
1155 Reason = Best.Reason; in setBest()
1156 AtTop = Best.AtTop; in setBest()
1157 RPDelta = Best.RPDelta; in setBest()
1158 ResDelta = Best.ResDelta; in setBest()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/
H A 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()
/freebsd-14.2/libexec/atrun/
H A DLEGAL15 Best regards
/freebsd-14.2/usr.bin/at/
H A DLEGAL14 Best regards
/freebsd-14.2/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-14.2/contrib/llvm-project/clang/lib/Basic/
H A DDiagnosticIDs.cpp707 StringRef Best; in getNearestOption() local
725 Best = ""; in getNearestOption()
728 Best = O.getName(); in getNearestOption()
733 return Best; in getNearestOption()
/freebsd-14.2/contrib/dialog/po/
H A Dnb.po76 msgstr "Bestått"
/freebsd-14.2/contrib/llvm-project/llvm/utils/TableGen/
H A DDecoderEmitter.cpp519 const Filter &Best) const;
1483 const Filter &Best) const { in emitSingletonTableEntry()
1484 EncodingIDAndOpcode Opc = Best.getSingletonOpc(); in emitSingletonTableEntry()
1496 Best.getVariableFC().emitTableEntries(TableInfo); in emitSingletonTableEntry()
1790 const Filter &Best = Filters[BestIndex]; in emitTableEntries() local
1791 if (Best.getNumFiltered() == 1) in emitTableEntries()
1792 emitSingletonTableEntry(TableInfo, Best); in emitTableEntries()
1794 Best.emitTableEntry(TableInfo); in emitTableEntries()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonSubtarget.cpp659 SUnit *Best = nullptr; in isBestZeroLatency() local
666 Best = Dst; in isBestZeroLatency()
668 if (Best != Dst) in isBestZeroLatency()
/freebsd-14.2/contrib/llvm-project/clang/lib/Format/
H A DUnwrappedLineFormatter.cpp1295 void reconstructPath(LineState &State, StateNode *Best) { in reconstructPath() argument
1298 while (Best->Previous) { in reconstructPath()
1299 Path.push_back(Best); in reconstructPath()
1300 Best = Best->Previous; in reconstructPath()

123