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.56 by root, Sun Oct 22 00:53:47 2006 UTC vs.
Revision 1.100 by root, Sun Jan 7 21:36:58 2007 UTC

5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 use IO::AIO; 7 use IO::AIO;
8 8
9 aio_open "/etc/passwd", O_RDONLY, 0, sub { 9 aio_open "/etc/passwd", O_RDONLY, 0, sub {
10 my ($fh) = @_; 10 my $fh = shift
11 or die "/etc/passwd: $!";
11 ... 12 ...
12 }; 13 };
13 14
14 aio_unlink "/tmp/file", sub { }; 15 aio_unlink "/tmp/file", sub { };
15 16
18 }; 19 };
19 20
20 # version 2+ has request and group objects 21 # version 2+ has request and group objects
21 use IO::AIO 2; 22 use IO::AIO 2;
22 23
24 aioreq_pri 4; # give next request a very high priority
23 my $req = aio_unlink "/tmp/file", sub { }; 25 my $req = aio_unlink "/tmp/file", sub { };
24 $req->cancel; # cancel request if still in queue 26 $req->cancel; # cancel request if still in queue
25 27
26 my $grp = aio_group sub { print "all stats done\n" }; 28 my $grp = aio_group sub { print "all stats done\n" };
27 add $grp aio_stat "..." for ...; 29 add $grp aio_stat "..." for ...;
50=head1 DESCRIPTION 52=head1 DESCRIPTION
51 53
52This module implements asynchronous I/O using whatever means your 54This module implements asynchronous I/O using whatever means your
53operating system supports. 55operating system supports.
54 56
57Asynchronous means that operations that can normally block your program
58(e.g. reading from disk) will be done asynchronously: the operation
59will still block, but you can do something else in the meantime. This
60is extremely useful for programs that need to stay interactive even
61when doing heavy I/O (GUI programs, high performance network servers
62etc.), but can also be used to easily do operations in parallel that are
63normally done sequentially, e.g. stat'ing many files, which is much faster
64on a RAID volume or over NFS when you do a number of stat operations
65concurrently.
66
67While most of this works on all types of file descriptors (for example
68sockets), using these functions on file descriptors that support
69nonblocking operation (again, sockets, pipes etc.) is very inefficient or
70might not work (aio_read fails on sockets/pipes/fifos). Use an event loop
71for that (such as the L<Event|Event> module): IO::AIO will naturally fit
72into such an event loop itself.
73
55Currently, a number of threads are started that execute your read/writes 74In this version, a number of threads are started that execute your
56and signal their completion. You don't need thread support in your libc or 75requests and signal their completion. You don't need thread support
57perl, and the threads created by this module will not be visible to the 76in perl, and the threads created by this module will not be visible
58pthreads library. In the future, this module might make use of the native 77to perl. In the future, this module might make use of the native aio
59aio functions available on many operating systems. However, they are often 78functions available on many operating systems. However, they are often
60not well-supported (Linux doesn't allow them on normal files currently, 79not well-supported or restricted (GNU/Linux doesn't allow them on normal
61for example), and they would only support aio_read and aio_write, so the 80files currently, for example), and they would only support aio_read and
62remaining functionality would have to be implemented using threads anyway. 81aio_write, so the remaining functionality would have to be implemented
82using threads anyway.
63 83
64Although the module will work with in the presence of other threads, it is 84Although the module will work with in the presence of other (Perl-)
65currently not reentrant, so use appropriate locking yourself, always call 85threads, it is currently not reentrant in any way, so use appropriate
66C<poll_cb> from within the same thread, or never call C<poll_cb> (or other 86locking yourself, always call C<poll_cb> from within the same thread, or
67C<aio_> functions) recursively. 87never call C<poll_cb> (or other C<aio_> functions) recursively.
88
89=head2 EXAMPLE
90
91This is a simple example that uses the Event module and loads
92F</etc/passwd> asynchronously:
93
94 use Fcntl;
95 use Event;
96 use IO::AIO;
97
98 # register the IO::AIO callback with Event
99 Event->io (fd => IO::AIO::poll_fileno,
100 poll => 'r',
101 cb => \&IO::AIO::poll_cb);
102
103 # queue the request to open /etc/passwd
104 aio_open "/etc/passwd", O_RDONLY, 0, sub {
105 my $fh = shift
106 or die "error while opening: $!";
107
108 # stat'ing filehandles is generally non-blocking
109 my $size = -s $fh;
110
111 # queue a request to read the file
112 my $contents;
113 aio_read $fh, 0, $size, $contents, 0, sub {
114 $_[0] == $size
115 or die "short read: $!";
116
117 close $fh;
118
119 # file contents now in $contents
120 print $contents;
121
122 # exit event loop and program
123 Event::unloop;
124 };
125 };
126
127 # possibly queue up other requests, or open GUI windows,
128 # check for sockets etc. etc.
129
130 # process events as long as there are some:
131 Event::loop;
132
133=head1 REQUEST ANATOMY AND LIFETIME
134
135Every C<aio_*> function creates a request. which is a C data structure not
136directly visible to Perl.
137
138If called in non-void context, every request function returns a Perl
139object representing the request. In void context, nothing is returned,
140which saves a bit of memory.
141
142The perl object is a fairly standard ref-to-hash object. The hash contents
143are not used by IO::AIO so you are free to store anything you like in it.
144
145During their existance, aio requests travel through the following states,
146in order:
147
148=over 4
149
150=item ready
151
152Immediately after a request is created it is put into the ready state,
153waiting for a thread to execute it.
154
155=item execute
156
157A thread has accepted the request for processing and is currently
158executing it (e.g. blocking in read).
159
160=item pending
161
162The request has been executed and is waiting for result processing.
163
164While request submission and execution is fully asynchronous, result
165processing is not and relies on the perl interpreter calling C<poll_cb>
166(or another function with the same effect).
167
168=item result
169
170The request results are processed synchronously by C<poll_cb>.
171
172The C<poll_cb> function will process all outstanding aio requests by
173calling their callbacks, freeing memory associated with them and managing
174any groups they are contained in.
175
176=item done
177
178Request has reached the end of its lifetime and holds no resources anymore
179(except possibly for the Perl object, but its connection to the actual
180aio request is severed and calling its methods will either do nothing or
181result in a runtime error).
182
183=back
68 184
69=cut 185=cut
70 186
71package IO::AIO; 187package IO::AIO;
72 188
74use strict 'vars'; 190use strict 'vars';
75 191
76use base 'Exporter'; 192use base 'Exporter';
77 193
78BEGIN { 194BEGIN {
79 our $VERSION = '2.0'; 195 our $VERSION = '2.32';
80 196
81 our @EXPORT = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat 197 our @AIO_REQ = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat
82 aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink 198 aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink
83 aio_fsync aio_fdatasync aio_readahead aio_rename aio_link aio_move 199 aio_readlink aio_fsync aio_fdatasync aio_readahead aio_rename aio_link
84 aio_group); 200 aio_move aio_copy aio_group aio_nop aio_mknod aio_load aio_rmtree);
85 our @EXPORT_OK = qw(poll_fileno poll_cb min_parallel max_parallel max_outstanding nreqs); 201 our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice aio_block));
202 our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush
203 min_parallel max_parallel max_idle
204 nreqs nready npending nthreads
205 max_poll_time max_poll_reqs);
86 206
87 @IO::AIO::GRP::ISA = 'IO::AIO::REQ'; 207 @IO::AIO::GRP::ISA = 'IO::AIO::REQ';
88 208
89 require XSLoader; 209 require XSLoader;
90 XSLoader::load ("IO::AIO", $VERSION); 210 XSLoader::load ("IO::AIO", $VERSION);
91} 211}
92 212
93=head1 FUNCTIONS 213=head1 FUNCTIONS
94 214
95=head2 AIO FUNCTIONS 215=head2 AIO REQUEST FUNCTIONS
96 216
97All the C<aio_*> calls are more or less thin wrappers around the syscall 217All the C<aio_*> calls are more or less thin wrappers around the syscall
98with the same name (sans C<aio_>). The arguments are similar or identical, 218with the same name (sans C<aio_>). The arguments are similar or identical,
99and they all accept an additional (and optional) C<$callback> argument 219and they all accept an additional (and optional) C<$callback> argument
100which must be a code reference. This code reference will get called with 220which must be a code reference. This code reference will get called with
103syscall has been executed asynchronously. 223syscall has been executed asynchronously.
104 224
105All functions expecting a filehandle keep a copy of the filehandle 225All functions expecting a filehandle keep a copy of the filehandle
106internally until the request has finished. 226internally until the request has finished.
107 227
108All requests return objects of type L<IO::AIO::REQ> that allow further 228All functions return request objects of type L<IO::AIO::REQ> that allow
109manipulation of those requests while they are in-flight. 229further manipulation of those requests while they are in-flight.
110 230
111The pathnames you pass to these routines I<must> be absolute and 231The pathnames you pass to these routines I<must> be absolute and
112encoded in byte form. The reason for the former is that at the time the 232encoded as octets. The reason for the former is that at the time the
113request is being executed, the current working directory could have 233request is being executed, the current working directory could have
114changed. Alternatively, you can make sure that you never change the 234changed. Alternatively, you can make sure that you never change the
115current working directory. 235current working directory anywhere in the program and then use relative
236paths.
116 237
117To encode pathnames to byte form, either make sure you either: a) 238To encode pathnames as octets, either make sure you either: a) always pass
118always pass in filenames you got from outside (command line, readdir 239in filenames you got from outside (command line, readdir etc.) without
119etc.), b) are ASCII or ISO 8859-1, c) use the Encode module and encode 240tinkering, b) are ASCII or ISO 8859-1, c) use the Encode module and encode
120your pathnames to the locale (or other) encoding in effect in the user 241your pathnames to the locale (or other) encoding in effect in the user
121environment, d) use Glib::filename_from_unicode on unicode filenames or e) 242environment, d) use Glib::filename_from_unicode on unicode filenames or e)
122use something else. 243use something else to ensure your scalar has the correct contents.
244
245This works, btw. independent of the internal UTF-8 bit, which IO::AIO
246handles correctly wether it is set or not.
123 247
124=over 4 248=over 4
249
250=item $prev_pri = aioreq_pri [$pri]
251
252Returns the priority value that would be used for the next request and, if
253C<$pri> is given, sets the priority for the next aio request.
254
255The default priority is C<0>, the minimum and maximum priorities are C<-4>
256and C<4>, respectively. Requests with higher priority will be serviced
257first.
258
259The priority will be reset to C<0> after each call to one of the C<aio_*>
260functions.
261
262Example: open a file with low priority, then read something from it with
263higher priority so the read request is serviced before other low priority
264open requests (potentially spamming the cache):
265
266 aioreq_pri -3;
267 aio_open ..., sub {
268 return unless $_[0];
269
270 aioreq_pri -2;
271 aio_read $_[0], ..., sub {
272 ...
273 };
274 };
275
276=item aioreq_nice $pri_adjust
277
278Similar to C<aioreq_pri>, but subtracts the given value from the current
279priority, so the effect is cumulative.
125 280
126=item aio_open $pathname, $flags, $mode, $callback->($fh) 281=item aio_open $pathname, $flags, $mode, $callback->($fh)
127 282
128Asynchronously open or create a file and call the callback with a newly 283Asynchronously open or create a file and call the callback with a newly
129created filehandle for the file. 284created filehandle for the file.
180 aio_read $fh, 7, 15, $buffer, 0, sub { 335 aio_read $fh, 7, 15, $buffer, 0, sub {
181 $_[0] > 0 or die "read error: $!"; 336 $_[0] > 0 or die "read error: $!";
182 print "read $_[0] bytes: <$buffer>\n"; 337 print "read $_[0] bytes: <$buffer>\n";
183 }; 338 };
184 339
185=item aio_move $srcpath, $dstpath, $callback->($status)
186
187Try to move the I<file> (directories not supported as either source or
188destination) from C<$srcpath> to C<$dstpath> and call the callback with
189the C<0> (error) or C<-1> ok.
190
191This is a composite request that tries to rename(2) the file first. If
192rename files with C<EXDEV>, it creates the destination file with mode 0200
193and copies the contents of the source file into it using C<aio_sendfile>,
194followed by restoring atime, mtime, access mode and uid/gid, in that
195order, and unlinking the C<$srcpath>.
196
197If an error occurs, the partial destination file will be unlinked, if
198possible, except when setting atime, mtime, access mode and uid/gid, where
199errors are being ignored.
200
201=cut
202
203sub aio_move($$$) {
204 my ($src, $dst, $cb) = @_;
205
206 my $grp = aio_group;
207
208 add $grp aio_rename $src, $dst, sub {
209 if ($_[0] && $! == EXDEV) {
210 add $grp aio_open $src, O_RDONLY, 0, sub {
211 if (my $src_fh = $_[0]) {
212 my @stat = stat $src_fh;
213
214 add $grp aio_open $dst, O_WRONLY, 0200, sub {
215 if (my $dst_fh = $_[0]) {
216 add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
217 close $src_fh;
218
219 if ($_[0] == $stat[7]) {
220 utime $stat[8], $stat[9], $dst;
221 chmod $stat[2] & 07777, $dst_fh;
222 chown $stat[4], $stat[5], $dst_fh;
223 close $dst_fh;
224
225 add $grp aio_unlink $src, sub {
226 $cb->($_[0]);
227 };
228 } else {
229 my $errno = $!;
230 add $grp aio_unlink $dst, sub {
231 $! = $errno;
232 $cb->(-1);
233 };
234 }
235 };
236 } else {
237 $cb->(-1);
238 }
239 },
240
241 } else {
242 $cb->(-1);
243 }
244 };
245 } else {
246 $cb->($_[0]);
247 }
248 };
249
250 $grp
251}
252
253=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval) 340=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval)
254 341
255Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts 342Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts
256reading at byte offset C<$in_offset>, and starts writing at the current 343reading at byte offset C<$in_offset>, and starts writing at the current
257file offset of C<$out_fh>. Because of that, it is not safe to issue more 344file offset of C<$out_fh>. Because of that, it is not safe to issue more
312=item aio_unlink $pathname, $callback->($status) 399=item aio_unlink $pathname, $callback->($status)
313 400
314Asynchronously unlink (delete) a file and call the callback with the 401Asynchronously unlink (delete) a file and call the callback with the
315result code. 402result code.
316 403
404=item aio_mknod $path, $mode, $dev, $callback->($status)
405
406[EXPERIMENTAL]
407
408Asynchronously create a device node (or fifo). See mknod(2).
409
410The only (POSIX-) portable way of calling this function is:
411
412 aio_mknod $path, IO::AIO::S_IFIFO | $mode, 0, sub { ...
413
317=item aio_link $srcpath, $dstpath, $callback->($status) 414=item aio_link $srcpath, $dstpath, $callback->($status)
318 415
319Asynchronously create a new link to the existing object at C<$srcpath> at 416Asynchronously create a new link to the existing object at C<$srcpath> at
320the path C<$dstpath> and call the callback with the result code. 417the path C<$dstpath> and call the callback with the result code.
321 418
322=item aio_symlink $srcpath, $dstpath, $callback->($status) 419=item aio_symlink $srcpath, $dstpath, $callback->($status)
323 420
324Asynchronously create a new symbolic link to the existing object at C<$srcpath> at 421Asynchronously create a new symbolic link to the existing object at C<$srcpath> at
325the path C<$dstpath> and call the callback with the result code. 422the path C<$dstpath> and call the callback with the result code.
423
424=item aio_readlink $path, $callback->($link)
425
426Asynchronously read the symlink specified by C<$path> and pass it to
427the callback. If an error occurs, nothing or undef gets passed to the
428callback.
326 429
327=item aio_rename $srcpath, $dstpath, $callback->($status) 430=item aio_rename $srcpath, $dstpath, $callback->($status)
328 431
329Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as 432Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as
330rename(2) and call the callback with the result code. 433rename(2) and call the callback with the result code.
341sorted, and will B<NOT> include the C<.> and C<..> entries. 444sorted, and will B<NOT> include the C<.> and C<..> entries.
342 445
343The callback a single argument which is either C<undef> or an array-ref 446The callback a single argument which is either C<undef> or an array-ref
344with the filenames. 447with the filenames.
345 448
449=item aio_load $path, $data, $callback->($status)
450
451This is a composite request that tries to fully load the given file into
452memory. Status is the same as with aio_read.
453
454=cut
455
456sub aio_load($$;$) {
457 aio_block {
458 my ($path, undef, $cb) = @_;
459 my $data = \$_[1];
460
461 my $pri = aioreq_pri;
462 my $grp = aio_group $cb;
463
464 aioreq_pri $pri;
465 add $grp aio_open $path, O_RDONLY, 0, sub {
466 my ($fh) = @_
467 or return $grp->result (-1);
468
469 aioreq_pri $pri;
470 add $grp aio_read $fh, 0, (-s $fh), $$data, 0, sub {
471 $grp->result ($_[0]);
472 };
473 };
474
475 $grp
476 }
477}
478
479=item aio_copy $srcpath, $dstpath, $callback->($status)
480
481Try to copy the I<file> (directories not supported as either source or
482destination) from C<$srcpath> to C<$dstpath> and call the callback with
483the C<0> (error) or C<-1> ok.
484
485This is a composite request that it creates the destination file with
486mode 0200 and copies the contents of the source file into it using
487C<aio_sendfile>, followed by restoring atime, mtime, access mode and
488uid/gid, in that order.
489
490If an error occurs, the partial destination file will be unlinked, if
491possible, except when setting atime, mtime, access mode and uid/gid, where
492errors are being ignored.
493
494=cut
495
496sub aio_copy($$;$) {
497 aio_block {
498 my ($src, $dst, $cb) = @_;
499
500 my $pri = aioreq_pri;
501 my $grp = aio_group $cb;
502
503 aioreq_pri $pri;
504 add $grp aio_open $src, O_RDONLY, 0, sub {
505 if (my $src_fh = $_[0]) {
506 my @stat = stat $src_fh;
507
508 aioreq_pri $pri;
509 add $grp aio_open $dst, O_CREAT | O_WRONLY | O_TRUNC, 0200, sub {
510 if (my $dst_fh = $_[0]) {
511 aioreq_pri $pri;
512 add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
513 if ($_[0] == $stat[7]) {
514 $grp->result (0);
515 close $src_fh;
516
517 # those should not normally block. should. should.
518 utime $stat[8], $stat[9], $dst;
519 chmod $stat[2] & 07777, $dst_fh;
520 chown $stat[4], $stat[5], $dst_fh;
521 close $dst_fh;
522 } else {
523 $grp->result (-1);
524 close $src_fh;
525 close $dst_fh;
526
527 aioreq $pri;
528 add $grp aio_unlink $dst;
529 }
530 };
531 } else {
532 $grp->result (-1);
533 }
534 },
535
536 } else {
537 $grp->result (-1);
538 }
539 };
540
541 $grp
542 }
543}
544
545=item aio_move $srcpath, $dstpath, $callback->($status)
546
547Try to move the I<file> (directories not supported as either source or
548destination) from C<$srcpath> to C<$dstpath> and call the callback with
549the C<0> (error) or C<-1> ok.
550
551This is a composite request that tries to rename(2) the file first. If
552rename files with C<EXDEV>, it copies the file with C<aio_copy> and, if
553that is successful, unlinking the C<$srcpath>.
554
555=cut
556
557sub aio_move($$;$) {
558 aio_block {
559 my ($src, $dst, $cb) = @_;
560
561 my $pri = aioreq_pri;
562 my $grp = aio_group $cb;
563
564 aioreq_pri $pri;
565 add $grp aio_rename $src, $dst, sub {
566 if ($_[0] && $! == EXDEV) {
567 aioreq_pri $pri;
568 add $grp aio_copy $src, $dst, sub {
569 $grp->result ($_[0]);
570
571 if (!$_[0]) {
572 aioreq_pri $pri;
573 add $grp aio_unlink $src;
574 }
575 };
576 } else {
577 $grp->result ($_[0]);
578 }
579 };
580
581 $grp
582 }
583}
584
346=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) 585=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs)
347 586
348Scans a directory (similar to C<aio_readdir>) but additionally tries to 587Scans a directory (similar to C<aio_readdir>) but additionally tries to
349separate the entries of directory C<$path> into two sets of names, ones 588efficiently separate the entries of directory C<$path> into two sets of
350you can recurse into (directories or links to them), and ones you cannot 589names, directories you can recurse into (directories), and ones you cannot
351recurse into (everything else). 590recurse into (everything else, including symlinks to directories).
352 591
353C<aio_scandir> is a composite request that consists of many sub 592C<aio_scandir> is a composite request that creates of many sub requests_
354requests. C<$maxreq> specifies the maximum number of outstanding aio 593C<$maxreq> specifies the maximum number of outstanding aio requests that
355requests that this function generates. If it is C<< <= 0 >>, then a 594this function generates. If it is C<< <= 0 >>, then a suitable default
356suitable default will be chosen (currently 8). 595will be chosen (currently 4).
357 596
358On error, the callback is called without arguments, otherwise it receives 597On error, the callback is called without arguments, otherwise it receives
359two array-refs with path-relative entry names. 598two array-refs with path-relative entry names.
360 599
361Example: 600Example:
395as those tend to return 0 or 1 as link counts, which disables the 634as those tend to return 0 or 1 as link counts, which disables the
396directory counting heuristic. 635directory counting heuristic.
397 636
398=cut 637=cut
399 638
400sub aio_scandir($$$) { 639sub aio_scandir($$;$) {
640 aio_block {
401 my ($path, $maxreq, $cb) = @_; 641 my ($path, $maxreq, $cb) = @_;
402 642
643 my $pri = aioreq_pri;
644
403 my $grp = aio_group; 645 my $grp = aio_group $cb;
404 646
405 $maxreq = 8 if $maxreq <= 0; 647 $maxreq = 4 if $maxreq <= 0;
406 648
407 # stat once 649 # stat once
650 aioreq_pri $pri;
408 add $grp aio_stat $path, sub { 651 add $grp aio_stat $path, sub {
409 return $cb->() if $_[0]; 652 return $grp->result () if $_[0];
410 my $now = time; 653 my $now = time;
411 my $hash1 = join ":", (stat _)[0,1,3,7,9]; 654 my $hash1 = join ":", (stat _)[0,1,3,7,9];
412 655
413 # read the directory entries 656 # read the directory entries
657 aioreq_pri $pri;
414 add $grp aio_readdir $path, sub { 658 add $grp aio_readdir $path, sub {
415 my $entries = shift 659 my $entries = shift
416 or return $cb->(); 660 or return $grp->result ();
417 661
418 # stat the dir another time 662 # stat the dir another time
663 aioreq_pri $pri;
419 add $grp aio_stat $path, sub { 664 add $grp aio_stat $path, sub {
420 my $hash2 = join ":", (stat _)[0,1,3,7,9]; 665 my $hash2 = join ":", (stat _)[0,1,3,7,9];
421 666
422 my $ndirs; 667 my $ndirs;
423 668
424 # take the slow route if anything looks fishy 669 # take the slow route if anything looks fishy
425 if ($hash1 ne $hash2 or (stat _)[9] == $now) { 670 if ($hash1 ne $hash2 or (stat _)[9] == $now) {
426 $ndirs = -1; 671 $ndirs = -1;
427 } else { 672 } else {
428 # if nlink == 2, we are finished 673 # if nlink == 2, we are finished
429 # on non-posix-fs's, we rely on nlink < 2 674 # on non-posix-fs's, we rely on nlink < 2
430 $ndirs = (stat _)[3] - 2 675 $ndirs = (stat _)[3] - 2
431 or return $cb->([], $entries); 676 or return $grp->result ([], $entries);
432 }
433
434 # sort into likely dirs and likely nondirs
435 # dirs == files without ".", short entries first
436 $entries = [map $_->[0],
437 sort { $b->[1] cmp $a->[1] }
438 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length],
439 @$entries];
440
441 my (@dirs, @nondirs);
442
443 my ($statcb, $schedcb);
444 my $nreq = 0;
445
446 $schedcb = sub {
447 if (@$entries) {
448 if ($nreq < $maxreq) {
449 my $ent = pop @$entries;
450 $nreq++;
451 add $grp aio_stat "$path/$ent/.", sub { $statcb->($_[0], $ent) };
452 }
453 } elsif (!$nreq) {
454 # finished
455 undef $statcb;
456 undef $schedcb;
457 $cb->(\@dirs, \@nondirs) if $cb;
458 undef $cb;
459 } 677 }
678
679 # sort into likely dirs and likely nondirs
680 # dirs == files without ".", short entries first
681 $entries = [map $_->[0],
682 sort { $b->[1] cmp $a->[1] }
683 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length],
684 @$entries];
685
686 my (@dirs, @nondirs);
687
688 my $statgrp = add $grp aio_group sub {
689 $grp->result (\@dirs, \@nondirs);
690 };
691
692 limit $statgrp $maxreq;
693 feed $statgrp sub {
694 return unless @$entries;
695 my $entry = pop @$entries;
696
697 aioreq_pri $pri;
698 add $statgrp aio_stat "$path/$entry/.", sub {
699 if ($_[0] < 0) {
700 push @nondirs, $entry;
701 } else {
702 # need to check for real directory
703 aioreq_pri $pri;
704 add $statgrp aio_lstat "$path/$entry", sub {
705 if (-d _) {
706 push @dirs, $entry;
707
708 unless (--$ndirs) {
709 push @nondirs, @$entries;
710 feed $statgrp;
711 }
712 } else {
713 push @nondirs, $entry;
714 }
715 }
716 }
717 };
718 };
460 }; 719 };
461 $statcb = sub {
462 my ($status, $entry) = @_;
463
464 if ($status < 0) {
465 $nreq--;
466 push @nondirs, $entry;
467 &$schedcb;
468 } else {
469 # need to check for real directory
470 add $grp aio_lstat "$path/$entry", sub {
471 $nreq--;
472
473 if (-d _) {
474 push @dirs, $entry;
475
476 if (!--$ndirs) {
477 push @nondirs, @$entries;
478 $entries = [];
479 }
480 } else {
481 push @nondirs, $entry;
482 }
483
484 &$schedcb;
485 }
486 }
487 };
488
489 &$schedcb while @$entries && $nreq < $maxreq;
490 }; 720 };
491 }; 721 };
722
723 $grp
492 }; 724 }
725}
493 726
727=item aio_rmtree $path, $callback->($status)
728
729Delete a directory tree starting (and including) C<$path>, return the
730status of the final C<rmdir> only. This is a composite request that
731uses C<aio_scandir> to recurse into and rmdir directories, and unlink
732everything else.
733
734=cut
735
736sub aio_rmtree;
737sub aio_rmtree($;$) {
738 aio_block {
739 my ($path, $cb) = @_;
740
741 my $pri = aioreq_pri;
742 my $grp = aio_group $cb;
743
744 aioreq_pri $pri;
745 add $grp aio_scandir $path, 0, sub {
746 my ($dirs, $nondirs) = @_;
747
748 my $dirgrp = aio_group sub {
749 add $grp aio_rmdir $path, sub {
750 $grp->result ($_[0]);
751 };
752 };
753
754 (aioreq_pri $pri), add $dirgrp aio_rmtree "$path/$_" for @$dirs;
755 (aioreq_pri $pri), add $dirgrp aio_unlink "$path/$_" for @$nondirs;
756
757 add $grp $dirgrp;
758 };
759
494 $grp 760 $grp
761 }
495} 762}
496 763
497=item aio_fsync $fh, $callback->($status) 764=item aio_fsync $fh, $callback->($status)
498 765
499Asynchronously call fsync on the given filehandle and call the callback 766Asynchronously call fsync on the given filehandle and call the callback
505callback with the fdatasync result code. 772callback with the fdatasync result code.
506 773
507If this call isn't available because your OS lacks it or it couldn't be 774If this call isn't available because your OS lacks it or it couldn't be
508detected, it will be emulated by calling C<fsync> instead. 775detected, it will be emulated by calling C<fsync> instead.
509 776
510=item aio_group $callback->() 777=item aio_group $callback->(...)
511
512[EXPERIMENTAL]
513 778
514This is a very special aio request: Instead of doing something, it is a 779This is a very special aio request: Instead of doing something, it is a
515container for other aio requests, which is useful if you want to bundle 780container for other aio requests, which is useful if you want to bundle
516many requests into a single, composite, request. 781many requests into a single, composite, request with a definite callback
782and the ability to cancel the whole request with its subrequests.
517 783
518Returns an object of class L<IO::AIO::GRP>. See its documentation below 784Returns an object of class L<IO::AIO::GRP>. See its documentation below
519for more info. 785for more info.
520 786
521Example: 787Example:
527 add $grp 793 add $grp
528 (aio_stat ...), 794 (aio_stat ...),
529 (aio_stat ...), 795 (aio_stat ...),
530 ...; 796 ...;
531 797
798=item aio_nop $callback->()
799
800This is a special request - it does nothing in itself and is only used for
801side effects, such as when you want to add a dummy request to a group so
802that finishing the requests in the group depends on executing the given
803code.
804
805While this request does nothing, it still goes through the execution
806phase and still requires a worker thread. Thus, the callback will not
807be executed immediately but only after other requests in the queue have
808entered their execution phase. This can be used to measure request
809latency.
810
532=item IO::AIO::aio_sleep $fractional_seconds, $callback->() *NOT EXPORTED* 811=item IO::AIO::aio_busy $fractional_seconds, $callback->() *NOT EXPORTED*
533 812
534Mainly used for debugging and benchmarking, this aio request puts one of 813Mainly used for debugging and benchmarking, this aio request puts one of
535the request workers to sleep for the given time. 814the request workers to sleep for the given time.
536 815
537While it is theoretically handy to have simple I/O scheduling requests 816While it is theoretically handy to have simple I/O scheduling requests
538like sleep and file handle readable/writable, the overhead this creates 817like sleep and file handle readable/writable, the overhead this creates is
539is immense, so do not use this function except to put your application 818immense (it blocks a thread for a long time) so do not use this function
540under artificial I/O pressure. 819except to put your application under artificial I/O pressure.
541 820
542=back 821=back
543 822
544=head2 IO::AIO::REQ CLASS 823=head2 IO::AIO::REQ CLASS
545 824
546All non-aggregate C<aio_*> functions return an object of this class when 825All non-aggregate C<aio_*> functions return an object of this class when
547called in non-void context. 826called in non-void context.
548 827
549A request always moves through the following five states in its lifetime,
550in order: B<ready> (request has been created, but has not been executed
551yet), B<execute> (request is currently being executed), B<pending>
552(request has been executed but callback has not been called yet),
553B<result> (results are being processed synchronously, includes calling the
554callback) and B<done> (request has reached the end of its lifetime and
555holds no resources anymore).
556
557=over 4 828=over 4
558 829
559=item $req->cancel 830=item cancel $req
560 831
561Cancels the request, if possible. Has the effect of skipping execution 832Cancels the request, if possible. Has the effect of skipping execution
562when entering the B<execute> state and skipping calling the callback when 833when entering the B<execute> state and skipping calling the callback when
563entering the the B<result> state, but will leave the request otherwise 834entering the the B<result> state, but will leave the request otherwise
564untouched. That means that requests that currently execute will not be 835untouched. That means that requests that currently execute will not be
565stopped and resources held by the request will not be freed prematurely. 836stopped and resources held by the request will not be freed prematurely.
566 837
838=item cb $req $callback->(...)
839
840Replace (or simply set) the callback registered to the request.
841
567=back 842=back
568 843
569=head2 IO::AIO::GRP CLASS 844=head2 IO::AIO::GRP CLASS
570 845
571This class is a subclass of L<IO::AIO::REQ>, so all its methods apply to 846This class is a subclass of L<IO::AIO::REQ>, so all its methods apply to
585You add requests by calling the C<add> method with one or more 860You add requests by calling the C<add> method with one or more
586C<IO::AIO::REQ> objects: 861C<IO::AIO::REQ> objects:
587 862
588 $grp->add (aio_unlink "..."); 863 $grp->add (aio_unlink "...");
589 864
590 add $grp aio_stat "...", sub { ... }; 865 add $grp aio_stat "...", sub {
866 $_[0] or return $grp->result ("error");
867
868 # add another request dynamically, if first succeeded
869 add $grp aio_open "...", sub {
870 $grp->result ("ok");
871 };
872 };
591 873
592This makes it very easy to create composite requests (see the source of 874This makes it very easy to create composite requests (see the source of
593C<aio_move> for an application) that work and feel like simple requests. 875C<aio_move> for an application) that work and feel like simple requests.
594 876
877=over 4
878
595The IO::AIO::GRP objects will be cleaned up during calls to 879=item * The IO::AIO::GRP objects will be cleaned up during calls to
596C<IO::AIO::poll_cb>, just like any other request. 880C<IO::AIO::poll_cb>, just like any other request.
597 881
598They can be canceled like any other request. Canceling will cancel not 882=item * They can be canceled like any other request. Canceling will cancel not
599just the request itself, but also all requests it contains. 883only the request itself, but also all requests it contains.
600 884
601They can also can also be added to other IO::AIO::GRP objects. 885=item * They can also can also be added to other IO::AIO::GRP objects.
886
887=item * You must not add requests to a group from within the group callback (or
888any later time).
889
890=back
602 891
603Their lifetime, simplified, looks like this: when they are empty, they 892Their lifetime, simplified, looks like this: when they are empty, they
604will finish very quickly. If they contain only requests that are in the 893will finish very quickly. If they contain only requests that are in the
605C<done> state, they will also finish. Otherwise they will continue to 894C<done> state, they will also finish. Otherwise they will continue to
606exist. 895exist.
607 896
897That means after creating a group you have some time to add requests. And
898in the callbacks of those requests, you can add further requests to the
899group. And only when all those requests have finished will the the group
900itself finish.
901
608=over 4 902=over 4
609 903
904=item add $grp ...
905
610=item $grp->add (...) 906=item $grp->add (...)
611 907
612=item add $grp ... 908Add one or more requests to the group. Any type of L<IO::AIO::REQ> can
909be added, including other groups, as long as you do not create circular
910dependencies.
613 911
614Add one or more 912Returns all its arguments.
615Cancels the request, if possible. Has the effect of skipping execution 913
616when entering the B<execute> state and skipping calling the callback when 914=item $grp->cancel_subs
617entering the the B<result> state, but will leave the request otherwise 915
618untouched. That means that requests that currently execute will not be 916Cancel all subrequests and clears any feeder, but not the group request
619stopped and resources held by the request will not be freed prematurely. 917itself. Useful when you queued a lot of events but got a result early.
918
919=item $grp->result (...)
920
921Set the result value(s) that will be passed to the group callback when all
922subrequests have finished and set thre groups errno to the current value
923of errno (just like calling C<errno> without an error number). By default,
924no argument will be passed and errno is zero.
925
926=item $grp->errno ([$errno])
927
928Sets the group errno value to C<$errno>, or the current value of errno
929when the argument is missing.
930
931Every aio request has an associated errno value that is restored when
932the callback is invoked. This method lets you change this value from its
933default (0).
934
935Calling C<result> will also set errno, so make sure you either set C<$!>
936before the call to C<result>, or call c<errno> after it.
937
938=item feed $grp $callback->($grp)
939
940Sets a feeder/generator on this group: every group can have an attached
941generator that generates requests if idle. The idea behind this is that,
942although you could just queue as many requests as you want in a group,
943this might starve other requests for a potentially long time. For
944example, C<aio_scandir> might generate hundreds of thousands C<aio_stat>
945requests, delaying any later requests for a long time.
946
947To avoid this, and allow incremental generation of requests, you can
948instead a group and set a feeder on it that generates those requests. The
949feed callback will be called whenever there are few enough (see C<limit>,
950below) requests active in the group itself and is expected to queue more
951requests.
952
953The feed callback can queue as many requests as it likes (i.e. C<add> does
954not impose any limits).
955
956If the feed does not queue more requests when called, it will be
957automatically removed from the group.
958
959If the feed limit is C<0>, it will be set to C<2> automatically.
960
961Example:
962
963 # stat all files in @files, but only ever use four aio requests concurrently:
964
965 my $grp = aio_group sub { print "finished\n" };
966 limit $grp 4;
967 feed $grp sub {
968 my $file = pop @files
969 or return;
970
971 add $grp aio_stat $file, sub { ... };
972 };
973
974=item limit $grp $num
975
976Sets the feeder limit for the group: The feeder will be called whenever
977the group contains less than this many requests.
978
979Setting the limit to C<0> will pause the feeding process.
620 980
621=back 981=back
622 982
623=head2 SUPPORT FUNCTIONS 983=head2 SUPPORT FUNCTIONS
984
985=head3 EVENT PROCESSING AND EVENT LOOP INTEGRATION
624 986
625=over 4 987=over 4
626 988
627=item $fileno = IO::AIO::poll_fileno 989=item $fileno = IO::AIO::poll_fileno
628 990
633 995
634See C<poll_cb> for an example. 996See C<poll_cb> for an example.
635 997
636=item IO::AIO::poll_cb 998=item IO::AIO::poll_cb
637 999
638Process all outstanding events on the result pipe. You have to call this 1000Process some outstanding events on the result pipe. You have to call this
639regularly. Returns the number of events processed. Returns immediately 1001regularly. Returns the number of events processed. Returns immediately
640when no events are outstanding. 1002when no events are outstanding. The amount of events processed depends on
1003the settings of C<IO::AIO::max_poll_req> and C<IO::AIO::max_poll_time>.
1004
1005If not all requests were processed for whatever reason, the filehandle
1006will still be ready when C<poll_cb> returns.
641 1007
642Example: Install an Event watcher that automatically calls 1008Example: Install an Event watcher that automatically calls
643IO::AIO::poll_cb with high priority: 1009IO::AIO::poll_cb with high priority:
644 1010
645 Event->io (fd => IO::AIO::poll_fileno, 1011 Event->io (fd => IO::AIO::poll_fileno,
646 poll => 'r', async => 1, 1012 poll => 'r', async => 1,
647 cb => \&IO::AIO::poll_cb); 1013 cb => \&IO::AIO::poll_cb);
648 1014
1015=item IO::AIO::max_poll_reqs $nreqs
1016
1017=item IO::AIO::max_poll_time $seconds
1018
1019These set the maximum number of requests (default C<0>, meaning infinity)
1020that are being processed by C<IO::AIO::poll_cb> in one call, respectively
1021the maximum amount of time (default C<0>, meaning infinity) spent in
1022C<IO::AIO::poll_cb> to process requests (more correctly the mininum amount
1023of time C<poll_cb> is allowed to use).
1024
1025Setting C<max_poll_time> to a non-zero value creates an overhead of one
1026syscall per request processed, which is not normally a problem unless your
1027callbacks are really really fast or your OS is really really slow (I am
1028not mentioning Solaris here). Using C<max_poll_reqs> incurs no overhead.
1029
1030Setting these is useful if you want to ensure some level of
1031interactiveness when perl is not fast enough to process all requests in
1032time.
1033
1034For interactive programs, values such as C<0.01> to C<0.1> should be fine.
1035
1036Example: Install an Event watcher that automatically calls
1037IO::AIO::poll_cb with low priority, to ensure that other parts of the
1038program get the CPU sometimes even under high AIO load.
1039
1040 # try not to spend much more than 0.1s in poll_cb
1041 IO::AIO::max_poll_time 0.1;
1042
1043 # use a low priority so other tasks have priority
1044 Event->io (fd => IO::AIO::poll_fileno,
1045 poll => 'r', nice => 1,
1046 cb => &IO::AIO::poll_cb);
1047
649=item IO::AIO::poll_wait 1048=item IO::AIO::poll_wait
650 1049
1050If there are any outstanding requests and none of them in the result
651Wait till the result filehandle becomes ready for reading (simply does a 1051phase, wait till the result filehandle becomes ready for reading (simply
652C<select> on the filehandle. This is useful if you want to synchronously wait 1052does a C<select> on the filehandle. This is useful if you want to
653for some requests to finish). 1053synchronously wait for some requests to finish).
654 1054
655See C<nreqs> for an example. 1055See C<nreqs> for an example.
656 1056
1057=item IO::AIO::poll
1058
1059Waits until some requests have been handled.
1060
1061Returns the number of requests processed, but is otherwise strictly
1062equivalent to:
1063
1064 IO::AIO::poll_wait, IO::AIO::poll_cb
1065
657=item IO::AIO::nreqs 1066=item IO::AIO::flush
658 1067
659Returns the number of requests currently outstanding (i.e. for which their 1068Wait till all outstanding AIO requests have been handled.
660callback has not been invoked yet).
661 1069
662Example: wait till there are no outstanding requests anymore: 1070Strictly equivalent to:
663 1071
664 IO::AIO::poll_wait, IO::AIO::poll_cb 1072 IO::AIO::poll_wait, IO::AIO::poll_cb
665 while IO::AIO::nreqs; 1073 while IO::AIO::nreqs;
666 1074
667=item IO::AIO::flush 1075=head3 CONTROLLING THE NUMBER OF THREADS
668
669Wait till all outstanding AIO requests have been handled.
670
671Strictly equivalent to:
672
673 IO::AIO::poll_wait, IO::AIO::poll_cb
674 while IO::AIO::nreqs;
675
676=item IO::AIO::poll
677
678Waits until some requests have been handled.
679
680Strictly equivalent to:
681
682 IO::AIO::poll_wait, IO::AIO::poll_cb
683 if IO::AIO::nreqs;
684 1076
685=item IO::AIO::min_parallel $nthreads 1077=item IO::AIO::min_parallel $nthreads
686 1078
687Set the minimum number of AIO threads to C<$nthreads>. The current default 1079Set the minimum number of AIO threads to C<$nthreads>. The current
688is C<4>, which means four asynchronous operations can be done at one time 1080default is C<8>, which means eight asynchronous operations can execute
689(the number of outstanding operations, however, is unlimited). 1081concurrently at any one time (the number of outstanding requests,
1082however, is unlimited).
690 1083
691IO::AIO starts threads only on demand, when an AIO request is queued and 1084IO::AIO starts threads only on demand, when an AIO request is queued and
692no free thread exists. 1085no free thread exists. Please note that queueing up a hundred requests can
1086create demand for a hundred threads, even if it turns out that everything
1087is in the cache and could have been processed faster by a single thread.
693 1088
694It is recommended to keep the number of threads low, as some Linux 1089It is recommended to keep the number of threads relatively low, as some
695kernel versions will scale negatively with the number of threads (higher 1090Linux kernel versions will scale negatively with the number of threads
696parallelity => MUCH higher latency). With current Linux 2.6 versions, 4-32 1091(higher parallelity => MUCH higher latency). With current Linux 2.6
697threads should be fine. 1092versions, 4-32 threads should be fine.
698 1093
699Under most circumstances you don't need to call this function, as the 1094Under most circumstances you don't need to call this function, as the
700module selects a default that is suitable for low to moderate load. 1095module selects a default that is suitable for low to moderate load.
701 1096
702=item IO::AIO::max_parallel $nthreads 1097=item IO::AIO::max_parallel $nthreads
711This module automatically runs C<max_parallel 0> at program end, to ensure 1106This module automatically runs C<max_parallel 0> at program end, to ensure
712that all threads are killed and that there are no outstanding requests. 1107that all threads are killed and that there are no outstanding requests.
713 1108
714Under normal circumstances you don't need to call this function. 1109Under normal circumstances you don't need to call this function.
715 1110
1111=item IO::AIO::max_idle $nthreads
1112
1113Limit the number of threads (default: 4) that are allowed to idle (i.e.,
1114threads that did not get a request to process within 10 seconds). That
1115means if a thread becomes idle while C<$nthreads> other threads are also
1116idle, it will free its resources and exit.
1117
1118This is useful when you allow a large number of threads (e.g. 100 or 1000)
1119to allow for extremely high load situations, but want to free resources
1120under normal circumstances (1000 threads can easily consume 30MB of RAM).
1121
1122The default is probably ok in most situations, especially if thread
1123creation is fast. If thread creation is very slow on your system you might
1124want to use larger values.
1125
716=item $oldnreqs = IO::AIO::max_outstanding $nreqs 1126=item $oldmaxreqs = IO::AIO::max_outstanding $maxreqs
1127
1128This is a very bad function to use in interactive programs because it
1129blocks, and a bad way to reduce concurrency because it is inexact: Better
1130use an C<aio_group> together with a feed callback.
717 1131
718Sets the maximum number of outstanding requests to C<$nreqs>. If you 1132Sets the maximum number of outstanding requests to C<$nreqs>. If you
719try to queue up more than this number of requests, the caller will block until 1133to queue up more than this number of requests, the next call to the
720some requests have been handled. 1134C<poll_cb> (and C<poll_some> and other functions calling C<poll_cb>)
1135function will block until the limit is no longer exceeded.
721 1136
722The default is very large, so normally there is no practical limit. If you 1137The default value is very large, so there is no practical limit on the
723queue up many requests in a loop it often improves speed if you set 1138number of outstanding requests.
724this to a relatively low number, such as C<100>.
725 1139
726Under normal circumstances you don't need to call this function. 1140You can still queue as many requests as you want. Therefore,
1141C<max_oustsanding> is mainly useful in simple scripts (with low values) or
1142as a stop gap to shield against fatal memory overflow (with large values).
1143
1144=head3 STATISTICAL INFORMATION
1145
1146=item IO::AIO::nreqs
1147
1148Returns the number of requests currently in the ready, execute or pending
1149states (i.e. for which their callback has not been invoked yet).
1150
1151Example: wait till there are no outstanding requests anymore:
1152
1153 IO::AIO::poll_wait, IO::AIO::poll_cb
1154 while IO::AIO::nreqs;
1155
1156=item IO::AIO::nready
1157
1158Returns the number of requests currently in the ready state (not yet
1159executed).
1160
1161=item IO::AIO::npending
1162
1163Returns the number of requests currently in the pending state (executed,
1164but not yet processed by poll_cb).
727 1165
728=back 1166=back
729 1167
730=cut 1168=cut
731 1169
743 or return undef; 1181 or return undef;
744 1182
745 *$sym 1183 *$sym
746} 1184}
747 1185
748min_parallel 4; 1186min_parallel 8;
749 1187
750END { 1188END { flush }
751 max_parallel 0;
752}
753 1189
7541; 11901;
755 1191
756=head2 FORK BEHAVIOUR 1192=head2 FORK BEHAVIOUR
757 1193
758This module should do "the right thing" when the process using it forks: 1194This module should do "the right thing" when the process using it forks:
759 1195
760Before the fork, IO::AIO enters a quiescent state where no requests 1196Before the fork, IO::AIO enters a quiescent state where no requests
761can be added in other threads and no results will be processed. After 1197can be added in other threads and no results will be processed. After
762the fork the parent simply leaves the quiescent state and continues 1198the fork the parent simply leaves the quiescent state and continues
763request/result processing, while the child clears the request/result 1199request/result processing, while the child frees the request/result queue
764queue (so the requests started before the fork will only be handled in 1200(so that the requests started before the fork will only be handled in the
765the parent). Threads will be started on demand until the limit ste in the 1201parent). Threads will be started on demand until the limit set in the
766parent process has been reached again. 1202parent process has been reached again.
767 1203
768In short: the parent will, after a short pause, continue as if fork had 1204In short: the parent will, after a short pause, continue as if fork had
769not been called, while the child will act as if IO::AIO has not been used 1205not been called, while the child will act as if IO::AIO has not been used
770yet. 1206yet.
771 1207
1208=head2 MEMORY USAGE
1209
1210Per-request usage:
1211
1212Each aio request uses - depending on your architecture - around 100-200
1213bytes of memory. In addition, stat requests need a stat buffer (possibly
1214a few hundred bytes), readdir requires a result buffer and so on. Perl
1215scalars and other data passed into aio requests will also be locked and
1216will consume memory till the request has entered the done state.
1217
1218This is now awfully much, so queuing lots of requests is not usually a
1219problem.
1220
1221Per-thread usage:
1222
1223In the execution phase, some aio requests require more memory for
1224temporary buffers, and each thread requires a stack and other data
1225structures (usually around 16k-128k, depending on the OS).
1226
1227=head1 KNOWN BUGS
1228
1229Known bugs will be fixed in the next release.
1230
772=head1 SEE ALSO 1231=head1 SEE ALSO
773 1232
774L<Coro>, L<Linux::AIO> (obsolete). 1233L<Coro::AIO>.
775 1234
776=head1 AUTHOR 1235=head1 AUTHOR
777 1236
778 Marc Lehmann <schmorp@schmorp.de> 1237 Marc Lehmann <schmorp@schmorp.de>
779 http://home.schmorp.de/ 1238 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines