| /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 | 321 const MachineBasicBlock *Best = nullptr;
331 if (!Best || Depth < BestDepth)
332 Best = Pred, BestDepth = Depth;
334 return Best;
343 const MachineBasicBlock *Best = nullptr;
359 if (!Best || Height < BestHeight)
360 Best = Succ, BestHeight = Height;
362 return Best;
[all...] |
| /prebuilts/go/darwin-x86/src/text/template/ |
| example_test.go | 22 Best wishes,
54 // Best wishes,
62 // Best wishes,
69 // Best wishes,
|
| /prebuilts/go/linux-x86/src/text/template/ |
| example_test.go | 22 Best wishes,
54 // Best wishes,
62 // Best wishes,
69 // Best wishes,
|
| /external/llvm/test/tools/llvm-readobj/ARM/ |
| attribute-6.s | 44 @CHECK-OBJ-NEXT: Description: Best Debugging
51 @CHECK-OBJ-NEXT: Description: Best Accuracy
|
| /external/clang/lib/Sema/ |
| SemaOverload.cpp | [all...] |
| SemaInit.cpp | 410 OverloadCandidateSet::iterator Best;
413 .BestViableFunction(SemaRef, Kind.getLocation(), Best);
416 CXXConstructorDecl *CtorDecl = cast<CXXConstructorDecl>(Best->Function);
[all...] |
| SemaTemplateInstantiate.cpp | [all...] |
| SemaExprCXX.cpp | [all...] |
| SemaTemplate.cpp | [all...] |
| SemaTemplateDeduction.cpp | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ResourcePriorityQueue.cpp | 602 std::vector<SUnit *>::iterator Best = Queue.begin();
604 signed BestCost = SUSchedulingCost(*Best);
610 Best = I;
618 if (Picker(*Best, *I))
619 Best = I;
622 SUnit *V = *Best;
623 if (Best != std::prev(Queue.end()))
624 std::swap(*Best, Queue.back());
|
| ScheduleDAGRRList.cpp | 465 SDNode *Best = nullptr;
472 if (!Best || (MyMaxNest > BestMaxNest)) {
473 Best = New;
477 assert(Best);
479 return Best;
[all...] |
| /external/compiler-rt/lib/ubsan/ |
| ubsan_diag.cc | 236 Range *Best = 0;
239 (!Best ||
240 Best->getStart().getMemoryLocation() >
242 Best = &Ranges[I];
243 return Best;
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 798 // The best SUnit candidate.
807 // Register pressure values for the best candidate.
810 // Critical resource consumption of the best candidate.
819 void setBest(SchedCandidate &Best) {
820 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
821 SU = Best.SU;
822 Reason = Best.Reason;
823 RPDelta = Best.RPDelta;
824 ResDelta = Best.ResDelta;
|
| /external/clang/lib/Basic/ |
| DiagnosticIDs.cpp | 567 StringRef Best;
585 Best = "";
588 Best = O.getName();
593 return Best;
|
| /external/pdfium/third_party/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/clang/lib/Format/ |
| UnwrappedLineFormatter.cpp | 620 /// \brief Finds the best way to break lines.
629 /// \brief Formats the line by finding the best line breaks with line lengths
640 // Find best solution in solution space.
765 /// \brief Applies the best formatting by reconstructing the path in the
766 /// solution space that leads to \c Best.
767 void reconstructPath(LineState &State, StateNode *Best) {
770 while (Best->Previous) {
771 Path.push_front(Best);
772 Best = Best->Previous
[all...] |
| /external/llvm/utils/FileCheck/ |
| FileCheck.cpp | 451 // just compare against the regex itself and hope for the best.
504 // Attempt to find the closest/best fuzzy match. Usually an error happens
506 // would like to show the user a best guess at what "should have" matched, to
509 size_t Best = StringRef::npos;
527 if (Quality < BestQuality || Best == StringRef::npos) {
528 Best = i;
536 if (Best && Best != StringRef::npos && BestQuality < 50) {
537 SM.PrintMessage(SMLoc::getFromPointer(Buffer.data() + Best),
[all...] |
| /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.
448 const Filter &Best) const;
468 // builds up a list of candidate filters. It chooses the best filter and
472 // Decides on the best configuration of filter(s) to use in order to decode
[all...] |
| /external/clang/lib/Frontend/ |
| CompilerInstance.cpp | [all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | 355 // register and hope for the best.
[all...] |
| /external/clang/include/clang/Sema/ |
| Overload.h | 78 ICK_Derived_To_Base, ///< Derived-to-base (C++ [over.best.ics])
380 /// ambiguous conversion (C++0x [over.best.ics]p10).
467 /// per C++ [over.best.ics]p10.
780 /// Find the best viable function on this overload set, if it exists.
782 OverloadCandidateSet::iterator& Best,
|
| /external/llvm/lib/Support/ |
| CommandLine.cpp | 293 Option *Best = nullptr;
309 if (!Best || Distance < BestDistance) {
310 Best = O;
320 return Best;
[all...] |
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/ |
| natconv.go | 348 // is made better by splitting the subblocks recursively. Best is to split blocks until one more
|
