jdmainct.c 20 KB

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