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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines