You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

165 lines
4.4KB

  1. /*
  2. * Copyright (c) 2000, 2001, 2002 Fabrice Bellard
  3. * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
  4. *
  5. * This file is part of Libav.
  6. *
  7. * Libav is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * Libav is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with Libav; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. #ifndef AVCODEC_FFT_H
  22. #define AVCODEC_FFT_H
  23. #ifndef FFT_FLOAT
  24. #define FFT_FLOAT 1
  25. #endif
  26. #include <stdint.h>
  27. #include "config.h"
  28. #include "libavutil/mem.h"
  29. #if FFT_FLOAT
  30. #include "avfft.h"
  31. #define FFT_NAME(x) x
  32. typedef float FFTDouble;
  33. #else
  34. #define FFT_NAME(x) x ## _fixed
  35. typedef int16_t FFTSample;
  36. typedef int FFTDouble;
  37. typedef struct FFTComplex {
  38. int16_t re, im;
  39. } FFTComplex;
  40. typedef struct FFTContext FFTContext;
  41. #endif /* FFT_FLOAT */
  42. typedef struct FFTDComplex {
  43. FFTDouble re, im;
  44. } FFTDComplex;
  45. /* FFT computation */
  46. enum fft_permutation_type {
  47. FF_FFT_PERM_DEFAULT,
  48. FF_FFT_PERM_SWAP_LSBS,
  49. FF_FFT_PERM_AVX,
  50. };
  51. enum mdct_permutation_type {
  52. FF_MDCT_PERM_NONE,
  53. FF_MDCT_PERM_INTERLEAVE,
  54. };
  55. struct FFTContext {
  56. int nbits;
  57. int inverse;
  58. uint16_t *revtab;
  59. FFTComplex *tmp_buf;
  60. int mdct_size; /* size of MDCT (i.e. number of input data * 2) */
  61. int mdct_bits; /* n = 2^nbits */
  62. /* pre/post rotation tables */
  63. FFTSample *tcos;
  64. FFTSample *tsin;
  65. /**
  66. * Do the permutation needed BEFORE calling fft_calc().
  67. */
  68. void (*fft_permute)(struct FFTContext *s, FFTComplex *z);
  69. /**
  70. * Do a complex FFT with the parameters defined in ff_fft_init(). The
  71. * input data must be permuted before. No 1.0/sqrt(n) normalization is done.
  72. */
  73. void (*fft_calc)(struct FFTContext *s, FFTComplex *z);
  74. void (*imdct_calc)(struct FFTContext *s, FFTSample *output, const FFTSample *input);
  75. void (*imdct_half)(struct FFTContext *s, FFTSample *output, const FFTSample *input);
  76. void (*mdct_calc)(struct FFTContext *s, FFTSample *output, const FFTSample *input);
  77. void (*mdct_calcw)(struct FFTContext *s, FFTDouble *output, const FFTSample *input);
  78. enum fft_permutation_type fft_permutation;
  79. enum mdct_permutation_type mdct_permutation;
  80. };
  81. #if CONFIG_HARDCODED_TABLES
  82. #define COSTABLE_CONST const
  83. #else
  84. #define COSTABLE_CONST
  85. #endif
  86. #define COSTABLE(size) \
  87. COSTABLE_CONST DECLARE_ALIGNED(32, FFTSample, FFT_NAME(ff_cos_##size))[size/2]
  88. extern COSTABLE(16);
  89. extern COSTABLE(32);
  90. extern COSTABLE(64);
  91. extern COSTABLE(128);
  92. extern COSTABLE(256);
  93. extern COSTABLE(512);
  94. extern COSTABLE(1024);
  95. extern COSTABLE(2048);
  96. extern COSTABLE(4096);
  97. extern COSTABLE(8192);
  98. extern COSTABLE(16384);
  99. extern COSTABLE(32768);
  100. extern COSTABLE(65536);
  101. extern COSTABLE_CONST FFTSample* const FFT_NAME(ff_cos_tabs)[17];
  102. #define ff_init_ff_cos_tabs FFT_NAME(ff_init_ff_cos_tabs)
  103. /**
  104. * Initialize the cosine table in ff_cos_tabs[index]
  105. * @param index index in ff_cos_tabs array of the table to initialize
  106. */
  107. void ff_init_ff_cos_tabs(int index);
  108. #define ff_fft_init FFT_NAME(ff_fft_init)
  109. #define ff_fft_end FFT_NAME(ff_fft_end)
  110. /**
  111. * Set up a complex FFT.
  112. * @param nbits log2 of the length of the input array
  113. * @param inverse if 0 perform the forward transform, if 1 perform the inverse
  114. */
  115. int ff_fft_init(FFTContext *s, int nbits, int inverse);
  116. void ff_fft_init_aarch64(FFTContext *s);
  117. void ff_fft_init_x86(FFTContext *s);
  118. void ff_fft_init_arm(FFTContext *s);
  119. void ff_fft_init_ppc(FFTContext *s);
  120. void ff_fft_fixed_init_arm(FFTContext *s);
  121. void ff_fft_end(FFTContext *s);
  122. #define ff_mdct_init FFT_NAME(ff_mdct_init)
  123. #define ff_mdct_end FFT_NAME(ff_mdct_end)
  124. int ff_mdct_init(FFTContext *s, int nbits, int inverse, double scale);
  125. void ff_mdct_end(FFTContext *s);
  126. void ff_mdct_init_aarch64(FFTContext *s);
  127. void ff_mdct_init_arm(FFTContext *s);
  128. void ff_mdct_init_ppc(FFTContext *s);
  129. void ff_mdct_init_x86(FFTContext *s);
  130. void ff_mdct_fixed_init_arm(FFTContext *s);
  131. #endif /* AVCODEC_FFT_H */