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.40 by root, Sun Jul 19 04:11:27 2009 UTC

1/* 1/*
2 * libev kqueue backend
3 *
2 * Copyright 2007 Marc Alexander Lehmann <libev@schmorp.de> 4 * Copyright (c) 2007,2008,2009 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
… …
84 87
85 /* need to resize so there is enough space for errors */ 88 /* need to resize so there is enough space for errors */
86 if (kqueue_changecnt > kqueue_eventmax) 89 if (kqueue_changecnt > kqueue_eventmax)
87 { 90 {
88 ev_free (kqueue_events); 91 ev_free (kqueue_events);
89 kqueue_eventmax = array_roundsize (struct kevent, kqueue_changecnt); 92 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
90 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 93 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
91 } 94 }
92 95
96 EV_RELEASE_CB;
93 ts.tv_sec = (time_t)timeout; 97 ts.tv_sec = (time_t)timeout;
94 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9); 98 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); 99 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
100 EV_ACQUIRE_CB;
96 kqueue_changecnt = 0; 101 kqueue_changecnt = 0;
97 102
98 if (res < 0) 103 if (expect_false (res < 0))
99 { 104 {
100 if (errno != EINTR) 105 if (errno != EINTR)
101 syserr ("(libev) kevent"); 106 ev_syserr ("(libev) kevent");
102 107
103 return; 108 return;
104 } 109 }
105 110
106 for (i = 0; i < res; ++i) 111 for (i = 0; i < res; ++i)
107 { 112 {
108 int fd = kqueue_events [i].ident; 113 int fd = kqueue_events [i].ident;
109 114
110 if (kqueue_events [i].flags & EV_ERROR) 115 if (expect_false (kqueue_events [i].flags & EV_ERROR))
111 { 116 {
112 int err = kqueue_events [i].data; 117 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 118
124 /* we are only interested in errors for fds that we are interested in :) */ 119 /* we are only interested in errors for fds that we are interested in :) */
125 if (anfds [fd].events) 120 if (anfds [fd].events)
126 { 121 {
127 if (err == ENOENT) /* resubmit changes on ENOENT */ 122 if (err == ENOENT) /* resubmit changes on ENOENT */
… …
148 } 143 }
149 144
150 if (expect_false (res == kqueue_eventmax)) 145 if (expect_false (res == kqueue_eventmax))
151 { 146 {
152 ev_free (kqueue_events); 147 ev_free (kqueue_events);
153 kqueue_eventmax = array_roundsize (struct kevent, kqueue_eventmax << 1); 148 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
154 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 149 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
155 } 150 }
156} 151}
157 152
158static int 153int inline_size
159kqueue_init (EV_P_ int flags) 154kqueue_init (EV_P_ int flags)
160{ 155{
161 struct kevent ch, ev;
162
163 /* Initalize the kernel queue */ 156 /* Initalize the kernel queue */
164 if ((kqueue_fd = kqueue ()) < 0) 157 if ((backend_fd = kqueue ()) < 0)
165 return 0; 158 return 0;
166 159
167 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ 160 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
168 161
169 /* Check for Mac OS X kqueue bug. */ 162 backend_fudge = 0.;
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 */
189 backend_modify = kqueue_modify; 163 backend_modify = kqueue_modify;
190 backend_poll = kqueue_poll; 164 backend_poll = kqueue_poll;
191 165
192 kqueue_eventmax = 64; /* intiial number of events receivable per poll */ 166 kqueue_eventmax = 64; /* initial number of events receivable per poll */
193 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 167 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
194 168
195 kqueue_changes = 0; 169 kqueue_changes = 0;
196 kqueue_changemax = 0; 170 kqueue_changemax = 0;
197 kqueue_changecnt = 0; 171 kqueue_changecnt = 0;
198 172
199 return EVBACKEND_KQUEUE; 173 return EVBACKEND_KQUEUE;
200} 174}
201 175
202static void 176void inline_size
203kqueue_destroy (EV_P) 177kqueue_destroy (EV_P)
204{ 178{
205 close (kqueue_fd);
206
207 ev_free (kqueue_events); 179 ev_free (kqueue_events);
208 ev_free (kqueue_changes); 180 ev_free (kqueue_changes);
209} 181}
210 182
211static void 183void inline_size
212kqueue_fork (EV_P) 184kqueue_fork (EV_P)
213{ 185{
214 close (kqueue_fd); 186 close (backend_fd);
215 187
216 while ((kqueue_fd = kqueue ()) < 0) 188 while ((backend_fd = kqueue ()) < 0)
217 syserr ("(libev) kqueue"); 189 ev_syserr ("(libev) kqueue");
218 190
219 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); 191 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
220 192
221 /* re-register interest in fds */ 193 /* re-register interest in fds */
222 fd_rearm_all (EV_A); 194 fd_rearm_all (EV_A);
223} 195}
224 196

Diff Legend

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