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

Comparing Coro/Coro.pm (file contents):
Revision 1.227 by root, Thu Nov 20 03:10:30 2008 UTC vs.
Revision 1.274 by root, Sat Dec 12 01:30:26 2009 UTC

1=head1 NAME 1=head1 NAME
2 2
3Coro - coroutine process abstraction 3Coro - the only real threads in perl
4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 use Coro; 7 use Coro;
8 8
11 print "2\n"; 11 print "2\n";
12 cede; # yield back to main 12 cede; # yield back to main
13 print "4\n"; 13 print "4\n";
14 }; 14 };
15 print "1\n"; 15 print "1\n";
16 cede; # yield to coroutine 16 cede; # yield to coro
17 print "3\n"; 17 print "3\n";
18 cede; # and again 18 cede; # and again
19 19
20 # use locking 20 # use locking
21 use Coro::Semaphore; 21 use Coro::Semaphore;
26 $locked = 1; 26 $locked = 1;
27 $lock->up; 27 $lock->up;
28 28
29=head1 DESCRIPTION 29=head1 DESCRIPTION
30 30
31This module collection manages coroutines. Coroutines are similar to 31For a tutorial-style introduction, please read the L<Coro::Intro>
32threads but don't (in general) run in parallel at the same time even 32manpage. This manpage mainly contains reference information.
33on SMP machines. The specific flavor of coroutine used in this module
34also guarantees you that it will not switch between coroutines unless
35necessary, at easily-identified points in your program, so locking and
36parallel access are rarely an issue, making coroutine programming much
37safer and easier than threads programming.
38 33
39Unlike a normal perl program, however, coroutines allow you to have 34This module collection manages continuations in general, most often in
40multiple running interpreters that share data, which is especially useful 35the form of cooperative threads (also called coros, or simply "coro"
41to code pseudo-parallel processes and for event-based programming, such as 36in the documentation). They are similar to kernel threads but don't (in
42multiple HTTP-GET requests running concurrently. See L<Coro::AnyEvent> to 37general) run in parallel at the same time even on SMP machines. The
43learn more. 38specific flavor of thread offered by this module also guarantees you that
39it will not switch between threads unless necessary, at easily-identified
40points in your program, so locking and parallel access are rarely an
41issue, making thread programming much safer and easier than using other
42thread models.
44 43
45Coroutines are also useful because Perl has no support for threads (the so 44Unlike the so-called "Perl threads" (which are not actually real threads
46called "threads" that perl offers are nothing more than the (bad) process 45but only the windows process emulation (see section of same name for more
47emulation coming from the Windows platform: On standard operating systems 46details) ported to unix, and as such act as processes), Coro provides
48they serve no purpose whatsoever, except by making your programs slow and 47a full shared address space, which makes communication between threads
49making them use a lot of memory. Best disable them when building perl, or 48very easy. And Coro's threads are fast, too: disabling the Windows
50aks your software vendor/distributor to do it for you). 49process emulation code in your perl and using Coro can easily result in
50a two to four times speed increase for your programs. A parallel matrix
51multiplication benchmark runs over 300 times faster on a single core than
52perl's pseudo-threads on a quad core using all four cores.
51 53
54Coro achieves that by supporting multiple running interpreters that share
55data, which is especially useful to code pseudo-parallel processes and
56for event-based programming, such as multiple HTTP-GET requests running
57concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro
58into an event-based environment.
59
52In this module, coroutines are defined as "callchain + lexical variables + 60In this module, a thread is defined as "callchain + lexical variables +
53@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain, 61some package variables + C stack), that is, a thread has its own callchain,
54its own set of lexicals and its own set of perls most important global 62its own set of lexicals and its own set of perls most important global
55variables (see L<Coro::State> for more configuration). 63variables (see L<Coro::State> for more configuration and background info).
64
65See also the C<SEE ALSO> section at the end of this document - the Coro
66module family is quite large.
56 67
57=cut 68=cut
58 69
59package Coro; 70package Coro;
60 71
61use strict qw(vars subs); 72use common::sense;
62no warnings "uninitialized"; 73
74use Carp ();
75
76use Guard ();
63 77
64use Coro::State; 78use Coro::State;
65 79
66use base qw(Coro::State Exporter); 80use base qw(Coro::State Exporter);
67 81
68our $idle; # idle handler 82our $idle; # idle handler
69our $main; # main coroutine 83our $main; # main coro
70our $current; # current coroutine 84our $current; # current coro
71 85
72our $VERSION = 5.0; 86our $VERSION = 5.21;
73 87
74our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 88our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub rouse_cb rouse_wait);
75our %EXPORT_TAGS = ( 89our %EXPORT_TAGS = (
76 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 90 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
77); 91);
78our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); 92our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
79 93
94=head1 GLOBAL VARIABLES
95
80=over 4 96=over 4
81 97
82=item $Coro::main 98=item $Coro::main
83 99
84This variable stores the coroutine object that represents the main 100This variable stores the Coro object that represents the main
85program. While you cna C<ready> it and do most other things you can do to 101program. 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 102coro, it is mainly useful to compare again C<$Coro::current>, to see
87whether you are running in the main program or not. 103whether you are running in the main program or not.
88 104
89=cut 105=cut
90 106
91# $main is now being initialised by Coro::State 107# $main is now being initialised by Coro::State
92 108
93=item $Coro::current 109=item $Coro::current
94 110
95The coroutine object representing the current coroutine (the last 111The Coro object representing the current coro (the last
96coroutine that the Coro scheduler switched to). The initial value is 112coro that the Coro scheduler switched to). The initial value is
97C<$Coro::main> (of course). 113C<$Coro::main> (of course).
98 114
99This variable is B<strictly> I<read-only>. You can take copies of the 115This variable is B<strictly> I<read-only>. You can take copies of the
100value stored in it and use it as any other coroutine object, but you must 116value stored in it and use it as any other Coro object, but you must
101not otherwise modify the variable itself. 117not otherwise modify the variable itself.
102 118
103=cut 119=cut
104 120
105sub current() { $current } # [DEPRECATED] 121sub current() { $current } # [DEPRECATED]
106 122
107=item $Coro::idle 123=item $Coro::idle
108 124
109This variable is mainly useful to integrate Coro into event loops. It is 125This variable is mainly useful to integrate Coro into event loops. It is
110usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is 126usually better to rely on L<Coro::AnyEvent> or L<Coro::EV>, as this is
111pretty low-level functionality. 127pretty low-level functionality.
112 128
113This variable stores a callback that is called whenever the scheduler 129This variable stores a Coro object that is put into the ready queue when
114finds no ready coroutines to run. The default implementation prints 130there are no other ready threads (without invoking any ready hooks).
115"FATAL: deadlock detected" and exits, because the program has no other way
116to continue.
117 131
132The default implementation dies with "FATAL: deadlock detected.", followed
133by a thread listing, because the program has no other way to continue.
134
118This hook is overwritten by modules such as C<Coro::Timer> and 135This hook is overwritten by modules such as C<Coro::EV> and
119C<Coro::AnyEvent> to wait on an external event that hopefully wake up a 136C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
120coroutine so the scheduler can run it. 137coro so the scheduler can run it.
121 138
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 139See L<Coro::EV> or L<Coro::AnyEvent> for examples of using this technique.
128technique.
129 140
130Please note that if your callback recursively invokes perl (e.g. for event
131handlers), then it must be prepared to be called recursively itself.
132
133=cut 141=cut
134 142
135$idle = sub { 143$idle = new Coro sub {
136 require Carp; 144 require Coro::Debug;
137 Carp::croak ("FATAL: deadlock detected"); 145 die "FATAL: deadlock detected.\n"
146 . Coro::Debug::ps_listing ();
138}; 147};
139 148
140sub _cancel {
141 my ($self) = @_;
142
143 # free coroutine data and mark as destructed
144 $self->_destroy
145 or return;
146
147 # call all destruction callbacks
148 $_->(@{$self->{_status}})
149 for @{ delete $self->{_on_destroy} || [] };
150}
151
152# this coroutine is necessary because a coroutine 149# this coro is necessary because a coro
153# cannot destroy itself. 150# cannot destroy itself.
154our @destroy; 151our @destroy;
155our $manager; 152our $manager;
156 153
157$manager = new Coro sub { 154$manager = new Coro sub {
158 while () { 155 while () {
159 (shift @destroy)->_cancel 156 Coro::State::cancel shift @destroy
160 while @destroy; 157 while @destroy;
161 158
162 &schedule; 159 &schedule;
163 } 160 }
164}; 161};
165$manager->{desc} = "[coro manager]"; 162$manager->{desc} = "[coro manager]";
166$manager->prio (PRIO_MAX); 163$manager->prio (PRIO_MAX);
167 164
168=back 165=back
169 166
170=head2 SIMPLE COROUTINE CREATION 167=head1 SIMPLE CORO CREATION
171 168
172=over 4 169=over 4
173 170
174=item async { ... } [@args...] 171=item async { ... } [@args...]
175 172
176Create a new coroutine and return it's coroutine object (usually 173Create a new coro and return its Coro object (usually
177unused). The coroutine will be put into the ready queue, so 174unused). The coro will be put into the ready queue, so
178it will start running automatically on the next scheduler run. 175it will start running automatically on the next scheduler run.
179 176
180The first argument is a codeblock/closure that should be executed in the 177The first argument is a codeblock/closure that should be executed in the
181coroutine. When it returns argument returns the coroutine is automatically 178coro. When it returns argument returns the coro is automatically
182terminated. 179terminated.
183 180
184The remaining arguments are passed as arguments to the closure. 181The remaining arguments are passed as arguments to the closure.
185 182
186See the C<Coro::State::new> constructor for info about the coroutine 183See the C<Coro::State::new> constructor for info about the coro
187environment in which coroutines are executed. 184environment in which coro are executed.
188 185
189Calling C<exit> in a coroutine will do the same as calling exit outside 186Calling C<exit> in a coro will do the same as calling exit outside
190the coroutine. Likewise, when the coroutine dies, the program will exit, 187the coro. Likewise, when the coro dies, the program will exit,
191just as it would in the main program. 188just as it would in the main program.
192 189
193If you do not want that, you can provide a default C<die> handler, or 190If you do not want that, you can provide a default C<die> handler, or
194simply avoid dieing (by use of C<eval>). 191simply avoid dieing (by use of C<eval>).
195 192
196Example: Create a new coroutine that just prints its arguments. 193Example: Create a new coro that just prints its arguments.
197 194
198 async { 195 async {
199 print "@_\n"; 196 print "@_\n";
200 } 1,2,3,4; 197 } 1,2,3,4;
201 198
202=cut
203
204sub async(&@) {
205 my $coro = new Coro @_;
206 $coro->ready;
207 $coro
208}
209
210=item async_pool { ... } [@args...] 199=item async_pool { ... } [@args...]
211 200
212Similar to C<async>, but uses a coroutine pool, so you should not call 201Similar to C<async>, but uses a coro pool, so you should not call
213terminate or join on it (although you are allowed to), and you get a 202terminate or join on it (although you are allowed to), and you get a
214coroutine that might have executed other code already (which can be good 203coro that might have executed other code already (which can be good
215or bad :). 204or bad :).
216 205
217On the plus side, this function is faster than creating (and destroying) 206On the plus side, this function is about twice as fast as creating (and
218a completly new coroutine, so if you need a lot of generic coroutines in 207destroying) a completely new coro, so if you need a lot of generic
219quick successsion, use C<async_pool>, not C<async>. 208coros in quick successsion, use C<async_pool>, not C<async>.
220 209
221The code block is executed in an C<eval> context and a warning will be 210The code block is executed in an C<eval> context and a warning will be
222issued in case of an exception instead of terminating the program, as 211issued in case of an exception instead of terminating the program, as
223C<async> does. As the coroutine is being reused, stuff like C<on_destroy> 212C<async> does. As the coro is being reused, stuff like C<on_destroy>
224will not work in the expected way, unless you call terminate or cancel, 213will not work in the expected way, unless you call terminate or cancel,
225which somehow defeats the purpose of pooling (but is fine in the 214which somehow defeats the purpose of pooling (but is fine in the
226exceptional case). 215exceptional case).
227 216
228The priority will be reset to C<0> after each run, tracing will be 217The priority will be reset to C<0> after each run, tracing will be
229disabled, the description will be reset and the default output filehandle 218disabled, the description will be reset and the default output filehandle
230gets restored, so you can change all these. Otherwise the coroutine will 219gets restored, so you can change all these. Otherwise the coro will
231be re-used "as-is": most notably if you change other per-coroutine global 220be re-used "as-is": most notably if you change other per-coro global
232stuff such as C<$/> you I<must needs> revert that change, which is most 221stuff such as C<$/> you I<must needs> revert that change, which is most
233simply done by using local as in: C<< local $/ >>. 222simply done by using local as in: C<< local $/ >>.
234 223
235The idle pool size is limited to C<8> idle coroutines (this can be 224The idle pool size is limited to C<8> idle coros (this can be
236adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle 225adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
237coros as required. 226coros as required.
238 227
239If you are concerned about pooled coroutines growing a lot because a 228If you are concerned about pooled coros growing a lot because a
240single C<async_pool> used a lot of stackspace you can e.g. C<async_pool 229single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
241{ terminate }> once per second or so to slowly replenish the pool. In 230{ terminate }> once per second or so to slowly replenish the pool. In
242addition to that, when the stacks used by a handler grows larger than 16kb 231addition to that, when the stacks used by a handler grows larger than 32kb
243(adjustable via $Coro::POOL_RSS) it will also be destroyed. 232(adjustable via $Coro::POOL_RSS) it will also be destroyed.
244 233
245=cut 234=cut
246 235
247our $POOL_SIZE = 8; 236our $POOL_SIZE = 8;
248our $POOL_RSS = 16 * 1024; 237our $POOL_RSS = 32 * 1024;
249our @async_pool; 238our @async_pool;
250 239
251sub pool_handler { 240sub pool_handler {
252 while () { 241 while () {
253 eval { 242 eval {
258 } 247 }
259} 248}
260 249
261=back 250=back
262 251
263=head2 STATIC METHODS 252=head1 STATIC METHODS
264 253
265Static methods are actually functions that operate on the current coroutine. 254Static methods are actually functions that implicitly operate on the
255current coro.
266 256
267=over 4 257=over 4
268 258
269=item schedule 259=item schedule
270 260
271Calls the scheduler. The scheduler will find the next coroutine that is 261Calls the scheduler. The scheduler will find the next coro that is
272to be run from the ready queue and switches to it. The next coroutine 262to be run from the ready queue and switches to it. The next coro
273to be run is simply the one with the highest priority that is longest 263to be run is simply the one with the highest priority that is longest
274in its ready queue. If there is no coroutine ready, it will clal the 264in its ready queue. If there is no coro ready, it will call the
275C<$Coro::idle> hook. 265C<$Coro::idle> hook.
276 266
277Please note that the current coroutine will I<not> be put into the ready 267Please note that the current coro will I<not> be put into the ready
278queue, so calling this function usually means you will never be called 268queue, so calling this function usually means you will never be called
279again unless something else (e.g. an event handler) calls C<< ->ready >>, 269again unless something else (e.g. an event handler) calls C<< ->ready >>,
280thus waking you up. 270thus waking you up.
281 271
282This makes C<schedule> I<the> generic method to use to block the current 272This makes C<schedule> I<the> generic method to use to block the current
283coroutine and wait for events: first you remember the current coroutine in 273coro and wait for events: first you remember the current coro in
284a variable, then arrange for some callback of yours to call C<< ->ready 274a variable, then arrange for some callback of yours to call C<< ->ready
285>> on that once some event happens, and last you call C<schedule> to put 275>> on that once some event happens, and last you call C<schedule> to put
286yourself to sleep. Note that a lot of things can wake your coroutine up, 276yourself to sleep. Note that a lot of things can wake your coro up,
287so you need to check whether the event indeed happened, e.g. by storing the 277so you need to check whether the event indeed happened, e.g. by storing the
288status in a variable. 278status in a variable.
289 279
290See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks. 280See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks.
291 281
292=item cede 282=item cede
293 283
294"Cede" to other coroutines. This function puts the current coroutine into 284"Cede" to other coros. This function puts the current coro into
295the ready queue and calls C<schedule>, which has the effect of giving 285the ready queue and calls C<schedule>, which has the effect of giving
296up the current "timeslice" to other coroutines of the same or higher 286up the current "timeslice" to other coros of the same or higher
297priority. Once your coroutine gets its turn again it will automatically be 287priority. Once your coro gets its turn again it will automatically be
298resumed. 288resumed.
299 289
300This function is often called C<yield> in other languages. 290This function is often called C<yield> in other languages.
301 291
302=item Coro::cede_notself 292=item Coro::cede_notself
303 293
304Works like cede, but is not exported by default and will cede to I<any> 294Works like cede, but is not exported by default and will cede to I<any>
305coroutine, regardless of priority. This is useful sometimes to ensure 295coro, regardless of priority. This is useful sometimes to ensure
306progress is made. 296progress is made.
307 297
308=item terminate [arg...] 298=item terminate [arg...]
309 299
310Terminates the current coroutine with the given status values (see L<cancel>). 300Terminates the current coro with the given status values (see L<cancel>).
301
302=item Coro::on_enter BLOCK, Coro::on_leave BLOCK
303
304These function install enter and leave winders in the current scope. The
305enter block will be executed when on_enter is called and whenever the
306current coro is re-entered by the scheduler, while the leave block is
307executed whenever the current coro is blocked by the scheduler, and
308also when the containing scope is exited (by whatever means, be it exit,
309die, last etc.).
310
311I<Neither invoking the scheduler, nor exceptions, are allowed within those
312BLOCKs>. That means: do not even think about calling C<die> without an
313eval, and do not even think of entering the scheduler in any way.
314
315Since both BLOCKs are tied to the current scope, they will automatically
316be removed when the current scope exits.
317
318These functions implement the same concept as C<dynamic-wind> in scheme
319does, and are useful when you want to localise some resource to a specific
320coro.
321
322They slow down thread switching considerably for coros that use them
323(about 40% for a BLOCK with a single assignment, so thread switching is
324still reasonably fast if the handlers are fast).
325
326These functions are best understood by an example: The following function
327will change the current timezone to "Antarctica/South_Pole", which
328requires a call to C<tzset>, but by using C<on_enter> and C<on_leave>,
329which remember/change the current timezone and restore the previous
330value, respectively, the timezone is only changed for the coro that
331installed those handlers.
332
333 use POSIX qw(tzset);
334
335 async {
336 my $old_tz; # store outside TZ value here
337
338 Coro::on_enter {
339 $old_tz = $ENV{TZ}; # remember the old value
340
341 $ENV{TZ} = "Antarctica/South_Pole";
342 tzset; # enable new value
343 };
344
345 Coro::on_leave {
346 $ENV{TZ} = $old_tz;
347 tzset; # restore old value
348 };
349
350 # at this place, the timezone is Antarctica/South_Pole,
351 # without disturbing the TZ of any other coro.
352 };
353
354This can be used to localise about any resource (locale, uid, current
355working directory etc.) to a block, despite the existance of other
356coros.
357
358Another interesting example implements time-sliced multitasking using
359interval timers (this could obviously be optimised, but does the job):
360
361 # "timeslice" the given block
362 sub timeslice(&) {
363 use Time::HiRes ();
364
365 Coro::on_enter {
366 # on entering the thread, we set an VTALRM handler to cede
367 $SIG{VTALRM} = sub { cede };
368 # and then start the interval timer
369 Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0.01, 0.01;
370 };
371 Coro::on_leave {
372 # on leaving the thread, we stop the interval timer again
373 Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0, 0;
374 };
375
376 &{+shift};
377 }
378
379 # use like this:
380 timeslice {
381 # The following is an endless loop that would normally
382 # monopolise the process. Since it runs in a timesliced
383 # environment, it will regularly cede to other threads.
384 while () { }
385 };
386
311 387
312=item killall 388=item killall
313 389
314Kills/terminates/cancels all coroutines except the currently running 390Kills/terminates/cancels all coros except the currently running one.
315one. This is useful after a fork, either in the child or the parent, as
316usually only one of them should inherit the running coroutines.
317 391
318Note that while this will try to free some of the main programs resources, 392Note that while this will try to free some of the main interpreter
393resources if the calling coro isn't the main coro, but one
319you cannot free all of them, so if a coroutine that is not the main 394cannot free all of them, so if a coro that is not the main coro
320program calls this function, there will be some one-time resource leak. 395calls this function, there will be some one-time resource leak.
321 396
322=cut 397=cut
323
324sub terminate {
325 $current->{_status} = [@_];
326 push @destroy, $current;
327 $manager->ready;
328 do { &schedule } while 1;
329}
330 398
331sub killall { 399sub killall {
332 for (Coro::State::list) { 400 for (Coro::State::list) {
333 $_->cancel 401 $_->cancel
334 if $_ != $current && UNIVERSAL::isa $_, "Coro"; 402 if $_ != $current && UNIVERSAL::isa $_, "Coro";
335 } 403 }
336} 404}
337 405
338=back 406=back
339 407
340=head2 COROUTINE METHODS 408=head1 CORO OBJECT METHODS
341 409
342These are the methods you can call on coroutine objects (or to create 410These are the methods you can call on coro objects (or to create
343them). 411them).
344 412
345=over 4 413=over 4
346 414
347=item new Coro \&sub [, @args...] 415=item new Coro \&sub [, @args...]
348 416
349Create a new coroutine and return it. When the sub returns, the coroutine 417Create a new coro and return it. When the sub returns, the coro
350automatically terminates as if C<terminate> with the returned values were 418automatically terminates as if C<terminate> with the returned values were
351called. To make the coroutine run you must first put it into the ready 419called. To make the coro run you must first put it into the ready
352queue by calling the ready method. 420queue by calling the ready method.
353 421
354See C<async> and C<Coro::State::new> for additional info about the 422See C<async> and C<Coro::State::new> for additional info about the
355coroutine environment. 423coro environment.
356 424
357=cut 425=cut
358 426
359sub _terminate { 427sub _coro_run {
360 terminate &{+shift}; 428 terminate &{+shift};
361} 429}
362 430
363=item $success = $coroutine->ready 431=item $success = $coro->ready
364 432
365Put the given coroutine into the end of its ready queue (there is one 433Put the given coro into the end of its ready queue (there is one
366queue for each priority) and return true. If the coroutine is already in 434queue for each priority) and return true. If the coro is already in
367the ready queue, do nothing and return false. 435the ready queue, do nothing and return false.
368 436
369This ensures that the scheduler will resume this coroutine automatically 437This ensures that the scheduler will resume this coro automatically
370once all the coroutines of higher priority and all coroutines of the same 438once all the coro of higher priority and all coro of the same
371priority that were put into the ready queue earlier have been resumed. 439priority that were put into the ready queue earlier have been resumed.
372 440
441=item $coro->suspend
442
443Suspends the specified coro. A suspended coro works just like any other
444coro, except that the scheduler will not select a suspended coro for
445execution.
446
447Suspending a coro can be useful when you want to keep the coro from
448running, but you don't want to destroy it, or when you want to temporarily
449freeze a coro (e.g. for debugging) to resume it later.
450
451A scenario for the former would be to suspend all (other) coros after a
452fork and keep them alive, so their destructors aren't called, but new
453coros can be created.
454
455=item $coro->resume
456
457If the specified coro was suspended, it will be resumed. Note that when
458the coro was in the ready queue when it was suspended, it might have been
459unreadied by the scheduler, so an activation might have been lost.
460
461To avoid this, it is best to put a suspended coro into the ready queue
462unconditionally, as every synchronisation mechanism must protect itself
463against spurious wakeups, and the one in the Coro family certainly do
464that.
465
373=item $is_ready = $coroutine->is_ready 466=item $is_ready = $coro->is_ready
374 467
375Return whether the coroutine is currently the ready queue or not, 468Returns true iff the Coro object is in the ready queue. Unless the Coro
469object gets destroyed, it will eventually be scheduled by the scheduler.
376 470
471=item $is_running = $coro->is_running
472
473Returns true iff the Coro object is currently running. Only one Coro object
474can ever be in the running state (but it currently is possible to have
475multiple running Coro::States).
476
477=item $is_suspended = $coro->is_suspended
478
479Returns true iff this Coro object has been suspended. Suspended Coros will
480not ever be scheduled.
481
377=item $coroutine->cancel (arg...) 482=item $coro->cancel (arg...)
378 483
379Terminates the given coroutine and makes it return the given arguments as 484Terminates the given Coro and makes it return the given arguments as
380status (default: the empty list). Never returns if the coroutine is the 485status (default: the empty list). Never returns if the Coro is the
381current coroutine. 486current Coro.
382 487
383=cut 488=cut
384 489
385sub cancel { 490sub cancel {
386 my $self = shift; 491 my $self = shift;
387 492
388 if ($current == $self) { 493 if ($current == $self) {
389 terminate @_; 494 terminate @_;
390 } else { 495 } else {
391 $self->{_status} = [@_]; 496 $self->{_status} = [@_];
392 $self->_cancel; 497 Coro::State::cancel $self;
393 } 498 }
394} 499}
395 500
501=item $coro->schedule_to
502
503Puts the current coro to sleep (like C<Coro::schedule>), but instead
504of continuing with the next coro from the ready queue, always switch to
505the given coro object (regardless of priority etc.). The readyness
506state of that coro isn't changed.
507
508This is an advanced method for special cases - I'd love to hear about any
509uses for this one.
510
511=item $coro->cede_to
512
513Like C<schedule_to>, but puts the current coro into the ready
514queue. This has the effect of temporarily switching to the given
515coro, and continuing some time later.
516
517This is an advanced method for special cases - I'd love to hear about any
518uses for this one.
519
396=item $coroutine->throw ([$scalar]) 520=item $coro->throw ([$scalar])
397 521
398If C<$throw> is specified and defined, it will be thrown as an exception 522If C<$throw> is specified and defined, it will be thrown as an exception
399inside the coroutine at the next convenient point in time. Otherwise 523inside the coro at the next convenient point in time. Otherwise
400clears the exception object. 524clears the exception object.
401 525
402Coro will check for the exception each time a schedule-like-function 526Coro will check for the exception each time a schedule-like-function
403returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down 527returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
404>>, C<< Coro::Handle->readable >> and so on. Most of these functions 528>>, C<< Coro::Handle->readable >> and so on. Most of these functions
406 530
407The exception object will be thrown "as is" with the specified scalar in 531The exception object will be thrown "as is" with the specified scalar in
408C<$@>, i.e. if it is a string, no line number or newline will be appended 532C<$@>, i.e. if it is a string, no line number or newline will be appended
409(unlike with C<die>). 533(unlike with C<die>).
410 534
411This can be used as a softer means than C<cancel> to ask a coroutine to 535This can be used as a softer means than C<cancel> to ask a coro to
412end itself, although there is no guarantee that the exception will lead to 536end itself, although there is no guarantee that the exception will lead to
413termination, and if the exception isn't caught it might well end the whole 537termination, and if the exception isn't caught it might well end the whole
414program. 538program.
415 539
416You might also think of C<throw> as being the moral equivalent of 540You might also think of C<throw> as being the moral equivalent of
417C<kill>ing a coroutine with a signal (in this case, a scalar). 541C<kill>ing a coro with a signal (in this case, a scalar).
418 542
419=item $coroutine->join 543=item $coro->join
420 544
421Wait until the coroutine terminates and return any values given to the 545Wait until the coro terminates and return any values given to the
422C<terminate> or C<cancel> functions. C<join> can be called concurrently 546C<terminate> or C<cancel> functions. C<join> can be called concurrently
423from multiple coroutines, and all will be resumed and given the status 547from multiple coro, and all will be resumed and given the status
424return once the C<$coroutine> terminates. 548return once the C<$coro> terminates.
425 549
426=cut 550=cut
427 551
428sub join { 552sub join {
429 my $self = shift; 553 my $self = shift;
440 } 564 }
441 565
442 wantarray ? @{$self->{_status}} : $self->{_status}[0]; 566 wantarray ? @{$self->{_status}} : $self->{_status}[0];
443} 567}
444 568
445=item $coroutine->on_destroy (\&cb) 569=item $coro->on_destroy (\&cb)
446 570
447Registers a callback that is called when this coroutine gets destroyed, 571Registers a callback that is called when this coro gets destroyed,
448but before it is joined. The callback gets passed the terminate arguments, 572but before it is joined. The callback gets passed the terminate arguments,
449if any, and I<must not> die, under any circumstances. 573if any, and I<must not> die, under any circumstances.
450 574
451=cut 575=cut
452 576
454 my ($self, $cb) = @_; 578 my ($self, $cb) = @_;
455 579
456 push @{ $self->{_on_destroy} }, $cb; 580 push @{ $self->{_on_destroy} }, $cb;
457} 581}
458 582
459=item $oldprio = $coroutine->prio ($newprio) 583=item $oldprio = $coro->prio ($newprio)
460 584
461Sets (or gets, if the argument is missing) the priority of the 585Sets (or gets, if the argument is missing) the priority of the
462coroutine. Higher priority coroutines get run before lower priority 586coro. Higher priority coro get run before lower priority
463coroutines. Priorities are small signed integers (currently -4 .. +3), 587coro. Priorities are small signed integers (currently -4 .. +3),
464that you can refer to using PRIO_xxx constants (use the import tag :prio 588that you can refer to using PRIO_xxx constants (use the import tag :prio
465to get then): 589to get then):
466 590
467 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN 591 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
468 3 > 1 > 0 > -1 > -3 > -4 592 3 > 1 > 0 > -1 > -3 > -4
469 593
470 # set priority to HIGH 594 # set priority to HIGH
471 current->prio(PRIO_HIGH); 595 current->prio (PRIO_HIGH);
472 596
473The idle coroutine ($Coro::idle) always has a lower priority than any 597The idle coro ($Coro::idle) always has a lower priority than any
474existing coroutine. 598existing coro.
475 599
476Changing the priority of the current coroutine will take effect immediately, 600Changing the priority of the current coro will take effect immediately,
477but changing the priority of coroutines in the ready queue (but not 601but changing the priority of coro in the ready queue (but not
478running) will only take effect after the next schedule (of that 602running) will only take effect after the next schedule (of that
479coroutine). This is a bug that will be fixed in some future version. 603coro). This is a bug that will be fixed in some future version.
480 604
481=item $newprio = $coroutine->nice ($change) 605=item $newprio = $coro->nice ($change)
482 606
483Similar to C<prio>, but subtract the given value from the priority (i.e. 607Similar to C<prio>, but subtract the given value from the priority (i.e.
484higher values mean lower priority, just as in unix). 608higher values mean lower priority, just as in unix).
485 609
486=item $olddesc = $coroutine->desc ($newdesc) 610=item $olddesc = $coro->desc ($newdesc)
487 611
488Sets (or gets in case the argument is missing) the description for this 612Sets (or gets in case the argument is missing) the description for this
489coroutine. This is just a free-form string you can associate with a 613coro. This is just a free-form string you can associate with a
490coroutine. 614coro.
491 615
492This method simply sets the C<< $coroutine->{desc} >> member to the given 616This method simply sets the C<< $coro->{desc} >> member to the given
493string. You can modify this member directly if you wish. 617string. You can modify this member directly if you wish.
494 618
495=cut 619=cut
496 620
497sub desc { 621sub desc {
498 my $old = $_[0]{desc}; 622 my $old = $_[0]{desc};
499 $_[0]{desc} = $_[1] if @_ > 1; 623 $_[0]{desc} = $_[1] if @_ > 1;
500 $old; 624 $old;
501} 625}
502 626
627sub transfer {
628 require Carp;
629 Carp::croak ("You must not call ->transfer on Coro objects. Use Coro::State objects or the ->schedule_to method. Caught");
630}
631
503=back 632=back
504 633
505=head2 GLOBAL FUNCTIONS 634=head1 GLOBAL FUNCTIONS
506 635
507=over 4 636=over 4
508 637
509=item Coro::nready 638=item Coro::nready
510 639
511Returns the number of coroutines that are currently in the ready state, 640Returns the number of coro that are currently in the ready state,
512i.e. that can be switched to by calling C<schedule> directory or 641i.e. that can be switched to by calling C<schedule> directory or
513indirectly. The value C<0> means that the only runnable coroutine is the 642indirectly. The value C<0> means that the only runnable coro is the
514currently running one, so C<cede> would have no effect, and C<schedule> 643currently running one, so C<cede> would have no effect, and C<schedule>
515would cause a deadlock unless there is an idle handler that wakes up some 644would cause a deadlock unless there is an idle handler that wakes up some
516coroutines. 645coro.
517 646
518=item my $guard = Coro::guard { ... } 647=item my $guard = Coro::guard { ... }
519 648
520This creates and returns a guard object. Nothing happens until the object 649This function still exists, but is deprecated. Please use the
521gets destroyed, in which case the codeblock given as argument will be 650C<Guard::guard> function instead.
522executed. This is useful to free locks or other resources in case of a
523runtime error or when the coroutine gets canceled, as in both cases the
524guard block will be executed. The guard object supports only one method,
525C<< ->cancel >>, which will keep the codeblock from being executed.
526 651
527Example: set some flag and clear it again when the coroutine gets canceled
528or the function returns:
529
530 sub do_something {
531 my $guard = Coro::guard { $busy = 0 };
532 $busy = 1;
533
534 # do something that requires $busy to be true
535 }
536
537=cut 652=cut
538 653
539sub guard(&) { 654BEGIN { *guard = \&Guard::guard }
540 bless \(my $cb = $_[0]), "Coro::guard"
541}
542
543sub Coro::guard::cancel {
544 ${$_[0]} = sub { };
545}
546
547sub Coro::guard::DESTROY {
548 ${$_[0]}->();
549}
550
551 655
552=item unblock_sub { ... } 656=item unblock_sub { ... }
553 657
554This utility function takes a BLOCK or code reference and "unblocks" it, 658This utility function takes a BLOCK or code reference and "unblocks" it,
555returning a new coderef. Unblocking means that calling the new coderef 659returning a new coderef. Unblocking means that calling the new coderef
556will return immediately without blocking, returning nothing, while the 660will return immediately without blocking, returning nothing, while the
557original code ref will be called (with parameters) from within another 661original code ref will be called (with parameters) from within another
558coroutine. 662coro.
559 663
560The reason this function exists is that many event libraries (such as the 664The reason this function exists is that many event libraries (such as the
561venerable L<Event|Event> module) are not coroutine-safe (a weaker form 665venerable L<Event|Event> module) are not thread-safe (a weaker form
562of thread-safety). This means you must not block within event callbacks, 666of reentrancy). This means you must not block within event callbacks,
563otherwise you might suffer from crashes or worse. The only event library 667otherwise you might suffer from crashes or worse. The only event library
564currently known that is safe to use without C<unblock_sub> is L<EV>. 668currently known that is safe to use without C<unblock_sub> is L<EV>.
565 669
670Coro will try to catch you when you block in the event loop
671("FATAL:$Coro::IDLE blocked itself"), but this is just best effort and
672only works when you do not run your own event loop.
673
566This function allows your callbacks to block by executing them in another 674This function allows your callbacks to block by executing them in another
567coroutine where it is safe to block. One example where blocking is handy 675coro where it is safe to block. One example where blocking is handy
568is when you use the L<Coro::AIO|Coro::AIO> functions to save results to 676is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
569disk, for example. 677disk, for example.
570 678
571In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when 679In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
572creating event callbacks that want to block. 680creating event callbacks that want to block.
573 681
574If your handler does not plan to block (e.g. simply sends a message to 682If your handler does not plan to block (e.g. simply sends a message to
575another coroutine, or puts some other coroutine into the ready queue), 683another coro, or puts some other coro into the ready queue), there is
576there is no reason to use C<unblock_sub>. 684no reason to use C<unblock_sub>.
577 685
578Note that you also need to use C<unblock_sub> for any other callbacks that 686Note that you also need to use C<unblock_sub> for any other callbacks that
579are indirectly executed by any C-based event loop. For example, when you 687are indirectly executed by any C-based event loop. For example, when you
580use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it 688use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
581provides callbacks that are the result of some event callback, then you 689provides callbacks that are the result of some event callback, then you
611 unshift @unblock_queue, [$cb, @_]; 719 unshift @unblock_queue, [$cb, @_];
612 $unblock_scheduler->ready; 720 $unblock_scheduler->ready;
613 } 721 }
614} 722}
615 723
616=item $cb = Coro::rouse_cb 724=item $cb = rouse_cb
617 725
618Create and return a "rouse callback". That's a code reference that, when 726Create and return a "rouse callback". That's a code reference that,
619called, will save its arguments and notify the owner coroutine of the 727when called, will remember a copy of its arguments and notify the owner
620callback. 728coro of the callback.
621 729
622See the next function. 730See the next function.
623 731
624=item @args = Coro::rouse_wait [$cb] 732=item @args = rouse_wait [$cb]
625 733
626Wait for the specified rouse callback (or the last one tht was created in 734Wait for the specified rouse callback (or the last one that was created in
627this coroutine). 735this coro).
628 736
629As soon as the callback is invoked (or when the calback was invoked before 737As soon as the callback is invoked (or when the callback was invoked
630C<rouse_wait>), it will return a copy of the arguments originally passed 738before C<rouse_wait>), it will return the arguments originally passed to
631to the rouse callback. 739the rouse callback. In scalar context, that means you get the I<last>
740argument, just as if C<rouse_wait> had a C<return ($a1, $a2, $a3...)>
741statement at the end.
632 742
633See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example. 743See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
634 744
635=back 745=back
636 746
638 748
6391; 7491;
640 750
641=head1 HOW TO WAIT FOR A CALLBACK 751=head1 HOW TO WAIT FOR A CALLBACK
642 752
643It is very common for a coroutine to wait for some callback to be 753It is very common for a coro to wait for some callback to be
644called. This occurs naturally when you use coroutines in an otherwise 754called. This occurs naturally when you use coro in an otherwise
645event-based program, or when you use event-based libraries. 755event-based program, or when you use event-based libraries.
646 756
647These typically register a callback for some event, and call that callback 757These typically register a callback for some event, and call that callback
648when the event occured. In a coroutine, however, you typically want to 758when the event occured. In a coro, however, you typically want to
649just wait for the event, simplyifying things. 759just wait for the event, simplyifying things.
650 760
651For example C<< AnyEvent->child >> registers a callback to be called when 761For example C<< AnyEvent->child >> registers a callback to be called when
652a specific child has exited: 762a specific child has exited:
653 763
654 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... }); 764 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
655 765
656But from withina coroutine, you often just want to write this: 766But from within a coro, you often just want to write this:
657 767
658 my $status = wait_for_child $pid; 768 my $status = wait_for_child $pid;
659 769
660Coro offers two functions specifically designed to make this easy, 770Coro offers two functions specifically designed to make this easy,
661C<Coro::rouse_cb> and C<Coro::rouse_wait>. 771C<Coro::rouse_cb> and C<Coro::rouse_wait>.
662 772
663The first function, C<rouse_cb>, generates and returns a callback that, 773The first function, C<rouse_cb>, generates and returns a callback that,
664when invoked, will save it's arguments and notify the coroutine that 774when invoked, will save its arguments and notify the coro that
665created the callback. 775created the callback.
666 776
667The second function, C<rouse_wait>, waits for the callback to be called 777The second function, C<rouse_wait>, waits for the callback to be called
668(by calling C<schedule> to go to sleep) and returns the arguments 778(by calling C<schedule> to go to sleep) and returns the arguments
669originally passed to the callback. 779originally passed to the callback.
684you can roll your own, using C<schedule>: 794you can roll your own, using C<schedule>:
685 795
686 sub wait_for_child($) { 796 sub wait_for_child($) {
687 my ($pid) = @_; 797 my ($pid) = @_;
688 798
689 # store the current coroutine in $current, 799 # store the current coro in $current,
690 # and provide result variables for the closure passed to ->child 800 # and provide result variables for the closure passed to ->child
691 my $current = $Coro::current; 801 my $current = $Coro::current;
692 my ($done, $rstatus); 802 my ($done, $rstatus);
693 803
694 # pass a closure to ->child 804 # pass a closure to ->child
710 820
711=item fork with pthread backend 821=item fork with pthread backend
712 822
713When Coro is compiled using the pthread backend (which isn't recommended 823When Coro is compiled using the pthread backend (which isn't recommended
714but required on many BSDs as their libcs are completely broken), then 824but required on many BSDs as their libcs are completely broken), then
715coroutines will not survive a fork. There is no known workaround except to 825coro will not survive a fork. There is no known workaround except to
716fix your libc and use a saner backend. 826fix your libc and use a saner backend.
717 827
718=item perl process emulation ("threads") 828=item perl process emulation ("threads")
719 829
720This module is not perl-pseudo-thread-safe. You should only ever use this 830This module is not perl-pseudo-thread-safe. You should only ever use this
721module from the same thread (this requirement might be removed in the 831module from the first thread (this requirement might be removed in the
722future to allow per-thread schedulers, but Coro::State does not yet allow 832future to allow per-thread schedulers, but Coro::State does not yet allow
723this). I recommend disabling thread support and using processes, as having 833this). I recommend disabling thread support and using processes, as having
724the windows process emulation enabled under unix roughly halves perl 834the windows process emulation enabled under unix roughly halves perl
725performance, even when not used. 835performance, even when not used.
726 836
727=item coroutine switching not signal safe 837=item coro switching is not signal safe
728 838
729You must not switch to another coroutine from within a signal handler 839You must not switch to another coro from within a signal handler (only
730(only relevant with %SIG - most event libraries provide safe signals). 840relevant with %SIG - most event libraries provide safe signals), I<unless>
841you are sure you are not interrupting a Coro function.
731 842
732That means you I<MUST NOT> call any function that might "block" the 843That means you I<MUST NOT> call any function that might "block" the
733current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or 844current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
734anything that calls those. Everything else, including calling C<ready>, 845anything that calls those. Everything else, including calling C<ready>,
735works. 846works.
736 847
737=back 848=back
738 849
739 850
851=head1 WINDOWS PROCESS EMULATION
852
853A great many people seem to be confused about ithreads (for example, Chip
854Salzenberg called me unintelligent, incapable, stupid and gullible,
855while in the same mail making rather confused statements about perl
856ithreads (for example, that memory or files would be shared), showing his
857lack of understanding of this area - if it is hard to understand for Chip,
858it is probably not obvious to everybody).
859
860What follows is an ultra-condensed version of my talk about threads in
861scripting languages given onthe perl workshop 2009:
862
863The so-called "ithreads" were originally implemented for two reasons:
864first, to (badly) emulate unix processes on native win32 perls, and
865secondly, to replace the older, real thread model ("5.005-threads").
866
867It does that by using threads instead of OS processes. The difference
868between processes and threads is that threads share memory (and other
869state, such as files) between threads within a single process, while
870processes do not share anything (at least not semantically). That
871means that modifications done by one thread are seen by others, while
872modifications by one process are not seen by other processes.
873
874The "ithreads" work exactly like that: when creating a new ithreads
875process, all state is copied (memory is copied physically, files and code
876is copied logically). Afterwards, it isolates all modifications. On UNIX,
877the same behaviour can be achieved by using operating system processes,
878except that UNIX typically uses hardware built into the system to do this
879efficiently, while the windows process emulation emulates this hardware in
880software (rather efficiently, but of course it is still much slower than
881dedicated hardware).
882
883As mentioned before, loading code, modifying code, modifying data
884structures and so on is only visible in the ithreads process doing the
885modification, not in other ithread processes within the same OS process.
886
887This is why "ithreads" do not implement threads for perl at all, only
888processes. What makes it so bad is that on non-windows platforms, you can
889actually take advantage of custom hardware for this purpose (as evidenced
890by the forks module, which gives you the (i-) threads API, just much
891faster).
892
893Sharing data is in the i-threads model is done by transfering data
894structures between threads using copying semantics, which is very slow -
895shared data simply does not exist. Benchmarks using i-threads which are
896communication-intensive show extremely bad behaviour with i-threads (in
897fact, so bad that Coro, which cannot take direct advantage of multiple
898CPUs, is often orders of magnitude faster because it shares data using
899real threads, refer to my talk for details).
900
901As summary, i-threads *use* threads to implement processes, while
902the compatible forks module *uses* processes to emulate, uhm,
903processes. I-threads slow down every perl program when enabled, and
904outside of windows, serve no (or little) practical purpose, but
905disadvantages every single-threaded Perl program.
906
907This is the reason that I try to avoid the name "ithreads", as it is
908misleading as it implies that it implements some kind of thread model for
909perl, and prefer the name "windows process emulation", which describes the
910actual use and behaviour of it much better.
911
740=head1 SEE ALSO 912=head1 SEE ALSO
741 913
742Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 914Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
743 915
744Debugging: L<Coro::Debug>. 916Debugging: L<Coro::Debug>.
745 917
746Support/Utility: L<Coro::Specific>, L<Coro::Util>. 918Support/Utility: L<Coro::Specific>, L<Coro::Util>.
747 919
748Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>. 920Locking and IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>,
921L<Coro::SemaphoreSet>, L<Coro::RWLock>.
749 922
750IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>. 923I/O and Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
751 924
752Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>. 925Compatibility with other modules: L<Coro::LWP> (but see also L<AnyEvent::HTTP> for
926a better-working alternative), L<Coro::BDB>, L<Coro::Storable>,
927L<Coro::Select>.
753 928
754XS API: L<Coro::MakeMaker>. 929XS API: L<Coro::MakeMaker>.
755 930
756Low level Configuration, Coroutine Environment: L<Coro::State>. 931Low level Configuration, Thread Environment, Continuations: L<Coro::State>.
757 932
758=head1 AUTHOR 933=head1 AUTHOR
759 934
760 Marc Lehmann <schmorp@schmorp.de> 935 Marc Lehmann <schmorp@schmorp.de>
761 http://home.schmorp.de/ 936 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines