| … | |
… | |
| 1032 | optimisations to libev. |
1032 | optimisations to libev. |
| 1033 | |
1033 | |
| 1034 | =head3 The special problem of dup'ed file descriptors |
1034 | =head3 The special problem of dup'ed file descriptors |
| 1035 | |
1035 | |
| 1036 | Some backends (e.g. epoll), cannot register events for file descriptors, |
1036 | Some backends (e.g. epoll), cannot register events for file descriptors, |
| 1037 | but only events for the underlying file descriptions. That menas when you |
1037 | 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 |
1038 | have C<dup ()>'ed file descriptors and register events for them, only one |
| 1039 | file descriptor might actually receive events. |
1039 | file descriptor might actually receive events. |
| 1040 | |
1040 | |
| 1041 | There is no workaorund possible except not registering events |
1041 | There is no workaround possible except not registering events |
| 1042 | for potentially C<dup ()>'ed file descriptors or to resort to |
1042 | for potentially C<dup ()>'ed file descriptors, or to resort to |
| 1043 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
1043 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
| 1044 | |
1044 | |
| 1045 | =head3 The special problem of fork |
1045 | =head3 The special problem of fork |
| 1046 | |
1046 | |
| 1047 | Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit |
1047 | Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit |
| … | |
… | |
| 2526 | than enough. If you need to manage thousands of children you might want to |
2526 | than enough. If you need to manage thousands of children you might want to |
| 2527 | increase this value (I<must> be a power of two). |
2527 | increase this value (I<must> be a power of two). |
| 2528 | |
2528 | |
| 2529 | =item EV_INOTIFY_HASHSIZE |
2529 | =item EV_INOTIFY_HASHSIZE |
| 2530 | |
2530 | |
| 2531 | C<ev_staz> watchers use a small hash table to distribute workload by |
2531 | C<ev_stat> watchers use a small hash table to distribute workload by |
| 2532 | inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), |
2532 | inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), |
| 2533 | usually more than enough. If you need to manage thousands of C<ev_stat> |
2533 | usually more than enough. If you need to manage thousands of C<ev_stat> |
| 2534 | watchers you might want to increase this value (I<must> be a power of |
2534 | watchers you might want to increase this value (I<must> be a power of |
| 2535 | two). |
2535 | two). |
| 2536 | |
2536 | |
