… | |
… | |
51 | idx = pollidxs [fd]; |
51 | idx = pollidxs [fd]; |
52 | |
52 | |
53 | if (idx < 0) /* need to allocate a new pollfd */ |
53 | if (idx < 0) /* need to allocate a new pollfd */ |
54 | { |
54 | { |
55 | pollidxs [fd] = idx = pollcnt++; |
55 | pollidxs [fd] = idx = pollcnt++; |
56 | array_needsize (struct pollfd, polls, pollmax, pollcnt, ); |
56 | array_needsize (struct pollfd, polls, pollmax, pollcnt, (void)); |
57 | polls [idx].fd = fd; |
57 | polls [idx].fd = fd; |
58 | } |
58 | } |
59 | |
59 | |
60 | assert (polls [idx].fd == fd); |
60 | assert (polls [idx].fd == fd); |
61 | |
61 | |
… | |
… | |
92 | |
92 | |
93 | return; |
93 | return; |
94 | } |
94 | } |
95 | |
95 | |
96 | for (i = 0; i < pollcnt; ++i) |
96 | for (i = 0; i < pollcnt; ++i) |
|
|
97 | if (polls [i].revents & POLLNVAL) |
|
|
98 | fd_kill (EV_A_ polls [i].fd); |
|
|
99 | else |
97 | fd_event ( |
100 | fd_event ( |
98 | EV_A_ |
101 | EV_A_ |
99 | polls [i].fd, |
102 | polls [i].fd, |
100 | (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |
103 | (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |
101 | | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) |
104 | | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) |
102 | ); |
105 | ); |
103 | } |
106 | } |
104 | |
107 | |
105 | static int |
108 | static int |
106 | poll_init (EV_P_ int flags) |
109 | poll_init (EV_P_ int flags) |
107 | { |
110 | { |