* Flip argument order for scalarproduct() so that the first argument is always 32 bit aligned, like it is already the case for vector_add() and vector_sub(), for upcoming optimisations. * Un-inline the apply_filter functions for better cache utilisation.

git-svn-id: svn://svn.rockbox.org/rockbox/trunk@15301 a1c6a512-1295-4272-9138-f99709370657
This commit is contained in:
Jens Arnold 2007-10-25 18:45:28 +00:00
parent 347cd866b1
commit 3ea3caf341

View file

@ -84,7 +84,7 @@ struct filter_t {
/* Apply the filter with state f to count entries in data[] */
static inline void do_apply_filter_3980(struct filter_t* f, int32_t* data, int count)
static void do_apply_filter_3980(struct filter_t* f, int32_t* data, int count)
{
int res;
int absres;
@ -95,7 +95,7 @@ static inline void do_apply_filter_3980(struct filter_t* f, int32_t* data, int c
while(count--)
{
res = FP_TO_INT(scalarproduct(f->delay - ORDER, f->coeffs));
res = FP_TO_INT(scalarproduct(f->coeffs, f->delay - ORDER));
if (*data < 0)
vector_add(f->coeffs, f->adaptcoeffs - ORDER);
@ -141,7 +141,7 @@ static inline void do_apply_filter_3980(struct filter_t* f, int32_t* data, int c
}
}
static inline void do_apply_filter_3970(struct filter_t* f, int32_t* data, int count)
static void do_apply_filter_3970(struct filter_t* f, int32_t* data, int count)
{
int res;
@ -151,7 +151,7 @@ static inline void do_apply_filter_3970(struct filter_t* f, int32_t* data, int c
while(count--)
{
res = FP_TO_INT(scalarproduct(f->delay - ORDER, f->coeffs));
res = FP_TO_INT(scalarproduct(f->coeffs, f->delay - ORDER));
if (*data < 0)
vector_add(f->coeffs, f->adaptcoeffs - ORDER);