#include <urcu/arch.h>
#include <urcu/tls-compat.h>
-#include "cpuset.h"
#include "thread-id.h"
/* hardcoded number of CPUs */
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 */
}
tot_successful_dequeues = 0;
unsigned long long end_dequeues = 0;
int i, a;
+ unsigned int i_thr;
if (argc < 4) {
show_usage(argc, argv);
show_usage(argc, argv);
return -1;
}
-
+
err = sscanf(argv[3], "%lu", &duration);
if (err != 1) {
show_usage(argc, argv);
next_aff = 0;
- for (i = 0; i < nr_enqueuers; i++) {
- err = pthread_create(&tid_enqueuer[i], NULL, thr_enqueuer,
- &count_enqueuer[2 * i]);
+ for (i_thr = 0; i_thr < nr_enqueuers; i_thr++) {
+ err = pthread_create(&tid_enqueuer[i_thr], NULL, thr_enqueuer,
+ &count_enqueuer[2 * i_thr]);
if (err != 0)
exit(1);
}
- for (i = 0; i < nr_dequeuers; i++) {
- err = pthread_create(&tid_dequeuer[i], NULL, thr_dequeuer,
- &count_dequeuer[2 * i]);
+ for (i_thr = 0; i_thr < nr_dequeuers; i_thr++) {
+ err = pthread_create(&tid_dequeuer[i_thr], NULL, thr_dequeuer,
+ &count_dequeuer[2 * i_thr]);
if (err != 0)
exit(1);
}
test_go = 1;
- for (i = 0; i < duration; i++) {
+ for (i_thr = 0; i_thr < duration; i_thr++) {
sleep(1);
if (verbose_mode) {
fwrite(".", sizeof(char), 1, stdout);
test_stop = 1;
- for (i = 0; i < nr_enqueuers; i++) {
- err = pthread_join(tid_enqueuer[i], &tret);
+ for (i_thr = 0; i_thr < nr_enqueuers; i_thr++) {
+ err = pthread_join(tid_enqueuer[i_thr], &tret);
if (err != 0)
exit(1);
- tot_enqueues += count_enqueuer[2 * i];
- tot_successful_enqueues += count_enqueuer[2 * i + 1];
+ tot_enqueues += count_enqueuer[2 * i_thr];
+ tot_successful_enqueues += count_enqueuer[2 * i_thr + 1];
}
- for (i = 0; i < nr_dequeuers; i++) {
- err = pthread_join(tid_dequeuer[i], &tret);
+ for (i_thr = 0; i_thr < nr_dequeuers; i_thr++) {
+ err = pthread_join(tid_dequeuer[i_thr], &tret);
if (err != 0)
exit(1);
- tot_dequeues += count_dequeuer[2 * i];
- tot_successful_dequeues += count_dequeuer[2 * i + 1];
+ tot_dequeues += count_dequeuer[2 * i_thr];
+ tot_successful_dequeues += count_dequeuer[2 * i_thr + 1];
}
-
+
test_end(&q, &end_dequeues);
printf_verbose("total number of enqueues : %llu, dequeues %llu\n",
free(count_dequeuer);
free(tid_enqueuer);
free(tid_dequeuer);
+
return 0;
}