| /external/llvm/lib/Support/ |
| TargetRegistry.cpp | 33 const Target *Best = 0, *EquallyBest = 0;
37 if (!Best || Qual > BestQuality) {
38 Best = &*it;
46 if (!Best) {
52 // Otherwise, take the best target, but make sure we don't have two equally
53 // good best targets.
56 Best->Name + "\" and \"" + EquallyBest->Name + "\"";
60 return Best;
|
| CommandLine.cpp | 203 Option *Best = 0;
219 if (!Best || Distance < BestDistance) {
220 Best = O;
230 return Best;
[all...] |
| /external/llvm/lib/CodeGen/ |
| LatencyPriorityQueue.cpp | 121 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());
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ResourcePriorityQueue.cpp | 604 std::vector<SUnit *>::iterator Best = Queue.begin();
606 signed BestCost = SUSchedulingCost(*Best);
609 if (*I == *Best)
614 Best = I;
622 if (Picker(*Best, *I))
623 Best = I;
626 SUnit *V = *Best;
627 if (Best != prior(Queue.end()))
628 std::swap(*Best, Queue.back());
|
| ScheduleDAGRRList.cpp | 444 SDNode *Best = 0;
451 if (!Best || (MyMaxNest > BestMaxNest)) {
452 Best = New;
456 assert(Best);
458 return Best;
[all...] |
| /external/clang/lib/Sema/ |
| SemaOverload.cpp | [all...] |
| SemaInit.cpp | [all...] |
| SemaTemplateInstantiate.cpp | [all...] |
| SemaExprCXX.cpp | [all...] |
| SemaTemplateDeduction.cpp | [all...] |
| SemaLookup.cpp | [all...] |
| SemaExpr.cpp | 387 // generally best to say that void types just doesn't undergo
[all...] |
| /external/llvm/utils/FileCheck/ |
| FileCheck.cpp | 353 // just compare against the regex itself and hope for the best.
394 // Attempt to find the closest/best fuzzy match. Usually an error happens
396 // would like to show the user a best guess at what "should have" matched, to
399 size_t Best = StringRef::npos;
417 if (Quality < BestQuality || Best == StringRef::npos) {
418 Best = i;
426 if (Best && Best != StringRef::npos && BestQuality < 50) {
427 SM.PrintMessage(SMLoc::getFromPointer(Buffer.data() + Best),
|
| /external/clang/lib/Frontend/ |
| CompilerInstance.cpp | [all...] |
| /external/clang/lib/Basic/ |
| DiagnosticIDs.cpp | 553 StringRef Best;
564 Best = "";
567 Best = i->getName();
572 return Best;
|
| /external/webkit/Tools/Scripts/webkitpy/layout_tests/layout_package/ |
| test_failures.py | 41 """Takes a set of test_failures and returns which result type best fits
42 the list of failures. "Best fits" means we use the worst type of failure.
|
| /external/llvm/utils/TableGen/ |
| FixedLenDecoderEmitter.cpp | 98 /// chooses a best Filter to do its job.
194 /// FilterChooser - FilterChooser chooses the best filter among a set of Filters
232 // Index of the best filter from Filters.
360 const Filter &Best) const;
374 // builds up a list of candidate filters. It chooses the best filter and
378 // Decides on the best configuration of filter(s) to use in order to decode
[all...] |
| /external/clang/lib/AST/ |
| DeclCXX.cpp | 347 /// cv-qualifiers on a single parameter, and return the best overload candidate
357 unsigned Best = 0, N = Cands.size();
359 if (Cands[Best].second.compatiblyIncludes(Cands[I].second))
360 Best = I;
363 if (Cands[Best].second.compatiblyIncludes(Cands[I].second))
366 return Cands[Best].first;
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | 312 // register and hope for the best.
[all...] |
| /external/clang/include/clang/Sema/ |
| Overload.h | 76 ICK_Derived_To_Base, ///< Derived-to-base (C++ [over.best.ics])
390 /// ambiguous conversion (C++0x [over.best.ics]p10).
482 /// per C++ [over.best.ics]p10.
794 /// Find the best viable function on this overload set, if it exists.
796 OverloadCandidateSet::iterator& Best,
|
| /frameworks/base/libs/androidfw/ |
| ResourceTypes.cpp | [all...] |
| /external/v8/test/mjsunit/ |
| unicode-test.js | [all...] |
