ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev_poll.c
Revision: 1.3
Committed: Sat Nov 3 21:58:51 2007 UTC (17 years ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.2: +9 -12 lines
Log Message:
prepare for multiple bases

File Contents

# User Rev Content
1 root 1.1 /*
2     * libev epoll fd activity backend
3     *
4     * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de>
5     * All rights reserved.
6     *
7     * Redistribution and use in source and binary forms, with or without
8     * modification, are permitted provided that the following conditions are
9     * met:
10     *
11     * * Redistributions of source code must retain the above copyright
12     * notice, this list of conditions and the following disclaimer.
13     *
14     * * Redistributions in binary form must reproduce the above
15     * copyright notice, this list of conditions and the following
16     * disclaimer in the documentation and/or other materials provided
17     * with the distribution.
18     *
19     * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20     * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
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     */
31    
32 root 1.2 #include <poll.h>
33 root 1.1
34     static void
35 root 1.2 pollidx_init (int *base, int count)
36 root 1.1 {
37 root 1.2 while (count--)
38     *base++ = -1;
39 root 1.1 }
40    
41     static void
42 root 1.3 poll_modify (EV_P_ int fd, int oev, int nev)
43 root 1.1 {
44 root 1.2 int idx;
45     array_needsize (pollidxs, pollidxmax, fd + 1, pollidx_init);
46 root 1.1
47 root 1.2 idx = pollidxs [fd];
48    
49     if (idx < 0) /* need to allocate a new pollfd */
50     {
51     idx = pollcnt++;
52     array_needsize (polls, pollmax, pollcnt, );
53     polls [idx].fd = fd;
54     }
55 root 1.1
56 root 1.2 if (nev)
57     polls [idx].events =
58     (nev & EV_READ ? POLLIN : 0)
59     | (nev & EV_WRITE ? POLLOUT : 0);
60     else /* remove pollfd */
61     {
62     if (idx < pollcnt--)
63     {
64     pollidxs [fd] = -1;
65     polls [idx] = polls [pollcnt];
66     pollidxs [polls [idx].fd] = idx;
67     }
68     }
69 root 1.1 }
70    
71     static void
72 root 1.3 poll_poll (EV_P_ ev_tstamp timeout)
73 root 1.1 {
74 root 1.2 int res = poll (polls, pollcnt, ceil (timeout * 1000.));
75 root 1.1
76 root 1.2 if (res > 0)
77     {
78     int i;
79 root 1.1
80 root 1.2 for (i = 0; i < pollcnt; ++i)
81     fd_event (
82 root 1.3 EV_A_
83 root 1.2 polls [i].fd,
84     (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
85     | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
86     );
87     }
88     else if (res < 0)
89 root 1.1 {
90 root 1.2 if (errno == EBADF)
91 root 1.3 fd_ebadf (EV_A);
92 root 1.2 else if (errno == ENOMEM)
93 root 1.3 fd_enomem (EV_A);
94 root 1.1 }
95     }
96    
97 root 1.3 static int
98     poll_init (EV_P_ int flags)
99 root 1.1 {
100 root 1.2 method_fudge = 1e-3; /* needed to compensate for select returning early, very conservative */
101     method_modify = poll_modify;
102     method_poll = poll_poll;
103 root 1.3
104     return EVMETHOD_POLL;
105 root 1.1 }