xref: /dflybsd-src/contrib/xz/src/liblzma/rangecoder/range_encoder.h (revision 86d7f5d305c6adaa56ff4582ece9859d73106103)
1*86d7f5d3SJohn Marino ///////////////////////////////////////////////////////////////////////////////
2*86d7f5d3SJohn Marino //
3*86d7f5d3SJohn Marino /// \file       range_encoder.h
4*86d7f5d3SJohn Marino /// \brief      Range Encoder
5*86d7f5d3SJohn Marino ///
6*86d7f5d3SJohn Marino //  Authors:    Igor Pavlov
7*86d7f5d3SJohn Marino //              Lasse Collin
8*86d7f5d3SJohn Marino //
9*86d7f5d3SJohn Marino //  This file has been put into the public domain.
10*86d7f5d3SJohn Marino //  You can do whatever you want with this file.
11*86d7f5d3SJohn Marino //
12*86d7f5d3SJohn Marino ///////////////////////////////////////////////////////////////////////////////
13*86d7f5d3SJohn Marino 
14*86d7f5d3SJohn Marino #ifndef LZMA_RANGE_ENCODER_H
15*86d7f5d3SJohn Marino #define LZMA_RANGE_ENCODER_H
16*86d7f5d3SJohn Marino 
17*86d7f5d3SJohn Marino #include "range_common.h"
18*86d7f5d3SJohn Marino #include "price.h"
19*86d7f5d3SJohn Marino 
20*86d7f5d3SJohn Marino 
21*86d7f5d3SJohn Marino /// Maximum number of symbols that can be put pending into lzma_range_encoder
22*86d7f5d3SJohn Marino /// structure between calls to lzma_rc_encode(). For LZMA, 52+5 is enough
23*86d7f5d3SJohn Marino /// (match with big distance and length followed by range encoder flush).
24*86d7f5d3SJohn Marino #define RC_SYMBOLS_MAX 58
25*86d7f5d3SJohn Marino 
26*86d7f5d3SJohn Marino 
27*86d7f5d3SJohn Marino typedef struct {
28*86d7f5d3SJohn Marino 	uint64_t low;
29*86d7f5d3SJohn Marino 	uint64_t cache_size;
30*86d7f5d3SJohn Marino 	uint32_t range;
31*86d7f5d3SJohn Marino 	uint8_t cache;
32*86d7f5d3SJohn Marino 
33*86d7f5d3SJohn Marino 	/// Number of symbols in the tables
34*86d7f5d3SJohn Marino 	size_t count;
35*86d7f5d3SJohn Marino 
36*86d7f5d3SJohn Marino 	/// rc_encode()'s position in the tables
37*86d7f5d3SJohn Marino 	size_t pos;
38*86d7f5d3SJohn Marino 
39*86d7f5d3SJohn Marino 	/// Symbols to encode
40*86d7f5d3SJohn Marino 	enum {
41*86d7f5d3SJohn Marino 		RC_BIT_0,
42*86d7f5d3SJohn Marino 		RC_BIT_1,
43*86d7f5d3SJohn Marino 		RC_DIRECT_0,
44*86d7f5d3SJohn Marino 		RC_DIRECT_1,
45*86d7f5d3SJohn Marino 		RC_FLUSH,
46*86d7f5d3SJohn Marino 	} symbols[RC_SYMBOLS_MAX];
47*86d7f5d3SJohn Marino 
48*86d7f5d3SJohn Marino 	/// Probabilities associated with RC_BIT_0 or RC_BIT_1
49*86d7f5d3SJohn Marino 	probability *probs[RC_SYMBOLS_MAX];
50*86d7f5d3SJohn Marino 
51*86d7f5d3SJohn Marino } lzma_range_encoder;
52*86d7f5d3SJohn Marino 
53*86d7f5d3SJohn Marino 
54*86d7f5d3SJohn Marino static inline void
rc_reset(lzma_range_encoder * rc)55*86d7f5d3SJohn Marino rc_reset(lzma_range_encoder *rc)
56*86d7f5d3SJohn Marino {
57*86d7f5d3SJohn Marino 	rc->low = 0;
58*86d7f5d3SJohn Marino 	rc->cache_size = 1;
59*86d7f5d3SJohn Marino 	rc->range = UINT32_MAX;
60*86d7f5d3SJohn Marino 	rc->cache = 0;
61*86d7f5d3SJohn Marino 	rc->count = 0;
62*86d7f5d3SJohn Marino 	rc->pos = 0;
63*86d7f5d3SJohn Marino }
64*86d7f5d3SJohn Marino 
65*86d7f5d3SJohn Marino 
66*86d7f5d3SJohn Marino static inline void
rc_bit(lzma_range_encoder * rc,probability * prob,uint32_t bit)67*86d7f5d3SJohn Marino rc_bit(lzma_range_encoder *rc, probability *prob, uint32_t bit)
68*86d7f5d3SJohn Marino {
69*86d7f5d3SJohn Marino 	rc->symbols[rc->count] = bit;
70*86d7f5d3SJohn Marino 	rc->probs[rc->count] = prob;
71*86d7f5d3SJohn Marino 	++rc->count;
72*86d7f5d3SJohn Marino }
73*86d7f5d3SJohn Marino 
74*86d7f5d3SJohn Marino 
75*86d7f5d3SJohn Marino static inline void
rc_bittree(lzma_range_encoder * rc,probability * probs,uint32_t bit_count,uint32_t symbol)76*86d7f5d3SJohn Marino rc_bittree(lzma_range_encoder *rc, probability *probs,
77*86d7f5d3SJohn Marino 		uint32_t bit_count, uint32_t symbol)
78*86d7f5d3SJohn Marino {
79*86d7f5d3SJohn Marino 	uint32_t model_index = 1;
80*86d7f5d3SJohn Marino 
81*86d7f5d3SJohn Marino 	do {
82*86d7f5d3SJohn Marino 		const uint32_t bit = (symbol >> --bit_count) & 1;
83*86d7f5d3SJohn Marino 		rc_bit(rc, &probs[model_index], bit);
84*86d7f5d3SJohn Marino 		model_index = (model_index << 1) + bit;
85*86d7f5d3SJohn Marino 	} while (bit_count != 0);
86*86d7f5d3SJohn Marino }
87*86d7f5d3SJohn Marino 
88*86d7f5d3SJohn Marino 
89*86d7f5d3SJohn Marino static inline void
rc_bittree_reverse(lzma_range_encoder * rc,probability * probs,uint32_t bit_count,uint32_t symbol)90*86d7f5d3SJohn Marino rc_bittree_reverse(lzma_range_encoder *rc, probability *probs,
91*86d7f5d3SJohn Marino 		uint32_t bit_count, uint32_t symbol)
92*86d7f5d3SJohn Marino {
93*86d7f5d3SJohn Marino 	uint32_t model_index = 1;
94*86d7f5d3SJohn Marino 
95*86d7f5d3SJohn Marino 	do {
96*86d7f5d3SJohn Marino 		const uint32_t bit = symbol & 1;
97*86d7f5d3SJohn Marino 		symbol >>= 1;
98*86d7f5d3SJohn Marino 		rc_bit(rc, &probs[model_index], bit);
99*86d7f5d3SJohn Marino 		model_index = (model_index << 1) + bit;
100*86d7f5d3SJohn Marino 	} while (--bit_count != 0);
101*86d7f5d3SJohn Marino }
102*86d7f5d3SJohn Marino 
103*86d7f5d3SJohn Marino 
104*86d7f5d3SJohn Marino static inline void
rc_direct(lzma_range_encoder * rc,uint32_t value,uint32_t bit_count)105*86d7f5d3SJohn Marino rc_direct(lzma_range_encoder *rc,
106*86d7f5d3SJohn Marino 		uint32_t value, uint32_t bit_count)
107*86d7f5d3SJohn Marino {
108*86d7f5d3SJohn Marino 	do {
109*86d7f5d3SJohn Marino 		rc->symbols[rc->count++]
110*86d7f5d3SJohn Marino 				= RC_DIRECT_0 + ((value >> --bit_count) & 1);
111*86d7f5d3SJohn Marino 	} while (bit_count != 0);
112*86d7f5d3SJohn Marino }
113*86d7f5d3SJohn Marino 
114*86d7f5d3SJohn Marino 
115*86d7f5d3SJohn Marino static inline void
rc_flush(lzma_range_encoder * rc)116*86d7f5d3SJohn Marino rc_flush(lzma_range_encoder *rc)
117*86d7f5d3SJohn Marino {
118*86d7f5d3SJohn Marino 	for (size_t i = 0; i < 5; ++i)
119*86d7f5d3SJohn Marino 		rc->symbols[rc->count++] = RC_FLUSH;
120*86d7f5d3SJohn Marino }
121*86d7f5d3SJohn Marino 
122*86d7f5d3SJohn Marino 
123*86d7f5d3SJohn Marino static inline bool
rc_shift_low(lzma_range_encoder * rc,uint8_t * out,size_t * out_pos,size_t out_size)124*86d7f5d3SJohn Marino rc_shift_low(lzma_range_encoder *rc,
125*86d7f5d3SJohn Marino 		uint8_t *out, size_t *out_pos, size_t out_size)
126*86d7f5d3SJohn Marino {
127*86d7f5d3SJohn Marino 	if ((uint32_t)(rc->low) < (uint32_t)(0xFF000000)
128*86d7f5d3SJohn Marino 			|| (uint32_t)(rc->low >> 32) != 0) {
129*86d7f5d3SJohn Marino 		do {
130*86d7f5d3SJohn Marino 			if (*out_pos == out_size)
131*86d7f5d3SJohn Marino 				return true;
132*86d7f5d3SJohn Marino 
133*86d7f5d3SJohn Marino 			out[*out_pos] = rc->cache + (uint8_t)(rc->low >> 32);
134*86d7f5d3SJohn Marino 			++*out_pos;
135*86d7f5d3SJohn Marino 			rc->cache = 0xFF;
136*86d7f5d3SJohn Marino 
137*86d7f5d3SJohn Marino 		} while (--rc->cache_size != 0);
138*86d7f5d3SJohn Marino 
139*86d7f5d3SJohn Marino 		rc->cache = (rc->low >> 24) & 0xFF;
140*86d7f5d3SJohn Marino 	}
141*86d7f5d3SJohn Marino 
142*86d7f5d3SJohn Marino 	++rc->cache_size;
143*86d7f5d3SJohn Marino 	rc->low = (rc->low & 0x00FFFFFF) << RC_SHIFT_BITS;
144*86d7f5d3SJohn Marino 
145*86d7f5d3SJohn Marino 	return false;
146*86d7f5d3SJohn Marino }
147*86d7f5d3SJohn Marino 
148*86d7f5d3SJohn Marino 
149*86d7f5d3SJohn Marino static inline bool
rc_encode(lzma_range_encoder * rc,uint8_t * out,size_t * out_pos,size_t out_size)150*86d7f5d3SJohn Marino rc_encode(lzma_range_encoder *rc,
151*86d7f5d3SJohn Marino 		uint8_t *out, size_t *out_pos, size_t out_size)
152*86d7f5d3SJohn Marino {
153*86d7f5d3SJohn Marino 	assert(rc->count <= RC_SYMBOLS_MAX);
154*86d7f5d3SJohn Marino 
155*86d7f5d3SJohn Marino 	while (rc->pos < rc->count) {
156*86d7f5d3SJohn Marino 		// Normalize
157*86d7f5d3SJohn Marino 		if (rc->range < RC_TOP_VALUE) {
158*86d7f5d3SJohn Marino 			if (rc_shift_low(rc, out, out_pos, out_size))
159*86d7f5d3SJohn Marino 				return true;
160*86d7f5d3SJohn Marino 
161*86d7f5d3SJohn Marino 			rc->range <<= RC_SHIFT_BITS;
162*86d7f5d3SJohn Marino 		}
163*86d7f5d3SJohn Marino 
164*86d7f5d3SJohn Marino 		// Encode a bit
165*86d7f5d3SJohn Marino 		switch (rc->symbols[rc->pos]) {
166*86d7f5d3SJohn Marino 		case RC_BIT_0: {
167*86d7f5d3SJohn Marino 			probability prob = *rc->probs[rc->pos];
168*86d7f5d3SJohn Marino 			rc->range = (rc->range >> RC_BIT_MODEL_TOTAL_BITS)
169*86d7f5d3SJohn Marino 					* prob;
170*86d7f5d3SJohn Marino 			prob += (RC_BIT_MODEL_TOTAL - prob) >> RC_MOVE_BITS;
171*86d7f5d3SJohn Marino 			*rc->probs[rc->pos] = prob;
172*86d7f5d3SJohn Marino 			break;
173*86d7f5d3SJohn Marino 		}
174*86d7f5d3SJohn Marino 
175*86d7f5d3SJohn Marino 		case RC_BIT_1: {
176*86d7f5d3SJohn Marino 			probability prob = *rc->probs[rc->pos];
177*86d7f5d3SJohn Marino 			const uint32_t bound = prob * (rc->range
178*86d7f5d3SJohn Marino 					>> RC_BIT_MODEL_TOTAL_BITS);
179*86d7f5d3SJohn Marino 			rc->low += bound;
180*86d7f5d3SJohn Marino 			rc->range -= bound;
181*86d7f5d3SJohn Marino 			prob -= prob >> RC_MOVE_BITS;
182*86d7f5d3SJohn Marino 			*rc->probs[rc->pos] = prob;
183*86d7f5d3SJohn Marino 			break;
184*86d7f5d3SJohn Marino 		}
185*86d7f5d3SJohn Marino 
186*86d7f5d3SJohn Marino 		case RC_DIRECT_0:
187*86d7f5d3SJohn Marino 			rc->range >>= 1;
188*86d7f5d3SJohn Marino 			break;
189*86d7f5d3SJohn Marino 
190*86d7f5d3SJohn Marino 		case RC_DIRECT_1:
191*86d7f5d3SJohn Marino 			rc->range >>= 1;
192*86d7f5d3SJohn Marino 			rc->low += rc->range;
193*86d7f5d3SJohn Marino 			break;
194*86d7f5d3SJohn Marino 
195*86d7f5d3SJohn Marino 		case RC_FLUSH:
196*86d7f5d3SJohn Marino 			// Prevent further normalizations.
197*86d7f5d3SJohn Marino 			rc->range = UINT32_MAX;
198*86d7f5d3SJohn Marino 
199*86d7f5d3SJohn Marino 			// Flush the last five bytes (see rc_flush()).
200*86d7f5d3SJohn Marino 			do {
201*86d7f5d3SJohn Marino 				if (rc_shift_low(rc, out, out_pos, out_size))
202*86d7f5d3SJohn Marino 					return true;
203*86d7f5d3SJohn Marino 			} while (++rc->pos < rc->count);
204*86d7f5d3SJohn Marino 
205*86d7f5d3SJohn Marino 			// Reset the range encoder so we are ready to continue
206*86d7f5d3SJohn Marino 			// encoding if we weren't finishing the stream.
207*86d7f5d3SJohn Marino 			rc_reset(rc);
208*86d7f5d3SJohn Marino 			return false;
209*86d7f5d3SJohn Marino 
210*86d7f5d3SJohn Marino 		default:
211*86d7f5d3SJohn Marino 			assert(0);
212*86d7f5d3SJohn Marino 			break;
213*86d7f5d3SJohn Marino 		}
214*86d7f5d3SJohn Marino 
215*86d7f5d3SJohn Marino 		++rc->pos;
216*86d7f5d3SJohn Marino 	}
217*86d7f5d3SJohn Marino 
218*86d7f5d3SJohn Marino 	rc->count = 0;
219*86d7f5d3SJohn Marino 	rc->pos = 0;
220*86d7f5d3SJohn Marino 
221*86d7f5d3SJohn Marino 	return false;
222*86d7f5d3SJohn Marino }
223*86d7f5d3SJohn Marino 
224*86d7f5d3SJohn Marino 
225*86d7f5d3SJohn Marino static inline uint64_t
rc_pending(const lzma_range_encoder * rc)226*86d7f5d3SJohn Marino rc_pending(const lzma_range_encoder *rc)
227*86d7f5d3SJohn Marino {
228*86d7f5d3SJohn Marino 	return rc->cache_size + 5 - 1;
229*86d7f5d3SJohn Marino }
230*86d7f5d3SJohn Marino 
231*86d7f5d3SJohn Marino #endif
232