libev/ev_poll.c

/*
 * libev poll fd activity backend
 *
 * Copyright (c) 2007,2008,2009,2010,2011,2016,2019 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 <poll.h>

inline_size
void
array_needsize_pollidx (int *base, int offset, int count)
{
  /* using memset (.., -1, ...) is tempting, we we try
   * to be ultraportable
   */
  base += offset;
  while (count--)
    *base++ = -1;
}

static void
poll_modify (EV_P_ int fd, int oev, int nev)
{
  int idx;

  if (oev == nev)
    return;

  array_needsize (int, pollidxs, pollidxmax, fd + 1, array_needsize_pollidx);

  idx = pollidxs [fd];

  if (idx < 0) /* need to allocate a new pollfd */
    {
      pollidxs [fd] = idx = pollcnt++;
      array_needsize (struct pollfd, polls, pollmax, pollcnt, array_needsize_noinit);
      polls [idx].fd = fd;
    }

  assert (polls [idx].fd == fd);

  if (nev)
    polls [idx].events =
        (nev & EV_READ ? POLLIN : 0)
        | (nev & EV_WRITE ? POLLOUT : 0);
  else /* remove pollfd */
    {
      pollidxs [fd] = -1;

      if (expect_true (idx < --pollcnt))
        {
          polls [idx] = polls [pollcnt];
          pollidxs [polls [idx].fd] = idx;
        }
    }
}

static void
poll_poll (EV_P_ ev_tstamp timeout)
{
  struct pollfd *p;
  int res;
  
  EV_RELEASE_CB;
  res = poll (polls, pollcnt, timeout * 1e3);
  EV_ACQUIRE_CB;

  if (expect_false (res < 0))
    {
      if (errno == EBADF)
        fd_ebadf (EV_A);
      else if (errno == ENOMEM && !syserr_cb)
        fd_enomem (EV_A);
      else if (errno != EINTR)
        ev_syserr ("(libev) poll");
    }
  else
    for (p = polls; res; ++p)
      {
        assert (("libev: poll() returned illegal result, broken BSD kernel?", p < polls + pollcnt));

        if (expect_false (p->revents)) /* this expect is debatable */
          {
            --res;

            if (expect_false (p->revents & POLLNVAL))
              fd_kill (EV_A_ p->fd);
            else
              fd_event (
                EV_A_
                p->fd,
                (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
                | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
              );
          }
      }
}

inline_size
int
poll_init (EV_P_ int flags)
{
  backend_mintime = 1e-3;
  backend_modify  = poll_modify;
  backend_poll    = poll_poll;

  pollidxs = 0; pollidxmax = 0;
  polls    = 0; pollmax    = 0; pollcnt = 0;

  return EVBACKEND_POLL;
}

inline_size
void
poll_destroy (EV_P)
{
  ev_free (pollidxs);
  ev_free (polls);
}

Revision:	1.42
Committed:	Mon Jun 24 21:27:57 2019 UTC (4 years, 10 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.41:	+6 -4 lines
Log Message:	* empty log message *
#	User	Rev	Content
1	root	1.1	/*
2	root	1.17	* libev poll fd activity backend
3	root	1.1	*
4	root	1.41	* Copyright (c) 2007,2008,2009,2010,2011,2016,2019 Marc Alexander Lehmann <libev@schmorp.de>
5	root	1.1	* All rights reserved.
6			*
7	root	1.21	* Redistribution and use in source and binary forms, with or without modifica-
8			* tion, are permitted provided that the following conditions are met:
9	root	1.36	*
10	root	1.21	* 1. Redistributions of source code must retain the above copyright notice,
11			* this list of conditions and the following disclaimer.
12	root	1.36	*
13	root	1.21	* 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	root	1.36	*
17	root	1.21	* 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.1	*
28	root	1.21	* 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	root	1.2	#include <poll.h>
41	root	1.1
42	root	1.40	inline_size
43			void
44	root	1.42	array_needsize_pollidx (int *base, int offset, int count)
45	root	1.1	{
46	root	1.42	/* using memset (.., -1, ...) is tempting, we we try
47			* to be ultraportable
48			*/
49			base += offset;
50	root	1.2	while (count--)
51			*base++ = -1;
52	root	1.1	}
53
54			static void
55	root	1.3	poll_modify (EV_P_ int fd, int oev, int nev)
56	root	1.1	{
57	root	1.2	int idx;
58	root	1.6
59			if (oev == nev)
60			return;
61
62	root	1.42	array_needsize (int, pollidxs, pollidxmax, fd + 1, array_needsize_pollidx);
63	root	1.1
64	root	1.2	idx = pollidxs [fd];
65
66			if (idx < 0) /* need to allocate a new pollfd */
67			{
68	root	1.10	pollidxs [fd] = idx = pollcnt++;
69	root	1.41	array_needsize (struct pollfd, polls, pollmax, pollcnt, array_needsize_noinit);
70	root	1.2	polls [idx].fd = fd;
71			}
72	root	1.1
73	root	1.10	assert (polls [idx].fd == fd);
74
75	root	1.2	if (nev)
76			polls [idx].events =
77			(nev & EV_READ ? POLLIN : 0)
78			\| (nev & EV_WRITE ? POLLOUT : 0);
79			else /* remove pollfd */
80			{
81	root	1.10	pollidxs [fd] = -1;
82
83	root	1.18	if (expect_true (idx < --pollcnt))
84	root	1.2	{
85			polls [idx] = polls [pollcnt];
86			pollidxs [polls [idx].fd] = idx;
87			}
88			}
89	root	1.1	}
90
91			static void
92	root	1.3	poll_poll (EV_P_ ev_tstamp timeout)
93	root	1.1	{
94	root	1.23	struct pollfd *p;
95	root	1.28	int res;
96
97	root	1.30	EV_RELEASE_CB;
98	root	1.38	res = poll (polls, pollcnt, timeout * 1e3);
99	root	1.30	EV_ACQUIRE_CB;
100	root	1.1
101	root	1.18	if (expect_false (res < 0))
102	root	1.1	{
103	root	1.2	if (errno == EBADF)
104	root	1.3	fd_ebadf (EV_A);
105	root	1.7	else if (errno == ENOMEM && !syserr_cb)
106	root	1.3	fd_enomem (EV_A);
107	root	1.7	else if (errno != EINTR)
108	root	1.27	ev_syserr ("(libev) poll");
109	root	1.1	}
110	root	1.24	else
111			for (p = polls; res; ++p)
112	root	1.34	{
113			assert (("libev: poll() returned illegal result, broken BSD kernel?", p < polls + pollcnt));
114	root	1.24
115	root	1.34	if (expect_false (p->revents)) /* this expect is debatable */
116			{
117			--res;
118
119			if (expect_false (p->revents & POLLNVAL))
120			fd_kill (EV_A_ p->fd);
121			else
122			fd_event (
123			EV_A_
124			p->fd,
125			(p->revents & (POLLOUT \| POLLERR \| POLLHUP) ? EV_WRITE : 0)
126			\| (p->revents & (POLLIN \| POLLERR \| POLLHUP) ? EV_READ : 0)
127			);
128			}
129			}
130	root	1.1	}
131
132	root	1.40	inline_size
133			int
134	root	1.3	poll_init (EV_P_ int flags)
135	root	1.1	{
136	root	1.39	backend_mintime = 1e-3;
137			backend_modify = poll_modify;
138			backend_poll = poll_poll;
139	root	1.3
140	root	1.4	pollidxs = 0; pollidxmax = 0;
141	root	1.5	polls = 0; pollmax = 0; pollcnt = 0;
142	root	1.4
143	root	1.15	return EVBACKEND_POLL;
144	root	1.1	}
145	root	1.4
146	root	1.40	inline_size
147			void
148	root	1.4	poll_destroy (EV_P)
149			{
150	root	1.7	ev_free (pollidxs);
151			ev_free (polls);
152	root	1.4	}
153	root	1.9