-
Notifications
You must be signed in to change notification settings - Fork 1
/
hsq.h
88 lines (74 loc) · 2.08 KB
/
hsq.h
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
/* 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.
*
*/
#ifndef DUNE_HSQ_H
#define DUNE_HSQ_H
#include "common/stream.h"
namespace Dune {
static inline
byte getbit(uint16 &queue, Common::ReadStream *src) {
byte bit;
bit = queue & 1;
queue >>= 1;
if (queue == 0) {
queue = src->readUint16LE();
bit = queue & 1;
queue = 0x8000 | (queue >> 1);
}
return bit;
}
template <typename T>
void decompressHSQ(Common::ReadStream *src, int packedLength, T buf, int unpackedLength) {
uint16 queue = 0;
int dst = 0;
for (;;) {
if (getbit(queue, src)) {
assert(dst < unpackedLength);
buf[dst++] = src->readByte();
} else {
int count;
int offset;
if (getbit(queue, src)) {
uint16 word = src->readUint16LE();
count = word & 0x07;
offset = (word >> 3) - 8192;
if (count == 0) {
count = src->readByte();
}
if (count == 0) {
break;
}
} else {
byte b0 = getbit(queue, src);
byte b1 = getbit(queue, src);
count = 2*b0 + b1;
offset = int(src->readByte()) - 256;
}
assert(dst+count+2 < unpackedLength);
for (int i = 0; i != count+2; ++i) {
buf[dst+i] = buf[dst+i+offset];
}
dst += count + 2;
}
}
}
} // End of namespace Dune
#endif