Searched refs:nbits (Results 1 - 25 of 143) sorted by relevance

123456

/external/puffin/src/
H A Dbit_reader.cc11 bool BufferBitReader::CacheBits(size_t nbits) { argument
12 if ((in_size_ - index_) * 8 + in_cache_bits_ < nbits) {
15 if (nbits > sizeof(in_cache_) * 8) {
18 while (in_cache_bits_ < nbits) {
25 uint32_t BufferBitReader::ReadBits(size_t nbits) { argument
26 return in_cache_ & ((1U << nbits) - 1);
29 void BufferBitReader::DropBits(size_t nbits) { argument
30 in_cache_ >>= nbits; local
31 in_cache_bits_ -= nbits;
39 size_t nbits local
40 in_cache_ >>= nbits; local
[all...]
H A Dbit_writer.cc13 bool BufferBitWriter::WriteBits(size_t nbits, uint32_t bits) { argument
14 TEST_AND_RETURN_FALSE(((out_size_ - index_) * 8) - out_holder_bits_ >= nbits);
15 TEST_AND_RETURN_FALSE(nbits <= sizeof(bits) * 8);
16 while (nbits > 0) {
22 while (out_holder_bits_ < 24 && nbits > 0) {
24 auto min = std::min(nbits, static_cast<size_t>(8));
27 nbits -= min;
H A Dbit_reader.h23 // Caches at least |nbits| starting from the next available bit (next bit that
27 // |nbits| IN The number of bits to see if available in the input.
28 virtual bool CacheBits(size_t nbits) = 0;
30 // Reads |nbits| from the cached input. Users should call |CacheBits| with
31 // greater than or equal to |nbits| bits before calling this function.
33 // |nbits| IN The number of bits to read from the cache.
35 virtual uint32_t ReadBits(size_t nbits) = 0;
37 // Drops |nbits| from the input cache. Users should be careful that |nbits|
40 // |nbits| I
[all...]
H A Dhuffman_table.h79 // |nbits| OUT The number of bits in the Huffman code of alphabet.
81 inline bool CodeAlphabet(uint32_t bits, uint16_t* alphabet, size_t* nbits) { argument
85 *nbits = code_lens_[*alphabet];
94 // |nbits| OUT The number of bits in the Huffman code of the |alphabet|.
96 inline bool LitLenAlphabet(uint32_t bits, uint16_t* alphabet, size_t* nbits) { argument
100 *nbits = lit_len_lens_[*alphabet];
109 // |nbits| OUT The number of bits in the Huffman code of the |alphabet|.
113 size_t* nbits) {
117 *nbits = distance_lens_[*alphabet];
125 // |nbits| OU
111 DistanceAlphabet(uint32_t bits, uint16_t* alphabet, size_t* nbits) argument
127 CodeHuffman(uint16_t alphabet, uint16_t* huffman, size_t* nbits) argument
[all...]
/external/syslinux/com32/libutil/
H A Dunbase64.c43 int nbits = 0; local
64 nbits += 6;
65 if (nbits >= 8) {
67 *buffer++ = (bits >> (nbits - 8));
69 nbits -= 8;
/external/python/cpython2/Parser/
H A Dbitset.c8 newbitset(int nbits) argument
10 int nbytes = NBYTES(nbits);
49 samebitset(bitset ss1, bitset ss2, int nbits) argument
53 for (i = NBYTES(nbits); --i >= 0; )
60 mergebitset(bitset ss1, bitset ss2, int nbits) argument
64 for (i = NBYTES(nbits); --i >= 0; )
/external/python/cpython3/Parser/
H A Dbitset.c8 newbitset(int nbits) argument
10 int nbytes = NBYTES(nbits);
49 samebitset(bitset ss1, bitset ss2, int nbits) argument
53 for (i = NBYTES(nbits); --i >= 0; )
60 mergebitset(bitset ss1, bitset ss2, int nbits) argument
64 for (i = NBYTES(nbits); --i >= 0; )
/external/fec/
H A Dviterbi27.c82 unsigned int nbits, /* Number of data bits */
88 return chainback_viterbi27_port(p,data,nbits,endstate);
91 return chainback_viterbi27_av(p,data,nbits,endstate);
95 return chainback_viterbi27_mmx(p,data,nbits,endstate);
97 return chainback_viterbi27_sse(p,data,nbits,endstate);
99 return chainback_viterbi27_sse2(p,data,nbits,endstate);
131 * Note that nbits is the number of decoded data bits, not the number
134 int update_viterbi27_blk(void *p,unsigned char syms[],int nbits){ argument
141 update_viterbi27_blk_port(p,syms,nbits);
145 update_viterbi27_blk_av(p,syms,nbits);
79 chainback_viterbi27( void *p, unsigned char *data, unsigned int nbits, unsigned int endstate) argument
[all...]
H A Dviterbi29.c82 unsigned int nbits, /* Number of data bits */
88 return chainback_viterbi29_port(p,data,nbits,endstate);
91 return chainback_viterbi29_av(p,data,nbits,endstate);
95 return chainback_viterbi29_mmx(p,data,nbits,endstate);
97 return chainback_viterbi29_sse(p,data,nbits,endstate);
99 return chainback_viterbi29_sse2(p,data,nbits,endstate);
131 * Note that nbits is the number of decoded data bits, not the number
134 int update_viterbi29_blk(void *p,unsigned char syms[],int nbits){ argument
138 return update_viterbi29_blk_port(p,syms,nbits);
141 return update_viterbi29_blk_av(p,syms,nbits);
79 chainback_viterbi29( void *p, unsigned char *data, unsigned int nbits, unsigned int endstate) argument
[all...]
H A Dviterbi39.c83 unsigned int nbits, /* Number of data bits */
89 return chainback_viterbi39_port(p,data,nbits,endstate);
92 return chainback_viterbi39_av(p,data,nbits,endstate);
96 return chainback_viterbi39_mmx(p,data,nbits,endstate);
98 return chainback_viterbi39_sse(p,data,nbits,endstate);
100 return chainback_viterbi39_sse2(p,data,nbits,endstate);
132 * Note that nbits is the number of decoded data bits, not the number
135 int update_viterbi39_blk(void *p,unsigned char syms[],int nbits){ argument
139 return update_viterbi39_blk_port(p,syms,nbits);
142 return update_viterbi39_blk_av(p,syms,nbits);
80 chainback_viterbi39( void *p, unsigned char *data, unsigned int nbits, unsigned int endstate) argument
[all...]
H A Dviterbi615.c84 unsigned int nbits, /* Number of data bits */
90 return chainback_viterbi615_port(p,data,nbits,endstate);
93 return chainback_viterbi615_av(p,data,nbits,endstate);
97 return chainback_viterbi615_mmx(p,data,nbits,endstate);
99 return chainback_viterbi615_sse(p,data,nbits,endstate);
101 return chainback_viterbi615_sse2(p,data,nbits,endstate);
133 * Note that nbits is the number of decoded data bits, not the number
136 int update_viterbi615_blk(void *p,unsigned char syms[],int nbits){ argument
140 return update_viterbi615_blk_port(p,syms,nbits);
143 return update_viterbi615_blk_av(p,syms,nbits);
81 chainback_viterbi615( void *p, unsigned char *data, unsigned int nbits, unsigned int endstate) argument
[all...]
H A Dfec.h20 int chainback_viterbi27(void *vp, unsigned char *data,unsigned int nbits,unsigned int endstate);
27 int chainback_viterbi27_av(void *p,unsigned char *data,unsigned int nbits,unsigned int endstate);
29 int update_viterbi27_blk_av(void *p,unsigned char *syms,int nbits);
36 int chainback_viterbi27_mmx(void *p,unsigned char *data,unsigned int nbits,unsigned int endstate);
38 int update_viterbi27_blk_mmx(void *p,unsigned char *syms,int nbits);
43 int chainback_viterbi27_sse(void *p,unsigned char *data,unsigned int nbits,unsigned int endstate);
45 int update_viterbi27_blk_sse(void *p,unsigned char *syms,int nbits);
50 int chainback_viterbi27_sse2(void *p,unsigned char *data,unsigned int nbits,unsigned int endstate);
52 int update_viterbi27_blk_sse2(void *p,unsigned char *syms,int nbits);
58 int chainback_viterbi27_port(void *p,unsigned char *data,unsigned int nbits,unsigne
[all...]
/external/jemalloc/src/
H A Dbitmap.c9 bitmap_info_init(bitmap_info_t *binfo, size_t nbits) argument
14 assert(nbits > 0);
15 assert(nbits <= (ZU(1) << LG_BITMAP_MAXBITS));
18 * Compute the number of groups necessary to store nbits bits, and
23 group_count = BITMAP_BITS2GROUPS(nbits);
34 binfo->nbits = nbits;
58 extra = (BITMAP_GROUP_NBITS - (binfo->nbits & BITMAP_GROUP_NBITS_MASK))
75 bitmap_info_init(bitmap_info_t *binfo, size_t nbits) argument
78 assert(nbits >
[all...]
/external/python/cpython2/Include/
H A Dbitset.h14 bitset newbitset(int nbits);
18 int samebitset(bitset bs1, bitset bs2, int nbits);
19 void mergebitset(bitset bs1, bitset bs2, int nbits);
22 #define NBYTES(nbits) (((nbits) + BITSPERBYTE - 1) / BITSPERBYTE)
/external/python/cpython3/Include/
H A Dbitset.h14 bitset newbitset(int nbits);
18 int samebitset(bitset bs1, bitset bs2, int nbits);
19 void mergebitset(bitset bs1, bitset bs2, int nbits);
22 #define NBYTES(nbits) (((nbits) + BITSPERBYTE - 1) / BITSPERBYTE)
/external/libldac/src/
H A Dbitalloc_sub_ldac.c25 int nbits; local
27 nbits = LDAC_NBANDBITS + LDAC_FLAGBITS;
29 return nbits;
38 int nbits; local
41 nbits = LDAC_GRADMODEBITS + LDAC_GRADQU0BITS*2 + LDAC_GRADOSBITS*2 + LDAC_NADJQUBITS;
44 nbits = LDAC_GRADMODEBITS + LDAC_GRADQU1BITS + LDAC_GRADOSBITS + LDAC_NADJQUBITS;
47 return nbits;
58 int id, nbits; local
61 nbits = p_nbits[0];
64 if (nbits > p_nbit
93 int nbits = LDAC_MAXBITNUM; local
146 int nbits = LDAC_MAXBITNUM; local
198 int nbits, bitlen, vmax, val; local
234 int nbits, sfc_mode; local
265 int nbits, nbits_band, nbits_grad, nbits_scfc = 0; local
[all...]
/external/webrtc/webrtc/common_audio/signal_processing/
H A Dget_scaling_square.c24 int16_t nbits = WebRtcSpl_GetSizeInBits((uint32_t)times); local
44 return (t > nbits) ? 0 : nbits - t;
/external/jemalloc/include/jemalloc/internal/
H A Dbitmap.h28 #define BITMAP_BITS2GROUPS(nbits) \
29 ((nbits + BITMAP_GROUP_NBITS_MASK) >> LG_BITMAP_GROUP_NBITS)
34 #define BITMAP_GROUPS_L0(nbits) \
35 BITMAP_BITS2GROUPS(nbits)
36 #define BITMAP_GROUPS_L1(nbits) \
37 BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(nbits))
38 #define BITMAP_GROUPS_L2(nbits) \
39 BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS(BITMAP_BITS2GROUPS((nbits))))
40 #define BITMAP_GROUPS_L3(nbits) \
42 BITMAP_BITS2GROUPS((nbits)))))
96 size_t nbits; member in struct:bitmap_info_s
[all...]
/external/brotli/c/enc/
H A Dprefix.h41 size_t nbits = bucket - postfix_bits; local
44 ((2 * (nbits - 1) + prefix) << postfix_bits) + postfix));
46 (nbits << 24) | ((dist - offset) >> postfix_bits));
H A Dcommand.h35 uint32_t nbits = Log2FloorNonZero(insertlen - 2) - 1u; local
36 return (uint16_t)((nbits << 1) + ((insertlen - 2) >> nbits) + 2);
52 uint32_t nbits = Log2FloorNonZero(copylen - 6) - 1u; local
53 return (uint16_t)((nbits << 1) + ((copylen - 6) >> nbits) + 4);
144 uint32_t nbits = self->dist_extra_ >> 24; local
148 BROTLI_NUM_DISTANCE_SHORT_CODES + 2 * (nbits - 1) + prefix_bit
151 self->dist_prefix_ + 4u - BROTLI_NUM_DISTANCE_SHORT_CODES - 2u * nbits;
154 return (prefix << nbits)
[all...]
/external/libjpeg-turbo/
H A Djdhuff.h152 #define CHECK_BIT_BUFFER(state,nbits,action) \
153 { if (bits_left < (nbits)) { \
154 if (! jpeg_fill_bit_buffer(&(state),get_buffer,bits_left,nbits)) \
158 #define GET_BITS(nbits) \
159 (((int) (get_buffer >> (bits_left -= (nbits)))) & ((1<<(nbits))-1))
161 #define PEEK_BITS(nbits) \
162 (((int) (get_buffer >> (bits_left - (nbits)))) & ((1<<(nbits))-1))
164 #define DROP_BITS(nbits) \
[all...]
/external/aac/libAACdec/src/
H A Dusacdec_ace_d4t64.h115 void D_ACELP_decode_4t64(SHORT index[], int nbits, FIXP_COD code[]);
/external/pdfium/core/fxcrt/
H A Dfx_extension.cpp125 uint32_t GetBits32(const uint8_t* pData, int bitpos, int nbits) { argument
126 ASSERT(0 < nbits && nbits <= 32);
132 if (nbits < 8 && nbits + bitCount <= 8) {
133 bitShift = 8 - nbits - bitCount;
134 bitMask = (1 << nbits) - 1;
139 bitMask = (1 << std::min(bitOffset, nbits)) - 1;
140 dstShift = nbits - bitOffset;
H A Dfx_extension_unittest.cpp10 uint32_t ReferenceGetBits32(const uint8_t* pData, int bitpos, int nbits) { argument
12 for (int i = 0; i < nbits; i++) {
14 result |= 1 << (nbits - i - 1);
108 for (int nbits = 1; nbits <= 32; ++nbits) {
109 for (int bitpos = 0; bitpos < (int)sizeof(data) * 8 - nbits; ++bitpos) {
110 EXPECT_EQ(ReferenceGetBits32(data, bitpos, nbits),
111 GetBits32(data, bitpos, nbits));
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/framed/
H A DHuffman.java96 int nbits = CODE_LENGTHS[b];
98 current <<= nbits;
100 n += nbits;
130 int nbits = 0;
134 nbits += 8;
135 while (nbits >= 8) {
136 int c = (current >>> (nbits - 8)) & 0xFF;
141 nbits -= node.terminalBits;
145 nbits -= 8;
150 while (nbits >
[all...]

Completed in 1426 milliseconds

123456