2 * Copyright (c) 1999,2000,2001 Jonathan Lemon <jlemon@FreeBSD.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * $FreeBSD: src/sys/kern/kern_event.c,v 1.2.2.10 2004/04/04 07:03:14 cperciva Exp $
27 * $DragonFly: src/sys/kern/kern_event.c,v 1.33 2007/02/03 17:05:57 corecode Exp $
30 #include <sys/param.h>
31 #include <sys/systm.h>
32 #include <sys/kernel.h>
34 #include <sys/malloc.h>
35 #include <sys/unistd.h>
38 #include <sys/fcntl.h>
39 #include <sys/queue.h>
40 #include <sys/event.h>
41 #include <sys/eventvar.h>
42 #include <sys/protosw.h>
43 #include <sys/socket.h>
44 #include <sys/socketvar.h>
46 #include <sys/sysctl.h>
47 #include <sys/sysproto.h>
48 #include <sys/thread.h>
50 #include <sys/signalvar.h>
51 #include <sys/filio.h>
54 #include <sys/thread2.h>
55 #include <sys/file2.h>
56 #include <sys/mplock2.h>
59 * Global token for kqueue subsystem
61 struct lwkt_token kq_token = LWKT_TOKEN_INITIALIZER(kq_token);
62 SYSCTL_LONG(_lwkt, OID_AUTO, kq_collisions,
63 CTLFLAG_RW, &kq_token.t_collisions, 0,
64 "Collision counter of kq_token");
66 MALLOC_DEFINE(M_KQUEUE, "kqueue", "memory for kqueue system");
68 struct kevent_copyin_args {
69 struct kevent_args *ka;
73 static int kqueue_sleep(struct kqueue *kq, struct timespec *tsp);
74 static int kqueue_scan(struct kqueue *kq, struct kevent *kevp, int count,
75 struct knote *marker);
76 static int kqueue_read(struct file *fp, struct uio *uio,
77 struct ucred *cred, int flags);
78 static int kqueue_write(struct file *fp, struct uio *uio,
79 struct ucred *cred, int flags);
80 static int kqueue_ioctl(struct file *fp, u_long com, caddr_t data,
81 struct ucred *cred, struct sysmsg *msg);
82 static int kqueue_kqfilter(struct file *fp, struct knote *kn);
83 static int kqueue_stat(struct file *fp, struct stat *st,
85 static int kqueue_close(struct file *fp);
86 static void kqueue_wakeup(struct kqueue *kq);
87 static int filter_attach(struct knote *kn);
88 static int filter_event(struct knote *kn, long hint);
93 static struct fileops kqueueops = {
94 .fo_read = kqueue_read,
95 .fo_write = kqueue_write,
96 .fo_ioctl = kqueue_ioctl,
97 .fo_kqfilter = kqueue_kqfilter,
98 .fo_stat = kqueue_stat,
99 .fo_close = kqueue_close,
100 .fo_shutdown = nofo_shutdown
103 static void knote_attach(struct knote *kn);
104 static void knote_drop(struct knote *kn);
105 static void knote_detach_and_drop(struct knote *kn);
106 static void knote_enqueue(struct knote *kn);
107 static void knote_dequeue(struct knote *kn);
108 static struct knote *knote_alloc(void);
109 static void knote_free(struct knote *kn);
111 static void filt_kqdetach(struct knote *kn);
112 static int filt_kqueue(struct knote *kn, long hint);
113 static int filt_procattach(struct knote *kn);
114 static void filt_procdetach(struct knote *kn);
115 static int filt_proc(struct knote *kn, long hint);
116 static int filt_fileattach(struct knote *kn);
117 static void filt_timerexpire(void *knx);
118 static int filt_timerattach(struct knote *kn);
119 static void filt_timerdetach(struct knote *kn);
120 static int filt_timer(struct knote *kn, long hint);
122 static struct filterops file_filtops =
123 { FILTEROP_ISFD, filt_fileattach, NULL, NULL };
124 static struct filterops kqread_filtops =
125 { FILTEROP_ISFD, NULL, filt_kqdetach, filt_kqueue };
126 static struct filterops proc_filtops =
127 { 0, filt_procattach, filt_procdetach, filt_proc };
128 static struct filterops timer_filtops =
129 { 0, filt_timerattach, filt_timerdetach, filt_timer };
131 static int kq_ncallouts = 0;
132 static int kq_calloutmax = (4 * 1024);
133 SYSCTL_INT(_kern, OID_AUTO, kq_calloutmax, CTLFLAG_RW,
134 &kq_calloutmax, 0, "Maximum number of callouts allocated for kqueue");
135 static int kq_checkloop = 1000000;
136 SYSCTL_INT(_kern, OID_AUTO, kq_checkloop, CTLFLAG_RW,
137 &kq_checkloop, 0, "Maximum number of callouts allocated for kqueue");
139 #define KNOTE_ACTIVATE(kn) do { \
140 kn->kn_status |= KN_ACTIVE; \
141 if ((kn->kn_status & (KN_QUEUED | KN_DISABLED)) == 0) \
145 #define KN_HASHSIZE 64 /* XXX should be tunable */
146 #define KN_HASH(val, mask) (((val) ^ (val >> 8)) & (mask))
148 extern struct filterops aio_filtops;
149 extern struct filterops sig_filtops;
152 * Table for for all system-defined filters.
154 static struct filterops *sysfilt_ops[] = {
155 &file_filtops, /* EVFILT_READ */
156 &file_filtops, /* EVFILT_WRITE */
157 &aio_filtops, /* EVFILT_AIO */
158 &file_filtops, /* EVFILT_VNODE */
159 &proc_filtops, /* EVFILT_PROC */
160 &sig_filtops, /* EVFILT_SIGNAL */
161 &timer_filtops, /* EVFILT_TIMER */
162 &file_filtops, /* EVFILT_EXCEPT */
166 filt_fileattach(struct knote *kn)
168 return (fo_kqfilter(kn->kn_fp, kn));
175 kqueue_kqfilter(struct file *fp, struct knote *kn)
177 struct kqueue *kq = (struct kqueue *)kn->kn_fp->f_data;
179 if (kn->kn_filter != EVFILT_READ)
182 kn->kn_fop = &kqread_filtops;
183 knote_insert(&kq->kq_kqinfo.ki_note, kn);
188 filt_kqdetach(struct knote *kn)
190 struct kqueue *kq = (struct kqueue *)kn->kn_fp->f_data;
192 knote_remove(&kq->kq_kqinfo.ki_note, kn);
197 filt_kqueue(struct knote *kn, long hint)
199 struct kqueue *kq = (struct kqueue *)kn->kn_fp->f_data;
201 kn->kn_data = kq->kq_count;
202 return (kn->kn_data > 0);
206 filt_procattach(struct knote *kn)
212 p = pfind(kn->kn_id);
213 if (p == NULL && (kn->kn_sfflags & NOTE_EXIT)) {
214 p = zpfind(kn->kn_id);
220 if (!PRISON_CHECK(curthread->td_ucred, p->p_ucred)) {
226 lwkt_gettoken(&p->p_token);
227 kn->kn_ptr.p_proc = p;
228 kn->kn_flags |= EV_CLEAR; /* automatically set */
231 * internal flag indicating registration done by kernel
233 if (kn->kn_flags & EV_FLAG1) {
234 kn->kn_data = kn->kn_sdata; /* ppid */
235 kn->kn_fflags = NOTE_CHILD;
236 kn->kn_flags &= ~EV_FLAG1;
239 knote_insert(&p->p_klist, kn);
242 * Immediately activate any exit notes if the target process is a
243 * zombie. This is necessary to handle the case where the target
244 * process, e.g. a child, dies before the kevent is negistered.
246 if (immediate && filt_proc(kn, NOTE_EXIT))
248 lwkt_reltoken(&p->p_token);
255 * The knote may be attached to a different process, which may exit,
256 * leaving nothing for the knote to be attached to. So when the process
257 * exits, the knote is marked as DETACHED and also flagged as ONESHOT so
258 * it will be deleted when read out. However, as part of the knote deletion,
259 * this routine is called, so a check is needed to avoid actually performing
260 * a detach, because the original process does not exist any more.
263 filt_procdetach(struct knote *kn)
267 if (kn->kn_status & KN_DETACHED)
269 /* XXX locking? take proc_token here? */
270 p = kn->kn_ptr.p_proc;
271 knote_remove(&p->p_klist, kn);
275 filt_proc(struct knote *kn, long hint)
280 * mask off extra data
282 event = (u_int)hint & NOTE_PCTRLMASK;
285 * if the user is interested in this event, record it.
287 if (kn->kn_sfflags & event)
288 kn->kn_fflags |= event;
291 * Process is gone, so flag the event as finished. Detach the
292 * knote from the process now because the process will be poof,
295 if (event == NOTE_EXIT) {
296 struct proc *p = kn->kn_ptr.p_proc;
297 if ((kn->kn_status & KN_DETACHED) == 0) {
298 knote_remove(&p->p_klist, kn);
299 kn->kn_status |= KN_DETACHED;
300 kn->kn_data = p->p_xstat;
301 kn->kn_ptr.p_proc = NULL;
303 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
308 * process forked, and user wants to track the new process,
309 * so attach a new knote to it, and immediately report an
310 * event with the parent's pid.
312 if ((event == NOTE_FORK) && (kn->kn_sfflags & NOTE_TRACK)) {
317 * register knote with new process.
319 kev.ident = hint & NOTE_PDATAMASK; /* pid */
320 kev.filter = kn->kn_filter;
321 kev.flags = kn->kn_flags | EV_ADD | EV_ENABLE | EV_FLAG1;
322 kev.fflags = kn->kn_sfflags;
323 kev.data = kn->kn_id; /* parent */
324 kev.udata = kn->kn_kevent.udata; /* preserve udata */
325 error = kqueue_register(kn->kn_kq, &kev);
327 kn->kn_fflags |= NOTE_TRACKERR;
330 return (kn->kn_fflags != 0);
334 * The callout interlocks with callout_stop() (or should), so the
335 * knote should still be a valid structure. However the timeout
336 * can race a deletion so if KN_DELETING is set we just don't touch
340 filt_timerexpire(void *knx)
342 struct knote *kn = knx;
343 struct callout *calloutp;
347 lwkt_gettoken(&kq_token);
348 if ((kn->kn_status & KN_DELETING) == 0) {
352 if ((kn->kn_flags & EV_ONESHOT) == 0) {
353 tv.tv_sec = kn->kn_sdata / 1000;
354 tv.tv_usec = (kn->kn_sdata % 1000) * 1000;
355 tticks = tvtohz_high(&tv);
356 calloutp = (struct callout *)kn->kn_hook;
357 callout_reset(calloutp, tticks, filt_timerexpire, kn);
360 lwkt_reltoken(&kq_token);
364 * data contains amount of time to sleep, in milliseconds
367 filt_timerattach(struct knote *kn)
369 struct callout *calloutp;
373 if (kq_ncallouts >= kq_calloutmax)
377 tv.tv_sec = kn->kn_sdata / 1000;
378 tv.tv_usec = (kn->kn_sdata % 1000) * 1000;
379 tticks = tvtohz_high(&tv);
381 kn->kn_flags |= EV_CLEAR; /* automatically set */
382 MALLOC(calloutp, struct callout *, sizeof(*calloutp),
384 callout_init(calloutp);
385 kn->kn_hook = (caddr_t)calloutp;
386 callout_reset(calloutp, tticks, filt_timerexpire, kn);
392 filt_timerdetach(struct knote *kn)
394 struct callout *calloutp;
396 calloutp = (struct callout *)kn->kn_hook;
397 callout_stop(calloutp);
398 FREE(calloutp, M_KQUEUE);
403 filt_timer(struct knote *kn, long hint)
406 return (kn->kn_data != 0);
410 * Acquire a knote, return non-zero on success, 0 on failure.
412 * If we cannot acquire the knote we sleep and return 0. The knote
413 * may be stale on return in this case and the caller must restart
414 * whatever loop they are in.
418 knote_acquire(struct knote *kn)
420 if (kn->kn_status & KN_PROCESSING) {
421 kn->kn_status |= KN_WAITING | KN_REPROCESS;
422 tsleep(kn, 0, "kqepts", hz);
423 /* knote may be stale now */
426 kn->kn_status |= KN_PROCESSING;
431 * Release an acquired knote, clearing KN_PROCESSING and handling any
432 * KN_REPROCESS events.
434 * Non-zero is returned if the knote is destroyed.
438 knote_release(struct knote *kn)
440 while (kn->kn_status & KN_REPROCESS) {
441 kn->kn_status &= ~KN_REPROCESS;
442 if (kn->kn_status & KN_WAITING) {
443 kn->kn_status &= ~KN_WAITING;
446 if (kn->kn_status & KN_DELETING) {
447 knote_detach_and_drop(kn);
451 if (filter_event(kn, 0))
454 kn->kn_status &= ~KN_PROCESSING;
459 * Initialize a kqueue.
461 * NOTE: The lwp/proc code initializes a kqueue for select/poll ops.
466 kqueue_init(struct kqueue *kq, struct filedesc *fdp)
468 TAILQ_INIT(&kq->kq_knpend);
469 TAILQ_INIT(&kq->kq_knlist);
472 SLIST_INIT(&kq->kq_kqinfo.ki_note);
476 * Terminate a kqueue. Freeing the actual kq itself is left up to the
477 * caller (it might be embedded in a lwp so we don't do it here).
479 * The kq's knlist must be completely eradicated so block on any
483 kqueue_terminate(struct kqueue *kq)
487 lwkt_gettoken(&kq_token);
488 while ((kn = TAILQ_FIRST(&kq->kq_knlist)) != NULL) {
489 if (knote_acquire(kn))
490 knote_detach_and_drop(kn);
493 kfree(kq->kq_knhash, M_KQUEUE);
494 kq->kq_knhash = NULL;
495 kq->kq_knhashmask = 0;
497 lwkt_reltoken(&kq_token);
504 sys_kqueue(struct kqueue_args *uap)
506 struct thread *td = curthread;
511 error = falloc(td->td_lwp, &fp, &fd);
514 fp->f_flag = FREAD | FWRITE;
515 fp->f_type = DTYPE_KQUEUE;
516 fp->f_ops = &kqueueops;
518 kq = kmalloc(sizeof(struct kqueue), M_KQUEUE, M_WAITOK | M_ZERO);
519 kqueue_init(kq, td->td_proc->p_fd);
522 fsetfd(kq->kq_fdp, fp, fd);
523 uap->sysmsg_result = fd;
529 * Copy 'count' items into the destination list pointed to by uap->eventlist.
532 kevent_copyout(void *arg, struct kevent *kevp, int count, int *res)
534 struct kevent_copyin_args *kap;
537 kap = (struct kevent_copyin_args *)arg;
539 error = copyout(kevp, kap->ka->eventlist, count * sizeof(*kevp));
541 kap->ka->eventlist += count;
551 * Copy at most 'max' items from the list pointed to by kap->changelist,
552 * return number of items in 'events'.
555 kevent_copyin(void *arg, struct kevent *kevp, int max, int *events)
557 struct kevent_copyin_args *kap;
560 kap = (struct kevent_copyin_args *)arg;
562 count = min(kap->ka->nchanges - kap->pchanges, max);
563 error = copyin(kap->ka->changelist, kevp, count * sizeof *kevp);
565 kap->ka->changelist += count;
566 kap->pchanges += count;
577 kern_kevent(struct kqueue *kq, int nevents, int *res, void *uap,
578 k_copyin_fn kevent_copyinfn, k_copyout_fn kevent_copyoutfn,
579 struct timespec *tsp_in)
582 struct timespec *tsp;
583 int i, n, total, error, nerrors = 0;
585 int limit = kq_checkloop;
586 struct kevent kev[KQ_NEVENTS];
592 lwkt_gettoken(&kq_token);
595 error = kevent_copyinfn(uap, kev, KQ_NEVENTS, &n);
600 for (i = 0; i < n; i++) {
602 kevp->flags &= ~EV_SYSFLAGS;
603 error = kqueue_register(kq, kevp);
606 * If a registration returns an error we
607 * immediately post the error. The kevent()
608 * call itself will fail with the error if
609 * no space is available for posting.
611 * Such errors normally bypass the timeout/blocking
612 * code. However, if the copyoutfn function refuses
613 * to post the error (see sys_poll()), then we
617 kevp->flags = EV_ERROR;
620 kevent_copyoutfn(uap, kevp, 1, res);
634 * Acquire/wait for events - setup timeout
639 if (tsp->tv_sec || tsp->tv_nsec) {
641 timespecadd(tsp, &ats); /* tsp = target time */
648 * Collect as many events as we can. Sleeping on successive
649 * loops is disabled if copyoutfn has incremented (*res).
651 * The loop stops if an error occurs, all events have been
652 * scanned (the marker has been reached), or fewer than the
653 * maximum number of events is found.
655 * The copyoutfn function does not have to increment (*res) in
656 * order for the loop to continue.
658 * NOTE: doselect() usually passes 0x7FFFFFFF for nevents.
662 marker.kn_filter = EVFILT_MARKER;
663 marker.kn_status = KN_PROCESSING;
664 TAILQ_INSERT_TAIL(&kq->kq_knpend, &marker, kn_tqe);
665 while ((n = nevents - total) > 0) {
670 * If no events are pending sleep until timeout (if any)
671 * or an event occurs.
673 * After the sleep completes the marker is moved to the
674 * end of the list, making any received events available
677 if (kq->kq_count == 0 && *res == 0) {
678 error = kqueue_sleep(kq, tsp);
682 TAILQ_REMOVE(&kq->kq_knpend, &marker, kn_tqe);
683 TAILQ_INSERT_TAIL(&kq->kq_knpend, &marker, kn_tqe);
687 * Process all received events
688 * Account for all non-spurious events in our total
690 i = kqueue_scan(kq, kev, n, &marker);
693 error = kevent_copyoutfn(uap, kev, i, res);
694 total += *res - lres;
698 if (limit && --limit == 0)
699 panic("kqueue: checkloop failed i=%d", i);
702 * Normally when fewer events are returned than requested
703 * we can stop. However, if only spurious events were
704 * collected the copyout will not bump (*res) and we have
711 * Deal with an edge case where spurious events can cause
712 * a loop to occur without moving the marker. This can
713 * prevent kqueue_scan() from picking up new events which
714 * race us. We must be sure to move the marker for this
717 * NOTE: We do not want to move the marker if events
718 * were scanned because normal kqueue operations
719 * may reactivate events. Moving the marker in
720 * that case could result in duplicates for the
724 TAILQ_REMOVE(&kq->kq_knpend, &marker, kn_tqe);
725 TAILQ_INSERT_TAIL(&kq->kq_knpend, &marker, kn_tqe);
728 TAILQ_REMOVE(&kq->kq_knpend, &marker, kn_tqe);
730 /* Timeouts do not return EWOULDBLOCK. */
731 if (error == EWOULDBLOCK)
735 lwkt_reltoken(&kq_token);
743 sys_kevent(struct kevent_args *uap)
745 struct thread *td = curthread;
746 struct proc *p = td->td_proc;
747 struct timespec ts, *tsp;
749 struct file *fp = NULL;
750 struct kevent_copyin_args *kap, ka;
754 error = copyin(uap->timeout, &ts, sizeof(ts));
762 fp = holdfp(p->p_fd, uap->fd, -1);
765 if (fp->f_type != DTYPE_KQUEUE) {
770 kq = (struct kqueue *)fp->f_data;
776 error = kern_kevent(kq, uap->nevents, &uap->sysmsg_result, kap,
777 kevent_copyin, kevent_copyout, tsp);
785 kqueue_register(struct kqueue *kq, struct kevent *kev)
787 struct filedesc *fdp = kq->kq_fdp;
788 struct filterops *fops;
789 struct file *fp = NULL;
790 struct knote *kn = NULL;
793 if (kev->filter < 0) {
794 if (kev->filter + EVFILT_SYSCOUNT < 0)
796 fops = sysfilt_ops[~kev->filter]; /* to 0-base index */
800 * filter attach routine is responsible for insuring that
801 * the identifier can be attached to it.
803 kprintf("unknown filter: %d\n", kev->filter);
807 lwkt_gettoken(&kq_token);
808 if (fops->f_flags & FILTEROP_ISFD) {
809 /* validate descriptor */
810 fp = holdfp(fdp, kev->ident, -1);
812 lwkt_reltoken(&kq_token);
817 SLIST_FOREACH(kn, &fp->f_klist, kn_link) {
818 if (kn->kn_kq == kq &&
819 kn->kn_filter == kev->filter &&
820 kn->kn_id == kev->ident) {
821 if (knote_acquire(kn) == 0)
827 if (kq->kq_knhashmask) {
830 list = &kq->kq_knhash[
831 KN_HASH((u_long)kev->ident, kq->kq_knhashmask)];
833 SLIST_FOREACH(kn, list, kn_link) {
834 if (kn->kn_id == kev->ident &&
835 kn->kn_filter == kev->filter) {
836 if (knote_acquire(kn) == 0)
845 * NOTE: At this point if kn is non-NULL we will have acquired
846 * it and set KN_PROCESSING.
848 if (kn == NULL && ((kev->flags & EV_ADD) == 0)) {
854 * kn now contains the matching knote, or NULL if no match
856 if (kev->flags & EV_ADD) {
868 * apply reference count to knote structure, and
869 * do not release it at the end of this routine.
873 kn->kn_sfflags = kev->fflags;
874 kn->kn_sdata = kev->data;
877 kn->kn_kevent = *kev;
880 * KN_PROCESSING prevents the knote from getting
881 * ripped out from under us while we are trying
882 * to attach it, in case the attach blocks.
884 kn->kn_status = KN_PROCESSING;
886 if ((error = filter_attach(kn)) != 0) {
887 kn->kn_status |= KN_DELETING | KN_REPROCESS;
893 * Interlock against close races which either tried
894 * to remove our knote while we were blocked or missed
895 * it entirely prior to our attachment. We do not
896 * want to end up with a knote on a closed descriptor.
898 if ((fops->f_flags & FILTEROP_ISFD) &&
899 checkfdclosed(fdp, kev->ident, kn->kn_fp)) {
900 kn->kn_status |= KN_DELETING | KN_REPROCESS;
904 * The user may change some filter values after the
905 * initial EV_ADD, but doing so will not reset any
906 * filter which have already been triggered.
908 KKASSERT(kn->kn_status & KN_PROCESSING);
909 kn->kn_sfflags = kev->fflags;
910 kn->kn_sdata = kev->data;
911 kn->kn_kevent.udata = kev->udata;
915 * Execute the filter event to immediately activate the
916 * knote if necessary. If reprocessing events are pending
917 * due to blocking above we do not run the filter here
918 * but instead let knote_release() do it. Otherwise we
919 * might run the filter on a deleted event.
921 if ((kn->kn_status & KN_REPROCESS) == 0) {
922 if (filter_event(kn, 0))
925 } else if (kev->flags & EV_DELETE) {
927 * Delete the existing knote
929 knote_detach_and_drop(kn);
934 * Disablement does not deactivate a knote here.
936 if ((kev->flags & EV_DISABLE) &&
937 ((kn->kn_status & KN_DISABLED) == 0)) {
938 kn->kn_status |= KN_DISABLED;
942 * Re-enablement may have to immediately enqueue an active knote.
944 if ((kev->flags & EV_ENABLE) && (kn->kn_status & KN_DISABLED)) {
945 kn->kn_status &= ~KN_DISABLED;
946 if ((kn->kn_status & KN_ACTIVE) &&
947 ((kn->kn_status & KN_QUEUED) == 0)) {
953 * Handle any required reprocessing
956 /* kn may be invalid now */
959 lwkt_reltoken(&kq_token);
966 * Block as necessary until the target time is reached.
967 * If tsp is NULL we block indefinitely. If tsp->ts_secs/nsecs are both
968 * 0 we do not block at all.
971 kqueue_sleep(struct kqueue *kq, struct timespec *tsp)
976 kq->kq_state |= KQ_SLEEP;
977 error = tsleep(kq, PCATCH, "kqread", 0);
978 } else if (tsp->tv_sec == 0 && tsp->tv_nsec == 0) {
982 struct timespec atx = *tsp;
986 timespecsub(&atx, &ats);
987 if (ats.tv_sec < 0) {
990 timeout = atx.tv_sec > 24 * 60 * 60 ?
991 24 * 60 * 60 * hz : tstohz_high(&atx);
992 kq->kq_state |= KQ_SLEEP;
993 error = tsleep(kq, PCATCH, "kqread", timeout);
997 /* don't restart after signals... */
998 if (error == ERESTART)
1005 * Scan the kqueue, return the number of active events placed in kevp up
1008 * Continuous mode events may get recycled, do not continue scanning past
1009 * marker unless no events have been collected.
1012 kqueue_scan(struct kqueue *kq, struct kevent *kevp, int count,
1013 struct knote *marker)
1015 struct knote *kn, local_marker;
1019 local_marker.kn_filter = EVFILT_MARKER;
1020 local_marker.kn_status = KN_PROCESSING;
1025 TAILQ_INSERT_HEAD(&kq->kq_knpend, &local_marker, kn_tqe);
1027 kn = TAILQ_NEXT(&local_marker, kn_tqe);
1028 if (kn->kn_filter == EVFILT_MARKER) {
1029 /* Marker reached, we are done */
1033 /* Move local marker past some other threads marker */
1034 kn = TAILQ_NEXT(kn, kn_tqe);
1035 TAILQ_REMOVE(&kq->kq_knpend, &local_marker, kn_tqe);
1036 TAILQ_INSERT_BEFORE(kn, &local_marker, kn_tqe);
1041 * We can't skip a knote undergoing processing, otherwise
1042 * we risk not returning it when the user process expects
1043 * it should be returned. Sleep and retry.
1045 if (knote_acquire(kn) == 0)
1049 * Remove the event for processing.
1051 * WARNING! We must leave KN_QUEUED set to prevent the
1052 * event from being KNOTE_ACTIVATE()d while
1053 * the queue state is in limbo, in case we
1056 * WARNING! We must set KN_PROCESSING to avoid races
1057 * against deletion or another thread's
1060 TAILQ_REMOVE(&kq->kq_knpend, kn, kn_tqe);
1064 * We have to deal with an extremely important race against
1065 * file descriptor close()s here. The file descriptor can
1066 * disappear MPSAFE, and there is a small window of
1067 * opportunity between that and the call to knote_fdclose().
1069 * If we hit that window here while doselect or dopoll is
1070 * trying to delete a spurious event they will not be able
1071 * to match up the event against a knote and will go haywire.
1073 if ((kn->kn_fop->f_flags & FILTEROP_ISFD) &&
1074 checkfdclosed(kq->kq_fdp, kn->kn_kevent.ident, kn->kn_fp)) {
1075 kn->kn_status |= KN_DELETING | KN_REPROCESS;
1078 if (kn->kn_status & KN_DISABLED) {
1080 * If disabled we ensure the event is not queued
1081 * but leave its active bit set. On re-enablement
1082 * the event may be immediately triggered.
1084 kn->kn_status &= ~KN_QUEUED;
1085 } else if ((kn->kn_flags & EV_ONESHOT) == 0 &&
1086 (kn->kn_status & KN_DELETING) == 0 &&
1087 filter_event(kn, 0) == 0) {
1089 * If not running in one-shot mode and the event
1090 * is no longer present we ensure it is removed
1091 * from the queue and ignore it.
1093 kn->kn_status &= ~(KN_QUEUED | KN_ACTIVE);
1098 *kevp++ = kn->kn_kevent;
1102 if (kn->kn_flags & EV_ONESHOT) {
1103 kn->kn_status &= ~KN_QUEUED;
1104 kn->kn_status |= KN_DELETING | KN_REPROCESS;
1105 } else if (kn->kn_flags & EV_CLEAR) {
1108 kn->kn_status &= ~(KN_QUEUED | KN_ACTIVE);
1110 TAILQ_INSERT_TAIL(&kq->kq_knpend, kn, kn_tqe);
1116 * Handle any post-processing states
1120 TAILQ_REMOVE(&kq->kq_knpend, &local_marker, kn_tqe);
1127 * This could be expanded to call kqueue_scan, if desired.
1132 kqueue_read(struct file *fp, struct uio *uio, struct ucred *cred, int flags)
1141 kqueue_write(struct file *fp, struct uio *uio, struct ucred *cred, int flags)
1150 kqueue_ioctl(struct file *fp, u_long com, caddr_t data,
1151 struct ucred *cred, struct sysmsg *msg)
1156 lwkt_gettoken(&kq_token);
1157 kq = (struct kqueue *)fp->f_data;
1162 kq->kq_state |= KQ_ASYNC;
1164 kq->kq_state &= ~KQ_ASYNC;
1168 error = fsetown(*(int *)data, &kq->kq_sigio);
1174 lwkt_reltoken(&kq_token);
1182 kqueue_stat(struct file *fp, struct stat *st, struct ucred *cred)
1184 struct kqueue *kq = (struct kqueue *)fp->f_data;
1186 bzero((void *)st, sizeof(*st));
1187 st->st_size = kq->kq_count;
1188 st->st_blksize = sizeof(struct kevent);
1189 st->st_mode = S_IFIFO;
1197 kqueue_close(struct file *fp)
1199 struct kqueue *kq = (struct kqueue *)fp->f_data;
1201 kqueue_terminate(kq);
1204 funsetown(&kq->kq_sigio);
1206 kfree(kq, M_KQUEUE);
1211 kqueue_wakeup(struct kqueue *kq)
1213 if (kq->kq_state & KQ_SLEEP) {
1214 kq->kq_state &= ~KQ_SLEEP;
1217 KNOTE(&kq->kq_kqinfo.ki_note, 0);
1221 * Calls filterops f_attach function, acquiring mplock if filter is not
1222 * marked as FILTEROP_MPSAFE.
1225 filter_attach(struct knote *kn)
1229 if (!(kn->kn_fop->f_flags & FILTEROP_MPSAFE)) {
1231 ret = kn->kn_fop->f_attach(kn);
1234 ret = kn->kn_fop->f_attach(kn);
1241 * Detach the knote and drop it, destroying the knote.
1243 * Calls filterops f_detach function, acquiring mplock if filter is not
1244 * marked as FILTEROP_MPSAFE.
1247 knote_detach_and_drop(struct knote *kn)
1249 kn->kn_status |= KN_DELETING | KN_REPROCESS;
1250 if (kn->kn_fop->f_flags & FILTEROP_MPSAFE) {
1251 kn->kn_fop->f_detach(kn);
1254 kn->kn_fop->f_detach(kn);
1261 * Calls filterops f_event function, acquiring mplock if filter is not
1262 * marked as FILTEROP_MPSAFE.
1264 * If the knote is in the middle of being created or deleted we cannot
1265 * safely call the filter op.
1268 filter_event(struct knote *kn, long hint)
1272 if (kn->kn_fop->f_flags & FILTEROP_MPSAFE) {
1273 ret = kn->kn_fop->f_event(kn, hint);
1276 ret = kn->kn_fop->f_event(kn, hint);
1283 * Walk down a list of knotes, activating them if their event has triggered.
1285 * If we encounter any knotes which are undergoing processing we just mark
1286 * them for reprocessing and do not try to [re]activate the knote. However,
1287 * if a hint is being passed we have to wait and that makes things a bit
1291 knote(struct klist *list, long hint)
1295 lwkt_gettoken(&kq_token);
1297 SLIST_FOREACH(kn, list, kn_next) {
1298 if (kn->kn_status & KN_PROCESSING) {
1300 * Someone else is processing the knote, ask the
1301 * other thread to reprocess it and don't mess
1302 * with it otherwise.
1305 kn->kn_status |= KN_REPROCESS;
1310 * If the hint is non-zero we have to wait or risk
1311 * losing the state the caller is trying to update.
1313 * XXX This is a real problem, certain process
1314 * and signal filters will bump kn_data for
1315 * already-processed notes more than once if
1316 * we restart the list scan. FIXME.
1318 kn->kn_status |= KN_WAITING | KN_REPROCESS;
1319 tsleep(kn, 0, "knotec", hz);
1324 * Become the reprocessing master ourselves.
1326 * If hint is non-zer running the event is mandatory
1327 * when not deleting so do it whether reprocessing is
1330 kn->kn_status |= KN_PROCESSING;
1331 if ((kn->kn_status & KN_DELETING) == 0) {
1332 if (filter_event(kn, hint))
1335 if (knote_release(kn))
1338 lwkt_reltoken(&kq_token);
1342 * Insert knote at head of klist.
1344 * This function may only be called via a filter function and thus
1345 * kq_token should already be held and marked for processing.
1348 knote_insert(struct klist *klist, struct knote *kn)
1350 KKASSERT(kn->kn_status & KN_PROCESSING);
1351 ASSERT_LWKT_TOKEN_HELD(&kq_token);
1352 SLIST_INSERT_HEAD(klist, kn, kn_next);
1356 * Remove knote from a klist
1358 * This function may only be called via a filter function and thus
1359 * kq_token should already be held and marked for processing.
1362 knote_remove(struct klist *klist, struct knote *kn)
1364 KKASSERT(kn->kn_status & KN_PROCESSING);
1365 ASSERT_LWKT_TOKEN_HELD(&kq_token);
1366 SLIST_REMOVE(klist, kn, knote, kn_next);
1370 * Remove all knotes from a specified klist
1372 * Only called from aio.
1375 knote_empty(struct klist *list)
1379 lwkt_gettoken(&kq_token);
1380 while ((kn = SLIST_FIRST(list)) != NULL) {
1381 if (knote_acquire(kn))
1382 knote_detach_and_drop(kn);
1384 lwkt_reltoken(&kq_token);
1388 knote_assume_knotes(struct kqinfo *src, struct kqinfo *dst,
1389 struct filterops *ops, void *hook)
1393 lwkt_gettoken(&kq_token);
1394 while ((kn = SLIST_FIRST(&src->ki_note)) != NULL) {
1395 if (knote_acquire(kn)) {
1396 knote_remove(&src->ki_note, kn);
1399 knote_insert(&dst->ki_note, kn);
1401 /* kn may be invalid now */
1404 lwkt_reltoken(&kq_token);
1408 * Remove all knotes referencing a specified fd
1411 knote_fdclose(struct file *fp, struct filedesc *fdp, int fd)
1415 lwkt_gettoken(&kq_token);
1417 SLIST_FOREACH(kn, &fp->f_klist, kn_link) {
1418 if (kn->kn_kq->kq_fdp == fdp && kn->kn_id == fd) {
1419 if (knote_acquire(kn))
1420 knote_detach_and_drop(kn);
1424 lwkt_reltoken(&kq_token);
1428 * Low level attach function.
1430 * The knote should already be marked for processing.
1433 knote_attach(struct knote *kn)
1436 struct kqueue *kq = kn->kn_kq;
1438 if (kn->kn_fop->f_flags & FILTEROP_ISFD) {
1439 KKASSERT(kn->kn_fp);
1440 list = &kn->kn_fp->f_klist;
1442 if (kq->kq_knhashmask == 0)
1443 kq->kq_knhash = hashinit(KN_HASHSIZE, M_KQUEUE,
1444 &kq->kq_knhashmask);
1445 list = &kq->kq_knhash[KN_HASH(kn->kn_id, kq->kq_knhashmask)];
1447 SLIST_INSERT_HEAD(list, kn, kn_link);
1448 TAILQ_INSERT_HEAD(&kq->kq_knlist, kn, kn_kqlink);
1452 * Low level drop function.
1454 * The knote should already be marked for processing.
1457 knote_drop(struct knote *kn)
1464 if (kn->kn_fop->f_flags & FILTEROP_ISFD)
1465 list = &kn->kn_fp->f_klist;
1467 list = &kq->kq_knhash[KN_HASH(kn->kn_id, kq->kq_knhashmask)];
1469 SLIST_REMOVE(list, kn, knote, kn_link);
1470 TAILQ_REMOVE(&kq->kq_knlist, kn, kn_kqlink);
1471 if (kn->kn_status & KN_QUEUED)
1473 if (kn->kn_fop->f_flags & FILTEROP_ISFD) {
1481 * Low level enqueue function.
1483 * The knote should already be marked for processing.
1486 knote_enqueue(struct knote *kn)
1488 struct kqueue *kq = kn->kn_kq;
1490 KASSERT((kn->kn_status & KN_QUEUED) == 0, ("knote already queued"));
1491 TAILQ_INSERT_TAIL(&kq->kq_knpend, kn, kn_tqe);
1492 kn->kn_status |= KN_QUEUED;
1496 * Send SIGIO on request (typically set up as a mailbox signal)
1498 if (kq->kq_sigio && (kq->kq_state & KQ_ASYNC) && kq->kq_count == 1)
1499 pgsigio(kq->kq_sigio, SIGIO, 0);
1505 * Low level dequeue function.
1507 * The knote should already be marked for processing.
1510 knote_dequeue(struct knote *kn)
1512 struct kqueue *kq = kn->kn_kq;
1514 KASSERT(kn->kn_status & KN_QUEUED, ("knote not queued"));
1515 TAILQ_REMOVE(&kq->kq_knpend, kn, kn_tqe);
1516 kn->kn_status &= ~KN_QUEUED;
1520 static struct knote *
1523 return kmalloc(sizeof(struct knote), M_KQUEUE, M_NOWAIT);
1527 knote_free(struct knote *kn)
1529 kfree(kn, M_KQUEUE);