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.30 by root, Sun Dec 9 03:51:19 2007 UTC

1
2/* 1/*
2 * libev kqueue backend
3 *
3 * Copyright 2007 Marc Alexander Lehmann <libev@schmorp.de> 4 * Copyright (c) 2007 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
8 * modification, are permitted provided that the following conditions 8 * modification, are permitted provided that the following conditions are
9 * are met: 9 * met:
10 * 10 *
11 * 1. Redistributions of source code must retain the above copyright 11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer. 12 * notice, this list of conditions and the following disclaimer.
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 * 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 * 13 *
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 14 * * Redistributions in binary form must reproduce the above
20 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 15 * copyright notice, this list of conditions and the following
21 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 16 * disclaimer in the documentation and/or other materials provided
22 * 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,
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (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
28 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 */ 30 */
30 31
31#include <sys/types.h> 32#include <sys/types.h>
32#include <sys/time.h> 33#include <sys/time.h>
33#include <sys/queue.h> 34#include <sys/queue.h>
34#include <sys/event.h> 35#include <sys/event.h>
35#include <string.h> 36#include <string.h>
36#include <errno.h> 37#include <errno.h>
37 38
38static int kq_fd; 39void inline_speed
39static struct kevent *kq_changes;
40static int kq_changemax, kq_changecnt;
41static struct kevent *kq_events;
42static int kq_eventmax;
43
44static void
45kqueue_change (int fd, int filter, int flags, int fflags) 40kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
46{ 41{
47 struct kevent *ke; 42 struct kevent *ke;
48 43
44 ++kqueue_changecnt;
49 array_needsize (kq_changes, kq_changemax, ++kq_changecnt, ); 45 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);
50 46
51 ke = &kq_changes [kq_changecnt - 1]; 47 EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0);
52 memset (ke, 0, sizeof (struct kevent)); 48}
53 ke->ident = fd; 49
54 ke->filter = filter; 50#ifndef NOTE_EOF
55 ke->flags = flags; 51# define NOTE_EOF 0
56 ke->fflags = fflags; 52#endif
53
54static void
55kqueue_modify (EV_P_ int fd, int oev, int nev)
56{
57 if (oev != nev)
58 {
59 if (oev & EV_READ)
60 kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0);
61
62 if (oev & EV_WRITE)
63 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0);
64 }
65
66 /* to detect close/reopen reliably, we have to re-add */
67 /* event requests even when oev == nev */
68
69 if (nev & EV_READ)
70 kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF);
71
72 if (nev & EV_WRITE)
73 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF);
57} 74}
58 75
59static void 76static 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) 77kqueue_poll (EV_P_ ev_tstamp timeout)
81{ 78{
82 int res, i; 79 int res, i;
83 struct timespec ts; 80 struct timespec ts;
84 81
82 /* need to resize so there is enough space for errors */
83 if (kqueue_changecnt > kqueue_eventmax)
84 {
85 ev_free (kqueue_events);
86 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
87 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
88 }
89
85 ts.tv_sec = (time_t)timeout; 90 ts.tv_sec = (time_t)timeout;
86 ts.tv_nsec = (long)(timeout - (ev_tstamp)ts.tv_sec) * 1e9; 91 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9);
87 res = kevent (kq_fd, kq_changes, kq_changecnt, kq_events, kq_eventmax, &ts); 92 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
88 kq_changecnt = 0; 93 kqueue_changecnt = 0;
89 94
90 if (res < 0) 95 if (expect_false (res < 0))
96 {
97 if (errno != EINTR)
98 syserr ("(libev) kevent");
99
91 return; 100 return;
101 }
92 102
93 for (i = 0; i < res; ++i) 103 for (i = 0; i < res; ++i)
94 { 104 {
105 int fd = kqueue_events [i].ident;
106
95 if (kq_events [i].flags & EV_ERROR) 107 if (expect_false (kqueue_events [i].flags & EV_ERROR))
96 { 108 {
97 /* 109 int err = kqueue_events [i].data;
98 * Error messages that can happen, when a delete fails. 110
99 * EBADF happens when the file discriptor has been 111 /* we are only interested in errors for fds that we are interested in :) */
100 * closed, 112 if (anfds [fd].events)
101 * ENOENT when the file discriptor was closed and 113 {
102 * then reopened. 114 if (err == ENOENT) /* resubmit changes on ENOENT */
103 * EINVAL for some reasons not understood; EINVAL 115 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
104 * should not be returned ever; but FreeBSD does :-\ 116 else if (err == EBADF) /* on EBADF, we re-check the fd */
105 * An error is also indicated when a callback deletes 117 {
106 * an event we are still processing. In that case 118 if (fd_valid (fd))
107 * the data field is set to ENOENT. 119 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
108 */ 120 else
109 if (events [i].data == EBADF) 121 fd_kill (EV_A_ fd);
110 fd_kill (events [i].ident); 122 }
123 else /* on all other errors, we error out on the fd */
124 fd_kill (EV_A_ fd);
125 }
111 } 126 }
112 else 127 else
113 event ( 128 fd_event (
114 events [i].ident, 129 EV_A_
130 fd,
115 events [i].filter == EVFILT_READ ? EV_READ 131 kqueue_events [i].filter == EVFILT_READ ? EV_READ
116 : events [i].filter == EVFILT_WRITE ? EV_WRITE 132 : kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE
117 : 0 133 : 0
118 ); 134 );
119 } 135 }
120 136
121 if (expect_false (res == kq_eventmax)) 137 if (expect_false (res == kqueue_eventmax))
122 { 138 {
123 free (kq_events); 139 ev_free (kqueue_events);
124 kq_eventmax = array_roundsize (kq_events, kq_eventmax << 1); 140 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
125 kq_events = malloc (sizeof (struct kevent) * kq_eventmax); 141 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
126 } 142 }
127} 143}
128 144
129static void 145int inline_size
130kqueue_init (struct event_base *base) 146kqueue_init (EV_P_ int flags)
131{ 147{
132 struct kevent ch, ev; 148 struct kevent ch, ev;
133 149
134 /* Initalize the kernel queue */ 150 /* Initalize the kernel queue */
135 if ((kq_fd = kqueue ()) < 0) 151 if ((backend_fd = kqueue ()) < 0)
136 return; 152 return 0;
137 153
138 /* Check for Mac OS X kqueue bug. */ 154 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 155
143 /* 156 backend_fudge = 1e-3; /* needed to compensate for kevent returning early */
144 * If kqueue works, then kevent will succeed, and it will 157 backend_modify = kqueue_modify;
145 * stick an error in events[0]. If kqueue is broken, then 158 backend_poll = kqueue_poll;
146 * kevent will fail.
147 */
148 if (kevent (kq_fd, &ch, 1, &ev, 1, 0) != 1
149 || ev.ident != -1
150 || ev.flags != EV_ERROR)
151 {
152 /* detected broken kqueue */
153 close (kq_fd);
154 return;
155 }
156 159
157 ev_method = EVMETHOD_KQUEUE; 160 kqueue_eventmax = 64; /* initial number of events receivable per poll */
158 method_fudge = 1e-3; /* needed to compensate for kevent returning early */ 161 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
159 method_modify = kq_modify;
160 method_poll = kq_poll;
161 162
162 kq_eventmax = 64; /* intiial number of events receivable per poll */ 163 kqueue_changes = 0;
163 kq_events = malloc (sizeof (struct kevent) * kq_eventmax); 164 kqueue_changemax = 0;
165 kqueue_changecnt = 0;
166
167 return EVBACKEND_KQUEUE;
164} 168}
165 169
170void inline_size
171kqueue_destroy (EV_P)
172{
173 ev_free (kqueue_events);
174 ev_free (kqueue_changes);
175}
176
177void inline_size
178kqueue_fork (EV_P)
179{
180 close (backend_fd);
181
182 while ((backend_fd = kqueue ()) < 0)
183 syserr ("(libev) kqueue");
184
185 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
186
187 /* re-register interest in fds */
188 fd_rearm_all (EV_A);
189}
190

Diff Legend

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