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
|
/*
* 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_MINMAX_H_
#define PRIVATE_DSP_ARCH_GENERIC_PMATH_MINMAX_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 pmin2(float *dst, const float *src, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = (dst[i] < src[i]) ? dst[i] : src[i];
}
void psmin2(float *dst, const float *src, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = (fabs(dst[i]) < fabs(src[i])) ? dst[i] : src[i];
}
void pamin2(float *dst, const float *src, size_t count)
{
float xa, xb;
for (size_t i=0; i<count; ++i)
{
xa = fabs(dst[i]);
xb = fabs(src[i]);
dst[i] = (xa < xb) ? xa : xb;
}
}
void pmax2(float *dst, const float *src, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = (dst[i] < src[i]) ? src[i] : dst[i];
}
void psmax2(float *dst, const float *src, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = (fabs(dst[i]) < fabs(src[i])) ? src[i] : dst[i];
}
void pamax2(float *dst, const float *src, size_t count)
{
float xa, xb;
for (size_t i=0; i<count; ++i)
{
xa = fabs(dst[i]);
xb = fabs(src[i]);
dst[i] = (xa < xb) ? xb : xa;
}
}
void pmin3(float *dst, const float *a, const float *b, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = (a[i] < b[i]) ? a[i] : b[i];
}
void psmin3(float *dst, const float *a, const float *b, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = (fabs(a[i]) < fabs(b[i])) ? a[i] : b[i];
}
void pamin3(float *dst, const float *a, const float *b, size_t count)
{
float xa, xb;
for (size_t i=0; i<count; ++i)
{
xa = fabs(a[i]);
xb = fabs(b[i]);
dst[i] = (xa < xb) ? xa : xb;
}
}
void pmax3(float *dst, const float *a, const float *b, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = (a[i] < b[i]) ? b[i] : a[i];
}
void psmax3(float *dst, const float *a, const float *b, size_t count)
{
for (size_t i=0; i<count; ++i)
dst[i] = (fabs(a[i]) < fabs(b[i])) ? b[i] : a[i];
}
void pamax3(float *dst, const float *a, const float *b, size_t count)
{
float xa, xb;
for (size_t i=0; i<count; ++i)
{
xa = fabs(a[i]);
xb = fabs(b[i]);
dst[i] = (xa < xb) ? xb : xa;
}
}
}
}
#endif /* PRIVATE_DSP_ARCH_GENERIC_PMATH_MINMAX_H_ */
|
