# HG changeset patch # User mru # Date 1278026506 0 # Node ID a2e5b142776bfa426c6777f6f7b040438366e151 # Parent c80c7a7171569686f75ae8a0afdef6e49a005695 Indent diff -r c80c7a717156 -r a2e5b142776b fft.c --- a/fft.c Thu Jul 01 23:21:42 2010 +0000 +++ b/fft.c Thu Jul 01 23:21:46 2010 +0000 @@ -107,11 +107,11 @@ if (HAVE_ALTIVEC) ff_fft_init_altivec(s); if (HAVE_MMX) ff_fft_init_mmx(s); - for(j=4; j<=nbits; j++) { - ff_init_ff_cos_tabs(j); - } - for(i=0; irevtab[-split_radix_permutation(i, n, s->inverse) & (n-1)] = i; + for(j=4; j<=nbits; j++) { + ff_init_ff_cos_tabs(j); + } + for(i=0; irevtab[-split_radix_permutation(i, n, s->inverse) & (n-1)] = i; return 0; fail: @@ -125,9 +125,9 @@ int j, np; const uint16_t *revtab = s->revtab; np = 1 << s->nbits; - /* TODO: handle split-radix permute in a more optimal way, probably in-place */ - for(j=0;jtmp_buf[revtab[j]] = z[j]; - memcpy(z, s->tmp_buf, np * sizeof(FFTComplex)); + /* TODO: handle split-radix permute in a more optimal way, probably in-place */ + for(j=0;jtmp_buf[revtab[j]] = z[j]; + memcpy(z, s->tmp_buf, np * sizeof(FFTComplex)); } av_cold void ff_fft_end(FFTContext *s)