mirror of /home/gitosis/repositories/libowfat.git
Mirror of :pserver:cvs@cvs.fefe.de:/cvs libowfat
https://www.fefe.de/libowfat/
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
209 lines
5.6 KiB
209 lines
5.6 KiB
#include "io_internal.h" |
|
#ifdef HAVE_EPOLL |
|
#define _XOPEN_SOURCE |
|
#endif |
|
#ifdef HAVE_SIGIO |
|
#define _GNU_SOURCE |
|
#include <signal.h> |
|
#endif |
|
#include <unistd.h> |
|
#include <sys/time.h> |
|
#include <poll.h> |
|
#include <errno.h> |
|
#ifdef HAVE_KQUEUE |
|
#include <sys/event.h> |
|
#endif |
|
#ifdef HAVE_EPOLL |
|
#include <inttypes.h> |
|
#include <sys/epoll.h> |
|
#endif |
|
#ifdef HAVE_DEVPOLL |
|
#include <sys/types.h> |
|
#include <sys/socket.h> |
|
#include <sys/devpoll.h> |
|
#endif |
|
|
|
int64 io_waituntil2(int64 milliseconds) { |
|
struct pollfd* p; |
|
long i,j,r; |
|
if (!io_wanted_fds) return 0; |
|
#ifdef HAVE_EPOLL |
|
if (io_waitmode==EPOLL) { |
|
int n; |
|
struct epoll_event y[100]; |
|
if ((n=epoll_wait(io_master,y,100,milliseconds))==-1) return -1; |
|
for (i=n-1; i>=0; --i) { |
|
io_entry* e=array_get(&io_fds,sizeof(io_entry),y[i].data.fd); |
|
if (e) { |
|
if (y[i].events&(EPOLLERR|EPOLLHUP)) { |
|
/* error; signal whatever app is looking for */ |
|
if (e->wantread) y[i].events|=EPOLLIN; |
|
if (e->wantwrite) y[i].events|=EPOLLOUT; |
|
} |
|
if (!e->canread && (y[i].events&(EPOLLIN|EPOLLPRI|EPOLLRDNORM|EPOLLRDBAND))) { |
|
e->canread=1; |
|
e->next_read=first_readable; |
|
first_readable=y[i].data.fd; |
|
} |
|
if (!e->canwrite && (y[i].events&EPOLLOUT)) { |
|
e->canwrite=1; |
|
e->next_write=first_writeable; |
|
first_writeable=y[i].data.fd; |
|
} |
|
} else { |
|
epoll_ctl(io_master,EPOLL_CTL_DEL,y[i].data.fd,y+i); |
|
} |
|
} |
|
return n; |
|
} |
|
#endif |
|
#ifdef HAVE_KQUEUE |
|
if (io_waitmode==KQUEUE) { |
|
struct kevent y[100]; |
|
int n; |
|
struct timespec ts; |
|
ts.tv_sec=milliseconds/1000; ts.tv_nsec=(milliseconds%1000)*1000000; |
|
if ((n=kevent(io_master,0,0,y,100,milliseconds!=-1?&ts:0))==-1) return -1; |
|
for (i=n-1; i>=0; --i) { |
|
io_entry* e=array_get(&io_fds,sizeof(io_entry),y[--n].ident); |
|
if (e) { |
|
if (y[n].flags&EV_ERROR) { |
|
/* error; signal whatever app is looking for */ |
|
if (e->wantread) y[n].filter=EVFILT_READ; else |
|
if (e->wantwrite) y[n].filter=EVFILT_WRITE; |
|
} |
|
if (!e->canread && (y[n].filter==EVFILT_READ)) { |
|
e->canread=1; |
|
e->next_read=first_readable; |
|
first_readable=y[n].ident; |
|
} |
|
if (!e->canwrite && (y[n].filter==EVFILT_WRITE)) { |
|
e->canwrite=1; |
|
e->next_write=first_writeable; |
|
first_writeable=y[i].ident; |
|
} |
|
} |
|
} |
|
return n; |
|
} |
|
#endif |
|
#ifdef HAVE_DEVPOLL |
|
if (io_waitmode==DEVPOLL) { |
|
dvpoll_t timeout; |
|
struct pollfd y[100]; |
|
int n; |
|
timeout.dp_timeout=milliseconds; |
|
timeout.dp_nfds=100; |
|
timeout.dp_fds=y; |
|
if ((n=ioctl(io_master,DP_POLL,&timeout))==-1) return -1; |
|
for (i=n-1; i>=0; --i) { |
|
io_entry* e=array_get(&io_fds,sizeof(io_entry),y[--n].fd); |
|
if (e) { |
|
if (y[n].revents&(POLLERR|POLLHUP|POLLNVAL)) { |
|
/* error; signal whatever app is looking for */ |
|
if (e->wantread) y[n].revents=POLLIN; |
|
if (e->wantwrite) y[n].revents=POLLOUT; |
|
} |
|
if (!e->canread && (y[n].revents&POLLIN)) { |
|
e->canread=1; |
|
if (e->next_read==-1) { |
|
e->next_read=first_readable; |
|
first_readable=y[n].fd; |
|
} |
|
} |
|
if (!e->canwrite && (y[n].revents&POLLOUT)) { |
|
e->canwrite=1; |
|
if (e->next_write==-1) { |
|
e->next_write=first_writeable; |
|
first_writeable=y[i].fd; |
|
} |
|
} |
|
} |
|
} |
|
return n; |
|
} |
|
#endif |
|
#ifdef HAVE_SIGIO |
|
if (io_waitmode==_SIGIO) { |
|
siginfo_t info; |
|
struct timespec ts; |
|
int r; |
|
io_entry* e; |
|
if (alt_firstread>=0 && (e=array_get(&io_fds,sizeof(io_entry),alt_firstread)) && e->canread) return 1; |
|
if (alt_firstwrite>=0 && (e=array_get(&io_fds,sizeof(io_entry),alt_firstwrite)) && e->canwrite) return 1; |
|
if (milliseconds==-1) |
|
r=sigwaitinfo(&io_ss,&info); |
|
else { |
|
ts.tv_sec=milliseconds/1000; ts.tv_nsec=(milliseconds%1000)*1000000; |
|
r=sigtimedwait(&io_ss,&info,&ts); |
|
} |
|
switch (r) { |
|
case SIGIO: |
|
/* signal queue overflow */ |
|
signal(io_signum,SIG_DFL); |
|
goto dopoll; |
|
default: |
|
if (r==io_signum) { |
|
io_entry* e=array_get(&io_fds,sizeof(io_entry),info.si_fd); |
|
if (e) { |
|
if (info.si_band&(POLLERR|POLLHUP)) { |
|
/* error; signal whatever app is looking for */ |
|
if (e->wantread) info.si_band|=POLLIN; |
|
if (e->wantwrite) info.si_band|=POLLOUT; |
|
} |
|
if (info.si_band&POLLIN && !e->canread) { |
|
debug_printf(("io_waituntil2: enqueueing %ld in normal read queue before %ld\n",info.si_fd,first_readable)); |
|
e->canread=1; |
|
e->next_read=first_readable; |
|
first_readable=info.si_fd; |
|
} |
|
if (info.si_band&POLLOUT && !e->canwrite) { |
|
debug_printf(("io_waituntil2: enqueueing %ld in normal write queue before %ld\n",info.si_fd,first_writeable)); |
|
e->canwrite=1; |
|
e->next_write=first_writeable; |
|
first_writeable=info.si_fd; |
|
} |
|
} |
|
} |
|
} |
|
return 1; |
|
} |
|
dopoll: |
|
#endif |
|
for (i=r=0; i<array_length(&io_fds,sizeof(io_entry)); ++i) { |
|
io_entry* e=array_get(&io_fds,sizeof(io_entry),i); |
|
if (!e) return -1; |
|
e->canread=e->canwrite=0; |
|
if (e->wantread || e->wantwrite) { |
|
struct pollfd* p; |
|
if ((p=array_allocate(&io_pollfds,sizeof(struct pollfd),r))) { |
|
p->fd=i; |
|
p->events=(e->wantread?POLLIN:0) + (e->wantwrite?POLLOUT:0); |
|
++r; |
|
} else |
|
return -1; |
|
} |
|
} |
|
p=array_start(&io_pollfds); |
|
if ((i=poll(array_start(&io_pollfds),r,milliseconds))<1) return -1; |
|
for (j=r-1; j>=0; --j) { |
|
io_entry* e=array_get(&io_fds,sizeof(io_entry),p->fd); |
|
if (p->revents&(POLLERR|POLLHUP|POLLNVAL)) { |
|
/* error; signal whatever app is looking for */ |
|
if (e->wantread) p->revents|=POLLIN; |
|
if (e->wantwrite) p->revents|=POLLOUT; |
|
} |
|
if (!e->canread && (p->revents&POLLIN)) { |
|
e->canread=1; |
|
e->next_read=first_readable; |
|
first_readable=p->fd; |
|
} |
|
if (!e->canwrite && (p->revents&POLLOUT)) { |
|
e->canwrite=1; |
|
e->next_write=first_writeable; |
|
first_writeable=p->fd; |
|
} |
|
p++; |
|
} |
|
return i; |
|
}
|
|
|