… | |
… | |
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 | |
… | |
… | |
25 | $req->cancel; # cancel request if still in queue |
26 | $req->cancel; # cancel request if still in queue |
26 | |
27 | |
27 | my $grp = aio_group sub { print "all stats done\n" }; |
28 | my $grp = aio_group sub { print "all stats done\n" }; |
28 | add $grp aio_stat "..." for ...; |
29 | add $grp aio_stat "..." for ...; |
29 | |
30 | |
30 | # AnyEvent integration |
31 | # AnyEvent integration (EV, Event, Glib, Tk, urxvt, pureperl...) |
31 | open my $fh, "<&=" . IO::AIO::poll_fileno or die "$!"; |
32 | open my $fh, "<&=" . IO::AIO::poll_fileno or die "$!"; |
32 | 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 }); |
|
|
34 | |
|
|
35 | # EV integration |
|
|
36 | my $w = EV::io IO::AIO::poll_fileno, EV::READ, \&IO::AIO::poll_cb; |
33 | |
37 | |
34 | # Event integration |
38 | # Event integration |
35 | Event->io (fd => IO::AIO::poll_fileno, |
39 | Event->io (fd => IO::AIO::poll_fileno, |
36 | poll => 'r', |
40 | poll => 'r', |
37 | cb => \&IO::AIO::poll_cb); |
41 | cb => \&IO::AIO::poll_cb); |
… | |
… | |
61 | etc.), but can also be used to easily do operations in parallel that are |
65 | etc.), but can also be used to easily do operations in parallel that are |
62 | normally done sequentially, e.g. stat'ing many files, which is much faster |
66 | normally done sequentially, e.g. stat'ing many files, which is much faster |
63 | on a RAID volume or over NFS when you do a number of stat operations |
67 | on a RAID volume or over NFS when you do a number of stat operations |
64 | concurrently. |
68 | concurrently. |
65 | |
69 | |
66 | While most of this works on all types of file descriptors (for example |
70 | While most of this works on all types of file descriptors (for |
67 | sockets), using these functions on file descriptors that support |
71 | example sockets), using these functions on file descriptors that |
68 | nonblocking operation (again, sockets, pipes etc.) is very inefficient or |
72 | support nonblocking operation (again, sockets, pipes etc.) is very |
69 | might not work (aio_read fails on sockets/pipes/fifos). Use an event loop |
73 | inefficient. Use an event loop for that (such as the L<Event|Event> |
70 | for that (such as the L<Event|Event> module): IO::AIO will naturally fit |
74 | module): IO::AIO will naturally fit into such an event loop itself. |
71 | into such an event loop itself. |
|
|
72 | |
75 | |
73 | In this version, a number of threads are started that execute your |
76 | In this version, a number of threads are started that execute your |
74 | requests and signal their completion. You don't need thread support |
77 | requests and signal their completion. You don't need thread support |
75 | in perl, and the threads created by this module will not be visible |
78 | in perl, and the threads created by this module will not be visible |
76 | to perl. In the future, this module might make use of the native aio |
79 | to perl. In the future, this module might make use of the native aio |
… | |
… | |
78 | not well-supported or restricted (GNU/Linux doesn't allow them on normal |
81 | not well-supported or restricted (GNU/Linux doesn't allow them on normal |
79 | files currently, for example), and they would only support aio_read and |
82 | files currently, for example), and they would only support aio_read and |
80 | aio_write, so the remaining functionality would have to be implemented |
83 | aio_write, so the remaining functionality would have to be implemented |
81 | using threads anyway. |
84 | using threads anyway. |
82 | |
85 | |
83 | Although the module will work with in the presence of other (Perl-) |
86 | Although the module will work in the presence of other (Perl-) threads, |
84 | threads, it is currently not reentrant in any way, so use appropriate |
87 | it is currently not reentrant in any way, so use appropriate locking |
85 | locking yourself, always call C<poll_cb> from within the same thread, or |
88 | yourself, always call C<poll_cb> from within the same thread, or never |
86 | never call C<poll_cb> (or other C<aio_> functions) recursively. |
89 | call C<poll_cb> (or other C<aio_> functions) recursively. |
87 | |
90 | |
88 | =head2 EXAMPLE |
91 | =head2 EXAMPLE |
89 | |
92 | |
90 | This is a simple example that uses the Event module and loads |
93 | This is a simple example that uses the Event module and loads |
91 | F</etc/passwd> asynchronously: |
94 | F</etc/passwd> asynchronously: |
… | |
… | |
99 | poll => 'r', |
102 | poll => 'r', |
100 | cb => \&IO::AIO::poll_cb); |
103 | cb => \&IO::AIO::poll_cb); |
101 | |
104 | |
102 | # queue the request to open /etc/passwd |
105 | # queue the request to open /etc/passwd |
103 | aio_open "/etc/passwd", O_RDONLY, 0, sub { |
106 | aio_open "/etc/passwd", O_RDONLY, 0, sub { |
104 | my $fh = $_[0] |
107 | my $fh = shift |
105 | or die "error while opening: $!"; |
108 | or die "error while opening: $!"; |
106 | |
109 | |
107 | # stat'ing filehandles is generally non-blocking |
110 | # stat'ing filehandles is generally non-blocking |
108 | my $size = -s $fh; |
111 | my $size = -s $fh; |
109 | |
112 | |
… | |
… | |
183 | |
186 | |
184 | =cut |
187 | =cut |
185 | |
188 | |
186 | package IO::AIO; |
189 | package IO::AIO; |
187 | |
190 | |
|
|
191 | use Carp (); |
|
|
192 | |
188 | no warnings; |
193 | no warnings; |
189 | use strict 'vars'; |
194 | use strict 'vars'; |
190 | |
195 | |
191 | use base 'Exporter'; |
196 | use base 'Exporter'; |
192 | |
197 | |
193 | BEGIN { |
198 | BEGIN { |
194 | our $VERSION = '2.2'; |
199 | our $VERSION = '2.6'; |
195 | |
200 | |
196 | our @AIO_REQ = 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 aio_stat |
197 | aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink |
202 | aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink |
198 | aio_readlink aio_fsync aio_fdatasync aio_readahead aio_rename aio_link |
203 | aio_readlink aio_sync aio_fsync aio_fdatasync aio_readahead aio_rename aio_link |
199 | aio_move aio_copy aio_group aio_nop aio_mknod); |
204 | aio_move aio_copy aio_group aio_nop aio_mknod aio_load aio_rmtree aio_mkdir |
|
|
205 | aio_chown aio_chmod aio_utime aio_truncate); |
200 | our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice)); |
206 | our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice aio_block)); |
201 | our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush |
207 | our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush |
202 | min_parallel max_parallel max_idle |
208 | min_parallel max_parallel max_idle |
203 | nreqs nready npending nthreads |
209 | nreqs nready npending nthreads |
204 | max_poll_time max_poll_reqs); |
210 | max_poll_time max_poll_reqs); |
205 | |
211 | |
… | |
… | |
270 | aio_read $_[0], ..., sub { |
276 | aio_read $_[0], ..., sub { |
271 | ... |
277 | ... |
272 | }; |
278 | }; |
273 | }; |
279 | }; |
274 | |
280 | |
|
|
281 | |
275 | =item aioreq_nice $pri_adjust |
282 | =item aioreq_nice $pri_adjust |
276 | |
283 | |
277 | Similar to C<aioreq_pri>, but subtracts the given value from the current |
284 | Similar to C<aioreq_pri>, but subtracts the given value from the current |
278 | priority, so the effect is cumulative. |
285 | priority, so the effect is cumulative. |
|
|
286 | |
279 | |
287 | |
280 | =item aio_open $pathname, $flags, $mode, $callback->($fh) |
288 | =item aio_open $pathname, $flags, $mode, $callback->($fh) |
281 | |
289 | |
282 | Asynchronously open or create a file and call the callback with a newly |
290 | Asynchronously open or create a file and call the callback with a newly |
283 | created filehandle for the file. |
291 | created filehandle for the file. |
… | |
… | |
289 | list. They are the same as used by C<sysopen>. |
297 | list. They are the same as used by C<sysopen>. |
290 | |
298 | |
291 | Likewise, C<$mode> specifies the mode of the newly created file, if it |
299 | Likewise, C<$mode> specifies the mode of the newly created file, if it |
292 | didn't exist and C<O_CREAT> has been given, just like perl's C<sysopen>, |
300 | didn't exist and C<O_CREAT> has been given, just like perl's C<sysopen>, |
293 | except that it is mandatory (i.e. use C<0> if you don't create new files, |
301 | except that it is mandatory (i.e. use C<0> if you don't create new files, |
294 | and C<0666> or C<0777> if you do). |
302 | and C<0666> or C<0777> if you do). Note that the C<$mode> will be modified |
|
|
303 | by the umask in effect then the request is being executed, so better never |
|
|
304 | change the umask. |
295 | |
305 | |
296 | Example: |
306 | Example: |
297 | |
307 | |
298 | aio_open "/etc/passwd", O_RDONLY, 0, sub { |
308 | aio_open "/etc/passwd", O_RDONLY, 0, sub { |
299 | if ($_[0]) { |
309 | if ($_[0]) { |
… | |
… | |
302 | } else { |
312 | } else { |
303 | die "open failed: $!\n"; |
313 | die "open failed: $!\n"; |
304 | } |
314 | } |
305 | }; |
315 | }; |
306 | |
316 | |
|
|
317 | |
307 | =item aio_close $fh, $callback->($status) |
318 | =item aio_close $fh, $callback->($status) |
308 | |
319 | |
309 | Asynchronously close a file and call the callback with the result |
320 | Asynchronously close a file and call the callback with the result |
310 | code. I<WARNING:> although accepted, you should not pass in a perl |
321 | code. |
311 | filehandle here, as perl will likely close the file descriptor another |
|
|
312 | time when the filehandle is destroyed. Normally, you can safely call perls |
|
|
313 | C<close> or just let filehandles go out of scope. |
|
|
314 | |
322 | |
315 | This is supposed to be a bug in the API, so that might change. It's |
323 | Unfortunately, you can't do this to perl. Perl I<insists> very strongly on |
316 | therefore best to avoid this function. |
324 | closing the file descriptor associated with the filehandle itself. Here is |
|
|
325 | what aio_close will try: |
|
|
326 | |
|
|
327 | 1. dup()licate the fd |
|
|
328 | 2. asynchronously close() the duplicated fd |
|
|
329 | 3. dup()licate the fd once more |
|
|
330 | 4. let perl close() the filehandle |
|
|
331 | 5. asynchronously close the duplicated fd |
|
|
332 | |
|
|
333 | The idea is that the first close() flushes stuff to disk that closing an |
|
|
334 | fd will flush, so when perl closes the fd, nothing much will need to be |
|
|
335 | flushed. The second async. close() will then flush stuff to disk that |
|
|
336 | closing the last fd to the file will flush. |
|
|
337 | |
|
|
338 | Just FYI, SuSv3 has this to say on close: |
|
|
339 | |
|
|
340 | All outstanding record locks owned by the process on the file |
|
|
341 | associated with the file descriptor shall be removed. |
|
|
342 | |
|
|
343 | If fildes refers to a socket, close() shall cause the socket to be |
|
|
344 | destroyed. ... close() shall block for up to the current linger |
|
|
345 | interval until all data is transmitted. |
|
|
346 | [this actually sounds like a specification bug, but who knows] |
|
|
347 | |
|
|
348 | And at least Linux additionally actually flushes stuff on every close, |
|
|
349 | even when the file itself is still open. |
|
|
350 | |
|
|
351 | Sounds enourmously inefficient and complicated? Yes... please show me how |
|
|
352 | to nuke perl's fd out of existence... |
|
|
353 | |
|
|
354 | =cut |
|
|
355 | |
|
|
356 | sub aio_close($;$) { |
|
|
357 | aio_block { |
|
|
358 | my ($fh, $cb) = @_; |
|
|
359 | |
|
|
360 | my $pri = aioreq_pri; |
|
|
361 | my $grp = aio_group $cb; |
|
|
362 | |
|
|
363 | my $fd = fileno $fh; |
|
|
364 | |
|
|
365 | defined $fd or Carp::croak "aio_close called with fd-less filehandle"; |
|
|
366 | |
|
|
367 | # if the dups fail we will simply get EBADF |
|
|
368 | my $fd2 = _dup $fd; |
|
|
369 | aioreq_pri $pri; |
|
|
370 | add $grp _aio_close $fd2, sub { |
|
|
371 | my $fd2 = _dup $fd; |
|
|
372 | close $fh; |
|
|
373 | aioreq_pri $pri; |
|
|
374 | add $grp _aio_close $fd2, sub { |
|
|
375 | $grp->result ($_[0]); |
|
|
376 | }; |
|
|
377 | }; |
|
|
378 | |
|
|
379 | $grp |
|
|
380 | } |
|
|
381 | } |
|
|
382 | |
317 | |
383 | |
318 | =item aio_read $fh,$offset,$length, $data,$dataoffset, $callback->($retval) |
384 | =item aio_read $fh,$offset,$length, $data,$dataoffset, $callback->($retval) |
319 | |
385 | |
320 | =item aio_write $fh,$offset,$length, $data,$dataoffset, $callback->($retval) |
386 | =item aio_write $fh,$offset,$length, $data,$dataoffset, $callback->($retval) |
321 | |
387 | |
322 | Reads or writes C<length> bytes from the specified C<fh> and C<offset> |
388 | Reads or writes C<$length> bytes from the specified C<$fh> and C<$offset> |
323 | into the scalar given by C<data> and offset C<dataoffset> and calls the |
389 | into the scalar given by C<$data> and offset C<$dataoffset> and calls the |
324 | callback without the actual number of bytes read (or -1 on error, just |
390 | callback without the actual number of bytes read (or -1 on error, just |
325 | like the syscall). |
391 | like the syscall). |
326 | |
392 | |
|
|
393 | If C<$offset> is undefined, then the current file descriptor offset will |
|
|
394 | be used (and updated), otherwise the file descriptor offset will not be |
|
|
395 | changed by these calls. |
|
|
396 | |
|
|
397 | If C<$length> is undefined in C<aio_write>, use the remaining length of C<$data>. |
|
|
398 | |
|
|
399 | If C<$dataoffset> is less than zero, it will be counted from the end of |
|
|
400 | C<$data>. |
|
|
401 | |
327 | The C<$data> scalar I<MUST NOT> be modified in any way while the request |
402 | The C<$data> scalar I<MUST NOT> be modified in any way while the request |
328 | is outstanding. Modifying it can result in segfaults or WW3 (if the |
403 | is outstanding. Modifying it can result in segfaults or World War III (if |
329 | necessary/optional hardware is installed). |
404 | the necessary/optional hardware is installed). |
330 | |
405 | |
331 | Example: Read 15 bytes at offset 7 into scalar C<$buffer>, starting at |
406 | Example: Read 15 bytes at offset 7 into scalar C<$buffer>, starting at |
332 | offset C<0> within the scalar: |
407 | offset C<0> within the scalar: |
333 | |
408 | |
334 | aio_read $fh, 7, 15, $buffer, 0, sub { |
409 | aio_read $fh, 7, 15, $buffer, 0, sub { |
335 | $_[0] > 0 or die "read error: $!"; |
410 | $_[0] > 0 or die "read error: $!"; |
336 | print "read $_[0] bytes: <$buffer>\n"; |
411 | print "read $_[0] bytes: <$buffer>\n"; |
337 | }; |
412 | }; |
|
|
413 | |
338 | |
414 | |
339 | =item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval) |
415 | =item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval) |
340 | |
416 | |
341 | Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts |
417 | Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts |
342 | reading at byte offset C<$in_offset>, and starts writing at the current |
418 | reading at byte offset C<$in_offset>, and starts writing at the current |
… | |
… | |
356 | C<$in_fh> than are written, and there is no way to find out how many |
432 | C<$in_fh> than are written, and there is no way to find out how many |
357 | bytes have been read from C<aio_sendfile> alone, as C<aio_sendfile> only |
433 | bytes have been read from C<aio_sendfile> alone, as C<aio_sendfile> only |
358 | provides the number of bytes written to C<$out_fh>. Only if the result |
434 | provides the number of bytes written to C<$out_fh>. Only if the result |
359 | value equals C<$length> one can assume that C<$length> bytes have been |
435 | value equals C<$length> one can assume that C<$length> bytes have been |
360 | read. |
436 | read. |
|
|
437 | |
361 | |
438 | |
362 | =item aio_readahead $fh,$offset,$length, $callback->($retval) |
439 | =item aio_readahead $fh,$offset,$length, $callback->($retval) |
363 | |
440 | |
364 | C<aio_readahead> populates the page cache with data from a file so that |
441 | C<aio_readahead> populates the page cache with data from a file so that |
365 | subsequent reads from that file will not block on disk I/O. The C<$offset> |
442 | subsequent reads from that file will not block on disk I/O. The C<$offset> |
… | |
… | |
371 | file. The current file offset of the file is left unchanged. |
448 | file. The current file offset of the file is left unchanged. |
372 | |
449 | |
373 | If that syscall doesn't exist (likely if your OS isn't Linux) it will be |
450 | If that syscall doesn't exist (likely if your OS isn't Linux) it will be |
374 | emulated by simply reading the data, which would have a similar effect. |
451 | emulated by simply reading the data, which would have a similar effect. |
375 | |
452 | |
|
|
453 | |
376 | =item aio_stat $fh_or_path, $callback->($status) |
454 | =item aio_stat $fh_or_path, $callback->($status) |
377 | |
455 | |
378 | =item aio_lstat $fh, $callback->($status) |
456 | =item aio_lstat $fh, $callback->($status) |
379 | |
457 | |
380 | Works like perl's C<stat> or C<lstat> in void context. The callback will |
458 | Works like perl's C<stat> or C<lstat> in void context. The callback will |
… | |
… | |
393 | aio_stat "/etc/passwd", sub { |
471 | aio_stat "/etc/passwd", sub { |
394 | $_[0] and die "stat failed: $!"; |
472 | $_[0] and die "stat failed: $!"; |
395 | print "size is ", -s _, "\n"; |
473 | print "size is ", -s _, "\n"; |
396 | }; |
474 | }; |
397 | |
475 | |
|
|
476 | |
|
|
477 | =item aio_utime $fh_or_path, $atime, $mtime, $callback->($status) |
|
|
478 | |
|
|
479 | Works like perl's C<utime> function (including the special case of $atime |
|
|
480 | and $mtime being undef). Fractional times are supported if the underlying |
|
|
481 | syscalls support them. |
|
|
482 | |
|
|
483 | When called with a pathname, uses utimes(2) if available, otherwise |
|
|
484 | utime(2). If called on a file descriptor, uses futimes(2) if available, |
|
|
485 | otherwise returns ENOSYS, so this is not portable. |
|
|
486 | |
|
|
487 | Examples: |
|
|
488 | |
|
|
489 | # set atime and mtime to current time (basically touch(1)): |
|
|
490 | aio_utime "path", undef, undef; |
|
|
491 | # set atime to current time and mtime to beginning of the epoch: |
|
|
492 | aio_utime "path", time, undef; # undef==0 |
|
|
493 | |
|
|
494 | |
|
|
495 | =item aio_chown $fh_or_path, $uid, $gid, $callback->($status) |
|
|
496 | |
|
|
497 | Works like perl's C<chown> function, except that C<undef> for either $uid |
|
|
498 | or $gid is being interpreted as "do not change" (but -1 can also be used). |
|
|
499 | |
|
|
500 | Examples: |
|
|
501 | |
|
|
502 | # same as "chown root path" in the shell: |
|
|
503 | aio_chown "path", 0, -1; |
|
|
504 | # same as above: |
|
|
505 | aio_chown "path", 0, undef; |
|
|
506 | |
|
|
507 | |
|
|
508 | =item aio_truncate $fh_or_path, $offset, $callback->($status) |
|
|
509 | |
|
|
510 | Works like truncate(2) or ftruncate(2). |
|
|
511 | |
|
|
512 | |
|
|
513 | =item aio_chmod $fh_or_path, $mode, $callback->($status) |
|
|
514 | |
|
|
515 | Works like perl's C<chmod> function. |
|
|
516 | |
|
|
517 | |
398 | =item aio_unlink $pathname, $callback->($status) |
518 | =item aio_unlink $pathname, $callback->($status) |
399 | |
519 | |
400 | Asynchronously unlink (delete) a file and call the callback with the |
520 | Asynchronously unlink (delete) a file and call the callback with the |
401 | result code. |
521 | result code. |
402 | |
522 | |
|
|
523 | |
403 | =item aio_mknod $path, $mode, $dev, $callback->($status) |
524 | =item aio_mknod $path, $mode, $dev, $callback->($status) |
404 | |
525 | |
405 | [EXPERIMENTAL] |
526 | [EXPERIMENTAL] |
406 | |
527 | |
407 | Asynchronously create a device node (or fifo). See mknod(2). |
528 | Asynchronously create a device node (or fifo). See mknod(2). |
408 | |
529 | |
409 | The only (POSIX-) portable way of calling this function is: |
530 | The only (POSIX-) portable way of calling this function is: |
410 | |
531 | |
411 | aio_mknod $path, IO::AIO::S_IFIFO | $mode, 0, sub { ... |
532 | aio_mknod $path, IO::AIO::S_IFIFO | $mode, 0, sub { ... |
|
|
533 | |
412 | |
534 | |
413 | =item aio_link $srcpath, $dstpath, $callback->($status) |
535 | =item aio_link $srcpath, $dstpath, $callback->($status) |
414 | |
536 | |
415 | Asynchronously create a new link to the existing object at C<$srcpath> at |
537 | Asynchronously create a new link to the existing object at C<$srcpath> at |
416 | the path C<$dstpath> and call the callback with the result code. |
538 | the path C<$dstpath> and call the callback with the result code. |
417 | |
539 | |
|
|
540 | |
418 | =item aio_symlink $srcpath, $dstpath, $callback->($status) |
541 | =item aio_symlink $srcpath, $dstpath, $callback->($status) |
419 | |
542 | |
420 | Asynchronously create a new symbolic link to the existing object at C<$srcpath> at |
543 | Asynchronously create a new symbolic link to the existing object at C<$srcpath> at |
421 | the path C<$dstpath> and call the callback with the result code. |
544 | the path C<$dstpath> and call the callback with the result code. |
|
|
545 | |
422 | |
546 | |
423 | =item aio_readlink $path, $callback->($link) |
547 | =item aio_readlink $path, $callback->($link) |
424 | |
548 | |
425 | Asynchronously read the symlink specified by C<$path> and pass it to |
549 | Asynchronously read the symlink specified by C<$path> and pass it to |
426 | the callback. If an error occurs, nothing or undef gets passed to the |
550 | the callback. If an error occurs, nothing or undef gets passed to the |
427 | callback. |
551 | callback. |
428 | |
552 | |
|
|
553 | |
429 | =item aio_rename $srcpath, $dstpath, $callback->($status) |
554 | =item aio_rename $srcpath, $dstpath, $callback->($status) |
430 | |
555 | |
431 | Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as |
556 | Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as |
432 | rename(2) and call the callback with the result code. |
557 | rename(2) and call the callback with the result code. |
433 | |
558 | |
|
|
559 | |
|
|
560 | =item aio_mkdir $pathname, $mode, $callback->($status) |
|
|
561 | |
|
|
562 | Asynchronously mkdir (create) a directory and call the callback with |
|
|
563 | the result code. C<$mode> will be modified by the umask at the time the |
|
|
564 | request is executed, so do not change your umask. |
|
|
565 | |
|
|
566 | |
434 | =item aio_rmdir $pathname, $callback->($status) |
567 | =item aio_rmdir $pathname, $callback->($status) |
435 | |
568 | |
436 | Asynchronously rmdir (delete) a directory and call the callback with the |
569 | Asynchronously rmdir (delete) a directory and call the callback with the |
437 | result code. |
570 | result code. |
|
|
571 | |
438 | |
572 | |
439 | =item aio_readdir $pathname, $callback->($entries) |
573 | =item aio_readdir $pathname, $callback->($entries) |
440 | |
574 | |
441 | Unlike the POSIX call of the same name, C<aio_readdir> reads an entire |
575 | Unlike the POSIX call of the same name, C<aio_readdir> reads an entire |
442 | directory (i.e. opendir + readdir + closedir). The entries will not be |
576 | directory (i.e. opendir + readdir + closedir). The entries will not be |
443 | sorted, and will B<NOT> include the C<.> and C<..> entries. |
577 | sorted, and will B<NOT> include the C<.> and C<..> entries. |
444 | |
578 | |
445 | The callback a single argument which is either C<undef> or an array-ref |
579 | The callback a single argument which is either C<undef> or an array-ref |
446 | with the filenames. |
580 | with the filenames. |
|
|
581 | |
|
|
582 | |
|
|
583 | =item aio_load $path, $data, $callback->($status) |
|
|
584 | |
|
|
585 | This is a composite request that tries to fully load the given file into |
|
|
586 | memory. Status is the same as with aio_read. |
|
|
587 | |
|
|
588 | =cut |
|
|
589 | |
|
|
590 | sub aio_load($$;$) { |
|
|
591 | aio_block { |
|
|
592 | my ($path, undef, $cb) = @_; |
|
|
593 | my $data = \$_[1]; |
|
|
594 | |
|
|
595 | my $pri = aioreq_pri; |
|
|
596 | my $grp = aio_group $cb; |
|
|
597 | |
|
|
598 | aioreq_pri $pri; |
|
|
599 | add $grp aio_open $path, O_RDONLY, 0, sub { |
|
|
600 | my $fh = shift |
|
|
601 | or return $grp->result (-1); |
|
|
602 | |
|
|
603 | aioreq_pri $pri; |
|
|
604 | add $grp aio_read $fh, 0, (-s $fh), $$data, 0, sub { |
|
|
605 | $grp->result ($_[0]); |
|
|
606 | }; |
|
|
607 | }; |
|
|
608 | |
|
|
609 | $grp |
|
|
610 | } |
|
|
611 | } |
447 | |
612 | |
448 | =item aio_copy $srcpath, $dstpath, $callback->($status) |
613 | =item aio_copy $srcpath, $dstpath, $callback->($status) |
449 | |
614 | |
450 | Try to copy the I<file> (directories not supported as either source or |
615 | Try to copy the I<file> (directories not supported as either source or |
451 | destination) from C<$srcpath> to C<$dstpath> and call the callback with |
616 | destination) from C<$srcpath> to C<$dstpath> and call the callback with |
… | |
… | |
461 | errors are being ignored. |
626 | errors are being ignored. |
462 | |
627 | |
463 | =cut |
628 | =cut |
464 | |
629 | |
465 | sub aio_copy($$;$) { |
630 | sub aio_copy($$;$) { |
|
|
631 | aio_block { |
466 | my ($src, $dst, $cb) = @_; |
632 | my ($src, $dst, $cb) = @_; |
467 | |
633 | |
468 | my $pri = aioreq_pri; |
634 | my $pri = aioreq_pri; |
469 | my $grp = aio_group $cb; |
635 | my $grp = aio_group $cb; |
470 | |
636 | |
471 | aioreq_pri $pri; |
637 | aioreq_pri $pri; |
472 | add $grp aio_open $src, O_RDONLY, 0, sub { |
638 | add $grp aio_open $src, O_RDONLY, 0, sub { |
473 | if (my $src_fh = $_[0]) { |
639 | if (my $src_fh = $_[0]) { |
474 | my @stat = stat $src_fh; |
640 | my @stat = stat $src_fh; |
475 | |
641 | |
476 | aioreq_pri $pri; |
642 | aioreq_pri $pri; |
477 | add $grp aio_open $dst, O_CREAT | O_WRONLY | O_TRUNC, 0200, sub { |
643 | add $grp aio_open $dst, O_CREAT | O_WRONLY | O_TRUNC, 0200, sub { |
478 | if (my $dst_fh = $_[0]) { |
644 | if (my $dst_fh = $_[0]) { |
479 | aioreq_pri $pri; |
645 | aioreq_pri $pri; |
480 | add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub { |
646 | add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub { |
481 | if ($_[0] == $stat[7]) { |
647 | if ($_[0] == $stat[7]) { |
482 | $grp->result (0); |
648 | $grp->result (0); |
483 | close $src_fh; |
649 | close $src_fh; |
484 | |
650 | |
485 | # those should not normally block. should. should. |
651 | # those should not normally block. should. should. |
486 | utime $stat[8], $stat[9], $dst; |
652 | utime $stat[8], $stat[9], $dst; |
487 | chmod $stat[2] & 07777, $dst_fh; |
653 | chmod $stat[2] & 07777, $dst_fh; |
488 | chown $stat[4], $stat[5], $dst_fh; |
654 | chown $stat[4], $stat[5], $dst_fh; |
489 | close $dst_fh; |
655 | close $dst_fh; |
490 | } else { |
656 | } else { |
491 | $grp->result (-1); |
657 | $grp->result (-1); |
492 | close $src_fh; |
658 | close $src_fh; |
493 | close $dst_fh; |
659 | close $dst_fh; |
494 | |
660 | |
495 | aioreq $pri; |
661 | aioreq $pri; |
496 | add $grp aio_unlink $dst; |
662 | add $grp aio_unlink $dst; |
|
|
663 | } |
497 | } |
664 | }; |
|
|
665 | } else { |
|
|
666 | $grp->result (-1); |
498 | }; |
667 | } |
499 | } else { |
|
|
500 | $grp->result (-1); |
|
|
501 | } |
668 | }, |
|
|
669 | |
|
|
670 | } else { |
|
|
671 | $grp->result (-1); |
502 | }, |
672 | } |
503 | |
|
|
504 | } else { |
|
|
505 | $grp->result (-1); |
|
|
506 | } |
673 | }; |
|
|
674 | |
|
|
675 | $grp |
507 | }; |
676 | } |
508 | |
|
|
509 | $grp |
|
|
510 | } |
677 | } |
511 | |
678 | |
512 | =item aio_move $srcpath, $dstpath, $callback->($status) |
679 | =item aio_move $srcpath, $dstpath, $callback->($status) |
513 | |
680 | |
514 | Try to move the I<file> (directories not supported as either source or |
681 | Try to move the I<file> (directories not supported as either source or |
… | |
… | |
520 | that is successful, unlinking the C<$srcpath>. |
687 | that is successful, unlinking the C<$srcpath>. |
521 | |
688 | |
522 | =cut |
689 | =cut |
523 | |
690 | |
524 | sub aio_move($$;$) { |
691 | sub aio_move($$;$) { |
|
|
692 | aio_block { |
525 | my ($src, $dst, $cb) = @_; |
693 | my ($src, $dst, $cb) = @_; |
526 | |
694 | |
527 | my $pri = aioreq_pri; |
695 | my $pri = aioreq_pri; |
528 | my $grp = aio_group $cb; |
696 | my $grp = aio_group $cb; |
529 | |
697 | |
530 | aioreq_pri $pri; |
698 | aioreq_pri $pri; |
531 | add $grp aio_rename $src, $dst, sub { |
699 | add $grp aio_rename $src, $dst, sub { |
532 | if ($_[0] && $! == EXDEV) { |
700 | if ($_[0] && $! == EXDEV) { |
533 | aioreq_pri $pri; |
701 | aioreq_pri $pri; |
534 | add $grp aio_copy $src, $dst, sub { |
702 | add $grp aio_copy $src, $dst, sub { |
|
|
703 | $grp->result ($_[0]); |
|
|
704 | |
|
|
705 | if (!$_[0]) { |
|
|
706 | aioreq_pri $pri; |
|
|
707 | add $grp aio_unlink $src; |
|
|
708 | } |
|
|
709 | }; |
|
|
710 | } else { |
535 | $grp->result ($_[0]); |
711 | $grp->result ($_[0]); |
536 | |
|
|
537 | if (!$_[0]) { |
|
|
538 | aioreq_pri $pri; |
|
|
539 | add $grp aio_unlink $src; |
|
|
540 | } |
|
|
541 | }; |
712 | } |
542 | } else { |
|
|
543 | $grp->result ($_[0]); |
|
|
544 | } |
713 | }; |
|
|
714 | |
|
|
715 | $grp |
545 | }; |
716 | } |
546 | |
|
|
547 | $grp |
|
|
548 | } |
717 | } |
549 | |
718 | |
550 | =item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) |
719 | =item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) |
551 | |
720 | |
552 | Scans a directory (similar to C<aio_readdir>) but additionally tries to |
721 | Scans a directory (similar to C<aio_readdir>) but additionally tries to |
… | |
… | |
599 | as those tend to return 0 or 1 as link counts, which disables the |
768 | as those tend to return 0 or 1 as link counts, which disables the |
600 | directory counting heuristic. |
769 | directory counting heuristic. |
601 | |
770 | |
602 | =cut |
771 | =cut |
603 | |
772 | |
604 | sub aio_scandir($$$) { |
773 | sub aio_scandir($$;$) { |
|
|
774 | aio_block { |
605 | my ($path, $maxreq, $cb) = @_; |
775 | my ($path, $maxreq, $cb) = @_; |
606 | |
776 | |
607 | my $pri = aioreq_pri; |
777 | my $pri = aioreq_pri; |
608 | |
778 | |
609 | my $grp = aio_group $cb; |
779 | my $grp = aio_group $cb; |
610 | |
780 | |
611 | $maxreq = 4 if $maxreq <= 0; |
781 | $maxreq = 4 if $maxreq <= 0; |
612 | |
782 | |
613 | # stat once |
783 | # stat once |
614 | aioreq_pri $pri; |
|
|
615 | add $grp aio_stat $path, sub { |
|
|
616 | return $grp->result () if $_[0]; |
|
|
617 | my $now = time; |
|
|
618 | my $hash1 = join ":", (stat _)[0,1,3,7,9]; |
|
|
619 | |
|
|
620 | # read the directory entries |
|
|
621 | aioreq_pri $pri; |
784 | aioreq_pri $pri; |
622 | add $grp aio_readdir $path, sub { |
785 | add $grp aio_stat $path, sub { |
623 | my $entries = shift |
|
|
624 | or return $grp->result (); |
786 | return $grp->result () if $_[0]; |
|
|
787 | my $now = time; |
|
|
788 | my $hash1 = join ":", (stat _)[0,1,3,7,9]; |
625 | |
789 | |
626 | # stat the dir another time |
790 | # read the directory entries |
627 | aioreq_pri $pri; |
791 | aioreq_pri $pri; |
|
|
792 | add $grp aio_readdir $path, sub { |
|
|
793 | my $entries = shift |
|
|
794 | or return $grp->result (); |
|
|
795 | |
|
|
796 | # stat the dir another time |
|
|
797 | aioreq_pri $pri; |
628 | add $grp aio_stat $path, sub { |
798 | add $grp aio_stat $path, sub { |
629 | my $hash2 = join ":", (stat _)[0,1,3,7,9]; |
799 | my $hash2 = join ":", (stat _)[0,1,3,7,9]; |
630 | |
800 | |
631 | my $ndirs; |
801 | my $ndirs; |
632 | |
802 | |
633 | # take the slow route if anything looks fishy |
803 | # take the slow route if anything looks fishy |
634 | if ($hash1 ne $hash2 or (stat _)[9] == $now) { |
804 | if ($hash1 ne $hash2 or (stat _)[9] == $now) { |
635 | $ndirs = -1; |
805 | $ndirs = -1; |
636 | } else { |
806 | } else { |
637 | # if nlink == 2, we are finished |
807 | # if nlink == 2, we are finished |
638 | # on non-posix-fs's, we rely on nlink < 2 |
808 | # on non-posix-fs's, we rely on nlink < 2 |
639 | $ndirs = (stat _)[3] - 2 |
809 | $ndirs = (stat _)[3] - 2 |
640 | or return $grp->result ([], $entries); |
810 | or return $grp->result ([], $entries); |
641 | } |
811 | } |
642 | |
812 | |
643 | # sort into likely dirs and likely nondirs |
813 | # sort into likely dirs and likely nondirs |
644 | # dirs == files without ".", short entries first |
814 | # dirs == files without ".", short entries first |
645 | $entries = [map $_->[0], |
815 | $entries = [map $_->[0], |
646 | sort { $b->[1] cmp $a->[1] } |
816 | sort { $b->[1] cmp $a->[1] } |
647 | map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length], |
817 | map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length], |
648 | @$entries]; |
818 | @$entries]; |
649 | |
819 | |
650 | my (@dirs, @nondirs); |
820 | my (@dirs, @nondirs); |
651 | |
821 | |
652 | my $statgrp = add $grp aio_group sub { |
822 | my $statgrp = add $grp aio_group sub { |
653 | $grp->result (\@dirs, \@nondirs); |
823 | $grp->result (\@dirs, \@nondirs); |
654 | }; |
824 | }; |
655 | |
825 | |
656 | limit $statgrp $maxreq; |
826 | limit $statgrp $maxreq; |
657 | feed $statgrp sub { |
827 | feed $statgrp sub { |
658 | return unless @$entries; |
828 | return unless @$entries; |
659 | my $entry = pop @$entries; |
829 | my $entry = pop @$entries; |
660 | |
830 | |
661 | aioreq_pri $pri; |
831 | aioreq_pri $pri; |
662 | add $statgrp aio_stat "$path/$entry/.", sub { |
832 | add $statgrp aio_stat "$path/$entry/.", sub { |
663 | if ($_[0] < 0) { |
833 | if ($_[0] < 0) { |
664 | push @nondirs, $entry; |
834 | push @nondirs, $entry; |
665 | } else { |
835 | } else { |
666 | # need to check for real directory |
836 | # need to check for real directory |
667 | aioreq_pri $pri; |
837 | aioreq_pri $pri; |
668 | add $statgrp aio_lstat "$path/$entry", sub { |
838 | add $statgrp aio_lstat "$path/$entry", sub { |
669 | if (-d _) { |
839 | if (-d _) { |
670 | push @dirs, $entry; |
840 | push @dirs, $entry; |
671 | |
841 | |
672 | unless (--$ndirs) { |
842 | unless (--$ndirs) { |
673 | push @nondirs, @$entries; |
843 | push @nondirs, @$entries; |
674 | feed $statgrp; |
844 | feed $statgrp; |
|
|
845 | } |
|
|
846 | } else { |
|
|
847 | push @nondirs, $entry; |
675 | } |
848 | } |
676 | } else { |
|
|
677 | push @nondirs, $entry; |
|
|
678 | } |
849 | } |
679 | } |
850 | } |
680 | } |
851 | }; |
681 | }; |
852 | }; |
682 | }; |
853 | }; |
683 | }; |
854 | }; |
684 | }; |
855 | }; |
|
|
856 | |
|
|
857 | $grp |
685 | }; |
858 | } |
686 | |
|
|
687 | $grp |
|
|
688 | } |
859 | } |
|
|
860 | |
|
|
861 | =item aio_rmtree $path, $callback->($status) |
|
|
862 | |
|
|
863 | Delete a directory tree starting (and including) C<$path>, return the |
|
|
864 | status of the final C<rmdir> only. This is a composite request that |
|
|
865 | uses C<aio_scandir> to recurse into and rmdir directories, and unlink |
|
|
866 | everything else. |
|
|
867 | |
|
|
868 | =cut |
|
|
869 | |
|
|
870 | sub aio_rmtree; |
|
|
871 | sub aio_rmtree($;$) { |
|
|
872 | aio_block { |
|
|
873 | my ($path, $cb) = @_; |
|
|
874 | |
|
|
875 | my $pri = aioreq_pri; |
|
|
876 | my $grp = aio_group $cb; |
|
|
877 | |
|
|
878 | aioreq_pri $pri; |
|
|
879 | add $grp aio_scandir $path, 0, sub { |
|
|
880 | my ($dirs, $nondirs) = @_; |
|
|
881 | |
|
|
882 | my $dirgrp = aio_group sub { |
|
|
883 | add $grp aio_rmdir $path, sub { |
|
|
884 | $grp->result ($_[0]); |
|
|
885 | }; |
|
|
886 | }; |
|
|
887 | |
|
|
888 | (aioreq_pri $pri), add $dirgrp aio_rmtree "$path/$_" for @$dirs; |
|
|
889 | (aioreq_pri $pri), add $dirgrp aio_unlink "$path/$_" for @$nondirs; |
|
|
890 | |
|
|
891 | add $grp $dirgrp; |
|
|
892 | }; |
|
|
893 | |
|
|
894 | $grp |
|
|
895 | } |
|
|
896 | } |
|
|
897 | |
|
|
898 | =item aio_sync $callback->($status) |
|
|
899 | |
|
|
900 | Asynchronously call sync and call the callback when finished. |
689 | |
901 | |
690 | =item aio_fsync $fh, $callback->($status) |
902 | =item aio_fsync $fh, $callback->($status) |
691 | |
903 | |
692 | Asynchronously call fsync on the given filehandle and call the callback |
904 | Asynchronously call fsync on the given filehandle and call the callback |
693 | with the fsync result code. |
905 | with the fsync result code. |
… | |
… | |
971 | poll => 'r', nice => 1, |
1183 | poll => 'r', nice => 1, |
972 | cb => &IO::AIO::poll_cb); |
1184 | cb => &IO::AIO::poll_cb); |
973 | |
1185 | |
974 | =item IO::AIO::poll_wait |
1186 | =item IO::AIO::poll_wait |
975 | |
1187 | |
|
|
1188 | If there are any outstanding requests and none of them in the result |
976 | Wait till the result filehandle becomes ready for reading (simply does a |
1189 | phase, wait till the result filehandle becomes ready for reading (simply |
977 | C<select> on the filehandle. This is useful if you want to synchronously |
1190 | does a C<select> on the filehandle. This is useful if you want to |
978 | wait for some requests to finish). |
1191 | synchronously wait for some requests to finish). |
979 | |
1192 | |
980 | See C<nreqs> for an example. |
1193 | See C<nreqs> for an example. |
981 | |
1194 | |
982 | =item IO::AIO::poll |
1195 | =item IO::AIO::poll |
983 | |
1196 | |
984 | Waits until some requests have been handled. |
1197 | Waits until some requests have been handled. |
985 | |
1198 | |
|
|
1199 | Returns the number of requests processed, but is otherwise strictly |
986 | Strictly equivalent to: |
1200 | equivalent to: |
987 | |
1201 | |
988 | IO::AIO::poll_wait, IO::AIO::poll_cb |
1202 | IO::AIO::poll_wait, IO::AIO::poll_cb |
989 | if IO::AIO::nreqs; |
|
|
990 | |
1203 | |
991 | =item IO::AIO::flush |
1204 | =item IO::AIO::flush |
992 | |
1205 | |
993 | Wait till all outstanding AIO requests have been handled. |
1206 | Wait till all outstanding AIO requests have been handled. |
994 | |
1207 | |
995 | Strictly equivalent to: |
1208 | Strictly equivalent to: |
996 | |
1209 | |
997 | IO::AIO::poll_wait, IO::AIO::poll_cb |
1210 | IO::AIO::poll_wait, IO::AIO::poll_cb |
998 | while IO::AIO::nreqs; |
1211 | while IO::AIO::nreqs; |
999 | |
1212 | |
|
|
1213 | =back |
|
|
1214 | |
1000 | =head3 CONTROLLING THE NUMBER OF THREADS |
1215 | =head3 CONTROLLING THE NUMBER OF THREADS |
|
|
1216 | |
|
|
1217 | =over |
1001 | |
1218 | |
1002 | =item IO::AIO::min_parallel $nthreads |
1219 | =item IO::AIO::min_parallel $nthreads |
1003 | |
1220 | |
1004 | Set the minimum number of AIO threads to C<$nthreads>. The current |
1221 | Set the minimum number of AIO threads to C<$nthreads>. The current |
1005 | default is C<8>, which means eight asynchronous operations can execute |
1222 | default is C<8>, which means eight asynchronous operations can execute |
… | |
… | |
1053 | This is a very bad function to use in interactive programs because it |
1270 | This is a very bad function to use in interactive programs because it |
1054 | blocks, and a bad way to reduce concurrency because it is inexact: Better |
1271 | blocks, and a bad way to reduce concurrency because it is inexact: Better |
1055 | use an C<aio_group> together with a feed callback. |
1272 | use an C<aio_group> together with a feed callback. |
1056 | |
1273 | |
1057 | Sets the maximum number of outstanding requests to C<$nreqs>. If you |
1274 | Sets the maximum number of outstanding requests to C<$nreqs>. If you |
1058 | to queue up more than this number of requests, the next call to the |
1275 | do queue up more than this number of requests, the next call to the |
1059 | C<poll_cb> (and C<poll_some> and other functions calling C<poll_cb>) |
1276 | C<poll_cb> (and C<poll_some> and other functions calling C<poll_cb>) |
1060 | function will block until the limit is no longer exceeded. |
1277 | function will block until the limit is no longer exceeded. |
1061 | |
1278 | |
1062 | The default value is very large, so there is no practical limit on the |
1279 | The default value is very large, so there is no practical limit on the |
1063 | number of outstanding requests. |
1280 | number of outstanding requests. |
1064 | |
1281 | |
1065 | You can still queue as many requests as you want. Therefore, |
1282 | You can still queue as many requests as you want. Therefore, |
1066 | C<max_oustsanding> is mainly useful in simple scripts (with low values) or |
1283 | C<max_oustsanding> is mainly useful in simple scripts (with low values) or |
1067 | as a stop gap to shield against fatal memory overflow (with large values). |
1284 | as a stop gap to shield against fatal memory overflow (with large values). |
1068 | |
1285 | |
|
|
1286 | =back |
|
|
1287 | |
1069 | =head3 STATISTICAL INFORMATION |
1288 | =head3 STATISTICAL INFORMATION |
|
|
1289 | |
|
|
1290 | =over |
1070 | |
1291 | |
1071 | =item IO::AIO::nreqs |
1292 | =item IO::AIO::nreqs |
1072 | |
1293 | |
1073 | Returns the number of requests currently in the ready, execute or pending |
1294 | Returns the number of requests currently in the ready, execute or pending |
1074 | states (i.e. for which their callback has not been invoked yet). |
1295 | states (i.e. for which their callback has not been invoked yet). |
… | |
… | |
1090 | |
1311 | |
1091 | =back |
1312 | =back |
1092 | |
1313 | |
1093 | =cut |
1314 | =cut |
1094 | |
1315 | |
1095 | # support function to convert a fd into a perl filehandle |
|
|
1096 | sub _fd2fh { |
|
|
1097 | return undef if $_[0] < 0; |
|
|
1098 | |
|
|
1099 | # try to generate nice filehandles |
|
|
1100 | my $sym = "IO::AIO::fd#$_[0]"; |
|
|
1101 | local *$sym; |
|
|
1102 | |
|
|
1103 | open *$sym, "+<&=$_[0]" # usually works under any unix |
|
|
1104 | or open *$sym, "<&=$_[0]" # cygwin needs this |
|
|
1105 | or open *$sym, ">&=$_[0]" # or this |
|
|
1106 | or return undef; |
|
|
1107 | |
|
|
1108 | *$sym |
|
|
1109 | } |
|
|
1110 | |
|
|
1111 | min_parallel 8; |
1316 | min_parallel 8; |
1112 | |
1317 | |
1113 | END { |
1318 | END { flush } |
1114 | min_parallel 1; |
|
|
1115 | flush; |
|
|
1116 | }; |
|
|
1117 | |
1319 | |
1118 | 1; |
1320 | 1; |
1119 | |
1321 | |
1120 | =head2 FORK BEHAVIOUR |
1322 | =head2 FORK BEHAVIOUR |
1121 | |
1323 | |
… | |
… | |
1141 | bytes of memory. In addition, stat requests need a stat buffer (possibly |
1343 | bytes of memory. In addition, stat requests need a stat buffer (possibly |
1142 | a few hundred bytes), readdir requires a result buffer and so on. Perl |
1344 | a few hundred bytes), readdir requires a result buffer and so on. Perl |
1143 | scalars and other data passed into aio requests will also be locked and |
1345 | scalars and other data passed into aio requests will also be locked and |
1144 | will consume memory till the request has entered the done state. |
1346 | will consume memory till the request has entered the done state. |
1145 | |
1347 | |
1146 | This is now awfully much, so queuing lots of requests is not usually a |
1348 | This is not awfully much, so queuing lots of requests is not usually a |
1147 | problem. |
1349 | problem. |
1148 | |
1350 | |
1149 | Per-thread usage: |
1351 | Per-thread usage: |
1150 | |
1352 | |
1151 | In the execution phase, some aio requests require more memory for |
1353 | In the execution phase, some aio requests require more memory for |