1*67ecd4f3SMax Laier /* $OpenBSD: kqueue.c,v 1.5 2002/07/10 14:41:31 art Exp $ */
2*67ecd4f3SMax Laier
3*67ecd4f3SMax Laier /*
4*67ecd4f3SMax Laier * Copyright 2000-2002 Niels Provos <provos@citi.umich.edu>
5*67ecd4f3SMax Laier * All rights reserved.
6*67ecd4f3SMax Laier *
7*67ecd4f3SMax Laier * Redistribution and use in source and binary forms, with or without
8*67ecd4f3SMax Laier * modification, are permitted provided that the following conditions
9*67ecd4f3SMax Laier * are met:
10*67ecd4f3SMax Laier * 1. Redistributions of source code must retain the above copyright
11*67ecd4f3SMax Laier * notice, this list of conditions and the following disclaimer.
12*67ecd4f3SMax Laier * 2. Redistributions in binary form must reproduce the above copyright
13*67ecd4f3SMax Laier * notice, this list of conditions and the following disclaimer in the
14*67ecd4f3SMax Laier * documentation and/or other materials provided with the distribution.
15*67ecd4f3SMax Laier * 3. The name of the author may not be used to endorse or promote products
16*67ecd4f3SMax Laier * derived from this software without specific prior written permission.
17*67ecd4f3SMax Laier *
18*67ecd4f3SMax Laier * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19*67ecd4f3SMax Laier * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20*67ecd4f3SMax Laier * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21*67ecd4f3SMax Laier * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22*67ecd4f3SMax Laier * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23*67ecd4f3SMax Laier * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24*67ecd4f3SMax Laier * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25*67ecd4f3SMax Laier * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26*67ecd4f3SMax Laier * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27*67ecd4f3SMax Laier * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28*67ecd4f3SMax Laier */
29*67ecd4f3SMax Laier #ifdef HAVE_CONFIG_H
30*67ecd4f3SMax Laier #include "config.h"
31*67ecd4f3SMax Laier #endif
32*67ecd4f3SMax Laier
33*67ecd4f3SMax Laier #include <sys/types.h>
34*67ecd4f3SMax Laier #ifdef HAVE_SYS_TIME_H
35*67ecd4f3SMax Laier #include <sys/time.h>
36*67ecd4f3SMax Laier #else
37*67ecd4f3SMax Laier #include <sys/_time.h>
38*67ecd4f3SMax Laier #endif
39*67ecd4f3SMax Laier #include <sys/queue.h>
40*67ecd4f3SMax Laier #include <sys/event.h>
41*67ecd4f3SMax Laier #include <signal.h>
42*67ecd4f3SMax Laier #include <stdio.h>
43*67ecd4f3SMax Laier #include <stdlib.h>
44*67ecd4f3SMax Laier #include <string.h>
45*67ecd4f3SMax Laier #include <unistd.h>
46*67ecd4f3SMax Laier #include <errno.h>
47*67ecd4f3SMax Laier #ifdef HAVE_INTTYPES_H
48*67ecd4f3SMax Laier #include <inttypes.h>
49*67ecd4f3SMax Laier #endif
50*67ecd4f3SMax Laier
51*67ecd4f3SMax Laier #if defined(HAVE_INTTYPES_H) && !defined(__OpenBSD__) && !defined(__FreeBSD__)
52*67ecd4f3SMax Laier #define INTPTR(x) (intptr_t)x
53*67ecd4f3SMax Laier #else
54*67ecd4f3SMax Laier #define INTPTR(x) x
55*67ecd4f3SMax Laier #endif
56*67ecd4f3SMax Laier
57*67ecd4f3SMax Laier #include "event.h"
58*67ecd4f3SMax Laier #include "log.h"
59*67ecd4f3SMax Laier
60*67ecd4f3SMax Laier #define EVLIST_X_KQINKERNEL 0x1000
61*67ecd4f3SMax Laier
62*67ecd4f3SMax Laier #define NEVENT 64
63*67ecd4f3SMax Laier
64*67ecd4f3SMax Laier struct kqop {
65*67ecd4f3SMax Laier struct kevent *changes;
66*67ecd4f3SMax Laier int nchanges;
67*67ecd4f3SMax Laier struct kevent *events;
68*67ecd4f3SMax Laier int nevents;
69*67ecd4f3SMax Laier int kq;
70*67ecd4f3SMax Laier };
71*67ecd4f3SMax Laier
72*67ecd4f3SMax Laier void *kq_init (void);
73*67ecd4f3SMax Laier int kq_add (void *, struct event *);
74*67ecd4f3SMax Laier int kq_del (void *, struct event *);
75*67ecd4f3SMax Laier int kq_recalc (struct event_base *, void *, int);
76*67ecd4f3SMax Laier int kq_dispatch (struct event_base *, void *, struct timeval *);
77*67ecd4f3SMax Laier int kq_insert (struct kqop *, struct kevent *);
78*67ecd4f3SMax Laier void kq_dealloc (void *);
79*67ecd4f3SMax Laier
80*67ecd4f3SMax Laier const struct eventop kqops = {
81*67ecd4f3SMax Laier "kqueue",
82*67ecd4f3SMax Laier kq_init,
83*67ecd4f3SMax Laier kq_add,
84*67ecd4f3SMax Laier kq_del,
85*67ecd4f3SMax Laier kq_recalc,
86*67ecd4f3SMax Laier kq_dispatch,
87*67ecd4f3SMax Laier kq_dealloc
88*67ecd4f3SMax Laier };
89*67ecd4f3SMax Laier
90*67ecd4f3SMax Laier void *
kq_init(void)91*67ecd4f3SMax Laier kq_init(void)
92*67ecd4f3SMax Laier {
93*67ecd4f3SMax Laier int kq;
94*67ecd4f3SMax Laier struct kqop *kqueueop;
95*67ecd4f3SMax Laier
96*67ecd4f3SMax Laier /* Disable kqueue when this environment variable is set */
97*67ecd4f3SMax Laier if (getenv("EVENT_NOKQUEUE"))
98*67ecd4f3SMax Laier return (NULL);
99*67ecd4f3SMax Laier
100*67ecd4f3SMax Laier if (!(kqueueop = calloc(1, sizeof(struct kqop))))
101*67ecd4f3SMax Laier return (NULL);
102*67ecd4f3SMax Laier
103*67ecd4f3SMax Laier /* Initalize the kernel queue */
104*67ecd4f3SMax Laier
105*67ecd4f3SMax Laier if ((kq = kqueue()) == -1) {
106*67ecd4f3SMax Laier event_warn("kqueue");
107*67ecd4f3SMax Laier free (kqueueop);
108*67ecd4f3SMax Laier return (NULL);
109*67ecd4f3SMax Laier }
110*67ecd4f3SMax Laier
111*67ecd4f3SMax Laier kqueueop->kq = kq;
112*67ecd4f3SMax Laier
113*67ecd4f3SMax Laier /* Initalize fields */
114*67ecd4f3SMax Laier kqueueop->changes = malloc(NEVENT * sizeof(struct kevent));
115*67ecd4f3SMax Laier if (kqueueop->changes == NULL) {
116*67ecd4f3SMax Laier free (kqueueop);
117*67ecd4f3SMax Laier return (NULL);
118*67ecd4f3SMax Laier }
119*67ecd4f3SMax Laier kqueueop->events = malloc(NEVENT * sizeof(struct kevent));
120*67ecd4f3SMax Laier if (kqueueop->events == NULL) {
121*67ecd4f3SMax Laier free (kqueueop->changes);
122*67ecd4f3SMax Laier free (kqueueop);
123*67ecd4f3SMax Laier return (NULL);
124*67ecd4f3SMax Laier }
125*67ecd4f3SMax Laier kqueueop->nevents = NEVENT;
126*67ecd4f3SMax Laier
127*67ecd4f3SMax Laier /* Check for Mac OS X kqueue bug. */
128*67ecd4f3SMax Laier kqueueop->changes[0].ident = -1;
129*67ecd4f3SMax Laier kqueueop->changes[0].filter = EVFILT_READ;
130*67ecd4f3SMax Laier kqueueop->changes[0].flags = EV_ADD;
131*67ecd4f3SMax Laier /*
132*67ecd4f3SMax Laier * If kqueue works, then kevent will succeed, and it will
133*67ecd4f3SMax Laier * stick an error in events[0]. If kqueue is broken, then
134*67ecd4f3SMax Laier * kevent will fail.
135*67ecd4f3SMax Laier */
136*67ecd4f3SMax Laier if (kevent(kq,
137*67ecd4f3SMax Laier kqueueop->changes, 1, kqueueop->events, NEVENT, NULL) != 1 ||
138*67ecd4f3SMax Laier kqueueop->events[0].ident != -1 ||
139*67ecd4f3SMax Laier kqueueop->events[0].flags != EV_ERROR) {
140*67ecd4f3SMax Laier event_warn("%s: detected broken kqueue; not using.", __func__);
141*67ecd4f3SMax Laier free(kqueueop->changes);
142*67ecd4f3SMax Laier free(kqueueop->events);
143*67ecd4f3SMax Laier free(kqueueop);
144*67ecd4f3SMax Laier close(kq);
145*67ecd4f3SMax Laier return (NULL);
146*67ecd4f3SMax Laier }
147*67ecd4f3SMax Laier
148*67ecd4f3SMax Laier return (kqueueop);
149*67ecd4f3SMax Laier }
150*67ecd4f3SMax Laier
151*67ecd4f3SMax Laier int
kq_recalc(struct event_base * base,void * arg,int max)152*67ecd4f3SMax Laier kq_recalc(struct event_base *base, void *arg, int max)
153*67ecd4f3SMax Laier {
154*67ecd4f3SMax Laier return (0);
155*67ecd4f3SMax Laier }
156*67ecd4f3SMax Laier
157*67ecd4f3SMax Laier int
kq_insert(struct kqop * kqop,struct kevent * kev)158*67ecd4f3SMax Laier kq_insert(struct kqop *kqop, struct kevent *kev)
159*67ecd4f3SMax Laier {
160*67ecd4f3SMax Laier int nevents = kqop->nevents;
161*67ecd4f3SMax Laier
162*67ecd4f3SMax Laier if (kqop->nchanges == nevents) {
163*67ecd4f3SMax Laier struct kevent *newchange;
164*67ecd4f3SMax Laier struct kevent *newresult;
165*67ecd4f3SMax Laier
166*67ecd4f3SMax Laier nevents *= 2;
167*67ecd4f3SMax Laier
168*67ecd4f3SMax Laier newchange = realloc(kqop->changes,
169*67ecd4f3SMax Laier nevents * sizeof(struct kevent));
170*67ecd4f3SMax Laier if (newchange == NULL) {
171*67ecd4f3SMax Laier event_warn("%s: malloc", __func__);
172*67ecd4f3SMax Laier return (-1);
173*67ecd4f3SMax Laier }
174*67ecd4f3SMax Laier kqop->changes = newchange;
175*67ecd4f3SMax Laier
176*67ecd4f3SMax Laier newresult = realloc(kqop->events,
177*67ecd4f3SMax Laier nevents * sizeof(struct kevent));
178*67ecd4f3SMax Laier
179*67ecd4f3SMax Laier /*
180*67ecd4f3SMax Laier * If we fail, we don't have to worry about freeing,
181*67ecd4f3SMax Laier * the next realloc will pick it up.
182*67ecd4f3SMax Laier */
183*67ecd4f3SMax Laier if (newresult == NULL) {
184*67ecd4f3SMax Laier event_warn("%s: malloc", __func__);
185*67ecd4f3SMax Laier return (-1);
186*67ecd4f3SMax Laier }
187*67ecd4f3SMax Laier kqop->events = newresult;
188*67ecd4f3SMax Laier
189*67ecd4f3SMax Laier kqop->nevents = nevents;
190*67ecd4f3SMax Laier }
191*67ecd4f3SMax Laier
192*67ecd4f3SMax Laier memcpy(&kqop->changes[kqop->nchanges++], kev, sizeof(struct kevent));
193*67ecd4f3SMax Laier
194*67ecd4f3SMax Laier event_debug(("%s: fd %d %s%s",
195*67ecd4f3SMax Laier __func__, kev->ident,
196*67ecd4f3SMax Laier kev->filter == EVFILT_READ ? "EVFILT_READ" : "EVFILT_WRITE",
197*67ecd4f3SMax Laier kev->flags == EV_DELETE ? " (del)" : ""));
198*67ecd4f3SMax Laier
199*67ecd4f3SMax Laier return (0);
200*67ecd4f3SMax Laier }
201*67ecd4f3SMax Laier
202*67ecd4f3SMax Laier static void
kq_sighandler(int sig)203*67ecd4f3SMax Laier kq_sighandler(int sig)
204*67ecd4f3SMax Laier {
205*67ecd4f3SMax Laier /* Do nothing here */
206*67ecd4f3SMax Laier }
207*67ecd4f3SMax Laier
208*67ecd4f3SMax Laier int
kq_dispatch(struct event_base * base,void * arg,struct timeval * tv)209*67ecd4f3SMax Laier kq_dispatch(struct event_base *base, void *arg, struct timeval *tv)
210*67ecd4f3SMax Laier {
211*67ecd4f3SMax Laier struct kqop *kqop = arg;
212*67ecd4f3SMax Laier struct kevent *changes = kqop->changes;
213*67ecd4f3SMax Laier struct kevent *events = kqop->events;
214*67ecd4f3SMax Laier struct event *ev;
215*67ecd4f3SMax Laier struct timespec ts;
216*67ecd4f3SMax Laier int i, res;
217*67ecd4f3SMax Laier
218*67ecd4f3SMax Laier TIMEVAL_TO_TIMESPEC(tv, &ts);
219*67ecd4f3SMax Laier
220*67ecd4f3SMax Laier res = kevent(kqop->kq, changes, kqop->nchanges,
221*67ecd4f3SMax Laier events, kqop->nevents, &ts);
222*67ecd4f3SMax Laier kqop->nchanges = 0;
223*67ecd4f3SMax Laier if (res == -1) {
224*67ecd4f3SMax Laier if (errno != EINTR) {
225*67ecd4f3SMax Laier event_warn("kevent");
226*67ecd4f3SMax Laier return (-1);
227*67ecd4f3SMax Laier }
228*67ecd4f3SMax Laier
229*67ecd4f3SMax Laier return (0);
230*67ecd4f3SMax Laier }
231*67ecd4f3SMax Laier
232*67ecd4f3SMax Laier event_debug(("%s: kevent reports %d", __func__, res));
233*67ecd4f3SMax Laier
234*67ecd4f3SMax Laier for (i = 0; i < res; i++) {
235*67ecd4f3SMax Laier int which = 0;
236*67ecd4f3SMax Laier
237*67ecd4f3SMax Laier if (events[i].flags & EV_ERROR) {
238*67ecd4f3SMax Laier /*
239*67ecd4f3SMax Laier * Error messages that can happen, when a delete fails.
240*67ecd4f3SMax Laier * EBADF happens when the file discriptor has been
241*67ecd4f3SMax Laier * closed,
242*67ecd4f3SMax Laier * ENOENT when the file discriptor was closed and
243*67ecd4f3SMax Laier * then reopened.
244*67ecd4f3SMax Laier * EINVAL for some reasons not understood; EINVAL
245*67ecd4f3SMax Laier * should not be returned ever; but FreeBSD does :-\
246*67ecd4f3SMax Laier * An error is also indicated when a callback deletes
247*67ecd4f3SMax Laier * an event we are still processing. In that case
248*67ecd4f3SMax Laier * the data field is set to ENOENT.
249*67ecd4f3SMax Laier */
250*67ecd4f3SMax Laier if (events[i].data == EBADF ||
251*67ecd4f3SMax Laier events[i].data == EINVAL ||
252*67ecd4f3SMax Laier events[i].data == ENOENT)
253*67ecd4f3SMax Laier continue;
254*67ecd4f3SMax Laier errno = events[i].data;
255*67ecd4f3SMax Laier return (-1);
256*67ecd4f3SMax Laier }
257*67ecd4f3SMax Laier
258*67ecd4f3SMax Laier ev = (struct event *)events[i].udata;
259*67ecd4f3SMax Laier
260*67ecd4f3SMax Laier if (events[i].filter == EVFILT_READ) {
261*67ecd4f3SMax Laier which |= EV_READ;
262*67ecd4f3SMax Laier } else if (events[i].filter == EVFILT_WRITE) {
263*67ecd4f3SMax Laier which |= EV_WRITE;
264*67ecd4f3SMax Laier } else if (events[i].filter == EVFILT_SIGNAL) {
265*67ecd4f3SMax Laier which |= EV_SIGNAL;
266*67ecd4f3SMax Laier }
267*67ecd4f3SMax Laier
268*67ecd4f3SMax Laier if (!which)
269*67ecd4f3SMax Laier continue;
270*67ecd4f3SMax Laier
271*67ecd4f3SMax Laier if (!(ev->ev_events & EV_PERSIST))
272*67ecd4f3SMax Laier event_del(ev);
273*67ecd4f3SMax Laier
274*67ecd4f3SMax Laier event_active(ev, which,
275*67ecd4f3SMax Laier ev->ev_events & EV_SIGNAL ? events[i].data : 1);
276*67ecd4f3SMax Laier }
277*67ecd4f3SMax Laier
278*67ecd4f3SMax Laier return (0);
279*67ecd4f3SMax Laier }
280*67ecd4f3SMax Laier
281*67ecd4f3SMax Laier
282*67ecd4f3SMax Laier int
kq_add(void * arg,struct event * ev)283*67ecd4f3SMax Laier kq_add(void *arg, struct event *ev)
284*67ecd4f3SMax Laier {
285*67ecd4f3SMax Laier struct kqop *kqop = arg;
286*67ecd4f3SMax Laier struct kevent kev;
287*67ecd4f3SMax Laier
288*67ecd4f3SMax Laier if (ev->ev_events & EV_SIGNAL) {
289*67ecd4f3SMax Laier int nsignal = EVENT_SIGNAL(ev);
290*67ecd4f3SMax Laier
291*67ecd4f3SMax Laier memset(&kev, 0, sizeof(kev));
292*67ecd4f3SMax Laier kev.ident = nsignal;
293*67ecd4f3SMax Laier kev.filter = EVFILT_SIGNAL;
294*67ecd4f3SMax Laier kev.flags = EV_ADD;
295*67ecd4f3SMax Laier if (!(ev->ev_events & EV_PERSIST))
296*67ecd4f3SMax Laier kev.flags |= EV_ONESHOT;
297*67ecd4f3SMax Laier kev.udata = INTPTR(ev);
298*67ecd4f3SMax Laier
299*67ecd4f3SMax Laier if (kq_insert(kqop, &kev) == -1)
300*67ecd4f3SMax Laier return (-1);
301*67ecd4f3SMax Laier
302*67ecd4f3SMax Laier if (signal(nsignal, kq_sighandler) == SIG_ERR)
303*67ecd4f3SMax Laier return (-1);
304*67ecd4f3SMax Laier
305*67ecd4f3SMax Laier ev->ev_flags |= EVLIST_X_KQINKERNEL;
306*67ecd4f3SMax Laier return (0);
307*67ecd4f3SMax Laier }
308*67ecd4f3SMax Laier
309*67ecd4f3SMax Laier if (ev->ev_events & EV_READ) {
310*67ecd4f3SMax Laier memset(&kev, 0, sizeof(kev));
311*67ecd4f3SMax Laier kev.ident = ev->ev_fd;
312*67ecd4f3SMax Laier kev.filter = EVFILT_READ;
313*67ecd4f3SMax Laier #ifdef NOTE_EOF
314*67ecd4f3SMax Laier /* Make it behave like select() and poll() */
315*67ecd4f3SMax Laier kev.fflags = NOTE_EOF;
316*67ecd4f3SMax Laier #endif
317*67ecd4f3SMax Laier kev.flags = EV_ADD;
318*67ecd4f3SMax Laier if (!(ev->ev_events & EV_PERSIST))
319*67ecd4f3SMax Laier kev.flags |= EV_ONESHOT;
320*67ecd4f3SMax Laier kev.udata = INTPTR(ev);
321*67ecd4f3SMax Laier
322*67ecd4f3SMax Laier if (kq_insert(kqop, &kev) == -1)
323*67ecd4f3SMax Laier return (-1);
324*67ecd4f3SMax Laier
325*67ecd4f3SMax Laier ev->ev_flags |= EVLIST_X_KQINKERNEL;
326*67ecd4f3SMax Laier }
327*67ecd4f3SMax Laier
328*67ecd4f3SMax Laier if (ev->ev_events & EV_WRITE) {
329*67ecd4f3SMax Laier memset(&kev, 0, sizeof(kev));
330*67ecd4f3SMax Laier kev.ident = ev->ev_fd;
331*67ecd4f3SMax Laier kev.filter = EVFILT_WRITE;
332*67ecd4f3SMax Laier kev.flags = EV_ADD;
333*67ecd4f3SMax Laier if (!(ev->ev_events & EV_PERSIST))
334*67ecd4f3SMax Laier kev.flags |= EV_ONESHOT;
335*67ecd4f3SMax Laier kev.udata = INTPTR(ev);
336*67ecd4f3SMax Laier
337*67ecd4f3SMax Laier if (kq_insert(kqop, &kev) == -1)
338*67ecd4f3SMax Laier return (-1);
339*67ecd4f3SMax Laier
340*67ecd4f3SMax Laier ev->ev_flags |= EVLIST_X_KQINKERNEL;
341*67ecd4f3SMax Laier }
342*67ecd4f3SMax Laier
343*67ecd4f3SMax Laier return (0);
344*67ecd4f3SMax Laier }
345*67ecd4f3SMax Laier
346*67ecd4f3SMax Laier int
kq_del(void * arg,struct event * ev)347*67ecd4f3SMax Laier kq_del(void *arg, struct event *ev)
348*67ecd4f3SMax Laier {
349*67ecd4f3SMax Laier struct kqop *kqop = arg;
350*67ecd4f3SMax Laier struct kevent kev;
351*67ecd4f3SMax Laier
352*67ecd4f3SMax Laier if (!(ev->ev_flags & EVLIST_X_KQINKERNEL))
353*67ecd4f3SMax Laier return (0);
354*67ecd4f3SMax Laier
355*67ecd4f3SMax Laier if (ev->ev_events & EV_SIGNAL) {
356*67ecd4f3SMax Laier int nsignal = EVENT_SIGNAL(ev);
357*67ecd4f3SMax Laier
358*67ecd4f3SMax Laier memset(&kev, 0, sizeof(kev));
359*67ecd4f3SMax Laier kev.ident = nsignal;
360*67ecd4f3SMax Laier kev.filter = EVFILT_SIGNAL;
361*67ecd4f3SMax Laier kev.flags = EV_DELETE;
362*67ecd4f3SMax Laier
363*67ecd4f3SMax Laier if (kq_insert(kqop, &kev) == -1)
364*67ecd4f3SMax Laier return (-1);
365*67ecd4f3SMax Laier
366*67ecd4f3SMax Laier if (signal(nsignal, SIG_DFL) == SIG_ERR)
367*67ecd4f3SMax Laier return (-1);
368*67ecd4f3SMax Laier
369*67ecd4f3SMax Laier ev->ev_flags &= ~EVLIST_X_KQINKERNEL;
370*67ecd4f3SMax Laier return (0);
371*67ecd4f3SMax Laier }
372*67ecd4f3SMax Laier
373*67ecd4f3SMax Laier if (ev->ev_events & EV_READ) {
374*67ecd4f3SMax Laier memset(&kev, 0, sizeof(kev));
375*67ecd4f3SMax Laier kev.ident = ev->ev_fd;
376*67ecd4f3SMax Laier kev.filter = EVFILT_READ;
377*67ecd4f3SMax Laier kev.flags = EV_DELETE;
378*67ecd4f3SMax Laier
379*67ecd4f3SMax Laier if (kq_insert(kqop, &kev) == -1)
380*67ecd4f3SMax Laier return (-1);
381*67ecd4f3SMax Laier
382*67ecd4f3SMax Laier ev->ev_flags &= ~EVLIST_X_KQINKERNEL;
383*67ecd4f3SMax Laier }
384*67ecd4f3SMax Laier
385*67ecd4f3SMax Laier if (ev->ev_events & EV_WRITE) {
386*67ecd4f3SMax Laier memset(&kev, 0, sizeof(kev));
387*67ecd4f3SMax Laier kev.ident = ev->ev_fd;
388*67ecd4f3SMax Laier kev.filter = EVFILT_WRITE;
389*67ecd4f3SMax Laier kev.flags = EV_DELETE;
390*67ecd4f3SMax Laier
391*67ecd4f3SMax Laier if (kq_insert(kqop, &kev) == -1)
392*67ecd4f3SMax Laier return (-1);
393*67ecd4f3SMax Laier
394*67ecd4f3SMax Laier ev->ev_flags &= ~EVLIST_X_KQINKERNEL;
395*67ecd4f3SMax Laier }
396*67ecd4f3SMax Laier
397*67ecd4f3SMax Laier return (0);
398*67ecd4f3SMax Laier }
399*67ecd4f3SMax Laier
400*67ecd4f3SMax Laier void
kq_dealloc(void * arg)401*67ecd4f3SMax Laier kq_dealloc(void *arg)
402*67ecd4f3SMax Laier {
403*67ecd4f3SMax Laier struct kqop *kqop = arg;
404*67ecd4f3SMax Laier
405*67ecd4f3SMax Laier if (kqop->changes)
406*67ecd4f3SMax Laier free(kqop->changes);
407*67ecd4f3SMax Laier if (kqop->events)
408*67ecd4f3SMax Laier free(kqop->events);
409*67ecd4f3SMax Laier if (kqop->kq)
410*67ecd4f3SMax Laier close(kqop->kq);
411*67ecd4f3SMax Laier memset(kqop, 0, sizeof(struct kqop));
412*67ecd4f3SMax Laier free(kqop);
413*67ecd4f3SMax Laier }
414