Lines Matching defs:stride
86 static void celt_exp_rotation_impl(float *X, uint32_t len, uint32_t stride,
93 for (i = 0; i < len - stride; i++) {
95 float x2 = Xptr[stride];
96 Xptr[stride] = c * x2 + s * x1;
100 Xptr = &X[len - 2 * stride - 1];
101 for (i = len - 2 * stride - 1; i >= 0; i--) {
103 float x2 = Xptr[stride];
104 Xptr[stride] = c * x2 + s * x1;
110 uint32_t stride, uint32_t K,
127 if (len >= stride << 3) {
129 /* This is just a simple (equivalent) way of computing sqrt(len/stride) with rounding.
130 It's basically incrementing long as (stride2+0.5)^2 < len/stride. */
131 while ((stride2 * stride2 + stride2) * stride + (stride >> 2) < len)
135 len /= stride;
136 for (i = 0; i < stride; i++) {
202 int stride, int hadamard)
204 int i, j, N = N0*stride;
205 const uint8_t *order = &ff_celt_hadamard_order[hadamard ? stride - 2 : 30];
207 for (i = 0; i < stride; i++)
209 tmp[j*stride+i] = X[order[i]*N0+j];
215 int stride, int hadamard)
217 int i, j, N = N0*stride;
218 const uint8_t *order = &ff_celt_hadamard_order[hadamard ? stride - 2 : 30];
220 for (i = 0; i < stride; i++)
222 tmp[order[i]*N0+j] = X[j*stride+i];
227 static void celt_haar1(float *X, int N0, int stride)
231 for (i = 0; i < stride; i++) {
233 float x0 = X[stride * (2 * j + 0) + i];
234 float x1 = X[stride * (2 * j + 1) + i];
235 X[stride * (2 * j + 0) + i] = (x0 + x1) * M_SQRT1_2;
236 X[stride * (2 * j + 1) + i] = (x0 - x1) * M_SQRT1_2;