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 | * |
… | |
… | |
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 | |
67 | static void |
70 | static void |
68 | epoll_modify (EV_P_ int fd, int oev, int nev) |
71 | epoll_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 ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev))) |
96 | if (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 (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 */ |
… | |
… | |
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; |
|
|
117 | } |
|
|
118 | else if (expect_true (errno == EPERM)) |
|
|
119 | { |
|
|
120 | anfds [fd].emask = EV_EMASK_EPERM; |
|
|
121 | |
|
|
122 | /* add fd to epoll_eperms, if not already inside */ |
|
|
123 | if (!(oldmask & EV_EMASK_EPERM)) |
|
|
124 | { |
|
|
125 | array_needsize (int, epoll_eperms, epoll_epermmax, epoll_epermcnt + 1, EMPTY2); |
|
|
126 | epoll_eperms [epoll_epermcnt++] = fd; |
|
|
127 | } |
|
|
128 | |
|
|
129 | return; |
114 | } |
130 | } |
115 | |
131 | |
116 | fd_kill (EV_A_ fd); |
132 | fd_kill (EV_A_ fd); |
117 | |
133 | |
118 | dec_egen: |
134 | dec_egen: |
… | |
… | |
148 | int want = anfds [fd].events; |
164 | int want = anfds [fd].events; |
149 | int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) |
165 | int got = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) |
150 | | (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0); |
166 | | (ev->events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0); |
151 | |
167 | |
152 | /* check for spurious notification */ |
168 | /* check for spurious notification */ |
|
|
169 | /* we assume that fd is always in range, as we never shrink the anfds array */ |
153 | if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32))) |
170 | if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32))) |
154 | { |
171 | { |
155 | /* recreate kernel state */ |
172 | /* recreate kernel state */ |
156 | postfork = 1; |
173 | postfork = 1; |
157 | continue; |
174 | continue; |
… | |
… | |
168 | |
185 | |
169 | /* pre-2.6.9 kernels require a non-null pointer with EPOLL_CTL_DEL, */ |
186 | /* pre-2.6.9 kernels require a non-null pointer with EPOLL_CTL_DEL, */ |
170 | /* which is fortunately easy to do for us. */ |
187 | /* which is fortunately easy to do for us. */ |
171 | if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev)) |
188 | if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev)) |
172 | { |
189 | { |
173 | postfork = 1; /* an error occured, recreate kernel state */ |
190 | postfork = 1; /* an error occurred, recreate kernel state */ |
174 | continue; |
191 | continue; |
175 | } |
192 | } |
176 | } |
193 | } |
177 | |
194 | |
178 | fd_event (EV_A_ fd, got); |
195 | fd_event (EV_A_ fd, got); |
… | |
… | |
183 | { |
200 | { |
184 | ev_free (epoll_events); |
201 | ev_free (epoll_events); |
185 | epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1); |
202 | 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); |
203 | epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax); |
187 | } |
204 | } |
|
|
205 | |
|
|
206 | /* now add events for all fds where epoll fails, while select works... */ |
|
|
207 | for (i = epoll_epermcnt; i--; ) |
|
|
208 | { |
|
|
209 | int fd = epoll_eperms [i]; |
|
|
210 | unsigned char events = anfds [fd].events & (EV_READ | EV_WRITE); |
|
|
211 | |
|
|
212 | if (anfds [fd].emask & EV_EMASK_EPERM && events) |
|
|
213 | fd_event (EV_A_ fd, events); |
|
|
214 | else |
|
|
215 | epoll_eperms [i] = epoll_eperms [--epoll_epermcnt]; |
|
|
216 | } |
188 | } |
217 | } |
189 | |
218 | |
190 | int inline_size |
219 | int inline_size |
191 | epoll_init (EV_P_ int flags) |
220 | epoll_init (EV_P_ int flags) |
192 | { |
221 | { |
… | |
… | |
214 | |
243 | |
215 | void inline_size |
244 | void inline_size |
216 | epoll_destroy (EV_P) |
245 | epoll_destroy (EV_P) |
217 | { |
246 | { |
218 | ev_free (epoll_events); |
247 | ev_free (epoll_events); |
|
|
248 | array_free (epoll_eperm, EMPTY); |
219 | } |
249 | } |
220 | |
250 | |
221 | void inline_size |
251 | void inline_size |
222 | epoll_fork (EV_P) |
252 | epoll_fork (EV_P) |
223 | { |
253 | { |