| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/include/linux/ |
| bitmap.h | 11 #define BITMAP_LAST_WORD_MASK(nbits) \
13 ((nbits) % BITS_PER_LONG) ? \
14 (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \
17 #define small_const_nbits(nbits) \
18 (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG)
20 static inline void bitmap_zero(unsigned long *dst, int nbits)
22 if (small_const_nbits(nbits))
25 int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
30 static inline int bitmap_weight(const unsigned long *src, int nbits)
[all...] |
| /development/ndk/platforms/android-3/include/linux/ |
| bitmap.h | 21 #define BITMAP_LAST_WORD_MASK(nbits) ( ((nbits) % BITS_PER_LONG) ? (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL )
|
| /external/bison/src/ |
| Sbitset.c | 26 Sbitset__new (Sbitset__Index nbits)
28 /* Some functions, like Sbitset__last_byte_mask, will fail if nbits = 0. */
29 aver (nbits);
30 return xcalloc (1, Sbitset__nbytes (nbits));
34 Sbitset__new_on_obstack (Sbitset__Index nbits, struct obstack *obstackp)
39 aver (nbits);
40 result = obstack_alloc (obstackp, Sbitset__nbytes (nbits));
41 for (ptr = result, end = result + Sbitset__nbytes (nbits); ptr < end; ++ptr)
53 Sbitset__isEmpty (Sbitset self, Sbitset__Index nbits)
55 Sbitset last = self + Sbitset__nbytes (nbits) - 1
[all...] |
| Sbitset.h | 27 #define Sbitset__nbytes(NBITS) \
28 (((NBITS) + CHAR_BIT - 1) / CHAR_BIT)
33 #define Sbitset__last_byte_mask(NBITS) \
34 (UCHAR_MAX << (CHAR_BIT - 1 - ((NBITS) - 1) % CHAR_BIT))
36 /* nbits must not be 0. */
37 Sbitset Sbitset__new (Sbitset__Index nbits);
38 Sbitset Sbitset__new_on_obstack (Sbitset__Index nbits,
45 bool Sbitset__isEmpty (Sbitset self, Sbitset__Index nbits);
47 void Sbitset__fprint(Sbitset self, Sbitset__Index nbits, FILE *file);
61 /* NBITS is the size of the bitset. More than NBITS bits might be reset. *
[all...] |
| /external/jemalloc/src/ |
| bitmap.c | 7 static size_t bits2groups(size_t nbits);
12 bits2groups(size_t nbits)
15 return ((nbits >> LG_BITMAP_GROUP_NBITS) +
16 !!(nbits & BITMAP_GROUP_NBITS_MASK));
20 bitmap_info_init(bitmap_info_t *binfo, size_t nbits)
25 assert(nbits > 0);
26 assert(nbits <= (ZU(1) << LG_BITMAP_MAXBITS));
29 * Compute the number of groups necessary to store nbits bits, and
34 group_count = bits2groups(nbits);
44 binfo->nbits = nbits
[all...] |
| /external/chromium_org/third_party/brotli/src/brotli/dec/ |
| prefix.h | 23 /* [offset, offset + 2^nbits) */
26 int nbits; member in struct:PrefixCodeRange
|
| /external/chromium_org/third_party/webrtc/common_audio/signal_processing/ |
| get_scaling_square.c | 24 int16_t nbits = WebRtcSpl_GetSizeInBits(times); local
44 return (t > nbits) ? 0 : nbits - t;
|
| auto_correlation.c | 39 int nbits = WebRtcSpl_GetSizeInBits(in_vector_length); local
43 if (t > nbits) {
46 scaling = nbits - t;
|
| /external/jpeg/ |
| jdhuff.h | 139 #define CHECK_BIT_BUFFER(state,nbits,action) \
140 { if (bits_left < (nbits)) { \
141 if (! jpeg_fill_bit_buffer(&(state),get_buffer,bits_left,nbits)) \
145 #define GET_BITS(nbits) \
146 (((int) (get_buffer >> (bits_left -= (nbits)))) & ((1<<(nbits))-1))
148 #define PEEK_BITS(nbits) \
149 (((int) (get_buffer >> (bits_left - (nbits)))) & ((1<<(nbits))-1))
151 #define DROP_BITS(nbits) \
[all...] |
| jcphuff.c | 298 unsigned int nbits)
303 while (nbits > 0) {
306 nbits--;
318 register int temp, nbits; local
322 nbits = 0;
324 nbits++;
326 if (nbits > 14)
329 emit_symbol(entropy, entropy->ac_tbl_no, nbits << 4);
330 if (nbits)
331 emit_bits(entropy, entropy->EOBRUN, nbits);
381 register int nbits; local
468 register int nbits; local
[all...] |
| jchuff.c | 357 register int nbits; local
372 nbits = 0;
374 nbits++;
380 if (nbits > MAX_COEF_BITS+1)
384 if (! emit_bits(state, dctbl->ehufco[nbits], dctbl->ehufsi[nbits]))
389 if (nbits) /* emit_bits rejects calls with size 0 */
390 if (! emit_bits(state, (unsigned int) temp2, nbits))
416 nbits = 1; /* there must be at least one 1 bit */
418 nbits++
576 register int nbits; local
[all...] |
| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| prefix.cc | 25 // [offset, offset + 2^nbits)
28 int nbits; member in struct:brotli::PrefixCodeRange
74 if (length >= range.offset && length < range.offset + (1 << range.nbits)) {
84 if (length >= range.offset && length < range.offset + (1 << range.nbits)) {
104 return kInsertLengthPrefixCode[insert_code].nbits;
114 return kCopyLengthPrefixCode[copy_code].nbits;
126 int* nbits,
131 *nbits = 0;
142 *nbits = bucket - postfix_bits;
144 ((2 * (*nbits - 1) + prefix) << postfix_bits) + postfix
[all...] |
| prefix.h | 42 int* nbits,
|
| /external/chromium_org/media/formats/mp2t/ |
| timestamp_unroller.cc | 22 const int nbits = 33; local
24 // |timestamp| has a precision of |nbits|
26 DCHECK_EQ((timestamp >> nbits), 0);
52 (previous_unrolled_timestamp_ >> nbits);
53 int64 time0 = ((previous_unrolled_time_high - 1) << nbits) | timestamp;
54 int64 time1 = ((previous_unrolled_time_high + 0) << nbits) | timestamp;
55 int64 time2 = ((previous_unrolled_time_high + 1) << nbits) | timestamp;
|
| ts_section_psi.cc | 17 int nbits = 8; local
19 data_msb_aligned <<= (32 - nbits);
21 while (nbits > 0) {
30 nbits--;
|
| timestamp_unroller_unittest.cc | 18 const int nbits = 33; local
19 int64 truncate_mask = (GG_INT64_C(1) << nbits) - 1;
|
| /external/chromium_org/third_party/libjpeg_turbo/ |
| jdhuff.h | 153 #define CHECK_BIT_BUFFER(state,nbits,action) \
154 { if (bits_left < (nbits)) { \
155 if (! jpeg_fill_bit_buffer(&(state),get_buffer,bits_left,nbits)) \
159 #define GET_BITS(nbits) \
160 (((int) (get_buffer >> (bits_left -= (nbits)))) & ((1<<(nbits))-1))
162 #define PEEK_BITS(nbits) \
163 (((int) (get_buffer >> (bits_left - (nbits)))) & ((1<<(nbits))-1))
165 #define DROP_BITS(nbits) \
[all...] |
| jcphuff.c | 296 unsigned int nbits)
301 while (nbits > 0) {
304 nbits--;
316 register int temp, nbits; local
320 nbits = 0;
322 nbits++;
324 if (nbits > 14)
327 emit_symbol(entropy, entropy->ac_tbl_no, nbits << 4);
328 if (nbits)
329 emit_bits(entropy, entropy->EOBRUN, nbits);
379 register int nbits; local
466 register int nbits; local
[all...] |
| /external/chromium_org/third_party/opus/src/celt/ |
| entcode.c | 66 opus_uint32 nbits; local
82 nbits=_this->nbits_total<<BITRES;
92 return nbits-l;
|
| /external/libopus/celt/ |
| entcode.c | 66 opus_uint32 nbits; local
82 nbits=_this->nbits_total<<BITRES;
92 return nbits-l;
|
| /bionic/libc/upstream-openbsd/lib/libc/gdtoa/ |
| gethex.c | 48 int big, esign, havedig, irv, j, k, n, n0, nbits, up, zret; local
189 nbits = fpi->nbits;
190 n0 = n = nbits >> kshift;
191 if (nbits & kmask)
201 b->x[j] = ULbits >> (ULbits - (nbits & kmask));
238 nbits = fpi->nbits;
241 if (n > nbits) {
242 n -= nbits;
[all...] |
| hexnan.c | 62 int havedig, hd0, i, nbits; local
66 nbits = fpi->nbits;
67 x = x0 + (nbits >> kshift);
68 if (nbits & kmask)
138 if ( (i = nbits & (ULbits-1)) !=0)
|
| /external/chromium_org/third_party/smhasher/src/ |
| Bitvec.cpp | 196 int nbits = len*8; local
198 for(int i = nbits-1; i >= 0; i--)
276 int nbits = len*8; local
278 for(int i = 0; i < nbits; i++)
355 int nbits = len * 8; local
359 uint32_t bit = getbit(blob,len,nbits-1);
450 int nbits = len * 8; local
458 setbit(blob,len,nbits-1,bit);
549 int nbits = len*8; local
550 start %= nbits;
564 int nbits = len*8; local
596 int nbits = len*8; local
631 int nbits = 64; local
718 int nbits = 64; local
[all...] |
| /external/aac/libAACdec/src/ |
| channelinfo.cpp | 104 int nbits; local
107 nbits = 6;
110 nbits = 4;
113 pIcsInfo->MaxSfBands = (UCHAR) FDKreadBits(bs, nbits);
|
| /external/openssl/crypto/dsa/ |
| dsa_pmeth.c | 72 int nbits; /* size of p in bits (default: 1024) */ member in struct:__anon7750
87 dctx->nbits = 1024;
106 dctx->nbits = sctx->nbits;
167 dctx->nbits = p1;
222 int nbits; local
223 nbits = atoi(value);
224 return EVP_PKEY_CTX_set_dsa_paramgen_bits(ctx, nbits);
257 ret = dsa_builtin_paramgen(dsa, dctx->nbits, dctx->qbits, dctx->pmd,
|
