| /external/chromium_org/third_party/mesa/src/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/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/chromium_org/third_party/libjpeg_turbo/ |
| jddctmgr.c | 13 * This code selects a particular IDCT implementation to be used,
15 * is executed per IDCT step, only during output pass setup.
17 * Note that the IDCT routines are responsible for performing coefficient
18 * dequantization as well as the IDCT proper. This module sets up the
19 * dequantization multiplier table needed by the IDCT routine.
36 * to a multiplier table that will actually be used by the IDCT routine.
37 * The multiplier table contents are IDCT-method-dependent. To support
38 * application changes in IDCT method between scans, we can remake the
43 * to zeroes; the result of the IDCT will be a neutral gray level.
52 /* This array contains the IDCT method code that each multiplier tabl
97 my_idct_ptr idct = (my_idct_ptr) cinfo->idct; local
318 my_idct_ptr idct; local
[all...] |
| jdcoefct.c | 179 /* Determine where data should go in output_buf and do the IDCT thing.
187 /* Don't bother to IDCT an uninteresting component. */
192 inverse_DCT = cinfo->idct->inverse_DCT[compptr->component_index];
345 /* Don't bother to IDCT an uninteresting component. */
361 inverse_DCT = cinfo->idct->inverse_DCT[ci];
510 /* Don't bother to IDCT an uninteresting component. */
549 inverse_DCT = cinfo->idct->inverse_DCT[ci];
658 /* OK, do the IDCT */
|
| jdmaster.c | 287 * scale up the chroma components via IDCT scaling rather than upsampling.
313 /* Size in samples, after IDCT scaling */
392 * limiting step (just after the IDCT), a wildly out-of-range value is
395 * post-IDCT limiting thus:
401 * For the post-IDCT step, we want to convert the data from signed to unsigned
403 * So the post-IDCT limiting table ends up looking like this:
411 * We can save some space by overlapping the start of the post-IDCT table
412 * with the simpler range limiting table. The post-IDCT table begins at
436 table += CENTERJSAMPLE; /* Point to where post-IDCT table starts */
437 /* End of simple table, rest of first half of post-IDCT table *
[all...] |
| jpeglib.h | 150 * reflecting any scaling we choose to apply during the IDCT step.
152 * components may receive different IDCT scalings.
163 * and similarly for height. For decompression, IDCT scaling is included, so
189 /* Private per-component storage for DCT or IDCT subsystem. */
248 /* DCT/IDCT algorithm options. */
504 J_DCT_METHOD dct_method; /* IDCT algorithm selector */
658 * rows of each component. Therefore, the IDCT output contains
707 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.
74 * to a multiplier table that will actually be used by the IDCT routine.
75 * The multiplier table contents are IDCT-method-dependent. To support
76 * application changes in IDCT method between scans, we can remake the
81 * to zeroes; the result of the IDCT will be a neutral gray level.
90 /* This array contains the IDCT method code that each multiplier tabl
135 my_idct_ptr idct = (my_idct_ptr) cinfo->idct; local
363 my_idct_ptr idct; local
[all...] |
| Android.mk | 51 # enable armv6 idct assembly
56 # 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...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/arm/neon/ |
| vp9_idct32x32_1_add_neon.asm | 18 ;file so other idct function could also use them.
|
| /external/libvpx/libvpx/vp9/common/arm/neon/ |
| vp9_idct32x32_1_add_neon.asm | 18 ;file so other idct function could also use them.
|
| /external/libvpx/libvpx/vp8/common/arm/neon/ |
| idct_dequant_full_2x_neon.asm | 104 ; idct loop 2
|
| /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 | |
