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,2008 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 | { |
|
|
45 | /* consider using memset (.., -1, ...), which is pratically guarenteed |
|
|
46 | * to work on all systems implementing poll */ |
37 | while (count--) |
47 | while (count--) |
38 | *base++ = -1; |
48 | *base++ = -1; |
39 | } |
49 | } |
40 | |
50 | |
41 | static void |
51 | static void |
… | |
… | |
65 | | (nev & EV_WRITE ? POLLOUT : 0); |
75 | | (nev & EV_WRITE ? POLLOUT : 0); |
66 | else /* remove pollfd */ |
76 | else /* remove pollfd */ |
67 | { |
77 | { |
68 | pollidxs [fd] = -1; |
78 | pollidxs [fd] = -1; |
69 | |
79 | |
70 | if (idx < --pollcnt) |
80 | if (expect_true (idx < --pollcnt)) |
71 | { |
81 | { |
72 | polls [idx] = polls [pollcnt]; |
82 | polls [idx] = polls [pollcnt]; |
73 | pollidxs [polls [idx].fd] = idx; |
83 | pollidxs [polls [idx].fd] = idx; |
74 | } |
84 | } |
75 | } |
85 | } |
76 | } |
86 | } |
77 | |
87 | |
78 | static void |
88 | static void |
79 | poll_poll (EV_P_ ev_tstamp timeout) |
89 | poll_poll (EV_P_ ev_tstamp timeout) |
80 | { |
90 | { |
81 | int i; |
91 | struct pollfd *p; |
82 | int res = poll (polls, pollcnt, (int)ceil (timeout * 1000.)); |
92 | int res = poll (polls, pollcnt, (int)ceil (timeout * 1000.)); |
83 | |
93 | |
84 | if (res < 0) |
94 | if (expect_false (res < 0)) |
85 | { |
95 | { |
86 | if (errno == EBADF) |
96 | if (errno == EBADF) |
87 | fd_ebadf (EV_A); |
97 | fd_ebadf (EV_A); |
88 | else if (errno == ENOMEM && !syserr_cb) |
98 | else if (errno == ENOMEM && !syserr_cb) |
89 | fd_enomem (EV_A); |
99 | fd_enomem (EV_A); |
90 | else if (errno != EINTR) |
100 | else if (errno != EINTR) |
91 | syserr ("(libev) poll"); |
101 | ev_syserr ("(libev) poll"); |
|
|
102 | } |
|
|
103 | else |
|
|
104 | for (p = polls; res; ++p) |
|
|
105 | if (expect_false (p->revents)) /* this expect is debatable */ |
|
|
106 | { |
|
|
107 | --res; |
92 | |
108 | |
93 | return; |
109 | if (expect_false (p->revents & POLLNVAL)) |
94 | } |
|
|
95 | |
|
|
96 | for (i = 0; i < pollcnt; ++i) |
|
|
97 | if (polls [i].revents & POLLNVAL) |
|
|
98 | fd_kill (EV_A_ polls [i].fd); |
110 | fd_kill (EV_A_ p->fd); |
99 | else |
111 | else |
100 | fd_event ( |
112 | fd_event ( |
101 | EV_A_ |
113 | EV_A_ |
102 | polls [i].fd, |
114 | p->fd, |
103 | (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |
115 | (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |
104 | | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) |
116 | | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) |
105 | ); |
117 | ); |
|
|
118 | } |
106 | } |
119 | } |
107 | |
120 | |
108 | static int |
121 | int inline_size |
109 | poll_init (EV_P_ int flags) |
122 | poll_init (EV_P_ int flags) |
110 | { |
123 | { |
111 | backend_fudge = 1e-3; /* needed to compensate for select returning early, very conservative */ |
124 | backend_fudge = 0.; /* posix says this is zero */ |
112 | backend_modify = poll_modify; |
125 | backend_modify = poll_modify; |
113 | backend_poll = poll_poll; |
126 | backend_poll = poll_poll; |
114 | |
127 | |
115 | pollidxs = 0; pollidxmax = 0; |
128 | pollidxs = 0; pollidxmax = 0; |
116 | polls = 0; pollmax = 0; pollcnt = 0; |
129 | polls = 0; pollmax = 0; pollcnt = 0; |
117 | |
130 | |
118 | return EVBACKEND_POLL; |
131 | return EVBACKEND_POLL; |
119 | } |
132 | } |
120 | |
133 | |
121 | static void |
134 | void inline_size |
122 | poll_destroy (EV_P) |
135 | poll_destroy (EV_P) |
123 | { |
136 | { |
124 | ev_free (pollidxs); |
137 | ev_free (pollidxs); |
125 | ev_free (polls); |
138 | ev_free (polls); |
126 | } |
139 | } |