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.41 by root, Wed Jan 13 12:44:33 2010 UTC vs.
Revision 1.57 by root, Thu Jun 20 22:44:59 2019 UTC

1/* 1/*
2 * libev kqueue backend 2 * libev kqueue backend
3 * 3 *
4 * Copyright (c) 2007,2008,2009 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
56/* OS X at least needs this */
57#ifndef EV_ENABLE
58# define EV_ENABLE 0
59#endif
55#ifndef NOTE_EOF 60#ifndef NOTE_EOF
56# define NOTE_EOF 0 61# define NOTE_EOF 0
57#endif 62#endif
58 63
59static void 64static void
70 75
71 /* to detect close/reopen reliably, we have to re-add */ 76 /* to detect close/reopen reliably, we have to re-add */
72 /* event requests even when oev == nev */ 77 /* event requests even when oev == nev */
73 78
74 if (nev & EV_READ) 79 if (nev & EV_READ)
75 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);
76 81
77 if (nev & EV_WRITE) 82 if (nev & EV_WRITE)
78 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);
79} 84}
80 85
81static void 86static void
82kqueue_poll (EV_P_ ev_tstamp timeout) 87kqueue_poll (EV_P_ ev_tstamp timeout)
83{ 88{
91 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt); 96 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
92 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 97 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
93 } 98 }
94 99
95 EV_RELEASE_CB; 100 EV_RELEASE_CB;
96 ts.tv_sec = (time_t)timeout; 101 EV_TS_SET (ts, 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); 102 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
99 EV_ACQUIRE_CB; 103 EV_ACQUIRE_CB;
100 kqueue_changecnt = 0; 104 kqueue_changecnt = 0;
101 105
102 if (expect_false (res < 0)) 106 if (expect_false (res < 0))
103 { 107 {
104 if (errno != EINTR) 108 if (errno != EINTR)
105 ev_syserr ("(libev) kevent"); 109 ev_syserr ("(libev) kevent");
106 110
107 return; 111 return;
108 } 112 }
109 113
110 for (i = 0; i < res; ++i) 114 for (i = 0; i < res; ++i)
111 { 115 {
112 int fd = kqueue_events [i].ident; 116 int fd = kqueue_events [i].ident;
113 117
114 if (expect_false (kqueue_events [i].flags & EV_ERROR)) 118 if (expect_false (kqueue_events [i].flags & EV_ERROR))
115 { 119 {
116 int err = kqueue_events [i].data; 120 int err = kqueue_events [i].data;
117 121
118 /* 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 :) */
119 if (anfds [fd].events) 123 if (anfds [fd].events)
120 { 124 {
121 if (err == ENOENT) /* resubmit changes on ENOENT */ 125 if (err == ENOENT) /* resubmit changes on ENOENT */
122 kqueue_modify (EV_A_ fd, 0, anfds [fd].events); 126 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
123 else if (err == EBADF) /* on EBADF, we re-check the fd */ 127 else if (err == EBADF) /* on EBADF, we re-check the fd */
124 { 128 {
125 if (fd_valid (fd)) 129 if (fd_valid (fd))
127 else 131 else
128 fd_kill (EV_A_ fd); 132 fd_kill (EV_A_ fd);
129 } 133 }
130 else /* on all other errors, we error out on the fd */ 134 else /* on all other errors, we error out on the fd */
131 fd_kill (EV_A_ fd); 135 fd_kill (EV_A_ fd);
132 } 136 }
133 } 137 }
134 else 138 else
135 fd_event ( 139 fd_event (
136 EV_A_ 140 EV_A_
137 fd, 141 fd,
147 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1); 151 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
148 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 152 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
149 } 153 }
150} 154}
151 155
152int inline_size 156inline_size
157int
153kqueue_init (EV_P_ int flags) 158kqueue_init (EV_P_ int flags)
154{ 159{
155 /* Initalize the kernel queue */ 160 /* initialize the kernel queue */
161 kqueue_fd_pid = getpid ();
156 if ((backend_fd = kqueue ()) < 0) 162 if ((backend_fd = kqueue ()) < 0)
157 return 0; 163 return 0;
158 164
159 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ 165 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
160 166
161 backend_fudge = 0.; 167 backend_mintime = 1e-9; /* apparently, they did the right thing in freebsd */
162 backend_modify = kqueue_modify; 168 backend_modify = kqueue_modify;
163 backend_poll = kqueue_poll; 169 backend_poll = kqueue_poll;
164 170
165 kqueue_eventmax = 64; /* initial number of events receivable per poll */ 171 kqueue_eventmax = 64; /* initial number of events receivable per poll */
166 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 172 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
167 173
168 kqueue_changes = 0; 174 kqueue_changes = 0;
170 kqueue_changecnt = 0; 176 kqueue_changecnt = 0;
171 177
172 return EVBACKEND_KQUEUE; 178 return EVBACKEND_KQUEUE;
173} 179}
174 180
175void inline_size 181inline_size
182void
176kqueue_destroy (EV_P) 183kqueue_destroy (EV_P)
177{ 184{
178 ev_free (kqueue_events); 185 ev_free (kqueue_events);
179 ev_free (kqueue_changes); 186 ev_free (kqueue_changes);
180} 187}
181 188
182void inline_size 189inline_size
190void
183kqueue_fork (EV_P) 191kqueue_fork (EV_P)
184{ 192{
193 /* some BSD kernels don't just destroy the kqueue itself,
194 * but also close the fd, which isn't documented, and
195 * impossible to support properly.
196 * we remember the pid of the kqueue call and only close
197 * the fd if the pid is still the same.
198 * this leaks fds on sane kernels, but BSD interfaces are
199 * notoriously buggy and rarely get fixed.
200 */
201 pid_t newpid = getpid ();
202
203 if (newpid == kqueue_fd_pid)
185 close (backend_fd); 204 close (backend_fd);
186 205
206 kqueue_fd_pid = newpid;
187 while ((backend_fd = kqueue ()) < 0) 207 while ((backend_fd = kqueue ()) < 0)
188 ev_syserr ("(libev) kqueue"); 208 ev_syserr ("(libev) kqueue");
189 209
190 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); 210 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
191 211
192 /* re-register interest in fds */ 212 /* re-register interest in fds */
193 fd_rearm_all (EV_A); 213 fd_rearm_all (EV_A);
194} 214}
195 215
216/* sys/event.h defines EV_ERROR */
217#undef EV_ERROR
218

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines