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
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
|
/* ScummVM - Scumm Interpreter
* Copyright (C) 2004 The ScummVM project
*
* The ReInherit Engine is (C)2000-2003 by Daniel Balsom.
*
* 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* $Header$
*
*/
// Sprite management module
#include "saga.h"
#include "reinherit.h"
#include "game_mod.h"
#include "gfx_mod.h"
#include "scene_mod.h"
#include "rscfile_mod.h"
#include "text_mod.h"
#include "font_mod.h"
#include "sprite_mod.h"
#include "sprite.h"
namespace Saga {
static R_SPRITE_MODULE SpriteModule = { 0, 0, 0, 0 };
int SPRITE_Init() {
int result;
if (SpriteModule.init) {
return R_FAILURE;
}
debug(0, "Initializing sprite subsystem...");
// Load sprite module resource context
result = GAME_GetFileContext(&SpriteModule.sprite_ctxt, R_GAME_RESOURCEFILE, 0);
if (result != R_SUCCESS) {
return R_FAILURE;
}
SpriteModule.decode_buf_len = R_DECODE_BUF_LEN;
SpriteModule.decode_buf = (byte *)malloc(R_DECODE_BUF_LEN);
if (SpriteModule.decode_buf == NULL) {
return R_MEM;
}
SpriteModule.init = 1;
return R_SUCCESS;
}
int SPRITE_Shutdown() {
if (!SpriteModule.init) {
return R_FAILURE;
}
debug(0, "Shutting down sprite subsystem...");
free(SpriteModule.decode_buf);
return R_SUCCESS;
}
int SPRITE_LoadList(int resource_num, R_SPRITELIST **sprite_list_p) {
R_SPRITELIST *new_slist;
byte *spritelist_data;
size_t spritelist_len;
uint16 sprite_count;
uint16 i;
new_slist = (R_SPRITELIST *)malloc(sizeof *new_slist);
if (new_slist == NULL) {
return R_MEM;
}
if (RSC_LoadResource(SpriteModule.sprite_ctxt, resource_num, &spritelist_data, &spritelist_len) != R_SUCCESS) {
return R_FAILURE;
}
MemoryReadStream *readS = new MemoryReadStream(spritelist_data, spritelist_len);
sprite_count = readS->readUint16LE();
new_slist->sprite_count = sprite_count;
new_slist->offset_list = (R_SPRITELIST_OFFSET *)malloc(sprite_count * sizeof *new_slist->offset_list);
if (new_slist->offset_list == NULL) {
free(new_slist);
return R_MEM;
}
for (i = 0; i < sprite_count; i++) {
new_slist->offset_list[i].data_idx = 0;
new_slist->offset_list[i].offset = readS->readUint16LE();
}
new_slist->slist_rn = resource_num;
new_slist->sprite_data[0] = spritelist_data;
new_slist->append_count = 0;
*sprite_list_p = new_slist;
return R_SUCCESS;
}
int SPRITE_AppendList(int resource_num, R_SPRITELIST *spritelist) {
byte *spritelist_data;
size_t spritelist_len;
void *test_p;
uint16 old_sprite_count;
uint16 new_sprite_count;
uint16 sprite_count;
int i;
if (spritelist->append_count >= (R_APPENDMAX - 1)) {
return R_FAILURE;
}
if (RSC_LoadResource(SpriteModule.sprite_ctxt, resource_num, &spritelist_data, &spritelist_len) != R_SUCCESS) {
return R_FAILURE;
}
MemoryReadStream *readS = new MemoryReadStream(spritelist_data, spritelist_len);
sprite_count = readS->readUint16LE();
old_sprite_count = spritelist->sprite_count;
new_sprite_count = spritelist->sprite_count + sprite_count;
test_p = realloc(spritelist->offset_list, new_sprite_count * sizeof *spritelist->offset_list);
if (test_p == NULL) {
return R_MEM;
}
spritelist->offset_list = (R_SPRITELIST_OFFSET *)test_p;
spritelist->sprite_count = new_sprite_count;
spritelist->append_count++;
for (i = old_sprite_count; i < spritelist->sprite_count; i++) {
spritelist->offset_list[i].data_idx = spritelist->append_count;
spritelist->offset_list[i].offset = readS->readUint16LE();
}
spritelist->sprite_data[spritelist->append_count] = spritelist_data;
return R_SUCCESS;
}
int SPRITE_GetListLen(R_SPRITELIST *spritelist) {
return spritelist->sprite_count;
}
int SPRITE_Free(R_SPRITELIST *spritelist) {
int i;
for (i = 0; i <= spritelist->append_count; i++) {
RSC_FreeResource(spritelist->sprite_data[i]);
}
free(spritelist->offset_list);
free(spritelist);
return R_SUCCESS;
}
int SPRITE_Draw(R_SURFACE *ds, R_SPRITELIST *sprite_list, int sprite_num, int spr_x, int spr_y) {
int offset;
int offset_idx;
byte *sprite_p;
const byte *sprite_data_p;
int i, j;
byte *buf_row_p;
byte *src_row_p;
int s_width;
int s_height;
int clip_width;
int clip_height;
int x_align;
int y_align;
if (!SpriteModule.init) {
return R_FAILURE;
}
offset = sprite_list->offset_list[sprite_num].offset;
offset_idx = sprite_list->offset_list[sprite_num].data_idx;
sprite_p = sprite_list->sprite_data[offset_idx];
sprite_p += offset;
MemoryReadStream *readS = new MemoryReadStream(sprite_p, 5);
x_align = readS->readSByte();
y_align = readS->readSByte();
s_width = readS->readByte();
s_height = readS->readByte();
sprite_data_p = sprite_p + readS->tell();
spr_x += x_align;
spr_y += y_align;
if (spr_x < 0) {
return 0;
}
if (spr_y < 0) {
return 0;
}
DecodeRLESprite(sprite_data_p, 64000, SpriteModule.decode_buf, s_width * s_height);
buf_row_p = ds->buf + ds->buf_pitch * spr_y;
src_row_p = SpriteModule.decode_buf;
// Clip to right side of surface
clip_width = s_width;
if (s_width > (ds->buf_w - spr_x)) {
clip_width = (ds->buf_w - spr_x);
}
// Clip to bottom side of surface
clip_height = s_height;
if (s_height > (ds->buf_h - spr_y)) {
clip_height = (ds->buf_h - spr_y);
}
for (i = 0; i < clip_height; i++) {
for (j = 0; j < clip_width; j++) {
if (*(src_row_p + j) != 0) {
*(buf_row_p + j + spr_x) = *(src_row_p + j);
}
}
buf_row_p += ds->buf_pitch;
src_row_p += s_width;
}
return R_SUCCESS;
}
int SPRITE_DrawOccluded(R_SURFACE *ds, R_SPRITELIST *sprite_list, int sprite_num, int spr_x, int spr_y) {
int offset;
int offset_idx;
byte *sprite_p;
const byte *sprite_data_p;
int i;
int x, y;
byte *dst_row_p;
byte *src_row_p;
byte *src_p;
byte *dst_p;
byte *mask_p;
int s_width;
int s_height;
int x_align;
int y_align;
int z_lut[R_SPRITE_ZMAX];
int e_slope;
// Clipinfo variables
R_POINT spr_pt;
R_RECT spr_src_rect;
R_RECT spr_dst_rect;
R_CLIPINFO ci;
// BG mask variables
int mask_w;
int mask_h;
byte *mask_buf;
size_t mask_buf_len;
byte *mask_row_p;
int mask_z;
// Z info variables
SCENE_ZINFO zinfo;
int actor_z;
if (!SpriteModule.init) {
return R_FAILURE;
}
if (!SCENE_IsBGMaskPresent()) {
return SPRITE_Draw(ds, sprite_list, sprite_num, spr_x, spr_y);
}
if (sprite_num >= sprite_list->sprite_count) {
warning("Invalid sprite number (%d) for sprite list %d", sprite_num, sprite_list->slist_rn);
return R_FAILURE;
}
// Get sprite data from list
offset = sprite_list->offset_list[sprite_num].offset;
offset_idx = sprite_list->offset_list[sprite_num].data_idx;
sprite_p = sprite_list->sprite_data[offset_idx];
sprite_p += offset;
MemoryReadStream *readS = new MemoryReadStream(sprite_p, 5);
// Read sprite dimensions -- should probably cache this stuff in
// sprite list
x_align = readS->readSByte();
y_align = readS->readSByte();
s_width = readS->readByte();
s_height = readS->readByte();
sprite_data_p = sprite_p + readS->tell();
// Create actor Z occlusion LUT
SCENE_GetZInfo(&zinfo);
e_slope = zinfo.end_slope;
for (i = 0; i < R_SPRITE_ZMAX; i++) {
z_lut[i] = (int)(e_slope + ((137.0 - e_slope) / 14.0) * (15.0 - i));
}
actor_z = spr_y;
SCENE_GetBGMaskInfo(&mask_w, &mask_h, &mask_buf, &mask_buf_len);
spr_src_rect.left = 0;
spr_src_rect.top = 0;
spr_src_rect.right = s_width - 1;
spr_src_rect.bottom = s_height - 1;
spr_dst_rect.left = 0;
spr_dst_rect.top = 0;
spr_dst_rect.right = ds->clip_rect.right;
spr_dst_rect.bottom = MIN(ds->clip_rect.bottom, (int16)(mask_h - 1));
spr_pt.x = spr_x + x_align;
spr_pt.y = spr_y + y_align;
spr_x += x_align;
spr_y += y_align;
ci.dst_rect = &spr_dst_rect;
ci.src_rect = &spr_src_rect;
ci.dst_pt = &spr_pt;
GFX_GetClipInfo(&ci);
if (ci.nodraw) {
return R_SUCCESS;
}
DecodeRLESprite(sprite_data_p, 64000, SpriteModule.decode_buf, s_width * s_height);
// Finally, draw the occluded sprite
src_row_p = SpriteModule.decode_buf + ci.src_draw_x + (ci.src_draw_y * s_width);
dst_row_p = ds->buf + ci.dst_draw_x + (ci.dst_draw_y * ds->buf_pitch);
mask_row_p = mask_buf + ci.dst_draw_x + (ci.dst_draw_y * mask_w);
for (y = 0; y < ci.draw_h; y++) {
src_p = src_row_p;
dst_p = dst_row_p;
mask_p = mask_row_p;
for (x = 0; x < ci.draw_w; x++) {
if (*src_p != 0) {
mask_z = *mask_p & R_SPRITE_ZMASK;
if (actor_z > z_lut[mask_z]) {
*dst_p = *src_p;
}
}
src_p++;
dst_p++;
mask_p++;
}
dst_row_p += ds->buf_pitch;
mask_row_p += mask_w;
src_row_p += s_width;
}
/*
{
char buf[1024] = { 0 };
sprintf( buf, "dw: %d, dh: %d.", ci.draw_w, ci.draw_h );
TEXT_Draw(2, ds, buf, spr_x - x_align, spr_y - y_align, 255, 0, FONT_OUTLINE);
}
*/
return R_SUCCESS;
}
int DecodeRLESprite(const byte *inbuf, size_t inbuf_len, byte *outbuf, size_t outbuf_len) {
int bg_runcount;
int fg_runcount;
const byte *inbuf_ptr;
byte *outbuf_ptr;
const byte *inbuf_end;
byte *outbuf_end;
int c;
inbuf_ptr = inbuf;
outbuf_ptr = outbuf;
inbuf_end = inbuf + (inbuf_len);
inbuf_end--;
outbuf_end = outbuf + outbuf_len;
outbuf_end--;
memset(outbuf, 0, outbuf_len);
while ((inbuf_ptr < inbuf_end) && (outbuf_ptr < outbuf_end)) {
bg_runcount = *inbuf_ptr;
if (inbuf_ptr < inbuf_end)
inbuf_ptr++;
else
return 0;
fg_runcount = *inbuf_ptr;
if (inbuf_ptr < inbuf_end)
inbuf_ptr++;
else
return 0;
for (c = 0; c < bg_runcount; c++) {
*outbuf_ptr = (byte) 0;
if (outbuf_ptr < outbuf_end)
outbuf_ptr++;
else
return 0;
}
for (c = 0; c < fg_runcount; c++) {
*outbuf_ptr = *inbuf_ptr;
if (inbuf_ptr < inbuf_end)
inbuf_ptr++;
else
return 0;
if (outbuf_ptr < outbuf_end)
outbuf_ptr++;
else
return 0;
}
}
return R_SUCCESS;
}
} // End of namespace Saga
|