Searched refs:lowest (Results 1 - 11 of 11) sorted by relevance

/external/llvm/examples/OCaml-Kaleidoscope/Chapter2/
H A Dtoy.ml7 * 1 is the lowest precedence. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/
H A Dtoy.ml9 * 1 is the lowest precedence. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/
H A Dtoy.ml14 * 1 is the lowest precedence. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
H A Dtoy.ml14 * 1 is the lowest precedence. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
H A Dtoy.ml14 * 1 is the lowest precedence. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
H A Dtoy.ml14 * 1 is the lowest precedence. *)
/external/libvpx/vp8/decoder/arm/neon/
H A Didct_dequant_dc_full_2x_neon.asm82 ; 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 Didct_dequant_full_2x_neon.asm74 ; 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/qemu/
H A Dcpu-all.h150 uint32_t lowest; member in struct:__anon8086::__anon8087
158 uint32_t lowest; member in struct:__anon8086::__anon8089
/external/yaffs2/yaffs2/
H A Dyaffs_guts.c1489 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/src/com/google/common/primitives/
H A Dgenerate.sh178 * <p>More formally, returns the lowest index {@code i} such that {@code

Completed in 541 milliseconds