On 05/16/2011 10:58 AM, Mans Rullgard wrote: > Signed-off-by: Mans Rullgard <[email protected]> > --- > libavcodec/dct.c | 30 +++++++++++++++--------------- > 1 files changed, 15 insertions(+), 15 deletions(-) > > diff --git a/libavcodec/dct.c b/libavcodec/dct.c > index e7a8f22..caa6bdb 100644 > --- a/libavcodec/dct.c > +++ b/libavcodec/dct.c > @@ -188,26 +188,26 @@ av_cold int ff_dct_init(DCTContext *s, int nbits, enum > DCTTransformType inverse) > if (inverse == DCT_II && nbits == 5) { > s->dct_calc = dct32_func; > } else { > - ff_init_ff_cos_tabs(nbits+2); > + ff_init_ff_cos_tabs(nbits+2); > > - s->costab = ff_cos_tabs[nbits+2]; > + s->costab = ff_cos_tabs[nbits+2]; > > - s->csc2 = av_malloc(n/2 * sizeof(FFTSample)); > + s->csc2 = av_malloc(n/2 * sizeof(FFTSample)); > > - if (ff_rdft_init(&s->rdft, nbits, inverse == DCT_III) < 0) { > - av_free(s->csc2); > - return -1; > - } > + if (ff_rdft_init(&s->rdft, nbits, inverse == DCT_III) < 0) { > + av_free(s->csc2); > + return -1; > + } > > - for (i = 0; i < n/2; i++) > - s->csc2[i] = 0.5 / sin((M_PI / (2*n) * (2*i + 1))); > + for (i = 0; i < n/2; i++) > + s->csc2[i] = 0.5 / sin((M_PI / (2*n) * (2*i + 1))); > > - switch(inverse) { > - case DCT_I : s->dct_calc = ff_dct_calc_I_c; break; > - case DCT_II : s->dct_calc = ff_dct_calc_II_c ; break; > - case DCT_III: s->dct_calc = ff_dct_calc_III_c; break; > - case DST_I : s->dct_calc = ff_dst_calc_I_c; break; > - } > + switch(inverse) { > + case DCT_I : s->dct_calc = ff_dct_calc_I_c; break; > + case DCT_II : s->dct_calc = ff_dct_calc_II_c ; break; > + case DCT_III: s->dct_calc = ff_dct_calc_III_c; break; > + case DST_I : s->dct_calc = ff_dst_calc_I_c; break; > + } > } > > s->dct32 = dct32;
ok. -Justin _______________________________________________ libav-devel mailing list [email protected] https://lists.libav.org/mailman/listinfo/libav-devel
