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.4 by root, Sat Nov 3 16:23:11 2007 UTC vs.
Revision 1.45 by sf-exg, Sat Jul 31 23:00:11 2010 UTC

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

Diff Legend

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