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
|
/*
* Copyright (C) 2020 Linux Studio Plugins Project <https://lsp-plug.in/>
* (C) 2020 Vladimir Sadovnikov <sadko4u@gmail.com>
*
* This file is part of lsp-dsp-lib
* Created on: 31 мар. 2020 г.
*
* lsp-dsp-lib is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* any later version.
*
* lsp-dsp-lib 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 Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with lsp-dsp-lib. If not, see <https://www.gnu.org/licenses/>.
*/
#ifndef PRIVATE_DSP_ARCH_GENERIC_PMATH_OP_KX_H_
#define PRIVATE_DSP_ARCH_GENERIC_PMATH_OP_KX_H_
#ifndef PRIVATE_DSP_ARCH_GENERIC_IMPL
#error "This header should not be included directly"
#endif /* PRIVATE_DSP_ARCH_GENERIC_IMPL */
namespace lsp
{
namespace generic
{
void add_k2(float *dst, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] += k;
};
void sub_k2(float *dst, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] -= k;
};
void rsub_k2(float *dst, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = k - dst[i];
};
void mul_k2(float *dst, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] *= k;
};
void div_k2(float *dst, float k, size_t count)
{
k = 1.0f / k;
for (size_t i=0; i<count; ++i)
dst[i] *= k;
};
void rdiv_k2(float *dst, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = k / dst[i];
};
void mod_k2(float *dst, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
{
float v = dst[i];
int32_t r = v / k;
dst[i] = v - k * r;
}
}
void rmod_k2(float *dst, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
{
float v = dst[i];
int32_t r = k / v;
dst[i] = k - v * r;
}
}
void add_k3(float *dst, const float *src, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = src[i] + k;
};
void sub_k3(float *dst, const float *src, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = src[i] - k;
};
void rsub_k3(float *dst, const float *src, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = k - src[i];
};
void mul_k3(float *dst, const float *src, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = src[i] * k;
};
void div_k3(float *dst, const float *src, float k, size_t count)
{
k = 1.0f / k;
for (size_t i=0; i<count; ++i)
dst[i] = src[i] * k;
};
void rdiv_k3(float *dst, const float *src, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = k / src[i];
};
void mod_k3(float *dst, const float *src, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
{
float v = src[i];
int32_t r = v / k;
dst[i] = v - k * r;
}
}
void rmod_k3(float *dst, const float *src, float k, size_t count)
{
for (size_t i=0; i<count; ++i)
{
float v = src[i];
int32_t r = k / v;
dst[i] = k - v * r;
}
}
}
}
#endif /* PRIVATE_DSP_ARCH_GENERIC_PMATH_OP_KX_H_ */
|
