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.40 by root, Sun Jul 19 04:11:27 2009 UTC vs.
Revision 1.56 by root, Thu Feb 18 04:48:05 2016 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 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,
37 * either the BSD or the GPL. 37 * either the BSD or the GPL.
38 */ 38 */
39 39
40#include <sys/types.h> 40#include <sys/types.h>
41#include <sys/time.h> 41#include <sys/time.h>
42#include <sys/queue.h>
43#include <sys/event.h> 42#include <sys/event.h>
44#include <string.h> 43#include <string.h>
45#include <errno.h> 44#include <errno.h>
46 45
47void inline_speed 46inline_speed
47void
48kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) 48kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
49{ 49{
50 ++kqueue_changecnt; 50 ++kqueue_changecnt;
51 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); 51 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);
52 52
53 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);
54} 54}
55 55
56/* OS X at least needs this */
57#ifndef EV_ENABLE
58# define EV_ENABLE 0
59#endif
56#ifndef NOTE_EOF 60#ifndef NOTE_EOF
57# define NOTE_EOF 0 61# define NOTE_EOF 0
58#endif 62#endif
59 63
60static void 64static void
71 75
72 /* to detect close/reopen reliably, we have to re-add */ 76 /* to detect close/reopen reliably, we have to re-add */
73 /* event requests even when oev == nev */ 77 /* event requests even when oev == nev */
74 78
75 if (nev & EV_READ) 79 if (nev & EV_READ)
76 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);
77 81
78 if (nev & EV_WRITE) 82 if (nev & EV_WRITE)
79 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);
80} 84}
81 85
82static void 86static void
83kqueue_poll (EV_P_ ev_tstamp timeout) 87kqueue_poll (EV_P_ ev_tstamp timeout)
84{ 88{
92 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt); 96 kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
93 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 97 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
94 } 98 }
95 99
96 EV_RELEASE_CB; 100 EV_RELEASE_CB;
97 ts.tv_sec = (time_t)timeout; 101 EV_TS_SET (ts, 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); 102 res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
100 EV_ACQUIRE_CB; 103 EV_ACQUIRE_CB;
101 kqueue_changecnt = 0; 104 kqueue_changecnt = 0;
102 105
103 if (expect_false (res < 0)) 106 if (expect_false (res < 0))
104 { 107 {
105 if (errno != EINTR) 108 if (errno != EINTR)
106 ev_syserr ("(libev) kevent"); 109 ev_syserr ("(libev) kevent");
107 110
108 return; 111 return;
109 } 112 }
110 113
111 for (i = 0; i < res; ++i) 114 for (i = 0; i < res; ++i)
112 { 115 {
113 int fd = kqueue_events [i].ident; 116 int fd = kqueue_events [i].ident;
114 117
115 if (expect_false (kqueue_events [i].flags & EV_ERROR)) 118 if (expect_false (kqueue_events [i].flags & EV_ERROR))
116 { 119 {
117 int err = kqueue_events [i].data; 120 int err = kqueue_events [i].data;
118 121
119 /* 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 :) */
120 if (anfds [fd].events) 123 if (anfds [fd].events)
121 { 124 {
122 if (err == ENOENT) /* resubmit changes on ENOENT */ 125 if (err == ENOENT) /* resubmit changes on ENOENT */
123 kqueue_modify (EV_A_ fd, 0, anfds [fd].events); 126 kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
124 else if (err == EBADF) /* on EBADF, we re-check the fd */ 127 else if (err == EBADF) /* on EBADF, we re-check the fd */
125 { 128 {
126 if (fd_valid (fd)) 129 if (fd_valid (fd))
128 else 131 else
129 fd_kill (EV_A_ fd); 132 fd_kill (EV_A_ fd);
130 } 133 }
131 else /* on all other errors, we error out on the fd */ 134 else /* on all other errors, we error out on the fd */
132 fd_kill (EV_A_ fd); 135 fd_kill (EV_A_ fd);
133 } 136 }
134 } 137 }
135 else 138 else
136 fd_event ( 139 fd_event (
137 EV_A_ 140 EV_A_
138 fd, 141 fd,
148 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);
149 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 152 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
150 } 153 }
151} 154}
152 155
153int inline_size 156inline_size
157int
154kqueue_init (EV_P_ int flags) 158kqueue_init (EV_P_ int flags)
155{ 159{
156 /* Initalize the kernel queue */ 160 /* initialize the kernel queue */
161 kqueue_fd_pid = getpid ();
157 if ((backend_fd = kqueue ()) < 0) 162 if ((backend_fd = kqueue ()) < 0)
158 return 0; 163 return 0;
159 164
160 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 */
161 166
162 backend_fudge = 0.; 167 backend_mintime = 1e-9; /* apparently, they did the right thing in freebsd */
163 backend_modify = kqueue_modify; 168 backend_modify = kqueue_modify;
164 backend_poll = kqueue_poll; 169 backend_poll = kqueue_poll;
165 170
166 kqueue_eventmax = 64; /* initial number of events receivable per poll */ 171 kqueue_eventmax = 64; /* initial number of events receivable per poll */
167 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); 172 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
168 173
169 kqueue_changes = 0; 174 kqueue_changes = 0;
171 kqueue_changecnt = 0; 176 kqueue_changecnt = 0;
172 177
173 return EVBACKEND_KQUEUE; 178 return EVBACKEND_KQUEUE;
174} 179}
175 180
176void inline_size 181inline_size
182void
177kqueue_destroy (EV_P) 183kqueue_destroy (EV_P)
178{ 184{
179 ev_free (kqueue_events); 185 ev_free (kqueue_events);
180 ev_free (kqueue_changes); 186 ev_free (kqueue_changes);
181} 187}
182 188
183void inline_size 189inline_size
190void
184kqueue_fork (EV_P) 191kqueue_fork (EV_P)
185{ 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)
186 close (backend_fd); 204 close (backend_fd);
187 205
206 kqueue_fd_pid = newpid;
188 while ((backend_fd = kqueue ()) < 0) 207 while ((backend_fd = kqueue ()) < 0)
189 ev_syserr ("(libev) kqueue"); 208 ev_syserr ("(libev) kqueue");
190 209
191 fcntl (backend_fd, F_SETFD, FD_CLOEXEC); 210 fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
192 211
193 /* re-register interest in fds */ 212 /* re-register interest in fds */
194 fd_rearm_all (EV_A); 213 fd_rearm_all (EV_A);
195} 214}
196 215
216/* sys/event.h defines EV_ERROR */
217#undef EV_ERROR
218

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines