/src/libjpeg-turbo.dev/src/jdsample.c
Line | Count | Source |
1 | | /* |
2 | | * jdsample.c |
3 | | * |
4 | | * This file was part of the Independent JPEG Group's software: |
5 | | * Copyright (C) 1991-1996, Thomas G. Lane. |
6 | | * libjpeg-turbo Modifications: |
7 | | * Copyright 2009 Pierre Ossman <ossman@cendio.se> for Cendio AB |
8 | | * Copyright (C) 2010, 2015-2016, 2022, 2024-2026, D. R. Commander. |
9 | | * Copyright (C) 2015, Google, Inc. |
10 | | * Copyright (C) 2019-2020, Arm Limited. |
11 | | * For conditions of distribution and use, see the accompanying README.ijg |
12 | | * file. |
13 | | * |
14 | | * This file contains upsampling routines. |
15 | | * |
16 | | * Upsampling input data is counted in "row groups". A row group is defined to |
17 | | * be (v_samp_factor * DCT_scaled_size / min_DCT_scaled_size) sample rows of |
18 | | * each component. Upsampling will normally produce max_v_samp_factor rows of |
19 | | * each component from each row group (but this could vary if the upsampler is |
20 | | * applying a scale factor of its own). |
21 | | * |
22 | | * An excellent reference for image resampling is |
23 | | * Digital Image Warping, George Wolberg, 1990. |
24 | | * Pub. by IEEE Computer Society Press, Los Alamitos, CA. ISBN 0-8186-8944-7. |
25 | | */ |
26 | | |
27 | | #include "jinclude.h" |
28 | | #include "jdsample.h" |
29 | | #ifdef WITH_SIMD |
30 | | #include "../simd/jsimd.h" |
31 | | #endif |
32 | | #include "jpegapicomp.h" |
33 | | #ifdef WITH_PROFILE |
34 | | #include "tjutil.h" |
35 | | #endif |
36 | | |
37 | | |
38 | | |
39 | | #if BITS_IN_JSAMPLE != 16 || defined(D_LOSSLESS_SUPPORTED) |
40 | | |
41 | | /* |
42 | | * Initialize for an upsampling pass. |
43 | | */ |
44 | | |
45 | | METHODDEF(void) |
46 | | start_pass_upsample(j_decompress_ptr cinfo) |
47 | 0 | { |
48 | 0 | my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample; |
49 | | |
50 | | /* Mark the conversion buffer empty */ |
51 | 0 | upsample->next_row_out = cinfo->max_v_samp_factor; |
52 | | /* Initialize total-height counter for detecting bottom of image */ |
53 | 0 | upsample->rows_to_go = cinfo->output_height; |
54 | 0 | } Unexecuted instantiation: jdsample-8.c:start_pass_upsample Unexecuted instantiation: jdsample-12.c:start_pass_upsample Unexecuted instantiation: jdsample-16.c:start_pass_upsample |
55 | | |
56 | | |
57 | | /* |
58 | | * Control routine to do upsampling (and color conversion). |
59 | | * |
60 | | * In this version we upsample each component independently. |
61 | | * We upsample one row group into the conversion buffer, then apply |
62 | | * color conversion a row at a time. |
63 | | */ |
64 | | |
65 | | METHODDEF(void) |
66 | | sep_upsample(j_decompress_ptr cinfo, _JSAMPIMAGE input_buf, |
67 | | JDIMENSION *in_row_group_ctr, JDIMENSION in_row_groups_avail, |
68 | | _JSAMPARRAY output_buf, JDIMENSION *out_row_ctr, |
69 | | JDIMENSION out_rows_avail) |
70 | 0 | { |
71 | 0 | my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample; |
72 | 0 | int ci; |
73 | 0 | jpeg_component_info *compptr; |
74 | 0 | JDIMENSION num_rows; |
75 | | |
76 | | /* Fill the conversion buffer, if it's empty */ |
77 | 0 | if (upsample->next_row_out >= cinfo->max_v_samp_factor) { |
78 | 0 | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; |
79 | 0 | ci++, compptr++) { |
80 | | /* Invoke per-component upsample method. Notice we pass a POINTER |
81 | | * to color_buf[ci], so that fullsize_upsample can change it. |
82 | | */ |
83 | | #ifdef WITH_PROFILE |
84 | | cinfo->master->start = getTime(); |
85 | | #endif |
86 | 0 | (*upsample->methods[ci]) (cinfo, compptr, |
87 | 0 | input_buf[ci] + (*in_row_group_ctr * upsample->rowgroup_height[ci]), |
88 | 0 | upsample->color_buf + ci); |
89 | | #ifdef WITH_PROFILE |
90 | | cinfo->master->upsample_elapsed += getTime() - cinfo->master->start; |
91 | | cinfo->master->upsample_msamples += |
92 | | (double)cinfo->output_width * cinfo->max_v_samp_factor / 1000000.; |
93 | | #endif |
94 | 0 | } |
95 | 0 | upsample->next_row_out = 0; |
96 | 0 | } |
97 | | |
98 | | /* Color-convert and emit rows */ |
99 | | |
100 | | /* How many we have in the buffer: */ |
101 | 0 | num_rows = (JDIMENSION)(cinfo->max_v_samp_factor - upsample->next_row_out); |
102 | | /* Not more than the distance to the end of the image. Need this test |
103 | | * in case the image height is not a multiple of max_v_samp_factor: |
104 | | */ |
105 | 0 | if (num_rows > upsample->rows_to_go) |
106 | 0 | num_rows = upsample->rows_to_go; |
107 | | /* And not more than what the client can accept: */ |
108 | 0 | out_rows_avail -= *out_row_ctr; |
109 | 0 | if (num_rows > out_rows_avail) |
110 | 0 | num_rows = out_rows_avail; |
111 | |
|
112 | | #ifdef WITH_PROFILE |
113 | | cinfo->master->start = getTime(); |
114 | | #endif |
115 | 0 | (*cinfo->cconvert->_color_convert) (cinfo, upsample->color_buf, |
116 | 0 | (JDIMENSION)upsample->next_row_out, |
117 | 0 | output_buf + *out_row_ctr, |
118 | 0 | (int)num_rows); |
119 | | #ifdef WITH_PROFILE |
120 | | cinfo->master->cconvert_elapsed += getTime() - cinfo->master->start; |
121 | | cinfo->master->cconvert_mpixels += |
122 | | (double)cinfo->output_width * num_rows / 1000000.; |
123 | | #endif |
124 | | |
125 | | /* Adjust counts */ |
126 | 0 | *out_row_ctr += num_rows; |
127 | 0 | upsample->rows_to_go -= num_rows; |
128 | 0 | upsample->next_row_out += num_rows; |
129 | | /* When the buffer is emptied, declare this input row group consumed */ |
130 | 0 | if (upsample->next_row_out >= cinfo->max_v_samp_factor) |
131 | 0 | (*in_row_group_ctr)++; |
132 | 0 | } Unexecuted instantiation: jdsample-8.c:sep_upsample Unexecuted instantiation: jdsample-12.c:sep_upsample Unexecuted instantiation: jdsample-16.c:sep_upsample |
133 | | |
134 | | |
135 | | /* |
136 | | * These are the routines invoked by sep_upsample to upsample values of a |
137 | | * single component. One row group is processed per call. |
138 | | */ |
139 | | |
140 | | |
141 | | /* |
142 | | * For full-size components, we just make color_buf[ci] point at the |
143 | | * input buffer, and thus avoid copying any data. Note that this is |
144 | | * safe only because sep_upsample doesn't declare the input row group |
145 | | * "consumed" until we are done color converting and emitting it. |
146 | | */ |
147 | | |
148 | | METHODDEF(void) |
149 | | fullsize_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr, |
150 | | _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr) |
151 | 0 | { |
152 | 0 | *output_data_ptr = input_data; |
153 | 0 | } Unexecuted instantiation: jdsample-8.c:fullsize_upsample Unexecuted instantiation: jdsample-12.c:fullsize_upsample Unexecuted instantiation: jdsample-16.c:fullsize_upsample |
154 | | |
155 | | |
156 | | /* |
157 | | * This is a no-op version used for "uninteresting" components. |
158 | | * These components will not be referenced by color conversion. |
159 | | */ |
160 | | |
161 | | METHODDEF(void) |
162 | | noop_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr, |
163 | | _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr) |
164 | 0 | { |
165 | 0 | *output_data_ptr = NULL; /* safety check */ |
166 | 0 | } Unexecuted instantiation: jdsample-8.c:noop_upsample Unexecuted instantiation: jdsample-12.c:noop_upsample Unexecuted instantiation: jdsample-16.c:noop_upsample |
167 | | |
168 | | |
169 | | /* |
170 | | * This version handles any integral sampling ratios. |
171 | | * This is not used for typical JPEG files, so it need not be fast. Nor, for |
172 | | * that matter, is it particularly accurate: the algorithm is simple |
173 | | * replication of the input sample onto the corresponding output components. |
174 | | * The hi-falutin sampling literature refers to this as a "box filter". A box |
175 | | * filter tends to introduce visible artifacts, so if you are actually going to |
176 | | * use 3:1 or 4:1 sampling ratios you would be well advised to improve this |
177 | | * code. |
178 | | */ |
179 | | |
180 | | METHODDEF(void) |
181 | | int_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr, |
182 | | _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr) |
183 | 0 | { |
184 | 0 | my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample; |
185 | 0 | _JSAMPARRAY output_data = *output_data_ptr; |
186 | 0 | register _JSAMPROW inptr, outptr; |
187 | 0 | register _JSAMPLE invalue; |
188 | 0 | register int h; |
189 | 0 | _JSAMPROW outend; |
190 | 0 | int h_expand, v_expand; |
191 | 0 | int inrow, outrow; |
192 | |
|
193 | 0 | h_expand = upsample->h_expand[compptr->component_index]; |
194 | 0 | v_expand = upsample->v_expand[compptr->component_index]; |
195 | |
|
196 | 0 | inrow = outrow = 0; |
197 | 0 | while (outrow < cinfo->max_v_samp_factor) { |
198 | | /* Generate one output row with proper horizontal expansion */ |
199 | 0 | inptr = input_data[inrow]; |
200 | 0 | outptr = output_data[outrow]; |
201 | 0 | outend = outptr + cinfo->output_width; |
202 | 0 | while (outptr < outend) { |
203 | 0 | invalue = *inptr++; |
204 | 0 | for (h = h_expand; h > 0; h--) { |
205 | 0 | *outptr++ = invalue; |
206 | 0 | } |
207 | 0 | } |
208 | | /* Generate any additional output rows by duplicating the first one */ |
209 | 0 | if (v_expand > 1) { |
210 | 0 | _jcopy_sample_rows(output_data, outrow, output_data, outrow + 1, |
211 | 0 | v_expand - 1, cinfo->output_width); |
212 | 0 | } |
213 | 0 | inrow++; |
214 | 0 | outrow += v_expand; |
215 | 0 | } |
216 | 0 | } Unexecuted instantiation: jdsample-8.c:int_upsample Unexecuted instantiation: jdsample-12.c:int_upsample Unexecuted instantiation: jdsample-16.c:int_upsample |
217 | | |
218 | | |
219 | | /* |
220 | | * Fast processing for the common case of 2:1 horizontal and 1:1 vertical. |
221 | | * It's still a box filter. |
222 | | */ |
223 | | |
224 | | METHODDEF(void) |
225 | | h2v1_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr, |
226 | | _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr) |
227 | 0 | { |
228 | 0 | _JSAMPARRAY output_data = *output_data_ptr; |
229 | 0 | register _JSAMPROW inptr, outptr; |
230 | 0 | register _JSAMPLE invalue; |
231 | 0 | _JSAMPROW outend; |
232 | 0 | int inrow; |
233 | |
|
234 | 0 | for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) { |
235 | 0 | inptr = input_data[inrow]; |
236 | 0 | outptr = output_data[inrow]; |
237 | 0 | outend = outptr + cinfo->output_width; |
238 | 0 | while (outptr < outend) { |
239 | 0 | invalue = *inptr++; |
240 | 0 | *outptr++ = invalue; |
241 | 0 | *outptr++ = invalue; |
242 | 0 | } |
243 | 0 | } |
244 | 0 | } Unexecuted instantiation: jdsample-8.c:h2v1_upsample Unexecuted instantiation: jdsample-12.c:h2v1_upsample Unexecuted instantiation: jdsample-16.c:h2v1_upsample |
245 | | |
246 | | |
247 | | /* |
248 | | * Fast processing for the common case of 2:1 horizontal and 2:1 vertical. |
249 | | * It's still a box filter. |
250 | | */ |
251 | | |
252 | | METHODDEF(void) |
253 | | h2v2_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr, |
254 | | _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr) |
255 | 0 | { |
256 | 0 | _JSAMPARRAY output_data = *output_data_ptr; |
257 | 0 | register _JSAMPROW inptr, outptr; |
258 | 0 | register _JSAMPLE invalue; |
259 | 0 | _JSAMPROW outend; |
260 | 0 | int inrow, outrow; |
261 | |
|
262 | 0 | inrow = outrow = 0; |
263 | 0 | while (outrow < cinfo->max_v_samp_factor) { |
264 | 0 | inptr = input_data[inrow]; |
265 | 0 | outptr = output_data[outrow]; |
266 | 0 | outend = outptr + cinfo->output_width; |
267 | 0 | while (outptr < outend) { |
268 | 0 | invalue = *inptr++; |
269 | 0 | *outptr++ = invalue; |
270 | 0 | *outptr++ = invalue; |
271 | 0 | } |
272 | 0 | _jcopy_sample_rows(output_data, outrow, output_data, outrow + 1, 1, |
273 | 0 | cinfo->output_width); |
274 | 0 | inrow++; |
275 | 0 | outrow += 2; |
276 | 0 | } |
277 | 0 | } Unexecuted instantiation: jdsample-8.c:h2v2_upsample Unexecuted instantiation: jdsample-12.c:h2v2_upsample Unexecuted instantiation: jdsample-16.c:h2v2_upsample |
278 | | |
279 | | |
280 | | /* |
281 | | * Fancy processing for the common case of 2:1 horizontal and 1:1 vertical. |
282 | | * |
283 | | * The upsampling algorithm is linear interpolation between component centers, |
284 | | * also known as a "triangle filter". This is a good compromise between speed |
285 | | * and visual quality. The centers of the output components are 1/4 and 3/4 of |
286 | | * the way between input component centers. |
287 | | * |
288 | | * A note about the "bias" calculations: when rounding fractional values to |
289 | | * integer, we do not want to always round 0.5 up to the next integer. |
290 | | * If we did that, we'd introduce a noticeable bias towards larger values. |
291 | | * Instead, this code is arranged so that 0.5 will be rounded up or down at |
292 | | * alternate pixel locations (a simple ordered dither pattern). |
293 | | */ |
294 | | |
295 | | METHODDEF(void) |
296 | | h2v1_fancy_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr, |
297 | | _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr) |
298 | 0 | { |
299 | 0 | _JSAMPARRAY output_data = *output_data_ptr; |
300 | 0 | register _JSAMPROW inptr, outptr; |
301 | 0 | register int invalue; |
302 | 0 | register JDIMENSION colctr; |
303 | 0 | int inrow; |
304 | |
|
305 | 0 | for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) { |
306 | 0 | inptr = input_data[inrow]; |
307 | 0 | outptr = output_data[inrow]; |
308 | | /* Special case for first column */ |
309 | 0 | invalue = *inptr++; |
310 | 0 | *outptr++ = (_JSAMPLE)invalue; |
311 | 0 | *outptr++ = (_JSAMPLE)((invalue * 3 + inptr[0] + 2) >> 2); |
312 | |
|
313 | 0 | for (colctr = compptr->downsampled_width - 2; colctr > 0; colctr--) { |
314 | | /* General case: 3/4 * nearer component + 1/4 * further component */ |
315 | 0 | invalue = (*inptr++) * 3; |
316 | 0 | *outptr++ = (_JSAMPLE)((invalue + inptr[-2] + 1) >> 2); |
317 | 0 | *outptr++ = (_JSAMPLE)((invalue + inptr[0] + 2) >> 2); |
318 | 0 | } |
319 | | |
320 | | /* Special case for last column */ |
321 | 0 | invalue = *inptr; |
322 | 0 | *outptr++ = (_JSAMPLE)((invalue * 3 + inptr[-1] + 1) >> 2); |
323 | 0 | *outptr++ = (_JSAMPLE)invalue; |
324 | 0 | } |
325 | 0 | } Unexecuted instantiation: jdsample-8.c:h2v1_fancy_upsample Unexecuted instantiation: jdsample-12.c:h2v1_fancy_upsample Unexecuted instantiation: jdsample-16.c:h2v1_fancy_upsample |
326 | | |
327 | | |
328 | | /* |
329 | | * Fancy processing for 1:1 horizontal and 2:1 vertical (4:4:0 subsampling). |
330 | | * |
331 | | * This is a less common case, but it can be encountered when losslessly |
332 | | * rotating/transposing a JPEG file that uses 4:2:2 chroma subsampling. |
333 | | */ |
334 | | |
335 | | METHODDEF(void) |
336 | | h1v2_fancy_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr, |
337 | | _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr) |
338 | 0 | { |
339 | 0 | _JSAMPARRAY output_data = *output_data_ptr; |
340 | 0 | _JSAMPROW inptr0, inptr1, outptr; |
341 | | #if BITS_IN_JSAMPLE == 8 |
342 | | int thiscolsum, bias; |
343 | | #else |
344 | | JLONG thiscolsum, bias; |
345 | | #endif |
346 | 0 | JDIMENSION colctr; |
347 | 0 | int inrow, outrow, v; |
348 | |
|
349 | 0 | inrow = outrow = 0; |
350 | 0 | while (outrow < cinfo->max_v_samp_factor) { |
351 | 0 | for (v = 0; v < 2; v++) { |
352 | | /* inptr0 points to nearest input row, inptr1 points to next nearest */ |
353 | 0 | inptr0 = input_data[inrow]; |
354 | 0 | if (v == 0) { /* next nearest is row above */ |
355 | 0 | inptr1 = input_data[inrow - 1]; |
356 | 0 | bias = 1; |
357 | 0 | } else { /* next nearest is row below */ |
358 | 0 | inptr1 = input_data[inrow + 1]; |
359 | 0 | bias = 2; |
360 | 0 | } |
361 | 0 | outptr = output_data[outrow++]; |
362 | |
|
363 | 0 | for (colctr = 0; colctr < compptr->downsampled_width; colctr++) { |
364 | 0 | thiscolsum = (*inptr0++) * 3 + (*inptr1++); |
365 | 0 | *outptr++ = (_JSAMPLE)((thiscolsum + bias) >> 2); |
366 | 0 | } |
367 | 0 | } |
368 | 0 | inrow++; |
369 | 0 | } |
370 | 0 | } Unexecuted instantiation: jdsample-8.c:h1v2_fancy_upsample Unexecuted instantiation: jdsample-12.c:h1v2_fancy_upsample Unexecuted instantiation: jdsample-16.c:h1v2_fancy_upsample |
371 | | |
372 | | |
373 | | /* |
374 | | * Fancy processing for the common case of 2:1 horizontal and 2:1 vertical. |
375 | | * Again a triangle filter; see comments for h2v1 case, above. |
376 | | * |
377 | | * It is OK for us to reference the adjacent input rows because we demanded |
378 | | * context from the main buffer controller (see initialization code). |
379 | | */ |
380 | | |
381 | | METHODDEF(void) |
382 | | h2v2_fancy_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr, |
383 | | _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr) |
384 | 0 | { |
385 | 0 | _JSAMPARRAY output_data = *output_data_ptr; |
386 | 0 | register _JSAMPROW inptr0, inptr1, outptr; |
387 | | #if BITS_IN_JSAMPLE == 8 |
388 | | register int thiscolsum, lastcolsum, nextcolsum; |
389 | | #else |
390 | | register JLONG thiscolsum, lastcolsum, nextcolsum; |
391 | | #endif |
392 | 0 | register JDIMENSION colctr; |
393 | 0 | int inrow, outrow, v; |
394 | |
|
395 | 0 | inrow = outrow = 0; |
396 | 0 | while (outrow < cinfo->max_v_samp_factor) { |
397 | 0 | for (v = 0; v < 2; v++) { |
398 | | /* inptr0 points to nearest input row, inptr1 points to next nearest */ |
399 | 0 | inptr0 = input_data[inrow]; |
400 | 0 | if (v == 0) /* next nearest is row above */ |
401 | 0 | inptr1 = input_data[inrow - 1]; |
402 | 0 | else /* next nearest is row below */ |
403 | 0 | inptr1 = input_data[inrow + 1]; |
404 | 0 | outptr = output_data[outrow++]; |
405 | | |
406 | | /* Special case for first column */ |
407 | 0 | thiscolsum = (*inptr0++) * 3 + (*inptr1++); |
408 | 0 | nextcolsum = (*inptr0++) * 3 + (*inptr1++); |
409 | 0 | *outptr++ = (_JSAMPLE)((thiscolsum * 4 + 8) >> 4); |
410 | 0 | *outptr++ = (_JSAMPLE)((thiscolsum * 3 + nextcolsum + 7) >> 4); |
411 | 0 | lastcolsum = thiscolsum; thiscolsum = nextcolsum; |
412 | |
|
413 | 0 | for (colctr = compptr->downsampled_width - 2; colctr > 0; colctr--) { |
414 | | /* General case: 3/4 * nearer component + 1/4 * further component in |
415 | | * each dimension, thus 9/16, 3/16, 3/16, 1/16 overall |
416 | | */ |
417 | 0 | nextcolsum = (*inptr0++) * 3 + (*inptr1++); |
418 | 0 | *outptr++ = (_JSAMPLE)((thiscolsum * 3 + lastcolsum + 8) >> 4); |
419 | 0 | *outptr++ = (_JSAMPLE)((thiscolsum * 3 + nextcolsum + 7) >> 4); |
420 | 0 | lastcolsum = thiscolsum; thiscolsum = nextcolsum; |
421 | 0 | } |
422 | | |
423 | | /* Special case for last column */ |
424 | 0 | *outptr++ = (_JSAMPLE)((thiscolsum * 3 + lastcolsum + 8) >> 4); |
425 | 0 | *outptr++ = (_JSAMPLE)((thiscolsum * 4 + 7) >> 4); |
426 | 0 | } |
427 | 0 | inrow++; |
428 | 0 | } |
429 | 0 | } Unexecuted instantiation: jdsample-8.c:h2v2_fancy_upsample Unexecuted instantiation: jdsample-12.c:h2v2_fancy_upsample Unexecuted instantiation: jdsample-16.c:h2v2_fancy_upsample |
430 | | |
431 | | |
432 | | /* |
433 | | * Module initialization routine for upsampling. |
434 | | */ |
435 | | |
436 | | GLOBAL(void) |
437 | | _jinit_upsampler(j_decompress_ptr cinfo) |
438 | 0 | { |
439 | 0 | my_upsample_ptr upsample; |
440 | 0 | int ci; |
441 | 0 | jpeg_component_info *compptr; |
442 | 0 | boolean need_buffer, do_fancy; |
443 | 0 | int h_in_group, v_in_group, h_out_group, v_out_group; |
444 | |
|
445 | 0 | #ifdef D_LOSSLESS_SUPPORTED |
446 | 0 | if (cinfo->master->lossless) { |
447 | | #if BITS_IN_JSAMPLE == 8 |
448 | 0 | if (cinfo->data_precision > BITS_IN_JSAMPLE || cinfo->data_precision < 2) |
449 | | #else |
450 | 0 | if (cinfo->data_precision > BITS_IN_JSAMPLE || |
451 | 0 | cinfo->data_precision < BITS_IN_JSAMPLE - 3) |
452 | 0 | #endif |
453 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
454 | 0 | } else |
455 | 0 | #endif |
456 | 0 | { |
457 | 0 | if (cinfo->data_precision != BITS_IN_JSAMPLE) |
458 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
459 | 0 | } |
460 | |
|
461 | 0 | if (!cinfo->master->jinit_upsampler_no_alloc) { |
462 | 0 | upsample = (my_upsample_ptr) |
463 | 0 | (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE, |
464 | 0 | sizeof(my_upsampler)); |
465 | 0 | cinfo->upsample = (struct jpeg_upsampler *)upsample; |
466 | 0 | upsample->pub.start_pass = start_pass_upsample; |
467 | 0 | upsample->pub._upsample = sep_upsample; |
468 | 0 | upsample->pub.need_context_rows = FALSE; /* until we find out differently */ |
469 | 0 | } else |
470 | 0 | upsample = (my_upsample_ptr)cinfo->upsample; |
471 | |
|
472 | 0 | if (cinfo->CCIR601_sampling) /* this isn't supported */ |
473 | 0 | ERREXIT(cinfo, JERR_CCIR601_NOTIMPL); |
474 | | |
475 | | /* jdmainct.c doesn't support context rows when min_DCT_scaled_size = 1, |
476 | | * so don't ask for it. |
477 | | */ |
478 | 0 | do_fancy = cinfo->do_fancy_upsampling && cinfo->_min_DCT_scaled_size > 1; |
479 | | |
480 | | /* Verify we can handle the sampling factors, select per-component methods, |
481 | | * and create storage as needed. |
482 | | */ |
483 | 0 | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; |
484 | 0 | ci++, compptr++) { |
485 | | /* Compute size of an "input group" after IDCT scaling. This many samples |
486 | | * are to be converted to max_h_samp_factor * max_v_samp_factor components. |
487 | | */ |
488 | 0 | h_in_group = (compptr->h_samp_factor * compptr->_DCT_scaled_size) / |
489 | 0 | cinfo->_min_DCT_scaled_size; |
490 | 0 | v_in_group = (compptr->v_samp_factor * compptr->_DCT_scaled_size) / |
491 | 0 | cinfo->_min_DCT_scaled_size; |
492 | 0 | h_out_group = cinfo->max_h_samp_factor; |
493 | 0 | v_out_group = cinfo->max_v_samp_factor; |
494 | 0 | upsample->rowgroup_height[ci] = v_in_group; /* save for use later */ |
495 | 0 | need_buffer = TRUE; |
496 | 0 | if (!compptr->component_needed) { |
497 | | /* Don't bother to upsample an uninteresting component. */ |
498 | 0 | upsample->methods[ci] = noop_upsample; |
499 | 0 | need_buffer = FALSE; |
500 | 0 | } else if (h_in_group == h_out_group && v_in_group == v_out_group) { |
501 | | /* Fullsize components can be processed without any work. */ |
502 | 0 | upsample->methods[ci] = fullsize_upsample; |
503 | 0 | need_buffer = FALSE; |
504 | 0 | } else if (h_in_group * 2 == h_out_group && v_in_group == v_out_group) { |
505 | | /* Special cases for 2h1v upsampling */ |
506 | 0 | if (do_fancy && compptr->downsampled_width > 2) { |
507 | | #ifdef WITH_SIMD |
508 | 0 | if (jsimd_set_h2v1_fancy_upsample(cinfo)) |
509 | 0 | upsample->methods[ci] = jsimd_h2v1_fancy_upsample; |
510 | 0 | else |
511 | 0 | #endif |
512 | 0 | upsample->methods[ci] = h2v1_fancy_upsample; |
513 | 0 | } else { |
514 | | #ifdef WITH_SIMD |
515 | 0 | if (jsimd_set_h2v1_upsample(cinfo)) |
516 | 0 | upsample->methods[ci] = jsimd_h2v1_upsample; |
517 | 0 | else |
518 | 0 | #endif |
519 | 0 | upsample->methods[ci] = h2v1_upsample; |
520 | 0 | } |
521 | 0 | } else if (h_in_group == h_out_group && |
522 | 0 | v_in_group * 2 == v_out_group && do_fancy) { |
523 | | /* Non-fancy upsampling is handled by the generic method */ |
524 | | #if defined(WITH_SIMD) && (SIMD_ARCHITECTURE == ARM64 || SIMD_ARCHITECTURE == ARM) |
525 | | if (jsimd_set_h1v2_fancy_upsample(cinfo)) |
526 | | upsample->methods[ci] = jsimd_h1v2_fancy_upsample; |
527 | | else |
528 | | #endif |
529 | 0 | upsample->methods[ci] = h1v2_fancy_upsample; |
530 | 0 | upsample->pub.need_context_rows = TRUE; |
531 | 0 | } else if (h_in_group * 2 == h_out_group && |
532 | 0 | v_in_group * 2 == v_out_group) { |
533 | | /* Special cases for 2h2v upsampling */ |
534 | 0 | if (do_fancy && compptr->downsampled_width > 2) { |
535 | | #ifdef WITH_SIMD |
536 | 0 | if (jsimd_set_h2v2_fancy_upsample(cinfo)) |
537 | 0 | upsample->methods[ci] = jsimd_h2v2_fancy_upsample; |
538 | 0 | else |
539 | 0 | #endif |
540 | 0 | upsample->methods[ci] = h2v2_fancy_upsample; |
541 | 0 | upsample->pub.need_context_rows = TRUE; |
542 | 0 | } else { |
543 | | #ifdef WITH_SIMD |
544 | 0 | if (jsimd_set_h2v2_upsample(cinfo)) |
545 | 0 | upsample->methods[ci] = jsimd_h2v2_upsample; |
546 | 0 | else |
547 | 0 | #endif |
548 | 0 | upsample->methods[ci] = h2v2_upsample; |
549 | 0 | } |
550 | 0 | } else if ((h_out_group % h_in_group) == 0 && |
551 | 0 | (v_out_group % v_in_group) == 0) { |
552 | | /* Generic integral-factors upsampling method */ |
553 | 0 | upsample->methods[ci] = int_upsample; |
554 | 0 | upsample->h_expand[ci] = (UINT8)(h_out_group / h_in_group); |
555 | 0 | upsample->v_expand[ci] = (UINT8)(v_out_group / v_in_group); |
556 | 0 | } else |
557 | 0 | ERREXIT(cinfo, JERR_FRACT_SAMPLE_NOTIMPL); |
558 | 0 | if (need_buffer && !cinfo->master->jinit_upsampler_no_alloc) { |
559 | 0 | upsample->color_buf[ci] = (_JSAMPARRAY)(*cinfo->mem->alloc_sarray) |
560 | 0 | ((j_common_ptr)cinfo, JPOOL_IMAGE, |
561 | 0 | (JDIMENSION)jround_up((long)cinfo->output_width, |
562 | 0 | (long)cinfo->max_h_samp_factor), |
563 | 0 | (JDIMENSION)cinfo->max_v_samp_factor); |
564 | 0 | } |
565 | 0 | } |
566 | 0 | } Unexecuted instantiation: jinit_upsampler Unexecuted instantiation: j12init_upsampler Unexecuted instantiation: j16init_upsampler |
567 | | |
568 | | #endif /* BITS_IN_JSAMPLE != 16 || defined(D_LOSSLESS_SUPPORTED) */ |