| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| 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_logbl.c | 31 if (u.bits.exp == 0) {
32 if ((u.bits.manl | u.bits.manh) == 0) { /* x == 0 */
33 u.bits.sign = 1;
37 if (u.bits.manh == 0) {
39 for (b = LDBL_MANH_SIZE; !(u.bits.manl & m); m >>= 1)
43 for (b = 0; !(u.bits.manh & m); m >>= 1)
51 if (u.bits.exp < (LDBL_MAX_EXP << 1) - 1) /* normal */
52 return ((long double)(u.bits.exp - LDBL_MAX_EXP + 1));
|
| s_modfl.c | 50 /* Return the last n bits of a word, representing the fractional part. */
51 #define GETFRAC(bits, n) ((bits) & ~(MASK << (n)))
52 /* The number of fraction bits in manh, not counting the integer bit */
64 e = ux.bits.exp - LDBL_MAX_EXP + 1;
67 *iptr = zero[ux.bits.sign];
70 if ((GETFRAC(ux.bits.manh, HIBITS - 1 - e) |
71 ux.bits.manl) == 0) { /* X is an integer. */
73 return (zero[ux.bits.sign]);
75 /* Clear all but the top e+1 bits. *
[all...] |
| /external/speex/libspeex/ |
| quant_lsp.h | 56 /* Quantizes narrowband LSPs with 30 bits */
57 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
60 void lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits);
62 /* Quantizes low bit-rate narrowband LSPs with 18 bits */
63 void lsp_quant_lbr(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
66 void lsp_unquant_lbr(spx_lsp_t *lsp, int order, SpeexBits *bits);
68 /* Quantizes high-band LSPs with 12 bits */
69 void lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
72 void lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits);
|
| speex.c | 73 int speex_encode_native(void *state, spx_word16_t *in, SpeexBits *bits)
75 return (*((SpeexMode**)state))->enc(state, in, bits);
78 int speex_decode_native(void *state, SpeexBits *bits, spx_word16_t *out)
80 return (*((SpeexMode**)state))->dec(state, bits, out);
88 EXPORT int speex_encode(void *state, float *in, SpeexBits *bits)
103 return (*((SpeexMode**)state))->enc(state, short_in, bits);
107 EXPORT int speex_encode_int(void *state, spx_int16_t *in, SpeexBits *bits)
111 return (mode)->enc(state, in, bits);
115 EXPORT int speex_decode(void *state, SpeexBits *bits, float *out)
121 ret = (*((SpeexMode**)state))->dec(state, bits, short_out)
[all...] |
| /frameworks/av/media/libstagefright/codecs/aacenc/inc/ |
| bitbuffer.h | 37 The pointer 'pReadNext' points to the next available word, where bits can be read from. The pointer
38 'pWriteNext' points to the next available word, where bits can be written to. The pointer pBitBufBase
43 The element cntBits contains the currently available bits in the bit buffer. It will be incremented when
44 bits are written to the bitstream buffer and decremented when bits are read from the bitstream buffer.
56 Word16 cntBits; /*!< number of available bits in the bitstream buffer
57 write bits to bitstream buffer => increment cntBits
58 read bits from bitstream buffer => decrement cntBits */
59 Word16 size; /*!< size of bitbuffer in bits */
|
| /external/llvm/test/TableGen/ |
| defmclass.td | 4 class XD { bits<4> Prefix = 11; }
6 class XS { bits<4> Prefix = 12; }
12 bits<4> Prefix = 0;
16 class I<bits<4> op> : BaseI {
17 bits<4> opcode = op;
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| SIInstrFormats.td | 25 class VOP3_32 <bits<9> op, string opName, list<dag> pattern>
28 class VOP3_64 <bits<9> op, string opName, list<dag> pattern>
32 class SOP1_32 <bits<8> op, string opName, list<dag> pattern>
35 class SOP1_64 <bits<8> op, string opName, list<dag> pattern>
38 class SOP2_32 <bits<7> op, string opName, list<dag> pattern>
41 class SOP2_64 <bits<7> op, string opName, list<dag> pattern>
44 class SOP2_VCC <bits<7> op, string opName, list<dag> pattern>
47 class VOP1_Helper <bits<8> op, RegisterClass vrc, RegisterClass arc,
53 multiclass VOP1_32 <bits<8> op, string opName, list<dag> pattern> {
60 multiclass VOP1_64 <bits<8> op, string opName, list<dag> pattern>
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMInstrFormats.td | 18 class Format<bits<6> val> {
19 bits<6> Value = val;
90 class AddrMode<bits<5> val> {
91 bits<5> Value = val;
112 class IndexMode<bits<2> val> {
113 bits<2> Value = val;
121 class Domain<bits<3> val> {
122 bits<3> Value = val;
286 bits<2> IndexModeBits = IM.Value;
288 bits<6> Form = F.Value
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/i915/ |
| i915_debug.c | 180 #define BITS( dw, hi, lo, ... ) \
209 GLuint bits = (ptr[0] >> 4) & 0xff; local
212 printf("%s (%d dwords, flags: %x):\n", name, len, bits);
215 if (bits & (1<<0)) {
218 BITS(ptr[j], 0, 0, "vb invalidate disable");
221 if (bits & (1<<1)) {
223 BITS(ptr[j], 29, 24, "vb dword width");
224 BITS(ptr[j], 21, 16, "vb dword pitch");
225 BITS(ptr[j], 15, 0, "vb max index");
228 if (bits & (1<<2))
315 GLuint bits = (ptr[0] >> 8) & 0x3f; local
[all...] |
| /external/elfutils/src/backends/ |
| s390_corenote.c | 39 #ifndef BITS
40 # define BITS 32
43 # define BITS 64
51 { .offset = at * BITS/8, .regno = dwreg, .count = n, .bits = b }
53 GR ( 0, 1, 64, BITS), /* pswm */
54 GR ( 1, 1, 65, BITS, .pc_register = true ), /* pswa */
55 GR ( 2, 16, 0, BITS), /* r0-r15 */
61 /* orig_r2 is at offset (BITS == 32 ? 34 * 4 : 26 * 8). */
62 #define PRSTATUS_REGS_SIZE (BITS / 8 * (BITS == 32 ? 35 : 27)
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/ |
| KeyGenerationParameters.java | 15 * and a strength (in bits).
18 * @param strength the size, in bits, of the keys we want to produce.
42 * @return the strength of the keys this generator produces (in bits).
|
| /external/libvpx/libvpx/vp8/common/ |
| entropy.h | 24 #define ZERO_TOKEN 0 /* 0 Extra Bits 0+0 */
25 #define ONE_TOKEN 1 /* 1 Extra Bits 0+1 */
26 #define TWO_TOKEN 2 /* 2 Extra Bits 0+1 */
27 #define THREE_TOKEN 3 /* 3 Extra Bits 0+1 */
28 #define FOUR_TOKEN 4 /* 4 Extra Bits 0+1 */
29 #define DCT_VAL_CATEGORY1 5 /* 5-6 Extra Bits 1+1 */
30 #define DCT_VAL_CATEGORY2 6 /* 7-10 Extra Bits 2+1 */
31 #define DCT_VAL_CATEGORY3 7 /* 11-18 Extra Bits 3+1 */
32 #define DCT_VAL_CATEGORY4 8 /* 19-34 Extra Bits 4+1 */
33 #define DCT_VAL_CATEGORY5 9 /* 35-66 Extra Bits 5+1 *
[all...] |
| /external/lldb/test/lang/c/bitfields/ |
| main.c | 13 struct Bits
28 printf("%lu", sizeof(struct Bits));
30 struct Bits bits; local
33 bits.b1 = i; //// break $source:$line
35 bits.b2 = i; //// break $source:$line
37 bits.b3 = i; //// break $source:$line
39 bits.b4 = i; //// break $source:$line
41 bits.b5 = i; //// break $source:$line
43 bits.b6 = i; //// break $source:$lin
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/ |
| entropy.h | 24 #define ZERO_TOKEN 0 /* 0 Extra Bits 0+0 */
25 #define ONE_TOKEN 1 /* 1 Extra Bits 0+1 */
26 #define TWO_TOKEN 2 /* 2 Extra Bits 0+1 */
27 #define THREE_TOKEN 3 /* 3 Extra Bits 0+1 */
28 #define FOUR_TOKEN 4 /* 4 Extra Bits 0+1 */
29 #define DCT_VAL_CATEGORY1 5 /* 5-6 Extra Bits 1+1 */
30 #define DCT_VAL_CATEGORY2 6 /* 7-10 Extra Bits 2+1 */
31 #define DCT_VAL_CATEGORY3 7 /* 11-18 Extra Bits 3+1 */
32 #define DCT_VAL_CATEGORY4 8 /* 19-34 Extra Bits 4+1 */
33 #define DCT_VAL_CATEGORY5 9 /* 35-66 Extra Bits 5+1 *
[all...] |
| /libcore/luni/src/main/native/ |
| cbigint.h | 28 single: 31 = sign bit, 30..23 = exponent (8 bits), 22..0 = significand (23 bits)
29 double: 63 = sign bit, 62..52 = exponent (11 bits), 51..0 = significand (52 bits)
30 inf == (all exponent bits set) and (all mantissa bits clear)
31 nan == (all exponent bits set) and (at least one mantissa bit set)
33 zero == (all exponent bits clear) and (all mantissa bits clear)
34 denormal == (all exponent bits clear) and (at least one mantissa bit set
[all...] |
| /external/libavc/encoder/ |
| ih264e_intra_modes_eval.h | 112 * bits in the bit-stream.
120 * input block and the reconstructed block and rate is the number of bits taken
122 * exactly point to the total number of bits it takes, rather it points to header
123 * bits necessary for encoding the macroblock. Assuming the deltaQP, cbp bits
124 * and residual bits fall in to texture bits the number of bits taken to encoding
150 * bits in the bit-stream.
157 * input block and the reconstructed block and rate is the number of bits take
[all...] |
| /external/jemalloc/src/ |
| bitmap.c | 16 * Compute the number of groups necessary to store nbits bits, and
58 * Bits are actually inverted with regard to the external bitmap
59 * interface, so the bitmap starts out with all 1 bits, except for
60 * trailing unused bits (if any). Note that each group uses bit 0 to
61 * correspond to the first logical bit in the group, so extra bits
62 * are the most significant bits of the last group.
|
| /external/jpeg/ |
| jdhuff.h | 24 #define HUFF_LOOKAHEAD 8 /* # of bits of lookahead */
39 /* Lookahead tables: indexed by the next HUFF_LOOKAHEAD bits of
41 * than HUFF_LOOKAHEAD bits long, we can obtain its length and
44 int look_nbits[1<<HUFF_LOOKAHEAD]; /* # bits, or 0 if too long */
55 * Fetching the next N bits from the input stream is a time-critical operation
57 * macros and out-of-line subroutines. Note that N (the number of bits
60 * We read source bytes into get_buffer and dole out bits as needed.
61 * If get_buffer already contains enough bits, they are fetched in-line
63 * bits, jpeg_fill_bit_buffer is called; it will attempt to fill get_buffer
64 * as full as possible (not just to the number of bits needed; thi
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| apint-and-or-and.ll | 2 ; cannot have contributed any of the resultant bits, delete the or. This
21 %D = and i17 %C, 7 ;; This cannot include any bits from %Y!
28 %D = and i49 %C, 1 ;; This cannot include any bits from %Y!
35 %D = and i67 %C, 2 ;; This cannot include any bits from %Y!
41 %B = or i231 %A, 1 ;; This cannot include any bits from X!
47 %B = or i7 %A, 64 ;; This cannot include any bits from X!
|
| /external/pdfium/core/src/fxcodec/libjpeg/ |
| jdhuff.h | 24 #define HUFF_LOOKAHEAD 8 /* # of bits of lookahead */
39 /* Lookahead tables: indexed by the next HUFF_LOOKAHEAD bits of
41 * than HUFF_LOOKAHEAD bits long, we can obtain its length and
44 int look_nbits[1<<HUFF_LOOKAHEAD]; /* # bits, or 0 if too long */
55 * Fetching the next N bits from the input stream is a time-critical operation
57 * macros and out-of-line subroutines. Note that N (the number of bits
60 * We read source bytes into get_buffer and dole out bits as needed.
61 * If get_buffer already contains enough bits, they are fetched in-line
63 * bits, jpeg_fill_bit_buffer is called; it will attempt to fill get_buffer
64 * as full as possible (not just to the number of bits needed; thi
[all...] |
| /external/skia/src/core/ |
| SkDither.cpp | 21 The 4444 version only needs 4 bits, and given that we can reduce its size
22 since the other 4x4 sub pieces all look the same once we truncate the bits.
24 The 565 version only needs 3 bits for red/blue, and only 2 bits for green.
25 For simplicity, we store 3 bits, and have the dither macros for green know
26 this, and they shift the dither value down by 1 to make it 2 bits.
|
| /frameworks/base/tests/AccessoryDisplay/common/src/com/android/accessorydisplay/common/ |
| Protocol.java | 24 // 0: service id (16 bits)
25 // 2: what (16 bits)
26 // 4: content size (32 bits)
57 // 0: width (32 bits)
58 // 4: height (32 bits)
59 // 8: density dpi (32 bits)
|
| /libcore/luni/src/main/java/javax/crypto/spec/ |
| DHGenParameterSpec.java | 36 * the size of the <i>prime modulus</i> in bits.
38 * the size of the <i>random exponent</i> in bits.
46 * Returns the size of the <i>prime modulus</i> in bits.
48 * @return the size of the prime modulus in bits.
55 * Returns the size of the <i>random exponent</i> in bits.
57 * @return the size of the random exponent in bits.
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ |
| unordered_map | 45 #include <bits/stl_algobase.h>
46 #include <bits/allocator.h>
47 #include <bits/stl_function.h> // equal_to, _Identity, _Select1st
48 #include <bits/stringfwd.h>
49 #include <bits/functional_hash.h>
50 #include <bits/hashtable.h>
|
