| /external/llvm/lib/CodeGen/ |
| LatencyPriorityQueue.cpp | 122 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());
|
| MachineTraceMetrics.cpp | 325 const MachineBasicBlock *Best = nullptr;
337 if (!Best || Depth < BestDepth)
338 Best = Pred, BestDepth = Depth;
340 return Best;
349 const MachineBasicBlock *Best = nullptr;
367 if (!Best || Height < BestHeight)
368 Best = Succ, BestHeight = Height;
370 return Best;
[all...] |
| /external/compiler-rt/lib/ubsan/ |
| ubsan_diag.cc | 186 Range *Best = 0;
189 (!Best ||
190 Best->getStart().getMemoryLocation() >
192 Best = &Ranges[I];
193 return Best;
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ResourcePriorityQueue.cpp | 604 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());
|
| ScheduleDAGRRList.cpp | 466 SDNode *Best = nullptr;
473 if (!Best || (MyMaxNest > BestMaxNest)) {
474 Best = New;
478 assert(Best);
480 return Best;
[all...] |
| /external/clang/lib/Sema/ |
| SemaOverload.cpp | [all...] |
| SemaInit.cpp | 387 OverloadCandidateSet::iterator Best;
390 .BestViableFunction(SemaRef, Kind.getLocation(), Best);
393 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function);
[all...] |
| SemaTemplateInstantiate.cpp | [all...] |
| SemaExprCXX.cpp | [all...] |
| SemaTemplate.cpp | [all...] |
| SemaTemplateDeduction.cpp | [all...] |
| SemaLookup.cpp | [all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 789 // The best SUnit candidate.
798 // Register pressure values for the best candidate.
801 // Critical resource consumption of the best candidate.
810 void setBest(SchedCandidate &Best) {
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/ |
| DiagnosticIDs.cpp | 556 StringRef Best;
567 Best = "";
570 Best = i->getName();
575 return Best;
|
| /external/llvm/utils/FileCheck/ |
| FileCheck.cpp | 440 // just compare against the regex itself and hope for the best.
493 // Attempt to find the closest/best fuzzy match. Usually an error happens
495 // would like to show the user a best guess at what "should have" matched, to
498 size_t Best = StringRef::npos;
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),
[all...] |
| /external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/ |
| cmsnamed.c | 302 int Best = -1;
315 if (Best == -1) Best = i;
330 if (Best == -1)
331 Best = 0;
333 v = mlu ->Entries + Best;
|
| /external/llvm/utils/TableGen/ |
| FixedLenDecoderEmitter.cpp | 189 /// chooses a best Filter to do its job.
288 /// FilterChooser - FilterChooser chooses the best filter among a set of Filters
327 // Index of the best filter from Filters.
454 const Filter &Best) const;
471 // builds up a list of candidate filters. It chooses the best filter and
475 // Decides on the best configuration of filter(s) to use in order to decode
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/models/ |
| test_failures.py | 42 """Takes a set of test_failures and returns which result type best fits
43 the list of failures. "Best fits" means we use the worst type of failure.
|
| /external/clang/lib/Frontend/ |
| CompilerInstance.cpp | [all...] |
| /external/llvm/lib/Support/ |
| CommandLine.cpp | 242 Option *Best = nullptr;
258 if (!Best || Distance < BestDistance) {
259 Best = O;
269 return Best;
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | 340 // register and hope for the best.
[all...] |
| /external/clang/include/clang/Sema/ |
| Overload.h | 77 ICK_Derived_To_Base, ///< Derived-to-base (C++ [over.best.ics])
392 /// ambiguous conversion (C++0x [over.best.ics]p10).
479 /// per C++ [over.best.ics]p10.
780 /// Find the best viable function on this overload set, if it exists.
782 OverloadCandidateSet::iterator& Best,
|
| /external/chromium_org/third_party/webtreemap/src/ |
| webtreemap.js | 107 // bad. Result is [start,end) covering the best run for this span.
113 var last_score = 0; // Best score yet found.
|
| /frameworks/base/docs/html/training/ |
| training_toc.cs | [all...] |
| /frameworks/base/docs/html/guide/ |
| guide_toc.cs | 539 <li><a href="<?cs var:toroot ?>guide/webapps/best-practices.html">
540 <span class="en">Best Practices for Web Apps</span>
547 <span class="en">Best Practices</span>
551 <span class="it" style="display:none">Best practice</span>
|
