Home
last modified time | relevance | path

Searched refs:Best (Results 1 – 25 of 32) sorted by relevance

12

/external/llvm/lib/Support/
DTargetRegistry.cpp33 const Target *Best = 0, *EquallyBest = 0; in lookupTarget() local
37 if (!Best || Qual > BestQuality) { in lookupTarget()
38 Best = &*it; in lookupTarget()
46 if (!Best) { in lookupTarget()
56 Best->Name + "\" and \"" + EquallyBest->Name + "\""; in lookupTarget()
60 return Best; in lookupTarget()
DCommandLine.cpp203 Option *Best = 0; in LookupNearestOption() local
219 if (!Best || Distance < BestDistance) { in LookupNearestOption()
220 Best = O; in LookupNearestOption()
230 return Best; in LookupNearestOption()
/external/llvm/lib/CodeGen/
DLatencyPriorityQueue.cpp121 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local
124 if (Picker(*Best, *I)) in pop()
125 Best = I; in pop()
126 SUnit *V = *Best; in pop()
127 if (Best != prior(Queue.end())) in pop()
128 std::swap(*Best, Queue.back()); in pop()
/external/clang/lib/Sema/
DSemaOverload.cpp2862 OverloadCandidateSet::iterator Best; in IsInitializerListConstructorConversion() local
2863 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) { in IsInitializerListConstructorConversion()
2866 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function); in IsInitializerListConstructorConversion()
2874 User.FoundConversionFunction = Best->FoundDecl; in IsInitializerListConstructorConversion()
3044 OverloadCandidateSet::iterator Best; in IsUserDefinedConversion() local
3045 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) { in IsUserDefinedConversion()
3049 = dyn_cast<CXXConstructorDecl>(Best->Function)) { in IsUserDefinedConversion()
3063 if (Best->Conversions[0].isEllipsis()) in IsUserDefinedConversion()
3066 User.Before = Best->Conversions[0].Standard; in IsUserDefinedConversion()
3072 User.FoundConversionFunction = Best->FoundDecl; in IsUserDefinedConversion()
[all …]
DSemaInit.cpp2797 OverloadCandidateSet::iterator &Best, in ResolveConstructorOverload() argument
2852 return CandidateSet.BestViableFunction(S, DeclLoc, Best); in ResolveConstructorOverload()
2910 OverloadCandidateSet::iterator Best; in TryConstructorInitialization() local
2922 CandidateSet, ConStart, ConEnd, Best, in TryConstructorInitialization()
2941 CandidateSet, ConStart, ConEnd, Best, in TryConstructorInitialization()
2960 cast<CXXConstructorDecl>(Best->Function)->isImplicit()) { in TryConstructorInitialization()
2968 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function); in TryConstructorInitialization()
2978 Best->FoundDecl.getAccess(), in TryConstructorInitialization()
3266 OverloadCandidateSet::iterator Best; in TryRefInitWithConversionFunction() local
3268 = CandidateSet.BestViableFunction(S, DeclLoc, Best, true)) in TryRefInitWithConversionFunction()
[all …]
DSemaTemplateInstantiate.cpp2164 SmallVector<MatchResult, 4>::iterator Best = Matched.begin(); in InstantiateClassTemplateSpecialization() local
2177 for (SmallVector<MatchResult, 4>::iterator P = Best + 1, in InstantiateClassTemplateSpecialization()
2180 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in InstantiateClassTemplateSpecialization()
2183 Best = P; in InstantiateClassTemplateSpecialization()
2192 if (P != Best && in InstantiateClassTemplateSpecialization()
2193 getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in InstantiateClassTemplateSpecialization()
2195 != Best->Partial) { in InstantiateClassTemplateSpecialization()
2221 ClassTemplatePartialSpecializationDecl *OrigPartialSpec = Best->Partial; in InstantiateClassTemplateSpecialization()
2232 ClassTemplateSpec->setInstantiationOf(Best->Partial, Best->Args); in InstantiateClassTemplateSpecialization()
DSemaExprCXX.cpp1683 OverloadCandidateSet::iterator Best; in FindAllocationOverload() local
1684 switch (Candidates.BestViableFunction(*this, StartLoc, Best)) { in FindAllocationOverload()
1687 FunctionDecl *FnDecl = Best->Function; in FindAllocationOverload()
1712 Best->FoundDecl, Diagnose) == AR_inaccessible) in FindAllocationOverload()
1739 << Best->Function->isDeleted() in FindAllocationOverload()
1741 << getDeletedOrUnavailableSuffix(Best->Function) in FindAllocationOverload()
3957 OverloadCandidateSet::iterator Best; in FindConditionalOverload() local
3958 switch (CandidateSet.BestViableFunction(Self, QuestionLoc, Best)) { in FindConditionalOverload()
3962 Self.PerformImplicitConversion(LHS.get(), Best->BuiltinTypes.ParamTypes[0], in FindConditionalOverload()
3963 Best->Conversions[0], Sema::AA_Converting); in FindConditionalOverload()
[all …]
DSemaTemplateDeduction.cpp3969 UnresolvedSetIterator Best = SpecBegin; in getMostSpecialized() local
3971 = cast<FunctionDecl>(*Best)->getPrimaryTemplate(); in getMostSpecialized()
3980 Best = I; in getMostSpecialized()
3991 if (I != Best && in getMostSpecialized()
4002 return Best; in getMostSpecialized()
DSemaLookup.cpp2408 OverloadCandidateSet::iterator Best; in LookupSpecialMember() local
2409 switch (OCS.BestViableFunction(*this, SourceLocation(), Best)) { in LookupSpecialMember()
2411 Result->setMethod(cast<CXXMethodDecl>(Best->Function)); in LookupSpecialMember()
2416 Result->setMethod(cast<CXXMethodDecl>(Best->Function)); in LookupSpecialMember()
DSemaExpr.cpp1479 OverloadCandidateSet::iterator Best; in DiagnoseEmptyLookup() local
1493 switch (OCS.BestViableFunction(*this, R.getNameLoc(), Best)) { in DiagnoseEmptyLookup()
1495 ND = Best->Function; in DiagnoseEmptyLookup()
/external/llvm/lib/CodeGen/SelectionDAG/
DResourcePriorityQueue.cpp604 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local
606 signed BestCost = SUSchedulingCost(*Best); in pop()
609 if (*I == *Best) in pop()
614 Best = I; in pop()
622 if (Picker(*Best, *I)) in pop()
623 Best = I; in pop()
626 SUnit *V = *Best; in pop()
627 if (Best != prior(Queue.end())) in pop()
628 std::swap(*Best, Queue.back()); in pop()
DScheduleDAGRRList.cpp444 SDNode *Best = 0; in FindCallSeqStart() local
451 if (!Best || (MyMaxNest > BestMaxNest)) { in FindCallSeqStart()
452 Best = New; in FindCallSeqStart()
456 assert(Best); in FindCallSeqStart()
458 return Best; in FindCallSeqStart()
1705 std::vector<SUnit *>::iterator Best = Q.begin(); in popFromQueueImpl() local
1708 if (Picker(*Best, *I)) in popFromQueueImpl()
1709 Best = I; in popFromQueueImpl()
1710 SUnit *V = *Best; in popFromQueueImpl()
1711 if (Best != prior(Q.end())) in popFromQueueImpl()
[all …]
/external/llvm/utils/FileCheck/
DFileCheck.cpp399 size_t Best = StringRef::npos; in PrintFailureInfo() local
417 if (Quality < BestQuality || Best == StringRef::npos) { in PrintFailureInfo()
418 Best = i; in PrintFailureInfo()
426 if (Best && Best != StringRef::npos && BestQuality < 50) { in PrintFailureInfo()
427 SM.PrintMessage(SMLoc::getFromPointer(Buffer.data() + Best), in PrintFailureInfo()
/external/clang/lib/Basic/
DDiagnosticIDs.cpp553 StringRef Best; in getNearestWarningOption() local
564 Best = ""; in getNearestWarningOption()
567 Best = i->getName(); in getNearestWarningOption()
572 return Best; in getNearestWarningOption()
/external/llvm/utils/TableGen/
DFixedLenDecoderEmitter.cpp360 const Filter &Best) const;
983 const Filter &Best) const { in emitSingletonDecoder()
985 unsigned Opc = Best.getSingletonOpc(); in emitSingletonDecoder()
993 Best.getVariableFC().emit(o, Indentation); in emitSingletonDecoder()
1288 const Filter &Best = Filters[BestIndex]; in emit() local
1289 if (Best.getNumFiltered() == 1) in emit()
1290 emitSingletonDecoder(o, Indentation, Best); in emit()
1292 Best.emit(o, Indentation); in emit()
/external/clang/lib/Frontend/
DCompilerInstance.cpp1012 llvm::SmallVector<StringRef, 2> Best; in loadModule() local
1023 Best.clear(); in loadModule()
1027 Best.push_back((*J)->Name); in loadModule()
1032 if (Best.size() == 1) { in loadModule()
1035 << Path[I].first << Module->getFullModuleName() << Best[0] in loadModule()
1038 Best[0]); in loadModule()
1040 Sub = Module->findSubmodule(Best[0]); in loadModule()
/external/zlib/contrib/dotzlib/DotZLib/
DDotZLib.cs74 Best = 9, enumerator
DUnitTests.cs250 using (GZipStream gzOut = new GZipStream("gzstream.gz", CompressLevel.Best)) in GZipStream_WriteRead()
/external/clang/lib/AST/
DDeclCXX.cpp357 unsigned Best = 0, N = Cands.size(); in GetBestOverloadCandidateSimple() local
359 if (Cands[Best].second.compatiblyIncludes(Cands[I].second)) in GetBestOverloadCandidateSimple()
360 Best = I; in GetBestOverloadCandidateSimple()
363 if (Cands[Best].second.compatiblyIncludes(Cands[I].second)) in GetBestOverloadCandidateSimple()
366 return Cands[Best].first; in GetBestOverloadCandidateSimple()
/external/libvpx/
DCHANGELOG21 Best quality mode speed improved 35%, and realtime speed 10-20%. This
43 Best quality mode improved PSNR 6.3%, and SSIM 6.1%. This release
/external/llvm/lib/Transforms/Scalar/
DLoopStrengthReduce.cpp3654 Formula &Best = LU.Formulae[P.first->second]; in FilterOutUndesirableDedicatedRegisters() local
3658 CostBest.RateFormula(Best, Regs, VisitedRegs, L, LU.Offsets, SE, DT); in FilterOutUndesirableDedicatedRegisters()
3660 std::swap(F, Best); in FilterOutUndesirableDedicatedRegisters()
3663 " in favor of formula "; Best.print(dbgs()); in FilterOutUndesirableDedicatedRegisters()
3893 const SCEV *Best = 0; in NarrowSearchSpaceByPickingWinnerRegs() local
3900 if (!Best) in NarrowSearchSpaceByPickingWinnerRegs()
3901 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs()
3905 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs()
3911 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best in NarrowSearchSpaceByPickingWinnerRegs()
3913 Taken.insert(Best); in NarrowSearchSpaceByPickingWinnerRegs()
[all …]
/external/clang/include/clang/Sema/
DOverload.h796 OverloadCandidateSet::iterator& Best,
/external/llvm/docs/CommandGuide/
Dlli.pod166 =default: Best scheduler for the target
/external/llvm/lib/Support/Windows/
DPath.inc825 // Best we can do with Unix permission bits is to interpret the owner
/external/libvpx/examples/includes/geshi/docs/
Dgeshi-doc.txt357 …aintext version of this documentation), but more often is quite annoying. Best practice so far is …

12