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

Diff Legend

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