HomeSort by: relevance | last modified time | path
    Searched refs:Best (Results 1 - 25 of 45) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SIMachineScheduler.h 168 // The best SUnit candidate.
182 void setBest(SISchedCandidate &Best) {
183 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
184 SU = Best.SU;
185 Reason = Best.Reason;
186 SGPRUsage = Best.SGPRUsage;
187 VGPRUsage = Best.VGPRUsage;
188 IsLowLatency = Best.IsLowLatency;
189 LowLatencyOffset = Best.LowLatencyOffset;
190 HasLowLatencyNonWaitedParent = Best.HasLowLatencyNonWaitedParent
    [all...]
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;
SIMachineScheduler.cpp 35 // . The less the register pressure, the best load latencies are hidden
102 // equivalent to 4 instructions in the very best case (a VGPR is 64 work items,
1591 std::vector<SIScheduleBlock*>::iterator Best;
1643 Best = I;
1644 LLVM_DEBUG(dbgs() << "Best Current Choice: " << Cand.Block->getID() << ' '
1658 ReadyBlocks.erase(Best);
1902 SIScheduleBlockResult Best, Temp;
1943 Best = Scheduler.scheduleVariant(SISchedulerBlockCreatorVariant::LatenciesAlone,
1948 if (Best.MaxVGPRUsage > 180) {
1963 if (Temp.MaxVGPRUsage < Best.MaxVGPRUsage
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
LatencyPriorityQueue.cpp 119 std::vector<SUnit *>::iterator Best = Queue.begin();
122 if (Picker(*Best, *I))
123 Best = I;
124 SUnit *V = *Best;
125 if (Best != std::prev(Queue.end()))
126 std::swap(*Best, Queue.back());
MachineTraceMetrics.cpp 334 const MachineBasicBlock *Best = nullptr;
344 if (!Best || Depth < BestDepth) {
345 Best = Pred;
349 return Best;
358 const MachineBasicBlock *Best = nullptr;
374 if (!Best || Height < BestHeight) {
375 Best = Succ;
379 return Best;
  /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/
SystemZMachineScheduler.cpp 176 Candidate Best;
179 // SU is the next candidate to be compared against current Best.
182 // Remeber which SU is the best candidate.
183 if (Best.SU == nullptr || c < Best) {
184 Best = c;
185 LLVM_DEBUG(dbgs() << "** Best so far: ";);
192 // resources, we can stop iterating if Best looks good.
193 if (!SU->isScheduleHigh && Best.noCost())
197 assert (Best.SU != nullptr)
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Tooling/
InterpolatingCompilationDatabase.cpp 317 // Given a filename, FileIndex picks the best matching file from the underlying
355 // Returns the path for the file that best fits OriginalFilename.
363 std::pair<size_t, int> Best =
368 llvm::dbgs() << "interpolate: chose " << OriginalPaths[Best.first]
373 << " score=" << Best.second << "\n");
374 return OriginalPaths[Best.first];
434 // Choose the best candidate by (preferred, points, prefix length, alpha).
435 ScoredCandidate Best = {size_t(-1), false, 0, 0};
442 if (!S.Preferred && Best.Preferred)
444 if (S.Preferred == Best.Preferred)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ResourcePriorityQueue.cpp 594 std::vector<SUnit *>::iterator Best = Queue.begin();
596 int BestCost = SUSchedulingCost(*Best);
601 Best = I;
608 if (Picker(*Best, *I))
609 Best = I;
612 SUnit *V = *Best;
613 if (Best != std::prev(Queue.end()))
614 std::swap(*Best, Queue.back());
  /src/sys/external/bsd/compiler_rt/dist/lib/ubsan/
ubsan_diag.cc 229 Range *Best = 0;
232 (!Best ||
233 Best->getStart().getMemoryLocation() >
235 Best = &Ranges[I];
236 return Best;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
VPlanSLP.cpp 273 VPValue *Best = nullptr;
290 Best = Candidate;
296 LLVM_DEBUG(dbgs() << "Found best "
297 << *cast<VPInstruction>(Best)->getUnderlyingInstr()
299 Candidates.erase(Best);
301 return {Mode, Best};
322 LLVM_DEBUG(dbgs() << " Finding best value for lane " << Lane << "\n");
  /src/external/gpl3/gcc/dist/libsanitizer/ubsan/
ubsan_diag.cpp 242 Range *Best = 0;
245 (!Best ||
246 Best->getStart().getMemoryLocation() >
248 Best = &Ranges[I];
249 return Best;
  /src/external/gpl3/gcc.old/dist/libsanitizer/ubsan/
ubsan_diag.cpp 236 Range *Best = 0;
239 (!Best ||
240 Best->getStart().getMemoryLocation() >
242 Best = &Ranges[I];
243 return Best;
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
MachineScheduler.h 863 // The best SUnit candidate.
872 // Register pressure values for the best candidate.
875 // Critical resource consumption of the best candidate.
893 void setBest(SchedCandidate &Best) {
894 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
895 SU = Best.SU;
896 Reason = Best.Reason;
897 AtTop = Best.AtTop;
898 RPDelta = Best.RPDelta;
899 ResDelta = Best.ResDelta
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Sema/
SemaOverload.cpp 1384 if (Cand->Best)
1974 // C++ [over.best.ics]p6:
3365 OverloadCandidateSet::iterator Best;
3367 CandidateSet.BestViableFunction(S, From->getBeginLoc(), Best)) {
3371 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function);
3377 User.FoundConversionFunction = Best->FoundDecl;
3473 // C++20 [over.best.ics.general]/4.5:
3545 OverloadCandidateSet::iterator Best;
3547 CandidateSet.BestViableFunction(S, From->getBeginLoc(), Best)) {
3552 = dyn_cast<CXXConstructorDecl>(Best->Function))
    [all...]
SemaInit.cpp 533 OverloadCandidateSet::iterator Best;
536 .BestViableFunction(SemaRef, Kind.getLocation(), Best);
539 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function);
3928 OverloadCandidateSet::iterator &Best,
3943 // C++11 [over.best.ics]p4:
4026 return CandidateSet.BestViableFunction(S, DeclLoc, Best);
4031 /// resolution to select the best.
4100 // applicable constructors are enumerated, and the best one is chosen
4105 OverloadCandidateSet::iterator Best;
4124 CandidateSet, DestType, Ctors, Best,
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/MCTargetDesc/
MipsELFObjectWriter.cpp 101 /// Find the best match in the range [First, Last).
106 /// better match than B. The return value is the position of the best match.
108 /// This is similar to std::find_if but finds the best of multiple possible
113 InputIt Best = Last;
120 if (Best == Last || BetterThan(*I, *Best)) {
122 Best = I;
131 return Best;
466 // Find the best matching relocation for the current high part.
468 // compareMatchingRelocs for a description of what 'best' means
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Basic/
DiagnosticIDs.cpp 688 StringRef Best;
706 Best = "";
709 Best = O.getName();
714 return Best;
  /src/external/gpl3/binutils/dist/zlib/contrib/dotzlib/DotZLib/
DotZLib.cs 74 Best = 9,
UnitTests.cs 250 using (GZipStream gzOut = new GZipStream("gzstream.gz", CompressLevel.Best))
  /src/external/gpl3/binutils.old/dist/zlib/contrib/dotzlib/DotZLib/
DotZLib.cs 74 Best = 9,
UnitTests.cs 250 using (GZipStream gzOut = new GZipStream("gzstream.gz", CompressLevel.Best))
  /src/external/gpl3/gdb/dist/zlib/contrib/dotzlib/DotZLib/
DotZLib.cs 74 Best = 9,
  /src/external/gpl3/gdb.old/dist/zlib/contrib/dotzlib/DotZLib/
DotZLib.cs 74 Best = 9,
  /src/common/dist/zlib/contrib/dotzlib/DotZLib/
DotZLib.cs 74 Best = 9,
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonSubtarget.cpp 562 // Return true if these are the best two instructions to schedule
564 // latency. If there are multiple choices, choose the best, and change
589 // Check if the Dst instruction is the best candidate first.
590 SUnit *Best = nullptr;
597 Best = Dst;
599 if (Best != Dst)
631 // Check if the previous best destination instruction has a new zero
639 // Check if previous best source instruction has a new zero latency

Completed in 45 milliseconds

1 2