blob: 5a7bbe36a4d54e3b0187e59958fb80a641e2414e [file] [log] [blame]
Christophe Fontaine33e81952016-12-19 14:41:52 +01001/*
2 * Copyright (c) 2015 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
6 *
7 * http://www.apache.org/licenses/LICENSE-2.0
8 *
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
14 */
15
16#ifndef included_vector_neon_h
17#define included_vector_neon_h
18#include <arm_neon.h>
19
Christophe Fontaine33e81952016-12-19 14:41:52 +010020/* Arithmetic */
Christophe Fontaine33e81952016-12-19 14:41:52 +010021#define u16x8_sub_saturate(a,b) vsubq_u16(a,b)
22#define i16x8_sub_saturate(a,b) vsubq_s16(a,b)
Lijian Zhangf5942d52018-10-31 13:35:20 +080023/* Dummy. Aid making uniform macros */
24#define vreinterpretq_u8_u8(a) a
Lijian.Zhange6a47cf2019-03-12 18:32:39 +080025/* Implement the missing intrinsics to make uniform macros */
26#define vminvq_u64(x) \
27({ \
28 u64 x0 = vgetq_lane_u64(x, 0); \
29 u64 x1 = vgetq_lane_u64(x, 1); \
30 x0 < x1 ? x0 : x1; \
31})
Christophe Fontaine33e81952016-12-19 14:41:52 +010032
Gabriel Ganneb81831d2017-12-05 17:33:37 +010033/* Converts all ones/zeros compare mask to bitmap. */
34always_inline u32
Lijian Zhanga22ba882018-10-25 18:50:33 +080035u8x16_compare_byte_mask (u8x16 v)
Gabriel Ganneb81831d2017-12-05 17:33:37 +010036{
Lijian Zhanga22ba882018-10-25 18:50:33 +080037 uint8x16_t mask = { 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80,
38 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80
39 };
40 /* v --> [0xFF, 0x00, 0xFF, 0xFF, 0xFF, 0x00, 0xFF, 0x00, ... ] */
41 uint8x16_t x = vandq_u8 (v, mask);
42 /* after v & mask,
43 * x --> [0x01, 0x00, 0x04, 0x08, 0x10, 0x00, 0x40, 0x00, ... ] */
44 uint64x2_t x64 = vpaddlq_u32 (vpaddlq_u16 (vpaddlq_u8 (x)));
45 /* after merge, x64 --> [0x5D, 0x.. ] */
46 return (u32) (vgetq_lane_u64 (x64, 0) + (vgetq_lane_u64 (x64, 1) << 8));
Gabriel Ganneb81831d2017-12-05 17:33:37 +010047}
Christophe Fontaine33e81952016-12-19 14:41:52 +010048
Sirshak Das536953d2018-06-26 13:08:46 -050049/* *INDENT-OFF* */
50#define foreach_neon_vec128i \
51 _(i,8,16,s8) _(i,16,8,s16) _(i,32,4,s32) _(i,64,2,s64)
52#define foreach_neon_vec128u \
53 _(u,8,16,u8) _(u,16,8,u16) _(u,32,4,u32) _(u,64,2,u64)
54#define foreach_neon_vec128f \
55 _(f,32,4,f32) _(f,64,2,f64)
Adrian Oanca22ac59b2018-02-23 16:27:41 +010056
Sirshak Das536953d2018-06-26 13:08:46 -050057#define _(t, s, c, i) \
58static_always_inline t##s##x##c \
59t##s##x##c##_splat (t##s x) \
60{ return (t##s##x##c) vdupq_n_##i (x); } \
61\
62static_always_inline t##s##x##c \
63t##s##x##c##_load_unaligned (void *p) \
64{ return (t##s##x##c) vld1q_##i (p); } \
65\
66static_always_inline void \
67t##s##x##c##_store_unaligned (t##s##x##c v, void *p) \
68{ vst1q_##i (p, v); } \
69\
70static_always_inline int \
71t##s##x##c##_is_all_zero (t##s##x##c x) \
Lijian.Zhange6a47cf2019-03-12 18:32:39 +080072{ return !!(vminvq_u##s (vceqq_##i (vdupq_n_##i(0), x))); } \
Sirshak Das536953d2018-06-26 13:08:46 -050073\
74static_always_inline int \
75t##s##x##c##_is_equal (t##s##x##c a, t##s##x##c b) \
Lijian.Zhange6a47cf2019-03-12 18:32:39 +080076{ return !!(vminvq_u##s (vceqq_##i (a, b))); } \
Sirshak Das536953d2018-06-26 13:08:46 -050077\
78static_always_inline int \
79t##s##x##c##_is_all_equal (t##s##x##c v, t##s x) \
80{ return t##s##x##c##_is_equal (v, t##s##x##c##_splat (x)); }; \
Lijian Zhangf5942d52018-10-31 13:35:20 +080081\
82static_always_inline u32 \
83t##s##x##c##_zero_byte_mask (t##s##x##c x) \
84{ uint8x16_t v = vreinterpretq_u8_u##s (vceqq_##i (vdupq_n_##i(0), x)); \
85 return u8x16_compare_byte_mask (v); } \
Lijian.Zhang37c83782019-04-04 15:26:26 +080086\
87static_always_inline u##s##x##c \
88t##s##x##c##_is_greater (t##s##x##c a, t##s##x##c b) \
89{ return (u##s##x##c) vcgtq_##i (a, b); } \
90\
91static_always_inline t##s##x##c \
92t##s##x##c##_blend (t##s##x##c dst, t##s##x##c src, u##s##x##c mask) \
93{ return (t##s##x##c) vbslq_##i (mask, src, dst); }
Adrian Oanca22ac59b2018-02-23 16:27:41 +010094
Sirshak Das536953d2018-06-26 13:08:46 -050095foreach_neon_vec128i foreach_neon_vec128u
96
97#undef _
98/* *INDENT-ON* */
99
Sirshak Dasafc725a2018-07-27 01:13:33 -0500100static_always_inline u16x8
101u16x8_byte_swap (u16x8 v)
102{
Sirshak Das6da42de2018-08-22 12:02:04 +0800103 return (u16x8) vrev16q_u8 ((u8x16) v);
Sirshak Dasafc725a2018-07-27 01:13:33 -0500104}
105
106static_always_inline u8x16
107u8x16_shuffle (u8x16 v, u8x16 m)
108{
109 return (u8x16) vqtbl1q_u8 (v, m);
110}
111
Sirshak Das61f325d2018-08-03 11:24:51 -0500112static_always_inline u32x4
113u32x4_hadd (u32x4 v1, u32x4 v2)
114{
115 return (u32x4) vpaddq_u32 (v1, v2);
116}
117
Sirshak Das8e5d5db2018-08-22 14:04:33 +0800118static_always_inline u64x2
119u32x4_extend_to_u64x2 (u32x4 v)
120{
121 return vmovl_u32 (vget_low_u32 (v));
122}
123
Sirshak Das759226e2018-08-22 08:46:52 +0800124static_always_inline u64x2
125u32x4_extend_to_u64x2_high (u32x4 v)
126{
Sirshak Das4f611172018-10-09 11:28:44 -0500127 return vmovl_high_u32 (v);
Sirshak Das759226e2018-08-22 08:46:52 +0800128}
129
Lijian Zhanga22ba882018-10-25 18:50:33 +0800130/* Creates a mask made up of the MSB of each byte of the source vector */
131static_always_inline u16
132u8x16_msb_mask (u8x16 v)
133{
134 int8x16_t shift =
135 { -7, -6, -5, -4, -3, -2, -1, 0, -7, -6, -5, -4, -3, -2, -1, 0 };
136 /* v --> [0x80, 0x7F, 0xF0, 0xAF, 0xF0, 0x00, 0xF2, 0x00, ... ] */
137 uint8x16_t x = vshlq_u8 (vandq_u8 (v, vdupq_n_u8 (0x80)), shift);
138 /* after (v & 0x80) >> shift,
139 * x --> [0x01, 0x00, 0x04, 0x08, 0x10, 0x00, 0x40, 0x00, ... ] */
140 uint64x2_t x64 = vpaddlq_u32 (vpaddlq_u16 (vpaddlq_u8 (x)));
141 /* after merge, x64 --> [0x5D, 0x.. ] */
142 return (u16) (vgetq_lane_u64 (x64, 0) + (vgetq_lane_u64 (x64, 1) << 8));
143}
144
Lijian.Zhang107aa832019-05-29 17:08:47 +0800145static_always_inline u64x2
146u64x2_gather (void *p0, void *p1)
147{
148 u64x2 r = vdupq_n_u64 (*(u64 *) p0);
149 r = vsetq_lane_u64 (*(u64 *) p1, r, 1);
150 return r;
151}
152
153static_always_inline u32x4
154u32x4_gather (void *p0, void *p1, void *p2, void *p3)
155{
156 u32x4 r = vdupq_n_u32 (*(u32 *) p0);
157 r = vsetq_lane_u32 (*(u32 *) p1, r, 1);
158 r = vsetq_lane_u32 (*(u32 *) p2, r, 2);
159 r = vsetq_lane_u32 (*(u32 *) p3, r, 3);
160 return r;
161}
162
Lijian.Zhang0f984512019-05-29 17:13:42 +0800163static_always_inline void
164u64x2_scatter (u64x2 r, void *p0, void *p1)
165{
166 *(u64 *) p0 = vgetq_lane_u64 (r, 0);
167 *(u64 *) p1 = vgetq_lane_u64 (r, 1);
168}
169
170static_always_inline void
171u32x4_scatter (u32x4 r, void *p0, void *p1, void *p2, void *p3)
172{
173 *(u32 *) p0 = vgetq_lane_u32 (r, 0);
174 *(u32 *) p1 = vgetq_lane_u32 (r, 1);
175 *(u32 *) p2 = vgetq_lane_u32 (r, 2);
176 *(u32 *) p3 = vgetq_lane_u32 (r, 3);
177}
178
Damjan Marion776644e2020-01-31 10:24:07 +0100179static_always_inline u32
180u32x4_min_scalar (u32x4 v)
181{
182 return vminvq_u32 (v);
183}
184
Lijian Zhanga22ba882018-10-25 18:50:33 +0800185#define CLIB_HAVE_VEC128_MSB_MASK
186
Sirshak Das536953d2018-06-26 13:08:46 -0500187#define CLIB_HAVE_VEC128_UNALIGNED_LOAD_STORE
188#define CLIB_VEC128_SPLAT_DEFINED
Christophe Fontaine33e81952016-12-19 14:41:52 +0100189#endif /* included_vector_neon_h */
190
191/*
192 * fd.io coding-style-patch-verification: ON
193 *
194 * Local Variables:
195 * eval: (c-set-style "gnu")
196 * End:
197 */