Skip to content

Allow for optimizing out bound check on 64 bit systems #1909

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
natoscott merged 1 commit into from
Feb 19, 2026
+11 −5
Merged

Allow for optimizing out bound check on 64 bit systems #1909

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 11 additions & 5 deletions Hashtable.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -91,18 +91,24 @@ size_t Hashtable_count(const Hashtable* this) {
/* https://oeis.org/A014234 */
static const uint64_t OEISprimes[] = {
7, 13, 31, 61, 127, 251, 509, 1021, 2039, 4093, 8191,
16381, 32749, 65521, 131071, 262139, 524287, 1048573,
16381, 32749, 65521,
#if SIZE_MAX > UINT16_MAX
131071, 262139, 524287, 1048573,
2097143, 4194301, 8388593, 16777213, 33554393,
67108859, 134217689, 268435399, 536870909, 1073741789,
2147483647, 4294967291, 8589934583, 17179869143,
34359738337, 68719476731, 137438953447
2147483647, 4294967291,
#endif
#if SIZE_MAX > UINT32_MAX
8589934583, 17179869143, 34359738337, 68719476731, 137438953447,
#endif
};

static size_t nextPrime(size_t n) {
/* on 32-bit make sure we do not return primes not fitting in size_t */
for (size_t i = 0; i < ARRAYSIZE(OEISprimes) && OEISprimes[i] < SIZE_MAX; i++) {
if (n <= OEISprimes[i])
for (size_t i = 0; i < ARRAYSIZE(OEISprimes); i++) {
if (n <= OEISprimes[i]) {
return OEISprimes[i];
}
}

CRT_fatalError("Hashtable: no prime found");
Expand Down
Loading