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
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
|
/* 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$
*
*/
// Background animation management module
#include "saga.h"
#include "reinherit.h"
#include "cvar_mod.h"
#include "console_mod.h"
#include "game_mod.h"
#include "events_mod.h"
#include "render_mod.h"
#include "animation_mod.h"
#include "animation.h"
namespace Saga {
static R_ANIMINFO AnimInfo;
int ANIM_Register() {
CVAR_RegisterFunc(CF_anim_info, "anim_info", NULL, R_CVAR_NONE, 0, 0);
return R_SUCCESS;
}
int ANIM_Init() {
AnimInfo.anim_limit = R_MAX_ANIMATIONS;
AnimInfo.anim_count = 0;
AnimInfo.initialized = 1;
return R_SUCCESS;
}
int ANIM_Shutdown(void) {
uint16 i;
for (i = 0; i < R_MAX_ANIMATIONS; i++) {
free(AnimInfo.anim_tbl[i]);
}
AnimInfo.initialized = 0;
return R_SUCCESS;
}
int ANIM_Load(const byte *anim_resdata, size_t anim_resdata_len, uint16 *anim_id_p) {
R_ANIMATION *new_anim;
uint16 anim_id = 0;
uint16 i;
if (!AnimInfo.initialized) {
return R_FAILURE;
}
// Find an unused animation slot
for (i = 0; i < R_MAX_ANIMATIONS; i++) {
if (AnimInfo.anim_tbl[i] == NULL) {
anim_id = i;
break;
}
}
if (i == R_MAX_ANIMATIONS) {
return R_FAILURE;
}
new_anim = (R_ANIMATION *)malloc(sizeof *new_anim);
if (new_anim == NULL) {
warning("Error: Allocation failure");
return R_MEM;
}
new_anim->resdata = anim_resdata;
new_anim->resdata_len = anim_resdata_len;
if (GAME_GetGameType() == R_GAMETYPE_ITE) {
if (ANIM_GetNumFrames(anim_resdata, anim_resdata_len, &new_anim->n_frames) != R_SUCCESS) {
warning("Error: Couldn't get animation frame count");
return R_FAILURE;
}
// Cache frame offsets
new_anim->frame_offsets = (size_t *)malloc(new_anim->n_frames * sizeof *new_anim->frame_offsets);
if (new_anim->frame_offsets == NULL) {
warning("Error: Allocation failure");
return R_MEM;
}
for (i = 0; i < new_anim->n_frames; i++) {
ANIM_GetFrameOffset(anim_resdata, anim_resdata_len, i + 1, &new_anim->frame_offsets[i]);
}
} else {
new_anim->cur_frame_p = anim_resdata + SAGA_FRAME_HEADER_LEN;
new_anim->cur_frame_len = anim_resdata_len - SAGA_FRAME_HEADER_LEN;
ANIM_GetNumFrames(anim_resdata, anim_resdata_len, &new_anim->n_frames);
}
// Set animation data
new_anim->current_frame = 1;
new_anim->end_frame = new_anim->n_frames;
new_anim->stop_frame = new_anim->end_frame;
new_anim->frame_time = R_DEFAULT_FRAME_TIME;
new_anim->flags = 0;
new_anim->play_flag = 0;
new_anim->link_flag = 0;
new_anim->link_id = 0;
AnimInfo.anim_tbl[anim_id] = new_anim;
*anim_id_p = anim_id;
AnimInfo.anim_count++;
return R_SUCCESS;
}
int ANIM_Link(uint16 anim_id1, uint16 anim_id2) {
R_ANIMATION *anim1;
R_ANIMATION *anim2;
if ((anim_id1 >= AnimInfo.anim_count) || (anim_id2 >= AnimInfo.anim_count)) {
return R_FAILURE;
}
anim1 = AnimInfo.anim_tbl[anim_id1];
anim2 = AnimInfo.anim_tbl[anim_id2];
if ((anim1 == NULL) || (anim2 == NULL)) {
return R_FAILURE;
}
anim1->link_id = anim_id2;
anim1->link_flag = 1;
anim2->frame_time = anim1->frame_time;
return R_SUCCESS;
}
int ANIM_Play(uint16 anim_id, int vector_time) {
R_EVENT event;
R_ANIMATION *anim;
R_ANIMATION *link_anim;
uint16 link_anim_id;
R_BUFFER_INFO buf_info;
byte *display_buf;
const byte *nextf_p;
size_t nextf_len;
uint16 frame;
int result;
R_GAME_DISPLAYINFO disp_info;
if (anim_id >= AnimInfo.anim_count) {
return R_FAILURE;
}
GAME_GetDisplayInfo(&disp_info);
RENDER_GetBufferInfo(&buf_info);
display_buf = buf_info.r_bg_buf;
anim = AnimInfo.anim_tbl[anim_id];
if (anim == NULL) {
return R_FAILURE;
}
if (anim->play_flag) {
frame = anim->current_frame;
if (GAME_GetGameType() == R_GAMETYPE_ITE) {
result = ITE_DecodeFrame(anim->resdata, anim->resdata_len, anim->frame_offsets[frame - 1], display_buf,
disp_info.logical_w * disp_info.logical_h);
if (result != R_SUCCESS) {
warning("ANIM_Play: Error decoding frame %u", anim->current_frame);
anim->play_flag = 0;
return R_FAILURE;
}
} else {
if (anim->cur_frame_p == NULL) {
warning("ANIM_Play: Frames exhausted");
return R_FAILURE;
}
result = IHNM_DecodeFrame(display_buf, disp_info.logical_w * disp_info.logical_h,
anim->cur_frame_p, anim->cur_frame_len, &nextf_p, &nextf_len);
if (result != R_SUCCESS) {
warning("ANIM_Play: Error decoding frame %u", anim->current_frame);
anim->play_flag = 0;
return R_FAILURE;
}
anim->cur_frame_p = nextf_p;
anim->cur_frame_len = nextf_len;
}
anim->current_frame++;
}
anim->play_flag = 1;
if (anim->current_frame > anim->n_frames) {
// Animation done playing
if (anim->link_flag) {
// If this animation has a link, follow it
anim->play_flag = 0;
anim->current_frame = 1;
link_anim_id = anim->link_id;
link_anim = AnimInfo.anim_tbl[link_anim_id];
if (link_anim != NULL) {
link_anim->current_frame = 1;
link_anim->play_flag = 1;
}
anim_id = link_anim_id;
} else if (anim->flags & ANIM_LOOP) {
// Loop animation
anim->current_frame = 1;
anim->cur_frame_p = anim->resdata + SAGA_FRAME_HEADER_LEN;
anim->cur_frame_len = anim->resdata_len - SAGA_FRAME_HEADER_LEN;
} else {
// No link, stop playing
anim->current_frame = anim->n_frames;
anim->play_flag = 0;
if (anim->flags & ANIM_ENDSCENE) {
// This animation ends the scene
event.type = R_ONESHOT_EVENT;
event.code = R_SCENE_EVENT;
event.op = EVENT_END;
event.time = anim->frame_time + vector_time;
EVENT_Queue(&event);
}
return R_SUCCESS;
}
}
event.type = R_ONESHOT_EVENT;
event.code = R_ANIM_EVENT;
event.op = EVENT_FRAME;
event.param = anim_id;
event.time = anim->frame_time + vector_time;
EVENT_Queue(&event);
return R_SUCCESS;
}
int ANIM_Reset() {
uint16 i;
for (i = 0; i < R_MAX_ANIMATIONS; i++) {
ANIM_Free(i);
}
AnimInfo.anim_count = 0;
return R_SUCCESS;
}
int ANIM_SetFlag(uint16 anim_id, uint16 flag) {
R_ANIMATION *anim;
if (anim_id > AnimInfo.anim_count) {
return R_FAILURE;
}
anim = AnimInfo.anim_tbl[anim_id];
if (anim == NULL) {
return R_FAILURE;
}
anim->flags |= flag;
return R_SUCCESS;
}
int ANIM_SetFrameTime(uint16 anim_id, int time) {
R_ANIMATION *anim;
if (anim_id > AnimInfo.anim_count) {
return R_FAILURE;
}
anim = AnimInfo.anim_tbl[anim_id];
if (anim == NULL) {
return R_FAILURE;
}
anim->frame_time = time;
return R_SUCCESS;
}
int ANIM_Free(uint16 anim_id) {
R_ANIMATION *anim;
if (anim_id > AnimInfo.anim_count) {
return R_FAILURE;
}
anim = AnimInfo.anim_tbl[anim_id];
if (anim == NULL) {
return R_FAILURE;
}
if (GAME_GetGameType() == R_GAMETYPE_ITE) {
free(anim->frame_offsets);
anim->frame_offsets = NULL;
}
free(anim);
AnimInfo.anim_tbl[anim_id] = NULL;
AnimInfo.anim_count--;
return R_SUCCESS;
}
// The actual number of frames present in an animation resource is
// sometimes less than number present in the .nframes member of the
// animation header. For this reason, the function attempts to find
// the last valid frame number, which it returns via 'n_frames'
int ANIM_GetNumFrames(const byte *anim_resource, size_t anim_resource_len, uint16 *n_frames) {
R_ANIMATION_HEADER ah;
size_t offset;
int magic;
int x;
if (!AnimInfo.initialized) {
return R_FAILURE;
}
MemoryReadStream *readS = new MemoryReadStream(anim_resource, anim_resource_len);
ah.magic = readS->readUint16LE();
ah.screen_w = readS->readUint16LE();
ah.screen_h = readS->readUint16LE();
ah.unknown06 = readS->readByte();
ah.unknown07 = readS->readByte();
ah.nframes = readS->readByte();
if (GAME_GetGameType() == R_GAMETYPE_IHNM) {
*n_frames = ah.nframes;
}
if (ah.magic == 68) {
for (x = ah.nframes; x > 0; x--) {
if (ANIM_GetFrameOffset(anim_resource, anim_resource_len, x, &offset) != R_SUCCESS) {
return R_FAILURE;
}
magic = *(anim_resource + offset);
if (magic == SAGA_FRAME_HEADER_MAGIC) {
*n_frames = x;
return R_SUCCESS;
}
}
return R_FAILURE;
}
return R_FAILURE;
}
int ITE_DecodeFrame(const byte *resdata, size_t resdata_len, size_t frame_offset, byte *buf, size_t buf_len) {
R_ANIMATION_HEADER ah;
R_FRAME_HEADER fh;
byte *write_p;
uint16 magic;
uint16 x_start;
uint16 y_start;
uint32 screen_w;
uint32 screen_h;
int mark_byte;
byte data_byte;
int new_row;
uint16 control_ch;
uint16 param_ch;
uint16 runcount;
int x_vector;
uint16 i;
if (!AnimInfo.initialized) {
return R_FAILURE;
}
MemoryReadStream *readS = new MemoryReadStream(resdata, resdata_len);
// Read animation header
ah.magic = readS->readUint16LE();
ah.screen_w = readS->readUint16LE();
ah.screen_h = readS->readUint16LE();
ah.unknown06 = readS->readByte();
ah.unknown07 = readS->readByte();
ah.nframes = readS->readByte();
ah.flags = readS->readByte();
ah.unknown10 = readS->readByte();
ah.unknown11 = readS->readByte();
screen_w = ah.screen_w;
screen_h = ah.screen_h;
if ((screen_w * screen_h) > buf_len) {
// Buffer argument is too small to hold decoded frame, abort.
warning("ITE_DecodeFrame: Buffer size inadequate");
return R_FAILURE;
}
// Read frame header
readS = new MemoryReadStream(resdata + frame_offset, resdata_len - frame_offset);
// Check for frame magic byte
magic = readS->readByte();
if (magic != SAGA_FRAME_HEADER_MAGIC) {
warning("ITE_DecodeFrame: Invalid frame offset");
return R_FAILURE;
}
// For some strange reason, the animation header is in little
// endian format, but the actual RLE encoded frame data,
// including the frame header, is in big endian format.
fh.x_start = readS->readUint16BE();
fh.y_start = readS->readByte();
readS->readByte(); /* Skip pad byte */
fh.x_pos = readS->readUint16BE();
fh.y_pos = readS->readUint16BE();
fh.width = readS->readUint16BE();
fh.height = readS->readUint16BE();
x_start = fh.x_start;
y_start = fh.y_start;
// Setup write pointer to the draw origin
write_p = (buf + (y_start * screen_w) + x_start);
// Begin RLE decompression to output buffer
do {
mark_byte = readS->readByte();
switch (mark_byte) {
case 0x10: // Long Unencoded Run
runcount = readS->readSint16BE();
for (i = 0; i < runcount; i++) {
data_byte = readS->readByte();
if (data_byte != 0) {
*write_p = data_byte;
}
write_p++;
}
continue;
break;
case 0x20: // Long encoded run
runcount = readS->readSint16BE();
data_byte = readS->readByte();
for (i = 0; i < runcount; i++) {
*write_p++ = data_byte;
}
continue;
break;
case 0x2F: // End of row
x_vector = readS->readSint16BE();
new_row = readS->readByte();
// Set write pointer to the new draw origin
write_p = buf + ((y_start + new_row) * screen_w) + x_start + x_vector;
continue;
break;
case 0x30: // Reposition command
x_vector = readS->readSint16BE();
write_p += x_vector;
continue;
break;
case 0x3F: // End of frame marker
return R_SUCCESS;
break;
default:
break;
}
// Mask all but two high order control bits
control_ch = mark_byte & 0xC0U;
param_ch = mark_byte & 0x3FU;
switch (control_ch) {
case 0xC0: // 1100 0000
// Run of empty pixels
runcount = param_ch + 1;
write_p += runcount;
continue;
break;
case 0x80: // 1000 0000
// Run of compressed data
runcount = param_ch + 1;
data_byte = readS->readByte();
for (i = 0; i < runcount; i++) {
*write_p++ = data_byte;
}
continue;
break;
case 0x40: // 0100 0000
// Uncompressed run
runcount = param_ch + 1;
for (i = 0; i < runcount; i++) {
data_byte = readS->readByte();
if (data_byte != 0) {
*write_p = data_byte;
}
write_p++;
}
continue;
break;
default:
// Unknown marker found - abort
warning("ITE_DecodeFrame: Invalid RLE marker encountered");
return R_FAILURE;
break;
}
} while (mark_byte != 63); // end of frame marker
return R_SUCCESS;
}
int IHNM_DecodeFrame(byte *decode_buf, size_t decode_buf_len, const byte *thisf_p,
size_t thisf_len, const byte **nextf_p, size_t *nextf_len) {
int in_ch;
int decoded_data = 0;
int cont_flag = 1;
int control_ch;
int param_ch;
byte data_pixel;
int x_origin = 0;
int y_origin = 0;
int x_vector;
int new_row;
uint16 runcount;
uint16 c;
size_t in_ch_offset;
MemoryReadStream *readS = new MemoryReadStream(thisf_p, thisf_len);
byte *outbuf_p = decode_buf;
byte *outbuf_endp = (decode_buf + decode_buf_len) - 1;
size_t outbuf_remain = decode_buf_len;
R_GAME_DISPLAYINFO di;
GAME_GetDisplayInfo(&di);
*nextf_p = NULL;
for (; cont_flag; decoded_data = 1) {
in_ch_offset = readS->tell();
in_ch = readS->readByte();
switch (in_ch) {
case 0x0F: // 15: Frame header
{
int param1;
int param2;
int param3;
int param4;
int param5;
int param6;
if (thisf_len - readS->tell() < 13) {
warning("0x%02X: Input buffer underrun", in_ch);
return R_FAILURE;
}
param1 = readS->readUint16BE();
param2 = readS->readUint16BE();
readS->readByte(); // skip 1?
param3 = readS->readUint16BE();
param4 = readS->readUint16BE();
param5 = readS->readUint16BE();
param6 = readS->readUint16BE();
x_origin = param1;
y_origin = param2;
outbuf_p = decode_buf + x_origin + (y_origin * di.logical_w);
if (outbuf_p > outbuf_endp) {
warning("0x%02X: (0x%X) Invalid output position. (x: %d, y: %d)",
in_ch, in_ch_offset, x_origin, y_origin);
return R_FAILURE;
}
outbuf_remain = (outbuf_endp - outbuf_p) + 1;
continue;
}
break;
case 0x10: // Long Unencoded Run
runcount = readS->readSint16BE();
if (thisf_len - readS->tell() < runcount) {
warning("0x%02X: Input buffer underrun", in_ch);
return R_FAILURE;
}
if (outbuf_remain < runcount) {
warning("0x%02X: Output buffer overrun", in_ch);
return R_FAILURE;
}
for (c = 0; c < runcount; c++) {
data_pixel = readS->readByte();
if (data_pixel != 0) {
*outbuf_p = data_pixel;
}
outbuf_p++;
}
outbuf_remain -= runcount;
continue;
break;
case 0x1F: // 31: Unusued?
if (thisf_len - readS->tell() < 3) {
warning("0x%02X: Input buffer underrun", in_ch);
return R_FAILURE;
}
readS->readByte();
readS->readByte();
readS->readByte();
continue;
break;
case 0x20: // Long compressed run
if (thisf_len - readS->tell() <= 3) {
warning("0x%02X: Input buffer underrun", in_ch);
return R_FAILURE;
}
runcount = readS->readSint16BE();
data_pixel = readS->readByte();
for (c = 0; c < runcount; c++) {
*outbuf_p++ = data_pixel;
}
outbuf_remain -= runcount;
continue;
break;
case 0x2F: // End of row
if (thisf_len - readS->tell() <= 4) {
return R_FAILURE;
}
x_vector = readS->readSint16BE();
new_row = readS->readSint16BE();
outbuf_p = decode_buf + ((y_origin + new_row) * di.logical_w) + x_origin + x_vector;
outbuf_remain = (outbuf_endp - outbuf_p) + 1;
continue;
break;
case 0x30: // Reposition command
if (thisf_len - readS->tell() < 2) {
return R_FAILURE;
}
x_vector = readS->readSint16BE();
if (((x_vector > 0) && ((size_t) x_vector > outbuf_remain)) || (-x_vector > outbuf_p - decode_buf)) {
warning("0x30: Invalid x_vector");
return R_FAILURE;
}
outbuf_p += x_vector;
outbuf_remain -= x_vector;
continue;
break;
case 0x3F: // 68: Frame end marker
debug(1, "0x3F: Frame end marker");
if (decoded_data && (thisf_len - readS->tell() > 0)) {
*nextf_p = thisf_p + readS->tell();
*nextf_len = thisf_len - readS->tell();
} else {
*nextf_p = NULL;
*nextf_len = 0;
}
cont_flag = 0;
continue;
break;
default:
break;
}
control_ch = in_ch & 0xC0;
param_ch = in_ch & 0x3f;
switch (control_ch) {
case 0xC0: // Run of empty pixels
runcount = param_ch + 1;
if (outbuf_remain < runcount) {
return R_FAILURE;
}
outbuf_p += runcount;
outbuf_remain -= runcount;
continue;
break;
case 0x80: // Run of compressed data
runcount = param_ch + 1;
if ((outbuf_remain < runcount) || (thisf_len - readS->tell() <= 1)) {
return R_FAILURE;
}
data_pixel = readS->readByte();
for (c = 0; c < runcount; c++) {
*outbuf_p++ = data_pixel;
}
outbuf_remain -= runcount;
continue;
break;
case 0x40: // Uncompressed run
runcount = param_ch + 1;
if ((outbuf_remain < runcount) || (thisf_len - readS->tell() < runcount)) {
return R_FAILURE;
}
for (c = 0; c < runcount; c++) {
data_pixel = readS->readByte();
if (data_pixel != 0) {
*outbuf_p = data_pixel;
}
outbuf_p++;
}
outbuf_remain -= runcount;
continue;
break;
default:
break;
}
}
return R_SUCCESS;
}
int ANIM_GetFrameOffset(const byte *resdata, size_t resdata_len, uint16 find_frame, size_t *frame_offset_p) {
R_ANIMATION_HEADER ah;
uint16 num_frames;
uint16 current_frame;
byte mark_byte;
uint16 control;
uint16 runcount;
uint16 magic;
int i;
if (!AnimInfo.initialized) {
return R_FAILURE;
}
MemoryReadStream *readS = new MemoryReadStream(resdata, resdata_len);
// Read animation header
ah.magic = readS->readUint16LE();
ah.screen_w = readS->readUint16LE();
ah.screen_h = readS->readUint16LE();
ah.unknown06 = readS->readByte();
ah.unknown07 = readS->readByte();
ah.nframes = readS->readByte();
ah.flags = readS->readByte();
ah.unknown10 = readS->readByte();
ah.unknown11 = readS->readByte();
num_frames = ah.nframes;
if ((find_frame < 1) || (find_frame > num_frames)) {
return R_FAILURE;
}
for (current_frame = 1; current_frame < find_frame; current_frame++) {
magic = readS->readByte();
if (magic != SAGA_FRAME_HEADER_MAGIC) {
// Frame sync failure. Magic Number not found
return R_FAILURE;
}
// skip header
for (i = 0; i < SAGA_FRAME_HEADER_LEN; i++)
readS->readByte();
// For some strange reason, the animation header is in little
// endian format, but the actual RLE encoded frame data,
// including the frame header, is in big endian format. */
do {
mark_byte = readS->readByte();
switch (mark_byte) {
case 0x3F: // End of frame marker
continue;
break;
case 0x30: // Reposition command
readS->readByte();
readS->readByte();
continue;
break;
case 0x2F: // End of row marker
readS->readByte();
readS->readByte();
readS->readByte();
continue;
break;
case 0x20: // Long compressed run marker
readS->readByte();
readS->readByte();
readS->readByte();
continue;
break;
case 0x10: // (16) 0001 0000
// Long Uncompressed Run
runcount = readS->readSint16BE();
for (i = 0; i < runcount; i++)
readS->readByte();
continue;
break;
default:
break;
}
// Mask all but two high order (control) bits
control = mark_byte & 0xC0;
switch (control) {
case 0xC0:
// Run of empty pixels
continue;
break;
case 0x80:
// Run of compressed data
readS->readByte(); // Skip data byte
continue;
break;
case 0x40:
// Uncompressed run
runcount = (mark_byte & 0x3f) + 1;
for (i = 0; i < runcount; i++)
readS->readByte();
continue;
break;
default:
// Encountered unknown RLE marker, abort
return R_FAILURE;
break;
}
} while (mark_byte != 63);
}
*frame_offset_p = readS->tell();
return R_SUCCESS;
}
static void CF_anim_info(int argc, char *argv[]) {
uint16 anim_ct;
uint16 i;
uint16 idx;
(void)(argc);
(void)(argv);
anim_ct = AnimInfo.anim_count;
CON_Print("There are %d animations loaded:", anim_ct);
for (idx = 0, i = 0; i < anim_ct; idx++, i++) {
while (AnimInfo.anim_tbl[idx] == NULL) {
idx++;
}
CON_Print("%02d: Frames: %u Flags: %u", i, AnimInfo.anim_tbl[idx]->n_frames, AnimInfo.anim_tbl[idx]->flags);
}
return;
}
} // End of namespace Saga
|