/external/llvm/lib/CodeGen/ |
H A D | LatencyPriorityQueue.cpp | 121 std::vector<SUnit *>::iterator Best = Queue.begin(); 124 if (Picker(*Best, *I)) 125 Best = I; 126 SUnit *V = *Best; 127 if (Best != prior(Queue.end())) 128 std::swap(*Best, Queue.back());
|
H A D | MachineTraceMetrics.cpp | 229 const MachineBasicBlock *Best = 0; local 241 if (!Best || Depth < BestDepth) 242 Best = Pred, BestDepth = Depth; 244 return Best; 253 const MachineBasicBlock *Best = 0; local 271 if (!Best || Height < BestHeight) 272 Best = Succ, BestHeight = Height; 274 return Best;
|
/external/llvm/lib/Support/ |
H A D | TargetRegistry.cpp | 74 const Target *Best = 0, *EquallyBest = 0; local 78 if (!Best || Qual > BestQuality) { 79 Best = &*it; 87 if (!Best) { 97 Best->Name + "\" and \"" + EquallyBest->Name + "\""; 101 return Best;
|
H A D | CommandLine.cpp | 203 Option *Best = 0; local 219 if (!Best || Distance < BestDistance) { 220 Best = O; 230 return Best;
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ResourcePriorityQueue.cpp | 604 std::vector<SUnit *>::iterator Best = Queue.begin(); 606 signed BestCost = SUSchedulingCost(*Best); 609 if (*I == *Best) 614 Best = I; 622 if (Picker(*Best, *I)) 623 Best = I; 626 SUnit *V = *Best; 627 if (Best != prior(Queue.end())) 628 std::swap(*Best, Queue.back());
|
H A D | ScheduleDAGRRList.cpp | 445 SDNode *Best = 0; local 452 if (!Best || (MyMaxNest > BestMaxNest)) { 453 Best = New; 457 assert(Best); 459 return Best; 1708 std::vector<SUnit *>::iterator Best = Q.begin(); local 1711 if (Picker(*Best, *I)) 1712 Best = I; 1713 SUnit *V = *Best; 1714 if (Best ! [all...] |
/external/clang/lib/Sema/ |
H A D | SemaOverload.cpp | 2897 OverloadCandidateSet::iterator Best; local 2898 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) { 2901 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function); 2909 User.FoundConversionFunction = Best->FoundDecl; 3078 OverloadCandidateSet::iterator Best; local 3079 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) { 3083 = dyn_cast<CXXConstructorDecl>(Best->Function)) { 3097 if (Best->Conversions[0].isEllipsis()) 3100 User.Before = Best->Conversions[0].Standard; 3106 User.FoundConversionFunction = Best 4012 OverloadCandidateSet::iterator Best; local 7824 BestViableFunction(Sema &S, SourceLocation Loc, iterator &Best, bool UserDefinedConversion) argument 9500 OverloadCandidateSet::iterator Best; local 9766 FinishOverloadedCallExpr(Sema &SemaRef, Scope *S, Expr *Fn, UnresolvedLookupExpr *ULE, SourceLocation LParenLoc, Expr **Args, unsigned NumArgs, SourceLocation RParenLoc, Expr *ExecConfig, OverloadCandidateSet *CandidateSet, OverloadCandidateSet::iterator *Best, OverloadingResult OverloadResult, bool AllowTypoCorrection) argument 9963 OverloadCandidateSet::iterator Best; local 10188 OverloadCandidateSet::iterator Best; local 10410 OverloadCandidateSet::iterator Best; local 10666 OverloadCandidateSet::iterator Best; local 10870 OverloadCandidateSet::iterator Best; local 11109 OverloadCandidateSet::iterator Best; local 11191 OverloadCandidateSet::iterator Best; local 11303 OverloadCandidateSet::iterator Best; local [all...] |
H A D | SemaInit.cpp | 2747 OverloadCandidateSet::iterator &Best, 2802 return CandidateSet.BestViableFunction(S, DeclLoc, Best); 2855 OverloadCandidateSet::iterator Best; local 2874 CandidateSet, ConStart, ConEnd, Best, 2892 CandidateSet, ConStart, ConEnd, Best, 2911 !cast<CXXConstructorDecl>(Best->Function)->isUserProvided()) { 2919 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function); 2929 Best->FoundDecl.getAccess(), 3240 OverloadCandidateSet::iterator Best; local 3242 = CandidateSet.BestViableFunction(S, DeclLoc, Best, tru 2742 ResolveConstructorOverload(Sema &S, SourceLocation DeclLoc, Expr **Args, unsigned NumArgs, OverloadCandidateSet &CandidateSet, DeclContext::lookup_iterator Con, DeclContext::lookup_iterator ConEnd, OverloadCandidateSet::iterator &Best, bool CopyInitializing, bool AllowExplicit, bool OnlyListConstructors, bool InitListSyntax) argument 3784 OverloadCandidateSet::iterator Best; local 4452 OverloadCandidateSet::iterator Best; local 4562 OverloadCandidateSet::iterator Best; local 5503 OverloadCandidateSet::iterator Best; local 5686 OverloadCandidateSet::iterator Best; local 5794 OverloadCandidateSet::iterator Best; local [all...] |
H A D | SemaTemplateInstantiate.cpp | 2183 SmallVector<MatchResult, 4>::iterator Best = Matched.begin(); local 2196 for (SmallVector<MatchResult, 4>::iterator P = Best + 1, 2199 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, 2202 Best = P; 2211 if (P != Best && 2212 getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, 2214 != Best->Partial) { 2240 ClassTemplatePartialSpecializationDecl *OrigPartialSpec = Best->Partial; 2251 ClassTemplateSpec->setInstantiationOf(Best->Partial, Best [all...] |
H A D | SemaExprCXX.cpp | 1731 OverloadCandidateSet::iterator Best; local 1732 switch (Candidates.BestViableFunction(*this, StartLoc, Best)) { 1735 FunctionDecl *FnDecl = Best->Function; 1760 Best->FoundDecl, Diagnose) == AR_inaccessible) 1787 << Best->Function->isDeleted() 1789 << getDeletedOrUnavailableSuffix(Best->Function) 4039 OverloadCandidateSet::iterator Best; local 4040 switch (CandidateSet.BestViableFunction(Self, QuestionLoc, Best)) { 4044 Self.PerformImplicitConversion(LHS.get(), Best->BuiltinTypes.ParamTypes[0], 4045 Best [all...] |
H A D | SemaTemplateDeduction.cpp | 4027 UnresolvedSetIterator Best = SpecBegin; 4029 = cast<FunctionDecl>(*Best)->getPrimaryTemplate(); 4038 Best = I; 4049 if (I != Best && 4060 return Best;
|
H A D | SemaLookup.cpp | 2393 OverloadCandidateSet::iterator Best; local 2394 switch (OCS.BestViableFunction(*this, SourceLocation(), Best)) { 2396 Result->setMethod(cast<CXXMethodDecl>(Best->Function)); 2401 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
|
H A D | SemaExpr.cpp | 1585 OverloadCandidateSet::iterator Best; local 1599 switch (OCS.BestViableFunction(*this, R.getNameLoc(), Best)) { 1601 ND = Best->Function;
|
/external/zlib/src/contrib/dotzlib/DotZLib/ |
H A D | DotZLib.cs | 74 Best = 9,
enumerator in enum:DotZLib.CompressLevel
|
H A D | UnitTests.cs | 250 using (GZipStream gzOut = new GZipStream("gzstream.gz", CompressLevel.Best))
|
/external/llvm/utils/FileCheck/ |
H A D | FileCheck.cpp | 399 size_t Best = StringRef::npos; local 417 if (Quality < BestQuality || Best == StringRef::npos) { 418 Best = i; 426 if (Best && Best != StringRef::npos && BestQuality < 50) { 427 SM.PrintMessage(SMLoc::getFromPointer(Buffer.data() + Best),
|
/external/clang/lib/Frontend/ |
H A D | CompilerInstance.cpp | 1001 llvm::SmallVector<StringRef, 2> Best; local 1012 Best.clear(); 1016 Best.push_back((*J)->Name); 1021 if (Best.size() == 1) { 1024 << Path[I].first << Module->getFullModuleName() << Best[0] 1027 Best[0]); local 1029 Sub = Module->findSubmodule(Best[0]);
|
/external/clang/lib/Basic/ |
H A D | DiagnosticIDs.cpp | 554 StringRef Best; local 565 Best = ""; 568 Best = i->getName(); 573 return Best;
|
/external/llvm/utils/TableGen/ |
H A D | FixedLenDecoderEmitter.cpp | 455 const Filter &Best) const; 1361 const Filter &Best) const { 1362 unsigned Opc = Best.getSingletonOpc(); 1374 Best.getVariableFC().emitTableEntries(TableInfo); 1670 const Filter &Best = Filters[BestIndex]; 1671 if (Best.getNumFiltered() == 1) 1672 emitSingletonTableEntry(TableInfo, Best); 1674 Best.emitTableEntry(TableInfo);
|
/external/clang/lib/AST/ |
H A D | DeclCXX.cpp | 342 unsigned Best = 0, N = Cands.size(); local 344 if (Cands[Best].second.compatiblyIncludes(Cands[I].second)) 345 Best = I; 348 if (I != Best && Cands[Best].second.compatiblyIncludes(Cands[I].second)) 351 return Cands[Best].first;
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopStrengthReduce.cpp | 3723 Formula &Best = LU.Formulae[P.first->second]; local 3727 CostBest.RateFormula(Best, Regs, VisitedRegs, L, LU.Offsets, SE, DT); 3729 std::swap(F, Best); 3732 " in favor of formula "; Best.print(dbgs()); 3962 const SCEV *Best = 0; local 3969 if (!Best) 3970 Best = Reg; 3974 Best = Reg; 3980 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best 3982 Taken.insert(Best); [all...] |
/external/clang/include/clang/Sema/ |
H A D | Overload.h | 805 OverloadCandidateSet::iterator& Best,
|