Lines Matching defs:fft_len
262 int fft_len, k, x, y;
273 fft_len = 1 << s->fft_bits;
280 s->fft_data = av_malloc_array(fft_len, sizeof(*s->fft_data));
281 s->coeff_sort = av_malloc_array(fft_len, sizeof(*s->coeff_sort));
282 s->fft_result_left = av_malloc_array(fft_len, sizeof(*s->fft_result_left));
283 s->fft_result_right = av_malloc_array(fft_len, sizeof(*s->fft_result_right));
311 int hlen = fft_len >> 1;
330 s->fft_data[hlen].re = (1.0 + a1 + a2 + a3) * (1.0/tlen) * s->volume * (1.0/fft_len);
344 w = (1.0 + a1 * cw + a2 * cw2 + a3 * cw3) * (1.0/tlen) * s->volume * (1.0/fft_len);
366 for (x = 0; x < fft_len; x++) {
371 AV_QSORT(s->coeff_sort, fft_len, SparseCoeff, qsort_sparsecoeff);
372 for (x = 0; x < fft_len; x++)
375 for (x = 0; x < fft_len; x++) {
378 s->coeffs_len[k] = fft_len - x;
390 av_log(ctx, AV_LOG_INFO, "Elapsed time %.6f s (fft_len=%u, num_coeffs=%u)\n", 1e-6 * (end_time-start_time), fft_len, num_coeffs);
399 s->remaining_fill = fft_len >> 1;
400 memset(s->fft_data, 0, fft_len * sizeof(*s->fft_data));
421 int fft_len = 1 << s->fft_bits;
432 memcpy(s->fft_result_left, s->fft_data, fft_len * sizeof(*s->fft_data));
441 for (x = 1; x <= fft_len >> 1; x++) {
442 FFTSample tmpy = s->fft_result_left[fft_len-x].im - s->fft_result_left[x].im;
444 s->fft_result_right[x].re = s->fft_result_left[x].im + s->fft_result_left[fft_len-x].im;
445 s->fft_result_right[x].im = s->fft_result_left[x].re - s->fft_result_left[fft_len-x].re;
446 s->fft_result_right[fft_len-x].re = s->fft_result_right[x].re;
447 s->fft_result_right[fft_len-x].im = -s->fft_result_right[x].im;
449 s->fft_result_left[x].re = s->fft_result_left[x].re + s->fft_result_left[fft_len-x].re;
451 s->fft_result_left[fft_len-x].re = s->fft_result_left[x].re;
452 s->fft_result_left[fft_len-x].im = -s->fft_result_left[x].im;
597 int fft_len = 1 << s->fft_bits;
602 while (s->remaining_fill < (fft_len >> 1)) {
604 memset(&s->fft_data[fft_len - s->remaining_fill], 0, sizeof(*s->fft_data) * s->remaining_fill);
608 for (x = 0; x < (fft_len-step); x++)
621 int j = fft_len - s->remaining_fill;
633 for (m = 0; m < fft_len-step; m++)
638 int j = fft_len - s->remaining_fill;