blob: 6d680d9e7c918ad14829b18264ec70bdb8f8688c (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
/*
* Author: Andy Green <andy.green@linaro.org>
* Copyright (C) 2012 Linaro, LTD
*
* 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 <malloc.h>
#include "libarmep.h"
int avg_mean_us_init(struct avg_mean_us *amu, int width)
{
amu->ring = malloc(width * sizeof(unsigned short));
if (amu->ring == NULL)
return 1;
amu->width = width;
amu->count = 0;
amu->next = 0;
amu->sum = 0;
return 0;
}
void avg_mean_us_add(struct avg_mean_us *amu, unsigned short s)
{
if (amu->count == amu->width)
amu->sum -= amu->ring[amu->next];
else
amu->count++;
amu->ring[amu->next++] = s;
if (amu->next == amu->width)
amu->next = 0;
amu->sum += s;
}
double avg_mean_us(struct avg_mean_us *amu)
{
return (double)amu->sum / (double)amu->count;
}
void avg_mean_us_free(struct avg_mean_us *amu)
{
free(amu->ring);
}
void avg_mean_us_flush(struct avg_mean_us *amu)
{
amu->count = 0;
amu->sum = 0;
amu->next = 0;
}
|