Searched refs:BITS (Results 1 - 25 of 51) sorted by relevance

123

/external/elfutils/src/backends/
H A Dppc64_corenote.c1 #define BITS 64 macro
H A Ds390x_corenote.c1 #define BITS 64 macro
H A Dsparc64_corenote.c1 #define BITS 64 macro
H A Dsparc_corenote.c39 #ifndef BITS
40 # define BITS 32 macro
43 # define BITS 64 macro
49 { .offset = at * BITS/8, .regno = dwreg, .count = n, .bits = BITS }
54 #if BITS == 32
65 #define PRSTATUS_REGS_SIZE (BITS / 8 * (32 + (BITS == 32 ? 6 : 4)))
69 #if BITS == 32
84 #if BITS
[all...]
H A Ds390_corenote.c39 #ifndef BITS
40 # define BITS 32 macro
43 # define BITS 64 macro
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
[all...]
H A Dppc_corenote.c39 #ifndef BITS
40 # define BITS 32 macro
43 # define BITS 64 macro
51 { .offset = at * BITS/8, .regno = dwreg, .count = n, .bits = BITS }
68 #define PRSTATUS_REGS_SIZE (BITS / 8 * 48)
101 #if BITS == 32
/external/squashfs-tools/squashfs-tools/
H A Dswap.c100 #define SWAP_LE_NUM(BITS) \
101 void swap_le##BITS##_num(void *s, void *d, int n) \
104 for(i = 0; i < n; i++, s += BITS / 8, d += BITS / 8)\
105 swap_le##BITS(s, d);\
112 #define INSWAP_LE_NUM(BITS, TYPE) \
113 void inswap_le##BITS##_num(TYPE *s, int n) \
117 s[i] = inswap_le##BITS(s[i]);\
/external/mesa3d/src/mesa/math/
H A Dm_copy_tmp.h31 #define COPY_FUNC( BITS ) \
32 static void TAG2(copy, BITS)( GLvector4f *to, const GLvector4f *f ) \
40 if (BITS) \
42 if (BITS&1) t[i][0] = from[0]; \
43 if (BITS&2) t[i][1] = from[1]; \
44 if (BITS&4) t[i][2] = from[2]; \
45 if (BITS&8) t[i][3] = from[3]; \
/external/webp/src/utils/
H A Dbit_reader_inl.h38 #if (BITS > 32)
40 #elif (BITS > 16)
42 #elif (BITS > 8)
57 // makes sure br->value_ has at least BITS bits worth of data
60 // Read 'BITS' bits at a time if possible.
84 br->buf_ += BITS >> 3;
86 #if (BITS > 32)
88 bits >>= 64 - BITS;
89 #elif (BITS >= 24)
91 bits >>= (32 - BITS);
[all...]
H A Dbit_reader.h33 // cache BITS of them ahead. The total of (BITS + 8) bits must fit into a
34 // natural register (with type bit_t). To fetch BITS bits from bitstream we
37 // BITS can be any multiple of 8 from 8 to 56 (inclusive).
41 #define BITS 24 macro
43 #define BITS 56 macro
45 #define BITS 24 macro
47 #define BITS 24 macro
49 #define BITS 24 // TODO(skal): test aarch64 and find the proper BITS valu macro
[all...]
/external/mesa3d/src/gallium/drivers/i915/
H A Di915_debug.c226 BITS( function
294 BITS(stream, ptr[j], 0, 0, "vb invalidate disable");
299 BITS(stream, ptr[j], 29, 24, "vb dword width");
300 BITS(stream, ptr[j], 21, 16, "vb dword pitch");
301 BITS(stream, ptr[j], 15, 0, "vb max index");
310 BITS(stream, tc, 3, 0, "tex coord %d", i);
320 BITS(stream, ptr[j], 31, 23, "point width");
321 BITS(stream, ptr[j], 22, 19, "line width");
326 BITS(stream, ptr[j], 14, 13, "cull mode");
331 BITS(strea
[all...]
/external/mesa3d/src/mesa/drivers/dri/i915/
H A Di915_debug.c180 #define BITS( dw, hi, lo, ... ) \ macro
218 BITS(ptr[j], 0, 0, "vb invalidate disable");
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");
234 BITS(tc, 3, 0, "tex coord %d", i);
244 BITS(ptr[j], 31, 23, "point width");
245 BITS(ptr[j], 22, 19, "line width");
250 BITS(ptr[j], 14, 13, "cull mode");
255 BITS(pt
[all...]
/external/ltrace/sysdeps/linux-gnu/arm/
H A Dtrace.c155 const unsigned cond = BITS(this_instr, 28, 31);
156 const unsigned opcode = BITS(this_instr, 24, 27);
178 if (BITS(this_instr, 12, 15) != ARM_REG_PC)
181 if (BITS(this_instr, 22, 25) == 0
182 && BITS(this_instr, 4, 7) == 9) { /* multiply */
190 if (BITS(this_instr, 4, 27) == 0x12fff1
191 || BITS(this_instr, 4, 27) == 0x12fff3) {
192 enum arm_register reg = BITS(this_instr, 0, 3);
204 (proc, BITS(this_instr, 16, 19), &operand1) < 0)
209 uint32_t immval = BITS(this_inst
[all...]
H A Dregs.h23 #define BITS(obj,st,fn) (((obj) >> (st)) & SUBMASK((fn) - (st))) macro
25 ((long) (BITS(obj,st,fn) | ((long) BIT(obj,fn) * ~ SUBMASK(fn - st))))
H A Dregs.c75 enum arm_register rm = BITS(inst, 0, 3);
76 unsigned long shifttype = BITS(inst, 5, 6);
80 if (arm_get_register_offpc(proc, BITS(inst, 8, 11), &shift) < 0)
84 shift = BITS(inst, 7, 11);
/external/apache-http/src/org/apache/commons/codec/binary/
H A DBinaryCodec.java75 private static final int[] BITS = {BIT_0, BIT_1, BIT_2, BIT_3, BIT_4, BIT_5, BIT_6, BIT_7}; field in class:BinaryCodec
182 for (int bits = 0; bits < BITS.length; ++bits) {
184 l_raw[ii] |= BITS[bits];
209 for (int bits = 0; bits < BITS.length; ++bits) {
211 l_raw[ii] |= BITS[bits];
238 for (int bits = 0; bits < BITS.length; ++bits) {
239 if ((raw[ii] & BITS[bits]) == 0) {
268 for (int bits = 0; bits < BITS.length; ++bits) {
269 if ((raw[ii] & BITS[bits]) == 0) {
/external/zlib/src/contrib/infback9/
H A Dinfback9.c157 #define BITS(n) \ macro
283 lastblock = BITS(1);
285 switch (BITS(2)) {
347 state->nlen = BITS(5) + 257;
349 state->ndist = BITS(5) + 1;
351 state->ncode = BITS(4) + 4;
364 state->lens[order[state->have++]] = (unsigned short)BITS(3);
385 here = lencode[BITS(lenbits)];
404 copy = 3 + BITS(2);
411 copy = 3 + BITS(
[all...]
/external/harfbuzz_ng/src/
H A Dhb-set-private.hh305 for (unsigned int j = 0; j < BITS; j++)
307 return i * BITS + j;
314 for (unsigned int j = BITS; j; j--)
316 return (i - 1) * BITS + (j - 1);
323 static const unsigned int BITS = (1 << SHIFT);
324 static const unsigned int MASK = BITS - 1;
325 static const unsigned int ELTS = (MAX_G + 1 + (BITS - 1)) / BITS;
334 ASSERT_STATIC (sizeof (elt_t) * 8 == BITS);
/external/deqp/modules/egl/
H A DteglColorClearTests.cpp82 #define CASE(NAME, DESC, BITS, NUMCFG) { NAME, DESC, BITS, renderable<BITS>, NUMCFG }
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
H A Dfx_zlib_infback.c190 #define BITS(n) \ macro
300 state->last = BITS(1);
302 switch (BITS(2)) {
361 state->nlen = BITS(5) + 257;
363 state->ndist = BITS(5) + 1;
365 state->ncode = BITS(4) + 4;
380 state->lens[order[state->have++]] = (unsigned short)BITS(3);
401 here = state->lencode[BITS(state->lenbits)];
419 copy = 3 + BITS(2);
426 copy = 3 + BITS(
[all...]
/external/zlib/src/
H A Dinfback.c190 #define BITS(n) \ macro
300 state->last = BITS(1);
302 switch (BITS(2)) {
361 state->nlen = BITS(5) + 257;
363 state->ndist = BITS(5) + 1;
365 state->ncode = BITS(4) + 4;
380 state->lens[order[state->have++]] = (unsigned short)BITS(3);
401 here = state->lencode[BITS(state->lenbits)];
419 copy = 3 + BITS(2);
426 copy = 3 + BITS(
[all...]
/external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/
H A DBitSet.pm15 Readonly my $BITS => 64;
16 sub BITS { return $BITS } subroutine
26 Readonly my $MOD_MASK => BITS - 1;
49 $bits = '0' x BITS;
190 return $self->num_bits() / $self->BITS;
209 $self->bits =~ /.{BITS}/gxms
/external/glide/third_party/gif_encoder/src/main/java/com/bumptech/glide/gifencoder/
H A DLZWEncoder.java31 static final int BITS = 12; field in class:LZWEncoder
48 int maxbits = BITS; // user settable max # bits/code
52 int maxmaxcode = 1 << BITS; // should NEVER generate this code
95 // Maintain a BITS character long buffer (so that 8 codes will
/external/libmpeg2/decoder/
H A Dimpeg2d_pnb_pic.c118 u2_mb_type = ps_dec->pu2_mb_type[BITS((UWORD16)u4_next_word,15,10)];
119 u2_len = BITS(u2_mb_type,15,8);
130 ps_dec->u2_motion_type = BITS((UWORD16)u4_next_word,15,14);
162 u2_quant_scale_code = BITS((UWORD16)u4_next_word,15,11);
307 u2_mb_type = ps_dec->pu2_mb_type[BITS((UWORD16)u4_next_word,15,10)];
308 u2_len = BITS(u2_mb_type,15,8);
320 ps_dec->u2_motion_type = BITS((UWORD16)u4_next_word,15,14);
356 u2_quant_scale_code = BITS((UWORD16)u4_next_word,15,11);
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
H A DBitSet.cs50 private const int BITS = 64; // number of bits / long field in class:Antlr.Runtime.BitSet
60 private const int MOD_MASK = BITS - 1;
67 : this(BITS) {
168 int bitPosition = bitNumber & MOD_MASK; // bitNumber mod BITS
181 for (int bit = BITS - 1; bit >= 0; bit--) {
289 return bit >> LOG_BITS; // bit / BITS

Completed in 524 milliseconds

123