Searched refs:lowest (Results 1 - 13 of 13) sorted by relevance
/external/llvm/examples/OCaml-Kaleidoscope/Chapter2/ |
H A D | toy.ml | 7 * 1 is the lowest precedence. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
H A D | toy.ml | 9 * 1 is the lowest precedence. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
H A D | toy.ml | 14 * 1 is the lowest precedence. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
H A D | toy.ml | 14 * 1 is the lowest precedence. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
H A D | toy.ml | 14 * 1 is the lowest precedence. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
H A D | toy.ml | 14 * 1 is the lowest precedence. *)
|
/external/libvpx/vp8/decoder/arm/neon/ |
H A D | idct_dequant_dc_full_2x_neon.asm | 82 ; compensate for this. in the case of sinpi8sqrt2, the lowest bit is 0, 85 ; for cospi8sqrt2minus1 the lowest bit is 1, so we lose precision if we 203 ; because the lowest bit in 0x8a8c is 0, we can pre-shift this
|
H A D | idct_dequant_full_2x_neon.asm | 74 ; compensate for this. in the case of sinpi8sqrt2, the lowest bit is 0, 77 ; for cospi8sqrt2minus1 the lowest bit is 1, so we lose precision if we 195 ; because the lowest bit in 0x8a8c is 0, we can pre-shift this
|
/external/openssl/crypto/modes/asm/ |
H A D | ghash-armv4.pl | 344 vdup.8 $xi,`&Dlo("$IN")`[0] @ broadcast lowest byte 374 vdup.8 $xi,`&Dlo("$IN")`[0] @ broadcast lowest byte 383 vdup.8 $xi,`&Dlo("$IN")`[0] @ broadcast lowest byte
|
H A D | ghash-armv4.s | 332 vdup.8 d4,d28[0] @ broadcast lowest byte 362 vdup.8 d4,d28[0] @ broadcast lowest byte 371 vdup.8 d4,d28[0] @ broadcast lowest byte
|
/external/qemu/ |
H A D | cpu-all.h | 150 uint32_t lowest; member in struct:__anon9036::__anon9037 158 uint32_t lowest; member in struct:__anon9036::__anon9039
|
/external/yaffs2/yaffs2/ |
H A D | yaffs_guts.c | 1489 int lowest = 999999; local 1493 for (i = 0; i < 10 && lowest > 0; i++) { 1496 if (dev->objectBucket[x].count < lowest) { 1497 lowest = dev->objectBucket[x].count; 1507 for (i = 0; i < 10 && lowest > 3; i++) { 1510 if (dev->objectBucket[x].count < lowest) { 1511 lowest = dev->objectBucket[x].count; 3177 int lowest = -99; /* Stop compiler whining. */ local 3187 /* Find the dirty cache for this object with the lowest chunk id. */ 3193 lowest) { [all...] |
/external/guava/guava/src/com/google/common/primitives/ |
H A D | generate.sh | 180 * <p>More formally, returns the lowest index {@code i} such that {@code
|
Completed in 114 milliseconds