]> git.proxmox.com Git - mirror_qemu.git/blame - async.c
spapr: Refactor spapr_populate_memory() to allow memoryless nodes
[mirror_qemu.git] / async.c
CommitLineData
4f999d05
KW
1/*
2 * QEMU System Emulator
3 *
4 * Copyright (c) 2003-2008 Fabrice Bellard
5 *
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:
12 *
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
15 *
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.
23 */
24
25#include "qemu-common.h"
737e150e 26#include "block/aio.h"
9b34277d 27#include "block/thread-pool.h"
1de7afc9 28#include "qemu/main-loop.h"
0ceb849b 29#include "qemu/atomic.h"
9a1e9481 30
4f999d05
KW
31/***********************************************************/
32/* bottom halves (can be seen as timers which expire ASAP) */
33
34struct QEMUBH {
2f4dc3c1 35 AioContext *ctx;
4f999d05
KW
36 QEMUBHFunc *cb;
37 void *opaque;
4f999d05 38 QEMUBH *next;
9b47b17e
SW
39 bool scheduled;
40 bool idle;
41 bool deleted;
4f999d05
KW
42};
43
f627aab1 44QEMUBH *aio_bh_new(AioContext *ctx, QEMUBHFunc *cb, void *opaque)
4f999d05
KW
45{
46 QEMUBH *bh;
7267c094 47 bh = g_malloc0(sizeof(QEMUBH));
2f4dc3c1 48 bh->ctx = ctx;
4f999d05
KW
49 bh->cb = cb;
50 bh->opaque = opaque;
dcc772e2 51 qemu_mutex_lock(&ctx->bh_lock);
f627aab1 52 bh->next = ctx->first_bh;
dcc772e2
LPF
53 /* Make sure that the members are ready before putting bh into list */
54 smp_wmb();
f627aab1 55 ctx->first_bh = bh;
dcc772e2 56 qemu_mutex_unlock(&ctx->bh_lock);
4f999d05
KW
57 return bh;
58}
59
dcc772e2 60/* Multiple occurrences of aio_bh_poll cannot be called concurrently */
f627aab1 61int aio_bh_poll(AioContext *ctx)
4f999d05 62{
7887f620 63 QEMUBH *bh, **bhp, *next;
4f999d05 64 int ret;
648fb0ea 65
f627aab1 66 ctx->walking_bh++;
4f999d05
KW
67
68 ret = 0;
f627aab1 69 for (bh = ctx->first_bh; bh; bh = next) {
dcc772e2
LPF
70 /* Make sure that fetching bh happens before accessing its members */
71 smp_read_barrier_depends();
7887f620 72 next = bh->next;
4f999d05
KW
73 if (!bh->deleted && bh->scheduled) {
74 bh->scheduled = 0;
dcc772e2
LPF
75 /* Paired with write barrier in bh schedule to ensure reading for
76 * idle & callbacks coming after bh's scheduling.
77 */
78 smp_rmb();
4f999d05
KW
79 if (!bh->idle)
80 ret = 1;
81 bh->idle = 0;
82 bh->cb(bh->opaque);
83 }
84 }
85
f627aab1 86 ctx->walking_bh--;
648fb0ea 87
4f999d05 88 /* remove deleted bhs */
f627aab1 89 if (!ctx->walking_bh) {
dcc772e2 90 qemu_mutex_lock(&ctx->bh_lock);
f627aab1 91 bhp = &ctx->first_bh;
648fb0ea
KW
92 while (*bhp) {
93 bh = *bhp;
94 if (bh->deleted) {
95 *bhp = bh->next;
96 g_free(bh);
97 } else {
98 bhp = &bh->next;
99 }
100 }
dcc772e2 101 qemu_mutex_unlock(&ctx->bh_lock);
4f999d05
KW
102 }
103
104 return ret;
105}
106
107void qemu_bh_schedule_idle(QEMUBH *bh)
108{
109 if (bh->scheduled)
110 return;
4f999d05 111 bh->idle = 1;
dcc772e2
LPF
112 /* Make sure that idle & any writes needed by the callback are done
113 * before the locations are read in the aio_bh_poll.
114 */
115 smp_wmb();
116 bh->scheduled = 1;
4f999d05
KW
117}
118
119void qemu_bh_schedule(QEMUBH *bh)
120{
924fe129
SH
121 AioContext *ctx;
122
4f999d05
KW
123 if (bh->scheduled)
124 return;
924fe129 125 ctx = bh->ctx;
4f999d05 126 bh->idle = 0;
924fe129
SH
127 /* Make sure that:
128 * 1. idle & any writes needed by the callback are done before the
129 * locations are read in the aio_bh_poll.
130 * 2. ctx is loaded before scheduled is set and the callback has a chance
131 * to execute.
dcc772e2 132 */
924fe129 133 smp_mb();
dcc772e2 134 bh->scheduled = 1;
924fe129 135 aio_notify(ctx);
4f999d05
KW
136}
137
dcc772e2
LPF
138
139/* This func is async.
140 */
4f999d05
KW
141void qemu_bh_cancel(QEMUBH *bh)
142{
143 bh->scheduled = 0;
144}
145
dcc772e2
LPF
146/* This func is async.The bottom half will do the delete action at the finial
147 * end.
148 */
4f999d05
KW
149void qemu_bh_delete(QEMUBH *bh)
150{
151 bh->scheduled = 0;
152 bh->deleted = 1;
153}
154
845ca10d
PB
155int64_t
156aio_compute_timeout(AioContext *ctx)
4f999d05 157{
845ca10d
PB
158 int64_t deadline;
159 int timeout = -1;
4f999d05
KW
160 QEMUBH *bh;
161
f627aab1 162 for (bh = ctx->first_bh; bh; bh = bh->next) {
4f999d05
KW
163 if (!bh->deleted && bh->scheduled) {
164 if (bh->idle) {
165 /* idle bottom halves will be polled at least
166 * every 10ms */
845ca10d 167 timeout = 10000000;
4f999d05
KW
168 } else {
169 /* non-idle bottom halves will be executed
170 * immediately */
845ca10d 171 return 0;
4f999d05
KW
172 }
173 }
174 }
e3713e00 175
845ca10d 176 deadline = timerlistgroup_deadline_ns(&ctx->tlg);
533a8cf3 177 if (deadline == 0) {
845ca10d 178 return 0;
533a8cf3 179 } else {
845ca10d 180 return qemu_soonest_timeout(timeout, deadline);
533a8cf3 181 }
845ca10d 182}
533a8cf3 183
845ca10d
PB
184static gboolean
185aio_ctx_prepare(GSource *source, gint *timeout)
186{
187 AioContext *ctx = (AioContext *) source;
188
189 /* We assume there is no timeout already supplied */
190 *timeout = qemu_timeout_ns_to_ms(aio_compute_timeout(ctx));
a3462c65
PB
191
192 if (aio_prepare(ctx)) {
193 *timeout = 0;
194 }
195
845ca10d 196 return *timeout == 0;
e3713e00
PB
197}
198
199static gboolean
200aio_ctx_check(GSource *source)
201{
202 AioContext *ctx = (AioContext *) source;
203 QEMUBH *bh;
204
205 for (bh = ctx->first_bh; bh; bh = bh->next) {
206 if (!bh->deleted && bh->scheduled) {
207 return true;
208 }
209 }
533a8cf3 210 return aio_pending(ctx) || (timerlistgroup_deadline_ns(&ctx->tlg) == 0);
e3713e00
PB
211}
212
213static gboolean
214aio_ctx_dispatch(GSource *source,
215 GSourceFunc callback,
216 gpointer user_data)
217{
218 AioContext *ctx = (AioContext *) source;
219
220 assert(callback == NULL);
e4c7e2d1 221 aio_dispatch(ctx);
e3713e00
PB
222 return true;
223}
224
2f4dc3c1
PB
225static void
226aio_ctx_finalize(GSource *source)
227{
228 AioContext *ctx = (AioContext *) source;
229
9b34277d 230 thread_pool_free(ctx->thread_pool);
f2e5dca4 231 aio_set_event_notifier(ctx, &ctx->notifier, NULL);
2f4dc3c1 232 event_notifier_cleanup(&ctx->notifier);
98563fc3 233 rfifolock_destroy(&ctx->lock);
dcc772e2 234 qemu_mutex_destroy(&ctx->bh_lock);
6b5f8762 235 g_array_free(ctx->pollfds, TRUE);
dae21b98 236 timerlistgroup_deinit(&ctx->tlg);
2f4dc3c1
PB
237}
238
e3713e00
PB
239static GSourceFuncs aio_source_funcs = {
240 aio_ctx_prepare,
241 aio_ctx_check,
242 aio_ctx_dispatch,
2f4dc3c1 243 aio_ctx_finalize
e3713e00
PB
244};
245
246GSource *aio_get_g_source(AioContext *ctx)
247{
248 g_source_ref(&ctx->source);
249 return &ctx->source;
250}
a915f4bc 251
9b34277d
SH
252ThreadPool *aio_get_thread_pool(AioContext *ctx)
253{
254 if (!ctx->thread_pool) {
255 ctx->thread_pool = thread_pool_new(ctx);
256 }
257 return ctx->thread_pool;
258}
259
0ceb849b
PB
260void aio_set_dispatching(AioContext *ctx, bool dispatching)
261{
262 ctx->dispatching = dispatching;
263 if (!dispatching) {
264 /* Write ctx->dispatching before reading e.g. bh->scheduled.
265 * Optimization: this is only needed when we're entering the "unsafe"
266 * phase where other threads must call event_notifier_set.
267 */
268 smp_mb();
269 }
270}
271
2f4dc3c1
PB
272void aio_notify(AioContext *ctx)
273{
0ceb849b
PB
274 /* Write e.g. bh->scheduled before reading ctx->dispatching. */
275 smp_mb();
276 if (!ctx->dispatching) {
277 event_notifier_set(&ctx->notifier);
278 }
2f4dc3c1
PB
279}
280
d5541d86
AB
281static void aio_timerlist_notify(void *opaque)
282{
283 aio_notify(opaque);
284}
285
98563fc3
SH
286static void aio_rfifolock_cb(void *opaque)
287{
288 /* Kick owner thread in case they are blocked in aio_poll() */
289 aio_notify(opaque);
290}
291
f627aab1
PB
292AioContext *aio_context_new(void)
293{
2f4dc3c1
PB
294 AioContext *ctx;
295 ctx = (AioContext *) g_source_new(&aio_source_funcs, sizeof(AioContext));
6b5f8762 296 ctx->pollfds = g_array_new(FALSE, FALSE, sizeof(GPollFD));
9b34277d 297 ctx->thread_pool = NULL;
dcc772e2 298 qemu_mutex_init(&ctx->bh_lock);
98563fc3 299 rfifolock_init(&ctx->lock, aio_rfifolock_cb, ctx);
2f4dc3c1
PB
300 event_notifier_init(&ctx->notifier, false);
301 aio_set_event_notifier(ctx, &ctx->notifier,
302 (EventNotifierHandler *)
f2e5dca4 303 event_notifier_test_and_clear);
d5541d86 304 timerlistgroup_init(&ctx->tlg, aio_timerlist_notify, ctx);
2f4dc3c1
PB
305
306 return ctx;
e3713e00
PB
307}
308
309void aio_context_ref(AioContext *ctx)
310{
311 g_source_ref(&ctx->source);
312}
313
314void aio_context_unref(AioContext *ctx)
315{
316 g_source_unref(&ctx->source);
f627aab1 317}
98563fc3
SH
318
319void aio_context_acquire(AioContext *ctx)
320{
321 rfifolock_lock(&ctx->lock);
322}
323
324void aio_context_release(AioContext *ctx)
325{
326 rfifolock_unlock(&ctx->lock);
327}