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