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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines