#include <sys/wait.h>
#include <unistd.h>
#include <stdio.h>
-#include <assert.h>
#include <errno.h>
#include <signal.h>
+#include <urcu/assert.h>
#include <urcu/tls-compat.h>
#include <compat-rand.h>
-#include "cpuset.h"
#include "thread-id.h"
#include "../common/debug-yield.h"
/*----------------------------------- handle the last 3 uint32_t's */
switch (length) { /* all the case statements fall through */
- case 3: c += k[2];
- case 2: b += k[1];
+ case 3: c += k[2]; /* fall through */
+ case 2: b += k[1]; /* fall through */
case 1: a += k[0];
final(a, b, c);
+ /* fall through */
case 0: /* case 0: nothing left to add */
break;
}
{
unsigned int key = (unsigned int) _key;
- assert(length == sizeof(unsigned int));
+ urcu_posix_assert(length == sizeof(unsigned int));
return hash_u32(&key, 1, seed);
}
#else
uint32_t v32[2];
} key;
- assert(length == sizeof(unsigned long));
+ urcu_posix_assert(length == sizeof(unsigned long));
v.v64 = (uint64_t) seed;
key.v64 = (uint64_t) _key;
hashword2(key.v32, 2, &v.v32[0], &v.v32[1]);
} else {
unsigned long v;
- assert(length == sizeof(unsigned long));
+ urcu_posix_assert(length == sizeof(unsigned long));
v = (unsigned long) _key;
return v % nr_hash_chains;
}
void cds_lfht_test_lookup(struct cds_lfht *ht, void *key, size_t key_len,
struct cds_lfht_iter *iter)
{
- assert(key_len == sizeof(unsigned long));
+ urcu_posix_assert(key_len == sizeof(unsigned long));
cds_lfht_lookup(ht, test_hash(key, key_len, TEST_HASH_SEED),
test_match, key, iter);