1 /*
2 * dhcpcd - DHCP client daemon
3 * Copyright (c) 2006-2013 Roy Marples <roy@marples.name>
4 * All rights reserved
5
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25 * SUCH DAMAGE.
26 */
27
28 #include <sys/time.h>
29 #include <sys/types.h>
30
31 #include <limits.h>
32 #include <poll.h>
33 #include <signal.h>
34 #include <unistd.h>
35
36 #include "pollts.h"
37
38 int
pollts(struct pollfd * __restrict fds,nfds_t nfds,const struct timespec * __restrict ts,const sigset_t * __restrict sigmask)39 pollts(struct pollfd *__restrict fds, nfds_t nfds,
40 const struct timespec *__restrict ts, const sigset_t *__restrict sigmask)
41 {
42 fd_set read_fds;
43 nfds_t n;
44 int maxfd, r;
45
46 FD_ZERO(&read_fds);
47 maxfd = 0;
48 for (n = 0; n < nfds; n++) {
49 if (fds[n].events & POLLIN) {
50 FD_SET(fds[n].fd, &read_fds);
51 if (fds[n].fd > maxfd)
52 maxfd = fds[n].fd;
53 }
54 }
55
56 r = pselect(maxfd + 1, &read_fds, NULL, NULL, ts, sigmask);
57 if (r > 0) {
58 for (n = 0; n < nfds; n++) {
59 fds[n].revents =
60 FD_ISSET(fds[n].fd, &read_fds) ? POLLIN : 0;
61 }
62 }
63
64 return r;
65 }
66