2 * Copyright (c) 1999,2000,2001 Jonathan Lemon <jlemon@FreeBSD.org>
3 * Copyright 2004 John-Mark Gurney <jmg@FreeBSD.org>
4 * Copyright (c) 2009 Apple, Inc.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
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.
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 #include <sys/cdefs.h>
30 __FBSDID("$FreeBSD$");
32 #include "opt_ktrace.h"
33 #include "opt_kqueue.h"
35 #include <sys/param.h>
36 #include <sys/systm.h>
37 #include <sys/capsicum.h>
38 #include <sys/kernel.h>
40 #include <sys/mutex.h>
41 #include <sys/rwlock.h>
43 #include <sys/malloc.h>
44 #include <sys/unistd.h>
46 #include <sys/filedesc.h>
47 #include <sys/filio.h>
48 #include <sys/fcntl.h>
49 #include <sys/kthread.h>
50 #include <sys/selinfo.h>
51 #include <sys/queue.h>
52 #include <sys/event.h>
53 #include <sys/eventvar.h>
55 #include <sys/protosw.h>
56 #include <sys/resourcevar.h>
57 #include <sys/sigio.h>
58 #include <sys/signalvar.h>
59 #include <sys/socket.h>
60 #include <sys/socketvar.h>
62 #include <sys/sysctl.h>
63 #include <sys/sysproto.h>
64 #include <sys/syscallsubr.h>
65 #include <sys/taskqueue.h>
69 #include <sys/ktrace.h>
71 #include <machine/atomic.h>
75 static MALLOC_DEFINE(M_KQUEUE, "kqueue", "memory for kqueue system");
78 * This lock is used if multiple kq locks are required. This possibly
79 * should be made into a per proc lock.
81 static struct mtx kq_global;
82 MTX_SYSINIT(kq_global, &kq_global, "kqueue order", MTX_DEF);
83 #define KQ_GLOBAL_LOCK(lck, haslck) do { \
88 #define KQ_GLOBAL_UNLOCK(lck, haslck) do { \
94 TASKQUEUE_DEFINE_THREAD(kqueue_ctx);
96 static int kevent_copyout(void *arg, struct kevent *kevp, int count);
97 static int kevent_copyin(void *arg, struct kevent *kevp, int count);
98 static int kqueue_register(struct kqueue *kq, struct kevent *kev,
99 struct thread *td, int waitok);
100 static int kqueue_acquire(struct file *fp, struct kqueue **kqp);
101 static void kqueue_release(struct kqueue *kq, int locked);
102 static void kqueue_destroy(struct kqueue *kq);
103 static void kqueue_drain(struct kqueue *kq, struct thread *td);
104 static int kqueue_expand(struct kqueue *kq, struct filterops *fops,
105 uintptr_t ident, int waitok);
106 static void kqueue_task(void *arg, int pending);
107 static int kqueue_scan(struct kqueue *kq, int maxevents,
108 struct kevent_copyops *k_ops,
109 const struct timespec *timeout,
110 struct kevent *keva, struct thread *td);
111 static void kqueue_wakeup(struct kqueue *kq);
112 static struct filterops *kqueue_fo_find(int filt);
113 static void kqueue_fo_release(int filt);
115 static fo_ioctl_t kqueue_ioctl;
116 static fo_poll_t kqueue_poll;
117 static fo_kqfilter_t kqueue_kqfilter;
118 static fo_stat_t kqueue_stat;
119 static fo_close_t kqueue_close;
120 static fo_fill_kinfo_t kqueue_fill_kinfo;
122 static struct fileops kqueueops = {
123 .fo_read = invfo_rdwr,
124 .fo_write = invfo_rdwr,
125 .fo_truncate = invfo_truncate,
126 .fo_ioctl = kqueue_ioctl,
127 .fo_poll = kqueue_poll,
128 .fo_kqfilter = kqueue_kqfilter,
129 .fo_stat = kqueue_stat,
130 .fo_close = kqueue_close,
131 .fo_chmod = invfo_chmod,
132 .fo_chown = invfo_chown,
133 .fo_sendfile = invfo_sendfile,
134 .fo_fill_kinfo = kqueue_fill_kinfo,
137 static int knote_attach(struct knote *kn, struct kqueue *kq);
138 static void knote_drop(struct knote *kn, struct thread *td);
139 static void knote_enqueue(struct knote *kn);
140 static void knote_dequeue(struct knote *kn);
141 static void knote_init(void);
142 static struct knote *knote_alloc(int waitok);
143 static void knote_free(struct knote *kn);
145 static void filt_kqdetach(struct knote *kn);
146 static int filt_kqueue(struct knote *kn, long hint);
147 static int filt_procattach(struct knote *kn);
148 static void filt_procdetach(struct knote *kn);
149 static int filt_proc(struct knote *kn, long hint);
150 static int filt_fileattach(struct knote *kn);
151 static void filt_timerexpire(void *knx);
152 static int filt_timerattach(struct knote *kn);
153 static void filt_timerdetach(struct knote *kn);
154 static int filt_timer(struct knote *kn, long hint);
155 static int filt_userattach(struct knote *kn);
156 static void filt_userdetach(struct knote *kn);
157 static int filt_user(struct knote *kn, long hint);
158 static void filt_usertouch(struct knote *kn, struct kevent *kev,
161 static struct filterops file_filtops = {
163 .f_attach = filt_fileattach,
165 static struct filterops kqread_filtops = {
167 .f_detach = filt_kqdetach,
168 .f_event = filt_kqueue,
170 /* XXX - move to kern_proc.c? */
171 static struct filterops proc_filtops = {
173 .f_attach = filt_procattach,
174 .f_detach = filt_procdetach,
175 .f_event = filt_proc,
177 static struct filterops timer_filtops = {
179 .f_attach = filt_timerattach,
180 .f_detach = filt_timerdetach,
181 .f_event = filt_timer,
183 static struct filterops user_filtops = {
184 .f_attach = filt_userattach,
185 .f_detach = filt_userdetach,
186 .f_event = filt_user,
187 .f_touch = filt_usertouch,
190 static uma_zone_t knote_zone;
191 static unsigned int kq_ncallouts = 0;
192 static unsigned int kq_calloutmax = 4 * 1024;
193 SYSCTL_UINT(_kern, OID_AUTO, kq_calloutmax, CTLFLAG_RW,
194 &kq_calloutmax, 0, "Maximum number of callouts allocated for kqueue");
196 /* XXX - ensure not KN_INFLUX?? */
197 #define KNOTE_ACTIVATE(kn, islock) do { \
199 mtx_assert(&(kn)->kn_kq->kq_lock, MA_OWNED); \
201 KQ_LOCK((kn)->kn_kq); \
202 (kn)->kn_status |= KN_ACTIVE; \
203 if (((kn)->kn_status & (KN_QUEUED | KN_DISABLED)) == 0) \
204 knote_enqueue((kn)); \
206 KQ_UNLOCK((kn)->kn_kq); \
208 #define KQ_LOCK(kq) do { \
209 mtx_lock(&(kq)->kq_lock); \
211 #define KQ_FLUX_WAKEUP(kq) do { \
212 if (((kq)->kq_state & KQ_FLUXWAIT) == KQ_FLUXWAIT) { \
213 (kq)->kq_state &= ~KQ_FLUXWAIT; \
217 #define KQ_UNLOCK_FLUX(kq) do { \
218 KQ_FLUX_WAKEUP(kq); \
219 mtx_unlock(&(kq)->kq_lock); \
221 #define KQ_UNLOCK(kq) do { \
222 mtx_unlock(&(kq)->kq_lock); \
224 #define KQ_OWNED(kq) do { \
225 mtx_assert(&(kq)->kq_lock, MA_OWNED); \
227 #define KQ_NOTOWNED(kq) do { \
228 mtx_assert(&(kq)->kq_lock, MA_NOTOWNED); \
231 static struct knlist *
232 kn_list_lock(struct knote *kn)
238 knl->kl_lock(knl->kl_lockarg);
243 kn_list_unlock(struct knlist *knl)
249 do_free = knl->kl_autodestroy && knlist_empty(knl);
250 knl->kl_unlock(knl->kl_lockarg);
257 #define KNL_ASSERT_LOCK(knl, islocked) do { \
259 KNL_ASSERT_LOCKED(knl); \
261 KNL_ASSERT_UNLOCKED(knl); \
264 #define KNL_ASSERT_LOCKED(knl) do { \
265 knl->kl_assert_locked((knl)->kl_lockarg); \
267 #define KNL_ASSERT_UNLOCKED(knl) do { \
268 knl->kl_assert_unlocked((knl)->kl_lockarg); \
270 #else /* !INVARIANTS */
271 #define KNL_ASSERT_LOCKED(knl) do {} while(0)
272 #define KNL_ASSERT_UNLOCKED(knl) do {} while (0)
273 #endif /* INVARIANTS */
276 #define KN_HASHSIZE 64 /* XXX should be tunable */
279 #define KN_HASH(val, mask) (((val) ^ (val >> 8)) & (mask))
282 filt_nullattach(struct knote *kn)
288 struct filterops null_filtops = {
290 .f_attach = filt_nullattach,
293 /* XXX - make SYSINIT to add these, and move into respective modules. */
294 extern struct filterops sig_filtops;
295 extern struct filterops fs_filtops;
298 * Table for for all system-defined filters.
300 static struct mtx filterops_lock;
301 MTX_SYSINIT(kqueue_filterops, &filterops_lock, "protect sysfilt_ops",
304 struct filterops *for_fop;
307 } sysfilt_ops[EVFILT_SYSCOUNT] = {
308 { &file_filtops, 1 }, /* EVFILT_READ */
309 { &file_filtops, 1 }, /* EVFILT_WRITE */
310 { &null_filtops }, /* EVFILT_AIO */
311 { &file_filtops, 1 }, /* EVFILT_VNODE */
312 { &proc_filtops, 1 }, /* EVFILT_PROC */
313 { &sig_filtops, 1 }, /* EVFILT_SIGNAL */
314 { &timer_filtops, 1 }, /* EVFILT_TIMER */
315 { &file_filtops, 1 }, /* EVFILT_PROCDESC */
316 { &fs_filtops, 1 }, /* EVFILT_FS */
317 { &null_filtops }, /* EVFILT_LIO */
318 { &user_filtops, 1 }, /* EVFILT_USER */
319 { &null_filtops }, /* EVFILT_SENDFILE */
323 * Simple redirection for all cdevsw style objects to call their fo_kqfilter
327 filt_fileattach(struct knote *kn)
330 return (fo_kqfilter(kn->kn_fp, kn));
335 kqueue_kqfilter(struct file *fp, struct knote *kn)
337 struct kqueue *kq = kn->kn_fp->f_data;
339 if (kn->kn_filter != EVFILT_READ)
342 kn->kn_status |= KN_KQUEUE;
343 kn->kn_fop = &kqread_filtops;
344 knlist_add(&kq->kq_sel.si_note, kn, 0);
350 filt_kqdetach(struct knote *kn)
352 struct kqueue *kq = kn->kn_fp->f_data;
354 knlist_remove(&kq->kq_sel.si_note, kn, 0);
359 filt_kqueue(struct knote *kn, long hint)
361 struct kqueue *kq = kn->kn_fp->f_data;
363 kn->kn_data = kq->kq_count;
364 return (kn->kn_data > 0);
367 /* XXX - move to kern_proc.c? */
369 filt_procattach(struct knote *kn)
373 bool exiting, immediate;
375 exiting = immediate = false;
376 p = pfind(kn->kn_id);
377 if (p == NULL && (kn->kn_sfflags & NOTE_EXIT)) {
378 p = zpfind(kn->kn_id);
380 } else if (p != NULL && (p->p_flag & P_WEXIT)) {
386 if ((error = p_cansee(curthread, p))) {
391 kn->kn_ptr.p_proc = p;
392 kn->kn_flags |= EV_CLEAR; /* automatically set */
395 * Internal flag indicating registration done by kernel for the
396 * purposes of getting a NOTE_CHILD notification.
398 if (kn->kn_flags & EV_FLAG2) {
399 kn->kn_flags &= ~EV_FLAG2;
400 kn->kn_data = kn->kn_sdata; /* ppid */
401 kn->kn_fflags = NOTE_CHILD;
402 kn->kn_sfflags &= ~(NOTE_EXIT | NOTE_EXEC | NOTE_FORK);
403 immediate = true; /* Force immediate activation of child note. */
406 * Internal flag indicating registration done by kernel (for other than
409 if (kn->kn_flags & EV_FLAG1) {
410 kn->kn_flags &= ~EV_FLAG1;
413 knlist_add(p->p_klist, kn, 1);
416 * Immediately activate any child notes or, in the case of a zombie
417 * target process, exit notes. The latter is necessary to handle the
418 * case where the target process, e.g. a child, dies before the kevent
421 if (immediate || (exiting && filt_proc(kn, NOTE_EXIT)))
422 KNOTE_ACTIVATE(kn, 0);
430 * The knote may be attached to a different process, which may exit,
431 * leaving nothing for the knote to be attached to. So when the process
432 * exits, the knote is marked as DETACHED and also flagged as ONESHOT so
433 * it will be deleted when read out. However, as part of the knote deletion,
434 * this routine is called, so a check is needed to avoid actually performing
435 * a detach, because the original process does not exist any more.
437 /* XXX - move to kern_proc.c? */
439 filt_procdetach(struct knote *kn)
442 knlist_remove(kn->kn_knlist, kn, 0);
443 kn->kn_ptr.p_proc = NULL;
446 /* XXX - move to kern_proc.c? */
448 filt_proc(struct knote *kn, long hint)
453 p = kn->kn_ptr.p_proc;
454 if (p == NULL) /* already activated, from attach filter */
457 /* Mask off extra data. */
458 event = (u_int)hint & NOTE_PCTRLMASK;
460 /* If the user is interested in this event, record it. */
461 if (kn->kn_sfflags & event)
462 kn->kn_fflags |= event;
464 /* Process is gone, so flag the event as finished. */
465 if (event == NOTE_EXIT) {
466 kn->kn_flags |= EV_EOF | EV_ONESHOT;
467 kn->kn_ptr.p_proc = NULL;
468 if (kn->kn_fflags & NOTE_EXIT)
469 kn->kn_data = KW_EXITCODE(p->p_xexit, p->p_xsig);
470 if (kn->kn_fflags == 0)
471 kn->kn_flags |= EV_DROP;
475 return (kn->kn_fflags != 0);
479 * Called when the process forked. It mostly does the same as the
480 * knote(), activating all knotes registered to be activated when the
481 * process forked. Additionally, for each knote attached to the
482 * parent, check whether user wants to track the new process. If so
483 * attach a new knote to it, and immediately report an event with the
487 knote_fork(struct knlist *list, int pid)
496 list->kl_lock(list->kl_lockarg);
498 SLIST_FOREACH(kn, &list->kl_list, kn_selnext) {
501 if ((kn->kn_status & (KN_INFLUX | KN_SCAN)) == KN_INFLUX) {
507 * The same as knote(), activate the event.
509 if ((kn->kn_sfflags & NOTE_TRACK) == 0) {
510 kn->kn_status |= KN_HASKQLOCK;
511 if (kn->kn_fop->f_event(kn, NOTE_FORK))
512 KNOTE_ACTIVATE(kn, 1);
513 kn->kn_status &= ~KN_HASKQLOCK;
519 * The NOTE_TRACK case. In addition to the activation
520 * of the event, we need to register new events to
521 * track the child. Drop the locks in preparation for
522 * the call to kqueue_register().
524 kn->kn_status |= KN_INFLUX;
526 list->kl_unlock(list->kl_lockarg);
529 * Activate existing knote and register tracking knotes with
532 * First register a knote to get just the child notice. This
533 * must be a separate note from a potential NOTE_EXIT
534 * notification since both NOTE_CHILD and NOTE_EXIT are defined
535 * to use the data field (in conflicting ways).
538 kev.filter = kn->kn_filter;
539 kev.flags = kn->kn_flags | EV_ADD | EV_ENABLE | EV_ONESHOT |
541 kev.fflags = kn->kn_sfflags;
542 kev.data = kn->kn_id; /* parent */
543 kev.udata = kn->kn_kevent.udata;/* preserve udata */
544 error = kqueue_register(kq, &kev, NULL, 0);
546 kn->kn_fflags |= NOTE_TRACKERR;
549 * Then register another knote to track other potential events
550 * from the new process.
553 kev.filter = kn->kn_filter;
554 kev.flags = kn->kn_flags | EV_ADD | EV_ENABLE | EV_FLAG1;
555 kev.fflags = kn->kn_sfflags;
556 kev.data = kn->kn_id; /* parent */
557 kev.udata = kn->kn_kevent.udata;/* preserve udata */
558 error = kqueue_register(kq, &kev, NULL, 0);
560 kn->kn_fflags |= NOTE_TRACKERR;
561 if (kn->kn_fop->f_event(kn, NOTE_FORK))
562 KNOTE_ACTIVATE(kn, 0);
564 kn->kn_status &= ~KN_INFLUX;
566 list->kl_lock(list->kl_lockarg);
568 list->kl_unlock(list->kl_lockarg);
572 * XXX: EVFILT_TIMER should perhaps live in kern_time.c beside the
573 * interval timer support code.
576 #define NOTE_TIMER_PRECMASK (NOTE_SECONDS|NOTE_MSECONDS|NOTE_USECONDS| \
580 timer2sbintime(intptr_t data, int flags)
584 * Macros for converting to the fractional second portion of an
585 * sbintime_t using 64bit multiplication to improve precision.
587 #define NS_TO_SBT(ns) (((ns) * (((uint64_t)1 << 63) / 500000000)) >> 32)
588 #define US_TO_SBT(us) (((us) * (((uint64_t)1 << 63) / 500000)) >> 32)
589 #define MS_TO_SBT(ms) (((ms) * (((uint64_t)1 << 63) / 500)) >> 32)
590 switch (flags & NOTE_TIMER_PRECMASK) {
593 if (data > (SBT_MAX / SBT_1S))
596 return ((sbintime_t)data << 32);
597 case NOTE_MSECONDS: /* FALLTHROUGH */
600 int64_t secs = data / 1000;
602 if (secs > (SBT_MAX / SBT_1S))
605 return (secs << 32 | MS_TO_SBT(data % 1000));
607 return MS_TO_SBT(data);
609 if (data >= 1000000) {
610 int64_t secs = data / 1000000;
612 if (secs > (SBT_MAX / SBT_1S))
615 return (secs << 32 | US_TO_SBT(data % 1000000));
617 return US_TO_SBT(data);
619 if (data >= 1000000000) {
620 int64_t secs = data / 1000000000;
622 if (secs > (SBT_MAX / SBT_1S))
625 return (secs << 32 | US_TO_SBT(data % 1000000000));
627 return (NS_TO_SBT(data));
634 struct kq_timer_cb_data {
636 sbintime_t next; /* next timer event fires at */
637 sbintime_t to; /* precalculated timer period */
641 filt_timerexpire(void *knx)
644 struct kq_timer_cb_data *kc;
648 KNOTE_ACTIVATE(kn, 0); /* XXX - handle locking */
650 if ((kn->kn_flags & EV_ONESHOT) != 0)
655 callout_reset_sbt_on(&kc->c, kc->next, 0, filt_timerexpire, kn,
656 PCPU_GET(cpuid), C_ABSOLUTE);
660 * data contains amount of time to sleep
663 filt_timerattach(struct knote *kn)
665 struct kq_timer_cb_data *kc;
667 unsigned int ncallouts;
669 if (kn->kn_sdata < 0)
671 if (kn->kn_sdata == 0 && (kn->kn_flags & EV_ONESHOT) == 0)
673 /* Only precision unit are supported in flags so far */
674 if ((kn->kn_sfflags & ~NOTE_TIMER_PRECMASK) != 0)
677 to = timer2sbintime(kn->kn_sdata, kn->kn_sfflags);
682 ncallouts = kq_ncallouts;
683 if (ncallouts >= kq_calloutmax)
685 } while (!atomic_cmpset_int(&kq_ncallouts, ncallouts, ncallouts + 1));
687 kn->kn_flags |= EV_CLEAR; /* automatically set */
688 kn->kn_status &= ~KN_DETACHED; /* knlist_add clears it */
689 kn->kn_ptr.p_v = kc = malloc(sizeof(*kc), M_KQUEUE, M_WAITOK);
690 callout_init(&kc->c, 1);
691 kc->next = to + sbinuptime();
693 callout_reset_sbt_on(&kc->c, kc->next, 0, filt_timerexpire, kn,
694 PCPU_GET(cpuid), C_ABSOLUTE);
700 filt_timerdetach(struct knote *kn)
702 struct kq_timer_cb_data *kc;
706 callout_drain(&kc->c);
708 old = atomic_fetchadd_int(&kq_ncallouts, -1);
709 KASSERT(old > 0, ("Number of callouts cannot become negative"));
710 kn->kn_status |= KN_DETACHED; /* knlist_remove sets it */
714 filt_timer(struct knote *kn, long hint)
717 return (kn->kn_data != 0);
721 filt_userattach(struct knote *kn)
725 * EVFILT_USER knotes are not attached to anything in the kernel.
728 if (kn->kn_fflags & NOTE_TRIGGER)
736 filt_userdetach(__unused struct knote *kn)
740 * EVFILT_USER knotes are not attached to anything in the kernel.
745 filt_user(struct knote *kn, __unused long hint)
748 return (kn->kn_hookid);
752 filt_usertouch(struct knote *kn, struct kevent *kev, u_long type)
758 if (kev->fflags & NOTE_TRIGGER)
761 ffctrl = kev->fflags & NOTE_FFCTRLMASK;
762 kev->fflags &= NOTE_FFLAGSMASK;
768 kn->kn_sfflags &= kev->fflags;
772 kn->kn_sfflags |= kev->fflags;
776 kn->kn_sfflags = kev->fflags;
780 /* XXX Return error? */
783 kn->kn_sdata = kev->data;
784 if (kev->flags & EV_CLEAR) {
792 *kev = kn->kn_kevent;
793 kev->fflags = kn->kn_sfflags;
794 kev->data = kn->kn_sdata;
795 if (kn->kn_flags & EV_CLEAR) {
803 panic("filt_usertouch() - invalid type (%ld)", type);
809 sys_kqueue(struct thread *td, struct kqueue_args *uap)
812 return (kern_kqueue(td, 0, NULL));
816 kqueue_init(struct kqueue *kq)
819 mtx_init(&kq->kq_lock, "kqueue", NULL, MTX_DEF | MTX_DUPOK);
820 TAILQ_INIT(&kq->kq_head);
821 knlist_init_mtx(&kq->kq_sel.si_note, &kq->kq_lock);
822 TASK_INIT(&kq->kq_task, 0, kqueue_task, kq);
826 kern_kqueue(struct thread *td, int flags, struct filecaps *fcaps)
828 struct filedesc *fdp;
834 fdp = td->td_proc->p_fd;
836 if (!chgkqcnt(cred->cr_ruidinfo, 1, lim_cur(td, RLIMIT_KQUEUES)))
839 error = falloc_caps(td, &fp, &fd, flags, fcaps);
841 chgkqcnt(cred->cr_ruidinfo, -1, 0);
845 /* An extra reference on `fp' has been held for us by falloc(). */
846 kq = malloc(sizeof *kq, M_KQUEUE, M_WAITOK | M_ZERO);
849 kq->kq_cred = crhold(cred);
852 TAILQ_INSERT_HEAD(&fdp->fd_kqlist, kq, kq_list);
853 FILEDESC_XUNLOCK(fdp);
855 finit(fp, FREAD | FWRITE, DTYPE_KQUEUE, kq, &kqueueops);
858 td->td_retval[0] = fd;
862 #ifndef _SYS_SYSPROTO_H_
865 const struct kevent *changelist;
867 struct kevent *eventlist;
869 const struct timespec *timeout;
873 sys_kevent(struct thread *td, struct kevent_args *uap)
875 struct timespec ts, *tsp;
876 struct kevent_copyops k_ops = { uap,
883 struct uio *ktruioin = NULL;
884 struct uio *ktruioout = NULL;
887 if (uap->timeout != NULL) {
888 error = copyin(uap->timeout, &ts, sizeof(ts));
896 if (KTRPOINT(td, KTR_GENIO)) {
897 ktriov.iov_base = uap->changelist;
898 ktriov.iov_len = uap->nchanges * sizeof(struct kevent);
899 ktruio = (struct uio){ .uio_iov = &ktriov, .uio_iovcnt = 1,
900 .uio_segflg = UIO_USERSPACE, .uio_rw = UIO_READ,
902 ktruioin = cloneuio(&ktruio);
903 ktriov.iov_base = uap->eventlist;
904 ktriov.iov_len = uap->nevents * sizeof(struct kevent);
905 ktruioout = cloneuio(&ktruio);
909 error = kern_kevent(td, uap->fd, uap->nchanges, uap->nevents,
913 if (ktruioin != NULL) {
914 ktruioin->uio_resid = uap->nchanges * sizeof(struct kevent);
915 ktrgenio(uap->fd, UIO_WRITE, ktruioin, 0);
916 ktruioout->uio_resid = td->td_retval[0] * sizeof(struct kevent);
917 ktrgenio(uap->fd, UIO_READ, ktruioout, error);
925 * Copy 'count' items into the destination list pointed to by uap->eventlist.
928 kevent_copyout(void *arg, struct kevent *kevp, int count)
930 struct kevent_args *uap;
933 KASSERT(count <= KQ_NEVENTS, ("count (%d) > KQ_NEVENTS", count));
934 uap = (struct kevent_args *)arg;
936 error = copyout(kevp, uap->eventlist, count * sizeof *kevp);
938 uap->eventlist += count;
943 * Copy 'count' items from the list pointed to by uap->changelist.
946 kevent_copyin(void *arg, struct kevent *kevp, int count)
948 struct kevent_args *uap;
951 KASSERT(count <= KQ_NEVENTS, ("count (%d) > KQ_NEVENTS", count));
952 uap = (struct kevent_args *)arg;
954 error = copyin(uap->changelist, kevp, count * sizeof *kevp);
956 uap->changelist += count;
961 kern_kevent(struct thread *td, int fd, int nchanges, int nevents,
962 struct kevent_copyops *k_ops, const struct timespec *timeout)
968 cap_rights_init(&rights);
970 cap_rights_set(&rights, CAP_KQUEUE_CHANGE);
972 cap_rights_set(&rights, CAP_KQUEUE_EVENT);
973 error = fget(td, fd, &rights, &fp);
977 error = kern_kevent_fp(td, fp, nchanges, nevents, k_ops, timeout);
984 kqueue_kevent(struct kqueue *kq, struct thread *td, int nchanges, int nevents,
985 struct kevent_copyops *k_ops, const struct timespec *timeout)
987 struct kevent keva[KQ_NEVENTS];
988 struct kevent *kevp, *changes;
989 int i, n, nerrors, error;
992 while (nchanges > 0) {
993 n = nchanges > KQ_NEVENTS ? KQ_NEVENTS : nchanges;
994 error = k_ops->k_copyin(k_ops->arg, keva, n);
998 for (i = 0; i < n; i++) {
1002 kevp->flags &= ~EV_SYSFLAGS;
1003 error = kqueue_register(kq, kevp, td, 1);
1004 if (error || (kevp->flags & EV_RECEIPT)) {
1007 kevp->flags = EV_ERROR;
1009 (void)k_ops->k_copyout(k_ops->arg, kevp, 1);
1017 td->td_retval[0] = nerrors;
1021 return (kqueue_scan(kq, nevents, k_ops, timeout, keva, td));
1025 kern_kevent_fp(struct thread *td, struct file *fp, int nchanges, int nevents,
1026 struct kevent_copyops *k_ops, const struct timespec *timeout)
1031 error = kqueue_acquire(fp, &kq);
1034 error = kqueue_kevent(kq, td, nchanges, nevents, k_ops, timeout);
1035 kqueue_release(kq, 0);
1040 * Performs a kevent() call on a temporarily created kqueue. This can be
1041 * used to perform one-shot polling, similar to poll() and select().
1044 kern_kevent_anonymous(struct thread *td, int nevents,
1045 struct kevent_copyops *k_ops)
1047 struct kqueue kq = {};
1052 error = kqueue_kevent(&kq, td, nevents, nevents, k_ops, NULL);
1053 kqueue_drain(&kq, td);
1054 kqueue_destroy(&kq);
1059 kqueue_add_filteropts(int filt, struct filterops *filtops)
1064 if (filt > 0 || filt + EVFILT_SYSCOUNT < 0) {
1066 "trying to add a filterop that is out of range: %d is beyond %d\n",
1067 ~filt, EVFILT_SYSCOUNT);
1070 mtx_lock(&filterops_lock);
1071 if (sysfilt_ops[~filt].for_fop != &null_filtops &&
1072 sysfilt_ops[~filt].for_fop != NULL)
1075 sysfilt_ops[~filt].for_fop = filtops;
1076 sysfilt_ops[~filt].for_refcnt = 0;
1078 mtx_unlock(&filterops_lock);
1084 kqueue_del_filteropts(int filt)
1089 if (filt > 0 || filt + EVFILT_SYSCOUNT < 0)
1092 mtx_lock(&filterops_lock);
1093 if (sysfilt_ops[~filt].for_fop == &null_filtops ||
1094 sysfilt_ops[~filt].for_fop == NULL)
1096 else if (sysfilt_ops[~filt].for_refcnt != 0)
1099 sysfilt_ops[~filt].for_fop = &null_filtops;
1100 sysfilt_ops[~filt].for_refcnt = 0;
1102 mtx_unlock(&filterops_lock);
1107 static struct filterops *
1108 kqueue_fo_find(int filt)
1111 if (filt > 0 || filt + EVFILT_SYSCOUNT < 0)
1114 if (sysfilt_ops[~filt].for_nolock)
1115 return sysfilt_ops[~filt].for_fop;
1117 mtx_lock(&filterops_lock);
1118 sysfilt_ops[~filt].for_refcnt++;
1119 if (sysfilt_ops[~filt].for_fop == NULL)
1120 sysfilt_ops[~filt].for_fop = &null_filtops;
1121 mtx_unlock(&filterops_lock);
1123 return sysfilt_ops[~filt].for_fop;
1127 kqueue_fo_release(int filt)
1130 if (filt > 0 || filt + EVFILT_SYSCOUNT < 0)
1133 if (sysfilt_ops[~filt].for_nolock)
1136 mtx_lock(&filterops_lock);
1137 KASSERT(sysfilt_ops[~filt].for_refcnt > 0,
1138 ("filter object refcount not valid on release"));
1139 sysfilt_ops[~filt].for_refcnt--;
1140 mtx_unlock(&filterops_lock);
1144 * A ref to kq (obtained via kqueue_acquire) must be held. waitok will
1145 * influence if memory allocation should wait. Make sure it is 0 if you
1149 kqueue_register(struct kqueue *kq, struct kevent *kev, struct thread *td, int waitok)
1151 struct filterops *fops;
1153 struct knote *kn, *tkn;
1155 cap_rights_t rights;
1156 int error, filt, event;
1157 int haskqglobal, filedesc_unlock;
1159 if ((kev->flags & (EV_ENABLE | EV_DISABLE)) == (EV_ENABLE | EV_DISABLE))
1167 filedesc_unlock = 0;
1170 fops = kqueue_fo_find(filt);
1174 if (kev->flags & EV_ADD) {
1176 * Prevent waiting with locks. Non-sleepable
1177 * allocation failures are handled in the loop, only
1178 * if the spare knote appears to be actually required.
1180 tkn = knote_alloc(waitok);
1187 KASSERT(td != NULL, ("td is NULL"));
1188 if (kev->ident > INT_MAX)
1191 error = fget(td, kev->ident,
1192 cap_rights_init(&rights, CAP_EVENT), &fp);
1196 if ((kev->flags & EV_ADD) == EV_ADD && kqueue_expand(kq, fops,
1197 kev->ident, 0) != 0) {
1201 error = kqueue_expand(kq, fops, kev->ident, waitok);
1207 if (fp->f_type == DTYPE_KQUEUE) {
1209 * If we add some intelligence about what we are doing,
1210 * we should be able to support events on ourselves.
1211 * We need to know when we are doing this to prevent
1212 * getting both the knlist lock and the kq lock since
1213 * they are the same thing.
1215 if (fp->f_data == kq) {
1221 * Pre-lock the filedesc before the global
1222 * lock mutex, see the comment in
1225 FILEDESC_XLOCK(td->td_proc->p_fd);
1226 filedesc_unlock = 1;
1227 KQ_GLOBAL_LOCK(&kq_global, haskqglobal);
1231 if (kev->ident < kq->kq_knlistsize) {
1232 SLIST_FOREACH(kn, &kq->kq_knlist[kev->ident], kn_link)
1233 if (kev->filter == kn->kn_filter)
1237 if ((kev->flags & EV_ADD) == EV_ADD)
1238 kqueue_expand(kq, fops, kev->ident, waitok);
1243 * If possible, find an existing knote to use for this kevent.
1245 if (kev->filter == EVFILT_PROC &&
1246 (kev->flags & (EV_FLAG1 | EV_FLAG2)) != 0) {
1247 /* This is an internal creation of a process tracking
1248 * note. Don't attempt to coalesce this with an
1252 } else if (kq->kq_knhashmask != 0) {
1255 list = &kq->kq_knhash[
1256 KN_HASH((u_long)kev->ident, kq->kq_knhashmask)];
1257 SLIST_FOREACH(kn, list, kn_link)
1258 if (kev->ident == kn->kn_id &&
1259 kev->filter == kn->kn_filter)
1264 /* knote is in the process of changing, wait for it to stabilize. */
1265 if (kn != NULL && (kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1266 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1267 if (filedesc_unlock) {
1268 FILEDESC_XUNLOCK(td->td_proc->p_fd);
1269 filedesc_unlock = 0;
1271 kq->kq_state |= KQ_FLUXWAIT;
1272 msleep(kq, &kq->kq_lock, PSOCK | PDROP, "kqflxwt", 0);
1281 * kn now contains the matching knote, or NULL if no match
1284 if (kev->flags & EV_ADD) {
1296 * apply reference counts to knote structure, and
1297 * do not release it at the end of this routine.
1302 kn->kn_sfflags = kev->fflags;
1303 kn->kn_sdata = kev->data;
1306 kn->kn_kevent = *kev;
1307 kn->kn_kevent.flags &= ~(EV_ADD | EV_DELETE |
1308 EV_ENABLE | EV_DISABLE | EV_FORCEONESHOT);
1309 kn->kn_status = KN_INFLUX|KN_DETACHED;
1311 error = knote_attach(kn, kq);
1318 if ((error = kn->kn_fop->f_attach(kn)) != 0) {
1322 knl = kn_list_lock(kn);
1325 /* No matching knote and the EV_ADD flag is not set. */
1332 if (kev->flags & EV_DELETE) {
1333 kn->kn_status |= KN_INFLUX;
1335 if (!(kn->kn_status & KN_DETACHED))
1336 kn->kn_fop->f_detach(kn);
1341 if (kev->flags & EV_FORCEONESHOT) {
1342 kn->kn_flags |= EV_ONESHOT;
1343 KNOTE_ACTIVATE(kn, 1);
1347 * The user may change some filter values after the initial EV_ADD,
1348 * but doing so will not reset any filter which has already been
1351 kn->kn_status |= KN_INFLUX | KN_SCAN;
1353 knl = kn_list_lock(kn);
1354 kn->kn_kevent.udata = kev->udata;
1355 if (!fops->f_isfd && fops->f_touch != NULL) {
1356 fops->f_touch(kn, kev, EVENT_REGISTER);
1358 kn->kn_sfflags = kev->fflags;
1359 kn->kn_sdata = kev->data;
1363 * We can get here with kn->kn_knlist == NULL. This can happen when
1364 * the initial attach event decides that the event is "completed"
1365 * already. i.e. filt_procattach is called on a zombie process. It
1366 * will call filt_proc which will remove it from the list, and NULL
1370 if ((kev->flags & EV_ENABLE) != 0)
1371 kn->kn_status &= ~KN_DISABLED;
1372 else if ((kev->flags & EV_DISABLE) != 0)
1373 kn->kn_status |= KN_DISABLED;
1375 if ((kn->kn_status & KN_DISABLED) == 0)
1376 event = kn->kn_fop->f_event(kn, 0);
1382 kn->kn_status |= KN_ACTIVE;
1383 if ((kn->kn_status & (KN_ACTIVE | KN_DISABLED | KN_QUEUED)) ==
1386 kn->kn_status &= ~(KN_INFLUX | KN_SCAN);
1387 kn_list_unlock(knl);
1391 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1392 if (filedesc_unlock)
1393 FILEDESC_XUNLOCK(td->td_proc->p_fd);
1398 kqueue_fo_release(filt);
1403 kqueue_acquire(struct file *fp, struct kqueue **kqp)
1411 if (fp->f_type != DTYPE_KQUEUE || kq == NULL)
1415 if ((kq->kq_state & KQ_CLOSING) == KQ_CLOSING) {
1426 kqueue_release(struct kqueue *kq, int locked)
1433 if (kq->kq_refcnt == 1)
1434 wakeup(&kq->kq_refcnt);
1440 kqueue_schedtask(struct kqueue *kq)
1444 KASSERT(((kq->kq_state & KQ_TASKDRAIN) != KQ_TASKDRAIN),
1445 ("scheduling kqueue task while draining"));
1447 if ((kq->kq_state & KQ_TASKSCHED) != KQ_TASKSCHED) {
1448 taskqueue_enqueue(taskqueue_kqueue_ctx, &kq->kq_task);
1449 kq->kq_state |= KQ_TASKSCHED;
1454 * Expand the kq to make sure we have storage for fops/ident pair.
1456 * Return 0 on success (or no work necessary), return errno on failure.
1458 * Not calling hashinit w/ waitok (proper malloc flag) should be safe.
1459 * If kqueue_register is called from a non-fd context, there usually/should
1463 kqueue_expand(struct kqueue *kq, struct filterops *fops, uintptr_t ident,
1466 struct klist *list, *tmp_knhash, *to_free;
1467 u_long tmp_knhashmask;
1470 int mflag = waitok ? M_WAITOK : M_NOWAIT;
1477 if (kq->kq_knlistsize <= fd) {
1478 size = kq->kq_knlistsize;
1481 list = malloc(size * sizeof(*list), M_KQUEUE, mflag);
1485 if (kq->kq_knlistsize > fd) {
1489 if (kq->kq_knlist != NULL) {
1490 bcopy(kq->kq_knlist, list,
1491 kq->kq_knlistsize * sizeof(*list));
1492 to_free = kq->kq_knlist;
1493 kq->kq_knlist = NULL;
1495 bzero((caddr_t)list +
1496 kq->kq_knlistsize * sizeof(*list),
1497 (size - kq->kq_knlistsize) * sizeof(*list));
1498 kq->kq_knlistsize = size;
1499 kq->kq_knlist = list;
1504 if (kq->kq_knhashmask == 0) {
1505 tmp_knhash = hashinit(KN_HASHSIZE, M_KQUEUE,
1507 if (tmp_knhash == NULL)
1510 if (kq->kq_knhashmask == 0) {
1511 kq->kq_knhash = tmp_knhash;
1512 kq->kq_knhashmask = tmp_knhashmask;
1514 to_free = tmp_knhash;
1519 free(to_free, M_KQUEUE);
1526 kqueue_task(void *arg, int pending)
1534 KQ_GLOBAL_LOCK(&kq_global, haskqglobal);
1537 KNOTE_LOCKED(&kq->kq_sel.si_note, 0);
1539 kq->kq_state &= ~KQ_TASKSCHED;
1540 if ((kq->kq_state & KQ_TASKDRAIN) == KQ_TASKDRAIN) {
1541 wakeup(&kq->kq_state);
1544 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1548 * Scan, update kn_data (if not ONESHOT), and copyout triggered events.
1549 * We treat KN_MARKER knotes as if they are INFLUX.
1552 kqueue_scan(struct kqueue *kq, int maxevents, struct kevent_copyops *k_ops,
1553 const struct timespec *tsp, struct kevent *keva, struct thread *td)
1555 struct kevent *kevp;
1556 struct knote *kn, *marker;
1558 sbintime_t asbt, rsbt;
1559 int count, error, haskqglobal, influx, nkev, touch;
1571 if (tsp->tv_sec < 0 || tsp->tv_nsec < 0 ||
1572 tsp->tv_nsec >= 1000000000) {
1576 if (timespecisset(tsp)) {
1577 if (tsp->tv_sec <= INT32_MAX) {
1578 rsbt = tstosbt(*tsp);
1579 if (TIMESEL(&asbt, rsbt))
1580 asbt += tc_tick_sbt;
1581 if (asbt <= SBT_MAX - rsbt)
1585 rsbt >>= tc_precexp;
1592 marker = knote_alloc(1);
1593 marker->kn_status = KN_MARKER;
1598 if (kq->kq_count == 0) {
1600 error = EWOULDBLOCK;
1602 kq->kq_state |= KQ_SLEEP;
1603 error = msleep_sbt(kq, &kq->kq_lock, PSOCK | PCATCH,
1604 "kqread", asbt, rsbt, C_ABSOLUTE);
1608 /* don't restart after signals... */
1609 if (error == ERESTART)
1611 else if (error == EWOULDBLOCK)
1616 TAILQ_INSERT_TAIL(&kq->kq_head, marker, kn_tqe);
1620 kn = TAILQ_FIRST(&kq->kq_head);
1622 if ((kn->kn_status == KN_MARKER && kn != marker) ||
1623 (kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1628 kq->kq_state |= KQ_FLUXWAIT;
1629 error = msleep(kq, &kq->kq_lock, PSOCK,
1634 TAILQ_REMOVE(&kq->kq_head, kn, kn_tqe);
1635 if ((kn->kn_status & KN_DISABLED) == KN_DISABLED) {
1636 kn->kn_status &= ~KN_QUEUED;
1642 if (count == maxevents)
1646 KASSERT((kn->kn_status & KN_INFLUX) == 0,
1647 ("KN_INFLUX set when not suppose to be"));
1649 if ((kn->kn_flags & EV_DROP) == EV_DROP) {
1650 kn->kn_status &= ~KN_QUEUED;
1651 kn->kn_status |= KN_INFLUX;
1655 * We don't need to lock the list since we've marked
1658 if (!(kn->kn_status & KN_DETACHED))
1659 kn->kn_fop->f_detach(kn);
1663 } else if ((kn->kn_flags & EV_ONESHOT) == EV_ONESHOT) {
1664 kn->kn_status &= ~KN_QUEUED;
1665 kn->kn_status |= KN_INFLUX;
1669 * We don't need to lock the list since we've marked
1672 *kevp = kn->kn_kevent;
1673 if (!(kn->kn_status & KN_DETACHED))
1674 kn->kn_fop->f_detach(kn);
1679 kn->kn_status |= KN_INFLUX | KN_SCAN;
1681 if ((kn->kn_status & KN_KQUEUE) == KN_KQUEUE)
1682 KQ_GLOBAL_LOCK(&kq_global, haskqglobal);
1683 knl = kn_list_lock(kn);
1684 if (kn->kn_fop->f_event(kn, 0) == 0) {
1686 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1688 ~(KN_QUEUED | KN_ACTIVE | KN_INFLUX |
1691 kn_list_unlock(knl);
1695 touch = (!kn->kn_fop->f_isfd &&
1696 kn->kn_fop->f_touch != NULL);
1698 kn->kn_fop->f_touch(kn, kevp, EVENT_PROCESS);
1700 *kevp = kn->kn_kevent;
1702 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1703 if (kn->kn_flags & (EV_CLEAR | EV_DISPATCH)) {
1705 * Manually clear knotes who weren't
1708 if (touch == 0 && kn->kn_flags & EV_CLEAR) {
1712 if (kn->kn_flags & EV_DISPATCH)
1713 kn->kn_status |= KN_DISABLED;
1714 kn->kn_status &= ~(KN_QUEUED | KN_ACTIVE);
1717 TAILQ_INSERT_TAIL(&kq->kq_head, kn, kn_tqe);
1719 kn->kn_status &= ~(KN_INFLUX | KN_SCAN);
1720 kn_list_unlock(knl);
1724 /* we are returning a copy to the user */
1729 if (nkev == KQ_NEVENTS) {
1732 error = k_ops->k_copyout(k_ops->arg, keva, nkev);
1740 TAILQ_REMOVE(&kq->kq_head, marker, kn_tqe);
1748 error = k_ops->k_copyout(k_ops->arg, keva, nkev);
1749 td->td_retval[0] = maxevents - count;
1755 kqueue_ioctl(struct file *fp, u_long cmd, void *data,
1756 struct ucred *active_cred, struct thread *td)
1759 * Enabling sigio causes two major problems:
1760 * 1) infinite recursion:
1761 * Synopsys: kevent is being used to track signals and have FIOASYNC
1762 * set. On receipt of a signal this will cause a kqueue to recurse
1763 * into itself over and over. Sending the sigio causes the kqueue
1764 * to become ready, which in turn posts sigio again, forever.
1765 * Solution: this can be solved by setting a flag in the kqueue that
1766 * we have a SIGIO in progress.
1767 * 2) locking problems:
1768 * Synopsys: Kqueue is a leaf subsystem, but adding signalling puts
1769 * us above the proc and pgrp locks.
1770 * Solution: Post a signal using an async mechanism, being sure to
1771 * record a generation count in the delivery so that we do not deliver
1772 * a signal to the wrong process.
1774 * Note, these two mechanisms are somewhat mutually exclusive!
1783 kq->kq_state |= KQ_ASYNC;
1785 kq->kq_state &= ~KQ_ASYNC;
1790 return (fsetown(*(int *)data, &kq->kq_sigio));
1793 *(int *)data = fgetown(&kq->kq_sigio);
1803 kqueue_poll(struct file *fp, int events, struct ucred *active_cred,
1810 if ((error = kqueue_acquire(fp, &kq)))
1814 if (events & (POLLIN | POLLRDNORM)) {
1816 revents |= events & (POLLIN | POLLRDNORM);
1818 selrecord(td, &kq->kq_sel);
1819 if (SEL_WAITING(&kq->kq_sel))
1820 kq->kq_state |= KQ_SEL;
1823 kqueue_release(kq, 1);
1830 kqueue_stat(struct file *fp, struct stat *st, struct ucred *active_cred,
1834 bzero((void *)st, sizeof *st);
1836 * We no longer return kq_count because the unlocked value is useless.
1837 * If you spent all this time getting the count, why not spend your
1838 * syscall better by calling kevent?
1840 * XXX - This is needed for libc_r.
1842 st->st_mode = S_IFIFO;
1847 kqueue_drain(struct kqueue *kq, struct thread *td)
1854 KASSERT((kq->kq_state & KQ_CLOSING) != KQ_CLOSING,
1855 ("kqueue already closing"));
1856 kq->kq_state |= KQ_CLOSING;
1857 if (kq->kq_refcnt > 1)
1858 msleep(&kq->kq_refcnt, &kq->kq_lock, PSOCK, "kqclose", 0);
1860 KASSERT(kq->kq_refcnt == 1, ("other refs are out there!"));
1862 KASSERT(knlist_empty(&kq->kq_sel.si_note),
1863 ("kqueue's knlist not empty"));
1865 for (i = 0; i < kq->kq_knlistsize; i++) {
1866 while ((kn = SLIST_FIRST(&kq->kq_knlist[i])) != NULL) {
1867 if ((kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1868 kq->kq_state |= KQ_FLUXWAIT;
1869 msleep(kq, &kq->kq_lock, PSOCK, "kqclo1", 0);
1872 kn->kn_status |= KN_INFLUX;
1874 if (!(kn->kn_status & KN_DETACHED))
1875 kn->kn_fop->f_detach(kn);
1880 if (kq->kq_knhashmask != 0) {
1881 for (i = 0; i <= kq->kq_knhashmask; i++) {
1882 while ((kn = SLIST_FIRST(&kq->kq_knhash[i])) != NULL) {
1883 if ((kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1884 kq->kq_state |= KQ_FLUXWAIT;
1885 msleep(kq, &kq->kq_lock, PSOCK,
1889 kn->kn_status |= KN_INFLUX;
1891 if (!(kn->kn_status & KN_DETACHED))
1892 kn->kn_fop->f_detach(kn);
1899 if ((kq->kq_state & KQ_TASKSCHED) == KQ_TASKSCHED) {
1900 kq->kq_state |= KQ_TASKDRAIN;
1901 msleep(&kq->kq_state, &kq->kq_lock, PSOCK, "kqtqdr", 0);
1904 if ((kq->kq_state & KQ_SEL) == KQ_SEL) {
1905 selwakeuppri(&kq->kq_sel, PSOCK);
1906 if (!SEL_WAITING(&kq->kq_sel))
1907 kq->kq_state &= ~KQ_SEL;
1914 kqueue_destroy(struct kqueue *kq)
1917 KASSERT(kq->kq_fdp == NULL,
1918 ("kqueue still attached to a file descriptor"));
1919 seldrain(&kq->kq_sel);
1920 knlist_destroy(&kq->kq_sel.si_note);
1921 mtx_destroy(&kq->kq_lock);
1923 if (kq->kq_knhash != NULL)
1924 free(kq->kq_knhash, M_KQUEUE);
1925 if (kq->kq_knlist != NULL)
1926 free(kq->kq_knlist, M_KQUEUE);
1928 funsetown(&kq->kq_sigio);
1933 kqueue_close(struct file *fp, struct thread *td)
1935 struct kqueue *kq = fp->f_data;
1936 struct filedesc *fdp;
1938 int filedesc_unlock;
1940 if ((error = kqueue_acquire(fp, &kq)))
1942 kqueue_drain(kq, td);
1945 * We could be called due to the knote_drop() doing fdrop(),
1946 * called from kqueue_register(). In this case the global
1947 * lock is owned, and filedesc sx is locked before, to not
1948 * take the sleepable lock after non-sleepable.
1952 if (!sx_xlocked(FILEDESC_LOCK(fdp))) {
1953 FILEDESC_XLOCK(fdp);
1954 filedesc_unlock = 1;
1956 filedesc_unlock = 0;
1957 TAILQ_REMOVE(&fdp->fd_kqlist, kq, kq_list);
1958 if (filedesc_unlock)
1959 FILEDESC_XUNLOCK(fdp);
1962 chgkqcnt(kq->kq_cred->cr_ruidinfo, -1, 0);
1963 crfree(kq->kq_cred);
1971 kqueue_fill_kinfo(struct file *fp, struct kinfo_file *kif, struct filedesc *fdp)
1974 kif->kf_type = KF_TYPE_KQUEUE;
1979 kqueue_wakeup(struct kqueue *kq)
1983 if ((kq->kq_state & KQ_SLEEP) == KQ_SLEEP) {
1984 kq->kq_state &= ~KQ_SLEEP;
1987 if ((kq->kq_state & KQ_SEL) == KQ_SEL) {
1988 selwakeuppri(&kq->kq_sel, PSOCK);
1989 if (!SEL_WAITING(&kq->kq_sel))
1990 kq->kq_state &= ~KQ_SEL;
1992 if (!knlist_empty(&kq->kq_sel.si_note))
1993 kqueue_schedtask(kq);
1994 if ((kq->kq_state & KQ_ASYNC) == KQ_ASYNC) {
1995 pgsigio(&kq->kq_sigio, SIGIO, 0);
2000 * Walk down a list of knotes, activating them if their event has triggered.
2002 * There is a possibility to optimize in the case of one kq watching another.
2003 * Instead of scheduling a task to wake it up, you could pass enough state
2004 * down the chain to make up the parent kqueue. Make this code functional
2008 knote(struct knlist *list, long hint, int lockflags)
2011 struct knote *kn, *tkn;
2018 KNL_ASSERT_LOCK(list, lockflags & KNF_LISTLOCKED);
2020 if ((lockflags & KNF_LISTLOCKED) == 0)
2021 list->kl_lock(list->kl_lockarg);
2024 * If we unlock the list lock (and set KN_INFLUX), we can
2025 * eliminate the kqueue scheduling, but this will introduce
2026 * four lock/unlock's for each knote to test. Also, marker
2027 * would be needed to keep iteration position, since filters
2028 * or other threads could remove events.
2030 SLIST_FOREACH_SAFE(kn, &list->kl_list, kn_selnext, tkn) {
2033 if ((kn->kn_status & (KN_INFLUX | KN_SCAN)) == KN_INFLUX) {
2035 * Do not process the influx notes, except for
2036 * the influx coming from the kq unlock in the
2037 * kqueue_scan(). In the later case, we do
2038 * not interfere with the scan, since the code
2039 * fragment in kqueue_scan() locks the knlist,
2040 * and cannot proceed until we finished.
2043 } else if ((lockflags & KNF_NOKQLOCK) != 0) {
2044 own_influx = (kn->kn_status & KN_INFLUX) == 0;
2046 kn->kn_status |= KN_INFLUX;
2048 error = kn->kn_fop->f_event(kn, hint);
2051 kn->kn_status &= ~KN_INFLUX;
2053 KNOTE_ACTIVATE(kn, 1);
2056 kn->kn_status |= KN_HASKQLOCK;
2057 if (kn->kn_fop->f_event(kn, hint))
2058 KNOTE_ACTIVATE(kn, 1);
2059 kn->kn_status &= ~KN_HASKQLOCK;
2063 if ((lockflags & KNF_LISTLOCKED) == 0)
2064 list->kl_unlock(list->kl_lockarg);
2068 * add a knote to a knlist
2071 knlist_add(struct knlist *knl, struct knote *kn, int islocked)
2073 KNL_ASSERT_LOCK(knl, islocked);
2074 KQ_NOTOWNED(kn->kn_kq);
2075 KASSERT((kn->kn_status & (KN_INFLUX|KN_DETACHED)) ==
2076 (KN_INFLUX|KN_DETACHED), ("knote not KN_INFLUX and KN_DETACHED"));
2078 knl->kl_lock(knl->kl_lockarg);
2079 SLIST_INSERT_HEAD(&knl->kl_list, kn, kn_selnext);
2081 knl->kl_unlock(knl->kl_lockarg);
2083 kn->kn_knlist = knl;
2084 kn->kn_status &= ~KN_DETACHED;
2085 KQ_UNLOCK(kn->kn_kq);
2089 knlist_remove_kq(struct knlist *knl, struct knote *kn, int knlislocked,
2092 KASSERT(!(!!kqislocked && !knlislocked), ("kq locked w/o knl locked"));
2093 KNL_ASSERT_LOCK(knl, knlislocked);
2094 mtx_assert(&kn->kn_kq->kq_lock, kqislocked ? MA_OWNED : MA_NOTOWNED);
2096 KASSERT((kn->kn_status & (KN_INFLUX|KN_DETACHED)) == KN_INFLUX,
2097 ("knlist_remove called w/o knote being KN_INFLUX or already removed"));
2099 knl->kl_lock(knl->kl_lockarg);
2100 SLIST_REMOVE(&knl->kl_list, kn, knote, kn_selnext);
2101 kn->kn_knlist = NULL;
2103 kn_list_unlock(knl);
2106 kn->kn_status |= KN_DETACHED;
2108 KQ_UNLOCK(kn->kn_kq);
2112 * remove knote from the specified knlist
2115 knlist_remove(struct knlist *knl, struct knote *kn, int islocked)
2118 knlist_remove_kq(knl, kn, islocked, 0);
2122 knlist_empty(struct knlist *knl)
2125 KNL_ASSERT_LOCKED(knl);
2126 return (SLIST_EMPTY(&knl->kl_list));
2129 static struct mtx knlist_lock;
2130 MTX_SYSINIT(knlist_lock, &knlist_lock, "knlist lock for lockless objects",
2132 static void knlist_mtx_lock(void *arg);
2133 static void knlist_mtx_unlock(void *arg);
2136 knlist_mtx_lock(void *arg)
2139 mtx_lock((struct mtx *)arg);
2143 knlist_mtx_unlock(void *arg)
2146 mtx_unlock((struct mtx *)arg);
2150 knlist_mtx_assert_locked(void *arg)
2153 mtx_assert((struct mtx *)arg, MA_OWNED);
2157 knlist_mtx_assert_unlocked(void *arg)
2160 mtx_assert((struct mtx *)arg, MA_NOTOWNED);
2164 knlist_rw_rlock(void *arg)
2167 rw_rlock((struct rwlock *)arg);
2171 knlist_rw_runlock(void *arg)
2174 rw_runlock((struct rwlock *)arg);
2178 knlist_rw_assert_locked(void *arg)
2181 rw_assert((struct rwlock *)arg, RA_LOCKED);
2185 knlist_rw_assert_unlocked(void *arg)
2188 rw_assert((struct rwlock *)arg, RA_UNLOCKED);
2192 knlist_init(struct knlist *knl, void *lock, void (*kl_lock)(void *),
2193 void (*kl_unlock)(void *),
2194 void (*kl_assert_locked)(void *), void (*kl_assert_unlocked)(void *))
2198 knl->kl_lockarg = &knlist_lock;
2200 knl->kl_lockarg = lock;
2202 if (kl_lock == NULL)
2203 knl->kl_lock = knlist_mtx_lock;
2205 knl->kl_lock = kl_lock;
2206 if (kl_unlock == NULL)
2207 knl->kl_unlock = knlist_mtx_unlock;
2209 knl->kl_unlock = kl_unlock;
2210 if (kl_assert_locked == NULL)
2211 knl->kl_assert_locked = knlist_mtx_assert_locked;
2213 knl->kl_assert_locked = kl_assert_locked;
2214 if (kl_assert_unlocked == NULL)
2215 knl->kl_assert_unlocked = knlist_mtx_assert_unlocked;
2217 knl->kl_assert_unlocked = kl_assert_unlocked;
2219 knl->kl_autodestroy = 0;
2220 SLIST_INIT(&knl->kl_list);
2224 knlist_init_mtx(struct knlist *knl, struct mtx *lock)
2227 knlist_init(knl, lock, NULL, NULL, NULL, NULL);
2231 knlist_alloc(struct mtx *lock)
2235 knl = malloc(sizeof(struct knlist), M_KQUEUE, M_WAITOK);
2236 knlist_init_mtx(knl, lock);
2241 knlist_init_rw_reader(struct knlist *knl, struct rwlock *lock)
2244 knlist_init(knl, lock, knlist_rw_rlock, knlist_rw_runlock,
2245 knlist_rw_assert_locked, knlist_rw_assert_unlocked);
2249 knlist_destroy(struct knlist *knl)
2252 KASSERT(KNLIST_EMPTY(knl),
2253 ("destroying knlist %p with knotes on it", knl));
2257 knlist_detach(struct knlist *knl)
2260 KNL_ASSERT_LOCKED(knl);
2261 knl->kl_autodestroy = 1;
2262 if (knlist_empty(knl)) {
2263 knlist_destroy(knl);
2264 free(knl, M_KQUEUE);
2269 * Even if we are locked, we may need to drop the lock to allow any influx
2270 * knotes time to "settle".
2273 knlist_cleardel(struct knlist *knl, struct thread *td, int islocked, int killkn)
2275 struct knote *kn, *kn2;
2278 KASSERT(!knl->kl_autodestroy, ("cleardel for autodestroy %p", knl));
2280 KNL_ASSERT_LOCKED(knl);
2282 KNL_ASSERT_UNLOCKED(knl);
2283 again: /* need to reacquire lock since we have dropped it */
2284 knl->kl_lock(knl->kl_lockarg);
2287 SLIST_FOREACH_SAFE(kn, &knl->kl_list, kn_selnext, kn2) {
2290 if ((kn->kn_status & KN_INFLUX)) {
2294 knlist_remove_kq(knl, kn, 1, 1);
2296 kn->kn_status |= KN_INFLUX | KN_DETACHED;
2300 /* Make sure cleared knotes disappear soon */
2301 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
2307 if (!SLIST_EMPTY(&knl->kl_list)) {
2308 /* there are still KN_INFLUX remaining */
2309 kn = SLIST_FIRST(&knl->kl_list);
2312 KASSERT(kn->kn_status & KN_INFLUX,
2313 ("knote removed w/o list lock"));
2314 knl->kl_unlock(knl->kl_lockarg);
2315 kq->kq_state |= KQ_FLUXWAIT;
2316 msleep(kq, &kq->kq_lock, PSOCK | PDROP, "kqkclr", 0);
2322 KNL_ASSERT_LOCKED(knl);
2324 knl->kl_unlock(knl->kl_lockarg);
2325 KNL_ASSERT_UNLOCKED(knl);
2330 * Remove all knotes referencing a specified fd must be called with FILEDESC
2331 * lock. This prevents a race where a new fd comes along and occupies the
2332 * entry and we attach a knote to the fd.
2335 knote_fdclose(struct thread *td, int fd)
2337 struct filedesc *fdp = td->td_proc->p_fd;
2342 FILEDESC_XLOCK_ASSERT(fdp);
2345 * We shouldn't have to worry about new kevents appearing on fd
2346 * since filedesc is locked.
2348 TAILQ_FOREACH(kq, &fdp->fd_kqlist, kq_list) {
2353 while (kq->kq_knlistsize > fd &&
2354 (kn = SLIST_FIRST(&kq->kq_knlist[fd])) != NULL) {
2355 if (kn->kn_status & KN_INFLUX) {
2356 /* someone else might be waiting on our knote */
2359 kq->kq_state |= KQ_FLUXWAIT;
2360 msleep(kq, &kq->kq_lock, PSOCK, "kqflxwt", 0);
2363 kn->kn_status |= KN_INFLUX;
2365 if (!(kn->kn_status & KN_DETACHED))
2366 kn->kn_fop->f_detach(kn);
2376 knote_attach(struct knote *kn, struct kqueue *kq)
2380 KASSERT(kn->kn_status & KN_INFLUX, ("knote not marked INFLUX"));
2383 if (kn->kn_fop->f_isfd) {
2384 if (kn->kn_id >= kq->kq_knlistsize)
2386 list = &kq->kq_knlist[kn->kn_id];
2388 if (kq->kq_knhash == NULL)
2390 list = &kq->kq_knhash[KN_HASH(kn->kn_id, kq->kq_knhashmask)];
2392 SLIST_INSERT_HEAD(list, kn, kn_link);
2397 * knote must already have been detached using the f_detach method.
2398 * no lock need to be held, it is assumed that the KN_INFLUX flag is set
2399 * to prevent other removal.
2402 knote_drop(struct knote *kn, struct thread *td)
2410 KASSERT((kn->kn_status & KN_INFLUX) == KN_INFLUX,
2411 ("knote_drop called without KN_INFLUX set in kn_status"));
2414 if (kn->kn_fop->f_isfd)
2415 list = &kq->kq_knlist[kn->kn_id];
2417 list = &kq->kq_knhash[KN_HASH(kn->kn_id, kq->kq_knhashmask)];
2419 if (!SLIST_EMPTY(list))
2420 SLIST_REMOVE(list, kn, knote, kn_link);
2421 if (kn->kn_status & KN_QUEUED)
2425 if (kn->kn_fop->f_isfd) {
2426 fdrop(kn->kn_fp, td);
2429 kqueue_fo_release(kn->kn_kevent.filter);
2435 knote_enqueue(struct knote *kn)
2437 struct kqueue *kq = kn->kn_kq;
2439 KQ_OWNED(kn->kn_kq);
2440 KASSERT((kn->kn_status & KN_QUEUED) == 0, ("knote already queued"));
2442 TAILQ_INSERT_TAIL(&kq->kq_head, kn, kn_tqe);
2443 kn->kn_status |= KN_QUEUED;
2449 knote_dequeue(struct knote *kn)
2451 struct kqueue *kq = kn->kn_kq;
2453 KQ_OWNED(kn->kn_kq);
2454 KASSERT(kn->kn_status & KN_QUEUED, ("knote not queued"));
2456 TAILQ_REMOVE(&kq->kq_head, kn, kn_tqe);
2457 kn->kn_status &= ~KN_QUEUED;
2465 knote_zone = uma_zcreate("KNOTE", sizeof(struct knote), NULL, NULL,
2466 NULL, NULL, UMA_ALIGN_PTR, 0);
2468 SYSINIT(knote, SI_SUB_PSEUDO, SI_ORDER_ANY, knote_init, NULL);
2470 static struct knote *
2471 knote_alloc(int waitok)
2474 return (uma_zalloc(knote_zone, (waitok ? M_WAITOK : M_NOWAIT) |
2479 knote_free(struct knote *kn)
2482 uma_zfree(knote_zone, kn);
2486 * Register the kev w/ the kq specified by fd.
2489 kqfd_register(int fd, struct kevent *kev, struct thread *td, int waitok)
2493 cap_rights_t rights;
2496 error = fget(td, fd, cap_rights_init(&rights, CAP_KQUEUE_CHANGE), &fp);
2499 if ((error = kqueue_acquire(fp, &kq)) != 0)
2502 error = kqueue_register(kq, kev, td, waitok);
2503 kqueue_release(kq, 0);