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.26 by root, Mon Nov 26 08:04:03 2007 UTC vs.
Revision 1.43 by root, Sat Mar 27 02:41:13 2010 UTC

1/* 1/*
2 * libev kqueue backend 2 * libev kqueue backend
3 * 3 *
4 * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> 4 * Copyright (c) 2007,2008,2009,2010 Marc Alexander Lehmann <libev@schmorp.de>
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 are 8 * tion, are permitted provided that the following conditions are met:
9 * 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.
10 * 27 *
11 * * Redistributions of source code must retain the above copyright 28 * Alternatively, the contents of this file may be used under the terms of
12 * notice, this list of conditions and the following disclaimer. 29 * the GNU General Public License ("GPL") version 2 or any later version,
13 * 30 * in which case the provisions of the GPL are applicable instead of
14 * * Redistributions in binary form must reproduce the above 31 * the above. If you wish to allow the use of your version of this file
15 * copyright notice, this list of conditions and the following 32 * only under the terms of the GPL and not to allow others to use your
16 * disclaimer in the documentation and/or other materials provided 33 * version of this file under the BSD license, indicate your decision
17 * with the distribution. 34 * by deleting the provisions above and replace them with the notice
18 * 35 * and other provisions required by the GPL. If you do not delete the
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 36 * provisions above, a recipient may use your version of this file under
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 37 * either the BSD or the GPL.
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,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 */ 38 */
31 39
32#include <sys/types.h> 40#include <sys/types.h>
33#include <sys/time.h> 41#include <sys/time.h>
34#include <sys/queue.h>
35#include <sys/event.h> 42#include <sys/event.h>
36#include <string.h> 43#include <string.h>
37#include <errno.h> 44#include <errno.h>
38 45
39static void 46void inline_speed
40kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) 47kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
41{ 48{
42 struct kevent *ke;
43
44 ++kqueue_changecnt; 49 ++kqueue_changecnt;
45 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); 50 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);
46 51
47 EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0); 52 EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0);
48} 53}
49 54
55/* OS X at least needs this */
56#ifndef EV_ENABLE
57# define EV_ENABLE 0
58#endif
50#ifndef NOTE_EOF 59#ifndef NOTE_EOF
51# define NOTE_EOF 0 60# define NOTE_EOF 0
52#endif 61#endif
53 62
54static void 63static void
… …
65 74
66 /* to detect close/reopen reliably, we have to re-add */ 75 /* to detect close/reopen reliably, we have to re-add */
67 /* event requests even when oev == nev */ 76 /* event requests even when oev == nev */
68 77
69 if (nev & EV_READ) 78 if (nev & EV_READ)
70 kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF); 79 kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD | EV_ENABLE, NOTE_EOF);
71 80
72 if (nev & EV_WRITE) 81 if (nev & EV_WRITE)
73 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); 82 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD | EV_ENABLE, NOTE_EOF);
74} 83}
75 84
76static void 85static void
77kqueue_poll (EV_P_ ev_tstamp timeout) 86kqueue_poll (EV_P_ ev_tstamp timeout)
78{ 87{
… …
81 90
82 /* need to resize so there is enough space for errors */ 91 /* need to resize so there is enough space for errors */
83 if (kqueue_changecnt > kqueue_eventmax) 92 if (kqueue_changecnt > kqueue_eventmax)
84 { 93 {
85 ev_free (kqueue_events); 94 ev_free (kqueue_events);
86 kqueue_eventmax = array_roundsize (struct kevent, kqueue_changecnt); 95 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
87 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 96 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
88 } 97 }
89 98
99 EV_RELEASE_CB;
90 ts.tv_sec = (time_t)timeout; 100 ts.tv_sec = (time_t)timeout;
91 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9); 101 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9);
92 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts); 102 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
103 EV_ACQUIRE_CB;
93 kqueue_changecnt = 0; 104 kqueue_changecnt = 0;
94 105
95 if (res < 0) 106 if (expect_false (res < 0))
96 { 107 {
97 if (errno != EINTR) 108 if (errno != EINTR)
98 syserr ("(libev) kevent"); 109 ev_syserr ("(libev) kevent");
99 110
100 return; 111 return;
101 } 112 }
102 113
103 for (i = 0; i < res; ++i) 114 for (i = 0; i < res; ++i)
… …
135 } 146 }
136 147
137 if (expect_false (res == kqueue_eventmax)) 148 if (expect_false (res == kqueue_eventmax))
138 { 149 {
139 ev_free (kqueue_events); 150 ev_free (kqueue_events);
140 kqueue_eventmax = array_roundsize (struct kevent, kqueue_eventmax << 1); 151 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
141 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 152 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
142 } 153 }
143} 154}
144 155
145static int 156int inline_size
146kqueue_init (EV_P_ int flags) 157kqueue_init (EV_P_ int flags)
147{ 158{
148 struct kevent ch, ev;
149
150 /* Initalize the kernel queue */ 159 /* Initalize the kernel queue */
151 if ((backend_fd = kqueue ()) < 0) 160 if ((backend_fd = kqueue ()) < 0)
152 return 0; 161 return 0;
153 162
154 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ 163 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
155 164
156 /* fudge *might* be zero from the documentation, but bsd docs are notoriously wrong */ 165 backend_fudge = 0.;
157 backend_fudge = 1e-3; /* needed to compensate for kevent returning early */
158 backend_modify = kqueue_modify; 166 backend_modify = kqueue_modify;
159 backend_poll = kqueue_poll; 167 backend_poll = kqueue_poll;
160 168
161 kqueue_eventmax = 64; /* initial number of events receivable per poll */ 169 kqueue_eventmax = 64; /* initial number of events receivable per poll */
162 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 170 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
… …
166 kqueue_changecnt = 0; 174 kqueue_changecnt = 0;
167 175
168 return EVBACKEND_KQUEUE; 176 return EVBACKEND_KQUEUE;
169} 177}
170 178
171static void 179void inline_size
172kqueue_destroy (EV_P) 180kqueue_destroy (EV_P)
173{ 181{
174 close (backend_fd);
175
176 ev_free (kqueue_events); 182 ev_free (kqueue_events);
177 ev_free (kqueue_changes); 183 ev_free (kqueue_changes);
178} 184}
179 185
180static void 186void inline_size
181kqueue_fork (EV_P) 187kqueue_fork (EV_P)
182{ 188{
183 close (backend_fd); 189 close (backend_fd);
184 190
185 while ((backend_fd = kqueue ()) < 0) 191 while ((backend_fd = kqueue ()) < 0)
186 syserr ("(libev) kqueue"); 192 ev_syserr ("(libev) kqueue");
187 193
188 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); 194 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
189 195
190 /* re-register interest in fds */ 196 /* re-register interest in fds */
191 fd_rearm_all (EV_A); 197 fd_rearm_all (EV_A);

Diff Legend

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