4 * usage: rcuq_test <readers> <duration>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
20 * Copyright (c) 2013 Mike D. Day, IBM Corporation.
23 #include "qemu/osdep.h"
25 #include "qemu/atomic.h"
27 #include "qemu/thread.h"
28 #include "qemu/rcu_queue.h"
34 static QemuMutex counts_mutex;
35 static long long n_reads = 0LL;
36 static long long n_updates = 0LL;
37 static long long n_reclaims = 0LL;
38 static long long n_nodes_removed = 0LL;
39 static long long n_nodes = 0LL;
40 static int g_test_in_charge = 0;
42 static int nthreadsrunning;
48 static volatile int goflag = GOFLAG_INIT;
50 #define RCU_READ_RUN 1000
51 #define RCU_UPDATE_RUN 10
52 #define NR_THREADS 100
55 static QemuThread threads[NR_THREADS];
56 static struct rcu_reader_data *data[NR_THREADS];
59 static int select_random_el(int max)
61 return (rand() % max);
65 static void create_thread(void *(*func)(void *))
67 if (n_threads >= NR_THREADS) {
68 fprintf(stderr, "Thread limit of %d exceeded!\n", NR_THREADS);
71 qemu_thread_create(&threads[n_threads], "test", func, &data[n_threads],
72 QEMU_THREAD_JOINABLE);
76 static void wait_all_threads(void)
80 for (i = 0; i < n_threads; i++) {
81 qemu_thread_join(&threads[i]);
88 QLIST_ENTRY(list_element) entry;
92 static void reclaim_list_el(struct rcu_head *prcu)
94 struct list_element *el = container_of(prcu, struct list_element, rcu);
96 /* Accessed only from call_rcu thread. */
100 static QLIST_HEAD(q_list_head, list_element) Q_list_head;
102 static void *rcu_q_reader(void *arg)
104 long long n_reads_local = 0;
105 struct list_element *el;
107 rcu_register_thread();
109 *(struct rcu_reader_data **)arg = &rcu_reader;
110 atomic_inc(&nthreadsrunning);
111 while (goflag == GOFLAG_INIT) {
115 while (goflag == GOFLAG_RUN) {
117 QLIST_FOREACH_RCU(el, &Q_list_head, entry) {
119 if (goflag == GOFLAG_STOP) {
127 qemu_mutex_lock(&counts_mutex);
128 n_reads += n_reads_local;
129 qemu_mutex_unlock(&counts_mutex);
131 rcu_unregister_thread();
136 static void *rcu_q_updater(void *arg)
139 long long n_nodes_local = 0;
140 long long n_updates_local = 0;
141 long long n_removed_local = 0;
142 struct list_element *el, *prev_el;
144 *(struct rcu_reader_data **)arg = &rcu_reader;
145 atomic_inc(&nthreadsrunning);
146 while (goflag == GOFLAG_INIT) {
150 while (goflag == GOFLAG_RUN) {
151 target_el = select_random_el(RCU_Q_LEN);
153 /* FOREACH_RCU could work here but let's use both macros */
154 QLIST_FOREACH_SAFE_RCU(prev_el, &Q_list_head, entry, el) {
156 if (target_el == j) {
157 QLIST_REMOVE_RCU(prev_el, entry);
158 /* may be more than one updater in the future */
159 call_rcu1(&prev_el->rcu, reclaim_list_el);
164 if (goflag == GOFLAG_STOP) {
167 target_el = select_random_el(RCU_Q_LEN);
169 QLIST_FOREACH_RCU(el, &Q_list_head, entry) {
171 if (target_el == j) {
172 prev_el = g_new(struct list_element, 1);
173 n_nodes += n_nodes_local;
174 QLIST_INSERT_BEFORE_RCU(el, prev_el, entry);
179 n_updates_local += 2;
183 qemu_mutex_lock(&counts_mutex);
184 n_nodes += n_nodes_local;
185 n_updates += n_updates_local;
186 n_nodes_removed += n_removed_local;
187 qemu_mutex_unlock(&counts_mutex);
191 static void rcu_qtest_init(void)
193 struct list_element *new_el;
197 for (i = 0; i < RCU_Q_LEN; i++) {
198 new_el = g_new(struct list_element, 1);
199 QLIST_INSERT_HEAD_RCU(&Q_list_head, new_el, entry);
201 qemu_mutex_lock(&counts_mutex);
202 n_nodes += RCU_Q_LEN;
203 qemu_mutex_unlock(&counts_mutex);
206 static void rcu_qtest_run(int duration, int nreaders)
208 int nthreads = nreaders + 1;
209 while (atomic_read(&nthreadsrunning) < nthreads) {
215 goflag = GOFLAG_STOP;
220 static void rcu_qtest(const char *test, int duration, int nreaders)
223 long long n_removed_local = 0;
225 struct list_element *el, *prev_el;
228 for (i = 0; i < nreaders; i++) {
229 create_thread(rcu_q_reader);
231 create_thread(rcu_q_updater);
232 rcu_qtest_run(duration, nreaders);
234 QLIST_FOREACH_SAFE_RCU(prev_el, &Q_list_head, entry, el) {
235 QLIST_REMOVE_RCU(prev_el, entry);
236 call_rcu1(&prev_el->rcu, reclaim_list_el);
239 qemu_mutex_lock(&counts_mutex);
240 n_nodes_removed += n_removed_local;
241 qemu_mutex_unlock(&counts_mutex);
243 while (n_nodes_removed > n_reclaims) {
247 if (g_test_in_charge) {
248 g_assert_cmpint(n_nodes_removed, ==, n_reclaims);
250 printf("%s: %d readers; 1 updater; nodes read: " \
251 "%lld, nodes removed: %lld; nodes reclaimed: %lld\n",
252 test, nthreadsrunning - 1, n_reads, n_nodes_removed, n_reclaims);
257 static void usage(int argc, char *argv[])
259 fprintf(stderr, "Usage: %s duration nreaders\n", argv[0]);
263 static int gtest_seconds;
265 static void gtest_rcuq_one(void)
267 rcu_qtest("rcuqtest", gtest_seconds / 4, 1);
270 static void gtest_rcuq_few(void)
272 rcu_qtest("rcuqtest", gtest_seconds / 4, 5);
275 static void gtest_rcuq_many(void)
277 rcu_qtest("rcuqtest", gtest_seconds / 2, 20);
281 int main(int argc, char *argv[])
283 int duration = 0, readers = 0;
285 qemu_mutex_init(&counts_mutex);
287 if (argv[1][0] == '-') {
288 g_test_init(&argc, &argv, NULL);
289 if (g_test_quick()) {
294 g_test_add_func("/rcu/qlist/single-threaded", gtest_rcuq_one);
295 g_test_add_func("/rcu/qlist/short-few", gtest_rcuq_few);
296 g_test_add_func("/rcu/qlist/long-many", gtest_rcuq_many);
297 g_test_in_charge = 1;
300 duration = strtoul(argv[1], NULL, 0);
303 readers = strtoul(argv[2], NULL, 0);
305 if (duration && readers) {
306 rcu_qtest(argv[0], duration, readers);