[urcu.git] / tests / test_urcu_hash_rw.c

/*
 * test_urcu_hash_rw.c
 *
 * Userspace RCU library - test program
 *
 * Copyright 2009-2012 - 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 "test_urcu_hash.h"

enum urcu_hash_addremove {
	AR_RANDOM = 0,
	AR_ADD = 1,
	AR_REMOVE = -1,
};	/* 1: add, -1 remove, 0: random */

static enum urcu_hash_addremove addremove; /* 1: add, -1 remove, 0: random */

void test_hash_rw_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;
	}
}

void test_hash_rw_sigusr2_handler(int signo)
{
	char msg[1] = { 0x42 };
	ssize_t ret;

	do {
		ret = write(count_pipe[1], msg, 1);	/* wakeup thread */
	} while (ret == -1L && errno == EINTR);
}

void *test_hash_rw_thr_reader(void *_count)
{
	unsigned long long *count = _count;
	struct lfht_test_node *node;
	struct cds_lfht_iter iter;

	printf_verbose("thread_begin %s, tid %lu\n",
			"reader", urcu_get_thread_id());

	set_affinity();

	rcu_register_thread();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	for (;;) {
		rcu_read_lock();
		cds_lfht_test_lookup(test_ht,
			(void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % lookup_pool_size) + lookup_pool_offset),
			sizeof(void *), &iter);
		node = cds_lfht_iter_get_test_node(&iter);
		if (node == NULL) {
			if (validate_lookup) {
				printf("[ERROR] Lookup cannot find initial node.\n");
				exit(-1);
			}
			URCU_TLS(lookup_fail)++;
		} else {
			URCU_TLS(lookup_ok)++;
		}
		rcu_debug_yield_read();
		if (caa_unlikely(rduration))
			loop_sleep(rduration);
		rcu_read_unlock();
		URCU_TLS(nr_reads)++;
		if (caa_unlikely(!test_duration_read()))
			break;
		if (caa_unlikely((URCU_TLS(nr_reads) & ((1 << 10) - 1)) == 0))
			rcu_quiescent_state();
	}

	rcu_unregister_thread();

	*count = URCU_TLS(nr_reads);
	printf_verbose("thread_end %s, tid %lu\n",
			"reader", urcu_get_thread_id());
	printf_verbose("read tid : %lx, lookupfail %lu, lookupok %lu\n",
			urcu_get_thread_id(),
			URCU_TLS(lookup_fail),
			URCU_TLS(lookup_ok));
	return ((void*)1);

}

void *test_hash_rw_thr_writer(void *_count)
{
	struct lfht_test_node *node;
	struct cds_lfht_node *ret_node;
	struct cds_lfht_iter iter;
	struct wr_count *count = _count;
	int ret;

	printf_verbose("thread_begin %s, tid %lu\n",
			"writer", urcu_get_thread_id());

	set_affinity();

	rcu_register_thread();

	while (!test_go)
	{
	}
	cmm_smp_mb();

	for (;;) {
		if ((addremove == AR_ADD || add_only)
				|| (addremove == AR_RANDOM && rand_r(&URCU_TLS(rand_lookup)) & 1)) {
			node = malloc(sizeof(struct lfht_test_node));
			lfht_test_node_init(node,
				(void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % write_pool_size) + write_pool_offset),
				sizeof(void *));
			rcu_read_lock();
			if (add_unique) {
				ret_node = cds_lfht_add_unique(test_ht,
					test_hash(node->key, node->key_len, TEST_HASH_SEED),
					test_match, node->key, &node->node);
			} else {
				if (add_replace)
					ret_node = cds_lfht_add_replace(test_ht,
							test_hash(node->key, node->key_len, TEST_HASH_SEED),
							test_match, node->key, &node->node);
				else
					cds_lfht_add(test_ht,
						test_hash(node->key, node->key_len, TEST_HASH_SEED),
						&node->node);
			}
			rcu_read_unlock();
			if (add_unique && ret_node != &node->node) {
				free(node);
				URCU_TLS(nr_addexist)++;
			} else {
				if (add_replace && ret_node) {
					call_rcu(&to_test_node(ret_node)->head,
							free_node_cb);
					URCU_TLS(nr_addexist)++;
				} else {
					URCU_TLS(nr_add)++;
				}
			}
		} else {
			/* May delete */
			rcu_read_lock();
			cds_lfht_test_lookup(test_ht,
				(void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % write_pool_size) + write_pool_offset),
				sizeof(void *), &iter);
			ret = cds_lfht_del(test_ht, cds_lfht_iter_get_node(&iter));
			rcu_read_unlock();
			if (ret == 0) {
				node = cds_lfht_iter_get_test_node(&iter);
				call_rcu(&node->head, free_node_cb);
				URCU_TLS(nr_del)++;
			} else
				URCU_TLS(nr_delnoent)++;
		}
#if 0
		//if (URCU_TLS(nr_writes) % 100000 == 0) {
		if (URCU_TLS(nr_writes) % 1000 == 0) {
			rcu_read_lock();
			if (rand_r(&URCU_TLS(rand_lookup)) & 1) {
				ht_resize(test_ht, 1);
			} else {
				ht_resize(test_ht, -1);
			}
			rcu_read_unlock();
		}
#endif //0
		URCU_TLS(nr_writes)++;
		if (caa_unlikely(!test_duration_write()))
			break;
		if (caa_unlikely(wdelay))
			loop_sleep(wdelay);
		if (caa_unlikely((URCU_TLS(nr_writes) & ((1 << 10) - 1)) == 0))
			rcu_quiescent_state();
	}

	rcu_unregister_thread();

	printf_verbose("thread_end %s, tid %lu\n",
			"writer", urcu_get_thread_id());
	printf_verbose("info tid %lu: nr_add %lu, nr_addexist %lu, nr_del %lu, "
			"nr_delnoent %lu\n", urcu_get_thread_id(),
			URCU_TLS(nr_add),
			URCU_TLS(nr_addexist),
			URCU_TLS(nr_del),
			URCU_TLS(nr_delnoent));
	count->update_ops = URCU_TLS(nr_writes);
	count->add = URCU_TLS(nr_add);
	count->add_exist = URCU_TLS(nr_addexist);
	count->remove = URCU_TLS(nr_del);
	return ((void*)2);
}

int test_hash_rw_populate_hash(void)
{
	struct lfht_test_node *node;
	struct cds_lfht_node *ret_node;

	if (!init_populate)
		return 0;

	printf("Starting rw test\n");

	if ((add_unique || add_replace) && init_populate * 10 > init_pool_size) {
		printf("WARNING: required to populate %lu nodes (-k), but random "
"pool is quite small (%lu values) and we are in add_unique (-u) or add_replace (-s) mode. Try with a "
"larger random pool (-p option). This may take a while...\n", init_populate, init_pool_size);
	}

	while (URCU_TLS(nr_add) < init_populate) {
		node = malloc(sizeof(struct lfht_test_node));
		lfht_test_node_init(node,
			(void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % init_pool_size) + init_pool_offset),
			sizeof(void *));
		rcu_read_lock();
		if (add_unique) {
			ret_node = cds_lfht_add_unique(test_ht,
				test_hash(node->key, node->key_len, TEST_HASH_SEED),
				test_match, node->key, &node->node);
		} else {
			if (add_replace)
				ret_node = cds_lfht_add_replace(test_ht,
						test_hash(node->key, node->key_len, TEST_HASH_SEED),
						test_match, node->key, &node->node);
			else
				cds_lfht_add(test_ht,
					test_hash(node->key, node->key_len, TEST_HASH_SEED),
					&node->node);
		}
		rcu_read_unlock();
		if (add_unique && ret_node != &node->node) {
			free(node);
			URCU_TLS(nr_addexist)++;
		} else {
			if (add_replace && ret_node) {
				call_rcu(&to_test_node(ret_node)->head, free_node_cb);
				URCU_TLS(nr_addexist)++;
			} else {
				URCU_TLS(nr_add)++;
			}
		}
		URCU_TLS(nr_writes)++;
	}
	return 0;
}
Commit	Line	Data
18ca7a5b MD	1	/*
	2	* test_urcu_hash_rw.c
	3	*
	4	* Userspace RCU library - test program
	5	*
	6	* Copyright 2009-2012 - 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 "test_urcu_hash.h"
	25
	26	enum urcu_hash_addremove {
	27	AR_RANDOM = 0,
	28	AR_ADD = 1,
	29	AR_REMOVE = -1,
	30	}; /* 1: add, -1 remove, 0: random */
	31
	32	static enum urcu_hash_addremove addremove; /* 1: add, -1 remove, 0: random */
	33
	34	void test_hash_rw_sigusr1_handler(int signo)
	35	{
	36	switch (addremove) {
	37	case AR_ADD:
	38	printf("Add/Remove: random.\n");
	39	addremove = AR_RANDOM;
	40	break;
	41	case AR_RANDOM:
	42	printf("Add/Remove: remove only.\n");
	43	addremove = AR_REMOVE;
	44	break;
	45	case AR_REMOVE:
	46	printf("Add/Remove: add only.\n");
	47	addremove = AR_ADD;
	48	break;
	49	}
	50	}
	51
	52	void test_hash_rw_sigusr2_handler(int signo)
	53	{
	54	char msg[1] = { 0x42 };
	55	ssize_t ret;
	56
	57	do {
	58	ret = write(count_pipe[1], msg, 1); /* wakeup thread */
	59	} while (ret == -1L && errno == EINTR);
	60	}
	61
	62	void test_hash_rw_thr_reader(void _count)
	63	{
	64	unsigned long long *count = _count;
65	struct lfht_test_node *node;
66	struct cds_lfht_iter iter;
67
94df6318 MD	68	printf_verbose("thread_begin %s, tid %lu\n",
94df6318 MD	69	"reader", urcu_get_thread_id());
18ca7a5b MD	70
	71	set_affinity();
	72
	73	rcu_register_thread();
	74
	75	while (!test_go)
	76	{
	77	}
	78	cmm_smp_mb();
	79
	80	for (;;) {
	81	rcu_read_lock();
	82	cds_lfht_test_lookup(test_ht,
bd252a04	83	(void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % lookup_pool_size) + lookup_pool_offset),
18ca7a5b MD	84	sizeof(void *), &iter);
	85	node = cds_lfht_iter_get_test_node(&iter);
	86	if (node == NULL) {
	87	if (validate_lookup) {
	88	printf("[ERROR] Lookup cannot find initial node.\n");
	89	exit(-1);
	90	}
bd252a04	91	URCU_TLS(lookup_fail)++;
18ca7a5b	92	} else {
bd252a04	93	URCU_TLS(lookup_ok)++;
18ca7a5b	94	}
1de4df4b	95	rcu_debug_yield_read();
18ca7a5b MD	96	if (caa_unlikely(rduration))
	97	loop_sleep(rduration);
	98	rcu_read_unlock();
bd252a04	99	URCU_TLS(nr_reads)++;
18ca7a5b MD	100	if (caa_unlikely(!test_duration_read()))
18ca7a5b MD	101	break;
bd252a04	102	if (caa_unlikely((URCU_TLS(nr_reads) & ((1 << 10) - 1)) == 0))
18ca7a5b MD	103	rcu_quiescent_state();
	104	}
	105
	106	rcu_unregister_thread();
	107
bd252a04	108	*count = URCU_TLS(nr_reads);
94df6318 MD	109	printf_verbose("thread_end %s, tid %lu\n",
	110	"reader", urcu_get_thread_id());
	111	printf_verbose("read tid : %lx, lookupfail %lu, lookupok %lu\n",
	112	urcu_get_thread_id(),
	113	URCU_TLS(lookup_fail),
bd252a04	114	URCU_TLS(lookup_ok));
18ca7a5b MD	115	return ((void*)1);
	116
	117	}
	118
	119	void test_hash_rw_thr_writer(void _count)
	120	{
	121	struct lfht_test_node *node;
	122	struct cds_lfht_node *ret_node;
	123	struct cds_lfht_iter iter;
	124	struct wr_count *count = _count;
	125	int ret;
	126
94df6318 MD	127	printf_verbose("thread_begin %s, tid %lu\n",
94df6318 MD	128	"writer", urcu_get_thread_id());
18ca7a5b MD	129
	130	set_affinity();
	131
	132	rcu_register_thread();
	133
	134	while (!test_go)
	135	{
	136	}
	137	cmm_smp_mb();
	138
	139	for (;;) {
	140	if ((addremove == AR_ADD \|\| add_only)
bd252a04	141	\|\| (addremove == AR_RANDOM && rand_r(&URCU_TLS(rand_lookup)) & 1)) {
18ca7a5b MD	142	node = malloc(sizeof(struct lfht_test_node));
18ca7a5b MD	143	lfht_test_node_init(node,
bd252a04	144	(void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % write_pool_size) + write_pool_offset),
18ca7a5b MD	145	sizeof(void *));
	146	rcu_read_lock();
	147	if (add_unique) {
	148	ret_node = cds_lfht_add_unique(test_ht,
	149	test_hash(node->key, node->key_len, TEST_HASH_SEED),
	150	test_match, node->key, &node->node);
	151	} else {
	152	if (add_replace)
	153	ret_node = cds_lfht_add_replace(test_ht,
	154	test_hash(node->key, node->key_len, TEST_HASH_SEED),
	155	test_match, node->key, &node->node);
	156	else
	157	cds_lfht_add(test_ht,
	158	test_hash(node->key, node->key_len, TEST_HASH_SEED),
	159	&node->node);
	160	}
	161	rcu_read_unlock();
	162	if (add_unique && ret_node != &node->node) {
	163	free(node);
bd252a04	164	URCU_TLS(nr_addexist)++;
18ca7a5b MD	165	} else {
	166	if (add_replace && ret_node) {
	167	call_rcu(&to_test_node(ret_node)->head,
	168	free_node_cb);
bd252a04	169	URCU_TLS(nr_addexist)++;
18ca7a5b	170	} else {
bd252a04	171	URCU_TLS(nr_add)++;
18ca7a5b MD	172	}
	173	}
	174	} else {
	175	/* May delete */
	176	rcu_read_lock();
	177	cds_lfht_test_lookup(test_ht,
bd252a04	178	(void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % write_pool_size) + write_pool_offset),
18ca7a5b MD	179	sizeof(void *), &iter);
	180	ret = cds_lfht_del(test_ht, cds_lfht_iter_get_node(&iter));
	181	rcu_read_unlock();
	182	if (ret == 0) {
	183	node = cds_lfht_iter_get_test_node(&iter);
	184	call_rcu(&node->head, free_node_cb);
bd252a04	185	URCU_TLS(nr_del)++;
18ca7a5b	186	} else
bd252a04	187	URCU_TLS(nr_delnoent)++;
18ca7a5b MD	188	}
18ca7a5b MD	189	#if 0
bd252a04 MD	190	//if (URCU_TLS(nr_writes) % 100000 == 0) {
bd252a04 MD	191	if (URCU_TLS(nr_writes) % 1000 == 0) {
18ca7a5b	192	rcu_read_lock();
bd252a04	193	if (rand_r(&URCU_TLS(rand_lookup)) & 1) {
18ca7a5b MD	194	ht_resize(test_ht, 1);
	195	} else {
	196	ht_resize(test_ht, -1);
	197	}
	198	rcu_read_unlock();
	199	}
	200	#endif //0
bd252a04	201	URCU_TLS(nr_writes)++;
18ca7a5b MD	202	if (caa_unlikely(!test_duration_write()))
	203	break;
	204	if (caa_unlikely(wdelay))
	205	loop_sleep(wdelay);
bd252a04	206	if (caa_unlikely((URCU_TLS(nr_writes) & ((1 << 10) - 1)) == 0))
18ca7a5b MD	207	rcu_quiescent_state();
	208	}
	209
	210	rcu_unregister_thread();
	211
94df6318 MD	212	printf_verbose("thread_end %s, tid %lu\n",
	213	"writer", urcu_get_thread_id());
	214	printf_verbose("info tid %lu: nr_add %lu, nr_addexist %lu, nr_del %lu, "
	215	"nr_delnoent %lu\n", urcu_get_thread_id(),
	216	URCU_TLS(nr_add),
	217	URCU_TLS(nr_addexist),
	218	URCU_TLS(nr_del),
bd252a04 MD	219	URCU_TLS(nr_delnoent));
	220	count->update_ops = URCU_TLS(nr_writes);
	221	count->add = URCU_TLS(nr_add);
	222	count->add_exist = URCU_TLS(nr_addexist);
	223	count->remove = URCU_TLS(nr_del);
18ca7a5b MD	224	return ((void*)2);
	225	}
	226
	227	int test_hash_rw_populate_hash(void)
	228	{
	229	struct lfht_test_node *node;
	230	struct cds_lfht_node *ret_node;
	231
	232	if (!init_populate)
	233	return 0;
	234
2af6e536 MD	235	printf("Starting rw test\n");
2af6e536 MD	236
18ca7a5b MD	237	if ((add_unique \|\| add_replace) && init_populate * 10 > init_pool_size) {
	238	printf("WARNING: required to populate %lu nodes (-k), but random "
	239	"pool is quite small (%lu values) and we are in add_unique (-u) or add_replace (-s) mode. Try with a "
	240	"larger random pool (-p option). This may take a while...\n", init_populate, init_pool_size);
	241	}
	242
bd252a04	243	while (URCU_TLS(nr_add) < init_populate) {
18ca7a5b MD	244	node = malloc(sizeof(struct lfht_test_node));
18ca7a5b MD	245	lfht_test_node_init(node,
bd252a04	246	(void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % init_pool_size) + init_pool_offset),
18ca7a5b MD	247	sizeof(void *));
	248	rcu_read_lock();
	249	if (add_unique) {
	250	ret_node = cds_lfht_add_unique(test_ht,
	251	test_hash(node->key, node->key_len, TEST_HASH_SEED),
	252	test_match, node->key, &node->node);
	253	} else {
	254	if (add_replace)
	255	ret_node = cds_lfht_add_replace(test_ht,
	256	test_hash(node->key, node->key_len, TEST_HASH_SEED),
	257	test_match, node->key, &node->node);
	258	else
	259	cds_lfht_add(test_ht,
	260	test_hash(node->key, node->key_len, TEST_HASH_SEED),
	261	&node->node);
	262	}
	263	rcu_read_unlock();
	264	if (add_unique && ret_node != &node->node) {
	265	free(node);
bd252a04	266	URCU_TLS(nr_addexist)++;
18ca7a5b MD	267	} else {
	268	if (add_replace && ret_node) {
	269	call_rcu(&to_test_node(ret_node)->head, free_node_cb);
bd252a04	270	URCU_TLS(nr_addexist)++;
18ca7a5b	271	} else {
bd252a04	272	URCU_TLS(nr_add)++;
18ca7a5b MD	273	}
18ca7a5b MD	274	}
bd252a04	275	URCU_TLS(nr_writes)++;
18ca7a5b MD	276	}
	277	return 0;
	278	}