ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev_poll.c
Revision: 1.6
Committed: Sun Nov 4 23:14:11 2007 UTC (17 years, 1 month ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.5: +4 -0 lines
Log Message:
- have to re-check potentially closed fds regularly for epoll. this hurts
  badly :(
- still more than twice as fats as libevent.
- many minor fixes

File Contents

# Content
1 /*
2 * libev epoll fd activity backend
3 *
4 * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de>
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions are
9 * met:
10 *
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 *
14 * * Redistributions in binary form must reproduce the above
15 * copyright notice, this list of conditions and the following
16 * disclaimer in the documentation and/or other materials provided
17 * with the distribution.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 */
31
32 #include <poll.h>
33
34 static void
35 pollidx_init (int *base, int count)
36 {
37 while (count--)
38 *base++ = -1;
39 }
40
41 static void
42 poll_modify (EV_P_ int fd, int oev, int nev)
43 {
44 int idx;
45
46 if (oev == nev)
47 return;
48
49 array_needsize (pollidxs, pollidxmax, fd + 1, pollidx_init);
50
51 idx = pollidxs [fd];
52
53 if (idx < 0) /* need to allocate a new pollfd */
54 {
55 idx = pollcnt++;
56 array_needsize (polls, pollmax, pollcnt, );
57 polls [idx].fd = fd;
58 }
59
60 if (nev)
61 polls [idx].events =
62 (nev & EV_READ ? POLLIN : 0)
63 | (nev & EV_WRITE ? POLLOUT : 0);
64 else /* remove pollfd */
65 {
66 if (idx < pollcnt--)
67 {
68 pollidxs [fd] = -1;
69 polls [idx] = polls [pollcnt];
70 pollidxs [polls [idx].fd] = idx;
71 }
72 }
73 }
74
75 static void
76 poll_poll (EV_P_ ev_tstamp timeout)
77 {
78 int res = poll (polls, pollcnt, ceil (timeout * 1000.));
79
80 if (res > 0)
81 {
82 int i;
83
84 for (i = 0; i < pollcnt; ++i)
85 fd_event (
86 EV_A_
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 {
94 if (errno == EBADF)
95 fd_ebadf (EV_A);
96 else if (errno == ENOMEM)
97 fd_enomem (EV_A);
98 }
99 }
100
101 static int
102 poll_init (EV_P_ int flags)
103 {
104 method_fudge = 1e-3; /* needed to compensate for select returning early, very conservative */
105 method_modify = poll_modify;
106 method_poll = poll_poll;
107
108 pollidxs = 0; pollidxmax = 0;
109 polls = 0; pollmax = 0; pollcnt = 0;
110
111 return EVMETHOD_POLL;
112 }
113
114 static void
115 poll_destroy (EV_P)
116 {
117 free (pollidxs);
118 free (polls);
119 }