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

1 2 3 4 5 6 7 8 91011>>

  /external/webrtc/src/common_audio/signal_processing_library/main/source/
get_size_in_bits.c 25 int bits = 0; local
27 // Fast binary search to find the number of bits used
29 bits = 16;
30 if ((0x0000FF00 & (value >> bits)))
31 bits += 8;
32 if ((0x000000F0 & (value >> bits)))
33 bits += 4;
34 if ((0x0000000C & (value >> bits)))
35 bits += 2;
36 if ((0x00000002 & (value >> bits)))
    [all...]
  /dalvik/dexgen/src/com/android/dexgen/rop/cst/
CstLiteral64.java 24 /** the value as {@code long} bits */
25 private final long bits; field in class:CstLiteral64
30 * @param bits the value as {@code long} bits
32 /*package*/ CstLiteral64(long bits) {
33 this.bits = bits;
41 bits == ((CstLiteral64) other).bits;
47 return (int) bits ^ (int) (bits >> 32)
    [all...]
CstLiteral32.java 24 /** the value as {@code int} bits */
25 private final int bits; field in class:CstLiteral32
30 * @param bits the value as {@code int} bits
32 /*package*/ CstLiteral32(int bits) {
33 this.bits = bits;
41 bits == ((CstLiteral32) other).bits;
47 return bits;
    [all...]
CstLiteralBits.java 36 * Gets the value as {@code int} bits. If this instance contains
37 * more bits than fit in an {@code int}, then this returns only
38 * the low-order bits.
40 * @return the bits
45 * Gets the value as {@code long} bits. If this instance contains
46 * fewer bits than fit in a {@code long}, then the result of this
49 * @return the bits
54 * Returns true if this value can fit in 16 bits with sign-extension.
56 * @return true if the sign-extended lower 16 bits are the same as
64 int bits = getIntBits() local
79 int bits = getIntBits(); local
    [all...]
  /dalvik/dx/src/com/android/dx/rop/cst/
CstLiteral64.java 24 /** the value as {@code long} bits */
25 private final long bits; field in class:CstLiteral64
30 * @param bits the value as {@code long} bits
32 /*package*/ CstLiteral64(long bits) {
33 this.bits = bits;
41 bits == ((CstLiteral64) other).bits;
47 return (int) bits ^ (int) (bits >> 32)
    [all...]
CstLiteral32.java 24 /** the value as {@code int} bits */
25 private final int bits; field in class:CstLiteral32
30 * @param bits the value as {@code int} bits
32 /*package*/ CstLiteral32(int bits) {
33 this.bits = bits;
41 bits == ((CstLiteral32) other).bits;
47 return bits;
    [all...]
CstLiteralBits.java 36 * Gets the value as {@code int} bits. If this instance contains
37 * more bits than fit in an {@code int}, then this returns only
38 * the low-order bits.
40 * @return the bits
45 * Gets the value as {@code long} bits. If this instance contains
46 * fewer bits than fit in a {@code long}, then the result of this
49 * @return the bits
54 * Returns true if this value can fit in 16 bits with sign-extension.
56 * @return true if the sign-extended lower 16 bits are the same as
64 int bits = getIntBits() local
79 int bits = getIntBits(); local
    [all...]
  /external/speex/libspeex/
bits.c 48 EXPORT void speex_bits_init(SpeexBits *bits)
50 bits->chars = (char*)speex_alloc(MAX_CHARS_PER_FRAME);
51 if (!bits->chars)
54 bits->buf_size = MAX_CHARS_PER_FRAME;
56 bits->owner=1;
58 speex_bits_reset(bits);
61 EXPORT void speex_bits_init_buffer(SpeexBits *bits, void *buff, int buf_size)
63 bits->chars = (char*)buff;
64 bits->buf_size = buf_size;
66 bits->owner=0
    [all...]
speex_callbacks.c 43 EXPORT int speex_inband_handler(SpeexBits *bits, SpeexCallback *callback_list, void *state)
47 /*speex_bits_advance(bits, 5);*/
48 id=speex_bits_unpack_unsigned(bits, 4);
53 return callback->func(bits, state, callback->data);
55 /*If callback is not registered, skip the right number of bits*/
70 speex_bits_advance(bits, adv);
75 EXPORT int speex_std_mode_request_handler(SpeexBits *bits, void *state, void *data)
78 m = speex_bits_unpack_unsigned(bits, 4);
83 EXPORT int speex_std_low_mode_request_handler(SpeexBits *bits, void *state, void *data)
86 m = speex_bits_unpack_unsigned(bits, 4)
    [all...]
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
basic_iterator.h 36 #include <bits/c++config.h>
38 #include <bits/stl_iterator_base_types.h>
39 #include <bits/stl_iterator_base_funcs.h>
40 #include <bits/stl_iterator.h>
  /external/clang/utils/ABITest/
build-and-summarize-all.sh 10 for bits in 32 64; do
12 echo "-- $kind-$bits --"
13 (cd $kind-$bits && ../build-and-summarize.sh $1)
  /bionic/libm/src/
s_fmax.c 43 if (u[0].bits.exp == 2047 && (u[0].bits.manh | u[0].bits.manl) != 0)
45 if (u[1].bits.exp == 2047 && (u[1].bits.manh | u[1].bits.manl) != 0)
49 if (u[0].bits.sign != u[1].bits.sign)
50 return (u[u[0].bits.sign].d);
s_fmaxl.c 45 if (u[0].bits.exp == 32767 && (u[0].bits.manh | u[0].bits.manl) != 0)
47 if (u[1].bits.exp == 32767 && (u[1].bits.manh | u[1].bits.manl) != 0)
51 if (u[0].bits.sign != u[1].bits.sign)
52 return (u[0].bits.sign ? y : x);
s_fmin.c 43 if (u[0].bits.exp == 2047 && (u[0].bits.manh | u[0].bits.manl) != 0)
45 if (u[1].bits.exp == 2047 && (u[1].bits.manh | u[1].bits.manl) != 0)
49 if (u[0].bits.sign != u[1].bits.sign)
50 return (u[u[1].bits.sign].d);
s_fminl.c 45 if (u[0].bits.exp == 32767 && (u[0].bits.manh | u[0].bits.manl) != 0)
47 if (u[1].bits.exp == 32767 && (u[1].bits.manh | u[1].bits.manl) != 0)
51 if (u[0].bits.sign != u[1].bits.sign)
52 return (u[1].bits.sign ? y : x);
s_ceill.c 36 uint64_t o = u.bits.manh; \
37 u.bits.manh += (c); \
38 if (u.bits.manh < o) \
39 u.bits.exp++; \
44 uint64_t o = u.bits.manh; \
45 u.bits.manh += (c); \
46 if (u.bits.manh < o) { \
47 u.bits.exp++; \
48 u.bits.manh |= 1llu << (LDBL_MANH_SIZE - 1); \
59 int e = u.bits.exp - LDBL_MAX_EXP + 1
    [all...]
s_floorl.c 36 uint64_t o = u.bits.manh; \
37 u.bits.manh += (c); \
38 if (u.bits.manh < o) \
39 u.bits.exp++; \
44 uint64_t o = u.bits.manh; \
45 u.bits.manh += (c); \
46 if (u.bits.manh < o) { \
47 u.bits.exp++; \
48 u.bits.manh |= 1llu << (LDBL_MANH_SIZE - 1); \
59 int e = u.bits.exp - LDBL_MAX_EXP + 1
    [all...]
s_nextafterl.c 44 if ((ux.bits.exp == 0x7fff &&
45 ((ux.bits.manh&~LDBL_NBIT)|ux.bits.manl) != 0) ||
46 (uy.bits.exp == 0x7fff &&
47 ((uy.bits.manh&~LDBL_NBIT)|uy.bits.manl) != 0))
51 ux.bits.manh = 0; /* return +-minsubnormal */
52 ux.bits.manl = 1;
53 ux.bits.sign = uy.bits.sign
    [all...]
s_isnormal.c 39 return (u.bits.exp != 0 && u.bits.exp != 2047);
48 return (u.bits.exp != 0 && u.bits.exp != 255);
57 return (u.bits.exp != 0 && u.bits.exp != 32767);
s_isnan.c 41 return (u.bits.exp == 2047 && (u.bits.manl != 0 || u.bits.manh != 0));
51 return (u.bits.exp == 255 && u.bits.man != 0);
61 return (u.bits.exp == 32767 && (u.bits.manl != 0 || u.bits.manh != 0));
  /external/dropbear/libtomcrypt/src/prngs/
rng_make_prng.c 15 portable way to get secure random bits to feed a PRNG (Tom St Denis)
20 @param bits Number of bits of entropy desired (64 ... 1024)
26 int rng_make_prng(int bits, int wprng, prng_state *prng,
39 if (bits < 64 || bits > 1024) {
47 bits = ((bits/8)+((bits&7)!=0?1:0)) * 2;
48 if (rng_get_bytes(buf, (unsigned long)bits, callback) != (unsigned long)bits)
    [all...]
  /external/speex/include/speex/
speex_bits.h 51 int nbBits; /**< Total number of bits stored in the stream*/
62 void speex_bits_init(SpeexBits *bits);
65 void speex_bits_init_buffer(SpeexBits *bits, void *buff, int buf_size);
67 /** Sets the bits in a SpeexBits struct to use data from an existing buffer (for decoding without copying data) */
68 void speex_bits_set_bit_buffer(SpeexBits *bits, void *buff, int buf_size);
71 void speex_bits_destroy(SpeexBits *bits);
73 /** Resets bits to initial value (just after initialization, erasing content)*/
74 void speex_bits_reset(SpeexBits *bits);
77 void speex_bits_rewind(SpeexBits *bits);
80 void speex_bits_read_from(SpeexBits *bits, char *bytes, int len)
    [all...]
  /bionic/libm/
isinf.c 44 return (u.bits.exp == 2047 && u.bits.manl == 0 && u.bits.manh == 0);
53 return (u.bits.exp == 255 && u.bits.man == 0);
64 return (u.bits.exp == 32767 && u.bits.manl == 0 && u.bits.manh == 0);
66 return (u.bits.exp == 2047 && u.bits.manl == 0 && u.bits.manh == 0)
    [all...]
fpclassify.c 43 if (u.bits.exp == 0) {
44 if (u.bits.man == 0)
48 if (u.bits.exp == 255) {
49 if (u.bits.man == 0)
62 if (u.bits.exp == 0) {
63 if ((u.bits.manl | u.bits.manh) == 0)
67 if (u.bits.exp == 2047) {
68 if ((u.bits.manl | u.bits.manh) == 0
    [all...]
  /bionic/libm/amd64/
_fpmath.h 38 } bits; member in union:IEEEl2bits
42 #define mask_nbit_l(u) ((u).bits.manh &= ~LDBL_NBIT)
48 (a)[0] = (uint32_t)(u).bits.manl; \
49 (a)[1] = (uint32_t)(u).bits.manh; \

Completed in 431 milliseconds

1 2 3 4 5 6 7 8 91011>>