static struct cds_lfs_stack_rcu s;
+static
void *thr_enqueuer(void *_count)
{
unsigned long long *count = _count;
free(node);
}
+static
void *thr_dequeuer(void *_count)
{
unsigned long long *count = _count;
return ((void*)2);
}
-void test_end(struct cds_lfs_stack_rcu *s, unsigned long long *nr_dequeues)
+static
+void test_end(unsigned long long *nr_dequeues_l)
{
struct cds_lfs_node_rcu *snode;
do {
- snode = cds_lfs_pop_rcu(s);
+ snode = cds_lfs_pop_rcu(&s);
if (snode) {
struct test *node;
node = caa_container_of(snode, struct test, list);
free(node);
- (*nr_dequeues)++;
+ (*nr_dequeues_l)++;
}
} while (snode);
}
-void show_usage(int argc, char **argv)
+static
+void show_usage(char **argv)
{
printf("Usage : %s nr_dequeuers nr_enqueuers duration (s) <OPTIONS>\n",
argv[0]);
unsigned int i_thr;
if (argc < 4) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
err = sscanf(argv[1], "%u", &nr_dequeuers);
if (err != 1) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
err = sscanf(argv[2], "%u", &nr_enqueuers);
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;
}
switch (argv[i][1]) {
case 'a':
if (argc < i + 2) {
- show_usage(argc, argv);
+ show_usage(argv);
return -1;
}
a = atoi(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]);
tot_successful_dequeues += count_dequeuer[2 * i_thr + 1];
}
- test_end(&s, &end_dequeues);
+ test_end(&end_dequeues);
printf_verbose("total number of enqueues : %llu, dequeues %llu\n",
tot_enqueues, tot_dequeues);