Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libevent/kqueue.c	Lines:	155	183	84.7 %
Date:	2017-11-07	Branches:	75	103	72.8 %


/*	$OpenBSD: kqueue.c,v 1.40 2017/07/10 21:37:26 tedu 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.
 */

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

#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <errno.h>
#include <assert.h>
#include <inttypes.h>

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

#define EVLIST_X_KQINKERNEL	0x1000

#define NEVENT		64

struct kqop {
	struct kevent *changes;
	int nchanges;
	struct kevent *events;
	struct event_list evsigevents[NSIG];
	int nevents;
	int kq;
	pid_t pid;
};

static void *kq_init	(struct event_base *);
static int kq_add	(void *, struct event *);
static int kq_del	(void *, struct event *);
static int kq_dispatch	(struct event_base *, void *, struct timeval *);
static int kq_insert	(struct kqop *, struct kevent *);
static void kq_dealloc (struct event_base *, void *);

const struct eventop kqops = {
	"kqueue",
	kq_init,
	kq_add,
	kq_del,
	kq_dispatch,
	kq_dealloc,
	1 /* need reinit */
};

static void *
kq_init(struct event_base *base)
{
	int i, kq;
	struct kqop *kqueueop;

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

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

	/* Initalize the kernel queue */

	if ((kq = kqueue()) == -1) {
		event_warn("kqueue");
		free (kqueueop);
		return (NULL);
	}

	kqueueop->kq = kq;

	kqueueop->pid = getpid();

	/* Initalize fields */
	kqueueop->changes = calloc(NEVENT, sizeof(struct kevent));
	if (kqueueop->changes == NULL) {
		free (kqueueop);
		return (NULL);
	}
	kqueueop->events = calloc(NEVENT, sizeof(struct kevent));
	if (kqueueop->events == NULL) {
		free (kqueueop->changes);
		free (kqueueop);
		return (NULL);
	}
	kqueueop->nevents = NEVENT;

	/* we need to keep track of multiple events per signal */
	for (i = 0; i < NSIG; ++i) {
		TAILQ_INIT(&kqueueop->evsigevents[i]);
	}

	return (kqueueop);
}

static int
kq_insert(struct kqop *kqop, struct kevent *kev)
{
	int nevents = kqop->nevents;

	if (kqop->nchanges == nevents) {
		struct kevent *newchange;
		struct kevent *newresult;

		nevents *= 2;

		newchange = reallocarray(kqop->changes,
		    nevents, sizeof(struct kevent));
		if (newchange == NULL) {
			event_warn("%s: malloc", __func__);
			return (-1);
		}
		kqop->changes = newchange;

		newresult = reallocarray(kqop->events,
		    nevents, sizeof(struct kevent));

		/*
		 * If we fail, we don't have to worry about freeing,
		 * the next realloc will pick it up.
		 */
		if (newresult == NULL) {
			event_warn("%s: malloc", __func__);
			return (-1);
		}
		kqop->events = newresult;

		kqop->nevents = nevents;
	}

	memcpy(&kqop->changes[kqop->nchanges++], kev, sizeof(struct kevent));

	event_debug(("%s: fd %d %s%s",
		__func__, (int)kev->ident,
		kev->filter == EVFILT_READ ? "EVFILT_READ" : "EVFILT_WRITE",
		kev->flags == EV_DELETE ? " (del)" : ""));

	return (0);
}

static void
kq_sighandler(int sig)
{
	/* Do nothing here */
}

static int
kq_dispatch(struct event_base *base, void *arg, struct timeval *tv)
{
	struct kqop *kqop = arg;
	struct kevent *changes = kqop->changes;
	struct kevent *events = kqop->events;
	struct event *ev;
	struct timespec ts, *ts_p = NULL;
	int i, res;

	if (tv != NULL) {
		TIMEVAL_TO_TIMESPEC(tv, &ts);
		ts_p = &ts;
	}

	res = kevent(kqop->kq, kqop->nchanges ? changes : NULL, kqop->nchanges,
	    events, kqop->nevents, ts_p);
	kqop->nchanges = 0;
	if (res == -1) {
		if (errno != EINTR) {
			event_warn("kevent");
			return (-1);
		}

		return (0);
	}

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

	for (i = 0; i < res; i++) {
		int which = 0;

		if (events[i].flags & EV_ERROR) {
			switch (events[i].data) {

			/* Can occur on delete if we are not currently
			 * watching any events on this fd.  That can
			 * happen when the fd was closed and another
			 * file was opened with that fd. */
			case ENOENT:
			/* Can occur for reasons not fully understood
			 * on FreeBSD. */
			case EINVAL:
				continue;
			/* Can occur on a delete if the fd is closed.  Can
			 * occur on an add if the fd was one side of a pipe,
			 * and the other side was closed. */
			case EBADF:
				continue;
			/* These two can occur on an add if the fd was one side
			 * of a pipe, and the other side was closed. */
			case EPERM:
			case EPIPE:
				/* Report read events, if we're listening for
				 * them, so that the user can learn about any
				 * add errors.  (If the operation was a
				 * delete, then udata should be cleared.) */
				if (events[i].udata) {
					/* The operation was an add:
					 * report the error as a read. */
					which |= EV_READ;
					break;
				} else {
					/* The operation was a del:
					 * report nothing. */
					continue;
				}

			/* Other errors shouldn't occur. */
			default:
				errno = events[i].data;
				return (-1);
			}
		} else if (events[i].filter == EVFILT_READ) {
			which |= EV_READ;
		} else if (events[i].filter == EVFILT_WRITE) {
			which |= EV_WRITE;
		} else if (events[i].filter == EVFILT_SIGNAL) {
			which |= EV_SIGNAL;
		}

		if (!which)
			continue;

		if (events[i].filter == EVFILT_SIGNAL) {
			struct event_list *head =
			    (struct event_list *)events[i].udata;
			TAILQ_FOREACH(ev, head, ev_signal_next) {
				event_active(ev, which, events[i].data);
			}
		} else {
			ev = (struct event *)events[i].udata;

			if (!(ev->ev_events & EV_PERSIST))
				ev->ev_flags &= ~EVLIST_X_KQINKERNEL;

			event_active(ev, which, 1);
		}
	}

	return (0);
}


static int
kq_add(void *arg, struct event *ev)
{
	struct kqop *kqop = arg;
	struct kevent kev;

	if (ev->ev_events & EV_SIGNAL) {
		int nsignal = EVENT_SIGNAL(ev);

		assert(nsignal >= 0 && nsignal < NSIG);
		if (TAILQ_EMPTY(&kqop->evsigevents[nsignal])) {
			struct timespec timeout = { 0, 0 };

			memset(&kev, 0, sizeof(kev));
			kev.ident = nsignal;
			kev.filter = EVFILT_SIGNAL;
			kev.flags = EV_ADD;
			kev.udata = &kqop->evsigevents[nsignal];

			/* Be ready for the signal if it is sent any
			 * time between now and the next call to
			 * kq_dispatch. */
			if (kevent(kqop->kq, &kev, 1, NULL, 0, &timeout) == -1)
				return (-1);

			if (_evsignal_set_handler(ev->ev_base, nsignal,
				kq_sighandler) == -1)
				return (-1);
		}

		TAILQ_INSERT_TAIL(&kqop->evsigevents[nsignal], ev,
		    ev_signal_next);
		ev->ev_flags |= EVLIST_X_KQINKERNEL;
		return (0);
	}

	if (ev->ev_events & EV_READ) {
		memset(&kev, 0, sizeof(kev));
		kev.ident = ev->ev_fd;
		kev.filter = EVFILT_READ;
		/* Make it behave like select() and poll() */
		kev.fflags = NOTE_EOF;
		kev.flags = EV_ADD;
		if (!(ev->ev_events & EV_PERSIST))
			kev.flags |= EV_ONESHOT;
		kev.udata = ev;

		if (kq_insert(kqop, &kev) == -1)
			return (-1);

		ev->ev_flags |= EVLIST_X_KQINKERNEL;
	}

	if (ev->ev_events & EV_WRITE) {
		memset(&kev, 0, sizeof(kev));
		kev.ident = ev->ev_fd;
		kev.filter = EVFILT_WRITE;
		kev.flags = EV_ADD;
		if (!(ev->ev_events & EV_PERSIST))
			kev.flags |= EV_ONESHOT;
		kev.udata = ev;

		if (kq_insert(kqop, &kev) == -1)
			return (-1);

		ev->ev_flags |= EVLIST_X_KQINKERNEL;
	}

	return (0);
}

static int
kq_del(void *arg, struct event *ev)
{
	struct kqop *kqop = arg;
	struct kevent kev;

	if (!(ev->ev_flags & EVLIST_X_KQINKERNEL))
		return (0);

	if (ev->ev_events & EV_SIGNAL) {
		int nsignal = EVENT_SIGNAL(ev);
		struct timespec timeout = { 0, 0 };

		assert(nsignal >= 0 && nsignal < NSIG);
		TAILQ_REMOVE(&kqop->evsigevents[nsignal], ev, ev_signal_next);
		if (TAILQ_EMPTY(&kqop->evsigevents[nsignal])) {
			memset(&kev, 0, sizeof(kev));
			kev.ident = nsignal;
			kev.filter = EVFILT_SIGNAL;
			kev.flags = EV_DELETE;

			/* Because we insert signal events
			 * immediately, we need to delete them
			 * immediately, too */
			if (kevent(kqop->kq, &kev, 1, NULL, 0, &timeout) == -1)
				return (-1);

			if (_evsignal_restore_handler(ev->ev_base,
				nsignal) == -1)
				return (-1);
		}

		ev->ev_flags &= ~EVLIST_X_KQINKERNEL;
		return (0);
	}

	if (ev->ev_events & EV_READ) {
		memset(&kev, 0, sizeof(kev));
		kev.ident = ev->ev_fd;
		kev.filter = EVFILT_READ;
		kev.flags = EV_DELETE;

		if (kq_insert(kqop, &kev) == -1)
			return (-1);

		ev->ev_flags &= ~EVLIST_X_KQINKERNEL;
	}

	if (ev->ev_events & EV_WRITE) {
		memset(&kev, 0, sizeof(kev));
		kev.ident = ev->ev_fd;
		kev.filter = EVFILT_WRITE;
		kev.flags = EV_DELETE;

		if (kq_insert(kqop, &kev) == -1)
			return (-1);

		ev->ev_flags &= ~EVLIST_X_KQINKERNEL;
	}

	return (0);
}

static void
kq_dealloc(struct event_base *base, void *arg)
{
	struct kqop *kqop = arg;

	evsignal_dealloc(base);

	free(kqop->changes);
	free(kqop->events);
	if (kqop->kq >= 0 && kqop->pid == getpid())
		close(kqop->kq);

	memset(kqop, 0, sizeof(struct kqop));
	free(kqop);
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: kqueue.c,v 1.40 2017/07/10 21:37:26 tedu Exp $ */
2
3			/*
4			* Copyright 2000-2002 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			#include <sys/event.h>
34
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			#include <assert.h>
42			#include <inttypes.h>
43
44			#include "event.h"
45			#include "event-internal.h"
46			#include "log.h"
47			#include "evsignal.h"
48
49			#define EVLIST_X_KQINKERNEL 0x1000
50
51			#define NEVENT 64
52
53			struct kqop {
54			struct kevent *changes;
55			int nchanges;
56			struct kevent *events;
57			struct event_list evsigevents[NSIG];
58			int nevents;
59			int kq;
60			pid_t pid;
61			};
62
63			static void kq_init (struct event_base );
64			static int kq_add (void , struct event );
65			static int kq_del (void , struct event );
66			static int kq_dispatch (struct event_base , void , struct timeval *);
67			static int kq_insert (struct kqop , struct kevent );
68			static void kq_dealloc (struct event_base , void );
69
70			const struct eventop kqops = {
71			"kqueue",
72			kq_init,
73			kq_add,
74			kq_del,
75			kq_dispatch,
76			kq_dealloc,
77			1 /* need reinit */
78			};
79
80			static void *
81			kq_init(struct event_base *base)
82			{
83			int i, kq;
84			struct kqop *kqueueop;
85
86			/* Disable kqueue when this environment variable is set */
87	✓✗✓✓	2172	if (!issetugid() && getenv("EVENT_NOKQUEUE"))
88		258	return (NULL);
89
90	✗✓	466	if (!(kqueueop = calloc(1, sizeof(struct kqop))))
91			return (NULL);
92
93			/* Initalize the kernel queue */
94
95	✗✓	466	if ((kq = kqueue()) == -1) {
96			event_warn("kqueue");
97			free (kqueueop);
98			return (NULL);
99			}
100
101		466	kqueueop->kq = kq;
102
103		466	kqueueop->pid = getpid();
104
105			/* Initalize fields */
106		466	kqueueop->changes = calloc(NEVENT, sizeof(struct kevent));
107	✗✓	466	if (kqueueop->changes == NULL) {
108			free (kqueueop);
109			return (NULL);
110			}
111		466	kqueueop->events = calloc(NEVENT, sizeof(struct kevent));
112	✗✓	466	if (kqueueop->events == NULL) {
113			free (kqueueop->changes);
114			free (kqueueop);
115			return (NULL);
116			}
117		466	kqueueop->nevents = NEVENT;
118
119			/* we need to keep track of multiple events per signal */
120	✓✓	31688	for (i = 0; i < NSIG; ++i) {
121		15378	TAILQ_INIT(&kqueueop->evsigevents[i]);
122			}
123
124		466	return (kqueueop);
125		724	}
126
127			static int
128			kq_insert(struct kqop kqop, struct kevent kev)
129			{
130		330972	int nevents = kqop->nevents;
131
132	✓✓	165486	if (kqop->nchanges == nevents) {
133			struct kevent *newchange;
134			struct kevent *newresult;
135
136		308	nevents *= 2;
137
138		616	newchange = reallocarray(kqop->changes,
139		308	nevents, sizeof(struct kevent));
140	✗✓	308	if (newchange == NULL) {
141			event_warn("%s: malloc", __func__);
142			return (-1);
143			}
144		308	kqop->changes = newchange;
145
146		308	newresult = reallocarray(kqop->events,
147			nevents, sizeof(struct kevent));
148
149			/*
150			* If we fail, we don't have to worry about freeing,
151			* the next realloc will pick it up.
152			*/
153	✗✓	308	if (newresult == NULL) {
154			event_warn("%s: malloc", __func__);
155			return (-1);
156			}
157		308	kqop->events = newresult;
158
159		308	kqop->nevents = nevents;
160	✓✗	308	}
161
162		165486	memcpy(&kqop->changes[kqop->nchanges++], kev, sizeof(struct kevent));
163
164			event_debug(("%s: fd %d %s%s",
165			__func__, (int)kev->ident,
166			kev->filter == EVFILT_READ ? "EVFILT_READ" : "EVFILT_WRITE",
167			kev->flags == EV_DELETE ? " (del)" : ""));
168
169		165486	return (0);
170		165486	}
171
172			static void
173			kq_sighandler(int sig)
174			{
175			/* Do nothing here */
176		784	}
177
178			static int
179			kq_dispatch(struct event_base base, void arg, struct timeval *tv)
180			{
181		89432	struct kqop *kqop = arg;
182		44716	struct kevent *changes = kqop->changes;
183		44716	struct kevent *events = kqop->events;
184			struct event *ev;
185		44716	struct timespec ts, *ts_p = NULL;
186			int i, res;
187
188	✓✓	44716	if (tv != NULL) {
189		2256	TIMEVAL_TO_TIMESPEC(tv, &ts);
190			ts_p = &ts;
191		2256	}
192
193		89432	res = kevent(kqop->kq, kqop->nchanges ? changes : NULL, kqop->nchanges,
194		44716	events, kqop->nevents, ts_p);
195		44716	kqop->nchanges = 0;
196	✓✓	44716	if (res == -1) {
197	✗✓	338	if (errno != EINTR) {
198			event_warn("kevent");
199			return (-1);
200			}
201
202		338	return (0);
203			}
204
205			event_debug(("%s: kevent reports %d", __func__, res));
206
207	✓✓	271864	for (i = 0; i < res; i++) {
208			int which = 0;
209
210	✓✓	91554	if (events[i].flags & EV_ERROR) {
211	✗✓✓✗ ✗✗	1446	switch (events[i].data) {
212
213			/* Can occur on delete if we are not currently
214			* watching any events on this fd. That can
215			* happen when the fd was closed and another
216			* file was opened with that fd. */
217			case ENOENT:
218			/* Can occur for reasons not fully understood
219			* on FreeBSD. */
220			case EINVAL:
221		6	continue;
222			/* Can occur on a delete if the fd is closed. Can
223			* occur on an add if the fd was one side of a pipe,
224			* and the other side was closed. */
225			case EBADF:
226		1440	continue;
227			/* These two can occur on an add if the fd was one side
228			* of a pipe, and the other side was closed. */
229			case EPERM:
230			case EPIPE:
231			/* Report read events, if we're listening for
232			* them, so that the user can learn about any
233			* add errors. (If the operation was a
234			* delete, then udata should be cleared.) */
235			if (events[i].udata) {
236			/* The operation was an add:
237			* report the error as a read. */
238			which \|= EV_READ;
239			break;
240			} else {
241			/* The operation was a del:
242			* report nothing. */
243			continue;
244			}
245
246			/* Other errors shouldn't occur. */
247			default:
248			errno = events[i].data;
249			return (-1);
250			}
251	✓✓	90108	} else if (events[i].filter == EVFILT_READ) {
252			which \|= EV_READ;
253	✓✓	90108	} else if (events[i].filter == EVFILT_WRITE) {
254			which \|= EV_WRITE;
255	✓✗	48912	} else if (events[i].filter == EVFILT_SIGNAL) {
256			which \|= EV_SIGNAL;
257		392	}
258
259	✗✓	90108	if (!which)
260			continue;
261
262	✓✓	90108	if (events[i].filter == EVFILT_SIGNAL) {
263			struct event_list *head =
264		392	(struct event_list *)events[i].udata;
265	✓✓	1580	TAILQ_FOREACH(ev, head, ev_signal_next) {
266		398	event_active(ev, which, events[i].data);
267			}
268		392	} else {
269		89716	ev = (struct event *)events[i].udata;
270
271	✓✓	89716	if (!(ev->ev_events & EV_PERSIST))
272		44770	ev->ev_flags &= ~EVLIST_X_KQINKERNEL;
273
274		89716	event_active(ev, which, 1);
275			}
276	✗✓✓	90108	}
277
278		44378	return (0);
279		44716	}
280
281
282			static int
283			kq_add(void arg, struct event ev)
284			{
285		199512	struct kqop *kqop = arg;
286		99756	struct kevent kev;
287
288	✓✓	99756	if (ev->ev_events & EV_SIGNAL) {
289		1700	int nsignal = EVENT_SIGNAL(ev);
290
291			assert(nsignal >= 0 && nsignal < NSIG);
292	✓✓	1700	if (TAILQ_EMPTY(&kqop->evsigevents[nsignal])) {
293		1694	struct timespec timeout = { 0, 0 };
294
295		1694	memset(&kev, 0, sizeof(kev));
296		1694	kev.ident = nsignal;
297		1694	kev.filter = EVFILT_SIGNAL;
298		1694	kev.flags = EV_ADD;
299		1694	kev.udata = &kqop->evsigevents[nsignal];
300
301			/* Be ready for the signal if it is sent any
302			* time between now and the next call to
303			* kq_dispatch. */
304	✗✓	1694	if (kevent(kqop->kq, &kev, 1, NULL, 0, &timeout) == -1)
305			return (-1);
306
307	✗✓	3388	if (_evsignal_set_handler(ev->ev_base, nsignal,
308		1694	kq_sighandler) == -1)
309			return (-1);
310	✓✗	3388	}
311
312		1700	TAILQ_INSERT_TAIL(&kqop->evsigevents[nsignal], ev,
313			ev_signal_next);
314		1700	ev->ev_flags \|= EVLIST_X_KQINKERNEL;
315		1700	return (0);
316			}
317
318	✓✓	98056	if (ev->ev_events & EV_READ) {
319		96108	memset(&kev, 0, sizeof(kev));
320		96108	kev.ident = ev->ev_fd;
321		96108	kev.filter = EVFILT_READ;
322			/* Make it behave like select() and poll() */
323		96108	kev.fflags = NOTE_EOF;
324		96108	kev.flags = EV_ADD;
325	✓✓	96108	if (!(ev->ev_events & EV_PERSIST))
326		95370	kev.flags \|= EV_ONESHOT;
327		96108	kev.udata = ev;
328
329	✗✓	96108	if (kq_insert(kqop, &kev) == -1)
330			return (-1);
331
332		96108	ev->ev_flags \|= EVLIST_X_KQINKERNEL;
333		96108	}
334
335	✓✓	98056	if (ev->ev_events & EV_WRITE) {
336		10266	memset(&kev, 0, sizeof(kev));
337		10266	kev.ident = ev->ev_fd;
338		10266	kev.filter = EVFILT_WRITE;
339		10266	kev.flags = EV_ADD;
340	✓✓	10266	if (!(ev->ev_events & EV_PERSIST))
341		9528	kev.flags \|= EV_ONESHOT;
342		10266	kev.udata = ev;
343
344	✗✓	10266	if (kq_insert(kqop, &kev) == -1)
345			return (-1);
346
347		10266	ev->ev_flags \|= EVLIST_X_KQINKERNEL;
348		10266	}
349
350		98056	return (0);
351		99756	}
352
353			static int
354			kq_del(void arg, struct event ev)
355			{
356		196216	struct kqop *kqop = arg;
357		98108	struct kevent kev;
358
359	✓✓	98108	if (!(ev->ev_flags & EVLIST_X_KQINKERNEL))
360		44770	return (0);
361
362	✓✓	53338	if (ev->ev_events & EV_SIGNAL) {
363		78	int nsignal = EVENT_SIGNAL(ev);
364		78	struct timespec timeout = { 0, 0 };
365
366			assert(nsignal >= 0 && nsignal < NSIG);
367	✓✓	234	TAILQ_REMOVE(&kqop->evsigevents[nsignal], ev, ev_signal_next);
368	✓✓	78	if (TAILQ_EMPTY(&kqop->evsigevents[nsignal])) {
369		72	memset(&kev, 0, sizeof(kev));
370		72	kev.ident = nsignal;
371		72	kev.filter = EVFILT_SIGNAL;
372		72	kev.flags = EV_DELETE;
373
374			/* Because we insert signal events
375			* immediately, we need to delete them
376			* immediately, too */
377	✗✓	72	if (kevent(kqop->kq, &kev, 1, NULL, 0, &timeout) == -1)
378			return (-1);
379
380	✗✓	144	if (_evsignal_restore_handler(ev->ev_base,
381		72	nsignal) == -1)
382			return (-1);
383			}
384
385		78	ev->ev_flags &= ~EVLIST_X_KQINKERNEL;
386		78	return (0);
387		78	}
388
389	✓✓	53260	if (ev->ev_events & EV_READ) {
390		52522	memset(&kev, 0, sizeof(kev));
391		52522	kev.ident = ev->ev_fd;
392		52522	kev.filter = EVFILT_READ;
393		52522	kev.flags = EV_DELETE;
394
395	✗✓	52522	if (kq_insert(kqop, &kev) == -1)
396			return (-1);
397
398		52522	ev->ev_flags &= ~EVLIST_X_KQINKERNEL;
399		52522	}
400
401	✓✓	53260	if (ev->ev_events & EV_WRITE) {
402		6590	memset(&kev, 0, sizeof(kev));
403		6590	kev.ident = ev->ev_fd;
404		6590	kev.filter = EVFILT_WRITE;
405		6590	kev.flags = EV_DELETE;
406
407	✗✓	6590	if (kq_insert(kqop, &kev) == -1)
408			return (-1);
409
410		6590	ev->ev_flags &= ~EVLIST_X_KQINKERNEL;
411		6590	}
412
413		53260	return (0);
414		98108	}
415
416			static void
417			kq_dealloc(struct event_base base, void arg)
418			{
419		192	struct kqop *kqop = arg;
420
421		96	evsignal_dealloc(base);
422
423		96	free(kqop->changes);
424		96	free(kqop->events);
425	✓✗✓✓	192	if (kqop->kq >= 0 && kqop->pid == getpid())
426		90	close(kqop->kq);
427
428		96	memset(kqop, 0, sizeof(struct kqop));
429		96	free(kqop);
430		96	}