| /external/libopus/celt/ |
| D | pitch.h | 63 opus_val16 y_0, y_1, y_2, y_3; in xcorr_kernel() local
66 y_0=*y++; in xcorr_kernel()
74 sum[0] = MAC16_16(sum[0],tmp,y_0); in xcorr_kernel()
79 y_0=*y++; in xcorr_kernel()
83 sum[3] = MAC16_16(sum[3],tmp,y_0); in xcorr_kernel()
88 sum[2] = MAC16_16(sum[2],tmp,y_0); in xcorr_kernel()
93 sum[1] = MAC16_16(sum[1],tmp,y_0); in xcorr_kernel()
101 sum[0] = MAC16_16(sum[0],tmp,y_0); in xcorr_kernel()
109 y_0=*y++; in xcorr_kernel()
113 sum[3] = MAC16_16(sum[3],tmp,y_0); in xcorr_kernel()
[all …]
|
| /external/libopus/celt/arm/ |
| D | celt_pitch_xcorr_arm.s | 55 ; d3 = y_3|y_2|y_1|y_0
283 SMLABB r6, r12, r10, r6 ; sum[0] = MAC16_16(sum[0],x_0,y_0)
311 SMLABB r6, r12, r10, r6 ; sum[0] = MAC16_16(sum[0],x,y_0)
377 SMLABT r14, r6, r8, r14 ; sum = MAC16_16(sum, x_0, y_0)
446 SMLABB r10, r6, r8, r10 ; sum0 = MAC16_16(sum0, x_0, y_0)
465 SMLABB r10, r6, r8, r10 ; sum0 = MAC16_16(sum0, x_0, y_0)
476 SMLABB r10, r6, r8, r10 ; sum0 = MAC16_16(sum0, x_0, y_0)
511 SMLABB r14, r6, r8, r14 ; sum = MAC16_16(sum, x_0, y_0)
526 SMLABBGE r14, r6, r8, r14 ; sum = MAC16_16(sum, x_0, y_0)
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/raw/ |
| D | Nat192.java | 273 long y_0 = y[0] & M; in mul() local
282 c += x_0 * y_0; in mul()
306 c += x_i * y_0 + (zz[i + 0] & M); in mul()
330 long y_0 = y[yOff + 0] & M; in mul() local
339 c += x_0 * y_0; in mul()
364 c += x_i * y_0 + (zz[zzOff + 0] & M); in mul()
388 long y_0 = y[0] & M; in mulAddTo() local
399 c += x_i * y_0 + (zz[i + 0] & M); in mulAddTo()
426 long y_0 = y[yOff + 0] & M; in mulAddTo() local
437 c += x_i * y_0 + (zz[zzOff + 0] & M); in mulAddTo()
|
| D | Nat224.java | 344 long y_0 = y[0] & M; in mul() local
354 c += x_0 * y_0; in mul()
381 c += x_i * y_0 + (zz[i + 0] & M); in mul()
408 long y_0 = y[yOff + 0] & M; in mul() local
418 c += x_0 * y_0; in mul()
446 c += x_i * y_0 + (zz[zzOff + 0] & M); in mul()
473 long y_0 = y[0] & M; in mulAddTo() local
485 c += x_i * y_0 + (zz[i + 0] & M); in mulAddTo()
515 long y_0 = y[yOff + 0] & M; in mulAddTo() local
527 c += x_i * y_0 + (zz[zzOff + 0] & M); in mulAddTo()
|
| D | Nat256.java | 367 long y_0 = y[0] & M; in mul() local
378 c += x_0 * y_0; in mul()
408 c += x_i * y_0 + (zz[i + 0] & M); in mul()
438 long y_0 = y[yOff + 0] & M; in mul() local
449 c += x_0 * y_0; in mul()
480 c += x_i * y_0 + (zz[zzOff + 0] & M); in mul()
510 long y_0 = y[0] & M; in mulAddTo() local
523 c += x_i * y_0 + (zz[i + 0] & M); in mulAddTo()
556 long y_0 = y[yOff + 0] & M; in mulAddTo() local
569 c += x_i * y_0 + (zz[zzOff + 0] & M); in mulAddTo()
|
| /external/libvpx/libvpx/vp8/common/ |
| D | postproc.c | 675 static void constrain_line (int x_0, int *x_1, int y_0, int *y_1, int width, int height) in constrain_line() argument
683 dy = *y_1 - y_0; in constrain_line()
687 *y_1 = ((width-x_0)*dy)/dx + y_0; in constrain_line()
692 dy = *y_1 - y_0; in constrain_line()
696 *y_1 = ((0-x_0)*dy)/dx + y_0; in constrain_line()
701 dy = *y_1 - y_0; in constrain_line()
705 *x_1 = ((height-y_0)*dx)/dy + x_0; in constrain_line()
710 dy = *y_1 - y_0; in constrain_line()
714 *x_1 = ((0-y_0)*dx)/dy + x_0; in constrain_line()
|
| /external/eigen/Eigen/src/Core/arch/AltiVec/ |
| D | PacketMath.h | 218 Packet4f t, y_0, y_1, res;
221 y_0 = vec_re(b);
224 t = vec_nmsub(y_0, b, p4f_ONE);
225 y_1 = vec_madd(y_0, t, y_0);
|
| /external/webp/src/enc/ |
| D | picture_psnr.c | 32 const int y_0 = (y - RADIUS < 0) ? 0 : y - RADIUS; in AccumulateLSIM() local
40 for (j = y_0; j < y_1; ++j) { in AccumulateLSIM()
|
| /external/libvpx/libvpx/vp8/encoder/ |
| D | mcomp.c | 241 … unsigned char *y_0 = base_pre + d->offset + (bestmv->as_mv.row) * pre_stride + bestmv->as_mv.col; in vp8_find_best_sub_pixel_step_iteratively() local
252 … vfp->copymem(y_0 - buf_c1 - pre_stride*buf_r1, pre_stride, xd->y_buf, y_stride, 16+buf_r1+buf_r2); in vp8_find_best_sub_pixel_step_iteratively()
383 … unsigned char *y_0 = base_pre + d->offset + (bestmv->as_mv.row) * pre_stride + bestmv->as_mv.col; in vp8_find_best_sub_pixel_step() local
388 vfp->copymem(y_0 - 1 - pre_stride, pre_stride, xd->y_buf, y_stride, 18); in vp8_find_best_sub_pixel_step()
694 … unsigned char *y_0 = base_pre + d->offset + (bestmv->as_mv.row) * pre_stride + bestmv->as_mv.col; in vp8_find_best_half_pixel_step() local
699 vfp->copymem(y_0 - 1 - pre_stride, pre_stride, xd->y_buf, y_stride, 18); in vp8_find_best_half_pixel_step()
|
| /external/libvorbis/doc/ |
| D | 07-floor1.tex | 27 from x_0,y_0 to x_1,y_1 where in the base case x_0=0 and x_1=[n], the
36 x_0,y_0 to x_new,y_new and from x_new,y_new to x_1,y_1. This step is
|
| /external/eigen/unsupported/Eigen/ |
| D | MatrixFunctions | 125 initial condition \f$ y(0) = y_0 \f$ is given by
126 \f$ y(t) = \exp(M) y_0 \f$.
|