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.20 by root, Sun Dec 9 03:51:19 2007 UTC vs.
Revision 1.23 by root, Thu Apr 10 06:48:12 2008 UTC

… …
2 * libev poll 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
34void inline_size 42void inline_size
… …
76} 84}
77 85
78static void 86static void
79poll_poll (EV_P_ ev_tstamp timeout) 87poll_poll (EV_P_ ev_tstamp timeout)
80{ 88{
81 int i; 89 struct pollfd *p;
82 int res = poll (polls, pollcnt, (int)ceil (timeout * 1000.)); 90 int res = poll (polls, pollcnt, (int)ceil (timeout * 1000.));
83 91
84 if (expect_false (res < 0)) 92 if (expect_false (res < 0))
85 { 93 {
86 if (errno == EBADF) 94 if (errno == EBADF)
87 fd_ebadf (EV_A); 95 fd_ebadf (EV_A);
88 else if (errno == ENOMEM && !syserr_cb) 96 else if (errno == ENOMEM && !syserr_cb)
89 fd_enomem (EV_A); 97 fd_enomem (EV_A);
90 else if (errno != EINTR) 98 else if (errno != EINTR)
91 syserr ("(libev) poll"); 99 syserr ("(libev) poll");
92
93 return;
94 } 100 }
95 101
96 for (i = 0; i < pollcnt; ++i) 102 for (p = polls; res; ++p)
103 if (expect_false (p->revents)) /* this expect is debatable */
104 {
105 --res;
106
97 if (expect_false (polls [i].revents & POLLNVAL)) 107 if (expect_false (p->revents & POLLNVAL))
98 fd_kill (EV_A_ polls [i].fd); 108 fd_kill (EV_A_ p->fd);
99 else 109 else
100 fd_event ( 110 fd_event (
101 EV_A_ 111 EV_A_
102 polls [i].fd, 112 p->fd,
103 (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) 113 (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
104 | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) 114 | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
105 ); 115 );
116 }
106} 117}
107 118
108int inline_size 119int inline_size
109poll_init (EV_P_ int flags) 120poll_init (EV_P_ int flags)
110{ 121{

Diff Legend

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