/src/libjpeg-turbo.main/src/jdapistd.c
Line | Count | Source |
1 | | /* |
2 | | * jdapistd.c |
3 | | * |
4 | | * This file was part of the Independent JPEG Group's software: |
5 | | * Copyright (C) 1994-1996, Thomas G. Lane. |
6 | | * libjpeg-turbo Modifications: |
7 | | * Copyright (C) 2010, 2015-2020, 2022-2026, D. R. Commander. |
8 | | * Copyright (C) 2015, Google, Inc. |
9 | | * For conditions of distribution and use, see the accompanying README.ijg |
10 | | * file. |
11 | | * |
12 | | * This file contains application interface code for the decompression half |
13 | | * of the JPEG library. These are the "standard" API routines that are |
14 | | * used in the normal full-decompression case. They are not used by a |
15 | | * transcoding-only application. Note that if an application links in |
16 | | * jpeg_start_decompress, it will end up linking in the entire decompressor. |
17 | | * We thus must separate this file from jdapimin.c to avoid linking the |
18 | | * whole decompression library into a transcoder. |
19 | | */ |
20 | | |
21 | | #include "jinclude.h" |
22 | | #if BITS_IN_JSAMPLE != 16 || defined(D_LOSSLESS_SUPPORTED) |
23 | | #include "jdmainct.h" |
24 | | #include "jdcoefct.h" |
25 | | #else |
26 | | #define JPEG_INTERNALS |
27 | | #include "jpeglib.h" |
28 | | #endif |
29 | | #include "jdmaster.h" |
30 | | #include "jdmerge.h" |
31 | | #include "jdsample.h" |
32 | | #include "jmemsys.h" |
33 | | #ifdef WITH_PROFILE |
34 | | #include "tjutil.h" |
35 | | #endif |
36 | | |
37 | | #if BITS_IN_JSAMPLE == 8 |
38 | | |
39 | | /* Forward declarations */ |
40 | | LOCAL(boolean) output_pass_setup(j_decompress_ptr cinfo); |
41 | | |
42 | | |
43 | | /* |
44 | | * Decompression initialization. |
45 | | * jpeg_read_header must be completed before calling this. |
46 | | * |
47 | | * If a multipass operating mode was selected, this will do all but the |
48 | | * last pass, and thus may take a great deal of time. |
49 | | * |
50 | | * Returns FALSE if suspended. The return value need be inspected only if |
51 | | * a suspending data source is used. |
52 | | */ |
53 | | |
54 | | GLOBAL(boolean) |
55 | | jpeg_start_decompress(j_decompress_ptr cinfo) |
56 | 32.3k | { |
57 | 32.3k | if (cinfo->global_state == DSTATE_READY) { |
58 | | /* First call: initialize master control, select active modules */ |
59 | 32.3k | jinit_master_decompress(cinfo); |
60 | 32.3k | if (cinfo->buffered_image) { |
61 | | /* No more work here; expecting jpeg_start_output next */ |
62 | 0 | cinfo->global_state = DSTATE_BUFIMAGE; |
63 | 0 | return TRUE; |
64 | 0 | } |
65 | 32.3k | cinfo->global_state = DSTATE_PRELOAD; |
66 | 32.3k | } |
67 | 32.3k | if (cinfo->global_state == DSTATE_PRELOAD) { |
68 | | /* If file has multiple scans, absorb them all into the coef buffer */ |
69 | 15.7k | if (cinfo->inputctl->has_multiple_scans) { |
70 | 10.7k | #ifdef D_MULTISCAN_FILES_SUPPORTED |
71 | 16.0M | for (;;) { |
72 | 16.0M | int retcode; |
73 | | /* Call progress monitor hook if present */ |
74 | 16.0M | if (cinfo->progress != NULL) |
75 | 16.0M | (*cinfo->progress->progress_monitor) ((j_common_ptr)cinfo); |
76 | | /* Absorb some more input */ |
77 | 16.0M | retcode = (*cinfo->inputctl->consume_input) (cinfo); |
78 | 16.0M | if (retcode == JPEG_SUSPENDED) |
79 | 0 | return FALSE; |
80 | 16.0M | if (retcode == JPEG_REACHED_EOI) |
81 | 9.36k | break; |
82 | | /* Advance progress counter if appropriate */ |
83 | 16.0M | if (cinfo->progress != NULL && |
84 | 16.0M | (retcode == JPEG_ROW_COMPLETED || retcode == JPEG_REACHED_SOS)) { |
85 | 15.9M | if (++cinfo->progress->pass_counter >= cinfo->progress->pass_limit) { |
86 | | /* jdmaster underestimated number of scans; ratchet up one scan */ |
87 | 13.8k | cinfo->progress->pass_limit += (long)cinfo->total_iMCU_rows; |
88 | 13.8k | } |
89 | 15.9M | } |
90 | 16.0M | } |
91 | | #else |
92 | | ERREXIT(cinfo, JERR_NOT_COMPILED); |
93 | | #endif /* D_MULTISCAN_FILES_SUPPORTED */ |
94 | 10.7k | } |
95 | 15.7k | cinfo->output_scan_number = cinfo->input_scan_number; |
96 | 16.5k | } else if (cinfo->global_state != DSTATE_PRESCAN) |
97 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); |
98 | | /* Perform any dummy output passes, and set up for the final pass */ |
99 | 32.3k | return output_pass_setup(cinfo); |
100 | 32.3k | } |
101 | | |
102 | | |
103 | | /* |
104 | | * Set up for an output pass, and perform any dummy pass(es) needed. |
105 | | * Common subroutine for jpeg_start_decompress and jpeg_start_output. |
106 | | * Entry: global_state = DSTATE_PRESCAN only if previously suspended. |
107 | | * Exit: If done, returns TRUE and sets global_state for proper output mode. |
108 | | * If suspended, returns FALSE and sets global_state = DSTATE_PRESCAN. |
109 | | */ |
110 | | |
111 | | LOCAL(boolean) |
112 | | output_pass_setup(j_decompress_ptr cinfo) |
113 | 14.3k | { |
114 | 14.3k | if (cinfo->global_state != DSTATE_PRESCAN) { |
115 | | /* First call: do pass setup */ |
116 | 14.3k | (*cinfo->master->prepare_for_output_pass) (cinfo); |
117 | 14.3k | cinfo->output_scanline = 0; |
118 | 14.3k | cinfo->global_state = DSTATE_PRESCAN; |
119 | 14.3k | } |
120 | | /* Loop over any required dummy passes */ |
121 | 14.3k | while (cinfo->master->is_dummy_pass) { |
122 | 0 | #ifdef QUANT_2PASS_SUPPORTED |
123 | | /* Crank through the dummy pass */ |
124 | 0 | while (cinfo->output_scanline < cinfo->output_height) { |
125 | 0 | JDIMENSION last_scanline; |
126 | | /* Call progress monitor hook if present */ |
127 | 0 | if (cinfo->progress != NULL) { |
128 | 0 | cinfo->progress->pass_counter = (long)cinfo->output_scanline; |
129 | 0 | cinfo->progress->pass_limit = (long)cinfo->output_height; |
130 | 0 | (*cinfo->progress->progress_monitor) ((j_common_ptr)cinfo); |
131 | 0 | } |
132 | | /* Process some data */ |
133 | 0 | last_scanline = cinfo->output_scanline; |
134 | 0 | if (cinfo->data_precision <= 8) { |
135 | 0 | if (cinfo->main->process_data == NULL) |
136 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
137 | 0 | (*cinfo->main->process_data) (cinfo, (JSAMPARRAY)NULL, |
138 | 0 | &cinfo->output_scanline, (JDIMENSION)0); |
139 | 0 | } else if (cinfo->data_precision <= 12) { |
140 | 0 | if (cinfo->main->process_data_12 == NULL) |
141 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
142 | 0 | (*cinfo->main->process_data_12) (cinfo, (J12SAMPARRAY)NULL, |
143 | 0 | &cinfo->output_scanline, |
144 | 0 | (JDIMENSION)0); |
145 | 0 | } else { |
146 | 0 | #ifdef D_LOSSLESS_SUPPORTED |
147 | 0 | if (cinfo->main->process_data_16 == NULL) |
148 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
149 | 0 | (*cinfo->main->process_data_16) (cinfo, (J16SAMPARRAY)NULL, |
150 | 0 | &cinfo->output_scanline, |
151 | 0 | (JDIMENSION)0); |
152 | | #else |
153 | | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
154 | | #endif |
155 | 0 | } |
156 | 0 | if (cinfo->output_scanline == last_scanline) |
157 | 0 | return FALSE; /* No progress made, must suspend */ |
158 | 0 | } |
159 | | /* Finish up dummy pass, and set up for another one */ |
160 | 0 | (*cinfo->master->finish_output_pass) (cinfo); |
161 | 0 | (*cinfo->master->prepare_for_output_pass) (cinfo); |
162 | 0 | cinfo->output_scanline = 0; |
163 | | #else |
164 | | ERREXIT(cinfo, JERR_NOT_COMPILED); |
165 | | #endif /* QUANT_2PASS_SUPPORTED */ |
166 | 0 | } |
167 | | /* Ready for application to drive output pass through |
168 | | * _jpeg_read_scanlines or _jpeg_read_raw_data. |
169 | | */ |
170 | 14.3k | cinfo->global_state = cinfo->raw_data_out ? DSTATE_RAW_OK : DSTATE_SCANNING; |
171 | 14.3k | return TRUE; |
172 | 14.3k | } |
173 | | |
174 | | #endif /* BITS_IN_JSAMPLE == 8 */ |
175 | | |
176 | | |
177 | | #if BITS_IN_JSAMPLE != 16 |
178 | | |
179 | | /* |
180 | | * Enable partial scanline decompression |
181 | | * |
182 | | * Must be called after jpeg_start_decompress() and before any calls to |
183 | | * _jpeg_read_scanlines() or _jpeg_skip_scanlines(). |
184 | | * |
185 | | * Refer to libjpeg.txt for more information. |
186 | | */ |
187 | | |
188 | | GLOBAL(void) |
189 | | _jpeg_crop_scanline(j_decompress_ptr cinfo, JDIMENSION *xoffset, |
190 | | JDIMENSION *width) |
191 | 1.96k | { |
192 | 1.96k | int ci, align, orig_downsampled_width; |
193 | 1.96k | JDIMENSION input_xoffset; |
194 | 1.96k | boolean reinit_upsampler = FALSE; |
195 | 1.96k | jpeg_component_info *compptr; |
196 | 1.96k | #ifdef UPSAMPLE_MERGING_SUPPORTED |
197 | 1.96k | my_master_ptr master = (my_master_ptr)cinfo->master; |
198 | 1.96k | #endif |
199 | | |
200 | 1.96k | if (cinfo->data_precision != BITS_IN_JSAMPLE) |
201 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
202 | | |
203 | 1.96k | if (cinfo->master->lossless || cinfo->raw_data_out) |
204 | 0 | ERREXIT(cinfo, JERR_NOTIMPL); |
205 | | |
206 | 1.96k | if ((cinfo->global_state != DSTATE_SCANNING && |
207 | 1.96k | cinfo->global_state != DSTATE_BUFIMAGE) || cinfo->output_scanline != 0) |
208 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); |
209 | | |
210 | 1.96k | if (!xoffset || !width) |
211 | 0 | ERREXIT(cinfo, JERR_BAD_CROP_SPEC); |
212 | | |
213 | | /* xoffset and width must fall within the output image dimensions. */ |
214 | 1.96k | if (*width == 0 || |
215 | 1.96k | (unsigned long long)(*xoffset) + *width > cinfo->output_width) |
216 | 0 | ERREXIT(cinfo, JERR_WIDTH_OVERFLOW); |
217 | | |
218 | | /* No need to do anything if the caller wants the entire width. */ |
219 | 1.96k | if (*width == cinfo->output_width) |
220 | 0 | return; |
221 | | |
222 | | /* Ensuring the proper alignment of xoffset is tricky. At minimum, it |
223 | | * must align with an MCU boundary, because: |
224 | | * |
225 | | * (1) The IDCT is performed in blocks, and it is not feasible to modify |
226 | | * the algorithm so that it can transform partial blocks. |
227 | | * (2) Because of the SIMD extensions, any input buffer passed to the |
228 | | * upsampling and color conversion routines must be aligned to the |
229 | | * SIMD word size (for instance, 128-bit in the case of SSE2.) The |
230 | | * easiest way to accomplish this without copying data is to ensure |
231 | | * that upsampling and color conversion begin at the start of the |
232 | | * first MCU column that will be inverse transformed. |
233 | | * |
234 | | * In practice, we actually impose a stricter alignment requirement. We |
235 | | * require that xoffset be a multiple of the maximum MCU column width of all |
236 | | * of the components (the "iMCU column width.") This is to simplify the |
237 | | * single-pass decompression case, allowing us to use the same MCU column |
238 | | * width for all of the components. |
239 | | */ |
240 | 1.96k | if (cinfo->comps_in_scan == 1 && cinfo->num_components == 1) |
241 | 1.82k | align = cinfo->_min_DCT_scaled_size; |
242 | 143 | else |
243 | 143 | align = cinfo->_min_DCT_scaled_size * cinfo->max_h_samp_factor; |
244 | | |
245 | | /* Adjust xoffset to the nearest iMCU boundary <= the requested value */ |
246 | 1.96k | input_xoffset = *xoffset; |
247 | 1.96k | *xoffset = (input_xoffset / align) * align; |
248 | | |
249 | | /* Adjust the width so that the right edge of the output image is as |
250 | | * requested (only the left edge is altered.) It is important that calling |
251 | | * programs check this value after this function returns, so that they can |
252 | | * allocate an output buffer with the appropriate size. |
253 | | */ |
254 | 1.96k | *width = *width + input_xoffset - *xoffset; |
255 | 1.96k | cinfo->output_width = *width; |
256 | 1.96k | #ifdef UPSAMPLE_MERGING_SUPPORTED |
257 | 1.96k | if (master->using_merged_upsample && cinfo->max_v_samp_factor == 2) { |
258 | 0 | my_merged_upsample_ptr upsample = (my_merged_upsample_ptr)cinfo->upsample; |
259 | 0 | upsample->out_row_width = |
260 | 0 | cinfo->output_width * cinfo->out_color_components; |
261 | 0 | } |
262 | 1.96k | #endif |
263 | | |
264 | | /* Set the first and last iMCU columns that we must decompress. These values |
265 | | * will be used in single-scan decompressions. |
266 | | */ |
267 | 1.96k | cinfo->master->first_iMCU_col = (JDIMENSION)(long)(*xoffset) / (long)align; |
268 | 1.96k | cinfo->master->last_iMCU_col = |
269 | 1.96k | (JDIMENSION)jdiv_round_up((long)(*xoffset + cinfo->output_width), |
270 | 1.96k | (long)align) - 1; |
271 | | |
272 | 4.21k | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; |
273 | 2.25k | ci++, compptr++) { |
274 | 2.25k | int hsf = (cinfo->comps_in_scan == 1 && cinfo->num_components == 1) ? |
275 | 1.82k | 1 : compptr->h_samp_factor; |
276 | | |
277 | | /* Set downsampled_width to the new output width. */ |
278 | 2.25k | orig_downsampled_width = compptr->downsampled_width; |
279 | 2.25k | compptr->downsampled_width = |
280 | 2.25k | (JDIMENSION)jdiv_round_up((long)cinfo->output_width * |
281 | 2.25k | (long)(compptr->h_samp_factor * |
282 | 2.25k | compptr->_DCT_scaled_size), |
283 | 2.25k | (long)(cinfo->max_h_samp_factor * |
284 | 2.25k | cinfo->_min_DCT_scaled_size)); |
285 | 2.25k | if (compptr->downsampled_width < 2 && orig_downsampled_width >= 2) |
286 | 0 | reinit_upsampler = TRUE; |
287 | | |
288 | | /* Set the first and last iMCU columns that we must decompress. These |
289 | | * values will be used in multi-scan decompressions. |
290 | | */ |
291 | 2.25k | cinfo->master->first_MCU_col[ci] = |
292 | 2.25k | (JDIMENSION)(long)(*xoffset * hsf) / (long)align; |
293 | 2.25k | cinfo->master->last_MCU_col[ci] = |
294 | 2.25k | (JDIMENSION)jdiv_round_up((long)((*xoffset + cinfo->output_width) * hsf), |
295 | 2.25k | (long)align) - 1; |
296 | 2.25k | } |
297 | | |
298 | 1.96k | if (reinit_upsampler) { |
299 | 0 | cinfo->master->jinit_upsampler_no_alloc = TRUE; |
300 | 0 | _jinit_upsampler(cinfo); |
301 | 0 | cinfo->master->jinit_upsampler_no_alloc = FALSE; |
302 | 0 | } |
303 | 1.96k | } Line | Count | Source | 191 | 1.06k | { | 192 | 1.06k | int ci, align, orig_downsampled_width; | 193 | 1.06k | JDIMENSION input_xoffset; | 194 | 1.06k | boolean reinit_upsampler = FALSE; | 195 | 1.06k | jpeg_component_info *compptr; | 196 | 1.06k | #ifdef UPSAMPLE_MERGING_SUPPORTED | 197 | 1.06k | my_master_ptr master = (my_master_ptr)cinfo->master; | 198 | 1.06k | #endif | 199 | | | 200 | 1.06k | if (cinfo->data_precision != BITS_IN_JSAMPLE) | 201 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 202 | | | 203 | 1.06k | if (cinfo->master->lossless || cinfo->raw_data_out) | 204 | 0 | ERREXIT(cinfo, JERR_NOTIMPL); | 205 | | | 206 | 1.06k | if ((cinfo->global_state != DSTATE_SCANNING && | 207 | 1.06k | cinfo->global_state != DSTATE_BUFIMAGE) || cinfo->output_scanline != 0) | 208 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); | 209 | | | 210 | 1.06k | if (!xoffset || !width) | 211 | 0 | ERREXIT(cinfo, JERR_BAD_CROP_SPEC); | 212 | | | 213 | | /* xoffset and width must fall within the output image dimensions. */ | 214 | 1.06k | if (*width == 0 || | 215 | 1.06k | (unsigned long long)(*xoffset) + *width > cinfo->output_width) | 216 | 0 | ERREXIT(cinfo, JERR_WIDTH_OVERFLOW); | 217 | | | 218 | | /* No need to do anything if the caller wants the entire width. */ | 219 | 1.06k | if (*width == cinfo->output_width) | 220 | 0 | return; | 221 | | | 222 | | /* Ensuring the proper alignment of xoffset is tricky. At minimum, it | 223 | | * must align with an MCU boundary, because: | 224 | | * | 225 | | * (1) The IDCT is performed in blocks, and it is not feasible to modify | 226 | | * the algorithm so that it can transform partial blocks. | 227 | | * (2) Because of the SIMD extensions, any input buffer passed to the | 228 | | * upsampling and color conversion routines must be aligned to the | 229 | | * SIMD word size (for instance, 128-bit in the case of SSE2.) The | 230 | | * easiest way to accomplish this without copying data is to ensure | 231 | | * that upsampling and color conversion begin at the start of the | 232 | | * first MCU column that will be inverse transformed. | 233 | | * | 234 | | * In practice, we actually impose a stricter alignment requirement. We | 235 | | * require that xoffset be a multiple of the maximum MCU column width of all | 236 | | * of the components (the "iMCU column width.") This is to simplify the | 237 | | * single-pass decompression case, allowing us to use the same MCU column | 238 | | * width for all of the components. | 239 | | */ | 240 | 1.06k | if (cinfo->comps_in_scan == 1 && cinfo->num_components == 1) | 241 | 1.00k | align = cinfo->_min_DCT_scaled_size; | 242 | 61 | else | 243 | 61 | align = cinfo->_min_DCT_scaled_size * cinfo->max_h_samp_factor; | 244 | | | 245 | | /* Adjust xoffset to the nearest iMCU boundary <= the requested value */ | 246 | 1.06k | input_xoffset = *xoffset; | 247 | 1.06k | *xoffset = (input_xoffset / align) * align; | 248 | | | 249 | | /* Adjust the width so that the right edge of the output image is as | 250 | | * requested (only the left edge is altered.) It is important that calling | 251 | | * programs check this value after this function returns, so that they can | 252 | | * allocate an output buffer with the appropriate size. | 253 | | */ | 254 | 1.06k | *width = *width + input_xoffset - *xoffset; | 255 | 1.06k | cinfo->output_width = *width; | 256 | 1.06k | #ifdef UPSAMPLE_MERGING_SUPPORTED | 257 | 1.06k | if (master->using_merged_upsample && cinfo->max_v_samp_factor == 2) { | 258 | 0 | my_merged_upsample_ptr upsample = (my_merged_upsample_ptr)cinfo->upsample; | 259 | 0 | upsample->out_row_width = | 260 | 0 | cinfo->output_width * cinfo->out_color_components; | 261 | 0 | } | 262 | 1.06k | #endif | 263 | | | 264 | | /* Set the first and last iMCU columns that we must decompress. These values | 265 | | * will be used in single-scan decompressions. | 266 | | */ | 267 | 1.06k | cinfo->master->first_iMCU_col = (JDIMENSION)(long)(*xoffset) / (long)align; | 268 | 1.06k | cinfo->master->last_iMCU_col = | 269 | 1.06k | (JDIMENSION)jdiv_round_up((long)(*xoffset + cinfo->output_width), | 270 | 1.06k | (long)align) - 1; | 271 | | | 272 | 2.24k | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; | 273 | 1.18k | ci++, compptr++) { | 274 | 1.18k | int hsf = (cinfo->comps_in_scan == 1 && cinfo->num_components == 1) ? | 275 | 1.00k | 1 : compptr->h_samp_factor; | 276 | | | 277 | | /* Set downsampled_width to the new output width. */ | 278 | 1.18k | orig_downsampled_width = compptr->downsampled_width; | 279 | 1.18k | compptr->downsampled_width = | 280 | 1.18k | (JDIMENSION)jdiv_round_up((long)cinfo->output_width * | 281 | 1.18k | (long)(compptr->h_samp_factor * | 282 | 1.18k | compptr->_DCT_scaled_size), | 283 | 1.18k | (long)(cinfo->max_h_samp_factor * | 284 | 1.18k | cinfo->_min_DCT_scaled_size)); | 285 | 1.18k | if (compptr->downsampled_width < 2 && orig_downsampled_width >= 2) | 286 | 0 | reinit_upsampler = TRUE; | 287 | | | 288 | | /* Set the first and last iMCU columns that we must decompress. These | 289 | | * values will be used in multi-scan decompressions. | 290 | | */ | 291 | 1.18k | cinfo->master->first_MCU_col[ci] = | 292 | 1.18k | (JDIMENSION)(long)(*xoffset * hsf) / (long)align; | 293 | 1.18k | cinfo->master->last_MCU_col[ci] = | 294 | 1.18k | (JDIMENSION)jdiv_round_up((long)((*xoffset + cinfo->output_width) * hsf), | 295 | 1.18k | (long)align) - 1; | 296 | 1.18k | } | 297 | | | 298 | 1.06k | if (reinit_upsampler) { | 299 | 0 | cinfo->master->jinit_upsampler_no_alloc = TRUE; | 300 | 0 | _jinit_upsampler(cinfo); | 301 | 0 | cinfo->master->jinit_upsampler_no_alloc = FALSE; | 302 | 0 | } | 303 | 1.06k | } |
Line | Count | Source | 191 | 903 | { | 192 | 903 | int ci, align, orig_downsampled_width; | 193 | 903 | JDIMENSION input_xoffset; | 194 | 903 | boolean reinit_upsampler = FALSE; | 195 | 903 | jpeg_component_info *compptr; | 196 | 903 | #ifdef UPSAMPLE_MERGING_SUPPORTED | 197 | 903 | my_master_ptr master = (my_master_ptr)cinfo->master; | 198 | 903 | #endif | 199 | | | 200 | 903 | if (cinfo->data_precision != BITS_IN_JSAMPLE) | 201 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 202 | | | 203 | 903 | if (cinfo->master->lossless || cinfo->raw_data_out) | 204 | 0 | ERREXIT(cinfo, JERR_NOTIMPL); | 205 | | | 206 | 903 | if ((cinfo->global_state != DSTATE_SCANNING && | 207 | 903 | cinfo->global_state != DSTATE_BUFIMAGE) || cinfo->output_scanline != 0) | 208 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); | 209 | | | 210 | 903 | if (!xoffset || !width) | 211 | 0 | ERREXIT(cinfo, JERR_BAD_CROP_SPEC); | 212 | | | 213 | | /* xoffset and width must fall within the output image dimensions. */ | 214 | 903 | if (*width == 0 || | 215 | 903 | (unsigned long long)(*xoffset) + *width > cinfo->output_width) | 216 | 0 | ERREXIT(cinfo, JERR_WIDTH_OVERFLOW); | 217 | | | 218 | | /* No need to do anything if the caller wants the entire width. */ | 219 | 903 | if (*width == cinfo->output_width) | 220 | 0 | return; | 221 | | | 222 | | /* Ensuring the proper alignment of xoffset is tricky. At minimum, it | 223 | | * must align with an MCU boundary, because: | 224 | | * | 225 | | * (1) The IDCT is performed in blocks, and it is not feasible to modify | 226 | | * the algorithm so that it can transform partial blocks. | 227 | | * (2) Because of the SIMD extensions, any input buffer passed to the | 228 | | * upsampling and color conversion routines must be aligned to the | 229 | | * SIMD word size (for instance, 128-bit in the case of SSE2.) The | 230 | | * easiest way to accomplish this without copying data is to ensure | 231 | | * that upsampling and color conversion begin at the start of the | 232 | | * first MCU column that will be inverse transformed. | 233 | | * | 234 | | * In practice, we actually impose a stricter alignment requirement. We | 235 | | * require that xoffset be a multiple of the maximum MCU column width of all | 236 | | * of the components (the "iMCU column width.") This is to simplify the | 237 | | * single-pass decompression case, allowing us to use the same MCU column | 238 | | * width for all of the components. | 239 | | */ | 240 | 903 | if (cinfo->comps_in_scan == 1 && cinfo->num_components == 1) | 241 | 821 | align = cinfo->_min_DCT_scaled_size; | 242 | 82 | else | 243 | 82 | align = cinfo->_min_DCT_scaled_size * cinfo->max_h_samp_factor; | 244 | | | 245 | | /* Adjust xoffset to the nearest iMCU boundary <= the requested value */ | 246 | 903 | input_xoffset = *xoffset; | 247 | 903 | *xoffset = (input_xoffset / align) * align; | 248 | | | 249 | | /* Adjust the width so that the right edge of the output image is as | 250 | | * requested (only the left edge is altered.) It is important that calling | 251 | | * programs check this value after this function returns, so that they can | 252 | | * allocate an output buffer with the appropriate size. | 253 | | */ | 254 | 903 | *width = *width + input_xoffset - *xoffset; | 255 | 903 | cinfo->output_width = *width; | 256 | 903 | #ifdef UPSAMPLE_MERGING_SUPPORTED | 257 | 903 | if (master->using_merged_upsample && cinfo->max_v_samp_factor == 2) { | 258 | 0 | my_merged_upsample_ptr upsample = (my_merged_upsample_ptr)cinfo->upsample; | 259 | 0 | upsample->out_row_width = | 260 | 0 | cinfo->output_width * cinfo->out_color_components; | 261 | 0 | } | 262 | 903 | #endif | 263 | | | 264 | | /* Set the first and last iMCU columns that we must decompress. These values | 265 | | * will be used in single-scan decompressions. | 266 | | */ | 267 | 903 | cinfo->master->first_iMCU_col = (JDIMENSION)(long)(*xoffset) / (long)align; | 268 | 903 | cinfo->master->last_iMCU_col = | 269 | 903 | (JDIMENSION)jdiv_round_up((long)(*xoffset + cinfo->output_width), | 270 | 903 | (long)align) - 1; | 271 | | | 272 | 1.97k | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; | 273 | 1.06k | ci++, compptr++) { | 274 | 1.06k | int hsf = (cinfo->comps_in_scan == 1 && cinfo->num_components == 1) ? | 275 | 821 | 1 : compptr->h_samp_factor; | 276 | | | 277 | | /* Set downsampled_width to the new output width. */ | 278 | 1.06k | orig_downsampled_width = compptr->downsampled_width; | 279 | 1.06k | compptr->downsampled_width = | 280 | 1.06k | (JDIMENSION)jdiv_round_up((long)cinfo->output_width * | 281 | 1.06k | (long)(compptr->h_samp_factor * | 282 | 1.06k | compptr->_DCT_scaled_size), | 283 | 1.06k | (long)(cinfo->max_h_samp_factor * | 284 | 1.06k | cinfo->_min_DCT_scaled_size)); | 285 | 1.06k | if (compptr->downsampled_width < 2 && orig_downsampled_width >= 2) | 286 | 0 | reinit_upsampler = TRUE; | 287 | | | 288 | | /* Set the first and last iMCU columns that we must decompress. These | 289 | | * values will be used in multi-scan decompressions. | 290 | | */ | 291 | 1.06k | cinfo->master->first_MCU_col[ci] = | 292 | 1.06k | (JDIMENSION)(long)(*xoffset * hsf) / (long)align; | 293 | 1.06k | cinfo->master->last_MCU_col[ci] = | 294 | 1.06k | (JDIMENSION)jdiv_round_up((long)((*xoffset + cinfo->output_width) * hsf), | 295 | 1.06k | (long)align) - 1; | 296 | 1.06k | } | 297 | | | 298 | 903 | if (reinit_upsampler) { | 299 | 0 | cinfo->master->jinit_upsampler_no_alloc = TRUE; | 300 | 0 | _jinit_upsampler(cinfo); | 301 | 0 | cinfo->master->jinit_upsampler_no_alloc = FALSE; | 302 | 0 | } | 303 | 903 | } |
|
304 | | |
305 | | #endif /* BITS_IN_JSAMPLE != 16 */ |
306 | | |
307 | | |
308 | | /* |
309 | | * Read some scanlines of data from the JPEG decompressor. |
310 | | * |
311 | | * The return value will be the number of lines actually read. |
312 | | * This may be less than the number requested in several cases, |
313 | | * including bottom of image, data source suspension, and operating |
314 | | * modes that emit multiple scanlines at a time. |
315 | | * |
316 | | * Note: we warn about excess calls to _jpeg_read_scanlines() since |
317 | | * this likely signals an application programmer error. However, |
318 | | * an oversize buffer (max_lines > scanlines remaining) is not an error. |
319 | | */ |
320 | | |
321 | | GLOBAL(JDIMENSION) |
322 | | _jpeg_read_scanlines(j_decompress_ptr cinfo, _JSAMPARRAY scanlines, |
323 | | JDIMENSION max_lines) |
324 | 21.5M | { |
325 | 21.5M | #if BITS_IN_JSAMPLE != 16 || defined(D_LOSSLESS_SUPPORTED) |
326 | 21.5M | JDIMENSION row_ctr; |
327 | | |
328 | 21.5M | #ifdef D_LOSSLESS_SUPPORTED |
329 | 21.5M | if (cinfo->master->lossless) { |
330 | | #if BITS_IN_JSAMPLE == 8 |
331 | 1.47M | if (cinfo->data_precision > BITS_IN_JSAMPLE || cinfo->data_precision < 2) |
332 | | #else |
333 | 3.18M | if (cinfo->data_precision > BITS_IN_JSAMPLE || |
334 | 3.18M | cinfo->data_precision < BITS_IN_JSAMPLE - 3) |
335 | 136 | #endif |
336 | 136 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
337 | 4.66M | } else |
338 | 16.9M | #endif |
339 | 16.9M | { |
340 | 16.9M | if (cinfo->data_precision != BITS_IN_JSAMPLE) |
341 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
342 | 16.9M | } |
343 | | |
344 | 21.5M | if (cinfo->global_state != DSTATE_SCANNING) |
345 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); |
346 | 21.5M | if (cinfo->output_scanline >= cinfo->output_height) { |
347 | 0 | WARNMS(cinfo, JWRN_TOO_MUCH_DATA); |
348 | 0 | return 0; |
349 | 0 | } |
350 | | |
351 | | /* Call progress monitor hook if present */ |
352 | 21.5M | if (cinfo->progress != NULL) { |
353 | 21.5M | cinfo->progress->pass_counter = (long)cinfo->output_scanline; |
354 | 21.5M | cinfo->progress->pass_limit = (long)cinfo->output_height; |
355 | 21.5M | (*cinfo->progress->progress_monitor) ((j_common_ptr)cinfo); |
356 | 21.5M | } |
357 | | |
358 | | /* Process some data */ |
359 | 21.5M | row_ctr = 0; |
360 | 21.5M | if (cinfo->main->_process_data == NULL) |
361 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
362 | 21.5M | (*cinfo->main->_process_data) (cinfo, scanlines, &row_ctr, max_lines); |
363 | 21.5M | cinfo->output_scanline += row_ctr; |
364 | 21.5M | return row_ctr; |
365 | | #else |
366 | | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
367 | | return 0; |
368 | | #endif |
369 | 21.5M | } Line | Count | Source | 324 | 10.3M | { | 325 | 10.3M | #if BITS_IN_JSAMPLE != 16 || defined(D_LOSSLESS_SUPPORTED) | 326 | 10.3M | JDIMENSION row_ctr; | 327 | | | 328 | 10.3M | #ifdef D_LOSSLESS_SUPPORTED | 329 | 10.3M | if (cinfo->master->lossless) { | 330 | 1.47M | #if BITS_IN_JSAMPLE == 8 | 331 | 1.47M | if (cinfo->data_precision > BITS_IN_JSAMPLE || cinfo->data_precision < 2) | 332 | | #else | 333 | | if (cinfo->data_precision > BITS_IN_JSAMPLE || | 334 | | cinfo->data_precision < BITS_IN_JSAMPLE - 3) | 335 | | #endif | 336 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 337 | 1.47M | } else | 338 | 8.87M | #endif | 339 | 8.87M | { | 340 | 8.87M | if (cinfo->data_precision != BITS_IN_JSAMPLE) | 341 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 342 | 8.87M | } | 343 | | | 344 | 10.3M | if (cinfo->global_state != DSTATE_SCANNING) | 345 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); | 346 | 10.3M | if (cinfo->output_scanline >= cinfo->output_height) { | 347 | 0 | WARNMS(cinfo, JWRN_TOO_MUCH_DATA); | 348 | 0 | return 0; | 349 | 0 | } | 350 | | | 351 | | /* Call progress monitor hook if present */ | 352 | 10.3M | if (cinfo->progress != NULL) { | 353 | 10.3M | cinfo->progress->pass_counter = (long)cinfo->output_scanline; | 354 | 10.3M | cinfo->progress->pass_limit = (long)cinfo->output_height; | 355 | 10.3M | (*cinfo->progress->progress_monitor) ((j_common_ptr)cinfo); | 356 | 10.3M | } | 357 | | | 358 | | /* Process some data */ | 359 | 10.3M | row_ctr = 0; | 360 | 10.3M | if (cinfo->main->_process_data == NULL) | 361 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 362 | 10.3M | (*cinfo->main->_process_data) (cinfo, scanlines, &row_ctr, max_lines); | 363 | 10.3M | cinfo->output_scanline += row_ctr; | 364 | 10.3M | return row_ctr; | 365 | | #else | 366 | | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 367 | | return 0; | 368 | | #endif | 369 | 10.3M | } |
Line | Count | Source | 324 | 9.53M | { | 325 | 9.53M | #if BITS_IN_JSAMPLE != 16 || defined(D_LOSSLESS_SUPPORTED) | 326 | 9.53M | JDIMENSION row_ctr; | 327 | | | 328 | 9.53M | #ifdef D_LOSSLESS_SUPPORTED | 329 | 9.53M | if (cinfo->master->lossless) { | 330 | | #if BITS_IN_JSAMPLE == 8 | 331 | | if (cinfo->data_precision > BITS_IN_JSAMPLE || cinfo->data_precision < 2) | 332 | | #else | 333 | 1.47M | if (cinfo->data_precision > BITS_IN_JSAMPLE || | 334 | 1.47M | cinfo->data_precision < BITS_IN_JSAMPLE - 3) | 335 | 0 | #endif | 336 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 337 | 1.47M | } else | 338 | 8.05M | #endif | 339 | 8.05M | { | 340 | 8.05M | if (cinfo->data_precision != BITS_IN_JSAMPLE) | 341 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 342 | 8.05M | } | 343 | | | 344 | 9.53M | if (cinfo->global_state != DSTATE_SCANNING) | 345 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); | 346 | 9.53M | if (cinfo->output_scanline >= cinfo->output_height) { | 347 | 0 | WARNMS(cinfo, JWRN_TOO_MUCH_DATA); | 348 | 0 | return 0; | 349 | 0 | } | 350 | | | 351 | | /* Call progress monitor hook if present */ | 352 | 9.53M | if (cinfo->progress != NULL) { | 353 | 9.53M | cinfo->progress->pass_counter = (long)cinfo->output_scanline; | 354 | 9.53M | cinfo->progress->pass_limit = (long)cinfo->output_height; | 355 | 9.53M | (*cinfo->progress->progress_monitor) ((j_common_ptr)cinfo); | 356 | 9.53M | } | 357 | | | 358 | | /* Process some data */ | 359 | 9.53M | row_ctr = 0; | 360 | 9.53M | if (cinfo->main->_process_data == NULL) | 361 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 362 | 9.53M | (*cinfo->main->_process_data) (cinfo, scanlines, &row_ctr, max_lines); | 363 | 9.53M | cinfo->output_scanline += row_ctr; | 364 | 9.53M | return row_ctr; | 365 | | #else | 366 | | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 367 | | return 0; | 368 | | #endif | 369 | 9.53M | } |
Line | Count | Source | 324 | 1.70M | { | 325 | 1.70M | #if BITS_IN_JSAMPLE != 16 || defined(D_LOSSLESS_SUPPORTED) | 326 | 1.70M | JDIMENSION row_ctr; | 327 | | | 328 | 1.70M | #ifdef D_LOSSLESS_SUPPORTED | 329 | 1.70M | if (cinfo->master->lossless) { | 330 | | #if BITS_IN_JSAMPLE == 8 | 331 | | if (cinfo->data_precision > BITS_IN_JSAMPLE || cinfo->data_precision < 2) | 332 | | #else | 333 | 1.70M | if (cinfo->data_precision > BITS_IN_JSAMPLE || | 334 | 1.70M | cinfo->data_precision < BITS_IN_JSAMPLE - 3) | 335 | 136 | #endif | 336 | 136 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 337 | 1.70M | } else | 338 | 0 | #endif | 339 | 0 | { | 340 | 0 | if (cinfo->data_precision != BITS_IN_JSAMPLE) | 341 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 342 | 0 | } | 343 | | | 344 | 1.70M | if (cinfo->global_state != DSTATE_SCANNING) | 345 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); | 346 | 1.70M | if (cinfo->output_scanline >= cinfo->output_height) { | 347 | 0 | WARNMS(cinfo, JWRN_TOO_MUCH_DATA); | 348 | 0 | return 0; | 349 | 0 | } | 350 | | | 351 | | /* Call progress monitor hook if present */ | 352 | 1.70M | if (cinfo->progress != NULL) { | 353 | 1.70M | cinfo->progress->pass_counter = (long)cinfo->output_scanline; | 354 | 1.70M | cinfo->progress->pass_limit = (long)cinfo->output_height; | 355 | 1.70M | (*cinfo->progress->progress_monitor) ((j_common_ptr)cinfo); | 356 | 1.70M | } | 357 | | | 358 | | /* Process some data */ | 359 | 1.70M | row_ctr = 0; | 360 | 1.70M | if (cinfo->main->_process_data == NULL) | 361 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 362 | 1.70M | (*cinfo->main->_process_data) (cinfo, scanlines, &row_ctr, max_lines); | 363 | 1.70M | cinfo->output_scanline += row_ctr; | 364 | 1.70M | return row_ctr; | 365 | | #else | 366 | | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 367 | | return 0; | 368 | | #endif | 369 | 1.70M | } |
|
370 | | |
371 | | |
372 | | #if BITS_IN_JSAMPLE != 16 |
373 | | |
374 | | /* Dummy color convert function used by _jpeg_skip_scanlines() */ |
375 | | LOCAL(void) |
376 | | noop_convert(j_decompress_ptr cinfo, _JSAMPIMAGE input_buf, |
377 | | JDIMENSION input_row, _JSAMPARRAY output_buf, int num_rows) |
378 | 901 | { |
379 | 901 | } jdapistd-8.c:noop_convert Line | Count | Source | 378 | 295 | { | 379 | 295 | } |
jdapistd-12.c:noop_convert Line | Count | Source | 378 | 606 | { | 379 | 606 | } |
|
380 | | |
381 | | |
382 | | /* Dummy quantize function used by _jpeg_skip_scanlines() */ |
383 | | LOCAL(void) |
384 | | noop_quantize(j_decompress_ptr cinfo, _JSAMPARRAY input_buf, |
385 | | _JSAMPARRAY output_buf, int num_rows) |
386 | 0 | { |
387 | 0 | } Unexecuted instantiation: jdapistd-8.c:noop_quantize Unexecuted instantiation: jdapistd-12.c:noop_quantize |
388 | | |
389 | | |
390 | | /* |
391 | | * In some cases, it is best to call _jpeg_read_scanlines() and discard the |
392 | | * output, rather than skipping the scanlines, because this allows us to |
393 | | * maintain the internal state of the context-based upsampler. In these cases, |
394 | | * we set up and tear down a dummy color converter in order to avoid valgrind |
395 | | * errors and to achieve the best possible performance. |
396 | | */ |
397 | | |
398 | | LOCAL(void) |
399 | | read_and_discard_scanlines(j_decompress_ptr cinfo, JDIMENSION num_lines) |
400 | 1.96k | { |
401 | 1.96k | JDIMENSION n; |
402 | 1.96k | #ifdef UPSAMPLE_MERGING_SUPPORTED |
403 | 1.96k | my_master_ptr master = (my_master_ptr)cinfo->master; |
404 | 1.96k | #endif |
405 | 1.96k | _JSAMPLE dummy_sample[1] = { 0 }; |
406 | 1.96k | _JSAMPROW dummy_row = dummy_sample; |
407 | 1.96k | _JSAMPARRAY scanlines = NULL; |
408 | 1.96k | void (*color_convert) (j_decompress_ptr cinfo, _JSAMPIMAGE input_buf, |
409 | 1.96k | JDIMENSION input_row, _JSAMPARRAY output_buf, |
410 | 1.96k | int num_rows) = NULL; |
411 | 1.96k | void (*color_quantize) (j_decompress_ptr cinfo, _JSAMPARRAY input_buf, |
412 | 1.96k | _JSAMPARRAY output_buf, int num_rows) = NULL; |
413 | | |
414 | 1.96k | if (cinfo->cconvert && |
415 | 1.96k | #ifdef UPSAMPLE_MERGING_SUPPORTED |
416 | 1.96k | !master->using_merged_upsample && |
417 | 1.96k | #endif |
418 | 1.96k | cinfo->cconvert->_color_convert) { |
419 | 1.96k | color_convert = cinfo->cconvert->_color_convert; |
420 | 1.96k | cinfo->cconvert->_color_convert = noop_convert; |
421 | | /* This just prevents UBSan from complaining about adding 0 to a NULL |
422 | | * pointer. The pointer isn't actually used. |
423 | | */ |
424 | 1.96k | scanlines = &dummy_row; |
425 | 1.96k | } |
426 | | |
427 | 1.96k | if (cinfo->quantize_colors && cinfo->cquantize && |
428 | 0 | cinfo->cquantize->_color_quantize) { |
429 | 0 | color_quantize = cinfo->cquantize->_color_quantize; |
430 | 0 | cinfo->cquantize->_color_quantize = noop_quantize; |
431 | 0 | } |
432 | | |
433 | 1.96k | #ifdef UPSAMPLE_MERGING_SUPPORTED |
434 | 1.96k | if (master->using_merged_upsample && cinfo->max_v_samp_factor == 2) { |
435 | 0 | my_merged_upsample_ptr upsample = (my_merged_upsample_ptr)cinfo->upsample; |
436 | 0 | scanlines = &upsample->spare_row; |
437 | 0 | } |
438 | 1.96k | #endif |
439 | | |
440 | 2.86k | for (n = 0; n < num_lines; n++) |
441 | 901 | _jpeg_read_scanlines(cinfo, scanlines, 1); |
442 | | |
443 | 1.96k | if (color_convert) |
444 | 1.96k | cinfo->cconvert->_color_convert = color_convert; |
445 | | |
446 | 1.96k | if (color_quantize) |
447 | 0 | cinfo->cquantize->_color_quantize = color_quantize; |
448 | 1.96k | } jdapistd-8.c:read_and_discard_scanlines Line | Count | Source | 400 | 1.06k | { | 401 | 1.06k | JDIMENSION n; | 402 | 1.06k | #ifdef UPSAMPLE_MERGING_SUPPORTED | 403 | 1.06k | my_master_ptr master = (my_master_ptr)cinfo->master; | 404 | 1.06k | #endif | 405 | 1.06k | _JSAMPLE dummy_sample[1] = { 0 }; | 406 | 1.06k | _JSAMPROW dummy_row = dummy_sample; | 407 | 1.06k | _JSAMPARRAY scanlines = NULL; | 408 | 1.06k | void (*color_convert) (j_decompress_ptr cinfo, _JSAMPIMAGE input_buf, | 409 | 1.06k | JDIMENSION input_row, _JSAMPARRAY output_buf, | 410 | 1.06k | int num_rows) = NULL; | 411 | 1.06k | void (*color_quantize) (j_decompress_ptr cinfo, _JSAMPARRAY input_buf, | 412 | 1.06k | _JSAMPARRAY output_buf, int num_rows) = NULL; | 413 | | | 414 | 1.06k | if (cinfo->cconvert && | 415 | 1.06k | #ifdef UPSAMPLE_MERGING_SUPPORTED | 416 | 1.06k | !master->using_merged_upsample && | 417 | 1.06k | #endif | 418 | 1.06k | cinfo->cconvert->_color_convert) { | 419 | 1.06k | color_convert = cinfo->cconvert->_color_convert; | 420 | 1.06k | cinfo->cconvert->_color_convert = noop_convert; | 421 | | /* This just prevents UBSan from complaining about adding 0 to a NULL | 422 | | * pointer. The pointer isn't actually used. | 423 | | */ | 424 | 1.06k | scanlines = &dummy_row; | 425 | 1.06k | } | 426 | | | 427 | 1.06k | if (cinfo->quantize_colors && cinfo->cquantize && | 428 | 0 | cinfo->cquantize->_color_quantize) { | 429 | 0 | color_quantize = cinfo->cquantize->_color_quantize; | 430 | 0 | cinfo->cquantize->_color_quantize = noop_quantize; | 431 | 0 | } | 432 | | | 433 | 1.06k | #ifdef UPSAMPLE_MERGING_SUPPORTED | 434 | 1.06k | if (master->using_merged_upsample && cinfo->max_v_samp_factor == 2) { | 435 | 0 | my_merged_upsample_ptr upsample = (my_merged_upsample_ptr)cinfo->upsample; | 436 | 0 | scanlines = &upsample->spare_row; | 437 | 0 | } | 438 | 1.06k | #endif | 439 | | | 440 | 1.35k | for (n = 0; n < num_lines; n++) | 441 | 295 | _jpeg_read_scanlines(cinfo, scanlines, 1); | 442 | | | 443 | 1.06k | if (color_convert) | 444 | 1.06k | cinfo->cconvert->_color_convert = color_convert; | 445 | | | 446 | 1.06k | if (color_quantize) | 447 | 0 | cinfo->cquantize->_color_quantize = color_quantize; | 448 | 1.06k | } |
jdapistd-12.c:read_and_discard_scanlines Line | Count | Source | 400 | 900 | { | 401 | 900 | JDIMENSION n; | 402 | 900 | #ifdef UPSAMPLE_MERGING_SUPPORTED | 403 | 900 | my_master_ptr master = (my_master_ptr)cinfo->master; | 404 | 900 | #endif | 405 | 900 | _JSAMPLE dummy_sample[1] = { 0 }; | 406 | 900 | _JSAMPROW dummy_row = dummy_sample; | 407 | 900 | _JSAMPARRAY scanlines = NULL; | 408 | 900 | void (*color_convert) (j_decompress_ptr cinfo, _JSAMPIMAGE input_buf, | 409 | 900 | JDIMENSION input_row, _JSAMPARRAY output_buf, | 410 | 900 | int num_rows) = NULL; | 411 | 900 | void (*color_quantize) (j_decompress_ptr cinfo, _JSAMPARRAY input_buf, | 412 | 900 | _JSAMPARRAY output_buf, int num_rows) = NULL; | 413 | | | 414 | 900 | if (cinfo->cconvert && | 415 | 900 | #ifdef UPSAMPLE_MERGING_SUPPORTED | 416 | 900 | !master->using_merged_upsample && | 417 | 900 | #endif | 418 | 900 | cinfo->cconvert->_color_convert) { | 419 | 900 | color_convert = cinfo->cconvert->_color_convert; | 420 | 900 | cinfo->cconvert->_color_convert = noop_convert; | 421 | | /* This just prevents UBSan from complaining about adding 0 to a NULL | 422 | | * pointer. The pointer isn't actually used. | 423 | | */ | 424 | 900 | scanlines = &dummy_row; | 425 | 900 | } | 426 | | | 427 | 900 | if (cinfo->quantize_colors && cinfo->cquantize && | 428 | 0 | cinfo->cquantize->_color_quantize) { | 429 | 0 | color_quantize = cinfo->cquantize->_color_quantize; | 430 | 0 | cinfo->cquantize->_color_quantize = noop_quantize; | 431 | 0 | } | 432 | | | 433 | 900 | #ifdef UPSAMPLE_MERGING_SUPPORTED | 434 | 900 | if (master->using_merged_upsample && cinfo->max_v_samp_factor == 2) { | 435 | 0 | my_merged_upsample_ptr upsample = (my_merged_upsample_ptr)cinfo->upsample; | 436 | 0 | scanlines = &upsample->spare_row; | 437 | 0 | } | 438 | 900 | #endif | 439 | | | 440 | 1.50k | for (n = 0; n < num_lines; n++) | 441 | 606 | _jpeg_read_scanlines(cinfo, scanlines, 1); | 442 | | | 443 | 900 | if (color_convert) | 444 | 900 | cinfo->cconvert->_color_convert = color_convert; | 445 | | | 446 | 900 | if (color_quantize) | 447 | 0 | cinfo->cquantize->_color_quantize = color_quantize; | 448 | 900 | } |
|
449 | | |
450 | | |
451 | | /* |
452 | | * Called by _jpeg_skip_scanlines(). This partially skips a decompress block |
453 | | * by incrementing the rowgroup counter. |
454 | | */ |
455 | | |
456 | | LOCAL(void) |
457 | | increment_simple_rowgroup_ctr(j_decompress_ptr cinfo, JDIMENSION rows) |
458 | 1.91k | { |
459 | 1.91k | JDIMENSION rows_left; |
460 | 1.91k | my_main_ptr main_ptr = (my_main_ptr)cinfo->main; |
461 | 1.91k | my_master_ptr master = (my_master_ptr)cinfo->master; |
462 | | |
463 | 1.91k | if (master->using_merged_upsample && cinfo->max_v_samp_factor == 2) { |
464 | 0 | read_and_discard_scanlines(cinfo, rows); |
465 | 0 | return; |
466 | 0 | } |
467 | | |
468 | | /* Increment the counter to the next row group after the skipped rows. */ |
469 | 1.91k | main_ptr->rowgroup_ctr += rows / cinfo->max_v_samp_factor; |
470 | | |
471 | | /* Partially skipping a row group would involve modifying the internal state |
472 | | * of the upsampler, so read the remaining rows into a dummy buffer instead. |
473 | | */ |
474 | 1.91k | rows_left = rows % cinfo->max_v_samp_factor; |
475 | 1.91k | cinfo->output_scanline += rows - rows_left; |
476 | | |
477 | 1.91k | read_and_discard_scanlines(cinfo, rows_left); |
478 | 1.91k | } jdapistd-8.c:increment_simple_rowgroup_ctr Line | Count | Source | 458 | 1.04k | { | 459 | 1.04k | JDIMENSION rows_left; | 460 | 1.04k | my_main_ptr main_ptr = (my_main_ptr)cinfo->main; | 461 | 1.04k | my_master_ptr master = (my_master_ptr)cinfo->master; | 462 | | | 463 | 1.04k | if (master->using_merged_upsample && cinfo->max_v_samp_factor == 2) { | 464 | 0 | read_and_discard_scanlines(cinfo, rows); | 465 | 0 | return; | 466 | 0 | } | 467 | | | 468 | | /* Increment the counter to the next row group after the skipped rows. */ | 469 | 1.04k | main_ptr->rowgroup_ctr += rows / cinfo->max_v_samp_factor; | 470 | | | 471 | | /* Partially skipping a row group would involve modifying the internal state | 472 | | * of the upsampler, so read the remaining rows into a dummy buffer instead. | 473 | | */ | 474 | 1.04k | rows_left = rows % cinfo->max_v_samp_factor; | 475 | 1.04k | cinfo->output_scanline += rows - rows_left; | 476 | | | 477 | 1.04k | read_and_discard_scanlines(cinfo, rows_left); | 478 | 1.04k | } |
jdapistd-12.c:increment_simple_rowgroup_ctr Line | Count | Source | 458 | 869 | { | 459 | 869 | JDIMENSION rows_left; | 460 | 869 | my_main_ptr main_ptr = (my_main_ptr)cinfo->main; | 461 | 869 | my_master_ptr master = (my_master_ptr)cinfo->master; | 462 | | | 463 | 869 | if (master->using_merged_upsample && cinfo->max_v_samp_factor == 2) { | 464 | 0 | read_and_discard_scanlines(cinfo, rows); | 465 | 0 | return; | 466 | 0 | } | 467 | | | 468 | | /* Increment the counter to the next row group after the skipped rows. */ | 469 | 869 | main_ptr->rowgroup_ctr += rows / cinfo->max_v_samp_factor; | 470 | | | 471 | | /* Partially skipping a row group would involve modifying the internal state | 472 | | * of the upsampler, so read the remaining rows into a dummy buffer instead. | 473 | | */ | 474 | 869 | rows_left = rows % cinfo->max_v_samp_factor; | 475 | 869 | cinfo->output_scanline += rows - rows_left; | 476 | | | 477 | 869 | read_and_discard_scanlines(cinfo, rows_left); | 478 | 869 | } |
|
479 | | |
480 | | /* |
481 | | * Skips some scanlines of data from the JPEG decompressor. |
482 | | * |
483 | | * The return value will be the number of lines actually skipped. If skipping |
484 | | * num_lines would move beyond the end of the image, then the actual number of |
485 | | * lines remaining in the image is returned. Otherwise, the return value will |
486 | | * be equal to num_lines. |
487 | | * |
488 | | * Refer to libjpeg.txt for more information. |
489 | | */ |
490 | | |
491 | | GLOBAL(JDIMENSION) |
492 | | _jpeg_skip_scanlines(j_decompress_ptr cinfo, JDIMENSION num_lines) |
493 | 3.89k | { |
494 | 3.89k | my_main_ptr main_ptr = (my_main_ptr)cinfo->main; |
495 | 3.89k | my_coef_ptr coef = (my_coef_ptr)cinfo->coef; |
496 | 3.89k | my_master_ptr master = (my_master_ptr)cinfo->master; |
497 | 3.89k | my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample; |
498 | 3.89k | JDIMENSION i, x; |
499 | 3.89k | int y; |
500 | 3.89k | JDIMENSION lines_per_iMCU_row, lines_left_in_iMCU_row, lines_after_iMCU_row; |
501 | 3.89k | JDIMENSION lines_to_skip, lines_to_read; |
502 | | |
503 | 3.89k | if (cinfo->data_precision != BITS_IN_JSAMPLE) |
504 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
505 | | |
506 | 3.89k | if (cinfo->master->lossless) |
507 | 0 | ERREXIT(cinfo, JERR_NOTIMPL); |
508 | | |
509 | | /* Two-pass color quantization is not supported. */ |
510 | 3.89k | if (cinfo->quantize_colors && cinfo->two_pass_quantize) |
511 | 0 | ERREXIT(cinfo, JERR_NOTIMPL); |
512 | | |
513 | 3.89k | if (cinfo->global_state != DSTATE_SCANNING) |
514 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); |
515 | | |
516 | | /* Do not skip past the bottom of the image. */ |
517 | 3.89k | if ((unsigned long long)cinfo->output_scanline + num_lines >= |
518 | 3.89k | cinfo->output_height) { |
519 | 1.93k | num_lines = cinfo->output_height - cinfo->output_scanline; |
520 | 1.93k | cinfo->output_scanline = cinfo->output_height; |
521 | 1.93k | (*cinfo->inputctl->finish_input_pass) (cinfo); |
522 | 1.93k | cinfo->inputctl->eoi_reached = TRUE; |
523 | 1.93k | return num_lines; |
524 | 1.93k | } |
525 | | |
526 | 1.96k | if (num_lines == 0) |
527 | 0 | return 0; |
528 | | |
529 | 1.96k | lines_per_iMCU_row = cinfo->_min_DCT_scaled_size * cinfo->max_v_samp_factor; |
530 | 1.96k | lines_left_in_iMCU_row = |
531 | 1.96k | (lines_per_iMCU_row - (cinfo->output_scanline % lines_per_iMCU_row)) % |
532 | 1.96k | lines_per_iMCU_row; |
533 | 1.96k | lines_after_iMCU_row = num_lines - lines_left_in_iMCU_row; |
534 | | |
535 | | /* Skip the lines remaining in the current iMCU row. When upsampling |
536 | | * requires context rows, we need the previous and next rows in order to read |
537 | | * the current row. This adds some complexity. |
538 | | */ |
539 | 1.96k | if (cinfo->upsample->need_context_rows) { |
540 | | /* If the skipped lines would not move us past the current iMCU row, we |
541 | | * read the lines and ignore them. There might be a faster way of doing |
542 | | * this, but we are facing increasing complexity for diminishing returns. |
543 | | * The increasing complexity would be a by-product of meddling with the |
544 | | * state machine used to skip context rows. Near the end of an iMCU row, |
545 | | * the next iMCU row may have already been entropy-decoded. In this unique |
546 | | * case, we will read the next iMCU row if we cannot skip past it as well. |
547 | | */ |
548 | 42 | if ((num_lines < lines_left_in_iMCU_row + 1) || |
549 | 42 | (lines_left_in_iMCU_row <= 1 && main_ptr->buffer_full && |
550 | 0 | lines_after_iMCU_row < lines_per_iMCU_row + 1)) { |
551 | 0 | read_and_discard_scanlines(cinfo, num_lines); |
552 | 0 | return num_lines; |
553 | 0 | } |
554 | | |
555 | | /* If the next iMCU row has already been entropy-decoded, make sure that |
556 | | * we do not skip too far. |
557 | | */ |
558 | 42 | if (lines_left_in_iMCU_row <= 1 && main_ptr->buffer_full) { |
559 | 0 | cinfo->output_scanline += lines_left_in_iMCU_row + lines_per_iMCU_row; |
560 | 0 | lines_after_iMCU_row -= lines_per_iMCU_row; |
561 | 42 | } else { |
562 | 42 | cinfo->output_scanline += lines_left_in_iMCU_row; |
563 | 42 | } |
564 | | |
565 | | /* If we have just completed the first block, adjust the buffer pointers */ |
566 | 42 | if (main_ptr->iMCU_row_ctr == 0 || |
567 | 0 | (main_ptr->iMCU_row_ctr == 1 && lines_left_in_iMCU_row > 2)) |
568 | 42 | set_wraparound_pointers(cinfo); |
569 | 42 | main_ptr->buffer_full = FALSE; |
570 | 42 | main_ptr->rowgroup_ctr = 0; |
571 | 42 | main_ptr->context_state = CTX_PREPARE_FOR_IMCU; |
572 | 42 | if (!master->using_merged_upsample) { |
573 | 42 | upsample->next_row_out = cinfo->max_v_samp_factor; |
574 | 42 | upsample->rows_to_go = cinfo->output_height - cinfo->output_scanline; |
575 | 42 | } |
576 | 42 | } |
577 | | |
578 | | /* Skipping is much simpler when context rows are not required. */ |
579 | 1.91k | else { |
580 | 1.91k | if (num_lines < lines_left_in_iMCU_row) { |
581 | 0 | increment_simple_rowgroup_ctr(cinfo, num_lines); |
582 | 0 | return num_lines; |
583 | 1.91k | } else { |
584 | 1.91k | cinfo->output_scanline += lines_left_in_iMCU_row; |
585 | 1.91k | main_ptr->buffer_full = FALSE; |
586 | 1.91k | main_ptr->rowgroup_ctr = 0; |
587 | 1.91k | if (!master->using_merged_upsample) { |
588 | 1.91k | upsample->next_row_out = cinfo->max_v_samp_factor; |
589 | 1.91k | upsample->rows_to_go = cinfo->output_height - cinfo->output_scanline; |
590 | 1.91k | } |
591 | 1.91k | } |
592 | 1.91k | } |
593 | | |
594 | | /* Calculate how many full iMCU rows we can skip. */ |
595 | 1.96k | if (cinfo->upsample->need_context_rows) |
596 | 42 | lines_to_skip = ((lines_after_iMCU_row - 1) / lines_per_iMCU_row) * |
597 | 42 | lines_per_iMCU_row; |
598 | 1.91k | else |
599 | 1.91k | lines_to_skip = (lines_after_iMCU_row / lines_per_iMCU_row) * |
600 | 1.91k | lines_per_iMCU_row; |
601 | | /* Calculate the number of lines that remain to be skipped after skipping all |
602 | | * of the full iMCU rows that we can. We will not read these lines unless we |
603 | | * have to. |
604 | | */ |
605 | 1.96k | lines_to_read = lines_after_iMCU_row - lines_to_skip; |
606 | | |
607 | | /* For images requiring multiple scans (progressive, non-interleaved, etc.), |
608 | | * all of the entropy decoding occurs in jpeg_start_decompress(), assuming |
609 | | * that the input data source is non-suspending. This makes skipping easy. |
610 | | */ |
611 | 1.96k | if (cinfo->inputctl->has_multiple_scans || cinfo->buffered_image) { |
612 | 1.10k | if (cinfo->upsample->need_context_rows) { |
613 | 10 | cinfo->output_scanline += lines_to_skip; |
614 | 10 | cinfo->output_iMCU_row += lines_to_skip / lines_per_iMCU_row; |
615 | 10 | main_ptr->iMCU_row_ctr += lines_to_skip / lines_per_iMCU_row; |
616 | | /* It is complex to properly move to the middle of a context block, so |
617 | | * read the remaining lines instead of skipping them. |
618 | | */ |
619 | 10 | read_and_discard_scanlines(cinfo, lines_to_read); |
620 | 1.09k | } else { |
621 | 1.09k | cinfo->output_scanline += lines_to_skip; |
622 | 1.09k | cinfo->output_iMCU_row += lines_to_skip / lines_per_iMCU_row; |
623 | 1.09k | increment_simple_rowgroup_ctr(cinfo, lines_to_read); |
624 | 1.09k | } |
625 | 1.10k | if (!master->using_merged_upsample) |
626 | 1.10k | upsample->rows_to_go = cinfo->output_height - cinfo->output_scanline; |
627 | 1.10k | return num_lines; |
628 | 1.10k | } |
629 | | |
630 | | /* Skip the iMCU rows that we can safely skip. */ |
631 | 2.31k | for (i = 0; i < lines_to_skip; i += lines_per_iMCU_row) { |
632 | 3.44k | for (y = 0; y < coef->MCU_rows_per_iMCU_row; y++) { |
633 | 249k | for (x = 0; x < cinfo->MCUs_per_row; x++) { |
634 | | /* Calling decode_mcu() with a NULL pointer causes it to discard the |
635 | | * decoded coefficients. This is ~5% faster for large subsets, but |
636 | | * it's tough to tell a difference for smaller images. |
637 | | */ |
638 | 247k | if (!cinfo->entropy->insufficient_data) |
639 | 109k | cinfo->master->last_good_iMCU_row = cinfo->input_iMCU_row; |
640 | | #ifdef WITH_PROFILE |
641 | | cinfo->master->start = getTime(); |
642 | | #endif |
643 | 247k | (*cinfo->entropy->decode_mcu) (cinfo, NULL); |
644 | | #ifdef WITH_PROFILE |
645 | | cinfo->master->entropy_elapsed += getTime() - cinfo->master->start; |
646 | | cinfo->master->entropy_mcoeffs += |
647 | | (double)cinfo->blocks_in_MCU * DCTSIZE2 / 1000000.; |
648 | | #endif |
649 | 247k | } |
650 | 1.97k | } |
651 | 1.46k | cinfo->input_iMCU_row++; |
652 | 1.46k | cinfo->output_iMCU_row++; |
653 | 1.46k | if (cinfo->input_iMCU_row < cinfo->total_iMCU_rows) |
654 | 1.46k | start_iMCU_row(cinfo); |
655 | 0 | else |
656 | 0 | (*cinfo->inputctl->finish_input_pass) (cinfo); |
657 | 1.46k | } |
658 | 853 | cinfo->output_scanline += lines_to_skip; |
659 | | |
660 | 853 | if (cinfo->upsample->need_context_rows) { |
661 | | /* Context-based upsampling keeps track of iMCU rows. */ |
662 | 32 | main_ptr->iMCU_row_ctr += lines_to_skip / lines_per_iMCU_row; |
663 | | |
664 | | /* It is complex to properly move to the middle of a context block, so |
665 | | * read the remaining lines instead of skipping them. |
666 | | */ |
667 | 32 | read_and_discard_scanlines(cinfo, lines_to_read); |
668 | 821 | } else { |
669 | 821 | increment_simple_rowgroup_ctr(cinfo, lines_to_read); |
670 | 821 | } |
671 | | |
672 | | /* Since skipping lines involves skipping the upsampling step, the value of |
673 | | * "rows_to_go" will become invalid unless we set it here. NOTE: This is a |
674 | | * bit odd, since "rows_to_go" seems to be redundantly keeping track of |
675 | | * output_scanline. |
676 | | */ |
677 | 853 | if (!master->using_merged_upsample) |
678 | 853 | upsample->rows_to_go = cinfo->output_height - cinfo->output_scanline; |
679 | | |
680 | | /* Always skip the requested number of lines. */ |
681 | 853 | return num_lines; |
682 | 1.96k | } Line | Count | Source | 493 | 2.10k | { | 494 | 2.10k | my_main_ptr main_ptr = (my_main_ptr)cinfo->main; | 495 | 2.10k | my_coef_ptr coef = (my_coef_ptr)cinfo->coef; | 496 | 2.10k | my_master_ptr master = (my_master_ptr)cinfo->master; | 497 | 2.10k | my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample; | 498 | 2.10k | JDIMENSION i, x; | 499 | 2.10k | int y; | 500 | 2.10k | JDIMENSION lines_per_iMCU_row, lines_left_in_iMCU_row, lines_after_iMCU_row; | 501 | 2.10k | JDIMENSION lines_to_skip, lines_to_read; | 502 | | | 503 | 2.10k | if (cinfo->data_precision != BITS_IN_JSAMPLE) | 504 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 505 | | | 506 | 2.10k | if (cinfo->master->lossless) | 507 | 0 | ERREXIT(cinfo, JERR_NOTIMPL); | 508 | | | 509 | | /* Two-pass color quantization is not supported. */ | 510 | 2.10k | if (cinfo->quantize_colors && cinfo->two_pass_quantize) | 511 | 0 | ERREXIT(cinfo, JERR_NOTIMPL); | 512 | | | 513 | 2.10k | if (cinfo->global_state != DSTATE_SCANNING) | 514 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); | 515 | | | 516 | | /* Do not skip past the bottom of the image. */ | 517 | 2.10k | if ((unsigned long long)cinfo->output_scanline + num_lines >= | 518 | 2.10k | cinfo->output_height) { | 519 | 1.04k | num_lines = cinfo->output_height - cinfo->output_scanline; | 520 | 1.04k | cinfo->output_scanline = cinfo->output_height; | 521 | 1.04k | (*cinfo->inputctl->finish_input_pass) (cinfo); | 522 | 1.04k | cinfo->inputctl->eoi_reached = TRUE; | 523 | 1.04k | return num_lines; | 524 | 1.04k | } | 525 | | | 526 | 1.06k | if (num_lines == 0) | 527 | 0 | return 0; | 528 | | | 529 | 1.06k | lines_per_iMCU_row = cinfo->_min_DCT_scaled_size * cinfo->max_v_samp_factor; | 530 | 1.06k | lines_left_in_iMCU_row = | 531 | 1.06k | (lines_per_iMCU_row - (cinfo->output_scanline % lines_per_iMCU_row)) % | 532 | 1.06k | lines_per_iMCU_row; | 533 | 1.06k | lines_after_iMCU_row = num_lines - lines_left_in_iMCU_row; | 534 | | | 535 | | /* Skip the lines remaining in the current iMCU row. When upsampling | 536 | | * requires context rows, we need the previous and next rows in order to read | 537 | | * the current row. This adds some complexity. | 538 | | */ | 539 | 1.06k | if (cinfo->upsample->need_context_rows) { | 540 | | /* If the skipped lines would not move us past the current iMCU row, we | 541 | | * read the lines and ignore them. There might be a faster way of doing | 542 | | * this, but we are facing increasing complexity for diminishing returns. | 543 | | * The increasing complexity would be a by-product of meddling with the | 544 | | * state machine used to skip context rows. Near the end of an iMCU row, | 545 | | * the next iMCU row may have already been entropy-decoded. In this unique | 546 | | * case, we will read the next iMCU row if we cannot skip past it as well. | 547 | | */ | 548 | 11 | if ((num_lines < lines_left_in_iMCU_row + 1) || | 549 | 11 | (lines_left_in_iMCU_row <= 1 && main_ptr->buffer_full && | 550 | 0 | lines_after_iMCU_row < lines_per_iMCU_row + 1)) { | 551 | 0 | read_and_discard_scanlines(cinfo, num_lines); | 552 | 0 | return num_lines; | 553 | 0 | } | 554 | | | 555 | | /* If the next iMCU row has already been entropy-decoded, make sure that | 556 | | * we do not skip too far. | 557 | | */ | 558 | 11 | if (lines_left_in_iMCU_row <= 1 && main_ptr->buffer_full) { | 559 | 0 | cinfo->output_scanline += lines_left_in_iMCU_row + lines_per_iMCU_row; | 560 | 0 | lines_after_iMCU_row -= lines_per_iMCU_row; | 561 | 11 | } else { | 562 | 11 | cinfo->output_scanline += lines_left_in_iMCU_row; | 563 | 11 | } | 564 | | | 565 | | /* If we have just completed the first block, adjust the buffer pointers */ | 566 | 11 | if (main_ptr->iMCU_row_ctr == 0 || | 567 | 0 | (main_ptr->iMCU_row_ctr == 1 && lines_left_in_iMCU_row > 2)) | 568 | 11 | set_wraparound_pointers(cinfo); | 569 | 11 | main_ptr->buffer_full = FALSE; | 570 | 11 | main_ptr->rowgroup_ctr = 0; | 571 | 11 | main_ptr->context_state = CTX_PREPARE_FOR_IMCU; | 572 | 11 | if (!master->using_merged_upsample) { | 573 | 11 | upsample->next_row_out = cinfo->max_v_samp_factor; | 574 | 11 | upsample->rows_to_go = cinfo->output_height - cinfo->output_scanline; | 575 | 11 | } | 576 | 11 | } | 577 | | | 578 | | /* Skipping is much simpler when context rows are not required. */ | 579 | 1.04k | else { | 580 | 1.04k | if (num_lines < lines_left_in_iMCU_row) { | 581 | 0 | increment_simple_rowgroup_ctr(cinfo, num_lines); | 582 | 0 | return num_lines; | 583 | 1.04k | } else { | 584 | 1.04k | cinfo->output_scanline += lines_left_in_iMCU_row; | 585 | 1.04k | main_ptr->buffer_full = FALSE; | 586 | 1.04k | main_ptr->rowgroup_ctr = 0; | 587 | 1.04k | if (!master->using_merged_upsample) { | 588 | 1.04k | upsample->next_row_out = cinfo->max_v_samp_factor; | 589 | 1.04k | upsample->rows_to_go = cinfo->output_height - cinfo->output_scanline; | 590 | 1.04k | } | 591 | 1.04k | } | 592 | 1.04k | } | 593 | | | 594 | | /* Calculate how many full iMCU rows we can skip. */ | 595 | 1.06k | if (cinfo->upsample->need_context_rows) | 596 | 11 | lines_to_skip = ((lines_after_iMCU_row - 1) / lines_per_iMCU_row) * | 597 | 11 | lines_per_iMCU_row; | 598 | 1.04k | else | 599 | 1.04k | lines_to_skip = (lines_after_iMCU_row / lines_per_iMCU_row) * | 600 | 1.04k | lines_per_iMCU_row; | 601 | | /* Calculate the number of lines that remain to be skipped after skipping all | 602 | | * of the full iMCU rows that we can. We will not read these lines unless we | 603 | | * have to. | 604 | | */ | 605 | 1.06k | lines_to_read = lines_after_iMCU_row - lines_to_skip; | 606 | | | 607 | | /* For images requiring multiple scans (progressive, non-interleaved, etc.), | 608 | | * all of the entropy decoding occurs in jpeg_start_decompress(), assuming | 609 | | * that the input data source is non-suspending. This makes skipping easy. | 610 | | */ | 611 | 1.06k | if (cinfo->inputctl->has_multiple_scans || cinfo->buffered_image) { | 612 | 603 | if (cinfo->upsample->need_context_rows) { | 613 | 5 | cinfo->output_scanline += lines_to_skip; | 614 | 5 | cinfo->output_iMCU_row += lines_to_skip / lines_per_iMCU_row; | 615 | 5 | main_ptr->iMCU_row_ctr += lines_to_skip / lines_per_iMCU_row; | 616 | | /* It is complex to properly move to the middle of a context block, so | 617 | | * read the remaining lines instead of skipping them. | 618 | | */ | 619 | 5 | read_and_discard_scanlines(cinfo, lines_to_read); | 620 | 598 | } else { | 621 | 598 | cinfo->output_scanline += lines_to_skip; | 622 | 598 | cinfo->output_iMCU_row += lines_to_skip / lines_per_iMCU_row; | 623 | 598 | increment_simple_rowgroup_ctr(cinfo, lines_to_read); | 624 | 598 | } | 625 | 603 | if (!master->using_merged_upsample) | 626 | 603 | upsample->rows_to_go = cinfo->output_height - cinfo->output_scanline; | 627 | 603 | return num_lines; | 628 | 603 | } | 629 | | | 630 | | /* Skip the iMCU rows that we can safely skip. */ | 631 | 1.33k | for (i = 0; i < lines_to_skip; i += lines_per_iMCU_row) { | 632 | 2.00k | for (y = 0; y < coef->MCU_rows_per_iMCU_row; y++) { | 633 | 138k | for (x = 0; x < cinfo->MCUs_per_row; x++) { | 634 | | /* Calling decode_mcu() with a NULL pointer causes it to discard the | 635 | | * decoded coefficients. This is ~5% faster for large subsets, but | 636 | | * it's tough to tell a difference for smaller images. | 637 | | */ | 638 | 137k | if (!cinfo->entropy->insufficient_data) | 639 | 43.2k | cinfo->master->last_good_iMCU_row = cinfo->input_iMCU_row; | 640 | | #ifdef WITH_PROFILE | 641 | | cinfo->master->start = getTime(); | 642 | | #endif | 643 | 137k | (*cinfo->entropy->decode_mcu) (cinfo, NULL); | 644 | | #ifdef WITH_PROFILE | 645 | | cinfo->master->entropy_elapsed += getTime() - cinfo->master->start; | 646 | | cinfo->master->entropy_mcoeffs += | 647 | | (double)cinfo->blocks_in_MCU * DCTSIZE2 / 1000000.; | 648 | | #endif | 649 | 137k | } | 650 | 1.12k | } | 651 | 880 | cinfo->input_iMCU_row++; | 652 | 880 | cinfo->output_iMCU_row++; | 653 | 880 | if (cinfo->input_iMCU_row < cinfo->total_iMCU_rows) | 654 | 880 | start_iMCU_row(cinfo); | 655 | 0 | else | 656 | 0 | (*cinfo->inputctl->finish_input_pass) (cinfo); | 657 | 880 | } | 658 | 457 | cinfo->output_scanline += lines_to_skip; | 659 | | | 660 | 457 | if (cinfo->upsample->need_context_rows) { | 661 | | /* Context-based upsampling keeps track of iMCU rows. */ | 662 | 6 | main_ptr->iMCU_row_ctr += lines_to_skip / lines_per_iMCU_row; | 663 | | | 664 | | /* It is complex to properly move to the middle of a context block, so | 665 | | * read the remaining lines instead of skipping them. | 666 | | */ | 667 | 6 | read_and_discard_scanlines(cinfo, lines_to_read); | 668 | 451 | } else { | 669 | 451 | increment_simple_rowgroup_ctr(cinfo, lines_to_read); | 670 | 451 | } | 671 | | | 672 | | /* Since skipping lines involves skipping the upsampling step, the value of | 673 | | * "rows_to_go" will become invalid unless we set it here. NOTE: This is a | 674 | | * bit odd, since "rows_to_go" seems to be redundantly keeping track of | 675 | | * output_scanline. | 676 | | */ | 677 | 457 | if (!master->using_merged_upsample) | 678 | 457 | upsample->rows_to_go = cinfo->output_height - cinfo->output_scanline; | 679 | | | 680 | | /* Always skip the requested number of lines. */ | 681 | 457 | return num_lines; | 682 | 1.06k | } |
Line | Count | Source | 493 | 1.79k | { | 494 | 1.79k | my_main_ptr main_ptr = (my_main_ptr)cinfo->main; | 495 | 1.79k | my_coef_ptr coef = (my_coef_ptr)cinfo->coef; | 496 | 1.79k | my_master_ptr master = (my_master_ptr)cinfo->master; | 497 | 1.79k | my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample; | 498 | 1.79k | JDIMENSION i, x; | 499 | 1.79k | int y; | 500 | 1.79k | JDIMENSION lines_per_iMCU_row, lines_left_in_iMCU_row, lines_after_iMCU_row; | 501 | 1.79k | JDIMENSION lines_to_skip, lines_to_read; | 502 | | | 503 | 1.79k | if (cinfo->data_precision != BITS_IN_JSAMPLE) | 504 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 505 | | | 506 | 1.79k | if (cinfo->master->lossless) | 507 | 0 | ERREXIT(cinfo, JERR_NOTIMPL); | 508 | | | 509 | | /* Two-pass color quantization is not supported. */ | 510 | 1.79k | if (cinfo->quantize_colors && cinfo->two_pass_quantize) | 511 | 0 | ERREXIT(cinfo, JERR_NOTIMPL); | 512 | | | 513 | 1.79k | if (cinfo->global_state != DSTATE_SCANNING) | 514 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); | 515 | | | 516 | | /* Do not skip past the bottom of the image. */ | 517 | 1.79k | if ((unsigned long long)cinfo->output_scanline + num_lines >= | 518 | 1.79k | cinfo->output_height) { | 519 | 890 | num_lines = cinfo->output_height - cinfo->output_scanline; | 520 | 890 | cinfo->output_scanline = cinfo->output_height; | 521 | 890 | (*cinfo->inputctl->finish_input_pass) (cinfo); | 522 | 890 | cinfo->inputctl->eoi_reached = TRUE; | 523 | 890 | return num_lines; | 524 | 890 | } | 525 | | | 526 | 900 | if (num_lines == 0) | 527 | 0 | return 0; | 528 | | | 529 | 900 | lines_per_iMCU_row = cinfo->_min_DCT_scaled_size * cinfo->max_v_samp_factor; | 530 | 900 | lines_left_in_iMCU_row = | 531 | 900 | (lines_per_iMCU_row - (cinfo->output_scanline % lines_per_iMCU_row)) % | 532 | 900 | lines_per_iMCU_row; | 533 | 900 | lines_after_iMCU_row = num_lines - lines_left_in_iMCU_row; | 534 | | | 535 | | /* Skip the lines remaining in the current iMCU row. When upsampling | 536 | | * requires context rows, we need the previous and next rows in order to read | 537 | | * the current row. This adds some complexity. | 538 | | */ | 539 | 900 | if (cinfo->upsample->need_context_rows) { | 540 | | /* If the skipped lines would not move us past the current iMCU row, we | 541 | | * read the lines and ignore them. There might be a faster way of doing | 542 | | * this, but we are facing increasing complexity for diminishing returns. | 543 | | * The increasing complexity would be a by-product of meddling with the | 544 | | * state machine used to skip context rows. Near the end of an iMCU row, | 545 | | * the next iMCU row may have already been entropy-decoded. In this unique | 546 | | * case, we will read the next iMCU row if we cannot skip past it as well. | 547 | | */ | 548 | 31 | if ((num_lines < lines_left_in_iMCU_row + 1) || | 549 | 31 | (lines_left_in_iMCU_row <= 1 && main_ptr->buffer_full && | 550 | 0 | lines_after_iMCU_row < lines_per_iMCU_row + 1)) { | 551 | 0 | read_and_discard_scanlines(cinfo, num_lines); | 552 | 0 | return num_lines; | 553 | 0 | } | 554 | | | 555 | | /* If the next iMCU row has already been entropy-decoded, make sure that | 556 | | * we do not skip too far. | 557 | | */ | 558 | 31 | if (lines_left_in_iMCU_row <= 1 && main_ptr->buffer_full) { | 559 | 0 | cinfo->output_scanline += lines_left_in_iMCU_row + lines_per_iMCU_row; | 560 | 0 | lines_after_iMCU_row -= lines_per_iMCU_row; | 561 | 31 | } else { | 562 | 31 | cinfo->output_scanline += lines_left_in_iMCU_row; | 563 | 31 | } | 564 | | | 565 | | /* If we have just completed the first block, adjust the buffer pointers */ | 566 | 31 | if (main_ptr->iMCU_row_ctr == 0 || | 567 | 0 | (main_ptr->iMCU_row_ctr == 1 && lines_left_in_iMCU_row > 2)) | 568 | 31 | set_wraparound_pointers(cinfo); | 569 | 31 | main_ptr->buffer_full = FALSE; | 570 | 31 | main_ptr->rowgroup_ctr = 0; | 571 | 31 | main_ptr->context_state = CTX_PREPARE_FOR_IMCU; | 572 | 31 | if (!master->using_merged_upsample) { | 573 | 31 | upsample->next_row_out = cinfo->max_v_samp_factor; | 574 | 31 | upsample->rows_to_go = cinfo->output_height - cinfo->output_scanline; | 575 | 31 | } | 576 | 31 | } | 577 | | | 578 | | /* Skipping is much simpler when context rows are not required. */ | 579 | 869 | else { | 580 | 869 | if (num_lines < lines_left_in_iMCU_row) { | 581 | 0 | increment_simple_rowgroup_ctr(cinfo, num_lines); | 582 | 0 | return num_lines; | 583 | 869 | } else { | 584 | 869 | cinfo->output_scanline += lines_left_in_iMCU_row; | 585 | 869 | main_ptr->buffer_full = FALSE; | 586 | 869 | main_ptr->rowgroup_ctr = 0; | 587 | 869 | if (!master->using_merged_upsample) { | 588 | 869 | upsample->next_row_out = cinfo->max_v_samp_factor; | 589 | 869 | upsample->rows_to_go = cinfo->output_height - cinfo->output_scanline; | 590 | 869 | } | 591 | 869 | } | 592 | 869 | } | 593 | | | 594 | | /* Calculate how many full iMCU rows we can skip. */ | 595 | 900 | if (cinfo->upsample->need_context_rows) | 596 | 31 | lines_to_skip = ((lines_after_iMCU_row - 1) / lines_per_iMCU_row) * | 597 | 31 | lines_per_iMCU_row; | 598 | 869 | else | 599 | 869 | lines_to_skip = (lines_after_iMCU_row / lines_per_iMCU_row) * | 600 | 869 | lines_per_iMCU_row; | 601 | | /* Calculate the number of lines that remain to be skipped after skipping all | 602 | | * of the full iMCU rows that we can. We will not read these lines unless we | 603 | | * have to. | 604 | | */ | 605 | 900 | lines_to_read = lines_after_iMCU_row - lines_to_skip; | 606 | | | 607 | | /* For images requiring multiple scans (progressive, non-interleaved, etc.), | 608 | | * all of the entropy decoding occurs in jpeg_start_decompress(), assuming | 609 | | * that the input data source is non-suspending. This makes skipping easy. | 610 | | */ | 611 | 900 | if (cinfo->inputctl->has_multiple_scans || cinfo->buffered_image) { | 612 | 504 | if (cinfo->upsample->need_context_rows) { | 613 | 5 | cinfo->output_scanline += lines_to_skip; | 614 | 5 | cinfo->output_iMCU_row += lines_to_skip / lines_per_iMCU_row; | 615 | 5 | main_ptr->iMCU_row_ctr += lines_to_skip / lines_per_iMCU_row; | 616 | | /* It is complex to properly move to the middle of a context block, so | 617 | | * read the remaining lines instead of skipping them. | 618 | | */ | 619 | 5 | read_and_discard_scanlines(cinfo, lines_to_read); | 620 | 499 | } else { | 621 | 499 | cinfo->output_scanline += lines_to_skip; | 622 | 499 | cinfo->output_iMCU_row += lines_to_skip / lines_per_iMCU_row; | 623 | 499 | increment_simple_rowgroup_ctr(cinfo, lines_to_read); | 624 | 499 | } | 625 | 504 | if (!master->using_merged_upsample) | 626 | 504 | upsample->rows_to_go = cinfo->output_height - cinfo->output_scanline; | 627 | 504 | return num_lines; | 628 | 504 | } | 629 | | | 630 | | /* Skip the iMCU rows that we can safely skip. */ | 631 | 981 | for (i = 0; i < lines_to_skip; i += lines_per_iMCU_row) { | 632 | 1.43k | for (y = 0; y < coef->MCU_rows_per_iMCU_row; y++) { | 633 | 110k | for (x = 0; x < cinfo->MCUs_per_row; x++) { | 634 | | /* Calling decode_mcu() with a NULL pointer causes it to discard the | 635 | | * decoded coefficients. This is ~5% faster for large subsets, but | 636 | | * it's tough to tell a difference for smaller images. | 637 | | */ | 638 | 109k | if (!cinfo->entropy->insufficient_data) | 639 | 66.7k | cinfo->master->last_good_iMCU_row = cinfo->input_iMCU_row; | 640 | | #ifdef WITH_PROFILE | 641 | | cinfo->master->start = getTime(); | 642 | | #endif | 643 | 109k | (*cinfo->entropy->decode_mcu) (cinfo, NULL); | 644 | | #ifdef WITH_PROFILE | 645 | | cinfo->master->entropy_elapsed += getTime() - cinfo->master->start; | 646 | | cinfo->master->entropy_mcoeffs += | 647 | | (double)cinfo->blocks_in_MCU * DCTSIZE2 / 1000000.; | 648 | | #endif | 649 | 109k | } | 650 | 850 | } | 651 | 585 | cinfo->input_iMCU_row++; | 652 | 585 | cinfo->output_iMCU_row++; | 653 | 585 | if (cinfo->input_iMCU_row < cinfo->total_iMCU_rows) | 654 | 585 | start_iMCU_row(cinfo); | 655 | 0 | else | 656 | 0 | (*cinfo->inputctl->finish_input_pass) (cinfo); | 657 | 585 | } | 658 | 396 | cinfo->output_scanline += lines_to_skip; | 659 | | | 660 | 396 | if (cinfo->upsample->need_context_rows) { | 661 | | /* Context-based upsampling keeps track of iMCU rows. */ | 662 | 26 | main_ptr->iMCU_row_ctr += lines_to_skip / lines_per_iMCU_row; | 663 | | | 664 | | /* It is complex to properly move to the middle of a context block, so | 665 | | * read the remaining lines instead of skipping them. | 666 | | */ | 667 | 26 | read_and_discard_scanlines(cinfo, lines_to_read); | 668 | 370 | } else { | 669 | 370 | increment_simple_rowgroup_ctr(cinfo, lines_to_read); | 670 | 370 | } | 671 | | | 672 | | /* Since skipping lines involves skipping the upsampling step, the value of | 673 | | * "rows_to_go" will become invalid unless we set it here. NOTE: This is a | 674 | | * bit odd, since "rows_to_go" seems to be redundantly keeping track of | 675 | | * output_scanline. | 676 | | */ | 677 | 396 | if (!master->using_merged_upsample) | 678 | 396 | upsample->rows_to_go = cinfo->output_height - cinfo->output_scanline; | 679 | | | 680 | | /* Always skip the requested number of lines. */ | 681 | 396 | return num_lines; | 682 | 900 | } |
|
683 | | |
684 | | /* |
685 | | * Alternate entry point to read raw data. |
686 | | * Processes exactly one iMCU row per call, unless suspended. |
687 | | */ |
688 | | |
689 | | GLOBAL(JDIMENSION) |
690 | | _jpeg_read_raw_data(j_decompress_ptr cinfo, _JSAMPIMAGE data, |
691 | | JDIMENSION max_lines) |
692 | 0 | { |
693 | 0 | JDIMENSION lines_per_iMCU_row; |
694 | |
|
695 | 0 | if (cinfo->data_precision != BITS_IN_JSAMPLE) |
696 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
697 | |
|
698 | 0 | if (cinfo->master->lossless) |
699 | 0 | ERREXIT(cinfo, JERR_NOTIMPL); |
700 | |
|
701 | 0 | if (cinfo->global_state != DSTATE_RAW_OK) |
702 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); |
703 | 0 | if (cinfo->output_scanline >= cinfo->output_height) { |
704 | 0 | WARNMS(cinfo, JWRN_TOO_MUCH_DATA); |
705 | 0 | return 0; |
706 | 0 | } |
707 | | |
708 | | /* Call progress monitor hook if present */ |
709 | 0 | if (cinfo->progress != NULL) { |
710 | 0 | cinfo->progress->pass_counter = (long)cinfo->output_scanline; |
711 | 0 | cinfo->progress->pass_limit = (long)cinfo->output_height; |
712 | 0 | (*cinfo->progress->progress_monitor) ((j_common_ptr)cinfo); |
713 | 0 | } |
714 | | |
715 | | /* Verify that at least one iMCU row can be returned. */ |
716 | 0 | lines_per_iMCU_row = cinfo->max_v_samp_factor * cinfo->_min_DCT_scaled_size; |
717 | 0 | if (max_lines < lines_per_iMCU_row) |
718 | 0 | ERREXIT(cinfo, JERR_BUFFER_SIZE); |
719 | | |
720 | | /* Decompress directly into user's buffer. */ |
721 | 0 | if (cinfo->coef->_decompress_data == NULL) |
722 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
723 | 0 | if (!(*cinfo->coef->_decompress_data) (cinfo, data)) |
724 | 0 | return 0; /* suspension forced, can do nothing more */ |
725 | | |
726 | | /* OK, we processed one iMCU row. */ |
727 | 0 | cinfo->output_scanline += lines_per_iMCU_row; |
728 | 0 | return lines_per_iMCU_row; |
729 | 0 | } Unexecuted instantiation: jpeg_read_raw_data Unexecuted instantiation: jpeg12_read_raw_data |
730 | | |
731 | | #endif /* BITS_IN_JSAMPLE != 16 */ |
732 | | |
733 | | |
734 | | #if BITS_IN_JSAMPLE == 8 |
735 | | |
736 | | /* Additional entry points for buffered-image mode. */ |
737 | | |
738 | | #ifdef D_MULTISCAN_FILES_SUPPORTED |
739 | | |
740 | | /* |
741 | | * Initialize for an output pass in buffered-image mode. |
742 | | */ |
743 | | |
744 | | GLOBAL(boolean) |
745 | | jpeg_start_output(j_decompress_ptr cinfo, int scan_number) |
746 | 0 | { |
747 | 0 | if (cinfo->global_state != DSTATE_BUFIMAGE && |
748 | 0 | cinfo->global_state != DSTATE_PRESCAN) |
749 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); |
750 | | /* Limit scan number to valid range */ |
751 | 0 | if (scan_number <= 0) |
752 | 0 | scan_number = 1; |
753 | 0 | if (cinfo->inputctl->eoi_reached && scan_number > cinfo->input_scan_number) |
754 | 0 | scan_number = cinfo->input_scan_number; |
755 | 0 | cinfo->output_scan_number = scan_number; |
756 | | /* Perform any dummy output passes, and set up for the real pass */ |
757 | 0 | return output_pass_setup(cinfo); |
758 | 0 | } |
759 | | |
760 | | |
761 | | /* |
762 | | * Finish up after an output pass in buffered-image mode. |
763 | | * |
764 | | * Returns FALSE if suspended. The return value need be inspected only if |
765 | | * a suspending data source is used. |
766 | | */ |
767 | | |
768 | | GLOBAL(boolean) |
769 | | jpeg_finish_output(j_decompress_ptr cinfo) |
770 | 0 | { |
771 | 0 | if ((cinfo->global_state == DSTATE_SCANNING || |
772 | 0 | cinfo->global_state == DSTATE_RAW_OK) && cinfo->buffered_image) { |
773 | | /* Terminate this pass. */ |
774 | | /* We do not require the whole pass to have been completed. */ |
775 | 0 | (*cinfo->master->finish_output_pass) (cinfo); |
776 | 0 | cinfo->global_state = DSTATE_BUFPOST; |
777 | 0 | } else if (cinfo->global_state != DSTATE_BUFPOST) { |
778 | | /* BUFPOST = repeat call after a suspension, anything else is error */ |
779 | 0 | ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state); |
780 | 0 | } |
781 | | /* Read markers looking for SOS or EOI */ |
782 | 0 | while (cinfo->input_scan_number <= cinfo->output_scan_number && |
783 | 0 | !cinfo->inputctl->eoi_reached) { |
784 | 0 | if ((*cinfo->inputctl->consume_input) (cinfo) == JPEG_SUSPENDED) |
785 | 0 | return FALSE; /* Suspend, come back later */ |
786 | 0 | } |
787 | 0 | cinfo->global_state = DSTATE_BUFIMAGE; |
788 | 0 | return TRUE; |
789 | 0 | } |
790 | | |
791 | | #endif /* D_MULTISCAN_FILES_SUPPORTED */ |
792 | | |
793 | | #endif /* BITS_IN_JSAMPLE == 8 */ |