Lines Matching defs:fdp
110 struct pollfd *fdp;
125 for (i = 0, fdp = ufds; i < nfds; i++, fdp++)
127 fdp->revents = 0;
129 if (fdp->events & POLLIN)
130 FD_SET (fdp->fd, &rfds);
132 FD_SET (fdp->fd, &efds);
134 maxfd = (fdp->fd > maxfd) ? fdp->fd : maxfd;
144 for (i = 0, fdp = ufds; i < nfds; i++, fdp++)
146 if (fdp->events & POLLIN)
147 if (FD_ISSET (fdp->fd, &rfds))
148 fdp->revents |= POLLIN;
150 if (FD_ISSET (fdp->fd, &efds))
151 fdp->revents |= POLLERR;
2478 struct pollfd *fdp = NULL;
2498 for (fdp = fds; nfds > 0; nfds--, fdp++)
2499 close (fdp->fd);
2839 struct pollfd *fdp;
2846 fdp = *fds;
2936 fdp->fd = fd;
2937 fdp->events = POLLIN;
2940 fdp++;
2943 *fds = fdp;
2952 struct pollfd *fdp;
2989 fdp = *fds;
2994 do_bindings_family (AF_INET6, nfds, &fdp, res);
2996 do_bindings_family (AF_INET, nfds, &fdp, res);
3193 struct pollfd *fdp = NULL;
3285 for (i = 0, fdp = fds; i < nfds; i++, fdp++)
3288 if (fdp->revents & (POLLERR | POLLHUP | POLLNVAL))
3290 for (i = 0, fdp = fds; i < nfds; i++, fdp++)
3291 close (fdp->fd);
3302 else if (! (fdp->revents & POLLIN))
3305 fd = accept (fdp->fd, 0, 0);
3322 for (i = 0, fdp = fds; i < nfds; i++, fdp++)
3323 close (fdp->fd);