nuclear@0: /* nuclear@0: * jcdctmgr.c nuclear@0: * nuclear@0: * Copyright (C) 1994-1996, Thomas G. Lane. nuclear@0: * This file is part of the Independent JPEG Group's software. nuclear@0: * For conditions of distribution and use, see the accompanying README file. nuclear@0: * nuclear@0: * This file contains the forward-DCT management logic. nuclear@0: * This code selects a particular DCT implementation to be used, nuclear@0: * and it performs related housekeeping chores including coefficient nuclear@0: * quantization. nuclear@0: */ nuclear@0: nuclear@0: #define JPEG_INTERNALS nuclear@0: #include "jinclude.h" nuclear@0: #include "jpeglib.h" nuclear@0: #include "jdct.h" /* Private declarations for DCT subsystem */ nuclear@0: nuclear@0: nuclear@0: /* Private subobject for this module */ nuclear@0: nuclear@0: typedef struct { nuclear@0: struct jpeg_forward_dct pub; /* public fields */ nuclear@0: nuclear@0: /* Pointer to the DCT routine actually in use */ nuclear@0: forward_DCT_method_ptr do_dct; nuclear@0: nuclear@0: /* The actual post-DCT divisors --- not identical to the quant table nuclear@0: * entries, because of scaling (especially for an unnormalized DCT). nuclear@0: * Each table is given in normal array order. nuclear@0: */ nuclear@0: DCTELEM * divisors[NUM_QUANT_TBLS]; nuclear@0: nuclear@0: #ifdef DCT_FLOAT_SUPPORTED nuclear@0: /* Same as above for the floating-point case. */ nuclear@0: float_DCT_method_ptr do_float_dct; nuclear@0: FAST_FLOAT * float_divisors[NUM_QUANT_TBLS]; nuclear@0: #endif nuclear@0: } my_fdct_controller; nuclear@0: nuclear@0: typedef my_fdct_controller * my_fdct_ptr; nuclear@0: nuclear@0: nuclear@0: /* nuclear@0: * Initialize for a processing pass. nuclear@0: * Verify that all referenced Q-tables are present, and set up nuclear@0: * the divisor table for each one. nuclear@0: * In the current implementation, DCT of all components is done during nuclear@0: * the first pass, even if only some components will be output in the nuclear@0: * first scan. Hence all components should be examined here. nuclear@0: */ nuclear@0: nuclear@0: METHODDEF(void) nuclear@0: start_pass_fdctmgr (j_compress_ptr cinfo) nuclear@0: { nuclear@0: my_fdct_ptr fdct = (my_fdct_ptr) cinfo->fdct; nuclear@0: int ci, qtblno, i; nuclear@0: jpeg_component_info *compptr; nuclear@0: JQUANT_TBL * qtbl; nuclear@0: DCTELEM * dtbl; nuclear@0: nuclear@0: for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; nuclear@0: ci++, compptr++) { nuclear@0: qtblno = compptr->quant_tbl_no; nuclear@0: /* Make sure specified quantization table is present */ nuclear@0: if (qtblno < 0 || qtblno >= NUM_QUANT_TBLS || nuclear@0: cinfo->quant_tbl_ptrs[qtblno] == NULL) nuclear@0: ERREXIT1(cinfo, JERR_NO_QUANT_TABLE, qtblno); nuclear@0: qtbl = cinfo->quant_tbl_ptrs[qtblno]; nuclear@0: /* Compute divisors for this quant table */ nuclear@0: /* We may do this more than once for same table, but it's not a big deal */ nuclear@0: switch (cinfo->dct_method) { nuclear@0: #ifdef DCT_ISLOW_SUPPORTED nuclear@0: case JDCT_ISLOW: nuclear@0: /* For LL&M IDCT method, divisors are equal to raw quantization nuclear@0: * coefficients multiplied by 8 (to counteract scaling). nuclear@0: */ nuclear@0: if (fdct->divisors[qtblno] == NULL) { nuclear@0: fdct->divisors[qtblno] = (DCTELEM *) nuclear@0: (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE, nuclear@0: DCTSIZE2 * SIZEOF(DCTELEM)); nuclear@0: } nuclear@0: dtbl = fdct->divisors[qtblno]; nuclear@0: for (i = 0; i < DCTSIZE2; i++) { nuclear@0: dtbl[i] = ((DCTELEM) qtbl->quantval[i]) << 3; nuclear@0: } nuclear@0: break; nuclear@0: #endif nuclear@0: #ifdef DCT_IFAST_SUPPORTED nuclear@0: case JDCT_IFAST: nuclear@0: { nuclear@0: /* For AA&N IDCT method, divisors are equal to quantization nuclear@0: * coefficients scaled by scalefactor[row]*scalefactor[col], where nuclear@0: * scalefactor[0] = 1 nuclear@0: * scalefactor[k] = cos(k*PI/16) * sqrt(2) for k=1..7 nuclear@0: * We apply a further scale factor of 8. nuclear@0: */ nuclear@0: #define CONST_BITS 14 nuclear@0: static const INT16 aanscales[DCTSIZE2] = { nuclear@0: /* precomputed values scaled up by 14 bits */ nuclear@0: 16384, 22725, 21407, 19266, 16384, 12873, 8867, 4520, nuclear@0: 22725, 31521, 29692, 26722, 22725, 17855, 12299, 6270, nuclear@0: 21407, 29692, 27969, 25172, 21407, 16819, 11585, 5906, nuclear@0: 19266, 26722, 25172, 22654, 19266, 15137, 10426, 5315, nuclear@0: 16384, 22725, 21407, 19266, 16384, 12873, 8867, 4520, nuclear@0: 12873, 17855, 16819, 15137, 12873, 10114, 6967, 3552, nuclear@0: 8867, 12299, 11585, 10426, 8867, 6967, 4799, 2446, nuclear@0: 4520, 6270, 5906, 5315, 4520, 3552, 2446, 1247 nuclear@0: }; nuclear@0: SHIFT_TEMPS nuclear@0: nuclear@0: if (fdct->divisors[qtblno] == NULL) { nuclear@0: fdct->divisors[qtblno] = (DCTELEM *) nuclear@0: (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE, nuclear@0: DCTSIZE2 * SIZEOF(DCTELEM)); nuclear@0: } nuclear@0: dtbl = fdct->divisors[qtblno]; nuclear@0: for (i = 0; i < DCTSIZE2; i++) { nuclear@0: dtbl[i] = (DCTELEM) nuclear@0: DESCALE(MULTIPLY16V16((INT32) qtbl->quantval[i], nuclear@0: (INT32) aanscales[i]), nuclear@0: CONST_BITS-3); nuclear@0: } nuclear@0: } nuclear@0: break; nuclear@0: #endif nuclear@0: #ifdef DCT_FLOAT_SUPPORTED nuclear@0: case JDCT_FLOAT: nuclear@0: { nuclear@0: /* For float AA&N IDCT method, divisors are equal to quantization nuclear@0: * coefficients scaled by scalefactor[row]*scalefactor[col], where nuclear@0: * scalefactor[0] = 1 nuclear@0: * scalefactor[k] = cos(k*PI/16) * sqrt(2) for k=1..7 nuclear@0: * We apply a further scale factor of 8. nuclear@0: * What's actually stored is 1/divisor so that the inner loop can nuclear@0: * use a multiplication rather than a division. nuclear@0: */ nuclear@0: FAST_FLOAT * fdtbl; nuclear@0: int row, col; nuclear@0: static const double aanscalefactor[DCTSIZE] = { nuclear@0: 1.0, 1.387039845, 1.306562965, 1.175875602, nuclear@0: 1.0, 0.785694958, 0.541196100, 0.275899379 nuclear@0: }; nuclear@0: nuclear@0: if (fdct->float_divisors[qtblno] == NULL) { nuclear@0: fdct->float_divisors[qtblno] = (FAST_FLOAT *) nuclear@0: (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE, nuclear@0: DCTSIZE2 * SIZEOF(FAST_FLOAT)); nuclear@0: } nuclear@0: fdtbl = fdct->float_divisors[qtblno]; nuclear@0: i = 0; nuclear@0: for (row = 0; row < DCTSIZE; row++) { nuclear@0: for (col = 0; col < DCTSIZE; col++) { nuclear@0: fdtbl[i] = (FAST_FLOAT) nuclear@0: (1.0 / (((double) qtbl->quantval[i] * nuclear@0: aanscalefactor[row] * aanscalefactor[col] * 8.0))); nuclear@0: i++; nuclear@0: } nuclear@0: } nuclear@0: } nuclear@0: break; nuclear@0: #endif nuclear@0: default: nuclear@0: ERREXIT(cinfo, JERR_NOT_COMPILED); nuclear@0: break; nuclear@0: } nuclear@0: } nuclear@0: } nuclear@0: nuclear@0: nuclear@0: /* nuclear@0: * Perform forward DCT on one or more blocks of a component. nuclear@0: * nuclear@0: * The input samples are taken from the sample_data[] array starting at nuclear@0: * position start_row/start_col, and moving to the right for any additional nuclear@0: * blocks. The quantized coefficients are returned in coef_blocks[]. nuclear@0: */ nuclear@0: nuclear@0: METHODDEF(void) nuclear@0: forward_DCT (j_compress_ptr cinfo, jpeg_component_info * compptr, nuclear@0: JSAMPARRAY sample_data, JBLOCKROW coef_blocks, nuclear@0: JDIMENSION start_row, JDIMENSION start_col, nuclear@0: JDIMENSION num_blocks) nuclear@0: /* This version is used for integer DCT implementations. */ nuclear@0: { nuclear@0: /* This routine is heavily used, so it's worth coding it tightly. */ nuclear@0: my_fdct_ptr fdct = (my_fdct_ptr) cinfo->fdct; nuclear@0: forward_DCT_method_ptr do_dct = fdct->do_dct; nuclear@0: DCTELEM * divisors = fdct->divisors[compptr->quant_tbl_no]; nuclear@0: DCTELEM workspace[DCTSIZE2]; /* work area for FDCT subroutine */ nuclear@0: JDIMENSION bi; nuclear@0: nuclear@0: sample_data += start_row; /* fold in the vertical offset once */ nuclear@0: nuclear@0: for (bi = 0; bi < num_blocks; bi++, start_col += DCTSIZE) { nuclear@0: /* Load data into workspace, applying unsigned->signed conversion */ nuclear@0: { register DCTELEM *workspaceptr; nuclear@0: register JSAMPROW elemptr; nuclear@0: register int elemr; nuclear@0: nuclear@0: workspaceptr = workspace; nuclear@0: for (elemr = 0; elemr < DCTSIZE; elemr++) { nuclear@0: elemptr = sample_data[elemr] + start_col; nuclear@0: #if DCTSIZE == 8 /* unroll the inner loop */ nuclear@0: *workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE; nuclear@0: *workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE; nuclear@0: *workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE; nuclear@0: *workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE; nuclear@0: *workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE; nuclear@0: *workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE; nuclear@0: *workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE; nuclear@0: *workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE; nuclear@0: #else nuclear@0: { register int elemc; nuclear@0: for (elemc = DCTSIZE; elemc > 0; elemc--) { nuclear@0: *workspaceptr++ = GETJSAMPLE(*elemptr++) - CENTERJSAMPLE; nuclear@0: } nuclear@0: } nuclear@0: #endif nuclear@0: } nuclear@0: } nuclear@0: nuclear@0: /* Perform the DCT */ nuclear@0: (*do_dct) (workspace); nuclear@0: nuclear@0: /* Quantize/descale the coefficients, and store into coef_blocks[] */ nuclear@0: { register DCTELEM temp, qval; nuclear@0: register int i; nuclear@0: register JCOEFPTR output_ptr = coef_blocks[bi]; nuclear@0: nuclear@0: for (i = 0; i < DCTSIZE2; i++) { nuclear@0: qval = divisors[i]; nuclear@0: temp = workspace[i]; nuclear@0: /* Divide the coefficient value by qval, ensuring proper rounding. nuclear@0: * Since C does not specify the direction of rounding for negative nuclear@0: * quotients, we have to force the dividend positive for portability. nuclear@0: * nuclear@0: * In most files, at least half of the output values will be zero nuclear@0: * (at default quantization settings, more like three-quarters...) nuclear@0: * so we should ensure that this case is fast. On many machines, nuclear@0: * a comparison is enough cheaper than a divide to make a special test nuclear@0: * a win. Since both inputs will be nonnegative, we need only test nuclear@0: * for a < b to discover whether a/b is 0. nuclear@0: * If your machine's division is fast enough, define FAST_DIVIDE. nuclear@0: */ nuclear@0: #ifdef FAST_DIVIDE nuclear@0: #define DIVIDE_BY(a,b) a /= b nuclear@0: #else nuclear@0: #define DIVIDE_BY(a,b) if (a >= b) a /= b; else a = 0 nuclear@0: #endif nuclear@0: if (temp < 0) { nuclear@0: temp = -temp; nuclear@0: temp += qval>>1; /* for rounding */ nuclear@0: DIVIDE_BY(temp, qval); nuclear@0: temp = -temp; nuclear@0: } else { nuclear@0: temp += qval>>1; /* for rounding */ nuclear@0: DIVIDE_BY(temp, qval); nuclear@0: } nuclear@0: output_ptr[i] = (JCOEF) temp; nuclear@0: } nuclear@0: } nuclear@0: } nuclear@0: } nuclear@0: nuclear@0: nuclear@0: #ifdef DCT_FLOAT_SUPPORTED nuclear@0: nuclear@0: METHODDEF(void) nuclear@0: forward_DCT_float (j_compress_ptr cinfo, jpeg_component_info * compptr, nuclear@0: JSAMPARRAY sample_data, JBLOCKROW coef_blocks, nuclear@0: JDIMENSION start_row, JDIMENSION start_col, nuclear@0: JDIMENSION num_blocks) nuclear@0: /* This version is used for floating-point DCT implementations. */ nuclear@0: { nuclear@0: /* This routine is heavily used, so it's worth coding it tightly. */ nuclear@0: my_fdct_ptr fdct = (my_fdct_ptr) cinfo->fdct; nuclear@0: float_DCT_method_ptr do_dct = fdct->do_float_dct; nuclear@0: FAST_FLOAT * divisors = fdct->float_divisors[compptr->quant_tbl_no]; nuclear@0: FAST_FLOAT workspace[DCTSIZE2]; /* work area for FDCT subroutine */ nuclear@0: JDIMENSION bi; nuclear@0: nuclear@0: sample_data += start_row; /* fold in the vertical offset once */ nuclear@0: nuclear@0: for (bi = 0; bi < num_blocks; bi++, start_col += DCTSIZE) { nuclear@0: /* Load data into workspace, applying unsigned->signed conversion */ nuclear@0: { register FAST_FLOAT *workspaceptr; nuclear@0: register JSAMPROW elemptr; nuclear@0: register int elemr; nuclear@0: nuclear@0: workspaceptr = workspace; nuclear@0: for (elemr = 0; elemr < DCTSIZE; elemr++) { nuclear@0: elemptr = sample_data[elemr] + start_col; nuclear@0: #if DCTSIZE == 8 /* unroll the inner loop */ nuclear@0: *workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE); nuclear@0: *workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE); nuclear@0: *workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE); nuclear@0: *workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE); nuclear@0: *workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE); nuclear@0: *workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE); nuclear@0: *workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE); nuclear@0: *workspaceptr++ = (FAST_FLOAT)(GETJSAMPLE(*elemptr++) - CENTERJSAMPLE); nuclear@0: #else nuclear@0: { register int elemc; nuclear@0: for (elemc = DCTSIZE; elemc > 0; elemc--) { nuclear@0: *workspaceptr++ = (FAST_FLOAT) nuclear@0: (GETJSAMPLE(*elemptr++) - CENTERJSAMPLE); nuclear@0: } nuclear@0: } nuclear@0: #endif nuclear@0: } nuclear@0: } nuclear@0: nuclear@0: /* Perform the DCT */ nuclear@0: (*do_dct) (workspace); nuclear@0: nuclear@0: /* Quantize/descale the coefficients, and store into coef_blocks[] */ nuclear@0: { register FAST_FLOAT temp; nuclear@0: register int i; nuclear@0: register JCOEFPTR output_ptr = coef_blocks[bi]; nuclear@0: nuclear@0: for (i = 0; i < DCTSIZE2; i++) { nuclear@0: /* Apply the quantization and scaling factor */ nuclear@0: temp = workspace[i] * divisors[i]; nuclear@0: /* Round to nearest integer. nuclear@0: * Since C does not specify the direction of rounding for negative nuclear@0: * quotients, we have to force the dividend positive for portability. nuclear@0: * The maximum coefficient size is +-16K (for 12-bit data), so this nuclear@0: * code should work for either 16-bit or 32-bit ints. nuclear@0: */ nuclear@0: output_ptr[i] = (JCOEF) ((int) (temp + (FAST_FLOAT) 16384.5) - 16384); nuclear@0: } nuclear@0: } nuclear@0: } nuclear@0: } nuclear@0: nuclear@0: #endif /* DCT_FLOAT_SUPPORTED */ nuclear@0: nuclear@0: nuclear@0: /* nuclear@0: * Initialize FDCT manager. nuclear@0: */ nuclear@0: nuclear@0: GLOBAL(void) nuclear@0: jinit_forward_dct (j_compress_ptr cinfo) nuclear@0: { nuclear@0: my_fdct_ptr fdct; nuclear@0: int i; nuclear@0: nuclear@0: fdct = (my_fdct_ptr) nuclear@0: (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE, nuclear@0: SIZEOF(my_fdct_controller)); nuclear@0: cinfo->fdct = (struct jpeg_forward_dct *) fdct; nuclear@0: fdct->pub.start_pass = start_pass_fdctmgr; nuclear@0: nuclear@0: switch (cinfo->dct_method) { nuclear@0: #ifdef DCT_ISLOW_SUPPORTED nuclear@0: case JDCT_ISLOW: nuclear@0: fdct->pub.forward_DCT = forward_DCT; nuclear@0: fdct->do_dct = jpeg_fdct_islow; nuclear@0: break; nuclear@0: #endif nuclear@0: #ifdef DCT_IFAST_SUPPORTED nuclear@0: case JDCT_IFAST: nuclear@0: fdct->pub.forward_DCT = forward_DCT; nuclear@0: fdct->do_dct = jpeg_fdct_ifast; nuclear@0: break; nuclear@0: #endif nuclear@0: #ifdef DCT_FLOAT_SUPPORTED nuclear@0: case JDCT_FLOAT: nuclear@0: fdct->pub.forward_DCT = forward_DCT_float; nuclear@0: fdct->do_float_dct = jpeg_fdct_float; nuclear@0: break; nuclear@0: #endif nuclear@0: default: nuclear@0: ERREXIT(cinfo, JERR_NOT_COMPILED); nuclear@0: break; nuclear@0: } nuclear@0: nuclear@0: /* Mark divisor tables unallocated */ nuclear@0: for (i = 0; i < NUM_QUANT_TBLS; i++) { nuclear@0: fdct->divisors[i] = NULL; nuclear@0: #ifdef DCT_FLOAT_SUPPORTED nuclear@0: fdct->float_divisors[i] = NULL; nuclear@0: #endif nuclear@0: } nuclear@0: }