[ViewVC] Diff of: cvs/IO-AIO/AIO.pm

Comparing IO-AIO/AIO.pm (file contents):
Revision 1.51 by root, Sat Jun 24 19:14:04 2006 UTC vs.
Revision 1.87 by root, Sun Oct 29 00:52:02 2006 UTC

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

Diff Legend

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines

Comparing IO-AIO/AIO.pm (file contents): Revision 1.51 by root, Sat Jun 24 19:14:04 2006 UTC vs. Revision 1.87 by root, Sun Oct 29 00:52:02 2006 UTC

Diff Legend

Comparing IO-AIO/AIO.pm (file contents):
Revision 1.51 by root, Sat Jun 24 19:14:04 2006 UTC vs.
Revision 1.87 by root, Sun Oct 29 00:52:02 2006 UTC