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,2009 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 <sys/epoll.h> |
40 | #include <poll.h> |
33 | |
41 | |
34 | static int epoll_fd = -1; |
42 | void inline_size |
35 | |
43 | pollidx_init (int *base, int count) |
36 | static void |
|
|
37 | epoll_modify (int fd, int oev, int nev) |
|
|
38 | { |
44 | { |
39 | int mode = nev ? oev ? EPOLL_CTL_MOD : EPOLL_CTL_ADD : EPOLL_CTL_DEL; |
45 | /* consider using memset (.., -1, ...), which is pratically guarenteed |
40 | |
46 | * to work on all systems implementing poll */ |
41 | struct epoll_event ev; |
47 | while (count--) |
42 | ev.data.fd = fd; |
48 | *base++ = -1; |
43 | ev.events = |
|
|
44 | (nev & EV_READ ? EPOLLIN : 0) |
|
|
45 | | (nev & EV_WRITE ? EPOLLOUT : 0); |
|
|
46 | |
|
|
47 | epoll_ctl (epoll_fd, mode, fd, &ev); |
|
|
48 | } |
49 | } |
49 | |
50 | |
50 | static void |
51 | static void |
51 | epoll_postfork_child (void) |
52 | poll_modify (EV_P_ int fd, int oev, int nev) |
52 | { |
53 | { |
53 | int fd; |
54 | int idx; |
54 | |
55 | |
55 | epoll_fd = epoll_create (256); |
56 | if (oev == nev) |
56 | fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); |
|
|
57 | |
|
|
58 | /* re-register interest in fds */ |
|
|
59 | for (fd = 0; fd < anfdmax; ++fd) |
|
|
60 | if (anfds [fd].events)//D |
|
|
61 | epoll_modify (fd, EV_NONE, anfds [fd].events); |
|
|
62 | } |
|
|
63 | |
|
|
64 | static struct epoll_event *events; |
|
|
65 | static int eventmax; |
|
|
66 | |
|
|
67 | static void |
|
|
68 | epoll_poll (ev_tstamp timeout) |
|
|
69 | { |
|
|
70 | int eventcnt = epoll_wait (epoll_fd, events, eventmax, ceil (timeout * 1000.)); |
|
|
71 | int i; |
|
|
72 | |
|
|
73 | if (eventcnt < 0) |
|
|
74 | return; |
57 | return; |
75 | |
58 | |
76 | for (i = 0; i < eventcnt; ++i) |
59 | array_needsize (int, pollidxs, pollidxmax, fd + 1, pollidx_init); |
77 | fd_event ( |
|
|
78 | events [i].data.fd, |
|
|
79 | (events [i].events & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0) |
|
|
80 | | (events [i].events & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0) |
|
|
81 | ); |
|
|
82 | |
60 | |
83 | /* if the receive array was full, increase its size */ |
61 | idx = pollidxs [fd]; |
84 | if (expect_false (eventcnt == eventmax)) |
62 | |
|
|
63 | if (idx < 0) /* need to allocate a new pollfd */ |
85 | { |
64 | { |
86 | free (events); |
65 | pollidxs [fd] = idx = pollcnt++; |
87 | eventmax = array_roundsize (events, eventmax << 1); |
66 | array_needsize (struct pollfd, polls, pollmax, pollcnt, EMPTY2); |
88 | events = malloc (sizeof (struct epoll_event) * eventmax); |
67 | polls [idx].fd = fd; |
|
|
68 | } |
|
|
69 | |
|
|
70 | assert (polls [idx].fd == fd); |
|
|
71 | |
|
|
72 | if (nev) |
|
|
73 | polls [idx].events = |
|
|
74 | (nev & EV_READ ? POLLIN : 0) |
|
|
75 | | (nev & EV_WRITE ? POLLOUT : 0); |
|
|
76 | else /* remove pollfd */ |
|
|
77 | { |
|
|
78 | pollidxs [fd] = -1; |
|
|
79 | |
|
|
80 | if (expect_true (idx < --pollcnt)) |
|
|
81 | { |
|
|
82 | polls [idx] = polls [pollcnt]; |
|
|
83 | pollidxs [polls [idx].fd] = idx; |
|
|
84 | } |
89 | } |
85 | } |
90 | } |
86 | } |
91 | |
87 | |
92 | static void |
88 | static void |
93 | epoll_init (int flags) |
89 | poll_poll (EV_P_ ev_tstamp timeout) |
94 | { |
90 | { |
95 | epoll_fd = epoll_create (256); |
91 | struct pollfd *p; |
|
|
92 | int res; |
|
|
93 | |
|
|
94 | EV_RELEASE_CB; |
|
|
95 | res = poll (polls, pollcnt, (int)ceil (timeout * 1000.)); |
|
|
96 | EV_ACQUIRE_CB; |
96 | |
97 | |
97 | if (epoll_fd < 0) |
98 | if (expect_false (res < 0)) |
98 | return; |
99 | { |
|
|
100 | if (errno == EBADF) |
|
|
101 | fd_ebadf (EV_A); |
|
|
102 | else if (errno == ENOMEM && !syserr_cb) |
|
|
103 | fd_enomem (EV_A); |
|
|
104 | else if (errno != EINTR) |
|
|
105 | ev_syserr ("(libev) poll"); |
|
|
106 | } |
|
|
107 | else |
|
|
108 | for (p = polls; res; ++p) |
|
|
109 | if (expect_false (p->revents)) /* this expect is debatable */ |
|
|
110 | { |
|
|
111 | --res; |
99 | |
112 | |
100 | fcntl (epoll_fd, F_SETFD, FD_CLOEXEC); |
113 | if (expect_false (p->revents & POLLNVAL)) |
101 | |
114 | fd_kill (EV_A_ p->fd); |
102 | ev_method = EVMETHOD_EPOLL; |
115 | else |
103 | method_fudge = 1e-3; /* needed to compensate for epoll returning early */ |
116 | fd_event ( |
104 | method_modify = epoll_modify; |
117 | EV_A_ |
105 | method_poll = epoll_poll; |
118 | p->fd, |
106 | |
119 | (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |
107 | eventmax = 64; /* intiial number of events receivable per poll */ |
120 | | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) |
108 | events = malloc (sizeof (struct epoll_event) * eventmax); |
121 | ); |
|
|
122 | } |
109 | } |
123 | } |
110 | |
124 | |
|
|
125 | int inline_size |
|
|
126 | poll_init (EV_P_ int flags) |
|
|
127 | { |
|
|
128 | backend_fudge = 0.; /* posix says this is zero */ |
|
|
129 | backend_modify = poll_modify; |
|
|
130 | backend_poll = poll_poll; |
|
|
131 | |
|
|
132 | pollidxs = 0; pollidxmax = 0; |
|
|
133 | polls = 0; pollmax = 0; pollcnt = 0; |
|
|
134 | |
|
|
135 | return EVBACKEND_POLL; |
|
|
136 | } |
|
|
137 | |
|
|
138 | void inline_size |
|
|
139 | poll_destroy (EV_P) |
|
|
140 | { |
|
|
141 | ev_free (pollidxs); |
|
|
142 | ev_free (polls); |
|
|
143 | } |
|
|
144 | |