Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libevent/poll.c	Lines:	135	151	89.4 %
Date:	2017-11-13	Branches:	67	84	79.8 %


/*	$OpenBSD: poll.c,v 1.22 2016/09/03 11:31:17 nayden Exp $	*/

/*
 * Copyright 2000-2003 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.
 */

#include <sys/types.h>
#include <sys/time.h>
#include <sys/queue.h>

#include <poll.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <errno.h>
#ifdef CHECK_INVARIANTS
#include <assert.h>
#endif

#include "event.h"
#include "event-internal.h"
#include "evsignal.h"
#include "log.h"

struct pollop {
	int event_count;		/* Highest number alloc */
	int nfds;                       /* Size of event_* */
	int fd_count;                   /* Size of idxplus1_by_fd */
	struct pollfd *event_set;
	struct event **event_r_back;
	struct event **event_w_back;
	int *idxplus1_by_fd; /* Index into event_set by fd; we add 1 so
			      * that 0 (which is easy to memset) can mean
			      * "no entry." */
};

static void *poll_init	(struct event_base *);
static int poll_add		(void *, struct event *);
static int poll_del		(void *, struct event *);
static int poll_dispatch	(struct event_base *, void *, struct timeval *);
static void poll_dealloc	(struct event_base *, void *);

const struct eventop pollops = {
	"poll",
	poll_init,
	poll_add,
	poll_del,
	poll_dispatch,
	poll_dealloc,
    0
};

static void *
poll_init(struct event_base *base)
{
	struct pollop *pollop;

	/* Disable poll when this environment variable is set */
	if (!issetugid() && getenv("EVENT_NOPOLL"))
		return (NULL);

	if (!(pollop = calloc(1, sizeof(struct pollop))))
		return (NULL);

	evsignal_init(base);

	return (pollop);
}

#ifdef CHECK_INVARIANTS
static void
poll_check_ok(struct pollop *pop)
{
	int i, idx;
	struct event *ev;

	for (i = 0; i < pop->fd_count; ++i) {
		idx = pop->idxplus1_by_fd[i]-1;
		if (idx < 0)
			continue;
		assert(pop->event_set[idx].fd == i);
		if (pop->event_set[idx].events & POLLIN) {
			ev = pop->event_r_back[idx];
			assert(ev);
			assert(ev->ev_events & EV_READ);
			assert(ev->ev_fd == i);
		}
		if (pop->event_set[idx].events & POLLOUT) {
			ev = pop->event_w_back[idx];
			assert(ev);
			assert(ev->ev_events & EV_WRITE);
			assert(ev->ev_fd == i);
		}
	}
	for (i = 0; i < pop->nfds; ++i) {
		struct pollfd *pfd = &pop->event_set[i];
		assert(pop->idxplus1_by_fd[pfd->fd] == i+1);
	}
}
#else
#define poll_check_ok(pop)
#endif

static int
poll_dispatch(struct event_base *base, void *arg, struct timeval *tv)
{
	int res, i, j, msec = -1, nfds;
	struct pollop *pop = arg;

	poll_check_ok(pop);

	if (tv != NULL)
		msec = tv->tv_sec * 1000 + (tv->tv_usec + 999) / 1000;

	nfds = pop->nfds;
	res = poll(pop->event_set, nfds, msec);

	if (res == -1) {
		if (errno != EINTR) {
			event_warn("poll");
			return (-1);
		}

		evsignal_process(base);
		return (0);
	} else if (base->sig.evsignal_caught) {
		evsignal_process(base);
	}

	event_debug(("%s: poll reports %d", __func__, res));

	if (res == 0 || nfds == 0)
		return (0);

	i = arc4random_uniform(nfds);
	for (j = 0; j < nfds; j++) {
		struct event *r_ev = NULL, *w_ev = NULL;
		int what;
		if (++i == nfds)
			i = 0;
		what = pop->event_set[i].revents;

		if (!what)
			continue;

		res = 0;

		/* If the file gets closed notify */
		if (what & (POLLHUP|POLLERR))
			what |= POLLIN|POLLOUT;
		if (what & POLLIN) {
			res |= EV_READ;
			r_ev = pop->event_r_back[i];
		}
		if (what & POLLOUT) {
			res |= EV_WRITE;
			w_ev = pop->event_w_back[i];
		}
		if (res == 0)
			continue;

		if (r_ev && (res & r_ev->ev_events)) {
			event_active(r_ev, res & r_ev->ev_events, 1);
		}
		if (w_ev && w_ev != r_ev && (res & w_ev->ev_events)) {
			event_active(w_ev, res & w_ev->ev_events, 1);
		}
	}

	return (0);
}

static int
poll_add(void *arg, struct event *ev)
{
	struct pollop *pop = arg;
	struct pollfd *pfd = NULL;
	int i;

	if (ev->ev_events & EV_SIGNAL)
		return (evsignal_add(ev));
	if (!(ev->ev_events & (EV_READ|EV_WRITE)))
		return (0);

	poll_check_ok(pop);
	if (pop->nfds + 1 >= pop->event_count) {
		struct pollfd *tmp_event_set;
		struct event **tmp_event_r_back;
		struct event **tmp_event_w_back;
		int tmp_event_count;

		if (pop->event_count < 32)
			tmp_event_count = 32;
		else
			tmp_event_count = pop->event_count * 2;

		/* We need more file descriptors */
		tmp_event_set = reallocarray(pop->event_set,
		    tmp_event_count, sizeof(struct pollfd));
		if (tmp_event_set == NULL) {
			event_warn("realloc");
			return (-1);
		}
		pop->event_set = tmp_event_set;

		tmp_event_r_back = reallocarray(pop->event_r_back,
		    tmp_event_count, sizeof(struct event *));
		if (tmp_event_r_back == NULL) {
			/* event_set overallocated; that's okay. */
			event_warn("realloc");
			return (-1);
		}
		pop->event_r_back = tmp_event_r_back;

		tmp_event_w_back = reallocarray(pop->event_w_back,
		    tmp_event_count, sizeof(struct event *));
		if (tmp_event_w_back == NULL) {
			/* event_set and event_r_back overallocated; that's
			 * okay. */
			event_warn("realloc");
			return (-1);
		}
		pop->event_w_back = tmp_event_w_back;

		pop->event_count = tmp_event_count;
	}
	if (ev->ev_fd >= pop->fd_count) {
		int *tmp_idxplus1_by_fd;
		int new_count;
		if (pop->fd_count < 32)
			new_count = 32;
		else
			new_count = pop->fd_count * 2;
		while (new_count <= ev->ev_fd)
			new_count *= 2;
		tmp_idxplus1_by_fd = reallocarray(pop->idxplus1_by_fd,
		    new_count, sizeof(int));
		if (tmp_idxplus1_by_fd == NULL) {
			event_warn("realloc");
			return (-1);
		}
		pop->idxplus1_by_fd = tmp_idxplus1_by_fd;
		memset(pop->idxplus1_by_fd + pop->fd_count,
		       0, sizeof(int)*(new_count - pop->fd_count));
		pop->fd_count = new_count;
	}

	i = pop->idxplus1_by_fd[ev->ev_fd] - 1;
	if (i >= 0) {
		pfd = &pop->event_set[i];
	} else {
		i = pop->nfds++;
		pfd = &pop->event_set[i];
		pfd->events = 0;
		pfd->fd = ev->ev_fd;
		pop->event_w_back[i] = pop->event_r_back[i] = NULL;
		pop->idxplus1_by_fd[ev->ev_fd] = i + 1;
	}

	pfd->revents = 0;
	if (ev->ev_events & EV_WRITE) {
		pfd->events |= POLLOUT;
		pop->event_w_back[i] = ev;
	}
	if (ev->ev_events & EV_READ) {
		pfd->events |= POLLIN;
		pop->event_r_back[i] = ev;
	}
	poll_check_ok(pop);

	return (0);
}

/*
 * Nothing to be done here.
 */

static int
poll_del(void *arg, struct event *ev)
{
	struct pollop *pop = arg;
	struct pollfd *pfd = NULL;
	int i;

	if (ev->ev_events & EV_SIGNAL)
		return (evsignal_del(ev));

	if (!(ev->ev_events & (EV_READ|EV_WRITE)))
		return (0);

	poll_check_ok(pop);
	i = pop->idxplus1_by_fd[ev->ev_fd] - 1;
	if (i < 0)
		return (-1);

	/* Do we still want to read or write? */
	pfd = &pop->event_set[i];
	if (ev->ev_events & EV_READ) {
		pfd->events &= ~POLLIN;
		pop->event_r_back[i] = NULL;
	}
	if (ev->ev_events & EV_WRITE) {
		pfd->events &= ~POLLOUT;
		pop->event_w_back[i] = NULL;
	}
	poll_check_ok(pop);
	if (pfd->events)
		/* Another event cares about that fd. */
		return (0);

	/* Okay, so we aren't interested in that fd anymore. */
	pop->idxplus1_by_fd[ev->ev_fd] = 0;

	--pop->nfds;
	if (i != pop->nfds) {
		/*
		 * Shift the last pollfd down into the now-unoccupied
		 * position.
		 */
		memcpy(&pop->event_set[i], &pop->event_set[pop->nfds],
		       sizeof(struct pollfd));
		pop->event_r_back[i] = pop->event_r_back[pop->nfds];
		pop->event_w_back[i] = pop->event_w_back[pop->nfds];
		pop->idxplus1_by_fd[pop->event_set[i].fd] = i + 1;
	}

	poll_check_ok(pop);
	return (0);
}

static void
poll_dealloc(struct event_base *base, void *arg)
{
	struct pollop *pop = arg;

	evsignal_dealloc(base);
	free(pop->event_set);
	free(pop->event_r_back);
	free(pop->event_w_back);
	free(pop->idxplus1_by_fd);

	memset(pop, 0, sizeof(struct pollop));
	free(pop);
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: poll.c,v 1.22 2016/09/03 11:31:17 nayden Exp $ */
2
3			/*
4			* Copyright 2000-2003 Niels Provos <provos@citi.umich.edu>
5			* All rights reserved.
6			*
7			* Redistribution and use in source and binary forms, with or without
8			* modification, are permitted provided that the following conditions
9			* are met:
10			* 1. Redistributions of source code must retain the above copyright
11			* notice, this list of conditions and the following disclaimer.
12			* 2. Redistributions in binary form must reproduce the above copyright
13			* notice, this list of conditions and the following disclaimer in the
14			* documentation and/or other materials provided with the distribution.
15			* 3. The name of the author may not be used to endorse or promote products
16			* derived from this software without specific prior written permission.
17			*
18			* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19			* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20			* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21			* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22			* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23			* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24			* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25			* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26			* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27			* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28			*/
29
30			#include <sys/types.h>
31			#include <sys/time.h>
32			#include <sys/queue.h>
33
34			#include <poll.h>
35			#include <signal.h>
36			#include <stdio.h>
37			#include <stdlib.h>
38			#include <string.h>
39			#include <unistd.h>
40			#include <errno.h>
41			#ifdef CHECK_INVARIANTS
42			#include <assert.h>
43			#endif
44
45			#include "event.h"
46			#include "event-internal.h"
47			#include "evsignal.h"
48			#include "log.h"
49
50			struct pollop {
51			int event_count; /* Highest number alloc */
52			int nfds; /* Size of event_* */
53			int fd_count; /* Size of idxplus1_by_fd */
54			struct pollfd *event_set;
55			struct event **event_r_back;
56			struct event **event_w_back;
57			int idxplus1_by_fd; / Index into event_set by fd; we add 1 so
58			* that 0 (which is easy to memset) can mean
59			* "no entry." */
60			};
61
62			static void poll_init (struct event_base );
63			static int poll_add (void , struct event );
64			static int poll_del (void , struct event );
65			static int poll_dispatch (struct event_base , void , struct timeval *);
66			static void poll_dealloc (struct event_base , void );
67
68			const struct eventop pollops = {
69			"poll",
70			poll_init,
71			poll_add,
72			poll_del,
73			poll_dispatch,
74			poll_dealloc,
75			0
76			};
77
78			static void *
79			poll_init(struct event_base *base)
80			{
81			struct pollop *pollop;
82
83			/* Disable poll when this environment variable is set */
84	✓✗✓✓	423	if (!issetugid() && getenv("EVENT_NOPOLL"))
85		69	return (NULL);
86
87	✗✓	72	if (!(pollop = calloc(1, sizeof(struct pollop))))
88			return (NULL);
89
90		72	evsignal_init(base);
91
92		72	return (pollop);
93		141	}
94
95			#ifdef CHECK_INVARIANTS
96			static void
97			poll_check_ok(struct pollop *pop)
98			{
99			int i, idx;
100			struct event *ev;
101
102			for (i = 0; i < pop->fd_count; ++i) {
103			idx = pop->idxplus1_by_fd[i]-1;
104			if (idx < 0)
105			continue;
106			assert(pop->event_set[idx].fd == i);
107			if (pop->event_set[idx].events & POLLIN) {
108			ev = pop->event_r_back[idx];
109			assert(ev);
110			assert(ev->ev_events & EV_READ);
111			assert(ev->ev_fd == i);
112			}
113			if (pop->event_set[idx].events & POLLOUT) {
114			ev = pop->event_w_back[idx];
115			assert(ev);
116			assert(ev->ev_events & EV_WRITE);
117			assert(ev->ev_fd == i);
118			}
119			}
120			for (i = 0; i < pop->nfds; ++i) {
121			struct pollfd *pfd = &pop->event_set[i];
122			assert(pop->idxplus1_by_fd[pfd->fd] == i+1);
123			}
124			}
125			#else
126			#define poll_check_ok(pop)
127			#endif
128
129			static int
130			poll_dispatch(struct event_base base, void arg, struct timeval *tv)
131			{
132			int res, i, j, msec = -1, nfds;
133		42330	struct pollop *pop = arg;
134
135			poll_check_ok(pop);
136
137	✓✓	21165	if (tv != NULL)
138		452	msec = tv->tv_sec * 1000 + (tv->tv_usec + 999) / 1000;
139
140		21165	nfds = pop->nfds;
141		21165	res = poll(pop->event_set, nfds, msec);
142
143	✓✓	21165	if (res == -1) {
144	✗✓	6	if (errno != EINTR) {
145			event_warn("poll");
146			return (-1);
147			}
148
149		6	evsignal_process(base);
150		6	return (0);
151	✓✓	21159	} else if (base->sig.evsignal_caught) {
152		27	evsignal_process(base);
153		27	}
154
155			event_debug(("%s: poll reports %d", __func__, res));
156
157	✓✓	21159	if (res == 0 \|\| nfds == 0)
158		419	return (0);
159
160		20740	i = arc4random_uniform(nfds);
161	✓✓	206934	for (j = 0; j < nfds; j++) {
162			struct event r_ev = NULL, w_ev = NULL;
163			int what;
164		82727	if (++i == nfds)
165			i = 0;
166		82727	what = pop->event_set[i].revents;
167
168	✓✓	82727	if (!what)
169		40596	continue;
170
171			res = 0;
172
173			/* If the file gets closed notify */
174	✓✓	42131	if (what & (POLLHUP\|POLLERR))
175		3	what \|= POLLIN\|POLLOUT;
176	✓✓	42131	if (what & POLLIN) {
177			res \|= EV_READ;
178		20027	r_ev = pop->event_r_back[i];
179		20027	}
180	✓✓	42131	if (what & POLLOUT) {
181		22302	res \|= EV_WRITE;
182		22302	w_ev = pop->event_w_back[i];
183		22302	}
184	✗✓	42131	if (res == 0)
185			continue;
186
187	✓✓✓✗	62155	if (r_ev && (res & r_ev->ev_events)) {
188		20024	event_active(r_ev, res & r_ev->ev_events, 1);
189		20024	}
190	✓✓✓✗ ✓✗	86735	if (w_ev && w_ev != r_ev && (res & w_ev->ev_events)) {
191		22302	event_active(w_ev, res & w_ev->ev_events, 1);
192		22302	}
193		42131	}
194
195		20740	return (0);
196		21165	}
197
198			static int
199			poll_add(void arg, struct event ev)
200			{
201		81706	struct pollop *pop = arg;
202			struct pollfd *pfd = NULL;
203			int i;
204
205	✓✓	40853	if (ev->ev_events & EV_SIGNAL)
206		42	return (evsignal_add(ev));
207	✗✓	40811	if (!(ev->ev_events & (EV_READ\|EV_WRITE)))
208			return (0);
209
210			poll_check_ok(pop);
211	✓✓	40811	if (pop->nfds + 1 >= pop->event_count) {
212			struct pollfd *tmp_event_set;
213			struct event **tmp_event_r_back;
214			struct event **tmp_event_w_back;
215			int tmp_event_count;
216
217	✓✓	69	if (pop->event_count < 32)
218		57	tmp_event_count = 32;
219			else
220		12	tmp_event_count = pop->event_count * 2;
221
222			/* We need more file descriptors */
223		138	tmp_event_set = reallocarray(pop->event_set,
224		69	tmp_event_count, sizeof(struct pollfd));
225	✗✓	69	if (tmp_event_set == NULL) {
226			event_warn("realloc");
227			return (-1);
228			}
229		69	pop->event_set = tmp_event_set;
230
231		69	tmp_event_r_back = reallocarray(pop->event_r_back,
232			tmp_event_count, sizeof(struct event *));
233	✗✓	69	if (tmp_event_r_back == NULL) {
234			/* event_set overallocated; that's okay. */
235			event_warn("realloc");
236			return (-1);
237			}
238		69	pop->event_r_back = tmp_event_r_back;
239
240		69	tmp_event_w_back = reallocarray(pop->event_w_back,
241			tmp_event_count, sizeof(struct event *));
242	✗✓	69	if (tmp_event_w_back == NULL) {
243			/* event_set and event_r_back overallocated; that's
244			* okay. */
245			event_warn("realloc");
246			return (-1);
247			}
248		69	pop->event_w_back = tmp_event_w_back;
249
250		69	pop->event_count = tmp_event_count;
251	✓✗	69	}
252	✓✓	40811	if (ev->ev_fd >= pop->fd_count) {
253			int *tmp_idxplus1_by_fd;
254			int new_count;
255	✓✓	69	if (pop->fd_count < 32)
256		57	new_count = 32;
257			else
258		12	new_count = pop->fd_count * 2;
259	✗✓	138	while (new_count <= ev->ev_fd)
260			new_count *= 2;
261		138	tmp_idxplus1_by_fd = reallocarray(pop->idxplus1_by_fd,
262		69	new_count, sizeof(int));
263	✗✓	69	if (tmp_idxplus1_by_fd == NULL) {
264			event_warn("realloc");
265			return (-1);
266			}
267		69	pop->idxplus1_by_fd = tmp_idxplus1_by_fd;
268		138	memset(pop->idxplus1_by_fd + pop->fd_count,
269		69	0, sizeof(int)*(new_count - pop->fd_count));
270		69	pop->fd_count = new_count;
271	✓✗	69	}
272
273		40811	i = pop->idxplus1_by_fd[ev->ev_fd] - 1;
274	✓✓	40811	if (i >= 0) {
275		399	pfd = &pop->event_set[i];
276		399	} else {
277		40412	i = pop->nfds++;
278		40412	pfd = &pop->event_set[i];
279		40412	pfd->events = 0;
280		40412	pfd->fd = ev->ev_fd;
281		40412	pop->event_w_back[i] = pop->event_r_back[i] = NULL;
282		40412	pop->idxplus1_by_fd[ev->ev_fd] = i + 1;
283			}
284
285		40811	pfd->revents = 0;
286	✓✓	40811	if (ev->ev_events & EV_WRITE) {
287		969	pfd->events \|= POLLOUT;
288		969	pop->event_w_back[i] = ev;
289		969	}
290	✓✓	40811	if (ev->ev_events & EV_READ) {
291		39842	pfd->events \|= POLLIN;
292		39842	pop->event_r_back[i] = ev;
293		39842	}
294			poll_check_ok(pop);
295
296		40811	return (0);
297		40853	}
298
299			/*
300			* Nothing to be done here.
301			*/
302
303			static int
304			poll_del(void arg, struct event ev)
305			{
306		81670	struct pollop *pop = arg;
307			struct pollfd *pfd = NULL;
308			int i;
309
310	✓✓	40835	if (ev->ev_events & EV_SIGNAL)
311		39	return (evsignal_del(ev));
312
313	✗✓	40796	if (!(ev->ev_events & (EV_READ\|EV_WRITE)))
314			return (0);
315
316			poll_check_ok(pop);
317		40796	i = pop->idxplus1_by_fd[ev->ev_fd] - 1;
318	✗✓	40796	if (i < 0)
319			return (-1);
320
321			/* Do we still want to read or write? */
322		40796	pfd = &pop->event_set[i];
323	✓✓	40796	if (ev->ev_events & EV_READ) {
324		39827	pfd->events &= ~POLLIN;
325		39827	pop->event_r_back[i] = NULL;
326		39827	}
327	✓✓	40796	if (ev->ev_events & EV_WRITE) {
328		969	pfd->events &= ~POLLOUT;
329		969	pop->event_w_back[i] = NULL;
330		969	}
331			poll_check_ok(pop);
332	✓✓	40796	if (pfd->events)
333			/* Another event cares about that fd. */
334		396	return (0);
335
336			/* Okay, so we aren't interested in that fd anymore. */
337		40400	pop->idxplus1_by_fd[ev->ev_fd] = 0;
338
339		40400	--pop->nfds;
340	✓✓	40400	if (i != pop->nfds) {
341			/*
342			* Shift the last pollfd down into the now-unoccupied
343			* position.
344			*/
345		1060	memcpy(&pop->event_set[i], &pop->event_set[pop->nfds],
346			sizeof(struct pollfd));
347		1060	pop->event_r_back[i] = pop->event_r_back[pop->nfds];
348		1060	pop->event_w_back[i] = pop->event_w_back[pop->nfds];
349		1060	pop->idxplus1_by_fd[pop->event_set[i].fd] = i + 1;
350		1060	}
351
352			poll_check_ok(pop);
353		40400	return (0);
354		40835	}
355
356			static void
357			poll_dealloc(struct event_base base, void arg)
358			{
359		96	struct pollop *pop = arg;
360
361		48	evsignal_dealloc(base);
362		48	free(pop->event_set);
363		48	free(pop->event_r_back);
364		48	free(pop->event_w_back);
365		48	free(pop->idxplus1_by_fd);
366
367		48	memset(pop, 0, sizeof(struct pollop));
368		48	free(pop);
369		48	}