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.2 by root, Fri Nov 2 21:17:30 2007 UTC vs.
Revision 1.55 by root, Thu Jan 16 11:51:05 2014 UTC

1
2/* 1/*
2 * libev kqueue backend
3 *
3 * Copyright 2007 Marc Alexander Lehmann <libev@schmorp.de> 4 * Copyright (c) 2007,2008,2009,2010,2011,2012,2013 Marc Alexander Lehmann <libev@schmorp.de>
4 * Copyright 2000-2002 Niels Provos <provos@citi.umich.edu>
5 * All rights reserved. 5 * All rights reserved.
6 * 6 *
7 * Redistribution and use in source and binary forms, with or without 7 * Redistribution and use in source and binary forms, with or without modifica-
8 * modification, are permitted provided that the following conditions 8 * tion, are permitted provided that the following conditions are met:
9 * are met:
10 * 9 *
11 * 1. Redistributions of source code must retain the above copyright 10 * 1. Redistributions of source code must retain the above copyright notice,
12 * notice, this list of conditions and the following disclaimer. 11 * this list of conditions and the following disclaimer.
12 *
13 * 2. Redistributions in binary form must reproduce the above copyright 13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the 14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution. 15 * documentation and/or other materials provided with the distribution.
16 * 3. The name of the author may not be used to endorse or promote products
17 * derived from this software without specific prior written permission.
18 * 16 *
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
20 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
21 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
22 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
24 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 25 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
28 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 * OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Alternatively, the contents of this file may be used under the terms of
29 * the GNU General Public License ("GPL") version 2 or any later version,
30 * in which case the provisions of the GPL are applicable instead of
31 * the above. If you wish to allow the use of your version of this file
32 * only under the terms of the GPL and not to allow others to use your
33 * version of this file under the BSD license, indicate your decision
34 * by deleting the provisions above and replace them with the notice
35 * and other provisions required by the GPL. If you do not delete the
36 * provisions above, a recipient may use your version of this file under
37 * either the BSD or the GPL.
29 */ 38 */
30 39
31#include <sys/types.h> 40#include <sys/types.h>
32#include <sys/time.h> 41#include <sys/time.h>
33#include <sys/queue.h>
34#include <sys/event.h> 42#include <sys/event.h>
35#include <string.h> 43#include <string.h>
36#include <errno.h> 44#include <errno.h>
37 45
38static int kq_fd; 46void inline_speed
39static struct kevent *kq_changes; 47kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
40static int kq_changemax, kq_changecnt; 48{
41static struct kevent *kq_events; 49 ++kqueue_changecnt;
42static int kq_eventmax; 50 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);
51
52 EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0);
53}
54
55/* OS X at least needs this */
56#ifndef EV_ENABLE
57# define EV_ENABLE 0
58#endif
59#ifndef NOTE_EOF
60# define NOTE_EOF 0
61#endif
43 62
44static void 63static void
45kqueue_change (int fd, int filter, int flags, int fflags) 64kqueue_modify (EV_P_ int fd, int oev, int nev)
46{ 65{
47 struct kevent *ke; 66 if (oev != nev)
67 {
68 if (oev & EV_READ)
69 kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0);
48 70
49 array_needsize (kq_changes, kq_changemax, ++kq_changecnt, ); 71 if (oev & EV_WRITE)
72 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0);
73 }
50 74
51 ke = &kq_changes [kq_changecnt - 1]; 75 /* to detect close/reopen reliably, we have to re-add */
52 memset (ke, 0, sizeof (struct kevent)); 76 /* event requests even when oev == nev */
53 ke->ident = fd; 77
54 ke->filter = filter; 78 if (nev & EV_READ)
55 ke->flags = flags; 79 kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD | EV_ENABLE, NOTE_EOF);
56 ke->fflags = fflags; 80
81 if (nev & EV_WRITE)
82 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD | EV_ENABLE, NOTE_EOF);
57} 83}
58 84
59static void 85static void
60kqueue_modify (int fd, int oev, int nev)
61{
62 if ((oev ^ new) & EV_READ)
63 {
64 if (nev & EV_READ)
65 kqueue_change (fd, EVFILT_READ, EV_ADD, NOTE_EOF);
66 else
67 kqueue_change (fd, EVFILT_READ, EV_DELETE, 0);
68 }
69
70 if ((oev ^ new) & EV_WRITE)
71 {
72 if (nev & EV_WRITE)
73 kqueue_change (fd, EVFILT_WRITE, EV_ADD, NOTE_EOF);
74 else
75 kqueue_change (fd, EVFILT_WRITE, EV_DELETE, 0);
76 }
77}
78
79static void
80kqueue_poll (ev_tstamp timeout) 86kqueue_poll (EV_P_ ev_tstamp timeout)
81{ 87{
82 int res, i; 88 int res, i;
83 struct timespec ts; 89 struct timespec ts;
84 90
85 ts.tv_sec = (time_t)timeout; 91 /* need to resize so there is enough space for errors */
86 ts.tv_nsec = (long)(timeout - (ev_tstamp)ts.tv_sec) * 1e9; 92 if (kqueue_changecnt > kqueue_eventmax)
93 {
94 ev_free (kqueue_events);
95 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
96 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
97 }
98
99 EV_RELEASE_CB;
100 EV_TS_SET (ts, timeout);
87 res = kevent (kq_fd, kq_changes, kq_changecnt, kq_events, kq_eventmax, &ts); 101 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
102 EV_ACQUIRE_CB;
88 kq_changecnt = 0; 103 kqueue_changecnt = 0;
89 104
90 if (res < 0) 105 if (expect_false (res < 0))
106 {
107 if (errno != EINTR)
108 ev_syserr ("(libev) kevent");
109
91 return; 110 return;
111 }
92 112
93 for (i = 0; i < res; ++i) 113 for (i = 0; i < res; ++i)
94 { 114 {
115 int fd = kqueue_events [i].ident;
116
95 if (kq_events [i].flags & EV_ERROR) 117 if (expect_false (kqueue_events [i].flags & EV_ERROR))
96 { 118 {
97 /* 119 int err = kqueue_events [i].data;
98 * Error messages that can happen, when a delete fails. 120
99 * EBADF happens when the file discriptor has been 121 /* we are only interested in errors for fds that we are interested in :) */
100 * closed, 122 if (anfds [fd].events)
101 * ENOENT when the file discriptor was closed and
102 * then reopened.
103 * EINVAL for some reasons not understood; EINVAL
104 * should not be returned ever; but FreeBSD does :-\
105 * An error is also indicated when a callback deletes
106 * an event we are still processing. In that case
107 * the data field is set to ENOENT.
108 */ 123 {
109 if (events [i].data == EBADF) 124 if (err == ENOENT) /* resubmit changes on ENOENT */
110 fd_kill (events [i].ident); 125 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
126 else if (err == EBADF) /* on EBADF, we re-check the fd */
127 {
128 if (fd_valid (fd))
129 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
130 else
131 fd_kill (EV_A_ fd);
132 }
133 else /* on all other errors, we error out on the fd */
134 fd_kill (EV_A_ fd);
135 }
111 } 136 }
112 else 137 else
113 event ( 138 fd_event (
114 events [i].ident, 139 EV_A_
140 fd,
115 events [i].filter == EVFILT_READ ? EV_READ 141 kqueue_events [i].filter == EVFILT_READ ? EV_READ
116 : events [i].filter == EVFILT_WRITE ? EV_WRITE 142 : kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE
117 : 0 143 : 0
118 ); 144 );
119 } 145 }
120 146
121 if (expect_false (res == kq_eventmax)) 147 if (expect_false (res == kqueue_eventmax))
122 { 148 {
123 free (kq_events); 149 ev_free (kqueue_events);
124 kq_eventmax = array_roundsize (kq_events, kq_eventmax << 1); 150 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
125 kq_events = malloc (sizeof (struct kevent) * kq_eventmax); 151 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
126 } 152 }
127} 153}
128 154
129static void 155int inline_size
130kqueue_init (struct event_base *base) 156kqueue_init (EV_P_ int flags)
131{ 157{
132 struct kevent ch, ev;
133
134 /* Initalize the kernel queue */ 158 /* initialize the kernel queue */
159 kqueue_fd_pid = getpid ();
135 if ((kq_fd = kqueue ()) < 0) 160 if ((backend_fd = kqueue ()) < 0)
136 return; 161 return 0;
137 162
138 /* Check for Mac OS X kqueue bug. */ 163 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
139 ch.ident = -1;
140 ch.filter = EVFILT_READ;
141 ch.flags = EV_ADD;
142 164
143 /* 165 backend_mintime = 1e-9; /* apparently, they did the right thing in freebsd */
144 * If kqueue works, then kevent will succeed, and it will 166 backend_modify = kqueue_modify;
145 * stick an error in events[0]. If kqueue is broken, then 167 backend_poll = kqueue_poll;
146 * kevent will fail. 168
169 kqueue_eventmax = 64; /* initial number of events receivable per poll */
170 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
171
172 kqueue_changes = 0;
173 kqueue_changemax = 0;
174 kqueue_changecnt = 0;
175
176 return EVBACKEND_KQUEUE;
177}
178
179void inline_size
180kqueue_destroy (EV_P)
181{
182 ev_free (kqueue_events);
183 ev_free (kqueue_changes);
184}
185
186void inline_size
187kqueue_fork (EV_P)
188{
189 /* some BSD kernels don't just destroy the kqueue itself,
190 * but also close the fd, which isn't documented, and
191 * impossible to support properly.
192 * we remember the pid of the kqueue call and only close
193 * the fd if the pid is still the same.
194 * this leaks fds on sane kernels, but BSD interfaces are
195 * notoriously buggy and rarely get fixed.
147 */ 196 */
148 if (kevent (kq_fd, &ch, 1, &ev, 1, 0) != 1 197 pid_t newpid = getpid ();
149 || ev.ident != -1 198
150 || ev.flags != EV_ERROR) 199 if (newpid == kqueue_fd_pid)
151 {
152 /* detected broken kqueue */
153 close (kq_fd); 200 close (backend_fd);
154 return;
155 }
156 201
157 ev_method = EVMETHOD_KQUEUE; 202 kqueue_fd_pid = newpid;
158 method_fudge = 1e-3; /* needed to compensate for kevent returning early */ 203 while ((backend_fd = kqueue ()) < 0)
159 method_modify = kq_modify; 204 ev_syserr ("(libev) kqueue");
160 method_poll = kq_poll;
161 205
162 kq_eventmax = 64; /* intiial number of events receivable per poll */ 206 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
163 kq_events = malloc (sizeof (struct kevent) * kq_eventmax);
164}
165 207
208 /* re-register interest in fds */
209 fd_rearm_all (EV_A);
210}
211
212/* sys/event.h defines EV_ERROR */
213#undef EV_ERROR
214

Diff Legend

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