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.43 by root, Sat Mar 27 02:41:13 2010 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,2008,2009,2010 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 modifica- 7 * Redistribution and use in source and binary forms, with or without modifica-
8 * tion, are permitted provided that the following conditions are met: 8 * tion, are permitted provided that the following conditions are met:
9 * 9 *
10 * 1. Redistributions of source code must retain the above copyright notice, 10 * 1. Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer. 11 * this list of conditions and the following disclaimer.
12 * 12 *
13 * 2. Redistributions in binary form must reproduce the above copyright 13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the 14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution. 15 * documentation and/or other materials provided with the distribution.
16 * 16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED 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- 18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO 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- 20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
… …
41#include <sys/time.h> 41#include <sys/time.h>
42#include <sys/event.h> 42#include <sys/event.h>
43#include <string.h> 43#include <string.h>
44#include <errno.h> 44#include <errno.h>
45 45
46void inline_speed 46inline_speed
47void
47kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) 48kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
48{ 49{
49 ++kqueue_changecnt; 50 ++kqueue_changecnt;
50 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);
51 52
52 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);
53} 54}
54 55
55/* OS X at least needs this */ 56/* OS X at least needs this */
… …
95 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt); 96 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
96 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 97 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
97 } 98 }
98 99
99 EV_RELEASE_CB; 100 EV_RELEASE_CB;
100 ts.tv_sec = (time_t)timeout; 101 EV_TS_SET (ts, timeout);
101 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9);
102 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; 103 EV_ACQUIRE_CB;
104 kqueue_changecnt = 0; 104 kqueue_changecnt = 0;
105 105
106 if (expect_false (res < 0)) 106 if (expect_false (res < 0))
107 { 107 {
108 if (errno != EINTR) 108 if (errno != EINTR)
109 ev_syserr ("(libev) kevent"); 109 ev_syserr ("(libev) kqueue kevent");
110 110
111 return; 111 return;
112 } 112 }
113 113
114 for (i = 0; i < res; ++i) 114 for (i = 0; i < res; ++i)
115 { 115 {
116 int fd = kqueue_events [i].ident; 116 int fd = kqueue_events [i].ident;
117 117
118 if (expect_false (kqueue_events [i].flags & EV_ERROR)) 118 if (expect_false (kqueue_events [i].flags & EV_ERROR))
119 { 119 {
120 int err = kqueue_events [i].data; 120 int err = kqueue_events [i].data;
121 121
122 /* 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 :) */
123 if (anfds [fd].events) 123 if (anfds [fd].events)
124 { 124 {
125 if (err == ENOENT) /* resubmit changes on ENOENT */ 125 if (err == ENOENT) /* resubmit changes on ENOENT */
126 kqueue_modify (EV_A_ fd, 0, anfds [fd].events); 126 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
127 else if (err == EBADF) /* on EBADF, we re-check the fd */ 127 else if (err == EBADF) /* on EBADF, we re-check the fd */
128 { 128 {
129 if (fd_valid (fd)) 129 if (fd_valid (fd))
130 kqueue_modify (EV_A_ fd, 0, anfds [fd].events); 130 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
131 else 131 else
132 {
133 assert (("libev: kqueue found invalid fd", 0));
132 fd_kill (EV_A_ fd); 134 fd_kill (EV_A_ fd);
135 }
133 } 136 }
134 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));
135 fd_kill (EV_A_ fd); 140 fd_kill (EV_A_ fd);
136 } 141 }
142 }
137 } 143 }
138 else 144 else
139 fd_event ( 145 fd_event (
140 EV_A_ 146 EV_A_
141 fd, 147 fd,
… …
151 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);
152 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 158 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
153 } 159 }
154} 160}
155 161
156int inline_size 162inline_size
163int
157kqueue_init (EV_P_ int flags) 164kqueue_init (EV_P_ int flags)
158{ 165{
159 /* Initalize the kernel queue */ 166 /* initialize the kernel queue */
167 kqueue_fd_pid = getpid ();
160 if ((backend_fd = kqueue ()) < 0) 168 if ((backend_fd = kqueue ()) < 0)
161 return 0; 169 return 0;
162 170
163 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 */
164 172
165 backend_fudge = 0.; 173 backend_mintime = 1e-9; /* apparently, they did the right thing in freebsd */
166 backend_modify = kqueue_modify; 174 backend_modify = kqueue_modify;
167 backend_poll = kqueue_poll; 175 backend_poll = kqueue_poll;
168 176
169 kqueue_eventmax = 64; /* initial number of events receivable per poll */ 177 kqueue_eventmax = 64; /* initial number of events receivable per poll */
170 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 178 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
171 179
172 kqueue_changes = 0; 180 kqueue_changes = 0;
… …
174 kqueue_changecnt = 0; 182 kqueue_changecnt = 0;
175 183
176 return EVBACKEND_KQUEUE; 184 return EVBACKEND_KQUEUE;
177} 185}
178 186
179void inline_size 187inline_size
188void
180kqueue_destroy (EV_P) 189kqueue_destroy (EV_P)
181{ 190{
182 ev_free (kqueue_events); 191 ev_free (kqueue_events);
183 ev_free (kqueue_changes); 192 ev_free (kqueue_changes);
184} 193}
185 194
186void inline_size 195inline_size
196void
187kqueue_fork (EV_P) 197kqueue_fork (EV_P)
188{ 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)
189 close (backend_fd); 210 close (backend_fd);
190 211
212 kqueue_fd_pid = newpid;
191 while ((backend_fd = kqueue ()) < 0) 213 while ((backend_fd = kqueue ()) < 0)
192 ev_syserr ("(libev) kqueue"); 214 ev_syserr ("(libev) kqueue");
193 215
194 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); 216 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
195 217
196 /* re-register interest in fds */ 218 /* re-register interest in fds */
197 fd_rearm_all (EV_A); 219 fd_rearm_all (EV_A);
198} 220}
199 221
222/* sys/event.h defines EV_ERROR */
223#undef EV_ERROR
224

Diff Legend

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