hw/intc/arm_gicv3: Implement EL2 traps for CPU i/f regs
[qemu/ar7.git] / async.c
blob0d218ab0e083d0c58561f7d55c8f8a980ecea1f3
1 /*
2 * QEMU System Emulator
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
22 * THE SOFTWARE.
25 #include "qemu/osdep.h"
26 #include "qapi/error.h"
27 #include "qemu-common.h"
28 #include "block/aio.h"
29 #include "block/thread-pool.h"
30 #include "qemu/main-loop.h"
31 #include "qemu/atomic.h"
32 #include "block/raw-aio.h"
34 /***********************************************************/
35 /* bottom halves (can be seen as timers which expire ASAP) */
37 struct QEMUBH {
38 AioContext *ctx;
39 QEMUBHFunc *cb;
40 void *opaque;
41 QEMUBH *next;
42 bool scheduled;
43 bool idle;
44 bool deleted;
47 void aio_bh_schedule_oneshot(AioContext *ctx, QEMUBHFunc *cb, void *opaque)
49 QEMUBH *bh;
50 bh = g_new(QEMUBH, 1);
51 *bh = (QEMUBH){
52 .ctx = ctx,
53 .cb = cb,
54 .opaque = opaque,
56 qemu_lockcnt_lock(&ctx->list_lock);
57 bh->next = ctx->first_bh;
58 bh->scheduled = 1;
59 bh->deleted = 1;
60 /* Make sure that the members are ready before putting bh into list */
61 smp_wmb();
62 ctx->first_bh = bh;
63 qemu_lockcnt_unlock(&ctx->list_lock);
64 aio_notify(ctx);
67 QEMUBH *aio_bh_new(AioContext *ctx, QEMUBHFunc *cb, void *opaque)
69 QEMUBH *bh;
70 bh = g_new(QEMUBH, 1);
71 *bh = (QEMUBH){
72 .ctx = ctx,
73 .cb = cb,
74 .opaque = opaque,
76 qemu_lockcnt_lock(&ctx->list_lock);
77 bh->next = ctx->first_bh;
78 /* Make sure that the members are ready before putting bh into list */
79 smp_wmb();
80 ctx->first_bh = bh;
81 qemu_lockcnt_unlock(&ctx->list_lock);
82 return bh;
85 void aio_bh_call(QEMUBH *bh)
87 bh->cb(bh->opaque);
90 /* Multiple occurrences of aio_bh_poll cannot be called concurrently */
91 int aio_bh_poll(AioContext *ctx)
93 QEMUBH *bh, **bhp, *next;
94 int ret;
95 bool deleted = false;
97 qemu_lockcnt_inc(&ctx->list_lock);
99 ret = 0;
100 for (bh = atomic_rcu_read(&ctx->first_bh); bh; bh = next) {
101 next = atomic_rcu_read(&bh->next);
102 /* The atomic_xchg is paired with the one in qemu_bh_schedule. The
103 * implicit memory barrier ensures that the callback sees all writes
104 * done by the scheduling thread. It also ensures that the scheduling
105 * thread sees the zero before bh->cb has run, and thus will call
106 * aio_notify again if necessary.
108 if (atomic_xchg(&bh->scheduled, 0)) {
109 /* Idle BHs don't count as progress */
110 if (!bh->idle) {
111 ret = 1;
113 bh->idle = 0;
114 aio_bh_call(bh);
116 if (bh->deleted) {
117 deleted = true;
121 /* remove deleted bhs */
122 if (!deleted) {
123 qemu_lockcnt_dec(&ctx->list_lock);
124 return ret;
127 if (qemu_lockcnt_dec_and_lock(&ctx->list_lock)) {
128 bhp = &ctx->first_bh;
129 while (*bhp) {
130 bh = *bhp;
131 if (bh->deleted && !bh->scheduled) {
132 *bhp = bh->next;
133 g_free(bh);
134 } else {
135 bhp = &bh->next;
138 qemu_lockcnt_unlock(&ctx->list_lock);
140 return ret;
143 void qemu_bh_schedule_idle(QEMUBH *bh)
145 bh->idle = 1;
146 /* Make sure that idle & any writes needed by the callback are done
147 * before the locations are read in the aio_bh_poll.
149 atomic_mb_set(&bh->scheduled, 1);
152 void qemu_bh_schedule(QEMUBH *bh)
154 AioContext *ctx;
156 ctx = bh->ctx;
157 bh->idle = 0;
158 /* The memory barrier implicit in atomic_xchg makes sure that:
159 * 1. idle & any writes needed by the callback are done before the
160 * locations are read in the aio_bh_poll.
161 * 2. ctx is loaded before scheduled is set and the callback has a chance
162 * to execute.
164 if (atomic_xchg(&bh->scheduled, 1) == 0) {
165 aio_notify(ctx);
170 /* This func is async.
172 void qemu_bh_cancel(QEMUBH *bh)
174 bh->scheduled = 0;
177 /* This func is async.The bottom half will do the delete action at the finial
178 * end.
180 void qemu_bh_delete(QEMUBH *bh)
182 bh->scheduled = 0;
183 bh->deleted = 1;
186 int64_t
187 aio_compute_timeout(AioContext *ctx)
189 int64_t deadline;
190 int timeout = -1;
191 QEMUBH *bh;
193 for (bh = atomic_rcu_read(&ctx->first_bh); bh;
194 bh = atomic_rcu_read(&bh->next)) {
195 if (bh->scheduled) {
196 if (bh->idle) {
197 /* idle bottom halves will be polled at least
198 * every 10ms */
199 timeout = 10000000;
200 } else {
201 /* non-idle bottom halves will be executed
202 * immediately */
203 return 0;
208 deadline = timerlistgroup_deadline_ns(&ctx->tlg);
209 if (deadline == 0) {
210 return 0;
211 } else {
212 return qemu_soonest_timeout(timeout, deadline);
216 static gboolean
217 aio_ctx_prepare(GSource *source, gint *timeout)
219 AioContext *ctx = (AioContext *) source;
221 atomic_or(&ctx->notify_me, 1);
223 /* We assume there is no timeout already supplied */
224 *timeout = qemu_timeout_ns_to_ms(aio_compute_timeout(ctx));
226 if (aio_prepare(ctx)) {
227 *timeout = 0;
230 return *timeout == 0;
233 static gboolean
234 aio_ctx_check(GSource *source)
236 AioContext *ctx = (AioContext *) source;
237 QEMUBH *bh;
239 atomic_and(&ctx->notify_me, ~1);
240 aio_notify_accept(ctx);
242 for (bh = ctx->first_bh; bh; bh = bh->next) {
243 if (bh->scheduled) {
244 return true;
247 return aio_pending(ctx) || (timerlistgroup_deadline_ns(&ctx->tlg) == 0);
250 static gboolean
251 aio_ctx_dispatch(GSource *source,
252 GSourceFunc callback,
253 gpointer user_data)
255 AioContext *ctx = (AioContext *) source;
257 assert(callback == NULL);
258 aio_dispatch(ctx, true);
259 return true;
262 static void
263 aio_ctx_finalize(GSource *source)
265 AioContext *ctx = (AioContext *) source;
267 thread_pool_free(ctx->thread_pool);
269 #ifdef CONFIG_LINUX_AIO
270 if (ctx->linux_aio) {
271 laio_detach_aio_context(ctx->linux_aio, ctx);
272 laio_cleanup(ctx->linux_aio);
273 ctx->linux_aio = NULL;
275 #endif
277 qemu_lockcnt_lock(&ctx->list_lock);
278 assert(!qemu_lockcnt_count(&ctx->list_lock));
279 while (ctx->first_bh) {
280 QEMUBH *next = ctx->first_bh->next;
282 /* qemu_bh_delete() must have been called on BHs in this AioContext */
283 assert(ctx->first_bh->deleted);
285 g_free(ctx->first_bh);
286 ctx->first_bh = next;
288 qemu_lockcnt_unlock(&ctx->list_lock);
290 aio_set_event_notifier(ctx, &ctx->notifier, false, NULL, NULL);
291 event_notifier_cleanup(&ctx->notifier);
292 qemu_rec_mutex_destroy(&ctx->lock);
293 qemu_lockcnt_destroy(&ctx->list_lock);
294 timerlistgroup_deinit(&ctx->tlg);
297 static GSourceFuncs aio_source_funcs = {
298 aio_ctx_prepare,
299 aio_ctx_check,
300 aio_ctx_dispatch,
301 aio_ctx_finalize
304 GSource *aio_get_g_source(AioContext *ctx)
306 g_source_ref(&ctx->source);
307 return &ctx->source;
310 ThreadPool *aio_get_thread_pool(AioContext *ctx)
312 if (!ctx->thread_pool) {
313 ctx->thread_pool = thread_pool_new(ctx);
315 return ctx->thread_pool;
318 #ifdef CONFIG_LINUX_AIO
319 LinuxAioState *aio_get_linux_aio(AioContext *ctx)
321 if (!ctx->linux_aio) {
322 ctx->linux_aio = laio_init();
323 laio_attach_aio_context(ctx->linux_aio, ctx);
325 return ctx->linux_aio;
327 #endif
329 void aio_notify(AioContext *ctx)
331 /* Write e.g. bh->scheduled before reading ctx->notify_me. Pairs
332 * with atomic_or in aio_ctx_prepare or atomic_add in aio_poll.
334 smp_mb();
335 if (ctx->notify_me) {
336 event_notifier_set(&ctx->notifier);
337 atomic_mb_set(&ctx->notified, true);
341 void aio_notify_accept(AioContext *ctx)
343 if (atomic_xchg(&ctx->notified, false)) {
344 event_notifier_test_and_clear(&ctx->notifier);
348 static void aio_timerlist_notify(void *opaque)
350 aio_notify(opaque);
353 static void event_notifier_dummy_cb(EventNotifier *e)
357 /* Returns true if aio_notify() was called (e.g. a BH was scheduled) */
358 static bool event_notifier_poll(void *opaque)
360 EventNotifier *e = opaque;
361 AioContext *ctx = container_of(e, AioContext, notifier);
363 return atomic_read(&ctx->notified);
366 AioContext *aio_context_new(Error **errp)
368 int ret;
369 AioContext *ctx;
371 ctx = (AioContext *) g_source_new(&aio_source_funcs, sizeof(AioContext));
372 aio_context_setup(ctx);
374 ret = event_notifier_init(&ctx->notifier, false);
375 if (ret < 0) {
376 error_setg_errno(errp, -ret, "Failed to initialize event notifier");
377 goto fail;
379 g_source_set_can_recurse(&ctx->source, true);
380 qemu_lockcnt_init(&ctx->list_lock);
381 aio_set_event_notifier(ctx, &ctx->notifier,
382 false,
383 (EventNotifierHandler *)
384 event_notifier_dummy_cb,
385 event_notifier_poll);
386 #ifdef CONFIG_LINUX_AIO
387 ctx->linux_aio = NULL;
388 #endif
389 ctx->thread_pool = NULL;
390 qemu_rec_mutex_init(&ctx->lock);
391 timerlistgroup_init(&ctx->tlg, aio_timerlist_notify, ctx);
393 ctx->poll_ns = 0;
394 ctx->poll_max_ns = 0;
395 ctx->poll_grow = 0;
396 ctx->poll_shrink = 0;
398 return ctx;
399 fail:
400 g_source_destroy(&ctx->source);
401 return NULL;
404 void aio_context_ref(AioContext *ctx)
406 g_source_ref(&ctx->source);
409 void aio_context_unref(AioContext *ctx)
411 g_source_unref(&ctx->source);
414 void aio_context_acquire(AioContext *ctx)
416 qemu_rec_mutex_lock(&ctx->lock);
419 void aio_context_release(AioContext *ctx)
421 qemu_rec_mutex_unlock(&ctx->lock);