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.64 by root, Mon Oct 23 00:50:10 2006 UTC vs.
Revision 1.99 by root, Sun Jan 7 21:32:20 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 aio_nop); 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
187[EXPERIMENTAL due to internal aio_group use]
188
189Try to move the I<file> (directories not supported as either source or
190destination) from C<$srcpath> to C<$dstpath> and call the callback with
191the C<0> (error) or C<-1> ok.
192
193This is a composite request that tries to rename(2) the file first. If
194rename files with C<EXDEV>, it creates the destination file with mode 0200
195and copies the contents of the source file into it using C<aio_sendfile>,
196followed by restoring atime, mtime, access mode and uid/gid, in that
197order, and unlinking the C<$srcpath>.
198
199If an error occurs, the partial destination file will be unlinked, if
200possible, except when setting atime, mtime, access mode and uid/gid, where
201errors are being ignored.
202
203=cut
204
205sub aio_move($$$) {
206 my ($src, $dst, $cb) = @_;
207
208 my $grp = aio_group $cb;
209
210 add $grp aio_rename $src, $dst, sub {
211 if ($_[0] && $! == EXDEV) {
212 add $grp aio_open $src, O_RDONLY, 0, sub {
213 if (my $src_fh = $_[0]) {
214 my @stat = stat $src_fh;
215
216 add $grp aio_open $dst, O_WRONLY, 0200, sub {
217 if (my $dst_fh = $_[0]) {
218 add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
219 close $src_fh;
220
221 if ($_[0] == $stat[7]) {
222 utime $stat[8], $stat[9], $dst;
223 chmod $stat[2] & 07777, $dst_fh;
224 chown $stat[4], $stat[5], $dst_fh;
225 close $dst_fh;
226
227 add $grp aio_unlink $src, sub {
228 $grp->result ($_[0]);
229 };
230 } else {
231 my $errno = $!;
232 add $grp aio_unlink $dst, sub {
233 $! = $errno;
234 $grp->result (-1);
235 };
236 }
237 };
238 } else {
239 $grp->result (-1);
240 }
241 },
242
243 } else {
244 $grp->result (-1);
245 }
246 };
247 } else {
248 $grp->result ($_[0]);
249 }
250 };
251
252 $grp
253}
254
255=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)
256 341
257Tries 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
258reading 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
259file 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
314=item aio_unlink $pathname, $callback->($status) 399=item aio_unlink $pathname, $callback->($status)
315 400
316Asynchronously unlink (delete) a file and call the callback with the 401Asynchronously unlink (delete) a file and call the callback with the
317result code. 402result code.
318 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
319=item aio_link $srcpath, $dstpath, $callback->($status) 414=item aio_link $srcpath, $dstpath, $callback->($status)
320 415
321Asynchronously 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
322the path C<$dstpath> and call the callback with the result code. 417the path C<$dstpath> and call the callback with the result code.
323 418
324=item aio_symlink $srcpath, $dstpath, $callback->($status) 419=item aio_symlink $srcpath, $dstpath, $callback->($status)
325 420
326Asynchronously 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
327the 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.
328 429
329=item aio_rename $srcpath, $dstpath, $callback->($status) 430=item aio_rename $srcpath, $dstpath, $callback->($status)
330 431
331Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as 432Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as
332rename(2) and call the callback with the result code. 433rename(2) and call the callback with the result code.
343sorted, and will B<NOT> include the C<.> and C<..> entries. 444sorted, and will B<NOT> include the C<.> and C<..> entries.
344 445
345The 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
346with the filenames. 447with the filenames.
347 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
348=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) 585=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs)
349 586
350[EXPERIMENTAL due to internal aio_group use]
351
352Scans a directory (similar to C<aio_readdir>) but additionally tries to 587Scans a directory (similar to C<aio_readdir>) but additionally tries to
353separate the entries of directory C<$path> into two sets of names, ones 588efficiently separate the entries of directory C<$path> into two sets of
354you can recurse into (directories or links to them), and ones you cannot 589names, directories you can recurse into (directories), and ones you cannot
355recurse into (everything else). 590recurse into (everything else, including symlinks to directories).
356 591
357C<aio_scandir> is a composite request that creates of many sub requests_ 592C<aio_scandir> is a composite request that creates of many sub requests_
358C<$maxreq> specifies the maximum number of outstanding aio requests that 593C<$maxreq> specifies the maximum number of outstanding aio requests that
359this function generates. If it is C<< <= 0 >>, then a suitable default 594this function generates. If it is C<< <= 0 >>, then a suitable default
360will be chosen (currently 6). 595will be chosen (currently 4).
361 596
362On error, the callback is called without arguments, otherwise it receives 597On error, the callback is called without arguments, otherwise it receives
363two array-refs with path-relative entry names. 598two array-refs with path-relative entry names.
364 599
365Example: 600Example:
400directory counting heuristic. 635directory counting heuristic.
401 636
402=cut 637=cut
403 638
404sub aio_scandir($$$) { 639sub aio_scandir($$$) {
640 aio_block {
405 my ($path, $maxreq, $cb) = @_; 641 my ($path, $maxreq, $cb) = @_;
406 642
643 my $pri = aioreq_pri;
644
407 my $grp = aio_group $cb; 645 my $grp = aio_group $cb;
408 646
409 $maxreq = 6 if $maxreq <= 0; 647 $maxreq = 4 if $maxreq <= 0;
410 648
411 # stat once 649 # stat once
650 aioreq_pri $pri;
412 add $grp aio_stat $path, sub { 651 add $grp aio_stat $path, sub {
413 return $grp->result () if $_[0]; 652 return $grp->result () if $_[0];
414 my $now = time; 653 my $now = time;
415 my $hash1 = join ":", (stat _)[0,1,3,7,9]; 654 my $hash1 = join ":", (stat _)[0,1,3,7,9];
416 655
417 # read the directory entries 656 # read the directory entries
657 aioreq_pri $pri;
418 add $grp aio_readdir $path, sub { 658 add $grp aio_readdir $path, sub {
419 my $entries = shift 659 my $entries = shift
420 or return $grp->result (); 660 or return $grp->result ();
421 661
422 # stat the dir another time 662 # stat the dir another time
663 aioreq_pri $pri;
423 add $grp aio_stat $path, sub { 664 add $grp aio_stat $path, sub {
424 my $hash2 = join ":", (stat _)[0,1,3,7,9]; 665 my $hash2 = join ":", (stat _)[0,1,3,7,9];
425 666
426 my $ndirs; 667 my $ndirs;
427 668
428 # take the slow route if anything looks fishy 669 # take the slow route if anything looks fishy
429 if ($hash1 ne $hash2 or (stat _)[9] == $now) { 670 if ($hash1 ne $hash2 or (stat _)[9] == $now) {
430 $ndirs = -1; 671 $ndirs = -1;
431 } else { 672 } else {
432 # if nlink == 2, we are finished 673 # if nlink == 2, we are finished
433 # on non-posix-fs's, we rely on nlink < 2 674 # on non-posix-fs's, we rely on nlink < 2
434 $ndirs = (stat _)[3] - 2 675 $ndirs = (stat _)[3] - 2
435 or return $grp->result ([], $entries); 676 or return $grp->result ([], $entries);
436 } 677 }
437 678
438 # sort into likely dirs and likely nondirs 679 # sort into likely dirs and likely nondirs
439 # dirs == files without ".", short entries first 680 # dirs == files without ".", short entries first
440 $entries = [map $_->[0], 681 $entries = [map $_->[0],
441 sort { $b->[1] cmp $a->[1] } 682 sort { $b->[1] cmp $a->[1] }
442 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length], 683 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length],
443 @$entries]; 684 @$entries];
444 685
445 my (@dirs, @nondirs); 686 my (@dirs, @nondirs);
446 687
447 my ($statcb, $schedcb);
448 my $nreq = 0;
449
450 my $statgrp = add $grp aio_group; 688 my $statgrp = add $grp aio_group sub {
451
452 $schedcb = sub {
453 if (@$entries) {
454 if ($nreq < $maxreq) {
455 my $ent = pop @$entries;
456 $nreq++;
457 add $statgrp aio_stat "$path/$ent/.", sub { $statcb->($_[0], $ent) };
458 }
459 } elsif (!$nreq) {
460 # finished
461 $statgrp->cancel;
462 undef $statcb;
463 undef $schedcb;
464 $grp->result (\@dirs, \@nondirs); 689 $grp->result (\@dirs, \@nondirs);
465 } 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 };
466 }; 719 };
467 $statcb = sub {
468 my ($status, $entry) = @_;
469
470 if ($status < 0) {
471 $nreq--;
472 push @nondirs, $entry;
473 &$schedcb;
474 } else {
475 # need to check for real directory
476 add $grp aio_lstat "$path/$entry", sub {
477 $nreq--;
478
479 if (-d _) {
480 push @dirs, $entry;
481
482 if (!--$ndirs) {
483 push @nondirs, @$entries;
484 $entries = [];
485 }
486 } else {
487 push @nondirs, $entry;
488 }
489
490 &$schedcb;
491 }
492 }
493 };
494
495 &$schedcb while @$entries && $nreq < $maxreq;
496 }; 720 };
497 }; 721 };
722
723 $grp
498 }; 724 }
725}
499 726
727=item aio_rmtree $path, $callback->($status)
728
729Delete a directory tree starting (and including) C<$path>, return the status of the final C<rmdir> only.
730This is a composite request that uses C<aio_scandir> to recurse into and rmdir directories, and
731unlink everything else.
732
733=cut
734
735sub aio_rmtree;
736sub aio_rmtree {
737 aio_block {
738 my ($path, $cb) = @_;
739
740 my $pri = aioreq_pri;
741 my $grp = aio_group $cb;
742
743 aioreq_pri $pri;
744 add $grp aio_scandir $path, 0, sub {
745 my ($dirs, $nondirs) = @_;
746
747 my $dirgrp = aio_group sub {
748 add $grp aio_rmdir $path, sub {
749 $grp->result ($_[0]);
750 };
751 };
752
753 (aioreq_pri $pri), add $dirgrp aio_rmtree "$path/$_" for @$dirs;
754 (aioreq_pri $pri), add $dirgrp aio_unlink "$path/$_" for @$nondirs;
755
756 add $grp $dirgrp;
757 };
758
500 $grp 759 $grp
760 }
501} 761}
502 762
503=item aio_fsync $fh, $callback->($status) 763=item aio_fsync $fh, $callback->($status)
504 764
505Asynchronously call fsync on the given filehandle and call the callback 765Asynchronously call fsync on the given filehandle and call the callback
513If this call isn't available because your OS lacks it or it couldn't be 773If this call isn't available because your OS lacks it or it couldn't be
514detected, it will be emulated by calling C<fsync> instead. 774detected, it will be emulated by calling C<fsync> instead.
515 775
516=item aio_group $callback->(...) 776=item aio_group $callback->(...)
517 777
518[EXPERIMENTAL]
519
520This is a very special aio request: Instead of doing something, it is a 778This is a very special aio request: Instead of doing something, it is a
521container for other aio requests, which is useful if you want to bundle 779container for other aio requests, which is useful if you want to bundle
522many requests into a single, composite, request. 780many requests into a single, composite, request with a definite callback
781and the ability to cancel the whole request with its subrequests.
523 782
524Returns an object of class L<IO::AIO::GRP>. See its documentation below 783Returns an object of class L<IO::AIO::GRP>. See its documentation below
525for more info. 784for more info.
526 785
527Example: 786Example:
546phase and still requires a worker thread. Thus, the callback will not 805phase and still requires a worker thread. Thus, the callback will not
547be executed immediately but only after other requests in the queue have 806be executed immediately but only after other requests in the queue have
548entered their execution phase. This can be used to measure request 807entered their execution phase. This can be used to measure request
549latency. 808latency.
550 809
551=item IO::AIO::aio_sleep $fractional_seconds, $callback->() *NOT EXPORTED* 810=item IO::AIO::aio_busy $fractional_seconds, $callback->() *NOT EXPORTED*
552 811
553Mainly used for debugging and benchmarking, this aio request puts one of 812Mainly used for debugging and benchmarking, this aio request puts one of
554the request workers to sleep for the given time. 813the request workers to sleep for the given time.
555 814
556While it is theoretically handy to have simple I/O scheduling requests 815While it is theoretically handy to have simple I/O scheduling requests
557like sleep and file handle readable/writable, the overhead this creates 816like sleep and file handle readable/writable, the overhead this creates is
558is immense, so do not use this function except to put your application 817immense (it blocks a thread for a long time) so do not use this function
559under artificial I/O pressure. 818except to put your application under artificial I/O pressure.
560 819
561=back 820=back
562 821
563=head2 IO::AIO::REQ CLASS 822=head2 IO::AIO::REQ CLASS
564 823
565All non-aggregate C<aio_*> functions return an object of this class when 824All non-aggregate C<aio_*> functions return an object of this class when
566called in non-void context. 825called in non-void context.
567 826
568A request always moves through the following five states in its lifetime,
569in order: B<ready> (request has been created, but has not been executed
570yet), B<execute> (request is currently being executed), B<pending>
571(request has been executed but callback has not been called yet),
572B<result> (results are being processed synchronously, includes calling the
573callback) and B<done> (request has reached the end of its lifetime and
574holds no resources anymore).
575
576=over 4 827=over 4
577 828
578=item $req->cancel 829=item cancel $req
579 830
580Cancels the request, if possible. Has the effect of skipping execution 831Cancels the request, if possible. Has the effect of skipping execution
581when entering the B<execute> state and skipping calling the callback when 832when entering the B<execute> state and skipping calling the callback when
582entering the the B<result> state, but will leave the request otherwise 833entering the the B<result> state, but will leave the request otherwise
583untouched. That means that requests that currently execute will not be 834untouched. That means that requests that currently execute will not be
584stopped and resources held by the request will not be freed prematurely. 835stopped and resources held by the request will not be freed prematurely.
585 836
837=item cb $req $callback->(...)
838
839Replace (or simply set) the callback registered to the request.
840
586=back 841=back
587 842
588=head2 IO::AIO::GRP CLASS 843=head2 IO::AIO::GRP CLASS
589 844
590This class is a subclass of L<IO::AIO::REQ>, so all its methods apply to 845This class is a subclass of L<IO::AIO::REQ>, so all its methods apply to
629=item * They can also can also be added to other IO::AIO::GRP objects. 884=item * They can also can also be added to other IO::AIO::GRP objects.
630 885
631=item * You must not add requests to a group from within the group callback (or 886=item * You must not add requests to a group from within the group callback (or
632any later time). 887any later time).
633 888
634=item * This does not harmonise well with C<max_outstanding>, so best do
635not combine C<aio_group> with it. Groups and feeders are recommended for
636this kind of concurrency-limiting.
637
638=back 889=back
639 890
640Their lifetime, simplified, looks like this: when they are empty, they 891Their lifetime, simplified, looks like this: when they are empty, they
641will finish very quickly. If they contain only requests that are in the 892will finish very quickly. If they contain only requests that are in the
642C<done> state, they will also finish. Otherwise they will continue to 893C<done> state, they will also finish. Otherwise they will continue to
647group. And only when all those requests have finished will the the group 898group. And only when all those requests have finished will the the group
648itself finish. 899itself finish.
649 900
650=over 4 901=over 4
651 902
903=item add $grp ...
904
652=item $grp->add (...) 905=item $grp->add (...)
653
654=item add $grp ...
655 906
656Add one or more requests to the group. Any type of L<IO::AIO::REQ> can 907Add one or more requests to the group. Any type of L<IO::AIO::REQ> can
657be added, including other groups, as long as you do not create circular 908be added, including other groups, as long as you do not create circular
658dependencies. 909dependencies.
659 910
660Returns all its arguments. 911Returns all its arguments.
661 912
913=item $grp->cancel_subs
914
915Cancel all subrequests and clears any feeder, but not the group request
916itself. Useful when you queued a lot of events but got a result early.
917
662=item $grp->result (...) 918=item $grp->result (...)
663 919
664Set the result value(s) that will be passed to the group callback when all 920Set the result value(s) that will be passed to the group callback when all
665subrequests have finished. By default, no argument will be passed. 921subrequests have finished and set thre groups errno to the current value
922of errno (just like calling C<errno> without an error number). By default,
923no argument will be passed and errno is zero.
666 924
667=item $grp->set_feeder ($callback->($grp)) 925=item $grp->errno ([$errno])
668 926
669[VERY EXPERIMENTAL] 927Sets the group errno value to C<$errno>, or the current value of errno
928when the argument is missing.
929
930Every aio request has an associated errno value that is restored when
931the callback is invoked. This method lets you change this value from its
932default (0).
933
934Calling C<result> will also set errno, so make sure you either set C<$!>
935before the call to C<result>, or call c<errno> after it.
936
937=item feed $grp $callback->($grp)
670 938
671Sets a feeder/generator on this group: every group can have an attached 939Sets a feeder/generator on this group: every group can have an attached
672generator that generates requests if idle. The idea behind this is that, 940generator that generates requests if idle. The idea behind this is that,
673although you could just queue as many requests as you want in a group, 941although you could just queue as many requests as you want in a group,
674this might starve other requests for a potentially long time. For 942this might starve other requests for a potentially long time. For
675example, C<aio_scandir> might generate hundreds of thousands C<aio_stat> 943example, C<aio_scandir> might generate hundreds of thousands C<aio_stat>
676requests, delaying any later requests for a long time. 944requests, delaying any later requests for a long time.
677 945
678To avoid this, and allow incremental generation of requests, you can 946To avoid this, and allow incremental generation of requests, you can
679instead a group and set a feeder on it that generates those requests. The 947instead a group and set a feeder on it that generates those requests. The
680feeder will be called whenever there are few enough (see C<feeder_limit>, 948feed callback will be called whenever there are few enough (see C<limit>,
681below) requests active in the group itself and is expected to queue more 949below) requests active in the group itself and is expected to queue more
682requests. 950requests.
683 951
684The feeder can queue as many requests as it likes (i.e. C<add> does not 952The feed callback can queue as many requests as it likes (i.e. C<add> does
685impose any limits). 953not impose any limits).
686 954
687If the feeder does not queue more requests when called, it will be 955If the feed does not queue more requests when called, it will be
688automatically removed from the group. 956automatically removed from the group.
689 957
690If the feeder limit is C<0>, it will be set to C<2> automatically. 958If the feed limit is C<0>, it will be set to C<2> automatically.
691 959
692Example: 960Example:
693 961
694 # stat all files in @files, but only ever use four aio requests concurrently: 962 # stat all files in @files, but only ever use four aio requests concurrently:
695 963
696 my $grp = aio_group sub { print "finished\n" }; 964 my $grp = aio_group sub { print "finished\n" };
697 $grp->feeder_limit (4); 965 limit $grp 4;
698 $grp->set_feeder (sub { 966 feed $grp sub {
699 my $file = pop @files 967 my $file = pop @files
700 or return; 968 or return;
701 969
702 add $grp aio_stat $file, sub { ... }; 970 add $grp aio_stat $file, sub { ... };
703 }); 971 };
704 972
705=item $grp->feeder_limit ($num) 973=item limit $grp $num
706 974
707Sets the feeder limit for the group: The feeder will be called whenever 975Sets the feeder limit for the group: The feeder will be called whenever
708the group contains less than this many requests. 976the group contains less than this many requests.
709 977
710Setting the limit to C<0> will pause the feeding process. 978Setting the limit to C<0> will pause the feeding process.
711 979
712=back 980=back
713 981
714=head2 SUPPORT FUNCTIONS 982=head2 SUPPORT FUNCTIONS
983
984=head3 EVENT PROCESSING AND EVENT LOOP INTEGRATION
715 985
716=over 4 986=over 4
717 987
718=item $fileno = IO::AIO::poll_fileno 988=item $fileno = IO::AIO::poll_fileno
719 989
724 994
725See C<poll_cb> for an example. 995See C<poll_cb> for an example.
726 996
727=item IO::AIO::poll_cb 997=item IO::AIO::poll_cb
728 998
729Process all outstanding events on the result pipe. You have to call this 999Process some outstanding events on the result pipe. You have to call this
730regularly. Returns the number of events processed. Returns immediately 1000regularly. Returns the number of events processed. Returns immediately
731when no events are outstanding. 1001when no events are outstanding. The amount of events processed depends on
1002the settings of C<IO::AIO::max_poll_req> and C<IO::AIO::max_poll_time>.
1003
1004If not all requests were processed for whatever reason, the filehandle
1005will still be ready when C<poll_cb> returns.
732 1006
733Example: Install an Event watcher that automatically calls 1007Example: Install an Event watcher that automatically calls
734IO::AIO::poll_cb with high priority: 1008IO::AIO::poll_cb with high priority:
735 1009
736 Event->io (fd => IO::AIO::poll_fileno, 1010 Event->io (fd => IO::AIO::poll_fileno,
737 poll => 'r', async => 1, 1011 poll => 'r', async => 1,
738 cb => \&IO::AIO::poll_cb); 1012 cb => \&IO::AIO::poll_cb);
739 1013
1014=item IO::AIO::max_poll_reqs $nreqs
1015
1016=item IO::AIO::max_poll_time $seconds
1017
1018These set the maximum number of requests (default C<0>, meaning infinity)
1019that are being processed by C<IO::AIO::poll_cb> in one call, respectively
1020the maximum amount of time (default C<0>, meaning infinity) spent in
1021C<IO::AIO::poll_cb> to process requests (more correctly the mininum amount
1022of time C<poll_cb> is allowed to use).
1023
1024Setting C<max_poll_time> to a non-zero value creates an overhead of one
1025syscall per request processed, which is not normally a problem unless your
1026callbacks are really really fast or your OS is really really slow (I am
1027not mentioning Solaris here). Using C<max_poll_reqs> incurs no overhead.
1028
1029Setting these is useful if you want to ensure some level of
1030interactiveness when perl is not fast enough to process all requests in
1031time.
1032
1033For interactive programs, values such as C<0.01> to C<0.1> should be fine.
1034
1035Example: Install an Event watcher that automatically calls
1036IO::AIO::poll_cb with low priority, to ensure that other parts of the
1037program get the CPU sometimes even under high AIO load.
1038
1039 # try not to spend much more than 0.1s in poll_cb
1040 IO::AIO::max_poll_time 0.1;
1041
1042 # use a low priority so other tasks have priority
1043 Event->io (fd => IO::AIO::poll_fileno,
1044 poll => 'r', nice => 1,
1045 cb => &IO::AIO::poll_cb);
1046
740=item IO::AIO::poll_wait 1047=item IO::AIO::poll_wait
741 1048
1049If there are any outstanding requests and none of them in the result
742Wait till the result filehandle becomes ready for reading (simply does a 1050phase, wait till the result filehandle becomes ready for reading (simply
743C<select> on the filehandle. This is useful if you want to synchronously wait 1051does a C<select> on the filehandle. This is useful if you want to
744for some requests to finish). 1052synchronously wait for some requests to finish).
745 1053
746See C<nreqs> for an example. 1054See C<nreqs> for an example.
747 1055
1056=item IO::AIO::poll
1057
1058Waits until some requests have been handled.
1059
1060Returns the number of requests processed, but is otherwise strictly
1061equivalent to:
1062
1063 IO::AIO::poll_wait, IO::AIO::poll_cb
1064
748=item IO::AIO::nreqs 1065=item IO::AIO::flush
749 1066
750Returns the number of requests currently outstanding (i.e. for which their 1067Wait till all outstanding AIO requests have been handled.
751callback has not been invoked yet).
752 1068
753Example: wait till there are no outstanding requests anymore: 1069Strictly equivalent to:
754 1070
755 IO::AIO::poll_wait, IO::AIO::poll_cb 1071 IO::AIO::poll_wait, IO::AIO::poll_cb
756 while IO::AIO::nreqs; 1072 while IO::AIO::nreqs;
757 1073
758=item IO::AIO::flush 1074=head3 CONTROLLING THE NUMBER OF THREADS
759
760Wait till all outstanding AIO requests have been handled.
761
762Strictly equivalent to:
763
764 IO::AIO::poll_wait, IO::AIO::poll_cb
765 while IO::AIO::nreqs;
766
767=item IO::AIO::poll
768
769Waits until some requests have been handled.
770
771Strictly equivalent to:
772
773 IO::AIO::poll_wait, IO::AIO::poll_cb
774 if IO::AIO::nreqs;
775 1075
776=item IO::AIO::min_parallel $nthreads 1076=item IO::AIO::min_parallel $nthreads
777 1077
778Set the minimum number of AIO threads to C<$nthreads>. The current 1078Set the minimum number of AIO threads to C<$nthreads>. The current
779default is C<8>, which means eight asynchronous operations can execute 1079default is C<8>, which means eight asynchronous operations can execute
780concurrently at any one time (the number of outstanding requests, 1080concurrently at any one time (the number of outstanding requests,
781however, is unlimited). 1081however, is unlimited).
782 1082
783IO::AIO starts threads only on demand, when an AIO request is queued and 1083IO::AIO starts threads only on demand, when an AIO request is queued and
784no free thread exists. 1084no free thread exists. Please note that queueing up a hundred requests can
1085create demand for a hundred threads, even if it turns out that everything
1086is in the cache and could have been processed faster by a single thread.
785 1087
786It is recommended to keep the number of threads relatively low, as some 1088It is recommended to keep the number of threads relatively low, as some
787Linux kernel versions will scale negatively with the number of threads 1089Linux kernel versions will scale negatively with the number of threads
788(higher parallelity => MUCH higher latency). With current Linux 2.6 1090(higher parallelity => MUCH higher latency). With current Linux 2.6
789versions, 4-32 threads should be fine. 1091versions, 4-32 threads should be fine.
803This module automatically runs C<max_parallel 0> at program end, to ensure 1105This module automatically runs C<max_parallel 0> at program end, to ensure
804that all threads are killed and that there are no outstanding requests. 1106that all threads are killed and that there are no outstanding requests.
805 1107
806Under normal circumstances you don't need to call this function. 1108Under normal circumstances you don't need to call this function.
807 1109
1110=item IO::AIO::max_idle $nthreads
1111
1112Limit the number of threads (default: 4) that are allowed to idle (i.e.,
1113threads that did not get a request to process within 10 seconds). That
1114means if a thread becomes idle while C<$nthreads> other threads are also
1115idle, it will free its resources and exit.
1116
1117This is useful when you allow a large number of threads (e.g. 100 or 1000)
1118to allow for extremely high load situations, but want to free resources
1119under normal circumstances (1000 threads can easily consume 30MB of RAM).
1120
1121The default is probably ok in most situations, especially if thread
1122creation is fast. If thread creation is very slow on your system you might
1123want to use larger values.
1124
808=item $oldnreqs = IO::AIO::max_outstanding $nreqs 1125=item $oldmaxreqs = IO::AIO::max_outstanding $maxreqs
809 1126
810[DEPRECATED] 1127This is a very bad function to use in interactive programs because it
1128blocks, and a bad way to reduce concurrency because it is inexact: Better
1129use an C<aio_group> together with a feed callback.
811 1130
812Sets the maximum number of outstanding requests to C<$nreqs>. If you 1131Sets the maximum number of outstanding requests to C<$nreqs>. If you
813try to queue up more than this number of requests, the caller will block until 1132to queue up more than this number of requests, the next call to the
814some requests have been handled. 1133C<poll_cb> (and C<poll_some> and other functions calling C<poll_cb>)
1134function will block until the limit is no longer exceeded.
815 1135
816The default is very large, so normally there is no practical limit. If you 1136The default value is very large, so there is no practical limit on the
817queue up many requests in a loop it often improves speed if you set 1137number of outstanding requests.
818this to a relatively low number, such as C<100>.
819 1138
820This function does not work well together with C<aio_group>'s, and their 1139You can still queue as many requests as you want. Therefore,
821feeder interface is better suited to limiting concurrency, so do not use 1140C<max_oustsanding> is mainly useful in simple scripts (with low values) or
822this function. 1141as a stop gap to shield against fatal memory overflow (with large values).
823 1142
824Under normal circumstances you don't need to call this function. 1143=head3 STATISTICAL INFORMATION
1144
1145=item IO::AIO::nreqs
1146
1147Returns the number of requests currently in the ready, execute or pending
1148states (i.e. for which their callback has not been invoked yet).
1149
1150Example: wait till there are no outstanding requests anymore:
1151
1152 IO::AIO::poll_wait, IO::AIO::poll_cb
1153 while IO::AIO::nreqs;
1154
1155=item IO::AIO::nready
1156
1157Returns the number of requests currently in the ready state (not yet
1158executed).
1159
1160=item IO::AIO::npending
1161
1162Returns the number of requests currently in the pending state (executed,
1163but not yet processed by poll_cb).
825 1164
826=back 1165=back
827 1166
828=cut 1167=cut
829 1168
843 *$sym 1182 *$sym
844} 1183}
845 1184
846min_parallel 8; 1185min_parallel 8;
847 1186
848END { 1187END { flush }
849 max_parallel 0;
850}
851 1188
8521; 11891;
853 1190
854=head2 FORK BEHAVIOUR 1191=head2 FORK BEHAVIOUR
855 1192
856This module should do "the right thing" when the process using it forks: 1193This module should do "the right thing" when the process using it forks:
857 1194
858Before the fork, IO::AIO enters a quiescent state where no requests 1195Before the fork, IO::AIO enters a quiescent state where no requests
859can be added in other threads and no results will be processed. After 1196can be added in other threads and no results will be processed. After
860the fork the parent simply leaves the quiescent state and continues 1197the fork the parent simply leaves the quiescent state and continues
861request/result processing, while the child clears the request/result 1198request/result processing, while the child frees the request/result queue
862queue (so the requests started before the fork will only be handled in 1199(so that the requests started before the fork will only be handled in the
863the parent). Threads will be started on demand until the limit ste in the 1200parent). Threads will be started on demand until the limit set in the
864parent process has been reached again. 1201parent process has been reached again.
865 1202
866In short: the parent will, after a short pause, continue as if fork had 1203In short: the parent will, after a short pause, continue as if fork had
867not been called, while the child will act as if IO::AIO has not been used 1204not been called, while the child will act as if IO::AIO has not been used
868yet. 1205yet.
869 1206
870=head2 MEMORY USAGE 1207=head2 MEMORY USAGE
871 1208
1209Per-request usage:
1210
872Each aio request uses - depending on your architecture - around 128 bytes 1211Each aio request uses - depending on your architecture - around 100-200
873of memory. In addition, stat requests need a stat buffer (possibly a few 1212bytes of memory. In addition, stat requests need a stat buffer (possibly
874hundred bytes). Perl scalars and other data passed into aio requests will 1213a few hundred bytes), readdir requires a result buffer and so on. Perl
875also be locked. 1214scalars and other data passed into aio requests will also be locked and
1215will consume memory till the request has entered the done state.
876 1216
877This is now awfully much, so queuing lots of requests is not usually a 1217This is now awfully much, so queuing lots of requests is not usually a
878problem. 1218problem.
879 1219
880Each thread needs a stack area which is usually around 16k, sometimes much 1220Per-thread usage:
881larger, depending on the OS. 1221
1222In the execution phase, some aio requests require more memory for
1223temporary buffers, and each thread requires a stack and other data
1224structures (usually around 16k-128k, depending on the OS).
1225
1226=head1 KNOWN BUGS
1227
1228Known bugs will be fixed in the next release.
882 1229
883=head1 SEE ALSO 1230=head1 SEE ALSO
884 1231
885L<Coro>, L<Linux::AIO> (obsolete). 1232L<Coro::AIO>.
886 1233
887=head1 AUTHOR 1234=head1 AUTHOR
888 1235
889 Marc Lehmann <schmorp@schmorp.de> 1236 Marc Lehmann <schmorp@schmorp.de>
890 http://home.schmorp.de/ 1237 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines