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