* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
-#define _GNU_SOURCE
-#include "config.h"
#include <stdio.h>
#include <pthread.h>
#include <stdlib.h>
#include <sys/wait.h>
#include <unistd.h>
#include <stdio.h>
-#include <assert.h>
#include <errno.h>
#include <urcu/arch.h>
+#include <urcu/assert.h>
#include <urcu/tls-compat.h>
-#include "cpuset.h"
#include "thread-id.h"
#include "../common/debug-yield.h"
static struct test_array *test_rcu_pointer;
-static unsigned int reclaim_batch = 1;
+static long reclaim_batch = 1;
struct reclaim_queue {
void **queue; /* Beginning of queue */
static void set_affinity(void)
{
-#if HAVE_SCHED_SETAFFINITY
+#ifdef HAVE_SCHED_SETAFFINITY
cpu_set_t mask;
int cpu, ret;
#endif /* HAVE_SCHED_SETAFFINITY */
if (!use_affinity)
return;
-#if HAVE_SCHED_SETAFFINITY
+#ifdef HAVE_SCHED_SETAFFINITY
ret = pthread_mutex_lock(&affinity_mutex);
if (ret) {
perror("Error in pthread mutex lock");
CPU_ZERO(&mask);
CPU_SET(cpu, &mask);
-#if SCHED_SETAFFINITY_ARGS == 2
- sched_setaffinity(0, &mask);
-#else
sched_setaffinity(0, sizeof(mask), &mask);
-#endif
#endif /* HAVE_SCHED_SETAFFINITY */
}
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);
- }
-}
-
+static
void *thr_reader(void *_count)
{
unsigned long long *count = _count;
local_ptr = rcu_dereference(test_rcu_pointer);
rcu_debug_yield_read();
if (local_ptr)
- assert(local_ptr->a == 8);
+ urcu_posix_assert(local_ptr->a == 8);
if (caa_unlikely(rduration))
loop_sleep(rduration);
rcu_read_unlock();
rcu_gc_clear_queue(wtidx);
}
+static
void *thr_writer(void *data)
{
unsigned long wtidx = (unsigned long)data;
return ((void*)2);
}
-void show_usage(int argc, char **argv)
+static
+void show_usage(char **argv)
{
printf("Usage : %s nr_readers nr_writers duration (s) <OPTIONS>\n",
argv[0]);
unsigned long long *count_reader;
unsigned long long tot_reads = 0, tot_writes = 0;
int i, a;
+ unsigned int i_thr;
if (argc < 4) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
err = sscanf(argv[1], "%u", &nr_readers);
if (err != 1) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
err = sscanf(argv[2], "%u", &nr_writers);
if (err != 1) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
-
+
err = sscanf(argv[3], "%lu", &duration);
if (err != 1) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
break;
case 'a':
if (argc < i + 2) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
a = atoi(argv[++i]);
break;
case 'b':
if (argc < i + 2) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
reclaim_batch = atol(argv[++i]);
break;
case 'c':
if (argc < i + 2) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
rduration = atol(argv[++i]);
break;
case 'd':
if (argc < i + 2) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
wdelay = atol(argv[++i]);
break;
case 'e':
if (argc < i + 2) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
wduration = atol(argv[++i]);
count_reader = calloc(nr_readers, sizeof(*count_reader));
tot_nr_writes = calloc(nr_writers, sizeof(*tot_nr_writes));
pending_reclaims = calloc(nr_writers, sizeof(*pending_reclaims));
- if (reclaim_batch * sizeof(*pending_reclaims[i].queue)
+
+ if (reclaim_batch * sizeof(*pending_reclaims[0].queue)
< CAA_CACHE_LINE_SIZE)
- for (i = 0; i < nr_writers; i++)
- pending_reclaims[i].queue = calloc(1, CAA_CACHE_LINE_SIZE);
+ for (i_thr = 0; i_thr < nr_writers; i_thr++)
+ pending_reclaims[i_thr].queue = calloc(1, CAA_CACHE_LINE_SIZE);
else
- for (i = 0; i < nr_writers; i++)
- pending_reclaims[i].queue = calloc(reclaim_batch,
- sizeof(*pending_reclaims[i].queue));
- for (i = 0; i < nr_writers; i++)
- pending_reclaims[i].head = pending_reclaims[i].queue;
+ for (i_thr = 0; i_thr < nr_writers; i_thr++)
+ pending_reclaims[i_thr].queue = calloc(reclaim_batch,
+ sizeof(*pending_reclaims[i_thr].queue));
+ for (i_thr = 0; i_thr < nr_writers; i_thr++)
+ pending_reclaims[i_thr].head = pending_reclaims[i_thr].queue;
next_aff = 0;
- for (i = 0; i < nr_readers; i++) {
- err = pthread_create(&tid_reader[i], NULL, thr_reader,
- &count_reader[i]);
+ for (i_thr = 0; i_thr < nr_readers; i_thr++) {
+ err = pthread_create(&tid_reader[i_thr], NULL, thr_reader,
+ &count_reader[i_thr]);
if (err != 0)
exit(1);
}
- for (i = 0; i < nr_writers; i++) {
- err = pthread_create(&tid_writer[i], NULL, thr_writer,
- (void *)(long)i);
+ for (i_thr = 0; i_thr < nr_writers; i_thr++) {
+ err = pthread_create(&tid_writer[i_thr], NULL, thr_writer,
+ (void *)(long)i_thr);
if (err != 0)
exit(1);
}
test_stop = 1;
- for (i = 0; i < nr_readers; i++) {
- err = pthread_join(tid_reader[i], &tret);
+ for (i_thr = 0; i_thr < nr_readers; i_thr++) {
+ err = pthread_join(tid_reader[i_thr], &tret);
if (err != 0)
exit(1);
- tot_reads += count_reader[i];
+ tot_reads += count_reader[i_thr];
}
- for (i = 0; i < nr_writers; i++) {
- err = pthread_join(tid_writer[i], &tret);
+ for (i_thr = 0; i_thr < nr_writers; i_thr++) {
+ err = pthread_join(tid_writer[i_thr], &tret);
if (err != 0)
exit(1);
- tot_writes += tot_nr_writes[i];
- rcu_gc_clear_queue(i);
+ tot_writes += tot_nr_writes[i_thr];
+ rcu_gc_clear_queue(i_thr);
}
-
+
printf_verbose("total number of reads : %llu, writes %llu\n", tot_reads,
tot_writes);
printf("SUMMARY %-25s testdur %4lu nr_readers %3u rdur %6lu wdur %6lu "
"nr_writers %3u "
"wdelay %6lu nr_reads %12llu nr_writes %12llu nr_ops %12llu "
- "batch %u\n",
+ "batch %ld\n",
argv[0], duration, nr_readers, rduration, wduration,
nr_writers, wdelay, tot_reads, tot_writes,
tot_reads + tot_writes, reclaim_batch);
+
free(tid_reader);
free(tid_writer);
free(count_reader);
free(tot_nr_writes);
- for (i = 0; i < nr_writers; i++)
- free(pending_reclaims[i].queue);
+
+ for (i_thr = 0; i_thr < nr_writers; i_thr++)
+ free(pending_reclaims[i_thr].queue);
free(pending_reclaims);
return 0;