kuroko-lang/kuroko
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Use stable loop power calculation

Browse Source
This commit is contained in:
K. Lange 2024-03-19 10:02:14 +09:00
parent 179b4e456a
commit 72b59b7972
1 changed files with 17 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
src/obj_list.c
View File

@ -530,14 +530,6 @@ static struct SortSlice powersort_extend_and_reverse_right(struct SortSlice begi
return j; return j;
} }
#if defined(__TINYC__) || (defined(_MSC_VER) && !defined(__clang__))
static int __builtin_clz(unsigned int x) {
int i = 31;
while (!(x & (1 << i)) && i >= 0) i--;
return 31-i;
}
#endif
/** /**
* @brief Calculate power. * @brief Calculate power.
* *
@ -546,11 +538,23 @@ static int __builtin_clz(unsigned int x) {
*/ */
static size_t powersort_power(size_t begin, size_t end, size_t beginA, size_t beginB, size_t endB) { static size_t powersort_power(size_t begin, size_t end, size_t beginA, size_t beginB, size_t endB) {
size_t n = end - begin; size_t n = end - begin;
unsigned long l2 = beginA + beginB - 2 * begin; unsigned long l = beginA - begin + beginB - begin;
unsigned long r2 = beginB + endB - 2 * begin; unsigned long r = beginB - begin + endB - begin;
unsigned int a = (unsigned int)((l2 << 30) / n); size_t common = 0;
unsigned int b = (unsigned int)((r2 << 30) / n); int digitA = l >= n;
return __builtin_clz(a ^ b); int digitB = r >= n;
while (digitA == digitB) {
common++;
if (digitA) {
l -= n;
r -= n;
}
l <<= 1;
r <<= 1;
digitA = l >= n;
digitB = r >= n;
}
return common + 1;
} }
/** /**