prenex/magyarsort
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

less branchless mor... not good I think

Browse Source
This commit is contained in:
Richard Thier 2024-04-11 19:57:58 +02:00
parent 3f4b17f0ef
commit 8e8d4257bc
1 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
ypsu.cpp
View File

@ -150,7 +150,7 @@ static inline uint32_t morgrab(uint32_t elem) noexcept {
}
template<int j>
static inline void mormord_sort_impl(uint32_t *a, int n) noexcept {
/* Edge-case */
// Early-exit the edge-case
if(n == 0) return;
/* Preparation */
@ -187,13 +187,16 @@ static inline void mormord_sort_impl(uint32_t *a, int n) noexcept {
uint32_t reali = 0;
#pragma GCC unroll 16
for(int i = 0; i < 256; ++i) {
radics[i] += prev;
if(radics[i] != 0) {
radics[i] += prev;
real_radics[reali] = prev;
real_radics[reali + 1] = radics[i];
prev = radics[i];
reali += 2;
} else {
radics[i] += prev;
prev = radics[i];
}
prev = radics[i];
}