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.88 by root, Sun Oct 29 01:50:29 2006 UTC vs.
Revision 1.117 by root, Sat Oct 6 14:05:19 2007 UTC

5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 use IO::AIO; 7 use IO::AIO;
8 8
9 aio_open "/etc/passwd", O_RDONLY, 0, sub { 9 aio_open "/etc/passwd", O_RDONLY, 0, sub {
10 my ($fh) = @_; 10 my $fh = shift
11 or die "/etc/passwd: $!";
11 ... 12 ...
12 }; 13 };
13 14
14 aio_unlink "/tmp/file", sub { }; 15 aio_unlink "/tmp/file", sub { };
15 16
61etc.), but can also be used to easily do operations in parallel that are 62etc.), 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 63normally 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 64on a RAID volume or over NFS when you do a number of stat operations
64concurrently. 65concurrently.
65 66
66While this works on all types of file descriptors (for example sockets), 67While most of this works on all types of file descriptors (for
67using these functions on file descriptors that support nonblocking 68example sockets), using these functions on file descriptors that
68operation (again, sockets, pipes etc.) is very inefficient. Use an event 69support nonblocking operation (again, sockets, pipes etc.) is very
69loop for that (such as the L<Event|Event> module): IO::AIO will naturally 70inefficient. Use an event loop for that (such as the L<Event|Event>
70fit into such an event loop itself. 71module): IO::AIO will naturally fit into such an event loop itself.
71 72
72In this version, a number of threads are started that execute your 73In this version, a number of threads are started that execute your
73requests and signal their completion. You don't need thread support 74requests and signal their completion. You don't need thread support
74in perl, and the threads created by this module will not be visible 75in perl, and the threads created by this module will not be visible
75to perl. In the future, this module might make use of the native aio 76to perl. In the future, this module might make use of the native aio
77not well-supported or restricted (GNU/Linux doesn't allow them on normal 78not well-supported or restricted (GNU/Linux doesn't allow them on normal
78files currently, for example), and they would only support aio_read and 79files currently, for example), and they would only support aio_read and
79aio_write, so the remaining functionality would have to be implemented 80aio_write, so the remaining functionality would have to be implemented
80using threads anyway. 81using threads anyway.
81 82
82Although the module will work with in the presence of other (Perl-) 83Although the module will work in the presence of other (Perl-) threads,
83threads, it is currently not reentrant in any way, so use appropriate 84it is currently not reentrant in any way, so use appropriate locking
84locking yourself, always call C<poll_cb> from within the same thread, or 85yourself, always call C<poll_cb> from within the same thread, or never
85never call C<poll_cb> (or other C<aio_> functions) recursively. 86call C<poll_cb> (or other C<aio_> functions) recursively.
86 87
87=head2 EXAMPLE 88=head2 EXAMPLE
88 89
89This is a simple example that uses the Event module and loads 90This is a simple example that uses the Event module and loads
90F</etc/passwd> asynchronously: 91F</etc/passwd> asynchronously:
98 poll => 'r', 99 poll => 'r',
99 cb => \&IO::AIO::poll_cb); 100 cb => \&IO::AIO::poll_cb);
100 101
101 # queue the request to open /etc/passwd 102 # queue the request to open /etc/passwd
102 aio_open "/etc/passwd", O_RDONLY, 0, sub { 103 aio_open "/etc/passwd", O_RDONLY, 0, sub {
103 my $fh = $_[0] 104 my $fh = shift
104 or die "error while opening: $!"; 105 or die "error while opening: $!";
105 106
106 # stat'ing filehandles is generally non-blocking 107 # stat'ing filehandles is generally non-blocking
107 my $size = -s $fh; 108 my $size = -s $fh;
108 109
182 183
183=cut 184=cut
184 185
185package IO::AIO; 186package IO::AIO;
186 187
188use Carp ();
189
187no warnings; 190no warnings;
188use strict 'vars'; 191use strict 'vars';
189 192
190use base 'Exporter'; 193use base 'Exporter';
191 194
192BEGIN { 195BEGIN {
193 our $VERSION = '2.1'; 196 our $VERSION = '2.51';
194 197
195 our @AIO_REQ = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat 198 our @AIO_REQ = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat
196 aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink 199 aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink
197 aio_fsync aio_fdatasync aio_readahead aio_rename aio_link aio_move 200 aio_readlink aio_fsync aio_fdatasync aio_readahead aio_rename aio_link
198 aio_copy aio_group aio_nop aio_mknod); 201 aio_move aio_copy aio_group aio_nop aio_mknod aio_load aio_rmtree aio_mkdir
202 aio_chown aio_chmod aio_utime aio_truncate);
199 our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice)); 203 our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice aio_block));
200 our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush 204 our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush
201 min_parallel max_parallel max_idle 205 min_parallel max_parallel max_idle
202 nreqs nready npending nthreads 206 nreqs nready npending nthreads
203 max_poll_time max_poll_reqs); 207 max_poll_time max_poll_reqs);
204 208
269 aio_read $_[0], ..., sub { 273 aio_read $_[0], ..., sub {
270 ... 274 ...
271 }; 275 };
272 }; 276 };
273 277
278
274=item aioreq_nice $pri_adjust 279=item aioreq_nice $pri_adjust
275 280
276Similar to C<aioreq_pri>, but subtracts the given value from the current 281Similar to C<aioreq_pri>, but subtracts the given value from the current
277priority, so the effect is cumulative. 282priority, so the effect is cumulative.
283
278 284
279=item aio_open $pathname, $flags, $mode, $callback->($fh) 285=item aio_open $pathname, $flags, $mode, $callback->($fh)
280 286
281Asynchronously open or create a file and call the callback with a newly 287Asynchronously open or create a file and call the callback with a newly
282created filehandle for the file. 288created filehandle for the file.
288list. They are the same as used by C<sysopen>. 294list. They are the same as used by C<sysopen>.
289 295
290Likewise, C<$mode> specifies the mode of the newly created file, if it 296Likewise, C<$mode> specifies the mode of the newly created file, if it
291didn't exist and C<O_CREAT> has been given, just like perl's C<sysopen>, 297didn't exist and C<O_CREAT> has been given, just like perl's C<sysopen>,
292except that it is mandatory (i.e. use C<0> if you don't create new files, 298except that it is mandatory (i.e. use C<0> if you don't create new files,
293and C<0666> or C<0777> if you do). 299and C<0666> or C<0777> if you do). Note that the C<$mode> will be modified
300by the umask in effect then the request is being executed, so better never
301change the umask.
294 302
295Example: 303Example:
296 304
297 aio_open "/etc/passwd", O_RDONLY, 0, sub { 305 aio_open "/etc/passwd", O_RDONLY, 0, sub {
298 if ($_[0]) { 306 if ($_[0]) {
301 } else { 309 } else {
302 die "open failed: $!\n"; 310 die "open failed: $!\n";
303 } 311 }
304 }; 312 };
305 313
314
306=item aio_close $fh, $callback->($status) 315=item aio_close $fh, $callback->($status)
307 316
308Asynchronously close a file and call the callback with the result 317Asynchronously close a file and call the callback with the result
309code. I<WARNING:> although accepted, you should not pass in a perl 318code.
310filehandle here, as perl will likely close the file descriptor another
311time when the filehandle is destroyed. Normally, you can safely call perls
312C<close> or just let filehandles go out of scope.
313 319
314This is supposed to be a bug in the API, so that might change. It's 320Unfortunately, you can't do this to perl. Perl I<insists> very strongly on
315therefore best to avoid this function. 321closing the file descriptor associated with the filehandle itself. Here is
322what aio_close will try:
323
324 1. dup()licate the fd
325 2. asynchronously close() the duplicated fd
326 3. dup()licate the fd once more
327 4. let perl close() the filehandle
328 5. asynchronously close the duplicated fd
329
330The idea is that the first close() flushes stuff to disk that closing an
331fd will flush, so when perl closes the fd, nothing much will need to be
332flushed. The second async. close() will then flush stuff to disk that
333closing the last fd to the file will flush.
334
335Just FYI, SuSv3 has this to say on close:
336
337 All outstanding record locks owned by the process on the file
338 associated with the file descriptor shall be removed.
339
340 If fildes refers to a socket, close() shall cause the socket to be
341 destroyed. ... close() shall block for up to the current linger
342 interval until all data is transmitted.
343 [this actually sounds like a specification bug, but who knows]
344
345And at least Linux additionally actually flushes stuff on every close,
346even when the file itself is still open.
347
348Sounds enourmously inefficient and complicated? Yes... please show me how
349to nuke perl's fd out of existence...
350
351=cut
352
353sub aio_close($;$) {
354 aio_block {
355 my ($fh, $cb) = @_;
356
357 my $pri = aioreq_pri;
358 my $grp = aio_group $cb;
359
360 my $fd = fileno $fh;
361
362 defined $fd or Carp::croak "aio_close called with fd-less filehandle";
363
364 # if the dups fail we will simply get EBADF
365 my $fd2 = _dup $fd;
366 aioreq_pri $pri;
367 add $grp _aio_close $fd2, sub {
368 my $fd2 = _dup $fd;
369 close $fh;
370 aioreq_pri $pri;
371 add $grp _aio_close $fd2, sub {
372 $grp->result ($_[0]);
373 };
374 };
375
376 $grp
377 }
378}
379
316 380
317=item aio_read $fh,$offset,$length, $data,$dataoffset, $callback->($retval) 381=item aio_read $fh,$offset,$length, $data,$dataoffset, $callback->($retval)
318 382
319=item aio_write $fh,$offset,$length, $data,$dataoffset, $callback->($retval) 383=item aio_write $fh,$offset,$length, $data,$dataoffset, $callback->($retval)
320 384
321Reads or writes C<length> bytes from the specified C<fh> and C<offset> 385Reads or writes C<$length> bytes from the specified C<$fh> and C<$offset>
322into the scalar given by C<data> and offset C<dataoffset> and calls the 386into the scalar given by C<$data> and offset C<$dataoffset> and calls the
323callback without the actual number of bytes read (or -1 on error, just 387callback without the actual number of bytes read (or -1 on error, just
324like the syscall). 388like the syscall).
325 389
390If C<$offset> is undefined, then the current file descriptor offset will
391be used (and updated), otherwise the file descriptor offset will not be
392changed by these calls.
393
394If C<$length> is undefined in C<aio_write>, use the remaining length of C<$data>.
395
396If C<$dataoffset> is less than zero, it will be counted from the end of
397C<$data>.
398
326The C<$data> scalar I<MUST NOT> be modified in any way while the request 399The C<$data> scalar I<MUST NOT> be modified in any way while the request
327is outstanding. Modifying it can result in segfaults or WW3 (if the 400is outstanding. Modifying it can result in segfaults or World War III (if
328necessary/optional hardware is installed). 401the necessary/optional hardware is installed).
329 402
330Example: Read 15 bytes at offset 7 into scalar C<$buffer>, starting at 403Example: Read 15 bytes at offset 7 into scalar C<$buffer>, starting at
331offset C<0> within the scalar: 404offset C<0> within the scalar:
332 405
333 aio_read $fh, 7, 15, $buffer, 0, sub { 406 aio_read $fh, 7, 15, $buffer, 0, sub {
334 $_[0] > 0 or die "read error: $!"; 407 $_[0] > 0 or die "read error: $!";
335 print "read $_[0] bytes: <$buffer>\n"; 408 print "read $_[0] bytes: <$buffer>\n";
336 }; 409 };
410
337 411
338=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval) 412=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval)
339 413
340Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts 414Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts
341reading at byte offset C<$in_offset>, and starts writing at the current 415reading at byte offset C<$in_offset>, and starts writing at the current
355C<$in_fh> than are written, and there is no way to find out how many 429C<$in_fh> than are written, and there is no way to find out how many
356bytes have been read from C<aio_sendfile> alone, as C<aio_sendfile> only 430bytes have been read from C<aio_sendfile> alone, as C<aio_sendfile> only
357provides the number of bytes written to C<$out_fh>. Only if the result 431provides the number of bytes written to C<$out_fh>. Only if the result
358value equals C<$length> one can assume that C<$length> bytes have been 432value equals C<$length> one can assume that C<$length> bytes have been
359read. 433read.
434
360 435
361=item aio_readahead $fh,$offset,$length, $callback->($retval) 436=item aio_readahead $fh,$offset,$length, $callback->($retval)
362 437
363C<aio_readahead> populates the page cache with data from a file so that 438C<aio_readahead> populates the page cache with data from a file so that
364subsequent reads from that file will not block on disk I/O. The C<$offset> 439subsequent reads from that file will not block on disk I/O. The C<$offset>
370file. The current file offset of the file is left unchanged. 445file. The current file offset of the file is left unchanged.
371 446
372If that syscall doesn't exist (likely if your OS isn't Linux) it will be 447If that syscall doesn't exist (likely if your OS isn't Linux) it will be
373emulated by simply reading the data, which would have a similar effect. 448emulated by simply reading the data, which would have a similar effect.
374 449
450
375=item aio_stat $fh_or_path, $callback->($status) 451=item aio_stat $fh_or_path, $callback->($status)
376 452
377=item aio_lstat $fh, $callback->($status) 453=item aio_lstat $fh, $callback->($status)
378 454
379Works like perl's C<stat> or C<lstat> in void context. The callback will 455Works like perl's C<stat> or C<lstat> in void context. The callback will
392 aio_stat "/etc/passwd", sub { 468 aio_stat "/etc/passwd", sub {
393 $_[0] and die "stat failed: $!"; 469 $_[0] and die "stat failed: $!";
394 print "size is ", -s _, "\n"; 470 print "size is ", -s _, "\n";
395 }; 471 };
396 472
473
474=item aio_utime $fh_or_path, $atime, $mtime, $callback->($status)
475
476Works like perl's C<utime> function (including the special case of $atime
477and $mtime being undef). Fractional times are supported if the underlying
478syscalls support them.
479
480When called with a pathname, uses utimes(2) if available, otherwise
481utime(2). If called on a file descriptor, uses futimes(2) if available,
482otherwise returns ENOSYS, so this is not portable.
483
484Examples:
485
486 # set atime and mtime to current time (basically touch(1)):
487 aio_utime "path", undef, undef;
488 # set atime to current time and mtime to beginning of the epoch:
489 aio_utime "path", time, undef; # undef==0
490
491
492=item aio_chown $fh_or_path, $uid, $gid, $callback->($status)
493
494Works like perl's C<chown> function, except that C<undef> for either $uid
495or $gid is being interpreted as "do not change" (but -1 can also be used).
496
497Examples:
498
499 # same as "chown root path" in the shell:
500 aio_chown "path", 0, -1;
501 # same as above:
502 aio_chown "path", 0, undef;
503
504
505=item aio_truncate $fh_or_path, $offset, $callback->($status)
506
507Works like truncate(2) or ftruncate(2).
508
509
510=item aio_chmod $fh_or_path, $mode, $callback->($status)
511
512Works like perl's C<chmod> function.
513
514
397=item aio_unlink $pathname, $callback->($status) 515=item aio_unlink $pathname, $callback->($status)
398 516
399Asynchronously unlink (delete) a file and call the callback with the 517Asynchronously unlink (delete) a file and call the callback with the
400result code. 518result code.
401 519
520
402=item aio_mknod $path, $mode, $dev, $callback->($status) 521=item aio_mknod $path, $mode, $dev, $callback->($status)
403 522
404[EXPERIMENTAL] 523[EXPERIMENTAL]
405 524
406Asynchronously create a device node (or fifo). See mknod(2). 525Asynchronously create a device node (or fifo). See mknod(2).
407 526
408The only (POSIX-) portable way of calling this function is: 527The only (POSIX-) portable way of calling this function is:
409 528
410 aio_mknod $path, IO::AIO::S_IFIFO | $mode, 0, sub { ... 529 aio_mknod $path, IO::AIO::S_IFIFO | $mode, 0, sub { ...
530
411 531
412=item aio_link $srcpath, $dstpath, $callback->($status) 532=item aio_link $srcpath, $dstpath, $callback->($status)
413 533
414Asynchronously create a new link to the existing object at C<$srcpath> at 534Asynchronously create a new link to the existing object at C<$srcpath> at
415the path C<$dstpath> and call the callback with the result code. 535the path C<$dstpath> and call the callback with the result code.
416 536
537
417=item aio_symlink $srcpath, $dstpath, $callback->($status) 538=item aio_symlink $srcpath, $dstpath, $callback->($status)
418 539
419Asynchronously create a new symbolic link to the existing object at C<$srcpath> at 540Asynchronously create a new symbolic link to the existing object at C<$srcpath> at
420the path C<$dstpath> and call the callback with the result code. 541the path C<$dstpath> and call the callback with the result code.
421 542
543
544=item aio_readlink $path, $callback->($link)
545
546Asynchronously read the symlink specified by C<$path> and pass it to
547the callback. If an error occurs, nothing or undef gets passed to the
548callback.
549
550
422=item aio_rename $srcpath, $dstpath, $callback->($status) 551=item aio_rename $srcpath, $dstpath, $callback->($status)
423 552
424Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as 553Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as
425rename(2) and call the callback with the result code. 554rename(2) and call the callback with the result code.
426 555
556
557=item aio_mkdir $pathname, $mode, $callback->($status)
558
559Asynchronously mkdir (create) a directory and call the callback with
560the result code. C<$mode> will be modified by the umask at the time the
561request is executed, so do not change your umask.
562
563
427=item aio_rmdir $pathname, $callback->($status) 564=item aio_rmdir $pathname, $callback->($status)
428 565
429Asynchronously rmdir (delete) a directory and call the callback with the 566Asynchronously rmdir (delete) a directory and call the callback with the
430result code. 567result code.
568
431 569
432=item aio_readdir $pathname, $callback->($entries) 570=item aio_readdir $pathname, $callback->($entries)
433 571
434Unlike the POSIX call of the same name, C<aio_readdir> reads an entire 572Unlike the POSIX call of the same name, C<aio_readdir> reads an entire
435directory (i.e. opendir + readdir + closedir). The entries will not be 573directory (i.e. opendir + readdir + closedir). The entries will not be
436sorted, and will B<NOT> include the C<.> and C<..> entries. 574sorted, and will B<NOT> include the C<.> and C<..> entries.
437 575
438The callback a single argument which is either C<undef> or an array-ref 576The callback a single argument which is either C<undef> or an array-ref
439with the filenames. 577with the filenames.
578
579
580=item aio_load $path, $data, $callback->($status)
581
582This is a composite request that tries to fully load the given file into
583memory. Status is the same as with aio_read.
584
585=cut
586
587sub aio_load($$;$) {
588 aio_block {
589 my ($path, undef, $cb) = @_;
590 my $data = \$_[1];
591
592 my $pri = aioreq_pri;
593 my $grp = aio_group $cb;
594
595 aioreq_pri $pri;
596 add $grp aio_open $path, O_RDONLY, 0, sub {
597 my $fh = shift
598 or return $grp->result (-1);
599
600 aioreq_pri $pri;
601 add $grp aio_read $fh, 0, (-s $fh), $$data, 0, sub {
602 $grp->result ($_[0]);
603 };
604 };
605
606 $grp
607 }
608}
440 609
441=item aio_copy $srcpath, $dstpath, $callback->($status) 610=item aio_copy $srcpath, $dstpath, $callback->($status)
442 611
443Try to copy the I<file> (directories not supported as either source or 612Try to copy the I<file> (directories not supported as either source or
444destination) from C<$srcpath> to C<$dstpath> and call the callback with 613destination) from C<$srcpath> to C<$dstpath> and call the callback with
454errors are being ignored. 623errors are being ignored.
455 624
456=cut 625=cut
457 626
458sub aio_copy($$;$) { 627sub aio_copy($$;$) {
628 aio_block {
459 my ($src, $dst, $cb) = @_; 629 my ($src, $dst, $cb) = @_;
460 630
461 my $pri = aioreq_pri; 631 my $pri = aioreq_pri;
462 my $grp = aio_group $cb; 632 my $grp = aio_group $cb;
463 633
464 aioreq_pri $pri; 634 aioreq_pri $pri;
465 add $grp aio_open $src, O_RDONLY, 0, sub { 635 add $grp aio_open $src, O_RDONLY, 0, sub {
466 if (my $src_fh = $_[0]) { 636 if (my $src_fh = $_[0]) {
467 my @stat = stat $src_fh; 637 my @stat = stat $src_fh;
468 638
469 aioreq_pri $pri; 639 aioreq_pri $pri;
470 add $grp aio_open $dst, O_CREAT | O_WRONLY | O_TRUNC, 0200, sub { 640 add $grp aio_open $dst, O_CREAT | O_WRONLY | O_TRUNC, 0200, sub {
471 if (my $dst_fh = $_[0]) { 641 if (my $dst_fh = $_[0]) {
472 aioreq_pri $pri; 642 aioreq_pri $pri;
473 add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub { 643 add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
474 if ($_[0] == $stat[7]) { 644 if ($_[0] == $stat[7]) {
475 $grp->result (0); 645 $grp->result (0);
476 close $src_fh; 646 close $src_fh;
477 647
478 # those should not normally block. should. should. 648 # those should not normally block. should. should.
479 utime $stat[8], $stat[9], $dst; 649 utime $stat[8], $stat[9], $dst;
480 chmod $stat[2] & 07777, $dst_fh; 650 chmod $stat[2] & 07777, $dst_fh;
481 chown $stat[4], $stat[5], $dst_fh; 651 chown $stat[4], $stat[5], $dst_fh;
482 close $dst_fh; 652 close $dst_fh;
483 } else { 653 } else {
484 $grp->result (-1); 654 $grp->result (-1);
485 close $src_fh; 655 close $src_fh;
486 close $dst_fh; 656 close $dst_fh;
487 657
488 aioreq $pri; 658 aioreq $pri;
489 add $grp aio_unlink $dst; 659 add $grp aio_unlink $dst;
660 }
490 } 661 };
662 } else {
663 $grp->result (-1);
491 }; 664 }
492 } else {
493 $grp->result (-1);
494 } 665 },
666
667 } else {
668 $grp->result (-1);
495 }, 669 }
496
497 } else {
498 $grp->result (-1);
499 } 670 };
671
672 $grp
500 }; 673 }
501
502 $grp
503} 674}
504 675
505=item aio_move $srcpath, $dstpath, $callback->($status) 676=item aio_move $srcpath, $dstpath, $callback->($status)
506 677
507Try to move the I<file> (directories not supported as either source or 678Try to move the I<file> (directories not supported as either source or
513that is successful, unlinking the C<$srcpath>. 684that is successful, unlinking the C<$srcpath>.
514 685
515=cut 686=cut
516 687
517sub aio_move($$;$) { 688sub aio_move($$;$) {
689 aio_block {
518 my ($src, $dst, $cb) = @_; 690 my ($src, $dst, $cb) = @_;
519 691
520 my $pri = aioreq_pri; 692 my $pri = aioreq_pri;
521 my $grp = aio_group $cb; 693 my $grp = aio_group $cb;
522 694
523 aioreq_pri $pri; 695 aioreq_pri $pri;
524 add $grp aio_rename $src, $dst, sub { 696 add $grp aio_rename $src, $dst, sub {
525 if ($_[0] && $! == EXDEV) { 697 if ($_[0] && $! == EXDEV) {
526 aioreq_pri $pri; 698 aioreq_pri $pri;
527 add $grp aio_copy $src, $dst, sub { 699 add $grp aio_copy $src, $dst, sub {
700 $grp->result ($_[0]);
701
702 if (!$_[0]) {
703 aioreq_pri $pri;
704 add $grp aio_unlink $src;
705 }
706 };
707 } else {
528 $grp->result ($_[0]); 708 $grp->result ($_[0]);
529
530 if (!$_[0]) {
531 aioreq_pri $pri;
532 add $grp aio_unlink $src;
533 }
534 }; 709 }
535 } else {
536 $grp->result ($_[0]);
537 } 710 };
711
712 $grp
538 }; 713 }
539
540 $grp
541} 714}
542 715
543=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) 716=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs)
544 717
545Scans a directory (similar to C<aio_readdir>) but additionally tries to 718Scans a directory (similar to C<aio_readdir>) but additionally tries to
592as those tend to return 0 or 1 as link counts, which disables the 765as those tend to return 0 or 1 as link counts, which disables the
593directory counting heuristic. 766directory counting heuristic.
594 767
595=cut 768=cut
596 769
597sub aio_scandir($$$) { 770sub aio_scandir($$;$) {
771 aio_block {
598 my ($path, $maxreq, $cb) = @_; 772 my ($path, $maxreq, $cb) = @_;
599 773
600 my $pri = aioreq_pri; 774 my $pri = aioreq_pri;
601 775
602 my $grp = aio_group $cb; 776 my $grp = aio_group $cb;
603 777
604 $maxreq = 4 if $maxreq <= 0; 778 $maxreq = 4 if $maxreq <= 0;
605 779
606 # stat once 780 # stat once
607 aioreq_pri $pri;
608 add $grp aio_stat $path, sub {
609 return $grp->result () if $_[0];
610 my $now = time;
611 my $hash1 = join ":", (stat _)[0,1,3,7,9];
612
613 # read the directory entries
614 aioreq_pri $pri; 781 aioreq_pri $pri;
615 add $grp aio_readdir $path, sub { 782 add $grp aio_stat $path, sub {
616 my $entries = shift
617 or return $grp->result (); 783 return $grp->result () if $_[0];
784 my $now = time;
785 my $hash1 = join ":", (stat _)[0,1,3,7,9];
618 786
619 # stat the dir another time 787 # read the directory entries
620 aioreq_pri $pri; 788 aioreq_pri $pri;
789 add $grp aio_readdir $path, sub {
790 my $entries = shift
791 or return $grp->result ();
792
793 # stat the dir another time
794 aioreq_pri $pri;
621 add $grp aio_stat $path, sub { 795 add $grp aio_stat $path, sub {
622 my $hash2 = join ":", (stat _)[0,1,3,7,9]; 796 my $hash2 = join ":", (stat _)[0,1,3,7,9];
623 797
624 my $ndirs; 798 my $ndirs;
625 799
626 # take the slow route if anything looks fishy 800 # take the slow route if anything looks fishy
627 if ($hash1 ne $hash2 or (stat _)[9] == $now) { 801 if ($hash1 ne $hash2 or (stat _)[9] == $now) {
628 $ndirs = -1; 802 $ndirs = -1;
629 } else { 803 } else {
630 # if nlink == 2, we are finished 804 # if nlink == 2, we are finished
631 # on non-posix-fs's, we rely on nlink < 2 805 # on non-posix-fs's, we rely on nlink < 2
632 $ndirs = (stat _)[3] - 2 806 $ndirs = (stat _)[3] - 2
633 or return $grp->result ([], $entries); 807 or return $grp->result ([], $entries);
634 } 808 }
635 809
636 # sort into likely dirs and likely nondirs 810 # sort into likely dirs and likely nondirs
637 # dirs == files without ".", short entries first 811 # dirs == files without ".", short entries first
638 $entries = [map $_->[0], 812 $entries = [map $_->[0],
639 sort { $b->[1] cmp $a->[1] } 813 sort { $b->[1] cmp $a->[1] }
640 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length], 814 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length],
641 @$entries]; 815 @$entries];
642 816
643 my (@dirs, @nondirs); 817 my (@dirs, @nondirs);
644 818
645 my $statgrp = add $grp aio_group sub { 819 my $statgrp = add $grp aio_group sub {
646 $grp->result (\@dirs, \@nondirs); 820 $grp->result (\@dirs, \@nondirs);
647 }; 821 };
648 822
649 limit $statgrp $maxreq; 823 limit $statgrp $maxreq;
650 feed $statgrp sub { 824 feed $statgrp sub {
651 return unless @$entries; 825 return unless @$entries;
652 my $entry = pop @$entries; 826 my $entry = pop @$entries;
653 827
654 aioreq_pri $pri; 828 aioreq_pri $pri;
655 add $statgrp aio_stat "$path/$entry/.", sub { 829 add $statgrp aio_stat "$path/$entry/.", sub {
656 if ($_[0] < 0) { 830 if ($_[0] < 0) {
657 push @nondirs, $entry; 831 push @nondirs, $entry;
658 } else { 832 } else {
659 # need to check for real directory 833 # need to check for real directory
660 aioreq_pri $pri; 834 aioreq_pri $pri;
661 add $statgrp aio_lstat "$path/$entry", sub { 835 add $statgrp aio_lstat "$path/$entry", sub {
662 if (-d _) { 836 if (-d _) {
663 push @dirs, $entry; 837 push @dirs, $entry;
664 838
665 unless (--$ndirs) { 839 unless (--$ndirs) {
666 push @nondirs, @$entries; 840 push @nondirs, @$entries;
667 feed $statgrp; 841 feed $statgrp;
842 }
843 } else {
844 push @nondirs, $entry;
668 } 845 }
669 } else {
670 push @nondirs, $entry;
671 } 846 }
672 } 847 }
673 } 848 };
674 }; 849 };
675 }; 850 };
676 }; 851 };
677 }; 852 };
853
854 $grp
678 }; 855 }
856}
679 857
858=item aio_rmtree $path, $callback->($status)
859
860Delete a directory tree starting (and including) C<$path>, return the
861status of the final C<rmdir> only. This is a composite request that
862uses C<aio_scandir> to recurse into and rmdir directories, and unlink
863everything else.
864
865=cut
866
867sub aio_rmtree;
868sub aio_rmtree($;$) {
869 aio_block {
870 my ($path, $cb) = @_;
871
872 my $pri = aioreq_pri;
873 my $grp = aio_group $cb;
874
875 aioreq_pri $pri;
876 add $grp aio_scandir $path, 0, sub {
877 my ($dirs, $nondirs) = @_;
878
879 my $dirgrp = aio_group sub {
880 add $grp aio_rmdir $path, sub {
881 $grp->result ($_[0]);
882 };
883 };
884
885 (aioreq_pri $pri), add $dirgrp aio_rmtree "$path/$_" for @$dirs;
886 (aioreq_pri $pri), add $dirgrp aio_unlink "$path/$_" for @$nondirs;
887
888 add $grp $dirgrp;
889 };
890
680 $grp 891 $grp
892 }
681} 893}
682 894
683=item aio_fsync $fh, $callback->($status) 895=item aio_fsync $fh, $callback->($status)
684 896
685Asynchronously call fsync on the given filehandle and call the callback 897Asynchronously call fsync on the given filehandle and call the callback
939that are being processed by C<IO::AIO::poll_cb> in one call, respectively 1151that are being processed by C<IO::AIO::poll_cb> in one call, respectively
940the maximum amount of time (default C<0>, meaning infinity) spent in 1152the maximum amount of time (default C<0>, meaning infinity) spent in
941C<IO::AIO::poll_cb> to process requests (more correctly the mininum amount 1153C<IO::AIO::poll_cb> to process requests (more correctly the mininum amount
942of time C<poll_cb> is allowed to use). 1154of time C<poll_cb> is allowed to use).
943 1155
1156Setting C<max_poll_time> to a non-zero value creates an overhead of one
1157syscall per request processed, which is not normally a problem unless your
1158callbacks are really really fast or your OS is really really slow (I am
1159not mentioning Solaris here). Using C<max_poll_reqs> incurs no overhead.
1160
944Setting these is useful if you want to ensure some level of 1161Setting these is useful if you want to ensure some level of
945interactiveness when perl is not fast enough to process all requests in 1162interactiveness when perl is not fast enough to process all requests in
946time. 1163time.
947 1164
948For interactive programs, values such as C<0.01> to C<0.1> should be fine. 1165For interactive programs, values such as C<0.01> to C<0.1> should be fine.
949 1166
950Example: Install an Event watcher that automatically calls 1167Example: Install an Event watcher that automatically calls
951IO::AIO::poll_some with low priority, to ensure that other parts of the 1168IO::AIO::poll_cb with low priority, to ensure that other parts of the
952program get the CPU sometimes even under high AIO load. 1169program get the CPU sometimes even under high AIO load.
953 1170
954 # try not to spend much more than 0.1s in poll_cb 1171 # try not to spend much more than 0.1s in poll_cb
955 IO::AIO::max_poll_time 0.1; 1172 IO::AIO::max_poll_time 0.1;
956 1173
959 poll => 'r', nice => 1, 1176 poll => 'r', nice => 1,
960 cb => &IO::AIO::poll_cb); 1177 cb => &IO::AIO::poll_cb);
961 1178
962=item IO::AIO::poll_wait 1179=item IO::AIO::poll_wait
963 1180
1181If there are any outstanding requests and none of them in the result
964Wait till the result filehandle becomes ready for reading (simply does a 1182phase, wait till the result filehandle becomes ready for reading (simply
965C<select> on the filehandle. This is useful if you want to synchronously 1183does a C<select> on the filehandle. This is useful if you want to
966wait for some requests to finish). 1184synchronously wait for some requests to finish).
967 1185
968See C<nreqs> for an example. 1186See C<nreqs> for an example.
969 1187
970=item IO::AIO::poll 1188=item IO::AIO::poll
971 1189
972Waits until some requests have been handled. 1190Waits until some requests have been handled.
973 1191
1192Returns the number of requests processed, but is otherwise strictly
974Strictly equivalent to: 1193equivalent to:
975 1194
976 IO::AIO::poll_wait, IO::AIO::poll_cb 1195 IO::AIO::poll_wait, IO::AIO::poll_cb
977 if IO::AIO::nreqs;
978 1196
979=item IO::AIO::flush 1197=item IO::AIO::flush
980 1198
981Wait till all outstanding AIO requests have been handled. 1199Wait till all outstanding AIO requests have been handled.
982 1200
983Strictly equivalent to: 1201Strictly equivalent to:
984 1202
985 IO::AIO::poll_wait, IO::AIO::poll_cb 1203 IO::AIO::poll_wait, IO::AIO::poll_cb
986 while IO::AIO::nreqs; 1204 while IO::AIO::nreqs;
987 1205
1206=back
1207
988=head3 CONTROLLING THE NUMBER OF THREADS 1208=head3 CONTROLLING THE NUMBER OF THREADS
1209
1210=over
989 1211
990=item IO::AIO::min_parallel $nthreads 1212=item IO::AIO::min_parallel $nthreads
991 1213
992Set the minimum number of AIO threads to C<$nthreads>. The current 1214Set the minimum number of AIO threads to C<$nthreads>. The current
993default is C<8>, which means eight asynchronous operations can execute 1215default is C<8>, which means eight asynchronous operations can execute
1041This is a very bad function to use in interactive programs because it 1263This is a very bad function to use in interactive programs because it
1042blocks, and a bad way to reduce concurrency because it is inexact: Better 1264blocks, and a bad way to reduce concurrency because it is inexact: Better
1043use an C<aio_group> together with a feed callback. 1265use an C<aio_group> together with a feed callback.
1044 1266
1045Sets the maximum number of outstanding requests to C<$nreqs>. If you 1267Sets the maximum number of outstanding requests to C<$nreqs>. If you
1046to queue up more than this number of requests, the next call to the 1268do queue up more than this number of requests, the next call to the
1047C<poll_cb> (and C<poll_some> and other functions calling C<poll_cb>) 1269C<poll_cb> (and C<poll_some> and other functions calling C<poll_cb>)
1048function will block until the limit is no longer exceeded. 1270function will block until the limit is no longer exceeded.
1049 1271
1050The default value is very large, so there is no practical limit on the 1272The default value is very large, so there is no practical limit on the
1051number of outstanding requests. 1273number of outstanding requests.
1052 1274
1053You can still queue as many requests as you want. Therefore, 1275You can still queue as many requests as you want. Therefore,
1054C<max_oustsanding> is mainly useful in simple scripts (with low values) or 1276C<max_oustsanding> is mainly useful in simple scripts (with low values) or
1055as a stop gap to shield against fatal memory overflow (with large values). 1277as a stop gap to shield against fatal memory overflow (with large values).
1056 1278
1279=back
1280
1057=head3 STATISTICAL INFORMATION 1281=head3 STATISTICAL INFORMATION
1282
1283=over
1058 1284
1059=item IO::AIO::nreqs 1285=item IO::AIO::nreqs
1060 1286
1061Returns the number of requests currently in the ready, execute or pending 1287Returns the number of requests currently in the ready, execute or pending
1062states (i.e. for which their callback has not been invoked yet). 1288states (i.e. for which their callback has not been invoked yet).
1078 1304
1079=back 1305=back
1080 1306
1081=cut 1307=cut
1082 1308
1083# support function to convert a fd into a perl filehandle
1084sub _fd2fh {
1085 return undef if $_[0] < 0;
1086
1087 # try to generate nice filehandles
1088 my $sym = "IO::AIO::fd#$_[0]";
1089 local *$sym;
1090
1091 open *$sym, "+<&=$_[0]" # usually works under any unix
1092 or open *$sym, "<&=$_[0]" # cygwin needs this
1093 or open *$sym, ">&=$_[0]" # or this
1094 or return undef;
1095
1096 *$sym
1097}
1098
1099min_parallel 8; 1309min_parallel 8;
1100 1310
1101END { 1311END { flush }
1102 min_parallel 1;
1103 flush;
1104};
1105 1312
11061; 13131;
1107 1314
1108=head2 FORK BEHAVIOUR 1315=head2 FORK BEHAVIOUR
1109 1316
1129bytes of memory. In addition, stat requests need a stat buffer (possibly 1336bytes of memory. In addition, stat requests need a stat buffer (possibly
1130a few hundred bytes), readdir requires a result buffer and so on. Perl 1337a few hundred bytes), readdir requires a result buffer and so on. Perl
1131scalars and other data passed into aio requests will also be locked and 1338scalars and other data passed into aio requests will also be locked and
1132will consume memory till the request has entered the done state. 1339will consume memory till the request has entered the done state.
1133 1340
1134This is now awfully much, so queuing lots of requests is not usually a 1341This is not awfully much, so queuing lots of requests is not usually a
1135problem. 1342problem.
1136 1343
1137Per-thread usage: 1344Per-thread usage:
1138 1345
1139In the execution phase, some aio requests require more memory for 1346In the execution phase, some aio requests require more memory for

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines