| /external/llvm/lib/CodeGen/ |
| D | LatencyPriorityQueue.cpp | 122 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop() local
125 if (Picker(*Best, *I)) in pop()
126 Best = I; in pop()
127 SUnit *V = *Best; in pop()
128 if (Best != std::prev(Queue.end())) in pop()
129 std::swap(*Best, Queue.back()); in pop()
|
| D | MachineTraceMetrics.cpp | 325 const MachineBasicBlock *Best = nullptr; in pickTracePred() local
337 if (!Best || Depth < BestDepth) in pickTracePred()
338 Best = Pred, BestDepth = Depth; in pickTracePred()
340 return Best; in pickTracePred()
349 const MachineBasicBlock *Best = nullptr; in pickTraceSucc() local
367 if (!Best || Height < BestHeight) in pickTraceSucc()
368 Best = Succ, BestHeight = Height; in pickTraceSucc()
370 return Best; in pickTraceSucc()
|
| /external/compiler-rt/lib/ubsan/ |
| D | ubsan_diag.cc | 186 Range *Best = 0; in upperBound() local
189 (!Best || in upperBound()
190 Best->getStart().getMemoryLocation() > in upperBound()
192 Best = &Ranges[I]; in upperBound()
193 return Best; in upperBound()
|
| /external/clang/lib/Sema/ |
| D | SemaOverload.cpp | 2985 OverloadCandidateSet::iterator Best; in IsInitializerListConstructorConversion() local
2986 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) { in IsInitializerListConstructorConversion()
2989 CXXConstructorDecl *Constructor = cast<CXXConstructorDecl>(Best->Function); in IsInitializerListConstructorConversion()
2995 User.FoundConversionFunction = Best->FoundDecl; in IsInitializerListConstructorConversion()
3174 OverloadCandidateSet::iterator Best; in IsUserDefinedConversion() local
3175 switch (CandidateSet.BestViableFunction(S, From->getLocStart(), Best, true)) { in IsUserDefinedConversion()
3179 = dyn_cast<CXXConstructorDecl>(Best->Function)) { in IsUserDefinedConversion()
3191 if (Best->Conversions[0].isEllipsis()) in IsUserDefinedConversion()
3194 User.Before = Best->Conversions[0].Standard; in IsUserDefinedConversion()
3200 User.FoundConversionFunction = Best->FoundDecl; in IsUserDefinedConversion()
[all …]
|
| D | SemaInit.cpp | 387 OverloadCandidateSet::iterator Best; in PerformEmptyInit() local
390 .BestViableFunction(SemaRef, Kind.getLocation(), Best); in PerformEmptyInit()
393 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function); in PerformEmptyInit()
3132 OverloadCandidateSet::iterator &Best, in ResolveConstructorOverload() argument
3196 return CandidateSet.BestViableFunction(S, DeclLoc, Best); in ResolveConstructorOverload()
3243 OverloadCandidateSet::iterator Best; in TryConstructorInitialization() local
3260 CandidateSet, Ctors, Best, in TryConstructorInitialization()
3277 CandidateSet, Ctors, Best, in TryConstructorInitialization()
3296 !cast<CXXConstructorDecl>(Best->Function)->isUserProvided()) { in TryConstructorInitialization()
3304 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function); in TryConstructorInitialization()
[all …]
|
| D | SemaTemplateInstantiate.cpp | 2269 SmallVectorImpl<MatchResult>::iterator Best = Matched.begin(); in InstantiateClassTemplateSpecialization() local
2282 for (SmallVectorImpl<MatchResult>::iterator P = Best + 1, in InstantiateClassTemplateSpecialization()
2285 if (getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in InstantiateClassTemplateSpecialization()
2288 Best = P; in InstantiateClassTemplateSpecialization()
2297 if (P != Best && in InstantiateClassTemplateSpecialization()
2298 getMoreSpecializedPartialSpecialization(P->Partial, Best->Partial, in InstantiateClassTemplateSpecialization()
2300 != Best->Partial) { in InstantiateClassTemplateSpecialization()
2326 ClassTemplatePartialSpecializationDecl *OrigPartialSpec = Best->Partial; in InstantiateClassTemplateSpecialization()
2337 ClassTemplateSpec->setInstantiationOf(Best->Partial, Best->Args); in InstantiateClassTemplateSpecialization()
|
| D | SemaExprCXX.cpp | 1893 OverloadCandidateSet::iterator Best; in FindAllocationOverload() local
1894 switch (Candidates.BestViableFunction(*this, StartLoc, Best)) { in FindAllocationOverload()
1897 FunctionDecl *FnDecl = Best->Function; in FindAllocationOverload()
1899 Best->FoundDecl, Diagnose) == AR_inaccessible) in FindAllocationOverload()
1925 << Best->Function->isDeleted() in FindAllocationOverload()
1927 << getDeletedOrUnavailableSuffix(Best->Function) in FindAllocationOverload()
4296 OverloadCandidateSet::iterator Best; in FindConditionalOverload() local
4297 switch (CandidateSet.BestViableFunction(Self, QuestionLoc, Best)) { in FindConditionalOverload()
4301 Self.PerformImplicitConversion(LHS.get(), Best->BuiltinTypes.ParamTypes[0], in FindConditionalOverload()
4302 Best->Conversions[0], Sema::AA_Converting); in FindConditionalOverload()
[all …]
|
| /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 != std::prev(Queue.end())) in pop()
626 std::swap(*Best, Queue.back()); in pop()
|
| D | ScheduleDAGRRList.cpp | 466 SDNode *Best = nullptr; in FindCallSeqStart() local
473 if (!Best || (MyMaxNest > BestMaxNest)) { in FindCallSeqStart()
474 Best = New; in FindCallSeqStart()
478 assert(Best); in FindCallSeqStart()
480 return Best; in FindCallSeqStart()
1734 std::vector<SUnit *>::iterator Best = Q.begin(); in popFromQueueImpl() local
1737 if (Picker(*Best, *I)) in popFromQueueImpl()
1738 Best = I; in popFromQueueImpl()
1739 SUnit *V = *Best; in popFromQueueImpl()
1740 if (Best != std::prev(Q.end())) in popFromQueueImpl()
[all …]
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineScheduler.h | 810 void setBest(SchedCandidate &Best) { in setBest()
811 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest()
812 SU = Best.SU; in setBest()
813 Reason = Best.Reason; in setBest()
814 RPDelta = Best.RPDelta; in setBest()
815 ResDelta = Best.ResDelta; in setBest()
|
| /external/clang/lib/Basic/ |
| D | DiagnosticIDs.cpp | 556 StringRef Best; in getNearestWarningOption() local
567 Best = ""; in getNearestWarningOption()
570 Best = i->getName(); in getNearestWarningOption()
575 return Best; in getNearestWarningOption()
|
| /external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/ |
| D | cmsnamed.c | 302 int Best = -1; in _cmsMLUgetWide() local
315 if (Best == -1) Best = i; in _cmsMLUgetWide()
330 if (Best == -1) in _cmsMLUgetWide()
331 Best = 0; in _cmsMLUgetWide()
333 v = mlu ->Entries + Best; in _cmsMLUgetWide()
|
| /external/llvm/utils/FileCheck/ |
| D | FileCheck.cpp | 498 size_t Best = StringRef::npos; in PrintFailureInfo() local
516 if (Quality < BestQuality || Best == StringRef::npos) { in PrintFailureInfo()
517 Best = i; in PrintFailureInfo()
525 if (Best && Best != StringRef::npos && BestQuality < 50) { in PrintFailureInfo()
526 SM.PrintMessage(SMLoc::getFromPointer(Buffer.data() + Best), in PrintFailureInfo()
|
| /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/clang/lib/Frontend/ |
| D | CompilerInstance.cpp | 1399 SmallVector<StringRef, 2> Best; in loadModule() local
1410 Best.clear(); in loadModule()
1414 Best.push_back((*J)->Name); in loadModule()
1419 if (Best.size() == 1) { in loadModule()
1422 << Path[I].first << Module->getFullModuleName() << Best[0] in loadModule()
1425 Best[0]); in loadModule()
1427 Sub = Module->findSubmodule(Best[0]); in loadModule()
|
| /external/naver-fonts/ |
| D | README | 42 Best regards,
|
| /external/chromium_org/third_party/libphonenumber/src/resources/geocoding/en/ |
| D | 31.txt | 86 31499|Best
|
| /external/chromium_org/third_party/libphonenumber/src/resources/geocoding/nl/ |
| D | 31.txt | 93 31499|Best
|
| /external/llvm/utils/TableGen/ |
| D | FixedLenDecoderEmitter.cpp | 454 const Filter &Best) const;
1365 const Filter &Best) const { in emitSingletonTableEntry()
1366 unsigned Opc = Best.getSingletonOpc(); in emitSingletonTableEntry()
1378 Best.getVariableFC().emitTableEntries(TableInfo); in emitSingletonTableEntry()
1674 const Filter &Best = Filters[BestIndex]; in emitTableEntries() local
1675 if (Best.getNumFiltered() == 1) in emitTableEntries()
1676 emitSingletonTableEntry(TableInfo, Best); in emitTableEntries()
1678 Best.emitTableEntry(TableInfo); in emitTableEntries()
|
| /external/llvm/lib/Support/ |
| D | CommandLine.cpp | 242 Option *Best = nullptr; in LookupNearestOption() local
258 if (!Best || Distance < BestDistance) { in LookupNearestOption()
259 Best = O; in LookupNearestOption()
269 return Best; in LookupNearestOption()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopStrengthReduce.cpp | 3980 Formula &Best = LU.Formulae[P.first->second]; in FilterOutUndesirableDedicatedRegisters() local
3984 CostBest.RateFormula(TTI, Best, Regs, VisitedRegs, L, LU.Offsets, SE, in FilterOutUndesirableDedicatedRegisters()
3987 std::swap(F, Best); in FilterOutUndesirableDedicatedRegisters()
3990 " in favor of formula "; Best.print(dbgs()); in FilterOutUndesirableDedicatedRegisters()
4219 const SCEV *Best = nullptr; in NarrowSearchSpaceByPickingWinnerRegs() local
4226 if (!Best) in NarrowSearchSpaceByPickingWinnerRegs()
4227 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs()
4231 Best = Reg; in NarrowSearchSpaceByPickingWinnerRegs()
4237 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best in NarrowSearchSpaceByPickingWinnerRegs()
4239 Taken.insert(Best); in NarrowSearchSpaceByPickingWinnerRegs()
[all …]
|
| /external/libvpx/libvpx/ |
| D | CHANGELOG | 206 1.5% to 10.5%, respectively. "Best" mode speed is consistent with the
273 encoder. On x86, these measure at approximately 11.5% in Best mode,
352 Best quality mode speed improved 35%, and realtime speed 10-20%. This
374 Best quality mode improved PSNR 6.3%, and SSIM 6.1%. This release
|
| /external/chromium_org/third_party/libvpx/source/libvpx/ |
| D | CHANGELOG | 206 1.5% to 10.5%, respectively. "Best" mode speed is consistent with the
273 encoder. On x86, these measure at approximately 11.5% in Best mode,
352 Best quality mode speed improved 35%, and realtime speed 10-20%. This
374 Best quality mode improved PSNR 6.3%, and SSIM 6.1%. This release
|
| /external/llvm/docs/CommandGuide/ |
| D | lli.rst | 216 =default: Best scheduler for the target
|