6502/lzsa
1
0
Fork 0
mirror of https://github.com/emmanuel-marty/lzsa.git synced 2025-08-08 03:25:26 +00:00
Code Issues Projects Releases Wiki Activity

Remove code that is now unnecessary

Browse Source
This commit is contained in:
Emmanuel Marty
2020-03-14 15:12:02 +01:00
committed by GitHub
parent 236df36f2b
commit f27ac9ae25
1 changed files with 2 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/shrink_block_v2.c
View File

@@ -433,9 +433,7 @@ static void lzsa_optimize_forward_v2(lzsa_compressor *pCompressor, const unsigne
for (n = 0; for (n = 0;
n < nMatchesPerArrival && pDestSlots[n].cost < nCodingChoiceCost; n < nMatchesPerArrival && pDestSlots[n].cost < nCodingChoiceCost;
n++) { n++) {
if (pDestSlots[n].rep_offset == nMatchOffset && if (pDestSlots[n].rep_offset == nMatchOffset) {
(!nInsertForwardReps || pDestSlots[n].cost != nCodingChoiceCost || pDestSlots[n].rep_pos >= i || nScore >= (pDestSlots[n].score + nDisableScore) ||
pDestSlots[nMatchesPerArrival - 1].from_slot)) {
exists = 1; exists = 1;
break; break;
} }
@@ -446,7 +444,7 @@ static void lzsa_optimize_forward_v2(lzsa_compressor *pCompressor, const unsigne
nn < nMatchesPerArrival && pDestSlots[nn].cost == nCodingChoiceCost; nn < nMatchesPerArrival && pDestSlots[nn].cost == nCodingChoiceCost;
nn++) { nn++) {
if (pDestSlots[nn].rep_offset == nMatchOffset && if (pDestSlots[nn].rep_offset == nMatchOffset &&
(!nInsertForwardReps || pDestSlots[nn].cost != nCodingChoiceCost || pDestSlots[nn].rep_pos >= i || nScore >= (pDestSlots[nn].score + nDisableScore) || (!nInsertForwardReps || pDestSlots[nn].rep_pos >= i || nScore >= (pDestSlots[nn].score + nDisableScore) ||
pDestSlots[nMatchesPerArrival - 1].from_slot)) { pDestSlots[nMatchesPerArrival - 1].from_slot)) {
exists = 1; exists = 1;
break; break;