Searched refs:split_radix_permutation (Results 1 - 2 of 2) sorted by relevance
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavcodec/ |
H A D | fft.c | 71 static int split_radix_permutation(int i, int n, int inverse) function 76 if(!(i&m)) return split_radix_permutation(i, m, inverse)*2; 78 if(inverse == !(i&m)) return split_radix_permutation(i, m, inverse)*4 + 1; 79 else return split_radix_permutation(i, m, inverse)*4 - 1; 121 s->revtab[-split_radix_permutation(i + k, n, s->inverse) & (n - 1)] = 128 s->revtab[-split_radix_permutation(i + k, n, s->inverse) & (n - 1)] = j; 181 s->revtab[-split_radix_permutation(i, n, s->inverse) & (n-1)] = j;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavcodec/ |
H A D | fft_template.c | 77 static int split_radix_permutation(int i, int n, int inverse) function 82 if(!(i&m)) return split_radix_permutation(i, m, inverse)*2; 84 if(inverse == !(i&m)) return split_radix_permutation(i, m, inverse)*4 + 1; 85 else return split_radix_permutation(i, m, inverse)*4 - 1; 127 s->revtab[-split_radix_permutation(i + k, n, s->inverse) & (n - 1)] = 134 s->revtab[-split_radix_permutation(i + k, n, s->inverse) & (n - 1)] = j; 196 s->revtab[-split_radix_permutation(i, n, s->inverse) & (n-1)] = j;
|
Completed in 120 milliseconds