| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIMachineScheduler.h | 181 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 D | GCNILPSched.cpp | 241 auto Best = AvailQueue.begin(); in pickCandidate() local
243 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 D | SIMachineScheduler.cpp | 1567 std::vector<SIScheduleBlock*>::iterator Best; in pickBlock() local
1619 Best = I; in pickBlock()
1634 ReadyBlocks.erase(Best); in pickBlock()
1874 SIScheduleBlockResult Best, Temp; in schedule() local
1921 Best = Scheduler.scheduleVariant(SISchedulerBlockCreatorVariant::LatenciesAlone, in schedule()
1926 if (Best.MaxVGPRUsage > 180) { in schedule()
1941 if (Temp.MaxVGPRUsage < Best.MaxVGPRUsage) in schedule()
1942 Best = Temp; in schedule()
1947 if (Best.MaxVGPRUsage > 200) { in schedule()
1962 if (Temp.MaxVGPRUsage < Best.MaxVGPRUsage) in schedule()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | LatencyPriorityQueue.cpp | 117 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 D | MachineTraceMetrics.cpp | 348 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/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
| H A D | SystemZMachineScheduler.cpp | 175 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/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ResourcePriorityQueue.cpp | 589 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 D | SemaOverload.cpp | 1649 if (Cand->Best) in TryUserDefinedConversion()
3681 OverloadCandidateSet::iterator Best; in IsInitializerListConstructorConversion() local
3683 CandidateSet.BestViableFunction(S, From->getBeginLoc(), Best)) { in IsInitializerListConstructorConversion()
3687 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function); in IsInitializerListConstructorConversion()
3693 User.FoundConversionFunction = Best->FoundDecl; in IsInitializerListConstructorConversion()
3861 OverloadCandidateSet::iterator Best; in IsUserDefinedConversion() local
3863 CandidateSet.BestViableFunction(S, From->getBeginLoc(), Best)) { in IsUserDefinedConversion()
3868 = dyn_cast<CXXConstructorDecl>(Best->Function)) { in IsUserDefinedConversion()
3879 if (Best->Conversions[0].isEllipsis()) in IsUserDefinedConversion()
3882 User.Before = Best->Conversions[0].Standard; in IsUserDefinedConversion()
[all …]
|
| H A D | SemaInit.cpp | 611 OverloadCandidateSet::iterator Best; in PerformEmptyInit() local
614 .BestViableFunction(SemaRef, Kind.getLocation(), Best); in PerformEmptyInit()
617 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function); in PerformEmptyInit()
4230 DeclContext::lookup_result Ctors, OverloadCandidateSet::iterator &Best, in ResolveConstructorOverload() argument
4328 return CandidateSet.BestViableFunction(S, DeclLoc, Best); in ResolveConstructorOverload()
4409 OverloadCandidateSet::iterator Best; in TryConstructorInitialization() local
4428 S, Kind.getLocation(), Args, CandidateSet, DestType, Ctors, Best, in TryConstructorInitialization()
4442 Best, CopyInitialization, AllowExplicit, in TryConstructorInitialization()
4459 if (auto *CD = dyn_cast<CXXConversionDecl>(Best->Function)) { in TryConstructorInitialization()
4464 Sequence.AddUserConversionStep(CD, Best->FoundDecl, ConvType, in TryConstructorInitialization()
[all …]
|
| H A D | SemaExprCXX.cpp | 1840 UsualDeallocFnInfo Best; in resolveDeallocationOverload() local
1848 if (!Best) { in resolveDeallocationOverload()
1849 Best = Info; in resolveDeallocationOverload()
1855 if (Best.isBetterThan(Info, WantSize, WantAlign)) in resolveDeallocationOverload()
1860 if (BestFns && Info.isBetterThan(Best, WantSize, WantAlign)) in resolveDeallocationOverload()
1863 Best = Info; in resolveDeallocationOverload()
1868 return Best; in resolveDeallocationOverload()
1901 auto Best = resolveDeallocationOverload( in doesUsualArrayDeleteWantSize() local
1904 return Best && Best.HasSizeT; in doesUsualArrayDeleteWantSize()
2580 OverloadCandidateSet::iterator Best; in resolveAllocationOverload() local
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 265 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/contrib/llvm-project/compiler-rt/lib/ubsan/ |
| H A D | ubsan_diag.cpp | 242 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 D | SimpleLoopUnswitch.cpp | 3431 std::optional<NonTrivialUnswitchCandidate> Best; in findBestNonTrivialUnswitchCandidate()
3458 if (!Best || CandidateCost < Best->Cost) { in findBestNonTrivialUnswitchCandidate()
3459 Best = Candidate; in findBestNonTrivialUnswitchCandidate()
3460 Best->Cost = CandidateCost; in findBestNonTrivialUnswitchCandidate()
3463 assert(Best && "Must be!"); in findBestNonTrivialUnswitchCandidate()
3464 return *Best; in findBestNonTrivialUnswitchCandidate()
3517 NonTrivialUnswitchCandidate Best = findBestNonTrivialUnswitchCandidate( in unswitchBestCondition()
3520 assert(Best.TI && "Failed to find loop unswitch candidate"); in unswitchBestCondition()
3521 assert(Best in unswitchBestCondition()
3430 std::optional<NonTrivialUnswitchCandidate> Best; findBestNonTrivialUnswitchCandidate() local
3516 NonTrivialUnswitchCandidate Best = findBestNonTrivialUnswitchCandidate( unswitchBestCondition() local
[all...] |
| H A D | LoopStrengthReduce.cpp | 4811 Formula &Best = LU.Formulae[P.first->second]; in FilterOutUndesirableDedicatedRegisters() local
4815 CostBest.RateFormula(Best, Regs, VisitedRegs, LU); in FilterOutUndesirableDedicatedRegisters()
4817 std::swap(F, Best); in FilterOutUndesirableDedicatedRegisters()
4821 Best.print(dbgs()); dbgs() << '\n'); in FilterOutUndesirableDedicatedRegisters()
5089 Formula &Best = LU.Formulae[P.first->second]; in NarrowSearchSpaceByFilterFormulaWithSameScaledReg() local
5090 if (IsBetterThan(F, Best)) in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5091 std::swap(F, Best); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5095 Best.print(dbgs()); dbgs() << '\n'); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5306 ScalarEvolution &SE, const SCEV *Best, in IsSimplerBaseSCEVForTarget() argument
5309 if (Best->getType() != Reg->getType() || in IsSimplerBaseSCEVForTarget()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachineScheduler.h | 1152 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/contrib/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/ |
| H A D | MipsELFObjectWriter.cpp | 113 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/contrib/llvm-project/llvm/lib/Target/Mips/ |
| H A D | MipsScheduleP5600.td | 242 // 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/contrib/llvm-project/clang/lib/Basic/ |
| H A D | DiagnosticIDs.cpp | 720 StringRef Best; in getNearestOption() local
738 Best = ""; in getNearestOption()
741 Best = O.getName(); in getNearestOption()
746 return Best; in getNearestOption()
|
| /freebsd/libexec/atrun/ |
| H A D | LEGAL | 15 Best regards
|
| /freebsd/usr.bin/at/ |
| H A D | LEGAL | 14 Best regards
|
| /freebsd/contrib/dialog/po/ |
| H A D | nb.po | 76 msgstr "Bestått"
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | DecoderEmitter.cpp | 544 const Filter &Best) const;
1533 const Filter &Best) const { in emitSingletonTableEntry()
1534 EncodingIDAndOpcode Opc = Best.getSingletonOpc(); in emitSingletonTableEntry()
1546 Best.getVariableFC().emitTableEntries(TableInfo); in emitSingletonTableEntry()
1840 const Filter &Best = Filters[BestIndex]; in emitTableEntries() local
1841 if (Best.getNumFiltered() == 1) in emitTableEntries()
1842 emitSingletonTableEntry(TableInfo, Best); in emitTableEntries()
1844 Best.emitTableEntry(TableInfo); in emitTableEntries()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonSubtarget.cpp | 656 SUnit *Best = nullptr; in isBestZeroLatency() local
663 Best = Dst; in isBestZeroLatency()
665 if (Best != Dst) in isBestZeroLatency()
|
| /freebsd/contrib/llvm-project/clang/lib/Format/ |
| H A D | UnwrappedLineFormatter.cpp | 1304 void reconstructPath(LineState &State, StateNode *Best) { in reconstructPath() argument
1307 while (Best->Previous) { in reconstructPath()
1308 Path.push_back(Best); in reconstructPath()
1309 Best = Best->Previous; in reconstructPath()
|
| /freebsd/contrib/llvm-project/clang/lib/Frontend/ |
| H A D | CompilerInstance.cpp | 2122 SmallVector<StringRef, 2> Best; in loadModule() local
2131 Best.clear(); in loadModule()
2135 Best.push_back(SubModule->Name); in loadModule()
2140 if (Best.size() == 1) { in loadModule()
2142 << Path[I].first << Module->getFullModuleName() << Best[0] in loadModule()
2145 Best[0]); in loadModule()
2147 Sub = Module->findSubmodule(Best[0]); in loadModule()
|