Lines Matching defs:len2
894 int len2 = len*2;
895 const double phase = M_PI/(4.0*len2);
903 double i_u = phase * (3*len2 + 2*i + 1);
904 for (int j = 0; j < len2; j++) {
975 const int len2 = s->len >> 1;
977 const int len3 = len2 * 3;
982 for (int i = 0; i < len2; i++) { /* Folding and pre-reindexing */
985 if (k < len2) {
986 tmp.re = FOLD(-src[ len2 + k], src[1*len2 - 1 - k]);
989 tmp.re = FOLD(-src[ len2 + k], -src[5*len2 - 1 - k]);
990 tmp.im = FOLD( src[-len2 + k], -src[1*len3 - 1 - k]);
1014 const int len2 = s->len >> 1;
1020 in2 = src + ((len2*2) - 1) * stride;
1022 for (int i = 0; i < len2; i++) {
1089 int len2 = len >> 1;
1098 dst[ i*stride] = -dst[(len2 - i - 1)*stride];
1099 dst[(len - i - 1)*stride] = dst[(len2 + i + 0)*stride];
1328 const int len2 = s->len >> 1; \
1339 data[0].im = data[len2].re; \
1354 t[0].re = MULT(fact[4], (data[i].re + data[len2 - i].re)); \
1355 t[0].im = MULT(fact[5], (data[i].im - data[len2 - i].im)); \
1356 t[1].re = MULT(fact[6], (data[i].im + data[len2 - i].im)); \
1357 t[1].im = MULT(fact[7], (data[i].re - data[len2 - i].re)); \
1364 data[len2 - i].re = t[0].re - t[2].re; \
1365 data[len2 - i].im = t[2].im + t[0].im; \
1372 data[len2].re = data[0].im; \