2 * QEMU block layer thread pool
4 * Copyright IBM, Corp. 2008
5 * Copyright Red Hat, Inc. 2012
8 * Anthony Liguori <aliguori@us.ibm.com>
9 * Paolo Bonzini <pbonzini@redhat.com>
11 * This work is licensed under the terms of the GNU GPL, version 2. See
12 * the COPYING file in the top-level directory.
14 * Contributions after 2012-01-13 are licensed under the terms of the
15 * GNU GPL, version 2 or (at your option) any later version.
17 #include "qemu-common.h"
18 #include "qemu/queue.h"
19 #include "qemu/thread.h"
20 #include "qemu/osdep.h"
21 #include "block/coroutine.h"
23 #include "block/thread-pool.h"
24 #include "qemu/main-loop.h"
26 static void do_spawn_thread(ThreadPool
*pool
);
28 typedef struct ThreadPoolElement ThreadPoolElement
;
36 struct ThreadPoolElement
{
42 /* Moving state out of THREAD_QUEUED is protected by lock. After
43 * that, only the worker thread can write to it. Reads and writes
44 * of state and ret are ordered with memory barriers.
46 enum ThreadState state
;
49 /* Access to this list is protected by lock. */
50 QTAILQ_ENTRY(ThreadPoolElement
) reqs
;
52 /* Access to this list is protected by the global mutex. */
53 QLIST_ENTRY(ThreadPoolElement
) all
;
58 QEMUBH
*completion_bh
;
60 QemuCond worker_stopped
;
63 QEMUBH
*new_thread_bh
;
65 /* The following variables are only accessed from one AioContext. */
66 QLIST_HEAD(, ThreadPoolElement
) head
;
68 /* The following variables are protected by lock. */
69 QTAILQ_HEAD(, ThreadPoolElement
) request_list
;
72 int new_threads
; /* backlog of threads we need to create */
73 int pending_threads
; /* threads created but not running yet */
77 static void *worker_thread(void *opaque
)
79 ThreadPool
*pool
= opaque
;
81 qemu_mutex_lock(&pool
->lock
);
82 pool
->pending_threads
--;
83 do_spawn_thread(pool
);
85 while (!pool
->stopping
) {
86 ThreadPoolElement
*req
;
91 qemu_mutex_unlock(&pool
->lock
);
92 ret
= qemu_sem_timedwait(&pool
->sem
, 10000);
93 qemu_mutex_lock(&pool
->lock
);
95 } while (ret
== -1 && !QTAILQ_EMPTY(&pool
->request_list
));
96 if (ret
== -1 || pool
->stopping
) {
100 req
= QTAILQ_FIRST(&pool
->request_list
);
101 QTAILQ_REMOVE(&pool
->request_list
, req
, reqs
);
102 req
->state
= THREAD_ACTIVE
;
103 qemu_mutex_unlock(&pool
->lock
);
105 ret
= req
->func(req
->arg
);
108 /* Write ret before state. */
110 req
->state
= THREAD_DONE
;
112 qemu_mutex_lock(&pool
->lock
);
114 qemu_bh_schedule(pool
->completion_bh
);
118 qemu_cond_signal(&pool
->worker_stopped
);
119 qemu_mutex_unlock(&pool
->lock
);
123 static void do_spawn_thread(ThreadPool
*pool
)
127 /* Runs with lock taken. */
128 if (!pool
->new_threads
) {
133 pool
->pending_threads
++;
135 qemu_thread_create(&t
, "worker", worker_thread
, pool
, QEMU_THREAD_DETACHED
);
138 static void spawn_thread_bh_fn(void *opaque
)
140 ThreadPool
*pool
= opaque
;
142 qemu_mutex_lock(&pool
->lock
);
143 do_spawn_thread(pool
);
144 qemu_mutex_unlock(&pool
->lock
);
147 static void spawn_thread(ThreadPool
*pool
)
151 /* If there are threads being created, they will spawn new workers, so
152 * we don't spend time creating many threads in a loop holding a mutex or
153 * starving the current vcpu.
155 * If there are no idle threads, ask the main thread to create one, so we
156 * inherit the correct affinity instead of the vcpu affinity.
158 if (!pool
->pending_threads
) {
159 qemu_bh_schedule(pool
->new_thread_bh
);
163 static void thread_pool_completion_bh(void *opaque
)
165 ThreadPool
*pool
= opaque
;
166 ThreadPoolElement
*elem
, *next
;
169 QLIST_FOREACH_SAFE(elem
, &pool
->head
, all
, next
) {
170 if (elem
->state
!= THREAD_DONE
) {
173 if (elem
->state
== THREAD_DONE
) {
174 trace_thread_pool_complete(pool
, elem
, elem
->common
.opaque
,
177 if (elem
->state
== THREAD_DONE
&& elem
->common
.cb
) {
178 QLIST_REMOVE(elem
, all
);
179 /* Read state before ret. */
182 /* Schedule ourselves in case elem->common.cb() calls aio_poll() to
183 * wait for another request that completed at the same time.
185 qemu_bh_schedule(pool
->completion_bh
);
187 elem
->common
.cb(elem
->common
.opaque
, elem
->ret
);
188 qemu_aio_unref(elem
);
191 /* remove the request */
192 QLIST_REMOVE(elem
, all
);
193 qemu_aio_unref(elem
);
198 static void thread_pool_cancel(BlockAIOCB
*acb
)
200 ThreadPoolElement
*elem
= (ThreadPoolElement
*)acb
;
201 ThreadPool
*pool
= elem
->pool
;
203 trace_thread_pool_cancel(elem
, elem
->common
.opaque
);
205 qemu_mutex_lock(&pool
->lock
);
206 if (elem
->state
== THREAD_QUEUED
&&
207 /* No thread has yet started working on elem. we can try to "steal"
208 * the item from the worker if we can get a signal from the
209 * semaphore. Because this is non-blocking, we can do it with
210 * the lock taken and ensure that elem will remain THREAD_QUEUED.
212 qemu_sem_timedwait(&pool
->sem
, 0) == 0) {
213 QTAILQ_REMOVE(&pool
->request_list
, elem
, reqs
);
214 qemu_bh_schedule(pool
->completion_bh
);
216 elem
->state
= THREAD_DONE
;
217 elem
->ret
= -ECANCELED
;
220 qemu_mutex_unlock(&pool
->lock
);
223 static AioContext
*thread_pool_get_aio_context(BlockAIOCB
*acb
)
225 ThreadPoolElement
*elem
= (ThreadPoolElement
*)acb
;
226 ThreadPool
*pool
= elem
->pool
;
230 static const AIOCBInfo thread_pool_aiocb_info
= {
231 .aiocb_size
= sizeof(ThreadPoolElement
),
232 .cancel_async
= thread_pool_cancel
,
233 .get_aio_context
= thread_pool_get_aio_context
,
236 BlockAIOCB
*thread_pool_submit_aio(ThreadPool
*pool
,
237 ThreadPoolFunc
*func
, void *arg
,
238 BlockCompletionFunc
*cb
, void *opaque
)
240 ThreadPoolElement
*req
;
242 req
= qemu_aio_get(&thread_pool_aiocb_info
, NULL
, cb
, opaque
);
245 req
->state
= THREAD_QUEUED
;
248 QLIST_INSERT_HEAD(&pool
->head
, req
, all
);
250 trace_thread_pool_submit(pool
, req
, arg
);
252 qemu_mutex_lock(&pool
->lock
);
253 if (pool
->idle_threads
== 0 && pool
->cur_threads
< pool
->max_threads
) {
256 QTAILQ_INSERT_TAIL(&pool
->request_list
, req
, reqs
);
257 qemu_mutex_unlock(&pool
->lock
);
258 qemu_sem_post(&pool
->sem
);
262 typedef struct ThreadPoolCo
{
267 static void thread_pool_co_cb(void *opaque
, int ret
)
269 ThreadPoolCo
*co
= opaque
;
272 qemu_coroutine_enter(co
->co
, NULL
);
275 int coroutine_fn
thread_pool_submit_co(ThreadPool
*pool
, ThreadPoolFunc
*func
,
278 ThreadPoolCo tpc
= { .co
= qemu_coroutine_self(), .ret
= -EINPROGRESS
};
279 assert(qemu_in_coroutine());
280 thread_pool_submit_aio(pool
, func
, arg
, thread_pool_co_cb
, &tpc
);
281 qemu_coroutine_yield();
285 void thread_pool_submit(ThreadPool
*pool
, ThreadPoolFunc
*func
, void *arg
)
287 thread_pool_submit_aio(pool
, func
, arg
, NULL
, NULL
);
290 static void thread_pool_init_one(ThreadPool
*pool
, AioContext
*ctx
)
293 ctx
= qemu_get_aio_context();
296 memset(pool
, 0, sizeof(*pool
));
298 pool
->completion_bh
= aio_bh_new(ctx
, thread_pool_completion_bh
, pool
);
299 qemu_mutex_init(&pool
->lock
);
300 qemu_cond_init(&pool
->worker_stopped
);
301 qemu_sem_init(&pool
->sem
, 0);
302 pool
->max_threads
= 64;
303 pool
->new_thread_bh
= aio_bh_new(ctx
, spawn_thread_bh_fn
, pool
);
305 QLIST_INIT(&pool
->head
);
306 QTAILQ_INIT(&pool
->request_list
);
309 ThreadPool
*thread_pool_new(AioContext
*ctx
)
311 ThreadPool
*pool
= g_new(ThreadPool
, 1);
312 thread_pool_init_one(pool
, ctx
);
316 void thread_pool_free(ThreadPool
*pool
)
322 assert(QLIST_EMPTY(&pool
->head
));
324 qemu_mutex_lock(&pool
->lock
);
326 /* Stop new threads from spawning */
327 qemu_bh_delete(pool
->new_thread_bh
);
328 pool
->cur_threads
-= pool
->new_threads
;
329 pool
->new_threads
= 0;
331 /* Wait for worker threads to terminate */
332 pool
->stopping
= true;
333 while (pool
->cur_threads
> 0) {
334 qemu_sem_post(&pool
->sem
);
335 qemu_cond_wait(&pool
->worker_stopped
, &pool
->lock
);
338 qemu_mutex_unlock(&pool
->lock
);
340 qemu_bh_delete(pool
->completion_bh
);
341 qemu_sem_destroy(&pool
->sem
);
342 qemu_cond_destroy(&pool
->worker_stopped
);
343 qemu_mutex_destroy(&pool
->lock
);