HomeSort by relevance Sort by last modified time
    Searched refs:Less (Results 26 - 50 of 55) sorted by null

12 3

  /external/skia/src/gpu/gl/
GrGLProgramDesc.h 102 static bool Less(const GrGLProgramDesc& a, const GrGLProgramDesc& b) {
  /external/chromium_org/third_party/skia/src/core/
SkBitmapHeap.cpp 47 bool SkBitmapHeap::LookupEntry::Less(const SkBitmapHeap::LookupEntry& a,
238 int index = SkTSearch<const LookupEntry, LookupEntry::Less>(
  /external/llvm/bindings/ocaml/target/
llvm_target.ml 19 | Less
llvm_target.mli 24 | Less
  /external/skia/src/core/
SkBitmapHeap.cpp 47 bool SkBitmapHeap::LookupEntry::Less(const SkBitmapHeap::LookupEntry& a,
238 int index = SkTSearch<const LookupEntry, LookupEntry::Less>(
  /external/llvm/lib/Target/
TargetMachineC.cpp 134 OL = CodeGenOpt::Less;
  /frameworks/compile/libbcc/tools/bcc/
Main.cpp 154 case '1': config->setOptimizationLevel(llvm::CodeGenOpt::Less); break;
  /frameworks/compile/libbcc/tools/bcc_compat/
Main.cpp 184 case '1': config->setOptimizationLevel(llvm::CodeGenOpt::Less); break;
  /external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
bignum-dtoa.cc 190 // If the remainder of the division is less than the distance to the lower
199 in_delta_room_minus = Bignum::Less(*numerator, *delta_minus);
223 // Remaining digits are less than .5. -> Round down (== do nothing).
378 // The computed number undershoots by less than 0.631 (when we compute log3
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/
lp_bld_init.c 95 * - 1: Less (-O1)
104 Less, // -O1
453 /* For simulating less capable machines */
  /external/chromium_org/v8/src/
bignum-dtoa.cc 168 // If the remainder of the division is less than the distance to the lower
177 in_delta_room_minus = Bignum::Less(*numerator, *delta_minus);
201 // Remaining digits are less than .5. -> Round down (== do nothing).
356 // The computed number undershoots by less than 0.631 (when we compute log3
  /external/llvm/tools/llc/
llc.cpp 277 case '1': OLvl = CodeGenOpt::Less; break;
  /external/mesa3d/src/gallium/auxiliary/gallivm/
lp_bld_init.c 95 * - 1: Less (-O1)
104 Less, // -O1
453 /* For simulating less capable machines */
  /external/chromium_org/third_party/skia/tests/
PathOpsSkpClipTest.cpp     [all...]
  /external/skia/tests/
PathOpsSkpClipTest.cpp     [all...]
  /external/linux-tools-perf/perf-3.12.0/arch/metag/lib/
memcpy.S 15 ! If there are less than 16 bytes to copy use the byte copy loop
99 ! There are 3 mis-alignment cases to be considered. Less than 4 bytes, exactly
  /external/llvm/tools/opt/
opt.cpp 284 return CodeGenOpt::Less;
  /external/chromium_org/sandbox/linux/seccomp-bpf/
codegen.cc 422 // used in a "less" comparator for the purpose of storing pointers to basic
520 // We enter all of our basic blocks into a set using the BasicBlock::Less()
532 BasicBlock::Less<TargetsToBlocks> less(*blocks, PointerCompare);
533 typedef std::set<BasicBlock*, BasicBlock::Less<TargetsToBlocks> > Set;
534 Set seen_basic_blocks(less);
  /external/chromium_org/v8/test/cctest/
test-bignum.cc     [all...]
  /external/lldb/source/Expression/
IRExecutionUnit.cpp 307 .setOptLevel(llvm::CodeGenOpt::Less)
  /external/llvm/tools/lli/
lli.cpp 477 case '1': OLvl = CodeGenOpt::Less; break;
  /external/llvm/tools/llvm-mc/
llvm-mc.cpp 294 case AsmToken::Less: Out->os() << "Less"; break;
  /external/llvm/utils/TableGen/
RegisterInfoEmitter.cpp 725 SequenceToOffsetTable<SubRegIdxVec, CodeGenSubRegIndex::Less> SubRegIdxSeqs;
    [all...]
CodeGenRegisters.cpp 804 CodeGenRegister::Less());
    [all...]
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/
javascript.js 215 // (Less wasteful than consing up a hundred closures on every call.)

Completed in 1615 milliseconds

12 3