1 | /* |
1 | /* |
2 | * libev poll fd activity backend |
2 | * libev poll fd activity backend |
3 | * |
3 | * |
4 | * Copyright (c) 2007,2008,2009,2010 Marc Alexander Lehmann <libev@schmorp.de> |
4 | * Copyright (c) 2007,2008,2009,2010,2011,2016,2019 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 modifica- |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
8 | * tion, are permitted provided that the following conditions are met: |
8 | * tion, are permitted provided that the following conditions are met: |
9 | * |
9 | * |
10 | * 1. Redistributions of source code must retain the above copyright notice, |
10 | * 1. Redistributions of source code must retain the above copyright notice, |
11 | * this list of conditions and the following disclaimer. |
11 | * this list of conditions and the following disclaimer. |
12 | * |
12 | * |
13 | * 2. Redistributions in binary form must reproduce the above copyright |
13 | * 2. Redistributions in binary form must reproduce the above copyright |
14 | * notice, this list of conditions and the following disclaimer in the |
14 | * notice, this list of conditions and the following disclaimer in the |
15 | * documentation and/or other materials provided with the distribution. |
15 | * documentation and/or other materials provided with the distribution. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
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- |
18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
19 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
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- |
20 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
… | |
… | |
37 | * either the BSD or the GPL. |
37 | * either the BSD or the GPL. |
38 | */ |
38 | */ |
39 | |
39 | |
40 | #include <poll.h> |
40 | #include <poll.h> |
41 | |
41 | |
42 | void inline_size |
42 | inline_size |
|
|
43 | void |
43 | pollidx_init (int *base, int count) |
44 | pollidx_init (int *base, int count) |
44 | { |
45 | { |
45 | /* consider using memset (.., -1, ...), which is practically guaranteed |
46 | /* consider using memset (.., -1, ...), which is practically guaranteed |
46 | * to work on all systems implementing poll */ |
47 | * to work on all systems implementing poll */ |
47 | while (count--) |
48 | while (count--) |
… | |
… | |
61 | idx = pollidxs [fd]; |
62 | idx = pollidxs [fd]; |
62 | |
63 | |
63 | if (idx < 0) /* need to allocate a new pollfd */ |
64 | if (idx < 0) /* need to allocate a new pollfd */ |
64 | { |
65 | { |
65 | pollidxs [fd] = idx = pollcnt++; |
66 | pollidxs [fd] = idx = pollcnt++; |
66 | array_needsize (struct pollfd, polls, pollmax, pollcnt, EMPTY2); |
67 | array_needsize (struct pollfd, polls, pollmax, pollcnt, array_needsize_noinit); |
67 | polls [idx].fd = fd; |
68 | polls [idx].fd = fd; |
68 | } |
69 | } |
69 | |
70 | |
70 | assert (polls [idx].fd == fd); |
71 | assert (polls [idx].fd == fd); |
71 | |
72 | |
… | |
… | |
90 | { |
91 | { |
91 | struct pollfd *p; |
92 | struct pollfd *p; |
92 | int res; |
93 | int res; |
93 | |
94 | |
94 | EV_RELEASE_CB; |
95 | EV_RELEASE_CB; |
95 | res = poll (polls, pollcnt, (int)ceil (timeout * 1000.)); |
96 | res = poll (polls, pollcnt, timeout * 1e3); |
96 | EV_ACQUIRE_CB; |
97 | EV_ACQUIRE_CB; |
97 | |
98 | |
98 | if (expect_false (res < 0)) |
99 | if (expect_false (res < 0)) |
99 | { |
100 | { |
100 | if (errno == EBADF) |
101 | if (errno == EBADF) |
… | |
… | |
124 | ); |
125 | ); |
125 | } |
126 | } |
126 | } |
127 | } |
127 | } |
128 | } |
128 | |
129 | |
129 | int inline_size |
130 | inline_size |
|
|
131 | int |
130 | poll_init (EV_P_ int flags) |
132 | poll_init (EV_P_ int flags) |
131 | { |
133 | { |
132 | backend_fudge = 0.; /* posix says this is zero */ |
134 | backend_mintime = 1e-3; |
133 | backend_modify = poll_modify; |
135 | backend_modify = poll_modify; |
134 | backend_poll = poll_poll; |
136 | backend_poll = poll_poll; |
135 | |
137 | |
136 | pollidxs = 0; pollidxmax = 0; |
138 | pollidxs = 0; pollidxmax = 0; |
137 | polls = 0; pollmax = 0; pollcnt = 0; |
139 | polls = 0; pollmax = 0; pollcnt = 0; |
138 | |
140 | |
139 | return EVBACKEND_POLL; |
141 | return EVBACKEND_POLL; |
140 | } |
142 | } |
141 | |
143 | |
142 | void inline_size |
144 | inline_size |
|
|
145 | void |
143 | poll_destroy (EV_P) |
146 | poll_destroy (EV_P) |
144 | { |
147 | { |
145 | ev_free (pollidxs); |
148 | ev_free (pollidxs); |
146 | ev_free (polls); |
149 | ev_free (polls); |
147 | } |
150 | } |