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

1 2 3 4 5 6 7

  /external/elfutils/0.153/backends/
ppc64_corenote.c 1 #define BITS 64
sparc64_corenote.c 1 #define BITS 64
sparc_corenote.c 36 #ifndef BITS
37 # define BITS 32
40 # define BITS 64
46 { .offset = at * BITS/8, .regno = dwreg, .count = n, .bits = BITS }
51 #if BITS == 32
62 #define PRSTATUS_REGS_SIZE (BITS / 8 * (32 + (BITS == 32 ? 6 : 4)))
66 #if BITS == 3
    [all...]
ppc_corenote.c 36 #ifndef BITS
37 # define BITS 32
40 # define BITS 64
48 { .offset = at * BITS/8, .regno = dwreg, .count = n, .bits = BITS }
65 #define PRSTATUS_REGS_SIZE (BITS / 8 * 48)
69 { .offset = 0, .regno = 32, .count = 32, .bits = 64 }, /* f0-f31 */
70 { .offset = 32 * 8 + 4, .regno = 65, .count = 1, .bits = 32 } /* fpscr */
77 { .offset = 0, .regno = 1124, .count = 32, .bits = 128 }
    [all...]
  /external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/tests/
addrop-err.asm 0 [BITS 32]
addrop.asm 0 [BITS 32]
12 [BITS 16]
  /external/chromium_org/third_party/libwebp/utils/
bit_reader.h 29 // However, since range_ is only 8bit, we only need an active window of 8 bits
30 // for value_. Left bits (MSB) gets zeroed and shifted away when value_ falls
31 // below 128, range_ is updated, and fresh bits read from the bitstream are
32 // brought in as LSB. To avoid reading the fresh bits one by one (slow), we
33 // 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)
    [all...]
bit_reader_inl.h 38 #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.
63 bit_t bits; local
84 br->buf_ += BITS >> 3;
86 #if (BITS > 32
    [all...]
  /external/webp/src/utils/
bit_reader.h 29 // However, since range_ is only 8bit, we only need an active window of 8 bits
30 // for value_. Left bits (MSB) gets zeroed and shifted away when value_ falls
31 // below 128, range_ is updated, and fresh bits read from the bitstream are
32 // brought in as LSB. To avoid reading the fresh bits one by one (slow), we
33 // 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)
    [all...]
bit_reader_inl.h 37 #if (BITS > 32)
39 #elif (BITS > 16)
41 #elif (BITS > 8)
56 // makes sure br->value_ has at least BITS bits worth of data
59 // Read 'BITS' bits at a time if possible.
62 bit_t bits; local
83 br->buf_ += BITS >> 3;
85 #if (BITS > 32
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/math/
m_copy_tmp.h 31 #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/mesa3d/src/mesa/math/
m_copy_tmp.h 31 #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/chromium_org/third_party/tcmalloc/chromium/src/
pagemap.h 39 // the bits every time.
41 // The BITS parameter should be the number of bits required to hold
43 // page offset fits in lower 12 bits), BITS == 20.
68 template <int BITS>
71 static const int LENGTH = 1 << BITS;
79 array_ = reinterpret_cast<void**>((*allocator)(sizeof(void*) << BITS));
80 memset(array_, 0, sizeof(void*) << BITS);
98 if ((k >> BITS) > 0)
    [all...]
  /external/chromium_org/third_party/tcmalloc/vendor/src/
pagemap.h 39 // the bits every time.
41 // The BITS parameter should be the number of bits required to hold
43 // page offset fits in lower 12 bits), BITS == 20.
62 template <int BITS>
65 static const int LENGTH = 1 << BITS;
73 array_ = reinterpret_cast<void**>((*allocator)(sizeof(void*) << BITS));
74 memset(array_, 0, sizeof(void*) << BITS);
92 if ((k >> BITS) > 0)
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/i915/
i915_debug.c 226 BITS(
285 unsigned bits = (ptr[0] >> 4) & 0xff; local
288 PRINTF(stream, "%s (%d dwords, flags: %x):\n", name, len, bits);
291 if (bits & (1<<0)) {
294 BITS(stream, ptr[j], 0, 0, "vb invalidate disable");
297 if (bits & (1<<1)) {
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");
304 if (bits & (1<<2))
392 unsigned bits = (ptr[0] >> 8) & 0x3f; local
    [all...]
  /external/chromium_org/third_party/mesa/src/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/mesa3d/src/gallium/drivers/i915/
i915_debug.c 226 BITS(
285 unsigned bits = (ptr[0] >> 4) & 0xff; local
288 PRINTF(stream, "%s (%d dwords, flags: %x):\n", name, len, bits);
291 if (bits & (1<<0)) {
294 BITS(stream, ptr[j], 0, 0, "vb invalidate disable");
297 if (bits & (1<<1)) {
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");
304 if (bits & (1<<2))
392 unsigned bits = (ptr[0] >> 8) & 0x3f; local
    [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/ltrace/sysdeps/linux-gnu/arm/
trace.c 32 #include "bits.h"
115 /* Bits 0-23 are signed immediate value. */
143 * breakpoints at all. If the conditional bits of the
155 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)
    [all...]
regs.h 23 #define BITS(obj,st,fn) (((obj) >> (st)) & SUBMASK((fn) - (st)))
25 ((long) (BITS(obj,st,fn) | ((long) BIT(obj,fn) * ~ SUBMASK(fn - st))))
  /external/apache-http/src/org/apache/commons/codec/binary/
BinaryCodec.java 75 private static final int[] BITS = {BIT_0, BIT_1, BIT_2, BIT_3, BIT_4, BIT_5, BIT_6, BIT_7};
182 for (int bits = 0; bits < BITS.length; ++bits) {
183 if (ascii[jj - bits] == '1') {
184 l_raw[ii] |= BITS[bits];
209 for (int bits = 0; bits < BITS.length; ++bits)
    [all...]
  /external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/macho/tests/nasm64/
macho-reloc64-err.asm 0 [BITS 64]
19 [BITS 64]
  /external/openssl/crypto/sha/asm/
sha512-ia64.pl 25 # reason lower 32 bits are deposited to upper half of 64-bit register
69 $BITS=8*$SZ;
83 $BITS=8*$SZ;
169 $code.=<<___ if ($BITS==64);
197 $t0="t0", $t1="t1", $code.=<<___ if ($BITS==32);
224 $t0="A", $t1="E", $code.=<<___ if ($BITS==64);
507 $t0="t0", $t1="t1", $code.=<<___ if ($BITS==32);
524 $t0="A", $t1="E", $code.=<<___ if ($BITS==64);
595 if ($BITS==64) {
605 print<<___ if ($BITS==32)
    [all...]
  /external/zlib/src/contrib/infback9/
infback9.c 56 unsigned sym, bits, low, size; local
69 bits = 9;
70 inflate_table9(LENS, state.lens, 288, &(next), &(bits), state.work);
76 bits = 5;
77 inflate_table9(DISTS, state.lens, 32, &(next), &(bits), state.work);
94 printf("{%u,%u,%d}", lenfix[low].op, lenfix[low].bits,
105 printf("{%u,%u,%d}", distfix[low].op, distfix[low].bits,
120 bits = 0; \
143 hold += (unsigned long)(*next++) << bits; \
144 bits += 8;
234 unsigned bits; \/* bits in bit buffer *\/ local
    [all...]
  /external/chromium_org/third_party/harfbuzz-ng/src/
hb-set-private.hh 305 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);

Completed in 617 milliseconds

1 2 3 4 5 6 7