X-Git-Url: http://git.liburcu.org/?a=blobdiff_plain;f=tests%2Ftest_urcu_hash_unique.c;fp=tests%2Ftest_urcu_hash_unique.c;h=0000000000000000000000000000000000000000;hb=f5ab766ee2c8300cb00ca5878b1cb464f960a66d;hp=adbbde0db4f0c59ce751feec00cc4276763c57d3;hpb=a5bae03d59c22e57263b8610b9fed99738303cf0;p=urcu.git

diff --git a/tests/test_urcu_hash_unique.c b/tests/test_urcu_hash_unique.c
deleted file mode 100644
index adbbde0..0000000
--- a/tests/test_urcu_hash_unique.c
+++ /dev/null
@@ -1,279 +0,0 @@
-/*
- * 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());
-
-	URCU_TLS(rand_lookup) = urcu_get_thread_id() ^ time(NULL);
-
-	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());
-
-	URCU_TLS(rand_lookup) = urcu_get_thread_id() ^ time(NULL);
-
-	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");
-
-	URCU_TLS(rand_lookup) = urcu_get_thread_id() ^ time(NULL);
-
-	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;
-}