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