| /external/mesa3d/src/gallium/auxiliary/vl/ |
| vl_idct.c | 143 create_mismatch_vert_shader(struct vl_idct *idct)
175 (float)VL_BLOCK_WIDTH / idct->buffer_width,
176 (float)VL_BLOCK_HEIGHT / idct->buffer_height);
182 calc_addr(shader, o_addr, ureg_src(t_tex), ureg_src(t_tex), false, false, idct->buffer_width / 4);
188 return ureg_create_shader_and_destroy(shader, idct->pipe);
192 create_mismatch_frag_shader(struct vl_idct *idct)
218 increment_addr(shader, m[i], addr, false, false, i, idct->buffer_height);
255 return ureg_create_shader_and_destroy(shader, idct->pipe);
259 create_stage1_vert_shader(struct vl_idct *idct)
298 (float)VL_BLOCK_WIDTH / idct->buffer_width
[all...] |
| vl_idct.h | 78 /* upload the idct matrix, which can be shared by all idct instances of a pipe */
83 vl_idct_stage2_vert_shader(struct vl_idct *idct, struct ureg_program *shader,
87 vl_idct_stage2_frag_shader(struct vl_idct *idct, struct ureg_program *shader,
90 /* init an idct instance */
92 vl_idct_init(struct vl_idct *idct, struct pipe_context *pipe,
98 /* destroy an idct instance */
100 vl_idct_cleanup(struct vl_idct *idct);
102 /* init a buffer assosiated with agiven idct instance */
104 vl_idct_init_buffer(struct vl_idct *idct, struct vl_idct_buffer *buffer
[all...] |
| vl_mpeg12_decoder.h | 93 struct vl_idct_buffer idct[VL_NUM_COMPONENTS]; member in struct:vl_mpeg12_buffer
|
| vl_mpeg12_decoder.c | 178 &buffer->idct[i], idct_source_sv[i],
186 vl_idct_cleanup_buffer(&buffer->idct[i - 1]);
201 vl_idct_cleanup_buffer(&buf->idct[0]);
733 vl_idct_flush(i ? &dec->idct_c : &dec->idct_y, &buf->idct[i], buf->num_ycbcr_blocks[i]);
750 vl_idct_prepare_stage2(i ? &dec->idct_c : &dec->idct_y, &buf->idct[plane]);
992 struct vl_idct *idct = mc == &dec->mc_y ? &dec->idct_y : &dec->idct_c; local
993 vl_idct_stage2_vert_shader(idct, shader, first_output, tex);
1013 struct vl_idct *idct = mc == &dec->mc_y ? &dec->idct_y : &dec->idct_c; local
[all...] |
| /external/libjpeg-turbo/ |
| jddctmgr.c | 14 * This code selects a particular IDCT implementation to be used,
16 * is executed per IDCT step, only during output pass setup.
18 * Note that the IDCT routines are responsible for performing coefficient
19 * dequantization as well as the IDCT proper. This module sets up the
20 * dequantization multiplier table needed by the IDCT routine.
37 * to a multiplier table that will actually be used by the IDCT routine.
38 * The multiplier table contents are IDCT-method-dependent. To support
39 * application changes in IDCT method between scans, we can remake the
44 * to zeroes; the result of the IDCT will be a neutral gray level.
53 /* This array contains the IDCT method code that each multiplier tabl
98 my_idct_ptr idct = (my_idct_ptr) cinfo->idct; local
331 my_idct_ptr idct; local
[all...] |
| jdcoefct.c | 112 /* Only perform the IDCT on blocks that are contained within the desired
117 /* Determine where data should go in output_buf and do the IDCT thing.
125 /* Don't bother to IDCT an uninteresting component. */
130 inverse_DCT = cinfo->idct->inverse_DCT[compptr->component_index];
285 /* Don't bother to IDCT an uninteresting component. */
301 inverse_DCT = cinfo->idct->inverse_DCT[ci];
451 /* Don't bother to IDCT an uninteresting component. */
490 inverse_DCT = cinfo->idct->inverse_DCT[ci];
600 /* OK, do the IDCT */
|
| jdmaster.c | 277 * scale up the chroma components via IDCT scaling rather than upsampling.
303 /* Size in samples, after IDCT scaling */
383 * limiting step (just after the IDCT), a wildly out-of-range value is
386 * post-IDCT limiting thus:
392 * For the post-IDCT step, we want to convert the data from signed to unsigned
394 * So the post-IDCT limiting table ends up looking like this:
402 * We can save some space by overlapping the start of the post-IDCT table
403 * with the simpler range limiting table. The post-IDCT table begins at
424 table += CENTERJSAMPLE; /* Point to where post-IDCT table starts */
425 /* End of simple table, rest of first half of post-IDCT table *
[all...] |
| jpeglib.h | 145 * reflecting any scaling we choose to apply during the IDCT step.
147 * Note that different components may receive different IDCT scalings.
158 * and similarly for height. For decompression, IDCT scaling is included, so
184 /* Private per-component storage for DCT or IDCT subsystem. */
243 /* DCT/IDCT algorithm options. */
499 J_DCT_METHOD dct_method; /* IDCT algorithm selector */
653 * rows of each component. Therefore, the IDCT output contains
702 struct jpeg_inverse_dct * idct; member in struct:jpeg_decompress_struct
[all...] |
| /external/pdfium/third_party/libjpeg/ |
| fpdfapi_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.
30 * to a multiplier table that will actually be used by the IDCT routine.
31 * The multiplier table contents are IDCT-method-dependent. To support
32 * application changes in IDCT method between scans, we can remake the
37 * to zeroes; the result of the IDCT will be a neutral gray level.
46 /* This array contains the IDCT method code that each multiplier tabl
91 my_idct_ptr idct = (my_idct_ptr) cinfo->idct; local
249 my_idct_ptr idct; local
[all...] |
| fpdfapi_jdcoefct.c | 173 /* Determine where data should go in output_buf and do the IDCT thing.
181 /* Don't bother to IDCT an uninteresting component. */
186 inverse_DCT = cinfo->idct->inverse_DCT[compptr->component_index];
339 /* Don't bother to IDCT an uninteresting component. */
355 inverse_DCT = cinfo->idct->inverse_DCT[ci];
501 /* Don't bother to IDCT an uninteresting component. */
540 inverse_DCT = cinfo->idct->inverse_DCT[ci];
649 /* OK, do the IDCT */
|
| fpdfapi_jdmaster.c | 127 * scale up the chroma components via IDCT scaling rather than upsampling.
149 /* Size in samples, after IDCT scaling */
220 * limiting step (just after the IDCT), a wildly out-of-range value is
223 * post-IDCT limiting thus:
229 * For the post-IDCT step, we want to convert the data from signed to unsigned
231 * So the post-IDCT limiting table ends up looking like this:
239 * We can save some space by overlapping the start of the post-IDCT table
240 * with the simpler range limiting table. The post-IDCT table begins at
264 table += CENTERJSAMPLE; /* Point to where post-IDCT table starts */
265 /* End of simple table, rest of first half of post-IDCT table *
[all...] |
| /external/opencv3/3rdparty/include/ffmpeg_/libavcodec/ |
| xvmc.h | 42 the number is 1337 speak for the letters IDCT MCo (motion compensation) */
56 pixel information (in MoCo mode) or coefficients for IDCT.
82 /** Indicate that the hardware would interpret data_blocks as IDCT
83 coefficients and perform IDCT on them.
87 int idct; member in struct:xvmc_pix_fmt
|
| /external/opencv3/3rdparty/libjpeg/ |
| jddctmgr.c | 10 * This code selects a particular IDCT implementation to be used,
12 * is executed per IDCT step, only during output pass setup.
14 * Note that the IDCT routines are responsible for performing coefficient
15 * dequantization as well as the IDCT proper. This module sets up the
16 * dequantization multiplier table needed by the IDCT routine.
31 * to a multiplier table that will actually be used by the IDCT routine.
32 * The multiplier table contents are IDCT-method-dependent. To support
33 * application changes in IDCT method between scans, we can remake the
38 * to zeroes; the result of the IDCT will be a neutral gray level.
47 /* This array contains the IDCT method code that each multiplier tabl
92 my_idct_ptr idct = (my_idct_ptr) cinfo->idct; local
364 my_idct_ptr idct; local
[all...] |
| jdcoefct.c | 175 /* Determine where data should go in output_buf and do the IDCT thing.
183 /* Don't bother to IDCT an uninteresting component. */
188 inverse_DCT = cinfo->idct->inverse_DCT[compptr->component_index];
341 /* Don't bother to IDCT an uninteresting component. */
357 inverse_DCT = cinfo->idct->inverse_DCT[ci];
503 /* Don't bother to IDCT an uninteresting component. */
542 inverse_DCT = cinfo->idct->inverse_DCT[ci];
651 /* OK, do the IDCT */
|
| jdmaster.c | 108 * scale up the chroma components via IDCT scaling rather than upsampling.
129 /* We don't support IDCT ratios larger than 2. */
141 /* Size in samples, after IDCT scaling */
201 * limiting step (just after the IDCT), a wildly out-of-range value is
204 * post-IDCT limiting thus:
210 * For the post-IDCT step, we want to convert the data from signed to unsigned
212 * So the post-IDCT limiting table ends up looking like this:
220 * We can save some space by overlapping the start of the post-IDCT table
221 * with the simpler range limiting table. The post-IDCT table begins at
245 table += CENTERJSAMPLE; /* Point to where post-IDCT table starts *
[all...] |
| jpeglib.h | 186 /* Private per-component storage for DCT or IDCT subsystem. */
231 /* DCT/IDCT algorithm options. */
480 J_DCT_METHOD dct_method; /* IDCT algorithm selector */
631 * rows of each component. Therefore, the IDCT output contains
678 struct jpeg_inverse_dct * idct; member in struct:jpeg_decompress_struct
[all...] |
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/ |
| Android.mk | 21 src/idct.cpp \
|
| /external/libgdx/gdx/jni/gdx2d/ |
| jpgd.cpp | 77 // Compiler creates a fast path 1D IDCT for X non-zero columns
81 static void idct(int* pTemp, const jpgd_block_t* pSrc) function in struct:jpgd::Row
126 static void idct(int* pTemp, const jpgd_block_t* pSrc) function in struct:jpgd::Row
137 static void idct(int* pTemp, const jpgd_block_t* pSrc) function in struct:jpgd::Row
152 // Compiler creates a fast path 1D IDCT for X non-zero rows
156 static void idct(uint8* pDst_ptr, const int* pTemp) function in struct:jpgd::Col
217 static void idct(uint8* pDst_ptr, const int* pTemp) function in struct:jpgd::Col
246 void idct(const jpgd_block_t* pSrc_ptr, uint8* pDst_ptr, int block_max_zag) function in namespace:jpgd
278 case 0: Row<0>::idct(pTemp, pSrc); break;
279 case 1: Row<1>::idct(pTemp, pSrc); break
[all...] |
| /external/libvpx/libvpx/vpx_dsp/arm/ |
| idct32x32_1_add_neon.asm | 18 ;file so other idct function could also use them.
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/arm/neon/ |
| vp9_idct32x32_1_add_neon.asm | 18 ;file so other idct function could also use them.
|
| /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...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/arm/neon/ |
| idct_dequant_full_2x_neon.asm | 104 ; idct loop 2
|
| /external/opencv3/modules/java/src/ |
| core+Core.java | 2124 public static void idct(Mat src, Mat dst, int flags) method in class:Core
2133 public static void idct(Mat src, Mat dst) method in class:Core
[all...] |
| /external/opencv3/modules/core/include/opencv2/ |
| core.hpp | [all...] |
