split_radix_permutation  152 libavcodec/fft_template.c     if(!(i&m))            return split_radix_permutation(i, m, inverse)*2;
split_radix_permutation  154 libavcodec/fft_template.c     if(inverse == !(i&m)) return split_radix_permutation(i, m, inverse)*4 + 1;
split_radix_permutation  155 libavcodec/fft_template.c     else                  return split_radix_permutation(i, m, inverse)*4 - 1;
split_radix_permutation  190 libavcodec/fft_template.c                 s->revtab[-split_radix_permutation(i + k, n, s->inverse) & (n - 1)] =
split_radix_permutation  197 libavcodec/fft_template.c                 s->revtab[-split_radix_permutation(i + k, n, s->inverse) & (n - 1)] = j;
split_radix_permutation  269 libavcodec/fft_template.c         k = -split_radix_permutation(i, n, s->inverse) & (n - 1);\
split_radix_permutation  278 libavcodec/fft_template.c         k = -split_radix_permutation(i, n, s->inverse) & (n - 1);\
split_radix_permutation  103 libavutil/tx.c         int k = -split_radix_permutation(i, m, inv) & (m - 1);
split_radix_permutation  130 libavutil/tx_priv.h         return split_radix_permutation(i, m, inverse)*2;
split_radix_permutation  133 libavutil/tx_priv.h         return split_radix_permutation(i, m, inverse)*4 + 1;
split_radix_permutation  135 libavutil/tx_priv.h         return split_radix_permutation(i, m, inverse)*4 - 1;