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.9 2003/05/08 07:47:16 kbyanc Exp $
27 * $DragonFly: src/sys/kern/kern_event.c,v 1.3 2003/06/23 17:55:41 dillon 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>
37 #include <sys/fcntl.h>
38 #include <sys/select.h>
39 #include <sys/queue.h>
40 #include <sys/event.h>
41 #include <sys/eventvar.h>
43 #include <sys/protosw.h>
44 #include <sys/socket.h>
45 #include <sys/socketvar.h>
47 #include <sys/sysctl.h>
48 #include <sys/sysproto.h>
51 #include <vm/vm_zone.h>
53 MALLOC_DEFINE(M_KQUEUE, "kqueue", "memory for kqueue system");
55 static int kqueue_scan(struct file *fp, int maxevents,
56 struct kevent *ulistp, const struct timespec *timeout,
58 static int kqueue_read(struct file *fp, struct uio *uio,
59 struct ucred *cred, int flags, struct proc *p);
60 static int kqueue_write(struct file *fp, struct uio *uio,
61 struct ucred *cred, int flags, struct proc *p);
62 static int kqueue_ioctl(struct file *fp, u_long com, caddr_t data,
64 static int kqueue_poll(struct file *fp, int events, struct ucred *cred,
66 static int kqueue_kqfilter(struct file *fp, struct knote *kn);
67 static int kqueue_stat(struct file *fp, struct stat *st, struct proc *p);
68 static int kqueue_close(struct file *fp, struct proc *p);
69 static void kqueue_wakeup(struct kqueue *kq);
71 static struct fileops kqueueops = {
81 static void knote_attach(struct knote *kn, struct filedesc *fdp);
82 static void knote_drop(struct knote *kn, struct proc *p);
83 static void knote_enqueue(struct knote *kn);
84 static void knote_dequeue(struct knote *kn);
85 static void knote_init(void);
86 static struct knote *knote_alloc(void);
87 static void knote_free(struct knote *kn);
89 static void filt_kqdetach(struct knote *kn);
90 static int filt_kqueue(struct knote *kn, long hint);
91 static int filt_procattach(struct knote *kn);
92 static void filt_procdetach(struct knote *kn);
93 static int filt_proc(struct knote *kn, long hint);
94 static int filt_fileattach(struct knote *kn);
95 static void filt_timerexpire(void *knx);
96 static int filt_timerattach(struct knote *kn);
97 static void filt_timerdetach(struct knote *kn);
98 static int filt_timer(struct knote *kn, long hint);
100 static struct filterops file_filtops =
101 { 1, filt_fileattach, NULL, NULL };
102 static struct filterops kqread_filtops =
103 { 1, NULL, filt_kqdetach, filt_kqueue };
104 static struct filterops proc_filtops =
105 { 0, filt_procattach, filt_procdetach, filt_proc };
106 static struct filterops timer_filtops =
107 { 0, filt_timerattach, filt_timerdetach, filt_timer };
109 static vm_zone_t knote_zone;
110 static int kq_ncallouts = 0;
111 static int kq_calloutmax = (4 * 1024);
112 SYSCTL_INT(_kern, OID_AUTO, kq_calloutmax, CTLFLAG_RW,
113 &kq_calloutmax, 0, "Maximum number of callouts allocated for kqueue");
115 #define KNOTE_ACTIVATE(kn) do { \
116 kn->kn_status |= KN_ACTIVE; \
117 if ((kn->kn_status & (KN_QUEUED | KN_DISABLED)) == 0) \
121 #define KN_HASHSIZE 64 /* XXX should be tunable */
122 #define KN_HASH(val, mask) (((val) ^ (val >> 8)) & (mask))
124 extern struct filterops aio_filtops;
125 extern struct filterops sig_filtops;
128 * Table for for all system-defined filters.
130 static struct filterops *sysfilt_ops[] = {
131 &file_filtops, /* EVFILT_READ */
132 &file_filtops, /* EVFILT_WRITE */
133 &aio_filtops, /* EVFILT_AIO */
134 &file_filtops, /* EVFILT_VNODE */
135 &proc_filtops, /* EVFILT_PROC */
136 &sig_filtops, /* EVFILT_SIGNAL */
137 &timer_filtops, /* EVFILT_TIMER */
141 filt_fileattach(struct knote *kn)
144 return (fo_kqfilter(kn->kn_fp, kn));
149 kqueue_kqfilter(struct file *fp, struct knote *kn)
151 struct kqueue *kq = (struct kqueue *)kn->kn_fp->f_data;
153 if (kn->kn_filter != EVFILT_READ)
156 kn->kn_fop = &kqread_filtops;
157 SLIST_INSERT_HEAD(&kq->kq_sel.si_note, kn, kn_selnext);
162 filt_kqdetach(struct knote *kn)
164 struct kqueue *kq = (struct kqueue *)kn->kn_fp->f_data;
166 SLIST_REMOVE(&kq->kq_sel.si_note, kn, knote, kn_selnext);
171 filt_kqueue(struct knote *kn, long hint)
173 struct kqueue *kq = (struct kqueue *)kn->kn_fp->f_data;
175 kn->kn_data = kq->kq_count;
176 return (kn->kn_data > 0);
180 filt_procattach(struct knote *kn)
186 p = pfind(kn->kn_id);
187 if (p == NULL && (kn->kn_sfflags & NOTE_EXIT)) {
188 p = zpfind(kn->kn_id);
193 if (! PRISON_CHECK(curproc->p_ucred, p->p_ucred))
196 kn->kn_ptr.p_proc = p;
197 kn->kn_flags |= EV_CLEAR; /* automatically set */
200 * internal flag indicating registration done by kernel
202 if (kn->kn_flags & EV_FLAG1) {
203 kn->kn_data = kn->kn_sdata; /* ppid */
204 kn->kn_fflags = NOTE_CHILD;
205 kn->kn_flags &= ~EV_FLAG1;
208 /* XXX lock the proc here while adding to the list? */
209 SLIST_INSERT_HEAD(&p->p_klist, kn, kn_selnext);
212 * Immediately activate any exit notes if the target process is a
213 * zombie. This is necessary to handle the case where the target
214 * process, e.g. a child, dies before the kevent is registered.
216 if (immediate && filt_proc(kn, NOTE_EXIT))
223 * The knote may be attached to a different process, which may exit,
224 * leaving nothing for the knote to be attached to. So when the process
225 * exits, the knote is marked as DETACHED and also flagged as ONESHOT so
226 * it will be deleted when read out. However, as part of the knote deletion,
227 * this routine is called, so a check is needed to avoid actually performing
228 * a detach, because the original process does not exist any more.
231 filt_procdetach(struct knote *kn)
233 struct proc *p = kn->kn_ptr.p_proc;
235 if (kn->kn_status & KN_DETACHED)
238 /* XXX locking? this might modify another process. */
239 SLIST_REMOVE(&p->p_klist, kn, knote, kn_selnext);
243 filt_proc(struct knote *kn, long hint)
248 * mask off extra data
250 event = (u_int)hint & NOTE_PCTRLMASK;
253 * if the user is interested in this event, record it.
255 if (kn->kn_sfflags & event)
256 kn->kn_fflags |= event;
259 * process is gone, so flag the event as finished.
261 if (event == NOTE_EXIT) {
262 kn->kn_status |= KN_DETACHED;
263 kn->kn_flags |= (EV_EOF | EV_ONESHOT);
268 * process forked, and user wants to track the new process,
269 * so attach a new knote to it, and immediately report an
270 * event with the parent's pid.
272 if ((event == NOTE_FORK) && (kn->kn_sfflags & NOTE_TRACK)) {
277 * register knote with new process.
279 kev.ident = hint & NOTE_PDATAMASK; /* pid */
280 kev.filter = kn->kn_filter;
281 kev.flags = kn->kn_flags | EV_ADD | EV_ENABLE | EV_FLAG1;
282 kev.fflags = kn->kn_sfflags;
283 kev.data = kn->kn_id; /* parent */
284 kev.udata = kn->kn_kevent.udata; /* preserve udata */
285 error = kqueue_register(kn->kn_kq, &kev, NULL);
287 kn->kn_fflags |= NOTE_TRACKERR;
290 return (kn->kn_fflags != 0);
294 filt_timerexpire(void *knx)
296 struct knote *kn = knx;
297 struct callout *calloutp;
304 if ((kn->kn_flags & EV_ONESHOT) == 0) {
305 tv.tv_sec = kn->kn_sdata / 1000;
306 tv.tv_usec = (kn->kn_sdata % 1000) * 1000;
307 tticks = tvtohz(&tv);
308 calloutp = (struct callout *)kn->kn_hook;
309 callout_reset(calloutp, tticks, filt_timerexpire, kn);
314 * data contains amount of time to sleep, in milliseconds
317 filt_timerattach(struct knote *kn)
319 struct callout *calloutp;
323 if (kq_ncallouts >= kq_calloutmax)
327 tv.tv_sec = kn->kn_sdata / 1000;
328 tv.tv_usec = (kn->kn_sdata % 1000) * 1000;
329 tticks = tvtohz(&tv);
331 kn->kn_flags |= EV_CLEAR; /* automatically set */
332 MALLOC(calloutp, struct callout *, sizeof(*calloutp),
334 callout_init(calloutp);
335 callout_reset(calloutp, tticks, filt_timerexpire, kn);
336 kn->kn_hook = (caddr_t)calloutp;
342 filt_timerdetach(struct knote *kn)
344 struct callout *calloutp;
346 calloutp = (struct callout *)kn->kn_hook;
347 callout_stop(calloutp);
348 FREE(calloutp, M_KQUEUE);
353 filt_timer(struct knote *kn, long hint)
356 return (kn->kn_data != 0);
360 kqueue(struct kqueue_args *uap)
362 struct proc *p = curproc;
363 struct filedesc *fdp = p->p_fd;
368 error = falloc(p, &fp, &fd);
371 fp->f_flag = FREAD | FWRITE;
372 fp->f_type = DTYPE_KQUEUE;
373 fp->f_ops = &kqueueops;
374 kq = malloc(sizeof(struct kqueue), M_KQUEUE, M_WAITOK | M_ZERO);
375 TAILQ_INIT(&kq->kq_head);
376 fp->f_data = (caddr_t)kq;
378 if (fdp->fd_knlistsize < 0)
379 fdp->fd_knlistsize = 0; /* this process has a kq */
384 #ifndef _SYS_SYSPROTO_H_
387 const struct kevent *changelist;
389 struct kevent *eventlist;
391 const struct timespec *timeout;
395 kevent(struct kevent_args *uap)
397 struct proc *p = curproc;
398 struct filedesc* fdp = p->p_fd;
401 struct file *fp = NULL;
403 int i, n, nerrors, error;
405 if (((u_int)uap->fd) >= fdp->fd_nfiles ||
406 (fp = fdp->fd_ofiles[uap->fd]) == NULL ||
407 (fp->f_type != DTYPE_KQUEUE))
412 if (uap->timeout != NULL) {
413 error = copyin(uap->timeout, &ts, sizeof(ts));
419 kq = (struct kqueue *)fp->f_data;
422 while (uap->nchanges > 0) {
423 n = uap->nchanges > KQ_NEVENTS ? KQ_NEVENTS : uap->nchanges;
424 error = copyin(uap->changelist, kq->kq_kev,
425 n * sizeof(struct kevent));
428 for (i = 0; i < n; i++) {
429 kevp = &kq->kq_kev[i];
430 kevp->flags &= ~EV_SYSFLAGS;
431 error = kqueue_register(kq, kevp, p);
433 if (uap->nevents != 0) {
434 kevp->flags = EV_ERROR;
436 (void) copyout((caddr_t)kevp,
437 (caddr_t)uap->eventlist,
448 uap->changelist += n;
451 p->p_retval[0] = nerrors;
456 error = kqueue_scan(fp, uap->nevents, uap->eventlist, uap->timeout, p);
464 kqueue_register(struct kqueue *kq, struct kevent *kev, struct proc *p)
466 struct filedesc *fdp = kq->kq_fdp;
467 struct filterops *fops;
468 struct file *fp = NULL;
469 struct knote *kn = NULL;
472 if (kev->filter < 0) {
473 if (kev->filter + EVFILT_SYSCOUNT < 0)
475 fops = sysfilt_ops[~kev->filter]; /* to 0-base index */
479 * filter attach routine is responsible for insuring that
480 * the identifier can be attached to it.
482 printf("unknown filter: %d\n", kev->filter);
487 /* validate descriptor */
488 if ((u_int)kev->ident >= fdp->fd_nfiles ||
489 (fp = fdp->fd_ofiles[kev->ident]) == NULL)
493 if (kev->ident < fdp->fd_knlistsize) {
494 SLIST_FOREACH(kn, &fdp->fd_knlist[kev->ident], kn_link)
495 if (kq == kn->kn_kq &&
496 kev->filter == kn->kn_filter)
500 if (fdp->fd_knhashmask != 0) {
503 list = &fdp->fd_knhash[
504 KN_HASH((u_long)kev->ident, fdp->fd_knhashmask)];
505 SLIST_FOREACH(kn, list, kn_link)
506 if (kev->ident == kn->kn_id &&
508 kev->filter == kn->kn_filter)
513 if (kn == NULL && ((kev->flags & EV_ADD) == 0)) {
519 * kn now contains the matching knote, or NULL if no match
521 if (kev->flags & EV_ADD) {
534 * apply reference count to knote structure, and
535 * do not release it at the end of this routine.
539 kn->kn_sfflags = kev->fflags;
540 kn->kn_sdata = kev->data;
543 kn->kn_kevent = *kev;
545 knote_attach(kn, fdp);
546 if ((error = fops->f_attach(kn)) != 0) {
552 * The user may change some filter values after the
553 * initial EV_ADD, but doing so will not reset any
554 * filter which have already been triggered.
556 kn->kn_sfflags = kev->fflags;
557 kn->kn_sdata = kev->data;
558 kn->kn_kevent.udata = kev->udata;
562 if (kn->kn_fop->f_event(kn, 0))
566 } else if (kev->flags & EV_DELETE) {
567 kn->kn_fop->f_detach(kn);
572 if ((kev->flags & EV_DISABLE) &&
573 ((kn->kn_status & KN_DISABLED) == 0)) {
575 kn->kn_status |= KN_DISABLED;
579 if ((kev->flags & EV_ENABLE) && (kn->kn_status & KN_DISABLED)) {
581 kn->kn_status &= ~KN_DISABLED;
582 if ((kn->kn_status & KN_ACTIVE) &&
583 ((kn->kn_status & KN_QUEUED) == 0))
595 kqueue_scan(struct file *fp, int maxevents, struct kevent *ulistp,
596 const struct timespec *tsp, struct proc *p)
598 struct kqueue *kq = (struct kqueue *)fp->f_data;
600 struct timeval atv, rtv, ttv;
601 struct knote *kn, marker;
602 int s, count, timeout, nkev = 0, error = 0;
609 TIMESPEC_TO_TIMEVAL(&atv, tsp);
610 if (itimerfix(&atv)) {
614 if (tsp->tv_sec == 0 && tsp->tv_nsec == 0)
617 timeout = atv.tv_sec > 24 * 60 * 60 ?
618 24 * 60 * 60 * hz : tvtohz(&atv);
619 getmicrouptime(&rtv);
620 timevaladd(&atv, &rtv);
629 if (atv.tv_sec || atv.tv_usec) {
630 getmicrouptime(&rtv);
631 if (timevalcmp(&rtv, &atv, >=))
634 timevalsub(&ttv, &rtv);
635 timeout = ttv.tv_sec > 24 * 60 * 60 ?
636 24 * 60 * 60 * hz : tvtohz(&ttv);
642 if (kq->kq_count == 0) {
646 kq->kq_state |= KQ_SLEEP;
647 error = tsleep(kq, PSOCK | PCATCH, "kqread", timeout);
652 /* don't restart after signals... */
653 if (error == ERESTART)
655 else if (error == EWOULDBLOCK)
660 TAILQ_INSERT_TAIL(&kq->kq_head, &marker, kn_tqe);
662 kn = TAILQ_FIRST(&kq->kq_head);
663 TAILQ_REMOVE(&kq->kq_head, kn, kn_tqe);
666 if (count == maxevents)
670 if (kn->kn_status & KN_DISABLED) {
671 kn->kn_status &= ~KN_QUEUED;
675 if ((kn->kn_flags & EV_ONESHOT) == 0 &&
676 kn->kn_fop->f_event(kn, 0) == 0) {
677 kn->kn_status &= ~(KN_QUEUED | KN_ACTIVE);
681 *kevp = kn->kn_kevent;
684 if (kn->kn_flags & EV_ONESHOT) {
685 kn->kn_status &= ~KN_QUEUED;
688 kn->kn_fop->f_detach(kn);
691 } else if (kn->kn_flags & EV_CLEAR) {
694 kn->kn_status &= ~(KN_QUEUED | KN_ACTIVE);
697 TAILQ_INSERT_TAIL(&kq->kq_head, kn, kn_tqe);
700 if (nkev == KQ_NEVENTS) {
702 error = copyout((caddr_t)&kq->kq_kev, (caddr_t)ulistp,
703 sizeof(struct kevent) * nkev);
712 TAILQ_REMOVE(&kq->kq_head, &marker, kn_tqe);
716 error = copyout((caddr_t)&kq->kq_kev, (caddr_t)ulistp,
717 sizeof(struct kevent) * nkev);
718 p->p_retval[0] = maxevents - count;
724 * This could be expanded to call kqueue_scan, if desired.
728 kqueue_read(struct file *fp, struct uio *uio, struct ucred *cred,
729 int flags, struct proc *p)
736 kqueue_write(struct file *fp, struct uio *uio, struct ucred *cred,
737 int flags, struct proc *p)
744 kqueue_ioctl(struct file *fp, u_long com, caddr_t data, struct proc *p)
751 kqueue_poll(struct file *fp, int events, struct ucred *cred, struct proc *p)
753 struct kqueue *kq = (struct kqueue *)fp->f_data;
757 if (events & (POLLIN | POLLRDNORM)) {
759 revents |= events & (POLLIN | POLLRDNORM);
761 selrecord(p->p_thread, &kq->kq_sel);
762 kq->kq_state |= KQ_SEL;
771 kqueue_stat(struct file *fp, struct stat *st, struct proc *p)
773 struct kqueue *kq = (struct kqueue *)fp->f_data;
775 bzero((void *)st, sizeof(*st));
776 st->st_size = kq->kq_count;
777 st->st_blksize = sizeof(struct kevent);
778 st->st_mode = S_IFIFO;
784 kqueue_close(struct file *fp, struct proc *p)
786 struct kqueue *kq = (struct kqueue *)fp->f_data;
787 struct filedesc *fdp = p->p_fd;
788 struct knote **knp, *kn, *kn0;
791 for (i = 0; i < fdp->fd_knlistsize; i++) {
792 knp = &SLIST_FIRST(&fdp->fd_knlist[i]);
795 kn0 = SLIST_NEXT(kn, kn_link);
796 if (kq == kn->kn_kq) {
797 kn->kn_fop->f_detach(kn);
802 knp = &SLIST_NEXT(kn, kn_link);
807 if (fdp->fd_knhashmask != 0) {
808 for (i = 0; i < fdp->fd_knhashmask + 1; i++) {
809 knp = &SLIST_FIRST(&fdp->fd_knhash[i]);
812 kn0 = SLIST_NEXT(kn, kn_link);
813 if (kq == kn->kn_kq) {
814 kn->kn_fop->f_detach(kn);
815 /* XXX non-fd release of kn->kn_ptr */
819 knp = &SLIST_NEXT(kn, kn_link);
832 kqueue_wakeup(struct kqueue *kq)
835 if (kq->kq_state & KQ_SLEEP) {
836 kq->kq_state &= ~KQ_SLEEP;
839 if (kq->kq_state & KQ_SEL) {
840 kq->kq_state &= ~KQ_SEL;
841 selwakeup(&kq->kq_sel);
843 KNOTE(&kq->kq_sel.si_note, 0);
847 * walk down a list of knotes, activating them if their event has triggered.
850 knote(struct klist *list, long hint)
854 SLIST_FOREACH(kn, list, kn_selnext)
855 if (kn->kn_fop->f_event(kn, hint))
860 * remove all knotes from a specified klist
863 knote_remove(struct proc *p, struct klist *list)
867 while ((kn = SLIST_FIRST(list)) != NULL) {
868 kn->kn_fop->f_detach(kn);
874 * remove all knotes referencing a specified fd
877 knote_fdclose(struct proc *p, int fd)
879 struct filedesc *fdp = p->p_fd;
880 struct klist *list = &fdp->fd_knlist[fd];
882 knote_remove(p, list);
886 knote_attach(struct knote *kn, struct filedesc *fdp)
891 if (! kn->kn_fop->f_isfd) {
892 if (fdp->fd_knhashmask == 0)
893 fdp->fd_knhash = hashinit(KN_HASHSIZE, M_KQUEUE,
894 &fdp->fd_knhashmask);
895 list = &fdp->fd_knhash[KN_HASH(kn->kn_id, fdp->fd_knhashmask)];
899 if (fdp->fd_knlistsize <= kn->kn_id) {
900 size = fdp->fd_knlistsize;
901 while (size <= kn->kn_id)
903 MALLOC(list, struct klist *,
904 size * sizeof(struct klist *), M_KQUEUE, M_WAITOK);
905 bcopy((caddr_t)fdp->fd_knlist, (caddr_t)list,
906 fdp->fd_knlistsize * sizeof(struct klist *));
907 bzero((caddr_t)list +
908 fdp->fd_knlistsize * sizeof(struct klist *),
909 (size - fdp->fd_knlistsize) * sizeof(struct klist *));
910 if (fdp->fd_knlist != NULL)
911 FREE(fdp->fd_knlist, M_KQUEUE);
912 fdp->fd_knlistsize = size;
913 fdp->fd_knlist = list;
915 list = &fdp->fd_knlist[kn->kn_id];
917 SLIST_INSERT_HEAD(list, kn, kn_link);
922 * should be called at spl == 0, since we don't want to hold spl
923 * while calling fdrop and free.
926 knote_drop(struct knote *kn, struct proc *p)
928 struct filedesc *fdp = p->p_fd;
931 if (kn->kn_fop->f_isfd)
932 list = &fdp->fd_knlist[kn->kn_id];
934 list = &fdp->fd_knhash[KN_HASH(kn->kn_id, fdp->fd_knhashmask)];
936 SLIST_REMOVE(list, kn, knote, kn_link);
937 if (kn->kn_status & KN_QUEUED)
939 if (kn->kn_fop->f_isfd)
946 knote_enqueue(struct knote *kn)
948 struct kqueue *kq = kn->kn_kq;
951 KASSERT((kn->kn_status & KN_QUEUED) == 0, ("knote already queued"));
953 TAILQ_INSERT_TAIL(&kq->kq_head, kn, kn_tqe);
954 kn->kn_status |= KN_QUEUED;
961 knote_dequeue(struct knote *kn)
963 struct kqueue *kq = kn->kn_kq;
966 KASSERT(kn->kn_status & KN_QUEUED, ("knote not queued"));
968 TAILQ_REMOVE(&kq->kq_head, kn, kn_tqe);
969 kn->kn_status &= ~KN_QUEUED;
977 knote_zone = zinit("KNOTE", sizeof(struct knote), 0, 0, 1);
979 SYSINIT(knote, SI_SUB_PSEUDO, SI_ORDER_ANY, knote_init, NULL)
981 static struct knote *
984 return ((struct knote *)zalloc(knote_zone));
988 knote_free(struct knote *kn)
990 zfree(knote_zone, kn);