bsd/kern/kern_event.c

154 static int 	knote_fdpattach(struct knote *kn, struct filedesc *fdp, struct proc *p);
1057 	struct filedesc *fdp = p->p_fd;
1076 	if (fdp->fd_knlistsize < 0) {
1078 		if (fdp->fd_knlistsize < 0)
1079 			fdp->fd_knlistsize = 0;		/* this process has had a kq */
1105 	struct filedesc *fdp = p->p_fd;
1110 	for (i = 0; i < fdp->fd_knlistsize; i++) {
1111 		kn = SLIST_FIRST(&fdp->fd_knlist[i]);
1123 				kn = SLIST_FIRST(&fdp->fd_knlist[i]);
1129 	if (fdp->fd_knhashmask != 0) {
1130 		for (i = 0; i < (int)fdp->fd_knhashmask + 1; i++) {
1131 			kn = SLIST_FIRST(&fdp->fd_knhash[i]);
1143 					kn = SLIST_FIRST(&fdp->fd_knhash[i]);
1525 	struct filedesc *fdp = p->p_fd;
1555 		if (kev->ident < (u_int)fdp->fd_knlistsize) {
1556 			SLIST_FOREACH(kn, &fdp->fd_knlist[kev->ident], kn_link)
1563 		if (fdp->fd_knhashmask != 0) {
1566 			list = &fdp->fd_knhash[
1567 			    KN_HASH((u_long)kev->ident, fdp->fd_knhashmask)];
1603 			error = knote_fdpattach(kn, fdp, p);
2505 	struct filedesc *fdp = p->p_fd;
2509 	list = &fdp->fd_knlist[fd];
2534 		list = &fdp->fd_knlist[fd];
2540 knote_fdpattach(struct knote *kn, struct filedesc *fdp, struct proc *p)
2545 		if (fdp->fd_knhashmask == 0)
2546 			fdp->fd_knhash = hashinit(CONFIG_KN_HASHSIZE, M_KQUEUE,
2547 			    &fdp->fd_knhashmask);
2548 		list = &fdp->fd_knhash[KN_HASH(kn->kn_id, fdp->fd_knhashmask)];
2550 		if ((u_int)fdp->fd_knlistsize <= kn->kn_id) {
2558 			size = fdp->fd_knlistsize;
2570 			bcopy((caddr_t)fdp->fd_knlist, (caddr_t)list,
2571 			      fdp->fd_knlistsize * sizeof(struct klist *));
2573 			      fdp->fd_knlistsize * sizeof(struct klist *),
2574 			      (size - fdp->fd_knlistsize) * sizeof(struct klist *));
2575 			FREE(fdp->fd_knlist, M_KQUEUE);
2576 			fdp->fd_knlist = list;
2577 			fdp->fd_knlistsize = size;
2579 		list = &fdp->fd_knlist[kn->kn_id];
2596         struct filedesc *fdp = p->p_fd;
2602 		list = &fdp->fd_knlist[kn->kn_id];
2604 		list = &fdp->fd_knhash[KN_HASH(kn->kn_id, fdp->fd_knhashmask)];