jdmaster.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539
  1. /*
  2. * jdmaster.c
  3. *
  4. * Copyright (C) 1991-1997, Thomas G. Lane.
  5. * Modified 2002-2019 by Guido Vollbeding.
  6. * This file is part of the Independent JPEG Group's software.
  7. * For conditions of distribution and use, see the accompanying README file.
  8. *
  9. * This file contains master control logic for the JPEG decompressor.
  10. * These routines are concerned with selecting the modules to be executed
  11. * and with determining the number of passes and the work to be done in each
  12. * pass.
  13. */
  14. #define JPEG_INTERNALS
  15. #include "jinclude.h"
  16. #include "jpeglib.h"
  17. /* Private state */
  18. typedef struct {
  19. struct jpeg_decomp_master pub; /* public fields */
  20. int pass_number; /* # of passes completed */
  21. boolean using_merged_upsample; /* TRUE if using merged upsample/cconvert */
  22. /* Saved references to initialized quantizer modules,
  23. * in case we need to switch modes.
  24. */
  25. struct jpeg_color_quantizer * quantizer_1pass;
  26. struct jpeg_color_quantizer * quantizer_2pass;
  27. } my_decomp_master;
  28. typedef my_decomp_master * my_master_ptr;
  29. /*
  30. * Determine whether merged upsample/color conversion should be used.
  31. * CRUCIAL: this must match the actual capabilities of jdmerge.c!
  32. */
  33. LOCAL(boolean)
  34. use_merged_upsample (j_decompress_ptr cinfo)
  35. {
  36. #ifdef UPSAMPLE_MERGING_SUPPORTED
  37. /* Merging is the equivalent of plain box-filter upsampling. */
  38. /* The following condition is only needed if fancy shall select
  39. * a different upsampling method. In our current implementation
  40. * fancy only affects the DCT scaling, thus we can use fancy
  41. * upsampling and merged upsample simultaneously, in particular
  42. * with scaled DCT sizes larger than the default DCTSIZE.
  43. */
  44. #if 0
  45. if (cinfo->do_fancy_upsampling)
  46. return FALSE;
  47. #endif
  48. if (cinfo->CCIR601_sampling)
  49. return FALSE;
  50. /* jdmerge.c only supports YCC=>RGB color conversion */
  51. if ((cinfo->jpeg_color_space != JCS_YCbCr &&
  52. cinfo->jpeg_color_space != JCS_BG_YCC) ||
  53. cinfo->num_components != 3 ||
  54. cinfo->out_color_space != JCS_RGB ||
  55. cinfo->out_color_components != RGB_PIXELSIZE ||
  56. cinfo->color_transform)
  57. return FALSE;
  58. /* and it only handles 2h1v or 2h2v sampling ratios */
  59. if (cinfo->comp_info[0].h_samp_factor != 2 ||
  60. cinfo->comp_info[1].h_samp_factor != 1 ||
  61. cinfo->comp_info[2].h_samp_factor != 1 ||
  62. cinfo->comp_info[0].v_samp_factor > 2 ||
  63. cinfo->comp_info[1].v_samp_factor != 1 ||
  64. cinfo->comp_info[2].v_samp_factor != 1)
  65. return FALSE;
  66. /* furthermore, it doesn't work if we've scaled the IDCTs differently */
  67. if (cinfo->comp_info[0].DCT_h_scaled_size != cinfo->min_DCT_h_scaled_size ||
  68. cinfo->comp_info[1].DCT_h_scaled_size != cinfo->min_DCT_h_scaled_size ||
  69. cinfo->comp_info[2].DCT_h_scaled_size != cinfo->min_DCT_h_scaled_size ||
  70. cinfo->comp_info[0].DCT_v_scaled_size != cinfo->min_DCT_v_scaled_size ||
  71. cinfo->comp_info[1].DCT_v_scaled_size != cinfo->min_DCT_v_scaled_size ||
  72. cinfo->comp_info[2].DCT_v_scaled_size != cinfo->min_DCT_v_scaled_size)
  73. return FALSE;
  74. /* ??? also need to test for upsample-time rescaling, when & if supported */
  75. return TRUE; /* by golly, it'll work... */
  76. #else
  77. return FALSE;
  78. #endif
  79. }
  80. /*
  81. * Compute output image dimensions and related values.
  82. * NOTE: this is exported for possible use by application.
  83. * Hence it mustn't do anything that can't be done twice.
  84. * Also note that it may be called before the master module is initialized!
  85. */
  86. GLOBAL(void)
  87. jpeg_calc_output_dimensions (j_decompress_ptr cinfo)
  88. /* Do computations that are needed before master selection phase.
  89. * This function is used for full decompression.
  90. */
  91. {
  92. #ifdef IDCT_SCALING_SUPPORTED
  93. int ci, ssize;
  94. jpeg_component_info *compptr;
  95. #endif
  96. /* Prevent application from calling me at wrong times */
  97. if (cinfo->global_state != DSTATE_READY)
  98. ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state);
  99. /* Compute core output image dimensions and DCT scaling choices. */
  100. jpeg_core_output_dimensions(cinfo);
  101. #ifdef IDCT_SCALING_SUPPORTED
  102. /* In selecting the actual DCT scaling for each component, we try to
  103. * scale up the chroma components via IDCT scaling rather than upsampling.
  104. * This saves time if the upsampler gets to use 1:1 scaling.
  105. * Note this code adapts subsampling ratios which are powers of 2.
  106. */
  107. for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
  108. ci++, compptr++) {
  109. ssize = 1;
  110. if (! cinfo->raw_data_out)
  111. while (cinfo->min_DCT_h_scaled_size * ssize <=
  112. (cinfo->do_fancy_upsampling ? DCTSIZE : DCTSIZE / 2) &&
  113. (cinfo->max_h_samp_factor % (compptr->h_samp_factor * ssize * 2)) ==
  114. 0) {
  115. ssize = ssize * 2;
  116. }
  117. compptr->DCT_h_scaled_size = cinfo->min_DCT_h_scaled_size * ssize;
  118. ssize = 1;
  119. if (! cinfo->raw_data_out)
  120. while (cinfo->min_DCT_v_scaled_size * ssize <=
  121. (cinfo->do_fancy_upsampling ? DCTSIZE : DCTSIZE / 2) &&
  122. (cinfo->max_v_samp_factor % (compptr->v_samp_factor * ssize * 2)) ==
  123. 0) {
  124. ssize = ssize * 2;
  125. }
  126. compptr->DCT_v_scaled_size = cinfo->min_DCT_v_scaled_size * ssize;
  127. /* We don't support IDCT ratios larger than 2. */
  128. if (compptr->DCT_h_scaled_size > compptr->DCT_v_scaled_size * 2)
  129. compptr->DCT_h_scaled_size = compptr->DCT_v_scaled_size * 2;
  130. else if (compptr->DCT_v_scaled_size > compptr->DCT_h_scaled_size * 2)
  131. compptr->DCT_v_scaled_size = compptr->DCT_h_scaled_size * 2;
  132. /* Recompute downsampled dimensions of components;
  133. * application needs to know these if using raw downsampled data.
  134. */
  135. /* Size in samples, after IDCT scaling */
  136. compptr->downsampled_width = (JDIMENSION)
  137. jdiv_round_up((long) cinfo->image_width *
  138. (long) (compptr->h_samp_factor * compptr->DCT_h_scaled_size),
  139. (long) (cinfo->max_h_samp_factor * cinfo->block_size));
  140. compptr->downsampled_height = (JDIMENSION)
  141. jdiv_round_up((long) cinfo->image_height *
  142. (long) (compptr->v_samp_factor * compptr->DCT_v_scaled_size),
  143. (long) (cinfo->max_v_samp_factor * cinfo->block_size));
  144. }
  145. #endif /* IDCT_SCALING_SUPPORTED */
  146. /* Report number of components in selected colorspace. */
  147. /* Probably this should be in the color conversion module... */
  148. switch (cinfo->out_color_space) {
  149. case JCS_GRAYSCALE:
  150. cinfo->out_color_components = 1;
  151. break;
  152. case JCS_RGB:
  153. case JCS_BG_RGB:
  154. #if RGB_PIXELSIZE != 3
  155. cinfo->out_color_components = RGB_PIXELSIZE;
  156. break;
  157. #endif /* else share code with YCbCr */
  158. case JCS_YCbCr:
  159. case JCS_BG_YCC:
  160. cinfo->out_color_components = 3;
  161. break;
  162. case JCS_CMYK:
  163. case JCS_YCCK:
  164. cinfo->out_color_components = 4;
  165. break;
  166. default: /* else must be same colorspace as in file */
  167. cinfo->out_color_components = cinfo->num_components;
  168. }
  169. cinfo->output_components = (cinfo->quantize_colors ? 1 :
  170. cinfo->out_color_components);
  171. /* See if upsampler will want to emit more than one row at a time */
  172. if (use_merged_upsample(cinfo))
  173. cinfo->rec_outbuf_height = cinfo->max_v_samp_factor;
  174. else
  175. cinfo->rec_outbuf_height = 1;
  176. }
  177. /*
  178. * Several decompression processes need to range-limit values to the range
  179. * 0..MAXJSAMPLE; the input value may fall somewhat outside this range
  180. * due to noise introduced by quantization, roundoff error, etc. These
  181. * processes are inner loops and need to be as fast as possible. On most
  182. * machines, particularly CPUs with pipelines or instruction prefetch,
  183. * a (subscript-check-less) C table lookup
  184. * x = sample_range_limit[x];
  185. * is faster than explicit tests
  186. * if (x < 0) x = 0;
  187. * else if (x > MAXJSAMPLE) x = MAXJSAMPLE;
  188. * These processes all use a common table prepared by the routine below.
  189. *
  190. * For most steps we can mathematically guarantee that the initial value
  191. * of x is within 2*(MAXJSAMPLE+1) of the legal range, so a table running
  192. * from -2*(MAXJSAMPLE+1) to 3*MAXJSAMPLE+2 is sufficient. But for the
  193. * initial limiting step (just after the IDCT), a wildly out-of-range value
  194. * is possible if the input data is corrupt. To avoid any chance of indexing
  195. * off the end of memory and getting a bad-pointer trap, we perform the
  196. * post-IDCT limiting thus:
  197. * x = (sample_range_limit - SUBSET)[(x + CENTER) & MASK];
  198. * where MASK is 2 bits wider than legal sample data, ie 10 bits for 8-bit
  199. * samples. Under normal circumstances this is more than enough range and
  200. * a correct output will be generated; with bogus input data the mask will
  201. * cause wraparound, and we will safely generate a bogus-but-in-range output.
  202. * For the post-IDCT step, we want to convert the data from signed to unsigned
  203. * representation by adding CENTERJSAMPLE at the same time that we limit it.
  204. * This is accomplished with SUBSET = CENTER - CENTERJSAMPLE.
  205. *
  206. * Note that the table is allocated in near data space on PCs; it's small
  207. * enough and used often enough to justify this.
  208. */
  209. LOCAL(void)
  210. prepare_range_limit_table (j_decompress_ptr cinfo)
  211. /* Allocate and fill in the sample_range_limit table */
  212. {
  213. JSAMPLE * table;
  214. int i;
  215. table = (JSAMPLE *) (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo,
  216. JPOOL_IMAGE, (RANGE_CENTER * 2 + MAXJSAMPLE + 1) * SIZEOF(JSAMPLE));
  217. /* First segment of range limit table: limit[x] = 0 for x < 0 */
  218. MEMZERO(table, RANGE_CENTER * SIZEOF(JSAMPLE));
  219. table += RANGE_CENTER; /* allow negative subscripts of table */
  220. cinfo->sample_range_limit = table;
  221. /* Main part of range limit table: limit[x] = x */
  222. for (i = 0; i <= MAXJSAMPLE; i++)
  223. table[i] = (JSAMPLE) i;
  224. /* End of range limit table: limit[x] = MAXJSAMPLE for x > MAXJSAMPLE */
  225. for (; i <= MAXJSAMPLE + RANGE_CENTER; i++)
  226. table[i] = MAXJSAMPLE;
  227. }
  228. /*
  229. * Master selection of decompression modules.
  230. * This is done once at jpeg_start_decompress time. We determine
  231. * which modules will be used and give them appropriate initialization calls.
  232. * We also initialize the decompressor input side to begin consuming data.
  233. *
  234. * Since jpeg_read_header has finished, we know what is in the SOF
  235. * and (first) SOS markers. We also have all the application parameter
  236. * settings.
  237. */
  238. LOCAL(void)
  239. master_selection (j_decompress_ptr cinfo)
  240. {
  241. my_master_ptr master = (my_master_ptr) cinfo->master;
  242. boolean use_c_buffer;
  243. long samplesperrow;
  244. JDIMENSION jd_samplesperrow;
  245. /* For now, precision must match compiled-in value... */
  246. if (cinfo->data_precision != BITS_IN_JSAMPLE)
  247. ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
  248. /* Initialize dimensions and other stuff */
  249. jpeg_calc_output_dimensions(cinfo);
  250. prepare_range_limit_table(cinfo);
  251. /* Sanity check on image dimensions */
  252. if (cinfo->output_height <= 0 || cinfo->output_width <= 0 ||
  253. cinfo->out_color_components <= 0)
  254. ERREXIT(cinfo, JERR_EMPTY_IMAGE);
  255. /* Width of an output scanline must be representable as JDIMENSION. */
  256. samplesperrow = (long) cinfo->output_width * (long) cinfo->out_color_components;
  257. jd_samplesperrow = (JDIMENSION) samplesperrow;
  258. if ((long) jd_samplesperrow != samplesperrow)
  259. ERREXIT(cinfo, JERR_WIDTH_OVERFLOW);
  260. /* Initialize my private state */
  261. master->pass_number = 0;
  262. master->using_merged_upsample = use_merged_upsample(cinfo);
  263. /* Color quantizer selection */
  264. master->quantizer_1pass = NULL;
  265. master->quantizer_2pass = NULL;
  266. /* No mode changes if not using buffered-image mode. */
  267. if (! cinfo->quantize_colors || ! cinfo->buffered_image) {
  268. cinfo->enable_1pass_quant = FALSE;
  269. cinfo->enable_external_quant = FALSE;
  270. cinfo->enable_2pass_quant = FALSE;
  271. }
  272. if (cinfo->quantize_colors) {
  273. if (cinfo->raw_data_out)
  274. ERREXIT(cinfo, JERR_NOTIMPL);
  275. /* 2-pass quantizer only works in 3-component color space. */
  276. if (cinfo->out_color_components != 3) {
  277. cinfo->enable_1pass_quant = TRUE;
  278. cinfo->enable_external_quant = FALSE;
  279. cinfo->enable_2pass_quant = FALSE;
  280. cinfo->colormap = NULL;
  281. } else if (cinfo->colormap != NULL) {
  282. cinfo->enable_external_quant = TRUE;
  283. } else if (cinfo->two_pass_quantize) {
  284. cinfo->enable_2pass_quant = TRUE;
  285. } else {
  286. cinfo->enable_1pass_quant = TRUE;
  287. }
  288. if (cinfo->enable_1pass_quant) {
  289. #ifdef QUANT_1PASS_SUPPORTED
  290. jinit_1pass_quantizer(cinfo);
  291. master->quantizer_1pass = cinfo->cquantize;
  292. #else
  293. ERREXIT(cinfo, JERR_NOT_COMPILED);
  294. #endif
  295. }
  296. /* We use the 2-pass code to map to external colormaps. */
  297. if (cinfo->enable_2pass_quant || cinfo->enable_external_quant) {
  298. #ifdef QUANT_2PASS_SUPPORTED
  299. jinit_2pass_quantizer(cinfo);
  300. master->quantizer_2pass = cinfo->cquantize;
  301. #else
  302. ERREXIT(cinfo, JERR_NOT_COMPILED);
  303. #endif
  304. }
  305. /* If both quantizers are initialized, the 2-pass one is left active;
  306. * this is necessary for starting with quantization to an external map.
  307. */
  308. }
  309. /* Post-processing: in particular, color conversion first */
  310. if (! cinfo->raw_data_out) {
  311. if (master->using_merged_upsample) {
  312. #ifdef UPSAMPLE_MERGING_SUPPORTED
  313. jinit_merged_upsampler(cinfo); /* does color conversion too */
  314. #else
  315. ERREXIT(cinfo, JERR_NOT_COMPILED);
  316. #endif
  317. } else {
  318. jinit_color_deconverter(cinfo);
  319. jinit_upsampler(cinfo);
  320. }
  321. jinit_d_post_controller(cinfo, cinfo->enable_2pass_quant);
  322. }
  323. /* Inverse DCT */
  324. jinit_inverse_dct(cinfo);
  325. /* Entropy decoding: either Huffman or arithmetic coding. */
  326. if (cinfo->arith_code)
  327. jinit_arith_decoder(cinfo);
  328. else {
  329. jinit_huff_decoder(cinfo);
  330. }
  331. /* Initialize principal buffer controllers. */
  332. use_c_buffer = cinfo->inputctl->has_multiple_scans || cinfo->buffered_image;
  333. jinit_d_coef_controller(cinfo, use_c_buffer);
  334. if (! cinfo->raw_data_out)
  335. jinit_d_main_controller(cinfo, FALSE /* never need full buffer here */);
  336. /* We can now tell the memory manager to allocate virtual arrays. */
  337. (*cinfo->mem->realize_virt_arrays) ((j_common_ptr) cinfo);
  338. /* Initialize input side of decompressor to consume first scan. */
  339. (*cinfo->inputctl->start_input_pass) (cinfo);
  340. #ifdef D_MULTISCAN_FILES_SUPPORTED
  341. /* If jpeg_start_decompress will read the whole file, initialize
  342. * progress monitoring appropriately. The input step is counted
  343. * as one pass.
  344. */
  345. if (cinfo->progress != NULL && ! cinfo->buffered_image &&
  346. cinfo->inputctl->has_multiple_scans) {
  347. int nscans;
  348. /* Estimate number of scans to set pass_limit. */
  349. if (cinfo->progressive_mode) {
  350. /* Arbitrarily estimate 2 interleaved DC scans + 3 AC scans/component. */
  351. nscans = 2 + 3 * cinfo->num_components;
  352. } else {
  353. /* For a nonprogressive multiscan file, estimate 1 scan per component. */
  354. nscans = cinfo->num_components;
  355. }
  356. cinfo->progress->pass_counter = 0L;
  357. cinfo->progress->pass_limit = (long) cinfo->total_iMCU_rows * nscans;
  358. cinfo->progress->completed_passes = 0;
  359. cinfo->progress->total_passes = (cinfo->enable_2pass_quant ? 3 : 2);
  360. /* Count the input pass as done */
  361. master->pass_number++;
  362. }
  363. #endif /* D_MULTISCAN_FILES_SUPPORTED */
  364. }
  365. /*
  366. * Per-pass setup.
  367. * This is called at the beginning of each output pass. We determine which
  368. * modules will be active during this pass and give them appropriate
  369. * start_pass calls. We also set is_dummy_pass to indicate whether this
  370. * is a "real" output pass or a dummy pass for color quantization.
  371. * (In the latter case, jdapistd.c will crank the pass to completion.)
  372. */
  373. METHODDEF(void)
  374. prepare_for_output_pass (j_decompress_ptr cinfo)
  375. {
  376. my_master_ptr master = (my_master_ptr) cinfo->master;
  377. if (master->pub.is_dummy_pass) {
  378. #ifdef QUANT_2PASS_SUPPORTED
  379. /* Final pass of 2-pass quantization */
  380. master->pub.is_dummy_pass = FALSE;
  381. (*cinfo->cquantize->start_pass) (cinfo, FALSE);
  382. (*cinfo->post->start_pass) (cinfo, JBUF_CRANK_DEST);
  383. (*cinfo->main->start_pass) (cinfo, JBUF_CRANK_DEST);
  384. #else
  385. ERREXIT(cinfo, JERR_NOT_COMPILED);
  386. #endif /* QUANT_2PASS_SUPPORTED */
  387. } else {
  388. if (cinfo->quantize_colors && cinfo->colormap == NULL) {
  389. /* Select new quantization method */
  390. if (cinfo->two_pass_quantize && cinfo->enable_2pass_quant) {
  391. cinfo->cquantize = master->quantizer_2pass;
  392. master->pub.is_dummy_pass = TRUE;
  393. } else if (cinfo->enable_1pass_quant) {
  394. cinfo->cquantize = master->quantizer_1pass;
  395. } else {
  396. ERREXIT(cinfo, JERR_MODE_CHANGE);
  397. }
  398. }
  399. (*cinfo->idct->start_pass) (cinfo);
  400. (*cinfo->coef->start_output_pass) (cinfo);
  401. if (! cinfo->raw_data_out) {
  402. if (! master->using_merged_upsample)
  403. (*cinfo->cconvert->start_pass) (cinfo);
  404. (*cinfo->upsample->start_pass) (cinfo);
  405. if (cinfo->quantize_colors)
  406. (*cinfo->cquantize->start_pass) (cinfo, master->pub.is_dummy_pass);
  407. (*cinfo->post->start_pass) (cinfo,
  408. (master->pub.is_dummy_pass ? JBUF_SAVE_AND_PASS : JBUF_PASS_THRU));
  409. (*cinfo->main->start_pass) (cinfo, JBUF_PASS_THRU);
  410. }
  411. }
  412. /* Set up progress monitor's pass info if present */
  413. if (cinfo->progress != NULL) {
  414. cinfo->progress->completed_passes = master->pass_number;
  415. cinfo->progress->total_passes = master->pass_number +
  416. (master->pub.is_dummy_pass ? 2 : 1);
  417. /* In buffered-image mode, we assume one more output pass if EOI not
  418. * yet reached, but no more passes if EOI has been reached.
  419. */
  420. if (cinfo->buffered_image && ! cinfo->inputctl->eoi_reached) {
  421. cinfo->progress->total_passes += (cinfo->enable_2pass_quant ? 2 : 1);
  422. }
  423. }
  424. }
  425. /*
  426. * Finish up at end of an output pass.
  427. */
  428. METHODDEF(void)
  429. finish_output_pass (j_decompress_ptr cinfo)
  430. {
  431. my_master_ptr master = (my_master_ptr) cinfo->master;
  432. if (cinfo->quantize_colors)
  433. (*cinfo->cquantize->finish_pass) (cinfo);
  434. master->pass_number++;
  435. }
  436. #ifdef D_MULTISCAN_FILES_SUPPORTED
  437. /*
  438. * Switch to a new external colormap between output passes.
  439. */
  440. GLOBAL(void)
  441. jpeg_new_colormap (j_decompress_ptr cinfo)
  442. {
  443. my_master_ptr master = (my_master_ptr) cinfo->master;
  444. /* Prevent application from calling me at wrong times */
  445. if (cinfo->global_state != DSTATE_BUFIMAGE)
  446. ERREXIT1(cinfo, JERR_BAD_STATE, cinfo->global_state);
  447. if (cinfo->quantize_colors && cinfo->enable_external_quant &&
  448. cinfo->colormap != NULL) {
  449. /* Select 2-pass quantizer for external colormap use */
  450. cinfo->cquantize = master->quantizer_2pass;
  451. /* Notify quantizer of colormap change */
  452. (*cinfo->cquantize->new_color_map) (cinfo);
  453. master->pub.is_dummy_pass = FALSE; /* just in case */
  454. } else
  455. ERREXIT(cinfo, JERR_MODE_CHANGE);
  456. }
  457. #endif /* D_MULTISCAN_FILES_SUPPORTED */
  458. /*
  459. * Initialize master decompression control and select active modules.
  460. * This is performed at the start of jpeg_start_decompress.
  461. */
  462. GLOBAL(void)
  463. jinit_master_decompress (j_decompress_ptr cinfo)
  464. {
  465. my_master_ptr master;
  466. master = (my_master_ptr) (*cinfo->mem->alloc_small)
  467. ((j_common_ptr) cinfo, JPOOL_IMAGE, SIZEOF(my_decomp_master));
  468. cinfo->master = &master->pub;
  469. master->pub.prepare_for_output_pass = prepare_for_output_pass;
  470. master->pub.finish_output_pass = finish_output_pass;
  471. master->pub.is_dummy_pass = FALSE;
  472. master_selection(cinfo);
  473. }