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.71 by root, Tue Oct 24 11:57:30 2006 UTC vs.
Revision 1.86 by root, Sat Oct 28 23:32:29 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
56Asynchronous means that operations that can normally block your program
57(e.g. reading from disk) will be done asynchronously: the operation
58will still block, but you can do something else in the meantime. This
59is extremely useful for programs that need to stay interactive even
60when doing heavy I/O (GUI programs, high performance network servers
61etc.), but can also be used to easily do operations in parallel that are
62normally done sequentially, e.g. stat'ing many files, which is much faster
63on a RAID volume or over NFS when you do a number of stat operations
64concurrently.
65
66While this works on all types of file descriptors (for example sockets),
67using these functions on file descriptors that support nonblocking
68operation (again, sockets, pipes etc.) is very inefficient. Use an event
69loop for that (such as the L<Event|Event> module): IO::AIO will naturally
70fit into such an event loop itself.
71
56Currently, a number of threads are started that execute your read/writes 72In this version, a number of threads are started that execute your
57and signal their completion. You don't need thread support in perl, and 73requests and signal their completion. You don't need thread support
58the threads created by this module will not be visible to perl. In the 74in perl, and the threads created by this module will not be visible
59future, this module might make use of the native aio functions available 75to perl. In the future, this module might make use of the native aio
60on many operating systems. However, they are often not well-supported 76functions available on many operating systems. However, they are often
61(Linux doesn't allow them on normal files currently, for example), 77not well-supported or restricted (GNU/Linux doesn't allow them on normal
62and they would only support aio_read and aio_write, so the remaining 78files currently, for example), and they would only support aio_read and
63functionality would have to be implemented using threads anyway. 79aio_write, so the remaining functionality would have to be implemented
80using threads anyway.
64 81
65Although the module will work with in the presence of other threads, 82Although the module will work with in the presence of other (Perl-)
66it is currently not reentrant in any way, so use appropriate locking 83threads, it is currently not reentrant in any way, so use appropriate
67yourself, always call C<poll_cb> from within the same thread, or never 84locking yourself, always call C<poll_cb> from within the same thread, or
68call C<poll_cb> (or other C<aio_> functions) recursively. 85never call C<poll_cb> (or other C<aio_> functions) recursively.
86
87=head2 EXAMPLE
88
89This is a simple example that uses the Event module and loads
90F</etc/passwd> asynchronously:
91
92 use Fcntl;
93 use Event;
94 use IO::AIO;
95
96 # register the IO::AIO callback with Event
97 Event->io (fd => IO::AIO::poll_fileno,
98 poll => 'r',
99 cb => \&IO::AIO::poll_cb);
100
101 # queue the request to open /etc/passwd
102 aio_open "/etc/passwd", O_RDONLY, 0, sub {
103 my $fh = $_[0]
104 or die "error while opening: $!";
105
106 # stat'ing filehandles is generally non-blocking
107 my $size = -s $fh;
108
109 # queue a request to read the file
110 my $contents;
111 aio_read $fh, 0, $size, $contents, 0, sub {
112 $_[0] == $size
113 or die "short read: $!";
114
115 close $fh;
116
117 # file contents now in $contents
118 print $contents;
119
120 # exit event loop and program
121 Event::unloop;
122 };
123 };
124
125 # possibly queue up other requests, or open GUI windows,
126 # check for sockets etc. etc.
127
128 # process events as long as there are some:
129 Event::loop;
130
131=head1 REQUEST ANATOMY AND LIFETIME
132
133Every C<aio_*> function creates a request. which is a C data structure not
134directly visible to Perl.
135
136If called in non-void context, every request function returns a Perl
137object representing the request. In void context, nothing is returned,
138which saves a bit of memory.
139
140The perl object is a fairly standard ref-to-hash object. The hash contents
141are not used by IO::AIO so you are free to store anything you like in it.
142
143During their existance, aio requests travel through the following states,
144in order:
145
146=over 4
147
148=item ready
149
150Immediately after a request is created it is put into the ready state,
151waiting for a thread to execute it.
152
153=item execute
154
155A thread has accepted the request for processing and is currently
156executing it (e.g. blocking in read).
157
158=item pending
159
160The request has been executed and is waiting for result processing.
161
162While request submission and execution is fully asynchronous, result
163processing is not and relies on the perl interpreter calling C<poll_cb>
164(or another function with the same effect).
165
166=item result
167
168The request results are processed synchronously by C<poll_cb>.
169
170The C<poll_cb> function will process all outstanding aio requests by
171calling their callbacks, freeing memory associated with them and managing
172any groups they are contained in.
173
174=item done
175
176Request has reached the end of its lifetime and holds no resources anymore
177(except possibly for the Perl object, but its connection to the actual
178aio request is severed and calling its methods will either do nothing or
179result in a runtime error).
69 180
70=cut 181=cut
71 182
72package IO::AIO; 183package IO::AIO;
73 184
75use strict 'vars'; 186use strict 'vars';
76 187
77use base 'Exporter'; 188use base 'Exporter';
78 189
79BEGIN { 190BEGIN {
80 our $VERSION = '2.0'; 191 our $VERSION = '2.1';
81 192
82 our @AIO_REQ = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat 193 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 194 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 195 aio_fsync aio_fdatasync aio_readahead aio_rename aio_link aio_move
85 aio_group aio_nop); 196 aio_copy aio_group aio_nop aio_mknod);
86 our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice)); 197 our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice));
87 our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush 198 our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush
88 min_parallel max_parallel max_outstanding nreqs); 199 min_parallel max_parallel max_idle
200 nreqs nready npending nthreads
201 max_poll_time max_poll_reqs);
89 202
90 @IO::AIO::GRP::ISA = 'IO::AIO::REQ'; 203 @IO::AIO::GRP::ISA = 'IO::AIO::REQ';
91 204
92 require XSLoader; 205 require XSLoader;
93 XSLoader::load ("IO::AIO", $VERSION); 206 XSLoader::load ("IO::AIO", $VERSION);
124environment, d) use Glib::filename_from_unicode on unicode filenames or e) 237environment, d) use Glib::filename_from_unicode on unicode filenames or e)
125use something else. 238use something else.
126 239
127=over 4 240=over 4
128 241
129=item aioreq_pri $pri 242=item $prev_pri = aioreq_pri [$pri]
130 243
131Sets the priority for the next aio request. The default priority 244Returns the priority value that would be used for the next request and, if
245C<$pri> is given, sets the priority for the next aio request.
246
132is C<0>, the minimum and maximum priorities are C<-4> and C<4>, 247The default priority is C<0>, the minimum and maximum priorities are C<-4>
133respectively. Requests with higher priority will be serviced first. 248and C<4>, respectively. Requests with higher priority will be serviced
249first.
134 250
135The priority will be reset to C<0> after each call to one of the C<aio_> 251The priority will be reset to C<0> after each call to one of the C<aio_*>
136functions. 252functions.
137 253
138Example: open a file with low priority, then read something from it with 254Example: open a file with low priority, then read something from it with
139higher priority so the read request is serviced before other low priority 255higher priority so the read request is serviced before other low priority
140open requests (potentially spamming the cache): 256open requests (potentially spamming the cache):
210 326
211 aio_read $fh, 7, 15, $buffer, 0, sub { 327 aio_read $fh, 7, 15, $buffer, 0, sub {
212 $_[0] > 0 or die "read error: $!"; 328 $_[0] > 0 or die "read error: $!";
213 print "read $_[0] bytes: <$buffer>\n"; 329 print "read $_[0] bytes: <$buffer>\n";
214 }; 330 };
215
216=item aio_move $srcpath, $dstpath, $callback->($status)
217
218Try to move the I<file> (directories not supported as either source or
219destination) from C<$srcpath> to C<$dstpath> and call the callback with
220the C<0> (error) or C<-1> ok.
221
222This is a composite request that tries to rename(2) the file first. If
223rename files with C<EXDEV>, it creates the destination file with mode 0200
224and copies the contents of the source file into it using C<aio_sendfile>,
225followed by restoring atime, mtime, access mode and uid/gid, in that
226order, and unlinking the C<$srcpath>.
227
228If an error occurs, the partial destination file will be unlinked, if
229possible, except when setting atime, mtime, access mode and uid/gid, where
230errors are being ignored.
231
232=cut
233
234sub aio_move($$$) {
235 my ($src, $dst, $cb) = @_;
236
237 my $grp = aio_group $cb;
238
239 add $grp aio_rename $src, $dst, sub {
240 if ($_[0] && $! == EXDEV) {
241 add $grp aio_open $src, O_RDONLY, 0, sub {
242 if (my $src_fh = $_[0]) {
243 my @stat = stat $src_fh;
244
245 add $grp aio_open $dst, O_WRONLY, 0200, sub {
246 if (my $dst_fh = $_[0]) {
247 add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
248 close $src_fh;
249
250 if ($_[0] == $stat[7]) {
251 utime $stat[8], $stat[9], $dst;
252 chmod $stat[2] & 07777, $dst_fh;
253 chown $stat[4], $stat[5], $dst_fh;
254 close $dst_fh;
255
256 add $grp aio_unlink $src, sub {
257 $grp->result ($_[0]);
258 };
259 } else {
260 my $errno = $!;
261 add $grp aio_unlink $dst, sub {
262 $! = $errno;
263 $grp->result (-1);
264 };
265 }
266 };
267 } else {
268 $grp->result (-1);
269 }
270 },
271
272 } else {
273 $grp->result (-1);
274 }
275 };
276 } else {
277 $grp->result ($_[0]);
278 }
279 };
280
281 $grp
282}
283 331
284=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval) 332=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval)
285 333
286Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts 334Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts
287reading at byte offset C<$in_offset>, and starts writing at the current 335reading at byte offset C<$in_offset>, and starts writing at the current
343=item aio_unlink $pathname, $callback->($status) 391=item aio_unlink $pathname, $callback->($status)
344 392
345Asynchronously unlink (delete) a file and call the callback with the 393Asynchronously unlink (delete) a file and call the callback with the
346result code. 394result code.
347 395
396=item aio_mknod $path, $mode, $dev, $callback->($status)
397
398[EXPERIMENTAL]
399
400Asynchronously create a device node (or fifo). See mknod(2).
401
402The only (POSIX-) portable way of calling this function is:
403
404 aio_mknod $path, IO::AIO::S_IFIFO | $mode, 0, sub { ...
405
348=item aio_link $srcpath, $dstpath, $callback->($status) 406=item aio_link $srcpath, $dstpath, $callback->($status)
349 407
350Asynchronously create a new link to the existing object at C<$srcpath> at 408Asynchronously create a new link to the existing object at C<$srcpath> at
351the path C<$dstpath> and call the callback with the result code. 409the path C<$dstpath> and call the callback with the result code.
352 410
372sorted, and will B<NOT> include the C<.> and C<..> entries. 430sorted, and will B<NOT> include the C<.> and C<..> entries.
373 431
374The callback a single argument which is either C<undef> or an array-ref 432The callback a single argument which is either C<undef> or an array-ref
375with the filenames. 433with the filenames.
376 434
435=item aio_copy $srcpath, $dstpath, $callback->($status)
436
437Try to copy the I<file> (directories not supported as either source or
438destination) from C<$srcpath> to C<$dstpath> and call the callback with
439the C<0> (error) or C<-1> ok.
440
441This is a composite request that it creates the destination file with
442mode 0200 and copies the contents of the source file into it using
443C<aio_sendfile>, followed by restoring atime, mtime, access mode and
444uid/gid, in that order.
445
446If an error occurs, the partial destination file will be unlinked, if
447possible, except when setting atime, mtime, access mode and uid/gid, where
448errors are being ignored.
449
450=cut
451
452sub aio_copy($$;$) {
453 my ($src, $dst, $cb) = @_;
454
455 my $pri = aioreq_pri;
456 my $grp = aio_group $cb;
457
458 aioreq_pri $pri;
459 add $grp aio_open $src, O_RDONLY, 0, sub {
460 if (my $src_fh = $_[0]) {
461 my @stat = stat $src_fh;
462
463 aioreq_pri $pri;
464 add $grp aio_open $dst, O_CREAT | O_WRONLY | O_TRUNC, 0200, sub {
465 if (my $dst_fh = $_[0]) {
466 aioreq_pri $pri;
467 add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
468 if ($_[0] == $stat[7]) {
469 $grp->result (0);
470 close $src_fh;
471
472 # those should not normally block. should. should.
473 utime $stat[8], $stat[9], $dst;
474 chmod $stat[2] & 07777, $dst_fh;
475 chown $stat[4], $stat[5], $dst_fh;
476 close $dst_fh;
477 } else {
478 $grp->result (-1);
479 close $src_fh;
480 close $dst_fh;
481
482 aioreq $pri;
483 add $grp aio_unlink $dst;
484 }
485 };
486 } else {
487 $grp->result (-1);
488 }
489 },
490
491 } else {
492 $grp->result (-1);
493 }
494 };
495
496 $grp
497}
498
499=item aio_move $srcpath, $dstpath, $callback->($status)
500
501Try to move the I<file> (directories not supported as either source or
502destination) from C<$srcpath> to C<$dstpath> and call the callback with
503the C<0> (error) or C<-1> ok.
504
505This is a composite request that tries to rename(2) the file first. If
506rename files with C<EXDEV>, it copies the file with C<aio_copy> and, if
507that is successful, unlinking the C<$srcpath>.
508
509=cut
510
511sub aio_move($$;$) {
512 my ($src, $dst, $cb) = @_;
513
514 my $pri = aioreq_pri;
515 my $grp = aio_group $cb;
516
517 aioreq_pri $pri;
518 add $grp aio_rename $src, $dst, sub {
519 if ($_[0] && $! == EXDEV) {
520 aioreq_pri $pri;
521 add $grp aio_copy $src, $dst, sub {
522 $grp->result ($_[0]);
523
524 if (!$_[0]) {
525 aioreq_pri $pri;
526 add $grp aio_unlink $src;
527 }
528 };
529 } else {
530 $grp->result ($_[0]);
531 }
532 };
533
534 $grp
535}
536
377=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) 537=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs)
378 538
379Scans a directory (similar to C<aio_readdir>) but additionally tries to 539Scans a directory (similar to C<aio_readdir>) but additionally tries to
380separate the entries of directory C<$path> into two sets of names, ones 540efficiently separate the entries of directory C<$path> into two sets of
381you can recurse into (directories or links to them), and ones you cannot 541names, directories you can recurse into (directories), and ones you cannot
382recurse into (everything else). 542recurse into (everything else, including symlinks to directories).
383 543
384C<aio_scandir> is a composite request that creates of many sub requests_ 544C<aio_scandir> is a composite request that creates of many sub requests_
385C<$maxreq> specifies the maximum number of outstanding aio requests that 545C<$maxreq> specifies the maximum number of outstanding aio requests that
386this function generates. If it is C<< <= 0 >>, then a suitable default 546this function generates. If it is C<< <= 0 >>, then a suitable default
387will be chosen (currently 6). 547will be chosen (currently 4).
388 548
389On error, the callback is called without arguments, otherwise it receives 549On error, the callback is called without arguments, otherwise it receives
390two array-refs with path-relative entry names. 550two array-refs with path-relative entry names.
391 551
392Example: 552Example:
429=cut 589=cut
430 590
431sub aio_scandir($$$) { 591sub aio_scandir($$$) {
432 my ($path, $maxreq, $cb) = @_; 592 my ($path, $maxreq, $cb) = @_;
433 593
594 my $pri = aioreq_pri;
595
434 my $grp = aio_group $cb; 596 my $grp = aio_group $cb;
435 597
436 $maxreq = 6 if $maxreq <= 0; 598 $maxreq = 4 if $maxreq <= 0;
437 599
438 # stat once 600 # stat once
601 aioreq_pri $pri;
439 add $grp aio_stat $path, sub { 602 add $grp aio_stat $path, sub {
440 return $grp->result () if $_[0]; 603 return $grp->result () if $_[0];
441 my $now = time; 604 my $now = time;
442 my $hash1 = join ":", (stat _)[0,1,3,7,9]; 605 my $hash1 = join ":", (stat _)[0,1,3,7,9];
443 606
444 # read the directory entries 607 # read the directory entries
608 aioreq_pri $pri;
445 add $grp aio_readdir $path, sub { 609 add $grp aio_readdir $path, sub {
446 my $entries = shift 610 my $entries = shift
447 or return $grp->result (); 611 or return $grp->result ();
448 612
449 # stat the dir another time 613 # stat the dir another time
614 aioreq_pri $pri;
450 add $grp aio_stat $path, sub { 615 add $grp aio_stat $path, sub {
451 my $hash2 = join ":", (stat _)[0,1,3,7,9]; 616 my $hash2 = join ":", (stat _)[0,1,3,7,9];
452 617
453 my $ndirs; 618 my $ndirs;
454 619
469 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length], 634 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length],
470 @$entries]; 635 @$entries];
471 636
472 my (@dirs, @nondirs); 637 my (@dirs, @nondirs);
473 638
474 my ($statcb, $schedcb);
475 my $nreq = 0;
476
477 my $statgrp = add $grp aio_group; 639 my $statgrp = add $grp aio_group sub {
640 $grp->result (\@dirs, \@nondirs);
641 };
478 642
479 $schedcb = sub { 643 limit $statgrp $maxreq;
480 if (@$entries) { 644 feed $statgrp sub {
481 if ($nreq < $maxreq) { 645 return unless @$entries;
482 my $ent = pop @$entries; 646 my $entry = pop @$entries;
647
648 aioreq_pri $pri;
649 add $statgrp aio_stat "$path/$entry/.", sub {
650 if ($_[0] < 0) {
651 push @nondirs, $entry;
652 } else {
653 # need to check for real directory
654 aioreq_pri $pri;
655 add $statgrp aio_lstat "$path/$entry", sub {
656 if (-d _) {
657 push @dirs, $entry;
658
659 unless (--$ndirs) {
660 push @nondirs, @$entries;
661 feed $statgrp;
662 }
663 } else {
664 push @nondirs, $entry;
665 }
483 $nreq++; 666 }
484 add $statgrp aio_stat "$path/$ent/.", sub { $statcb->($_[0], $ent) };
485 } 667 }
486 } elsif (!$nreq) {
487 # finished
488 $statgrp->cancel;
489 undef $statcb;
490 undef $schedcb;
491 $grp->result (\@dirs, \@nondirs);
492 } 668 };
493 }; 669 };
494 $statcb = sub {
495 my ($status, $entry) = @_;
496
497 if ($status < 0) {
498 $nreq--;
499 push @nondirs, $entry;
500 &$schedcb;
501 } else {
502 # need to check for real directory
503 add $grp aio_lstat "$path/$entry", sub {
504 $nreq--;
505
506 if (-d _) {
507 push @dirs, $entry;
508
509 if (!--$ndirs) {
510 push @nondirs, @$entries;
511 $entries = [];
512 }
513 } else {
514 push @nondirs, $entry;
515 }
516
517 &$schedcb;
518 }
519 }
520 };
521
522 &$schedcb while @$entries && $nreq < $maxreq;
523 }; 670 };
524 }; 671 };
525 }; 672 };
526 673
527 $grp 674 $grp
539 686
540If this call isn't available because your OS lacks it or it couldn't be 687If this call isn't available because your OS lacks it or it couldn't be
541detected, it will be emulated by calling C<fsync> instead. 688detected, it will be emulated by calling C<fsync> instead.
542 689
543=item aio_group $callback->(...) 690=item aio_group $callback->(...)
544
545[EXPERIMENTAL]
546 691
547This is a very special aio request: Instead of doing something, it is a 692This is a very special aio request: Instead of doing something, it is a
548container for other aio requests, which is useful if you want to bundle 693container for other aio requests, which is useful if you want to bundle
549many requests into a single, composite, request with a definite callback 694many requests into a single, composite, request with a definite callback
550and the ability to cancel the whole request with its subrequests. 695and the ability to cancel the whole request with its subrequests.
591=head2 IO::AIO::REQ CLASS 736=head2 IO::AIO::REQ CLASS
592 737
593All non-aggregate C<aio_*> functions return an object of this class when 738All non-aggregate C<aio_*> functions return an object of this class when
594called in non-void context. 739called in non-void context.
595 740
596A request always moves through the following five states in its lifetime,
597in order: B<ready> (request has been created, but has not been executed
598yet), B<execute> (request is currently being executed), B<pending>
599(request has been executed but callback has not been called yet),
600B<result> (results are being processed synchronously, includes calling the
601callback) and B<done> (request has reached the end of its lifetime and
602holds no resources anymore).
603
604=over 4 741=over 4
605 742
606=item cancel $req 743=item cancel $req
607 744
608Cancels the request, if possible. Has the effect of skipping execution 745Cancels the request, if possible. Has the effect of skipping execution
661=item * They can also can also be added to other IO::AIO::GRP objects. 798=item * They can also can also be added to other IO::AIO::GRP objects.
662 799
663=item * You must not add requests to a group from within the group callback (or 800=item * You must not add requests to a group from within the group callback (or
664any later time). 801any later time).
665 802
666=item * This does not harmonise well with C<max_outstanding>, so best do
667not combine C<aio_group> with it. Groups and feeders are recommended for
668this kind of concurrency-limiting.
669
670=back 803=back
671 804
672Their lifetime, simplified, looks like this: when they are empty, they 805Their lifetime, simplified, looks like this: when they are empty, they
673will finish very quickly. If they contain only requests that are in the 806will finish very quickly. If they contain only requests that are in the
674C<done> state, they will also finish. Otherwise they will continue to 807C<done> state, they will also finish. Otherwise they will continue to
689be added, including other groups, as long as you do not create circular 822be added, including other groups, as long as you do not create circular
690dependencies. 823dependencies.
691 824
692Returns all its arguments. 825Returns all its arguments.
693 826
827=item $grp->cancel_subs
828
829Cancel all subrequests and clears any feeder, but not the group request
830itself. Useful when you queued a lot of events but got a result early.
831
694=item $grp->result (...) 832=item $grp->result (...)
695 833
696Set the result value(s) that will be passed to the group callback when all 834Set the result value(s) that will be passed to the group callback when all
697subrequests have finished. By default, no argument will be passed. 835subrequests have finished and set thre groups errno to the current value
836of errno (just like calling C<errno> without an error number). By default,
837no argument will be passed and errno is zero.
838
839=item $grp->errno ([$errno])
840
841Sets the group errno value to C<$errno>, or the current value of errno
842when the argument is missing.
843
844Every aio request has an associated errno value that is restored when
845the callback is invoked. This method lets you change this value from its
846default (0).
847
848Calling C<result> will also set errno, so make sure you either set C<$!>
849before the call to C<result>, or call c<errno> after it.
698 850
699=item feed $grp $callback->($grp) 851=item feed $grp $callback->($grp)
700
701[VERY EXPERIMENTAL]
702 852
703Sets a feeder/generator on this group: every group can have an attached 853Sets a feeder/generator on this group: every group can have an attached
704generator that generates requests if idle. The idea behind this is that, 854generator that generates requests if idle. The idea behind this is that,
705although you could just queue as many requests as you want in a group, 855although you could just queue as many requests as you want in a group,
706this might starve other requests for a potentially long time. For 856this might starve other requests for a potentially long time. For
743 893
744=back 894=back
745 895
746=head2 SUPPORT FUNCTIONS 896=head2 SUPPORT FUNCTIONS
747 897
898=head3 EVENT PROCESSING AND EVENT LOOP INTEGRATION
899
748=over 4 900=over 4
749 901
750=item $fileno = IO::AIO::poll_fileno 902=item $fileno = IO::AIO::poll_fileno
751 903
752Return the I<request result pipe file descriptor>. This filehandle must be 904Return the I<request result pipe file descriptor>. This filehandle must be
756 908
757See C<poll_cb> for an example. 909See C<poll_cb> for an example.
758 910
759=item IO::AIO::poll_cb 911=item IO::AIO::poll_cb
760 912
761Process all outstanding events on the result pipe. You have to call this 913Process some outstanding events on the result pipe. You have to call this
762regularly. Returns the number of events processed. Returns immediately 914regularly. Returns the number of events processed. Returns immediately
763when no events are outstanding. 915when no events are outstanding. The amount of events processed depends on
916the settings of C<IO::AIO::max_poll_req> and C<IO::AIO::max_poll_time>.
917
918If not all requests were processed for whatever reason, the filehandle
919will still be ready when C<poll_cb> returns.
764 920
765Example: Install an Event watcher that automatically calls 921Example: Install an Event watcher that automatically calls
766IO::AIO::poll_cb with high priority: 922IO::AIO::poll_cb with high priority:
767 923
768 Event->io (fd => IO::AIO::poll_fileno, 924 Event->io (fd => IO::AIO::poll_fileno,
769 poll => 'r', async => 1, 925 poll => 'r', async => 1,
770 cb => \&IO::AIO::poll_cb); 926 cb => \&IO::AIO::poll_cb);
771 927
928=item IO::AIO::max_poll_reqs $nreqs
929
930=item IO::AIO::max_poll_time $seconds
931
932These set the maximum number of requests (default C<0>, meaning infinity)
933that are being processed by C<IO::AIO::poll_cb> in one call, respectively
934the maximum amount of time (default C<0>, meaning infinity) spent in
935C<IO::AIO::poll_cb> to process requests (more correctly the mininum amount
936of time C<poll_cb> is allowed to use).
937
938Setting these is useful if you want to ensure some level of
939interactiveness when perl is not fast enough to process all requests in
940time.
941
942For interactive programs, values such as C<0.01> to C<0.1> should be fine.
943
944Example: Install an Event watcher that automatically calls
945IO::AIO::poll_some with low priority, to ensure that other parts of the
946program get the CPU sometimes even under high AIO load.
947
948 # try not to spend much more than 0.1s in poll_cb
949 IO::AIO::max_poll_time 0.1;
950
951 # use a low priority so other tasks have priority
952 Event->io (fd => IO::AIO::poll_fileno,
953 poll => 'r', nice => 1,
954 cb => &IO::AIO::poll_cb);
955
772=item IO::AIO::poll_wait 956=item IO::AIO::poll_wait
773 957
774Wait till the result filehandle becomes ready for reading (simply does a 958Wait till the result filehandle becomes ready for reading (simply does a
775C<select> on the filehandle. This is useful if you want to synchronously wait 959C<select> on the filehandle. This is useful if you want to synchronously
776for some requests to finish). 960wait for some requests to finish).
777 961
778See C<nreqs> for an example. 962See C<nreqs> for an example.
779 963
964=item IO::AIO::poll
965
966Waits until some requests have been handled.
967
968Strictly equivalent to:
969
970 IO::AIO::poll_wait, IO::AIO::poll_cb
971 if IO::AIO::nreqs;
972
780=item IO::AIO::nreqs 973=item IO::AIO::flush
781 974
782Returns the number of requests currently outstanding (i.e. for which their 975Wait till all outstanding AIO requests have been handled.
783callback has not been invoked yet).
784 976
785Example: wait till there are no outstanding requests anymore: 977Strictly equivalent to:
786 978
787 IO::AIO::poll_wait, IO::AIO::poll_cb 979 IO::AIO::poll_wait, IO::AIO::poll_cb
788 while IO::AIO::nreqs; 980 while IO::AIO::nreqs;
789 981
790=item IO::AIO::flush 982=head3 CONTROLLING THE NUMBER OF THREADS
791
792Wait till all outstanding AIO requests have been handled.
793
794Strictly equivalent to:
795
796 IO::AIO::poll_wait, IO::AIO::poll_cb
797 while IO::AIO::nreqs;
798
799=item IO::AIO::poll
800
801Waits until some requests have been handled.
802
803Strictly equivalent to:
804
805 IO::AIO::poll_wait, IO::AIO::poll_cb
806 if IO::AIO::nreqs;
807 983
808=item IO::AIO::min_parallel $nthreads 984=item IO::AIO::min_parallel $nthreads
809 985
810Set the minimum number of AIO threads to C<$nthreads>. The current 986Set the minimum number of AIO threads to C<$nthreads>. The current
811default is C<8>, which means eight asynchronous operations can execute 987default is C<8>, which means eight asynchronous operations can execute
812concurrently at any one time (the number of outstanding requests, 988concurrently at any one time (the number of outstanding requests,
813however, is unlimited). 989however, is unlimited).
814 990
815IO::AIO starts threads only on demand, when an AIO request is queued and 991IO::AIO starts threads only on demand, when an AIO request is queued and
816no free thread exists. 992no free thread exists. Please note that queueing up a hundred requests can
993create demand for a hundred threads, even if it turns out that everything
994is in the cache and could have been processed faster by a single thread.
817 995
818It is recommended to keep the number of threads relatively low, as some 996It is recommended to keep the number of threads relatively low, as some
819Linux kernel versions will scale negatively with the number of threads 997Linux kernel versions will scale negatively with the number of threads
820(higher parallelity => MUCH higher latency). With current Linux 2.6 998(higher parallelity => MUCH higher latency). With current Linux 2.6
821versions, 4-32 threads should be fine. 999versions, 4-32 threads should be fine.
835This module automatically runs C<max_parallel 0> at program end, to ensure 1013This module automatically runs C<max_parallel 0> at program end, to ensure
836that all threads are killed and that there are no outstanding requests. 1014that all threads are killed and that there are no outstanding requests.
837 1015
838Under normal circumstances you don't need to call this function. 1016Under normal circumstances you don't need to call this function.
839 1017
1018=item IO::AIO::max_idle $nthreads
1019
1020Limit the number of threads (default: 4) that are allowed to idle (i.e.,
1021threads that did not get a request to process within 10 seconds). That
1022means if a thread becomes idle while C<$nthreads> other threads are also
1023idle, it will free its resources and exit.
1024
1025This is useful when you allow a large number of threads (e.g. 100 or 1000)
1026to allow for extremely high load situations, but want to free resources
1027under normal circumstances (1000 threads can easily consume 30MB of RAM).
1028
1029The default is probably ok in most situations, especially if thread
1030creation is fast. If thread creation is very slow on your system you might
1031want to use larger values.
1032
840=item $oldnreqs = IO::AIO::max_outstanding $nreqs 1033=item $oldmaxreqs = IO::AIO::max_outstanding $maxreqs
841 1034
842[DEPRECATED] 1035This is a very bad function to use in interactive programs because it
1036blocks, and a bad way to reduce concurrency because it is inexact: Better
1037use an C<aio_group> together with a feed callback.
843 1038
844Sets the maximum number of outstanding requests to C<$nreqs>. If you 1039Sets the maximum number of outstanding requests to C<$nreqs>. If you
845try to queue up more than this number of requests, the caller will block until 1040to queue up more than this number of requests, the next call to the
846some requests have been handled. 1041C<poll_cb> (and C<poll_some> and other functions calling C<poll_cb>)
1042function will block until the limit is no longer exceeded.
847 1043
848The default is very large, so normally there is no practical limit. If you 1044The default value is very large, so there is no practical limit on the
849queue up many requests in a loop it often improves speed if you set 1045number of outstanding requests.
850this to a relatively low number, such as C<100>.
851 1046
852This function does not work well together with C<aio_group>'s, and their 1047You can still queue as many requests as you want. Therefore,
853feeder interface is better suited to limiting concurrency, so do not use 1048C<max_oustsanding> is mainly useful in simple scripts (with low values) or
854this function. 1049as a stop gap to shield against fatal memory overflow (with large values).
855 1050
856Under normal circumstances you don't need to call this function. 1051=head3 STATISTICAL INFORMATION
1052
1053=item IO::AIO::nreqs
1054
1055Returns the number of requests currently in the ready, execute or pending
1056states (i.e. for which their callback has not been invoked yet).
1057
1058Example: wait till there are no outstanding requests anymore:
1059
1060 IO::AIO::poll_wait, IO::AIO::poll_cb
1061 while IO::AIO::nreqs;
1062
1063=item IO::AIO::nready
1064
1065Returns the number of requests currently in the ready state (not yet
1066executed).
1067
1068=item IO::AIO::npending
1069
1070Returns the number of requests currently in the pending state (executed,
1071but not yet processed by poll_cb).
857 1072
858=back 1073=back
859 1074
860=cut 1075=cut
861 1076
876} 1091}
877 1092
878min_parallel 8; 1093min_parallel 8;
879 1094
880END { 1095END {
881 max_parallel 0; 1096 min_parallel 1;
882} 1097 flush;
1098};
883 1099
8841; 11001;
885 1101
886=head2 FORK BEHAVIOUR 1102=head2 FORK BEHAVIOUR
887 1103
888This module should do "the right thing" when the process using it forks: 1104This module should do "the right thing" when the process using it forks:
889 1105
890Before the fork, IO::AIO enters a quiescent state where no requests 1106Before the fork, IO::AIO enters a quiescent state where no requests
891can be added in other threads and no results will be processed. After 1107can be added in other threads and no results will be processed. After
892the fork the parent simply leaves the quiescent state and continues 1108the fork the parent simply leaves the quiescent state and continues
893request/result processing, while the child clears the request/result 1109request/result processing, while the child frees the request/result queue
894queue (so the requests started before the fork will only be handled in 1110(so that the requests started before the fork will only be handled in the
895the parent). Threads will be started on demand until the limit ste in the 1111parent). Threads will be started on demand until the limit set in the
896parent process has been reached again. 1112parent process has been reached again.
897 1113
898In short: the parent will, after a short pause, continue as if fork had 1114In short: the parent will, after a short pause, continue as if fork had
899not been called, while the child will act as if IO::AIO has not been used 1115not been called, while the child will act as if IO::AIO has not been used
900yet. 1116yet.
901 1117
902=head2 MEMORY USAGE 1118=head2 MEMORY USAGE
903 1119
1120Per-request usage:
1121
904Each aio request uses - depending on your architecture - around 128 bytes 1122Each aio request uses - depending on your architecture - around 100-200
905of memory. In addition, stat requests need a stat buffer (possibly a few 1123bytes of memory. In addition, stat requests need a stat buffer (possibly
906hundred bytes). Perl scalars and other data passed into aio requests will 1124a few hundred bytes), readdir requires a result buffer and so on. Perl
907also be locked. 1125scalars and other data passed into aio requests will also be locked and
1126will consume memory till the request has entered the done state.
908 1127
909This is now awfully much, so queuing lots of requests is not usually a 1128This is now awfully much, so queuing lots of requests is not usually a
910problem. 1129problem.
911 1130
912Each thread needs a stack area which is usually around 16k, sometimes much 1131Per-thread usage:
913larger, depending on the OS. 1132
1133In the execution phase, some aio requests require more memory for
1134temporary buffers, and each thread requires a stack and other data
1135structures (usually around 16k-128k, depending on the OS).
1136
1137=head1 KNOWN BUGS
1138
1139Known bugs will be fixed in the next release.
914 1140
915=head1 SEE ALSO 1141=head1 SEE ALSO
916 1142
917L<Coro::AIO>. 1143L<Coro::AIO>.
918 1144

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines