2019-06-10 11:24:15 +00:00
|
|
|
;
|
2019-07-30 16:39:27 +00:00
|
|
|
; Size-optimized LZSA2 decompressor by spke (v.1 02-09/06/2019 +patch1-30/07/2019, 144 bytes)
|
2019-06-10 11:24:15 +00:00
|
|
|
;
|
2019-06-21 15:39:50 +00:00
|
|
|
; The data must be compressed using the command line compressor by Emmanuel Marty
|
2019-06-10 11:24:15 +00:00
|
|
|
; The compression is done as follows:
|
|
|
|
;
|
|
|
|
; lzsa.exe -f2 -r <sourcefile> <outfile>
|
|
|
|
;
|
|
|
|
; where option -r asks for the generation of raw (frame-less) data.
|
|
|
|
;
|
|
|
|
; The decompression is done in the standard way:
|
|
|
|
;
|
2019-07-24 16:28:39 +00:00
|
|
|
; ld hl,FirstByteOfCompressedData
|
|
|
|
; ld de,FirstByteOfMemoryForDecompressedData
|
2019-06-10 11:24:15 +00:00
|
|
|
; call DecompressLZSA2
|
|
|
|
;
|
2019-07-24 16:28:39 +00:00
|
|
|
; Backward compression is also supported; you can compress files backward using:
|
|
|
|
;
|
|
|
|
; lzsa.exe -f2 -r -b <sourcefile> <outfile>
|
|
|
|
;
|
|
|
|
; and decompress the resulting files using:
|
|
|
|
;
|
|
|
|
; ld hl,LastByteOfCompressedData
|
|
|
|
; ld de,LastByteOfMemoryForDecompressedData
|
|
|
|
; call DecompressLZSA2
|
|
|
|
;
|
|
|
|
; (do not forget to uncomment the BACKWARD_DECOMPRESS option in the decompressor).
|
|
|
|
;
|
2019-06-10 11:24:15 +00:00
|
|
|
; Of course, LZSA2 compression algorithm is (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
|
|
|
|
;
|
2019-07-24 16:28:39 +00:00
|
|
|
; 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 BACKWARD_DECOMPRESS
|
|
|
|
|
|
|
|
IFDEF BACKWARD_DECOMPRESS
|
|
|
|
|
|
|
|
MACRO NEXT_HL
|
|
|
|
dec hl
|
|
|
|
ENDM
|
|
|
|
|
|
|
|
MACRO ADD_OFFSET
|
2019-07-30 16:39:27 +00:00
|
|
|
push hl : or a : sbc hl,de : pop de
|
2019-07-24 16:28:39 +00:00
|
|
|
ENDM
|
|
|
|
|
|
|
|
MACRO BLOCKCOPY
|
|
|
|
lddr
|
|
|
|
ENDM
|
|
|
|
|
|
|
|
ELSE
|
|
|
|
|
|
|
|
MACRO NEXT_HL
|
|
|
|
inc hl
|
|
|
|
ENDM
|
|
|
|
|
|
|
|
MACRO ADD_OFFSET
|
2019-07-30 16:39:27 +00:00
|
|
|
ex de,hl : add hl,de
|
2019-07-24 16:28:39 +00:00
|
|
|
ENDM
|
|
|
|
|
|
|
|
MACRO BLOCKCOPY
|
|
|
|
ldir
|
|
|
|
ENDM
|
|
|
|
|
|
|
|
ENDIF
|
2019-06-10 11:24:15 +00:00
|
|
|
|
2019-07-30 16:39:27 +00:00
|
|
|
IFDEF HD64180
|
|
|
|
MACRO LD_IY_DE
|
|
|
|
push de : pop iy
|
|
|
|
ENDM
|
|
|
|
MACRO LD_DE_IY
|
|
|
|
push iy : pop de
|
|
|
|
ENDM
|
|
|
|
MACRO LD_IXL_A
|
|
|
|
exx : ld l,a : exx
|
|
|
|
ENDM
|
|
|
|
MACRO LD_A_IXL
|
|
|
|
exx : ld a,l : exx
|
|
|
|
ENDM
|
|
|
|
ELSE
|
|
|
|
MACRO LD_IY_DE
|
|
|
|
;push de : pop iy
|
|
|
|
ld iyl,e : ld iyh,d
|
|
|
|
ENDM
|
|
|
|
MACRO LD_DE_IY
|
|
|
|
;push iy : pop de
|
|
|
|
ld e,iyl : ld d,iyh
|
|
|
|
ENDM
|
|
|
|
MACRO LD_IXL_A
|
|
|
|
ld ixl,a
|
|
|
|
ENDM
|
|
|
|
MACRO LD_A_IXL
|
|
|
|
ld a,ixl
|
|
|
|
ENDM
|
|
|
|
ENDIF
|
|
|
|
|
|
|
|
|
2019-06-10 11:24:15 +00:00
|
|
|
@DecompressLZSA2:
|
|
|
|
xor a : ld b,a : exa : jr ReadToken
|
|
|
|
|
|
|
|
CASE0xx ld d,#FF : cp %01000000 : jr c,CASE00x
|
|
|
|
|
|
|
|
CASE01x: cp %01100000 : rl d
|
|
|
|
|
2019-07-24 16:28:39 +00:00
|
|
|
OffsetReadE: ld e,(hl) : NEXT_HL
|
2019-07-30 16:39:27 +00:00
|
|
|
|
|
|
|
SaveOffset: LD_IY_DE
|
2019-06-10 11:24:15 +00:00
|
|
|
|
|
|
|
MatchLen: and %00000111 : add 2 : cp 9 : call z,ExtendedCode
|
|
|
|
|
|
|
|
CopyMatch: ld c,a
|
2019-07-30 16:39:27 +00:00
|
|
|
ex (sp),hl ; BC = len, DE = offset, HL = dest, SP ->[src]
|
|
|
|
ADD_OFFSET ; BC = len, DE = dest, HL = dest-offset, SP->[src]
|
2019-07-24 16:28:39 +00:00
|
|
|
BLOCKCOPY : pop hl
|
2019-06-10 11:24:15 +00:00
|
|
|
|
2019-07-30 16:39:27 +00:00
|
|
|
ReadToken: ld a,(hl) : LD_IXL_A : NEXT_HL
|
2019-06-10 11:24:15 +00:00
|
|
|
and %00011000 : jr z,NoLiterals
|
|
|
|
|
|
|
|
rrca : rrca : rrca
|
|
|
|
call pe,ExtendedCode
|
|
|
|
|
|
|
|
ld c,a
|
2019-07-24 16:28:39 +00:00
|
|
|
BLOCKCOPY
|
2019-06-10 11:24:15 +00:00
|
|
|
|
2019-07-30 16:39:27 +00:00
|
|
|
NoLiterals: push de : LD_A_IXL
|
2019-06-10 11:24:15 +00:00
|
|
|
or a : jp p,CASE0xx
|
|
|
|
|
|
|
|
CASE1xx cp %11000000 : jr nc,CASE11x
|
|
|
|
|
|
|
|
CASE10x: call ReadNibble
|
|
|
|
ld d,a : ld a,c
|
|
|
|
cp %10100000 : rl d
|
|
|
|
dec d : dec d : jr OffsetReadE
|
|
|
|
|
|
|
|
CASE00x: call ReadNibble
|
|
|
|
ld e,a : ld a,c
|
|
|
|
cp %00100000 : rl e : jr SaveOffset
|
|
|
|
|
|
|
|
CASE11x cp %11100000 : jr c,CASE110
|
|
|
|
|
2019-07-30 16:39:27 +00:00
|
|
|
CASE111: LD_DE_IY : jr MatchLen
|
2019-06-10 11:24:15 +00:00
|
|
|
|
2019-07-24 16:28:39 +00:00
|
|
|
CASE110: ld d,(hl) : NEXT_HL : jr OffsetReadE
|
2019-06-10 11:24:15 +00:00
|
|
|
|
|
|
|
ExtendedCode: call ReadNibble : inc a : jr z,ExtraByte
|
|
|
|
sub #F0+1 : add c : ret
|
2019-07-24 16:28:39 +00:00
|
|
|
ExtraByte ld a,15 : add c : add (hl) : NEXT_HL : ret nc
|
|
|
|
ld a,(hl) : NEXT_HL
|
|
|
|
ld b,(hl) : NEXT_HL : ret nz
|
2019-06-10 11:24:15 +00:00
|
|
|
pop de : pop de : ret
|
|
|
|
|
|
|
|
ReadNibble: ld c,a : xor a : exa : ret m
|
|
|
|
UpdateNibble ld a,(hl) : or #F0 : exa
|
2019-07-24 16:28:39 +00:00
|
|
|
ld a,(hl) : NEXT_HL : or #0F
|
2019-06-10 11:24:15 +00:00
|
|
|
rrca : rrca : rrca : rrca : ret
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|