ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev_poll.c
(Generate patch)

Comparing libev/ev_poll.c (file contents):
Revision 1.2 by root, Fri Nov 2 16:54:35 2007 UTC vs.
Revision 1.15 by root, Fri Nov 23 05:00:45 2007 UTC

… …
29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 */ 30 */
31 31
32#include <poll.h> 32#include <poll.h>
33 33
34static struct pollfd *polls;
35static int pollmax, pollcnt;
36static int *pollidxs; /* maps fds into structure indices */
37static int pollidxmax;
38
39static void 34static void
40pollidx_init (int *base, int count) 35pollidx_init (int *base, int count)
41{ 36{
42 while (count--) 37 while (count--)
43 *base++ = -1; 38 *base++ = -1;
44} 39}
45 40
46static void 41static void
47poll_modify (int fd, int oev, int nev) 42poll_modify (EV_P_ int fd, int oev, int nev)
48{ 43{
49 int idx; 44 int idx;
45
46 if (oev == nev)
47 return;
48
50 array_needsize (pollidxs, pollidxmax, fd + 1, pollidx_init); 49 array_needsize (int, pollidxs, pollidxmax, fd + 1, pollidx_init);
51 50
52 idx = pollidxs [fd]; 51 idx = pollidxs [fd];
53 52
54 if (idx < 0) /* need to allocate a new pollfd */ 53 if (idx < 0) /* need to allocate a new pollfd */
55 { 54 {
56 idx = pollcnt++; 55 pollidxs [fd] = idx = pollcnt++;
57 array_needsize (polls, pollmax, pollcnt, ); 56 array_needsize (struct pollfd, polls, pollmax, pollcnt, EMPTY2);
58 polls [idx].fd = fd; 57 polls [idx].fd = fd;
59 } 58 }
59
60 assert (polls [idx].fd == fd);
60 61
61 if (nev) 62 if (nev)
62 polls [idx].events = 63 polls [idx].events =
63 (nev & EV_READ ? POLLIN : 0) 64 (nev & EV_READ ? POLLIN : 0)
64 | (nev & EV_WRITE ? POLLOUT : 0); 65 | (nev & EV_WRITE ? POLLOUT : 0);
65 else /* remove pollfd */ 66 else /* remove pollfd */
66 { 67 {
68 pollidxs [fd] = -1;
69
67 if (idx < pollcnt--) 70 if (idx < --pollcnt)
68 { 71 {
69 pollidxs [fd] = -1;
70 polls [idx] = polls [pollcnt]; 72 polls [idx] = polls [pollcnt];
71 pollidxs [polls [idx].fd] = idx; 73 pollidxs [polls [idx].fd] = idx;
72 } 74 }
73 } 75 }
74} 76}
75 77
76static void 78static void
77poll_poll (ev_tstamp timeout) 79poll_poll (EV_P_ ev_tstamp timeout)
78{ 80{
81 int i;
79 int res = poll (polls, pollcnt, ceil (timeout * 1000.)); 82 int res = poll (polls, pollcnt, (int)ceil (timeout * 1000.));
80 83
81 if (res > 0) 84 if (res < 0)
82 {
83 int i;
84
85 for (i = 0; i < pollcnt; ++i)
86 fd_event (
87 polls [i].fd,
88 (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
89 | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
90 );
91 }
92 else if (res < 0)
93 { 85 {
94 if (errno == EBADF) 86 if (errno == EBADF)
95 fd_ebadf (); 87 fd_ebadf (EV_A);
96 else if (errno == ENOMEM) 88 else if (errno == ENOMEM && !syserr_cb)
97 fd_enomem (); 89 fd_enomem (EV_A);
90 else if (errno != EINTR)
91 syserr ("(libev) poll");
92
93 return;
98 } 94 }
95
96 for (i = 0; i < pollcnt; ++i)
97 if (polls [i].revents & POLLNVAL)
98 fd_kill (EV_A_ polls [i].fd);
99 else
100 fd_event (
101 EV_A_
102 polls [i].fd,
103 (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
104 | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
105 );
106}
107
108static int
109poll_init (EV_P_ int flags)
110{
111 method_fudge = 1e-3; /* needed to compensate for select returning early, very conservative */
112 method_modify = poll_modify;
113 method_poll = poll_poll;
114
115 pollidxs = 0; pollidxmax = 0;
116 polls = 0; pollmax = 0; pollcnt = 0;
117
118 return EVBACKEND_POLL;
99} 119}
100 120
101static void 121static void
102poll_init (int flags) 122poll_destroy (EV_P)
103{ 123{
104 ev_method = EVMETHOD_POLL; 124 ev_free (pollidxs);
105 method_fudge = 1e-3; /* needed to compensate for select returning early, very conservative */ 125 ev_free (polls);
106 method_modify = poll_modify;
107 method_poll = poll_poll;
108} 126}
127

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines