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.32 by ayin, Mon Dec 17 11:54:29 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;
41
42 ++kqueue_changecnt; 42 ++kqueue_changecnt;
43 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); 43 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);
44 44
45 ke = &kqueue_changes [kqueue_changecnt - 1]; 45 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} 46}
52 47
53#ifndef NOTE_EOF 48#ifndef NOTE_EOF
54# define NOTE_EOF 0 49# define NOTE_EOF 0
55#endif 50#endif
56 51
57static void 52static void
58kqueue_modify (EV_P_ int fd, int oev, int nev) 53kqueue_modify (EV_P_ int fd, int oev, int nev)
59{ 54{
55 if (oev != nev)
56 {
57 if (oev & EV_READ)
58 kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0);
59
60 if (oev & EV_WRITE)
61 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0);
62 }
63
60 /* to detect close/reopen reliably, we have to remove and re-add */ 64 /* to detect close/reopen reliably, we have to re-add */
61 /* event requests even when oev == nev */ 65 /* event requests even when oev == nev */
62 66
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) 67 if (nev & EV_READ)
70 kqueue_change (EV_A_ fd, EVFILT_READ, EV_ADD, NOTE_EOF); 68 kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF);
71 69
72 if (nev & EV_WRITE) 70 if (nev & EV_WRITE)
73 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); 71 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF);
74} 72}
75 73
… …
81 79
82 /* need to resize so there is enough space for errors */ 80 /* need to resize so there is enough space for errors */
83 if (kqueue_changecnt > kqueue_eventmax) 81 if (kqueue_changecnt > kqueue_eventmax)
84 { 82 {
85 ev_free (kqueue_events); 83 ev_free (kqueue_events);
86 kqueue_eventmax = array_roundsize (struct kevent, kqueue_changecnt); 84 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
87 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 85 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
88 } 86 }
89 87
90 ts.tv_sec = (time_t)timeout; 88 ts.tv_sec = (time_t)timeout;
91 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9); 89 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); 90 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
94 kqueue_changecnt = 0; 91 kqueue_changecnt = 0;
95 92
96 if (res < 0) 93 if (expect_false (res < 0))
97 { 94 {
98 if (errno != EINTR) 95 if (errno != EINTR)
99 syserr ("(libev) kevent"); 96 syserr ("(libev) kevent");
100 97
101 return; 98 return;
… …
103 100
104 for (i = 0; i < res; ++i) 101 for (i = 0; i < res; ++i)
105 { 102 {
106 int fd = kqueue_events [i].ident; 103 int fd = kqueue_events [i].ident;
107 104
108 if (kqueue_events [i].flags & EV_ERROR) 105 if (expect_false (kqueue_events [i].flags & EV_ERROR))
109 { 106 {
110 int err = kqueue_events [i].data; 107 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 108
122 /* we are only interested in errors for fds that we are interested in :) */ 109 /* we are only interested in errors for fds that we are interested in :) */
123 if (anfds [fd].events) 110 if (anfds [fd].events)
124 { 111 {
125 if (err == ENOENT) /* resubmit changes on ENOENT */ 112 if (err == ENOENT) /* resubmit changes on ENOENT */
… …
146 } 133 }
147 134
148 if (expect_false (res == kqueue_eventmax)) 135 if (expect_false (res == kqueue_eventmax))
149 { 136 {
150 ev_free (kqueue_events); 137 ev_free (kqueue_events);
151 kqueue_eventmax = array_roundsize (struct kevent, kqueue_eventmax << 1); 138 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
152 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 139 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
153 } 140 }
154} 141}
155 142
156static int 143int inline_size
157kqueue_init (EV_P_ int flags) 144kqueue_init (EV_P_ int flags)
158{ 145{
159 struct kevent ch, ev;
160
161 /* Initalize the kernel queue */ 146 /* Initalize the kernel queue */
162 if ((kqueue_fd = kqueue ()) < 0) 147 if ((backend_fd = kqueue ()) < 0)
163 return 0; 148 return 0;
164 149
165 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ 150 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
166 151
167 /* Check for Mac OS X kqueue bug. */ 152 backend_fudge = 0.;
168 ch.ident = -1; 153 backend_modify = kqueue_modify;
169 ch.filter = EVFILT_READ; 154 backend_poll = kqueue_poll;
170 ch.flags = EV_ADD;
171 155
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 */ 156 kqueue_eventmax = 64; /* initial number of events receivable per poll */
191 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 157 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
192 158
193 kqueue_changes = 0; 159 kqueue_changes = 0;
194 kqueue_changemax = 0; 160 kqueue_changemax = 0;
195 kqueue_changecnt = 0; 161 kqueue_changecnt = 0;
196 162
197 return EVMETHOD_KQUEUE; 163 return EVBACKEND_KQUEUE;
198} 164}
199 165
200static void 166void inline_size
201kqueue_destroy (EV_P) 167kqueue_destroy (EV_P)
202{ 168{
203 close (kqueue_fd);
204
205 ev_free (kqueue_events); 169 ev_free (kqueue_events);
206 ev_free (kqueue_changes); 170 ev_free (kqueue_changes);
207} 171}
208 172
209static void 173void inline_size
210kqueue_fork (EV_P) 174kqueue_fork (EV_P)
211{ 175{
212 close (kqueue_fd); 176 close (backend_fd);
213 177
214 while ((kqueue_fd = kqueue ()) < 0) 178 while ((backend_fd = kqueue ()) < 0)
215 syserr ("(libev) kqueue"); 179 syserr ("(libev) kqueue");
216 180
217 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); 181 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
218 182
219 /* re-register interest in fds */ 183 /* re-register interest in fds */
220 fd_rearm_all (EV_A); 184 fd_rearm_all (EV_A);
221} 185}
222 186

Diff Legend

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