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.25 by root, Fri Nov 23 19:13:33 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 EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0); 53 EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0);
46} 54}
… …
79 87
80 /* need to resize so there is enough space for errors */ 88 /* need to resize so there is enough space for errors */
81 if (kqueue_changecnt > kqueue_eventmax) 89 if (kqueue_changecnt > kqueue_eventmax)
82 { 90 {
83 ev_free (kqueue_events); 91 ev_free (kqueue_events);
84 kqueue_eventmax = array_roundsize (struct kevent, kqueue_changecnt); 92 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
85 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 93 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
86 } 94 }
87 95
88 ts.tv_sec = (time_t)timeout; 96 ts.tv_sec = (time_t)timeout;
89 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9); 97 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9);
90 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts); 98 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
91 kqueue_changecnt = 0; 99 kqueue_changecnt = 0;
92 100
93 if (res < 0) 101 if (expect_false (res < 0))
94 { 102 {
95 if (errno != EINTR) 103 if (errno != EINTR)
96 syserr ("(libev) kevent"); 104 syserr ("(libev) kevent");
97 105
98 return; 106 return;
… …
103 int fd = kqueue_events [i].ident; 111 int fd = kqueue_events [i].ident;
104 112
105 if (expect_false (kqueue_events [i].flags & EV_ERROR)) 113 if (expect_false (kqueue_events [i].flags & EV_ERROR))
106 { 114 {
107 int err = kqueue_events [i].data; 115 int err = kqueue_events [i].data;
108
109 /*
110 * errors that may happen
111 * EBADF happens when the file discriptor has been
112 * closed,
113 * ENOENT when the file descriptor was closed and
114 * then reopened.
115 * EINVAL for some reasons not understood; EINVAL
116 * should not be returned ever; but FreeBSD does :-\
117 */
118 116
119 /* 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 :) */
120 if (anfds [fd].events) 118 if (anfds [fd].events)
121 { 119 {
122 if (err == ENOENT) /* resubmit changes on ENOENT */ 120 if (err == ENOENT) /* resubmit changes on ENOENT */
… …
143 } 141 }
144 142
145 if (expect_false (res == kqueue_eventmax)) 143 if (expect_false (res == kqueue_eventmax))
146 { 144 {
147 ev_free (kqueue_events); 145 ev_free (kqueue_events);
148 kqueue_eventmax = array_roundsize (struct kevent, kqueue_eventmax << 1); 146 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
149 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 147 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
150 } 148 }
151} 149}
152 150
153static int 151int inline_size
154kqueue_init (EV_P_ int flags) 152kqueue_init (EV_P_ int flags)
155{ 153{
156 struct kevent ch, ev;
157
158 /* Initalize the kernel queue */ 154 /* Initalize the kernel queue */
159 if ((backend_fd = kqueue ()) < 0) 155 if ((backend_fd = kqueue ()) < 0)
160 return 0; 156 return 0;
161 157
162 fcntl (backend_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 */
163 159
164 /* Check for Mac OS X kqueue bug. */ 160 backend_fudge = 0.;
165 ch.ident = -1;
166 ch.filter = EVFILT_READ;
167 ch.flags = EV_ADD;
168
169 /*
170 * If kqueue works, then kevent will succeed, and it will
171 * stick an error in ev. If kqueue is broken, then
172 * kevent will fail.
173 */
174 if (kevent (backend_fd, &ch, 1, &ev, 1, 0) != 1
175 || ev.ident != -1
176 || ev.flags != EV_ERROR)
177 {
178 /* detected broken kqueue */
179 close (backend_fd);
180 return 0;
181 }
182
183 backend_fudge = 1e-3; /* needed to compensate for kevent returning early */
184 backend_modify = kqueue_modify; 161 backend_modify = kqueue_modify;
185 backend_poll = kqueue_poll; 162 backend_poll = kqueue_poll;
186 163
187 kqueue_eventmax = 64; /* intiial number of events receivable per poll */ 164 kqueue_eventmax = 64; /* initial number of events receivable per poll */
188 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 165 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
189 166
190 kqueue_changes = 0; 167 kqueue_changes = 0;
191 kqueue_changemax = 0; 168 kqueue_changemax = 0;
192 kqueue_changecnt = 0; 169 kqueue_changecnt = 0;
193 170
194 return EVBACKEND_KQUEUE; 171 return EVBACKEND_KQUEUE;
195} 172}
196 173
197static void 174void inline_size
198kqueue_destroy (EV_P) 175kqueue_destroy (EV_P)
199{ 176{
200 close (backend_fd);
201
202 ev_free (kqueue_events); 177 ev_free (kqueue_events);
203 ev_free (kqueue_changes); 178 ev_free (kqueue_changes);
204} 179}
205 180
206static void 181void inline_size
207kqueue_fork (EV_P) 182kqueue_fork (EV_P)
208{ 183{
209 close (backend_fd); 184 close (backend_fd);
210 185
211 while ((backend_fd = kqueue ()) < 0) 186 while ((backend_fd = kqueue ()) < 0)

Diff Legend

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