/external/jpeg/ |
jddctmgr.c | 9 * This code selects a particular IDCT implementation to be used, 11 * is executed per IDCT step, only during output pass setup. 13 * Note that the IDCT routines are responsible for performing coefficient 14 * dequantization as well as the IDCT proper. This module sets up the 15 * dequantization multiplier table needed by the IDCT routine. 59 * to a multiplier table that will actually be used by the IDCT routine. 60 * The multiplier table contents are IDCT-method-dependent. To support 61 * application changes in IDCT method between scans, we can remake the 66 * to zeroes; the result of the IDCT will be a neutral gray level. 75 /* This array contains the IDCT method code that each multiplier tabl 120 my_idct_ptr idct = (my_idct_ptr) cinfo->idct; local 308 my_idct_ptr idct; local [all...] |
Android.mk | 33 # enable armv6 idct assembly
|
jdcoefct.c | 186 /* Determine where data should go in output_buf and do the IDCT thing. 194 /* Don't bother to IDCT an uninteresting component. */ 199 inverse_DCT = cinfo->idct->inverse_DCT[compptr->component_index]; 578 /* Don't bother to IDCT an uninteresting component. */ 594 inverse_DCT = cinfo->idct->inverse_DCT[ci]; 754 /* Don't bother to IDCT an uninteresting component. */ 793 inverse_DCT = cinfo->idct->inverse_DCT[ci]; 902 /* OK, do the IDCT */ [all...] |
jdmaster.c | 144 * scale up the chroma components via IDCT scaling rather than upsampling. 166 /* Size in samples, after IDCT scaling */ 243 * limiting step (just after the IDCT), a wildly out-of-range value is 246 * post-IDCT limiting thus: 252 * For the post-IDCT step, we want to convert the data from signed to unsigned 254 * So the post-IDCT limiting table ends up looking like this: 262 * We can save some space by overlapping the start of the post-IDCT table 263 * with the simpler range limiting table. The post-IDCT table begins at 287 table += CENTERJSAMPLE; /* Point to where post-IDCT table starts */ 288 /* End of simple table, rest of first half of post-IDCT table * [all...] |
jpeglib.h | 143 * reflecting any scaling we choose to apply during the IDCT step. 145 * components may receive different IDCT scalings. 151 * and similarly for height. For decompression, IDCT scaling is included, so 177 /* Private per-component storage for DCT or IDCT subsystem. */ 219 /* DCT/IDCT algorithm options. */ 446 J_DCT_METHOD dct_method; /* IDCT algorithm selector */ 593 * rows of each component. Therefore, the IDCT output contains 634 struct jpeg_inverse_dct * idct; member in struct:jpeg_decompress_struct [all...] |
/external/qemu/distrib/jpeg-6b/ |
jddctmgr.c | 9 * This code selects a particular IDCT implementation to be used, 11 * is executed per IDCT step, only during output pass setup. 13 * Note that the IDCT routines are responsible for performing coefficient 14 * dequantization as well as the IDCT proper. This module sets up the 15 * dequantization multiplier table needed by the IDCT routine. 59 * to a multiplier table that will actually be used by the IDCT routine. 60 * The multiplier table contents are IDCT-method-dependent. To support 61 * application changes in IDCT method between scans, we can remake the 66 * to zeroes; the result of the IDCT will be a neutral gray level. 75 /* This array contains the IDCT method code that each multiplier tabl 120 my_idct_ptr idct = (my_idct_ptr) cinfo->idct; local 308 my_idct_ptr idct; local [all...] |
Android.mk | 33 # enable armv6 idct assembly
|
jdcoefct.c | 186 /* Determine where data should go in output_buf and do the IDCT thing. 194 /* Don't bother to IDCT an uninteresting component. */ 199 inverse_DCT = cinfo->idct->inverse_DCT[compptr->component_index]; 578 /* Don't bother to IDCT an uninteresting component. */ 594 inverse_DCT = cinfo->idct->inverse_DCT[ci]; 754 /* Don't bother to IDCT an uninteresting component. */ 793 inverse_DCT = cinfo->idct->inverse_DCT[ci]; 902 /* OK, do the IDCT */ [all...] |
jdmaster.c | 144 * scale up the chroma components via IDCT scaling rather than upsampling. 166 /* Size in samples, after IDCT scaling */ 243 * limiting step (just after the IDCT), a wildly out-of-range value is 246 * post-IDCT limiting thus: 252 * For the post-IDCT step, we want to convert the data from signed to unsigned 254 * So the post-IDCT limiting table ends up looking like this: 262 * We can save some space by overlapping the start of the post-IDCT table 263 * with the simpler range limiting table. The post-IDCT table begins at 287 table += CENTERJSAMPLE; /* Point to where post-IDCT table starts */ 288 /* End of simple table, rest of first half of post-IDCT table * [all...] |
jpeglib.h | 143 * reflecting any scaling we choose to apply during the IDCT step. 145 * components may receive different IDCT scalings. 151 * and similarly for height. For decompression, IDCT scaling is included, so 177 /* Private per-component storage for DCT or IDCT subsystem. */ 219 /* DCT/IDCT algorithm options. */ 446 J_DCT_METHOD dct_method; /* IDCT algorithm selector */ 593 * rows of each component. Therefore, the IDCT output contains 634 struct jpeg_inverse_dct * idct; member in struct:jpeg_decompress_struct [all...] |
/external/libvpx/vp8/common/arm/ |
arm_systemdependent.c | 19 #include "vp8/common/idct.h" 45 rtcd->idct.idct1 = vp8_short_idct4x4llm_1_v6; 46 rtcd->idct.idct16 = vp8_short_idct4x4llm_v6_dual; 47 rtcd->idct.iwalsh1 = vp8_short_inv_walsh4x4_1_v6; 48 rtcd->idct.iwalsh16 = vp8_short_inv_walsh4x4_v6; 80 rtcd->idct.idct1 = vp8_short_idct4x4llm_1_neon; 81 rtcd->idct.idct16 = vp8_short_idct4x4llm_neon; 82 rtcd->idct.iwalsh1 = vp8_short_inv_walsh4x4_1_neon; 83 rtcd->idct.iwalsh16 = vp8_short_inv_walsh4x4_neon;
|
/external/libvpx/vp8/common/generic/ |
systemdependent.c | 17 #include "vp8/common/idct.h" 28 rtcd->idct.idct1 = vp8_short_idct4x4llm_1_c; 29 rtcd->idct.idct16 = vp8_short_idct4x4llm_c; 30 rtcd->idct.idct1_scalar_add = vp8_dc_only_idct_add_c; 31 rtcd->idct.iwalsh1 = vp8_short_inv_walsh4x4_1_c; 32 rtcd->idct.iwalsh16 = vp8_short_inv_walsh4x4_c;
|
/external/libvpx/vp8/common/x86/ |
x86_systemdependent.c | 18 #include "vp8/common/idct.h" 44 rtcd->idct.idct1 = vp8_short_idct4x4llm_1_mmx; 45 rtcd->idct.idct16 = vp8_short_idct4x4llm_mmx; 46 rtcd->idct.idct1_scalar_add = vp8_dc_only_idct_add_mmx; 47 rtcd->idct.iwalsh16 = vp8_short_inv_walsh4x4_mmx; 48 rtcd->idct.iwalsh1 = vp8_short_inv_walsh4x4_1_mmx; 92 rtcd->idct.iwalsh16 = vp8_short_inv_walsh4x4_sse2;
|
/external/libvpx/vp8/encoder/ |
encodeintra.c | 13 #include "vp8/common/idct.h" 43 vp8_inverse_transform_b(IF_RTCD(&rtcd->common->idct), b, 32); 86 vp8_inverse_transform_mby(IF_RTCD(&rtcd->common->idct), &x->e_mbd); 138 vp8_inverse_transform_mbuv(IF_RTCD(&rtcd->common->idct), &x->e_mbd);
|
encodemb.c | 628 vp8_inverse_transform_mb(IF_RTCD(&rtcd->common->idct), &x->e_mbd); 646 vp8_inverse_transform_mby(IF_RTCD(&rtcd->common->idct), &x->e_mbd);
|
rdopt.c | 30 #include "vp8/common/idct.h" 662 IDCT_INVOKE(IF_RTCD(&cpi->rtcd.common->idct), idct16)(best_dqcoeff, b->diff, 32); [all...] |
/frameworks/av/media/libstagefright/codecs/m4v_h263/dec/ |
Android.mk | 21 src/idct.cpp \
|
/external/libvpx/vp8/common/ |
onyxc_int.h | 20 #include "idct.h" 72 vp8_idct_rtcd_vtable_t idct; member in struct:VP8_COMMON_RTCD
|
/frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
block_idct.cpp | 103 #include "idct.h" 135 // arrays of rows or columns and then call the idct function 258 #ifdef FAST_IDCT /* VCA IDCT using nzcoefs and bitmaps*/ 347 /* 08/04/05 compute IDCT and add prediction at the end */ 359 #ifdef FAST_IDCT /* VCA IDCT using nzcoefs and bitmaps*/ 405 void idct(int *block, uint8 *pred, uint8 *dst, int width); 406 idct(coeff_in, pred, dst, width); 524 /* row (horizontal) IDCT 635 /* row (horizontal) IDCT 842 /* column (vertical) IDCT [all...] |
idct.cpp | 24 inverse discrete cosine transform (IDCT). 32 #include "idct.h" 38 FUNCTION NAME: idct 40 INPUT AND OUTPUT DEFINITIONS FOR idct 57 blk points to the found IDCT values for an 8r8 image block. 66 FUNCTION DESCRIPTION FOR idct 70 dimensional inverse discrete cosine transform (IDCT). 80 2-D IDCT can be separated as horizontal(row-wise) and vertical(column-wise) 81 1-D IDCTs. Therefore, 2-D IDCT values are found by the following two steps: 82 1. Find horizontal 1-D IDCT values for each row from 8r8 dequantized DC 344 void idct( function [all...] |
/external/libvpx/vp8/decoder/ |
decodframe.c | 31 #include "vp8/common/idct.h" 228 /* dequantization and idct */ 237 IDCT_INVOKE(RTCD_VTABLE(idct), iwalsh16)(&b->dqcoeff[0], b->diff); 249 IDCT_INVOKE(RTCD_VTABLE(idct), iwalsh1)(&b->dqcoeff[0], b->diff); 274 IDCT_INVOKE(RTCD_VTABLE(idct), idct1_scalar_add)
|
threading.c | 150 /* dequantization and idct */ 159 IDCT_INVOKE(RTCD_VTABLE(idct), iwalsh16)(&b->dqcoeff[0], b->diff); 171 IDCT_INVOKE(RTCD_VTABLE(idct), iwalsh1)(&b->dqcoeff[0], b->diff); 195 IDCT_INVOKE(RTCD_VTABLE(idct), idct1_scalar_add) [all...] |
/external/libvpx/vp8/decoder/arm/neon/ |
idct_dequant_dc_full_2x_neon.asm | 114 ; idct loop 2
|
idct_dequant_full_2x_neon.asm | 106 ; idct loop 2
|
/external/libvpx/vp8/ |
vp8_common.mk | 42 VP8_COMMON_SRCS-yes += common/idct.h
|