ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev_poll.c
(Generate patch)

Comparing libev/ev_poll.c (file contents):
Revision 1.5 by root, Sun Nov 4 18:29:44 2007 UTC vs.
Revision 1.41 by root, Thu Jun 20 22:44:59 2019 UTC

1/* 1/*
2 * libev epoll fd activity backend 2 * libev poll fd activity backend
3 * 3 *
4 * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> 4 * Copyright (c) 2007,2008,2009,2010,2011,2016,2019 Marc Alexander Lehmann <libev@schmorp.de>
5 * All rights reserved. 5 * All rights reserved.
6 * 6 *
7 * Redistribution and use in source and binary forms, with or without 7 * Redistribution and use in source and binary forms, with or without modifica-
8 * modification, are permitted provided that the following conditions are 8 * tion, are permitted provided that the following conditions are met:
9 * met:
10 * 9 *
11 * * Redistributions of source code must retain the above copyright 10 * 1. Redistributions of source code must retain the above copyright notice,
12 * notice, this list of conditions and the following disclaimer. 11 * this list of conditions and the following disclaimer.
13 * 12 *
14 * * Redistributions in binary form must reproduce the above 13 * 2. Redistributions in binary form must reproduce the above copyright
15 * copyright notice, this list of conditions and the following 14 * notice, this list of conditions and the following disclaimer in the
16 * disclaimer in the documentation and/or other materials provided 15 * documentation and/or other materials provided with the distribution.
17 * with the distribution.
18 * 16 *
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
22 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
23 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 25 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 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.
30 */ 38 */
31 39
32#include <poll.h> 40#include <poll.h>
33 41
34static void 42inline_size
43void
35pollidx_init (int *base, int count) 44pollidx_init (int *base, int count)
36{ 45{
46 /* consider using memset (.., -1, ...), which is practically guaranteed
47 * to work on all systems implementing poll */
37 while (count--) 48 while (count--)
38 *base++ = -1; 49 *base++ = -1;
39} 50}
40 51
41static void 52static void
42poll_modify (EV_P_ int fd, int oev, int nev) 53poll_modify (EV_P_ int fd, int oev, int nev)
43{ 54{
44 int idx; 55 int idx;
56
57 if (oev == nev)
58 return;
59
45 array_needsize (pollidxs, pollidxmax, fd + 1, pollidx_init); 60 array_needsize (int, pollidxs, pollidxmax, fd + 1, pollidx_init);
46 61
47 idx = pollidxs [fd]; 62 idx = pollidxs [fd];
48 63
49 if (idx < 0) /* need to allocate a new pollfd */ 64 if (idx < 0) /* need to allocate a new pollfd */
50 { 65 {
51 idx = pollcnt++; 66 pollidxs [fd] = idx = pollcnt++;
52 array_needsize (polls, pollmax, pollcnt, ); 67 array_needsize (struct pollfd, polls, pollmax, pollcnt, array_needsize_noinit);
53 polls [idx].fd = fd; 68 polls [idx].fd = fd;
54 } 69 }
70
71 assert (polls [idx].fd == fd);
55 72
56 if (nev) 73 if (nev)
57 polls [idx].events = 74 polls [idx].events =
58 (nev & EV_READ ? POLLIN : 0) 75 (nev & EV_READ ? POLLIN : 0)
59 | (nev & EV_WRITE ? POLLOUT : 0); 76 | (nev & EV_WRITE ? POLLOUT : 0);
60 else /* remove pollfd */ 77 else /* remove pollfd */
61 { 78 {
62 if (idx < pollcnt--) 79 pollidxs [fd] = -1;
80
81 if (expect_true (idx < --pollcnt))
63 { 82 {
64 pollidxs [fd] = -1;
65 polls [idx] = polls [pollcnt]; 83 polls [idx] = polls [pollcnt];
66 pollidxs [polls [idx].fd] = idx; 84 pollidxs [polls [idx].fd] = idx;
67 } 85 }
68 } 86 }
69} 87}
70 88
71static void 89static void
72poll_poll (EV_P_ ev_tstamp timeout) 90poll_poll (EV_P_ ev_tstamp timeout)
73{ 91{
92 struct pollfd *p;
93 int res;
94
95 EV_RELEASE_CB;
74 int res = poll (polls, pollcnt, ceil (timeout * 1000.)); 96 res = poll (polls, pollcnt, timeout * 1e3);
97 EV_ACQUIRE_CB;
75 98
76 if (res > 0) 99 if (expect_false (res < 0))
77 {
78 int i;
79
80 for (i = 0; i < pollcnt; ++i)
81 fd_event (
82 EV_A_
83 polls [i].fd,
84 (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
85 | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
86 );
87 }
88 else if (res < 0)
89 { 100 {
90 if (errno == EBADF) 101 if (errno == EBADF)
91 fd_ebadf (EV_A); 102 fd_ebadf (EV_A);
92 else if (errno == ENOMEM) 103 else if (errno == ENOMEM && !syserr_cb)
93 fd_enomem (EV_A); 104 fd_enomem (EV_A);
105 else if (errno != EINTR)
106 ev_syserr ("(libev) poll");
94 } 107 }
108 else
109 for (p = polls; res; ++p)
110 {
111 assert (("libev: poll() returned illegal result, broken BSD kernel?", p < polls + pollcnt));
112
113 if (expect_false (p->revents)) /* this expect is debatable */
114 {
115 --res;
116
117 if (expect_false (p->revents & POLLNVAL))
118 fd_kill (EV_A_ p->fd);
119 else
120 fd_event (
121 EV_A_
122 p->fd,
123 (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
124 | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
125 );
126 }
127 }
95} 128}
96 129
97static int 130inline_size
131int
98poll_init (EV_P_ int flags) 132poll_init (EV_P_ int flags)
99{ 133{
100 method_fudge = 1e-3; /* needed to compensate for select returning early, very conservative */ 134 backend_mintime = 1e-3;
101 method_modify = poll_modify; 135 backend_modify = poll_modify;
102 method_poll = poll_poll; 136 backend_poll = poll_poll;
103 137
104 pollidxs = 0; pollidxmax = 0; 138 pollidxs = 0; pollidxmax = 0;
105 polls = 0; pollmax = 0; pollcnt = 0; 139 polls = 0; pollmax = 0; pollcnt = 0;
106 140
107 return EVMETHOD_POLL; 141 return EVBACKEND_POLL;
108} 142}
109 143
110static void 144inline_size
145void
111poll_destroy (EV_P) 146poll_destroy (EV_P)
112{ 147{
113 free (pollidxs); 148 ev_free (pollidxs);
114 free (polls); 149 ev_free (polls);
115} 150}
151

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines