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/capability.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/queue.h>
51 #include <sys/event.h>
52 #include <sys/eventvar.h>
54 #include <sys/protosw.h>
55 #include <sys/sigio.h>
56 #include <sys/signalvar.h>
57 #include <sys/socket.h>
58 #include <sys/socketvar.h>
60 #include <sys/sysctl.h>
61 #include <sys/sysproto.h>
62 #include <sys/syscallsubr.h>
63 #include <sys/taskqueue.h>
66 #include <sys/ktrace.h>
71 static MALLOC_DEFINE(M_KQUEUE, "kqueue", "memory for kqueue system");
74 * This lock is used if multiple kq locks are required. This possibly
75 * should be made into a per proc lock.
77 static struct mtx kq_global;
78 MTX_SYSINIT(kq_global, &kq_global, "kqueue order", MTX_DEF);
79 #define KQ_GLOBAL_LOCK(lck, haslck) do { \
84 #define KQ_GLOBAL_UNLOCK(lck, haslck) do { \
90 TASKQUEUE_DEFINE_THREAD(kqueue);
92 static int kevent_copyout(void *arg, struct kevent *kevp, int count);
93 static int kevent_copyin(void *arg, struct kevent *kevp, int count);
94 static int kqueue_register(struct kqueue *kq, struct kevent *kev,
95 struct thread *td, int waitok);
96 static int kqueue_acquire(struct file *fp, struct kqueue **kqp);
97 static void kqueue_release(struct kqueue *kq, int locked);
98 static int kqueue_expand(struct kqueue *kq, struct filterops *fops,
99 uintptr_t ident, int waitok);
100 static void kqueue_task(void *arg, int pending);
101 static int kqueue_scan(struct kqueue *kq, int maxevents,
102 struct kevent_copyops *k_ops,
103 const struct timespec *timeout,
104 struct kevent *keva, struct thread *td);
105 static void kqueue_wakeup(struct kqueue *kq);
106 static struct filterops *kqueue_fo_find(int filt);
107 static void kqueue_fo_release(int filt);
109 static fo_rdwr_t kqueue_read;
110 static fo_rdwr_t kqueue_write;
111 static fo_truncate_t kqueue_truncate;
112 static fo_ioctl_t kqueue_ioctl;
113 static fo_poll_t kqueue_poll;
114 static fo_kqfilter_t kqueue_kqfilter;
115 static fo_stat_t kqueue_stat;
116 static fo_close_t kqueue_close;
118 static struct fileops kqueueops = {
119 .fo_read = kqueue_read,
120 .fo_write = kqueue_write,
121 .fo_truncate = kqueue_truncate,
122 .fo_ioctl = kqueue_ioctl,
123 .fo_poll = kqueue_poll,
124 .fo_kqfilter = kqueue_kqfilter,
125 .fo_stat = kqueue_stat,
126 .fo_close = kqueue_close,
127 .fo_chmod = invfo_chmod,
128 .fo_chown = invfo_chown,
131 static int knote_attach(struct knote *kn, struct kqueue *kq);
132 static void knote_drop(struct knote *kn, struct thread *td);
133 static void knote_enqueue(struct knote *kn);
134 static void knote_dequeue(struct knote *kn);
135 static void knote_init(void);
136 static struct knote *knote_alloc(int waitok);
137 static void knote_free(struct knote *kn);
139 static void filt_kqdetach(struct knote *kn);
140 static int filt_kqueue(struct knote *kn, long hint);
141 static int filt_procattach(struct knote *kn);
142 static void filt_procdetach(struct knote *kn);
143 static int filt_proc(struct knote *kn, long hint);
144 static int filt_fileattach(struct knote *kn);
145 static void filt_timerexpire(void *knx);
146 static int filt_timerattach(struct knote *kn);
147 static void filt_timerdetach(struct knote *kn);
148 static int filt_timer(struct knote *kn, long hint);
149 static int filt_userattach(struct knote *kn);
150 static void filt_userdetach(struct knote *kn);
151 static int filt_user(struct knote *kn, long hint);
152 static void filt_usertouch(struct knote *kn, struct kevent *kev,
155 static struct filterops file_filtops = {
157 .f_attach = filt_fileattach,
159 static struct filterops kqread_filtops = {
161 .f_detach = filt_kqdetach,
162 .f_event = filt_kqueue,
164 /* XXX - move to kern_proc.c? */
165 static struct filterops proc_filtops = {
167 .f_attach = filt_procattach,
168 .f_detach = filt_procdetach,
169 .f_event = filt_proc,
171 static struct filterops timer_filtops = {
173 .f_attach = filt_timerattach,
174 .f_detach = filt_timerdetach,
175 .f_event = filt_timer,
177 static struct filterops user_filtops = {
178 .f_attach = filt_userattach,
179 .f_detach = filt_userdetach,
180 .f_event = filt_user,
181 .f_touch = filt_usertouch,
184 static uma_zone_t knote_zone;
185 static int kq_ncallouts = 0;
186 static int kq_calloutmax = (4 * 1024);
187 SYSCTL_INT(_kern, OID_AUTO, kq_calloutmax, CTLFLAG_RW,
188 &kq_calloutmax, 0, "Maximum number of callouts allocated for kqueue");
190 /* XXX - ensure not KN_INFLUX?? */
191 #define KNOTE_ACTIVATE(kn, islock) do { \
193 mtx_assert(&(kn)->kn_kq->kq_lock, MA_OWNED); \
195 KQ_LOCK((kn)->kn_kq); \
196 (kn)->kn_status |= KN_ACTIVE; \
197 if (((kn)->kn_status & (KN_QUEUED | KN_DISABLED)) == 0) \
198 knote_enqueue((kn)); \
200 KQ_UNLOCK((kn)->kn_kq); \
202 #define KQ_LOCK(kq) do { \
203 mtx_lock(&(kq)->kq_lock); \
205 #define KQ_FLUX_WAKEUP(kq) do { \
206 if (((kq)->kq_state & KQ_FLUXWAIT) == KQ_FLUXWAIT) { \
207 (kq)->kq_state &= ~KQ_FLUXWAIT; \
211 #define KQ_UNLOCK_FLUX(kq) do { \
212 KQ_FLUX_WAKEUP(kq); \
213 mtx_unlock(&(kq)->kq_lock); \
215 #define KQ_UNLOCK(kq) do { \
216 mtx_unlock(&(kq)->kq_lock); \
218 #define KQ_OWNED(kq) do { \
219 mtx_assert(&(kq)->kq_lock, MA_OWNED); \
221 #define KQ_NOTOWNED(kq) do { \
222 mtx_assert(&(kq)->kq_lock, MA_NOTOWNED); \
224 #define KN_LIST_LOCK(kn) do { \
225 if (kn->kn_knlist != NULL) \
226 kn->kn_knlist->kl_lock(kn->kn_knlist->kl_lockarg); \
228 #define KN_LIST_UNLOCK(kn) do { \
229 if (kn->kn_knlist != NULL) \
230 kn->kn_knlist->kl_unlock(kn->kn_knlist->kl_lockarg); \
232 #define KNL_ASSERT_LOCK(knl, islocked) do { \
234 KNL_ASSERT_LOCKED(knl); \
236 KNL_ASSERT_UNLOCKED(knl); \
239 #define KNL_ASSERT_LOCKED(knl) do { \
240 knl->kl_assert_locked((knl)->kl_lockarg); \
242 #define KNL_ASSERT_UNLOCKED(knl) do { \
243 knl->kl_assert_unlocked((knl)->kl_lockarg); \
245 #else /* !INVARIANTS */
246 #define KNL_ASSERT_LOCKED(knl) do {} while(0)
247 #define KNL_ASSERT_UNLOCKED(knl) do {} while (0)
248 #endif /* INVARIANTS */
250 #define KN_HASHSIZE 64 /* XXX should be tunable */
251 #define KN_HASH(val, mask) (((val) ^ (val >> 8)) & (mask))
254 filt_nullattach(struct knote *kn)
260 struct filterops null_filtops = {
262 .f_attach = filt_nullattach,
265 /* XXX - make SYSINIT to add these, and move into respective modules. */
266 extern struct filterops sig_filtops;
267 extern struct filterops fs_filtops;
270 * Table for for all system-defined filters.
272 static struct mtx filterops_lock;
273 MTX_SYSINIT(kqueue_filterops, &filterops_lock, "protect sysfilt_ops",
276 struct filterops *for_fop;
278 } sysfilt_ops[EVFILT_SYSCOUNT] = {
279 { &file_filtops }, /* EVFILT_READ */
280 { &file_filtops }, /* EVFILT_WRITE */
281 { &null_filtops }, /* EVFILT_AIO */
282 { &file_filtops }, /* EVFILT_VNODE */
283 { &proc_filtops }, /* EVFILT_PROC */
284 { &sig_filtops }, /* EVFILT_SIGNAL */
285 { &timer_filtops }, /* EVFILT_TIMER */
286 { &null_filtops }, /* former EVFILT_NETDEV */
287 { &fs_filtops }, /* EVFILT_FS */
288 { &null_filtops }, /* EVFILT_LIO */
289 { &user_filtops }, /* EVFILT_USER */
293 * Simple redirection for all cdevsw style objects to call their fo_kqfilter
297 filt_fileattach(struct knote *kn)
300 return (fo_kqfilter(kn->kn_fp, kn));
305 kqueue_kqfilter(struct file *fp, struct knote *kn)
307 struct kqueue *kq = kn->kn_fp->f_data;
309 if (kn->kn_filter != EVFILT_READ)
312 kn->kn_status |= KN_KQUEUE;
313 kn->kn_fop = &kqread_filtops;
314 knlist_add(&kq->kq_sel.si_note, kn, 0);
320 filt_kqdetach(struct knote *kn)
322 struct kqueue *kq = kn->kn_fp->f_data;
324 knlist_remove(&kq->kq_sel.si_note, kn, 0);
329 filt_kqueue(struct knote *kn, long hint)
331 struct kqueue *kq = kn->kn_fp->f_data;
333 kn->kn_data = kq->kq_count;
334 return (kn->kn_data > 0);
337 /* XXX - move to kern_proc.c? */
339 filt_procattach(struct knote *kn)
346 p = pfind(kn->kn_id);
347 if (p == NULL && (kn->kn_sfflags & NOTE_EXIT)) {
348 p = zpfind(kn->kn_id);
350 } else if (p != NULL && (p->p_flag & P_WEXIT)) {
356 if ((error = p_cansee(curthread, p))) {
361 kn->kn_ptr.p_proc = p;
362 kn->kn_flags |= EV_CLEAR; /* automatically set */
365 * internal flag indicating registration done by kernel
367 if (kn->kn_flags & EV_FLAG1) {
368 kn->kn_data = kn->kn_sdata; /* ppid */
369 kn->kn_fflags = NOTE_CHILD;
370 kn->kn_flags &= ~EV_FLAG1;
374 knlist_add(&p->p_klist, kn, 1);
377 * Immediately activate any exit notes if the target process is a
378 * zombie. This is necessary to handle the case where the target
379 * process, e.g. a child, dies before the kevent is registered.
381 if (immediate && filt_proc(kn, NOTE_EXIT))
382 KNOTE_ACTIVATE(kn, 0);
390 * The knote may be attached to a different process, which may exit,
391 * leaving nothing for the knote to be attached to. So when the process
392 * exits, the knote is marked as DETACHED and also flagged as ONESHOT so
393 * it will be deleted when read out. However, as part of the knote deletion,
394 * this routine is called, so a check is needed to avoid actually performing
395 * a detach, because the original process does not exist any more.
397 /* XXX - move to kern_proc.c? */
399 filt_procdetach(struct knote *kn)
403 p = kn->kn_ptr.p_proc;
404 knlist_remove(&p->p_klist, kn, 0);
405 kn->kn_ptr.p_proc = NULL;
408 /* XXX - move to kern_proc.c? */
410 filt_proc(struct knote *kn, long hint)
412 struct proc *p = kn->kn_ptr.p_proc;
416 * mask off extra data
418 event = (u_int)hint & NOTE_PCTRLMASK;
421 * if the user is interested in this event, record it.
423 if (kn->kn_sfflags & event)
424 kn->kn_fflags |= event;
427 * process is gone, so flag the event as finished.
429 if (event == NOTE_EXIT) {
430 if (!(kn->kn_status & KN_DETACHED))
431 knlist_remove_inevent(&p->p_klist, kn);
432 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
433 kn->kn_data = p->p_xstat;
434 kn->kn_ptr.p_proc = NULL;
438 return (kn->kn_fflags != 0);
442 * Called when the process forked. It mostly does the same as the
443 * knote(), activating all knotes registered to be activated when the
444 * process forked. Additionally, for each knote attached to the
445 * parent, check whether user wants to track the new process. If so
446 * attach a new knote to it, and immediately report an event with the
450 knote_fork(struct knlist *list, int pid)
459 list->kl_lock(list->kl_lockarg);
461 SLIST_FOREACH(kn, &list->kl_list, kn_selnext) {
462 if ((kn->kn_status & KN_INFLUX) == KN_INFLUX)
466 if ((kn->kn_status & KN_INFLUX) == KN_INFLUX) {
472 * The same as knote(), activate the event.
474 if ((kn->kn_sfflags & NOTE_TRACK) == 0) {
475 kn->kn_status |= KN_HASKQLOCK;
476 if (kn->kn_fop->f_event(kn, NOTE_FORK | pid))
477 KNOTE_ACTIVATE(kn, 1);
478 kn->kn_status &= ~KN_HASKQLOCK;
484 * The NOTE_TRACK case. In addition to the activation
485 * of the event, we need to register new event to
486 * track the child. Drop the locks in preparation for
487 * the call to kqueue_register().
489 kn->kn_status |= KN_INFLUX;
491 list->kl_unlock(list->kl_lockarg);
494 * Activate existing knote and register a knote with
498 kev.filter = kn->kn_filter;
499 kev.flags = kn->kn_flags | EV_ADD | EV_ENABLE | EV_FLAG1;
500 kev.fflags = kn->kn_sfflags;
501 kev.data = kn->kn_id; /* parent */
502 kev.udata = kn->kn_kevent.udata;/* preserve udata */
503 error = kqueue_register(kq, &kev, NULL, 0);
504 if (kn->kn_fop->f_event(kn, NOTE_FORK | pid))
505 KNOTE_ACTIVATE(kn, 0);
507 kn->kn_fflags |= NOTE_TRACKERR;
509 kn->kn_status &= ~KN_INFLUX;
511 list->kl_lock(list->kl_lockarg);
513 list->kl_unlock(list->kl_lockarg);
517 timertoticks(intptr_t data)
522 tv.tv_sec = data / 1000;
523 tv.tv_usec = (data % 1000) * 1000;
524 tticks = tvtohz(&tv);
529 /* XXX - move to kern_timeout.c? */
531 filt_timerexpire(void *knx)
533 struct knote *kn = knx;
534 struct callout *calloutp;
537 KNOTE_ACTIVATE(kn, 0); /* XXX - handle locking */
539 if ((kn->kn_flags & EV_ONESHOT) != EV_ONESHOT) {
540 calloutp = (struct callout *)kn->kn_hook;
541 callout_reset_curcpu(calloutp, timertoticks(kn->kn_sdata),
542 filt_timerexpire, kn);
547 * data contains amount of time to sleep, in milliseconds
549 /* XXX - move to kern_timeout.c? */
551 filt_timerattach(struct knote *kn)
553 struct callout *calloutp;
555 atomic_add_int(&kq_ncallouts, 1);
557 if (kq_ncallouts >= kq_calloutmax) {
558 atomic_add_int(&kq_ncallouts, -1);
562 kn->kn_flags |= EV_CLEAR; /* automatically set */
563 kn->kn_status &= ~KN_DETACHED; /* knlist_add usually sets it */
564 calloutp = malloc(sizeof(*calloutp), M_KQUEUE, M_WAITOK);
565 callout_init(calloutp, CALLOUT_MPSAFE);
566 kn->kn_hook = calloutp;
567 callout_reset_curcpu(calloutp, timertoticks(kn->kn_sdata),
568 filt_timerexpire, kn);
573 /* XXX - move to kern_timeout.c? */
575 filt_timerdetach(struct knote *kn)
577 struct callout *calloutp;
579 calloutp = (struct callout *)kn->kn_hook;
580 callout_drain(calloutp);
581 free(calloutp, M_KQUEUE);
582 atomic_add_int(&kq_ncallouts, -1);
583 kn->kn_status |= KN_DETACHED; /* knlist_remove usually clears it */
586 /* XXX - move to kern_timeout.c? */
588 filt_timer(struct knote *kn, long hint)
591 return (kn->kn_data != 0);
595 filt_userattach(struct knote *kn)
599 * EVFILT_USER knotes are not attached to anything in the kernel.
602 if (kn->kn_fflags & NOTE_TRIGGER)
610 filt_userdetach(__unused struct knote *kn)
614 * EVFILT_USER knotes are not attached to anything in the kernel.
619 filt_user(struct knote *kn, __unused long hint)
622 return (kn->kn_hookid);
626 filt_usertouch(struct knote *kn, struct kevent *kev, u_long type)
632 if (kev->fflags & NOTE_TRIGGER)
635 ffctrl = kev->fflags & NOTE_FFCTRLMASK;
636 kev->fflags &= NOTE_FFLAGSMASK;
642 kn->kn_sfflags &= kev->fflags;
646 kn->kn_sfflags |= kev->fflags;
650 kn->kn_sfflags = kev->fflags;
654 /* XXX Return error? */
657 kn->kn_sdata = kev->data;
658 if (kev->flags & EV_CLEAR) {
666 *kev = kn->kn_kevent;
667 kev->fflags = kn->kn_sfflags;
668 kev->data = kn->kn_sdata;
669 if (kn->kn_flags & EV_CLEAR) {
677 panic("filt_usertouch() - invalid type (%ld)", type);
683 sys_kqueue(struct thread *td, struct kqueue_args *uap)
685 struct filedesc *fdp;
690 fdp = td->td_proc->p_fd;
691 error = falloc(td, &fp, &fd, 0);
695 /* An extra reference on `nfp' has been held for us by falloc(). */
696 kq = malloc(sizeof *kq, M_KQUEUE, M_WAITOK | M_ZERO);
697 mtx_init(&kq->kq_lock, "kqueue", NULL, MTX_DEF|MTX_DUPOK);
698 TAILQ_INIT(&kq->kq_head);
700 knlist_init_mtx(&kq->kq_sel.si_note, &kq->kq_lock);
701 TASK_INIT(&kq->kq_task, 0, kqueue_task, kq);
704 SLIST_INSERT_HEAD(&fdp->fd_kqlist, kq, kq_list);
705 FILEDESC_XUNLOCK(fdp);
707 finit(fp, FREAD | FWRITE, DTYPE_KQUEUE, kq, &kqueueops);
710 td->td_retval[0] = fd;
715 #ifndef _SYS_SYSPROTO_H_
718 const struct kevent *changelist;
720 struct kevent *eventlist;
722 const struct timespec *timeout;
726 sys_kevent(struct thread *td, struct kevent_args *uap)
728 struct timespec ts, *tsp;
729 struct kevent_copyops k_ops = { uap,
736 struct uio *ktruioin = NULL;
737 struct uio *ktruioout = NULL;
740 if (uap->timeout != NULL) {
741 error = copyin(uap->timeout, &ts, sizeof(ts));
749 if (KTRPOINT(td, KTR_GENIO)) {
750 ktriov.iov_base = uap->changelist;
751 ktriov.iov_len = uap->nchanges * sizeof(struct kevent);
752 ktruio = (struct uio){ .uio_iov = &ktriov, .uio_iovcnt = 1,
753 .uio_segflg = UIO_USERSPACE, .uio_rw = UIO_READ,
755 ktruioin = cloneuio(&ktruio);
756 ktriov.iov_base = uap->eventlist;
757 ktriov.iov_len = uap->nevents * sizeof(struct kevent);
758 ktruioout = cloneuio(&ktruio);
762 error = kern_kevent(td, uap->fd, uap->nchanges, uap->nevents,
766 if (ktruioin != NULL) {
767 ktruioin->uio_resid = uap->nchanges * sizeof(struct kevent);
768 ktrgenio(uap->fd, UIO_WRITE, ktruioin, 0);
769 ktruioout->uio_resid = td->td_retval[0] * sizeof(struct kevent);
770 ktrgenio(uap->fd, UIO_READ, ktruioout, error);
778 * Copy 'count' items into the destination list pointed to by uap->eventlist.
781 kevent_copyout(void *arg, struct kevent *kevp, int count)
783 struct kevent_args *uap;
786 KASSERT(count <= KQ_NEVENTS, ("count (%d) > KQ_NEVENTS", count));
787 uap = (struct kevent_args *)arg;
789 error = copyout(kevp, uap->eventlist, count * sizeof *kevp);
791 uap->eventlist += count;
796 * Copy 'count' items from the list pointed to by uap->changelist.
799 kevent_copyin(void *arg, struct kevent *kevp, int count)
801 struct kevent_args *uap;
804 KASSERT(count <= KQ_NEVENTS, ("count (%d) > KQ_NEVENTS", count));
805 uap = (struct kevent_args *)arg;
807 error = copyin(uap->changelist, kevp, count * sizeof *kevp);
809 uap->changelist += count;
814 kern_kevent(struct thread *td, int fd, int nchanges, int nevents,
815 struct kevent_copyops *k_ops, const struct timespec *timeout)
817 struct kevent keva[KQ_NEVENTS];
818 struct kevent *kevp, *changes;
821 int i, n, nerrors, error;
823 if ((error = fget(td, fd, CAP_POST_EVENT, &fp)) != 0)
825 if ((error = kqueue_acquire(fp, &kq)) != 0)
830 while (nchanges > 0) {
831 n = nchanges > KQ_NEVENTS ? KQ_NEVENTS : nchanges;
832 error = k_ops->k_copyin(k_ops->arg, keva, n);
836 for (i = 0; i < n; i++) {
840 kevp->flags &= ~EV_SYSFLAGS;
841 error = kqueue_register(kq, kevp, td, 1);
842 if (error || (kevp->flags & EV_RECEIPT)) {
844 kevp->flags = EV_ERROR;
846 (void) k_ops->k_copyout(k_ops->arg,
858 td->td_retval[0] = nerrors;
863 error = kqueue_scan(kq, nevents, k_ops, timeout, keva, td);
865 kqueue_release(kq, 0);
872 kqueue_add_filteropts(int filt, struct filterops *filtops)
877 if (filt > 0 || filt + EVFILT_SYSCOUNT < 0) {
879 "trying to add a filterop that is out of range: %d is beyond %d\n",
880 ~filt, EVFILT_SYSCOUNT);
883 mtx_lock(&filterops_lock);
884 if (sysfilt_ops[~filt].for_fop != &null_filtops &&
885 sysfilt_ops[~filt].for_fop != NULL)
888 sysfilt_ops[~filt].for_fop = filtops;
889 sysfilt_ops[~filt].for_refcnt = 0;
891 mtx_unlock(&filterops_lock);
897 kqueue_del_filteropts(int filt)
902 if (filt > 0 || filt + EVFILT_SYSCOUNT < 0)
905 mtx_lock(&filterops_lock);
906 if (sysfilt_ops[~filt].for_fop == &null_filtops ||
907 sysfilt_ops[~filt].for_fop == NULL)
909 else if (sysfilt_ops[~filt].for_refcnt != 0)
912 sysfilt_ops[~filt].for_fop = &null_filtops;
913 sysfilt_ops[~filt].for_refcnt = 0;
915 mtx_unlock(&filterops_lock);
920 static struct filterops *
921 kqueue_fo_find(int filt)
924 if (filt > 0 || filt + EVFILT_SYSCOUNT < 0)
927 mtx_lock(&filterops_lock);
928 sysfilt_ops[~filt].for_refcnt++;
929 if (sysfilt_ops[~filt].for_fop == NULL)
930 sysfilt_ops[~filt].for_fop = &null_filtops;
931 mtx_unlock(&filterops_lock);
933 return sysfilt_ops[~filt].for_fop;
937 kqueue_fo_release(int filt)
940 if (filt > 0 || filt + EVFILT_SYSCOUNT < 0)
943 mtx_lock(&filterops_lock);
944 KASSERT(sysfilt_ops[~filt].for_refcnt > 0,
945 ("filter object refcount not valid on release"));
946 sysfilt_ops[~filt].for_refcnt--;
947 mtx_unlock(&filterops_lock);
951 * A ref to kq (obtained via kqueue_acquire) must be held. waitok will
952 * influence if memory allocation should wait. Make sure it is 0 if you
956 kqueue_register(struct kqueue *kq, struct kevent *kev, struct thread *td, int waitok)
958 struct filterops *fops;
960 struct knote *kn, *tkn;
961 int error, filt, event;
970 fops = kqueue_fo_find(filt);
974 tkn = knote_alloc(waitok); /* prevent waiting with locks */
978 KASSERT(td != NULL, ("td is NULL"));
979 error = fget(td, kev->ident, CAP_POLL_EVENT, &fp);
983 if ((kev->flags & EV_ADD) == EV_ADD && kqueue_expand(kq, fops,
984 kev->ident, 0) != 0) {
988 error = kqueue_expand(kq, fops, kev->ident, waitok);
994 if (fp->f_type == DTYPE_KQUEUE) {
996 * if we add some inteligence about what we are doing,
997 * we should be able to support events on ourselves.
998 * We need to know when we are doing this to prevent
999 * getting both the knlist lock and the kq lock since
1000 * they are the same thing.
1002 if (fp->f_data == kq) {
1007 KQ_GLOBAL_LOCK(&kq_global, haskqglobal);
1011 if (kev->ident < kq->kq_knlistsize) {
1012 SLIST_FOREACH(kn, &kq->kq_knlist[kev->ident], kn_link)
1013 if (kev->filter == kn->kn_filter)
1017 if ((kev->flags & EV_ADD) == EV_ADD)
1018 kqueue_expand(kq, fops, kev->ident, waitok);
1021 if (kq->kq_knhashmask != 0) {
1024 list = &kq->kq_knhash[
1025 KN_HASH((u_long)kev->ident, kq->kq_knhashmask)];
1026 SLIST_FOREACH(kn, list, kn_link)
1027 if (kev->ident == kn->kn_id &&
1028 kev->filter == kn->kn_filter)
1033 /* knote is in the process of changing, wait for it to stablize. */
1034 if (kn != NULL && (kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1035 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1036 kq->kq_state |= KQ_FLUXWAIT;
1037 msleep(kq, &kq->kq_lock, PSOCK | PDROP, "kqflxwt", 0);
1046 * kn now contains the matching knote, or NULL if no match
1049 if (kev->flags & EV_ADD) {
1061 * apply reference counts to knote structure, and
1062 * do not release it at the end of this routine.
1067 kn->kn_sfflags = kev->fflags;
1068 kn->kn_sdata = kev->data;
1071 kn->kn_kevent = *kev;
1072 kn->kn_kevent.flags &= ~(EV_ADD | EV_DELETE |
1073 EV_ENABLE | EV_DISABLE);
1074 kn->kn_status = KN_INFLUX|KN_DETACHED;
1076 error = knote_attach(kn, kq);
1083 if ((error = kn->kn_fop->f_attach(kn)) != 0) {
1090 /* No matching knote and the EV_ADD flag is not set. */
1097 if (kev->flags & EV_DELETE) {
1098 kn->kn_status |= KN_INFLUX;
1100 if (!(kn->kn_status & KN_DETACHED))
1101 kn->kn_fop->f_detach(kn);
1107 * The user may change some filter values after the initial EV_ADD,
1108 * but doing so will not reset any filter which has already been
1111 kn->kn_status |= KN_INFLUX;
1114 kn->kn_kevent.udata = kev->udata;
1115 if (!fops->f_isfd && fops->f_touch != NULL) {
1116 fops->f_touch(kn, kev, EVENT_REGISTER);
1118 kn->kn_sfflags = kev->fflags;
1119 kn->kn_sdata = kev->data;
1123 * We can get here with kn->kn_knlist == NULL. This can happen when
1124 * the initial attach event decides that the event is "completed"
1125 * already. i.e. filt_procattach is called on a zombie process. It
1126 * will call filt_proc which will remove it from the list, and NULL
1130 event = kn->kn_fop->f_event(kn, 0);
1133 KNOTE_ACTIVATE(kn, 1);
1134 kn->kn_status &= ~KN_INFLUX;
1137 if ((kev->flags & EV_DISABLE) &&
1138 ((kn->kn_status & KN_DISABLED) == 0)) {
1139 kn->kn_status |= KN_DISABLED;
1142 if ((kev->flags & EV_ENABLE) && (kn->kn_status & KN_DISABLED)) {
1143 kn->kn_status &= ~KN_DISABLED;
1144 if ((kn->kn_status & KN_ACTIVE) &&
1145 ((kn->kn_status & KN_QUEUED) == 0))
1151 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1157 kqueue_fo_release(filt);
1162 kqueue_acquire(struct file *fp, struct kqueue **kqp)
1170 if (fp->f_type != DTYPE_KQUEUE || kq == NULL)
1174 if ((kq->kq_state & KQ_CLOSING) == KQ_CLOSING) {
1185 kqueue_release(struct kqueue *kq, int locked)
1192 if (kq->kq_refcnt == 1)
1193 wakeup(&kq->kq_refcnt);
1199 kqueue_schedtask(struct kqueue *kq)
1203 KASSERT(((kq->kq_state & KQ_TASKDRAIN) != KQ_TASKDRAIN),
1204 ("scheduling kqueue task while draining"));
1206 if ((kq->kq_state & KQ_TASKSCHED) != KQ_TASKSCHED) {
1207 taskqueue_enqueue(taskqueue_kqueue, &kq->kq_task);
1208 kq->kq_state |= KQ_TASKSCHED;
1213 * Expand the kq to make sure we have storage for fops/ident pair.
1215 * Return 0 on success (or no work necessary), return errno on failure.
1217 * Not calling hashinit w/ waitok (proper malloc flag) should be safe.
1218 * If kqueue_register is called from a non-fd context, there usually/should
1222 kqueue_expand(struct kqueue *kq, struct filterops *fops, uintptr_t ident,
1225 struct klist *list, *tmp_knhash, *to_free;
1226 u_long tmp_knhashmask;
1229 int mflag = waitok ? M_WAITOK : M_NOWAIT;
1236 if (kq->kq_knlistsize <= fd) {
1237 size = kq->kq_knlistsize;
1240 list = malloc(size * sizeof(*list), M_KQUEUE, mflag);
1244 if (kq->kq_knlistsize > fd) {
1248 if (kq->kq_knlist != NULL) {
1249 bcopy(kq->kq_knlist, list,
1250 kq->kq_knlistsize * sizeof(*list));
1251 to_free = kq->kq_knlist;
1252 kq->kq_knlist = NULL;
1254 bzero((caddr_t)list +
1255 kq->kq_knlistsize * sizeof(*list),
1256 (size - kq->kq_knlistsize) * sizeof(*list));
1257 kq->kq_knlistsize = size;
1258 kq->kq_knlist = list;
1263 if (kq->kq_knhashmask == 0) {
1264 tmp_knhash = hashinit(KN_HASHSIZE, M_KQUEUE,
1266 if (tmp_knhash == NULL)
1269 if (kq->kq_knhashmask == 0) {
1270 kq->kq_knhash = tmp_knhash;
1271 kq->kq_knhashmask = tmp_knhashmask;
1273 to_free = tmp_knhash;
1278 free(to_free, M_KQUEUE);
1285 kqueue_task(void *arg, int pending)
1293 KQ_GLOBAL_LOCK(&kq_global, haskqglobal);
1296 KNOTE_LOCKED(&kq->kq_sel.si_note, 0);
1298 kq->kq_state &= ~KQ_TASKSCHED;
1299 if ((kq->kq_state & KQ_TASKDRAIN) == KQ_TASKDRAIN) {
1300 wakeup(&kq->kq_state);
1303 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1307 * Scan, update kn_data (if not ONESHOT), and copyout triggered events.
1308 * We treat KN_MARKER knotes as if they are INFLUX.
1311 kqueue_scan(struct kqueue *kq, int maxevents, struct kevent_copyops *k_ops,
1312 const struct timespec *tsp, struct kevent *keva, struct thread *td)
1314 struct kevent *kevp;
1315 struct timeval atv, rtv, ttv;
1316 struct knote *kn, *marker;
1317 int count, timeout, nkev, error, influx;
1318 int haskqglobal, touch;
1329 TIMESPEC_TO_TIMEVAL(&atv, tsp);
1330 if (itimerfix(&atv)) {
1334 if (tsp->tv_sec == 0 && tsp->tv_nsec == 0)
1337 timeout = atv.tv_sec > 24 * 60 * 60 ?
1338 24 * 60 * 60 * hz : tvtohz(&atv);
1339 getmicrouptime(&rtv);
1340 timevaladd(&atv, &rtv);
1346 marker = knote_alloc(1);
1347 if (marker == NULL) {
1351 marker->kn_status = KN_MARKER;
1356 if (atv.tv_sec || atv.tv_usec) {
1357 getmicrouptime(&rtv);
1358 if (timevalcmp(&rtv, &atv, >=))
1361 timevalsub(&ttv, &rtv);
1362 timeout = ttv.tv_sec > 24 * 60 * 60 ?
1363 24 * 60 * 60 * hz : tvtohz(&ttv);
1368 if (kq->kq_count == 0) {
1370 error = EWOULDBLOCK;
1372 kq->kq_state |= KQ_SLEEP;
1373 error = msleep(kq, &kq->kq_lock, PSOCK | PCATCH,
1378 /* don't restart after signals... */
1379 if (error == ERESTART)
1381 else if (error == EWOULDBLOCK)
1386 TAILQ_INSERT_TAIL(&kq->kq_head, marker, kn_tqe);
1390 kn = TAILQ_FIRST(&kq->kq_head);
1392 if ((kn->kn_status == KN_MARKER && kn != marker) ||
1393 (kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1398 kq->kq_state |= KQ_FLUXWAIT;
1399 error = msleep(kq, &kq->kq_lock, PSOCK,
1404 TAILQ_REMOVE(&kq->kq_head, kn, kn_tqe);
1405 if ((kn->kn_status & KN_DISABLED) == KN_DISABLED) {
1406 kn->kn_status &= ~KN_QUEUED;
1412 if (count == maxevents)
1416 KASSERT((kn->kn_status & KN_INFLUX) == 0,
1417 ("KN_INFLUX set when not suppose to be"));
1419 if ((kn->kn_flags & EV_ONESHOT) == EV_ONESHOT) {
1420 kn->kn_status &= ~KN_QUEUED;
1421 kn->kn_status |= KN_INFLUX;
1425 * We don't need to lock the list since we've marked
1428 *kevp = kn->kn_kevent;
1429 if (!(kn->kn_status & KN_DETACHED))
1430 kn->kn_fop->f_detach(kn);
1435 kn->kn_status |= KN_INFLUX;
1437 if ((kn->kn_status & KN_KQUEUE) == KN_KQUEUE)
1438 KQ_GLOBAL_LOCK(&kq_global, haskqglobal);
1440 if (kn->kn_fop->f_event(kn, 0) == 0) {
1442 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1444 ~(KN_QUEUED | KN_ACTIVE | KN_INFLUX);
1450 touch = (!kn->kn_fop->f_isfd &&
1451 kn->kn_fop->f_touch != NULL);
1453 kn->kn_fop->f_touch(kn, kevp, EVENT_PROCESS);
1455 *kevp = kn->kn_kevent;
1457 KQ_GLOBAL_UNLOCK(&kq_global, haskqglobal);
1458 if (kn->kn_flags & (EV_CLEAR | EV_DISPATCH)) {
1460 * Manually clear knotes who weren't
1463 if (touch == 0 && kn->kn_flags & EV_CLEAR) {
1467 if (kn->kn_flags & EV_DISPATCH)
1468 kn->kn_status |= KN_DISABLED;
1469 kn->kn_status &= ~(KN_QUEUED | KN_ACTIVE);
1472 TAILQ_INSERT_TAIL(&kq->kq_head, kn, kn_tqe);
1474 kn->kn_status &= ~(KN_INFLUX);
1479 /* we are returning a copy to the user */
1484 if (nkev == KQ_NEVENTS) {
1487 error = k_ops->k_copyout(k_ops->arg, keva, nkev);
1495 TAILQ_REMOVE(&kq->kq_head, marker, kn_tqe);
1503 error = k_ops->k_copyout(k_ops->arg, keva, nkev);
1504 td->td_retval[0] = maxevents - count;
1510 * This could be expanded to call kqueue_scan, if desired.
1514 kqueue_read(struct file *fp, struct uio *uio, struct ucred *active_cred,
1515 int flags, struct thread *td)
1522 kqueue_write(struct file *fp, struct uio *uio, struct ucred *active_cred,
1523 int flags, struct thread *td)
1530 kqueue_truncate(struct file *fp, off_t length, struct ucred *active_cred,
1539 kqueue_ioctl(struct file *fp, u_long cmd, void *data,
1540 struct ucred *active_cred, struct thread *td)
1543 * Enabling sigio causes two major problems:
1544 * 1) infinite recursion:
1545 * Synopsys: kevent is being used to track signals and have FIOASYNC
1546 * set. On receipt of a signal this will cause a kqueue to recurse
1547 * into itself over and over. Sending the sigio causes the kqueue
1548 * to become ready, which in turn posts sigio again, forever.
1549 * Solution: this can be solved by setting a flag in the kqueue that
1550 * we have a SIGIO in progress.
1551 * 2) locking problems:
1552 * Synopsys: Kqueue is a leaf subsystem, but adding signalling puts
1553 * us above the proc and pgrp locks.
1554 * Solution: Post a signal using an async mechanism, being sure to
1555 * record a generation count in the delivery so that we do not deliver
1556 * a signal to the wrong process.
1558 * Note, these two mechanisms are somewhat mutually exclusive!
1567 kq->kq_state |= KQ_ASYNC;
1569 kq->kq_state &= ~KQ_ASYNC;
1574 return (fsetown(*(int *)data, &kq->kq_sigio));
1577 *(int *)data = fgetown(&kq->kq_sigio);
1587 kqueue_poll(struct file *fp, int events, struct ucred *active_cred,
1594 if ((error = kqueue_acquire(fp, &kq)))
1598 if (events & (POLLIN | POLLRDNORM)) {
1600 revents |= events & (POLLIN | POLLRDNORM);
1602 selrecord(td, &kq->kq_sel);
1603 if (SEL_WAITING(&kq->kq_sel))
1604 kq->kq_state |= KQ_SEL;
1607 kqueue_release(kq, 1);
1614 kqueue_stat(struct file *fp, struct stat *st, struct ucred *active_cred,
1618 bzero((void *)st, sizeof *st);
1620 * We no longer return kq_count because the unlocked value is useless.
1621 * If you spent all this time getting the count, why not spend your
1622 * syscall better by calling kevent?
1624 * XXX - This is needed for libc_r.
1626 st->st_mode = S_IFIFO;
1632 kqueue_close(struct file *fp, struct thread *td)
1634 struct kqueue *kq = fp->f_data;
1635 struct filedesc *fdp;
1640 if ((error = kqueue_acquire(fp, &kq)))
1645 KASSERT((kq->kq_state & KQ_CLOSING) != KQ_CLOSING,
1646 ("kqueue already closing"));
1647 kq->kq_state |= KQ_CLOSING;
1648 if (kq->kq_refcnt > 1)
1649 msleep(&kq->kq_refcnt, &kq->kq_lock, PSOCK, "kqclose", 0);
1651 KASSERT(kq->kq_refcnt == 1, ("other refs are out there!"));
1654 KASSERT(knlist_empty(&kq->kq_sel.si_note),
1655 ("kqueue's knlist not empty"));
1657 for (i = 0; i < kq->kq_knlistsize; i++) {
1658 while ((kn = SLIST_FIRST(&kq->kq_knlist[i])) != NULL) {
1659 if ((kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1660 kq->kq_state |= KQ_FLUXWAIT;
1661 msleep(kq, &kq->kq_lock, PSOCK, "kqclo1", 0);
1664 kn->kn_status |= KN_INFLUX;
1666 if (!(kn->kn_status & KN_DETACHED))
1667 kn->kn_fop->f_detach(kn);
1672 if (kq->kq_knhashmask != 0) {
1673 for (i = 0; i <= kq->kq_knhashmask; i++) {
1674 while ((kn = SLIST_FIRST(&kq->kq_knhash[i])) != NULL) {
1675 if ((kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1676 kq->kq_state |= KQ_FLUXWAIT;
1677 msleep(kq, &kq->kq_lock, PSOCK,
1681 kn->kn_status |= KN_INFLUX;
1683 if (!(kn->kn_status & KN_DETACHED))
1684 kn->kn_fop->f_detach(kn);
1691 if ((kq->kq_state & KQ_TASKSCHED) == KQ_TASKSCHED) {
1692 kq->kq_state |= KQ_TASKDRAIN;
1693 msleep(&kq->kq_state, &kq->kq_lock, PSOCK, "kqtqdr", 0);
1696 if ((kq->kq_state & KQ_SEL) == KQ_SEL) {
1697 selwakeuppri(&kq->kq_sel, PSOCK);
1698 if (!SEL_WAITING(&kq->kq_sel))
1699 kq->kq_state &= ~KQ_SEL;
1704 FILEDESC_XLOCK(fdp);
1705 SLIST_REMOVE(&fdp->fd_kqlist, kq, kqueue, kq_list);
1706 FILEDESC_XUNLOCK(fdp);
1708 seldrain(&kq->kq_sel);
1709 knlist_destroy(&kq->kq_sel.si_note);
1710 mtx_destroy(&kq->kq_lock);
1713 if (kq->kq_knhash != NULL)
1714 free(kq->kq_knhash, M_KQUEUE);
1715 if (kq->kq_knlist != NULL)
1716 free(kq->kq_knlist, M_KQUEUE);
1718 funsetown(&kq->kq_sigio);
1726 kqueue_wakeup(struct kqueue *kq)
1730 if ((kq->kq_state & KQ_SLEEP) == KQ_SLEEP) {
1731 kq->kq_state &= ~KQ_SLEEP;
1734 if ((kq->kq_state & KQ_SEL) == KQ_SEL) {
1735 selwakeuppri(&kq->kq_sel, PSOCK);
1736 if (!SEL_WAITING(&kq->kq_sel))
1737 kq->kq_state &= ~KQ_SEL;
1739 if (!knlist_empty(&kq->kq_sel.si_note))
1740 kqueue_schedtask(kq);
1741 if ((kq->kq_state & KQ_ASYNC) == KQ_ASYNC) {
1742 pgsigio(&kq->kq_sigio, SIGIO, 0);
1747 * Walk down a list of knotes, activating them if their event has triggered.
1749 * There is a possibility to optimize in the case of one kq watching another.
1750 * Instead of scheduling a task to wake it up, you could pass enough state
1751 * down the chain to make up the parent kqueue. Make this code functional
1755 knote(struct knlist *list, long hint, int lockflags)
1764 KNL_ASSERT_LOCK(list, lockflags & KNF_LISTLOCKED);
1766 if ((lockflags & KNF_LISTLOCKED) == 0)
1767 list->kl_lock(list->kl_lockarg);
1770 * If we unlock the list lock (and set KN_INFLUX), we can eliminate
1771 * the kqueue scheduling, but this will introduce four
1772 * lock/unlock's for each knote to test. If we do, continue to use
1773 * SLIST_FOREACH, SLIST_FOREACH_SAFE is not safe in our case, it is
1774 * only safe if you want to remove the current item, which we are
1777 SLIST_FOREACH(kn, &list->kl_list, kn_selnext) {
1779 if ((kn->kn_status & KN_INFLUX) != KN_INFLUX) {
1781 if ((kn->kn_status & KN_INFLUX) == KN_INFLUX) {
1783 } else if ((lockflags & KNF_NOKQLOCK) != 0) {
1784 kn->kn_status |= KN_INFLUX;
1786 error = kn->kn_fop->f_event(kn, hint);
1788 kn->kn_status &= ~KN_INFLUX;
1790 KNOTE_ACTIVATE(kn, 1);
1793 kn->kn_status |= KN_HASKQLOCK;
1794 if (kn->kn_fop->f_event(kn, hint))
1795 KNOTE_ACTIVATE(kn, 1);
1796 kn->kn_status &= ~KN_HASKQLOCK;
1802 if ((lockflags & KNF_LISTLOCKED) == 0)
1803 list->kl_unlock(list->kl_lockarg);
1807 * add a knote to a knlist
1810 knlist_add(struct knlist *knl, struct knote *kn, int islocked)
1812 KNL_ASSERT_LOCK(knl, islocked);
1813 KQ_NOTOWNED(kn->kn_kq);
1814 KASSERT((kn->kn_status & (KN_INFLUX|KN_DETACHED)) ==
1815 (KN_INFLUX|KN_DETACHED), ("knote not KN_INFLUX and KN_DETACHED"));
1817 knl->kl_lock(knl->kl_lockarg);
1818 SLIST_INSERT_HEAD(&knl->kl_list, kn, kn_selnext);
1820 knl->kl_unlock(knl->kl_lockarg);
1822 kn->kn_knlist = knl;
1823 kn->kn_status &= ~KN_DETACHED;
1824 KQ_UNLOCK(kn->kn_kq);
1828 knlist_remove_kq(struct knlist *knl, struct knote *kn, int knlislocked, int kqislocked)
1830 KASSERT(!(!!kqislocked && !knlislocked), ("kq locked w/o knl locked"));
1831 KNL_ASSERT_LOCK(knl, knlislocked);
1832 mtx_assert(&kn->kn_kq->kq_lock, kqislocked ? MA_OWNED : MA_NOTOWNED);
1834 KASSERT((kn->kn_status & (KN_INFLUX|KN_DETACHED)) == KN_INFLUX,
1835 ("knlist_remove called w/o knote being KN_INFLUX or already removed"));
1837 knl->kl_lock(knl->kl_lockarg);
1838 SLIST_REMOVE(&knl->kl_list, kn, knote, kn_selnext);
1839 kn->kn_knlist = NULL;
1841 knl->kl_unlock(knl->kl_lockarg);
1844 kn->kn_status |= KN_DETACHED;
1846 KQ_UNLOCK(kn->kn_kq);
1850 * remove all knotes from a specified klist
1853 knlist_remove(struct knlist *knl, struct knote *kn, int islocked)
1856 knlist_remove_kq(knl, kn, islocked, 0);
1860 * remove knote from a specified klist while in f_event handler.
1863 knlist_remove_inevent(struct knlist *knl, struct knote *kn)
1866 knlist_remove_kq(knl, kn, 1,
1867 (kn->kn_status & KN_HASKQLOCK) == KN_HASKQLOCK);
1871 knlist_empty(struct knlist *knl)
1874 KNL_ASSERT_LOCKED(knl);
1875 return SLIST_EMPTY(&knl->kl_list);
1878 static struct mtx knlist_lock;
1879 MTX_SYSINIT(knlist_lock, &knlist_lock, "knlist lock for lockless objects",
1881 static void knlist_mtx_lock(void *arg);
1882 static void knlist_mtx_unlock(void *arg);
1885 knlist_mtx_lock(void *arg)
1888 mtx_lock((struct mtx *)arg);
1892 knlist_mtx_unlock(void *arg)
1895 mtx_unlock((struct mtx *)arg);
1899 knlist_mtx_assert_locked(void *arg)
1902 mtx_assert((struct mtx *)arg, MA_OWNED);
1906 knlist_mtx_assert_unlocked(void *arg)
1909 mtx_assert((struct mtx *)arg, MA_NOTOWNED);
1913 knlist_rw_rlock(void *arg)
1916 rw_rlock((struct rwlock *)arg);
1920 knlist_rw_runlock(void *arg)
1923 rw_runlock((struct rwlock *)arg);
1927 knlist_rw_assert_locked(void *arg)
1930 rw_assert((struct rwlock *)arg, RA_LOCKED);
1934 knlist_rw_assert_unlocked(void *arg)
1937 rw_assert((struct rwlock *)arg, RA_UNLOCKED);
1941 knlist_init(struct knlist *knl, void *lock, void (*kl_lock)(void *),
1942 void (*kl_unlock)(void *),
1943 void (*kl_assert_locked)(void *), void (*kl_assert_unlocked)(void *))
1947 knl->kl_lockarg = &knlist_lock;
1949 knl->kl_lockarg = lock;
1951 if (kl_lock == NULL)
1952 knl->kl_lock = knlist_mtx_lock;
1954 knl->kl_lock = kl_lock;
1955 if (kl_unlock == NULL)
1956 knl->kl_unlock = knlist_mtx_unlock;
1958 knl->kl_unlock = kl_unlock;
1959 if (kl_assert_locked == NULL)
1960 knl->kl_assert_locked = knlist_mtx_assert_locked;
1962 knl->kl_assert_locked = kl_assert_locked;
1963 if (kl_assert_unlocked == NULL)
1964 knl->kl_assert_unlocked = knlist_mtx_assert_unlocked;
1966 knl->kl_assert_unlocked = kl_assert_unlocked;
1968 SLIST_INIT(&knl->kl_list);
1972 knlist_init_mtx(struct knlist *knl, struct mtx *lock)
1975 knlist_init(knl, lock, NULL, NULL, NULL, NULL);
1979 knlist_init_rw_reader(struct knlist *knl, struct rwlock *lock)
1982 knlist_init(knl, lock, knlist_rw_rlock, knlist_rw_runlock,
1983 knlist_rw_assert_locked, knlist_rw_assert_unlocked);
1987 knlist_destroy(struct knlist *knl)
1992 * if we run across this error, we need to find the offending
1993 * driver and have it call knlist_clear.
1995 if (!SLIST_EMPTY(&knl->kl_list))
1996 printf("WARNING: destroying knlist w/ knotes on it!\n");
1999 knl->kl_lockarg = knl->kl_lock = knl->kl_unlock = NULL;
2000 SLIST_INIT(&knl->kl_list);
2004 * Even if we are locked, we may need to drop the lock to allow any influx
2005 * knotes time to "settle".
2008 knlist_cleardel(struct knlist *knl, struct thread *td, int islocked, int killkn)
2010 struct knote *kn, *kn2;
2014 KNL_ASSERT_LOCKED(knl);
2016 KNL_ASSERT_UNLOCKED(knl);
2017 again: /* need to reacquire lock since we have dropped it */
2018 knl->kl_lock(knl->kl_lockarg);
2021 SLIST_FOREACH_SAFE(kn, &knl->kl_list, kn_selnext, kn2) {
2024 if ((kn->kn_status & KN_INFLUX)) {
2028 knlist_remove_kq(knl, kn, 1, 1);
2030 kn->kn_status |= KN_INFLUX | KN_DETACHED;
2034 /* Make sure cleared knotes disappear soon */
2035 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
2041 if (!SLIST_EMPTY(&knl->kl_list)) {
2042 /* there are still KN_INFLUX remaining */
2043 kn = SLIST_FIRST(&knl->kl_list);
2046 KASSERT(kn->kn_status & KN_INFLUX,
2047 ("knote removed w/o list lock"));
2048 knl->kl_unlock(knl->kl_lockarg);
2049 kq->kq_state |= KQ_FLUXWAIT;
2050 msleep(kq, &kq->kq_lock, PSOCK | PDROP, "kqkclr", 0);
2056 KNL_ASSERT_LOCKED(knl);
2058 knl->kl_unlock(knl->kl_lockarg);
2059 KNL_ASSERT_UNLOCKED(knl);
2064 * Remove all knotes referencing a specified fd must be called with FILEDESC
2065 * lock. This prevents a race where a new fd comes along and occupies the
2066 * entry and we attach a knote to the fd.
2069 knote_fdclose(struct thread *td, int fd)
2071 struct filedesc *fdp = td->td_proc->p_fd;
2076 FILEDESC_XLOCK_ASSERT(fdp);
2079 * We shouldn't have to worry about new kevents appearing on fd
2080 * since filedesc is locked.
2082 SLIST_FOREACH(kq, &fdp->fd_kqlist, kq_list) {
2087 while (kq->kq_knlistsize > fd &&
2088 (kn = SLIST_FIRST(&kq->kq_knlist[fd])) != NULL) {
2089 if (kn->kn_status & KN_INFLUX) {
2090 /* someone else might be waiting on our knote */
2093 kq->kq_state |= KQ_FLUXWAIT;
2094 msleep(kq, &kq->kq_lock, PSOCK, "kqflxwt", 0);
2097 kn->kn_status |= KN_INFLUX;
2099 if (!(kn->kn_status & KN_DETACHED))
2100 kn->kn_fop->f_detach(kn);
2110 knote_attach(struct knote *kn, struct kqueue *kq)
2114 KASSERT(kn->kn_status & KN_INFLUX, ("knote not marked INFLUX"));
2117 if (kn->kn_fop->f_isfd) {
2118 if (kn->kn_id >= kq->kq_knlistsize)
2120 list = &kq->kq_knlist[kn->kn_id];
2122 if (kq->kq_knhash == NULL)
2124 list = &kq->kq_knhash[KN_HASH(kn->kn_id, kq->kq_knhashmask)];
2127 SLIST_INSERT_HEAD(list, kn, kn_link);
2133 * knote must already have been detached using the f_detach method.
2134 * no lock need to be held, it is assumed that the KN_INFLUX flag is set
2135 * to prevent other removal.
2138 knote_drop(struct knote *kn, struct thread *td)
2146 KASSERT((kn->kn_status & KN_INFLUX) == KN_INFLUX,
2147 ("knote_drop called without KN_INFLUX set in kn_status"));
2150 if (kn->kn_fop->f_isfd)
2151 list = &kq->kq_knlist[kn->kn_id];
2153 list = &kq->kq_knhash[KN_HASH(kn->kn_id, kq->kq_knhashmask)];
2155 if (!SLIST_EMPTY(list))
2156 SLIST_REMOVE(list, kn, knote, kn_link);
2157 if (kn->kn_status & KN_QUEUED)
2161 if (kn->kn_fop->f_isfd) {
2162 fdrop(kn->kn_fp, td);
2165 kqueue_fo_release(kn->kn_kevent.filter);
2171 knote_enqueue(struct knote *kn)
2173 struct kqueue *kq = kn->kn_kq;
2175 KQ_OWNED(kn->kn_kq);
2176 KASSERT((kn->kn_status & KN_QUEUED) == 0, ("knote already queued"));
2178 TAILQ_INSERT_TAIL(&kq->kq_head, kn, kn_tqe);
2179 kn->kn_status |= KN_QUEUED;
2185 knote_dequeue(struct knote *kn)
2187 struct kqueue *kq = kn->kn_kq;
2189 KQ_OWNED(kn->kn_kq);
2190 KASSERT(kn->kn_status & KN_QUEUED, ("knote not queued"));
2192 TAILQ_REMOVE(&kq->kq_head, kn, kn_tqe);
2193 kn->kn_status &= ~KN_QUEUED;
2201 knote_zone = uma_zcreate("KNOTE", sizeof(struct knote), NULL, NULL,
2202 NULL, NULL, UMA_ALIGN_PTR, 0);
2204 SYSINIT(knote, SI_SUB_PSEUDO, SI_ORDER_ANY, knote_init, NULL);
2206 static struct knote *
2207 knote_alloc(int waitok)
2209 return ((struct knote *)uma_zalloc(knote_zone,
2210 (waitok ? M_WAITOK : M_NOWAIT)|M_ZERO));
2214 knote_free(struct knote *kn)
2217 uma_zfree(knote_zone, kn);
2221 * Register the kev w/ the kq specified by fd.
2224 kqfd_register(int fd, struct kevent *kev, struct thread *td, int waitok)
2230 if ((error = fget(td, fd, CAP_POST_EVENT, &fp)) != 0)
2232 if ((error = kqueue_acquire(fp, &kq)) != 0)
2235 error = kqueue_register(kq, kev, td, waitok);
2237 kqueue_release(kq, 0);