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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
|
/*
* Simd Library (http://ermig1979.github.io/Simd).
*
* Copyright (c) 2011-2022 Yermalayeu Ihar,
* 2018-2019 Radchenko Andrey.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#ifndef __SimdCompare_h__
#define __SimdCompare_h__
#include "Simd/SimdConst.h"
namespace Simd
{
namespace Base
{
template <SimdCompareType type> SIMD_INLINE bool Compare8u(const uint8_t & src, const uint8_t & b);
template <> SIMD_INLINE bool Compare8u<SimdCompareEqual>(const uint8_t & a, const uint8_t & b)
{
return a == b;
}
template <> SIMD_INLINE bool Compare8u<SimdCompareNotEqual>(const uint8_t & a, const uint8_t & b)
{
return a != b;
}
template <> SIMD_INLINE bool Compare8u<SimdCompareGreater>(const uint8_t & a, const uint8_t & b)
{
return a > b;
}
template <> SIMD_INLINE bool Compare8u<SimdCompareGreaterOrEqual>(const uint8_t & a, const uint8_t & b)
{
return a >= b;
}
template <> SIMD_INLINE bool Compare8u<SimdCompareLesser>(const uint8_t & a, const uint8_t & b)
{
return a < b;
}
template <> SIMD_INLINE bool Compare8u<SimdCompareLesserOrEqual>(const uint8_t & a, const uint8_t & b)
{
return a <= b;
}
template <SimdCompareType type> SIMD_INLINE bool Compare16i(const int16_t & src, const int16_t & b);
template <> SIMD_INLINE bool Compare16i<SimdCompareEqual>(const int16_t & a, const int16_t & b)
{
return a == b;
}
template <> SIMD_INLINE bool Compare16i<SimdCompareNotEqual>(const int16_t & a, const int16_t & b)
{
return a != b;
}
template <> SIMD_INLINE bool Compare16i<SimdCompareGreater>(const int16_t & a, const int16_t & b)
{
return a > b;
}
template <> SIMD_INLINE bool Compare16i<SimdCompareGreaterOrEqual>(const int16_t & a, const int16_t & b)
{
return a >= b;
}
template <> SIMD_INLINE bool Compare16i<SimdCompareLesser>(const int16_t & a, const int16_t & b)
{
return a < b;
}
template <> SIMD_INLINE bool Compare16i<SimdCompareLesserOrEqual>(const int16_t & a, const int16_t & b)
{
return a <= b;
}
}
#ifdef SIMD_SSE41_ENABLE
namespace Sse41
{
SIMD_INLINE __m128i NotEqual8u(__m128i a, __m128i b)
{
return _mm_andnot_si128(_mm_cmpeq_epi8(a, b), K_INV_ZERO);
}
SIMD_INLINE __m128i Greater8u(__m128i a, __m128i b)
{
return _mm_andnot_si128(_mm_cmpeq_epi8(_mm_min_epu8(a, b), a), K_INV_ZERO);
}
SIMD_INLINE __m128i GreaterOrEqual8u(__m128i a, __m128i b)
{
return _mm_cmpeq_epi8(_mm_max_epu8(a, b), a);
}
SIMD_INLINE __m128i Lesser8u(__m128i a, __m128i b)
{
return _mm_andnot_si128(_mm_cmpeq_epi8(_mm_max_epu8(a, b), a), K_INV_ZERO);
}
SIMD_INLINE __m128i LesserOrEqual8u(__m128i a, __m128i b)
{
return _mm_cmpeq_epi8(_mm_min_epu8(a, b), a);
}
template<SimdCompareType compareType> SIMD_INLINE __m128i Compare8u(__m128i a, __m128i b);
template<> SIMD_INLINE __m128i Compare8u<SimdCompareEqual>(__m128i a, __m128i b)
{
return _mm_cmpeq_epi8(a, b);
}
template<> SIMD_INLINE __m128i Compare8u<SimdCompareNotEqual>(__m128i a, __m128i b)
{
return NotEqual8u(a, b);
}
template<> SIMD_INLINE __m128i Compare8u<SimdCompareGreater>(__m128i a, __m128i b)
{
return Greater8u(a, b);
}
template<> SIMD_INLINE __m128i Compare8u<SimdCompareGreaterOrEqual>(__m128i a, __m128i b)
{
return GreaterOrEqual8u(a, b);
}
template<> SIMD_INLINE __m128i Compare8u<SimdCompareLesser>(__m128i a, __m128i b)
{
return Lesser8u(a, b);
}
template<> SIMD_INLINE __m128i Compare8u<SimdCompareLesserOrEqual>(__m128i a, __m128i b)
{
return LesserOrEqual8u(a, b);
}
SIMD_INLINE __m128i NotEqual16i(__m128i a, __m128i b)
{
return _mm_andnot_si128(_mm_cmpeq_epi16(a, b), K_INV_ZERO);
}
SIMD_INLINE __m128i GreaterOrEqual16i_m128(__m128i a, __m128i b)
{
return _mm_andnot_si128(_mm_cmplt_epi16(a, b), K_INV_ZERO);
}
SIMD_INLINE __m128i LesserOrEqual16i(__m128i a, __m128i b)
{
return _mm_andnot_si128(_mm_cmpgt_epi16(a, b), K_INV_ZERO);
}
template<SimdCompareType compareType> SIMD_INLINE __m128i Compare16i(__m128i a, __m128i b);
template<> SIMD_INLINE __m128i Compare16i<SimdCompareEqual>(__m128i a, __m128i b)
{
return _mm_cmpeq_epi16(a, b);
}
template<> SIMD_INLINE __m128i Compare16i<SimdCompareNotEqual>(__m128i a, __m128i b)
{
return NotEqual16i(a, b);
}
template<> SIMD_INLINE __m128i Compare16i<SimdCompareGreater>(__m128i a, __m128i b)
{
return _mm_cmpgt_epi16(a, b);
}
template<> SIMD_INLINE __m128i Compare16i<SimdCompareGreaterOrEqual>(__m128i a, __m128i b)
{
return GreaterOrEqual16i_m128(a, b);
}
template<> SIMD_INLINE __m128i Compare16i<SimdCompareLesser>(__m128i a, __m128i b)
{
return _mm_cmplt_epi16(a, b);
}
template<> SIMD_INLINE __m128i Compare16i<SimdCompareLesserOrEqual>(__m128i a, __m128i b)
{
return LesserOrEqual16i(a, b);
}
}
#endif// SIMD_SSE41_ENABLE
#ifdef SIMD_AVX2_ENABLE
namespace Avx2
{
SIMD_INLINE __m256i NotEqual8u(__m256i a, __m256i b)
{
return _mm256_andnot_si256(_mm256_cmpeq_epi8(a, b), K_INV_ZERO);
}
SIMD_INLINE __m256i Greater8u(__m256i a, __m256i b)
{
return _mm256_andnot_si256(_mm256_cmpeq_epi8(_mm256_min_epu8(a, b), a), K_INV_ZERO);
}
SIMD_INLINE __m256i GreaterOrEqual8u(__m256i a, __m256i b)
{
return _mm256_cmpeq_epi8(_mm256_max_epu8(a, b), a);
}
SIMD_INLINE __m256i Lesser8u(__m256i a, __m256i b)
{
return _mm256_andnot_si256(_mm256_cmpeq_epi8(_mm256_max_epu8(a, b), a), K_INV_ZERO);
}
SIMD_INLINE __m256i LesserOrEqual8u(__m256i a, __m256i b)
{
return _mm256_cmpeq_epi8(_mm256_min_epu8(a, b), a);
}
template<SimdCompareType compareType> SIMD_INLINE __m256i Compare8u(__m256i a, __m256i b);
template<> SIMD_INLINE __m256i Compare8u<SimdCompareEqual>(__m256i a, __m256i b)
{
return _mm256_cmpeq_epi8(a, b);
}
template<> SIMD_INLINE __m256i Compare8u<SimdCompareNotEqual>(__m256i a, __m256i b)
{
return NotEqual8u(a, b);
}
template<> SIMD_INLINE __m256i Compare8u<SimdCompareGreater>(__m256i a, __m256i b)
{
return Greater8u(a, b);
}
template<> SIMD_INLINE __m256i Compare8u<SimdCompareGreaterOrEqual>(__m256i a, __m256i b)
{
return GreaterOrEqual8u(a, b);
}
template<> SIMD_INLINE __m256i Compare8u<SimdCompareLesser>(__m256i a, __m256i b)
{
return Lesser8u(a, b);
}
template<> SIMD_INLINE __m256i Compare8u<SimdCompareLesserOrEqual>(__m256i a, __m256i b)
{
return LesserOrEqual8u(a, b);
}
SIMD_INLINE __m256i NotEqual16i(__m256i a, __m256i b)
{
return _mm256_andnot_si256(_mm256_cmpeq_epi16(a, b), K_INV_ZERO);
}
SIMD_INLINE __m256i GreaterOrEqual16i_m256(__m256i a, __m256i b)
{
return _mm256_andnot_si256(_mm256_cmpgt_epi16(b, a), K_INV_ZERO);
}
SIMD_INLINE __m256i LesserOrEqual16i(__m256i a, __m256i b)
{
return _mm256_andnot_si256(_mm256_cmpgt_epi16(a, b), K_INV_ZERO);
}
template<SimdCompareType compareType> SIMD_INLINE __m256i Compare16i(__m256i a, __m256i b);
template<> SIMD_INLINE __m256i Compare16i<SimdCompareEqual>(__m256i a, __m256i b)
{
return _mm256_cmpeq_epi16(a, b);
}
template<> SIMD_INLINE __m256i Compare16i<SimdCompareNotEqual>(__m256i a, __m256i b)
{
return NotEqual16i(a, b);
}
template<> SIMD_INLINE __m256i Compare16i<SimdCompareGreater>(__m256i a, __m256i b)
{
return _mm256_cmpgt_epi16(a, b);
}
template<> SIMD_INLINE __m256i Compare16i<SimdCompareGreaterOrEqual>(__m256i a, __m256i b)
{
return GreaterOrEqual16i_m256(a, b);
}
template<> SIMD_INLINE __m256i Compare16i<SimdCompareLesser>(__m256i a, __m256i b)
{
return _mm256_cmpgt_epi16(b, a);
}
template<> SIMD_INLINE __m256i Compare16i<SimdCompareLesserOrEqual>(__m256i a, __m256i b)
{
return LesserOrEqual16i(a, b);
}
}
#endif// SIMD_AVX2_ENABLE
#ifdef SIMD_NEON_ENABLE
namespace Neon
{
template<SimdCompareType compareType> SIMD_INLINE uint8x16_t Compare8u(const uint8x16_t & a, const uint8x16_t & b);
template<> SIMD_INLINE uint8x16_t Compare8u<SimdCompareEqual>(const uint8x16_t & a, const uint8x16_t & b)
{
return vceqq_u8(a, b);
}
template<> SIMD_INLINE uint8x16_t Compare8u<SimdCompareNotEqual>(const uint8x16_t & a, const uint8x16_t & b)
{
return vmvnq_u8(vceqq_u8(a, b));
}
template<> SIMD_INLINE uint8x16_t Compare8u<SimdCompareGreater>(const uint8x16_t & a, const uint8x16_t & b)
{
return vcgtq_u8(a, b);
}
template<> SIMD_INLINE uint8x16_t Compare8u<SimdCompareGreaterOrEqual>(const uint8x16_t & a, const uint8x16_t & b)
{
return vcgeq_u8(a, b);
}
template<> SIMD_INLINE uint8x16_t Compare8u<SimdCompareLesser>(const uint8x16_t & a, const uint8x16_t & b)
{
return vcltq_u8(a, b);
}
template<> SIMD_INLINE uint8x16_t Compare8u<SimdCompareLesserOrEqual>(const uint8x16_t & a, const uint8x16_t & b)
{
return vcleq_u8(a, b);
}
template<SimdCompareType compareType> SIMD_INLINE uint16x8_t Compare16i(const int16x8_t & a, const int16x8_t & b);
template<> SIMD_INLINE uint16x8_t Compare16i<SimdCompareEqual>(const int16x8_t & a, const int16x8_t & b)
{
return vceqq_s16(a, b);
}
template<> SIMD_INLINE uint16x8_t Compare16i<SimdCompareNotEqual>(const int16x8_t & a, const int16x8_t & b)
{
return vmvnq_u16(vceqq_s16(a, b));
}
template<> SIMD_INLINE uint16x8_t Compare16i<SimdCompareGreater>(const int16x8_t & a, const int16x8_t & b)
{
return vcgtq_s16(a, b);
}
template<> SIMD_INLINE uint16x8_t Compare16i<SimdCompareGreaterOrEqual>(const int16x8_t & a, const int16x8_t & b)
{
return vcgeq_s16(a, b);
}
template<> SIMD_INLINE uint16x8_t Compare16i<SimdCompareLesser>(const int16x8_t & a, const int16x8_t & b)
{
return vcltq_s16(a, b);
}
template<> SIMD_INLINE uint16x8_t Compare16i<SimdCompareLesserOrEqual>(const int16x8_t & a, const int16x8_t & b)
{
return vcleq_s16(a, b);
}
}
#endif// SIMD_NEON_ENABLE
}
#endif//__SimdCompare_h__
|
