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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "common/debug.h"
#include "common/endian.h"
#include "common/util.h"
#include "access/decompress.h"
namespace Access {
void LzwDecompressor::decompress(byte *source, byte *dest) {
_source = source;
byte litByte = 0;
uint16 oldCode = 0;
uint16 copyLength, maxCodeValue, code, nextCode, lastCode;
byte *copyBuf = new byte[8192];
struct { uint16 code; byte value; } codeTable[8192];
memset(codeTable, 0, sizeof(codeTable));
_codeLength = 9;
nextCode = 258;
maxCodeValue = 512;
copyLength = 0;
_bitPos = 0;
while (1) {
code = getCode();
if (code == 257)
break;
if (code == 256) {
_codeLength = 9;
nextCode = 258;
maxCodeValue = 512;
lastCode = getCode();
oldCode = lastCode;
litByte = lastCode;
*dest++ = litByte;
} else {
lastCode = code;
if (code >= nextCode) {
lastCode = oldCode;
copyBuf[copyLength++] = litByte;
}
while (lastCode > 255) {
copyBuf[copyLength++] = codeTable[lastCode].value;
lastCode = codeTable[lastCode].code;
}
litByte = lastCode;
copyBuf[copyLength++] = lastCode;
while (copyLength > 0)
*dest++ = copyBuf[--copyLength];
codeTable[nextCode].value = lastCode;
codeTable[nextCode].code = oldCode;
nextCode++;
oldCode = code;
if (nextCode >= maxCodeValue && _codeLength <= 12) {
_codeLength++;
maxCodeValue <<= 1;
}
}
}
delete[] copyBuf;
}
uint16 LzwDecompressor::getCode() {
const byte bitMasks[9] = {
0x00, 0x01, 0x03, 0x07, 0x0F, 0x1F, 0x3F, 0x7F, 0x0FF
};
uint16 bits, loCode, hiCode;
loCode = (READ_LE_UINT16(_source) >> _bitPos) & 0xFF;
_source++;
bits = _codeLength - 8;
hiCode = (READ_LE_UINT16(_source) >> _bitPos) & bitMasks[bits];
_bitPos += bits;
if (_bitPos > 8) {
_source++;
_bitPos -= 8;
}
return (hiCode << 8) | loCode;
}
uint32 decompressDBE(byte *source, byte **dest) {
uint32 destSize = READ_LE_UINT32(source + 4);
*dest = new byte[destSize];
debug(1, "decompressDBE() destSize = %d", destSize);
LzwDecompressor dec;
dec.decompress(source + 16, *dest);
debug(1, "decompressDBE() ok");
return destSize;
}
} // End of namespace Access
|
