… | |
… | |
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 | |
… | |
… | |
50 | |
51 | |
51 | =head1 DESCRIPTION |
52 | =head1 DESCRIPTION |
52 | |
53 | |
53 | This module implements asynchronous I/O using whatever means your |
54 | This module implements asynchronous I/O using whatever means your |
54 | operating system supports. |
55 | operating system supports. |
|
|
56 | |
|
|
57 | Asynchronous means that operations that can normally block your program |
|
|
58 | (e.g. reading from disk) will be done asynchronously: the operation |
|
|
59 | will still block, but you can do something else in the meantime. This |
|
|
60 | is extremely useful for programs that need to stay interactive even |
|
|
61 | when doing heavy I/O (GUI programs, high performance network servers |
|
|
62 | etc.), but can also be used to easily do operations in parallel that are |
|
|
63 | normally done sequentially, e.g. stat'ing many files, which is much faster |
|
|
64 | on a RAID volume or over NFS when you do a number of stat operations |
|
|
65 | concurrently. |
|
|
66 | |
|
|
67 | While most of this works on all types of file descriptors (for |
|
|
68 | example sockets), using these functions on file descriptors that |
|
|
69 | support nonblocking operation (again, sockets, pipes etc.) is very |
|
|
70 | inefficient. Use an event loop for that (such as the L<Event|Event> |
|
|
71 | module): IO::AIO will naturally fit into such an event loop itself. |
55 | |
72 | |
56 | In this version, a number of threads are started that execute your |
73 | In this version, a number of threads are started that execute your |
57 | requests and signal their completion. You don't need thread support |
74 | requests and signal their completion. You don't need thread support |
58 | in perl, and the threads created by this module will not be visible |
75 | in perl, and the threads created by this module will not be visible |
59 | to perl. In the future, this module might make use of the native aio |
76 | to perl. In the future, this module might make use of the native aio |
60 | functions available on many operating systems. However, they are often |
77 | functions available on many operating systems. However, they are often |
61 | not well-supported or restricted (Linux doesn't allow them on normal |
78 | not well-supported or restricted (GNU/Linux doesn't allow them on normal |
62 | files currently, for example), and they would only support aio_read and |
79 | files currently, for example), and they would only support aio_read and |
63 | aio_write, so the remaining functionality would have to be implemented |
80 | aio_write, so the remaining functionality would have to be implemented |
64 | using threads anyway. |
81 | using threads anyway. |
65 | |
82 | |
66 | Although the module will work with in the presence of other (Perl-) |
83 | Although the module will work in the presence of other (Perl-) threads, |
67 | threads, it is currently not reentrant in any way, so use appropriate |
84 | it is currently not reentrant in any way, so use appropriate locking |
68 | locking yourself, always call C<poll_cb> from within the same thread, or |
85 | yourself, always call C<poll_cb> from within the same thread, or never |
69 | never call C<poll_cb> (or other C<aio_> functions) recursively. |
86 | call C<poll_cb> (or other C<aio_> functions) recursively. |
|
|
87 | |
|
|
88 | =head2 EXAMPLE |
|
|
89 | |
|
|
90 | This is a simple example that uses the Event module and loads |
|
|
91 | F</etc/passwd> asynchronously: |
|
|
92 | |
|
|
93 | use Fcntl; |
|
|
94 | use Event; |
|
|
95 | use IO::AIO; |
|
|
96 | |
|
|
97 | # register the IO::AIO callback with Event |
|
|
98 | Event->io (fd => IO::AIO::poll_fileno, |
|
|
99 | poll => 'r', |
|
|
100 | cb => \&IO::AIO::poll_cb); |
|
|
101 | |
|
|
102 | # queue the request to open /etc/passwd |
|
|
103 | aio_open "/etc/passwd", O_RDONLY, 0, sub { |
|
|
104 | my $fh = shift |
|
|
105 | or die "error while opening: $!"; |
|
|
106 | |
|
|
107 | # stat'ing filehandles is generally non-blocking |
|
|
108 | my $size = -s $fh; |
|
|
109 | |
|
|
110 | # queue a request to read the file |
|
|
111 | my $contents; |
|
|
112 | aio_read $fh, 0, $size, $contents, 0, sub { |
|
|
113 | $_[0] == $size |
|
|
114 | or die "short read: $!"; |
|
|
115 | |
|
|
116 | close $fh; |
|
|
117 | |
|
|
118 | # file contents now in $contents |
|
|
119 | print $contents; |
|
|
120 | |
|
|
121 | # exit event loop and program |
|
|
122 | Event::unloop; |
|
|
123 | }; |
|
|
124 | }; |
|
|
125 | |
|
|
126 | # possibly queue up other requests, or open GUI windows, |
|
|
127 | # check for sockets etc. etc. |
|
|
128 | |
|
|
129 | # process events as long as there are some: |
|
|
130 | Event::loop; |
70 | |
131 | |
71 | =head1 REQUEST ANATOMY AND LIFETIME |
132 | =head1 REQUEST ANATOMY AND LIFETIME |
72 | |
133 | |
73 | Every C<aio_*> function creates a request. which is a C data structure not |
134 | Every C<aio_*> function creates a request. which is a C data structure not |
74 | directly visible to Perl. |
135 | directly visible to Perl. |
… | |
… | |
116 | Request has reached the end of its lifetime and holds no resources anymore |
177 | Request has reached the end of its lifetime and holds no resources anymore |
117 | (except possibly for the Perl object, but its connection to the actual |
178 | (except possibly for the Perl object, but its connection to the actual |
118 | aio request is severed and calling its methods will either do nothing or |
179 | aio request is severed and calling its methods will either do nothing or |
119 | result in a runtime error). |
180 | result in a runtime error). |
120 | |
181 | |
|
|
182 | =back |
|
|
183 | |
121 | =cut |
184 | =cut |
122 | |
185 | |
123 | package IO::AIO; |
186 | package IO::AIO; |
124 | |
187 | |
125 | no warnings; |
188 | no warnings; |
126 | use strict 'vars'; |
189 | use strict 'vars'; |
127 | |
190 | |
128 | use base 'Exporter'; |
191 | use base 'Exporter'; |
129 | |
192 | |
130 | BEGIN { |
193 | BEGIN { |
131 | our $VERSION = '2.0'; |
194 | our $VERSION = '2.4'; |
132 | |
195 | |
133 | our @AIO_REQ = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat |
196 | our @AIO_REQ = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat |
134 | aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink |
197 | aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink |
135 | aio_fsync aio_fdatasync aio_readahead aio_rename aio_link aio_move |
198 | aio_readlink aio_fsync aio_fdatasync aio_readahead aio_rename aio_link |
136 | aio_group aio_nop); |
199 | aio_move aio_copy aio_group aio_nop aio_mknod aio_load aio_rmtree aio_mkdir |
|
|
200 | aio_chown aio_chmod aio_utime aio_truncate); |
137 | our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice)); |
201 | our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice aio_block)); |
138 | our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush |
202 | our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush |
139 | min_parallel max_parallel nreqs); |
203 | min_parallel max_parallel max_idle |
|
|
204 | nreqs nready npending nthreads |
|
|
205 | max_poll_time max_poll_reqs); |
140 | |
206 | |
141 | @IO::AIO::GRP::ISA = 'IO::AIO::REQ'; |
207 | @IO::AIO::GRP::ISA = 'IO::AIO::REQ'; |
142 | |
208 | |
143 | require XSLoader; |
209 | require XSLoader; |
144 | XSLoader::load ("IO::AIO", $VERSION); |
210 | XSLoader::load ("IO::AIO", $VERSION); |
145 | } |
211 | } |
146 | |
212 | |
147 | =head1 FUNCTIONS |
213 | =head1 FUNCTIONS |
148 | |
214 | |
149 | =head2 AIO FUNCTIONS |
215 | =head2 AIO REQUEST FUNCTIONS |
150 | |
216 | |
151 | All the C<aio_*> calls are more or less thin wrappers around the syscall |
217 | All the C<aio_*> calls are more or less thin wrappers around the syscall |
152 | with the same name (sans C<aio_>). The arguments are similar or identical, |
218 | with the same name (sans C<aio_>). The arguments are similar or identical, |
153 | and they all accept an additional (and optional) C<$callback> argument |
219 | and they all accept an additional (and optional) C<$callback> argument |
154 | which must be a code reference. This code reference will get called with |
220 | which must be a code reference. This code reference will get called with |
… | |
… | |
157 | syscall has been executed asynchronously. |
223 | syscall has been executed asynchronously. |
158 | |
224 | |
159 | All functions expecting a filehandle keep a copy of the filehandle |
225 | All functions expecting a filehandle keep a copy of the filehandle |
160 | internally until the request has finished. |
226 | internally until the request has finished. |
161 | |
227 | |
162 | All requests return objects of type L<IO::AIO::REQ> that allow further |
228 | All functions return request objects of type L<IO::AIO::REQ> that allow |
163 | manipulation of those requests while they are in-flight. |
229 | further manipulation of those requests while they are in-flight. |
164 | |
230 | |
165 | The pathnames you pass to these routines I<must> be absolute and |
231 | The pathnames you pass to these routines I<must> be absolute and |
166 | encoded in byte form. The reason for the former is that at the time the |
232 | encoded as octets. The reason for the former is that at the time the |
167 | request is being executed, the current working directory could have |
233 | request is being executed, the current working directory could have |
168 | changed. Alternatively, you can make sure that you never change the |
234 | changed. Alternatively, you can make sure that you never change the |
169 | current working directory. |
235 | current working directory anywhere in the program and then use relative |
|
|
236 | paths. |
170 | |
237 | |
171 | To encode pathnames to byte form, either make sure you either: a) |
238 | To encode pathnames as octets, either make sure you either: a) always pass |
172 | always pass in filenames you got from outside (command line, readdir |
239 | in filenames you got from outside (command line, readdir etc.) without |
173 | etc.), b) are ASCII or ISO 8859-1, c) use the Encode module and encode |
240 | tinkering, b) are ASCII or ISO 8859-1, c) use the Encode module and encode |
174 | your pathnames to the locale (or other) encoding in effect in the user |
241 | your pathnames to the locale (or other) encoding in effect in the user |
175 | environment, d) use Glib::filename_from_unicode on unicode filenames or e) |
242 | environment, d) use Glib::filename_from_unicode on unicode filenames or e) |
176 | use something else. |
243 | use something else to ensure your scalar has the correct contents. |
|
|
244 | |
|
|
245 | This works, btw. independent of the internal UTF-8 bit, which IO::AIO |
|
|
246 | handles correctly wether it is set or not. |
177 | |
247 | |
178 | =over 4 |
248 | =over 4 |
179 | |
249 | |
180 | =item aioreq_pri $pri |
250 | =item $prev_pri = aioreq_pri [$pri] |
181 | |
251 | |
182 | Sets the priority for the next aio request. The default priority |
252 | Returns the priority value that would be used for the next request and, if |
|
|
253 | C<$pri> is given, sets the priority for the next aio request. |
|
|
254 | |
183 | is C<0>, the minimum and maximum priorities are C<-4> and C<4>, |
255 | The default priority is C<0>, the minimum and maximum priorities are C<-4> |
184 | respectively. Requests with higher priority will be serviced first. |
256 | and C<4>, respectively. Requests with higher priority will be serviced |
|
|
257 | first. |
185 | |
258 | |
186 | The priority will be reset to C<0> after each call to one of the C<aio_> |
259 | The priority will be reset to C<0> after each call to one of the C<aio_*> |
187 | functions. |
260 | functions. |
188 | |
261 | |
189 | Example: open a file with low priority, then read something from it with |
262 | Example: open a file with low priority, then read something from it with |
190 | higher priority so the read request is serviced before other low priority |
263 | higher priority so the read request is serviced before other low priority |
191 | open requests (potentially spamming the cache): |
264 | open requests (potentially spamming the cache): |
… | |
… | |
198 | aio_read $_[0], ..., sub { |
271 | aio_read $_[0], ..., sub { |
199 | ... |
272 | ... |
200 | }; |
273 | }; |
201 | }; |
274 | }; |
202 | |
275 | |
|
|
276 | |
203 | =item aioreq_nice $pri_adjust |
277 | =item aioreq_nice $pri_adjust |
204 | |
278 | |
205 | Similar to C<aioreq_pri>, but subtracts the given value from the current |
279 | Similar to C<aioreq_pri>, but subtracts the given value from the current |
206 | priority, so effects are cumulative. |
280 | priority, so the effect is cumulative. |
|
|
281 | |
207 | |
282 | |
208 | =item aio_open $pathname, $flags, $mode, $callback->($fh) |
283 | =item aio_open $pathname, $flags, $mode, $callback->($fh) |
209 | |
284 | |
210 | Asynchronously open or create a file and call the callback with a newly |
285 | Asynchronously open or create a file and call the callback with a newly |
211 | created filehandle for the file. |
286 | created filehandle for the file. |
… | |
… | |
217 | list. They are the same as used by C<sysopen>. |
292 | list. They are the same as used by C<sysopen>. |
218 | |
293 | |
219 | Likewise, C<$mode> specifies the mode of the newly created file, if it |
294 | Likewise, C<$mode> specifies the mode of the newly created file, if it |
220 | didn't exist and C<O_CREAT> has been given, just like perl's C<sysopen>, |
295 | didn't exist and C<O_CREAT> has been given, just like perl's C<sysopen>, |
221 | except that it is mandatory (i.e. use C<0> if you don't create new files, |
296 | except that it is mandatory (i.e. use C<0> if you don't create new files, |
222 | and C<0666> or C<0777> if you do). |
297 | and C<0666> or C<0777> if you do). Note that the C<$mode> will be modified |
|
|
298 | by the umask in effect then the request is being executed, so better never |
|
|
299 | change the umask. |
223 | |
300 | |
224 | Example: |
301 | Example: |
225 | |
302 | |
226 | aio_open "/etc/passwd", O_RDONLY, 0, sub { |
303 | aio_open "/etc/passwd", O_RDONLY, 0, sub { |
227 | if ($_[0]) { |
304 | if ($_[0]) { |
… | |
… | |
230 | } else { |
307 | } else { |
231 | die "open failed: $!\n"; |
308 | die "open failed: $!\n"; |
232 | } |
309 | } |
233 | }; |
310 | }; |
234 | |
311 | |
|
|
312 | |
235 | =item aio_close $fh, $callback->($status) |
313 | =item aio_close $fh, $callback->($status) |
236 | |
314 | |
237 | Asynchronously close a file and call the callback with the result |
315 | Asynchronously close a file and call the callback with the result |
238 | code. I<WARNING:> although accepted, you should not pass in a perl |
316 | code. I<WARNING:> although accepted, you should not pass in a perl |
239 | filehandle here, as perl will likely close the file descriptor another |
317 | filehandle here, as perl will likely close the file descriptor another |
… | |
… | |
241 | C<close> or just let filehandles go out of scope. |
319 | C<close> or just let filehandles go out of scope. |
242 | |
320 | |
243 | This is supposed to be a bug in the API, so that might change. It's |
321 | This is supposed to be a bug in the API, so that might change. It's |
244 | therefore best to avoid this function. |
322 | therefore best to avoid this function. |
245 | |
323 | |
|
|
324 | |
246 | =item aio_read $fh,$offset,$length, $data,$dataoffset, $callback->($retval) |
325 | =item aio_read $fh,$offset,$length, $data,$dataoffset, $callback->($retval) |
247 | |
326 | |
248 | =item aio_write $fh,$offset,$length, $data,$dataoffset, $callback->($retval) |
327 | =item aio_write $fh,$offset,$length, $data,$dataoffset, $callback->($retval) |
249 | |
328 | |
250 | Reads or writes C<length> bytes from the specified C<fh> and C<offset> |
329 | Reads or writes C<$length> bytes from the specified C<$fh> and C<$offset> |
251 | into the scalar given by C<data> and offset C<dataoffset> and calls the |
330 | into the scalar given by C<$data> and offset C<$dataoffset> and calls the |
252 | callback without the actual number of bytes read (or -1 on error, just |
331 | callback without the actual number of bytes read (or -1 on error, just |
253 | like the syscall). |
332 | like the syscall). |
254 | |
333 | |
|
|
334 | If C<$offset> is undefined, then the current file descriptor offset will |
|
|
335 | be used (and updated), otherwise the file descriptor offset will not be |
|
|
336 | changed by these calls. |
|
|
337 | |
|
|
338 | If C<$length> is undefined in C<aio_write>, use the remaining length of C<$data>. |
|
|
339 | |
|
|
340 | If C<$dataoffset> is less than zero, it will be counted from the end of |
|
|
341 | C<$data>. |
|
|
342 | |
255 | The C<$data> scalar I<MUST NOT> be modified in any way while the request |
343 | The C<$data> scalar I<MUST NOT> be modified in any way while the request |
256 | is outstanding. Modifying it can result in segfaults or WW3 (if the |
344 | is outstanding. Modifying it can result in segfaults or World War III (if |
257 | necessary/optional hardware is installed). |
345 | the necessary/optional hardware is installed). |
258 | |
346 | |
259 | Example: Read 15 bytes at offset 7 into scalar C<$buffer>, starting at |
347 | Example: Read 15 bytes at offset 7 into scalar C<$buffer>, starting at |
260 | offset C<0> within the scalar: |
348 | offset C<0> within the scalar: |
261 | |
349 | |
262 | aio_read $fh, 7, 15, $buffer, 0, sub { |
350 | aio_read $fh, 7, 15, $buffer, 0, sub { |
263 | $_[0] > 0 or die "read error: $!"; |
351 | $_[0] > 0 or die "read error: $!"; |
264 | print "read $_[0] bytes: <$buffer>\n"; |
352 | print "read $_[0] bytes: <$buffer>\n"; |
265 | }; |
353 | }; |
266 | |
354 | |
267 | =item aio_move $srcpath, $dstpath, $callback->($status) |
|
|
268 | |
|
|
269 | Try to move the I<file> (directories not supported as either source or |
|
|
270 | destination) from C<$srcpath> to C<$dstpath> and call the callback with |
|
|
271 | the C<0> (error) or C<-1> ok. |
|
|
272 | |
|
|
273 | This is a composite request that tries to rename(2) the file first. If |
|
|
274 | rename files with C<EXDEV>, it creates the destination file with mode 0200 |
|
|
275 | and copies the contents of the source file into it using C<aio_sendfile>, |
|
|
276 | followed by restoring atime, mtime, access mode and uid/gid, in that |
|
|
277 | order, and unlinking the C<$srcpath>. |
|
|
278 | |
|
|
279 | If an error occurs, the partial destination file will be unlinked, if |
|
|
280 | possible, except when setting atime, mtime, access mode and uid/gid, where |
|
|
281 | errors are being ignored. |
|
|
282 | |
|
|
283 | =cut |
|
|
284 | |
|
|
285 | sub aio_move($$$) { |
|
|
286 | my ($src, $dst, $cb) = @_; |
|
|
287 | |
|
|
288 | my $grp = aio_group $cb; |
|
|
289 | |
|
|
290 | add $grp aio_rename $src, $dst, sub { |
|
|
291 | if ($_[0] && $! == EXDEV) { |
|
|
292 | add $grp aio_open $src, O_RDONLY, 0, sub { |
|
|
293 | if (my $src_fh = $_[0]) { |
|
|
294 | my @stat = stat $src_fh; |
|
|
295 | |
|
|
296 | add $grp aio_open $dst, O_WRONLY, 0200, sub { |
|
|
297 | if (my $dst_fh = $_[0]) { |
|
|
298 | add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub { |
|
|
299 | close $src_fh; |
|
|
300 | |
|
|
301 | if ($_[0] == $stat[7]) { |
|
|
302 | utime $stat[8], $stat[9], $dst; |
|
|
303 | chmod $stat[2] & 07777, $dst_fh; |
|
|
304 | chown $stat[4], $stat[5], $dst_fh; |
|
|
305 | close $dst_fh; |
|
|
306 | |
|
|
307 | add $grp aio_unlink $src, sub { |
|
|
308 | $grp->result ($_[0]); |
|
|
309 | }; |
|
|
310 | } else { |
|
|
311 | my $errno = $!; |
|
|
312 | add $grp aio_unlink $dst, sub { |
|
|
313 | $! = $errno; |
|
|
314 | $grp->result (-1); |
|
|
315 | }; |
|
|
316 | } |
|
|
317 | }; |
|
|
318 | } else { |
|
|
319 | $grp->result (-1); |
|
|
320 | } |
|
|
321 | }, |
|
|
322 | |
|
|
323 | } else { |
|
|
324 | $grp->result (-1); |
|
|
325 | } |
|
|
326 | }; |
|
|
327 | } else { |
|
|
328 | $grp->result ($_[0]); |
|
|
329 | } |
|
|
330 | }; |
|
|
331 | |
|
|
332 | $grp |
|
|
333 | } |
|
|
334 | |
355 | |
335 | =item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval) |
356 | =item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval) |
336 | |
357 | |
337 | Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts |
358 | Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts |
338 | reading at byte offset C<$in_offset>, and starts writing at the current |
359 | reading at byte offset C<$in_offset>, and starts writing at the current |
… | |
… | |
352 | C<$in_fh> than are written, and there is no way to find out how many |
373 | C<$in_fh> than are written, and there is no way to find out how many |
353 | bytes have been read from C<aio_sendfile> alone, as C<aio_sendfile> only |
374 | bytes have been read from C<aio_sendfile> alone, as C<aio_sendfile> only |
354 | provides the number of bytes written to C<$out_fh>. Only if the result |
375 | provides the number of bytes written to C<$out_fh>. Only if the result |
355 | value equals C<$length> one can assume that C<$length> bytes have been |
376 | value equals C<$length> one can assume that C<$length> bytes have been |
356 | read. |
377 | read. |
|
|
378 | |
357 | |
379 | |
358 | =item aio_readahead $fh,$offset,$length, $callback->($retval) |
380 | =item aio_readahead $fh,$offset,$length, $callback->($retval) |
359 | |
381 | |
360 | C<aio_readahead> populates the page cache with data from a file so that |
382 | C<aio_readahead> populates the page cache with data from a file so that |
361 | subsequent reads from that file will not block on disk I/O. The C<$offset> |
383 | subsequent reads from that file will not block on disk I/O. The C<$offset> |
… | |
… | |
367 | file. The current file offset of the file is left unchanged. |
389 | file. The current file offset of the file is left unchanged. |
368 | |
390 | |
369 | If that syscall doesn't exist (likely if your OS isn't Linux) it will be |
391 | If that syscall doesn't exist (likely if your OS isn't Linux) it will be |
370 | emulated by simply reading the data, which would have a similar effect. |
392 | emulated by simply reading the data, which would have a similar effect. |
371 | |
393 | |
|
|
394 | |
372 | =item aio_stat $fh_or_path, $callback->($status) |
395 | =item aio_stat $fh_or_path, $callback->($status) |
373 | |
396 | |
374 | =item aio_lstat $fh, $callback->($status) |
397 | =item aio_lstat $fh, $callback->($status) |
375 | |
398 | |
376 | Works like perl's C<stat> or C<lstat> in void context. The callback will |
399 | Works like perl's C<stat> or C<lstat> in void context. The callback will |
… | |
… | |
389 | aio_stat "/etc/passwd", sub { |
412 | aio_stat "/etc/passwd", sub { |
390 | $_[0] and die "stat failed: $!"; |
413 | $_[0] and die "stat failed: $!"; |
391 | print "size is ", -s _, "\n"; |
414 | print "size is ", -s _, "\n"; |
392 | }; |
415 | }; |
393 | |
416 | |
|
|
417 | |
|
|
418 | =item aio_utime $fh_or_path, $atime, $mtime, $callback->($status) |
|
|
419 | |
|
|
420 | Works like perl's C<utime> function (including the special case of $atime |
|
|
421 | and $mtime being undef). Fractional times are supported if the underlying |
|
|
422 | syscalls support them. |
|
|
423 | |
|
|
424 | When called with a pathname, uses utimes(2) if available, otherwise |
|
|
425 | utime(2). If called on a file descriptor, uses futimes(2) if available, |
|
|
426 | otherwise returns ENOSYS, so this is not portable. |
|
|
427 | |
|
|
428 | Examples: |
|
|
429 | |
|
|
430 | # set atime and mtime to current time (basically touch(1)): |
|
|
431 | aio_utime "path", undef, undef; |
|
|
432 | # set atime to current time and mtime to beginning of the epoch: |
|
|
433 | aio_utime "path", time, undef; # undef==0 |
|
|
434 | |
|
|
435 | |
|
|
436 | =item aio_chown $fh_or_path, $uid, $gid, $callback->($status) |
|
|
437 | |
|
|
438 | Works like perl's C<chown> function, except that C<undef> for either $uid |
|
|
439 | or $gid is being interpreted as "do not change" (but -1 can also be used). |
|
|
440 | |
|
|
441 | Examples: |
|
|
442 | |
|
|
443 | # same as "chown root path" in the shell: |
|
|
444 | aio_chown "path", 0, -1; |
|
|
445 | # same as above: |
|
|
446 | aio_chown "path", 0, undef; |
|
|
447 | |
|
|
448 | |
|
|
449 | =item aio_truncate $fh_or_path, $offset, $callback->($status) |
|
|
450 | |
|
|
451 | Works like truncate(2) or ftruncate(2). |
|
|
452 | |
|
|
453 | |
|
|
454 | =item aio_chmod $fh_or_path, $mode, $callback->($status) |
|
|
455 | |
|
|
456 | Works like perl's C<chmod> function. |
|
|
457 | |
|
|
458 | |
394 | =item aio_unlink $pathname, $callback->($status) |
459 | =item aio_unlink $pathname, $callback->($status) |
395 | |
460 | |
396 | Asynchronously unlink (delete) a file and call the callback with the |
461 | Asynchronously unlink (delete) a file and call the callback with the |
397 | result code. |
462 | result code. |
398 | |
463 | |
|
|
464 | |
|
|
465 | =item aio_mknod $path, $mode, $dev, $callback->($status) |
|
|
466 | |
|
|
467 | [EXPERIMENTAL] |
|
|
468 | |
|
|
469 | Asynchronously create a device node (or fifo). See mknod(2). |
|
|
470 | |
|
|
471 | The only (POSIX-) portable way of calling this function is: |
|
|
472 | |
|
|
473 | aio_mknod $path, IO::AIO::S_IFIFO | $mode, 0, sub { ... |
|
|
474 | |
|
|
475 | |
399 | =item aio_link $srcpath, $dstpath, $callback->($status) |
476 | =item aio_link $srcpath, $dstpath, $callback->($status) |
400 | |
477 | |
401 | Asynchronously create a new link to the existing object at C<$srcpath> at |
478 | Asynchronously create a new link to the existing object at C<$srcpath> at |
402 | the path C<$dstpath> and call the callback with the result code. |
479 | the path C<$dstpath> and call the callback with the result code. |
403 | |
480 | |
|
|
481 | |
404 | =item aio_symlink $srcpath, $dstpath, $callback->($status) |
482 | =item aio_symlink $srcpath, $dstpath, $callback->($status) |
405 | |
483 | |
406 | Asynchronously create a new symbolic link to the existing object at C<$srcpath> at |
484 | Asynchronously create a new symbolic link to the existing object at C<$srcpath> at |
407 | the path C<$dstpath> and call the callback with the result code. |
485 | the path C<$dstpath> and call the callback with the result code. |
408 | |
486 | |
|
|
487 | |
|
|
488 | =item aio_readlink $path, $callback->($link) |
|
|
489 | |
|
|
490 | Asynchronously read the symlink specified by C<$path> and pass it to |
|
|
491 | the callback. If an error occurs, nothing or undef gets passed to the |
|
|
492 | callback. |
|
|
493 | |
|
|
494 | |
409 | =item aio_rename $srcpath, $dstpath, $callback->($status) |
495 | =item aio_rename $srcpath, $dstpath, $callback->($status) |
410 | |
496 | |
411 | Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as |
497 | Asynchronously rename the object at C<$srcpath> to C<$dstpath>, just as |
412 | rename(2) and call the callback with the result code. |
498 | rename(2) and call the callback with the result code. |
413 | |
499 | |
|
|
500 | |
|
|
501 | =item aio_mkdir $pathname, $mode, $callback->($status) |
|
|
502 | |
|
|
503 | Asynchronously mkdir (create) a directory and call the callback with |
|
|
504 | the result code. C<$mode> will be modified by the umask at the time the |
|
|
505 | request is executed, so do not change your umask. |
|
|
506 | |
|
|
507 | |
414 | =item aio_rmdir $pathname, $callback->($status) |
508 | =item aio_rmdir $pathname, $callback->($status) |
415 | |
509 | |
416 | Asynchronously rmdir (delete) a directory and call the callback with the |
510 | Asynchronously rmdir (delete) a directory and call the callback with the |
417 | result code. |
511 | result code. |
|
|
512 | |
418 | |
513 | |
419 | =item aio_readdir $pathname, $callback->($entries) |
514 | =item aio_readdir $pathname, $callback->($entries) |
420 | |
515 | |
421 | Unlike the POSIX call of the same name, C<aio_readdir> reads an entire |
516 | Unlike the POSIX call of the same name, C<aio_readdir> reads an entire |
422 | directory (i.e. opendir + readdir + closedir). The entries will not be |
517 | directory (i.e. opendir + readdir + closedir). The entries will not be |
423 | sorted, and will B<NOT> include the C<.> and C<..> entries. |
518 | sorted, and will B<NOT> include the C<.> and C<..> entries. |
424 | |
519 | |
425 | The callback a single argument which is either C<undef> or an array-ref |
520 | The callback a single argument which is either C<undef> or an array-ref |
426 | with the filenames. |
521 | with the filenames. |
|
|
522 | |
|
|
523 | |
|
|
524 | =item aio_load $path, $data, $callback->($status) |
|
|
525 | |
|
|
526 | This is a composite request that tries to fully load the given file into |
|
|
527 | memory. Status is the same as with aio_read. |
|
|
528 | |
|
|
529 | =cut |
|
|
530 | |
|
|
531 | sub aio_load($$;$) { |
|
|
532 | aio_block { |
|
|
533 | my ($path, undef, $cb) = @_; |
|
|
534 | my $data = \$_[1]; |
|
|
535 | |
|
|
536 | my $pri = aioreq_pri; |
|
|
537 | my $grp = aio_group $cb; |
|
|
538 | |
|
|
539 | aioreq_pri $pri; |
|
|
540 | add $grp aio_open $path, O_RDONLY, 0, sub { |
|
|
541 | my $fh = shift |
|
|
542 | or return $grp->result (-1); |
|
|
543 | |
|
|
544 | aioreq_pri $pri; |
|
|
545 | add $grp aio_read $fh, 0, (-s $fh), $$data, 0, sub { |
|
|
546 | $grp->result ($_[0]); |
|
|
547 | }; |
|
|
548 | }; |
|
|
549 | |
|
|
550 | $grp |
|
|
551 | } |
|
|
552 | } |
|
|
553 | |
|
|
554 | =item aio_copy $srcpath, $dstpath, $callback->($status) |
|
|
555 | |
|
|
556 | Try to copy the I<file> (directories not supported as either source or |
|
|
557 | destination) from C<$srcpath> to C<$dstpath> and call the callback with |
|
|
558 | the C<0> (error) or C<-1> ok. |
|
|
559 | |
|
|
560 | This is a composite request that it creates the destination file with |
|
|
561 | mode 0200 and copies the contents of the source file into it using |
|
|
562 | C<aio_sendfile>, followed by restoring atime, mtime, access mode and |
|
|
563 | uid/gid, in that order. |
|
|
564 | |
|
|
565 | If an error occurs, the partial destination file will be unlinked, if |
|
|
566 | possible, except when setting atime, mtime, access mode and uid/gid, where |
|
|
567 | errors are being ignored. |
|
|
568 | |
|
|
569 | =cut |
|
|
570 | |
|
|
571 | sub aio_copy($$;$) { |
|
|
572 | aio_block { |
|
|
573 | my ($src, $dst, $cb) = @_; |
|
|
574 | |
|
|
575 | my $pri = aioreq_pri; |
|
|
576 | my $grp = aio_group $cb; |
|
|
577 | |
|
|
578 | aioreq_pri $pri; |
|
|
579 | add $grp aio_open $src, O_RDONLY, 0, sub { |
|
|
580 | if (my $src_fh = $_[0]) { |
|
|
581 | my @stat = stat $src_fh; |
|
|
582 | |
|
|
583 | aioreq_pri $pri; |
|
|
584 | add $grp aio_open $dst, O_CREAT | O_WRONLY | O_TRUNC, 0200, sub { |
|
|
585 | if (my $dst_fh = $_[0]) { |
|
|
586 | aioreq_pri $pri; |
|
|
587 | add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub { |
|
|
588 | if ($_[0] == $stat[7]) { |
|
|
589 | $grp->result (0); |
|
|
590 | close $src_fh; |
|
|
591 | |
|
|
592 | # those should not normally block. should. should. |
|
|
593 | utime $stat[8], $stat[9], $dst; |
|
|
594 | chmod $stat[2] & 07777, $dst_fh; |
|
|
595 | chown $stat[4], $stat[5], $dst_fh; |
|
|
596 | close $dst_fh; |
|
|
597 | } else { |
|
|
598 | $grp->result (-1); |
|
|
599 | close $src_fh; |
|
|
600 | close $dst_fh; |
|
|
601 | |
|
|
602 | aioreq $pri; |
|
|
603 | add $grp aio_unlink $dst; |
|
|
604 | } |
|
|
605 | }; |
|
|
606 | } else { |
|
|
607 | $grp->result (-1); |
|
|
608 | } |
|
|
609 | }, |
|
|
610 | |
|
|
611 | } else { |
|
|
612 | $grp->result (-1); |
|
|
613 | } |
|
|
614 | }; |
|
|
615 | |
|
|
616 | $grp |
|
|
617 | } |
|
|
618 | } |
|
|
619 | |
|
|
620 | =item aio_move $srcpath, $dstpath, $callback->($status) |
|
|
621 | |
|
|
622 | Try to move the I<file> (directories not supported as either source or |
|
|
623 | destination) from C<$srcpath> to C<$dstpath> and call the callback with |
|
|
624 | the C<0> (error) or C<-1> ok. |
|
|
625 | |
|
|
626 | This is a composite request that tries to rename(2) the file first. If |
|
|
627 | rename files with C<EXDEV>, it copies the file with C<aio_copy> and, if |
|
|
628 | that is successful, unlinking the C<$srcpath>. |
|
|
629 | |
|
|
630 | =cut |
|
|
631 | |
|
|
632 | sub aio_move($$;$) { |
|
|
633 | aio_block { |
|
|
634 | my ($src, $dst, $cb) = @_; |
|
|
635 | |
|
|
636 | my $pri = aioreq_pri; |
|
|
637 | my $grp = aio_group $cb; |
|
|
638 | |
|
|
639 | aioreq_pri $pri; |
|
|
640 | add $grp aio_rename $src, $dst, sub { |
|
|
641 | if ($_[0] && $! == EXDEV) { |
|
|
642 | aioreq_pri $pri; |
|
|
643 | add $grp aio_copy $src, $dst, sub { |
|
|
644 | $grp->result ($_[0]); |
|
|
645 | |
|
|
646 | if (!$_[0]) { |
|
|
647 | aioreq_pri $pri; |
|
|
648 | add $grp aio_unlink $src; |
|
|
649 | } |
|
|
650 | }; |
|
|
651 | } else { |
|
|
652 | $grp->result ($_[0]); |
|
|
653 | } |
|
|
654 | }; |
|
|
655 | |
|
|
656 | $grp |
|
|
657 | } |
|
|
658 | } |
427 | |
659 | |
428 | =item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) |
660 | =item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs) |
429 | |
661 | |
430 | Scans a directory (similar to C<aio_readdir>) but additionally tries to |
662 | Scans a directory (similar to C<aio_readdir>) but additionally tries to |
431 | efficiently separate the entries of directory C<$path> into two sets of |
663 | efficiently separate the entries of directory C<$path> into two sets of |
… | |
… | |
433 | recurse into (everything else, including symlinks to directories). |
665 | recurse into (everything else, including symlinks to directories). |
434 | |
666 | |
435 | C<aio_scandir> is a composite request that creates of many sub requests_ |
667 | C<aio_scandir> is a composite request that creates of many sub requests_ |
436 | C<$maxreq> specifies the maximum number of outstanding aio requests that |
668 | C<$maxreq> specifies the maximum number of outstanding aio requests that |
437 | this function generates. If it is C<< <= 0 >>, then a suitable default |
669 | this function generates. If it is C<< <= 0 >>, then a suitable default |
438 | will be chosen (currently 6). |
670 | will be chosen (currently 4). |
439 | |
671 | |
440 | On error, the callback is called without arguments, otherwise it receives |
672 | On error, the callback is called without arguments, otherwise it receives |
441 | two array-refs with path-relative entry names. |
673 | two array-refs with path-relative entry names. |
442 | |
674 | |
443 | Example: |
675 | Example: |
… | |
… | |
477 | as those tend to return 0 or 1 as link counts, which disables the |
709 | as those tend to return 0 or 1 as link counts, which disables the |
478 | directory counting heuristic. |
710 | directory counting heuristic. |
479 | |
711 | |
480 | =cut |
712 | =cut |
481 | |
713 | |
482 | sub aio_scandir($$$) { |
714 | sub aio_scandir($$;$) { |
|
|
715 | aio_block { |
483 | my ($path, $maxreq, $cb) = @_; |
716 | my ($path, $maxreq, $cb) = @_; |
484 | |
717 | |
|
|
718 | my $pri = aioreq_pri; |
|
|
719 | |
485 | my $grp = aio_group $cb; |
720 | my $grp = aio_group $cb; |
486 | |
721 | |
487 | $maxreq = 6 if $maxreq <= 0; |
722 | $maxreq = 4 if $maxreq <= 0; |
488 | |
723 | |
489 | # stat once |
724 | # stat once |
|
|
725 | aioreq_pri $pri; |
490 | add $grp aio_stat $path, sub { |
726 | add $grp aio_stat $path, sub { |
491 | return $grp->result () if $_[0]; |
727 | return $grp->result () if $_[0]; |
492 | my $now = time; |
728 | my $now = time; |
493 | my $hash1 = join ":", (stat _)[0,1,3,7,9]; |
729 | my $hash1 = join ":", (stat _)[0,1,3,7,9]; |
494 | |
730 | |
495 | # read the directory entries |
731 | # read the directory entries |
|
|
732 | aioreq_pri $pri; |
496 | add $grp aio_readdir $path, sub { |
733 | add $grp aio_readdir $path, sub { |
497 | my $entries = shift |
734 | my $entries = shift |
498 | or return $grp->result (); |
735 | or return $grp->result (); |
499 | |
736 | |
500 | # stat the dir another time |
737 | # stat the dir another time |
|
|
738 | aioreq_pri $pri; |
501 | add $grp aio_stat $path, sub { |
739 | add $grp aio_stat $path, sub { |
502 | my $hash2 = join ":", (stat _)[0,1,3,7,9]; |
740 | my $hash2 = join ":", (stat _)[0,1,3,7,9]; |
503 | |
741 | |
504 | my $ndirs; |
742 | my $ndirs; |
505 | |
743 | |
506 | # take the slow route if anything looks fishy |
744 | # take the slow route if anything looks fishy |
507 | if ($hash1 ne $hash2 or (stat _)[9] == $now) { |
745 | if ($hash1 ne $hash2 or (stat _)[9] == $now) { |
508 | $ndirs = -1; |
746 | $ndirs = -1; |
509 | } else { |
747 | } else { |
510 | # if nlink == 2, we are finished |
748 | # if nlink == 2, we are finished |
511 | # on non-posix-fs's, we rely on nlink < 2 |
749 | # on non-posix-fs's, we rely on nlink < 2 |
512 | $ndirs = (stat _)[3] - 2 |
750 | $ndirs = (stat _)[3] - 2 |
513 | or return $grp->result ([], $entries); |
751 | or return $grp->result ([], $entries); |
514 | } |
752 | } |
515 | |
753 | |
516 | # sort into likely dirs and likely nondirs |
754 | # sort into likely dirs and likely nondirs |
517 | # dirs == files without ".", short entries first |
755 | # dirs == files without ".", short entries first |
518 | $entries = [map $_->[0], |
756 | $entries = [map $_->[0], |
519 | sort { $b->[1] cmp $a->[1] } |
757 | sort { $b->[1] cmp $a->[1] } |
520 | map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length], |
758 | map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length], |
521 | @$entries]; |
759 | @$entries]; |
522 | |
760 | |
523 | my (@dirs, @nondirs); |
761 | my (@dirs, @nondirs); |
524 | |
762 | |
525 | my $statgrp = add $grp aio_group sub { |
763 | my $statgrp = add $grp aio_group sub { |
526 | $grp->result (\@dirs, \@nondirs); |
764 | $grp->result (\@dirs, \@nondirs); |
527 | }; |
765 | }; |
528 | |
766 | |
529 | limit $statgrp $maxreq; |
767 | limit $statgrp $maxreq; |
530 | feed $statgrp sub { |
768 | feed $statgrp sub { |
531 | return unless @$entries; |
769 | return unless @$entries; |
532 | my $entry = pop @$entries; |
770 | my $entry = pop @$entries; |
533 | |
771 | |
|
|
772 | aioreq_pri $pri; |
534 | add $statgrp aio_stat "$path/$entry/.", sub { |
773 | add $statgrp aio_stat "$path/$entry/.", sub { |
535 | if ($_[0] < 0) { |
774 | if ($_[0] < 0) { |
536 | push @nondirs, $entry; |
775 | push @nondirs, $entry; |
537 | } else { |
776 | } else { |
538 | # need to check for real directory |
777 | # need to check for real directory |
|
|
778 | aioreq_pri $pri; |
539 | add $statgrp aio_lstat "$path/$entry", sub { |
779 | add $statgrp aio_lstat "$path/$entry", sub { |
540 | if (-d _) { |
780 | if (-d _) { |
541 | push @dirs, $entry; |
781 | push @dirs, $entry; |
542 | |
782 | |
543 | unless (--$ndirs) { |
783 | unless (--$ndirs) { |
544 | push @nondirs, @$entries; |
784 | push @nondirs, @$entries; |
545 | feed $statgrp; |
785 | feed $statgrp; |
|
|
786 | } |
|
|
787 | } else { |
|
|
788 | push @nondirs, $entry; |
546 | } |
789 | } |
547 | } else { |
|
|
548 | push @nondirs, $entry; |
|
|
549 | } |
790 | } |
550 | } |
791 | } |
551 | } |
792 | }; |
552 | }; |
793 | }; |
553 | }; |
794 | }; |
554 | }; |
795 | }; |
555 | }; |
796 | }; |
|
|
797 | |
|
|
798 | $grp |
556 | }; |
799 | } |
|
|
800 | } |
557 | |
801 | |
|
|
802 | =item aio_rmtree $path, $callback->($status) |
|
|
803 | |
|
|
804 | Delete a directory tree starting (and including) C<$path>, return the |
|
|
805 | status of the final C<rmdir> only. This is a composite request that |
|
|
806 | uses C<aio_scandir> to recurse into and rmdir directories, and unlink |
|
|
807 | everything else. |
|
|
808 | |
|
|
809 | =cut |
|
|
810 | |
|
|
811 | sub aio_rmtree; |
|
|
812 | sub aio_rmtree($;$) { |
|
|
813 | aio_block { |
|
|
814 | my ($path, $cb) = @_; |
|
|
815 | |
|
|
816 | my $pri = aioreq_pri; |
|
|
817 | my $grp = aio_group $cb; |
|
|
818 | |
|
|
819 | aioreq_pri $pri; |
|
|
820 | add $grp aio_scandir $path, 0, sub { |
|
|
821 | my ($dirs, $nondirs) = @_; |
|
|
822 | |
|
|
823 | my $dirgrp = aio_group sub { |
|
|
824 | add $grp aio_rmdir $path, sub { |
|
|
825 | $grp->result ($_[0]); |
|
|
826 | }; |
|
|
827 | }; |
|
|
828 | |
|
|
829 | (aioreq_pri $pri), add $dirgrp aio_rmtree "$path/$_" for @$dirs; |
|
|
830 | (aioreq_pri $pri), add $dirgrp aio_unlink "$path/$_" for @$nondirs; |
|
|
831 | |
|
|
832 | add $grp $dirgrp; |
|
|
833 | }; |
|
|
834 | |
558 | $grp |
835 | $grp |
|
|
836 | } |
559 | } |
837 | } |
560 | |
838 | |
561 | =item aio_fsync $fh, $callback->($status) |
839 | =item aio_fsync $fh, $callback->($status) |
562 | |
840 | |
563 | Asynchronously call fsync on the given filehandle and call the callback |
841 | Asynchronously call fsync on the given filehandle and call the callback |
… | |
… | |
714 | itself. Useful when you queued a lot of events but got a result early. |
992 | itself. Useful when you queued a lot of events but got a result early. |
715 | |
993 | |
716 | =item $grp->result (...) |
994 | =item $grp->result (...) |
717 | |
995 | |
718 | Set the result value(s) that will be passed to the group callback when all |
996 | Set the result value(s) that will be passed to the group callback when all |
719 | subrequests have finished. By default, no argument will be passed. |
997 | subrequests have finished and set thre groups errno to the current value |
|
|
998 | of errno (just like calling C<errno> without an error number). By default, |
|
|
999 | no argument will be passed and errno is zero. |
|
|
1000 | |
|
|
1001 | =item $grp->errno ([$errno]) |
|
|
1002 | |
|
|
1003 | Sets the group errno value to C<$errno>, or the current value of errno |
|
|
1004 | when the argument is missing. |
|
|
1005 | |
|
|
1006 | Every aio request has an associated errno value that is restored when |
|
|
1007 | the callback is invoked. This method lets you change this value from its |
|
|
1008 | default (0). |
|
|
1009 | |
|
|
1010 | Calling C<result> will also set errno, so make sure you either set C<$!> |
|
|
1011 | before the call to C<result>, or call c<errno> after it. |
720 | |
1012 | |
721 | =item feed $grp $callback->($grp) |
1013 | =item feed $grp $callback->($grp) |
722 | |
1014 | |
723 | Sets a feeder/generator on this group: every group can have an attached |
1015 | Sets a feeder/generator on this group: every group can have an attached |
724 | generator that generates requests if idle. The idea behind this is that, |
1016 | generator that generates requests if idle. The idea behind this is that, |
… | |
… | |
763 | |
1055 | |
764 | =back |
1056 | =back |
765 | |
1057 | |
766 | =head2 SUPPORT FUNCTIONS |
1058 | =head2 SUPPORT FUNCTIONS |
767 | |
1059 | |
|
|
1060 | =head3 EVENT PROCESSING AND EVENT LOOP INTEGRATION |
|
|
1061 | |
768 | =over 4 |
1062 | =over 4 |
769 | |
1063 | |
770 | =item $fileno = IO::AIO::poll_fileno |
1064 | =item $fileno = IO::AIO::poll_fileno |
771 | |
1065 | |
772 | Return the I<request result pipe file descriptor>. This filehandle must be |
1066 | Return the I<request result pipe file descriptor>. This filehandle must be |
… | |
… | |
776 | |
1070 | |
777 | See C<poll_cb> for an example. |
1071 | See C<poll_cb> for an example. |
778 | |
1072 | |
779 | =item IO::AIO::poll_cb |
1073 | =item IO::AIO::poll_cb |
780 | |
1074 | |
781 | Process all outstanding events on the result pipe. You have to call this |
1075 | Process some outstanding events on the result pipe. You have to call this |
782 | regularly. Returns the number of events processed. Returns immediately |
1076 | regularly. Returns the number of events processed. Returns immediately |
783 | when no events are outstanding. |
1077 | when no events are outstanding. The amount of events processed depends on |
|
|
1078 | the settings of C<IO::AIO::max_poll_req> and C<IO::AIO::max_poll_time>. |
784 | |
1079 | |
785 | If not all requests were processed for whatever reason, the filehandle |
1080 | If not all requests were processed for whatever reason, the filehandle |
786 | will still be ready when C<poll_cb> returns. |
1081 | will still be ready when C<poll_cb> returns. |
787 | |
1082 | |
788 | Example: Install an Event watcher that automatically calls |
1083 | Example: Install an Event watcher that automatically calls |
… | |
… | |
790 | |
1085 | |
791 | Event->io (fd => IO::AIO::poll_fileno, |
1086 | Event->io (fd => IO::AIO::poll_fileno, |
792 | poll => 'r', async => 1, |
1087 | poll => 'r', async => 1, |
793 | cb => \&IO::AIO::poll_cb); |
1088 | cb => \&IO::AIO::poll_cb); |
794 | |
1089 | |
795 | =item IO::AIO::poll_some $max_requests |
1090 | =item IO::AIO::max_poll_reqs $nreqs |
796 | |
1091 | |
797 | Similar to C<poll_cb>, but only processes up to C<$max_requests> requests |
1092 | =item IO::AIO::max_poll_time $seconds |
798 | at a time. |
|
|
799 | |
1093 | |
800 | Useful if you want to ensure some level of interactiveness when perl is |
1094 | These set the maximum number of requests (default C<0>, meaning infinity) |
801 | not fast enough to process all requests in time. |
1095 | that are being processed by C<IO::AIO::poll_cb> in one call, respectively |
|
|
1096 | the maximum amount of time (default C<0>, meaning infinity) spent in |
|
|
1097 | C<IO::AIO::poll_cb> to process requests (more correctly the mininum amount |
|
|
1098 | of time C<poll_cb> is allowed to use). |
|
|
1099 | |
|
|
1100 | Setting C<max_poll_time> to a non-zero value creates an overhead of one |
|
|
1101 | syscall per request processed, which is not normally a problem unless your |
|
|
1102 | callbacks are really really fast or your OS is really really slow (I am |
|
|
1103 | not mentioning Solaris here). Using C<max_poll_reqs> incurs no overhead. |
|
|
1104 | |
|
|
1105 | Setting these is useful if you want to ensure some level of |
|
|
1106 | interactiveness when perl is not fast enough to process all requests in |
|
|
1107 | time. |
|
|
1108 | |
|
|
1109 | For interactive programs, values such as C<0.01> to C<0.1> should be fine. |
802 | |
1110 | |
803 | Example: Install an Event watcher that automatically calls |
1111 | Example: Install an Event watcher that automatically calls |
804 | IO::AIO::poll_some with low priority, to ensure that other parts of the |
1112 | IO::AIO::poll_cb with low priority, to ensure that other parts of the |
805 | program get the CPU sometimes even under high AIO load. |
1113 | program get the CPU sometimes even under high AIO load. |
806 | |
1114 | |
|
|
1115 | # try not to spend much more than 0.1s in poll_cb |
|
|
1116 | IO::AIO::max_poll_time 0.1; |
|
|
1117 | |
|
|
1118 | # use a low priority so other tasks have priority |
807 | Event->io (fd => IO::AIO::poll_fileno, |
1119 | Event->io (fd => IO::AIO::poll_fileno, |
808 | poll => 'r', nice => 1, |
1120 | poll => 'r', nice => 1, |
809 | cb => sub { IO::AIO::poll_some 256 }); |
1121 | cb => &IO::AIO::poll_cb); |
810 | |
1122 | |
811 | =item IO::AIO::poll_wait |
1123 | =item IO::AIO::poll_wait |
812 | |
1124 | |
|
|
1125 | If there are any outstanding requests and none of them in the result |
813 | Wait till the result filehandle becomes ready for reading (simply does a |
1126 | phase, wait till the result filehandle becomes ready for reading (simply |
814 | C<select> on the filehandle. This is useful if you want to synchronously wait |
1127 | does a C<select> on the filehandle. This is useful if you want to |
815 | for some requests to finish). |
1128 | synchronously wait for some requests to finish). |
816 | |
1129 | |
817 | See C<nreqs> for an example. |
1130 | See C<nreqs> for an example. |
818 | |
1131 | |
|
|
1132 | =item IO::AIO::poll |
|
|
1133 | |
|
|
1134 | Waits until some requests have been handled. |
|
|
1135 | |
|
|
1136 | Returns the number of requests processed, but is otherwise strictly |
|
|
1137 | equivalent to: |
|
|
1138 | |
|
|
1139 | IO::AIO::poll_wait, IO::AIO::poll_cb |
|
|
1140 | |
819 | =item IO::AIO::nreqs |
1141 | =item IO::AIO::flush |
820 | |
1142 | |
821 | Returns the number of requests currently outstanding (i.e. for which their |
1143 | Wait till all outstanding AIO requests have been handled. |
822 | callback has not been invoked yet). |
|
|
823 | |
1144 | |
824 | Example: wait till there are no outstanding requests anymore: |
1145 | Strictly equivalent to: |
825 | |
1146 | |
826 | IO::AIO::poll_wait, IO::AIO::poll_cb |
1147 | IO::AIO::poll_wait, IO::AIO::poll_cb |
827 | while IO::AIO::nreqs; |
1148 | while IO::AIO::nreqs; |
828 | |
1149 | |
829 | =item IO::AIO::flush |
1150 | =back |
830 | |
1151 | |
831 | Wait till all outstanding AIO requests have been handled. |
1152 | =head3 CONTROLLING THE NUMBER OF THREADS |
832 | |
1153 | |
833 | Strictly equivalent to: |
1154 | =over |
834 | |
|
|
835 | IO::AIO::poll_wait, IO::AIO::poll_cb |
|
|
836 | while IO::AIO::nreqs; |
|
|
837 | |
|
|
838 | =item IO::AIO::poll |
|
|
839 | |
|
|
840 | Waits until some requests have been handled. |
|
|
841 | |
|
|
842 | Strictly equivalent to: |
|
|
843 | |
|
|
844 | IO::AIO::poll_wait, IO::AIO::poll_cb |
|
|
845 | if IO::AIO::nreqs; |
|
|
846 | |
1155 | |
847 | =item IO::AIO::min_parallel $nthreads |
1156 | =item IO::AIO::min_parallel $nthreads |
848 | |
1157 | |
849 | Set the minimum number of AIO threads to C<$nthreads>. The current |
1158 | Set the minimum number of AIO threads to C<$nthreads>. The current |
850 | default is C<8>, which means eight asynchronous operations can execute |
1159 | default is C<8>, which means eight asynchronous operations can execute |
851 | concurrently at any one time (the number of outstanding requests, |
1160 | concurrently at any one time (the number of outstanding requests, |
852 | however, is unlimited). |
1161 | however, is unlimited). |
853 | |
1162 | |
854 | IO::AIO starts threads only on demand, when an AIO request is queued and |
1163 | IO::AIO starts threads only on demand, when an AIO request is queued and |
855 | no free thread exists. |
1164 | no free thread exists. Please note that queueing up a hundred requests can |
|
|
1165 | create demand for a hundred threads, even if it turns out that everything |
|
|
1166 | is in the cache and could have been processed faster by a single thread. |
856 | |
1167 | |
857 | It is recommended to keep the number of threads relatively low, as some |
1168 | It is recommended to keep the number of threads relatively low, as some |
858 | Linux kernel versions will scale negatively with the number of threads |
1169 | Linux kernel versions will scale negatively with the number of threads |
859 | (higher parallelity => MUCH higher latency). With current Linux 2.6 |
1170 | (higher parallelity => MUCH higher latency). With current Linux 2.6 |
860 | versions, 4-32 threads should be fine. |
1171 | versions, 4-32 threads should be fine. |
… | |
… | |
874 | This module automatically runs C<max_parallel 0> at program end, to ensure |
1185 | This module automatically runs C<max_parallel 0> at program end, to ensure |
875 | that all threads are killed and that there are no outstanding requests. |
1186 | that all threads are killed and that there are no outstanding requests. |
876 | |
1187 | |
877 | Under normal circumstances you don't need to call this function. |
1188 | Under normal circumstances you don't need to call this function. |
878 | |
1189 | |
|
|
1190 | =item IO::AIO::max_idle $nthreads |
|
|
1191 | |
|
|
1192 | Limit the number of threads (default: 4) that are allowed to idle (i.e., |
|
|
1193 | threads that did not get a request to process within 10 seconds). That |
|
|
1194 | means if a thread becomes idle while C<$nthreads> other threads are also |
|
|
1195 | idle, it will free its resources and exit. |
|
|
1196 | |
|
|
1197 | This is useful when you allow a large number of threads (e.g. 100 or 1000) |
|
|
1198 | to allow for extremely high load situations, but want to free resources |
|
|
1199 | under normal circumstances (1000 threads can easily consume 30MB of RAM). |
|
|
1200 | |
|
|
1201 | The default is probably ok in most situations, especially if thread |
|
|
1202 | creation is fast. If thread creation is very slow on your system you might |
|
|
1203 | want to use larger values. |
|
|
1204 | |
879 | =item $oldnreqs = IO::AIO::max_outstanding $nreqs |
1205 | =item $oldmaxreqs = IO::AIO::max_outstanding $maxreqs |
880 | |
1206 | |
881 | [REMOVED] |
1207 | This is a very bad function to use in interactive programs because it |
|
|
1208 | blocks, and a bad way to reduce concurrency because it is inexact: Better |
|
|
1209 | use an C<aio_group> together with a feed callback. |
882 | |
1210 | |
883 | Pre-2.x versions used max_outstanding for a crude request queue length limit. |
|
|
884 | |
|
|
885 | In 2.x+ you are advised to use a group and a feeder to limit |
|
|
886 | concurrency. The max_outstanding feature ran very unstable (endless |
|
|
887 | recursions causing segfaults, bad interaction with groups etc.) and was |
|
|
888 | removed. |
|
|
889 | |
|
|
890 | I am deeply sorry, but I am still on the hunt for a good limiting interface. |
|
|
891 | |
|
|
892 | Original description was as follows: |
|
|
893 | |
|
|
894 | Sets the maximum number of outstanding requests to C<$nreqs>. If you try |
1211 | Sets the maximum number of outstanding requests to C<$nreqs>. If you |
895 | to queue up more than this number of requests, the caller will block until |
1212 | do queue up more than this number of requests, the next call to the |
896 | some requests have been handled. |
1213 | C<poll_cb> (and C<poll_some> and other functions calling C<poll_cb>) |
|
|
1214 | function will block until the limit is no longer exceeded. |
|
|
1215 | |
|
|
1216 | The default value is very large, so there is no practical limit on the |
|
|
1217 | number of outstanding requests. |
|
|
1218 | |
|
|
1219 | You can still queue as many requests as you want. Therefore, |
|
|
1220 | C<max_oustsanding> is mainly useful in simple scripts (with low values) or |
|
|
1221 | as a stop gap to shield against fatal memory overflow (with large values). |
|
|
1222 | |
|
|
1223 | =back |
|
|
1224 | |
|
|
1225 | =head3 STATISTICAL INFORMATION |
|
|
1226 | |
|
|
1227 | =over |
|
|
1228 | |
|
|
1229 | =item IO::AIO::nreqs |
|
|
1230 | |
|
|
1231 | Returns the number of requests currently in the ready, execute or pending |
|
|
1232 | states (i.e. for which their callback has not been invoked yet). |
|
|
1233 | |
|
|
1234 | Example: wait till there are no outstanding requests anymore: |
|
|
1235 | |
|
|
1236 | IO::AIO::poll_wait, IO::AIO::poll_cb |
|
|
1237 | while IO::AIO::nreqs; |
|
|
1238 | |
|
|
1239 | =item IO::AIO::nready |
|
|
1240 | |
|
|
1241 | Returns the number of requests currently in the ready state (not yet |
|
|
1242 | executed). |
|
|
1243 | |
|
|
1244 | =item IO::AIO::npending |
|
|
1245 | |
|
|
1246 | Returns the number of requests currently in the pending state (executed, |
|
|
1247 | but not yet processed by poll_cb). |
897 | |
1248 | |
898 | =back |
1249 | =back |
899 | |
1250 | |
900 | =cut |
1251 | =cut |
901 | |
1252 | |
… | |
… | |
915 | *$sym |
1266 | *$sym |
916 | } |
1267 | } |
917 | |
1268 | |
918 | min_parallel 8; |
1269 | min_parallel 8; |
919 | |
1270 | |
920 | END { |
1271 | END { flush } |
921 | max_parallel 0; |
|
|
922 | } |
|
|
923 | |
1272 | |
924 | 1; |
1273 | 1; |
925 | |
1274 | |
926 | =head2 FORK BEHAVIOUR |
1275 | =head2 FORK BEHAVIOUR |
927 | |
1276 | |
… | |
… | |
947 | bytes of memory. In addition, stat requests need a stat buffer (possibly |
1296 | bytes of memory. In addition, stat requests need a stat buffer (possibly |
948 | a few hundred bytes), readdir requires a result buffer and so on. Perl |
1297 | a few hundred bytes), readdir requires a result buffer and so on. Perl |
949 | scalars and other data passed into aio requests will also be locked and |
1298 | scalars and other data passed into aio requests will also be locked and |
950 | will consume memory till the request has entered the done state. |
1299 | will consume memory till the request has entered the done state. |
951 | |
1300 | |
952 | This is now awfully much, so queuing lots of requests is not usually a |
1301 | This is not awfully much, so queuing lots of requests is not usually a |
953 | problem. |
1302 | problem. |
954 | |
1303 | |
955 | Per-thread usage: |
1304 | Per-thread usage: |
956 | |
1305 | |
957 | In the execution phase, some aio requests require more memory for |
1306 | In the execution phase, some aio requests require more memory for |