jdmainct.c 19 KB

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