Searched refs:split_radix_permutation (Results 1 - 3 of 3) sorted by relevance
| /asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/ffmpeg/libavcodec/ |
| H A D | fft.c | 56 static int split_radix_permutation(int i, int n, int inverse) function
61 if(!(i&m)) return split_radix_permutation(i, m, inverse)*2;
63 if(inverse == !(i&m)) return split_radix_permutation(i, m, inverse)*4 + 1;
64 else return split_radix_permutation(i, m, inverse)*4 - 1;
122 s->revtab[-split_radix_permutation(i, n, s->inverse) & (n-1)] = i;
|
| /asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/ffmpeg/libavcodec/ |
| H A D | fft.c | 56 static int split_radix_permutation(int i, int n, int inverse) function
61 if(!(i&m)) return split_radix_permutation(i, m, inverse)*2;
63 if(inverse == !(i&m)) return split_radix_permutation(i, m, inverse)*4 + 1;
64 else return split_radix_permutation(i, m, inverse)*4 - 1;
122 s->revtab[-split_radix_permutation(i, n, s->inverse) & (n-1)] = i;
|
| /asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/ffmpeg/libavcodec/ |
| H A D | fft.c | 56 static int split_radix_permutation(int i, int n, int inverse) function
61 if(!(i&m)) return split_radix_permutation(i, m, inverse)*2;
63 if(inverse == !(i&m)) return split_radix_permutation(i, m, inverse)*4 + 1;
64 else return split_radix_permutation(i, m, inverse)*4 - 1;
122 s->revtab[-split_radix_permutation(i, n, s->inverse) & (n-1)] = i;
|
Completed in 116 milliseconds