2011-09-13 10:30:52 +02:00
|
|
|
/*
|
|
|
|
* QEMU System Emulator
|
|
|
|
*
|
|
|
|
* Copyright (c) 2003-2008 Fabrice Bellard
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
* THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2016-01-29 18:50:05 +01:00
|
|
|
#include "qemu/osdep.h"
|
2011-10-25 22:23:17 +02:00
|
|
|
#include "qemu-common.h"
|
2012-12-17 18:20:00 +01:00
|
|
|
#include "qemu/timer.h"
|
2013-06-12 14:31:44 +02:00
|
|
|
#include "qemu/sockets.h" // struct in_addr needed for libslirp.h
|
2014-03-13 15:17:29 +01:00
|
|
|
#include "sysemu/qtest.h"
|
2013-06-12 14:31:44 +02:00
|
|
|
#include "slirp/libslirp.h"
|
2012-12-17 18:20:00 +01:00
|
|
|
#include "qemu/main-loop.h"
|
2012-12-17 18:19:44 +01:00
|
|
|
#include "block/aio.h"
|
2011-09-13 10:30:52 +02:00
|
|
|
|
|
|
|
#ifndef _WIN32
|
|
|
|
|
2012-12-17 18:20:00 +01:00
|
|
|
#include "qemu/compatfd.h"
|
2011-10-25 22:23:17 +02:00
|
|
|
|
2011-09-13 10:30:52 +02:00
|
|
|
/* If we have signalfd, we mask out the signals we want to handle and then
|
|
|
|
* use signalfd to listen for them. We rely on whatever the current signal
|
|
|
|
* handler is to dispatch the signals when we receive them.
|
|
|
|
*/
|
|
|
|
static void sigfd_handler(void *opaque)
|
|
|
|
{
|
|
|
|
int fd = (intptr_t)opaque;
|
|
|
|
struct qemu_signalfd_siginfo info;
|
|
|
|
struct sigaction action;
|
|
|
|
ssize_t len;
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
do {
|
|
|
|
len = read(fd, &info, sizeof(info));
|
|
|
|
} while (len == -1 && errno == EINTR);
|
|
|
|
|
|
|
|
if (len == -1 && errno == EAGAIN) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (len != sizeof(info)) {
|
|
|
|
printf("read from sigfd returned %zd: %m\n", len);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
sigaction(info.ssi_signo, NULL, &action);
|
|
|
|
if ((action.sa_flags & SA_SIGINFO) && action.sa_sigaction) {
|
|
|
|
action.sa_sigaction(info.ssi_signo,
|
|
|
|
(siginfo_t *)&info, NULL);
|
|
|
|
} else if (action.sa_handler) {
|
|
|
|
action.sa_handler(info.ssi_signo);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int qemu_signal_init(void)
|
|
|
|
{
|
|
|
|
int sigfd;
|
|
|
|
sigset_t set;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* SIG_IPI must be blocked in the main thread and must not be caught
|
|
|
|
* by sigwait() in the signal thread. Otherwise, the cpu thread will
|
|
|
|
* not catch it reliably.
|
|
|
|
*/
|
|
|
|
sigemptyset(&set);
|
|
|
|
sigaddset(&set, SIG_IPI);
|
|
|
|
sigaddset(&set, SIGIO);
|
|
|
|
sigaddset(&set, SIGALRM);
|
|
|
|
sigaddset(&set, SIGBUS);
|
2014-10-27 15:13:02 +01:00
|
|
|
/* SIGINT cannot be handled via signalfd, so that ^C can be used
|
|
|
|
* to interrupt QEMU when it is being run under gdb. SIGHUP and
|
|
|
|
* SIGTERM are also handled asynchronously, even though it is not
|
|
|
|
* strictly necessary, because they use the same handler as SIGINT.
|
|
|
|
*/
|
2011-09-13 10:30:52 +02:00
|
|
|
pthread_sigmask(SIG_BLOCK, &set, NULL);
|
|
|
|
|
2012-01-12 10:05:35 +01:00
|
|
|
sigdelset(&set, SIG_IPI);
|
2011-09-13 10:30:52 +02:00
|
|
|
sigfd = qemu_signalfd(&set);
|
|
|
|
if (sigfd == -1) {
|
|
|
|
fprintf(stderr, "failed to create signalfd\n");
|
|
|
|
return -errno;
|
|
|
|
}
|
|
|
|
|
|
|
|
fcntl_setfl(sigfd, O_NONBLOCK);
|
|
|
|
|
Change qemu_set_fd_handler2(..., NULL, ...) to qemu_set_fd_handler
Done with following Coccinelle semantic patch, plus manual cosmetic changes in
net/*.c.
@@
expression E1, E2, E3, E4;
@@
- qemu_set_fd_handler2(E1, NULL, E2, E3, E4);
+ qemu_set_fd_handler(E1, E2, E3, E4);
Signed-off-by: Fam Zheng <famz@redhat.com>
Message-id: 1433400324-7358-8-git-send-email-famz@redhat.com
Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com>
2015-06-04 08:45:18 +02:00
|
|
|
qemu_set_fd_handler(sigfd, sigfd_handler, NULL, (void *)(intptr_t)sigfd);
|
2011-09-13 10:30:52 +02:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#else /* _WIN32 */
|
|
|
|
|
2010-05-24 17:27:14 +02:00
|
|
|
static int qemu_signal_init(void)
|
2011-09-13 10:30:52 +02:00
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
2010-05-24 17:27:14 +02:00
|
|
|
#endif
|
|
|
|
|
|
|
|
static AioContext *qemu_aio_context;
|
2015-07-24 13:42:55 +02:00
|
|
|
static QEMUBH *qemu_notify_bh;
|
|
|
|
|
|
|
|
static void notify_event_cb(void *opaque)
|
|
|
|
{
|
|
|
|
/* No need to do anything; this bottom half is only used to
|
|
|
|
* kick the kernel out of ppoll/poll/WaitForMultipleObjects.
|
|
|
|
*/
|
|
|
|
}
|
2011-09-13 10:30:52 +02:00
|
|
|
|
2013-03-07 13:41:44 +01:00
|
|
|
AioContext *qemu_get_aio_context(void)
|
|
|
|
{
|
|
|
|
return qemu_aio_context;
|
|
|
|
}
|
|
|
|
|
2011-09-13 10:30:52 +02:00
|
|
|
void qemu_notify_event(void)
|
|
|
|
{
|
2010-05-24 17:27:14 +02:00
|
|
|
if (!qemu_aio_context) {
|
2012-01-21 02:08:27 +01:00
|
|
|
return;
|
|
|
|
}
|
2015-07-24 13:42:55 +02:00
|
|
|
qemu_bh_schedule(qemu_notify_bh);
|
2011-09-13 10:30:52 +02:00
|
|
|
}
|
|
|
|
|
2013-02-20 11:28:25 +01:00
|
|
|
static GArray *gpollfds;
|
|
|
|
|
2014-09-18 13:30:49 +02:00
|
|
|
int qemu_init_main_loop(Error **errp)
|
2011-09-13 10:30:52 +02:00
|
|
|
{
|
|
|
|
int ret;
|
2012-09-24 15:07:08 +02:00
|
|
|
GSource *src;
|
2014-09-18 13:30:49 +02:00
|
|
|
Error *local_error = NULL;
|
2011-09-13 10:30:52 +02:00
|
|
|
|
2012-10-29 15:28:36 +01:00
|
|
|
init_clocks();
|
|
|
|
|
2011-09-13 10:30:52 +02:00
|
|
|
ret = qemu_signal_init();
|
|
|
|
if (ret) {
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2014-09-18 13:30:49 +02:00
|
|
|
qemu_aio_context = aio_context_new(&local_error);
|
2015-07-24 13:42:55 +02:00
|
|
|
qemu_notify_bh = qemu_bh_new(notify_event_cb, NULL);
|
2014-09-18 13:30:49 +02:00
|
|
|
if (!qemu_aio_context) {
|
|
|
|
error_propagate(errp, local_error);
|
|
|
|
return -EMFILE;
|
|
|
|
}
|
2013-02-20 11:28:25 +01:00
|
|
|
gpollfds = g_array_new(FALSE, FALSE, sizeof(GPollFD));
|
2012-09-24 15:07:08 +02:00
|
|
|
src = aio_get_g_source(qemu_aio_context);
|
|
|
|
g_source_attach(src, NULL);
|
|
|
|
g_source_unref(src);
|
2015-09-07 05:28:58 +02:00
|
|
|
src = iohandler_get_g_source();
|
|
|
|
g_source_attach(src, NULL);
|
|
|
|
g_source_unref(src);
|
2011-09-13 10:30:52 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int max_priority;
|
|
|
|
|
2012-03-20 10:49:21 +01:00
|
|
|
#ifndef _WIN32
|
2013-02-20 11:28:26 +01:00
|
|
|
static int glib_pollfds_idx;
|
|
|
|
static int glib_n_poll_fds;
|
|
|
|
|
2013-08-21 17:02:54 +02:00
|
|
|
static void glib_pollfds_fill(int64_t *cur_timeout)
|
2011-09-13 10:30:52 +02:00
|
|
|
{
|
|
|
|
GMainContext *context = g_main_context_default();
|
2012-03-20 10:49:17 +01:00
|
|
|
int timeout = 0;
|
2013-08-21 17:02:54 +02:00
|
|
|
int64_t timeout_ns;
|
2013-02-20 11:28:26 +01:00
|
|
|
int n;
|
2011-09-13 10:30:52 +02:00
|
|
|
|
|
|
|
g_main_context_prepare(context, &max_priority);
|
|
|
|
|
2013-02-20 11:28:26 +01:00
|
|
|
glib_pollfds_idx = gpollfds->len;
|
|
|
|
n = glib_n_poll_fds;
|
|
|
|
do {
|
|
|
|
GPollFD *pfds;
|
|
|
|
glib_n_poll_fds = n;
|
|
|
|
g_array_set_size(gpollfds, glib_pollfds_idx + glib_n_poll_fds);
|
|
|
|
pfds = &g_array_index(gpollfds, GPollFD, glib_pollfds_idx);
|
|
|
|
n = g_main_context_query(context, max_priority, &timeout, pfds,
|
|
|
|
glib_n_poll_fds);
|
|
|
|
} while (n != glib_n_poll_fds);
|
2011-09-13 10:30:52 +02:00
|
|
|
|
2013-08-21 17:02:54 +02:00
|
|
|
if (timeout < 0) {
|
|
|
|
timeout_ns = -1;
|
|
|
|
} else {
|
|
|
|
timeout_ns = (int64_t)timeout * (int64_t)SCALE_MS;
|
2011-09-13 10:30:52 +02:00
|
|
|
}
|
2013-08-21 17:02:54 +02:00
|
|
|
|
|
|
|
*cur_timeout = qemu_soonest_timeout(timeout_ns, *cur_timeout);
|
2011-09-13 10:30:52 +02:00
|
|
|
}
|
|
|
|
|
2013-02-20 11:28:26 +01:00
|
|
|
static void glib_pollfds_poll(void)
|
2011-09-13 10:30:52 +02:00
|
|
|
{
|
|
|
|
GMainContext *context = g_main_context_default();
|
2013-02-20 11:28:26 +01:00
|
|
|
GPollFD *pfds = &g_array_index(gpollfds, GPollFD, glib_pollfds_idx);
|
2011-09-13 10:30:52 +02:00
|
|
|
|
2013-02-20 11:28:26 +01:00
|
|
|
if (g_main_context_check(context, max_priority, pfds, glib_n_poll_fds)) {
|
2011-09-13 10:30:52 +02:00
|
|
|
g_main_context_dispatch(context);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-04-05 15:46:00 +02:00
|
|
|
#define MAX_MAIN_LOOP_SPIN (1000)
|
|
|
|
|
2013-08-21 17:02:54 +02:00
|
|
|
static int os_host_main_loop_wait(int64_t timeout)
|
2012-03-20 10:49:18 +01:00
|
|
|
{
|
|
|
|
int ret;
|
2013-04-05 15:46:00 +02:00
|
|
|
static int spin_counter;
|
2012-03-20 10:49:18 +01:00
|
|
|
|
2013-02-20 11:28:26 +01:00
|
|
|
glib_pollfds_fill(&timeout);
|
2012-03-20 10:49:18 +01:00
|
|
|
|
2013-04-05 15:46:00 +02:00
|
|
|
/* If the I/O thread is very busy or we are incorrectly busy waiting in
|
|
|
|
* the I/O thread, this can lead to starvation of the BQL such that the
|
|
|
|
* VCPU threads never run. To make sure we can detect the later case,
|
|
|
|
* print a message to the screen. If we run into this condition, create
|
|
|
|
* a fake timeout in order to give the VCPU threads a chance to run.
|
|
|
|
*/
|
2013-08-21 17:02:54 +02:00
|
|
|
if (!timeout && (spin_counter > MAX_MAIN_LOOP_SPIN)) {
|
2013-04-05 15:46:00 +02:00
|
|
|
static bool notified;
|
|
|
|
|
2015-11-30 12:30:04 +01:00
|
|
|
if (!notified && !qtest_driver()) {
|
2013-04-05 15:46:00 +02:00
|
|
|
fprintf(stderr,
|
|
|
|
"main-loop: WARNING: I/O thread spun for %d iterations\n",
|
|
|
|
MAX_MAIN_LOOP_SPIN);
|
|
|
|
notified = true;
|
|
|
|
}
|
|
|
|
|
2013-08-21 17:02:54 +02:00
|
|
|
timeout = SCALE_MS;
|
2013-04-05 15:46:00 +02:00
|
|
|
}
|
|
|
|
|
2013-08-21 17:02:54 +02:00
|
|
|
if (timeout) {
|
2013-04-05 15:46:00 +02:00
|
|
|
spin_counter = 0;
|
2012-03-20 10:49:18 +01:00
|
|
|
qemu_mutex_unlock_iothread();
|
2013-04-05 15:46:00 +02:00
|
|
|
} else {
|
|
|
|
spin_counter++;
|
2012-03-20 10:49:18 +01:00
|
|
|
}
|
|
|
|
|
2013-08-21 17:02:54 +02:00
|
|
|
ret = qemu_poll_ns((GPollFD *)gpollfds->data, gpollfds->len, timeout);
|
2013-02-20 11:28:25 +01:00
|
|
|
|
2013-08-21 17:02:54 +02:00
|
|
|
if (timeout) {
|
2012-03-20 10:49:18 +01:00
|
|
|
qemu_mutex_lock_iothread();
|
|
|
|
}
|
|
|
|
|
2013-02-20 11:28:26 +01:00
|
|
|
glib_pollfds_poll();
|
2012-03-20 10:49:18 +01:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#else
|
2011-09-13 10:30:52 +02:00
|
|
|
/***********************************************************/
|
|
|
|
/* Polling handling */
|
|
|
|
|
|
|
|
typedef struct PollingEntry {
|
|
|
|
PollingFunc *func;
|
|
|
|
void *opaque;
|
|
|
|
struct PollingEntry *next;
|
|
|
|
} PollingEntry;
|
|
|
|
|
|
|
|
static PollingEntry *first_polling_entry;
|
|
|
|
|
|
|
|
int qemu_add_polling_cb(PollingFunc *func, void *opaque)
|
|
|
|
{
|
|
|
|
PollingEntry **ppe, *pe;
|
|
|
|
pe = g_malloc0(sizeof(PollingEntry));
|
|
|
|
pe->func = func;
|
|
|
|
pe->opaque = opaque;
|
|
|
|
for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next);
|
|
|
|
*ppe = pe;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void qemu_del_polling_cb(PollingFunc *func, void *opaque)
|
|
|
|
{
|
|
|
|
PollingEntry **ppe, *pe;
|
|
|
|
for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next) {
|
|
|
|
pe = *ppe;
|
|
|
|
if (pe->func == func && pe->opaque == opaque) {
|
|
|
|
*ppe = pe->next;
|
|
|
|
g_free(pe);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/***********************************************************/
|
|
|
|
/* Wait objects support */
|
|
|
|
typedef struct WaitObjects {
|
|
|
|
int num;
|
2012-03-20 10:49:20 +01:00
|
|
|
int revents[MAXIMUM_WAIT_OBJECTS + 1];
|
2011-09-13 10:30:52 +02:00
|
|
|
HANDLE events[MAXIMUM_WAIT_OBJECTS + 1];
|
|
|
|
WaitObjectFunc *func[MAXIMUM_WAIT_OBJECTS + 1];
|
|
|
|
void *opaque[MAXIMUM_WAIT_OBJECTS + 1];
|
|
|
|
} WaitObjects;
|
|
|
|
|
|
|
|
static WaitObjects wait_objects = {0};
|
|
|
|
|
|
|
|
int qemu_add_wait_object(HANDLE handle, WaitObjectFunc *func, void *opaque)
|
|
|
|
{
|
|
|
|
WaitObjects *w = &wait_objects;
|
|
|
|
if (w->num >= MAXIMUM_WAIT_OBJECTS) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
w->events[w->num] = handle;
|
|
|
|
w->func[w->num] = func;
|
|
|
|
w->opaque[w->num] = opaque;
|
2012-03-20 10:49:20 +01:00
|
|
|
w->revents[w->num] = 0;
|
2011-09-13 10:30:52 +02:00
|
|
|
w->num++;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void qemu_del_wait_object(HANDLE handle, WaitObjectFunc *func, void *opaque)
|
|
|
|
{
|
|
|
|
int i, found;
|
|
|
|
WaitObjects *w = &wait_objects;
|
|
|
|
|
|
|
|
found = 0;
|
|
|
|
for (i = 0; i < w->num; i++) {
|
|
|
|
if (w->events[i] == handle) {
|
|
|
|
found = 1;
|
|
|
|
}
|
|
|
|
if (found) {
|
|
|
|
w->events[i] = w->events[i + 1];
|
|
|
|
w->func[i] = w->func[i + 1];
|
|
|
|
w->opaque[i] = w->opaque[i + 1];
|
2012-03-20 10:49:20 +01:00
|
|
|
w->revents[i] = w->revents[i + 1];
|
2011-09-13 10:30:52 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (found) {
|
|
|
|
w->num--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-03-20 10:49:19 +01:00
|
|
|
void qemu_fd_register(int fd)
|
|
|
|
{
|
2010-05-24 17:27:14 +02:00
|
|
|
WSAEventSelect(fd, event_notifier_get_handle(&qemu_aio_context->notifier),
|
|
|
|
FD_READ | FD_ACCEPT | FD_CLOSE |
|
2012-03-20 10:49:19 +01:00
|
|
|
FD_CONNECT | FD_WRITE | FD_OOB);
|
|
|
|
}
|
|
|
|
|
2013-02-20 11:28:25 +01:00
|
|
|
static int pollfds_fill(GArray *pollfds, fd_set *rfds, fd_set *wfds,
|
|
|
|
fd_set *xfds)
|
|
|
|
{
|
|
|
|
int nfds = -1;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < pollfds->len; i++) {
|
|
|
|
GPollFD *pfd = &g_array_index(pollfds, GPollFD, i);
|
|
|
|
int fd = pfd->fd;
|
|
|
|
int events = pfd->events;
|
2013-05-16 17:36:00 +02:00
|
|
|
if (events & G_IO_IN) {
|
2013-02-20 11:28:25 +01:00
|
|
|
FD_SET(fd, rfds);
|
|
|
|
nfds = MAX(nfds, fd);
|
|
|
|
}
|
2013-05-16 17:36:00 +02:00
|
|
|
if (events & G_IO_OUT) {
|
2013-02-20 11:28:25 +01:00
|
|
|
FD_SET(fd, wfds);
|
|
|
|
nfds = MAX(nfds, fd);
|
|
|
|
}
|
|
|
|
if (events & G_IO_PRI) {
|
|
|
|
FD_SET(fd, xfds);
|
|
|
|
nfds = MAX(nfds, fd);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return nfds;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void pollfds_poll(GArray *pollfds, int nfds, fd_set *rfds,
|
|
|
|
fd_set *wfds, fd_set *xfds)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < pollfds->len; i++) {
|
|
|
|
GPollFD *pfd = &g_array_index(pollfds, GPollFD, i);
|
|
|
|
int fd = pfd->fd;
|
|
|
|
int revents = 0;
|
|
|
|
|
|
|
|
if (FD_ISSET(fd, rfds)) {
|
2013-05-16 17:36:00 +02:00
|
|
|
revents |= G_IO_IN;
|
2013-02-20 11:28:25 +01:00
|
|
|
}
|
|
|
|
if (FD_ISSET(fd, wfds)) {
|
2013-05-16 17:36:00 +02:00
|
|
|
revents |= G_IO_OUT;
|
2013-02-20 11:28:25 +01:00
|
|
|
}
|
|
|
|
if (FD_ISSET(fd, xfds)) {
|
|
|
|
revents |= G_IO_PRI;
|
|
|
|
}
|
|
|
|
pfd->revents = revents & pfd->events;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-08-21 17:02:54 +02:00
|
|
|
static int os_host_main_loop_wait(int64_t timeout)
|
2011-09-13 10:30:52 +02:00
|
|
|
{
|
2012-03-20 10:49:21 +01:00
|
|
|
GMainContext *context = g_main_context_default();
|
2013-02-20 11:28:26 +01:00
|
|
|
GPollFD poll_fds[1024 * 2]; /* this is probably overkill */
|
2013-02-20 11:28:24 +01:00
|
|
|
int select_ret = 0;
|
2013-02-20 11:28:26 +01:00
|
|
|
int g_poll_ret, ret, i, n_poll_fds;
|
2011-09-13 10:30:52 +02:00
|
|
|
PollingEntry *pe;
|
2012-03-20 10:49:19 +01:00
|
|
|
WaitObjects *w = &wait_objects;
|
2012-04-27 17:02:08 +02:00
|
|
|
gint poll_timeout;
|
2013-08-21 17:02:54 +02:00
|
|
|
int64_t poll_timeout_ns;
|
2012-03-20 10:49:18 +01:00
|
|
|
static struct timeval tv0;
|
2013-02-20 11:28:30 +01:00
|
|
|
fd_set rfds, wfds, xfds;
|
|
|
|
int nfds;
|
2011-09-13 10:30:52 +02:00
|
|
|
|
|
|
|
/* XXX: need to suppress polling by better using win32 events */
|
|
|
|
ret = 0;
|
|
|
|
for (pe = first_polling_entry; pe != NULL; pe = pe->next) {
|
|
|
|
ret |= pe->func(pe->opaque);
|
|
|
|
}
|
2012-03-20 10:49:19 +01:00
|
|
|
if (ret != 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
2011-09-13 10:30:52 +02:00
|
|
|
|
2013-05-16 17:36:01 +02:00
|
|
|
FD_ZERO(&rfds);
|
|
|
|
FD_ZERO(&wfds);
|
|
|
|
FD_ZERO(&xfds);
|
|
|
|
nfds = pollfds_fill(gpollfds, &rfds, &wfds, &xfds);
|
|
|
|
if (nfds >= 0) {
|
|
|
|
select_ret = select(nfds + 1, &rfds, &wfds, &xfds, &tv0);
|
|
|
|
if (select_ret != 0) {
|
|
|
|
timeout = 0;
|
|
|
|
}
|
|
|
|
if (select_ret > 0) {
|
|
|
|
pollfds_poll(gpollfds, nfds, &rfds, &wfds, &xfds);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-03-20 10:49:21 +01:00
|
|
|
g_main_context_prepare(context, &max_priority);
|
2012-04-27 17:02:08 +02:00
|
|
|
n_poll_fds = g_main_context_query(context, max_priority, &poll_timeout,
|
2012-03-20 10:49:21 +01:00
|
|
|
poll_fds, ARRAY_SIZE(poll_fds));
|
|
|
|
g_assert(n_poll_fds <= ARRAY_SIZE(poll_fds));
|
|
|
|
|
2012-03-20 10:49:20 +01:00
|
|
|
for (i = 0; i < w->num; i++) {
|
2012-04-12 20:42:34 +02:00
|
|
|
poll_fds[n_poll_fds + i].fd = (DWORD_PTR)w->events[i];
|
2012-03-20 10:49:21 +01:00
|
|
|
poll_fds[n_poll_fds + i].events = G_IO_IN;
|
2012-03-20 10:49:20 +01:00
|
|
|
}
|
|
|
|
|
2013-08-21 17:02:54 +02:00
|
|
|
if (poll_timeout < 0) {
|
|
|
|
poll_timeout_ns = -1;
|
|
|
|
} else {
|
|
|
|
poll_timeout_ns = (int64_t)poll_timeout * (int64_t)SCALE_MS;
|
2012-04-29 19:15:02 +02:00
|
|
|
}
|
|
|
|
|
2013-08-21 17:02:54 +02:00
|
|
|
poll_timeout_ns = qemu_soonest_timeout(poll_timeout_ns, timeout);
|
|
|
|
|
2012-03-20 10:49:19 +01:00
|
|
|
qemu_mutex_unlock_iothread();
|
2013-08-21 17:02:54 +02:00
|
|
|
g_poll_ret = qemu_poll_ns(poll_fds, n_poll_fds + w->num, poll_timeout_ns);
|
|
|
|
|
2012-03-20 10:49:19 +01:00
|
|
|
qemu_mutex_lock_iothread();
|
2013-01-08 16:30:56 +01:00
|
|
|
if (g_poll_ret > 0) {
|
2012-03-20 10:49:20 +01:00
|
|
|
for (i = 0; i < w->num; i++) {
|
2012-03-20 10:49:21 +01:00
|
|
|
w->revents[i] = poll_fds[n_poll_fds + i].revents;
|
2012-03-20 10:49:19 +01:00
|
|
|
}
|
2012-03-20 10:49:20 +01:00
|
|
|
for (i = 0; i < w->num; i++) {
|
|
|
|
if (w->revents[i] && w->func[i]) {
|
|
|
|
w->func[i](w->opaque[i]);
|
2011-09-13 10:30:52 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-03-20 10:49:21 +01:00
|
|
|
if (g_main_context_check(context, max_priority, poll_fds, n_poll_fds)) {
|
|
|
|
g_main_context_dispatch(context);
|
|
|
|
}
|
|
|
|
|
2013-01-08 16:30:56 +01:00
|
|
|
return select_ret || g_poll_ret;
|
2011-09-13 10:30:52 +02:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
int main_loop_wait(int nonblocking)
|
|
|
|
{
|
2012-04-13 20:35:04 +02:00
|
|
|
int ret;
|
|
|
|
uint32_t timeout = UINT32_MAX;
|
2013-08-21 17:02:54 +02:00
|
|
|
int64_t timeout_ns;
|
2011-09-13 10:30:52 +02:00
|
|
|
|
|
|
|
if (nonblocking) {
|
|
|
|
timeout = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* poll any events */
|
2013-02-20 11:28:25 +01:00
|
|
|
g_array_set_size(gpollfds, 0); /* reset for new iteration */
|
2011-09-13 10:30:52 +02:00
|
|
|
/* XXX: separate device handlers from system ones */
|
|
|
|
#ifdef CONFIG_SLIRP
|
2013-08-25 04:01:21 +02:00
|
|
|
slirp_pollfds_fill(gpollfds, &timeout);
|
2011-09-13 10:30:52 +02:00
|
|
|
#endif
|
2013-08-21 17:02:54 +02:00
|
|
|
|
|
|
|
if (timeout == UINT32_MAX) {
|
|
|
|
timeout_ns = -1;
|
|
|
|
} else {
|
|
|
|
timeout_ns = (uint64_t)timeout * (int64_t)(SCALE_MS);
|
|
|
|
}
|
|
|
|
|
|
|
|
timeout_ns = qemu_soonest_timeout(timeout_ns,
|
|
|
|
timerlistgroup_deadline_ns(
|
|
|
|
&main_loop_tlg));
|
|
|
|
|
|
|
|
ret = os_host_main_loop_wait(timeout_ns);
|
2011-09-13 10:30:52 +02:00
|
|
|
#ifdef CONFIG_SLIRP
|
2013-02-20 11:28:28 +01:00
|
|
|
slirp_pollfds_poll(gpollfds, (ret < 0));
|
2011-09-13 10:30:52 +02:00
|
|
|
#endif
|
|
|
|
|
2015-09-17 18:24:39 +02:00
|
|
|
/* CPU thread can infinitely wait for event after
|
|
|
|
missing the warp */
|
|
|
|
qemu_clock_warp(QEMU_CLOCK_VIRTUAL);
|
2013-08-21 17:03:02 +02:00
|
|
|
qemu_clock_run_all_timers();
|
2011-09-13 10:30:52 +02:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2012-10-29 23:45:23 +01:00
|
|
|
|
|
|
|
/* Functions to operate on the main QEMU AioContext. */
|
|
|
|
|
|
|
|
QEMUBH *qemu_bh_new(QEMUBHFunc *cb, void *opaque)
|
|
|
|
{
|
|
|
|
return aio_bh_new(qemu_aio_context, cb, opaque);
|
|
|
|
}
|