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.19 by root, Thu Nov 22 15:42:01 2007 UTC vs.
Revision 1.33 by root, Tue Dec 25 07:05:45 2007 UTC

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 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 *
10 * 1. Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer.
12 *
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 *
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-
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-
21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
24 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
25 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
26 * OF THE POSSIBILITY OF SUCH DAMAGE.
9 * 27 *
10 * 1. Redistributions of source code must retain the above copyright 28 * Alternatively, the contents of this file may be used under the terms of
11 * notice, this list of conditions and the following disclaimer. 29 * the GNU General Public License ("GPL") version 2 or any later version,
12 * 2. Redistributions in binary form must reproduce the above copyright 30 * in which case the provisions of the GPL are applicable instead of
13 * notice, this list of conditions and the following disclaimer in the 31 * the above. If you wish to allow the use of your version of this file
14 * documentation and/or other materials provided with the distribution. 32 * only under the terms of the GPL and not to allow others to use your
15 * 3. The name of the author may not be used to endorse or promote products 33 * version of this file under the BSD license, indicate your decision
16 * derived from this software without specific prior written permission. 34 * by deleting the provisions above and replace them with the notice
17 * 35 * and other provisions required by the GPL. If you do not delete the
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 36 * provisions above, a recipient may use your version of this file under
19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 37 * either the BSD or the GPL.
20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
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> 42#include <sys/queue.h>
33#include <sys/event.h> 43#include <sys/event.h>
34#include <string.h> 44#include <string.h>
35#include <errno.h> 45#include <errno.h>
36 46
37static void 47void inline_speed
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, EMPTY2);
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
53#ifndef NOTE_EOF 56#ifndef NOTE_EOF
54# define NOTE_EOF 0 57# define NOTE_EOF 0
55#endif 58#endif
56 59
57static void 60static void
58kqueue_modify (EV_P_ int fd, int oev, int nev) 61kqueue_modify (EV_P_ int fd, int oev, int nev)
59{ 62{
63 if (oev != nev)
64 {
65 if (oev & EV_READ)
66 kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0);
67
68 if (oev & EV_WRITE)
69 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0);
70 }
71
60 /* to detect close/reopen reliably, we have to remove and re-add */ 72 /* to detect close/reopen reliably, we have to re-add */
61 /* event requests even when oev == nev */ 73 /* event requests even when oev == nev */
62 74
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) 75 if (nev & EV_READ)
70 kqueue_change (EV_A_ fd, EVFILT_READ, EV_ADD, NOTE_EOF); 76 kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF);
71 77
72 if (nev & EV_WRITE) 78 if (nev & EV_WRITE)
73 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); 79 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF);
74} 80}
75 81
… …
81 87
82 /* need to resize so there is enough space for errors */ 88 /* need to resize so there is enough space for errors */
83 if (kqueue_changecnt > kqueue_eventmax) 89 if (kqueue_changecnt > kqueue_eventmax)
84 { 90 {
85 ev_free (kqueue_events); 91 ev_free (kqueue_events);
86 kqueue_eventmax = array_roundsize (struct kevent, kqueue_changecnt); 92 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
87 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 93 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
88 } 94 }
89 95
90 ts.tv_sec = (time_t)timeout; 96 ts.tv_sec = (time_t)timeout;
91 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9); 97 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); 98 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
93 kqueue_changecnt = 0; 99 kqueue_changecnt = 0;
94 100
95 if (res < 0) 101 if (expect_false (res < 0))
96 { 102 {
97 if (errno != EINTR) 103 if (errno != EINTR)
98 syserr ("(libev) kevent"); 104 syserr ("(libev) kevent");
99 105
100 return; 106 return;
… …
102 108
103 for (i = 0; i < res; ++i) 109 for (i = 0; i < res; ++i)
104 { 110 {
105 int fd = kqueue_events [i].ident; 111 int fd = kqueue_events [i].ident;
106 112
107 if (kqueue_events [i].flags & EV_ERROR) 113 if (expect_false (kqueue_events [i].flags & EV_ERROR))
108 { 114 {
109 int err = kqueue_events [i].data; 115 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 116
121 /* we are only interested in errors for fds that we are interested in :) */ 117 /* we are only interested in errors for fds that we are interested in :) */
122 if (anfds [fd].events) 118 if (anfds [fd].events)
123 { 119 {
124 if (err == ENOENT) /* resubmit changes on ENOENT */ 120 if (err == ENOENT) /* resubmit changes on ENOENT */
… …
145 } 141 }
146 142
147 if (expect_false (res == kqueue_eventmax)) 143 if (expect_false (res == kqueue_eventmax))
148 { 144 {
149 ev_free (kqueue_events); 145 ev_free (kqueue_events);
150 kqueue_eventmax = array_roundsize (struct kevent, kqueue_eventmax << 1); 146 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
151 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 147 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
152 } 148 }
153} 149}
154 150
155static int 151int inline_size
156kqueue_init (EV_P_ int flags) 152kqueue_init (EV_P_ int flags)
157{ 153{
158 struct kevent ch, ev;
159
160 /* Initalize the kernel queue */ 154 /* Initalize the kernel queue */
161 if ((kqueue_fd = kqueue ()) < 0) 155 if ((backend_fd = kqueue ()) < 0)
162 return 0; 156 return 0;
163 157
164 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ 158 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
165 159
166 /* Check for Mac OS X kqueue bug. */ 160 backend_fudge = 0.;
167 ch.ident = -1; 161 backend_modify = kqueue_modify;
168 ch.filter = EVFILT_READ; 162 backend_poll = kqueue_poll;
169 ch.flags = EV_ADD;
170 163
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 */ 164 kqueue_eventmax = 64; /* initial number of events receivable per poll */
190 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 165 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
191 166
192 kqueue_changes = 0; 167 kqueue_changes = 0;
193 kqueue_changemax = 0; 168 kqueue_changemax = 0;
194 kqueue_changecnt = 0; 169 kqueue_changecnt = 0;
195 170
196 return EVMETHOD_KQUEUE; 171 return EVBACKEND_KQUEUE;
197} 172}
198 173
199static void 174void inline_size
200kqueue_destroy (EV_P) 175kqueue_destroy (EV_P)
201{ 176{
202 close (kqueue_fd);
203
204 ev_free (kqueue_events); 177 ev_free (kqueue_events);
205 ev_free (kqueue_changes); 178 ev_free (kqueue_changes);
206} 179}
207 180
208static void 181void inline_size
209kqueue_fork (EV_P) 182kqueue_fork (EV_P)
210{ 183{
211 close (kqueue_fd); 184 close (backend_fd);
212 185
213 while ((kqueue_fd = kqueue ()) < 0) 186 while ((backend_fd = kqueue ()) < 0)
214 syserr ("(libev) kqueue"); 187 syserr ("(libev) kqueue");
215 188
216 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); 189 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
217 190
218 /* re-register interest in fds */ 191 /* re-register interest in fds */
219 fd_rearm_all (EV_A); 192 fd_rearm_all (EV_A);
220} 193}
221 194

Diff Legend

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