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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
|
/*
* SpanDSP - a series of DSP components for telephony
*
* complex_vector_int_tests.c
*
* Written by Steve Underwood <steveu@coppice.org>
*
* Copyright (C) 2006 Steve Underwood
*
* All rights reserved.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2, as
* published by the Free Software Foundation.
*
* 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#if defined(HAVE_CONFIG_H)
#include "config.h"
#endif
#include <stdlib.h>
#include <stdio.h>
#include <fcntl.h>
#include <string.h>
#include "spandsp.h"
static int32_t vec_dot_prodi16_dumb(const int16_t x[], const int16_t y[], int n)
{
int32_t z;
int i;
z = 0;
for (i = 0; i < n; i++)
z += (int32_t) x[i]*(int32_t) y[i];
return z;
}
/*- End of function --------------------------------------------------------*/
static int test_vec_dot_prodi16(void)
{
int i;
int32_t za;
int32_t zb;
int16_t x[99];
int16_t y[99];
for (i = 0; i < 99; i++)
{
x[i] = rand();
y[i] = rand();
}
for (i = 1; i < 99; i++)
{
za = vec_dot_prodi16(x, y, i);
zb = vec_dot_prodi16_dumb(x, y, i);
if (za != zb)
{
printf("Tests failed\n");
exit(2);
}
}
return 0;
}
/*- End of function --------------------------------------------------------*/
static int32_t vec_min_maxi16_dumb(const int16_t x[], int n, int16_t out[])
{
int i;
int16_t min;
int16_t max;
int16_t temp;
int32_t z;
max = INT16_MIN;
min = INT16_MAX;
for (i = 0; i < n; i++)
{
temp = x[i];
if (temp > max)
max = temp;
/*endif*/
if (temp < min)
min = temp;
/*endif*/
}
/*endfor*/
out[0] = max;
out[1] = min;
z = abs(min);
if (z > max)
return z;
return max;
}
/*- End of function --------------------------------------------------------*/
static int test_vec_min_maxi16(void)
{
int i;
int32_t za;
int32_t zb;
int16_t x[99];
int16_t outa[2];
int16_t outb[2];
for (i = 0; i < 99; i++)
x[i] = rand();
x[42] = -32768;
za = vec_min_maxi16_dumb(x, 99, outa);
zb = vec_min_maxi16(x, 99, outb);
if (za != zb
||
outa[0] != outb[0]
||
outa[1] != outb[1])
{
printf("Tests failed\n");
exit(2);
}
return 0;
}
/*- End of function --------------------------------------------------------*/
static int test_vec_circular_dot_prodi16(void)
{
int i;
int j;
int pos;
int len;
int32_t za;
int32_t zb;
int16_t x[99];
int16_t y[99];
/* Verify that we can do circular sample buffer "dot" linear coefficient buffer
operations properly, by doing two sub-dot products. */
for (i = 0; i < 99; i++)
{
x[i] = rand();
y[i] = rand();
}
len = 95;
for (pos = 0; pos < len; pos++)
{
za = vec_circular_dot_prodi16(x, y, len, pos);
zb = 0;
for (i = 0; i < len; i++)
{
j = (pos + i) % len;
zb += (int32_t) x[j]*(int32_t) y[i];
}
if (za != zb)
{
printf("Tests failed\n");
exit(2);
}
}
return 0;
}
/*- End of function --------------------------------------------------------*/
int main(int argc, char *argv[])
{
test_vec_dot_prodi16();
test_vec_min_maxi16();
test_vec_circular_dot_prodi16();
printf("Tests passed.\n");
return 0;
}
/*- End of function --------------------------------------------------------*/
/*- End of file ------------------------------------------------------------*/
|
