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.51 by root, Sat Jun 24 19:14:04 2006 UTC vs.
Revision 1.82 by root, Fri Oct 27 20:10:06 2006 UTC

15 15
16 aio_read $fh, 30000, 1024, $buffer, 0, sub { 16 aio_read $fh, 30000, 1024, $buffer, 0, sub {
17 $_[0] > 0 or die "read error: $!"; 17 $_[0] > 0 or die "read error: $!";
18 }; 18 };
19 19
20 # AnyEvent 20 # version 2+ has request and group objects
21 use IO::AIO 2;
22
23 aioreq_pri 4; # give next request a very high priority
24 my $req = aio_unlink "/tmp/file", sub { };
25 $req->cancel; # cancel request if still in queue
26
27 my $grp = aio_group sub { print "all stats done\n" };
28 add $grp aio_stat "..." for ...;
29
30 # AnyEvent integration
21 open my $fh, "<&=" . IO::AIO::poll_fileno or die "$!"; 31 open my $fh, "<&=" . IO::AIO::poll_fileno or die "$!";
22 my $w = AnyEvent->io (fh => $fh, poll => 'r', cb => sub { IO::AIO::poll_cb }); 32 my $w = AnyEvent->io (fh => $fh, poll => 'r', cb => sub { IO::AIO::poll_cb });
23 33
24 # Event 34 # Event integration
25 Event->io (fd => IO::AIO::poll_fileno, 35 Event->io (fd => IO::AIO::poll_fileno,
26 poll => 'r', 36 poll => 'r',
27 cb => \&IO::AIO::poll_cb); 37 cb => \&IO::AIO::poll_cb);
28 38
29 # Glib/Gtk2 39 # Glib/Gtk2 integration
30 add_watch Glib::IO IO::AIO::poll_fileno, 40 add_watch Glib::IO IO::AIO::poll_fileno,
31 in => sub { IO::AIO::poll_cb; 1 }; 41 in => sub { IO::AIO::poll_cb; 1 };
32 42
33 # Tk 43 # Tk integration
34 Tk::Event::IO->fileevent (IO::AIO::poll_fileno, "", 44 Tk::Event::IO->fileevent (IO::AIO::poll_fileno, "",
35 readable => \&IO::AIO::poll_cb); 45 readable => \&IO::AIO::poll_cb);
36 46
37 # Danga::Socket 47 # Danga::Socket integration
38 Danga::Socket->AddOtherFds (IO::AIO::poll_fileno => 48 Danga::Socket->AddOtherFds (IO::AIO::poll_fileno =>
39 \&IO::AIO::poll_cb); 49 \&IO::AIO::poll_cb);
40 50
41
42=head1 DESCRIPTION 51=head1 DESCRIPTION
43 52
44This module implements asynchronous I/O using whatever means your 53This module implements asynchronous I/O using whatever means your
45operating system supports. 54operating system supports.
46 55
47Currently, a number of threads are started that execute your read/writes 56In this version, a number of threads are started that execute your
48and signal their completion. You don't need thread support in your libc or 57requests and signal their completion. You don't need thread support
49perl, and the threads created by this module will not be visible to the 58in perl, and the threads created by this module will not be visible
50pthreads library. In the future, this module might make use of the native 59to perl. In the future, this module might make use of the native aio
51aio functions available on many operating systems. However, they are often 60functions available on many operating systems. However, they are often
52not well-supported (Linux doesn't allow them on normal files currently, 61not well-supported or restricted (Linux doesn't allow them on normal
53for example), and they would only support aio_read and aio_write, so the 62files currently, for example), and they would only support aio_read and
54remaining functionality would have to be implemented using threads anyway. 63aio_write, so the remaining functionality would have to be implemented
64using threads anyway.
55 65
56Although the module will work with in the presence of other threads, it is 66Although the module will work with in the presence of other (Perl-)
57currently not reentrant, so use appropriate locking yourself, always call 67threads, it is currently not reentrant in any way, so use appropriate
58C<poll_cb> from within the same thread, or never call C<poll_cb> (or other 68locking yourself, always call C<poll_cb> from within the same thread, or
59C<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).
60 120
61=cut 121=cut
62 122
63package IO::AIO; 123package IO::AIO;
64 124
66use strict 'vars'; 126use strict 'vars';
67 127
68use base 'Exporter'; 128use base 'Exporter';
69 129
70BEGIN { 130BEGIN {
71 our $VERSION = '1.8'; 131 our $VERSION = '2.0';
72 132
73 our @EXPORT = 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
74 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
75 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
76 our @EXPORT_OK = qw(poll_fileno poll_cb min_parallel max_parallel max_outstanding nreqs); 136 aio_copy aio_group aio_nop aio_mknod);
137 our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice));
138 our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush
139 min_parallel max_parallel nreqs nready npending);
140
141 @IO::AIO::GRP::ISA = 'IO::AIO::REQ';
77 142
78 require XSLoader; 143 require XSLoader;
79 XSLoader::load ("IO::AIO", $VERSION); 144 XSLoader::load ("IO::AIO", $VERSION);
80} 145}
81 146
92syscall has been executed asynchronously. 157syscall has been executed asynchronously.
93 158
94All functions expecting a filehandle keep a copy of the filehandle 159All functions expecting a filehandle keep a copy of the filehandle
95internally until the request has finished. 160internally until the request has finished.
96 161
162All requests return objects of type L<IO::AIO::REQ> that allow further
163manipulation of those requests while they are in-flight.
164
97The pathnames you pass to these routines I<must> be absolute and 165The pathnames you pass to these routines I<must> be absolute and
98encoded in byte form. The reason for the former is that at the time the 166encoded in byte form. The reason for the former is that at the time the
99request is being executed, the current working directory could have 167request is being executed, the current working directory could have
100changed. Alternatively, you can make sure that you never change the 168changed. Alternatively, you can make sure that you never change the
101current working directory. 169current working directory.
106your pathnames to the locale (or other) encoding in effect in the user 174your pathnames to the locale (or other) encoding in effect in the user
107environment, d) use Glib::filename_from_unicode on unicode filenames or e) 175environment, d) use Glib::filename_from_unicode on unicode filenames or e)
108use something else. 176use something else.
109 177
110=over 4 178=over 4
179
180=item $prev_pri = aioreq_pri [$pri]
181
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
185The default priority is C<0>, the minimum and maximum priorities are C<-4>
186and C<4>, respectively. Requests with higher priority will be serviced
187first.
188
189The priority will be reset to C<0> after each call to one of the C<aio_*>
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.
111 210
112=item aio_open $pathname, $flags, $mode, $callback->($fh) 211=item aio_open $pathname, $flags, $mode, $callback->($fh)
113 212
114Asynchronously 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
115created filehandle for the file. 214created filehandle for the file.
165 264
166 aio_read $fh, 7, 15, $buffer, 0, sub { 265 aio_read $fh, 7, 15, $buffer, 0, sub {
167 $_[0] > 0 or die "read error: $!"; 266 $_[0] > 0 or die "read error: $!";
168 print "read $_[0] bytes: <$buffer>\n"; 267 print "read $_[0] bytes: <$buffer>\n";
169 }; 268 };
170
171=item aio_move $srcpath, $dstpath, $callback->($status)
172
173[EXPERIMENTAL]
174
175Try to move the I<file> (directories not supported as either source or destination)
176from C<$srcpath> to C<$dstpath> and call the callback with the C<0> (error) or C<-1> ok.
177
178This is a composite request that tries to rename(2) the file first. If
179rename files with C<EXDEV>, it creates the destination file with mode 0200
180and copies the contents of the source file into it using C<aio_sendfile>,
181followed by restoring atime, mtime, access mode and uid/gid, in that
182order, and unlinking the C<$srcpath>.
183
184If an error occurs, the partial destination file will be unlinked, if
185possible, except when setting atime, mtime, access mode and uid/gid, where
186errors are being ignored.
187
188=cut
189
190sub aio_move($$$) {
191 my ($src, $dst, $cb) = @_;
192
193 aio_rename $src, $dst, sub {
194 if ($_[0] && $! == EXDEV) {
195 aio_open $src, O_RDONLY, 0, sub {
196 if (my $src_fh = $_[0]) {
197 my @stat = stat $src_fh;
198
199 aio_open $dst, O_WRONLY, 0200, sub {
200 if (my $dst_fh = $_[0]) {
201 aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
202 close $src_fh;
203
204 if ($_[0] == $stat[7]) {
205 utime $stat[8], $stat[9], $dst;
206 chmod $stat[2] & 07777, $dst_fh;
207 chown $stat[4], $stat[5], $dst_fh;
208 close $dst_fh;
209
210 aio_unlink $src, sub {
211 $cb->($_[0]);
212 };
213 } else {
214 my $errno = $!;
215 aio_unlink $dst, sub {
216 $! = $errno;
217 $cb->(-1);
218 };
219 }
220 };
221 } else {
222 $cb->(-1);
223 }
224 },
225
226 } else {
227 $cb->(-1);
228 }
229 };
230 } else {
231 $cb->($_[0]);
232 }
233 };
234}
235 269
236=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)
237 271
238Tries 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
239reading 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
295=item aio_unlink $pathname, $callback->($status) 329=item aio_unlink $pathname, $callback->($status)
296 330
297Asynchronously unlink (delete) a file and call the callback with the 331Asynchronously unlink (delete) a file and call the callback with the
298result code. 332result code.
299 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
300=item aio_link $srcpath, $dstpath, $callback->($status) 340=item aio_link $srcpath, $dstpath, $callback->($status)
301 341
302Asynchronously 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
303the path C<$dstpath> and call the callback with the result code. 343the path C<$dstpath> and call the callback with the result code.
304 344
324sorted, and will B<NOT> include the C<.> and C<..> entries. 364sorted, and will B<NOT> include the C<.> and C<..> entries.
325 365
326The 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
327with the filenames. 367with the filenames.
328 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
329=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) 471=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs)
330 472
331Scans a directory (similar to C<aio_readdir>) and tries to separate the 473Scans a directory (similar to C<aio_readdir>) but additionally tries to
332entries of directory C<$path> into two sets of names, ones you can recurse 474efficiently separate the entries of directory C<$path> into two sets of
333into (directories), and ones you cannot recurse into (everything else). 475names, directories you can recurse into (directories), and ones you cannot
476recurse into (everything else, including symlinks to directories).
334 477
335C<aio_scandir> is a composite request that consists of many 478C<aio_scandir> is a composite request that creates of many sub requests_
336aio-primitives. C<$maxreq> specifies the maximum number of outstanding 479C<$maxreq> specifies the maximum number of outstanding aio requests that
337aio requests that this function generates. If it is C<< <= 0 >>, then a 480this function generates. If it is C<< <= 0 >>, then a suitable default
338suitable default will be chosen (currently 8). 481will be chosen (currently 4).
339 482
340On error, the callback is called without arguments, otherwise it receives 483On error, the callback is called without arguments, otherwise it receives
341two array-refs with path-relative entry names. 484two array-refs with path-relative entry names.
342 485
343Example: 486Example:
351Implementation notes. 494Implementation notes.
352 495
353The C<aio_readdir> cannot be avoided, but C<stat()>'ing every entry can. 496The C<aio_readdir> cannot be avoided, but C<stat()>'ing every entry can.
354 497
355After reading the directory, the modification time, size etc. of the 498After reading the directory, the modification time, size etc. of the
356directory before and after the readdir is checked, and if they match, the 499directory before and after the readdir is checked, and if they match (and
357link count will be used to decide how many entries are directories (if 500isn't the current time), the link count will be used to decide how many
358>= 2). Otherwise, no knowledge of the number of subdirectories will be 501entries are directories (if >= 2). Otherwise, no knowledge of the number
359assumed. 502of subdirectories will be assumed.
360 503
361Then entires will be sorted into likely directories (everything without a 504Then entries will be sorted into likely directories (everything without
362non-initial dot) and likely non-directories (everything else). Then every 505a non-initial dot currently) and likely non-directories (everything
363entry + C</.> will be C<stat>'ed, likely directories first. This is often 506else). Then every entry plus an appended C</.> will be C<stat>'ed,
507likely directories first. If that succeeds, it assumes that the entry
508is a directory or a symlink to directory (which will be checked
509seperately). This is often faster than stat'ing the entry itself because
364faster because filesystems might detect the type of the entry without 510filesystems might detect the type of the entry without reading the inode
365reading the inode data (e.g. ext2fs filetype feature). If that succeeds, 511data (e.g. ext2fs filetype feature).
366it assumes that the entry is a directory or a symlink to directory (which
367will be checked seperately).
368 512
369If the known number of directories has been reached, the rest of the 513If the known number of directories (link count - 2) has been reached, the
370entries is assumed to be non-directories. 514rest of the entries is assumed to be non-directories.
515
516This only works with certainty on POSIX (= UNIX) filesystems, which
517fortunately are the vast majority of filesystems around.
518
519It will also likely work on non-POSIX filesystems with reduced efficiency
520as those tend to return 0 or 1 as link counts, which disables the
521directory counting heuristic.
371 522
372=cut 523=cut
373 524
374sub aio_scandir($$$) { 525sub aio_scandir($$$) {
375 my ($path, $maxreq, $cb) = @_; 526 my ($path, $maxreq, $cb) = @_;
376 527
528 my $pri = aioreq_pri;
529
530 my $grp = aio_group $cb;
531
377 $maxreq = 8 if $maxreq <= 0; 532 $maxreq = 4 if $maxreq <= 0;
378 533
379 # stat once 534 # stat once
535 aioreq_pri $pri;
380 aio_stat $path, sub { 536 add $grp aio_stat $path, sub {
381 return $cb->() if $_[0]; 537 return $grp->result () if $_[0];
538 my $now = time;
382 my $hash1 = join ":", (stat _)[0,1,3,7,9]; 539 my $hash1 = join ":", (stat _)[0,1,3,7,9];
383 540
384 # read the directory entries 541 # read the directory entries
542 aioreq_pri $pri;
385 aio_readdir $path, sub { 543 add $grp aio_readdir $path, sub {
386 my $entries = shift 544 my $entries = shift
387 or return $cb->(); 545 or return $grp->result ();
388 546
389 # stat the dir another time 547 # stat the dir another time
548 aioreq_pri $pri;
390 aio_stat $path, sub { 549 add $grp aio_stat $path, sub {
391 my $hash2 = join ":", (stat _)[0,1,3,7,9]; 550 my $hash2 = join ":", (stat _)[0,1,3,7,9];
392 551
393 my $ndirs; 552 my $ndirs;
394 553
395 # take the slow route if anything looks fishy 554 # take the slow route if anything looks fishy
396 if ($hash1 ne $hash2) { 555 if ($hash1 ne $hash2 or (stat _)[9] == $now) {
397 $ndirs = -1; 556 $ndirs = -1;
398 } else { 557 } else {
399 # if nlink == 2, we are finished 558 # if nlink == 2, we are finished
400 # on non-posix-fs's, we rely on nlink < 2 559 # on non-posix-fs's, we rely on nlink < 2
401 $ndirs = (stat _)[3] - 2 560 $ndirs = (stat _)[3] - 2
402 or return $cb->([], $entries); 561 or return $grp->result ([], $entries);
403 } 562 }
404 563
405 # sort into likely dirs and likely nondirs 564 # sort into likely dirs and likely nondirs
406 # dirs == files without ".", short entries first 565 # dirs == files without ".", short entries first
407 $entries = [map $_->[0], 566 $entries = [map $_->[0],
409 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length], 568 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length],
410 @$entries]; 569 @$entries];
411 570
412 my (@dirs, @nondirs); 571 my (@dirs, @nondirs);
413 572
414 my ($statcb, $schedcb); 573 my $statgrp = add $grp aio_group sub {
415 my $nreq = 0; 574 $grp->result (\@dirs, \@nondirs);
575 };
416 576
417 $schedcb = sub { 577 limit $statgrp $maxreq;
418 if (@$entries) { 578 feed $statgrp sub {
419 if ($nreq < $maxreq) { 579 return unless @$entries;
420 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 }
421 $nreq++; 600 }
422 aio_stat "$path/$ent/.", sub { $statcb->($_[0], $ent) };
423 } 601 }
424 } elsif (!$nreq) {
425 # finished
426 undef $statcb;
427 undef $schedcb;
428 $cb->(\@dirs, \@nondirs) if $cb;
429 undef $cb;
430 } 602 };
431 }; 603 };
432 $statcb = sub {
433 my ($status, $entry) = @_;
434
435 if ($status < 0) {
436 $nreq--;
437 push @nondirs, $entry;
438 &$schedcb;
439 } else {
440 # need to check for real directory
441 aio_lstat "$path/$entry", sub {
442 $nreq--;
443
444 if (-d _) {
445 push @dirs, $entry;
446
447 if (!--$ndirs) {
448 push @nondirs, @$entries;
449 $entries = [];
450 }
451 } else {
452 push @nondirs, $entry;
453 }
454
455 &$schedcb;
456 }
457 }
458 };
459
460 &$schedcb while @$entries && $nreq < $maxreq;
461 }; 604 };
462 }; 605 };
463 }; 606 };
607
608 $grp
464} 609}
465 610
466=item aio_fsync $fh, $callback->($status) 611=item aio_fsync $fh, $callback->($status)
467 612
468Asynchronously call fsync on the given filehandle and call the callback 613Asynchronously call fsync on the given filehandle and call the callback
473Asynchronously call fdatasync on the given filehandle and call the 618Asynchronously call fdatasync on the given filehandle and call the
474callback with the fdatasync result code. 619callback with the fdatasync result code.
475 620
476If 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
477detected, it will be emulated by calling C<fsync> instead. 622detected, it will be emulated by calling C<fsync> instead.
623
624=item aio_group $callback->(...)
625
626This is a very special aio request: Instead of doing something, it is a
627container for other aio requests, which is useful if you want to bundle
628many requests into a single, composite, request with a definite callback
629and the ability to cancel the whole request with its subrequests.
630
631Returns an object of class L<IO::AIO::GRP>. See its documentation below
632for more info.
633
634Example:
635
636 my $grp = aio_group sub {
637 print "all stats done\n";
638 };
639
640 add $grp
641 (aio_stat ...),
642 (aio_stat ...),
643 ...;
644
645=item aio_nop $callback->()
646
647This is a special request - it does nothing in itself and is only used for
648side effects, such as when you want to add a dummy request to a group so
649that finishing the requests in the group depends on executing the given
650code.
651
652While this request does nothing, it still goes through the execution
653phase and still requires a worker thread. Thus, the callback will not
654be executed immediately but only after other requests in the queue have
655entered their execution phase. This can be used to measure request
656latency.
657
658=item IO::AIO::aio_busy $fractional_seconds, $callback->() *NOT EXPORTED*
659
660Mainly used for debugging and benchmarking, this aio request puts one of
661the request workers to sleep for the given time.
662
663While it is theoretically handy to have simple I/O scheduling requests
664like sleep and file handle readable/writable, the overhead this creates is
665immense (it blocks a thread for a long time) so do not use this function
666except to put your application under artificial I/O pressure.
667
668=back
669
670=head2 IO::AIO::REQ CLASS
671
672All non-aggregate C<aio_*> functions return an object of this class when
673called in non-void context.
674
675=over 4
676
677=item cancel $req
678
679Cancels the request, if possible. Has the effect of skipping execution
680when entering the B<execute> state and skipping calling the callback when
681entering the the B<result> state, but will leave the request otherwise
682untouched. That means that requests that currently execute will not be
683stopped and resources held by the request will not be freed prematurely.
684
685=item cb $req $callback->(...)
686
687Replace (or simply set) the callback registered to the request.
688
689=back
690
691=head2 IO::AIO::GRP CLASS
692
693This class is a subclass of L<IO::AIO::REQ>, so all its methods apply to
694objects of this class, too.
695
696A IO::AIO::GRP object is a special request that can contain multiple other
697aio requests.
698
699You create one by calling the C<aio_group> constructing function with a
700callback that will be called when all contained requests have entered the
701C<done> state:
702
703 my $grp = aio_group sub {
704 print "all requests are done\n";
705 };
706
707You add requests by calling the C<add> method with one or more
708C<IO::AIO::REQ> objects:
709
710 $grp->add (aio_unlink "...");
711
712 add $grp aio_stat "...", sub {
713 $_[0] or return $grp->result ("error");
714
715 # add another request dynamically, if first succeeded
716 add $grp aio_open "...", sub {
717 $grp->result ("ok");
718 };
719 };
720
721This makes it very easy to create composite requests (see the source of
722C<aio_move> for an application) that work and feel like simple requests.
723
724=over 4
725
726=item * The IO::AIO::GRP objects will be cleaned up during calls to
727C<IO::AIO::poll_cb>, just like any other request.
728
729=item * They can be canceled like any other request. Canceling will cancel not
730only the request itself, but also all requests it contains.
731
732=item * They can also can also be added to other IO::AIO::GRP objects.
733
734=item * You must not add requests to a group from within the group callback (or
735any later time).
736
737=back
738
739Their lifetime, simplified, looks like this: when they are empty, they
740will finish very quickly. If they contain only requests that are in the
741C<done> state, they will also finish. Otherwise they will continue to
742exist.
743
744That means after creating a group you have some time to add requests. And
745in the callbacks of those requests, you can add further requests to the
746group. And only when all those requests have finished will the the group
747itself finish.
748
749=over 4
750
751=item add $grp ...
752
753=item $grp->add (...)
754
755Add one or more requests to the group. Any type of L<IO::AIO::REQ> can
756be added, including other groups, as long as you do not create circular
757dependencies.
758
759Returns all its arguments.
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
766=item $grp->result (...)
767
768Set the result value(s) that will be passed to the group callback when all
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.
784
785=item feed $grp $callback->($grp)
786
787Sets a feeder/generator on this group: every group can have an attached
788generator that generates requests if idle. The idea behind this is that,
789although you could just queue as many requests as you want in a group,
790this might starve other requests for a potentially long time. For
791example, C<aio_scandir> might generate hundreds of thousands C<aio_stat>
792requests, delaying any later requests for a long time.
793
794To avoid this, and allow incremental generation of requests, you can
795instead a group and set a feeder on it that generates those requests. The
796feed callback will be called whenever there are few enough (see C<limit>,
797below) requests active in the group itself and is expected to queue more
798requests.
799
800The feed callback can queue as many requests as it likes (i.e. C<add> does
801not impose any limits).
802
803If the feed does not queue more requests when called, it will be
804automatically removed from the group.
805
806If the feed limit is C<0>, it will be set to C<2> automatically.
807
808Example:
809
810 # stat all files in @files, but only ever use four aio requests concurrently:
811
812 my $grp = aio_group sub { print "finished\n" };
813 limit $grp 4;
814 feed $grp sub {
815 my $file = pop @files
816 or return;
817
818 add $grp aio_stat $file, sub { ... };
819 };
820
821=item limit $grp $num
822
823Sets the feeder limit for the group: The feeder will be called whenever
824the group contains less than this many requests.
825
826Setting the limit to C<0> will pause the feeding process.
478 827
479=back 828=back
480 829
481=head2 SUPPORT FUNCTIONS 830=head2 SUPPORT FUNCTIONS
482 831
495 844
496Process 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
497regularly. Returns the number of events processed. Returns immediately 846regularly. Returns the number of events processed. Returns immediately
498when no events are outstanding. 847when no events are outstanding.
499 848
849If not all requests were processed for whatever reason, the filehandle
850will still be ready when C<poll_cb> returns.
851
500Example: Install an Event watcher that automatically calls 852Example: Install an Event watcher that automatically calls
501IO::AIO::poll_cb with high priority: 853IO::AIO::poll_cb with high priority:
502 854
503 Event->io (fd => IO::AIO::poll_fileno, 855 Event->io (fd => IO::AIO::poll_fileno,
504 poll => 'r', async => 1, 856 poll => 'r', async => 1,
505 cb => \&IO::AIO::poll_cb); 857 cb => \&IO::AIO::poll_cb);
506 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
507=item IO::AIO::poll_wait 875=item IO::AIO::poll_wait
508 876
509Wait till the result filehandle becomes ready for reading (simply does a 877Wait till the result filehandle becomes ready for reading (simply does a
510C<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
511for some requests to finish). 879for some requests to finish).
512 880
513See C<nreqs> for an example. 881See C<nreqs> for an example.
514 882
515=item IO::AIO::nreqs 883=item IO::AIO::nreqs
516 884
517Returns the number of requests currently outstanding (i.e. for which their 885Returns the number of requests currently in the ready, execute or pending
518callback has not been invoked yet). 886states (i.e. for which their callback has not been invoked yet).
519 887
520Example: wait till there are no outstanding requests anymore: 888Example: wait till there are no outstanding requests anymore:
521 889
522 IO::AIO::poll_wait, IO::AIO::poll_cb 890 IO::AIO::poll_wait, IO::AIO::poll_cb
523 while IO::AIO::nreqs; 891 while IO::AIO::nreqs;
524 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).
902
525=item IO::AIO::flush 903=item IO::AIO::flush
526 904
527Wait till all outstanding AIO requests have been handled. 905Wait till all outstanding AIO requests have been handled.
528 906
529Strictly equivalent to: 907Strictly equivalent to:
540 IO::AIO::poll_wait, IO::AIO::poll_cb 918 IO::AIO::poll_wait, IO::AIO::poll_cb
541 if IO::AIO::nreqs; 919 if IO::AIO::nreqs;
542 920
543=item IO::AIO::min_parallel $nthreads 921=item IO::AIO::min_parallel $nthreads
544 922
545Set the minimum number of AIO threads to C<$nthreads>. The current default 923Set the minimum number of AIO threads to C<$nthreads>. The current
546is C<4>, which means four asynchronous operations can be done at one time 924default is C<8>, which means eight asynchronous operations can execute
547(the number of outstanding operations, however, is unlimited). 925concurrently at any one time (the number of outstanding requests,
926however, is unlimited).
548 927
549IO::AIO starts threads only on demand, when an AIO request is queued and 928IO::AIO starts threads only on demand, when an AIO request is queued and
550no free thread exists. 929no free thread exists.
551 930
552It is recommended to keep the number of threads low, as some Linux 931It is recommended to keep the number of threads relatively low, as some
553kernel versions will scale negatively with the number of threads (higher 932Linux kernel versions will scale negatively with the number of threads
554parallelity => MUCH higher latency). With current Linux 2.6 versions, 4-32 933(higher parallelity => MUCH higher latency). With current Linux 2.6
555threads should be fine. 934versions, 4-32 threads should be fine.
556 935
557Under most circumstances you don't need to call this function, as the 936Under most circumstances you don't need to call this function, as the
558module selects a default that is suitable for low to moderate load. 937module selects a default that is suitable for low to moderate load.
559 938
560=item IO::AIO::max_parallel $nthreads 939=item IO::AIO::max_parallel $nthreads
569This 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
570that all threads are killed and that there are no outstanding requests. 949that all threads are killed and that there are no outstanding requests.
571 950
572Under normal circumstances you don't need to call this function. 951Under normal circumstances you don't need to call this function.
573 952
574=item $oldnreqs = IO::AIO::max_outstanding $nreqs 953=item $oldmaxreqs = IO::AIO::max_outstanding $maxreqs
954
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.
575 958
576Sets the maximum number of outstanding requests to C<$nreqs>. If you 959Sets the maximum number of outstanding requests to C<$nreqs>. If you
577try 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
578some 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.
579 963
580The 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
581queue up many requests in a loop it often improves speed if you set 965number of outstanding requests.
582this to a relatively low number, such as C<100>.
583 966
584Under normal circumstances you don't need to call this function. 967You can still queue as many requests as you want. Therefore,
968C<max_oustsanding> is mainly useful in simple scripts (with low values) or
969as a stop gap to shield against fatal memory overflow (with large values).
585 970
586=back 971=back
587 972
588=cut 973=cut
589 974
601 or return undef; 986 or return undef;
602 987
603 *$sym 988 *$sym
604} 989}
605 990
606min_parallel 4; 991min_parallel 8;
607 992
608END { 993END {
609 max_parallel 0; 994 flush;
610} 995};
611 996
6121; 9971;
613 998
614=head2 FORK BEHAVIOUR 999=head2 FORK BEHAVIOUR
1000
1001This module should do "the right thing" when the process using it forks:
615 1002
616Before the fork, IO::AIO enters a quiescent state where no requests 1003Before the fork, IO::AIO enters a quiescent state where no requests
617can 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
618the fork the parent simply leaves the quiescent state and continues 1005the fork the parent simply leaves the quiescent state and continues
619request/result processing, while the child clears the request/result 1006request/result processing, while the child frees the request/result queue
620queue (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
621the parent). Threats will be started on demand until the limit ste in the 1008parent). Threads will be started on demand until the limit set in the
622parent process has been reached again. 1009parent process has been reached again.
623 1010
1011In short: the parent will, after a short pause, continue as if fork had
1012not been called, while the child will act as if IO::AIO has not been used
1013yet.
1014
1015=head2 MEMORY USAGE
1016
1017Per-request usage:
1018
1019Each aio request uses - depending on your architecture - around 100-200
1020bytes of memory. In addition, stat requests need a stat buffer (possibly
1021a few hundred bytes), readdir requires a result buffer and so on. Perl
1022scalars and other data passed into aio requests will also be locked and
1023will consume memory till the request has entered the done state.
1024
1025This is now awfully much, so queuing lots of requests is not usually a
1026problem.
1027
1028Per-thread usage:
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.
1037
624=head1 SEE ALSO 1038=head1 SEE ALSO
625 1039
626L<Coro>, L<Linux::AIO>. 1040L<Coro::AIO>.
627 1041
628=head1 AUTHOR 1042=head1 AUTHOR
629 1043
630 Marc Lehmann <schmorp@schmorp.de> 1044 Marc Lehmann <schmorp@schmorp.de>
631 http://home.schmorp.de/ 1045 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines