110 lines
2.7 KiB
C
110 lines
2.7 KiB
C
/*
|
|
* Copyright (C) 2009-2010 Mamadou Diop.
|
|
*
|
|
* Contact: Mamadou Diop <diopmamadou(at)doubango.org>
|
|
*
|
|
* This file is part of Open Source Doubango Framework.
|
|
*
|
|
* DOUBANGO is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* DOUBANGO is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with DOUBANGO.
|
|
*
|
|
*/
|
|
#include "tnet_poll.h"
|
|
|
|
#if TNET_USE_POLL && !TNET_HAVE_POLL
|
|
|
|
/**
|
|
*
|
|
* @brief poll() method implementation for multiplexing network sockets.
|
|
*
|
|
* @param fds An array of pollfd structures.
|
|
* @param nfds The number of file descriptors set in fds[ ].
|
|
* @param timeout How long poll() should wait for an event to occur (in milliseconds).
|
|
*
|
|
* @return The number of elements in fdarray for which an revents member of the POLLFD structure is nonzero.
|
|
* If the the returned value if <0 this mean that error occurred.
|
|
**/
|
|
|
|
int tnet_poll(tnet_pollfd_t fds[ ], tnet_nfds_t nfds, int timeout)
|
|
{
|
|
tsk_size_t i;
|
|
int ret;
|
|
int highest_fd = -1;
|
|
|
|
fd_set readfds;
|
|
fd_set writefds;
|
|
fd_set exceptfds;
|
|
struct timeval timetowait;
|
|
|
|
/*
|
|
* cleanup fd_sets
|
|
*/
|
|
FD_ZERO(&readfds);
|
|
FD_ZERO(&writefds);
|
|
FD_ZERO(&exceptfds);
|
|
|
|
/*
|
|
* set timeout
|
|
*/
|
|
if(timeout >=0){
|
|
timetowait.tv_sec = (timeout/1000);
|
|
timetowait.tv_usec = (timeout%1000) * 1000;
|
|
}
|
|
|
|
/*
|
|
* add descriptors to the fd_sets
|
|
*/
|
|
for(i = 0; i<nfds; i++){
|
|
if(fds[i].fd != TNET_INVALID_FD){
|
|
if(fds[i].events & TNET_POLLIN){
|
|
FD_SET(fds[i].fd, &readfds);
|
|
}
|
|
if(fds[i].events & TNET_POLLOUT){
|
|
FD_SET(fds[i].fd, &writefds);
|
|
}
|
|
if(fds[i].events & TNET_POLLPRI){
|
|
FD_SET(fds[i].fd, &exceptfds);
|
|
}
|
|
}
|
|
|
|
highest_fd = (highest_fd < fds[i].fd) ? fds[i].fd : highest_fd;
|
|
}
|
|
|
|
/*======================================
|
|
* select
|
|
*/
|
|
if((ret = select(highest_fd + 1, &readfds, &writefds, &exceptfds, (timeout >=0) ? &timetowait : 0)) >= 0){
|
|
for(i = 0; i<nfds; i++){
|
|
if(fds[i].fd != TNET_INVALID_FD){
|
|
fds[i].revents = 0;
|
|
|
|
if(FD_ISSET(fds[i].fd, &readfds)){
|
|
fds[i].revents |= TNET_POLLIN;
|
|
}
|
|
if(FD_ISSET(fds[i].fd, &writefds)){
|
|
fds[i].revents |= TNET_POLLOUT;
|
|
}
|
|
if(FD_ISSET(fds[i].fd, &exceptfds)){
|
|
fds[i].revents |= TNET_POLLPRI;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
#endif /* TNET_USE_POLL */
|
|
|
|
|