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.4 by root, Sun Nov 4 15:58:50 2007 UTC vs.
Revision 1.46 by root, Thu Jul 11 05:41:39 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
35pollidx_init (int *base, int count) 43void
44array_needsize_pollidx (int *base, int offset, int count)
36{ 45{
46 /* using memset (.., -1, ...) is tempting, we we try
47 * to be ultraportable
48 */
49 base += offset;
37 while (count--) 50 while (count--)
38 *base++ = -1; 51 *base++ = -1;
39} 52}
40 53
41static void 54static void
42poll_modify (EV_P_ int fd, int oev, int nev) 55poll_modify (EV_P_ int fd, int oev, int nev)
43{ 56{
44 int idx; 57 int idx;
58
59 if (oev == nev)
60 return;
61
45 array_needsize (pollidxs, pollidxmax, fd + 1, pollidx_init); 62 array_needsize (int, pollidxs, pollidxmax, fd + 1, array_needsize_pollidx);
46 63
47 idx = pollidxs [fd]; 64 idx = pollidxs [fd];
48 65
49 if (idx < 0) /* need to allocate a new pollfd */ 66 if (idx < 0) /* need to allocate a new pollfd */
50 { 67 {
51 idx = pollcnt++; 68 pollidxs [fd] = idx = pollcnt++;
52 array_needsize (polls, pollmax, pollcnt, ); 69 array_needsize (struct pollfd, polls, pollmax, pollcnt, array_needsize_noinit);
53 polls [idx].fd = fd; 70 polls [idx].fd = fd;
54 } 71 }
72
73 assert (polls [idx].fd == fd);
55 74
56 if (nev) 75 if (nev)
57 polls [idx].events = 76 polls [idx].events =
58 (nev & EV_READ ? POLLIN : 0) 77 (nev & EV_READ ? POLLIN : 0)
59 | (nev & EV_WRITE ? POLLOUT : 0); 78 | (nev & EV_WRITE ? POLLOUT : 0);
60 else /* remove pollfd */ 79 else /* remove pollfd */
61 { 80 {
62 if (idx < pollcnt--) 81 pollidxs [fd] = -1;
82
83 if (ecb_expect_true (idx < --pollcnt))
63 { 84 {
64 pollidxs [fd] = -1;
65 polls [idx] = polls [pollcnt]; 85 polls [idx] = polls [pollcnt];
66 pollidxs [polls [idx].fd] = idx; 86 pollidxs [polls [idx].fd] = idx;
67 } 87 }
68 } 88 }
69} 89}
70 90
71static void 91static void
72poll_poll (EV_P_ ev_tstamp timeout) 92poll_poll (EV_P_ ev_tstamp timeout)
73{ 93{
94 struct pollfd *p;
95 int res;
96
97 EV_RELEASE_CB;
74 int res = poll (polls, pollcnt, ceil (timeout * 1000.)); 98 res = poll (polls, pollcnt, EV_TS_TO_MS (timeout));
99 EV_ACQUIRE_CB;
75 100
76 if (res > 0) 101 if (ecb_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 { 102 {
90 if (errno == EBADF) 103 if (errno == EBADF)
91 fd_ebadf (EV_A); 104 fd_ebadf (EV_A);
92 else if (errno == ENOMEM) 105 else if (errno == ENOMEM && !syserr_cb)
93 fd_enomem (EV_A); 106 fd_enomem (EV_A);
107 else if (errno != EINTR)
108 ev_syserr ("(libev) poll");
94 } 109 }
110 else
111 for (p = polls; res; ++p)
112 {
113 assert (("libev: poll returned illegal result, broken BSD kernel?", p < polls + pollcnt));
114
115 if (ecb_expect_false (p->revents)) /* this expect is debatable */
116 {
117 --res;
118
119 if (ecb_expect_false (p->revents & POLLNVAL))
120 {
121 assert (("libev: poll found invalid fd in poll set", 0));
122 fd_kill (EV_A_ p->fd);
123 }
124 else
125 fd_event (
126 EV_A_
127 p->fd,
128 (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
129 | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
130 );
131 }
132 }
95} 133}
96 134
97static int 135inline_size
136int
98poll_init (EV_P_ int flags) 137poll_init (EV_P_ int flags)
99{ 138{
100 method_fudge = 1e-3; /* needed to compensate for select returning early, very conservative */ 139 backend_mintime = 1e-3;
101 method_modify = poll_modify; 140 backend_modify = poll_modify;
102 method_poll = poll_poll; 141 backend_poll = poll_poll;
103 142
104 pollidxs = 0; pollidxmax = 0; 143 pollidxs = 0; pollidxmax = 0;
105 polls = 0; pollsmax = 0; pollscnt = 0; 144 polls = 0; pollmax = 0; pollcnt = 0;
106 145
107 return EVMETHOD_POLL; 146 return EVBACKEND_POLL;
108} 147}
109 148
110static void 149inline_size
150void
111poll_destroy (EV_P) 151poll_destroy (EV_P)
112{ 152{
113 free (pollidxs); 153 ev_free (pollidxs);
114 free (polls); 154 ev_free (polls);
115} 155}
156

Diff Legend

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