blob: 5738c2fd2afbfeb5a26af1a7f6e8e2554a961700 [file] [log] [blame]
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +00001/*
2 * jdsample.c
3 *
DRCa73e8702012-12-31 02:52:30 +00004 * This file was part of the Independent JPEG Group's software:
Thomas G. Lane489583f1996-02-07 00:00:00 +00005 * Copyright (C) 1991-1996, Thomas G. Lane.
DRCa6ef2822013-09-28 03:23:49 +00006 * libjpeg-turbo Modifications:
Pierre Ossman59a39382009-03-09 13:15:56 +00007 * Copyright 2009 Pierre Ossman <ossman@cendio.se> for Cendio AB
DRC36a6eec2010-10-08 08:05:44 +00008 * Copyright (C) 2010, D. R. Commander.
DRC5ef46302014-05-18 20:04:47 +00009 * Copyright (C) 2014, MIPS Technologies, Inc., California
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +000010 * For conditions of distribution and use, see the accompanying README file.
11 *
Thomas G. Lane88aeed41992-12-10 00:00:00 +000012 * This file contains upsampling routines.
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000013 *
14 * Upsampling input data is counted in "row groups". A row group
15 * is defined to be (v_samp_factor * DCT_scaled_size / min_DCT_scaled_size)
16 * sample rows of each component. Upsampling will normally produce
17 * max_v_samp_factor pixel rows from each row group (but this could vary
18 * if the upsampler is applying a scale factor of its own).
Thomas G. Lane88aeed41992-12-10 00:00:00 +000019 *
20 * An excellent reference for image resampling is
21 * Digital Image Warping, George Wolberg, 1990.
22 * Pub. by IEEE Computer Society Press, Los Alamitos, CA. ISBN 0-8186-8944-7.
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +000023 */
24
DRCeb32cc12015-06-25 03:44:36 +000025#include "jdsample.h"
Pierre Ossman59a39382009-03-09 13:15:56 +000026#include "jsimd.h"
DRC36a6eec2010-10-08 08:05:44 +000027#include "jpegcomp.h"
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000028
29
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +000030
31/*
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000032 * Initialize for an upsampling pass.
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +000033 */
34
Thomas G. Lane489583f1996-02-07 00:00:00 +000035METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000036start_pass_upsample (j_decompress_ptr cinfo)
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +000037{
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000038 my_upsample_ptr upsample = (my_upsample_ptr) cinfo->upsample;
39
40 /* Mark the conversion buffer empty */
41 upsample->next_row_out = cinfo->max_v_samp_factor;
42 /* Initialize total-height counter for detecting bottom of image */
43 upsample->rows_to_go = cinfo->output_height;
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +000044}
45
46
47/*
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000048 * Control routine to do upsampling (and color conversion).
Thomas G. Lane88aeed41992-12-10 00:00:00 +000049 *
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000050 * In this version we upsample each component independently.
51 * We upsample one row group into the conversion buffer, then apply
52 * color conversion a row at a time.
53 */
54
Thomas G. Lane489583f1996-02-07 00:00:00 +000055METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000056sep_upsample (j_decompress_ptr cinfo,
DRCe5eaf372014-05-09 18:00:32 +000057 JSAMPIMAGE input_buf, JDIMENSION *in_row_group_ctr,
58 JDIMENSION in_row_groups_avail,
59 JSAMPARRAY output_buf, JDIMENSION *out_row_ctr,
60 JDIMENSION out_rows_avail)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000061{
62 my_upsample_ptr upsample = (my_upsample_ptr) cinfo->upsample;
63 int ci;
64 jpeg_component_info * compptr;
65 JDIMENSION num_rows;
66
67 /* Fill the conversion buffer, if it's empty */
68 if (upsample->next_row_out >= cinfo->max_v_samp_factor) {
69 for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
DRCe5eaf372014-05-09 18:00:32 +000070 ci++, compptr++) {
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000071 /* Invoke per-component upsample method. Notice we pass a POINTER
72 * to color_buf[ci], so that fullsize_upsample can change it.
73 */
74 (*upsample->methods[ci]) (cinfo, compptr,
DRCe5eaf372014-05-09 18:00:32 +000075 input_buf[ci] + (*in_row_group_ctr * upsample->rowgroup_height[ci]),
76 upsample->color_buf + ci);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000077 }
78 upsample->next_row_out = 0;
79 }
80
81 /* Color-convert and emit rows */
82
83 /* How many we have in the buffer: */
84 num_rows = (JDIMENSION) (cinfo->max_v_samp_factor - upsample->next_row_out);
85 /* Not more than the distance to the end of the image. Need this test
86 * in case the image height is not a multiple of max_v_samp_factor:
87 */
DRCe5eaf372014-05-09 18:00:32 +000088 if (num_rows > upsample->rows_to_go)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000089 num_rows = upsample->rows_to_go;
90 /* And not more than what the client can accept: */
91 out_rows_avail -= *out_row_ctr;
92 if (num_rows > out_rows_avail)
93 num_rows = out_rows_avail;
94
95 (*cinfo->cconvert->color_convert) (cinfo, upsample->color_buf,
DRCe5eaf372014-05-09 18:00:32 +000096 (JDIMENSION) upsample->next_row_out,
97 output_buf + *out_row_ctr,
98 (int) num_rows);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000099
100 /* Adjust counts */
101 *out_row_ctr += num_rows;
102 upsample->rows_to_go -= num_rows;
103 upsample->next_row_out += num_rows;
104 /* When the buffer is emptied, declare this input row group consumed */
105 if (upsample->next_row_out >= cinfo->max_v_samp_factor)
106 (*in_row_group_ctr)++;
107}
108
109
110/*
111 * These are the routines invoked by sep_upsample to upsample pixel values
112 * of a single component. One row group is processed per call.
113 */
114
115
116/*
117 * For full-size components, we just make color_buf[ci] point at the
118 * input buffer, and thus avoid copying any data. Note that this is
119 * safe only because sep_upsample doesn't declare the input row group
120 * "consumed" until we are done color converting and emitting it.
121 */
122
Thomas G. Lane489583f1996-02-07 00:00:00 +0000123METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000124fullsize_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
DRCe5eaf372014-05-09 18:00:32 +0000125 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000126{
127 *output_data_ptr = input_data;
128}
129
130
131/*
132 * This is a no-op version used for "uninteresting" components.
133 * These components will not be referenced by color conversion.
134 */
135
Thomas G. Lane489583f1996-02-07 00:00:00 +0000136METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000137noop_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
DRCe5eaf372014-05-09 18:00:32 +0000138 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000139{
DRCe5eaf372014-05-09 18:00:32 +0000140 *output_data_ptr = NULL; /* safety check */
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000141}
142
143
144/*
145 * This version handles any integral sampling ratios.
Thomas G. Lane4a6b7301992-03-17 00:00:00 +0000146 * This is not used for typical JPEG files, so it need not be fast.
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000147 * Nor, for that matter, is it particularly accurate: the algorithm is
148 * simple replication of the input pixel onto the corresponding output
149 * pixels. The hi-falutin sampling literature refers to this as a
150 * "box filter". A box filter tends to introduce visible artifacts,
151 * so if you are actually going to use 3:1 or 4:1 sampling ratios
152 * you would be well advised to improve this code.
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000153 */
154
Thomas G. Lane489583f1996-02-07 00:00:00 +0000155METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000156int_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
DRCe5eaf372014-05-09 18:00:32 +0000157 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000158{
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000159 my_upsample_ptr upsample = (my_upsample_ptr) cinfo->upsample;
160 JSAMPARRAY output_data = *output_data_ptr;
Thomas G. Lane4a6b7301992-03-17 00:00:00 +0000161 register JSAMPROW inptr, outptr;
162 register JSAMPLE invalue;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000163 register int h;
164 JSAMPROW outend;
165 int h_expand, v_expand;
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000166 int inrow, outrow;
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000167
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000168 h_expand = upsample->h_expand[compptr->component_index];
169 v_expand = upsample->v_expand[compptr->component_index];
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000170
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000171 inrow = outrow = 0;
172 while (outrow < cinfo->max_v_samp_factor) {
173 /* Generate one output row with proper horizontal expansion */
174 inptr = input_data[inrow];
175 outptr = output_data[outrow];
176 outend = outptr + cinfo->output_width;
177 while (outptr < outend) {
DRCe5eaf372014-05-09 18:00:32 +0000178 invalue = *inptr++; /* don't need GETJSAMPLE() here */
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000179 for (h = h_expand; h > 0; h--) {
DRCe5eaf372014-05-09 18:00:32 +0000180 *outptr++ = invalue;
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000181 }
182 }
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000183 /* Generate any additional output rows by duplicating the first one */
184 if (v_expand > 1) {
185 jcopy_sample_rows(output_data, outrow, output_data, outrow+1,
DRCe5eaf372014-05-09 18:00:32 +0000186 v_expand-1, cinfo->output_width);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000187 }
188 inrow++;
189 outrow += v_expand;
190 }
191}
192
193
194/*
195 * Fast processing for the common case of 2:1 horizontal and 1:1 vertical.
196 * It's still a box filter.
197 */
198
Thomas G. Lane489583f1996-02-07 00:00:00 +0000199METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000200h2v1_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
DRCe5eaf372014-05-09 18:00:32 +0000201 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000202{
203 JSAMPARRAY output_data = *output_data_ptr;
204 register JSAMPROW inptr, outptr;
205 register JSAMPLE invalue;
206 JSAMPROW outend;
207 int inrow;
208
209 for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
210 inptr = input_data[inrow];
211 outptr = output_data[inrow];
212 outend = outptr + cinfo->output_width;
213 while (outptr < outend) {
DRCe5eaf372014-05-09 18:00:32 +0000214 invalue = *inptr++; /* don't need GETJSAMPLE() here */
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000215 *outptr++ = invalue;
216 *outptr++ = invalue;
217 }
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000218 }
219}
220
221
222/*
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000223 * Fast processing for the common case of 2:1 horizontal and 2:1 vertical.
224 * It's still a box filter.
225 */
226
Thomas G. Lane489583f1996-02-07 00:00:00 +0000227METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000228h2v2_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
DRCe5eaf372014-05-09 18:00:32 +0000229 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000230{
231 JSAMPARRAY output_data = *output_data_ptr;
232 register JSAMPROW inptr, outptr;
233 register JSAMPLE invalue;
234 JSAMPROW outend;
235 int inrow, outrow;
236
237 inrow = outrow = 0;
238 while (outrow < cinfo->max_v_samp_factor) {
239 inptr = input_data[inrow];
240 outptr = output_data[outrow];
241 outend = outptr + cinfo->output_width;
242 while (outptr < outend) {
DRCe5eaf372014-05-09 18:00:32 +0000243 invalue = *inptr++; /* don't need GETJSAMPLE() here */
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000244 *outptr++ = invalue;
245 *outptr++ = invalue;
246 }
247 jcopy_sample_rows(output_data, outrow, output_data, outrow+1,
DRCe5eaf372014-05-09 18:00:32 +0000248 1, cinfo->output_width);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000249 inrow++;
250 outrow += 2;
251 }
252}
253
254
255/*
256 * Fancy processing for the common case of 2:1 horizontal and 1:1 vertical.
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000257 *
258 * The upsampling algorithm is linear interpolation between pixel centers,
259 * also known as a "triangle filter". This is a good compromise between
260 * speed and visual quality. The centers of the output pixels are 1/4 and 3/4
261 * of the way between input pixel centers.
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000262 *
263 * A note about the "bias" calculations: when rounding fractional values to
264 * integer, we do not want to always round 0.5 up to the next integer.
265 * If we did that, we'd introduce a noticeable bias towards larger values.
266 * Instead, this code is arranged so that 0.5 will be rounded up or down at
267 * alternate pixel locations (a simple ordered dither pattern).
Thomas G. Lane4a6b7301992-03-17 00:00:00 +0000268 */
269
Thomas G. Lane489583f1996-02-07 00:00:00 +0000270METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000271h2v1_fancy_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
DRCe5eaf372014-05-09 18:00:32 +0000272 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
Thomas G. Lane4a6b7301992-03-17 00:00:00 +0000273{
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000274 JSAMPARRAY output_data = *output_data_ptr;
Thomas G. Lane4a6b7301992-03-17 00:00:00 +0000275 register JSAMPROW inptr, outptr;
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000276 register int invalue;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000277 register JDIMENSION colctr;
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000278 int inrow;
Thomas G. Lane4a6b7301992-03-17 00:00:00 +0000279
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000280 for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000281 inptr = input_data[inrow];
282 outptr = output_data[inrow];
283 /* Special case for first column */
284 invalue = GETJSAMPLE(*inptr++);
285 *outptr++ = (JSAMPLE) invalue;
286 *outptr++ = (JSAMPLE) ((invalue * 3 + GETJSAMPLE(*inptr) + 2) >> 2);
Thomas G. Lane4a6b7301992-03-17 00:00:00 +0000287
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000288 for (colctr = compptr->downsampled_width - 2; colctr > 0; colctr--) {
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000289 /* General case: 3/4 * nearer pixel + 1/4 * further pixel */
290 invalue = GETJSAMPLE(*inptr++) * 3;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000291 *outptr++ = (JSAMPLE) ((invalue + GETJSAMPLE(inptr[-2]) + 1) >> 2);
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000292 *outptr++ = (JSAMPLE) ((invalue + GETJSAMPLE(*inptr) + 2) >> 2);
293 }
294
295 /* Special case for last column */
296 invalue = GETJSAMPLE(*inptr);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000297 *outptr++ = (JSAMPLE) ((invalue * 3 + GETJSAMPLE(inptr[-1]) + 1) >> 2);
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000298 *outptr++ = (JSAMPLE) invalue;
299 }
300}
301
302
303/*
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000304 * Fancy processing for the common case of 2:1 horizontal and 2:1 vertical.
305 * Again a triangle filter; see comments for h2v1 case, above.
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000306 *
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000307 * It is OK for us to reference the adjacent input rows because we demanded
308 * context from the main buffer controller (see initialization code).
Thomas G. Lane4a6b7301992-03-17 00:00:00 +0000309 */
310
Thomas G. Lane489583f1996-02-07 00:00:00 +0000311METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000312h2v2_fancy_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
DRCe5eaf372014-05-09 18:00:32 +0000313 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000314{
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000315 JSAMPARRAY output_data = *output_data_ptr;
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000316 register JSAMPROW inptr0, inptr1, outptr;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000317#if BITS_IN_JSAMPLE == 8
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000318 register int thiscolsum, lastcolsum, nextcolsum;
319#else
320 register INT32 thiscolsum, lastcolsum, nextcolsum;
321#endif
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000322 register JDIMENSION colctr;
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000323 int inrow, outrow, v;
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000324
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000325 inrow = outrow = 0;
326 while (outrow < cinfo->max_v_samp_factor) {
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000327 for (v = 0; v < 2; v++) {
328 /* inptr0 points to nearest input row, inptr1 points to next nearest */
329 inptr0 = input_data[inrow];
DRCe5eaf372014-05-09 18:00:32 +0000330 if (v == 0) /* next nearest is row above */
331 inptr1 = input_data[inrow-1];
332 else /* next nearest is row below */
333 inptr1 = input_data[inrow+1];
Thomas G. Lane4a6b7301992-03-17 00:00:00 +0000334 outptr = output_data[outrow++];
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000335
336 /* Special case for first column */
337 thiscolsum = GETJSAMPLE(*inptr0++) * 3 + GETJSAMPLE(*inptr1++);
338 nextcolsum = GETJSAMPLE(*inptr0++) * 3 + GETJSAMPLE(*inptr1++);
339 *outptr++ = (JSAMPLE) ((thiscolsum * 4 + 8) >> 4);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000340 *outptr++ = (JSAMPLE) ((thiscolsum * 3 + nextcolsum + 7) >> 4);
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000341 lastcolsum = thiscolsum; thiscolsum = nextcolsum;
342
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000343 for (colctr = compptr->downsampled_width - 2; colctr > 0; colctr--) {
DRCe5eaf372014-05-09 18:00:32 +0000344 /* General case: 3/4 * nearer pixel + 1/4 * further pixel in each */
345 /* dimension, thus 9/16, 3/16, 3/16, 1/16 overall */
346 nextcolsum = GETJSAMPLE(*inptr0++) * 3 + GETJSAMPLE(*inptr1++);
347 *outptr++ = (JSAMPLE) ((thiscolsum * 3 + lastcolsum + 8) >> 4);
348 *outptr++ = (JSAMPLE) ((thiscolsum * 3 + nextcolsum + 7) >> 4);
349 lastcolsum = thiscolsum; thiscolsum = nextcolsum;
Thomas G. Lane4a6b7301992-03-17 00:00:00 +0000350 }
Thomas G. Lane88aeed41992-12-10 00:00:00 +0000351
352 /* Special case for last column */
353 *outptr++ = (JSAMPLE) ((thiscolsum * 3 + lastcolsum + 8) >> 4);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000354 *outptr++ = (JSAMPLE) ((thiscolsum * 4 + 7) >> 4);
Thomas G. Lane4a6b7301992-03-17 00:00:00 +0000355 }
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000356 inrow++;
Thomas G. Lane4a6b7301992-03-17 00:00:00 +0000357 }
358}
359
360
361/*
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000362 * Module initialization routine for upsampling.
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000363 */
364
Thomas G. Lane489583f1996-02-07 00:00:00 +0000365GLOBAL(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000366jinit_upsampler (j_decompress_ptr cinfo)
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000367{
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000368 my_upsample_ptr upsample;
369 int ci;
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000370 jpeg_component_info * compptr;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000371 boolean need_buffer, do_fancy;
372 int h_in_group, v_in_group, h_out_group, v_out_group;
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000373
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000374 upsample = (my_upsample_ptr)
375 (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
DRC5de454b2014-05-18 19:04:03 +0000376 sizeof(my_upsampler));
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000377 cinfo->upsample = (struct jpeg_upsampler *) upsample;
378 upsample->pub.start_pass = start_pass_upsample;
379 upsample->pub.upsample = sep_upsample;
380 upsample->pub.need_context_rows = FALSE; /* until we find out differently */
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000381
DRCe5eaf372014-05-09 18:00:32 +0000382 if (cinfo->CCIR601_sampling) /* this isn't supported */
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000383 ERREXIT(cinfo, JERR_CCIR601_NOTIMPL);
384
385 /* jdmainct.c doesn't support context rows when min_DCT_scaled_size = 1,
386 * so don't ask for it.
387 */
DRC49967cd2010-10-09 19:57:51 +0000388 do_fancy = cinfo->do_fancy_upsampling && cinfo->_min_DCT_scaled_size > 1;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000389
390 /* Verify we can handle the sampling factors, select per-component methods,
391 * and create storage as needed.
392 */
393 for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
394 ci++, compptr++) {
395 /* Compute size of an "input group" after IDCT scaling. This many samples
396 * are to be converted to max_h_samp_factor * max_v_samp_factor pixels.
397 */
DRC49967cd2010-10-09 19:57:51 +0000398 h_in_group = (compptr->h_samp_factor * compptr->_DCT_scaled_size) /
DRCe5eaf372014-05-09 18:00:32 +0000399 cinfo->_min_DCT_scaled_size;
DRC49967cd2010-10-09 19:57:51 +0000400 v_in_group = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
DRCe5eaf372014-05-09 18:00:32 +0000401 cinfo->_min_DCT_scaled_size;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000402 h_out_group = cinfo->max_h_samp_factor;
403 v_out_group = cinfo->max_v_samp_factor;
404 upsample->rowgroup_height[ci] = v_in_group; /* save for use later */
405 need_buffer = TRUE;
406 if (! compptr->component_needed) {
407 /* Don't bother to upsample an uninteresting component. */
408 upsample->methods[ci] = noop_upsample;
409 need_buffer = FALSE;
410 } else if (h_in_group == h_out_group && v_in_group == v_out_group) {
411 /* Fullsize components can be processed without any work. */
412 upsample->methods[ci] = fullsize_upsample;
413 need_buffer = FALSE;
414 } else if (h_in_group * 2 == h_out_group &&
DRCe5eaf372014-05-09 18:00:32 +0000415 v_in_group == v_out_group) {
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000416 /* Special cases for 2h1v upsampling */
Pierre Ossman59a39382009-03-09 13:15:56 +0000417 if (do_fancy && compptr->downsampled_width > 2) {
DRCe5eaf372014-05-09 18:00:32 +0000418 if (jsimd_can_h2v1_fancy_upsample())
419 upsample->methods[ci] = jsimd_h2v1_fancy_upsample;
420 else
421 upsample->methods[ci] = h2v1_fancy_upsample;
Pierre Ossman59a39382009-03-09 13:15:56 +0000422 } else {
DRCe5eaf372014-05-09 18:00:32 +0000423 if (jsimd_can_h2v1_upsample())
424 upsample->methods[ci] = jsimd_h2v1_upsample;
425 else
426 upsample->methods[ci] = h2v1_upsample;
Pierre Ossman59a39382009-03-09 13:15:56 +0000427 }
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000428 } else if (h_in_group * 2 == h_out_group &&
DRCe5eaf372014-05-09 18:00:32 +0000429 v_in_group * 2 == v_out_group) {
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000430 /* Special cases for 2h2v upsampling */
431 if (do_fancy && compptr->downsampled_width > 2) {
DRCe5eaf372014-05-09 18:00:32 +0000432 if (jsimd_can_h2v2_fancy_upsample())
433 upsample->methods[ci] = jsimd_h2v2_fancy_upsample;
434 else
435 upsample->methods[ci] = h2v2_fancy_upsample;
436 upsample->pub.need_context_rows = TRUE;
Pierre Ossman59a39382009-03-09 13:15:56 +0000437 } else {
DRCe5eaf372014-05-09 18:00:32 +0000438 if (jsimd_can_h2v2_upsample())
439 upsample->methods[ci] = jsimd_h2v2_upsample;
440 else
441 upsample->methods[ci] = h2v2_upsample;
Pierre Ossman59a39382009-03-09 13:15:56 +0000442 }
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000443 } else if ((h_out_group % h_in_group) == 0 &&
DRCe5eaf372014-05-09 18:00:32 +0000444 (v_out_group % v_in_group) == 0) {
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000445 /* Generic integral-factors upsampling method */
DRC5ef46302014-05-18 20:04:47 +0000446#if defined(__mips__)
447 if (jsimd_can_int_upsample())
448 upsample->methods[ci] = jsimd_int_upsample;
449 else
450#endif
451 upsample->methods[ci] = int_upsample;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000452 upsample->h_expand[ci] = (UINT8) (h_out_group / h_in_group);
453 upsample->v_expand[ci] = (UINT8) (v_out_group / v_in_group);
454 } else
455 ERREXIT(cinfo, JERR_FRACT_SAMPLE_NOTIMPL);
456 if (need_buffer) {
457 upsample->color_buf[ci] = (*cinfo->mem->alloc_sarray)
DRCe5eaf372014-05-09 18:00:32 +0000458 ((j_common_ptr) cinfo, JPOOL_IMAGE,
459 (JDIMENSION) jround_up((long) cinfo->output_width,
460 (long) cinfo->max_h_samp_factor),
461 (JDIMENSION) cinfo->max_v_samp_factor);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000462 }
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000463 }
Thomas G. Lane2cbeb8a1991-10-07 00:00:00 +0000464}