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.24 by root, Fri Nov 23 13:08:57 2007 UTC vs.
Revision 1.30 by root, Sun Dec 9 03:51:19 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
7 * modification, are permitted provided that the following conditions 8 * modification, are permitted provided that the following conditions are
8 * are met: 9 * met:
9 * 10 *
10 * 1. Redistributions of source code must retain the above copyright 11 * * Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer. 12 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * 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 * 13 *
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 14 * * Redistributions in binary form must reproduce the above
19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 15 * copyright notice, this list of conditions and the following
20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 16 * disclaimer in the documentation and/or other materials provided
21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 17 * with the distribution.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 */ 30 */
29 31
30#include <sys/types.h> 32#include <sys/types.h>
31#include <sys/time.h> 33#include <sys/time.h>
32#include <sys/queue.h> 34#include <sys/queue.h>
33#include <sys/event.h> 35#include <sys/event.h>
34#include <string.h> 36#include <string.h>
35#include <errno.h> 37#include <errno.h>
36 38
37static void 39void inline_speed
38kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) 40kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
39{ 41{
40 struct kevent *ke; 42 struct kevent *ke;
41 43
42 ++kqueue_changecnt; 44 ++kqueue_changecnt;
… …
79 81
80 /* need to resize so there is enough space for errors */ 82 /* need to resize so there is enough space for errors */
81 if (kqueue_changecnt > kqueue_eventmax) 83 if (kqueue_changecnt > kqueue_eventmax)
82 { 84 {
83 ev_free (kqueue_events); 85 ev_free (kqueue_events);
84 kqueue_eventmax = array_roundsize (struct kevent, kqueue_changecnt); 86 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
85 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 87 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
86 } 88 }
87 89
88 ts.tv_sec = (time_t)timeout; 90 ts.tv_sec = (time_t)timeout;
89 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9); 91 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9);
90 res = kevent (kqueue_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts); 92 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
91 kqueue_changecnt = 0; 93 kqueue_changecnt = 0;
92 94
93 if (res < 0) 95 if (expect_false (res < 0))
94 { 96 {
95 if (errno != EINTR) 97 if (errno != EINTR)
96 syserr ("(libev) kevent"); 98 syserr ("(libev) kevent");
97 99
98 return; 100 return;
… …
103 int fd = kqueue_events [i].ident; 105 int fd = kqueue_events [i].ident;
104 106
105 if (expect_false (kqueue_events [i].flags & EV_ERROR)) 107 if (expect_false (kqueue_events [i].flags & EV_ERROR))
106 { 108 {
107 int err = kqueue_events [i].data; 109 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 110
119 /* we are only interested in errors for fds that we are interested in :) */ 111 /* we are only interested in errors for fds that we are interested in :) */
120 if (anfds [fd].events) 112 if (anfds [fd].events)
121 { 113 {
122 if (err == ENOENT) /* resubmit changes on ENOENT */ 114 if (err == ENOENT) /* resubmit changes on ENOENT */
… …
143 } 135 }
144 136
145 if (expect_false (res == kqueue_eventmax)) 137 if (expect_false (res == kqueue_eventmax))
146 { 138 {
147 ev_free (kqueue_events); 139 ev_free (kqueue_events);
148 kqueue_eventmax = array_roundsize (struct kevent, kqueue_eventmax << 1); 140 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
149 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 141 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
150 } 142 }
151} 143}
152 144
153static int 145int inline_size
154kqueue_init (EV_P_ int flags) 146kqueue_init (EV_P_ int flags)
155{ 147{
156 struct kevent ch, ev; 148 struct kevent ch, ev;
157 149
158 /* Initalize the kernel queue */ 150 /* Initalize the kernel queue */
159 if ((kqueue_fd = kqueue ()) < 0) 151 if ((backend_fd = kqueue ()) < 0)
160 return 0; 152 return 0;
161 153
162 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ 154 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
163
164 /* Check for Mac OS X kqueue bug. */
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 (kqueue_fd, &ch, 1, &ev, 1, 0) != 1
175 || ev.ident != -1
176 || ev.flags != EV_ERROR)
177 {
178 /* detected broken kqueue */
179 close (kqueue_fd);
180 return 0;
181 }
182 155
183 backend_fudge = 1e-3; /* needed to compensate for kevent returning early */ 156 backend_fudge = 1e-3; /* needed to compensate for kevent returning early */
184 backend_modify = kqueue_modify; 157 backend_modify = kqueue_modify;
185 backend_poll = kqueue_poll; 158 backend_poll = kqueue_poll;
186 159
187 kqueue_eventmax = 64; /* intiial number of events receivable per poll */ 160 kqueue_eventmax = 64; /* initial number of events receivable per poll */
188 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 161 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
189 162
190 kqueue_changes = 0; 163 kqueue_changes = 0;
191 kqueue_changemax = 0; 164 kqueue_changemax = 0;
192 kqueue_changecnt = 0; 165 kqueue_changecnt = 0;
193 166
194 return EVBACKEND_KQUEUE; 167 return EVBACKEND_KQUEUE;
195} 168}
196 169
197static void 170void inline_size
198kqueue_destroy (EV_P) 171kqueue_destroy (EV_P)
199{ 172{
200 close (kqueue_fd);
201
202 ev_free (kqueue_events); 173 ev_free (kqueue_events);
203 ev_free (kqueue_changes); 174 ev_free (kqueue_changes);
204} 175}
205 176
206static void 177void inline_size
207kqueue_fork (EV_P) 178kqueue_fork (EV_P)
208{ 179{
209 close (kqueue_fd); 180 close (backend_fd);
210 181
211 while ((kqueue_fd = kqueue ()) < 0) 182 while ((backend_fd = kqueue ()) < 0)
212 syserr ("(libev) kqueue"); 183 syserr ("(libev) kqueue");
213 184
214 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); 185 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
215 186
216 /* re-register interest in fds */ 187 /* re-register interest in fds */
217 fd_rearm_all (EV_A); 188 fd_rearm_all (EV_A);
218} 189}
219 190

Diff Legend

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