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.223 by root, Tue Nov 18 10:44:07 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
44use strict; 61use strict qw(vars subs);
45no warnings "uninitialized"; 62no warnings "uninitialized";
46 63
47use Coro::State; 64use Coro::State;
48 65
49use base qw(Coro::State Exporter); 66use base qw(Coro::State Exporter);
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 = 5.0;
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 is now being initialised by Coro::State
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<$Coro::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::]";
119
120# maybe some other module used Coro::Specific before...
121$main->{_specific} = $current->{_specific}
122 if $current;
123
124_set_current $main;
125
126sub current() { $current } 105sub current() { $current } # [DEPRECATED]
127 106
128=item $idle 107=item $Coro::idle
129 108
130A callback that is called whenever the scheduler finds no ready coroutines 109This variable is mainly useful to integrate Coro into event loops. It is
131to run. The default implementation prints "FATAL: deadlock detected" and 110usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is
132exits, because the program has no other way to continue. 111pretty low-level functionality.
112
113This variable stores a callback that is called whenever the scheduler
114finds no ready coroutines to run. The default implementation prints
115"FATAL: deadlock detected" and exits, because the program has no other way
116to continue.
133 117
134This hook is overwritten by modules such as C<Coro::Timer> and 118This 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 119C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
136coroutine so the scheduler can run it. 120coroutine so the scheduler can run it.
137 121
122Note that the callback I<must not>, under any circumstances, block
123the current coroutine. Normally, this is achieved by having an "idle
124coroutine" that calls the event loop and then blocks again, and then
125readying that coroutine in the idle handler.
126
127See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this
128technique.
129
138Please note that if your callback recursively invokes perl (e.g. for event 130Please note that if your callback recursively invokes perl (e.g. for event
139handlers), then it must be prepared to be called recursively. 131handlers), then it must be prepared to be called recursively itself.
140 132
141=cut 133=cut
142 134
143$idle = sub { 135$idle = sub {
144 require Carp; 136 require Carp;
152 $self->_destroy 144 $self->_destroy
153 or return; 145 or return;
154 146
155 # call all destruction callbacks 147 # call all destruction callbacks
156 $_->(@{$self->{_status}}) 148 $_->(@{$self->{_status}})
157 for @{(delete $self->{_on_destroy}) || []}; 149 for @{ delete $self->{_on_destroy} || [] };
158} 150}
159 151
160# this coroutine is necessary because a coroutine 152# this coroutine is necessary because a coroutine
161# cannot destroy itself. 153# cannot destroy itself.
162my @destroy; 154my @destroy;
168 while @destroy; 160 while @destroy;
169 161
170 &schedule; 162 &schedule;
171 } 163 }
172}; 164};
173$manager->desc ("[coro manager]"); 165$manager->{desc} = "[coro manager]";
174$manager->prio (PRIO_MAX); 166$manager->prio (PRIO_MAX);
175 167
176# static methods. not really.
177
178=back 168=back
179 169
180=head2 STATIC METHODS 170=head2 SIMPLE COROUTINE CREATION
181
182Static methods are actually functions that operate on the current coroutine only.
183 171
184=over 4 172=over 4
185 173
186=item async { ... } [@args...] 174=item async { ... } [@args...]
187 175
188Create a new asynchronous coroutine and return it's coroutine object 176Create a new coroutine and return it's coroutine object (usually
189(usually unused). When the sub returns the new coroutine is automatically 177unused). The coroutine will be put into the ready queue, so
178it will start running automatically on the next scheduler run.
179
180The first argument is a codeblock/closure that should be executed in the
181coroutine. When it returns argument returns the coroutine is automatically
190terminated. 182terminated.
191 183
184The remaining arguments are passed as arguments to the closure.
185
192See the C<Coro::State::new> constructor for info about the coroutine 186See the C<Coro::State::new> constructor for info about the coroutine
193environment. 187environment in which coroutines are executed.
194 188
195Calling C<exit> in a coroutine will do the same as calling exit outside 189Calling C<exit> in a coroutine will do the same as calling exit outside
196the coroutine. Likewise, when the coroutine dies, the program will exit, 190the coroutine. Likewise, when the coroutine dies, the program will exit,
197just as it would in the main program. 191just as it would in the main program.
198 192
193If you do not want that, you can provide a default C<die> handler, or
194simply avoid dieing (by use of C<eval>).
195
199 # create a new coroutine that just prints its arguments 196Example: Create a new coroutine that just prints its arguments.
197
200 async { 198 async {
201 print "@_\n"; 199 print "@_\n";
202 } 1,2,3,4; 200 } 1,2,3,4;
203 201
204=cut 202=cut
210} 208}
211 209
212=item async_pool { ... } [@args...] 210=item async_pool { ... } [@args...]
213 211
214Similar to C<async>, but uses a coroutine pool, so you should not call 212Similar 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 213terminate 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 :). 214coroutine that might have executed other code already (which can be good
215or bad :).
217 216
217On the plus side, this function is faster than creating (and destroying)
218a completly new coroutine, so if you need a lot of generic coroutines in
219quick successsion, use C<async_pool>, not C<async>.
220
218Also, the block is executed in an C<eval> context and a warning will be 221The 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 222issued 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> 223C<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, 224will not work in the expected way, unless you call terminate or cancel,
222which somehow defeats the purpose of pooling. 225which somehow defeats the purpose of pooling (but is fine in the
226exceptional case).
223 227
224The priority will be reset to C<0> after each job, tracing will be 228The priority will be reset to C<0> after each run, tracing will be
225disabled, the description will be reset and the default output filehandle 229disabled, the description will be reset and the default output filehandle
226gets restored, so you can change alkl these. Otherwise the coroutine will 230gets 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 231be 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 232stuff such as C<$/> you I<must needs> revert that change, which is most
229done by using local as in C< local $/ >. 233simply done by using local as in: C<< local $/ >>.
230 234
231The pool size is limited to 8 idle coroutines (this can be adjusted by 235The idle pool size is limited to C<8> idle coroutines (this can be
232changing $Coro::POOL_SIZE), and there can be as many non-idle coros as 236adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
233required. 237coros as required.
234 238
235If you are concerned about pooled coroutines growing a lot because a 239If 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 240single 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 241{ 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 242addition to that, when the stacks used by a handler grows larger than 16kb
239(adjustable with $Coro::POOL_RSS) it will also exit. 243(adjustable via $Coro::POOL_RSS) it will also be destroyed.
240 244
241=cut 245=cut
242 246
243our $POOL_SIZE = 8; 247our $POOL_SIZE = 8;
244our $POOL_RSS = 16 * 1024; 248our $POOL_RSS = 16 * 1024;
255 _pool_2 $cb; 259 _pool_2 $cb;
256 &schedule; 260 &schedule;
257 } 261 }
258 }; 262 };
259 263
264 if ($@) {
260 last if $@ eq "\3terminate\2\n"; 265 last if $@ eq "\3async_pool terminate\2\n";
261 warn $@ if $@; 266 warn $@;
267 }
262 } 268 }
263} 269}
264 270
265sub async_pool(&@) { 271sub async_pool(&@) {
266 # this is also inlined into the unlock_scheduler 272 # this is also inlined into the unblock_scheduler
267 my $coro = (pop @async_pool) || new Coro \&pool_handler; 273 my $coro = (pop @async_pool) || new Coro \&pool_handler;
268 274
269 $coro->{_invoke} = [@_]; 275 $coro->{_invoke} = [@_];
270 $coro->ready; 276 $coro->ready;
271 277
272 $coro 278 $coro
273} 279}
274 280
281=back
282
283=head2 STATIC METHODS
284
285Static methods are actually functions that operate on the current coroutine.
286
287=over 4
288
275=item schedule 289=item schedule
276 290
277Calls the scheduler. Please note that the current coroutine will not be put 291Calls the scheduler. The scheduler will find the next coroutine that is
292to be run from the ready queue and switches to it. The next coroutine
293to be run is simply the one with the highest priority that is longest
294in its ready queue. If there is no coroutine ready, it will clal the
295C<$Coro::idle> hook.
296
297Please 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 298queue, so calling this function usually means you will never be called
279never be called again unless something else (e.g. an event handler) calls 299again unless something else (e.g. an event handler) calls C<< ->ready >>,
280ready. 300thus waking you up.
301
302This makes C<schedule> I<the> generic method to use to block the current
303coroutine and wait for events: first you remember the current coroutine in
304a variable, then arrange for some callback of yours to call C<< ->ready
305>> on that once some event happens, and last you call C<schedule> to put
306yourself to sleep. Note that a lot of things can wake your coroutine up,
307so you need to check whether the event indeed happened, e.g. by storing the
308status in a variable.
281 309
282The canonical way to wait on external events is this: 310The canonical way to wait on external events is this:
283 311
284 { 312 {
285 # remember current coroutine 313 # remember current coroutine
298 Coro::schedule while $current; 326 Coro::schedule while $current;
299 } 327 }
300 328
301=item cede 329=item cede
302 330
303"Cede" to other coroutines. This function puts the current coroutine into the 331"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 332the ready queue and calls C<schedule>, which has the effect of giving
305current "timeslice" to other coroutines of the same or higher priority. 333up the current "timeslice" to other coroutines of the same or higher
334priority. Once your coroutine gets its turn again it will automatically be
335resumed.
306 336
307Returns true if at least one coroutine switch has happened. 337This function is often called C<yield> in other languages.
308 338
309=item Coro::cede_notself 339=item Coro::cede_notself
310 340
311Works like cede, but is not exported by default and will cede to any 341Works like cede, but is not exported by default and will cede to I<any>
312coroutine, regardless of priority, once. 342coroutine, regardless of priority. This is useful sometimes to ensure
313 343progress is made.
314Returns true if at least one coroutine switch has happened.
315 344
316=item terminate [arg...] 345=item terminate [arg...]
317 346
318Terminates the current coroutine with the given status values (see L<cancel>). 347Terminates the current coroutine with the given status values (see L<cancel>).
319 348
320=item killall 349=item killall
321 350
322Kills/terminates/cancels all coroutines except the currently running 351Kills/terminates/cancels all coroutines except the currently running
323one. This is useful after a fork, either in the child or the parent, as 352one. This is useful after a fork, either in the child or the parent, as
324usually only one of them should inherit the running coroutines. 353usually only one of them should inherit the running coroutines.
354
355Note that while this will try to free some of the main programs resources,
356you cannot free all of them, so if a coroutine that is not the main
357program calls this function, there will be some one-time resource leak.
325 358
326=cut 359=cut
327 360
328sub terminate { 361sub terminate {
329 $current->cancel (@_); 362 $current->cancel (@_);
336 } 369 }
337} 370}
338 371
339=back 372=back
340 373
341# dynamic methods
342
343=head2 COROUTINE METHODS 374=head2 COROUTINE METHODS
344 375
345These are the methods you can call on coroutine objects. 376These are the methods you can call on coroutine objects (or to create
377them).
346 378
347=over 4 379=over 4
348 380
349=item new Coro \&sub [, @args...] 381=item new Coro \&sub [, @args...]
350 382
351Create a new coroutine and return it. When the sub returns the coroutine 383Create a new coroutine and return it. When the sub returns, the coroutine
352automatically terminates as if C<terminate> with the returned values were 384automatically 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 385called. To make the coroutine run you must first put it into the ready
354by calling the ready method. 386queue by calling the ready method.
355 387
356See C<async> and C<Coro::State::new> for additional info about the 388See C<async> and C<Coro::State::new> for additional info about the
357coroutine environment. 389coroutine environment.
358 390
359=cut 391=cut
368 $class->SUPER::new (\&_run_coro, @_) 400 $class->SUPER::new (\&_run_coro, @_)
369} 401}
370 402
371=item $success = $coroutine->ready 403=item $success = $coroutine->ready
372 404
373Put the given coroutine into the ready queue (according to it's priority) 405Put 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 406queue for each priority) and return true. If the coroutine is already in
375and return false. 407the ready queue, do nothing and return false.
408
409This ensures that the scheduler will resume this coroutine automatically
410once all the coroutines of higher priority and all coroutines of the same
411priority that were put into the ready queue earlier have been resumed.
376 412
377=item $is_ready = $coroutine->is_ready 413=item $is_ready = $coroutine->is_ready
378 414
379Return wether the coroutine is currently the ready queue or not, 415Return whether the coroutine is currently the ready queue or not,
380 416
381=item $coroutine->cancel (arg...) 417=item $coroutine->cancel (arg...)
382 418
383Terminates the given coroutine and makes it return the given arguments as 419Terminates the given coroutine and makes it return the given arguments as
384status (default: the empty list). Never returns if the coroutine is the 420status (default: the empty list). Never returns if the coroutine is the
397 } else { 433 } else {
398 $self->_cancel; 434 $self->_cancel;
399 } 435 }
400} 436}
401 437
438=item $coroutine->throw ([$scalar])
439
440If C<$throw> is specified and defined, it will be thrown as an exception
441inside the coroutine at the next convenient point in time. Otherwise
442clears the exception object.
443
444Coro will check for the exception each time a schedule-like-function
445returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
446>>, C<< Coro::Handle->readable >> and so on. Most of these functions
447detect this case and return early in case an exception is pending.
448
449The exception object will be thrown "as is" with the specified scalar in
450C<$@>, i.e. if it is a string, no line number or newline will be appended
451(unlike with C<die>).
452
453This can be used as a softer means than C<cancel> to ask a coroutine to
454end itself, although there is no guarantee that the exception will lead to
455termination, and if the exception isn't caught it might well end the whole
456program.
457
458You might also think of C<throw> as being the moral equivalent of
459C<kill>ing a coroutine with a signal (in this case, a scalar).
460
402=item $coroutine->join 461=item $coroutine->join
403 462
404Wait until the coroutine terminates and return any values given to the 463Wait until the coroutine terminates and return any values given to the
405C<terminate> or C<cancel> functions. C<join> can be called concurrently 464C<terminate> or C<cancel> functions. C<join> can be called concurrently
406from multiple coroutines. 465from multiple coroutines, and all will be resumed and given the status
466return once the C<$coroutine> terminates.
407 467
408=cut 468=cut
409 469
410sub join { 470sub join {
411 my $self = shift; 471 my $self = shift;
426 486
427=item $coroutine->on_destroy (\&cb) 487=item $coroutine->on_destroy (\&cb)
428 488
429Registers a callback that is called when this coroutine gets destroyed, 489Registers a callback that is called when this coroutine gets destroyed,
430but before it is joined. The callback gets passed the terminate arguments, 490but before it is joined. The callback gets passed the terminate arguments,
431if any. 491if any, and I<must not> die, under any circumstances.
432 492
433=cut 493=cut
434 494
435sub on_destroy { 495sub on_destroy {
436 my ($self, $cb) = @_; 496 my ($self, $cb) = @_;
466higher values mean lower priority, just as in unix). 526higher values mean lower priority, just as in unix).
467 527
468=item $olddesc = $coroutine->desc ($newdesc) 528=item $olddesc = $coroutine->desc ($newdesc)
469 529
470Sets (or gets in case the argument is missing) the description for this 530Sets (or gets in case the argument is missing) the description for this
471coroutine. This is just a free-form string you can associate with a coroutine. 531coroutine. This is just a free-form string you can associate with a
532coroutine.
472 533
473This method simply sets the C<< $coroutine->{desc} >> member to the given string. You 534This method simply sets the C<< $coroutine->{desc} >> member to the given
474can modify this member directly if you wish. 535string. You can modify this member directly if you wish.
475 536
476=cut 537=cut
477 538
478sub desc { 539sub desc {
479 my $old = $_[0]{desc}; 540 my $old = $_[0]{desc};
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
568 cede; # for short-lived callbacks, this reduces pressure on the coro pool 642 cede; # for short-lived callbacks, this reduces pressure on the coro pool
569 } 643 }
570 schedule; # sleep well 644 schedule; # sleep well
571 } 645 }
572}; 646};
573$unblock_scheduler->desc ("[unblock_sub scheduler]"); 647$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
574 648
575sub unblock_sub(&) { 649sub unblock_sub(&) {
576 my $cb = shift; 650 my $cb = shift;
577 651
578 sub { 652 sub {
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 666=over 4
593 destruction. very bad things might happen otherwise (usually segfaults).
594 667
668=item fork with pthread backend
669
670When Coro is compiled using the pthread backend (which isn't recommended
671but required on many BSDs as their libcs are completely broken), then
672coroutines will not survive a fork. There is no known workaround except to
673fix your libc and use a saner backend.
674
675=item perl process emulation ("threads")
676
595 - this module is not thread-safe. You should only ever use this module 677This 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 678module from the same thread (this requirement might be removed in the
597 to allow per-thread schedulers, but Coro::State does not yet allow 679future to allow per-thread schedulers, but Coro::State does not yet allow
598 this). 680this). I recommend disabling thread support and using processes, as having
681the windows process emulation enabled under unix roughly halves perl
682performance, even when not used.
683
684=item coroutine switching not signal safe
685
686You must not switch to another coroutine from within a signal handler
687(only relevant with %SIG - most event libraries provide safe signals).
688
689That means you I<MUST NOT> call any function that might "block" the
690current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
691anything that calls those. Everything else, including calling C<ready>,
692works.
693
694=back
695
599 696
600=head1 SEE ALSO 697=head1 SEE ALSO
601 698
699Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
700
701Debugging: L<Coro::Debug>.
702
602Support/Utility: L<Coro::Specific>, L<Coro::State>, L<Coro::Util>. 703Support/Utility: L<Coro::Specific>, L<Coro::Util>.
603 704
604Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>. 705Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
605 706
606Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>. 707IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
607 708
608Embedding: L<Coro:MakeMaker> 709Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>.
710
711XS API: L<Coro::MakeMaker>.
712
713Low level Configuration, Coroutine Environment: L<Coro::State>.
609 714
610=head1 AUTHOR 715=head1 AUTHOR
611 716
612 Marc Lehmann <schmorp@schmorp.de> 717 Marc Lehmann <schmorp@schmorp.de>
613 http://home.schmorp.de/ 718 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines