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.29 by root, Sun Dec 9 02:12:44 2007 UTC vs.
Revision 1.59 by root, Wed Jun 26 00:01:46 2019 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,2011,2012,2013,2016,2019 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:
10 * 9 *
11 * * Redistributions of source code must retain the above copyright 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
12 * notice, this list of conditions and the following disclaimer. 14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
13 * 16 *
14 * * Redistributions in binary form must reproduce the above 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
15 * copyright notice, this list of conditions and the following 18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
16 * disclaimer in the documentation and/or other materials provided 19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
17 * with the distribution. 20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
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,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 25 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
29 * OF 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.
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
39void inline_speed 46inline_speed
47void
40kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) 48kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
41{ 49{
42 struct kevent *ke;
43
44 ++kqueue_changecnt; 50 ++kqueue_changecnt;
45 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); 51 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, array_needsize_noinit);
46 52
47 EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0); 53 EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0);
48} 54}
49 55
56/* OS X at least needs this */
57#ifndef EV_ENABLE
58# define EV_ENABLE 0
59#endif
50#ifndef NOTE_EOF 60#ifndef NOTE_EOF
51# define NOTE_EOF 0 61# define NOTE_EOF 0
52#endif 62#endif
53 63
54static void 64static void
65 75
66 /* to detect close/reopen reliably, we have to re-add */ 76 /* to detect close/reopen reliably, we have to re-add */
67 /* event requests even when oev == nev */ 77 /* event requests even when oev == nev */
68 78
69 if (nev & EV_READ) 79 if (nev & EV_READ)
70 kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF); 80 kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD | EV_ENABLE, NOTE_EOF);
71 81
72 if (nev & EV_WRITE) 82 if (nev & EV_WRITE)
73 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); 83 kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD | EV_ENABLE, NOTE_EOF);
74} 84}
75 85
76static void 86static void
77kqueue_poll (EV_P_ ev_tstamp timeout) 87kqueue_poll (EV_P_ ev_tstamp timeout)
78{ 88{
85 ev_free (kqueue_events); 95 ev_free (kqueue_events);
86 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt); 96 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
87 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 97 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
88 } 98 }
89 99
90 ts.tv_sec = (time_t)timeout; 100 EV_RELEASE_CB;
91 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9); 101 EV_TS_SET (ts, timeout);
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 (expect_false (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) kqueue 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)
104 { 115 {
105 int fd = kqueue_events [i].ident; 116 int fd = kqueue_events [i].ident;
106 117
107 if (expect_false (kqueue_events [i].flags & EV_ERROR)) 118 if (expect_false (kqueue_events [i].flags & EV_ERROR))
108 { 119 {
109 int err = kqueue_events [i].data; 120 int err = kqueue_events [i].data;
110 121
111 /* we are only interested in errors for fds that we are interested in :) */ 122 /* we are only interested in errors for fds that we are interested in :) */
112 if (anfds [fd].events) 123 if (anfds [fd].events)
113 { 124 {
114 if (err == ENOENT) /* resubmit changes on ENOENT */ 125 if (err == ENOENT) /* resubmit changes on ENOENT */
115 kqueue_modify (EV_A_ fd, 0, anfds [fd].events); 126 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
116 else if (err == EBADF) /* on EBADF, we re-check the fd */ 127 else if (err == EBADF) /* on EBADF, we re-check the fd */
117 { 128 {
118 if (fd_valid (fd)) 129 if (fd_valid (fd))
119 kqueue_modify (EV_A_ fd, 0, anfds [fd].events); 130 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
120 else 131 else
132 {
133 assert (("libev: kqueue found invalid fd", 0));
121 fd_kill (EV_A_ fd); 134 fd_kill (EV_A_ fd);
135 }
122 } 136 }
123 else /* on all other errors, we error out on the fd */ 137 else /* on all other errors, we error out on the fd */
138 {
139 assert (("libev: kqueue found invalid fd", 0));
124 fd_kill (EV_A_ fd); 140 fd_kill (EV_A_ fd);
125 } 141 }
142 }
126 } 143 }
127 else 144 else
128 fd_event ( 145 fd_event (
129 EV_A_ 146 EV_A_
130 fd, 147 fd,
140 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1); 157 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
141 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 158 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
142 } 159 }
143} 160}
144 161
145int inline_size 162inline_size
163int
146kqueue_init (EV_P_ int flags) 164kqueue_init (EV_P_ int flags)
147{ 165{
148 struct kevent ch, ev;
149
150 /* Initalize the kernel queue */ 166 /* initialize the kernel queue */
167 kqueue_fd_pid = getpid ();
151 if ((backend_fd = kqueue ()) < 0) 168 if ((backend_fd = kqueue ()) < 0)
152 return 0; 169 return 0;
153 170
154 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ 171 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
155 172
156 /* fudge *might* be zero from the documentation, but bsd docs are notoriously wrong */ 173 backend_mintime = 1e-9; /* apparently, they did the right thing in freebsd */
157 backend_fudge = 1e-3; /* needed to compensate for kevent returning early */
158 backend_modify = kqueue_modify; 174 backend_modify = kqueue_modify;
159 backend_poll = kqueue_poll; 175 backend_poll = kqueue_poll;
160 176
161 kqueue_eventmax = 64; /* initial number of events receivable per poll */ 177 kqueue_eventmax = 64; /* initial number of events receivable per poll */
162 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 178 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
163 179
164 kqueue_changes = 0; 180 kqueue_changes = 0;
166 kqueue_changecnt = 0; 182 kqueue_changecnt = 0;
167 183
168 return EVBACKEND_KQUEUE; 184 return EVBACKEND_KQUEUE;
169} 185}
170 186
171void inline_size 187inline_size
188void
172kqueue_destroy (EV_P) 189kqueue_destroy (EV_P)
173{ 190{
174 ev_free (kqueue_events); 191 ev_free (kqueue_events);
175 ev_free (kqueue_changes); 192 ev_free (kqueue_changes);
176} 193}
177 194
178void inline_size 195inline_size
196void
179kqueue_fork (EV_P) 197kqueue_fork (EV_P)
180{ 198{
199 /* some BSD kernels don't just destroy the kqueue itself,
200 * but also close the fd, which isn't documented, and
201 * impossible to support properly.
202 * we remember the pid of the kqueue call and only close
203 * the fd if the pid is still the same.
204 * this leaks fds on sane kernels, but BSD interfaces are
205 * notoriously buggy and rarely get fixed.
206 */
207 pid_t newpid = getpid ();
208
209 if (newpid == kqueue_fd_pid)
181 close (backend_fd); 210 close (backend_fd);
182 211
212 kqueue_fd_pid = newpid;
183 while ((backend_fd = kqueue ()) < 0) 213 while ((backend_fd = kqueue ()) < 0)
184 syserr ("(libev) kqueue"); 214 ev_syserr ("(libev) kqueue");
185 215
186 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); 216 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
187 217
188 /* re-register interest in fds */ 218 /* re-register interest in fds */
189 fd_rearm_all (EV_A); 219 fd_rearm_all (EV_A);
190} 220}
191 221
222/* sys/event.h defines EV_ERROR */
223#undef EV_ERROR
224

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines