1 | /* |
1 | /* |
2 | * libev kqueue backend |
2 | * libev kqueue backend |
3 | * |
3 | * |
4 | * Copyright (c) 2007,2008,2009,2010 Marc Alexander Lehmann <libev@schmorp.de> |
4 | * Copyright (c) 2007,2008,2009,2010,2011,2012,2013 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 | * |
10 | * 1. Redistributions of source code must retain the above copyright notice, |
10 | * 1. Redistributions of source code must retain the above copyright notice, |
11 | * this list of conditions and the following disclaimer. |
11 | * this list of conditions and the following disclaimer. |
12 | * |
12 | * |
13 | * 2. Redistributions in binary form must reproduce the above copyright |
13 | * 2. Redistributions in binary form must reproduce the above copyright |
14 | * notice, this list of conditions and the following disclaimer in the |
14 | * notice, this list of conditions and the following disclaimer in the |
15 | * documentation and/or other materials provided with the distribution. |
15 | * documentation and/or other materials provided with the distribution. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
19 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
19 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
20 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
20 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
… | |
… | |
41 | #include <sys/time.h> |
41 | #include <sys/time.h> |
42 | #include <sys/event.h> |
42 | #include <sys/event.h> |
43 | #include <string.h> |
43 | #include <string.h> |
44 | #include <errno.h> |
44 | #include <errno.h> |
45 | |
45 | |
46 | void inline_speed |
46 | inline_speed |
|
|
47 | void |
47 | 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) |
48 | { |
49 | { |
49 | ++kqueue_changecnt; |
50 | ++kqueue_changecnt; |
50 | array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); |
51 | array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); |
51 | |
52 | |
… | |
… | |
95 | kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt); |
96 | kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt); |
96 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
97 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
97 | } |
98 | } |
98 | |
99 | |
99 | EV_RELEASE_CB; |
100 | EV_RELEASE_CB; |
100 | EV_SET_TV (tv, timeout); |
101 | EV_TS_SET (ts, timeout); |
101 | 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); |
102 | EV_ACQUIRE_CB; |
103 | EV_ACQUIRE_CB; |
103 | kqueue_changecnt = 0; |
104 | kqueue_changecnt = 0; |
104 | |
105 | |
105 | if (expect_false (res < 0)) |
106 | if (expect_false (res < 0)) |
106 | { |
107 | { |
107 | if (errno != EINTR) |
108 | if (errno != EINTR) |
108 | ev_syserr ("(libev) kevent"); |
109 | ev_syserr ("(libev) kevent"); |
109 | |
110 | |
110 | return; |
111 | return; |
111 | } |
112 | } |
112 | |
113 | |
113 | for (i = 0; i < res; ++i) |
114 | for (i = 0; i < res; ++i) |
114 | { |
115 | { |
115 | int fd = kqueue_events [i].ident; |
116 | int fd = kqueue_events [i].ident; |
116 | |
117 | |
… | |
… | |
150 | 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); |
151 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
152 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
152 | } |
153 | } |
153 | } |
154 | } |
154 | |
155 | |
155 | int inline_size |
156 | inline_size |
|
|
157 | int |
156 | kqueue_init (EV_P_ int flags) |
158 | kqueue_init (EV_P_ int flags) |
157 | { |
159 | { |
158 | /* Initialize the kernel queue */ |
160 | /* initialize the kernel queue */ |
|
|
161 | kqueue_fd_pid = getpid (); |
159 | if ((backend_fd = kqueue ()) < 0) |
162 | if ((backend_fd = kqueue ()) < 0) |
160 | return 0; |
163 | return 0; |
161 | |
164 | |
162 | 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 */ |
163 | |
166 | |
164 | backend_fudge = 0.; |
167 | backend_mintime = 1e-9; /* apparently, they did the right thing in freebsd */ |
165 | backend_modify = kqueue_modify; |
168 | backend_modify = kqueue_modify; |
166 | backend_poll = kqueue_poll; |
169 | backend_poll = kqueue_poll; |
167 | |
170 | |
168 | kqueue_eventmax = 64; /* initial number of events receivable per poll */ |
171 | kqueue_eventmax = 64; /* initial number of events receivable per poll */ |
169 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
172 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
170 | |
173 | |
171 | kqueue_changes = 0; |
174 | kqueue_changes = 0; |
… | |
… | |
173 | kqueue_changecnt = 0; |
176 | kqueue_changecnt = 0; |
174 | |
177 | |
175 | return EVBACKEND_KQUEUE; |
178 | return EVBACKEND_KQUEUE; |
176 | } |
179 | } |
177 | |
180 | |
178 | void inline_size |
181 | inline_size |
|
|
182 | void |
179 | kqueue_destroy (EV_P) |
183 | kqueue_destroy (EV_P) |
180 | { |
184 | { |
181 | ev_free (kqueue_events); |
185 | ev_free (kqueue_events); |
182 | ev_free (kqueue_changes); |
186 | ev_free (kqueue_changes); |
183 | } |
187 | } |
184 | |
188 | |
185 | void inline_size |
189 | inline_size |
|
|
190 | void |
186 | kqueue_fork (EV_P) |
191 | kqueue_fork (EV_P) |
187 | { |
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) |
188 | close (backend_fd); |
204 | close (backend_fd); |
189 | |
205 | |
|
|
206 | kqueue_fd_pid = newpid; |
190 | while ((backend_fd = kqueue ()) < 0) |
207 | while ((backend_fd = kqueue ()) < 0) |
191 | ev_syserr ("(libev) kqueue"); |
208 | ev_syserr ("(libev) kqueue"); |
192 | |
209 | |
193 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
210 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
194 | |
211 | |
195 | /* re-register interest in fds */ |
212 | /* re-register interest in fds */ |
196 | fd_rearm_all (EV_A); |
213 | fd_rearm_all (EV_A); |
197 | } |
214 | } |
198 | |
215 | |
|
|
216 | /* sys/event.h defines EV_ERROR */ |
|
|
217 | #undef EV_ERROR |
|
|
218 | |