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.2 by root, Fri Nov 2 16:54:35 2007 UTC vs.
Revision 1.22 by root, Wed Apr 9 22:33:55 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 <poll.h> 40#include <poll.h>
33 41
34static struct pollfd *polls; 42void inline_size
35static int pollmax, pollcnt;
36static int *pollidxs; /* maps fds into structure indices */
37static int pollidxmax;
38
39static void
40pollidx_init (int *base, int count) 43pollidx_init (int *base, int count)
41{ 44{
42 while (count--) 45 while (count--)
43 *base++ = -1; 46 *base++ = -1;
44} 47}
45 48
46static void 49static void
47poll_modify (int fd, int oev, int nev) 50poll_modify (EV_P_ int fd, int oev, int nev)
48{ 51{
49 int idx; 52 int idx;
53
54 if (oev == nev)
55 return;
56
50 array_needsize (pollidxs, pollidxmax, fd + 1, pollidx_init); 57 array_needsize (int, pollidxs, pollidxmax, fd + 1, pollidx_init);
51 58
52 idx = pollidxs [fd]; 59 idx = pollidxs [fd];
53 60
54 if (idx < 0) /* need to allocate a new pollfd */ 61 if (idx < 0) /* need to allocate a new pollfd */
55 { 62 {
56 idx = pollcnt++; 63 pollidxs [fd] = idx = pollcnt++;
57 array_needsize (polls, pollmax, pollcnt, ); 64 array_needsize (struct pollfd, polls, pollmax, pollcnt, EMPTY2);
58 polls [idx].fd = fd; 65 polls [idx].fd = fd;
59 } 66 }
67
68 assert (polls [idx].fd == fd);
60 69
61 if (nev) 70 if (nev)
62 polls [idx].events = 71 polls [idx].events =
63 (nev & EV_READ ? POLLIN : 0) 72 (nev & EV_READ ? POLLIN : 0)
64 | (nev & EV_WRITE ? POLLOUT : 0); 73 | (nev & EV_WRITE ? POLLOUT : 0);
65 else /* remove pollfd */ 74 else /* remove pollfd */
66 { 75 {
67 if (idx < pollcnt--) 76 pollidxs [fd] = -1;
77
78 if (expect_true (idx < --pollcnt))
68 { 79 {
69 pollidxs [fd] = -1;
70 polls [idx] = polls [pollcnt]; 80 polls [idx] = polls [pollcnt];
71 pollidxs [polls [idx].fd] = idx; 81 pollidxs [polls [idx].fd] = idx;
72 } 82 }
73 } 83 }
74} 84}
75 85
76static void 86static void
77poll_poll (ev_tstamp timeout) 87poll_poll (EV_P_ ev_tstamp timeout)
78{ 88{
89 int i;
79 int res = poll (polls, pollcnt, ceil (timeout * 1000.)); 90 int res = poll (polls, pollcnt, (int)ceil (timeout * 1000.));
80 91
81 if (res > 0) 92 if (expect_false (res < 0))
82 { 93 {
83 int i; 94 if (errno == EBADF)
84 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 }
101 else if (res > 0)
85 for (i = 0; i < pollcnt; ++i) 102 for (i = 0; i < pollcnt; ++i)
103 if (expect_false (polls [i].revents & POLLNVAL))
104 fd_kill (EV_A_ polls [i].fd);
105 else
86 fd_event ( 106 fd_event (
107 EV_A_
87 polls [i].fd, 108 polls [i].fd,
88 (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) 109 (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
89 | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) 110 | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
90 ); 111 );
91 }
92 else if (res < 0)
93 {
94 if (errno == EBADF)
95 fd_ebadf ();
96 else if (errno == ENOMEM)
97 fd_enomem ();
98 }
99} 112}
100 113
101static void 114int inline_size
102poll_init (int flags) 115poll_init (EV_P_ int flags)
103{ 116{
104 ev_method = EVMETHOD_POLL; 117 backend_fudge = 0.; /* posix says this is zero */
105 method_fudge = 1e-3; /* needed to compensate for select returning early, very conservative */
106 method_modify = poll_modify; 118 backend_modify = poll_modify;
107 method_poll = poll_poll; 119 backend_poll = poll_poll;
120
121 pollidxs = 0; pollidxmax = 0;
122 polls = 0; pollmax = 0; pollcnt = 0;
123
124 return EVBACKEND_POLL;
108} 125}
126
127void inline_size
128poll_destroy (EV_P)
129{
130 ev_free (pollidxs);
131 ev_free (polls);
132}
133

Diff Legend

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