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.18 by root, Thu Nov 22 15:40:56 2007 UTC vs.
Revision 1.41 by root, Wed Jan 13 12:44:33 2010 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>
33#include <sys/event.h> 42#include <sys/event.h>
34#include <string.h> 43#include <string.h>
35#include <errno.h> 44#include <errno.h>
36 45
37static void 46void inline_speed
38kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) 47kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
39{ 48{
40 struct kevent *ke;
41
42 ++kqueue_changecnt; 49 ++kqueue_changecnt;
43 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); 50 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);
44 51
45 ke = &kqueue_changes [kqueue_changecnt - 1]; 52 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} 53}
52 54
53#ifndef NOTE_EOF 55#ifndef NOTE_EOF
54# define NOTE_EOF 0 56# define NOTE_EOF 0
55#endif 57#endif
56 58
57static void 59static void
58kqueue_modify (EV_P_ int fd, int oev, int nev) 60kqueue_modify (EV_P_ int fd, int oev, int nev)
59{ 61{
62 if (oev != nev)
63 {
64 if (oev & EV_READ)
65 kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0);
66
67 if (oev & EV_WRITE)
68 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0);
69 }
70
60 /* to detect close/reopen reliably, we have to remove and re-add */ 71 /* to detect close/reopen reliably, we have to re-add */
61 /* event requests even when oev == nev */ 72 /* event requests even when oev == nev */
62 73
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) 74 if (nev & EV_READ)
70 kqueue_change (EV_A_ fd, EVFILT_READ, EV_ADD, NOTE_EOF); 75 kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF);
71 76
72 if (nev & EV_WRITE) 77 if (nev & EV_WRITE)
73 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); 78 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF);
74} 79}
75 80
… …
81 86
82 /* need to resize so there is enough space for errors */ 87 /* need to resize so there is enough space for errors */
83 if (kqueue_changecnt > kqueue_eventmax) 88 if (kqueue_changecnt > kqueue_eventmax)
84 { 89 {
85 ev_free (kqueue_events); 90 ev_free (kqueue_events);
86 kqueue_eventmax = array_roundsize (struct kevent, kqueue_changecnt); 91 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
87 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 92 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
88 } 93 }
89 94
95 EV_RELEASE_CB;
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 fprintf (stderr, "to %ld:%09ld %f\n", ts.tv_sec, ts.tv_nsec, res);//D
93 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);
99 EV_ACQUIRE_CB;
94 kqueue_changecnt = 0; 100 kqueue_changecnt = 0;
95 101
96 if (res < 0) 102 if (expect_false (res < 0))
97 { 103 {
98 if (errno != EINTR) 104 if (errno != EINTR)
99 syserr ("(libev) kevent"); 105 ev_syserr ("(libev) kevent");
100 106
101 return; 107 return;
102 } 108 }
103 109
104 for (i = 0; i < res; ++i) 110 for (i = 0; i < res; ++i)
105 { 111 {
106 int fd = kqueue_events [i].ident; 112 int fd = kqueue_events [i].ident;
107 113
108 if (kqueue_events [i].flags & EV_ERROR) 114 if (expect_false (kqueue_events [i].flags & EV_ERROR))
109 { 115 {
110 int err = kqueue_events [i].data; 116 int err = kqueue_events [i].data;
111
112 /*
113 * errors that may happen
114 * EBADF happens when the file discriptor has been
115 * closed,
116 * ENOENT when the file descriptor was closed and
117 * then reopened.
118 * EINVAL for some reasons not understood; EINVAL
119 * should not be returned ever; but FreeBSD does :-\
120 */
121 117
122 /* we are only interested in errors for fds that we are interested in :) */ 118 /* we are only interested in errors for fds that we are interested in :) */
123 if (anfds [fd].events) 119 if (anfds [fd].events)
124 { 120 {
125 if (err == ENOENT) /* resubmit changes on ENOENT */ 121 if (err == ENOENT) /* resubmit changes on ENOENT */
… …
146 } 142 }
147 143
148 if (expect_false (res == kqueue_eventmax)) 144 if (expect_false (res == kqueue_eventmax))
149 { 145 {
150 ev_free (kqueue_events); 146 ev_free (kqueue_events);
151 kqueue_eventmax = array_roundsize (struct kevent, kqueue_eventmax << 1); 147 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
152 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 148 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
153 } 149 }
154} 150}
155 151
156static int 152int inline_size
157kqueue_init (EV_P_ int flags) 153kqueue_init (EV_P_ int flags)
158{ 154{
159 struct kevent ch, ev;
160
161 /* Initalize the kernel queue */ 155 /* Initalize the kernel queue */
162 if ((kqueue_fd = kqueue ()) < 0) 156 if ((backend_fd = kqueue ()) < 0)
163 return 0; 157 return 0;
164 158
165 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ 159 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
166 160
167 /* Check for Mac OS X kqueue bug. */ 161 backend_fudge = 0.;
168 ch.ident = -1; 162 backend_modify = kqueue_modify;
169 ch.filter = EVFILT_READ; 163 backend_poll = kqueue_poll;
170 ch.flags = EV_ADD;
171 164
172 /*
173 * If kqueue works, then kevent will succeed, and it will
174 * stick an error in ev. If kqueue is broken, then
175 * kevent will fail.
176 */
177 if (kevent (kqueue_fd, &ch, 1, &ev, 1, 0) != 1
178 || ev.ident != -1
179 || ev.flags != EV_ERROR)
180 {
181 /* detected broken kqueue */
182 close (kqueue_fd);
183 return 0;
184 }
185
186 method_fudge = 1e-3; /* needed to compensate for kevent returning early */
187 method_modify = kqueue_modify;
188 method_poll = kqueue_poll;
189
190 kqueue_eventmax = 64; /* intiial number of events receivable per poll */ 165 kqueue_eventmax = 64; /* initial number of events receivable per poll */
191 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 166 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
192 167
193 kqueue_changes = 0; 168 kqueue_changes = 0;
194 kqueue_changemax = 0; 169 kqueue_changemax = 0;
195 kqueue_changecnt = 0; 170 kqueue_changecnt = 0;
196 171
197 return EVMETHOD_KQUEUE; 172 return EVBACKEND_KQUEUE;
198} 173}
199 174
200static void 175void inline_size
201kqueue_destroy (EV_P) 176kqueue_destroy (EV_P)
202{ 177{
203 close (kqueue_fd);
204
205 ev_free (kqueue_events); 178 ev_free (kqueue_events);
206 ev_free (kqueue_changes); 179 ev_free (kqueue_changes);
207} 180}
208 181
209static void 182void inline_size
210kqueue_fork (EV_P) 183kqueue_fork (EV_P)
211{ 184{
212 close (kqueue_fd); 185 close (backend_fd);
213 186
214 while ((kqueue_fd = kqueue ()) < 0) 187 while ((backend_fd = kqueue ()) < 0)
215 syserr ("(libev) kqueue"); 188 ev_syserr ("(libev) kqueue");
216 189
217 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); 190 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
218 191
219 /* re-register interest in fds */ 192 /* re-register interest in fds */
220 fd_rearm_all (EV_A); 193 fd_rearm_all (EV_A);
221} 194}
222 195

Diff Legend

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