… | |
… | |
77 | on event-based programming, nor will it introduce event-based programming |
77 | on event-based programming, nor will it introduce event-based programming |
78 | with libev. |
78 | with libev. |
79 | |
79 | |
80 | Familiarity with event based programming techniques in general is assumed |
80 | Familiarity with event based programming techniques in general is assumed |
81 | throughout this document. |
81 | throughout this document. |
|
|
82 | |
|
|
83 | =head1 WHAT TO READ WHEN IN A HURRY |
|
|
84 | |
|
|
85 | This manual tries to be very detailed, but unfortunately, this also makes |
|
|
86 | it very long. If you just want to know the basics of libev, I suggest |
|
|
87 | reading L<ANATOMY OF A WATCHER>, then the L<EXAMPLE PROGRAM> above and |
|
|
88 | look up the missing functions in L<GLOBAL FUNCTIONS> and the C<ev_io> and |
|
|
89 | C<ev_timer> sections in L<WATCHER TYPES>. |
82 | |
90 | |
83 | =head1 ABOUT LIBEV |
91 | =head1 ABOUT LIBEV |
84 | |
92 | |
85 | Libev is an event loop: you register interest in certain events (such as a |
93 | Libev is an event loop: you register interest in certain events (such as a |
86 | file descriptor being readable or a timeout occurring), and it will manage |
94 | file descriptor being readable or a timeout occurring), and it will manage |
… | |
… | |
233 | the current system, you would need to look at C<ev_embeddable_backends () |
241 | the current system, you would need to look at C<ev_embeddable_backends () |
234 | & ev_supported_backends ()>, likewise for recommended ones. |
242 | & ev_supported_backends ()>, likewise for recommended ones. |
235 | |
243 | |
236 | See the description of C<ev_embed> watchers for more info. |
244 | See the description of C<ev_embed> watchers for more info. |
237 | |
245 | |
238 | =item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT] |
246 | =item ev_set_allocator (void *(*cb)(void *ptr, long size)) |
239 | |
247 | |
240 | Sets the allocation function to use (the prototype is similar - the |
248 | Sets the allocation function to use (the prototype is similar - the |
241 | semantics are identical to the C<realloc> C89/SuS/POSIX function). It is |
249 | semantics are identical to the C<realloc> C89/SuS/POSIX function). It is |
242 | used to allocate and free memory (no surprises here). If it returns zero |
250 | used to allocate and free memory (no surprises here). If it returns zero |
243 | when memory needs to be allocated (C<size != 0>), the library might abort |
251 | when memory needs to be allocated (C<size != 0>), the library might abort |
… | |
… | |
269 | } |
277 | } |
270 | |
278 | |
271 | ... |
279 | ... |
272 | ev_set_allocator (persistent_realloc); |
280 | ev_set_allocator (persistent_realloc); |
273 | |
281 | |
274 | =item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT] |
282 | =item ev_set_syserr_cb (void (*cb)(const char *msg)) |
275 | |
283 | |
276 | Set the callback function to call on a retryable system call error (such |
284 | Set the callback function to call on a retryable system call error (such |
277 | as failed select, poll, epoll_wait). The message is a printable string |
285 | as failed select, poll, epoll_wait). The message is a printable string |
278 | indicating the system call or subsystem causing the problem. If this |
286 | indicating the system call or subsystem causing the problem. If this |
279 | callback is set, then libev will expect it to remedy the situation, no |
287 | callback is set, then libev will expect it to remedy the situation, no |
… | |
… | |
394 | environment variable. |
402 | environment variable. |
395 | |
403 | |
396 | =item C<EVFLAG_NOINOTIFY> |
404 | =item C<EVFLAG_NOINOTIFY> |
397 | |
405 | |
398 | When this flag is specified, then libev will not attempt to use the |
406 | When this flag is specified, then libev will not attempt to use the |
399 | I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and |
407 | I<inotify> API for its C<ev_stat> watchers. Apart from debugging and |
400 | testing, this flag can be useful to conserve inotify file descriptors, as |
408 | testing, this flag can be useful to conserve inotify file descriptors, as |
401 | otherwise each loop using C<ev_stat> watchers consumes one inotify handle. |
409 | otherwise each loop using C<ev_stat> watchers consumes one inotify handle. |
402 | |
410 | |
403 | =item C<EVFLAG_SIGNALFD> |
411 | =item C<EVFLAG_SIGNALFD> |
404 | |
412 | |
405 | When this flag is specified, then libev will attempt to use the |
413 | When this flag is specified, then libev will attempt to use the |
406 | I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API |
414 | I<signalfd> API for its C<ev_signal> (and C<ev_child>) watchers. This API |
407 | delivers signals synchronously, which makes it both faster and might make |
415 | delivers signals synchronously, which makes it both faster and might make |
408 | it possible to get the queued signal data. It can also simplify signal |
416 | it possible to get the queued signal data. It can also simplify signal |
409 | handling with threads, as long as you properly block signals in your |
417 | handling with threads, as long as you properly block signals in your |
410 | threads that are not interested in handling them. |
418 | threads that are not interested in handling them. |
411 | |
419 | |
… | |
… | |
455 | epoll scales either O(1) or O(active_fds). |
463 | epoll scales either O(1) or O(active_fds). |
456 | |
464 | |
457 | The epoll mechanism deserves honorable mention as the most misdesigned |
465 | The epoll mechanism deserves honorable mention as the most misdesigned |
458 | of the more advanced event mechanisms: mere annoyances include silently |
466 | of the more advanced event mechanisms: mere annoyances include silently |
459 | dropping file descriptors, requiring a system call per change per file |
467 | dropping file descriptors, requiring a system call per change per file |
460 | descriptor (and unnecessary guessing of parameters), problems with dup and |
468 | descriptor (and unnecessary guessing of parameters), problems with dup, |
|
|
469 | returning before the timeout value, resulting in additional iterations |
|
|
470 | (and only giving 5ms accuracy while select on the same platform gives |
461 | so on. The biggest issue is fork races, however - if a program forks then |
471 | 0.1ms) and so on. The biggest issue is fork races, however - if a program |
462 | I<both> parent and child process have to recreate the epoll set, which can |
472 | forks then I<both> parent and child process have to recreate the epoll |
463 | take considerable time (one syscall per file descriptor) and is of course |
473 | set, which can take considerable time (one syscall per file descriptor) |
464 | hard to detect. |
474 | and is of course hard to detect. |
465 | |
475 | |
466 | Epoll is also notoriously buggy - embedding epoll fds I<should> work, but |
476 | Epoll is also notoriously buggy - embedding epoll fds I<should> work, but |
467 | of course I<doesn't>, and epoll just loves to report events for totally |
477 | of course I<doesn't>, and epoll just loves to report events for totally |
468 | I<different> file descriptors (even already closed ones, so one cannot |
478 | I<different> file descriptors (even already closed ones, so one cannot |
469 | even remove them from the set) than registered in the set (especially |
479 | even remove them from the set) than registered in the set (especially |
… | |
… | |
471 | employing an additional generation counter and comparing that against the |
481 | employing an additional generation counter and comparing that against the |
472 | events to filter out spurious ones, recreating the set when required. Last |
482 | events to filter out spurious ones, recreating the set when required. Last |
473 | not least, it also refuses to work with some file descriptors which work |
483 | not least, it also refuses to work with some file descriptors which work |
474 | perfectly fine with C<select> (files, many character devices...). |
484 | perfectly fine with C<select> (files, many character devices...). |
475 | |
485 | |
|
|
486 | Epoll is truly the train wreck analog among event poll mechanisms. |
|
|
487 | |
476 | While stopping, setting and starting an I/O watcher in the same iteration |
488 | While stopping, setting and starting an I/O watcher in the same iteration |
477 | will result in some caching, there is still a system call per such |
489 | will result in some caching, there is still a system call per such |
478 | incident (because the same I<file descriptor> could point to a different |
490 | incident (because the same I<file descriptor> could point to a different |
479 | I<file description> now), so its best to avoid that. Also, C<dup ()>'ed |
491 | I<file description> now), so its best to avoid that. Also, C<dup ()>'ed |
480 | file descriptors might not work very well if you register events for both |
492 | file descriptors might not work very well if you register events for both |
… | |
… | |
607 | This function is normally used on loop objects allocated by |
619 | This function is normally used on loop objects allocated by |
608 | C<ev_loop_new>, but it can also be used on the default loop returned by |
620 | C<ev_loop_new>, but it can also be used on the default loop returned by |
609 | C<ev_default_loop>, in which case it is not thread-safe. |
621 | C<ev_default_loop>, in which case it is not thread-safe. |
610 | |
622 | |
611 | Note that it is not advisable to call this function on the default loop |
623 | Note that it is not advisable to call this function on the default loop |
612 | except in the rare occasion where you really need to free it's resources. |
624 | except in the rare occasion where you really need to free its resources. |
613 | If you need dynamically allocated loops it is better to use C<ev_loop_new> |
625 | If you need dynamically allocated loops it is better to use C<ev_loop_new> |
614 | and C<ev_loop_destroy>. |
626 | and C<ev_loop_destroy>. |
615 | |
627 | |
616 | =item ev_loop_fork (loop) |
628 | =item ev_loop_fork (loop) |
617 | |
629 | |
… | |
… | |
815 | Can be used to make a call to C<ev_run> return early (but only after it |
827 | Can be used to make a call to C<ev_run> return early (but only after it |
816 | has processed all outstanding events). The C<how> argument must be either |
828 | has processed all outstanding events). The C<how> argument must be either |
817 | C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or |
829 | C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or |
818 | C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return. |
830 | C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return. |
819 | |
831 | |
820 | This "unloop state" will be cleared when entering C<ev_run> again. |
832 | This "break state" will be cleared when entering C<ev_run> again. |
821 | |
833 | |
822 | It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO## |
834 | It is safe to call C<ev_break> from outside any C<ev_run> calls, too. |
823 | |
835 | |
824 | =item ev_ref (loop) |
836 | =item ev_ref (loop) |
825 | |
837 | |
826 | =item ev_unref (loop) |
838 | =item ev_unref (loop) |
827 | |
839 | |
… | |
… | |
1146 | programs, though, as the fd could already be closed and reused for another |
1158 | programs, though, as the fd could already be closed and reused for another |
1147 | thing, so beware. |
1159 | thing, so beware. |
1148 | |
1160 | |
1149 | =back |
1161 | =back |
1150 | |
1162 | |
1151 | =head2 WATCHER STATES |
|
|
1152 | |
|
|
1153 | There are various watcher states mentioned throughout this manual - |
|
|
1154 | active, pending and so on. In this section these states and the rules to |
|
|
1155 | transition between them will be described in more detail - and while these |
|
|
1156 | rules might look complicated, they usually do "the right thing". |
|
|
1157 | |
|
|
1158 | =over 4 |
|
|
1159 | |
|
|
1160 | =item initialiased |
|
|
1161 | |
|
|
1162 | Before a watcher can be registered with the event looop it has to be |
|
|
1163 | initialised. This can be done with a call to C<ev_TYPE_init>, or calls to |
|
|
1164 | C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. |
|
|
1165 | |
|
|
1166 | In this state it is simply some block of memory that is suitable for use |
|
|
1167 | in an event loop. It can be moved around, freed, reused etc. at will. |
|
|
1168 | |
|
|
1169 | =item started/running/active |
|
|
1170 | |
|
|
1171 | Once a watcher has been started with a call to C<ev_TYPE_start> it becomes |
|
|
1172 | property of the event loop, and is actively waiting for events. While in |
|
|
1173 | this state it cannot be accessed (except in a few documented ways), moved, |
|
|
1174 | freed or anything else - the only legal thing is to keep a pointer to it, |
|
|
1175 | and call libev functions on it that are documented to work on active watchers. |
|
|
1176 | |
|
|
1177 | =item pending |
|
|
1178 | |
|
|
1179 | If a watcher is active and libev determines that an event it is interested |
|
|
1180 | in has occurred (such as a timer expiring), it will become pending. It will |
|
|
1181 | stay in this pending state until either it is stopped or its callback is |
|
|
1182 | about to be invoked, so it is not normally pending inside the watcher |
|
|
1183 | callback. |
|
|
1184 | |
|
|
1185 | The watcher might or might not be active while it is pending (for example, |
|
|
1186 | an expired non-repeating timer can be pending but no longer active). If it |
|
|
1187 | is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>), |
|
|
1188 | but it is still property of the event loop at this time, so cannot be |
|
|
1189 | moved, freed or reused. And if it is active the rules described in the |
|
|
1190 | previous item still apply. |
|
|
1191 | |
|
|
1192 | It is also possible to feed an event on a watcher that is not active (e.g. |
|
|
1193 | via C<ev_feed_event>), in which case it becomes pending without being |
|
|
1194 | active. |
|
|
1195 | |
|
|
1196 | =item stopped |
|
|
1197 | |
|
|
1198 | A watcher can be stopped implicitly by libev (in which case it might still |
|
|
1199 | be pending), or explicitly by calling its C<ev_TYPE_stop> function. The |
|
|
1200 | latter will clear any pending state the watcher might be in, regardless |
|
|
1201 | of whether it was active or not, so stopping a watcher explicitly before |
|
|
1202 | freeing it is often a good idea. |
|
|
1203 | |
|
|
1204 | While stopped (and not pending) the watcher is essentially in the |
|
|
1205 | initialised state, that is it can be reused, moved, modified in any way |
|
|
1206 | you wish. |
|
|
1207 | |
|
|
1208 | =back |
|
|
1209 | |
|
|
1210 | =head2 GENERIC WATCHER FUNCTIONS |
1163 | =head2 GENERIC WATCHER FUNCTIONS |
1211 | |
1164 | |
1212 | =over 4 |
1165 | =over 4 |
1213 | |
1166 | |
1214 | =item C<ev_init> (ev_TYPE *watcher, callback) |
1167 | =item C<ev_init> (ev_TYPE *watcher, callback) |
… | |
… | |
1355 | |
1308 | |
1356 | See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related |
1309 | See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related |
1357 | functions that do not need a watcher. |
1310 | functions that do not need a watcher. |
1358 | |
1311 | |
1359 | =back |
1312 | =back |
1360 | |
|
|
1361 | |
1313 | |
1362 | =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER |
1314 | =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER |
1363 | |
1315 | |
1364 | Each watcher has, by default, a member C<void *data> that you can change |
1316 | Each watcher has, by default, a member C<void *data> that you can change |
1365 | and read at any time: libev will completely ignore it. This can be used |
1317 | and read at any time: libev will completely ignore it. This can be used |
… | |
… | |
1421 | t2_cb (EV_P_ ev_timer *w, int revents) |
1373 | t2_cb (EV_P_ ev_timer *w, int revents) |
1422 | { |
1374 | { |
1423 | struct my_biggy big = (struct my_biggy *) |
1375 | struct my_biggy big = (struct my_biggy *) |
1424 | (((char *)w) - offsetof (struct my_biggy, t2)); |
1376 | (((char *)w) - offsetof (struct my_biggy, t2)); |
1425 | } |
1377 | } |
|
|
1378 | |
|
|
1379 | =head2 WATCHER STATES |
|
|
1380 | |
|
|
1381 | There are various watcher states mentioned throughout this manual - |
|
|
1382 | active, pending and so on. In this section these states and the rules to |
|
|
1383 | transition between them will be described in more detail - and while these |
|
|
1384 | rules might look complicated, they usually do "the right thing". |
|
|
1385 | |
|
|
1386 | =over 4 |
|
|
1387 | |
|
|
1388 | =item initialiased |
|
|
1389 | |
|
|
1390 | Before a watcher can be registered with the event looop it has to be |
|
|
1391 | initialised. This can be done with a call to C<ev_TYPE_init>, or calls to |
|
|
1392 | C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. |
|
|
1393 | |
|
|
1394 | In this state it is simply some block of memory that is suitable for use |
|
|
1395 | in an event loop. It can be moved around, freed, reused etc. at will. |
|
|
1396 | |
|
|
1397 | =item started/running/active |
|
|
1398 | |
|
|
1399 | Once a watcher has been started with a call to C<ev_TYPE_start> it becomes |
|
|
1400 | property of the event loop, and is actively waiting for events. While in |
|
|
1401 | this state it cannot be accessed (except in a few documented ways), moved, |
|
|
1402 | freed or anything else - the only legal thing is to keep a pointer to it, |
|
|
1403 | and call libev functions on it that are documented to work on active watchers. |
|
|
1404 | |
|
|
1405 | =item pending |
|
|
1406 | |
|
|
1407 | If a watcher is active and libev determines that an event it is interested |
|
|
1408 | in has occurred (such as a timer expiring), it will become pending. It will |
|
|
1409 | stay in this pending state until either it is stopped or its callback is |
|
|
1410 | about to be invoked, so it is not normally pending inside the watcher |
|
|
1411 | callback. |
|
|
1412 | |
|
|
1413 | The watcher might or might not be active while it is pending (for example, |
|
|
1414 | an expired non-repeating timer can be pending but no longer active). If it |
|
|
1415 | is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>), |
|
|
1416 | but it is still property of the event loop at this time, so cannot be |
|
|
1417 | moved, freed or reused. And if it is active the rules described in the |
|
|
1418 | previous item still apply. |
|
|
1419 | |
|
|
1420 | It is also possible to feed an event on a watcher that is not active (e.g. |
|
|
1421 | via C<ev_feed_event>), in which case it becomes pending without being |
|
|
1422 | active. |
|
|
1423 | |
|
|
1424 | =item stopped |
|
|
1425 | |
|
|
1426 | A watcher can be stopped implicitly by libev (in which case it might still |
|
|
1427 | be pending), or explicitly by calling its C<ev_TYPE_stop> function. The |
|
|
1428 | latter will clear any pending state the watcher might be in, regardless |
|
|
1429 | of whether it was active or not, so stopping a watcher explicitly before |
|
|
1430 | freeing it is often a good idea. |
|
|
1431 | |
|
|
1432 | While stopped (and not pending) the watcher is essentially in the |
|
|
1433 | initialised state, that is it can be reused, moved, modified in any way |
|
|
1434 | you wish. |
|
|
1435 | |
|
|
1436 | =back |
1426 | |
1437 | |
1427 | =head2 WATCHER PRIORITY MODELS |
1438 | =head2 WATCHER PRIORITY MODELS |
1428 | |
1439 | |
1429 | Many event loops support I<watcher priorities>, which are usually small |
1440 | Many event loops support I<watcher priorities>, which are usually small |
1430 | integers that influence the ordering of event callback invocation |
1441 | integers that influence the ordering of event callback invocation |
… | |
… | |
2249 | |
2260 | |
2250 | =head2 C<ev_signal> - signal me when a signal gets signalled! |
2261 | =head2 C<ev_signal> - signal me when a signal gets signalled! |
2251 | |
2262 | |
2252 | Signal watchers will trigger an event when the process receives a specific |
2263 | Signal watchers will trigger an event when the process receives a specific |
2253 | signal one or more times. Even though signals are very asynchronous, libev |
2264 | signal one or more times. Even though signals are very asynchronous, libev |
2254 | will try it's best to deliver signals synchronously, i.e. as part of the |
2265 | will try its best to deliver signals synchronously, i.e. as part of the |
2255 | normal event processing, like any other event. |
2266 | normal event processing, like any other event. |
2256 | |
2267 | |
2257 | If you want signals to be delivered truly asynchronously, just use |
2268 | If you want signals to be delivered truly asynchronously, just use |
2258 | C<sigaction> as you would do without libev and forget about sharing |
2269 | C<sigaction> as you would do without libev and forget about sharing |
2259 | the signal. You can even use C<ev_async> from a signal handler to |
2270 | the signal. You can even use C<ev_async> from a signal handler to |
… | |
… | |
4757 | structure (guaranteed by POSIX but not by ISO C for example), but it also |
4768 | structure (guaranteed by POSIX but not by ISO C for example), but it also |
4758 | assumes that the same (machine) code can be used to call any watcher |
4769 | assumes that the same (machine) code can be used to call any watcher |
4759 | callback: The watcher callbacks have different type signatures, but libev |
4770 | callback: The watcher callbacks have different type signatures, but libev |
4760 | calls them using an C<ev_watcher *> internally. |
4771 | calls them using an C<ev_watcher *> internally. |
4761 | |
4772 | |
|
|
4773 | =item pointer accesses must be thread-atomic |
|
|
4774 | |
|
|
4775 | Accessing a pointer value must be atomic, it must both be readable and |
|
|
4776 | writable in one piece - this is the case on all current architectures. |
|
|
4777 | |
4762 | =item C<sig_atomic_t volatile> must be thread-atomic as well |
4778 | =item C<sig_atomic_t volatile> must be thread-atomic as well |
4763 | |
4779 | |
4764 | The type C<sig_atomic_t volatile> (or whatever is defined as |
4780 | The type C<sig_atomic_t volatile> (or whatever is defined as |
4765 | C<EV_ATOMIC_T>) must be atomic with respect to accesses from different |
4781 | C<EV_ATOMIC_T>) must be atomic with respect to accesses from different |
4766 | threads. This is not part of the specification for C<sig_atomic_t>, but is |
4782 | threads. This is not part of the specification for C<sig_atomic_t>, but is |
… | |
… | |
4872 | =back |
4888 | =back |
4873 | |
4889 | |
4874 | |
4890 | |
4875 | =head1 PORTING FROM LIBEV 3.X TO 4.X |
4891 | =head1 PORTING FROM LIBEV 3.X TO 4.X |
4876 | |
4892 | |
4877 | The major version 4 introduced some minor incompatible changes to the API. |
4893 | The major version 4 introduced some incompatible changes to the API. |
4878 | |
4894 | |
4879 | At the moment, the C<ev.h> header file tries to implement superficial |
4895 | At the moment, the C<ev.h> header file provides compatibility definitions |
4880 | compatibility, so most programs should still compile. Those might be |
4896 | for all changes, so most programs should still compile. The compatibility |
4881 | removed in later versions of libev, so better update early than late. |
4897 | layer might be removed in later versions of libev, so better update to the |
|
|
4898 | new API early than late. |
4882 | |
4899 | |
4883 | =over 4 |
4900 | =over 4 |
|
|
4901 | |
|
|
4902 | =item C<EV_COMPAT3> backwards compatibility mechanism |
|
|
4903 | |
|
|
4904 | The backward compatibility mechanism can be controlled by |
|
|
4905 | C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING> |
|
|
4906 | section. |
4884 | |
4907 | |
4885 | =item C<ev_default_destroy> and C<ev_default_fork> have been removed |
4908 | =item C<ev_default_destroy> and C<ev_default_fork> have been removed |
4886 | |
4909 | |
4887 | These calls can be replaced easily by their C<ev_loop_xxx> counterparts: |
4910 | These calls can be replaced easily by their C<ev_loop_xxx> counterparts: |
4888 | |
4911 | |
… | |
… | |
4914 | ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme |
4937 | ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme |
4915 | as all other watcher types. Note that C<ev_loop_fork> is still called |
4938 | as all other watcher types. Note that C<ev_loop_fork> is still called |
4916 | C<ev_loop_fork> because it would otherwise clash with the C<ev_fork> |
4939 | C<ev_loop_fork> because it would otherwise clash with the C<ev_fork> |
4917 | typedef. |
4940 | typedef. |
4918 | |
4941 | |
4919 | =item C<EV_COMPAT3> backwards compatibility mechanism |
|
|
4920 | |
|
|
4921 | The backward compatibility mechanism can be controlled by |
|
|
4922 | C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING> |
|
|
4923 | section. |
|
|
4924 | |
|
|
4925 | =item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES> |
4942 | =item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES> |
4926 | |
4943 | |
4927 | The preprocessor symbol C<EV_MINIMAL> has been replaced by a different |
4944 | The preprocessor symbol C<EV_MINIMAL> has been replaced by a different |
4928 | mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile |
4945 | mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile |
4929 | and work, but the library code will of course be larger. |
4946 | and work, but the library code will of course be larger. |
… | |
… | |
5003 | |
5020 | |
5004 | =back |
5021 | =back |
5005 | |
5022 | |
5006 | =head1 AUTHOR |
5023 | =head1 AUTHOR |
5007 | |
5024 | |
5008 | Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. |
5025 | Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael |
|
|
5026 | Magnusson and Emanuele Giaquinta. |
5009 | |
5027 | |