1 | /* |
1 | /* |
2 | * libev kqueue backend |
2 | * libev kqueue backend |
3 | * |
3 | * |
4 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
4 | * Copyright (c) 2007,2008,2009,2010,2011,2012,2013,2016,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 |
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 | #include <sys/types.h> |
40 | #include <sys/types.h> |
33 | #include <sys/time.h> |
41 | #include <sys/time.h> |
34 | #include <sys/queue.h> |
|
|
35 | #include <sys/event.h> |
42 | #include <sys/event.h> |
36 | #include <string.h> |
43 | #include <string.h> |
37 | #include <errno.h> |
44 | #include <errno.h> |
38 | |
45 | |
39 | void inline_speed |
46 | inline_speed |
|
|
47 | void |
40 | kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) |
48 | kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) |
41 | { |
49 | { |
42 | struct kevent *ke; |
|
|
43 | |
|
|
44 | ++kqueue_changecnt; |
50 | ++kqueue_changecnt; |
45 | array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); |
51 | array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, array_needsize_noinit); |
46 | |
52 | |
47 | EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0); |
53 | EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0); |
48 | } |
54 | } |
49 | |
55 | |
|
|
56 | /* OS X at least needs this */ |
|
|
57 | #ifndef EV_ENABLE |
|
|
58 | # define EV_ENABLE 0 |
|
|
59 | #endif |
50 | #ifndef NOTE_EOF |
60 | #ifndef NOTE_EOF |
51 | # define NOTE_EOF 0 |
61 | # define NOTE_EOF 0 |
52 | #endif |
62 | #endif |
53 | |
63 | |
54 | static void |
64 | static void |
… | |
… | |
65 | |
75 | |
66 | /* to detect close/reopen reliably, we have to re-add */ |
76 | /* to detect close/reopen reliably, we have to re-add */ |
67 | /* event requests even when oev == nev */ |
77 | /* event requests even when oev == nev */ |
68 | |
78 | |
69 | if (nev & EV_READ) |
79 | if (nev & EV_READ) |
70 | kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF); |
80 | kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD | EV_ENABLE, NOTE_EOF); |
71 | |
81 | |
72 | if (nev & EV_WRITE) |
82 | if (nev & EV_WRITE) |
73 | kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); |
83 | kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD | EV_ENABLE, NOTE_EOF); |
74 | } |
84 | } |
75 | |
85 | |
76 | static void |
86 | static void |
77 | kqueue_poll (EV_P_ ev_tstamp timeout) |
87 | kqueue_poll (EV_P_ ev_tstamp timeout) |
78 | { |
88 | { |
… | |
… | |
85 | ev_free (kqueue_events); |
95 | ev_free (kqueue_events); |
86 | kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt); |
96 | kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt); |
87 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
97 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
88 | } |
98 | } |
89 | |
99 | |
90 | ts.tv_sec = (time_t)timeout; |
100 | EV_RELEASE_CB; |
91 | ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9); |
101 | EV_TS_SET (ts, timeout); |
92 | res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts); |
102 | res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts); |
|
|
103 | EV_ACQUIRE_CB; |
93 | kqueue_changecnt = 0; |
104 | kqueue_changecnt = 0; |
94 | |
105 | |
95 | if (expect_false (res < 0)) |
106 | if (expect_false (res < 0)) |
96 | { |
107 | { |
97 | if (errno != EINTR) |
108 | if (errno != EINTR) |
98 | syserr ("(libev) kevent"); |
109 | ev_syserr ("(libev) kevent"); |
99 | |
110 | |
100 | return; |
111 | return; |
101 | } |
112 | } |
102 | |
113 | |
103 | for (i = 0; i < res; ++i) |
114 | for (i = 0; i < res; ++i) |
104 | { |
115 | { |
105 | int fd = kqueue_events [i].ident; |
116 | int fd = kqueue_events [i].ident; |
106 | |
117 | |
107 | if (expect_false (kqueue_events [i].flags & EV_ERROR)) |
118 | if (expect_false (kqueue_events [i].flags & EV_ERROR)) |
108 | { |
119 | { |
109 | int err = kqueue_events [i].data; |
120 | int err = kqueue_events [i].data; |
110 | |
121 | |
111 | /* we are only interested in errors for fds that we are interested in :) */ |
122 | /* we are only interested in errors for fds that we are interested in :) */ |
112 | if (anfds [fd].events) |
123 | if (anfds [fd].events) |
113 | { |
124 | { |
114 | if (err == ENOENT) /* resubmit changes on ENOENT */ |
125 | if (err == ENOENT) /* resubmit changes on ENOENT */ |
115 | kqueue_modify (EV_A_ fd, 0, anfds [fd].events); |
126 | kqueue_modify (EV_A_ fd, 0, anfds [fd].events); |
116 | else if (err == EBADF) /* on EBADF, we re-check the fd */ |
127 | else if (err == EBADF) /* on EBADF, we re-check the fd */ |
117 | { |
128 | { |
118 | if (fd_valid (fd)) |
129 | if (fd_valid (fd)) |
… | |
… | |
120 | else |
131 | else |
121 | fd_kill (EV_A_ fd); |
132 | fd_kill (EV_A_ fd); |
122 | } |
133 | } |
123 | else /* on all other errors, we error out on the fd */ |
134 | else /* on all other errors, we error out on the fd */ |
124 | fd_kill (EV_A_ fd); |
135 | fd_kill (EV_A_ fd); |
125 | } |
136 | } |
126 | } |
137 | } |
127 | else |
138 | else |
128 | fd_event ( |
139 | fd_event ( |
129 | EV_A_ |
140 | EV_A_ |
130 | fd, |
141 | fd, |
… | |
… | |
140 | kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1); |
151 | kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1); |
141 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
152 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
142 | } |
153 | } |
143 | } |
154 | } |
144 | |
155 | |
145 | int inline_size |
156 | inline_size |
|
|
157 | int |
146 | kqueue_init (EV_P_ int flags) |
158 | kqueue_init (EV_P_ int flags) |
147 | { |
159 | { |
148 | struct kevent ch, ev; |
|
|
149 | |
|
|
150 | /* Initalize the kernel queue */ |
160 | /* initialize the kernel queue */ |
|
|
161 | kqueue_fd_pid = getpid (); |
151 | if ((backend_fd = kqueue ()) < 0) |
162 | if ((backend_fd = kqueue ()) < 0) |
152 | return 0; |
163 | return 0; |
153 | |
164 | |
154 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ |
165 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ |
155 | |
166 | |
156 | backend_fudge = 0.; |
167 | backend_mintime = 1e-9; /* apparently, they did the right thing in freebsd */ |
157 | backend_modify = kqueue_modify; |
168 | backend_modify = kqueue_modify; |
158 | backend_poll = kqueue_poll; |
169 | backend_poll = kqueue_poll; |
159 | |
170 | |
160 | kqueue_eventmax = 64; /* initial number of events receivable per poll */ |
171 | kqueue_eventmax = 64; /* initial number of events receivable per poll */ |
161 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
172 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
162 | |
173 | |
163 | kqueue_changes = 0; |
174 | kqueue_changes = 0; |
… | |
… | |
165 | kqueue_changecnt = 0; |
176 | kqueue_changecnt = 0; |
166 | |
177 | |
167 | return EVBACKEND_KQUEUE; |
178 | return EVBACKEND_KQUEUE; |
168 | } |
179 | } |
169 | |
180 | |
170 | void inline_size |
181 | inline_size |
|
|
182 | void |
171 | kqueue_destroy (EV_P) |
183 | kqueue_destroy (EV_P) |
172 | { |
184 | { |
173 | ev_free (kqueue_events); |
185 | ev_free (kqueue_events); |
174 | ev_free (kqueue_changes); |
186 | ev_free (kqueue_changes); |
175 | } |
187 | } |
176 | |
188 | |
177 | void inline_size |
189 | inline_size |
|
|
190 | void |
178 | kqueue_fork (EV_P) |
191 | kqueue_fork (EV_P) |
179 | { |
192 | { |
|
|
193 | /* some BSD kernels don't just destroy the kqueue itself, |
|
|
194 | * but also close the fd, which isn't documented, and |
|
|
195 | * impossible to support properly. |
|
|
196 | * we remember the pid of the kqueue call and only close |
|
|
197 | * the fd if the pid is still the same. |
|
|
198 | * this leaks fds on sane kernels, but BSD interfaces are |
|
|
199 | * notoriously buggy and rarely get fixed. |
|
|
200 | */ |
|
|
201 | pid_t newpid = getpid (); |
|
|
202 | |
|
|
203 | if (newpid == kqueue_fd_pid) |
180 | close (backend_fd); |
204 | close (backend_fd); |
181 | |
205 | |
|
|
206 | kqueue_fd_pid = newpid; |
182 | while ((backend_fd = kqueue ()) < 0) |
207 | while ((backend_fd = kqueue ()) < 0) |
183 | syserr ("(libev) kqueue"); |
208 | ev_syserr ("(libev) kqueue"); |
184 | |
209 | |
185 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
210 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
186 | |
211 | |
187 | /* re-register interest in fds */ |
212 | /* re-register interest in fds */ |
188 | fd_rearm_all (EV_A); |
213 | fd_rearm_all (EV_A); |
189 | } |
214 | } |
190 | |
215 | |
|
|
216 | /* sys/event.h defines EV_ERROR */ |
|
|
217 | #undef EV_ERROR |
|
|
218 | |