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> |
33 | #include <sys/event.h> |
35 | #include <sys/event.h> |
34 | #include <string.h> |
36 | #include <string.h> |
35 | #include <errno.h> |
37 | #include <errno.h> |
36 | |
38 | |
37 | static void |
39 | void inline_speed |
38 | kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) |
40 | kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) |
39 | { |
41 | { |
40 | struct kevent *ke; |
|
|
41 | |
|
|
42 | ++kqueue_changecnt; |
42 | ++kqueue_changecnt; |
43 | array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); |
43 | array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); |
44 | |
44 | |
45 | ke = &kqueue_changes [kqueue_changecnt - 1]; |
45 | EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0); |
46 | memset (ke, 0, sizeof (struct kevent)); |
|
|
47 | ke->ident = fd; |
|
|
48 | ke->filter = filter; |
|
|
49 | ke->flags = flags; |
|
|
50 | ke->fflags = fflags; |
|
|
51 | } |
46 | } |
52 | |
47 | |
53 | #ifndef NOTE_EOF |
48 | #ifndef NOTE_EOF |
54 | # define NOTE_EOF 0 |
49 | # define NOTE_EOF 0 |
55 | #endif |
50 | #endif |
56 | |
51 | |
57 | static void |
52 | static void |
58 | kqueue_modify (EV_P_ int fd, int oev, int nev) |
53 | kqueue_modify (EV_P_ int fd, int oev, int nev) |
59 | { |
54 | { |
|
|
55 | if (oev != nev) |
|
|
56 | { |
|
|
57 | if (oev & EV_READ) |
|
|
58 | kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0); |
|
|
59 | |
|
|
60 | if (oev & EV_WRITE) |
|
|
61 | kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0); |
|
|
62 | } |
|
|
63 | |
60 | /* to detect close/reopen reliably, we have to remove and re-add */ |
64 | /* to detect close/reopen reliably, we have to re-add */ |
61 | /* event requests even when oev == nev */ |
65 | /* event requests even when oev == nev */ |
62 | |
66 | |
63 | if (oev & EV_READ) |
|
|
64 | kqueue_change (EV_A_ fd, EVFILT_READ, EV_DELETE, 0); |
|
|
65 | |
|
|
66 | if (oev & EV_WRITE) |
|
|
67 | kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0); |
|
|
68 | |
|
|
69 | if (nev & EV_READ) |
67 | if (nev & EV_READ) |
70 | kqueue_change (EV_A_ fd, EVFILT_READ, EV_ADD, NOTE_EOF); |
68 | kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF); |
71 | |
69 | |
72 | if (nev & EV_WRITE) |
70 | if (nev & EV_WRITE) |
73 | kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); |
71 | kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); |
74 | } |
72 | } |
75 | |
73 | |
… | |
… | |
81 | |
79 | |
82 | /* need to resize so there is enough space for errors */ |
80 | /* need to resize so there is enough space for errors */ |
83 | if (kqueue_changecnt > kqueue_eventmax) |
81 | if (kqueue_changecnt > kqueue_eventmax) |
84 | { |
82 | { |
85 | ev_free (kqueue_events); |
83 | ev_free (kqueue_events); |
86 | kqueue_eventmax = array_roundsize (struct kevent, kqueue_changecnt); |
84 | kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt); |
87 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
85 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
88 | } |
86 | } |
89 | |
87 | |
90 | ts.tv_sec = (time_t)timeout; |
88 | ts.tv_sec = (time_t)timeout; |
91 | ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9); |
89 | ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9); |
92 | res = kevent (kqueue_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts); |
90 | res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts); |
93 | kqueue_changecnt = 0; |
91 | kqueue_changecnt = 0; |
94 | |
92 | |
95 | if (res < 0) |
93 | if (expect_false (res < 0)) |
96 | { |
94 | { |
97 | if (errno != EINTR) |
95 | if (errno != EINTR) |
98 | syserr ("(libev) kevent"); |
96 | syserr ("(libev) kevent"); |
99 | |
97 | |
100 | return; |
98 | return; |
… | |
… | |
102 | |
100 | |
103 | for (i = 0; i < res; ++i) |
101 | for (i = 0; i < res; ++i) |
104 | { |
102 | { |
105 | int fd = kqueue_events [i].ident; |
103 | int fd = kqueue_events [i].ident; |
106 | |
104 | |
107 | if (kqueue_events [i].flags & EV_ERROR) |
105 | if (expect_false (kqueue_events [i].flags & EV_ERROR)) |
108 | { |
106 | { |
109 | int err = kqueue_events [i].data; |
107 | int err = kqueue_events [i].data; |
110 | |
|
|
111 | /* |
|
|
112 | * errors that may happen |
|
|
113 | * EBADF happens when the file discriptor has been |
|
|
114 | * closed, |
|
|
115 | * ENOENT when the file descriptor was closed and |
|
|
116 | * then reopened. |
|
|
117 | * EINVAL for some reasons not understood; EINVAL |
|
|
118 | * should not be returned ever; but FreeBSD does :-\ |
|
|
119 | */ |
|
|
120 | |
108 | |
121 | /* we are only interested in errors for fds that we are interested in :) */ |
109 | /* we are only interested in errors for fds that we are interested in :) */ |
122 | if (anfds [fd].events) |
110 | if (anfds [fd].events) |
123 | { |
111 | { |
124 | if (err == ENOENT) /* resubmit changes on ENOENT */ |
112 | if (err == ENOENT) /* resubmit changes on ENOENT */ |
… | |
… | |
145 | } |
133 | } |
146 | |
134 | |
147 | if (expect_false (res == kqueue_eventmax)) |
135 | if (expect_false (res == kqueue_eventmax)) |
148 | { |
136 | { |
149 | ev_free (kqueue_events); |
137 | ev_free (kqueue_events); |
150 | kqueue_eventmax = array_roundsize (struct kevent, kqueue_eventmax << 1); |
138 | kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1); |
151 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
139 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
152 | } |
140 | } |
153 | } |
141 | } |
154 | |
142 | |
155 | static int |
143 | int inline_size |
156 | kqueue_init (EV_P_ int flags) |
144 | kqueue_init (EV_P_ int flags) |
157 | { |
145 | { |
158 | struct kevent ch, ev; |
|
|
159 | |
|
|
160 | /* Initalize the kernel queue */ |
146 | /* Initalize the kernel queue */ |
161 | if ((kqueue_fd = kqueue ()) < 0) |
147 | if ((backend_fd = kqueue ()) < 0) |
162 | return 0; |
148 | return 0; |
163 | |
149 | |
164 | fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ |
150 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ |
165 | |
151 | |
166 | /* Check for Mac OS X kqueue bug. */ |
152 | backend_fudge = 0.; |
167 | ch.ident = -1; |
153 | backend_modify = kqueue_modify; |
168 | ch.filter = EVFILT_READ; |
154 | backend_poll = kqueue_poll; |
169 | ch.flags = EV_ADD; |
|
|
170 | |
155 | |
171 | /* |
|
|
172 | * If kqueue works, then kevent will succeed, and it will |
|
|
173 | * stick an error in ev. If kqueue is broken, then |
|
|
174 | * kevent will fail. |
|
|
175 | */ |
|
|
176 | if (kevent (kqueue_fd, &ch, 1, &ev, 1, 0) != 1 |
|
|
177 | || ev.ident != -1 |
|
|
178 | || ev.flags != EV_ERROR) |
|
|
179 | { |
|
|
180 | /* detected broken kqueue */ |
|
|
181 | close (kqueue_fd); |
|
|
182 | return 0; |
|
|
183 | } |
|
|
184 | |
|
|
185 | method_fudge = 1e-3; /* needed to compensate for kevent returning early */ |
|
|
186 | method_modify = kqueue_modify; |
|
|
187 | method_poll = kqueue_poll; |
|
|
188 | |
|
|
189 | kqueue_eventmax = 64; /* intiial number of events receivable per poll */ |
156 | kqueue_eventmax = 64; /* initial number of events receivable per poll */ |
190 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
157 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
191 | |
158 | |
192 | kqueue_changes = 0; |
159 | kqueue_changes = 0; |
193 | kqueue_changemax = 0; |
160 | kqueue_changemax = 0; |
194 | kqueue_changecnt = 0; |
161 | kqueue_changecnt = 0; |
195 | |
162 | |
196 | return EVBACKEND_KQUEUE; |
163 | return EVBACKEND_KQUEUE; |
197 | } |
164 | } |
198 | |
165 | |
199 | static void |
166 | void inline_size |
200 | kqueue_destroy (EV_P) |
167 | kqueue_destroy (EV_P) |
201 | { |
168 | { |
202 | close (kqueue_fd); |
|
|
203 | |
|
|
204 | ev_free (kqueue_events); |
169 | ev_free (kqueue_events); |
205 | ev_free (kqueue_changes); |
170 | ev_free (kqueue_changes); |
206 | } |
171 | } |
207 | |
172 | |
208 | static void |
173 | void inline_size |
209 | kqueue_fork (EV_P) |
174 | kqueue_fork (EV_P) |
210 | { |
175 | { |
211 | close (kqueue_fd); |
176 | close (backend_fd); |
212 | |
177 | |
213 | while ((kqueue_fd = kqueue ()) < 0) |
178 | while ((backend_fd = kqueue ()) < 0) |
214 | syserr ("(libev) kqueue"); |
179 | syserr ("(libev) kqueue"); |
215 | |
180 | |
216 | fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); |
181 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
217 | |
182 | |
218 | /* re-register interest in fds */ |
183 | /* re-register interest in fds */ |
219 | fd_rearm_all (EV_A); |
184 | fd_rearm_all (EV_A); |
220 | } |
185 | } |
221 | |
186 | |