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.50 by root, Sat Jun 24 16:27:02 2006 UTC vs.
Revision 1.67 by root, Tue Oct 24 02:25:16 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 my $req = aio_unlink "/tmp/file", sub { };
24 $req->cancel; # cancel request if still in queue
25
26 my $grp = aio_group sub { print "all stats done\n" };
27 add $grp aio_stat "..." for ...;
28
29 # AnyEvent integration
21 open my $fh, "<&=" . IO::AIO::poll_fileno or die "$!"; 30 open my $fh, "<&=" . IO::AIO::poll_fileno or die "$!";
22 my $w = AnyEvent->io (fh => $fh, poll => 'r', cb => sub { IO::AIO::poll_cb }); 31 my $w = AnyEvent->io (fh => $fh, poll => 'r', cb => sub { IO::AIO::poll_cb });
23 32
24 # Event 33 # Event integration
25 Event->io (fd => IO::AIO::poll_fileno, 34 Event->io (fd => IO::AIO::poll_fileno,
26 poll => 'r', 35 poll => 'r',
27 cb => \&IO::AIO::poll_cb); 36 cb => \&IO::AIO::poll_cb);
28 37
29 # Glib/Gtk2 38 # Glib/Gtk2 integration
30 add_watch Glib::IO IO::AIO::poll_fileno, 39 add_watch Glib::IO IO::AIO::poll_fileno,
31 in => sub { IO::AIO::poll_cb; 1 }; 40 in => sub { IO::AIO::poll_cb; 1 };
32 41
33 # Tk 42 # Tk integration
34 Tk::Event::IO->fileevent (IO::AIO::poll_fileno, "", 43 Tk::Event::IO->fileevent (IO::AIO::poll_fileno, "",
35 readable => \&IO::AIO::poll_cb); 44 readable => \&IO::AIO::poll_cb);
36 45
37 # Danga::Socket 46 # Danga::Socket integration
38 Danga::Socket->AddOtherFds (IO::AIO::poll_fileno => 47 Danga::Socket->AddOtherFds (IO::AIO::poll_fileno =>
39 \&IO::AIO::poll_cb); 48 \&IO::AIO::poll_cb);
40 49
41
42=head1 DESCRIPTION 50=head1 DESCRIPTION
43 51
44This module implements asynchronous I/O using whatever means your 52This module implements asynchronous I/O using whatever means your
45operating system supports. 53operating system supports.
46 54
47Currently, a number of threads are started that execute your read/writes 55Currently, a number of threads are started that execute your read/writes
48and signal their completion. You don't need thread support in your libc or 56and signal their completion. You don't need thread support in perl, and
49perl, and the threads created by this module will not be visible to the 57the threads created by this module will not be visible to perl. In the
50pthreads library. In the future, this module might make use of the native 58future, this module might make use of the native aio functions available
51aio functions available on many operating systems. However, they are often 59on many operating systems. However, they are often not well-supported
52not well-supported (Linux doesn't allow them on normal files currently, 60(Linux doesn't allow them on normal files currently, for example),
53for example), and they would only support aio_read and aio_write, so the 61and they would only support aio_read and aio_write, so the remaining
54remaining functionality would have to be implemented using threads anyway. 62functionality would have to be implemented using threads anyway.
55 63
56Although the module will work with in the presence of other threads, it is 64Although the module will work with in the presence of other threads, it is
57currently not reentrant, so use appropriate locking yourself, always call 65currently not reentrant, so use appropriate locking yourself, always call
58C<poll_cb> from within the same thread, or never call C<poll_cb> (or other 66C<poll_cb> from within the same thread, or never call C<poll_cb> (or other
59C<aio_> functions) recursively. 67C<aio_> functions) recursively.
61=cut 69=cut
62 70
63package IO::AIO; 71package IO::AIO;
64 72
65no warnings; 73no warnings;
74use strict 'vars';
66 75
67use base 'Exporter'; 76use base 'Exporter';
68 77
69use Fcntl ();
70
71BEGIN { 78BEGIN {
72 $VERSION = '1.8'; 79 our $VERSION = '2.0';
73 80
74 @EXPORT = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat 81 our @AIO_REQ = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat
75 aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink 82 aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink
76 aio_fsync aio_fdatasync aio_readahead aio_rename aio_link aio_move); 83 aio_fsync aio_fdatasync aio_readahead aio_rename aio_link aio_move
77 @EXPORT_OK = qw(poll_fileno poll_cb min_parallel max_parallel 84 aio_group aio_nop);
78 max_outstanding nreqs); 85 our @EXPORT = (@AIO_REQ, qw(aioreq_pri));
86 our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush
87 min_parallel max_parallel max_outstanding nreqs);
88
89 @IO::AIO::GRP::ISA = 'IO::AIO::REQ';
79 90
80 require XSLoader; 91 require XSLoader;
81 XSLoader::load IO::AIO, $VERSION; 92 XSLoader::load ("IO::AIO", $VERSION);
82} 93}
83 94
84=head1 FUNCTIONS 95=head1 FUNCTIONS
85 96
86=head2 AIO FUNCTIONS 97=head2 AIO FUNCTIONS
94syscall has been executed asynchronously. 105syscall has been executed asynchronously.
95 106
96All functions expecting a filehandle keep a copy of the filehandle 107All functions expecting a filehandle keep a copy of the filehandle
97internally until the request has finished. 108internally until the request has finished.
98 109
110All requests return objects of type L<IO::AIO::REQ> that allow further
111manipulation of those requests while they are in-flight.
112
99The pathnames you pass to these routines I<must> be absolute and 113The pathnames you pass to these routines I<must> be absolute and
100encoded in byte form. The reason for the former is that at the time the 114encoded in byte form. The reason for the former is that at the time the
101request is being executed, the current working directory could have 115request is being executed, the current working directory could have
102changed. Alternatively, you can make sure that you never change the 116changed. Alternatively, you can make sure that you never change the
103current working directory. 117current working directory.
170 print "read $_[0] bytes: <$buffer>\n"; 184 print "read $_[0] bytes: <$buffer>\n";
171 }; 185 };
172 186
173=item aio_move $srcpath, $dstpath, $callback->($status) 187=item aio_move $srcpath, $dstpath, $callback->($status)
174 188
175[EXPERIMENTAL] 189[EXPERIMENTAL due to internal aio_group use]
176 190
177Try to move the I<file> (directories not supported as either source or destination) 191Try to move the I<file> (directories not supported as either source or
178from C<$srcpath> to C<$dstpath> and call the callback with the C<0> (error) or C<-1> ok. 192destination) from C<$srcpath> to C<$dstpath> and call the callback with
193the C<0> (error) or C<-1> ok.
179 194
180This is a composite request that tries to rename(2) the file first. If 195This is a composite request that tries to rename(2) the file first. If
181rename files with C<EXDEV>, it creates the destination file with mode 0200 196rename files with C<EXDEV>, it creates the destination file with mode 0200
182and copies the contents of the source file into it using C<aio_sendfile>, 197and copies the contents of the source file into it using C<aio_sendfile>,
183followed by restoring atime, mtime, access mode and uid/gid, in that 198followed by restoring atime, mtime, access mode and uid/gid, in that
190=cut 205=cut
191 206
192sub aio_move($$$) { 207sub aio_move($$$) {
193 my ($src, $dst, $cb) = @_; 208 my ($src, $dst, $cb) = @_;
194 209
210 my $grp = aio_group $cb;
211
195 aio_rename $src, $dst, sub { 212 add $grp aio_rename $src, $dst, sub {
196 if ($_[0] && $! == Errno::EXDEV) { 213 if ($_[0] && $! == EXDEV) {
197 aio_open $src, O_RDONLY, 0, sub { 214 add $grp aio_open $src, O_RDONLY, 0, sub {
198 if (my $src_fh = $_[0]) { 215 if (my $src_fh = $_[0]) {
199 my @stat = stat $src_fh; 216 my @stat = stat $src_fh;
200 217
201 aio_open $dst, O_WRONLY, 0200, sub { 218 add $grp aio_open $dst, O_WRONLY, 0200, sub {
202 if (my $dst_fh = $_[0]) { 219 if (my $dst_fh = $_[0]) {
203 aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub { 220 add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
204 close $src_fh; 221 close $src_fh;
205 222
206 if ($_[0] == $stat[7]) { 223 if ($_[0] == $stat[7]) {
207 utime $stat[8], $stat[9], $dst; 224 utime $stat[8], $stat[9], $dst;
208 chmod $stat[2] & 07777, $dst_fh; 225 chmod $stat[2] & 07777, $dst_fh;
209 chown $stat[4], $stat[5], $dst_fh; 226 chown $stat[4], $stat[5], $dst_fh;
210 close $dst_fh; 227 close $dst_fh;
211 228
212 aio_unlink $src, sub { 229 add $grp aio_unlink $src, sub {
213 $cb->($_[0]); 230 $grp->result ($_[0]);
214 }; 231 };
215 } else { 232 } else {
216 my $errno = $!; 233 my $errno = $!;
217 aio_unlink $dst, sub { 234 add $grp aio_unlink $dst, sub {
218 $! = $errno; 235 $! = $errno;
219 $cb->(-1); 236 $grp->result (-1);
220 }; 237 };
221 } 238 }
222 }; 239 };
223 } else { 240 } else {
224 $cb->(-1); 241 $grp->result (-1);
225 } 242 }
226 }, 243 },
227 244
228 } else { 245 } else {
229 $cb->(-1); 246 $grp->result (-1);
230 } 247 }
231 }; 248 };
232 } else { 249 } else {
233 $cb->($_[0]); 250 $grp->result ($_[0]);
234 } 251 }
235 }; 252 };
253
254 $grp
236} 255}
237 256
238=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval) 257=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval)
239 258
240Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts 259Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts
328The callback a single argument which is either C<undef> or an array-ref 347The callback a single argument which is either C<undef> or an array-ref
329with the filenames. 348with the filenames.
330 349
331=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) 350=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs)
332 351
352[EXPERIMENTAL due to internal aio_group use]
353
333Scans a directory (similar to C<aio_readdir>) and tries to separate the 354Scans a directory (similar to C<aio_readdir>) but additionally tries to
334entries of directory C<$path> into two sets of names, ones you can recurse 355separate the entries of directory C<$path> into two sets of names, ones
335into (directories), and ones you cannot recurse into (everything else). 356you can recurse into (directories or links to them), and ones you cannot
357recurse into (everything else).
336 358
337C<aio_scandir> is a composite request that consists of many 359C<aio_scandir> is a composite request that creates of many sub requests_
338aio-primitives. C<$maxreq> specifies the maximum number of outstanding 360C<$maxreq> specifies the maximum number of outstanding aio requests that
339aio requests that this function generates. If it is C<< <= 0 >>, then a 361this function generates. If it is C<< <= 0 >>, then a suitable default
340suitable default will be chosen (currently 8). 362will be chosen (currently 6).
341 363
342On error, the callback is called without arguments, otherwise it receives 364On error, the callback is called without arguments, otherwise it receives
343two array-refs with path-relative entry names. 365two array-refs with path-relative entry names.
344 366
345Example: 367Example:
353Implementation notes. 375Implementation notes.
354 376
355The C<aio_readdir> cannot be avoided, but C<stat()>'ing every entry can. 377The C<aio_readdir> cannot be avoided, but C<stat()>'ing every entry can.
356 378
357After reading the directory, the modification time, size etc. of the 379After reading the directory, the modification time, size etc. of the
358directory before and after the readdir is checked, and if they match, the 380directory before and after the readdir is checked, and if they match (and
359link count will be used to decide how many entries are directories (if 381isn't the current time), the link count will be used to decide how many
360>= 2). Otherwise, no knowledge of the number of subdirectories will be 382entries are directories (if >= 2). Otherwise, no knowledge of the number
361assumed. 383of subdirectories will be assumed.
362 384
363Then entires will be sorted into likely directories (everything without a 385Then entries will be sorted into likely directories (everything without
364non-initial dot) and likely non-directories (everything else). Then every 386a non-initial dot currently) and likely non-directories (everything
365entry + C</.> will be C<stat>'ed, likely directories first. This is often 387else). Then every entry plus an appended C</.> will be C<stat>'ed,
388likely directories first. If that succeeds, it assumes that the entry
389is a directory or a symlink to directory (which will be checked
390seperately). This is often faster than stat'ing the entry itself because
366faster because filesystems might detect the type of the entry without 391filesystems might detect the type of the entry without reading the inode
367reading the inode data (e.g. ext2fs filetype feature). If that succeeds, 392data (e.g. ext2fs filetype feature).
368it assumes that the entry is a directory or a symlink to directory (which
369will be checked seperately).
370 393
371If the known number of directories has been reached, the rest of the 394If the known number of directories (link count - 2) has been reached, the
372entries is assumed to be non-directories. 395rest of the entries is assumed to be non-directories.
396
397This only works with certainty on POSIX (= UNIX) filesystems, which
398fortunately are the vast majority of filesystems around.
399
400It will also likely work on non-POSIX filesystems with reduced efficiency
401as those tend to return 0 or 1 as link counts, which disables the
402directory counting heuristic.
373 403
374=cut 404=cut
375 405
376sub aio_scandir($$$) { 406sub aio_scandir($$$) {
377 my ($path, $maxreq, $cb) = @_; 407 my ($path, $maxreq, $cb) = @_;
378 408
409 my $grp = aio_group $cb;
410
379 $maxreq = 8 if $maxreq <= 0; 411 $maxreq = 6 if $maxreq <= 0;
380 412
381 # stat once 413 # stat once
382 aio_stat $path, sub { 414 add $grp aio_stat $path, sub {
383 return $cb->() if $_[0]; 415 return $grp->result () if $_[0];
416 my $now = time;
384 my $hash1 = join ":", (stat _)[0,1,3,7,9]; 417 my $hash1 = join ":", (stat _)[0,1,3,7,9];
385 418
386 # read the directory entries 419 # read the directory entries
387 aio_readdir $path, sub { 420 add $grp aio_readdir $path, sub {
388 my $entries = shift 421 my $entries = shift
389 or return $cb->(); 422 or return $grp->result ();
390 423
391 # stat the dir another time 424 # stat the dir another time
392 aio_stat $path, sub { 425 add $grp aio_stat $path, sub {
393 my $hash2 = join ":", (stat _)[0,1,3,7,9]; 426 my $hash2 = join ":", (stat _)[0,1,3,7,9];
394 427
395 my $ndirs; 428 my $ndirs;
396 429
397 # take the slow route if anything looks fishy 430 # take the slow route if anything looks fishy
398 if ($hash1 ne $hash2) { 431 if ($hash1 ne $hash2 or (stat _)[9] == $now) {
399 $ndirs = -1; 432 $ndirs = -1;
400 } else { 433 } else {
401 # if nlink == 2, we are finished 434 # if nlink == 2, we are finished
402 # on non-posix-fs's, we rely on nlink < 2 435 # on non-posix-fs's, we rely on nlink < 2
403 $ndirs = (stat _)[3] - 2 436 $ndirs = (stat _)[3] - 2
404 or return $cb->([], $entries); 437 or return $grp->result ([], $entries);
405 } 438 }
406 439
407 # sort into likely dirs and likely nondirs 440 # sort into likely dirs and likely nondirs
408 # dirs == files without ".", short entries first 441 # dirs == files without ".", short entries first
409 $entries = [map $_->[0], 442 $entries = [map $_->[0],
414 my (@dirs, @nondirs); 447 my (@dirs, @nondirs);
415 448
416 my ($statcb, $schedcb); 449 my ($statcb, $schedcb);
417 my $nreq = 0; 450 my $nreq = 0;
418 451
452 my $statgrp = add $grp aio_group;
453
419 $schedcb = sub { 454 $schedcb = sub {
420 if (@$entries) { 455 if (@$entries) {
421 if ($nreq < $maxreq) { 456 if ($nreq < $maxreq) {
422 my $ent = pop @$entries; 457 my $ent = pop @$entries;
423 $nreq++; 458 $nreq++;
424 aio_stat "$path/$ent/.", sub { $statcb->($_[0], $ent) }; 459 add $statgrp aio_stat "$path/$ent/.", sub { $statcb->($_[0], $ent) };
425 } 460 }
426 } elsif (!$nreq) { 461 } elsif (!$nreq) {
427 # finished 462 # finished
463 $statgrp->cancel;
428 undef $statcb; 464 undef $statcb;
429 undef $schedcb; 465 undef $schedcb;
430 $cb->(\@dirs, \@nondirs) if $cb; 466 $grp->result (\@dirs, \@nondirs);
431 undef $cb;
432 } 467 }
433 }; 468 };
434 $statcb = sub { 469 $statcb = sub {
435 my ($status, $entry) = @_; 470 my ($status, $entry) = @_;
436 471
438 $nreq--; 473 $nreq--;
439 push @nondirs, $entry; 474 push @nondirs, $entry;
440 &$schedcb; 475 &$schedcb;
441 } else { 476 } else {
442 # need to check for real directory 477 # need to check for real directory
443 aio_lstat "$path/$entry", sub { 478 add $grp aio_lstat "$path/$entry", sub {
444 $nreq--; 479 $nreq--;
445 480
446 if (-d _) { 481 if (-d _) {
447 push @dirs, $entry; 482 push @dirs, $entry;
448 483
461 496
462 &$schedcb while @$entries && $nreq < $maxreq; 497 &$schedcb while @$entries && $nreq < $maxreq;
463 }; 498 };
464 }; 499 };
465 }; 500 };
501
502 $grp
466} 503}
467 504
468=item aio_fsync $fh, $callback->($status) 505=item aio_fsync $fh, $callback->($status)
469 506
470Asynchronously call fsync on the given filehandle and call the callback 507Asynchronously call fsync on the given filehandle and call the callback
475Asynchronously call fdatasync on the given filehandle and call the 512Asynchronously call fdatasync on the given filehandle and call the
476callback with the fdatasync result code. 513callback with the fdatasync result code.
477 514
478If this call isn't available because your OS lacks it or it couldn't be 515If this call isn't available because your OS lacks it or it couldn't be
479detected, it will be emulated by calling C<fsync> instead. 516detected, it will be emulated by calling C<fsync> instead.
517
518=item aio_group $callback->(...)
519
520[EXPERIMENTAL]
521
522This is a very special aio request: Instead of doing something, it is a
523container for other aio requests, which is useful if you want to bundle
524many requests into a single, composite, request.
525
526Returns an object of class L<IO::AIO::GRP>. See its documentation below
527for more info.
528
529Example:
530
531 my $grp = aio_group sub {
532 print "all stats done\n";
533 };
534
535 add $grp
536 (aio_stat ...),
537 (aio_stat ...),
538 ...;
539
540=item aio_nop $callback->()
541
542This is a special request - it does nothing in itself and is only used for
543side effects, such as when you want to add a dummy request to a group so
544that finishing the requests in the group depends on executing the given
545code.
546
547While this request does nothing, it still goes through the execution
548phase and still requires a worker thread. Thus, the callback will not
549be executed immediately but only after other requests in the queue have
550entered their execution phase. This can be used to measure request
551latency.
552
553=item IO::AIO::aio_sleep $fractional_seconds, $callback->() *NOT EXPORTED*
554
555Mainly used for debugging and benchmarking, this aio request puts one of
556the request workers to sleep for the given time.
557
558While it is theoretically handy to have simple I/O scheduling requests
559like sleep and file handle readable/writable, the overhead this creates
560is immense, so do not use this function except to put your application
561under artificial I/O pressure.
562
563=back
564
565=head2 IO::AIO::REQ CLASS
566
567All non-aggregate C<aio_*> functions return an object of this class when
568called in non-void context.
569
570A request always moves through the following five states in its lifetime,
571in order: B<ready> (request has been created, but has not been executed
572yet), B<execute> (request is currently being executed), B<pending>
573(request has been executed but callback has not been called yet),
574B<result> (results are being processed synchronously, includes calling the
575callback) and B<done> (request has reached the end of its lifetime and
576holds no resources anymore).
577
578=over 4
579
580=item cancel $req
581
582Cancels the request, if possible. Has the effect of skipping execution
583when entering the B<execute> state and skipping calling the callback when
584entering the the B<result> state, but will leave the request otherwise
585untouched. That means that requests that currently execute will not be
586stopped and resources held by the request will not be freed prematurely.
587
588=item cb $req $callback->(...)
589
590Replace (or simply set) the callback registered to the request.
591
592=back
593
594=head2 IO::AIO::GRP CLASS
595
596This class is a subclass of L<IO::AIO::REQ>, so all its methods apply to
597objects of this class, too.
598
599A IO::AIO::GRP object is a special request that can contain multiple other
600aio requests.
601
602You create one by calling the C<aio_group> constructing function with a
603callback that will be called when all contained requests have entered the
604C<done> state:
605
606 my $grp = aio_group sub {
607 print "all requests are done\n";
608 };
609
610You add requests by calling the C<add> method with one or more
611C<IO::AIO::REQ> objects:
612
613 $grp->add (aio_unlink "...");
614
615 add $grp aio_stat "...", sub {
616 $_[0] or return $grp->result ("error");
617
618 # add another request dynamically, if first succeeded
619 add $grp aio_open "...", sub {
620 $grp->result ("ok");
621 };
622 };
623
624This makes it very easy to create composite requests (see the source of
625C<aio_move> for an application) that work and feel like simple requests.
626
627=over 4
628
629=item * The IO::AIO::GRP objects will be cleaned up during calls to
630C<IO::AIO::poll_cb>, just like any other request.
631
632=item * They can be canceled like any other request. Canceling will cancel not
633only the request itself, but also all requests it contains.
634
635=item * They can also can also be added to other IO::AIO::GRP objects.
636
637=item * You must not add requests to a group from within the group callback (or
638any later time).
639
640=item * This does not harmonise well with C<max_outstanding>, so best do
641not combine C<aio_group> with it. Groups and feeders are recommended for
642this kind of concurrency-limiting.
643
644=back
645
646Their lifetime, simplified, looks like this: when they are empty, they
647will finish very quickly. If they contain only requests that are in the
648C<done> state, they will also finish. Otherwise they will continue to
649exist.
650
651That means after creating a group you have some time to add requests. And
652in the callbacks of those requests, you can add further requests to the
653group. And only when all those requests have finished will the the group
654itself finish.
655
656=over 4
657
658=item add $grp ...
659
660=item $grp->add (...)
661
662Add one or more requests to the group. Any type of L<IO::AIO::REQ> can
663be added, including other groups, as long as you do not create circular
664dependencies.
665
666Returns all its arguments.
667
668=item $grp->result (...)
669
670Set the result value(s) that will be passed to the group callback when all
671subrequests have finished. By default, no argument will be passed.
672
673=item feed $grp $callback->($grp)
674
675[VERY EXPERIMENTAL]
676
677Sets a feeder/generator on this group: every group can have an attached
678generator that generates requests if idle. The idea behind this is that,
679although you could just queue as many requests as you want in a group,
680this might starve other requests for a potentially long time. For
681example, C<aio_scandir> might generate hundreds of thousands C<aio_stat>
682requests, delaying any later requests for a long time.
683
684To avoid this, and allow incremental generation of requests, you can
685instead a group and set a feeder on it that generates those requests. The
686feed callback will be called whenever there are few enough (see C<feed_limit>,
687below) requests active in the group itself and is expected to queue more
688requests.
689
690The feed can queue as many requests as it likes (i.e. C<add> does not
691impose any limits).
692
693If the feed does not queue more requests when called, it will be
694automatically removed from the group.
695
696If the feed limit is C<0>, it will be set to C<2> automatically.
697
698Example:
699
700 # stat all files in @files, but only ever use four aio requests concurrently:
701
702 my $grp = aio_group sub { print "finished\n" };
703 feed_limit $grp 4;
704 feed $grp sub {
705 my $file = pop @files
706 or return;
707
708 add $grp aio_stat $file, sub { ... };
709 };
710
711=item feed_limit $grp $num
712
713Sets the feeder limit for the group: The feeder will be called whenever
714the group contains less than this many requests.
715
716Setting the limit to C<0> will pause the feeding process.
480 717
481=back 718=back
482 719
483=head2 SUPPORT FUNCTIONS 720=head2 SUPPORT FUNCTIONS
484 721
542 IO::AIO::poll_wait, IO::AIO::poll_cb 779 IO::AIO::poll_wait, IO::AIO::poll_cb
543 if IO::AIO::nreqs; 780 if IO::AIO::nreqs;
544 781
545=item IO::AIO::min_parallel $nthreads 782=item IO::AIO::min_parallel $nthreads
546 783
547Set the minimum number of AIO threads to C<$nthreads>. The current default 784Set the minimum number of AIO threads to C<$nthreads>. The current
548is C<4>, which means four asynchronous operations can be done at one time 785default is C<8>, which means eight asynchronous operations can execute
549(the number of outstanding operations, however, is unlimited). 786concurrently at any one time (the number of outstanding requests,
787however, is unlimited).
550 788
551IO::AIO starts threads only on demand, when an AIO request is queued and 789IO::AIO starts threads only on demand, when an AIO request is queued and
552no free thread exists. 790no free thread exists.
553 791
554It is recommended to keep the number of threads low, as some Linux 792It is recommended to keep the number of threads relatively low, as some
555kernel versions will scale negatively with the number of threads (higher 793Linux kernel versions will scale negatively with the number of threads
556parallelity => MUCH higher latency). With current Linux 2.6 versions, 4-32 794(higher parallelity => MUCH higher latency). With current Linux 2.6
557threads should be fine. 795versions, 4-32 threads should be fine.
558 796
559Under most circumstances you don't need to call this function, as the 797Under most circumstances you don't need to call this function, as the
560module selects a default that is suitable for low to moderate load. 798module selects a default that is suitable for low to moderate load.
561 799
562=item IO::AIO::max_parallel $nthreads 800=item IO::AIO::max_parallel $nthreads
573 811
574Under normal circumstances you don't need to call this function. 812Under normal circumstances you don't need to call this function.
575 813
576=item $oldnreqs = IO::AIO::max_outstanding $nreqs 814=item $oldnreqs = IO::AIO::max_outstanding $nreqs
577 815
816[DEPRECATED]
817
578Sets the maximum number of outstanding requests to C<$nreqs>. If you 818Sets the maximum number of outstanding requests to C<$nreqs>. If you
579try to queue up more than this number of requests, the caller will block until 819try to queue up more than this number of requests, the caller will block until
580some requests have been handled. 820some requests have been handled.
581 821
582The default is very large, so normally there is no practical limit. If you 822The default is very large, so normally there is no practical limit. If you
583queue up many requests in a loop it often improves speed if you set 823queue up many requests in a loop it often improves speed if you set
584this to a relatively low number, such as C<100>. 824this to a relatively low number, such as C<100>.
825
826This function does not work well together with C<aio_group>'s, and their
827feeder interface is better suited to limiting concurrency, so do not use
828this function.
585 829
586Under normal circumstances you don't need to call this function. 830Under normal circumstances you don't need to call this function.
587 831
588=back 832=back
589 833
603 or return undef; 847 or return undef;
604 848
605 *$sym 849 *$sym
606} 850}
607 851
608min_parallel 4; 852min_parallel 8;
609 853
610END { 854END {
611 max_parallel 0; 855 max_parallel 0;
612} 856}
613 857
6141; 8581;
615 859
616=head2 FORK BEHAVIOUR 860=head2 FORK BEHAVIOUR
861
862This module should do "the right thing" when the process using it forks:
617 863
618Before the fork, IO::AIO enters a quiescent state where no requests 864Before the fork, IO::AIO enters a quiescent state where no requests
619can be added in other threads and no results will be processed. After 865can be added in other threads and no results will be processed. After
620the fork the parent simply leaves the quiescent state and continues 866the fork the parent simply leaves the quiescent state and continues
621request/result processing, while the child clears the request/result 867request/result processing, while the child clears the request/result
622queue (so the requests started before the fork will only be handled in 868queue (so the requests started before the fork will only be handled in
623the parent). Threats will be started on demand until the limit ste in the 869the parent). Threads will be started on demand until the limit ste in the
624parent process has been reached again. 870parent process has been reached again.
625 871
872In short: the parent will, after a short pause, continue as if fork had
873not been called, while the child will act as if IO::AIO has not been used
874yet.
875
876=head2 MEMORY USAGE
877
878Each aio request uses - depending on your architecture - around 128 bytes
879of memory. In addition, stat requests need a stat buffer (possibly a few
880hundred bytes). Perl scalars and other data passed into aio requests will
881also be locked.
882
883This is now awfully much, so queuing lots of requests is not usually a
884problem.
885
886Each thread needs a stack area which is usually around 16k, sometimes much
887larger, depending on the OS.
888
626=head1 SEE ALSO 889=head1 SEE ALSO
627 890
628L<Coro>, L<Linux::AIO>. 891L<Coro>, L<Linux::AIO> (obsolete).
629 892
630=head1 AUTHOR 893=head1 AUTHOR
631 894
632 Marc Lehmann <schmorp@schmorp.de> 895 Marc Lehmann <schmorp@schmorp.de>
633 http://home.schmorp.de/ 896 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines