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

Comparing libev/ev_epoll.c (file contents):
Revision 1.22 by root, Tue Nov 6 01:17:16 2007 UTC vs.
Revision 1.35 by root, Thu Oct 23 04:56:49 2008 UTC

1/* 1/*
2 * libev epoll fd activity backend 2 * libev epoll fd activity backend
3 * 3 *
4 * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> 4 * Copyright (c) 2007,2008 Marc Alexander Lehmann <libev@schmorp.de>
5 * All rights reserved. 5 * All rights reserved.
6 * 6 *
7 * Redistribution and use in source and binary forms, with or without 7 * Redistribution and use in source and binary forms, with or without modifica-
8 * modification, are permitted provided that the following conditions are 8 * tion, are permitted provided that the following conditions are met:
9 * met:
10 * 9 *
11 * * Redistributions of source code must retain the above copyright 10 * 1. Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer.
12 *
13 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer. 14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
13 * 16 *
14 * * Redistributions in binary form must reproduce the above 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
15 * copyright notice, this list of conditions and the following 18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
16 * disclaimer in the documentation and/or other materials provided 19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
17 * with the distribution. 20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
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 21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 25 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 * OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Alternatively, the contents of this file may be used under the terms of
29 * the GNU General Public License ("GPL") version 2 or any later version,
30 * in which case the provisions of the GPL are applicable instead of
31 * the above. If you wish to allow the use of your version of this file
32 * only under the terms of the GPL and not to allow others to use your
33 * version of this file under the BSD license, indicate your decision
34 * by deleting the provisions above and replace them with the notice
35 * and other provisions required by the GPL. If you do not delete the
36 * provisions above, a recipient may use your version of this file under
37 * either the BSD or the GPL.
30 */ 38 */
31 39
40/*
41 * general notes about epoll:
42 *
43 * a) epoll silently removes fds from the fd set. as nothing tells us
44 * that an fd has been removed otherwise, we have to continually
45 * "rearm" fds that we suspect *might* have changed (same
46 * problem with kqueue, but much less costly there).
47 * b) the fact that ADD != MOD creates a lot of extra syscalls due to a)
48 * and seems not to have any advantage.
49 * c) the inability to handle fork or file descriptors (think dup)
50 * limits the applicability over poll, so this is not a generic
51 * poll replacement.
52 *
53 * lots of "weird code" and complication handling in this file is due
54 * to these design problems with epoll, as we try very hard to avoid
55 * epoll_ctl syscalls for common usage patterns.
56 */
57
32#include <sys/epoll.h> 58#include <sys/epoll.h>
59
60void inline_size
61unsigned_char_init (unsigned char *base, int count)
62{
63 /* memset might be overkill */
64 while (count--)
65 *base++ = 0;
66}
33 67
34static void 68static void
35epoll_modify (EV_P_ int fd, int oev, int nev) 69epoll_modify (EV_P_ int fd, int oev, int nev)
36{ 70{
37 int mode = nev ? oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD : EPOLL_CTL_DEL;
38
39 struct epoll_event ev; 71 struct epoll_event ev;
72 unsigned char oldmask;
73
74 /*
75 * we handle EPOLL_CTL_DEL by ignoring it here
76 * on the assumption that the fd is gone anyways
77 * if that is wrong, we have to handle the spurious
78 * event in epoll_poll.
79 * the fd is later added, we try to ADD it, and, if that
80 * fails, we assume it still has the same eventmask.
81 */
82 if (!nev)
83 return;
84
85 oldmask = anfds [fd].emask;
86 anfds [fd].emask = nev;
87
40 ev.data.u64 = fd; /* use u64 to fully initialise the struct, for nicer strace etc. */ 88 ev.data.u64 = fd; /* use u64 to fully initialise the struct, for nicer strace etc. */
41 ev.events =
42 (nev & EV_READ ? EPOLLIN : 0) 89 ev.events = (nev & EV_READ ? EPOLLIN : 0)
43 | (nev & EV_WRITE ? EPOLLOUT : 0); 90 | (nev & EV_WRITE ? EPOLLOUT : 0);
44 91
45 if (epoll_ctl (epoll_fd, mode, fd, &ev)) 92 if (expect_true (!epoll_ctl (backend_fd, oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev)))
93 return;
94
95 if (expect_true (errno == ENOENT))
96 {
46 if (errno != ENOENT /* on ENOENT the fd went away, so try to do the right thing */ 97 /* if ENOENT then the fd went away, so try to do the right thing */
98 if (!nev)
99 return;
100
47 || (nev && epoll_ctl (epoll_fd, EPOLL_CTL_ADD, fd, &ev))) 101 if (!epoll_ctl (backend_fd, EPOLL_CTL_ADD, fd, &ev))
102 return;
103 }
104 else if (expect_true (errno == EEXIST))
105 {
106 /* EEXIST means we ignored a previous DEL, but the fd is still active */
107 /* if the kernel mask is the same as the new mask, we assume it hasn't changed */
108 if (oldmask == nev || !epoll_ctl (backend_fd, EPOLL_CTL_MOD, fd, &ev))
109 return;
110 }
111
48 fd_kill (EV_A_ fd); 112 fd_kill (EV_A_ fd);
49} 113}
50 114
51static void 115static void
52epoll_poll (EV_P_ ev_tstamp timeout) 116epoll_poll (EV_P_ ev_tstamp timeout)
53{ 117{
54 int i; 118 int i;
55 int eventcnt = epoll_wait (epoll_fd, epoll_events, epoll_eventmax, ceil (timeout * 1000.)); 119 int eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.));
56 120
57 if (eventcnt < 0) 121 if (expect_false (eventcnt < 0))
58 { 122 {
59 if (errno != EINTR) 123 if (errno != EINTR)
60 syserr ("(libev) epoll_wait"); 124 syserr ("(libev) epoll_wait");
61 125
62 return; 126 return;
63 } 127 }
64 128
65 for (i = 0; i < eventcnt; ++i) 129 for (i = 0; i < eventcnt; ++i)
66 fd_event ( 130 {
67 EV_A_ 131 struct epoll_event *ev = epoll_events + i;
68 epoll_events [i].data.u64, 132
133 int fd = ev->data.u64;
69 (epoll_events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) 134 int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0)
70 | (epoll_events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0) 135 | (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0);
71 ); 136 int want = anfds [fd].events;
137
138 if (expect_false (got & ~want))
139 {
140 anfds [fd].emask = want;
141
142 /* we received an event but are not interested in it, try mod or del */
143 /* I don't think we ever need MOD, but let's handle it anyways */
144 ev->events = (want & EV_READ ? EPOLLIN : 0)
145 | (want & EV_WRITE ? EPOLLOUT : 0);
146
147 epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev);
148 }
149
150 fd_event (EV_A_ fd, got);
151 }
72 152
73 /* if the receive array was full, increase its size */ 153 /* if the receive array was full, increase its size */
74 if (expect_false (eventcnt == epoll_eventmax)) 154 if (expect_false (eventcnt == epoll_eventmax))
75 { 155 {
76 ev_free (epoll_events); 156 ev_free (epoll_events);
77 epoll_eventmax = array_roundsize (epoll_events, epoll_eventmax << 1); 157 epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1);
78 epoll_events = ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); 158 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
79 } 159 }
80} 160}
81 161
82static int 162int inline_size
83epoll_init (EV_P_ int flags) 163epoll_init (EV_P_ int flags)
84{ 164{
85 epoll_fd = epoll_create (256); 165 backend_fd = epoll_create (256);
86 166
87 if (epoll_fd < 0) 167 if (backend_fd < 0)
88 return 0; 168 return 0;
89 169
90 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); 170 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
91 171
92 method_fudge = 1e-3; /* needed to compensate for epoll returning early */ 172 backend_fudge = 0.; /* kernel sources seem to indicate this to be zero */
93 method_modify = epoll_modify; 173 backend_modify = epoll_modify;
94 method_poll = epoll_poll; 174 backend_poll = epoll_poll;
95 175
96 epoll_eventmax = 64; /* intiial number of events receivable per poll */ 176 epoll_eventmax = 64; /* intiial number of events receivable per poll */
97 epoll_events = ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); 177 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
98 178
99 return EVMETHOD_EPOLL; 179 return EVBACKEND_EPOLL;
100} 180}
101 181
102static void 182void inline_size
103epoll_destroy (EV_P) 183epoll_destroy (EV_P)
104{ 184{
105 close (epoll_fd);
106
107 ev_free (epoll_events); 185 ev_free (epoll_events);
108} 186}
109 187
110static void 188void inline_size
111epoll_fork (EV_P) 189epoll_fork (EV_P)
112{ 190{
113 close (epoll_fd); 191 close (backend_fd);
114 192
115 while ((epoll_fd = epoll_create (256)) < 0) 193 while ((backend_fd = epoll_create (256)) < 0)
116 syserr ("(libev) epoll_create"); 194 syserr ("(libev) epoll_create");
117 195
118 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); 196 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
119 197
120 fd_rearm_all (EV_A); 198 fd_rearm_all (EV_A);
121} 199}
122 200

Diff Legend

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