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.14 by root, Tue Nov 6 18:49:32 2007 UTC vs.
Revision 1.55 by root, Thu Jan 16 11:51:05 2014 UTC

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

Diff Legend

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