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