ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev_kqueue.c
Revision: 1.18
Committed: Thu Nov 22 15:40:56 2007 UTC (16 years, 5 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.17: +2 -1 lines
Log Message:
fix ns calculation in ev_kqueue

File Contents

# User Rev Content
1 root 1.1 /*
2     * Copyright 2007 Marc Alexander Lehmann <libev@schmorp.de>
3     * Copyright 2000-2002 Niels Provos <provos@citi.umich.edu>
4     * All rights reserved.
5     *
6     * Redistribution and use in source and binary forms, with or without
7     * modification, are permitted provided that the following conditions
8     * are met:
9     *
10     * 1. Redistributions of source code must retain the above copyright
11     * notice, this list of conditions and the following disclaimer.
12     * 2. Redistributions in binary form must reproduce the above copyright
13     * notice, this list of conditions and the following disclaimer in the
14     * documentation and/or other materials provided with the distribution.
15     * 3. The name of the author may not be used to endorse or promote products
16     * derived from this software without specific prior written permission.
17     *
18     * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19     * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20     * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21     * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22     * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23     * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24     * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25     * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26     * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27     * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28     */
29    
30     #include <sys/types.h>
31     #include <sys/time.h>
32     #include <sys/queue.h>
33     #include <sys/event.h>
34     #include <string.h>
35     #include <errno.h>
36    
37     static void
38 root 1.6 kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
39 root 1.1 {
40     struct kevent *ke;
41    
42 ayin 1.16 ++kqueue_changecnt;
43 root 1.17 array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);
44 root 1.1
45 root 1.6 ke = &kqueue_changes [kqueue_changecnt - 1];
46 root 1.1 memset (ke, 0, sizeof (struct kevent));
47     ke->ident = fd;
48     ke->filter = filter;
49     ke->flags = flags;
50     ke->fflags = fflags;
51     }
52    
53 root 1.4 #ifndef NOTE_EOF
54     # define NOTE_EOF 0
55     #endif
56    
57 root 1.1 static void
58 root 1.6 kqueue_modify (EV_P_ int fd, int oev, int nev)
59 root 1.1 {
60 root 1.14 /* to detect close/reopen reliably, we have to remove and re-add */
61     /* event requests even when oev == nev */
62    
63     if (oev & EV_READ)
64     kqueue_change (EV_A_ fd, EVFILT_READ, EV_DELETE, 0);
65    
66     if (oev & EV_WRITE)
67     kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0);
68    
69     if (nev & EV_READ)
70     kqueue_change (EV_A_ fd, EVFILT_READ, EV_ADD, NOTE_EOF);
71 root 1.1
72 root 1.14 if (nev & EV_WRITE)
73     kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF);
74 root 1.1 }
75    
76     static void
77 root 1.6 kqueue_poll (EV_P_ ev_tstamp timeout)
78 root 1.1 {
79     int res, i;
80     struct timespec ts;
81    
82 root 1.14 /* need to resize so there is enough space for errors */
83     if (kqueue_changecnt > kqueue_eventmax)
84     {
85     ev_free (kqueue_events);
86     kqueue_eventmax = array_roundsize (struct kevent, kqueue_changecnt);
87 root 1.15 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
88 root 1.14 }
89    
90 root 1.1 ts.tv_sec = (time_t)timeout;
91 root 1.18 ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9);
92     fprintf (stderr, "to %ld:%09ld %f\n", ts.tv_sec, ts.tv_nsec, res);//D
93 root 1.6 res = kevent (kqueue_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
94     kqueue_changecnt = 0;
95 root 1.1
96     if (res < 0)
97 root 1.9 {
98     if (errno != EINTR)
99 root 1.10 syserr ("(libev) kevent");
100 root 1.9
101     return;
102     }
103 root 1.1
104     for (i = 0; i < res; ++i)
105     {
106 root 1.14 int fd = kqueue_events [i].ident;
107    
108 root 1.6 if (kqueue_events [i].flags & EV_ERROR)
109 root 1.1 {
110 root 1.14 int err = kqueue_events [i].data;
111    
112 root 1.1 /*
113 root 1.14 * errors that may happen
114 root 1.1 * EBADF happens when the file discriptor has been
115     * closed,
116 root 1.14 * ENOENT when the file descriptor was closed and
117 root 1.1 * then reopened.
118     * EINVAL for some reasons not understood; EINVAL
119     * should not be returned ever; but FreeBSD does :-\
120     */
121 root 1.14
122     /* we are only interested in errors for fds that we are interested in :) */
123     if (anfds [fd].events)
124     {
125     if (err == ENOENT) /* resubmit changes on ENOENT */
126     kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
127     else if (err == EBADF) /* on EBADF, we re-check the fd */
128     {
129     if (fd_valid (fd))
130     kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
131     else
132     fd_kill (EV_A_ fd);
133     }
134     else /* on all other errors, we error out on the fd */
135     fd_kill (EV_A_ fd);
136     }
137 root 1.1 }
138     else
139 root 1.3 fd_event (
140 root 1.6 EV_A_
141 root 1.14 fd,
142 root 1.6 kqueue_events [i].filter == EVFILT_READ ? EV_READ
143     : kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE
144 root 1.1 : 0
145     );
146     }
147    
148 root 1.6 if (expect_false (res == kqueue_eventmax))
149 root 1.1 {
150 root 1.9 ev_free (kqueue_events);
151 root 1.14 kqueue_eventmax = array_roundsize (struct kevent, kqueue_eventmax << 1);
152 root 1.15 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
153 root 1.1 }
154     }
155    
156 root 1.6 static int
157     kqueue_init (EV_P_ int flags)
158 root 1.1 {
159 root 1.2 struct kevent ch, ev;
160    
161 root 1.1 /* Initalize the kernel queue */
162 root 1.6 if ((kqueue_fd = kqueue ()) < 0)
163     return 0;
164 root 1.1
165 root 1.7 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
166    
167 root 1.2 /* Check for Mac OS X kqueue bug. */
168     ch.ident = -1;
169     ch.filter = EVFILT_READ;
170     ch.flags = EV_ADD;
171 root 1.1
172     /*
173     * If kqueue works, then kevent will succeed, and it will
174 root 1.4 * stick an error in ev. If kqueue is broken, then
175 root 1.1 * kevent will fail.
176     */
177 root 1.6 if (kevent (kqueue_fd, &ch, 1, &ev, 1, 0) != 1
178 root 1.2 || ev.ident != -1
179     || ev.flags != EV_ERROR)
180 root 1.1 {
181     /* detected broken kqueue */
182 root 1.6 close (kqueue_fd);
183     return 0;
184 root 1.1 }
185    
186     method_fudge = 1e-3; /* needed to compensate for kevent returning early */
187 root 1.5 method_modify = kqueue_modify;
188     method_poll = kqueue_poll;
189 root 1.1
190 root 1.6 kqueue_eventmax = 64; /* intiial number of events receivable per poll */
191 root 1.15 kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
192 root 1.6
193 root 1.7 kqueue_changes = 0;
194     kqueue_changemax = 0;
195     kqueue_changecnt = 0;
196    
197 root 1.6 return EVMETHOD_KQUEUE;
198 root 1.1 }
199    
200 root 1.7 static void
201     kqueue_destroy (EV_P)
202     {
203     close (kqueue_fd);
204    
205 root 1.9 ev_free (kqueue_events);
206     ev_free (kqueue_changes);
207 root 1.7 }
208    
209     static void
210     kqueue_fork (EV_P)
211     {
212 root 1.11 close (kqueue_fd);
213 root 1.10
214 root 1.11 while ((kqueue_fd = kqueue ()) < 0)
215     syserr ("(libev) kqueue");
216 root 1.10
217 root 1.7 fcntl (kqueue_fd, F_SETFD, FD_CLOEXEC);
218    
219     /* re-register interest in fds */
220 root 1.8 fd_rearm_all (EV_A);
221 root 1.7 }
222