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.52 by sf-exg, Sat Jul 31 23:00:11 2010 UTC vs.
Revision 1.80 by root, Thu Jul 11 05:41:39 2019 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,2016,2017,2019 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 && oldmask != nev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev))) 96 if (ecb_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 (ecb_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 */
99 if (!nev) 102 if (!nev)
100 goto dec_egen; 103 goto dec_egen;
101 104
102 if (!epoll_ctl (backend_fd, EPOLL_CTL_ADD, fd, &ev)) 105 if (!epoll_ctl (backend_fd, EPOLL_CTL_ADD, fd, &ev))
103 return; 106 return;
104 } 107 }
105 else if (expect_true (errno == EEXIST)) 108 else if (ecb_expect_true (errno == EEXIST))
106 { 109 {
107 /* EEXIST means we ignored a previous DEL, but the fd is still active */ 110 /* EEXIST means we ignored a previous DEL, but the fd is still active */
108 /* if the kernel mask is the same as the new mask, we assume it hasn't changed */ 111 /* if the kernel mask is the same as the new mask, we assume it hasn't changed */
109 if (oldmask == nev) 112 if (oldmask == nev)
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 (ecb_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, array_needsize_noinit);
128 epoll_eperms [epoll_epermcnt++] = fd;
129 }
130
131 return;
132 }
133 else
134 assert (("libev: I/O watcher with invalid fd found in epoll_ctl", errno != EBADF && errno != ELOOP && errno != EINVAL));
115 135
116 fd_kill (EV_A_ fd); 136 fd_kill (EV_A_ fd);
117 137
118dec_egen: 138dec_egen:
119 /* we didn't successfully call epoll_ctl, so decrement the generation counter again */ 139 /* we didn't successfully call epoll_ctl, so decrement the generation counter again */
123static void 143static void
124epoll_poll (EV_P_ ev_tstamp timeout) 144epoll_poll (EV_P_ ev_tstamp timeout)
125{ 145{
126 int i; 146 int i;
127 int eventcnt; 147 int eventcnt;
128 148
149 if (ecb_expect_false (epoll_epermcnt))
150 timeout = 0.;
151
129 /* epoll wait times cannot be larger than (LONG_MAX - 999UL) / HZ msecs, which is below */ 152 /* epoll wait times cannot be larger than (LONG_MAX - 999UL) / HZ msecs, which is below */
130 /* the default libev max wait time, however. */ 153 /* the default libev max wait time, however. */
131 EV_RELEASE_CB; 154 EV_RELEASE_CB;
132 eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.)); 155 eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, EV_TS_TO_MS (timeout));
133 EV_ACQUIRE_CB; 156 EV_ACQUIRE_CB;
134 157
135 if (expect_false (eventcnt < 0)) 158 if (ecb_expect_false (eventcnt < 0))
136 { 159 {
137 if (errno != EINTR) 160 if (errno != EINTR)
138 ev_syserr ("(libev) epoll_wait"); 161 ev_syserr ("(libev) epoll_wait");
139 162
140 return; 163 return;
147 int fd = (uint32_t)ev->data.u64; /* mask out the lower 32 bits */ 170 int fd = (uint32_t)ev->data.u64; /* mask out the lower 32 bits */
148 int want = anfds [fd].events; 171 int want = anfds [fd].events;
149 int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) 172 int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0)
150 | (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0); 173 | (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0);
151 174
175 /*
152 /* check for spurious notification */ 176 * check for spurious notification.
177 * this only finds spurious notifications on egen updates
178 * other spurious notifications will be found by epoll_ctl, below
179 * we assume that fd is always in range, as we never shrink the anfds array
180 */
153 if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32))) 181 if (ecb_expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32)))
154 { 182 {
155 /* recreate kernel state */ 183 /* recreate kernel state */
156 postfork = 1; 184 postfork |= 2;
157 continue; 185 continue;
158 } 186 }
159 187
160 if (expect_false (got & ~want)) 188 if (ecb_expect_false (got & ~want))
161 { 189 {
162 anfds [fd].emask = want; 190 anfds [fd].emask = want;
163 191
192 /*
164 /* we received an event but are not interested in it, try mod or del */ 193 * 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 */ 194 * this often happens because we optimistically do not unregister fds
195 * when we are no longer interested in them, but also when we get spurious
196 * notifications for fds from another process. this is partially handled
197 * above with the gencounter check (== our fd is not the event fd), and
198 * partially here, when epoll_ctl returns an error (== a child has the fd
199 * but we closed it).
200 * note: for events such as POLLHUP, where we can't know whether it refers
201 * to EV_READ or EV_WRITE, we might issue redundant EPOLL_CTL_MOD calls.
202 */
166 ev->events = (want & EV_READ ? EPOLLIN : 0) 203 ev->events = (want & EV_READ ? EPOLLIN : 0)
167 | (want & EV_WRITE ? EPOLLOUT : 0); 204 | (want & EV_WRITE ? EPOLLOUT : 0);
168 205
169 /* pre-2.6.9 kernels require a non-null pointer with EPOLL_CTL_DEL, */ 206 /* pre-2.6.9 kernels require a non-null pointer with EPOLL_CTL_DEL, */
170 /* which is fortunately easy to do for us. */ 207 /* which is fortunately easy to do for us. */
171 if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev)) 208 if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev))
172 { 209 {
173 postfork = 1; /* an error occurred, recreate kernel state */ 210 postfork |= 2; /* an error occurred, recreate kernel state */
174 continue; 211 continue;
175 } 212 }
176 } 213 }
177 214
178 fd_event (EV_A_ fd, got); 215 fd_event (EV_A_ fd, got);
179 } 216 }
180 217
181 /* if the receive array was full, increase its size */ 218 /* if the receive array was full, increase its size */
182 if (expect_false (eventcnt == epoll_eventmax)) 219 if (ecb_expect_false (eventcnt == epoll_eventmax))
183 { 220 {
184 ev_free (epoll_events); 221 ev_free (epoll_events);
185 epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1); 222 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); 223 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
187 } 224 }
188}
189 225
226 /* now synthesize events for all fds where epoll fails, while select works... */
227 for (i = epoll_epermcnt; i--; )
228 {
229 int fd = epoll_eperms [i];
230 unsigned char events = anfds [fd].events & (EV_READ | EV_WRITE);
231
232 if (anfds [fd].emask & EV_EMASK_EPERM && events)
233 fd_event (EV_A_ fd, events);
234 else
235 {
236 epoll_eperms [i] = epoll_eperms [--epoll_epermcnt];
237 anfds [fd].emask = 0;
238 }
239 }
240}
241
242static int
243epoll_epoll_create (void)
244{
245 int fd;
246
247#if defined EPOLL_CLOEXEC && !defined __ANDROID__
248 fd = epoll_create1 (EPOLL_CLOEXEC);
249
250 if (fd < 0 && (errno == EINVAL || errno == ENOSYS))
251#endif
252 {
253 fd = epoll_create (256);
254
255 if (fd >= 0)
256 fcntl (fd, F_SETFD, FD_CLOEXEC);
257 }
258
259 return fd;
260}
261
190int inline_size 262inline_size
263int
191epoll_init (EV_P_ int flags) 264epoll_init (EV_P_ int flags)
192{ 265{
193#ifdef EPOLL_CLOEXEC 266 if ((backend_fd = epoll_epoll_create ()) < 0)
194 backend_fd = epoll_create1 (EPOLL_CLOEXEC);
195
196 if (backend_fd <= 0)
197#endif
198 backend_fd = epoll_create (256);
199
200 if (backend_fd < 0)
201 return 0; 267 return 0;
202 268
203 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); 269 backend_mintime = 1e-3; /* epoll does sometimes return early, this is just to avoid the worst */
204
205 backend_fudge = 0.; /* kernel sources seem to indicate this to be zero */
206 backend_modify = epoll_modify; 270 backend_modify = epoll_modify;
207 backend_poll = epoll_poll; 271 backend_poll = epoll_poll;
208 272
209 epoll_eventmax = 64; /* initial number of events receivable per poll */ 273 epoll_eventmax = 64; /* initial number of events receivable per poll */
210 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); 274 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
211 275
212 return EVBACKEND_EPOLL; 276 return EVBACKEND_EPOLL;
213} 277}
214 278
215void inline_size 279inline_size
280void
216epoll_destroy (EV_P) 281epoll_destroy (EV_P)
217{ 282{
218 ev_free (epoll_events); 283 ev_free (epoll_events);
284 array_free (epoll_eperm, EMPTY);
219} 285}
220 286
221void inline_size 287ecb_cold
288static void
222epoll_fork (EV_P) 289epoll_fork (EV_P)
223{ 290{
224 close (backend_fd); 291 close (backend_fd);
225 292
226 while ((backend_fd = epoll_create (256)) < 0) 293 while ((backend_fd = epoll_epoll_create ()) < 0)
227 ev_syserr ("(libev) epoll_create"); 294 ev_syserr ("(libev) epoll_create");
228 295
229 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
230
231 fd_rearm_all (EV_A); 296 fd_rearm_all (EV_A);
232} 297}
233 298

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines