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