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.50 by root, Tue Mar 23 23:45:12 2010 UTC vs.
Revision 1.64 by root, Mon Jun 27 21:51:52 2011 UTC

1/* 1/*
2 * libev epoll fd activity backend 2 * libev epoll fd activity backend
3 * 3 *
4 * Copyright (c) 2007,2008,2009,2010 Marc Alexander Lehmann <libev@schmorp.de> 4 * Copyright (c) 2007,2008,2009,2010,2011 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 modifica- 7 * Redistribution and use in source and binary forms, with or without modifica-
8 * tion, are permitted provided that the following conditions are met: 8 * tion, are permitted provided that the following conditions are met:
9 * 9 *
10 * 1. Redistributions of source code must retain the above copyright notice, 10 * 1. Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer. 11 * this list of conditions and the following disclaimer.
12 * 12 *
13 * 2. Redistributions in binary form must reproduce the above copyright 13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the 14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution. 15 * documentation and/or other materials provided with the distribution.
16 * 16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- 18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO 19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- 20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
51 * poll replacement. 51 * poll replacement.
52 * d) epoll doesn't work the same as select with many file descriptors 52 * d) epoll doesn't work the same as select with many file descriptors
53 * (such as files). while not critical, no other advanced interface 53 * (such as files). while not critical, no other advanced interface
54 * seems to share this (rather non-unixy) limitation. 54 * seems to share this (rather non-unixy) limitation.
55 * e) epoll claims to be embeddable, but in practise you never get 55 * e) epoll claims to be embeddable, but in practise you never get
56 * a ready event for the epoll fd. 56 * a ready event for the epoll fd (broken: <=2.6.26, working: >=2.6.32).
57 * f) epoll_ctl returning EPERM means the fd is always ready.
57 * 58 *
58 * lots of "weird code" and complication handling in this file is due 59 * lots of "weird code" and complication handling in this file is due
59 * to these design problems with epoll, as we try very hard to avoid 60 * to these design problems with epoll, as we try very hard to avoid
60 * epoll_ctl syscalls for common usage patterns and handle the breakage 61 * epoll_ctl syscalls for common usage patterns and handle the breakage
61 * ensuing from receiving events for closed and otherwise long gone 62 * ensuing from receiving events for closed and otherwise long gone
62 * file descriptors. 63 * file descriptors.
63 */ 64 */
64 65
65#include <sys/epoll.h> 66#include <sys/epoll.h>
67
68#define EV_EMASK_EPERM 0x80
66 69
67static void 70static void
68epoll_modify (EV_P_ int fd, int oev, int nev) 71epoll_modify (EV_P_ int fd, int oev, int nev)
69{ 72{
70 struct epoll_event ev; 73 struct epoll_event ev;
88 ev.data.u64 = (uint64_t)(uint32_t)fd 91 ev.data.u64 = (uint64_t)(uint32_t)fd
89 | ((uint64_t)(uint32_t)++anfds [fd].egen << 32); 92 | ((uint64_t)(uint32_t)++anfds [fd].egen << 32);
90 ev.events = (nev & EV_READ ? EPOLLIN : 0) 93 ev.events = (nev & EV_READ ? EPOLLIN : 0)
91 | (nev & EV_WRITE ? EPOLLOUT : 0); 94 | (nev & EV_WRITE ? EPOLLOUT : 0);
92 95
93 if (expect_true (!epoll_ctl (backend_fd, oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev))) 96 if (expect_true (!epoll_ctl (backend_fd, oev && oldmask != nev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev)))
94 return; 97 return;
95 98
96 if (expect_true (errno == ENOENT)) 99 if (expect_true (errno == ENOENT))
97 { 100 {
98 /* if ENOENT then the fd went away, so try to do the right thing */ 101 /* if ENOENT then the fd went away, so try to do the right thing */
110 goto dec_egen; 113 goto dec_egen;
111 114
112 if (!epoll_ctl (backend_fd, EPOLL_CTL_MOD, fd, &ev)) 115 if (!epoll_ctl (backend_fd, EPOLL_CTL_MOD, fd, &ev))
113 return; 116 return;
114 } 117 }
118 else if (expect_true (errno == EPERM))
119 {
120 /* EPERM means the fd is always ready, but epoll is too snobbish */
121 /* to handle it, unlike select or poll. */
122 anfds [fd].emask = EV_EMASK_EPERM;
123
124 /* add fd to epoll_eperms, if not already inside */
125 if (!(oldmask & EV_EMASK_EPERM))
126 {
127 array_needsize (int, epoll_eperms, epoll_epermmax, epoll_epermcnt + 1, EMPTY2);
128 epoll_eperms [epoll_epermcnt++] = fd;
129 }
130
131 return;
132 }
115 133
116 fd_kill (EV_A_ fd); 134 fd_kill (EV_A_ fd);
117 135
118dec_egen: 136dec_egen:
119 /* we didn't successfully call epoll_ctl, so decrement the generation counter again */ 137 /* we didn't successfully call epoll_ctl, so decrement the generation counter again */
123static void 141static void
124epoll_poll (EV_P_ ev_tstamp timeout) 142epoll_poll (EV_P_ ev_tstamp timeout)
125{ 143{
126 int i; 144 int i;
127 int eventcnt; 145 int eventcnt;
128 146
147 if (expect_false (epoll_epermcnt))
148 timeout = 0.;
149
129 /* epoll wait times cannot be larger than (LONG_MAX - 999UL) / HZ msecs, which is below */ 150 /* epoll wait times cannot be larger than (LONG_MAX - 999UL) / HZ msecs, which is below */
130 /* the default libev max wait time, however. */ 151 /* the default libev max wait time, however. */
131 EV_RELEASE_CB; 152 EV_RELEASE_CB;
132 eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.)); 153 eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, timeout * 1e3);
133 EV_ACQUIRE_CB; 154 EV_ACQUIRE_CB;
134 155
135 if (expect_false (eventcnt < 0)) 156 if (expect_false (eventcnt < 0))
136 { 157 {
137 if (errno != EINTR) 158 if (errno != EINTR)
147 int fd = (uint32_t)ev->data.u64; /* mask out the lower 32 bits */ 168 int fd = (uint32_t)ev->data.u64; /* mask out the lower 32 bits */
148 int want = anfds [fd].events; 169 int want = anfds [fd].events;
149 int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) 170 int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0)
150 | (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0); 171 | (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0);
151 172
173 /*
152 /* check for spurious notification */ 174 * check for spurious notification.
175 * this only finds spurious notifications on egen updates
176 * other spurious notifications will be found by epoll_ctl, below
177 * we assume that fd is always in range, as we never shrink the anfds array
178 */
153 if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32))) 179 if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32)))
154 { 180 {
155 /* recreate kernel state */ 181 /* recreate kernel state */
156 postfork = 1; 182 postfork = 1;
157 continue; 183 continue;
159 185
160 if (expect_false (got & ~want)) 186 if (expect_false (got & ~want))
161 { 187 {
162 anfds [fd].emask = want; 188 anfds [fd].emask = want;
163 189
190 /*
164 /* we received an event but are not interested in it, try mod or del */ 191 * we received an event but are not interested in it, try mod or del
165 /* I don't think we ever need MOD, but let's handle it anyways */ 192 * this often happens because we optimistically do not unregister fds
193 * when we are no longer interested in them, but also when we get spurious
194 * notifications for fds from another process. this is partially handled
195 * above with the gencounter check (== our fd is not the event fd), and
196 * partially here, when epoll_ctl returns an error (== a child has the fd
197 * but we closed it).
198 */
166 ev->events = (want & EV_READ ? EPOLLIN : 0) 199 ev->events = (want & EV_READ ? EPOLLIN : 0)
167 | (want & EV_WRITE ? EPOLLOUT : 0); 200 | (want & EV_WRITE ? EPOLLOUT : 0);
168 201
169 /* pre-2.6.9 kernels require a non-null pointer with EPOLL_CTL_DEL, */ 202 /* pre-2.6.9 kernels require a non-null pointer with EPOLL_CTL_DEL, */
170 /* which is fortunately easy to do for us. */ 203 /* which is fortunately easy to do for us. */
171 if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev)) 204 if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev))
172 { 205 {
173 postfork = 1; /* an error occured, recreate kernel state */ 206 postfork = 1; /* an error occurred, recreate kernel state */
174 continue; 207 continue;
175 } 208 }
176 } 209 }
177 210
178 fd_event (EV_A_ fd, got); 211 fd_event (EV_A_ fd, got);
183 { 216 {
184 ev_free (epoll_events); 217 ev_free (epoll_events);
185 epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1); 218 epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1);
186 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); 219 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
187 } 220 }
221
222 /* now synthesize events for all fds where epoll fails, while select works... */
223 for (i = epoll_epermcnt; i--; )
224 {
225 int fd = epoll_eperms [i];
226 unsigned char events = anfds [fd].events & (EV_READ | EV_WRITE);
227
228 if (anfds [fd].emask & EV_EMASK_EPERM && events)
229 fd_event (EV_A_ fd, events);
230 else
231 epoll_eperms [i] = epoll_eperms [--epoll_epermcnt];
232 }
188} 233}
189 234
190int inline_size 235int inline_size
191epoll_init (EV_P_ int flags) 236epoll_init (EV_P_ int flags)
192{ 237{
200 if (backend_fd < 0) 245 if (backend_fd < 0)
201 return 0; 246 return 0;
202 247
203 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); 248 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
204 249
205 backend_fudge = 0.; /* kernel sources seem to indicate this to be zero */ 250 backend_mintime = 1./1024.; /* epoll does sometimes return early, this is just to avoid the worst */
206 backend_modify = epoll_modify; 251 backend_modify = epoll_modify;
207 backend_poll = epoll_poll; 252 backend_poll = epoll_poll;
208 253
209 epoll_eventmax = 64; /* initial number of events receivable per poll */ 254 epoll_eventmax = 64; /* initial number of events receivable per poll */
210 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); 255 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
211 256
212 return EVBACKEND_EPOLL; 257 return EVBACKEND_EPOLL;
214 259
215void inline_size 260void inline_size
216epoll_destroy (EV_P) 261epoll_destroy (EV_P)
217{ 262{
218 ev_free (epoll_events); 263 ev_free (epoll_events);
264 array_free (epoll_eperm, EMPTY);
219} 265}
220 266
221void inline_size 267void inline_size
222epoll_fork (EV_P) 268epoll_fork (EV_P)
223{ 269{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines