| line |
true |
false |
branch |
|
50
|
0 |
0 |
while (count--) |
|
59
|
0 |
0 |
if (oev == nev) |
|
62
|
0 |
0 |
array_needsize (int, pollidxs, pollidxmax, fd + 1, array_needsize_pollidx); |
|
66
|
0 |
0 |
if (idx < 0) /* need to allocate a new pollfd */ |
|
69
|
0 |
0 |
array_needsize (struct pollfd, polls, pollmax, pollcnt, array_needsize_noinit); |
|
75
|
0 |
0 |
if (nev) |
|
76
|
0 |
0 |
polls [idx].events = |
|
83
|
0 |
0 |
if (ecb_expect_true (idx < --pollcnt)) |
|
97
|
0 |
0 |
EV_RELEASE_CB; |
|
99
|
0 |
0 |
EV_ACQUIRE_CB; |
|
101
|
0 |
0 |
if (ecb_expect_false (res < 0)) |
|
103
|
0 |
0 |
if (errno == EBADF) |
|
105
|
0 |
0 |
else if (errno == ENOMEM && !syserr_cb) |
|
|
0 |
0 |
else if (errno == ENOMEM && !syserr_cb) |
|
107
|
0 |
0 |
else if (errno != EINTR) |
|
111
|
0 |
0 |
for (p = polls; res; ++p) |
|
115
|
0 |
0 |
if (ecb_expect_false (p->revents)) /* this expect is debatable */ |
|
119
|
0 |
0 |
if (ecb_expect_false (p->revents & POLLNVAL)) |
|
128
|
0 |
0 |
(p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |