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.36 by root, Mon Oct 27 11:08:29 2008 UTC vs.
Revision 1.54 by sf-exg, Fri Oct 22 10:50:24 2010 UTC

1/* 1/*
2 * libev epoll fd activity backend 2 * libev epoll fd activity backend
3 * 3 *
4 * Copyright (c) 2007,2008 Marc Alexander Lehmann <libev@schmorp.de> 4 * Copyright (c) 2007,2008,2009,2010 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 *
47 * b) the fact that ADD != MOD creates a lot of extra syscalls due to a) 47 * b) the fact that ADD != MOD creates a lot of extra syscalls due to a)
48 * and seems not to have any advantage. 48 * and seems not to have any advantage.
49 * c) the inability to handle fork or file descriptors (think dup) 49 * c) the inability to handle fork or file descriptors (think dup)
50 * limits the applicability over poll, so this is not a generic 50 * limits the applicability over poll, so this is not a generic
51 * poll replacement. 51 * poll replacement.
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
54 * seems to share this (rather non-unixy) limitation.
55 * e) epoll claims to be embeddable, but in practise you never get
56 * a ready event for the epoll fd.
52 * 57 *
53 * lots of "weird code" and complication handling in this file is due 58 * 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 59 * to these design problems with epoll, as we try very hard to avoid
55 * epoll_ctl syscalls for common usage patterns. 60 * epoll_ctl syscalls for common usage patterns and handle the breakage
61 * ensuing from receiving events for closed and otherwise long gone
62 * file descriptors.
56 */ 63 */
57 64
58#include <sys/epoll.h> 65#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}
67 66
68static void 67static void
69epoll_modify (EV_P_ int fd, int oev, int nev) 68epoll_modify (EV_P_ int fd, int oev, int nev)
70{ 69{
71 struct epoll_event ev; 70 struct epoll_event ev;
74 /* 73 /*
75 * we handle EPOLL_CTL_DEL by ignoring it here 74 * we handle EPOLL_CTL_DEL by ignoring it here
76 * on the assumption that the fd is gone anyways 75 * on the assumption that the fd is gone anyways
77 * if that is wrong, we have to handle the spurious 76 * if that is wrong, we have to handle the spurious
78 * event in epoll_poll. 77 * event in epoll_poll.
79 * the fd is later added, we try to ADD it, and, if that 78 * if the fd is added again, we try to ADD it, and, if that
80 * fails, we assume it still has the same eventmask. 79 * fails, we assume it still has the same eventmask.
81 */ 80 */
82 if (!nev) 81 if (!nev)
83 return; 82 return;
84 83
85 oldmask = anfds [fd].emask; 84 oldmask = anfds [fd].emask;
86 anfds [fd].emask = nev; 85 anfds [fd].emask = nev;
87 86
88 /* store the generation counter in the upper 32 bits */ 87 /* store the generation counter in the upper 32 bits, the fd in the lower 32 bits */
89 ev.data.u64 = fd | ((uint64_t)++anfds [fd].egen << 32); 88 ev.data.u64 = (uint64_t)(uint32_t)fd
89 | ((uint64_t)(uint32_t)++anfds [fd].egen << 32);
90 ev.events = (nev & EV_READ ? EPOLLIN : 0) 90 ev.events = (nev & EV_READ ? EPOLLIN : 0)
91 | (nev & EV_WRITE ? EPOLLOUT : 0); 91 | (nev & EV_WRITE ? EPOLLOUT : 0);
92 92
93 if (expect_true (!epoll_ctl (backend_fd, oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev))) 93 if (expect_true (!epoll_ctl (backend_fd, oev && oldmask != nev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev)))
94 return; 94 return;
95 95
96 if (expect_true (errno == ENOENT)) 96 if (expect_true (errno == ENOENT))
97 { 97 {
98 /* if ENOENT then the fd went away, so try to do the right thing */ 98 /* if ENOENT then the fd went away, so try to do the right thing */
122 122
123static void 123static void
124epoll_poll (EV_P_ ev_tstamp timeout) 124epoll_poll (EV_P_ ev_tstamp timeout)
125{ 125{
126 int i; 126 int i;
127 int eventcnt;
128
129 /* epoll wait times cannot be larger than (LONG_MAX - 999UL) / HZ msecs, which is below */
130 /* the default libev max wait time, however. */
131 EV_RELEASE_CB;
127 int eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.)); 132 eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.));
133 EV_ACQUIRE_CB;
128 134
129 if (expect_false (eventcnt < 0)) 135 if (expect_false (eventcnt < 0))
130 { 136 {
131 if (errno != EINTR) 137 if (errno != EINTR)
132 syserr ("(libev) epoll_wait"); 138 ev_syserr ("(libev) epoll_wait");
133 139
134 return; 140 return;
135 } 141 }
136 142
137 for (i = 0; i < eventcnt; ++i) 143 for (i = 0; i < eventcnt; ++i)
138 { 144 {
139 struct epoll_event *ev = epoll_events + i; 145 struct epoll_event *ev = epoll_events + i;
140 146
141 int fd = (uint32_t)ev->data.u64; /* mask out the lower 32 bits */ 147 int fd = (uint32_t)ev->data.u64; /* mask out the lower 32 bits */
148 int want = anfds [fd].events;
142 int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) 149 int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0)
143 | (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0); 150 | (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0);
144 int want = anfds [fd].events;
145 151
146 if (anfds [fd].egen != (unsigned char)(ev->data.u64 >> 32)) 152 /* check for spurious notification */
147 /*fprintf (stderr, "spurious notification fd %d, %d vs %d\n", fd, (int)(ev->data.u64 >> 32), anfds [fd].egen);*/ 153 /* 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)))
155 {
156 /* recreate kernel state */
157 postfork = 1;
148 continue; 158 continue;
159 }
149 160
150 if (expect_false (got & ~want)) 161 if (expect_false (got & ~want))
151 { 162 {
152 anfds [fd].emask = want; 163 anfds [fd].emask = want;
153 164
154 /* we received an event but are not interested in it, try mod or del */ 165 /* we received an event but are not interested in it, try mod or del */
155 /* I don't think we ever need MOD, but let's handle it anyways */ 166 /* I don't think we ever need MOD, but let's handle it anyways */
156 ev->events = (want & EV_READ ? EPOLLIN : 0) 167 ev->events = (want & EV_READ ? EPOLLIN : 0)
157 | (want & EV_WRITE ? EPOLLOUT : 0); 168 | (want & EV_WRITE ? EPOLLOUT : 0);
158 169
170 /* pre-2.6.9 kernels require a non-null pointer with EPOLL_CTL_DEL, */
171 /* which is fortunately easy to do for us. */
159 epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev); 172 if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev))
173 {
174 postfork = 1; /* an error occurred, recreate kernel state */
175 continue;
176 }
160 } 177 }
161 178
162 fd_event (EV_A_ fd, got); 179 fd_event (EV_A_ fd, got);
163 } 180 }
164 181
172} 189}
173 190
174int inline_size 191int inline_size
175epoll_init (EV_P_ int flags) 192epoll_init (EV_P_ int flags)
176{ 193{
194#ifdef EPOLL_CLOEXEC
195 backend_fd = epoll_create1 (EPOLL_CLOEXEC);
196
197 if (backend_fd <= 0)
198#endif
177 backend_fd = epoll_create (256); 199 backend_fd = epoll_create (256);
178 200
179 if (backend_fd < 0) 201 if (backend_fd < 0)
180 return 0; 202 return 0;
181 203
182 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); 204 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
183 205
184 backend_fudge = 0.; /* kernel sources seem to indicate this to be zero */ 206 backend_fudge = 0.; /* kernel sources seem to indicate this to be zero */
185 backend_modify = epoll_modify; 207 backend_modify = epoll_modify;
186 backend_poll = epoll_poll; 208 backend_poll = epoll_poll;
187 209
188 epoll_eventmax = 64; /* intiial number of events receivable per poll */ 210 epoll_eventmax = 64; /* initial number of events receivable per poll */
189 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); 211 epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
190 212
191 return EVBACKEND_EPOLL; 213 return EVBACKEND_EPOLL;
192} 214}
193 215
201epoll_fork (EV_P) 223epoll_fork (EV_P)
202{ 224{
203 close (backend_fd); 225 close (backend_fd);
204 226
205 while ((backend_fd = epoll_create (256)) < 0) 227 while ((backend_fd = epoll_create (256)) < 0)
206 syserr ("(libev) epoll_create"); 228 ev_syserr ("(libev) epoll_create");
207 229
208 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); 230 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
209 231
210 fd_rearm_all (EV_A); 232 fd_rearm_all (EV_A);
211} 233}

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines