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