kqueue
PROTO_NORMAL(kqueue);
if ((kq = kqueue()) == -1) {
struct kqueue kqi;
ATF_REQUIRE((kq = kqueue()) != -1);
ATF_REQUIRE((kq = kqueue()) != -1);
ATF_REQUIRE((kq = kqueue()) != -1);
ATF_REQUIRE((kq = kqueue()) != -1);
CHECKe(kq = kqueue());
kq1 = kqueue();
kq2 = kqueue();
kq = kqueue();
kq = kqueue();
fd = kqueue();
kq = kqueue();
ASS((kq = kqueue()) >= 0,
ASS((kq = kqueue()) >= 0,
ASS((kq = kqueue()) >= 0,
kq = kqueue();
if ((kq = kqueue()) == -1)
ASS((kq = kqueue()) >= 0,
kq = kqueue();
kq = kqueue();
kq = kqueue();
kq = kqueue();
kq = kqueue();
ASS((kq = kqueue()) >= 0,
ASS((kq = kqueue()) >= 0, warn("kqueue"));
ASS((kq = kqueue()) >= 0,
ASS((kq = kqueue()) >= 0,
ASS((kq = kqueue()) >= 0,
ASS((kq = kqueue()) >= 0,
ctx->c_kq = kqueue();
if ((kqfd = kqueue()) < 0)
if ((kq = kqueue()) == -1)
struct kqueue *kq = p->p_kq;
struct kqueue *
struct kqueue *kq;
void knote_remove(struct proc *p, struct kqueue *kq, struct knlist **plist,
struct kqueue *kq;
struct kqueue *kq;
int filt_kqueue_common(struct knote *kn, struct kqueue *kq);
kqueue_do_check(struct kqueue *kq, const char *func, int line)
kqueue_register(struct kqueue *kq, struct kevent *kev, unsigned int pollid,
kqueue_sleep(struct kqueue *kq, struct timespec *tsp)
struct kqueue *kq = scan->kqs_kq;
kqueue_scan_setup(struct kqueue_scan_state *scan, struct kqueue *kq)
struct kqueue *kq = scan->kqs_kq;
struct kqueue *kq = fp->f_data;
kqueue_purge(struct proc *p, struct kqueue *kq)
kqueue_terminate(struct proc *p, struct kqueue *kq)
struct kqueue *kq = fp->f_data;
struct kqueue *kq = arg;
kqueue_wakeup(struct kqueue *kq)
kqueue_expand_hash(struct kqueue *kq)
kqueue_expand_list(struct kqueue *kq, int fd)
struct kqueue *kq = kn->kn_kq;
struct kqueue *kq;
knote_remove(struct proc *p, struct kqueue *kq, struct knlist **plist, int idx,
struct kqueue *kq;
struct kqueue *kq = kn->kn_kq;
struct kqueue *kq = kn->kn_kq;
struct kqueue *kq = kn->kn_kq;
KQREF(struct kqueue *kq)
struct kqueue *kq = kn->kn_kq;
struct kqueue *kq = kn->kn_kq;
KQRELE(struct kqueue *kq)
struct kqueue *kq;
pool_init(&kqueue_pool, sizeof(struct kqueue), 0, IPL_MPFLOOR,
struct kqueue *kq = kn->kn_fp->f_data;
struct kqueue *kq = kn->kn_fp->f_data;
filt_kqueue_common(struct knote *kn, struct kqueue *kq)
struct kqueue *kq = kn->kn_fp->f_data;
struct kqueue *kq = kn->kn_fp->f_data;
struct kqueue *kq = kn->kn_fp->f_data;
struct kqueue *kq = kn->kn_kq;
struct kqueue *kqueue_alloc(struct filedesc *);
void kqueue_terminate(struct proc *p, struct kqueue *);
struct kqueue *kq = kn->kn_kq;
void KQREF(struct kqueue *);
void KQRELE(struct kqueue *);
void kqueue_purge(struct proc *, struct kqueue *);
int kqueue_sleep(struct kqueue *, struct timespec *);
struct kqueue *kq = kn->kn_kq;
void kqueue_wakeup(struct kqueue *kq);
void kqueue_do_check(struct kqueue *kq, const char *func, int line);
static void kqueue_expand_hash(struct kqueue *kq);
static void kqueue_expand_list(struct kqueue *kq, int fd);
struct kqueue *kqi = (struct kqueue *)fp->f_data;
struct kqueue *kn_kq; /* [I] which queue we are on */
struct kqueue *kqs_kq; /* kqueue of this scan */
extern int kqueue_register(struct kqueue *kq, struct kevent *kev,
extern void kqueue_scan_setup(struct kqueue_scan_state *, struct kqueue *);
int kqueue(void);
LIST_ENTRY(kqueue) kq_next;
struct kqueue;
LIST_HEAD(, kqueue) fd_kqlist; /* [f] kqueues attached to this
struct kqueue;
struct kqueue *p_kq; /* [o] select/poll queue of evts */
if (fflag && (kq = kqueue()) == -1)
kq = kqueue();