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.65 by root, Mon Oct 23 14:49:51 2006 UTC vs.
Revision 1.106 by root, Fri Jun 1 05:51:21 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.4';
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 aio_mkdir
85 our @EXPORT_OK = qw(poll_fileno poll_cb min_parallel max_parallel max_outstanding nreqs); 201 aio_chown aio_chmod aio_utime);
202 our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice aio_block));
203 our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush
204 min_parallel max_parallel max_idle
205 nreqs nready npending nthreads
206 max_poll_time max_poll_reqs);
86 207
87 @IO::AIO::GRP::ISA = 'IO::AIO::REQ'; 208 @IO::AIO::GRP::ISA = 'IO::AIO::REQ';
88 209
89 require XSLoader; 210 require XSLoader;
90 XSLoader::load ("IO::AIO", $VERSION); 211 XSLoader::load ("IO::AIO", $VERSION);
91} 212}
92 213
93=head1 FUNCTIONS 214=head1 FUNCTIONS
94 215
95=head2 AIO FUNCTIONS 216=head2 AIO REQUEST FUNCTIONS
96 217
97All the C<aio_*> calls are more or less thin wrappers around the syscall 218All 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, 219with the same name (sans C<aio_>). The arguments are similar or identical,
99and they all accept an additional (and optional) C<$callback> argument 220and they all accept an additional (and optional) C<$callback> argument
100which must be a code reference. This code reference will get called with 221which must be a code reference. This code reference will get called with
103syscall has been executed asynchronously. 224syscall has been executed asynchronously.
104 225
105All functions expecting a filehandle keep a copy of the filehandle 226All functions expecting a filehandle keep a copy of the filehandle
106internally until the request has finished. 227internally until the request has finished.
107 228
108All requests return objects of type L<IO::AIO::REQ> that allow further 229All functions return request objects of type L<IO::AIO::REQ> that allow
109manipulation of those requests while they are in-flight. 230further manipulation of those requests while they are in-flight.
110 231
111The pathnames you pass to these routines I<must> be absolute and 232The 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 233encoded as octets. The reason for the former is that at the time the
113request is being executed, the current working directory could have 234request is being executed, the current working directory could have
114changed. Alternatively, you can make sure that you never change the 235changed. Alternatively, you can make sure that you never change the
115current working directory. 236current working directory anywhere in the program and then use relative
237paths.
116 238
117To encode pathnames to byte form, either make sure you either: a) 239To encode pathnames as octets, either make sure you either: a) always pass
118always pass in filenames you got from outside (command line, readdir 240in 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 241tinkering, 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 242your pathnames to the locale (or other) encoding in effect in the user
121environment, d) use Glib::filename_from_unicode on unicode filenames or e) 243environment, d) use Glib::filename_from_unicode on unicode filenames or e)
122use something else. 244use something else to ensure your scalar has the correct contents.
245
246This works, btw. independent of the internal UTF-8 bit, which IO::AIO
247handles correctly wether it is set or not.
123 248
124=over 4 249=over 4
250
251=item $prev_pri = aioreq_pri [$pri]
252
253Returns the priority value that would be used for the next request and, if
254C<$pri> is given, sets the priority for the next aio request.
255
256The default priority is C<0>, the minimum and maximum priorities are C<-4>
257and C<4>, respectively. Requests with higher priority will be serviced
258first.
259
260The priority will be reset to C<0> after each call to one of the C<aio_*>
261functions.
262
263Example: open a file with low priority, then read something from it with
264higher priority so the read request is serviced before other low priority
265open requests (potentially spamming the cache):
266
267 aioreq_pri -3;
268 aio_open ..., sub {
269 return unless $_[0];
270
271 aioreq_pri -2;
272 aio_read $_[0], ..., sub {
273 ...
274 };
275 };
276
277
278=item aioreq_nice $pri_adjust
279
280Similar to C<aioreq_pri>, but subtracts the given value from the current
281priority, so the effect is cumulative.
282
125 283
126=item aio_open $pathname, $flags, $mode, $callback->($fh) 284=item aio_open $pathname, $flags, $mode, $callback->($fh)
127 285
128Asynchronously open or create a file and call the callback with a newly 286Asynchronously open or create a file and call the callback with a newly
129created filehandle for the file. 287created filehandle for the file.
135list. They are the same as used by C<sysopen>. 293list. They are the same as used by C<sysopen>.
136 294
137Likewise, C<$mode> specifies the mode of the newly created file, if it 295Likewise, C<$mode> specifies the mode of the newly created file, if it
138didn't exist and C<O_CREAT> has been given, just like perl's C<sysopen>, 296didn't exist and C<O_CREAT> has been given, just like perl's C<sysopen>,
139except that it is mandatory (i.e. use C<0> if you don't create new files, 297except that it is mandatory (i.e. use C<0> if you don't create new files,
140and C<0666> or C<0777> if you do). 298and C<0666> or C<0777> if you do). Note that the C<$mode> will be modified
299by the umask in effect then the request is being executed, so better never
300change the umask.
141 301
142Example: 302Example:
143 303
144 aio_open "/etc/passwd", O_RDONLY, 0, sub { 304 aio_open "/etc/passwd", O_RDONLY, 0, sub {
145 if ($_[0]) { 305 if ($_[0]) {
148 } else { 308 } else {
149 die "open failed: $!\n"; 309 die "open failed: $!\n";
150 } 310 }
151 }; 311 };
152 312
313
153=item aio_close $fh, $callback->($status) 314=item aio_close $fh, $callback->($status)
154 315
155Asynchronously close a file and call the callback with the result 316Asynchronously close a file and call the callback with the result
156code. I<WARNING:> although accepted, you should not pass in a perl 317code. I<WARNING:> although accepted, you should not pass in a perl
157filehandle here, as perl will likely close the file descriptor another 318filehandle here, as perl will likely close the file descriptor another
159C<close> or just let filehandles go out of scope. 320C<close> or just let filehandles go out of scope.
160 321
161This is supposed to be a bug in the API, so that might change. It's 322This is supposed to be a bug in the API, so that might change. It's
162therefore best to avoid this function. 323therefore best to avoid this function.
163 324
325
164=item aio_read $fh,$offset,$length, $data,$dataoffset, $callback->($retval) 326=item aio_read $fh,$offset,$length, $data,$dataoffset, $callback->($retval)
165 327
166=item aio_write $fh,$offset,$length, $data,$dataoffset, $callback->($retval) 328=item aio_write $fh,$offset,$length, $data,$dataoffset, $callback->($retval)
167 329
168Reads or writes C<length> bytes from the specified C<fh> and C<offset> 330Reads or writes C<length> bytes from the specified C<fh> and C<offset>
180 aio_read $fh, 7, 15, $buffer, 0, sub { 342 aio_read $fh, 7, 15, $buffer, 0, sub {
181 $_[0] > 0 or die "read error: $!"; 343 $_[0] > 0 or die "read error: $!";
182 print "read $_[0] bytes: <$buffer>\n"; 344 print "read $_[0] bytes: <$buffer>\n";
183 }; 345 };
184 346
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 347
255=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval) 348=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval)
256 349
257Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts 350Tries 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 351reading at byte offset C<$in_offset>, and starts writing at the current
272C<$in_fh> than are written, and there is no way to find out how many 365C<$in_fh> than are written, and there is no way to find out how many
273bytes have been read from C<aio_sendfile> alone, as C<aio_sendfile> only 366bytes have been read from C<aio_sendfile> alone, as C<aio_sendfile> only
274provides the number of bytes written to C<$out_fh>. Only if the result 367provides the number of bytes written to C<$out_fh>. Only if the result
275value equals C<$length> one can assume that C<$length> bytes have been 368value equals C<$length> one can assume that C<$length> bytes have been
276read. 369read.
370
277 371
278=item aio_readahead $fh,$offset,$length, $callback->($retval) 372=item aio_readahead $fh,$offset,$length, $callback->($retval)
279 373
280C<aio_readahead> populates the page cache with data from a file so that 374C<aio_readahead> populates the page cache with data from a file so that
281subsequent reads from that file will not block on disk I/O. The C<$offset> 375subsequent reads from that file will not block on disk I/O. The C<$offset>
287file. The current file offset of the file is left unchanged. 381file. The current file offset of the file is left unchanged.
288 382
289If that syscall doesn't exist (likely if your OS isn't Linux) it will be 383If that syscall doesn't exist (likely if your OS isn't Linux) it will be
290emulated by simply reading the data, which would have a similar effect. 384emulated by simply reading the data, which would have a similar effect.
291 385
386
292=item aio_stat $fh_or_path, $callback->($status) 387=item aio_stat $fh_or_path, $callback->($status)
293 388
294=item aio_lstat $fh, $callback->($status) 389=item aio_lstat $fh, $callback->($status)
295 390
296Works like perl's C<stat> or C<lstat> in void context. The callback will 391Works like perl's C<stat> or C<lstat> in void context. The callback will
309 aio_stat "/etc/passwd", sub { 404 aio_stat "/etc/passwd", sub {
310 $_[0] and die "stat failed: $!"; 405 $_[0] and die "stat failed: $!";
311 print "size is ", -s _, "\n"; 406 print "size is ", -s _, "\n";
312 }; 407 };
313 408
409
410=item aio_utime $fh_or_path, $atime, $mtime, $callback->($status)
411
412Works like perl's C<utime> function (including the special case of $atime
413and $mtime being undef). Fractional times are supported if the underlying
414syscalls support them.
415
416When called with a pathname, uses utimes(2) if available, otherwise
417utime(2). If called on a file descriptor, uses futimes(2) if available,
418otherwise returns ENOSYS, so this is not portable.
419
420Examples:
421
422 # set atime and mtime to current time:
423 aio_utime "path", undef, undef;
424 # set atime to current time and mtime to beginning of the epoch:
425 aio_utime "path", time, undef; # undef==0
426
427
428=item aio_chown $fh_or_path, $uid, $gid, $callback->($status)
429
430Works like perl's C<chown> function, except that C<undef> for either $uid
431or $gid is being interpreted as "do not change" (but -1 can also be used).
432
433Examples:
434
435 # same as "chown root path" in the shell:
436 aio_chown "path", 0, -1;
437 # same as above:
438 aio_chown "path", 0, undef;
439
440
441=item aio_chmod $fh_or_path, $mode, $callback->($status)
442
443Works like perl's C<chmod> function.
444
445
314=item aio_unlink $pathname, $callback->($status) 446=item aio_unlink $pathname, $callback->($status)
315 447
316Asynchronously unlink (delete) a file and call the callback with the 448Asynchronously unlink (delete) a file and call the callback with the
317result code. 449result code.
318 450
451
452=item aio_mknod $path, $mode, $dev, $callback->($status)
453
454[EXPERIMENTAL]
455
456Asynchronously create a device node (or fifo). See mknod(2).
457
458The only (POSIX-) portable way of calling this function is:
459
460 aio_mknod $path, IO::AIO::S_IFIFO | $mode, 0, sub { ...
461
462
319=item aio_link $srcpath, $dstpath, $callback->($status) 463=item aio_link $srcpath, $dstpath, $callback->($status)
320 464
321Asynchronously create a new link to the existing object at C<$srcpath> at 465Asynchronously create a new link to the existing object at C<$srcpath> at
322the path C<$dstpath> and call the callback with the result code. 466the path C<$dstpath> and call the callback with the result code.
323 467
468
324=item aio_symlink $srcpath, $dstpath, $callback->($status) 469=item aio_symlink $srcpath, $dstpath, $callback->($status)
325 470
326Asynchronously create a new symbolic link to the existing object at C<$srcpath> at 471Asynchronously 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. 472the path C<$dstpath> and call the callback with the result code.
328 473
474
475=item aio_readlink $path, $callback->($link)
476
477Asynchronously read the symlink specified by C<$path> and pass it to
478the callback. If an error occurs, nothing or undef gets passed to the
479callback.
480
481
329=item aio_rename $srcpath, $dstpath, $callback->($status) 482=item aio_rename $srcpath, $dstpath, $callback->($status)
330 483
331Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as 484Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as
332rename(2) and call the callback with the result code. 485rename(2) and call the callback with the result code.
333 486
487
488=item aio_mkdir $pathname, $mode, $callback->($status)
489
490Asynchronously mkdir (create) a directory and call the callback with
491the result code. C<$mode> will be modified by the umask at the time the
492request is executed, so do not change your umask.
493
494
334=item aio_rmdir $pathname, $callback->($status) 495=item aio_rmdir $pathname, $callback->($status)
335 496
336Asynchronously rmdir (delete) a directory and call the callback with the 497Asynchronously rmdir (delete) a directory and call the callback with the
337result code. 498result code.
499
338 500
339=item aio_readdir $pathname, $callback->($entries) 501=item aio_readdir $pathname, $callback->($entries)
340 502
341Unlike the POSIX call of the same name, C<aio_readdir> reads an entire 503Unlike the POSIX call of the same name, C<aio_readdir> reads an entire
342directory (i.e. opendir + readdir + closedir). The entries will not be 504directory (i.e. opendir + readdir + closedir). The entries will not be
343sorted, and will B<NOT> include the C<.> and C<..> entries. 505sorted, and will B<NOT> include the C<.> and C<..> entries.
344 506
345The callback a single argument which is either C<undef> or an array-ref 507The callback a single argument which is either C<undef> or an array-ref
346with the filenames. 508with the filenames.
347 509
510
511=item aio_load $path, $data, $callback->($status)
512
513This is a composite request that tries to fully load the given file into
514memory. Status is the same as with aio_read.
515
516=cut
517
518sub aio_load($$;$) {
519 aio_block {
520 my ($path, undef, $cb) = @_;
521 my $data = \$_[1];
522
523 my $pri = aioreq_pri;
524 my $grp = aio_group $cb;
525
526 aioreq_pri $pri;
527 add $grp aio_open $path, O_RDONLY, 0, sub {
528 my $fh = shift
529 or return $grp->result (-1);
530
531 aioreq_pri $pri;
532 add $grp aio_read $fh, 0, (-s $fh), $$data, 0, sub {
533 $grp->result ($_[0]);
534 };
535 };
536
537 $grp
538 }
539}
540
541=item aio_copy $srcpath, $dstpath, $callback->($status)
542
543Try to copy the I<file> (directories not supported as either source or
544destination) from C<$srcpath> to C<$dstpath> and call the callback with
545the C<0> (error) or C<-1> ok.
546
547This is a composite request that it creates the destination file with
548mode 0200 and copies the contents of the source file into it using
549C<aio_sendfile>, followed by restoring atime, mtime, access mode and
550uid/gid, in that order.
551
552If an error occurs, the partial destination file will be unlinked, if
553possible, except when setting atime, mtime, access mode and uid/gid, where
554errors are being ignored.
555
556=cut
557
558sub aio_copy($$;$) {
559 aio_block {
560 my ($src, $dst, $cb) = @_;
561
562 my $pri = aioreq_pri;
563 my $grp = aio_group $cb;
564
565 aioreq_pri $pri;
566 add $grp aio_open $src, O_RDONLY, 0, sub {
567 if (my $src_fh = $_[0]) {
568 my @stat = stat $src_fh;
569
570 aioreq_pri $pri;
571 add $grp aio_open $dst, O_CREAT | O_WRONLY | O_TRUNC, 0200, sub {
572 if (my $dst_fh = $_[0]) {
573 aioreq_pri $pri;
574 add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
575 if ($_[0] == $stat[7]) {
576 $grp->result (0);
577 close $src_fh;
578
579 # those should not normally block. should. should.
580 utime $stat[8], $stat[9], $dst;
581 chmod $stat[2] & 07777, $dst_fh;
582 chown $stat[4], $stat[5], $dst_fh;
583 close $dst_fh;
584 } else {
585 $grp->result (-1);
586 close $src_fh;
587 close $dst_fh;
588
589 aioreq $pri;
590 add $grp aio_unlink $dst;
591 }
592 };
593 } else {
594 $grp->result (-1);
595 }
596 },
597
598 } else {
599 $grp->result (-1);
600 }
601 };
602
603 $grp
604 }
605}
606
607=item aio_move $srcpath, $dstpath, $callback->($status)
608
609Try to move the I<file> (directories not supported as either source or
610destination) from C<$srcpath> to C<$dstpath> and call the callback with
611the C<0> (error) or C<-1> ok.
612
613This is a composite request that tries to rename(2) the file first. If
614rename files with C<EXDEV>, it copies the file with C<aio_copy> and, if
615that is successful, unlinking the C<$srcpath>.
616
617=cut
618
619sub aio_move($$;$) {
620 aio_block {
621 my ($src, $dst, $cb) = @_;
622
623 my $pri = aioreq_pri;
624 my $grp = aio_group $cb;
625
626 aioreq_pri $pri;
627 add $grp aio_rename $src, $dst, sub {
628 if ($_[0] && $! == EXDEV) {
629 aioreq_pri $pri;
630 add $grp aio_copy $src, $dst, sub {
631 $grp->result ($_[0]);
632
633 if (!$_[0]) {
634 aioreq_pri $pri;
635 add $grp aio_unlink $src;
636 }
637 };
638 } else {
639 $grp->result ($_[0]);
640 }
641 };
642
643 $grp
644 }
645}
646
348=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) 647=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs)
349 648
350[EXPERIMENTAL due to internal aio_group use]
351
352Scans a directory (similar to C<aio_readdir>) but additionally tries to 649Scans a directory (similar to C<aio_readdir>) but additionally tries to
353separate the entries of directory C<$path> into two sets of names, ones 650efficiently separate the entries of directory C<$path> into two sets of
354you can recurse into (directories or links to them), and ones you cannot 651names, directories you can recurse into (directories), and ones you cannot
355recurse into (everything else). 652recurse into (everything else, including symlinks to directories).
356 653
357C<aio_scandir> is a composite request that creates of many sub requests_ 654C<aio_scandir> is a composite request that creates of many sub requests_
358C<$maxreq> specifies the maximum number of outstanding aio requests that 655C<$maxreq> specifies the maximum number of outstanding aio requests that
359this function generates. If it is C<< <= 0 >>, then a suitable default 656this function generates. If it is C<< <= 0 >>, then a suitable default
360will be chosen (currently 6). 657will be chosen (currently 4).
361 658
362On error, the callback is called without arguments, otherwise it receives 659On error, the callback is called without arguments, otherwise it receives
363two array-refs with path-relative entry names. 660two array-refs with path-relative entry names.
364 661
365Example: 662Example:
399as those tend to return 0 or 1 as link counts, which disables the 696as those tend to return 0 or 1 as link counts, which disables the
400directory counting heuristic. 697directory counting heuristic.
401 698
402=cut 699=cut
403 700
404sub aio_scandir($$$) { 701sub aio_scandir($$;$) {
702 aio_block {
405 my ($path, $maxreq, $cb) = @_; 703 my ($path, $maxreq, $cb) = @_;
406 704
705 my $pri = aioreq_pri;
706
407 my $grp = aio_group $cb; 707 my $grp = aio_group $cb;
408 708
409 $maxreq = 6 if $maxreq <= 0; 709 $maxreq = 4 if $maxreq <= 0;
410 710
411 # stat once 711 # stat once
712 aioreq_pri $pri;
412 add $grp aio_stat $path, sub { 713 add $grp aio_stat $path, sub {
413 return $grp->result () if $_[0]; 714 return $grp->result () if $_[0];
414 my $now = time; 715 my $now = time;
415 my $hash1 = join ":", (stat _)[0,1,3,7,9]; 716 my $hash1 = join ":", (stat _)[0,1,3,7,9];
416 717
417 # read the directory entries 718 # read the directory entries
719 aioreq_pri $pri;
418 add $grp aio_readdir $path, sub { 720 add $grp aio_readdir $path, sub {
419 my $entries = shift 721 my $entries = shift
420 or return $grp->result (); 722 or return $grp->result ();
421 723
422 # stat the dir another time 724 # stat the dir another time
725 aioreq_pri $pri;
423 add $grp aio_stat $path, sub { 726 add $grp aio_stat $path, sub {
424 my $hash2 = join ":", (stat _)[0,1,3,7,9]; 727 my $hash2 = join ":", (stat _)[0,1,3,7,9];
425 728
426 my $ndirs; 729 my $ndirs;
427 730
428 # take the slow route if anything looks fishy 731 # take the slow route if anything looks fishy
429 if ($hash1 ne $hash2 or (stat _)[9] == $now) { 732 if ($hash1 ne $hash2 or (stat _)[9] == $now) {
430 $ndirs = -1; 733 $ndirs = -1;
431 } else { 734 } else {
432 # if nlink == 2, we are finished 735 # if nlink == 2, we are finished
433 # on non-posix-fs's, we rely on nlink < 2 736 # on non-posix-fs's, we rely on nlink < 2
434 $ndirs = (stat _)[3] - 2 737 $ndirs = (stat _)[3] - 2
435 or return $grp->result ([], $entries); 738 or return $grp->result ([], $entries);
436 } 739 }
437 740
438 # sort into likely dirs and likely nondirs 741 # sort into likely dirs and likely nondirs
439 # dirs == files without ".", short entries first 742 # dirs == files without ".", short entries first
440 $entries = [map $_->[0], 743 $entries = [map $_->[0],
441 sort { $b->[1] cmp $a->[1] } 744 sort { $b->[1] cmp $a->[1] }
442 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length], 745 map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length],
443 @$entries]; 746 @$entries];
444 747
445 my (@dirs, @nondirs); 748 my (@dirs, @nondirs);
446 749
447 my ($statcb, $schedcb);
448 my $nreq = 0;
449
450 my $statgrp = add $grp aio_group; 750 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); 751 $grp->result (\@dirs, \@nondirs);
465 } 752 };
753
754 limit $statgrp $maxreq;
755 feed $statgrp sub {
756 return unless @$entries;
757 my $entry = pop @$entries;
758
759 aioreq_pri $pri;
760 add $statgrp aio_stat "$path/$entry/.", sub {
761 if ($_[0] < 0) {
762 push @nondirs, $entry;
763 } else {
764 # need to check for real directory
765 aioreq_pri $pri;
766 add $statgrp aio_lstat "$path/$entry", sub {
767 if (-d _) {
768 push @dirs, $entry;
769
770 unless (--$ndirs) {
771 push @nondirs, @$entries;
772 feed $statgrp;
773 }
774 } else {
775 push @nondirs, $entry;
776 }
777 }
778 }
779 };
780 };
466 }; 781 };
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 }; 782 };
497 }; 783 };
784
785 $grp
498 }; 786 }
787}
499 788
789=item aio_rmtree $path, $callback->($status)
790
791Delete a directory tree starting (and including) C<$path>, return the
792status of the final C<rmdir> only. This is a composite request that
793uses C<aio_scandir> to recurse into and rmdir directories, and unlink
794everything else.
795
796=cut
797
798sub aio_rmtree;
799sub aio_rmtree($;$) {
800 aio_block {
801 my ($path, $cb) = @_;
802
803 my $pri = aioreq_pri;
804 my $grp = aio_group $cb;
805
806 aioreq_pri $pri;
807 add $grp aio_scandir $path, 0, sub {
808 my ($dirs, $nondirs) = @_;
809
810 my $dirgrp = aio_group sub {
811 add $grp aio_rmdir $path, sub {
812 $grp->result ($_[0]);
813 };
814 };
815
816 (aioreq_pri $pri), add $dirgrp aio_rmtree "$path/$_" for @$dirs;
817 (aioreq_pri $pri), add $dirgrp aio_unlink "$path/$_" for @$nondirs;
818
819 add $grp $dirgrp;
820 };
821
500 $grp 822 $grp
823 }
501} 824}
502 825
503=item aio_fsync $fh, $callback->($status) 826=item aio_fsync $fh, $callback->($status)
504 827
505Asynchronously call fsync on the given filehandle and call the callback 828Asynchronously 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 836If 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. 837detected, it will be emulated by calling C<fsync> instead.
515 838
516=item aio_group $callback->(...) 839=item aio_group $callback->(...)
517 840
518[EXPERIMENTAL]
519
520This is a very special aio request: Instead of doing something, it is a 841This 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 842container for other aio requests, which is useful if you want to bundle
522many requests into a single, composite, request. 843many requests into a single, composite, request with a definite callback
844and the ability to cancel the whole request with its subrequests.
523 845
524Returns an object of class L<IO::AIO::GRP>. See its documentation below 846Returns an object of class L<IO::AIO::GRP>. See its documentation below
525for more info. 847for more info.
526 848
527Example: 849Example:
546phase and still requires a worker thread. Thus, the callback will not 868phase and still requires a worker thread. Thus, the callback will not
547be executed immediately but only after other requests in the queue have 869be executed immediately but only after other requests in the queue have
548entered their execution phase. This can be used to measure request 870entered their execution phase. This can be used to measure request
549latency. 871latency.
550 872
551=item IO::AIO::aio_sleep $fractional_seconds, $callback->() *NOT EXPORTED* 873=item IO::AIO::aio_busy $fractional_seconds, $callback->() *NOT EXPORTED*
552 874
553Mainly used for debugging and benchmarking, this aio request puts one of 875Mainly used for debugging and benchmarking, this aio request puts one of
554the request workers to sleep for the given time. 876the request workers to sleep for the given time.
555 877
556While it is theoretically handy to have simple I/O scheduling requests 878While it is theoretically handy to have simple I/O scheduling requests
557like sleep and file handle readable/writable, the overhead this creates 879like sleep and file handle readable/writable, the overhead this creates is
558is immense, so do not use this function except to put your application 880immense (it blocks a thread for a long time) so do not use this function
559under artificial I/O pressure. 881except to put your application under artificial I/O pressure.
560 882
561=back 883=back
562 884
563=head2 IO::AIO::REQ CLASS 885=head2 IO::AIO::REQ CLASS
564 886
565All non-aggregate C<aio_*> functions return an object of this class when 887All non-aggregate C<aio_*> functions return an object of this class when
566called in non-void context. 888called in non-void context.
567
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 889
576=over 4 890=over 4
577 891
578=item cancel $req 892=item cancel $req
579 893
633=item * They can also can also be added to other IO::AIO::GRP objects. 947=item * They can also can also be added to other IO::AIO::GRP objects.
634 948
635=item * You must not add requests to a group from within the group callback (or 949=item * You must not add requests to a group from within the group callback (or
636any later time). 950any later time).
637 951
638=item * This does not harmonise well with C<max_outstanding>, so best do
639not combine C<aio_group> with it. Groups and feeders are recommended for
640this kind of concurrency-limiting.
641
642=back 952=back
643 953
644Their lifetime, simplified, looks like this: when they are empty, they 954Their lifetime, simplified, looks like this: when they are empty, they
645will finish very quickly. If they contain only requests that are in the 955will finish very quickly. If they contain only requests that are in the
646C<done> state, they will also finish. Otherwise they will continue to 956C<done> state, they will also finish. Otherwise they will continue to
661be added, including other groups, as long as you do not create circular 971be added, including other groups, as long as you do not create circular
662dependencies. 972dependencies.
663 973
664Returns all its arguments. 974Returns all its arguments.
665 975
976=item $grp->cancel_subs
977
978Cancel all subrequests and clears any feeder, but not the group request
979itself. Useful when you queued a lot of events but got a result early.
980
666=item $grp->result (...) 981=item $grp->result (...)
667 982
668Set the result value(s) that will be passed to the group callback when all 983Set the result value(s) that will be passed to the group callback when all
669subrequests have finished. By default, no argument will be passed. 984subrequests have finished and set thre groups errno to the current value
985of errno (just like calling C<errno> without an error number). By default,
986no argument will be passed and errno is zero.
987
988=item $grp->errno ([$errno])
989
990Sets the group errno value to C<$errno>, or the current value of errno
991when the argument is missing.
992
993Every aio request has an associated errno value that is restored when
994the callback is invoked. This method lets you change this value from its
995default (0).
996
997Calling C<result> will also set errno, so make sure you either set C<$!>
998before the call to C<result>, or call c<errno> after it.
670 999
671=item feed $grp $callback->($grp) 1000=item feed $grp $callback->($grp)
672
673[VERY EXPERIMENTAL]
674 1001
675Sets a feeder/generator on this group: every group can have an attached 1002Sets a feeder/generator on this group: every group can have an attached
676generator that generates requests if idle. The idea behind this is that, 1003generator that generates requests if idle. The idea behind this is that,
677although you could just queue as many requests as you want in a group, 1004although you could just queue as many requests as you want in a group,
678this might starve other requests for a potentially long time. For 1005this might starve other requests for a potentially long time. For
679example, C<aio_scandir> might generate hundreds of thousands C<aio_stat> 1006example, C<aio_scandir> might generate hundreds of thousands C<aio_stat>
680requests, delaying any later requests for a long time. 1007requests, delaying any later requests for a long time.
681 1008
682To avoid this, and allow incremental generation of requests, you can 1009To avoid this, and allow incremental generation of requests, you can
683instead a group and set a feeder on it that generates those requests. The 1010instead a group and set a feeder on it that generates those requests. The
684feed callback will be called whenever there are few enough (see C<feed_limit>, 1011feed callback will be called whenever there are few enough (see C<limit>,
685below) requests active in the group itself and is expected to queue more 1012below) requests active in the group itself and is expected to queue more
686requests. 1013requests.
687 1014
688The feed can queue as many requests as it likes (i.e. C<add> does not 1015The feed callback can queue as many requests as it likes (i.e. C<add> does
689impose any limits). 1016not impose any limits).
690 1017
691If the feed does not queue more requests when called, it will be 1018If the feed does not queue more requests when called, it will be
692automatically removed from the group. 1019automatically removed from the group.
693 1020
694If the feed limit is C<0>, it will be set to C<2> automatically. 1021If the feed limit is C<0>, it will be set to C<2> automatically.
696Example: 1023Example:
697 1024
698 # stat all files in @files, but only ever use four aio requests concurrently: 1025 # stat all files in @files, but only ever use four aio requests concurrently:
699 1026
700 my $grp = aio_group sub { print "finished\n" }; 1027 my $grp = aio_group sub { print "finished\n" };
701 feed_limit $grp 4; 1028 limit $grp 4;
702 feed $grp sub { 1029 feed $grp sub {
703 my $file = pop @files 1030 my $file = pop @files
704 or return; 1031 or return;
705 1032
706 add $grp aio_stat $file, sub { ... }; 1033 add $grp aio_stat $file, sub { ... };
707 }; 1034 };
708 1035
709=item feed_limit $grp $num 1036=item limit $grp $num
710 1037
711Sets the feeder limit for the group: The feeder will be called whenever 1038Sets the feeder limit for the group: The feeder will be called whenever
712the group contains less than this many requests. 1039the group contains less than this many requests.
713 1040
714Setting the limit to C<0> will pause the feeding process. 1041Setting the limit to C<0> will pause the feeding process.
715 1042
716=back 1043=back
717 1044
718=head2 SUPPORT FUNCTIONS 1045=head2 SUPPORT FUNCTIONS
1046
1047=head3 EVENT PROCESSING AND EVENT LOOP INTEGRATION
719 1048
720=over 4 1049=over 4
721 1050
722=item $fileno = IO::AIO::poll_fileno 1051=item $fileno = IO::AIO::poll_fileno
723 1052
728 1057
729See C<poll_cb> for an example. 1058See C<poll_cb> for an example.
730 1059
731=item IO::AIO::poll_cb 1060=item IO::AIO::poll_cb
732 1061
733Process all outstanding events on the result pipe. You have to call this 1062Process some outstanding events on the result pipe. You have to call this
734regularly. Returns the number of events processed. Returns immediately 1063regularly. Returns the number of events processed. Returns immediately
735when no events are outstanding. 1064when no events are outstanding. The amount of events processed depends on
1065the settings of C<IO::AIO::max_poll_req> and C<IO::AIO::max_poll_time>.
1066
1067If not all requests were processed for whatever reason, the filehandle
1068will still be ready when C<poll_cb> returns.
736 1069
737Example: Install an Event watcher that automatically calls 1070Example: Install an Event watcher that automatically calls
738IO::AIO::poll_cb with high priority: 1071IO::AIO::poll_cb with high priority:
739 1072
740 Event->io (fd => IO::AIO::poll_fileno, 1073 Event->io (fd => IO::AIO::poll_fileno,
741 poll => 'r', async => 1, 1074 poll => 'r', async => 1,
742 cb => \&IO::AIO::poll_cb); 1075 cb => \&IO::AIO::poll_cb);
743 1076
1077=item IO::AIO::max_poll_reqs $nreqs
1078
1079=item IO::AIO::max_poll_time $seconds
1080
1081These set the maximum number of requests (default C<0>, meaning infinity)
1082that are being processed by C<IO::AIO::poll_cb> in one call, respectively
1083the maximum amount of time (default C<0>, meaning infinity) spent in
1084C<IO::AIO::poll_cb> to process requests (more correctly the mininum amount
1085of time C<poll_cb> is allowed to use).
1086
1087Setting C<max_poll_time> to a non-zero value creates an overhead of one
1088syscall per request processed, which is not normally a problem unless your
1089callbacks are really really fast or your OS is really really slow (I am
1090not mentioning Solaris here). Using C<max_poll_reqs> incurs no overhead.
1091
1092Setting these is useful if you want to ensure some level of
1093interactiveness when perl is not fast enough to process all requests in
1094time.
1095
1096For interactive programs, values such as C<0.01> to C<0.1> should be fine.
1097
1098Example: Install an Event watcher that automatically calls
1099IO::AIO::poll_cb with low priority, to ensure that other parts of the
1100program get the CPU sometimes even under high AIO load.
1101
1102 # try not to spend much more than 0.1s in poll_cb
1103 IO::AIO::max_poll_time 0.1;
1104
1105 # use a low priority so other tasks have priority
1106 Event->io (fd => IO::AIO::poll_fileno,
1107 poll => 'r', nice => 1,
1108 cb => &IO::AIO::poll_cb);
1109
744=item IO::AIO::poll_wait 1110=item IO::AIO::poll_wait
745 1111
1112If there are any outstanding requests and none of them in the result
746Wait till the result filehandle becomes ready for reading (simply does a 1113phase, wait till the result filehandle becomes ready for reading (simply
747C<select> on the filehandle. This is useful if you want to synchronously wait 1114does a C<select> on the filehandle. This is useful if you want to
748for some requests to finish). 1115synchronously wait for some requests to finish).
749 1116
750See C<nreqs> for an example. 1117See C<nreqs> for an example.
751 1118
1119=item IO::AIO::poll
1120
1121Waits until some requests have been handled.
1122
1123Returns the number of requests processed, but is otherwise strictly
1124equivalent to:
1125
1126 IO::AIO::poll_wait, IO::AIO::poll_cb
1127
752=item IO::AIO::nreqs 1128=item IO::AIO::flush
753 1129
754Returns the number of requests currently outstanding (i.e. for which their 1130Wait till all outstanding AIO requests have been handled.
755callback has not been invoked yet).
756 1131
757Example: wait till there are no outstanding requests anymore: 1132Strictly equivalent to:
758 1133
759 IO::AIO::poll_wait, IO::AIO::poll_cb 1134 IO::AIO::poll_wait, IO::AIO::poll_cb
760 while IO::AIO::nreqs; 1135 while IO::AIO::nreqs;
761 1136
762=item IO::AIO::flush 1137=back
763 1138
764Wait till all outstanding AIO requests have been handled. 1139=head3 CONTROLLING THE NUMBER OF THREADS
765 1140
766Strictly equivalent to: 1141=over
767
768 IO::AIO::poll_wait, IO::AIO::poll_cb
769 while IO::AIO::nreqs;
770
771=item IO::AIO::poll
772
773Waits until some requests have been handled.
774
775Strictly equivalent to:
776
777 IO::AIO::poll_wait, IO::AIO::poll_cb
778 if IO::AIO::nreqs;
779 1142
780=item IO::AIO::min_parallel $nthreads 1143=item IO::AIO::min_parallel $nthreads
781 1144
782Set the minimum number of AIO threads to C<$nthreads>. The current 1145Set the minimum number of AIO threads to C<$nthreads>. The current
783default is C<8>, which means eight asynchronous operations can execute 1146default is C<8>, which means eight asynchronous operations can execute
784concurrently at any one time (the number of outstanding requests, 1147concurrently at any one time (the number of outstanding requests,
785however, is unlimited). 1148however, is unlimited).
786 1149
787IO::AIO starts threads only on demand, when an AIO request is queued and 1150IO::AIO starts threads only on demand, when an AIO request is queued and
788no free thread exists. 1151no free thread exists. Please note that queueing up a hundred requests can
1152create demand for a hundred threads, even if it turns out that everything
1153is in the cache and could have been processed faster by a single thread.
789 1154
790It is recommended to keep the number of threads relatively low, as some 1155It is recommended to keep the number of threads relatively low, as some
791Linux kernel versions will scale negatively with the number of threads 1156Linux kernel versions will scale negatively with the number of threads
792(higher parallelity => MUCH higher latency). With current Linux 2.6 1157(higher parallelity => MUCH higher latency). With current Linux 2.6
793versions, 4-32 threads should be fine. 1158versions, 4-32 threads should be fine.
807This module automatically runs C<max_parallel 0> at program end, to ensure 1172This module automatically runs C<max_parallel 0> at program end, to ensure
808that all threads are killed and that there are no outstanding requests. 1173that all threads are killed and that there are no outstanding requests.
809 1174
810Under normal circumstances you don't need to call this function. 1175Under normal circumstances you don't need to call this function.
811 1176
1177=item IO::AIO::max_idle $nthreads
1178
1179Limit the number of threads (default: 4) that are allowed to idle (i.e.,
1180threads that did not get a request to process within 10 seconds). That
1181means if a thread becomes idle while C<$nthreads> other threads are also
1182idle, it will free its resources and exit.
1183
1184This is useful when you allow a large number of threads (e.g. 100 or 1000)
1185to allow for extremely high load situations, but want to free resources
1186under normal circumstances (1000 threads can easily consume 30MB of RAM).
1187
1188The default is probably ok in most situations, especially if thread
1189creation is fast. If thread creation is very slow on your system you might
1190want to use larger values.
1191
812=item $oldnreqs = IO::AIO::max_outstanding $nreqs 1192=item $oldmaxreqs = IO::AIO::max_outstanding $maxreqs
813 1193
814[DEPRECATED] 1194This is a very bad function to use in interactive programs because it
1195blocks, and a bad way to reduce concurrency because it is inexact: Better
1196use an C<aio_group> together with a feed callback.
815 1197
816Sets the maximum number of outstanding requests to C<$nreqs>. If you 1198Sets the maximum number of outstanding requests to C<$nreqs>. If you
817try to queue up more than this number of requests, the caller will block until 1199to queue up more than this number of requests, the next call to the
818some requests have been handled. 1200C<poll_cb> (and C<poll_some> and other functions calling C<poll_cb>)
1201function will block until the limit is no longer exceeded.
819 1202
820The default is very large, so normally there is no practical limit. If you 1203The default value is very large, so there is no practical limit on the
821queue up many requests in a loop it often improves speed if you set 1204number of outstanding requests.
822this to a relatively low number, such as C<100>.
823 1205
824This function does not work well together with C<aio_group>'s, and their 1206You can still queue as many requests as you want. Therefore,
825feeder interface is better suited to limiting concurrency, so do not use 1207C<max_oustsanding> is mainly useful in simple scripts (with low values) or
826this function. 1208as a stop gap to shield against fatal memory overflow (with large values).
827 1209
828Under normal circumstances you don't need to call this function. 1210=back
1211
1212=head3 STATISTICAL INFORMATION
1213
1214=over
1215
1216=item IO::AIO::nreqs
1217
1218Returns the number of requests currently in the ready, execute or pending
1219states (i.e. for which their callback has not been invoked yet).
1220
1221Example: wait till there are no outstanding requests anymore:
1222
1223 IO::AIO::poll_wait, IO::AIO::poll_cb
1224 while IO::AIO::nreqs;
1225
1226=item IO::AIO::nready
1227
1228Returns the number of requests currently in the ready state (not yet
1229executed).
1230
1231=item IO::AIO::npending
1232
1233Returns the number of requests currently in the pending state (executed,
1234but not yet processed by poll_cb).
829 1235
830=back 1236=back
831 1237
832=cut 1238=cut
833 1239
847 *$sym 1253 *$sym
848} 1254}
849 1255
850min_parallel 8; 1256min_parallel 8;
851 1257
852END { 1258END { flush }
853 max_parallel 0;
854}
855 1259
8561; 12601;
857 1261
858=head2 FORK BEHAVIOUR 1262=head2 FORK BEHAVIOUR
859 1263
860This module should do "the right thing" when the process using it forks: 1264This module should do "the right thing" when the process using it forks:
861 1265
862Before the fork, IO::AIO enters a quiescent state where no requests 1266Before the fork, IO::AIO enters a quiescent state where no requests
863can be added in other threads and no results will be processed. After 1267can be added in other threads and no results will be processed. After
864the fork the parent simply leaves the quiescent state and continues 1268the fork the parent simply leaves the quiescent state and continues
865request/result processing, while the child clears the request/result 1269request/result processing, while the child frees the request/result queue
866queue (so the requests started before the fork will only be handled in 1270(so that the requests started before the fork will only be handled in the
867the parent). Threads will be started on demand until the limit ste in the 1271parent). Threads will be started on demand until the limit set in the
868parent process has been reached again. 1272parent process has been reached again.
869 1273
870In short: the parent will, after a short pause, continue as if fork had 1274In short: the parent will, after a short pause, continue as if fork had
871not been called, while the child will act as if IO::AIO has not been used 1275not been called, while the child will act as if IO::AIO has not been used
872yet. 1276yet.
873 1277
874=head2 MEMORY USAGE 1278=head2 MEMORY USAGE
875 1279
1280Per-request usage:
1281
876Each aio request uses - depending on your architecture - around 128 bytes 1282Each aio request uses - depending on your architecture - around 100-200
877of memory. In addition, stat requests need a stat buffer (possibly a few 1283bytes of memory. In addition, stat requests need a stat buffer (possibly
878hundred bytes). Perl scalars and other data passed into aio requests will 1284a few hundred bytes), readdir requires a result buffer and so on. Perl
879also be locked. 1285scalars and other data passed into aio requests will also be locked and
1286will consume memory till the request has entered the done state.
880 1287
881This is now awfully much, so queuing lots of requests is not usually a 1288This is now awfully much, so queuing lots of requests is not usually a
882problem. 1289problem.
883 1290
884Each thread needs a stack area which is usually around 16k, sometimes much 1291Per-thread usage:
885larger, depending on the OS. 1292
1293In the execution phase, some aio requests require more memory for
1294temporary buffers, and each thread requires a stack and other data
1295structures (usually around 16k-128k, depending on the OS).
1296
1297=head1 KNOWN BUGS
1298
1299Known bugs will be fixed in the next release.
886 1300
887=head1 SEE ALSO 1301=head1 SEE ALSO
888 1302
889L<Coro>, L<Linux::AIO> (obsolete). 1303L<Coro::AIO>.
890 1304
891=head1 AUTHOR 1305=head1 AUTHOR
892 1306
893 Marc Lehmann <schmorp@schmorp.de> 1307 Marc Lehmann <schmorp@schmorp.de>
894 http://home.schmorp.de/ 1308 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines