-
Notifications
You must be signed in to change notification settings - Fork 2
/
unbitbuster2.asm
204 lines (146 loc) · 3.12 KB
/
unbitbuster2.asm
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
; Copyright (c) 2003-2004,2022 Arjan Bakker
;
; Permission is hereby granted, free of charge, to any person obtaining a copy of
; this software and associated documentation files (the "Software"), to deal in
; the Software without restriction, including without limitation the rights to
; use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
; the Software, and to permit persons to whom the Software is furnished to do so,
; subject to the following conditions:
;
; The above copyright notice and this permission notice shall be included in all
; copies or substantial portions of the Software.
;
; THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
; IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
; FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
; COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
; IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
; CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
; File: unbitbuster2
;
; The bitbuster module gives you depack support for data packed
; using the bitbuster algorithm.
;
; COPYRIGHT & CREDITS:
; This module has been released by Arjan Bakker under the MIT License;
; please see the top of the source file(s) for the full copyright statement.
; modified by uniabis
; support single block only
unbitbuster2:
;inc hl ; block number
;inc hl ; block length low
;inc hl ; block length high
.block:
scf
jr .fill_bitbuffer_inline
.get_offset:
ld e, (hl)
inc hl
bit 7, e
jr z, .offsetbits7
IFNDEF BITBUSTER_OPTIMIZE_SPEED
call .get_bit
call .rld_and_get_bit
call .rld_and_get_bit
call .rld_and_get_bit
ELSE
add a, a
call z, .fill_bitbuffer
rl d
add a, a
call z, .fill_bitbuffer
rl d
add a, a
call z, .fill_bitbuffer
rl d
add a, a
call z, .fill_bitbuffer
ENDIF
jr c, .calc_source
res 7, e
.offsetbits7:
scf
.calc_source:
ex (sp), hl
push hl
sbc hl, de
pop de
ldir
ldi
pop hl
add a, a
jr nc, .literal
jr nz, .get_length
.fill_bitbuffer_inline:
ld a, (hl)
inc hl
adc a, a
jr c, .get_length
.literal:
ldi
.loop:
add a, a
jr nc, .literal
jr z, .fill_bitbuffer_inline
.get_length:
push de
ld bc, 1
ld d, b
IFNDEF BITBUSTER_OPTIMIZE_SPEED
.get_length_loop:
call .get_bit
jr nc, .get_offset
call .get_bit
rl c
rl b
jr nc, .get_length_loop
pop de
;ret
.rld_and_get_bit
rl d
.get_bit:
add a, a
ret nz
ELSE
IF BITBUSTER_OPTIMIZE_SPEED>1
.get_length_loop_byte:
add a, a
jr nc, .get_offset
jr z, .fill_bitbuffer2
add a, a
jr z, .fill_bitbuffer3
rl c
jr .get_length_loop_byte
.fill_bitbuffer2:
ld a, (hl)
inc hl
.get_length_loop:
adc a, a
jr nc, .get_offset
jr z, .fill_bitbuffer2
add a, a
jr nz, .shift_length_word
.fill_bitbuffer3:
ld a, (hl)
inc hl
adc a, a
.shift_length_word:
ELSE
.get_length_loop:
add a, a
call z, .fill_bitbuffer
jr nc, .get_offset
add a, a
call z, .fill_bitbuffer
ENDIF
rl c
rl b
jr nc, .get_length_loop
pop de
;ret
ENDIF
.fill_bitbuffer:
ld a, (hl)
inc hl
adc a, a
ret