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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines