Lines Matching refs:pos_state
40 #define len_decode(target, ld, pos_state, seq) \
45 probs = ld.low[pos_state];\
53 probs = ld.mid[pos_state]; \
117 #define len_decode(target, ld, pos_state, seq) \
123 rc_bit_case(ld.low[pos_state][symbol], , , seq ## _LOW0); \
124 rc_bit_case(ld.low[pos_state][symbol], , , seq ## _LOW1); \
125 rc_bit_case(ld.low[pos_state][symbol], , , seq ## _LOW2); \
132 rc_bit_case(ld.mid[pos_state][symbol], , , \
134 rc_bit_case(ld.mid[pos_state][symbol], , , \
136 rc_bit_case(ld.mid[pos_state][symbol], , , \
342 uint32_t pos_state = dict.pos & pos_mask;
357 // Calculate new pos_state. This is skipped on the first loop
360 pos_state = dict.pos & pos_mask;
367 rc_if_0(coder->is_match[state][pos_state], SEQ_IS_MATCH) {
368 rc_update_0(coder->is_match[state][pos_state]);
497 rc_update_1(coder->is_match[state][pos_state]);
513 pos_state, SEQ_MATCH_LEN);
709 rc_if_0(coder->is_rep0_long[state][pos_state],
712 state][pos_state]);
729 state][pos_state]);
776 pos_state, SEQ_REP_LEN);
915 for (uint32_t pos_state = 0; pos_state < num_pos_states; ++pos_state) {
916 bittree_reset(coder->match_len_decoder.low[pos_state],
918 bittree_reset(coder->match_len_decoder.mid[pos_state],
921 bittree_reset(coder->rep_len_decoder.low[pos_state],
923 bittree_reset(coder->rep_len_decoder.mid[pos_state],