util/main-loop.c

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