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.40 by root, Thu Feb 18 04:48:05 2016 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 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 44pollidx_init (int *base, 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 /* consider using memset (.., -1, ...), which is practically guaranteed
40 47 * to work on all systems implementing poll */
41 struct epoll_event ev; 48 while (count--)
42 ev.data.fd = fd; 49 *base++ = -1;
43 ev.events =
44 (nev & EV_READ ? EPOLLIN : 0)
45 | (nev & EV_WRITE ? EPOLLOUT : 0);
46
47 epoll_ctl (epoll_fd, mode, fd, &ev);
48} 50}
49 51
50static void 52static void
51epoll_postfork_child (void) 53poll_modify (EV_P_ int fd, int oev, int nev)
52{ 54{
53 int fd; 55 int idx;
54 56
55 epoll_fd = epoll_create (256); 57 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; 58 return;
75 59
76 for (i = 0; i < eventcnt; ++i) 60 array_needsize (int, pollidxs, pollidxmax, fd + 1, pollidx_init);
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 61
83 /* if the receive array was full, increase its size */ 62 idx = pollidxs [fd];
84 if (expect_false (eventcnt == eventmax)) 63
64 if (idx < 0) /* need to allocate a new pollfd */
85 { 65 {
86 free (events); 66 pollidxs [fd] = idx = pollcnt++;
87 eventmax = array_roundsize (events, eventmax << 1); 67 array_needsize (struct pollfd, polls, pollmax, pollcnt, EMPTY2);
88 events = malloc (sizeof (struct epoll_event) * eventmax); 68 polls [idx].fd = fd;
69 }
70
71 assert (polls [idx].fd == fd);
72
73 if (nev)
74 polls [idx].events =
75 (nev & EV_READ ? POLLIN : 0)
76 | (nev & EV_WRITE ? POLLOUT : 0);
77 else /* remove pollfd */
78 {
79 pollidxs [fd] = -1;
80
81 if (expect_true (idx < --pollcnt))
82 {
83 polls [idx] = polls [pollcnt];
84 pollidxs [polls [idx].fd] = idx;
85 }
89 } 86 }
90} 87}
91 88
92static void 89static void
93epoll_init (int flags) 90poll_poll (EV_P_ ev_tstamp timeout)
94{ 91{
95 epoll_fd = epoll_create (256); 92 struct pollfd *p;
93 int res;
94
95 EV_RELEASE_CB;
96 res = poll (polls, pollcnt, timeout * 1e3);
97 EV_ACQUIRE_CB;
96 98
97 if (epoll_fd < 0) 99 if (expect_false (res < 0))
98 return; 100 {
101 if (errno == EBADF)
102 fd_ebadf (EV_A);
103 else if (errno == ENOMEM && !syserr_cb)
104 fd_enomem (EV_A);
105 else if (errno != EINTR)
106 ev_syserr ("(libev) poll");
107 }
108 else
109 for (p = polls; res; ++p)
110 {
111 assert (("libev: poll() returned illegal result, broken BSD kernel?", p < polls + pollcnt));
99 112
100 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); 113 if (expect_false (p->revents)) /* this expect is debatable */
114 {
115 --res;
101 116
102 ev_method = EVMETHOD_EPOLL; 117 if (expect_false (p->revents & POLLNVAL))
103 method_fudge = 1e-3; /* needed to compensate for epoll returning early */ 118 fd_kill (EV_A_ p->fd);
104 method_modify = epoll_modify; 119 else
105 method_poll = epoll_poll; 120 fd_event (
106 121 EV_A_
107 eventmax = 64; /* intiial number of events receivable per poll */ 122 p->fd,
108 events = malloc (sizeof (struct epoll_event) * eventmax); 123 (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
124 | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
125 );
126 }
127 }
109} 128}
110 129
130inline_size
131int
132poll_init (EV_P_ int flags)
133{
134 backend_mintime = 1e-3;
135 backend_modify = poll_modify;
136 backend_poll = poll_poll;
137
138 pollidxs = 0; pollidxmax = 0;
139 polls = 0; pollmax = 0; pollcnt = 0;
140
141 return EVBACKEND_POLL;
142}
143
144inline_size
145void
146poll_destroy (EV_P)
147{
148 ev_free (pollidxs);
149 ev_free (polls);
150}
151

Diff Legend

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