jdmainct.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456
  1. /*
  2. * jdmainct.c
  3. *
  4. * This file was part of the Independent JPEG Group's software:
  5. * Copyright (C) 1994-1996, Thomas G. Lane.
  6. * libjpeg-turbo Modifications:
  7. * Copyright (C) 2010, 2016, D. R. Commander.
  8. * For conditions of distribution and use, see the accompanying README.ijg
  9. * file.
  10. *
  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.
  14. *
  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.
  17. */
  18. #include "jinclude.h"
  19. #include "jdmainct.h"
  20. /*
  21. * In the current system design, the main buffer need never be a full-image
  22. * buffer; any full-height buffers will be found inside the coefficient or
  23. * postprocessing controllers. Nonetheless, the main controller is not
  24. * trivial. Its responsibility is to provide context rows for upsampling/
  25. * rescaling, and doing this in an efficient fashion is a bit tricky.
  26. *
  27. * Postprocessor input data is counted in "row groups". A row group
  28. * is defined to be (v_samp_factor * DCT_scaled_size / min_DCT_scaled_size)
  29. * sample rows of each component. (We require DCT_scaled_size values to be
  30. * chosen such that these numbers are integers. In practice DCT_scaled_size
  31. * values will likely be powers of two, so we actually have the stronger
  32. * condition that DCT_scaled_size / min_DCT_scaled_size is an integer.)
  33. * Upsampling will typically produce max_v_samp_factor pixel rows from each
  34. * row group (times any additional scale factor that the upsampler is
  35. * applying).
  36. *
  37. * The coefficient controller will deliver data to us one iMCU row at a time;
  38. * each iMCU row contains v_samp_factor * DCT_scaled_size sample rows, or
  39. * exactly min_DCT_scaled_size row groups. (This amount of data corresponds
  40. * to one row of MCUs when the image is fully interleaved.) Note that the
  41. * number of sample rows varies across components, but the number of row
  42. * groups does not. Some garbage sample rows may be included in the last iMCU
  43. * row at the bottom of the image.
  44. *
  45. * Depending on the vertical scaling algorithm used, the upsampler may need
  46. * access to the sample row(s) above and below its current input row group.
  47. * The upsampler is required to set need_context_rows TRUE at global selection
  48. * time if so. When need_context_rows is FALSE, this controller can simply
  49. * obtain one iMCU row at a time from the coefficient controller and dole it
  50. * out as row groups to the postprocessor.
  51. *
  52. * When need_context_rows is TRUE, this controller guarantees that the buffer
  53. * passed to postprocessing contains at least one row group's worth of samples
  54. * above and below the row group(s) being processed. Note that the context
  55. * rows "above" the first passed row group appear at negative row offsets in
  56. * the passed buffer. At the top and bottom of the image, the required
  57. * context rows are manufactured by duplicating the first or last real sample
  58. * row; this avoids having special cases in the upsampling inner loops.
  59. *
  60. * The amount of context is fixed at one row group just because that's a
  61. * convenient number for this controller to work with. The existing
  62. * upsamplers really only need one sample row of context. An upsampler
  63. * supporting arbitrary output rescaling might wish for more than one row
  64. * group of context when shrinking the image; tough, we don't handle that.
  65. * (This is justified by the assumption that downsizing will be handled mostly
  66. * by adjusting the DCT_scaled_size values, so that the actual scale factor at
  67. * the upsample step needn't be much less than one.)
  68. *
  69. * To provide the desired context, we have to retain the last two row groups
  70. * of one iMCU row while reading in the next iMCU row. (The last row group
  71. * can't be processed until we have another row group for its below-context,
  72. * and so we have to save the next-to-last group too for its above-context.)
  73. * We could do this most simply by copying data around in our buffer, but
  74. * that'd be very slow. We can avoid copying any data by creating a rather
  75. * strange pointer structure. Here's how it works. We allocate a workspace
  76. * consisting of M+2 row groups (where M = min_DCT_scaled_size is the number
  77. * of row groups per iMCU row). We create two sets of redundant pointers to
  78. * the workspace. Labeling the physical row groups 0 to M+1, the synthesized
  79. * pointer lists look like this:
  80. * M+1 M-1
  81. * master pointer --> 0 master pointer --> 0
  82. * 1 1
  83. * ... ...
  84. * M-3 M-3
  85. * M-2 M
  86. * M-1 M+1
  87. * M M-2
  88. * M+1 M-1
  89. * 0 0
  90. * We read alternate iMCU rows using each master pointer; thus the last two
  91. * row groups of the previous iMCU row remain un-overwritten in the workspace.
  92. * The pointer lists are set up so that the required context rows appear to
  93. * be adjacent to the proper places when we pass the pointer lists to the
  94. * upsampler.
  95. *
  96. * The above pictures describe the normal state of the pointer lists.
  97. * At top and bottom of the image, we diddle the pointer lists to duplicate
  98. * the first or last sample row as necessary (this is cheaper than copying
  99. * sample rows around).
  100. *
  101. * This scheme breaks down if M < 2, ie, min_DCT_scaled_size is 1. In that
  102. * situation each iMCU row provides only one row group so the buffering logic
  103. * must be different (eg, we must read two iMCU rows before we can emit the
  104. * first row group). For now, we simply do not support providing context
  105. * rows when min_DCT_scaled_size is 1. That combination seems unlikely to
  106. * be worth providing --- if someone wants a 1/8th-size preview, they probably
  107. * want it quick and dirty, so a context-free upsampler is sufficient.
  108. */
  109. /* Forward declarations */
  110. METHODDEF(void) process_data_simple_main
  111. (j_decompress_ptr cinfo, JSAMPARRAY output_buf,
  112. JDIMENSION *out_row_ctr, JDIMENSION out_rows_avail);
  113. METHODDEF(void) process_data_context_main
  114. (j_decompress_ptr cinfo, JSAMPARRAY output_buf,
  115. JDIMENSION *out_row_ctr, JDIMENSION out_rows_avail);
  116. #ifdef QUANT_2PASS_SUPPORTED
  117. METHODDEF(void) process_data_crank_post
  118. (j_decompress_ptr cinfo, JSAMPARRAY output_buf,
  119. JDIMENSION *out_row_ctr, JDIMENSION out_rows_avail);
  120. #endif
  121. LOCAL(void)
  122. alloc_funny_pointers (j_decompress_ptr cinfo)
  123. /* Allocate space for the funny pointer lists.
  124. * This is done only once, not once per pass.
  125. */
  126. {
  127. my_main_ptr main_ptr = (my_main_ptr) cinfo->main;
  128. int ci, rgroup;
  129. int M = cinfo->_min_DCT_scaled_size;
  130. jpeg_component_info *compptr;
  131. JSAMPARRAY xbuf;
  132. /* Get top-level space for component array pointers.
  133. * We alloc both arrays with one call to save a few cycles.
  134. */
  135. main_ptr->xbuffer[0] = (JSAMPIMAGE)
  136. (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
  137. cinfo->num_components * 2 * sizeof(JSAMPARRAY));
  138. main_ptr->xbuffer[1] = main_ptr->xbuffer[0] + cinfo->num_components;
  139. for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
  140. ci++, compptr++) {
  141. rgroup = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
  142. cinfo->_min_DCT_scaled_size; /* height of a row group of component */
  143. /* Get space for pointer lists --- M+4 row groups in each list.
  144. * We alloc both pointer lists with one call to save a few cycles.
  145. */
  146. xbuf = (JSAMPARRAY)
  147. (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
  148. 2 * (rgroup * (M + 4)) * sizeof(JSAMPROW));
  149. xbuf += rgroup; /* want one row group at negative offsets */
  150. main_ptr->xbuffer[0][ci] = xbuf;
  151. xbuf += rgroup * (M + 4);
  152. main_ptr->xbuffer[1][ci] = xbuf;
  153. }
  154. }
  155. LOCAL(void)
  156. make_funny_pointers (j_decompress_ptr cinfo)
  157. /* Create the funny pointer lists discussed in the comments above.
  158. * The actual workspace is already allocated (in main_ptr->buffer),
  159. * and the space for the pointer lists is allocated too.
  160. * This routine just fills in the curiously ordered lists.
  161. * This will be repeated at the beginning of each pass.
  162. */
  163. {
  164. my_main_ptr main_ptr = (my_main_ptr) cinfo->main;
  165. int ci, i, rgroup;
  166. int M = cinfo->_min_DCT_scaled_size;
  167. jpeg_component_info *compptr;
  168. JSAMPARRAY buf, xbuf0, xbuf1;
  169. for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
  170. ci++, compptr++) {
  171. rgroup = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
  172. cinfo->_min_DCT_scaled_size; /* height of a row group of component */
  173. xbuf0 = main_ptr->xbuffer[0][ci];
  174. xbuf1 = main_ptr->xbuffer[1][ci];
  175. /* First copy the workspace pointers as-is */
  176. buf = main_ptr->buffer[ci];
  177. for (i = 0; i < rgroup * (M + 2); i++) {
  178. xbuf0[i] = xbuf1[i] = buf[i];
  179. }
  180. /* In the second list, put the last four row groups in swapped order */
  181. for (i = 0; i < rgroup * 2; i++) {
  182. xbuf1[rgroup*(M-2) + i] = buf[rgroup*M + i];
  183. xbuf1[rgroup*M + i] = buf[rgroup*(M-2) + i];
  184. }
  185. /* The wraparound pointers at top and bottom will be filled later
  186. * (see set_wraparound_pointers, below). Initially we want the "above"
  187. * pointers to duplicate the first actual data line. This only needs
  188. * to happen in xbuffer[0].
  189. */
  190. for (i = 0; i < rgroup; i++) {
  191. xbuf0[i - rgroup] = xbuf0[0];
  192. }
  193. }
  194. }
  195. LOCAL(void)
  196. set_bottom_pointers (j_decompress_ptr cinfo)
  197. /* Change the pointer lists to duplicate the last sample row at the bottom
  198. * of the image. whichptr indicates which xbuffer holds the final iMCU row.
  199. * Also sets rowgroups_avail to indicate number of nondummy row groups in row.
  200. */
  201. {
  202. my_main_ptr main_ptr = (my_main_ptr) cinfo->main;
  203. int ci, i, rgroup, iMCUheight, rows_left;
  204. jpeg_component_info *compptr;
  205. JSAMPARRAY xbuf;
  206. for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
  207. ci++, compptr++) {
  208. /* Count sample rows in one iMCU row and in one row group */
  209. iMCUheight = compptr->v_samp_factor * compptr->_DCT_scaled_size;
  210. rgroup = iMCUheight / cinfo->_min_DCT_scaled_size;
  211. /* Count nondummy sample rows remaining for this component */
  212. rows_left = (int) (compptr->downsampled_height % (JDIMENSION) iMCUheight);
  213. if (rows_left == 0) rows_left = iMCUheight;
  214. /* Count nondummy row groups. Should get same answer for each component,
  215. * so we need only do it once.
  216. */
  217. if (ci == 0) {
  218. main_ptr->rowgroups_avail = (JDIMENSION) ((rows_left-1) / rgroup + 1);
  219. }
  220. /* Duplicate the last real sample row rgroup*2 times; this pads out the
  221. * last partial rowgroup and ensures at least one full rowgroup of context.
  222. */
  223. xbuf = main_ptr->xbuffer[main_ptr->whichptr][ci];
  224. for (i = 0; i < rgroup * 2; i++) {
  225. xbuf[rows_left + i] = xbuf[rows_left-1];
  226. }
  227. }
  228. }
  229. /*
  230. * Initialize for a processing pass.
  231. */
  232. METHODDEF(void)
  233. start_pass_main (j_decompress_ptr cinfo, J_BUF_MODE pass_mode)
  234. {
  235. my_main_ptr main_ptr = (my_main_ptr) cinfo->main;
  236. switch (pass_mode) {
  237. case JBUF_PASS_THRU:
  238. if (cinfo->upsample->need_context_rows) {
  239. main_ptr->pub.process_data = process_data_context_main;
  240. make_funny_pointers(cinfo); /* Create the xbuffer[] lists */
  241. main_ptr->whichptr = 0; /* Read first iMCU row into xbuffer[0] */
  242. main_ptr->context_state = CTX_PREPARE_FOR_IMCU;
  243. main_ptr->iMCU_row_ctr = 0;
  244. } else {
  245. /* Simple case with no context needed */
  246. main_ptr->pub.process_data = process_data_simple_main;
  247. }
  248. main_ptr->buffer_full = FALSE; /* Mark buffer empty */
  249. main_ptr->rowgroup_ctr = 0;
  250. break;
  251. #ifdef QUANT_2PASS_SUPPORTED
  252. case JBUF_CRANK_DEST:
  253. /* For last pass of 2-pass quantization, just crank the postprocessor */
  254. main_ptr->pub.process_data = process_data_crank_post;
  255. break;
  256. #endif
  257. default:
  258. ERREXIT(cinfo, JERR_BAD_BUFFER_MODE);
  259. break;
  260. }
  261. }
  262. /*
  263. * Process some data.
  264. * This handles the simple case where no context is required.
  265. */
  266. METHODDEF(void)
  267. process_data_simple_main (j_decompress_ptr cinfo,
  268. JSAMPARRAY output_buf, JDIMENSION *out_row_ctr,
  269. JDIMENSION out_rows_avail)
  270. {
  271. my_main_ptr main_ptr = (my_main_ptr) cinfo->main;
  272. JDIMENSION rowgroups_avail;
  273. /* Read input data if we haven't filled the main buffer yet */
  274. if (! main_ptr->buffer_full) {
  275. if (! (*cinfo->coef->decompress_data) (cinfo, main_ptr->buffer))
  276. return; /* suspension forced, can do nothing more */
  277. main_ptr->buffer_full = TRUE; /* OK, we have an iMCU row to work with */
  278. }
  279. /* There are always min_DCT_scaled_size row groups in an iMCU row. */
  280. rowgroups_avail = (JDIMENSION) cinfo->_min_DCT_scaled_size;
  281. /* Note: at the bottom of the image, we may pass extra garbage row groups
  282. * to the postprocessor. The postprocessor has to check for bottom
  283. * of image anyway (at row resolution), so no point in us doing it too.
  284. */
  285. /* Feed the postprocessor */
  286. (*cinfo->post->post_process_data) (cinfo, main_ptr->buffer,
  287. &main_ptr->rowgroup_ctr, rowgroups_avail,
  288. output_buf, out_row_ctr, out_rows_avail);
  289. /* Has postprocessor consumed all the data yet? If so, mark buffer empty */
  290. if (main_ptr->rowgroup_ctr >= rowgroups_avail) {
  291. main_ptr->buffer_full = FALSE;
  292. main_ptr->rowgroup_ctr = 0;
  293. }
  294. }
  295. /*
  296. * Process some data.
  297. * This handles the case where context rows must be provided.
  298. */
  299. METHODDEF(void)
  300. process_data_context_main (j_decompress_ptr cinfo,
  301. JSAMPARRAY output_buf, JDIMENSION *out_row_ctr,
  302. JDIMENSION out_rows_avail)
  303. {
  304. my_main_ptr main_ptr = (my_main_ptr) cinfo->main;
  305. /* Read input data if we haven't filled the main buffer yet */
  306. if (! main_ptr->buffer_full) {
  307. if (! (*cinfo->coef->decompress_data) (cinfo,
  308. main_ptr->xbuffer[main_ptr->whichptr]))
  309. return; /* suspension forced, can do nothing more */
  310. main_ptr->buffer_full = TRUE; /* OK, we have an iMCU row to work with */
  311. main_ptr->iMCU_row_ctr++; /* count rows received */
  312. }
  313. /* Postprocessor typically will not swallow all the input data it is handed
  314. * in one call (due to filling the output buffer first). Must be prepared
  315. * to exit and restart. This switch lets us keep track of how far we got.
  316. * Note that each case falls through to the next on successful completion.
  317. */
  318. switch (main_ptr->context_state) {
  319. case CTX_POSTPONED_ROW:
  320. /* Call postprocessor using previously set pointers for postponed row */
  321. (*cinfo->post->post_process_data) (cinfo, main_ptr->xbuffer[main_ptr->whichptr],
  322. &main_ptr->rowgroup_ctr, main_ptr->rowgroups_avail,
  323. output_buf, out_row_ctr, out_rows_avail);
  324. if (main_ptr->rowgroup_ctr < main_ptr->rowgroups_avail)
  325. return; /* Need to suspend */
  326. main_ptr->context_state = CTX_PREPARE_FOR_IMCU;
  327. if (*out_row_ctr >= out_rows_avail)
  328. return; /* Postprocessor exactly filled output buf */
  329. /*FALLTHROUGH*/
  330. case CTX_PREPARE_FOR_IMCU:
  331. /* Prepare to process first M-1 row groups of this iMCU row */
  332. main_ptr->rowgroup_ctr = 0;
  333. main_ptr->rowgroups_avail = (JDIMENSION) (cinfo->_min_DCT_scaled_size - 1);
  334. /* Check for bottom of image: if so, tweak pointers to "duplicate"
  335. * the last sample row, and adjust rowgroups_avail to ignore padding rows.
  336. */
  337. if (main_ptr->iMCU_row_ctr == cinfo->total_iMCU_rows)
  338. set_bottom_pointers(cinfo);
  339. main_ptr->context_state = CTX_PROCESS_IMCU;
  340. /*FALLTHROUGH*/
  341. case CTX_PROCESS_IMCU:
  342. /* Call postprocessor using previously set pointers */
  343. (*cinfo->post->post_process_data) (cinfo, main_ptr->xbuffer[main_ptr->whichptr],
  344. &main_ptr->rowgroup_ctr, main_ptr->rowgroups_avail,
  345. output_buf, out_row_ctr, out_rows_avail);
  346. if (main_ptr->rowgroup_ctr < main_ptr->rowgroups_avail)
  347. return; /* Need to suspend */
  348. /* After the first iMCU, change wraparound pointers to normal state */
  349. if (main_ptr->iMCU_row_ctr == 1)
  350. set_wraparound_pointers(cinfo);
  351. /* Prepare to load new iMCU row using other xbuffer list */
  352. main_ptr->whichptr ^= 1; /* 0=>1 or 1=>0 */
  353. main_ptr->buffer_full = FALSE;
  354. /* Still need to process last row group of this iMCU row, */
  355. /* which is saved at index M+1 of the other xbuffer */
  356. main_ptr->rowgroup_ctr = (JDIMENSION) (cinfo->_min_DCT_scaled_size + 1);
  357. main_ptr->rowgroups_avail = (JDIMENSION) (cinfo->_min_DCT_scaled_size + 2);
  358. main_ptr->context_state = CTX_POSTPONED_ROW;
  359. }
  360. }
  361. /*
  362. * Process some data.
  363. * Final pass of two-pass quantization: just call the postprocessor.
  364. * Source data will be the postprocessor controller's internal buffer.
  365. */
  366. #ifdef QUANT_2PASS_SUPPORTED
  367. METHODDEF(void)
  368. process_data_crank_post (j_decompress_ptr cinfo,
  369. JSAMPARRAY output_buf, JDIMENSION *out_row_ctr,
  370. JDIMENSION out_rows_avail)
  371. {
  372. (*cinfo->post->post_process_data) (cinfo, (JSAMPIMAGE) NULL,
  373. (JDIMENSION *) NULL, (JDIMENSION) 0,
  374. output_buf, out_row_ctr, out_rows_avail);
  375. }
  376. #endif /* QUANT_2PASS_SUPPORTED */
  377. /*
  378. * Initialize main buffer controller.
  379. */
  380. GLOBAL(void)
  381. jinit_d_main_controller (j_decompress_ptr cinfo, boolean need_full_buffer)
  382. {
  383. my_main_ptr main_ptr;
  384. int ci, rgroup, ngroups;
  385. jpeg_component_info *compptr;
  386. main_ptr = (my_main_ptr)
  387. (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
  388. sizeof(my_main_controller));
  389. cinfo->main = (struct jpeg_d_main_controller *) main_ptr;
  390. main_ptr->pub.start_pass = start_pass_main;
  391. if (need_full_buffer) /* shouldn't happen */
  392. ERREXIT(cinfo, JERR_BAD_BUFFER_MODE);
  393. /* Allocate the workspace.
  394. * ngroups is the number of row groups we need.
  395. */
  396. if (cinfo->upsample->need_context_rows) {
  397. if (cinfo->_min_DCT_scaled_size < 2) /* unsupported, see comments above */
  398. ERREXIT(cinfo, JERR_NOTIMPL);
  399. alloc_funny_pointers(cinfo); /* Alloc space for xbuffer[] lists */
  400. ngroups = cinfo->_min_DCT_scaled_size + 2;
  401. } else {
  402. ngroups = cinfo->_min_DCT_scaled_size;
  403. }
  404. for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
  405. ci++, compptr++) {
  406. rgroup = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
  407. cinfo->_min_DCT_scaled_size; /* height of a row group of component */
  408. main_ptr->buffer[ci] = (*cinfo->mem->alloc_sarray)
  409. ((j_common_ptr) cinfo, JPOOL_IMAGE,
  410. compptr->width_in_blocks * compptr->_DCT_scaled_size,
  411. (JDIMENSION) (rgroup * ngroups));
  412. }
  413. }