ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev_kqueue.c
(Generate patch)

Comparing libev/ev_kqueue.c (file contents):
Revision 1.21 by root, Fri Nov 23 05:13:49 2007 UTC vs.
Revision 1.57 by root, Thu Jun 20 22:44:59 2019 UTC

1/* 1/*
2 * Copyright 2007 Marc Alexander Lehmann <libev@schmorp.de> 2 * libev kqueue backend
3 * Copyright 2000-2002 Niels Provos <provos@citi.umich.edu> 3 *
4 * Copyright (c) 2007,2008,2009,2010,2011,2012,2013,2016,2019 Marc Alexander Lehmann <libev@schmorp.de>
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 modifica-
7 * modification, are permitted provided that the following conditions 8 * tion, are permitted provided that the following conditions are met:
8 * are met:
9 * 9 *
10 * 1. Redistributions of source code must retain the above copyright 10 * 1. Redistributions of source code must retain the above copyright notice,
11 * notice, this list of conditions and the following disclaimer. 11 * this list of conditions and the following disclaimer.
12 *
12 * 2. Redistributions in binary form must reproduce the above copyright 13 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the 14 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution. 15 * 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 * 16 *
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 25 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
27 * 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.
28 */ 38 */
29 39
30#include <sys/types.h> 40#include <sys/types.h>
31#include <sys/time.h> 41#include <sys/time.h>
32#include <sys/queue.h>
33#include <sys/event.h> 42#include <sys/event.h>
34#include <string.h> 43#include <string.h>
35#include <errno.h> 44#include <errno.h>
36 45
37static void 46inline_speed
47void
38kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) 48kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
39{ 49{
40 struct kevent *ke;
41
42 ++kqueue_changecnt; 50 ++kqueue_changecnt;
43 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);
44 52
45 ke = &kqueue_changes [kqueue_changecnt - 1]; 53 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} 54}
52 55
56/* OS X at least needs this */
57#ifndef EV_ENABLE
58# define EV_ENABLE 0
59#endif
53#ifndef NOTE_EOF 60#ifndef NOTE_EOF
54# define NOTE_EOF 0 61# define NOTE_EOF 0
55#endif 62#endif
56 63
57static void 64static void
58kqueue_modify (EV_P_ int fd, int oev, int nev) 65kqueue_modify (EV_P_ int fd, int oev, int nev)
59{ 66{
67 if (oev != nev)
68 {
69 if (oev & EV_READ)
70 kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0);
71
72 if (oev & EV_WRITE)
73 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0);
74 }
75
60 /* to detect close/reopen reliably, we have to remove and re-add */ 76 /* to detect close/reopen reliably, we have to re-add */
61 /* event requests even when oev == nev */ 77 /* event requests even when oev == nev */
62 78
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) 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
76static void 86static void
77kqueue_poll (EV_P_ ev_tstamp timeout) 87kqueue_poll (EV_P_ ev_tstamp timeout)
78{ 88{
… …
81 91
82 /* need to resize so there is enough space for errors */ 92 /* need to resize so there is enough space for errors */
83 if (kqueue_changecnt > kqueue_eventmax) 93 if (kqueue_changecnt > kqueue_eventmax)
84 { 94 {
85 ev_free (kqueue_events); 95 ev_free (kqueue_events);
86 kqueue_eventmax = array_roundsize (struct kevent, 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 (kqueue_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 (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 (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
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 121
121 /* 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 :) */
122 if (anfds [fd].events) 123 if (anfds [fd].events)
123 { 124 {
124 if (err == ENOENT) /* resubmit changes on ENOENT */ 125 if (err == ENOENT) /* resubmit changes on ENOENT */
125 kqueue_modify (EV_A_ fd, 0, anfds [fd].events); 126 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
126 else if (err == EBADF) /* on EBADF, we re-check the fd */ 127 else if (err == EBADF) /* on EBADF, we re-check the fd */
127 { 128 {
128 if (fd_valid (fd)) 129 if (fd_valid (fd))
… …
130 else 131 else
131 fd_kill (EV_A_ fd); 132 fd_kill (EV_A_ fd);
132 } 133 }
133 else /* on all other errors, we error out on the fd */ 134 else /* on all other errors, we error out on the fd */
134 fd_kill (EV_A_ fd); 135 fd_kill (EV_A_ fd);
135 } 136 }
136 } 137 }
137 else 138 else
138 fd_event ( 139 fd_event (
139 EV_A_ 140 EV_A_
140 fd, 141 fd,
… …
145 } 146 }
146 147
147 if (expect_false (res == kqueue_eventmax)) 148 if (expect_false (res == kqueue_eventmax))
148 { 149 {
149 ev_free (kqueue_events); 150 ev_free (kqueue_events);
150 kqueue_eventmax = array_roundsize (struct kevent, 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
155static int 156inline_size
157int
156kqueue_init (EV_P_ int flags) 158kqueue_init (EV_P_ int flags)
157{ 159{
158 struct kevent ch, ev;
159
160 /* Initalize the kernel queue */ 160 /* initialize the kernel queue */
161 if ((kqueue_fd = kqueue ()) < 0) 161 kqueue_fd_pid = getpid ();
162 if ((backend_fd = kqueue ()) < 0)
162 return 0; 163 return 0;
163 164
164 fcntl (kqueue_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 */
165 166
166 /* Check for Mac OS X kqueue bug. */ 167 backend_mintime = 1e-9; /* apparently, they did the right thing in freebsd */
167 ch.ident = -1;
168 ch.filter = EVFILT_READ;
169 ch.flags = EV_ADD;
170
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 backend_fudge = 1e-3; /* needed to compensate for kevent returning early */
186 backend_modify = kqueue_modify; 168 backend_modify = kqueue_modify;
187 backend_poll = kqueue_poll; 169 backend_poll = kqueue_poll;
188 170
189 kqueue_eventmax = 64; /* intiial number of events receivable per poll */ 171 kqueue_eventmax = 64; /* initial number of events receivable per poll */
190 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 172 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
191 173
192 kqueue_changes = 0; 174 kqueue_changes = 0;
193 kqueue_changemax = 0; 175 kqueue_changemax = 0;
194 kqueue_changecnt = 0; 176 kqueue_changecnt = 0;
195 177
196 return EVBACKEND_KQUEUE; 178 return EVBACKEND_KQUEUE;
197} 179}
198 180
199static void 181inline_size
182void
200kqueue_destroy (EV_P) 183kqueue_destroy (EV_P)
201{ 184{
202 close (kqueue_fd);
203
204 ev_free (kqueue_events); 185 ev_free (kqueue_events);
205 ev_free (kqueue_changes); 186 ev_free (kqueue_changes);
206} 187}
207 188
208static void 189inline_size
190void
209kqueue_fork (EV_P) 191kqueue_fork (EV_P)
210{ 192{
211 close (kqueue_fd); 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 ();
212 202
213 while ((kqueue_fd = kqueue ()) < 0) 203 if (newpid == kqueue_fd_pid)
204 close (backend_fd);
205
206 kqueue_fd_pid = newpid;
207 while ((backend_fd = kqueue ()) < 0)
214 syserr ("(libev) kqueue"); 208 ev_syserr ("(libev) kqueue");
215 209
216 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); 210 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
217 211
218 /* re-register interest in fds */ 212 /* re-register interest in fds */
219 fd_rearm_all (EV_A); 213 fd_rearm_all (EV_A);
220} 214}
221 215
216/* sys/event.h defines EV_ERROR */
217#undef EV_ERROR
218

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines