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.53 by root, Fri Oct 22 10:25:03 2010 UTC vs.
Revision 1.76 by root, Wed Jun 26 00:01:46 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;
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, 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 (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, timeout * 1e3);
133 EV_ACQUIRE_CB; 156 EV_ACQUIRE_CB;
134 157
135 if (expect_false (eventcnt < 0)) 158 if (expect_false (eventcnt < 0))
136 { 159 {
137 if (errno != EINTR) 160 if (errno != EINTR)
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
153 /* we assume that fd is always in range, as we never shrink the anfds arraay */ 179 * we assume that fd is always in range, as we never shrink the anfds array
180 */
154 if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32))) 181 if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32)))
155 { 182 {
156 /* recreate kernel state */ 183 /* recreate kernel state */
157 postfork = 1; 184 postfork |= 2;
158 continue; 185 continue;
159 } 186 }
160 187
161 if (expect_false (got & ~want)) 188 if (expect_false (got & ~want))
162 { 189 {
163 anfds [fd].emask = want; 190 anfds [fd].emask = want;
164 191
192 /*
165 /* 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
166 /* 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 */
167 ev->events = (want & EV_READ ? EPOLLIN : 0) 201 ev->events = (want & EV_READ ? EPOLLIN : 0)
168 | (want & EV_WRITE ? EPOLLOUT : 0); 202 | (want & EV_WRITE ? EPOLLOUT : 0);
169 203
170 /* pre-2.6.9 kernels require a non-null pointer with EPOLL_CTL_DEL, */ 204 /* pre-2.6.9 kernels require a non-null pointer with EPOLL_CTL_DEL, */
171 /* which is fortunately easy to do for us. */ 205 /* which is fortunately easy to do for us. */
172 if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev)) 206 if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev))
173 { 207 {
174 postfork = 1; /* an error occurred, recreate kernel state */ 208 postfork |= 2; /* an error occurred, recreate kernel state */
175 continue; 209 continue;
176 } 210 }
177 } 211 }
178 212
179 fd_event (EV_A_ fd, got); 213 fd_event (EV_A_ fd, got);
184 { 218 {
185 ev_free (epoll_events); 219 ev_free (epoll_events);
186 epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1); 220 epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1);
187 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); 221 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
188 } 222 }
189}
190 223
224 /* now synthesize events for all fds where epoll fails, while select works... */
225 for (i = epoll_epermcnt; i--; )
226 {
227 int fd = epoll_eperms [i];
228 unsigned char events = anfds [fd].events & (EV_READ | EV_WRITE);
229
230 if (anfds [fd].emask & EV_EMASK_EPERM && events)
231 fd_event (EV_A_ fd, events);
232 else
233 {
234 epoll_eperms [i] = epoll_eperms [--epoll_epermcnt];
235 anfds [fd].emask = 0;
236 }
237 }
238}
239
240static int
241epoll_epoll_create (void)
242{
243 int fd;
244
245#if defined EPOLL_CLOEXEC && !defined __ANDROID__
246 fd = epoll_create1 (EPOLL_CLOEXEC);
247
248 if (fd < 0 && (errno == EINVAL || errno == ENOSYS))
249#endif
250 {
251 fd = epoll_create (256);
252
253 if (fd >= 0)
254 fcntl (fd, F_SETFD, FD_CLOEXEC);
255 }
256
257 return fd;
258}
259
191int inline_size 260inline_size
261int
192epoll_init (EV_P_ int flags) 262epoll_init (EV_P_ int flags)
193{ 263{
194#ifdef EPOLL_CLOEXEC 264 if ((backend_fd = epoll_epoll_create ()) < 0)
195 backend_fd = epoll_create1 (EPOLL_CLOEXEC);
196
197 if (backend_fd <= 0)
198#endif
199 backend_fd = epoll_create (256);
200
201 if (backend_fd < 0)
202 return 0; 265 return 0;
203 266
204 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); 267 backend_mintime = 1e-3; /* epoll does sometimes return early, this is just to avoid the worst */
205
206 backend_fudge = 0.; /* kernel sources seem to indicate this to be zero */
207 backend_modify = epoll_modify; 268 backend_modify = epoll_modify;
208 backend_poll = epoll_poll; 269 backend_poll = epoll_poll;
209 270
210 epoll_eventmax = 64; /* initial number of events receivable per poll */ 271 epoll_eventmax = 64; /* initial number of events receivable per poll */
211 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); 272 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
212 273
213 return EVBACKEND_EPOLL; 274 return EVBACKEND_EPOLL;
214} 275}
215 276
216void inline_size 277inline_size
278void
217epoll_destroy (EV_P) 279epoll_destroy (EV_P)
218{ 280{
219 ev_free (epoll_events); 281 ev_free (epoll_events);
282 array_free (epoll_eperm, EMPTY);
220} 283}
221 284
222void inline_size 285inline_size
286void
223epoll_fork (EV_P) 287epoll_fork (EV_P)
224{ 288{
225 close (backend_fd); 289 close (backend_fd);
226 290
227 while ((backend_fd = epoll_create (256)) < 0) 291 while ((backend_fd = epoll_epoll_create ()) < 0)
228 ev_syserr ("(libev) epoll_create"); 292 ev_syserr ("(libev) epoll_create");
229 293
230 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
231
232 fd_rearm_all (EV_A); 294 fd_rearm_all (EV_A);
233} 295}
234 296

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines