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

Comparing Coro/Coro.pm (file contents):
Revision 1.78 by root, Wed Nov 1 01:21:21 2006 UTC vs.
Revision 1.92 by root, Fri Dec 1 03:47:55 2006 UTC

8 8
9 async { 9 async {
10 # some asynchronous thread of execution 10 # some asynchronous thread of execution
11 }; 11 };
12 12
13 # alternatively create an async process like this: 13 # alternatively create an async coroutine like this:
14 14
15 sub some_func : Coro { 15 sub some_func : Coro {
16 # some more async code 16 # some more async code
17 } 17 }
18 18
35use strict; 35use strict;
36no warnings "uninitialized"; 36no warnings "uninitialized";
37 37
38use Coro::State; 38use Coro::State;
39 39
40use base Exporter::; 40use base qw(Coro::State Exporter);
41 41
42our $idle; # idle coroutine 42our $idle; # idle handler
43our $main; # main coroutine 43our $main; # main coroutine
44our $current; # current coroutine 44our $current; # current coroutine
45 45
46our $VERSION = '2.1'; 46our $VERSION = '3.0';
47 47
48our @EXPORT = qw(async cede schedule terminate current); 48our @EXPORT = qw(async cede schedule terminate current unblock_sub);
49our %EXPORT_TAGS = ( 49our %EXPORT_TAGS = (
50 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 50 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
51); 51);
52our @EXPORT_OK = @{$EXPORT_TAGS{prio}}; 52our @EXPORT_OK = @{$EXPORT_TAGS{prio}};
53 53
95 95
96$main = new Coro; 96$main = new Coro;
97 97
98=item $current (or as function: current) 98=item $current (or as function: current)
99 99
100The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course). 100The current coroutine (the last coroutine switched to). The initial value
101is C<$main> (of course).
102
103This variable is B<strictly> I<read-only>. It is provided for performance
104reasons. If performance is not essentiel you are encouraged to use the
105C<Coro::current> function instead.
101 106
102=cut 107=cut
103 108
104# maybe some other module used Coro::Specific before... 109# maybe some other module used Coro::Specific before...
105if ($current) { 110if ($current) {
110 115
111sub current() { $current } 116sub current() { $current }
112 117
113=item $idle 118=item $idle
114 119
115The coroutine to switch to when no other coroutine is running. The default 120A callback that is called whenever the scheduler finds no ready coroutines
116implementation prints "FATAL: deadlock detected" and exits. 121to run. The default implementation prints "FATAL: deadlock detected" and
122exits, because the program has no other way to continue.
117 123
118=cut 124This hook is overwritten by modules such as C<Coro::Timer> and
125C<Coro::Event> to wait on an external event that hopefully wake up a
126coroutine so the scheduler can run it.
119 127
120# should be done using priorities :( 128Please note that if your callback recursively invokes perl (e.g. for event
121$idle = new Coro sub { 129handlers), then it must be prepared to be called recursively.
130
131=cut
132
133$idle = sub {
122 print STDERR "FATAL: deadlock detected\n"; 134 print STDERR "FATAL: deadlock detected\n";
123 exit(51); 135 exit (51);
124}; 136};
125 137
126# this coroutine is necessary because a coroutine 138# this coroutine is necessary because a coroutine
127# cannot destroy itself. 139# cannot destroy itself.
128my @destroy; 140my @destroy;
129my $manager;
130$manager = new Coro sub { 141my $manager; $manager = new Coro sub {
131 while () { 142 while () {
132 # by overwriting the state object with the manager we destroy it 143 # by overwriting the state object with the manager we destroy it
133 # while still being able to schedule this coroutine (in case it has 144 # while still being able to schedule this coroutine (in case it has
134 # been readied multiple times. this is harmless since the manager 145 # been readied multiple times. this is harmless since the manager
135 # can be called as many times as neccessary and will always 146 # can be called as many times as neccessary and will always
137 while (@destroy) { 148 while (@destroy) {
138 my $coro = pop @destroy; 149 my $coro = pop @destroy;
139 $coro->{status} ||= []; 150 $coro->{status} ||= [];
140 $_->ready for @{delete $coro->{join} || []}; 151 $_->ready for @{delete $coro->{join} || []};
141 152
142 # the next line destroys the _coro_state, but keeps the 153 # the next line destroys the coro state, but keeps the
143 # process itself intact (we basically make it a zombie 154 # coroutine itself intact (we basically make it a zombie
144 # process that always runs the manager thread, so it's possible 155 # coroutine that always runs the manager thread, so it's possible
145 # to transfer() to this process). 156 # to transfer() to this coroutine).
146 $coro->{_coro_state} = $manager->{_coro_state}; 157 $coro->_clone_state_from ($manager);
147 } 158 }
148 &schedule; 159 &schedule;
149 } 160 }
150}; 161};
151 162
153 164
154=back 165=back
155 166
156=head2 STATIC METHODS 167=head2 STATIC METHODS
157 168
158Static methods are actually functions that operate on the current process only. 169Static methods are actually functions that operate on the current coroutine only.
159 170
160=over 4 171=over 4
161 172
162=item async { ... } [@args...] 173=item async { ... } [@args...]
163 174
164Create a new asynchronous process and return it's process object 175Create a new asynchronous coroutine and return it's coroutine object
165(usually unused). When the sub returns the new process is automatically 176(usually unused). When the sub returns the new coroutine is automatically
166terminated. 177terminated.
178
179Calling C<exit> in a coroutine will not work correctly, so do not do that.
180
181When the coroutine dies, the program will exit, just as in the main
182program.
167 183
168 # create a new coroutine that just prints its arguments 184 # create a new coroutine that just prints its arguments
169 async { 185 async {
170 print "@_\n"; 186 print "@_\n";
171 } 1,2,3,4; 187 } 1,2,3,4;
172 188
173=cut 189=cut
174 190
175sub async(&@) { 191sub async(&@) {
176 my $pid = new Coro @_; 192 my $pid = new Coro @_;
177 $manager->ready; # this ensures that the stack is cloned from the manager
178 $pid->ready; 193 $pid->ready;
179 $pid; 194 $pid
180} 195}
181 196
182=item schedule 197=item schedule
183 198
184Calls the scheduler. Please note that the current process will not be put 199Calls the scheduler. Please note that the current coroutine will not be put
185into the ready queue, so calling this function usually means you will 200into the ready queue, so calling this function usually means you will
186never be called again. 201never be called again unless something else (e.g. an event handler) calls
202ready.
187 203
188=cut 204The canonical way to wait on external events is this:
205
206 {
207 # remember current coroutine
208 my $current = $Coro::current;
209
210 # register a hypothetical event handler
211 on_event_invoke sub {
212 # wake up sleeping coroutine
213 $current->ready;
214 undef $current;
215 };
216
217 # call schedule until event occured.
218 # in case we are woken up for other reasons
219 # (current still defined), loop.
220 Coro::schedule while $current;
221 }
189 222
190=item cede 223=item cede
191 224
192"Cede" to other processes. This function puts the current process into the 225"Cede" to other coroutines. This function puts the current coroutine into the
193ready queue and calls C<schedule>, which has the effect of giving up the 226ready queue and calls C<schedule>, which has the effect of giving up the
194current "timeslice" to other coroutines of the same or higher priority. 227current "timeslice" to other coroutines of the same or higher priority.
195 228
196=cut
197
198=item terminate [arg...] 229=item terminate [arg...]
199 230
200Terminates the current process with the given status values (see L<cancel>). 231Terminates the current coroutine with the given status values (see L<cancel>).
201 232
202=cut 233=cut
203 234
204sub terminate { 235sub terminate {
205 $current->cancel (@_); 236 $current->cancel (@_);
207 238
208=back 239=back
209 240
210# dynamic methods 241# dynamic methods
211 242
212=head2 PROCESS METHODS 243=head2 COROUTINE METHODS
213 244
214These are the methods you can call on process objects. 245These are the methods you can call on coroutine objects.
215 246
216=over 4 247=over 4
217 248
218=item new Coro \&sub [, @args...] 249=item new Coro \&sub [, @args...]
219 250
220Create a new process and return it. When the sub returns the process 251Create a new coroutine and return it. When the sub returns the coroutine
221automatically terminates as if C<terminate> with the returned values were 252automatically terminates as if C<terminate> with the returned values were
222called. To make the process run you must first put it into the ready queue 253called. To make the coroutine run you must first put it into the ready queue
223by calling the ready method. 254by calling the ready method.
224 255
225=cut 256Calling C<exit> in a coroutine will not work correctly, so do not do that.
226 257
258=cut
259
227sub _newcoro { 260sub _new_coro {
228 terminate &{+shift}; 261 terminate &{+shift};
229} 262}
230 263
231sub new { 264sub new {
232 my $class = shift; 265 my $class = shift;
233 bless {
234 _coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
235 }, $class;
236}
237 266
238=item $process->ready 267 $class->SUPER::new (\&_new_coro, @_)
268}
239 269
240Put the given process into the ready queue. 270=item $success = $coroutine->ready
241 271
242=cut 272Put the given coroutine into the ready queue (according to it's priority)
273and return true. If the coroutine is already in the ready queue, do nothing
274and return false.
243 275
276=item $is_ready = $coroutine->is_ready
277
278Return wether the coroutine is currently the ready queue or not,
279
244=item $process->cancel (arg...) 280=item $coroutine->cancel (arg...)
245 281
246Temrinates the given process and makes it return the given arguments as 282Terminates the given coroutine and makes it return the given arguments as
247status (default: the empty list). 283status (default: the empty list).
248 284
249=cut 285=cut
250 286
251sub cancel { 287sub cancel {
254 push @destroy, $self; 290 push @destroy, $self;
255 $manager->ready; 291 $manager->ready;
256 &schedule if $current == $self; 292 &schedule if $current == $self;
257} 293}
258 294
259=item $process->join 295=item $coroutine->join
260 296
261Wait until the coroutine terminates and return any values given to the 297Wait until the coroutine terminates and return any values given to the
262C<terminate> or C<cancel> functions. C<join> can be called multiple times 298C<terminate> or C<cancel> functions. C<join> can be called multiple times
263from multiple processes. 299from multiple coroutine.
264 300
265=cut 301=cut
266 302
267sub join { 303sub join {
268 my $self = shift; 304 my $self = shift;
271 &schedule; 307 &schedule;
272 } 308 }
273 wantarray ? @{$self->{status}} : $self->{status}[0]; 309 wantarray ? @{$self->{status}} : $self->{status}[0];
274} 310}
275 311
276=item $oldprio = $process->prio($newprio) 312=item $oldprio = $coroutine->prio ($newprio)
277 313
278Sets (or gets, if the argument is missing) the priority of the 314Sets (or gets, if the argument is missing) the priority of the
279process. Higher priority processes get run before lower priority 315coroutine. Higher priority coroutines get run before lower priority
280processes. Priorities are small signed integers (currently -4 .. +3), 316coroutines. Priorities are small signed integers (currently -4 .. +3),
281that you can refer to using PRIO_xxx constants (use the import tag :prio 317that you can refer to using PRIO_xxx constants (use the import tag :prio
282to get then): 318to get then):
283 319
284 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN 320 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
285 3 > 1 > 0 > -1 > -3 > -4 321 3 > 1 > 0 > -1 > -3 > -4
288 current->prio(PRIO_HIGH); 324 current->prio(PRIO_HIGH);
289 325
290The idle coroutine ($Coro::idle) always has a lower priority than any 326The idle coroutine ($Coro::idle) always has a lower priority than any
291existing coroutine. 327existing coroutine.
292 328
293Changing the priority of the current process will take effect immediately, 329Changing the priority of the current coroutine will take effect immediately,
294but changing the priority of processes in the ready queue (but not 330but changing the priority of coroutines in the ready queue (but not
295running) will only take effect after the next schedule (of that 331running) will only take effect after the next schedule (of that
296process). This is a bug that will be fixed in some future version. 332coroutine). This is a bug that will be fixed in some future version.
297 333
298=cut
299
300sub prio {
301 my $old = $_[0]{prio};
302 $_[0]{prio} = $_[1] if @_ > 1;
303 $old;
304}
305
306=item $newprio = $process->nice($change) 334=item $newprio = $coroutine->nice ($change)
307 335
308Similar to C<prio>, but subtract the given value from the priority (i.e. 336Similar to C<prio>, but subtract the given value from the priority (i.e.
309higher values mean lower priority, just as in unix). 337higher values mean lower priority, just as in unix).
310 338
311=cut
312
313sub nice {
314 $_[0]{prio} -= $_[1];
315}
316
317=item $olddesc = $process->desc($newdesc) 339=item $olddesc = $coroutine->desc ($newdesc)
318 340
319Sets (or gets in case the argument is missing) the description for this 341Sets (or gets in case the argument is missing) the description for this
320process. This is just a free-form string you can associate with a process. 342coroutine. This is just a free-form string you can associate with a coroutine.
321 343
322=cut 344=cut
323 345
324sub desc { 346sub desc {
325 my $old = $_[0]{desc}; 347 my $old = $_[0]{desc};
327 $old; 349 $old;
328} 350}
329 351
330=back 352=back
331 353
354=head2 UTILITY FUNCTIONS
355
356=over 4
357
358=item unblock_sub { ... }
359
360This utility function takes a BLOCK or code reference and "unblocks" it,
361returning the new coderef. This means that the new coderef will return
362immediately without blocking, returning nothing, while the original code
363ref will be called (with parameters) from within its own coroutine.
364
365The reason this fucntion exists is that many event libraries (such as the
366venerable L<Event|Event> module) are not coroutine-safe (a weaker form
367of thread-safety). This means you must not block within event callbacks,
368otherwise you might suffer from crashes or worse.
369
370This function allows your callbacks to block by executing them in another
371coroutine where it is safe to block. One example where blocking is handy
372is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
373disk.
374
375In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
376creating event callbacks that want to block.
377
378=cut
379
380our @unblock_pool;
381our @unblock_queue;
382our $UNBLOCK_POOL_SIZE = 2;
383
384sub unblock_handler_ {
385 while () {
386 my ($cb, @arg) = @{ delete $Coro::current->{arg} };
387 $cb->(@arg);
388
389 last if @unblock_pool >= $UNBLOCK_POOL_SIZE;
390 push @unblock_pool, $Coro::current;
391 schedule;
392 }
393}
394
395our $unblock_scheduler = async {
396 while () {
397 while (my $cb = pop @unblock_queue) {
398 my $handler = (pop @unblock_pool or new Coro \&unblock_handler_);
399 $handler->{arg} = $cb;
400 $handler->ready;
401 cede;
402 }
403
404 schedule;
405 }
406};
407
408sub unblock_sub(&) {
409 my $cb = shift;
410
411 sub {
412 push @unblock_queue, [$cb, @_];
413 $unblock_scheduler->ready;
414 }
415}
416
417=back
418
332=cut 419=cut
333 420
3341; 4211;
335 422
336=head1 BUGS/LIMITATIONS 423=head1 BUGS/LIMITATIONS

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines