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.62 by root, Sat Jun 4 05:25:03 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;
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)
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
152 /* check for spurious notification */ 173 /* check for spurious notification */
153 /* we assume that fd is always in range, as we never shrink the anfds arraay */ 174 /* we assume that fd is always in range, as we never shrink the anfds array */
154 if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32))) 175 if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32)))
155 { 176 {
156 /* recreate kernel state */ 177 /* recreate kernel state */
157 postfork = 1; 178 postfork = 1;
158 continue; 179 continue;
184 { 205 {
185 ev_free (epoll_events); 206 ev_free (epoll_events);
186 epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1); 207 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); 208 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
188 } 209 }
210
211 /* now synthesize events for all fds where epoll fails, while select works... */
212 for (i = epoll_epermcnt; i--; )
213 {
214 int fd = epoll_eperms [i];
215 unsigned char events = anfds [fd].events & (EV_READ | EV_WRITE);
216
217 if (anfds [fd].emask & EV_EMASK_EPERM && events)
218 fd_event (EV_A_ fd, events);
219 else
220 epoll_eperms [i] = epoll_eperms [--epoll_epermcnt];
221 }
189} 222}
190 223
191int inline_size 224int inline_size
192epoll_init (EV_P_ int flags) 225epoll_init (EV_P_ int flags)
193{ 226{
201 if (backend_fd < 0) 234 if (backend_fd < 0)
202 return 0; 235 return 0;
203 236
204 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); 237 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
205 238
206 backend_fudge = 0.; /* kernel sources seem to indicate this to be zero */ 239 backend_fudge = 1./1024.; /* epoll does sometimes return early, this is just to avoid the worst */
207 backend_modify = epoll_modify; 240 backend_modify = epoll_modify;
208 backend_poll = epoll_poll; 241 backend_poll = epoll_poll;
209 242
210 epoll_eventmax = 64; /* initial number of events receivable per poll */ 243 epoll_eventmax = 64; /* initial number of events receivable per poll */
211 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); 244 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
215 248
216void inline_size 249void inline_size
217epoll_destroy (EV_P) 250epoll_destroy (EV_P)
218{ 251{
219 ev_free (epoll_events); 252 ev_free (epoll_events);
253 array_free (epoll_eperm, EMPTY);
220} 254}
221 255
222void inline_size 256void inline_size
223epoll_fork (EV_P) 257epoll_fork (EV_P)
224{ 258{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines