Coverage Report

Created: 2023-06-07 06:03

/src/libjpeg-turbo.main/jdcoefct.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * jdcoefct.c
3
 *
4
 * This file was part of the Independent JPEG Group's software:
5
 * Copyright (C) 1994-1997, Thomas G. Lane.
6
 * libjpeg-turbo Modifications:
7
 * Copyright 2009 Pierre Ossman <ossman@cendio.se> for Cendio AB
8
 * Copyright (C) 2010, 2015-2016, 2019-2020, 2022, D. R. Commander.
9
 * Copyright (C) 2015, 2020, Google, Inc.
10
 * For conditions of distribution and use, see the accompanying README.ijg
11
 * file.
12
 *
13
 * This file contains the coefficient buffer controller for decompression.
14
 * This controller is the top level of the lossy JPEG decompressor proper.
15
 * The coefficient buffer lies between entropy decoding and inverse-DCT steps.
16
 *
17
 * In buffered-image mode, this controller is the interface between
18
 * input-oriented processing and output-oriented processing.
19
 * Also, the input side (only) is used when reading a file for transcoding.
20
 */
21
22
#include "jinclude.h"
23
#include "jdcoefct.h"
24
#include "jpegapicomp.h"
25
#include "jsamplecomp.h"
26
27
28
/* Forward declarations */
29
METHODDEF(int) decompress_onepass(j_decompress_ptr cinfo,
30
                                  _JSAMPIMAGE output_buf);
31
#ifdef D_MULTISCAN_FILES_SUPPORTED
32
METHODDEF(int) decompress_data(j_decompress_ptr cinfo, _JSAMPIMAGE output_buf);
33
#endif
34
#ifdef BLOCK_SMOOTHING_SUPPORTED
35
LOCAL(boolean) smoothing_ok(j_decompress_ptr cinfo);
36
METHODDEF(int) decompress_smooth_data(j_decompress_ptr cinfo,
37
                                      _JSAMPIMAGE output_buf);
38
#endif
39
40
41
/*
42
 * Initialize for an input processing pass.
43
 */
44
45
METHODDEF(void)
46
start_input_pass(j_decompress_ptr cinfo)
47
23.2k
{
48
23.2k
  cinfo->input_iMCU_row = 0;
49
23.2k
  start_iMCU_row(cinfo);
50
23.2k
}
51
52
53
/*
54
 * Initialize for an output processing pass.
55
 */
56
57
METHODDEF(void)
58
start_output_pass(j_decompress_ptr cinfo)
59
0
{
60
0
#ifdef BLOCK_SMOOTHING_SUPPORTED
61
0
  my_coef_ptr coef = (my_coef_ptr)cinfo->coef;
62
63
  /* If multipass, check to see whether to use block smoothing on this pass */
64
0
  if (coef->pub.coef_arrays != NULL) {
65
0
    if (cinfo->do_block_smoothing && smoothing_ok(cinfo))
66
0
      coef->pub._decompress_data = decompress_smooth_data;
67
0
    else
68
0
      coef->pub._decompress_data = decompress_data;
69
0
  }
70
0
#endif
71
0
  cinfo->output_iMCU_row = 0;
72
0
}
73
74
75
/*
76
 * Decompress and return some data in the single-pass case.
77
 * Always attempts to emit one fully interleaved MCU row ("iMCU" row).
78
 * Input and output must run in lockstep since we have only a one-MCU buffer.
79
 * Return value is JPEG_ROW_COMPLETED, JPEG_SCAN_COMPLETED, or JPEG_SUSPENDED.
80
 *
81
 * NB: output_buf contains a plane for each component in image,
82
 * which we index according to the component's SOF position.
83
 */
84
85
METHODDEF(int)
86
decompress_onepass(j_decompress_ptr cinfo, _JSAMPIMAGE output_buf)
87
0
{
88
0
  my_coef_ptr coef = (my_coef_ptr)cinfo->coef;
89
0
  JDIMENSION MCU_col_num;       /* index of current MCU within row */
90
0
  JDIMENSION last_MCU_col = cinfo->MCUs_per_row - 1;
91
0
  JDIMENSION last_iMCU_row = cinfo->total_iMCU_rows - 1;
92
0
  int blkn, ci, xindex, yindex, yoffset, useful_width;
93
0
  _JSAMPARRAY output_ptr;
94
0
  JDIMENSION start_col, output_col;
95
0
  jpeg_component_info *compptr;
96
0
  _inverse_DCT_method_ptr inverse_DCT;
97
98
  /* Loop to process as much as one whole iMCU row */
99
0
  for (yoffset = coef->MCU_vert_offset; yoffset < coef->MCU_rows_per_iMCU_row;
100
0
       yoffset++) {
101
0
    for (MCU_col_num = coef->MCU_ctr; MCU_col_num <= last_MCU_col;
102
0
         MCU_col_num++) {
103
      /* Try to fetch an MCU.  Entropy decoder expects buffer to be zeroed. */
104
0
      jzero_far((void *)coef->MCU_buffer[0],
105
0
                (size_t)(cinfo->blocks_in_MCU * sizeof(JBLOCK)));
106
0
      if (!cinfo->entropy->insufficient_data)
107
0
        cinfo->master->last_good_iMCU_row = cinfo->input_iMCU_row;
108
0
      if (!(*cinfo->entropy->decode_mcu) (cinfo, coef->MCU_buffer)) {
109
        /* Suspension forced; update state counters and exit */
110
0
        coef->MCU_vert_offset = yoffset;
111
0
        coef->MCU_ctr = MCU_col_num;
112
0
        return JPEG_SUSPENDED;
113
0
      }
114
115
      /* Only perform the IDCT on blocks that are contained within the desired
116
       * cropping region.
117
       */
118
0
      if (MCU_col_num >= cinfo->master->first_iMCU_col &&
119
0
          MCU_col_num <= cinfo->master->last_iMCU_col) {
120
        /* Determine where data should go in output_buf and do the IDCT thing.
121
         * We skip dummy blocks at the right and bottom edges (but blkn gets
122
         * incremented past them!).  Note the inner loop relies on having
123
         * allocated the MCU_buffer[] blocks sequentially.
124
         */
125
0
        blkn = 0;               /* index of current DCT block within MCU */
126
0
        for (ci = 0; ci < cinfo->comps_in_scan; ci++) {
127
0
          compptr = cinfo->cur_comp_info[ci];
128
          /* Don't bother to IDCT an uninteresting component. */
129
0
          if (!compptr->component_needed) {
130
0
            blkn += compptr->MCU_blocks;
131
0
            continue;
132
0
          }
133
0
          inverse_DCT = cinfo->idct->_inverse_DCT[compptr->component_index];
134
0
          useful_width = (MCU_col_num < last_MCU_col) ?
135
0
                         compptr->MCU_width : compptr->last_col_width;
136
0
          output_ptr = output_buf[compptr->component_index] +
137
0
                       yoffset * compptr->_DCT_scaled_size;
138
0
          start_col = (MCU_col_num - cinfo->master->first_iMCU_col) *
139
0
                      compptr->MCU_sample_width;
140
0
          for (yindex = 0; yindex < compptr->MCU_height; yindex++) {
141
0
            if (cinfo->input_iMCU_row < last_iMCU_row ||
142
0
                yoffset + yindex < compptr->last_row_height) {
143
0
              output_col = start_col;
144
0
              for (xindex = 0; xindex < useful_width; xindex++) {
145
0
                (*inverse_DCT) (cinfo, compptr,
146
0
                                (JCOEFPTR)coef->MCU_buffer[blkn + xindex],
147
0
                                output_ptr, output_col);
148
0
                output_col += compptr->_DCT_scaled_size;
149
0
              }
150
0
            }
151
0
            blkn += compptr->MCU_width;
152
0
            output_ptr += compptr->_DCT_scaled_size;
153
0
          }
154
0
        }
155
0
      }
156
0
    }
157
    /* Completed an MCU row, but perhaps not an iMCU row */
158
0
    coef->MCU_ctr = 0;
159
0
  }
160
  /* Completed the iMCU row, advance counters for next one */
161
0
  cinfo->output_iMCU_row++;
162
0
  if (++(cinfo->input_iMCU_row) < cinfo->total_iMCU_rows) {
163
0
    start_iMCU_row(cinfo);
164
0
    return JPEG_ROW_COMPLETED;
165
0
  }
166
  /* Completed the scan */
167
0
  (*cinfo->inputctl->finish_input_pass) (cinfo);
168
0
  return JPEG_SCAN_COMPLETED;
169
0
}
170
171
172
/*
173
 * Dummy consume-input routine for single-pass operation.
174
 */
175
176
METHODDEF(int)
177
dummy_consume_data(j_decompress_ptr cinfo)
178
0
{
179
0
  return JPEG_SUSPENDED;        /* Always indicate nothing was done */
180
0
}
181
182
183
#ifdef D_MULTISCAN_FILES_SUPPORTED
184
185
/*
186
 * Consume input data and store it in the full-image coefficient buffer.
187
 * We read as much as one fully interleaved MCU row ("iMCU" row) per call,
188
 * ie, v_samp_factor block rows for each component in the scan.
189
 * Return value is JPEG_ROW_COMPLETED, JPEG_SCAN_COMPLETED, or JPEG_SUSPENDED.
190
 */
191
192
METHODDEF(int)
193
consume_data(j_decompress_ptr cinfo)
194
4.96M
{
195
4.96M
  my_coef_ptr coef = (my_coef_ptr)cinfo->coef;
196
4.96M
  JDIMENSION MCU_col_num;       /* index of current MCU within row */
197
4.96M
  int blkn, ci, xindex, yindex, yoffset;
198
4.96M
  JDIMENSION start_col;
199
4.96M
  JBLOCKARRAY buffer[MAX_COMPS_IN_SCAN];
200
4.96M
  JBLOCKROW buffer_ptr;
201
4.96M
  jpeg_component_info *compptr;
202
203
  /* Align the virtual buffers for the components used in this scan. */
204
11.9M
  for (ci = 0; ci < cinfo->comps_in_scan; ci++) {
205
7.03M
    compptr = cinfo->cur_comp_info[ci];
206
7.03M
    buffer[ci] = (*cinfo->mem->access_virt_barray)
207
7.03M
      ((j_common_ptr)cinfo, coef->whole_image[compptr->component_index],
208
7.03M
       cinfo->input_iMCU_row * compptr->v_samp_factor,
209
7.03M
       (JDIMENSION)compptr->v_samp_factor, TRUE);
210
    /* Note: entropy decoder expects buffer to be zeroed,
211
     * but this is handled automatically by the memory manager
212
     * because we requested a pre-zeroed array.
213
     */
214
7.03M
  }
215
216
  /* Loop to process one whole iMCU row */
217
10.6M
  for (yoffset = coef->MCU_vert_offset; yoffset < coef->MCU_rows_per_iMCU_row;
218
5.72M
       yoffset++) {
219
66.9M
    for (MCU_col_num = coef->MCU_ctr; MCU_col_num < cinfo->MCUs_per_row;
220
61.2M
         MCU_col_num++) {
221
      /* Construct list of pointers to DCT blocks belonging to this MCU */
222
61.2M
      blkn = 0;                 /* index of current DCT block within MCU */
223
131M
      for (ci = 0; ci < cinfo->comps_in_scan; ci++) {
224
70.3M
        compptr = cinfo->cur_comp_info[ci];
225
70.3M
        start_col = MCU_col_num * compptr->MCU_width;
226
141M
        for (yindex = 0; yindex < compptr->MCU_height; yindex++) {
227
71.0M
          buffer_ptr = buffer[ci][yindex + yoffset] + start_col;
228
147M
          for (xindex = 0; xindex < compptr->MCU_width; xindex++) {
229
75.9M
            coef->MCU_buffer[blkn++] = buffer_ptr++;
230
75.9M
          }
231
71.0M
        }
232
70.3M
      }
233
61.2M
      if (!cinfo->entropy->insufficient_data)
234
42.4M
        cinfo->master->last_good_iMCU_row = cinfo->input_iMCU_row;
235
      /* Try to fetch the MCU. */
236
61.2M
      if (!(*cinfo->entropy->decode_mcu) (cinfo, coef->MCU_buffer)) {
237
        /* Suspension forced; update state counters and exit */
238
0
        coef->MCU_vert_offset = yoffset;
239
0
        coef->MCU_ctr = MCU_col_num;
240
0
        return JPEG_SUSPENDED;
241
0
      }
242
61.2M
    }
243
    /* Completed an MCU row, but perhaps not an iMCU row */
244
5.72M
    coef->MCU_ctr = 0;
245
5.72M
  }
246
  /* Completed the iMCU row, advance counters for next one */
247
4.96M
  if (++(cinfo->input_iMCU_row) < cinfo->total_iMCU_rows) {
248
4.94M
    start_iMCU_row(cinfo);
249
4.94M
    return JPEG_ROW_COMPLETED;
250
4.94M
  }
251
  /* Completed the scan */
252
23.2k
  (*cinfo->inputctl->finish_input_pass) (cinfo);
253
23.2k
  return JPEG_SCAN_COMPLETED;
254
4.96M
}
255
256
257
/*
258
 * Decompress and return some data in the multi-pass case.
259
 * Always attempts to emit one fully interleaved MCU row ("iMCU" row).
260
 * Return value is JPEG_ROW_COMPLETED, JPEG_SCAN_COMPLETED, or JPEG_SUSPENDED.
261
 *
262
 * NB: output_buf contains a plane for each component in image.
263
 */
264
265
METHODDEF(int)
266
decompress_data(j_decompress_ptr cinfo, _JSAMPIMAGE output_buf)
267
0
{
268
0
  my_coef_ptr coef = (my_coef_ptr)cinfo->coef;
269
0
  JDIMENSION last_iMCU_row = cinfo->total_iMCU_rows - 1;
270
0
  JDIMENSION block_num;
271
0
  int ci, block_row, block_rows;
272
0
  JBLOCKARRAY buffer;
273
0
  JBLOCKROW buffer_ptr;
274
0
  _JSAMPARRAY output_ptr;
275
0
  JDIMENSION output_col;
276
0
  jpeg_component_info *compptr;
277
0
  _inverse_DCT_method_ptr inverse_DCT;
278
279
  /* Force some input to be done if we are getting ahead of the input. */
280
0
  while (cinfo->input_scan_number < cinfo->output_scan_number ||
281
0
         (cinfo->input_scan_number == cinfo->output_scan_number &&
282
0
          cinfo->input_iMCU_row <= cinfo->output_iMCU_row)) {
283
0
    if ((*cinfo->inputctl->consume_input) (cinfo) == JPEG_SUSPENDED)
284
0
      return JPEG_SUSPENDED;
285
0
  }
286
287
  /* OK, output from the virtual arrays. */
288
0
  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
289
0
       ci++, compptr++) {
290
    /* Don't bother to IDCT an uninteresting component. */
291
0
    if (!compptr->component_needed)
292
0
      continue;
293
    /* Align the virtual buffer for this component. */
294
0
    buffer = (*cinfo->mem->access_virt_barray)
295
0
      ((j_common_ptr)cinfo, coef->whole_image[ci],
296
0
       cinfo->output_iMCU_row * compptr->v_samp_factor,
297
0
       (JDIMENSION)compptr->v_samp_factor, FALSE);
298
    /* Count non-dummy DCT block rows in this iMCU row. */
299
0
    if (cinfo->output_iMCU_row < last_iMCU_row)
300
0
      block_rows = compptr->v_samp_factor;
301
0
    else {
302
      /* NB: can't use last_row_height here; it is input-side-dependent! */
303
0
      block_rows = (int)(compptr->height_in_blocks % compptr->v_samp_factor);
304
0
      if (block_rows == 0) block_rows = compptr->v_samp_factor;
305
0
    }
306
0
    inverse_DCT = cinfo->idct->_inverse_DCT[ci];
307
0
    output_ptr = output_buf[ci];
308
    /* Loop over all DCT blocks to be processed. */
309
0
    for (block_row = 0; block_row < block_rows; block_row++) {
310
0
      buffer_ptr = buffer[block_row] + cinfo->master->first_MCU_col[ci];
311
0
      output_col = 0;
312
0
      for (block_num = cinfo->master->first_MCU_col[ci];
313
0
           block_num <= cinfo->master->last_MCU_col[ci]; block_num++) {
314
0
        (*inverse_DCT) (cinfo, compptr, (JCOEFPTR)buffer_ptr, output_ptr,
315
0
                        output_col);
316
0
        buffer_ptr++;
317
0
        output_col += compptr->_DCT_scaled_size;
318
0
      }
319
0
      output_ptr += compptr->_DCT_scaled_size;
320
0
    }
321
0
  }
322
323
0
  if (++(cinfo->output_iMCU_row) < cinfo->total_iMCU_rows)
324
0
    return JPEG_ROW_COMPLETED;
325
0
  return JPEG_SCAN_COMPLETED;
326
0
}
327
328
#endif /* D_MULTISCAN_FILES_SUPPORTED */
329
330
331
#ifdef BLOCK_SMOOTHING_SUPPORTED
332
333
/*
334
 * This code applies interblock smoothing; the first 9 AC coefficients are
335
 * estimated from the DC values of a DCT block and its 24 neighboring blocks.
336
 * We apply smoothing only for progressive JPEG decoding, and only if
337
 * the coefficients it can estimate are not yet known to full precision.
338
 */
339
340
/* Natural-order array positions of the first 9 zigzag-order coefficients */
341
0
#define Q01_POS  1
342
0
#define Q10_POS  8
343
0
#define Q20_POS  16
344
0
#define Q11_POS  9
345
0
#define Q02_POS  2
346
0
#define Q03_POS  3
347
0
#define Q12_POS  10
348
0
#define Q21_POS  17
349
0
#define Q30_POS  24
350
351
/*
352
 * Determine whether block smoothing is applicable and safe.
353
 * We also latch the current states of the coef_bits[] entries for the
354
 * AC coefficients; otherwise, if the input side of the decompressor
355
 * advances into a new scan, we might think the coefficients are known
356
 * more accurately than they really are.
357
 */
358
359
LOCAL(boolean)
360
smoothing_ok(j_decompress_ptr cinfo)
361
0
{
362
0
  my_coef_ptr coef = (my_coef_ptr)cinfo->coef;
363
0
  boolean smoothing_useful = FALSE;
364
0
  int ci, coefi;
365
0
  jpeg_component_info *compptr;
366
0
  JQUANT_TBL *qtable;
367
0
  int *coef_bits, *prev_coef_bits;
368
0
  int *coef_bits_latch, *prev_coef_bits_latch;
369
370
0
  if (!cinfo->progressive_mode || cinfo->coef_bits == NULL)
371
0
    return FALSE;
372
373
  /* Allocate latch area if not already done */
374
0
  if (coef->coef_bits_latch == NULL)
375
0
    coef->coef_bits_latch = (int *)
376
0
      (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
377
0
                                  cinfo->num_components * 2 *
378
0
                                  (SAVED_COEFS * sizeof(int)));
379
0
  coef_bits_latch = coef->coef_bits_latch;
380
0
  prev_coef_bits_latch =
381
0
    &coef->coef_bits_latch[cinfo->num_components * SAVED_COEFS];
382
383
0
  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
384
0
       ci++, compptr++) {
385
    /* All components' quantization values must already be latched. */
386
0
    if ((qtable = compptr->quant_table) == NULL)
387
0
      return FALSE;
388
    /* Verify DC & first 9 AC quantizers are nonzero to avoid zero-divide. */
389
0
    if (qtable->quantval[0] == 0 ||
390
0
        qtable->quantval[Q01_POS] == 0 ||
391
0
        qtable->quantval[Q10_POS] == 0 ||
392
0
        qtable->quantval[Q20_POS] == 0 ||
393
0
        qtable->quantval[Q11_POS] == 0 ||
394
0
        qtable->quantval[Q02_POS] == 0 ||
395
0
        qtable->quantval[Q03_POS] == 0 ||
396
0
        qtable->quantval[Q12_POS] == 0 ||
397
0
        qtable->quantval[Q21_POS] == 0 ||
398
0
        qtable->quantval[Q30_POS] == 0)
399
0
      return FALSE;
400
    /* DC values must be at least partly known for all components. */
401
0
    coef_bits = cinfo->coef_bits[ci];
402
0
    prev_coef_bits = cinfo->coef_bits[ci + cinfo->num_components];
403
0
    if (coef_bits[0] < 0)
404
0
      return FALSE;
405
0
    coef_bits_latch[0] = coef_bits[0];
406
    /* Block smoothing is helpful if some AC coefficients remain inaccurate. */
407
0
    for (coefi = 1; coefi < SAVED_COEFS; coefi++) {
408
0
      if (cinfo->input_scan_number > 1)
409
0
        prev_coef_bits_latch[coefi] = prev_coef_bits[coefi];
410
0
      else
411
0
        prev_coef_bits_latch[coefi] = -1;
412
0
      coef_bits_latch[coefi] = coef_bits[coefi];
413
0
      if (coef_bits[coefi] != 0)
414
0
        smoothing_useful = TRUE;
415
0
    }
416
0
    coef_bits_latch += SAVED_COEFS;
417
0
    prev_coef_bits_latch += SAVED_COEFS;
418
0
  }
419
420
0
  return smoothing_useful;
421
0
}
422
423
424
/*
425
 * Variant of decompress_data for use when doing block smoothing.
426
 */
427
428
METHODDEF(int)
429
decompress_smooth_data(j_decompress_ptr cinfo, _JSAMPIMAGE output_buf)
430
0
{
431
0
  my_coef_ptr coef = (my_coef_ptr)cinfo->coef;
432
0
  JDIMENSION last_iMCU_row = cinfo->total_iMCU_rows - 1;
433
0
  JDIMENSION block_num, last_block_column;
434
0
  int ci, block_row, block_rows, access_rows;
435
0
  JBLOCKARRAY buffer;
436
0
  JBLOCKROW buffer_ptr, prev_prev_block_row, prev_block_row;
437
0
  JBLOCKROW next_block_row, next_next_block_row;
438
0
  _JSAMPARRAY output_ptr;
439
0
  JDIMENSION output_col;
440
0
  jpeg_component_info *compptr;
441
0
  _inverse_DCT_method_ptr inverse_DCT;
442
0
  boolean change_dc;
443
0
  JCOEF *workspace;
444
0
  int *coef_bits;
445
0
  JQUANT_TBL *quanttbl;
446
0
  JLONG Q00, Q01, Q02, Q03 = 0, Q10, Q11, Q12 = 0, Q20, Q21 = 0, Q30 = 0, num;
447
0
  int DC01, DC02, DC03, DC04, DC05, DC06, DC07, DC08, DC09, DC10, DC11, DC12,
448
0
      DC13, DC14, DC15, DC16, DC17, DC18, DC19, DC20, DC21, DC22, DC23, DC24,
449
0
      DC25;
450
0
  int Al, pred;
451
452
  /* Keep a local variable to avoid looking it up more than once */
453
0
  workspace = coef->workspace;
454
455
  /* Force some input to be done if we are getting ahead of the input. */
456
0
  while (cinfo->input_scan_number <= cinfo->output_scan_number &&
457
0
         !cinfo->inputctl->eoi_reached) {
458
0
    if (cinfo->input_scan_number == cinfo->output_scan_number) {
459
      /* If input is working on current scan, we ordinarily want it to
460
       * have completed the current row.  But if input scan is DC,
461
       * we want it to keep two rows ahead so that next two block rows' DC
462
       * values are up to date.
463
       */
464
0
      JDIMENSION delta = (cinfo->Ss == 0) ? 2 : 0;
465
0
      if (cinfo->input_iMCU_row > cinfo->output_iMCU_row + delta)
466
0
        break;
467
0
    }
468
0
    if ((*cinfo->inputctl->consume_input) (cinfo) == JPEG_SUSPENDED)
469
0
      return JPEG_SUSPENDED;
470
0
  }
471
472
  /* OK, output from the virtual arrays. */
473
0
  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
474
0
       ci++, compptr++) {
475
    /* Don't bother to IDCT an uninteresting component. */
476
0
    if (!compptr->component_needed)
477
0
      continue;
478
    /* Count non-dummy DCT block rows in this iMCU row. */
479
0
    if (cinfo->output_iMCU_row + 1 < last_iMCU_row) {
480
0
      block_rows = compptr->v_samp_factor;
481
0
      access_rows = block_rows * 3; /* this and next two iMCU rows */
482
0
    } else if (cinfo->output_iMCU_row < last_iMCU_row) {
483
0
      block_rows = compptr->v_samp_factor;
484
0
      access_rows = block_rows * 2; /* this and next iMCU row */
485
0
    } else {
486
      /* NB: can't use last_row_height here; it is input-side-dependent! */
487
0
      block_rows = (int)(compptr->height_in_blocks % compptr->v_samp_factor);
488
0
      if (block_rows == 0) block_rows = compptr->v_samp_factor;
489
0
      access_rows = block_rows; /* this iMCU row only */
490
0
    }
491
    /* Align the virtual buffer for this component. */
492
0
    if (cinfo->output_iMCU_row > 1) {
493
0
      access_rows += 2 * compptr->v_samp_factor; /* prior two iMCU rows too */
494
0
      buffer = (*cinfo->mem->access_virt_barray)
495
0
        ((j_common_ptr)cinfo, coef->whole_image[ci],
496
0
         (cinfo->output_iMCU_row - 2) * compptr->v_samp_factor,
497
0
         (JDIMENSION)access_rows, FALSE);
498
0
      buffer += 2 * compptr->v_samp_factor; /* point to current iMCU row */
499
0
    } else if (cinfo->output_iMCU_row > 0) {
500
0
      buffer = (*cinfo->mem->access_virt_barray)
501
0
        ((j_common_ptr)cinfo, coef->whole_image[ci],
502
0
         (cinfo->output_iMCU_row - 1) * compptr->v_samp_factor,
503
0
         (JDIMENSION)access_rows, FALSE);
504
0
      buffer += compptr->v_samp_factor; /* point to current iMCU row */
505
0
    } else {
506
0
      buffer = (*cinfo->mem->access_virt_barray)
507
0
        ((j_common_ptr)cinfo, coef->whole_image[ci],
508
0
         (JDIMENSION)0, (JDIMENSION)access_rows, FALSE);
509
0
    }
510
    /* Fetch component-dependent info.
511
     * If the current scan is incomplete, then we use the component-dependent
512
     * info from the previous scan.
513
     */
514
0
    if (cinfo->output_iMCU_row > cinfo->master->last_good_iMCU_row)
515
0
      coef_bits =
516
0
        coef->coef_bits_latch + ((ci + cinfo->num_components) * SAVED_COEFS);
517
0
    else
518
0
      coef_bits = coef->coef_bits_latch + (ci * SAVED_COEFS);
519
520
    /* We only do DC interpolation if no AC coefficient data is available. */
521
0
    change_dc =
522
0
      coef_bits[1] == -1 && coef_bits[2] == -1 && coef_bits[3] == -1 &&
523
0
      coef_bits[4] == -1 && coef_bits[5] == -1 && coef_bits[6] == -1 &&
524
0
      coef_bits[7] == -1 && coef_bits[8] == -1 && coef_bits[9] == -1;
525
526
0
    quanttbl = compptr->quant_table;
527
0
    Q00 = quanttbl->quantval[0];
528
0
    Q01 = quanttbl->quantval[Q01_POS];
529
0
    Q10 = quanttbl->quantval[Q10_POS];
530
0
    Q20 = quanttbl->quantval[Q20_POS];
531
0
    Q11 = quanttbl->quantval[Q11_POS];
532
0
    Q02 = quanttbl->quantval[Q02_POS];
533
0
    if (change_dc) {
534
0
      Q03 = quanttbl->quantval[Q03_POS];
535
0
      Q12 = quanttbl->quantval[Q12_POS];
536
0
      Q21 = quanttbl->quantval[Q21_POS];
537
0
      Q30 = quanttbl->quantval[Q30_POS];
538
0
    }
539
0
    inverse_DCT = cinfo->idct->_inverse_DCT[ci];
540
0
    output_ptr = output_buf[ci];
541
    /* Loop over all DCT blocks to be processed. */
542
0
    for (block_row = 0; block_row < block_rows; block_row++) {
543
0
      buffer_ptr = buffer[block_row] + cinfo->master->first_MCU_col[ci];
544
545
0
      if (block_row > 0 || cinfo->output_iMCU_row > 0)
546
0
        prev_block_row =
547
0
          buffer[block_row - 1] + cinfo->master->first_MCU_col[ci];
548
0
      else
549
0
        prev_block_row = buffer_ptr;
550
551
0
      if (block_row > 1 || cinfo->output_iMCU_row > 1)
552
0
        prev_prev_block_row =
553
0
          buffer[block_row - 2] + cinfo->master->first_MCU_col[ci];
554
0
      else
555
0
        prev_prev_block_row = prev_block_row;
556
557
0
      if (block_row < block_rows - 1 || cinfo->output_iMCU_row < last_iMCU_row)
558
0
        next_block_row =
559
0
          buffer[block_row + 1] + cinfo->master->first_MCU_col[ci];
560
0
      else
561
0
        next_block_row = buffer_ptr;
562
563
0
      if (block_row < block_rows - 2 ||
564
0
          cinfo->output_iMCU_row + 1 < last_iMCU_row)
565
0
        next_next_block_row =
566
0
          buffer[block_row + 2] + cinfo->master->first_MCU_col[ci];
567
0
      else
568
0
        next_next_block_row = next_block_row;
569
570
      /* We fetch the surrounding DC values using a sliding-register approach.
571
       * Initialize all 25 here so as to do the right thing on narrow pics.
572
       */
573
0
      DC01 = DC02 = DC03 = DC04 = DC05 = (int)prev_prev_block_row[0][0];
574
0
      DC06 = DC07 = DC08 = DC09 = DC10 = (int)prev_block_row[0][0];
575
0
      DC11 = DC12 = DC13 = DC14 = DC15 = (int)buffer_ptr[0][0];
576
0
      DC16 = DC17 = DC18 = DC19 = DC20 = (int)next_block_row[0][0];
577
0
      DC21 = DC22 = DC23 = DC24 = DC25 = (int)next_next_block_row[0][0];
578
0
      output_col = 0;
579
0
      last_block_column = compptr->width_in_blocks - 1;
580
0
      for (block_num = cinfo->master->first_MCU_col[ci];
581
0
           block_num <= cinfo->master->last_MCU_col[ci]; block_num++) {
582
        /* Fetch current DCT block into workspace so we can modify it. */
583
0
        jcopy_block_row(buffer_ptr, (JBLOCKROW)workspace, (JDIMENSION)1);
584
        /* Update DC values */
585
0
        if (block_num == cinfo->master->first_MCU_col[ci] &&
586
0
            block_num < last_block_column) {
587
0
          DC04 = (int)prev_prev_block_row[1][0];
588
0
          DC09 = (int)prev_block_row[1][0];
589
0
          DC14 = (int)buffer_ptr[1][0];
590
0
          DC19 = (int)next_block_row[1][0];
591
0
          DC24 = (int)next_next_block_row[1][0];
592
0
        }
593
0
        if (block_num + 1 < last_block_column) {
594
0
          DC05 = (int)prev_prev_block_row[2][0];
595
0
          DC10 = (int)prev_block_row[2][0];
596
0
          DC15 = (int)buffer_ptr[2][0];
597
0
          DC20 = (int)next_block_row[2][0];
598
0
          DC25 = (int)next_next_block_row[2][0];
599
0
        }
600
        /* If DC interpolation is enabled, compute coefficient estimates using
601
         * a Gaussian-like kernel, keeping the averages of the DC values.
602
         *
603
         * If DC interpolation is disabled, compute coefficient estimates using
604
         * an algorithm similar to the one described in Section K.8 of the JPEG
605
         * standard, except applied to a 5x5 window rather than a 3x3 window.
606
         *
607
         * An estimate is applied only if the coefficient is still zero and is
608
         * not known to be fully accurate.
609
         */
610
        /* AC01 */
611
0
        if ((Al = coef_bits[1]) != 0 && workspace[1] == 0) {
612
0
          num = Q00 * (change_dc ?
613
0
                (-DC01 - DC02 + DC04 + DC05 - 3 * DC06 + 13 * DC07 -
614
0
                 13 * DC09 + 3 * DC10 - 3 * DC11 + 38 * DC12 - 38 * DC14 +
615
0
                 3 * DC15 - 3 * DC16 + 13 * DC17 - 13 * DC19 + 3 * DC20 -
616
0
                 DC21 - DC22 + DC24 + DC25) :
617
0
                (-7 * DC11 + 50 * DC12 - 50 * DC14 + 7 * DC15));
618
0
          if (num >= 0) {
619
0
            pred = (int)(((Q01 << 7) + num) / (Q01 << 8));
620
0
            if (Al > 0 && pred >= (1 << Al))
621
0
              pred = (1 << Al) - 1;
622
0
          } else {
623
0
            pred = (int)(((Q01 << 7) - num) / (Q01 << 8));
624
0
            if (Al > 0 && pred >= (1 << Al))
625
0
              pred = (1 << Al) - 1;
626
0
            pred = -pred;
627
0
          }
628
0
          workspace[1] = (JCOEF)pred;
629
0
        }
630
        /* AC10 */
631
0
        if ((Al = coef_bits[2]) != 0 && workspace[8] == 0) {
632
0
          num = Q00 * (change_dc ?
633
0
                (-DC01 - 3 * DC02 - 3 * DC03 - 3 * DC04 - DC05 - DC06 +
634
0
                 13 * DC07 + 38 * DC08 + 13 * DC09 - DC10 + DC16 -
635
0
                 13 * DC17 - 38 * DC18 - 13 * DC19 + DC20 + DC21 +
636
0
                 3 * DC22 + 3 * DC23 + 3 * DC24 + DC25) :
637
0
                (-7 * DC03 + 50 * DC08 - 50 * DC18 + 7 * DC23));
638
0
          if (num >= 0) {
639
0
            pred = (int)(((Q10 << 7) + num) / (Q10 << 8));
640
0
            if (Al > 0 && pred >= (1 << Al))
641
0
              pred = (1 << Al) - 1;
642
0
          } else {
643
0
            pred = (int)(((Q10 << 7) - num) / (Q10 << 8));
644
0
            if (Al > 0 && pred >= (1 << Al))
645
0
              pred = (1 << Al) - 1;
646
0
            pred = -pred;
647
0
          }
648
0
          workspace[8] = (JCOEF)pred;
649
0
        }
650
        /* AC20 */
651
0
        if ((Al = coef_bits[3]) != 0 && workspace[16] == 0) {
652
0
          num = Q00 * (change_dc ?
653
0
                (DC03 + 2 * DC07 + 7 * DC08 + 2 * DC09 - 5 * DC12 - 14 * DC13 -
654
0
                 5 * DC14 + 2 * DC17 + 7 * DC18 + 2 * DC19 + DC23) :
655
0
                (-DC03 + 13 * DC08 - 24 * DC13 + 13 * DC18 - DC23));
656
0
          if (num >= 0) {
657
0
            pred = (int)(((Q20 << 7) + num) / (Q20 << 8));
658
0
            if (Al > 0 && pred >= (1 << Al))
659
0
              pred = (1 << Al) - 1;
660
0
          } else {
661
0
            pred = (int)(((Q20 << 7) - num) / (Q20 << 8));
662
0
            if (Al > 0 && pred >= (1 << Al))
663
0
              pred = (1 << Al) - 1;
664
0
            pred = -pred;
665
0
          }
666
0
          workspace[16] = (JCOEF)pred;
667
0
        }
668
        /* AC11 */
669
0
        if ((Al = coef_bits[4]) != 0 && workspace[9] == 0) {
670
0
          num = Q00 * (change_dc ?
671
0
                (-DC01 + DC05 + 9 * DC07 - 9 * DC09 - 9 * DC17 +
672
0
                 9 * DC19 + DC21 - DC25) :
673
0
                (DC10 + DC16 - 10 * DC17 + 10 * DC19 - DC02 - DC20 + DC22 -
674
0
                 DC24 + DC04 - DC06 + 10 * DC07 - 10 * DC09));
675
0
          if (num >= 0) {
676
0
            pred = (int)(((Q11 << 7) + num) / (Q11 << 8));
677
0
            if (Al > 0 && pred >= (1 << Al))
678
0
              pred = (1 << Al) - 1;
679
0
          } else {
680
0
            pred = (int)(((Q11 << 7) - num) / (Q11 << 8));
681
0
            if (Al > 0 && pred >= (1 << Al))
682
0
              pred = (1 << Al) - 1;
683
0
            pred = -pred;
684
0
          }
685
0
          workspace[9] = (JCOEF)pred;
686
0
        }
687
        /* AC02 */
688
0
        if ((Al = coef_bits[5]) != 0 && workspace[2] == 0) {
689
0
          num = Q00 * (change_dc ?
690
0
                (2 * DC07 - 5 * DC08 + 2 * DC09 + DC11 + 7 * DC12 - 14 * DC13 +
691
0
                 7 * DC14 + DC15 + 2 * DC17 - 5 * DC18 + 2 * DC19) :
692
0
                (-DC11 + 13 * DC12 - 24 * DC13 + 13 * DC14 - DC15));
693
0
          if (num >= 0) {
694
0
            pred = (int)(((Q02 << 7) + num) / (Q02 << 8));
695
0
            if (Al > 0 && pred >= (1 << Al))
696
0
              pred = (1 << Al) - 1;
697
0
          } else {
698
0
            pred = (int)(((Q02 << 7) - num) / (Q02 << 8));
699
0
            if (Al > 0 && pred >= (1 << Al))
700
0
              pred = (1 << Al) - 1;
701
0
            pred = -pred;
702
0
          }
703
0
          workspace[2] = (JCOEF)pred;
704
0
        }
705
0
        if (change_dc) {
706
          /* AC03 */
707
0
          if ((Al = coef_bits[6]) != 0 && workspace[3] == 0) {
708
0
            num = Q00 * (DC07 - DC09 + 2 * DC12 - 2 * DC14 + DC17 - DC19);
709
0
            if (num >= 0) {
710
0
              pred = (int)(((Q03 << 7) + num) / (Q03 << 8));
711
0
              if (Al > 0 && pred >= (1 << Al))
712
0
                pred = (1 << Al) - 1;
713
0
            } else {
714
0
              pred = (int)(((Q03 << 7) - num) / (Q03 << 8));
715
0
              if (Al > 0 && pred >= (1 << Al))
716
0
                pred = (1 << Al) - 1;
717
0
              pred = -pred;
718
0
            }
719
0
            workspace[3] = (JCOEF)pred;
720
0
          }
721
          /* AC12 */
722
0
          if ((Al = coef_bits[7]) != 0 && workspace[10] == 0) {
723
0
            num = Q00 * (DC07 - 3 * DC08 + DC09 - DC17 + 3 * DC18 - DC19);
724
0
            if (num >= 0) {
725
0
              pred = (int)(((Q12 << 7) + num) / (Q12 << 8));
726
0
              if (Al > 0 && pred >= (1 << Al))
727
0
                pred = (1 << Al) - 1;
728
0
            } else {
729
0
              pred = (int)(((Q12 << 7) - num) / (Q12 << 8));
730
0
              if (Al > 0 && pred >= (1 << Al))
731
0
                pred = (1 << Al) - 1;
732
0
              pred = -pred;
733
0
            }
734
0
            workspace[10] = (JCOEF)pred;
735
0
          }
736
          /* AC21 */
737
0
          if ((Al = coef_bits[8]) != 0 && workspace[17] == 0) {
738
0
            num = Q00 * (DC07 - DC09 - 3 * DC12 + 3 * DC14 + DC17 - DC19);
739
0
            if (num >= 0) {
740
0
              pred = (int)(((Q21 << 7) + num) / (Q21 << 8));
741
0
              if (Al > 0 && pred >= (1 << Al))
742
0
                pred = (1 << Al) - 1;
743
0
            } else {
744
0
              pred = (int)(((Q21 << 7) - num) / (Q21 << 8));
745
0
              if (Al > 0 && pred >= (1 << Al))
746
0
                pred = (1 << Al) - 1;
747
0
              pred = -pred;
748
0
            }
749
0
            workspace[17] = (JCOEF)pred;
750
0
          }
751
          /* AC30 */
752
0
          if ((Al = coef_bits[9]) != 0 && workspace[24] == 0) {
753
0
            num = Q00 * (DC07 + 2 * DC08 + DC09 - DC17 - 2 * DC18 - DC19);
754
0
            if (num >= 0) {
755
0
              pred = (int)(((Q30 << 7) + num) / (Q30 << 8));
756
0
              if (Al > 0 && pred >= (1 << Al))
757
0
                pred = (1 << Al) - 1;
758
0
            } else {
759
0
              pred = (int)(((Q30 << 7) - num) / (Q30 << 8));
760
0
              if (Al > 0 && pred >= (1 << Al))
761
0
                pred = (1 << Al) - 1;
762
0
              pred = -pred;
763
0
            }
764
0
            workspace[24] = (JCOEF)pred;
765
0
          }
766
          /* coef_bits[0] is non-negative.  Otherwise this function would not
767
           * be called.
768
           */
769
0
          num = Q00 *
770
0
                (-2 * DC01 - 6 * DC02 - 8 * DC03 - 6 * DC04 - 2 * DC05 -
771
0
                 6 * DC06 + 6 * DC07 + 42 * DC08 + 6 * DC09 - 6 * DC10 -
772
0
                 8 * DC11 + 42 * DC12 + 152 * DC13 + 42 * DC14 - 8 * DC15 -
773
0
                 6 * DC16 + 6 * DC17 + 42 * DC18 + 6 * DC19 - 6 * DC20 -
774
0
                 2 * DC21 - 6 * DC22 - 8 * DC23 - 6 * DC24 - 2 * DC25);
775
0
          if (num >= 0) {
776
0
            pred = (int)(((Q00 << 7) + num) / (Q00 << 8));
777
0
          } else {
778
0
            pred = (int)(((Q00 << 7) - num) / (Q00 << 8));
779
0
            pred = -pred;
780
0
          }
781
0
          workspace[0] = (JCOEF)pred;
782
0
        }  /* change_dc */
783
784
        /* OK, do the IDCT */
785
0
        (*inverse_DCT) (cinfo, compptr, (JCOEFPTR)workspace, output_ptr,
786
0
                        output_col);
787
        /* Advance for next column */
788
0
        DC01 = DC02;  DC02 = DC03;  DC03 = DC04;  DC04 = DC05;
789
0
        DC06 = DC07;  DC07 = DC08;  DC08 = DC09;  DC09 = DC10;
790
0
        DC11 = DC12;  DC12 = DC13;  DC13 = DC14;  DC14 = DC15;
791
0
        DC16 = DC17;  DC17 = DC18;  DC18 = DC19;  DC19 = DC20;
792
0
        DC21 = DC22;  DC22 = DC23;  DC23 = DC24;  DC24 = DC25;
793
0
        buffer_ptr++, prev_block_row++, next_block_row++,
794
0
          prev_prev_block_row++, next_next_block_row++;
795
0
        output_col += compptr->_DCT_scaled_size;
796
0
      }
797
0
      output_ptr += compptr->_DCT_scaled_size;
798
0
    }
799
0
  }
800
801
0
  if (++(cinfo->output_iMCU_row) < cinfo->total_iMCU_rows)
802
0
    return JPEG_ROW_COMPLETED;
803
0
  return JPEG_SCAN_COMPLETED;
804
0
}
805
806
#endif /* BLOCK_SMOOTHING_SUPPORTED */
807
808
809
/*
810
 * Initialize coefficient buffer controller.
811
 */
812
813
GLOBAL(void)
814
_jinit_d_coef_controller(j_decompress_ptr cinfo, boolean need_full_buffer)
815
6.31k
{
816
6.31k
  my_coef_ptr coef;
817
818
6.31k
  if (cinfo->data_precision != BITS_IN_JSAMPLE)
819
5
    ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
820
821
6.31k
  coef = (my_coef_ptr)
822
6.31k
    (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
823
6.31k
                                sizeof(my_coef_controller));
824
6.31k
  cinfo->coef = (struct jpeg_d_coef_controller *)coef;
825
6.31k
  coef->pub.start_input_pass = start_input_pass;
826
6.31k
  coef->pub.start_output_pass = start_output_pass;
827
6.31k
#ifdef BLOCK_SMOOTHING_SUPPORTED
828
6.31k
  coef->coef_bits_latch = NULL;
829
6.31k
#endif
830
831
  /* Create the coefficient buffer. */
832
6.31k
  if (need_full_buffer) {
833
6.30k
#ifdef D_MULTISCAN_FILES_SUPPORTED
834
    /* Allocate a full-image virtual array for each component, */
835
    /* padded to a multiple of samp_factor DCT blocks in each direction. */
836
    /* Note we ask for a pre-zeroed array. */
837
6.30k
    int ci, access_rows;
838
6.30k
    jpeg_component_info *compptr;
839
840
16.1k
    for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
841
9.80k
         ci++, compptr++) {
842
9.80k
      access_rows = compptr->v_samp_factor;
843
9.80k
#ifdef BLOCK_SMOOTHING_SUPPORTED
844
      /* If block smoothing could be used, need a bigger window */
845
9.80k
      if (cinfo->progressive_mode)
846
4.16k
        access_rows *= 5;
847
9.80k
#endif
848
9.80k
      coef->whole_image[ci] = (*cinfo->mem->request_virt_barray)
849
9.80k
        ((j_common_ptr)cinfo, JPOOL_IMAGE, TRUE,
850
9.80k
         (JDIMENSION)jround_up((long)compptr->width_in_blocks,
851
9.80k
                               (long)compptr->h_samp_factor),
852
9.80k
         (JDIMENSION)jround_up((long)compptr->height_in_blocks,
853
9.80k
                               (long)compptr->v_samp_factor),
854
9.80k
         (JDIMENSION)access_rows);
855
9.80k
    }
856
6.30k
    coef->pub.consume_data = consume_data;
857
6.30k
    coef->pub._decompress_data = decompress_data;
858
6.30k
    coef->pub.coef_arrays = coef->whole_image; /* link to virtual arrays */
859
#else
860
    ERREXIT(cinfo, JERR_NOT_COMPILED);
861
#endif
862
6.30k
  } else {
863
    /* We only need a single-MCU buffer. */
864
5
    JBLOCKROW buffer;
865
5
    int i;
866
867
5
    buffer = (JBLOCKROW)
868
5
      (*cinfo->mem->alloc_large) ((j_common_ptr)cinfo, JPOOL_IMAGE,
869
5
                                  D_MAX_BLOCKS_IN_MCU * sizeof(JBLOCK));
870
5
    for (i = 0; i < D_MAX_BLOCKS_IN_MCU; i++) {
871
0
      coef->MCU_buffer[i] = buffer + i;
872
0
    }
873
5
    coef->pub.consume_data = dummy_consume_data;
874
5
    coef->pub._decompress_data = decompress_onepass;
875
5
    coef->pub.coef_arrays = NULL; /* flag for no virtual arrays */
876
5
  }
877
878
  /* Allocate the workspace buffer */
879
6.31k
  coef->workspace = (JCOEF *)
880
6.31k
    (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
881
6.31k
                                sizeof(JCOEF) * DCTSIZE2);
882
6.31k
}
j12init_d_coef_controller
Line
Count
Source
815
1.08k
{
816
1.08k
  my_coef_ptr coef;
817
818
1.08k
  if (cinfo->data_precision != BITS_IN_JSAMPLE)
819
0
    ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
820
821
1.08k
  coef = (my_coef_ptr)
822
1.08k
    (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
823
1.08k
                                sizeof(my_coef_controller));
824
1.08k
  cinfo->coef = (struct jpeg_d_coef_controller *)coef;
825
1.08k
  coef->pub.start_input_pass = start_input_pass;
826
1.08k
  coef->pub.start_output_pass = start_output_pass;
827
1.08k
#ifdef BLOCK_SMOOTHING_SUPPORTED
828
1.08k
  coef->coef_bits_latch = NULL;
829
1.08k
#endif
830
831
  /* Create the coefficient buffer. */
832
1.08k
  if (need_full_buffer) {
833
1.08k
#ifdef D_MULTISCAN_FILES_SUPPORTED
834
    /* Allocate a full-image virtual array for each component, */
835
    /* padded to a multiple of samp_factor DCT blocks in each direction. */
836
    /* Note we ask for a pre-zeroed array. */
837
1.08k
    int ci, access_rows;
838
1.08k
    jpeg_component_info *compptr;
839
840
2.49k
    for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
841
1.40k
         ci++, compptr++) {
842
1.40k
      access_rows = compptr->v_samp_factor;
843
1.40k
#ifdef BLOCK_SMOOTHING_SUPPORTED
844
      /* If block smoothing could be used, need a bigger window */
845
1.40k
      if (cinfo->progressive_mode)
846
496
        access_rows *= 5;
847
1.40k
#endif
848
1.40k
      coef->whole_image[ci] = (*cinfo->mem->request_virt_barray)
849
1.40k
        ((j_common_ptr)cinfo, JPOOL_IMAGE, TRUE,
850
1.40k
         (JDIMENSION)jround_up((long)compptr->width_in_blocks,
851
1.40k
                               (long)compptr->h_samp_factor),
852
1.40k
         (JDIMENSION)jround_up((long)compptr->height_in_blocks,
853
1.40k
                               (long)compptr->v_samp_factor),
854
1.40k
         (JDIMENSION)access_rows);
855
1.40k
    }
856
1.08k
    coef->pub.consume_data = consume_data;
857
1.08k
    coef->pub._decompress_data = decompress_data;
858
1.08k
    coef->pub.coef_arrays = coef->whole_image; /* link to virtual arrays */
859
#else
860
    ERREXIT(cinfo, JERR_NOT_COMPILED);
861
#endif
862
1.08k
  } else {
863
    /* We only need a single-MCU buffer. */
864
0
    JBLOCKROW buffer;
865
0
    int i;
866
867
0
    buffer = (JBLOCKROW)
868
0
      (*cinfo->mem->alloc_large) ((j_common_ptr)cinfo, JPOOL_IMAGE,
869
0
                                  D_MAX_BLOCKS_IN_MCU * sizeof(JBLOCK));
870
0
    for (i = 0; i < D_MAX_BLOCKS_IN_MCU; i++) {
871
0
      coef->MCU_buffer[i] = buffer + i;
872
0
    }
873
0
    coef->pub.consume_data = dummy_consume_data;
874
0
    coef->pub._decompress_data = decompress_onepass;
875
0
    coef->pub.coef_arrays = NULL; /* flag for no virtual arrays */
876
0
  }
877
878
  /* Allocate the workspace buffer */
879
1.08k
  coef->workspace = (JCOEF *)
880
1.08k
    (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
881
1.08k
                                sizeof(JCOEF) * DCTSIZE2);
882
1.08k
}
jinit_d_coef_controller
Line
Count
Source
815
5.22k
{
816
5.22k
  my_coef_ptr coef;
817
818
5.22k
  if (cinfo->data_precision != BITS_IN_JSAMPLE)
819
5
    ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
820
821
5.22k
  coef = (my_coef_ptr)
822
5.22k
    (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
823
5.22k
                                sizeof(my_coef_controller));
824
5.22k
  cinfo->coef = (struct jpeg_d_coef_controller *)coef;
825
5.22k
  coef->pub.start_input_pass = start_input_pass;
826
5.22k
  coef->pub.start_output_pass = start_output_pass;
827
5.22k
#ifdef BLOCK_SMOOTHING_SUPPORTED
828
5.22k
  coef->coef_bits_latch = NULL;
829
5.22k
#endif
830
831
  /* Create the coefficient buffer. */
832
5.22k
  if (need_full_buffer) {
833
5.21k
#ifdef D_MULTISCAN_FILES_SUPPORTED
834
    /* Allocate a full-image virtual array for each component, */
835
    /* padded to a multiple of samp_factor DCT blocks in each direction. */
836
    /* Note we ask for a pre-zeroed array. */
837
5.21k
    int ci, access_rows;
838
5.21k
    jpeg_component_info *compptr;
839
840
13.6k
    for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
841
8.39k
         ci++, compptr++) {
842
8.39k
      access_rows = compptr->v_samp_factor;
843
8.39k
#ifdef BLOCK_SMOOTHING_SUPPORTED
844
      /* If block smoothing could be used, need a bigger window */
845
8.39k
      if (cinfo->progressive_mode)
846
3.67k
        access_rows *= 5;
847
8.39k
#endif
848
8.39k
      coef->whole_image[ci] = (*cinfo->mem->request_virt_barray)
849
8.39k
        ((j_common_ptr)cinfo, JPOOL_IMAGE, TRUE,
850
8.39k
         (JDIMENSION)jround_up((long)compptr->width_in_blocks,
851
8.39k
                               (long)compptr->h_samp_factor),
852
8.39k
         (JDIMENSION)jround_up((long)compptr->height_in_blocks,
853
8.39k
                               (long)compptr->v_samp_factor),
854
8.39k
         (JDIMENSION)access_rows);
855
8.39k
    }
856
5.21k
    coef->pub.consume_data = consume_data;
857
5.21k
    coef->pub._decompress_data = decompress_data;
858
5.21k
    coef->pub.coef_arrays = coef->whole_image; /* link to virtual arrays */
859
#else
860
    ERREXIT(cinfo, JERR_NOT_COMPILED);
861
#endif
862
5.21k
  } else {
863
    /* We only need a single-MCU buffer. */
864
5
    JBLOCKROW buffer;
865
5
    int i;
866
867
5
    buffer = (JBLOCKROW)
868
5
      (*cinfo->mem->alloc_large) ((j_common_ptr)cinfo, JPOOL_IMAGE,
869
5
                                  D_MAX_BLOCKS_IN_MCU * sizeof(JBLOCK));
870
5
    for (i = 0; i < D_MAX_BLOCKS_IN_MCU; i++) {
871
0
      coef->MCU_buffer[i] = buffer + i;
872
0
    }
873
5
    coef->pub.consume_data = dummy_consume_data;
874
5
    coef->pub._decompress_data = decompress_onepass;
875
5
    coef->pub.coef_arrays = NULL; /* flag for no virtual arrays */
876
5
  }
877
878
  /* Allocate the workspace buffer */
879
5.22k
  coef->workspace = (JCOEF *)
880
5.22k
    (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
881
5.22k
                                sizeof(JCOEF) * DCTSIZE2);
882
5.22k
}