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.41 by root, Wed Sep 7 17:41:17 2005 UTC vs.
Revision 1.53 by root, Sat Oct 21 23:20:29 2006 UTC

14 aio_unlink "/tmp/file", sub { }; 14 aio_unlink "/tmp/file", sub { };
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
20 use IO::AIO 2; # version has aio objects
21
22 my $req = aio_unlink "/tmp/file", sub { };
23 $req->cancel; # cancel request if still in queue
24
25 # AnyEvent
26 open my $fh, "<&=" . IO::AIO::poll_fileno or die "$!";
27 my $w = AnyEvent->io (fh => $fh, poll => 'r', cb => sub { IO::AIO::poll_cb });
19 28
20 # Event 29 # Event
21 Event->io (fd => IO::AIO::poll_fileno, 30 Event->io (fd => IO::AIO::poll_fileno,
22 poll => 'r', 31 poll => 'r',
23 cb => \&IO::AIO::poll_cb); 32 cb => \&IO::AIO::poll_cb);
57=cut 66=cut
58 67
59package IO::AIO; 68package IO::AIO;
60 69
61no warnings; 70no warnings;
71use strict 'vars';
62 72
63use base 'Exporter'; 73use base 'Exporter';
64 74
65use Fcntl ();
66
67BEGIN { 75BEGIN {
68 $VERSION = '1.61'; 76 our $VERSION = '1.99';
69 77
70 @EXPORT = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat 78 our @EXPORT = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat
71 aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink 79 aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink
72 aio_fsync aio_fdatasync aio_readahead); 80 aio_fsync aio_fdatasync aio_readahead aio_rename aio_link aio_move);
73 @EXPORT_OK = qw(poll_fileno poll_cb min_parallel max_parallel 81 our @EXPORT_OK = qw(poll_fileno poll_cb min_parallel max_parallel max_outstanding nreqs);
74 max_outstanding nreqs);
75 82
76 require XSLoader; 83 require XSLoader;
77 XSLoader::load IO::AIO, $VERSION; 84 XSLoader::load ("IO::AIO", $VERSION);
78} 85}
79 86
80=head1 FUNCTIONS 87=head1 FUNCTIONS
81 88
82=head2 AIO FUNCTIONS 89=head2 AIO FUNCTIONS
89perl, which usually delivers "false") as it's sole argument when the given 96perl, which usually delivers "false") as it's sole argument when the given
90syscall has been executed asynchronously. 97syscall has been executed asynchronously.
91 98
92All functions expecting a filehandle keep a copy of the filehandle 99All functions expecting a filehandle keep a copy of the filehandle
93internally until the request has finished. 100internally until the request has finished.
101
102All non-composite requests (requests that are not broken down into
103multiple requests) return objects of type L<IO::AIO::REQ> that allow
104further manipulation of running requests.
94 105
95The pathnames you pass to these routines I<must> be absolute and 106The pathnames you pass to these routines I<must> be absolute and
96encoded in byte form. The reason for the former is that at the time the 107encoded in byte form. The reason for the former is that at the time the
97request is being executed, the current working directory could have 108request is being executed, the current working directory could have
98changed. Alternatively, you can make sure that you never change the 109changed. Alternatively, you can make sure that you never change the
164 aio_read $fh, 7, 15, $buffer, 0, sub { 175 aio_read $fh, 7, 15, $buffer, 0, sub {
165 $_[0] > 0 or die "read error: $!"; 176 $_[0] > 0 or die "read error: $!";
166 print "read $_[0] bytes: <$buffer>\n"; 177 print "read $_[0] bytes: <$buffer>\n";
167 }; 178 };
168 179
180=item aio_move $srcpath, $dstpath, $callback->($status)
181
182Try to move the I<file> (directories not supported as either source or
183destination) from C<$srcpath> to C<$dstpath> and call the callback with
184the C<0> (error) or C<-1> ok.
185
186This is a composite request that tries to rename(2) the file first. If
187rename files with C<EXDEV>, it creates the destination file with mode 0200
188and copies the contents of the source file into it using C<aio_sendfile>,
189followed by restoring atime, mtime, access mode and uid/gid, in that
190order, and unlinking the C<$srcpath>.
191
192If an error occurs, the partial destination file will be unlinked, if
193possible, except when setting atime, mtime, access mode and uid/gid, where
194errors are being ignored.
195
196=cut
197
198sub aio_move($$$) {
199 my ($src, $dst, $cb) = @_;
200
201 aio_rename $src, $dst, sub {
202 if ($_[0] && $! == EXDEV) {
203 aio_open $src, O_RDONLY, 0, sub {
204 if (my $src_fh = $_[0]) {
205 my @stat = stat $src_fh;
206
207 aio_open $dst, O_WRONLY, 0200, sub {
208 if (my $dst_fh = $_[0]) {
209 aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
210 close $src_fh;
211
212 if ($_[0] == $stat[7]) {
213 utime $stat[8], $stat[9], $dst;
214 chmod $stat[2] & 07777, $dst_fh;
215 chown $stat[4], $stat[5], $dst_fh;
216 close $dst_fh;
217
218 aio_unlink $src, sub {
219 $cb->($_[0]);
220 };
221 } else {
222 my $errno = $!;
223 aio_unlink $dst, sub {
224 $! = $errno;
225 $cb->(-1);
226 };
227 }
228 };
229 } else {
230 $cb->(-1);
231 }
232 },
233
234 } else {
235 $cb->(-1);
236 }
237 };
238 } else {
239 $cb->($_[0]);
240 }
241 };
242}
243
169=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval) 244=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval)
170 245
171Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts 246Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts
172reading at byte offset C<$in_offset>, and starts writing at the current 247reading at byte offset C<$in_offset>, and starts writing at the current
173file offset of C<$out_fh>. Because of that, it is not safe to issue more 248file offset of C<$out_fh>. Because of that, it is not safe to issue more
228=item aio_unlink $pathname, $callback->($status) 303=item aio_unlink $pathname, $callback->($status)
229 304
230Asynchronously unlink (delete) a file and call the callback with the 305Asynchronously unlink (delete) a file and call the callback with the
231result code. 306result code.
232 307
308=item aio_link $srcpath, $dstpath, $callback->($status)
309
310Asynchronously create a new link to the existing object at C<$srcpath> at
311the path C<$dstpath> and call the callback with the result code.
312
313=item aio_symlink $srcpath, $dstpath, $callback->($status)
314
315Asynchronously create a new symbolic link to the existing object at C<$srcpath> at
316the path C<$dstpath> and call the callback with the result code.
317
318=item aio_rename $srcpath, $dstpath, $callback->($status)
319
320Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as
321rename(2) and call the callback with the result code.
322
233=item aio_rmdir $pathname, $callback->($status) 323=item aio_rmdir $pathname, $callback->($status)
234 324
235Asynchronously rmdir (delete) a directory and call the callback with the 325Asynchronously rmdir (delete) a directory and call the callback with the
236result code. 326result code.
237 327
238=item aio_readdir $pathname $callback->($entries) 328=item aio_readdir $pathname, $callback->($entries)
239 329
240Unlike the POSIX call of the same name, C<aio_readdir> reads an entire 330Unlike the POSIX call of the same name, C<aio_readdir> reads an entire
241directory (i.e. opendir + readdir + closedir). The entries will not be 331directory (i.e. opendir + readdir + closedir). The entries will not be
242sorted, and will B<NOT> include the C<.> and C<..> entries. 332sorted, and will B<NOT> include the C<.> and C<..> entries.
243 333
244The callback a single argument which is either C<undef> or an array-ref 334The callback a single argument which is either C<undef> or an array-ref
245with the filenames. 335with the filenames.
246 336
247=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) 337=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs)
248 338
249Scans a directory (similar to C<aio_readdir>) and tries to separate the 339Scans a directory (similar to C<aio_readdir>) but additionally tries to
250entries of directory C<$path> into two sets of names, ones you can recurse 340separate the entries of directory C<$path> into two sets of names, ones
251into (directories), and ones you cannot recurse into (everything else). 341you can recurse into (directories or links to them), and ones you cannot
342recurse into (everything else).
252 343
253C<aio_scandir> is a composite request that consists of many 344C<aio_scandir> is a composite request that consists of many sub
254aio-primitives. C<$maxreq> specifies the maximum number of outstanding 345requests. C<$maxreq> specifies the maximum number of outstanding aio
255aio requests that this function generates. If it is C<< <= 0 >>, then a 346requests that this function generates. If it is C<< <= 0 >>, then a
256suitable default will be chosen (currently 8). 347suitable default will be chosen (currently 8).
257 348
258On error, the callback is called without arguments, otherwise it receives 349On error, the callback is called without arguments, otherwise it receives
259two array-refs with path-relative entry names. 350two array-refs with path-relative entry names.
260 351
269Implementation notes. 360Implementation notes.
270 361
271The C<aio_readdir> cannot be avoided, but C<stat()>'ing every entry can. 362The C<aio_readdir> cannot be avoided, but C<stat()>'ing every entry can.
272 363
273After reading the directory, the modification time, size etc. of the 364After reading the directory, the modification time, size etc. of the
274directory before and after the readdir is checked, and if they match, the 365directory before and after the readdir is checked, and if they match (and
275link count will be used to decide how many entries are directories (if 366isn't the current time), the link count will be used to decide how many
276>= 2). Otherwise, no knowledge of the number of subdirectories will be 367entries are directories (if >= 2). Otherwise, no knowledge of the number
277assumed. 368of subdirectories will be assumed.
278 369
279Then entires will be sorted into likely directories (everything without a 370Then entries will be sorted into likely directories (everything without
280non-initial dot) and likely non-directories (everything else). Then every 371a non-initial dot currently) and likely non-directories (everything
281entry + C</.> will be C<stat>'ed, likely directories first. This is often 372else). Then every entry plus an appended C</.> will be C<stat>'ed,
373likely directories first. If that succeeds, it assumes that the entry
374is a directory or a symlink to directory (which will be checked
375seperately). This is often faster than stat'ing the entry itself because
282faster because filesystems might detect the type of the entry without 376filesystems might detect the type of the entry without reading the inode
283reading the inode data (e.g. ext2s filetype feature). If that succeeds, 377data (e.g. ext2fs filetype feature).
284it assumes that the entry is a directory or a symlink to directory (which
285will be checked seperately).
286 378
287If the known number of directories has been reached, the rest of the 379If the known number of directories (link count - 2) has been reached, the
288entries is assumed to be non-directories. 380rest of the entries is assumed to be non-directories.
381
382This only works with certainty on POSIX (= UNIX) filesystems, which
383fortunately are the vast majority of filesystems around.
384
385It will also likely work on non-POSIX filesystems with reduced efficiency
386as those tend to return 0 or 1 as link counts, which disables the
387directory counting heuristic.
289 388
290=cut 389=cut
291 390
292sub aio_scandir($$$) { 391sub aio_scandir($$$) {
293 my ($path, $maxreq, $cb) = @_; 392 my ($path, $maxreq, $cb) = @_;
294 393
295 $maxreq = 8 if $maxreq <= 0; 394 $maxreq = 8 if $maxreq <= 0;
296 395
297 # stat once 396 # stat once
298 aio_stat $path, sub { 397 aio_stat $path, sub {
299 $cb->() if $_[0]; 398 return $cb->() if $_[0];
399 my $now = time;
300 my $hash1 = join ":", (stat _)[0,1,3,7,9]; 400 my $hash1 = join ":", (stat _)[0,1,3,7,9];
301 401
302 # read the directory entries 402 # read the directory entries
303 aio_readdir $path, sub { 403 aio_readdir $path, sub {
304 my $entries = shift 404 my $entries = shift
309 my $hash2 = join ":", (stat _)[0,1,3,7,9]; 409 my $hash2 = join ":", (stat _)[0,1,3,7,9];
310 410
311 my $ndirs; 411 my $ndirs;
312 412
313 # take the slow route if anything looks fishy 413 # take the slow route if anything looks fishy
314 if ($hash1 ne $hash2) { 414 if ($hash1 ne $hash2 or (stat _)[9] == $now) {
315 $ndirs = -1; 415 $ndirs = -1;
316 } else { 416 } else {
317 # if nlink == 2, we are finished 417 # if nlink == 2, we are finished
318 # on non-posix-fs's, we rely on nlink < 2 418 # on non-posix-fs's, we rely on nlink < 2
319 $ndirs = (stat _)[3] - 2 419 $ndirs = (stat _)[3] - 2
320 or $cb->([], $entries); 420 or return $cb->([], $entries);
321 } 421 }
322 422
323 # sort into likely dirs and likely nondirs 423 # sort into likely dirs and likely nondirs
324 # dirs == files without ".", short entries first 424 # dirs == files without ".", short entries first
325 $entries = [map $_->[0], 425 $entries = [map $_->[0],
341 } 441 }
342 } elsif (!$nreq) { 442 } elsif (!$nreq) {
343 # finished 443 # finished
344 undef $statcb; 444 undef $statcb;
345 undef $schedcb; 445 undef $schedcb;
346 $cb->(\@dirs, \@nondirs); 446 $cb->(\@dirs, \@nondirs) if $cb;
347 undef $cb; 447 undef $cb;
348 } 448 }
349 }; 449 };
350 $statcb = sub { 450 $statcb = sub {
351 my ($status, $entry) = @_; 451 my ($status, $entry) = @_;
394If this call isn't available because your OS lacks it or it couldn't be 494If this call isn't available because your OS lacks it or it couldn't be
395detected, it will be emulated by calling C<fsync> instead. 495detected, it will be emulated by calling C<fsync> instead.
396 496
397=back 497=back
398 498
499=head2 IO::AIO::REQ CLASS
500
501All non-aggregate C<aio_*> functions return an object of this class when
502called in non-void context.
503
504A request always moves through the following five states in its lifetime,
505in order: B<ready> (request has been created, but has not been executed
506yet), B<execute> (request is currently being executed), B<pending>
507(request has been executed but callback has not been called yet),
508B<result> (results are being processed synchronously, includes calling the
509callback) and B<done> (request has reached the end of its lifetime and
510holds no resources anymore).
511
512=over 4
513
514=item $req->cancel
515
516Cancels the request, if possible. Has the effect of skipping execution
517when entering the B<execute> state and skipping calling the callback when
518entering the the B<result> state, but will leave the request otherwise
519untouched. That means that requests that currently execute will not be
520stopped and resources held by the request will not be freed prematurely.
521
522=back
523
399=head2 SUPPORT FUNCTIONS 524=head2 SUPPORT FUNCTIONS
400 525
401=over 4 526=over 4
402 527
403=item $fileno = IO::AIO::poll_fileno 528=item $fileno = IO::AIO::poll_fileno
528} 653}
529 654
5301; 6551;
531 656
532=head2 FORK BEHAVIOUR 657=head2 FORK BEHAVIOUR
658
659This module should do "the right thing" when the process using it forks:
533 660
534Before the fork, IO::AIO enters a quiescent state where no requests 661Before the fork, IO::AIO enters a quiescent state where no requests
535can be added in other threads and no results will be processed. After 662can be added in other threads and no results will be processed. After
536the fork the parent simply leaves the quiescent state and continues 663the fork the parent simply leaves the quiescent state and continues
537request/result processing, while the child clears the request/result 664request/result processing, while the child clears the request/result
538queue (so the requests started before the fork will only be handled in 665queue (so the requests started before the fork will only be handled in
539the parent). Threats will be started on demand until the limit ste in the 666the parent). Threads will be started on demand until the limit ste in the
540parent process has been reached again. 667parent process has been reached again.
541 668
669In short: the parent will, after a short pause, continue as if fork had
670not been called, while the child will act as if IO::AIO has not been used
671yet.
672
542=head1 SEE ALSO 673=head1 SEE ALSO
543 674
544L<Coro>, L<Linux::AIO>. 675L<Coro>, L<Linux::AIO> (obsolete).
545 676
546=head1 AUTHOR 677=head1 AUTHOR
547 678
548 Marc Lehmann <schmorp@schmorp.de> 679 Marc Lehmann <schmorp@schmorp.de>
549 http://home.schmorp.de/ 680 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines