liblzma/lzma/lzma_encoder.c

78 length_update_prices(lzma_length_encoder *lc, const uint32_t pos_state)
81 	lc->counters[pos_state] = table_size;
87 	uint32_t *const prices = lc->prices[pos_state];
91 		prices[i] = a0 + rc_bittree_price(lc->low[pos_state],
95 		prices[i] = b0 + rc_bittree_price(lc->mid[pos_state],
108 		const uint32_t pos_state, uint32_t len, const bool fast_mode)
115 		rc_bittree(rc, lc->low[pos_state], LEN_LOW_BITS, len);
122 			rc_bittree(rc, lc->mid[pos_state], LEN_MID_BITS, len);
133 		if (--lc->counters[pos_state] == 0)
134 			length_update_prices(lc, pos_state);
143 match(lzma_lzma1_encoder *coder, const uint32_t pos_state,
148 	length(&coder->rc, &coder->match_len_encoder, pos_state, len,
190 rep_match(lzma_lzma1_encoder *coder, const uint32_t pos_state,
196 				&coder->is_rep0_long[coder->state][pos_state],
222 		length(&coder->rc, &coder->rep_len_encoder, pos_state, len,
237 	const uint32_t pos_state = position & coder->pos_mask;
243 				&coder->is_match[coder->state][pos_state], 0);
248 			&coder->is_match[coder->state][pos_state], 1);
254 			rep_match(coder, pos_state, back, len);
258 			match(coder, pos_state, back - REPS, len);
298 	const uint32_t pos_state = position & coder->pos_mask;
299 	rc_bit(&coder->rc, &coder->is_match[coder->state][pos_state], 1);
301 	match(coder, pos_state, UINT32_MAX, MATCH_LEN_MIN);
459 	for (size_t pos_state = 0; pos_state < num_pos_states; ++pos_state) {
460 		bittree_reset(lencoder->low[pos_state], LEN_LOW_BITS);
461 		bittree_reset(lencoder->mid[pos_state], LEN_MID_BITS);
467 		for (uint32_t pos_state = 0; pos_state < num_pos_states;
468 				++pos_state)
469 			length_update_prices(lencoder, pos_state);