]> git.ipfire.org Git - thirdparty/qemu.git/blame - main-loop.c
Make qemu_shutdown_requested signal-safe
[thirdparty/qemu.git] / main-loop.c
CommitLineData
d3b12f5d
PB
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 */
d3b12f5d 24
0ec024f6 25#include "qemu-common.h"
1de7afc9 26#include "qemu/timer.h"
520b6dd4 27#include "qemu/sockets.h" // struct in_addr needed for libslirp.h
01c22f2c 28#include "sysemu/qtest.h"
520b6dd4 29#include "slirp/libslirp.h"
1de7afc9 30#include "qemu/main-loop.h"
737e150e 31#include "block/aio.h"
d3b12f5d
PB
32
33#ifndef _WIN32
34
1de7afc9 35#include "qemu/compatfd.h"
0ec024f6 36
d3b12f5d
PB
37/* If we have signalfd, we mask out the signals we want to handle and then
38 * use signalfd to listen for them. We rely on whatever the current signal
39 * handler is to dispatch the signals when we receive them.
40 */
41static void sigfd_handler(void *opaque)
42{
43 int fd = (intptr_t)opaque;
44 struct qemu_signalfd_siginfo info;
45 struct sigaction action;
46 ssize_t len;
47
48 while (1) {
49 do {
50 len = read(fd, &info, sizeof(info));
51 } while (len == -1 && errno == EINTR);
52
53 if (len == -1 && errno == EAGAIN) {
54 break;
55 }
56
57 if (len != sizeof(info)) {
58 printf("read from sigfd returned %zd: %m\n", len);
59 return;
60 }
61
62 sigaction(info.ssi_signo, NULL, &action);
63 if ((action.sa_flags & SA_SIGINFO) && action.sa_sigaction) {
64 action.sa_sigaction(info.ssi_signo,
65 (siginfo_t *)&info, NULL);
66 } else if (action.sa_handler) {
67 action.sa_handler(info.ssi_signo);
68 }
69 }
70}
71
72static int qemu_signal_init(void)
73{
74 int sigfd;
75 sigset_t set;
76
77 /*
78 * SIG_IPI must be blocked in the main thread and must not be caught
79 * by sigwait() in the signal thread. Otherwise, the cpu thread will
80 * not catch it reliably.
81 */
82 sigemptyset(&set);
83 sigaddset(&set, SIG_IPI);
d3b12f5d
PB
84 sigaddset(&set, SIGIO);
85 sigaddset(&set, SIGALRM);
86 sigaddset(&set, SIGBUS);
15124e14
PM
87 sigaddset(&set, SIGINT);
88 sigaddset(&set, SIGHUP);
89 sigaddset(&set, SIGTERM);
d3b12f5d
PB
90 pthread_sigmask(SIG_BLOCK, &set, NULL);
91
4aa7534d 92 sigdelset(&set, SIG_IPI);
d3b12f5d
PB
93 sigfd = qemu_signalfd(&set);
94 if (sigfd == -1) {
95 fprintf(stderr, "failed to create signalfd\n");
96 return -errno;
97 }
98
99 fcntl_setfl(sigfd, O_NONBLOCK);
100
101 qemu_set_fd_handler2(sigfd, NULL, sigfd_handler, NULL,
102 (void *)(intptr_t)sigfd);
103
104 return 0;
105}
106
107#else /* _WIN32 */
108
4c8d0d27 109static int qemu_signal_init(void)
d3b12f5d 110{
d3b12f5d
PB
111 return 0;
112}
4c8d0d27
PB
113#endif
114
115static AioContext *qemu_aio_context;
d3b12f5d 116
5f3aa1ff
SH
117AioContext *qemu_get_aio_context(void)
118{
119 return qemu_aio_context;
120}
121
d3b12f5d
PB
122void qemu_notify_event(void)
123{
4c8d0d27 124 if (!qemu_aio_context) {
ee77dfb2
MR
125 return;
126 }
4c8d0d27 127 aio_notify(qemu_aio_context);
d3b12f5d
PB
128}
129
cbff4b34
SH
130static GArray *gpollfds;
131
2f78e491 132int qemu_init_main_loop(Error **errp)
d3b12f5d
PB
133{
134 int ret;
82cbbdc6 135 GSource *src;
2f78e491 136 Error *local_error = NULL;
d3b12f5d 137
172061a0 138 init_clocks();
172061a0 139
d3b12f5d
PB
140 ret = qemu_signal_init();
141 if (ret) {
142 return ret;
143 }
144
2f78e491
CN
145 qemu_aio_context = aio_context_new(&local_error);
146 if (!qemu_aio_context) {
147 error_propagate(errp, local_error);
148 return -EMFILE;
149 }
cbff4b34 150 gpollfds = g_array_new(FALSE, FALSE, sizeof(GPollFD));
82cbbdc6
PB
151 src = aio_get_g_source(qemu_aio_context);
152 g_source_attach(src, NULL);
153 g_source_unref(src);
d3b12f5d
PB
154 return 0;
155}
156
d3b12f5d
PB
157static int max_priority;
158
ea26ce76 159#ifndef _WIN32
48ce11ff
SH
160static int glib_pollfds_idx;
161static int glib_n_poll_fds;
162
7b595f35 163static void glib_pollfds_fill(int64_t *cur_timeout)
d3b12f5d
PB
164{
165 GMainContext *context = g_main_context_default();
4dae83ae 166 int timeout = 0;
7b595f35 167 int64_t timeout_ns;
48ce11ff 168 int n;
d3b12f5d
PB
169
170 g_main_context_prepare(context, &max_priority);
171
48ce11ff
SH
172 glib_pollfds_idx = gpollfds->len;
173 n = glib_n_poll_fds;
174 do {
175 GPollFD *pfds;
176 glib_n_poll_fds = n;
177 g_array_set_size(gpollfds, glib_pollfds_idx + glib_n_poll_fds);
178 pfds = &g_array_index(gpollfds, GPollFD, glib_pollfds_idx);
179 n = g_main_context_query(context, max_priority, &timeout, pfds,
180 glib_n_poll_fds);
181 } while (n != glib_n_poll_fds);
d3b12f5d 182
7b595f35
AB
183 if (timeout < 0) {
184 timeout_ns = -1;
185 } else {
186 timeout_ns = (int64_t)timeout * (int64_t)SCALE_MS;
d3b12f5d 187 }
7b595f35
AB
188
189 *cur_timeout = qemu_soonest_timeout(timeout_ns, *cur_timeout);
d3b12f5d
PB
190}
191
48ce11ff 192static void glib_pollfds_poll(void)
d3b12f5d
PB
193{
194 GMainContext *context = g_main_context_default();
48ce11ff 195 GPollFD *pfds = &g_array_index(gpollfds, GPollFD, glib_pollfds_idx);
d3b12f5d 196
48ce11ff 197 if (g_main_context_check(context, max_priority, pfds, glib_n_poll_fds)) {
d3b12f5d
PB
198 g_main_context_dispatch(context);
199 }
200}
201
893986fe
AL
202#define MAX_MAIN_LOOP_SPIN (1000)
203
7b595f35 204static int os_host_main_loop_wait(int64_t timeout)
15455536 205{
15455536 206 int ret;
893986fe 207 static int spin_counter;
15455536 208
48ce11ff 209 glib_pollfds_fill(&timeout);
15455536 210
893986fe
AL
211 /* If the I/O thread is very busy or we are incorrectly busy waiting in
212 * the I/O thread, this can lead to starvation of the BQL such that the
213 * VCPU threads never run. To make sure we can detect the later case,
214 * print a message to the screen. If we run into this condition, create
215 * a fake timeout in order to give the VCPU threads a chance to run.
216 */
7b595f35 217 if (!timeout && (spin_counter > MAX_MAIN_LOOP_SPIN)) {
893986fe
AL
218 static bool notified;
219
01c22f2c 220 if (!notified && !qtest_enabled()) {
893986fe
AL
221 fprintf(stderr,
222 "main-loop: WARNING: I/O thread spun for %d iterations\n",
223 MAX_MAIN_LOOP_SPIN);
224 notified = true;
225 }
226
7b595f35 227 timeout = SCALE_MS;
893986fe
AL
228 }
229
7b595f35 230 if (timeout) {
893986fe 231 spin_counter = 0;
15455536 232 qemu_mutex_unlock_iothread();
893986fe
AL
233 } else {
234 spin_counter++;
15455536
PB
235 }
236
7b595f35 237 ret = qemu_poll_ns((GPollFD *)gpollfds->data, gpollfds->len, timeout);
cbff4b34 238
7b595f35 239 if (timeout) {
15455536
PB
240 qemu_mutex_lock_iothread();
241 }
242
48ce11ff 243 glib_pollfds_poll();
15455536
PB
244 return ret;
245}
246#else
d3b12f5d
PB
247/***********************************************************/
248/* Polling handling */
249
250typedef struct PollingEntry {
251 PollingFunc *func;
252 void *opaque;
253 struct PollingEntry *next;
254} PollingEntry;
255
256static PollingEntry *first_polling_entry;
257
258int qemu_add_polling_cb(PollingFunc *func, void *opaque)
259{
260 PollingEntry **ppe, *pe;
261 pe = g_malloc0(sizeof(PollingEntry));
262 pe->func = func;
263 pe->opaque = opaque;
264 for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next);
265 *ppe = pe;
266 return 0;
267}
268
269void qemu_del_polling_cb(PollingFunc *func, void *opaque)
270{
271 PollingEntry **ppe, *pe;
272 for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next) {
273 pe = *ppe;
274 if (pe->func == func && pe->opaque == opaque) {
275 *ppe = pe->next;
276 g_free(pe);
277 break;
278 }
279 }
280}
281
282/***********************************************************/
283/* Wait objects support */
284typedef struct WaitObjects {
285 int num;
06ac7d49 286 int revents[MAXIMUM_WAIT_OBJECTS + 1];
d3b12f5d
PB
287 HANDLE events[MAXIMUM_WAIT_OBJECTS + 1];
288 WaitObjectFunc *func[MAXIMUM_WAIT_OBJECTS + 1];
289 void *opaque[MAXIMUM_WAIT_OBJECTS + 1];
290} WaitObjects;
291
292static WaitObjects wait_objects = {0};
293
294int qemu_add_wait_object(HANDLE handle, WaitObjectFunc *func, void *opaque)
295{
296 WaitObjects *w = &wait_objects;
297 if (w->num >= MAXIMUM_WAIT_OBJECTS) {
298 return -1;
299 }
300 w->events[w->num] = handle;
301 w->func[w->num] = func;
302 w->opaque[w->num] = opaque;
06ac7d49 303 w->revents[w->num] = 0;
d3b12f5d
PB
304 w->num++;
305 return 0;
306}
307
308void qemu_del_wait_object(HANDLE handle, WaitObjectFunc *func, void *opaque)
309{
310 int i, found;
311 WaitObjects *w = &wait_objects;
312
313 found = 0;
314 for (i = 0; i < w->num; i++) {
315 if (w->events[i] == handle) {
316 found = 1;
317 }
318 if (found) {
319 w->events[i] = w->events[i + 1];
320 w->func[i] = w->func[i + 1];
321 w->opaque[i] = w->opaque[i + 1];
06ac7d49 322 w->revents[i] = w->revents[i + 1];
d3b12f5d
PB
323 }
324 }
325 if (found) {
326 w->num--;
327 }
328}
329
d3385eb4
PB
330void qemu_fd_register(int fd)
331{
4c8d0d27
PB
332 WSAEventSelect(fd, event_notifier_get_handle(&qemu_aio_context->notifier),
333 FD_READ | FD_ACCEPT | FD_CLOSE |
d3385eb4
PB
334 FD_CONNECT | FD_WRITE | FD_OOB);
335}
336
cbff4b34
SH
337static int pollfds_fill(GArray *pollfds, fd_set *rfds, fd_set *wfds,
338 fd_set *xfds)
339{
340 int nfds = -1;
341 int i;
342
343 for (i = 0; i < pollfds->len; i++) {
344 GPollFD *pfd = &g_array_index(pollfds, GPollFD, i);
345 int fd = pfd->fd;
346 int events = pfd->events;
8db165b3 347 if (events & G_IO_IN) {
cbff4b34
SH
348 FD_SET(fd, rfds);
349 nfds = MAX(nfds, fd);
350 }
8db165b3 351 if (events & G_IO_OUT) {
cbff4b34
SH
352 FD_SET(fd, wfds);
353 nfds = MAX(nfds, fd);
354 }
355 if (events & G_IO_PRI) {
356 FD_SET(fd, xfds);
357 nfds = MAX(nfds, fd);
358 }
359 }
360 return nfds;
361}
362
363static void pollfds_poll(GArray *pollfds, int nfds, fd_set *rfds,
364 fd_set *wfds, fd_set *xfds)
365{
366 int i;
367
368 for (i = 0; i < pollfds->len; i++) {
369 GPollFD *pfd = &g_array_index(pollfds, GPollFD, i);
370 int fd = pfd->fd;
371 int revents = 0;
372
373 if (FD_ISSET(fd, rfds)) {
8db165b3 374 revents |= G_IO_IN;
cbff4b34
SH
375 }
376 if (FD_ISSET(fd, wfds)) {
8db165b3 377 revents |= G_IO_OUT;
cbff4b34
SH
378 }
379 if (FD_ISSET(fd, xfds)) {
380 revents |= G_IO_PRI;
381 }
382 pfd->revents = revents & pfd->events;
383 }
384}
385
7b595f35 386static int os_host_main_loop_wait(int64_t timeout)
d3b12f5d 387{
ea26ce76 388 GMainContext *context = g_main_context_default();
48ce11ff 389 GPollFD poll_fds[1024 * 2]; /* this is probably overkill */
134a03e0 390 int select_ret = 0;
48ce11ff 391 int g_poll_ret, ret, i, n_poll_fds;
d3b12f5d 392 PollingEntry *pe;
d3385eb4 393 WaitObjects *w = &wait_objects;
42fe1c24 394 gint poll_timeout;
7b595f35 395 int64_t poll_timeout_ns;
15455536 396 static struct timeval tv0;
9cbaacf9
SH
397 fd_set rfds, wfds, xfds;
398 int nfds;
d3b12f5d
PB
399
400 /* XXX: need to suppress polling by better using win32 events */
401 ret = 0;
402 for (pe = first_polling_entry; pe != NULL; pe = pe->next) {
403 ret |= pe->func(pe->opaque);
404 }
d3385eb4
PB
405 if (ret != 0) {
406 return ret;
407 }
d3b12f5d 408
3cb8c205
SH
409 FD_ZERO(&rfds);
410 FD_ZERO(&wfds);
411 FD_ZERO(&xfds);
412 nfds = pollfds_fill(gpollfds, &rfds, &wfds, &xfds);
413 if (nfds >= 0) {
414 select_ret = select(nfds + 1, &rfds, &wfds, &xfds, &tv0);
415 if (select_ret != 0) {
416 timeout = 0;
417 }
418 if (select_ret > 0) {
419 pollfds_poll(gpollfds, nfds, &rfds, &wfds, &xfds);
420 }
421 }
422
ea26ce76 423 g_main_context_prepare(context, &max_priority);
42fe1c24 424 n_poll_fds = g_main_context_query(context, max_priority, &poll_timeout,
ea26ce76
PB
425 poll_fds, ARRAY_SIZE(poll_fds));
426 g_assert(n_poll_fds <= ARRAY_SIZE(poll_fds));
427
06ac7d49 428 for (i = 0; i < w->num; i++) {
58b9630d 429 poll_fds[n_poll_fds + i].fd = (DWORD_PTR)w->events[i];
ea26ce76 430 poll_fds[n_poll_fds + i].events = G_IO_IN;
06ac7d49
PB
431 }
432
7b595f35
AB
433 if (poll_timeout < 0) {
434 poll_timeout_ns = -1;
435 } else {
436 poll_timeout_ns = (int64_t)poll_timeout * (int64_t)SCALE_MS;
3239ad04
SW
437 }
438
7b595f35
AB
439 poll_timeout_ns = qemu_soonest_timeout(poll_timeout_ns, timeout);
440
d3385eb4 441 qemu_mutex_unlock_iothread();
7b595f35
AB
442 g_poll_ret = qemu_poll_ns(poll_fds, n_poll_fds + w->num, poll_timeout_ns);
443
d3385eb4 444 qemu_mutex_lock_iothread();
5e3bc735 445 if (g_poll_ret > 0) {
06ac7d49 446 for (i = 0; i < w->num; i++) {
ea26ce76 447 w->revents[i] = poll_fds[n_poll_fds + i].revents;
d3385eb4 448 }
06ac7d49
PB
449 for (i = 0; i < w->num; i++) {
450 if (w->revents[i] && w->func[i]) {
451 w->func[i](w->opaque[i]);
d3b12f5d 452 }
d3b12f5d
PB
453 }
454 }
455
ea26ce76
PB
456 if (g_main_context_check(context, max_priority, poll_fds, n_poll_fds)) {
457 g_main_context_dispatch(context);
458 }
459
5e3bc735 460 return select_ret || g_poll_ret;
d3b12f5d
PB
461}
462#endif
463
464int main_loop_wait(int nonblocking)
465{
7c7db755
SS
466 int ret;
467 uint32_t timeout = UINT32_MAX;
7b595f35 468 int64_t timeout_ns;
d3b12f5d
PB
469
470 if (nonblocking) {
471 timeout = 0;
d3b12f5d
PB
472 }
473
d3b12f5d 474 /* poll any events */
cbff4b34 475 g_array_set_size(gpollfds, 0); /* reset for new iteration */
d3b12f5d 476 /* XXX: separate device handlers from system ones */
d3b12f5d 477#ifdef CONFIG_SLIRP
a42e9c41 478 slirp_pollfds_fill(gpollfds, &timeout);
d3b12f5d 479#endif
a3e4b4a8 480 qemu_iohandler_fill(gpollfds);
7b595f35
AB
481
482 if (timeout == UINT32_MAX) {
483 timeout_ns = -1;
484 } else {
485 timeout_ns = (uint64_t)timeout * (int64_t)(SCALE_MS);
486 }
487
488 timeout_ns = qemu_soonest_timeout(timeout_ns,
489 timerlistgroup_deadline_ns(
490 &main_loop_tlg));
491
492 ret = os_host_main_loop_wait(timeout_ns);
a3e4b4a8 493 qemu_iohandler_poll(gpollfds, ret);
d3b12f5d 494#ifdef CONFIG_SLIRP
8917c3bd 495 slirp_pollfds_poll(gpollfds, (ret < 0));
d3b12f5d
PB
496#endif
497
40daca54 498 qemu_clock_run_all_timers();
d3b12f5d 499
d3b12f5d
PB
500 return ret;
501}
f627aab1
PB
502
503/* Functions to operate on the main QEMU AioContext. */
504
505QEMUBH *qemu_bh_new(QEMUBHFunc *cb, void *opaque)
506{
507 return aio_bh_new(qemu_aio_context, cb, opaque);
508}