blob: d656b683cc5edc3b3598fa8da1ae4340f173d5a1 [file] [log] [blame]
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +00001/*
2 * jdmainct.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) 1994-1996, Thomas G. Lane.
DRCa6ef2822013-09-28 03:23:49 +00006 * libjpeg-turbo Modifications:
DRC36a6eec2010-10-08 08:05:44 +00007 * Copyright (C) 2010, D. R. Commander.
DRC7e3acc02015-10-10 10:25:46 -05008 * For conditions of distribution and use, see the accompanying README.ijg
9 * file.
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000010 *
11 * This file contains the main buffer controller for decompression.
12 * The main buffer lies between the JPEG decompressor proper and the
13 * post-processor; it holds downsampled data in the JPEG colorspace.
Thomas G. Lanebc79e061995-08-02 00:00:00 +000014 *
15 * Note that this code is bypassed in raw-data mode, since the application
16 * supplies the equivalent of the main buffer in that case.
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000017 */
18
DRCeb32cc12015-06-25 03:44:36 +000019#include "jdmainct.h"
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +000020
21
22/*
23 * In the current system design, the main buffer need never be a full-image
24 * buffer; any full-height buffers will be found inside the coefficient or
25 * postprocessing controllers. Nonetheless, the main controller is not
26 * trivial. Its responsibility is to provide context rows for upsampling/
27 * rescaling, and doing this in an efficient fashion is a bit tricky.
28 *
29 * Postprocessor input data is counted in "row groups". A row group
30 * is defined to be (v_samp_factor * DCT_scaled_size / min_DCT_scaled_size)
31 * sample rows of each component. (We require DCT_scaled_size values to be
32 * chosen such that these numbers are integers. In practice DCT_scaled_size
33 * values will likely be powers of two, so we actually have the stronger
34 * condition that DCT_scaled_size / min_DCT_scaled_size is an integer.)
35 * Upsampling will typically produce max_v_samp_factor pixel rows from each
36 * row group (times any additional scale factor that the upsampler is
37 * applying).
38 *
39 * The coefficient controller will deliver data to us one iMCU row at a time;
40 * each iMCU row contains v_samp_factor * DCT_scaled_size sample rows, or
41 * exactly min_DCT_scaled_size row groups. (This amount of data corresponds
42 * to one row of MCUs when the image is fully interleaved.) Note that the
43 * number of sample rows varies across components, but the number of row
44 * groups does not. Some garbage sample rows may be included in the last iMCU
45 * row at the bottom of the image.
46 *
47 * Depending on the vertical scaling algorithm used, the upsampler may need
48 * access to the sample row(s) above and below its current input row group.
49 * The upsampler is required to set need_context_rows TRUE at global selection
50 * time if so. When need_context_rows is FALSE, this controller can simply
51 * obtain one iMCU row at a time from the coefficient controller and dole it
52 * out as row groups to the postprocessor.
53 *
54 * When need_context_rows is TRUE, this controller guarantees that the buffer
55 * passed to postprocessing contains at least one row group's worth of samples
56 * above and below the row group(s) being processed. Note that the context
57 * rows "above" the first passed row group appear at negative row offsets in
58 * the passed buffer. At the top and bottom of the image, the required
59 * context rows are manufactured by duplicating the first or last real sample
60 * row; this avoids having special cases in the upsampling inner loops.
61 *
62 * The amount of context is fixed at one row group just because that's a
63 * convenient number for this controller to work with. The existing
64 * upsamplers really only need one sample row of context. An upsampler
65 * supporting arbitrary output rescaling might wish for more than one row
66 * group of context when shrinking the image; tough, we don't handle that.
67 * (This is justified by the assumption that downsizing will be handled mostly
68 * by adjusting the DCT_scaled_size values, so that the actual scale factor at
69 * the upsample step needn't be much less than one.)
70 *
71 * To provide the desired context, we have to retain the last two row groups
72 * of one iMCU row while reading in the next iMCU row. (The last row group
73 * can't be processed until we have another row group for its below-context,
74 * and so we have to save the next-to-last group too for its above-context.)
75 * We could do this most simply by copying data around in our buffer, but
76 * that'd be very slow. We can avoid copying any data by creating a rather
77 * strange pointer structure. Here's how it works. We allocate a workspace
78 * consisting of M+2 row groups (where M = min_DCT_scaled_size is the number
79 * of row groups per iMCU row). We create two sets of redundant pointers to
80 * the workspace. Labeling the physical row groups 0 to M+1, the synthesized
81 * pointer lists look like this:
82 * M+1 M-1
83 * master pointer --> 0 master pointer --> 0
84 * 1 1
85 * ... ...
86 * M-3 M-3
87 * M-2 M
88 * M-1 M+1
89 * M M-2
90 * M+1 M-1
91 * 0 0
92 * We read alternate iMCU rows using each master pointer; thus the last two
93 * row groups of the previous iMCU row remain un-overwritten in the workspace.
94 * The pointer lists are set up so that the required context rows appear to
95 * be adjacent to the proper places when we pass the pointer lists to the
96 * upsampler.
97 *
98 * The above pictures describe the normal state of the pointer lists.
99 * At top and bottom of the image, we diddle the pointer lists to duplicate
100 * the first or last sample row as necessary (this is cheaper than copying
101 * sample rows around).
102 *
103 * This scheme breaks down if M < 2, ie, min_DCT_scaled_size is 1. In that
104 * situation each iMCU row provides only one row group so the buffering logic
105 * must be different (eg, we must read two iMCU rows before we can emit the
106 * first row group). For now, we simply do not support providing context
107 * rows when min_DCT_scaled_size is 1. That combination seems unlikely to
108 * be worth providing --- if someone wants a 1/8th-size preview, they probably
109 * want it quick and dirty, so a context-free upsampler is sufficient.
110 */
111
112
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000113/* Forward declarations */
Thomas G. Lane489583f1996-02-07 00:00:00 +0000114METHODDEF(void) process_data_simple_main
DRCbc56b752014-05-16 10:43:44 +0000115 (j_decompress_ptr cinfo, JSAMPARRAY output_buf,
116 JDIMENSION *out_row_ctr, JDIMENSION out_rows_avail);
Thomas G. Lane489583f1996-02-07 00:00:00 +0000117METHODDEF(void) process_data_context_main
DRCbc56b752014-05-16 10:43:44 +0000118 (j_decompress_ptr cinfo, JSAMPARRAY output_buf,
119 JDIMENSION *out_row_ctr, JDIMENSION out_rows_avail);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000120#ifdef QUANT_2PASS_SUPPORTED
Thomas G. Lane489583f1996-02-07 00:00:00 +0000121METHODDEF(void) process_data_crank_post
DRCbc56b752014-05-16 10:43:44 +0000122 (j_decompress_ptr cinfo, JSAMPARRAY output_buf,
123 JDIMENSION *out_row_ctr, JDIMENSION out_rows_avail);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000124#endif
125
126
Thomas G. Lane489583f1996-02-07 00:00:00 +0000127LOCAL(void)
Thomas G. Lanebc79e061995-08-02 00:00:00 +0000128alloc_funny_pointers (j_decompress_ptr cinfo)
129/* Allocate space for the funny pointer lists.
130 * This is done only once, not once per pass.
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000131 */
132{
DRC7ed7b572012-02-07 22:51:49 +0000133 my_main_ptr main_ptr = (my_main_ptr) cinfo->main;
Thomas G. Lanebc79e061995-08-02 00:00:00 +0000134 int ci, rgroup;
DRC49967cd2010-10-09 19:57:51 +0000135 int M = cinfo->_min_DCT_scaled_size;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000136 jpeg_component_info *compptr;
Thomas G. Lanebc79e061995-08-02 00:00:00 +0000137 JSAMPARRAY xbuf;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000138
139 /* Get top-level space for component array pointers.
140 * We alloc both arrays with one call to save a few cycles.
141 */
DRC7ed7b572012-02-07 22:51:49 +0000142 main_ptr->xbuffer[0] = (JSAMPIMAGE)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000143 (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
DRC5de454b2014-05-18 19:04:03 +0000144 cinfo->num_components * 2 * sizeof(JSAMPARRAY));
DRC7ed7b572012-02-07 22:51:49 +0000145 main_ptr->xbuffer[1] = main_ptr->xbuffer[0] + cinfo->num_components;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000146
147 for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
148 ci++, compptr++) {
DRC49967cd2010-10-09 19:57:51 +0000149 rgroup = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
150 cinfo->_min_DCT_scaled_size; /* height of a row group of component */
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000151 /* Get space for pointer lists --- M+4 row groups in each list.
152 * We alloc both pointer lists with one call to save a few cycles.
153 */
Thomas G. Lanebc79e061995-08-02 00:00:00 +0000154 xbuf = (JSAMPARRAY)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000155 (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
DRC5de454b2014-05-18 19:04:03 +0000156 2 * (rgroup * (M + 4)) * sizeof(JSAMPROW));
DRCe5eaf372014-05-09 18:00:32 +0000157 xbuf += rgroup; /* want one row group at negative offsets */
DRC7ed7b572012-02-07 22:51:49 +0000158 main_ptr->xbuffer[0][ci] = xbuf;
Thomas G. Lanebc79e061995-08-02 00:00:00 +0000159 xbuf += rgroup * (M + 4);
DRC7ed7b572012-02-07 22:51:49 +0000160 main_ptr->xbuffer[1][ci] = xbuf;
Thomas G. Lanebc79e061995-08-02 00:00:00 +0000161 }
162}
163
164
Thomas G. Lane489583f1996-02-07 00:00:00 +0000165LOCAL(void)
Thomas G. Lanebc79e061995-08-02 00:00:00 +0000166make_funny_pointers (j_decompress_ptr cinfo)
167/* Create the funny pointer lists discussed in the comments above.
DRC7ed7b572012-02-07 22:51:49 +0000168 * The actual workspace is already allocated (in main_ptr->buffer),
Thomas G. Lanebc79e061995-08-02 00:00:00 +0000169 * and the space for the pointer lists is allocated too.
170 * This routine just fills in the curiously ordered lists.
171 * This will be repeated at the beginning of each pass.
172 */
173{
DRC7ed7b572012-02-07 22:51:49 +0000174 my_main_ptr main_ptr = (my_main_ptr) cinfo->main;
Thomas G. Lanebc79e061995-08-02 00:00:00 +0000175 int ci, i, rgroup;
DRC49967cd2010-10-09 19:57:51 +0000176 int M = cinfo->_min_DCT_scaled_size;
Thomas G. Lanebc79e061995-08-02 00:00:00 +0000177 jpeg_component_info *compptr;
178 JSAMPARRAY buf, xbuf0, xbuf1;
179
180 for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
181 ci++, compptr++) {
DRC49967cd2010-10-09 19:57:51 +0000182 rgroup = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
183 cinfo->_min_DCT_scaled_size; /* height of a row group of component */
DRC7ed7b572012-02-07 22:51:49 +0000184 xbuf0 = main_ptr->xbuffer[0][ci];
185 xbuf1 = main_ptr->xbuffer[1][ci];
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000186 /* First copy the workspace pointers as-is */
DRC7ed7b572012-02-07 22:51:49 +0000187 buf = main_ptr->buffer[ci];
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000188 for (i = 0; i < rgroup * (M + 2); i++) {
189 xbuf0[i] = xbuf1[i] = buf[i];
190 }
191 /* In the second list, put the last four row groups in swapped order */
192 for (i = 0; i < rgroup * 2; i++) {
193 xbuf1[rgroup*(M-2) + i] = buf[rgroup*M + i];
194 xbuf1[rgroup*M + i] = buf[rgroup*(M-2) + i];
195 }
196 /* The wraparound pointers at top and bottom will be filled later
197 * (see set_wraparound_pointers, below). Initially we want the "above"
198 * pointers to duplicate the first actual data line. This only needs
199 * to happen in xbuffer[0].
200 */
201 for (i = 0; i < rgroup; i++) {
202 xbuf0[i - rgroup] = xbuf0[0];
203 }
204 }
205}
206
207
Thomas G. Lane489583f1996-02-07 00:00:00 +0000208LOCAL(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000209set_bottom_pointers (j_decompress_ptr cinfo)
210/* Change the pointer lists to duplicate the last sample row at the bottom
211 * of the image. whichptr indicates which xbuffer holds the final iMCU row.
212 * Also sets rowgroups_avail to indicate number of nondummy row groups in row.
213 */
214{
DRC7ed7b572012-02-07 22:51:49 +0000215 my_main_ptr main_ptr = (my_main_ptr) cinfo->main;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000216 int ci, i, rgroup, iMCUheight, rows_left;
217 jpeg_component_info *compptr;
218 JSAMPARRAY xbuf;
219
220 for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
221 ci++, compptr++) {
222 /* Count sample rows in one iMCU row and in one row group */
DRC49967cd2010-10-09 19:57:51 +0000223 iMCUheight = compptr->v_samp_factor * compptr->_DCT_scaled_size;
224 rgroup = iMCUheight / cinfo->_min_DCT_scaled_size;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000225 /* Count nondummy sample rows remaining for this component */
226 rows_left = (int) (compptr->downsampled_height % (JDIMENSION) iMCUheight);
227 if (rows_left == 0) rows_left = iMCUheight;
228 /* Count nondummy row groups. Should get same answer for each component,
229 * so we need only do it once.
230 */
231 if (ci == 0) {
DRC7ed7b572012-02-07 22:51:49 +0000232 main_ptr->rowgroups_avail = (JDIMENSION) ((rows_left-1) / rgroup + 1);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000233 }
234 /* Duplicate the last real sample row rgroup*2 times; this pads out the
235 * last partial rowgroup and ensures at least one full rowgroup of context.
236 */
DRC7ed7b572012-02-07 22:51:49 +0000237 xbuf = main_ptr->xbuffer[main_ptr->whichptr][ci];
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000238 for (i = 0; i < rgroup * 2; i++) {
239 xbuf[rows_left + i] = xbuf[rows_left-1];
240 }
241 }
242}
243
244
245/*
246 * Initialize for a processing pass.
247 */
248
Thomas G. Lane489583f1996-02-07 00:00:00 +0000249METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000250start_pass_main (j_decompress_ptr cinfo, J_BUF_MODE pass_mode)
251{
DRC7ed7b572012-02-07 22:51:49 +0000252 my_main_ptr main_ptr = (my_main_ptr) cinfo->main;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000253
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000254 switch (pass_mode) {
255 case JBUF_PASS_THRU:
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000256 if (cinfo->upsample->need_context_rows) {
DRC7ed7b572012-02-07 22:51:49 +0000257 main_ptr->pub.process_data = process_data_context_main;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000258 make_funny_pointers(cinfo); /* Create the xbuffer[] lists */
DRCe5eaf372014-05-09 18:00:32 +0000259 main_ptr->whichptr = 0; /* Read first iMCU row into xbuffer[0] */
DRC7ed7b572012-02-07 22:51:49 +0000260 main_ptr->context_state = CTX_PREPARE_FOR_IMCU;
261 main_ptr->iMCU_row_ctr = 0;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000262 } else {
263 /* Simple case with no context needed */
DRC7ed7b572012-02-07 22:51:49 +0000264 main_ptr->pub.process_data = process_data_simple_main;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000265 }
DRCe5eaf372014-05-09 18:00:32 +0000266 main_ptr->buffer_full = FALSE; /* Mark buffer empty */
DRC7ed7b572012-02-07 22:51:49 +0000267 main_ptr->rowgroup_ctr = 0;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000268 break;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000269#ifdef QUANT_2PASS_SUPPORTED
270 case JBUF_CRANK_DEST:
271 /* For last pass of 2-pass quantization, just crank the postprocessor */
DRC7ed7b572012-02-07 22:51:49 +0000272 main_ptr->pub.process_data = process_data_crank_post;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000273 break;
274#endif
275 default:
276 ERREXIT(cinfo, JERR_BAD_BUFFER_MODE);
277 break;
278 }
279}
280
281
282/*
283 * Process some data.
284 * This handles the simple case where no context is required.
285 */
286
Thomas G. Lane489583f1996-02-07 00:00:00 +0000287METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000288process_data_simple_main (j_decompress_ptr cinfo,
DRCe5eaf372014-05-09 18:00:32 +0000289 JSAMPARRAY output_buf, JDIMENSION *out_row_ctr,
290 JDIMENSION out_rows_avail)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000291{
DRC7ed7b572012-02-07 22:51:49 +0000292 my_main_ptr main_ptr = (my_main_ptr) cinfo->main;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000293 JDIMENSION rowgroups_avail;
294
295 /* Read input data if we haven't filled the main buffer yet */
DRC7ed7b572012-02-07 22:51:49 +0000296 if (! main_ptr->buffer_full) {
297 if (! (*cinfo->coef->decompress_data) (cinfo, main_ptr->buffer))
DRCe5eaf372014-05-09 18:00:32 +0000298 return; /* suspension forced, can do nothing more */
299 main_ptr->buffer_full = TRUE; /* OK, we have an iMCU row to work with */
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000300 }
301
302 /* There are always min_DCT_scaled_size row groups in an iMCU row. */
DRC49967cd2010-10-09 19:57:51 +0000303 rowgroups_avail = (JDIMENSION) cinfo->_min_DCT_scaled_size;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000304 /* Note: at the bottom of the image, we may pass extra garbage row groups
305 * to the postprocessor. The postprocessor has to check for bottom
306 * of image anyway (at row resolution), so no point in us doing it too.
307 */
308
309 /* Feed the postprocessor */
DRC7ed7b572012-02-07 22:51:49 +0000310 (*cinfo->post->post_process_data) (cinfo, main_ptr->buffer,
DRCe5eaf372014-05-09 18:00:32 +0000311 &main_ptr->rowgroup_ctr, rowgroups_avail,
312 output_buf, out_row_ctr, out_rows_avail);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000313
314 /* Has postprocessor consumed all the data yet? If so, mark buffer empty */
DRC7ed7b572012-02-07 22:51:49 +0000315 if (main_ptr->rowgroup_ctr >= rowgroups_avail) {
316 main_ptr->buffer_full = FALSE;
317 main_ptr->rowgroup_ctr = 0;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000318 }
319}
320
321
322/*
323 * Process some data.
324 * This handles the case where context rows must be provided.
325 */
326
Thomas G. Lane489583f1996-02-07 00:00:00 +0000327METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000328process_data_context_main (j_decompress_ptr cinfo,
DRCe5eaf372014-05-09 18:00:32 +0000329 JSAMPARRAY output_buf, JDIMENSION *out_row_ctr,
330 JDIMENSION out_rows_avail)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000331{
DRC7ed7b572012-02-07 22:51:49 +0000332 my_main_ptr main_ptr = (my_main_ptr) cinfo->main;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000333
334 /* Read input data if we haven't filled the main buffer yet */
DRC7ed7b572012-02-07 22:51:49 +0000335 if (! main_ptr->buffer_full) {
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000336 if (! (*cinfo->coef->decompress_data) (cinfo,
DRCe5eaf372014-05-09 18:00:32 +0000337 main_ptr->xbuffer[main_ptr->whichptr]))
338 return; /* suspension forced, can do nothing more */
339 main_ptr->buffer_full = TRUE; /* OK, we have an iMCU row to work with */
340 main_ptr->iMCU_row_ctr++; /* count rows received */
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000341 }
342
343 /* Postprocessor typically will not swallow all the input data it is handed
344 * in one call (due to filling the output buffer first). Must be prepared
345 * to exit and restart. This switch lets us keep track of how far we got.
346 * Note that each case falls through to the next on successful completion.
347 */
DRC7ed7b572012-02-07 22:51:49 +0000348 switch (main_ptr->context_state) {
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000349 case CTX_POSTPONED_ROW:
350 /* Call postprocessor using previously set pointers for postponed row */
DRC7ed7b572012-02-07 22:51:49 +0000351 (*cinfo->post->post_process_data) (cinfo, main_ptr->xbuffer[main_ptr->whichptr],
DRCe5eaf372014-05-09 18:00:32 +0000352 &main_ptr->rowgroup_ctr, main_ptr->rowgroups_avail,
353 output_buf, out_row_ctr, out_rows_avail);
DRC7ed7b572012-02-07 22:51:49 +0000354 if (main_ptr->rowgroup_ctr < main_ptr->rowgroups_avail)
DRCe5eaf372014-05-09 18:00:32 +0000355 return; /* Need to suspend */
DRC7ed7b572012-02-07 22:51:49 +0000356 main_ptr->context_state = CTX_PREPARE_FOR_IMCU;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000357 if (*out_row_ctr >= out_rows_avail)
DRCe5eaf372014-05-09 18:00:32 +0000358 return; /* Postprocessor exactly filled output buf */
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000359 /*FALLTHROUGH*/
360 case CTX_PREPARE_FOR_IMCU:
361 /* Prepare to process first M-1 row groups of this iMCU row */
DRC7ed7b572012-02-07 22:51:49 +0000362 main_ptr->rowgroup_ctr = 0;
363 main_ptr->rowgroups_avail = (JDIMENSION) (cinfo->_min_DCT_scaled_size - 1);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000364 /* Check for bottom of image: if so, tweak pointers to "duplicate"
365 * the last sample row, and adjust rowgroups_avail to ignore padding rows.
366 */
DRC7ed7b572012-02-07 22:51:49 +0000367 if (main_ptr->iMCU_row_ctr == cinfo->total_iMCU_rows)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000368 set_bottom_pointers(cinfo);
DRC7ed7b572012-02-07 22:51:49 +0000369 main_ptr->context_state = CTX_PROCESS_IMCU;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000370 /*FALLTHROUGH*/
371 case CTX_PROCESS_IMCU:
372 /* Call postprocessor using previously set pointers */
DRC7ed7b572012-02-07 22:51:49 +0000373 (*cinfo->post->post_process_data) (cinfo, main_ptr->xbuffer[main_ptr->whichptr],
DRCe5eaf372014-05-09 18:00:32 +0000374 &main_ptr->rowgroup_ctr, main_ptr->rowgroups_avail,
375 output_buf, out_row_ctr, out_rows_avail);
DRC7ed7b572012-02-07 22:51:49 +0000376 if (main_ptr->rowgroup_ctr < main_ptr->rowgroups_avail)
DRCe5eaf372014-05-09 18:00:32 +0000377 return; /* Need to suspend */
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000378 /* After the first iMCU, change wraparound pointers to normal state */
DRC7ed7b572012-02-07 22:51:49 +0000379 if (main_ptr->iMCU_row_ctr == 1)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000380 set_wraparound_pointers(cinfo);
381 /* Prepare to load new iMCU row using other xbuffer list */
DRCe5eaf372014-05-09 18:00:32 +0000382 main_ptr->whichptr ^= 1; /* 0=>1 or 1=>0 */
DRC7ed7b572012-02-07 22:51:49 +0000383 main_ptr->buffer_full = FALSE;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000384 /* Still need to process last row group of this iMCU row, */
385 /* which is saved at index M+1 of the other xbuffer */
DRC7ed7b572012-02-07 22:51:49 +0000386 main_ptr->rowgroup_ctr = (JDIMENSION) (cinfo->_min_DCT_scaled_size + 1);
387 main_ptr->rowgroups_avail = (JDIMENSION) (cinfo->_min_DCT_scaled_size + 2);
388 main_ptr->context_state = CTX_POSTPONED_ROW;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000389 }
390}
391
392
393/*
394 * Process some data.
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000395 * Final pass of two-pass quantization: just call the postprocessor.
396 * Source data will be the postprocessor controller's internal buffer.
397 */
398
399#ifdef QUANT_2PASS_SUPPORTED
400
Thomas G. Lane489583f1996-02-07 00:00:00 +0000401METHODDEF(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000402process_data_crank_post (j_decompress_ptr cinfo,
DRCe5eaf372014-05-09 18:00:32 +0000403 JSAMPARRAY output_buf, JDIMENSION *out_row_ctr,
404 JDIMENSION out_rows_avail)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000405{
406 (*cinfo->post->post_process_data) (cinfo, (JSAMPIMAGE) NULL,
DRCe5eaf372014-05-09 18:00:32 +0000407 (JDIMENSION *) NULL, (JDIMENSION) 0,
408 output_buf, out_row_ctr, out_rows_avail);
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000409}
410
411#endif /* QUANT_2PASS_SUPPORTED */
412
413
414/*
415 * Initialize main buffer controller.
416 */
417
Thomas G. Lane489583f1996-02-07 00:00:00 +0000418GLOBAL(void)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000419jinit_d_main_controller (j_decompress_ptr cinfo, boolean need_full_buffer)
420{
DRC7ed7b572012-02-07 22:51:49 +0000421 my_main_ptr main_ptr;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000422 int ci, rgroup, ngroups;
423 jpeg_component_info *compptr;
424
DRC7ed7b572012-02-07 22:51:49 +0000425 main_ptr = (my_main_ptr)
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000426 (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
DRC5de454b2014-05-18 19:04:03 +0000427 sizeof(my_main_controller));
DRC7ed7b572012-02-07 22:51:49 +0000428 cinfo->main = (struct jpeg_d_main_controller *) main_ptr;
429 main_ptr->pub.start_pass = start_pass_main;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000430
DRCe5eaf372014-05-09 18:00:32 +0000431 if (need_full_buffer) /* shouldn't happen */
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000432 ERREXIT(cinfo, JERR_BAD_BUFFER_MODE);
433
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000434 /* Allocate the workspace.
435 * ngroups is the number of row groups we need.
436 */
437 if (cinfo->upsample->need_context_rows) {
DRC49967cd2010-10-09 19:57:51 +0000438 if (cinfo->_min_DCT_scaled_size < 2) /* unsupported, see comments above */
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000439 ERREXIT(cinfo, JERR_NOTIMPL);
Thomas G. Lanebc79e061995-08-02 00:00:00 +0000440 alloc_funny_pointers(cinfo); /* Alloc space for xbuffer[] lists */
DRC49967cd2010-10-09 19:57:51 +0000441 ngroups = cinfo->_min_DCT_scaled_size + 2;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000442 } else {
DRC49967cd2010-10-09 19:57:51 +0000443 ngroups = cinfo->_min_DCT_scaled_size;
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000444 }
445
446 for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
447 ci++, compptr++) {
DRC49967cd2010-10-09 19:57:51 +0000448 rgroup = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
449 cinfo->_min_DCT_scaled_size; /* height of a row group of component */
DRC7ed7b572012-02-07 22:51:49 +0000450 main_ptr->buffer[ci] = (*cinfo->mem->alloc_sarray)
DRCe5eaf372014-05-09 18:00:32 +0000451 ((j_common_ptr) cinfo, JPOOL_IMAGE,
452 compptr->width_in_blocks * compptr->_DCT_scaled_size,
453 (JDIMENSION) (rgroup * ngroups));
Thomas G. Lane36a4ccc1994-09-24 00:00:00 +0000454 }
455}