]> git.proxmox.com Git - mirror_qemu.git/blame - main-loop.c
sPAPR: Introduce rtas_ldq()
[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);
f3926945
FZ
164 src = iohandler_get_g_source();
165 g_source_attach(src, NULL);
166 g_source_unref(src);
d3b12f5d
PB
167 return 0;
168}
169
d3b12f5d
PB
170static int max_priority;
171
ea26ce76 172#ifndef _WIN32
48ce11ff
SH
173static int glib_pollfds_idx;
174static int glib_n_poll_fds;
175
7b595f35 176static void glib_pollfds_fill(int64_t *cur_timeout)
d3b12f5d
PB
177{
178 GMainContext *context = g_main_context_default();
4dae83ae 179 int timeout = 0;
7b595f35 180 int64_t timeout_ns;
48ce11ff 181 int n;
d3b12f5d
PB
182
183 g_main_context_prepare(context, &max_priority);
184
48ce11ff
SH
185 glib_pollfds_idx = gpollfds->len;
186 n = glib_n_poll_fds;
187 do {
188 GPollFD *pfds;
189 glib_n_poll_fds = n;
190 g_array_set_size(gpollfds, glib_pollfds_idx + glib_n_poll_fds);
191 pfds = &g_array_index(gpollfds, GPollFD, glib_pollfds_idx);
192 n = g_main_context_query(context, max_priority, &timeout, pfds,
193 glib_n_poll_fds);
194 } while (n != glib_n_poll_fds);
d3b12f5d 195
7b595f35
AB
196 if (timeout < 0) {
197 timeout_ns = -1;
198 } else {
199 timeout_ns = (int64_t)timeout * (int64_t)SCALE_MS;
d3b12f5d 200 }
7b595f35
AB
201
202 *cur_timeout = qemu_soonest_timeout(timeout_ns, *cur_timeout);
d3b12f5d
PB
203}
204
48ce11ff 205static void glib_pollfds_poll(void)
d3b12f5d
PB
206{
207 GMainContext *context = g_main_context_default();
48ce11ff 208 GPollFD *pfds = &g_array_index(gpollfds, GPollFD, glib_pollfds_idx);
d3b12f5d 209
48ce11ff 210 if (g_main_context_check(context, max_priority, pfds, glib_n_poll_fds)) {
d3b12f5d
PB
211 g_main_context_dispatch(context);
212 }
213}
214
893986fe
AL
215#define MAX_MAIN_LOOP_SPIN (1000)
216
7b595f35 217static int os_host_main_loop_wait(int64_t timeout)
15455536 218{
15455536 219 int ret;
893986fe 220 static int spin_counter;
15455536 221
48ce11ff 222 glib_pollfds_fill(&timeout);
15455536 223
893986fe
AL
224 /* If the I/O thread is very busy or we are incorrectly busy waiting in
225 * the I/O thread, this can lead to starvation of the BQL such that the
226 * VCPU threads never run. To make sure we can detect the later case,
227 * print a message to the screen. If we run into this condition, create
228 * a fake timeout in order to give the VCPU threads a chance to run.
229 */
7b595f35 230 if (!timeout && (spin_counter > MAX_MAIN_LOOP_SPIN)) {
893986fe
AL
231 static bool notified;
232
01c22f2c 233 if (!notified && !qtest_enabled()) {
893986fe
AL
234 fprintf(stderr,
235 "main-loop: WARNING: I/O thread spun for %d iterations\n",
236 MAX_MAIN_LOOP_SPIN);
237 notified = true;
238 }
239
7b595f35 240 timeout = SCALE_MS;
893986fe
AL
241 }
242
7b595f35 243 if (timeout) {
893986fe 244 spin_counter = 0;
15455536 245 qemu_mutex_unlock_iothread();
893986fe
AL
246 } else {
247 spin_counter++;
15455536
PB
248 }
249
7b595f35 250 ret = qemu_poll_ns((GPollFD *)gpollfds->data, gpollfds->len, timeout);
cbff4b34 251
7b595f35 252 if (timeout) {
15455536
PB
253 qemu_mutex_lock_iothread();
254 }
255
48ce11ff 256 glib_pollfds_poll();
15455536
PB
257 return ret;
258}
259#else
d3b12f5d
PB
260/***********************************************************/
261/* Polling handling */
262
263typedef struct PollingEntry {
264 PollingFunc *func;
265 void *opaque;
266 struct PollingEntry *next;
267} PollingEntry;
268
269static PollingEntry *first_polling_entry;
270
271int qemu_add_polling_cb(PollingFunc *func, void *opaque)
272{
273 PollingEntry **ppe, *pe;
274 pe = g_malloc0(sizeof(PollingEntry));
275 pe->func = func;
276 pe->opaque = opaque;
277 for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next);
278 *ppe = pe;
279 return 0;
280}
281
282void qemu_del_polling_cb(PollingFunc *func, void *opaque)
283{
284 PollingEntry **ppe, *pe;
285 for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next) {
286 pe = *ppe;
287 if (pe->func == func && pe->opaque == opaque) {
288 *ppe = pe->next;
289 g_free(pe);
290 break;
291 }
292 }
293}
294
295/***********************************************************/
296/* Wait objects support */
297typedef struct WaitObjects {
298 int num;
06ac7d49 299 int revents[MAXIMUM_WAIT_OBJECTS + 1];
d3b12f5d
PB
300 HANDLE events[MAXIMUM_WAIT_OBJECTS + 1];
301 WaitObjectFunc *func[MAXIMUM_WAIT_OBJECTS + 1];
302 void *opaque[MAXIMUM_WAIT_OBJECTS + 1];
303} WaitObjects;
304
305static WaitObjects wait_objects = {0};
306
307int qemu_add_wait_object(HANDLE handle, WaitObjectFunc *func, void *opaque)
308{
309 WaitObjects *w = &wait_objects;
310 if (w->num >= MAXIMUM_WAIT_OBJECTS) {
311 return -1;
312 }
313 w->events[w->num] = handle;
314 w->func[w->num] = func;
315 w->opaque[w->num] = opaque;
06ac7d49 316 w->revents[w->num] = 0;
d3b12f5d
PB
317 w->num++;
318 return 0;
319}
320
321void qemu_del_wait_object(HANDLE handle, WaitObjectFunc *func, void *opaque)
322{
323 int i, found;
324 WaitObjects *w = &wait_objects;
325
326 found = 0;
327 for (i = 0; i < w->num; i++) {
328 if (w->events[i] == handle) {
329 found = 1;
330 }
331 if (found) {
332 w->events[i] = w->events[i + 1];
333 w->func[i] = w->func[i + 1];
334 w->opaque[i] = w->opaque[i + 1];
06ac7d49 335 w->revents[i] = w->revents[i + 1];
d3b12f5d
PB
336 }
337 }
338 if (found) {
339 w->num--;
340 }
341}
342
d3385eb4
PB
343void qemu_fd_register(int fd)
344{
4c8d0d27
PB
345 WSAEventSelect(fd, event_notifier_get_handle(&qemu_aio_context->notifier),
346 FD_READ | FD_ACCEPT | FD_CLOSE |
d3385eb4
PB
347 FD_CONNECT | FD_WRITE | FD_OOB);
348}
349
cbff4b34
SH
350static int pollfds_fill(GArray *pollfds, fd_set *rfds, fd_set *wfds,
351 fd_set *xfds)
352{
353 int nfds = -1;
354 int i;
355
356 for (i = 0; i < pollfds->len; i++) {
357 GPollFD *pfd = &g_array_index(pollfds, GPollFD, i);
358 int fd = pfd->fd;
359 int events = pfd->events;
8db165b3 360 if (events & G_IO_IN) {
cbff4b34
SH
361 FD_SET(fd, rfds);
362 nfds = MAX(nfds, fd);
363 }
8db165b3 364 if (events & G_IO_OUT) {
cbff4b34
SH
365 FD_SET(fd, wfds);
366 nfds = MAX(nfds, fd);
367 }
368 if (events & G_IO_PRI) {
369 FD_SET(fd, xfds);
370 nfds = MAX(nfds, fd);
371 }
372 }
373 return nfds;
374}
375
376static void pollfds_poll(GArray *pollfds, int nfds, fd_set *rfds,
377 fd_set *wfds, fd_set *xfds)
378{
379 int i;
380
381 for (i = 0; i < pollfds->len; i++) {
382 GPollFD *pfd = &g_array_index(pollfds, GPollFD, i);
383 int fd = pfd->fd;
384 int revents = 0;
385
386 if (FD_ISSET(fd, rfds)) {
8db165b3 387 revents |= G_IO_IN;
cbff4b34
SH
388 }
389 if (FD_ISSET(fd, wfds)) {
8db165b3 390 revents |= G_IO_OUT;
cbff4b34
SH
391 }
392 if (FD_ISSET(fd, xfds)) {
393 revents |= G_IO_PRI;
394 }
395 pfd->revents = revents & pfd->events;
396 }
397}
398
7b595f35 399static int os_host_main_loop_wait(int64_t timeout)
d3b12f5d 400{
ea26ce76 401 GMainContext *context = g_main_context_default();
48ce11ff 402 GPollFD poll_fds[1024 * 2]; /* this is probably overkill */
134a03e0 403 int select_ret = 0;
48ce11ff 404 int g_poll_ret, ret, i, n_poll_fds;
d3b12f5d 405 PollingEntry *pe;
d3385eb4 406 WaitObjects *w = &wait_objects;
42fe1c24 407 gint poll_timeout;
7b595f35 408 int64_t poll_timeout_ns;
15455536 409 static struct timeval tv0;
9cbaacf9
SH
410 fd_set rfds, wfds, xfds;
411 int nfds;
d3b12f5d
PB
412
413 /* XXX: need to suppress polling by better using win32 events */
414 ret = 0;
415 for (pe = first_polling_entry; pe != NULL; pe = pe->next) {
416 ret |= pe->func(pe->opaque);
417 }
d3385eb4
PB
418 if (ret != 0) {
419 return ret;
420 }
d3b12f5d 421
3cb8c205
SH
422 FD_ZERO(&rfds);
423 FD_ZERO(&wfds);
424 FD_ZERO(&xfds);
425 nfds = pollfds_fill(gpollfds, &rfds, &wfds, &xfds);
426 if (nfds >= 0) {
427 select_ret = select(nfds + 1, &rfds, &wfds, &xfds, &tv0);
428 if (select_ret != 0) {
429 timeout = 0;
430 }
431 if (select_ret > 0) {
432 pollfds_poll(gpollfds, nfds, &rfds, &wfds, &xfds);
433 }
434 }
435
ea26ce76 436 g_main_context_prepare(context, &max_priority);
42fe1c24 437 n_poll_fds = g_main_context_query(context, max_priority, &poll_timeout,
ea26ce76
PB
438 poll_fds, ARRAY_SIZE(poll_fds));
439 g_assert(n_poll_fds <= ARRAY_SIZE(poll_fds));
440
06ac7d49 441 for (i = 0; i < w->num; i++) {
58b9630d 442 poll_fds[n_poll_fds + i].fd = (DWORD_PTR)w->events[i];
ea26ce76 443 poll_fds[n_poll_fds + i].events = G_IO_IN;
06ac7d49
PB
444 }
445
7b595f35
AB
446 if (poll_timeout < 0) {
447 poll_timeout_ns = -1;
448 } else {
449 poll_timeout_ns = (int64_t)poll_timeout * (int64_t)SCALE_MS;
3239ad04
SW
450 }
451
7b595f35
AB
452 poll_timeout_ns = qemu_soonest_timeout(poll_timeout_ns, timeout);
453
d3385eb4 454 qemu_mutex_unlock_iothread();
7b595f35
AB
455 g_poll_ret = qemu_poll_ns(poll_fds, n_poll_fds + w->num, poll_timeout_ns);
456
d3385eb4 457 qemu_mutex_lock_iothread();
5e3bc735 458 if (g_poll_ret > 0) {
06ac7d49 459 for (i = 0; i < w->num; i++) {
ea26ce76 460 w->revents[i] = poll_fds[n_poll_fds + i].revents;
d3385eb4 461 }
06ac7d49
PB
462 for (i = 0; i < w->num; i++) {
463 if (w->revents[i] && w->func[i]) {
464 w->func[i](w->opaque[i]);
d3b12f5d 465 }
d3b12f5d
PB
466 }
467 }
468
ea26ce76
PB
469 if (g_main_context_check(context, max_priority, poll_fds, n_poll_fds)) {
470 g_main_context_dispatch(context);
471 }
472
5e3bc735 473 return select_ret || g_poll_ret;
d3b12f5d
PB
474}
475#endif
476
477int main_loop_wait(int nonblocking)
478{
7c7db755
SS
479 int ret;
480 uint32_t timeout = UINT32_MAX;
7b595f35 481 int64_t timeout_ns;
d3b12f5d
PB
482
483 if (nonblocking) {
484 timeout = 0;
d3b12f5d
PB
485 }
486
d3b12f5d 487 /* poll any events */
cbff4b34 488 g_array_set_size(gpollfds, 0); /* reset for new iteration */
d3b12f5d 489 /* XXX: separate device handlers from system ones */
d3b12f5d 490#ifdef CONFIG_SLIRP
a42e9c41 491 slirp_pollfds_fill(gpollfds, &timeout);
d3b12f5d 492#endif
7b595f35
AB
493
494 if (timeout == UINT32_MAX) {
495 timeout_ns = -1;
496 } else {
497 timeout_ns = (uint64_t)timeout * (int64_t)(SCALE_MS);
498 }
499
500 timeout_ns = qemu_soonest_timeout(timeout_ns,
501 timerlistgroup_deadline_ns(
502 &main_loop_tlg));
503
504 ret = os_host_main_loop_wait(timeout_ns);
d3b12f5d 505#ifdef CONFIG_SLIRP
8917c3bd 506 slirp_pollfds_poll(gpollfds, (ret < 0));
d3b12f5d
PB
507#endif
508
40daca54 509 qemu_clock_run_all_timers();
d3b12f5d 510
d3b12f5d
PB
511 return ret;
512}
f627aab1
PB
513
514/* Functions to operate on the main QEMU AioContext. */
515
516QEMUBH *qemu_bh_new(QEMUBHFunc *cb, void *opaque)
517{
518 return aio_bh_new(qemu_aio_context, cb, opaque);
519}