2004-02-12 18:55:09 +03:00
|
|
|
/* $OpenBSD: select.c,v 1.2 2002/06/25 15:50:15 mickey Exp $ */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright 2000-2002 Niels Provos <provos@citi.umich.edu>
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. 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.
|
|
|
|
* 3. The name of the author may not be used to endorse or promote products
|
|
|
|
* derived from this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
|
|
|
|
*/
|
2004-03-18 00:37:12 +03:00
|
|
|
#include "lam_config.h"
|
2004-02-12 18:55:09 +03:00
|
|
|
|
|
|
|
#include <sys/types.h>
|
|
|
|
#ifdef HAVE_SYS_TIME_H
|
|
|
|
#include <sys/time.h>
|
|
|
|
#else
|
|
|
|
#include <sys/_time.h>
|
|
|
|
#endif
|
|
|
|
#include <sys/queue.h>
|
|
|
|
#include <signal.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <err.h>
|
|
|
|
|
|
|
|
#ifdef USE_LOG
|
|
|
|
#include "log.h"
|
|
|
|
#else
|
|
|
|
#define LOG_DBG(x)
|
|
|
|
#define log_error(x) perror(x)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "event.h"
|
|
|
|
#include "evsignal.h"
|
2004-03-17 21:45:16 +03:00
|
|
|
#include "threads/mutex.h"
|
2004-02-12 18:55:09 +03:00
|
|
|
|
|
|
|
extern struct lam_event_list lam_eventqueue;
|
2004-03-15 23:52:52 +03:00
|
|
|
extern lam_mutex_t lam_event_lock;
|
2004-02-12 18:55:09 +03:00
|
|
|
|
|
|
|
#ifndef howmany
|
|
|
|
#define howmany(x, y) (((x)+((y)-1))/(y))
|
|
|
|
#endif
|
|
|
|
|
|
|
|
extern volatile sig_atomic_t lam_evsignal_caught;
|
|
|
|
|
|
|
|
struct selectop {
|
|
|
|
int event_fds; /* Highest fd in fd set */
|
|
|
|
int event_fdsz;
|
|
|
|
fd_set *event_readset;
|
|
|
|
fd_set *event_writeset;
|
|
|
|
sigset_t evsigmask;
|
|
|
|
} sop;
|
|
|
|
|
|
|
|
static void *select_init (void);
|
|
|
|
static int select_add (void *, struct lam_event *);
|
|
|
|
static int select_del (void *, struct lam_event *);
|
|
|
|
static int select_recalc (void *, int);
|
|
|
|
static int select_dispatch (void *, struct timeval *);
|
|
|
|
|
|
|
|
const struct lam_eventop lam_selectops = {
|
|
|
|
"select",
|
|
|
|
select_init,
|
|
|
|
select_add,
|
|
|
|
select_del,
|
|
|
|
select_recalc,
|
|
|
|
select_dispatch
|
|
|
|
};
|
|
|
|
|
|
|
|
static void *
|
|
|
|
select_init(void)
|
|
|
|
{
|
|
|
|
/* Disable select when this environment variable is set */
|
|
|
|
if (getenv("EVENT_NOSELECT"))
|
|
|
|
return (NULL);
|
|
|
|
memset(&sop, 0, sizeof(sop));
|
|
|
|
lam_evsignal_init(&sop.evsigmask);
|
|
|
|
return (&sop);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Called with the highest fd that we know about. If it is 0, completely
|
|
|
|
* recalculate everything.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static int
|
|
|
|
select_recalc(void *arg, int max)
|
|
|
|
{
|
|
|
|
struct selectop *sop = arg;
|
|
|
|
fd_set *readset, *writeset;
|
|
|
|
struct lam_event *ev;
|
|
|
|
int fdsz;
|
|
|
|
|
|
|
|
if (sop->event_fds < max)
|
|
|
|
sop->event_fds = max;
|
|
|
|
|
|
|
|
if (!sop->event_fds) {
|
|
|
|
TAILQ_FOREACH(ev, &lam_eventqueue, ev_next)
|
|
|
|
if (ev->ev_fd > sop->event_fds)
|
|
|
|
sop->event_fds = ev->ev_fd;
|
|
|
|
}
|
|
|
|
|
|
|
|
fdsz = howmany(sop->event_fds + 1, NFDBITS) * sizeof(fd_mask);
|
|
|
|
if (fdsz > sop->event_fdsz) {
|
|
|
|
if ((readset = realloc(sop->event_readset, fdsz)) == NULL) {
|
|
|
|
log_error("malloc");
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((writeset = realloc(sop->event_writeset, fdsz)) == NULL) {
|
|
|
|
log_error("malloc");
|
|
|
|
free(readset);
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
memset((char *)readset + sop->event_fdsz, 0,
|
|
|
|
fdsz - sop->event_fdsz);
|
|
|
|
memset((char *)writeset + sop->event_fdsz, 0,
|
|
|
|
fdsz - sop->event_fdsz);
|
|
|
|
|
|
|
|
sop->event_readset = readset;
|
|
|
|
sop->event_writeset = writeset;
|
|
|
|
sop->event_fdsz = fdsz;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (lam_evsignal_recalc(&sop->evsigmask));
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
select_dispatch(void *arg, struct timeval *tv)
|
|
|
|
{
|
|
|
|
int maxfd, res;
|
|
|
|
struct lam_event *ev, *next;
|
|
|
|
struct selectop *sop = arg;
|
|
|
|
|
|
|
|
memset(sop->event_readset, 0, sop->event_fdsz);
|
|
|
|
memset(sop->event_writeset, 0, sop->event_fdsz);
|
|
|
|
|
|
|
|
TAILQ_FOREACH(ev, &lam_eventqueue, ev_next) {
|
|
|
|
if (ev->ev_events & LAM_EV_WRITE)
|
|
|
|
FD_SET(ev->ev_fd, sop->event_writeset);
|
|
|
|
if (ev->ev_events & LAM_EV_READ)
|
|
|
|
FD_SET(ev->ev_fd, sop->event_readset);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (lam_evsignal_deliver(&sop->evsigmask) == -1)
|
|
|
|
return (-1);
|
|
|
|
|
2004-03-15 23:52:52 +03:00
|
|
|
/* release lock while waiting in kernel */
|
|
|
|
lam_mutex_unlock(&lam_event_lock);
|
2004-02-12 18:55:09 +03:00
|
|
|
res = select(sop->event_fds + 1, sop->event_readset,
|
|
|
|
sop->event_writeset, NULL, tv);
|
2004-03-15 23:52:52 +03:00
|
|
|
lam_mutex_lock(&lam_event_lock);
|
2004-02-12 18:55:09 +03:00
|
|
|
|
|
|
|
if (lam_evsignal_recalc(&sop->evsigmask) == -1)
|
|
|
|
return (-1);
|
|
|
|
|
|
|
|
if (res == -1) {
|
|
|
|
if (errno != EINTR) {
|
|
|
|
log_error("select");
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
lam_evsignal_process();
|
|
|
|
return (0);
|
|
|
|
} else if (lam_evsignal_caught)
|
|
|
|
lam_evsignal_process();
|
|
|
|
|
|
|
|
LOG_DBG((LOG_MISC, 80, "%s: select reports %d", __func__, res));
|
|
|
|
|
|
|
|
maxfd = 0;
|
|
|
|
for (ev = TAILQ_FIRST(&lam_eventqueue); ev != NULL; ev = next) {
|
|
|
|
next = TAILQ_NEXT(ev, ev_next);
|
|
|
|
|
|
|
|
res = 0;
|
|
|
|
if (FD_ISSET(ev->ev_fd, sop->event_readset))
|
|
|
|
res |= LAM_EV_READ;
|
|
|
|
if (FD_ISSET(ev->ev_fd, sop->event_writeset))
|
|
|
|
res |= LAM_EV_WRITE;
|
|
|
|
res &= ev->ev_events;
|
|
|
|
|
|
|
|
if (res) {
|
|
|
|
if (!(ev->ev_events & LAM_EV_PERSIST))
|
2004-03-12 01:02:01 +03:00
|
|
|
lam_event_del_i(ev);
|
|
|
|
lam_event_active_i(ev, res, 1);
|
2004-02-12 18:55:09 +03:00
|
|
|
} else if (ev->ev_fd > maxfd)
|
|
|
|
maxfd = ev->ev_fd;
|
|
|
|
}
|
|
|
|
|
|
|
|
sop->event_fds = maxfd;
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
select_add(void *arg, struct lam_event *ev)
|
|
|
|
{
|
|
|
|
struct selectop *sop = arg;
|
|
|
|
|
|
|
|
if (ev->ev_events & LAM_EV_SIGNAL)
|
|
|
|
return (lam_evsignal_add(&sop->evsigmask, ev));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Keep track of the highest fd, so that we can calculate the size
|
|
|
|
* of the fd_sets for select(2)
|
|
|
|
*/
|
|
|
|
if (sop->event_fds < ev->ev_fd)
|
|
|
|
sop->event_fds = ev->ev_fd;
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Nothing to be done here.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static int
|
|
|
|
select_del(void *arg, struct lam_event *ev)
|
|
|
|
{
|
|
|
|
struct selectop *sop = arg;
|
|
|
|
|
|
|
|
if (!(ev->ev_events & LAM_EV_SIGNAL))
|
|
|
|
return (0);
|
|
|
|
|
|
|
|
return (lam_evsignal_del(&sop->evsigmask, ev));
|
|
|
|
}
|