38 	struct pollfd *poll;  member
61 		n = poll(fds->poll, fds->used, -1);  in write_sigio_thread()
69 			p = &fds->poll[i];  in write_sigio_thread()
88 				memmove(&fds->poll[i], &fds->poll[i + 1],  in write_sigio_thread()
89 					(fds->used - i) * sizeof(*fds->poll));  in write_sigio_thread()
117 	memcpy(new, polls->poll, polls->used * sizeof(struct pollfd));  in need_poll()
118 	kfree(polls->poll);  in need_poll()
120 	polls->poll = new;  in need_poll()
174 		if (all_sigio_fds.poll[i].fd == fd)  in add_sigio_fd()
180 	p = &all_sigio_fds.poll[i];  in add_sigio_fd()
183 		if (current_poll.poll[i].fd == fd)  in add_sigio_fd()
192 	memcpy(next_poll.poll, current_poll.poll,  in add_sigio_fd()
194 	next_poll.poll[n] = *p;  in add_sigio_fd()
217 		if (current_poll.poll[i].fd == fd)  in ignore_sigio_fd()
228 		p = &current_poll.poll[i];  in ignore_sigio_fd()
230 			next_poll.poll[n++] = *p;  in ignore_sigio_fd()
298 	current_poll = ((struct pollfds) { .poll 	= p,  in write_sigio_workaround()
325 	current_poll = ((struct pollfds) { .poll	= NULL,  in write_sigio_workaround()
353 	all_sigio_fds.poll[all_sigio_fds.used++] =  in sigio_broken()