… | |
… | |
2 | * libev event processing core, watcher management |
2 | * libev event processing core, watcher management |
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 | #ifdef __cplusplus |
40 | #ifdef __cplusplus |
33 | extern "C" { |
41 | extern "C" { |
34 | #endif |
42 | #endif |
… | |
… | |
280 | |
288 | |
281 | typedef ev_watcher *W; |
289 | typedef ev_watcher *W; |
282 | typedef ev_watcher_list *WL; |
290 | typedef ev_watcher_list *WL; |
283 | typedef ev_watcher_time *WT; |
291 | typedef ev_watcher_time *WT; |
284 | |
292 | |
|
|
293 | #if EV_USE_MONOTONIC |
|
|
294 | /* sig_atomic_t is used to avoid per-thread variables or locking but still */ |
|
|
295 | /* giving it a reasonably high chance of working on typical architetcures */ |
285 | static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
296 | static sig_atomic_t have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
|
|
297 | #endif |
286 | |
298 | |
287 | #ifdef _WIN32 |
299 | #ifdef _WIN32 |
288 | # include "ev_win32.c" |
300 | # include "ev_win32.c" |
289 | #endif |
301 | #endif |
290 | |
302 | |
… | |
… | |
588 | |
600 | |
589 | #if EV_SELECT_IS_WINSOCKET |
601 | #if EV_SELECT_IS_WINSOCKET |
590 | if (events) |
602 | if (events) |
591 | { |
603 | { |
592 | unsigned long argp; |
604 | unsigned long argp; |
|
|
605 | #ifdef EV_FD_TO_WIN32_HANDLE |
|
|
606 | anfd->handle = EV_FD_TO_WIN32_HANDLE (fd); |
|
|
607 | #else |
593 | anfd->handle = _get_osfhandle (fd); |
608 | anfd->handle = _get_osfhandle (fd); |
|
|
609 | #endif |
594 | assert (("libev only supports socket fds in this configuration", ioctlsocket (anfd->handle, FIONREAD, &argp) == 0)); |
610 | assert (("libev only supports socket fds in this configuration", ioctlsocket (anfd->handle, FIONREAD, &argp) == 0)); |
595 | } |
611 | } |
596 | #endif |
612 | #endif |
597 | |
613 | |
598 | { |
614 | { |
… | |
… | |
970 | } |
986 | } |
971 | |
987 | |
972 | unsigned int |
988 | unsigned int |
973 | ev_embeddable_backends (void) |
989 | ev_embeddable_backends (void) |
974 | { |
990 | { |
|
|
991 | int flags = EVBACKEND_EPOLL | EVBACKEND_KQUEUE | EVBACKEND_PORT; |
|
|
992 | |
975 | /* epoll embeddability broken on all linux versions up to at least 2.6.23 */ |
993 | /* epoll embeddability broken on all linux versions up to at least 2.6.23 */ |
976 | return EVBACKEND_KQUEUE |
994 | /* please fix it and tell me how to detect the fix */ |
977 | | EVBACKEND_PORT; |
995 | flags &= ~EVBACKEND_EPOLL; |
|
|
996 | |
|
|
997 | return flags; |
978 | } |
998 | } |
979 | |
999 | |
980 | unsigned int |
1000 | unsigned int |
981 | ev_backend (EV_P) |
1001 | ev_backend (EV_P) |
982 | { |
1002 | { |
… | |
… | |
1289 | { |
1309 | { |
1290 | while (timercnt && ((WT)timers [0])->at <= mn_now) |
1310 | while (timercnt && ((WT)timers [0])->at <= mn_now) |
1291 | { |
1311 | { |
1292 | ev_timer *w = (ev_timer *)timers [0]; |
1312 | ev_timer *w = (ev_timer *)timers [0]; |
1293 | |
1313 | |
1294 | /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/ |
1314 | assert (("inactive timer on timer heap detected", ev_is_active (w))); |
1295 | |
1315 | |
1296 | /* first reschedule or stop timer */ |
1316 | /* first reschedule or stop timer */ |
1297 | if (w->repeat) |
1317 | if (w->repeat) |
1298 | { |
1318 | { |
1299 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
1319 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
… | |
… | |
2264 | ev_embed *w = (ev_embed *)(((char *)io) - offsetof (ev_embed, io)); |
2284 | ev_embed *w = (ev_embed *)(((char *)io) - offsetof (ev_embed, io)); |
2265 | |
2285 | |
2266 | if (ev_cb (w)) |
2286 | if (ev_cb (w)) |
2267 | ev_feed_event (EV_A_ (W)w, EV_EMBED); |
2287 | ev_feed_event (EV_A_ (W)w, EV_EMBED); |
2268 | else |
2288 | else |
2269 | ev_embed_sweep (loop, w); |
2289 | ev_loop (w->other, EVLOOP_NONBLOCK); |
2270 | } |
2290 | } |
2271 | |
2291 | |
2272 | static void |
2292 | static void |
2273 | embed_prepare_cb (EV_P_ ev_prepare *prepare, int revents) |
2293 | embed_prepare_cb (EV_P_ ev_prepare *prepare, int revents) |
2274 | { |
2294 | { |
2275 | ev_embed *w = (ev_embed *)(((char *)prepare) - offsetof (ev_embed, prepare)); |
2295 | ev_embed *w = (ev_embed *)(((char *)prepare) - offsetof (ev_embed, prepare)); |
2276 | |
2296 | |
2277 | fd_reify (w->other); |
2297 | { |
|
|
2298 | struct ev_loop *loop = w->other; |
|
|
2299 | |
|
|
2300 | while (fdchangecnt) |
|
|
2301 | { |
|
|
2302 | fd_reify (EV_A); |
|
|
2303 | ev_loop (EV_A_ EVLOOP_NONBLOCK); |
|
|
2304 | } |
|
|
2305 | } |
2278 | } |
2306 | } |
|
|
2307 | |
|
|
2308 | #if 0 |
|
|
2309 | static void |
|
|
2310 | embed_idle_cb (EV_P_ ev_idle *idle, int revents) |
|
|
2311 | { |
|
|
2312 | ev_idle_stop (EV_A_ idle); |
|
|
2313 | } |
|
|
2314 | #endif |
2279 | |
2315 | |
2280 | void |
2316 | void |
2281 | ev_embed_start (EV_P_ ev_embed *w) |
2317 | ev_embed_start (EV_P_ ev_embed *w) |
2282 | { |
2318 | { |
2283 | if (expect_false (ev_is_active (w))) |
2319 | if (expect_false (ev_is_active (w))) |
… | |
… | |
2294 | |
2330 | |
2295 | ev_prepare_init (&w->prepare, embed_prepare_cb); |
2331 | ev_prepare_init (&w->prepare, embed_prepare_cb); |
2296 | ev_set_priority (&w->prepare, EV_MINPRI); |
2332 | ev_set_priority (&w->prepare, EV_MINPRI); |
2297 | ev_prepare_start (EV_A_ &w->prepare); |
2333 | ev_prepare_start (EV_A_ &w->prepare); |
2298 | |
2334 | |
|
|
2335 | /*ev_idle_init (&w->idle, e,bed_idle_cb);*/ |
|
|
2336 | |
2299 | ev_start (EV_A_ (W)w, 1); |
2337 | ev_start (EV_A_ (W)w, 1); |
2300 | } |
2338 | } |
2301 | |
2339 | |
2302 | void |
2340 | void |
2303 | ev_embed_stop (EV_P_ ev_embed *w) |
2341 | ev_embed_stop (EV_P_ ev_embed *w) |