HomeSort by relevance Sort by last modified time
    Searched refs:Less (Results 1 - 25 of 43) sorted by null

1 2

  /external/skia/src/core/
SkPtrRecorder.cpp 21 bool SkPtrSet::Less(const Pair& a, const Pair& b) {
34 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
50 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair));
SkPtrRecorder.h 98 static bool Less(const Pair& a, const Pair& b);
SkBitmapHeap.h 235 static bool Less(const LookupEntry& a, const LookupEntry& b);
SkBitmapHeap.cpp 44 bool SkBitmapHeap::LookupEntry::Less(const SkBitmapHeap::LookupEntry& a,
222 int index = SkTSearch<const LookupEntry, LookupEntry::Less>(
  /external/clang/include/clang/Basic/
ABI.h 80 bool Less(const VirtualAdjustment &RHS) const {
103 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual);
148 bool Less(const VirtualAdjustment &RHS) const {
171 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual);
  /external/llvm/utils/TableGen/
SequenceToOffsetTable.h 34 /// @tparam Less A stable comparator for SeqT elements.
35 template<typename SeqT, typename Less = std::less<typename SeqT::value_type> >
42 Less L;
  /external/llvm/include/llvm/Support/
CodeGen.h 51 Less, // -O1
  /external/skia/src/gpu/gl/
GrGLGpuProgramCache.cpp 36 return GrProgramDesc::Less(desc, entry->fProgram->getDesc());
41 return GrProgramDesc::Less(entry->fProgram->getDesc(), desc);
107 ProgDescLess less; local
108 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less);
198 SkASSERT(GrProgramDesc::Less(a, b));
199 SkASSERT(!GrProgramDesc::Less(b, a));
  /frameworks/compile/libbcc/lib/Renderscript/
RSScript.cpp 62 case llvm::CodeGenOpt::Less: mOptimizationLevel = kOptLvl1; break;
  /external/llvm/lib/ExecutionEngine/
TargetSelect.cpp 93 OptLevel = CodeGenOpt::Less;
  /external/skia/src/gpu/
GrProgramDesc.h 59 static bool Less(const GrProgramDesc& a, const GrProgramDesc& b) {
GrResourceCache.cpp 554 struct Less {
559 Less less; local
560 SkTQSort(fNonpurgeableResources.begin(), fNonpurgeableResources.end() - 1, less);
  /external/v8/src/
bignum.h 57 static bool Less(const Bignum& a, const Bignum& b) {
  /prebuilts/go/darwin-x86/test/bench/shootout/
k-nucleotide.go 72 func (kn kNucArray) Less(i, j int) bool {
k-nucleotide-parallel.go 71 func (kn kNucArray) Less(i, j int) bool {
  /prebuilts/go/linux-x86/test/bench/shootout/
k-nucleotide.go 72 func (kn kNucArray) Less(i, j int) bool {
k-nucleotide-parallel.go 71 func (kn kNucArray) Less(i, j int) bool {
  /external/llvm/include/llvm/MC/MCParser/
MCAsmLexer.h 51 Less, LessEqual, LessLess, LessGreater,
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/tic4x/
addressing.s 22 blt Type_BI ; Less than branch (00111)
24 ble Type_BI ; Less than or equal to branch (01000)
54 ldil R0,R0 ; Less than load (00111)
56 ldile R0,R0 ; Less than or equal to load (01000)
  /external/llvm/bindings/ocaml/target/
llvm_target.ml 19 | Less
  /external/boringssl/src/crypto/err/
err_data_generate.go 121 func (ks keySlice) Less(i, j int) bool {
  /external/llvm/lib/Target/Hexagon/
HexagonStoreWidening.cpp 582 auto Less = [] (const MachineInstr *A, const MachineInstr *B) -> bool {
587 std::sort(G.begin(), G.end(), Less);
  /external/llvm/lib/Target/
TargetMachineC.cpp 141 OL = CodeGenOpt::Less;
  /external/skia/tests/
PathOpsSkpClipTest.cpp 695 bool Less(const SortByName& a, const SortByName& b);
696 bool Less(const SortByName& a, const SortByName& b) {
725 int idx = SkTSearch<SortByName, Less>(sorted[0].begin(), count, &name, sizeof(&name));
927 if (SkTSearch<SortByName, Less>(sorted.get()[dirNo - firstDirNo].begin(),
    [all...]
  /frameworks/compile/libbcc/tools/bcc_compat/
Main.cpp 195 case '1': config->setOptimizationLevel(llvm::CodeGenOpt::Less); break;

Completed in 549 milliseconds

1 2