1 |
/* |
2 |
* libev kqueue backend |
3 |
* |
4 |
* Copyright (c) 2007,2008 Marc Alexander Lehmann <libev@schmorp.de> |
5 |
* All rights reserved. |
6 |
* |
7 |
* Redistribution and use in source and binary forms, with or without modifica- |
8 |
* tion, are permitted provided that the following conditions 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. |
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. |
38 |
*/ |
39 |
|
40 |
#include <sys/types.h> |
41 |
#include <sys/time.h> |
42 |
#include <sys/queue.h> |
43 |
#include <sys/event.h> |
44 |
#include <string.h> |
45 |
#include <errno.h> |
46 |
|
47 |
void inline_speed |
48 |
kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) |
49 |
{ |
50 |
++kqueue_changecnt; |
51 |
array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); |
52 |
|
53 |
EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0); |
54 |
} |
55 |
|
56 |
#ifndef NOTE_EOF |
57 |
# define NOTE_EOF 0 |
58 |
#endif |
59 |
|
60 |
static void |
61 |
kqueue_modify (EV_P_ int fd, int oev, int nev) |
62 |
{ |
63 |
if (oev != nev) |
64 |
{ |
65 |
if (oev & EV_READ) |
66 |
kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0); |
67 |
|
68 |
if (oev & EV_WRITE) |
69 |
kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0); |
70 |
} |
71 |
|
72 |
/* to detect close/reopen reliably, we have to re-add */ |
73 |
/* event requests even when oev == nev */ |
74 |
|
75 |
if (nev & EV_READ) |
76 |
kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF); |
77 |
|
78 |
if (nev & EV_WRITE) |
79 |
kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); |
80 |
} |
81 |
|
82 |
static void |
83 |
kqueue_poll (EV_P_ ev_tstamp timeout) |
84 |
{ |
85 |
int res, i; |
86 |
struct timespec ts; |
87 |
|
88 |
/* need to resize so there is enough space for errors */ |
89 |
if (kqueue_changecnt > kqueue_eventmax) |
90 |
{ |
91 |
ev_free (kqueue_events); |
92 |
kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt); |
93 |
kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
94 |
} |
95 |
|
96 |
if (expect_false (suspend_cb)) suspend_cb (EV_A); |
97 |
ts.tv_sec = (time_t)timeout; |
98 |
ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9); |
99 |
res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts); |
100 |
if (expect_false (resume_cb)) resume_cb (EV_A); |
101 |
kqueue_changecnt = 0; |
102 |
|
103 |
if (expect_false (res < 0)) |
104 |
{ |
105 |
if (errno != EINTR) |
106 |
ev_syserr ("(libev) kevent"); |
107 |
|
108 |
return; |
109 |
} |
110 |
|
111 |
for (i = 0; i < res; ++i) |
112 |
{ |
113 |
int fd = kqueue_events [i].ident; |
114 |
|
115 |
if (expect_false (kqueue_events [i].flags & EV_ERROR)) |
116 |
{ |
117 |
int err = kqueue_events [i].data; |
118 |
|
119 |
/* we are only interested in errors for fds that we are interested in :) */ |
120 |
if (anfds [fd].events) |
121 |
{ |
122 |
if (err == ENOENT) /* resubmit changes on ENOENT */ |
123 |
kqueue_modify (EV_A_ fd, 0, anfds [fd].events); |
124 |
else if (err == EBADF) /* on EBADF, we re-check the fd */ |
125 |
{ |
126 |
if (fd_valid (fd)) |
127 |
kqueue_modify (EV_A_ fd, 0, anfds [fd].events); |
128 |
else |
129 |
fd_kill (EV_A_ fd); |
130 |
} |
131 |
else /* on all other errors, we error out on the fd */ |
132 |
fd_kill (EV_A_ fd); |
133 |
} |
134 |
} |
135 |
else |
136 |
fd_event ( |
137 |
EV_A_ |
138 |
fd, |
139 |
kqueue_events [i].filter == EVFILT_READ ? EV_READ |
140 |
: kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE |
141 |
: 0 |
142 |
); |
143 |
} |
144 |
|
145 |
if (expect_false (res == kqueue_eventmax)) |
146 |
{ |
147 |
ev_free (kqueue_events); |
148 |
kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1); |
149 |
kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
150 |
} |
151 |
} |
152 |
|
153 |
int inline_size |
154 |
kqueue_init (EV_P_ int flags) |
155 |
{ |
156 |
/* Initalize the kernel queue */ |
157 |
if ((backend_fd = kqueue ()) < 0) |
158 |
return 0; |
159 |
|
160 |
fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ |
161 |
|
162 |
backend_fudge = 0.; |
163 |
backend_modify = kqueue_modify; |
164 |
backend_poll = kqueue_poll; |
165 |
|
166 |
kqueue_eventmax = 64; /* initial number of events receivable per poll */ |
167 |
kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
168 |
|
169 |
kqueue_changes = 0; |
170 |
kqueue_changemax = 0; |
171 |
kqueue_changecnt = 0; |
172 |
|
173 |
return EVBACKEND_KQUEUE; |
174 |
} |
175 |
|
176 |
void inline_size |
177 |
kqueue_destroy (EV_P) |
178 |
{ |
179 |
ev_free (kqueue_events); |
180 |
ev_free (kqueue_changes); |
181 |
} |
182 |
|
183 |
void inline_size |
184 |
kqueue_fork (EV_P) |
185 |
{ |
186 |
close (backend_fd); |
187 |
|
188 |
while ((backend_fd = kqueue ()) < 0) |
189 |
ev_syserr ("(libev) kqueue"); |
190 |
|
191 |
fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
192 |
|
193 |
/* re-register interest in fds */ |
194 |
fd_rearm_all (EV_A); |
195 |
} |
196 |
|