1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
/*
* 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 = MyMalloc(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, PF *handler,
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;
PF *hdl;
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
|
