HomeSort by relevance Sort by last modified time
    Searched refs:bits (Results 401 - 425 of 4103) sorted by null

<<11121314151617181920>>

  /prebuilts/ndk/9/platforms/android-19/arch-x86/usr/include/rs/
spec.l 106 currType->bits = 8;
112 currType->bits = 16;
118 currType->bits = 32;
124 currType->bits = 64;
130 currType->bits = 8;
136 currType->bits = 16;
142 currType->bits = 32;
148 currType->bits = 64;
154 currType->bits = 32;
160 currType->bits = 64
    [all...]
  /external/bluetooth/bluedroid/embdrv/sbc/decoder/srce/
readsamplesjoint.inc 69 OI_UINT8 *bits_array = &common->bits.uint8[0];
79 OI_UINT8 bits = *bits_array++;
82 OI_BITSTREAM_READUINT(raw, bits, ptr, value, bitPtr);
83 dequant = OI_SBC_Dequant(raw, sf, bits);
93 OI_UINT8 bits = *bits_array++;
96 OI_BITSTREAM_READUINT(raw, bits, ptr, value, bitPtr);
97 dequant = OI_SBC_Dequant(raw, sf, bits);
  /external/chromium_org/third_party/openssl/openssl/crypto/asn1/
a_bitstr.c 68 int ret,j,bits,len; local
79 bits=(int)a->flags&0x07;
88 if (j & 0x01) bits=0;
89 else if (j & 0x02) bits=1;
90 else if (j & 0x04) bits=2;
91 else if (j & 0x08) bits=3;
92 else if (j & 0x10) bits=4;
93 else if (j & 0x20) bits=5;
94 else if (j & 0x40) bits=6;
95 else if (j & 0x80) bits=7
    [all...]
  /external/openssl/crypto/asn1/
a_bitstr.c 68 int ret,j,bits,len; local
79 bits=(int)a->flags&0x07;
88 if (j & 0x01) bits=0;
89 else if (j & 0x02) bits=1;
90 else if (j & 0x04) bits=2;
91 else if (j & 0x08) bits=3;
92 else if (j & 0x10) bits=4;
93 else if (j & 0x20) bits=5;
94 else if (j & 0x40) bits=6;
95 else if (j & 0x80) bits=7
    [all...]
  /external/pixman/pixman/
pixman-noop.c 43 iter->buffer += iter->image->bits.rowstride;
51 iter->buffer += iter->image->bits.rowstride;
92 color = image->bits.fetch_pixel_32 (&image->bits, 0, 0);
106 color = image->bits.fetch_pixel_float (&image->bits, 0, 0);
118 iter->x + iter->width <= image->bits.width &&
119 iter->y + iter->height <= image->bits.height)
122 image->bits.bits + iter->y * image->bits.rowstride + iter->x
    [all...]
  /external/elfutils/0.153/backends/
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...]
x86_64_regs.c 41 int *bits, int *type)
50 *bits = 64;
60 *bits = 128;
66 *bits = 80;
73 *bits = 16;
154 *bits = 64;
169 *bits = 16;
ia64_regs.c 40 int *bits, int *type)
50 *bits = 64;
86 *bits = 128;
107 *bits = 128;
211 *bits = 1;
224 *bits = 1;
238 *bits = 1;
248 *bits = 1;
259 *bits = 1;
arm_regs.c 40 int *bits, int *type)
49 *bits = 32;
81 *bits = 96;
94 *bits = 64;
103 *bits = 64;
sh_corenote.c 43 { .offset = at * 4, .regno = dwreg, .count = n, .bits = 32 }
78 { .offset = 0, .regno = 25, .count = 16, .bits = 32 }, /* fr0-fr15 */
79 { .offset = 16, .regno = 87, .count = 16, .bits = 32 }, /* xf0-xf15 */
80 { .offset = 32, .regno = 24, .count = 1, .bits = 32 }, /* fpscr */
81 { .offset = 33, .regno = 23, .count = 1, .bits = 32 } /* fpul */
arm_corenote.c 42 { .offset = 0, .regno = 0, .count = 16, .bits = 32 }, /* r0..r15 */
43 { .offset = 16 * 4, .regno = 128, .count = 1, .bits = 32 }, /* cpsr */
56 { .offset = 0, .regno = 96, .count = 8, .bits = 96 }, /* f0..f7 */
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/
h264bsd_stream.c 57 Read and remove bits from the stream buffer.
61 numBits number of bits to read
67 bits read from stream
68 END_OF_STREAM if not enough bits left
98 Read 32 bits from the stream buffer. Buffer is left as it is, i.e.
99 no bits are removed. First bit read from the stream is the MSB of
100 the return value. If there is not enough bits in the buffer ->
101 bits beyong the end of the stream are set to '0' in the return
111 bits read from stream
118 i32 bits, shift local
    [all...]
  /libcore/luni/src/main/java/java/lang/
Math.java 1033 int bits = Float.floatToRawIntBits(f); local
1043 long bits = Double.doubleToRawLongBits(d); local
1152 long bits = Double.doubleToLongBits(d); local
1206 int bits = Float.floatToIntBits(d); local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
bitmap.h 35 - the element for I will have index is I / (bits per element)
36 - the position for I within element is I % (bits per element)
40 An important parameter is the number of bits per element. In this
41 implementation, there are 128 bits per element. This results in a
147 /* Number of bits in each actual element of a bitmap. */
158 /* Bitmap set element. We use a linked list to hold only the bits that
174 BITMAP_WORD bits[BITMAP_ELEMENT_WORDS]; /* Bits that are set. */ member in struct:bitmap_element_def
220 /* Count the number of bits set in the bitmap. */
329 BITMAP_WORD bits; member in struct:__anon48212
    [all...]
  /external/jemalloc/include/jemalloc/internal/
rtree.h 39 rtree_t *rtree_new(unsigned bits, rtree_alloc_t *alloc, rtree_dalloc_t *dalloc);
59 /* The least significant bits of the key are ignored. */ \
65 unsigned i, lshift, height, bits; \
71 i++, lshift += bits, node = child) { \
72 bits = rtree->level2bits[i]; \
74 3)) - bits); \
86 bits = rtree->level2bits[i]; \
88 bits); \
134 unsigned i, lshift, height, bits; local
140 i++, lshift += bits, node = child)
    [all...]
  /external/qemu/include/qemu/
bitmap.h 35 * bitmap_empty(src, nbits) Are all bits zero in *src?
36 * bitmap_full(src, nbits) Are all bits set in *src?
64 #define DECLARE_BITMAP(name,bits) \
65 unsigned long name[BITS_TO_LONGS(bits)]
70 int slow_bitmap_empty(const unsigned long *bitmap, int bits);
71 int slow_bitmap_full(const unsigned long *bitmap, int bits);
73 const unsigned long *bitmap2, int bits);
75 int bits);
77 const unsigned long *src, int shift, int bits);
79 const unsigned long *src, int shift, int bits);
    [all...]
  /dalvik/dx/src/com/android/dx/dex/code/form/
Form12x.java 114 BitSet bits = new BitSet(2); local
120 bits.set(0, unsignedFitsInNibble(r0));
121 bits.set(1, unsignedFitsInNibble(r1));
126 bits.set(0, false);
127 bits.set(1, false);
130 bits.set(0, dstRegComp);
131 bits.set(1, dstRegComp);
134 bits.set(2, unsignedFitsInNibble(regs.get(2).getReg()));
142 return bits;
  /external/chromium_org/third_party/brotli/src/brotli/enc/
bit_cost.h 95 // account for rle extra bits
100 int bits = 18 + 2 * max_depth; // huffman tree of huffman tree cost local
102 bits += histogram[i] * cost[i]; // huffman tree bit cost
105 return bits;
127 int bits = 0; local
129 bits += histogram.data_[i] * depth[i];
132 bits += 28;
134 bits += 37;
136 bits += HuffmanBitCost(depth, kSize);
138 return bits;
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/bn/
bn_mpi.c 65 int bits; local
70 bits=BN_num_bits(a);
71 num=(bits+7)/8;
72 if (bits > 0)
74 ext=((bits & 0x07) == 0);
  /external/openssl/crypto/bn/
bn_mpi.c 65 int bits; local
70 bits=BN_num_bits(a);
71 num=(bits+7)/8;
72 if (bits > 0)
74 ext=((bits & 0x07) == 0);
  /external/speex/libspeex/
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...]
  /libcore/luni/src/main/java/java/util/concurrent/
ThreadLocalRandom.java 99 protected int next(int bits) {
101 return (int) (rnd >>> (48-bits));
139 int bits = next(2); local
141 long nextn = ((bits & 2) == 0) ? half : n - half;
142 if ((bits & 1) == 0)
  /bionic/libm/upstream-freebsd/lib/msun/src/
s_cosl.c 59 z.bits.sign = 0;
62 if (z.bits.exp == 0)
66 if (z.bits.exp == 32767)
  /external/chromium_org/native_client_sdk/src/libraries/nacl_io/stream/
stream_node.h 47 void SetStreamFlags(uint32_t bits);
48 void ClearStreamFlags(uint32_t bits);
50 bool TestStreamFlags(uint32_t bits);
  /external/chromium_org/third_party/WebKit/Source/wtf/
BitVector.h 40 // of bits.
42 // - The bitvector remembers the bound of how many bits can be stored, but this
51 // - Bits are automatically initialized to zero.
116 return !!(bits()[bit / bitsInPointer()] & (static_cast<uintptr_t>(1) << (bit & (bitsInPointer() - 1))));
122 bits()[bit / bitsInPointer()] |= (static_cast<uintptr_t>(1) << (bit & (bitsInPointer() - 1)));
128 bits()[bit / bitsInPointer()] &= ~(static_cast<uintptr_t>(1) << (bit & (bitsInPointer() - 1)));
191 static uintptr_t makeInlineBits(uintptr_t bits)
193 ASSERT(!(bits & (static_cast<uintptr_t>(1) << maxInlineBits())));
194 return bits | (static_cast<uintptr_t>(1) << maxInlineBits());
201 uintptr_t* bits() { return bitwise_cast<uintptr_t*>(this + 1);
    [all...]

Completed in 1381 milliseconds

<<11121314151617181920>>