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.23 by root, Thu Apr 10 06:48:12 2008 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 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: 9 *
10 * 1. Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer.
12 *
13 * 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 *
17 * 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.
10 * 27 *
11 * * Redistributions of source code must retain the above copyright 28 * Alternatively, the contents of this file may be used under the terms of
12 * notice, this list of conditions and the following disclaimer. 29 * the GNU General Public License ("GPL") version 2 or any later version,
13 * 30 * in which case the provisions of the GPL are applicable instead of
14 * * Redistributions in binary form must reproduce the above 31 * the above. If you wish to allow the use of your version of this file
15 * copyright notice, this list of conditions and the following 32 * only under the terms of the GPL and not to allow others to use your
16 * disclaimer in the documentation and/or other materials provided 33 * version of this file under the BSD license, indicate your decision
17 * with the distribution. 34 * by deleting the provisions above and replace them with the notice
18 * 35 * and other provisions required by the GPL. If you do not delete the
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 36 * provisions above, a recipient may use your version of this file under
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 37 * either the BSD or the GPL.
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 */ 38 */
31 39
32#include <sys/epoll.h> 40#include <poll.h>
33 41
34static int epoll_fd = -1; 42void inline_size
35 43pollidx_init (int *base, int count)
36static void
37epoll_modify (int fd, int oev, int nev)
38{ 44{
39 int mode = nev ? oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD : EPOLL_CTL_DEL; 45 while (count--)
40 46 *base++ = -1;
41 struct epoll_event ev;
42 ev.data.fd = fd;
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} 47}
49 48
50static void 49static void
51epoll_postfork_child (void) 50poll_modify (EV_P_ int fd, int oev, int nev)
52{ 51{
53 int fd; 52 int idx;
54 53
55 epoll_fd = epoll_create (256); 54 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; 55 return;
75 56
76 for (i = 0; i < eventcnt; ++i) 57 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 58
83 /* if the receive array was full, increase its size */ 59 idx = pollidxs [fd];
84 if (expect_false (eventcnt == eventmax)) 60
61 if (idx < 0) /* need to allocate a new pollfd */
85 { 62 {
86 free (events); 63 pollidxs [fd] = idx = pollcnt++;
87 eventmax = array_roundsize (events, eventmax << 1); 64 array_needsize (struct pollfd, polls, pollmax, pollcnt, EMPTY2);
88 events = malloc (sizeof (struct epoll_event) * eventmax); 65 polls [idx].fd = fd;
66 }
67
68 assert (polls [idx].fd == fd);
69
70 if (nev)
71 polls [idx].events =
72 (nev & EV_READ ? POLLIN : 0)
73 | (nev & EV_WRITE ? POLLOUT : 0);
74 else /* remove pollfd */
75 {
76 pollidxs [fd] = -1;
77
78 if (expect_true (idx < --pollcnt))
79 {
80 polls [idx] = polls [pollcnt];
81 pollidxs [polls [idx].fd] = idx;
82 }
89 } 83 }
90} 84}
91 85
92static void 86static void
93epoll_init (int flags) 87poll_poll (EV_P_ ev_tstamp timeout)
94{ 88{
95 epoll_fd = epoll_create (256); 89 struct pollfd *p;
90 int res = poll (polls, pollcnt, (int)ceil (timeout * 1000.));
96 91
97 if (epoll_fd < 0) 92 if (expect_false (res < 0))
98 return; 93 {
94 if (errno == EBADF)
95 fd_ebadf (EV_A);
96 else if (errno == ENOMEM && !syserr_cb)
97 fd_enomem (EV_A);
98 else if (errno != EINTR)
99 syserr ("(libev) poll");
100 }
99 101
100 fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); 102 for (p = polls; res; ++p)
103 if (expect_false (p->revents)) /* this expect is debatable */
104 {
105 --res;
101 106
102 ev_method = EVMETHOD_EPOLL; 107 if (expect_false (p->revents & POLLNVAL))
103 method_fudge = 1e-3; /* needed to compensate for epoll returning early */ 108 fd_kill (EV_A_ p->fd);
104 method_modify = epoll_modify; 109 else
105 method_poll = epoll_poll; 110 fd_event (
106 111 EV_A_
107 eventmax = 64; /* intiial number of events receivable per poll */ 112 p->fd,
108 events = malloc (sizeof (struct epoll_event) * eventmax); 113 (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
114 | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
115 );
116 }
109} 117}
110 118
119int inline_size
120poll_init (EV_P_ int flags)
121{
122 backend_fudge = 0.; /* posix says this is zero */
123 backend_modify = poll_modify;
124 backend_poll = poll_poll;
125
126 pollidxs = 0; pollidxmax = 0;
127 polls = 0; pollmax = 0; pollcnt = 0;
128
129 return EVBACKEND_POLL;
130}
131
132void inline_size
133poll_destroy (EV_P)
134{
135 ev_free (pollidxs);
136 ev_free (polls);
137}
138

Diff Legend

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