ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev_kqueue.c
Revision: 1.33
Committed: Tue Dec 25 07:05:45 2007 UTC (16 years, 7 months ago) by root
Content type: text/plain
Branch: MAIN
CVS Tags: rel-2_01, rel-3_31, rel-3_33, rel-3_4, rel-3_3, rel-3_2, rel-3_1, rel-3_0
Changes since 1.32: +30 -22 lines
Log Message:
*** empty log message ***

File Contents

# Content
1 /*
2 * libev kqueue backend
3 *
4 * Copyright (c) 2007 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 ts.tv_sec = (time_t)timeout;
97 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9);
98 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
99 kqueue_changecnt = 0;
100
101 if (expect_false (res < 0))
102 {
103 if (errno != EINTR)
104 syserr ("(libev) kevent");
105
106 return;
107 }
108
109 for (i = 0; i < res; ++i)
110 {
111 int fd = kqueue_events [i].ident;
112
113 if (expect_false (kqueue_events [i].flags & EV_ERROR))
114 {
115 int err = kqueue_events [i].data;
116
117 /* we are only interested in errors for fds that we are interested in :) */
118 if (anfds [fd].events)
119 {
120 if (err == ENOENT) /* resubmit changes on ENOENT */
121 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
122 else if (err == EBADF) /* on EBADF, we re-check the fd */
123 {
124 if (fd_valid (fd))
125 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
126 else
127 fd_kill (EV_A_ fd);
128 }
129 else /* on all other errors, we error out on the fd */
130 fd_kill (EV_A_ fd);
131 }
132 }
133 else
134 fd_event (
135 EV_A_
136 fd,
137 kqueue_events [i].filter == EVFILT_READ ? EV_READ
138 : kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE
139 : 0
140 );
141 }
142
143 if (expect_false (res == kqueue_eventmax))
144 {
145 ev_free (kqueue_events);
146 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
147 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
148 }
149 }
150
151 int inline_size
152 kqueue_init (EV_P_ int flags)
153 {
154 /* Initalize the kernel queue */
155 if ((backend_fd = kqueue ()) < 0)
156 return 0;
157
158 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
159
160 backend_fudge = 0.;
161 backend_modify = kqueue_modify;
162 backend_poll = kqueue_poll;
163
164 kqueue_eventmax = 64; /* initial number of events receivable per poll */
165 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
166
167 kqueue_changes = 0;
168 kqueue_changemax = 0;
169 kqueue_changecnt = 0;
170
171 return EVBACKEND_KQUEUE;
172 }
173
174 void inline_size
175 kqueue_destroy (EV_P)
176 {
177 ev_free (kqueue_events);
178 ev_free (kqueue_changes);
179 }
180
181 void inline_size
182 kqueue_fork (EV_P)
183 {
184 close (backend_fd);
185
186 while ((backend_fd = kqueue ()) < 0)
187 syserr ("(libev) kqueue");
188
189 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
190
191 /* re-register interest in fds */
192 fd_rearm_all (EV_A);
193 }
194