… | |
… | |
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 | |
… | |
… | |
403 | While this backend scales well, it requires one system call per active |
410 | While this backend scales well, it requires one system call per active |
404 | file descriptor per loop iteration. For small and medium numbers of file |
411 | file descriptor per loop iteration. For small and medium numbers of file |
405 | descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend |
412 | descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend |
406 | might perform better. |
413 | might perform better. |
407 | |
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 | |
408 | =item C<EVBACKEND_ALL> |
419 | =item C<EVBACKEND_ALL> |
409 | |
420 | |
410 | 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 |
411 | 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 |
412 | C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. |
423 | C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. |
… | |
… | |
414 | It is definitely not recommended to use this flag. |
425 | It is definitely not recommended to use this flag. |
415 | |
426 | |
416 | =back |
427 | =back |
417 | |
428 | |
418 | 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 |
419 | 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 |
420 | specified, most compiled-in backend will be tried, usually in reverse |
431 | specified, all backends in C<ev_recommended_backends ()> will be tried. |
421 | order of their flag values :) |
|
|
422 | |
432 | |
423 | The most typical usage is like this: |
433 | The most typical usage is like this: |
424 | |
434 | |
425 | if (!ev_default_loop (0)) |
435 | if (!ev_default_loop (0)) |
426 | fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); |
436 | fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); |
… | |
… | |
473 | 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 |
474 | earlier call to C<ev_loop_new>. |
484 | earlier call to C<ev_loop_new>. |
475 | |
485 | |
476 | =item ev_default_fork () |
486 | =item ev_default_fork () |
477 | |
487 | |
|
|
488 | This function sets a flag that causes subsequent C<ev_loop> iterations |
478 | This function reinitialises the kernel state for backends that have |
489 | to reinitialise the kernel state for backends that have one. Despite the |
479 | 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 |
480 | 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 |
481 | 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. |
482 | |
494 | |
483 | 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 |
484 | 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 |
485 | fork+exec, you don't have to call it. |
497 | you just fork+exec, you don't have to call it at all. |
486 | |
498 | |
487 | 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 |
488 | 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 |
489 | quite nicely into a call to C<pthread_atfork>: |
501 | quite nicely into a call to C<pthread_atfork>: |
490 | |
502 | |
491 | pthread_atfork (0, 0, ev_default_fork); |
503 | pthread_atfork (0, 0, ev_default_fork); |
492 | |
|
|
493 | At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use |
|
|
494 | without calling this function, so if you force one of those backends you |
|
|
495 | do not need to care. |
|
|
496 | |
504 | |
497 | =item ev_loop_fork (loop) |
505 | =item ev_loop_fork (loop) |
498 | |
506 | |
499 | 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 |
500 | 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 |
… | |
… | |
551 | usually a better approach for this kind of thing. |
559 | usually a better approach for this kind of thing. |
552 | |
560 | |
553 | Here are the gory details of what C<ev_loop> does: |
561 | Here are the gory details of what C<ev_loop> does: |
554 | |
562 | |
555 | - Before the first iteration, call any pending watchers. |
563 | - Before the first iteration, call any pending watchers. |
556 | * If there are no active watchers (reference count is zero), return. |
564 | * If EVFLAG_FORKCHECK was used, check for a fork. |
557 | - 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. |
558 | - If we have been forked, recreate the kernel state. |
567 | - If we have been forked, recreate the kernel state. |
559 | - Update the kernel state with all outstanding changes. |
568 | - Update the kernel state with all outstanding changes. |
560 | - Update the "event loop time". |
569 | - Update the "event loop time". |
561 | - 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. |
562 | - Block the process, waiting for any events. |
574 | - Block the process, waiting for any events. |
563 | - Queue all outstanding I/O (fd) events. |
575 | - Queue all outstanding I/O (fd) events. |
564 | - Update the "event loop time" and do time jump handling. |
576 | - Update the "event loop time" and do time jump handling. |
565 | - Queue all outstanding timers. |
577 | - Queue all outstanding timers. |
566 | - Queue all outstanding periodics. |
578 | - Queue all outstanding periodics. |
567 | - If no events are pending now, queue all idle watchers. |
579 | - If no events are pending now, queue all idle watchers. |
568 | - Queue all check watchers. |
580 | - Queue all check watchers. |
569 | - 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). |
570 | 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 |
571 | be handled here by queueing them when their watcher gets executed. |
583 | be handled here by queueing them when their watcher gets executed. |
572 | - 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 |
573 | were used, return, otherwise continue with step *. |
585 | were used, or there are no active watchers, return, otherwise |
|
|
586 | continue with step *. |
574 | |
587 | |
575 | 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 |
576 | anymore. |
589 | anymore. |
577 | |
590 | |
578 | ... queue jobs here, make sure they register event watchers as long |
591 | ... queue jobs here, make sure they register event watchers as long |
579 | ... 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..) |
580 | ev_loop (my_loop, 0); |
593 | ev_loop (my_loop, 0); |
… | |
… | |
584 | |
597 | |
585 | 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 |
586 | 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 |
587 | 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 |
588 | 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. |
589 | |
604 | |
590 | =item ev_ref (loop) |
605 | =item ev_ref (loop) |
591 | |
606 | |
592 | =item ev_unref (loop) |
607 | =item ev_unref (loop) |
593 | |
608 | |
… | |
… | |
598 | 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 |
599 | 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 |
600 | 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 |
601 | 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 |
602 | 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 |
603 | 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). |
604 | |
621 | |
605 | 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> |
606 | running when nothing else is active. |
623 | running when nothing else is active. |
607 | |
624 | |
608 | struct ev_signal exitsig; |
625 | struct ev_signal exitsig; |
… | |
… | |
756 | |
773 | |
757 | =item C<EV_FORK> |
774 | =item C<EV_FORK> |
758 | |
775 | |
759 | 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 |
760 | 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>). |
761 | |
782 | |
762 | =item C<EV_ERROR> |
783 | =item C<EV_ERROR> |
763 | |
784 | |
764 | 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 |
765 | happen because the watcher could not be properly started because libev |
786 | happen because the watcher could not be properly started because libev |
… | |
… | |
983 | 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 |
984 | 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 |
985 | 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 |
986 | required if you know what you are doing). |
1007 | required if you know what you are doing). |
987 | |
1008 | |
988 | You have to be careful with dup'ed file descriptors, though. Some backends |
|
|
989 | (the linux epoll backend is a notable example) cannot handle dup'ed file |
|
|
990 | descriptors correctly if you register interest in two or more fds pointing |
|
|
991 | to the same underlying file/socket/etc. description (that is, they share |
|
|
992 | the same underlying "file open"). |
|
|
993 | |
|
|
994 | 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 |
995 | (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 |
996 | C<EVBACKEND_POLL>). |
1011 | C<EVBACKEND_POLL>). |
997 | |
1012 | |
998 | 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 |
… | |
… | |
1033 | |
1048 | |
1034 | =head3 The special problem of dup'ed file descriptors |
1049 | =head3 The special problem of dup'ed file descriptors |
1035 | |
1050 | |
1036 | Some backends (e.g. epoll), cannot register events for file descriptors, |
1051 | Some backends (e.g. epoll), cannot register events for file descriptors, |
1037 | but only events for the underlying file descriptions. That means when you |
1052 | but only events for the underlying file descriptions. That means when you |
1038 | 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 |
1039 | file descriptor might actually receive events. |
1054 | events for them, only one file descriptor might actually receive events. |
1040 | |
1055 | |
1041 | There is no workaround possible except not registering events |
1056 | There is no workaround possible except not registering events |
1042 | for potentially C<dup ()>'ed file descriptors, or to resort to |
1057 | for potentially C<dup ()>'ed file descriptors, or to resort to |
1043 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
1058 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
1044 | |
1059 | |
… | |
… | |
1073 | =item int events [read-only] |
1088 | =item int events [read-only] |
1074 | |
1089 | |
1075 | The events being watched. |
1090 | The events being watched. |
1076 | |
1091 | |
1077 | =back |
1092 | =back |
|
|
1093 | |
|
|
1094 | =head3 Examples |
1078 | |
1095 | |
1079 | 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 |
1080 | 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 |
1081 | attempt to read a whole line in the callback. |
1098 | attempt to read a whole line in the callback. |
1082 | |
1099 | |
… | |
… | |
1180 | 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), |
1181 | which is also when any modifications are taken into account. |
1198 | which is also when any modifications are taken into account. |
1182 | |
1199 | |
1183 | =back |
1200 | =back |
1184 | |
1201 | |
|
|
1202 | =head3 Examples |
|
|
1203 | |
1185 | Example: Create a timer that fires after 60 seconds. |
1204 | Example: Create a timer that fires after 60 seconds. |
1186 | |
1205 | |
1187 | static void |
1206 | static void |
1188 | 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) |
1189 | { |
1208 | { |
… | |
… | |
1346 | 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 |
1347 | trigger next. |
1366 | trigger next. |
1348 | |
1367 | |
1349 | =back |
1368 | =back |
1350 | |
1369 | |
|
|
1370 | =head3 Examples |
|
|
1371 | |
1351 | Example: Call a callback every hour, or, more precisely, whenever the |
1372 | Example: Call a callback every hour, or, more precisely, whenever the |
1352 | system clock is divisible by 3600. The callback invocation times have |
1373 | system clock is divisible by 3600. The callback invocation times have |
1353 | potentially a lot of jittering, but good long-term stability. |
1374 | potentially a lot of jittering, but good long-term stability. |
1354 | |
1375 | |
1355 | static void |
1376 | static void |
… | |
… | |
1421 | |
1442 | |
1422 | =head3 Watcher-Specific Functions and Data Members |
1443 | =head3 Watcher-Specific Functions and Data Members |
1423 | |
1444 | |
1424 | =over 4 |
1445 | =over 4 |
1425 | |
1446 | |
1426 | =item ev_child_init (ev_child *, callback, int pid) |
1447 | =item ev_child_init (ev_child *, callback, int pid, int trace) |
1427 | |
1448 | |
1428 | =item ev_child_set (ev_child *, int pid) |
1449 | =item ev_child_set (ev_child *, int pid, int trace) |
1429 | |
1450 | |
1430 | 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 |
1431 | 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 |
1432 | 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 |
1433 | 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 |
1434 | 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 |
1435 | 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). |
1436 | |
1459 | |
1437 | =item int pid [read-only] |
1460 | =item int pid [read-only] |
1438 | |
1461 | |
1439 | 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. |
1440 | |
1463 | |
… | |
… | |
1446 | |
1469 | |
1447 | 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 |
1448 | C<waitpid> and C<sys/wait.h> documentation for details). |
1471 | C<waitpid> and C<sys/wait.h> documentation for details). |
1449 | |
1472 | |
1450 | =back |
1473 | =back |
|
|
1474 | |
|
|
1475 | =head3 Examples |
1451 | |
1476 | |
1452 | Example: Try to exit cleanly on SIGINT and SIGTERM. |
1477 | Example: Try to exit cleanly on SIGINT and SIGTERM. |
1453 | |
1478 | |
1454 | static void |
1479 | static void |
1455 | 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) |
… | |
… | |
1496 | 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 |
1497 | 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 |
1498 | 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 |
1499 | polling. |
1524 | polling. |
1500 | |
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 | |
1501 | =head3 Watcher-Specific Functions and Data Members |
1559 | =head3 Watcher-Specific Functions and Data Members |
1502 | |
1560 | |
1503 | =over 4 |
1561 | =over 4 |
1504 | |
1562 | |
1505 | =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) |
… | |
… | |
1542 | =item const char *path [read-only] |
1600 | =item const char *path [read-only] |
1543 | |
1601 | |
1544 | The filesystem path that is being watched. |
1602 | The filesystem path that is being watched. |
1545 | |
1603 | |
1546 | =back |
1604 | =back |
|
|
1605 | |
|
|
1606 | =head3 Examples |
1547 | |
1607 | |
1548 | Example: Watch C</etc/passwd> for attribute changes. |
1608 | Example: Watch C</etc/passwd> for attribute changes. |
1549 | |
1609 | |
1550 | static void |
1610 | static void |
1551 | passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) |
1611 | passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) |
… | |
… | |
1564 | } |
1624 | } |
1565 | |
1625 | |
1566 | ... |
1626 | ... |
1567 | ev_stat passwd; |
1627 | ev_stat passwd; |
1568 | |
1628 | |
1569 | ev_stat_init (&passwd, passwd_cb, "/etc/passwd"); |
1629 | ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.); |
1570 | 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); |
1571 | |
1659 | |
1572 | |
1660 | |
1573 | =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... |
1574 | |
1662 | |
1575 | 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 |
… | |
… | |
1601 | 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, |
1602 | believe me. |
1690 | believe me. |
1603 | |
1691 | |
1604 | =back |
1692 | =back |
1605 | |
1693 | |
|
|
1694 | =head3 Examples |
|
|
1695 | |
1606 | 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 |
1607 | callback, free it. Also, use no error checking, as usual. |
1697 | callback, free it. Also, use no error checking, as usual. |
1608 | |
1698 | |
1609 | static void |
1699 | static void |
1610 | 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) |
1611 | { |
1701 | { |
1612 | free (w); |
1702 | free (w); |
1613 | // now do something you wanted to do when the program has |
1703 | // now do something you wanted to do when the program has |
1614 | // no longer asnything immediate to do. |
1704 | // no longer anything immediate to do. |
1615 | } |
1705 | } |
1616 | |
1706 | |
1617 | struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); |
1707 | struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); |
1618 | ev_idle_init (idle_watcher, idle_cb); |
1708 | ev_idle_init (idle_watcher, idle_cb); |
1619 | ev_idle_start (loop, idle_cb); |
1709 | ev_idle_start (loop, idle_cb); |
… | |
… | |
1681 | 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> |
1682 | macros, but using them is utterly, utterly and completely pointless. |
1772 | macros, but using them is utterly, utterly and completely pointless. |
1683 | |
1773 | |
1684 | =back |
1774 | =back |
1685 | |
1775 | |
|
|
1776 | =head3 Examples |
|
|
1777 | |
1686 | 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 |
1687 | 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 |
1688 | (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 |
1689 | 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> |
1690 | 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 |
… | |
… | |
1858 | portable one. |
1950 | portable one. |
1859 | |
1951 | |
1860 | 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 |
1861 | 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 |
1862 | 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 |
1863 | 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). |
1864 | |
1990 | |
1865 | struct ev_loop *loop_hi = ev_default_init (0); |
1991 | struct ev_loop *loop_hi = ev_default_init (0); |
1866 | struct ev_loop *loop_lo = 0; |
1992 | struct ev_loop *loop_lo = 0; |
1867 | struct ev_embed embed; |
1993 | struct ev_embed embed; |
1868 | |
1994 | |
… | |
… | |
1879 | ev_embed_start (loop_hi, &embed); |
2005 | ev_embed_start (loop_hi, &embed); |
1880 | } |
2006 | } |
1881 | else |
2007 | else |
1882 | loop_lo = loop_hi; |
2008 | loop_lo = loop_hi; |
1883 | |
2009 | |
1884 | =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). |
1885 | |
2014 | |
1886 | =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 | } |
1887 | |
2025 | |
1888 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
2026 | if (!loop_socket) |
|
|
2027 | loop_socket = loop; |
1889 | |
2028 | |
1890 | =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 |
1891 | |
|
|
1892 | Configures the watcher to embed the given loop, which must be |
|
|
1893 | embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be |
|
|
1894 | invoked automatically, otherwise it is the responsibility of the callback |
|
|
1895 | to invoke it (it will continue to be called until the sweep has been done, |
|
|
1896 | if you do not want thta, you need to temporarily stop the embed watcher). |
|
|
1897 | |
|
|
1898 | =item ev_embed_sweep (loop, ev_embed *) |
|
|
1899 | |
|
|
1900 | Make a single, non-blocking sweep over the embedded loop. This works |
|
|
1901 | similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most |
|
|
1902 | apropriate way for embedded loops. |
|
|
1903 | |
|
|
1904 | =item struct ev_loop *other [read-only] |
|
|
1905 | |
|
|
1906 | The embedded event loop. |
|
|
1907 | |
|
|
1908 | =back |
|
|
1909 | |
2030 | |
1910 | |
2031 | |
1911 | =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 |
1912 | |
2033 | |
1913 | 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 |
… | |
… | |
1929 | believe me. |
2050 | believe me. |
1930 | |
2051 | |
1931 | =back |
2052 | =back |
1932 | |
2053 | |
1933 | |
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. But at least I can tell you would implement locking around your |
|
|
2084 | queue: |
|
|
2085 | |
|
|
2086 | =over 4 |
|
|
2087 | |
|
|
2088 | =item queueing from a signal handler context |
|
|
2089 | |
|
|
2090 | To implement race-free queueing, you simply add to the queue in the signal |
|
|
2091 | handler but you block the signal handler in the watcher callback. Here is an example that does that for |
|
|
2092 | some fictitiuous SIGUSR1 handler: |
|
|
2093 | |
|
|
2094 | static ev_async mysig; |
|
|
2095 | |
|
|
2096 | static void |
|
|
2097 | sigusr1_handler (void) |
|
|
2098 | { |
|
|
2099 | sometype data; |
|
|
2100 | |
|
|
2101 | // no locking etc. |
|
|
2102 | queue_put (data); |
|
|
2103 | ev_async_send (DEFAULT_ &mysig); |
|
|
2104 | } |
|
|
2105 | |
|
|
2106 | static void |
|
|
2107 | mysig_cb (EV_P_ ev_async *w, int revents) |
|
|
2108 | { |
|
|
2109 | sometype data; |
|
|
2110 | sigset_t block, prev; |
|
|
2111 | |
|
|
2112 | sigemptyset (&block); |
|
|
2113 | sigaddset (&block, SIGUSR1); |
|
|
2114 | sigprocmask (SIG_BLOCK, &block, &prev); |
|
|
2115 | |
|
|
2116 | while (queue_get (&data)) |
|
|
2117 | process (data); |
|
|
2118 | |
|
|
2119 | if (sigismember (&prev, SIGUSR1) |
|
|
2120 | sigprocmask (SIG_UNBLOCK, &block, 0); |
|
|
2121 | } |
|
|
2122 | |
|
|
2123 | (Note: pthreads in theory requires you to use C<pthread_setmask> |
|
|
2124 | instead of C<sigprocmask> when you use threads, but libev doesn't do it |
|
|
2125 | either...). |
|
|
2126 | |
|
|
2127 | =item queueing from a thread context |
|
|
2128 | |
|
|
2129 | The strategy for threads is different, as you cannot (easily) block |
|
|
2130 | threads but you can easily preempt them, so to queue safely you need to |
|
|
2131 | employ a traditional mutex lock, such as in this pthread example: |
|
|
2132 | |
|
|
2133 | static ev_async mysig; |
|
|
2134 | static pthread_mutex_t mymutex = PTHREAD_MUTEX_INITIALIZER; |
|
|
2135 | |
|
|
2136 | static void |
|
|
2137 | otherthread (void) |
|
|
2138 | { |
|
|
2139 | // only need to lock the actual queueing operation |
|
|
2140 | pthread_mutex_lock (&mymutex); |
|
|
2141 | queue_put (data); |
|
|
2142 | pthread_mutex_unlock (&mymutex); |
|
|
2143 | |
|
|
2144 | ev_async_send (DEFAULT_ &mysig); |
|
|
2145 | } |
|
|
2146 | |
|
|
2147 | static void |
|
|
2148 | mysig_cb (EV_P_ ev_async *w, int revents) |
|
|
2149 | { |
|
|
2150 | pthread_mutex_lock (&mymutex); |
|
|
2151 | |
|
|
2152 | while (queue_get (&data)) |
|
|
2153 | process (data); |
|
|
2154 | |
|
|
2155 | pthread_mutex_unlock (&mymutex); |
|
|
2156 | } |
|
|
2157 | |
|
|
2158 | =back |
|
|
2159 | |
|
|
2160 | |
|
|
2161 | =head3 Watcher-Specific Functions and Data Members |
|
|
2162 | |
|
|
2163 | =over 4 |
|
|
2164 | |
|
|
2165 | =item ev_async_init (ev_async *, callback) |
|
|
2166 | |
|
|
2167 | Initialises and configures the async watcher - it has no parameters of any |
|
|
2168 | kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless, |
|
|
2169 | believe me. |
|
|
2170 | |
|
|
2171 | =item ev_async_send (loop, ev_async *) |
|
|
2172 | |
|
|
2173 | Sends/signals/activates the given C<ev_async> watcher, that is, feeds |
|
|
2174 | an C<EV_ASYNC> event on the watcher into the event loop. Unlike |
|
|
2175 | C<ev_feed_event>, this call is safe to do in other threads, signal or |
|
|
2176 | similar contexts (see the dicusssion of C<EV_ATOMIC_T> in the embedding |
|
|
2177 | section below on what exactly this means). |
|
|
2178 | |
|
|
2179 | This call incurs the overhead of a syscall only once per loop iteration, |
|
|
2180 | so while the overhead might be noticable, it doesn't apply to repeated |
|
|
2181 | calls to C<ev_async_send>. |
|
|
2182 | |
|
|
2183 | =back |
|
|
2184 | |
|
|
2185 | |
1934 | =head1 OTHER FUNCTIONS |
2186 | =head1 OTHER FUNCTIONS |
1935 | |
2187 | |
1936 | There are some other functions of possible interest. Described. Here. Now. |
2188 | There are some other functions of possible interest. Described. Here. Now. |
1937 | |
2189 | |
1938 | =over 4 |
2190 | =over 4 |
… | |
… | |
2165 | Example: Define a class with an IO and idle watcher, start one of them in |
2417 | Example: Define a class with an IO and idle watcher, start one of them in |
2166 | the constructor. |
2418 | the constructor. |
2167 | |
2419 | |
2168 | class myclass |
2420 | class myclass |
2169 | { |
2421 | { |
2170 | ev_io io; void io_cb (ev::io &w, int revents); |
2422 | ev::io io; void io_cb (ev::io &w, int revents); |
2171 | ev_idle idle void idle_cb (ev::idle &w, int revents); |
2423 | ev:idle idle void idle_cb (ev::idle &w, int revents); |
2172 | |
2424 | |
2173 | myclass (); |
2425 | myclass (int fd) |
2174 | } |
|
|
2175 | |
|
|
2176 | myclass::myclass (int fd) |
|
|
2177 | { |
2426 | { |
2178 | io .set <myclass, &myclass::io_cb > (this); |
2427 | io .set <myclass, &myclass::io_cb > (this); |
2179 | idle.set <myclass, &myclass::idle_cb> (this); |
2428 | idle.set <myclass, &myclass::idle_cb> (this); |
2180 | |
2429 | |
2181 | io.start (fd, ev::READ); |
2430 | io.start (fd, ev::READ); |
|
|
2431 | } |
2182 | } |
2432 | }; |
2183 | |
2433 | |
2184 | |
2434 | |
2185 | =head1 MACRO MAGIC |
2435 | =head1 MACRO MAGIC |
2186 | |
2436 | |
2187 | Libev can be compiled with a variety of options, the most fundamantal |
2437 | Libev can be compiled with a variety of options, the most fundamantal |
… | |
… | |
2392 | wants osf handles on win32 (this is the case when the select to |
2642 | wants osf handles on win32 (this is the case when the select to |
2393 | be used is the winsock select). This means that it will call |
2643 | be used is the winsock select). This means that it will call |
2394 | C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, |
2644 | C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, |
2395 | it is assumed that all these functions actually work on fds, even |
2645 | it is assumed that all these functions actually work on fds, even |
2396 | on win32. Should not be defined on non-win32 platforms. |
2646 | on win32. Should not be defined on non-win32 platforms. |
|
|
2647 | |
|
|
2648 | =item EV_FD_TO_WIN32_HANDLE |
|
|
2649 | |
|
|
2650 | If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map |
|
|
2651 | file descriptors to socket handles. When not defining this symbol (the |
|
|
2652 | default), then libev will call C<_get_osfhandle>, which is usually |
|
|
2653 | correct. In some cases, programs use their own file descriptor management, |
|
|
2654 | in which case they can provide this function to map fds to socket handles. |
2397 | |
2655 | |
2398 | =item EV_USE_POLL |
2656 | =item EV_USE_POLL |
2399 | |
2657 | |
2400 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
2658 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
2401 | backend. Otherwise it will be enabled on non-win32 platforms. It |
2659 | backend. Otherwise it will be enabled on non-win32 platforms. It |
… | |
… | |
2435 | |
2693 | |
2436 | If defined to be C<1>, libev will compile in support for the Linux inotify |
2694 | If defined to be C<1>, libev will compile in support for the Linux inotify |
2437 | interface to speed up C<ev_stat> watchers. Its actual availability will |
2695 | interface to speed up C<ev_stat> watchers. Its actual availability will |
2438 | be detected at runtime. |
2696 | be detected at runtime. |
2439 | |
2697 | |
|
|
2698 | =item EV_ATOMIC_T |
|
|
2699 | |
|
|
2700 | Libev requires an integer type (suitable for storing C<0> or C<1>) whose |
|
|
2701 | access is atomic with respect to other threads or signal contexts. No such |
|
|
2702 | type is easily found in the C language, so you can provide your own type |
|
|
2703 | that you know is safe for your purposes. It is used both for signal handler "locking" |
|
|
2704 | as well as for signal and thread safety in C<ev_async> watchers. |
|
|
2705 | |
|
|
2706 | In the absense of this define, libev will use C<sig_atomic_t volatile> |
|
|
2707 | (from F<signal.h>), which is usually good enough on most platforms. |
|
|
2708 | |
2440 | =item EV_H |
2709 | =item EV_H |
2441 | |
2710 | |
2442 | The name of the F<ev.h> header file used to include it. The default if |
2711 | The name of the F<ev.h> header file used to include it. The default if |
2443 | undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This |
2712 | undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be |
2444 | can be used to virtually rename the F<ev.h> header file in case of conflicts. |
2713 | used to virtually rename the F<ev.h> header file in case of conflicts. |
2445 | |
2714 | |
2446 | =item EV_CONFIG_H |
2715 | =item EV_CONFIG_H |
2447 | |
2716 | |
2448 | If C<EV_STANDALONE> isn't C<1>, this variable can be used to override |
2717 | If C<EV_STANDALONE> isn't C<1>, this variable can be used to override |
2449 | F<ev.c>'s idea of where to find the F<config.h> file, similarly to |
2718 | F<ev.c>'s idea of where to find the F<config.h> file, similarly to |
2450 | C<EV_H>, above. |
2719 | C<EV_H>, above. |
2451 | |
2720 | |
2452 | =item EV_EVENT_H |
2721 | =item EV_EVENT_H |
2453 | |
2722 | |
2454 | Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea |
2723 | Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea |
2455 | of how the F<event.h> header can be found. |
2724 | of how the F<event.h> header can be found, the default is C<"event.h">. |
2456 | |
2725 | |
2457 | =item EV_PROTOTYPES |
2726 | =item EV_PROTOTYPES |
2458 | |
2727 | |
2459 | If defined to be C<0>, then F<ev.h> will not define any function |
2728 | If defined to be C<0>, then F<ev.h> will not define any function |
2460 | prototypes, but still define all the structs and other symbols. This is |
2729 | prototypes, but still define all the structs and other symbols. This is |
… | |
… | |
2509 | defined to be C<0>, then they are not. |
2778 | defined to be C<0>, then they are not. |
2510 | |
2779 | |
2511 | =item EV_FORK_ENABLE |
2780 | =item EV_FORK_ENABLE |
2512 | |
2781 | |
2513 | If undefined or defined to be C<1>, then fork watchers are supported. If |
2782 | If undefined or defined to be C<1>, then fork watchers are supported. If |
|
|
2783 | defined to be C<0>, then they are not. |
|
|
2784 | |
|
|
2785 | =item EV_ASYNC_ENABLE |
|
|
2786 | |
|
|
2787 | If undefined or defined to be C<1>, then async watchers are supported. If |
2514 | defined to be C<0>, then they are not. |
2788 | defined to be C<0>, then they are not. |
2515 | |
2789 | |
2516 | =item EV_MINIMAL |
2790 | =item EV_MINIMAL |
2517 | |
2791 | |
2518 | If you need to shave off some kilobytes of code at the expense of some |
2792 | If you need to shave off some kilobytes of code at the expense of some |
… | |
… | |
2632 | |
2906 | |
2633 | =item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) |
2907 | =item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) |
2634 | |
2908 | |
2635 | This means that, when you have a watcher that triggers in one hour and |
2909 | This means that, when you have a watcher that triggers in one hour and |
2636 | there are 100 watchers that would trigger before that then inserting will |
2910 | there are 100 watchers that would trigger before that then inserting will |
2637 | have to skip those 100 watchers. |
2911 | have to skip roughly seven (C<ld 100>) of these watchers. |
2638 | |
2912 | |
2639 | =item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) |
2913 | =item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers) |
2640 | |
2914 | |
2641 | That means that for changing a timer costs less than removing/adding them |
2915 | That means that changing a timer costs less than removing/adding them |
2642 | as only the relative motion in the event queue has to be paid for. |
2916 | as only the relative motion in the event queue has to be paid for. |
2643 | |
2917 | |
2644 | =item Starting io/check/prepare/idle/signal/child watchers: O(1) |
2918 | =item Starting io/check/prepare/idle/signal/child/fork/async watchers: O(1) |
2645 | |
2919 | |
2646 | These just add the watcher into an array or at the head of a list. |
2920 | These just add the watcher into an array or at the head of a list. |
|
|
2921 | |
2647 | =item Stopping check/prepare/idle watchers: O(1) |
2922 | =item Stopping check/prepare/idle/fork/async watchers: O(1) |
2648 | |
2923 | |
2649 | =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) |
2924 | =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) |
2650 | |
2925 | |
2651 | These watchers are stored in lists then need to be walked to find the |
2926 | These watchers are stored in lists then need to be walked to find the |
2652 | correct watcher to remove. The lists are usually short (you don't usually |
2927 | correct watcher to remove. The lists are usually short (you don't usually |
2653 | have many watchers waiting for the same fd or signal). |
2928 | have many watchers waiting for the same fd or signal). |
2654 | |
2929 | |
2655 | =item Finding the next timer per loop iteration: O(1) |
2930 | =item Finding the next timer in each loop iteration: O(1) |
|
|
2931 | |
|
|
2932 | By virtue of using a binary heap, the next timer is always found at the |
|
|
2933 | beginning of the storage array. |
2656 | |
2934 | |
2657 | =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) |
2935 | =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) |
2658 | |
2936 | |
2659 | A change means an I/O watcher gets started or stopped, which requires |
2937 | A change means an I/O watcher gets started or stopped, which requires |
2660 | libev to recalculate its status (and possibly tell the kernel). |
2938 | libev to recalculate its status (and possibly tell the kernel, depending |
|
|
2939 | on backend and wether C<ev_io_set> was used). |
2661 | |
2940 | |
2662 | =item Activating one watcher: O(1) |
2941 | =item Activating one watcher (putting it into the pending state): O(1) |
2663 | |
2942 | |
2664 | =item Priority handling: O(number_of_priorities) |
2943 | =item Priority handling: O(number_of_priorities) |
2665 | |
2944 | |
2666 | Priorities are implemented by allocating some space for each |
2945 | Priorities are implemented by allocating some space for each |
2667 | priority. When doing priority-based operations, libev usually has to |
2946 | priority. When doing priority-based operations, libev usually has to |
2668 | linearly search all the priorities. |
2947 | linearly search all the priorities, but starting/stopping and activating |
|
|
2948 | watchers becomes O(1) w.r.t. priority handling. |
|
|
2949 | |
|
|
2950 | =item Sending an ev_async: O(1) |
|
|
2951 | |
|
|
2952 | =item Processing ev_async_send: O(number_of_async_watchers) |
|
|
2953 | |
|
|
2954 | =item Processing signals: O(max_signal_number) |
|
|
2955 | |
|
|
2956 | Sending involves a syscall I<iff> there were no other C<ev_async_send> |
|
|
2957 | calls in the current loop iteration. Checking for async and signal events |
|
|
2958 | involves iterating over all running async watchers or all signal numbers. |
2669 | |
2959 | |
2670 | =back |
2960 | =back |
2671 | |
2961 | |
2672 | |
2962 | |
|
|
2963 | =head1 Win32 platform limitations and workarounds |
|
|
2964 | |
|
|
2965 | Win32 doesn't support any of the standards (e.g. POSIX) that libev |
|
|
2966 | requires, and its I/O model is fundamentally incompatible with the POSIX |
|
|
2967 | model. Libev still offers limited functionality on this platform in |
|
|
2968 | the form of the C<EVBACKEND_SELECT> backend, and only supports socket |
|
|
2969 | descriptors. This only applies when using Win32 natively, not when using |
|
|
2970 | e.g. cygwin. |
|
|
2971 | |
|
|
2972 | There is no supported compilation method available on windows except |
|
|
2973 | embedding it into other applications. |
|
|
2974 | |
|
|
2975 | Due to the many, low, and arbitrary limits on the win32 platform and the |
|
|
2976 | abysmal performance of winsockets, using a large number of sockets is not |
|
|
2977 | recommended (and not reasonable). If your program needs to use more than |
|
|
2978 | a hundred or so sockets, then likely it needs to use a totally different |
|
|
2979 | implementation for windows, as libev offers the POSIX model, which cannot |
|
|
2980 | be implemented efficiently on windows (microsoft monopoly games). |
|
|
2981 | |
|
|
2982 | =over 4 |
|
|
2983 | |
|
|
2984 | =item The winsocket select function |
|
|
2985 | |
|
|
2986 | The winsocket C<select> function doesn't follow POSIX in that it requires |
|
|
2987 | socket I<handles> and not socket I<file descriptors>. This makes select |
|
|
2988 | very inefficient, and also requires a mapping from file descriptors |
|
|
2989 | to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>, |
|
|
2990 | C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor |
|
|
2991 | symbols for more info. |
|
|
2992 | |
|
|
2993 | The configuration for a "naked" win32 using the microsoft runtime |
|
|
2994 | libraries and raw winsocket select is: |
|
|
2995 | |
|
|
2996 | #define EV_USE_SELECT 1 |
|
|
2997 | #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ |
|
|
2998 | |
|
|
2999 | Note that winsockets handling of fd sets is O(n), so you can easily get a |
|
|
3000 | complexity in the O(n²) range when using win32. |
|
|
3001 | |
|
|
3002 | =item Limited number of file descriptors |
|
|
3003 | |
|
|
3004 | Windows has numerous arbitrary (and low) limits on things. Early versions |
|
|
3005 | of winsocket's select only supported waiting for a max. of C<64> handles |
|
|
3006 | (probably owning to the fact that all windows kernels can only wait for |
|
|
3007 | C<64> things at the same time internally; microsoft recommends spawning a |
|
|
3008 | chain of threads and wait for 63 handles and the previous thread in each). |
|
|
3009 | |
|
|
3010 | Newer versions support more handles, but you need to define C<FD_SETSIZE> |
|
|
3011 | to some high number (e.g. C<2048>) before compiling the winsocket select |
|
|
3012 | call (which might be in libev or elsewhere, for example, perl does its own |
|
|
3013 | select emulation on windows). |
|
|
3014 | |
|
|
3015 | Another limit is the number of file descriptors in the microsoft runtime |
|
|
3016 | libraries, which by default is C<64> (there must be a hidden I<64> fetish |
|
|
3017 | or something like this inside microsoft). You can increase this by calling |
|
|
3018 | C<_setmaxstdio>, which can increase this limit to C<2048> (another |
|
|
3019 | arbitrary limit), but is broken in many versions of the microsoft runtime |
|
|
3020 | libraries. |
|
|
3021 | |
|
|
3022 | This might get you to about C<512> or C<2048> sockets (depending on |
|
|
3023 | windows version and/or the phase of the moon). To get more, you need to |
|
|
3024 | wrap all I/O functions and provide your own fd management, but the cost of |
|
|
3025 | calling select (O(n²)) will likely make this unworkable. |
|
|
3026 | |
|
|
3027 | =back |
|
|
3028 | |
|
|
3029 | |
2673 | =head1 AUTHOR |
3030 | =head1 AUTHOR |
2674 | |
3031 | |
2675 | Marc Lehmann <libev@schmorp.de>. |
3032 | Marc Lehmann <libev@schmorp.de>. |
2676 | |
3033 | |