ref: ba9519781df047104b22bd2285e2d608253812f1
parent: 63dc379b326e11226c34c807f210bb92af6fe602
author: Ori Bernstein <[email protected]>
date: Sat Sep 22 11:19:10 EDT 2018
Compile on 32 bits.
--- a/util/bitset.c
+++ b/util/bitset.c
@@ -112,8 +112,8 @@
return n;
}
-inline
-static int firstbit(size_t b)
+static inline int
+firstbit(uint64_t b)
{
int n;
static const char bits[] = {
--- a/util/htab.c
+++ b/util/htab.c
@@ -123,8 +123,7 @@
i = (h + di) & (ht->sz - 1);
}
ht->nelt++;
-conflicted
-:
+conflicted:
if (ht->dead[i])
ht->ndead--;
ht->hashes[i] = h;
@@ -152,8 +151,7 @@
h = hash(ht, k);
i = h & (ht->sz - 1);
while (ht->hashes[i] && !ht->dead[i] && ht->hashes[i] != h) {
-searchmore
-:
+searchmore:
di++;
i = (h + di) & (ht->sz - 1);
}