Searched refs:remaining_bits (Results 1 - 7 of 7) sorted by last modified time
/external/mesa3d/src/mapi/glapi/gen/ |
H A D | glX_server_table.py | 94 remaining_bits = self.max_bits - total 95 next_opcode = min_opcode + (1 << remaining_bits) 98 for M in range(0, remaining_bits): 99 op_count = 1 << (remaining_bits - M); 126 # case when M is 0 or remaining_bits, the node is a leaf. 128 if (M == 0) or (M == remaining_bits): 129 return [remaining_bits, [], 0, 0] 151 return [remaining_bits, [], 0, 0] 165 def dump_tree(self, node, base_opcode, remaining_bits, base_entry, depth): 168 child_M = remaining_bits [all...] |
/external/libopus/celt/ |
H A D | bands.c | 647 opus_int32 remaining_bits; member in struct:band_ctx 794 if (*b>2<<BITRES && ctx->remaining_bits > 2<<BITRES) 854 if (ctx->remaining_bits>=1<<BITRES) 863 ctx->remaining_bits -= 1<<BITRES; 954 ctx->remaining_bits -= qalloc; 959 rebalance = ctx->remaining_bits; 965 rebalance = mbits - (rebalance-ctx->remaining_bits); 975 rebalance = sbits - (rebalance-ctx->remaining_bits); 986 ctx->remaining_bits -= curr_bits; 989 while (ctx->remaining_bits < 1361 opus_int32 remaining_bits; local [all...] |
/external/chromium_org/third_party/opus/src/celt/ |
H A D | bands.c | 647 opus_int32 remaining_bits; member in struct:band_ctx 794 if (*b>2<<BITRES && ctx->remaining_bits > 2<<BITRES) 854 if (ctx->remaining_bits>=1<<BITRES) 863 ctx->remaining_bits -= 1<<BITRES; 954 ctx->remaining_bits -= qalloc; 959 rebalance = ctx->remaining_bits; 965 rebalance = mbits - (rebalance-ctx->remaining_bits); 975 rebalance = sbits - (rebalance-ctx->remaining_bits); 986 ctx->remaining_bits -= curr_bits; 989 while (ctx->remaining_bits < 1361 opus_int32 remaining_bits; local [all...] |
/external/chromium_org/third_party/mesa/src/src/mapi/glapi/gen/ |
H A D | glX_server_table.py | 94 remaining_bits = self.max_bits - total 95 next_opcode = min_opcode + (1 << remaining_bits) 98 for M in range(0, remaining_bits): 99 op_count = 1 << (remaining_bits - M); 126 # case when M is 0 or remaining_bits, the node is a leaf. 128 if (M == 0) or (M == remaining_bits): 129 return [remaining_bits, [], 0, 0] 151 return [remaining_bits, [], 0, 0] 165 def dump_tree(self, node, base_opcode, remaining_bits, base_entry, depth): 168 child_M = remaining_bits [all...] |
/external/chromium_org/net/base/ |
H A D | net_util.cc | 158 int remaining_bits = prefix_length_in_bits % 8; local 159 if (remaining_bits != 0) { 160 unsigned char mask = 0xFF << (8 - remaining_bits);
|
/external/chromium_org/media/base/ |
H A D | bit_reader_core.cc | 68 const int remaining_bits = nbits_ + nbits_next_; local 69 if (remaining_bits >= num_bits) 73 num_bits -= remaining_bits; 74 bits_read_ += remaining_bits;
|
/external/chromium-libpac/src/ |
H A D | net_util.cc | 118 int remaining_bits = prefix_length_in_bits % 8; local 119 if (remaining_bits != 0) { 120 unsigned char mask = 0xFF << (8 - remaining_bits);
|
Completed in 314 milliseconds