6502/lzsa
1
0
Fork 0
mirror of https://github.com/emmanuel-marty/lzsa.git synced 2024-11-22 05:33:58 +00:00
Code Issues Projects Releases Wiki Activity

Remove unneeded code

Browse Source
This commit is contained in:
Emmanuel Marty 2020-11-06 16:26:37 +01:00 committed by GitHub
parent fc927c783c
commit b98f8410fe
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
src/shrink_block_v2.c
View File

@ -478,10 +478,9 @@ static void lzsa_optimize_forward_v2(lzsa_compressor *pCompressor, const unsigne
lzsa_arrival *pDestSlots = &cur_arrival[k << ARRIVALS_PER_POSITION_SHIFT]; lzsa_arrival *pDestSlots = &cur_arrival[k << ARRIVALS_PER_POSITION_SHIFT];
/* Insert non-repmatch candidates */ /* Insert non-repmatch candidate */
if (nNonRepMatchArrivalIdx >= 0) { if (nNonRepMatchArrivalIdx >= 0) {
int nRepOffset = cur_arrival[nNonRepMatchArrivalIdx].rep_offset;
const int nPrevCost = cur_arrival[nNonRepMatchArrivalIdx].cost & 0x3fffffff; const int nPrevCost = cur_arrival[nNonRepMatchArrivalIdx].cost & 0x3fffffff;
int nCodingChoiceCost = nPrevCost /* the actual cost of the literals themselves accumulates up the chain */ + nMatchLenCost + nNoRepmatchOffsetCost; int nCodingChoiceCost = nPrevCost /* the actual cost of the literals themselves accumulates up the chain */ + nMatchLenCost + nNoRepmatchOffsetCost;