libev/ev_kqueue.c

/*
 * libev kqueue backend
 *
 * Copyright (c) 2007,2008,2009 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;

  /* 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);
    }

  EV_RELEASE_CB;
  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);
  EV_ACQUIRE_CB;
  kqueue_changecnt = 0;

  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.40
Committed:	Sun Jul 19 04:11:27 2009 UTC (14 years, 9 months ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-3_9, rel-3_8
Changes since 1.39:	+1 -1 lines
Log Message:	* empty log message *
#	User	Rev	Content
1	root	1.1	/*
2	root	1.26	* libev kqueue backend
3			*
4	root	1.40	* Copyright (c) 2007,2008,2009 Marc Alexander Lehmann <libev@schmorp.de>
5	root	1.1	* All rights reserved.
6			*
7	root	1.33	* 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	root	1.26	*
28	root	1.33	* 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	root	1.1	*/
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	root	1.27	void inline_speed
48	root	1.6	kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
49	root	1.1	{
50	ayin	1.16	++kqueue_changecnt;
51	root	1.17	array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);
52	root	1.1
53	root	1.23	EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0);
54	root	1.1	}
55
56	root	1.4	#ifndef NOTE_EOF
57			# define NOTE_EOF 0
58			#endif
59
60	root	1.1	static void
61	root	1.6	kqueue_modify (EV_P_ int fd, int oev, int nev)
62	root	1.1	{
63	root	1.22	if (oev != nev)
64			{
65			if (oev & EV_READ)
66			kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0);
67	root	1.14
68	root	1.22	if (oev & EV_WRITE)
69			kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0);
70			}
71	root	1.14
72	root	1.22	/* to detect close/reopen reliably, we have to re-add */
73			/* event requests even when oev == nev */
74	root	1.14
75			if (nev & EV_READ)
76	root	1.22	kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD, NOTE_EOF);
77	root	1.1
78	root	1.14	if (nev & EV_WRITE)
79			kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF);
80	root	1.1	}
81
82			static void
83	root	1.6	kqueue_poll (EV_P_ ev_tstamp timeout)
84	root	1.1	{
85			int res, i;
86			struct timespec ts;
87
88	root	1.14	/* need to resize so there is enough space for errors */
89			if (kqueue_changecnt > kqueue_eventmax)
90			{
91			ev_free (kqueue_events);
92	root	1.28	kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
93	root	1.15	kqueue_events = (struct kevent )ev_malloc (sizeof (struct kevent) kqueue_eventmax);
94	root	1.14	}
95
96	root	1.39	EV_RELEASE_CB;
97	root	1.1	ts.tv_sec = (time_t)timeout;
98	root	1.18	ts.tv_nsec = (long)((timeout - (ev_tstamp)ts.tv_sec) * 1e9);
99	root	1.25	res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
100	root	1.39	EV_ACQUIRE_CB;
101	root	1.6	kqueue_changecnt = 0;
102	root	1.1
103	root	1.29	if (expect_false (res < 0))
104	root	1.9	{
105			if (errno != EINTR)
106	root	1.35	ev_syserr ("(libev) kevent");
107	root	1.9
108			return;
109			}
110	root	1.1
111			for (i = 0; i < res; ++i)
112			{
113	root	1.14	int fd = kqueue_events [i].ident;
114
115	root	1.24	if (expect_false (kqueue_events [i].flags & EV_ERROR))
116	root	1.1	{
117	root	1.14	int err = kqueue_events [i].data;
118
119			/* we are only interested in errors for fds that we are interested in :) */
120			if (anfds [fd].events)
121			{
122			if (err == ENOENT) /* resubmit changes on ENOENT */
123			kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
124			else if (err == EBADF) /* on EBADF, we re-check the fd */
125			{
126			if (fd_valid (fd))
127			kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
128			else
129			fd_kill (EV_A_ fd);
130			}
131			else /* on all other errors, we error out on the fd */
132			fd_kill (EV_A_ fd);
133			}
134	root	1.1	}
135			else
136	root	1.3	fd_event (
137	root	1.6	EV_A_
138	root	1.14	fd,
139	root	1.6	kqueue_events [i].filter == EVFILT_READ ? EV_READ
140			: kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE
141	root	1.1	: 0
142			);
143			}
144
145	root	1.6	if (expect_false (res == kqueue_eventmax))
146	root	1.1	{
147	root	1.9	ev_free (kqueue_events);
148	root	1.28	kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
149	root	1.15	kqueue_events = (struct kevent )ev_malloc (sizeof (struct kevent) kqueue_eventmax);
150	root	1.1	}
151			}
152
153	root	1.27	int inline_size
154	root	1.6	kqueue_init (EV_P_ int flags)
155	root	1.1	{
156			/* Initalize the kernel queue */
157	root	1.25	if ((backend_fd = kqueue ()) < 0)
158	root	1.6	return 0;
159	root	1.1
160	root	1.25	fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
161	root	1.7
162	root	1.31	backend_fudge = 0.;
163	root	1.21	backend_modify = kqueue_modify;
164			backend_poll = kqueue_poll;
165	root	1.1
166	root	1.26	kqueue_eventmax = 64; /* initial number of events receivable per poll */
167	root	1.15	kqueue_events = (struct kevent )ev_malloc (sizeof (struct kevent) kqueue_eventmax);
168	root	1.6
169	root	1.7	kqueue_changes = 0;
170			kqueue_changemax = 0;
171			kqueue_changecnt = 0;
172
173	root	1.20	return EVBACKEND_KQUEUE;
174	root	1.1	}
175
176	root	1.27	void inline_size
177	root	1.7	kqueue_destroy (EV_P)
178			{
179	root	1.9	ev_free (kqueue_events);
180			ev_free (kqueue_changes);
181	root	1.7	}
182
183	root	1.27	void inline_size
184	root	1.7	kqueue_fork (EV_P)
185			{
186	root	1.25	close (backend_fd);
187	root	1.10
188	root	1.25	while ((backend_fd = kqueue ()) < 0)
189	root	1.35	ev_syserr ("(libev) kqueue");
190	root	1.10
191	root	1.25	fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
192	root	1.7
193			/* re-register interest in fds */
194	root	1.8	fd_rearm_all (EV_A);
195	root	1.7	}
196