kqueue
retval->write_queue = kqueue();
retval->read_queue = kqueue();
if ((kq = kqueue()) < 0) {
if ((cu->cu_kq = kqueue()) < 0) {
if ((kq_fd = kqueue()) < 0)
struct kqueue *kq;
kq = (struct kqueue *)fp->f_data;
kqueue_register(struct kqueue *kq, struct kevent *kev, int *countp, int flags)
kqueue_scan(struct kqueue *kq, struct kevent *kevp, int count,
struct kqueue *kq;
kq = (struct kqueue *)fp->f_data;
struct kqueue *kq = (struct kqueue *)fp->f_data;
struct kqueue *kq = (struct kqueue *)fp->f_data;
kqueue_wakeup(struct kqueue *kq)
struct kqueue *kq;
struct kqueue *kq;
struct kqueue *kq;
struct kqueue *kq = kn->kn_kq;
struct kqueue *kq;
struct kqueue *kq = kn->kn_kq;
struct kqueue *kq = kn->kn_kq;
struct kqueue *kq = (struct kqueue *)kn->kn_fp->f_data;
struct kqueue *kq = (struct kqueue *)kn->kn_fp->f_data;
struct kqueue *kq = (struct kqueue *)kn->kn_fp->f_data;
struct kqueue *kq = kn->kn_kq;
kqueue_init(struct kqueue *kq, struct filedesc *fdp)
kqueue_terminate(struct kqueue *kq)
struct kqueue *kq;
kq = kmalloc(sizeof(struct kqueue), M_KQUEUE, M_WAITOK | M_ZERO);
static int kqueue_scan(struct kqueue *kq, struct kevent *kevp, int count,
kern_kevent(struct kqueue *kq, int nevents, int *res, void *uap,
static void kqueue_wakeup(struct kqueue *kq);
struct kqueue kq;
KQueueFd = kqueue();
struct kqueue *kn_kq; /* which queue we are on */
int kern_kevent(struct kqueue *kq, int nevents, int *res, void *uap,
void kqueue_init(struct kqueue *, struct filedesc *);
void kqueue_terminate(struct kqueue *);
int kqueue_register(struct kqueue *, struct kevent *, int *, int);
int kqueue (void);
struct kqueue lwp_kqueue; /* for select/poll */
struct kqueue_args kqueue;
fd = kqueue();
kq = kqueue();
if ((kq = kqueue()) == -1)
kq = kqueue();
kq = kqueue();
kq = kqueue();
kq = kqueue();
if ((KQueueFd = kqueue()) < 0) {
kq = kqueue();
kq = kqueue();
kq = kqueue();
if ((hci_kq = kqueue()) == -1) {
dc->kq = kqueue();
if ((kq = kqueue()) == -1) {
retval->queue = kqueue();
retval->write_queue = kqueue();
retval->read_queue = kqueue();