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
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
|
/*
* File: gif.c
*
* Copyright (C) 1997 Raph Levien <raph@acm.org>
* Copyright (C) 2000-2007 Jorge Arellano Cid <jcid@dillo.org>
*
* 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 3 of the License, or
* (at your option) any later version.
*/
/*
* The GIF decoder for dillo. It is responsible for decoding GIF data
* and transferring it to the dicache.
*/
/* Notes 13 Oct 1997 --RLL
*
* Today, just for the hell of it, I implemented a new decoder from
* scratch. It's oriented around pushing bytes, while the old decoder
* was based around reads which may suspend. There were basically
* three motivations.
*
* 1. To increase the speed.
*
* 2. To fix some bugs I had seen, most likely due to suspension.
*
* 3. To make sure that the code had no buffer overruns or the like.
*
* 4. So that the code could be released under a freer license.
*
* Let's see how we did on speed. I used a large image for testing
* (fvwm95-2.gif).
*
* The old decoder spent a total of about 1.04 seconds decoding the
* image. Another .58 seconds went into Image_line, almost
* entirely conversion from colormap to RGB.
*
* The new decoder spent a total of 0.46 seconds decoding the image.
* However, the time for Image_line went up to 1.01 seconds.
* Thus, even though the decoder seems to be about twice as fast,
* the net gain is pretty minimal. Could this be because of cache
* effects?
*
* Lessons learned: The first, which I keep learning over and over, is
* not to try to optimize too much. It doesn't work. Just keep things
* simple.
*
* Second, it seems that the colormap to RGB conversion is really a
* significant part of the overall time. It's possible that going
* directly to 16 bits would help, but that's optimization again :)
*/
/* TODO:
* + Make sure to handle error cases gracefully (including aborting the
* connection, if necessary).
*/
#include <config.h>
#ifdef ENABLE_GIF
#include <stdio.h> /* for sprintf */
#include <string.h> /* for memcpy and memmove */
#include "msg.h"
#include "image.hh"
#include "cache.h"
#include "dicache.h"
#define INTERLACE 0x40
#define LOCALCOLORMAP 0x80
#define LM_to_uint(a,b) ((((uchar_t)b)<<8)|((uchar_t)a))
#define MAXCOLORMAPSIZE 256
#define MAX_LWZ_BITS 12
typedef struct _DilloGif {
DilloImage *Image;
DilloUrl *url;
int version;
int state;
size_t Start_Ofs;
uint_t Flags;
uchar_t input_code_size;
uchar_t *linebuf;
int pass;
uint_t y;
/* state for lwz_read_byte */
int code_size;
/* The original GifScreen from giftopnm */
uint_t Width;
uint_t Height;
size_t ColorMap_ofs;
uint_t ColorResolution;
uint_t NumColors;
int Background;
uint_t spill_line_index;
#if 0
uint_t AspectRatio; /* AspectRatio (not used) */
#endif
/* Gif89 extensions */
int transparent;
#if 0
/* None are used: */
int delayTime;
int inputFlag;
int disposal;
#endif
/* state for the new push-oriented decoder */
int packet_size; /* The amount of the data block left to process */
uint_t window;
int bits_in_window;
uint_t last_code; /* Last "compressed" code in the look up table */
uint_t line_index;
uchar_t **spill_lines;
int num_spill_lines_max;
int length[(1 << MAX_LWZ_BITS) + 1];
int code_and_byte[(1 << MAX_LWZ_BITS) + 1];
} DilloGif;
/* Some invariants:
*
* last_code <= code_mask
*
* code_and_byte is stored packed: (code << 8) | byte
*/
/*
* Forward declarations
*/
static void Gif_write(DilloGif *gif, void *Buf, uint_t BufSize);
static void Gif_close(DilloGif *gif, CacheClient_t *Client);
static size_t Gif_process_bytes(DilloGif *gif, const uchar_t *buf,
int bufsize, void *Buf);
/*
* Create a new gif structure for decoding a gif into a RGB buffer
*/
void *a_Gif_new(DilloImage *Image, DilloUrl *url, int version)
{
DilloGif *gif = dMalloc(sizeof(DilloGif));
_MSG("a_Gif_new: gif=%p\n", gif);
gif->Image = Image;
gif->url = url;
gif->version = version;
gif->Flags = 0;
gif->state = 0;
gif->Start_Ofs = 0;
gif->linebuf = NULL;
gif->Background = -1;
gif->transparent = -1;
gif->num_spill_lines_max = 0;
gif->spill_lines = NULL;
gif->window = 0;
gif->packet_size = 0;
gif->ColorMap_ofs = 0;
return gif;
}
/*
* Free the gif-decoding data structure.
*/
static void Gif_free(DilloGif *gif)
{
int i;
_MSG("Gif_free: gif=%p\n", gif);
dFree(gif->linebuf);
if (gif->spill_lines != NULL) {
for (i = 0; i < gif->num_spill_lines_max; i++)
dFree(gif->spill_lines[i]);
dFree(gif->spill_lines);
}
dFree(gif);
}
/*
* This function is a cache client, it receives data from the cache
* and dispatches it to the appropriate gif-processing functions
*/
void a_Gif_callback(int Op, void *data)
{
if (Op == CA_Send) {
CacheClient_t *Client = data;
Gif_write(Client->CbData, Client->Buf, Client->BufSize);
} else if (Op == CA_Close) {
CacheClient_t *Client = data;
Gif_close(Client->CbData, Client);
} else if (Op == CA_Abort) {
Gif_free(data);
}
}
/*
* Receive and process new chunks of GIF image data
*/
static void Gif_write(DilloGif *gif, void *Buf, uint_t BufSize)
{
uchar_t *buf;
int bufsize, bytes_consumed;
/* Sanity checks */
if (!Buf || !gif->Image || BufSize == 0)
return;
buf = ((uchar_t *) Buf) + gif->Start_Ofs;
bufsize = BufSize - gif->Start_Ofs;
_MSG("Gif_write: %u bytes\n", BufSize);
/* Process the bytes in the input buffer. */
bytes_consumed = Gif_process_bytes(gif, buf, bufsize, Buf);
if (bytes_consumed < 1)
return;
gif->Start_Ofs += bytes_consumed;
_MSG("exit Gif_write, bufsize=%ld\n", (long)bufsize);
}
/*
* Finish the decoding process (and free the memory)
*/
static void Gif_close(DilloGif *gif, CacheClient_t *Client)
{
_MSG("Gif_close: destroy gif %p\n", gif);
a_Dicache_close(gif->url, gif->version, Client);
Gif_free(gif);
}
/* --- GIF Extensions ----------------------------------------------------- */
/*
* This reads a sequence of GIF data blocks.. and ignores them!
* Buf points to the first data block.
*
* Return Value
* 0 = There wasn't enough bytes read yet to read the whole datablock
* otherwise the size of the data blocks
*/
static inline size_t Gif_data_blocks(const uchar_t *Buf, size_t BSize)
{
size_t Size = 0;
if (BSize < 1)
return 0;
while (Buf[0]) {
if (BSize <= (size_t)(Buf[0] + 1))
return 0;
Size += Buf[0] + 1;
BSize -= Buf[0] + 1;
Buf += Buf[0] + 1;
}
return Size + 1;
}
/*
* This is a GIF extension. We ignore it with this routine.
* Buffer points to just after the extension label.
*
* Return Value
* 0 -- block not processed
* otherwise the size of the extension label.
*/
static inline size_t Gif_do_generic_ext(const uchar_t *Buf, size_t BSize)
{
size_t Size = Buf[0] + 1, DSize;
/* The Block size (the first byte) is supposed to be a specific size
* for each extension... we don't check.
*/
if (Buf[0] > BSize)
return 0;
DSize = Gif_data_blocks(Buf + Size, BSize - Size);
if (!DSize)
return 0;
Size += DSize;
return Size <= BSize ? Size : 0;
}
/*
* ?
*/
static inline size_t
Gif_do_gc_ext(DilloGif *gif, const uchar_t *Buf, size_t BSize)
{
/* Graphic Control Extension */
size_t Size = Buf[0] + 2;
uint_t Flags;
if (Size > BSize)
return 0;
Buf++;
Flags = Buf[0];
/* The packed fields */
#if 0
gif->disposal = (Buf[0] >> 2) & 0x7;
gif->inputFlag = (Buf[0] >> 1) & 0x1;
/* Delay time */
gif->delayTime = LM_to_uint(Buf[1], Buf[2]);
#endif
/* Transparent color index, may not be valid (unless flag is set) */
if ((Flags & 0x1)) {
gif->transparent = Buf[3];
}
return Size;
}
#define App_Ext (0xff)
#define Cmt_Ext (0xfe)
#define GC_Ext (0xf9)
#define Txt_Ext (0x01)
/*
* ?
* Return value:
* TRUE when the extension is over
*/
static size_t Gif_do_extension(DilloGif *gif, uint_t Label,
const uchar_t *buf,
size_t BSize)
{
switch (Label) {
case GC_Ext: /* Graphics extension */
return Gif_do_gc_ext(gif, buf, BSize);
case Cmt_Ext: /* Comment extension */
return Gif_data_blocks(buf, BSize);
case Txt_Ext: /* Plain text Extension */
case App_Ext: /* Application Extension */
default:
return Gif_do_generic_ext(buf, BSize); /*Ignore Extension */
}
}
/* --- General Image Decoder ----------------------------------------------- */
/* Here begins the new push-oriented decoder. */
/*
* ?
*/
static void Gif_lwz_init(DilloGif *gif)
{
gif->num_spill_lines_max = 1;
gif->spill_lines = dMalloc(sizeof(uchar_t *) * gif->num_spill_lines_max);
gif->spill_lines[0] = dMalloc(gif->Width);
gif->bits_in_window = 0;
/* First code in table = clear_code +1
* Last code in table = first code in table
* clear_code = (1<< input code size)
*/
gif->last_code = (1 << gif->input_code_size) + 1;
memset(gif->code_and_byte, 0,
(1 + gif->last_code) * sizeof(gif->code_and_byte[0]));
gif->code_size = gif->input_code_size + 1;
gif->line_index = 0;
}
/*
* Send the image line to the dicache, also handling the interlacing.
*/
static void Gif_emit_line(DilloGif *gif, const uchar_t *linebuf)
{
a_Dicache_write(gif->url, gif->version, linebuf, gif->y);
if (gif->Flags & INTERLACE) {
switch (gif->pass) {
case 0:
case 1:
gif->y += 8;
break;
case 2:
gif->y += 4;
break;
case 3:
gif->y += 2;
break;
}
if (gif->y >= gif->Height) {
gif->pass++;
switch (gif->pass) {
case 1:
gif->y = 4;
break;
case 2:
gif->y = 2;
break;
case 3:
gif->y = 1;
break;
default:
/* arriving here is an error in the input image. */
gif->y = 0;
break;
}
}
} else {
if (gif->y < gif->Height)
gif->y++;
}
}
/*
* Decode the packetized lwz bytes
*/
static void Gif_literal(DilloGif *gif, uint_t code)
{
gif->linebuf[gif->line_index++] = code;
if (gif->line_index >= gif->Width) {
Gif_emit_line(gif, gif->linebuf);
gif->line_index = 0;
}
gif->length[gif->last_code + 1] = 2;
gif->code_and_byte[gif->last_code + 1] = (code << 8);
gif->code_and_byte[gif->last_code] |= code;
}
/*
* ?
*/
/* Profiling reveals over half the GIF time is spent here: */
static void Gif_sequence(DilloGif *gif, uint_t code)
{
uint_t o_index, o_size, orig_code;
uint_t sequence_length = gif->length[code];
uint_t line_index = gif->line_index;
int num_spill_lines;
int spill_line_index = gif->spill_line_index;
uchar_t *last_byte_ptr, *obuf;
gif->length[gif->last_code + 1] = sequence_length + 1;
gif->code_and_byte[gif->last_code + 1] = (code << 8);
/* We're going to traverse the sequence backwards. Thus,
* we need to allocate spill lines if the sequence won't
* fit entirely within the present scan line. */
if (line_index + sequence_length <= gif->Width) {
num_spill_lines = 0;
obuf = gif->linebuf;
o_index = line_index + sequence_length;
o_size = sequence_length - 1;
} else {
num_spill_lines = (line_index + sequence_length - 1) /
gif->Width;
o_index = (line_index + sequence_length - 1) % gif->Width + 1;
if (num_spill_lines > gif->num_spill_lines_max) {
/* Allocate more spill lines. */
spill_line_index = gif->num_spill_lines_max;
gif->num_spill_lines_max = num_spill_lines << 1;
gif->spill_lines = dRealloc(gif->spill_lines,
gif->num_spill_lines_max *
sizeof(uchar_t *));
for (; spill_line_index < gif->num_spill_lines_max;
spill_line_index++)
gif->spill_lines[spill_line_index] =
dMalloc(gif->Width);
}
spill_line_index = num_spill_lines - 1;
obuf = gif->spill_lines[spill_line_index];
o_size = o_index;
}
gif->line_index = o_index; /* for afterwards */
/* for fixing up later if last_code == code */
orig_code = code;
last_byte_ptr = obuf + o_index - 1;
/* spill lines are allocated, and we are clear to
* write. This loop does not write the first byte of
* the sequence, however (last byte traversed). */
while (sequence_length > 1) {
sequence_length -= o_size;
/* Write o_size bytes to
* obuf[o_index - o_size..o_index). */
for (; o_size > 0 && o_index > 0; o_size--) {
uint_t code_and_byte = gif->code_and_byte[code];
_MSG("%d ", gif->code_and_byte[code] & 255);
obuf[--o_index] = code_and_byte & 255;
code = code_and_byte >> 8;
}
/* Prepare for writing to next line. */
if (o_index == 0) {
if (spill_line_index > 0) {
spill_line_index--;
obuf = gif->spill_lines[spill_line_index];
o_size = gif->Width;
} else {
obuf = gif->linebuf;
o_size = sequence_length - 1;
}
o_index = gif->Width;
}
}
/* Ok, now we write the first byte of the sequence. */
/* We are sure that the code is literal. */
_MSG("%d", code);
obuf[--o_index] = code;
gif->code_and_byte[gif->last_code] |= code;
/* Fix up the output if the original code was last_code. */
if (orig_code == gif->last_code) {
*last_byte_ptr = code;
_MSG(" fixed (%d)!", code);
}
_MSG("\n");
/* Output any full lines. */
if (gif->line_index >= gif->Width) {
Gif_emit_line(gif, gif->linebuf);
gif->line_index = 0;
}
if (num_spill_lines) {
if (gif->line_index)
Gif_emit_line(gif, gif->linebuf);
for (spill_line_index = 0;
spill_line_index < num_spill_lines - (gif->line_index ? 1 : 0);
spill_line_index++)
Gif_emit_line(gif, gif->spill_lines[spill_line_index]);
}
if (num_spill_lines) {
/* Swap the last spill line with the gif line, using
* linebuf as the swap temporary. */
uchar_t *linebuf = gif->spill_lines[num_spill_lines - 1];
gif->spill_lines[num_spill_lines - 1] = gif->linebuf;
gif->linebuf = linebuf;
}
gif->spill_line_index = spill_line_index;
}
/*
* ?
*
* Return Value:
* 2 -- quit
* 1 -- new last code needs to be done
* 0 -- okay, but reset the code table
* < 0 on error
* -1 if the decompression code was not in the lookup table
*/
static int Gif_process_code(DilloGif *gif, uint_t code, uint_t clear_code)
{
/* A short table describing what to do with the code:
* code < clear_code : This is uncompressed, raw data
* code== clear_code : Reset the decompression table
* code== clear_code+1: End of data stream
* code > clear_code+1: Compressed code; look up in table
*/
if (code < clear_code) {
/* a literal code. */
_MSG("literal\n");
Gif_literal(gif, code);
return 1;
} else if (code >= clear_code + 2) {
/* a sequence code. */
if (code > gif->last_code)
return -1;
Gif_sequence(gif, code);
return 1;
} else if (code == clear_code) {
/* clear code. Resets the whole table */
_MSG("clear\n");
return 0;
} else {
/* end code. */
_MSG("end\n");
return 2;
}
}
/*
* ?
*/
static int Gif_decode(DilloGif *gif, const uchar_t *buf, size_t bsize)
{
/*
* Data block processing. The image stuff is a series of data blocks.
* Each data block is 1 to 256 bytes long. The first byte is the length
* of the data block. 0 == the last data block.
*/
size_t bufsize, packet_size;
uint_t clear_code;
uint_t window;
int bits_in_window;
uint_t code;
int code_size;
uint_t code_mask;
bufsize = bsize;
/* Want to get all inner loop state into local variables. */
packet_size = gif->packet_size;
window = gif->window;
bits_in_window = gif->bits_in_window;
code_size = gif->code_size;
code_mask = (1 << code_size) - 1;
clear_code = 1 << gif->input_code_size;
/* If packet size == 0, we are at the start of a data block.
* The first byte of the data block indicates how big it is (0 == last
* datablock)
* packet size is set to this size; it indicates how much of the data block
* we have left to process.
*/
while (bufsize > 0) {
/* lwz_bytes is the number of remaining lwz bytes in the packet. */
int lwz_bytes = MIN(packet_size, bufsize);
bufsize -= lwz_bytes;
packet_size -= lwz_bytes;
for (; lwz_bytes > 0; lwz_bytes--) {
/* printf ("%d ", *buf) would print the depacketized lwz stream. */
/* Push the byte onto the "end" of the window (MSB). The low order
* bits always come first in the LZW stream. */
window = (window >> 8) | (*buf++ << 24);
bits_in_window += 8;
while (bits_in_window >= code_size) {
/* Extract the code. The code is code_size (3 to 12) bits long,
* at the start of the window */
code = (window >> (32 - bits_in_window)) & code_mask;
_MSG("code = %d, ", code);
bits_in_window -= code_size;
switch (Gif_process_code(gif, code, clear_code)) {
case 1: /* Increment last code */
gif->last_code++;
/*gif->code_and_byte[gif->last_code+1]=0; */
if ((gif->last_code & code_mask) == 0) {
if (gif->last_code == (1 << MAX_LWZ_BITS))
gif->last_code--;
else {
code_size++;
code_mask = (1 << code_size) - 1;
}
}
break;
case 0: /* Reset codes size and mask */
gif->last_code = clear_code + 1;
code_size = gif->input_code_size + 1;
code_mask = (1 << code_size) - 1;
break;
case 2: /* End code... consume remaining data chunks..? */
goto error; /* Could clean up better? */
default:
printf("dillo_gif_decode: error!\n");
goto error;
}
}
}
/* We reach here if
* a) We have reached the end of the data block;
* b) we ran out of data before reaching the end of the data block
*/
if (bufsize <= 0)
break; /* We are out of data; */
/* Start of new data block */
bufsize--;
if (!(packet_size = *buf++)) {
/* This is the "block terminator" -- the last data block */
gif->state = 999; /* BUG: should Go back to getting GIF blocks. */
break;
}
}
gif->packet_size = packet_size;
gif->window = window;
gif->bits_in_window = bits_in_window;
gif->code_size = code_size;
return bsize - bufsize;
error:
gif->state = 999;
return bsize - bufsize;
}
/*
* ?
*/
static int Gif_check_sig(DilloGif *gif, const uchar_t *ibuf, int ibsize)
{
/* at beginning of file - read magic number */
if (ibsize < 6)
return 0;
if (memcmp(ibuf, "GIF87a", 6) != 0 &&
memcmp(ibuf, "GIF89a", 6) != 0) {
MSG_WARN("\"%s\" is not a GIF file.\n", URL_STR(gif->url));
gif->state = 999;
return 6;
}
gif->state = 1;
return 6;
}
/* Read the color map
*
* Implements, from the spec:
* Global Color Table
* Local Color Table
*/
static inline size_t
Gif_do_color_table(DilloGif *gif, void *Buf,
const uchar_t *buf, size_t bsize, size_t CT_Size)
{
size_t Size = 3 * (1 << (1 + CT_Size));
if (Size > bsize)
return 0;
gif->ColorMap_ofs = (ulong_t) buf - (ulong_t) Buf;
gif->NumColors = (1 << (1 + CT_Size));
return Size;
}
/*
* This implements, from the spec:
* <Logical Screen> ::= Logical Screen Descriptor [Global Color Table]
*/
static size_t Gif_get_descriptor(DilloGif *gif, void *Buf,
const uchar_t *buf, int bsize)
{
/* screen descriptor */
size_t Size = 7, /* Size of descriptor */
mysize; /* Size of color table */
uchar_t Flags;
if (bsize < 7)
return 0;
Flags = buf[4];
if (Flags & LOCALCOLORMAP) {
mysize = Gif_do_color_table(
gif, Buf, buf + 7, (size_t)bsize - 7, Flags & (size_t)0x7);
if (!mysize)
return 0;
Size += mysize; /* Size of the color table that follows */
gif->Background = buf[5];
}
/* gif->Width = LM_to_uint(buf[0], buf[1]);
gif->Height = LM_to_uint(buf[2], buf[3]); */
gif->ColorResolution = (((buf[4] & 0x70) >> 3) + 1);
/* gif->AspectRatio = buf[6]; */
return Size;
}
/*
* This implements, from the spec:
* <Table-Based Image> ::= Image Descriptor [Local Color Table] Image Data
*
* ('Buf' points to just after the Image separator)
* we should probably just check that the local stuff is consistent
* with the stuff at the header. For now, we punt...
*/
static size_t Gif_do_img_desc(DilloGif *gif, void *Buf,
const uchar_t *buf, size_t bsize)
{
uchar_t Flags;
size_t Size = 9 + 1; /* image descriptor size + first byte of image data */
if (bsize < 10)
return 0;
gif->Width = LM_to_uint(buf[4], buf[5]);
gif->Height = LM_to_uint(buf[6], buf[7]);
/* check max image size */
if (gif->Width <= 0 || gif->Height <= 0 ||
gif->Width > IMAGE_MAX_AREA / gif->Height) {
MSG("Gif_do_img_desc: suspicious image size request %u x %u\n",
gif->Width, gif->Height);
gif->state = 999;
return 0;
}
a_Dicache_set_parms(gif->url, gif->version, gif->Image,
gif->Width, gif->Height, DILLO_IMG_TYPE_INDEXED);
Flags = buf[8];
gif->Flags |= Flags & INTERLACE;
gif->pass = 0;
bsize -= 9;
buf += 9;
if (Flags & LOCALCOLORMAP) {
size_t LSize = Gif_do_color_table(
gif, Buf, buf, bsize, Flags & (size_t)0x7);
if (!LSize)
return 0;
Size += LSize;
buf += LSize;
bsize -= LSize;
}
/* Finally, get the first byte of the LZW image data */
if (bsize < 1)
return 0;
gif->input_code_size = *buf++;
if (gif->input_code_size > 8) {
gif->state = 999;
return Size;
}
gif->y = 0;
Gif_lwz_init(gif);
gif->spill_line_index = 0;
gif->linebuf = dMalloc(gif->Width);
gif->state = 3; /*Process the lzw data next */
if (gif->Image && gif->ColorMap_ofs) {
a_Dicache_set_cmap(gif->url, gif->version, gif->Image,
(uchar_t *) Buf + gif->ColorMap_ofs,
gif->NumColors, 256, gif->transparent);
}
return Size;
}
/* --- Top level data block processors ------------------------------------ */
#define Img_Desc (0x2c)
#define Trailer (0x3B)
#define Ext_Id (0x21)
/*
* This identifies which kind of GIF blocks are next, and processes them.
* It returns if there isn't enough data to process the next blocks, or if
* the next block is the lzw data (which is streamed differently)
*
* This implements, from the spec, <Data>* Trailer
* <Data> ::= <Graphic Block> | <Special-Purpose Block>
* <Special-Purpose Block> ::= Application Extension | Comment Extension
* <Graphic Block> ::= [Graphic Control Extension] <Graphic-Rendering Block>
* <Graphic-Rendering Block> ::= <Table-Based Image> | Plain Text Extension
*
* <Data>* --> GIF_Block
* <Data> --> while (...)
* <Special-Purpose Block> --> Gif_do_extension
* Graphic Control Extension --> Gif_do_extension
* Plain Text Extension --> Gif_do_extension
* <Table-Based Image> --> Gif_do_img_desc
*
* Return Value
* 0 if not enough data is present, otherwise the number of bytes
* "consumed"
*/
static size_t GIF_Block(DilloGif * gif, void *Buf,
const uchar_t *buf, size_t bsize)
{
size_t Size = 0, mysize;
uchar_t C;
if (bsize < 1)
return 0;
while (gif->state == 2) {
if (bsize < 1)
return Size;
bsize--;
switch (*buf++) {
case Ext_Id:
/* get the extension type */
if (bsize < 2)
return Size;
/* Have the extension block intepreted. */
C = *buf++;
bsize--;
mysize = Gif_do_extension(gif, C, buf, bsize);
if (!mysize)
/* Not all of the extension is there.. quit until more data
* arrives */
return Size;
bsize -= mysize;
buf += mysize;
/* Increment the amount consumed by the extension introducer
* and id, and extension block size */
Size += mysize + 2;
/* Do more GIF Blocks */
continue;
case Img_Desc: /* Image descriptor */
mysize = Gif_do_img_desc(gif, Buf, buf, bsize);
if (!mysize)
return Size;
/* Increment the amount consumed by the Image Separator and the
* Resultant blocks */
Size += 1 + mysize;
return Size;
case Trailer:
gif->state = 999; /* BUG: should close the rest of the file */
return Size + 1;
break; /* GIF terminator */
default: /* Unknown */
/* gripe and complain */
MSG ("gif.c::GIF_Block: Error, 0x%x found\n", *(buf-1));
gif->state = 999;
return Size + 1;
}
}
return Size;
}
/*
* Process some bytes from the input gif stream. It's a state machine.
*
* From the GIF spec:
* <GIF Data Stream> ::= Header <Logical Screen> <Data>* Trailer
*
* <GIF Data Stream> --> Gif_process_bytes
* Header --> State 0
* <Logical Screen> --> State 1
* <Data>* --> State 2
* Trailer --> State > 3
*
* State == 3 is special... this is inside of <Data> but all of the stuff in
* there has been gotten and set up. So we stream it outside.
*/
static size_t Gif_process_bytes(DilloGif *gif, const uchar_t *ibuf,
int bufsize, void *Buf)
{
int tmp_bufsize = bufsize;
size_t mysize;
switch (gif->state) {
case 0:
mysize = Gif_check_sig(gif, ibuf, tmp_bufsize);
if (!mysize)
break;
tmp_bufsize -= mysize;
ibuf += mysize;
if (gif->state != 1)
break;
case 1:
mysize = Gif_get_descriptor(gif, Buf, ibuf, tmp_bufsize);
if (!mysize)
break;
tmp_bufsize -= mysize;
ibuf += mysize;
gif->state = 2;
case 2:
/* Ok, this loop construction looks weird. It implements the <Data>* of
* the GIF grammar. All sorts of stuff is allocated to set up for the
* decode part (state ==2) and then there is the actual decode part (3)
*/
mysize = GIF_Block(gif, Buf, ibuf, (size_t)tmp_bufsize);
if (!mysize)
break;
tmp_bufsize -= mysize;
ibuf += mysize;
if (gif->state != 3)
break;
case 3:
/* get an image byte */
/* The users sees all of this stuff */
mysize = Gif_decode(gif, ibuf, (size_t)tmp_bufsize);
if (mysize == 0)
break;
ibuf += mysize;
tmp_bufsize -= mysize;
default:
/* error - just consume all input */
tmp_bufsize = 0;
break;
}
_MSG("Gif_process_bytes: final state %d, %ld bytes consumed\n",
gif->state, (long)(bufsize - tmp_bufsize));
return bufsize - tmp_bufsize;
}
#else /* ENABLE_GIF */
void *a_Gif_new() { return 0; }
void a_Gif_callback() { return; }
#endif /* ENABLE_GIF */
|