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

/freebsd-10-stable/contrib/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp121 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 DMachineTraceMetrics.cpp325 const MachineBasicBlock *Best = 0; local
337 if (!Best || Depth < BestDepth)
338 Best = Pred, BestDepth = Depth;
340 return Best;
349 const MachineBasicBlock *Best = 0; local
367 if (!Best || Height < BestHeight)
368 Best = Succ, BestHeight = Height;
370 return Best;
H A DMachineScheduler.cpp1395 void setBest(SchedCandidate &Best) { argument
1396 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
1397 SU = Best.SU;
1398 Reason = Best.Reason;
1399 RPDelta = Best.RPDelta;
1400 ResDelta = Best.ResDelta;
/freebsd-10-stable/contrib/llvm/lib/Support/
H A DTargetRegistry.cpp74 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 DCommandLine.cpp219 Option *Best = 0; local
235 if (!Best || Distance < BestDistance) {
236 Best = O;
246 return Best;
/freebsd-10-stable/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp603 std::vector<SUnit *>::iterator Best = Queue.begin();
605 signed BestCost = SUSchedulingCost(*Best);
611 Best = I;
619 if (Picker(*Best, *I))
620 Best = I;
623 SUnit *V = *Best;
624 if (Best != prior(Queue.end()))
625 std::swap(*Best, Queue.back());
H A DScheduleDAGRRList.cpp464 SDNode *Best = 0; local
471 if (!Best || (MyMaxNest > BestMaxNest)) {
472 Best = New;
476 assert(Best);
478 return Best;
1740 std::vector<SUnit *>::iterator Best = Q.begin(); local
1743 if (Picker(*Best, *I))
1744 Best = I;
1745 SUnit *V = *Best;
1746 if (Best !
[all...]
/freebsd-10-stable/contrib/llvm/tools/clang/lib/Sema/
H A DSemaOverload.cpp2974 OverloadCandidateSet::iterator Best; local
2975 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) {
2978 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function);
2984 User.FoundConversionFunction = Best->FoundDecl;
3163 OverloadCandidateSet::iterator Best; local
3164 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) {
3168 = dyn_cast<CXXConstructorDecl>(Best->Function)) {
3180 if (Best->Conversions[0].isEllipsis())
3183 User.Before = Best->Conversions[0].Standard;
3189 User.FoundConversionFunction = Best
4110 OverloadCandidateSet::iterator Best; local
5389 OverloadCandidateSet::iterator Best; local
8126 BestViableFunction(Sema &S, SourceLocation Loc, iterator &Best, bool UserDefinedConversion) argument
10070 OverloadCandidateSet::iterator Best; local
10302 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
10493 OverloadCandidateSet::iterator Best; local
10710 OverloadCandidateSet::iterator Best; local
10939 OverloadCandidateSet::iterator Best; local
11195 OverloadCandidateSet::iterator Best; local
11405 OverloadCandidateSet::iterator Best; local
11635 OverloadCandidateSet::iterator Best; local
11726 OverloadCandidateSet::iterator Best; local
11833 OverloadCandidateSet::iterator Best; local
[all...]
H A DSemaInit.cpp3017 OverloadCandidateSet::iterator &Best,
3081 return CandidateSet.BestViableFunction(S, DeclLoc, Best);
3128 OverloadCandidateSet::iterator Best; local
3145 CandidateSet, Ctors, Best,
3162 CandidateSet, Ctors, Best,
3181 !cast<CXXConstructorDecl>(Best->Function)->isUserProvided()) {
3189 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function);
3199 Best->FoundDecl.getAccess(),
3536 OverloadCandidateSet::iterator Best; local
3538 = CandidateSet.BestViableFunction(S, DeclLoc, Best, tru
3013 ResolveConstructorOverload(Sema &S, SourceLocation DeclLoc, MultiExprArg Args, OverloadCandidateSet &CandidateSet, ArrayRef<NamedDecl *> Ctors, OverloadCandidateSet::iterator &Best, bool CopyInitializing, bool AllowExplicit, bool OnlyListConstructors, bool InitListSyntax) argument
4156 OverloadCandidateSet::iterator Best; local
4947 OverloadCandidateSet::iterator Best; local
5055 OverloadCandidateSet::iterator Best; local
6433 OverloadCandidateSet::iterator Best; local
6611 OverloadCandidateSet::iterator Best; local
6683 OverloadCandidateSet::iterator Best; local
[all...]
H A DSemaTemplateInstantiate.cpp2360 SmallVectorImpl<MatchResult>::iterator Best = Matched.begin(); local
2373 for (SmallVectorImpl<MatchResult>::iterator P = Best + 1,
2376 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial,
2379 Best = P;
2388 if (P != Best &&
2389 getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial,
2391 != Best->Partial) {
2417 ClassTemplatePartialSpecializationDecl *OrigPartialSpec = Best->Partial;
2428 ClassTemplateSpec->setInstantiationOf(Best->Partial, Best
[all...]
H A DSemaExprCXX.cpp1842 OverloadCandidateSet::iterator Best; local
1843 switch (Candidates.BestViableFunction(*this, StartLoc, Best)) {
1846 FunctionDecl *FnDecl = Best->Function;
1871 Best->FoundDecl, Diagnose) == AR_inaccessible)
1896 << Best->Function->isDeleted()
1898 << getDeletedOrUnavailableSuffix(Best->Function)
4303 OverloadCandidateSet::iterator Best; local
4304 switch (CandidateSet.BestViableFunction(Self, QuestionLoc, Best)) {
4308 Self.PerformImplicitConversion(LHS.get(), Best->BuiltinTypes.ParamTypes[0],
4309 Best
[all...]
H A DSemaTemplate.cpp2661 SmallVector<MatchResult, 4>::iterator Best = Matched.begin(); local
2674 for (SmallVector<MatchResult, 4>::iterator P = Best + 1,
2677 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial,
2680 Best = P;
2688 if (P != Best && getMoreSpecializedPartialSpecialization(
2689 P->Partial, Best->Partial,
2690 PointOfInstantiation) != Best->Partial) {
2698 InstantiationPattern = Best->Partial;
2699 InstantiationArgs = Best->Args;
H A DSemaTemplateDeduction.cpp4506 UnresolvedSetIterator Best = SpecBegin;
4508 = cast<FunctionDecl>(*Best)->getPrimaryTemplate();
4517 Best = I;
4528 if (I != Best &&
4539 return Best;
H A DSemaLookup.cpp2600 OverloadCandidateSet::iterator Best; local
2601 switch (OCS.BestViableFunction(*this, SourceLocation(), Best)) {
2603 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
2608 Result->setMethod(cast<CXXMethodDecl>(Best->Function));
H A DSemaExpr.cpp1840 OverloadCandidateSet::iterator Best; local
1854 switch (OCS.BestViableFunction(*this, R.getNameLoc(), Best)) {
1856 ND = Best->Function;
3993 OverloadCandidateSet::iterator Best; local
4001 switch (OCS.BestViableFunction(S, FuncName.getLoc(), Best)) {
4003 ND = Best->Function;
/freebsd-10-stable/contrib/llvm/tools/clang/lib/Basic/
H A DDiagnosticIDs.cpp564 StringRef Best; local
575 Best = "";
578 Best = i->getName();
583 return Best;
/freebsd-10-stable/contrib/llvm/tools/clang/lib/Frontend/
H A DCompilerInstance.cpp1299 SmallVector<StringRef, 2> Best; local
1310 Best.clear();
1314 Best.push_back((*J)->Name);
1319 if (Best.size() == 1) {
1322 << Path[I].first << Module->getFullModuleName() << Best[0]
1325 Best[0]); local
1327 Sub = Module->findSubmodule(Best[0]);
/freebsd-10-stable/contrib/llvm/utils/TableGen/
H A DFixedLenDecoderEmitter.cpp455 const Filter &Best) const;
1366 const Filter &Best) const {
1367 unsigned Opc = Best.getSingletonOpc();
1379 Best.getVariableFC().emitTableEntries(TableInfo);
1675 const Filter &Best = Filters[BestIndex];
1676 if (Best.getNumFiltered() == 1)
1677 emitSingletonTableEntry(TableInfo, Best);
1679 Best.emitTableEntry(TableInfo);
/freebsd-10-stable/contrib/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp3837 Formula &Best = LU.Formulae[P.first->second]; local
3841 CostBest.RateFormula(TTI, Best, Regs, VisitedRegs, L, LU.Offsets, SE,
3844 std::swap(F, Best);
3847 " in favor of formula "; Best.print(dbgs());
4076 const SCEV *Best = 0; local
4083 if (!Best)
4084 Best = Reg;
4088 Best = Reg;
4094 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best
4096 Taken.insert(Best);
[all...]
/freebsd-10-stable/contrib/llvm/tools/clang/include/clang/Sema/
H A DOverload.h751 OverloadCandidateSet::iterator& Best,
/freebsd-10-stable/usr.bin/calendar/calendars/
H A Dcalendar.freebsd212 06/30 Guido van Rooij <guido@FreeBSD.org> born in Best, Noord-Brabant, the Netherlands, 1965

Completed in 435 milliseconds