1 #include "qemu/osdep.h"
2 #include "qemu/thread.h"
3 #include "qemu/host-utils.h"
4 #include "qemu/processor.h"
15 static QemuThread *threads;
16 static struct thread_info *th_info;
17 static unsigned int n_threads = 1;
18 static unsigned int n_ready_threads;
19 static struct count *counts;
20 static unsigned int duration = 1;
21 static unsigned int range = 1024;
22 static bool use_mutex;
23 static bool test_start;
24 static bool test_stop;
26 static const char commands_string[] =
27 " -n = number of threads\n"
28 " -m = use mutexes instead of atomic increments\n"
29 " -d = duration in seconds\n"
30 " -r = range (will be rounded up to pow2)";
32 static void usage_complete(char *argv[])
34 fprintf(stderr, "Usage: %s [options]\n", argv[0]);
35 fprintf(stderr, "options:\n%s\n", commands_string);
39 * From: https://en.wikipedia.org/wiki/Xorshift
40 * This is faster than rand_r(), and gives us a wider range (RAND_MAX is only
41 * guaranteed to be >= INT_MAX).
43 static uint64_t xorshift64star(uint64_t x)
48 return x * UINT64_C(2685821657736338717);
51 static void *thread_func(void *arg)
53 struct thread_info *info = arg;
55 atomic_inc(&n_ready_threads);
56 while (!atomic_read(&test_start)) {
60 while (!atomic_read(&test_stop)) {
63 info->r = xorshift64star(info->r);
64 index = info->r & (range - 1);
66 qemu_mutex_lock(&counts[index].lock);
67 counts[index].val += 1;
68 qemu_mutex_unlock(&counts[index].lock);
70 atomic_inc(&counts[index].val);
76 static void run_test(void)
78 unsigned int remaining;
81 while (atomic_read(&n_ready_threads) != n_threads) {
84 atomic_set(&test_start, true);
86 remaining = sleep(duration);
88 atomic_set(&test_stop, true);
90 for (i = 0; i < n_threads; i++) {
91 qemu_thread_join(&threads[i]);
95 static void create_threads(void)
99 threads = g_new(QemuThread, n_threads);
100 th_info = g_new(struct thread_info, n_threads);
101 counts = qemu_memalign(64, sizeof(*counts) * range);
102 memset(counts, 0, sizeof(*counts) * range);
103 for (i = 0; i < range; i++) {
104 qemu_mutex_init(&counts[i].lock);
107 for (i = 0; i < n_threads; i++) {
108 struct thread_info *info = &th_info[i];
110 info->r = (i + 1) ^ time(NULL);
111 qemu_thread_create(&threads[i], NULL, thread_func, info,
112 QEMU_THREAD_JOINABLE);
116 static void pr_params(void)
118 printf("Parameters:\n");
119 printf(" # of threads: %u\n", n_threads);
120 printf(" duration: %u\n", duration);
121 printf(" ops' range: %u\n", range);
124 static void pr_stats(void)
126 unsigned long long val = 0;
130 for (i = 0; i < range; i++) {
131 val += counts[i].val;
133 tx = val / duration / 1e6;
135 printf("Results:\n");
136 printf("Duration: %u s\n", duration);
137 printf(" Throughput: %.2f Mops/s\n", tx);
138 printf(" Throughput/thread: %.2f Mops/s/thread\n", tx / n_threads);
141 static void parse_args(int argc, char *argv[])
146 c = getopt(argc, argv, "hd:n:mr:");
152 usage_complete(argv);
155 duration = atoi(optarg);
158 n_threads = atoi(optarg);
164 range = pow2ceil(atoi(optarg));
170 int main(int argc, char *argv[])
172 parse_args(argc, argv);