liblzma/lz/lz_decoder.h

58 	/// Function to decode from in[] to *dict
60 			lzma_dict *restrict dict, const uint8_t *restrict in,
103 dict_get(const lzma_dict *const dict, const uint32_t distance)
105 	return dict->buf[dict->pos - distance - 1
106 			+ (distance < dict->pos ? 0 : dict->size)];
112 dict_is_empty(const lzma_dict *const dict)
114 	return dict->full == 0;
120 dict_is_distance_valid(const lzma_dict *const dict, const size_t distance)
122 	return dict->full > distance;
128 dict_repeat(lzma_dict *dict, uint32_t distance, uint32_t *len)
131 	const size_t dict_avail = dict->limit - dict->pos;
142 			dict->buf[dict->pos] = dict_get(dict, distance);
143 			++dict->pos;
146 	} else if (distance < dict->pos) {
148 		memcpy(dict->buf + dict->pos,
149 				dict->buf + dict->pos - distance - 1,
151 		dict->pos += left;
155 		// case occurs. We need to "wrap" the dict, thus
157 		assert(dict->full == dict->size);
159 				= dict->pos - distance - 1 + dict->size;
160 		uint32_t copy_size = dict->size - copy_pos;
163 			memmove(dict->buf + dict->pos, dict->buf + copy_pos,
165 			dict->pos += copy_size;
167 			memcpy(dict->buf + dict->pos, dict->buf, copy_size);
168 			dict->pos += copy_size;
170 			memmove(dict->buf + dict->pos, dict->buf + copy_pos,
172 			dict->pos += left;
177 	if (dict->full < dict->pos)
178 		dict->full = dict->pos;
187 dict_put(lzma_dict *dict, uint8_t byte)
189 	if (unlikely(dict->pos == dict->limit))
192 	dict->buf[dict->pos++] = byte;
194 	if (dict->pos > dict->full)
195 		dict->full = dict->pos;
203 dict_write(lzma_dict *restrict dict, const uint8_t *restrict in,
218 			dict->buf, &dict->pos, dict->limit);
220 	if (dict->pos > dict->full)
221 		dict->full = dict->pos;
228 dict_reset(lzma_dict *dict)
230 	dict->need_reset = true;