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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines