mirror of
https://gitlab.com/libvirt/libvirt.git
synced 2024-12-24 22:55:23 +00:00
a7483a5631
Regression introduced in commit e6b68d7 (Nov 2010).
Prior to that point, handlesAlloc was always a multiple of
EVENT_ALLOC_EXTENT (10), and was an int (so even if the subtraction
had been able to wrap, a negative value would be less than the count
not try to free the handles array). But after that point,
VIR_RESIZE_N made handlesAlloc grow geometrically (with a pattern of
10, 20, 30, 45 for the handles array) but still freed in multiples of
EVENT_ALLOC_EXTENT; and the count changed to size_t. Which means that
after 31 handles have been created, then 30 handles destroyed,
handlesAlloc is 5 while handlesCount is 1, and since (size_t)(1 - 5)
is indeed greater than 1, this then tried to free 10 elements, which
had the awful effect of nuking the handles array while there were
still live handles.
Nuking live handles puts libvirtd in an inconsistent state, and was
easily reproducible by starting and then stopping 60 faqemu guests.
* daemon/event.c (virEventCleanupTimeouts, virEventCleanupHandles):
Avoid integer wrap-around causing us to delete the entire array
while entries are still active.
* tests/eventtest.c (mymain): Expose the bug.
707 lines
21 KiB
C
707 lines
21 KiB
C
/*
|
|
* event.c: event loop for monitoring file handles
|
|
*
|
|
* Copyright (C) 2007, 2010-2011 Red Hat, Inc.
|
|
* Copyright (C) 2007 Daniel P. Berrange
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*
|
|
* Author: Daniel P. Berrange <berrange@redhat.com>
|
|
*/
|
|
|
|
#include <config.h>
|
|
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <poll.h>
|
|
#include <sys/time.h>
|
|
#include <errno.h>
|
|
#include <unistd.h>
|
|
|
|
#include "threads.h"
|
|
#include "logging.h"
|
|
#include "event.h"
|
|
#include "memory.h"
|
|
#include "util.h"
|
|
#include "ignore-value.h"
|
|
|
|
#define EVENT_DEBUG(fmt, ...) DEBUG(fmt, __VA_ARGS__)
|
|
|
|
static int virEventInterruptLocked(void);
|
|
|
|
/* State for a single file handle being monitored */
|
|
struct virEventHandle {
|
|
int watch;
|
|
int fd;
|
|
int events;
|
|
virEventHandleCallback cb;
|
|
virFreeCallback ff;
|
|
void *opaque;
|
|
int deleted;
|
|
};
|
|
|
|
/* State for a single timer being generated */
|
|
struct virEventTimeout {
|
|
int timer;
|
|
int frequency;
|
|
unsigned long long expiresAt;
|
|
virEventTimeoutCallback cb;
|
|
virFreeCallback ff;
|
|
void *opaque;
|
|
int deleted;
|
|
};
|
|
|
|
/* Allocate extra slots for virEventHandle/virEventTimeout
|
|
records in this multiple */
|
|
#define EVENT_ALLOC_EXTENT 10
|
|
|
|
/* State for the main event loop */
|
|
struct virEventLoop {
|
|
virMutex lock;
|
|
int running;
|
|
virThread leader;
|
|
int wakeupfd[2];
|
|
size_t handlesCount;
|
|
size_t handlesAlloc;
|
|
struct virEventHandle *handles;
|
|
size_t timeoutsCount;
|
|
size_t timeoutsAlloc;
|
|
struct virEventTimeout *timeouts;
|
|
};
|
|
|
|
/* Only have one event loop */
|
|
static struct virEventLoop eventLoop;
|
|
|
|
/* Unique ID for the next FD watch to be registered */
|
|
static int nextWatch = 1;
|
|
|
|
/* Unique ID for the next timer to be registered */
|
|
static int nextTimer = 1;
|
|
|
|
/*
|
|
* Register a callback for monitoring file handle events.
|
|
* NB, it *must* be safe to call this from within a callback
|
|
* For this reason we only ever append to existing list.
|
|
*/
|
|
int virEventAddHandleImpl(int fd, int events,
|
|
virEventHandleCallback cb,
|
|
void *opaque,
|
|
virFreeCallback ff) {
|
|
int watch;
|
|
EVENT_DEBUG("Add handle fd=%d events=%d cb=%p opaque=%p", fd, events, cb, opaque);
|
|
virMutexLock(&eventLoop.lock);
|
|
if (eventLoop.handlesCount == eventLoop.handlesAlloc) {
|
|
EVENT_DEBUG("Used %zu handle slots, adding at least %d more",
|
|
eventLoop.handlesAlloc, EVENT_ALLOC_EXTENT);
|
|
if (VIR_RESIZE_N(eventLoop.handles, eventLoop.handlesAlloc,
|
|
eventLoop.handlesCount, EVENT_ALLOC_EXTENT) < 0) {
|
|
virMutexUnlock(&eventLoop.lock);
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
watch = nextWatch++;
|
|
|
|
eventLoop.handles[eventLoop.handlesCount].watch = watch;
|
|
eventLoop.handles[eventLoop.handlesCount].fd = fd;
|
|
eventLoop.handles[eventLoop.handlesCount].events =
|
|
virEventHandleTypeToPollEvent(events);
|
|
eventLoop.handles[eventLoop.handlesCount].cb = cb;
|
|
eventLoop.handles[eventLoop.handlesCount].ff = ff;
|
|
eventLoop.handles[eventLoop.handlesCount].opaque = opaque;
|
|
eventLoop.handles[eventLoop.handlesCount].deleted = 0;
|
|
|
|
eventLoop.handlesCount++;
|
|
|
|
virEventInterruptLocked();
|
|
virMutexUnlock(&eventLoop.lock);
|
|
|
|
return watch;
|
|
}
|
|
|
|
void virEventUpdateHandleImpl(int watch, int events) {
|
|
int i;
|
|
EVENT_DEBUG("Update handle w=%d e=%d", watch, events);
|
|
|
|
if (watch <= 0) {
|
|
VIR_WARN("Ignoring invalid update watch %d", watch);
|
|
return;
|
|
}
|
|
|
|
virMutexLock(&eventLoop.lock);
|
|
for (i = 0 ; i < eventLoop.handlesCount ; i++) {
|
|
if (eventLoop.handles[i].watch == watch) {
|
|
eventLoop.handles[i].events =
|
|
virEventHandleTypeToPollEvent(events);
|
|
virEventInterruptLocked();
|
|
break;
|
|
}
|
|
}
|
|
virMutexUnlock(&eventLoop.lock);
|
|
}
|
|
|
|
/*
|
|
* Unregister a callback from a file handle
|
|
* NB, it *must* be safe to call this from within a callback
|
|
* For this reason we only ever set a flag in the existing list.
|
|
* Actual deletion will be done out-of-band
|
|
*/
|
|
int virEventRemoveHandleImpl(int watch) {
|
|
int i;
|
|
EVENT_DEBUG("Remove handle w=%d", watch);
|
|
|
|
if (watch <= 0) {
|
|
VIR_WARN("Ignoring invalid remove watch %d", watch);
|
|
return -1;
|
|
}
|
|
|
|
virMutexLock(&eventLoop.lock);
|
|
for (i = 0 ; i < eventLoop.handlesCount ; i++) {
|
|
if (eventLoop.handles[i].deleted)
|
|
continue;
|
|
|
|
if (eventLoop.handles[i].watch == watch) {
|
|
EVENT_DEBUG("mark delete %d %d", i, eventLoop.handles[i].fd);
|
|
eventLoop.handles[i].deleted = 1;
|
|
virEventInterruptLocked();
|
|
virMutexUnlock(&eventLoop.lock);
|
|
return 0;
|
|
}
|
|
}
|
|
virMutexUnlock(&eventLoop.lock);
|
|
return -1;
|
|
}
|
|
|
|
|
|
/*
|
|
* Register a callback for a timer event
|
|
* NB, it *must* be safe to call this from within a callback
|
|
* For this reason we only ever append to existing list.
|
|
*/
|
|
int virEventAddTimeoutImpl(int frequency,
|
|
virEventTimeoutCallback cb,
|
|
void *opaque,
|
|
virFreeCallback ff) {
|
|
struct timeval now;
|
|
int ret;
|
|
EVENT_DEBUG("Adding timer %d with %d ms freq", nextTimer, frequency);
|
|
if (gettimeofday(&now, NULL) < 0) {
|
|
return -1;
|
|
}
|
|
|
|
virMutexLock(&eventLoop.lock);
|
|
if (eventLoop.timeoutsCount == eventLoop.timeoutsAlloc) {
|
|
EVENT_DEBUG("Used %zu timeout slots, adding at least %d more",
|
|
eventLoop.timeoutsAlloc, EVENT_ALLOC_EXTENT);
|
|
if (VIR_RESIZE_N(eventLoop.timeouts, eventLoop.timeoutsAlloc,
|
|
eventLoop.timeoutsCount, EVENT_ALLOC_EXTENT) < 0) {
|
|
virMutexUnlock(&eventLoop.lock);
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
eventLoop.timeouts[eventLoop.timeoutsCount].timer = nextTimer++;
|
|
eventLoop.timeouts[eventLoop.timeoutsCount].frequency = frequency;
|
|
eventLoop.timeouts[eventLoop.timeoutsCount].cb = cb;
|
|
eventLoop.timeouts[eventLoop.timeoutsCount].ff = ff;
|
|
eventLoop.timeouts[eventLoop.timeoutsCount].opaque = opaque;
|
|
eventLoop.timeouts[eventLoop.timeoutsCount].deleted = 0;
|
|
eventLoop.timeouts[eventLoop.timeoutsCount].expiresAt =
|
|
frequency >= 0 ? frequency +
|
|
(((unsigned long long)now.tv_sec)*1000) +
|
|
(((unsigned long long)now.tv_usec)/1000) : 0;
|
|
|
|
eventLoop.timeoutsCount++;
|
|
ret = nextTimer-1;
|
|
virEventInterruptLocked();
|
|
virMutexUnlock(&eventLoop.lock);
|
|
return ret;
|
|
}
|
|
|
|
void virEventUpdateTimeoutImpl(int timer, int frequency) {
|
|
struct timeval tv;
|
|
int i;
|
|
EVENT_DEBUG("Updating timer %d timeout with %d ms freq", timer, frequency);
|
|
|
|
if (timer <= 0) {
|
|
VIR_WARN("Ignoring invalid update timer %d", timer);
|
|
return;
|
|
}
|
|
|
|
if (gettimeofday(&tv, NULL) < 0) {
|
|
return;
|
|
}
|
|
|
|
virMutexLock(&eventLoop.lock);
|
|
for (i = 0 ; i < eventLoop.timeoutsCount ; i++) {
|
|
if (eventLoop.timeouts[i].timer == timer) {
|
|
eventLoop.timeouts[i].frequency = frequency;
|
|
eventLoop.timeouts[i].expiresAt =
|
|
frequency >= 0 ? frequency +
|
|
(((unsigned long long)tv.tv_sec)*1000) +
|
|
(((unsigned long long)tv.tv_usec)/1000) : 0;
|
|
virEventInterruptLocked();
|
|
break;
|
|
}
|
|
}
|
|
virMutexUnlock(&eventLoop.lock);
|
|
}
|
|
|
|
/*
|
|
* Unregister a callback for a timer
|
|
* NB, it *must* be safe to call this from within a callback
|
|
* For this reason we only ever set a flag in the existing list.
|
|
* Actual deletion will be done out-of-band
|
|
*/
|
|
int virEventRemoveTimeoutImpl(int timer) {
|
|
int i;
|
|
EVENT_DEBUG("Remove timer %d", timer);
|
|
|
|
if (timer <= 0) {
|
|
VIR_WARN("Ignoring invalid remove timer %d", timer);
|
|
return -1;
|
|
}
|
|
|
|
virMutexLock(&eventLoop.lock);
|
|
for (i = 0 ; i < eventLoop.timeoutsCount ; i++) {
|
|
if (eventLoop.timeouts[i].deleted)
|
|
continue;
|
|
|
|
if (eventLoop.timeouts[i].timer == timer) {
|
|
eventLoop.timeouts[i].deleted = 1;
|
|
virEventInterruptLocked();
|
|
virMutexUnlock(&eventLoop.lock);
|
|
return 0;
|
|
}
|
|
}
|
|
virMutexUnlock(&eventLoop.lock);
|
|
return -1;
|
|
}
|
|
|
|
/* Iterates over all registered timeouts and determine which
|
|
* will be the first to expire.
|
|
* @timeout: filled with expiry time of soonest timer, or -1 if
|
|
* no timeout is pending
|
|
* returns: 0 on success, -1 on error
|
|
*/
|
|
static int virEventCalculateTimeout(int *timeout) {
|
|
unsigned long long then = 0;
|
|
int i;
|
|
EVENT_DEBUG("Calculate expiry of %zu timers", eventLoop.timeoutsCount);
|
|
/* Figure out if we need a timeout */
|
|
for (i = 0 ; i < eventLoop.timeoutsCount ; i++) {
|
|
if (eventLoop.timeouts[i].frequency < 0)
|
|
continue;
|
|
|
|
EVENT_DEBUG("Got a timeout scheduled for %llu", eventLoop.timeouts[i].expiresAt);
|
|
if (then == 0 ||
|
|
eventLoop.timeouts[i].expiresAt < then)
|
|
then = eventLoop.timeouts[i].expiresAt;
|
|
}
|
|
|
|
/* Calculate how long we should wait for a timeout if needed */
|
|
if (then > 0) {
|
|
struct timeval tv;
|
|
|
|
if (gettimeofday(&tv, NULL) < 0) {
|
|
return -1;
|
|
}
|
|
|
|
*timeout = then -
|
|
((((unsigned long long)tv.tv_sec)*1000) +
|
|
(((unsigned long long)tv.tv_usec)/1000));
|
|
|
|
if (*timeout < 0)
|
|
*timeout = 0;
|
|
} else {
|
|
*timeout = -1;
|
|
}
|
|
|
|
EVENT_DEBUG("Timeout at %llu due in %d ms", then, *timeout);
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Allocate a pollfd array containing data for all registered
|
|
* file handles. The caller must free the returned data struct
|
|
* returns: the pollfd array, or NULL on error
|
|
*/
|
|
static struct pollfd *virEventMakePollFDs(int *nfds) {
|
|
struct pollfd *fds;
|
|
int i;
|
|
|
|
*nfds = 0;
|
|
for (i = 0 ; i < eventLoop.handlesCount ; i++) {
|
|
if (eventLoop.handles[i].events)
|
|
(*nfds)++;
|
|
}
|
|
|
|
/* Setup the poll file handle data structs */
|
|
if (VIR_ALLOC_N(fds, *nfds) < 0)
|
|
return NULL;
|
|
|
|
*nfds = 0;
|
|
for (i = 0 ; i < eventLoop.handlesCount ; i++) {
|
|
EVENT_DEBUG("Prepare n=%d w=%d, f=%d e=%d", i,
|
|
eventLoop.handles[i].watch,
|
|
eventLoop.handles[i].fd,
|
|
eventLoop.handles[i].events);
|
|
if (!eventLoop.handles[i].events)
|
|
continue;
|
|
fds[*nfds].fd = eventLoop.handles[i].fd;
|
|
fds[*nfds].events = eventLoop.handles[i].events;
|
|
fds[*nfds].revents = 0;
|
|
(*nfds)++;
|
|
//EVENT_DEBUG("Wait for %d %d", eventLoop.handles[i].fd, eventLoop.handles[i].events);
|
|
}
|
|
|
|
return fds;
|
|
}
|
|
|
|
|
|
/*
|
|
* Iterate over all timers and determine if any have expired.
|
|
* Invoke the user supplied callback for each timer whose
|
|
* expiry time is met, and schedule the next timeout. Does
|
|
* not try to 'catch up' on time if the actual expiry time
|
|
* was later than the requested time.
|
|
*
|
|
* This method must cope with new timers being registered
|
|
* by a callback, and must skip any timers marked as deleted.
|
|
*
|
|
* Returns 0 upon success, -1 if an error occurred
|
|
*/
|
|
static int virEventDispatchTimeouts(void) {
|
|
struct timeval tv;
|
|
unsigned long long now;
|
|
int i;
|
|
/* Save this now - it may be changed during dispatch */
|
|
int ntimeouts = eventLoop.timeoutsCount;
|
|
DEBUG("Dispatch %d", ntimeouts);
|
|
|
|
if (gettimeofday(&tv, NULL) < 0) {
|
|
return -1;
|
|
}
|
|
now = (((unsigned long long)tv.tv_sec)*1000) +
|
|
(((unsigned long long)tv.tv_usec)/1000);
|
|
|
|
for (i = 0 ; i < ntimeouts ; i++) {
|
|
if (eventLoop.timeouts[i].deleted || eventLoop.timeouts[i].frequency < 0)
|
|
continue;
|
|
|
|
/* Add 20ms fuzz so we don't pointlessly spin doing
|
|
* <10ms sleeps, particularly on kernels with low HZ
|
|
* it is fine that a timer expires 20ms earlier than
|
|
* requested
|
|
*/
|
|
if (eventLoop.timeouts[i].expiresAt <= (now+20)) {
|
|
virEventTimeoutCallback cb = eventLoop.timeouts[i].cb;
|
|
int timer = eventLoop.timeouts[i].timer;
|
|
void *opaque = eventLoop.timeouts[i].opaque;
|
|
eventLoop.timeouts[i].expiresAt =
|
|
now + eventLoop.timeouts[i].frequency;
|
|
|
|
virMutexUnlock(&eventLoop.lock);
|
|
(cb)(timer, opaque);
|
|
virMutexLock(&eventLoop.lock);
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
/* Iterate over all file handles and dispatch any which
|
|
* have pending events listed in the poll() data. Invoke
|
|
* the user supplied callback for each handle which has
|
|
* pending events
|
|
*
|
|
* This method must cope with new handles being registered
|
|
* by a callback, and must skip any handles marked as deleted.
|
|
*
|
|
* Returns 0 upon success, -1 if an error occurred
|
|
*/
|
|
static int virEventDispatchHandles(int nfds, struct pollfd *fds) {
|
|
int i, n;
|
|
DEBUG("Dispatch %d", nfds);
|
|
|
|
/* NB, use nfds not eventLoop.handlesCount, because new
|
|
* fds might be added on end of list, and they're not
|
|
* in the fds array we've got */
|
|
for (i = 0, n = 0 ; n < nfds && i < eventLoop.handlesCount ; n++) {
|
|
while ((eventLoop.handles[i].fd != fds[n].fd ||
|
|
eventLoop.handles[i].events == 0) &&
|
|
i < eventLoop.handlesCount) {
|
|
i++;
|
|
}
|
|
if (i == eventLoop.handlesCount)
|
|
break;
|
|
|
|
DEBUG("i=%d w=%d", i, eventLoop.handles[i].watch);
|
|
if (eventLoop.handles[i].deleted) {
|
|
EVENT_DEBUG("Skip deleted n=%d w=%d f=%d", i,
|
|
eventLoop.handles[i].watch, eventLoop.handles[i].fd);
|
|
continue;
|
|
}
|
|
|
|
if (fds[n].revents) {
|
|
virEventHandleCallback cb = eventLoop.handles[i].cb;
|
|
int watch = eventLoop.handles[i].watch;
|
|
void *opaque = eventLoop.handles[i].opaque;
|
|
int hEvents = virPollEventToEventHandleType(fds[n].revents);
|
|
EVENT_DEBUG("Dispatch n=%d f=%d w=%d e=%d %p", i,
|
|
fds[n].fd, watch, fds[n].revents, opaque);
|
|
virMutexUnlock(&eventLoop.lock);
|
|
(cb)(watch, fds[n].fd, hEvents, opaque);
|
|
virMutexLock(&eventLoop.lock);
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
/* Used post dispatch to actually remove any timers that
|
|
* were previously marked as deleted. This asynchronous
|
|
* cleanup is needed to make dispatch re-entrant safe.
|
|
*/
|
|
static int virEventCleanupTimeouts(void) {
|
|
int i;
|
|
size_t gap;
|
|
DEBUG("Cleanup %zu", eventLoop.timeoutsCount);
|
|
|
|
/* Remove deleted entries, shuffling down remaining
|
|
* entries as needed to form contiguous series
|
|
*/
|
|
for (i = 0 ; i < eventLoop.timeoutsCount ; ) {
|
|
if (!eventLoop.timeouts[i].deleted) {
|
|
i++;
|
|
continue;
|
|
}
|
|
|
|
EVENT_DEBUG("Purging timeout %d with id %d", i,
|
|
eventLoop.timeouts[i].timer);
|
|
if (eventLoop.timeouts[i].ff)
|
|
(eventLoop.timeouts[i].ff)(eventLoop.timeouts[i].opaque);
|
|
|
|
if ((i+1) < eventLoop.timeoutsCount) {
|
|
memmove(eventLoop.timeouts+i,
|
|
eventLoop.timeouts+i+1,
|
|
sizeof(struct virEventTimeout)*(eventLoop.timeoutsCount
|
|
-(i+1)));
|
|
}
|
|
eventLoop.timeoutsCount--;
|
|
}
|
|
|
|
/* Release some memory if we've got a big chunk free */
|
|
gap = eventLoop.timeoutsAlloc - eventLoop.timeoutsCount;
|
|
if (eventLoop.timeoutsCount == 0 ||
|
|
(gap > eventLoop.timeoutsCount && gap > EVENT_ALLOC_EXTENT)) {
|
|
EVENT_DEBUG("Found %zu out of %zu timeout slots used, releasing %zu",
|
|
eventLoop.timeoutsCount, eventLoop.timeoutsAlloc, gap);
|
|
VIR_SHRINK_N(eventLoop.timeouts, eventLoop.timeoutsAlloc, gap);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/* Used post dispatch to actually remove any handles that
|
|
* were previously marked as deleted. This asynchronous
|
|
* cleanup is needed to make dispatch re-entrant safe.
|
|
*/
|
|
static int virEventCleanupHandles(void) {
|
|
int i;
|
|
size_t gap;
|
|
DEBUG("Cleanup %zu", eventLoop.handlesCount);
|
|
|
|
/* Remove deleted entries, shuffling down remaining
|
|
* entries as needed to form contiguous series
|
|
*/
|
|
for (i = 0 ; i < eventLoop.handlesCount ; ) {
|
|
if (!eventLoop.handles[i].deleted) {
|
|
i++;
|
|
continue;
|
|
}
|
|
|
|
if (eventLoop.handles[i].ff)
|
|
(eventLoop.handles[i].ff)(eventLoop.handles[i].opaque);
|
|
|
|
if ((i+1) < eventLoop.handlesCount) {
|
|
memmove(eventLoop.handles+i,
|
|
eventLoop.handles+i+1,
|
|
sizeof(struct virEventHandle)*(eventLoop.handlesCount
|
|
-(i+1)));
|
|
}
|
|
eventLoop.handlesCount--;
|
|
}
|
|
|
|
/* Release some memory if we've got a big chunk free */
|
|
gap = eventLoop.handlesAlloc - eventLoop.handlesCount;
|
|
if (eventLoop.handlesCount == 0 ||
|
|
(gap > eventLoop.handlesCount && gap > EVENT_ALLOC_EXTENT)) {
|
|
EVENT_DEBUG("Found %zu out of %zu handles slots used, releasing %zu",
|
|
eventLoop.handlesCount, eventLoop.handlesAlloc, gap);
|
|
VIR_SHRINK_N(eventLoop.handles, eventLoop.handlesAlloc, gap);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Run a single iteration of the event loop, blocking until
|
|
* at least one file handle has an event, or a timer expires
|
|
*/
|
|
int virEventRunOnce(void) {
|
|
struct pollfd *fds = NULL;
|
|
int ret, timeout, nfds;
|
|
|
|
virMutexLock(&eventLoop.lock);
|
|
eventLoop.running = 1;
|
|
virThreadSelf(&eventLoop.leader);
|
|
|
|
if (virEventCleanupTimeouts() < 0 ||
|
|
virEventCleanupHandles() < 0)
|
|
goto error;
|
|
|
|
if (!(fds = virEventMakePollFDs(&nfds)) ||
|
|
virEventCalculateTimeout(&timeout) < 0)
|
|
goto error;
|
|
|
|
virMutexUnlock(&eventLoop.lock);
|
|
|
|
retry:
|
|
EVENT_DEBUG("Poll on %d handles %p timeout %d", nfds, fds, timeout);
|
|
ret = poll(fds, nfds, timeout);
|
|
if (ret < 0) {
|
|
EVENT_DEBUG("Poll got error event %d", errno);
|
|
if (errno == EINTR) {
|
|
goto retry;
|
|
}
|
|
goto error_unlocked;
|
|
}
|
|
EVENT_DEBUG("Poll got %d event(s)", ret);
|
|
|
|
virMutexLock(&eventLoop.lock);
|
|
if (virEventDispatchTimeouts() < 0)
|
|
goto error;
|
|
|
|
if (ret > 0 &&
|
|
virEventDispatchHandles(nfds, fds) < 0)
|
|
goto error;
|
|
|
|
if (virEventCleanupTimeouts() < 0 ||
|
|
virEventCleanupHandles() < 0)
|
|
goto error;
|
|
|
|
eventLoop.running = 0;
|
|
virMutexUnlock(&eventLoop.lock);
|
|
VIR_FREE(fds);
|
|
return 0;
|
|
|
|
error:
|
|
virMutexUnlock(&eventLoop.lock);
|
|
error_unlocked:
|
|
VIR_FREE(fds);
|
|
return -1;
|
|
}
|
|
|
|
|
|
static void virEventHandleWakeup(int watch ATTRIBUTE_UNUSED,
|
|
int fd,
|
|
int events ATTRIBUTE_UNUSED,
|
|
void *opaque ATTRIBUTE_UNUSED)
|
|
{
|
|
char c;
|
|
virMutexLock(&eventLoop.lock);
|
|
ignore_value(saferead(fd, &c, sizeof(c)));
|
|
virMutexUnlock(&eventLoop.lock);
|
|
}
|
|
|
|
int virEventInit(void)
|
|
{
|
|
if (virMutexInit(&eventLoop.lock) < 0)
|
|
return -1;
|
|
|
|
if (pipe(eventLoop.wakeupfd) < 0 ||
|
|
virSetNonBlock(eventLoop.wakeupfd[0]) < 0 ||
|
|
virSetNonBlock(eventLoop.wakeupfd[1]) < 0 ||
|
|
virSetCloseExec(eventLoop.wakeupfd[0]) < 0 ||
|
|
virSetCloseExec(eventLoop.wakeupfd[1]) < 0)
|
|
return -1;
|
|
|
|
if (virEventAddHandleImpl(eventLoop.wakeupfd[0],
|
|
VIR_EVENT_HANDLE_READABLE,
|
|
virEventHandleWakeup, NULL, NULL) < 0)
|
|
return -1;
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int virEventInterruptLocked(void)
|
|
{
|
|
char c = '\0';
|
|
|
|
if (!eventLoop.running ||
|
|
virThreadIsSelf(&eventLoop.leader)) {
|
|
VIR_DEBUG("Skip interrupt, %d %d", eventLoop.running,
|
|
virThreadID(&eventLoop.leader));
|
|
return 0;
|
|
}
|
|
|
|
VIR_DEBUG0("Interrupting");
|
|
if (safewrite(eventLoop.wakeupfd[1], &c, sizeof(c)) != sizeof(c))
|
|
return -1;
|
|
return 0;
|
|
}
|
|
|
|
int virEventInterrupt(void)
|
|
{
|
|
int ret;
|
|
virMutexLock(&eventLoop.lock);
|
|
ret = virEventInterruptLocked();
|
|
virMutexUnlock(&eventLoop.lock);
|
|
return ret;
|
|
}
|
|
|
|
int
|
|
virEventHandleTypeToPollEvent(int events)
|
|
{
|
|
int ret = 0;
|
|
if(events & VIR_EVENT_HANDLE_READABLE)
|
|
ret |= POLLIN;
|
|
if(events & VIR_EVENT_HANDLE_WRITABLE)
|
|
ret |= POLLOUT;
|
|
if(events & VIR_EVENT_HANDLE_ERROR)
|
|
ret |= POLLERR;
|
|
if(events & VIR_EVENT_HANDLE_HANGUP)
|
|
ret |= POLLHUP;
|
|
return ret;
|
|
}
|
|
|
|
int
|
|
virPollEventToEventHandleType(int events)
|
|
{
|
|
int ret = 0;
|
|
if(events & POLLIN)
|
|
ret |= VIR_EVENT_HANDLE_READABLE;
|
|
if(events & POLLOUT)
|
|
ret |= VIR_EVENT_HANDLE_WRITABLE;
|
|
if(events & POLLERR)
|
|
ret |= VIR_EVENT_HANDLE_ERROR;
|
|
if(events & POLLNVAL) /* Treat NVAL as error, since libvirt doesn't distinguish */
|
|
ret |= VIR_EVENT_HANDLE_ERROR;
|
|
if(events & POLLHUP)
|
|
ret |= VIR_EVENT_HANDLE_HANGUP;
|
|
return ret;
|
|
}
|