Searched defs:Best (Results 1 - 25 of 29) sorted by relevance

12

/external/swiftshader/third_party/LLVM/lib/Support/
H A DTargetRegistry.cpp33 const Target *Best = 0, *EquallyBest = 0; local
37 if (!Best || Qual > BestQuality) {
38 Best = &*it;
46 if (!Best) {
56 Best->Name + "\" and \"" + EquallyBest->Name + "\"";
60 return Best;
H A DCommandLine.cpp200 Option *Best = 0; local
216 if (!Best || Distance < BestDistance) {
217 Best = O;
227 return Best;
/external/llvm/lib/CodeGen/
H A DMachineTraceMetrics.cpp321 const MachineBasicBlock *Best = nullptr; local
331 if (!Best || Depth < BestDepth) {
332 Best = Pred;
336 return Best;
345 const MachineBasicBlock *Best = nullptr; local
361 if (!Best || Height < BestHeight) {
362 Best = Succ;
366 return Best;
/external/llvm/lib/Target/Mips/MCTargetDesc/
H A DMipsELFObjectWriter.cpp106 InputIt Best = Last; local
113 if (Best == Last || BetterThan(*I, *Best)) {
115 Best = I;
124 return Best;
/external/zlib/src/contrib/dotzlib/DotZLib/
H A DDotZLib.cs74 Best = 9, enumerator in enum:DotZLib.CompressLevel
/external/compiler-rt/lib/ubsan/
H A Dubsan_diag.cc226 Range *Best = 0; local
229 (!Best ||
230 Best->getStart().getMemoryLocation() >
232 Best = &Ranges[I];
233 return Best;
/external/swiftshader/third_party/LLVM/utils/FileCheck/
H A DFileCheck.cpp396 size_t Best = StringRef::npos; local
414 if (Quality < BestQuality || Best == StringRef::npos) {
415 Best = i;
423 if (Best && Best != StringRef::npos && BestQuality < 50) {
424 SM.PrintMessage(SMLoc::getFromPointer(Buffer.data() + Best),
/external/clang/lib/Format/
H A DUnwrappedLineFormatter.cpp766 /// solution space that leads to \c Best.
767 void reconstructPath(LineState &State, StateNode *Best) { argument
770 while (Best->Previous) {
771 Path.push_front(Best);
772 Best = Best->Previous;
/external/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp465 SDNode *Best = nullptr; local
472 if (!Best || (MyMaxNest > BestMaxNest)) {
473 Best = New;
477 assert(Best);
479 return Best;
1738 std::vector<SUnit *>::iterator Best = Q.begin(); local
1741 if (Picker(*Best, *I))
1742 Best = I;
1743 SUnit *V = *Best;
1744 if (Best !
[all...]
/external/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.h178 void setBest(SISchedCandidate &Best) { argument
179 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
180 SU = Best.SU;
181 Reason = Best.Reason;
182 SGPRUsage = Best.SGPRUsage;
183 VGPRUsage = Best.VGPRUsage;
184 IsLowLatency = Best.IsLowLatency;
185 LowLatencyOffset = Best.LowLatencyOffset;
186 HasLowLatencyNonWaitedParent = Best.HasLowLatencyNonWaitedParent;
369 void setBest(SIBlockSchedCandidate &Best) { argument
[all...]
H A DSIMachineScheduler.cpp1458 std::vector<SIScheduleBlock*>::iterator Best; local
1511 Best = I;
1512 DEBUG(dbgs() << "Best Current Choice: " << Cand.Block->getID() << ' '
1528 ReadyBlocks.erase(Best);
1784 SIScheduleBlockResult Best, Temp; local
1827 Best = Scheduler.scheduleVariant(SISchedulerBlockCreatorVariant::LatenciesAlone,
1832 if (Best.MaxVGPRUsage > 180) {
1845 if (Temp.MaxVGPRUsage < Best.MaxVGPRUsage)
1846 Best = Temp;
1851 if (Best
[all...]
/external/llvm/utils/FileCheck/
H A DFileCheck.cpp536 size_t Best = StringRef::npos; local
554 if (Quality < BestQuality || Best == StringRef::npos) {
555 Best = i;
563 if (Best && Best != StringRef::npos && BestQuality < 50) {
564 SM.PrintMessage(SMLoc::getFromPointer(Buffer.data() + Best),
/external/pdfium/third_party/lcms/src/
H A Dcmsnamed.c328 cmsInt32Number Best = -1; local
341 if (Best == -1) Best = i;
356 if (Best == -1)
357 Best = 0;
359 v = mlu ->Entries + Best;
/external/clang/lib/Frontend/
H A DCompilerInstance.cpp1570 SmallVector<StringRef, 2> Best; local
1581 Best.clear();
1585 Best.push_back((*J)->Name);
1590 if (Best.size() == 1) {
1593 << Path[I].first << Module->getFullModuleName() << Best[0]
1596 Best[0]); local
1598 Sub = Module->findSubmodule(Best[0]);
/external/clang/lib/Sema/
H A DSemaTemplateInstantiate.cpp2341 SmallVectorImpl<MatchResult>::iterator Best = Matched.begin(); local
2354 for (SmallVectorImpl<MatchResult>::iterator P = Best + 1,
2357 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial,
2360 Best = P;
2369 if (P != Best &&
2370 getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial,
2372 != Best->Partial) {
2398 ClassTemplatePartialSpecializationDecl *OrigPartialSpec = Best->Partial;
2409 ClassTemplateSpec->setInstantiationOf(Best->Partial, Best
[all...]
H A DSemaExprCXX.cpp2233 OverloadCandidateSet::iterator Best; local
2234 switch (Candidates.BestViableFunction(*this, StartLoc, Best)) {
2237 FunctionDecl *FnDecl = Best->Function;
2239 Best->FoundDecl, Diagnose) == AR_inaccessible)
2265 << Best->Function->isDeleted()
2267 << getDeletedOrUnavailableSuffix(Best->Function)
5034 OverloadCandidateSet::iterator Best; local
5035 switch (CandidateSet.BestViableFunction(Self, QuestionLoc, Best)) {
5039 Self.PerformImplicitConversion(LHS.get(), Best->BuiltinTypes.ParamTypes[0],
5040 Best
[all...]
H A DSemaInit.cpp422 OverloadCandidateSet::iterator Best; local
425 .BestViableFunction(SemaRef, Kind.getLocation(), Best);
428 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function);
3442 OverloadCandidateSet::iterator &Best,
3501 return CandidateSet.BestViableFunction(S, DeclLoc, Best);
3547 OverloadCandidateSet::iterator Best; local
3567 CandidateSet, Ctors, Best,
3584 CandidateSet, Ctors, Best,
3605 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function);
3627 Best
3438 ResolveConstructorOverload(Sema &S, SourceLocation DeclLoc, MultiExprArg Args, OverloadCandidateSet &CandidateSet, DeclContext::lookup_result Ctors, OverloadCandidateSet::iterator &Best, bool CopyInitializing, bool AllowExplicit, bool OnlyListConstructors, bool IsListInit) argument
4054 OverloadCandidateSet::iterator Best; local
4663 OverloadCandidateSet::iterator Best; local
5487 OverloadCandidateSet::iterator Best; local
5596 OverloadCandidateSet::iterator Best; local
7154 OverloadCandidateSet::iterator Best; local
7346 OverloadCandidateSet::iterator Best; local
7418 OverloadCandidateSet::iterator Best; local
[all...]
H A DSemaOverload.cpp3081 OverloadCandidateSet::iterator Best; local
3084 Best, true)) {
3088 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function);
3094 User.FoundConversionFunction = Best->FoundDecl;
3254 OverloadCandidateSet::iterator Best; local
3256 Best, true)) {
3261 = dyn_cast<CXXConstructorDecl>(Best->Function)) {
3273 if (Best->Conversions[0].isEllipsis())
3276 User.Before = Best->Conversions[0].Standard;
3282 User.FoundConversionFunction = Best
4237 OverloadCandidateSet::iterator Best; local
5607 OverloadCandidateSet::iterator Best; local
[all...]
/external/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h845 void setBest(SchedCandidate &Best) { argument
846 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
847 SU = Best.SU;
848 Reason = Best.Reason;
849 AtTop = Best.AtTop;
850 RPDelta = Best.RPDelta;
851 ResDelta = Best.ResDelta;
/external/llvm/lib/Support/
H A DCommandLine.cpp461 Option *Best = nullptr; local
477 if (!Best || Distance < BestDistance) {
478 Best = O;
488 return Best;
/external/swiftshader/third_party/LLVM/utils/TableGen/
H A DARMDecoderEmitter.cpp507 ARMFilter &Best);
1058 ARMFilter &Best) {
1060 unsigned Opc = Best.getSingletonOpc();
1068 Best.getVariableFC().emit(o, Indentation);
1371 ARMFilter &Best = bestFilter(); local
1372 if (Best.getNumFiltered() == 1)
1373 emitSingletonDecoder(o, Indentation, Best);
1056 emitSingletonDecoder(raw_ostream &o, unsigned &Indentation, ARMFilter &Best) argument
H A DFixedLenDecoderEmitter.cpp342 void emitSingletonDecoder(raw_ostream &o, unsigned &Indentation,Filter &Best);
895 Filter &Best) {
897 unsigned Opc = Best.getSingletonOpc();
905 Best.getVariableFC().emit(o, Indentation);
1201 Filter &Best = bestFilter(); local
1202 if (Best.getNumFiltered() == 1)
1203 emitSingletonDecoder(o, Indentation, Best);
894 emitSingletonDecoder(raw_ostream &o, unsigned &Indentation, Filter &Best) argument
/external/swiftshader/third_party/llvm-subzero/lib/Support/
H A DCommandLine.cpp481 Option *Best = nullptr; local
497 if (!Best || Distance < BestDistance) {
498 Best = O;
508 return Best;
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp1626 std::vector<SUnit *>::iterator Best = Q.begin(); local
1629 if (Picker(*Best, *I))
1630 Best = I;
1631 SUnit *V = *Best;
1632 if (Best != prior(Q.end()))
1633 std::swap(*Best, Q.back());
/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp2953 Formula &Best = LU.Formulae[P.first->second]; local
2959 CostBest.RateFormula(Best, Regs, VisitedRegs, L, LU.Offsets, SE, DT);
2962 std::swap(F, Best);
2965 " in favor of formula "; Best.print(dbgs());
3196 const SCEV *Best = 0; local
3203 if (!Best)
3204 Best = Reg;
3208 Best = Reg;
3214 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best
3216 Taken.insert(Best);
[all...]

Completed in 1050 milliseconds

12