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

Comparing IO-AIO/AIO.pm (file contents):
Revision 1.68 by root, Tue Oct 24 03:17:39 2006 UTC vs.
Revision 1.82 by root, Fri Oct 27 20:10:06 2006 UTC

51=head1 DESCRIPTION 51=head1 DESCRIPTION
52 52
53This module implements asynchronous I/O using whatever means your 53This module implements asynchronous I/O using whatever means your
54operating system supports. 54operating system supports.
55 55
56Currently, a number of threads are started that execute your read/writes 56In this version, a number of threads are started that execute your
57and signal their completion. You don't need thread support in perl, and 57requests and signal their completion. You don't need thread support
58the threads created by this module will not be visible to perl. In the 58in perl, and the threads created by this module will not be visible
59future, this module might make use of the native aio functions available 59to perl. In the future, this module might make use of the native aio
60on many operating systems. However, they are often not well-supported 60functions available on many operating systems. However, they are often
61(Linux doesn't allow them on normal files currently, for example), 61not well-supported or restricted (Linux doesn't allow them on normal
62and they would only support aio_read and aio_write, so the remaining 62files currently, for example), and they would only support aio_read and
63functionality would have to be implemented using threads anyway. 63aio_write, so the remaining functionality would have to be implemented
64using threads anyway.
64 65
65Although the module will work with in the presence of other threads, 66Although the module will work with in the presence of other (Perl-)
66it is currently not reentrant in any way, so use appropriate locking 67threads, it is currently not reentrant in any way, so use appropriate
67yourself, always call C<poll_cb> from within the same thread, or never 68locking yourself, always call C<poll_cb> from within the same thread, or
68call C<poll_cb> (or other C<aio_> functions) recursively. 69never call C<poll_cb> (or other C<aio_> functions) recursively.
70
71=head1 REQUEST ANATOMY AND LIFETIME
72
73Every C<aio_*> function creates a request. which is a C data structure not
74directly visible to Perl.
75
76If called in non-void context, every request function returns a Perl
77object representing the request. In void context, nothing is returned,
78which saves a bit of memory.
79
80The perl object is a fairly standard ref-to-hash object. The hash contents
81are not used by IO::AIO so you are free to store anything you like in it.
82
83During their existance, aio requests travel through the following states,
84in order:
85
86=over 4
87
88=item ready
89
90Immediately after a request is created it is put into the ready state,
91waiting for a thread to execute it.
92
93=item execute
94
95A thread has accepted the request for processing and is currently
96executing it (e.g. blocking in read).
97
98=item pending
99
100The request has been executed and is waiting for result processing.
101
102While request submission and execution is fully asynchronous, result
103processing is not and relies on the perl interpreter calling C<poll_cb>
104(or another function with the same effect).
105
106=item result
107
108The request results are processed synchronously by C<poll_cb>.
109
110The C<poll_cb> function will process all outstanding aio requests by
111calling their callbacks, freeing memory associated with them and managing
112any groups they are contained in.
113
114=item done
115
116Request has reached the end of its lifetime and holds no resources anymore
117(except possibly for the Perl object, but its connection to the actual
118aio request is severed and calling its methods will either do nothing or
119result in a runtime error).
69 120
70=cut 121=cut
71 122
72package IO::AIO; 123package IO::AIO;
73 124
80 our $VERSION = '2.0'; 131 our $VERSION = '2.0';
81 132
82 our @AIO_REQ = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat 133 our @AIO_REQ = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat
83 aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink 134 aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink
84 aio_fsync aio_fdatasync aio_readahead aio_rename aio_link aio_move 135 aio_fsync aio_fdatasync aio_readahead aio_rename aio_link aio_move
85 aio_group aio_nop); 136 aio_copy aio_group aio_nop aio_mknod);
86 our @EXPORT = (@AIO_REQ, qw(aioreq_pri)); 137 our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice));
87 our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush 138 our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush
88 min_parallel max_parallel max_outstanding nreqs); 139 min_parallel max_parallel nreqs nready npending);
89 140
90 @IO::AIO::GRP::ISA = 'IO::AIO::REQ'; 141 @IO::AIO::GRP::ISA = 'IO::AIO::REQ';
91 142
92 require XSLoader; 143 require XSLoader;
93 XSLoader::load ("IO::AIO", $VERSION); 144 XSLoader::load ("IO::AIO", $VERSION);
124environment, d) use Glib::filename_from_unicode on unicode filenames or e) 175environment, d) use Glib::filename_from_unicode on unicode filenames or e)
125use something else. 176use something else.
126 177
127=over 4 178=over 4
128 179
129=item aioreq_pri $pri 180=item $prev_pri = aioreq_pri [$pri]
130 181
131Sets the priority for the next aio request. The default priority 182Returns the priority value that would be used for the next request and, if
183C<$pri> is given, sets the priority for the next aio request.
184
132is C<0>, the minimum and maximum priorities are C<-4> and C<4>, 185The default priority is C<0>, the minimum and maximum priorities are C<-4>
133respectively. Requests with higher priority will be serviced first. 186and C<4>, respectively. Requests with higher priority will be serviced
187first.
134 188
135The priority will be reset to C<0> after each call to one of the C<aio_> 189The priority will be reset to C<0> after each call to one of the C<aio_*>
136functions. 190functions.
191
192Example: open a file with low priority, then read something from it with
193higher priority so the read request is serviced before other low priority
194open requests (potentially spamming the cache):
195
196 aioreq_pri -3;
197 aio_open ..., sub {
198 return unless $_[0];
199
200 aioreq_pri -2;
201 aio_read $_[0], ..., sub {
202 ...
203 };
204 };
205
206=item aioreq_nice $pri_adjust
207
208Similar to C<aioreq_pri>, but subtracts the given value from the current
209priority, so effects are cumulative.
137 210
138=item aio_open $pathname, $flags, $mode, $callback->($fh) 211=item aio_open $pathname, $flags, $mode, $callback->($fh)
139 212
140Asynchronously open or create a file and call the callback with a newly 213Asynchronously open or create a file and call the callback with a newly
141created filehandle for the file. 214created filehandle for the file.
191 264
192 aio_read $fh, 7, 15, $buffer, 0, sub { 265 aio_read $fh, 7, 15, $buffer, 0, sub {
193 $_[0] > 0 or die "read error: $!"; 266 $_[0] > 0 or die "read error: $!";
194 print "read $_[0] bytes: <$buffer>\n"; 267 print "read $_[0] bytes: <$buffer>\n";
195 }; 268 };
196
197=item aio_move $srcpath, $dstpath, $callback->($status)
198
199[EXPERIMENTAL due to internal aio_group use]
200
201Try to move the I<file> (directories not supported as either source or
202destination) from C<$srcpath> to C<$dstpath> and call the callback with
203the C<0> (error) or C<-1> ok.
204
205This is a composite request that tries to rename(2) the file first. If
206rename files with C<EXDEV>, it creates the destination file with mode 0200
207and copies the contents of the source file into it using C<aio_sendfile>,
208followed by restoring atime, mtime, access mode and uid/gid, in that
209order, and unlinking the C<$srcpath>.
210
211If an error occurs, the partial destination file will be unlinked, if
212possible, except when setting atime, mtime, access mode and uid/gid, where
213errors are being ignored.
214
215=cut
216
217sub aio_move($$$) {
218 my ($src, $dst, $cb) = @_;
219
220 my $grp = aio_group $cb;
221
222 add $grp aio_rename $src, $dst, sub {
223 if ($_[0] && $! == EXDEV) {
224 add $grp aio_open $src, O_RDONLY, 0, sub {
225 if (my $src_fh = $_[0]) {
226 my @stat = stat $src_fh;
227
228 add $grp aio_open $dst, O_WRONLY, 0200, sub {
229 if (my $dst_fh = $_[0]) {
230 add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
231 close $src_fh;
232
233 if ($_[0] == $stat[7]) {
234 utime $stat[8], $stat[9], $dst;
235 chmod $stat[2] & 07777, $dst_fh;
236 chown $stat[4], $stat[5], $dst_fh;
237 close $dst_fh;
238
239 add $grp aio_unlink $src, sub {
240 $grp->result ($_[0]);
241 };
242 } else {
243 my $errno = $!;
244 add $grp aio_unlink $dst, sub {
245 $! = $errno;
246 $grp->result (-1);
247 };
248 }
249 };
250 } else {
251 $grp->result (-1);
252 }
253 },
254
255 } else {
256 $grp->result (-1);
257 }
258 };
259 } else {
260 $grp->result ($_[0]);
261 }
262 };
263
264 $grp
265}
266 269
267=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval) 270=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval)
268 271
269Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts 272Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts
270reading at byte offset C<$in_offset>, and starts writing at the current 273reading at byte offset C<$in_offset>, and starts writing at the current
326=item aio_unlink $pathname, $callback->($status) 329=item aio_unlink $pathname, $callback->($status)
327 330
328Asynchronously unlink (delete) a file and call the callback with the 331Asynchronously unlink (delete) a file and call the callback with the
329result code. 332result code.
330 333
334=item aio_mknod $path, $mode, $dev, $callback->($status)
335
336Asynchronously create a device node (or fifo). See mknod(2): the only
337portable value for C<$mode> is C<S_IFIFO> ored with permissions, and C<0>
338for C<$dev>.
339
331=item aio_link $srcpath, $dstpath, $callback->($status) 340=item aio_link $srcpath, $dstpath, $callback->($status)
332 341
333Asynchronously create a new link to the existing object at C<$srcpath> at 342Asynchronously create a new link to the existing object at C<$srcpath> at
334the path C<$dstpath> and call the callback with the result code. 343the path C<$dstpath> and call the callback with the result code.
335 344
355sorted, and will B<NOT> include the C<.> and C<..> entries. 364sorted, and will B<NOT> include the C<.> and C<..> entries.
356 365
357The callback a single argument which is either C<undef> or an array-ref 366The callback a single argument which is either C<undef> or an array-ref
358with the filenames. 367with the filenames.
359 368
369=item aio_copy $srcpath, $dstpath, $callback->($status)
370
371Try to copy the I<file> (directories not supported as either source or
372destination) from C<$srcpath> to C<$dstpath> and call the callback with
373the C<0> (error) or C<-1> ok.
374
375This is a composite request that it creates the destination file with
376mode 0200 and copies the contents of the source file into it using
377C<aio_sendfile>, followed by restoring atime, mtime, access mode and
378uid/gid, in that order.
379
380If an error occurs, the partial destination file will be unlinked, if
381possible, except when setting atime, mtime, access mode and uid/gid, where
382errors are being ignored.
383
384=cut
385
386sub aio_copy($$;$) {
387 my ($src, $dst, $cb) = @_;
388
389 my $pri = aioreq_pri;
390 my $grp = aio_group $cb;
391
392 aioreq_pri $pri;
393 add $grp aio_open $src, O_RDONLY, 0, sub {
394 if (my $src_fh = $_[0]) {
395 my @stat = stat $src_fh;
396
397 aioreq_pri $pri;
398 add $grp aio_open $dst, O_CREAT | O_WRONLY | O_TRUNC, 0200, sub {
399 if (my $dst_fh = $_[0]) {
400 aioreq_pri $pri;
401 add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
402 if ($_[0] == $stat[7]) {
403 $grp->result (0);
404 close $src_fh;
405
406 # those should not normally block. should. should.
407 utime $stat[8], $stat[9], $dst;
408 chmod $stat[2] & 07777, $dst_fh;
409 chown $stat[4], $stat[5], $dst_fh;
410 close $dst_fh;
411 } else {
412 $grp->result (-1);
413 close $src_fh;
414 close $dst_fh;
415
416 aioreq $pri;
417 add $grp aio_unlink $dst;
418 }
419 };
420 } else {
421 $grp->result (-1);
422 }
423 },
424
425 } else {
426 $grp->result (-1);
427 }
428 };
429
430 $grp
431}
432
433=item aio_move $srcpath, $dstpath, $callback->($status)
434
435Try to move the I<file> (directories not supported as either source or
436destination) from C<$srcpath> to C<$dstpath> and call the callback with
437the C<0> (error) or C<-1> ok.
438
439This is a composite request that tries to rename(2) the file first. If
440rename files with C<EXDEV>, it copies the file with C<aio_copy> and, if
441that is successful, unlinking the C<$srcpath>.
442
443=cut
444
445sub aio_move($$;$) {
446 my ($src, $dst, $cb) = @_;
447
448 my $pri = aioreq_pri;
449 my $grp = aio_group $cb;
450
451 aioreq_pri $pri;
452 add $grp aio_rename $src, $dst, sub {
453 if ($_[0] && $! == EXDEV) {
454 aioreq_pri $pri;
455 add $grp aio_copy $src, $dst, sub {
456 $grp->result ($_[0]);
457
458 if (!$_[0]) {
459 aioreq_pri $pri;
460 add $grp aio_unlink $src;
461 }
462 };
463 } else {
464 $grp->result ($_[0]);
465 }
466 };
467
468 $grp
469}
470
360=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) 471=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs)
361 472
362[EXPERIMENTAL due to internal aio_group use]
363
364Scans a directory (similar to C<aio_readdir>) but additionally tries to 473Scans a directory (similar to C<aio_readdir>) but additionally tries to
365separate the entries of directory C<$path> into two sets of names, ones 474efficiently separate the entries of directory C<$path> into two sets of
366you can recurse into (directories or links to them), and ones you cannot 475names, directories you can recurse into (directories), and ones you cannot
367recurse into (everything else). 476recurse into (everything else, including symlinks to directories).
368 477
369C<aio_scandir> is a composite request that creates of many sub requests_ 478C<aio_scandir> is a composite request that creates of many sub requests_
370C<$maxreq> specifies the maximum number of outstanding aio requests that 479C<$maxreq> specifies the maximum number of outstanding aio requests that
371this function generates. If it is C<< <= 0 >>, then a suitable default 480this function generates. If it is C<< <= 0 >>, then a suitable default
372will be chosen (currently 6). 481will be chosen (currently 4).
373 482
374On error, the callback is called without arguments, otherwise it receives 483On error, the callback is called without arguments, otherwise it receives
375two array-refs with path-relative entry names. 484two array-refs with path-relative entry names.
376 485
377Example: 486Example:
414=cut 523=cut
415 524
416sub aio_scandir($$$) { 525sub aio_scandir($$$) {
417 my ($path, $maxreq, $cb) = @_; 526 my ($path, $maxreq, $cb) = @_;
418 527
528 my $pri = aioreq_pri;
529
419 my $grp = aio_group $cb; 530 my $grp = aio_group $cb;
420 531
421 $maxreq = 6 if $maxreq <= 0; 532 $maxreq = 4 if $maxreq <= 0;
422 533
423 # stat once 534 # stat once
535 aioreq_pri $pri;
424 add $grp aio_stat $path, sub { 536 add $grp aio_stat $path, sub {
425 return $grp->result () if $_[0]; 537 return $grp->result () if $_[0];
426 my $now = time; 538 my $now = time;
427 my $hash1 = join ":", (stat _)[0,1,3,7,9]; 539 my $hash1 = join ":", (stat _)[0,1,3,7,9];
428 540
429 # read the directory entries 541 # read the directory entries
542 aioreq_pri $pri;
430 add $grp aio_readdir $path, sub { 543 add $grp aio_readdir $path, sub {
431 my $entries = shift 544 my $entries = shift
432 or return $grp->result (); 545 or return $grp->result ();
433 546
434 # stat the dir another time 547 # stat the dir another time
548 aioreq_pri $pri;
435 add $grp aio_stat $path, sub { 549 add $grp aio_stat $path, sub {
436 my $hash2 = join ":", (stat _)[0,1,3,7,9]; 550 my $hash2 = join ":", (stat _)[0,1,3,7,9];
437 551
438 my $ndirs; 552 my $ndirs;
439 553
454 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length], 568 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length],
455 @$entries]; 569 @$entries];
456 570
457 my (@dirs, @nondirs); 571 my (@dirs, @nondirs);
458 572
459 my ($statcb, $schedcb);
460 my $nreq = 0;
461
462 my $statgrp = add $grp aio_group; 573 my $statgrp = add $grp aio_group sub {
574 $grp->result (\@dirs, \@nondirs);
575 };
463 576
464 $schedcb = sub { 577 limit $statgrp $maxreq;
465 if (@$entries) { 578 feed $statgrp sub {
466 if ($nreq < $maxreq) { 579 return unless @$entries;
467 my $ent = pop @$entries; 580 my $entry = pop @$entries;
581
582 aioreq_pri $pri;
583 add $statgrp aio_stat "$path/$entry/.", sub {
584 if ($_[0] < 0) {
585 push @nondirs, $entry;
586 } else {
587 # need to check for real directory
588 aioreq_pri $pri;
589 add $statgrp aio_lstat "$path/$entry", sub {
590 if (-d _) {
591 push @dirs, $entry;
592
593 unless (--$ndirs) {
594 push @nondirs, @$entries;
595 feed $statgrp;
596 }
597 } else {
598 push @nondirs, $entry;
599 }
468 $nreq++; 600 }
469 add $statgrp aio_stat "$path/$ent/.", sub { $statcb->($_[0], $ent) };
470 } 601 }
471 } elsif (!$nreq) {
472 # finished
473 $statgrp->cancel;
474 undef $statcb;
475 undef $schedcb;
476 $grp->result (\@dirs, \@nondirs);
477 } 602 };
478 }; 603 };
479 $statcb = sub {
480 my ($status, $entry) = @_;
481
482 if ($status < 0) {
483 $nreq--;
484 push @nondirs, $entry;
485 &$schedcb;
486 } else {
487 # need to check for real directory
488 add $grp aio_lstat "$path/$entry", sub {
489 $nreq--;
490
491 if (-d _) {
492 push @dirs, $entry;
493
494 if (!--$ndirs) {
495 push @nondirs, @$entries;
496 $entries = [];
497 }
498 } else {
499 push @nondirs, $entry;
500 }
501
502 &$schedcb;
503 }
504 }
505 };
506
507 &$schedcb while @$entries && $nreq < $maxreq;
508 }; 604 };
509 }; 605 };
510 }; 606 };
511 607
512 $grp 608 $grp
525If this call isn't available because your OS lacks it or it couldn't be 621If this call isn't available because your OS lacks it or it couldn't be
526detected, it will be emulated by calling C<fsync> instead. 622detected, it will be emulated by calling C<fsync> instead.
527 623
528=item aio_group $callback->(...) 624=item aio_group $callback->(...)
529 625
530[EXPERIMENTAL]
531
532This is a very special aio request: Instead of doing something, it is a 626This is a very special aio request: Instead of doing something, it is a
533container for other aio requests, which is useful if you want to bundle 627container for other aio requests, which is useful if you want to bundle
534many requests into a single, composite, request. 628many requests into a single, composite, request with a definite callback
629and the ability to cancel the whole request with its subrequests.
535 630
536Returns an object of class L<IO::AIO::GRP>. See its documentation below 631Returns an object of class L<IO::AIO::GRP>. See its documentation below
537for more info. 632for more info.
538 633
539Example: 634Example:
558phase and still requires a worker thread. Thus, the callback will not 653phase and still requires a worker thread. Thus, the callback will not
559be executed immediately but only after other requests in the queue have 654be executed immediately but only after other requests in the queue have
560entered their execution phase. This can be used to measure request 655entered their execution phase. This can be used to measure request
561latency. 656latency.
562 657
563=item IO::AIO::aio_sleep $fractional_seconds, $callback->() *NOT EXPORTED* 658=item IO::AIO::aio_busy $fractional_seconds, $callback->() *NOT EXPORTED*
564 659
565Mainly used for debugging and benchmarking, this aio request puts one of 660Mainly used for debugging and benchmarking, this aio request puts one of
566the request workers to sleep for the given time. 661the request workers to sleep for the given time.
567 662
568While it is theoretically handy to have simple I/O scheduling requests 663While it is theoretically handy to have simple I/O scheduling requests
569like sleep and file handle readable/writable, the overhead this creates 664like sleep and file handle readable/writable, the overhead this creates is
570is immense, so do not use this function except to put your application 665immense (it blocks a thread for a long time) so do not use this function
571under artificial I/O pressure. 666except to put your application under artificial I/O pressure.
572 667
573=back 668=back
574 669
575=head2 IO::AIO::REQ CLASS 670=head2 IO::AIO::REQ CLASS
576 671
577All non-aggregate C<aio_*> functions return an object of this class when 672All non-aggregate C<aio_*> functions return an object of this class when
578called in non-void context. 673called in non-void context.
579
580A request always moves through the following five states in its lifetime,
581in order: B<ready> (request has been created, but has not been executed
582yet), B<execute> (request is currently being executed), B<pending>
583(request has been executed but callback has not been called yet),
584B<result> (results are being processed synchronously, includes calling the
585callback) and B<done> (request has reached the end of its lifetime and
586holds no resources anymore).
587 674
588=over 4 675=over 4
589 676
590=item cancel $req 677=item cancel $req
591 678
645=item * They can also can also be added to other IO::AIO::GRP objects. 732=item * They can also can also be added to other IO::AIO::GRP objects.
646 733
647=item * You must not add requests to a group from within the group callback (or 734=item * You must not add requests to a group from within the group callback (or
648any later time). 735any later time).
649 736
650=item * This does not harmonise well with C<max_outstanding>, so best do
651not combine C<aio_group> with it. Groups and feeders are recommended for
652this kind of concurrency-limiting.
653
654=back 737=back
655 738
656Their lifetime, simplified, looks like this: when they are empty, they 739Their lifetime, simplified, looks like this: when they are empty, they
657will finish very quickly. If they contain only requests that are in the 740will finish very quickly. If they contain only requests that are in the
658C<done> state, they will also finish. Otherwise they will continue to 741C<done> state, they will also finish. Otherwise they will continue to
673be added, including other groups, as long as you do not create circular 756be added, including other groups, as long as you do not create circular
674dependencies. 757dependencies.
675 758
676Returns all its arguments. 759Returns all its arguments.
677 760
761=item $grp->cancel_subs
762
763Cancel all subrequests and clears any feeder, but not the group request
764itself. Useful when you queued a lot of events but got a result early.
765
678=item $grp->result (...) 766=item $grp->result (...)
679 767
680Set the result value(s) that will be passed to the group callback when all 768Set the result value(s) that will be passed to the group callback when all
681subrequests have finished. By default, no argument will be passed. 769subrequests have finished and set thre groups errno to the current value
770of errno (just like calling C<errno> without an error number). By default,
771no argument will be passed and errno is zero.
772
773=item $grp->errno ([$errno])
774
775Sets the group errno value to C<$errno>, or the current value of errno
776when the argument is missing.
777
778Every aio request has an associated errno value that is restored when
779the callback is invoked. This method lets you change this value from its
780default (0).
781
782Calling C<result> will also set errno, so make sure you either set C<$!>
783before the call to C<result>, or call c<errno> after it.
682 784
683=item feed $grp $callback->($grp) 785=item feed $grp $callback->($grp)
684
685[VERY EXPERIMENTAL]
686 786
687Sets a feeder/generator on this group: every group can have an attached 787Sets a feeder/generator on this group: every group can have an attached
688generator that generates requests if idle. The idea behind this is that, 788generator that generates requests if idle. The idea behind this is that,
689although you could just queue as many requests as you want in a group, 789although you could just queue as many requests as you want in a group,
690this might starve other requests for a potentially long time. For 790this might starve other requests for a potentially long time. For
744 844
745Process all outstanding events on the result pipe. You have to call this 845Process all outstanding events on the result pipe. You have to call this
746regularly. Returns the number of events processed. Returns immediately 846regularly. Returns the number of events processed. Returns immediately
747when no events are outstanding. 847when no events are outstanding.
748 848
849If not all requests were processed for whatever reason, the filehandle
850will still be ready when C<poll_cb> returns.
851
749Example: Install an Event watcher that automatically calls 852Example: Install an Event watcher that automatically calls
750IO::AIO::poll_cb with high priority: 853IO::AIO::poll_cb with high priority:
751 854
752 Event->io (fd => IO::AIO::poll_fileno, 855 Event->io (fd => IO::AIO::poll_fileno,
753 poll => 'r', async => 1, 856 poll => 'r', async => 1,
754 cb => \&IO::AIO::poll_cb); 857 cb => \&IO::AIO::poll_cb);
755 858
859=item IO::AIO::poll_some $max_requests
860
861Similar to C<poll_cb>, but only processes up to C<$max_requests> requests
862at a time.
863
864Useful if you want to ensure some level of interactiveness when perl is
865not fast enough to process all requests in time.
866
867Example: Install an Event watcher that automatically calls
868IO::AIO::poll_some with low priority, to ensure that other parts of the
869program get the CPU sometimes even under high AIO load.
870
871 Event->io (fd => IO::AIO::poll_fileno,
872 poll => 'r', nice => 1,
873 cb => sub { IO::AIO::poll_some 256 });
874
756=item IO::AIO::poll_wait 875=item IO::AIO::poll_wait
757 876
758Wait till the result filehandle becomes ready for reading (simply does a 877Wait till the result filehandle becomes ready for reading (simply does a
759C<select> on the filehandle. This is useful if you want to synchronously wait 878C<select> on the filehandle. This is useful if you want to synchronously wait
760for some requests to finish). 879for some requests to finish).
761 880
762See C<nreqs> for an example. 881See C<nreqs> for an example.
763 882
764=item IO::AIO::nreqs 883=item IO::AIO::nreqs
765 884
766Returns the number of requests currently outstanding (i.e. for which their 885Returns the number of requests currently in the ready, execute or pending
767callback has not been invoked yet). 886states (i.e. for which their callback has not been invoked yet).
768 887
769Example: wait till there are no outstanding requests anymore: 888Example: wait till there are no outstanding requests anymore:
770 889
771 IO::AIO::poll_wait, IO::AIO::poll_cb 890 IO::AIO::poll_wait, IO::AIO::poll_cb
772 while IO::AIO::nreqs; 891 while IO::AIO::nreqs;
892
893=item IO::AIO::nready
894
895Returns the number of requests currently in the ready state (not yet
896executed).
897
898=item IO::AIO::npending
899
900Returns the number of requests currently in the pending state (executed,
901but not yet processed by poll_cb).
773 902
774=item IO::AIO::flush 903=item IO::AIO::flush
775 904
776Wait till all outstanding AIO requests have been handled. 905Wait till all outstanding AIO requests have been handled.
777 906
819This module automatically runs C<max_parallel 0> at program end, to ensure 948This module automatically runs C<max_parallel 0> at program end, to ensure
820that all threads are killed and that there are no outstanding requests. 949that all threads are killed and that there are no outstanding requests.
821 950
822Under normal circumstances you don't need to call this function. 951Under normal circumstances you don't need to call this function.
823 952
824=item $oldnreqs = IO::AIO::max_outstanding $nreqs 953=item $oldmaxreqs = IO::AIO::max_outstanding $maxreqs
825 954
826[DEPRECATED] 955This is a very bad function to use in interactive programs because it
956blocks, and a bad way to reduce concurrency because it is inexact: Better
957use an C<aio_group> together with a feed callback.
827 958
828Sets the maximum number of outstanding requests to C<$nreqs>. If you 959Sets the maximum number of outstanding requests to C<$nreqs>. If you
829try to queue up more than this number of requests, the caller will block until 960to queue up more than this number of requests, the next call to the
830some requests have been handled. 961C<poll_cb> (and C<poll_some> and other functions calling C<poll_cb>)
962function will block until the limit is no longer exceeded.
831 963
832The default is very large, so normally there is no practical limit. If you 964The default value is very large, so there is no practical limit on the
833queue up many requests in a loop it often improves speed if you set 965number of outstanding requests.
834this to a relatively low number, such as C<100>.
835 966
836This function does not work well together with C<aio_group>'s, and their 967You can still queue as many requests as you want. Therefore,
837feeder interface is better suited to limiting concurrency, so do not use 968C<max_oustsanding> is mainly useful in simple scripts (with low values) or
838this function. 969as a stop gap to shield against fatal memory overflow (with large values).
839
840Under normal circumstances you don't need to call this function.
841 970
842=back 971=back
843 972
844=cut 973=cut
845 974
860} 989}
861 990
862min_parallel 8; 991min_parallel 8;
863 992
864END { 993END {
865 max_parallel 0; 994 flush;
866} 995};
867 996
8681; 9971;
869 998
870=head2 FORK BEHAVIOUR 999=head2 FORK BEHAVIOUR
871 1000
872This module should do "the right thing" when the process using it forks: 1001This module should do "the right thing" when the process using it forks:
873 1002
874Before the fork, IO::AIO enters a quiescent state where no requests 1003Before the fork, IO::AIO enters a quiescent state where no requests
875can be added in other threads and no results will be processed. After 1004can be added in other threads and no results will be processed. After
876the fork the parent simply leaves the quiescent state and continues 1005the fork the parent simply leaves the quiescent state and continues
877request/result processing, while the child clears the request/result 1006request/result processing, while the child frees the request/result queue
878queue (so the requests started before the fork will only be handled in 1007(so that the requests started before the fork will only be handled in the
879the parent). Threads will be started on demand until the limit ste in the 1008parent). Threads will be started on demand until the limit set in the
880parent process has been reached again. 1009parent process has been reached again.
881 1010
882In short: the parent will, after a short pause, continue as if fork had 1011In short: the parent will, after a short pause, continue as if fork had
883not been called, while the child will act as if IO::AIO has not been used 1012not been called, while the child will act as if IO::AIO has not been used
884yet. 1013yet.
885 1014
886=head2 MEMORY USAGE 1015=head2 MEMORY USAGE
887 1016
1017Per-request usage:
1018
888Each aio request uses - depending on your architecture - around 128 bytes 1019Each aio request uses - depending on your architecture - around 100-200
889of memory. In addition, stat requests need a stat buffer (possibly a few 1020bytes of memory. In addition, stat requests need a stat buffer (possibly
890hundred bytes). Perl scalars and other data passed into aio requests will 1021a few hundred bytes), readdir requires a result buffer and so on. Perl
891also be locked. 1022scalars and other data passed into aio requests will also be locked and
1023will consume memory till the request has entered the done state.
892 1024
893This is now awfully much, so queuing lots of requests is not usually a 1025This is now awfully much, so queuing lots of requests is not usually a
894problem. 1026problem.
895 1027
896Each thread needs a stack area which is usually around 16k, sometimes much 1028Per-thread usage:
897larger, depending on the OS. 1029
1030In the execution phase, some aio requests require more memory for
1031temporary buffers, and each thread requires a stack and other data
1032structures (usually around 16k-128k, depending on the OS).
1033
1034=head1 KNOWN BUGS
1035
1036Known bugs will be fixed in the next release.
898 1037
899=head1 SEE ALSO 1038=head1 SEE ALSO
900 1039
901L<Coro::AIO>. 1040L<Coro::AIO>.
902 1041

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines