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 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, |
… | |
… | |
101 | res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts); |
101 | res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts); |
102 | EV_ACQUIRE_CB; |
102 | EV_ACQUIRE_CB; |
103 | kqueue_changecnt = 0; |
103 | kqueue_changecnt = 0; |
104 | |
104 | |
105 | if (expect_false (res < 0)) |
105 | if (expect_false (res < 0)) |
106 | { |
106 | { |
107 | if (errno != EINTR) |
107 | if (errno != EINTR) |
108 | ev_syserr ("(libev) kevent"); |
108 | ev_syserr ("(libev) kevent"); |
109 | |
109 | |
110 | return; |
110 | return; |
111 | } |
111 | } |
112 | |
112 | |
113 | for (i = 0; i < res; ++i) |
113 | for (i = 0; i < res; ++i) |
114 | { |
114 | { |
115 | int fd = kqueue_events [i].ident; |
115 | int fd = kqueue_events [i].ident; |
116 | |
116 | |
… | |
… | |
153 | } |
153 | } |
154 | |
154 | |
155 | int inline_size |
155 | int inline_size |
156 | kqueue_init (EV_P_ int flags) |
156 | kqueue_init (EV_P_ int flags) |
157 | { |
157 | { |
158 | /* Initialize the kernel queue */ |
158 | /* initialize the kernel queue */ |
|
|
159 | kqueue_fd_pid = getpid (); |
159 | if ((backend_fd = kqueue ()) < 0) |
160 | if ((backend_fd = kqueue ()) < 0) |
160 | return 0; |
161 | return 0; |
161 | |
162 | |
162 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ |
163 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ |
163 | |
164 | |
164 | backend_fudge = 0.; |
165 | backend_mintime = 1e-9; /* apparently, they did the right thing in freebsd */ |
165 | backend_modify = kqueue_modify; |
166 | backend_modify = kqueue_modify; |
166 | backend_poll = kqueue_poll; |
167 | backend_poll = kqueue_poll; |
167 | |
168 | |
168 | kqueue_eventmax = 64; /* initial number of events receivable per poll */ |
169 | kqueue_eventmax = 64; /* initial number of events receivable per poll */ |
169 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
170 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
170 | |
171 | |
171 | kqueue_changes = 0; |
172 | kqueue_changes = 0; |
… | |
… | |
183 | } |
184 | } |
184 | |
185 | |
185 | void inline_size |
186 | void inline_size |
186 | kqueue_fork (EV_P) |
187 | kqueue_fork (EV_P) |
187 | { |
188 | { |
|
|
189 | /* some BSD kernels don't just destroy the kqueue itself, |
|
|
190 | * but also close the fd, which isn't documented, and |
|
|
191 | * impossible to support properly. |
|
|
192 | * we remember the pid of the kqueue call and only close |
|
|
193 | * the fd if the pid is still the same. |
|
|
194 | * this leaks fds on sane kernels, but BSD interfaces are |
|
|
195 | * notoriously buggy and rarely get fixed. |
|
|
196 | */ |
|
|
197 | pid_t newpid = getpid (); |
|
|
198 | |
|
|
199 | if (newpid == kqueue_fd_pid) |
188 | close (backend_fd); |
200 | close (backend_fd); |
189 | |
201 | |
|
|
202 | kqueue_fd_pid = newpid; |
190 | while ((backend_fd = kqueue ()) < 0) |
203 | while ((backend_fd = kqueue ()) < 0) |
191 | ev_syserr ("(libev) kqueue"); |
204 | ev_syserr ("(libev) kqueue"); |
192 | |
205 | |
193 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
206 | fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
194 | |
207 | |
195 | /* re-register interest in fds */ |
208 | /* re-register interest in fds */ |
196 | fd_rearm_all (EV_A); |
209 | fd_rearm_all (EV_A); |
197 | } |
210 | } |
198 | |
211 | |
|
|
212 | /* sys/event.h defines EV_ERROR */ |
|
|
213 | #undef EV_ERROR |
|
|
214 | |