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
|
/* Copyright (C) 2001-2019 Artifex Software, Inc.
All Rights Reserved.
This software is provided AS-IS with no warranty, either express or
implied.
This software is distributed under license and may not be copied,
modified or distributed except as expressly authorized under the terms
of the license contained in the file LICENSE in this distribution.
Refer to licensing information at http://www.artifex.com or contact
Artifex Software, Inc., 1305 Grant Avenue - Suite 200, Novato,
CA 94945, U.S.A., +1(415)492-9861, for further information.
*/
/* CCITTFax decoding filter */
#include "stdio_.h" /* includes std.h */
#include "memory_.h"
#include "gdebug.h"
#include "strimpl.h"
#include "scf.h"
#include "scfx.h"
/* ------ CCITTFaxDecode ------ */
private_st_CFD_state();
#define CFD_BUFFER_SLOP 4
static inline int
get_run(stream_CFD_state *ss, stream_cursor_read *pr, const cfd_node decode[],
int initial_bits, int min_bits, int *runlen, const char *str);
static inline int
invert_data(stream_CFD_state *ss, stream_cursor_read *pr, int *rlen, byte black_byte);
static inline int
skip_data(stream_CFD_state *ss, stream_cursor_read *pr, int rlen);
/* Set default parameter values. */
static void
s_CFD_set_defaults(register stream_state * st)
{
stream_CFD_state *const ss = (stream_CFD_state *) st;
s_CFD_set_defaults_inline(ss);
}
/* Initialize CCITTFaxDecode filter */
static int
s_CFD_init(stream_state * st)
{
stream_CFD_state *const ss = (stream_CFD_state *) st;
int raster = ss->raster =
ROUND_UP((ss->Columns + 7) >> 3, ss->DecodedByteAlign);
byte white = (ss->BlackIs1 ? 0 : 0xff);
s_hcd_init_inline(ss);
/* Because skip_white_pixels can look as many as 4 bytes ahead, */
/* we need to allow 4 extra bytes at the end of the row buffers. */
ss->lbuf = gs_alloc_bytes(st->memory, raster + CFD_BUFFER_SLOP, "CFD lbuf");
ss->lprev = 0;
if (ss->lbuf == 0)
return ERRC; /****** WRONG ******/
memset(ss->lbuf, white, raster);
memset(ss->lbuf + raster, 0xaa, CFD_BUFFER_SLOP); /* for Valgrind */
if (ss->K != 0) {
ss->lprev = gs_alloc_bytes(st->memory, raster + CFD_BUFFER_SLOP, "CFD lprev");
if (ss->lprev == 0)
return ERRC; /****** WRONG ******/
/* Clear the initial reference line for 2-D encoding. */
memset(ss->lprev, white, raster);
/* Ensure that the scan of the reference line will stop. */
memset(ss->lprev + raster, 0xaa, CFD_BUFFER_SLOP);
}
ss->k_left = min(ss->K, 0);
ss->run_color = 0;
ss->damaged_rows = 0;
ss->skipping_damage = false;
ss->cbit = 0;
ss->uncomp_run = 0;
ss->rows_left = (ss->Rows <= 0 || ss->EndOfBlock ? -1 : ss->Rows);
ss->row = 0;
ss->rpos = ss->wpos = -1;
ss->eol_count = 0;
ss->invert = white;
ss->min_left = 1;
return 0;
}
/* Release the filter. */
static void
s_CFD_release(stream_state * st)
{
stream_CFD_state *const ss = (stream_CFD_state *) st;
gs_free_object(st->memory, ss->lprev, "CFD lprev(close)");
gs_free_object(st->memory, ss->lbuf, "CFD lbuf(close)");
}
/* Declare the variables that hold the state. */
#define cfd_declare_state\
hcd_declare_state;\
register byte *q;\
int qbit
/* Load the state from the stream. */
#define cfd_load_state()\
hcd_load_state(),\
q = ss->lbuf + ss->wpos, qbit = ss->cbit
/* Store the state back in the stream. */
#define cfd_store_state()\
hcd_store_state(),\
ss->wpos = q - ss->lbuf, ss->cbit = qbit
/* Macros to get blocks of bits from the input stream. */
/* Invariants: 0 <= bits_left <= bits_size; */
/* bits [bits_left-1..0] contain valid data. */
#define avail_bits(n) hcd_bits_available(n)
#define ensure_bits(n, outl) hcd_ensure_bits(n, outl)
#define peek_bits(n) hcd_peek_bits(n)
#define peek_var_bits(n) hcd_peek_var_bits(n)
#define skip_bits(n) hcd_skip_bits(n)
/* Get a run from the stream. */
#ifdef DEBUG
# define IF_DEBUG(expr) expr
#else
# define IF_DEBUG(expr) DO_NOTHING
#endif
static inline int get_run(stream_CFD_state *ss, stream_cursor_read *pr, const cfd_node decode[],
int initial_bits, int min_bits, int *runlen, const char *str)
{
cfd_declare_state;
const cfd_node *np;
int clen;
cfd_load_state();
HCD_ENSURE_BITS_ELSE(initial_bits) {
/* We might still have enough bits for the specific code. */
if (bits_left < min_bits)
goto outl;
np = &decode[hcd_peek_bits_left() << (initial_bits - bits_left)];
if ((clen = np->code_length) > bits_left)
goto outl;
goto locl;
}
np = &decode[peek_bits(initial_bits)];
if ((clen = np->code_length) > initial_bits) {
IF_DEBUG(uint init_bits = peek_bits(initial_bits));
if (!avail_bits(clen)) goto outl;
clen -= initial_bits;
skip_bits(initial_bits);
ensure_bits(clen, outl); /* can't goto outl */
np = &decode[np->run_length + peek_var_bits(clen)];
if_debug4('W', "%s xcode=0x%x,%d rlen=%d\n", str,
(init_bits << np->code_length) +
peek_var_bits(np->code_length),
initial_bits + np->code_length,
np->run_length);
skip_bits(np->code_length);
} else {
locl:
if_debug4('W', "%s code=0x%x,%d rlen=%d\n", str,
peek_var_bits(clen), clen, np->run_length);
skip_bits(clen);
}
*runlen = np->run_length;
cfd_store_state();
return(0);
outl:
cfd_store_state();
return(-1);
}
/* Skip data bits for a white run. */
/* rlen is either less than 64, or a multiple of 64. */
static inline int skip_data(stream_CFD_state *ss, stream_cursor_read *pr, int rlen)
{
cfd_declare_state;
cfd_load_state();
(void)rlimit;
if ( (qbit -= rlen) < 0 )
{
q -= qbit >> 3, qbit &= 7;
if ( rlen >= 64 ) {
cfd_store_state();
return(-1);
}
}
cfd_store_state();
return(0);
}
/* Invert data bits for a black run. */
/* If rlen >= 64, execute makeup_action: this is to handle */
/* makeup codes efficiently, since these are always a multiple of 64. */
static inline int invert_data(stream_CFD_state *ss, stream_cursor_read *pr, int *rlen, byte black_byte)
{
cfd_declare_state;
cfd_load_state();
(void)rlimit;
if (q >= ss->lbuf + ss->raster + CFD_BUFFER_SLOP) {
return(-1);
}
if ( (*rlen) > qbit )
{
if (q + ((*rlen - qbit) >> 3) > ss->lbuf + ss->raster + CFD_BUFFER_SLOP) {
return(-1);
}
if (q >= ss->lbuf) {
*q++ ^= (1 << qbit) - 1;
}
else {
q++;
}
(*rlen) -= qbit;
switch ( (*rlen) >> 3 )
{
case 7: /* original rlen possibly >= 64 */
if ( (*rlen) + qbit >= 64 ) {
goto d;
}
*q++ = black_byte;
case 6: *q++ = black_byte;
case 5: *q++ = black_byte;
case 4: *q++ = black_byte;
case 3: *q++ = black_byte;
case 2: *q++ = black_byte;
case 1: *q = black_byte;
(*rlen) &= 7;
if ( !(*rlen) ) {
qbit = 0;
break;
}
q++;
case 0: /* know rlen != 0 */
qbit = 8 - (*rlen);
*q ^= 0xff << qbit;
break;
default: /* original rlen >= 64 */
d: memset(q, black_byte, (*rlen) >> 3);
q += (*rlen) >> 3;
(*rlen) &= 7;
if ( !(*rlen) ) {
qbit = 0;
q--;
}
else {
qbit = 8 - (*rlen);
*q ^= 0xff << qbit;
}
cfd_store_state();
return(-1);
}
}
else {
qbit -= (*rlen),
*q ^= ((1 << (*rlen)) - 1) << qbit;
}
cfd_store_state();
return(0);
}
/* Buffer refill for CCITTFaxDecode filter */
static int cf_decode_eol(stream_CFD_state *, stream_cursor_read *);
static int cf_decode_1d(stream_CFD_state *, stream_cursor_read *);
static int cf_decode_2d(stream_CFD_state *, stream_cursor_read *);
static int cf_decode_uncompressed(stream_CFD_state *, stream_cursor_read *);
static int
s_CFD_process(stream_state * st, stream_cursor_read * pr,
stream_cursor_write * pw, bool last)
{
stream_CFD_state *const ss = (stream_CFD_state *) st;
int wstop = ss->raster - 1;
int eol_count = ss->eol_count;
int k_left = ss->k_left;
int rows_left = ss->rows_left;
int status = 0;
#ifdef DEBUG
const byte *rstart = pr->ptr;
const byte *wstart = pw->ptr;
#endif
top:
#ifdef DEBUG
{
hcd_declare_state;
hcd_load_state();
(void)rlimit;
if_debug8m('w', ss->memory,
"[w]CFD_process top: eol_count=%d, k_left=%d, rows_left=%d\n"
" bits=0x%lx, bits_left=%d, read %u, wrote %u%s\n",
eol_count, k_left, rows_left,
(ulong) bits, bits_left,
(uint) (p - rstart), (uint) (pw->ptr - wstart),
(ss->skipping_damage ? ", skipping damage" : ""));
}
#endif
if (ss->skipping_damage) { /* Skip until we reach an EOL. */
hcd_declare_state;
int skip;
(void)rlimit;
status = 0;
do {
switch ((skip = cf_decode_eol(ss, pr))) {
default: /* not EOL */
hcd_load_state();
skip_bits(-skip);
hcd_store_state();
continue;
case 0: /* need more input */
goto out;
case 1: /* EOL */
{ /* Back up over the EOL. */
hcd_load_state();
bits_left += run_eol_code_length;
hcd_store_state();
}
ss->skipping_damage = false;
}
}
while (ss->skipping_damage);
ss->damaged_rows++;
}
/*
* Check for a completed input scan line. This isn't quite as
* simple as it seems, because we could have run out of input data
* between a makeup code and a 0-length termination code, or in a
* 2-D line before a final horizontal code with a 0-length second
* run. There's probably a way to think about this situation that
* doesn't require a special check, but I haven't found it yet.
*/
if (ss->wpos == wstop && ss->cbit <= (-ss->Columns & 7) &&
(k_left == 0 ? !(ss->run_color & ~1) : ss->run_color == 0)
) { /* Check for completed data to be copied to the client. */
/* (We could avoid the extra copy step for 1-D, but */
/* it's simpler not to, and it doesn't cost much.) */
if (ss->rpos < ss->wpos) {
stream_cursor_read cr;
cr.ptr = ss->lbuf + ss->rpos;
cr.limit = ss->lbuf + ss->wpos;
status = stream_move(&cr, pw);
ss->rpos = cr.ptr - ss->lbuf;
if (status)
goto out;
}
ss->row++;
if (rows_left > 0 && --rows_left == 0)
goto ck_eol; /* handle EOD if it is present */
if (ss->K != 0) {
byte *prev_bits = ss->lprev;
ss->lprev = ss->lbuf;
ss->lbuf = prev_bits;
if (ss->K > 0)
k_left = (k_left == 0 ? ss->K : k_left) - 1;
}
ss->rpos = ss->wpos = -1;
ss->eol_count = eol_count = 0;
ss->cbit = 0;
ss->invert = (ss->BlackIs1 ? 0 : 0xff);
memset(ss->lbuf, ss->invert, wstop + 1);
ss->run_color = 0;
/*
* If EndOfLine is true, we want to include the byte padding
* in the string of initial zeros in the EOL. If EndOfLine
* is false, we aren't sure what we should do....
*/
if (ss->EncodedByteAlign && !ss->EndOfLine)
ss->bits_left &= ~7;
}
/* If we're between scan lines, scan for EOLs. */
if (ss->wpos < 0) {
/*
* According to Adobe, the decoder should always check for
* the EOD sequence, regardless of EndOfBlock: the Red Book's
* documentation of EndOfBlock is wrong.
*/
ck_eol:
while ((status = cf_decode_eol(ss, pr)) > 0) {
if_debug0m('w', ss->memory, "[w]EOL\n");
/* If we are in a Group 3 mixed regime, */
/* check the next bit for 1- vs. 2-D. */
if (ss->K > 0) {
hcd_declare_state;
hcd_load_state();
ensure_bits(1, out); /* can't fail */
k_left = (peek_bits(1) ? 0 : 1);
skip_bits(1);
hcd_store_state();
}
++eol_count;
if (eol_count == (ss->K < 0 ? 2 : 6)) {
status = EOFC;
goto out;
}
}
if (rows_left == 0) {
status = EOFC;
goto out;
}
if (status == 0) /* input empty while scanning EOLs */
goto out;
switch (eol_count) {
case 0:
if (ss->EndOfLine) { /* EOL is required, but none is present. */
status = ERRC;
goto check;
}
case 1:
break;
default:
status = ERRC;
goto check;
}
}
/* Now decode actual data. */
if (k_left < 0) {
if_debug0m('w', ss->memory, "[w2]new row\n");
status = cf_decode_2d(ss, pr);
} else if (k_left == 0) {
if_debug0m('w', ss->memory, "[w1]new row\n");
status = cf_decode_1d(ss, pr);
} else {
if_debug1m('w', ss->memory, "[w1]new 2-D row, k_left=%d\n", k_left);
status = cf_decode_2d(ss, pr);
}
if_debug3m('w', ss->memory, "[w]CFD status = %d, wpos = %d, cbit = %d\n",
status, ss->wpos, ss->cbit);
check:switch (status) {
case 1: /* output full */
goto top;
case ERRC:
/* Check for special handling of damaged rows. */
if (ss->damaged_rows >= ss->DamagedRowsBeforeError ||
!(ss->EndOfLine && ss->K >= 0)
)
break;
/* Substitute undamaged data if appropriate. */
/****** NOT IMPLEMENTED YET ******/
{
ss->wpos = wstop;
ss->cbit = -ss->Columns & 7;
ss->run_color = 0;
}
ss->skipping_damage = true;
goto top;
default:
ss->damaged_rows = 0; /* finished a good row */
}
out:ss->k_left = k_left;
ss->rows_left = rows_left;
ss->eol_count = eol_count;
if (ss->ErrsAsEOD && status < 0)
return EOFC;
return status;
}
/*
* Decode a leading EOL, if any.
* If an EOL is present, skip over it and return 1;
* if no EOL is present, read no input and return -N, where N is the
* number of initial bits that can be skipped in the search for an EOL;
* if more input is needed, return 0.
* Note that if we detected an EOL, we know that we can back up over it;
* if we detected an N-bit non-EOL, we know that at least N bits of data
* are available in the buffer.
*/
static int
cf_decode_eol(stream_CFD_state * ss, stream_cursor_read * pr)
{
hcd_declare_state;
int zeros;
int look_ahead;
hcd_load_state();
for (zeros = 0; zeros < run_eol_code_length - 1; zeros++) {
ensure_bits(1, out);
if (peek_bits(1))
return -(zeros + 1);
skip_bits(1);
}
/* We definitely have an EOL. Skip further zero bits. */
look_ahead = (ss->K > 0 ? 2 : 1);
for (;;) {
ensure_bits(look_ahead, back);
if (peek_bits(1))
break;
skip_bits(1);
}
skip_bits(1);
hcd_store_state();
return 1;
back: /*
* We ran out of data while skipping zeros.
* We know we are at a byte boundary, and have just skipped
* at least run_eol_code_length - 1 zeros. However,
* bits_left may be 1 if look_ahead == 2.
*/
bits &= (1 << bits_left) - 1;
bits_left += run_eol_code_length - 1;
hcd_store_state();
out:return 0;
}
/* Decode a 1-D scan line. */
static int
cf_decode_1d(stream_CFD_state * ss, stream_cursor_read * pr)
{
cfd_declare_state;
byte black_byte = (ss->BlackIs1 ? 0xff : 0);
int end_bit = -ss->Columns & 7;
byte *stop = ss->lbuf - 1 + ss->raster;
int run_color = ss->run_color;
int status;
int bcnt;
(void)rlimit;
cfd_load_state();
if_debug1m('w', ss->memory, "[w1]entry run_color = %d\n", ss->run_color);
if (ss->run_color > 0)
goto db;
else
goto dw;
#define q_at_stop() (q >= stop && (qbit <= end_bit || q > stop))
top:run_color = 0;
if (q_at_stop())
goto done;
dw: /* Decode a white run. */
cfd_store_state();
status = get_run(ss, pr, cf_white_decode, cfd_white_initial_bits, cfd_white_min_bits,
&bcnt, "[w1]white");
cfd_load_state();
if (status < 0) {
goto out0;
}
if (bcnt < 0) { /* exceptional situation */
switch (bcnt) {
case run_uncompressed: /* Uncompressed data. */
cfd_store_state();
bcnt = cf_decode_uncompressed(ss, pr);
if (bcnt < 0)
return bcnt;
cfd_load_state();
if (bcnt)
goto db;
else
goto dw;
/*case run_error: */
/*case run_zeros: *//* Premature end-of-line. */
default:
status = ERRC;
goto out;
}
}
cfd_store_state();
status = skip_data(ss, pr, bcnt);
cfd_load_state();
if (status < 0) {
goto dwx;
}
if (q_at_stop()) {
run_color = 0; /* not inside a run */
goto done;
}
run_color = 1;
db: /* Decode a black run. */
cfd_store_state();
status = get_run(ss, pr, cf_black_decode, cfd_black_initial_bits, cfd_black_min_bits,
&bcnt, "[w1]black");
cfd_load_state();
if (status < 0) {
goto out1;
}
if (bcnt < 0) { /* All exceptional codes are invalid here. */
/****** WRONG, uncompressed IS ALLOWED ******/
status = ERRC;
goto out;
}
/* Invert bits designated by black run. */
cfd_store_state();
status = invert_data(ss, pr, &bcnt, black_byte);
cfd_load_state();
if (status < 0) {
goto dbx;
}
goto top;
dwx: /* If we run out of data after a makeup code, */
/* note that we are still processing a white run. */
run_color = -1;
goto dw;
dbx: /* If we run out of data after a makeup code, */
/* note that we are still processing a black run. */
run_color = 2;
goto db;
done:if (q > stop || qbit < end_bit)
status = ERRC;
else
status = 1;
out:cfd_store_state();
ss->run_color = run_color;
if_debug1m('w', ss->memory, "[w1]exit run_color = %d\n", run_color);
return status;
out0: /* We already set run_color to 0 or -1. */
status = 0;
goto out;
out1: /* We already set run_color to 1 or 2. */
status = 0;
goto out;
}
/* Decode a 2-D scan line. */
static int
cf_decode_2d(stream_CFD_state * ss, stream_cursor_read * pr)
{
cfd_declare_state;
byte invert_white = (ss->BlackIs1 ? 0 : 0xff);
byte black_byte = ~invert_white;
byte invert = ss->invert;
int end_count = -ss->Columns & 7;
uint raster = ss->raster;
byte *q0 = ss->lbuf;
byte *prev_q01 = ss->lprev + 1;
byte *endptr = q0 - 1 + raster;
int init_count = raster << 3;
register int count;
int rlen;
int status;
cfd_load_state();
count = ((endptr - q) << 3) + qbit;
endptr[1] = 0xa0; /* a byte with some 0s and some 1s, */
/* to ensure run scan will stop */
if_debug1m('W', ss->memory, "[w2]raster=%d\n", raster);
switch (ss->run_color) {
case -2:
ss->run_color = 0;
goto hww;
case -1:
ss->run_color = 0;
goto hbw;
case 1:
ss->run_color = 0;
goto hwb;
case 2:
ss->run_color = 0;
goto hbb;
/*case 0: */
}
top:if (count <= end_count) {
status = (count < end_count ? ERRC : 1);
goto out;
}
/* If invert == invert_white, white and black have their */
/* correct meanings; if invert == ~invert_white, */
/* black and white are interchanged. */
if_debug1m('W', ss->memory, "[w2]%4d:\n", count);
#ifdef DEBUG
/* Check the invariant between q, qbit, and count. */
{
int pcount = (endptr - q) * 8 + qbit;
if (pcount != count)
dmlprintf2(ss->memory, "[w2]Error: count=%d pcount=%d\n",
count, pcount);
}
#endif
/*
* We could just use get_run here, but we can do better. However,
* we must be careful to handle the case where the very last codes
* in the input stream are 1-bit "vertical 0" codes: we can't just
* use ensure_bits(3, ...) and go to get more data if it fails.
*/
ensure_bits(3, out3);
#define vertical_0 (countof(cf2_run_vertical) / 2)
switch (peek_bits(3)) {
default /*4..7*/ : /* vertical(0) */
v0: skip_bits(1);
rlen = vertical_0;
break;
case 2: /* vertical(+1) */
skip_bits(3);
rlen = vertical_0 + 1;
break;
case 3: /* vertical(-1) */
skip_bits(3);
rlen = vertical_0 - 1;
break;
case 1: /* horizontal */
skip_bits(3);
if (invert == invert_white)
goto hww;
else
goto hbb;
case 0: /* everything else */
cfd_store_state();
status = get_run(ss, pr, cf_2d_decode, cfd_2d_initial_bits, cfd_2d_min_bits,
&rlen, "[w2]");
cfd_load_state();
if (status < 0) {
goto out0;
}
/* rlen may be run2_pass, run_uncompressed, or */
/* 0..countof(cf2_run_vertical)-1. */
rlen_lt_zero:
if (rlen < 0)
switch (rlen) {
case run2_pass:
break;
case run_uncompressed:
{
int which;
cfd_store_state();
which = cf_decode_uncompressed(ss, pr);
if (which < 0) {
status = which;
goto out;
}
cfd_load_state();
/****** ADJUST count ******/
invert = (which ? ~invert_white : invert_white);
}
goto top;
default: /* run_error, run_zeros */
status = ERRC;
goto out;
}
}
/* Interpreting the run requires scanning the */
/* previous ('reference') line. */
{
int prev_count = count;
byte prev_data;
int dlen;
static const byte count_bit[8] =
{0x80, 1, 2, 4, 8, 0x10, 0x20, 0x40};
byte *prev_q = prev_q01 + (q - q0);
int plen;
if (!(count & 7))
prev_q++; /* because of skip macros */
prev_data = prev_q[-1] ^ invert;
/* Find the b1 transition. */
if ((prev_data & count_bit[prev_count & 7]) &&
(prev_count < init_count || invert != invert_white)
) { /* Look for changing white first. */
if_debug1m('W', ss->memory, " data=0x%x", prev_data);
skip_black_pixels(prev_data, prev_q,
prev_count, invert, plen);
if (prev_count < end_count) /* overshot */
prev_count = end_count;
if_debug1m('W', ss->memory, " b1 other=%d", prev_count);
}
if (prev_count != end_count) {
if_debug1m('W', ss->memory, " data=0x%x", prev_data);
skip_white_pixels(prev_data, prev_q,
prev_count, invert, plen);
if (prev_count < end_count) /* overshot */
prev_count = end_count;
if_debug1m('W', ss->memory, " b1 same=%d", prev_count);
}
/* b1 = prev_count; */
if (rlen == run2_pass) { /* Pass mode. Find b2. */
if (prev_count != end_count) {
if_debug1m('W', ss->memory, " data=0x%x", prev_data);
skip_black_pixels(prev_data, prev_q,
prev_count, invert, plen);
if (prev_count < end_count) /* overshot */
prev_count = end_count;
}
/* b2 = prev_count; */
if_debug2m('W', ss->memory, " b2=%d, pass %d\n",
prev_count, count - prev_count);
} else { /* Vertical coding. */
/* Remember that count counts *down*. */
prev_count += rlen - vertical_0; /* a1 */
if_debug2m('W', ss->memory, " vertical %d -> %d\n",
(int)(rlen - vertical_0), prev_count);
}
/* Now either invert or skip from count */
/* to prev_count, and reset count. */
if (invert == invert_white) { /* Skip data bits. */
q = endptr - (prev_count >> 3);
qbit = prev_count & 7;
} else { /* Invert data bits. */
dlen = count - prev_count;
cfd_store_state();
(void)invert_data(ss, pr, &dlen, black_byte);
cfd_load_state();
}
count = prev_count;
if (rlen >= 0) /* vertical mode */
invert = ~invert; /* polarity changes */
}
goto top;
out3:
if (bits_left > 0 && peek_bits(1)) {
/* This is a 1-bit "vertical 0" code, which we can still process. */
goto v0;
}
/* falls through */
out0:status = 0;
/* falls through */
out:cfd_store_state();
ss->invert = invert;
/* Ignore an error (missing EOFB/RTC when EndOfBlock == true) */
/* if we have finished all rows. */
if (status == ERRC && ss->Rows > 0 && ss->row > ss->Rows)
status = EOFC;
return status;
/*
* We handle horizontal decoding here, so that we can
* branch back into it if we run out of input data.
*/
/* White, then black. */
hww:
cfd_store_state();
status = get_run(ss, pr, cf_white_decode, cfd_white_initial_bits, cfd_white_min_bits,
&rlen, " white");
cfd_load_state();
if (status < 0) {
goto outww;
}
if ((count -= rlen) < end_count) {
status = ERRC;
goto out;
}
if (rlen < 0) goto rlen_lt_zero;
cfd_store_state();
status = skip_data(ss, pr, rlen);
cfd_load_state();
if (status < 0) {
goto hww;
}
/* Handle the second half of a white-black horizontal code. */
hwb:
cfd_store_state();
status = get_run(ss, pr, cf_black_decode, cfd_black_initial_bits, cfd_black_min_bits,
&rlen, " black");
cfd_load_state();
if (status < 0){
goto outwb;
}
if ((count -= rlen) < end_count) {
status = ERRC;
goto out;
}
if (rlen < 0) goto rlen_lt_zero;
cfd_store_state();
status = invert_data(ss, pr, &rlen, black_byte);
cfd_load_state();
if (status < 0) {
goto hwb;
}
goto top;
outww:ss->run_color = -2;
goto out0;
outwb:ss->run_color = 1;
goto out0;
/* Black, then white. */
hbb:
cfd_store_state();
status = get_run(ss, pr, cf_black_decode, cfd_black_initial_bits, cfd_black_min_bits,
&rlen, " black");
cfd_load_state();
if (status < 0) {
goto outbb;
}
if ((count -= rlen) < end_count) {
status = ERRC;
goto out;
}
if (rlen < 0) goto rlen_lt_zero;
cfd_store_state();
status = invert_data(ss, pr, &rlen, black_byte);
cfd_load_state();
if (status < 0) {
goto hbb;
}
/* Handle the second half of a black-white horizontal code. */
hbw:
cfd_store_state();
status = get_run(ss, pr, cf_white_decode, cfd_white_initial_bits, cfd_white_min_bits,
&rlen, " white");
cfd_load_state();
if (status < 0) {
goto outbw;
}
if ((count -= rlen) < end_count) {
status = ERRC;
goto out;
}
if (rlen < 0) goto rlen_lt_zero;
cfd_store_state();
status = skip_data(ss, pr, rlen);
cfd_load_state();
if (status < 0) {
goto hbw;
}
goto top;
outbb:ss->run_color = 2;
goto out0;
outbw:ss->run_color = -1;
goto out0;
}
#if 1 /*************** */
static int
cf_decode_uncompressed(stream_CFD_state * ss, stream_cursor_read * pr)
{
return ERRC;
}
#else /*************** */
/* Decode uncompressed data. */
/* (Not tested: no sample data available!) */
/****** DOESN'T CHECK FOR OVERFLOWING SCAN LINE ******/
static int
cf_decode_uncompressed(stream * s)
{
cfd_declare_state;
const cfd_node *np;
int clen, rlen;
cfd_load_state();
while (1) {
ensure_bits(cfd_uncompressed_initial_bits, NOOUT);
np = &cf_uncompressed_decode[peek_bits(cfd_uncompressed_initial_bits)];
clen = np->code_length;
rlen = np->run_length;
if (clen > cfd_uncompressed_initial_bits) { /* Must be an exit code. */
break;
}
if (rlen == cfd_uncompressed_initial_bits) { /* Longest representable white run */
if_debug1m('W', s->memory, "[wu]%d\n", rlen);
if ((qbit -= cfd_uncompressed_initial_bits) < 0)
qbit += 8, q++;
} else {
if_debug1m('W', s->memory, "[wu]%d+1\n", rlen);
if (qbit -= rlen < 0)
qbit += 8, q++;
*q ^= 1 << qbit;
}
skip_bits(clen);
}
clen -= cfd_uncompressed_initial_bits;
skip_bits(cfd_uncompressed_initial_bits);
ensure_bits(clen, NOOUT);
np = &cf_uncompressed_decode[rlen + peek_var_bits(clen)];
rlen = np->run_length;
skip_bits(np->code_length);
if_debug1m('w', s->memory, "[wu]exit %d\n", rlen);
if (rlen >= 0) { /* Valid exit code, rlen = 2 * run length + next polarity */
if ((qbit -= rlen >> 1) < 0)
qbit += 8, q++;
rlen &= 1;
}
out: /******* WRONG ******/
cfd_store_state();
return rlen;
}
#endif /*************** */
/* Stream template */
const stream_template s_CFD_template =
{&st_CFD_state, s_CFD_init, s_CFD_process, 1, 1, s_CFD_release,
s_CFD_set_defaults
};
|