1 | /* |
1 | /* |
|
|
2 | * libev kqueue backend |
|
|
3 | * |
2 | * Copyright 2007 Marc Alexander Lehmann <libev@schmorp.de> |
4 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
3 | * Copyright 2000-2002 Niels Provos <provos@citi.umich.edu> |
|
|
4 | * All rights reserved. |
5 | * All rights reserved. |
5 | * |
6 | * |
6 | * Redistribution and use in source and binary forms, with or without |
7 | * Redistribution and use in source and binary forms, with or without |
7 | * modification, are permitted provided that the following conditions |
8 | * modification, are permitted provided that the following conditions are |
8 | * are met: |
9 | * met: |
9 | * |
10 | * |
10 | * 1. Redistributions of source code must retain the above copyright |
11 | * * Redistributions of source code must retain the above copyright |
11 | * notice, this list of conditions and the following disclaimer. |
12 | * notice, this list of conditions and the following disclaimer. |
12 | * 2. Redistributions in binary form must reproduce the above copyright |
|
|
13 | * notice, this list of conditions and the following disclaimer in the |
|
|
14 | * documentation and/or other materials provided with the distribution. |
|
|
15 | * 3. The name of the author may not be used to endorse or promote products |
|
|
16 | * derived from this software without specific prior written permission. |
|
|
17 | * |
13 | * |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
14 | * * Redistributions in binary form must reproduce the above |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
15 | * copyright notice, this list of conditions and the following |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
16 | * disclaimer in the documentation and/or other materials provided |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
17 | * with the distribution. |
|
|
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, |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
24 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 | * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
28 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
28 | */ |
30 | */ |
29 | |
31 | |
30 | #include <sys/types.h> |
32 | #include <sys/types.h> |
31 | #include <sys/time.h> |
33 | #include <sys/time.h> |
32 | #include <sys/queue.h> |
34 | #include <sys/queue.h> |
… | |
… | |
104 | |
106 | |
105 | if (expect_false (kqueue_events [i].flags & EV_ERROR)) |
107 | if (expect_false (kqueue_events [i].flags & EV_ERROR)) |
106 | { |
108 | { |
107 | int err = kqueue_events [i].data; |
109 | int err = kqueue_events [i].data; |
108 | |
110 | |
109 | /* |
|
|
110 | * errors that may happen |
|
|
111 | * EBADF happens when the file discriptor has been |
|
|
112 | * closed, |
|
|
113 | * ENOENT when the file descriptor was closed and |
|
|
114 | * then reopened. |
|
|
115 | * EINVAL for some reasons not understood; EINVAL |
|
|
116 | * should not be returned ever; but FreeBSD does :-\ |
|
|
117 | */ |
|
|
118 | |
|
|
119 | /* we are only interested in errors for fds that we are interested in :) */ |
111 | /* we are only interested in errors for fds that we are interested in :) */ |
120 | if (anfds [fd].events) |
112 | if (anfds [fd].events) |
121 | { |
113 | { |
122 | if (err == ENOENT) /* resubmit changes on ENOENT */ |
114 | if (err == ENOENT) /* resubmit changes on ENOENT */ |
123 | kqueue_modify (EV_A_ fd, 0, anfds [fd].events); |
115 | kqueue_modify (EV_A_ fd, 0, anfds [fd].events); |
… | |
… | |
159 | if ((backend_fd = kqueue ()) < 0) |
151 | if ((backend_fd = kqueue ()) < 0) |
160 | return 0; |
152 | return 0; |
161 | |
153 | |
162 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ |
154 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ |
163 | |
155 | |
164 | /* Check for Mac OS X kqueue bug. */ |
156 | /* fudge *might* be zero from the documentation, but bsd docs are notoriously wrong */ |
165 | ch.ident = -1; |
|
|
166 | ch.filter = EVFILT_READ; |
|
|
167 | ch.flags = EV_ADD; |
|
|
168 | |
|
|
169 | /* |
|
|
170 | * If kqueue works, then kevent will succeed, and it will |
|
|
171 | * stick an error in ev. If kqueue is broken, then |
|
|
172 | * kevent will fail. |
|
|
173 | */ |
|
|
174 | if (kevent (backend_fd, &ch, 1, &ev, 1, 0) != 1 |
|
|
175 | || ev.ident != -1 |
|
|
176 | || ev.flags != EV_ERROR) |
|
|
177 | { |
|
|
178 | /* detected broken kqueue */ |
|
|
179 | close (backend_fd); |
|
|
180 | return 0; |
|
|
181 | } |
|
|
182 | |
|
|
183 | backend_fudge = 1e-3; /* needed to compensate for kevent returning early */ |
157 | backend_fudge = 1e-3; /* needed to compensate for kevent returning early */ |
184 | backend_modify = kqueue_modify; |
158 | backend_modify = kqueue_modify; |
185 | backend_poll = kqueue_poll; |
159 | backend_poll = kqueue_poll; |
186 | |
160 | |
187 | kqueue_eventmax = 64; /* intiial number of events receivable per poll */ |
161 | kqueue_eventmax = 64; /* initial number of events receivable per poll */ |
188 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
162 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
189 | |
163 | |
190 | kqueue_changes = 0; |
164 | kqueue_changes = 0; |
191 | kqueue_changemax = 0; |
165 | kqueue_changemax = 0; |
192 | kqueue_changecnt = 0; |
166 | kqueue_changecnt = 0; |