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.1 by root, Fri Nov 2 15:56:19 2007 UTC vs.
Revision 1.45 by root, Sun Jul 7 06:00:32 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 <sys/epoll.h> 40#include <poll.h>
33 41
34static int epoll_fd = -1; 42inline_size
35 43void
36static void 44array_needsize_pollidx (int *base, int offset, int count)
37epoll_modify (int fd, int oev, int nev)
38{ 45{
39 int mode = nev ? oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD : EPOLL_CTL_DEL; 46 /* using memset (.., -1, ...) is tempting, we we try
40 47 * to be ultraportable
41 struct epoll_event ev; 48 */
42 ev.data.fd = fd; 49 base += offset;
43 ev.events = 50 while (count--)
44 (nev & EV_READ ? EPOLLIN : 0) 51 *base++ = -1;
45 | (nev & EV_WRITE ? EPOLLOUT : 0);
46
47 epoll_ctl (epoll_fd, mode, fd, &ev);
48} 52}
49 53
50static void 54static void
51epoll_postfork_child (void) 55poll_modify (EV_P_ int fd, int oev, int nev)
52{ 56{
53 int fd; 57 int idx;
54 58
55 epoll_fd = epoll_create (256); 59 if (oev == nev)
56 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC);
57
58 /* re-register interest in fds */
59 for (fd = 0; fd < anfdmax; ++fd)
60 if (anfds [fd].events)//D
61 epoll_modify (fd, EV_NONE, anfds [fd].events);
62}
63
64static struct epoll_event *events;
65static int eventmax;
66
67static void
68epoll_poll (ev_tstamp timeout)
69{
70 int eventcnt = epoll_wait (epoll_fd, events, eventmax, ceil (timeout * 1000.));
71 int i;
72
73 if (eventcnt < 0)
74 return; 60 return;
75 61
76 for (i = 0; i < eventcnt; ++i) 62 array_needsize (int, pollidxs, pollidxmax, fd + 1, array_needsize_pollidx);
77 fd_event (
78 events [i].data.fd,
79 (events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0)
80 | (events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0)
81 );
82 63
83 /* if the receive array was full, increase its size */ 64 idx = pollidxs [fd];
84 if (expect_false (eventcnt == eventmax)) 65
66 if (idx < 0) /* need to allocate a new pollfd */
85 { 67 {
86 free (events); 68 pollidxs [fd] = idx = pollcnt++;
87 eventmax = array_roundsize (events, eventmax << 1); 69 array_needsize (struct pollfd, polls, pollmax, pollcnt, array_needsize_noinit);
88 events = malloc (sizeof (struct epoll_event) * eventmax); 70 polls [idx].fd = fd;
71 }
72
73 assert (polls [idx].fd == fd);
74
75 if (nev)
76 polls [idx].events =
77 (nev & EV_READ ? POLLIN : 0)
78 | (nev & EV_WRITE ? POLLOUT : 0);
79 else /* remove pollfd */
80 {
81 pollidxs [fd] = -1;
82
83 if (ecb_expect_true (idx < --pollcnt))
84 {
85 polls [idx] = polls [pollcnt];
86 pollidxs [polls [idx].fd] = idx;
87 }
89 } 88 }
90} 89}
91 90
92static void 91static void
93epoll_init (int flags) 92poll_poll (EV_P_ ev_tstamp timeout)
94{ 93{
95 epoll_fd = epoll_create (256); 94 struct pollfd *p;
95 int res;
96
97 EV_RELEASE_CB;
98 res = poll (polls, pollcnt, timeout * 1e3 + 0.9999);
99 EV_ACQUIRE_CB;
96 100
97 if (epoll_fd < 0) 101 if (ecb_expect_false (res < 0))
98 return; 102 {
103 if (errno == EBADF)
104 fd_ebadf (EV_A);
105 else if (errno == ENOMEM && !syserr_cb)
106 fd_enomem (EV_A);
107 else if (errno != EINTR)
108 ev_syserr ("(libev) poll");
109 }
110 else
111 for (p = polls; res; ++p)
112 {
113 assert (("libev: poll returned illegal result, broken BSD kernel?", p < polls + pollcnt));
99 114
100 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); 115 if (ecb_expect_false (p->revents)) /* this expect is debatable */
116 {
117 --res;
101 118
102 ev_method = EVMETHOD_EPOLL; 119 if (ecb_expect_false (p->revents & POLLNVAL))
103 method_fudge = 1e-3; /* needed to compensate for epoll returning early */ 120 {
104 method_modify = epoll_modify; 121 assert (("libev: poll found invalid fd in poll set", 0));
105 method_poll = epoll_poll; 122 fd_kill (EV_A_ p->fd);
106 123 }
107 eventmax = 64; /* intiial number of events receivable per poll */ 124 else
108 events = malloc (sizeof (struct epoll_event) * eventmax); 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 }
109} 133}
110 134
135inline_size
136int
137poll_init (EV_P_ int flags)
138{
139 backend_mintime = 1e-3;
140 backend_modify = poll_modify;
141 backend_poll = poll_poll;
142
143 pollidxs = 0; pollidxmax = 0;
144 polls = 0; pollmax = 0; pollcnt = 0;
145
146 return EVBACKEND_POLL;
147}
148
149inline_size
150void
151poll_destroy (EV_P)
152{
153 ev_free (pollidxs);
154 ev_free (polls);
155}
156

Diff Legend

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