# HG changeset patch # User reimar # Date 1257355823 0 # Node ID 63910f7ba29395cad136ae6515102ee8c8cebc91 # Parent 74e51b86b934976c283f3a7e4693127f8cc2b028 Pad ff_cos_tabs and ff_sin_tabs so that index n points to the table for n bits. While this "wastes" up to 2x32 bytes it makes the code slightly simpler and less confusing. diff -r 74e51b86b934 -r 63910f7ba293 dsputil.h --- a/dsputil.h Tue Nov 03 22:50:02 2009 +0000 +++ b/dsputil.h Wed Nov 04 17:30:23 2009 +0000 @@ -767,7 +767,7 @@ extern COSTABLE(16384); extern COSTABLE(32768); extern COSTABLE(65536); -extern COSTABLE_CONST FFTSample* const ff_cos_tabs[13]; +extern COSTABLE_CONST FFTSample* const ff_cos_tabs[17]; extern SINTABLE(16); extern SINTABLE(32); diff -r 74e51b86b934 -r 63910f7ba293 fft.c --- a/fft.c Tue Nov 03 22:50:02 2009 +0000 +++ b/fft.c Wed Nov 04 17:30:23 2009 +0000 @@ -45,6 +45,7 @@ COSTABLE(65536); #endif COSTABLE_CONST FFTSample * const ff_cos_tabs[] = { + NULL, NULL, NULL, NULL, ff_cos_16, ff_cos_32, ff_cos_64, ff_cos_128, ff_cos_256, ff_cos_512, ff_cos_1024, ff_cos_2048, ff_cos_4096, ff_cos_8192, ff_cos_16384, ff_cos_32768, ff_cos_65536, }; @@ -99,7 +100,7 @@ for(j=4; j<=nbits; j++) { int m = 1<fft, nbits-1, trans == IRDFT || trans == RIDFT) < 0) return -1; - s->tcos = ff_cos_tabs[nbits-4]; - s->tsin = ff_sin_tabs[nbits-4]+(trans == RDFT || trans == IRIDFT)*(n>>2); + s->tcos = ff_cos_tabs[nbits]; + s->tsin = ff_sin_tabs[nbits]+(trans == RDFT || trans == IRIDFT)*(n>>2); #if !CONFIG_HARDCODED_TABLES for (i = 0; i < (n>>2); i++) { s->tsin[i] = sin(i*theta);