Mercurial > libavcodec.hg
comparison mdct.c @ 2967:ef2149182f1c libavcodec
COSMETICS: Remove all trailing whitespace.
| author | diego |
|---|---|
| date | Sat, 17 Dec 2005 18:14:38 +0000 |
| parents | dd63cb7e5080 |
| children | 0b546eab515d |
comparison
equal
deleted
inserted
replaced
| 2966:564788471dd4 | 2967:ef2149182f1c |
|---|---|
| 72 * Compute inverse MDCT of size N = 2^nbits | 72 * Compute inverse MDCT of size N = 2^nbits |
| 73 * @param output N samples | 73 * @param output N samples |
| 74 * @param input N/2 samples | 74 * @param input N/2 samples |
| 75 * @param tmp N/2 samples | 75 * @param tmp N/2 samples |
| 76 */ | 76 */ |
| 77 void ff_imdct_calc(MDCTContext *s, FFTSample *output, | 77 void ff_imdct_calc(MDCTContext *s, FFTSample *output, |
| 78 const FFTSample *input, FFTSample *tmp) | 78 const FFTSample *input, FFTSample *tmp) |
| 79 { | 79 { |
| 80 int k, n8, n4, n2, n, j; | 80 int k, n8, n4, n2, n, j; |
| 81 const uint16_t *revtab = s->fft.revtab; | 81 const uint16_t *revtab = s->fft.revtab; |
| 82 const FFTSample *tcos = s->tcos; | 82 const FFTSample *tcos = s->tcos; |
| 124 * Compute MDCT of size N = 2^nbits | 124 * Compute MDCT of size N = 2^nbits |
| 125 * @param input N samples | 125 * @param input N samples |
| 126 * @param out N/2 samples | 126 * @param out N/2 samples |
| 127 * @param tmp temporary storage of N/2 samples | 127 * @param tmp temporary storage of N/2 samples |
| 128 */ | 128 */ |
| 129 void ff_mdct_calc(MDCTContext *s, FFTSample *out, | 129 void ff_mdct_calc(MDCTContext *s, FFTSample *out, |
| 130 const FFTSample *input, FFTSample *tmp) | 130 const FFTSample *input, FFTSample *tmp) |
| 131 { | 131 { |
| 132 int i, j, n, n8, n4, n2, n3; | 132 int i, j, n, n8, n4, n2, n3; |
| 133 FFTSample re, im, re1, im1; | 133 FFTSample re, im, re1, im1; |
| 134 const uint16_t *revtab = s->fft.revtab; | 134 const uint16_t *revtab = s->fft.revtab; |
| 154 j = revtab[n8 + i]; | 154 j = revtab[n8 + i]; |
| 155 CMUL(x[j].re, x[j].im, re, im, -tcos[n8 + i], tsin[n8 + i]); | 155 CMUL(x[j].re, x[j].im, re, im, -tcos[n8 + i], tsin[n8 + i]); |
| 156 } | 156 } |
| 157 | 157 |
| 158 ff_fft_calc(&s->fft, x); | 158 ff_fft_calc(&s->fft, x); |
| 159 | 159 |
| 160 /* post rotation */ | 160 /* post rotation */ |
| 161 for(i=0;i<n4;i++) { | 161 for(i=0;i<n4;i++) { |
| 162 re = x[i].re; | 162 re = x[i].re; |
| 163 im = x[i].im; | 163 im = x[i].im; |
| 164 CMUL(re1, im1, re, im, -tsin[i], -tcos[i]); | 164 CMUL(re1, im1, re, im, -tsin[i], -tcos[i]); |