2011-11-27 21:19:29 +08:00
|
|
|
/**
|
|
|
|
* @file mave.c
|
|
|
|
* @note Copyright (C) 2011 Richard Cochran <richardcochran@gmail.com>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License along
|
|
|
|
* with this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#include "mave.h"
|
2013-10-29 18:58:18 +08:00
|
|
|
#include "filter_private.h"
|
2011-11-27 21:19:29 +08:00
|
|
|
|
|
|
|
struct mave {
|
2013-10-29 18:58:18 +08:00
|
|
|
struct filter filter;
|
2011-11-27 21:19:29 +08:00
|
|
|
int cnt;
|
|
|
|
int len;
|
|
|
|
int index;
|
|
|
|
tmv_t sum;
|
|
|
|
tmv_t *val;
|
|
|
|
};
|
|
|
|
|
2013-10-29 18:58:18 +08:00
|
|
|
static void mave_destroy(struct filter *filter)
|
2011-11-27 21:19:29 +08:00
|
|
|
{
|
2013-10-29 18:58:18 +08:00
|
|
|
struct mave *m = container_of(filter, struct mave, filter);
|
2011-11-27 21:19:29 +08:00
|
|
|
free(m->val);
|
|
|
|
free(m);
|
|
|
|
}
|
|
|
|
|
2013-10-29 18:58:18 +08:00
|
|
|
static tmv_t mave_accumulate(struct filter *filter, tmv_t val)
|
2011-11-27 21:19:29 +08:00
|
|
|
{
|
2013-10-29 18:58:18 +08:00
|
|
|
struct mave *m = container_of(filter, struct mave, filter);
|
|
|
|
|
2011-11-27 21:19:29 +08:00
|
|
|
m->sum = tmv_sub(m->sum, m->val[m->index]);
|
|
|
|
m->val[m->index] = val;
|
|
|
|
m->index = (1 + m->index) % m->len;
|
|
|
|
m->sum = tmv_add(m->sum, val);
|
|
|
|
if (m->cnt < m->len) {
|
|
|
|
m->cnt++;
|
|
|
|
}
|
|
|
|
return tmv_div(m->sum, m->cnt);
|
|
|
|
}
|
|
|
|
|
2013-10-29 18:58:18 +08:00
|
|
|
static void mave_reset(struct filter *filter)
|
2011-11-27 21:19:29 +08:00
|
|
|
{
|
2013-10-29 18:58:18 +08:00
|
|
|
struct mave *m = container_of(filter, struct mave, filter);
|
|
|
|
|
2011-11-27 21:19:29 +08:00
|
|
|
m->cnt = 0;
|
|
|
|
m->index = 0;
|
|
|
|
m->sum = 0;
|
|
|
|
memset(m->val, 0, m->len * sizeof(*m->val));
|
|
|
|
}
|
2013-10-29 18:58:18 +08:00
|
|
|
|
|
|
|
struct filter *mave_create(int length)
|
|
|
|
{
|
|
|
|
struct mave *m;
|
|
|
|
m = calloc(1, sizeof(*m));
|
|
|
|
if (!m) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
m->filter.destroy = mave_destroy;
|
|
|
|
m->filter.sample = mave_accumulate;
|
|
|
|
m->filter.reset = mave_reset;
|
|
|
|
m->val = calloc(1, length * sizeof(*m->val));
|
|
|
|
if (!m->val) {
|
|
|
|
free(m);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
m->len = length;
|
|
|
|
return &m->filter;
|
|
|
|
}
|