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"
34 #include <sys/param.h>
35 #include <sys/systm.h>
36 #include <sys/capsicum.h>
37 #include <sys/kernel.h>
39 #include <sys/mutex.h>
40 #include <sys/rwlock.h>
42 #include <sys/malloc.h>
43 #include <sys/unistd.h>
45 #include <sys/filedesc.h>
46 #include <sys/filio.h>
47 #include <sys/fcntl.h>
48 #include <sys/kthread.h>
49 #include <sys/selinfo.h>
50 #include <sys/stdatomic.h>
51 #include <sys/queue.h>
52 #include <sys/event.h>
53 #include <sys/eventvar.h>
55 #include <sys/protosw.h>
56 #include <sys/sigio.h>
57 #include <sys/signalvar.h>
58 #include <sys/socket.h>
59 #include <sys/socketvar.h>
61 #include <sys/sysctl.h>
62 #include <sys/sysproto.h>
63 #include <sys/syscallsubr.h>
64 #include <sys/taskqueue.h>
67 #include <sys/ktrace.h>
72 static MALLOC_DEFINE(M_KQUEUE, "kqueue", "memory for kqueue system");
75 * This lock is used if multiple kq locks are required. This possibly
76 * should be made into a per proc lock.
78 static struct mtx kq_global;
79 MTX_SYSINIT(kq_global, &kq_global, "kqueue order", MTX_DEF);
80 #define KQ_GLOBAL_LOCK(lck, haslck) do { \
85 #define KQ_GLOBAL_UNLOCK(lck, haslck) do { \
91 TASKQUEUE_DEFINE_THREAD(kqueue);
93 static int kevent_copyout(void *arg, struct kevent *kevp, int count);
94 static int kevent_copyin(void *arg, struct kevent *kevp, int count);
95 static int kqueue_register(struct kqueue *kq, struct kevent *kev,
96 struct thread *td, int waitok);
97 static int kqueue_acquire(struct file *fp, struct kqueue **kqp);
98 static void kqueue_release(struct kqueue *kq, int locked);
99 static int kqueue_expand(struct kqueue *kq, struct filterops *fops,
100 uintptr_t ident, int waitok);
101 static void kqueue_task(void *arg, int pending);
102 static int kqueue_scan(struct kqueue *kq, int maxevents,
103 struct kevent_copyops *k_ops,
104 const struct timespec *timeout,
105 struct kevent *keva, struct thread *td);
106 static void kqueue_wakeup(struct kqueue *kq);
107 static struct filterops *kqueue_fo_find(int filt);
108 static void kqueue_fo_release(int filt);
110 static fo_rdwr_t kqueue_read;
111 static fo_rdwr_t kqueue_write;
112 static fo_truncate_t kqueue_truncate;
113 static fo_ioctl_t kqueue_ioctl;
114 static fo_poll_t kqueue_poll;
115 static fo_kqfilter_t kqueue_kqfilter;
116 static fo_stat_t kqueue_stat;
117 static fo_close_t kqueue_close;
119 static struct fileops kqueueops = {
120 .fo_read = kqueue_read,
121 .fo_write = kqueue_write,
122 .fo_truncate = kqueue_truncate,
123 .fo_ioctl = kqueue_ioctl,
124 .fo_poll = kqueue_poll,
125 .fo_kqfilter = kqueue_kqfilter,
126 .fo_stat = kqueue_stat,
127 .fo_close = kqueue_close,
128 .fo_chmod = invfo_chmod,
129 .fo_chown = invfo_chown,
130 .fo_sendfile = invfo_sendfile,
133 static int knote_attach(struct knote *kn, struct kqueue *kq);
134 static void knote_drop(struct knote *kn, struct thread *td);
135 static void knote_enqueue(struct knote *kn);
136 static void knote_dequeue(struct knote *kn);
137 static void knote_init(void);
138 static struct knote *knote_alloc(int waitok);
139 static void knote_free(struct knote *kn);
141 static void filt_kqdetach(struct knote *kn);
142 static int filt_kqueue(struct knote *kn, long hint);
143 static int filt_procattach(struct knote *kn);
144 static void filt_procdetach(struct knote *kn);
145 static int filt_proc(struct knote *kn, long hint);
146 static int filt_fileattach(struct knote *kn);
147 static void filt_timerexpire(void *knx);
148 static int filt_timerattach(struct knote *kn);
149 static void filt_timerdetach(struct knote *kn);
150 static int filt_timer(struct knote *kn, long hint);
151 static int filt_userattach(struct knote *kn);
152 static void filt_userdetach(struct knote *kn);
153 static int filt_user(struct knote *kn, long hint);
154 static void filt_usertouch(struct knote *kn, struct kevent *kev,
157 static struct filterops file_filtops = {
159 .f_attach = filt_fileattach,
161 static struct filterops kqread_filtops = {
163 .f_detach = filt_kqdetach,
164 .f_event = filt_kqueue,
166 /* XXX - move to kern_proc.c? */
167 static struct filterops proc_filtops = {
169 .f_attach = filt_procattach,
170 .f_detach = filt_procdetach,
171 .f_event = filt_proc,
173 static struct filterops timer_filtops = {
175 .f_attach = filt_timerattach,
176 .f_detach = filt_timerdetach,
177 .f_event = filt_timer,
179 static struct filterops user_filtops = {
180 .f_attach = filt_userattach,
181 .f_detach = filt_userdetach,
182 .f_event = filt_user,
183 .f_touch = filt_usertouch,
186 static uma_zone_t knote_zone;
187 static atomic_uint kq_ncallouts = ATOMIC_VAR_INIT(0);
188 static unsigned int kq_calloutmax = 4 * 1024;
189 SYSCTL_UINT(_kern, OID_AUTO, kq_calloutmax, CTLFLAG_RW,
190 &kq_calloutmax, 0, "Maximum number of callouts allocated for kqueue");
192 /* XXX - ensure not KN_INFLUX?? */
193 #define KNOTE_ACTIVATE(kn, islock) do { \
195 mtx_assert(&(kn)->kn_kq->kq_lock, MA_OWNED); \
197 KQ_LOCK((kn)->kn_kq); \
198 (kn)->kn_status |= KN_ACTIVE; \
199 if (((kn)->kn_status & (KN_QUEUED | KN_DISABLED)) == 0) \
200 knote_enqueue((kn)); \
202 KQ_UNLOCK((kn)->kn_kq); \
204 #define KQ_LOCK(kq) do { \
205 mtx_lock(&(kq)->kq_lock); \
207 #define KQ_FLUX_WAKEUP(kq) do { \
208 if (((kq)->kq_state & KQ_FLUXWAIT) == KQ_FLUXWAIT) { \
209 (kq)->kq_state &= ~KQ_FLUXWAIT; \
213 #define KQ_UNLOCK_FLUX(kq) do { \
214 KQ_FLUX_WAKEUP(kq); \
215 mtx_unlock(&(kq)->kq_lock); \
217 #define KQ_UNLOCK(kq) do { \
218 mtx_unlock(&(kq)->kq_lock); \
220 #define KQ_OWNED(kq) do { \
221 mtx_assert(&(kq)->kq_lock, MA_OWNED); \
223 #define KQ_NOTOWNED(kq) do { \
224 mtx_assert(&(kq)->kq_lock, MA_NOTOWNED); \
226 #define KN_LIST_LOCK(kn) do { \
227 if (kn->kn_knlist != NULL) \
228 kn->kn_knlist->kl_lock(kn->kn_knlist->kl_lockarg); \
230 #define KN_LIST_UNLOCK(kn) do { \
231 if (kn->kn_knlist != NULL) \
232 kn->kn_knlist->kl_unlock(kn->kn_knlist->kl_lockarg); \
234 #define KNL_ASSERT_LOCK(knl, islocked) do { \
236 KNL_ASSERT_LOCKED(knl); \
238 KNL_ASSERT_UNLOCKED(knl); \
241 #define KNL_ASSERT_LOCKED(knl) do { \
242 knl->kl_assert_locked((knl)->kl_lockarg); \
244 #define KNL_ASSERT_UNLOCKED(knl) do { \
245 knl->kl_assert_unlocked((knl)->kl_lockarg); \
247 #else /* !INVARIANTS */
248 #define KNL_ASSERT_LOCKED(knl) do {} while(0)
249 #define KNL_ASSERT_UNLOCKED(knl) do {} while (0)
250 #endif /* INVARIANTS */
252 #define KN_HASHSIZE 64 /* XXX should be tunable */
253 #define KN_HASH(val, mask) (((val) ^ (val >> 8)) & (mask))
256 filt_nullattach(struct knote *kn)
262 struct filterops null_filtops = {
264 .f_attach = filt_nullattach,
267 /* XXX - make SYSINIT to add these, and move into respective modules. */
268 extern struct filterops sig_filtops;
269 extern struct filterops fs_filtops;
272 * Table for for all system-defined filters.
274 static struct mtx filterops_lock;
275 MTX_SYSINIT(kqueue_filterops, &filterops_lock, "protect sysfilt_ops",
278 struct filterops *for_fop;
280 } sysfilt_ops[EVFILT_SYSCOUNT] = {
281 { &file_filtops }, /* EVFILT_READ */
282 { &file_filtops }, /* EVFILT_WRITE */
283 { &null_filtops }, /* EVFILT_AIO */
284 { &file_filtops }, /* EVFILT_VNODE */
285 { &proc_filtops }, /* EVFILT_PROC */
286 { &sig_filtops }, /* EVFILT_SIGNAL */
287 { &timer_filtops }, /* EVFILT_TIMER */
288 { &null_filtops }, /* former EVFILT_NETDEV */
289 { &fs_filtops }, /* EVFILT_FS */
290 { &null_filtops }, /* EVFILT_LIO */
291 { &user_filtops }, /* EVFILT_USER */
295 * Simple redirection for all cdevsw style objects to call their fo_kqfilter
299 filt_fileattach(struct knote *kn)
302 return (fo_kqfilter(kn->kn_fp, kn));
307 kqueue_kqfilter(struct file *fp, struct knote *kn)
309 struct kqueue *kq = kn->kn_fp->f_data;
311 if (kn->kn_filter != EVFILT_READ)
314 kn->kn_status |= KN_KQUEUE;
315 kn->kn_fop = &kqread_filtops;
316 knlist_add(&kq->kq_sel.si_note, kn, 0);
322 filt_kqdetach(struct knote *kn)
324 struct kqueue *kq = kn->kn_fp->f_data;
326 knlist_remove(&kq->kq_sel.si_note, kn, 0);
331 filt_kqueue(struct knote *kn, long hint)
333 struct kqueue *kq = kn->kn_fp->f_data;
335 kn->kn_data = kq->kq_count;
336 return (kn->kn_data > 0);
339 /* XXX - move to kern_proc.c? */
341 filt_procattach(struct knote *kn)
348 p = pfind(kn->kn_id);
349 if (p == NULL && (kn->kn_sfflags & NOTE_EXIT)) {
350 p = zpfind(kn->kn_id);
352 } else if (p != NULL && (p->p_flag & P_WEXIT)) {
358 if ((error = p_cansee(curthread, p))) {
363 kn->kn_ptr.p_proc = p;
364 kn->kn_flags |= EV_CLEAR; /* automatically set */
367 * Internal flag indicating registration done by kernel for the
368 * purposes of getting a NOTE_CHILD notification.
370 if (kn->kn_flags & EV_FLAG2) {
371 kn->kn_flags &= ~EV_FLAG2;
372 kn->kn_data = kn->kn_sdata; /* ppid */
373 kn->kn_fflags = NOTE_CHILD;
374 kn->kn_sfflags &= ~NOTE_EXIT;
375 immediate = 1; /* Force immediate activation of child note. */
378 * Internal flag indicating registration done by kernel (for other than
381 if (kn->kn_flags & EV_FLAG1) {
382 kn->kn_flags &= ~EV_FLAG1;
386 knlist_add(&p->p_klist, kn, 1);
389 * Immediately activate any child notes or, in the case of a zombie
390 * target process, exit notes. The latter is necessary to handle the
391 * case where the target process, e.g. a child, dies before the kevent
394 if (immediate && filt_proc(kn, NOTE_EXIT))
395 KNOTE_ACTIVATE(kn, 0);
403 * The knote may be attached to a different process, which may exit,
404 * leaving nothing for the knote to be attached to. So when the process
405 * exits, the knote is marked as DETACHED and also flagged as ONESHOT so
406 * it will be deleted when read out. However, as part of the knote deletion,
407 * this routine is called, so a check is needed to avoid actually performing
408 * a detach, because the original process does not exist any more.
410 /* XXX - move to kern_proc.c? */
412 filt_procdetach(struct knote *kn)
416 p = kn->kn_ptr.p_proc;
417 knlist_remove(&p->p_klist, kn, 0);
418 kn->kn_ptr.p_proc = NULL;
421 /* XXX - move to kern_proc.c? */
423 filt_proc(struct knote *kn, long hint)
425 struct proc *p = kn->kn_ptr.p_proc;
429 * mask off extra data
431 event = (u_int)hint & NOTE_PCTRLMASK;
434 * if the user is interested in this event, record it.
436 if (kn->kn_sfflags & event)
437 kn->kn_fflags |= event;
440 * process is gone, so flag the event as finished.
442 if (event == NOTE_EXIT) {
443 if (!(kn->kn_status & KN_DETACHED))
444 knlist_remove_inevent(&p->p_klist, kn);
445 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
446 kn->kn_ptr.p_proc = NULL;
447 if (kn->kn_fflags & NOTE_EXIT)
448 kn->kn_data = p->p_xstat;
449 if (kn->kn_fflags == 0)
450 kn->kn_flags |= EV_DROP;
454 return (kn->kn_fflags != 0);
458 * Called when the process forked. It mostly does the same as the
459 * knote(), activating all knotes registered to be activated when the
460 * process forked. Additionally, for each knote attached to the
461 * parent, check whether user wants to track the new process. If so
462 * attach a new knote to it, and immediately report an event with the
466 knote_fork(struct knlist *list, int pid)
475 list->kl_lock(list->kl_lockarg);
477 SLIST_FOREACH(kn, &list->kl_list, kn_selnext) {
478 if ((kn->kn_status & KN_INFLUX) == KN_INFLUX)
482 if ((kn->kn_status & (KN_INFLUX | KN_SCAN)) == KN_INFLUX) {
488 * The same as knote(), activate the event.
490 if ((kn->kn_sfflags & NOTE_TRACK) == 0) {
491 kn->kn_status |= KN_HASKQLOCK;
492 if (kn->kn_fop->f_event(kn, NOTE_FORK))
493 KNOTE_ACTIVATE(kn, 1);
494 kn->kn_status &= ~KN_HASKQLOCK;
500 * The NOTE_TRACK case. In addition to the activation
501 * of the event, we need to register new events to
502 * track the child. Drop the locks in preparation for
503 * the call to kqueue_register().
505 kn->kn_status |= KN_INFLUX;
507 list->kl_unlock(list->kl_lockarg);
510 * Activate existing knote and register tracking knotes with
513 * First register a knote to get just the child notice. This
514 * must be a separate note from a potential NOTE_EXIT
515 * notification since both NOTE_CHILD and NOTE_EXIT are defined
516 * to use the data field (in conflicting ways).
519 kev.filter = kn->kn_filter;
520 kev.flags = kn->kn_flags | EV_ADD | EV_ENABLE | EV_ONESHOT | EV_FLAG2;
521 kev.fflags = kn->kn_sfflags;
522 kev.data = kn->kn_id; /* parent */
523 kev.udata = kn->kn_kevent.udata;/* preserve udata */
524 error = kqueue_register(kq, &kev, NULL, 0);
526 kn->kn_fflags |= NOTE_TRACKERR;
529 * Then register another knote to track other potential events
530 * from the new process.
533 kev.filter = kn->kn_filter;
534 kev.flags = kn->kn_flags | EV_ADD | EV_ENABLE | EV_FLAG1;
535 kev.fflags = kn->kn_sfflags;
536 kev.data = kn->kn_id; /* parent */
537 kev.udata = kn->kn_kevent.udata;/* preserve udata */
538 error = kqueue_register(kq, &kev, NULL, 0);
540 kn->kn_fflags |= NOTE_TRACKERR;
541 if (kn->kn_fop->f_event(kn, NOTE_FORK))
542 KNOTE_ACTIVATE(kn, 0);
544 kn->kn_status &= ~KN_INFLUX;
546 list->kl_lock(list->kl_lockarg);
548 list->kl_unlock(list->kl_lockarg);
552 * XXX: EVFILT_TIMER should perhaps live in kern_time.c beside the
553 * interval timer support code.
556 #define NOTE_TIMER_PRECMASK (NOTE_SECONDS|NOTE_MSECONDS|NOTE_USECONDS| \
559 static __inline sbintime_t
560 timer2sbintime(intptr_t data, int flags)
564 switch (flags & NOTE_TIMER_PRECMASK) {
568 case NOTE_MSECONDS: /* FALLTHROUGH */
583 if (data > SBT_MAX / modifier)
586 return (modifier * data);
590 filt_timerexpire(void *knx)
592 struct callout *calloutp;
597 KNOTE_ACTIVATE(kn, 0); /* XXX - handle locking */
599 if ((kn->kn_flags & EV_ONESHOT) != EV_ONESHOT) {
600 calloutp = (struct callout *)kn->kn_hook;
601 *kn->kn_ptr.p_nexttime += timer2sbintime(kn->kn_sdata,
603 callout_reset_sbt_on(calloutp, *kn->kn_ptr.p_nexttime, 0,
604 filt_timerexpire, kn, PCPU_GET(cpuid), C_ABSOLUTE);
609 * data contains amount of time to sleep
612 filt_timerattach(struct knote *kn)
614 struct callout *calloutp;
616 unsigned int ncallouts;
618 if ((intptr_t)kn->kn_sdata < 0)
620 if ((intptr_t)kn->kn_sdata == 0 && (kn->kn_flags & EV_ONESHOT) == 0)
622 /* Only precision unit are supported in flags so far */
623 if (kn->kn_sfflags & ~NOTE_TIMER_PRECMASK)
626 to = timer2sbintime(kn->kn_sdata, kn->kn_sfflags);
630 ncallouts = atomic_load_explicit(&kq_ncallouts, memory_order_relaxed);
632 if (ncallouts >= kq_calloutmax)
634 } while (!atomic_compare_exchange_weak_explicit(&kq_ncallouts,
635 &ncallouts, ncallouts + 1, memory_order_relaxed,
636 memory_order_relaxed));
638 kn->kn_flags |= EV_CLEAR; /* automatically set */
639 kn->kn_status &= ~KN_DETACHED; /* knlist_add clears it */
640 kn->kn_ptr.p_nexttime = malloc(sizeof(sbintime_t), M_KQUEUE, M_WAITOK);
641 calloutp = malloc(sizeof(*calloutp), M_KQUEUE, M_WAITOK);
642 callout_init(calloutp, CALLOUT_MPSAFE);
643 kn->kn_hook = calloutp;
644 *kn->kn_ptr.p_nexttime = to + sbinuptime();
645 callout_reset_sbt_on(calloutp, *kn->kn_ptr.p_nexttime, 0,
646 filt_timerexpire, kn, PCPU_GET(cpuid), C_ABSOLUTE);
652 filt_timerdetach(struct knote *kn)
654 struct callout *calloutp;
657 calloutp = (struct callout *)kn->kn_hook;
658 callout_drain(calloutp);
659 free(calloutp, M_KQUEUE);
660 free(kn->kn_ptr.p_nexttime, M_KQUEUE);
661 old = atomic_fetch_sub_explicit(&kq_ncallouts, 1, memory_order_relaxed);
662 KASSERT(old > 0, ("Number of callouts cannot become negative"));
663 kn->kn_status |= KN_DETACHED; /* knlist_remove sets it */
667 filt_timer(struct knote *kn, long hint)
670 return (kn->kn_data != 0);
674 filt_userattach(struct knote *kn)
678 * EVFILT_USER knotes are not attached to anything in the kernel.
681 if (kn->kn_fflags & NOTE_TRIGGER)
689 filt_userdetach(__unused struct knote *kn)
693 * EVFILT_USER knotes are not attached to anything in the kernel.
698 filt_user(struct knote *kn, __unused long hint)
701 return (kn->kn_hookid);
705 filt_usertouch(struct knote *kn, struct kevent *kev, u_long type)
711 if (kev->fflags & NOTE_TRIGGER)
714 ffctrl = kev->fflags & NOTE_FFCTRLMASK;
715 kev->fflags &= NOTE_FFLAGSMASK;
721 kn->kn_sfflags &= kev->fflags;
725 kn->kn_sfflags |= kev->fflags;
729 kn->kn_sfflags = kev->fflags;
733 /* XXX Return error? */
736 kn->kn_sdata = kev->data;
737 if (kev->flags & EV_CLEAR) {
745 *kev = kn->kn_kevent;
746 kev->fflags = kn->kn_sfflags;
747 kev->data = kn->kn_sdata;
748 if (kn->kn_flags & EV_CLEAR) {
756 panic("filt_usertouch() - invalid type (%ld)", type);
762 sys_kqueue(struct thread *td, struct kqueue_args *uap)
765 return (kern_kqueue(td, 0));
769 kern_kqueue(struct thread *td, int flags)
771 struct filedesc *fdp;
776 fdp = td->td_proc->p_fd;
777 error = falloc(td, &fp, &fd, flags);
781 /* An extra reference on `fp' has been held for us by falloc(). */
782 kq = malloc(sizeof *kq, M_KQUEUE, M_WAITOK | M_ZERO);
783 mtx_init(&kq->kq_lock, "kqueue", NULL, MTX_DEF|MTX_DUPOK);
784 TAILQ_INIT(&kq->kq_head);
786 knlist_init_mtx(&kq->kq_sel.si_note, &kq->kq_lock);
787 TASK_INIT(&kq->kq_task, 0, kqueue_task, kq);
790 TAILQ_INSERT_HEAD(&fdp->fd_kqlist, kq, kq_list);
791 FILEDESC_XUNLOCK(fdp);
793 finit(fp, FREAD | FWRITE, DTYPE_KQUEUE, kq, &kqueueops);
796 td->td_retval[0] = fd;
801 #ifndef _SYS_SYSPROTO_H_
804 const struct kevent *changelist;
806 struct kevent *eventlist;
808 const struct timespec *timeout;
812 sys_kevent(struct thread *td, struct kevent_args *uap)
814 struct timespec ts, *tsp;
815 struct kevent_copyops k_ops = { uap,
822 struct uio *ktruioin = NULL;
823 struct uio *ktruioout = NULL;
826 if (uap->timeout != NULL) {
827 error = copyin(uap->timeout, &ts, sizeof(ts));
835 if (KTRPOINT(td, KTR_GENIO)) {
836 ktriov.iov_base = uap->changelist;
837 ktriov.iov_len = uap->nchanges * sizeof(struct kevent);
838 ktruio = (struct uio){ .uio_iov = &ktriov, .uio_iovcnt = 1,
839 .uio_segflg = UIO_USERSPACE, .uio_rw = UIO_READ,
841 ktruioin = cloneuio(&ktruio);
842 ktriov.iov_base = uap->eventlist;
843 ktriov.iov_len = uap->nevents * sizeof(struct kevent);
844 ktruioout = cloneuio(&ktruio);
848 error = kern_kevent(td, uap->fd, uap->nchanges, uap->nevents,
852 if (ktruioin != NULL) {
853 ktruioin->uio_resid = uap->nchanges * sizeof(struct kevent);
854 ktrgenio(uap->fd, UIO_WRITE, ktruioin, 0);
855 ktruioout->uio_resid = td->td_retval[0] * sizeof(struct kevent);
856 ktrgenio(uap->fd, UIO_READ, ktruioout, error);
864 * Copy 'count' items into the destination list pointed to by uap->eventlist.
867 kevent_copyout(void *arg, struct kevent *kevp, int count)
869 struct kevent_args *uap;
872 KASSERT(count <= KQ_NEVENTS, ("count (%d) > KQ_NEVENTS", count));
873 uap = (struct kevent_args *)arg;
875 error = copyout(kevp, uap->eventlist, count * sizeof *kevp);
877 uap->eventlist += count;
882 * Copy 'count' items from the list pointed to by uap->changelist.
885 kevent_copyin(void *arg, struct kevent *kevp, int count)
887 struct kevent_args *uap;
890 KASSERT(count <= KQ_NEVENTS, ("count (%d) > KQ_NEVENTS", count));
891 uap = (struct kevent_args *)arg;
893 error = copyin(uap->changelist, kevp, count * sizeof *kevp);
895 uap->changelist += count;
900 kern_kevent(struct thread *td, int fd, int nchanges, int nevents,
901 struct kevent_copyops *k_ops, const struct timespec *timeout)
907 cap_rights_init(&rights);
909 cap_rights_set(&rights, CAP_KQUEUE_CHANGE);
911 cap_rights_set(&rights, CAP_KQUEUE_EVENT);
912 error = fget(td, fd, &rights, &fp);
916 error = kern_kevent_fp(td, fp, nchanges, nevents, k_ops, timeout);
923 kern_kevent_fp(struct thread *td, struct file *fp, int nchanges, int nevents,
924 struct kevent_copyops *k_ops, const struct timespec *timeout)
926 struct kevent keva[KQ_NEVENTS];
927 struct kevent *kevp, *changes;
929 int i, n, nerrors, error;
931 error = kqueue_acquire(fp, &kq);
937 while (nchanges > 0) {
938 n = nchanges > KQ_NEVENTS ? KQ_NEVENTS : nchanges;
939 error = k_ops->k_copyin(k_ops->arg, keva, n);
943 for (i = 0; i < n; i++) {
947 kevp->flags &= ~EV_SYSFLAGS;
948 error = kqueue_register(kq, kevp, td, 1);
949 if (error || (kevp->flags & EV_RECEIPT)) {
951 kevp->flags = EV_ERROR;
953 (void) k_ops->k_copyout(k_ops->arg,
965 td->td_retval[0] = nerrors;
970 error = kqueue_scan(kq, nevents, k_ops, timeout, keva, td);
972 kqueue_release(kq, 0);
977 kqueue_add_filteropts(int filt, struct filterops *filtops)
982 if (filt > 0 || filt + EVFILT_SYSCOUNT < 0) {
984 "trying to add a filterop that is out of range: %d is beyond %d\n",
985 ~filt, EVFILT_SYSCOUNT);
988 mtx_lock(&filterops_lock);
989 if (sysfilt_ops[~filt].for_fop != &null_filtops &&
990 sysfilt_ops[~filt].for_fop != NULL)
993 sysfilt_ops[~filt].for_fop = filtops;
994 sysfilt_ops[~filt].for_refcnt = 0;
996 mtx_unlock(&filterops_lock);
1002 kqueue_del_filteropts(int filt)
1007 if (filt > 0 || filt + EVFILT_SYSCOUNT < 0)
1010 mtx_lock(&filterops_lock);
1011 if (sysfilt_ops[~filt].for_fop == &null_filtops ||
1012 sysfilt_ops[~filt].for_fop == NULL)
1014 else if (sysfilt_ops[~filt].for_refcnt != 0)
1017 sysfilt_ops[~filt].for_fop = &null_filtops;
1018 sysfilt_ops[~filt].for_refcnt = 0;
1020 mtx_unlock(&filterops_lock);
1025 static struct filterops *
1026 kqueue_fo_find(int filt)
1029 if (filt > 0 || filt + EVFILT_SYSCOUNT < 0)
1032 mtx_lock(&filterops_lock);
1033 sysfilt_ops[~filt].for_refcnt++;
1034 if (sysfilt_ops[~filt].for_fop == NULL)
1035 sysfilt_ops[~filt].for_fop = &null_filtops;
1036 mtx_unlock(&filterops_lock);
1038 return sysfilt_ops[~filt].for_fop;
1042 kqueue_fo_release(int filt)
1045 if (filt > 0 || filt + EVFILT_SYSCOUNT < 0)
1048 mtx_lock(&filterops_lock);
1049 KASSERT(sysfilt_ops[~filt].for_refcnt > 0,
1050 ("filter object refcount not valid on release"));
1051 sysfilt_ops[~filt].for_refcnt--;
1052 mtx_unlock(&filterops_lock);
1056 * A ref to kq (obtained via kqueue_acquire) must be held. waitok will
1057 * influence if memory allocation should wait. Make sure it is 0 if you
1061 kqueue_register(struct kqueue *kq, struct kevent *kev, struct thread *td, int waitok)
1063 struct filterops *fops;
1065 struct knote *kn, *tkn;
1066 cap_rights_t rights;
1067 int error, filt, event;
1068 int haskqglobal, filedesc_unlock;
1074 filedesc_unlock = 0;
1077 fops = kqueue_fo_find(filt);
1081 tkn = knote_alloc(waitok); /* prevent waiting with locks */
1085 KASSERT(td != NULL, ("td is NULL"));
1086 error = fget(td, kev->ident,
1087 cap_rights_init(&rights, CAP_EVENT), &fp);
1091 if ((kev->flags & EV_ADD) == EV_ADD && kqueue_expand(kq, fops,
1092 kev->ident, 0) != 0) {
1096 error = kqueue_expand(kq, fops, kev->ident, waitok);
1102 if (fp->f_type == DTYPE_KQUEUE) {
1104 * If we add some intelligence about what we are doing,
1105 * we should be able to support events on ourselves.
1106 * We need to know when we are doing this to prevent
1107 * getting both the knlist lock and the kq lock since
1108 * they are the same thing.
1110 if (fp->f_data == kq) {
1116 * Pre-lock the filedesc before the global
1117 * lock mutex, see the comment in
1120 FILEDESC_XLOCK(td->td_proc->p_fd);
1121 filedesc_unlock = 1;
1122 KQ_GLOBAL_LOCK(&kq_global, haskqglobal);
1126 if (kev->ident < kq->kq_knlistsize) {
1127 SLIST_FOREACH(kn, &kq->kq_knlist[kev->ident], kn_link)
1128 if (kev->filter == kn->kn_filter)
1132 if ((kev->flags & EV_ADD) == EV_ADD)
1133 kqueue_expand(kq, fops, kev->ident, waitok);
1138 * If possible, find an existing knote to use for this kevent.
1140 if (kev->filter == EVFILT_PROC &&
1141 (kev->flags & (EV_FLAG1 | EV_FLAG2)) != 0) {
1142 /* This is an internal creation of a process tracking
1143 * note. Don't attempt to coalesce this with an
1147 } else if (kq->kq_knhashmask != 0) {
1150 list = &kq->kq_knhash[
1151 KN_HASH((u_long)kev->ident, kq->kq_knhashmask)];
1152 SLIST_FOREACH(kn, list, kn_link)
1153 if (kev->ident == kn->kn_id &&
1154 kev->filter == kn->kn_filter)
1159 /* knote is in the process of changing, wait for it to stabilize. */
1160 if (kn != NULL && (kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1161 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1162 if (filedesc_unlock) {
1163 FILEDESC_XUNLOCK(td->td_proc->p_fd);
1164 filedesc_unlock = 0;
1166 kq->kq_state |= KQ_FLUXWAIT;
1167 msleep(kq, &kq->kq_lock, PSOCK | PDROP, "kqflxwt", 0);
1176 * kn now contains the matching knote, or NULL if no match
1179 if (kev->flags & EV_ADD) {
1191 * apply reference counts to knote structure, and
1192 * do not release it at the end of this routine.
1197 kn->kn_sfflags = kev->fflags;
1198 kn->kn_sdata = kev->data;
1201 kn->kn_kevent = *kev;
1202 kn->kn_kevent.flags &= ~(EV_ADD | EV_DELETE |
1203 EV_ENABLE | EV_DISABLE);
1204 kn->kn_status = KN_INFLUX|KN_DETACHED;
1206 error = knote_attach(kn, kq);
1213 if ((error = kn->kn_fop->f_attach(kn)) != 0) {
1220 /* No matching knote and the EV_ADD flag is not set. */
1227 if (kev->flags & EV_DELETE) {
1228 kn->kn_status |= KN_INFLUX;
1230 if (!(kn->kn_status & KN_DETACHED))
1231 kn->kn_fop->f_detach(kn);
1237 * The user may change some filter values after the initial EV_ADD,
1238 * but doing so will not reset any filter which has already been
1241 kn->kn_status |= KN_INFLUX | KN_SCAN;
1244 kn->kn_kevent.udata = kev->udata;
1245 if (!fops->f_isfd && fops->f_touch != NULL) {
1246 fops->f_touch(kn, kev, EVENT_REGISTER);
1248 kn->kn_sfflags = kev->fflags;
1249 kn->kn_sdata = kev->data;
1253 * We can get here with kn->kn_knlist == NULL. This can happen when
1254 * the initial attach event decides that the event is "completed"
1255 * already. i.e. filt_procattach is called on a zombie process. It
1256 * will call filt_proc which will remove it from the list, and NULL
1260 event = kn->kn_fop->f_event(kn, 0);
1263 KNOTE_ACTIVATE(kn, 1);
1264 kn->kn_status &= ~(KN_INFLUX | KN_SCAN);
1267 if ((kev->flags & EV_DISABLE) &&
1268 ((kn->kn_status & KN_DISABLED) == 0)) {
1269 kn->kn_status |= KN_DISABLED;
1272 if ((kev->flags & EV_ENABLE) && (kn->kn_status & KN_DISABLED)) {
1273 kn->kn_status &= ~KN_DISABLED;
1274 if ((kn->kn_status & KN_ACTIVE) &&
1275 ((kn->kn_status & KN_QUEUED) == 0))
1281 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1282 if (filedesc_unlock)
1283 FILEDESC_XUNLOCK(td->td_proc->p_fd);
1289 kqueue_fo_release(filt);
1294 kqueue_acquire(struct file *fp, struct kqueue **kqp)
1302 if (fp->f_type != DTYPE_KQUEUE || kq == NULL)
1306 if ((kq->kq_state & KQ_CLOSING) == KQ_CLOSING) {
1317 kqueue_release(struct kqueue *kq, int locked)
1324 if (kq->kq_refcnt == 1)
1325 wakeup(&kq->kq_refcnt);
1331 kqueue_schedtask(struct kqueue *kq)
1335 KASSERT(((kq->kq_state & KQ_TASKDRAIN) != KQ_TASKDRAIN),
1336 ("scheduling kqueue task while draining"));
1338 if ((kq->kq_state & KQ_TASKSCHED) != KQ_TASKSCHED) {
1339 taskqueue_enqueue(taskqueue_kqueue, &kq->kq_task);
1340 kq->kq_state |= KQ_TASKSCHED;
1345 * Expand the kq to make sure we have storage for fops/ident pair.
1347 * Return 0 on success (or no work necessary), return errno on failure.
1349 * Not calling hashinit w/ waitok (proper malloc flag) should be safe.
1350 * If kqueue_register is called from a non-fd context, there usually/should
1354 kqueue_expand(struct kqueue *kq, struct filterops *fops, uintptr_t ident,
1357 struct klist *list, *tmp_knhash, *to_free;
1358 u_long tmp_knhashmask;
1361 int mflag = waitok ? M_WAITOK : M_NOWAIT;
1368 if (kq->kq_knlistsize <= fd) {
1369 size = kq->kq_knlistsize;
1372 list = malloc(size * sizeof(*list), M_KQUEUE, mflag);
1376 if (kq->kq_knlistsize > fd) {
1380 if (kq->kq_knlist != NULL) {
1381 bcopy(kq->kq_knlist, list,
1382 kq->kq_knlistsize * sizeof(*list));
1383 to_free = kq->kq_knlist;
1384 kq->kq_knlist = NULL;
1386 bzero((caddr_t)list +
1387 kq->kq_knlistsize * sizeof(*list),
1388 (size - kq->kq_knlistsize) * sizeof(*list));
1389 kq->kq_knlistsize = size;
1390 kq->kq_knlist = list;
1395 if (kq->kq_knhashmask == 0) {
1396 tmp_knhash = hashinit(KN_HASHSIZE, M_KQUEUE,
1398 if (tmp_knhash == NULL)
1401 if (kq->kq_knhashmask == 0) {
1402 kq->kq_knhash = tmp_knhash;
1403 kq->kq_knhashmask = tmp_knhashmask;
1405 to_free = tmp_knhash;
1410 free(to_free, M_KQUEUE);
1417 kqueue_task(void *arg, int pending)
1425 KQ_GLOBAL_LOCK(&kq_global, haskqglobal);
1428 KNOTE_LOCKED(&kq->kq_sel.si_note, 0);
1430 kq->kq_state &= ~KQ_TASKSCHED;
1431 if ((kq->kq_state & KQ_TASKDRAIN) == KQ_TASKDRAIN) {
1432 wakeup(&kq->kq_state);
1435 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1439 * Scan, update kn_data (if not ONESHOT), and copyout triggered events.
1440 * We treat KN_MARKER knotes as if they are INFLUX.
1443 kqueue_scan(struct kqueue *kq, int maxevents, struct kevent_copyops *k_ops,
1444 const struct timespec *tsp, struct kevent *keva, struct thread *td)
1446 struct kevent *kevp;
1447 struct knote *kn, *marker;
1448 sbintime_t asbt, rsbt;
1449 int count, error, haskqglobal, influx, nkev, touch;
1461 if (tsp->tv_sec < 0 || tsp->tv_nsec < 0 ||
1462 tsp->tv_nsec >= 1000000000) {
1466 if (timespecisset(tsp)) {
1467 if (tsp->tv_sec <= INT32_MAX) {
1468 rsbt = tstosbt(*tsp);
1469 if (TIMESEL(&asbt, rsbt))
1470 asbt += tc_tick_sbt;
1471 if (asbt <= INT64_MAX - rsbt)
1475 rsbt >>= tc_precexp;
1482 marker = knote_alloc(1);
1483 if (marker == NULL) {
1487 marker->kn_status = KN_MARKER;
1492 if (kq->kq_count == 0) {
1494 error = EWOULDBLOCK;
1496 kq->kq_state |= KQ_SLEEP;
1497 error = msleep_sbt(kq, &kq->kq_lock, PSOCK | PCATCH,
1498 "kqread", asbt, rsbt, C_ABSOLUTE);
1502 /* don't restart after signals... */
1503 if (error == ERESTART)
1505 else if (error == EWOULDBLOCK)
1510 TAILQ_INSERT_TAIL(&kq->kq_head, marker, kn_tqe);
1514 kn = TAILQ_FIRST(&kq->kq_head);
1516 if ((kn->kn_status == KN_MARKER && kn != marker) ||
1517 (kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1522 kq->kq_state |= KQ_FLUXWAIT;
1523 error = msleep(kq, &kq->kq_lock, PSOCK,
1528 TAILQ_REMOVE(&kq->kq_head, kn, kn_tqe);
1529 if ((kn->kn_status & KN_DISABLED) == KN_DISABLED) {
1530 kn->kn_status &= ~KN_QUEUED;
1536 if (count == maxevents)
1540 KASSERT((kn->kn_status & KN_INFLUX) == 0,
1541 ("KN_INFLUX set when not suppose to be"));
1543 if ((kn->kn_flags & EV_DROP) == EV_DROP) {
1544 kn->kn_status &= ~KN_QUEUED;
1545 kn->kn_status |= KN_INFLUX;
1549 * We don't need to lock the list since we've marked
1552 if (!(kn->kn_status & KN_DETACHED))
1553 kn->kn_fop->f_detach(kn);
1557 } else if ((kn->kn_flags & EV_ONESHOT) == EV_ONESHOT) {
1558 kn->kn_status &= ~KN_QUEUED;
1559 kn->kn_status |= KN_INFLUX;
1563 * We don't need to lock the list since we've marked
1566 *kevp = kn->kn_kevent;
1567 if (!(kn->kn_status & KN_DETACHED))
1568 kn->kn_fop->f_detach(kn);
1573 kn->kn_status |= KN_INFLUX | KN_SCAN;
1575 if ((kn->kn_status & KN_KQUEUE) == KN_KQUEUE)
1576 KQ_GLOBAL_LOCK(&kq_global, haskqglobal);
1578 if (kn->kn_fop->f_event(kn, 0) == 0) {
1580 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1582 ~(KN_QUEUED | KN_ACTIVE | KN_INFLUX |
1589 touch = (!kn->kn_fop->f_isfd &&
1590 kn->kn_fop->f_touch != NULL);
1592 kn->kn_fop->f_touch(kn, kevp, EVENT_PROCESS);
1594 *kevp = kn->kn_kevent;
1596 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1597 if (kn->kn_flags & (EV_CLEAR | EV_DISPATCH)) {
1599 * Manually clear knotes who weren't
1602 if (touch == 0 && kn->kn_flags & EV_CLEAR) {
1606 if (kn->kn_flags & EV_DISPATCH)
1607 kn->kn_status |= KN_DISABLED;
1608 kn->kn_status &= ~(KN_QUEUED | KN_ACTIVE);
1611 TAILQ_INSERT_TAIL(&kq->kq_head, kn, kn_tqe);
1613 kn->kn_status &= ~(KN_INFLUX | KN_SCAN);
1618 /* we are returning a copy to the user */
1623 if (nkev == KQ_NEVENTS) {
1626 error = k_ops->k_copyout(k_ops->arg, keva, nkev);
1634 TAILQ_REMOVE(&kq->kq_head, marker, kn_tqe);
1642 error = k_ops->k_copyout(k_ops->arg, keva, nkev);
1643 td->td_retval[0] = maxevents - count;
1649 * This could be expanded to call kqueue_scan, if desired.
1653 kqueue_read(struct file *fp, struct uio *uio, struct ucred *active_cred,
1654 int flags, struct thread *td)
1661 kqueue_write(struct file *fp, struct uio *uio, struct ucred *active_cred,
1662 int flags, struct thread *td)
1669 kqueue_truncate(struct file *fp, off_t length, struct ucred *active_cred,
1678 kqueue_ioctl(struct file *fp, u_long cmd, void *data,
1679 struct ucred *active_cred, struct thread *td)
1682 * Enabling sigio causes two major problems:
1683 * 1) infinite recursion:
1684 * Synopsys: kevent is being used to track signals and have FIOASYNC
1685 * set. On receipt of a signal this will cause a kqueue to recurse
1686 * into itself over and over. Sending the sigio causes the kqueue
1687 * to become ready, which in turn posts sigio again, forever.
1688 * Solution: this can be solved by setting a flag in the kqueue that
1689 * we have a SIGIO in progress.
1690 * 2) locking problems:
1691 * Synopsys: Kqueue is a leaf subsystem, but adding signalling puts
1692 * us above the proc and pgrp locks.
1693 * Solution: Post a signal using an async mechanism, being sure to
1694 * record a generation count in the delivery so that we do not deliver
1695 * a signal to the wrong process.
1697 * Note, these two mechanisms are somewhat mutually exclusive!
1706 kq->kq_state |= KQ_ASYNC;
1708 kq->kq_state &= ~KQ_ASYNC;
1713 return (fsetown(*(int *)data, &kq->kq_sigio));
1716 *(int *)data = fgetown(&kq->kq_sigio);
1726 kqueue_poll(struct file *fp, int events, struct ucred *active_cred,
1733 if ((error = kqueue_acquire(fp, &kq)))
1737 if (events & (POLLIN | POLLRDNORM)) {
1739 revents |= events & (POLLIN | POLLRDNORM);
1741 selrecord(td, &kq->kq_sel);
1742 if (SEL_WAITING(&kq->kq_sel))
1743 kq->kq_state |= KQ_SEL;
1746 kqueue_release(kq, 1);
1753 kqueue_stat(struct file *fp, struct stat *st, struct ucred *active_cred,
1757 bzero((void *)st, sizeof *st);
1759 * We no longer return kq_count because the unlocked value is useless.
1760 * If you spent all this time getting the count, why not spend your
1761 * syscall better by calling kevent?
1763 * XXX - This is needed for libc_r.
1765 st->st_mode = S_IFIFO;
1771 kqueue_close(struct file *fp, struct thread *td)
1773 struct kqueue *kq = fp->f_data;
1774 struct filedesc *fdp;
1778 int filedesc_unlock;
1780 if ((error = kqueue_acquire(fp, &kq)))
1783 filedesc_unlock = 0;
1786 KASSERT((kq->kq_state & KQ_CLOSING) != KQ_CLOSING,
1787 ("kqueue already closing"));
1788 kq->kq_state |= KQ_CLOSING;
1789 if (kq->kq_refcnt > 1)
1790 msleep(&kq->kq_refcnt, &kq->kq_lock, PSOCK, "kqclose", 0);
1792 KASSERT(kq->kq_refcnt == 1, ("other refs are out there!"));
1795 KASSERT(knlist_empty(&kq->kq_sel.si_note),
1796 ("kqueue's knlist not empty"));
1798 for (i = 0; i < kq->kq_knlistsize; i++) {
1799 while ((kn = SLIST_FIRST(&kq->kq_knlist[i])) != NULL) {
1800 if ((kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1801 kq->kq_state |= KQ_FLUXWAIT;
1802 msleep(kq, &kq->kq_lock, PSOCK, "kqclo1", 0);
1805 kn->kn_status |= KN_INFLUX;
1807 if (!(kn->kn_status & KN_DETACHED))
1808 kn->kn_fop->f_detach(kn);
1813 if (kq->kq_knhashmask != 0) {
1814 for (i = 0; i <= kq->kq_knhashmask; i++) {
1815 while ((kn = SLIST_FIRST(&kq->kq_knhash[i])) != NULL) {
1816 if ((kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1817 kq->kq_state |= KQ_FLUXWAIT;
1818 msleep(kq, &kq->kq_lock, PSOCK,
1822 kn->kn_status |= KN_INFLUX;
1824 if (!(kn->kn_status & KN_DETACHED))
1825 kn->kn_fop->f_detach(kn);
1832 if ((kq->kq_state & KQ_TASKSCHED) == KQ_TASKSCHED) {
1833 kq->kq_state |= KQ_TASKDRAIN;
1834 msleep(&kq->kq_state, &kq->kq_lock, PSOCK, "kqtqdr", 0);
1837 if ((kq->kq_state & KQ_SEL) == KQ_SEL) {
1838 selwakeuppri(&kq->kq_sel, PSOCK);
1839 if (!SEL_WAITING(&kq->kq_sel))
1840 kq->kq_state &= ~KQ_SEL;
1846 * We could be called due to the knote_drop() doing fdrop(),
1847 * called from kqueue_register(). In this case the global
1848 * lock is owned, and filedesc sx is locked before, to not
1849 * take the sleepable lock after non-sleepable.
1851 if (!sx_xlocked(FILEDESC_LOCK(fdp))) {
1852 FILEDESC_XLOCK(fdp);
1853 filedesc_unlock = 1;
1855 filedesc_unlock = 0;
1856 TAILQ_REMOVE(&fdp->fd_kqlist, kq, kq_list);
1857 if (filedesc_unlock)
1858 FILEDESC_XUNLOCK(fdp);
1860 seldrain(&kq->kq_sel);
1861 knlist_destroy(&kq->kq_sel.si_note);
1862 mtx_destroy(&kq->kq_lock);
1865 if (kq->kq_knhash != NULL)
1866 free(kq->kq_knhash, M_KQUEUE);
1867 if (kq->kq_knlist != NULL)
1868 free(kq->kq_knlist, M_KQUEUE);
1870 funsetown(&kq->kq_sigio);
1878 kqueue_wakeup(struct kqueue *kq)
1882 if ((kq->kq_state & KQ_SLEEP) == KQ_SLEEP) {
1883 kq->kq_state &= ~KQ_SLEEP;
1886 if ((kq->kq_state & KQ_SEL) == KQ_SEL) {
1887 selwakeuppri(&kq->kq_sel, PSOCK);
1888 if (!SEL_WAITING(&kq->kq_sel))
1889 kq->kq_state &= ~KQ_SEL;
1891 if (!knlist_empty(&kq->kq_sel.si_note))
1892 kqueue_schedtask(kq);
1893 if ((kq->kq_state & KQ_ASYNC) == KQ_ASYNC) {
1894 pgsigio(&kq->kq_sigio, SIGIO, 0);
1899 * Walk down a list of knotes, activating them if their event has triggered.
1901 * There is a possibility to optimize in the case of one kq watching another.
1902 * Instead of scheduling a task to wake it up, you could pass enough state
1903 * down the chain to make up the parent kqueue. Make this code functional
1907 knote(struct knlist *list, long hint, int lockflags)
1910 struct knote *kn, *tkn;
1916 KNL_ASSERT_LOCK(list, lockflags & KNF_LISTLOCKED);
1918 if ((lockflags & KNF_LISTLOCKED) == 0)
1919 list->kl_lock(list->kl_lockarg);
1922 * If we unlock the list lock (and set KN_INFLUX), we can
1923 * eliminate the kqueue scheduling, but this will introduce
1924 * four lock/unlock's for each knote to test. Also, marker
1925 * would be needed to keep iteration position, since filters
1926 * or other threads could remove events.
1928 SLIST_FOREACH_SAFE(kn, &list->kl_list, kn_selnext, tkn) {
1931 if ((kn->kn_status & (KN_INFLUX | KN_SCAN)) == KN_INFLUX) {
1933 * Do not process the influx notes, except for
1934 * the influx coming from the kq unlock in the
1935 * kqueue_scan(). In the later case, we do
1936 * not interfere with the scan, since the code
1937 * fragment in kqueue_scan() locks the knlist,
1938 * and cannot proceed until we finished.
1941 } else if ((lockflags & KNF_NOKQLOCK) != 0) {
1942 kn->kn_status |= KN_INFLUX;
1944 error = kn->kn_fop->f_event(kn, hint);
1946 kn->kn_status &= ~KN_INFLUX;
1948 KNOTE_ACTIVATE(kn, 1);
1951 kn->kn_status |= KN_HASKQLOCK;
1952 if (kn->kn_fop->f_event(kn, hint))
1953 KNOTE_ACTIVATE(kn, 1);
1954 kn->kn_status &= ~KN_HASKQLOCK;
1958 if ((lockflags & KNF_LISTLOCKED) == 0)
1959 list->kl_unlock(list->kl_lockarg);
1963 * add a knote to a knlist
1966 knlist_add(struct knlist *knl, struct knote *kn, int islocked)
1968 KNL_ASSERT_LOCK(knl, islocked);
1969 KQ_NOTOWNED(kn->kn_kq);
1970 KASSERT((kn->kn_status & (KN_INFLUX|KN_DETACHED)) ==
1971 (KN_INFLUX|KN_DETACHED), ("knote not KN_INFLUX and KN_DETACHED"));
1973 knl->kl_lock(knl->kl_lockarg);
1974 SLIST_INSERT_HEAD(&knl->kl_list, kn, kn_selnext);
1976 knl->kl_unlock(knl->kl_lockarg);
1978 kn->kn_knlist = knl;
1979 kn->kn_status &= ~KN_DETACHED;
1980 KQ_UNLOCK(kn->kn_kq);
1984 knlist_remove_kq(struct knlist *knl, struct knote *kn, int knlislocked, int kqislocked)
1986 KASSERT(!(!!kqislocked && !knlislocked), ("kq locked w/o knl locked"));
1987 KNL_ASSERT_LOCK(knl, knlislocked);
1988 mtx_assert(&kn->kn_kq->kq_lock, kqislocked ? MA_OWNED : MA_NOTOWNED);
1990 KASSERT((kn->kn_status & (KN_INFLUX|KN_DETACHED)) == KN_INFLUX,
1991 ("knlist_remove called w/o knote being KN_INFLUX or already removed"));
1993 knl->kl_lock(knl->kl_lockarg);
1994 SLIST_REMOVE(&knl->kl_list, kn, knote, kn_selnext);
1995 kn->kn_knlist = NULL;
1997 knl->kl_unlock(knl->kl_lockarg);
2000 kn->kn_status |= KN_DETACHED;
2002 KQ_UNLOCK(kn->kn_kq);
2006 * remove knote from the specified knlist
2009 knlist_remove(struct knlist *knl, struct knote *kn, int islocked)
2012 knlist_remove_kq(knl, kn, islocked, 0);
2016 * remove knote from the specified knlist while in f_event handler.
2019 knlist_remove_inevent(struct knlist *knl, struct knote *kn)
2022 knlist_remove_kq(knl, kn, 1,
2023 (kn->kn_status & KN_HASKQLOCK) == KN_HASKQLOCK);
2027 knlist_empty(struct knlist *knl)
2030 KNL_ASSERT_LOCKED(knl);
2031 return SLIST_EMPTY(&knl->kl_list);
2034 static struct mtx knlist_lock;
2035 MTX_SYSINIT(knlist_lock, &knlist_lock, "knlist lock for lockless objects",
2037 static void knlist_mtx_lock(void *arg);
2038 static void knlist_mtx_unlock(void *arg);
2041 knlist_mtx_lock(void *arg)
2044 mtx_lock((struct mtx *)arg);
2048 knlist_mtx_unlock(void *arg)
2051 mtx_unlock((struct mtx *)arg);
2055 knlist_mtx_assert_locked(void *arg)
2058 mtx_assert((struct mtx *)arg, MA_OWNED);
2062 knlist_mtx_assert_unlocked(void *arg)
2065 mtx_assert((struct mtx *)arg, MA_NOTOWNED);
2069 knlist_rw_rlock(void *arg)
2072 rw_rlock((struct rwlock *)arg);
2076 knlist_rw_runlock(void *arg)
2079 rw_runlock((struct rwlock *)arg);
2083 knlist_rw_assert_locked(void *arg)
2086 rw_assert((struct rwlock *)arg, RA_LOCKED);
2090 knlist_rw_assert_unlocked(void *arg)
2093 rw_assert((struct rwlock *)arg, RA_UNLOCKED);
2097 knlist_init(struct knlist *knl, void *lock, void (*kl_lock)(void *),
2098 void (*kl_unlock)(void *),
2099 void (*kl_assert_locked)(void *), void (*kl_assert_unlocked)(void *))
2103 knl->kl_lockarg = &knlist_lock;
2105 knl->kl_lockarg = lock;
2107 if (kl_lock == NULL)
2108 knl->kl_lock = knlist_mtx_lock;
2110 knl->kl_lock = kl_lock;
2111 if (kl_unlock == NULL)
2112 knl->kl_unlock = knlist_mtx_unlock;
2114 knl->kl_unlock = kl_unlock;
2115 if (kl_assert_locked == NULL)
2116 knl->kl_assert_locked = knlist_mtx_assert_locked;
2118 knl->kl_assert_locked = kl_assert_locked;
2119 if (kl_assert_unlocked == NULL)
2120 knl->kl_assert_unlocked = knlist_mtx_assert_unlocked;
2122 knl->kl_assert_unlocked = kl_assert_unlocked;
2124 SLIST_INIT(&knl->kl_list);
2128 knlist_init_mtx(struct knlist *knl, struct mtx *lock)
2131 knlist_init(knl, lock, NULL, NULL, NULL, NULL);
2135 knlist_init_rw_reader(struct knlist *knl, struct rwlock *lock)
2138 knlist_init(knl, lock, knlist_rw_rlock, knlist_rw_runlock,
2139 knlist_rw_assert_locked, knlist_rw_assert_unlocked);
2143 knlist_destroy(struct knlist *knl)
2148 * if we run across this error, we need to find the offending
2149 * driver and have it call knlist_clear or knlist_delete.
2151 if (!SLIST_EMPTY(&knl->kl_list))
2152 printf("WARNING: destroying knlist w/ knotes on it!\n");
2155 knl->kl_lockarg = knl->kl_lock = knl->kl_unlock = NULL;
2156 SLIST_INIT(&knl->kl_list);
2160 * Even if we are locked, we may need to drop the lock to allow any influx
2161 * knotes time to "settle".
2164 knlist_cleardel(struct knlist *knl, struct thread *td, int islocked, int killkn)
2166 struct knote *kn, *kn2;
2170 KNL_ASSERT_LOCKED(knl);
2172 KNL_ASSERT_UNLOCKED(knl);
2173 again: /* need to reacquire lock since we have dropped it */
2174 knl->kl_lock(knl->kl_lockarg);
2177 SLIST_FOREACH_SAFE(kn, &knl->kl_list, kn_selnext, kn2) {
2180 if ((kn->kn_status & KN_INFLUX)) {
2184 knlist_remove_kq(knl, kn, 1, 1);
2186 kn->kn_status |= KN_INFLUX | KN_DETACHED;
2190 /* Make sure cleared knotes disappear soon */
2191 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
2197 if (!SLIST_EMPTY(&knl->kl_list)) {
2198 /* there are still KN_INFLUX remaining */
2199 kn = SLIST_FIRST(&knl->kl_list);
2202 KASSERT(kn->kn_status & KN_INFLUX,
2203 ("knote removed w/o list lock"));
2204 knl->kl_unlock(knl->kl_lockarg);
2205 kq->kq_state |= KQ_FLUXWAIT;
2206 msleep(kq, &kq->kq_lock, PSOCK | PDROP, "kqkclr", 0);
2212 KNL_ASSERT_LOCKED(knl);
2214 knl->kl_unlock(knl->kl_lockarg);
2215 KNL_ASSERT_UNLOCKED(knl);
2220 * Remove all knotes referencing a specified fd must be called with FILEDESC
2221 * lock. This prevents a race where a new fd comes along and occupies the
2222 * entry and we attach a knote to the fd.
2225 knote_fdclose(struct thread *td, int fd)
2227 struct filedesc *fdp = td->td_proc->p_fd;
2232 FILEDESC_XLOCK_ASSERT(fdp);
2235 * We shouldn't have to worry about new kevents appearing on fd
2236 * since filedesc is locked.
2238 TAILQ_FOREACH(kq, &fdp->fd_kqlist, kq_list) {
2243 while (kq->kq_knlistsize > fd &&
2244 (kn = SLIST_FIRST(&kq->kq_knlist[fd])) != NULL) {
2245 if (kn->kn_status & KN_INFLUX) {
2246 /* someone else might be waiting on our knote */
2249 kq->kq_state |= KQ_FLUXWAIT;
2250 msleep(kq, &kq->kq_lock, PSOCK, "kqflxwt", 0);
2253 kn->kn_status |= KN_INFLUX;
2255 if (!(kn->kn_status & KN_DETACHED))
2256 kn->kn_fop->f_detach(kn);
2266 knote_attach(struct knote *kn, struct kqueue *kq)
2270 KASSERT(kn->kn_status & KN_INFLUX, ("knote not marked INFLUX"));
2273 if (kn->kn_fop->f_isfd) {
2274 if (kn->kn_id >= kq->kq_knlistsize)
2276 list = &kq->kq_knlist[kn->kn_id];
2278 if (kq->kq_knhash == NULL)
2280 list = &kq->kq_knhash[KN_HASH(kn->kn_id, kq->kq_knhashmask)];
2283 SLIST_INSERT_HEAD(list, kn, kn_link);
2289 * knote must already have been detached using the f_detach method.
2290 * no lock need to be held, it is assumed that the KN_INFLUX flag is set
2291 * to prevent other removal.
2294 knote_drop(struct knote *kn, struct thread *td)
2302 KASSERT((kn->kn_status & KN_INFLUX) == KN_INFLUX,
2303 ("knote_drop called without KN_INFLUX set in kn_status"));
2306 if (kn->kn_fop->f_isfd)
2307 list = &kq->kq_knlist[kn->kn_id];
2309 list = &kq->kq_knhash[KN_HASH(kn->kn_id, kq->kq_knhashmask)];
2311 if (!SLIST_EMPTY(list))
2312 SLIST_REMOVE(list, kn, knote, kn_link);
2313 if (kn->kn_status & KN_QUEUED)
2317 if (kn->kn_fop->f_isfd) {
2318 fdrop(kn->kn_fp, td);
2321 kqueue_fo_release(kn->kn_kevent.filter);
2327 knote_enqueue(struct knote *kn)
2329 struct kqueue *kq = kn->kn_kq;
2331 KQ_OWNED(kn->kn_kq);
2332 KASSERT((kn->kn_status & KN_QUEUED) == 0, ("knote already queued"));
2334 TAILQ_INSERT_TAIL(&kq->kq_head, kn, kn_tqe);
2335 kn->kn_status |= KN_QUEUED;
2341 knote_dequeue(struct knote *kn)
2343 struct kqueue *kq = kn->kn_kq;
2345 KQ_OWNED(kn->kn_kq);
2346 KASSERT(kn->kn_status & KN_QUEUED, ("knote not queued"));
2348 TAILQ_REMOVE(&kq->kq_head, kn, kn_tqe);
2349 kn->kn_status &= ~KN_QUEUED;
2357 knote_zone = uma_zcreate("KNOTE", sizeof(struct knote), NULL, NULL,
2358 NULL, NULL, UMA_ALIGN_PTR, 0);
2360 SYSINIT(knote, SI_SUB_PSEUDO, SI_ORDER_ANY, knote_init, NULL);
2362 static struct knote *
2363 knote_alloc(int waitok)
2365 return ((struct knote *)uma_zalloc(knote_zone,
2366 (waitok ? M_WAITOK : M_NOWAIT)|M_ZERO));
2370 knote_free(struct knote *kn)
2373 uma_zfree(knote_zone, kn);
2377 * Register the kev w/ the kq specified by fd.
2380 kqfd_register(int fd, struct kevent *kev, struct thread *td, int waitok)
2384 cap_rights_t rights;
2387 error = fget(td, fd, cap_rights_init(&rights, CAP_KQUEUE_CHANGE), &fp);
2390 if ((error = kqueue_acquire(fp, &kq)) != 0)
2393 error = kqueue_register(kq, kev, td, waitok);
2395 kqueue_release(kq, 0);