| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | SIMachineScheduler.h | 181 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 D | GCNILPSched.cpp | 243 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 D | SIMachineScheduler.cpp | 1575 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 …]
|
| /llvm-project-15.0.7/clang-tools-extra/clangd/ |
| H A D | HeaderSourceSwitch.cpp | 113 auto Best = Candidates.begin(); in getCorrespondingHeaderOrSource() local 115 if (It->second > Best->second) in getCorrespondingHeaderOrSource() 116 Best = It; in getCorrespondingHeaderOrSource() 117 else if (It->second == Best->second && It->first() < Best->first()) in getCorrespondingHeaderOrSource() 120 Best = It; in getCorrespondingHeaderOrSource() 122 return Path(Best->first()); in getCorrespondingHeaderOrSource()
|
| H A D | FuzzyMatch.cpp | 98 auto Best = std::max(Scores[PatN][WordN][Miss].Score, in match() local 100 if (isAwful(Best)) in match() 103 ScoreScale * std::min(PerfectBonus * PatN, std::max<int>(0, Best)); in match()
|
| /llvm-project-15.0.7/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 | 334 const MachineBasicBlock *Best = nullptr; in pickTracePred() local 344 if (!Best || Depth < BestDepth) { in pickTracePred() 345 Best = Pred; in pickTracePred() 349 return Best; in pickTracePred() 358 const MachineBasicBlock *Best = nullptr; in pickTraceSucc() local 374 if (!Best || Height < BestHeight) { in pickTraceSucc() 375 Best = Succ; in pickTraceSucc() 379 return Best; in pickTraceSucc()
|
| /llvm-project-15.0.7/clang/lib/Tooling/ |
| H A D | InterpolatingCompilationDatabase.cpp | 353 std::pair<size_t, int> Best = in chooseProxy() local 364 return OriginalPaths[Best.first]; in chooseProxy() 432 if (!S.Preferred && Best.Preferred) in pickWinner() 434 if (S.Preferred == Best.Preferred) { in pickWinner() 435 if (S.Points < Best.Points) in pickWinner() 437 if (S.Points == Best.Points) { in pickWinner() 439 if (S.PrefixLength < Best.PrefixLength) in pickWinner() 443 if (S.Index > Best.Index) in pickWinner() 450 Best = S; in pickWinner() 454 if (Best.Index == size_t(-1)) in pickWinner() [all …]
|
| /llvm-project-15.0.7/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()
|
| /llvm-project-15.0.7/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()
|
| /llvm-project-15.0.7/clang/lib/Sema/ |
| H A D | SemaOverload.cpp | 1382 if (Cand->Best) in TryUserDefinedConversion() 10154 Best = end(); in BestViableFunction() 10160 Best = Cand; in BestViableFunction() 10164 if (Best == end()) in BestViableFunction() 10171 Best->Best = true; in BestViableFunction() 10193 if (Best == end()) in BestViableFunction() 10197 if (Best->Function && Best->Function->isDeleted()) in BestViableFunction() 12144 Best = I; in eliminiateSuboptimalOverloadCandidates() 13213 if (Best && *Best != CS.end()) in chooseRecoveryType() 13955 Args[0], Best->BuiltinParamTypes[0], Best->Conversions[0], in CreateOverloadedBinOp() [all …]
|
| H A D | SemaInit.cpp | 533 OverloadCandidateSet::iterator Best; in PerformEmptyInit() local 4135 OverloadCandidateSet::iterator Best; in TryConstructorInitialization() local 4687 OverloadCandidateSet::iterator Best; in TryRefInitWithConversionFunction() local 5348 OverloadCandidateSet::iterator Best; in TryUserDefinedConversion() local 5427 if (Best->FinalConversion.First || Best->FinalConversion.Second || in TryUserDefinedConversion() 5428 Best->FinalConversion.Third) { in TryUserDefinedConversion() 6316 OverloadCandidateSet::iterator Best; in CopyObject() local 6461 OverloadCandidateSet::iterator Best; in CheckCXX98CompatAccessibleCopy() local 9493 OverloadCandidateSet::iterator Best; in Diagnose() local 10105 OverloadCandidateSet::iterator Best; in DeduceTemplateSpecializationFromInitializer() local [all …]
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | MachineScheduler.h | 896 void setBest(SchedCandidate &Best) { in setBest() 897 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest() 898 SU = Best.SU; in setBest() 899 Reason = Best.Reason; in setBest() 900 AtTop = Best.AtTop; in setBest() 901 RPDelta = Best.RPDelta; in setBest() 902 ResDelta = Best.ResDelta; in setBest()
|
| /llvm-project-15.0.7/compiler-rt/lib/ubsan/ |
| H A D | ubsan_diag.cpp | 234 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()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 264 VPValue *Best = nullptr; in getBest() local 281 Best = Candidate; in getBest() 288 << *cast<VPInstruction>(Best)->getUnderlyingInstr() in getBest() 290 Candidates.erase(Best); in getBest() 292 return {Mode, Best}; in getBest()
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-readobj/ELF/ARM/ |
| H A D | attribute-6.s | 44 @CHECK-OBJ-NEXT: Description: Best Debugging 51 @CHECK-OBJ-NEXT: Description: Best Accuracy
|
| /llvm-project-15.0.7/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()
|
| /llvm-project-15.0.7/clang-tools-extra/pseudo/lib/ |
| H A D | DirectiveTree.cpp | 286 Score Best; in walk() local 307 if (TookTrivial || !C.Taken || BranchScore > Best) { in walk() 308 Best = BranchScore; in walk() 312 return Best; in walk()
|
| /llvm-project-15.0.7/clang-tools-extra/clangd/index/ |
| H A D | StdLib.cpp | 286 Best[langFromOpts(LO)].load(std::memory_order_acquire); in isBest() 292 int OldVersion = Best[L].load(std::memory_order_acquire); in add() 351 while (!Best[L].compare_exchange_weak(OldVersion, NewVersion, in add()
|
| H A D | StdLib.h | 57 std::atomic<int> Best[2] = {{-1}, {-1}}; variable
|
| /llvm-project-15.0.7/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
|
| /llvm-project-15.0.7/clang/lib/Basic/ |
| H A D | DiagnosticIDs.cpp | 721 StringRef Best; in getNearestOption() local 739 Best = ""; in getNearestOption() 742 Best = O.getName(); in getNearestOption() 747 return Best; in getNearestOption()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/ARM/ |
| H A D | build-attributes-optimization-optnone.ll | 11 ; CHECK-OBJ-NEXT: Description: Best Debugging
|
| /llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/altera/ |
| H A D | id-dependent-backward-branch.rst | 27 Based on the `Altera SDK for OpenCL: Best Practices Guide
|
| H A D | single-work-item-barrier.rst | 18 Based on the `Altera SDK for OpenCL: Best Practices Guide
|