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.1 by root, Fri Nov 2 20:59:15 2007 UTC vs.
Revision 1.11 by root, Tue Nov 6 01:17:16 2007 UTC

1
2/* 1/*
3 * Copyright 2007 Marc Alexander Lehmann <libev@schmorp.de> 2 * Copyright 2007 Marc Alexander Lehmann <libev@schmorp.de>
4 * Copyright 2000-2002 Niels Provos <provos@citi.umich.edu> 3 * Copyright 2000-2002 Niels Provos <provos@citi.umich.edu>
5 * All rights reserved. 4 * All rights reserved.
6 * 5 *
… …
33#include <sys/queue.h> 32#include <sys/queue.h>
34#include <sys/event.h> 33#include <sys/event.h>
35#include <string.h> 34#include <string.h>
36#include <errno.h> 35#include <errno.h>
37 36
38static int kq_fd;
39static struct kevent *kq_changes;
40static int kq_changemax, kq_changecnt;
41static struct kevent *kq_events;
42static int kq_eventmax;
43
44static void 37static void
45kqueue_change (int fd, int filter, int flags, int fflags) 38kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
46{ 39{
47 struct kevent *ke; 40 struct kevent *ke;
48 41
49 array_needsize (kq_changes, kq_changemax, ++kq_changecnt, ); 42 array_needsize (kqueue_changes, kqueue_changemax, ++kqueue_changecnt, );
50 43
51 ke = &kq_changes [kq_changecnt - 1]; 44 ke = &kqueue_changes [kqueue_changecnt - 1];
52 memset (ke, 0, sizeof (struct kevent)); 45 memset (ke, 0, sizeof (struct kevent));
53 ke->ident = fd; 46 ke->ident = fd;
54 ke->filter = filter; 47 ke->filter = filter;
55 ke->flags = flags; 48 ke->flags = flags;
56 ke->fflags = fflags; 49 ke->fflags = fflags;
57} 50}
58 51
52#ifndef NOTE_EOF
53# define NOTE_EOF 0
54#endif
55
59static void 56static void
60kqueue_modify (int fd, int oev, int nev) 57kqueue_modify (EV_P_ int fd, int oev, int nev)
61{ 58{
62 if ((oev ^ new) & EV_READ) 59 if ((oev ^ nev) & EV_READ)
63 { 60 {
64 if (nev & EV_READ) 61 if (nev & EV_READ)
65 kqueue_change (fd, EVFILT_READ, EV_ADD, NOTE_EOF); 62 kqueue_change (fd, EVFILT_READ, EV_ADD, NOTE_EOF);
66 else 63 else
67 kqueue_change (fd, EVFILT_READ, EV_DELETE, 0); 64 kqueue_change (fd, EVFILT_READ, EV_DELETE, 0);
68 } 65 }
69 66
70 if ((oev ^ new) & EV_WRITE) 67 if ((oev ^ nev) & EV_WRITE)
71 { 68 {
72 if (nev & EV_WRITE) 69 if (nev & EV_WRITE)
73 kqueue_change (fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); 70 kqueue_change (fd, EVFILT_WRITE, EV_ADD, NOTE_EOF);
74 else 71 else
75 kqueue_change (fd, EVFILT_WRITE, EV_DELETE, 0); 72 kqueue_change (fd, EVFILT_WRITE, EV_DELETE, 0);
76 } 73 }
77} 74}
78 75
79static void 76static void
80kqueue_poll (ev_tstamp timeout) 77kqueue_poll (EV_P_ ev_tstamp timeout)
81{ 78{
82 int res, i; 79 int res, i;
83 struct timespec ts; 80 struct timespec ts;
84 81
85 ts.tv_sec = (time_t)timeout; 82 ts.tv_sec = (time_t)timeout;
86 ts.tv_nsec = (long)(timeout - (ev_tstamp)ts.tv_sec) * 1e9; 83 ts.tv_nsec = (long)(timeout - (ev_tstamp)ts.tv_sec) * 1e9;
87 res = kevent (kq_fd, kq_changes, kq_changecnt, kq_events, kq_eventmax, &ts); 84 res = kevent (kqueue_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
88 kq_changecnt = 0; 85 kqueue_changecnt = 0;
89 86
90 if (res < 0) 87 if (res < 0)
88 {
89 if (errno != EINTR)
90 syserr ("(libev) kevent");
91
91 return; 92 return;
93 }
92 94
93 for (i = 0; i < res; ++i) 95 for (i = 0; i < res; ++i)
94 { 96 {
95 if (kq_events [i].flags & EV_ERROR) 97 if (kqueue_events [i].flags & EV_ERROR)
96 { 98 {
97 /* 99 /*
98 * Error messages that can happen, when a delete fails. 100 * Error messages that can happen, when a delete fails.
99 * EBADF happens when the file discriptor has been 101 * EBADF happens when the file discriptor has been
100 * closed, 102 * closed,
… …
104 * should not be returned ever; but FreeBSD does :-\ 106 * should not be returned ever; but FreeBSD does :-\
105 * An error is also indicated when a callback deletes 107 * An error is also indicated when a callback deletes
106 * an event we are still processing. In that case 108 * an event we are still processing. In that case
107 * the data field is set to ENOENT. 109 * the data field is set to ENOENT.
108 */ 110 */
109 if (events [i].data == EBADF) 111 if (kqueue_events [i].data == EBADF)
110 fd_kill (events [i].ident); 112 fd_kill (EV_A_ kqueue_events [i].ident);
111 } 113 }
112 else 114 else
113 event ( 115 fd_event (
116 EV_A_
114 events [i].ident, 117 kqueue_events [i].ident,
115 events [i].filter == EVFILT_READ ? EV_READ 118 kqueue_events [i].filter == EVFILT_READ ? EV_READ
116 : events [i].filter == EVFILT_WRITE ? EV_WRITE 119 : kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE
117 : 0 120 : 0
118 ); 121 );
119 } 122 }
120 123
121 if (expect_false (res == kq_eventmax)) 124 if (expect_false (res == kqueue_eventmax))
122 { 125 {
123 free (kq_events); 126 ev_free (kqueue_events);
124 kq_eventmax = array_roundsize (kq_events, kq_eventmax << 1); 127 kqueue_eventmax = array_roundsize (kqueue_events, kqueue_eventmax << 1);
125 kq_events = malloc (sizeof (struct kevent) * kq_eventmax); 128 kqueue_events = ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
126 } 129 }
127} 130}
128 131
129static void 132static int
130kqueue_init (struct event_base *base) 133kqueue_init (EV_P_ int flags)
131{ 134{
135 struct kevent ch, ev;
136
132 /* Initalize the kernel queue */ 137 /* Initalize the kernel queue */
133 if ((kq_fd = kqueue ()) == -1) 138 if ((kqueue_fd = kqueue ()) < 0)
139 return 0;
140
141 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
142
143 /* Check for Mac OS X kqueue bug. */
144 ch.ident = -1;
145 ch.filter = EVFILT_READ;
146 ch.flags = EV_ADD;
147
148 /*
149 * If kqueue works, then kevent will succeed, and it will
150 * stick an error in ev. If kqueue is broken, then
151 * kevent will fail.
152 */
153 if (kevent (kqueue_fd, &ch, 1, &ev, 1, 0) != 1
154 || ev.ident != -1
155 || ev.flags != EV_ERROR)
134 { 156 {
135 free (kqueueop); 157 /* detected broken kqueue */
158 close (kqueue_fd);
136 return; 159 return 0;
137 } 160 }
138 161
139 /* Initalize fields */ 162 method_fudge = 1e-3; /* needed to compensate for kevent returning early */
140 kq_changes = malloc (NEVENT * sizeof (struct kevent)); 163 method_modify = kqueue_modify;
141 if (!kq_changes) 164 method_poll = kqueue_poll;
142 return;
143 165
144 events = malloc (NEVENT * sizeof (struct kevent)); 166 kqueue_eventmax = 64; /* intiial number of events receivable per poll */
145 if (!events) 167 kqueue_events = ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
146 {
147 free (kq_changes);
148 return;
149 }
150 168
151 /* Check for Mac OS X kqueue bug. */ 169 kqueue_changes = 0;
152 kq_changes [0].ident = -1; 170 kqueue_changemax = 0;
153 kq_changes [0].filter = EVFILT_READ; 171 kqueue_changecnt = 0;
154 kq_changes [0].flags = EV_ADD;
155 /*
156 * If kqueue works, then kevent will succeed, and it will
157 * stick an error in events[0]. If kqueue is broken, then
158 * kevent will fail.
159 */
160 if (kevent (kq_fd, kq_changes, 1, kq_events, NEVENT, NULL) != 1
161 || kq_events[0].ident != -1
162 || kq_events[0].flags != EV_ERROR)
163 {
164 /* detected broken kqueue */
165 free (kq_changes);
166 free (kq_events);
167 close (kq_fd);
168 return;
169 }
170 172
171 ev_method = EVMETHOD_KQUEUE; 173 return EVMETHOD_KQUEUE;
172 method_fudge = 1e-3; /* needed to compensate for kevent returning early */
173 method_modify = kq_modify;
174 method_poll = kq_poll;
175
176 kq_eventmax = 64; /* intiial number of events receivable per poll */
177 kq_events = malloc (sizeof (struct kevent) * kq_eventmax);
178} 174}
179 175
176static void
177kqueue_destroy (EV_P)
178{
179 close (kqueue_fd);
180
181 ev_free (kqueue_events);
182 ev_free (kqueue_changes);
183}
184
185static void
186kqueue_fork (EV_P)
187{
188 close (kqueue_fd);
189
190 while ((kqueue_fd = kqueue ()) < 0)
191 syserr ("(libev) kqueue");
192
193 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC);
194
195 /* re-register interest in fds */
196 fd_rearm_all (EV_A);
197}
198

Diff Legend

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