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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines