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
//! Algorithms for floats
#![allow(unused_attributes)]
/// 128-bit wide algorithm for slices of floating-point numbers
///
/// Note:
///
/// * `_mm_alignr_epi8` requires `SSSE3`
/// * `_mm_test_all_ones` requires `SSE4.1`
macro_rules! floats_128 {
(
$name:ident,
$cpuid:tt,
$id:ident,
$nlanes:expr,
$load:ident,
$cmple:ident,
$and:ident,
$head:ident,
$tail:ident
) => {
#[inline]
#[target_feature(enable = $cpuid)]
pub unsafe fn $name(s: &[$id]) -> usize {
#[cfg(target_arch = "x86")]
use arch::x86::*;
#[cfg(target_arch = "x86_64")]
use arch::x86_64::*;
// The alignment requirements for 128-bit wide vectors is 16 bytes:
const ALIGNMENT: usize = 16;
let mut i: usize = $head!(s, $id, ALIGNMENT);
// ^^^^^^ i is the index of the first element aligned to an
// ALIGNMENT boundary
let n = s.len();
let ap = |o| (s.as_ptr().offset(o as isize)) as *const $id;
// Unroll factor: #of 128-bit vectors processed per loop iteration
const NVECS: usize = 4;
// #lanes in each 128-bit vector
const NLANES: usize = $nlanes;
// Stride: number of elements processed in each loop iteration
// unroll_factor * #lane per vector
const STRIDE: usize = NLANES * NVECS;
// Minimum number of elements required for explicit vectorization.
// Since we need one extra vector to get the last element,
// this is #lanes * (unroll + 1) == stride + #lanes
const MIN_LEN: usize = NLANES * (NVECS + 1);
// Width of the vector lanes in bytes
const EWIDTH: i32 = 128 / 8 / NLANES as i32;
if (n - i) >= MIN_LEN {
let mut current = $load(ap(i + 0 * NLANES)); // [a0,..,a3]
while i < n - STRIDE {
use mem::transmute;
let next0 = $load(ap(i + 1 * NLANES)); // [a4,..,a7]
let next1 = $load(ap(i + 2 * NLANES)); // [a8,..,a11]
let next2 = $load(ap(i + 3 * NLANES)); // [a12,..,a15]
let next3 = $load(ap(i + 4 * NLANES)); // [a16,..a19]
let compare0 = _mm_alignr_epi8(
transmute(next0),
transmute(current),
EWIDTH,
); // [a1,..,a4]
let compare1 = _mm_alignr_epi8(
transmute(next1),
transmute(next0),
EWIDTH,
); // [a5,..,a8]
let compare2 = _mm_alignr_epi8(
transmute(next2),
transmute(next1),
EWIDTH,
); // [a9,..,a12]
let compare3 = _mm_alignr_epi8(
transmute(next3),
transmute(next2),
EWIDTH,
); // [a13,..,a16]
// [a0 <= a1,..,a3 <= a4]
let mask0 = $cmple(current, transmute(compare0));
// [a4 <= a5,..,a7 <= a8]
let mask1 = $cmple(next0, transmute(compare1));
// [a8 <= a9,..,a11 <= a12]
let mask2 = $cmple(next1, transmute(compare2));
// [a12 <= a13,..,a15 <= a16]
let mask3 = $cmple(next2, transmute(compare3));
// mask = mask0 && mask1 && mask2 && mask3
let mask = $and($and(mask0, mask1), $and(mask2, mask3));
// if some le comparison was false, the mask will have some
// bits cleared and this will return 0:
if _mm_test_all_ones(transmute(mask)) == 0 {
return i;
}
current = next3;
i += STRIDE;
}
}
$tail!(s, n, i)
}
};
}
pub mod sse41 {
// `_mm_load_ps` requires `SSE`
// `_mm_cmple_ps` requires `SSE`
// `_mm_and_ps` requires `SSE`
floats_128!(
is_sorted_lt_f32,
"sse4.1",
f32,
4,
_mm_load_ps,
_mm_cmple_ps,
_mm_and_ps,
is_sorted_lt_until_alignment_boundary,
is_sorted_lt_tail
);
// `_mm_load_pd` requires `SSE2`
// `_mm_cmple_pd` requires `SSE2`
// `_mm_and_pd` requires `SSE2`
floats_128!(
is_sorted_lt_f64,
"sse4.1",
f64,
2,
_mm_load_pd,
_mm_cmple_pd,
_mm_and_pd,
is_sorted_lt_until_alignment_boundary,
is_sorted_lt_tail
);
// `_mm_load_ps` requires `SSE`
// `_mm_cmple_ps` requires `SSE`
// `_mm_and_ps` requires `SSE`
floats_128!(
is_sorted_gt_f32,
"sse4.1",
f32,
4,
_mm_load_ps,
_mm_cmpge_ps,
_mm_and_ps,
is_sorted_gt_until_alignment_boundary,
is_sorted_gt_tail
);
// `_mm_load_pd` requires `SSE2`
// `_mm_cmple_pd` requires `SSE2`
// `_mm_and_pd` requires `SSE2`
floats_128!(
is_sorted_gt_f64,
"sse4.1",
f64,
2,
_mm_load_pd,
_mm_cmpge_pd,
_mm_and_pd,
is_sorted_gt_until_alignment_boundary,
is_sorted_gt_tail
);
}
/// 256-bit wide algorithm for slices of floating-point numbers
macro_rules! floats_256 {
($name:ident, $cpuid:tt, $id:ident, $nlanes:expr, $load:ident, $loadu:ident,
$cmp:ident, $cmp_t:ident, $and:ident, $testc:ident, $set1:ident, $ones:expr,
$head:ident, $tail:ident) => {
#[inline]
#[target_feature(enable = $cpuid)]
pub unsafe fn $name(s: &[$id]) -> usize {
#[cfg(target_arch = "x86")]
use arch::x86::*;
#[cfg(target_arch = "x86_64")]
use arch::x86_64::*;
// The alignment requirements for 256-bit wide vectors is 16 bytes:
const ALIGNMENT: usize = 32;
let mut i: usize = $head!(s, $id, ALIGNMENT);
// ^^^^^^ i is the index of the first element aligned to an
// ALIGNMENT boundary
let n = s.len();
let ap = |o| (s.as_ptr().offset(o as isize)) as *const $id;
// Unroll factor: #of 256-bit vectors processed per loop iteration
const NVECS: usize = 4;
// #lanes in each 256-bit vector
const NLANES: usize = $nlanes;
// Stride: number of elements processed in each loop iteration
// unroll_factor * #lane per vector
const STRIDE: usize = NLANES * NVECS;
// Minimum number of elements required for explicit vectorization.
// Since we need one extra vector to get the last element,
// this is #lanes * (unroll + 1) == stride + #lanes
const MIN_LEN: usize = NLANES * (NVECS + 1);
if (n - i) >= MIN_LEN {
while i < n - STRIDE {
use mem::transmute;
let current = $load(ap(i + 0 * NLANES)); // [a0,..,a3]
// == 16 | the last vector of current is the first of next
let next0 = $load(ap(i + 1 * NLANES)); // [a4,..,a7]
let next1 = $load(ap(i + 2 * NLANES)); // [a8,..,a11]
let next2 = $load(ap(i + 3 * NLANES)); // [a12,..,a15]
let compare0 = $loadu(ap(i + 0 * NLANES + 1)); // [a1,..,a8]
let compare1 = $loadu(ap(i + 1 * NLANES + 1)); // [a9,..,a16]
let compare2 = $loadu(ap(i + 2 * NLANES + 1)); // [a17,..,a23]
let compare3 = $loadu(ap(i + 3 * NLANES + 1)); // [a25,..,a32]
// [a0 <= a1,..,a3 <= a4]
let mask0 = $cmp(current, transmute(compare0), $cmp_t);
// [a4 <= a5,..,a7 <= a8]
let mask1 = $cmp(next0, transmute(compare1), $cmp_t);
// [a8 <= a9,..,a11 <= a12]
let mask2 = $cmp(next1, transmute(compare2), $cmp_t);
// [a12 <= a13,..,a15 <= a16]
let mask3 = $cmp(next2, transmute(compare3), $cmp_t);
// mask = mask0 | mask1 | mask2 | mask3
let mask = $and($and(mask0, mask1), $and(mask2, mask3));
// if some le comparison was false the mask won't have all
// bits set and testc returns 0:
if $testc(mask, $set1(transmute($ones))) == 0 {
return i;
}
i += STRIDE;
}
}
$tail!(s, n, i)
}
};
}
pub mod avx {
// `_mm256_load_ps` requires `AVX`
// `_mm256_loadu_ps` requires `AVX`
// `_mm256_cmp_ps` requires `AVX`
// `_mm256_and_ps` requires `AVX`
// `_mm256_testc_ps` requires `AVX`
// `_mm256_set1_ps` requires `AVX`
floats_256!(
is_sorted_lt_f32,
"avx",
f32,
8,
_mm256_load_ps,
_mm256_loadu_ps,
_mm256_cmp_ps,
_CMP_LE_OQ,
_mm256_and_ps,
_mm256_testc_ps,
_mm256_set1_ps,
-1_i32,
is_sorted_lt_until_alignment_boundary,
is_sorted_lt_tail
);
// `_mm256_load_pd` requires `AVX`
// `_mm256_loadu_pd` requires `AVX`
// `_mm256_cmp_pd` requires `AVX`
// `_mm256_and_pd` requires `AVX`
// `_mm256_testc_pd` requires `AVX`
// `_mm256_set1_pd` requires `AVX`
floats_256!(
is_sorted_lt_f64,
"avx",
f64,
4,
_mm256_load_pd,
_mm256_loadu_pd,
_mm256_cmp_pd,
_CMP_LE_OQ,
_mm256_and_pd,
_mm256_testc_pd,
_mm256_set1_pd,
-1_i64,
is_sorted_lt_until_alignment_boundary,
is_sorted_lt_tail
);
// `_mm256_load_ps` requires `AVX`
// `_mm256_loadu_ps` requires `AVX`
// `_mm256_cmp_ps` requires `AVX`
// `_mm256_and_ps` requires `AVX`
// `_mm256_testc_ps` requires `AVX`
// `_mm256_set1_ps` requires `AVX`
floats_256!(
is_sorted_gt_f32,
"avx",
f32,
8,
_mm256_load_ps,
_mm256_loadu_ps,
_mm256_cmp_ps,
_CMP_GE_OQ,
_mm256_and_ps,
_mm256_testc_ps,
_mm256_set1_ps,
-1_i32,
is_sorted_gt_until_alignment_boundary,
is_sorted_gt_tail
);
// `_mm256_load_pd` requires `AVX`
// `_mm256_loadu_pd` requires `AVX`
// `_mm256_cmp_pd` requires `AVX`
// `_mm256_and_pd` requires `AVX`
// `_mm256_testc_pd` requires `AVX`
// `_mm256_set1_pd` requires `AVX`
floats_256!(
is_sorted_gt_f64,
"avx",
f64,
4,
_mm256_load_pd,
_mm256_loadu_pd,
_mm256_cmp_pd,
_CMP_GE_OQ,
_mm256_and_pd,
_mm256_testc_pd,
_mm256_set1_pd,
-1_i64,
is_sorted_gt_until_alignment_boundary,
is_sorted_gt_tail
);
}