Coverage Report

Created: 2025-06-13 06:29

/src/gdal/build/frmts/jpeg/libjpeg12/jcphuff12.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * jcphuff.c
3
 *
4
 * Copyright (C) 1995-1997, Thomas G. Lane.
5
 * This file is part of the Independent JPEG Group's software.
6
 * For conditions of distribution and use, see the accompanying README file.
7
 *
8
 * This file contains Huffman entropy encoding routines for progressive JPEG.
9
 *
10
 * We do not support output suspension in this module, since the library
11
 * currently does not allow multiple-scan files to be written with output
12
 * suspension.
13
 */
14
15
#define JPEG_INTERNALS
16
#include "jinclude.h"
17
#include "jpeglib.h"
18
#include "jchuff.h"   /* Declarations shared with jchuff.c */
19
20
#ifdef C_PROGRESSIVE_SUPPORTED
21
22
/* Expanded entropy encoder object for progressive Huffman encoding. */
23
24
typedef struct {
25
  struct jpeg_entropy_encoder pub; /* public fields */
26
27
  /* Mode flag: TRUE for optimization, FALSE for actual data output */
28
  boolean gather_statistics;
29
30
  /* Bit-level coding status.
31
   * next_output_byte/free_in_buffer are local copies of cinfo->dest fields.
32
   */
33
  JOCTET * next_output_byte;  /* => next byte to write in buffer */
34
  size_t free_in_buffer;  /* # of byte spaces remaining in buffer */
35
  unsigned int put_buffer;    /* current bit-accumulation buffer */
36
  int put_bits;     /* # of bits now in it */
37
  j_compress_ptr cinfo;   /* link to cinfo (needed for dump_buffer) */
38
39
  /* Coding status for DC components */
40
  int last_dc_val[MAX_COMPS_IN_SCAN]; /* last DC coef for each component */
41
42
  /* Coding status for AC components */
43
  int ac_tbl_no;    /* the table number of the single component */
44
  unsigned int EOBRUN;    /* run length of EOBs */
45
  unsigned int BE;    /* # of buffered correction bits before MCU */
46
  char * bit_buffer;    /* buffer for correction bits (1 per char) */
47
  /* packing correction bits tightly would save some space but cost time... */
48
49
  unsigned int restarts_to_go;  /* MCUs left in this restart interval */
50
  int next_restart_num;   /* next restart number to write (0-7) */
51
52
  /* Pointers to derived tables (these workspaces have image lifespan).
53
   * Since any one scan codes only DC or only AC, we only need one set
54
   * of tables, not one for DC and one for AC.
55
   */
56
  c_derived_tbl * derived_tbls[NUM_HUFF_TBLS];
57
58
  /* Statistics tables for optimization; again, one set is enough */
59
  long * count_ptrs[NUM_HUFF_TBLS];
60
} phuff_entropy_encoder;
61
62
typedef phuff_entropy_encoder * phuff_entropy_ptr;
63
64
/* MAX_CORR_BITS is the number of bits the AC refinement correction-bit
65
 * buffer can hold.  Larger sizes may slightly improve compression, but
66
 * 1000 is already well into the realm of overkill.
67
 * The minimum safe size is 64 bits.
68
 */
69
70
0
#define MAX_CORR_BITS  1000  /* Max # of correction bits I can buffer */
71
72
/* IRIGHT_SHIFT is like RIGHT_SHIFT, but works on int rather than INT32.
73
 * We assume that int right shift is unsigned if INT32 right shift is,
74
 * which should be safe.
75
 */
76
77
#ifdef RIGHT_SHIFT_IS_UNSIGNED
78
#define ISHIFT_TEMPS  int ishift_temp;
79
#define IRIGHT_SHIFT(x,shft)  \
80
  ((ishift_temp = (x)) < 0 ? \
81
   (ishift_temp >> (shft)) | ((~0) << (16-(shft))) : \
82
   (ishift_temp >> (shft)))
83
#else
84
#define ISHIFT_TEMPS
85
0
#define IRIGHT_SHIFT(x,shft)  ((x) >> (shft))
86
#endif
87
88
/* Forward declarations */
89
METHODDEF(boolean) encode_mcu_DC_first JPP((j_compress_ptr cinfo,
90
              JBLOCKROW *MCU_data));
91
METHODDEF(boolean) encode_mcu_AC_first JPP((j_compress_ptr cinfo,
92
              JBLOCKROW *MCU_data));
93
METHODDEF(boolean) encode_mcu_DC_refine JPP((j_compress_ptr cinfo,
94
               JBLOCKROW *MCU_data));
95
METHODDEF(boolean) encode_mcu_AC_refine JPP((j_compress_ptr cinfo,
96
               JBLOCKROW *MCU_data));
97
METHODDEF(void) finish_pass_phuff JPP((j_compress_ptr cinfo));
98
METHODDEF(void) finish_pass_gather_phuff JPP((j_compress_ptr cinfo));
99
100
101
/*
102
 * Initialize for a Huffman-compressed scan using progressive JPEG.
103
 */
104
105
METHODDEF(void)
106
start_pass_phuff (j_compress_ptr cinfo, boolean gather_statistics)
107
0
{  
108
0
  phuff_entropy_ptr entropy = (phuff_entropy_ptr) cinfo->entropy;
109
0
  boolean is_DC_band;
110
0
  int ci, tbl;
111
0
  jpeg_component_info * compptr;
112
113
0
  entropy->cinfo = cinfo;
114
0
  entropy->gather_statistics = gather_statistics;
115
116
0
  is_DC_band = (cinfo->Ss == 0);
117
118
  /* We assume jcmaster.c already validated the scan parameters. */
119
120
  /* Select execution routines */
121
0
  if (cinfo->Ah == 0) {
122
0
    if (is_DC_band)
123
0
      entropy->pub.encode_mcu = encode_mcu_DC_first;
124
0
    else
125
0
      entropy->pub.encode_mcu = encode_mcu_AC_first;
126
0
  } else {
127
0
    if (is_DC_band)
128
0
      entropy->pub.encode_mcu = encode_mcu_DC_refine;
129
0
    else {
130
0
      entropy->pub.encode_mcu = encode_mcu_AC_refine;
131
      /* AC refinement needs a correction bit buffer */
132
0
      if (entropy->bit_buffer == NULL)
133
0
  entropy->bit_buffer = (char *)
134
0
    (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
135
0
              MAX_CORR_BITS * SIZEOF(char));
136
0
    }
137
0
  }
138
0
  if (gather_statistics)
139
0
    entropy->pub.finish_pass = finish_pass_gather_phuff;
140
0
  else
141
0
    entropy->pub.finish_pass = finish_pass_phuff;
142
143
  /* Only DC coefficients may be interleaved, so cinfo->comps_in_scan = 1
144
   * for AC coefficients.
145
   */
146
0
  for (ci = 0; ci < cinfo->comps_in_scan; ci++) {
147
0
    compptr = cinfo->cur_comp_info[ci];
148
    /* Initialize DC predictions to 0 */
149
0
    entropy->last_dc_val[ci] = 0;
150
    /* Get table index */
151
0
    if (is_DC_band) {
152
0
      if (cinfo->Ah != 0) /* DC refinement needs no table */
153
0
  continue;
154
0
      tbl = compptr->dc_tbl_no;
155
0
    } else {
156
0
      entropy->ac_tbl_no = tbl = compptr->ac_tbl_no;
157
0
    }
158
0
    if (gather_statistics) {
159
      /* Check for invalid table index */
160
      /* (make_c_derived_tbl does this in the other path) */
161
0
      if (tbl < 0 || tbl >= NUM_HUFF_TBLS)
162
0
        ERREXIT1(cinfo, JERR_NO_HUFF_TABLE, tbl);
163
      /* Allocate and zero the statistics tables */
164
      /* Note that jpeg_gen_optimal_table expects 257 entries in each table! */
165
0
      if (entropy->count_ptrs[tbl] == NULL)
166
0
  entropy->count_ptrs[tbl] = (long *)
167
0
    (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
168
0
              257 * SIZEOF(long));
169
0
      MEMZERO(entropy->count_ptrs[tbl], 257 * SIZEOF(long));
170
0
    } else {
171
      /* Compute derived values for Huffman table */
172
      /* We may do this more than once for a table, but it's not expensive */
173
0
      jpeg_make_c_derived_tbl(cinfo, is_DC_band, tbl,
174
0
            & entropy->derived_tbls[tbl]);
175
0
    }
176
0
  }
177
178
  /* Initialize AC stuff */
179
0
  entropy->EOBRUN = 0;
180
0
  entropy->BE = 0;
181
182
  /* Initialize bit buffer to empty */
183
0
  entropy->put_buffer = 0;
184
0
  entropy->put_bits = 0;
185
186
  /* Initialize restart stuff */
187
0
  entropy->restarts_to_go = cinfo->restart_interval;
188
0
  entropy->next_restart_num = 0;
189
0
}
190
191
192
/* Outputting bytes to the file.
193
 * NB: these must be called only when actually outputting,
194
 * that is, entropy->gather_statistics == FALSE.
195
 */
196
197
/* Emit a byte */
198
#define emit_byte(entropy,val)  \
199
0
  { *(entropy)->next_output_byte++ = (JOCTET) (val);  \
200
0
    if (--(entropy)->free_in_buffer == 0)  \
201
0
      dump_buffer(entropy); }
202
203
204
LOCAL(void)
205
dump_buffer (phuff_entropy_ptr entropy)
206
/* Empty the output buffer; we do not support suspension in this module. */
207
0
{
208
0
  struct jpeg_destination_mgr * dest = entropy->cinfo->dest;
209
210
0
  if (! (*dest->empty_output_buffer) (entropy->cinfo))
211
0
    ERREXIT(entropy->cinfo, JERR_CANT_SUSPEND);
212
  /* After a successful buffer dump, must reset buffer pointers */
213
0
  entropy->next_output_byte = dest->next_output_byte;
214
0
  entropy->free_in_buffer = dest->free_in_buffer;
215
0
}
216
217
218
/* Outputting bits to the file */
219
220
/* Only the right 24 bits of put_buffer are used; the valid bits are
221
 * left-justified in this part.  At most 16 bits can be passed to emit_bits
222
 * in one call, and we never retain more than 7 bits in put_buffer
223
 * between calls, so 24 bits are sufficient.
224
 */
225
226
INLINE
227
LOCAL(void)
228
emit_bits (phuff_entropy_ptr entropy, unsigned int code, int size)
229
/* Emit some bits, unless we are in gather mode */
230
0
{
231
  /* This routine is heavily used, so it's worth coding tightly. */
232
0
  register unsigned int put_buffer = code;
233
0
  register int put_bits = entropy->put_bits;
234
235
  /* if size is 0, caller used an invalid Huffman table entry */
236
0
  if (size == 0)
237
0
    ERREXIT(entropy->cinfo, JERR_HUFF_MISSING_CODE);
238
239
0
  if (entropy->gather_statistics)
240
0
    return;     /* do nothing if we're only getting stats */
241
242
0
  put_buffer &= (((INT32) 1)<<size) - 1; /* mask off any extra bits in code */
243
  
244
0
  put_bits += size;   /* new number of bits in buffer */
245
  
246
0
  put_buffer <<= 24 - put_bits; /* align incoming bits */
247
248
0
  put_buffer |= entropy->put_buffer; /* and merge with old buffer contents */
249
250
0
  while (put_bits >= 8) {
251
0
    int c = (int) ((put_buffer >> 16) & 0xFF);
252
    
253
0
    emit_byte(entropy, c);
254
0
    if (c == 0xFF) {   /* need to stuff a zero byte? */
255
0
      emit_byte(entropy, 0);
256
0
    }
257
0
    put_buffer <<= 8;
258
0
    put_bits -= 8;
259
0
  }
260
261
0
  entropy->put_buffer = put_buffer; /* update variables */
262
0
  entropy->put_bits = put_bits;
263
0
}
264
265
266
LOCAL(void)
267
flush_bits (phuff_entropy_ptr entropy)
268
0
{
269
0
  emit_bits(entropy, 0x7F, 7); /* fill any partial byte with ones */
270
0
  entropy->put_buffer = 0;     /* and reset bit-buffer to empty */
271
0
  entropy->put_bits = 0;
272
0
}
273
274
275
/*
276
 * Emit (or just count) a Huffman symbol.
277
 */
278
279
INLINE
280
LOCAL(void)
281
emit_symbol (phuff_entropy_ptr entropy, int tbl_no, int symbol)
282
0
{
283
0
  if (entropy->gather_statistics)
284
0
    entropy->count_ptrs[tbl_no][symbol]++;
285
0
  else {
286
0
    c_derived_tbl * tbl = entropy->derived_tbls[tbl_no];
287
0
    emit_bits(entropy, tbl->ehufco[symbol], tbl->ehufsi[symbol]);
288
0
  }
289
0
}
290
291
292
/*
293
 * Emit bits from a correction bit buffer.
294
 */
295
296
LOCAL(void)
297
emit_buffered_bits (phuff_entropy_ptr entropy, char * bufstart,
298
        unsigned int nbits)
299
0
{
300
0
  if (entropy->gather_statistics)
301
0
    return;     /* no real work */
302
303
0
  while (nbits > 0) {
304
0
    emit_bits(entropy, (unsigned int) (*bufstart), 1);
305
0
    bufstart++;
306
0
    nbits--;
307
0
  }
308
0
}
309
310
311
/*
312
 * Emit any pending EOBRUN symbol.
313
 */
314
315
LOCAL(void)
316
emit_eobrun (phuff_entropy_ptr entropy)
317
0
{
318
0
  register int temp, nbits;
319
320
0
  if (entropy->EOBRUN > 0) { /* if there is any pending EOBRUN */
321
0
    temp = entropy->EOBRUN;
322
0
    nbits = 0;
323
0
    while ((temp >>= 1))
324
0
      nbits++;
325
    /* safety check: shouldn't happen given limited correction-bit buffer */
326
0
    if (nbits > 14)
327
0
      ERREXIT(entropy->cinfo, JERR_HUFF_MISSING_CODE);
328
329
0
    emit_symbol(entropy, entropy->ac_tbl_no, nbits << 4);
330
0
    if (nbits)
331
0
      emit_bits(entropy, entropy->EOBRUN, nbits);
332
333
0
    entropy->EOBRUN = 0;
334
335
    /* Emit any buffered correction bits */
336
0
    emit_buffered_bits(entropy, entropy->bit_buffer, entropy->BE);
337
0
    entropy->BE = 0;
338
0
  }
339
0
}
340
341
342
/*
343
 * Emit a restart marker & resynchronize predictions.
344
 */
345
346
LOCAL(void)
347
emit_restart (phuff_entropy_ptr entropy, int restart_num)
348
0
{
349
0
  int ci;
350
351
0
  emit_eobrun(entropy);
352
353
0
  if (! entropy->gather_statistics) {
354
0
    flush_bits(entropy);
355
0
    emit_byte(entropy, 0xFF);
356
0
    emit_byte(entropy, JPEG_RST0 + restart_num);
357
0
  }
358
359
0
  if (entropy->cinfo->Ss == 0) {
360
    /* Re-initialize DC predictions to 0 */
361
0
    for (ci = 0; ci < entropy->cinfo->comps_in_scan; ci++)
362
0
      entropy->last_dc_val[ci] = 0;
363
0
  } else {
364
    /* Re-initialize all AC-related fields to 0 */
365
0
    entropy->EOBRUN = 0;
366
0
    entropy->BE = 0;
367
0
  }
368
0
}
369
370
371
/*
372
 * MCU encoding for DC initial scan (either spectral selection,
373
 * or first pass of successive approximation).
374
 */
375
376
METHODDEF(boolean)
377
encode_mcu_DC_first (j_compress_ptr cinfo, JBLOCKROW *MCU_data)
378
0
{
379
0
  phuff_entropy_ptr entropy = (phuff_entropy_ptr) cinfo->entropy;
380
0
  register int temp, temp2;
381
0
  register int nbits;
382
0
  int blkn, ci;
383
0
  int Al = cinfo->Al;
384
0
  JBLOCKROW block;
385
0
  jpeg_component_info * compptr;
386
0
  ISHIFT_TEMPS
387
388
0
  entropy->next_output_byte = cinfo->dest->next_output_byte;
389
0
  entropy->free_in_buffer = cinfo->dest->free_in_buffer;
390
391
  /* Emit restart marker if needed */
392
0
  if (cinfo->restart_interval)
393
0
    if (entropy->restarts_to_go == 0)
394
0
      emit_restart(entropy, entropy->next_restart_num);
395
396
  /* Encode the MCU data blocks */
397
0
  for (blkn = 0; blkn < cinfo->blocks_in_MCU; blkn++) {
398
0
    block = MCU_data[blkn];
399
0
    ci = cinfo->MCU_membership[blkn];
400
0
    compptr = cinfo->cur_comp_info[ci];
401
402
    /* Compute the DC value after the required point transform by Al.
403
     * This is simply an arithmetic right shift.
404
     */
405
0
    temp2 = IRIGHT_SHIFT((int) ((*block)[0]), Al);
406
407
    /* DC differences are figured on the point-transformed values. */
408
0
    temp = temp2 - entropy->last_dc_val[ci];
409
0
    entropy->last_dc_val[ci] = temp2;
410
411
    /* Encode the DC coefficient difference per section G.1.2.1 */
412
0
    temp2 = temp;
413
0
    if (temp < 0) {
414
0
      temp = -temp;   /* temp is abs value of input */
415
      /* For a negative input, want temp2 = bitwise complement of abs(input) */
416
      /* This code assumes we are on a two's complement machine */
417
0
      temp2--;
418
0
    }
419
    
420
    /* Find the number of bits needed for the magnitude of the coefficient */
421
0
    nbits = 0;
422
0
    while (temp) {
423
0
      nbits++;
424
0
      temp >>= 1;
425
0
    }
426
    /* Check for out-of-range coefficient values.
427
     * Since we're encoding a difference, the range limit is twice as much.
428
     */
429
0
    if (nbits > MAX_COEF_BITS+1)
430
0
      ERREXIT(cinfo, JERR_BAD_DCT_COEF);
431
    
432
    /* Count/emit the Huffman-coded symbol for the number of bits */
433
0
    emit_symbol(entropy, compptr->dc_tbl_no, nbits);
434
    
435
    /* Emit that number of bits of the value, if positive, */
436
    /* or the complement of its magnitude, if negative. */
437
0
    if (nbits)     /* emit_bits rejects calls with size 0 */
438
0
      emit_bits(entropy, (unsigned int) temp2, nbits);
439
0
  }
440
441
0
  cinfo->dest->next_output_byte = entropy->next_output_byte;
442
0
  cinfo->dest->free_in_buffer = entropy->free_in_buffer;
443
444
  /* Update restart-interval state too */
445
0
  if (cinfo->restart_interval) {
446
0
    if (entropy->restarts_to_go == 0) {
447
0
      entropy->restarts_to_go = cinfo->restart_interval;
448
0
      entropy->next_restart_num++;
449
0
      entropy->next_restart_num &= 7;
450
0
    }
451
0
    entropy->restarts_to_go--;
452
0
  }
453
454
0
  return TRUE;
455
0
}
456
457
458
/*
459
 * MCU encoding for AC initial scan (either spectral selection,
460
 * or first pass of successive approximation).
461
 */
462
463
METHODDEF(boolean)
464
encode_mcu_AC_first (j_compress_ptr cinfo, JBLOCKROW *MCU_data)
465
0
{
466
0
  phuff_entropy_ptr entropy = (phuff_entropy_ptr) cinfo->entropy;
467
0
  register int temp, temp2;
468
0
  register int nbits;
469
0
  register int r, k;
470
0
  int Se = cinfo->Se;
471
0
  int Al = cinfo->Al;
472
0
  JBLOCKROW block;
473
474
0
  entropy->next_output_byte = cinfo->dest->next_output_byte;
475
0
  entropy->free_in_buffer = cinfo->dest->free_in_buffer;
476
477
  /* Emit restart marker if needed */
478
0
  if (cinfo->restart_interval)
479
0
    if (entropy->restarts_to_go == 0)
480
0
      emit_restart(entropy, entropy->next_restart_num);
481
482
  /* Encode the MCU data block */
483
0
  block = MCU_data[0];
484
485
  /* Encode the AC coefficients per section G.1.2.2, fig. G.3 */
486
  
487
0
  r = 0;      /* r = run length of zeros */
488
   
489
0
  for (k = cinfo->Ss; k <= Se; k++) {
490
0
    if ((temp = (*block)[jpeg_natural_order[k]]) == 0) {
491
0
      r++;
492
0
      continue;
493
0
    }
494
    /* We must apply the point transform by Al.  For AC coefficients this
495
     * is an integer division with rounding towards 0.  To do this portably
496
     * in C, we shift after obtaining the absolute value; so the code is
497
     * interwoven with finding the abs value (temp) and output bits (temp2).
498
     */
499
0
    if (temp < 0) {
500
0
      temp = -temp;   /* temp is abs value of input */
501
0
      temp >>= Al;    /* apply the point transform */
502
      /* For a negative coef, want temp2 = bitwise complement of abs(coef) */
503
0
      temp2 = ~temp;
504
0
    } else {
505
0
      temp >>= Al;    /* apply the point transform */
506
0
      temp2 = temp;
507
0
    }
508
    /* Watch out for case that nonzero coef is zero after point transform */
509
0
    if (temp == 0) {
510
0
      r++;
511
0
      continue;
512
0
    }
513
514
    /* Emit any pending EOBRUN */
515
0
    if (entropy->EOBRUN > 0)
516
0
      emit_eobrun(entropy);
517
    /* if run length > 15, must emit special run-length-16 codes (0xF0) */
518
0
    while (r > 15) {
519
0
      emit_symbol(entropy, entropy->ac_tbl_no, 0xF0);
520
0
      r -= 16;
521
0
    }
522
523
    /* Find the number of bits needed for the magnitude of the coefficient */
524
0
    nbits = 1;      /* there must be at least one 1 bit */
525
0
    while ((temp >>= 1))
526
0
      nbits++;
527
    /* Check for out-of-range coefficient values */
528
0
    if (nbits > MAX_COEF_BITS)
529
0
      ERREXIT(cinfo, JERR_BAD_DCT_COEF);
530
531
    /* Count/emit Huffman symbol for run length / number of bits */
532
0
    emit_symbol(entropy, entropy->ac_tbl_no, (r << 4) + nbits);
533
534
    /* Emit that number of bits of the value, if positive, */
535
    /* or the complement of its magnitude, if negative. */
536
0
    emit_bits(entropy, (unsigned int) temp2, nbits);
537
538
0
    r = 0;      /* reset zero run length */
539
0
  }
540
541
0
  if (r > 0) {     /* If there are trailing zeroes, */
542
0
    entropy->EOBRUN++;    /* count an EOB */
543
0
    if (entropy->EOBRUN == 0x7FFF)
544
0
      emit_eobrun(entropy); /* force it out to avoid overflow */
545
0
  }
546
547
0
  cinfo->dest->next_output_byte = entropy->next_output_byte;
548
0
  cinfo->dest->free_in_buffer = entropy->free_in_buffer;
549
550
  /* Update restart-interval state too */
551
0
  if (cinfo->restart_interval) {
552
0
    if (entropy->restarts_to_go == 0) {
553
0
      entropy->restarts_to_go = cinfo->restart_interval;
554
0
      entropy->next_restart_num++;
555
0
      entropy->next_restart_num &= 7;
556
0
    }
557
0
    entropy->restarts_to_go--;
558
0
  }
559
560
0
  return TRUE;
561
0
}
562
563
564
/*
565
 * MCU encoding for DC successive approximation refinement scan.
566
 * Note: we assume such scans can be multi-component, although the spec
567
 * is not very clear on the point.
568
 */
569
570
METHODDEF(boolean)
571
encode_mcu_DC_refine (j_compress_ptr cinfo, JBLOCKROW *MCU_data)
572
0
{
573
0
  phuff_entropy_ptr entropy = (phuff_entropy_ptr) cinfo->entropy;
574
0
  register int temp;
575
0
  int blkn;
576
0
  int Al = cinfo->Al;
577
0
  JBLOCKROW block;
578
579
0
  entropy->next_output_byte = cinfo->dest->next_output_byte;
580
0
  entropy->free_in_buffer = cinfo->dest->free_in_buffer;
581
582
  /* Emit restart marker if needed */
583
0
  if (cinfo->restart_interval)
584
0
    if (entropy->restarts_to_go == 0)
585
0
      emit_restart(entropy, entropy->next_restart_num);
586
587
  /* Encode the MCU data blocks */
588
0
  for (blkn = 0; blkn < cinfo->blocks_in_MCU; blkn++) {
589
0
    block = MCU_data[blkn];
590
591
    /* We simply emit the Al'th bit of the DC coefficient value. */
592
0
    temp = (*block)[0];
593
0
    emit_bits(entropy, (unsigned int) (temp >> Al), 1);
594
0
  }
595
596
0
  cinfo->dest->next_output_byte = entropy->next_output_byte;
597
0
  cinfo->dest->free_in_buffer = entropy->free_in_buffer;
598
599
  /* Update restart-interval state too */
600
0
  if (cinfo->restart_interval) {
601
0
    if (entropy->restarts_to_go == 0) {
602
0
      entropy->restarts_to_go = cinfo->restart_interval;
603
0
      entropy->next_restart_num++;
604
0
      entropy->next_restart_num &= 7;
605
0
    }
606
0
    entropy->restarts_to_go--;
607
0
  }
608
609
0
  return TRUE;
610
0
}
611
612
613
/*
614
 * MCU encoding for AC successive approximation refinement scan.
615
 */
616
617
METHODDEF(boolean)
618
encode_mcu_AC_refine (j_compress_ptr cinfo, JBLOCKROW *MCU_data)
619
0
{
620
0
  phuff_entropy_ptr entropy = (phuff_entropy_ptr) cinfo->entropy;
621
0
  register int temp;
622
0
  register int r, k;
623
0
  int EOB;
624
0
  char *BR_buffer;
625
0
  unsigned int BR;
626
0
  int Se = cinfo->Se;
627
0
  int Al = cinfo->Al;
628
0
  JBLOCKROW block;
629
0
  int absvalues[DCTSIZE2];
630
631
0
  entropy->next_output_byte = cinfo->dest->next_output_byte;
632
0
  entropy->free_in_buffer = cinfo->dest->free_in_buffer;
633
634
  /* Emit restart marker if needed */
635
0
  if (cinfo->restart_interval)
636
0
    if (entropy->restarts_to_go == 0)
637
0
      emit_restart(entropy, entropy->next_restart_num);
638
639
  /* Encode the MCU data block */
640
0
  block = MCU_data[0];
641
642
  /* It is convenient to make a pre-pass to determine the transformed
643
   * coefficients' absolute values and the EOB position.
644
   */
645
0
  EOB = 0;
646
0
  for (k = cinfo->Ss; k <= Se; k++) {
647
0
    temp = (*block)[jpeg_natural_order[k]];
648
    /* We must apply the point transform by Al.  For AC coefficients this
649
     * is an integer division with rounding towards 0.  To do this portably
650
     * in C, we shift after obtaining the absolute value.
651
     */
652
0
    if (temp < 0)
653
0
      temp = -temp;   /* temp is abs value of input */
654
0
    temp >>= Al;    /* apply the point transform */
655
0
    absvalues[k] = temp;  /* save abs value for main pass */
656
0
    if (temp == 1)
657
0
      EOB = k;     /* EOB = index of last newly-nonzero coef */
658
0
  }
659
660
  /* Encode the AC coefficients per section G.1.2.3, fig. G.7 */
661
  
662
0
  r = 0;      /* r = run length of zeros */
663
0
  BR = 0;     /* BR = count of buffered bits added now */
664
0
  BR_buffer = entropy->bit_buffer + entropy->BE; /* Append bits to buffer */
665
666
0
  for (k = cinfo->Ss; k <= Se; k++) {
667
0
    if ((temp = absvalues[k]) == 0) {
668
0
      r++;
669
0
      continue;
670
0
    }
671
672
    /* Emit any required ZRLs, but not if they can be folded into EOB */
673
0
    while (r > 15 && k <= EOB) {
674
      /* emit any pending EOBRUN and the BE correction bits */
675
0
      emit_eobrun(entropy);
676
      /* Emit ZRL */
677
0
      emit_symbol(entropy, entropy->ac_tbl_no, 0xF0);
678
0
      r -= 16;
679
      /* Emit buffered correction bits that must be associated with ZRL */
680
0
      emit_buffered_bits(entropy, BR_buffer, BR);
681
0
      BR_buffer = entropy->bit_buffer; /* BE bits are gone now */
682
0
      BR = 0;
683
0
    }
684
685
    /* If the coef was previously nonzero, it only needs a correction bit.
686
     * NOTE: a straight translation of the spec's figure G.7 would suggest
687
     * that we also need to test r > 15.  But if r > 15, we can only get here
688
     * if k > EOB, which implies that this coefficient is not 1.
689
     */
690
0
    if (temp > 1) {
691
      /* The correction bit is the next bit of the absolute value. */
692
0
      BR_buffer[BR++] = (char) (temp & 1);
693
0
      continue;
694
0
    }
695
696
    /* Emit any pending EOBRUN and the BE correction bits */
697
0
    emit_eobrun(entropy);
698
699
    /* Count/emit Huffman symbol for run length / number of bits */
700
0
    emit_symbol(entropy, entropy->ac_tbl_no, (r << 4) + 1);
701
702
    /* Emit output bit for newly-nonzero coef */
703
0
    temp = ((*block)[jpeg_natural_order[k]] < 0) ? 0 : 1;
704
0
    emit_bits(entropy, (unsigned int) temp, 1);
705
706
    /* Emit buffered correction bits that must be associated with this code */
707
0
    emit_buffered_bits(entropy, BR_buffer, BR);
708
0
    BR_buffer = entropy->bit_buffer; /* BE bits are gone now */
709
0
    BR = 0;
710
0
    r = 0;      /* reset zero run length */
711
0
  }
712
713
0
  if (r > 0 || BR > 0) { /* If there are trailing zeroes, */
714
0
    entropy->EOBRUN++;    /* count an EOB */
715
0
    entropy->BE += BR;    /* concat my correction bits to older ones */
716
    /* We force out the EOB if we risk either:
717
     * 1. overflow of the EOB counter;
718
     * 2. overflow of the correction bit buffer during the next MCU.
719
     */
720
0
    if (entropy->EOBRUN == 0x7FFF || entropy->BE > (MAX_CORR_BITS-DCTSIZE2+1))
721
0
      emit_eobrun(entropy);
722
0
  }
723
724
0
  cinfo->dest->next_output_byte = entropy->next_output_byte;
725
0
  cinfo->dest->free_in_buffer = entropy->free_in_buffer;
726
727
  /* Update restart-interval state too */
728
0
  if (cinfo->restart_interval) {
729
0
    if (entropy->restarts_to_go == 0) {
730
0
      entropy->restarts_to_go = cinfo->restart_interval;
731
0
      entropy->next_restart_num++;
732
0
      entropy->next_restart_num &= 7;
733
0
    }
734
0
    entropy->restarts_to_go--;
735
0
  }
736
737
0
  return TRUE;
738
0
}
739
740
741
/*
742
 * Finish up at the end of a Huffman-compressed progressive scan.
743
 */
744
745
METHODDEF(void)
746
finish_pass_phuff (j_compress_ptr cinfo)
747
0
{   
748
0
  phuff_entropy_ptr entropy = (phuff_entropy_ptr) cinfo->entropy;
749
750
0
  entropy->next_output_byte = cinfo->dest->next_output_byte;
751
0
  entropy->free_in_buffer = cinfo->dest->free_in_buffer;
752
753
  /* Flush out any buffered data */
754
0
  emit_eobrun(entropy);
755
0
  flush_bits(entropy);
756
757
0
  cinfo->dest->next_output_byte = entropy->next_output_byte;
758
0
  cinfo->dest->free_in_buffer = entropy->free_in_buffer;
759
0
}
760
761
762
/*
763
 * Finish up a statistics-gathering pass and create the new Huffman tables.
764
 */
765
766
METHODDEF(void)
767
finish_pass_gather_phuff (j_compress_ptr cinfo)
768
0
{
769
0
  phuff_entropy_ptr entropy = (phuff_entropy_ptr) cinfo->entropy;
770
0
  boolean is_DC_band;
771
0
  int ci, tbl;
772
0
  jpeg_component_info * compptr;
773
0
  JHUFF_TBL **htblptr;
774
0
  boolean did[NUM_HUFF_TBLS];
775
776
  /* Flush out buffered data (all we care about is counting the EOB symbol) */
777
0
  emit_eobrun(entropy);
778
779
0
  is_DC_band = (cinfo->Ss == 0);
780
781
  /* It's important not to apply jpeg_gen_optimal_table more than once
782
   * per table, because it clobbers the input frequency counts!
783
   */
784
0
  MEMZERO(did, SIZEOF(did));
785
786
0
  for (ci = 0; ci < cinfo->comps_in_scan; ci++) {
787
0
    compptr = cinfo->cur_comp_info[ci];
788
0
    if (is_DC_band) {
789
0
      if (cinfo->Ah != 0) /* DC refinement needs no table */
790
0
  continue;
791
0
      tbl = compptr->dc_tbl_no;
792
0
    } else {
793
0
      tbl = compptr->ac_tbl_no;
794
0
    }
795
0
    if (! did[tbl]) {
796
0
      if (is_DC_band)
797
0
        htblptr = & cinfo->dc_huff_tbl_ptrs[tbl];
798
0
      else
799
0
        htblptr = & cinfo->ac_huff_tbl_ptrs[tbl];
800
0
      if (*htblptr == NULL)
801
0
        *htblptr = jpeg_alloc_huff_table((j_common_ptr) cinfo);
802
0
      jpeg_gen_optimal_table(cinfo, *htblptr, entropy->count_ptrs[tbl]);
803
0
      did[tbl] = TRUE;
804
0
    }
805
0
  }
806
0
}
807
808
809
/*
810
 * Module initialization routine for progressive Huffman entropy encoding.
811
 */
812
813
GLOBAL(void)
814
jinit_phuff_encoder (j_compress_ptr cinfo)
815
0
{
816
0
  phuff_entropy_ptr entropy;
817
0
  int i;
818
819
0
  entropy = (phuff_entropy_ptr)
820
0
    (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
821
0
        SIZEOF(phuff_entropy_encoder));
822
0
  cinfo->entropy = (struct jpeg_entropy_encoder *) entropy;
823
0
  entropy->pub.start_pass = start_pass_phuff;
824
825
  /* Mark tables unallocated */
826
0
  for (i = 0; i < NUM_HUFF_TBLS; i++) {
827
0
    entropy->derived_tbls[i] = NULL;
828
0
    entropy->count_ptrs[i] = NULL;
829
0
  }
830
0
  entropy->bit_buffer = NULL; /* needed only in AC refinement scan */
831
0
}
832
833
#endif /* C_PROGRESSIVE_SUPPORTED */