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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines