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

Comparing Coro/Coro.pm (file contents):
Revision 1.108 by root, Fri Jan 5 20:00:49 2007 UTC vs.
Revision 1.202 by root, Tue Sep 30 17:12:34 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 use din this module also 33on SMP machines. The specific flavor of coroutine used in this module
26guarentees 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 = '3.3'; 72our $VERSION = 4.8;
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 essentiel 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
104
105$main->{desc} = "[main::]";
117 106
118# maybe some other module used Coro::Specific before... 107# maybe some other module used Coro::Specific before...
119$main->{specific} = $current->{specific} 108$main->{_specific} = $current->{_specific}
120 if $current; 109 if $current;
121 110
122_set_current $main; 111_set_current $main;
123 112
124sub current() { $current } 113sub current() { $current } # [DEPRECATED]
125 114
126=item $idle 115=item $Coro::idle
127 116
128A callback that is called whenever the scheduler finds no ready coroutines 117This variable is mainly useful to integrate Coro into event loops. It is
129to run. The default implementation prints "FATAL: deadlock detected" and 118usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is
130exits, 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.
131 125
132This hook is overwritten by modules such as C<Coro::Timer> and 126This 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 127C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
134coroutine so the scheduler can run it. 128coroutine so the scheduler can run it.
135 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
136Please 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
137handlers), then it must be prepared to be called recursively. 139handlers), then it must be prepared to be called recursively itself.
138 140
139=cut 141=cut
140 142
141$idle = sub { 143$idle = sub {
142 require Carp; 144 require Carp;
149 # free coroutine data and mark as destructed 151 # free coroutine data and mark as destructed
150 $self->_destroy 152 $self->_destroy
151 or return; 153 or return;
152 154
153 # call all destruction callbacks 155 # call all destruction callbacks
154 $_->(@{$self->{status}}) 156 $_->(@{$self->{_status}})
155 for @{(delete $self->{destroy_cb}) || []}; 157 for @{(delete $self->{_on_destroy}) || []};
156} 158}
157 159
158# this coroutine is necessary because a coroutine 160# this coroutine is necessary because a coroutine
159# cannot destroy itself. 161# cannot destroy itself.
160my @destroy; 162my @destroy;
166 while @destroy; 168 while @destroy;
167 169
168 &schedule; 170 &schedule;
169 } 171 }
170}; 172};
171 173$manager->desc ("[coro manager]");
172$manager->prio (PRIO_MAX); 174$manager->prio (PRIO_MAX);
173 175
174# static methods. not really.
175
176=back 176=back
177 177
178=head2 STATIC METHODS 178=head2 SIMPLE COROUTINE CREATION
179
180Static methods are actually functions that operate on the current coroutine only.
181 179
182=over 4 180=over 4
183 181
184=item async { ... } [@args...] 182=item async { ... } [@args...]
185 183
186Create a new asynchronous coroutine and return it's coroutine object 184Create a new coroutine and return it's coroutine object (usually
187(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
188terminated. 190terminated.
189 191
190Calling C<exit> in a coroutine will not work correctly, so do not do that. 192The remaining arguments are passed as arguments to the closure.
191 193
192When the coroutine dies, the program will exit, just as in the main 194See the C<Coro::State::new> constructor for info about the coroutine
193program. 195environment in which coroutines are executed.
194 196
197Calling C<exit> in a coroutine will do the same as calling exit outside
198the coroutine. Likewise, when the coroutine dies, the program will exit,
199just as it would in the main program.
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
195 # create a new coroutine that just prints its arguments 204Example: Create a new coroutine that just prints its arguments.
205
196 async { 206 async {
197 print "@_\n"; 207 print "@_\n";
198 } 1,2,3,4; 208 } 1,2,3,4;
199 209
200=cut 210=cut
206} 216}
207 217
208=item async_pool { ... } [@args...] 218=item async_pool { ... } [@args...]
209 219
210Similar 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
211terminate 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
212that 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 :).
213 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
214Also, 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
215issued in case of an exception instead of terminating the program, as 230issued in case of an exception instead of terminating the program, as
216C<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>
217will 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,
218which somehow defeats the purpose of pooling. 233which somehow defeats the purpose of pooling (but is fine in the
234exceptional case).
219 235
220The priority will be reset to C<0> after each job, otherwise the coroutine 236The priority will be reset to C<0> after each run, tracing will be
221will be re-used "as-is". 237disabled, the description will be reset and the default output filehandle
238gets restored, so you can change all these. Otherwise the coroutine will
239be re-used "as-is": most notably if you change other per-coroutine global
240stuff such as C<$/> you I<must needs> to revert that change, which is most
241simply done by using local as in: C< local $/ >.
222 242
223The 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
224changing $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
225required. 245required.
226 246
227If you are concerned about pooled coroutines growing a lot because a 247If you are concerned about pooled coroutines growing a lot because a
228single 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
229terminate }> once per second or so to slowly replenish the pool. 249{ terminate }> once per second or so to slowly replenish the pool. In
250addition to that, when the stacks used by a handler grows larger than 16kb
251(adjustable via $Coro::POOL_RSS) it will also be destroyed.
230 252
231=cut 253=cut
232 254
233our $POOL_SIZE = 8; 255our $POOL_SIZE = 8;
256our $POOL_RSS = 16 * 1024;
234our @pool; 257our @async_pool;
235 258
236sub pool_handler { 259sub pool_handler {
260 my $cb;
261
237 while () { 262 while () {
238 my ($cb, @arg) = @{ delete $current->{_invoke} };
239
240 eval { 263 eval {
241 $cb->(@arg); 264 while () {
265 _pool_1 $cb;
266 &$cb;
267 _pool_2 $cb;
268 &schedule;
269 }
242 }; 270 };
271
272 if ($@) {
273 last if $@ eq "\3async_pool terminate\2\n";
243 warn $@ if $@; 274 warn $@;
244 275 }
245 last if @pool >= $POOL_SIZE;
246 push @pool, $current;
247
248 $current->prio (0);
249 schedule;
250 } 276 }
251} 277}
252 278
253sub async_pool(&@) { 279sub async_pool(&@) {
254 # this is also inlined into the unlock_scheduler 280 # this is also inlined into the unlock_scheduler
255 my $coro = (pop @pool or new Coro \&pool_handler); 281 my $coro = (pop @async_pool) || new Coro \&pool_handler;
256 282
257 $coro->{_invoke} = [@_]; 283 $coro->{_invoke} = [@_];
258 $coro->ready; 284 $coro->ready;
259 285
260 $coro 286 $coro
261} 287}
262 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
263=item schedule 297=item schedule
264 298
265Calls 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
266into the ready queue, so calling this function usually means you will 306queue, so calling this function usually means you will never be called
267never be called again unless something else (e.g. an event handler) calls 307again unless something else (e.g. an event handler) calls C<< ->ready >>,
268ready. 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.
269 317
270The canonical way to wait on external events is this: 318The canonical way to wait on external events is this:
271 319
272 { 320 {
273 # remember current coroutine 321 # remember current coroutine
278 # wake up sleeping coroutine 326 # wake up sleeping coroutine
279 $current->ready; 327 $current->ready;
280 undef $current; 328 undef $current;
281 }; 329 };
282 330
283 # call schedule until event occured. 331 # call schedule until event occurred.
284 # in case we are woken up for other reasons 332 # in case we are woken up for other reasons
285 # (current still defined), loop. 333 # (current still defined), loop.
286 Coro::schedule while $current; 334 Coro::schedule while $current;
287 } 335 }
288 336
289=item cede 337=item cede
290 338
291"Cede" to other coroutines. This function puts the current coroutine into the 339"Cede" to other coroutines. This function puts the current coroutine into
292ready 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
293current "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.
294 344
295Returns true if at least one coroutine switch has happened. 345This function is often called C<yield> in other languages.
296 346
297=item Coro::cede_notself 347=item Coro::cede_notself
298 348
299Works 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>
300coroutine, regardless of priority, once. 350coroutine, regardless of priority. This is useful sometimes to ensure
301 351progress is made.
302Returns true if at least one coroutine switch has happened.
303 352
304=item terminate [arg...] 353=item terminate [arg...]
305 354
306Terminates the current coroutine with the given status values (see L<cancel>). 355Terminates the current coroutine with the given status values (see L<cancel>).
356
357=item killall
358
359Kills/terminates/cancels all coroutines except the currently running
360one. This is useful after a fork, either in the child or the parent, as
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.
307 366
308=cut 367=cut
309 368
310sub terminate { 369sub terminate {
311 $current->cancel (@_); 370 $current->cancel (@_);
312} 371}
313 372
373sub killall {
374 for (Coro::State::list) {
375 $_->cancel
376 if $_ != $current && UNIVERSAL::isa $_, "Coro";
377 }
378}
379
314=back 380=back
315 381
316# dynamic methods
317
318=head2 COROUTINE METHODS 382=head2 COROUTINE METHODS
319 383
320These are the methods you can call on coroutine objects. 384These are the methods you can call on coroutine objects (or to create
385them).
321 386
322=over 4 387=over 4
323 388
324=item new Coro \&sub [, @args...] 389=item new Coro \&sub [, @args...]
325 390
326Create 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
327automatically terminates as if C<terminate> with the returned values were 392automatically terminates as if C<terminate> with the returned values were
328called. 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
329by calling the ready method. 394queue by calling the ready method.
330 395
331Calling C<exit> in a coroutine will not work correctly, so do not do that. 396See C<async> and C<Coro::State::new> for additional info about the
397coroutine environment.
332 398
333=cut 399=cut
334 400
335sub _run_coro { 401sub _run_coro {
336 terminate &{+shift}; 402 terminate &{+shift};
342 $class->SUPER::new (\&_run_coro, @_) 408 $class->SUPER::new (\&_run_coro, @_)
343} 409}
344 410
345=item $success = $coroutine->ready 411=item $success = $coroutine->ready
346 412
347Put 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
348and 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
349and 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.
350 420
351=item $is_ready = $coroutine->is_ready 421=item $is_ready = $coroutine->is_ready
352 422
353Return wether the coroutine is currently the ready queue or not, 423Return whether the coroutine is currently the ready queue or not,
354 424
355=item $coroutine->cancel (arg...) 425=item $coroutine->cancel (arg...)
356 426
357Terminates the given coroutine and makes it return the given arguments as 427Terminates the given coroutine and makes it return the given arguments as
358status (default: the empty list). Never returns if the coroutine is the 428status (default: the empty list). Never returns if the coroutine is the
360 430
361=cut 431=cut
362 432
363sub cancel { 433sub cancel {
364 my $self = shift; 434 my $self = shift;
365 $self->{status} = [@_]; 435 $self->{_status} = [@_];
366 436
367 if ($current == $self) { 437 if ($current == $self) {
368 push @destroy, $self; 438 push @destroy, $self;
369 $manager->ready; 439 $manager->ready;
370 &schedule while 1; 440 &schedule while 1;
374} 444}
375 445
376=item $coroutine->join 446=item $coroutine->join
377 447
378Wait until the coroutine terminates and return any values given to the 448Wait until the coroutine terminates and return any values given to the
379C<terminate> or C<cancel> functions. C<join> can be called multiple times 449C<terminate> or C<cancel> functions. C<join> can be called concurrently
380from multiple coroutine. 450from multiple coroutines, and all will be resumed and given the status
451return once the C<$coroutine> terminates.
381 452
382=cut 453=cut
383 454
384sub join { 455sub join {
385 my $self = shift; 456 my $self = shift;
386 457
387 unless ($self->{status}) { 458 unless ($self->{_status}) {
388 my $current = $current; 459 my $current = $current;
389 460
390 push @{$self->{destroy_cb}}, sub { 461 push @{$self->{_on_destroy}}, sub {
391 $current->ready; 462 $current->ready;
392 undef $current; 463 undef $current;
393 }; 464 };
394 465
395 &schedule while $current; 466 &schedule while $current;
396 } 467 }
397 468
398 wantarray ? @{$self->{status}} : $self->{status}[0]; 469 wantarray ? @{$self->{_status}} : $self->{_status}[0];
399} 470}
400 471
401=item $coroutine->on_destroy (\&cb) 472=item $coroutine->on_destroy (\&cb)
402 473
403Registers a callback that is called when this coroutine gets destroyed, 474Registers a callback that is called when this coroutine gets destroyed,
404but before it is joined. The callback gets passed the terminate arguments, 475but before it is joined. The callback gets passed the terminate arguments,
405if any. 476if any, and I<must not> die, under any circumstances.
406 477
407=cut 478=cut
408 479
409sub on_destroy { 480sub on_destroy {
410 my ($self, $cb) = @_; 481 my ($self, $cb) = @_;
411 482
412 push @{ $self->{destroy_cb} }, $cb; 483 push @{ $self->{_on_destroy} }, $cb;
413} 484}
414 485
415=item $oldprio = $coroutine->prio ($newprio) 486=item $oldprio = $coroutine->prio ($newprio)
416 487
417Sets (or gets, if the argument is missing) the priority of the 488Sets (or gets, if the argument is missing) the priority of the
442=item $olddesc = $coroutine->desc ($newdesc) 513=item $olddesc = $coroutine->desc ($newdesc)
443 514
444Sets (or gets in case the argument is missing) the description for this 515Sets (or gets in case the argument is missing) the description for this
445coroutine. 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.
446 517
518This method simply sets the C<< $coroutine->{desc} >> member to the given string. You
519can modify this member directly if you wish.
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
447=cut 537=cut
448 538
449sub desc { 539sub desc {
450 my $old = $_[0]{desc}; 540 my $old = $_[0]{desc};
451 $_[0]{desc} = $_[1] if @_ > 1; 541 $_[0]{desc} = $_[1] if @_ > 1;
459=over 4 549=over 4
460 550
461=item Coro::nready 551=item Coro::nready
462 552
463Returns the number of coroutines that are currently in the ready state, 553Returns the number of coroutines that are currently in the ready state,
464i.e. that can be swicthed 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
465coroutine 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>
466and 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
467that wakes up some coroutines. 558coroutines.
468 559
469=item my $guard = Coro::guard { ... } 560=item my $guard = Coro::guard { ... }
470 561
471This creates and returns a guard object. Nothing happens until the objetc 562This creates and returns a guard object. Nothing happens until the object
472gets destroyed, in which case the codeblock given as argument will be 563gets destroyed, in which case the codeblock given as argument will be
473executed. This is useful to free locks or other resources in case of a 564executed. This is useful to free locks or other resources in case of a
474runtime error or when the coroutine gets canceled, as in both cases the 565runtime error or when the coroutine gets canceled, as in both cases the
475guard block will be executed. The guard object supports only one method, 566guard block will be executed. The guard object supports only one method,
476C<< ->cancel >>, which will keep the codeblock from being executed. 567C<< ->cancel >>, which will keep the codeblock from being executed.
501 592
502 593
503=item unblock_sub { ... } 594=item unblock_sub { ... }
504 595
505This utility function takes a BLOCK or code reference and "unblocks" it, 596This utility function takes a BLOCK or code reference and "unblocks" it,
506returning the new coderef. This means that the new coderef will return 597returning a new coderef. Unblocking means that calling the new coderef
507immediately without blocking, returning nothing, while the original code 598will return immediately without blocking, returning nothing, while the
508ref will be called (with parameters) from within its own coroutine. 599original code ref will be called (with parameters) from within another
600coroutine.
509 601
510The reason this fucntion exists is that many event libraries (such as the 602The reason this function exists is that many event libraries (such as the
511venerable L<Event|Event> module) are not coroutine-safe (a weaker form 603venerable L<Event|Event> module) are not coroutine-safe (a weaker form
512of thread-safety). This means you must not block within event callbacks, 604of thread-safety). This means you must not block within event callbacks,
513otherwise 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>.
514 607
515This function allows your callbacks to block by executing them in another 608This function allows your callbacks to block by executing them in another
516coroutine 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
517is 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
518disk. 611disk, for example.
519 612
520In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when 613In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
521creating 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>.
522 625
523=cut 626=cut
524 627
525our @unblock_queue; 628our @unblock_queue;
526 629
527# we create a special coro because we want to cede, 630# we create a special coro because we want to cede,
528# to reduce pressure on the coro pool (because most callbacks 631# to reduce pressure on the coro pool (because most callbacks
529# return immediately and can be reused) and because we cannot cede 632# return immediately and can be reused) and because we cannot cede
530# inside an event callback. 633# inside an event callback.
531our $unblock_scheduler = async { 634our $unblock_scheduler = new Coro sub {
532 while () { 635 while () {
533 while (my $cb = pop @unblock_queue) { 636 while (my $cb = pop @unblock_queue) {
534 # this is an inlined copy of async_pool 637 # this is an inlined copy of async_pool
535 my $coro = (pop @pool or new Coro \&pool_handler); 638 my $coro = (pop @async_pool) || new Coro \&pool_handler;
536 639
537 $coro->{_invoke} = $cb; 640 $coro->{_invoke} = $cb;
538 $coro->ready; 641 $coro->ready;
539 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
540 } 643 }
541 schedule; # sleep well 644 schedule; # sleep well
542 } 645 }
543}; 646};
647$unblock_scheduler->desc ("[unblock_sub scheduler]");
544 648
545sub unblock_sub(&) { 649sub unblock_sub(&) {
546 my $cb = shift; 650 my $cb = shift;
547 651
548 sub { 652 sub {
557 661
5581; 6621;
559 663
560=head1 BUGS/LIMITATIONS 664=head1 BUGS/LIMITATIONS
561 665
562 - you must make very sure that no coro is still active on global
563 destruction. very bad things might happen otherwise (usually segfaults).
564
565 - 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
566 from the same thread (this requirement might be losened in the future 667module from the same thread (this requirement might be removed in the
567 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
568 this). 669this). I recommend disabling thread support and using processes, as this
670is much faster and uses less memory.
569 671
570=head1 SEE ALSO 672=head1 SEE ALSO
571 673
674Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
675
676Debugging: L<Coro::Debug>.
677
572Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>. 678Support/Utility: L<Coro::Specific>, L<Coro::Util>.
573 679
574Locking/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>.
575 681
576Event/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>.
577 683
578Embedding: 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>.
579 689
580=head1 AUTHOR 690=head1 AUTHOR
581 691
582 Marc Lehmann <schmorp@schmorp.de> 692 Marc Lehmann <schmorp@schmorp.de>
583 http://home.schmorp.de/ 693 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines