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

Comparing IO-AIO/AIO.pm (file contents):
Revision 1.50 by root, Sat Jun 24 16:27:02 2006 UTC vs.
Revision 1.81 by root, Fri Oct 27 19:17:23 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
47	Currently, a number of threads are started that execute your read/writes	56	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	57	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	58	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	59	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	60	functions available on many operating systems. However, they are often
52	not well-supported (Linux doesn't allow them on normal files currently,	61	not well-supported or restricted (Linux doesn't allow them on normal
53	for example), and they would only support aio_read and aio_write, so the	62	files currently, for example), and they would only support aio_read and
54	remaining functionality would have to be implemented using threads anyway.	63	aio_write, so the remaining functionality would have to be implemented
		64	using threads anyway.
55		65
56	Although the module will work with in the presence of other threads, it is	66	Although the module will work with in the presence of other (Perl-)
57	currently not reentrant, so use appropriate locking yourself, always call	67	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	68	locking yourself, always call C<poll_cb> from within the same thread, or
59	C<aio_> functions) recursively.	69	never call C<poll_cb> (or other C<aio_> functions) recursively.
		70
		71	=head1 REQUEST ANATOMY AND LIFETIME
		72
		73	Every C<aio_*> function creates a request. which is a C data structure not
		74	directly visible to Perl.
		75
		76	If called in non-void context, every request function returns a Perl
		77	object representing the request. In void context, nothing is returned,
		78	which saves a bit of memory.
		79
		80	The perl object is a fairly standard ref-to-hash object. The hash contents
		81	are not used by IO::AIO so you are free to store anything you like in it.
		82
		83	During their existance, aio requests travel through the following states,
		84	in order:
		85
		86	=over 4
		87
		88	=item ready
		89
		90	Immediately after a request is created it is put into the ready state,
		91	waiting for a thread to execute it.
		92
		93	=item execute
		94
		95	A thread has accepted the request for processing and is currently
		96	executing it (e.g. blocking in read).
		97
		98	=item pending
		99
		100	The request has been executed and is waiting for result processing.
		101
		102	While request submission and execution is fully asynchronous, result
		103	processing is not and relies on the perl interpreter calling C<poll_cb>
		104	(or another function with the same effect).
		105
		106	=item result
		107
		108	The request results are processed synchronously by C<poll_cb>.
		109
		110	The C<poll_cb> function will process all outstanding aio requests by
		111	calling their callbacks, freeing memory associated with them and managing
		112	any groups they are contained in.
		113
		114	=item done
		115
		116	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
		118	aio request is severed and calling its methods will either do nothing or
		119	result in a runtime error).
60		120
61	=cut	121	=cut
62		122
63	package IO::AIO;	123	package IO::AIO;
64		124
65	no warnings;	125	no warnings;
		126	use strict 'vars';
66		127
67	use base 'Exporter';	128	use base 'Exporter';
68		129
69	use Fcntl ();
70
71	BEGIN {	130	BEGIN {
72	$VERSION = '1.8';	131	our $VERSION = '2.0';
73		132
74	@EXPORT = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat	133	our @AIO_REQ = qw(aio_sendfile aio_read aio_write aio_open aio_close aio_stat
75	aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink	134	aio_lstat aio_unlink aio_rmdir aio_readdir aio_scandir aio_symlink
76	aio_fsync aio_fdatasync aio_readahead aio_rename aio_link aio_move);	135	aio_fsync aio_fdatasync aio_readahead aio_rename aio_link aio_move
77	@EXPORT_OK = qw(poll_fileno poll_cb min_parallel max_parallel	136	aio_group aio_nop);
78	max_outstanding nreqs);	137	our @EXPORT = (@AIO_REQ, qw(aioreq_pri aioreq_nice));
		138	our @EXPORT_OK = qw(poll_fileno poll_cb poll_wait flush
		139	min_parallel max_parallel nreqs nready npending);
		140
		141	@IO::AIO::GRP::ISA = 'IO::AIO::REQ';
79		142
80	require XSLoader;	143	require XSLoader;
81	XSLoader::load IO::AIO, $VERSION;	144	XSLoader::load ("IO::AIO", $VERSION);
82	}	145	}
83		146
84	=head1 FUNCTIONS	147	=head1 FUNCTIONS
85		148
86	=head2 AIO FUNCTIONS	149	=head2 AIO FUNCTIONS
…		…
94	syscall has been executed asynchronously.	157	syscall has been executed asynchronously.
95		158
96	All functions expecting a filehandle keep a copy of the filehandle	159	All functions expecting a filehandle keep a copy of the filehandle
97	internally until the request has finished.	160	internally until the request has finished.
98		161
		162	All requests return objects of type L<IO::AIO::REQ> that allow further
		163	manipulation of those requests while they are in-flight.
		164
99	The pathnames you pass to these routines I<must> be absolute and	165	The pathnames you pass to these routines I<must> be absolute and
100	encoded in byte form. The reason for the former is that at the time the	166	encoded in byte form. The reason for the former is that at the time the
101	request is being executed, the current working directory could have	167	request is being executed, the current working directory could have
102	changed. Alternatively, you can make sure that you never change the	168	changed. Alternatively, you can make sure that you never change the
103	current working directory.	169	current working directory.
…		…
108	your pathnames to the locale (or other) encoding in effect in the user	174	your pathnames to the locale (or other) encoding in effect in the user
109	environment, d) use Glib::filename_from_unicode on unicode filenames or e)	175	environment, d) use Glib::filename_from_unicode on unicode filenames or e)
110	use something else.	176	use something else.
111		177
112	=over 4	178	=over 4
		179
		180	=item $prev_pri = aioreq_pri [$pri]
		181
		182	Returns the priority value that would be used for the next request and, if
		183	C<$pri> is given, sets the priority for the next aio request.
		184
		185	The default priority is C<0>, the minimum and maximum priorities are C<-4>
		186	and C<4>, respectively. Requests with higher priority will be serviced
		187	first.
		188
		189	The priority will be reset to C<0> after each call to one of the C<aio_*>
		190	functions.
		191
		192	Example: open a file with low priority, then read something from it with
		193	higher priority so the read request is serviced before other low priority
		194	open requests (potentially spamming the cache):
		195
		196	aioreq_pri -3;
		197	aio_open ..., sub {
		198	return unless $_[0];
		199
		200	aioreq_pri -2;
		201	aio_read $_[0], ..., sub {
		202	...
		203	};
		204	};
		205
		206	=item aioreq_nice $pri_adjust
		207
		208	Similar to C<aioreq_pri>, but subtracts the given value from the current
		209	priority, so effects are cumulative.
113		210
114	=item aio_open $pathname, $flags, $mode, $callback->($fh)	211	=item aio_open $pathname, $flags, $mode, $callback->($fh)
115		212
116	Asynchronously open or create a file and call the callback with a newly	213	Asynchronously open or create a file and call the callback with a newly
117	created filehandle for the file.	214	created filehandle for the file.
…		…
170	print "read $_[0] bytes: <$buffer>\n";	267	print "read $_[0] bytes: <$buffer>\n";
171	};	268	};
172		269
173	=item aio_move $srcpath, $dstpath, $callback->($status)	270	=item aio_move $srcpath, $dstpath, $callback->($status)
174		271
175	[EXPERIMENTAL]
176
177	Try to move the I<file> (directories not supported as either source or destination)	272	Try to move the I<file> (directories not supported as either source or
178	from C<$srcpath> to C<$dstpath> and call the callback with the C<0> (error) or C<-1> ok.	273	destination) from C<$srcpath> to C<$dstpath> and call the callback with
		274	the C<0> (error) or C<-1> ok.
179		275
180	This is a composite request that tries to rename(2) the file first. If	276	This is a composite request that tries to rename(2) the file first. If
181	rename files with C<EXDEV>, it creates the destination file with mode 0200	277	rename files with C<EXDEV>, it creates the destination file with mode 0200
182	and copies the contents of the source file into it using C<aio_sendfile>,	278	and copies the contents of the source file into it using C<aio_sendfile>,
183	followed by restoring atime, mtime, access mode and uid/gid, in that	279	followed by restoring atime, mtime, access mode and uid/gid, in that
…		…
190	=cut	286	=cut
191		287
192	sub aio_move($$$) {	288	sub aio_move($$$) {
193	my ($src, $dst, $cb) = @_;	289	my ($src, $dst, $cb) = @_;
194		290
		291	my $pri = aioreq_pri;
		292	my $grp = aio_group $cb;
		293
		294	aioreq_pri $pri;
195	aio_rename $src, $dst, sub {	295	add $grp aio_rename $src, $dst, sub {
196	if ($_[0] && $! == Errno::EXDEV) {	296	if ($_[0] && $! == EXDEV) {
		297	aioreq_pri $pri;
197	aio_open $src, O_RDONLY, 0, sub {	298	add $grp aio_open $src, O_RDONLY, 0, sub {
198	if (my $src_fh = $_[0]) {	299	if (my $src_fh = $_[0]) {
199	my @stat = stat $src_fh;	300	my @stat = stat $src_fh;
200		301
		302	aioreq_pri $pri;
201	aio_open $dst, O_WRONLY, 0200, sub {	303	add $grp aio_open $dst, O_WRONLY, 0200, sub {
202	if (my $dst_fh = $_[0]) {	304	if (my $dst_fh = $_[0]) {
		305	aioreq_pri $pri;
203	aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {	306	add $grp aio_sendfile $dst_fh, $src_fh, 0, $stat[7], sub {
204	close $src_fh;	307	close $src_fh;
205		308
206	if ($_[0] == $stat[7]) {	309	if ($_[0] == $stat[7]) {
207	utime $stat[8], $stat[9], $dst;	310	utime $stat[8], $stat[9], $dst;
208	chmod $stat[2] & 07777, $dst_fh;	311	chmod $stat[2] & 07777, $dst_fh;
209	chown $stat[4], $stat[5], $dst_fh;	312	chown $stat[4], $stat[5], $dst_fh;
210	close $dst_fh;	313	close $dst_fh;
211		314
		315	aioreq_pri $pri;
212	aio_unlink $src, sub {	316	add $grp aio_unlink $src, sub {
213	$cb->($_[0]);	317	$grp->result ($_[0]);
214	};	318	};
215	} else {	319	} else {
216	my $errno = $!;	320	my $errno = $!;
		321	aioreq_pri $pri;
217	aio_unlink $dst, sub {	322	add $grp aio_unlink $dst, sub {
218	$! = $errno;	323	$! = $errno;
219	$cb->(-1);	324	$grp->result (-1);
220	};	325	};
221	}	326	}
222	};	327	};
223	} else {	328	} else {
224	$cb->(-1);	329	$grp->result (-1);
225	}	330	}
226	},	331	},
227		332
228	} else {	333	} else {
229	$cb->(-1);	334	$grp->result (-1);
230	}	335	}
231	};	336	};
232	} else {	337	} else {
233	$cb->($_[0]);	338	$grp->result ($_[0]);
234	}	339	}
235	};	340	};
		341
		342	$grp
236	}	343	}
237		344
238	=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval)	345	=item aio_sendfile $out_fh, $in_fh, $in_offset, $length, $callback->($retval)
239		346
240	Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts	347	Tries to copy C<$length> bytes from C<$in_fh> to C<$out_fh>. It starts
…		…
328	The callback a single argument which is either C<undef> or an array-ref	435	The callback a single argument which is either C<undef> or an array-ref
329	with the filenames.	436	with the filenames.
330		437
331	=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs)	438	=item aio_scandir $path, $maxreq, $callback->($dirs, $nondirs)
332		439
333	Scans a directory (similar to C<aio_readdir>) and tries to separate the	440	Scans a directory (similar to C<aio_readdir>) but additionally tries to
334	entries of directory C<$path> into two sets of names, ones you can recurse	441	efficiently separate the entries of directory C<$path> into two sets of
335	into (directories), and ones you cannot recurse into (everything else).	442	names, directories you can recurse into (directories), and ones you cannot
		443	recurse into (everything else, including symlinks to directories).
336		444
337	C<aio_scandir> is a composite request that consists of many	445	C<aio_scandir> is a composite request that creates of many sub requests_
338	aio-primitives. C<$maxreq> specifies the maximum number of outstanding	446	C<$maxreq> specifies the maximum number of outstanding aio requests that
339	aio requests that this function generates. If it is C<< <= 0 >>, then a	447	this function generates. If it is C<< <= 0 >>, then a suitable default
340	suitable default will be chosen (currently 8).	448	will be chosen (currently 4).
341		449
342	On error, the callback is called without arguments, otherwise it receives	450	On error, the callback is called without arguments, otherwise it receives
343	two array-refs with path-relative entry names.	451	two array-refs with path-relative entry names.
344		452
345	Example:	453	Example:
…		…
353	Implementation notes.	461	Implementation notes.
354		462
355	The C<aio_readdir> cannot be avoided, but C<stat()>'ing every entry can.	463	The C<aio_readdir> cannot be avoided, but C<stat()>'ing every entry can.
356		464
357	After reading the directory, the modification time, size etc. of the	465	After reading the directory, the modification time, size etc. of the
358	directory before and after the readdir is checked, and if they match, the	466	directory before and after the readdir is checked, and if they match (and
359	link count will be used to decide how many entries are directories (if	467	isn't the current time), the link count will be used to decide how many
360	>= 2). Otherwise, no knowledge of the number of subdirectories will be	468	entries are directories (if >= 2). Otherwise, no knowledge of the number
361	assumed.	469	of subdirectories will be assumed.
362		470
363	Then entires will be sorted into likely directories (everything without a	471	Then entries will be sorted into likely directories (everything without
364	non-initial dot) and likely non-directories (everything else). Then every	472	a non-initial dot currently) and likely non-directories (everything
365	entry + C</.> will be C<stat>'ed, likely directories first. This is often	473	else). Then every entry plus an appended C</.> will be C<stat>'ed,
		474	likely directories first. If that succeeds, it assumes that the entry
		475	is a directory or a symlink to directory (which will be checked
		476	seperately). This is often faster than stat'ing the entry itself because
366	faster because filesystems might detect the type of the entry without	477	filesystems might detect the type of the entry without reading the inode
367	reading the inode data (e.g. ext2fs filetype feature). If that succeeds,	478	data (e.g. ext2fs filetype feature).
368	it assumes that the entry is a directory or a symlink to directory (which
369	will be checked seperately).
370		479
371	If the known number of directories has been reached, the rest of the	480	If the known number of directories (link count - 2) has been reached, the
372	entries is assumed to be non-directories.	481	rest of the entries is assumed to be non-directories.
		482
		483	This only works with certainty on POSIX (= UNIX) filesystems, which
		484	fortunately are the vast majority of filesystems around.
		485
		486	It will also likely work on non-POSIX filesystems with reduced efficiency
		487	as those tend to return 0 or 1 as link counts, which disables the
		488	directory counting heuristic.
373		489
374	=cut	490	=cut
375		491
376	sub aio_scandir($$$) {	492	sub aio_scandir($$$) {
377	my ($path, $maxreq, $cb) = @_;	493	my ($path, $maxreq, $cb) = @_;
378		494
		495	my $pri = aioreq_pri;
		496
		497	my $grp = aio_group $cb;
		498
379	$maxreq = 8 if $maxreq <= 0;	499	$maxreq = 4 if $maxreq <= 0;
380		500
381	# stat once	501	# stat once
		502	aioreq_pri $pri;
382	aio_stat $path, sub {	503	add $grp aio_stat $path, sub {
383	return $cb->() if $_[0];	504	return $grp->result () if $_[0];
		505	my $now = time;
384	my $hash1 = join ":", (stat _)[0,1,3,7,9];	506	my $hash1 = join ":", (stat _)[0,1,3,7,9];
385		507
386	# read the directory entries	508	# read the directory entries
		509	aioreq_pri $pri;
387	aio_readdir $path, sub {	510	add $grp aio_readdir $path, sub {
388	my $entries = shift	511	my $entries = shift
389	or return $cb->();	512	or return $grp->result ();
390		513
391	# stat the dir another time	514	# stat the dir another time
		515	aioreq_pri $pri;
392	aio_stat $path, sub {	516	add $grp aio_stat $path, sub {
393	my $hash2 = join ":", (stat _)[0,1,3,7,9];	517	my $hash2 = join ":", (stat _)[0,1,3,7,9];
394		518
395	my $ndirs;	519	my $ndirs;
396		520
397	# take the slow route if anything looks fishy	521	# take the slow route if anything looks fishy
398	if ($hash1 ne $hash2) {	522	if ($hash1 ne $hash2 or (stat _)[9] == $now) {
399	$ndirs = -1;	523	$ndirs = -1;
400	} else {	524	} else {
401	# if nlink == 2, we are finished	525	# if nlink == 2, we are finished
402	# on non-posix-fs's, we rely on nlink < 2	526	# on non-posix-fs's, we rely on nlink < 2
403	$ndirs = (stat _)[3] - 2	527	$ndirs = (stat _)[3] - 2
404	or return $cb->([], $entries);	528	or return $grp->result ([], $entries);
405	}	529	}
406		530
407	# sort into likely dirs and likely nondirs	531	# sort into likely dirs and likely nondirs
408	# dirs == files without ".", short entries first	532	# dirs == files without ".", short entries first
409	$entries = [map $_->[0],	533	$entries = [map $_->[0],
…		…
411	map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length],	535	map [$_, sprintf "%s%04d", (/.\./ ? "1" : "0"), length],
412	@$entries];	536	@$entries];
413		537
414	my (@dirs, @nondirs);	538	my (@dirs, @nondirs);
415		539
416	my ($statcb, $schedcb);	540	my $statgrp = add $grp aio_group sub {
417	my $nreq = 0;	541	$grp->result (\@dirs, \@nondirs);
		542	};
418		543
419	$schedcb = sub {	544	limit $statgrp $maxreq;
420	if (@$entries) {	545	feed $statgrp sub {
421	if ($nreq < $maxreq) {	546	return unless @$entries;
422	my $ent = pop @$entries;	547	my $entry = pop @$entries;
		548
		549	aioreq_pri $pri;
		550	add $statgrp aio_stat "$path/$entry/.", sub {
		551	if ($_[0] < 0) {
		552	push @nondirs, $entry;
		553	} else {
		554	# need to check for real directory
		555	aioreq_pri $pri;
		556	add $statgrp aio_lstat "$path/$entry", sub {
		557	if (-d _) {
		558	push @dirs, $entry;
		559
		560	unless (--$ndirs) {
		561	push @nondirs, @$entries;
		562	feed $statgrp;
		563	}
		564	} else {
		565	push @nondirs, $entry;
		566	}
423	$nreq++;	567	}
424	aio_stat "$path/$ent/.", sub { $statcb->($_[0], $ent) };
425	}	568	}
426	} elsif (!$nreq) {
427	# finished
428	undef $statcb;
429	undef $schedcb;
430	$cb->(\@dirs, \@nondirs) if $cb;
431	undef $cb;
432	}	569	};
433	};	570	};
434	$statcb = sub {
435	my ($status, $entry) = @_;
436
437	if ($status < 0) {
438	$nreq--;
439	push @nondirs, $entry;
440	&$schedcb;
441	} else {
442	# need to check for real directory
443	aio_lstat "$path/$entry", sub {
444	$nreq--;
445
446	if (-d _) {
447	push @dirs, $entry;
448
449	if (!--$ndirs) {
450	push @nondirs, @$entries;
451	$entries = [];
452	}
453	} else {
454	push @nondirs, $entry;
455	}
456
457	&$schedcb;
458	}
459	}
460	};
461
462	&$schedcb while @$entries && $nreq < $maxreq;
463	};	571	};
464	};	572	};
465	};	573	};
		574
		575	$grp
466	}	576	}
467		577
468	=item aio_fsync $fh, $callback->($status)	578	=item aio_fsync $fh, $callback->($status)
469		579
470	Asynchronously call fsync on the given filehandle and call the callback	580	Asynchronously call fsync on the given filehandle and call the callback
…		…
475	Asynchronously call fdatasync on the given filehandle and call the	585	Asynchronously call fdatasync on the given filehandle and call the
476	callback with the fdatasync result code.	586	callback with the fdatasync result code.
477		587
478	If this call isn't available because your OS lacks it or it couldn't be	588	If this call isn't available because your OS lacks it or it couldn't be
479	detected, it will be emulated by calling C<fsync> instead.	589	detected, it will be emulated by calling C<fsync> instead.
		590
		591	=item aio_group $callback->(...)
		592
		593	This is a very special aio request: Instead of doing something, it is a
		594	container for other aio requests, which is useful if you want to bundle
		595	many requests into a single, composite, request with a definite callback
		596	and the ability to cancel the whole request with its subrequests.
		597
		598	Returns an object of class L<IO::AIO::GRP>. See its documentation below
		599	for more info.
		600
		601	Example:
		602
		603	my $grp = aio_group sub {
		604	print "all stats done\n";
		605	};
		606
		607	add $grp
		608	(aio_stat ...),
		609	(aio_stat ...),
		610	...;
		611
		612	=item aio_nop $callback->()
		613
		614	This is a special request - it does nothing in itself and is only used for
		615	side effects, such as when you want to add a dummy request to a group so
		616	that finishing the requests in the group depends on executing the given
		617	code.
		618
		619	While this request does nothing, it still goes through the execution
		620	phase and still requires a worker thread. Thus, the callback will not
		621	be executed immediately but only after other requests in the queue have
		622	entered their execution phase. This can be used to measure request
		623	latency.
		624
		625	=item IO::AIO::aio_busy $fractional_seconds, $callback->() NOT EXPORTED
		626
		627	Mainly used for debugging and benchmarking, this aio request puts one of
		628	the request workers to sleep for the given time.
		629
		630	While it is theoretically handy to have simple I/O scheduling requests
		631	like sleep and file handle readable/writable, the overhead this creates is
		632	immense (it blocks a thread for a long time) so do not use this function
		633	except to put your application under artificial I/O pressure.
		634
		635	=back
		636
		637	=head2 IO::AIO::REQ CLASS
		638
		639	All non-aggregate C<aio_*> functions return an object of this class when
		640	called in non-void context.
		641
		642	=over 4
		643
		644	=item cancel $req
		645
		646	Cancels the request, if possible. Has the effect of skipping execution
		647	when entering the B<execute> state and skipping calling the callback when
		648	entering the the B<result> state, but will leave the request otherwise
		649	untouched. That means that requests that currently execute will not be
		650	stopped and resources held by the request will not be freed prematurely.
		651
		652	=item cb $req $callback->(...)
		653
		654	Replace (or simply set) the callback registered to the request.
		655
		656	=back
		657
		658	=head2 IO::AIO::GRP CLASS
		659
		660	This class is a subclass of L<IO::AIO::REQ>, so all its methods apply to
		661	objects of this class, too.
		662
		663	A IO::AIO::GRP object is a special request that can contain multiple other
		664	aio requests.
		665
		666	You create one by calling the C<aio_group> constructing function with a
		667	callback that will be called when all contained requests have entered the
		668	C<done> state:
		669
		670	my $grp = aio_group sub {
		671	print "all requests are done\n";
		672	};
		673
		674	You add requests by calling the C<add> method with one or more
		675	C<IO::AIO::REQ> objects:
		676
		677	$grp->add (aio_unlink "...");
		678
		679	add $grp aio_stat "...", sub {
		680	$_[0] or return $grp->result ("error");
		681
		682	# add another request dynamically, if first succeeded
		683	add $grp aio_open "...", sub {
		684	$grp->result ("ok");
		685	};
		686	};
		687
		688	This makes it very easy to create composite requests (see the source of
		689	C<aio_move> for an application) that work and feel like simple requests.
		690
		691	=over 4
		692
		693	=item * The IO::AIO::GRP objects will be cleaned up during calls to
		694	C<IO::AIO::poll_cb>, just like any other request.
		695
		696	=item * They can be canceled like any other request. Canceling will cancel not
		697	only the request itself, but also all requests it contains.
		698
		699	=item * They can also can also be added to other IO::AIO::GRP objects.
		700
		701	=item * You must not add requests to a group from within the group callback (or
		702	any later time).
		703
		704	=back
		705
		706	Their lifetime, simplified, looks like this: when they are empty, they
		707	will finish very quickly. If they contain only requests that are in the
		708	C<done> state, they will also finish. Otherwise they will continue to
		709	exist.
		710
		711	That means after creating a group you have some time to add requests. And
		712	in the callbacks of those requests, you can add further requests to the
		713	group. And only when all those requests have finished will the the group
		714	itself finish.
		715
		716	=over 4
		717
		718	=item add $grp ...
		719
		720	=item $grp->add (...)
		721
		722	Add one or more requests to the group. Any type of L<IO::AIO::REQ> can
		723	be added, including other groups, as long as you do not create circular
		724	dependencies.
		725
		726	Returns all its arguments.
		727
		728	=item $grp->cancel_subs
		729
		730	Cancel all subrequests and clears any feeder, but not the group request
		731	itself. Useful when you queued a lot of events but got a result early.
		732
		733	=item $grp->result (...)
		734
		735	Set the result value(s) that will be passed to the group callback when all
		736	subrequests have finished and set thre groups errno to the current value
		737	of errno (just like calling C<errno> without an error number). By default,
		738	no argument will be passed and errno is zero.
		739
		740	=item $grp->errno ([$errno])
		741
		742	Sets the group errno value to C<$errno>, or the current value of errno
		743	when the argument is missing.
		744
		745	Every aio request has an associated errno value that is restored when
		746	the callback is invoked. This method lets you change this value from its
		747	default (0).
		748
		749	Calling C<result> will also set errno, so make sure you either set C<$!>
		750	before the call to C<result>, or call c<errno> after it.
		751
		752	=item feed $grp $callback->($grp)
		753
		754	Sets a feeder/generator on this group: every group can have an attached
		755	generator that generates requests if idle. The idea behind this is that,
		756	although you could just queue as many requests as you want in a group,
		757	this might starve other requests for a potentially long time. For
		758	example, C<aio_scandir> might generate hundreds of thousands C<aio_stat>
		759	requests, delaying any later requests for a long time.
		760
		761	To avoid this, and allow incremental generation of requests, you can
		762	instead a group and set a feeder on it that generates those requests. The
		763	feed callback will be called whenever there are few enough (see C<limit>,
		764	below) requests active in the group itself and is expected to queue more
		765	requests.
		766
		767	The feed callback can queue as many requests as it likes (i.e. C<add> does
		768	not impose any limits).
		769
		770	If the feed does not queue more requests when called, it will be
		771	automatically removed from the group.
		772
		773	If the feed limit is C<0>, it will be set to C<2> automatically.
		774
		775	Example:
		776
		777	# stat all files in @files, but only ever use four aio requests concurrently:
		778
		779	my $grp = aio_group sub { print "finished\n" };
		780	limit $grp 4;
		781	feed $grp sub {
		782	my $file = pop @files
		783	or return;
		784
		785	add $grp aio_stat $file, sub { ... };
		786	};
		787
		788	=item limit $grp $num
		789
		790	Sets the feeder limit for the group: The feeder will be called whenever
		791	the group contains less than this many requests.
		792
		793	Setting the limit to C<0> will pause the feeding process.
480		794
481	=back	795	=back
482		796
483	=head2 SUPPORT FUNCTIONS	797	=head2 SUPPORT FUNCTIONS
484		798
…		…
497		811
498	Process all outstanding events on the result pipe. You have to call this	812	Process all outstanding events on the result pipe. You have to call this
499	regularly. Returns the number of events processed. Returns immediately	813	regularly. Returns the number of events processed. Returns immediately
500	when no events are outstanding.	814	when no events are outstanding.
501		815
		816	If not all requests were processed for whatever reason, the filehandle
		817	will still be ready when C<poll_cb> returns.
		818
502	Example: Install an Event watcher that automatically calls	819	Example: Install an Event watcher that automatically calls
503	IO::AIO::poll_cb with high priority:	820	IO::AIO::poll_cb with high priority:
504		821
505	Event->io (fd => IO::AIO::poll_fileno,	822	Event->io (fd => IO::AIO::poll_fileno,
506	poll => 'r', async => 1,	823	poll => 'r', async => 1,
507	cb => \&IO::AIO::poll_cb);	824	cb => \&IO::AIO::poll_cb);
508		825
		826	=item IO::AIO::poll_some $max_requests
		827
		828	Similar to C<poll_cb>, but only processes up to C<$max_requests> requests
		829	at a time.
		830
		831	Useful if you want to ensure some level of interactiveness when perl is
		832	not fast enough to process all requests in time.
		833
		834	Example: Install an Event watcher that automatically calls
		835	IO::AIO::poll_some with low priority, to ensure that other parts of the
		836	program get the CPU sometimes even under high AIO load.
		837
		838	Event->io (fd => IO::AIO::poll_fileno,
		839	poll => 'r', nice => 1,
		840	cb => sub { IO::AIO::poll_some 256 });
		841
509	=item IO::AIO::poll_wait	842	=item IO::AIO::poll_wait
510		843
511	Wait till the result filehandle becomes ready for reading (simply does a	844	Wait till the result filehandle becomes ready for reading (simply does a
512	C<select> on the filehandle. This is useful if you want to synchronously wait	845	C<select> on the filehandle. This is useful if you want to synchronously wait
513	for some requests to finish).	846	for some requests to finish).
514		847
515	See C<nreqs> for an example.	848	See C<nreqs> for an example.
516		849
517	=item IO::AIO::nreqs	850	=item IO::AIO::nreqs
518		851
519	Returns the number of requests currently outstanding (i.e. for which their	852	Returns the number of requests currently in the ready, execute or pending
520	callback has not been invoked yet).	853	states (i.e. for which their callback has not been invoked yet).
521		854
522	Example: wait till there are no outstanding requests anymore:	855	Example: wait till there are no outstanding requests anymore:
523		856
524	IO::AIO::poll_wait, IO::AIO::poll_cb	857	IO::AIO::poll_wait, IO::AIO::poll_cb
525	while IO::AIO::nreqs;	858	while IO::AIO::nreqs;
526		859
		860	=item IO::AIO::nready
		861
		862	Returns the number of requests currently in the ready state (not yet
		863	executed).
		864
		865	=item IO::AIO::npending
		866
		867	Returns the number of requests currently in the pending state (executed,
		868	but not yet processed by poll_cb).
		869
527	=item IO::AIO::flush	870	=item IO::AIO::flush
528		871
529	Wait till all outstanding AIO requests have been handled.	872	Wait till all outstanding AIO requests have been handled.
530		873
531	Strictly equivalent to:	874	Strictly equivalent to:
…		…
542	IO::AIO::poll_wait, IO::AIO::poll_cb	885	IO::AIO::poll_wait, IO::AIO::poll_cb
543	if IO::AIO::nreqs;	886	if IO::AIO::nreqs;
544		887
545	=item IO::AIO::min_parallel $nthreads	888	=item IO::AIO::min_parallel $nthreads
546		889
547	Set the minimum number of AIO threads to C<$nthreads>. The current default	890	Set the minimum number of AIO threads to C<$nthreads>. The current
548	is C<4>, which means four asynchronous operations can be done at one time	891	default is C<8>, which means eight asynchronous operations can execute
549	(the number of outstanding operations, however, is unlimited).	892	concurrently at any one time (the number of outstanding requests,
		893	however, is unlimited).
550		894
551	IO::AIO starts threads only on demand, when an AIO request is queued and	895	IO::AIO starts threads only on demand, when an AIO request is queued and
552	no free thread exists.	896	no free thread exists.
553		897
554	It is recommended to keep the number of threads low, as some Linux	898	It is recommended to keep the number of threads relatively low, as some
555	kernel versions will scale negatively with the number of threads (higher	899	Linux kernel versions will scale negatively with the number of threads
556	parallelity => MUCH higher latency). With current Linux 2.6 versions, 4-32	900	(higher parallelity => MUCH higher latency). With current Linux 2.6
557	threads should be fine.	901	versions, 4-32 threads should be fine.
558		902
559	Under most circumstances you don't need to call this function, as the	903	Under most circumstances you don't need to call this function, as the
560	module selects a default that is suitable for low to moderate load.	904	module selects a default that is suitable for low to moderate load.
561		905
562	=item IO::AIO::max_parallel $nthreads	906	=item IO::AIO::max_parallel $nthreads
…		…
571	This module automatically runs C<max_parallel 0> at program end, to ensure	915	This module automatically runs C<max_parallel 0> at program end, to ensure
572	that all threads are killed and that there are no outstanding requests.	916	that all threads are killed and that there are no outstanding requests.
573		917
574	Under normal circumstances you don't need to call this function.	918	Under normal circumstances you don't need to call this function.
575		919
576	=item $oldnreqs = IO::AIO::max_outstanding $nreqs	920	=item $oldmaxreqs = IO::AIO::max_outstanding $maxreqs
		921
		922	This is a very bad function to use in interactive programs because it
		923	blocks, and a bad way to reduce concurrency because it is inexact: Better
		924	use an C<aio_group> together with a feed callback.
577		925
578	Sets the maximum number of outstanding requests to C<$nreqs>. If you	926	Sets the maximum number of outstanding requests to C<$nreqs>. If you
579	try to queue up more than this number of requests, the caller will block until	927	to queue up more than this number of requests, the next call to the
580	some requests have been handled.	928	C<poll_cb> (and C<poll_some> and other functions calling C<poll_cb>)
		929	function will block until the limit is no longer exceeded.
581		930
582	The default is very large, so normally there is no practical limit. If you	931	The default value is very large, so there is no practical limit on the
583	queue up many requests in a loop it often improves speed if you set	932	number of outstanding requests.
584	this to a relatively low number, such as C<100>.
585		933
586	Under normal circumstances you don't need to call this function.	934	You can still queue as many requests as you want. Therefore,
		935	C<max_oustsanding> is mainly useful in simple scripts (with low values) or
		936	as a stop gap to shield against fatal memory overflow (with large values).
587		937
588	=back	938	=back
589		939
590	=cut	940	=cut
591		941
…		…
603	or return undef;	953	or return undef;
604		954
605	*$sym	955	*$sym
606	}	956	}
607		957
608	min_parallel 4;	958	min_parallel 8;
609
610	END {
611	max_parallel 0;
612	}
613		959
614	1;	960	1;
615		961
616	=head2 FORK BEHAVIOUR	962	=head2 FORK BEHAVIOUR
		963
		964	This module should do "the right thing" when the process using it forks:
617		965
618	Before the fork, IO::AIO enters a quiescent state where no requests	966	Before the fork, IO::AIO enters a quiescent state where no requests
619	can be added in other threads and no results will be processed. After	967	can be added in other threads and no results will be processed. After
620	the fork the parent simply leaves the quiescent state and continues	968	the fork the parent simply leaves the quiescent state and continues
621	request/result processing, while the child clears the request/result	969	request/result processing, while the child frees the request/result queue
622	queue (so the requests started before the fork will only be handled in	970	(so that the requests started before the fork will only be handled in the
623	the parent). Threats will be started on demand until the limit ste in the	971	parent). Threads will be started on demand until the limit set in the
624	parent process has been reached again.	972	parent process has been reached again.
625		973
		974	In short: the parent will, after a short pause, continue as if fork had
		975	not been called, while the child will act as if IO::AIO has not been used
		976	yet.
		977
		978	=head2 MEMORY USAGE
		979
		980	Per-request usage:
		981
		982	Each aio request uses - depending on your architecture - around 100-200
		983	bytes of memory. In addition, stat requests need a stat buffer (possibly
		984	a few hundred bytes), readdir requires a result buffer and so on. Perl
		985	scalars and other data passed into aio requests will also be locked and
		986	will consume memory till the request has entered the done state.
		987
		988	This is now awfully much, so queuing lots of requests is not usually a
		989	problem.
		990
		991	Per-thread usage:
		992
		993	In the execution phase, some aio requests require more memory for
		994	temporary buffers, and each thread requires a stack and other data
		995	structures (usually around 16k-128k, depending on the OS).
		996
		997	=head1 KNOWN BUGS
		998
		999	Known bugs will be fixed in the next release.
		1000
626	=head1 SEE ALSO	1001	=head1 SEE ALSO
627		1002
628	L<Coro>, L<Linux::AIO>.	1003	L<Coro::AIO>.
629		1004
630	=head1 AUTHOR	1005	=head1 AUTHOR
631		1006
632	Marc Lehmann <schmorp@schmorp.de>	1007	Marc Lehmann <schmorp@schmorp.de>
633	http://home.schmorp.de/	1008	http://home.schmorp.de/

Diff Legend

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

Comparing IO-AIO/AIO.pm (file contents): Revision 1.50 by root, Sat Jun 24 16:27:02 2006 UTC vs. Revision 1.81 by root, Fri Oct 27 19:17:23 2006 UTC

Diff Legend

Comparing IO-AIO/AIO.pm (file contents):
Revision 1.50 by root, Sat Jun 24 16:27:02 2006 UTC vs.
Revision 1.81 by root, Fri Oct 27 19:17:23 2006 UTC