only in one place which isn't performance criticial.
}
}
- // Allocation successful. Store the new size and calculate
- // must_move_pos.
+ // Allocation successful. Store the new size.
lz->size = buffer_size;
- lz->must_move_pos = lz->size - lz->keep_size_after;
// Reset in window variables.
lz->offset = 0;
lzma_ret ret;
// Move the sliding window if needed.
- if (coder->lz.read_pos >= coder->lz.must_move_pos)
+ if (coder->lz.read_pos >= coder->lz.size - coder->lz.keep_size_after)
move_window(&coder->lz);
if (coder->next.code == NULL) {
/// to buffer[write_pos].
size_t write_pos;
- /// When read_pos >= must_move_pos, move_window() must be called
- /// to make more space for the input data.
- size_t must_move_pos;
-
/// Number of bytes that must be kept available in our input history.
/// That is, once keep_size_before bytes have been processed,
/// buffer[read_pos - keep_size_before] is the oldest byte that