4 * Copyright (c) 2003-2008 Fabrice Bellard
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to deal
8 * in the Software without restriction, including without limitation the rights
9 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 * copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
25 #include "qemu-common.h"
26 #include "block/aio.h"
27 #include "block/thread-pool.h"
28 #include "qemu/main-loop.h"
30 /***********************************************************/
31 /* bottom halves (can be seen as timers which expire ASAP) */
43 QEMUBH *aio_bh_new(AioContext *ctx, QEMUBHFunc *cb, void *opaque)
46 bh = g_malloc0(sizeof(QEMUBH));
50 qemu_mutex_lock(&ctx->bh_lock);
51 bh->next = ctx->first_bh;
52 /* Make sure that the members are ready before putting bh into list */
55 qemu_mutex_unlock(&ctx->bh_lock);
59 /* Multiple occurrences of aio_bh_poll cannot be called concurrently */
60 int aio_bh_poll(AioContext *ctx)
62 QEMUBH *bh, **bhp, *next;
68 for (bh = ctx->first_bh; bh; bh = next) {
69 /* Make sure that fetching bh happens before accessing its members */
70 smp_read_barrier_depends();
72 if (!bh->deleted && bh->scheduled) {
74 /* Paired with write barrier in bh schedule to ensure reading for
75 * idle & callbacks coming after bh's scheduling.
87 /* remove deleted bhs */
88 if (!ctx->walking_bh) {
89 qemu_mutex_lock(&ctx->bh_lock);
100 qemu_mutex_unlock(&ctx->bh_lock);
106 void qemu_bh_schedule_idle(QEMUBH *bh)
111 /* Make sure that idle & any writes needed by the callback are done
112 * before the locations are read in the aio_bh_poll.
118 void qemu_bh_schedule(QEMUBH *bh)
127 * 1. idle & any writes needed by the callback are done before the
128 * locations are read in the aio_bh_poll.
129 * 2. ctx is loaded before scheduled is set and the callback has a chance
138 /* This func is async.
140 void qemu_bh_cancel(QEMUBH *bh)
145 /* This func is async.The bottom half will do the delete action at the finial
148 void qemu_bh_delete(QEMUBH *bh)
155 aio_ctx_prepare(GSource *source, gint *timeout)
157 AioContext *ctx = (AioContext *) source;
161 /* We assume there is no timeout already supplied */
163 for (bh = ctx->first_bh; bh; bh = bh->next) {
164 if (!bh->deleted && bh->scheduled) {
166 /* idle bottom halves will be polled at least
170 /* non-idle bottom halves will be executed
178 deadline = qemu_timeout_ns_to_ms(timerlistgroup_deadline_ns(&ctx->tlg));
183 *timeout = qemu_soonest_timeout(*timeout, deadline);
190 aio_ctx_check(GSource *source)
192 AioContext *ctx = (AioContext *) source;
195 for (bh = ctx->first_bh; bh; bh = bh->next) {
196 if (!bh->deleted && bh->scheduled) {
200 return aio_pending(ctx) || (timerlistgroup_deadline_ns(&ctx->tlg) == 0);
204 aio_ctx_dispatch(GSource *source,
205 GSourceFunc callback,
208 AioContext *ctx = (AioContext *) source;
210 assert(callback == NULL);
211 aio_poll(ctx, false);
216 aio_ctx_finalize(GSource *source)
218 AioContext *ctx = (AioContext *) source;
220 thread_pool_free(ctx->thread_pool);
221 aio_set_event_notifier(ctx, &ctx->notifier, NULL);
222 event_notifier_cleanup(&ctx->notifier);
223 rfifolock_destroy(&ctx->lock);
224 qemu_mutex_destroy(&ctx->bh_lock);
225 g_array_free(ctx->pollfds, TRUE);
226 timerlistgroup_deinit(&ctx->tlg);
229 static GSourceFuncs aio_source_funcs = {
236 GSource *aio_get_g_source(AioContext *ctx)
238 g_source_ref(&ctx->source);
242 ThreadPool *aio_get_thread_pool(AioContext *ctx)
244 if (!ctx->thread_pool) {
245 ctx->thread_pool = thread_pool_new(ctx);
247 return ctx->thread_pool;
250 void aio_notify(AioContext *ctx)
252 event_notifier_set(&ctx->notifier);
255 static void aio_timerlist_notify(void *opaque)
260 static void aio_rfifolock_cb(void *opaque)
262 /* Kick owner thread in case they are blocked in aio_poll() */
266 AioContext *aio_context_new(void)
269 ctx = (AioContext *) g_source_new(&aio_source_funcs, sizeof(AioContext));
270 ctx->pollfds = g_array_new(FALSE, FALSE, sizeof(GPollFD));
271 ctx->thread_pool = NULL;
272 qemu_mutex_init(&ctx->bh_lock);
273 rfifolock_init(&ctx->lock, aio_rfifolock_cb, ctx);
274 event_notifier_init(&ctx->notifier, false);
275 aio_set_event_notifier(ctx, &ctx->notifier,
276 (EventNotifierHandler *)
277 event_notifier_test_and_clear);
278 timerlistgroup_init(&ctx->tlg, aio_timerlist_notify, ctx);
283 void aio_context_ref(AioContext *ctx)
285 g_source_ref(&ctx->source);
288 void aio_context_unref(AioContext *ctx)
290 g_source_unref(&ctx->source);
293 void aio_context_acquire(AioContext *ctx)
295 rfifolock_lock(&ctx->lock);
298 void aio_context_release(AioContext *ctx)
300 rfifolock_unlock(&ctx->lock);