| … | |
… | |
| 40 | #include <poll.h> |
40 | #include <poll.h> |
| 41 | |
41 | |
| 42 | void inline_size |
42 | void inline_size |
| 43 | pollidx_init (int *base, int count) |
43 | pollidx_init (int *base, int count) |
| 44 | { |
44 | { |
|
|
45 | /* consider using memset (.., -1, ...), which is pratically guarenteed |
|
|
46 | * to work on all systems implementing poll */ |
| 45 | while (count--) |
47 | while (count--) |
| 46 | *base++ = -1; |
48 | *base++ = -1; |
| 47 | } |
49 | } |
| 48 | |
50 | |
| 49 | static void |
51 | static void |
| … | |
… | |
| 94 | if (errno == EBADF) |
96 | if (errno == EBADF) |
| 95 | fd_ebadf (EV_A); |
97 | fd_ebadf (EV_A); |
| 96 | else if (errno == ENOMEM && !syserr_cb) |
98 | else if (errno == ENOMEM && !syserr_cb) |
| 97 | fd_enomem (EV_A); |
99 | fd_enomem (EV_A); |
| 98 | else if (errno != EINTR) |
100 | else if (errno != EINTR) |
| 99 | syserr ("(libev) poll"); |
101 | ev_syserr ("(libev) poll"); |
| 100 | } |
102 | } |
| 101 | else |
103 | else |
| 102 | for (p = polls; res; ++p) |
104 | for (p = polls; res; ++p) |
| 103 | if (expect_false (p->revents)) /* this expect is debatable */ |
105 | if (expect_false (p->revents)) /* this expect is debatable */ |
| 104 | { |
106 | { |
