… | |
… | |
4 | |
4 | |
5 | =head1 SYNOPSIS |
5 | =head1 SYNOPSIS |
6 | |
6 | |
7 | #include <ev.h> |
7 | #include <ev.h> |
8 | |
8 | |
9 | =head1 EXAMPLE PROGRAM |
9 | =head2 EXAMPLE PROGRAM |
10 | |
10 | |
11 | #include <ev.h> |
11 | #include <ev.h> |
12 | |
12 | |
13 | ev_io stdin_watcher; |
13 | ev_io stdin_watcher; |
14 | ev_timer timeout_watcher; |
14 | ev_timer timeout_watcher; |
… | |
… | |
65 | You register interest in certain events by registering so-called I<event |
65 | You register interest in certain events by registering so-called I<event |
66 | watchers>, which are relatively small C structures you initialise with the |
66 | watchers>, which are relatively small C structures you initialise with the |
67 | details of the event, and then hand it over to libev by I<starting> the |
67 | details of the event, and then hand it over to libev by I<starting> the |
68 | watcher. |
68 | watcher. |
69 | |
69 | |
70 | =head1 FEATURES |
70 | =head2 FEATURES |
71 | |
71 | |
72 | Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the |
72 | Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the |
73 | BSD-specific C<kqueue> and the Solaris-specific event port mechanisms |
73 | BSD-specific C<kqueue> and the Solaris-specific event port mechanisms |
74 | for file descriptor events (C<ev_io>), the Linux C<inotify> interface |
74 | for file descriptor events (C<ev_io>), the Linux C<inotify> interface |
75 | (for C<ev_stat>), relative timers (C<ev_timer>), absolute timers |
75 | (for C<ev_stat>), relative timers (C<ev_timer>), absolute timers |
… | |
… | |
82 | |
82 | |
83 | It also is quite fast (see this |
83 | It also is quite fast (see this |
84 | L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent |
84 | L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent |
85 | for example). |
85 | for example). |
86 | |
86 | |
87 | =head1 CONVENTIONS |
87 | =head2 CONVENTIONS |
88 | |
88 | |
89 | Libev is very configurable. In this manual the default configuration will |
89 | Libev is very configurable. In this manual the default configuration will |
90 | be described, which supports multiple event loops. For more info about |
90 | be described, which supports multiple event loops. For more info about |
91 | various configuration options please have a look at B<EMBED> section in |
91 | various configuration options please have a look at B<EMBED> section in |
92 | this manual. If libev was configured without support for multiple event |
92 | this manual. If libev was configured without support for multiple event |
93 | loops, then all functions taking an initial argument of name C<loop> |
93 | loops, then all functions taking an initial argument of name C<loop> |
94 | (which is always of type C<struct ev_loop *>) will not have this argument. |
94 | (which is always of type C<struct ev_loop *>) will not have this argument. |
95 | |
95 | |
96 | =head1 TIME REPRESENTATION |
96 | =head2 TIME REPRESENTATION |
97 | |
97 | |
98 | Libev represents time as a single floating point number, representing the |
98 | Libev represents time as a single floating point number, representing the |
99 | (fractional) number of seconds since the (POSIX) epoch (somewhere near |
99 | (fractional) number of seconds since the (POSIX) epoch (somewhere near |
100 | the beginning of 1970, details are complicated, don't ask). This type is |
100 | the beginning of 1970, details are complicated, don't ask). This type is |
101 | called C<ev_tstamp>, which is what you should use too. It usually aliases |
101 | called C<ev_tstamp>, which is what you should use too. It usually aliases |
… | |
… | |
260 | flags. If that is troubling you, check C<ev_backend ()> afterwards). |
260 | flags. If that is troubling you, check C<ev_backend ()> afterwards). |
261 | |
261 | |
262 | If you don't know what event loop to use, use the one returned from this |
262 | If you don't know what event loop to use, use the one returned from this |
263 | function. |
263 | function. |
264 | |
264 | |
|
|
265 | The default loop is the only loop that can handle C<ev_signal> and |
|
|
266 | C<ev_child> watchers, and to do this, it always registers a handler |
|
|
267 | for C<SIGCHLD>. If this is a problem for your app you can either |
|
|
268 | create a dynamic loop with C<ev_loop_new> that doesn't do that, or you |
|
|
269 | can simply overwrite the C<SIGCHLD> signal handler I<after> calling |
|
|
270 | C<ev_default_init>. |
|
|
271 | |
265 | The flags argument can be used to specify special behaviour or specific |
272 | The flags argument can be used to specify special behaviour or specific |
266 | backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). |
273 | backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). |
267 | |
274 | |
268 | The following flags are supported: |
275 | The following flags are supported: |
269 | |
276 | |
… | |
… | |
306 | =item C<EVBACKEND_SELECT> (value 1, portable select backend) |
313 | =item C<EVBACKEND_SELECT> (value 1, portable select backend) |
307 | |
314 | |
308 | This is your standard select(2) backend. Not I<completely> standard, as |
315 | This is your standard select(2) backend. Not I<completely> standard, as |
309 | libev tries to roll its own fd_set with no limits on the number of fds, |
316 | libev tries to roll its own fd_set with no limits on the number of fds, |
310 | but if that fails, expect a fairly low limit on the number of fds when |
317 | but if that fails, expect a fairly low limit on the number of fds when |
311 | using this backend. It doesn't scale too well (O(highest_fd)), but its usually |
318 | using this backend. It doesn't scale too well (O(highest_fd)), but its |
312 | the fastest backend for a low number of fds. |
319 | usually the fastest backend for a low number of (low-numbered :) fds. |
|
|
320 | |
|
|
321 | To get good performance out of this backend you need a high amount of |
|
|
322 | parallelity (most of the file descriptors should be busy). If you are |
|
|
323 | writing a server, you should C<accept ()> in a loop to accept as many |
|
|
324 | connections as possible during one iteration. You might also want to have |
|
|
325 | a look at C<ev_set_io_collect_interval ()> to increase the amount of |
|
|
326 | readyness notifications you get per iteration. |
313 | |
327 | |
314 | =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) |
328 | =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) |
315 | |
329 | |
316 | And this is your standard poll(2) backend. It's more complicated than |
330 | And this is your standard poll(2) backend. It's more complicated |
317 | select, but handles sparse fds better and has no artificial limit on the |
331 | than select, but handles sparse fds better and has no artificial |
318 | number of fds you can use (except it will slow down considerably with a |
332 | limit on the number of fds you can use (except it will slow down |
319 | lot of inactive fds). It scales similarly to select, i.e. O(total_fds). |
333 | considerably with a lot of inactive fds). It scales similarly to select, |
|
|
334 | i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for |
|
|
335 | performance tips. |
320 | |
336 | |
321 | =item C<EVBACKEND_EPOLL> (value 4, Linux) |
337 | =item C<EVBACKEND_EPOLL> (value 4, Linux) |
322 | |
338 | |
323 | For few fds, this backend is a bit little slower than poll and select, |
339 | For few fds, this backend is a bit little slower than poll and select, |
324 | but it scales phenomenally better. While poll and select usually scale |
340 | but it scales phenomenally better. While poll and select usually scale |
325 | like O(total_fds) where n is the total number of fds (or the highest fd), |
341 | like O(total_fds) where n is the total number of fds (or the highest fd), |
326 | epoll scales either O(1) or O(active_fds). The epoll design has a number |
342 | epoll scales either O(1) or O(active_fds). The epoll design has a number |
327 | of shortcomings, such as silently dropping events in some hard-to-detect |
343 | of shortcomings, such as silently dropping events in some hard-to-detect |
328 | cases and rewiring a syscall per fd change, no fork support and bad |
344 | cases and rewiring a syscall per fd change, no fork support and bad |
329 | support for dup: |
345 | support for dup. |
330 | |
346 | |
331 | While stopping, setting and starting an I/O watcher in the same iteration |
347 | While stopping, setting and starting an I/O watcher in the same iteration |
332 | will result in some caching, there is still a syscall per such incident |
348 | will result in some caching, there is still a syscall per such incident |
333 | (because the fd could point to a different file description now), so its |
349 | (because the fd could point to a different file description now), so its |
334 | best to avoid that. Also, C<dup ()>'ed file descriptors might not work |
350 | best to avoid that. Also, C<dup ()>'ed file descriptors might not work |
335 | very well if you register events for both fds. |
351 | very well if you register events for both fds. |
336 | |
352 | |
337 | Please note that epoll sometimes generates spurious notifications, so you |
353 | Please note that epoll sometimes generates spurious notifications, so you |
338 | need to use non-blocking I/O or other means to avoid blocking when no data |
354 | need to use non-blocking I/O or other means to avoid blocking when no data |
339 | (or space) is available. |
355 | (or space) is available. |
|
|
356 | |
|
|
357 | Best performance from this backend is achieved by not unregistering all |
|
|
358 | watchers for a file descriptor until it has been closed, if possible, i.e. |
|
|
359 | keep at least one watcher active per fd at all times. |
|
|
360 | |
|
|
361 | While nominally embeddeble in other event loops, this feature is broken in |
|
|
362 | all kernel versions tested so far. |
340 | |
363 | |
341 | =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) |
364 | =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) |
342 | |
365 | |
343 | Kqueue deserves special mention, as at the time of this writing, it |
366 | Kqueue deserves special mention, as at the time of this writing, it |
344 | was broken on all BSDs except NetBSD (usually it doesn't work reliably |
367 | was broken on all BSDs except NetBSD (usually it doesn't work reliably |
… | |
… | |
357 | course). While stopping, setting and starting an I/O watcher does never |
380 | course). While stopping, setting and starting an I/O watcher does never |
358 | cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to |
381 | cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to |
359 | two event changes per incident, support for C<fork ()> is very bad and it |
382 | two event changes per incident, support for C<fork ()> is very bad and it |
360 | drops fds silently in similarly hard-to-detect cases. |
383 | drops fds silently in similarly hard-to-detect cases. |
361 | |
384 | |
|
|
385 | This backend usually performs well under most conditions. |
|
|
386 | |
|
|
387 | While nominally embeddable in other event loops, this doesn't work |
|
|
388 | everywhere, so you might need to test for this. And since it is broken |
|
|
389 | almost everywhere, you should only use it when you have a lot of sockets |
|
|
390 | (for which it usually works), by embedding it into another event loop |
|
|
391 | (e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for |
|
|
392 | sockets. |
|
|
393 | |
362 | =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) |
394 | =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) |
363 | |
395 | |
364 | This is not implemented yet (and might never be). |
396 | This is not implemented yet (and might never be, unless you send me an |
|
|
397 | implementation). According to reports, C</dev/poll> only supports sockets |
|
|
398 | and is not embeddable, which would limit the usefulness of this backend |
|
|
399 | immensely. |
365 | |
400 | |
366 | =item C<EVBACKEND_PORT> (value 32, Solaris 10) |
401 | =item C<EVBACKEND_PORT> (value 32, Solaris 10) |
367 | |
402 | |
368 | This uses the Solaris 10 event port mechanism. As with everything on Solaris, |
403 | This uses the Solaris 10 event port mechanism. As with everything on Solaris, |
369 | it's really slow, but it still scales very well (O(active_fds)). |
404 | it's really slow, but it still scales very well (O(active_fds)). |
370 | |
405 | |
371 | Please note that solaris event ports can deliver a lot of spurious |
406 | Please note that solaris event ports can deliver a lot of spurious |
372 | notifications, so you need to use non-blocking I/O or other means to avoid |
407 | notifications, so you need to use non-blocking I/O or other means to avoid |
373 | blocking when no data (or space) is available. |
408 | blocking when no data (or space) is available. |
374 | |
409 | |
|
|
410 | While this backend scales well, it requires one system call per active |
|
|
411 | file descriptor per loop iteration. For small and medium numbers of file |
|
|
412 | descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend |
|
|
413 | might perform better. |
|
|
414 | |
|
|
415 | On the positive side, ignoring the spurious readyness notifications, this |
|
|
416 | backend actually performed to specification in all tests and is fully |
|
|
417 | embeddable, which is a rare feat among the OS-specific backends. |
|
|
418 | |
375 | =item C<EVBACKEND_ALL> |
419 | =item C<EVBACKEND_ALL> |
376 | |
420 | |
377 | Try all backends (even potentially broken ones that wouldn't be tried |
421 | Try all backends (even potentially broken ones that wouldn't be tried |
378 | with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as |
422 | with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as |
379 | C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. |
423 | C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. |
380 | |
424 | |
|
|
425 | It is definitely not recommended to use this flag. |
|
|
426 | |
381 | =back |
427 | =back |
382 | |
428 | |
383 | If one or more of these are ored into the flags value, then only these |
429 | If one or more of these are ored into the flags value, then only these |
384 | backends will be tried (in the reverse order as given here). If none are |
430 | backends will be tried (in the reverse order as listed here). If none are |
385 | specified, most compiled-in backend will be tried, usually in reverse |
431 | specified, all backends in C<ev_recommended_backends ()> will be tried. |
386 | order of their flag values :) |
|
|
387 | |
432 | |
388 | The most typical usage is like this: |
433 | The most typical usage is like this: |
389 | |
434 | |
390 | if (!ev_default_loop (0)) |
435 | if (!ev_default_loop (0)) |
391 | fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); |
436 | fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); |
… | |
… | |
438 | Like C<ev_default_destroy>, but destroys an event loop created by an |
483 | Like C<ev_default_destroy>, but destroys an event loop created by an |
439 | earlier call to C<ev_loop_new>. |
484 | earlier call to C<ev_loop_new>. |
440 | |
485 | |
441 | =item ev_default_fork () |
486 | =item ev_default_fork () |
442 | |
487 | |
|
|
488 | This function sets a flag that causes subsequent C<ev_loop> iterations |
443 | This function reinitialises the kernel state for backends that have |
489 | to reinitialise the kernel state for backends that have one. Despite the |
444 | one. Despite the name, you can call it anytime, but it makes most sense |
490 | name, you can call it anytime, but it makes most sense after forking, in |
445 | after forking, in either the parent or child process (or both, but that |
491 | the child process (or both child and parent, but that again makes little |
446 | again makes little sense). |
492 | sense). You I<must> call it in the child before using any of the libev |
|
|
493 | functions, and it will only take effect at the next C<ev_loop> iteration. |
447 | |
494 | |
448 | You I<must> call this function in the child process after forking if and |
495 | On the other hand, you only need to call this function in the child |
449 | only if you want to use the event library in both processes. If you just |
496 | process if and only if you want to use the event library in the child. If |
450 | fork+exec, you don't have to call it. |
497 | you just fork+exec, you don't have to call it at all. |
451 | |
498 | |
452 | The function itself is quite fast and it's usually not a problem to call |
499 | The function itself is quite fast and it's usually not a problem to call |
453 | it just in case after a fork. To make this easy, the function will fit in |
500 | it just in case after a fork. To make this easy, the function will fit in |
454 | quite nicely into a call to C<pthread_atfork>: |
501 | quite nicely into a call to C<pthread_atfork>: |
455 | |
502 | |
456 | pthread_atfork (0, 0, ev_default_fork); |
503 | pthread_atfork (0, 0, ev_default_fork); |
457 | |
|
|
458 | At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use |
|
|
459 | without calling this function, so if you force one of those backends you |
|
|
460 | do not need to care. |
|
|
461 | |
504 | |
462 | =item ev_loop_fork (loop) |
505 | =item ev_loop_fork (loop) |
463 | |
506 | |
464 | Like C<ev_default_fork>, but acts on an event loop created by |
507 | Like C<ev_default_fork>, but acts on an event loop created by |
465 | C<ev_loop_new>. Yes, you have to call this on every allocated event loop |
508 | C<ev_loop_new>. Yes, you have to call this on every allocated event loop |
… | |
… | |
516 | usually a better approach for this kind of thing. |
559 | usually a better approach for this kind of thing. |
517 | |
560 | |
518 | Here are the gory details of what C<ev_loop> does: |
561 | Here are the gory details of what C<ev_loop> does: |
519 | |
562 | |
520 | - Before the first iteration, call any pending watchers. |
563 | - Before the first iteration, call any pending watchers. |
521 | * If there are no active watchers (reference count is zero), return. |
564 | * If EVFLAG_FORKCHECK was used, check for a fork. |
522 | - Queue all prepare watchers and then call all outstanding watchers. |
565 | - If a fork was detected, queue and call all fork watchers. |
|
|
566 | - Queue and call all prepare watchers. |
523 | - If we have been forked, recreate the kernel state. |
567 | - If we have been forked, recreate the kernel state. |
524 | - Update the kernel state with all outstanding changes. |
568 | - Update the kernel state with all outstanding changes. |
525 | - Update the "event loop time". |
569 | - Update the "event loop time". |
526 | - Calculate for how long to block. |
570 | - Calculate for how long to sleep or block, if at all |
|
|
571 | (active idle watchers, EVLOOP_NONBLOCK or not having |
|
|
572 | any active watchers at all will result in not sleeping). |
|
|
573 | - Sleep if the I/O and timer collect interval say so. |
527 | - Block the process, waiting for any events. |
574 | - Block the process, waiting for any events. |
528 | - Queue all outstanding I/O (fd) events. |
575 | - Queue all outstanding I/O (fd) events. |
529 | - Update the "event loop time" and do time jump handling. |
576 | - Update the "event loop time" and do time jump handling. |
530 | - Queue all outstanding timers. |
577 | - Queue all outstanding timers. |
531 | - Queue all outstanding periodics. |
578 | - Queue all outstanding periodics. |
532 | - If no events are pending now, queue all idle watchers. |
579 | - If no events are pending now, queue all idle watchers. |
533 | - Queue all check watchers. |
580 | - Queue all check watchers. |
534 | - Call all queued watchers in reverse order (i.e. check watchers first). |
581 | - Call all queued watchers in reverse order (i.e. check watchers first). |
535 | Signals and child watchers are implemented as I/O watchers, and will |
582 | Signals and child watchers are implemented as I/O watchers, and will |
536 | be handled here by queueing them when their watcher gets executed. |
583 | be handled here by queueing them when their watcher gets executed. |
537 | - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK |
584 | - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK |
538 | were used, return, otherwise continue with step *. |
585 | were used, or there are no active watchers, return, otherwise |
|
|
586 | continue with step *. |
539 | |
587 | |
540 | Example: Queue some jobs and then loop until no events are outsanding |
588 | Example: Queue some jobs and then loop until no events are outstanding |
541 | anymore. |
589 | anymore. |
542 | |
590 | |
543 | ... queue jobs here, make sure they register event watchers as long |
591 | ... queue jobs here, make sure they register event watchers as long |
544 | ... as they still have work to do (even an idle watcher will do..) |
592 | ... as they still have work to do (even an idle watcher will do..) |
545 | ev_loop (my_loop, 0); |
593 | ev_loop (my_loop, 0); |
… | |
… | |
549 | |
597 | |
550 | Can be used to make a call to C<ev_loop> return early (but only after it |
598 | Can be used to make a call to C<ev_loop> return early (but only after it |
551 | has processed all outstanding events). The C<how> argument must be either |
599 | has processed all outstanding events). The C<how> argument must be either |
552 | C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or |
600 | C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or |
553 | C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. |
601 | C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. |
|
|
602 | |
|
|
603 | This "unloop state" will be cleared when entering C<ev_loop> again. |
554 | |
604 | |
555 | =item ev_ref (loop) |
605 | =item ev_ref (loop) |
556 | |
606 | |
557 | =item ev_unref (loop) |
607 | =item ev_unref (loop) |
558 | |
608 | |
… | |
… | |
563 | returning, ev_unref() after starting, and ev_ref() before stopping it. For |
613 | returning, ev_unref() after starting, and ev_ref() before stopping it. For |
564 | example, libev itself uses this for its internal signal pipe: It is not |
614 | example, libev itself uses this for its internal signal pipe: It is not |
565 | visible to the libev user and should not keep C<ev_loop> from exiting if |
615 | visible to the libev user and should not keep C<ev_loop> from exiting if |
566 | no event watchers registered by it are active. It is also an excellent |
616 | no event watchers registered by it are active. It is also an excellent |
567 | way to do this for generic recurring timers or from within third-party |
617 | way to do this for generic recurring timers or from within third-party |
568 | libraries. Just remember to I<unref after start> and I<ref before stop>. |
618 | libraries. Just remember to I<unref after start> and I<ref before stop> |
|
|
619 | (but only if the watcher wasn't active before, or was active before, |
|
|
620 | respectively). |
569 | |
621 | |
570 | Example: Create a signal watcher, but keep it from keeping C<ev_loop> |
622 | Example: Create a signal watcher, but keep it from keeping C<ev_loop> |
571 | running when nothing else is active. |
623 | running when nothing else is active. |
572 | |
624 | |
573 | struct ev_signal exitsig; |
625 | struct ev_signal exitsig; |
… | |
… | |
721 | |
773 | |
722 | =item C<EV_FORK> |
774 | =item C<EV_FORK> |
723 | |
775 | |
724 | The event loop has been resumed in the child process after fork (see |
776 | The event loop has been resumed in the child process after fork (see |
725 | C<ev_fork>). |
777 | C<ev_fork>). |
|
|
778 | |
|
|
779 | =item C<EV_ASYNC> |
|
|
780 | |
|
|
781 | The given async watcher has been asynchronously notified (see C<ev_async>). |
726 | |
782 | |
727 | =item C<EV_ERROR> |
783 | =item C<EV_ERROR> |
728 | |
784 | |
729 | An unspecified error has occured, the watcher has been stopped. This might |
785 | An unspecified error has occured, the watcher has been stopped. This might |
730 | happen because the watcher could not be properly started because libev |
786 | happen because the watcher could not be properly started because libev |
… | |
… | |
948 | In general you can register as many read and/or write event watchers per |
1004 | In general you can register as many read and/or write event watchers per |
949 | fd as you want (as long as you don't confuse yourself). Setting all file |
1005 | fd as you want (as long as you don't confuse yourself). Setting all file |
950 | descriptors to non-blocking mode is also usually a good idea (but not |
1006 | descriptors to non-blocking mode is also usually a good idea (but not |
951 | required if you know what you are doing). |
1007 | required if you know what you are doing). |
952 | |
1008 | |
953 | You have to be careful with dup'ed file descriptors, though. Some backends |
|
|
954 | (the linux epoll backend is a notable example) cannot handle dup'ed file |
|
|
955 | descriptors correctly if you register interest in two or more fds pointing |
|
|
956 | to the same underlying file/socket/etc. description (that is, they share |
|
|
957 | the same underlying "file open"). |
|
|
958 | |
|
|
959 | If you must do this, then force the use of a known-to-be-good backend |
1009 | If you must do this, then force the use of a known-to-be-good backend |
960 | (at the time of this writing, this includes only C<EVBACKEND_SELECT> and |
1010 | (at the time of this writing, this includes only C<EVBACKEND_SELECT> and |
961 | C<EVBACKEND_POLL>). |
1011 | C<EVBACKEND_POLL>). |
962 | |
1012 | |
963 | Another thing you have to watch out for is that it is quite easy to |
1013 | Another thing you have to watch out for is that it is quite easy to |
… | |
… | |
997 | optimisations to libev. |
1047 | optimisations to libev. |
998 | |
1048 | |
999 | =head3 The special problem of dup'ed file descriptors |
1049 | =head3 The special problem of dup'ed file descriptors |
1000 | |
1050 | |
1001 | Some backends (e.g. epoll), cannot register events for file descriptors, |
1051 | Some backends (e.g. epoll), cannot register events for file descriptors, |
1002 | but only events for the underlying file descriptions. That menas when you |
1052 | but only events for the underlying file descriptions. That means when you |
1003 | have C<dup ()>'ed file descriptors and register events for them, only one |
1053 | have C<dup ()>'ed file descriptors or weirder constellations, and register |
1004 | file descriptor might actually receive events. |
1054 | events for them, only one file descriptor might actually receive events. |
1005 | |
1055 | |
1006 | There is no workaorund possible except not registering events |
1056 | There is no workaround possible except not registering events |
1007 | for potentially C<dup ()>'ed file descriptors or to resort to |
1057 | for potentially C<dup ()>'ed file descriptors, or to resort to |
1008 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
1058 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
1009 | |
1059 | |
1010 | =head3 The special problem of fork |
1060 | =head3 The special problem of fork |
1011 | |
1061 | |
1012 | Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit |
1062 | Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit |
… | |
… | |
1038 | =item int events [read-only] |
1088 | =item int events [read-only] |
1039 | |
1089 | |
1040 | The events being watched. |
1090 | The events being watched. |
1041 | |
1091 | |
1042 | =back |
1092 | =back |
|
|
1093 | |
|
|
1094 | =head3 Examples |
1043 | |
1095 | |
1044 | Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well |
1096 | Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well |
1045 | readable, but only once. Since it is likely line-buffered, you could |
1097 | readable, but only once. Since it is likely line-buffered, you could |
1046 | attempt to read a whole line in the callback. |
1098 | attempt to read a whole line in the callback. |
1047 | |
1099 | |
… | |
… | |
1145 | or C<ev_timer_again> is called and determines the next timeout (if any), |
1197 | or C<ev_timer_again> is called and determines the next timeout (if any), |
1146 | which is also when any modifications are taken into account. |
1198 | which is also when any modifications are taken into account. |
1147 | |
1199 | |
1148 | =back |
1200 | =back |
1149 | |
1201 | |
|
|
1202 | =head3 Examples |
|
|
1203 | |
1150 | Example: Create a timer that fires after 60 seconds. |
1204 | Example: Create a timer that fires after 60 seconds. |
1151 | |
1205 | |
1152 | static void |
1206 | static void |
1153 | one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) |
1207 | one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) |
1154 | { |
1208 | { |
… | |
… | |
1311 | When active, contains the absolute time that the watcher is supposed to |
1365 | When active, contains the absolute time that the watcher is supposed to |
1312 | trigger next. |
1366 | trigger next. |
1313 | |
1367 | |
1314 | =back |
1368 | =back |
1315 | |
1369 | |
|
|
1370 | =head3 Examples |
|
|
1371 | |
1316 | Example: Call a callback every hour, or, more precisely, whenever the |
1372 | Example: Call a callback every hour, or, more precisely, whenever the |
1317 | system clock is divisible by 3600. The callback invocation times have |
1373 | system clock is divisible by 3600. The callback invocation times have |
1318 | potentially a lot of jittering, but good long-term stability. |
1374 | potentially a lot of jittering, but good long-term stability. |
1319 | |
1375 | |
1320 | static void |
1376 | static void |
… | |
… | |
1386 | |
1442 | |
1387 | =head3 Watcher-Specific Functions and Data Members |
1443 | =head3 Watcher-Specific Functions and Data Members |
1388 | |
1444 | |
1389 | =over 4 |
1445 | =over 4 |
1390 | |
1446 | |
1391 | =item ev_child_init (ev_child *, callback, int pid) |
1447 | =item ev_child_init (ev_child *, callback, int pid, int trace) |
1392 | |
1448 | |
1393 | =item ev_child_set (ev_child *, int pid) |
1449 | =item ev_child_set (ev_child *, int pid, int trace) |
1394 | |
1450 | |
1395 | Configures the watcher to wait for status changes of process C<pid> (or |
1451 | Configures the watcher to wait for status changes of process C<pid> (or |
1396 | I<any> process if C<pid> is specified as C<0>). The callback can look |
1452 | I<any> process if C<pid> is specified as C<0>). The callback can look |
1397 | at the C<rstatus> member of the C<ev_child> watcher structure to see |
1453 | at the C<rstatus> member of the C<ev_child> watcher structure to see |
1398 | the status word (use the macros from C<sys/wait.h> and see your systems |
1454 | the status word (use the macros from C<sys/wait.h> and see your systems |
1399 | C<waitpid> documentation). The C<rpid> member contains the pid of the |
1455 | C<waitpid> documentation). The C<rpid> member contains the pid of the |
1400 | process causing the status change. |
1456 | process causing the status change. C<trace> must be either C<0> (only |
|
|
1457 | activate the watcher when the process terminates) or C<1> (additionally |
|
|
1458 | activate the watcher when the process is stopped or continued). |
1401 | |
1459 | |
1402 | =item int pid [read-only] |
1460 | =item int pid [read-only] |
1403 | |
1461 | |
1404 | The process id this watcher watches out for, or C<0>, meaning any process id. |
1462 | The process id this watcher watches out for, or C<0>, meaning any process id. |
1405 | |
1463 | |
… | |
… | |
1411 | |
1469 | |
1412 | The process exit/trace status caused by C<rpid> (see your systems |
1470 | The process exit/trace status caused by C<rpid> (see your systems |
1413 | C<waitpid> and C<sys/wait.h> documentation for details). |
1471 | C<waitpid> and C<sys/wait.h> documentation for details). |
1414 | |
1472 | |
1415 | =back |
1473 | =back |
|
|
1474 | |
|
|
1475 | =head3 Examples |
1416 | |
1476 | |
1417 | Example: Try to exit cleanly on SIGINT and SIGTERM. |
1477 | Example: Try to exit cleanly on SIGINT and SIGTERM. |
1418 | |
1478 | |
1419 | static void |
1479 | static void |
1420 | sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) |
1480 | sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) |
… | |
… | |
1461 | semantics of C<ev_stat> watchers, which means that libev sometimes needs |
1521 | semantics of C<ev_stat> watchers, which means that libev sometimes needs |
1462 | to fall back to regular polling again even with inotify, but changes are |
1522 | to fall back to regular polling again even with inotify, but changes are |
1463 | usually detected immediately, and if the file exists there will be no |
1523 | usually detected immediately, and if the file exists there will be no |
1464 | polling. |
1524 | polling. |
1465 | |
1525 | |
|
|
1526 | =head3 Inotify |
|
|
1527 | |
|
|
1528 | When C<inotify (7)> support has been compiled into libev (generally only |
|
|
1529 | available on Linux) and present at runtime, it will be used to speed up |
|
|
1530 | change detection where possible. The inotify descriptor will be created lazily |
|
|
1531 | when the first C<ev_stat> watcher is being started. |
|
|
1532 | |
|
|
1533 | Inotify presense does not change the semantics of C<ev_stat> watchers |
|
|
1534 | except that changes might be detected earlier, and in some cases, to avoid |
|
|
1535 | making regular C<stat> calls. Even in the presense of inotify support |
|
|
1536 | there are many cases where libev has to resort to regular C<stat> polling. |
|
|
1537 | |
|
|
1538 | (There is no support for kqueue, as apparently it cannot be used to |
|
|
1539 | implement this functionality, due to the requirement of having a file |
|
|
1540 | descriptor open on the object at all times). |
|
|
1541 | |
|
|
1542 | =head3 The special problem of stat time resolution |
|
|
1543 | |
|
|
1544 | The C<stat ()> syscall only supports full-second resolution portably, and |
|
|
1545 | even on systems where the resolution is higher, many filesystems still |
|
|
1546 | only support whole seconds. |
|
|
1547 | |
|
|
1548 | That means that, if the time is the only thing that changes, you might |
|
|
1549 | miss updates: on the first update, C<ev_stat> detects a change and calls |
|
|
1550 | your callback, which does something. When there is another update within |
|
|
1551 | the same second, C<ev_stat> will be unable to detect it. |
|
|
1552 | |
|
|
1553 | The solution to this is to delay acting on a change for a second (or till |
|
|
1554 | the next second boundary), using a roughly one-second delay C<ev_timer> |
|
|
1555 | (C<ev_timer_set (w, 0., 1.01); ev_timer_again (loop, w)>). The C<.01> |
|
|
1556 | is added to work around small timing inconsistencies of some operating |
|
|
1557 | systems. |
|
|
1558 | |
1466 | =head3 Watcher-Specific Functions and Data Members |
1559 | =head3 Watcher-Specific Functions and Data Members |
1467 | |
1560 | |
1468 | =over 4 |
1561 | =over 4 |
1469 | |
1562 | |
1470 | =item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) |
1563 | =item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) |
… | |
… | |
1507 | =item const char *path [read-only] |
1600 | =item const char *path [read-only] |
1508 | |
1601 | |
1509 | The filesystem path that is being watched. |
1602 | The filesystem path that is being watched. |
1510 | |
1603 | |
1511 | =back |
1604 | =back |
|
|
1605 | |
|
|
1606 | =head3 Examples |
1512 | |
1607 | |
1513 | Example: Watch C</etc/passwd> for attribute changes. |
1608 | Example: Watch C</etc/passwd> for attribute changes. |
1514 | |
1609 | |
1515 | static void |
1610 | static void |
1516 | passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) |
1611 | passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) |
… | |
… | |
1529 | } |
1624 | } |
1530 | |
1625 | |
1531 | ... |
1626 | ... |
1532 | ev_stat passwd; |
1627 | ev_stat passwd; |
1533 | |
1628 | |
1534 | ev_stat_init (&passwd, passwd_cb, "/etc/passwd"); |
1629 | ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.); |
1535 | ev_stat_start (loop, &passwd); |
1630 | ev_stat_start (loop, &passwd); |
|
|
1631 | |
|
|
1632 | Example: Like above, but additionally use a one-second delay so we do not |
|
|
1633 | miss updates (however, frequent updates will delay processing, too, so |
|
|
1634 | one might do the work both on C<ev_stat> callback invocation I<and> on |
|
|
1635 | C<ev_timer> callback invocation). |
|
|
1636 | |
|
|
1637 | static ev_stat passwd; |
|
|
1638 | static ev_timer timer; |
|
|
1639 | |
|
|
1640 | static void |
|
|
1641 | timer_cb (EV_P_ ev_timer *w, int revents) |
|
|
1642 | { |
|
|
1643 | ev_timer_stop (EV_A_ w); |
|
|
1644 | |
|
|
1645 | /* now it's one second after the most recent passwd change */ |
|
|
1646 | } |
|
|
1647 | |
|
|
1648 | static void |
|
|
1649 | stat_cb (EV_P_ ev_stat *w, int revents) |
|
|
1650 | { |
|
|
1651 | /* reset the one-second timer */ |
|
|
1652 | ev_timer_again (EV_A_ &timer); |
|
|
1653 | } |
|
|
1654 | |
|
|
1655 | ... |
|
|
1656 | ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.); |
|
|
1657 | ev_stat_start (loop, &passwd); |
|
|
1658 | ev_timer_init (&timer, timer_cb, 0., 1.01); |
1536 | |
1659 | |
1537 | |
1660 | |
1538 | =head2 C<ev_idle> - when you've got nothing better to do... |
1661 | =head2 C<ev_idle> - when you've got nothing better to do... |
1539 | |
1662 | |
1540 | Idle watchers trigger events when no other events of the same or higher |
1663 | Idle watchers trigger events when no other events of the same or higher |
… | |
… | |
1566 | kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, |
1689 | kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, |
1567 | believe me. |
1690 | believe me. |
1568 | |
1691 | |
1569 | =back |
1692 | =back |
1570 | |
1693 | |
|
|
1694 | =head3 Examples |
|
|
1695 | |
1571 | Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the |
1696 | Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the |
1572 | callback, free it. Also, use no error checking, as usual. |
1697 | callback, free it. Also, use no error checking, as usual. |
1573 | |
1698 | |
1574 | static void |
1699 | static void |
1575 | idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) |
1700 | idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) |
1576 | { |
1701 | { |
1577 | free (w); |
1702 | free (w); |
1578 | // now do something you wanted to do when the program has |
1703 | // now do something you wanted to do when the program has |
1579 | // no longer asnything immediate to do. |
1704 | // no longer anything immediate to do. |
1580 | } |
1705 | } |
1581 | |
1706 | |
1582 | struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); |
1707 | struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); |
1583 | ev_idle_init (idle_watcher, idle_cb); |
1708 | ev_idle_init (idle_watcher, idle_cb); |
1584 | ev_idle_start (loop, idle_cb); |
1709 | ev_idle_start (loop, idle_cb); |
… | |
… | |
1646 | parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> |
1771 | parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> |
1647 | macros, but using them is utterly, utterly and completely pointless. |
1772 | macros, but using them is utterly, utterly and completely pointless. |
1648 | |
1773 | |
1649 | =back |
1774 | =back |
1650 | |
1775 | |
|
|
1776 | =head3 Examples |
|
|
1777 | |
1651 | There are a number of principal ways to embed other event loops or modules |
1778 | There are a number of principal ways to embed other event loops or modules |
1652 | into libev. Here are some ideas on how to include libadns into libev |
1779 | into libev. Here are some ideas on how to include libadns into libev |
1653 | (there is a Perl module named C<EV::ADNS> that does this, which you could |
1780 | (there is a Perl module named C<EV::ADNS> that does this, which you could |
1654 | use for an actually working example. Another Perl module named C<EV::Glib> |
1781 | use for an actually working example. Another Perl module named C<EV::Glib> |
1655 | embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV |
1782 | embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV |
… | |
… | |
1823 | portable one. |
1950 | portable one. |
1824 | |
1951 | |
1825 | So when you want to use this feature you will always have to be prepared |
1952 | So when you want to use this feature you will always have to be prepared |
1826 | that you cannot get an embeddable loop. The recommended way to get around |
1953 | that you cannot get an embeddable loop. The recommended way to get around |
1827 | this is to have a separate variables for your embeddable loop, try to |
1954 | this is to have a separate variables for your embeddable loop, try to |
1828 | create it, and if that fails, use the normal loop for everything: |
1955 | create it, and if that fails, use the normal loop for everything. |
|
|
1956 | |
|
|
1957 | =head3 Watcher-Specific Functions and Data Members |
|
|
1958 | |
|
|
1959 | =over 4 |
|
|
1960 | |
|
|
1961 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
|
|
1962 | |
|
|
1963 | =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) |
|
|
1964 | |
|
|
1965 | Configures the watcher to embed the given loop, which must be |
|
|
1966 | embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be |
|
|
1967 | invoked automatically, otherwise it is the responsibility of the callback |
|
|
1968 | to invoke it (it will continue to be called until the sweep has been done, |
|
|
1969 | if you do not want thta, you need to temporarily stop the embed watcher). |
|
|
1970 | |
|
|
1971 | =item ev_embed_sweep (loop, ev_embed *) |
|
|
1972 | |
|
|
1973 | Make a single, non-blocking sweep over the embedded loop. This works |
|
|
1974 | similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most |
|
|
1975 | apropriate way for embedded loops. |
|
|
1976 | |
|
|
1977 | =item struct ev_loop *other [read-only] |
|
|
1978 | |
|
|
1979 | The embedded event loop. |
|
|
1980 | |
|
|
1981 | =back |
|
|
1982 | |
|
|
1983 | =head3 Examples |
|
|
1984 | |
|
|
1985 | Example: Try to get an embeddable event loop and embed it into the default |
|
|
1986 | event loop. If that is not possible, use the default loop. The default |
|
|
1987 | loop is stored in C<loop_hi>, while the mebeddable loop is stored in |
|
|
1988 | C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be |
|
|
1989 | used). |
1829 | |
1990 | |
1830 | struct ev_loop *loop_hi = ev_default_init (0); |
1991 | struct ev_loop *loop_hi = ev_default_init (0); |
1831 | struct ev_loop *loop_lo = 0; |
1992 | struct ev_loop *loop_lo = 0; |
1832 | struct ev_embed embed; |
1993 | struct ev_embed embed; |
1833 | |
1994 | |
… | |
… | |
1844 | ev_embed_start (loop_hi, &embed); |
2005 | ev_embed_start (loop_hi, &embed); |
1845 | } |
2006 | } |
1846 | else |
2007 | else |
1847 | loop_lo = loop_hi; |
2008 | loop_lo = loop_hi; |
1848 | |
2009 | |
1849 | =head3 Watcher-Specific Functions and Data Members |
2010 | Example: Check if kqueue is available but not recommended and create |
|
|
2011 | a kqueue backend for use with sockets (which usually work with any |
|
|
2012 | kqueue implementation). Store the kqueue/socket-only event loop in |
|
|
2013 | C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). |
1850 | |
2014 | |
1851 | =over 4 |
2015 | struct ev_loop *loop = ev_default_init (0); |
|
|
2016 | struct ev_loop *loop_socket = 0; |
|
|
2017 | struct ev_embed embed; |
|
|
2018 | |
|
|
2019 | if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) |
|
|
2020 | if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) |
|
|
2021 | { |
|
|
2022 | ev_embed_init (&embed, 0, loop_socket); |
|
|
2023 | ev_embed_start (loop, &embed); |
|
|
2024 | } |
1852 | |
2025 | |
1853 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
2026 | if (!loop_socket) |
|
|
2027 | loop_socket = loop; |
1854 | |
2028 | |
1855 | =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) |
2029 | // now use loop_socket for all sockets, and loop for everything else |
1856 | |
|
|
1857 | Configures the watcher to embed the given loop, which must be |
|
|
1858 | embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be |
|
|
1859 | invoked automatically, otherwise it is the responsibility of the callback |
|
|
1860 | to invoke it (it will continue to be called until the sweep has been done, |
|
|
1861 | if you do not want thta, you need to temporarily stop the embed watcher). |
|
|
1862 | |
|
|
1863 | =item ev_embed_sweep (loop, ev_embed *) |
|
|
1864 | |
|
|
1865 | Make a single, non-blocking sweep over the embedded loop. This works |
|
|
1866 | similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most |
|
|
1867 | apropriate way for embedded loops. |
|
|
1868 | |
|
|
1869 | =item struct ev_loop *other [read-only] |
|
|
1870 | |
|
|
1871 | The embedded event loop. |
|
|
1872 | |
|
|
1873 | =back |
|
|
1874 | |
2030 | |
1875 | |
2031 | |
1876 | =head2 C<ev_fork> - the audacity to resume the event loop after a fork |
2032 | =head2 C<ev_fork> - the audacity to resume the event loop after a fork |
1877 | |
2033 | |
1878 | Fork watchers are called when a C<fork ()> was detected (usually because |
2034 | Fork watchers are called when a C<fork ()> was detected (usually because |
… | |
… | |
1894 | believe me. |
2050 | believe me. |
1895 | |
2051 | |
1896 | =back |
2052 | =back |
1897 | |
2053 | |
1898 | |
2054 | |
|
|
2055 | =head2 C<ev_async> - how to wake up another event loop |
|
|
2056 | |
|
|
2057 | In general, you cannot use an C<ev_loop> from multiple threads or other |
|
|
2058 | asynchronous sources such as signal handlers (as opposed to multiple event |
|
|
2059 | loops - those are of course safe to use in different threads). |
|
|
2060 | |
|
|
2061 | Sometimes, however, you need to wake up another event loop you do not |
|
|
2062 | control, for example because it belongs to another thread. This is what |
|
|
2063 | C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you |
|
|
2064 | can signal it by calling C<ev_async_send>, which is thread- and signal |
|
|
2065 | safe. |
|
|
2066 | |
|
|
2067 | This functionality is very similar to C<ev_signal> watchers, as signals, |
|
|
2068 | too, are asynchronous in nature, and signals, too, will be compressed |
|
|
2069 | (i.e. the number of callback invocations may be less than the number of |
|
|
2070 | C<ev_async_sent> calls). |
|
|
2071 | |
|
|
2072 | Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not |
|
|
2073 | just the default loop. |
|
|
2074 | |
|
|
2075 | =head3 Queueing |
|
|
2076 | |
|
|
2077 | C<ev_async> does not support queueing of data in any way. The reason |
|
|
2078 | is that the author does not know of a simple (or any) algorithm for a |
|
|
2079 | multiple-writer-single-reader queue that works in all cases and doesn't |
|
|
2080 | need elaborate support such as pthreads. |
|
|
2081 | |
|
|
2082 | That means that if you want to queue data, you have to provide your own |
|
|
2083 | queue. And here is how you would implement locking: |
|
|
2084 | |
|
|
2085 | =over 4 |
|
|
2086 | |
|
|
2087 | =item queueing from a signal handler context |
|
|
2088 | |
|
|
2089 | To implement race-free queueing, you simply add to the queue in the signal |
|
|
2090 | handler but you block the signal handler in the watcher callback. Here is an example that does that for |
|
|
2091 | some fictitiuous SIGUSR1 handler: |
|
|
2092 | |
|
|
2093 | static ev_async mysig; |
|
|
2094 | |
|
|
2095 | static void |
|
|
2096 | sigusr1_handler (void) |
|
|
2097 | { |
|
|
2098 | sometype data; |
|
|
2099 | |
|
|
2100 | // no locking etc. |
|
|
2101 | queue_put (data); |
|
|
2102 | ev_async_send (DEFAULT_ &mysig); |
|
|
2103 | } |
|
|
2104 | |
|
|
2105 | static void |
|
|
2106 | mysig_cb (EV_P_ ev_async *w, int revents) |
|
|
2107 | { |
|
|
2108 | sometype data; |
|
|
2109 | sigset_t block, prev; |
|
|
2110 | |
|
|
2111 | sigemptyset (&block); |
|
|
2112 | sigaddset (&block, SIGUSR1); |
|
|
2113 | sigprocmask (SIG_BLOCK, &block, &prev); |
|
|
2114 | |
|
|
2115 | while (queue_get (&data)) |
|
|
2116 | process (data); |
|
|
2117 | |
|
|
2118 | if (sigismember (&prev, SIGUSR1) |
|
|
2119 | sigprocmask (SIG_UNBLOCK, &block, 0); |
|
|
2120 | } |
|
|
2121 | |
|
|
2122 | (Note: pthreads in theory requires you to use C<pthread_setmask> |
|
|
2123 | instead of C<sigprocmask> when you use threads, but libev doesn't do it |
|
|
2124 | either...). |
|
|
2125 | |
|
|
2126 | =item queueing from a thread context |
|
|
2127 | |
|
|
2128 | The strategy for threads is different, as you cannot (easily) block |
|
|
2129 | threads but you can easily preempt them, so to queue safely you need to |
|
|
2130 | emply a traditional mutex lock, such as in this pthread example: |
|
|
2131 | |
|
|
2132 | static ev_async mysig; |
|
|
2133 | static pthread_mutex_t mymutex = PTHREAD_MUTEX_INITIALIZER; |
|
|
2134 | |
|
|
2135 | static void |
|
|
2136 | otherthread (void) |
|
|
2137 | { |
|
|
2138 | // only need to lock the actual queueing operation |
|
|
2139 | pthread_mutex_lock (&mymutex); |
|
|
2140 | queue_put (data); |
|
|
2141 | pthread_mutex_unlock (&mymutex); |
|
|
2142 | |
|
|
2143 | ev_async_send (DEFAULT_ &mysig); |
|
|
2144 | } |
|
|
2145 | |
|
|
2146 | static void |
|
|
2147 | mysig_cb (EV_P_ ev_async *w, int revents) |
|
|
2148 | { |
|
|
2149 | pthread_mutex_lock (&mymutex); |
|
|
2150 | |
|
|
2151 | while (queue_get (&data)) |
|
|
2152 | process (data); |
|
|
2153 | |
|
|
2154 | pthread_mutex_unlock (&mymutex); |
|
|
2155 | } |
|
|
2156 | |
|
|
2157 | =back |
|
|
2158 | |
|
|
2159 | |
|
|
2160 | =head3 Watcher-Specific Functions and Data Members |
|
|
2161 | |
|
|
2162 | =over 4 |
|
|
2163 | |
|
|
2164 | =item ev_async_init (ev_async *, callback) |
|
|
2165 | |
|
|
2166 | Initialises and configures the async watcher - it has no parameters of any |
|
|
2167 | kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless, |
|
|
2168 | believe me. |
|
|
2169 | |
|
|
2170 | =item ev_async_send (loop, ev_async *) |
|
|
2171 | |
|
|
2172 | Sends/signals/activates the given C<ev_async> watcher, that is, feeds |
|
|
2173 | an C<EV_ASYNC> event on the watcher into the event loop. Unlike |
|
|
2174 | C<ev_feed_event>, this call is safe to do in other threads, signal or |
|
|
2175 | similar contexts (see the dicusssion of C<EV_ATOMIC_T> in the embedding |
|
|
2176 | section below on what exactly this means). |
|
|
2177 | |
|
|
2178 | This call incurs the overhead of a syscall only once per loop iteration, |
|
|
2179 | so while the overhead might be noticable, it doesn't apply to repeated |
|
|
2180 | calls to C<ev_async_send>. |
|
|
2181 | |
|
|
2182 | =back |
|
|
2183 | |
|
|
2184 | |
1899 | =head1 OTHER FUNCTIONS |
2185 | =head1 OTHER FUNCTIONS |
1900 | |
2186 | |
1901 | There are some other functions of possible interest. Described. Here. Now. |
2187 | There are some other functions of possible interest. Described. Here. Now. |
1902 | |
2188 | |
1903 | =over 4 |
2189 | =over 4 |
… | |
… | |
2130 | Example: Define a class with an IO and idle watcher, start one of them in |
2416 | Example: Define a class with an IO and idle watcher, start one of them in |
2131 | the constructor. |
2417 | the constructor. |
2132 | |
2418 | |
2133 | class myclass |
2419 | class myclass |
2134 | { |
2420 | { |
2135 | ev_io io; void io_cb (ev::io &w, int revents); |
2421 | ev::io io; void io_cb (ev::io &w, int revents); |
2136 | ev_idle idle void idle_cb (ev::idle &w, int revents); |
2422 | ev:idle idle void idle_cb (ev::idle &w, int revents); |
2137 | |
2423 | |
2138 | myclass (); |
2424 | myclass (int fd) |
2139 | } |
|
|
2140 | |
|
|
2141 | myclass::myclass (int fd) |
|
|
2142 | { |
2425 | { |
2143 | io .set <myclass, &myclass::io_cb > (this); |
2426 | io .set <myclass, &myclass::io_cb > (this); |
2144 | idle.set <myclass, &myclass::idle_cb> (this); |
2427 | idle.set <myclass, &myclass::idle_cb> (this); |
2145 | |
2428 | |
2146 | io.start (fd, ev::READ); |
2429 | io.start (fd, ev::READ); |
|
|
2430 | } |
2147 | } |
2431 | }; |
2148 | |
2432 | |
2149 | |
2433 | |
2150 | =head1 MACRO MAGIC |
2434 | =head1 MACRO MAGIC |
2151 | |
2435 | |
2152 | Libev can be compiled with a variety of options, the most fundamantal |
2436 | Libev can be compiled with a variety of options, the most fundamantal |
… | |
… | |
2357 | wants osf handles on win32 (this is the case when the select to |
2641 | wants osf handles on win32 (this is the case when the select to |
2358 | be used is the winsock select). This means that it will call |
2642 | be used is the winsock select). This means that it will call |
2359 | C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, |
2643 | C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, |
2360 | it is assumed that all these functions actually work on fds, even |
2644 | it is assumed that all these functions actually work on fds, even |
2361 | on win32. Should not be defined on non-win32 platforms. |
2645 | on win32. Should not be defined on non-win32 platforms. |
|
|
2646 | |
|
|
2647 | =item EV_FD_TO_WIN32_HANDLE |
|
|
2648 | |
|
|
2649 | If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map |
|
|
2650 | file descriptors to socket handles. When not defining this symbol (the |
|
|
2651 | default), then libev will call C<_get_osfhandle>, which is usually |
|
|
2652 | correct. In some cases, programs use their own file descriptor management, |
|
|
2653 | in which case they can provide this function to map fds to socket handles. |
2362 | |
2654 | |
2363 | =item EV_USE_POLL |
2655 | =item EV_USE_POLL |
2364 | |
2656 | |
2365 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
2657 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
2366 | backend. Otherwise it will be enabled on non-win32 platforms. It |
2658 | backend. Otherwise it will be enabled on non-win32 platforms. It |
… | |
… | |
2400 | |
2692 | |
2401 | If defined to be C<1>, libev will compile in support for the Linux inotify |
2693 | If defined to be C<1>, libev will compile in support for the Linux inotify |
2402 | interface to speed up C<ev_stat> watchers. Its actual availability will |
2694 | interface to speed up C<ev_stat> watchers. Its actual availability will |
2403 | be detected at runtime. |
2695 | be detected at runtime. |
2404 | |
2696 | |
|
|
2697 | =item EV_ATOMIC_T |
|
|
2698 | |
|
|
2699 | Libev requires an integer type (suitable for storing C<0> or C<1>) whose |
|
|
2700 | access is atomic with respect to other threads or signal contexts. No such |
|
|
2701 | type is easily found in the C language, so you can provide your own type |
|
|
2702 | that you know is safe for your purposes. It is used both for signal handler "locking" |
|
|
2703 | as well as for signal and thread safety in C<ev_async> watchers. |
|
|
2704 | |
|
|
2705 | In the absense of this define, libev will use C<sig_atomic_t volatile> |
|
|
2706 | (from F<signal.h>), which is usually good enough on most platforms. |
|
|
2707 | |
2405 | =item EV_H |
2708 | =item EV_H |
2406 | |
2709 | |
2407 | The name of the F<ev.h> header file used to include it. The default if |
2710 | The name of the F<ev.h> header file used to include it. The default if |
2408 | undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This |
2711 | undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be |
2409 | can be used to virtually rename the F<ev.h> header file in case of conflicts. |
2712 | used to virtually rename the F<ev.h> header file in case of conflicts. |
2410 | |
2713 | |
2411 | =item EV_CONFIG_H |
2714 | =item EV_CONFIG_H |
2412 | |
2715 | |
2413 | If C<EV_STANDALONE> isn't C<1>, this variable can be used to override |
2716 | If C<EV_STANDALONE> isn't C<1>, this variable can be used to override |
2414 | F<ev.c>'s idea of where to find the F<config.h> file, similarly to |
2717 | F<ev.c>'s idea of where to find the F<config.h> file, similarly to |
2415 | C<EV_H>, above. |
2718 | C<EV_H>, above. |
2416 | |
2719 | |
2417 | =item EV_EVENT_H |
2720 | =item EV_EVENT_H |
2418 | |
2721 | |
2419 | Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea |
2722 | Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea |
2420 | of how the F<event.h> header can be found. |
2723 | of how the F<event.h> header can be found, the default is C<"event.h">. |
2421 | |
2724 | |
2422 | =item EV_PROTOTYPES |
2725 | =item EV_PROTOTYPES |
2423 | |
2726 | |
2424 | If defined to be C<0>, then F<ev.h> will not define any function |
2727 | If defined to be C<0>, then F<ev.h> will not define any function |
2425 | prototypes, but still define all the structs and other symbols. This is |
2728 | prototypes, but still define all the structs and other symbols. This is |
… | |
… | |
2476 | =item EV_FORK_ENABLE |
2779 | =item EV_FORK_ENABLE |
2477 | |
2780 | |
2478 | If undefined or defined to be C<1>, then fork watchers are supported. If |
2781 | If undefined or defined to be C<1>, then fork watchers are supported. If |
2479 | defined to be C<0>, then they are not. |
2782 | defined to be C<0>, then they are not. |
2480 | |
2783 | |
|
|
2784 | =item EV_ASYNC_ENABLE |
|
|
2785 | |
|
|
2786 | If undefined or defined to be C<1>, then async watchers are supported. If |
|
|
2787 | defined to be C<0>, then they are not. |
|
|
2788 | |
2481 | =item EV_MINIMAL |
2789 | =item EV_MINIMAL |
2482 | |
2790 | |
2483 | If you need to shave off some kilobytes of code at the expense of some |
2791 | If you need to shave off some kilobytes of code at the expense of some |
2484 | speed, define this symbol to C<1>. Currently only used for gcc to override |
2792 | speed, define this symbol to C<1>. Currently only used for gcc to override |
2485 | some inlining decisions, saves roughly 30% codesize of amd64. |
2793 | some inlining decisions, saves roughly 30% codesize of amd64. |
… | |
… | |
2491 | than enough. If you need to manage thousands of children you might want to |
2799 | than enough. If you need to manage thousands of children you might want to |
2492 | increase this value (I<must> be a power of two). |
2800 | increase this value (I<must> be a power of two). |
2493 | |
2801 | |
2494 | =item EV_INOTIFY_HASHSIZE |
2802 | =item EV_INOTIFY_HASHSIZE |
2495 | |
2803 | |
2496 | C<ev_staz> watchers use a small hash table to distribute workload by |
2804 | C<ev_stat> watchers use a small hash table to distribute workload by |
2497 | inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), |
2805 | inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), |
2498 | usually more than enough. If you need to manage thousands of C<ev_stat> |
2806 | usually more than enough. If you need to manage thousands of C<ev_stat> |
2499 | watchers you might want to increase this value (I<must> be a power of |
2807 | watchers you might want to increase this value (I<must> be a power of |
2500 | two). |
2808 | two). |
2501 | |
2809 | |
… | |
… | |
2597 | |
2905 | |
2598 | =item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) |
2906 | =item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) |
2599 | |
2907 | |
2600 | This means that, when you have a watcher that triggers in one hour and |
2908 | This means that, when you have a watcher that triggers in one hour and |
2601 | there are 100 watchers that would trigger before that then inserting will |
2909 | there are 100 watchers that would trigger before that then inserting will |
2602 | have to skip those 100 watchers. |
2910 | have to skip roughly seven (C<ld 100>) of these watchers. |
2603 | |
2911 | |
2604 | =item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) |
2912 | =item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers) |
2605 | |
2913 | |
2606 | That means that for changing a timer costs less than removing/adding them |
2914 | That means that changing a timer costs less than removing/adding them |
2607 | as only the relative motion in the event queue has to be paid for. |
2915 | as only the relative motion in the event queue has to be paid for. |
2608 | |
2916 | |
2609 | =item Starting io/check/prepare/idle/signal/child watchers: O(1) |
2917 | =item Starting io/check/prepare/idle/signal/child watchers: O(1) |
2610 | |
2918 | |
2611 | These just add the watcher into an array or at the head of a list. |
2919 | These just add the watcher into an array or at the head of a list. |
|
|
2920 | |
2612 | =item Stopping check/prepare/idle watchers: O(1) |
2921 | =item Stopping check/prepare/idle watchers: O(1) |
2613 | |
2922 | |
2614 | =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) |
2923 | =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) |
2615 | |
2924 | |
2616 | These watchers are stored in lists then need to be walked to find the |
2925 | These watchers are stored in lists then need to be walked to find the |
2617 | correct watcher to remove. The lists are usually short (you don't usually |
2926 | correct watcher to remove. The lists are usually short (you don't usually |
2618 | have many watchers waiting for the same fd or signal). |
2927 | have many watchers waiting for the same fd or signal). |
2619 | |
2928 | |
2620 | =item Finding the next timer per loop iteration: O(1) |
2929 | =item Finding the next timer in each loop iteration: O(1) |
|
|
2930 | |
|
|
2931 | By virtue of using a binary heap, the next timer is always found at the |
|
|
2932 | beginning of the storage array. |
2621 | |
2933 | |
2622 | =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) |
2934 | =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) |
2623 | |
2935 | |
2624 | A change means an I/O watcher gets started or stopped, which requires |
2936 | A change means an I/O watcher gets started or stopped, which requires |
2625 | libev to recalculate its status (and possibly tell the kernel). |
2937 | libev to recalculate its status (and possibly tell the kernel, depending |
|
|
2938 | on backend and wether C<ev_io_set> was used). |
2626 | |
2939 | |
2627 | =item Activating one watcher: O(1) |
2940 | =item Activating one watcher (putting it into the pending state): O(1) |
2628 | |
2941 | |
2629 | =item Priority handling: O(number_of_priorities) |
2942 | =item Priority handling: O(number_of_priorities) |
2630 | |
2943 | |
2631 | Priorities are implemented by allocating some space for each |
2944 | Priorities are implemented by allocating some space for each |
2632 | priority. When doing priority-based operations, libev usually has to |
2945 | priority. When doing priority-based operations, libev usually has to |
2633 | linearly search all the priorities. |
2946 | linearly search all the priorities, but starting/stopping and activating |
|
|
2947 | watchers becomes O(1) w.r.t. prioritiy handling. |
2634 | |
2948 | |
2635 | =back |
2949 | =back |
2636 | |
2950 | |
2637 | |
2951 | |
|
|
2952 | =head1 Win32 platform limitations and workarounds |
|
|
2953 | |
|
|
2954 | Win32 doesn't support any of the standards (e.g. POSIX) that libev |
|
|
2955 | requires, and its I/O model is fundamentally incompatible with the POSIX |
|
|
2956 | model. Libev still offers limited functionality on this platform in |
|
|
2957 | the form of the C<EVBACKEND_SELECT> backend, and only supports socket |
|
|
2958 | descriptors. This only applies when using Win32 natively, not when using |
|
|
2959 | e.g. cygwin. |
|
|
2960 | |
|
|
2961 | There is no supported compilation method available on windows except |
|
|
2962 | embedding it into other applications. |
|
|
2963 | |
|
|
2964 | Due to the many, low, and arbitrary limits on the win32 platform and the |
|
|
2965 | abysmal performance of winsockets, using a large number of sockets is not |
|
|
2966 | recommended (and not reasonable). If your program needs to use more than |
|
|
2967 | a hundred or so sockets, then likely it needs to use a totally different |
|
|
2968 | implementation for windows, as libev offers the POSIX model, which cannot |
|
|
2969 | be implemented efficiently on windows (microsoft monopoly games). |
|
|
2970 | |
|
|
2971 | =over 4 |
|
|
2972 | |
|
|
2973 | =item The winsocket select function |
|
|
2974 | |
|
|
2975 | The winsocket C<select> function doesn't follow POSIX in that it requires |
|
|
2976 | socket I<handles> and not socket I<file descriptors>. This makes select |
|
|
2977 | very inefficient, and also requires a mapping from file descriptors |
|
|
2978 | to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>, |
|
|
2979 | C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor |
|
|
2980 | symbols for more info. |
|
|
2981 | |
|
|
2982 | The configuration for a "naked" win32 using the microsoft runtime |
|
|
2983 | libraries and raw winsocket select is: |
|
|
2984 | |
|
|
2985 | #define EV_USE_SELECT 1 |
|
|
2986 | #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ |
|
|
2987 | |
|
|
2988 | Note that winsockets handling of fd sets is O(n), so you can easily get a |
|
|
2989 | complexity in the O(n²) range when using win32. |
|
|
2990 | |
|
|
2991 | =item Limited number of file descriptors |
|
|
2992 | |
|
|
2993 | Windows has numerous arbitrary (and low) limits on things. Early versions |
|
|
2994 | of winsocket's select only supported waiting for a max. of C<64> handles |
|
|
2995 | (probably owning to the fact that all windows kernels can only wait for |
|
|
2996 | C<64> things at the same time internally; microsoft recommends spawning a |
|
|
2997 | chain of threads and wait for 63 handles and the previous thread in each). |
|
|
2998 | |
|
|
2999 | Newer versions support more handles, but you need to define C<FD_SETSIZE> |
|
|
3000 | to some high number (e.g. C<2048>) before compiling the winsocket select |
|
|
3001 | call (which might be in libev or elsewhere, for example, perl does its own |
|
|
3002 | select emulation on windows). |
|
|
3003 | |
|
|
3004 | Another limit is the number of file descriptors in the microsoft runtime |
|
|
3005 | libraries, which by default is C<64> (there must be a hidden I<64> fetish |
|
|
3006 | or something like this inside microsoft). You can increase this by calling |
|
|
3007 | C<_setmaxstdio>, which can increase this limit to C<2048> (another |
|
|
3008 | arbitrary limit), but is broken in many versions of the microsoft runtime |
|
|
3009 | libraries. |
|
|
3010 | |
|
|
3011 | This might get you to about C<512> or C<2048> sockets (depending on |
|
|
3012 | windows version and/or the phase of the moon). To get more, you need to |
|
|
3013 | wrap all I/O functions and provide your own fd management, but the cost of |
|
|
3014 | calling select (O(n²)) will likely make this unworkable. |
|
|
3015 | |
|
|
3016 | =back |
|
|
3017 | |
|
|
3018 | |
2638 | =head1 AUTHOR |
3019 | =head1 AUTHOR |
2639 | |
3020 | |
2640 | Marc Lehmann <libev@schmorp.de>. |
3021 | Marc Lehmann <libev@schmorp.de>. |
2641 | |
3022 | |