/*
- * test_ht.c
+ * test_urcu_hash.c
*
* Userspace RCU library - test program
*
#include <unistd.h>
#include <stdio.h>
#include <assert.h>
-#include <sys/syscall.h>
#include <sched.h>
-#include <urcu-ht.h>
-#include <urcu-defer.h>
#include <errno.h>
-#include "../arch.h"
+#ifdef __linux__
+#include <syscall.h>
+#endif
-#define HASH_SIZE 32
-#define RAND_POOL 1000
+#define DEFAULT_HASH_SIZE 32
+#define DEFAULT_RAND_POOL 1000000
/* Make this big enough to include the POWER5+ L3 cacheline size of 256B */
#define CACHE_LINE_SIZE 4096
/* hardcoded number of CPUs */
#define NR_CPUS 16384
+#ifdef POISON_FREE
+#define poison_free(ptr) \
+ do { \
+ memset(ptr, 0x42, sizeof(*(ptr))); \
+ free(ptr); \
+ } while (0)
+#else
+#define poison_free(ptr) free(ptr)
+#endif
+
+
+
#if defined(_syscall0)
_syscall0(pid_t, gettid)
#elif defined(__NR_gettid)
#else
#define debug_yield_read()
#endif
-#include "../urcu.h"
+#include <urcu-qsbr.h>
+#include <urcu/rculfhash.h>
+#include <urcu-call-rcu.h>
+
+struct wr_count {
+ unsigned long update_ops;
+ unsigned long add;
+ unsigned long add_exist;
+ unsigned long remove;
+};
static unsigned int __thread rand_lookup;
static unsigned long __thread nr_add;
static unsigned long __thread lookup_fail;
static unsigned long __thread lookup_ok;
-static struct rcu_ht *test_ht;
+static struct cds_lfht *test_ht;
struct test_data {
int a;
/* read-side C.S. duration, in loops */
static unsigned long rduration;
+static unsigned long init_hash_size = DEFAULT_HASH_SIZE;
+static unsigned long init_populate;
+static unsigned long rand_pool = DEFAULT_RAND_POOL;
+static int opt_auto_resize;
+static int add_only, add_unique;
+
+static unsigned long init_pool_offset, lookup_pool_offset, write_pool_offset;
+
static inline void loop_sleep(unsigned long l)
{
while(l-- != 0)
- cpu_relax();
+ caa_cpu_relax();
}
static int verbose_mode;
#define printf_verbose(fmt, args...) \
do { \
if (verbose_mode) \
- printf(fmt, args); \
+ printf(fmt, ## args); \
} while (0)
static unsigned int cpu_affinities[NR_CPUS];
sched_setaffinity(0, sizeof(mask), &mask);
}
+static enum {
+ AR_RANDOM = 0,
+ AR_ADD = 1,
+ AR_REMOVE = -1,
+} addremove; /* 1: add, -1 remove, 0: random */
+
+static
+void sigusr1_handler(int signo)
+{
+ switch (addremove) {
+ case AR_ADD:
+ printf("Add/Remove: random.\n");
+ addremove = AR_RANDOM;
+ break;
+ case AR_RANDOM:
+ printf("Add/Remove: remove only.\n");
+ addremove = AR_REMOVE;
+ break;
+ case AR_REMOVE:
+ printf("Add/Remove: add only.\n");
+ addremove = AR_ADD;
+ break;
+ }
+}
+
/*
* returns 0 if test should end.
*/
}
}
-#define ARRAY_POISON 0xDEADBEEF
+/*
+ * Hash function
+ * Source: http://burtleburtle.net/bob/c/lookup3.c
+ * Originally Public Domain
+ */
+
+#define rot(x, k) (((x) << (k)) | ((x) >> (32 - (k))))
+
+#define mix(a, b, c) \
+do { \
+ a -= c; a ^= rot(c, 4); c += b; \
+ b -= a; b ^= rot(a, 6); a += c; \
+ c -= b; c ^= rot(b, 8); b += a; \
+ a -= c; a ^= rot(c, 16); c += b; \
+ b -= a; b ^= rot(a, 19); a += c; \
+ c -= b; c ^= rot(b, 4); b += a; \
+} while (0)
+
+#define final(a, b, c) \
+{ \
+ c ^= b; c -= rot(b, 14); \
+ a ^= c; a -= rot(c, 11); \
+ b ^= a; b -= rot(a, 25); \
+ c ^= b; c -= rot(b, 16); \
+ a ^= c; a -= rot(c, 4);\
+ b ^= a; b -= rot(a, 14); \
+ c ^= b; c -= rot(b, 24); \
+}
+
+static __attribute__((unused))
+uint32_t hash_u32(
+ const uint32_t *k, /* the key, an array of uint32_t values */
+ size_t length, /* the length of the key, in uint32_ts */
+ uint32_t initval) /* the previous hash, or an arbitrary value */
+{
+ uint32_t a, b, c;
+
+ /* Set up the internal state */
+ a = b = c = 0xdeadbeef + (((uint32_t) length) << 2) + initval;
+
+ /*----------------------------------------- handle most of the key */
+ while (length > 3) {
+ a += k[0];
+ b += k[1];
+ c += k[2];
+ mix(a, b, c);
+ length -= 3;
+ k += 3;
+ }
+
+ /*----------------------------------- 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 1: a += k[0];
+ final(a, b, c);
+ case 0: /* case 0: nothing left to add */
+ break;
+ }
+ /*---------------------------------------------- report the result */
+ return c;
+}
+
+static
+void hashword2(
+ const uint32_t *k, /* the key, an array of uint32_t values */
+ size_t length, /* the length of the key, in uint32_ts */
+ uint32_t *pc, /* IN: seed OUT: primary hash value */
+ uint32_t *pb) /* IN: more seed OUT: secondary hash value */
+{
+ uint32_t a, b, c;
+
+ /* Set up the internal state */
+ a = b = c = 0xdeadbeef + ((uint32_t) (length << 2)) + *pc;
+ c += *pb;
+
+ /*----------------------------------------- handle most of the key */
+ while (length > 3) {
+ a += k[0];
+ b += k[1];
+ c += k[2];
+ mix(a, b, c);
+ length -= 3;
+ k += 3;
+ }
+
+ /*----------------------------------- 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 1: a += k[0];
+ final(a, b, c);
+ case 0: /* case 0: nothing left to add */
+ break;
+ }
+ /*---------------------------------------------- report the result */
+ *pc = c;
+ *pb = b;
+}
+
+#if (CAA_BITS_PER_LONG == 32)
+static
+unsigned long test_hash(void *_key, size_t length, unsigned long seed)
+{
+ unsigned long key = (unsigned long) _key;
+ unsigned long v;
+
+ assert(length == sizeof(unsigned long));
+ return hash_u32(&v, 1, seed);
+}
+#else
+static
+unsigned long test_hash(void *_key, size_t length, unsigned long seed)
+{
+ union {
+ uint64_t v64;
+ uint32_t v32[2];
+ } v;
+ union {
+ uint64_t v64;
+ uint32_t v32[2];
+ } key;
+
+ 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]);
+ return v.v64;
+}
+#endif
+
+static
+unsigned long test_compare(void *key1, size_t key1_len,
+ void *key2, size_t key2_len)
+{
+ if (unlikely(key1_len != key2_len))
+ return -1;
+ assert(key1_len == sizeof(unsigned long));
+ if (key1 == key2)
+ return 0;
+ else
+ return 1;
+}
void *thr_reader(void *_count)
{
unsigned long long *count = _count;
- struct test_data *local_ptr;
+ struct cds_lfht_node *node;
printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
"reader", pthread_self(), (unsigned long)gettid());
while (!test_go)
{
}
- smp_mb();
+ cmm_smp_mb();
for (;;) {
rcu_read_lock();
- local_ptr = ht_lookup(test_ht,
- (void *)(unsigned long)(rand_r(&rand_lookup) % RAND_POOL));
- if (local_ptr == NULL)
+ node = cds_lfht_lookup(test_ht,
+ (void *)(unsigned long)((rand_r(&rand_lookup) % rand_pool) + lookup_pool_offset),
+ sizeof(void *));
+ if (node == NULL)
lookup_fail++;
else
lookup_ok++;
nr_reads++;
if (unlikely(!test_duration_read()))
break;
+ if (unlikely((nr_reads & ((1 << 10) - 1)) == 0))
+ rcu_quiescent_state();
}
rcu_unregister_thread();
}
+static
+void free_node_cb(struct rcu_head *head)
+{
+ struct cds_lfht_node *node =
+ caa_container_of(head, struct cds_lfht_node, head);
+ free(node);
+}
+
void *thr_writer(void *_count)
{
- unsigned long long *count = _count;
- struct test_data *data;
+ struct cds_lfht_node *node, *ret_node;
+ struct wr_count *count = _count;
int ret;
printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
set_affinity();
rcu_register_thread();
- rcu_defer_register_thread();
while (!test_go)
{
}
- smp_mb();
+ cmm_smp_mb();
for (;;) {
- if (rand_r(&rand_lookup) & 1) {
- data = malloc(sizeof(struct test_data));
- //rcu_copy_mutex_lock();
- ret = ht_add(test_ht,
- (void *)(unsigned long)(rand_r(&rand_lookup) % RAND_POOL),
- data);
- if (ret == -EEXIST) {
- free(data);
+ if ((addremove == AR_ADD || add_only)
+ || (addremove == AR_RANDOM && rand_r(&rand_lookup) & 1)) {
+ node = malloc(sizeof(struct cds_lfht_node));
+ rcu_read_lock();
+ cds_lfht_node_init(node,
+ (void *)(unsigned long)((rand_r(&rand_lookup) % rand_pool) + write_pool_offset),
+ sizeof(void *));
+ if (add_unique)
+ ret_node = cds_lfht_add_unique(test_ht, node);
+ else
+ cds_lfht_add(test_ht, node);
+ rcu_read_unlock();
+ if (add_unique && ret_node != node) {
+ free(node);
nr_addexist++;
- } else {
+ } else
nr_add++;
- }
- //rcu_copy_mutex_unlock();
} else {
/* May delete */
- //rcu_copy_mutex_lock();
- ret = ht_delete(test_ht,
- (void *)(unsigned long)(rand_r(&rand_lookup) % RAND_POOL));
- if (ret == -ENOENT)
- nr_delnoent++;
+ rcu_read_lock();
+ node = cds_lfht_lookup(test_ht,
+ (void *)(unsigned long)((rand_r(&rand_lookup) % rand_pool) + write_pool_offset),
+ sizeof(void *));
+ if (node)
+ ret = cds_lfht_remove(test_ht, node);
else
+ ret = -ENOENT;
+ rcu_read_unlock();
+ if (ret == 0) {
+ call_rcu(&node->head, free_node_cb);
nr_del++;
- //rcu_copy_mutex_unlock();
+ } else
+ nr_delnoent++;
}
+#if 0
//if (nr_writes % 100000 == 0) {
if (nr_writes % 1000 == 0) {
+ rcu_read_lock();
if (rand_r(&rand_lookup) & 1) {
ht_resize(test_ht, 1);
} else {
ht_resize(test_ht, -1);
}
+ rcu_read_unlock();
}
+#endif //0
nr_writes++;
if (unlikely(!test_duration_write()))
break;
if (unlikely(wdelay))
loop_sleep(wdelay);
+ if (unlikely((nr_writes & ((1 << 10) - 1)) == 0))
+ rcu_quiescent_state();
}
- rcu_defer_unregister_thread();
rcu_unregister_thread();
printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
printf_verbose("info id %lx: nr_add %lu, nr_addexist %lu, nr_del %lu, "
"nr_delnoent %lu\n", pthread_self(), nr_add,
nr_addexist, nr_del, nr_delnoent);
- *count = nr_writes;
+ count->update_ops = nr_writes;
+ count->add = nr_add;
+ count->add_exist = nr_addexist;
+ count->remove = nr_del;
return ((void*)2);
}
+static int populate_hash(void)
+{
+ struct cds_lfht_node *node, *ret_node;
+
+ if (!init_populate)
+ return 0;
+
+ if (add_unique && init_populate * 10 > rand_pool) {
+ printf("WARNING: required to populate %lu nodes (-k), but random "
+"pool is quite small (%lu values) and we are in add_unique (-u) mode. Try with a "
+"larger random pool (-p option).\n", init_populate, rand_pool);
+ return -1;
+ }
+
+ while (nr_add < init_populate) {
+ node = malloc(sizeof(struct cds_lfht_node));
+ cds_lfht_node_init(node,
+ (void *)(unsigned long)((rand_r(&rand_lookup) % rand_pool) + init_pool_offset),
+ sizeof(void *));
+ if (add_unique)
+ ret_node = cds_lfht_add_unique(test_ht, node);
+ else
+ cds_lfht_add(test_ht, node);
+ if (add_unique && ret_node != node) {
+ free(node);
+ nr_addexist++;
+ } else
+ nr_add++;
+ nr_writes++;
+ }
+ return 0;
+}
+
void show_usage(int argc, char **argv)
{
printf("Usage : %s nr_readers nr_writers duration (s)", argv[0]);
printf(" [-c duration] (reader C.S. duration (in loops))");
printf(" [-v] (verbose output)");
printf(" [-a cpu#] [-a cpu#]... (affinity)");
+ printf(" [-p size] (random key value pool size)");
+ printf(" [-h size] (initial hash table size)");
+ printf(" [-u] Uniquify add.");
+ printf(" [-i] Add only (no removal).");
+ printf(" [-k nr_nodes] Number of nodes to insert initially.");
+ printf(" [-A] Automatically resize hash table.");
+ printf(" [-R offset] Lookup pool offset\n");
+ printf(" [-S offset] Write pool offset\n");
+ printf(" [-T offset] Init pool offset\n");
printf("\n");
}
int err;
pthread_t *tid_reader, *tid_writer;
void *tret;
- unsigned long long *count_reader, *count_writer;
- unsigned long long tot_reads = 0, tot_writes = 0;
+ unsigned long long *count_reader;
+ struct wr_count *count_writer;
+ unsigned long long tot_reads = 0, tot_writes = 0,
+ tot_add = 0, tot_add_exist = 0, tot_remove = 0;
+ unsigned long count, removed;
int i, a, ret;
+ struct sigaction act;
+ unsigned int remain;
if (argc < 4) {
show_usage(argc, argv);
case 'v':
verbose_mode = 1;
break;
+ case 'p':
+ if (argc < i + 2) {
+ show_usage(argc, argv);
+ return -1;
+ }
+ rand_pool = atol(argv[++i]);
+ break;
+ case 'h':
+ if (argc < i + 2) {
+ show_usage(argc, argv);
+ return -1;
+ }
+ init_hash_size = atol(argv[++i]);
+ break;
+ case 'u':
+ add_unique = 1;
+ break;
+ case 'i':
+ add_only = 1;
+ break;
+ case 'k':
+ init_populate = atol(argv[++i]);
+ break;
+ case 'A':
+ opt_auto_resize = 1;
+ break;
+ case 'R':
+ lookup_pool_offset = atol(argv[++i]);
+ break;
+ case 'S':
+ write_pool_offset = atol(argv[++i]);
+ break;
+ case 'T':
+ init_pool_offset = atol(argv[++i]);
+ break;
+
}
}
+ /* Check if hash size is power of 2 */
+ if (init_hash_size && init_hash_size & (init_hash_size - 1)) {
+ printf("Error: Hash table size %lu is not a power of 2.\n",
+ init_hash_size);
+ return -1;
+ }
+
+ memset(&act, 0, sizeof(act));
+ ret = sigemptyset(&act.sa_mask);
+ if (ret == -1) {
+ perror("sigemptyset");
+ return -1;
+ }
+ act.sa_handler = sigusr1_handler;
+ act.sa_flags = SA_RESTART;
+ ret = sigaction(SIGUSR1, &act, NULL);
+ if (ret == -1) {
+ perror("sigaction");
+ return -1;
+ }
+
printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
duration, nr_readers, nr_writers);
printf_verbose("Writer delay : %lu loops.\n", wdelay);
printf_verbose("Reader duration : %lu loops.\n", rduration);
+ printf_verbose("Random pool size : %lu.\n", rand_pool);
+ printf_verbose("Mode:%s%s.\n",
+ add_only ? " add only" : " add/remove",
+ add_unique ? " uniquify" : "");
+ printf_verbose("Initial hash table size: %lu buckets.\n", init_hash_size);
printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
"main", pthread_self(), (unsigned long)gettid());
tid_writer = malloc(sizeof(*tid_writer) * nr_writers);
count_reader = malloc(sizeof(*count_reader) * nr_readers);
count_writer = malloc(sizeof(*count_writer) * nr_writers);
- test_ht = ht_new(ht_jhash, free, HASH_SIZE, sizeof(unsigned long),
- 43223455);
+ test_ht = cds_lfht_new(test_hash, test_compare, 0x42UL,
+ init_hash_size,
+ opt_auto_resize ? CDS_LFHT_AUTO_RESIZE : 0,
+ call_rcu, synchronize_rcu, rcu_read_lock,
+ rcu_read_unlock, rcu_thread_offline,
+ rcu_thread_online);
+ ret = populate_hash();
+ assert(!ret);
+ err = create_all_cpu_call_rcu_data(0);
+ assert(!err);
+
next_aff = 0;
for (i = 0; i < nr_readers; i++) {
exit(1);
}
- smp_mb();
+ cmm_smp_mb();
test_go = 1;
- sleep(duration);
+ remain = duration;
+ do {
+ remain = sleep(remain);
+ } while (remain > 0);
test_stop = 1;
err = pthread_join(tid_writer[i], &tret);
if (err != 0)
exit(1);
- tot_writes += count_writer[i];
+ tot_writes += count_writer[i].update_ops;
+ tot_add += count_writer[i].add;
+ tot_add_exist += count_writer[i].add_exist;
+ tot_remove += count_writer[i].remove;
}
- rcu_register_thread();
- rcu_defer_register_thread();
- ret = ht_destroy(test_ht);
- rcu_defer_unregister_thread();
- rcu_unregister_thread();
-
- printf_verbose("final delete: %d items\n", ret);
+ printf("Counting nodes... ");
+ fflush(stdout);
+ cds_lfht_count_nodes(test_ht, &count, &removed);
+ printf("done.\n");
+ if (count || removed)
+ printf("WARNING: nodes left in the hash table upon destroy: "
+ "%lu nodes + %lu logically removed.\n", count, removed);
+ ret = cds_lfht_destroy(test_ht);
+
+ if (ret)
+ printf_verbose("final delete aborted\n");
+ else
+ printf_verbose("final delete success\n");
printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
tot_writes);
printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu "
"nr_writers %3u "
- "wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu\n",
+ "wdelay %6lu rand_pool %12llu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
+ "nr_add %12llu nr_add_fail %12llu nr_remove %12llu nr_leaked %12lld\n",
argv[0], duration, nr_readers, rduration,
- nr_writers, wdelay, tot_reads, tot_writes,
- tot_reads + tot_writes);
+ nr_writers, wdelay, rand_pool, tot_reads, tot_writes,
+ tot_reads + tot_writes, tot_add, tot_add_exist, tot_remove,
+ (long long) tot_add + init_populate - tot_remove - count);
+ free_all_cpu_call_rcu_data();
free(tid_reader);
free(tid_writer);
free(count_reader);