| /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/pdfium/core/src/fxcodec/libjpeg/ |
| fpdfapi_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
250 my_idct_ptr idct; local
[all...] |
| fpdfapi_jdcoefct.c | 174 /* Determine where data should go in output_buf and do the IDCT thing.
182 /* Don't bother to IDCT an uninteresting component. */
187 inverse_DCT = cinfo->idct->inverse_DCT[compptr->component_index];
340 /* Don't bother to IDCT an uninteresting component. */
356 inverse_DCT = cinfo->idct->inverse_DCT[ci];
502 /* Don't bother to IDCT an uninteresting component. */
541 inverse_DCT = cinfo->idct->inverse_DCT[ci];
650 /* OK, do the IDCT */
|
| fpdfapi_jdmaster.c | 128 * scale up the chroma components via IDCT scaling rather than upsampling.
150 /* Size in samples, after IDCT scaling */
221 * limiting step (just after the IDCT), a wildly out-of-range value is
224 * post-IDCT limiting thus:
230 * For the post-IDCT step, we want to convert the data from signed to unsigned
232 * So the post-IDCT limiting table ends up looking like this:
240 * We can save some space by overlapping the start of the post-IDCT table
241 * with the simpler range limiting table. The post-IDCT table begins at
265 table += CENTERJSAMPLE; /* Point to where post-IDCT table starts */
266 /* End of simple table, rest of first half of post-IDCT table *
[all...] |
| jpeglib.h | 210 * reflecting any scaling we choose to apply during the IDCT step.
212 * components may receive different IDCT scalings.
218 * and similarly for height. For decompression, IDCT scaling is included, so
244 /* Private per-component storage for DCT or IDCT subsystem. */
282 /* DCT/IDCT algorithm options. */
506 J_DCT_METHOD dct_method; /* IDCT algorithm selector */
652 * rows of each component. Therefore, the IDCT output contains
693 struct jpeg_inverse_dct * idct; member in struct:jpeg_decompress_struct
[all...] |
| /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.
62 * to a multiplier table that will actually be used by the IDCT routine.
63 * The multiplier table contents are IDCT-method-dependent. To support
64 * application changes in IDCT method between scans, we can remake the
69 * to zeroes; the result of the IDCT will be a neutral gray level.
78 /* This array contains the IDCT method code that each multiplier tabl
123 my_idct_ptr idct = (my_idct_ptr) cinfo->idct; local
351 my_idct_ptr idct; local
[all...] |
| Android.mk | 46 # enable armv6 idct assembly
51 # use mips assembler IDCT implementation if MIPS DSP-ASE is present
|
| 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...] |
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/ |
| Android.mk | 21 src/idct.cpp \
|
| /external/libvpx/libvpx/vp9/common/arm/neon/ |
| vp9_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...] |
| /external/libvpx/libvpx/vp8/common/arm/neon/ |
| idct_dequant_full_2x_neon.asm | 106 ; idct loop 2
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/arm/neon/ |
| idct_dequant_full_2x_neon.asm | 104 ; idct loop 2
|
| /external/pdfium/core/include/thirdparties/libjpeg/ |
| jpeglib.h | 210 * reflecting any scaling we choose to apply during the IDCT step.
212 * components may receive different IDCT scalings.
218 * and similarly for height. For decompression, IDCT scaling is included, so
244 /* Private per-component storage for DCT or IDCT subsystem. */
282 /* DCT/IDCT algorithm options. */
506 J_DCT_METHOD dct_method; /* IDCT algorithm selector */
652 * rows of each component. Therefore, the IDCT output contains
693 struct jpeg_inverse_dct * idct; member in struct:jpeg_decompress_struct
[all...] |
| /cts/apps/CtsVerifier/libs/ |
| opencv-android.jar | |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jar | |
| org.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jar | |
| /prebuilts/tools/common/m2/repository/com/android/external/eclipse/swt/3.5.0/ |
| swt-3.5.0.jar | |
