Lines Matching defs:COEFFS
58 #define COEFFS 256
68 float CWdecoded[COEFFS];
72 int CWlengthT[COEFFS]; ///< how many bits in each codeword
79 int skipFlags[COEFFS]; ///< skip coefficient decoding or not
80 int codewords[COEFFS]; ///< raw codewords read from bitstream
82 float last_fft_im[COEFFS];
92 float mdct_sine_window[COEFFS];
93 float post_cos[COEFFS];
94 float post_sin[COEFFS];
95 float pre_coef1[COEFFS];
96 float pre_coef2[COEFFS];
105 DECLARE_ALIGNED(32, FFTComplex, samples)[COEFFS / 2];
227 for (i = 0; i < COEFFS / 2; i++)
232 ff_sine_window_init(q->mdct_sine_window, COEFFS);
233 for (i = 0; i < COEFFS; i++)
235 for (i = 0; i < COEFFS / 2; i++) {
735 float *dst2 = q->out_samples + (COEFFS - 1);
738 for (i = 0; i < COEFFS / 2; i++) {
739 q->samples[i].re = -(q->pre_coef1[i] * chctx->CWdecoded[COEFFS - 1 - i * 2]) -
741 q->samples[i].im = (q->pre_coef2[i] * chctx->CWdecoded[COEFFS - 1 - i * 2]) -
750 for (i = 0; i < COEFFS / 2; i++) {
753 *dst1 = (q->mdct_sine_window[COEFFS - 1 - i * 2] * chctx->last_fft_im[i])
756 - (q->mdct_sine_window[COEFFS - 1 - i * 2] * re);
899 for (i = 0; i < COEFFS; i++)
1040 frame->nb_samples = COEFFS;
1059 (float *)frame->extended_data[1], COEFFS);