| /external/llvm/lib/CodeGen/ |
| D | LatencyPriorityQueue.cpp | 121 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()
|
| D | MachineTraceMetrics.cpp | 232 const MachineBasicBlock *Best = 0; in pickTracePred() local
244 if (!Best || Depth < BestDepth) in pickTracePred()
245 Best = Pred, BestDepth = Depth; in pickTracePred()
247 return Best; in pickTracePred()
256 const MachineBasicBlock *Best = 0; in pickTraceSucc() local
274 if (!Best || Height < BestHeight) in pickTraceSucc()
275 Best = Succ, BestHeight = Height; in pickTraceSucc()
277 return Best; in pickTraceSucc()
|
| D | MachineScheduler.cpp | 979 void setBest(SchedCandidate &Best) { in setBest()
980 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest()
981 SU = Best.SU; in setBest()
982 Reason = Best.Reason; in setBest()
983 RPDelta = Best.RPDelta; in setBest()
984 ResDelta = Best.ResDelta; in setBest()
|
| /external/llvm/lib/Support/ |
| D | TargetRegistry.cpp | 74 const Target *Best = 0, *EquallyBest = 0; in lookupTarget() local
78 if (!Best || Qual > BestQuality) { in lookupTarget()
79 Best = &*it; in lookupTarget()
87 if (!Best) { in lookupTarget()
97 Best->Name + "\" and \"" + EquallyBest->Name + "\""; in lookupTarget()
101 return Best; in lookupTarget()
|
| D | CommandLine.cpp | 203 Option *Best = 0; in LookupNearestOption() local
219 if (!Best || Distance < BestDistance) { in LookupNearestOption()
220 Best = O; in LookupNearestOption()
230 return Best; in LookupNearestOption()
|
| /external/compiler-rt/lib/ubsan/ |
| D | ubsan_diag.cc | 147 Range *Best = 0; in upperBound() local
150 (!Best || in upperBound()
151 Best->getStart().getMemoryLocation() > in upperBound()
153 Best = &Ranges[I]; in upperBound()
154 return Best; in upperBound()
|
| /external/clang/lib/Sema/ |
| D | SemaOverload.cpp | 2989 OverloadCandidateSet::iterator Best; in IsInitializerListConstructorConversion() local
2990 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) { in IsInitializerListConstructorConversion()
2993 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function); in IsInitializerListConstructorConversion()
2999 User.FoundConversionFunction = Best->FoundDecl; in IsInitializerListConstructorConversion()
3169 OverloadCandidateSet::iterator Best; in IsUserDefinedConversion() local
3170 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) { in IsUserDefinedConversion()
3174 = dyn_cast<CXXConstructorDecl>(Best->Function)) { in IsUserDefinedConversion()
3186 if (Best->Conversions[0].isEllipsis()) in IsUserDefinedConversion()
3189 User.Before = Best->Conversions[0].Standard; in IsUserDefinedConversion()
3195 User.FoundConversionFunction = Best->FoundDecl; in IsUserDefinedConversion()
[all …]
|
| D | SemaInit.cpp | 2764 OverloadCandidateSet::iterator &Best, in ResolveConstructorOverload() argument
2820 return CandidateSet.BestViableFunction(S, DeclLoc, Best); in ResolveConstructorOverload()
2868 OverloadCandidateSet::iterator Best; in TryConstructorInitialization() local
2885 CandidateSet, Ctors, Best, in TryConstructorInitialization()
2903 CandidateSet, Ctors, Best, in TryConstructorInitialization()
2922 !cast<CXXConstructorDecl>(Best->Function)->isUserProvided()) { in TryConstructorInitialization()
2930 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function); in TryConstructorInitialization()
2940 Best->FoundDecl.getAccess(), in TryConstructorInitialization()
3259 OverloadCandidateSet::iterator Best; in TryRefInitWithConversionFunction() local
3261 = CandidateSet.BestViableFunction(S, DeclLoc, Best, true)) in TryRefInitWithConversionFunction()
[all …]
|
| D | SemaTemplateInstantiate.cpp | 2279 SmallVector<MatchResult, 4>::iterator Best = Matched.begin(); in InstantiateClassTemplateSpecialization() local
2292 for (SmallVector<MatchResult, 4>::iterator P = Best + 1, in InstantiateClassTemplateSpecialization()
2295 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in InstantiateClassTemplateSpecialization()
2298 Best = P; in InstantiateClassTemplateSpecialization()
2307 if (P != Best && in InstantiateClassTemplateSpecialization()
2308 getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in InstantiateClassTemplateSpecialization()
2310 != Best->Partial) { in InstantiateClassTemplateSpecialization()
2336 ClassTemplatePartialSpecializationDecl *OrigPartialSpec = Best->Partial; in InstantiateClassTemplateSpecialization()
2347 ClassTemplateSpec->setInstantiationOf(Best->Partial, Best->Args); in InstantiateClassTemplateSpecialization()
|
| D | SemaExprCXX.cpp | 1704 OverloadCandidateSet::iterator Best; in FindAllocationOverload() local
1705 switch (Candidates.BestViableFunction(*this, StartLoc, Best)) { in FindAllocationOverload()
1708 FunctionDecl *FnDecl = Best->Function; in FindAllocationOverload()
1733 Best->FoundDecl, Diagnose) == AR_inaccessible) in FindAllocationOverload()
1760 << Best->Function->isDeleted() in FindAllocationOverload()
1762 << getDeletedOrUnavailableSuffix(Best->Function) in FindAllocationOverload()
4033 OverloadCandidateSet::iterator Best; in FindConditionalOverload() local
4034 switch (CandidateSet.BestViableFunction(Self, QuestionLoc, Best)) { in FindConditionalOverload()
4038 Self.PerformImplicitConversion(LHS.get(), Best->BuiltinTypes.ParamTypes[0], in FindConditionalOverload()
4039 Best->Conversions[0], Sema::AA_Converting); in FindConditionalOverload()
[all …]
|
| D | SemaTemplateDeduction.cpp | 4076 UnresolvedSetIterator Best = SpecBegin; in getMostSpecialized() local
4078 = cast<FunctionDecl>(*Best)->getPrimaryTemplate(); in getMostSpecialized()
4087 Best = I; in getMostSpecialized()
4098 if (I != Best && in getMostSpecialized()
4109 return Best; in getMostSpecialized()
|
| D | SemaLookup.cpp | 2392 OverloadCandidateSet::iterator Best; in LookupSpecialMember() local
2393 switch (OCS.BestViableFunction(*this, SourceLocation(), Best)) { in LookupSpecialMember()
2395 Result->setMethod(cast<CXXMethodDecl>(Best->Function)); in LookupSpecialMember()
2400 Result->setMethod(cast<CXXMethodDecl>(Best->Function)); in LookupSpecialMember()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | ResourcePriorityQueue.cpp | 604 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local
606 signed BestCost = SUSchedulingCost(*Best); in pop()
612 Best = I; in pop()
620 if (Picker(*Best, *I)) in pop()
621 Best = I; in pop()
624 SUnit *V = *Best; in pop()
625 if (Best != prior(Queue.end())) in pop()
626 std::swap(*Best, Queue.back()); in pop()
|
| D | ScheduleDAGRRList.cpp | 464 SDNode *Best = 0; in FindCallSeqStart() local
471 if (!Best || (MyMaxNest > BestMaxNest)) { in FindCallSeqStart()
472 Best = New; in FindCallSeqStart()
476 assert(Best); in FindCallSeqStart()
478 return Best; in FindCallSeqStart()
1740 std::vector<SUnit *>::iterator Best = Q.begin(); in popFromQueueImpl() local
1743 if (Picker(*Best, *I)) in popFromQueueImpl()
1744 Best = I; in popFromQueueImpl()
1745 SUnit *V = *Best; in popFromQueueImpl()
1746 if (Best != prior(Q.end())) in popFromQueueImpl()
[all …]
|
| /external/llvm/utils/FileCheck/ |
| D | FileCheck.cpp | 495 size_t Best = StringRef::npos; in PrintFailureInfo() local
513 if (Quality < BestQuality || Best == StringRef::npos) { in PrintFailureInfo()
514 Best = i; in PrintFailureInfo()
522 if (Best && Best != StringRef::npos && BestQuality < 50) { in PrintFailureInfo()
523 SM.PrintMessage(SMLoc::getFromPointer(Buffer.data() + Best), in PrintFailureInfo()
|
| /external/clang/lib/Basic/ |
| D | DiagnosticIDs.cpp | 586 StringRef Best; in getNearestWarningOption() local
597 Best = ""; in getNearestWarningOption()
600 Best = i->getName(); in getNearestWarningOption()
605 return Best; in getNearestWarningOption()
|
| /external/clang/lib/Frontend/ |
| D | CompilerInstance.cpp | 1149 SmallVector<StringRef, 2> Best; in loadModule() local
1160 Best.clear(); in loadModule()
1164 Best.push_back((*J)->Name); in loadModule()
1169 if (Best.size() == 1) { in loadModule()
1172 << Path[I].first << Module->getFullModuleName() << Best[0] in loadModule()
1175 Best[0]); in loadModule()
1177 Sub = Module->findSubmodule(Best[0]); in loadModule()
|
| /external/zlib/src/contrib/dotzlib/DotZLib/ |
| D | DotZLib.cs | 74 Best = 9, enumerator
|
| D | UnitTests.cs | 250 using (GZipStream gzOut = new GZipStream("gzstream.gz", CompressLevel.Best)) in GZipStream_WriteRead()
|
| /external/llvm/utils/TableGen/ |
| D | FixedLenDecoderEmitter.cpp | 455 const Filter &Best) const;
1361 const Filter &Best) const { in emitSingletonTableEntry()
1362 unsigned Opc = Best.getSingletonOpc(); in emitSingletonTableEntry()
1374 Best.getVariableFC().emitTableEntries(TableInfo); in emitSingletonTableEntry()
1670 const Filter &Best = Filters[BestIndex]; in emitTableEntries() local
1671 if (Best.getNumFiltered() == 1) in emitTableEntries()
1672 emitSingletonTableEntry(TableInfo, Best); in emitTableEntries()
1674 Best.emitTableEntry(TableInfo); in emitTableEntries()
|
| /external/naver-fonts/ |
| D | README | 40 Best regards,
|
| /external/libvpx/libvpx/ |
| D | CHANGELOG | 127 1.5% to 10.5%, respectively. "Best" mode speed is consistent with the
194 encoder. On x86, these measure at approximately 11.5% in Best mode,
273 Best quality mode speed improved 35%, and realtime speed 10-20%. This
295 Best quality mode improved PSNR 6.3%, and SSIM 6.1%. This release
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopStrengthReduce.cpp | 3726 Formula &Best = LU.Formulae[P.first->second]; in FilterOutUndesirableDedicatedRegisters() local
3730 CostBest.RateFormula(Best, Regs, VisitedRegs, L, LU.Offsets, SE, DT); in FilterOutUndesirableDedicatedRegisters()
3732 std::swap(F, Best); in FilterOutUndesirableDedicatedRegisters()
3735 " in favor of formula "; Best.print(dbgs()); in FilterOutUndesirableDedicatedRegisters()
3964 const SCEV *Best = 0; in NarrowSearchSpaceByPickingWinnerRegs() local
3971 if (!Best) in NarrowSearchSpaceByPickingWinnerRegs()
3972 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs()
3976 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs()
3982 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best in NarrowSearchSpaceByPickingWinnerRegs()
3984 Taken.insert(Best); in NarrowSearchSpaceByPickingWinnerRegs()
[all …]
|
| /external/llvm/docs/CommandGuide/ |
| D | lli.rst | 222 =default: Best scheduler for the target
|
| /external/clang/include/clang/Sema/ |
| D | Overload.h | 812 OverloadCandidateSet::iterator& Best,
|