1 | /* |
1 | /* |
2 | * libev epoll fd activity backend |
2 | * libev epoll fd activity backend |
3 | * |
3 | * |
4 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
4 | * Copyright (c) 2007,2008 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 |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
8 | * modification, are permitted provided that the following conditions are |
8 | * tion, are permitted provided that the following conditions are met: |
9 | * met: |
|
|
10 | * |
9 | * |
11 | * * Redistributions of source code must retain the above copyright |
10 | * 1. Redistributions of source code must retain the above copyright notice, |
|
|
11 | * this list of conditions and the following disclaimer. |
|
|
12 | * |
|
|
13 | * 2. Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer. |
14 | * notice, this list of conditions and the following disclaimer in the |
|
|
15 | * documentation and/or other materials provided with the distribution. |
13 | * |
16 | * |
14 | * * Redistributions in binary form must reproduce the above |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
15 | * copyright notice, this list of conditions and the following |
18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
16 | * disclaimer in the documentation and/or other materials provided |
19 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
17 | * with the distribution. |
20 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
18 | * |
|
|
19 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
|
20 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
|
21 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
|
22 | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
|
23 | * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
|
24 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
25 | * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
22 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
26 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
23 | * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
27 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH- |
28 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
25 | * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
29 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 | * OF THE POSSIBILITY OF SUCH DAMAGE. |
|
|
27 | * |
|
|
28 | * Alternatively, the contents of this file may be used under the terms of |
|
|
29 | * the GNU General Public License ("GPL") version 2 or any later version, |
|
|
30 | * in which case the provisions of the GPL are applicable instead of |
|
|
31 | * the above. If you wish to allow the use of your version of this file |
|
|
32 | * only under the terms of the GPL and not to allow others to use your |
|
|
33 | * version of this file under the BSD license, indicate your decision |
|
|
34 | * by deleting the provisions above and replace them with the notice |
|
|
35 | * and other provisions required by the GPL. If you do not delete the |
|
|
36 | * provisions above, a recipient may use your version of this file under |
|
|
37 | * either the BSD or the GPL. |
30 | */ |
38 | */ |
31 | |
39 | |
32 | /* |
40 | /* |
33 | * general notes about epoll: |
41 | * general notes about epoll: |
34 | * |
42 | * |
… | |
… | |
42 | * limits the applicability over poll, so this is not a generic |
50 | * limits the applicability over poll, so this is not a generic |
43 | * poll replacement. |
51 | * poll replacement. |
44 | * |
52 | * |
45 | * lots of "weird code" and complication handling in this file is due |
53 | * lots of "weird code" and complication handling in this file is due |
46 | * to these design problems with epoll, as we try very hard to avoid |
54 | * to these design problems with epoll, as we try very hard to avoid |
47 | * epoll_ctl syscalls for common usage patterns. |
55 | * epoll_ctl syscalls for common usage patterns and handle the breakage |
|
|
56 | * ensuing from receiving events for closed and otherwise long gone |
|
|
57 | * file descriptors. |
48 | */ |
58 | */ |
49 | |
59 | |
50 | #include <sys/epoll.h> |
60 | #include <sys/epoll.h> |
51 | |
61 | |
52 | static void |
62 | static void |
53 | epoll_modify (EV_P_ int fd, int oev, int nev) |
63 | epoll_modify (EV_P_ int fd, int oev, int nev) |
54 | { |
64 | { |
55 | struct epoll_event ev; |
65 | struct epoll_event ev; |
|
|
66 | unsigned char oldmask; |
56 | |
67 | |
57 | /* |
68 | /* |
58 | * we handle EPOLL_CTL_DEL by ignoring it here |
69 | * we handle EPOLL_CTL_DEL by ignoring it here |
59 | * on the assumption that the fd is gone anyways |
70 | * on the assumption that the fd is gone anyways |
60 | * if that is wrong, we have to handle the spurious |
71 | * if that is wrong, we have to handle the spurious |
61 | * event in epoll_poll. |
72 | * event in epoll_poll. |
|
|
73 | * the fd is later added, we try to ADD it, and, if that |
|
|
74 | * fails, we assume it still has the same eventmask. |
62 | */ |
75 | */ |
63 | if (!nev) |
76 | if (!nev) |
64 | return; |
77 | return; |
65 | |
78 | |
66 | ev.data.u64 = fd; /* use u64 to fully initialise the struct, for nicer strace etc. */ |
79 | oldmask = anfds [fd].emask; |
|
|
80 | anfds [fd].emask = nev; |
|
|
81 | |
|
|
82 | /* store the generation counter in the upper 32 bits */ |
|
|
83 | ev.data.u64 = fd | ((uint64_t)(uint32_t)++anfds [fd].egen << 32); |
67 | ev.events = (nev & EV_READ ? EPOLLIN : 0) |
84 | ev.events = (nev & EV_READ ? EPOLLIN : 0) |
68 | | (nev & EV_WRITE ? EPOLLOUT : 0); |
85 | | (nev & EV_WRITE ? EPOLLOUT : 0); |
69 | |
86 | |
70 | if (expect_true (!epoll_ctl (backend_fd, oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev))) |
87 | if (expect_true (!epoll_ctl (backend_fd, oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev))) |
71 | return; |
88 | return; |
72 | |
89 | |
73 | if (expect_true (errno == ENOENT)) |
90 | if (expect_true (errno == ENOENT)) |
74 | { |
91 | { |
75 | /* on ENOENT the fd went away, so try to do the right thing */ |
92 | /* if ENOENT then the fd went away, so try to do the right thing */ |
76 | if (!nev) |
93 | if (!nev) |
77 | return; |
94 | goto dec_egen; |
78 | |
95 | |
79 | if (!epoll_ctl (backend_fd, EPOLL_CTL_ADD, fd, &ev)) |
96 | if (!epoll_ctl (backend_fd, EPOLL_CTL_ADD, fd, &ev)) |
80 | return; |
97 | return; |
81 | } |
98 | } |
82 | else if (expect_true (errno == EEXIST)) |
99 | else if (expect_true (errno == EEXIST)) |
83 | { |
100 | { |
84 | /* on EEXIST we ignored a previous DEL */ |
101 | /* EEXIST means we ignored a previous DEL, but the fd is still active */ |
|
|
102 | /* if the kernel mask is the same as the new mask, we assume it hasn't changed */ |
|
|
103 | if (oldmask == nev) |
|
|
104 | goto dec_egen; |
|
|
105 | |
85 | if (!epoll_ctl (backend_fd, EPOLL_CTL_MOD, fd, &ev)) |
106 | if (!epoll_ctl (backend_fd, EPOLL_CTL_MOD, fd, &ev)) |
86 | return; |
107 | return; |
87 | } |
108 | } |
88 | |
109 | |
89 | fd_kill (EV_A_ fd); |
110 | fd_kill (EV_A_ fd); |
|
|
111 | |
|
|
112 | dec_egen: |
|
|
113 | /* we didn't successfully call epoll_ctl, so decrement the generation counter again */ |
|
|
114 | --anfds [fd].egen; |
90 | } |
115 | } |
91 | |
116 | |
92 | static void |
117 | static void |
93 | epoll_poll (EV_P_ ev_tstamp timeout) |
118 | epoll_poll (EV_P_ ev_tstamp timeout) |
94 | { |
119 | { |
… | |
… | |
96 | int eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.)); |
121 | int eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.)); |
97 | |
122 | |
98 | if (expect_false (eventcnt < 0)) |
123 | if (expect_false (eventcnt < 0)) |
99 | { |
124 | { |
100 | if (errno != EINTR) |
125 | if (errno != EINTR) |
101 | syserr ("(libev) epoll_wait"); |
126 | ev_syserr ("(libev) epoll_wait"); |
102 | |
127 | |
103 | return; |
128 | return; |
104 | } |
129 | } |
105 | |
130 | |
106 | for (i = 0; i < eventcnt; ++i) |
131 | for (i = 0; i < eventcnt; ++i) |
107 | { |
132 | { |
108 | struct epoll_event *ev = epoll_events + i; |
133 | struct epoll_event *ev = epoll_events + i; |
109 | |
134 | |
110 | int fd = ev->data.u64; |
135 | int fd = (uint32_t)ev->data.u64; /* mask out the lower 32 bits */ |
|
|
136 | int want = anfds [fd].events; |
111 | int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) |
137 | int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) |
112 | | (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0); |
138 | | (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0); |
113 | int want = anfds [fd].events; |
139 | |
|
|
140 | /* check for spurious notification */ |
|
|
141 | if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32))) |
|
|
142 | { |
|
|
143 | /* recreate kernel state */ |
|
|
144 | postfork = 1; |
|
|
145 | continue; |
|
|
146 | } |
114 | |
147 | |
115 | if (expect_false (got & ~want)) |
148 | if (expect_false (got & ~want)) |
116 | { |
149 | { |
|
|
150 | anfds [fd].emask = want; |
|
|
151 | |
117 | /* we received an event but are not interested in it, try mod or del */ |
152 | /* we received an event but are not interested in it, try mod or del */ |
|
|
153 | /* I don't think we ever need MOD, but let's handle it anyways */ |
118 | ev->events = (want & EV_READ ? EPOLLIN : 0) |
154 | ev->events = (want & EV_READ ? EPOLLIN : 0) |
119 | | (want & EV_WRITE ? EPOLLOUT : 0); |
155 | | (want & EV_WRITE ? EPOLLOUT : 0); |
120 | |
156 | |
121 | epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev); |
157 | if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev)) |
|
|
158 | { |
|
|
159 | postfork = 1; /* an error occured, recreate kernel state */ |
|
|
160 | continue; |
|
|
161 | } |
122 | } |
162 | } |
123 | |
163 | |
124 | fd_event (EV_A_ fd, got); |
164 | fd_event (EV_A_ fd, got); |
125 | } |
165 | } |
126 | |
166 | |
… | |
… | |
145 | |
185 | |
146 | backend_fudge = 0.; /* kernel sources seem to indicate this to be zero */ |
186 | backend_fudge = 0.; /* kernel sources seem to indicate this to be zero */ |
147 | backend_modify = epoll_modify; |
187 | backend_modify = epoll_modify; |
148 | backend_poll = epoll_poll; |
188 | backend_poll = epoll_poll; |
149 | |
189 | |
150 | epoll_eventmax = 64; /* intiial number of events receivable per poll */ |
190 | epoll_eventmax = 64; /* initial number of events receivable per poll */ |
151 | epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); |
191 | epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); |
152 | |
192 | |
153 | return EVBACKEND_EPOLL; |
193 | return EVBACKEND_EPOLL; |
154 | } |
194 | } |
155 | |
195 | |
… | |
… | |
163 | epoll_fork (EV_P) |
203 | epoll_fork (EV_P) |
164 | { |
204 | { |
165 | close (backend_fd); |
205 | close (backend_fd); |
166 | |
206 | |
167 | while ((backend_fd = epoll_create (256)) < 0) |
207 | while ((backend_fd = epoll_create (256)) < 0) |
168 | syserr ("(libev) epoll_create"); |
208 | ev_syserr ("(libev) epoll_create"); |
169 | |
209 | |
170 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
210 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
171 | |
211 | |
172 | fd_rearm_all (EV_A); |
212 | fd_rearm_all (EV_A); |
173 | } |
213 | } |