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