[urcu.git] / tests / test_urcu_hash_unique.c

/*
 * test_urcu_hash_unique.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_unique_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_unique_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_unique_thr_reader(void *_count)
{
	unsigned long long *count = _count;

	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 (;;) {
		struct lfht_test_node *node;
		struct cds_lfht_iter iter;
		/*
		 * iterate on whole table, ensuring that no duplicate is
		 * found.
		 */
		rcu_read_lock();
		cds_lfht_for_each_entry(test_ht, &iter, node, node) {
			struct cds_lfht_iter dup_iter;

			dup_iter = iter;
			cds_lfht_next_duplicate(test_ht, test_match,
				node->key, &dup_iter);
			if (dup_iter.node != NULL) {
				printf("[ERROR] Duplicate key %p found\n", node->key);
			}
		}
		rcu_read_unlock();

		rcu_debug_yield_read();
		if (caa_unlikely(rduration))
			loop_sleep(rduration);
		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 : %lu, lookupfail %lu, lookupok %lu\n",
			urcu_get_thread_id(), URCU_TLS(lookup_fail),
			URCU_TLS(lookup_ok));
	return ((void*)1);

}

void *test_hash_unique_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;
	int loc_add_unique;

	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 (;;) {
		/*
		 * add unique/add replace with new node key from range.
		 */
		if (1 || (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();
			loc_add_unique = rand_r(&URCU_TLS(rand_lookup)) & 1;
			if (loc_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 {
				ret_node = cds_lfht_add_replace(test_ht,
						test_hash(node->key, node->key_len, TEST_HASH_SEED),
						test_match, node->key, &node->node);
#if 0 //generate an error on purpose
				cds_lfht_add(test_ht,
						test_hash(node->key, node->key_len, TEST_HASH_SEED),
						&node->node);
				ret_node = NULL;
#endif //0
			}
			rcu_read_unlock();
			if (loc_add_unique) {
				if (ret_node != &node->node) {
					free(node);
					URCU_TLS(nr_addexist)++;
				} else {
					URCU_TLS(nr_add)++;
				}
			} else {
				if (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_unique_populate_hash(void)
{
	struct lfht_test_node *node;
	struct cds_lfht_node *ret_node;

	printf("Starting uniqueness test.\n");

	if (!init_populate)
		return 0;

	if (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();
		ret_node = cds_lfht_add_replace(test_ht,
				test_hash(node->key, node->key_len, TEST_HASH_SEED),
				test_match, node->key, &node->node);
		rcu_read_unlock();
		if (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
20adf780 MD	1	/*
	2	* test_urcu_hash_unique.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_unique_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_unique_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_unique_thr_reader(void _count)
	63	{
	64	unsigned long long *count = _count;
65
94df6318 MD	66	printf_verbose("thread_begin %s, tid %lu\n",
94df6318 MD	67	"reader", urcu_get_thread_id());
20adf780 MD	68
	69	set_affinity();
	70
	71	rcu_register_thread();
	72
	73	while (!test_go)
	74	{
	75	}
	76	cmm_smp_mb();
	77
	78	for (;;) {
	79	struct lfht_test_node *node;
	80	struct cds_lfht_iter iter;
	81	/*
	82	* iterate on whole table, ensuring that no duplicate is
	83	* found.
	84	*/
	85	rcu_read_lock();
	86	cds_lfht_for_each_entry(test_ht, &iter, node, node) {
	87	struct cds_lfht_iter dup_iter;
	88
	89	dup_iter = iter;
	90	cds_lfht_next_duplicate(test_ht, test_match,
	91	node->key, &dup_iter);
	92	if (dup_iter.node != NULL) {
	93	printf("[ERROR] Duplicate key %p found\n", node->key);
	94	}
	95	}
	96	rcu_read_unlock();
	97
1de4df4b	98	rcu_debug_yield_read();
20adf780 MD	99	if (caa_unlikely(rduration))
20adf780 MD	100	loop_sleep(rduration);
bd252a04	101	URCU_TLS(nr_reads)++;
20adf780 MD	102	if (caa_unlikely(!test_duration_read()))
20adf780 MD	103	break;
bd252a04	104	if (caa_unlikely((URCU_TLS(nr_reads) & ((1 << 10) - 1)) == 0))
20adf780 MD	105	rcu_quiescent_state();
	106	}
	107
	108	rcu_unregister_thread();
	109
bd252a04	110	*count = URCU_TLS(nr_reads);
94df6318 MD	111	printf_verbose("thread_end %s, tid %lu\n",
	112	"reader", urcu_get_thread_id());
	113	printf_verbose("read tid : %lu, lookupfail %lu, lookupok %lu\n",
	114	urcu_get_thread_id(), URCU_TLS(lookup_fail),
bd252a04	115	URCU_TLS(lookup_ok));
20adf780 MD	116	return ((void*)1);
	117
	118	}
	119
	120	void test_hash_unique_thr_writer(void _count)
	121	{
	122	struct lfht_test_node *node;
	123	struct cds_lfht_node *ret_node;
	124	struct cds_lfht_iter iter;
	125	struct wr_count *count = _count;
	126	int ret;
	127	int loc_add_unique;
	128
94df6318 MD	129	printf_verbose("thread_begin %s, tid %lu\n",
94df6318 MD	130	"writer", urcu_get_thread_id());
20adf780 MD	131
	132	set_affinity();
	133
	134	rcu_register_thread();
	135
	136	while (!test_go)
	137	{
	138	}
	139	cmm_smp_mb();
	140
	141	for (;;) {
	142	/*
	143	* add unique/add replace with new node key from range.
	144	*/
	145	if (1 \|\| (addremove == AR_ADD \|\| add_only)
bd252a04	146	\|\| (addremove == AR_RANDOM && rand_r(&URCU_TLS(rand_lookup)) & 1)) {
20adf780 MD	147	node = malloc(sizeof(struct lfht_test_node));
20adf780 MD	148	lfht_test_node_init(node,
bd252a04	149	(void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % write_pool_size) + write_pool_offset),
20adf780 MD	150	sizeof(void *));
20adf780 MD	151	rcu_read_lock();
bd252a04	152	loc_add_unique = rand_r(&URCU_TLS(rand_lookup)) & 1;
20adf780 MD	153	if (loc_add_unique) {
	154	ret_node = cds_lfht_add_unique(test_ht,
	155	test_hash(node->key, node->key_len, TEST_HASH_SEED),
	156	test_match, node->key, &node->node);
	157	} else {
	158	ret_node = cds_lfht_add_replace(test_ht,
	159	test_hash(node->key, node->key_len, TEST_HASH_SEED),
	160	test_match, node->key, &node->node);
	161	#if 0 //generate an error on purpose
	162	cds_lfht_add(test_ht,
	163	test_hash(node->key, node->key_len, TEST_HASH_SEED),
	164	&node->node);
	165	ret_node = NULL;
	166	#endif //0
	167	}
	168	rcu_read_unlock();
	169	if (loc_add_unique) {
	170	if (ret_node != &node->node) {
	171	free(node);
bd252a04	172	URCU_TLS(nr_addexist)++;
20adf780	173	} else {
bd252a04	174	URCU_TLS(nr_add)++;
20adf780 MD	175	}
	176	} else {
	177	if (ret_node) {
	178	call_rcu(&to_test_node(ret_node)->head,
	179	free_node_cb);
bd252a04	180	URCU_TLS(nr_addexist)++;
20adf780	181	} else {
bd252a04	182	URCU_TLS(nr_add)++;
20adf780 MD	183	}
	184	}
	185	} else {
	186	/* May delete */
	187	rcu_read_lock();
	188	cds_lfht_test_lookup(test_ht,
bd252a04	189	(void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % write_pool_size) + write_pool_offset),
20adf780 MD	190	sizeof(void *), &iter);
	191	ret = cds_lfht_del(test_ht, cds_lfht_iter_get_node(&iter));
	192	rcu_read_unlock();
	193	if (ret == 0) {
	194	node = cds_lfht_iter_get_test_node(&iter);
	195	call_rcu(&node->head, free_node_cb);
bd252a04	196	URCU_TLS(nr_del)++;
20adf780	197	} else
bd252a04	198	URCU_TLS(nr_delnoent)++;
20adf780 MD	199	}
20adf780 MD	200	#if 0
bd252a04 MD	201	//if (URCU_TLS(nr_writes) % 100000 == 0) {
bd252a04 MD	202	if (URCU_TLS(nr_writes) % 1000 == 0) {
20adf780	203	rcu_read_lock();
bd252a04	204	if (rand_r(&URCU_TLS(rand_lookup)) & 1) {
20adf780 MD	205	ht_resize(test_ht, 1);
	206	} else {
	207	ht_resize(test_ht, -1);
	208	}
	209	rcu_read_unlock();
	210	}
	211	#endif //0
bd252a04	212	URCU_TLS(nr_writes)++;
20adf780 MD	213	if (caa_unlikely(!test_duration_write()))
	214	break;
	215	if (caa_unlikely(wdelay))
	216	loop_sleep(wdelay);
bd252a04	217	if (caa_unlikely((URCU_TLS(nr_writes) & ((1 << 10) - 1)) == 0))
20adf780 MD	218	rcu_quiescent_state();
	219	}
	220
	221	rcu_unregister_thread();
	222
94df6318 MD	223	printf_verbose("thread_end %s, tid %lu\n",
	224	"writer", urcu_get_thread_id());
	225	printf_verbose("info tid %lu: nr_add %lu, nr_addexist %lu, nr_del %lu, "
	226	"nr_delnoent %lu\n", urcu_get_thread_id(),
	227	URCU_TLS(nr_add),
	228	URCU_TLS(nr_addexist),
	229	URCU_TLS(nr_del),
bd252a04 MD	230	URCU_TLS(nr_delnoent));
	231	count->update_ops = URCU_TLS(nr_writes);
	232	count->add = URCU_TLS(nr_add);
	233	count->add_exist = URCU_TLS(nr_addexist);
	234	count->remove = URCU_TLS(nr_del);
20adf780 MD	235	return ((void*)2);
	236	}
	237
	238	int test_hash_unique_populate_hash(void)
	239	{
	240	struct lfht_test_node *node;
	241	struct cds_lfht_node *ret_node;
	242
	243	printf("Starting uniqueness test.\n");
	244
	245	if (!init_populate)
	246	return 0;
	247
	248	if (init_populate * 10 > init_pool_size) {
	249	printf("WARNING: required to populate %lu nodes (-k), but random "
	250	"pool is quite small (%lu values) and we are in add_unique (-u) or add_replace (-s) mode. Try with a "
	251	"larger random pool (-p option). This may take a while...\n", init_populate, init_pool_size);
	252	}
	253
bd252a04	254	while (URCU_TLS(nr_add) < init_populate) {
20adf780 MD	255	node = malloc(sizeof(struct lfht_test_node));
20adf780 MD	256	lfht_test_node_init(node,
bd252a04	257	(void *)(((unsigned long) rand_r(&URCU_TLS(rand_lookup)) % init_pool_size) + init_pool_offset),
20adf780 MD	258	sizeof(void *));
	259	rcu_read_lock();
	260	ret_node = cds_lfht_add_replace(test_ht,
	261	test_hash(node->key, node->key_len, TEST_HASH_SEED),
	262	test_match, node->key, &node->node);
	263	rcu_read_unlock();
	264	if (ret_node) {
	265	call_rcu(&to_test_node(ret_node)->head, free_node_cb);
bd252a04	266	URCU_TLS(nr_addexist)++;
20adf780	267	} else {
bd252a04	268	URCU_TLS(nr_add)++;
20adf780	269	}
bd252a04	270	URCU_TLS(nr_writes)++;
20adf780 MD	271	}
	272	return 0;
	273	}