mirror of
http://github.com/valkey-io/valkey
synced 2024-11-22 09:17:20 +00:00
369 lines
12 KiB
C
369 lines
12 KiB
C
/* A simple event-driven programming library. Originally I wrote this code
|
|
* for the Jim's event-loop (Jim is a Tcl interpreter) but later translated
|
|
* it in form of a library for easy reuse.
|
|
*
|
|
* Copyright (c) 2006-2009, Salvatore Sanfilippo <antirez at gmail dot com>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* * Neither the name of Redis nor the names of its contributors may be used
|
|
* to endorse or promote products derived from this software without
|
|
* specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <sys/time.h>
|
|
#include <sys/types.h>
|
|
#include <unistd.h>
|
|
#include <stdlib.h>
|
|
|
|
#include "ae.h"
|
|
#include "zmalloc.h"
|
|
|
|
aeEventLoop *aeCreateEventLoop(void) {
|
|
aeEventLoop *eventLoop;
|
|
|
|
eventLoop = zmalloc(sizeof(*eventLoop));
|
|
if (!eventLoop) return NULL;
|
|
eventLoop->fileEventHead = NULL;
|
|
eventLoop->timeEventHead = NULL;
|
|
eventLoop->timeEventNextId = 0;
|
|
eventLoop->stop = 0;
|
|
return eventLoop;
|
|
}
|
|
|
|
void aeDeleteEventLoop(aeEventLoop *eventLoop) {
|
|
zfree(eventLoop);
|
|
}
|
|
|
|
void aeStop(aeEventLoop *eventLoop) {
|
|
eventLoop->stop = 1;
|
|
}
|
|
|
|
int aeCreateFileEvent(aeEventLoop *eventLoop, int fd, int mask,
|
|
aeFileProc *proc, void *clientData,
|
|
aeEventFinalizerProc *finalizerProc)
|
|
{
|
|
aeFileEvent *fe;
|
|
|
|
fe = zmalloc(sizeof(*fe));
|
|
if (fe == NULL) return AE_ERR;
|
|
fe->fd = fd;
|
|
fe->mask = mask;
|
|
fe->fileProc = proc;
|
|
fe->finalizerProc = finalizerProc;
|
|
fe->clientData = clientData;
|
|
fe->next = eventLoop->fileEventHead;
|
|
eventLoop->fileEventHead = fe;
|
|
return AE_OK;
|
|
}
|
|
|
|
void aeDeleteFileEvent(aeEventLoop *eventLoop, int fd, int mask)
|
|
{
|
|
aeFileEvent *fe, *prev = NULL;
|
|
|
|
fe = eventLoop->fileEventHead;
|
|
while(fe) {
|
|
if (fe->fd == fd && fe->mask == mask) {
|
|
if (prev == NULL)
|
|
eventLoop->fileEventHead = fe->next;
|
|
else
|
|
prev->next = fe->next;
|
|
if (fe->finalizerProc)
|
|
fe->finalizerProc(eventLoop, fe->clientData);
|
|
zfree(fe);
|
|
return;
|
|
}
|
|
prev = fe;
|
|
fe = fe->next;
|
|
}
|
|
}
|
|
|
|
static void aeGetTime(long *seconds, long *milliseconds)
|
|
{
|
|
struct timeval tv;
|
|
|
|
gettimeofday(&tv, NULL);
|
|
*seconds = tv.tv_sec;
|
|
*milliseconds = tv.tv_usec/1000;
|
|
}
|
|
|
|
static void aeAddMillisecondsToNow(long long milliseconds, long *sec, long *ms) {
|
|
long cur_sec, cur_ms, when_sec, when_ms;
|
|
|
|
aeGetTime(&cur_sec, &cur_ms);
|
|
when_sec = cur_sec + milliseconds/1000;
|
|
when_ms = cur_ms + milliseconds%1000;
|
|
if (when_ms >= 1000) {
|
|
when_sec ++;
|
|
when_ms -= 1000;
|
|
}
|
|
*sec = when_sec;
|
|
*ms = when_ms;
|
|
}
|
|
|
|
long long aeCreateTimeEvent(aeEventLoop *eventLoop, long long milliseconds,
|
|
aeTimeProc *proc, void *clientData,
|
|
aeEventFinalizerProc *finalizerProc)
|
|
{
|
|
long long id = eventLoop->timeEventNextId++;
|
|
aeTimeEvent *te;
|
|
|
|
te = zmalloc(sizeof(*te));
|
|
if (te == NULL) return AE_ERR;
|
|
te->id = id;
|
|
aeAddMillisecondsToNow(milliseconds,&te->when_sec,&te->when_ms);
|
|
te->timeProc = proc;
|
|
te->finalizerProc = finalizerProc;
|
|
te->clientData = clientData;
|
|
te->next = eventLoop->timeEventHead;
|
|
eventLoop->timeEventHead = te;
|
|
return id;
|
|
}
|
|
|
|
int aeDeleteTimeEvent(aeEventLoop *eventLoop, long long id)
|
|
{
|
|
aeTimeEvent *te, *prev = NULL;
|
|
|
|
te = eventLoop->timeEventHead;
|
|
while(te) {
|
|
if (te->id == id) {
|
|
if (prev == NULL)
|
|
eventLoop->timeEventHead = te->next;
|
|
else
|
|
prev->next = te->next;
|
|
if (te->finalizerProc)
|
|
te->finalizerProc(eventLoop, te->clientData);
|
|
zfree(te);
|
|
return AE_OK;
|
|
}
|
|
prev = te;
|
|
te = te->next;
|
|
}
|
|
return AE_ERR; /* NO event with the specified ID found */
|
|
}
|
|
|
|
/* Search the first timer to fire.
|
|
* This operation is useful to know how many time the select can be
|
|
* put in sleep without to delay any event.
|
|
* If there are no timers NULL is returned.
|
|
*
|
|
* Note that's O(N) since time events are unsorted. */
|
|
static aeTimeEvent *aeSearchNearestTimer(aeEventLoop *eventLoop)
|
|
{
|
|
aeTimeEvent *te = eventLoop->timeEventHead;
|
|
aeTimeEvent *nearest = NULL;
|
|
|
|
while(te) {
|
|
if (!nearest || te->when_sec < nearest->when_sec ||
|
|
(te->when_sec == nearest->when_sec &&
|
|
te->when_ms < nearest->when_ms))
|
|
nearest = te;
|
|
te = te->next;
|
|
}
|
|
return nearest;
|
|
}
|
|
|
|
/* Process every pending time event, then every pending file event
|
|
* (that may be registered by time event callbacks just processed).
|
|
* Without special flags the function sleeps until some file event
|
|
* fires, or when the next time event occurrs (if any).
|
|
*
|
|
* If flags is 0, the function does nothing and returns.
|
|
* if flags has AE_ALL_EVENTS set, all the kind of events are processed.
|
|
* if flags has AE_FILE_EVENTS set, file events are processed.
|
|
* if flags has AE_TIME_EVENTS set, time events are processed.
|
|
* if flags has AE_DONT_WAIT set the function returns ASAP until all
|
|
* the events that's possible to process without to wait are processed.
|
|
*
|
|
* The function returns the number of events processed. */
|
|
int aeProcessEvents(aeEventLoop *eventLoop, int flags)
|
|
{
|
|
int maxfd = 0, numfd = 0, processed = 0;
|
|
fd_set rfds, wfds, efds;
|
|
aeFileEvent *fe = eventLoop->fileEventHead;
|
|
aeTimeEvent *te;
|
|
long long maxId;
|
|
AE_NOTUSED(flags);
|
|
|
|
/* Nothing to do? return ASAP */
|
|
if (!(flags & AE_TIME_EVENTS) && !(flags & AE_FILE_EVENTS)) return 0;
|
|
|
|
FD_ZERO(&rfds);
|
|
FD_ZERO(&wfds);
|
|
FD_ZERO(&efds);
|
|
|
|
/* Check file events */
|
|
if (flags & AE_FILE_EVENTS) {
|
|
while (fe != NULL) {
|
|
if (fe->mask & AE_READABLE) FD_SET(fe->fd, &rfds);
|
|
if (fe->mask & AE_WRITABLE) FD_SET(fe->fd, &wfds);
|
|
if (fe->mask & AE_EXCEPTION) FD_SET(fe->fd, &efds);
|
|
if (maxfd < fe->fd) maxfd = fe->fd;
|
|
numfd++;
|
|
fe = fe->next;
|
|
}
|
|
}
|
|
/* Note that we want call select() even if there are no
|
|
* file events to process as long as we want to process time
|
|
* events, in order to sleep until the next time event is ready
|
|
* to fire. */
|
|
if (numfd || ((flags & AE_TIME_EVENTS) && !(flags & AE_DONT_WAIT))) {
|
|
int retval;
|
|
aeTimeEvent *shortest = NULL;
|
|
struct timeval tv, *tvp;
|
|
|
|
if (flags & AE_TIME_EVENTS && !(flags & AE_DONT_WAIT))
|
|
shortest = aeSearchNearestTimer(eventLoop);
|
|
if (shortest) {
|
|
long now_sec, now_ms;
|
|
|
|
/* Calculate the time missing for the nearest
|
|
* timer to fire. */
|
|
aeGetTime(&now_sec, &now_ms);
|
|
tvp = &tv;
|
|
tvp->tv_sec = shortest->when_sec - now_sec;
|
|
if (shortest->when_ms < now_ms) {
|
|
tvp->tv_usec = ((shortest->when_ms+1000) - now_ms)*1000;
|
|
tvp->tv_sec --;
|
|
} else {
|
|
tvp->tv_usec = (shortest->when_ms - now_ms)*1000;
|
|
}
|
|
} else {
|
|
/* If we have to check for events but need to return
|
|
* ASAP because of AE_DONT_WAIT we need to se the timeout
|
|
* to zero */
|
|
if (flags & AE_DONT_WAIT) {
|
|
tv.tv_sec = tv.tv_usec = 0;
|
|
tvp = &tv;
|
|
} else {
|
|
/* Otherwise we can block */
|
|
tvp = NULL; /* wait forever */
|
|
}
|
|
}
|
|
|
|
retval = select(maxfd+1, &rfds, &wfds, &efds, tvp);
|
|
if (retval > 0) {
|
|
fe = eventLoop->fileEventHead;
|
|
while(fe != NULL) {
|
|
int fd = (int) fe->fd;
|
|
|
|
if ((fe->mask & AE_READABLE && FD_ISSET(fd, &rfds)) ||
|
|
(fe->mask & AE_WRITABLE && FD_ISSET(fd, &wfds)) ||
|
|
(fe->mask & AE_EXCEPTION && FD_ISSET(fd, &efds)))
|
|
{
|
|
int mask = 0;
|
|
|
|
if (fe->mask & AE_READABLE && FD_ISSET(fd, &rfds))
|
|
mask |= AE_READABLE;
|
|
if (fe->mask & AE_WRITABLE && FD_ISSET(fd, &wfds))
|
|
mask |= AE_WRITABLE;
|
|
if (fe->mask & AE_EXCEPTION && FD_ISSET(fd, &efds))
|
|
mask |= AE_EXCEPTION;
|
|
fe->fileProc(eventLoop, fe->fd, fe->clientData, mask);
|
|
processed++;
|
|
/* After an event is processed our file event list
|
|
* may no longer be the same, so what we do
|
|
* is to clear the bit for this file descriptor and
|
|
* restart again from the head. */
|
|
fe = eventLoop->fileEventHead;
|
|
FD_CLR(fd, &rfds);
|
|
FD_CLR(fd, &wfds);
|
|
FD_CLR(fd, &efds);
|
|
} else {
|
|
fe = fe->next;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
/* Check time events */
|
|
if (flags & AE_TIME_EVENTS) {
|
|
te = eventLoop->timeEventHead;
|
|
maxId = eventLoop->timeEventNextId-1;
|
|
while(te) {
|
|
long now_sec, now_ms;
|
|
long long id;
|
|
|
|
if (te->id > maxId) {
|
|
te = te->next;
|
|
continue;
|
|
}
|
|
aeGetTime(&now_sec, &now_ms);
|
|
if (now_sec > te->when_sec ||
|
|
(now_sec == te->when_sec && now_ms >= te->when_ms))
|
|
{
|
|
int retval;
|
|
|
|
id = te->id;
|
|
retval = te->timeProc(eventLoop, id, te->clientData);
|
|
/* After an event is processed our time event list may
|
|
* no longer be the same, so we restart from head.
|
|
* Still we make sure to don't process events registered
|
|
* by event handlers itself in order to don't loop forever.
|
|
* To do so we saved the max ID we want to handle. */
|
|
if (retval != AE_NOMORE) {
|
|
aeAddMillisecondsToNow(retval,&te->when_sec,&te->when_ms);
|
|
} else {
|
|
aeDeleteTimeEvent(eventLoop, id);
|
|
}
|
|
te = eventLoop->timeEventHead;
|
|
} else {
|
|
te = te->next;
|
|
}
|
|
}
|
|
}
|
|
return processed; /* return the number of processed file/time events */
|
|
}
|
|
|
|
/* Wait for millseconds until the given file descriptor becomes
|
|
* writable/readable/exception */
|
|
int aeWait(int fd, int mask, long long milliseconds) {
|
|
struct timeval tv;
|
|
fd_set rfds, wfds, efds;
|
|
int retmask = 0, retval;
|
|
|
|
tv.tv_sec = milliseconds/1000;
|
|
tv.tv_usec = (milliseconds%1000)*1000;
|
|
FD_ZERO(&rfds);
|
|
FD_ZERO(&wfds);
|
|
FD_ZERO(&efds);
|
|
|
|
if (mask & AE_READABLE) FD_SET(fd,&rfds);
|
|
if (mask & AE_WRITABLE) FD_SET(fd,&wfds);
|
|
if (mask & AE_EXCEPTION) FD_SET(fd,&efds);
|
|
if ((retval = select(fd+1, &rfds, &wfds, &efds, &tv)) > 0) {
|
|
if (FD_ISSET(fd,&rfds)) retmask |= AE_READABLE;
|
|
if (FD_ISSET(fd,&wfds)) retmask |= AE_WRITABLE;
|
|
if (FD_ISSET(fd,&efds)) retmask |= AE_EXCEPTION;
|
|
return retmask;
|
|
} else {
|
|
return retval;
|
|
}
|
|
}
|
|
|
|
void aeMain(aeEventLoop *eventLoop)
|
|
{
|
|
eventLoop->stop = 0;
|
|
while (!eventLoop->stop)
|
|
aeProcessEvents(eventLoop, AE_ALL_EVENTS);
|
|
}
|