Searched defs:nbits (Results 1 - 25 of 69) sorted by relevance

123

/external/chromium_org/tools/android/memdump/
H A Dmemdump.cc38 void resize(size_t nbits) { argument
39 data_.resize((nbits + 7) / 8);
/external/chromium_org/third_party/brotli/src/brotli/dec/
H A Dprefix.h23 /* [offset, offset + 2^nbits) */
26 int nbits; member in struct:PrefixCodeRange
/external/aac/libAACdec/src/
H A Dchannelinfo.cpp104 int nbits; local
107 nbits = 6;
110 nbits = 4;
113 pIcsInfo->MaxSfBands = (UCHAR) FDKreadBits(bs, nbits);
/external/chromium_org/media/formats/mp2t/
H A Dtimestamp_unroller_unittest.cc18 const int nbits = 33; local
19 int64 truncate_mask = (GG_INT64_C(1) << nbits) - 1;
H A Dtimestamp_unroller.cc22 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;
H A Dts_section_psi.cc17 int nbits = 8; local
19 data_msb_aligned <<= (32 - nbits);
21 while (nbits > 0) {
30 nbits--;
/external/chromium_org/third_party/opus/src/celt/
H A Dentcode.c66 opus_uint32 nbits; local
82 nbits=_this->nbits_total<<BITRES;
92 return nbits-l;
/external/chromium_org/third_party/webrtc/common_audio/signal_processing/
H A Dauto_correlation.c39 int nbits = WebRtcSpl_GetSizeInBits(in_vector_length); local
43 if (t > nbits) {
46 scaling = nbits - t;
H A Dget_scaling_square.c24 int16_t nbits = WebRtcSpl_GetSizeInBits(times); local
44 return (t > nbits) ? 0 : nbits - t;
/external/jemalloc/src/
H A Dbitmap.c7 static size_t bits2groups(size_t nbits);
12 bits2groups(size_t nbits) argument
15 return ((nbits >> LG_BITMAP_GROUP_NBITS) +
16 !!(nbits & BITMAP_GROUP_NBITS_MASK));
20 bitmap_info_init(bitmap_info_t *binfo, size_t nbits) argument
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
55 bitmap_size(size_t nbits) argument
[all...]
/external/libopus/celt/
H A Dentcode.c66 opus_uint32 nbits; local
82 nbits=_this->nbits_total<<BITRES;
92 return nbits-l;
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/include/linux/
H A Dbitmap.h11 #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) argument
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) argument
37 bitmap_or(unsigned long *dst, const unsigned long *src1, const unsigned long *src2, int nbits) argument
[all...]
/external/webrtc/src/common_audio/signal_processing/
H A Dget_scaling_square.c22 int nbits = WebRtcSpl_GetSizeInBits(times); local
42 return (t > nbits) ? 0 : nbits - t;
H A Dauto_correlation.c53 int nbits = WebRtcSpl_GetSizeInBits(in_vector_length); // # of bits in the sum loop local
56 if (t > nbits)
61 scaling = nbits - t;
/external/bison/src/
H A DSbitset.c26 Sbitset__new (Sbitset__Index nbits) argument
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) argument
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) argument
55 Sbitset last = self + Sbitset__nbytes (nbits)
63 Sbitset__fprint(Sbitset self, Sbitset__Index nbits, FILE *file) argument
[all...]
/external/chromium_org/third_party/boringssl/src/crypto/modes/
H A Dcfb.c153 /* This expects a single block of size nbits for both in and out. Note that
155 static void cfbr_encrypt_block(const uint8_t *in, uint8_t *out, unsigned nbits, argument
162 if (nbits <= 0 || nbits > 128) {
170 num = (nbits + 7) / 8;
183 rem = nbits % 8;
184 num = nbits / 8;
/external/chromium_org/third_party/brotli/src/brotli/enc/
H A Dbit_cost.h32 int nbits = 0; local
34 nbits += counts[i] * (depth[i] + kHuffmanExtraBits[i]);
36 return nbits;
H A Dprefix.cc25 // [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
122 PrefixEncodeCopyDistance(int distance_code, int num_direct_codes, int postfix_bits, uint16_t* code, int* nbits, uint32_t* extra_bits) argument
[all...]
/external/openssl/crypto/modes/
H A Dcfb128.c173 /* This expects a single block of size nbits for both in and out. Note that
176 int nbits,const void *key,
183 if (nbits<=0 || nbits>128) return;
189 num = (nbits+7)/8;
197 rem = nbits%8;
198 num = nbits/8;
175 cfbr_encrypt_block(const unsigned char *in,unsigned char *out, int nbits,const void *key, unsigned char ivec[16],int enc, block128_f block) argument
/external/qemu/include/qemu/
H A Dbitmap.h22 * Note that nbits should be always a compile time evaluable constant.
25 * bitmap_zero(dst, nbits) *dst = 0UL
26 * bitmap_fill(dst, nbits) *dst = ~0UL
27 * bitmap_copy(dst, src, nbits) *dst = *src
28 * bitmap_and(dst, src1, src2, nbits) *dst = *src1 & *src2
29 * bitmap_or(dst, src1, src2, nbits) *dst = *src1 | *src2
30 * bitmap_xor(dst, src1, src2, nbits) *dst = *src1 ^ *src2
31 * bitmap_andnot(dst, src1, src2, nbits) *dst = *src1 & ~(*src2)
32 * bitmap_complement(dst, src, nbits) *dst = ~(*src)
33 * bitmap_equal(src1, src2, nbits) Ar
91 bitmap_new(int nbits) argument
97 bitmap_zero(unsigned long *dst, int nbits) argument
107 bitmap_fill(unsigned long *dst, int nbits) argument
117 bitmap_copy(unsigned long *dst, const unsigned long *src, int nbits) argument
128 bitmap_and(unsigned long *dst, const unsigned long *src1, const unsigned long *src2, int nbits) argument
137 bitmap_or(unsigned long *dst, const unsigned long *src1, const unsigned long *src2, int nbits) argument
147 bitmap_xor(unsigned long *dst, const unsigned long *src1, const unsigned long *src2, int nbits) argument
157 bitmap_andnot(unsigned long *dst, const unsigned long *src1, const unsigned long *src2, int nbits) argument
166 bitmap_complement(unsigned long *dst, const unsigned long *src, int nbits) argument
176 bitmap_equal(const unsigned long *src1, const unsigned long *src2, int nbits) argument
186 bitmap_empty(const unsigned long *src, int nbits) argument
195 bitmap_full(const unsigned long *src, int nbits) argument
204 bitmap_intersects(const unsigned long *src1, const unsigned long *src2, int nbits) argument
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
H A DBitSet.cs54 * We will often need to do a mod operator (i mod nbits). Its
56 * same as (i & (nbits-1)). Since mod is slow, we use a
83 * <param name="nbits">The size of the bitset in bits</param>
85 public BitSet(int nbits) { argument
86 _bits = new ulong[((nbits - 1) >> LOG_BITS) + 1];
/external/chromium_org/third_party/opus/src/celt/tests/
H A Dtest_unit_entropy.c55 long nbits; local
93 nbits=ec_tell(&enc);
96 if(nbits2-nbits!=ftb){
98 nbits2-nbits,ftb);
103 nbits=ec_tell_frac(&enc);
107 entropy,ldexp(nbits,-3),100*(nbits-ldexp(entropy,3))/nbits);
129 if(nbits!=nbits2){
132 ldexp(nbits2,-3),ldexp(nbits,
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Drw_bitmaps.c35 unsigned int nbits; local
84 nbits = EXT2FS_NUM_B2C(fs,
88 if (nbits)
89 for (j = nbits; j < fs->blocksize * 8; j++)
/external/jemalloc/include/jemalloc/internal/
H A Dbitmap.h33 size_t nbits; member in struct:bitmap_info_s
35 /* Number of levels necessary for nbits. */
49 void bitmap_info_init(bitmap_info_t *binfo, size_t nbits);
51 size_t bitmap_size(size_t nbits);
82 assert(bit < binfo->nbits);
95 assert(bit < binfo->nbits);
152 assert(bit < binfo->nbits);
/external/libopus/celt/tests/
H A Dtest_unit_entropy.c55 long nbits; local
93 nbits=ec_tell(&enc);
96 if(nbits2-nbits!=ftb){
98 nbits2-nbits,ftb);
103 nbits=ec_tell_frac(&enc);
107 entropy,ldexp(nbits,-3),100*(nbits-ldexp(entropy,3))/nbits);
129 if(nbits!=nbits2){
132 ldexp(nbits2,-3),ldexp(nbits,
[all...]

Completed in 6569 milliseconds

123