[urcu.git] / tests / test_urcu_hash.c

/*
 * test_ht.c
 *
 * Userspace RCU library - test program
 *
 * Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@polymtl.ca>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License along
 * with this program; if not, write to the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 */

#define _GNU_SOURCE
#include <stdio.h>
#include <pthread.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
#include <stdio.h>
#include <assert.h>
#include <sched.h>
#include <errno.h>

#ifdef __linux__
#include <syscall.h>
#endif

#define HASH_SIZE	32
#define 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

#if defined(_syscall0)
_syscall0(pid_t, gettid)
#elif defined(__NR_gettid)
static inline pid_t gettid(void)
{
	return syscall(__NR_gettid);
}
#else
#warning "use pid as tid"
static inline pid_t gettid(void)
{
	return getpid();
}
#endif

#ifndef DYNAMIC_LINK_TEST
#define _LGPL_SOURCE
#else
#define debug_yield_read()
#endif
#include <urcu.h>
#include <urcu/rculfhash.h>
#include <urcu-call-rcu.h>

struct wr_count {
	unsigned long update_ops;
	unsigned long add;
	unsigned long remove;
};

static unsigned int __thread rand_lookup;
static unsigned long __thread nr_add;
static unsigned long __thread nr_addexist;
static unsigned long __thread nr_del;
static unsigned long __thread nr_delnoent;
static unsigned long __thread lookup_fail;
static unsigned long __thread lookup_ok;

static struct rcu_ht *test_ht;

struct test_data {
	int a;
	int b;
};

static volatile int test_go, test_stop;

static unsigned long wdelay;

static unsigned long duration;

/* read-side C.S. duration, in loops */
static unsigned long rduration;

static inline void loop_sleep(unsigned long l)
{
	while(l-- != 0)
		caa_cpu_relax();
}

static int verbose_mode;

#define printf_verbose(fmt, args...)		\
	do {					\
		if (verbose_mode)		\
			printf(fmt, args);	\
	} while (0)

static unsigned int cpu_affinities[NR_CPUS];
static unsigned int next_aff = 0;
static int use_affinity = 0;

pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;

static void set_affinity(void)
{
	cpu_set_t mask;
	int cpu;
	int ret;

	if (!use_affinity)
		return;

	ret = pthread_mutex_lock(&affinity_mutex);
	if (ret) {
		perror("Error in pthread mutex lock");
		exit(-1);
	}
	cpu = cpu_affinities[next_aff++];
	ret = pthread_mutex_unlock(&affinity_mutex);
	if (ret) {
		perror("Error in pthread mutex unlock");
		exit(-1);
	}
	CPU_ZERO(&mask);
	CPU_SET(cpu, &mask);
	sched_setaffinity(0, sizeof(mask), &mask);
}

/*
 * returns 0 if test should end.
 */
static int test_duration_write(void)
{
	return !test_stop;
}

static int test_duration_read(void)
{
	return !test_stop;
}

static unsigned long long __thread nr_writes;
static unsigned long long __thread nr_reads;

static unsigned int nr_readers;
static unsigned int nr_writers;

pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;

void rcu_copy_mutex_lock(void)
{
	int ret;
	ret = pthread_mutex_lock(&rcu_copy_mutex);
	if (ret) {
		perror("Error in pthread mutex lock");
		exit(-1);
	}
}

void rcu_copy_mutex_unlock(void)
{
	int ret;

	ret = pthread_mutex_unlock(&rcu_copy_mutex);
	if (ret) {
		perror("Error in pthread mutex unlock");
		exit(-1);
	}
}

/*
 * 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 rcu_ht_node *node;

	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
			"reader", pthread_self(), (unsigned long)gettid());

	set_affinity();

	rcu_register_thread();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	for (;;) {
		rcu_read_lock();
		node = ht_lookup(test_ht,
			(void *)(unsigned long)(rand_r(&rand_lookup) % RAND_POOL),
			sizeof(void *));
		if (node == NULL)
			lookup_fail++;
		else
			lookup_ok++;
		debug_yield_read();
		if (unlikely(rduration))
			loop_sleep(rduration);
		rcu_read_unlock();
		nr_reads++;
		if (unlikely(!test_duration_read()))
			break;
	}

	rcu_unregister_thread();

	*count = nr_reads;
	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
			"reader", pthread_self(), (unsigned long)gettid());
	printf_verbose("readid : %lx, lookupfail %lu, lookupok %lu\n",
			pthread_self(), lookup_fail, lookup_ok);
	return ((void*)1);

}

static
void free_node_cb(struct rcu_head *head)
{
	struct rcu_ht_node *node =
		caa_container_of(head, struct rcu_ht_node, head);
	free(node);
}

void *thr_writer(void *_count)
{
	struct rcu_ht_node *node;
	struct wr_count *count = _count;
	int ret;

	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
			"writer", pthread_self(), (unsigned long)gettid());

	set_affinity();

	rcu_register_thread();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	for (;;) {
		if (rand_r(&rand_lookup) & 1) {
			node = malloc(sizeof(struct rcu_ht_node));
			rcu_read_lock();
			ht_node_init(node,
				(void *)(unsigned long)(rand_r(&rand_lookup) % RAND_POOL),
				sizeof(void *));
			ret = ht_add_unique(test_ht, node);
			rcu_read_unlock();
			if (ret) {
				free(node);
				nr_addexist++;
			} else
				nr_add++;
		} else {
			/* May delete */
			rcu_read_lock();
			node = ht_lookup(test_ht,
				(void *)(unsigned long)(rand_r(&rand_lookup) % RAND_POOL),
				sizeof(void *));
			if (node)
				ret = ht_remove(test_ht, node);
			else
				ret = -ENOENT;
			rcu_read_unlock();
			if (ret == 0) {
				call_rcu(&node->head, free_node_cb);
				nr_del++;
			} 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);
	}

	rcu_unregister_thread();

	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
			"writer", pthread_self(), (unsigned long)gettid());
	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->update_ops = nr_writes;
	count->add = nr_add;
	count->remove = nr_del;
	return ((void*)2);
}

void show_usage(int argc, char **argv)
{
	printf("Usage : %s nr_readers nr_writers duration (s)", argv[0]);
#ifdef DEBUG_YIELD
	printf(" [-r] [-w] (yield reader and/or writer)");
#endif
	printf(" [-d delay] (writer period (us))");
	printf(" [-c duration] (reader C.S. duration (in loops))");
	printf(" [-v] (verbose output)");
	printf(" [-a cpu#] [-a cpu#]... (affinity)");
	printf("\n");
}

int main(int argc, char **argv)
{
	int err;
	pthread_t *tid_reader, *tid_writer;
	void *tret;
	unsigned long long *count_reader;
	struct wr_count *count_writer;
	unsigned long long tot_reads = 0, tot_writes = 0,
		tot_add = 0, tot_remove = 0;
	unsigned long count, removed;
	int i, a, ret;

	if (argc < 4) {
		show_usage(argc, argv);
		return -1;
	}

	err = sscanf(argv[1], "%u", &nr_readers);
	if (err != 1) {
		show_usage(argc, argv);
		return -1;
	}

	err = sscanf(argv[2], "%u", &nr_writers);
	if (err != 1) {
		show_usage(argc, argv);
		return -1;
	}
	
	err = sscanf(argv[3], "%lu", &duration);
	if (err != 1) {
		show_usage(argc, argv);
		return -1;
	}

	for (i = 4; i < argc; i++) {
		if (argv[i][0] != '-')
			continue;
		switch (argv[i][1]) {
#ifdef DEBUG_YIELD
		case 'r':
			yield_active |= YIELD_READ;
			break;
		case 'w':
			yield_active |= YIELD_WRITE;
			break;
#endif
		case 'a':
			if (argc < i + 2) {
				show_usage(argc, argv);
				return -1;
			}
			a = atoi(argv[++i]);
			cpu_affinities[next_aff++] = a;
			use_affinity = 1;
			printf_verbose("Adding CPU %d affinity\n", a);
			break;
		case 'c':
			if (argc < i + 2) {
				show_usage(argc, argv);
				return -1;
			}
			rduration = atol(argv[++i]);
			break;
		case 'd':
			if (argc < i + 2) {
				show_usage(argc, argv);
				return -1;
			}
			wdelay = atol(argv[++i]);
			break;
		case 'v':
			verbose_mode = 1;
			break;
		}
	}

	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("thread %-6s, thread id : %lx, tid %lu\n",
			"main", pthread_self(), (unsigned long)gettid());

	tid_reader = malloc(sizeof(*tid_reader) * nr_readers);
	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(test_hash, test_compare, 0x42UL,
			 HASH_SIZE, call_rcu);
	next_aff = 0;

	for (i = 0; i < nr_readers; i++) {
		err = pthread_create(&tid_reader[i], NULL, thr_reader,
				     &count_reader[i]);
		if (err != 0)
			exit(1);
	}
	for (i = 0; i < nr_writers; i++) {
		err = pthread_create(&tid_writer[i], NULL, thr_writer,
				     &count_writer[i]);
		if (err != 0)
			exit(1);
	}

	cmm_smp_mb();

	test_go = 1;

	sleep(duration);

	test_stop = 1;

	for (i = 0; i < nr_readers; i++) {
		err = pthread_join(tid_reader[i], &tret);
		if (err != 0)
			exit(1);
		tot_reads += count_reader[i];
	}
	for (i = 0; i < nr_writers; i++) {
		err = pthread_join(tid_writer[i], &tret);
		if (err != 0)
			exit(1);
		tot_writes += count_writer[i].update_ops;
		tot_add += count_writer[i].add;
		tot_remove += count_writer[i].remove;
	}
	ht_count_nodes(test_ht, &count, &removed);
	if (count || removed)
		printf("WARNING: nodes left in the hash table upon destroy: "
			"%lu nodes + %lu logically removed.\n", count, removed);
	(void) ht_destroy(test_ht);

	printf_verbose("final delete: %d items\n", ret);
	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 "
		"nr_add %12llu nr_remove %12llu nr_leaked %12llu\n",
		argv[0], duration, nr_readers, rduration,
		nr_writers, wdelay, tot_reads, tot_writes,
		tot_reads + tot_writes, tot_add, tot_remove,
		tot_add - tot_remove - count);
	free(tid_reader);
	free(tid_writer);
	free(count_reader);
	free(count_writer);
	return 0;
}
Commit	Line	Data
ab7d5fc6 MD	1	/*
	2	* test_ht.c
	3	*
	4	* Userspace RCU library - test program
	5	*
	6	* Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@polymtl.ca>
	7	*
	8	* This program is free software; you can redistribute it and/or modify
	9	* it under the terms of the GNU General Public License as published by
	10	* the Free Software Foundation; either version 2 of the License, or
	11	* (at your option) any later version.
	12	*
	13	* This program is distributed in the hope that it will be useful,
	14	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	15	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	16	* GNU General Public License for more details.
	17	*
	18	* You should have received a copy of the GNU General Public License along
	19	* with this program; if not, write to the Free Software Foundation, Inc.,
	20	* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
	21	*/
	22
	23	#define _GNU_SOURCE
	24	#include <stdio.h>
	25	#include <pthread.h>
	26	#include <stdlib.h>
	27	#include <string.h>
	28	#include <sys/types.h>
	29	#include <sys/wait.h>
	30	#include <unistd.h>
	31	#include <stdio.h>
	32	#include <assert.h>
ab7d5fc6	33	#include <sched.h>
5e28c532	34	#include <errno.h>
ab7d5fc6	35
abc490a1 MD	36	#ifdef __linux__
	37	#include <syscall.h>
	38	#endif
ab7d5fc6	39
5e28c532	40	#define HASH_SIZE 32
658744f6	41	#define RAND_POOL 1000000
5e28c532	42
ab7d5fc6 MD	43	/* Make this big enough to include the POWER5+ L3 cacheline size of 256B */
	44	#define CACHE_LINE_SIZE 4096
	45
	46	/* hardcoded number of CPUs */
	47	#define NR_CPUS 16384
	48
	49	#if defined(_syscall0)
	50	_syscall0(pid_t, gettid)
	51	#elif defined(__NR_gettid)
	52	static inline pid_t gettid(void)
	53	{
	54	return syscall(__NR_gettid);
	55	}
	56	#else
	57	#warning "use pid as tid"
	58	static inline pid_t gettid(void)
	59	{
	60	return getpid();
	61	}
	62	#endif
	63
	64	#ifndef DYNAMIC_LINK_TEST
	65	#define _LGPL_SOURCE
	66	#else
	67	#define debug_yield_read()
	68	#endif
abc490a1 MD	69	#include <urcu.h>
	70	#include <urcu/rculfhash.h>
	71	#include <urcu-call-rcu.h>
ab7d5fc6	72
b8e1907c MD	73	struct wr_count {
	74	unsigned long update_ops;
	75	unsigned long add;
	76	unsigned long remove;
	77	};
	78
5e28c532 MD	79	static unsigned int __thread rand_lookup;
	80	static unsigned long __thread nr_add;
	81	static unsigned long __thread nr_addexist;
	82	static unsigned long __thread nr_del;
	83	static unsigned long __thread nr_delnoent;
	84	static unsigned long __thread lookup_fail;
	85	static unsigned long __thread lookup_ok;
	86
ab7d5fc6 MD	87	static struct rcu_ht *test_ht;
ab7d5fc6 MD	88
5e28c532	89	struct test_data {
ab7d5fc6	90	int a;
5e28c532	91	int b;
ab7d5fc6 MD	92	};
	93
	94	static volatile int test_go, test_stop;
	95
	96	static unsigned long wdelay;
	97
ab7d5fc6 MD	98	static unsigned long duration;
	99
	100	/* read-side C.S. duration, in loops */
	101	static unsigned long rduration;
	102
	103	static inline void loop_sleep(unsigned long l)
	104	{
	105	while(l-- != 0)
abc490a1	106	caa_cpu_relax();
ab7d5fc6 MD	107	}
	108
	109	static int verbose_mode;
	110
	111	#define printf_verbose(fmt, args...) \
	112	do { \
	113	if (verbose_mode) \
	114	printf(fmt, args); \
	115	} while (0)
	116
	117	static unsigned int cpu_affinities[NR_CPUS];
	118	static unsigned int next_aff = 0;
	119	static int use_affinity = 0;
	120
	121	pthread_mutex_t affinity_mutex = PTHREAD_MUTEX_INITIALIZER;
	122
	123	static void set_affinity(void)
	124	{
	125	cpu_set_t mask;
	126	int cpu;
	127	int ret;
	128
	129	if (!use_affinity)
	130	return;
	131
	132	ret = pthread_mutex_lock(&affinity_mutex);
	133	if (ret) {
	134	perror("Error in pthread mutex lock");
	135	exit(-1);
	136	}
	137	cpu = cpu_affinities[next_aff++];
	138	ret = pthread_mutex_unlock(&affinity_mutex);
	139	if (ret) {
	140	perror("Error in pthread mutex unlock");
	141	exit(-1);
	142	}
	143	CPU_ZERO(&mask);
	144	CPU_SET(cpu, &mask);
	145	sched_setaffinity(0, sizeof(mask), &mask);
	146	}
	147
	148	/*
	149	* returns 0 if test should end.
	150	*/
	151	static int test_duration_write(void)
	152	{
	153	return !test_stop;
	154	}
	155
	156	static int test_duration_read(void)
	157	{
	158	return !test_stop;
	159	}
	160
	161	static unsigned long long __thread nr_writes;
	162	static unsigned long long __thread nr_reads;
	163
	164	static unsigned int nr_readers;
	165	static unsigned int nr_writers;
	166
	167	pthread_mutex_t rcu_copy_mutex = PTHREAD_MUTEX_INITIALIZER;
	168
	169	void rcu_copy_mutex_lock(void)
	170	{
171	int ret;
172	ret = pthread_mutex_lock(&rcu_copy_mutex);
173	if (ret) {
174	perror("Error in pthread mutex lock");
175	exit(-1);
176	}
177	}
178
179	void rcu_copy_mutex_unlock(void)
180	{
181	int ret;
182
183	ret = pthread_mutex_unlock(&rcu_copy_mutex);
184	if (ret) {
185	perror("Error in pthread mutex unlock");
186	exit(-1);
187	}
188	}
189
732ad076 MD	190	/*
	191	* Hash function
	192	* Source: http://burtleburtle.net/bob/c/lookup3.c
	193	* Originally Public Domain
	194	*/
	195
	196	#define rot(x, k) (((x) << (k)) \| ((x) >> (32 - (k))))
	197
	198	#define mix(a, b, c) \
	199	do { \
	200	a -= c; a ^= rot(c, 4); c += b; \
	201	b -= a; b ^= rot(a, 6); a += c; \
	202	c -= b; c ^= rot(b, 8); b += a; \
	203	a -= c; a ^= rot(c, 16); c += b; \
	204	b -= a; b ^= rot(a, 19); a += c; \
	205	c -= b; c ^= rot(b, 4); b += a; \
	206	} while (0)
	207
	208	#define final(a, b, c) \
	209	{ \
	210	c ^= b; c -= rot(b, 14); \
	211	a ^= c; a -= rot(c, 11); \
	212	b ^= a; b -= rot(a, 25); \
	213	c ^= b; c -= rot(b, 16); \
	214	a ^= c; a -= rot(c, 4);\
	215	b ^= a; b -= rot(a, 14); \
	216	c ^= b; c -= rot(b, 24); \
	217	}
	218
	219	static __attribute__((unused))
	220	uint32_t hash_u32(
	221	const uint32_t k, / the key, an array of uint32_t values */
	222	size_t length, /* the length of the key, in uint32_ts */
	223	uint32_t initval) /* the previous hash, or an arbitrary value */
	224	{
	225	uint32_t a, b, c;
	226
	227	/* Set up the internal state */
	228	a = b = c = 0xdeadbeef + (((uint32_t) length) << 2) + initval;
	229
	230	/----------------------------------------- handle most of the key /
	231	while (length > 3) {
	232	a += k[0];
	233	b += k[1];
	234	c += k[2];
	235	mix(a, b, c);
	236	length -= 3;
	237	k += 3;
	238	}
	239
	240	/----------------------------------- handle the last 3 uint32_t's /
	241	switch (length) { /* all the case statements fall through */
	242	case 3: c += k[2];
	243	case 2: b += k[1];
	244	case 1: a += k[0];
	245	final(a, b, c);
	246	case 0: /* case 0: nothing left to add */
	247	break;
	248	}
	249	/---------------------------------------------- report the result /
	250	return c;
	251	}
	252
	253	static
254	void hashword2(
255	const uint32_t k, / the key, an array of uint32_t values */
256	size_t length, /* the length of the key, in uint32_ts */
257	uint32_t pc, / IN: seed OUT: primary hash value */
258	uint32_t pb) / IN: more seed OUT: secondary hash value */
259	{
260	uint32_t a, b, c;
261
262	/* Set up the internal state */
263	a = b = c = 0xdeadbeef + ((uint32_t) (length << 2)) + *pc;
264	c += *pb;
265
266	/----------------------------------------- handle most of the key /
267	while (length > 3) {
268	a += k[0];
269	b += k[1];
270	c += k[2];
271	mix(a, b, c);
272	length -= 3;
273	k += 3;
274	}
275
276	/----------------------------------- handle the last 3 uint32_t's /
277	switch (length) { /* all the case statements fall through */
278	case 3: c += k[2];
279	case 2: b += k[1];
280	case 1: a += k[0];
281	final(a, b, c);
282	case 0: /* case 0: nothing left to add */
283	break;
284	}
285	/---------------------------------------------- report the result /
286	*pc = c;
287	*pb = b;
288	}
289
290	#if (CAA_BITS_PER_LONG == 32)
abc490a1	291	static
732ad076	292	unsigned long test_hash(void *_key, size_t length, unsigned long seed)
abc490a1	293	{
abc490a1 MD	294	unsigned long key = (unsigned long) _key;
	295	unsigned long v;
	296
732ad076 MD	297	assert(length == sizeof(unsigned long));
	298	return hash_u32(&v, 1, seed);
	299	}
	300	#else
	301	static
	302	unsigned long test_hash(void *_key, size_t length, unsigned long seed)
	303	{
	304	union {
	305	uint64_t v64;
	306	uint32_t v32[2];
	307	} v;
	308	union {
	309	uint64_t v64;
	310	uint32_t v32[2];
	311	} key;
	312
	313	assert(length == sizeof(unsigned long));
	314	v.v64 = (uint64_t) seed;
	315	key.v64 = (uint64_t) _key;
	316	hashword2(key.v32, 2, &v.v32[0], &v.v32[1]);
	317	return v.v64;
	318	}
	319	#endif
abc490a1	320
732ad076 MD	321	static
	322	unsigned long test_compare(void *key1, size_t key1_len,
	323	void *key2, size_t key2_len)
	324	{
	325	if (unlikely(key1_len != key2_len))
	326	return -1;
	327	assert(key1_len == sizeof(unsigned long));
	328	if (key1 == key2)
	329	return 0;
	330	else
	331	return 1;
abc490a1	332	}
ab7d5fc6 MD	333
	334	void thr_reader(void _count)
	335	{
	336	unsigned long long *count = _count;
abc490a1	337	struct rcu_ht_node *node;
ab7d5fc6 MD	338
	339	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
	340	"reader", pthread_self(), (unsigned long)gettid());
	341
	342	set_affinity();
	343
	344	rcu_register_thread();
	345
	346	while (!test_go)
	347	{
	348	}
abc490a1	349	cmm_smp_mb();
ab7d5fc6 MD	350
	351	for (;;) {
	352	rcu_read_lock();
abc490a1	353	node = ht_lookup(test_ht,
732ad076 MD	354	(void *)(unsigned long)(rand_r(&rand_lookup) % RAND_POOL),
732ad076 MD	355	sizeof(void *));
abc490a1	356	if (node == NULL)
5e28c532 MD	357	lookup_fail++;
	358	else
	359	lookup_ok++;
ab7d5fc6	360	debug_yield_read();
ab7d5fc6 MD	361	if (unlikely(rduration))
	362	loop_sleep(rduration);
	363	rcu_read_unlock();
	364	nr_reads++;
	365	if (unlikely(!test_duration_read()))
	366	break;
	367	}
	368
	369	rcu_unregister_thread();
	370
	371	*count = nr_reads;
	372	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
	373	"reader", pthread_self(), (unsigned long)gettid());
5e28c532 MD	374	printf_verbose("readid : %lx, lookupfail %lu, lookupok %lu\n",
5e28c532 MD	375	pthread_self(), lookup_fail, lookup_ok);
ab7d5fc6 MD	376	return ((void*)1);
	377
	378	}
	379
abc490a1 MD	380	static
	381	void free_node_cb(struct rcu_head *head)
	382	{
	383	struct rcu_ht_node *node =
	384	caa_container_of(head, struct rcu_ht_node, head);
	385	free(node);
	386	}
	387
ab7d5fc6 MD	388	void thr_writer(void _count)
ab7d5fc6 MD	389	{
abc490a1	390	struct rcu_ht_node *node;
b8e1907c	391	struct wr_count *count = _count;
5e28c532	392	int ret;
ab7d5fc6 MD	393
	394	printf_verbose("thread_begin %s, thread id : %lx, tid %lu\n",
	395	"writer", pthread_self(), (unsigned long)gettid());
	396
	397	set_affinity();
	398
5e28c532	399	rcu_register_thread();
5e28c532	400
ab7d5fc6 MD	401	while (!test_go)
	402	{
	403	}
abc490a1	404	cmm_smp_mb();
ab7d5fc6 MD	405
ab7d5fc6 MD	406	for (;;) {
5e28c532	407	if (rand_r(&rand_lookup) & 1) {
abc490a1 MD	408	node = malloc(sizeof(struct rcu_ht_node));
	409	rcu_read_lock();
	410	ht_node_init(node,
	411	(void *)(unsigned long)(rand_r(&rand_lookup) % RAND_POOL),
cb233752	412	sizeof(void *));
3eca1b8c	413	ret = ht_add_unique(test_ht, node);
abc490a1	414	rcu_read_unlock();
742aa1db MD	415	if (ret) {
742aa1db MD	416	free(node);
3eca1b8c	417	nr_addexist++;
742aa1db	418	} else
3eca1b8c	419	nr_add++;
5e28c532 MD	420	} else {
5e28c532 MD	421	/* May delete */
abc490a1 MD	422	rcu_read_lock();
abc490a1 MD	423	node = ht_lookup(test_ht,
732ad076 MD	424	(void *)(unsigned long)(rand_r(&rand_lookup) % RAND_POOL),
732ad076 MD	425	sizeof(void *));
abc490a1 MD	426	if (node)
abc490a1 MD	427	ret = ht_remove(test_ht, node);
5e28c532	428	else
abc490a1 MD	429	ret = -ENOENT;
	430	rcu_read_unlock();
	431	if (ret == 0) {
	432	call_rcu(&node->head, free_node_cb);
5e28c532	433	nr_del++;
abc490a1 MD	434	} else
abc490a1 MD	435	nr_delnoent++;
44395fb7	436	}
abc490a1	437	#if 0
44395fb7 MD	438	//if (nr_writes % 100000 == 0) {
44395fb7 MD	439	if (nr_writes % 1000 == 0) {
abc490a1	440	rcu_read_lock();
44395fb7 MD	441	if (rand_r(&rand_lookup) & 1) {
	442	ht_resize(test_ht, 1);
	443	} else {
	444	ht_resize(test_ht, -1);
	445	}
abc490a1	446	rcu_read_unlock();
5e28c532	447	}
abc490a1	448	#endif //0
ab7d5fc6 MD	449	nr_writes++;
	450	if (unlikely(!test_duration_write()))
	451	break;
	452	if (unlikely(wdelay))
	453	loop_sleep(wdelay);
	454	}
	455
5e28c532 MD	456	rcu_unregister_thread();
5e28c532 MD	457
ab7d5fc6 MD	458	printf_verbose("thread_end %s, thread id : %lx, tid %lu\n",
ab7d5fc6 MD	459	"writer", pthread_self(), (unsigned long)gettid());
5e28c532 MD	460	printf_verbose("info id %lx: nr_add %lu, nr_addexist %lu, nr_del %lu, "
	461	"nr_delnoent %lu\n", pthread_self(), nr_add,
	462	nr_addexist, nr_del, nr_delnoent);
b8e1907c MD	463	count->update_ops = nr_writes;
	464	count->add = nr_add;
	465	count->remove = nr_del;
ab7d5fc6 MD	466	return ((void*)2);
	467	}
	468
	469	void show_usage(int argc, char **argv)
	470	{
	471	printf("Usage : %s nr_readers nr_writers duration (s)", argv[0]);
	472	#ifdef DEBUG_YIELD
	473	printf(" [-r] [-w] (yield reader and/or writer)");
	474	#endif
	475	printf(" [-d delay] (writer period (us))");
	476	printf(" [-c duration] (reader C.S. duration (in loops))");
	477	printf(" [-v] (verbose output)");
	478	printf(" [-a cpu#] [-a cpu#]... (affinity)");
	479	printf("\n");
	480	}
	481
	482	int main(int argc, char **argv)
	483	{
	484	int err;
	485	pthread_t tid_reader, tid_writer;
	486	void *tret;
b8e1907c MD	487	unsigned long long *count_reader;
	488	struct wr_count *count_writer;
	489	unsigned long long tot_reads = 0, tot_writes = 0,
	490	tot_add = 0, tot_remove = 0;
	491	unsigned long count, removed;
5e28c532	492	int i, a, ret;
ab7d5fc6 MD	493
	494	if (argc < 4) {
	495	show_usage(argc, argv);
	496	return -1;
	497	}
	498
	499	err = sscanf(argv[1], "%u", &nr_readers);
	500	if (err != 1) {
	501	show_usage(argc, argv);
	502	return -1;
	503	}
	504
	505	err = sscanf(argv[2], "%u", &nr_writers);
	506	if (err != 1) {
	507	show_usage(argc, argv);
	508	return -1;
	509	}
	510
	511	err = sscanf(argv[3], "%lu", &duration);
	512	if (err != 1) {
	513	show_usage(argc, argv);
	514	return -1;
	515	}
	516
	517	for (i = 4; i < argc; i++) {
	518	if (argv[i][0] != '-')
	519	continue;
	520	switch (argv[i][1]) {
	521	#ifdef DEBUG_YIELD
	522	case 'r':
	523	yield_active \|= YIELD_READ;
	524	break;
	525	case 'w':
	526	yield_active \|= YIELD_WRITE;
	527	break;
	528	#endif
	529	case 'a':
	530	if (argc < i + 2) {
	531	show_usage(argc, argv);
	532	return -1;
	533	}
	534	a = atoi(argv[++i]);
	535	cpu_affinities[next_aff++] = a;
	536	use_affinity = 1;
	537	printf_verbose("Adding CPU %d affinity\n", a);
	538	break;
	539	case 'c':
	540	if (argc < i + 2) {
	541	show_usage(argc, argv);
	542	return -1;
	543	}
	544	rduration = atol(argv[++i]);
	545	break;
	546	case 'd':
	547	if (argc < i + 2) {
	548	show_usage(argc, argv);
	549	return -1;
	550	}
	551	wdelay = atol(argv[++i]);
	552	break;
	553	case 'v':
	554	verbose_mode = 1;
	555	break;
	556	}
557	}
558
559	printf_verbose("running test for %lu seconds, %u readers, %u writers.\n",
560	duration, nr_readers, nr_writers);
561	printf_verbose("Writer delay : %lu loops.\n", wdelay);
562	printf_verbose("Reader duration : %lu loops.\n", rduration);
563	printf_verbose("thread %-6s, thread id : %lx, tid %lu\n",
564	"main", pthread_self(), (unsigned long)gettid());
565
ab7d5fc6 MD	566	tid_reader = malloc(sizeof(tid_reader) nr_readers);
	567	tid_writer = malloc(sizeof(tid_writer) nr_writers);
	568	count_reader = malloc(sizeof(count_reader) nr_readers);
	569	count_writer = malloc(sizeof(count_writer) nr_writers);
732ad076	570	test_ht = ht_new(test_hash, test_compare, 0x42UL,
abc490a1	571	HASH_SIZE, call_rcu);
ab7d5fc6 MD	572	next_aff = 0;
	573
	574	for (i = 0; i < nr_readers; i++) {
	575	err = pthread_create(&tid_reader[i], NULL, thr_reader,
	576	&count_reader[i]);
	577	if (err != 0)
	578	exit(1);
	579	}
	580	for (i = 0; i < nr_writers; i++) {
	581	err = pthread_create(&tid_writer[i], NULL, thr_writer,
	582	&count_writer[i]);
	583	if (err != 0)
	584	exit(1);
	585	}
	586
abc490a1	587	cmm_smp_mb();
ab7d5fc6 MD	588
	589	test_go = 1;
	590
	591	sleep(duration);
	592
	593	test_stop = 1;
	594
	595	for (i = 0; i < nr_readers; i++) {
	596	err = pthread_join(tid_reader[i], &tret);
	597	if (err != 0)
	598	exit(1);
	599	tot_reads += count_reader[i];
	600	}
	601	for (i = 0; i < nr_writers; i++) {
	602	err = pthread_join(tid_writer[i], &tret);
	603	if (err != 0)
	604	exit(1);
b8e1907c MD	605	tot_writes += count_writer[i].update_ops;
	606	tot_add += count_writer[i].add;
	607	tot_remove += count_writer[i].remove;
ab7d5fc6	608	}
b8e1907c MD	609	ht_count_nodes(test_ht, &count, &removed);
b8e1907c MD	610	if (count \|\| removed)
273399de MD	611	printf("WARNING: nodes left in the hash table upon destroy: "
273399de MD	612	"%lu nodes + %lu logically removed.\n", count, removed);
b8e1907c	613	(void) ht_destroy(test_ht);
f000907d	614
5e28c532	615	printf_verbose("final delete: %d items\n", ret);
ab7d5fc6 MD	616	printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
	617	tot_writes);
	618	printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu "
	619	"nr_writers %3u "
b8e1907c MD	620	"wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
b8e1907c MD	621	"nr_add %12llu nr_remove %12llu nr_leaked %12llu\n",
ab7d5fc6 MD	622	argv[0], duration, nr_readers, rduration,
ab7d5fc6 MD	623	nr_writers, wdelay, tot_reads, tot_writes,
b8e1907c MD	624	tot_reads + tot_writes, tot_add, tot_remove,
b8e1907c MD	625	tot_add - tot_remove - count);
ab7d5fc6 MD	626	free(tid_reader);
	627	free(tid_writer);
	628	free(count_reader);
	629	free(count_writer);
	630	return 0;
	631	}