rev |
line source |
nuclear@1
|
1 /*
|
nuclear@1
|
2 * jdsample.c
|
nuclear@1
|
3 *
|
nuclear@1
|
4 * Copyright (C) 1991-1996, Thomas G. Lane.
|
nuclear@1
|
5 * This file is part of the Independent JPEG Group's software.
|
nuclear@1
|
6 * For conditions of distribution and use, see the accompanying README file.
|
nuclear@1
|
7 *
|
nuclear@1
|
8 * This file contains upsampling routines.
|
nuclear@1
|
9 *
|
nuclear@1
|
10 * Upsampling input data is counted in "row groups". A row group
|
nuclear@1
|
11 * is defined to be (v_samp_factor * DCT_scaled_size / min_DCT_scaled_size)
|
nuclear@1
|
12 * sample rows of each component. Upsampling will normally produce
|
nuclear@1
|
13 * max_v_samp_factor pixel rows from each row group (but this could vary
|
nuclear@1
|
14 * if the upsampler is applying a scale factor of its own).
|
nuclear@1
|
15 *
|
nuclear@1
|
16 * An excellent reference for image resampling is
|
nuclear@1
|
17 * Digital Image Warping, George Wolberg, 1990.
|
nuclear@1
|
18 * Pub. by IEEE Computer Society Press, Los Alamitos, CA. ISBN 0-8186-8944-7.
|
nuclear@1
|
19 */
|
nuclear@1
|
20
|
nuclear@1
|
21 #define JPEG_INTERNALS
|
nuclear@1
|
22 #include "jinclude.h"
|
nuclear@1
|
23 #include "jpeglib.h"
|
nuclear@1
|
24
|
nuclear@1
|
25
|
nuclear@1
|
26 /* Pointer to routine to upsample a single component */
|
nuclear@1
|
27 typedef JMETHOD(void, upsample1_ptr,
|
nuclear@1
|
28 (j_decompress_ptr cinfo, jpeg_component_info * compptr,
|
nuclear@1
|
29 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr));
|
nuclear@1
|
30
|
nuclear@1
|
31 /* Private subobject */
|
nuclear@1
|
32
|
nuclear@1
|
33 typedef struct {
|
nuclear@1
|
34 struct jpeg_upsampler pub; /* public fields */
|
nuclear@1
|
35
|
nuclear@1
|
36 /* Color conversion buffer. When using separate upsampling and color
|
nuclear@1
|
37 * conversion steps, this buffer holds one upsampled row group until it
|
nuclear@1
|
38 * has been color converted and output.
|
nuclear@1
|
39 * Note: we do not allocate any storage for component(s) which are full-size,
|
nuclear@1
|
40 * ie do not need rescaling. The corresponding entry of color_buf[] is
|
nuclear@1
|
41 * simply set to point to the input data array, thereby avoiding copying.
|
nuclear@1
|
42 */
|
nuclear@1
|
43 JSAMPARRAY color_buf[MAX_COMPONENTS];
|
nuclear@1
|
44
|
nuclear@1
|
45 /* Per-component upsampling method pointers */
|
nuclear@1
|
46 upsample1_ptr methods[MAX_COMPONENTS];
|
nuclear@1
|
47
|
nuclear@1
|
48 int next_row_out; /* counts rows emitted from color_buf */
|
nuclear@1
|
49 JDIMENSION rows_to_go; /* counts rows remaining in image */
|
nuclear@1
|
50
|
nuclear@1
|
51 /* Height of an input row group for each component. */
|
nuclear@1
|
52 int rowgroup_height[MAX_COMPONENTS];
|
nuclear@1
|
53
|
nuclear@1
|
54 /* These arrays save pixel expansion factors so that int_expand need not
|
nuclear@1
|
55 * recompute them each time. They are unused for other upsampling methods.
|
nuclear@1
|
56 */
|
nuclear@1
|
57 UINT8 h_expand[MAX_COMPONENTS];
|
nuclear@1
|
58 UINT8 v_expand[MAX_COMPONENTS];
|
nuclear@1
|
59 } my_upsampler;
|
nuclear@1
|
60
|
nuclear@1
|
61 typedef my_upsampler * my_upsample_ptr;
|
nuclear@1
|
62
|
nuclear@1
|
63
|
nuclear@1
|
64 /*
|
nuclear@1
|
65 * Initialize for an upsampling pass.
|
nuclear@1
|
66 */
|
nuclear@1
|
67
|
nuclear@1
|
68 METHODDEF(void)
|
nuclear@1
|
69 start_pass_upsample (j_decompress_ptr cinfo)
|
nuclear@1
|
70 {
|
nuclear@1
|
71 my_upsample_ptr upsample = (my_upsample_ptr) cinfo->upsample;
|
nuclear@1
|
72
|
nuclear@1
|
73 /* Mark the conversion buffer empty */
|
nuclear@1
|
74 upsample->next_row_out = cinfo->max_v_samp_factor;
|
nuclear@1
|
75 /* Initialize total-height counter for detecting bottom of image */
|
nuclear@1
|
76 upsample->rows_to_go = cinfo->output_height;
|
nuclear@1
|
77 }
|
nuclear@1
|
78
|
nuclear@1
|
79
|
nuclear@1
|
80 /*
|
nuclear@1
|
81 * Control routine to do upsampling (and color conversion).
|
nuclear@1
|
82 *
|
nuclear@1
|
83 * In this version we upsample each component independently.
|
nuclear@1
|
84 * We upsample one row group into the conversion buffer, then apply
|
nuclear@1
|
85 * color conversion a row at a time.
|
nuclear@1
|
86 */
|
nuclear@1
|
87
|
nuclear@1
|
88 METHODDEF(void)
|
nuclear@1
|
89 sep_upsample (j_decompress_ptr cinfo,
|
nuclear@1
|
90 JSAMPIMAGE input_buf, JDIMENSION *in_row_group_ctr,
|
nuclear@1
|
91 JDIMENSION in_row_groups_avail,
|
nuclear@1
|
92 JSAMPARRAY output_buf, JDIMENSION *out_row_ctr,
|
nuclear@1
|
93 JDIMENSION out_rows_avail)
|
nuclear@1
|
94 {
|
nuclear@1
|
95 my_upsample_ptr upsample = (my_upsample_ptr) cinfo->upsample;
|
nuclear@1
|
96 int ci;
|
nuclear@1
|
97 jpeg_component_info * compptr;
|
nuclear@1
|
98 JDIMENSION num_rows;
|
nuclear@1
|
99
|
nuclear@1
|
100 /* Fill the conversion buffer, if it's empty */
|
nuclear@1
|
101 if (upsample->next_row_out >= cinfo->max_v_samp_factor) {
|
nuclear@1
|
102 for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
|
nuclear@1
|
103 ci++, compptr++) {
|
nuclear@1
|
104 /* Invoke per-component upsample method. Notice we pass a POINTER
|
nuclear@1
|
105 * to color_buf[ci], so that fullsize_upsample can change it.
|
nuclear@1
|
106 */
|
nuclear@1
|
107 (*upsample->methods[ci]) (cinfo, compptr,
|
nuclear@1
|
108 input_buf[ci] + (*in_row_group_ctr * upsample->rowgroup_height[ci]),
|
nuclear@1
|
109 upsample->color_buf + ci);
|
nuclear@1
|
110 }
|
nuclear@1
|
111 upsample->next_row_out = 0;
|
nuclear@1
|
112 }
|
nuclear@1
|
113
|
nuclear@1
|
114 /* Color-convert and emit rows */
|
nuclear@1
|
115
|
nuclear@1
|
116 /* How many we have in the buffer: */
|
nuclear@1
|
117 num_rows = (JDIMENSION) (cinfo->max_v_samp_factor - upsample->next_row_out);
|
nuclear@1
|
118 /* Not more than the distance to the end of the image. Need this test
|
nuclear@1
|
119 * in case the image height is not a multiple of max_v_samp_factor:
|
nuclear@1
|
120 */
|
nuclear@1
|
121 if (num_rows > upsample->rows_to_go)
|
nuclear@1
|
122 num_rows = upsample->rows_to_go;
|
nuclear@1
|
123 /* And not more than what the client can accept: */
|
nuclear@1
|
124 out_rows_avail -= *out_row_ctr;
|
nuclear@1
|
125 if (num_rows > out_rows_avail)
|
nuclear@1
|
126 num_rows = out_rows_avail;
|
nuclear@1
|
127
|
nuclear@1
|
128 (*cinfo->cconvert->color_convert) (cinfo, upsample->color_buf,
|
nuclear@1
|
129 (JDIMENSION) upsample->next_row_out,
|
nuclear@1
|
130 output_buf + *out_row_ctr,
|
nuclear@1
|
131 (int) num_rows);
|
nuclear@1
|
132
|
nuclear@1
|
133 /* Adjust counts */
|
nuclear@1
|
134 *out_row_ctr += num_rows;
|
nuclear@1
|
135 upsample->rows_to_go -= num_rows;
|
nuclear@1
|
136 upsample->next_row_out += num_rows;
|
nuclear@1
|
137 /* When the buffer is emptied, declare this input row group consumed */
|
nuclear@1
|
138 if (upsample->next_row_out >= cinfo->max_v_samp_factor)
|
nuclear@1
|
139 (*in_row_group_ctr)++;
|
nuclear@1
|
140 }
|
nuclear@1
|
141
|
nuclear@1
|
142
|
nuclear@1
|
143 /*
|
nuclear@1
|
144 * These are the routines invoked by sep_upsample to upsample pixel values
|
nuclear@1
|
145 * of a single component. One row group is processed per call.
|
nuclear@1
|
146 */
|
nuclear@1
|
147
|
nuclear@1
|
148
|
nuclear@1
|
149 /*
|
nuclear@1
|
150 * For full-size components, we just make color_buf[ci] point at the
|
nuclear@1
|
151 * input buffer, and thus avoid copying any data. Note that this is
|
nuclear@1
|
152 * safe only because sep_upsample doesn't declare the input row group
|
nuclear@1
|
153 * "consumed" until we are done color converting and emitting it.
|
nuclear@1
|
154 */
|
nuclear@1
|
155
|
nuclear@1
|
156 METHODDEF(void)
|
nuclear@1
|
157 fullsize_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
|
nuclear@1
|
158 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
|
nuclear@1
|
159 {
|
nuclear@1
|
160 *output_data_ptr = input_data;
|
nuclear@1
|
161 }
|
nuclear@1
|
162
|
nuclear@1
|
163
|
nuclear@1
|
164 /*
|
nuclear@1
|
165 * This is a no-op version used for "uninteresting" components.
|
nuclear@1
|
166 * These components will not be referenced by color conversion.
|
nuclear@1
|
167 */
|
nuclear@1
|
168
|
nuclear@1
|
169 METHODDEF(void)
|
nuclear@1
|
170 noop_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
|
nuclear@1
|
171 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
|
nuclear@1
|
172 {
|
nuclear@1
|
173 *output_data_ptr = NULL; /* safety check */
|
nuclear@1
|
174 }
|
nuclear@1
|
175
|
nuclear@1
|
176
|
nuclear@1
|
177 /*
|
nuclear@1
|
178 * This version handles any integral sampling ratios.
|
nuclear@1
|
179 * This is not used for typical JPEG files, so it need not be fast.
|
nuclear@1
|
180 * Nor, for that matter, is it particularly accurate: the algorithm is
|
nuclear@1
|
181 * simple replication of the input pixel onto the corresponding output
|
nuclear@1
|
182 * pixels. The hi-falutin sampling literature refers to this as a
|
nuclear@1
|
183 * "box filter". A box filter tends to introduce visible artifacts,
|
nuclear@1
|
184 * so if you are actually going to use 3:1 or 4:1 sampling ratios
|
nuclear@1
|
185 * you would be well advised to improve this code.
|
nuclear@1
|
186 */
|
nuclear@1
|
187
|
nuclear@1
|
188 METHODDEF(void)
|
nuclear@1
|
189 int_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
|
nuclear@1
|
190 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
|
nuclear@1
|
191 {
|
nuclear@1
|
192 my_upsample_ptr upsample = (my_upsample_ptr) cinfo->upsample;
|
nuclear@1
|
193 JSAMPARRAY output_data = *output_data_ptr;
|
nuclear@1
|
194 register JSAMPROW inptr, outptr;
|
nuclear@1
|
195 register JSAMPLE invalue;
|
nuclear@1
|
196 register int h;
|
nuclear@1
|
197 JSAMPROW outend;
|
nuclear@1
|
198 int h_expand, v_expand;
|
nuclear@1
|
199 int inrow, outrow;
|
nuclear@1
|
200
|
nuclear@1
|
201 h_expand = upsample->h_expand[compptr->component_index];
|
nuclear@1
|
202 v_expand = upsample->v_expand[compptr->component_index];
|
nuclear@1
|
203
|
nuclear@1
|
204 inrow = outrow = 0;
|
nuclear@1
|
205 while (outrow < cinfo->max_v_samp_factor) {
|
nuclear@1
|
206 /* Generate one output row with proper horizontal expansion */
|
nuclear@1
|
207 inptr = input_data[inrow];
|
nuclear@1
|
208 outptr = output_data[outrow];
|
nuclear@1
|
209 outend = outptr + cinfo->output_width;
|
nuclear@1
|
210 while (outptr < outend) {
|
nuclear@1
|
211 invalue = *inptr++; /* don't need GETJSAMPLE() here */
|
nuclear@1
|
212 for (h = h_expand; h > 0; h--) {
|
nuclear@1
|
213 *outptr++ = invalue;
|
nuclear@1
|
214 }
|
nuclear@1
|
215 }
|
nuclear@1
|
216 /* Generate any additional output rows by duplicating the first one */
|
nuclear@1
|
217 if (v_expand > 1) {
|
nuclear@1
|
218 jcopy_sample_rows(output_data, outrow, output_data, outrow+1,
|
nuclear@1
|
219 v_expand-1, cinfo->output_width);
|
nuclear@1
|
220 }
|
nuclear@1
|
221 inrow++;
|
nuclear@1
|
222 outrow += v_expand;
|
nuclear@1
|
223 }
|
nuclear@1
|
224 }
|
nuclear@1
|
225
|
nuclear@1
|
226
|
nuclear@1
|
227 /*
|
nuclear@1
|
228 * Fast processing for the common case of 2:1 horizontal and 1:1 vertical.
|
nuclear@1
|
229 * It's still a box filter.
|
nuclear@1
|
230 */
|
nuclear@1
|
231
|
nuclear@1
|
232 METHODDEF(void)
|
nuclear@1
|
233 h2v1_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
|
nuclear@1
|
234 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
|
nuclear@1
|
235 {
|
nuclear@1
|
236 JSAMPARRAY output_data = *output_data_ptr;
|
nuclear@1
|
237 register JSAMPROW inptr, outptr;
|
nuclear@1
|
238 register JSAMPLE invalue;
|
nuclear@1
|
239 JSAMPROW outend;
|
nuclear@1
|
240 int inrow;
|
nuclear@1
|
241
|
nuclear@1
|
242 for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
|
nuclear@1
|
243 inptr = input_data[inrow];
|
nuclear@1
|
244 outptr = output_data[inrow];
|
nuclear@1
|
245 outend = outptr + cinfo->output_width;
|
nuclear@1
|
246 while (outptr < outend) {
|
nuclear@1
|
247 invalue = *inptr++; /* don't need GETJSAMPLE() here */
|
nuclear@1
|
248 *outptr++ = invalue;
|
nuclear@1
|
249 *outptr++ = invalue;
|
nuclear@1
|
250 }
|
nuclear@1
|
251 }
|
nuclear@1
|
252 }
|
nuclear@1
|
253
|
nuclear@1
|
254
|
nuclear@1
|
255 /*
|
nuclear@1
|
256 * Fast processing for the common case of 2:1 horizontal and 2:1 vertical.
|
nuclear@1
|
257 * It's still a box filter.
|
nuclear@1
|
258 */
|
nuclear@1
|
259
|
nuclear@1
|
260 METHODDEF(void)
|
nuclear@1
|
261 h2v2_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
|
nuclear@1
|
262 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
|
nuclear@1
|
263 {
|
nuclear@1
|
264 JSAMPARRAY output_data = *output_data_ptr;
|
nuclear@1
|
265 register JSAMPROW inptr, outptr;
|
nuclear@1
|
266 register JSAMPLE invalue;
|
nuclear@1
|
267 JSAMPROW outend;
|
nuclear@1
|
268 int inrow, outrow;
|
nuclear@1
|
269
|
nuclear@1
|
270 inrow = outrow = 0;
|
nuclear@1
|
271 while (outrow < cinfo->max_v_samp_factor) {
|
nuclear@1
|
272 inptr = input_data[inrow];
|
nuclear@1
|
273 outptr = output_data[outrow];
|
nuclear@1
|
274 outend = outptr + cinfo->output_width;
|
nuclear@1
|
275 while (outptr < outend) {
|
nuclear@1
|
276 invalue = *inptr++; /* don't need GETJSAMPLE() here */
|
nuclear@1
|
277 *outptr++ = invalue;
|
nuclear@1
|
278 *outptr++ = invalue;
|
nuclear@1
|
279 }
|
nuclear@1
|
280 jcopy_sample_rows(output_data, outrow, output_data, outrow+1,
|
nuclear@1
|
281 1, cinfo->output_width);
|
nuclear@1
|
282 inrow++;
|
nuclear@1
|
283 outrow += 2;
|
nuclear@1
|
284 }
|
nuclear@1
|
285 }
|
nuclear@1
|
286
|
nuclear@1
|
287
|
nuclear@1
|
288 /*
|
nuclear@1
|
289 * Fancy processing for the common case of 2:1 horizontal and 1:1 vertical.
|
nuclear@1
|
290 *
|
nuclear@1
|
291 * The upsampling algorithm is linear interpolation between pixel centers,
|
nuclear@1
|
292 * also known as a "triangle filter". This is a good compromise between
|
nuclear@1
|
293 * speed and visual quality. The centers of the output pixels are 1/4 and 3/4
|
nuclear@1
|
294 * of the way between input pixel centers.
|
nuclear@1
|
295 *
|
nuclear@1
|
296 * A note about the "bias" calculations: when rounding fractional values to
|
nuclear@1
|
297 * integer, we do not want to always round 0.5 up to the next integer.
|
nuclear@1
|
298 * If we did that, we'd introduce a noticeable bias towards larger values.
|
nuclear@1
|
299 * Instead, this code is arranged so that 0.5 will be rounded up or down at
|
nuclear@1
|
300 * alternate pixel locations (a simple ordered dither pattern).
|
nuclear@1
|
301 */
|
nuclear@1
|
302
|
nuclear@1
|
303 METHODDEF(void)
|
nuclear@1
|
304 h2v1_fancy_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
|
nuclear@1
|
305 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
|
nuclear@1
|
306 {
|
nuclear@1
|
307 JSAMPARRAY output_data = *output_data_ptr;
|
nuclear@1
|
308 register JSAMPROW inptr, outptr;
|
nuclear@1
|
309 register int invalue;
|
nuclear@1
|
310 register JDIMENSION colctr;
|
nuclear@1
|
311 int inrow;
|
nuclear@1
|
312
|
nuclear@1
|
313 for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
|
nuclear@1
|
314 inptr = input_data[inrow];
|
nuclear@1
|
315 outptr = output_data[inrow];
|
nuclear@1
|
316 /* Special case for first column */
|
nuclear@1
|
317 invalue = GETJSAMPLE(*inptr++);
|
nuclear@1
|
318 *outptr++ = (JSAMPLE) invalue;
|
nuclear@1
|
319 *outptr++ = (JSAMPLE) ((invalue * 3 + GETJSAMPLE(*inptr) + 2) >> 2);
|
nuclear@1
|
320
|
nuclear@1
|
321 for (colctr = compptr->downsampled_width - 2; colctr > 0; colctr--) {
|
nuclear@1
|
322 /* General case: 3/4 * nearer pixel + 1/4 * further pixel */
|
nuclear@1
|
323 invalue = GETJSAMPLE(*inptr++) * 3;
|
nuclear@1
|
324 *outptr++ = (JSAMPLE) ((invalue + GETJSAMPLE(inptr[-2]) + 1) >> 2);
|
nuclear@1
|
325 *outptr++ = (JSAMPLE) ((invalue + GETJSAMPLE(*inptr) + 2) >> 2);
|
nuclear@1
|
326 }
|
nuclear@1
|
327
|
nuclear@1
|
328 /* Special case for last column */
|
nuclear@1
|
329 invalue = GETJSAMPLE(*inptr);
|
nuclear@1
|
330 *outptr++ = (JSAMPLE) ((invalue * 3 + GETJSAMPLE(inptr[-1]) + 1) >> 2);
|
nuclear@1
|
331 *outptr++ = (JSAMPLE) invalue;
|
nuclear@1
|
332 }
|
nuclear@1
|
333 }
|
nuclear@1
|
334
|
nuclear@1
|
335
|
nuclear@1
|
336 /*
|
nuclear@1
|
337 * Fancy processing for the common case of 2:1 horizontal and 2:1 vertical.
|
nuclear@1
|
338 * Again a triangle filter; see comments for h2v1 case, above.
|
nuclear@1
|
339 *
|
nuclear@1
|
340 * It is OK for us to reference the adjacent input rows because we demanded
|
nuclear@1
|
341 * context from the main buffer controller (see initialization code).
|
nuclear@1
|
342 */
|
nuclear@1
|
343
|
nuclear@1
|
344 METHODDEF(void)
|
nuclear@1
|
345 h2v2_fancy_upsample (j_decompress_ptr cinfo, jpeg_component_info * compptr,
|
nuclear@1
|
346 JSAMPARRAY input_data, JSAMPARRAY * output_data_ptr)
|
nuclear@1
|
347 {
|
nuclear@1
|
348 JSAMPARRAY output_data = *output_data_ptr;
|
nuclear@1
|
349 register JSAMPROW inptr0, inptr1, outptr;
|
nuclear@1
|
350 #if BITS_IN_JSAMPLE == 8
|
nuclear@1
|
351 register int thiscolsum, lastcolsum, nextcolsum;
|
nuclear@1
|
352 #else
|
nuclear@1
|
353 register INT32 thiscolsum, lastcolsum, nextcolsum;
|
nuclear@1
|
354 #endif
|
nuclear@1
|
355 register JDIMENSION colctr;
|
nuclear@1
|
356 int inrow, outrow, v;
|
nuclear@1
|
357
|
nuclear@1
|
358 inrow = outrow = 0;
|
nuclear@1
|
359 while (outrow < cinfo->max_v_samp_factor) {
|
nuclear@1
|
360 for (v = 0; v < 2; v++) {
|
nuclear@1
|
361 /* inptr0 points to nearest input row, inptr1 points to next nearest */
|
nuclear@1
|
362 inptr0 = input_data[inrow];
|
nuclear@1
|
363 if (v == 0) /* next nearest is row above */
|
nuclear@1
|
364 inptr1 = input_data[inrow-1];
|
nuclear@1
|
365 else /* next nearest is row below */
|
nuclear@1
|
366 inptr1 = input_data[inrow+1];
|
nuclear@1
|
367 outptr = output_data[outrow++];
|
nuclear@1
|
368
|
nuclear@1
|
369 /* Special case for first column */
|
nuclear@1
|
370 thiscolsum = GETJSAMPLE(*inptr0++) * 3 + GETJSAMPLE(*inptr1++);
|
nuclear@1
|
371 nextcolsum = GETJSAMPLE(*inptr0++) * 3 + GETJSAMPLE(*inptr1++);
|
nuclear@1
|
372 *outptr++ = (JSAMPLE) ((thiscolsum * 4 + 8) >> 4);
|
nuclear@1
|
373 *outptr++ = (JSAMPLE) ((thiscolsum * 3 + nextcolsum + 7) >> 4);
|
nuclear@1
|
374 lastcolsum = thiscolsum; thiscolsum = nextcolsum;
|
nuclear@1
|
375
|
nuclear@1
|
376 for (colctr = compptr->downsampled_width - 2; colctr > 0; colctr--) {
|
nuclear@1
|
377 /* General case: 3/4 * nearer pixel + 1/4 * further pixel in each */
|
nuclear@1
|
378 /* dimension, thus 9/16, 3/16, 3/16, 1/16 overall */
|
nuclear@1
|
379 nextcolsum = GETJSAMPLE(*inptr0++) * 3 + GETJSAMPLE(*inptr1++);
|
nuclear@1
|
380 *outptr++ = (JSAMPLE) ((thiscolsum * 3 + lastcolsum + 8) >> 4);
|
nuclear@1
|
381 *outptr++ = (JSAMPLE) ((thiscolsum * 3 + nextcolsum + 7) >> 4);
|
nuclear@1
|
382 lastcolsum = thiscolsum; thiscolsum = nextcolsum;
|
nuclear@1
|
383 }
|
nuclear@1
|
384
|
nuclear@1
|
385 /* Special case for last column */
|
nuclear@1
|
386 *outptr++ = (JSAMPLE) ((thiscolsum * 3 + lastcolsum + 8) >> 4);
|
nuclear@1
|
387 *outptr++ = (JSAMPLE) ((thiscolsum * 4 + 7) >> 4);
|
nuclear@1
|
388 }
|
nuclear@1
|
389 inrow++;
|
nuclear@1
|
390 }
|
nuclear@1
|
391 }
|
nuclear@1
|
392
|
nuclear@1
|
393
|
nuclear@1
|
394 /*
|
nuclear@1
|
395 * Module initialization routine for upsampling.
|
nuclear@1
|
396 */
|
nuclear@1
|
397
|
nuclear@1
|
398 GLOBAL(void)
|
nuclear@1
|
399 jinit_upsampler (j_decompress_ptr cinfo)
|
nuclear@1
|
400 {
|
nuclear@1
|
401 my_upsample_ptr upsample;
|
nuclear@1
|
402 int ci;
|
nuclear@1
|
403 jpeg_component_info * compptr;
|
nuclear@1
|
404 boolean need_buffer, do_fancy;
|
nuclear@1
|
405 int h_in_group, v_in_group, h_out_group, v_out_group;
|
nuclear@1
|
406
|
nuclear@1
|
407 upsample = (my_upsample_ptr)
|
nuclear@1
|
408 (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
|
nuclear@1
|
409 SIZEOF(my_upsampler));
|
nuclear@1
|
410 cinfo->upsample = (struct jpeg_upsampler *) upsample;
|
nuclear@1
|
411 upsample->pub.start_pass = start_pass_upsample;
|
nuclear@1
|
412 upsample->pub.upsample = sep_upsample;
|
nuclear@1
|
413 upsample->pub.need_context_rows = FALSE; /* until we find out differently */
|
nuclear@1
|
414
|
nuclear@1
|
415 if (cinfo->CCIR601_sampling) /* this isn't supported */
|
nuclear@1
|
416 ERREXIT(cinfo, JERR_CCIR601_NOTIMPL);
|
nuclear@1
|
417
|
nuclear@1
|
418 /* jdmainct.c doesn't support context rows when min_DCT_scaled_size = 1,
|
nuclear@1
|
419 * so don't ask for it.
|
nuclear@1
|
420 */
|
nuclear@1
|
421 do_fancy = cinfo->do_fancy_upsampling && cinfo->min_DCT_scaled_size > 1;
|
nuclear@1
|
422
|
nuclear@1
|
423 /* Verify we can handle the sampling factors, select per-component methods,
|
nuclear@1
|
424 * and create storage as needed.
|
nuclear@1
|
425 */
|
nuclear@1
|
426 for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
|
nuclear@1
|
427 ci++, compptr++) {
|
nuclear@1
|
428 /* Compute size of an "input group" after IDCT scaling. This many samples
|
nuclear@1
|
429 * are to be converted to max_h_samp_factor * max_v_samp_factor pixels.
|
nuclear@1
|
430 */
|
nuclear@1
|
431 h_in_group = (compptr->h_samp_factor * compptr->DCT_scaled_size) /
|
nuclear@1
|
432 cinfo->min_DCT_scaled_size;
|
nuclear@1
|
433 v_in_group = (compptr->v_samp_factor * compptr->DCT_scaled_size) /
|
nuclear@1
|
434 cinfo->min_DCT_scaled_size;
|
nuclear@1
|
435 h_out_group = cinfo->max_h_samp_factor;
|
nuclear@1
|
436 v_out_group = cinfo->max_v_samp_factor;
|
nuclear@1
|
437 upsample->rowgroup_height[ci] = v_in_group; /* save for use later */
|
nuclear@1
|
438 need_buffer = TRUE;
|
nuclear@1
|
439 if (! compptr->component_needed) {
|
nuclear@1
|
440 /* Don't bother to upsample an uninteresting component. */
|
nuclear@1
|
441 upsample->methods[ci] = noop_upsample;
|
nuclear@1
|
442 need_buffer = FALSE;
|
nuclear@1
|
443 } else if (h_in_group == h_out_group && v_in_group == v_out_group) {
|
nuclear@1
|
444 /* Fullsize components can be processed without any work. */
|
nuclear@1
|
445 upsample->methods[ci] = fullsize_upsample;
|
nuclear@1
|
446 need_buffer = FALSE;
|
nuclear@1
|
447 } else if (h_in_group * 2 == h_out_group &&
|
nuclear@1
|
448 v_in_group == v_out_group) {
|
nuclear@1
|
449 /* Special cases for 2h1v upsampling */
|
nuclear@1
|
450 if (do_fancy && compptr->downsampled_width > 2)
|
nuclear@1
|
451 upsample->methods[ci] = h2v1_fancy_upsample;
|
nuclear@1
|
452 else
|
nuclear@1
|
453 upsample->methods[ci] = h2v1_upsample;
|
nuclear@1
|
454 } else if (h_in_group * 2 == h_out_group &&
|
nuclear@1
|
455 v_in_group * 2 == v_out_group) {
|
nuclear@1
|
456 /* Special cases for 2h2v upsampling */
|
nuclear@1
|
457 if (do_fancy && compptr->downsampled_width > 2) {
|
nuclear@1
|
458 upsample->methods[ci] = h2v2_fancy_upsample;
|
nuclear@1
|
459 upsample->pub.need_context_rows = TRUE;
|
nuclear@1
|
460 } else
|
nuclear@1
|
461 upsample->methods[ci] = h2v2_upsample;
|
nuclear@1
|
462 } else if ((h_out_group % h_in_group) == 0 &&
|
nuclear@1
|
463 (v_out_group % v_in_group) == 0) {
|
nuclear@1
|
464 /* Generic integral-factors upsampling method */
|
nuclear@1
|
465 upsample->methods[ci] = int_upsample;
|
nuclear@1
|
466 upsample->h_expand[ci] = (UINT8) (h_out_group / h_in_group);
|
nuclear@1
|
467 upsample->v_expand[ci] = (UINT8) (v_out_group / v_in_group);
|
nuclear@1
|
468 } else
|
nuclear@1
|
469 ERREXIT(cinfo, JERR_FRACT_SAMPLE_NOTIMPL);
|
nuclear@1
|
470 if (need_buffer) {
|
nuclear@1
|
471 upsample->color_buf[ci] = (*cinfo->mem->alloc_sarray)
|
nuclear@1
|
472 ((j_common_ptr) cinfo, JPOOL_IMAGE,
|
nuclear@1
|
473 (JDIMENSION) jround_up((long) cinfo->output_width,
|
nuclear@1
|
474 (long) cinfo->max_h_samp_factor),
|
nuclear@1
|
475 (JDIMENSION) cinfo->max_v_samp_factor);
|
nuclear@1
|
476 }
|
nuclear@1
|
477 }
|
nuclear@1
|
478 }
|