ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro.pm
(Generate patch)

Comparing Coro/Coro.pm (file contents):
Revision 1.148 by root, Fri Oct 5 20:11:25 2007 UTC vs.
Revision 1.199 by root, Tue Sep 23 00:02:20 2008 UTC

2 2
3Coro - coroutine process abstraction 3Coro - coroutine process abstraction
4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 use Coro; 7 use Coro;
8 8
9 async { 9 async {
10 # some asynchronous thread of execution 10 # some asynchronous thread of execution
11 print "2\n";
12 cede; # yield back to main
13 print "4\n";
11 }; 14 };
12 15 print "1\n";
13 # alternatively create an async coroutine like this: 16 cede; # yield to coroutine
14 17 print "3\n";
15 sub some_func : Coro { 18 cede; # and again
16 # some more async code 19
17 } 20 # use locking
18 21 use Coro::Semaphore;
19 cede; 22 my $lock = new Coro::Semaphore;
23 my $locked;
24
25 $lock->down;
26 $locked = 1;
27 $lock->up;
20 28
21=head1 DESCRIPTION 29=head1 DESCRIPTION
22 30
23This module collection manages coroutines. Coroutines are similar 31This module collection manages coroutines. Coroutines are similar to
24to threads but don't run in parallel at the same time even on SMP 32threads but don't (in general) run in parallel at the same time even
25machines. The specific flavor of coroutine used in this module also 33on SMP machines. The specific flavor of coroutine used in this module
26guarantees you that it will not switch between coroutines unless 34also guarantees you that it will not switch between coroutines unless
27necessary, at easily-identified points in your program, so locking and 35necessary, at easily-identified points in your program, so locking and
28parallel access are rarely an issue, making coroutine programming much 36parallel access are rarely an issue, making coroutine programming much
29safer than threads programming. 37safer and easier than threads programming.
30 38
31(Perl, however, does not natively support real threads but instead does a 39Unlike a normal perl program, however, coroutines allow you to have
32very slow and memory-intensive emulation of processes using threads. This 40multiple running interpreters that share data, which is especially useful
33is a performance win on Windows machines, and a loss everywhere else). 41to code pseudo-parallel processes and for event-based programming, such as
42multiple HTTP-GET requests running concurrently. See L<Coro::AnyEvent> to
43learn more.
44
45Coroutines are also useful because Perl has no support for threads (the so
46called "threads" that perl offers are nothing more than the (bad) process
47emulation coming from the Windows platform: On standard operating systems
48they serve no purpose whatsoever, except by making your programs slow and
49making them use a lot of memory. Best disable them when building perl, or
50aks your software vendor/distributor to do it for you).
34 51
35In this module, coroutines are defined as "callchain + lexical variables + 52In this module, coroutines are defined as "callchain + lexical variables +
36@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain, 53@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
37its own set of lexicals and its own set of perls most important global 54its own set of lexicals and its own set of perls most important global
38variables. 55variables (see L<Coro::State> for more configuration).
39 56
40=cut 57=cut
41 58
42package Coro; 59package Coro;
43 60
50 67
51our $idle; # idle handler 68our $idle; # idle handler
52our $main; # main coroutine 69our $main; # main coroutine
53our $current; # current coroutine 70our $current; # current coroutine
54 71
55our $VERSION = '4.01'; 72our $VERSION = 4.747;
56 73
57our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 74our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
58our %EXPORT_TAGS = ( 75our %EXPORT_TAGS = (
59 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 76 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
60); 77);
61our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); 78our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
62 79
63{
64 my @async;
65 my $init;
66
67 # this way of handling attributes simply is NOT scalable ;()
68 sub import {
69 no strict 'refs';
70
71 Coro->export_to_level (1, @_);
72
73 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
74 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
75 my ($package, $ref) = (shift, shift);
76 my @attrs;
77 for (@_) {
78 if ($_ eq "Coro") {
79 push @async, $ref;
80 unless ($init++) {
81 eval q{
82 sub INIT {
83 &async(pop @async) while @async;
84 }
85 };
86 }
87 } else {
88 push @attrs, $_;
89 }
90 }
91 return $old ? $old->($package, $ref, @attrs) : @attrs;
92 };
93 }
94
95}
96
97=over 4 80=over 4
98 81
99=item $main 82=item $Coro::main
100 83
101This coroutine represents the main program. 84This variable stores the coroutine object that represents the main
85program. While you cna C<ready> it and do most other things you can do to
86coroutines, it is mainly useful to compare again C<$Coro::current>, to see
87whether you are running in the main program or not.
102 88
103=cut 89=cut
104 90
105$main = new Coro; 91$main = new Coro;
106 92
107=item $current (or as function: current) 93=item $Coro::current
108 94
109The current coroutine (the last coroutine switched to). The initial value 95The coroutine object representing the current coroutine (the last
96coroutine that the Coro scheduler switched to). The initial value is
110is C<$main> (of course). 97C<$main> (of course).
111 98
112This variable is B<strictly> I<read-only>. It is provided for performance 99This variable is B<strictly> I<read-only>. You can take copies of the
113reasons. If performance is not essential you are encouraged to use the 100value stored in it and use it as any other coroutine object, but you must
114C<Coro::current> function instead. 101not otherwise modify the variable itself.
115 102
116=cut 103=cut
117 104
118$main->{desc} = "[main::]"; 105$main->{desc} = "[main::]";
119 106
121$main->{_specific} = $current->{_specific} 108$main->{_specific} = $current->{_specific}
122 if $current; 109 if $current;
123 110
124_set_current $main; 111_set_current $main;
125 112
126sub current() { $current } 113sub current() { $current } # [DEPRECATED]
127 114
128=item $idle 115=item $Coro::idle
129 116
130A callback that is called whenever the scheduler finds no ready coroutines 117This variable is mainly useful to integrate Coro into event loops. It is
131to run. The default implementation prints "FATAL: deadlock detected" and 118usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is
132exits, because the program has no other way to continue. 119pretty low-level functionality.
120
121This variable stores a callback that is called whenever the scheduler
122finds no ready coroutines to run. The default implementation prints
123"FATAL: deadlock detected" and exits, because the program has no other way
124to continue.
133 125
134This hook is overwritten by modules such as C<Coro::Timer> and 126This hook is overwritten by modules such as C<Coro::Timer> and
135C<Coro::Event> to wait on an external event that hopefully wake up a 127C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
136coroutine so the scheduler can run it. 128coroutine so the scheduler can run it.
137 129
130Note that the callback I<must not>, under any circumstances, block
131the current coroutine. Normally, this is achieved by having an "idle
132coroutine" that calls the event loop and then blocks again, and then
133readying that coroutine in the idle handler.
134
135See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this
136technique.
137
138Please note that if your callback recursively invokes perl (e.g. for event 138Please note that if your callback recursively invokes perl (e.g. for event
139handlers), then it must be prepared to be called recursively. 139handlers), then it must be prepared to be called recursively itself.
140 140
141=cut 141=cut
142 142
143$idle = sub { 143$idle = sub {
144 require Carp; 144 require Carp;
171 } 171 }
172}; 172};
173$manager->desc ("[coro manager]"); 173$manager->desc ("[coro manager]");
174$manager->prio (PRIO_MAX); 174$manager->prio (PRIO_MAX);
175 175
176# static methods. not really.
177
178=back 176=back
179 177
180=head2 STATIC METHODS 178=head2 SIMPLE COROUTINE CREATION
181
182Static methods are actually functions that operate on the current coroutine only.
183 179
184=over 4 180=over 4
185 181
186=item async { ... } [@args...] 182=item async { ... } [@args...]
187 183
188Create a new asynchronous coroutine and return it's coroutine object 184Create a new coroutine and return it's coroutine object (usually
189(usually unused). When the sub returns the new coroutine is automatically 185unused). The coroutine will be put into the ready queue, so
186it will start running automatically on the next scheduler run.
187
188The first argument is a codeblock/closure that should be executed in the
189coroutine. When it returns argument returns the coroutine is automatically
190terminated. 190terminated.
191 191
192The remaining arguments are passed as arguments to the closure.
193
192See the C<Coro::State::new> constructor for info about the coroutine 194See the C<Coro::State::new> constructor for info about the coroutine
193environment. 195environment in which coroutines are executed.
194 196
195Calling C<exit> in a coroutine will do the same as calling exit outside 197Calling C<exit> in a coroutine will do the same as calling exit outside
196the coroutine. Likewise, when the coroutine dies, the program will exit, 198the coroutine. Likewise, when the coroutine dies, the program will exit,
197just as it would in the main program. 199just as it would in the main program.
198 200
201If you do not want that, you can provide a default C<die> handler, or
202simply avoid dieing (by use of C<eval>).
203
199 # create a new coroutine that just prints its arguments 204Example: Create a new coroutine that just prints its arguments.
205
200 async { 206 async {
201 print "@_\n"; 207 print "@_\n";
202 } 1,2,3,4; 208 } 1,2,3,4;
203 209
204=cut 210=cut
210} 216}
211 217
212=item async_pool { ... } [@args...] 218=item async_pool { ... } [@args...]
213 219
214Similar to C<async>, but uses a coroutine pool, so you should not call 220Similar to C<async>, but uses a coroutine pool, so you should not call
215terminate or join (although you are allowed to), and you get a coroutine 221terminate or join on it (although you are allowed to), and you get a
216that might have executed other code already (which can be good or bad :). 222coroutine that might have executed other code already (which can be good
223or bad :).
217 224
225On the plus side, this function is faster than creating (and destroying)
226a completely new coroutine, so if you need a lot of generic coroutines in
227quick successsion, use C<async_pool>, not C<async>.
228
218Also, the block is executed in an C<eval> context and a warning will be 229The code block is executed in an C<eval> context and a warning will be
219issued in case of an exception instead of terminating the program, as 230issued in case of an exception instead of terminating the program, as
220C<async> does. As the coroutine is being reused, stuff like C<on_destroy> 231C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
221will not work in the expected way, unless you call terminate or cancel, 232will not work in the expected way, unless you call terminate or cancel,
222which somehow defeats the purpose of pooling. 233which somehow defeats the purpose of pooling (but is fine in the
234exceptional case).
223 235
224The priority will be reset to C<0> after each job, tracing will be 236The priority will be reset to C<0> after each run, tracing will be
225disabled, the description will be reset and the default output filehandle 237disabled, the description will be reset and the default output filehandle
226gets restored, so you can change alkl these. Otherwise the coroutine will 238gets restored, so you can change all these. Otherwise the coroutine will
227be re-used "as-is": most notably if you change other per-coroutine global 239be re-used "as-is": most notably if you change other per-coroutine global
228stuff such as C<$/> you need to revert that change, which is most simply 240stuff such as C<$/> you I<must needs> to revert that change, which is most
229done by using local as in C< local $/ >. 241simply done by using local as in: C< local $/ >.
230 242
231The pool size is limited to 8 idle coroutines (this can be adjusted by 243The pool size is limited to C<8> idle coroutines (this can be adjusted by
232changing $Coro::POOL_SIZE), and there can be as many non-idle coros as 244changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
233required. 245required.
234 246
235If you are concerned about pooled coroutines growing a lot because a 247If you are concerned about pooled coroutines growing a lot because a
236single C<async_pool> used a lot of stackspace you can e.g. C<async_pool 248single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
237{ terminate }> once per second or so to slowly replenish the pool. In 249{ terminate }> once per second or so to slowly replenish the pool. In
238addition to that, when the stacks used by a handler grows larger than 16kb 250addition to that, when the stacks used by a handler grows larger than 16kb
239(adjustable with $Coro::POOL_RSS) it will also exit. 251(adjustable via $Coro::POOL_RSS) it will also be destroyed.
240 252
241=cut 253=cut
242 254
243our $POOL_SIZE = 8; 255our $POOL_SIZE = 8;
244our $POOL_RSS = 16 * 1024; 256our $POOL_RSS = 16 * 1024;
255 _pool_2 $cb; 267 _pool_2 $cb;
256 &schedule; 268 &schedule;
257 } 269 }
258 }; 270 };
259 271
272 if ($@) {
260 last if $@ eq "\3terminate\2\n"; 273 last if $@ eq "\3async_pool terminate\2\n";
261 warn $@ if $@; 274 warn $@;
275 }
262 } 276 }
263} 277}
264 278
265sub async_pool(&@) { 279sub async_pool(&@) {
266 # this is also inlined into the unlock_scheduler 280 # this is also inlined into the unlock_scheduler
270 $coro->ready; 284 $coro->ready;
271 285
272 $coro 286 $coro
273} 287}
274 288
289=back
290
291=head2 STATIC METHODS
292
293Static methods are actually functions that operate on the current coroutine.
294
295=over 4
296
275=item schedule 297=item schedule
276 298
277Calls the scheduler. Please note that the current coroutine will not be put 299Calls the scheduler. The scheduler will find the next coroutine that is
300to be run from the ready queue and switches to it. The next coroutine
301to be run is simply the one with the highest priority that is longest
302in its ready queue. If there is no coroutine ready, it will clal the
303C<$Coro::idle> hook.
304
305Please note that the current coroutine will I<not> be put into the ready
278into the ready queue, so calling this function usually means you will 306queue, so calling this function usually means you will never be called
279never be called again unless something else (e.g. an event handler) calls 307again unless something else (e.g. an event handler) calls C<< ->ready >>,
280ready. 308thus waking you up.
309
310This makes C<schedule> I<the> generic method to use to block the current
311coroutine and wait for events: first you remember the current coroutine in
312a variable, then arrange for some callback of yours to call C<< ->ready
313>> on that once some event happens, and last you call C<schedule> to put
314yourself to sleep. Note that a lot of things can wake your coroutine up,
315so you need to check whether the event indeed happened, e.g. by storing the
316status in a variable.
281 317
282The canonical way to wait on external events is this: 318The canonical way to wait on external events is this:
283 319
284 { 320 {
285 # remember current coroutine 321 # remember current coroutine
298 Coro::schedule while $current; 334 Coro::schedule while $current;
299 } 335 }
300 336
301=item cede 337=item cede
302 338
303"Cede" to other coroutines. This function puts the current coroutine into the 339"Cede" to other coroutines. This function puts the current coroutine into
304ready queue and calls C<schedule>, which has the effect of giving up the 340the ready queue and calls C<schedule>, which has the effect of giving
305current "timeslice" to other coroutines of the same or higher priority. 341up the current "timeslice" to other coroutines of the same or higher
342priority. Once your coroutine gets its turn again it will automatically be
343resumed.
306 344
307Returns true if at least one coroutine switch has happened. 345This function is often called C<yield> in other languages.
308 346
309=item Coro::cede_notself 347=item Coro::cede_notself
310 348
311Works like cede, but is not exported by default and will cede to any 349Works like cede, but is not exported by default and will cede to I<any>
312coroutine, regardless of priority, once. 350coroutine, regardless of priority. This is useful sometimes to ensure
313 351progress is made.
314Returns true if at least one coroutine switch has happened.
315 352
316=item terminate [arg...] 353=item terminate [arg...]
317 354
318Terminates the current coroutine with the given status values (see L<cancel>). 355Terminates the current coroutine with the given status values (see L<cancel>).
319 356
320=item killall 357=item killall
321 358
322Kills/terminates/cancels all coroutines except the currently running 359Kills/terminates/cancels all coroutines except the currently running
323one. This is useful after a fork, either in the child or the parent, as 360one. This is useful after a fork, either in the child or the parent, as
324usually only one of them should inherit the running coroutines. 361usually only one of them should inherit the running coroutines.
362
363Note that while this will try to free some of the main programs resources,
364you cannot free all of them, so if a coroutine that is not the main
365program calls this function, there will be some one-time resource leak.
325 366
326=cut 367=cut
327 368
328sub terminate { 369sub terminate {
329 $current->cancel (@_); 370 $current->cancel (@_);
336 } 377 }
337} 378}
338 379
339=back 380=back
340 381
341# dynamic methods
342
343=head2 COROUTINE METHODS 382=head2 COROUTINE METHODS
344 383
345These are the methods you can call on coroutine objects. 384These are the methods you can call on coroutine objects (or to create
385them).
346 386
347=over 4 387=over 4
348 388
349=item new Coro \&sub [, @args...] 389=item new Coro \&sub [, @args...]
350 390
351Create a new coroutine and return it. When the sub returns the coroutine 391Create a new coroutine and return it. When the sub returns, the coroutine
352automatically terminates as if C<terminate> with the returned values were 392automatically terminates as if C<terminate> with the returned values were
353called. To make the coroutine run you must first put it into the ready queue 393called. To make the coroutine run you must first put it into the ready
354by calling the ready method. 394queue by calling the ready method.
355 395
356See C<async> and C<Coro::State::new> for additional info about the 396See C<async> and C<Coro::State::new> for additional info about the
357coroutine environment. 397coroutine environment.
358 398
359=cut 399=cut
368 $class->SUPER::new (\&_run_coro, @_) 408 $class->SUPER::new (\&_run_coro, @_)
369} 409}
370 410
371=item $success = $coroutine->ready 411=item $success = $coroutine->ready
372 412
373Put the given coroutine into the ready queue (according to it's priority) 413Put the given coroutine into the end of its ready queue (there is one
374and return true. If the coroutine is already in the ready queue, do nothing 414queue for each priority) and return true. If the coroutine is already in
375and return false. 415the ready queue, do nothing and return false.
416
417This ensures that the scheduler will resume this coroutine automatically
418once all the coroutines of higher priority and all coroutines of the same
419priority that were put into the ready queue earlier have been resumed.
376 420
377=item $is_ready = $coroutine->is_ready 421=item $is_ready = $coroutine->is_ready
378 422
379Return wether the coroutine is currently the ready queue or not, 423Return whether the coroutine is currently the ready queue or not,
380 424
381=item $coroutine->cancel (arg...) 425=item $coroutine->cancel (arg...)
382 426
383Terminates the given coroutine and makes it return the given arguments as 427Terminates the given coroutine and makes it return the given arguments as
384status (default: the empty list). Never returns if the coroutine is the 428status (default: the empty list). Never returns if the coroutine is the
401 445
402=item $coroutine->join 446=item $coroutine->join
403 447
404Wait until the coroutine terminates and return any values given to the 448Wait until the coroutine terminates and return any values given to the
405C<terminate> or C<cancel> functions. C<join> can be called concurrently 449C<terminate> or C<cancel> functions. C<join> can be called concurrently
406from multiple coroutines. 450from multiple coroutines, and all will be resumed and given the status
451return once the C<$coroutine> terminates.
407 452
408=cut 453=cut
409 454
410sub join { 455sub join {
411 my $self = shift; 456 my $self = shift;
426 471
427=item $coroutine->on_destroy (\&cb) 472=item $coroutine->on_destroy (\&cb)
428 473
429Registers a callback that is called when this coroutine gets destroyed, 474Registers a callback that is called when this coroutine gets destroyed,
430but before it is joined. The callback gets passed the terminate arguments, 475but before it is joined. The callback gets passed the terminate arguments,
431if any. 476if any, and I<must not> die, under any circumstances.
432 477
433=cut 478=cut
434 479
435sub on_destroy { 480sub on_destroy {
436 my ($self, $cb) = @_; 481 my ($self, $cb) = @_;
471coroutine. This is just a free-form string you can associate with a coroutine. 516coroutine. This is just a free-form string you can associate with a coroutine.
472 517
473This method simply sets the C<< $coroutine->{desc} >> member to the given string. You 518This method simply sets the C<< $coroutine->{desc} >> member to the given string. You
474can modify this member directly if you wish. 519can modify this member directly if you wish.
475 520
521=item $coroutine->throw ([$scalar])
522
523If C<$throw> is specified and defined, it will be thrown as an exception
524inside the coroutine at the next convinient point in time (usually after
525it gains control at the next schedule/transfer/cede). Otherwise clears the
526exception object.
527
528The exception object will be thrown "as is" with the specified scalar in
529C<$@>, i.e. if it is a string, no line number or newline will be appended
530(unlike with C<die>).
531
532This can be used as a softer means than C<cancel> to ask a coroutine to
533end itself, although there is no guarentee that the exception will lead to
534termination, and if the exception isn't caught it might well end the whole
535program.
536
476=cut 537=cut
477 538
478sub desc { 539sub desc {
479 my $old = $_[0]{desc}; 540 my $old = $_[0]{desc};
480 $_[0]{desc} = $_[1] if @_ > 1; 541 $_[0]{desc} = $_[1] if @_ > 1;
488=over 4 549=over 4
489 550
490=item Coro::nready 551=item Coro::nready
491 552
492Returns the number of coroutines that are currently in the ready state, 553Returns the number of coroutines that are currently in the ready state,
493i.e. that can be switched to. The value C<0> means that the only runnable 554i.e. that can be switched to by calling C<schedule> directory or
555indirectly. The value C<0> means that the only runnable coroutine is the
494coroutine is the currently running one, so C<cede> would have no effect, 556currently running one, so C<cede> would have no effect, and C<schedule>
495and C<schedule> would cause a deadlock unless there is an idle handler 557would cause a deadlock unless there is an idle handler that wakes up some
496that wakes up some coroutines. 558coroutines.
497 559
498=item my $guard = Coro::guard { ... } 560=item my $guard = Coro::guard { ... }
499 561
500This creates and returns a guard object. Nothing happens until the object 562This creates and returns a guard object. Nothing happens until the object
501gets destroyed, in which case the codeblock given as argument will be 563gets destroyed, in which case the codeblock given as argument will be
530 592
531 593
532=item unblock_sub { ... } 594=item unblock_sub { ... }
533 595
534This utility function takes a BLOCK or code reference and "unblocks" it, 596This utility function takes a BLOCK or code reference and "unblocks" it,
535returning the new coderef. This means that the new coderef will return 597returning a new coderef. Unblocking means that calling the new coderef
536immediately without blocking, returning nothing, while the original code 598will return immediately without blocking, returning nothing, while the
537ref will be called (with parameters) from within its own coroutine. 599original code ref will be called (with parameters) from within another
600coroutine.
538 601
539The reason this function exists is that many event libraries (such as the 602The reason this function exists is that many event libraries (such as the
540venerable L<Event|Event> module) are not coroutine-safe (a weaker form 603venerable L<Event|Event> module) are not coroutine-safe (a weaker form
541of thread-safety). This means you must not block within event callbacks, 604of thread-safety). This means you must not block within event callbacks,
542otherwise you might suffer from crashes or worse. 605otherwise you might suffer from crashes or worse. The only event library
606currently known that is safe to use without C<unblock_sub> is L<EV>.
543 607
544This function allows your callbacks to block by executing them in another 608This function allows your callbacks to block by executing them in another
545coroutine where it is safe to block. One example where blocking is handy 609coroutine where it is safe to block. One example where blocking is handy
546is when you use the L<Coro::AIO|Coro::AIO> functions to save results to 610is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
547disk. 611disk, for example.
548 612
549In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when 613In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
550creating event callbacks that want to block. 614creating event callbacks that want to block.
615
616If your handler does not plan to block (e.g. simply sends a message to
617another coroutine, or puts some other coroutine into the ready queue),
618there is no reason to use C<unblock_sub>.
619
620Note that you also need to use C<unblock_sub> for any other callbacks that
621are indirectly executed by any C-based event loop. For example, when you
622use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
623provides callbacks that are the result of some event callback, then you
624must not block either, or use C<unblock_sub>.
551 625
552=cut 626=cut
553 627
554our @unblock_queue; 628our @unblock_queue;
555 629
587 661
5881; 6621;
589 663
590=head1 BUGS/LIMITATIONS 664=head1 BUGS/LIMITATIONS
591 665
592 - you must make very sure that no coro is still active on global
593 destruction. very bad things might happen otherwise (usually segfaults).
594
595 - this module is not thread-safe. You should only ever use this module 666This module is not perl-pseudo-thread-safe. You should only ever use this
596 from the same thread (this requirement might be loosened in the future 667module from the same thread (this requirement might be removed in the
597 to allow per-thread schedulers, but Coro::State does not yet allow 668future to allow per-thread schedulers, but Coro::State does not yet allow
598 this). 669this). I recommend disabling thread support and using processes, as this
670is much faster and uses less memory.
599 671
600=head1 SEE ALSO 672=head1 SEE ALSO
601 673
674Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
675
676Debugging: L<Coro::Debug>.
677
602Support/Utility: L<Coro::Specific>, L<Coro::State>, L<Coro::Util>. 678Support/Utility: L<Coro::Specific>, L<Coro::Util>.
603 679
604Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>. 680Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
605 681
606Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>. 682IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
607 683
608Embedding: L<Coro:MakeMaker> 684Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>.
685
686XS API: L<Coro::MakeMaker>.
687
688Low level Configuration, Coroutine Environment: L<Coro::State>.
609 689
610=head1 AUTHOR 690=head1 AUTHOR
611 691
612 Marc Lehmann <schmorp@schmorp.de> 692 Marc Lehmann <schmorp@schmorp.de>
613 http://home.schmorp.de/ 693 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines