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.12 by root, Tue Nov 6 17:09:45 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; 42 ++kqueue_changecnt;
43 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);
41 44
42 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, ++kqueue_changecnt, ); 45 EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0);
43
44 ke = &kqueue_changes [kqueue_changecnt - 1];
45 memset (ke, 0, sizeof (struct kevent));
46 ke->ident = fd;
47 ke->filter = filter;
48 ke->flags = flags;
49 ke->fflags = fflags;
50} 46}
51 47
52#ifndef NOTE_EOF 48#ifndef NOTE_EOF
53# define NOTE_EOF 0 49# define NOTE_EOF 0
54#endif 50#endif
55 51
56static void 52static void
57kqueue_modify (EV_P_ int fd, int oev, int nev) 53kqueue_modify (EV_P_ int fd, int oev, int nev)
58{ 54{
59 if ((oev ^ nev) & EV_READ) 55 if (oev != nev)
60 { 56 {
61 if (nev & EV_READ) 57 if (oev & EV_READ)
62 kqueue_change (fd, EVFILT_READ, EV_ADD, NOTE_EOF);
63 else
64 kqueue_change (fd, EVFILT_READ, EV_DELETE, 0); 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);
65 } 62 }
66 63
67 if ((oev ^ nev) & EV_WRITE) 64 /* to detect close/reopen reliably, we have to re-add */
68 { 65 /* event requests even when oev == nev */
66
67 if (nev & EV_READ)
68 kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF);
69
69 if (nev & EV_WRITE) 70 if (nev & EV_WRITE)
70 kqueue_change (fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); 71 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF);
71 else
72 kqueue_change (fd, EVFILT_WRITE, EV_DELETE, 0);
73 }
74} 72}
75 73
76static void 74static void
77kqueue_poll (EV_P_ ev_tstamp timeout) 75kqueue_poll (EV_P_ ev_tstamp timeout)
78{ 76{
79 int res, i; 77 int res, i;
80 struct timespec ts; 78 struct timespec ts;
81 79
80 /* need to resize so there is enough space for errors */
81 if (kqueue_changecnt > kqueue_eventmax)
82 {
83 ev_free (kqueue_events);
84 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
85 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
86 }
87
82 ts.tv_sec = (time_t)timeout; 88 ts.tv_sec = (time_t)timeout;
83 ts.tv_nsec = (long)(timeout - (ev_tstamp)ts.tv_sec) * 1e9; 89 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9);
84 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);
85 kqueue_changecnt = 0; 91 kqueue_changecnt = 0;
86 92
87 if (res < 0) 93 if (expect_false (res < 0))
88 { 94 {
89 if (errno != EINTR) 95 if (errno != EINTR)
90 syserr ("(libev) kevent"); 96 syserr ("(libev) kevent");
91 97
92 return; 98 return;
93 } 99 }
94 100
95 for (i = 0; i < res; ++i) 101 for (i = 0; i < res; ++i)
96 { 102 {
103 int fd = kqueue_events [i].ident;
104
97 if (kqueue_events [i].flags & EV_ERROR) 105 if (expect_false (kqueue_events [i].flags & EV_ERROR))
98 { 106 {
99 /* 107 int err = kqueue_events [i].data;
100 * Error messages that can happen, when a delete fails. 108
101 * EBADF happens when the file discriptor has been 109 /* we are only interested in errors for fds that we are interested in :) */
102 * closed, 110 if (anfds [fd].events)
103 * ENOENT when the file discriptor was closed and 111 {
104 * then reopened. 112 if (err == ENOENT) /* resubmit changes on ENOENT */
105 * EINVAL for some reasons not understood; EINVAL 113 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
106 * should not be returned ever; but FreeBSD does :-\ 114 else if (err == EBADF) /* on EBADF, we re-check the fd */
107 * An error is also indicated when a callback deletes 115 {
108 * an event we are still processing. In that case 116 if (fd_valid (fd))
109 * the data field is set to ENOENT. 117 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
110 */ 118 else
111 if (kqueue_events [i].data == EBADF) 119 fd_kill (EV_A_ fd);
112 fd_kill (EV_A_ kqueue_events [i].ident); 120 }
121 else /* on all other errors, we error out on the fd */
122 fd_kill (EV_A_ fd);
123 }
113 } 124 }
114 else 125 else
115 fd_event ( 126 fd_event (
116 EV_A_ 127 EV_A_
117 kqueue_events [i].ident, 128 fd,
118 kqueue_events [i].filter == EVFILT_READ ? EV_READ 129 kqueue_events [i].filter == EVFILT_READ ? EV_READ
119 : kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE 130 : kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE
120 : 0 131 : 0
121 ); 132 );
122 } 133 }
123 134
124 if (expect_false (res == kqueue_eventmax)) 135 if (expect_false (res == kqueue_eventmax))
125 { 136 {
126 ev_free (kqueue_events); 137 ev_free (kqueue_events);
127 kqueue_eventmax = array_roundsize (kqueue_events, kqueue_eventmax << 1); 138 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
128 kqueue_events = ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 139 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
129 } 140 }
130} 141}
131 142
132static int 143int inline_size
133kqueue_init (EV_P_ int flags) 144kqueue_init (EV_P_ int flags)
134{ 145{
135 struct kevent ch, ev;
136
137 /* Initalize the kernel queue */ 146 /* Initalize the kernel queue */
138 if ((kqueue_fd = kqueue ()) < 0) 147 if ((backend_fd = kqueue ()) < 0)
139 return 0; 148 return 0;
140 149
141 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 */
142 151
143 /* Check for Mac OS X kqueue bug. */ 152 backend_fudge = 0.;
144 ch.ident = -1; 153 backend_modify = kqueue_modify;
145 ch.filter = EVFILT_READ; 154 backend_poll = kqueue_poll;
146 ch.flags = EV_ADD;
147 155
148 /*
149 * If kqueue works, then kevent will succeed, and it will
150 * stick an error in ev. If kqueue is broken, then
151 * kevent will fail.
152 */
153 if (kevent (kqueue_fd, &ch, 1, &ev, 1, 0) != 1
154 || ev.ident != -1
155 || ev.flags != EV_ERROR)
156 {
157 /* detected broken kqueue */
158 close (kqueue_fd);
159 return 0;
160 }
161
162 method_fudge = 1e-3; /* needed to compensate for kevent returning early */
163 method_modify = kqueue_modify;
164 method_poll = kqueue_poll;
165
166 kqueue_eventmax = 64; /* intiial number of events receivable per poll */ 156 kqueue_eventmax = 64; /* initial number of events receivable per poll */
167 kqueue_events = ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 157 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
168 158
169 kqueue_changes = 0; 159 kqueue_changes = 0;
170 kqueue_changemax = 0; 160 kqueue_changemax = 0;
171 kqueue_changecnt = 0; 161 kqueue_changecnt = 0;
172 162
173 return EVMETHOD_KQUEUE; 163 return EVBACKEND_KQUEUE;
174} 164}
175 165
176static void 166void inline_size
177kqueue_destroy (EV_P) 167kqueue_destroy (EV_P)
178{ 168{
179 close (kqueue_fd);
180
181 ev_free (kqueue_events); 169 ev_free (kqueue_events);
182 ev_free (kqueue_changes); 170 ev_free (kqueue_changes);
183} 171}
184 172
185static void 173void inline_size
186kqueue_fork (EV_P) 174kqueue_fork (EV_P)
187{ 175{
188 close (kqueue_fd); 176 close (backend_fd);
189 177
190 while ((kqueue_fd = kqueue ()) < 0) 178 while ((backend_fd = kqueue ()) < 0)
191 syserr ("(libev) kqueue"); 179 syserr ("(libev) kqueue");
192 180
193 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); 181 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
194 182
195 /* re-register interest in fds */ 183 /* re-register interest in fds */
196 fd_rearm_all (EV_A); 184 fd_rearm_all (EV_A);
197} 185}
198 186

Diff Legend

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