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

Diff Legend

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