libev/ev_epoll.c

/*
 * libev epoll fd activity 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.
 */

/*
 * general notes about epoll:
 *
 * a) epoll silently removes fds from the fd set. as nothing tells us
 *    that an fd has been removed otherwise, we have to continually
 *    "rearm" fds that we suspect *might* have changed (same
 *    problem with kqueue, but much less costly there).
 * b) the fact that ADD != MOD creates a lot of extra syscalls due to a)
 *    and seems not to have any advantage.
 * c) the inability to handle fork or file descriptors (think dup)
 *    limits the applicability over poll, so this is not a generic
 *    poll replacement.
 *
 * lots of "weird code" and complication handling in this file is due
 * to these design problems with epoll, as we try very hard to avoid
 * epoll_ctl syscalls for common usage patterns and handle the breakage
 * ensuing from receiving events for closed and otherwise long gone
 * file descriptors.
 */

#include <sys/epoll.h>

static void
epoll_modify (EV_P_ int fd, int oev, int nev)
{
  struct epoll_event ev;
  unsigned char oldmask;

  /*
   * we handle EPOLL_CTL_DEL by ignoring it here
   * on the assumption that the fd is gone anyways
   * if that is wrong, we have to handle the spurious
   * event in epoll_poll.
   * if the fd is added again, we try to ADD it, and, if that
   * fails, we assume it still has the same eventmask.
   */
  if (!nev)
    return;

  oldmask = anfds [fd].emask;
  anfds [fd].emask = nev;

  /* store the generation counter in the upper 32 bits, the fd in the lower 32 bits */
  ev.data.u64 = (uint64_t)(uint32_t)fd
              | ((uint64_t)(uint32_t)++anfds [fd].egen << 32);
  ev.events   = (nev & EV_READ  ? EPOLLIN  : 0)
              | (nev & EV_WRITE ? EPOLLOUT : 0);

  if (expect_true (!epoll_ctl (backend_fd, oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev)))
    return;

  if (expect_true (errno == ENOENT))
    {
      /* if ENOENT then the fd went away, so try to do the right thing */
      if (!nev)
        goto dec_egen;

      if (!epoll_ctl (backend_fd, EPOLL_CTL_ADD, fd, &ev))
        return;
    }
  else if (expect_true (errno == EEXIST))
    {
      /* EEXIST means we ignored a previous DEL, but the fd is still active */
      /* if the kernel mask is the same as the new mask, we assume it hasn't changed */
      if (oldmask == nev)
        goto dec_egen;

      if (!epoll_ctl (backend_fd, EPOLL_CTL_MOD, fd, &ev))
        return;
    }

  fd_kill (EV_A_ fd);

dec_egen:
  /* we didn't successfully call epoll_ctl, so decrement the generation counter again */
  --anfds [fd].egen;
}

static void
epoll_poll (EV_P_ ev_tstamp timeout)
{
  int i;
  int eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.));

  if (expect_false (eventcnt < 0))
    {
      if (errno != EINTR)
        ev_syserr ("(libev) epoll_wait");

      return;
    }

  for (i = 0; i < eventcnt; ++i)
    {
      struct epoll_event *ev = epoll_events + i;

      int fd = (uint32_t)ev->data.u64; /* mask out the lower 32 bits */
      int want = anfds [fd].events;
      int got  = (ev->events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0)
               | (ev->events & (EPOLLIN  | EPOLLERR | EPOLLHUP) ? EV_READ  : 0);

      /* check for spurious notification */
      if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32)))
        {
          /* recreate kernel state */
          postfork = 1;
          continue;
        }

      if (expect_false (got & ~want))
        {
          anfds [fd].emask = want;

          /* we received an event but are not interested in it, try mod or del */
          /* I don't think we ever need MOD, but let's handle it anyways */
          ev->events = (want & EV_READ  ? EPOLLIN  : 0)
                     | (want & EV_WRITE ? EPOLLOUT : 0);

          if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev))
            {
              postfork = 1; /* an error occured, recreate kernel state */
              continue;
            }
        }

      fd_event (EV_A_ fd, got);
    }

  /* if the receive array was full, increase its size */
  if (expect_false (eventcnt == epoll_eventmax))
    {
      ev_free (epoll_events);
      epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1);
      epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);
    }
}

int inline_size
epoll_init (EV_P_ int flags)
{
  backend_fd = epoll_create (256);

  if (backend_fd < 0)
    return 0;

  fcntl (backend_fd, F_SETFD, FD_CLOEXEC);

  backend_fudge  = 0.; /* kernel sources seem to indicate this to be zero */
  backend_modify = epoll_modify;
  backend_poll   = epoll_poll;

  epoll_eventmax = 64; /* initial number of events receivable per poll */
  epoll_events = (struct epoll_event *)ev_malloc (sizeof (struct epoll_event) * epoll_eventmax);

  return EVBACKEND_EPOLL;
}

void inline_size
epoll_destroy (EV_P)
{
  ev_free (epoll_events);
}

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

  while ((backend_fd = epoll_create (256)) < 0)
    ev_syserr ("(libev) epoll_create");

  fcntl (backend_fd, F_SETFD, FD_CLOEXEC);

  fd_rearm_all (EV_A);
}

Revision:	1.43
Committed:	Fri Nov 7 15:07:50 2008 UTC (15 years, 6 months ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rel-3_51, rel-3_53, rel-3_52, rel-3_6, rel-3_49
Changes since 1.42:	+1 -1 lines
Log Message:	* empty log message *
#	Content
1	/*
2	* libev epoll fd activity 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	/*
41	* general notes about epoll:
42	*
43	* a) epoll silently removes fds from the fd set. as nothing tells us
44	* that an fd has been removed otherwise, we have to continually
45	* "rearm" fds that we suspect might have changed (same
46	* problem with kqueue, but much less costly there).
47	* b) the fact that ADD != MOD creates a lot of extra syscalls due to a)
48	* and seems not to have any advantage.
49	* c) the inability to handle fork or file descriptors (think dup)
50	* limits the applicability over poll, so this is not a generic
51	* poll replacement.
52	*
53	* lots of "weird code" and complication handling in this file is due
54	* to these design problems with epoll, as we try very hard to avoid
55	* epoll_ctl syscalls for common usage patterns and handle the breakage
56	* ensuing from receiving events for closed and otherwise long gone
57	* file descriptors.
58	*/
59
60	#include <sys/epoll.h>
61
62	static void
63	epoll_modify (EV_P_ int fd, int oev, int nev)
64	{
65	struct epoll_event ev;
66	unsigned char oldmask;
67
68	/*
69	* we handle EPOLL_CTL_DEL by ignoring it here
70	* on the assumption that the fd is gone anyways
71	* if that is wrong, we have to handle the spurious
72	* event in epoll_poll.
73	* if the fd is added again, we try to ADD it, and, if that
74	* fails, we assume it still has the same eventmask.
75	*/
76	if (!nev)
77	return;
78
79	oldmask = anfds [fd].emask;
80	anfds [fd].emask = nev;
81
82	/* store the generation counter in the upper 32 bits, the fd in the lower 32 bits */
83	ev.data.u64 = (uint64_t)(uint32_t)fd
84	\| ((uint64_t)(uint32_t)++anfds [fd].egen << 32);
85	ev.events = (nev & EV_READ ? EPOLLIN : 0)
86	\| (nev & EV_WRITE ? EPOLLOUT : 0);
87
88	if (expect_true (!epoll_ctl (backend_fd, oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD, fd, &ev)))
89	return;
90
91	if (expect_true (errno == ENOENT))
92	{
93	/* if ENOENT then the fd went away, so try to do the right thing */
94	if (!nev)
95	goto dec_egen;
96
97	if (!epoll_ctl (backend_fd, EPOLL_CTL_ADD, fd, &ev))
98	return;
99	}
100	else if (expect_true (errno == EEXIST))
101	{
102	/* EEXIST means we ignored a previous DEL, but the fd is still active */
103	/* if the kernel mask is the same as the new mask, we assume it hasn't changed */
104	if (oldmask == nev)
105	goto dec_egen;
106
107	if (!epoll_ctl (backend_fd, EPOLL_CTL_MOD, fd, &ev))
108	return;
109	}
110
111	fd_kill (EV_A_ fd);
112
113	dec_egen:
114	/* we didn't successfully call epoll_ctl, so decrement the generation counter again */
115	--anfds [fd].egen;
116	}
117
118	static void
119	epoll_poll (EV_P_ ev_tstamp timeout)
120	{
121	int i;
122	int eventcnt = epoll_wait (backend_fd, epoll_events, epoll_eventmax, (int)ceil (timeout * 1000.));
123
124	if (expect_false (eventcnt < 0))
125	{
126	if (errno != EINTR)
127	ev_syserr ("(libev) epoll_wait");
128
129	return;
130	}
131
132	for (i = 0; i < eventcnt; ++i)
133	{
134	struct epoll_event *ev = epoll_events + i;
135
136	int fd = (uint32_t)ev->data.u64; /* mask out the lower 32 bits */
137	int want = anfds [fd].events;
138	int got = (ev->events & (EPOLLOUT \| EPOLLERR \| EPOLLHUP) ? EV_WRITE : 0)
139	\| (ev->events & (EPOLLIN \| EPOLLERR \| EPOLLHUP) ? EV_READ : 0);
140
141	/* check for spurious notification */
142	if (expect_false ((uint32_t)anfds [fd].egen != (uint32_t)(ev->data.u64 >> 32)))
143	{
144	/* recreate kernel state */
145	postfork = 1;
146	continue;
147	}
148
149	if (expect_false (got & ~want))
150	{
151	anfds [fd].emask = want;
152
153	/* we received an event but are not interested in it, try mod or del */
154	/* I don't think we ever need MOD, but let's handle it anyways */
155	ev->events = (want & EV_READ ? EPOLLIN : 0)
156	\| (want & EV_WRITE ? EPOLLOUT : 0);
157
158	if (epoll_ctl (backend_fd, want ? EPOLL_CTL_MOD : EPOLL_CTL_DEL, fd, ev))
159	{
160	postfork = 1; /* an error occured, recreate kernel state */
161	continue;
162	}
163	}
164
165	fd_event (EV_A_ fd, got);
166	}
167
168	/* if the receive array was full, increase its size */
169	if (expect_false (eventcnt == epoll_eventmax))
170	{
171	ev_free (epoll_events);
172	epoll_eventmax = array_nextsize (sizeof (struct epoll_event), epoll_eventmax, epoll_eventmax + 1);
173	epoll_events = (struct epoll_event )ev_malloc (sizeof (struct epoll_event) epoll_eventmax);
174	}
175	}
176
177	int inline_size
178	epoll_init (EV_P_ int flags)
179	{
180	backend_fd = epoll_create (256);
181
182	if (backend_fd < 0)
183	return 0;
184
185	fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
186
187	backend_fudge = 0.; /* kernel sources seem to indicate this to be zero */
188	backend_modify = epoll_modify;
189	backend_poll = epoll_poll;
190
191	epoll_eventmax = 64; /* initial number of events receivable per poll */
192	epoll_events = (struct epoll_event )ev_malloc (sizeof (struct epoll_event) epoll_eventmax);
193
194	return EVBACKEND_EPOLL;
195	}
196
197	void inline_size
198	epoll_destroy (EV_P)
199	{
200	ev_free (epoll_events);
201	}
202
203	void inline_size
204	epoll_fork (EV_P)
205	{
206	close (backend_fd);
207
208	while ((backend_fd = epoll_create (256)) < 0)
209	ev_syserr ("(libev) epoll_create");
210
211	fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
212
213	fd_rearm_all (EV_A);
214	}
215