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
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
|
/* 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/substream.h"
#include "common/debug.h"
#include "common/textconsole.h"
#include "director/director.h"
#include "director/images.h"
namespace Director {
DIBDecoder::DIBDecoder() {
_surface = 0;
_palette = 0;
_paletteColorCount = 0;
_codec = 0;
}
DIBDecoder::~DIBDecoder() {
destroy();
}
void DIBDecoder::destroy() {
delete _surface;
_surface = 0;
delete[] _palette;
_palette = 0;
_paletteColorCount = 0;
delete _codec;
_codec = 0;
}
void DIBDecoder::loadPalette(Common::SeekableReadStream &stream) {
uint16 steps = stream.size() / 6;
uint16 index = (steps * 3) - 1;
_paletteColorCount = steps;
_palette = new byte[index + 1];
for (uint8 i = 0; i < steps; i++) {
_palette[index - 2] = stream.readByte();
stream.readByte();
_palette[index - 1] = stream.readByte();
stream.readByte();
_palette[index] = stream.readByte();
stream.readByte();
index -= 3;
}
}
bool DIBDecoder::loadStream(Common::SeekableReadStream &stream) {
uint32 headerSize = stream.readUint32LE();
if (headerSize != 40)
return false;
uint32 width = stream.readUint32LE();
uint32 height = stream.readUint32LE();
stream.readUint16LE(); // planes
uint16 bitsPerPixel = stream.readUint16LE();
uint32 compression = stream.readUint32BE();
/* uint32 imageSize = */ stream.readUint32LE();
/* uint32 pixelsPerMeterX = */ stream.readUint32LE();
/* uint32 pixelsPerMeterY = */ stream.readUint32LE();
_paletteColorCount = stream.readUint32LE();
/* uint32 colorsImportant = */ stream.readUint32LE();
_paletteColorCount = (_paletteColorCount == 0) ? 255: _paletteColorCount;
Common::SeekableSubReadStream subStream(&stream, 40, stream.size());
_codec = Image::createBitmapCodec(compression, width, height, bitsPerPixel);
if (!_codec)
return false;
_surface = _codec->decodeFrame(subStream);
return true;
}
/****************************
* BITD
****************************/
BITDDecoder::BITDDecoder(int w, int h) {
_surface = new Graphics::Surface();
// We make the surface pitch a multiple of 16.
int pitch = w;
if (w % 16)
pitch += 16 - (w % 16);
// HACK: Create a padded surface by adjusting w after create()
_surface->create(pitch, h, Graphics::PixelFormat::createFormatCLUT8());
_surface->w = w;
_palette = new byte[256 * 3];
_palette[0] = _palette[1] = _palette[2] = 0;
_palette[255 * 3 + 0] = _palette[255 * 3 + 1] = _palette[255 * 3 + 2] = 0xff;
_paletteColorCount = 2;
}
BITDDecoder::~BITDDecoder() {
destroy();
}
void BITDDecoder::destroy() {
_surface = 0;
delete[] _palette;
_palette = 0;
_paletteColorCount = 0;
}
void BITDDecoder::loadPalette(Common::SeekableReadStream &stream) {
// no op
}
bool BITDDecoder::loadStream(Common::SeekableReadStream &stream) {
int x = 0, y = 0;
// If the stream has exactly the required number of bits for this image,
// we assume it is uncompressed.
if (stream.size() * 8 == _surface->pitch * _surface->h) {
debugC(6, kDebugImages, "Skipping compression");
for (y = 0; y < _surface->h; y++) {
for (x = 0; x < _surface->pitch; ) {
byte color = stream.readByte();
for (int c = 0; c < 8; c++)
*((byte *)_surface->getBasePtr(x++, y)) = (color & (1 << (7 - c))) ? 0 : 0xff;
}
}
return true;
}
while (y < _surface->h) {
int n = stream.readSByte();
int count;
int b = 0;
int state = 0;
if (stream.eos())
break;
if ((n >= 0) && (n <= 127)) { // If n is between 0 and 127 inclusive, copy the next n+1 bytes literally.
count = n + 1;
state = 1;
} else if ((n >= -127) && (n <= -1)) { // Else if n is between -127 and -1 inclusive, copy the next byte -n+1 times.
b = stream.readByte();
count = -n + 1;
state = 2;
} else { // Else if n is -128, noop.
count = 0;
}
for (int i = 0; i < count && y < _surface->h; i++) {
byte color = 0;
if (state == 1) {
color = stream.readByte();
} else if (state == 2)
color = b;
for (int c = 0; c < 8; c++) {
*((byte *)_surface->getBasePtr(x, y)) = (color & (1 << (7 - c))) ? 0 : 0xff;
x++;
if (x == _surface->pitch) {
y++;
x = 0;
break;
}
}
}
}
return true;
}
/****************************
* BITD V4+
****************************/
BITDDecoderV4::BITDDecoderV4(int w, int h, uint16 bitsPerPixel) {
_surface = new Graphics::Surface();
// We make the surface pitch a multiple of 16.
int pitch = w;
if (w % 16)
pitch += 16 - (w % 16);
Graphics::PixelFormat pf = Graphics::PixelFormat::createFormatCLUT8();
switch (bitsPerPixel) {
case 2:
break;
case 4:
break;
case 8:
break;
case 16:
break;
case 32:
//pf = Graphics::PixelFormat::PixelFormat(bitsPerPixel / 8, 8, 8, 8, 8, 24, 16, 8, 0);
break;
}
// HACK: Create a padded surface by adjusting w after create()
_surface->create(pitch, h, pf);
_surface->w = w;
_palette = new byte[256 * 3];
_palette[0] = _palette[1] = _palette[2] = 0;
_palette[255 * 3 + 0] = _palette[255 * 3 + 1] = _palette[255 * 3 + 2] = 0xff;
_paletteColorCount = 2;
_bitsPerPixel = bitsPerPixel;
}
BITDDecoderV4::~BITDDecoderV4() {
destroy();
}
void BITDDecoderV4::destroy() {
_surface = 0;
delete[] _palette;
_palette = 0;
_paletteColorCount = 0;
}
void BITDDecoderV4::loadPalette(Common::SeekableReadStream &stream) {
// no op
}
bool BITDDecoderV4::loadStream(Common::SeekableReadStream &stream) {
int x = 0, y = 0;
// If the stream has exactly the required number of bits for this image,
// we assume it is uncompressed.
if (stream.size() * 8 == _surface->pitch * _surface->h) {
debugC(6, kDebugImages, "Skipping compression");
for (y = 0; y < _surface->h; y++) {
for (x = 0; x < _surface->pitch; ) {
byte color = stream.readByte();
for (int c = 0; c < 8; c++)
*((byte *)_surface->getBasePtr(x++, y)) = (color & (1 << (7 - c))) ? 0 : 0xff;
}
}
return true;
}
Common::Array<int> pixels;
while (!stream.eos()) {
int data = stream.readByte();
int len = data + 1;
if ((data & 0x80) != 0) {
len = ((data ^ 0xFF) & 0xff) + 2;
data = stream.readByte();
for (int p = 0; p < len; p++) {
pixels.push_back(data);
//*((byte *)_surface->getBasePtr(x, y)) = data;
}
//data = stream.readByte();
} else {
for (int p = 0; p < len; p++) {
data = stream.readByte();
pixels.push_back(data);
}
}
if (_bitsPerPixel == 32 && pixels.size() % (_surface->w * 3) == 0)
stream.readUint16BE();
}
int offset = 0;
if (_surface->w < (pixels.size() / _surface->h))
offset = (pixels.size() / _surface->h) - _surface->w;
if (pixels.size() > 0) {
for (y = 0; y < _surface->h; y++) {
for (x = 0; x < _surface->w;) {
switch (_bitsPerPixel) {
case 1: {
for (int c = 0; c < 8; c++, x++) {
*((byte *)_surface->getBasePtr(x, y)) = (pixels[(((y * _surface->pitch) + x) / 8)] & (1 << (7 - c))) ? 0 : 0xff;
}
break;
}
case 8:
// this calculation is wrong.. need a demo with colours.
*((byte *)_surface->getBasePtr(x, y)) = 0xff - pixels[(y * _surface->w) + x + (y * offset)];
x++;
break;
case 16:
*((uint16*)_surface->getBasePtr(x, y)) = _surface->format.RGBToColor(
(pixels[((y * _surface->w) * 2) + x] & 0x7c) << 1,
(pixels[((y * _surface->w) * 2) + x] & 0x03) << 6 |
(pixels[((y * _surface->w) * 2) + (_surface->w) + x] & 0xe0) >> 2,
(pixels[((y * _surface->w) * 2) + (_surface->w) + x] & 0x1f) << 3);
x++;
break;
case 32:
*((uint32*)_surface->getBasePtr(x, y)) = _surface->format.RGBToColor(
pixels[((y * _surface->w) * 3) + x],
pixels[(((y * _surface->w) * 3) + (_surface->w)) + x],
pixels[(((y * _surface->w) * 3) + (2 * _surface->w)) + x]);
x++;
break;
default:
x++;
break;
}
}
}
}
return true;
}
} // End of namespace Director
|