Searched refs:pollfds (Results 1 – 3 of 3) sorted by relevance
82 if (!pollfds) { in fpm_event_poll_init()90 pollfds[i].fd = -1; in fpm_event_poll_init()96 free(pollfds); in fpm_event_poll_init()114 if (pollfds) { in fpm_event_poll_clean()115 free(pollfds); in fpm_event_poll_clean()116 pollfds = NULL; in fpm_event_poll_clean()206 if (pollfds[i].fd != -1) { in fpm_event_poll_add()212 pollfds[i].fd = ev->fd; in fpm_event_poll_add()213 pollfds[i].events = POLLIN; in fpm_event_poll_add()262 pollfds[i].fd = -1; in fpm_event_poll_remove()[all …]
52 static struct pollfd *pollfds = NULL; variable89 pollfds = malloc(sizeof(struct pollfd) * max); in fpm_event_devpoll_init()90 if (!pollfds) { in fpm_event_devpoll_init()94 memset(pollfds, 0, sizeof(struct pollfd) * max); in fpm_event_devpoll_init()98 pollfds[i].fd = -1; in fpm_event_devpoll_init()104 free(pollfds); in fpm_event_devpoll_init()129 if (pollfds) { in fpm_event_devpoll_clean()130 free(pollfds); in fpm_event_devpoll_clean()131 pollfds = NULL; in fpm_event_devpoll_clean()
93 if ( pollfds == (struct pollfd*) 0 || poll_fdidx == (int*) 0 ||96 + memset(pollfds, 0, sizeof(struct pollfd) * nfiles);104 - if ( pollfds[i].revents & ( POLLIN | POLLOUT ) )105 + if ( pollfds[i].revents & ( POLLIN | POLLOUT | POLLERR | POLLHUP | POLLNVAL ) )106 poll_rfdidx[ridx++] = pollfds[i].fd;113 - case FDW_READ: return pollfds[poll_fdidx[fd]].revents & POLLIN;114 - case FDW_WRITE: return pollfds[poll_fdidx[fd]].revents & POLLOUT;115 + case FDW_READ: return pollfds[poll_fdidx[fd]].revents & ( POLLIN | POLLERR | POLLHUP | POLLNVAL );116 + case FDW_WRITE: return pollfds[poll_fdidx[fd]].revents & ( POLLOUT | POLLERR | POLLHUP | POLLNVA…
Completed in 13 milliseconds