forked from nwaples/rardecode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdecode50.go
311 lines (283 loc) · 6.39 KB
/
decode50.go
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
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
package rardecode
import (
"errors"
"io"
"math/bits"
)
const (
mainSize5 = 306
offsetSize5 = 64
lowoffsetSize5 = 16
lengthSize5 = 44
tableSize5 = mainSize5 + offsetSize5 + lowoffsetSize5 + lengthSize5
offsetSize7 = 80
tableSize7 = mainSize5 + offsetSize7 + lowoffsetSize5 + lengthSize5
)
var (
ErrUnknownFilter = errors.New("rardecode: unknown V5 filter")
ErrCorruptDecodeHeader = errors.New("rardecode: corrupt decode header")
)
// decoder50 implements the decoder interface for RAR 5 compression.
// Decode input it broken up into 1 or more blocks. Each block starts with
// a header containing block length and optional code length tables to initialize
// the huffman decoders with.
type decoder50 struct {
br rar5BitReader // bit reader for current data block
buf [tableSize7]byte
codeLength []byte
offsetSize int
lastBlock bool // current block is last block in compressed file
mainDecoder huffmanDecoder
offsetDecoder huffmanDecoder
lowoffsetDecoder huffmanDecoder
lengthDecoder huffmanDecoder
offset [4]int
length int
}
func (d *decoder50) version() int { return decode50Ver }
func (d *decoder50) init(r byteReader, reset bool, size int64, ver int) {
d.br.reset(r)
d.lastBlock = false
if ver == decode70Ver {
d.codeLength = d.buf[:]
d.offsetSize = offsetSize7
} else {
d.codeLength = d.buf[:tableSize5]
d.offsetSize = offsetSize5
}
if reset {
clear(d.offset[:])
d.length = 0
clear(d.codeLength[:])
}
}
func (d *decoder50) readBlockHeader() error {
flags, err := d.br.ReadByte()
if err != nil {
return err
}
bytecount := (flags>>3)&3 + 1
if bytecount == 4 {
return ErrCorruptDecodeHeader
}
hsum, err := d.br.ReadByte()
if err != nil {
return err
}
blockBits := int(flags)&0x07 + 1
blockBytes := 0
sum := 0x5a ^ flags
for i := byte(0); i < bytecount; i++ {
var n byte
n, err = d.br.ReadByte()
if err != nil {
return err
}
sum ^= n
blockBytes |= int(n) << (i * 8)
}
if sum != hsum { // bad header checksum
return ErrCorruptDecodeHeader
}
blockBits += (blockBytes - 1) * 8
// reset the bits limit
d.br.setLimit(blockBits)
d.lastBlock = flags&0x40 > 0
if flags&0x80 > 0 {
// read new code length tables and reinitialize huffman decoders
cl := d.codeLength[:]
err = readCodeLengthTable(&d.br, cl, false)
if err != nil {
return err
}
d.mainDecoder.init(cl[:mainSize5])
cl = cl[mainSize5:]
d.offsetDecoder.init(cl[:d.offsetSize])
cl = cl[d.offsetSize:]
d.lowoffsetDecoder.init(cl[:lowoffsetSize5])
cl = cl[lowoffsetSize5:]
d.lengthDecoder.init(cl)
}
return nil
}
func slotToLength(br bitReader, n int) (int, error) {
if n >= 8 {
bits := uint8(n/4 - 1)
n = (4 | (n & 3)) << bits
if bits > 0 {
b, err := br.readBits(bits)
if err != nil {
return 0, err
}
n |= b
}
}
n += 2
return n, nil
}
// readFilter5Data reads an encoded integer used in V5 filters.
func readFilter5Data(br bitReader) (int, error) {
// TODO: should data really be uint? (for 32bit ints).
// It will be masked later anyway by decode window mask.
bytes, err := br.readBits(2)
if err != nil {
return 0, err
}
bytes++
var data int
for i := 0; i < bytes; i++ {
n, err := br.readBits(8)
if err != nil {
return 0, err
}
data |= n << (uint(i) * 8)
}
return data, nil
}
func (d *decoder50) readFilter(dr *decodeReader) error {
fb := new(filterBlock)
var err error
fb.offset, err = readFilter5Data(&d.br)
if err != nil {
return err
}
fb.length, err = readFilter5Data(&d.br)
if err != nil {
return err
}
ftype, err := d.br.readBits(3)
if err != nil {
return err
}
switch ftype {
case 0:
n, err := d.br.readBits(5)
if err != nil {
return err
}
fb.filter = func(buf []byte, offset int64) ([]byte, error) { return filterDelta(n+1, buf) }
case 1:
fb.filter = func(buf []byte, offset int64) ([]byte, error) { return filterE8(0xe8, true, buf, offset) }
case 2:
fb.filter = func(buf []byte, offset int64) ([]byte, error) { return filterE8(0xe9, true, buf, offset) }
case 3:
fb.filter = filterArm
default:
return ErrUnknownFilter
}
return dr.queueFilter(fb)
}
func (d *decoder50) decodeLength(dr *decodeReader, i int) error {
offset := d.offset[i]
copy(d.offset[1:i+1], d.offset[:i])
d.offset[0] = offset
sl, err := d.lengthDecoder.readSym(&d.br)
if err != nil {
return err
}
d.length, err = slotToLength(&d.br, sl)
if err == nil {
dr.copyBytes(d.length, d.offset[0])
}
return err
}
func (d *decoder50) decodeOffset(dr *decodeReader, i int) error {
length, err := slotToLength(&d.br, i)
if err != nil {
return err
}
offset := 1
slot, err := d.offsetDecoder.readSym(&d.br)
if err != nil {
return err
}
if slot < 4 {
offset += slot
} else {
bitCount := uint8(slot/2 - 1)
offset += (2 | (slot & 1)) << bitCount
if bitCount >= 4 {
bitCount -= 4
if bitCount > 0 {
if bits.UintSize == 32 {
// bitReader can only read at most intSize-8 bits.
// Split read into two parts.
if bitCount > 24 {
n, err := d.br.readBits(24)
if err != nil {
return err
}
bitCount -= 24
offset += n << (4 + bitCount)
}
}
n, err := d.br.readBits(bitCount)
if err != nil {
return err
}
offset += n << 4
}
n, err := d.lowoffsetDecoder.readSym(&d.br)
if err != nil {
return err
}
offset += n
} else {
n, err := d.br.readBits(bitCount)
if err != nil {
return err
}
offset += n
}
}
if offset > 0x100 {
length++
if offset > 0x2000 {
length++
if offset > 0x40000 {
length++
}
}
}
copy(d.offset[1:], d.offset[:])
d.offset[0] = offset
d.length = length
dr.copyBytes(d.length, d.offset[0])
return nil
}
func (d *decoder50) fill(dr *decodeReader) error {
for dr.notFull() {
sym, err := d.mainDecoder.readSym(&d.br)
if err == nil {
switch {
case sym < 256:
// literal
dr.writeByte(byte(sym))
continue
case sym >= 262:
err = d.decodeOffset(dr, sym-262)
case sym >= 258:
err = d.decodeLength(dr, sym-258)
case sym == 257:
// use previous offset and length
dr.copyBytes(d.length, d.offset[0])
continue
default: // sym == 256:
err = d.readFilter(dr)
}
} else if err == io.EOF {
// reached end of the block
if d.lastBlock {
return io.EOF
}
err = d.readBlockHeader()
}
if err != nil {
if err == io.EOF {
return ErrDecoderOutOfData
}
return err
}
}
return nil
}