Searched refs:Best (Results 1 - 24 of 24) sorted by relevance

/external/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp122 std::vector<SUnit *>::iterator Best = Queue.begin();
125 if (Picker(*Best, *I))
126 Best = I;
127 SUnit *V = *Best;
128 if (Best != std::prev(Queue.end()))
129 std::swap(*Best, Queue.back());
H A DMachineTraceMetrics.cpp325 const MachineBasicBlock *Best = nullptr; local
337 if (!Best || Depth < BestDepth)
338 Best = Pred, BestDepth = Depth;
340 return Best;
349 const MachineBasicBlock *Best = nullptr; local
367 if (!Best || Height < BestHeight)
368 Best = Succ, BestHeight = Height;
370 return Best;
/external/compiler-rt/lib/ubsan/
H A Dubsan_diag.cc186 Range *Best = 0; local
189 (!Best ||
190 Best->getStart().getMemoryLocation() >
192 Best = &Ranges[I];
193 return Best;
/external/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp604 std::vector<SUnit *>::iterator Best = Queue.begin();
606 signed BestCost = SUSchedulingCost(*Best);
612 Best = I;
620 if (Picker(*Best, *I))
621 Best = I;
624 SUnit *V = *Best;
625 if (Best != std::prev(Queue.end()))
626 std::swap(*Best, Queue.back());
H A DScheduleDAGRRList.cpp466 SDNode *Best = nullptr; local
473 if (!Best || (MyMaxNest > BestMaxNest)) {
474 Best = New;
478 assert(Best);
480 return Best;
1734 std::vector<SUnit *>::iterator Best = Q.begin(); local
1737 if (Picker(*Best, *I))
1738 Best = I;
1739 SUnit *V = *Best;
1740 if (Best !
[all...]
/external/clang/lib/Sema/
H A DSemaOverload.cpp2985 OverloadCandidateSet::iterator Best; local
2986 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) {
2989 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function);
2995 User.FoundConversionFunction = Best->FoundDecl;
3174 OverloadCandidateSet::iterator Best; local
3175 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) {
3179 = dyn_cast<CXXConstructorDecl>(Best->Function)) {
3191 if (Best->Conversions[0].isEllipsis())
3194 User.Before = Best->Conversions[0].Standard;
3200 User.FoundConversionFunction = Best
4150 OverloadCandidateSet::iterator Best; local
5431 OverloadCandidateSet::iterator Best; local
8353 BestViableFunction(Sema &S, SourceLocation Loc, iterator &Best, bool UserDefinedConversion) argument
10327 OverloadCandidateSet::iterator Best; local
10562 FinishOverloadedCallExpr(Sema &SemaRef, Scope *S, Expr *Fn, UnresolvedLookupExpr *ULE, SourceLocation LParenLoc, MultiExprArg Args, SourceLocation RParenLoc, Expr *ExecConfig, OverloadCandidateSet *CandidateSet, OverloadCandidateSet::iterator *Best, OverloadingResult OverloadResult, bool AllowTypoCorrection) argument
10750 OverloadCandidateSet::iterator Best; local
10959 OverloadCandidateSet::iterator Best; local
11186 OverloadCandidateSet::iterator Best; local
11441 OverloadCandidateSet::iterator Best; local
11652 OverloadCandidateSet::iterator Best; local
11883 OverloadCandidateSet::iterator Best; local
11974 OverloadCandidateSet::iterator Best; local
12081 OverloadCandidateSet::iterator Best; local
[all...]
H A DSemaInit.cpp387 OverloadCandidateSet::iterator Best; local
390 .BestViableFunction(SemaRef, Kind.getLocation(), Best);
393 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function);
3132 OverloadCandidateSet::iterator &Best,
3196 return CandidateSet.BestViableFunction(S, DeclLoc, Best);
3243 OverloadCandidateSet::iterator Best; local
3260 CandidateSet, Ctors, Best,
3277 CandidateSet, Ctors, Best,
3296 !cast<CXXConstructorDecl>(Best->Function)->isUserProvided()) {
3304 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best
3128 ResolveConstructorOverload(Sema &S, SourceLocation DeclLoc, MultiExprArg Args, OverloadCandidateSet &CandidateSet, ArrayRef<NamedDecl *> Ctors, OverloadCandidateSet::iterator &Best, bool CopyInitializing, bool AllowExplicit, bool OnlyListConstructors, bool InitListSyntax) argument
3654 OverloadCandidateSet::iterator Best; local
4275 OverloadCandidateSet::iterator Best; local
5074 OverloadCandidateSet::iterator Best; local
5181 OverloadCandidateSet::iterator Best; local
6539 OverloadCandidateSet::iterator Best; local
6719 OverloadCandidateSet::iterator Best; local
6791 OverloadCandidateSet::iterator Best; local
[all...]
H A DSemaTemplateInstantiate.cpp2269 SmallVectorImpl<MatchResult>::iterator Best = Matched.begin(); local
2282 for (SmallVectorImpl<MatchResult>::iterator P = Best + 1,
2285 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial,
2288 Best = P;
2297 if (P != Best &&
2298 getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial,
2300 != Best->Partial) {
2326 ClassTemplatePartialSpecializationDecl *OrigPartialSpec = Best->Partial;
2337 ClassTemplateSpec->setInstantiationOf(Best->Partial, Best
[all...]
H A DSemaExprCXX.cpp1893 OverloadCandidateSet::iterator Best; local
1894 switch (Candidates.BestViableFunction(*this, StartLoc, Best)) {
1897 FunctionDecl *FnDecl = Best->Function;
1899 Best->FoundDecl, Diagnose) == AR_inaccessible)
1925 << Best->Function->isDeleted()
1927 << getDeletedOrUnavailableSuffix(Best->Function)
4296 OverloadCandidateSet::iterator Best; local
4297 switch (CandidateSet.BestViableFunction(Self, QuestionLoc, Best)) {
4301 Self.PerformImplicitConversion(LHS.get(), Best->BuiltinTypes.ParamTypes[0],
4302 Best
[all...]
H A DSemaTemplate.cpp2722 SmallVector<MatchResult, 4>::iterator Best = Matched.begin(); local
2735 for (SmallVector<MatchResult, 4>::iterator P = Best + 1,
2738 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial,
2741 Best = P;
2749 if (P != Best && getMoreSpecializedPartialSpecialization(
2750 P->Partial, Best->Partial,
2751 PointOfInstantiation) != Best->Partial) {
2759 InstantiationPattern = Best->Partial;
2760 InstantiationArgs = Best->Args;
H A DSemaTemplateDeduction.cpp4486 UnresolvedSetIterator Best = SpecBegin;
4488 = cast<FunctionDecl>(*Best)->getPrimaryTemplate();
4497 Best = I;
4508 if (I != Best &&
4519 return Best;
H A DSemaLookup.cpp2520 OverloadCandidateSet::iterator Best; local
2521 switch (OCS.BestViableFunction(*this, SourceLocation(), Best)) {
2523 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
2528 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
H A DSemaExpr.cpp1859 OverloadCandidateSet::iterator Best; local
1873 switch (OCS.BestViableFunction(*this, R.getNameLoc(), Best)) {
1875 ND = Best->Function;
4095 OverloadCandidateSet::iterator Best; local
4103 switch (OCS.BestViableFunction(S, NameLoc, Best)) {
4105 ND = Best->Function;
/external/zlib/src/contrib/dotzlib/DotZLib/
H A DDotZLib.cs74 Best = 9, enumerator in enum:DotZLib.CompressLevel
H A DUnitTests.cs250 using (GZipStream gzOut = new GZipStream("gzstream.gz", CompressLevel.Best))
/external/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h810 void setBest(SchedCandidate &Best) { argument
811 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
812 SU = Best.SU;
813 Reason = Best.Reason;
814 RPDelta = Best.RPDelta;
815 ResDelta = Best.ResDelta;
/external/clang/lib/Basic/
H A DDiagnosticIDs.cpp556 StringRef Best; local
567 Best = "";
570 Best = i->getName();
575 return Best;
/external/llvm/utils/FileCheck/
H A DFileCheck.cpp498 size_t Best = StringRef::npos; local
516 if (Quality < BestQuality || Best == StringRef::npos) {
517 Best = i;
525 if (Best && Best != StringRef::npos && BestQuality < 50) {
526 SM.PrintMessage(SMLoc::getFromPointer(Buffer.data() + Best),
/external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/
H A Dcmsnamed.c302 int Best = -1; local
315 if (Best == -1) Best = i;
330 if (Best == -1)
331 Best = 0;
333 v = mlu ->Entries + Best;
/external/llvm/utils/TableGen/
H A DFixedLenDecoderEmitter.cpp454 const Filter &Best) const;
1365 const Filter &Best) const {
1366 unsigned Opc = Best.getSingletonOpc();
1378 Best.getVariableFC().emitTableEntries(TableInfo);
1674 const Filter &Best = Filters[BestIndex];
1675 if (Best.getNumFiltered() == 1)
1676 emitSingletonTableEntry(TableInfo, Best);
1678 Best.emitTableEntry(TableInfo);
/external/clang/lib/Frontend/
H A DCompilerInstance.cpp1399 SmallVector<StringRef, 2> Best; local
1410 Best.clear();
1414 Best.push_back((*J)->Name);
1419 if (Best.size() == 1) {
1422 << Path[I].first << Module->getFullModuleName() << Best[0]
1425 Best[0]); local
1427 Sub = Module->findSubmodule(Best[0]);
/external/llvm/lib/Support/
H A DCommandLine.cpp242 Option *Best = nullptr; local
258 if (!Best || Distance < BestDistance) {
259 Best = O;
269 return Best;
/external/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp3980 Formula &Best = LU.Formulae[P.first->second]; local
3984 CostBest.RateFormula(TTI, Best, Regs, VisitedRegs, L, LU.Offsets, SE,
3987 std::swap(F, Best);
3990 " in favor of formula "; Best.print(dbgs());
4219 const SCEV *Best = nullptr; local
4226 if (!Best)
4227 Best = Reg;
4231 Best = Reg;
4237 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best
4239 Taken.insert(Best);
[all...]
/external/clang/include/clang/Sema/
H A DOverload.h782 OverloadCandidateSet::iterator& Best,

Completed in 7039 milliseconds