]> git.proxmox.com Git - mirror_qemu.git/blame - util/main-loop.c
minikconf: do not include variables from MINIKCONF_ARGS in config-all-devices.mak
[mirror_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"
01c22f2c 29#include "sysemu/qtest.h"
d2528bdc 30#include "sysemu/cpus.h"
d759c951 31#include "sysemu/replay.h"
1de7afc9 32#include "qemu/main-loop.h"
737e150e 33#include "block/aio.h"
8297be80 34#include "qemu/error-report.h"
d3b12f5d
PB
35
36#ifndef _WIN32
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) {
d98d4072 65 sigaction_invoke(&action, &info);
d3b12f5d
PB
66 } else if (action.sa_handler) {
67 action.sa_handler(info.ssi_signo);
68 }
69 }
70}
71
78524330 72static int qemu_signal_init(Error **errp)
d3b12f5d
PB
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) {
78524330 97 error_setg_errno(errp, errno, "failed to create signalfd");
d3b12f5d
PB
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
78524330 110static int qemu_signal_init(Error **errp)
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
3f53bc61 147 init_clocks(qemu_timer_notify_cb);
172061a0 148
78524330 149 ret = qemu_signal_init(errp);
d3b12f5d
PB
150 if (ret) {
151 return ret;
152 }
153
2f78e491
CN
154 qemu_aio_context = aio_context_new(&local_error);
155 if (!qemu_aio_context) {
156 error_propagate(errp, local_error);
157 return -EMFILE;
158 }
28ba61e7 159 qemu_notify_bh = qemu_bh_new(notify_event_cb, NULL);
cbff4b34 160 gpollfds = g_array_new(FALSE, FALSE, sizeof(GPollFD));
82cbbdc6 161 src = aio_get_g_source(qemu_aio_context);
c3ff757d 162 g_source_set_name(src, "aio-context");
82cbbdc6
PB
163 g_source_attach(src, NULL);
164 g_source_unref(src);
f3926945 165 src = iohandler_get_g_source();
c3ff757d 166 g_source_set_name(src, "io-handler");
f3926945
FZ
167 g_source_attach(src, NULL);
168 g_source_unref(src);
d3b12f5d
PB
169 return 0;
170}
171
d3b12f5d
PB
172static int max_priority;
173
ea26ce76 174#ifndef _WIN32
48ce11ff
SH
175static int glib_pollfds_idx;
176static int glib_n_poll_fds;
177
7b595f35 178static void glib_pollfds_fill(int64_t *cur_timeout)
d3b12f5d
PB
179{
180 GMainContext *context = g_main_context_default();
4dae83ae 181 int timeout = 0;
7b595f35 182 int64_t timeout_ns;
48ce11ff 183 int n;
d3b12f5d
PB
184
185 g_main_context_prepare(context, &max_priority);
186
48ce11ff
SH
187 glib_pollfds_idx = gpollfds->len;
188 n = glib_n_poll_fds;
189 do {
190 GPollFD *pfds;
191 glib_n_poll_fds = n;
192 g_array_set_size(gpollfds, glib_pollfds_idx + glib_n_poll_fds);
193 pfds = &g_array_index(gpollfds, GPollFD, glib_pollfds_idx);
194 n = g_main_context_query(context, max_priority, &timeout, pfds,
195 glib_n_poll_fds);
196 } while (n != glib_n_poll_fds);
d3b12f5d 197
7b595f35
AB
198 if (timeout < 0) {
199 timeout_ns = -1;
200 } else {
201 timeout_ns = (int64_t)timeout * (int64_t)SCALE_MS;
d3b12f5d 202 }
7b595f35
AB
203
204 *cur_timeout = qemu_soonest_timeout(timeout_ns, *cur_timeout);
d3b12f5d
PB
205}
206
48ce11ff 207static void glib_pollfds_poll(void)
d3b12f5d
PB
208{
209 GMainContext *context = g_main_context_default();
48ce11ff 210 GPollFD *pfds = &g_array_index(gpollfds, GPollFD, glib_pollfds_idx);
d3b12f5d 211
48ce11ff 212 if (g_main_context_check(context, max_priority, pfds, glib_n_poll_fds)) {
d3b12f5d
PB
213 g_main_context_dispatch(context);
214 }
215}
216
893986fe
AL
217#define MAX_MAIN_LOOP_SPIN (1000)
218
7b595f35 219static int os_host_main_loop_wait(int64_t timeout)
15455536 220{
ecbddbb1 221 GMainContext *context = g_main_context_default();
15455536
PB
222 int ret;
223
ecbddbb1
RJ
224 g_main_context_acquire(context);
225
48ce11ff 226 glib_pollfds_fill(&timeout);
15455536 227
d759c951
AB
228 qemu_mutex_unlock_iothread();
229 replay_mutex_unlock();
15455536 230
7b595f35 231 ret = qemu_poll_ns((GPollFD *)gpollfds->data, gpollfds->len, timeout);
cbff4b34 232
d759c951
AB
233 replay_mutex_lock();
234 qemu_mutex_lock_iothread();
15455536 235
48ce11ff 236 glib_pollfds_poll();
ecbddbb1
RJ
237
238 g_main_context_release(context);
239
15455536
PB
240 return ret;
241}
242#else
d3b12f5d
PB
243/***********************************************************/
244/* Polling handling */
245
246typedef struct PollingEntry {
247 PollingFunc *func;
248 void *opaque;
249 struct PollingEntry *next;
250} PollingEntry;
251
252static PollingEntry *first_polling_entry;
253
254int qemu_add_polling_cb(PollingFunc *func, void *opaque)
255{
256 PollingEntry **ppe, *pe;
257 pe = g_malloc0(sizeof(PollingEntry));
258 pe->func = func;
259 pe->opaque = opaque;
260 for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next);
261 *ppe = pe;
262 return 0;
263}
264
265void qemu_del_polling_cb(PollingFunc *func, void *opaque)
266{
267 PollingEntry **ppe, *pe;
268 for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next) {
269 pe = *ppe;
270 if (pe->func == func && pe->opaque == opaque) {
271 *ppe = pe->next;
272 g_free(pe);
273 break;
274 }
275 }
276}
277
278/***********************************************************/
279/* Wait objects support */
280typedef struct WaitObjects {
281 int num;
06ac7d49 282 int revents[MAXIMUM_WAIT_OBJECTS + 1];
d3b12f5d
PB
283 HANDLE events[MAXIMUM_WAIT_OBJECTS + 1];
284 WaitObjectFunc *func[MAXIMUM_WAIT_OBJECTS + 1];
285 void *opaque[MAXIMUM_WAIT_OBJECTS + 1];
286} WaitObjects;
287
288static WaitObjects wait_objects = {0};
289
290int qemu_add_wait_object(HANDLE handle, WaitObjectFunc *func, void *opaque)
291{
292 WaitObjects *w = &wait_objects;
293 if (w->num >= MAXIMUM_WAIT_OBJECTS) {
294 return -1;
295 }
296 w->events[w->num] = handle;
297 w->func[w->num] = func;
298 w->opaque[w->num] = opaque;
06ac7d49 299 w->revents[w->num] = 0;
d3b12f5d
PB
300 w->num++;
301 return 0;
302}
303
304void qemu_del_wait_object(HANDLE handle, WaitObjectFunc *func, void *opaque)
305{
306 int i, found;
307 WaitObjects *w = &wait_objects;
308
309 found = 0;
310 for (i = 0; i < w->num; i++) {
311 if (w->events[i] == handle) {
312 found = 1;
313 }
314 if (found) {
315 w->events[i] = w->events[i + 1];
316 w->func[i] = w->func[i + 1];
317 w->opaque[i] = w->opaque[i + 1];
06ac7d49 318 w->revents[i] = w->revents[i + 1];
d3b12f5d
PB
319 }
320 }
321 if (found) {
322 w->num--;
323 }
324}
325
d3385eb4
PB
326void qemu_fd_register(int fd)
327{
4c8d0d27
PB
328 WSAEventSelect(fd, event_notifier_get_handle(&qemu_aio_context->notifier),
329 FD_READ | FD_ACCEPT | FD_CLOSE |
d3385eb4
PB
330 FD_CONNECT | FD_WRITE | FD_OOB);
331}
332
cbff4b34
SH
333static int pollfds_fill(GArray *pollfds, fd_set *rfds, fd_set *wfds,
334 fd_set *xfds)
335{
336 int nfds = -1;
337 int i;
338
339 for (i = 0; i < pollfds->len; i++) {
340 GPollFD *pfd = &g_array_index(pollfds, GPollFD, i);
341 int fd = pfd->fd;
342 int events = pfd->events;
8db165b3 343 if (events & G_IO_IN) {
cbff4b34
SH
344 FD_SET(fd, rfds);
345 nfds = MAX(nfds, fd);
346 }
8db165b3 347 if (events & G_IO_OUT) {
cbff4b34
SH
348 FD_SET(fd, wfds);
349 nfds = MAX(nfds, fd);
350 }
351 if (events & G_IO_PRI) {
352 FD_SET(fd, xfds);
353 nfds = MAX(nfds, fd);
354 }
355 }
356 return nfds;
357}
358
359static void pollfds_poll(GArray *pollfds, int nfds, fd_set *rfds,
360 fd_set *wfds, fd_set *xfds)
361{
362 int i;
363
364 for (i = 0; i < pollfds->len; i++) {
365 GPollFD *pfd = &g_array_index(pollfds, GPollFD, i);
366 int fd = pfd->fd;
367 int revents = 0;
368
369 if (FD_ISSET(fd, rfds)) {
8db165b3 370 revents |= G_IO_IN;
cbff4b34
SH
371 }
372 if (FD_ISSET(fd, wfds)) {
8db165b3 373 revents |= G_IO_OUT;
cbff4b34
SH
374 }
375 if (FD_ISSET(fd, xfds)) {
376 revents |= G_IO_PRI;
377 }
378 pfd->revents = revents & pfd->events;
379 }
380}
381
7b595f35 382static int os_host_main_loop_wait(int64_t timeout)
d3b12f5d 383{
ea26ce76 384 GMainContext *context = g_main_context_default();
48ce11ff 385 GPollFD poll_fds[1024 * 2]; /* this is probably overkill */
134a03e0 386 int select_ret = 0;
48ce11ff 387 int g_poll_ret, ret, i, n_poll_fds;
d3b12f5d 388 PollingEntry *pe;
d3385eb4 389 WaitObjects *w = &wait_objects;
42fe1c24 390 gint poll_timeout;
7b595f35 391 int64_t poll_timeout_ns;
15455536 392 static struct timeval tv0;
9cbaacf9
SH
393 fd_set rfds, wfds, xfds;
394 int nfds;
d3b12f5d 395
ecbddbb1
RJ
396 g_main_context_acquire(context);
397
d3b12f5d
PB
398 /* XXX: need to suppress polling by better using win32 events */
399 ret = 0;
400 for (pe = first_polling_entry; pe != NULL; pe = pe->next) {
401 ret |= pe->func(pe->opaque);
402 }
d3385eb4 403 if (ret != 0) {
ecbddbb1 404 g_main_context_release(context);
d3385eb4
PB
405 return ret;
406 }
d3b12f5d 407
3cb8c205
SH
408 FD_ZERO(&rfds);
409 FD_ZERO(&wfds);
410 FD_ZERO(&xfds);
411 nfds = pollfds_fill(gpollfds, &rfds, &wfds, &xfds);
412 if (nfds >= 0) {
413 select_ret = select(nfds + 1, &rfds, &wfds, &xfds, &tv0);
414 if (select_ret != 0) {
415 timeout = 0;
416 }
417 if (select_ret > 0) {
418 pollfds_poll(gpollfds, nfds, &rfds, &wfds, &xfds);
419 }
420 }
421
ea26ce76 422 g_main_context_prepare(context, &max_priority);
42fe1c24 423 n_poll_fds = g_main_context_query(context, max_priority, &poll_timeout,
ea26ce76 424 poll_fds, ARRAY_SIZE(poll_fds));
6512e34b 425 g_assert(n_poll_fds + w->num <= ARRAY_SIZE(poll_fds));
ea26ce76 426
06ac7d49 427 for (i = 0; i < w->num; i++) {
58b9630d 428 poll_fds[n_poll_fds + i].fd = (DWORD_PTR)w->events[i];
ea26ce76 429 poll_fds[n_poll_fds + i].events = G_IO_IN;
06ac7d49
PB
430 }
431
7b595f35
AB
432 if (poll_timeout < 0) {
433 poll_timeout_ns = -1;
434 } else {
435 poll_timeout_ns = (int64_t)poll_timeout * (int64_t)SCALE_MS;
3239ad04
SW
436 }
437
7b595f35
AB
438 poll_timeout_ns = qemu_soonest_timeout(poll_timeout_ns, timeout);
439
d3385eb4 440 qemu_mutex_unlock_iothread();
d759c951
AB
441
442 replay_mutex_unlock();
443
7b595f35
AB
444 g_poll_ret = qemu_poll_ns(poll_fds, n_poll_fds + w->num, poll_timeout_ns);
445
d759c951
AB
446 replay_mutex_lock();
447
d3385eb4 448 qemu_mutex_lock_iothread();
5e3bc735 449 if (g_poll_ret > 0) {
06ac7d49 450 for (i = 0; i < w->num; i++) {
ea26ce76 451 w->revents[i] = poll_fds[n_poll_fds + i].revents;
d3385eb4 452 }
06ac7d49
PB
453 for (i = 0; i < w->num; i++) {
454 if (w->revents[i] && w->func[i]) {
455 w->func[i](w->opaque[i]);
d3b12f5d 456 }
d3b12f5d
PB
457 }
458 }
459
ea26ce76
PB
460 if (g_main_context_check(context, max_priority, poll_fds, n_poll_fds)) {
461 g_main_context_dispatch(context);
462 }
463
ecbddbb1
RJ
464 g_main_context_release(context);
465
5e3bc735 466 return select_ret || g_poll_ret;
d3b12f5d
PB
467}
468#endif
469
1ab67b98
MAL
470static NotifierList main_loop_poll_notifiers =
471 NOTIFIER_LIST_INITIALIZER(main_loop_poll_notifiers);
472
473void main_loop_poll_add_notifier(Notifier *notify)
474{
475 notifier_list_add(&main_loop_poll_notifiers, notify);
476}
477
478void main_loop_poll_remove_notifier(Notifier *notify)
479{
480 notifier_remove(notify);
481}
482
de5f852f 483void main_loop_wait(int nonblocking)
d3b12f5d 484{
1ab67b98
MAL
485 MainLoopPoll mlpoll = {
486 .state = MAIN_LOOP_POLL_FILL,
487 .timeout = UINT32_MAX,
488 .pollfds = gpollfds,
489 };
7c7db755 490 int ret;
7b595f35 491 int64_t timeout_ns;
d3b12f5d
PB
492
493 if (nonblocking) {
1ab67b98 494 mlpoll.timeout = 0;
d3b12f5d
PB
495 }
496
d3b12f5d 497 /* poll any events */
cbff4b34 498 g_array_set_size(gpollfds, 0); /* reset for new iteration */
d3b12f5d 499 /* XXX: separate device handlers from system ones */
1ab67b98 500 notifier_list_notify(&main_loop_poll_notifiers, &mlpoll);
7b595f35 501
1ab67b98 502 if (mlpoll.timeout == UINT32_MAX) {
7b595f35
AB
503 timeout_ns = -1;
504 } else {
1ab67b98 505 timeout_ns = (uint64_t)mlpoll.timeout * (int64_t)(SCALE_MS);
7b595f35
AB
506 }
507
508 timeout_ns = qemu_soonest_timeout(timeout_ns,
509 timerlistgroup_deadline_ns(
510 &main_loop_tlg));
511
512 ret = os_host_main_loop_wait(timeout_ns);
1ab67b98
MAL
513 mlpoll.state = ret < 0 ? MAIN_LOOP_POLL_ERR : MAIN_LOOP_POLL_OK;
514 notifier_list_notify(&main_loop_poll_notifiers, &mlpoll);
d3b12f5d 515
efab87cf
PD
516 /* CPU thread can infinitely wait for event after
517 missing the warp */
e76d1798 518 qemu_start_warp_timer();
40daca54 519 qemu_clock_run_all_timers();
d3b12f5d 520}
f627aab1
PB
521
522/* Functions to operate on the main QEMU AioContext. */
523
524QEMUBH *qemu_bh_new(QEMUBHFunc *cb, void *opaque)
525{
526 return aio_bh_new(qemu_aio_context, cb, opaque);
527}