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.22 by root, Fri Nov 23 05:28:17 2007 UTC vs.
Revision 1.28 by root, Wed Dec 5 13:54:37 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;
43 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); 45 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);
44 46
45 ke = &kqueue_changes [kqueue_changecnt - 1]; 47 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} 48}
52 49
53#ifndef NOTE_EOF 50#ifndef NOTE_EOF
54# define NOTE_EOF 0 51# define NOTE_EOF 0
55#endif 52#endif
… …
84 81
85 /* need to resize so there is enough space for errors */ 82 /* need to resize so there is enough space for errors */
86 if (kqueue_changecnt > kqueue_eventmax) 83 if (kqueue_changecnt > kqueue_eventmax)
87 { 84 {
88 ev_free (kqueue_events); 85 ev_free (kqueue_events);
89 kqueue_eventmax = array_roundsize (struct kevent, kqueue_changecnt); 86 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
90 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 87 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
91 } 88 }
92 89
93 ts.tv_sec = (time_t)timeout; 90 ts.tv_sec = (time_t)timeout;
94 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9); 91 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9);
95 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);
96 kqueue_changecnt = 0; 93 kqueue_changecnt = 0;
97 94
98 if (res < 0) 95 if (res < 0)
99 { 96 {
100 if (errno != EINTR) 97 if (errno != EINTR)
… …
105 102
106 for (i = 0; i < res; ++i) 103 for (i = 0; i < res; ++i)
107 { 104 {
108 int fd = kqueue_events [i].ident; 105 int fd = kqueue_events [i].ident;
109 106
110 if (kqueue_events [i].flags & EV_ERROR) 107 if (expect_false (kqueue_events [i].flags & EV_ERROR))
111 { 108 {
112 int err = kqueue_events [i].data; 109 int err = kqueue_events [i].data;
113
114 /*
115 * errors that may happen
116 * EBADF happens when the file discriptor has been
117 * closed,
118 * ENOENT when the file descriptor was closed and
119 * then reopened.
120 * EINVAL for some reasons not understood; EINVAL
121 * should not be returned ever; but FreeBSD does :-\
122 */
123 110
124 /* 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 :) */
125 if (anfds [fd].events) 112 if (anfds [fd].events)
126 { 113 {
127 if (err == ENOENT) /* resubmit changes on ENOENT */ 114 if (err == ENOENT) /* resubmit changes on ENOENT */
… …
148 } 135 }
149 136
150 if (expect_false (res == kqueue_eventmax)) 137 if (expect_false (res == kqueue_eventmax))
151 { 138 {
152 ev_free (kqueue_events); 139 ev_free (kqueue_events);
153 kqueue_eventmax = array_roundsize (struct kevent, kqueue_eventmax << 1); 140 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
154 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 141 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
155 } 142 }
156} 143}
157 144
158static int 145int inline_size
159kqueue_init (EV_P_ int flags) 146kqueue_init (EV_P_ int flags)
160{ 147{
161 struct kevent ch, ev; 148 struct kevent ch, ev;
162 149
163 /* Initalize the kernel queue */ 150 /* Initalize the kernel queue */
164 if ((kqueue_fd = kqueue ()) < 0) 151 if ((backend_fd = kqueue ()) < 0)
165 return 0; 152 return 0;
166 153
167 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 */
168 155
169 /* Check for Mac OS X kqueue bug. */ 156 /* fudge *might* be zero from the documentation, but bsd docs are notoriously wrong */
170 ch.ident = -1;
171 ch.filter = EVFILT_READ;
172 ch.flags = EV_ADD;
173
174 /*
175 * If kqueue works, then kevent will succeed, and it will
176 * stick an error in ev. If kqueue is broken, then
177 * kevent will fail.
178 */
179 if (kevent (kqueue_fd, &ch, 1, &ev, 1, 0) != 1
180 || ev.ident != -1
181 || ev.flags != EV_ERROR)
182 {
183 /* detected broken kqueue */
184 close (kqueue_fd);
185 return 0;
186 }
187
188 backend_fudge = 1e-3; /* needed to compensate for kevent returning early */ 157 backend_fudge = 1e-3; /* needed to compensate for kevent returning early */
189 backend_modify = kqueue_modify; 158 backend_modify = kqueue_modify;
190 backend_poll = kqueue_poll; 159 backend_poll = kqueue_poll;
191 160
192 kqueue_eventmax = 64; /* intiial number of events receivable per poll */ 161 kqueue_eventmax = 64; /* initial number of events receivable per poll */
193 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 162 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
194 163
195 kqueue_changes = 0; 164 kqueue_changes = 0;
196 kqueue_changemax = 0; 165 kqueue_changemax = 0;
197 kqueue_changecnt = 0; 166 kqueue_changecnt = 0;
198 167
199 return EVBACKEND_KQUEUE; 168 return EVBACKEND_KQUEUE;
200} 169}
201 170
202static void 171void inline_size
203kqueue_destroy (EV_P) 172kqueue_destroy (EV_P)
204{ 173{
205 close (kqueue_fd);
206
207 ev_free (kqueue_events); 174 ev_free (kqueue_events);
208 ev_free (kqueue_changes); 175 ev_free (kqueue_changes);
209} 176}
210 177
211static void 178void inline_size
212kqueue_fork (EV_P) 179kqueue_fork (EV_P)
213{ 180{
214 close (kqueue_fd); 181 close (backend_fd);
215 182
216 while ((kqueue_fd = kqueue ()) < 0) 183 while ((backend_fd = kqueue ()) < 0)
217 syserr ("(libev) kqueue"); 184 syserr ("(libev) kqueue");
218 185
219 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); 186 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
220 187
221 /* re-register interest in fds */ 188 /* re-register interest in fds */
222 fd_rearm_all (EV_A); 189 fd_rearm_all (EV_A);
223} 190}
224 191

Diff Legend

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