ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.pod
(Generate patch)

Comparing libev/ev.pod (file contents):
Revision 1.355 by root, Tue Jan 11 01:41:56 2011 UTC vs.
Revision 1.371 by root, Sat Jun 4 05:25:03 2011 UTC

58 ev_timer_start (loop, &timeout_watcher); 58 ev_timer_start (loop, &timeout_watcher);
59 59
60 // now wait for events to arrive 60 // now wait for events to arrive
61 ev_run (loop, 0); 61 ev_run (loop, 0);
62 62
63 // unloop was called, so exit 63 // break was called, so exit
64 return 0; 64 return 0;
65 } 65 }
66 66
67=head1 ABOUT THIS DOCUMENT 67=head1 ABOUT THIS DOCUMENT
68 68
178you actually want to know. Also interesting is the combination of 178you actually want to know. Also interesting is the combination of
179C<ev_update_now> and C<ev_now>. 179C<ev_update_now> and C<ev_now>.
180 180
181=item ev_sleep (ev_tstamp interval) 181=item ev_sleep (ev_tstamp interval)
182 182
183Sleep for the given interval: The current thread will be blocked until 183Sleep for the given interval: The current thread will be blocked
184either it is interrupted or the given time interval has passed. Basically 184until either it is interrupted or the given time interval has
185passed (approximately - it might return a bit earlier even if not
186interrupted). Returns immediately if C<< interval <= 0 >>.
187
185this is a sub-second-resolution C<sleep ()>. 188Basically this is a sub-second-resolution C<sleep ()>.
189
190The range of the C<interval> is limited - libev only guarantees to work
191with sleep times of up to one day (C<< interval <= 86400 >>).
186 192
187=item int ev_version_major () 193=item int ev_version_major ()
188 194
189=item int ev_version_minor () 195=item int ev_version_minor ()
190 196
442 448
443This behaviour is useful when you want to do your own signal handling, or 449This behaviour is useful when you want to do your own signal handling, or
444want to handle signals only in specific threads and want to avoid libev 450want to handle signals only in specific threads and want to avoid libev
445unblocking the signals. 451unblocking the signals.
446 452
453It's also required by POSIX in a threaded program, as libev calls
454C<sigprocmask>, whose behaviour is officially unspecified.
455
447This flag's behaviour will become the default in future versions of libev. 456This flag's behaviour will become the default in future versions of libev.
448 457
449=item C<EVBACKEND_SELECT> (value 1, portable select backend) 458=item C<EVBACKEND_SELECT> (value 1, portable select backend)
450 459
451This is your standard select(2) backend. Not I<completely> standard, as 460This is your standard select(2) backend. Not I<completely> standard, as
480=item C<EVBACKEND_EPOLL> (value 4, Linux) 489=item C<EVBACKEND_EPOLL> (value 4, Linux)
481 490
482Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9 491Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
483kernels). 492kernels).
484 493
485For few fds, this backend is a bit little slower than poll and select, 494For few fds, this backend is a bit little slower than poll and select, but
486but it scales phenomenally better. While poll and select usually scale 495it scales phenomenally better. While poll and select usually scale like
487like O(total_fds) where n is the total number of fds (or the highest fd), 496O(total_fds) where total_fds is the total number of fds (or the highest
488epoll scales either O(1) or O(active_fds). 497fd), epoll scales either O(1) or O(active_fds).
489 498
490The epoll mechanism deserves honorable mention as the most misdesigned 499The epoll mechanism deserves honorable mention as the most misdesigned
491of the more advanced event mechanisms: mere annoyances include silently 500of the more advanced event mechanisms: mere annoyances include silently
492dropping file descriptors, requiring a system call per change per file 501dropping file descriptors, requiring a system call per change per file
493descriptor (and unnecessary guessing of parameters), problems with dup, 502descriptor (and unnecessary guessing of parameters), problems with dup,
4960.1ms) and so on. The biggest issue is fork races, however - if a program 5050.1ms) and so on. The biggest issue is fork races, however - if a program
497forks then I<both> parent and child process have to recreate the epoll 506forks then I<both> parent and child process have to recreate the epoll
498set, which can take considerable time (one syscall per file descriptor) 507set, which can take considerable time (one syscall per file descriptor)
499and is of course hard to detect. 508and is of course hard to detect.
500 509
501Epoll is also notoriously buggy - embedding epoll fds I<should> work, but 510Epoll is also notoriously buggy - embedding epoll fds I<should> work,
502of course I<doesn't>, and epoll just loves to report events for totally 511but of course I<doesn't>, and epoll just loves to report events for
503I<different> file descriptors (even already closed ones, so one cannot 512totally I<different> file descriptors (even already closed ones, so
504even remove them from the set) than registered in the set (especially 513one cannot even remove them from the set) than registered in the set
505on SMP systems). Libev tries to counter these spurious notifications by 514(especially on SMP systems). Libev tries to counter these spurious
506employing an additional generation counter and comparing that against the 515notifications by employing an additional generation counter and comparing
507events to filter out spurious ones, recreating the set when required. Last 516that against the events to filter out spurious ones, recreating the set
517when required. Epoll also errornously rounds down timeouts, but gives you
518no way to know when and by how much, so sometimes you have to busy-wait
519because epoll returns immediately despite a nonzero timeout. And last
508not least, it also refuses to work with some file descriptors which work 520not least, it also refuses to work with some file descriptors which work
509perfectly fine with C<select> (files, many character devices...). 521perfectly fine with C<select> (files, many character devices...).
510 522
511Epoll is truly the train wreck analog among event poll mechanisms, 523Epoll is truly the train wreck among event poll mechanisms, a frankenpoll,
512a frankenpoll, cobbled together in a hurry, no thought to design or 524cobbled together in a hurry, no thought to design or interaction with
513interaction with others. 525others. Oh, the pain, will it ever stop...
514 526
515While stopping, setting and starting an I/O watcher in the same iteration 527While stopping, setting and starting an I/O watcher in the same iteration
516will result in some caching, there is still a system call per such 528will result in some caching, there is still a system call per such
517incident (because the same I<file descriptor> could point to a different 529incident (because the same I<file descriptor> could point to a different
518I<file description> now), so its best to avoid that. Also, C<dup ()>'ed 530I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
822This is useful if you are waiting for some external event in conjunction 834This is useful if you are waiting for some external event in conjunction
823with something not expressible using other libev watchers (i.e. "roll your 835with something not expressible using other libev watchers (i.e. "roll your
824own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is 836own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
825usually a better approach for this kind of thing. 837usually a better approach for this kind of thing.
826 838
827Here are the gory details of what C<ev_run> does: 839Here are the gory details of what C<ev_run> does (this is for your
840understanding, not a guarantee that things will work exactly like this in
841future versions):
828 842
829 - Increment loop depth. 843 - Increment loop depth.
830 - Reset the ev_break status. 844 - Reset the ev_break status.
831 - Before the first iteration, call any pending watchers. 845 - Before the first iteration, call any pending watchers.
832 LOOP: 846 LOOP:
865anymore. 879anymore.
866 880
867 ... queue jobs here, make sure they register event watchers as long 881 ... queue jobs here, make sure they register event watchers as long
868 ... as they still have work to do (even an idle watcher will do..) 882 ... as they still have work to do (even an idle watcher will do..)
869 ev_run (my_loop, 0); 883 ev_run (my_loop, 0);
870 ... jobs done or somebody called unloop. yeah! 884 ... jobs done or somebody called break. yeah!
871 885
872=item ev_break (loop, how) 886=item ev_break (loop, how)
873 887
874Can be used to make a call to C<ev_run> return early (but only after it 888Can be used to make a call to C<ev_run> return early (but only after it
875has processed all outstanding events). The C<how> argument must be either 889has processed all outstanding events). The C<how> argument must be either
1357See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1371See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1358functions that do not need a watcher. 1372functions that do not need a watcher.
1359 1373
1360=back 1374=back
1361 1375
1362=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1376See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR
1363 1377OWN COMPOSITE WATCHERS> idioms.
1364Each watcher has, by default, a member C<void *data> that you can change
1365and read at any time: libev will completely ignore it. This can be used
1366to associate arbitrary data with your watcher. If you need more data and
1367don't want to allocate memory and store a pointer to it in that data
1368member, you can also "subclass" the watcher type and provide your own
1369data:
1370
1371 struct my_io
1372 {
1373 ev_io io;
1374 int otherfd;
1375 void *somedata;
1376 struct whatever *mostinteresting;
1377 };
1378
1379 ...
1380 struct my_io w;
1381 ev_io_init (&w.io, my_cb, fd, EV_READ);
1382
1383And since your callback will be called with a pointer to the watcher, you
1384can cast it back to your own type:
1385
1386 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1387 {
1388 struct my_io *w = (struct my_io *)w_;
1389 ...
1390 }
1391
1392More interesting and less C-conformant ways of casting your callback type
1393instead have been omitted.
1394
1395Another common scenario is to use some data structure with multiple
1396embedded watchers:
1397
1398 struct my_biggy
1399 {
1400 int some_data;
1401 ev_timer t1;
1402 ev_timer t2;
1403 }
1404
1405In this case getting the pointer to C<my_biggy> is a bit more
1406complicated: Either you store the address of your C<my_biggy> struct
1407in the C<data> member of the watcher (for woozies), or you need to use
1408some pointer arithmetic using C<offsetof> inside your watchers (for real
1409programmers):
1410
1411 #include <stddef.h>
1412
1413 static void
1414 t1_cb (EV_P_ ev_timer *w, int revents)
1415 {
1416 struct my_biggy big = (struct my_biggy *)
1417 (((char *)w) - offsetof (struct my_biggy, t1));
1418 }
1419
1420 static void
1421 t2_cb (EV_P_ ev_timer *w, int revents)
1422 {
1423 struct my_biggy big = (struct my_biggy *)
1424 (((char *)w) - offsetof (struct my_biggy, t2));
1425 }
1426 1378
1427=head2 WATCHER STATES 1379=head2 WATCHER STATES
1428 1380
1429There are various watcher states mentioned throughout this manual - 1381There are various watcher states mentioned throughout this manual -
1430active, pending and so on. In this section these states and the rules to 1382active, pending and so on. In this section these states and the rules to
1437 1389
1438Before a watcher can be registered with the event looop it has to be 1390Before a watcher can be registered with the event looop it has to be
1439initialised. This can be done with a call to C<ev_TYPE_init>, or calls to 1391initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1440C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. 1392C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1441 1393
1442In this state it is simply some block of memory that is suitable for use 1394In this state it is simply some block of memory that is suitable for
1443in an event loop. It can be moved around, freed, reused etc. at will. 1395use in an event loop. It can be moved around, freed, reused etc. at
1396will - as long as you either keep the memory contents intact, or call
1397C<ev_TYPE_init> again.
1444 1398
1445=item started/running/active 1399=item started/running/active
1446 1400
1447Once a watcher has been started with a call to C<ev_TYPE_start> it becomes 1401Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1448property of the event loop, and is actively waiting for events. While in 1402property of the event loop, and is actively waiting for events. While in
1476latter will clear any pending state the watcher might be in, regardless 1430latter will clear any pending state the watcher might be in, regardless
1477of whether it was active or not, so stopping a watcher explicitly before 1431of whether it was active or not, so stopping a watcher explicitly before
1478freeing it is often a good idea. 1432freeing it is often a good idea.
1479 1433
1480While stopped (and not pending) the watcher is essentially in the 1434While stopped (and not pending) the watcher is essentially in the
1481initialised state, that is it can be reused, moved, modified in any way 1435initialised state, that is, it can be reused, moved, modified in any way
1482you wish. 1436you wish (but when you trash the memory block, you need to C<ev_TYPE_init>
1437it again).
1483 1438
1484=back 1439=back
1485 1440
1486=head2 WATCHER PRIORITY MODELS 1441=head2 WATCHER PRIORITY MODELS
1487 1442
1680always get a readiness notification instantly, and your read (or possibly 1635always get a readiness notification instantly, and your read (or possibly
1681write) will still block on the disk I/O. 1636write) will still block on the disk I/O.
1682 1637
1683Another way to view it is that in the case of sockets, pipes, character 1638Another way to view it is that in the case of sockets, pipes, character
1684devices and so on, there is another party (the sender) that delivers data 1639devices and so on, there is another party (the sender) that delivers data
1685on it's own, but in the case of files, there is no such thing: the disk 1640on its own, but in the case of files, there is no such thing: the disk
1686will not send data on it's own, simply because it doesn't know what you 1641will not send data on its own, simply because it doesn't know what you
1687wish to read - you would first have to request some data. 1642wish to read - you would first have to request some data.
1688 1643
1689Since files are typically not-so-well supported by advanced notification 1644Since files are typically not-so-well supported by advanced notification
1690mechanism, libev tries hard to emulate POSIX behaviour with respect 1645mechanism, libev tries hard to emulate POSIX behaviour with respect
1691to files, even though you should not use it. The reason for this is 1646to files, even though you should not use it. The reason for this is
2207 2162
2208Another way to think about it (for the mathematically inclined) is that 2163Another way to think about it (for the mathematically inclined) is that
2209C<ev_periodic> will try to run the callback in this mode at the next possible 2164C<ev_periodic> will try to run the callback in this mode at the next possible
2210time where C<time = offset (mod interval)>, regardless of any time jumps. 2165time where C<time = offset (mod interval)>, regardless of any time jumps.
2211 2166
2212For numerical stability it is preferable that the C<offset> value is near 2167The C<interval> I<MUST> be positive, and for numerical stability, the
2213C<ev_now ()> (the current time), but there is no range requirement for 2168interval value should be higher than C<1/8192> (which is around 100
2214this value, and in fact is often specified as zero. 2169microseconds) and C<offset> should be higher than C<0> and should have
2170at most a similar magnitude as the current time (say, within a factor of
2171ten). Typical values for offset are, in fact, C<0> or something between
2172C<0> and C<interval>, which is also the recommended range.
2215 2173
2216Note also that there is an upper limit to how often a timer can fire (CPU 2174Note also that there is an upper limit to how often a timer can fire (CPU
2217speed for example), so if C<interval> is very small then timing stability 2175speed for example), so if C<interval> is very small then timing stability
2218will of course deteriorate. Libev itself tries to be exact to be about one 2176will of course deteriorate. Libev itself tries to be exact to be about one
2219millisecond (if the OS supports it and the machine is fast enough). 2177millisecond (if the OS supports it and the machine is fast enough).
2362=head3 The special problem of inheritance over fork/execve/pthread_create 2320=head3 The special problem of inheritance over fork/execve/pthread_create
2363 2321
2364Both the signal mask (C<sigprocmask>) and the signal disposition 2322Both the signal mask (C<sigprocmask>) and the signal disposition
2365(C<sigaction>) are unspecified after starting a signal watcher (and after 2323(C<sigaction>) are unspecified after starting a signal watcher (and after
2366stopping it again), that is, libev might or might not block the signal, 2324stopping it again), that is, libev might or might not block the signal,
2367and might or might not set or restore the installed signal handler. 2325and might or might not set or restore the installed signal handler (but
2326see C<EVFLAG_NOSIGMASK>).
2368 2327
2369While this does not matter for the signal disposition (libev never 2328While this does not matter for the signal disposition (libev never
2370sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on 2329sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2371C<execve>), this matters for the signal mask: many programs do not expect 2330C<execve>), this matters for the signal mask: many programs do not expect
2372certain signals to be blocked. 2331certain signals to be blocked.
3243 atexit (program_exits); 3202 atexit (program_exits);
3244 3203
3245 3204
3246=head2 C<ev_async> - how to wake up an event loop 3205=head2 C<ev_async> - how to wake up an event loop
3247 3206
3248In general, you cannot use an C<ev_run> from multiple threads or other 3207In general, you cannot use an C<ev_loop> from multiple threads or other
3249asynchronous sources such as signal handlers (as opposed to multiple event 3208asynchronous sources such as signal handlers (as opposed to multiple event
3250loops - those are of course safe to use in different threads). 3209loops - those are of course safe to use in different threads).
3251 3210
3252Sometimes, however, you need to wake up an event loop you do not control, 3211Sometimes, however, you need to wake up an event loop you do not control,
3253for example because it belongs to another thread. This is what C<ev_async> 3212for example because it belongs to another thread. This is what C<ev_async>
3363trust me. 3322trust me.
3364 3323
3365=item ev_async_send (loop, ev_async *) 3324=item ev_async_send (loop, ev_async *)
3366 3325
3367Sends/signals/activates the given C<ev_async> watcher, that is, feeds 3326Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3368an C<EV_ASYNC> event on the watcher into the event loop. Unlike 3327an C<EV_ASYNC> event on the watcher into the event loop, and instantly
3328returns.
3329
3369C<ev_feed_event>, this call is safe to do from other threads, signal or 3330Unlike C<ev_feed_event>, this call is safe to do from other threads,
3370similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding 3331signal or similar contexts (see the discussion of C<EV_ATOMIC_T> in the
3371section below on what exactly this means). 3332embedding section below on what exactly this means).
3372 3333
3373Note that, as with other watchers in libev, multiple events might get 3334Note that, as with other watchers in libev, multiple events might get
3374compressed into a single callback invocation (another way to look at this 3335compressed into a single callback invocation (another way to look at this
3375is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>, 3336is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>,
3376reset when the event loop detects that). 3337reset when the event loop detects that).
3456 3417
3457This section explains some common idioms that are not immediately 3418This section explains some common idioms that are not immediately
3458obvious. Note that examples are sprinkled over the whole manual, and this 3419obvious. Note that examples are sprinkled over the whole manual, and this
3459section only contains stuff that wouldn't fit anywhere else. 3420section only contains stuff that wouldn't fit anywhere else.
3460 3421
3422=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
3423
3424Each watcher has, by default, a C<void *data> member that you can read
3425or modify at any time: libev will completely ignore it. This can be used
3426to associate arbitrary data with your watcher. If you need more data and
3427don't want to allocate memory separately and store a pointer to it in that
3428data member, you can also "subclass" the watcher type and provide your own
3429data:
3430
3431 struct my_io
3432 {
3433 ev_io io;
3434 int otherfd;
3435 void *somedata;
3436 struct whatever *mostinteresting;
3437 };
3438
3439 ...
3440 struct my_io w;
3441 ev_io_init (&w.io, my_cb, fd, EV_READ);
3442
3443And since your callback will be called with a pointer to the watcher, you
3444can cast it back to your own type:
3445
3446 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
3447 {
3448 struct my_io *w = (struct my_io *)w_;
3449 ...
3450 }
3451
3452More interesting and less C-conformant ways of casting your callback
3453function type instead have been omitted.
3454
3455=head2 BUILDING YOUR OWN COMPOSITE WATCHERS
3456
3457Another common scenario is to use some data structure with multiple
3458embedded watchers, in effect creating your own watcher that combines
3459multiple libev event sources into one "super-watcher":
3460
3461 struct my_biggy
3462 {
3463 int some_data;
3464 ev_timer t1;
3465 ev_timer t2;
3466 }
3467
3468In this case getting the pointer to C<my_biggy> is a bit more
3469complicated: Either you store the address of your C<my_biggy> struct in
3470the C<data> member of the watcher (for woozies or C++ coders), or you need
3471to use some pointer arithmetic using C<offsetof> inside your watchers (for
3472real programmers):
3473
3474 #include <stddef.h>
3475
3476 static void
3477 t1_cb (EV_P_ ev_timer *w, int revents)
3478 {
3479 struct my_biggy big = (struct my_biggy *)
3480 (((char *)w) - offsetof (struct my_biggy, t1));
3481 }
3482
3483 static void
3484 t2_cb (EV_P_ ev_timer *w, int revents)
3485 {
3486 struct my_biggy big = (struct my_biggy *)
3487 (((char *)w) - offsetof (struct my_biggy, t2));
3488 }
3489
3461=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS 3490=head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS
3462 3491
3463Often (especially in GUI toolkits) there are places where you have 3492Often (especially in GUI toolkits) there are places where you have
3464I<modal> interaction, which is most easily implemented by recursively 3493I<modal> interaction, which is most easily implemented by recursively
3465invoking C<ev_run>. 3494invoking C<ev_run>.
3498 exit_main_loop = exit_nested_loop = 1; 3527 exit_main_loop = exit_nested_loop = 1;
3499 3528
3500=head2 THREAD LOCKING EXAMPLE 3529=head2 THREAD LOCKING EXAMPLE
3501 3530
3502Here is a fictitious example of how to run an event loop in a different 3531Here is a fictitious example of how to run an event loop in a different
3503thread than where callbacks are being invoked and watchers are 3532thread from where callbacks are being invoked and watchers are
3504created/added/removed. 3533created/added/removed.
3505 3534
3506For a real-world example, see the C<EV::Loop::Async> perl module, 3535For a real-world example, see the C<EV::Loop::Async> perl module,
3507which uses exactly this technique (which is suited for many high-level 3536which uses exactly this technique (which is suited for many high-level
3508languages). 3537languages).
3534 // now associate this with the loop 3563 // now associate this with the loop
3535 ev_set_userdata (EV_A_ u); 3564 ev_set_userdata (EV_A_ u);
3536 ev_set_invoke_pending_cb (EV_A_ l_invoke); 3565 ev_set_invoke_pending_cb (EV_A_ l_invoke);
3537 ev_set_loop_release_cb (EV_A_ l_release, l_acquire); 3566 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3538 3567
3539 // then create the thread running ev_loop 3568 // then create the thread running ev_run
3540 pthread_create (&u->tid, 0, l_run, EV_A); 3569 pthread_create (&u->tid, 0, l_run, EV_A);
3541 } 3570 }
3542 3571
3543The callback for the C<ev_async> watcher does nothing: the watcher is used 3572The callback for the C<ev_async> watcher does nothing: the watcher is used
3544solely to wake up the event loop so it takes notice of any new watchers 3573solely to wake up the event loop so it takes notice of any new watchers
3633Note that sending the C<ev_async> watcher is required because otherwise 3662Note that sending the C<ev_async> watcher is required because otherwise
3634an event loop currently blocking in the kernel will have no knowledge 3663an event loop currently blocking in the kernel will have no knowledge
3635about the newly added timer. By waking up the loop it will pick up any new 3664about the newly added timer. By waking up the loop it will pick up any new
3636watchers in the next event loop iteration. 3665watchers in the next event loop iteration.
3637 3666
3638=back 3667=head2 THREADS, COROUTINES, CONTINUATIONS, QUEUES... INSTEAD OF CALLBACKS
3668
3669While the overhead of a callback that e.g. schedules a thread is small, it
3670is still an overhead. If you embed libev, and your main usage is with some
3671kind of threads or coroutines, you might want to customise libev so that
3672doesn't need callbacks anymore.
3673
3674Imagine you have coroutines that you can switch to using a function
3675C<switch_to (coro)>, that libev runs in a coroutine called C<libev_coro>
3676and that due to some magic, the currently active coroutine is stored in a
3677global called C<current_coro>. Then you can build your own "wait for libev
3678event" primitive by changing C<EV_CB_DECLARE> and C<EV_CB_INVOKE> (note
3679the differing C<;> conventions):
3680
3681 #define EV_CB_DECLARE(type) struct my_coro *cb;
3682 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
3683
3684That means instead of having a C callback function, you store the
3685coroutine to switch to in each watcher, and instead of having libev call
3686your callback, you instead have it switch to that coroutine.
3687
3688A coroutine might now wait for an event with a function called
3689C<wait_for_event>. (the watcher needs to be started, as always, but it doesn't
3690matter when, or whether the watcher is active or not when this function is
3691called):
3692
3693 void
3694 wait_for_event (ev_watcher *w)
3695 {
3696 ev_cb_set (w) = current_coro;
3697 switch_to (libev_coro);
3698 }
3699
3700That basically suspends the coroutine inside C<wait_for_event> and
3701continues the libev coroutine, which, when appropriate, switches back to
3702this or any other coroutine. I am sure if you sue this your own :)
3703
3704You can do similar tricks if you have, say, threads with an event queue -
3705instead of storing a coroutine, you store the queue object and instead of
3706switching to a coroutine, you push the watcher onto the queue and notify
3707any waiters.
3708
3709To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two
3710files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3711
3712 // my_ev.h
3713 #define EV_CB_DECLARE(type) struct my_coro *cb;
3714 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
3715 #include "../libev/ev.h"
3716
3717 // my_ev.c
3718 #define EV_H "my_ev.h"
3719 #include "../libev/ev.c"
3720
3721And then use F<my_ev.h> when you would normally use F<ev.h>, and compile
3722F<my_ev.c> into your project. When properly specifying include paths, you
3723can even use F<ev.h> as header file name directly.
3639 3724
3640 3725
3641=head1 LIBEVENT EMULATION 3726=head1 LIBEVENT EMULATION
3642 3727
3643Libev offers a compatibility emulation layer for libevent. It cannot 3728Libev offers a compatibility emulation layer for libevent. It cannot
4133F<event.h> that are not directly supported by the libev core alone. 4218F<event.h> that are not directly supported by the libev core alone.
4134 4219
4135In standalone mode, libev will still try to automatically deduce the 4220In standalone mode, libev will still try to automatically deduce the
4136configuration, but has to be more conservative. 4221configuration, but has to be more conservative.
4137 4222
4223=item EV_USE_FLOOR
4224
4225If defined to be C<1>, libev will use the C<floor ()> function for its
4226periodic reschedule calculations, otherwise libev will fall back on a
4227portable (slower) implementation. If you enable this, you usually have to
4228link against libm or something equivalent. Enabling this when the C<floor>
4229function is not available will fail, so the safe default is to not enable
4230this.
4231
4138=item EV_USE_MONOTONIC 4232=item EV_USE_MONOTONIC
4139 4233
4140If defined to be C<1>, libev will try to detect the availability of the 4234If defined to be C<1>, libev will try to detect the availability of the
4141monotonic clock option at both compile time and runtime. Otherwise no 4235monotonic clock option at both compile time and runtime. Otherwise no
4142use of the monotonic clock option will be attempted. If you enable this, 4236use of the monotonic clock option will be attempted. If you enable this,
4573And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4667And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
4574 4668
4575 #include "ev_cpp.h" 4669 #include "ev_cpp.h"
4576 #include "ev.c" 4670 #include "ev.c"
4577 4671
4578=head1 INTERACTION WITH OTHER PROGRAMS OR LIBRARIES 4672=head1 INTERACTION WITH OTHER PROGRAMS, LIBRARIES OR THE ENVIRONMENT
4579 4673
4580=head2 THREADS AND COROUTINES 4674=head2 THREADS AND COROUTINES
4581 4675
4582=head3 THREADS 4676=head3 THREADS
4583 4677
5153The physical time that is observed. It is apparently strictly monotonic :) 5247The physical time that is observed. It is apparently strictly monotonic :)
5154 5248
5155=item wall-clock time 5249=item wall-clock time
5156 5250
5157The time and date as shown on clocks. Unlike real time, it can actually 5251The time and date as shown on clocks. Unlike real time, it can actually
5158be wrong and jump forwards and backwards, e.g. when the you adjust your 5252be wrong and jump forwards and backwards, e.g. when you adjust your
5159clock. 5253clock.
5160 5254
5161=item watcher 5255=item watcher
5162 5256
5163A data structure that describes interest in certain events. Watchers need 5257A data structure that describes interest in certain events. Watchers need
5166=back 5260=back
5167 5261
5168=head1 AUTHOR 5262=head1 AUTHOR
5169 5263
5170Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael 5264Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael
5171Magnusson and Emanuele Giaquinta. 5265Magnusson and Emanuele Giaquinta, and minor corrections by many others.
5172 5266

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines