trunk/src/s_bsd_poll.c

/*
 *  ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd)
 *
 *  Copyright (c) 2000-2014 ircd-hybrid development team
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program 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 General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307
 *  USA
 */

/*! \file s_bsd_poll.c
 * \brief POSIX poll() compatible network routines.
 * \version $Id$
 */

#include "stdinc.h"
#if USE_IOPOLL_MECHANISM == __IOPOLL_MECHANISM_POLL
#include <sys/poll.h>
#include "fdlist.h"
#include "list.h"
#include "memory.h"
#include "ircd.h"
#include "s_bsd.h"
#include "log.h"

/* I hate linux -- adrian */
#ifndef POLLRDNORM
#define POLLRDNORM POLLIN
#endif
#ifndef POLLWRNORM
#define POLLWRNORM POLLOUT
#endif

static struct pollfd *pollfds;
static int pollmax = -1;  /* highest FD number */


/*
 * init_netio
 *
 * This is a needed exported function which will be called to initialise
 * the network loop code.
 */
void
init_netio(void)
{
  int fd;

  pollfds = MyCalloc(sizeof(struct pollfd) * hard_fdlimit);

  for (fd = 0; fd < hard_fdlimit; fd++)
    pollfds[fd].fd = -1;
}

/*
 * find a spare slot in the fd list. We can optimise this out later!
 *   -- adrian
 */
static inline int
poll_findslot(void)
{
  int i;

  for (i = 0; i < hard_fdlimit; i++)
    if (pollfds[i].fd == -1)
    {
      /* MATCH!!#$*&$ */
      return i;
    }

  assert(1 == 0);
  /* NOTREACHED */
  return -1;
}

/*
 * comm_setselect
 *
 * This is a needed exported function which will be called to register
 * and deregister interest in a pending IO state for a given FD.
 */
void
comm_setselect(fde_t *F, unsigned int type, void (*handler)(fde_t *, void *),
               void *client_data, time_t timeout)
{
  int new_events;

  if ((type & COMM_SELECT_READ))
  {
    F->read_handler = handler;
    F->read_data = client_data;
  }

  if ((type & COMM_SELECT_WRITE))
  {
    F->write_handler = handler;
    F->write_data = client_data;
  }

  new_events = (F->read_handler ? POLLRDNORM : 0) |
               (F->write_handler ? POLLWRNORM : 0);

  if (timeout != 0)
  {
    F->timeout = CurrentTime + (timeout / 1000);
    F->timeout_handler = handler;
    F->timeout_data = client_data;
  }

  if (new_events != F->evcache)
  {
    if (new_events == 0)
    {
      pollfds[F->comm_index].fd = -1;
      pollfds[F->comm_index].revents = 0;

      if (pollmax == F->comm_index)
        while (pollmax >= 0 && pollfds[pollmax].fd == -1)
          pollmax--;
    }
    else
    {
      if (F->evcache == 0)
      {
        F->comm_index = poll_findslot();
        if (F->comm_index > pollmax)
          pollmax = F->comm_index;

        pollfds[F->comm_index].fd = F->fd;
      }

      pollfds[F->comm_index].events = new_events;
      pollfds[F->comm_index].revents = 0;
    }

    F->evcache = new_events;
  }
}

/*
 * comm_select
 *
 * Called to do the new-style IO, courtesy of of squid (like most of this
 * new IO code). This routine handles the stuff we've hidden in
 * comm_setselect and fd_table[] and calls callbacks for IO ready
 * events.
 */
void
comm_select(void)
{
  int num, ci, revents;
  void (*hdl)(fde_t *, void *);
  fde_t *F;

  /* XXX kill that +1 later ! -- adrian */
  num = poll(pollfds, pollmax + 1, SELECT_DELAY);

  set_time();

  if (num < 0)
  {
#ifdef HAVE_USLEEP
    usleep(50000);  /* avoid 99% CPU in comm_select */
#endif
    return;
  }

  for (ci = 0; ci <= pollmax && num > 0; ci++)
  {
    if ((revents = pollfds[ci].revents) == 0 || pollfds[ci].fd == -1)
      continue;
    num--;

    F = lookup_fd(pollfds[ci].fd);
    if (F == NULL || !F->flags.open)
      continue;

    if (revents & (POLLRDNORM | POLLIN | POLLHUP | POLLERR))
    {
      if ((hdl = F->read_handler) != NULL)
      {
        F->read_handler = NULL;
        hdl(F, F->read_data);
        if (!F->flags.open)
          continue;
      }
    }

    if (revents & (POLLWRNORM | POLLOUT | POLLHUP | POLLERR))
    {
      if ((hdl = F->write_handler) != NULL)
      {
        F->write_handler = NULL;
        hdl(F, F->write_data);
        if (!F->flags.open)
          continue;
      }
    }

    comm_setselect(F, 0, NULL, NULL, 0);
  }
}
#endif
Revision:	4461
Committed:	Wed Aug 13 17:05:26 2014 UTC (11 years ago) by michael
Content type:	text/x-csrc
File size:	4742 byte(s)
Log Message:	- Removed stupid PF typedef in fdlist.h which prevented both gcc and clang from spitting out a warning about the first argument of s_bsd:ssl_handshake() being an 'int' when it really has to be a 'fde_t' pointer. - Fixed first argument of s_bsd:ssl_handshake() which should be a 'fde_t' pointer instead of an 'int'.
#	User	Rev	Content
1	adx	30	/*
2	michael	2916	* ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd)
3	adx	30	*
4	michael	2916	* Copyright (c) 2000-2014 ircd-hybrid development team
5	adx	30	*
6			* This program is free software; you can redistribute it and/or modify
7			* it under the terms of the GNU General Public License as published by
8			* the Free Software Foundation; either version 2 of the License, or
9			* (at your option) any later version.
10			*
11			* This program is distributed in the hope that it will be useful,
12			* but WITHOUT ANY WARRANTY; without even the implied warranty of
13			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14			* GNU General Public License for more details.
15			*
16			* You should have received a copy of the GNU General Public License
17			* along with this program; if not, write to the Free Software
18			* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
19			* USA
20			*/
21
22	michael	2916	/*! \file s_bsd_poll.c
23			* \brief POSIX poll() compatible network routines.
24			* \version $Id$
25			*/
26
27	adx	30	#include "stdinc.h"
28	stu	908	#if USE_IOPOLL_MECHANISM == __IOPOLL_MECHANISM_POLL
29	adx	30	#include <sys/poll.h>
30			#include "fdlist.h"
31	michael	1021	#include "list.h"
32	michael	2627	#include "memory.h"
33	adx	30	#include "ircd.h"
34			#include "s_bsd.h"
35	michael	1309	#include "log.h"
36	adx	30
37			/* I hate linux -- adrian */
38			#ifndef POLLRDNORM
39			#define POLLRDNORM POLLIN
40			#endif
41			#ifndef POLLWRNORM
42			#define POLLWRNORM POLLOUT
43			#endif
44
45			static struct pollfd *pollfds;
46			static int pollmax = -1; /* highest FD number */
47
48
49			/*
50			* init_netio
51			*
52			* This is a needed exported function which will be called to initialise
53			* the network loop code.
54			*/
55			void
56			init_netio(void)
57			{
58			int fd;
59
60	michael	3504	pollfds = MyCalloc(sizeof(struct pollfd) * hard_fdlimit);
61	adx	30
62			for (fd = 0; fd < hard_fdlimit; fd++)
63			pollfds[fd].fd = -1;
64			}
65
66			/*
67			* find a spare slot in the fd list. We can optimise this out later!
68			* -- adrian
69			*/
70			static inline int
71			poll_findslot(void)
72			{
73			int i;
74
75			for (i = 0; i < hard_fdlimit; i++)
76			if (pollfds[i].fd == -1)
77			{
78			/* MATCH!!#$&$ /
79			return i;
80			}
81
82			assert(1 == 0);
83			/* NOTREACHED */
84			return -1;
85			}
86
87			/*
88			* comm_setselect
89			*
90			* This is a needed exported function which will be called to register
91			* and deregister interest in a pending IO state for a given FD.
92			*/
93			void
94	michael	4461	comm_setselect(fde_t F, unsigned int type, void (handler)(fde_t , void ),
95	adx	30	void *client_data, time_t timeout)
96	michael	2916	{
97	adx	30	int new_events;
98
99			if ((type & COMM_SELECT_READ))
100			{
101			F->read_handler = handler;
102			F->read_data = client_data;
103			}
104
105			if ((type & COMM_SELECT_WRITE))
106			{
107			F->write_handler = handler;
108			F->write_data = client_data;
109			}
110
111			new_events = (F->read_handler ? POLLRDNORM : 0) \|
112	michael	2650	(F->write_handler ? POLLWRNORM : 0);
113	adx	30
114			if (timeout != 0)
115	michael	2725	{
116	adx	30	F->timeout = CurrentTime + (timeout / 1000);
117	michael	2725	F->timeout_handler = handler;
118			F->timeout_data = client_data;
119			}
120	adx	30
121			if (new_events != F->evcache)
122			{
123			if (new_events == 0)
124			{
125			pollfds[F->comm_index].fd = -1;
126			pollfds[F->comm_index].revents = 0;
127
128			if (pollmax == F->comm_index)
129			while (pollmax >= 0 && pollfds[pollmax].fd == -1)
130	michael	2650	pollmax--;
131	adx	30	}
132			else
133			{
134			if (F->evcache == 0)
135			{
136			F->comm_index = poll_findslot();
137	michael	2650	if (F->comm_index > pollmax)
138			pollmax = F->comm_index;
139	adx	30
140	michael	2650	pollfds[F->comm_index].fd = F->fd;
141	adx	30	}
142	michael	2650
143	adx	30	pollfds[F->comm_index].events = new_events;
144			pollfds[F->comm_index].revents = 0;
145			}
146
147			F->evcache = new_events;
148			}
149			}
150	michael	2916
151	adx	30	/*
152			* comm_select
153			*
154			* Called to do the new-style IO, courtesy of of squid (like most of this
155			* new IO code). This routine handles the stuff we've hidden in
156			* comm_setselect and fd_table[] and calls callbacks for IO ready
157			* events.
158			*/
159			void
160			comm_select(void)
161			{
162			int num, ci, revents;
163	michael	4461	void (hdl)(fde_t , void *);
164	adx	30	fde_t *F;
165
166			/* XXX kill that +1 later ! -- adrian */
167			num = poll(pollfds, pollmax + 1, SELECT_DELAY);
168
169			set_time();
170
171			if (num < 0)
172			{
173			#ifdef HAVE_USLEEP
174			usleep(50000); /* avoid 99% CPU in comm_select */
175			#endif
176			return;
177			}
178
179			for (ci = 0; ci <= pollmax && num > 0; ci++)
180			{
181			if ((revents = pollfds[ci].revents) == 0 \|\| pollfds[ci].fd == -1)
182			continue;
183			num--;
184
185			F = lookup_fd(pollfds[ci].fd);
186			if (F == NULL \|\| !F->flags.open)
187			continue;
188
189			if (revents & (POLLRDNORM \| POLLIN \| POLLHUP \| POLLERR))
190	michael	2650	{
191	adx	30	if ((hdl = F->read_handler) != NULL)
192			{
193			F->read_handler = NULL;
194			hdl(F, F->read_data);
195	michael	2650	if (!F->flags.open)
196			continue;
197	adx	30	}
198	michael	2650	}
199	adx	30
200			if (revents & (POLLWRNORM \| POLLOUT \| POLLHUP \| POLLERR))
201	michael	2650	{
202	adx	30	if ((hdl = F->write_handler) != NULL)
203			{
204			F->write_handler = NULL;
205			hdl(F, F->write_data);
206	michael	2650	if (!F->flags.open)
207			continue;
208	adx	30	}
209	michael	2650	}
210	adx	30
211			comm_setselect(F, 0, NULL, NULL, 0);
212			}
213			}
214	stu	908	#endif