HomeSort by: relevance | last modified time | path
    Searched defs:Best (Results 1 - 23 of 23) sorted by relevancy

  /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/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/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/CodeGen/
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/gpl3/binutils/dist/zlib/contrib/dotzlib/DotZLib/
DotZLib.cs 74 Best = 9,
  /src/external/gpl3/binutils.old/dist/zlib/contrib/dotzlib/DotZLib/
DotZLib.cs 74 Best = 9,
  /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/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/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/clang/lib/Sema/
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...]
SemaTemplate.cpp 2900 // best-effort for now; we may fail to match at all for a dependent type
2937 // mode is best-effort only.
2956 // For a best-effort search, keep looking until we find a location.
4567 SmallVector<MatchResult, 4>::iterator Best = Matched.begin();
4580 for (SmallVector<MatchResult, 4>::iterator P = Best + 1,
4583 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial,
4586 Best = P;
4589 // Determine if the best partial specialization is more specialized than
4594 if (P != Best && getMoreSpecializedPartialSpecialization(
4595 P->Partial, Best->Partial
    [all...]
SemaExpr.cpp 636 // generally best to say that void types just doesn't undergo
2232 // If there's a best viable function among the results, only mention
2237 OverloadCandidateSet::iterator Best;
2238 if (Candidates.BestViableFunction(*this, R.getNameLoc(), Best) ==
2241 R.addDecl(Best->FoundDecl.getDecl(), Best->FoundDecl.getAccess());
2284 OverloadCandidateSet::iterator Best;
2296 switch (OCS.BestViableFunction(*this, R.getNameLoc(), Best)) {
2298 ND = Best->FoundDecl;
5749 OverloadCandidateSet::iterator Best;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGRRList.cpp 496 SDNode *Best = nullptr;
503 if (!Best || (MyMaxNest > BestMaxNest)) {
504 Best = New;
508 assert(Best);
510 return Best;
1616 // Pick the best node to schedule taking all constraints into
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
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/clang/include/clang/Sema/
Overload.h 73 /// Requests that only tied-for-best candidates be shown.
157 /// Derived-to-base (C++ [over.best.ics])
521 /// ambiguous conversion (C++0x [over.best.ics]p10).
610 /// per C++ [over.best.ics]p10.
818 /// Whether this candidate is the best viable function, or tied for being
819 /// the best viable function.
825 bool Best : 1;
1121 /// Find the best viable function on this overload set, if it exists.
1123 OverloadCandidateSet::iterator& Best);
  /src/external/apache2/llvm/dist/clang/lib/Frontend/
CompilerInstance.cpp 1930 SmallVector<StringRef, 2> Best;
1941 Best.clear();
1945 Best.push_back((*J)->Name);
1950 if (Best.size() == 1) {
1953 << Path[I].first << Module->getFullModuleName() << Best[0]
1956 Best[0]);
1958 Sub = Module->findSubmodule(Best[0]);
  /src/external/apache2/llvm/dist/llvm/lib/Support/
CommandLine.cpp 585 Option *Best = nullptr;
605 if (!Best || Distance < BestDistance) {
606 Best = O;
616 return Best;
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonConstExtenders.cpp 1388 // Find the best candidate with respect to the number of extenders covered.
1394 int32_t Best = BestIt->first;
1395 ExtValue BestV(ER, Best);
1396 for (RangeTree::Node *N : Tree.nodesWith(Best)) {
  /src/external/apache2/llvm/dist/llvm/lib/FileCheck/
FileCheck.cpp 1338 // just compare against the regex itself and hope for the best.
1461 // Attempt to find the closest/best fuzzy match. Usually an error happens
1463 // would like to show the user a best guess at what "should have" matched, to
1466 size_t Best = StringRef::npos;
1484 if (Quality < BestQuality || Best == StringRef::npos) {
1485 Best = i;
1493 if (Best && Best != StringRef::npos && BestQuality < 50) {
1496 getCheckTy(), Buffer, Best, 0, Diags);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp 453 // register and hope for the best.
1712 // Strictly speaking it would best to just rely on canonical formulae.
3038 /// Finding the best IV chain is potentially a scheduling problem. Since LSR
4325 /// by other uses, pick the best one and delete the others.
4334 // Collect the best formula for each unique set of shared registers. This
4389 Formula &Best = LU.Formulae[P.first->second];
4393 CostBest.RateFormula(Best, Regs, VisitedRegs, LU);
4395 std::swap(F, Best);
4399 Best.print(dbgs()); dbgs() << '\n');
4591 /// Pick the best one and delete the others
    [all...]

Completed in 109 milliseconds