Lines Matching defs:fds
316 struct pollfd fds[LDAP_DEFAULT_REFHOPLIMIT];
329 /* find if sb is in fds */
331 if (sip->fds[i].fd == sb->sb_sd){
332 sip->fds[i].events |= POLLOUT;
337 sip->fds[sip->nbfds].fd = sb->sb_sd;
338 sip->fds[sip->nbfds].events |= POLLOUT;
356 /* find if sb is in fds */
358 if (sip->fds[i].fd == sb->sb_sd) {
359 sip->fds[i].events |= POLLIN;
365 sip->fds[sip->nbfds].fd = sb->sb_sd;
366 sip->fds[sip->nbfds].events |= POLLIN;
385 if (sip->fds[i].fd == sb->sb_sd){
388 sip->fds[ i - 1] = sip->fds[i];
390 sip->fds[i].fd = -1;
391 sip->fds[i].events = -1;
410 if (sip->fds[i].fd == sb->sb_sd) {
411 if ( sip->fds[i].revents & (POLLERR | POLLHUP | POLLNVAL)) {
414 return( sip->fds[i].revents & POLLOUT );
430 if (sip->fds[i].fd == sb->sb_sd) {
431 if (sip->fds[i].revents & (POLLERR | POLLHUP | POLLNVAL)) {
434 return( sip->fds[i].revents & POLLIN );
471 /* sip->fds[0].revents = 0; */
482 rv = poll(sip->fds,sip->nbfds,tim);
487 return( poll(sip->fds,sip->nbfds,tim) );