[ViewVC] Diff of: cvs/AnyEvent-Fork-RPC/RPC.pm

Comparing AnyEvent-Fork-RPC/RPC.pm (file contents):
Revision 1.7 by root, Wed Apr 17 20:19:41 2013 UTC vs.
Revision 1.16 by root, Thu Apr 18 14:07:15 2013 UTC

…		…
12	->require ("MyModule")	12	->require ("MyModule")
13	->AnyEvent::Fork::RPC::run (	13	->AnyEvent::Fork::RPC::run (
14	"MyModule::server",	14	"MyModule::server",
15	);	15	);
16		16
		17	use AnyEvent;
		18
17	my $cv = AE::cv;	19	my $cv = AE::cv;
18		20
19	$rpc->(1, 2, 3, sub {	21	$rpc->(1, 2, 3, sub {
20	print "MyModule::server returned @_\n";	22	print "MyModule::server returned @_\n";
21	$cv->send;	23	$cv->send;
…		…
39	Loading this module also always loads L<AnyEvent::Fork>, so you can make a	41	Loading this module also always loads L<AnyEvent::Fork>, so you can make a
40	separate C<use AnyEvent::Fork> if you wish, but you don't have to.	42	separate C<use AnyEvent::Fork> if you wish, but you don't have to.
41		43
42	=head1 EXAMPLES	44	=head1 EXAMPLES
43		45
44	=head2 Synchronous Backend	46	=head2 Example 1: Synchronous Backend
45		47
46	Here is a simple example that implements a backend that executes C<unlink>	48	Here is a simple example that implements a backend that executes C<unlink>
47	and C<rmdir> calls, and reports their status back. It also reports the	49	and C<rmdir> calls, and reports their status back. It also reports the
48	number of requests it has processed every three requests, which is clearly	50	number of requests it has processed every three requests, which is clearly
49	silly, but illustrates the use of events.	51	silly, but illustrates the use of events.
50		52
51	First the parent process:	53	First the parent process:
52		54
53	use AnyEvent;	55	use AnyEvent;
54	use AnyEvent::Fork;
55	use AnyEvent::Fork::RPC;	56	use AnyEvent::Fork::RPC;
56		57
57	my $done = AE::cv;	58	my $done = AE::cv;
58		59
59	my $rpc = AnyEvent::Fork	60	my $rpc = AnyEvent::Fork
…		…
137		138
138	And as a final remark, there is a fine module on CPAN that can	139	And as a final remark, there is a fine module on CPAN that can
139	asynchronously C<rmdir> and C<unlink> and a lot more, and more efficiently	140	asynchronously C<rmdir> and C<unlink> and a lot more, and more efficiently
140	than this example, namely L<IO::AIO>.	141	than this example, namely L<IO::AIO>.
141		142
		143	=head3 Example 1a: the same with the asynchronous backend
		144
		145	This example only shows what needs to be changed to use the async backend
		146	instead. Doing this is not very useful, the purpose of this example is
		147	to show the minimum amount of change that is required to go from the
		148	synchronous to the asynchronous backend.
		149
		150	To use the async backend in the previous example, you need to add the
		151	C<async> parameter to the C<AnyEvent::Fork::RPC::run> call:
		152
		153	->AnyEvent::Fork::RPC::run ("MyWorker::run",
		154	async => 1,
		155	...
		156
		157	And since the function call protocol is now changed, you need to adopt
		158	C<MyWorker::run> to the async API.
		159
		160	First, you need to accept the extra initial C<$done> callback:
		161
		162	sub run {
		163	my ($done, $cmd, $path) = @_;
		164
		165	And since a response is now generated when C<$done> is called, as opposed
		166	to when the function returns, we need to call the C<$done> function with
		167	the status:
		168
		169	$done->($status or (0, "$!"));
		170
		171	A few remarks are in order. First, it's quite pointless to use the async
		172	backend for this example - but it I<is> possible. Second, you can call
		173	C<$done> before or after returning from the function. Third, having both
		174	returned from the function and having called the C<$done> callback, the
		175	child process may exit at any time, so you should call C<$done> only when
		176	you really I<are> done.
		177
		178	=head2 Example 2: Asynchronous Backend
		179
		180	This example implements multiple count-downs in the child, using
		181	L<AnyEvent> timers. While this is a bit silly (one could use timers in te
		182	parent just as well), it illustrates the ability to use AnyEvent in the
		183	child and the fact that responses can arrive in a different order then the
		184	requests.
		185
		186	It also shows how to embed the actual child code into a C<__DATA__>
		187	section, so it doesn't need any external files at all.
		188
		189	And when your parent process is often busy, and you have stricter timing
		190	requirements, then running timers in a child process suddenly doesn't look
		191	so silly anymore.
		192
		193	Without further ado, here is the code:
		194
		195	use AnyEvent;
		196	use AnyEvent::Fork::RPC;
		197
		198	my $done = AE::cv;
		199
		200	my $rpc = AnyEvent::Fork
		201	->new
		202	->require ("AnyEvent::Fork::RPC::Async")
		203	->eval (do { local $/; <DATA> })
		204	->AnyEvent::Fork::RPC::run ("run",
		205	async => 1,
		206	on_error => sub { warn "FATAL: $_[0]"; exit 1 },
		207	on_event => sub { print $_[0] },
		208	on_destroy => $done,
		209	);
		210
		211	for my $count (3, 2, 1) {
		212	$rpc->($count, sub {
		213	warn "job $count finished\n";
		214	});
		215	}
		216
		217	undef $rpc;
		218
		219	$done->recv;
		220
		221	__DATA__
		222
		223	# this ends up in main, as we don't use a package declaration
		224
		225	use AnyEvent;
		226
		227	sub run {
		228	my ($done, $count) = @_;
		229
		230	my $n;
		231
		232	AnyEvent::Fork::RPC::event "starting to count up to $count\n";
		233
		234	my $w; $w = AE::timer 1, 1, sub {
		235	++$n;
		236
		237	AnyEvent::Fork::RPC::event "count $n of $count\n";
		238
		239	if ($n == $count) {
		240	undef $w;
		241	$done->();
		242	}
		243	};
		244	}
		245
		246	The parent part (the one before the C<__DATA__> section) isn't very
		247	different from the earlier examples. It sets async mode, preloads
		248	the backend module (so the C<AnyEvent::Fork::RPC::event> function is
		249	declared), uses a slightly different C<on_event> handler (which we use
		250	simply for logging purposes) and then, instead of loading a module with
		251	the actual worker code, it C<eval>'s the code from the data section in the
		252	child process.
		253
		254	It then starts three countdowns, from 3 to 1 seconds downwards, destroys
		255	the rpc object so the example finishes eventually, and then just waits for
		256	the stuff to trickle in.
		257
		258	The worker code uses the event function to log some progress messages, but
		259	mostly just creates a recurring one-second timer.
		260
		261	The timer callback increments a counter, logs a message, and eventually,
		262	when the count has been reached, calls the finish callback.
		263
		264	On my system, this results in the following output. Since all timers fire
		265	at roughly the same time, the actual order isn't guaranteed, but the order
		266	shown is very likely what you would get, too.
		267
		268	starting to count up to 3
		269	starting to count up to 2
		270	starting to count up to 1
		271	count 1 of 3
		272	count 1 of 2
		273	count 1 of 1
		274	job 1 finished
		275	count 2 of 2
		276	job 2 finished
		277	count 2 of 3
		278	count 3 of 3
		279	job 3 finished
		280
		281	While the overall ordering isn't guaranteed, the async backend still
		282	guarantees that events and responses are delivered to the parent process
		283	in the exact same ordering as they were generated in the child process.
		284
		285	And unless your system is I<very> busy, it should clearly show that the
		286	job started last will finish first, as it has the lowest count.
		287
		288	This concludes the async example. Since L<AnyEvent::Fork> does not
		289	actually fork, you are free to use about any module in the child, not just
		290	L<AnyEvent>, but also L<IO::AIO>, or L<Tk> for example.
		291
142	=head1 PARENT PROCESS USAGE	292	=head1 PARENT PROCESS USAGE
143		293
144	This module exports nothing, and only implements a single function:	294	This module exports nothing, and only implements a single function:
145		295
146	=over 4	296	=over 4
…		…
224		374
225	The default server used in the child does all I/O blockingly, and only	375	The default server used in the child does all I/O blockingly, and only
226	allows a single RPC call to execute concurrently.	376	allows a single RPC call to execute concurrently.
227		377
228	Setting C<async> to a true value switches to another implementation that	378	Setting C<async> to a true value switches to another implementation that
229	uses L<AnyEvent> in the child and allows multiple concurrent RPC calls.	379	uses L<AnyEvent> in the child and allows multiple concurrent RPC calls (it
		380	does not support recursion in the event loop however, blocking condvar
		381	calls will fail).
230		382
231	The actual API in the child is documented in the section that describes	383	The actual API in the child is documented in the section that describes
232	the calling semantics of the returned C<$rpc> function.	384	the calling semantics of the returned C<$rpc> function.
233		385
234	If you want to pre-load the actual back-end modules to enable memory	386	If you want to pre-load the actual back-end modules to enable memory
…		…
236	synchronous, and C<AnyEvent::Fork::RPC::Async> for asynchronous mode.	388	synchronous, and C<AnyEvent::Fork::RPC::Async> for asynchronous mode.
237		389
238	If you use a template process and want to fork both sync and async	390	If you use a template process and want to fork both sync and async
239	children, then it is permissible to load both modules.	391	children, then it is permissible to load both modules.
240		392
241	=item serialiser => $string (default: '(sub { pack "(w/a)", @_ }, sub { unpack "(w/a)", shift })')	393	=item serialiser => $string (default: $AnyEvent::Fork::RPC::STRING_SERIALISER)
242		394
243	All arguments, result data and event data have to be serialised to be	395	All arguments, result data and event data have to be serialised to be
244	transferred between the processes. For this, they have to be frozen and	396	transferred between the processes. For this, they have to be frozen and
245	thawed in both parent and child processes.	397	thawed in both parent and child processes.
246		398
247	By default, only octet strings can be passed between the processes, which	399	By default, only octet strings can be passed between the processes, which
248	is reasonably fast and efficient.	400	is reasonably fast and efficient and requires no extra modules.
249		401
250	For more complicated use cases, you can provide your own freeze and thaw	402	For more complicated use cases, you can provide your own freeze and thaw
251	functions, by specifying a string with perl source code. It's supposed to	403	functions, by specifying a string with perl source code. It's supposed to
252	return two code references when evaluated: the first receives a list of	404	return two code references when evaluated: the first receives a list of
253	perl values and must return an octet string. The second receives the octet	405	perl values and must return an octet string. The second receives the octet
…		…
255		407
256	If you need an external module for serialisation, then you can either	408	If you need an external module for serialisation, then you can either
257	pre-load it into your L<AnyEvent::Fork> process, or you can add a C<use>	409	pre-load it into your L<AnyEvent::Fork> process, or you can add a C<use>
258	or C<require> statement into the serialiser string. Or both.	410	or C<require> statement into the serialiser string. Or both.
259		411
		412	Here are some examples - some of them are also available as global
		413	variables that make them easier to use.
		414
		415	=over 4
		416
		417	=item octet strings - C<$AnyEvent::Fork::RPC::STRING_SERIALISER>
		418
		419	This serialiser concatenates length-prefixes octet strings, and is the
		420	default.
		421
		422	Implementation:
		423
		424	(
		425	sub { pack "(w/a)", @_ },
		426	sub { unpack "(w/a)", shift }
		427	)
		428
		429	=item json - C<$AnyEvent::Fork::RPC::JSON_SERIALISER>
		430
		431	This serialiser creates JSON arrays - you have to make sure the L<JSON>
		432	module is installed for this serialiser to work. It can be beneficial for
		433	sharing when you preload the L<JSON> module in a template process.
		434
		435	L<JSON> (with L<JSON::XS> installed) is slower than the octet string
		436	serialiser, but usually much faster than L<Storable>, unless big chunks of
		437	binary data need to be transferred.
		438
		439	Implementation:
		440
		441	use JSON ();
		442	(
		443	sub { JSON::encode_json \@_ },
		444	sub { @{ JSON::decode_json shift } }
		445	)
		446
		447	=item storable - C<$AnyEvent::Fork::RPC::STORABLE_SERIALISER>
		448
		449	This serialiser uses L<Storable>, which means it has high chance of
		450	serialising just about anything you throw at it, at the cost of having
		451	very high overhead per operation. It also comes with perl.
		452
		453	Implementation:
		454
		455	use Storable ();
		456	(
		457	sub { Storable::freeze \@_ },
		458	sub { @{ Storable::thaw shift } }
		459	)
		460
260	=back	461	=back
261		462
		463	=back
		464
		465	See the examples section earlier in this document for some actual
		466	examples.
		467
262	=cut	468	=cut
263		469
264	our $STRING_SERIALISER = '(sub { pack "(w/a)", @_ }, sub { unpack "(w/a)", shift })';	470	our $STRING_SERIALISER = '(sub { pack "(w/a)", @_ }, sub { unpack "(w/a)", shift })';
		471	our $JSON_SERIALISER = 'use JSON (); (sub { JSON::encode_json \@_ }, sub { @{ JSON::decode_json shift } })';
		472	our $STORABLE_SERIALISER = 'use Storable (); (sub { Storable::freeze \@_ }, sub { @{ Storable::thaw shift } })';
265		473
266	sub run {	474	sub run {
267	my ($self, $function, %arg) = @_;	475	my ($self, $function, %arg) = @_;
268		476
269	my $serialiser = delete $arg{serialiser} \|\| $STRING_SERIALISER;	477	my $serialiser = delete $arg{serialiser} \|\| $STRING_SERIALISER;
…		…
279	# default for on_event is to raise an error	487	# default for on_event is to raise an error
280	$on_event \|\|= sub { $on_error->("event received, but no on_event handler") };	488	$on_event \|\|= sub { $on_error->("event received, but no on_event handler") };
281		489
282	my ($f, $t) = eval $serialiser; die $@ if $@;	490	my ($f, $t) = eval $serialiser; die $@ if $@;
283		491
284	my (@rcb, $fh, $shutdown, $wbuf, $ww, $rw);	492	my (@rcb, %rcb, $fh, $shutdown, $wbuf, $ww);
285	my ($rlen, $rbuf) = 512 - 16;	493	my ($rlen, $rbuf, $rw) = 512 - 16;
286		494
287	my $wcb = sub {	495	my $wcb = sub {
288	my $len = syswrite $fh, $wbuf;	496	my $len = syswrite $fh, $wbuf;
289		497
290	if (!defined $len) {	498	unless (defined $len) {
291	if ($! != Errno::EAGAIN && $! != Errno::EWOULDBLOCK) {	499	if ($! != Errno::EAGAIN && $! != Errno::EWOULDBLOCK) {
292	undef $rw; undef $ww; # it ends here	500	undef $rw; undef $ww; # it ends here
293	$on_error->("$!");	501	$on_error->("$!");
294	}	502	}
295	}	503	}
…		…
306		514
307	$self->require ($module)	515	$self->require ($module)
308	->send_arg ($function, $arg{init}, $serialiser)	516	->send_arg ($function, $arg{init}, $serialiser)
309	->run ("$module\::run", sub {	517	->run ("$module\::run", sub {
310	$fh = shift;	518	$fh = shift;
		519
		520	my ($id, $len);
311	$rw = AE::io $fh, 0, sub {	521	$rw = AE::io $fh, 0, sub {
312	$rlen = $rlen * 2 + 16 if $rlen - 128 < length $rbuf;	522	$rlen = $rlen * 2 + 16 if $rlen - 128 < length $rbuf;
313	my $len = sysread $fh, $rbuf, $rlen - length $rbuf, length $rbuf;	523	$len = sysread $fh, $rbuf, $rlen - length $rbuf, length $rbuf;
314		524
315	if ($len) {	525	if ($len) {
316	while (4 <= length $rbuf) {	526	while (8 <= length $rbuf) {
317	$len = unpack "L", $rbuf;	527	($id, $len) = unpack "LL", $rbuf;
318	4 + $len <= length $rbuf	528	8 + $len <= length $rbuf
319	or last;	529	or last;
320		530
321	my @r = $t->(substr $rbuf, 4, $len);	531	my @r = $t->(substr $rbuf, 8, $len);
322	substr $rbuf, 0, $len + 4, "";	532	substr $rbuf, 0, 8 + $len, "";
		533
		534	if ($id) {
		535	if (@rcb) {
		536	(shift @rcb)->(@r);
		537	} elsif (my $cb = delete $rcb{$id}) {
		538	$cb->(@r);
		539	} else {
		540	undef $rw; undef $ww;
		541	$on_error->("unexpected data from child");
323		542	}
324	if (pop @r) {	543	} else {
325	$on_event->(@r);	544	$on_event->(@r);
326	} elsif (@rcb) {
327	(shift @rcb)->(@r);
328	} else {
329	undef $rw; undef $ww;
330	$on_error->("unexpected data from child");
331	}	545	}
332	}	546	}
333	} elsif (defined $len) {	547	} elsif (defined $len) {
334	undef $rw; undef $ww; # it ends here	548	undef $rw; undef $ww; # it ends here
335		549
336	if (@rcb) {	550	if (@rcb \|\| %rcb) {
337	$on_error->("unexpected eof");	551	$on_error->("unexpected eof");
338	} else {	552	} else {
339	$on_destroy->();	553	$on_destroy->();
340	}	554	}
341	} elsif ($! != Errno::EAGAIN && $! != Errno::EWOULDBLOCK) {	555	} elsif ($! != Errno::EAGAIN && $! != Errno::EWOULDBLOCK) {
…		…
350	my $guard = Guard::guard {	564	my $guard = Guard::guard {
351	$shutdown = 1;	565	$shutdown = 1;
352	$ww \|\|= $fh && AE::io $fh, 1, $wcb;	566	$ww \|\|= $fh && AE::io $fh, 1, $wcb;
353	};	567	};
354		568
		569	my $id;
		570
		571	$arg{async}
355	sub {	572	? sub {
356	push @rcb, pop;	573	$id = ($id == 0xffffffff ? 0 : $id) + 1;
		574	$id = ($id == 0xffffffff ? 0 : $id) + 1 while exists $rcb{$id}; # rarely loops
357		575
		576	$rcb{$id} = pop;
		577
358	$guard; # keep it alive	578	$guard; # keep it alive
359		579
360	$wbuf .= pack "L/a*", &$f;	580	$wbuf .= pack "LL/a*", $id, &$f;
361	$ww \|\|= $fh && AE::io $fh, 1, $wcb;	581	$ww \|\|= $fh && AE::io $fh, 1, $wcb;
362	}	582	}
		583	: sub {
		584	push @rcb, pop;
		585
		586	$guard; # keep it alive
		587
		588	$wbuf .= pack "L/a*", &$f;
		589	$ww \|\|= $fh && AE::io $fh, 1, $wcb;
		590	}
363	}	591	}
364		592
365	=item $rpc->(..., $cb->(...))	593	=item $rpc->(..., $cb->(...))
366		594
367	The RPC object returned by C<AnyEvent::Fork::RPC::run> is actually a code	595	The RPC object returned by C<AnyEvent::Fork::RPC::run> is actually a code
…		…
382		610
383	The other thing that can be done with the RPC object is to destroy it. In	611	The other thing that can be done with the RPC object is to destroy it. In
384	this case, the child process will execute all remaining RPC calls, report	612	this case, the child process will execute all remaining RPC calls, report
385	their results, and then exit.	613	their results, and then exit.
386		614
		615	See the examples section earlier in this document for some actual
		616	examples.
		617
387	=back	618	=back
388		619
389	=head1 CHILD PROCESS USAGE	620	=head1 CHILD PROCESS USAGE
390		621
391	The following function is not available in this module. They are only	622	The following function is not available in this module. They are only
…		…
399		630
400	Send an event to the parent. Events are a bit like RPC calls made by the	631	Send an event to the parent. Events are a bit like RPC calls made by the
401	child process to the parent, except that there is no notion of return	632	child process to the parent, except that there is no notion of return
402	values.	633	values.
403		634
		635	See the examples section earlier in this document for some actual
		636	examples.
		637
404	=back	638	=back
405		639
		640	=head1 ADVANCED TOPICS
		641
		642	=head2 Choosing a backend
		643
		644	So how do you decide which backend to use? Well, that's your problem to
		645	solve, but here are some thoughts on the matter:
		646
		647	=over 4
		648
		649	=item Synchronous
		650
		651	The synchronous backend does not rely on any external modules (well,
		652	except L<common::sense>, which works around a bug in how perl's warning
		653	system works). This keeps the process very small, for example, on my
		654	system, an empty perl interpreter uses 1492kB RSS, which becomes 2020kB
		655	after C<use warnings; use strict> (for people who grew up with C64s around
		656	them this is probably shocking every single time they see it). The worker
		657	process in the first example in this document uses 1792kB.
		658
		659	Since the calls are done synchronously, slow jobs will keep newer jobs
		660	from executing.
		661
		662	The synchronous backend also has no overhead due to running an event loop
		663	- reading requests is therefore very efficient, while writing responses is
		664	less so, as every response results in a write syscall.
		665
		666	If the parent process is busy and a bit slow reading responses, the child
		667	waits instead of processing further requests. This also limits the amount
		668	of memory needed for buffering, as never more than one response has to be
		669	buffered.
		670
		671	The API in the child is simple - you just have to define a function that
		672	does something and returns something.
		673
		674	It's hard to use modules or code that relies on an event loop, as the
		675	child cannot execute anything while it waits for more input.
		676
		677	=item Asynchronous
		678
		679	The asynchronous backend relies on L<AnyEvent>, which tries to be small,
		680	but still comes at a price: On my system, the worker from example 1a uses
		681	3420kB RSS (for L<AnyEvent>, which loads L<EV>, which needs L<XSLoader>
		682	which in turn loads a lot of other modules such as L<warnings>, L<strict>,
		683	L<vars>, L<Exporter>...).
		684
		685	It batches requests and responses reasonably efficiently, doing only as
		686	few reads and writes as needed, but needs to poll for events via the event
		687	loop.
		688
		689	Responses are queued when the parent process is busy. This means the child
		690	can continue to execute any queued requests. It also means that a child
		691	might queue a lot of responses in memory when it generates them and the
		692	parent process is slow accepting them.
		693
		694	The API is not a straightforward RPC pattern - you have to call a
		695	"done" callback to pass return values and signal completion. Also, more
		696	importantly, the API starts jobs as fast as possible - when 1000 jobs
		697	are queued and the jobs are slow, they will all run concurrently. The
		698	child must implement some queueing/limiting mechanism if this causes
		699	problems. Alternatively, the parent could limit the amount of rpc calls
		700	that are outstanding.
		701
		702	Blocking use of condvars is not supported.
		703
		704	Using event-based modules such as L<IO::AIO>, L<Gtk2>, L<Tk> and so on is
		705	easy.
		706
		707	=back
		708
		709	=head2 Passing file descriptors
		710
		711	Unlike L<AnyEvent::Fork>, this module has no in-built file handle or file
		712	descriptor passing abilities.
		713
		714	The reason is that passing file descriptors is extraordinary tricky
		715	business, and conflicts with efficient batching of messages.
		716
		717	There still is a method you can use: Create a
		718	C<AnyEvent::Util::portable_socketpair> and C<send_fh> one half of it to
		719	the process before you pass control to C<AnyEvent::Fork::RPC::run>.
		720
		721	Whenever you want to pass a file descriptor, send an rpc request to the
		722	child process (so it expects the descriptor), then send it over the other
		723	half of the socketpair. The child should fetch the descriptor from the
		724	half it has passed earlier.
		725
		726	Here is some (untested) pseudocode to that effect:
		727
		728	use AnyEvent::Util;
		729	use AnyEvent::Fork::RPC;
		730	use IO::FDPass;
		731
		732	my ($s1, $s2) = AnyEvent::Util::portable_socketpair;
		733
		734	my $rpc = AnyEvent::Fork
		735	->new
		736	->send_fh ($s2)
		737	->require ("MyWorker")
		738	->AnyEvent::Fork::RPC::run ("MyWorker::run"
		739	init => "MyWorker::init",
		740	);
		741
		742	undef $s2; # no need to keep it around
		743
		744	# pass an fd
		745	$rpc->("i'll send some fd now, please expect it!", my $cv = AE::cv);
		746
		747	IO::FDPass fileno $s1, fileno $handle_to_pass;
		748
		749	$cv->recv;
		750
		751	The MyWorker module could look like this:
		752
		753	package MyWorker;
		754
		755	use IO::FDPass;
		756
		757	my $s2;
		758
		759	sub init {
		760	$s2 = $_[0];
		761	}
		762
		763	sub run {
		764	if ($_[0] eq "i'll send some fd now, please expect it!") {
		765	my $fd = IO::FDPass::recv fileno $s2;
		766	...
		767	}
		768	}
		769
		770	Of course, this might be blocking if you pass a lot of file descriptors,
		771	so you might want to look into L<AnyEvent::FDpasser> which can handle the
		772	gory details.
		773
406	=head1 SEE ALSO	774	=head1 SEE ALSO
407		775
408	L<AnyEvent::Fork> (to create the processes in the first place),	776	L<AnyEvent::Fork>, to create the processes in the first place.
		777
409	L<AnyEvent::Fork::Pool> (to manage whole pools of processes).	778	L<AnyEvent::Fork::Pool>, to manage whole pools of processes.
410		779
411	=head1 AUTHOR AND CONTACT INFORMATION	780	=head1 AUTHOR AND CONTACT INFORMATION
412		781
413	Marc Lehmann <schmorp@schmorp.de>	782	Marc Lehmann <schmorp@schmorp.de>
414	http://software.schmorp.de/pkg/AnyEvent-Fork-RPC	783	http://software.schmorp.de/pkg/AnyEvent-Fork-RPC

Diff Legend

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

Comparing AnyEvent-Fork-RPC/RPC.pm (file contents): Revision 1.7 by root, Wed Apr 17 20:19:41 2013 UTC vs. Revision 1.16 by root, Thu Apr 18 14:07:15 2013 UTC

Diff Legend

Comparing AnyEvent-Fork-RPC/RPC.pm (file contents):
Revision 1.7 by root, Wed Apr 17 20:19:41 2013 UTC vs.
Revision 1.16 by root, Thu Apr 18 14:07:15 2013 UTC