; ; Speed-optimized LZSA1 decompressor by spke & uniabis (113 bytes) ; ; ver.00 by spke for LZSA 0.5.4 (03-24/04/2019, 134 bytes); ; ver.01 by spke for LZSA 0.5.6 (25/04/2019, 110(-24) bytes, +0.2% speed); ; ver.02 by spke for LZSA 1.0.5 (24/07/2019, added support for backward decompression); ; ver.03 by uniabis (30/07/2019, 109(-1) bytes, +3.5% speed); ; ver.04 by spke (31/07/2019, small re-organization of macros); ; ver.05 by uniabis (22/08/2019, 107(-2) bytes, same speed); ; ver.06 by spke for LZSA 1.0.7 (27/08/2019, 111(+4) bytes, +2.1% speed); ; ver.07 by spke for LZSA 1.1.0 (25/09/2019, added full revision history); ; ver.08 by spke for LZSA 1.1.2 (22/10/2019, re-organized macros and added an option for unrolled copying of long matches); ; ver.09 by spke for LZSA 1.2.1 (02/01/2020, 109(-2) bytes, same speed); ; ver.10 by spke (07/04/2021, 113(+4) bytes, +5% speed) ; ; The data must be compressed using the command line compressor by Emmanuel Marty ; The compression is done as follows: ; ; lzsa.exe -f1 -r ; ; where option -r asks for the generation of raw (frame-less) data. ; ; The decompression is done in the standard way: ; ; ld hl,FirstByteOfCompressedData ; ld de,FirstByteOfMemoryForDecompressedData ; call DecompressLZSA1 ; ; Backward compression is also supported; you can compress files backward using: ; ; lzsa.exe -f1 -r -b ; ; and decompress the resulting files using: ; ; ld hl,LastByteOfCompressedData ; ld de,LastByteOfMemoryForDecompressedData ; call DecompressLZSA1 ; ; (do not forget to uncomment the BACKWARD_DECOMPRESS option in the decompressor). ; ; Of course, LZSA compression algorithms are (c) 2019 Emmanuel Marty, ; see https://github.com/emmanuel-marty/lzsa for more information ; ; Drop me an email if you have any comments/ideas/suggestions: zxintrospec@gmail.com ; ; This software is provided 'as-is', without any express or implied ; warranty. In no event will the authors be held liable for any damages ; arising from the use of this software. ; ; Permission is granted to anyone to use this software for any purpose, ; including commercial applications, and to alter it and redistribute it ; freely, subject to the following restrictions: ; ; 1. The origin of this software must not be misrepresented; you must not ; claim that you wrote the original software. If you use this software ; in a product, an acknowledgment in the product documentation would be ; appreciated but is not required. ; 2. Altered source versions must be plainly marked as such, and must not be ; misrepresented as being the original software. ; 3. This notice may not be removed or altered from any source distribution. ; DEFINE UNROLL_LONG_MATCHES ; uncomment for faster decompression of very compressible data (+51 byte) ; DEFINE BACKWARD_DECOMPRESS ; uncomment to decompress backward compressed data (-3% speed, +5 bytes) IFNDEF BACKWARD_DECOMPRESS MACRO NEXT_HL inc hl ENDM MACRO ADD_OFFSET ; HL = DE+HL add hl,de ENDM MACRO COPY1 ldi ENDM MACRO COPYBC ldir ENDM ELSE MACRO NEXT_HL dec hl ENDM MACRO ADD_OFFSET ; HL = DE-HL ld a,e : sub l : ld l,a ld a,d : sbc h : ld h,a ; 6*4 = 24t / 6 bytes ENDM MACRO COPY1 ldd ENDM MACRO COPYBC lddr ENDM ENDIF @DecompressLZSA1: ld b,0 : jr ReadToken IFNDEF UNROLL_LONG_MATCHES CopyMatch2: ld c,a .UseC ex (sp),hl : jr CopyMatch.UseC ENDIF NoLiterals: xor (hl) : NEXT_HL : jp m,LongOffset ShortOffset: push hl : ld l,(hl) : ld h,#FF ; short matches have length 0+3..14+3 add 3 : cp 15+3 : jr nc,LongerMatch ; placed here this saves a JP per iteration CopyMatch: ld c,a ; BC = len, DE = dest, HL = offset, SP -> [src] .UseC ADD_OFFSET ; BC = len, DE = dest, HL = dest-offset, SP->[src] COPY1 : COPY1 : COPYBC ; BC = 0, DE = dest .popSrc pop hl : NEXT_HL ; HL = src ReadToken: ; first a byte token "O|LLL|MMMM" is read from the stream, ; where LLL is the number of literals and MMMM is ; a length of the match that follows after the literals ld a,(hl) : and #70 : jr z,NoLiterals cp #70 : jr z,MoreLiterals ; LLL=7 means 7+ literals... rrca : rrca : rrca : rrca : ld c,a ; LLL<7 means 0..6 literals... ld a,(hl) : NEXT_HL COPYBC ; the top bit of token is set if the offset contains two bytes and #8F : jp p,ShortOffset LongOffset: ; read second byte of the offset ld c,(hl) : NEXT_HL : push hl : ld h,(hl) : ld l,c add -128+3 : cp 15+3 : jp c,CopyMatch IFNDEF UNROLL_LONG_MATCHES ; MMMM=15 indicates a multi-byte number of literals LongerMatch: ex (sp),hl : NEXT_HL : add (hl) : jr nc,CopyMatch2 ; the codes are designed to overflow; ; the overflow value 1 means read 1 extra byte ; and overflow value 0 means read 2 extra bytes .code1 ld b,a : NEXT_HL : ld c,(hl) : jr nz,CopyMatch2.UseC .code0 NEXT_HL : ld b,(hl) ; the two-byte match length equal to zero ; designates the end-of-data marker ld a,b : or c : jr nz,CopyMatch2.UseC pop bc : ret ELSE ; MMMM=15 indicates a multi-byte number of literals LongerMatch: ex (sp),hl : NEXT_HL : add (hl) : jr c,VeryLongMatch ld c,a .UseC ex (sp),hl ADD_OFFSET COPY1 : COPY1 ; this is an unrolled equivalent of LDIR xor a : sub c and 16-1 : add a ld (.jrOffset),a : jr nz,$+2 .jrOffset EQU $-1 .fastLDIR DUP 16 COPY1 EDUP jp pe,.fastLDIR jr CopyMatch.popSrc VeryLongMatch: ; the codes are designed to overflow; ; the overflow value 1 means read 1 extra byte ; and overflow value 0 means read 2 extra bytes .code1 ld b,a : NEXT_HL : ld c,(hl) : jr nz,LongerMatch.UseC .code0 NEXT_HL : ld b,(hl) ; the two-byte match length equal to zero ; designates the end-of-data marker ld a,b : or c : jr nz,LongerMatch.UseC pop bc : ret ENDIF MoreLiterals: ; there are three possible situations here xor (hl) : NEXT_HL : exa ld a,7 : add (hl) : jr c,ManyLiterals CopyLiterals: ld c,a .UseC NEXT_HL : COPYBC exa : jp p,ShortOffset : jr LongOffset ManyLiterals: .code1 ld b,a : NEXT_HL : ld c,(hl) : jr nz,CopyLiterals.UseC .code0 NEXT_HL : ld b,(hl) : jr CopyLiterals.UseC