Searched refs:next_bit (Results 1 – 6 of 6) sorted by relevance
94 int next_bit = bit << 1; // 2^(w+1), at most 256 in ec_compute_wNAF() local95 int mask = next_bit - 1; // at most 255 in ec_compute_wNAF()99 assert(0 <= window_val && window_val <= next_bit); in ec_compute_wNAF()102 assert(0 < window_val && window_val < next_bit); in ec_compute_wNAF()104 digit = window_val - next_bit; in ec_compute_wNAF()128 assert(window_val == 0 || window_val == next_bit || window_val == bit); in ec_compute_wNAF()143 assert(window_val <= next_bit); in ec_compute_wNAF()
108 for (int32_t next_bit = current - beginning; in CompareCMapIterAndBitSet() local110 next_bit = current - init_beginning) { in CompareCMapIterAndBitSet()112 EXPECT_TRUE(c <= next_bit || current == end); in CompareCMapIterAndBitSet()113 if (!(c <= next_bit || current == end)) in CompareCMapIterAndBitSet()115 if (c == next_bit) { in CompareCMapIterAndBitSet()
208 unsigned int next_bit = global_bit_shift + 1; in compile() local223 if (!info->max_value || next_bit + bits_needed > 8 * sizeof (hb_mask_t)) in compile()270 map->shift = next_bit; in compile()271 map->mask = (1u << (next_bit + bits_needed)) - (1u << next_bit); in compile()272 next_bit += bits_needed; in compile()
236 ULONG next_bit; in huff_read() local237 next_bit = FDKreadBits(strm, 1); in huff_read()239 node = (*nodeTab)[node][next_bit]; in huff_read()
421 UWORD32 next_bit = 0; in ixheaacd_mps_huff_read() local424 next_bit = ixheaacd_read_bits_buf(it_bit_buff, 1); in ixheaacd_mps_huff_read()425 node = (*node_tab)[node][next_bit]; in ixheaacd_mps_huff_read()