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