libev/ev_kqueue.c

/*
 * libev kqueue backend
 *
 * Copyright (c) 2007,2008 Marc Alexander Lehmann <libev@schmorp.de>
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without modifica-
 * tion, are permitted provided that the following conditions are met:
 * 
 *   1.  Redistributions of source code must retain the above copyright notice,
 *       this list of conditions and the following disclaimer.
 * 
 *   2.  Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
 * OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * Alternatively, the contents of this file may be used under the terms of
 * the GNU General Public License ("GPL") version 2 or any later version,
 * in which case the provisions of the GPL are applicable instead of
 * the above. If you wish to allow the use of your version of this file
 * only under the terms of the GPL and not to allow others to use your
 * version of this file under the BSD license, indicate your decision
 * by deleting the provisions above and replace them with the notice
 * and other provisions required by the GPL. If you do not delete the
 * provisions above, a recipient may use your version of this file under
 * either the BSD or the GPL.
 */

#include <sys/types.h>
#include <sys/time.h>
#include <sys/queue.h>
#include <sys/event.h>
#include <string.h>
#include <errno.h>

void inline_speed
kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
{
  ++kqueue_changecnt;
  array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);

  EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0);
}

#ifndef NOTE_EOF
# define NOTE_EOF 0
#endif

static void
kqueue_modify (EV_P_ int fd, int oev, int nev)
{
  if (oev != nev)
    {
      if (oev & EV_READ)
        kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0);

      if (oev & EV_WRITE)
        kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0);
    }

  /* to detect close/reopen reliably, we have to re-add */
  /* event requests even when oev == nev */

  if (nev & EV_READ)
    kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF);

  if (nev & EV_WRITE)
    kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF);
}

static void
kqueue_poll (EV_P_ ev_tstamp timeout)
{
  int res, i;
  struct timespec ts;

  EV_RELEASE_CB;

  /* need to resize so there is enough space for errors */
  if (kqueue_changecnt > kqueue_eventmax)
    {
      ev_free (kqueue_events);
      kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
      kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
    }

  ts.tv_sec  = (time_t)timeout;
  ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9);
  res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
  kqueue_changecnt = 0;

  EV_ACQUIRE_CB;

  if (expect_false (res < 0))
    { 
      if (errno != EINTR)
        ev_syserr ("(libev) kevent");

      return;
    } 

  for (i = 0; i < res; ++i)
    {
      int fd = kqueue_events [i].ident;

      if (expect_false (kqueue_events [i].flags & EV_ERROR))
        {
          int err = kqueue_events [i].data;

          /* we are only interested in errors for fds that we are interested in :) */
          if (anfds [fd].events)
            {
              if (err == ENOENT) /* resubmit changes on ENOENT */
                kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
              else if (err == EBADF) /* on EBADF, we re-check the fd */
                {
                  if (fd_valid (fd))
                    kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
                  else
                    fd_kill (EV_A_ fd);
                }
              else /* on all other errors, we error out on the fd */
                fd_kill (EV_A_ fd);
            }
        }
      else
        fd_event (
          EV_A_
          fd,
          kqueue_events [i].filter == EVFILT_READ ? EV_READ
          : kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE
          : 0
        );
    }

  if (expect_false (res == kqueue_eventmax))
    {
      ev_free (kqueue_events);
      kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
      kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
    }
}

int inline_size
kqueue_init (EV_P_ int flags)
{
  /* Initalize the kernel queue */
  if ((backend_fd = kqueue ()) < 0)
    return 0;

  fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */

  backend_fudge  = 0.;
  backend_modify = kqueue_modify;
  backend_poll   = kqueue_poll;

  kqueue_eventmax = 64; /* initial number of events receivable per poll */
  kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);

  kqueue_changes   = 0;
  kqueue_changemax = 0;
  kqueue_changecnt = 0;

  return EVBACKEND_KQUEUE;
}

void inline_size
kqueue_destroy (EV_P)
{
  ev_free (kqueue_events);
  ev_free (kqueue_changes);
}

void inline_size
kqueue_fork (EV_P)
{
  close (backend_fd);

  while ((backend_fd = kqueue ()) < 0)
    ev_syserr ("(libev) kqueue");

  fcntl (backend_fd, F_SETFD, FD_CLOEXEC);

  /* re-register interest in fds */
  fd_rearm_all (EV_A);
}

Revision:	1.38
Committed:	Fri Jul 10 19:10:19 2009 UTC (14 years, 10 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.37:	+2 -2 lines
Log Message:	* empty log message *
#	Content
1	/*
2	* libev kqueue backend
3	*
4	* Copyright (c) 2007,2008 Marc Alexander Lehmann <libev@schmorp.de>
5	* All rights reserved.
6	*
7	* Redistribution and use in source and binary forms, with or without modifica-
8	* tion, are permitted provided that the following conditions are met:
9	*
10	* 1. Redistributions of source code must retain the above copyright notice,
11	* this list of conditions and the following disclaimer.
12	*
13	* 2. Redistributions in binary form must reproduce the above copyright
14	* notice, this list of conditions and the following disclaimer in the
15	* documentation and/or other materials provided with the distribution.
16	*
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-
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-
21	* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
22	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
23	* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
24	* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
25	* ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
26	* OF THE POSSIBILITY OF SUCH DAMAGE.
27	*
28	* Alternatively, the contents of this file may be used under the terms of
29	* the GNU General Public License ("GPL") version 2 or any later version,
30	* in which case the provisions of the GPL are applicable instead of
31	* the above. If you wish to allow the use of your version of this file
32	* only under the terms of the GPL and not to allow others to use your
33	* version of this file under the BSD license, indicate your decision
34	* by deleting the provisions above and replace them with the notice
35	* and other provisions required by the GPL. If you do not delete the
36	* provisions above, a recipient may use your version of this file under
37	* either the BSD or the GPL.
38	*/
39
40	#include <sys/types.h>
41	#include <sys/time.h>
42	#include <sys/queue.h>
43	#include <sys/event.h>
44	#include <string.h>
45	#include <errno.h>
46
47	void inline_speed
48	kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
49	{
50	++kqueue_changecnt;
51	array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);
52
53	EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0);
54	}
55
56	#ifndef NOTE_EOF
57	# define NOTE_EOF 0
58	#endif
59
60	static void
61	kqueue_modify (EV_P_ int fd, int oev, int nev)
62	{
63	if (oev != nev)
64	{
65	if (oev & EV_READ)
66	kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0);
67
68	if (oev & EV_WRITE)
69	kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0);
70	}
71
72	/* to detect close/reopen reliably, we have to re-add */
73	/* event requests even when oev == nev */
74
75	if (nev & EV_READ)
76	kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF);
77
78	if (nev & EV_WRITE)
79	kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF);
80	}
81
82	static void
83	kqueue_poll (EV_P_ ev_tstamp timeout)
84	{
85	int res, i;
86	struct timespec ts;
87
88	EV_RELEASE_CB;
89
90	/* need to resize so there is enough space for errors */
91	if (kqueue_changecnt > kqueue_eventmax)
92	{
93	ev_free (kqueue_events);
94	kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
95	kqueue_events = (struct kevent )ev_malloc (sizeof (struct kevent) kqueue_eventmax);
96	}
97
98	ts.tv_sec = (time_t)timeout;
99	ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9);
100	res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
101	kqueue_changecnt = 0;
102
103	EV_ACQUIRE_CB;
104
105	if (expect_false (res < 0))
106	{
107	if (errno != EINTR)
108	ev_syserr ("(libev) kevent");
109
110	return;
111	}
112
113	for (i = 0; i < res; ++i)
114	{
115	int fd = kqueue_events [i].ident;
116
117	if (expect_false (kqueue_events [i].flags & EV_ERROR))
118	{
119	int err = kqueue_events [i].data;
120
121	/* we are only interested in errors for fds that we are interested in :) */
122	if (anfds [fd].events)
123	{
124	if (err == ENOENT) /* resubmit changes on ENOENT */
125	kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
126	else if (err == EBADF) /* on EBADF, we re-check the fd */
127	{
128	if (fd_valid (fd))
129	kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
130	else
131	fd_kill (EV_A_ fd);
132	}
133	else /* on all other errors, we error out on the fd */
134	fd_kill (EV_A_ fd);
135	}
136	}
137	else
138	fd_event (
139	EV_A_
140	fd,
141	kqueue_events [i].filter == EVFILT_READ ? EV_READ
142	: kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE
143	: 0
144	);
145	}
146
147	if (expect_false (res == kqueue_eventmax))
148	{
149	ev_free (kqueue_events);
150	kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
151	kqueue_events = (struct kevent )ev_malloc (sizeof (struct kevent) kqueue_eventmax);
152	}
153	}
154
155	int inline_size
156	kqueue_init (EV_P_ int flags)
157	{
158	/* Initalize the kernel queue */
159	if ((backend_fd = kqueue ()) < 0)
160	return 0;
161
162	fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
163
164	backend_fudge = 0.;
165	backend_modify = kqueue_modify;
166	backend_poll = kqueue_poll;
167
168	kqueue_eventmax = 64; /* initial number of events receivable per poll */
169	kqueue_events = (struct kevent )ev_malloc (sizeof (struct kevent) kqueue_eventmax);
170
171	kqueue_changes = 0;
172	kqueue_changemax = 0;
173	kqueue_changecnt = 0;
174
175	return EVBACKEND_KQUEUE;
176	}
177
178	void inline_size
179	kqueue_destroy (EV_P)
180	{
181	ev_free (kqueue_events);
182	ev_free (kqueue_changes);
183	}
184
185	void inline_size
186	kqueue_fork (EV_P)
187	{
188	close (backend_fd);
189
190	while ((backend_fd = kqueue ()) < 0)
191	ev_syserr ("(libev) kqueue");
192
193	fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
194
195	/* re-register interest in fds */
196	fd_rearm_all (EV_A);
197	}
198