/freebsd-current/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIMachineScheduler.h | 181 void setBest(SISchedCandidate &Best) { argument 182 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); 183 SU = Best.SU; 184 Reason = Best.Reason; 185 SGPRUsage = Best.SGPRUsage; 186 VGPRUsage = Best.VGPRUsage; 187 IsLowLatency = Best.IsLowLatency; 188 LowLatencyOffset = Best.LowLatencyOffset; 189 HasLowLatencyNonWaitedParent = Best.HasLowLatencyNonWaitedParent; 373 void setBest(SIBlockSchedCandidate &Best) { argument [all...] |
H A D | GCNILPSched.cpp | 243 auto Best = AvailQueue.begin(); 245 auto NewBestSU = pickBest(Best->SU, I->SU); 246 if (NewBestSU != Best->SU) { 248 Best = I; 251 return &*Best;
|
H A D | SIMachineScheduler.cpp | 1575 std::vector<SIScheduleBlock*>::iterator Best; local 1627 Best = I; 1628 LLVM_DEBUG(dbgs() << "Best Current Choice: " << Cand.Block->getID() << ' ' 1642 ReadyBlocks.erase(Best); 1882 SIScheduleBlockResult Best, Temp; local 1929 Best = Scheduler.scheduleVariant(SISchedulerBlockCreatorVariant::LatenciesAlone, 1934 if (Best.MaxVGPRUsage > 180) { 1949 if (Temp.MaxVGPRUsage < Best.MaxVGPRUsage) 1950 Best = Temp; 1955 if (Best [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LatencyPriorityQueue.cpp | 117 std::vector<SUnit *>::iterator Best = Queue.begin(); 120 if (Picker(*Best, *I)) 121 Best = I; 122 SUnit *V = *Best; 123 if (Best != std::prev(Queue.end())) 124 std::swap(*Best, Queue.back());
|
H A D | MachineTraceMetrics.cpp | 348 const MachineBasicBlock *Best = nullptr; local 358 if (!Best || Depth < BestDepth) { 359 Best = Pred; 363 return Best; 372 const MachineBasicBlock *Best = nullptr; local 388 if (!Best || Height < BestHeight) { 389 Best = Succ; 393 return Best;
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
H A D | SystemZMachineScheduler.cpp | 175 Candidate Best; local 178 // SU is the next candidate to be compared against current Best. 182 if (Best.SU == nullptr || c < Best) { 183 Best = c; 184 LLVM_DEBUG(dbgs() << "** Best so far: ";); 191 // resources, we can stop iterating if Best looks good. 192 if (!SU->isScheduleHigh && Best.noCost()) 196 assert (Best.SU != nullptr); 197 return Best [all...] |
/freebsd-current/contrib/llvm-project/clang/lib/Tooling/ |
H A D | InterpolatingCompilationDatabase.cpp | 351 std::pair<size_t, int> Best = local 356 llvm::dbgs() << "interpolate: chose " << OriginalPaths[Best.first] 361 << " score=" << Best.second << "\n"); 362 return OriginalPaths[Best.first]; 423 ScoredCandidate Best = {size_t(-1), false, 0, 0}; local 430 if (!S.Preferred && Best.Preferred) 432 if (S.Preferred == Best.Preferred) { 433 if (S.Points < Best.Points) 435 if (S.Points == Best.Points) { 437 if (S.PrefixLength < Best [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ResourcePriorityQueue.cpp | 589 std::vector<SUnit *>::iterator Best = Queue.begin(); 591 int BestCost = SUSchedulingCost(*Best); 596 Best = I; 603 if (Picker(*Best, *I)) 604 Best = I; 607 SUnit *V = *Best; 608 if (Best != std::prev(Queue.end())) 609 std::swap(*Best, Queue.back());
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanSLP.cpp | 265 VPValue *Best = nullptr; 282 Best = Candidate; 289 << *cast<VPInstruction>(Best)->getUnderlyingInstr() 291 Candidates.erase(Best); 293 return {Mode, Best};
|
/freebsd-current/contrib/llvm-project/compiler-rt/lib/ubsan/ |
H A D | ubsan_diag.cpp | 242 Range *Best = 0; local 245 (!Best || 246 Best->getStart().getMemoryLocation() > 248 Best = &Ranges[I]; 249 return Best;
|
/freebsd-current/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaOverload.cpp | 1599 if (Cand->Best) 3647 OverloadCandidateSet::iterator Best; 3649 CandidateSet.BestViableFunction(S, From->getBeginLoc(), Best)) { 3653 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function); 3659 User.FoundConversionFunction = Best->FoundDecl; 3827 OverloadCandidateSet::iterator Best; 3829 CandidateSet.BestViableFunction(S, From->getBeginLoc(), Best)) { 3834 = dyn_cast<CXXConstructorDecl>(Best->Function)) { 3845 if (Best->Conversions[0].isEllipsis()) 3848 User.Before = Best [all...] |
H A D | SemaInit.cpp | 549 OverloadCandidateSet::iterator Best; local 552 .BestViableFunction(SemaRef, Kind.getLocation(), Best); 555 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function); 4093 DeclContext::lookup_result Ctors, OverloadCandidateSet::iterator &Best, 4191 return CandidateSet.BestViableFunction(S, DeclLoc, Best); 4272 OverloadCandidateSet::iterator Best; 4291 S, Kind.getLocation(), Args, CandidateSet, DestType, Ctors, Best, 4305 Best, CopyInitialization, AllowExplicit, 4322 if (auto *CD = dyn_cast<CXXConversionDecl>(Best->Function)) { 4327 Sequence.AddUserConversionStep(CD, Best [all...] |
H A D | SemaExprCXX.cpp | 1794 UsualDeallocFnInfo Best; 1802 if (!Best) { 1803 Best = Info; 1809 if (Best.isBetterThan(Info, WantSize, WantAlign)) 1814 if (BestFns && Info.isBetterThan(Best, WantSize, WantAlign)) 1817 Best = Info; 1822 return Best; 1855 auto Best = resolveDeallocationOverload( 1858 return Best && Best [all...] |
H A D | SemaTemplateInstantiate.cpp | 3723 SmallVectorImpl<MatchResult>::iterator Best = Matched.begin(); 3736 for (SmallVectorImpl<MatchResult>::iterator P = Best + 1, 3740 P->Partial, Best->Partial, PointOfInstantiation) == 3742 Best = P; 3751 if (P != Best && S.getMoreSpecializedPartialSpecialization( 3752 P->Partial, Best->Partial, 3753 PointOfInstantiation) != Best->Partial) { 3779 ClassTemplateSpec->setInstantiationOf(Best->Partial, Best->Args);
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/ |
H A D | MipsELFObjectWriter.cpp | 113 InputIt Best = Last; local 120 if (Best == Last || BetterThan(*I, *Best)) { 122 Best = I; 131 return Best;
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineScheduler.h | 1152 void setBest(SchedCandidate &Best) { argument 1153 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); 1154 SU = Best.SU; 1155 Reason = Best.Reason; 1156 AtTop = Best.AtTop; 1157 RPDelta = Best.RPDelta; 1158 ResDelta = Best.ResDelta;
|
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | SimpleLoopUnswitch.cpp | 3409 std::optional<NonTrivialUnswitchCandidate> Best; local 3436 if (!Best || CandidateCost < Best->Cost) { 3437 Best = Candidate; 3438 Best->Cost = CandidateCost; 3441 assert(Best && "Must be!"); 3442 return *Best; 3495 NonTrivialUnswitchCandidate Best = findBestNonTrivialUnswitchCandidate( local 3498 assert(Best.TI && "Failed to find loop unswitch candidate"); 3499 assert(Best [all...] |
H A D | LoopStrengthReduce.cpp | 4528 Formula &Best = LU.Formulae[P.first->second]; 4532 CostBest.RateFormula(Best, Regs, VisitedRegs, LU); 4534 std::swap(F, Best); 4538 Best.print(dbgs()); dbgs() << '\n'); 4802 Formula &Best = LU.Formulae[P.first->second]; 4803 if (IsBetterThan(F, Best)) 4804 std::swap(F, Best); 4808 Best.print(dbgs()); dbgs() << '\n'); 5015 // Check if Best and Reg are SCEVs separated by a constant amount C, and if so 5019 ScalarEvolution &SE, const SCEV *Best, [all...] |
/freebsd-current/contrib/llvm-project/clang/lib/Basic/ |
H A D | DiagnosticIDs.cpp | 707 StringRef Best; 725 Best = ""; 728 Best = O.getName(); 733 return Best;
|
/freebsd-current/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | DecoderEmitter.cpp | 519 const Filter &Best) const; 1483 const Filter &Best) const { 1484 EncodingIDAndOpcode Opc = Best.getSingletonOpc(); 1496 Best.getVariableFC().emitTableEntries(TableInfo); 1790 const Filter &Best = Filters[BestIndex]; 1791 if (Best.getNumFiltered() == 1) 1792 emitSingletonTableEntry(TableInfo, Best); 1794 Best.emitTableEntry(TableInfo);
|
/freebsd-current/contrib/llvm-project/clang/include/clang/Sema/ |
H A D | Overload.h | 861 bool Best : 1; member in struct:clang::OverloadCandidate 1167 OverloadCandidateSet::iterator& Best);
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonSubtarget.cpp | 659 SUnit *Best = nullptr; 666 Best = Dst; 668 if (Best != Dst)
|
/freebsd-current/contrib/llvm-project/clang/lib/Format/ |
H A D | UnwrappedLineFormatter.cpp | 1294 /// solution space that leads to \c Best. 1295 void reconstructPath(LineState &State, StateNode *Best) { 1298 while (Best->Previous) { 1299 Path.push_back(Best); 1300 Best = Best->Previous;
|
/freebsd-current/contrib/llvm-project/clang/lib/Frontend/ |
H A D | CompilerInstance.cpp | 2071 SmallVector<StringRef, 2> Best; local 2080 Best.clear(); 2084 Best.push_back(SubModule->Name); 2089 if (Best.size() == 1) { 2091 << Path[I].first << Module->getFullModuleName() << Best[0] 2094 Best[0]); local 2096 Sub = Module->findSubmodule(Best[0]);
|
/freebsd-current/contrib/llvm-project/llvm/lib/FileCheck/ |
H A D | FileCheck.cpp | 1318 size_t Best = StringRef::npos; local 1336 if (Quality < BestQuality || Best == StringRef::npos) { 1337 Best = i; 1345 if (Best && Best != StringRef::npos && BestQuality < 50) { 1348 getCheckTy(), Buffer, Best, 0, Diags);
|